1 /* Language-independent node constructors for parse phase of GNU compiler.
2 Copyright (C) 1987-2016 Free Software Foundation, Inc.
4 This file is part of GCC.
6 GCC is free software; you can redistribute it and/or modify it under
7 the terms of the GNU General Public License as published by the Free
8 Software Foundation; either version 3, or (at your option) any later
11 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
12 WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
16 You should have received a copy of the GNU General Public License
17 along with GCC; see the file COPYING3. If not see
18 <http://www.gnu.org/licenses/>. */
20 /* This file contains the low level primitives for operating on tree nodes,
21 including allocation, list operations, interning of identifiers,
22 construction of data type nodes and statement nodes,
23 and construction of type conversion nodes. It also contains
24 tables index by tree code that describe how to take apart
27 It is intended to be language-independent but can occasionally
28 calls language-dependent routines. */
32 #include "coretypes.h"
37 #include "tree-pass.h"
40 #include "diagnostic.h"
43 #include "fold-const.h"
44 #include "stor-layout.h"
47 #include "toplev.h" /* get_random_seed */
49 #include "common/common-target.h"
50 #include "langhooks.h"
51 #include "tree-inline.h"
52 #include "tree-iterator.h"
53 #include "internal-fn.h"
54 #include "gimple-iterator.h"
58 #include "langhooks-def.h"
59 #include "tree-diagnostic.h"
62 #include "print-tree.h"
63 #include "ipa-utils.h"
66 /* Tree code classes. */
68 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) TYPE,
69 #define END_OF_BASE_TREE_CODES tcc_exceptional,
71 const enum tree_code_class tree_code_type
[] = {
72 #include "all-tree.def"
76 #undef END_OF_BASE_TREE_CODES
78 /* Table indexed by tree code giving number of expression
79 operands beyond the fixed part of the node structure.
80 Not used for types or decls. */
82 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) LENGTH,
83 #define END_OF_BASE_TREE_CODES 0,
85 const unsigned char tree_code_length
[] = {
86 #include "all-tree.def"
90 #undef END_OF_BASE_TREE_CODES
92 /* Names of tree components.
93 Used for printing out the tree and error messages. */
94 #define DEFTREECODE(SYM, NAME, TYPE, LEN) NAME,
95 #define END_OF_BASE_TREE_CODES "@dummy",
97 static const char *const tree_code_name
[] = {
98 #include "all-tree.def"
102 #undef END_OF_BASE_TREE_CODES
104 /* Each tree code class has an associated string representation.
105 These must correspond to the tree_code_class entries. */
107 const char *const tree_code_class_strings
[] =
122 /* obstack.[ch] explicitly declined to prototype this. */
123 extern int _obstack_allocated_p (struct obstack
*h
, void *obj
);
125 /* Statistics-gathering stuff. */
127 static int tree_code_counts
[MAX_TREE_CODES
];
128 int tree_node_counts
[(int) all_kinds
];
129 int tree_node_sizes
[(int) all_kinds
];
131 /* Keep in sync with tree.h:enum tree_node_kind. */
132 static const char * const tree_node_kind_names
[] = {
151 /* Unique id for next decl created. */
152 static GTY(()) int next_decl_uid
;
153 /* Unique id for next type created. */
154 static GTY(()) int next_type_uid
= 1;
155 /* Unique id for next debug decl created. Use negative numbers,
156 to catch erroneous uses. */
157 static GTY(()) int next_debug_decl_uid
;
159 /* Since we cannot rehash a type after it is in the table, we have to
160 keep the hash code. */
162 struct GTY((for_user
)) type_hash
{
167 /* Initial size of the hash table (rounded to next prime). */
168 #define TYPE_HASH_INITIAL_SIZE 1000
170 struct type_cache_hasher
: ggc_cache_ptr_hash
<type_hash
>
172 static hashval_t
hash (type_hash
*t
) { return t
->hash
; }
173 static bool equal (type_hash
*a
, type_hash
*b
);
176 keep_cache_entry (type_hash
*&t
)
178 return ggc_marked_p (t
->type
);
182 /* Now here is the hash table. When recording a type, it is added to
183 the slot whose index is the hash code. Note that the hash table is
184 used for several kinds of types (function types, array types and
185 array index range types, for now). While all these live in the
186 same table, they are completely independent, and the hash code is
187 computed differently for each of these. */
189 static GTY ((cache
)) hash_table
<type_cache_hasher
> *type_hash_table
;
191 /* Hash table and temporary node for larger integer const values. */
192 static GTY (()) tree int_cst_node
;
194 struct int_cst_hasher
: ggc_cache_ptr_hash
<tree_node
>
196 static hashval_t
hash (tree t
);
197 static bool equal (tree x
, tree y
);
200 static GTY ((cache
)) hash_table
<int_cst_hasher
> *int_cst_hash_table
;
202 /* Hash table for optimization flags and target option flags. Use the same
203 hash table for both sets of options. Nodes for building the current
204 optimization and target option nodes. The assumption is most of the time
205 the options created will already be in the hash table, so we avoid
206 allocating and freeing up a node repeatably. */
207 static GTY (()) tree cl_optimization_node
;
208 static GTY (()) tree cl_target_option_node
;
210 struct cl_option_hasher
: ggc_cache_ptr_hash
<tree_node
>
212 static hashval_t
hash (tree t
);
213 static bool equal (tree x
, tree y
);
216 static GTY ((cache
)) hash_table
<cl_option_hasher
> *cl_option_hash_table
;
218 /* General tree->tree mapping structure for use in hash tables. */
222 hash_table
<tree_decl_map_cache_hasher
> *debug_expr_for_decl
;
225 hash_table
<tree_decl_map_cache_hasher
> *value_expr_for_decl
;
227 struct tree_vec_map_cache_hasher
: ggc_cache_ptr_hash
<tree_vec_map
>
229 static hashval_t
hash (tree_vec_map
*m
) { return DECL_UID (m
->base
.from
); }
232 equal (tree_vec_map
*a
, tree_vec_map
*b
)
234 return a
->base
.from
== b
->base
.from
;
238 keep_cache_entry (tree_vec_map
*&m
)
240 return ggc_marked_p (m
->base
.from
);
245 hash_table
<tree_vec_map_cache_hasher
> *debug_args_for_decl
;
247 static void set_type_quals (tree
, int);
248 static void print_type_hash_statistics (void);
249 static void print_debug_expr_statistics (void);
250 static void print_value_expr_statistics (void);
251 static void type_hash_list (const_tree
, inchash::hash
&);
252 static void attribute_hash_list (const_tree
, inchash::hash
&);
254 tree global_trees
[TI_MAX
];
255 tree integer_types
[itk_none
];
257 bool int_n_enabled_p
[NUM_INT_N_ENTS
];
258 struct int_n_trees_t int_n_trees
[NUM_INT_N_ENTS
];
260 unsigned char tree_contains_struct
[MAX_TREE_CODES
][64];
262 /* Number of operands for each OpenMP clause. */
263 unsigned const char omp_clause_num_ops
[] =
265 0, /* OMP_CLAUSE_ERROR */
266 1, /* OMP_CLAUSE_PRIVATE */
267 1, /* OMP_CLAUSE_SHARED */
268 1, /* OMP_CLAUSE_FIRSTPRIVATE */
269 2, /* OMP_CLAUSE_LASTPRIVATE */
270 5, /* OMP_CLAUSE_REDUCTION */
271 1, /* OMP_CLAUSE_COPYIN */
272 1, /* OMP_CLAUSE_COPYPRIVATE */
273 3, /* OMP_CLAUSE_LINEAR */
274 2, /* OMP_CLAUSE_ALIGNED */
275 1, /* OMP_CLAUSE_DEPEND */
276 1, /* OMP_CLAUSE_UNIFORM */
277 1, /* OMP_CLAUSE_TO_DECLARE */
278 1, /* OMP_CLAUSE_LINK */
279 2, /* OMP_CLAUSE_FROM */
280 2, /* OMP_CLAUSE_TO */
281 2, /* OMP_CLAUSE_MAP */
282 1, /* OMP_CLAUSE_USE_DEVICE_PTR */
283 1, /* OMP_CLAUSE_IS_DEVICE_PTR */
284 2, /* OMP_CLAUSE__CACHE_ */
285 2, /* OMP_CLAUSE_GANG */
286 1, /* OMP_CLAUSE_ASYNC */
287 1, /* OMP_CLAUSE_WAIT */
288 0, /* OMP_CLAUSE_AUTO */
289 0, /* OMP_CLAUSE_SEQ */
290 1, /* OMP_CLAUSE__LOOPTEMP_ */
291 1, /* OMP_CLAUSE_IF */
292 1, /* OMP_CLAUSE_NUM_THREADS */
293 1, /* OMP_CLAUSE_SCHEDULE */
294 0, /* OMP_CLAUSE_NOWAIT */
295 1, /* OMP_CLAUSE_ORDERED */
296 0, /* OMP_CLAUSE_DEFAULT */
297 3, /* OMP_CLAUSE_COLLAPSE */
298 0, /* OMP_CLAUSE_UNTIED */
299 1, /* OMP_CLAUSE_FINAL */
300 0, /* OMP_CLAUSE_MERGEABLE */
301 1, /* OMP_CLAUSE_DEVICE */
302 1, /* OMP_CLAUSE_DIST_SCHEDULE */
303 0, /* OMP_CLAUSE_INBRANCH */
304 0, /* OMP_CLAUSE_NOTINBRANCH */
305 1, /* OMP_CLAUSE_NUM_TEAMS */
306 1, /* OMP_CLAUSE_THREAD_LIMIT */
307 0, /* OMP_CLAUSE_PROC_BIND */
308 1, /* OMP_CLAUSE_SAFELEN */
309 1, /* OMP_CLAUSE_SIMDLEN */
310 0, /* OMP_CLAUSE_FOR */
311 0, /* OMP_CLAUSE_PARALLEL */
312 0, /* OMP_CLAUSE_SECTIONS */
313 0, /* OMP_CLAUSE_TASKGROUP */
314 1, /* OMP_CLAUSE_PRIORITY */
315 1, /* OMP_CLAUSE_GRAINSIZE */
316 1, /* OMP_CLAUSE_NUM_TASKS */
317 0, /* OMP_CLAUSE_NOGROUP */
318 0, /* OMP_CLAUSE_THREADS */
319 0, /* OMP_CLAUSE_SIMD */
320 1, /* OMP_CLAUSE_HINT */
321 0, /* OMP_CLAUSE_DEFALTMAP */
322 1, /* OMP_CLAUSE__SIMDUID_ */
323 1, /* OMP_CLAUSE__CILK_FOR_COUNT_ */
324 0, /* OMP_CLAUSE_INDEPENDENT */
325 1, /* OMP_CLAUSE_WORKER */
326 1, /* OMP_CLAUSE_VECTOR */
327 1, /* OMP_CLAUSE_NUM_GANGS */
328 1, /* OMP_CLAUSE_NUM_WORKERS */
329 1, /* OMP_CLAUSE_VECTOR_LENGTH */
330 1, /* OMP_CLAUSE_TILE */
331 2, /* OMP_CLAUSE__GRIDDIM_ */
334 const char * const omp_clause_code_name
[] =
406 /* Return the tree node structure used by tree code CODE. */
408 static inline enum tree_node_structure_enum
409 tree_node_structure_for_code (enum tree_code code
)
411 switch (TREE_CODE_CLASS (code
))
413 case tcc_declaration
:
418 return TS_FIELD_DECL
;
424 return TS_LABEL_DECL
;
426 return TS_RESULT_DECL
;
427 case DEBUG_EXPR_DECL
:
430 return TS_CONST_DECL
;
434 return TS_FUNCTION_DECL
;
435 case TRANSLATION_UNIT_DECL
:
436 return TS_TRANSLATION_UNIT_DECL
;
438 return TS_DECL_NON_COMMON
;
442 return TS_TYPE_NON_COMMON
;
451 default: /* tcc_constant and tcc_exceptional */
456 /* tcc_constant cases. */
457 case VOID_CST
: return TS_TYPED
;
458 case INTEGER_CST
: return TS_INT_CST
;
459 case REAL_CST
: return TS_REAL_CST
;
460 case FIXED_CST
: return TS_FIXED_CST
;
461 case COMPLEX_CST
: return TS_COMPLEX
;
462 case VECTOR_CST
: return TS_VECTOR
;
463 case STRING_CST
: return TS_STRING
;
464 /* tcc_exceptional cases. */
465 case ERROR_MARK
: return TS_COMMON
;
466 case IDENTIFIER_NODE
: return TS_IDENTIFIER
;
467 case TREE_LIST
: return TS_LIST
;
468 case TREE_VEC
: return TS_VEC
;
469 case SSA_NAME
: return TS_SSA_NAME
;
470 case PLACEHOLDER_EXPR
: return TS_COMMON
;
471 case STATEMENT_LIST
: return TS_STATEMENT_LIST
;
472 case BLOCK
: return TS_BLOCK
;
473 case CONSTRUCTOR
: return TS_CONSTRUCTOR
;
474 case TREE_BINFO
: return TS_BINFO
;
475 case OMP_CLAUSE
: return TS_OMP_CLAUSE
;
476 case OPTIMIZATION_NODE
: return TS_OPTIMIZATION
;
477 case TARGET_OPTION_NODE
: return TS_TARGET_OPTION
;
485 /* Initialize tree_contains_struct to describe the hierarchy of tree
489 initialize_tree_contains_struct (void)
493 for (i
= ERROR_MARK
; i
< LAST_AND_UNUSED_TREE_CODE
; i
++)
496 enum tree_node_structure_enum ts_code
;
498 code
= (enum tree_code
) i
;
499 ts_code
= tree_node_structure_for_code (code
);
501 /* Mark the TS structure itself. */
502 tree_contains_struct
[code
][ts_code
] = 1;
504 /* Mark all the structures that TS is derived from. */
522 case TS_STATEMENT_LIST
:
523 MARK_TS_TYPED (code
);
527 case TS_DECL_MINIMAL
:
533 case TS_OPTIMIZATION
:
534 case TS_TARGET_OPTION
:
535 MARK_TS_COMMON (code
);
538 case TS_TYPE_WITH_LANG_SPECIFIC
:
539 MARK_TS_TYPE_COMMON (code
);
542 case TS_TYPE_NON_COMMON
:
543 MARK_TS_TYPE_WITH_LANG_SPECIFIC (code
);
547 MARK_TS_DECL_MINIMAL (code
);
552 MARK_TS_DECL_COMMON (code
);
555 case TS_DECL_NON_COMMON
:
556 MARK_TS_DECL_WITH_VIS (code
);
559 case TS_DECL_WITH_VIS
:
563 MARK_TS_DECL_WRTL (code
);
567 MARK_TS_DECL_COMMON (code
);
571 MARK_TS_DECL_WITH_VIS (code
);
575 case TS_FUNCTION_DECL
:
576 MARK_TS_DECL_NON_COMMON (code
);
579 case TS_TRANSLATION_UNIT_DECL
:
580 MARK_TS_DECL_COMMON (code
);
588 /* Basic consistency checks for attributes used in fold. */
589 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_NON_COMMON
]);
590 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_NON_COMMON
]);
591 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_DECL_COMMON
]);
592 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_COMMON
]);
593 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_COMMON
]);
594 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_COMMON
]);
595 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_COMMON
]);
596 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_COMMON
]);
597 gcc_assert (tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_COMMON
]);
598 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_COMMON
]);
599 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_DECL_COMMON
]);
600 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_WRTL
]);
601 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_WRTL
]);
602 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_WRTL
]);
603 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WRTL
]);
604 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_WRTL
]);
605 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_DECL_MINIMAL
]);
606 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_MINIMAL
]);
607 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_MINIMAL
]);
608 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_MINIMAL
]);
609 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_MINIMAL
]);
610 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_MINIMAL
]);
611 gcc_assert (tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_MINIMAL
]);
612 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_MINIMAL
]);
613 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_DECL_MINIMAL
]);
614 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_WITH_VIS
]);
615 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WITH_VIS
]);
616 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_WITH_VIS
]);
617 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_VAR_DECL
]);
618 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_FIELD_DECL
]);
619 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_PARM_DECL
]);
620 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_LABEL_DECL
]);
621 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_RESULT_DECL
]);
622 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_CONST_DECL
]);
623 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_TYPE_DECL
]);
624 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_FUNCTION_DECL
]);
625 gcc_assert (tree_contains_struct
[IMPORTED_DECL
][TS_DECL_MINIMAL
]);
626 gcc_assert (tree_contains_struct
[IMPORTED_DECL
][TS_DECL_COMMON
]);
627 gcc_assert (tree_contains_struct
[NAMELIST_DECL
][TS_DECL_MINIMAL
]);
628 gcc_assert (tree_contains_struct
[NAMELIST_DECL
][TS_DECL_COMMON
]);
637 /* Initialize the hash table of types. */
639 = hash_table
<type_cache_hasher
>::create_ggc (TYPE_HASH_INITIAL_SIZE
);
642 = hash_table
<tree_decl_map_cache_hasher
>::create_ggc (512);
645 = hash_table
<tree_decl_map_cache_hasher
>::create_ggc (512);
647 int_cst_hash_table
= hash_table
<int_cst_hasher
>::create_ggc (1024);
649 int_cst_node
= make_int_cst (1, 1);
651 cl_option_hash_table
= hash_table
<cl_option_hasher
>::create_ggc (64);
653 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
654 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
656 /* Initialize the tree_contains_struct array. */
657 initialize_tree_contains_struct ();
658 lang_hooks
.init_ts ();
662 /* The name of the object as the assembler will see it (but before any
663 translations made by ASM_OUTPUT_LABELREF). Often this is the same
664 as DECL_NAME. It is an IDENTIFIER_NODE. */
666 decl_assembler_name (tree decl
)
668 if (!DECL_ASSEMBLER_NAME_SET_P (decl
))
669 lang_hooks
.set_decl_assembler_name (decl
);
670 return DECL_WITH_VIS_CHECK (decl
)->decl_with_vis
.assembler_name
;
673 /* When the target supports COMDAT groups, this indicates which group the
674 DECL is associated with. This can be either an IDENTIFIER_NODE or a
675 decl, in which case its DECL_ASSEMBLER_NAME identifies the group. */
677 decl_comdat_group (const_tree node
)
679 struct symtab_node
*snode
= symtab_node::get (node
);
682 return snode
->get_comdat_group ();
685 /* Likewise, but make sure it's been reduced to an IDENTIFIER_NODE. */
687 decl_comdat_group_id (const_tree node
)
689 struct symtab_node
*snode
= symtab_node::get (node
);
692 return snode
->get_comdat_group_id ();
695 /* When the target supports named section, return its name as IDENTIFIER_NODE
696 or NULL if it is in no section. */
698 decl_section_name (const_tree node
)
700 struct symtab_node
*snode
= symtab_node::get (node
);
703 return snode
->get_section ();
706 /* Set section name of NODE to VALUE (that is expected to be
709 set_decl_section_name (tree node
, const char *value
)
711 struct symtab_node
*snode
;
715 snode
= symtab_node::get (node
);
719 else if (TREE_CODE (node
) == VAR_DECL
)
720 snode
= varpool_node::get_create (node
);
722 snode
= cgraph_node::get_create (node
);
723 snode
->set_section (value
);
726 /* Return TLS model of a variable NODE. */
728 decl_tls_model (const_tree node
)
730 struct varpool_node
*snode
= varpool_node::get (node
);
732 return TLS_MODEL_NONE
;
733 return snode
->tls_model
;
736 /* Set TLS model of variable NODE to MODEL. */
738 set_decl_tls_model (tree node
, enum tls_model model
)
740 struct varpool_node
*vnode
;
742 if (model
== TLS_MODEL_NONE
)
744 vnode
= varpool_node::get (node
);
749 vnode
= varpool_node::get_create (node
);
750 vnode
->tls_model
= model
;
753 /* Compute the number of bytes occupied by a tree with code CODE.
754 This function cannot be used for nodes that have variable sizes,
755 including TREE_VEC, INTEGER_CST, STRING_CST, and CALL_EXPR. */
757 tree_code_size (enum tree_code code
)
759 switch (TREE_CODE_CLASS (code
))
761 case tcc_declaration
: /* A decl node */
766 return sizeof (struct tree_field_decl
);
768 return sizeof (struct tree_parm_decl
);
770 return sizeof (struct tree_var_decl
);
772 return sizeof (struct tree_label_decl
);
774 return sizeof (struct tree_result_decl
);
776 return sizeof (struct tree_const_decl
);
778 return sizeof (struct tree_type_decl
);
780 return sizeof (struct tree_function_decl
);
781 case DEBUG_EXPR_DECL
:
782 return sizeof (struct tree_decl_with_rtl
);
783 case TRANSLATION_UNIT_DECL
:
784 return sizeof (struct tree_translation_unit_decl
);
788 return sizeof (struct tree_decl_non_common
);
790 return lang_hooks
.tree_size (code
);
794 case tcc_type
: /* a type node */
795 return sizeof (struct tree_type_non_common
);
797 case tcc_reference
: /* a reference */
798 case tcc_expression
: /* an expression */
799 case tcc_statement
: /* an expression with side effects */
800 case tcc_comparison
: /* a comparison expression */
801 case tcc_unary
: /* a unary arithmetic expression */
802 case tcc_binary
: /* a binary arithmetic expression */
803 return (sizeof (struct tree_exp
)
804 + (TREE_CODE_LENGTH (code
) - 1) * sizeof (tree
));
806 case tcc_constant
: /* a constant */
809 case VOID_CST
: return sizeof (struct tree_typed
);
810 case INTEGER_CST
: gcc_unreachable ();
811 case REAL_CST
: return sizeof (struct tree_real_cst
);
812 case FIXED_CST
: return sizeof (struct tree_fixed_cst
);
813 case COMPLEX_CST
: return sizeof (struct tree_complex
);
814 case VECTOR_CST
: return sizeof (struct tree_vector
);
815 case STRING_CST
: gcc_unreachable ();
817 return lang_hooks
.tree_size (code
);
820 case tcc_exceptional
: /* something random, like an identifier. */
823 case IDENTIFIER_NODE
: return lang_hooks
.identifier_size
;
824 case TREE_LIST
: return sizeof (struct tree_list
);
827 case PLACEHOLDER_EXPR
: return sizeof (struct tree_common
);
830 case OMP_CLAUSE
: gcc_unreachable ();
832 case SSA_NAME
: return sizeof (struct tree_ssa_name
);
834 case STATEMENT_LIST
: return sizeof (struct tree_statement_list
);
835 case BLOCK
: return sizeof (struct tree_block
);
836 case CONSTRUCTOR
: return sizeof (struct tree_constructor
);
837 case OPTIMIZATION_NODE
: return sizeof (struct tree_optimization_option
);
838 case TARGET_OPTION_NODE
: return sizeof (struct tree_target_option
);
841 return lang_hooks
.tree_size (code
);
849 /* Compute the number of bytes occupied by NODE. This routine only
850 looks at TREE_CODE, except for those nodes that have variable sizes. */
852 tree_size (const_tree node
)
854 const enum tree_code code
= TREE_CODE (node
);
858 return (sizeof (struct tree_int_cst
)
859 + (TREE_INT_CST_EXT_NUNITS (node
) - 1) * sizeof (HOST_WIDE_INT
));
862 return (offsetof (struct tree_binfo
, base_binfos
)
864 ::embedded_size (BINFO_N_BASE_BINFOS (node
)));
867 return (sizeof (struct tree_vec
)
868 + (TREE_VEC_LENGTH (node
) - 1) * sizeof (tree
));
871 return (sizeof (struct tree_vector
)
872 + (TYPE_VECTOR_SUBPARTS (TREE_TYPE (node
)) - 1) * sizeof (tree
));
875 return TREE_STRING_LENGTH (node
) + offsetof (struct tree_string
, str
) + 1;
878 return (sizeof (struct tree_omp_clause
)
879 + (omp_clause_num_ops
[OMP_CLAUSE_CODE (node
)] - 1)
883 if (TREE_CODE_CLASS (code
) == tcc_vl_exp
)
884 return (sizeof (struct tree_exp
)
885 + (VL_EXP_OPERAND_LENGTH (node
) - 1) * sizeof (tree
));
887 return tree_code_size (code
);
891 /* Record interesting allocation statistics for a tree node with CODE
895 record_node_allocation_statistics (enum tree_code code ATTRIBUTE_UNUSED
,
896 size_t length ATTRIBUTE_UNUSED
)
898 enum tree_code_class type
= TREE_CODE_CLASS (code
);
901 if (!GATHER_STATISTICS
)
906 case tcc_declaration
: /* A decl node */
910 case tcc_type
: /* a type node */
914 case tcc_statement
: /* an expression with side effects */
918 case tcc_reference
: /* a reference */
922 case tcc_expression
: /* an expression */
923 case tcc_comparison
: /* a comparison expression */
924 case tcc_unary
: /* a unary arithmetic expression */
925 case tcc_binary
: /* a binary arithmetic expression */
929 case tcc_constant
: /* a constant */
933 case tcc_exceptional
: /* something random, like an identifier. */
936 case IDENTIFIER_NODE
:
949 kind
= ssa_name_kind
;
961 kind
= omp_clause_kind
;
978 tree_code_counts
[(int) code
]++;
979 tree_node_counts
[(int) kind
]++;
980 tree_node_sizes
[(int) kind
] += length
;
983 /* Allocate and return a new UID from the DECL_UID namespace. */
986 allocate_decl_uid (void)
988 return next_decl_uid
++;
991 /* Return a newly allocated node of code CODE. For decl and type
992 nodes, some other fields are initialized. The rest of the node is
993 initialized to zero. This function cannot be used for TREE_VEC,
994 INTEGER_CST or OMP_CLAUSE nodes, which is enforced by asserts in
997 Achoo! I got a code in the node. */
1000 make_node_stat (enum tree_code code MEM_STAT_DECL
)
1003 enum tree_code_class type
= TREE_CODE_CLASS (code
);
1004 size_t length
= tree_code_size (code
);
1006 record_node_allocation_statistics (code
, length
);
1008 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
1009 TREE_SET_CODE (t
, code
);
1014 TREE_SIDE_EFFECTS (t
) = 1;
1017 case tcc_declaration
:
1018 if (CODE_CONTAINS_STRUCT (code
, TS_DECL_COMMON
))
1020 if (code
== FUNCTION_DECL
)
1022 SET_DECL_ALIGN (t
, FUNCTION_BOUNDARY
);
1023 DECL_MODE (t
) = FUNCTION_MODE
;
1026 SET_DECL_ALIGN (t
, 1);
1028 DECL_SOURCE_LOCATION (t
) = input_location
;
1029 if (TREE_CODE (t
) == DEBUG_EXPR_DECL
)
1030 DECL_UID (t
) = --next_debug_decl_uid
;
1033 DECL_UID (t
) = allocate_decl_uid ();
1034 SET_DECL_PT_UID (t
, -1);
1036 if (TREE_CODE (t
) == LABEL_DECL
)
1037 LABEL_DECL_UID (t
) = -1;
1042 TYPE_UID (t
) = next_type_uid
++;
1043 SET_TYPE_ALIGN (t
, BITS_PER_UNIT
);
1044 TYPE_USER_ALIGN (t
) = 0;
1045 TYPE_MAIN_VARIANT (t
) = t
;
1046 TYPE_CANONICAL (t
) = t
;
1048 /* Default to no attributes for type, but let target change that. */
1049 TYPE_ATTRIBUTES (t
) = NULL_TREE
;
1050 targetm
.set_default_type_attributes (t
);
1052 /* We have not yet computed the alias set for this type. */
1053 TYPE_ALIAS_SET (t
) = -1;
1057 TREE_CONSTANT (t
) = 1;
1060 case tcc_expression
:
1066 case PREDECREMENT_EXPR
:
1067 case PREINCREMENT_EXPR
:
1068 case POSTDECREMENT_EXPR
:
1069 case POSTINCREMENT_EXPR
:
1070 /* All of these have side-effects, no matter what their
1072 TREE_SIDE_EFFECTS (t
) = 1;
1080 case tcc_exceptional
:
1083 case TARGET_OPTION_NODE
:
1084 TREE_TARGET_OPTION(t
)
1085 = ggc_cleared_alloc
<struct cl_target_option
> ();
1088 case OPTIMIZATION_NODE
:
1089 TREE_OPTIMIZATION (t
)
1090 = ggc_cleared_alloc
<struct cl_optimization
> ();
1099 /* Other classes need no special treatment. */
1106 /* Free tree node. */
1109 free_node (tree node
)
1111 enum tree_code code
= TREE_CODE (node
);
1112 if (GATHER_STATISTICS
)
1114 tree_code_counts
[(int) TREE_CODE (node
)]--;
1115 tree_node_counts
[(int) t_kind
]--;
1116 tree_node_sizes
[(int) t_kind
] -= tree_size (node
);
1118 if (CODE_CONTAINS_STRUCT (code
, TS_CONSTRUCTOR
))
1119 vec_free (CONSTRUCTOR_ELTS (node
));
1120 else if (code
== BLOCK
)
1121 vec_free (BLOCK_NONLOCALIZED_VARS (node
));
1122 else if (code
== TREE_BINFO
)
1123 vec_free (BINFO_BASE_ACCESSES (node
));
1127 /* Return a new node with the same contents as NODE except that its
1128 TREE_CHAIN, if it has one, is zero and it has a fresh uid. */
1131 copy_node_stat (tree node MEM_STAT_DECL
)
1134 enum tree_code code
= TREE_CODE (node
);
1137 gcc_assert (code
!= STATEMENT_LIST
);
1139 length
= tree_size (node
);
1140 record_node_allocation_statistics (code
, length
);
1141 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
1142 memcpy (t
, node
, length
);
1144 if (CODE_CONTAINS_STRUCT (code
, TS_COMMON
))
1146 TREE_ASM_WRITTEN (t
) = 0;
1147 TREE_VISITED (t
) = 0;
1149 if (TREE_CODE_CLASS (code
) == tcc_declaration
)
1151 if (code
== DEBUG_EXPR_DECL
)
1152 DECL_UID (t
) = --next_debug_decl_uid
;
1155 DECL_UID (t
) = allocate_decl_uid ();
1156 if (DECL_PT_UID_SET_P (node
))
1157 SET_DECL_PT_UID (t
, DECL_PT_UID (node
));
1159 if ((TREE_CODE (node
) == PARM_DECL
|| TREE_CODE (node
) == VAR_DECL
)
1160 && DECL_HAS_VALUE_EXPR_P (node
))
1162 SET_DECL_VALUE_EXPR (t
, DECL_VALUE_EXPR (node
));
1163 DECL_HAS_VALUE_EXPR_P (t
) = 1;
1165 /* DECL_DEBUG_EXPR is copied explicitely by callers. */
1166 if (TREE_CODE (node
) == VAR_DECL
)
1168 DECL_HAS_DEBUG_EXPR_P (t
) = 0;
1169 t
->decl_with_vis
.symtab_node
= NULL
;
1171 if (TREE_CODE (node
) == VAR_DECL
&& DECL_HAS_INIT_PRIORITY_P (node
))
1173 SET_DECL_INIT_PRIORITY (t
, DECL_INIT_PRIORITY (node
));
1174 DECL_HAS_INIT_PRIORITY_P (t
) = 1;
1176 if (TREE_CODE (node
) == FUNCTION_DECL
)
1178 DECL_STRUCT_FUNCTION (t
) = NULL
;
1179 t
->decl_with_vis
.symtab_node
= NULL
;
1182 else if (TREE_CODE_CLASS (code
) == tcc_type
)
1184 TYPE_UID (t
) = next_type_uid
++;
1185 /* The following is so that the debug code for
1186 the copy is different from the original type.
1187 The two statements usually duplicate each other
1188 (because they clear fields of the same union),
1189 but the optimizer should catch that. */
1190 TYPE_SYMTAB_POINTER (t
) = 0;
1191 TYPE_SYMTAB_ADDRESS (t
) = 0;
1193 /* Do not copy the values cache. */
1194 if (TYPE_CACHED_VALUES_P (t
))
1196 TYPE_CACHED_VALUES_P (t
) = 0;
1197 TYPE_CACHED_VALUES (t
) = NULL_TREE
;
1200 else if (code
== TARGET_OPTION_NODE
)
1202 TREE_TARGET_OPTION (t
) = ggc_alloc
<struct cl_target_option
>();
1203 memcpy (TREE_TARGET_OPTION (t
), TREE_TARGET_OPTION (node
),
1204 sizeof (struct cl_target_option
));
1206 else if (code
== OPTIMIZATION_NODE
)
1208 TREE_OPTIMIZATION (t
) = ggc_alloc
<struct cl_optimization
>();
1209 memcpy (TREE_OPTIMIZATION (t
), TREE_OPTIMIZATION (node
),
1210 sizeof (struct cl_optimization
));
1216 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
1217 For example, this can copy a list made of TREE_LIST nodes. */
1220 copy_list (tree list
)
1228 head
= prev
= copy_node (list
);
1229 next
= TREE_CHAIN (list
);
1232 TREE_CHAIN (prev
) = copy_node (next
);
1233 prev
= TREE_CHAIN (prev
);
1234 next
= TREE_CHAIN (next
);
1240 /* Return the value that TREE_INT_CST_EXT_NUNITS should have for an
1241 INTEGER_CST with value CST and type TYPE. */
1244 get_int_cst_ext_nunits (tree type
, const wide_int
&cst
)
1246 gcc_checking_assert (cst
.get_precision () == TYPE_PRECISION (type
));
1247 /* We need extra HWIs if CST is an unsigned integer with its
1249 if (TYPE_UNSIGNED (type
) && wi::neg_p (cst
))
1250 return cst
.get_precision () / HOST_BITS_PER_WIDE_INT
+ 1;
1251 return cst
.get_len ();
1254 /* Return a new INTEGER_CST with value CST and type TYPE. */
1257 build_new_int_cst (tree type
, const wide_int
&cst
)
1259 unsigned int len
= cst
.get_len ();
1260 unsigned int ext_len
= get_int_cst_ext_nunits (type
, cst
);
1261 tree nt
= make_int_cst (len
, ext_len
);
1266 TREE_INT_CST_ELT (nt
, ext_len
)
1267 = zext_hwi (-1, cst
.get_precision () % HOST_BITS_PER_WIDE_INT
);
1268 for (unsigned int i
= len
; i
< ext_len
; ++i
)
1269 TREE_INT_CST_ELT (nt
, i
) = -1;
1271 else if (TYPE_UNSIGNED (type
)
1272 && cst
.get_precision () < len
* HOST_BITS_PER_WIDE_INT
)
1275 TREE_INT_CST_ELT (nt
, len
)
1276 = zext_hwi (cst
.elt (len
),
1277 cst
.get_precision () % HOST_BITS_PER_WIDE_INT
);
1280 for (unsigned int i
= 0; i
< len
; i
++)
1281 TREE_INT_CST_ELT (nt
, i
) = cst
.elt (i
);
1282 TREE_TYPE (nt
) = type
;
1286 /* Create an INT_CST node with a LOW value sign extended to TYPE. */
1289 build_int_cst (tree type
, HOST_WIDE_INT low
)
1291 /* Support legacy code. */
1293 type
= integer_type_node
;
1295 return wide_int_to_tree (type
, wi::shwi (low
, TYPE_PRECISION (type
)));
1299 build_int_cstu (tree type
, unsigned HOST_WIDE_INT cst
)
1301 return wide_int_to_tree (type
, wi::uhwi (cst
, TYPE_PRECISION (type
)));
1304 /* Create an INT_CST node with a LOW value sign extended to TYPE. */
1307 build_int_cst_type (tree type
, HOST_WIDE_INT low
)
1310 return wide_int_to_tree (type
, wi::shwi (low
, TYPE_PRECISION (type
)));
1313 /* Constructs tree in type TYPE from with value given by CST. Signedness
1314 of CST is assumed to be the same as the signedness of TYPE. */
1317 double_int_to_tree (tree type
, double_int cst
)
1319 return wide_int_to_tree (type
, widest_int::from (cst
, TYPE_SIGN (type
)));
1322 /* We force the wide_int CST to the range of the type TYPE by sign or
1323 zero extending it. OVERFLOWABLE indicates if we are interested in
1324 overflow of the value, when >0 we are only interested in signed
1325 overflow, for <0 we are interested in any overflow. OVERFLOWED
1326 indicates whether overflow has already occurred. CONST_OVERFLOWED
1327 indicates whether constant overflow has already occurred. We force
1328 T's value to be within range of T's type (by setting to 0 or 1 all
1329 the bits outside the type's range). We set TREE_OVERFLOWED if,
1330 OVERFLOWED is nonzero,
1331 or OVERFLOWABLE is >0 and signed overflow occurs
1332 or OVERFLOWABLE is <0 and any overflow occurs
1333 We return a new tree node for the extended wide_int. The node
1334 is shared if no overflow flags are set. */
1338 force_fit_type (tree type
, const wide_int_ref
&cst
,
1339 int overflowable
, bool overflowed
)
1341 signop sign
= TYPE_SIGN (type
);
1343 /* If we need to set overflow flags, return a new unshared node. */
1344 if (overflowed
|| !wi::fits_to_tree_p (cst
, type
))
1348 || (overflowable
> 0 && sign
== SIGNED
))
1350 wide_int tmp
= wide_int::from (cst
, TYPE_PRECISION (type
), sign
);
1351 tree t
= build_new_int_cst (type
, tmp
);
1352 TREE_OVERFLOW (t
) = 1;
1357 /* Else build a shared node. */
1358 return wide_int_to_tree (type
, cst
);
1361 /* These are the hash table functions for the hash table of INTEGER_CST
1362 nodes of a sizetype. */
1364 /* Return the hash code X, an INTEGER_CST. */
1367 int_cst_hasher::hash (tree x
)
1369 const_tree
const t
= x
;
1370 hashval_t code
= TYPE_UID (TREE_TYPE (t
));
1373 for (i
= 0; i
< TREE_INT_CST_NUNITS (t
); i
++)
1374 code
= iterative_hash_host_wide_int (TREE_INT_CST_ELT(t
, i
), code
);
1379 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
1380 is the same as that given by *Y, which is the same. */
1383 int_cst_hasher::equal (tree x
, tree y
)
1385 const_tree
const xt
= x
;
1386 const_tree
const yt
= y
;
1388 if (TREE_TYPE (xt
) != TREE_TYPE (yt
)
1389 || TREE_INT_CST_NUNITS (xt
) != TREE_INT_CST_NUNITS (yt
)
1390 || TREE_INT_CST_EXT_NUNITS (xt
) != TREE_INT_CST_EXT_NUNITS (yt
))
1393 for (int i
= 0; i
< TREE_INT_CST_NUNITS (xt
); i
++)
1394 if (TREE_INT_CST_ELT (xt
, i
) != TREE_INT_CST_ELT (yt
, i
))
1400 /* Create an INT_CST node of TYPE and value CST.
1401 The returned node is always shared. For small integers we use a
1402 per-type vector cache, for larger ones we use a single hash table.
1403 The value is extended from its precision according to the sign of
1404 the type to be a multiple of HOST_BITS_PER_WIDE_INT. This defines
1405 the upper bits and ensures that hashing and value equality based
1406 upon the underlying HOST_WIDE_INTs works without masking. */
1409 wide_int_to_tree (tree type
, const wide_int_ref
&pcst
)
1416 unsigned int prec
= TYPE_PRECISION (type
);
1417 signop sgn
= TYPE_SIGN (type
);
1419 /* Verify that everything is canonical. */
1420 int l
= pcst
.get_len ();
1423 if (pcst
.elt (l
- 1) == 0)
1424 gcc_checking_assert (pcst
.elt (l
- 2) < 0);
1425 if (pcst
.elt (l
- 1) == (HOST_WIDE_INT
) -1)
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
);
3730 /* Fall through... */
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
:
3819 /* Fall through... */
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", TREE_PURPOSE (attr1
)))
5014 attr1
= TREE_VALUE (attr1
);
5015 attr2
= TREE_VALUE (attr2
);
5016 /* Compare the archetypes (printf/scanf/strftime/...). */
5017 if (!cmp_attrib_identifiers (TREE_VALUE (attr1
),
5018 TREE_VALUE (attr2
)))
5020 /* Archetypes are the same. Compare the rest. */
5021 return (simple_cst_list_equal (TREE_CHAIN (attr1
),
5022 TREE_CHAIN (attr2
)) == 1);
5024 return (simple_cst_list_equal (TREE_VALUE (attr1
),
5025 TREE_VALUE (attr2
)) == 1);
5028 if ((flag_openmp
|| flag_openmp_simd
)
5029 && TREE_VALUE (attr1
) && TREE_VALUE (attr2
)
5030 && TREE_CODE (TREE_VALUE (attr1
)) == OMP_CLAUSE
5031 && TREE_CODE (TREE_VALUE (attr2
)) == OMP_CLAUSE
)
5032 return omp_declare_simd_clauses_equal (TREE_VALUE (attr1
),
5033 TREE_VALUE (attr2
));
5035 return (simple_cst_equal (TREE_VALUE (attr1
), TREE_VALUE (attr2
)) == 1);
5038 /* Return 0 if the attributes for two types are incompatible, 1 if they
5039 are compatible, and 2 if they are nearly compatible (which causes a
5040 warning to be generated). */
5042 comp_type_attributes (const_tree type1
, const_tree type2
)
5044 const_tree a1
= TYPE_ATTRIBUTES (type1
);
5045 const_tree a2
= TYPE_ATTRIBUTES (type2
);
5050 for (a
= a1
; a
!= NULL_TREE
; a
= TREE_CHAIN (a
))
5052 const struct attribute_spec
*as
;
5055 as
= lookup_attribute_spec (get_attribute_name (a
));
5056 if (!as
|| as
->affects_type_identity
== false)
5059 attr
= lookup_attribute (as
->name
, CONST_CAST_TREE (a2
));
5060 if (!attr
|| !attribute_value_equal (a
, attr
))
5065 for (a
= a2
; a
!= NULL_TREE
; a
= TREE_CHAIN (a
))
5067 const struct attribute_spec
*as
;
5069 as
= lookup_attribute_spec (get_attribute_name (a
));
5070 if (!as
|| as
->affects_type_identity
== false)
5073 if (!lookup_attribute (as
->name
, CONST_CAST_TREE (a1
)))
5075 /* We don't need to compare trees again, as we did this
5076 already in first loop. */
5078 /* All types - affecting identity - are equal, so
5079 there is no need to call target hook for comparison. */
5083 if (lookup_attribute ("transaction_safe", CONST_CAST_TREE (a
)))
5085 /* As some type combinations - like default calling-convention - might
5086 be compatible, we have to call the target hook to get the final result. */
5087 return targetm
.comp_type_attributes (type1
, type2
);
5090 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
5093 Record such modified types already made so we don't make duplicates. */
5096 build_type_attribute_variant (tree ttype
, tree attribute
)
5098 return build_type_attribute_qual_variant (ttype
, attribute
,
5099 TYPE_QUALS (ttype
));
5103 /* Reset the expression *EXPR_P, a size or position.
5105 ??? We could reset all non-constant sizes or positions. But it's cheap
5106 enough to not do so and refrain from adding workarounds to dwarf2out.c.
5108 We need to reset self-referential sizes or positions because they cannot
5109 be gimplified and thus can contain a CALL_EXPR after the gimplification
5110 is finished, which will run afoul of LTO streaming. And they need to be
5111 reset to something essentially dummy but not constant, so as to preserve
5112 the properties of the object they are attached to. */
5115 free_lang_data_in_one_sizepos (tree
*expr_p
)
5117 tree expr
= *expr_p
;
5118 if (CONTAINS_PLACEHOLDER_P (expr
))
5119 *expr_p
= build0 (PLACEHOLDER_EXPR
, TREE_TYPE (expr
));
5123 /* Reset all the fields in a binfo node BINFO. We only keep
5124 BINFO_VTABLE, which is used by gimple_fold_obj_type_ref. */
5127 free_lang_data_in_binfo (tree binfo
)
5132 gcc_assert (TREE_CODE (binfo
) == TREE_BINFO
);
5134 BINFO_VIRTUALS (binfo
) = NULL_TREE
;
5135 BINFO_BASE_ACCESSES (binfo
) = NULL
;
5136 BINFO_INHERITANCE_CHAIN (binfo
) = NULL_TREE
;
5137 BINFO_SUBVTT_INDEX (binfo
) = NULL_TREE
;
5139 FOR_EACH_VEC_ELT (*BINFO_BASE_BINFOS (binfo
), i
, t
)
5140 free_lang_data_in_binfo (t
);
5144 /* Reset all language specific information still present in TYPE. */
5147 free_lang_data_in_type (tree type
)
5149 gcc_assert (TYPE_P (type
));
5151 /* Give the FE a chance to remove its own data first. */
5152 lang_hooks
.free_lang_data (type
);
5154 TREE_LANG_FLAG_0 (type
) = 0;
5155 TREE_LANG_FLAG_1 (type
) = 0;
5156 TREE_LANG_FLAG_2 (type
) = 0;
5157 TREE_LANG_FLAG_3 (type
) = 0;
5158 TREE_LANG_FLAG_4 (type
) = 0;
5159 TREE_LANG_FLAG_5 (type
) = 0;
5160 TREE_LANG_FLAG_6 (type
) = 0;
5162 if (TREE_CODE (type
) == FUNCTION_TYPE
)
5164 /* Remove the const and volatile qualifiers from arguments. The
5165 C++ front end removes them, but the C front end does not,
5166 leading to false ODR violation errors when merging two
5167 instances of the same function signature compiled by
5168 different front ends. */
5171 for (p
= TYPE_ARG_TYPES (type
); p
; p
= TREE_CHAIN (p
))
5173 tree arg_type
= TREE_VALUE (p
);
5175 if (TYPE_READONLY (arg_type
) || TYPE_VOLATILE (arg_type
))
5177 int quals
= TYPE_QUALS (arg_type
)
5179 & ~TYPE_QUAL_VOLATILE
;
5180 TREE_VALUE (p
) = build_qualified_type (arg_type
, quals
);
5181 free_lang_data_in_type (TREE_VALUE (p
));
5183 /* C++ FE uses TREE_PURPOSE to store initial values. */
5184 TREE_PURPOSE (p
) = NULL
;
5186 /* Java uses TYPE_MINVAL for TYPE_ARGUMENT_SIGNATURE. */
5187 TYPE_MINVAL (type
) = NULL
;
5189 if (TREE_CODE (type
) == METHOD_TYPE
)
5193 for (p
= TYPE_ARG_TYPES (type
); p
; p
= TREE_CHAIN (p
))
5195 /* C++ FE uses TREE_PURPOSE to store initial values. */
5196 TREE_PURPOSE (p
) = NULL
;
5198 /* Java uses TYPE_MINVAL for TYPE_ARGUMENT_SIGNATURE. */
5199 TYPE_MINVAL (type
) = NULL
;
5202 /* Remove members that are not actually FIELD_DECLs from the field
5203 list of an aggregate. These occur in C++. */
5204 if (RECORD_OR_UNION_TYPE_P (type
))
5208 /* Note that TYPE_FIELDS can be shared across distinct
5209 TREE_TYPEs. Therefore, if the first field of TYPE_FIELDS is
5210 to be removed, we cannot set its TREE_CHAIN to NULL.
5211 Otherwise, we would not be able to find all the other fields
5212 in the other instances of this TREE_TYPE.
5214 This was causing an ICE in testsuite/g++.dg/lto/20080915.C. */
5216 member
= TYPE_FIELDS (type
);
5219 if (TREE_CODE (member
) == FIELD_DECL
5220 || (TREE_CODE (member
) == TYPE_DECL
5221 && !DECL_IGNORED_P (member
)
5222 && debug_info_level
> DINFO_LEVEL_TERSE
5223 && !is_redundant_typedef (member
)))
5226 TREE_CHAIN (prev
) = member
;
5228 TYPE_FIELDS (type
) = member
;
5232 member
= TREE_CHAIN (member
);
5236 TREE_CHAIN (prev
) = NULL_TREE
;
5238 TYPE_FIELDS (type
) = NULL_TREE
;
5240 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
5241 and danagle the pointer from time to time. */
5242 if (TYPE_VFIELD (type
) && TREE_CODE (TYPE_VFIELD (type
)) != FIELD_DECL
)
5243 TYPE_VFIELD (type
) = NULL_TREE
;
5245 /* Remove TYPE_METHODS list. While it would be nice to keep it
5246 to enable ODR warnings about different method lists, doing so
5247 seems to impractically increase size of LTO data streamed.
5248 Keep the information if TYPE_METHODS was non-NULL. This is used
5249 by function.c and pretty printers. */
5250 if (TYPE_METHODS (type
))
5251 TYPE_METHODS (type
) = error_mark_node
;
5252 if (TYPE_BINFO (type
))
5254 free_lang_data_in_binfo (TYPE_BINFO (type
));
5255 /* We need to preserve link to bases and virtual table for all
5256 polymorphic types to make devirtualization machinery working.
5257 Debug output cares only about bases, but output also
5258 virtual table pointers so merging of -fdevirtualize and
5259 -fno-devirtualize units is easier. */
5260 if ((!BINFO_VTABLE (TYPE_BINFO (type
))
5261 || !flag_devirtualize
)
5262 && ((!BINFO_N_BASE_BINFOS (TYPE_BINFO (type
))
5263 && !BINFO_VTABLE (TYPE_BINFO (type
)))
5264 || debug_info_level
!= DINFO_LEVEL_NONE
))
5265 TYPE_BINFO (type
) = NULL
;
5270 /* For non-aggregate types, clear out the language slot (which
5271 overloads TYPE_BINFO). */
5272 TYPE_LANG_SLOT_1 (type
) = NULL_TREE
;
5274 if (INTEGRAL_TYPE_P (type
)
5275 || SCALAR_FLOAT_TYPE_P (type
)
5276 || FIXED_POINT_TYPE_P (type
))
5278 free_lang_data_in_one_sizepos (&TYPE_MIN_VALUE (type
));
5279 free_lang_data_in_one_sizepos (&TYPE_MAX_VALUE (type
));
5283 free_lang_data_in_one_sizepos (&TYPE_SIZE (type
));
5284 free_lang_data_in_one_sizepos (&TYPE_SIZE_UNIT (type
));
5286 if (TYPE_CONTEXT (type
)
5287 && TREE_CODE (TYPE_CONTEXT (type
)) == BLOCK
)
5289 tree ctx
= TYPE_CONTEXT (type
);
5292 ctx
= BLOCK_SUPERCONTEXT (ctx
);
5294 while (ctx
&& TREE_CODE (ctx
) == BLOCK
);
5295 TYPE_CONTEXT (type
) = ctx
;
5300 /* Return true if DECL may need an assembler name to be set. */
5303 need_assembler_name_p (tree decl
)
5305 /* We use DECL_ASSEMBLER_NAME to hold mangled type names for One Definition
5306 Rule merging. This makes type_odr_p to return true on those types during
5307 LTO and by comparing the mangled name, we can say what types are intended
5308 to be equivalent across compilation unit.
5310 We do not store names of type_in_anonymous_namespace_p.
5312 Record, union and enumeration type have linkage that allows use
5313 to check type_in_anonymous_namespace_p. We do not mangle compound types
5314 that always can be compared structurally.
5316 Similarly for builtin types, we compare properties of their main variant.
5317 A special case are integer types where mangling do make differences
5318 between char/signed char/unsigned char etc. Storing name for these makes
5319 e.g. -fno-signed-char/-fsigned-char mismatches to be handled well.
5320 See cp/mangle.c:write_builtin_type for details. */
5322 if (flag_lto_odr_type_mering
5323 && TREE_CODE (decl
) == TYPE_DECL
5325 && decl
== TYPE_NAME (TREE_TYPE (decl
))
5326 && TYPE_MAIN_VARIANT (TREE_TYPE (decl
)) == TREE_TYPE (decl
)
5327 && !TYPE_ARTIFICIAL (TREE_TYPE (decl
))
5328 && (type_with_linkage_p (TREE_TYPE (decl
))
5329 || TREE_CODE (TREE_TYPE (decl
)) == INTEGER_TYPE
)
5330 && !variably_modified_type_p (TREE_TYPE (decl
), NULL_TREE
))
5331 return !DECL_ASSEMBLER_NAME_SET_P (decl
);
5332 /* Only FUNCTION_DECLs and VAR_DECLs are considered. */
5333 if (TREE_CODE (decl
) != FUNCTION_DECL
5334 && TREE_CODE (decl
) != VAR_DECL
)
5337 /* If DECL already has its assembler name set, it does not need a
5339 if (!HAS_DECL_ASSEMBLER_NAME_P (decl
)
5340 || DECL_ASSEMBLER_NAME_SET_P (decl
))
5343 /* Abstract decls do not need an assembler name. */
5344 if (DECL_ABSTRACT_P (decl
))
5347 /* For VAR_DECLs, only static, public and external symbols need an
5349 if (TREE_CODE (decl
) == VAR_DECL
5350 && !TREE_STATIC (decl
)
5351 && !TREE_PUBLIC (decl
)
5352 && !DECL_EXTERNAL (decl
))
5355 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5357 /* Do not set assembler name on builtins. Allow RTL expansion to
5358 decide whether to expand inline or via a regular call. */
5359 if (DECL_BUILT_IN (decl
)
5360 && DECL_BUILT_IN_CLASS (decl
) != BUILT_IN_FRONTEND
)
5363 /* Functions represented in the callgraph need an assembler name. */
5364 if (cgraph_node::get (decl
) != NULL
)
5367 /* Unused and not public functions don't need an assembler name. */
5368 if (!TREE_USED (decl
) && !TREE_PUBLIC (decl
))
5376 /* Reset all language specific information still present in symbol
5380 free_lang_data_in_decl (tree decl
)
5382 gcc_assert (DECL_P (decl
));
5384 /* Give the FE a chance to remove its own data first. */
5385 lang_hooks
.free_lang_data (decl
);
5387 TREE_LANG_FLAG_0 (decl
) = 0;
5388 TREE_LANG_FLAG_1 (decl
) = 0;
5389 TREE_LANG_FLAG_2 (decl
) = 0;
5390 TREE_LANG_FLAG_3 (decl
) = 0;
5391 TREE_LANG_FLAG_4 (decl
) = 0;
5392 TREE_LANG_FLAG_5 (decl
) = 0;
5393 TREE_LANG_FLAG_6 (decl
) = 0;
5395 free_lang_data_in_one_sizepos (&DECL_SIZE (decl
));
5396 free_lang_data_in_one_sizepos (&DECL_SIZE_UNIT (decl
));
5397 if (TREE_CODE (decl
) == FIELD_DECL
)
5399 free_lang_data_in_one_sizepos (&DECL_FIELD_OFFSET (decl
));
5400 if (TREE_CODE (DECL_CONTEXT (decl
)) == QUAL_UNION_TYPE
)
5401 DECL_QUALIFIER (decl
) = NULL_TREE
;
5404 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5406 struct cgraph_node
*node
;
5407 if (!(node
= cgraph_node::get (decl
))
5408 || (!node
->definition
&& !node
->clones
))
5411 node
->release_body ();
5414 release_function_body (decl
);
5415 DECL_ARGUMENTS (decl
) = NULL
;
5416 DECL_RESULT (decl
) = NULL
;
5417 DECL_INITIAL (decl
) = error_mark_node
;
5420 if (gimple_has_body_p (decl
) || (node
&& node
->thunk
.thunk_p
))
5424 /* If DECL has a gimple body, then the context for its
5425 arguments must be DECL. Otherwise, it doesn't really
5426 matter, as we will not be emitting any code for DECL. In
5427 general, there may be other instances of DECL created by
5428 the front end and since PARM_DECLs are generally shared,
5429 their DECL_CONTEXT changes as the replicas of DECL are
5430 created. The only time where DECL_CONTEXT is important
5431 is for the FUNCTION_DECLs that have a gimple body (since
5432 the PARM_DECL will be used in the function's body). */
5433 for (t
= DECL_ARGUMENTS (decl
); t
; t
= TREE_CHAIN (t
))
5434 DECL_CONTEXT (t
) = decl
;
5435 if (!DECL_FUNCTION_SPECIFIC_TARGET (decl
))
5436 DECL_FUNCTION_SPECIFIC_TARGET (decl
)
5437 = target_option_default_node
;
5438 if (!DECL_FUNCTION_SPECIFIC_OPTIMIZATION (decl
))
5439 DECL_FUNCTION_SPECIFIC_OPTIMIZATION (decl
)
5440 = optimization_default_node
;
5443 /* DECL_SAVED_TREE holds the GENERIC representation for DECL.
5444 At this point, it is not needed anymore. */
5445 DECL_SAVED_TREE (decl
) = NULL_TREE
;
5447 /* Clear the abstract origin if it refers to a method. Otherwise
5448 dwarf2out.c will ICE as we clear TYPE_METHODS and thus the
5449 origin will not be output correctly. */
5450 if (DECL_ABSTRACT_ORIGIN (decl
)
5451 && DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))
5452 && RECORD_OR_UNION_TYPE_P
5453 (DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))))
5454 DECL_ABSTRACT_ORIGIN (decl
) = NULL_TREE
;
5456 /* Sometimes the C++ frontend doesn't manage to transform a temporary
5457 DECL_VINDEX referring to itself into a vtable slot number as it
5458 should. Happens with functions that are copied and then forgotten
5459 about. Just clear it, it won't matter anymore. */
5460 if (DECL_VINDEX (decl
) && !tree_fits_shwi_p (DECL_VINDEX (decl
)))
5461 DECL_VINDEX (decl
) = NULL_TREE
;
5463 else if (TREE_CODE (decl
) == VAR_DECL
)
5465 if ((DECL_EXTERNAL (decl
)
5466 && (!TREE_STATIC (decl
) || !TREE_READONLY (decl
)))
5467 || (decl_function_context (decl
) && !TREE_STATIC (decl
)))
5468 DECL_INITIAL (decl
) = NULL_TREE
;
5470 else if (TREE_CODE (decl
) == TYPE_DECL
)
5472 DECL_VISIBILITY (decl
) = VISIBILITY_DEFAULT
;
5473 DECL_VISIBILITY_SPECIFIED (decl
) = 0;
5474 DECL_INITIAL (decl
) = NULL_TREE
;
5476 else if (TREE_CODE (decl
) == FIELD_DECL
)
5477 DECL_INITIAL (decl
) = NULL_TREE
;
5478 else if (TREE_CODE (decl
) == TRANSLATION_UNIT_DECL
5479 && DECL_INITIAL (decl
)
5480 && TREE_CODE (DECL_INITIAL (decl
)) == BLOCK
)
5482 /* Strip builtins from the translation-unit BLOCK. We still have targets
5483 without builtin_decl_explicit support and also builtins are shared
5484 nodes and thus we can't use TREE_CHAIN in multiple lists. */
5485 tree
*nextp
= &BLOCK_VARS (DECL_INITIAL (decl
));
5489 if (TREE_CODE (var
) == FUNCTION_DECL
5490 && DECL_BUILT_IN (var
))
5491 *nextp
= TREE_CHAIN (var
);
5493 nextp
= &TREE_CHAIN (var
);
5499 /* Data used when collecting DECLs and TYPEs for language data removal. */
5501 struct free_lang_data_d
5503 /* Worklist to avoid excessive recursion. */
5506 /* Set of traversed objects. Used to avoid duplicate visits. */
5507 hash_set
<tree
> *pset
;
5509 /* Array of symbols to process with free_lang_data_in_decl. */
5512 /* Array of types to process with free_lang_data_in_type. */
5517 /* Save all language fields needed to generate proper debug information
5518 for DECL. This saves most fields cleared out by free_lang_data_in_decl. */
5521 save_debug_info_for_decl (tree t
)
5523 /*struct saved_debug_info_d *sdi;*/
5525 gcc_assert (debug_info_level
> DINFO_LEVEL_TERSE
&& t
&& DECL_P (t
));
5527 /* FIXME. Partial implementation for saving debug info removed. */
5531 /* Save all language fields needed to generate proper debug information
5532 for TYPE. This saves most fields cleared out by free_lang_data_in_type. */
5535 save_debug_info_for_type (tree t
)
5537 /*struct saved_debug_info_d *sdi;*/
5539 gcc_assert (debug_info_level
> DINFO_LEVEL_TERSE
&& t
&& TYPE_P (t
));
5541 /* FIXME. Partial implementation for saving debug info removed. */
5545 /* Add type or decl T to one of the list of tree nodes that need their
5546 language data removed. The lists are held inside FLD. */
5549 add_tree_to_fld_list (tree t
, struct free_lang_data_d
*fld
)
5553 fld
->decls
.safe_push (t
);
5554 if (debug_info_level
> DINFO_LEVEL_TERSE
)
5555 save_debug_info_for_decl (t
);
5557 else if (TYPE_P (t
))
5559 fld
->types
.safe_push (t
);
5560 if (debug_info_level
> DINFO_LEVEL_TERSE
)
5561 save_debug_info_for_type (t
);
5567 /* Push tree node T into FLD->WORKLIST. */
5570 fld_worklist_push (tree t
, struct free_lang_data_d
*fld
)
5572 if (t
&& !is_lang_specific (t
) && !fld
->pset
->contains (t
))
5573 fld
->worklist
.safe_push ((t
));
5577 /* Operand callback helper for free_lang_data_in_node. *TP is the
5578 subtree operand being considered. */
5581 find_decls_types_r (tree
*tp
, int *ws
, void *data
)
5584 struct free_lang_data_d
*fld
= (struct free_lang_data_d
*) data
;
5586 if (TREE_CODE (t
) == TREE_LIST
)
5589 /* Language specific nodes will be removed, so there is no need
5590 to gather anything under them. */
5591 if (is_lang_specific (t
))
5599 /* Note that walk_tree does not traverse every possible field in
5600 decls, so we have to do our own traversals here. */
5601 add_tree_to_fld_list (t
, fld
);
5603 fld_worklist_push (DECL_NAME (t
), fld
);
5604 fld_worklist_push (DECL_CONTEXT (t
), fld
);
5605 fld_worklist_push (DECL_SIZE (t
), fld
);
5606 fld_worklist_push (DECL_SIZE_UNIT (t
), fld
);
5608 /* We are going to remove everything under DECL_INITIAL for
5609 TYPE_DECLs. No point walking them. */
5610 if (TREE_CODE (t
) != TYPE_DECL
)
5611 fld_worklist_push (DECL_INITIAL (t
), fld
);
5613 fld_worklist_push (DECL_ATTRIBUTES (t
), fld
);
5614 fld_worklist_push (DECL_ABSTRACT_ORIGIN (t
), fld
);
5616 if (TREE_CODE (t
) == FUNCTION_DECL
)
5618 fld_worklist_push (DECL_ARGUMENTS (t
), fld
);
5619 fld_worklist_push (DECL_RESULT (t
), fld
);
5621 else if (TREE_CODE (t
) == TYPE_DECL
)
5623 fld_worklist_push (DECL_ORIGINAL_TYPE (t
), fld
);
5625 else if (TREE_CODE (t
) == FIELD_DECL
)
5627 fld_worklist_push (DECL_FIELD_OFFSET (t
), fld
);
5628 fld_worklist_push (DECL_BIT_FIELD_TYPE (t
), fld
);
5629 fld_worklist_push (DECL_FIELD_BIT_OFFSET (t
), fld
);
5630 fld_worklist_push (DECL_FCONTEXT (t
), fld
);
5633 if ((TREE_CODE (t
) == VAR_DECL
|| TREE_CODE (t
) == PARM_DECL
)
5634 && DECL_HAS_VALUE_EXPR_P (t
))
5635 fld_worklist_push (DECL_VALUE_EXPR (t
), fld
);
5637 if (TREE_CODE (t
) != FIELD_DECL
5638 && TREE_CODE (t
) != TYPE_DECL
)
5639 fld_worklist_push (TREE_CHAIN (t
), fld
);
5642 else if (TYPE_P (t
))
5644 /* Note that walk_tree does not traverse every possible field in
5645 types, so we have to do our own traversals here. */
5646 add_tree_to_fld_list (t
, fld
);
5648 if (!RECORD_OR_UNION_TYPE_P (t
))
5649 fld_worklist_push (TYPE_CACHED_VALUES (t
), fld
);
5650 fld_worklist_push (TYPE_SIZE (t
), fld
);
5651 fld_worklist_push (TYPE_SIZE_UNIT (t
), fld
);
5652 fld_worklist_push (TYPE_ATTRIBUTES (t
), fld
);
5653 fld_worklist_push (TYPE_POINTER_TO (t
), fld
);
5654 fld_worklist_push (TYPE_REFERENCE_TO (t
), fld
);
5655 fld_worklist_push (TYPE_NAME (t
), fld
);
5656 /* Do not walk TYPE_NEXT_PTR_TO or TYPE_NEXT_REF_TO. We do not stream
5657 them and thus do not and want not to reach unused pointer types
5659 if (!POINTER_TYPE_P (t
))
5660 fld_worklist_push (TYPE_MINVAL (t
), fld
);
5661 if (!RECORD_OR_UNION_TYPE_P (t
))
5662 fld_worklist_push (TYPE_MAXVAL (t
), fld
);
5663 fld_worklist_push (TYPE_MAIN_VARIANT (t
), fld
);
5664 /* Do not walk TYPE_NEXT_VARIANT. We do not stream it and thus
5665 do not and want not to reach unused variants this way. */
5666 if (TYPE_CONTEXT (t
))
5668 tree ctx
= TYPE_CONTEXT (t
);
5669 /* We adjust BLOCK TYPE_CONTEXTs to the innermost non-BLOCK one.
5670 So push that instead. */
5671 while (ctx
&& TREE_CODE (ctx
) == BLOCK
)
5672 ctx
= BLOCK_SUPERCONTEXT (ctx
);
5673 fld_worklist_push (ctx
, fld
);
5675 /* Do not walk TYPE_CANONICAL. We do not stream it and thus do not
5676 and want not to reach unused types this way. */
5678 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_BINFO (t
))
5682 FOR_EACH_VEC_ELT (*BINFO_BASE_BINFOS (TYPE_BINFO (t
)), i
, tem
)
5683 fld_worklist_push (TREE_TYPE (tem
), fld
);
5684 tem
= BINFO_VIRTUALS (TYPE_BINFO (t
));
5686 /* The Java FE overloads BINFO_VIRTUALS for its own purpose. */
5687 && TREE_CODE (tem
) == TREE_LIST
)
5690 fld_worklist_push (TREE_VALUE (tem
), fld
);
5691 tem
= TREE_CHAIN (tem
);
5695 if (RECORD_OR_UNION_TYPE_P (t
))
5698 /* Push all TYPE_FIELDS - there can be interleaving interesting
5699 and non-interesting things. */
5700 tem
= TYPE_FIELDS (t
);
5703 if (TREE_CODE (tem
) == FIELD_DECL
5704 || (TREE_CODE (tem
) == TYPE_DECL
5705 && !DECL_IGNORED_P (tem
)
5706 && debug_info_level
> DINFO_LEVEL_TERSE
5707 && !is_redundant_typedef (tem
)))
5708 fld_worklist_push (tem
, fld
);
5709 tem
= TREE_CHAIN (tem
);
5713 fld_worklist_push (TYPE_STUB_DECL (t
), fld
);
5716 else if (TREE_CODE (t
) == BLOCK
)
5719 for (tem
= BLOCK_VARS (t
); tem
; tem
= TREE_CHAIN (tem
))
5720 fld_worklist_push (tem
, fld
);
5721 for (tem
= BLOCK_SUBBLOCKS (t
); tem
; tem
= BLOCK_CHAIN (tem
))
5722 fld_worklist_push (tem
, fld
);
5723 fld_worklist_push (BLOCK_ABSTRACT_ORIGIN (t
), fld
);
5726 if (TREE_CODE (t
) != IDENTIFIER_NODE
5727 && CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_TYPED
))
5728 fld_worklist_push (TREE_TYPE (t
), fld
);
5734 /* Find decls and types in T. */
5737 find_decls_types (tree t
, struct free_lang_data_d
*fld
)
5741 if (!fld
->pset
->contains (t
))
5742 walk_tree (&t
, find_decls_types_r
, fld
, fld
->pset
);
5743 if (fld
->worklist
.is_empty ())
5745 t
= fld
->worklist
.pop ();
5749 /* Translate all the types in LIST with the corresponding runtime
5753 get_eh_types_for_runtime (tree list
)
5757 if (list
== NULL_TREE
)
5760 head
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
5762 list
= TREE_CHAIN (list
);
5765 tree n
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
5766 TREE_CHAIN (prev
) = n
;
5767 prev
= TREE_CHAIN (prev
);
5768 list
= TREE_CHAIN (list
);
5775 /* Find decls and types referenced in EH region R and store them in
5776 FLD->DECLS and FLD->TYPES. */
5779 find_decls_types_in_eh_region (eh_region r
, struct free_lang_data_d
*fld
)
5790 /* The types referenced in each catch must first be changed to the
5791 EH types used at runtime. This removes references to FE types
5793 for (c
= r
->u
.eh_try
.first_catch
; c
; c
= c
->next_catch
)
5795 c
->type_list
= get_eh_types_for_runtime (c
->type_list
);
5796 walk_tree (&c
->type_list
, find_decls_types_r
, fld
, fld
->pset
);
5801 case ERT_ALLOWED_EXCEPTIONS
:
5802 r
->u
.allowed
.type_list
5803 = get_eh_types_for_runtime (r
->u
.allowed
.type_list
);
5804 walk_tree (&r
->u
.allowed
.type_list
, find_decls_types_r
, fld
, fld
->pset
);
5807 case ERT_MUST_NOT_THROW
:
5808 walk_tree (&r
->u
.must_not_throw
.failure_decl
,
5809 find_decls_types_r
, fld
, fld
->pset
);
5815 /* Find decls and types referenced in cgraph node N and store them in
5816 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
5817 look for *every* kind of DECL and TYPE node reachable from N,
5818 including those embedded inside types and decls (i.e,, TYPE_DECLs,
5819 NAMESPACE_DECLs, etc). */
5822 find_decls_types_in_node (struct cgraph_node
*n
, struct free_lang_data_d
*fld
)
5825 struct function
*fn
;
5829 find_decls_types (n
->decl
, fld
);
5831 if (!gimple_has_body_p (n
->decl
))
5834 gcc_assert (current_function_decl
== NULL_TREE
&& cfun
== NULL
);
5836 fn
= DECL_STRUCT_FUNCTION (n
->decl
);
5838 /* Traverse locals. */
5839 FOR_EACH_LOCAL_DECL (fn
, ix
, t
)
5840 find_decls_types (t
, fld
);
5842 /* Traverse EH regions in FN. */
5845 FOR_ALL_EH_REGION_FN (r
, fn
)
5846 find_decls_types_in_eh_region (r
, fld
);
5849 /* Traverse every statement in FN. */
5850 FOR_EACH_BB_FN (bb
, fn
)
5853 gimple_stmt_iterator si
;
5856 for (psi
= gsi_start_phis (bb
); !gsi_end_p (psi
); gsi_next (&psi
))
5858 gphi
*phi
= psi
.phi ();
5860 for (i
= 0; i
< gimple_phi_num_args (phi
); i
++)
5862 tree
*arg_p
= gimple_phi_arg_def_ptr (phi
, i
);
5863 find_decls_types (*arg_p
, fld
);
5867 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
5869 gimple
*stmt
= gsi_stmt (si
);
5871 if (is_gimple_call (stmt
))
5872 find_decls_types (gimple_call_fntype (stmt
), fld
);
5874 for (i
= 0; i
< gimple_num_ops (stmt
); i
++)
5876 tree arg
= gimple_op (stmt
, i
);
5877 find_decls_types (arg
, fld
);
5884 /* Find decls and types referenced in varpool node N and store them in
5885 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
5886 look for *every* kind of DECL and TYPE node reachable from N,
5887 including those embedded inside types and decls (i.e,, TYPE_DECLs,
5888 NAMESPACE_DECLs, etc). */
5891 find_decls_types_in_var (varpool_node
*v
, struct free_lang_data_d
*fld
)
5893 find_decls_types (v
->decl
, fld
);
5896 /* If T needs an assembler name, have one created for it. */
5899 assign_assembler_name_if_neeeded (tree t
)
5901 if (need_assembler_name_p (t
))
5903 /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit
5904 diagnostics that use input_location to show locus
5905 information. The problem here is that, at this point,
5906 input_location is generally anchored to the end of the file
5907 (since the parser is long gone), so we don't have a good
5908 position to pin it to.
5910 To alleviate this problem, this uses the location of T's
5911 declaration. Examples of this are
5912 testsuite/g++.dg/template/cond2.C and
5913 testsuite/g++.dg/template/pr35240.C. */
5914 location_t saved_location
= input_location
;
5915 input_location
= DECL_SOURCE_LOCATION (t
);
5917 decl_assembler_name (t
);
5919 input_location
= saved_location
;
5924 /* Free language specific information for every operand and expression
5925 in every node of the call graph. This process operates in three stages:
5927 1- Every callgraph node and varpool node is traversed looking for
5928 decls and types embedded in them. This is a more exhaustive
5929 search than that done by find_referenced_vars, because it will
5930 also collect individual fields, decls embedded in types, etc.
5932 2- All the decls found are sent to free_lang_data_in_decl.
5934 3- All the types found are sent to free_lang_data_in_type.
5936 The ordering between decls and types is important because
5937 free_lang_data_in_decl sets assembler names, which includes
5938 mangling. So types cannot be freed up until assembler names have
5942 free_lang_data_in_cgraph (void)
5944 struct cgraph_node
*n
;
5946 struct free_lang_data_d fld
;
5951 /* Initialize sets and arrays to store referenced decls and types. */
5952 fld
.pset
= new hash_set
<tree
>;
5953 fld
.worklist
.create (0);
5954 fld
.decls
.create (100);
5955 fld
.types
.create (100);
5957 /* Find decls and types in the body of every function in the callgraph. */
5958 FOR_EACH_FUNCTION (n
)
5959 find_decls_types_in_node (n
, &fld
);
5961 FOR_EACH_VEC_SAFE_ELT (alias_pairs
, i
, p
)
5962 find_decls_types (p
->decl
, &fld
);
5964 /* Find decls and types in every varpool symbol. */
5965 FOR_EACH_VARIABLE (v
)
5966 find_decls_types_in_var (v
, &fld
);
5968 /* Set the assembler name on every decl found. We need to do this
5969 now because free_lang_data_in_decl will invalidate data needed
5970 for mangling. This breaks mangling on interdependent decls. */
5971 FOR_EACH_VEC_ELT (fld
.decls
, i
, t
)
5972 assign_assembler_name_if_neeeded (t
);
5974 /* Traverse every decl found freeing its language data. */
5975 FOR_EACH_VEC_ELT (fld
.decls
, i
, t
)
5976 free_lang_data_in_decl (t
);
5978 /* Traverse every type found freeing its language data. */
5979 FOR_EACH_VEC_ELT (fld
.types
, i
, t
)
5980 free_lang_data_in_type (t
);
5983 FOR_EACH_VEC_ELT (fld
.types
, i
, t
)
5988 fld
.worklist
.release ();
5989 fld
.decls
.release ();
5990 fld
.types
.release ();
5994 /* Free resources that are used by FE but are not needed once they are done. */
5997 free_lang_data (void)
6001 /* If we are the LTO frontend we have freed lang-specific data already. */
6003 || (!flag_generate_lto
&& !flag_generate_offload
))
6006 /* Allocate and assign alias sets to the standard integer types
6007 while the slots are still in the way the frontends generated them. */
6008 for (i
= 0; i
< itk_none
; ++i
)
6009 if (integer_types
[i
])
6010 TYPE_ALIAS_SET (integer_types
[i
]) = get_alias_set (integer_types
[i
]);
6012 /* Traverse the IL resetting language specific information for
6013 operands, expressions, etc. */
6014 free_lang_data_in_cgraph ();
6016 /* Create gimple variants for common types. */
6017 ptrdiff_type_node
= integer_type_node
;
6018 fileptr_type_node
= ptr_type_node
;
6020 /* Reset some langhooks. Do not reset types_compatible_p, it may
6021 still be used indirectly via the get_alias_set langhook. */
6022 lang_hooks
.dwarf_name
= lhd_dwarf_name
;
6023 lang_hooks
.decl_printable_name
= gimple_decl_printable_name
;
6024 lang_hooks
.gimplify_expr
= lhd_gimplify_expr
;
6026 /* We do not want the default decl_assembler_name implementation,
6027 rather if we have fixed everything we want a wrapper around it
6028 asserting that all non-local symbols already got their assembler
6029 name and only produce assembler names for local symbols. Or rather
6030 make sure we never call decl_assembler_name on local symbols and
6031 devise a separate, middle-end private scheme for it. */
6033 /* Reset diagnostic machinery. */
6034 tree_diagnostics_defaults (global_dc
);
6042 const pass_data pass_data_ipa_free_lang_data
=
6044 SIMPLE_IPA_PASS
, /* type */
6045 "*free_lang_data", /* name */
6046 OPTGROUP_NONE
, /* optinfo_flags */
6047 TV_IPA_FREE_LANG_DATA
, /* tv_id */
6048 0, /* properties_required */
6049 0, /* properties_provided */
6050 0, /* properties_destroyed */
6051 0, /* todo_flags_start */
6052 0, /* todo_flags_finish */
6055 class pass_ipa_free_lang_data
: public simple_ipa_opt_pass
6058 pass_ipa_free_lang_data (gcc::context
*ctxt
)
6059 : simple_ipa_opt_pass (pass_data_ipa_free_lang_data
, ctxt
)
6062 /* opt_pass methods: */
6063 virtual unsigned int execute (function
*) { return free_lang_data (); }
6065 }; // class pass_ipa_free_lang_data
6069 simple_ipa_opt_pass
*
6070 make_pass_ipa_free_lang_data (gcc::context
*ctxt
)
6072 return new pass_ipa_free_lang_data (ctxt
);
6075 /* The backbone of is_attribute_p(). ATTR_LEN is the string length of
6076 ATTR_NAME. Also used internally by remove_attribute(). */
6078 private_is_attribute_p (const char *attr_name
, size_t attr_len
, const_tree ident
)
6080 size_t ident_len
= IDENTIFIER_LENGTH (ident
);
6082 if (ident_len
== attr_len
)
6084 if (strcmp (attr_name
, IDENTIFIER_POINTER (ident
)) == 0)
6087 else if (ident_len
== attr_len
+ 4)
6089 /* There is the possibility that ATTR is 'text' and IDENT is
6091 const char *p
= IDENTIFIER_POINTER (ident
);
6092 if (p
[0] == '_' && p
[1] == '_'
6093 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
6094 && strncmp (attr_name
, p
+ 2, attr_len
) == 0)
6101 /* The backbone of lookup_attribute(). ATTR_LEN is the string length
6102 of ATTR_NAME, and LIST is not NULL_TREE. */
6104 private_lookup_attribute (const char *attr_name
, size_t attr_len
, tree list
)
6108 size_t ident_len
= IDENTIFIER_LENGTH (get_attribute_name (list
));
6110 if (ident_len
== attr_len
)
6112 if (!strcmp (attr_name
,
6113 IDENTIFIER_POINTER (get_attribute_name (list
))))
6116 /* TODO: If we made sure that attributes were stored in the
6117 canonical form without '__...__' (ie, as in 'text' as opposed
6118 to '__text__') then we could avoid the following case. */
6119 else if (ident_len
== attr_len
+ 4)
6121 const char *p
= IDENTIFIER_POINTER (get_attribute_name (list
));
6122 if (p
[0] == '_' && p
[1] == '_'
6123 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
6124 && strncmp (attr_name
, p
+ 2, attr_len
) == 0)
6127 list
= TREE_CHAIN (list
);
6133 /* Given an attribute name ATTR_NAME and a list of attributes LIST,
6134 return a pointer to the attribute's list first element if the attribute
6135 starts with ATTR_NAME. ATTR_NAME must be in the form 'text' (not
6139 private_lookup_attribute_by_prefix (const char *attr_name
, size_t attr_len
,
6144 size_t ident_len
= IDENTIFIER_LENGTH (get_attribute_name (list
));
6146 if (attr_len
> ident_len
)
6148 list
= TREE_CHAIN (list
);
6152 const char *p
= IDENTIFIER_POINTER (get_attribute_name (list
));
6154 if (strncmp (attr_name
, p
, attr_len
) == 0)
6157 /* TODO: If we made sure that attributes were stored in the
6158 canonical form without '__...__' (ie, as in 'text' as opposed
6159 to '__text__') then we could avoid the following case. */
6160 if (p
[0] == '_' && p
[1] == '_' &&
6161 strncmp (attr_name
, p
+ 2, attr_len
) == 0)
6164 list
= TREE_CHAIN (list
);
6171 /* A variant of lookup_attribute() that can be used with an identifier
6172 as the first argument, and where the identifier can be either
6173 'text' or '__text__'.
6175 Given an attribute ATTR_IDENTIFIER, and a list of attributes LIST,
6176 return a pointer to the attribute's list element if the attribute
6177 is part of the list, or NULL_TREE if not found. If the attribute
6178 appears more than once, this only returns the first occurrence; the
6179 TREE_CHAIN of the return value should be passed back in if further
6180 occurrences are wanted. ATTR_IDENTIFIER must be an identifier but
6181 can be in the form 'text' or '__text__'. */
6183 lookup_ident_attribute (tree attr_identifier
, tree list
)
6185 gcc_checking_assert (TREE_CODE (attr_identifier
) == IDENTIFIER_NODE
);
6189 gcc_checking_assert (TREE_CODE (get_attribute_name (list
))
6190 == IDENTIFIER_NODE
);
6192 if (cmp_attrib_identifiers (attr_identifier
,
6193 get_attribute_name (list
)))
6196 list
= TREE_CHAIN (list
);
6202 /* Remove any instances of attribute ATTR_NAME in LIST and return the
6206 remove_attribute (const char *attr_name
, tree list
)
6209 size_t attr_len
= strlen (attr_name
);
6211 gcc_checking_assert (attr_name
[0] != '_');
6213 for (p
= &list
; *p
; )
6216 /* TODO: If we were storing attributes in normalized form, here
6217 we could use a simple strcmp(). */
6218 if (private_is_attribute_p (attr_name
, attr_len
, get_attribute_name (l
)))
6219 *p
= TREE_CHAIN (l
);
6221 p
= &TREE_CHAIN (l
);
6227 /* Return an attribute list that is the union of a1 and a2. */
6230 merge_attributes (tree a1
, tree a2
)
6234 /* Either one unset? Take the set one. */
6236 if ((attributes
= a1
) == 0)
6239 /* One that completely contains the other? Take it. */
6241 else if (a2
!= 0 && ! attribute_list_contained (a1
, a2
))
6243 if (attribute_list_contained (a2
, a1
))
6247 /* Pick the longest list, and hang on the other list. */
6249 if (list_length (a1
) < list_length (a2
))
6250 attributes
= a2
, a2
= a1
;
6252 for (; a2
!= 0; a2
= TREE_CHAIN (a2
))
6255 for (a
= lookup_ident_attribute (get_attribute_name (a2
),
6257 a
!= NULL_TREE
&& !attribute_value_equal (a
, a2
);
6258 a
= lookup_ident_attribute (get_attribute_name (a2
),
6263 a1
= copy_node (a2
);
6264 TREE_CHAIN (a1
) = attributes
;
6273 /* Given types T1 and T2, merge their attributes and return
6277 merge_type_attributes (tree t1
, tree t2
)
6279 return merge_attributes (TYPE_ATTRIBUTES (t1
),
6280 TYPE_ATTRIBUTES (t2
));
6283 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
6287 merge_decl_attributes (tree olddecl
, tree newdecl
)
6289 return merge_attributes (DECL_ATTRIBUTES (olddecl
),
6290 DECL_ATTRIBUTES (newdecl
));
6293 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
6295 /* Specialization of merge_decl_attributes for various Windows targets.
6297 This handles the following situation:
6299 __declspec (dllimport) int foo;
6302 The second instance of `foo' nullifies the dllimport. */
6305 merge_dllimport_decl_attributes (tree old
, tree new_tree
)
6308 int delete_dllimport_p
= 1;
6310 /* What we need to do here is remove from `old' dllimport if it doesn't
6311 appear in `new'. dllimport behaves like extern: if a declaration is
6312 marked dllimport and a definition appears later, then the object
6313 is not dllimport'd. We also remove a `new' dllimport if the old list
6314 contains dllexport: dllexport always overrides dllimport, regardless
6315 of the order of declaration. */
6316 if (!VAR_OR_FUNCTION_DECL_P (new_tree
))
6317 delete_dllimport_p
= 0;
6318 else if (DECL_DLLIMPORT_P (new_tree
)
6319 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (old
)))
6321 DECL_DLLIMPORT_P (new_tree
) = 0;
6322 warning (OPT_Wattributes
, "%q+D already declared with dllexport attribute: "
6323 "dllimport ignored", new_tree
);
6325 else if (DECL_DLLIMPORT_P (old
) && !DECL_DLLIMPORT_P (new_tree
))
6327 /* Warn about overriding a symbol that has already been used, e.g.:
6328 extern int __attribute__ ((dllimport)) foo;
6329 int* bar () {return &foo;}
6332 if (TREE_USED (old
))
6334 warning (0, "%q+D redeclared without dllimport attribute "
6335 "after being referenced with dll linkage", new_tree
);
6336 /* If we have used a variable's address with dllimport linkage,
6337 keep the old DECL_DLLIMPORT_P flag: the ADDR_EXPR using the
6338 decl may already have had TREE_CONSTANT computed.
6339 We still remove the attribute so that assembler code refers
6340 to '&foo rather than '_imp__foo'. */
6341 if (TREE_CODE (old
) == VAR_DECL
&& TREE_ADDRESSABLE (old
))
6342 DECL_DLLIMPORT_P (new_tree
) = 1;
6345 /* Let an inline definition silently override the external reference,
6346 but otherwise warn about attribute inconsistency. */
6347 else if (TREE_CODE (new_tree
) == VAR_DECL
6348 || !DECL_DECLARED_INLINE_P (new_tree
))
6349 warning (OPT_Wattributes
, "%q+D redeclared without dllimport attribute: "
6350 "previous dllimport ignored", new_tree
);
6353 delete_dllimport_p
= 0;
6355 a
= merge_attributes (DECL_ATTRIBUTES (old
), DECL_ATTRIBUTES (new_tree
));
6357 if (delete_dllimport_p
)
6358 a
= remove_attribute ("dllimport", a
);
6363 /* Handle a "dllimport" or "dllexport" attribute; arguments as in
6364 struct attribute_spec.handler. */
6367 handle_dll_attribute (tree
* pnode
, tree name
, tree args
, int flags
,
6373 /* These attributes may apply to structure and union types being created,
6374 but otherwise should pass to the declaration involved. */
6377 if (flags
& ((int) ATTR_FLAG_DECL_NEXT
| (int) ATTR_FLAG_FUNCTION_NEXT
6378 | (int) ATTR_FLAG_ARRAY_NEXT
))
6380 *no_add_attrs
= true;
6381 return tree_cons (name
, args
, NULL_TREE
);
6383 if (TREE_CODE (node
) == RECORD_TYPE
6384 || TREE_CODE (node
) == UNION_TYPE
)
6386 node
= TYPE_NAME (node
);
6392 warning (OPT_Wattributes
, "%qE attribute ignored",
6394 *no_add_attrs
= true;
6399 if (TREE_CODE (node
) != FUNCTION_DECL
6400 && TREE_CODE (node
) != VAR_DECL
6401 && TREE_CODE (node
) != TYPE_DECL
)
6403 *no_add_attrs
= true;
6404 warning (OPT_Wattributes
, "%qE attribute ignored",
6409 if (TREE_CODE (node
) == TYPE_DECL
6410 && TREE_CODE (TREE_TYPE (node
)) != RECORD_TYPE
6411 && TREE_CODE (TREE_TYPE (node
)) != UNION_TYPE
)
6413 *no_add_attrs
= true;
6414 warning (OPT_Wattributes
, "%qE attribute ignored",
6419 is_dllimport
= is_attribute_p ("dllimport", name
);
6421 /* Report error on dllimport ambiguities seen now before they cause
6425 /* Honor any target-specific overrides. */
6426 if (!targetm
.valid_dllimport_attribute_p (node
))
6427 *no_add_attrs
= true;
6429 else if (TREE_CODE (node
) == FUNCTION_DECL
6430 && DECL_DECLARED_INLINE_P (node
))
6432 warning (OPT_Wattributes
, "inline function %q+D declared as "
6433 " dllimport: attribute ignored", node
);
6434 *no_add_attrs
= true;
6436 /* Like MS, treat definition of dllimported variables and
6437 non-inlined functions on declaration as syntax errors. */
6438 else if (TREE_CODE (node
) == FUNCTION_DECL
&& DECL_INITIAL (node
))
6440 error ("function %q+D definition is marked dllimport", node
);
6441 *no_add_attrs
= true;
6444 else if (TREE_CODE (node
) == VAR_DECL
)
6446 if (DECL_INITIAL (node
))
6448 error ("variable %q+D definition is marked dllimport",
6450 *no_add_attrs
= true;
6453 /* `extern' needn't be specified with dllimport.
6454 Specify `extern' now and hope for the best. Sigh. */
6455 DECL_EXTERNAL (node
) = 1;
6456 /* Also, implicitly give dllimport'd variables declared within
6457 a function global scope, unless declared static. */
6458 if (current_function_decl
!= NULL_TREE
&& !TREE_STATIC (node
))
6459 TREE_PUBLIC (node
) = 1;
6462 if (*no_add_attrs
== false)
6463 DECL_DLLIMPORT_P (node
) = 1;
6465 else if (TREE_CODE (node
) == FUNCTION_DECL
6466 && DECL_DECLARED_INLINE_P (node
)
6467 && flag_keep_inline_dllexport
)
6468 /* An exported function, even if inline, must be emitted. */
6469 DECL_EXTERNAL (node
) = 0;
6471 /* Report error if symbol is not accessible at global scope. */
6472 if (!TREE_PUBLIC (node
)
6473 && (TREE_CODE (node
) == VAR_DECL
6474 || TREE_CODE (node
) == FUNCTION_DECL
))
6476 error ("external linkage required for symbol %q+D because of "
6477 "%qE attribute", node
, name
);
6478 *no_add_attrs
= true;
6481 /* A dllexport'd entity must have default visibility so that other
6482 program units (shared libraries or the main executable) can see
6483 it. A dllimport'd entity must have default visibility so that
6484 the linker knows that undefined references within this program
6485 unit can be resolved by the dynamic linker. */
6488 if (DECL_VISIBILITY_SPECIFIED (node
)
6489 && DECL_VISIBILITY (node
) != VISIBILITY_DEFAULT
)
6490 error ("%qE implies default visibility, but %qD has already "
6491 "been declared with a different visibility",
6493 DECL_VISIBILITY (node
) = VISIBILITY_DEFAULT
;
6494 DECL_VISIBILITY_SPECIFIED (node
) = 1;
6500 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
6502 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
6503 of the various TYPE_QUAL values. */
6506 set_type_quals (tree type
, int type_quals
)
6508 TYPE_READONLY (type
) = (type_quals
& TYPE_QUAL_CONST
) != 0;
6509 TYPE_VOLATILE (type
) = (type_quals
& TYPE_QUAL_VOLATILE
) != 0;
6510 TYPE_RESTRICT (type
) = (type_quals
& TYPE_QUAL_RESTRICT
) != 0;
6511 TYPE_ATOMIC (type
) = (type_quals
& TYPE_QUAL_ATOMIC
) != 0;
6512 TYPE_ADDR_SPACE (type
) = DECODE_QUAL_ADDR_SPACE (type_quals
);
6515 /* Returns true iff unqualified CAND and BASE are equivalent. */
6518 check_base_type (const_tree cand
, const_tree base
)
6520 return (TYPE_NAME (cand
) == TYPE_NAME (base
)
6521 /* Apparently this is needed for Objective-C. */
6522 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
6523 /* Check alignment. */
6524 && TYPE_ALIGN (cand
) == TYPE_ALIGN (base
)
6525 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
6526 TYPE_ATTRIBUTES (base
)));
6529 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
6532 check_qualified_type (const_tree cand
, const_tree base
, int type_quals
)
6534 return (TYPE_QUALS (cand
) == type_quals
6535 && check_base_type (cand
, base
));
6538 /* Returns true iff CAND is equivalent to BASE with ALIGN. */
6541 check_aligned_type (const_tree cand
, const_tree base
, unsigned int align
)
6543 return (TYPE_QUALS (cand
) == TYPE_QUALS (base
)
6544 && TYPE_NAME (cand
) == TYPE_NAME (base
)
6545 /* Apparently this is needed for Objective-C. */
6546 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
6547 /* Check alignment. */
6548 && TYPE_ALIGN (cand
) == align
6549 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
6550 TYPE_ATTRIBUTES (base
)));
6553 /* This function checks to see if TYPE matches the size one of the built-in
6554 atomic types, and returns that core atomic type. */
6557 find_atomic_core_type (tree type
)
6559 tree base_atomic_type
;
6561 /* Only handle complete types. */
6562 if (TYPE_SIZE (type
) == NULL_TREE
)
6565 HOST_WIDE_INT type_size
= tree_to_uhwi (TYPE_SIZE (type
));
6569 base_atomic_type
= atomicQI_type_node
;
6573 base_atomic_type
= atomicHI_type_node
;
6577 base_atomic_type
= atomicSI_type_node
;
6581 base_atomic_type
= atomicDI_type_node
;
6585 base_atomic_type
= atomicTI_type_node
;
6589 base_atomic_type
= NULL_TREE
;
6592 return base_atomic_type
;
6595 /* Return a version of the TYPE, qualified as indicated by the
6596 TYPE_QUALS, if one exists. If no qualified version exists yet,
6597 return NULL_TREE. */
6600 get_qualified_type (tree type
, int type_quals
)
6604 if (TYPE_QUALS (type
) == type_quals
)
6607 /* Search the chain of variants to see if there is already one there just
6608 like the one we need to have. If so, use that existing one. We must
6609 preserve the TYPE_NAME, since there is code that depends on this. */
6610 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
6611 if (check_qualified_type (t
, type
, type_quals
))
6617 /* Like get_qualified_type, but creates the type if it does not
6618 exist. This function never returns NULL_TREE. */
6621 build_qualified_type (tree type
, int type_quals
)
6625 /* See if we already have the appropriate qualified variant. */
6626 t
= get_qualified_type (type
, type_quals
);
6628 /* If not, build it. */
6631 t
= build_variant_type_copy (type
);
6632 set_type_quals (t
, type_quals
);
6634 if (((type_quals
& TYPE_QUAL_ATOMIC
) == TYPE_QUAL_ATOMIC
))
6636 /* See if this object can map to a basic atomic type. */
6637 tree atomic_type
= find_atomic_core_type (type
);
6640 /* Ensure the alignment of this type is compatible with
6641 the required alignment of the atomic type. */
6642 if (TYPE_ALIGN (atomic_type
) > TYPE_ALIGN (t
))
6643 SET_TYPE_ALIGN (t
, TYPE_ALIGN (atomic_type
));
6647 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
6648 /* Propagate structural equality. */
6649 SET_TYPE_STRUCTURAL_EQUALITY (t
);
6650 else if (TYPE_CANONICAL (type
) != type
)
6651 /* Build the underlying canonical type, since it is different
6654 tree c
= build_qualified_type (TYPE_CANONICAL (type
), type_quals
);
6655 TYPE_CANONICAL (t
) = TYPE_CANONICAL (c
);
6658 /* T is its own canonical type. */
6659 TYPE_CANONICAL (t
) = t
;
6666 /* Create a variant of type T with alignment ALIGN. */
6669 build_aligned_type (tree type
, unsigned int align
)
6673 if (TYPE_PACKED (type
)
6674 || TYPE_ALIGN (type
) == align
)
6677 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
6678 if (check_aligned_type (t
, type
, align
))
6681 t
= build_variant_type_copy (type
);
6682 SET_TYPE_ALIGN (t
, align
);
6687 /* Create a new distinct copy of TYPE. The new type is made its own
6688 MAIN_VARIANT. If TYPE requires structural equality checks, the
6689 resulting type requires structural equality checks; otherwise, its
6690 TYPE_CANONICAL points to itself. */
6693 build_distinct_type_copy (tree type
)
6695 tree t
= copy_node (type
);
6697 TYPE_POINTER_TO (t
) = 0;
6698 TYPE_REFERENCE_TO (t
) = 0;
6700 /* Set the canonical type either to a new equivalence class, or
6701 propagate the need for structural equality checks. */
6702 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
6703 SET_TYPE_STRUCTURAL_EQUALITY (t
);
6705 TYPE_CANONICAL (t
) = t
;
6707 /* Make it its own variant. */
6708 TYPE_MAIN_VARIANT (t
) = t
;
6709 TYPE_NEXT_VARIANT (t
) = 0;
6711 /* We do not record methods in type copies nor variants
6712 so we do not need to keep them up to date when new method
6714 if (RECORD_OR_UNION_TYPE_P (t
))
6715 TYPE_METHODS (t
) = NULL_TREE
;
6717 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
6718 whose TREE_TYPE is not t. This can also happen in the Ada
6719 frontend when using subtypes. */
6724 /* Create a new variant of TYPE, equivalent but distinct. This is so
6725 the caller can modify it. TYPE_CANONICAL for the return type will
6726 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
6727 are considered equal by the language itself (or that both types
6728 require structural equality checks). */
6731 build_variant_type_copy (tree type
)
6733 tree t
, m
= TYPE_MAIN_VARIANT (type
);
6735 t
= build_distinct_type_copy (type
);
6737 /* Since we're building a variant, assume that it is a non-semantic
6738 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
6739 TYPE_CANONICAL (t
) = TYPE_CANONICAL (type
);
6740 /* Type variants have no alias set defined. */
6741 TYPE_ALIAS_SET (t
) = -1;
6743 /* Add the new type to the chain of variants of TYPE. */
6744 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (m
);
6745 TYPE_NEXT_VARIANT (m
) = t
;
6746 TYPE_MAIN_VARIANT (t
) = m
;
6751 /* Return true if the from tree in both tree maps are equal. */
6754 tree_map_base_eq (const void *va
, const void *vb
)
6756 const struct tree_map_base
*const a
= (const struct tree_map_base
*) va
,
6757 *const b
= (const struct tree_map_base
*) vb
;
6758 return (a
->from
== b
->from
);
6761 /* Hash a from tree in a tree_base_map. */
6764 tree_map_base_hash (const void *item
)
6766 return htab_hash_pointer (((const struct tree_map_base
*)item
)->from
);
6769 /* Return true if this tree map structure is marked for garbage collection
6770 purposes. We simply return true if the from tree is marked, so that this
6771 structure goes away when the from tree goes away. */
6774 tree_map_base_marked_p (const void *p
)
6776 return ggc_marked_p (((const struct tree_map_base
*) p
)->from
);
6779 /* Hash a from tree in a tree_map. */
6782 tree_map_hash (const void *item
)
6784 return (((const struct tree_map
*) item
)->hash
);
6787 /* Hash a from tree in a tree_decl_map. */
6790 tree_decl_map_hash (const void *item
)
6792 return DECL_UID (((const struct tree_decl_map
*) item
)->base
.from
);
6795 /* Return the initialization priority for DECL. */
6798 decl_init_priority_lookup (tree decl
)
6800 symtab_node
*snode
= symtab_node::get (decl
);
6803 return DEFAULT_INIT_PRIORITY
;
6805 snode
->get_init_priority ();
6808 /* Return the finalization priority for DECL. */
6811 decl_fini_priority_lookup (tree decl
)
6813 cgraph_node
*node
= cgraph_node::get (decl
);
6816 return DEFAULT_INIT_PRIORITY
;
6818 node
->get_fini_priority ();
6821 /* Set the initialization priority for DECL to PRIORITY. */
6824 decl_init_priority_insert (tree decl
, priority_type priority
)
6826 struct symtab_node
*snode
;
6828 if (priority
== DEFAULT_INIT_PRIORITY
)
6830 snode
= symtab_node::get (decl
);
6834 else if (TREE_CODE (decl
) == VAR_DECL
)
6835 snode
= varpool_node::get_create (decl
);
6837 snode
= cgraph_node::get_create (decl
);
6838 snode
->set_init_priority (priority
);
6841 /* Set the finalization priority for DECL to PRIORITY. */
6844 decl_fini_priority_insert (tree decl
, priority_type priority
)
6846 struct cgraph_node
*node
;
6848 if (priority
== DEFAULT_INIT_PRIORITY
)
6850 node
= cgraph_node::get (decl
);
6855 node
= cgraph_node::get_create (decl
);
6856 node
->set_fini_priority (priority
);
6859 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
6862 print_debug_expr_statistics (void)
6864 fprintf (stderr
, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
6865 (long) debug_expr_for_decl
->size (),
6866 (long) debug_expr_for_decl
->elements (),
6867 debug_expr_for_decl
->collisions ());
6870 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
6873 print_value_expr_statistics (void)
6875 fprintf (stderr
, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
6876 (long) value_expr_for_decl
->size (),
6877 (long) value_expr_for_decl
->elements (),
6878 value_expr_for_decl
->collisions ());
6881 /* Lookup a debug expression for FROM, and return it if we find one. */
6884 decl_debug_expr_lookup (tree from
)
6886 struct tree_decl_map
*h
, in
;
6887 in
.base
.from
= from
;
6889 h
= debug_expr_for_decl
->find_with_hash (&in
, DECL_UID (from
));
6895 /* Insert a mapping FROM->TO in the debug expression hashtable. */
6898 decl_debug_expr_insert (tree from
, tree to
)
6900 struct tree_decl_map
*h
;
6902 h
= ggc_alloc
<tree_decl_map
> ();
6903 h
->base
.from
= from
;
6905 *debug_expr_for_decl
->find_slot_with_hash (h
, DECL_UID (from
), INSERT
) = h
;
6908 /* Lookup a value expression for FROM, and return it if we find one. */
6911 decl_value_expr_lookup (tree from
)
6913 struct tree_decl_map
*h
, in
;
6914 in
.base
.from
= from
;
6916 h
= value_expr_for_decl
->find_with_hash (&in
, DECL_UID (from
));
6922 /* Insert a mapping FROM->TO in the value expression hashtable. */
6925 decl_value_expr_insert (tree from
, tree to
)
6927 struct tree_decl_map
*h
;
6929 h
= ggc_alloc
<tree_decl_map
> ();
6930 h
->base
.from
= from
;
6932 *value_expr_for_decl
->find_slot_with_hash (h
, DECL_UID (from
), INSERT
) = h
;
6935 /* Lookup a vector of debug arguments for FROM, and return it if we
6939 decl_debug_args_lookup (tree from
)
6941 struct tree_vec_map
*h
, in
;
6943 if (!DECL_HAS_DEBUG_ARGS_P (from
))
6945 gcc_checking_assert (debug_args_for_decl
!= NULL
);
6946 in
.base
.from
= from
;
6947 h
= debug_args_for_decl
->find_with_hash (&in
, DECL_UID (from
));
6953 /* Insert a mapping FROM->empty vector of debug arguments in the value
6954 expression hashtable. */
6957 decl_debug_args_insert (tree from
)
6959 struct tree_vec_map
*h
;
6962 if (DECL_HAS_DEBUG_ARGS_P (from
))
6963 return decl_debug_args_lookup (from
);
6964 if (debug_args_for_decl
== NULL
)
6965 debug_args_for_decl
= hash_table
<tree_vec_map_cache_hasher
>::create_ggc (64);
6966 h
= ggc_alloc
<tree_vec_map
> ();
6967 h
->base
.from
= from
;
6969 loc
= debug_args_for_decl
->find_slot_with_hash (h
, DECL_UID (from
), INSERT
);
6971 DECL_HAS_DEBUG_ARGS_P (from
) = 1;
6975 /* Hashing of types so that we don't make duplicates.
6976 The entry point is `type_hash_canon'. */
6978 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
6979 with types in the TREE_VALUE slots), by adding the hash codes
6980 of the individual types. */
6983 type_hash_list (const_tree list
, inchash::hash
&hstate
)
6987 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
6988 if (TREE_VALUE (tail
) != error_mark_node
)
6989 hstate
.add_object (TYPE_HASH (TREE_VALUE (tail
)));
6992 /* These are the Hashtable callback functions. */
6994 /* Returns true iff the types are equivalent. */
6997 type_cache_hasher::equal (type_hash
*a
, type_hash
*b
)
6999 /* First test the things that are the same for all types. */
7000 if (a
->hash
!= b
->hash
7001 || TREE_CODE (a
->type
) != TREE_CODE (b
->type
)
7002 || TREE_TYPE (a
->type
) != TREE_TYPE (b
->type
)
7003 || !attribute_list_equal (TYPE_ATTRIBUTES (a
->type
),
7004 TYPE_ATTRIBUTES (b
->type
))
7005 || (TREE_CODE (a
->type
) != COMPLEX_TYPE
7006 && TYPE_NAME (a
->type
) != TYPE_NAME (b
->type
)))
7009 /* Be careful about comparing arrays before and after the element type
7010 has been completed; don't compare TYPE_ALIGN unless both types are
7012 if (COMPLETE_TYPE_P (a
->type
) && COMPLETE_TYPE_P (b
->type
)
7013 && (TYPE_ALIGN (a
->type
) != TYPE_ALIGN (b
->type
)
7014 || TYPE_MODE (a
->type
) != TYPE_MODE (b
->type
)))
7017 switch (TREE_CODE (a
->type
))
7022 case REFERENCE_TYPE
:
7027 return TYPE_VECTOR_SUBPARTS (a
->type
) == TYPE_VECTOR_SUBPARTS (b
->type
);
7030 if (TYPE_VALUES (a
->type
) != TYPE_VALUES (b
->type
)
7031 && !(TYPE_VALUES (a
->type
)
7032 && TREE_CODE (TYPE_VALUES (a
->type
)) == TREE_LIST
7033 && TYPE_VALUES (b
->type
)
7034 && TREE_CODE (TYPE_VALUES (b
->type
)) == TREE_LIST
7035 && type_list_equal (TYPE_VALUES (a
->type
),
7036 TYPE_VALUES (b
->type
))))
7039 /* ... fall through ... */
7044 if (TYPE_PRECISION (a
->type
) != TYPE_PRECISION (b
->type
))
7046 return ((TYPE_MAX_VALUE (a
->type
) == TYPE_MAX_VALUE (b
->type
)
7047 || tree_int_cst_equal (TYPE_MAX_VALUE (a
->type
),
7048 TYPE_MAX_VALUE (b
->type
)))
7049 && (TYPE_MIN_VALUE (a
->type
) == TYPE_MIN_VALUE (b
->type
)
7050 || tree_int_cst_equal (TYPE_MIN_VALUE (a
->type
),
7051 TYPE_MIN_VALUE (b
->type
))));
7053 case FIXED_POINT_TYPE
:
7054 return TYPE_SATURATING (a
->type
) == TYPE_SATURATING (b
->type
);
7057 return TYPE_OFFSET_BASETYPE (a
->type
) == TYPE_OFFSET_BASETYPE (b
->type
);
7060 if (TYPE_METHOD_BASETYPE (a
->type
) == TYPE_METHOD_BASETYPE (b
->type
)
7061 && (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
7062 || (TYPE_ARG_TYPES (a
->type
)
7063 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
7064 && TYPE_ARG_TYPES (b
->type
)
7065 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
7066 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
7067 TYPE_ARG_TYPES (b
->type
)))))
7071 return TYPE_DOMAIN (a
->type
) == TYPE_DOMAIN (b
->type
);
7075 case QUAL_UNION_TYPE
:
7076 return (TYPE_FIELDS (a
->type
) == TYPE_FIELDS (b
->type
)
7077 || (TYPE_FIELDS (a
->type
)
7078 && TREE_CODE (TYPE_FIELDS (a
->type
)) == TREE_LIST
7079 && TYPE_FIELDS (b
->type
)
7080 && TREE_CODE (TYPE_FIELDS (b
->type
)) == TREE_LIST
7081 && type_list_equal (TYPE_FIELDS (a
->type
),
7082 TYPE_FIELDS (b
->type
))));
7085 if (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
7086 || (TYPE_ARG_TYPES (a
->type
)
7087 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
7088 && TYPE_ARG_TYPES (b
->type
)
7089 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
7090 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
7091 TYPE_ARG_TYPES (b
->type
))))
7099 if (lang_hooks
.types
.type_hash_eq
!= NULL
)
7100 return lang_hooks
.types
.type_hash_eq (a
->type
, b
->type
);
7105 /* Given TYPE, and HASHCODE its hash code, return the canonical
7106 object for an identical type if one already exists.
7107 Otherwise, return TYPE, and record it as the canonical object.
7109 To use this function, first create a type of the sort you want.
7110 Then compute its hash code from the fields of the type that
7111 make it different from other similar types.
7112 Then call this function and use the value. */
7115 type_hash_canon (unsigned int hashcode
, tree type
)
7120 /* The hash table only contains main variants, so ensure that's what we're
7122 gcc_assert (TYPE_MAIN_VARIANT (type
) == type
);
7124 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
7125 must call that routine before comparing TYPE_ALIGNs. */
7131 loc
= type_hash_table
->find_slot_with_hash (&in
, hashcode
, INSERT
);
7134 tree t1
= ((type_hash
*) *loc
)->type
;
7135 gcc_assert (TYPE_MAIN_VARIANT (t1
) == t1
);
7141 struct type_hash
*h
;
7143 h
= ggc_alloc
<type_hash
> ();
7153 print_type_hash_statistics (void)
7155 fprintf (stderr
, "Type hash: size %ld, %ld elements, %f collisions\n",
7156 (long) type_hash_table
->size (),
7157 (long) type_hash_table
->elements (),
7158 type_hash_table
->collisions ());
7161 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
7162 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
7163 by adding the hash codes of the individual attributes. */
7166 attribute_hash_list (const_tree list
, inchash::hash
&hstate
)
7170 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
7171 /* ??? Do we want to add in TREE_VALUE too? */
7172 hstate
.add_object (IDENTIFIER_HASH_VALUE (get_attribute_name (tail
)));
7175 /* Given two lists of attributes, return true if list l2 is
7176 equivalent to l1. */
7179 attribute_list_equal (const_tree l1
, const_tree l2
)
7184 return attribute_list_contained (l1
, l2
)
7185 && attribute_list_contained (l2
, l1
);
7188 /* Given two lists of attributes, return true if list L2 is
7189 completely contained within L1. */
7190 /* ??? This would be faster if attribute names were stored in a canonicalized
7191 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
7192 must be used to show these elements are equivalent (which they are). */
7193 /* ??? It's not clear that attributes with arguments will always be handled
7197 attribute_list_contained (const_tree l1
, const_tree l2
)
7201 /* First check the obvious, maybe the lists are identical. */
7205 /* Maybe the lists are similar. */
7206 for (t1
= l1
, t2
= l2
;
7208 && get_attribute_name (t1
) == get_attribute_name (t2
)
7209 && TREE_VALUE (t1
) == TREE_VALUE (t2
);
7210 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
7213 /* Maybe the lists are equal. */
7214 if (t1
== 0 && t2
== 0)
7217 for (; t2
!= 0; t2
= TREE_CHAIN (t2
))
7220 /* This CONST_CAST is okay because lookup_attribute does not
7221 modify its argument and the return value is assigned to a
7223 for (attr
= lookup_ident_attribute (get_attribute_name (t2
),
7224 CONST_CAST_TREE (l1
));
7225 attr
!= NULL_TREE
&& !attribute_value_equal (t2
, attr
);
7226 attr
= lookup_ident_attribute (get_attribute_name (t2
),
7230 if (attr
== NULL_TREE
)
7237 /* Given two lists of types
7238 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
7239 return 1 if the lists contain the same types in the same order.
7240 Also, the TREE_PURPOSEs must match. */
7243 type_list_equal (const_tree l1
, const_tree l2
)
7247 for (t1
= l1
, t2
= l2
; t1
&& t2
; t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
7248 if (TREE_VALUE (t1
) != TREE_VALUE (t2
)
7249 || (TREE_PURPOSE (t1
) != TREE_PURPOSE (t2
)
7250 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
))
7251 && (TREE_TYPE (TREE_PURPOSE (t1
))
7252 == TREE_TYPE (TREE_PURPOSE (t2
))))))
7258 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
7259 given by TYPE. If the argument list accepts variable arguments,
7260 then this function counts only the ordinary arguments. */
7263 type_num_arguments (const_tree type
)
7268 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
7269 /* If the function does not take a variable number of arguments,
7270 the last element in the list will have type `void'. */
7271 if (VOID_TYPE_P (TREE_VALUE (t
)))
7279 /* Nonzero if integer constants T1 and T2
7280 represent the same constant value. */
7283 tree_int_cst_equal (const_tree t1
, const_tree t2
)
7288 if (t1
== 0 || t2
== 0)
7291 if (TREE_CODE (t1
) == INTEGER_CST
7292 && TREE_CODE (t2
) == INTEGER_CST
7293 && wi::to_widest (t1
) == wi::to_widest (t2
))
7299 /* Return true if T is an INTEGER_CST whose numerical value (extended
7300 according to TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. */
7303 tree_fits_shwi_p (const_tree t
)
7305 return (t
!= NULL_TREE
7306 && TREE_CODE (t
) == INTEGER_CST
7307 && wi::fits_shwi_p (wi::to_widest (t
)));
7310 /* Return true if T is an INTEGER_CST whose numerical value (extended
7311 according to TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. */
7314 tree_fits_uhwi_p (const_tree t
)
7316 return (t
!= NULL_TREE
7317 && TREE_CODE (t
) == INTEGER_CST
7318 && wi::fits_uhwi_p (wi::to_widest (t
)));
7321 /* T is an INTEGER_CST whose numerical value (extended according to
7322 TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. Return that
7326 tree_to_shwi (const_tree t
)
7328 gcc_assert (tree_fits_shwi_p (t
));
7329 return TREE_INT_CST_LOW (t
);
7332 /* T is an INTEGER_CST whose numerical value (extended according to
7333 TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. Return that
7336 unsigned HOST_WIDE_INT
7337 tree_to_uhwi (const_tree t
)
7339 gcc_assert (tree_fits_uhwi_p (t
));
7340 return TREE_INT_CST_LOW (t
);
7343 /* Return the most significant (sign) bit of T. */
7346 tree_int_cst_sign_bit (const_tree t
)
7348 unsigned bitno
= TYPE_PRECISION (TREE_TYPE (t
)) - 1;
7350 return wi::extract_uhwi (t
, bitno
, 1);
7353 /* Return an indication of the sign of the integer constant T.
7354 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
7355 Note that -1 will never be returned if T's type is unsigned. */
7358 tree_int_cst_sgn (const_tree t
)
7360 if (wi::eq_p (t
, 0))
7362 else if (TYPE_UNSIGNED (TREE_TYPE (t
)))
7364 else if (wi::neg_p (t
))
7370 /* Return the minimum number of bits needed to represent VALUE in a
7371 signed or unsigned type, UNSIGNEDP says which. */
7374 tree_int_cst_min_precision (tree value
, signop sgn
)
7376 /* If the value is negative, compute its negative minus 1. The latter
7377 adjustment is because the absolute value of the largest negative value
7378 is one larger than the largest positive value. This is equivalent to
7379 a bit-wise negation, so use that operation instead. */
7381 if (tree_int_cst_sgn (value
) < 0)
7382 value
= fold_build1 (BIT_NOT_EXPR
, TREE_TYPE (value
), value
);
7384 /* Return the number of bits needed, taking into account the fact
7385 that we need one more bit for a signed than unsigned type.
7386 If value is 0 or -1, the minimum precision is 1 no matter
7387 whether unsignedp is true or false. */
7389 if (integer_zerop (value
))
7392 return tree_floor_log2 (value
) + 1 + (sgn
== SIGNED
? 1 : 0) ;
7395 /* Return truthvalue of whether T1 is the same tree structure as T2.
7396 Return 1 if they are the same.
7397 Return 0 if they are understandably different.
7398 Return -1 if either contains tree structure not understood by
7402 simple_cst_equal (const_tree t1
, const_tree t2
)
7404 enum tree_code code1
, code2
;
7410 if (t1
== 0 || t2
== 0)
7413 code1
= TREE_CODE (t1
);
7414 code2
= TREE_CODE (t2
);
7416 if (CONVERT_EXPR_CODE_P (code1
) || code1
== NON_LVALUE_EXPR
)
7418 if (CONVERT_EXPR_CODE_P (code2
)
7419 || code2
== NON_LVALUE_EXPR
)
7420 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7422 return simple_cst_equal (TREE_OPERAND (t1
, 0), t2
);
7425 else if (CONVERT_EXPR_CODE_P (code2
)
7426 || code2
== NON_LVALUE_EXPR
)
7427 return simple_cst_equal (t1
, TREE_OPERAND (t2
, 0));
7435 return wi::to_widest (t1
) == wi::to_widest (t2
);
7438 return real_identical (&TREE_REAL_CST (t1
), &TREE_REAL_CST (t2
));
7441 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1
), TREE_FIXED_CST (t2
));
7444 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
7445 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
7446 TREE_STRING_LENGTH (t1
)));
7450 unsigned HOST_WIDE_INT idx
;
7451 vec
<constructor_elt
, va_gc
> *v1
= CONSTRUCTOR_ELTS (t1
);
7452 vec
<constructor_elt
, va_gc
> *v2
= CONSTRUCTOR_ELTS (t2
);
7454 if (vec_safe_length (v1
) != vec_safe_length (v2
))
7457 for (idx
= 0; idx
< vec_safe_length (v1
); ++idx
)
7458 /* ??? Should we handle also fields here? */
7459 if (!simple_cst_equal ((*v1
)[idx
].value
, (*v2
)[idx
].value
))
7465 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7468 cmp
= simple_cst_equal (CALL_EXPR_FN (t1
), CALL_EXPR_FN (t2
));
7471 if (call_expr_nargs (t1
) != call_expr_nargs (t2
))
7474 const_tree arg1
, arg2
;
7475 const_call_expr_arg_iterator iter1
, iter2
;
7476 for (arg1
= first_const_call_expr_arg (t1
, &iter1
),
7477 arg2
= first_const_call_expr_arg (t2
, &iter2
);
7479 arg1
= next_const_call_expr_arg (&iter1
),
7480 arg2
= next_const_call_expr_arg (&iter2
))
7482 cmp
= simple_cst_equal (arg1
, arg2
);
7486 return arg1
== arg2
;
7490 /* Special case: if either target is an unallocated VAR_DECL,
7491 it means that it's going to be unified with whatever the
7492 TARGET_EXPR is really supposed to initialize, so treat it
7493 as being equivalent to anything. */
7494 if ((TREE_CODE (TREE_OPERAND (t1
, 0)) == VAR_DECL
7495 && DECL_NAME (TREE_OPERAND (t1
, 0)) == NULL_TREE
7496 && !DECL_RTL_SET_P (TREE_OPERAND (t1
, 0)))
7497 || (TREE_CODE (TREE_OPERAND (t2
, 0)) == VAR_DECL
7498 && DECL_NAME (TREE_OPERAND (t2
, 0)) == NULL_TREE
7499 && !DECL_RTL_SET_P (TREE_OPERAND (t2
, 0))))
7502 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7507 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
7509 case WITH_CLEANUP_EXPR
:
7510 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7514 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t1
, 1));
7517 if (TREE_OPERAND (t1
, 1) == TREE_OPERAND (t2
, 1))
7518 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7532 /* This general rule works for most tree codes. All exceptions should be
7533 handled above. If this is a language-specific tree code, we can't
7534 trust what might be in the operand, so say we don't know
7536 if ((int) code1
>= (int) LAST_AND_UNUSED_TREE_CODE
)
7539 switch (TREE_CODE_CLASS (code1
))
7543 case tcc_comparison
:
7544 case tcc_expression
:
7548 for (i
= 0; i
< TREE_CODE_LENGTH (code1
); i
++)
7550 cmp
= simple_cst_equal (TREE_OPERAND (t1
, i
), TREE_OPERAND (t2
, i
));
7562 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
7563 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
7564 than U, respectively. */
7567 compare_tree_int (const_tree t
, unsigned HOST_WIDE_INT u
)
7569 if (tree_int_cst_sgn (t
) < 0)
7571 else if (!tree_fits_uhwi_p (t
))
7573 else if (TREE_INT_CST_LOW (t
) == u
)
7575 else if (TREE_INT_CST_LOW (t
) < u
)
7581 /* Return true if SIZE represents a constant size that is in bounds of
7582 what the middle-end and the backend accepts (covering not more than
7583 half of the address-space). */
7586 valid_constant_size_p (const_tree size
)
7588 if (! tree_fits_uhwi_p (size
)
7589 || TREE_OVERFLOW (size
)
7590 || tree_int_cst_sign_bit (size
) != 0)
7595 /* Return the precision of the type, or for a complex or vector type the
7596 precision of the type of its elements. */
7599 element_precision (const_tree type
)
7602 type
= TREE_TYPE (type
);
7603 enum tree_code code
= TREE_CODE (type
);
7604 if (code
== COMPLEX_TYPE
|| code
== VECTOR_TYPE
)
7605 type
= TREE_TYPE (type
);
7607 return TYPE_PRECISION (type
);
7610 /* Return true if CODE represents an associative tree code. Otherwise
7613 associative_tree_code (enum tree_code code
)
7632 /* Return true if CODE represents a commutative tree code. Otherwise
7635 commutative_tree_code (enum tree_code code
)
7641 case MULT_HIGHPART_EXPR
:
7649 case UNORDERED_EXPR
:
7653 case TRUTH_AND_EXPR
:
7654 case TRUTH_XOR_EXPR
:
7656 case WIDEN_MULT_EXPR
:
7657 case VEC_WIDEN_MULT_HI_EXPR
:
7658 case VEC_WIDEN_MULT_LO_EXPR
:
7659 case VEC_WIDEN_MULT_EVEN_EXPR
:
7660 case VEC_WIDEN_MULT_ODD_EXPR
:
7669 /* Return true if CODE represents a ternary tree code for which the
7670 first two operands are commutative. Otherwise return false. */
7672 commutative_ternary_tree_code (enum tree_code code
)
7676 case WIDEN_MULT_PLUS_EXPR
:
7677 case WIDEN_MULT_MINUS_EXPR
:
7688 /* Returns true if CODE can overflow. */
7691 operation_can_overflow (enum tree_code code
)
7699 /* Can overflow in various ways. */
7701 case TRUNC_DIV_EXPR
:
7702 case EXACT_DIV_EXPR
:
7703 case FLOOR_DIV_EXPR
:
7705 /* For INT_MIN / -1. */
7712 /* These operators cannot overflow. */
7717 /* Returns true if CODE operating on operands of type TYPE doesn't overflow, or
7718 ftrapv doesn't generate trapping insns for CODE. */
7721 operation_no_trapping_overflow (tree type
, enum tree_code code
)
7723 gcc_checking_assert (ANY_INTEGRAL_TYPE_P (type
));
7725 /* We don't generate instructions that trap on overflow for complex or vector
7727 if (!INTEGRAL_TYPE_P (type
))
7730 if (!TYPE_OVERFLOW_TRAPS (type
))
7740 /* These operators can overflow, and -ftrapv generates trapping code for
7743 case TRUNC_DIV_EXPR
:
7744 case EXACT_DIV_EXPR
:
7745 case FLOOR_DIV_EXPR
:
7748 /* These operators can overflow, but -ftrapv does not generate trapping
7752 /* These operators cannot overflow. */
7760 /* Generate a hash value for an expression. This can be used iteratively
7761 by passing a previous result as the HSTATE argument.
7763 This function is intended to produce the same hash for expressions which
7764 would compare equal using operand_equal_p. */
7766 add_expr (const_tree t
, inchash::hash
&hstate
, unsigned int flags
)
7769 enum tree_code code
;
7770 enum tree_code_class tclass
;
7774 hstate
.merge_hash (0);
7778 if (!(flags
& OEP_ADDRESS_OF
))
7781 code
= TREE_CODE (t
);
7785 /* Alas, constants aren't shared, so we can't rely on pointer
7788 hstate
.merge_hash (0);
7791 gcc_checking_assert (!(flags
& OEP_ADDRESS_OF
));
7792 for (i
= 0; i
< TREE_INT_CST_EXT_NUNITS (t
); i
++)
7793 hstate
.add_wide_int (TREE_INT_CST_ELT (t
, i
));
7798 if (!HONOR_SIGNED_ZEROS (t
) && real_zerop (t
))
7801 val2
= real_hash (TREE_REAL_CST_PTR (t
));
7802 hstate
.merge_hash (val2
);
7807 unsigned int val2
= fixed_hash (TREE_FIXED_CST_PTR (t
));
7808 hstate
.merge_hash (val2
);
7812 hstate
.add ((const void *) TREE_STRING_POINTER (t
),
7813 TREE_STRING_LENGTH (t
));
7816 inchash::add_expr (TREE_REALPART (t
), hstate
, flags
);
7817 inchash::add_expr (TREE_IMAGPART (t
), hstate
, flags
);
7822 for (i
= 0; i
< VECTOR_CST_NELTS (t
); ++i
)
7823 inchash::add_expr (VECTOR_CST_ELT (t
, i
), hstate
, flags
);
7827 /* We can just compare by pointer. */
7828 hstate
.add_wide_int (SSA_NAME_VERSION (t
));
7830 case PLACEHOLDER_EXPR
:
7831 /* The node itself doesn't matter. */
7838 /* A list of expressions, for a CALL_EXPR or as the elements of a
7840 for (; t
; t
= TREE_CHAIN (t
))
7841 inchash::add_expr (TREE_VALUE (t
), hstate
, flags
);
7845 unsigned HOST_WIDE_INT idx
;
7847 flags
&= ~OEP_ADDRESS_OF
;
7848 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t
), idx
, field
, value
)
7850 inchash::add_expr (field
, hstate
, flags
);
7851 inchash::add_expr (value
, hstate
, flags
);
7855 case STATEMENT_LIST
:
7857 tree_stmt_iterator i
;
7858 for (i
= tsi_start (CONST_CAST_TREE (t
));
7859 !tsi_end_p (i
); tsi_next (&i
))
7860 inchash::add_expr (tsi_stmt (i
), hstate
, flags
);
7864 /* When referring to a built-in FUNCTION_DECL, use the __builtin__ form.
7865 Otherwise nodes that compare equal according to operand_equal_p might
7866 get different hash codes. However, don't do this for machine specific
7867 or front end builtins, since the function code is overloaded in those
7869 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
7870 && builtin_decl_explicit_p (DECL_FUNCTION_CODE (t
)))
7872 t
= builtin_decl_explicit (DECL_FUNCTION_CODE (t
));
7873 code
= TREE_CODE (t
);
7877 tclass
= TREE_CODE_CLASS (code
);
7879 if (tclass
== tcc_declaration
)
7881 /* DECL's have a unique ID */
7882 hstate
.add_wide_int (DECL_UID (t
));
7884 else if (tclass
== tcc_comparison
&& !commutative_tree_code (code
))
7886 /* For comparisons that can be swapped, use the lower
7888 enum tree_code ccode
= swap_tree_comparison (code
);
7891 hstate
.add_object (ccode
);
7892 inchash::add_expr (TREE_OPERAND (t
, ccode
!= code
), hstate
, flags
);
7893 inchash::add_expr (TREE_OPERAND (t
, ccode
== code
), hstate
, flags
);
7895 else if (CONVERT_EXPR_CODE_P (code
))
7897 /* NOP_EXPR and CONVERT_EXPR are considered equal by
7899 enum tree_code ccode
= NOP_EXPR
;
7900 hstate
.add_object (ccode
);
7902 /* Don't hash the type, that can lead to having nodes which
7903 compare equal according to operand_equal_p, but which
7904 have different hash codes. Make sure to include signedness
7905 in the hash computation. */
7906 hstate
.add_int (TYPE_UNSIGNED (TREE_TYPE (t
)));
7907 inchash::add_expr (TREE_OPERAND (t
, 0), hstate
, flags
);
7909 /* For OEP_ADDRESS_OF, hash MEM_EXPR[&decl, 0] the same as decl. */
7910 else if (code
== MEM_REF
7911 && (flags
& OEP_ADDRESS_OF
) != 0
7912 && TREE_CODE (TREE_OPERAND (t
, 0)) == ADDR_EXPR
7913 && DECL_P (TREE_OPERAND (TREE_OPERAND (t
, 0), 0))
7914 && integer_zerop (TREE_OPERAND (t
, 1)))
7915 inchash::add_expr (TREE_OPERAND (TREE_OPERAND (t
, 0), 0),
7917 /* Don't ICE on FE specific trees, or their arguments etc.
7918 during operand_equal_p hash verification. */
7919 else if (!IS_EXPR_CODE_CLASS (tclass
))
7920 gcc_assert (flags
& OEP_HASH_CHECK
);
7923 unsigned int sflags
= flags
;
7925 hstate
.add_object (code
);
7930 gcc_checking_assert (!(flags
& OEP_ADDRESS_OF
));
7931 flags
|= OEP_ADDRESS_OF
;
7937 case TARGET_MEM_REF
:
7938 flags
&= ~OEP_ADDRESS_OF
;
7943 case ARRAY_RANGE_REF
:
7946 sflags
&= ~OEP_ADDRESS_OF
;
7950 flags
&= ~OEP_ADDRESS_OF
;
7954 case WIDEN_MULT_PLUS_EXPR
:
7955 case WIDEN_MULT_MINUS_EXPR
:
7957 /* The multiplication operands are commutative. */
7958 inchash::hash one
, two
;
7959 inchash::add_expr (TREE_OPERAND (t
, 0), one
, flags
);
7960 inchash::add_expr (TREE_OPERAND (t
, 1), two
, flags
);
7961 hstate
.add_commutative (one
, two
);
7962 inchash::add_expr (TREE_OPERAND (t
, 2), two
, flags
);
7967 if (CALL_EXPR_FN (t
) == NULL_TREE
)
7968 hstate
.add_int (CALL_EXPR_IFN (t
));
7972 /* For TARGET_EXPR, just hash on the TARGET_EXPR_SLOT.
7973 Usually different TARGET_EXPRs just should use
7974 different temporaries in their slots. */
7975 inchash::add_expr (TARGET_EXPR_SLOT (t
), hstate
, flags
);
7982 /* Don't hash the type, that can lead to having nodes which
7983 compare equal according to operand_equal_p, but which
7984 have different hash codes. */
7985 if (code
== NON_LVALUE_EXPR
)
7987 /* Make sure to include signness in the hash computation. */
7988 hstate
.add_int (TYPE_UNSIGNED (TREE_TYPE (t
)));
7989 inchash::add_expr (TREE_OPERAND (t
, 0), hstate
, flags
);
7992 else if (commutative_tree_code (code
))
7994 /* It's a commutative expression. We want to hash it the same
7995 however it appears. We do this by first hashing both operands
7996 and then rehashing based on the order of their independent
7998 inchash::hash one
, two
;
7999 inchash::add_expr (TREE_OPERAND (t
, 0), one
, flags
);
8000 inchash::add_expr (TREE_OPERAND (t
, 1), two
, flags
);
8001 hstate
.add_commutative (one
, two
);
8004 for (i
= TREE_OPERAND_LENGTH (t
) - 1; i
>= 0; --i
)
8005 inchash::add_expr (TREE_OPERAND (t
, i
), hstate
,
8006 i
== 0 ? flags
: sflags
);
8014 /* Constructors for pointer, array and function types.
8015 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
8016 constructed by language-dependent code, not here.) */
8018 /* Construct, lay out and return the type of pointers to TO_TYPE with
8019 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
8020 reference all of memory. If such a type has already been
8021 constructed, reuse it. */
8024 build_pointer_type_for_mode (tree to_type
, machine_mode mode
,
8028 bool could_alias
= can_alias_all
;
8030 if (to_type
== error_mark_node
)
8031 return error_mark_node
;
8033 /* If the pointed-to type has the may_alias attribute set, force
8034 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
8035 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
8036 can_alias_all
= true;
8038 /* In some cases, languages will have things that aren't a POINTER_TYPE
8039 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
8040 In that case, return that type without regard to the rest of our
8043 ??? This is a kludge, but consistent with the way this function has
8044 always operated and there doesn't seem to be a good way to avoid this
8046 if (TYPE_POINTER_TO (to_type
) != 0
8047 && TREE_CODE (TYPE_POINTER_TO (to_type
)) != POINTER_TYPE
)
8048 return TYPE_POINTER_TO (to_type
);
8050 /* First, if we already have a type for pointers to TO_TYPE and it's
8051 the proper mode, use it. */
8052 for (t
= TYPE_POINTER_TO (to_type
); t
; t
= TYPE_NEXT_PTR_TO (t
))
8053 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
8056 t
= make_node (POINTER_TYPE
);
8058 TREE_TYPE (t
) = to_type
;
8059 SET_TYPE_MODE (t
, mode
);
8060 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
8061 TYPE_NEXT_PTR_TO (t
) = TYPE_POINTER_TO (to_type
);
8062 TYPE_POINTER_TO (to_type
) = t
;
8064 /* During LTO we do not set TYPE_CANONICAL of pointers and references. */
8065 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
) || in_lto_p
)
8066 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8067 else if (TYPE_CANONICAL (to_type
) != to_type
|| could_alias
)
8069 = build_pointer_type_for_mode (TYPE_CANONICAL (to_type
),
8072 /* Lay out the type. This function has many callers that are concerned
8073 with expression-construction, and this simplifies them all. */
8079 /* By default build pointers in ptr_mode. */
8082 build_pointer_type (tree to_type
)
8084 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
8085 : TYPE_ADDR_SPACE (to_type
);
8086 machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
8087 return build_pointer_type_for_mode (to_type
, pointer_mode
, false);
8090 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
8093 build_reference_type_for_mode (tree to_type
, machine_mode mode
,
8097 bool could_alias
= can_alias_all
;
8099 if (to_type
== error_mark_node
)
8100 return error_mark_node
;
8102 /* If the pointed-to type has the may_alias attribute set, force
8103 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
8104 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
8105 can_alias_all
= true;
8107 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
8108 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
8109 In that case, return that type without regard to the rest of our
8112 ??? This is a kludge, but consistent with the way this function has
8113 always operated and there doesn't seem to be a good way to avoid this
8115 if (TYPE_REFERENCE_TO (to_type
) != 0
8116 && TREE_CODE (TYPE_REFERENCE_TO (to_type
)) != REFERENCE_TYPE
)
8117 return TYPE_REFERENCE_TO (to_type
);
8119 /* First, if we already have a type for pointers to TO_TYPE and it's
8120 the proper mode, use it. */
8121 for (t
= TYPE_REFERENCE_TO (to_type
); t
; t
= TYPE_NEXT_REF_TO (t
))
8122 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
8125 t
= make_node (REFERENCE_TYPE
);
8127 TREE_TYPE (t
) = to_type
;
8128 SET_TYPE_MODE (t
, mode
);
8129 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
8130 TYPE_NEXT_REF_TO (t
) = TYPE_REFERENCE_TO (to_type
);
8131 TYPE_REFERENCE_TO (to_type
) = t
;
8133 /* During LTO we do not set TYPE_CANONICAL of pointers and references. */
8134 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
) || in_lto_p
)
8135 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8136 else if (TYPE_CANONICAL (to_type
) != to_type
|| could_alias
)
8138 = build_reference_type_for_mode (TYPE_CANONICAL (to_type
),
8147 /* Build the node for the type of references-to-TO_TYPE by default
8151 build_reference_type (tree to_type
)
8153 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
8154 : TYPE_ADDR_SPACE (to_type
);
8155 machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
8156 return build_reference_type_for_mode (to_type
, pointer_mode
, false);
8159 #define MAX_INT_CACHED_PREC \
8160 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
8161 static GTY(()) tree nonstandard_integer_type_cache
[2 * MAX_INT_CACHED_PREC
+ 2];
8163 /* Builds a signed or unsigned integer type of precision PRECISION.
8164 Used for C bitfields whose precision does not match that of
8165 built-in target types. */
8167 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision
,
8173 unsignedp
= MAX_INT_CACHED_PREC
+ 1;
8175 if (precision
<= MAX_INT_CACHED_PREC
)
8177 itype
= nonstandard_integer_type_cache
[precision
+ unsignedp
];
8182 itype
= make_node (INTEGER_TYPE
);
8183 TYPE_PRECISION (itype
) = precision
;
8186 fixup_unsigned_type (itype
);
8188 fixup_signed_type (itype
);
8191 if (tree_fits_uhwi_p (TYPE_MAX_VALUE (itype
)))
8192 ret
= type_hash_canon (tree_to_uhwi (TYPE_MAX_VALUE (itype
)), itype
);
8193 if (precision
<= MAX_INT_CACHED_PREC
)
8194 nonstandard_integer_type_cache
[precision
+ unsignedp
] = ret
;
8199 #define MAX_BOOL_CACHED_PREC \
8200 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
8201 static GTY(()) tree nonstandard_boolean_type_cache
[MAX_BOOL_CACHED_PREC
+ 1];
8203 /* Builds a boolean type of precision PRECISION.
8204 Used for boolean vectors to choose proper vector element size. */
8206 build_nonstandard_boolean_type (unsigned HOST_WIDE_INT precision
)
8210 if (precision
<= MAX_BOOL_CACHED_PREC
)
8212 type
= nonstandard_boolean_type_cache
[precision
];
8217 type
= make_node (BOOLEAN_TYPE
);
8218 TYPE_PRECISION (type
) = precision
;
8219 fixup_signed_type (type
);
8221 if (precision
<= MAX_INT_CACHED_PREC
)
8222 nonstandard_boolean_type_cache
[precision
] = type
;
8227 /* Create a range of some discrete type TYPE (an INTEGER_TYPE, ENUMERAL_TYPE
8228 or BOOLEAN_TYPE) with low bound LOWVAL and high bound HIGHVAL. If SHARED
8229 is true, reuse such a type that has already been constructed. */
8232 build_range_type_1 (tree type
, tree lowval
, tree highval
, bool shared
)
8234 tree itype
= make_node (INTEGER_TYPE
);
8235 inchash::hash hstate
;
8237 TREE_TYPE (itype
) = type
;
8239 TYPE_MIN_VALUE (itype
) = fold_convert (type
, lowval
);
8240 TYPE_MAX_VALUE (itype
) = highval
? fold_convert (type
, highval
) : NULL
;
8242 TYPE_PRECISION (itype
) = TYPE_PRECISION (type
);
8243 SET_TYPE_MODE (itype
, TYPE_MODE (type
));
8244 TYPE_SIZE (itype
) = TYPE_SIZE (type
);
8245 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (type
);
8246 SET_TYPE_ALIGN (itype
, TYPE_ALIGN (type
));
8247 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (type
);
8252 if ((TYPE_MIN_VALUE (itype
)
8253 && TREE_CODE (TYPE_MIN_VALUE (itype
)) != INTEGER_CST
)
8254 || (TYPE_MAX_VALUE (itype
)
8255 && TREE_CODE (TYPE_MAX_VALUE (itype
)) != INTEGER_CST
))
8257 /* Since we cannot reliably merge this type, we need to compare it using
8258 structural equality checks. */
8259 SET_TYPE_STRUCTURAL_EQUALITY (itype
);
8263 inchash::add_expr (TYPE_MIN_VALUE (itype
), hstate
);
8264 inchash::add_expr (TYPE_MAX_VALUE (itype
), hstate
);
8265 hstate
.merge_hash (TYPE_HASH (type
));
8266 itype
= type_hash_canon (hstate
.end (), itype
);
8271 /* Wrapper around build_range_type_1 with SHARED set to true. */
8274 build_range_type (tree type
, tree lowval
, tree highval
)
8276 return build_range_type_1 (type
, lowval
, highval
, true);
8279 /* Wrapper around build_range_type_1 with SHARED set to false. */
8282 build_nonshared_range_type (tree type
, tree lowval
, tree highval
)
8284 return build_range_type_1 (type
, lowval
, highval
, false);
8287 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
8288 MAXVAL should be the maximum value in the domain
8289 (one less than the length of the array).
8291 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
8292 We don't enforce this limit, that is up to caller (e.g. language front end).
8293 The limit exists because the result is a signed type and we don't handle
8294 sizes that use more than one HOST_WIDE_INT. */
8297 build_index_type (tree maxval
)
8299 return build_range_type (sizetype
, size_zero_node
, maxval
);
8302 /* Return true if the debug information for TYPE, a subtype, should be emitted
8303 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
8304 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
8305 debug info and doesn't reflect the source code. */
8308 subrange_type_for_debug_p (const_tree type
, tree
*lowval
, tree
*highval
)
8310 tree base_type
= TREE_TYPE (type
), low
, high
;
8312 /* Subrange types have a base type which is an integral type. */
8313 if (!INTEGRAL_TYPE_P (base_type
))
8316 /* Get the real bounds of the subtype. */
8317 if (lang_hooks
.types
.get_subrange_bounds
)
8318 lang_hooks
.types
.get_subrange_bounds (type
, &low
, &high
);
8321 low
= TYPE_MIN_VALUE (type
);
8322 high
= TYPE_MAX_VALUE (type
);
8325 /* If the type and its base type have the same representation and the same
8326 name, then the type is not a subrange but a copy of the base type. */
8327 if ((TREE_CODE (base_type
) == INTEGER_TYPE
8328 || TREE_CODE (base_type
) == BOOLEAN_TYPE
)
8329 && int_size_in_bytes (type
) == int_size_in_bytes (base_type
)
8330 && tree_int_cst_equal (low
, TYPE_MIN_VALUE (base_type
))
8331 && tree_int_cst_equal (high
, TYPE_MAX_VALUE (base_type
))
8332 && TYPE_IDENTIFIER (type
) == TYPE_IDENTIFIER (base_type
))
8342 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
8343 and number of elements specified by the range of values of INDEX_TYPE.
8344 If SHARED is true, reuse such a type that has already been constructed. */
8347 build_array_type_1 (tree elt_type
, tree index_type
, bool shared
)
8351 if (TREE_CODE (elt_type
) == FUNCTION_TYPE
)
8353 error ("arrays of functions are not meaningful");
8354 elt_type
= integer_type_node
;
8357 t
= make_node (ARRAY_TYPE
);
8358 TREE_TYPE (t
) = elt_type
;
8359 TYPE_DOMAIN (t
) = index_type
;
8360 TYPE_ADDR_SPACE (t
) = TYPE_ADDR_SPACE (elt_type
);
8363 /* If the element type is incomplete at this point we get marked for
8364 structural equality. Do not record these types in the canonical
8366 if (TYPE_STRUCTURAL_EQUALITY_P (t
))
8371 inchash::hash hstate
;
8372 hstate
.add_object (TYPE_HASH (elt_type
));
8374 hstate
.add_object (TYPE_HASH (index_type
));
8375 t
= type_hash_canon (hstate
.end (), t
);
8378 if (TYPE_CANONICAL (t
) == t
)
8380 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type
)
8381 || (index_type
&& TYPE_STRUCTURAL_EQUALITY_P (index_type
))
8383 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8384 else if (TYPE_CANONICAL (elt_type
) != elt_type
8385 || (index_type
&& TYPE_CANONICAL (index_type
) != index_type
))
8387 = build_array_type_1 (TYPE_CANONICAL (elt_type
),
8389 ? TYPE_CANONICAL (index_type
) : NULL_TREE
,
8396 /* Wrapper around build_array_type_1 with SHARED set to true. */
8399 build_array_type (tree elt_type
, tree index_type
)
8401 return build_array_type_1 (elt_type
, index_type
, true);
8404 /* Wrapper around build_array_type_1 with SHARED set to false. */
8407 build_nonshared_array_type (tree elt_type
, tree index_type
)
8409 return build_array_type_1 (elt_type
, index_type
, false);
8412 /* Return a representation of ELT_TYPE[NELTS], using indices of type
8416 build_array_type_nelts (tree elt_type
, unsigned HOST_WIDE_INT nelts
)
8418 return build_array_type (elt_type
, build_index_type (size_int (nelts
- 1)));
8421 /* Recursively examines the array elements of TYPE, until a non-array
8422 element type is found. */
8425 strip_array_types (tree type
)
8427 while (TREE_CODE (type
) == ARRAY_TYPE
)
8428 type
= TREE_TYPE (type
);
8433 /* Computes the canonical argument types from the argument type list
8436 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
8437 on entry to this function, or if any of the ARGTYPES are
8440 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
8441 true on entry to this function, or if any of the ARGTYPES are
8444 Returns a canonical argument list, which may be ARGTYPES when the
8445 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
8446 true) or would not differ from ARGTYPES. */
8449 maybe_canonicalize_argtypes (tree argtypes
,
8450 bool *any_structural_p
,
8451 bool *any_noncanonical_p
)
8454 bool any_noncanonical_argtypes_p
= false;
8456 for (arg
= argtypes
; arg
&& !(*any_structural_p
); arg
= TREE_CHAIN (arg
))
8458 if (!TREE_VALUE (arg
) || TREE_VALUE (arg
) == error_mark_node
)
8459 /* Fail gracefully by stating that the type is structural. */
8460 *any_structural_p
= true;
8461 else if (TYPE_STRUCTURAL_EQUALITY_P (TREE_VALUE (arg
)))
8462 *any_structural_p
= true;
8463 else if (TYPE_CANONICAL (TREE_VALUE (arg
)) != TREE_VALUE (arg
)
8464 || TREE_PURPOSE (arg
))
8465 /* If the argument has a default argument, we consider it
8466 non-canonical even though the type itself is canonical.
8467 That way, different variants of function and method types
8468 with default arguments will all point to the variant with
8469 no defaults as their canonical type. */
8470 any_noncanonical_argtypes_p
= true;
8473 if (*any_structural_p
)
8476 if (any_noncanonical_argtypes_p
)
8478 /* Build the canonical list of argument types. */
8479 tree canon_argtypes
= NULL_TREE
;
8480 bool is_void
= false;
8482 for (arg
= argtypes
; arg
; arg
= TREE_CHAIN (arg
))
8484 if (arg
== void_list_node
)
8487 canon_argtypes
= tree_cons (NULL_TREE
,
8488 TYPE_CANONICAL (TREE_VALUE (arg
)),
8492 canon_argtypes
= nreverse (canon_argtypes
);
8494 canon_argtypes
= chainon (canon_argtypes
, void_list_node
);
8496 /* There is a non-canonical type. */
8497 *any_noncanonical_p
= true;
8498 return canon_argtypes
;
8501 /* The canonical argument types are the same as ARGTYPES. */
8505 /* Construct, lay out and return
8506 the type of functions returning type VALUE_TYPE
8507 given arguments of types ARG_TYPES.
8508 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
8509 are data type nodes for the arguments of the function.
8510 If such a type has already been constructed, reuse it. */
8513 build_function_type (tree value_type
, tree arg_types
)
8516 inchash::hash hstate
;
8517 bool any_structural_p
, any_noncanonical_p
;
8518 tree canon_argtypes
;
8520 if (TREE_CODE (value_type
) == FUNCTION_TYPE
)
8522 error ("function return type cannot be function");
8523 value_type
= integer_type_node
;
8526 /* Make a node of the sort we want. */
8527 t
= make_node (FUNCTION_TYPE
);
8528 TREE_TYPE (t
) = value_type
;
8529 TYPE_ARG_TYPES (t
) = arg_types
;
8531 /* If we already have such a type, use the old one. */
8532 hstate
.add_object (TYPE_HASH (value_type
));
8533 type_hash_list (arg_types
, hstate
);
8534 t
= type_hash_canon (hstate
.end (), t
);
8536 /* Set up the canonical type. */
8537 any_structural_p
= TYPE_STRUCTURAL_EQUALITY_P (value_type
);
8538 any_noncanonical_p
= TYPE_CANONICAL (value_type
) != value_type
;
8539 canon_argtypes
= maybe_canonicalize_argtypes (arg_types
,
8541 &any_noncanonical_p
);
8542 if (any_structural_p
)
8543 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8544 else if (any_noncanonical_p
)
8545 TYPE_CANONICAL (t
) = build_function_type (TYPE_CANONICAL (value_type
),
8548 if (!COMPLETE_TYPE_P (t
))
8553 /* Build a function type. The RETURN_TYPE is the type returned by the
8554 function. If VAARGS is set, no void_type_node is appended to the
8555 list. ARGP must be always be terminated be a NULL_TREE. */
8558 build_function_type_list_1 (bool vaargs
, tree return_type
, va_list argp
)
8562 t
= va_arg (argp
, tree
);
8563 for (args
= NULL_TREE
; t
!= NULL_TREE
; t
= va_arg (argp
, tree
))
8564 args
= tree_cons (NULL_TREE
, t
, args
);
8569 if (args
!= NULL_TREE
)
8570 args
= nreverse (args
);
8571 gcc_assert (last
!= void_list_node
);
8573 else if (args
== NULL_TREE
)
8574 args
= void_list_node
;
8578 args
= nreverse (args
);
8579 TREE_CHAIN (last
) = void_list_node
;
8581 args
= build_function_type (return_type
, args
);
8586 /* Build a function type. The RETURN_TYPE is the type returned by the
8587 function. If additional arguments are provided, they are
8588 additional argument types. The list of argument types must always
8589 be terminated by NULL_TREE. */
8592 build_function_type_list (tree return_type
, ...)
8597 va_start (p
, return_type
);
8598 args
= build_function_type_list_1 (false, return_type
, p
);
8603 /* Build a variable argument function type. The RETURN_TYPE is the
8604 type returned by the function. If additional arguments are provided,
8605 they are additional argument types. The list of argument types must
8606 always be terminated by NULL_TREE. */
8609 build_varargs_function_type_list (tree return_type
, ...)
8614 va_start (p
, return_type
);
8615 args
= build_function_type_list_1 (true, return_type
, p
);
8621 /* Build a function type. RETURN_TYPE is the type returned by the
8622 function; VAARGS indicates whether the function takes varargs. The
8623 function takes N named arguments, the types of which are provided in
8627 build_function_type_array_1 (bool vaargs
, tree return_type
, int n
,
8631 tree t
= vaargs
? NULL_TREE
: void_list_node
;
8633 for (i
= n
- 1; i
>= 0; i
--)
8634 t
= tree_cons (NULL_TREE
, arg_types
[i
], t
);
8636 return build_function_type (return_type
, t
);
8639 /* Build a function type. RETURN_TYPE is the type returned by the
8640 function. The function takes N named arguments, the types of which
8641 are provided in ARG_TYPES. */
8644 build_function_type_array (tree return_type
, int n
, tree
*arg_types
)
8646 return build_function_type_array_1 (false, return_type
, n
, arg_types
);
8649 /* Build a variable argument function type. RETURN_TYPE is the type
8650 returned by the function. The function takes N named arguments, the
8651 types of which are provided in ARG_TYPES. */
8654 build_varargs_function_type_array (tree return_type
, int n
, tree
*arg_types
)
8656 return build_function_type_array_1 (true, return_type
, n
, arg_types
);
8659 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
8660 and ARGTYPES (a TREE_LIST) are the return type and arguments types
8661 for the method. An implicit additional parameter (of type
8662 pointer-to-BASETYPE) is added to the ARGTYPES. */
8665 build_method_type_directly (tree basetype
,
8671 inchash::hash hstate
;
8672 bool any_structural_p
, any_noncanonical_p
;
8673 tree canon_argtypes
;
8675 /* Make a node of the sort we want. */
8676 t
= make_node (METHOD_TYPE
);
8678 TYPE_METHOD_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
8679 TREE_TYPE (t
) = rettype
;
8680 ptype
= build_pointer_type (basetype
);
8682 /* The actual arglist for this function includes a "hidden" argument
8683 which is "this". Put it into the list of argument types. */
8684 argtypes
= tree_cons (NULL_TREE
, ptype
, argtypes
);
8685 TYPE_ARG_TYPES (t
) = argtypes
;
8687 /* If we already have such a type, use the old one. */
8688 hstate
.add_object (TYPE_HASH (basetype
));
8689 hstate
.add_object (TYPE_HASH (rettype
));
8690 type_hash_list (argtypes
, hstate
);
8691 t
= type_hash_canon (hstate
.end (), t
);
8693 /* Set up the canonical type. */
8695 = (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
8696 || TYPE_STRUCTURAL_EQUALITY_P (rettype
));
8698 = (TYPE_CANONICAL (basetype
) != basetype
8699 || TYPE_CANONICAL (rettype
) != rettype
);
8700 canon_argtypes
= maybe_canonicalize_argtypes (TREE_CHAIN (argtypes
),
8702 &any_noncanonical_p
);
8703 if (any_structural_p
)
8704 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8705 else if (any_noncanonical_p
)
8707 = build_method_type_directly (TYPE_CANONICAL (basetype
),
8708 TYPE_CANONICAL (rettype
),
8710 if (!COMPLETE_TYPE_P (t
))
8716 /* Construct, lay out and return the type of methods belonging to class
8717 BASETYPE and whose arguments and values are described by TYPE.
8718 If that type exists already, reuse it.
8719 TYPE must be a FUNCTION_TYPE node. */
8722 build_method_type (tree basetype
, tree type
)
8724 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
8726 return build_method_type_directly (basetype
,
8728 TYPE_ARG_TYPES (type
));
8731 /* Construct, lay out and return the type of offsets to a value
8732 of type TYPE, within an object of type BASETYPE.
8733 If a suitable offset type exists already, reuse it. */
8736 build_offset_type (tree basetype
, tree type
)
8739 inchash::hash hstate
;
8741 /* Make a node of the sort we want. */
8742 t
= make_node (OFFSET_TYPE
);
8744 TYPE_OFFSET_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
8745 TREE_TYPE (t
) = type
;
8747 /* If we already have such a type, use the old one. */
8748 hstate
.add_object (TYPE_HASH (basetype
));
8749 hstate
.add_object (TYPE_HASH (type
));
8750 t
= type_hash_canon (hstate
.end (), t
);
8752 if (!COMPLETE_TYPE_P (t
))
8755 if (TYPE_CANONICAL (t
) == t
)
8757 if (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
8758 || TYPE_STRUCTURAL_EQUALITY_P (type
))
8759 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8760 else if (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)) != basetype
8761 || TYPE_CANONICAL (type
) != type
)
8763 = build_offset_type (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)),
8764 TYPE_CANONICAL (type
));
8770 /* Create a complex type whose components are COMPONENT_TYPE. */
8773 build_complex_type (tree component_type
)
8776 inchash::hash hstate
;
8778 gcc_assert (INTEGRAL_TYPE_P (component_type
)
8779 || SCALAR_FLOAT_TYPE_P (component_type
)
8780 || FIXED_POINT_TYPE_P (component_type
));
8782 /* Make a node of the sort we want. */
8783 t
= make_node (COMPLEX_TYPE
);
8785 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (component_type
);
8787 /* If we already have such a type, use the old one. */
8788 hstate
.add_object (TYPE_HASH (component_type
));
8789 t
= type_hash_canon (hstate
.end (), t
);
8791 if (!COMPLETE_TYPE_P (t
))
8794 if (TYPE_CANONICAL (t
) == t
)
8796 if (TYPE_STRUCTURAL_EQUALITY_P (component_type
))
8797 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8798 else if (TYPE_CANONICAL (component_type
) != component_type
)
8800 = build_complex_type (TYPE_CANONICAL (component_type
));
8803 /* We need to create a name, since complex is a fundamental type. */
8804 if (! TYPE_NAME (t
))
8807 if (component_type
== char_type_node
)
8808 name
= "complex char";
8809 else if (component_type
== signed_char_type_node
)
8810 name
= "complex signed char";
8811 else if (component_type
== unsigned_char_type_node
)
8812 name
= "complex unsigned char";
8813 else if (component_type
== short_integer_type_node
)
8814 name
= "complex short int";
8815 else if (component_type
== short_unsigned_type_node
)
8816 name
= "complex short unsigned int";
8817 else if (component_type
== integer_type_node
)
8818 name
= "complex int";
8819 else if (component_type
== unsigned_type_node
)
8820 name
= "complex unsigned int";
8821 else if (component_type
== long_integer_type_node
)
8822 name
= "complex long int";
8823 else if (component_type
== long_unsigned_type_node
)
8824 name
= "complex long unsigned int";
8825 else if (component_type
== long_long_integer_type_node
)
8826 name
= "complex long long int";
8827 else if (component_type
== long_long_unsigned_type_node
)
8828 name
= "complex long long unsigned int";
8833 TYPE_NAME (t
) = build_decl (UNKNOWN_LOCATION
, TYPE_DECL
,
8834 get_identifier (name
), t
);
8837 return build_qualified_type (t
, TYPE_QUALS (component_type
));
8840 /* If TYPE is a real or complex floating-point type and the target
8841 does not directly support arithmetic on TYPE then return the wider
8842 type to be used for arithmetic on TYPE. Otherwise, return
8846 excess_precision_type (tree type
)
8848 if (flag_excess_precision
!= EXCESS_PRECISION_FAST
)
8850 int flt_eval_method
= TARGET_FLT_EVAL_METHOD
;
8851 switch (TREE_CODE (type
))
8854 switch (flt_eval_method
)
8857 if (TYPE_MODE (type
) == TYPE_MODE (float_type_node
))
8858 return double_type_node
;
8861 if (TYPE_MODE (type
) == TYPE_MODE (float_type_node
)
8862 || TYPE_MODE (type
) == TYPE_MODE (double_type_node
))
8863 return long_double_type_node
;
8870 if (TREE_CODE (TREE_TYPE (type
)) != REAL_TYPE
)
8872 switch (flt_eval_method
)
8875 if (TYPE_MODE (TREE_TYPE (type
)) == TYPE_MODE (float_type_node
))
8876 return complex_double_type_node
;
8879 if (TYPE_MODE (TREE_TYPE (type
)) == TYPE_MODE (float_type_node
)
8880 || (TYPE_MODE (TREE_TYPE (type
))
8881 == TYPE_MODE (double_type_node
)))
8882 return complex_long_double_type_node
;
8895 /* Return OP, stripped of any conversions to wider types as much as is safe.
8896 Converting the value back to OP's type makes a value equivalent to OP.
8898 If FOR_TYPE is nonzero, we return a value which, if converted to
8899 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
8901 OP must have integer, real or enumeral type. Pointers are not allowed!
8903 There are some cases where the obvious value we could return
8904 would regenerate to OP if converted to OP's type,
8905 but would not extend like OP to wider types.
8906 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
8907 For example, if OP is (unsigned short)(signed char)-1,
8908 we avoid returning (signed char)-1 if FOR_TYPE is int,
8909 even though extending that to an unsigned short would regenerate OP,
8910 since the result of extending (signed char)-1 to (int)
8911 is different from (int) OP. */
8914 get_unwidened (tree op
, tree for_type
)
8916 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
8917 tree type
= TREE_TYPE (op
);
8919 = TYPE_PRECISION (for_type
!= 0 ? for_type
: type
);
8921 = (for_type
!= 0 && for_type
!= type
8922 && final_prec
> TYPE_PRECISION (type
)
8923 && TYPE_UNSIGNED (type
));
8926 while (CONVERT_EXPR_P (op
))
8930 /* TYPE_PRECISION on vector types has different meaning
8931 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
8932 so avoid them here. */
8933 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op
, 0))) == VECTOR_TYPE
)
8936 bitschange
= TYPE_PRECISION (TREE_TYPE (op
))
8937 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0)));
8939 /* Truncations are many-one so cannot be removed.
8940 Unless we are later going to truncate down even farther. */
8942 && final_prec
> TYPE_PRECISION (TREE_TYPE (op
)))
8945 /* See what's inside this conversion. If we decide to strip it,
8947 op
= TREE_OPERAND (op
, 0);
8949 /* If we have not stripped any zero-extensions (uns is 0),
8950 we can strip any kind of extension.
8951 If we have previously stripped a zero-extension,
8952 only zero-extensions can safely be stripped.
8953 Any extension can be stripped if the bits it would produce
8954 are all going to be discarded later by truncating to FOR_TYPE. */
8958 if (! uns
|| final_prec
<= TYPE_PRECISION (TREE_TYPE (op
)))
8960 /* TYPE_UNSIGNED says whether this is a zero-extension.
8961 Let's avoid computing it if it does not affect WIN
8962 and if UNS will not be needed again. */
8964 || CONVERT_EXPR_P (op
))
8965 && TYPE_UNSIGNED (TREE_TYPE (op
)))
8973 /* If we finally reach a constant see if it fits in for_type and
8974 in that case convert it. */
8976 && TREE_CODE (win
) == INTEGER_CST
8977 && TREE_TYPE (win
) != for_type
8978 && int_fits_type_p (win
, for_type
))
8979 win
= fold_convert (for_type
, win
);
8984 /* Return OP or a simpler expression for a narrower value
8985 which can be sign-extended or zero-extended to give back OP.
8986 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
8987 or 0 if the value should be sign-extended. */
8990 get_narrower (tree op
, int *unsignedp_ptr
)
8995 bool integral_p
= INTEGRAL_TYPE_P (TREE_TYPE (op
));
8997 while (TREE_CODE (op
) == NOP_EXPR
)
9000 = (TYPE_PRECISION (TREE_TYPE (op
))
9001 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0))));
9003 /* Truncations are many-one so cannot be removed. */
9007 /* See what's inside this conversion. If we decide to strip it,
9012 op
= TREE_OPERAND (op
, 0);
9013 /* An extension: the outermost one can be stripped,
9014 but remember whether it is zero or sign extension. */
9016 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
9017 /* Otherwise, if a sign extension has been stripped,
9018 only sign extensions can now be stripped;
9019 if a zero extension has been stripped, only zero-extensions. */
9020 else if (uns
!= TYPE_UNSIGNED (TREE_TYPE (op
)))
9024 else /* bitschange == 0 */
9026 /* A change in nominal type can always be stripped, but we must
9027 preserve the unsignedness. */
9029 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
9031 op
= TREE_OPERAND (op
, 0);
9032 /* Keep trying to narrow, but don't assign op to win if it
9033 would turn an integral type into something else. */
9034 if (INTEGRAL_TYPE_P (TREE_TYPE (op
)) != integral_p
)
9041 if (TREE_CODE (op
) == COMPONENT_REF
9042 /* Since type_for_size always gives an integer type. */
9043 && TREE_CODE (TREE_TYPE (op
)) != REAL_TYPE
9044 && TREE_CODE (TREE_TYPE (op
)) != FIXED_POINT_TYPE
9045 /* Ensure field is laid out already. */
9046 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0
9047 && tree_fits_uhwi_p (DECL_SIZE (TREE_OPERAND (op
, 1))))
9049 unsigned HOST_WIDE_INT innerprec
9050 = tree_to_uhwi (DECL_SIZE (TREE_OPERAND (op
, 1)));
9051 int unsignedp
= (DECL_UNSIGNED (TREE_OPERAND (op
, 1))
9052 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op
, 1))));
9053 tree type
= lang_hooks
.types
.type_for_size (innerprec
, unsignedp
);
9055 /* We can get this structure field in a narrower type that fits it,
9056 but the resulting extension to its nominal type (a fullword type)
9057 must satisfy the same conditions as for other extensions.
9059 Do this only for fields that are aligned (not bit-fields),
9060 because when bit-field insns will be used there is no
9061 advantage in doing this. */
9063 if (innerprec
< TYPE_PRECISION (TREE_TYPE (op
))
9064 && ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1))
9065 && (first
|| uns
== DECL_UNSIGNED (TREE_OPERAND (op
, 1)))
9069 uns
= DECL_UNSIGNED (TREE_OPERAND (op
, 1));
9070 win
= fold_convert (type
, op
);
9074 *unsignedp_ptr
= uns
;
9078 /* Returns true if integer constant C has a value that is permissible
9079 for type TYPE (an INTEGER_TYPE). */
9082 int_fits_type_p (const_tree c
, const_tree type
)
9084 tree type_low_bound
, type_high_bound
;
9085 bool ok_for_low_bound
, ok_for_high_bound
;
9086 signop sgn_c
= TYPE_SIGN (TREE_TYPE (c
));
9089 type_low_bound
= TYPE_MIN_VALUE (type
);
9090 type_high_bound
= TYPE_MAX_VALUE (type
);
9092 /* If at least one bound of the type is a constant integer, we can check
9093 ourselves and maybe make a decision. If no such decision is possible, but
9094 this type is a subtype, try checking against that. Otherwise, use
9095 fits_to_tree_p, which checks against the precision.
9097 Compute the status for each possibly constant bound, and return if we see
9098 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
9099 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
9100 for "constant known to fit". */
9102 /* Check if c >= type_low_bound. */
9103 if (type_low_bound
&& TREE_CODE (type_low_bound
) == INTEGER_CST
)
9105 if (tree_int_cst_lt (c
, type_low_bound
))
9107 ok_for_low_bound
= true;
9110 ok_for_low_bound
= false;
9112 /* Check if c <= type_high_bound. */
9113 if (type_high_bound
&& TREE_CODE (type_high_bound
) == INTEGER_CST
)
9115 if (tree_int_cst_lt (type_high_bound
, c
))
9117 ok_for_high_bound
= true;
9120 ok_for_high_bound
= false;
9122 /* If the constant fits both bounds, the result is known. */
9123 if (ok_for_low_bound
&& ok_for_high_bound
)
9126 /* Perform some generic filtering which may allow making a decision
9127 even if the bounds are not constant. First, negative integers
9128 never fit in unsigned types, */
9129 if (TYPE_UNSIGNED (type
) && sgn_c
== SIGNED
&& wi::neg_p (c
))
9132 /* Second, narrower types always fit in wider ones. */
9133 if (TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (c
)))
9136 /* Third, unsigned integers with top bit set never fit signed types. */
9137 if (!TYPE_UNSIGNED (type
) && sgn_c
== UNSIGNED
)
9139 int prec
= GET_MODE_PRECISION (TYPE_MODE (TREE_TYPE (c
))) - 1;
9140 if (prec
< TYPE_PRECISION (TREE_TYPE (c
)))
9142 /* When a tree_cst is converted to a wide-int, the precision
9143 is taken from the type. However, if the precision of the
9144 mode underneath the type is smaller than that, it is
9145 possible that the value will not fit. The test below
9146 fails if any bit is set between the sign bit of the
9147 underlying mode and the top bit of the type. */
9148 if (wi::ne_p (wi::zext (c
, prec
- 1), c
))
9151 else if (wi::neg_p (c
))
9155 /* If we haven't been able to decide at this point, there nothing more we
9156 can check ourselves here. Look at the base type if we have one and it
9157 has the same precision. */
9158 if (TREE_CODE (type
) == INTEGER_TYPE
9159 && TREE_TYPE (type
) != 0
9160 && TYPE_PRECISION (type
) == TYPE_PRECISION (TREE_TYPE (type
)))
9162 type
= TREE_TYPE (type
);
9166 /* Or to fits_to_tree_p, if nothing else. */
9167 return wi::fits_to_tree_p (c
, type
);
9170 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
9171 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
9172 represented (assuming two's-complement arithmetic) within the bit
9173 precision of the type are returned instead. */
9176 get_type_static_bounds (const_tree type
, mpz_t min
, mpz_t max
)
9178 if (!POINTER_TYPE_P (type
) && TYPE_MIN_VALUE (type
)
9179 && TREE_CODE (TYPE_MIN_VALUE (type
)) == INTEGER_CST
)
9180 wi::to_mpz (TYPE_MIN_VALUE (type
), min
, TYPE_SIGN (type
));
9183 if (TYPE_UNSIGNED (type
))
9184 mpz_set_ui (min
, 0);
9187 wide_int mn
= wi::min_value (TYPE_PRECISION (type
), SIGNED
);
9188 wi::to_mpz (mn
, min
, SIGNED
);
9192 if (!POINTER_TYPE_P (type
) && TYPE_MAX_VALUE (type
)
9193 && TREE_CODE (TYPE_MAX_VALUE (type
)) == INTEGER_CST
)
9194 wi::to_mpz (TYPE_MAX_VALUE (type
), max
, TYPE_SIGN (type
));
9197 wide_int mn
= wi::max_value (TYPE_PRECISION (type
), TYPE_SIGN (type
));
9198 wi::to_mpz (mn
, max
, TYPE_SIGN (type
));
9202 /* Return true if VAR is an automatic variable defined in function FN. */
9205 auto_var_in_fn_p (const_tree var
, const_tree fn
)
9207 return (DECL_P (var
) && DECL_CONTEXT (var
) == fn
9208 && ((((TREE_CODE (var
) == VAR_DECL
&& ! DECL_EXTERNAL (var
))
9209 || TREE_CODE (var
) == PARM_DECL
)
9210 && ! TREE_STATIC (var
))
9211 || TREE_CODE (var
) == LABEL_DECL
9212 || TREE_CODE (var
) == RESULT_DECL
));
9215 /* Subprogram of following function. Called by walk_tree.
9217 Return *TP if it is an automatic variable or parameter of the
9218 function passed in as DATA. */
9221 find_var_from_fn (tree
*tp
, int *walk_subtrees
, void *data
)
9223 tree fn
= (tree
) data
;
9228 else if (DECL_P (*tp
)
9229 && auto_var_in_fn_p (*tp
, fn
))
9235 /* Returns true if T is, contains, or refers to a type with variable
9236 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
9237 arguments, but not the return type. If FN is nonzero, only return
9238 true if a modifier of the type or position of FN is a variable or
9239 parameter inside FN.
9241 This concept is more general than that of C99 'variably modified types':
9242 in C99, a struct type is never variably modified because a VLA may not
9243 appear as a structure member. However, in GNU C code like:
9245 struct S { int i[f()]; };
9247 is valid, and other languages may define similar constructs. */
9250 variably_modified_type_p (tree type
, tree fn
)
9254 /* Test if T is either variable (if FN is zero) or an expression containing
9255 a variable in FN. If TYPE isn't gimplified, return true also if
9256 gimplify_one_sizepos would gimplify the expression into a local
9258 #define RETURN_TRUE_IF_VAR(T) \
9259 do { tree _t = (T); \
9260 if (_t != NULL_TREE \
9261 && _t != error_mark_node \
9262 && TREE_CODE (_t) != INTEGER_CST \
9263 && TREE_CODE (_t) != PLACEHOLDER_EXPR \
9265 || (!TYPE_SIZES_GIMPLIFIED (type) \
9266 && !is_gimple_sizepos (_t)) \
9267 || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
9268 return true; } while (0)
9270 if (type
== error_mark_node
)
9273 /* If TYPE itself has variable size, it is variably modified. */
9274 RETURN_TRUE_IF_VAR (TYPE_SIZE (type
));
9275 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type
));
9277 switch (TREE_CODE (type
))
9280 case REFERENCE_TYPE
:
9282 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
9288 /* If TYPE is a function type, it is variably modified if the
9289 return type is variably modified. */
9290 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
9296 case FIXED_POINT_TYPE
:
9299 /* Scalar types are variably modified if their end points
9301 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type
));
9302 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type
));
9307 case QUAL_UNION_TYPE
:
9308 /* We can't see if any of the fields are variably-modified by the
9309 definition we normally use, since that would produce infinite
9310 recursion via pointers. */
9311 /* This is variably modified if some field's type is. */
9312 for (t
= TYPE_FIELDS (type
); t
; t
= DECL_CHAIN (t
))
9313 if (TREE_CODE (t
) == FIELD_DECL
)
9315 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t
));
9316 RETURN_TRUE_IF_VAR (DECL_SIZE (t
));
9317 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t
));
9319 if (TREE_CODE (type
) == QUAL_UNION_TYPE
)
9320 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t
));
9325 /* Do not call ourselves to avoid infinite recursion. This is
9326 variably modified if the element type is. */
9327 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type
)));
9328 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type
)));
9335 /* The current language may have other cases to check, but in general,
9336 all other types are not variably modified. */
9337 return lang_hooks
.tree_inlining
.var_mod_type_p (type
, fn
);
9339 #undef RETURN_TRUE_IF_VAR
9342 /* Given a DECL or TYPE, return the scope in which it was declared, or
9343 NULL_TREE if there is no containing scope. */
9346 get_containing_scope (const_tree t
)
9348 return (TYPE_P (t
) ? TYPE_CONTEXT (t
) : DECL_CONTEXT (t
));
9351 /* Return the innermost context enclosing DECL that is
9352 a FUNCTION_DECL, or zero if none. */
9355 decl_function_context (const_tree decl
)
9359 if (TREE_CODE (decl
) == ERROR_MARK
)
9362 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
9363 where we look up the function at runtime. Such functions always take
9364 a first argument of type 'pointer to real context'.
9366 C++ should really be fixed to use DECL_CONTEXT for the real context,
9367 and use something else for the "virtual context". */
9368 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VINDEX (decl
))
9371 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl
)))));
9373 context
= DECL_CONTEXT (decl
);
9375 while (context
&& TREE_CODE (context
) != FUNCTION_DECL
)
9377 if (TREE_CODE (context
) == BLOCK
)
9378 context
= BLOCK_SUPERCONTEXT (context
);
9380 context
= get_containing_scope (context
);
9386 /* Return the innermost context enclosing DECL that is
9387 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
9388 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
9391 decl_type_context (const_tree decl
)
9393 tree context
= DECL_CONTEXT (decl
);
9396 switch (TREE_CODE (context
))
9398 case NAMESPACE_DECL
:
9399 case TRANSLATION_UNIT_DECL
:
9404 case QUAL_UNION_TYPE
:
9409 context
= DECL_CONTEXT (context
);
9413 context
= BLOCK_SUPERCONTEXT (context
);
9423 /* CALL is a CALL_EXPR. Return the declaration for the function
9424 called, or NULL_TREE if the called function cannot be
9428 get_callee_fndecl (const_tree call
)
9432 if (call
== error_mark_node
)
9433 return error_mark_node
;
9435 /* It's invalid to call this function with anything but a
9437 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
9439 /* The first operand to the CALL is the address of the function
9441 addr
= CALL_EXPR_FN (call
);
9443 /* If there is no function, return early. */
9444 if (addr
== NULL_TREE
)
9449 /* If this is a readonly function pointer, extract its initial value. */
9450 if (DECL_P (addr
) && TREE_CODE (addr
) != FUNCTION_DECL
9451 && TREE_READONLY (addr
) && ! TREE_THIS_VOLATILE (addr
)
9452 && DECL_INITIAL (addr
))
9453 addr
= DECL_INITIAL (addr
);
9455 /* If the address is just `&f' for some function `f', then we know
9456 that `f' is being called. */
9457 if (TREE_CODE (addr
) == ADDR_EXPR
9458 && TREE_CODE (TREE_OPERAND (addr
, 0)) == FUNCTION_DECL
)
9459 return TREE_OPERAND (addr
, 0);
9461 /* We couldn't figure out what was being called. */
9465 /* If CALL_EXPR CALL calls a normal built-in function or an internal function,
9466 return the associated function code, otherwise return CFN_LAST. */
9469 get_call_combined_fn (const_tree call
)
9471 /* It's invalid to call this function with anything but a CALL_EXPR. */
9472 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
9474 if (!CALL_EXPR_FN (call
))
9475 return as_combined_fn (CALL_EXPR_IFN (call
));
9477 tree fndecl
= get_callee_fndecl (call
);
9478 if (fndecl
&& DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
)
9479 return as_combined_fn (DECL_FUNCTION_CODE (fndecl
));
9484 #define TREE_MEM_USAGE_SPACES 40
9486 /* Print debugging information about tree nodes generated during the compile,
9487 and any language-specific information. */
9490 dump_tree_statistics (void)
9492 if (GATHER_STATISTICS
)
9495 int total_nodes
, total_bytes
;
9496 fprintf (stderr
, "\nKind Nodes Bytes\n");
9497 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9498 total_nodes
= total_bytes
= 0;
9499 for (i
= 0; i
< (int) all_kinds
; i
++)
9501 fprintf (stderr
, "%-20s %7d %10d\n", tree_node_kind_names
[i
],
9502 tree_node_counts
[i
], tree_node_sizes
[i
]);
9503 total_nodes
+= tree_node_counts
[i
];
9504 total_bytes
+= tree_node_sizes
[i
];
9506 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9507 fprintf (stderr
, "%-20s %7d %10d\n", "Total", total_nodes
, total_bytes
);
9508 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9509 fprintf (stderr
, "Code Nodes\n");
9510 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9511 for (i
= 0; i
< (int) MAX_TREE_CODES
; i
++)
9512 fprintf (stderr
, "%-32s %7d\n", get_tree_code_name ((enum tree_code
) i
),
9513 tree_code_counts
[i
]);
9514 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9515 fprintf (stderr
, "\n");
9516 ssanames_print_statistics ();
9517 fprintf (stderr
, "\n");
9518 phinodes_print_statistics ();
9519 fprintf (stderr
, "\n");
9522 fprintf (stderr
, "(No per-node statistics)\n");
9524 print_type_hash_statistics ();
9525 print_debug_expr_statistics ();
9526 print_value_expr_statistics ();
9527 lang_hooks
.print_statistics ();
9530 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
9532 /* Generate a crc32 of a byte. */
9535 crc32_unsigned_bits (unsigned chksum
, unsigned value
, unsigned bits
)
9539 for (ix
= bits
; ix
--; value
<<= 1)
9543 feedback
= (value
^ chksum
) & 0x80000000 ? 0x04c11db7 : 0;
9550 /* Generate a crc32 of a 32-bit unsigned. */
9553 crc32_unsigned (unsigned chksum
, unsigned value
)
9555 return crc32_unsigned_bits (chksum
, value
, 32);
9558 /* Generate a crc32 of a byte. */
9561 crc32_byte (unsigned chksum
, char byte
)
9563 return crc32_unsigned_bits (chksum
, (unsigned) byte
<< 24, 8);
9566 /* Generate a crc32 of a string. */
9569 crc32_string (unsigned chksum
, const char *string
)
9573 chksum
= crc32_byte (chksum
, *string
);
9579 /* P is a string that will be used in a symbol. Mask out any characters
9580 that are not valid in that context. */
9583 clean_symbol_name (char *p
)
9587 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
9590 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
9597 /* For anonymous aggregate types, we need some sort of name to
9598 hold on to. In practice, this should not appear, but it should
9599 not be harmful if it does. */
9601 anon_aggrname_p(const_tree id_node
)
9603 #ifndef NO_DOT_IN_LABEL
9604 return (IDENTIFIER_POINTER (id_node
)[0] == '.'
9605 && IDENTIFIER_POINTER (id_node
)[1] == '_');
9606 #else /* NO_DOT_IN_LABEL */
9607 #ifndef NO_DOLLAR_IN_LABEL
9608 return (IDENTIFIER_POINTER (id_node
)[0] == '$' \
9609 && IDENTIFIER_POINTER (id_node
)[1] == '_');
9610 #else /* NO_DOLLAR_IN_LABEL */
9611 #define ANON_AGGRNAME_PREFIX "__anon_"
9612 return (!strncmp (IDENTIFIER_POINTER (id_node
), ANON_AGGRNAME_PREFIX
,
9613 sizeof (ANON_AGGRNAME_PREFIX
) - 1));
9614 #endif /* NO_DOLLAR_IN_LABEL */
9615 #endif /* NO_DOT_IN_LABEL */
9618 /* Return a format for an anonymous aggregate name. */
9620 anon_aggrname_format()
9622 #ifndef NO_DOT_IN_LABEL
9624 #else /* NO_DOT_IN_LABEL */
9625 #ifndef NO_DOLLAR_IN_LABEL
9627 #else /* NO_DOLLAR_IN_LABEL */
9629 #endif /* NO_DOLLAR_IN_LABEL */
9630 #endif /* NO_DOT_IN_LABEL */
9633 /* Generate a name for a special-purpose function.
9634 The generated name may need to be unique across the whole link.
9635 Changes to this function may also require corresponding changes to
9636 xstrdup_mask_random.
9637 TYPE is some string to identify the purpose of this function to the
9638 linker or collect2; it must start with an uppercase letter,
9640 I - for constructors
9642 N - for C++ anonymous namespaces
9643 F - for DWARF unwind frame information. */
9646 get_file_function_name (const char *type
)
9652 /* If we already have a name we know to be unique, just use that. */
9653 if (first_global_object_name
)
9654 p
= q
= ASTRDUP (first_global_object_name
);
9655 /* If the target is handling the constructors/destructors, they
9656 will be local to this file and the name is only necessary for
9658 We also assign sub_I and sub_D sufixes to constructors called from
9659 the global static constructors. These are always local. */
9660 else if (((type
[0] == 'I' || type
[0] == 'D') && targetm
.have_ctors_dtors
)
9661 || (strncmp (type
, "sub_", 4) == 0
9662 && (type
[4] == 'I' || type
[4] == 'D')))
9664 const char *file
= main_input_filename
;
9666 file
= LOCATION_FILE (input_location
);
9667 /* Just use the file's basename, because the full pathname
9668 might be quite long. */
9669 p
= q
= ASTRDUP (lbasename (file
));
9673 /* Otherwise, the name must be unique across the entire link.
9674 We don't have anything that we know to be unique to this translation
9675 unit, so use what we do have and throw in some randomness. */
9677 const char *name
= weak_global_object_name
;
9678 const char *file
= main_input_filename
;
9683 file
= LOCATION_FILE (input_location
);
9685 len
= strlen (file
);
9686 q
= (char *) alloca (9 + 17 + len
+ 1);
9687 memcpy (q
, file
, len
+ 1);
9689 snprintf (q
+ len
, 9 + 17 + 1, "_%08X_" HOST_WIDE_INT_PRINT_HEX
,
9690 crc32_string (0, name
), get_random_seed (false));
9695 clean_symbol_name (q
);
9696 buf
= (char *) alloca (sizeof (FILE_FUNCTION_FORMAT
) + strlen (p
)
9699 /* Set up the name of the file-level functions we may need.
9700 Use a global object (which is already required to be unique over
9701 the program) rather than the file name (which imposes extra
9703 sprintf (buf
, FILE_FUNCTION_FORMAT
, type
, p
);
9705 return get_identifier (buf
);
9708 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
9710 /* Complain that the tree code of NODE does not match the expected 0
9711 terminated list of trailing codes. The trailing code list can be
9712 empty, for a more vague error message. FILE, LINE, and FUNCTION
9713 are of the caller. */
9716 tree_check_failed (const_tree node
, const char *file
,
9717 int line
, const char *function
, ...)
9721 unsigned length
= 0;
9722 enum tree_code code
;
9724 va_start (args
, function
);
9725 while ((code
= (enum tree_code
) va_arg (args
, int)))
9726 length
+= 4 + strlen (get_tree_code_name (code
));
9731 va_start (args
, function
);
9732 length
+= strlen ("expected ");
9733 buffer
= tmp
= (char *) alloca (length
);
9735 while ((code
= (enum tree_code
) va_arg (args
, int)))
9737 const char *prefix
= length
? " or " : "expected ";
9739 strcpy (tmp
+ length
, prefix
);
9740 length
+= strlen (prefix
);
9741 strcpy (tmp
+ length
, get_tree_code_name (code
));
9742 length
+= strlen (get_tree_code_name (code
));
9747 buffer
= "unexpected node";
9749 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9750 buffer
, get_tree_code_name (TREE_CODE (node
)),
9751 function
, trim_filename (file
), line
);
9754 /* Complain that the tree code of NODE does match the expected 0
9755 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
9759 tree_not_check_failed (const_tree node
, const char *file
,
9760 int line
, const char *function
, ...)
9764 unsigned length
= 0;
9765 enum tree_code code
;
9767 va_start (args
, function
);
9768 while ((code
= (enum tree_code
) va_arg (args
, int)))
9769 length
+= 4 + strlen (get_tree_code_name (code
));
9771 va_start (args
, function
);
9772 buffer
= (char *) alloca (length
);
9774 while ((code
= (enum tree_code
) va_arg (args
, int)))
9778 strcpy (buffer
+ length
, " or ");
9781 strcpy (buffer
+ length
, get_tree_code_name (code
));
9782 length
+= strlen (get_tree_code_name (code
));
9786 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
9787 buffer
, get_tree_code_name (TREE_CODE (node
)),
9788 function
, trim_filename (file
), line
);
9791 /* Similar to tree_check_failed, except that we check for a class of tree
9792 code, given in CL. */
9795 tree_class_check_failed (const_tree node
, const enum tree_code_class cl
,
9796 const char *file
, int line
, const char *function
)
9799 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
9800 TREE_CODE_CLASS_STRING (cl
),
9801 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
9802 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9805 /* Similar to tree_check_failed, except that instead of specifying a
9806 dozen codes, use the knowledge that they're all sequential. */
9809 tree_range_check_failed (const_tree node
, const char *file
, int line
,
9810 const char *function
, enum tree_code c1
,
9814 unsigned length
= 0;
9817 for (c
= c1
; c
<= c2
; ++c
)
9818 length
+= 4 + strlen (get_tree_code_name ((enum tree_code
) c
));
9820 length
+= strlen ("expected ");
9821 buffer
= (char *) alloca (length
);
9824 for (c
= c1
; c
<= c2
; ++c
)
9826 const char *prefix
= length
? " or " : "expected ";
9828 strcpy (buffer
+ length
, prefix
);
9829 length
+= strlen (prefix
);
9830 strcpy (buffer
+ length
, get_tree_code_name ((enum tree_code
) c
));
9831 length
+= strlen (get_tree_code_name ((enum tree_code
) c
));
9834 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9835 buffer
, get_tree_code_name (TREE_CODE (node
)),
9836 function
, trim_filename (file
), line
);
9840 /* Similar to tree_check_failed, except that we check that a tree does
9841 not have the specified code, given in CL. */
9844 tree_not_class_check_failed (const_tree node
, const enum tree_code_class cl
,
9845 const char *file
, int line
, const char *function
)
9848 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
9849 TREE_CODE_CLASS_STRING (cl
),
9850 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
9851 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9855 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
9858 omp_clause_check_failed (const_tree node
, const char *file
, int line
,
9859 const char *function
, enum omp_clause_code code
)
9861 internal_error ("tree check: expected omp_clause %s, have %s in %s, at %s:%d",
9862 omp_clause_code_name
[code
], get_tree_code_name (TREE_CODE (node
)),
9863 function
, trim_filename (file
), line
);
9867 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
9870 omp_clause_range_check_failed (const_tree node
, const char *file
, int line
,
9871 const char *function
, enum omp_clause_code c1
,
9872 enum omp_clause_code c2
)
9875 unsigned length
= 0;
9878 for (c
= c1
; c
<= c2
; ++c
)
9879 length
+= 4 + strlen (omp_clause_code_name
[c
]);
9881 length
+= strlen ("expected ");
9882 buffer
= (char *) alloca (length
);
9885 for (c
= c1
; c
<= c2
; ++c
)
9887 const char *prefix
= length
? " or " : "expected ";
9889 strcpy (buffer
+ length
, prefix
);
9890 length
+= strlen (prefix
);
9891 strcpy (buffer
+ length
, omp_clause_code_name
[c
]);
9892 length
+= strlen (omp_clause_code_name
[c
]);
9895 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9896 buffer
, omp_clause_code_name
[TREE_CODE (node
)],
9897 function
, trim_filename (file
), line
);
9901 #undef DEFTREESTRUCT
9902 #define DEFTREESTRUCT(VAL, NAME) NAME,
9904 static const char *ts_enum_names
[] = {
9905 #include "treestruct.def"
9907 #undef DEFTREESTRUCT
9909 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
9911 /* Similar to tree_class_check_failed, except that we check for
9912 whether CODE contains the tree structure identified by EN. */
9915 tree_contains_struct_check_failed (const_tree node
,
9916 const enum tree_node_structure_enum en
,
9917 const char *file
, int line
,
9918 const char *function
)
9921 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
9923 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9927 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9928 (dynamically sized) vector. */
9931 tree_int_cst_elt_check_failed (int idx
, int len
, const char *file
, int line
,
9932 const char *function
)
9935 ("tree check: accessed elt %d of tree_int_cst with %d elts in %s, at %s:%d",
9936 idx
+ 1, len
, function
, trim_filename (file
), line
);
9939 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9940 (dynamically sized) vector. */
9943 tree_vec_elt_check_failed (int idx
, int len
, const char *file
, int line
,
9944 const char *function
)
9947 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
9948 idx
+ 1, len
, function
, trim_filename (file
), line
);
9951 /* Similar to above, except that the check is for the bounds of the operand
9952 vector of an expression node EXP. */
9955 tree_operand_check_failed (int idx
, const_tree exp
, const char *file
,
9956 int line
, const char *function
)
9958 enum tree_code code
= TREE_CODE (exp
);
9960 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
9961 idx
+ 1, get_tree_code_name (code
), TREE_OPERAND_LENGTH (exp
),
9962 function
, trim_filename (file
), line
);
9965 /* Similar to above, except that the check is for the number of
9966 operands of an OMP_CLAUSE node. */
9969 omp_clause_operand_check_failed (int idx
, const_tree t
, const char *file
,
9970 int line
, const char *function
)
9973 ("tree check: accessed operand %d of omp_clause %s with %d operands "
9974 "in %s, at %s:%d", idx
+ 1, omp_clause_code_name
[OMP_CLAUSE_CODE (t
)],
9975 omp_clause_num_ops
[OMP_CLAUSE_CODE (t
)], function
,
9976 trim_filename (file
), line
);
9978 #endif /* ENABLE_TREE_CHECKING */
9980 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
9981 and mapped to the machine mode MODE. Initialize its fields and build
9982 the information necessary for debugging output. */
9985 make_vector_type (tree innertype
, int nunits
, machine_mode mode
)
9988 inchash::hash hstate
;
9989 tree mv_innertype
= TYPE_MAIN_VARIANT (innertype
);
9991 t
= make_node (VECTOR_TYPE
);
9992 TREE_TYPE (t
) = mv_innertype
;
9993 SET_TYPE_VECTOR_SUBPARTS (t
, nunits
);
9994 SET_TYPE_MODE (t
, mode
);
9996 if (TYPE_STRUCTURAL_EQUALITY_P (mv_innertype
) || in_lto_p
)
9997 SET_TYPE_STRUCTURAL_EQUALITY (t
);
9998 else if ((TYPE_CANONICAL (mv_innertype
) != innertype
9999 || mode
!= VOIDmode
)
10000 && !VECTOR_BOOLEAN_TYPE_P (t
))
10002 = make_vector_type (TYPE_CANONICAL (mv_innertype
), nunits
, VOIDmode
);
10006 hstate
.add_wide_int (VECTOR_TYPE
);
10007 hstate
.add_wide_int (nunits
);
10008 hstate
.add_wide_int (mode
);
10009 hstate
.add_object (TYPE_HASH (TREE_TYPE (t
)));
10010 t
= type_hash_canon (hstate
.end (), t
);
10012 /* We have built a main variant, based on the main variant of the
10013 inner type. Use it to build the variant we return. */
10014 if ((TYPE_ATTRIBUTES (innertype
) || TYPE_QUALS (innertype
))
10015 && TREE_TYPE (t
) != innertype
)
10016 return build_type_attribute_qual_variant (t
,
10017 TYPE_ATTRIBUTES (innertype
),
10018 TYPE_QUALS (innertype
));
10024 make_or_reuse_type (unsigned size
, int unsignedp
)
10028 if (size
== INT_TYPE_SIZE
)
10029 return unsignedp
? unsigned_type_node
: integer_type_node
;
10030 if (size
== CHAR_TYPE_SIZE
)
10031 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
10032 if (size
== SHORT_TYPE_SIZE
)
10033 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
10034 if (size
== LONG_TYPE_SIZE
)
10035 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
10036 if (size
== LONG_LONG_TYPE_SIZE
)
10037 return (unsignedp
? long_long_unsigned_type_node
10038 : long_long_integer_type_node
);
10040 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
10041 if (size
== int_n_data
[i
].bitsize
10042 && int_n_enabled_p
[i
])
10043 return (unsignedp
? int_n_trees
[i
].unsigned_type
10044 : int_n_trees
[i
].signed_type
);
10047 return make_unsigned_type (size
);
10049 return make_signed_type (size
);
10052 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
10055 make_or_reuse_fract_type (unsigned size
, int unsignedp
, int satp
)
10059 if (size
== SHORT_FRACT_TYPE_SIZE
)
10060 return unsignedp
? sat_unsigned_short_fract_type_node
10061 : sat_short_fract_type_node
;
10062 if (size
== FRACT_TYPE_SIZE
)
10063 return unsignedp
? sat_unsigned_fract_type_node
: sat_fract_type_node
;
10064 if (size
== LONG_FRACT_TYPE_SIZE
)
10065 return unsignedp
? sat_unsigned_long_fract_type_node
10066 : sat_long_fract_type_node
;
10067 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
10068 return unsignedp
? sat_unsigned_long_long_fract_type_node
10069 : sat_long_long_fract_type_node
;
10073 if (size
== SHORT_FRACT_TYPE_SIZE
)
10074 return unsignedp
? unsigned_short_fract_type_node
10075 : short_fract_type_node
;
10076 if (size
== FRACT_TYPE_SIZE
)
10077 return unsignedp
? unsigned_fract_type_node
: fract_type_node
;
10078 if (size
== LONG_FRACT_TYPE_SIZE
)
10079 return unsignedp
? unsigned_long_fract_type_node
10080 : long_fract_type_node
;
10081 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
10082 return unsignedp
? unsigned_long_long_fract_type_node
10083 : long_long_fract_type_node
;
10086 return make_fract_type (size
, unsignedp
, satp
);
10089 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
10092 make_or_reuse_accum_type (unsigned size
, int unsignedp
, int satp
)
10096 if (size
== SHORT_ACCUM_TYPE_SIZE
)
10097 return unsignedp
? sat_unsigned_short_accum_type_node
10098 : sat_short_accum_type_node
;
10099 if (size
== ACCUM_TYPE_SIZE
)
10100 return unsignedp
? sat_unsigned_accum_type_node
: sat_accum_type_node
;
10101 if (size
== LONG_ACCUM_TYPE_SIZE
)
10102 return unsignedp
? sat_unsigned_long_accum_type_node
10103 : sat_long_accum_type_node
;
10104 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
10105 return unsignedp
? sat_unsigned_long_long_accum_type_node
10106 : sat_long_long_accum_type_node
;
10110 if (size
== SHORT_ACCUM_TYPE_SIZE
)
10111 return unsignedp
? unsigned_short_accum_type_node
10112 : short_accum_type_node
;
10113 if (size
== ACCUM_TYPE_SIZE
)
10114 return unsignedp
? unsigned_accum_type_node
: accum_type_node
;
10115 if (size
== LONG_ACCUM_TYPE_SIZE
)
10116 return unsignedp
? unsigned_long_accum_type_node
10117 : long_accum_type_node
;
10118 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
10119 return unsignedp
? unsigned_long_long_accum_type_node
10120 : long_long_accum_type_node
;
10123 return make_accum_type (size
, unsignedp
, satp
);
10127 /* Create an atomic variant node for TYPE. This routine is called
10128 during initialization of data types to create the 5 basic atomic
10129 types. The generic build_variant_type function requires these to
10130 already be set up in order to function properly, so cannot be
10131 called from there. If ALIGN is non-zero, then ensure alignment is
10132 overridden to this value. */
10135 build_atomic_base (tree type
, unsigned int align
)
10139 /* Make sure its not already registered. */
10140 if ((t
= get_qualified_type (type
, TYPE_QUAL_ATOMIC
)))
10143 t
= build_variant_type_copy (type
);
10144 set_type_quals (t
, TYPE_QUAL_ATOMIC
);
10147 SET_TYPE_ALIGN (t
, align
);
10152 /* Create nodes for all integer types (and error_mark_node) using the sizes
10153 of C datatypes. SIGNED_CHAR specifies whether char is signed. */
10156 build_common_tree_nodes (bool signed_char
)
10160 error_mark_node
= make_node (ERROR_MARK
);
10161 TREE_TYPE (error_mark_node
) = error_mark_node
;
10163 initialize_sizetypes ();
10165 /* Define both `signed char' and `unsigned char'. */
10166 signed_char_type_node
= make_signed_type (CHAR_TYPE_SIZE
);
10167 TYPE_STRING_FLAG (signed_char_type_node
) = 1;
10168 unsigned_char_type_node
= make_unsigned_type (CHAR_TYPE_SIZE
);
10169 TYPE_STRING_FLAG (unsigned_char_type_node
) = 1;
10171 /* Define `char', which is like either `signed char' or `unsigned char'
10172 but not the same as either. */
10175 ? make_signed_type (CHAR_TYPE_SIZE
)
10176 : make_unsigned_type (CHAR_TYPE_SIZE
));
10177 TYPE_STRING_FLAG (char_type_node
) = 1;
10179 short_integer_type_node
= make_signed_type (SHORT_TYPE_SIZE
);
10180 short_unsigned_type_node
= make_unsigned_type (SHORT_TYPE_SIZE
);
10181 integer_type_node
= make_signed_type (INT_TYPE_SIZE
);
10182 unsigned_type_node
= make_unsigned_type (INT_TYPE_SIZE
);
10183 long_integer_type_node
= make_signed_type (LONG_TYPE_SIZE
);
10184 long_unsigned_type_node
= make_unsigned_type (LONG_TYPE_SIZE
);
10185 long_long_integer_type_node
= make_signed_type (LONG_LONG_TYPE_SIZE
);
10186 long_long_unsigned_type_node
= make_unsigned_type (LONG_LONG_TYPE_SIZE
);
10188 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
10190 int_n_trees
[i
].signed_type
= make_signed_type (int_n_data
[i
].bitsize
);
10191 int_n_trees
[i
].unsigned_type
= make_unsigned_type (int_n_data
[i
].bitsize
);
10192 TYPE_SIZE (int_n_trees
[i
].signed_type
) = bitsize_int (int_n_data
[i
].bitsize
);
10193 TYPE_SIZE (int_n_trees
[i
].unsigned_type
) = bitsize_int (int_n_data
[i
].bitsize
);
10195 if (int_n_data
[i
].bitsize
> LONG_LONG_TYPE_SIZE
10196 && int_n_enabled_p
[i
])
10198 integer_types
[itk_intN_0
+ i
* 2] = int_n_trees
[i
].signed_type
;
10199 integer_types
[itk_unsigned_intN_0
+ i
* 2] = int_n_trees
[i
].unsigned_type
;
10203 /* Define a boolean type. This type only represents boolean values but
10204 may be larger than char depending on the value of BOOL_TYPE_SIZE. */
10205 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
10206 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
10207 TYPE_PRECISION (boolean_type_node
) = 1;
10208 TYPE_MAX_VALUE (boolean_type_node
) = build_int_cst (boolean_type_node
, 1);
10210 /* Define what type to use for size_t. */
10211 if (strcmp (SIZE_TYPE
, "unsigned int") == 0)
10212 size_type_node
= unsigned_type_node
;
10213 else if (strcmp (SIZE_TYPE
, "long unsigned int") == 0)
10214 size_type_node
= long_unsigned_type_node
;
10215 else if (strcmp (SIZE_TYPE
, "long long unsigned int") == 0)
10216 size_type_node
= long_long_unsigned_type_node
;
10217 else if (strcmp (SIZE_TYPE
, "short unsigned int") == 0)
10218 size_type_node
= short_unsigned_type_node
;
10223 size_type_node
= NULL_TREE
;
10224 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
10225 if (int_n_enabled_p
[i
])
10228 sprintf (name
, "__int%d unsigned", int_n_data
[i
].bitsize
);
10230 if (strcmp (name
, SIZE_TYPE
) == 0)
10232 size_type_node
= int_n_trees
[i
].unsigned_type
;
10235 if (size_type_node
== NULL_TREE
)
10236 gcc_unreachable ();
10239 /* Fill in the rest of the sized types. Reuse existing type nodes
10241 intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 0);
10242 intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 0);
10243 intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 0);
10244 intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 0);
10245 intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 0);
10247 unsigned_intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 1);
10248 unsigned_intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 1);
10249 unsigned_intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 1);
10250 unsigned_intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 1);
10251 unsigned_intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 1);
10253 /* Don't call build_qualified type for atomics. That routine does
10254 special processing for atomics, and until they are initialized
10255 it's better not to make that call.
10257 Check to see if there is a target override for atomic types. */
10259 atomicQI_type_node
= build_atomic_base (unsigned_intQI_type_node
,
10260 targetm
.atomic_align_for_mode (QImode
));
10261 atomicHI_type_node
= build_atomic_base (unsigned_intHI_type_node
,
10262 targetm
.atomic_align_for_mode (HImode
));
10263 atomicSI_type_node
= build_atomic_base (unsigned_intSI_type_node
,
10264 targetm
.atomic_align_for_mode (SImode
));
10265 atomicDI_type_node
= build_atomic_base (unsigned_intDI_type_node
,
10266 targetm
.atomic_align_for_mode (DImode
));
10267 atomicTI_type_node
= build_atomic_base (unsigned_intTI_type_node
,
10268 targetm
.atomic_align_for_mode (TImode
));
10270 access_public_node
= get_identifier ("public");
10271 access_protected_node
= get_identifier ("protected");
10272 access_private_node
= get_identifier ("private");
10274 /* Define these next since types below may used them. */
10275 integer_zero_node
= build_int_cst (integer_type_node
, 0);
10276 integer_one_node
= build_int_cst (integer_type_node
, 1);
10277 integer_three_node
= build_int_cst (integer_type_node
, 3);
10278 integer_minus_one_node
= build_int_cst (integer_type_node
, -1);
10280 size_zero_node
= size_int (0);
10281 size_one_node
= size_int (1);
10282 bitsize_zero_node
= bitsize_int (0);
10283 bitsize_one_node
= bitsize_int (1);
10284 bitsize_unit_node
= bitsize_int (BITS_PER_UNIT
);
10286 boolean_false_node
= TYPE_MIN_VALUE (boolean_type_node
);
10287 boolean_true_node
= TYPE_MAX_VALUE (boolean_type_node
);
10289 void_type_node
= make_node (VOID_TYPE
);
10290 layout_type (void_type_node
);
10292 pointer_bounds_type_node
= targetm
.chkp_bound_type ();
10294 /* We are not going to have real types in C with less than byte alignment,
10295 so we might as well not have any types that claim to have it. */
10296 SET_TYPE_ALIGN (void_type_node
, BITS_PER_UNIT
);
10297 TYPE_USER_ALIGN (void_type_node
) = 0;
10299 void_node
= make_node (VOID_CST
);
10300 TREE_TYPE (void_node
) = void_type_node
;
10302 null_pointer_node
= build_int_cst (build_pointer_type (void_type_node
), 0);
10303 layout_type (TREE_TYPE (null_pointer_node
));
10305 ptr_type_node
= build_pointer_type (void_type_node
);
10306 const_ptr_type_node
10307 = build_pointer_type (build_type_variant (void_type_node
, 1, 0));
10308 fileptr_type_node
= ptr_type_node
;
10310 pointer_sized_int_node
= build_nonstandard_integer_type (POINTER_SIZE
, 1);
10312 float_type_node
= make_node (REAL_TYPE
);
10313 TYPE_PRECISION (float_type_node
) = FLOAT_TYPE_SIZE
;
10314 layout_type (float_type_node
);
10316 double_type_node
= make_node (REAL_TYPE
);
10317 TYPE_PRECISION (double_type_node
) = DOUBLE_TYPE_SIZE
;
10318 layout_type (double_type_node
);
10320 long_double_type_node
= make_node (REAL_TYPE
);
10321 TYPE_PRECISION (long_double_type_node
) = LONG_DOUBLE_TYPE_SIZE
;
10322 layout_type (long_double_type_node
);
10324 float_ptr_type_node
= build_pointer_type (float_type_node
);
10325 double_ptr_type_node
= build_pointer_type (double_type_node
);
10326 long_double_ptr_type_node
= build_pointer_type (long_double_type_node
);
10327 integer_ptr_type_node
= build_pointer_type (integer_type_node
);
10329 /* Fixed size integer types. */
10330 uint16_type_node
= make_or_reuse_type (16, 1);
10331 uint32_type_node
= make_or_reuse_type (32, 1);
10332 uint64_type_node
= make_or_reuse_type (64, 1);
10334 /* Decimal float types. */
10335 dfloat32_type_node
= make_node (REAL_TYPE
);
10336 TYPE_PRECISION (dfloat32_type_node
) = DECIMAL32_TYPE_SIZE
;
10337 layout_type (dfloat32_type_node
);
10338 SET_TYPE_MODE (dfloat32_type_node
, SDmode
);
10339 dfloat32_ptr_type_node
= build_pointer_type (dfloat32_type_node
);
10341 dfloat64_type_node
= make_node (REAL_TYPE
);
10342 TYPE_PRECISION (dfloat64_type_node
) = DECIMAL64_TYPE_SIZE
;
10343 layout_type (dfloat64_type_node
);
10344 SET_TYPE_MODE (dfloat64_type_node
, DDmode
);
10345 dfloat64_ptr_type_node
= build_pointer_type (dfloat64_type_node
);
10347 dfloat128_type_node
= make_node (REAL_TYPE
);
10348 TYPE_PRECISION (dfloat128_type_node
) = DECIMAL128_TYPE_SIZE
;
10349 layout_type (dfloat128_type_node
);
10350 SET_TYPE_MODE (dfloat128_type_node
, TDmode
);
10351 dfloat128_ptr_type_node
= build_pointer_type (dfloat128_type_node
);
10353 complex_integer_type_node
= build_complex_type (integer_type_node
);
10354 complex_float_type_node
= build_complex_type (float_type_node
);
10355 complex_double_type_node
= build_complex_type (double_type_node
);
10356 complex_long_double_type_node
= build_complex_type (long_double_type_node
);
10358 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
10359 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
10360 sat_ ## KIND ## _type_node = \
10361 make_sat_signed_ ## KIND ## _type (SIZE); \
10362 sat_unsigned_ ## KIND ## _type_node = \
10363 make_sat_unsigned_ ## KIND ## _type (SIZE); \
10364 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
10365 unsigned_ ## KIND ## _type_node = \
10366 make_unsigned_ ## KIND ## _type (SIZE);
10368 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
10369 sat_ ## WIDTH ## KIND ## _type_node = \
10370 make_sat_signed_ ## KIND ## _type (SIZE); \
10371 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
10372 make_sat_unsigned_ ## KIND ## _type (SIZE); \
10373 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
10374 unsigned_ ## WIDTH ## KIND ## _type_node = \
10375 make_unsigned_ ## KIND ## _type (SIZE);
10377 /* Make fixed-point type nodes based on four different widths. */
10378 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
10379 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
10380 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
10381 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
10382 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
10384 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
10385 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
10386 NAME ## _type_node = \
10387 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
10388 u ## NAME ## _type_node = \
10389 make_or_reuse_unsigned_ ## KIND ## _type \
10390 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
10391 sat_ ## NAME ## _type_node = \
10392 make_or_reuse_sat_signed_ ## KIND ## _type \
10393 (GET_MODE_BITSIZE (MODE ## mode)); \
10394 sat_u ## NAME ## _type_node = \
10395 make_or_reuse_sat_unsigned_ ## KIND ## _type \
10396 (GET_MODE_BITSIZE (U ## MODE ## mode));
10398 /* Fixed-point type and mode nodes. */
10399 MAKE_FIXED_TYPE_NODE_FAMILY (fract
, FRACT
)
10400 MAKE_FIXED_TYPE_NODE_FAMILY (accum
, ACCUM
)
10401 MAKE_FIXED_MODE_NODE (fract
, qq
, QQ
)
10402 MAKE_FIXED_MODE_NODE (fract
, hq
, HQ
)
10403 MAKE_FIXED_MODE_NODE (fract
, sq
, SQ
)
10404 MAKE_FIXED_MODE_NODE (fract
, dq
, DQ
)
10405 MAKE_FIXED_MODE_NODE (fract
, tq
, TQ
)
10406 MAKE_FIXED_MODE_NODE (accum
, ha
, HA
)
10407 MAKE_FIXED_MODE_NODE (accum
, sa
, SA
)
10408 MAKE_FIXED_MODE_NODE (accum
, da
, DA
)
10409 MAKE_FIXED_MODE_NODE (accum
, ta
, TA
)
10412 tree t
= targetm
.build_builtin_va_list ();
10414 /* Many back-ends define record types without setting TYPE_NAME.
10415 If we copied the record type here, we'd keep the original
10416 record type without a name. This breaks name mangling. So,
10417 don't copy record types and let c_common_nodes_and_builtins()
10418 declare the type to be __builtin_va_list. */
10419 if (TREE_CODE (t
) != RECORD_TYPE
)
10420 t
= build_variant_type_copy (t
);
10422 va_list_type_node
= t
;
10426 /* Modify DECL for given flags.
10427 TM_PURE attribute is set only on types, so the function will modify
10428 DECL's type when ECF_TM_PURE is used. */
10431 set_call_expr_flags (tree decl
, int flags
)
10433 if (flags
& ECF_NOTHROW
)
10434 TREE_NOTHROW (decl
) = 1;
10435 if (flags
& ECF_CONST
)
10436 TREE_READONLY (decl
) = 1;
10437 if (flags
& ECF_PURE
)
10438 DECL_PURE_P (decl
) = 1;
10439 if (flags
& ECF_LOOPING_CONST_OR_PURE
)
10440 DECL_LOOPING_CONST_OR_PURE_P (decl
) = 1;
10441 if (flags
& ECF_NOVOPS
)
10442 DECL_IS_NOVOPS (decl
) = 1;
10443 if (flags
& ECF_NORETURN
)
10444 TREE_THIS_VOLATILE (decl
) = 1;
10445 if (flags
& ECF_MALLOC
)
10446 DECL_IS_MALLOC (decl
) = 1;
10447 if (flags
& ECF_RETURNS_TWICE
)
10448 DECL_IS_RETURNS_TWICE (decl
) = 1;
10449 if (flags
& ECF_LEAF
)
10450 DECL_ATTRIBUTES (decl
) = tree_cons (get_identifier ("leaf"),
10451 NULL
, DECL_ATTRIBUTES (decl
));
10452 if (flags
& ECF_RET1
)
10453 DECL_ATTRIBUTES (decl
)
10454 = tree_cons (get_identifier ("fn spec"),
10455 build_tree_list (NULL_TREE
, build_string (1, "1")),
10456 DECL_ATTRIBUTES (decl
));
10457 if ((flags
& ECF_TM_PURE
) && flag_tm
)
10458 apply_tm_attr (decl
, get_identifier ("transaction_pure"));
10459 /* Looping const or pure is implied by noreturn.
10460 There is currently no way to declare looping const or looping pure alone. */
10461 gcc_assert (!(flags
& ECF_LOOPING_CONST_OR_PURE
)
10462 || ((flags
& ECF_NORETURN
) && (flags
& (ECF_CONST
| ECF_PURE
))));
10466 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
10469 local_define_builtin (const char *name
, tree type
, enum built_in_function code
,
10470 const char *library_name
, int ecf_flags
)
10474 decl
= add_builtin_function (name
, type
, code
, BUILT_IN_NORMAL
,
10475 library_name
, NULL_TREE
);
10476 set_call_expr_flags (decl
, ecf_flags
);
10478 set_builtin_decl (code
, decl
, true);
10481 /* Call this function after instantiating all builtins that the language
10482 front end cares about. This will build the rest of the builtins
10483 and internal functions that are relied upon by the tree optimizers and
10487 build_common_builtin_nodes (void)
10492 if (!builtin_decl_explicit_p (BUILT_IN_UNREACHABLE
)
10493 || !builtin_decl_explicit_p (BUILT_IN_ABORT
))
10495 ftype
= build_function_type (void_type_node
, void_list_node
);
10496 if (!builtin_decl_explicit_p (BUILT_IN_UNREACHABLE
))
10497 local_define_builtin ("__builtin_unreachable", ftype
,
10498 BUILT_IN_UNREACHABLE
,
10499 "__builtin_unreachable",
10500 ECF_NOTHROW
| ECF_LEAF
| ECF_NORETURN
10502 if (!builtin_decl_explicit_p (BUILT_IN_ABORT
))
10503 local_define_builtin ("__builtin_abort", ftype
, BUILT_IN_ABORT
,
10505 ECF_LEAF
| ECF_NORETURN
| ECF_CONST
);
10508 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
)
10509 || !builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
10511 ftype
= build_function_type_list (ptr_type_node
,
10512 ptr_type_node
, const_ptr_type_node
,
10513 size_type_node
, NULL_TREE
);
10515 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
))
10516 local_define_builtin ("__builtin_memcpy", ftype
, BUILT_IN_MEMCPY
,
10517 "memcpy", ECF_NOTHROW
| ECF_LEAF
| ECF_RET1
);
10518 if (!builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
10519 local_define_builtin ("__builtin_memmove", ftype
, BUILT_IN_MEMMOVE
,
10520 "memmove", ECF_NOTHROW
| ECF_LEAF
| ECF_RET1
);
10523 if (!builtin_decl_explicit_p (BUILT_IN_MEMCMP
))
10525 ftype
= build_function_type_list (integer_type_node
, const_ptr_type_node
,
10526 const_ptr_type_node
, size_type_node
,
10528 local_define_builtin ("__builtin_memcmp", ftype
, BUILT_IN_MEMCMP
,
10529 "memcmp", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10532 if (!builtin_decl_explicit_p (BUILT_IN_MEMSET
))
10534 ftype
= build_function_type_list (ptr_type_node
,
10535 ptr_type_node
, integer_type_node
,
10536 size_type_node
, NULL_TREE
);
10537 local_define_builtin ("__builtin_memset", ftype
, BUILT_IN_MEMSET
,
10538 "memset", ECF_NOTHROW
| ECF_LEAF
| ECF_RET1
);
10541 /* If we're checking the stack, `alloca' can throw. */
10542 const int alloca_flags
10543 = ECF_MALLOC
| ECF_LEAF
| (flag_stack_check
? 0 : ECF_NOTHROW
);
10545 if (!builtin_decl_explicit_p (BUILT_IN_ALLOCA
))
10547 ftype
= build_function_type_list (ptr_type_node
,
10548 size_type_node
, NULL_TREE
);
10549 local_define_builtin ("__builtin_alloca", ftype
, BUILT_IN_ALLOCA
,
10550 "alloca", alloca_flags
);
10553 ftype
= build_function_type_list (ptr_type_node
, size_type_node
,
10554 size_type_node
, NULL_TREE
);
10555 local_define_builtin ("__builtin_alloca_with_align", ftype
,
10556 BUILT_IN_ALLOCA_WITH_ALIGN
,
10557 "__builtin_alloca_with_align",
10560 ftype
= build_function_type_list (void_type_node
,
10561 ptr_type_node
, ptr_type_node
,
10562 ptr_type_node
, NULL_TREE
);
10563 local_define_builtin ("__builtin_init_trampoline", ftype
,
10564 BUILT_IN_INIT_TRAMPOLINE
,
10565 "__builtin_init_trampoline", ECF_NOTHROW
| ECF_LEAF
);
10566 local_define_builtin ("__builtin_init_heap_trampoline", ftype
,
10567 BUILT_IN_INIT_HEAP_TRAMPOLINE
,
10568 "__builtin_init_heap_trampoline",
10569 ECF_NOTHROW
| ECF_LEAF
);
10571 ftype
= build_function_type_list (ptr_type_node
, ptr_type_node
, NULL_TREE
);
10572 local_define_builtin ("__builtin_adjust_trampoline", ftype
,
10573 BUILT_IN_ADJUST_TRAMPOLINE
,
10574 "__builtin_adjust_trampoline",
10575 ECF_CONST
| ECF_NOTHROW
);
10577 ftype
= build_function_type_list (void_type_node
,
10578 ptr_type_node
, ptr_type_node
, NULL_TREE
);
10579 local_define_builtin ("__builtin_nonlocal_goto", ftype
,
10580 BUILT_IN_NONLOCAL_GOTO
,
10581 "__builtin_nonlocal_goto",
10582 ECF_NORETURN
| ECF_NOTHROW
);
10584 ftype
= build_function_type_list (void_type_node
,
10585 ptr_type_node
, ptr_type_node
, NULL_TREE
);
10586 local_define_builtin ("__builtin_setjmp_setup", ftype
,
10587 BUILT_IN_SETJMP_SETUP
,
10588 "__builtin_setjmp_setup", ECF_NOTHROW
);
10590 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10591 local_define_builtin ("__builtin_setjmp_receiver", ftype
,
10592 BUILT_IN_SETJMP_RECEIVER
,
10593 "__builtin_setjmp_receiver", ECF_NOTHROW
| ECF_LEAF
);
10595 ftype
= build_function_type_list (ptr_type_node
, NULL_TREE
);
10596 local_define_builtin ("__builtin_stack_save", ftype
, BUILT_IN_STACK_SAVE
,
10597 "__builtin_stack_save", ECF_NOTHROW
| ECF_LEAF
);
10599 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10600 local_define_builtin ("__builtin_stack_restore", ftype
,
10601 BUILT_IN_STACK_RESTORE
,
10602 "__builtin_stack_restore", ECF_NOTHROW
| ECF_LEAF
);
10604 ftype
= build_function_type_list (integer_type_node
, const_ptr_type_node
,
10605 const_ptr_type_node
, size_type_node
,
10607 local_define_builtin ("__builtin_memcmp_eq", ftype
, BUILT_IN_MEMCMP_EQ
,
10608 "__builtin_memcmp_eq",
10609 ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10611 /* If there's a possibility that we might use the ARM EABI, build the
10612 alternate __cxa_end_cleanup node used to resume from C++ and Java. */
10613 if (targetm
.arm_eabi_unwinder
)
10615 ftype
= build_function_type_list (void_type_node
, NULL_TREE
);
10616 local_define_builtin ("__builtin_cxa_end_cleanup", ftype
,
10617 BUILT_IN_CXA_END_CLEANUP
,
10618 "__cxa_end_cleanup", ECF_NORETURN
| ECF_LEAF
);
10621 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10622 local_define_builtin ("__builtin_unwind_resume", ftype
,
10623 BUILT_IN_UNWIND_RESUME
,
10624 ((targetm_common
.except_unwind_info (&global_options
)
10626 ? "_Unwind_SjLj_Resume" : "_Unwind_Resume"),
10629 if (builtin_decl_explicit (BUILT_IN_RETURN_ADDRESS
) == NULL_TREE
)
10631 ftype
= build_function_type_list (ptr_type_node
, integer_type_node
,
10633 local_define_builtin ("__builtin_return_address", ftype
,
10634 BUILT_IN_RETURN_ADDRESS
,
10635 "__builtin_return_address",
10639 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
)
10640 || !builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
10642 ftype
= build_function_type_list (void_type_node
, ptr_type_node
,
10643 ptr_type_node
, NULL_TREE
);
10644 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
))
10645 local_define_builtin ("__cyg_profile_func_enter", ftype
,
10646 BUILT_IN_PROFILE_FUNC_ENTER
,
10647 "__cyg_profile_func_enter", 0);
10648 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
10649 local_define_builtin ("__cyg_profile_func_exit", ftype
,
10650 BUILT_IN_PROFILE_FUNC_EXIT
,
10651 "__cyg_profile_func_exit", 0);
10654 /* The exception object and filter values from the runtime. The argument
10655 must be zero before exception lowering, i.e. from the front end. After
10656 exception lowering, it will be the region number for the exception
10657 landing pad. These functions are PURE instead of CONST to prevent
10658 them from being hoisted past the exception edge that will initialize
10659 its value in the landing pad. */
10660 ftype
= build_function_type_list (ptr_type_node
,
10661 integer_type_node
, NULL_TREE
);
10662 ecf_flags
= ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
;
10663 /* Only use TM_PURE if we have TM language support. */
10664 if (builtin_decl_explicit_p (BUILT_IN_TM_LOAD_1
))
10665 ecf_flags
|= ECF_TM_PURE
;
10666 local_define_builtin ("__builtin_eh_pointer", ftype
, BUILT_IN_EH_POINTER
,
10667 "__builtin_eh_pointer", ecf_flags
);
10669 tmp
= lang_hooks
.types
.type_for_mode (targetm
.eh_return_filter_mode (), 0);
10670 ftype
= build_function_type_list (tmp
, integer_type_node
, NULL_TREE
);
10671 local_define_builtin ("__builtin_eh_filter", ftype
, BUILT_IN_EH_FILTER
,
10672 "__builtin_eh_filter", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10674 ftype
= build_function_type_list (void_type_node
,
10675 integer_type_node
, integer_type_node
,
10677 local_define_builtin ("__builtin_eh_copy_values", ftype
,
10678 BUILT_IN_EH_COPY_VALUES
,
10679 "__builtin_eh_copy_values", ECF_NOTHROW
);
10681 /* Complex multiplication and division. These are handled as builtins
10682 rather than optabs because emit_library_call_value doesn't support
10683 complex. Further, we can do slightly better with folding these
10684 beasties if the real and complex parts of the arguments are separate. */
10688 for (mode
= MIN_MODE_COMPLEX_FLOAT
; mode
<= MAX_MODE_COMPLEX_FLOAT
; ++mode
)
10690 char mode_name_buf
[4], *q
;
10692 enum built_in_function mcode
, dcode
;
10693 tree type
, inner_type
;
10694 const char *prefix
= "__";
10696 if (targetm
.libfunc_gnu_prefix
)
10699 type
= lang_hooks
.types
.type_for_mode ((machine_mode
) mode
, 0);
10702 inner_type
= TREE_TYPE (type
);
10704 ftype
= build_function_type_list (type
, inner_type
, inner_type
,
10705 inner_type
, inner_type
, NULL_TREE
);
10707 mcode
= ((enum built_in_function
)
10708 (BUILT_IN_COMPLEX_MUL_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
10709 dcode
= ((enum built_in_function
)
10710 (BUILT_IN_COMPLEX_DIV_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
10712 for (p
= GET_MODE_NAME (mode
), q
= mode_name_buf
; *p
; p
++, q
++)
10716 built_in_names
[mcode
] = concat (prefix
, "mul", mode_name_buf
, "3",
10718 local_define_builtin (built_in_names
[mcode
], ftype
, mcode
,
10719 built_in_names
[mcode
],
10720 ECF_CONST
| ECF_NOTHROW
| ECF_LEAF
);
10722 built_in_names
[dcode
] = concat (prefix
, "div", mode_name_buf
, "3",
10724 local_define_builtin (built_in_names
[dcode
], ftype
, dcode
,
10725 built_in_names
[dcode
],
10726 ECF_CONST
| ECF_NOTHROW
| ECF_LEAF
);
10730 init_internal_fns ();
10733 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
10736 If we requested a pointer to a vector, build up the pointers that
10737 we stripped off while looking for the inner type. Similarly for
10738 return values from functions.
10740 The argument TYPE is the top of the chain, and BOTTOM is the
10741 new type which we will point to. */
10744 reconstruct_complex_type (tree type
, tree bottom
)
10748 if (TREE_CODE (type
) == POINTER_TYPE
)
10750 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10751 outer
= build_pointer_type_for_mode (inner
, TYPE_MODE (type
),
10752 TYPE_REF_CAN_ALIAS_ALL (type
));
10754 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
10756 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10757 outer
= build_reference_type_for_mode (inner
, TYPE_MODE (type
),
10758 TYPE_REF_CAN_ALIAS_ALL (type
));
10760 else if (TREE_CODE (type
) == ARRAY_TYPE
)
10762 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10763 outer
= build_array_type (inner
, TYPE_DOMAIN (type
));
10765 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10767 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10768 outer
= build_function_type (inner
, TYPE_ARG_TYPES (type
));
10770 else if (TREE_CODE (type
) == METHOD_TYPE
)
10772 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10773 /* The build_method_type_directly() routine prepends 'this' to argument list,
10774 so we must compensate by getting rid of it. */
10776 = build_method_type_directly
10777 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
))),
10779 TREE_CHAIN (TYPE_ARG_TYPES (type
)));
10781 else if (TREE_CODE (type
) == OFFSET_TYPE
)
10783 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10784 outer
= build_offset_type (TYPE_OFFSET_BASETYPE (type
), inner
);
10789 return build_type_attribute_qual_variant (outer
, TYPE_ATTRIBUTES (type
),
10790 TYPE_QUALS (type
));
10793 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
10796 build_vector_type_for_mode (tree innertype
, machine_mode mode
)
10800 switch (GET_MODE_CLASS (mode
))
10802 case MODE_VECTOR_INT
:
10803 case MODE_VECTOR_FLOAT
:
10804 case MODE_VECTOR_FRACT
:
10805 case MODE_VECTOR_UFRACT
:
10806 case MODE_VECTOR_ACCUM
:
10807 case MODE_VECTOR_UACCUM
:
10808 nunits
= GET_MODE_NUNITS (mode
);
10812 /* Check that there are no leftover bits. */
10813 gcc_assert (GET_MODE_BITSIZE (mode
)
10814 % TREE_INT_CST_LOW (TYPE_SIZE (innertype
)) == 0);
10816 nunits
= GET_MODE_BITSIZE (mode
)
10817 / TREE_INT_CST_LOW (TYPE_SIZE (innertype
));
10821 gcc_unreachable ();
10824 return make_vector_type (innertype
, nunits
, mode
);
10827 /* Similarly, but takes the inner type and number of units, which must be
10831 build_vector_type (tree innertype
, int nunits
)
10833 return make_vector_type (innertype
, nunits
, VOIDmode
);
10836 /* Build truth vector with specified length and number of units. */
10839 build_truth_vector_type (unsigned nunits
, unsigned vector_size
)
10841 machine_mode mask_mode
= targetm
.vectorize
.get_mask_mode (nunits
,
10844 gcc_assert (mask_mode
!= VOIDmode
);
10846 unsigned HOST_WIDE_INT vsize
;
10847 if (mask_mode
== BLKmode
)
10848 vsize
= vector_size
* BITS_PER_UNIT
;
10850 vsize
= GET_MODE_BITSIZE (mask_mode
);
10852 unsigned HOST_WIDE_INT esize
= vsize
/ nunits
;
10853 gcc_assert (esize
* nunits
== vsize
);
10855 tree bool_type
= build_nonstandard_boolean_type (esize
);
10857 return make_vector_type (bool_type
, nunits
, mask_mode
);
10860 /* Returns a vector type corresponding to a comparison of VECTYPE. */
10863 build_same_sized_truth_vector_type (tree vectype
)
10865 if (VECTOR_BOOLEAN_TYPE_P (vectype
))
10868 unsigned HOST_WIDE_INT size
= GET_MODE_SIZE (TYPE_MODE (vectype
));
10871 size
= tree_to_uhwi (TYPE_SIZE_UNIT (vectype
));
10873 return build_truth_vector_type (TYPE_VECTOR_SUBPARTS (vectype
), size
);
10876 /* Similarly, but builds a variant type with TYPE_VECTOR_OPAQUE set. */
10879 build_opaque_vector_type (tree innertype
, int nunits
)
10881 tree t
= make_vector_type (innertype
, nunits
, VOIDmode
);
10883 /* We always build the non-opaque variant before the opaque one,
10884 so if it already exists, it is TYPE_NEXT_VARIANT of this one. */
10885 cand
= TYPE_NEXT_VARIANT (t
);
10887 && TYPE_VECTOR_OPAQUE (cand
)
10888 && check_qualified_type (cand
, t
, TYPE_QUALS (t
)))
10890 /* Othewise build a variant type and make sure to queue it after
10891 the non-opaque type. */
10892 cand
= build_distinct_type_copy (t
);
10893 TYPE_VECTOR_OPAQUE (cand
) = true;
10894 TYPE_CANONICAL (cand
) = TYPE_CANONICAL (t
);
10895 TYPE_NEXT_VARIANT (cand
) = TYPE_NEXT_VARIANT (t
);
10896 TYPE_NEXT_VARIANT (t
) = cand
;
10897 TYPE_MAIN_VARIANT (cand
) = TYPE_MAIN_VARIANT (t
);
10902 /* Given an initializer INIT, return TRUE if INIT is zero or some
10903 aggregate of zeros. Otherwise return FALSE. */
10905 initializer_zerop (const_tree init
)
10911 switch (TREE_CODE (init
))
10914 return integer_zerop (init
);
10917 /* ??? Note that this is not correct for C4X float formats. There,
10918 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
10919 negative exponent. */
10920 return real_zerop (init
)
10921 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init
));
10924 return fixed_zerop (init
);
10927 return integer_zerop (init
)
10928 || (real_zerop (init
)
10929 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init
)))
10930 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init
))));
10935 for (i
= 0; i
< VECTOR_CST_NELTS (init
); ++i
)
10936 if (!initializer_zerop (VECTOR_CST_ELT (init
, i
)))
10943 unsigned HOST_WIDE_INT idx
;
10945 if (TREE_CLOBBER_P (init
))
10947 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init
), idx
, elt
)
10948 if (!initializer_zerop (elt
))
10957 /* We need to loop through all elements to handle cases like
10958 "\0" and "\0foobar". */
10959 for (i
= 0; i
< TREE_STRING_LENGTH (init
); ++i
)
10960 if (TREE_STRING_POINTER (init
)[i
] != '\0')
10971 /* Check if vector VEC consists of all the equal elements and
10972 that the number of elements corresponds to the type of VEC.
10973 The function returns first element of the vector
10974 or NULL_TREE if the vector is not uniform. */
10976 uniform_vector_p (const_tree vec
)
10981 if (vec
== NULL_TREE
)
10984 gcc_assert (VECTOR_TYPE_P (TREE_TYPE (vec
)));
10986 if (TREE_CODE (vec
) == VECTOR_CST
)
10988 first
= VECTOR_CST_ELT (vec
, 0);
10989 for (i
= 1; i
< VECTOR_CST_NELTS (vec
); ++i
)
10990 if (!operand_equal_p (first
, VECTOR_CST_ELT (vec
, i
), 0))
10996 else if (TREE_CODE (vec
) == CONSTRUCTOR
)
10998 first
= error_mark_node
;
11000 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (vec
), i
, t
)
11007 if (!operand_equal_p (first
, t
, 0))
11010 if (i
!= TYPE_VECTOR_SUBPARTS (TREE_TYPE (vec
)))
11019 /* Build an empty statement at location LOC. */
11022 build_empty_stmt (location_t loc
)
11024 tree t
= build1 (NOP_EXPR
, void_type_node
, size_zero_node
);
11025 SET_EXPR_LOCATION (t
, loc
);
11030 /* Build an OpenMP clause with code CODE. LOC is the location of the
11034 build_omp_clause (location_t loc
, enum omp_clause_code code
)
11039 length
= omp_clause_num_ops
[code
];
11040 size
= (sizeof (struct tree_omp_clause
) + (length
- 1) * sizeof (tree
));
11042 record_node_allocation_statistics (OMP_CLAUSE
, size
);
11044 t
= (tree
) ggc_internal_alloc (size
);
11045 memset (t
, 0, size
);
11046 TREE_SET_CODE (t
, OMP_CLAUSE
);
11047 OMP_CLAUSE_SET_CODE (t
, code
);
11048 OMP_CLAUSE_LOCATION (t
) = loc
;
11053 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
11054 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
11055 Except for the CODE and operand count field, other storage for the
11056 object is initialized to zeros. */
11059 build_vl_exp_stat (enum tree_code code
, int len MEM_STAT_DECL
)
11062 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_exp
);
11064 gcc_assert (TREE_CODE_CLASS (code
) == tcc_vl_exp
);
11065 gcc_assert (len
>= 1);
11067 record_node_allocation_statistics (code
, length
);
11069 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
11071 TREE_SET_CODE (t
, code
);
11073 /* Can't use TREE_OPERAND to store the length because if checking is
11074 enabled, it will try to check the length before we store it. :-P */
11075 t
->exp
.operands
[0] = build_int_cst (sizetype
, len
);
11080 /* Helper function for build_call_* functions; build a CALL_EXPR with
11081 indicated RETURN_TYPE, FN, and NARGS, but do not initialize any of
11082 the argument slots. */
11085 build_call_1 (tree return_type
, tree fn
, int nargs
)
11089 t
= build_vl_exp (CALL_EXPR
, nargs
+ 3);
11090 TREE_TYPE (t
) = return_type
;
11091 CALL_EXPR_FN (t
) = fn
;
11092 CALL_EXPR_STATIC_CHAIN (t
) = NULL
;
11097 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
11098 FN and a null static chain slot. NARGS is the number of call arguments
11099 which are specified as "..." arguments. */
11102 build_call_nary (tree return_type
, tree fn
, int nargs
, ...)
11106 va_start (args
, nargs
);
11107 ret
= build_call_valist (return_type
, fn
, nargs
, args
);
11112 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
11113 FN and a null static chain slot. NARGS is the number of call arguments
11114 which are specified as a va_list ARGS. */
11117 build_call_valist (tree return_type
, tree fn
, int nargs
, va_list args
)
11122 t
= build_call_1 (return_type
, fn
, nargs
);
11123 for (i
= 0; i
< nargs
; i
++)
11124 CALL_EXPR_ARG (t
, i
) = va_arg (args
, tree
);
11125 process_call_operands (t
);
11129 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
11130 FN and a null static chain slot. NARGS is the number of call arguments
11131 which are specified as a tree array ARGS. */
11134 build_call_array_loc (location_t loc
, tree return_type
, tree fn
,
11135 int nargs
, const tree
*args
)
11140 t
= build_call_1 (return_type
, fn
, nargs
);
11141 for (i
= 0; i
< nargs
; i
++)
11142 CALL_EXPR_ARG (t
, i
) = args
[i
];
11143 process_call_operands (t
);
11144 SET_EXPR_LOCATION (t
, loc
);
11148 /* Like build_call_array, but takes a vec. */
11151 build_call_vec (tree return_type
, tree fn
, vec
<tree
, va_gc
> *args
)
11156 ret
= build_call_1 (return_type
, fn
, vec_safe_length (args
));
11157 FOR_EACH_VEC_SAFE_ELT (args
, ix
, t
)
11158 CALL_EXPR_ARG (ret
, ix
) = t
;
11159 process_call_operands (ret
);
11163 /* Conveniently construct a function call expression. FNDECL names the
11164 function to be called and N arguments are passed in the array
11168 build_call_expr_loc_array (location_t loc
, tree fndecl
, int n
, tree
*argarray
)
11170 tree fntype
= TREE_TYPE (fndecl
);
11171 tree fn
= build1 (ADDR_EXPR
, build_pointer_type (fntype
), fndecl
);
11173 return fold_build_call_array_loc (loc
, TREE_TYPE (fntype
), fn
, n
, argarray
);
11176 /* Conveniently construct a function call expression. FNDECL names the
11177 function to be called and the arguments are passed in the vector
11181 build_call_expr_loc_vec (location_t loc
, tree fndecl
, vec
<tree
, va_gc
> *vec
)
11183 return build_call_expr_loc_array (loc
, fndecl
, vec_safe_length (vec
),
11184 vec_safe_address (vec
));
11188 /* Conveniently construct a function call expression. FNDECL names the
11189 function to be called, N is the number of arguments, and the "..."
11190 parameters are the argument expressions. */
11193 build_call_expr_loc (location_t loc
, tree fndecl
, int n
, ...)
11196 tree
*argarray
= XALLOCAVEC (tree
, n
);
11200 for (i
= 0; i
< n
; i
++)
11201 argarray
[i
] = va_arg (ap
, tree
);
11203 return build_call_expr_loc_array (loc
, fndecl
, n
, argarray
);
11206 /* Like build_call_expr_loc (UNKNOWN_LOCATION, ...). Duplicated because
11207 varargs macros aren't supported by all bootstrap compilers. */
11210 build_call_expr (tree fndecl
, int n
, ...)
11213 tree
*argarray
= XALLOCAVEC (tree
, n
);
11217 for (i
= 0; i
< n
; i
++)
11218 argarray
[i
] = va_arg (ap
, tree
);
11220 return build_call_expr_loc_array (UNKNOWN_LOCATION
, fndecl
, n
, argarray
);
11223 /* Build an internal call to IFN, with arguments ARGS[0:N-1] and with return
11224 type TYPE. This is just like CALL_EXPR, except its CALL_EXPR_FN is NULL.
11225 It will get gimplified later into an ordinary internal function. */
11228 build_call_expr_internal_loc_array (location_t loc
, internal_fn ifn
,
11229 tree type
, int n
, const tree
*args
)
11231 tree t
= build_call_1 (type
, NULL_TREE
, n
);
11232 for (int i
= 0; i
< n
; ++i
)
11233 CALL_EXPR_ARG (t
, i
) = args
[i
];
11234 SET_EXPR_LOCATION (t
, loc
);
11235 CALL_EXPR_IFN (t
) = ifn
;
11239 /* Build internal call expression. This is just like CALL_EXPR, except
11240 its CALL_EXPR_FN is NULL. It will get gimplified later into ordinary
11241 internal function. */
11244 build_call_expr_internal_loc (location_t loc
, enum internal_fn ifn
,
11245 tree type
, int n
, ...)
11248 tree
*argarray
= XALLOCAVEC (tree
, n
);
11252 for (i
= 0; i
< n
; i
++)
11253 argarray
[i
] = va_arg (ap
, tree
);
11255 return build_call_expr_internal_loc_array (loc
, ifn
, type
, n
, argarray
);
11258 /* Return a function call to FN, if the target is guaranteed to support it,
11261 N is the number of arguments, passed in the "...", and TYPE is the
11262 type of the return value. */
11265 maybe_build_call_expr_loc (location_t loc
, combined_fn fn
, tree type
,
11269 tree
*argarray
= XALLOCAVEC (tree
, n
);
11273 for (i
= 0; i
< n
; i
++)
11274 argarray
[i
] = va_arg (ap
, tree
);
11276 if (internal_fn_p (fn
))
11278 internal_fn ifn
= as_internal_fn (fn
);
11279 if (direct_internal_fn_p (ifn
))
11281 tree_pair types
= direct_internal_fn_types (ifn
, type
, argarray
);
11282 if (!direct_internal_fn_supported_p (ifn
, types
,
11283 OPTIMIZE_FOR_BOTH
))
11286 return build_call_expr_internal_loc_array (loc
, ifn
, type
, n
, argarray
);
11290 tree fndecl
= builtin_decl_implicit (as_builtin_fn (fn
));
11293 return build_call_expr_loc_array (loc
, fndecl
, n
, argarray
);
11297 /* Create a new constant string literal and return a char* pointer to it.
11298 The STRING_CST value is the LEN characters at STR. */
11300 build_string_literal (int len
, const char *str
)
11302 tree t
, elem
, index
, type
;
11304 t
= build_string (len
, str
);
11305 elem
= build_type_variant (char_type_node
, 1, 0);
11306 index
= build_index_type (size_int (len
- 1));
11307 type
= build_array_type (elem
, index
);
11308 TREE_TYPE (t
) = type
;
11309 TREE_CONSTANT (t
) = 1;
11310 TREE_READONLY (t
) = 1;
11311 TREE_STATIC (t
) = 1;
11313 type
= build_pointer_type (elem
);
11314 t
= build1 (ADDR_EXPR
, type
,
11315 build4 (ARRAY_REF
, elem
,
11316 t
, integer_zero_node
, NULL_TREE
, NULL_TREE
));
11322 /* Return true if T (assumed to be a DECL) must be assigned a memory
11326 needs_to_live_in_memory (const_tree t
)
11328 return (TREE_ADDRESSABLE (t
)
11329 || is_global_var (t
)
11330 || (TREE_CODE (t
) == RESULT_DECL
11331 && !DECL_BY_REFERENCE (t
)
11332 && aggregate_value_p (t
, current_function_decl
)));
11335 /* Return value of a constant X and sign-extend it. */
11338 int_cst_value (const_tree x
)
11340 unsigned bits
= TYPE_PRECISION (TREE_TYPE (x
));
11341 unsigned HOST_WIDE_INT val
= TREE_INT_CST_LOW (x
);
11343 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
11344 gcc_assert (cst_and_fits_in_hwi (x
));
11346 if (bits
< HOST_BITS_PER_WIDE_INT
)
11348 bool negative
= ((val
>> (bits
- 1)) & 1) != 0;
11350 val
|= (~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1;
11352 val
&= ~((~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1);
11358 /* If TYPE is an integral or pointer type, return an integer type with
11359 the same precision which is unsigned iff UNSIGNEDP is true, or itself
11360 if TYPE is already an integer type of signedness UNSIGNEDP. */
11363 signed_or_unsigned_type_for (int unsignedp
, tree type
)
11365 if (TREE_CODE (type
) == INTEGER_TYPE
&& TYPE_UNSIGNED (type
) == unsignedp
)
11368 if (TREE_CODE (type
) == VECTOR_TYPE
)
11370 tree inner
= TREE_TYPE (type
);
11371 tree inner2
= signed_or_unsigned_type_for (unsignedp
, inner
);
11374 if (inner
== inner2
)
11376 return build_vector_type (inner2
, TYPE_VECTOR_SUBPARTS (type
));
11379 if (!INTEGRAL_TYPE_P (type
)
11380 && !POINTER_TYPE_P (type
)
11381 && TREE_CODE (type
) != OFFSET_TYPE
)
11384 return build_nonstandard_integer_type (TYPE_PRECISION (type
), unsignedp
);
11387 /* If TYPE is an integral or pointer type, return an integer type with
11388 the same precision which is unsigned, or itself if TYPE is already an
11389 unsigned integer type. */
11392 unsigned_type_for (tree type
)
11394 return signed_or_unsigned_type_for (1, type
);
11397 /* If TYPE is an integral or pointer type, return an integer type with
11398 the same precision which is signed, or itself if TYPE is already a
11399 signed integer type. */
11402 signed_type_for (tree type
)
11404 return signed_or_unsigned_type_for (0, type
);
11407 /* If TYPE is a vector type, return a signed integer vector type with the
11408 same width and number of subparts. Otherwise return boolean_type_node. */
11411 truth_type_for (tree type
)
11413 if (TREE_CODE (type
) == VECTOR_TYPE
)
11415 if (VECTOR_BOOLEAN_TYPE_P (type
))
11417 return build_truth_vector_type (TYPE_VECTOR_SUBPARTS (type
),
11418 GET_MODE_SIZE (TYPE_MODE (type
)));
11421 return boolean_type_node
;
11424 /* Returns the largest value obtainable by casting something in INNER type to
11428 upper_bound_in_type (tree outer
, tree inner
)
11430 unsigned int det
= 0;
11431 unsigned oprec
= TYPE_PRECISION (outer
);
11432 unsigned iprec
= TYPE_PRECISION (inner
);
11435 /* Compute a unique number for every combination. */
11436 det
|= (oprec
> iprec
) ? 4 : 0;
11437 det
|= TYPE_UNSIGNED (outer
) ? 2 : 0;
11438 det
|= TYPE_UNSIGNED (inner
) ? 1 : 0;
11440 /* Determine the exponent to use. */
11445 /* oprec <= iprec, outer: signed, inner: don't care. */
11450 /* oprec <= iprec, outer: unsigned, inner: don't care. */
11454 /* oprec > iprec, outer: signed, inner: signed. */
11458 /* oprec > iprec, outer: signed, inner: unsigned. */
11462 /* oprec > iprec, outer: unsigned, inner: signed. */
11466 /* oprec > iprec, outer: unsigned, inner: unsigned. */
11470 gcc_unreachable ();
11473 return wide_int_to_tree (outer
,
11474 wi::mask (prec
, false, TYPE_PRECISION (outer
)));
11477 /* Returns the smallest value obtainable by casting something in INNER type to
11481 lower_bound_in_type (tree outer
, tree inner
)
11483 unsigned oprec
= TYPE_PRECISION (outer
);
11484 unsigned iprec
= TYPE_PRECISION (inner
);
11486 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
11488 if (TYPE_UNSIGNED (outer
)
11489 /* If we are widening something of an unsigned type, OUTER type
11490 contains all values of INNER type. In particular, both INNER
11491 and OUTER types have zero in common. */
11492 || (oprec
> iprec
&& TYPE_UNSIGNED (inner
)))
11493 return build_int_cst (outer
, 0);
11496 /* If we are widening a signed type to another signed type, we
11497 want to obtain -2^^(iprec-1). If we are keeping the
11498 precision or narrowing to a signed type, we want to obtain
11500 unsigned prec
= oprec
> iprec
? iprec
: oprec
;
11501 return wide_int_to_tree (outer
,
11502 wi::mask (prec
- 1, true,
11503 TYPE_PRECISION (outer
)));
11507 /* Return nonzero if two operands that are suitable for PHI nodes are
11508 necessarily equal. Specifically, both ARG0 and ARG1 must be either
11509 SSA_NAME or invariant. Note that this is strictly an optimization.
11510 That is, callers of this function can directly call operand_equal_p
11511 and get the same result, only slower. */
11514 operand_equal_for_phi_arg_p (const_tree arg0
, const_tree arg1
)
11518 if (TREE_CODE (arg0
) == SSA_NAME
|| TREE_CODE (arg1
) == SSA_NAME
)
11520 return operand_equal_p (arg0
, arg1
, 0);
11523 /* Returns number of zeros at the end of binary representation of X. */
11526 num_ending_zeros (const_tree x
)
11528 return build_int_cst (TREE_TYPE (x
), wi::ctz (x
));
11532 #define WALK_SUBTREE(NODE) \
11535 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
11541 /* This is a subroutine of walk_tree that walks field of TYPE that are to
11542 be walked whenever a type is seen in the tree. Rest of operands and return
11543 value are as for walk_tree. */
11546 walk_type_fields (tree type
, walk_tree_fn func
, void *data
,
11547 hash_set
<tree
> *pset
, walk_tree_lh lh
)
11549 tree result
= NULL_TREE
;
11551 switch (TREE_CODE (type
))
11554 case REFERENCE_TYPE
:
11556 /* We have to worry about mutually recursive pointers. These can't
11557 be written in C. They can in Ada. It's pathological, but
11558 there's an ACATS test (c38102a) that checks it. Deal with this
11559 by checking if we're pointing to another pointer, that one
11560 points to another pointer, that one does too, and we have no htab.
11561 If so, get a hash table. We check three levels deep to avoid
11562 the cost of the hash table if we don't need one. */
11563 if (POINTER_TYPE_P (TREE_TYPE (type
))
11564 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type
)))
11565 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type
))))
11568 result
= walk_tree_without_duplicates (&TREE_TYPE (type
),
11576 /* ... fall through ... */
11579 WALK_SUBTREE (TREE_TYPE (type
));
11583 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type
));
11585 /* Fall through. */
11587 case FUNCTION_TYPE
:
11588 WALK_SUBTREE (TREE_TYPE (type
));
11592 /* We never want to walk into default arguments. */
11593 for (arg
= TYPE_ARG_TYPES (type
); arg
; arg
= TREE_CHAIN (arg
))
11594 WALK_SUBTREE (TREE_VALUE (arg
));
11599 /* Don't follow this nodes's type if a pointer for fear that
11600 we'll have infinite recursion. If we have a PSET, then we
11603 || (!POINTER_TYPE_P (TREE_TYPE (type
))
11604 && TREE_CODE (TREE_TYPE (type
)) != OFFSET_TYPE
))
11605 WALK_SUBTREE (TREE_TYPE (type
));
11606 WALK_SUBTREE (TYPE_DOMAIN (type
));
11610 WALK_SUBTREE (TREE_TYPE (type
));
11611 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type
));
11621 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
11622 called with the DATA and the address of each sub-tree. If FUNC returns a
11623 non-NULL value, the traversal is stopped, and the value returned by FUNC
11624 is returned. If PSET is non-NULL it is used to record the nodes visited,
11625 and to avoid visiting a node more than once. */
11628 walk_tree_1 (tree
*tp
, walk_tree_fn func
, void *data
,
11629 hash_set
<tree
> *pset
, walk_tree_lh lh
)
11631 enum tree_code code
;
11635 #define WALK_SUBTREE_TAIL(NODE) \
11639 goto tail_recurse; \
11644 /* Skip empty subtrees. */
11648 /* Don't walk the same tree twice, if the user has requested
11649 that we avoid doing so. */
11650 if (pset
&& pset
->add (*tp
))
11653 /* Call the function. */
11655 result
= (*func
) (tp
, &walk_subtrees
, data
);
11657 /* If we found something, return it. */
11661 code
= TREE_CODE (*tp
);
11663 /* Even if we didn't, FUNC may have decided that there was nothing
11664 interesting below this point in the tree. */
11665 if (!walk_subtrees
)
11667 /* But we still need to check our siblings. */
11668 if (code
== TREE_LIST
)
11669 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
11670 else if (code
== OMP_CLAUSE
)
11671 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11678 result
= (*lh
) (tp
, &walk_subtrees
, func
, data
, pset
);
11679 if (result
|| !walk_subtrees
)
11686 case IDENTIFIER_NODE
:
11693 case PLACEHOLDER_EXPR
:
11697 /* None of these have subtrees other than those already walked
11702 WALK_SUBTREE (TREE_VALUE (*tp
));
11703 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
11708 int len
= TREE_VEC_LENGTH (*tp
);
11713 /* Walk all elements but the first. */
11715 WALK_SUBTREE (TREE_VEC_ELT (*tp
, len
));
11717 /* Now walk the first one as a tail call. */
11718 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp
, 0));
11722 WALK_SUBTREE (TREE_REALPART (*tp
));
11723 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp
));
11727 unsigned HOST_WIDE_INT idx
;
11728 constructor_elt
*ce
;
11730 for (idx
= 0; vec_safe_iterate (CONSTRUCTOR_ELTS (*tp
), idx
, &ce
);
11732 WALK_SUBTREE (ce
->value
);
11737 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, 0));
11742 for (decl
= BIND_EXPR_VARS (*tp
); decl
; decl
= DECL_CHAIN (decl
))
11744 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
11745 into declarations that are just mentioned, rather than
11746 declared; they don't really belong to this part of the tree.
11747 And, we can see cycles: the initializer for a declaration
11748 can refer to the declaration itself. */
11749 WALK_SUBTREE (DECL_INITIAL (decl
));
11750 WALK_SUBTREE (DECL_SIZE (decl
));
11751 WALK_SUBTREE (DECL_SIZE_UNIT (decl
));
11753 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp
));
11756 case STATEMENT_LIST
:
11758 tree_stmt_iterator i
;
11759 for (i
= tsi_start (*tp
); !tsi_end_p (i
); tsi_next (&i
))
11760 WALK_SUBTREE (*tsi_stmt_ptr (i
));
11765 switch (OMP_CLAUSE_CODE (*tp
))
11767 case OMP_CLAUSE_GANG
:
11768 case OMP_CLAUSE__GRIDDIM_
:
11769 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 1));
11772 case OMP_CLAUSE_ASYNC
:
11773 case OMP_CLAUSE_WAIT
:
11774 case OMP_CLAUSE_WORKER
:
11775 case OMP_CLAUSE_VECTOR
:
11776 case OMP_CLAUSE_NUM_GANGS
:
11777 case OMP_CLAUSE_NUM_WORKERS
:
11778 case OMP_CLAUSE_VECTOR_LENGTH
:
11779 case OMP_CLAUSE_PRIVATE
:
11780 case OMP_CLAUSE_SHARED
:
11781 case OMP_CLAUSE_FIRSTPRIVATE
:
11782 case OMP_CLAUSE_COPYIN
:
11783 case OMP_CLAUSE_COPYPRIVATE
:
11784 case OMP_CLAUSE_FINAL
:
11785 case OMP_CLAUSE_IF
:
11786 case OMP_CLAUSE_NUM_THREADS
:
11787 case OMP_CLAUSE_SCHEDULE
:
11788 case OMP_CLAUSE_UNIFORM
:
11789 case OMP_CLAUSE_DEPEND
:
11790 case OMP_CLAUSE_NUM_TEAMS
:
11791 case OMP_CLAUSE_THREAD_LIMIT
:
11792 case OMP_CLAUSE_DEVICE
:
11793 case OMP_CLAUSE_DIST_SCHEDULE
:
11794 case OMP_CLAUSE_SAFELEN
:
11795 case OMP_CLAUSE_SIMDLEN
:
11796 case OMP_CLAUSE_ORDERED
:
11797 case OMP_CLAUSE_PRIORITY
:
11798 case OMP_CLAUSE_GRAINSIZE
:
11799 case OMP_CLAUSE_NUM_TASKS
:
11800 case OMP_CLAUSE_HINT
:
11801 case OMP_CLAUSE_TO_DECLARE
:
11802 case OMP_CLAUSE_LINK
:
11803 case OMP_CLAUSE_USE_DEVICE_PTR
:
11804 case OMP_CLAUSE_IS_DEVICE_PTR
:
11805 case OMP_CLAUSE__LOOPTEMP_
:
11806 case OMP_CLAUSE__SIMDUID_
:
11807 case OMP_CLAUSE__CILK_FOR_COUNT_
:
11808 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 0));
11811 case OMP_CLAUSE_INDEPENDENT
:
11812 case OMP_CLAUSE_NOWAIT
:
11813 case OMP_CLAUSE_DEFAULT
:
11814 case OMP_CLAUSE_UNTIED
:
11815 case OMP_CLAUSE_MERGEABLE
:
11816 case OMP_CLAUSE_PROC_BIND
:
11817 case OMP_CLAUSE_INBRANCH
:
11818 case OMP_CLAUSE_NOTINBRANCH
:
11819 case OMP_CLAUSE_FOR
:
11820 case OMP_CLAUSE_PARALLEL
:
11821 case OMP_CLAUSE_SECTIONS
:
11822 case OMP_CLAUSE_TASKGROUP
:
11823 case OMP_CLAUSE_NOGROUP
:
11824 case OMP_CLAUSE_THREADS
:
11825 case OMP_CLAUSE_SIMD
:
11826 case OMP_CLAUSE_DEFAULTMAP
:
11827 case OMP_CLAUSE_AUTO
:
11828 case OMP_CLAUSE_SEQ
:
11829 case OMP_CLAUSE_TILE
:
11830 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11832 case OMP_CLAUSE_LASTPRIVATE
:
11833 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
11834 WALK_SUBTREE (OMP_CLAUSE_LASTPRIVATE_STMT (*tp
));
11835 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11837 case OMP_CLAUSE_COLLAPSE
:
11840 for (i
= 0; i
< 3; i
++)
11841 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
11842 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11845 case OMP_CLAUSE_LINEAR
:
11846 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
11847 WALK_SUBTREE (OMP_CLAUSE_LINEAR_STEP (*tp
));
11848 WALK_SUBTREE (OMP_CLAUSE_LINEAR_STMT (*tp
));
11849 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11851 case OMP_CLAUSE_ALIGNED
:
11852 case OMP_CLAUSE_FROM
:
11853 case OMP_CLAUSE_TO
:
11854 case OMP_CLAUSE_MAP
:
11855 case OMP_CLAUSE__CACHE_
:
11856 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
11857 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 1));
11858 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11860 case OMP_CLAUSE_REDUCTION
:
11863 for (i
= 0; i
< 5; i
++)
11864 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
11865 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11869 gcc_unreachable ();
11877 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
11878 But, we only want to walk once. */
11879 len
= (TREE_OPERAND (*tp
, 3) == TREE_OPERAND (*tp
, 1)) ? 2 : 3;
11880 for (i
= 0; i
< len
; ++i
)
11881 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
11882 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
));
11886 /* If this is a TYPE_DECL, walk into the fields of the type that it's
11887 defining. We only want to walk into these fields of a type in this
11888 case and not in the general case of a mere reference to the type.
11890 The criterion is as follows: if the field can be an expression, it
11891 must be walked only here. This should be in keeping with the fields
11892 that are directly gimplified in gimplify_type_sizes in order for the
11893 mark/copy-if-shared/unmark machinery of the gimplifier to work with
11894 variable-sized types.
11896 Note that DECLs get walked as part of processing the BIND_EXPR. */
11897 if (TREE_CODE (DECL_EXPR_DECL (*tp
)) == TYPE_DECL
)
11899 tree
*type_p
= &TREE_TYPE (DECL_EXPR_DECL (*tp
));
11900 if (TREE_CODE (*type_p
) == ERROR_MARK
)
11903 /* Call the function for the type. See if it returns anything or
11904 doesn't want us to continue. If we are to continue, walk both
11905 the normal fields and those for the declaration case. */
11906 result
= (*func
) (type_p
, &walk_subtrees
, data
);
11907 if (result
|| !walk_subtrees
)
11910 /* But do not walk a pointed-to type since it may itself need to
11911 be walked in the declaration case if it isn't anonymous. */
11912 if (!POINTER_TYPE_P (*type_p
))
11914 result
= walk_type_fields (*type_p
, func
, data
, pset
, lh
);
11919 /* If this is a record type, also walk the fields. */
11920 if (RECORD_OR_UNION_TYPE_P (*type_p
))
11924 for (field
= TYPE_FIELDS (*type_p
); field
;
11925 field
= DECL_CHAIN (field
))
11927 /* We'd like to look at the type of the field, but we can
11928 easily get infinite recursion. So assume it's pointed
11929 to elsewhere in the tree. Also, ignore things that
11931 if (TREE_CODE (field
) != FIELD_DECL
)
11934 WALK_SUBTREE (DECL_FIELD_OFFSET (field
));
11935 WALK_SUBTREE (DECL_SIZE (field
));
11936 WALK_SUBTREE (DECL_SIZE_UNIT (field
));
11937 if (TREE_CODE (*type_p
) == QUAL_UNION_TYPE
)
11938 WALK_SUBTREE (DECL_QUALIFIER (field
));
11942 /* Same for scalar types. */
11943 else if (TREE_CODE (*type_p
) == BOOLEAN_TYPE
11944 || TREE_CODE (*type_p
) == ENUMERAL_TYPE
11945 || TREE_CODE (*type_p
) == INTEGER_TYPE
11946 || TREE_CODE (*type_p
) == FIXED_POINT_TYPE
11947 || TREE_CODE (*type_p
) == REAL_TYPE
)
11949 WALK_SUBTREE (TYPE_MIN_VALUE (*type_p
));
11950 WALK_SUBTREE (TYPE_MAX_VALUE (*type_p
));
11953 WALK_SUBTREE (TYPE_SIZE (*type_p
));
11954 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p
));
11959 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code
)))
11963 /* Walk over all the sub-trees of this operand. */
11964 len
= TREE_OPERAND_LENGTH (*tp
);
11966 /* Go through the subtrees. We need to do this in forward order so
11967 that the scope of a FOR_EXPR is handled properly. */
11970 for (i
= 0; i
< len
- 1; ++i
)
11971 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
11972 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
- 1));
11975 /* If this is a type, walk the needed fields in the type. */
11976 else if (TYPE_P (*tp
))
11977 return walk_type_fields (*tp
, func
, data
, pset
, lh
);
11981 /* We didn't find what we were looking for. */
11984 #undef WALK_SUBTREE_TAIL
11986 #undef WALK_SUBTREE
11988 /* Like walk_tree, but does not walk duplicate nodes more than once. */
11991 walk_tree_without_duplicates_1 (tree
*tp
, walk_tree_fn func
, void *data
,
11996 hash_set
<tree
> pset
;
11997 result
= walk_tree_1 (tp
, func
, data
, &pset
, lh
);
12003 tree_block (tree t
)
12005 const enum tree_code_class c
= TREE_CODE_CLASS (TREE_CODE (t
));
12007 if (IS_EXPR_CODE_CLASS (c
))
12008 return LOCATION_BLOCK (t
->exp
.locus
);
12009 gcc_unreachable ();
12014 tree_set_block (tree t
, tree b
)
12016 const enum tree_code_class c
= TREE_CODE_CLASS (TREE_CODE (t
));
12018 if (IS_EXPR_CODE_CLASS (c
))
12020 t
->exp
.locus
= set_block (t
->exp
.locus
, b
);
12023 gcc_unreachable ();
12026 /* Create a nameless artificial label and put it in the current
12027 function context. The label has a location of LOC. Returns the
12028 newly created label. */
12031 create_artificial_label (location_t loc
)
12033 tree lab
= build_decl (loc
,
12034 LABEL_DECL
, NULL_TREE
, void_type_node
);
12036 DECL_ARTIFICIAL (lab
) = 1;
12037 DECL_IGNORED_P (lab
) = 1;
12038 DECL_CONTEXT (lab
) = current_function_decl
;
12042 /* Given a tree, try to return a useful variable name that we can use
12043 to prefix a temporary that is being assigned the value of the tree.
12044 I.E. given <temp> = &A, return A. */
12049 tree stripped_decl
;
12052 STRIP_NOPS (stripped_decl
);
12053 if (DECL_P (stripped_decl
) && DECL_NAME (stripped_decl
))
12054 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl
));
12055 else if (TREE_CODE (stripped_decl
) == SSA_NAME
)
12057 tree name
= SSA_NAME_IDENTIFIER (stripped_decl
);
12060 return IDENTIFIER_POINTER (name
);
12064 switch (TREE_CODE (stripped_decl
))
12067 return get_name (TREE_OPERAND (stripped_decl
, 0));
12074 /* Return true if TYPE has a variable argument list. */
12077 stdarg_p (const_tree fntype
)
12079 function_args_iterator args_iter
;
12080 tree n
= NULL_TREE
, t
;
12085 FOREACH_FUNCTION_ARGS (fntype
, t
, args_iter
)
12090 return n
!= NULL_TREE
&& n
!= void_type_node
;
12093 /* Return true if TYPE has a prototype. */
12096 prototype_p (const_tree fntype
)
12100 gcc_assert (fntype
!= NULL_TREE
);
12102 t
= TYPE_ARG_TYPES (fntype
);
12103 return (t
!= NULL_TREE
);
12106 /* If BLOCK is inlined from an __attribute__((__artificial__))
12107 routine, return pointer to location from where it has been
12110 block_nonartificial_location (tree block
)
12112 location_t
*ret
= NULL
;
12114 while (block
&& TREE_CODE (block
) == BLOCK
12115 && BLOCK_ABSTRACT_ORIGIN (block
))
12117 tree ao
= BLOCK_ABSTRACT_ORIGIN (block
);
12119 while (TREE_CODE (ao
) == BLOCK
12120 && BLOCK_ABSTRACT_ORIGIN (ao
)
12121 && BLOCK_ABSTRACT_ORIGIN (ao
) != ao
)
12122 ao
= BLOCK_ABSTRACT_ORIGIN (ao
);
12124 if (TREE_CODE (ao
) == FUNCTION_DECL
)
12126 /* If AO is an artificial inline, point RET to the
12127 call site locus at which it has been inlined and continue
12128 the loop, in case AO's caller is also an artificial
12130 if (DECL_DECLARED_INLINE_P (ao
)
12131 && lookup_attribute ("artificial", DECL_ATTRIBUTES (ao
)))
12132 ret
= &BLOCK_SOURCE_LOCATION (block
);
12136 else if (TREE_CODE (ao
) != BLOCK
)
12139 block
= BLOCK_SUPERCONTEXT (block
);
12145 /* If EXP is inlined from an __attribute__((__artificial__))
12146 function, return the location of the original call expression. */
12149 tree_nonartificial_location (tree exp
)
12151 location_t
*loc
= block_nonartificial_location (TREE_BLOCK (exp
));
12156 return EXPR_LOCATION (exp
);
12160 /* These are the hash table functions for the hash table of OPTIMIZATION_NODEq
12163 /* Return the hash code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
12166 cl_option_hasher::hash (tree x
)
12168 const_tree
const t
= x
;
12172 hashval_t hash
= 0;
12174 if (TREE_CODE (t
) == OPTIMIZATION_NODE
)
12176 p
= (const char *)TREE_OPTIMIZATION (t
);
12177 len
= sizeof (struct cl_optimization
);
12180 else if (TREE_CODE (t
) == TARGET_OPTION_NODE
)
12181 return cl_target_option_hash (TREE_TARGET_OPTION (t
));
12184 gcc_unreachable ();
12186 /* assume most opt flags are just 0/1, some are 2-3, and a few might be
12188 for (i
= 0; i
< len
; i
++)
12190 hash
= (hash
<< 4) ^ ((i
<< 2) | p
[i
]);
12195 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
12196 TARGET_OPTION tree node) is the same as that given by *Y, which is the
12200 cl_option_hasher::equal (tree x
, tree y
)
12202 const_tree
const xt
= x
;
12203 const_tree
const yt
= y
;
12208 if (TREE_CODE (xt
) != TREE_CODE (yt
))
12211 if (TREE_CODE (xt
) == OPTIMIZATION_NODE
)
12213 xp
= (const char *)TREE_OPTIMIZATION (xt
);
12214 yp
= (const char *)TREE_OPTIMIZATION (yt
);
12215 len
= sizeof (struct cl_optimization
);
12218 else if (TREE_CODE (xt
) == TARGET_OPTION_NODE
)
12220 return cl_target_option_eq (TREE_TARGET_OPTION (xt
),
12221 TREE_TARGET_OPTION (yt
));
12225 gcc_unreachable ();
12227 return (memcmp (xp
, yp
, len
) == 0);
12230 /* Build an OPTIMIZATION_NODE based on the options in OPTS. */
12233 build_optimization_node (struct gcc_options
*opts
)
12237 /* Use the cache of optimization nodes. */
12239 cl_optimization_save (TREE_OPTIMIZATION (cl_optimization_node
),
12242 tree
*slot
= cl_option_hash_table
->find_slot (cl_optimization_node
, INSERT
);
12246 /* Insert this one into the hash table. */
12247 t
= cl_optimization_node
;
12250 /* Make a new node for next time round. */
12251 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
12257 /* Build a TARGET_OPTION_NODE based on the options in OPTS. */
12260 build_target_option_node (struct gcc_options
*opts
)
12264 /* Use the cache of optimization nodes. */
12266 cl_target_option_save (TREE_TARGET_OPTION (cl_target_option_node
),
12269 tree
*slot
= cl_option_hash_table
->find_slot (cl_target_option_node
, INSERT
);
12273 /* Insert this one into the hash table. */
12274 t
= cl_target_option_node
;
12277 /* Make a new node for next time round. */
12278 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
12284 /* Clear TREE_TARGET_GLOBALS of all TARGET_OPTION_NODE trees,
12285 so that they aren't saved during PCH writing. */
12288 prepare_target_option_nodes_for_pch (void)
12290 hash_table
<cl_option_hasher
>::iterator iter
= cl_option_hash_table
->begin ();
12291 for (; iter
!= cl_option_hash_table
->end (); ++iter
)
12292 if (TREE_CODE (*iter
) == TARGET_OPTION_NODE
)
12293 TREE_TARGET_GLOBALS (*iter
) = NULL
;
12296 /* Determine the "ultimate origin" of a block. The block may be an inlined
12297 instance of an inlined instance of a block which is local to an inline
12298 function, so we have to trace all of the way back through the origin chain
12299 to find out what sort of node actually served as the original seed for the
12303 block_ultimate_origin (const_tree block
)
12305 tree immediate_origin
= BLOCK_ABSTRACT_ORIGIN (block
);
12307 /* BLOCK_ABSTRACT_ORIGIN can point to itself; ignore that if
12308 we're trying to output the abstract instance of this function. */
12309 if (BLOCK_ABSTRACT (block
) && immediate_origin
== block
)
12312 if (immediate_origin
== NULL_TREE
)
12317 tree lookahead
= immediate_origin
;
12321 ret_val
= lookahead
;
12322 lookahead
= (TREE_CODE (ret_val
) == BLOCK
12323 ? BLOCK_ABSTRACT_ORIGIN (ret_val
) : NULL
);
12325 while (lookahead
!= NULL
&& lookahead
!= ret_val
);
12327 /* The block's abstract origin chain may not be the *ultimate* origin of
12328 the block. It could lead to a DECL that has an abstract origin set.
12329 If so, we want that DECL's abstract origin (which is what DECL_ORIGIN
12330 will give us if it has one). Note that DECL's abstract origins are
12331 supposed to be the most distant ancestor (or so decl_ultimate_origin
12332 claims), so we don't need to loop following the DECL origins. */
12333 if (DECL_P (ret_val
))
12334 return DECL_ORIGIN (ret_val
);
12340 /* Return true iff conversion from INNER_TYPE to OUTER_TYPE generates
12344 tree_nop_conversion_p (const_tree outer_type
, const_tree inner_type
)
12346 /* Do not strip casts into or out of differing address spaces. */
12347 if (POINTER_TYPE_P (outer_type
)
12348 && TYPE_ADDR_SPACE (TREE_TYPE (outer_type
)) != ADDR_SPACE_GENERIC
)
12350 if (!POINTER_TYPE_P (inner_type
)
12351 || (TYPE_ADDR_SPACE (TREE_TYPE (outer_type
))
12352 != TYPE_ADDR_SPACE (TREE_TYPE (inner_type
))))
12355 else if (POINTER_TYPE_P (inner_type
)
12356 && TYPE_ADDR_SPACE (TREE_TYPE (inner_type
)) != ADDR_SPACE_GENERIC
)
12358 /* We already know that outer_type is not a pointer with
12359 a non-generic address space. */
12363 /* Use precision rather then machine mode when we can, which gives
12364 the correct answer even for submode (bit-field) types. */
12365 if ((INTEGRAL_TYPE_P (outer_type
)
12366 || POINTER_TYPE_P (outer_type
)
12367 || TREE_CODE (outer_type
) == OFFSET_TYPE
)
12368 && (INTEGRAL_TYPE_P (inner_type
)
12369 || POINTER_TYPE_P (inner_type
)
12370 || TREE_CODE (inner_type
) == OFFSET_TYPE
))
12371 return TYPE_PRECISION (outer_type
) == TYPE_PRECISION (inner_type
);
12373 /* Otherwise fall back on comparing machine modes (e.g. for
12374 aggregate types, floats). */
12375 return TYPE_MODE (outer_type
) == TYPE_MODE (inner_type
);
12378 /* Return true iff conversion in EXP generates no instruction. Mark
12379 it inline so that we fully inline into the stripping functions even
12380 though we have two uses of this function. */
12383 tree_nop_conversion (const_tree exp
)
12385 tree outer_type
, inner_type
;
12387 if (!CONVERT_EXPR_P (exp
)
12388 && TREE_CODE (exp
) != NON_LVALUE_EXPR
)
12390 if (TREE_OPERAND (exp
, 0) == error_mark_node
)
12393 outer_type
= TREE_TYPE (exp
);
12394 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
12399 return tree_nop_conversion_p (outer_type
, inner_type
);
12402 /* Return true iff conversion in EXP generates no instruction. Don't
12403 consider conversions changing the signedness. */
12406 tree_sign_nop_conversion (const_tree exp
)
12408 tree outer_type
, inner_type
;
12410 if (!tree_nop_conversion (exp
))
12413 outer_type
= TREE_TYPE (exp
);
12414 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
12416 return (TYPE_UNSIGNED (outer_type
) == TYPE_UNSIGNED (inner_type
)
12417 && POINTER_TYPE_P (outer_type
) == POINTER_TYPE_P (inner_type
));
12420 /* Strip conversions from EXP according to tree_nop_conversion and
12421 return the resulting expression. */
12424 tree_strip_nop_conversions (tree exp
)
12426 while (tree_nop_conversion (exp
))
12427 exp
= TREE_OPERAND (exp
, 0);
12431 /* Strip conversions from EXP according to tree_sign_nop_conversion
12432 and return the resulting expression. */
12435 tree_strip_sign_nop_conversions (tree exp
)
12437 while (tree_sign_nop_conversion (exp
))
12438 exp
= TREE_OPERAND (exp
, 0);
12442 /* Avoid any floating point extensions from EXP. */
12444 strip_float_extensions (tree exp
)
12446 tree sub
, expt
, subt
;
12448 /* For floating point constant look up the narrowest type that can hold
12449 it properly and handle it like (type)(narrowest_type)constant.
12450 This way we can optimize for instance a=a*2.0 where "a" is float
12451 but 2.0 is double constant. */
12452 if (TREE_CODE (exp
) == REAL_CST
&& !DECIMAL_FLOAT_TYPE_P (TREE_TYPE (exp
)))
12454 REAL_VALUE_TYPE orig
;
12457 orig
= TREE_REAL_CST (exp
);
12458 if (TYPE_PRECISION (TREE_TYPE (exp
)) > TYPE_PRECISION (float_type_node
)
12459 && exact_real_truncate (TYPE_MODE (float_type_node
), &orig
))
12460 type
= float_type_node
;
12461 else if (TYPE_PRECISION (TREE_TYPE (exp
))
12462 > TYPE_PRECISION (double_type_node
)
12463 && exact_real_truncate (TYPE_MODE (double_type_node
), &orig
))
12464 type
= double_type_node
;
12466 return build_real_truncate (type
, orig
);
12469 if (!CONVERT_EXPR_P (exp
))
12472 sub
= TREE_OPERAND (exp
, 0);
12473 subt
= TREE_TYPE (sub
);
12474 expt
= TREE_TYPE (exp
);
12476 if (!FLOAT_TYPE_P (subt
))
12479 if (DECIMAL_FLOAT_TYPE_P (expt
) != DECIMAL_FLOAT_TYPE_P (subt
))
12482 if (TYPE_PRECISION (subt
) > TYPE_PRECISION (expt
))
12485 return strip_float_extensions (sub
);
12488 /* Strip out all handled components that produce invariant
12492 strip_invariant_refs (const_tree op
)
12494 while (handled_component_p (op
))
12496 switch (TREE_CODE (op
))
12499 case ARRAY_RANGE_REF
:
12500 if (!is_gimple_constant (TREE_OPERAND (op
, 1))
12501 || TREE_OPERAND (op
, 2) != NULL_TREE
12502 || TREE_OPERAND (op
, 3) != NULL_TREE
)
12506 case COMPONENT_REF
:
12507 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
12513 op
= TREE_OPERAND (op
, 0);
12519 static GTY(()) tree gcc_eh_personality_decl
;
12521 /* Return the GCC personality function decl. */
12524 lhd_gcc_personality (void)
12526 if (!gcc_eh_personality_decl
)
12527 gcc_eh_personality_decl
= build_personality_function ("gcc");
12528 return gcc_eh_personality_decl
;
12531 /* TARGET is a call target of GIMPLE call statement
12532 (obtained by gimple_call_fn). Return true if it is
12533 OBJ_TYPE_REF representing an virtual call of C++ method.
12534 (As opposed to OBJ_TYPE_REF representing objc calls
12535 through a cast where middle-end devirtualization machinery
12539 virtual_method_call_p (const_tree target
)
12541 if (TREE_CODE (target
) != OBJ_TYPE_REF
)
12543 tree t
= TREE_TYPE (target
);
12544 gcc_checking_assert (TREE_CODE (t
) == POINTER_TYPE
);
12546 if (TREE_CODE (t
) == FUNCTION_TYPE
)
12548 gcc_checking_assert (TREE_CODE (t
) == METHOD_TYPE
);
12549 /* If we do not have BINFO associated, it means that type was built
12550 without devirtualization enabled. Do not consider this a virtual
12552 if (!TYPE_BINFO (obj_type_ref_class (target
)))
12557 /* REF is OBJ_TYPE_REF, return the class the ref corresponds to. */
12560 obj_type_ref_class (const_tree ref
)
12562 gcc_checking_assert (TREE_CODE (ref
) == OBJ_TYPE_REF
);
12563 ref
= TREE_TYPE (ref
);
12564 gcc_checking_assert (TREE_CODE (ref
) == POINTER_TYPE
);
12565 ref
= TREE_TYPE (ref
);
12566 /* We look for type THIS points to. ObjC also builds
12567 OBJ_TYPE_REF with non-method calls, Their first parameter
12568 ID however also corresponds to class type. */
12569 gcc_checking_assert (TREE_CODE (ref
) == METHOD_TYPE
12570 || TREE_CODE (ref
) == FUNCTION_TYPE
);
12571 ref
= TREE_VALUE (TYPE_ARG_TYPES (ref
));
12572 gcc_checking_assert (TREE_CODE (ref
) == POINTER_TYPE
);
12573 return TREE_TYPE (ref
);
12576 /* Lookup sub-BINFO of BINFO of TYPE at offset POS. */
12579 lookup_binfo_at_offset (tree binfo
, tree type
, HOST_WIDE_INT pos
)
12582 tree base_binfo
, b
;
12584 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
12585 if (pos
== tree_to_shwi (BINFO_OFFSET (base_binfo
))
12586 && types_same_for_odr (TREE_TYPE (base_binfo
), type
))
12588 else if ((b
= lookup_binfo_at_offset (base_binfo
, type
, pos
)) != NULL
)
12593 /* Try to find a base info of BINFO that would have its field decl at offset
12594 OFFSET within the BINFO type and which is of EXPECTED_TYPE. If it can be
12595 found, return, otherwise return NULL_TREE. */
12598 get_binfo_at_offset (tree binfo
, HOST_WIDE_INT offset
, tree expected_type
)
12600 tree type
= BINFO_TYPE (binfo
);
12604 HOST_WIDE_INT pos
, size
;
12608 if (types_same_for_odr (type
, expected_type
))
12613 for (fld
= TYPE_FIELDS (type
); fld
; fld
= DECL_CHAIN (fld
))
12615 if (TREE_CODE (fld
) != FIELD_DECL
|| !DECL_ARTIFICIAL (fld
))
12618 pos
= int_bit_position (fld
);
12619 size
= tree_to_uhwi (DECL_SIZE (fld
));
12620 if (pos
<= offset
&& (pos
+ size
) > offset
)
12623 if (!fld
|| TREE_CODE (TREE_TYPE (fld
)) != RECORD_TYPE
)
12626 /* Offset 0 indicates the primary base, whose vtable contents are
12627 represented in the binfo for the derived class. */
12628 else if (offset
!= 0)
12630 tree found_binfo
= NULL
, base_binfo
;
12631 /* Offsets in BINFO are in bytes relative to the whole structure
12632 while POS is in bits relative to the containing field. */
12633 int binfo_offset
= (tree_to_shwi (BINFO_OFFSET (binfo
)) + pos
12636 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
12637 if (tree_to_shwi (BINFO_OFFSET (base_binfo
)) == binfo_offset
12638 && types_same_for_odr (TREE_TYPE (base_binfo
), TREE_TYPE (fld
)))
12640 found_binfo
= base_binfo
;
12644 binfo
= found_binfo
;
12646 binfo
= lookup_binfo_at_offset (binfo
, TREE_TYPE (fld
),
12650 type
= TREE_TYPE (fld
);
12655 /* Returns true if X is a typedef decl. */
12658 is_typedef_decl (const_tree x
)
12660 return (x
&& TREE_CODE (x
) == TYPE_DECL
12661 && DECL_ORIGINAL_TYPE (x
) != NULL_TREE
);
12664 /* Returns true iff TYPE is a type variant created for a typedef. */
12667 typedef_variant_p (const_tree type
)
12669 return is_typedef_decl (TYPE_NAME (type
));
12672 /* Warn about a use of an identifier which was marked deprecated. */
12674 warn_deprecated_use (tree node
, tree attr
)
12678 if (node
== 0 || !warn_deprecated_decl
)
12684 attr
= DECL_ATTRIBUTES (node
);
12685 else if (TYPE_P (node
))
12687 tree decl
= TYPE_STUB_DECL (node
);
12689 attr
= lookup_attribute ("deprecated",
12690 TYPE_ATTRIBUTES (TREE_TYPE (decl
)));
12695 attr
= lookup_attribute ("deprecated", attr
);
12698 msg
= TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr
)));
12706 w
= warning (OPT_Wdeprecated_declarations
,
12707 "%qD is deprecated: %s", node
, msg
);
12709 w
= warning (OPT_Wdeprecated_declarations
,
12710 "%qD is deprecated", node
);
12712 inform (DECL_SOURCE_LOCATION (node
), "declared here");
12714 else if (TYPE_P (node
))
12716 tree what
= NULL_TREE
;
12717 tree decl
= TYPE_STUB_DECL (node
);
12719 if (TYPE_NAME (node
))
12721 if (TREE_CODE (TYPE_NAME (node
)) == IDENTIFIER_NODE
)
12722 what
= TYPE_NAME (node
);
12723 else if (TREE_CODE (TYPE_NAME (node
)) == TYPE_DECL
12724 && DECL_NAME (TYPE_NAME (node
)))
12725 what
= DECL_NAME (TYPE_NAME (node
));
12733 w
= warning (OPT_Wdeprecated_declarations
,
12734 "%qE is deprecated: %s", what
, msg
);
12736 w
= warning (OPT_Wdeprecated_declarations
,
12737 "%qE is deprecated", what
);
12742 w
= warning (OPT_Wdeprecated_declarations
,
12743 "type is deprecated: %s", msg
);
12745 w
= warning (OPT_Wdeprecated_declarations
,
12746 "type is deprecated");
12749 inform (DECL_SOURCE_LOCATION (decl
), "declared here");
12756 warning (OPT_Wdeprecated_declarations
, "%qE is deprecated: %s",
12759 warning (OPT_Wdeprecated_declarations
, "%qE is deprecated", what
);
12764 warning (OPT_Wdeprecated_declarations
, "type is deprecated: %s",
12767 warning (OPT_Wdeprecated_declarations
, "type is deprecated");
12773 /* Return true if REF has a COMPONENT_REF with a bit-field field declaration
12774 somewhere in it. */
12777 contains_bitfld_component_ref_p (const_tree ref
)
12779 while (handled_component_p (ref
))
12781 if (TREE_CODE (ref
) == COMPONENT_REF
12782 && DECL_BIT_FIELD (TREE_OPERAND (ref
, 1)))
12784 ref
= TREE_OPERAND (ref
, 0);
12790 /* Try to determine whether a TRY_CATCH expression can fall through.
12791 This is a subroutine of block_may_fallthru. */
12794 try_catch_may_fallthru (const_tree stmt
)
12796 tree_stmt_iterator i
;
12798 /* If the TRY block can fall through, the whole TRY_CATCH can
12800 if (block_may_fallthru (TREE_OPERAND (stmt
, 0)))
12803 i
= tsi_start (TREE_OPERAND (stmt
, 1));
12804 switch (TREE_CODE (tsi_stmt (i
)))
12807 /* We expect to see a sequence of CATCH_EXPR trees, each with a
12808 catch expression and a body. The whole TRY_CATCH may fall
12809 through iff any of the catch bodies falls through. */
12810 for (; !tsi_end_p (i
); tsi_next (&i
))
12812 if (block_may_fallthru (CATCH_BODY (tsi_stmt (i
))))
12817 case EH_FILTER_EXPR
:
12818 /* The exception filter expression only matters if there is an
12819 exception. If the exception does not match EH_FILTER_TYPES,
12820 we will execute EH_FILTER_FAILURE, and we will fall through
12821 if that falls through. If the exception does match
12822 EH_FILTER_TYPES, the stack unwinder will continue up the
12823 stack, so we will not fall through. We don't know whether we
12824 will throw an exception which matches EH_FILTER_TYPES or not,
12825 so we just ignore EH_FILTER_TYPES and assume that we might
12826 throw an exception which doesn't match. */
12827 return block_may_fallthru (EH_FILTER_FAILURE (tsi_stmt (i
)));
12830 /* This case represents statements to be executed when an
12831 exception occurs. Those statements are implicitly followed
12832 by a RESX statement to resume execution after the exception.
12833 So in this case the TRY_CATCH never falls through. */
12838 /* Try to determine if we can fall out of the bottom of BLOCK. This guess
12839 need not be 100% accurate; simply be conservative and return true if we
12840 don't know. This is used only to avoid stupidly generating extra code.
12841 If we're wrong, we'll just delete the extra code later. */
12844 block_may_fallthru (const_tree block
)
12846 /* This CONST_CAST is okay because expr_last returns its argument
12847 unmodified and we assign it to a const_tree. */
12848 const_tree stmt
= expr_last (CONST_CAST_TREE (block
));
12850 switch (stmt
? TREE_CODE (stmt
) : ERROR_MARK
)
12854 /* Easy cases. If the last statement of the block implies
12855 control transfer, then we can't fall through. */
12859 /* If SWITCH_LABELS is set, this is lowered, and represents a
12860 branch to a selected label and hence can not fall through.
12861 Otherwise SWITCH_BODY is set, and the switch can fall
12863 return SWITCH_LABELS (stmt
) == NULL_TREE
;
12866 if (block_may_fallthru (COND_EXPR_THEN (stmt
)))
12868 return block_may_fallthru (COND_EXPR_ELSE (stmt
));
12871 return block_may_fallthru (BIND_EXPR_BODY (stmt
));
12873 case TRY_CATCH_EXPR
:
12874 return try_catch_may_fallthru (stmt
);
12876 case TRY_FINALLY_EXPR
:
12877 /* The finally clause is always executed after the try clause,
12878 so if it does not fall through, then the try-finally will not
12879 fall through. Otherwise, if the try clause does not fall
12880 through, then when the finally clause falls through it will
12881 resume execution wherever the try clause was going. So the
12882 whole try-finally will only fall through if both the try
12883 clause and the finally clause fall through. */
12884 return (block_may_fallthru (TREE_OPERAND (stmt
, 0))
12885 && block_may_fallthru (TREE_OPERAND (stmt
, 1)));
12888 if (TREE_CODE (TREE_OPERAND (stmt
, 1)) == CALL_EXPR
)
12889 stmt
= TREE_OPERAND (stmt
, 1);
12895 /* Functions that do not return do not fall through. */
12896 return (call_expr_flags (stmt
) & ECF_NORETURN
) == 0;
12898 case CLEANUP_POINT_EXPR
:
12899 return block_may_fallthru (TREE_OPERAND (stmt
, 0));
12902 return block_may_fallthru (TREE_OPERAND (stmt
, 1));
12908 return lang_hooks
.block_may_fallthru (stmt
);
12912 /* True if we are using EH to handle cleanups. */
12913 static bool using_eh_for_cleanups_flag
= false;
12915 /* This routine is called from front ends to indicate eh should be used for
12918 using_eh_for_cleanups (void)
12920 using_eh_for_cleanups_flag
= true;
12923 /* Query whether EH is used for cleanups. */
12925 using_eh_for_cleanups_p (void)
12927 return using_eh_for_cleanups_flag
;
12930 /* Wrapper for tree_code_name to ensure that tree code is valid */
12932 get_tree_code_name (enum tree_code code
)
12934 const char *invalid
= "<invalid tree code>";
12936 if (code
>= MAX_TREE_CODES
)
12939 return tree_code_name
[code
];
12942 /* Drops the TREE_OVERFLOW flag from T. */
12945 drop_tree_overflow (tree t
)
12947 gcc_checking_assert (TREE_OVERFLOW (t
));
12949 /* For tree codes with a sharing machinery re-build the result. */
12950 if (TREE_CODE (t
) == INTEGER_CST
)
12951 return wide_int_to_tree (TREE_TYPE (t
), t
);
12953 /* Otherwise, as all tcc_constants are possibly shared, copy the node
12954 and drop the flag. */
12956 TREE_OVERFLOW (t
) = 0;
12960 /* Given a memory reference expression T, return its base address.
12961 The base address of a memory reference expression is the main
12962 object being referenced. For instance, the base address for
12963 'array[i].fld[j]' is 'array'. You can think of this as stripping
12964 away the offset part from a memory address.
12966 This function calls handled_component_p to strip away all the inner
12967 parts of the memory reference until it reaches the base object. */
12970 get_base_address (tree t
)
12972 while (handled_component_p (t
))
12973 t
= TREE_OPERAND (t
, 0);
12975 if ((TREE_CODE (t
) == MEM_REF
12976 || TREE_CODE (t
) == TARGET_MEM_REF
)
12977 && TREE_CODE (TREE_OPERAND (t
, 0)) == ADDR_EXPR
)
12978 t
= TREE_OPERAND (TREE_OPERAND (t
, 0), 0);
12980 /* ??? Either the alias oracle or all callers need to properly deal
12981 with WITH_SIZE_EXPRs before we can look through those. */
12982 if (TREE_CODE (t
) == WITH_SIZE_EXPR
)
12988 /* Return a tree of sizetype representing the size, in bytes, of the element
12989 of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
12992 array_ref_element_size (tree exp
)
12994 tree aligned_size
= TREE_OPERAND (exp
, 3);
12995 tree elmt_type
= TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp
, 0)));
12996 location_t loc
= EXPR_LOCATION (exp
);
12998 /* If a size was specified in the ARRAY_REF, it's the size measured
12999 in alignment units of the element type. So multiply by that value. */
13002 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
13003 sizetype from another type of the same width and signedness. */
13004 if (TREE_TYPE (aligned_size
) != sizetype
)
13005 aligned_size
= fold_convert_loc (loc
, sizetype
, aligned_size
);
13006 return size_binop_loc (loc
, MULT_EXPR
, aligned_size
,
13007 size_int (TYPE_ALIGN_UNIT (elmt_type
)));
13010 /* Otherwise, take the size from that of the element type. Substitute
13011 any PLACEHOLDER_EXPR that we have. */
13013 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_SIZE_UNIT (elmt_type
), exp
);
13016 /* Return a tree representing the lower bound of the array mentioned in
13017 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
13020 array_ref_low_bound (tree exp
)
13022 tree domain_type
= TYPE_DOMAIN (TREE_TYPE (TREE_OPERAND (exp
, 0)));
13024 /* If a lower bound is specified in EXP, use it. */
13025 if (TREE_OPERAND (exp
, 2))
13026 return TREE_OPERAND (exp
, 2);
13028 /* Otherwise, if there is a domain type and it has a lower bound, use it,
13029 substituting for a PLACEHOLDER_EXPR as needed. */
13030 if (domain_type
&& TYPE_MIN_VALUE (domain_type
))
13031 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_MIN_VALUE (domain_type
), exp
);
13033 /* Otherwise, return a zero of the appropriate type. */
13034 return build_int_cst (TREE_TYPE (TREE_OPERAND (exp
, 1)), 0);
13037 /* Return a tree representing the upper bound of the array mentioned in
13038 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
13041 array_ref_up_bound (tree exp
)
13043 tree domain_type
= TYPE_DOMAIN (TREE_TYPE (TREE_OPERAND (exp
, 0)));
13045 /* If there is a domain type and it has an upper bound, use it, substituting
13046 for a PLACEHOLDER_EXPR as needed. */
13047 if (domain_type
&& TYPE_MAX_VALUE (domain_type
))
13048 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_MAX_VALUE (domain_type
), exp
);
13050 /* Otherwise fail. */
13054 /* Returns true if REF is an array reference to an array at the end of
13055 a structure. If this is the case, the array may be allocated larger
13056 than its upper bound implies. */
13059 array_at_struct_end_p (tree ref
)
13061 if (TREE_CODE (ref
) != ARRAY_REF
13062 && TREE_CODE (ref
) != ARRAY_RANGE_REF
)
13065 while (handled_component_p (ref
))
13067 /* If the reference chain contains a component reference to a
13068 non-union type and there follows another field the reference
13069 is not at the end of a structure. */
13070 if (TREE_CODE (ref
) == COMPONENT_REF
13071 && TREE_CODE (TREE_TYPE (TREE_OPERAND (ref
, 0))) == RECORD_TYPE
)
13073 tree nextf
= DECL_CHAIN (TREE_OPERAND (ref
, 1));
13074 while (nextf
&& TREE_CODE (nextf
) != FIELD_DECL
)
13075 nextf
= DECL_CHAIN (nextf
);
13080 ref
= TREE_OPERAND (ref
, 0);
13085 if (TREE_CODE (ref
) == MEM_REF
13086 && TREE_CODE (TREE_OPERAND (ref
, 0)) == ADDR_EXPR
)
13088 size
= TYPE_SIZE (TREE_TYPE (ref
));
13089 ref
= TREE_OPERAND (TREE_OPERAND (ref
, 0), 0);
13092 /* If the reference is based on a declared entity, the size of the array
13093 is constrained by its given domain. (Do not trust commons PR/69368). */
13095 /* Be sure the size of MEM_REF target match. For example:
13098 struct foo *str = (struct foo *)&buf;
13100 str->trailin_array[2] = 1;
13102 is valid because BUF allocate enough space. */
13104 && (!size
|| (DECL_SIZE (ref
) != NULL
13105 && operand_equal_p (DECL_SIZE (ref
), size
, 0)))
13106 && !(flag_unconstrained_commons
13107 && TREE_CODE (ref
) == VAR_DECL
&& DECL_COMMON (ref
)))
13113 /* Return a tree representing the offset, in bytes, of the field referenced
13114 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
13117 component_ref_field_offset (tree exp
)
13119 tree aligned_offset
= TREE_OPERAND (exp
, 2);
13120 tree field
= TREE_OPERAND (exp
, 1);
13121 location_t loc
= EXPR_LOCATION (exp
);
13123 /* If an offset was specified in the COMPONENT_REF, it's the offset measured
13124 in units of DECL_OFFSET_ALIGN / BITS_PER_UNIT. So multiply by that
13126 if (aligned_offset
)
13128 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
13129 sizetype from another type of the same width and signedness. */
13130 if (TREE_TYPE (aligned_offset
) != sizetype
)
13131 aligned_offset
= fold_convert_loc (loc
, sizetype
, aligned_offset
);
13132 return size_binop_loc (loc
, MULT_EXPR
, aligned_offset
,
13133 size_int (DECL_OFFSET_ALIGN (field
)
13137 /* Otherwise, take the offset from that of the field. Substitute
13138 any PLACEHOLDER_EXPR that we have. */
13140 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (DECL_FIELD_OFFSET (field
), exp
);
13143 /* Return the machine mode of T. For vectors, returns the mode of the
13144 inner type. The main use case is to feed the result to HONOR_NANS,
13145 avoiding the BLKmode that a direct TYPE_MODE (T) might return. */
13148 element_mode (const_tree t
)
13152 if (VECTOR_TYPE_P (t
) || TREE_CODE (t
) == COMPLEX_TYPE
)
13154 return TYPE_MODE (t
);
13158 /* Veirfy that basic properties of T match TV and thus T can be a variant of
13159 TV. TV should be the more specified variant (i.e. the main variant). */
13162 verify_type_variant (const_tree t
, tree tv
)
13164 /* Type variant can differ by:
13166 - TYPE_QUALS: TYPE_READONLY, TYPE_VOLATILE, TYPE_ATOMIC, TYPE_RESTRICT,
13167 ENCODE_QUAL_ADDR_SPACE.
13168 - main variant may be TYPE_COMPLETE_P and variant types !TYPE_COMPLETE_P
13169 in this case some values may not be set in the variant types
13170 (see TYPE_COMPLETE_P checks).
13171 - it is possible to have TYPE_ARTIFICIAL variant of non-artifical type
13172 - by TYPE_NAME and attributes (i.e. when variant originate by typedef)
13173 - TYPE_CANONICAL (TYPE_ALIAS_SET is the same among variants)
13174 - by the alignment: TYPE_ALIGN and TYPE_USER_ALIGN
13175 - during LTO by TYPE_CONTEXT if type is TYPE_FILE_SCOPE_P
13176 this is necessary to make it possible to merge types form different TUs
13177 - arrays, pointers and references may have TREE_TYPE that is a variant
13178 of TREE_TYPE of their main variants.
13179 - aggregates may have new TYPE_FIELDS list that list variants of
13180 the main variant TYPE_FIELDS.
13181 - vector types may differ by TYPE_VECTOR_OPAQUE
13182 - TYPE_METHODS is always NULL for vairant types and maintained for
13186 /* Convenience macro for matching individual fields. */
13187 #define verify_variant_match(flag) \
13189 if (flag (tv) != flag (t)) \
13191 error ("type variant differs by " #flag "."); \
13197 /* tree_base checks. */
13199 verify_variant_match (TREE_CODE
);
13200 /* FIXME: Ada builds non-artificial variants of artificial types. */
13201 if (TYPE_ARTIFICIAL (tv
) && 0)
13202 verify_variant_match (TYPE_ARTIFICIAL
);
13203 if (POINTER_TYPE_P (tv
))
13204 verify_variant_match (TYPE_REF_CAN_ALIAS_ALL
);
13205 /* FIXME: TYPE_SIZES_GIMPLIFIED may differs for Ada build. */
13206 verify_variant_match (TYPE_UNSIGNED
);
13207 verify_variant_match (TYPE_ALIGN_OK
);
13208 verify_variant_match (TYPE_PACKED
);
13209 if (TREE_CODE (t
) == REFERENCE_TYPE
)
13210 verify_variant_match (TYPE_REF_IS_RVALUE
);
13211 if (AGGREGATE_TYPE_P (t
))
13212 verify_variant_match (TYPE_REVERSE_STORAGE_ORDER
);
13214 verify_variant_match (TYPE_SATURATING
);
13215 /* FIXME: This check trigger during libstdc++ build. */
13216 if (RECORD_OR_UNION_TYPE_P (t
) && COMPLETE_TYPE_P (t
) && 0)
13217 verify_variant_match (TYPE_FINAL_P
);
13219 /* tree_type_common checks. */
13221 if (COMPLETE_TYPE_P (t
))
13223 verify_variant_match (TYPE_MODE
);
13224 if (TREE_CODE (TYPE_SIZE (t
)) != PLACEHOLDER_EXPR
13225 && TREE_CODE (TYPE_SIZE (tv
)) != PLACEHOLDER_EXPR
)
13226 verify_variant_match (TYPE_SIZE
);
13227 if (TREE_CODE (TYPE_SIZE_UNIT (t
)) != PLACEHOLDER_EXPR
13228 && TREE_CODE (TYPE_SIZE_UNIT (tv
)) != PLACEHOLDER_EXPR
13229 && TYPE_SIZE_UNIT (t
) != TYPE_SIZE_UNIT (tv
)
13230 /* FIXME: ideally we should compare pointer equality, but java FE
13231 produce variants where size is INTEGER_CST of different type (int
13232 wrt size_type) during libjava biuld. */
13233 && !operand_equal_p (TYPE_SIZE_UNIT (t
), TYPE_SIZE_UNIT (tv
), 0))
13235 error ("type variant has different TYPE_SIZE_UNIT");
13237 error ("type variant's TYPE_SIZE_UNIT");
13238 debug_tree (TYPE_SIZE_UNIT (tv
));
13239 error ("type's TYPE_SIZE_UNIT");
13240 debug_tree (TYPE_SIZE_UNIT (t
));
13244 verify_variant_match (TYPE_PRECISION
);
13245 verify_variant_match (TYPE_NEEDS_CONSTRUCTING
);
13246 if (RECORD_OR_UNION_TYPE_P (t
))
13247 verify_variant_match (TYPE_TRANSPARENT_AGGR
);
13248 else if (TREE_CODE (t
) == ARRAY_TYPE
)
13249 verify_variant_match (TYPE_NONALIASED_COMPONENT
);
13250 /* During LTO we merge variant lists from diferent translation units
13251 that may differ BY TYPE_CONTEXT that in turn may point
13252 to TRANSLATION_UNIT_DECL.
13253 Ada also builds variants of types with different TYPE_CONTEXT. */
13254 if ((!in_lto_p
|| !TYPE_FILE_SCOPE_P (t
)) && 0)
13255 verify_variant_match (TYPE_CONTEXT
);
13256 verify_variant_match (TYPE_STRING_FLAG
);
13257 if (TYPE_ALIAS_SET_KNOWN_P (t
))
13259 error ("type variant with TYPE_ALIAS_SET_KNOWN_P");
13264 /* tree_type_non_common checks. */
13266 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
13267 and dangle the pointer from time to time. */
13268 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_VFIELD (t
) != TYPE_VFIELD (tv
)
13269 && (in_lto_p
|| !TYPE_VFIELD (tv
)
13270 || TREE_CODE (TYPE_VFIELD (tv
)) != TREE_LIST
))
13272 error ("type variant has different TYPE_VFIELD");
13276 if ((TREE_CODE (t
) == ENUMERAL_TYPE
&& COMPLETE_TYPE_P (t
))
13277 || TREE_CODE (t
) == INTEGER_TYPE
13278 || TREE_CODE (t
) == BOOLEAN_TYPE
13279 || TREE_CODE (t
) == REAL_TYPE
13280 || TREE_CODE (t
) == FIXED_POINT_TYPE
)
13282 verify_variant_match (TYPE_MAX_VALUE
);
13283 verify_variant_match (TYPE_MIN_VALUE
);
13285 if (TREE_CODE (t
) == METHOD_TYPE
)
13286 verify_variant_match (TYPE_METHOD_BASETYPE
);
13287 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_METHODS (t
))
13289 error ("type variant has TYPE_METHODS");
13293 if (TREE_CODE (t
) == OFFSET_TYPE
)
13294 verify_variant_match (TYPE_OFFSET_BASETYPE
);
13295 if (TREE_CODE (t
) == ARRAY_TYPE
)
13296 verify_variant_match (TYPE_ARRAY_MAX_SIZE
);
13297 /* FIXME: Be lax and allow TYPE_BINFO to be missing in variant types
13298 or even type's main variant. This is needed to make bootstrap pass
13299 and the bug seems new in GCC 5.
13300 C++ FE should be updated to make this consistent and we should check
13301 that TYPE_BINFO is always NULL for !COMPLETE_TYPE_P and otherwise there
13302 is a match with main variant.
13304 Also disable the check for Java for now because of parser hack that builds
13305 first an dummy BINFO and then sometimes replace it by real BINFO in some
13307 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_BINFO (t
) && TYPE_BINFO (tv
)
13308 && TYPE_BINFO (t
) != TYPE_BINFO (tv
)
13309 /* FIXME: Java sometimes keep dump TYPE_BINFOs on variant types.
13310 Since there is no cheap way to tell C++/Java type w/o LTO, do checking
13311 at LTO time only. */
13312 && (in_lto_p
&& odr_type_p (t
)))
13314 error ("type variant has different TYPE_BINFO");
13316 error ("type variant's TYPE_BINFO");
13317 debug_tree (TYPE_BINFO (tv
));
13318 error ("type's TYPE_BINFO");
13319 debug_tree (TYPE_BINFO (t
));
13323 /* Check various uses of TYPE_VALUES_RAW. */
13324 if (TREE_CODE (t
) == ENUMERAL_TYPE
)
13325 verify_variant_match (TYPE_VALUES
);
13326 else if (TREE_CODE (t
) == ARRAY_TYPE
)
13327 verify_variant_match (TYPE_DOMAIN
);
13328 /* Permit incomplete variants of complete type. While FEs may complete
13329 all variants, this does not happen for C++ templates in all cases. */
13330 else if (RECORD_OR_UNION_TYPE_P (t
)
13331 && COMPLETE_TYPE_P (t
)
13332 && TYPE_FIELDS (t
) != TYPE_FIELDS (tv
))
13336 /* Fortran builds qualified variants as new records with items of
13337 qualified type. Verify that they looks same. */
13338 for (f1
= TYPE_FIELDS (t
), f2
= TYPE_FIELDS (tv
);
13340 f1
= TREE_CHAIN (f1
), f2
= TREE_CHAIN (f2
))
13341 if (TREE_CODE (f1
) != FIELD_DECL
|| TREE_CODE (f2
) != FIELD_DECL
13342 || (TYPE_MAIN_VARIANT (TREE_TYPE (f1
))
13343 != TYPE_MAIN_VARIANT (TREE_TYPE (f2
))
13344 /* FIXME: gfc_nonrestricted_type builds all types as variants
13345 with exception of pointer types. It deeply copies the type
13346 which means that we may end up with a variant type
13347 referring non-variant pointer. We may change it to
13348 produce types as variants, too, like
13349 objc_get_protocol_qualified_type does. */
13350 && !POINTER_TYPE_P (TREE_TYPE (f1
)))
13351 || DECL_FIELD_OFFSET (f1
) != DECL_FIELD_OFFSET (f2
)
13352 || DECL_FIELD_BIT_OFFSET (f1
) != DECL_FIELD_BIT_OFFSET (f2
))
13356 error ("type variant has different TYPE_FIELDS");
13358 error ("first mismatch is field");
13360 error ("and field");
13365 else if ((TREE_CODE (t
) == FUNCTION_TYPE
|| TREE_CODE (t
) == METHOD_TYPE
))
13366 verify_variant_match (TYPE_ARG_TYPES
);
13367 /* For C++ the qualified variant of array type is really an array type
13368 of qualified TREE_TYPE.
13369 objc builds variants of pointer where pointer to type is a variant, too
13370 in objc_get_protocol_qualified_type. */
13371 if (TREE_TYPE (t
) != TREE_TYPE (tv
)
13372 && ((TREE_CODE (t
) != ARRAY_TYPE
13373 && !POINTER_TYPE_P (t
))
13374 || TYPE_MAIN_VARIANT (TREE_TYPE (t
))
13375 != TYPE_MAIN_VARIANT (TREE_TYPE (tv
))))
13377 error ("type variant has different TREE_TYPE");
13379 error ("type variant's TREE_TYPE");
13380 debug_tree (TREE_TYPE (tv
));
13381 error ("type's TREE_TYPE");
13382 debug_tree (TREE_TYPE (t
));
13385 if (type_with_alias_set_p (t
)
13386 && !gimple_canonical_types_compatible_p (t
, tv
, false))
13388 error ("type is not compatible with its vairant");
13390 error ("type variant's TREE_TYPE");
13391 debug_tree (TREE_TYPE (tv
));
13392 error ("type's TREE_TYPE");
13393 debug_tree (TREE_TYPE (t
));
13397 #undef verify_variant_match
13401 /* The TYPE_CANONICAL merging machinery. It should closely resemble
13402 the middle-end types_compatible_p function. It needs to avoid
13403 claiming types are different for types that should be treated
13404 the same with respect to TBAA. Canonical types are also used
13405 for IL consistency checks via the useless_type_conversion_p
13406 predicate which does not handle all type kinds itself but falls
13407 back to pointer-comparison of TYPE_CANONICAL for aggregates
13410 /* Return true if TYPE_UNSIGNED of TYPE should be ignored for canonical
13411 type calculation because we need to allow inter-operability between signed
13412 and unsigned variants. */
13415 type_with_interoperable_signedness (const_tree type
)
13417 /* Fortran standard require C_SIGNED_CHAR to be interoperable with both
13418 signed char and unsigned char. Similarly fortran FE builds
13419 C_SIZE_T as signed type, while C defines it unsigned. */
13421 return tree_code_for_canonical_type_merging (TREE_CODE (type
))
13423 && (TYPE_PRECISION (type
) == TYPE_PRECISION (signed_char_type_node
)
13424 || TYPE_PRECISION (type
) == TYPE_PRECISION (size_type_node
));
13427 /* Return true iff T1 and T2 are structurally identical for what
13429 This function is used both by lto.c canonical type merging and by the
13430 verifier. If TRUST_TYPE_CANONICAL we do not look into structure of types
13431 that have TYPE_CANONICAL defined and assume them equivalent. This is useful
13432 only for LTO because only in these cases TYPE_CANONICAL equivalence
13433 correspond to one defined by gimple_canonical_types_compatible_p. */
13436 gimple_canonical_types_compatible_p (const_tree t1
, const_tree t2
,
13437 bool trust_type_canonical
)
13439 /* Type variants should be same as the main variant. When not doing sanity
13440 checking to verify this fact, go to main variants and save some work. */
13441 if (trust_type_canonical
)
13443 t1
= TYPE_MAIN_VARIANT (t1
);
13444 t2
= TYPE_MAIN_VARIANT (t2
);
13447 /* Check first for the obvious case of pointer identity. */
13451 /* Check that we have two types to compare. */
13452 if (t1
== NULL_TREE
|| t2
== NULL_TREE
)
13455 /* We consider complete types always compatible with incomplete type.
13456 This does not make sense for canonical type calculation and thus we
13457 need to ensure that we are never called on it.
13459 FIXME: For more correctness the function probably should have three modes
13460 1) mode assuming that types are complete mathcing their structure
13461 2) mode allowing incomplete types but producing equivalence classes
13462 and thus ignoring all info from complete types
13463 3) mode allowing incomplete types to match complete but checking
13464 compatibility between complete types.
13466 1 and 2 can be used for canonical type calculation. 3 is the real
13467 definition of type compatibility that can be used i.e. for warnings during
13468 declaration merging. */
13470 gcc_assert (!trust_type_canonical
13471 || (type_with_alias_set_p (t1
) && type_with_alias_set_p (t2
)));
13472 /* If the types have been previously registered and found equal
13475 if (TYPE_CANONICAL (t1
) && TYPE_CANONICAL (t2
)
13476 && trust_type_canonical
)
13478 /* Do not use TYPE_CANONICAL of pointer types. For LTO streamed types
13479 they are always NULL, but they are set to non-NULL for types
13480 constructed by build_pointer_type and variants. In this case the
13481 TYPE_CANONICAL is more fine grained than the equivalnce we test (where
13482 all pointers are considered equal. Be sure to not return false
13484 gcc_checking_assert (canonical_type_used_p (t1
)
13485 && canonical_type_used_p (t2
));
13486 return TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
);
13489 /* Can't be the same type if the types don't have the same code. */
13490 enum tree_code code
= tree_code_for_canonical_type_merging (TREE_CODE (t1
));
13491 if (code
!= tree_code_for_canonical_type_merging (TREE_CODE (t2
)))
13494 /* Qualifiers do not matter for canonical type comparison purposes. */
13496 /* Void types and nullptr types are always the same. */
13497 if (TREE_CODE (t1
) == VOID_TYPE
13498 || TREE_CODE (t1
) == NULLPTR_TYPE
)
13501 /* Can't be the same type if they have different mode. */
13502 if (TYPE_MODE (t1
) != TYPE_MODE (t2
))
13505 /* Non-aggregate types can be handled cheaply. */
13506 if (INTEGRAL_TYPE_P (t1
)
13507 || SCALAR_FLOAT_TYPE_P (t1
)
13508 || FIXED_POINT_TYPE_P (t1
)
13509 || TREE_CODE (t1
) == VECTOR_TYPE
13510 || TREE_CODE (t1
) == COMPLEX_TYPE
13511 || TREE_CODE (t1
) == OFFSET_TYPE
13512 || POINTER_TYPE_P (t1
))
13514 /* Can't be the same type if they have different recision. */
13515 if (TYPE_PRECISION (t1
) != TYPE_PRECISION (t2
))
13518 /* In some cases the signed and unsigned types are required to be
13520 if (TYPE_UNSIGNED (t1
) != TYPE_UNSIGNED (t2
)
13521 && !type_with_interoperable_signedness (t1
))
13524 /* Fortran's C_SIGNED_CHAR is !TYPE_STRING_FLAG but needs to be
13525 interoperable with "signed char". Unless all frontends are revisited
13526 to agree on these types, we must ignore the flag completely. */
13528 /* Fortran standard define C_PTR type that is compatible with every
13529 C pointer. For this reason we need to glob all pointers into one.
13530 Still pointers in different address spaces are not compatible. */
13531 if (POINTER_TYPE_P (t1
))
13533 if (TYPE_ADDR_SPACE (TREE_TYPE (t1
))
13534 != TYPE_ADDR_SPACE (TREE_TYPE (t2
)))
13538 /* Tail-recurse to components. */
13539 if (TREE_CODE (t1
) == VECTOR_TYPE
13540 || TREE_CODE (t1
) == COMPLEX_TYPE
)
13541 return gimple_canonical_types_compatible_p (TREE_TYPE (t1
),
13543 trust_type_canonical
);
13548 /* Do type-specific comparisons. */
13549 switch (TREE_CODE (t1
))
13552 /* Array types are the same if the element types are the same and
13553 the number of elements are the same. */
13554 if (!gimple_canonical_types_compatible_p (TREE_TYPE (t1
), TREE_TYPE (t2
),
13555 trust_type_canonical
)
13556 || TYPE_STRING_FLAG (t1
) != TYPE_STRING_FLAG (t2
)
13557 || TYPE_REVERSE_STORAGE_ORDER (t1
) != TYPE_REVERSE_STORAGE_ORDER (t2
)
13558 || TYPE_NONALIASED_COMPONENT (t1
) != TYPE_NONALIASED_COMPONENT (t2
))
13562 tree i1
= TYPE_DOMAIN (t1
);
13563 tree i2
= TYPE_DOMAIN (t2
);
13565 /* For an incomplete external array, the type domain can be
13566 NULL_TREE. Check this condition also. */
13567 if (i1
== NULL_TREE
&& i2
== NULL_TREE
)
13569 else if (i1
== NULL_TREE
|| i2
== NULL_TREE
)
13573 tree min1
= TYPE_MIN_VALUE (i1
);
13574 tree min2
= TYPE_MIN_VALUE (i2
);
13575 tree max1
= TYPE_MAX_VALUE (i1
);
13576 tree max2
= TYPE_MAX_VALUE (i2
);
13578 /* The minimum/maximum values have to be the same. */
13581 && ((TREE_CODE (min1
) == PLACEHOLDER_EXPR
13582 && TREE_CODE (min2
) == PLACEHOLDER_EXPR
)
13583 || operand_equal_p (min1
, min2
, 0))))
13586 && ((TREE_CODE (max1
) == PLACEHOLDER_EXPR
13587 && TREE_CODE (max2
) == PLACEHOLDER_EXPR
)
13588 || operand_equal_p (max1
, max2
, 0)))))
13596 case FUNCTION_TYPE
:
13597 /* Function types are the same if the return type and arguments types
13599 if (!gimple_canonical_types_compatible_p (TREE_TYPE (t1
), TREE_TYPE (t2
),
13600 trust_type_canonical
))
13603 if (TYPE_ARG_TYPES (t1
) == TYPE_ARG_TYPES (t2
))
13607 tree parms1
, parms2
;
13609 for (parms1
= TYPE_ARG_TYPES (t1
), parms2
= TYPE_ARG_TYPES (t2
);
13611 parms1
= TREE_CHAIN (parms1
), parms2
= TREE_CHAIN (parms2
))
13613 if (!gimple_canonical_types_compatible_p
13614 (TREE_VALUE (parms1
), TREE_VALUE (parms2
),
13615 trust_type_canonical
))
13619 if (parms1
|| parms2
)
13627 case QUAL_UNION_TYPE
:
13631 /* Don't try to compare variants of an incomplete type, before
13632 TYPE_FIELDS has been copied around. */
13633 if (!COMPLETE_TYPE_P (t1
) && !COMPLETE_TYPE_P (t2
))
13637 if (TYPE_REVERSE_STORAGE_ORDER (t1
) != TYPE_REVERSE_STORAGE_ORDER (t2
))
13640 /* For aggregate types, all the fields must be the same. */
13641 for (f1
= TYPE_FIELDS (t1
), f2
= TYPE_FIELDS (t2
);
13643 f1
= TREE_CHAIN (f1
), f2
= TREE_CHAIN (f2
))
13645 /* Skip non-fields. */
13646 while (f1
&& TREE_CODE (f1
) != FIELD_DECL
)
13647 f1
= TREE_CHAIN (f1
);
13648 while (f2
&& TREE_CODE (f2
) != FIELD_DECL
)
13649 f2
= TREE_CHAIN (f2
);
13652 /* The fields must have the same name, offset and type. */
13653 if (DECL_NONADDRESSABLE_P (f1
) != DECL_NONADDRESSABLE_P (f2
)
13654 || !gimple_compare_field_offset (f1
, f2
)
13655 || !gimple_canonical_types_compatible_p
13656 (TREE_TYPE (f1
), TREE_TYPE (f2
),
13657 trust_type_canonical
))
13661 /* If one aggregate has more fields than the other, they
13662 are not the same. */
13670 /* Consider all types with language specific trees in them mutually
13671 compatible. This is executed only from verify_type and false
13672 positives can be tolerated. */
13673 gcc_assert (!in_lto_p
);
13678 /* Verify type T. */
13681 verify_type (const_tree t
)
13683 bool error_found
= false;
13684 tree mv
= TYPE_MAIN_VARIANT (t
);
13687 error ("Main variant is not defined");
13688 error_found
= true;
13690 else if (mv
!= TYPE_MAIN_VARIANT (mv
))
13692 error ("TYPE_MAIN_VARIANT has different TYPE_MAIN_VARIANT");
13694 error_found
= true;
13696 else if (t
!= mv
&& !verify_type_variant (t
, mv
))
13697 error_found
= true;
13699 tree ct
= TYPE_CANONICAL (t
);
13702 else if (TYPE_CANONICAL (t
) != ct
)
13704 error ("TYPE_CANONICAL has different TYPE_CANONICAL");
13706 error_found
= true;
13708 /* Method and function types can not be used to address memory and thus
13709 TYPE_CANONICAL really matters only for determining useless conversions.
13711 FIXME: C++ FE produce declarations of builtin functions that are not
13712 compatible with main variants. */
13713 else if (TREE_CODE (t
) == FUNCTION_TYPE
)
13716 /* FIXME: gimple_canonical_types_compatible_p can not compare types
13717 with variably sized arrays because their sizes possibly
13718 gimplified to different variables. */
13719 && !variably_modified_type_p (ct
, NULL
)
13720 && !gimple_canonical_types_compatible_p (t
, ct
, false))
13722 error ("TYPE_CANONICAL is not compatible");
13724 error_found
= true;
13727 if (COMPLETE_TYPE_P (t
) && TYPE_CANONICAL (t
)
13728 && TYPE_MODE (t
) != TYPE_MODE (TYPE_CANONICAL (t
)))
13730 error ("TYPE_MODE of TYPE_CANONICAL is not compatible");
13732 error_found
= true;
13734 /* FIXME: this is violated by the C++ FE as discussed in PR70029, when
13735 FUNCTION_*_QUALIFIED flags are set. */
13736 if (0 && TYPE_MAIN_VARIANT (t
) == t
&& ct
&& TYPE_MAIN_VARIANT (ct
) != ct
)
13738 error ("TYPE_CANONICAL of main variant is not main variant");
13740 debug_tree (TYPE_MAIN_VARIANT (ct
));
13741 error_found
= true;
13745 /* Check various uses of TYPE_MINVAL. */
13746 if (RECORD_OR_UNION_TYPE_P (t
))
13748 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
13749 and danagle the pointer from time to time. */
13750 if (TYPE_VFIELD (t
)
13751 && TREE_CODE (TYPE_VFIELD (t
)) != FIELD_DECL
13752 && TREE_CODE (TYPE_VFIELD (t
)) != TREE_LIST
)
13754 error ("TYPE_VFIELD is not FIELD_DECL nor TREE_LIST");
13755 debug_tree (TYPE_VFIELD (t
));
13756 error_found
= true;
13759 else if (TREE_CODE (t
) == POINTER_TYPE
)
13761 if (TYPE_NEXT_PTR_TO (t
)
13762 && TREE_CODE (TYPE_NEXT_PTR_TO (t
)) != POINTER_TYPE
)
13764 error ("TYPE_NEXT_PTR_TO is not POINTER_TYPE");
13765 debug_tree (TYPE_NEXT_PTR_TO (t
));
13766 error_found
= true;
13769 else if (TREE_CODE (t
) == REFERENCE_TYPE
)
13771 if (TYPE_NEXT_REF_TO (t
)
13772 && TREE_CODE (TYPE_NEXT_REF_TO (t
)) != REFERENCE_TYPE
)
13774 error ("TYPE_NEXT_REF_TO is not REFERENCE_TYPE");
13775 debug_tree (TYPE_NEXT_REF_TO (t
));
13776 error_found
= true;
13779 else if (INTEGRAL_TYPE_P (t
) || TREE_CODE (t
) == REAL_TYPE
13780 || TREE_CODE (t
) == FIXED_POINT_TYPE
)
13782 /* FIXME: The following check should pass:
13783 useless_type_conversion_p (const_cast <tree> (t),
13784 TREE_TYPE (TYPE_MIN_VALUE (t))
13785 but does not for C sizetypes in LTO. */
13787 /* Java uses TYPE_MINVAL for TYPE_ARGUMENT_SIGNATURE. */
13788 else if (TYPE_MINVAL (t
)
13789 && ((TREE_CODE (t
) != METHOD_TYPE
&& TREE_CODE (t
) != FUNCTION_TYPE
)
13792 error ("TYPE_MINVAL non-NULL");
13793 debug_tree (TYPE_MINVAL (t
));
13794 error_found
= true;
13797 /* Check various uses of TYPE_MAXVAL. */
13798 if (RECORD_OR_UNION_TYPE_P (t
))
13800 if (TYPE_METHODS (t
) && TREE_CODE (TYPE_METHODS (t
)) != FUNCTION_DECL
13801 && TREE_CODE (TYPE_METHODS (t
)) != TEMPLATE_DECL
13802 && TYPE_METHODS (t
) != error_mark_node
)
13804 error ("TYPE_METHODS is not FUNCTION_DECL, TEMPLATE_DECL nor error_mark_node");
13805 debug_tree (TYPE_METHODS (t
));
13806 error_found
= true;
13809 else if (TREE_CODE (t
) == FUNCTION_TYPE
|| TREE_CODE (t
) == METHOD_TYPE
)
13811 if (TYPE_METHOD_BASETYPE (t
)
13812 && TREE_CODE (TYPE_METHOD_BASETYPE (t
)) != RECORD_TYPE
13813 && TREE_CODE (TYPE_METHOD_BASETYPE (t
)) != UNION_TYPE
)
13815 error ("TYPE_METHOD_BASETYPE is not record nor union");
13816 debug_tree (TYPE_METHOD_BASETYPE (t
));
13817 error_found
= true;
13820 else if (TREE_CODE (t
) == OFFSET_TYPE
)
13822 if (TYPE_OFFSET_BASETYPE (t
)
13823 && TREE_CODE (TYPE_OFFSET_BASETYPE (t
)) != RECORD_TYPE
13824 && TREE_CODE (TYPE_OFFSET_BASETYPE (t
)) != UNION_TYPE
)
13826 error ("TYPE_OFFSET_BASETYPE is not record nor union");
13827 debug_tree (TYPE_OFFSET_BASETYPE (t
));
13828 error_found
= true;
13831 else if (INTEGRAL_TYPE_P (t
) || TREE_CODE (t
) == REAL_TYPE
13832 || TREE_CODE (t
) == FIXED_POINT_TYPE
)
13834 /* FIXME: The following check should pass:
13835 useless_type_conversion_p (const_cast <tree> (t),
13836 TREE_TYPE (TYPE_MAX_VALUE (t))
13837 but does not for C sizetypes in LTO. */
13839 else if (TREE_CODE (t
) == ARRAY_TYPE
)
13841 if (TYPE_ARRAY_MAX_SIZE (t
)
13842 && TREE_CODE (TYPE_ARRAY_MAX_SIZE (t
)) != INTEGER_CST
)
13844 error ("TYPE_ARRAY_MAX_SIZE not INTEGER_CST");
13845 debug_tree (TYPE_ARRAY_MAX_SIZE (t
));
13846 error_found
= true;
13849 else if (TYPE_MAXVAL (t
))
13851 error ("TYPE_MAXVAL non-NULL");
13852 debug_tree (TYPE_MAXVAL (t
));
13853 error_found
= true;
13856 /* Check various uses of TYPE_BINFO. */
13857 if (RECORD_OR_UNION_TYPE_P (t
))
13859 if (!TYPE_BINFO (t
))
13861 else if (TREE_CODE (TYPE_BINFO (t
)) != TREE_BINFO
)
13863 error ("TYPE_BINFO is not TREE_BINFO");
13864 debug_tree (TYPE_BINFO (t
));
13865 error_found
= true;
13867 /* FIXME: Java builds invalid empty binfos that do not have
13869 else if (TREE_TYPE (TYPE_BINFO (t
)) != TYPE_MAIN_VARIANT (t
) && 0)
13871 error ("TYPE_BINFO type is not TYPE_MAIN_VARIANT");
13872 debug_tree (TREE_TYPE (TYPE_BINFO (t
)));
13873 error_found
= true;
13876 else if (TYPE_LANG_SLOT_1 (t
) && in_lto_p
)
13878 error ("TYPE_LANG_SLOT_1 (binfo) field is non-NULL");
13879 debug_tree (TYPE_LANG_SLOT_1 (t
));
13880 error_found
= true;
13883 /* Check various uses of TYPE_VALUES_RAW. */
13884 if (TREE_CODE (t
) == ENUMERAL_TYPE
)
13885 for (tree l
= TYPE_VALUES (t
); l
; l
= TREE_CHAIN (l
))
13887 tree value
= TREE_VALUE (l
);
13888 tree name
= TREE_PURPOSE (l
);
13890 /* C FE porduce INTEGER_CST of INTEGER_TYPE, while C++ FE uses
13891 CONST_DECL of ENUMERAL TYPE. */
13892 if (TREE_CODE (value
) != INTEGER_CST
&& TREE_CODE (value
) != CONST_DECL
)
13894 error ("Enum value is not CONST_DECL or INTEGER_CST");
13895 debug_tree (value
);
13897 error_found
= true;
13899 if (TREE_CODE (TREE_TYPE (value
)) != INTEGER_TYPE
13900 && !useless_type_conversion_p (const_cast <tree
> (t
), TREE_TYPE (value
)))
13902 error ("Enum value type is not INTEGER_TYPE nor convertible to the enum");
13903 debug_tree (value
);
13905 error_found
= true;
13907 if (TREE_CODE (name
) != IDENTIFIER_NODE
)
13909 error ("Enum value name is not IDENTIFIER_NODE");
13910 debug_tree (value
);
13912 error_found
= true;
13915 else if (TREE_CODE (t
) == ARRAY_TYPE
)
13917 if (TYPE_DOMAIN (t
) && TREE_CODE (TYPE_DOMAIN (t
)) != INTEGER_TYPE
)
13919 error ("Array TYPE_DOMAIN is not integer type");
13920 debug_tree (TYPE_DOMAIN (t
));
13921 error_found
= true;
13924 else if (RECORD_OR_UNION_TYPE_P (t
))
13926 if (TYPE_FIELDS (t
) && !COMPLETE_TYPE_P (t
) && in_lto_p
)
13928 error ("TYPE_FIELDS defined in incomplete type");
13929 error_found
= true;
13931 for (tree fld
= TYPE_FIELDS (t
); fld
; fld
= TREE_CHAIN (fld
))
13933 /* TODO: verify properties of decls. */
13934 if (TREE_CODE (fld
) == FIELD_DECL
)
13936 else if (TREE_CODE (fld
) == TYPE_DECL
)
13938 else if (TREE_CODE (fld
) == CONST_DECL
)
13940 else if (TREE_CODE (fld
) == VAR_DECL
)
13942 else if (TREE_CODE (fld
) == TEMPLATE_DECL
)
13944 else if (TREE_CODE (fld
) == USING_DECL
)
13948 error ("Wrong tree in TYPE_FIELDS list");
13950 error_found
= true;
13954 else if (TREE_CODE (t
) == INTEGER_TYPE
13955 || TREE_CODE (t
) == BOOLEAN_TYPE
13956 || TREE_CODE (t
) == OFFSET_TYPE
13957 || TREE_CODE (t
) == REFERENCE_TYPE
13958 || TREE_CODE (t
) == NULLPTR_TYPE
13959 || TREE_CODE (t
) == POINTER_TYPE
)
13961 if (TYPE_CACHED_VALUES_P (t
) != (TYPE_CACHED_VALUES (t
) != NULL
))
13963 error ("TYPE_CACHED_VALUES_P is %i while TYPE_CACHED_VALUES is %p",
13964 TYPE_CACHED_VALUES_P (t
), (void *)TYPE_CACHED_VALUES (t
));
13965 error_found
= true;
13967 else if (TYPE_CACHED_VALUES_P (t
) && TREE_CODE (TYPE_CACHED_VALUES (t
)) != TREE_VEC
)
13969 error ("TYPE_CACHED_VALUES is not TREE_VEC");
13970 debug_tree (TYPE_CACHED_VALUES (t
));
13971 error_found
= true;
13973 /* Verify just enough of cache to ensure that no one copied it to new type.
13974 All copying should go by copy_node that should clear it. */
13975 else if (TYPE_CACHED_VALUES_P (t
))
13978 for (i
= 0; i
< TREE_VEC_LENGTH (TYPE_CACHED_VALUES (t
)); i
++)
13979 if (TREE_VEC_ELT (TYPE_CACHED_VALUES (t
), i
)
13980 && TREE_TYPE (TREE_VEC_ELT (TYPE_CACHED_VALUES (t
), i
)) != t
)
13982 error ("wrong TYPE_CACHED_VALUES entry");
13983 debug_tree (TREE_VEC_ELT (TYPE_CACHED_VALUES (t
), i
));
13984 error_found
= true;
13989 else if (TREE_CODE (t
) == FUNCTION_TYPE
|| TREE_CODE (t
) == METHOD_TYPE
)
13990 for (tree l
= TYPE_ARG_TYPES (t
); l
; l
= TREE_CHAIN (l
))
13992 /* C++ FE uses TREE_PURPOSE to store initial values. */
13993 if (TREE_PURPOSE (l
) && in_lto_p
)
13995 error ("TREE_PURPOSE is non-NULL in TYPE_ARG_TYPES list");
13997 error_found
= true;
13999 if (!TYPE_P (TREE_VALUE (l
)))
14001 error ("Wrong entry in TYPE_ARG_TYPES list");
14003 error_found
= true;
14006 else if (!is_lang_specific (t
) && TYPE_VALUES_RAW (t
))
14008 error ("TYPE_VALUES_RAW field is non-NULL");
14009 debug_tree (TYPE_VALUES_RAW (t
));
14010 error_found
= true;
14012 if (TREE_CODE (t
) != INTEGER_TYPE
14013 && TREE_CODE (t
) != BOOLEAN_TYPE
14014 && TREE_CODE (t
) != OFFSET_TYPE
14015 && TREE_CODE (t
) != REFERENCE_TYPE
14016 && TREE_CODE (t
) != NULLPTR_TYPE
14017 && TREE_CODE (t
) != POINTER_TYPE
14018 && TYPE_CACHED_VALUES_P (t
))
14020 error ("TYPE_CACHED_VALUES_P is set while it should not");
14021 error_found
= true;
14023 if (TYPE_STRING_FLAG (t
)
14024 && TREE_CODE (t
) != ARRAY_TYPE
&& TREE_CODE (t
) != INTEGER_TYPE
)
14026 error ("TYPE_STRING_FLAG is set on wrong type code");
14027 error_found
= true;
14029 else if (TYPE_STRING_FLAG (t
))
14032 if (TREE_CODE (b
) == ARRAY_TYPE
)
14034 /* Java builds arrays with TYPE_STRING_FLAG of promoted_char_type
14036 if (TREE_CODE (b
) != INTEGER_TYPE
)
14038 error ("TYPE_STRING_FLAG is set on type that does not look like "
14039 "char nor array of chars");
14040 error_found
= true;
14044 /* ipa-devirt makes an assumption that TYPE_METHOD_BASETYPE is always
14045 TYPE_MAIN_VARIANT and it would be odd to add methods only to variatns
14047 if (TREE_CODE (t
) == METHOD_TYPE
14048 && TYPE_MAIN_VARIANT (TYPE_METHOD_BASETYPE (t
)) != TYPE_METHOD_BASETYPE (t
))
14050 error ("TYPE_METHOD_BASETYPE is not main variant");
14051 error_found
= true;
14056 debug_tree (const_cast <tree
> (t
));
14057 internal_error ("verify_type failed");
14062 /* Return true if ARG is marked with the nonnull attribute in the
14063 current function signature. */
14066 nonnull_arg_p (const_tree arg
)
14068 tree t
, attrs
, fntype
;
14069 unsigned HOST_WIDE_INT arg_num
;
14071 gcc_assert (TREE_CODE (arg
) == PARM_DECL
14072 && (POINTER_TYPE_P (TREE_TYPE (arg
))
14073 || TREE_CODE (TREE_TYPE (arg
)) == OFFSET_TYPE
));
14075 /* The static chain decl is always non null. */
14076 if (arg
== cfun
->static_chain_decl
)
14079 /* THIS argument of method is always non-NULL. */
14080 if (TREE_CODE (TREE_TYPE (cfun
->decl
)) == METHOD_TYPE
14081 && arg
== DECL_ARGUMENTS (cfun
->decl
)
14082 && flag_delete_null_pointer_checks
)
14085 /* Values passed by reference are always non-NULL. */
14086 if (TREE_CODE (TREE_TYPE (arg
)) == REFERENCE_TYPE
14087 && flag_delete_null_pointer_checks
)
14090 fntype
= TREE_TYPE (cfun
->decl
);
14091 for (attrs
= TYPE_ATTRIBUTES (fntype
); attrs
; attrs
= TREE_CHAIN (attrs
))
14093 attrs
= lookup_attribute ("nonnull", attrs
);
14095 /* If "nonnull" wasn't specified, we know nothing about the argument. */
14096 if (attrs
== NULL_TREE
)
14099 /* If "nonnull" applies to all the arguments, then ARG is non-null. */
14100 if (TREE_VALUE (attrs
) == NULL_TREE
)
14103 /* Get the position number for ARG in the function signature. */
14104 for (arg_num
= 1, t
= DECL_ARGUMENTS (cfun
->decl
);
14106 t
= DECL_CHAIN (t
), arg_num
++)
14112 gcc_assert (t
== arg
);
14114 /* Now see if ARG_NUM is mentioned in the nonnull list. */
14115 for (t
= TREE_VALUE (attrs
); t
; t
= TREE_CHAIN (t
))
14117 if (compare_tree_int (TREE_VALUE (t
), arg_num
) == 0)
14125 /* Given location LOC, strip away any packed range information
14126 or ad-hoc information. */
14129 get_pure_location (location_t loc
)
14131 if (IS_ADHOC_LOC (loc
))
14133 = line_table
->location_adhoc_data_map
.data
[loc
& MAX_SOURCE_LOCATION
].locus
;
14135 if (loc
>= LINEMAPS_MACRO_LOWEST_LOCATION (line_table
))
14138 if (loc
< RESERVED_LOCATION_COUNT
)
14141 const line_map
*map
= linemap_lookup (line_table
, loc
);
14142 const line_map_ordinary
*ordmap
= linemap_check_ordinary (map
);
14144 return loc
& ~((1 << ordmap
->m_range_bits
) - 1);
14147 /* Combine LOC and BLOCK to a combined adhoc loc, retaining any range
14151 set_block (location_t loc
, tree block
)
14153 location_t pure_loc
= get_pure_location (loc
);
14154 source_range src_range
= get_range_from_loc (line_table
, loc
);
14155 return COMBINE_LOCATION_DATA (line_table
, pure_loc
, src_range
, block
);
14159 set_source_range (tree expr
, location_t start
, location_t finish
)
14161 source_range src_range
;
14162 src_range
.m_start
= start
;
14163 src_range
.m_finish
= finish
;
14164 return set_source_range (expr
, src_range
);
14168 set_source_range (tree expr
, source_range src_range
)
14170 if (!EXPR_P (expr
))
14171 return UNKNOWN_LOCATION
;
14173 location_t pure_loc
= get_pure_location (EXPR_LOCATION (expr
));
14174 location_t adhoc
= COMBINE_LOCATION_DATA (line_table
,
14178 SET_EXPR_LOCATION (expr
, adhoc
);
14183 make_location (location_t caret
, location_t start
, location_t finish
)
14185 location_t pure_loc
= get_pure_location (caret
);
14186 source_range src_range
;
14187 src_range
.m_start
= start
;
14188 src_range
.m_finish
= finish
;
14189 location_t combined_loc
= COMBINE_LOCATION_DATA (line_table
,
14193 return combined_loc
;
14196 /* Return the name of combined function FN, for debugging purposes. */
14199 combined_fn_name (combined_fn fn
)
14201 if (builtin_fn_p (fn
))
14203 tree fndecl
= builtin_decl_explicit (as_builtin_fn (fn
));
14204 return IDENTIFIER_POINTER (DECL_NAME (fndecl
));
14207 return internal_fn_name (as_internal_fn (fn
));
14212 namespace selftest
{
14214 /* Selftests for tree. */
14216 /* Verify that integer constants are sane. */
14219 test_integer_constants ()
14221 ASSERT_TRUE (integer_type_node
!= NULL
);
14222 ASSERT_TRUE (build_int_cst (integer_type_node
, 0) != NULL
);
14224 tree type
= integer_type_node
;
14226 tree zero
= build_zero_cst (type
);
14227 ASSERT_EQ (INTEGER_CST
, TREE_CODE (zero
));
14228 ASSERT_EQ (type
, TREE_TYPE (zero
));
14230 tree one
= build_int_cst (type
, 1);
14231 ASSERT_EQ (INTEGER_CST
, TREE_CODE (one
));
14232 ASSERT_EQ (type
, TREE_TYPE (zero
));
14235 /* Verify identifiers. */
14238 test_identifiers ()
14240 tree identifier
= get_identifier ("foo");
14241 ASSERT_EQ (3, IDENTIFIER_LENGTH (identifier
));
14242 ASSERT_STREQ ("foo", IDENTIFIER_POINTER (identifier
));
14245 /* Verify LABEL_DECL. */
14250 tree identifier
= get_identifier ("err");
14251 tree label_decl
= build_decl (UNKNOWN_LOCATION
, LABEL_DECL
,
14252 identifier
, void_type_node
);
14253 ASSERT_EQ (-1, LABEL_DECL_UID (label_decl
));
14254 ASSERT_FALSE (FORCED_LABEL (label_decl
));
14257 /* Run all of the selftests within this file. */
14262 test_integer_constants ();
14263 test_identifiers ();
14267 } // namespace selftest
14269 #endif /* CHECKING_P */
14271 #include "gt-tree.h"