1 /* Language-independent node constructors for parse phase of GNU compiler.
2 Copyright (C) 1987-2017 Free Software Foundation, Inc.
4 This file is part of GCC.
6 GCC is free software; you can redistribute it and/or modify it under
7 the terms of the GNU General Public License as published by the Free
8 Software Foundation; either version 3, or (at your option) any later
11 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
12 WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
16 You should have received a copy of the GNU General Public License
17 along with GCC; see the file COPYING3. If not see
18 <http://www.gnu.org/licenses/>. */
20 /* This file contains the low level primitives for operating on tree nodes,
21 including allocation, list operations, interning of identifiers,
22 construction of data type nodes and statement nodes,
23 and construction of type conversion nodes. It also contains
24 tables index by tree code that describe how to take apart
27 It is intended to be language-independent but can occasionally
28 calls language-dependent routines. */
32 #include "coretypes.h"
37 #include "tree-pass.h"
40 #include "diagnostic.h"
43 #include "fold-const.h"
44 #include "stor-layout.h"
47 #include "toplev.h" /* get_random_seed */
49 #include "common/common-target.h"
50 #include "langhooks.h"
51 #include "tree-inline.h"
52 #include "tree-iterator.h"
53 #include "internal-fn.h"
54 #include "gimple-iterator.h"
58 #include "langhooks-def.h"
59 #include "tree-diagnostic.h"
62 #include "print-tree.h"
63 #include "ipa-utils.h"
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);
252 tree global_trees
[TI_MAX
];
253 tree integer_types
[itk_none
];
255 bool int_n_enabled_p
[NUM_INT_N_ENTS
];
256 struct int_n_trees_t int_n_trees
[NUM_INT_N_ENTS
];
258 unsigned char tree_contains_struct
[MAX_TREE_CODES
][64];
260 /* Number of operands for each OpenMP clause. */
261 unsigned const char omp_clause_num_ops
[] =
263 0, /* OMP_CLAUSE_ERROR */
264 1, /* OMP_CLAUSE_PRIVATE */
265 1, /* OMP_CLAUSE_SHARED */
266 1, /* OMP_CLAUSE_FIRSTPRIVATE */
267 2, /* OMP_CLAUSE_LASTPRIVATE */
268 5, /* OMP_CLAUSE_REDUCTION */
269 1, /* OMP_CLAUSE_COPYIN */
270 1, /* OMP_CLAUSE_COPYPRIVATE */
271 3, /* OMP_CLAUSE_LINEAR */
272 2, /* OMP_CLAUSE_ALIGNED */
273 1, /* OMP_CLAUSE_DEPEND */
274 1, /* OMP_CLAUSE_UNIFORM */
275 1, /* OMP_CLAUSE_TO_DECLARE */
276 1, /* OMP_CLAUSE_LINK */
277 2, /* OMP_CLAUSE_FROM */
278 2, /* OMP_CLAUSE_TO */
279 2, /* OMP_CLAUSE_MAP */
280 1, /* OMP_CLAUSE_USE_DEVICE_PTR */
281 1, /* OMP_CLAUSE_IS_DEVICE_PTR */
282 2, /* OMP_CLAUSE__CACHE_ */
283 2, /* OMP_CLAUSE_GANG */
284 1, /* OMP_CLAUSE_ASYNC */
285 1, /* OMP_CLAUSE_WAIT */
286 0, /* OMP_CLAUSE_AUTO */
287 0, /* OMP_CLAUSE_SEQ */
288 1, /* OMP_CLAUSE__LOOPTEMP_ */
289 1, /* OMP_CLAUSE_IF */
290 1, /* OMP_CLAUSE_NUM_THREADS */
291 1, /* OMP_CLAUSE_SCHEDULE */
292 0, /* OMP_CLAUSE_NOWAIT */
293 1, /* OMP_CLAUSE_ORDERED */
294 0, /* OMP_CLAUSE_DEFAULT */
295 3, /* OMP_CLAUSE_COLLAPSE */
296 0, /* OMP_CLAUSE_UNTIED */
297 1, /* OMP_CLAUSE_FINAL */
298 0, /* OMP_CLAUSE_MERGEABLE */
299 1, /* OMP_CLAUSE_DEVICE */
300 1, /* OMP_CLAUSE_DIST_SCHEDULE */
301 0, /* OMP_CLAUSE_INBRANCH */
302 0, /* OMP_CLAUSE_NOTINBRANCH */
303 1, /* OMP_CLAUSE_NUM_TEAMS */
304 1, /* OMP_CLAUSE_THREAD_LIMIT */
305 0, /* OMP_CLAUSE_PROC_BIND */
306 1, /* OMP_CLAUSE_SAFELEN */
307 1, /* OMP_CLAUSE_SIMDLEN */
308 0, /* OMP_CLAUSE_FOR */
309 0, /* OMP_CLAUSE_PARALLEL */
310 0, /* OMP_CLAUSE_SECTIONS */
311 0, /* OMP_CLAUSE_TASKGROUP */
312 1, /* OMP_CLAUSE_PRIORITY */
313 1, /* OMP_CLAUSE_GRAINSIZE */
314 1, /* OMP_CLAUSE_NUM_TASKS */
315 0, /* OMP_CLAUSE_NOGROUP */
316 0, /* OMP_CLAUSE_THREADS */
317 0, /* OMP_CLAUSE_SIMD */
318 1, /* OMP_CLAUSE_HINT */
319 0, /* OMP_CLAUSE_DEFALTMAP */
320 1, /* OMP_CLAUSE__SIMDUID_ */
321 0, /* OMP_CLAUSE__SIMT_ */
322 1, /* OMP_CLAUSE__CILK_FOR_COUNT_ */
323 0, /* OMP_CLAUSE_INDEPENDENT */
324 1, /* OMP_CLAUSE_WORKER */
325 1, /* OMP_CLAUSE_VECTOR */
326 1, /* OMP_CLAUSE_NUM_GANGS */
327 1, /* OMP_CLAUSE_NUM_WORKERS */
328 1, /* OMP_CLAUSE_VECTOR_LENGTH */
329 3, /* OMP_CLAUSE_TILE */
330 2, /* OMP_CLAUSE__GRIDDIM_ */
333 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. */
509 case TS_OPTIMIZATION
:
510 case TS_TARGET_OPTION
:
524 case TS_STATEMENT_LIST
:
525 MARK_TS_TYPED (code
);
529 case TS_DECL_MINIMAL
:
535 MARK_TS_COMMON (code
);
538 case TS_TYPE_WITH_LANG_SPECIFIC
:
539 MARK_TS_TYPE_COMMON (code
);
542 case TS_TYPE_NON_COMMON
:
543 MARK_TS_TYPE_WITH_LANG_SPECIFIC (code
);
547 MARK_TS_DECL_MINIMAL (code
);
552 MARK_TS_DECL_COMMON (code
);
555 case TS_DECL_NON_COMMON
:
556 MARK_TS_DECL_WITH_VIS (code
);
559 case TS_DECL_WITH_VIS
:
563 MARK_TS_DECL_WRTL (code
);
567 MARK_TS_DECL_COMMON (code
);
571 MARK_TS_DECL_WITH_VIS (code
);
575 case TS_FUNCTION_DECL
:
576 MARK_TS_DECL_NON_COMMON (code
);
579 case TS_TRANSLATION_UNIT_DECL
:
580 MARK_TS_DECL_COMMON (code
);
588 /* Basic consistency checks for attributes used in fold. */
589 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_NON_COMMON
]);
590 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_NON_COMMON
]);
591 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_DECL_COMMON
]);
592 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_COMMON
]);
593 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_COMMON
]);
594 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_COMMON
]);
595 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_COMMON
]);
596 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_COMMON
]);
597 gcc_assert (tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_COMMON
]);
598 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_COMMON
]);
599 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_DECL_COMMON
]);
600 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_WRTL
]);
601 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_WRTL
]);
602 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_WRTL
]);
603 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WRTL
]);
604 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_WRTL
]);
605 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_DECL_MINIMAL
]);
606 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_MINIMAL
]);
607 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_MINIMAL
]);
608 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_MINIMAL
]);
609 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_MINIMAL
]);
610 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_MINIMAL
]);
611 gcc_assert (tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_MINIMAL
]);
612 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_MINIMAL
]);
613 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_DECL_MINIMAL
]);
614 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_WITH_VIS
]);
615 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WITH_VIS
]);
616 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_WITH_VIS
]);
617 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_VAR_DECL
]);
618 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_FIELD_DECL
]);
619 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_PARM_DECL
]);
620 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_LABEL_DECL
]);
621 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_RESULT_DECL
]);
622 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_CONST_DECL
]);
623 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_TYPE_DECL
]);
624 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_FUNCTION_DECL
]);
625 gcc_assert (tree_contains_struct
[IMPORTED_DECL
][TS_DECL_MINIMAL
]);
626 gcc_assert (tree_contains_struct
[IMPORTED_DECL
][TS_DECL_COMMON
]);
627 gcc_assert (tree_contains_struct
[NAMELIST_DECL
][TS_DECL_MINIMAL
]);
628 gcc_assert (tree_contains_struct
[NAMELIST_DECL
][TS_DECL_COMMON
]);
637 /* Initialize the hash table of types. */
639 = hash_table
<type_cache_hasher
>::create_ggc (TYPE_HASH_INITIAL_SIZE
);
642 = hash_table
<tree_decl_map_cache_hasher
>::create_ggc (512);
645 = hash_table
<tree_decl_map_cache_hasher
>::create_ggc (512);
647 int_cst_hash_table
= hash_table
<int_cst_hasher
>::create_ggc (1024);
649 int_cst_node
= make_int_cst (1, 1);
651 cl_option_hash_table
= hash_table
<cl_option_hasher
>::create_ggc (64);
653 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
654 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
656 /* Initialize the tree_contains_struct array. */
657 initialize_tree_contains_struct ();
658 lang_hooks
.init_ts ();
662 /* The name of the object as the assembler will see it (but before any
663 translations made by ASM_OUTPUT_LABELREF). Often this is the same
664 as DECL_NAME. It is an IDENTIFIER_NODE. */
666 decl_assembler_name (tree decl
)
668 if (!DECL_ASSEMBLER_NAME_SET_P (decl
))
669 lang_hooks
.set_decl_assembler_name (decl
);
670 return DECL_WITH_VIS_CHECK (decl
)->decl_with_vis
.assembler_name
;
673 /* When the target supports COMDAT groups, this indicates which group the
674 DECL is associated with. This can be either an IDENTIFIER_NODE or a
675 decl, in which case its DECL_ASSEMBLER_NAME identifies the group. */
677 decl_comdat_group (const_tree node
)
679 struct symtab_node
*snode
= symtab_node::get (node
);
682 return snode
->get_comdat_group ();
685 /* Likewise, but make sure it's been reduced to an IDENTIFIER_NODE. */
687 decl_comdat_group_id (const_tree node
)
689 struct symtab_node
*snode
= symtab_node::get (node
);
692 return snode
->get_comdat_group_id ();
695 /* When the target supports named section, return its name as IDENTIFIER_NODE
696 or NULL if it is in no section. */
698 decl_section_name (const_tree node
)
700 struct symtab_node
*snode
= symtab_node::get (node
);
703 return snode
->get_section ();
706 /* Set section name of NODE to VALUE (that is expected to be
709 set_decl_section_name (tree node
, const char *value
)
711 struct symtab_node
*snode
;
715 snode
= symtab_node::get (node
);
719 else if (VAR_P (node
))
720 snode
= varpool_node::get_create (node
);
722 snode
= cgraph_node::get_create (node
);
723 snode
->set_section (value
);
726 /* Return TLS model of a variable NODE. */
728 decl_tls_model (const_tree node
)
730 struct varpool_node
*snode
= varpool_node::get (node
);
732 return TLS_MODEL_NONE
;
733 return snode
->tls_model
;
736 /* Set TLS model of variable NODE to MODEL. */
738 set_decl_tls_model (tree node
, enum tls_model model
)
740 struct varpool_node
*vnode
;
742 if (model
== TLS_MODEL_NONE
)
744 vnode
= varpool_node::get (node
);
749 vnode
= varpool_node::get_create (node
);
750 vnode
->tls_model
= model
;
753 /* Compute the number of bytes occupied by a tree with code CODE.
754 This function cannot be used for nodes that have variable sizes,
755 including TREE_VEC, INTEGER_CST, STRING_CST, and CALL_EXPR. */
757 tree_code_size (enum tree_code code
)
759 switch (TREE_CODE_CLASS (code
))
761 case tcc_declaration
: /* A decl node */
766 return sizeof (struct tree_field_decl
);
768 return sizeof (struct tree_parm_decl
);
770 return sizeof (struct tree_var_decl
);
772 return sizeof (struct tree_label_decl
);
774 return sizeof (struct tree_result_decl
);
776 return sizeof (struct tree_const_decl
);
778 return sizeof (struct tree_type_decl
);
780 return sizeof (struct tree_function_decl
);
781 case DEBUG_EXPR_DECL
:
782 return sizeof (struct tree_decl_with_rtl
);
783 case TRANSLATION_UNIT_DECL
:
784 return sizeof (struct tree_translation_unit_decl
);
788 return sizeof (struct tree_decl_non_common
);
790 return lang_hooks
.tree_size (code
);
794 case tcc_type
: /* a type node */
795 return sizeof (struct tree_type_non_common
);
797 case tcc_reference
: /* a reference */
798 case tcc_expression
: /* an expression */
799 case tcc_statement
: /* an expression with side effects */
800 case tcc_comparison
: /* a comparison expression */
801 case tcc_unary
: /* a unary arithmetic expression */
802 case tcc_binary
: /* a binary arithmetic expression */
803 return (sizeof (struct tree_exp
)
804 + (TREE_CODE_LENGTH (code
) - 1) * sizeof (tree
));
806 case tcc_constant
: /* a constant */
809 case VOID_CST
: return sizeof (struct tree_typed
);
810 case INTEGER_CST
: gcc_unreachable ();
811 case REAL_CST
: return sizeof (struct tree_real_cst
);
812 case FIXED_CST
: return sizeof (struct tree_fixed_cst
);
813 case COMPLEX_CST
: return sizeof (struct tree_complex
);
814 case VECTOR_CST
: return sizeof (struct tree_vector
);
815 case STRING_CST
: gcc_unreachable ();
817 return lang_hooks
.tree_size (code
);
820 case tcc_exceptional
: /* something random, like an identifier. */
823 case IDENTIFIER_NODE
: return lang_hooks
.identifier_size
;
824 case TREE_LIST
: return sizeof (struct tree_list
);
827 case PLACEHOLDER_EXPR
: return sizeof (struct tree_common
);
830 case OMP_CLAUSE
: gcc_unreachable ();
832 case SSA_NAME
: return sizeof (struct tree_ssa_name
);
834 case STATEMENT_LIST
: return sizeof (struct tree_statement_list
);
835 case BLOCK
: return sizeof (struct tree_block
);
836 case CONSTRUCTOR
: return sizeof (struct tree_constructor
);
837 case OPTIMIZATION_NODE
: return sizeof (struct tree_optimization_option
);
838 case TARGET_OPTION_NODE
: return sizeof (struct tree_target_option
);
841 return lang_hooks
.tree_size (code
);
849 /* Compute the number of bytes occupied by NODE. This routine only
850 looks at TREE_CODE, except for those nodes that have variable sizes. */
852 tree_size (const_tree node
)
854 const enum tree_code code
= TREE_CODE (node
);
858 return (sizeof (struct tree_int_cst
)
859 + (TREE_INT_CST_EXT_NUNITS (node
) - 1) * sizeof (HOST_WIDE_INT
));
862 return (offsetof (struct tree_binfo
, base_binfos
)
864 ::embedded_size (BINFO_N_BASE_BINFOS (node
)));
867 return (sizeof (struct tree_vec
)
868 + (TREE_VEC_LENGTH (node
) - 1) * sizeof (tree
));
871 return (sizeof (struct tree_vector
)
872 + (TYPE_VECTOR_SUBPARTS (TREE_TYPE (node
)) - 1) * sizeof (tree
));
875 return TREE_STRING_LENGTH (node
) + offsetof (struct tree_string
, str
) + 1;
878 return (sizeof (struct tree_omp_clause
)
879 + (omp_clause_num_ops
[OMP_CLAUSE_CODE (node
)] - 1)
883 if (TREE_CODE_CLASS (code
) == tcc_vl_exp
)
884 return (sizeof (struct tree_exp
)
885 + (VL_EXP_OPERAND_LENGTH (node
) - 1) * sizeof (tree
));
887 return tree_code_size (code
);
891 /* Record interesting allocation statistics for a tree node with CODE
895 record_node_allocation_statistics (enum tree_code code ATTRIBUTE_UNUSED
,
896 size_t length ATTRIBUTE_UNUSED
)
898 enum tree_code_class type
= TREE_CODE_CLASS (code
);
901 if (!GATHER_STATISTICS
)
906 case tcc_declaration
: /* A decl node */
910 case tcc_type
: /* a type node */
914 case tcc_statement
: /* an expression with side effects */
918 case tcc_reference
: /* a reference */
922 case tcc_expression
: /* an expression */
923 case tcc_comparison
: /* a comparison expression */
924 case tcc_unary
: /* a unary arithmetic expression */
925 case tcc_binary
: /* a binary arithmetic expression */
929 case tcc_constant
: /* a constant */
933 case tcc_exceptional
: /* something random, like an identifier. */
936 case IDENTIFIER_NODE
:
949 kind
= ssa_name_kind
;
961 kind
= omp_clause_kind
;
978 tree_code_counts
[(int) code
]++;
979 tree_node_counts
[(int) kind
]++;
980 tree_node_sizes
[(int) kind
] += length
;
983 /* Allocate and return a new UID from the DECL_UID namespace. */
986 allocate_decl_uid (void)
988 return next_decl_uid
++;
991 /* Return a newly allocated node of code CODE. For decl and type
992 nodes, some other fields are initialized. The rest of the node is
993 initialized to zero. This function cannot be used for TREE_VEC,
994 INTEGER_CST or OMP_CLAUSE nodes, which is enforced by asserts in
997 Achoo! I got a code in the node. */
1000 make_node_stat (enum tree_code code MEM_STAT_DECL
)
1003 enum tree_code_class type
= TREE_CODE_CLASS (code
);
1004 size_t length
= tree_code_size (code
);
1006 record_node_allocation_statistics (code
, length
);
1008 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
1009 TREE_SET_CODE (t
, code
);
1014 TREE_SIDE_EFFECTS (t
) = 1;
1017 case tcc_declaration
:
1018 if (CODE_CONTAINS_STRUCT (code
, TS_DECL_COMMON
))
1020 if (code
== FUNCTION_DECL
)
1022 SET_DECL_ALIGN (t
, FUNCTION_ALIGNMENT (FUNCTION_BOUNDARY
));
1023 SET_DECL_MODE (t
, FUNCTION_MODE
);
1026 SET_DECL_ALIGN (t
, 1);
1028 DECL_SOURCE_LOCATION (t
) = input_location
;
1029 if (TREE_CODE (t
) == DEBUG_EXPR_DECL
)
1030 DECL_UID (t
) = --next_debug_decl_uid
;
1033 DECL_UID (t
) = allocate_decl_uid ();
1034 SET_DECL_PT_UID (t
, -1);
1036 if (TREE_CODE (t
) == LABEL_DECL
)
1037 LABEL_DECL_UID (t
) = -1;
1042 TYPE_UID (t
) = next_type_uid
++;
1043 SET_TYPE_ALIGN (t
, BITS_PER_UNIT
);
1044 TYPE_USER_ALIGN (t
) = 0;
1045 TYPE_MAIN_VARIANT (t
) = t
;
1046 TYPE_CANONICAL (t
) = t
;
1048 /* Default to no attributes for type, but let target change that. */
1049 TYPE_ATTRIBUTES (t
) = NULL_TREE
;
1050 targetm
.set_default_type_attributes (t
);
1052 /* We have not yet computed the alias set for this type. */
1053 TYPE_ALIAS_SET (t
) = -1;
1057 TREE_CONSTANT (t
) = 1;
1060 case tcc_expression
:
1066 case PREDECREMENT_EXPR
:
1067 case PREINCREMENT_EXPR
:
1068 case POSTDECREMENT_EXPR
:
1069 case POSTINCREMENT_EXPR
:
1070 /* All of these have side-effects, no matter what their
1072 TREE_SIDE_EFFECTS (t
) = 1;
1080 case tcc_exceptional
:
1083 case TARGET_OPTION_NODE
:
1084 TREE_TARGET_OPTION(t
)
1085 = ggc_cleared_alloc
<struct cl_target_option
> ();
1088 case OPTIMIZATION_NODE
:
1089 TREE_OPTIMIZATION (t
)
1090 = ggc_cleared_alloc
<struct cl_optimization
> ();
1099 /* Other classes need no special treatment. */
1106 /* Free tree node. */
1109 free_node (tree node
)
1111 enum tree_code code
= TREE_CODE (node
);
1112 if (GATHER_STATISTICS
)
1114 tree_code_counts
[(int) TREE_CODE (node
)]--;
1115 tree_node_counts
[(int) t_kind
]--;
1116 tree_node_sizes
[(int) t_kind
] -= tree_size (node
);
1118 if (CODE_CONTAINS_STRUCT (code
, TS_CONSTRUCTOR
))
1119 vec_free (CONSTRUCTOR_ELTS (node
));
1120 else if (code
== BLOCK
)
1121 vec_free (BLOCK_NONLOCALIZED_VARS (node
));
1122 else if (code
== TREE_BINFO
)
1123 vec_free (BINFO_BASE_ACCESSES (node
));
1127 /* Return a new node with the same contents as NODE except that its
1128 TREE_CHAIN, if it has one, is zero and it has a fresh uid. */
1131 copy_node_stat (tree node MEM_STAT_DECL
)
1134 enum tree_code code
= TREE_CODE (node
);
1137 gcc_assert (code
!= STATEMENT_LIST
);
1139 length
= tree_size (node
);
1140 record_node_allocation_statistics (code
, length
);
1141 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
1142 memcpy (t
, node
, length
);
1144 if (CODE_CONTAINS_STRUCT (code
, TS_COMMON
))
1146 TREE_ASM_WRITTEN (t
) = 0;
1147 TREE_VISITED (t
) = 0;
1149 if (TREE_CODE_CLASS (code
) == tcc_declaration
)
1151 if (code
== DEBUG_EXPR_DECL
)
1152 DECL_UID (t
) = --next_debug_decl_uid
;
1155 DECL_UID (t
) = allocate_decl_uid ();
1156 if (DECL_PT_UID_SET_P (node
))
1157 SET_DECL_PT_UID (t
, DECL_PT_UID (node
));
1159 if ((TREE_CODE (node
) == PARM_DECL
|| VAR_P (node
))
1160 && DECL_HAS_VALUE_EXPR_P (node
))
1162 SET_DECL_VALUE_EXPR (t
, DECL_VALUE_EXPR (node
));
1163 DECL_HAS_VALUE_EXPR_P (t
) = 1;
1165 /* DECL_DEBUG_EXPR is copied explicitely by callers. */
1168 DECL_HAS_DEBUG_EXPR_P (t
) = 0;
1169 t
->decl_with_vis
.symtab_node
= NULL
;
1171 if (VAR_P (node
) && DECL_HAS_INIT_PRIORITY_P (node
))
1173 SET_DECL_INIT_PRIORITY (t
, DECL_INIT_PRIORITY (node
));
1174 DECL_HAS_INIT_PRIORITY_P (t
) = 1;
1176 if (TREE_CODE (node
) == FUNCTION_DECL
)
1178 DECL_STRUCT_FUNCTION (t
) = NULL
;
1179 t
->decl_with_vis
.symtab_node
= NULL
;
1182 else if (TREE_CODE_CLASS (code
) == tcc_type
)
1184 TYPE_UID (t
) = next_type_uid
++;
1185 /* The following is so that the debug code for
1186 the copy is different from the original type.
1187 The two statements usually duplicate each other
1188 (because they clear fields of the same union),
1189 but the optimizer should catch that. */
1190 TYPE_SYMTAB_POINTER (t
) = 0;
1191 TYPE_SYMTAB_ADDRESS (t
) = 0;
1193 /* Do not copy the values cache. */
1194 if (TYPE_CACHED_VALUES_P (t
))
1196 TYPE_CACHED_VALUES_P (t
) = 0;
1197 TYPE_CACHED_VALUES (t
) = NULL_TREE
;
1200 else if (code
== TARGET_OPTION_NODE
)
1202 TREE_TARGET_OPTION (t
) = ggc_alloc
<struct cl_target_option
>();
1203 memcpy (TREE_TARGET_OPTION (t
), TREE_TARGET_OPTION (node
),
1204 sizeof (struct cl_target_option
));
1206 else if (code
== OPTIMIZATION_NODE
)
1208 TREE_OPTIMIZATION (t
) = ggc_alloc
<struct cl_optimization
>();
1209 memcpy (TREE_OPTIMIZATION (t
), TREE_OPTIMIZATION (node
),
1210 sizeof (struct cl_optimization
));
1216 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
1217 For example, this can copy a list made of TREE_LIST nodes. */
1220 copy_list (tree list
)
1228 head
= prev
= copy_node (list
);
1229 next
= TREE_CHAIN (list
);
1232 TREE_CHAIN (prev
) = copy_node (next
);
1233 prev
= TREE_CHAIN (prev
);
1234 next
= TREE_CHAIN (next
);
1240 /* Return the value that TREE_INT_CST_EXT_NUNITS should have for an
1241 INTEGER_CST with value CST and type TYPE. */
1244 get_int_cst_ext_nunits (tree type
, const wide_int
&cst
)
1246 gcc_checking_assert (cst
.get_precision () == TYPE_PRECISION (type
));
1247 /* We need extra HWIs if CST is an unsigned integer with its
1249 if (TYPE_UNSIGNED (type
) && wi::neg_p (cst
))
1250 return cst
.get_precision () / HOST_BITS_PER_WIDE_INT
+ 1;
1251 return cst
.get_len ();
1254 /* Return a new INTEGER_CST with value CST and type TYPE. */
1257 build_new_int_cst (tree type
, const wide_int
&cst
)
1259 unsigned int len
= cst
.get_len ();
1260 unsigned int ext_len
= get_int_cst_ext_nunits (type
, cst
);
1261 tree nt
= make_int_cst (len
, ext_len
);
1266 TREE_INT_CST_ELT (nt
, ext_len
)
1267 = zext_hwi (-1, cst
.get_precision () % HOST_BITS_PER_WIDE_INT
);
1268 for (unsigned int i
= len
; i
< ext_len
; ++i
)
1269 TREE_INT_CST_ELT (nt
, i
) = -1;
1271 else if (TYPE_UNSIGNED (type
)
1272 && cst
.get_precision () < len
* HOST_BITS_PER_WIDE_INT
)
1275 TREE_INT_CST_ELT (nt
, len
)
1276 = zext_hwi (cst
.elt (len
),
1277 cst
.get_precision () % HOST_BITS_PER_WIDE_INT
);
1280 for (unsigned int i
= 0; i
< len
; i
++)
1281 TREE_INT_CST_ELT (nt
, i
) = cst
.elt (i
);
1282 TREE_TYPE (nt
) = type
;
1286 /* Create an INT_CST node with a LOW value sign extended to TYPE. */
1289 build_int_cst (tree type
, HOST_WIDE_INT low
)
1291 /* Support legacy code. */
1293 type
= integer_type_node
;
1295 return wide_int_to_tree (type
, wi::shwi (low
, TYPE_PRECISION (type
)));
1299 build_int_cstu (tree type
, unsigned HOST_WIDE_INT cst
)
1301 return wide_int_to_tree (type
, wi::uhwi (cst
, TYPE_PRECISION (type
)));
1304 /* Create an INT_CST node with a LOW value sign extended to TYPE. */
1307 build_int_cst_type (tree type
, HOST_WIDE_INT low
)
1310 return wide_int_to_tree (type
, wi::shwi (low
, TYPE_PRECISION (type
)));
1313 /* Constructs tree in type TYPE from with value given by CST. Signedness
1314 of CST is assumed to be the same as the signedness of TYPE. */
1317 double_int_to_tree (tree type
, double_int cst
)
1319 return wide_int_to_tree (type
, widest_int::from (cst
, TYPE_SIGN (type
)));
1322 /* We force the wide_int CST to the range of the type TYPE by sign or
1323 zero extending it. OVERFLOWABLE indicates if we are interested in
1324 overflow of the value, when >0 we are only interested in signed
1325 overflow, for <0 we are interested in any overflow. OVERFLOWED
1326 indicates whether overflow has already occurred. CONST_OVERFLOWED
1327 indicates whether constant overflow has already occurred. We force
1328 T's value to be within range of T's type (by setting to 0 or 1 all
1329 the bits outside the type's range). We set TREE_OVERFLOWED if,
1330 OVERFLOWED is nonzero,
1331 or OVERFLOWABLE is >0 and signed overflow occurs
1332 or OVERFLOWABLE is <0 and any overflow occurs
1333 We return a new tree node for the extended wide_int. The node
1334 is shared if no overflow flags are set. */
1338 force_fit_type (tree type
, const wide_int_ref
&cst
,
1339 int overflowable
, bool overflowed
)
1341 signop sign
= TYPE_SIGN (type
);
1343 /* If we need to set overflow flags, return a new unshared node. */
1344 if (overflowed
|| !wi::fits_to_tree_p (cst
, type
))
1348 || (overflowable
> 0 && sign
== SIGNED
))
1350 wide_int tmp
= wide_int::from (cst
, TYPE_PRECISION (type
), sign
);
1351 tree t
= build_new_int_cst (type
, tmp
);
1352 TREE_OVERFLOW (t
) = 1;
1357 /* Else build a shared node. */
1358 return wide_int_to_tree (type
, cst
);
1361 /* These are the hash table functions for the hash table of INTEGER_CST
1362 nodes of a sizetype. */
1364 /* Return the hash code X, an INTEGER_CST. */
1367 int_cst_hasher::hash (tree x
)
1369 const_tree
const t
= x
;
1370 hashval_t code
= TYPE_UID (TREE_TYPE (t
));
1373 for (i
= 0; i
< TREE_INT_CST_NUNITS (t
); i
++)
1374 code
= iterative_hash_host_wide_int (TREE_INT_CST_ELT(t
, i
), code
);
1379 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
1380 is the same as that given by *Y, which is the same. */
1383 int_cst_hasher::equal (tree x
, tree y
)
1385 const_tree
const xt
= x
;
1386 const_tree
const yt
= y
;
1388 if (TREE_TYPE (xt
) != TREE_TYPE (yt
)
1389 || TREE_INT_CST_NUNITS (xt
) != TREE_INT_CST_NUNITS (yt
)
1390 || TREE_INT_CST_EXT_NUNITS (xt
) != TREE_INT_CST_EXT_NUNITS (yt
))
1393 for (int i
= 0; i
< TREE_INT_CST_NUNITS (xt
); i
++)
1394 if (TREE_INT_CST_ELT (xt
, i
) != TREE_INT_CST_ELT (yt
, i
))
1400 /* Create an INT_CST node of TYPE and value CST.
1401 The returned node is always shared. For small integers we use a
1402 per-type vector cache, for larger ones we use a single hash table.
1403 The value is extended from its precision according to the sign of
1404 the type to be a multiple of HOST_BITS_PER_WIDE_INT. This defines
1405 the upper bits and ensures that hashing and value equality based
1406 upon the underlying HOST_WIDE_INTs works without masking. */
1409 wide_int_to_tree (tree type
, const wide_int_ref
&pcst
)
1416 unsigned int prec
= TYPE_PRECISION (type
);
1417 signop sgn
= TYPE_SIGN (type
);
1419 /* Verify that everything is canonical. */
1420 int l
= pcst
.get_len ();
1423 if (pcst
.elt (l
- 1) == 0)
1424 gcc_checking_assert (pcst
.elt (l
- 2) < 0);
1425 if (pcst
.elt (l
- 1) == HOST_WIDE_INT_M1
)
1426 gcc_checking_assert (pcst
.elt (l
- 2) >= 0);
1429 wide_int cst
= wide_int::from (pcst
, prec
, sgn
);
1430 unsigned int ext_len
= get_int_cst_ext_nunits (type
, cst
);
1434 /* We just need to store a single HOST_WIDE_INT. */
1436 if (TYPE_UNSIGNED (type
))
1437 hwi
= cst
.to_uhwi ();
1439 hwi
= cst
.to_shwi ();
1441 switch (TREE_CODE (type
))
1444 gcc_assert (hwi
== 0);
1448 case REFERENCE_TYPE
:
1449 case POINTER_BOUNDS_TYPE
:
1450 /* Cache NULL pointer and zero bounds. */
1459 /* Cache false or true. */
1461 if (IN_RANGE (hwi
, 0, 1))
1467 if (TYPE_SIGN (type
) == UNSIGNED
)
1470 limit
= INTEGER_SHARE_LIMIT
;
1471 if (IN_RANGE (hwi
, 0, INTEGER_SHARE_LIMIT
- 1))
1476 /* Cache [-1, N). */
1477 limit
= INTEGER_SHARE_LIMIT
+ 1;
1478 if (IN_RANGE (hwi
, -1, INTEGER_SHARE_LIMIT
- 1))
1492 /* Look for it in the type's vector of small shared ints. */
1493 if (!TYPE_CACHED_VALUES_P (type
))
1495 TYPE_CACHED_VALUES_P (type
) = 1;
1496 TYPE_CACHED_VALUES (type
) = make_tree_vec (limit
);
1499 t
= TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
);
1501 /* Make sure no one is clobbering the shared constant. */
1502 gcc_checking_assert (TREE_TYPE (t
) == type
1503 && TREE_INT_CST_NUNITS (t
) == 1
1504 && TREE_INT_CST_OFFSET_NUNITS (t
) == 1
1505 && TREE_INT_CST_EXT_NUNITS (t
) == 1
1506 && TREE_INT_CST_ELT (t
, 0) == hwi
);
1509 /* Create a new shared int. */
1510 t
= build_new_int_cst (type
, cst
);
1511 TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) = t
;
1516 /* Use the cache of larger shared ints, using int_cst_node as
1519 TREE_INT_CST_ELT (int_cst_node
, 0) = hwi
;
1520 TREE_TYPE (int_cst_node
) = type
;
1522 tree
*slot
= int_cst_hash_table
->find_slot (int_cst_node
, INSERT
);
1526 /* Insert this one into the hash table. */
1529 /* Make a new node for next time round. */
1530 int_cst_node
= make_int_cst (1, 1);
1536 /* The value either hashes properly or we drop it on the floor
1537 for the gc to take care of. There will not be enough of them
1540 tree nt
= build_new_int_cst (type
, cst
);
1541 tree
*slot
= int_cst_hash_table
->find_slot (nt
, INSERT
);
1545 /* Insert this one into the hash table. */
1555 cache_integer_cst (tree t
)
1557 tree type
= TREE_TYPE (t
);
1560 int prec
= TYPE_PRECISION (type
);
1562 gcc_assert (!TREE_OVERFLOW (t
));
1564 switch (TREE_CODE (type
))
1567 gcc_assert (integer_zerop (t
));
1571 case REFERENCE_TYPE
:
1572 /* Cache NULL pointer. */
1573 if (integer_zerop (t
))
1581 /* Cache false or true. */
1583 if (wi::ltu_p (t
, 2))
1584 ix
= TREE_INT_CST_ELT (t
, 0);
1589 if (TYPE_UNSIGNED (type
))
1592 limit
= INTEGER_SHARE_LIMIT
;
1594 /* This is a little hokie, but if the prec is smaller than
1595 what is necessary to hold INTEGER_SHARE_LIMIT, then the
1596 obvious test will not get the correct answer. */
1597 if (prec
< HOST_BITS_PER_WIDE_INT
)
1599 if (tree_to_uhwi (t
) < (unsigned HOST_WIDE_INT
) INTEGER_SHARE_LIMIT
)
1600 ix
= tree_to_uhwi (t
);
1602 else if (wi::ltu_p (t
, INTEGER_SHARE_LIMIT
))
1603 ix
= tree_to_uhwi (t
);
1608 limit
= INTEGER_SHARE_LIMIT
+ 1;
1610 if (integer_minus_onep (t
))
1612 else if (!wi::neg_p (t
))
1614 if (prec
< HOST_BITS_PER_WIDE_INT
)
1616 if (tree_to_shwi (t
) < INTEGER_SHARE_LIMIT
)
1617 ix
= tree_to_shwi (t
) + 1;
1619 else if (wi::ltu_p (t
, INTEGER_SHARE_LIMIT
))
1620 ix
= tree_to_shwi (t
) + 1;
1634 /* Look for it in the type's vector of small shared ints. */
1635 if (!TYPE_CACHED_VALUES_P (type
))
1637 TYPE_CACHED_VALUES_P (type
) = 1;
1638 TYPE_CACHED_VALUES (type
) = make_tree_vec (limit
);
1641 gcc_assert (TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) == NULL_TREE
);
1642 TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) = t
;
1646 /* Use the cache of larger shared ints. */
1647 tree
*slot
= int_cst_hash_table
->find_slot (t
, INSERT
);
1648 /* If there is already an entry for the number verify it's the
1651 gcc_assert (wi::eq_p (tree (*slot
), t
));
1653 /* Otherwise insert this one into the hash table. */
1659 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
1660 and the rest are zeros. */
1663 build_low_bits_mask (tree type
, unsigned bits
)
1665 gcc_assert (bits
<= TYPE_PRECISION (type
));
1667 return wide_int_to_tree (type
, wi::mask (bits
, false,
1668 TYPE_PRECISION (type
)));
1671 /* Checks that X is integer constant that can be expressed in (unsigned)
1672 HOST_WIDE_INT without loss of precision. */
1675 cst_and_fits_in_hwi (const_tree x
)
1677 return (TREE_CODE (x
) == INTEGER_CST
1678 && (tree_fits_shwi_p (x
) || tree_fits_uhwi_p (x
)));
1681 /* Build a newly constructed VECTOR_CST node of length LEN. */
1684 make_vector_stat (unsigned len MEM_STAT_DECL
)
1687 unsigned length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vector
);
1689 record_node_allocation_statistics (VECTOR_CST
, length
);
1691 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
1693 TREE_SET_CODE (t
, VECTOR_CST
);
1694 TREE_CONSTANT (t
) = 1;
1699 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1700 are in a list pointed to by VALS. */
1703 build_vector_stat (tree type
, tree
*vals MEM_STAT_DECL
)
1707 tree v
= make_vector (TYPE_VECTOR_SUBPARTS (type
));
1708 TREE_TYPE (v
) = type
;
1710 /* Iterate through elements and check for overflow. */
1711 for (cnt
= 0; cnt
< TYPE_VECTOR_SUBPARTS (type
); ++cnt
)
1713 tree value
= vals
[cnt
];
1715 VECTOR_CST_ELT (v
, cnt
) = value
;
1717 /* Don't crash if we get an address constant. */
1718 if (!CONSTANT_CLASS_P (value
))
1721 over
|= TREE_OVERFLOW (value
);
1724 TREE_OVERFLOW (v
) = over
;
1728 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1729 are extracted from V, a vector of CONSTRUCTOR_ELT. */
1732 build_vector_from_ctor (tree type
, vec
<constructor_elt
, va_gc
> *v
)
1734 tree
*vec
= XALLOCAVEC (tree
, TYPE_VECTOR_SUBPARTS (type
));
1735 unsigned HOST_WIDE_INT idx
, pos
= 0;
1738 FOR_EACH_CONSTRUCTOR_VALUE (v
, idx
, value
)
1740 if (TREE_CODE (value
) == VECTOR_CST
)
1741 for (unsigned i
= 0; i
< VECTOR_CST_NELTS (value
); ++i
)
1742 vec
[pos
++] = VECTOR_CST_ELT (value
, i
);
1746 while (pos
< TYPE_VECTOR_SUBPARTS (type
))
1747 vec
[pos
++] = build_zero_cst (TREE_TYPE (type
));
1749 return build_vector (type
, vec
);
1752 /* Build a vector of type VECTYPE where all the elements are SCs. */
1754 build_vector_from_val (tree vectype
, tree sc
)
1756 int i
, nunits
= TYPE_VECTOR_SUBPARTS (vectype
);
1758 if (sc
== error_mark_node
)
1761 /* Verify that the vector type is suitable for SC. Note that there
1762 is some inconsistency in the type-system with respect to restrict
1763 qualifications of pointers. Vector types always have a main-variant
1764 element type and the qualification is applied to the vector-type.
1765 So TREE_TYPE (vector-type) does not return a properly qualified
1766 vector element-type. */
1767 gcc_checking_assert (types_compatible_p (TYPE_MAIN_VARIANT (TREE_TYPE (sc
)),
1768 TREE_TYPE (vectype
)));
1770 if (CONSTANT_CLASS_P (sc
))
1772 tree
*v
= XALLOCAVEC (tree
, nunits
);
1773 for (i
= 0; i
< nunits
; ++i
)
1775 return build_vector (vectype
, v
);
1779 vec
<constructor_elt
, va_gc
> *v
;
1780 vec_alloc (v
, nunits
);
1781 for (i
= 0; i
< nunits
; ++i
)
1782 CONSTRUCTOR_APPEND_ELT (v
, NULL_TREE
, sc
);
1783 return build_constructor (vectype
, v
);
1787 /* Something has messed with the elements of CONSTRUCTOR C after it was built;
1788 calculate TREE_CONSTANT and TREE_SIDE_EFFECTS. */
1791 recompute_constructor_flags (tree c
)
1795 bool constant_p
= true;
1796 bool side_effects_p
= false;
1797 vec
<constructor_elt
, va_gc
> *vals
= CONSTRUCTOR_ELTS (c
);
1799 FOR_EACH_CONSTRUCTOR_VALUE (vals
, i
, val
)
1801 /* Mostly ctors will have elts that don't have side-effects, so
1802 the usual case is to scan all the elements. Hence a single
1803 loop for both const and side effects, rather than one loop
1804 each (with early outs). */
1805 if (!TREE_CONSTANT (val
))
1807 if (TREE_SIDE_EFFECTS (val
))
1808 side_effects_p
= true;
1811 TREE_SIDE_EFFECTS (c
) = side_effects_p
;
1812 TREE_CONSTANT (c
) = constant_p
;
1815 /* Make sure that TREE_CONSTANT and TREE_SIDE_EFFECTS are correct for
1819 verify_constructor_flags (tree c
)
1823 bool constant_p
= TREE_CONSTANT (c
);
1824 bool side_effects_p
= TREE_SIDE_EFFECTS (c
);
1825 vec
<constructor_elt
, va_gc
> *vals
= CONSTRUCTOR_ELTS (c
);
1827 FOR_EACH_CONSTRUCTOR_VALUE (vals
, i
, val
)
1829 if (constant_p
&& !TREE_CONSTANT (val
))
1830 internal_error ("non-constant element in constant CONSTRUCTOR");
1831 if (!side_effects_p
&& TREE_SIDE_EFFECTS (val
))
1832 internal_error ("side-effects element in no-side-effects CONSTRUCTOR");
1836 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1837 are in the vec pointed to by VALS. */
1839 build_constructor (tree type
, vec
<constructor_elt
, va_gc
> *vals
)
1841 tree c
= make_node (CONSTRUCTOR
);
1843 TREE_TYPE (c
) = type
;
1844 CONSTRUCTOR_ELTS (c
) = vals
;
1846 recompute_constructor_flags (c
);
1851 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
1854 build_constructor_single (tree type
, tree index
, tree value
)
1856 vec
<constructor_elt
, va_gc
> *v
;
1857 constructor_elt elt
= {index
, value
};
1860 v
->quick_push (elt
);
1862 return build_constructor (type
, v
);
1866 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1867 are in a list pointed to by VALS. */
1869 build_constructor_from_list (tree type
, tree vals
)
1872 vec
<constructor_elt
, va_gc
> *v
= NULL
;
1876 vec_alloc (v
, list_length (vals
));
1877 for (t
= vals
; t
; t
= TREE_CHAIN (t
))
1878 CONSTRUCTOR_APPEND_ELT (v
, TREE_PURPOSE (t
), TREE_VALUE (t
));
1881 return build_constructor (type
, v
);
1884 /* Return a new CONSTRUCTOR node whose type is TYPE. NELTS is the number
1885 of elements, provided as index/value pairs. */
1888 build_constructor_va (tree type
, int nelts
, ...)
1890 vec
<constructor_elt
, va_gc
> *v
= NULL
;
1893 va_start (p
, nelts
);
1894 vec_alloc (v
, nelts
);
1897 tree index
= va_arg (p
, tree
);
1898 tree value
= va_arg (p
, tree
);
1899 CONSTRUCTOR_APPEND_ELT (v
, index
, value
);
1902 return build_constructor (type
, v
);
1905 /* Return a new FIXED_CST node whose type is TYPE and value is F. */
1908 build_fixed (tree type
, FIXED_VALUE_TYPE f
)
1911 FIXED_VALUE_TYPE
*fp
;
1913 v
= make_node (FIXED_CST
);
1914 fp
= ggc_alloc
<fixed_value
> ();
1915 memcpy (fp
, &f
, sizeof (FIXED_VALUE_TYPE
));
1917 TREE_TYPE (v
) = type
;
1918 TREE_FIXED_CST_PTR (v
) = fp
;
1922 /* Return a new REAL_CST node whose type is TYPE and value is D. */
1925 build_real (tree type
, REAL_VALUE_TYPE d
)
1928 REAL_VALUE_TYPE
*dp
;
1931 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
1932 Consider doing it via real_convert now. */
1934 v
= make_node (REAL_CST
);
1935 dp
= ggc_alloc
<real_value
> ();
1936 memcpy (dp
, &d
, sizeof (REAL_VALUE_TYPE
));
1938 TREE_TYPE (v
) = type
;
1939 TREE_REAL_CST_PTR (v
) = dp
;
1940 TREE_OVERFLOW (v
) = overflow
;
1944 /* Like build_real, but first truncate D to the type. */
1947 build_real_truncate (tree type
, REAL_VALUE_TYPE d
)
1949 return build_real (type
, real_value_truncate (TYPE_MODE (type
), d
));
1952 /* Return a new REAL_CST node whose type is TYPE
1953 and whose value is the integer value of the INTEGER_CST node I. */
1956 real_value_from_int_cst (const_tree type
, const_tree i
)
1960 /* Clear all bits of the real value type so that we can later do
1961 bitwise comparisons to see if two values are the same. */
1962 memset (&d
, 0, sizeof d
);
1964 real_from_integer (&d
, type
? TYPE_MODE (type
) : VOIDmode
, i
,
1965 TYPE_SIGN (TREE_TYPE (i
)));
1969 /* Given a tree representing an integer constant I, return a tree
1970 representing the same value as a floating-point constant of type TYPE. */
1973 build_real_from_int_cst (tree type
, const_tree i
)
1976 int overflow
= TREE_OVERFLOW (i
);
1978 v
= build_real (type
, real_value_from_int_cst (type
, i
));
1980 TREE_OVERFLOW (v
) |= overflow
;
1984 /* Return a newly constructed STRING_CST node whose value is
1985 the LEN characters at STR.
1986 Note that for a C string literal, LEN should include the trailing NUL.
1987 The TREE_TYPE is not initialized. */
1990 build_string (int len
, const char *str
)
1995 /* Do not waste bytes provided by padding of struct tree_string. */
1996 length
= len
+ offsetof (struct tree_string
, str
) + 1;
1998 record_node_allocation_statistics (STRING_CST
, length
);
2000 s
= (tree
) ggc_internal_alloc (length
);
2002 memset (s
, 0, sizeof (struct tree_typed
));
2003 TREE_SET_CODE (s
, STRING_CST
);
2004 TREE_CONSTANT (s
) = 1;
2005 TREE_STRING_LENGTH (s
) = len
;
2006 memcpy (s
->string
.str
, str
, len
);
2007 s
->string
.str
[len
] = '\0';
2012 /* Return a newly constructed COMPLEX_CST node whose value is
2013 specified by the real and imaginary parts REAL and IMAG.
2014 Both REAL and IMAG should be constant nodes. TYPE, if specified,
2015 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
2018 build_complex (tree type
, tree real
, tree imag
)
2020 tree t
= make_node (COMPLEX_CST
);
2022 TREE_REALPART (t
) = real
;
2023 TREE_IMAGPART (t
) = imag
;
2024 TREE_TYPE (t
) = type
? type
: build_complex_type (TREE_TYPE (real
));
2025 TREE_OVERFLOW (t
) = TREE_OVERFLOW (real
) | TREE_OVERFLOW (imag
);
2029 /* Build a complex (inf +- 0i), such as for the result of cproj.
2030 TYPE is the complex tree type of the result. If NEG is true, the
2031 imaginary zero is negative. */
2034 build_complex_inf (tree type
, bool neg
)
2036 REAL_VALUE_TYPE rinf
, rzero
= dconst0
;
2040 return build_complex (type
, build_real (TREE_TYPE (type
), rinf
),
2041 build_real (TREE_TYPE (type
), rzero
));
2044 /* Return the constant 1 in type TYPE. If TYPE has several elements, each
2045 element is set to 1. In particular, this is 1 + i for complex types. */
2048 build_each_one_cst (tree type
)
2050 if (TREE_CODE (type
) == COMPLEX_TYPE
)
2052 tree scalar
= build_one_cst (TREE_TYPE (type
));
2053 return build_complex (type
, scalar
, scalar
);
2056 return build_one_cst (type
);
2059 /* Return a constant of arithmetic type TYPE which is the
2060 multiplicative identity of the set TYPE. */
2063 build_one_cst (tree type
)
2065 switch (TREE_CODE (type
))
2067 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
2068 case POINTER_TYPE
: case REFERENCE_TYPE
:
2070 return build_int_cst (type
, 1);
2073 return build_real (type
, dconst1
);
2075 case FIXED_POINT_TYPE
:
2076 /* We can only generate 1 for accum types. */
2077 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type
)));
2078 return build_fixed (type
, FCONST1 (TYPE_MODE (type
)));
2082 tree scalar
= build_one_cst (TREE_TYPE (type
));
2084 return build_vector_from_val (type
, scalar
);
2088 return build_complex (type
,
2089 build_one_cst (TREE_TYPE (type
)),
2090 build_zero_cst (TREE_TYPE (type
)));
2097 /* Return an integer of type TYPE containing all 1's in as much precision as
2098 it contains, or a complex or vector whose subparts are such integers. */
2101 build_all_ones_cst (tree type
)
2103 if (TREE_CODE (type
) == COMPLEX_TYPE
)
2105 tree scalar
= build_all_ones_cst (TREE_TYPE (type
));
2106 return build_complex (type
, scalar
, scalar
);
2109 return build_minus_one_cst (type
);
2112 /* Return a constant of arithmetic type TYPE which is the
2113 opposite of the multiplicative identity of the set TYPE. */
2116 build_minus_one_cst (tree type
)
2118 switch (TREE_CODE (type
))
2120 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
2121 case POINTER_TYPE
: case REFERENCE_TYPE
:
2123 return build_int_cst (type
, -1);
2126 return build_real (type
, dconstm1
);
2128 case FIXED_POINT_TYPE
:
2129 /* We can only generate 1 for accum types. */
2130 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type
)));
2131 return build_fixed (type
, fixed_from_double_int (double_int_minus_one
,
2136 tree scalar
= build_minus_one_cst (TREE_TYPE (type
));
2138 return build_vector_from_val (type
, scalar
);
2142 return build_complex (type
,
2143 build_minus_one_cst (TREE_TYPE (type
)),
2144 build_zero_cst (TREE_TYPE (type
)));
2151 /* Build 0 constant of type TYPE. This is used by constructor folding
2152 and thus the constant should be represented in memory by
2156 build_zero_cst (tree type
)
2158 switch (TREE_CODE (type
))
2160 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
2161 case POINTER_TYPE
: case REFERENCE_TYPE
:
2162 case OFFSET_TYPE
: case NULLPTR_TYPE
:
2163 return build_int_cst (type
, 0);
2166 return build_real (type
, dconst0
);
2168 case FIXED_POINT_TYPE
:
2169 return build_fixed (type
, FCONST0 (TYPE_MODE (type
)));
2173 tree scalar
= build_zero_cst (TREE_TYPE (type
));
2175 return build_vector_from_val (type
, scalar
);
2180 tree zero
= build_zero_cst (TREE_TYPE (type
));
2182 return build_complex (type
, zero
, zero
);
2186 if (!AGGREGATE_TYPE_P (type
))
2187 return fold_convert (type
, integer_zero_node
);
2188 return build_constructor (type
, NULL
);
2193 /* Build a BINFO with LEN language slots. */
2196 make_tree_binfo_stat (unsigned base_binfos MEM_STAT_DECL
)
2199 size_t length
= (offsetof (struct tree_binfo
, base_binfos
)
2200 + vec
<tree
, va_gc
>::embedded_size (base_binfos
));
2202 record_node_allocation_statistics (TREE_BINFO
, length
);
2204 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
2206 memset (t
, 0, offsetof (struct tree_binfo
, base_binfos
));
2208 TREE_SET_CODE (t
, TREE_BINFO
);
2210 BINFO_BASE_BINFOS (t
)->embedded_init (base_binfos
);
2215 /* Create a CASE_LABEL_EXPR tree node and return it. */
2218 build_case_label (tree low_value
, tree high_value
, tree label_decl
)
2220 tree t
= make_node (CASE_LABEL_EXPR
);
2222 TREE_TYPE (t
) = void_type_node
;
2223 SET_EXPR_LOCATION (t
, DECL_SOURCE_LOCATION (label_decl
));
2225 CASE_LOW (t
) = low_value
;
2226 CASE_HIGH (t
) = high_value
;
2227 CASE_LABEL (t
) = label_decl
;
2228 CASE_CHAIN (t
) = NULL_TREE
;
2233 /* Build a newly constructed INTEGER_CST node. LEN and EXT_LEN are the
2234 values of TREE_INT_CST_NUNITS and TREE_INT_CST_EXT_NUNITS respectively.
2235 The latter determines the length of the HOST_WIDE_INT vector. */
2238 make_int_cst_stat (int len
, int ext_len MEM_STAT_DECL
)
2241 int length
= ((ext_len
- 1) * sizeof (HOST_WIDE_INT
)
2242 + sizeof (struct tree_int_cst
));
2245 record_node_allocation_statistics (INTEGER_CST
, length
);
2247 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
2249 TREE_SET_CODE (t
, INTEGER_CST
);
2250 TREE_INT_CST_NUNITS (t
) = len
;
2251 TREE_INT_CST_EXT_NUNITS (t
) = ext_len
;
2252 /* to_offset can only be applied to trees that are offset_int-sized
2253 or smaller. EXT_LEN is correct if it fits, otherwise the constant
2254 must be exactly the precision of offset_int and so LEN is correct. */
2255 if (ext_len
<= OFFSET_INT_ELTS
)
2256 TREE_INT_CST_OFFSET_NUNITS (t
) = ext_len
;
2258 TREE_INT_CST_OFFSET_NUNITS (t
) = len
;
2260 TREE_CONSTANT (t
) = 1;
2265 /* Build a newly constructed TREE_VEC node of length LEN. */
2268 make_tree_vec_stat (int len MEM_STAT_DECL
)
2271 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
2273 record_node_allocation_statistics (TREE_VEC
, length
);
2275 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
2277 TREE_SET_CODE (t
, TREE_VEC
);
2278 TREE_VEC_LENGTH (t
) = len
;
2283 /* Grow a TREE_VEC node to new length LEN. */
2286 grow_tree_vec_stat (tree v
, int len MEM_STAT_DECL
)
2288 gcc_assert (TREE_CODE (v
) == TREE_VEC
);
2290 int oldlen
= TREE_VEC_LENGTH (v
);
2291 gcc_assert (len
> oldlen
);
2293 int oldlength
= (oldlen
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
2294 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
2296 record_node_allocation_statistics (TREE_VEC
, length
- oldlength
);
2298 v
= (tree
) ggc_realloc (v
, length PASS_MEM_STAT
);
2300 TREE_VEC_LENGTH (v
) = len
;
2305 /* Return 1 if EXPR is the constant zero, whether it is integral, float or
2306 fixed, and scalar, complex or vector. */
2309 zerop (const_tree expr
)
2311 return (integer_zerop (expr
)
2312 || real_zerop (expr
)
2313 || fixed_zerop (expr
));
2316 /* Return 1 if EXPR is the integer constant zero or a complex constant
2320 integer_zerop (const_tree expr
)
2322 switch (TREE_CODE (expr
))
2325 return wi::eq_p (expr
, 0);
2327 return (integer_zerop (TREE_REALPART (expr
))
2328 && integer_zerop (TREE_IMAGPART (expr
)));
2332 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2333 if (!integer_zerop (VECTOR_CST_ELT (expr
, i
)))
2342 /* Return 1 if EXPR is the integer constant one or the corresponding
2343 complex constant. */
2346 integer_onep (const_tree expr
)
2348 switch (TREE_CODE (expr
))
2351 return wi::eq_p (wi::to_widest (expr
), 1);
2353 return (integer_onep (TREE_REALPART (expr
))
2354 && integer_zerop (TREE_IMAGPART (expr
)));
2358 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2359 if (!integer_onep (VECTOR_CST_ELT (expr
, i
)))
2368 /* Return 1 if EXPR is the integer constant one. For complex and vector,
2369 return 1 if every piece is the integer constant one. */
2372 integer_each_onep (const_tree expr
)
2374 if (TREE_CODE (expr
) == COMPLEX_CST
)
2375 return (integer_onep (TREE_REALPART (expr
))
2376 && integer_onep (TREE_IMAGPART (expr
)));
2378 return integer_onep (expr
);
2381 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
2382 it contains, or a complex or vector whose subparts are such integers. */
2385 integer_all_onesp (const_tree expr
)
2387 if (TREE_CODE (expr
) == COMPLEX_CST
2388 && integer_all_onesp (TREE_REALPART (expr
))
2389 && integer_all_onesp (TREE_IMAGPART (expr
)))
2392 else if (TREE_CODE (expr
) == VECTOR_CST
)
2395 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2396 if (!integer_all_onesp (VECTOR_CST_ELT (expr
, i
)))
2401 else if (TREE_CODE (expr
) != INTEGER_CST
)
2404 return wi::max_value (TYPE_PRECISION (TREE_TYPE (expr
)), UNSIGNED
) == expr
;
2407 /* Return 1 if EXPR is the integer constant minus one. */
2410 integer_minus_onep (const_tree expr
)
2412 if (TREE_CODE (expr
) == COMPLEX_CST
)
2413 return (integer_all_onesp (TREE_REALPART (expr
))
2414 && integer_zerop (TREE_IMAGPART (expr
)));
2416 return integer_all_onesp (expr
);
2419 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
2423 integer_pow2p (const_tree expr
)
2425 if (TREE_CODE (expr
) == COMPLEX_CST
2426 && integer_pow2p (TREE_REALPART (expr
))
2427 && integer_zerop (TREE_IMAGPART (expr
)))
2430 if (TREE_CODE (expr
) != INTEGER_CST
)
2433 return wi::popcount (expr
) == 1;
2436 /* Return 1 if EXPR is an integer constant other than zero or a
2437 complex constant other than zero. */
2440 integer_nonzerop (const_tree expr
)
2442 return ((TREE_CODE (expr
) == INTEGER_CST
2443 && !wi::eq_p (expr
, 0))
2444 || (TREE_CODE (expr
) == COMPLEX_CST
2445 && (integer_nonzerop (TREE_REALPART (expr
))
2446 || integer_nonzerop (TREE_IMAGPART (expr
)))));
2449 /* Return 1 if EXPR is the integer constant one. For vector,
2450 return 1 if every piece is the integer constant minus one
2451 (representing the value TRUE). */
2454 integer_truep (const_tree expr
)
2456 if (TREE_CODE (expr
) == VECTOR_CST
)
2457 return integer_all_onesp (expr
);
2458 return integer_onep (expr
);
2461 /* Return 1 if EXPR is the fixed-point constant zero. */
2464 fixed_zerop (const_tree expr
)
2466 return (TREE_CODE (expr
) == FIXED_CST
2467 && TREE_FIXED_CST (expr
).data
.is_zero ());
2470 /* Return the power of two represented by a tree node known to be a
2474 tree_log2 (const_tree expr
)
2476 if (TREE_CODE (expr
) == COMPLEX_CST
)
2477 return tree_log2 (TREE_REALPART (expr
));
2479 return wi::exact_log2 (expr
);
2482 /* Similar, but return the largest integer Y such that 2 ** Y is less
2483 than or equal to EXPR. */
2486 tree_floor_log2 (const_tree expr
)
2488 if (TREE_CODE (expr
) == COMPLEX_CST
)
2489 return tree_log2 (TREE_REALPART (expr
));
2491 return wi::floor_log2 (expr
);
2494 /* Return number of known trailing zero bits in EXPR, or, if the value of
2495 EXPR is known to be zero, the precision of it's type. */
2498 tree_ctz (const_tree expr
)
2500 if (!INTEGRAL_TYPE_P (TREE_TYPE (expr
))
2501 && !POINTER_TYPE_P (TREE_TYPE (expr
)))
2504 unsigned int ret1
, ret2
, prec
= TYPE_PRECISION (TREE_TYPE (expr
));
2505 switch (TREE_CODE (expr
))
2508 ret1
= wi::ctz (expr
);
2509 return MIN (ret1
, prec
);
2511 ret1
= wi::ctz (get_nonzero_bits (expr
));
2512 return MIN (ret1
, prec
);
2519 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2522 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2523 return MIN (ret1
, ret2
);
2524 case POINTER_PLUS_EXPR
:
2525 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2526 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2527 /* Second operand is sizetype, which could be in theory
2528 wider than pointer's precision. Make sure we never
2529 return more than prec. */
2530 ret2
= MIN (ret2
, prec
);
2531 return MIN (ret1
, ret2
);
2533 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2534 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2535 return MAX (ret1
, ret2
);
2537 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2538 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2539 return MIN (ret1
+ ret2
, prec
);
2541 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2542 if (tree_fits_uhwi_p (TREE_OPERAND (expr
, 1))
2543 && (tree_to_uhwi (TREE_OPERAND (expr
, 1)) < prec
))
2545 ret2
= tree_to_uhwi (TREE_OPERAND (expr
, 1));
2546 return MIN (ret1
+ ret2
, prec
);
2550 if (tree_fits_uhwi_p (TREE_OPERAND (expr
, 1))
2551 && (tree_to_uhwi (TREE_OPERAND (expr
, 1)) < prec
))
2553 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2554 ret2
= tree_to_uhwi (TREE_OPERAND (expr
, 1));
2559 case TRUNC_DIV_EXPR
:
2561 case FLOOR_DIV_EXPR
:
2562 case ROUND_DIV_EXPR
:
2563 case EXACT_DIV_EXPR
:
2564 if (TREE_CODE (TREE_OPERAND (expr
, 1)) == INTEGER_CST
2565 && tree_int_cst_sgn (TREE_OPERAND (expr
, 1)) == 1)
2567 int l
= tree_log2 (TREE_OPERAND (expr
, 1));
2570 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2578 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2579 if (ret1
&& ret1
== TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (expr
, 0))))
2581 return MIN (ret1
, prec
);
2583 return tree_ctz (TREE_OPERAND (expr
, 0));
2585 ret1
= tree_ctz (TREE_OPERAND (expr
, 1));
2588 ret2
= tree_ctz (TREE_OPERAND (expr
, 2));
2589 return MIN (ret1
, ret2
);
2591 return tree_ctz (TREE_OPERAND (expr
, 1));
2593 ret1
= get_pointer_alignment (CONST_CAST_TREE (expr
));
2594 if (ret1
> BITS_PER_UNIT
)
2596 ret1
= ctz_hwi (ret1
/ BITS_PER_UNIT
);
2597 return MIN (ret1
, prec
);
2605 /* Return 1 if EXPR is the real constant zero. Trailing zeroes matter for
2606 decimal float constants, so don't return 1 for them. */
2609 real_zerop (const_tree expr
)
2611 switch (TREE_CODE (expr
))
2614 return real_equal (&TREE_REAL_CST (expr
), &dconst0
)
2615 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2617 return real_zerop (TREE_REALPART (expr
))
2618 && real_zerop (TREE_IMAGPART (expr
));
2622 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2623 if (!real_zerop (VECTOR_CST_ELT (expr
, i
)))
2632 /* Return 1 if EXPR is the real constant one in real or complex form.
2633 Trailing zeroes matter for decimal float constants, so don't return
2637 real_onep (const_tree expr
)
2639 switch (TREE_CODE (expr
))
2642 return real_equal (&TREE_REAL_CST (expr
), &dconst1
)
2643 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2645 return real_onep (TREE_REALPART (expr
))
2646 && real_zerop (TREE_IMAGPART (expr
));
2650 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2651 if (!real_onep (VECTOR_CST_ELT (expr
, i
)))
2660 /* Return 1 if EXPR is the real constant minus one. Trailing zeroes
2661 matter for decimal float constants, so don't return 1 for them. */
2664 real_minus_onep (const_tree expr
)
2666 switch (TREE_CODE (expr
))
2669 return real_equal (&TREE_REAL_CST (expr
), &dconstm1
)
2670 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2672 return real_minus_onep (TREE_REALPART (expr
))
2673 && real_zerop (TREE_IMAGPART (expr
));
2677 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2678 if (!real_minus_onep (VECTOR_CST_ELT (expr
, i
)))
2687 /* Nonzero if EXP is a constant or a cast of a constant. */
2690 really_constant_p (const_tree exp
)
2692 /* This is not quite the same as STRIP_NOPS. It does more. */
2693 while (CONVERT_EXPR_P (exp
)
2694 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
2695 exp
= TREE_OPERAND (exp
, 0);
2696 return TREE_CONSTANT (exp
);
2699 /* Return first list element whose TREE_VALUE is ELEM.
2700 Return 0 if ELEM is not in LIST. */
2703 value_member (tree elem
, tree list
)
2707 if (elem
== TREE_VALUE (list
))
2709 list
= TREE_CHAIN (list
);
2714 /* Return first list element whose TREE_PURPOSE is ELEM.
2715 Return 0 if ELEM is not in LIST. */
2718 purpose_member (const_tree elem
, tree list
)
2722 if (elem
== TREE_PURPOSE (list
))
2724 list
= TREE_CHAIN (list
);
2729 /* Return true if ELEM is in V. */
2732 vec_member (const_tree elem
, vec
<tree
, va_gc
> *v
)
2736 FOR_EACH_VEC_SAFE_ELT (v
, ix
, t
)
2742 /* Returns element number IDX (zero-origin) of chain CHAIN, or
2746 chain_index (int idx
, tree chain
)
2748 for (; chain
&& idx
> 0; --idx
)
2749 chain
= TREE_CHAIN (chain
);
2753 /* Return nonzero if ELEM is part of the chain CHAIN. */
2756 chain_member (const_tree elem
, const_tree chain
)
2762 chain
= DECL_CHAIN (chain
);
2768 /* Return the length of a chain of nodes chained through TREE_CHAIN.
2769 We expect a null pointer to mark the end of the chain.
2770 This is the Lisp primitive `length'. */
2773 list_length (const_tree t
)
2776 #ifdef ENABLE_TREE_CHECKING
2784 #ifdef ENABLE_TREE_CHECKING
2787 gcc_assert (p
!= q
);
2795 /* Returns the first FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
2796 UNION_TYPE TYPE, or NULL_TREE if none. */
2799 first_field (const_tree type
)
2801 tree t
= TYPE_FIELDS (type
);
2802 while (t
&& TREE_CODE (t
) != FIELD_DECL
)
2807 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
2808 by modifying the last node in chain 1 to point to chain 2.
2809 This is the Lisp primitive `nconc'. */
2812 chainon (tree op1
, tree op2
)
2821 for (t1
= op1
; TREE_CHAIN (t1
); t1
= TREE_CHAIN (t1
))
2823 TREE_CHAIN (t1
) = op2
;
2825 #ifdef ENABLE_TREE_CHECKING
2828 for (t2
= op2
; t2
; t2
= TREE_CHAIN (t2
))
2829 gcc_assert (t2
!= t1
);
2836 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
2839 tree_last (tree chain
)
2843 while ((next
= TREE_CHAIN (chain
)))
2848 /* Reverse the order of elements in the chain T,
2849 and return the new head of the chain (old last element). */
2854 tree prev
= 0, decl
, next
;
2855 for (decl
= t
; decl
; decl
= next
)
2857 /* We shouldn't be using this function to reverse BLOCK chains; we
2858 have blocks_nreverse for that. */
2859 gcc_checking_assert (TREE_CODE (decl
) != BLOCK
);
2860 next
= TREE_CHAIN (decl
);
2861 TREE_CHAIN (decl
) = prev
;
2867 /* Return a newly created TREE_LIST node whose
2868 purpose and value fields are PARM and VALUE. */
2871 build_tree_list_stat (tree parm
, tree value MEM_STAT_DECL
)
2873 tree t
= make_node_stat (TREE_LIST PASS_MEM_STAT
);
2874 TREE_PURPOSE (t
) = parm
;
2875 TREE_VALUE (t
) = value
;
2879 /* Build a chain of TREE_LIST nodes from a vector. */
2882 build_tree_list_vec_stat (const vec
<tree
, va_gc
> *vec MEM_STAT_DECL
)
2884 tree ret
= NULL_TREE
;
2888 FOR_EACH_VEC_SAFE_ELT (vec
, i
, t
)
2890 *pp
= build_tree_list_stat (NULL
, t PASS_MEM_STAT
);
2891 pp
= &TREE_CHAIN (*pp
);
2896 /* Return a newly created TREE_LIST node whose
2897 purpose and value fields are PURPOSE and VALUE
2898 and whose TREE_CHAIN is CHAIN. */
2901 tree_cons_stat (tree purpose
, tree value
, tree chain MEM_STAT_DECL
)
2905 node
= ggc_alloc_tree_node_stat (sizeof (struct tree_list
) PASS_MEM_STAT
);
2906 memset (node
, 0, sizeof (struct tree_common
));
2908 record_node_allocation_statistics (TREE_LIST
, sizeof (struct tree_list
));
2910 TREE_SET_CODE (node
, TREE_LIST
);
2911 TREE_CHAIN (node
) = chain
;
2912 TREE_PURPOSE (node
) = purpose
;
2913 TREE_VALUE (node
) = value
;
2917 /* Return the values of the elements of a CONSTRUCTOR as a vector of
2921 ctor_to_vec (tree ctor
)
2923 vec
<tree
, va_gc
> *vec
;
2924 vec_alloc (vec
, CONSTRUCTOR_NELTS (ctor
));
2928 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), ix
, val
)
2929 vec
->quick_push (val
);
2934 /* Return the size nominally occupied by an object of type TYPE
2935 when it resides in memory. The value is measured in units of bytes,
2936 and its data type is that normally used for type sizes
2937 (which is the first type created by make_signed_type or
2938 make_unsigned_type). */
2941 size_in_bytes_loc (location_t loc
, const_tree type
)
2945 if (type
== error_mark_node
)
2946 return integer_zero_node
;
2948 type
= TYPE_MAIN_VARIANT (type
);
2949 t
= TYPE_SIZE_UNIT (type
);
2953 lang_hooks
.types
.incomplete_type_error (loc
, NULL_TREE
, type
);
2954 return size_zero_node
;
2960 /* Return the size of TYPE (in bytes) as a wide integer
2961 or return -1 if the size can vary or is larger than an integer. */
2964 int_size_in_bytes (const_tree type
)
2968 if (type
== error_mark_node
)
2971 type
= TYPE_MAIN_VARIANT (type
);
2972 t
= TYPE_SIZE_UNIT (type
);
2974 if (t
&& tree_fits_uhwi_p (t
))
2975 return TREE_INT_CST_LOW (t
);
2980 /* Return the maximum size of TYPE (in bytes) as a wide integer
2981 or return -1 if the size can vary or is larger than an integer. */
2984 max_int_size_in_bytes (const_tree type
)
2986 HOST_WIDE_INT size
= -1;
2989 /* If this is an array type, check for a possible MAX_SIZE attached. */
2991 if (TREE_CODE (type
) == ARRAY_TYPE
)
2993 size_tree
= TYPE_ARRAY_MAX_SIZE (type
);
2995 if (size_tree
&& tree_fits_uhwi_p (size_tree
))
2996 size
= tree_to_uhwi (size_tree
);
2999 /* If we still haven't been able to get a size, see if the language
3000 can compute a maximum size. */
3004 size_tree
= lang_hooks
.types
.max_size (type
);
3006 if (size_tree
&& tree_fits_uhwi_p (size_tree
))
3007 size
= tree_to_uhwi (size_tree
);
3013 /* Return the bit position of FIELD, in bits from the start of the record.
3014 This is a tree of type bitsizetype. */
3017 bit_position (const_tree field
)
3019 return bit_from_pos (DECL_FIELD_OFFSET (field
),
3020 DECL_FIELD_BIT_OFFSET (field
));
3023 /* Return the byte position of FIELD, in bytes from the start of the record.
3024 This is a tree of type sizetype. */
3027 byte_position (const_tree field
)
3029 return byte_from_pos (DECL_FIELD_OFFSET (field
),
3030 DECL_FIELD_BIT_OFFSET (field
));
3033 /* Likewise, but return as an integer. It must be representable in
3034 that way (since it could be a signed value, we don't have the
3035 option of returning -1 like int_size_in_byte can. */
3038 int_byte_position (const_tree field
)
3040 return tree_to_shwi (byte_position (field
));
3043 /* Return the strictest alignment, in bits, that T is known to have. */
3046 expr_align (const_tree t
)
3048 unsigned int align0
, align1
;
3050 switch (TREE_CODE (t
))
3052 CASE_CONVERT
: case NON_LVALUE_EXPR
:
3053 /* If we have conversions, we know that the alignment of the
3054 object must meet each of the alignments of the types. */
3055 align0
= expr_align (TREE_OPERAND (t
, 0));
3056 align1
= TYPE_ALIGN (TREE_TYPE (t
));
3057 return MAX (align0
, align1
);
3059 case SAVE_EXPR
: case COMPOUND_EXPR
: case MODIFY_EXPR
:
3060 case INIT_EXPR
: case TARGET_EXPR
: case WITH_CLEANUP_EXPR
:
3061 case CLEANUP_POINT_EXPR
:
3062 /* These don't change the alignment of an object. */
3063 return expr_align (TREE_OPERAND (t
, 0));
3066 /* The best we can do is say that the alignment is the least aligned
3068 align0
= expr_align (TREE_OPERAND (t
, 1));
3069 align1
= expr_align (TREE_OPERAND (t
, 2));
3070 return MIN (align0
, align1
);
3072 /* FIXME: LABEL_DECL and CONST_DECL never have DECL_ALIGN set
3073 meaningfully, it's always 1. */
3074 case LABEL_DECL
: case CONST_DECL
:
3075 case VAR_DECL
: case PARM_DECL
: case RESULT_DECL
:
3077 gcc_assert (DECL_ALIGN (t
) != 0);
3078 return DECL_ALIGN (t
);
3084 /* Otherwise take the alignment from that of the type. */
3085 return TYPE_ALIGN (TREE_TYPE (t
));
3088 /* Return, as a tree node, the number of elements for TYPE (which is an
3089 ARRAY_TYPE) minus one. This counts only elements of the top array. */
3092 array_type_nelts (const_tree type
)
3094 tree index_type
, min
, max
;
3096 /* If they did it with unspecified bounds, then we should have already
3097 given an error about it before we got here. */
3098 if (! TYPE_DOMAIN (type
))
3099 return error_mark_node
;
3101 index_type
= TYPE_DOMAIN (type
);
3102 min
= TYPE_MIN_VALUE (index_type
);
3103 max
= TYPE_MAX_VALUE (index_type
);
3105 /* TYPE_MAX_VALUE may not be set if the array has unknown length. */
3107 return error_mark_node
;
3109 return (integer_zerop (min
)
3111 : fold_build2 (MINUS_EXPR
, TREE_TYPE (max
), max
, min
));
3114 /* If arg is static -- a reference to an object in static storage -- then
3115 return the object. This is not the same as the C meaning of `static'.
3116 If arg isn't static, return NULL. */
3121 switch (TREE_CODE (arg
))
3124 /* Nested functions are static, even though taking their address will
3125 involve a trampoline as we unnest the nested function and create
3126 the trampoline on the tree level. */
3130 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
3131 && ! DECL_THREAD_LOCAL_P (arg
)
3132 && ! DECL_DLLIMPORT_P (arg
)
3136 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
3140 return TREE_STATIC (arg
) ? arg
: NULL
;
3147 /* If the thing being referenced is not a field, then it is
3148 something language specific. */
3149 gcc_assert (TREE_CODE (TREE_OPERAND (arg
, 1)) == FIELD_DECL
);
3151 /* If we are referencing a bitfield, we can't evaluate an
3152 ADDR_EXPR at compile time and so it isn't a constant. */
3153 if (DECL_BIT_FIELD (TREE_OPERAND (arg
, 1)))
3156 return staticp (TREE_OPERAND (arg
, 0));
3162 return TREE_CONSTANT (TREE_OPERAND (arg
, 0)) ? arg
: NULL
;
3165 case ARRAY_RANGE_REF
:
3166 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg
))) == INTEGER_CST
3167 && TREE_CODE (TREE_OPERAND (arg
, 1)) == INTEGER_CST
)
3168 return staticp (TREE_OPERAND (arg
, 0));
3172 case COMPOUND_LITERAL_EXPR
:
3173 return TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (arg
)) ? arg
: NULL
;
3183 /* Return whether OP is a DECL whose address is function-invariant. */
3186 decl_address_invariant_p (const_tree op
)
3188 /* The conditions below are slightly less strict than the one in
3191 switch (TREE_CODE (op
))
3200 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
3201 || DECL_THREAD_LOCAL_P (op
)
3202 || DECL_CONTEXT (op
) == current_function_decl
3203 || decl_function_context (op
) == current_function_decl
)
3208 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
3209 || decl_function_context (op
) == current_function_decl
)
3220 /* Return whether OP is a DECL whose address is interprocedural-invariant. */
3223 decl_address_ip_invariant_p (const_tree op
)
3225 /* The conditions below are slightly less strict than the one in
3228 switch (TREE_CODE (op
))
3236 if (((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
3237 && !DECL_DLLIMPORT_P (op
))
3238 || DECL_THREAD_LOCAL_P (op
))
3243 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
)))
3255 /* Return true if T is function-invariant (internal function, does
3256 not handle arithmetic; that's handled in skip_simple_arithmetic and
3257 tree_invariant_p). */
3260 tree_invariant_p_1 (tree t
)
3264 if (TREE_CONSTANT (t
)
3265 || (TREE_READONLY (t
) && !TREE_SIDE_EFFECTS (t
)))
3268 switch (TREE_CODE (t
))
3274 op
= TREE_OPERAND (t
, 0);
3275 while (handled_component_p (op
))
3277 switch (TREE_CODE (op
))
3280 case ARRAY_RANGE_REF
:
3281 if (!tree_invariant_p (TREE_OPERAND (op
, 1))
3282 || TREE_OPERAND (op
, 2) != NULL_TREE
3283 || TREE_OPERAND (op
, 3) != NULL_TREE
)
3288 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
3294 op
= TREE_OPERAND (op
, 0);
3297 return CONSTANT_CLASS_P (op
) || decl_address_invariant_p (op
);
3306 /* Return true if T is function-invariant. */
3309 tree_invariant_p (tree t
)
3311 tree inner
= skip_simple_arithmetic (t
);
3312 return tree_invariant_p_1 (inner
);
3315 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
3316 Do this to any expression which may be used in more than one place,
3317 but must be evaluated only once.
3319 Normally, expand_expr would reevaluate the expression each time.
3320 Calling save_expr produces something that is evaluated and recorded
3321 the first time expand_expr is called on it. Subsequent calls to
3322 expand_expr just reuse the recorded value.
3324 The call to expand_expr that generates code that actually computes
3325 the value is the first call *at compile time*. Subsequent calls
3326 *at compile time* generate code to use the saved value.
3327 This produces correct result provided that *at run time* control
3328 always flows through the insns made by the first expand_expr
3329 before reaching the other places where the save_expr was evaluated.
3330 You, the caller of save_expr, must make sure this is so.
3332 Constants, and certain read-only nodes, are returned with no
3333 SAVE_EXPR because that is safe. Expressions containing placeholders
3334 are not touched; see tree.def for an explanation of what these
3338 save_expr (tree expr
)
3340 tree t
= fold (expr
);
3343 /* If the tree evaluates to a constant, then we don't want to hide that
3344 fact (i.e. this allows further folding, and direct checks for constants).
3345 However, a read-only object that has side effects cannot be bypassed.
3346 Since it is no problem to reevaluate literals, we just return the
3348 inner
= skip_simple_arithmetic (t
);
3349 if (TREE_CODE (inner
) == ERROR_MARK
)
3352 if (tree_invariant_p_1 (inner
))
3355 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
3356 it means that the size or offset of some field of an object depends on
3357 the value within another field.
3359 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
3360 and some variable since it would then need to be both evaluated once and
3361 evaluated more than once. Front-ends must assure this case cannot
3362 happen by surrounding any such subexpressions in their own SAVE_EXPR
3363 and forcing evaluation at the proper time. */
3364 if (contains_placeholder_p (inner
))
3367 t
= build1 (SAVE_EXPR
, TREE_TYPE (expr
), t
);
3368 SET_EXPR_LOCATION (t
, EXPR_LOCATION (expr
));
3370 /* This expression might be placed ahead of a jump to ensure that the
3371 value was computed on both sides of the jump. So make sure it isn't
3372 eliminated as dead. */
3373 TREE_SIDE_EFFECTS (t
) = 1;
3377 /* Look inside EXPR into any simple arithmetic operations. Return the
3378 outermost non-arithmetic or non-invariant node. */
3381 skip_simple_arithmetic (tree expr
)
3383 /* We don't care about whether this can be used as an lvalue in this
3385 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
3386 expr
= TREE_OPERAND (expr
, 0);
3388 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
3389 a constant, it will be more efficient to not make another SAVE_EXPR since
3390 it will allow better simplification and GCSE will be able to merge the
3391 computations if they actually occur. */
3394 if (UNARY_CLASS_P (expr
))
3395 expr
= TREE_OPERAND (expr
, 0);
3396 else if (BINARY_CLASS_P (expr
))
3398 if (tree_invariant_p (TREE_OPERAND (expr
, 1)))
3399 expr
= TREE_OPERAND (expr
, 0);
3400 else if (tree_invariant_p (TREE_OPERAND (expr
, 0)))
3401 expr
= TREE_OPERAND (expr
, 1);
3412 /* Look inside EXPR into simple arithmetic operations involving constants.
3413 Return the outermost non-arithmetic or non-constant node. */
3416 skip_simple_constant_arithmetic (tree expr
)
3418 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
3419 expr
= TREE_OPERAND (expr
, 0);
3423 if (UNARY_CLASS_P (expr
))
3424 expr
= TREE_OPERAND (expr
, 0);
3425 else if (BINARY_CLASS_P (expr
))
3427 if (TREE_CONSTANT (TREE_OPERAND (expr
, 1)))
3428 expr
= TREE_OPERAND (expr
, 0);
3429 else if (TREE_CONSTANT (TREE_OPERAND (expr
, 0)))
3430 expr
= TREE_OPERAND (expr
, 1);
3441 /* Return which tree structure is used by T. */
3443 enum tree_node_structure_enum
3444 tree_node_structure (const_tree t
)
3446 const enum tree_code code
= TREE_CODE (t
);
3447 return tree_node_structure_for_code (code
);
3450 /* Set various status flags when building a CALL_EXPR object T. */
3453 process_call_operands (tree t
)
3455 bool side_effects
= TREE_SIDE_EFFECTS (t
);
3456 bool read_only
= false;
3457 int i
= call_expr_flags (t
);
3459 /* Calls have side-effects, except those to const or pure functions. */
3460 if ((i
& ECF_LOOPING_CONST_OR_PURE
) || !(i
& (ECF_CONST
| ECF_PURE
)))
3461 side_effects
= true;
3462 /* Propagate TREE_READONLY of arguments for const functions. */
3466 if (!side_effects
|| read_only
)
3467 for (i
= 1; i
< TREE_OPERAND_LENGTH (t
); i
++)
3469 tree op
= TREE_OPERAND (t
, i
);
3470 if (op
&& TREE_SIDE_EFFECTS (op
))
3471 side_effects
= true;
3472 if (op
&& !TREE_READONLY (op
) && !CONSTANT_CLASS_P (op
))
3476 TREE_SIDE_EFFECTS (t
) = side_effects
;
3477 TREE_READONLY (t
) = read_only
;
3480 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
3481 size or offset that depends on a field within a record. */
3484 contains_placeholder_p (const_tree exp
)
3486 enum tree_code code
;
3491 code
= TREE_CODE (exp
);
3492 if (code
== PLACEHOLDER_EXPR
)
3495 switch (TREE_CODE_CLASS (code
))
3498 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
3499 position computations since they will be converted into a
3500 WITH_RECORD_EXPR involving the reference, which will assume
3501 here will be valid. */
3502 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
3504 case tcc_exceptional
:
3505 if (code
== TREE_LIST
)
3506 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp
))
3507 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp
)));
3512 case tcc_comparison
:
3513 case tcc_expression
:
3517 /* Ignoring the first operand isn't quite right, but works best. */
3518 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1));
3521 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
3522 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1))
3523 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 2)));
3526 /* The save_expr function never wraps anything containing
3527 a PLACEHOLDER_EXPR. */
3534 switch (TREE_CODE_LENGTH (code
))
3537 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
3539 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
3540 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1)));
3551 const_call_expr_arg_iterator iter
;
3552 FOR_EACH_CONST_CALL_EXPR_ARG (arg
, iter
, exp
)
3553 if (CONTAINS_PLACEHOLDER_P (arg
))
3567 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
3568 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
3572 type_contains_placeholder_1 (const_tree type
)
3574 /* If the size contains a placeholder or the parent type (component type in
3575 the case of arrays) type involves a placeholder, this type does. */
3576 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type
))
3577 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type
))
3578 || (!POINTER_TYPE_P (type
)
3580 && type_contains_placeholder_p (TREE_TYPE (type
))))
3583 /* Now do type-specific checks. Note that the last part of the check above
3584 greatly limits what we have to do below. */
3585 switch (TREE_CODE (type
))
3588 case POINTER_BOUNDS_TYPE
:
3594 case REFERENCE_TYPE
:
3603 case FIXED_POINT_TYPE
:
3604 /* Here we just check the bounds. */
3605 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type
))
3606 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type
)));
3609 /* We have already checked the component type above, so just check
3610 the domain type. Flexible array members have a null domain. */
3611 return TYPE_DOMAIN (type
) ?
3612 type_contains_placeholder_p (TYPE_DOMAIN (type
)) : false;
3616 case QUAL_UNION_TYPE
:
3620 for (field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
3621 if (TREE_CODE (field
) == FIELD_DECL
3622 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field
))
3623 || (TREE_CODE (type
) == QUAL_UNION_TYPE
3624 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field
)))
3625 || type_contains_placeholder_p (TREE_TYPE (field
))))
3636 /* Wrapper around above function used to cache its result. */
3639 type_contains_placeholder_p (tree type
)
3643 /* If the contains_placeholder_bits field has been initialized,
3644 then we know the answer. */
3645 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) > 0)
3646 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) - 1;
3648 /* Indicate that we've seen this type node, and the answer is false.
3649 This is what we want to return if we run into recursion via fields. */
3650 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = 1;
3652 /* Compute the real value. */
3653 result
= type_contains_placeholder_1 (type
);
3655 /* Store the real value. */
3656 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = result
+ 1;
3661 /* Push tree EXP onto vector QUEUE if it is not already present. */
3664 push_without_duplicates (tree exp
, vec
<tree
> *queue
)
3669 FOR_EACH_VEC_ELT (*queue
, i
, iter
)
3670 if (simple_cst_equal (iter
, exp
) == 1)
3674 queue
->safe_push (exp
);
3677 /* Given a tree EXP, find all occurrences of references to fields
3678 in a PLACEHOLDER_EXPR and place them in vector REFS without
3679 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
3680 we assume here that EXP contains only arithmetic expressions
3681 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
3685 find_placeholder_in_expr (tree exp
, vec
<tree
> *refs
)
3687 enum tree_code code
= TREE_CODE (exp
);
3691 /* We handle TREE_LIST and COMPONENT_REF separately. */
3692 if (code
== TREE_LIST
)
3694 FIND_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), refs
);
3695 FIND_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), refs
);
3697 else if (code
== COMPONENT_REF
)
3699 for (inner
= TREE_OPERAND (exp
, 0);
3700 REFERENCE_CLASS_P (inner
);
3701 inner
= TREE_OPERAND (inner
, 0))
3704 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
)
3705 push_without_duplicates (exp
, refs
);
3707 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), refs
);
3710 switch (TREE_CODE_CLASS (code
))
3715 case tcc_declaration
:
3716 /* Variables allocated to static storage can stay. */
3717 if (!TREE_STATIC (exp
))
3718 push_without_duplicates (exp
, refs
);
3721 case tcc_expression
:
3722 /* This is the pattern built in ada/make_aligning_type. */
3723 if (code
== ADDR_EXPR
3724 && TREE_CODE (TREE_OPERAND (exp
, 0)) == PLACEHOLDER_EXPR
)
3726 push_without_duplicates (exp
, refs
);
3732 case tcc_exceptional
:
3735 case tcc_comparison
:
3737 for (i
= 0; i
< TREE_CODE_LENGTH (code
); i
++)
3738 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
3742 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3743 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
3751 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
3752 return a tree with all occurrences of references to F in a
3753 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
3754 CONST_DECLs. Note that we assume here that EXP contains only
3755 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
3756 occurring only in their argument list. */
3759 substitute_in_expr (tree exp
, tree f
, tree r
)
3761 enum tree_code code
= TREE_CODE (exp
);
3762 tree op0
, op1
, op2
, op3
;
3765 /* We handle TREE_LIST and COMPONENT_REF separately. */
3766 if (code
== TREE_LIST
)
3768 op0
= SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp
), f
, r
);
3769 op1
= SUBSTITUTE_IN_EXPR (TREE_VALUE (exp
), f
, r
);
3770 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
3773 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
3775 else if (code
== COMPONENT_REF
)
3779 /* If this expression is getting a value from a PLACEHOLDER_EXPR
3780 and it is the right field, replace it with R. */
3781 for (inner
= TREE_OPERAND (exp
, 0);
3782 REFERENCE_CLASS_P (inner
);
3783 inner
= TREE_OPERAND (inner
, 0))
3787 op1
= TREE_OPERAND (exp
, 1);
3789 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& op1
== f
)
3792 /* If this expression hasn't been completed let, leave it alone. */
3793 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& !TREE_TYPE (inner
))
3796 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3797 if (op0
== TREE_OPERAND (exp
, 0))
3801 = fold_build3 (COMPONENT_REF
, TREE_TYPE (exp
), op0
, op1
, NULL_TREE
);
3804 switch (TREE_CODE_CLASS (code
))
3809 case tcc_declaration
:
3815 case tcc_expression
:
3821 case tcc_exceptional
:
3824 case tcc_comparison
:
3826 switch (TREE_CODE_LENGTH (code
))
3832 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3833 if (op0
== TREE_OPERAND (exp
, 0))
3836 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
3840 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3841 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3843 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
3846 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
3850 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3851 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3852 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
3854 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3855 && op2
== TREE_OPERAND (exp
, 2))
3858 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
3862 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3863 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3864 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
3865 op3
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 3), f
, r
);
3867 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3868 && op2
== TREE_OPERAND (exp
, 2)
3869 && op3
== TREE_OPERAND (exp
, 3))
3873 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
3885 new_tree
= NULL_TREE
;
3887 /* If we are trying to replace F with a constant or with another
3888 instance of one of the arguments of the call, inline back
3889 functions which do nothing else than computing a value from
3890 the arguments they are passed. This makes it possible to
3891 fold partially or entirely the replacement expression. */
3892 if (code
== CALL_EXPR
)
3894 bool maybe_inline
= false;
3895 if (CONSTANT_CLASS_P (r
))
3896 maybe_inline
= true;
3898 for (i
= 3; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3899 if (operand_equal_p (TREE_OPERAND (exp
, i
), r
, 0))
3901 maybe_inline
= true;
3906 tree t
= maybe_inline_call_in_expr (exp
);
3908 return SUBSTITUTE_IN_EXPR (t
, f
, r
);
3912 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3914 tree op
= TREE_OPERAND (exp
, i
);
3915 tree new_op
= SUBSTITUTE_IN_EXPR (op
, f
, r
);
3919 new_tree
= copy_node (exp
);
3920 TREE_OPERAND (new_tree
, i
) = new_op
;
3926 new_tree
= fold (new_tree
);
3927 if (TREE_CODE (new_tree
) == CALL_EXPR
)
3928 process_call_operands (new_tree
);
3939 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
3941 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
3942 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
3947 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
3948 for it within OBJ, a tree that is an object or a chain of references. */
3951 substitute_placeholder_in_expr (tree exp
, tree obj
)
3953 enum tree_code code
= TREE_CODE (exp
);
3954 tree op0
, op1
, op2
, op3
;
3957 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
3958 in the chain of OBJ. */
3959 if (code
== PLACEHOLDER_EXPR
)
3961 tree need_type
= TYPE_MAIN_VARIANT (TREE_TYPE (exp
));
3964 for (elt
= obj
; elt
!= 0;
3965 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
3966 || TREE_CODE (elt
) == COND_EXPR
)
3967 ? TREE_OPERAND (elt
, 1)
3968 : (REFERENCE_CLASS_P (elt
)
3969 || UNARY_CLASS_P (elt
)
3970 || BINARY_CLASS_P (elt
)
3971 || VL_EXP_CLASS_P (elt
)
3972 || EXPRESSION_CLASS_P (elt
))
3973 ? TREE_OPERAND (elt
, 0) : 0))
3974 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt
)) == need_type
)
3977 for (elt
= obj
; elt
!= 0;
3978 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
3979 || TREE_CODE (elt
) == COND_EXPR
)
3980 ? TREE_OPERAND (elt
, 1)
3981 : (REFERENCE_CLASS_P (elt
)
3982 || UNARY_CLASS_P (elt
)
3983 || BINARY_CLASS_P (elt
)
3984 || VL_EXP_CLASS_P (elt
)
3985 || EXPRESSION_CLASS_P (elt
))
3986 ? TREE_OPERAND (elt
, 0) : 0))
3987 if (POINTER_TYPE_P (TREE_TYPE (elt
))
3988 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt
)))
3990 return fold_build1 (INDIRECT_REF
, need_type
, elt
);
3992 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
3993 survives until RTL generation, there will be an error. */
3997 /* TREE_LIST is special because we need to look at TREE_VALUE
3998 and TREE_CHAIN, not TREE_OPERANDS. */
3999 else if (code
== TREE_LIST
)
4001 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), obj
);
4002 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), obj
);
4003 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
4006 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
4009 switch (TREE_CODE_CLASS (code
))
4012 case tcc_declaration
:
4015 case tcc_exceptional
:
4018 case tcc_comparison
:
4019 case tcc_expression
:
4022 switch (TREE_CODE_LENGTH (code
))
4028 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
4029 if (op0
== TREE_OPERAND (exp
, 0))
4032 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
4036 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
4037 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
4039 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
4042 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
4046 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
4047 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
4048 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
4050 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
4051 && op2
== TREE_OPERAND (exp
, 2))
4054 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
4058 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
4059 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
4060 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
4061 op3
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 3), obj
);
4063 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
4064 && op2
== TREE_OPERAND (exp
, 2)
4065 && op3
== TREE_OPERAND (exp
, 3))
4069 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
4081 new_tree
= NULL_TREE
;
4083 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
4085 tree op
= TREE_OPERAND (exp
, i
);
4086 tree new_op
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (op
, obj
);
4090 new_tree
= copy_node (exp
);
4091 TREE_OPERAND (new_tree
, i
) = new_op
;
4097 new_tree
= fold (new_tree
);
4098 if (TREE_CODE (new_tree
) == CALL_EXPR
)
4099 process_call_operands (new_tree
);
4110 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
4112 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
4113 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
4119 /* Subroutine of stabilize_reference; this is called for subtrees of
4120 references. Any expression with side-effects must be put in a SAVE_EXPR
4121 to ensure that it is only evaluated once.
4123 We don't put SAVE_EXPR nodes around everything, because assigning very
4124 simple expressions to temporaries causes us to miss good opportunities
4125 for optimizations. Among other things, the opportunity to fold in the
4126 addition of a constant into an addressing mode often gets lost, e.g.
4127 "y[i+1] += x;". In general, we take the approach that we should not make
4128 an assignment unless we are forced into it - i.e., that any non-side effect
4129 operator should be allowed, and that cse should take care of coalescing
4130 multiple utterances of the same expression should that prove fruitful. */
4133 stabilize_reference_1 (tree e
)
4136 enum tree_code code
= TREE_CODE (e
);
4138 /* We cannot ignore const expressions because it might be a reference
4139 to a const array but whose index contains side-effects. But we can
4140 ignore things that are actual constant or that already have been
4141 handled by this function. */
4143 if (tree_invariant_p (e
))
4146 switch (TREE_CODE_CLASS (code
))
4148 case tcc_exceptional
:
4150 case tcc_declaration
:
4151 case tcc_comparison
:
4153 case tcc_expression
:
4156 /* If the expression has side-effects, then encase it in a SAVE_EXPR
4157 so that it will only be evaluated once. */
4158 /* The reference (r) and comparison (<) classes could be handled as
4159 below, but it is generally faster to only evaluate them once. */
4160 if (TREE_SIDE_EFFECTS (e
))
4161 return save_expr (e
);
4165 /* Constants need no processing. In fact, we should never reach
4170 /* Division is slow and tends to be compiled with jumps,
4171 especially the division by powers of 2 that is often
4172 found inside of an array reference. So do it just once. */
4173 if (code
== TRUNC_DIV_EXPR
|| code
== TRUNC_MOD_EXPR
4174 || code
== FLOOR_DIV_EXPR
|| code
== FLOOR_MOD_EXPR
4175 || code
== CEIL_DIV_EXPR
|| code
== CEIL_MOD_EXPR
4176 || code
== ROUND_DIV_EXPR
|| code
== ROUND_MOD_EXPR
)
4177 return save_expr (e
);
4178 /* Recursively stabilize each operand. */
4179 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)),
4180 stabilize_reference_1 (TREE_OPERAND (e
, 1)));
4184 /* Recursively stabilize each operand. */
4185 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)));
4192 TREE_TYPE (result
) = TREE_TYPE (e
);
4193 TREE_READONLY (result
) = TREE_READONLY (e
);
4194 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (e
);
4195 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (e
);
4200 /* Stabilize a reference so that we can use it any number of times
4201 without causing its operands to be evaluated more than once.
4202 Returns the stabilized reference. This works by means of save_expr,
4203 so see the caveats in the comments about save_expr.
4205 Also allows conversion expressions whose operands are references.
4206 Any other kind of expression is returned unchanged. */
4209 stabilize_reference (tree ref
)
4212 enum tree_code code
= TREE_CODE (ref
);
4219 /* No action is needed in this case. */
4224 case FIX_TRUNC_EXPR
:
4225 result
= build_nt (code
, stabilize_reference (TREE_OPERAND (ref
, 0)));
4229 result
= build_nt (INDIRECT_REF
,
4230 stabilize_reference_1 (TREE_OPERAND (ref
, 0)));
4234 result
= build_nt (COMPONENT_REF
,
4235 stabilize_reference (TREE_OPERAND (ref
, 0)),
4236 TREE_OPERAND (ref
, 1), NULL_TREE
);
4240 result
= build_nt (BIT_FIELD_REF
,
4241 stabilize_reference (TREE_OPERAND (ref
, 0)),
4242 TREE_OPERAND (ref
, 1), TREE_OPERAND (ref
, 2));
4243 REF_REVERSE_STORAGE_ORDER (result
) = REF_REVERSE_STORAGE_ORDER (ref
);
4247 result
= build_nt (ARRAY_REF
,
4248 stabilize_reference (TREE_OPERAND (ref
, 0)),
4249 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
4250 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
4253 case ARRAY_RANGE_REF
:
4254 result
= build_nt (ARRAY_RANGE_REF
,
4255 stabilize_reference (TREE_OPERAND (ref
, 0)),
4256 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
4257 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
4261 /* We cannot wrap the first expression in a SAVE_EXPR, as then
4262 it wouldn't be ignored. This matters when dealing with
4264 return stabilize_reference_1 (ref
);
4266 /* If arg isn't a kind of lvalue we recognize, make no change.
4267 Caller should recognize the error for an invalid lvalue. */
4272 return error_mark_node
;
4275 TREE_TYPE (result
) = TREE_TYPE (ref
);
4276 TREE_READONLY (result
) = TREE_READONLY (ref
);
4277 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (ref
);
4278 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (ref
);
4283 /* Low-level constructors for expressions. */
4285 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
4286 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
4289 recompute_tree_invariant_for_addr_expr (tree t
)
4292 bool tc
= true, se
= false;
4294 gcc_assert (TREE_CODE (t
) == ADDR_EXPR
);
4296 /* We started out assuming this address is both invariant and constant, but
4297 does not have side effects. Now go down any handled components and see if
4298 any of them involve offsets that are either non-constant or non-invariant.
4299 Also check for side-effects.
4301 ??? Note that this code makes no attempt to deal with the case where
4302 taking the address of something causes a copy due to misalignment. */
4304 #define UPDATE_FLAGS(NODE) \
4305 do { tree _node = (NODE); \
4306 if (_node && !TREE_CONSTANT (_node)) tc = false; \
4307 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
4309 for (node
= TREE_OPERAND (t
, 0); handled_component_p (node
);
4310 node
= TREE_OPERAND (node
, 0))
4312 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
4313 array reference (probably made temporarily by the G++ front end),
4314 so ignore all the operands. */
4315 if ((TREE_CODE (node
) == ARRAY_REF
4316 || TREE_CODE (node
) == ARRAY_RANGE_REF
)
4317 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node
, 0))) == ARRAY_TYPE
)
4319 UPDATE_FLAGS (TREE_OPERAND (node
, 1));
4320 if (TREE_OPERAND (node
, 2))
4321 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
4322 if (TREE_OPERAND (node
, 3))
4323 UPDATE_FLAGS (TREE_OPERAND (node
, 3));
4325 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
4326 FIELD_DECL, apparently. The G++ front end can put something else
4327 there, at least temporarily. */
4328 else if (TREE_CODE (node
) == COMPONENT_REF
4329 && TREE_CODE (TREE_OPERAND (node
, 1)) == FIELD_DECL
)
4331 if (TREE_OPERAND (node
, 2))
4332 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
4336 node
= lang_hooks
.expr_to_decl (node
, &tc
, &se
);
4338 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
4339 the address, since &(*a)->b is a form of addition. If it's a constant, the
4340 address is constant too. If it's a decl, its address is constant if the
4341 decl is static. Everything else is not constant and, furthermore,
4342 taking the address of a volatile variable is not volatile. */
4343 if (TREE_CODE (node
) == INDIRECT_REF
4344 || TREE_CODE (node
) == MEM_REF
)
4345 UPDATE_FLAGS (TREE_OPERAND (node
, 0));
4346 else if (CONSTANT_CLASS_P (node
))
4348 else if (DECL_P (node
))
4349 tc
&= (staticp (node
) != NULL_TREE
);
4353 se
|= TREE_SIDE_EFFECTS (node
);
4357 TREE_CONSTANT (t
) = tc
;
4358 TREE_SIDE_EFFECTS (t
) = se
;
4362 /* Build an expression of code CODE, data type TYPE, and operands as
4363 specified. Expressions and reference nodes can be created this way.
4364 Constants, decls, types and misc nodes cannot be.
4366 We define 5 non-variadic functions, from 0 to 4 arguments. This is
4367 enough for all extant tree codes. */
4370 build0_stat (enum tree_code code
, tree tt MEM_STAT_DECL
)
4374 gcc_assert (TREE_CODE_LENGTH (code
) == 0);
4376 t
= make_node_stat (code PASS_MEM_STAT
);
4383 build1_stat (enum tree_code code
, tree type
, tree node MEM_STAT_DECL
)
4385 int length
= sizeof (struct tree_exp
);
4388 record_node_allocation_statistics (code
, length
);
4390 gcc_assert (TREE_CODE_LENGTH (code
) == 1);
4392 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
4394 memset (t
, 0, sizeof (struct tree_common
));
4396 TREE_SET_CODE (t
, code
);
4398 TREE_TYPE (t
) = type
;
4399 SET_EXPR_LOCATION (t
, UNKNOWN_LOCATION
);
4400 TREE_OPERAND (t
, 0) = node
;
4401 if (node
&& !TYPE_P (node
))
4403 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (node
);
4404 TREE_READONLY (t
) = TREE_READONLY (node
);
4407 if (TREE_CODE_CLASS (code
) == tcc_statement
)
4408 TREE_SIDE_EFFECTS (t
) = 1;
4412 /* All of these have side-effects, no matter what their
4414 TREE_SIDE_EFFECTS (t
) = 1;
4415 TREE_READONLY (t
) = 0;
4419 /* Whether a dereference is readonly has nothing to do with whether
4420 its operand is readonly. */
4421 TREE_READONLY (t
) = 0;
4426 recompute_tree_invariant_for_addr_expr (t
);
4430 if ((TREE_CODE_CLASS (code
) == tcc_unary
|| code
== VIEW_CONVERT_EXPR
)
4431 && node
&& !TYPE_P (node
)
4432 && TREE_CONSTANT (node
))
4433 TREE_CONSTANT (t
) = 1;
4434 if (TREE_CODE_CLASS (code
) == tcc_reference
4435 && node
&& TREE_THIS_VOLATILE (node
))
4436 TREE_THIS_VOLATILE (t
) = 1;
4443 #define PROCESS_ARG(N) \
4445 TREE_OPERAND (t, N) = arg##N; \
4446 if (arg##N &&!TYPE_P (arg##N)) \
4448 if (TREE_SIDE_EFFECTS (arg##N)) \
4450 if (!TREE_READONLY (arg##N) \
4451 && !CONSTANT_CLASS_P (arg##N)) \
4452 (void) (read_only = 0); \
4453 if (!TREE_CONSTANT (arg##N)) \
4454 (void) (constant = 0); \
4459 build2_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1 MEM_STAT_DECL
)
4461 bool constant
, read_only
, side_effects
;
4464 gcc_assert (TREE_CODE_LENGTH (code
) == 2);
4466 if ((code
== MINUS_EXPR
|| code
== PLUS_EXPR
|| code
== MULT_EXPR
)
4467 && arg0
&& arg1
&& tt
&& POINTER_TYPE_P (tt
)
4468 /* When sizetype precision doesn't match that of pointers
4469 we need to be able to build explicit extensions or truncations
4470 of the offset argument. */
4471 && TYPE_PRECISION (sizetype
) == TYPE_PRECISION (tt
))
4472 gcc_assert (TREE_CODE (arg0
) == INTEGER_CST
4473 && TREE_CODE (arg1
) == INTEGER_CST
);
4475 if (code
== POINTER_PLUS_EXPR
&& arg0
&& arg1
&& tt
)
4476 gcc_assert (POINTER_TYPE_P (tt
) && POINTER_TYPE_P (TREE_TYPE (arg0
))
4477 && ptrofftype_p (TREE_TYPE (arg1
)));
4479 t
= make_node_stat (code PASS_MEM_STAT
);
4482 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
4483 result based on those same flags for the arguments. But if the
4484 arguments aren't really even `tree' expressions, we shouldn't be trying
4487 /* Expressions without side effects may be constant if their
4488 arguments are as well. */
4489 constant
= (TREE_CODE_CLASS (code
) == tcc_comparison
4490 || TREE_CODE_CLASS (code
) == tcc_binary
);
4492 side_effects
= TREE_SIDE_EFFECTS (t
);
4497 TREE_SIDE_EFFECTS (t
) = side_effects
;
4498 if (code
== MEM_REF
)
4500 if (arg0
&& TREE_CODE (arg0
) == ADDR_EXPR
)
4502 tree o
= TREE_OPERAND (arg0
, 0);
4503 TREE_READONLY (t
) = TREE_READONLY (o
);
4504 TREE_THIS_VOLATILE (t
) = TREE_THIS_VOLATILE (o
);
4509 TREE_READONLY (t
) = read_only
;
4510 TREE_CONSTANT (t
) = constant
;
4511 TREE_THIS_VOLATILE (t
)
4512 = (TREE_CODE_CLASS (code
) == tcc_reference
4513 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4521 build3_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4522 tree arg2 MEM_STAT_DECL
)
4524 bool constant
, read_only
, side_effects
;
4527 gcc_assert (TREE_CODE_LENGTH (code
) == 3);
4528 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
4530 t
= make_node_stat (code PASS_MEM_STAT
);
4535 /* As a special exception, if COND_EXPR has NULL branches, we
4536 assume that it is a gimple statement and always consider
4537 it to have side effects. */
4538 if (code
== COND_EXPR
4539 && tt
== void_type_node
4540 && arg1
== NULL_TREE
4541 && arg2
== NULL_TREE
)
4542 side_effects
= true;
4544 side_effects
= TREE_SIDE_EFFECTS (t
);
4550 if (code
== COND_EXPR
)
4551 TREE_READONLY (t
) = read_only
;
4553 TREE_SIDE_EFFECTS (t
) = side_effects
;
4554 TREE_THIS_VOLATILE (t
)
4555 = (TREE_CODE_CLASS (code
) == tcc_reference
4556 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4562 build4_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4563 tree arg2
, tree arg3 MEM_STAT_DECL
)
4565 bool constant
, read_only
, side_effects
;
4568 gcc_assert (TREE_CODE_LENGTH (code
) == 4);
4570 t
= make_node_stat (code PASS_MEM_STAT
);
4573 side_effects
= TREE_SIDE_EFFECTS (t
);
4580 TREE_SIDE_EFFECTS (t
) = side_effects
;
4581 TREE_THIS_VOLATILE (t
)
4582 = (TREE_CODE_CLASS (code
) == tcc_reference
4583 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4589 build5_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4590 tree arg2
, tree arg3
, tree arg4 MEM_STAT_DECL
)
4592 bool constant
, read_only
, side_effects
;
4595 gcc_assert (TREE_CODE_LENGTH (code
) == 5);
4597 t
= make_node_stat (code PASS_MEM_STAT
);
4600 side_effects
= TREE_SIDE_EFFECTS (t
);
4608 TREE_SIDE_EFFECTS (t
) = side_effects
;
4609 if (code
== TARGET_MEM_REF
)
4611 if (arg0
&& TREE_CODE (arg0
) == ADDR_EXPR
)
4613 tree o
= TREE_OPERAND (arg0
, 0);
4614 TREE_READONLY (t
) = TREE_READONLY (o
);
4615 TREE_THIS_VOLATILE (t
) = TREE_THIS_VOLATILE (o
);
4619 TREE_THIS_VOLATILE (t
)
4620 = (TREE_CODE_CLASS (code
) == tcc_reference
4621 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4626 /* Build a simple MEM_REF tree with the sematics of a plain INDIRECT_REF
4627 on the pointer PTR. */
4630 build_simple_mem_ref_loc (location_t loc
, tree ptr
)
4632 HOST_WIDE_INT offset
= 0;
4633 tree ptype
= TREE_TYPE (ptr
);
4635 /* For convenience allow addresses that collapse to a simple base
4637 if (TREE_CODE (ptr
) == ADDR_EXPR
4638 && (handled_component_p (TREE_OPERAND (ptr
, 0))
4639 || TREE_CODE (TREE_OPERAND (ptr
, 0)) == MEM_REF
))
4641 ptr
= get_addr_base_and_unit_offset (TREE_OPERAND (ptr
, 0), &offset
);
4643 ptr
= build_fold_addr_expr (ptr
);
4644 gcc_assert (is_gimple_reg (ptr
) || is_gimple_min_invariant (ptr
));
4646 tem
= build2 (MEM_REF
, TREE_TYPE (ptype
),
4647 ptr
, build_int_cst (ptype
, offset
));
4648 SET_EXPR_LOCATION (tem
, loc
);
4652 /* Return the constant offset of a MEM_REF or TARGET_MEM_REF tree T. */
4655 mem_ref_offset (const_tree t
)
4657 return offset_int::from (TREE_OPERAND (t
, 1), SIGNED
);
4660 /* Return an invariant ADDR_EXPR of type TYPE taking the address of BASE
4661 offsetted by OFFSET units. */
4664 build_invariant_address (tree type
, tree base
, HOST_WIDE_INT offset
)
4666 tree ref
= fold_build2 (MEM_REF
, TREE_TYPE (type
),
4667 build_fold_addr_expr (base
),
4668 build_int_cst (ptr_type_node
, offset
));
4669 tree addr
= build1 (ADDR_EXPR
, type
, ref
);
4670 recompute_tree_invariant_for_addr_expr (addr
);
4674 /* Similar except don't specify the TREE_TYPE
4675 and leave the TREE_SIDE_EFFECTS as 0.
4676 It is permissible for arguments to be null,
4677 or even garbage if their values do not matter. */
4680 build_nt (enum tree_code code
, ...)
4687 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
4691 t
= make_node (code
);
4692 length
= TREE_CODE_LENGTH (code
);
4694 for (i
= 0; i
< length
; i
++)
4695 TREE_OPERAND (t
, i
) = va_arg (p
, tree
);
4701 /* Similar to build_nt, but for creating a CALL_EXPR object with a
4705 build_nt_call_vec (tree fn
, vec
<tree
, va_gc
> *args
)
4710 ret
= build_vl_exp (CALL_EXPR
, vec_safe_length (args
) + 3);
4711 CALL_EXPR_FN (ret
) = fn
;
4712 CALL_EXPR_STATIC_CHAIN (ret
) = NULL_TREE
;
4713 FOR_EACH_VEC_SAFE_ELT (args
, ix
, t
)
4714 CALL_EXPR_ARG (ret
, ix
) = t
;
4718 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
4719 We do NOT enter this node in any sort of symbol table.
4721 LOC is the location of the decl.
4723 layout_decl is used to set up the decl's storage layout.
4724 Other slots are initialized to 0 or null pointers. */
4727 build_decl_stat (location_t loc
, enum tree_code code
, tree name
,
4728 tree type MEM_STAT_DECL
)
4732 t
= make_node_stat (code PASS_MEM_STAT
);
4733 DECL_SOURCE_LOCATION (t
) = loc
;
4735 /* if (type == error_mark_node)
4736 type = integer_type_node; */
4737 /* That is not done, deliberately, so that having error_mark_node
4738 as the type can suppress useless errors in the use of this variable. */
4740 DECL_NAME (t
) = name
;
4741 TREE_TYPE (t
) = type
;
4743 if (code
== VAR_DECL
|| code
== PARM_DECL
|| code
== RESULT_DECL
)
4749 /* Builds and returns function declaration with NAME and TYPE. */
4752 build_fn_decl (const char *name
, tree type
)
4754 tree id
= get_identifier (name
);
4755 tree decl
= build_decl (input_location
, FUNCTION_DECL
, id
, type
);
4757 DECL_EXTERNAL (decl
) = 1;
4758 TREE_PUBLIC (decl
) = 1;
4759 DECL_ARTIFICIAL (decl
) = 1;
4760 TREE_NOTHROW (decl
) = 1;
4765 vec
<tree
, va_gc
> *all_translation_units
;
4767 /* Builds a new translation-unit decl with name NAME, queues it in the
4768 global list of translation-unit decls and returns it. */
4771 build_translation_unit_decl (tree name
)
4773 tree tu
= build_decl (UNKNOWN_LOCATION
, TRANSLATION_UNIT_DECL
,
4775 TRANSLATION_UNIT_LANGUAGE (tu
) = lang_hooks
.name
;
4776 vec_safe_push (all_translation_units
, tu
);
4781 /* BLOCK nodes are used to represent the structure of binding contours
4782 and declarations, once those contours have been exited and their contents
4783 compiled. This information is used for outputting debugging info. */
4786 build_block (tree vars
, tree subblocks
, tree supercontext
, tree chain
)
4788 tree block
= make_node (BLOCK
);
4790 BLOCK_VARS (block
) = vars
;
4791 BLOCK_SUBBLOCKS (block
) = subblocks
;
4792 BLOCK_SUPERCONTEXT (block
) = supercontext
;
4793 BLOCK_CHAIN (block
) = chain
;
4798 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
4800 LOC is the location to use in tree T. */
4803 protected_set_expr_location (tree t
, location_t loc
)
4805 if (CAN_HAVE_LOCATION_P (t
))
4806 SET_EXPR_LOCATION (t
, loc
);
4809 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
4813 build_decl_attribute_variant (tree ddecl
, tree attribute
)
4815 DECL_ATTRIBUTES (ddecl
) = attribute
;
4819 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4820 is ATTRIBUTE and its qualifiers are QUALS.
4822 Record such modified types already made so we don't make duplicates. */
4825 build_type_attribute_qual_variant (tree ttype
, tree attribute
, int quals
)
4827 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype
), attribute
))
4831 /* Building a distinct copy of a tagged type is inappropriate; it
4832 causes breakage in code that expects there to be a one-to-one
4833 relationship between a struct and its fields.
4834 build_duplicate_type is another solution (as used in
4835 handle_transparent_union_attribute), but that doesn't play well
4836 with the stronger C++ type identity model. */
4837 if (TREE_CODE (ttype
) == RECORD_TYPE
4838 || TREE_CODE (ttype
) == UNION_TYPE
4839 || TREE_CODE (ttype
) == QUAL_UNION_TYPE
4840 || TREE_CODE (ttype
) == ENUMERAL_TYPE
)
4842 warning (OPT_Wattributes
,
4843 "ignoring attributes applied to %qT after definition",
4844 TYPE_MAIN_VARIANT (ttype
));
4845 return build_qualified_type (ttype
, quals
);
4848 ttype
= build_qualified_type (ttype
, TYPE_UNQUALIFIED
);
4849 ntype
= build_distinct_type_copy (ttype
);
4851 TYPE_ATTRIBUTES (ntype
) = attribute
;
4853 hashval_t hash
= type_hash_canon_hash (ntype
);
4854 ntype
= type_hash_canon (hash
, ntype
);
4856 /* If the target-dependent attributes make NTYPE different from
4857 its canonical type, we will need to use structural equality
4858 checks for this type. */
4859 if (TYPE_STRUCTURAL_EQUALITY_P (ttype
)
4860 || !comp_type_attributes (ntype
, ttype
))
4861 SET_TYPE_STRUCTURAL_EQUALITY (ntype
);
4862 else if (TYPE_CANONICAL (ntype
) == ntype
)
4863 TYPE_CANONICAL (ntype
) = TYPE_CANONICAL (ttype
);
4865 ttype
= build_qualified_type (ntype
, quals
);
4867 else if (TYPE_QUALS (ttype
) != quals
)
4868 ttype
= build_qualified_type (ttype
, quals
);
4873 /* Check if "omp declare simd" attribute arguments, CLAUSES1 and CLAUSES2, are
4877 omp_declare_simd_clauses_equal (tree clauses1
, tree clauses2
)
4880 for (cl1
= clauses1
, cl2
= clauses2
;
4882 cl1
= OMP_CLAUSE_CHAIN (cl1
), cl2
= OMP_CLAUSE_CHAIN (cl2
))
4884 if (OMP_CLAUSE_CODE (cl1
) != OMP_CLAUSE_CODE (cl2
))
4886 if (OMP_CLAUSE_CODE (cl1
) != OMP_CLAUSE_SIMDLEN
)
4888 if (simple_cst_equal (OMP_CLAUSE_DECL (cl1
),
4889 OMP_CLAUSE_DECL (cl2
)) != 1)
4892 switch (OMP_CLAUSE_CODE (cl1
))
4894 case OMP_CLAUSE_ALIGNED
:
4895 if (simple_cst_equal (OMP_CLAUSE_ALIGNED_ALIGNMENT (cl1
),
4896 OMP_CLAUSE_ALIGNED_ALIGNMENT (cl2
)) != 1)
4899 case OMP_CLAUSE_LINEAR
:
4900 if (simple_cst_equal (OMP_CLAUSE_LINEAR_STEP (cl1
),
4901 OMP_CLAUSE_LINEAR_STEP (cl2
)) != 1)
4904 case OMP_CLAUSE_SIMDLEN
:
4905 if (simple_cst_equal (OMP_CLAUSE_SIMDLEN_EXPR (cl1
),
4906 OMP_CLAUSE_SIMDLEN_EXPR (cl2
)) != 1)
4915 /* Compare two constructor-element-type constants. Return 1 if the lists
4916 are known to be equal; otherwise return 0. */
4919 simple_cst_list_equal (const_tree l1
, const_tree l2
)
4921 while (l1
!= NULL_TREE
&& l2
!= NULL_TREE
)
4923 if (simple_cst_equal (TREE_VALUE (l1
), TREE_VALUE (l2
)) != 1)
4926 l1
= TREE_CHAIN (l1
);
4927 l2
= TREE_CHAIN (l2
);
4933 /* Compare two identifier nodes representing attributes. Either one may
4934 be in wrapped __ATTR__ form. Return true if they are the same, false
4938 cmp_attrib_identifiers (const_tree attr1
, const_tree attr2
)
4940 /* Make sure we're dealing with IDENTIFIER_NODEs. */
4941 gcc_checking_assert (TREE_CODE (attr1
) == IDENTIFIER_NODE
4942 && TREE_CODE (attr2
) == IDENTIFIER_NODE
);
4944 /* Identifiers can be compared directly for equality. */
4948 /* If they are not equal, they may still be one in the form
4949 'text' while the other one is in the form '__text__'. TODO:
4950 If we were storing attributes in normalized 'text' form, then
4951 this could all go away and we could take full advantage of
4952 the fact that we're comparing identifiers. :-) */
4953 const size_t attr1_len
= IDENTIFIER_LENGTH (attr1
);
4954 const size_t attr2_len
= IDENTIFIER_LENGTH (attr2
);
4956 if (attr2_len
== attr1_len
+ 4)
4958 const char *p
= IDENTIFIER_POINTER (attr2
);
4959 const char *q
= IDENTIFIER_POINTER (attr1
);
4960 if (p
[0] == '_' && p
[1] == '_'
4961 && p
[attr2_len
- 2] == '_' && p
[attr2_len
- 1] == '_'
4962 && strncmp (q
, p
+ 2, attr1_len
) == 0)
4965 else if (attr2_len
+ 4 == attr1_len
)
4967 const char *p
= IDENTIFIER_POINTER (attr2
);
4968 const char *q
= IDENTIFIER_POINTER (attr1
);
4969 if (q
[0] == '_' && q
[1] == '_'
4970 && q
[attr1_len
- 2] == '_' && q
[attr1_len
- 1] == '_'
4971 && strncmp (q
+ 2, p
, attr2_len
) == 0)
4978 /* Compare two attributes for their value identity. Return true if the
4979 attribute values are known to be equal; otherwise return false. */
4982 attribute_value_equal (const_tree attr1
, const_tree attr2
)
4984 if (TREE_VALUE (attr1
) == TREE_VALUE (attr2
))
4987 if (TREE_VALUE (attr1
) != NULL_TREE
4988 && TREE_CODE (TREE_VALUE (attr1
)) == TREE_LIST
4989 && TREE_VALUE (attr2
) != NULL_TREE
4990 && TREE_CODE (TREE_VALUE (attr2
)) == TREE_LIST
)
4992 /* Handle attribute format. */
4993 if (is_attribute_p ("format", get_attribute_name (attr1
)))
4995 attr1
= TREE_VALUE (attr1
);
4996 attr2
= TREE_VALUE (attr2
);
4997 /* Compare the archetypes (printf/scanf/strftime/...). */
4998 if (!cmp_attrib_identifiers (TREE_VALUE (attr1
),
4999 TREE_VALUE (attr2
)))
5001 /* Archetypes are the same. Compare the rest. */
5002 return (simple_cst_list_equal (TREE_CHAIN (attr1
),
5003 TREE_CHAIN (attr2
)) == 1);
5005 return (simple_cst_list_equal (TREE_VALUE (attr1
),
5006 TREE_VALUE (attr2
)) == 1);
5009 if ((flag_openmp
|| flag_openmp_simd
)
5010 && TREE_VALUE (attr1
) && TREE_VALUE (attr2
)
5011 && TREE_CODE (TREE_VALUE (attr1
)) == OMP_CLAUSE
5012 && TREE_CODE (TREE_VALUE (attr2
)) == OMP_CLAUSE
)
5013 return omp_declare_simd_clauses_equal (TREE_VALUE (attr1
),
5014 TREE_VALUE (attr2
));
5016 return (simple_cst_equal (TREE_VALUE (attr1
), TREE_VALUE (attr2
)) == 1);
5019 /* Return 0 if the attributes for two types are incompatible, 1 if they
5020 are compatible, and 2 if they are nearly compatible (which causes a
5021 warning to be generated). */
5023 comp_type_attributes (const_tree type1
, const_tree type2
)
5025 const_tree a1
= TYPE_ATTRIBUTES (type1
);
5026 const_tree a2
= TYPE_ATTRIBUTES (type2
);
5031 for (a
= a1
; a
!= NULL_TREE
; a
= TREE_CHAIN (a
))
5033 const struct attribute_spec
*as
;
5036 as
= lookup_attribute_spec (get_attribute_name (a
));
5037 if (!as
|| as
->affects_type_identity
== false)
5040 attr
= lookup_attribute (as
->name
, CONST_CAST_TREE (a2
));
5041 if (!attr
|| !attribute_value_equal (a
, attr
))
5046 for (a
= a2
; a
!= NULL_TREE
; a
= TREE_CHAIN (a
))
5048 const struct attribute_spec
*as
;
5050 as
= lookup_attribute_spec (get_attribute_name (a
));
5051 if (!as
|| as
->affects_type_identity
== false)
5054 if (!lookup_attribute (as
->name
, CONST_CAST_TREE (a1
)))
5056 /* We don't need to compare trees again, as we did this
5057 already in first loop. */
5059 /* All types - affecting identity - are equal, so
5060 there is no need to call target hook for comparison. */
5064 if (lookup_attribute ("transaction_safe", CONST_CAST_TREE (a
)))
5066 /* As some type combinations - like default calling-convention - might
5067 be compatible, we have to call the target hook to get the final result. */
5068 return targetm
.comp_type_attributes (type1
, type2
);
5071 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
5074 Record such modified types already made so we don't make duplicates. */
5077 build_type_attribute_variant (tree ttype
, tree attribute
)
5079 return build_type_attribute_qual_variant (ttype
, attribute
,
5080 TYPE_QUALS (ttype
));
5084 /* Reset the expression *EXPR_P, a size or position.
5086 ??? We could reset all non-constant sizes or positions. But it's cheap
5087 enough to not do so and refrain from adding workarounds to dwarf2out.c.
5089 We need to reset self-referential sizes or positions because they cannot
5090 be gimplified and thus can contain a CALL_EXPR after the gimplification
5091 is finished, which will run afoul of LTO streaming. And they need to be
5092 reset to something essentially dummy but not constant, so as to preserve
5093 the properties of the object they are attached to. */
5096 free_lang_data_in_one_sizepos (tree
*expr_p
)
5098 tree expr
= *expr_p
;
5099 if (CONTAINS_PLACEHOLDER_P (expr
))
5100 *expr_p
= build0 (PLACEHOLDER_EXPR
, TREE_TYPE (expr
));
5104 /* Reset all the fields in a binfo node BINFO. We only keep
5105 BINFO_VTABLE, which is used by gimple_fold_obj_type_ref. */
5108 free_lang_data_in_binfo (tree binfo
)
5113 gcc_assert (TREE_CODE (binfo
) == TREE_BINFO
);
5115 BINFO_VIRTUALS (binfo
) = NULL_TREE
;
5116 BINFO_BASE_ACCESSES (binfo
) = NULL
;
5117 BINFO_INHERITANCE_CHAIN (binfo
) = NULL_TREE
;
5118 BINFO_SUBVTT_INDEX (binfo
) = NULL_TREE
;
5120 FOR_EACH_VEC_ELT (*BINFO_BASE_BINFOS (binfo
), i
, t
)
5121 free_lang_data_in_binfo (t
);
5125 /* Reset all language specific information still present in TYPE. */
5128 free_lang_data_in_type (tree type
)
5130 gcc_assert (TYPE_P (type
));
5132 /* Give the FE a chance to remove its own data first. */
5133 lang_hooks
.free_lang_data (type
);
5135 TREE_LANG_FLAG_0 (type
) = 0;
5136 TREE_LANG_FLAG_1 (type
) = 0;
5137 TREE_LANG_FLAG_2 (type
) = 0;
5138 TREE_LANG_FLAG_3 (type
) = 0;
5139 TREE_LANG_FLAG_4 (type
) = 0;
5140 TREE_LANG_FLAG_5 (type
) = 0;
5141 TREE_LANG_FLAG_6 (type
) = 0;
5143 if (TREE_CODE (type
) == FUNCTION_TYPE
)
5145 /* Remove the const and volatile qualifiers from arguments. The
5146 C++ front end removes them, but the C front end does not,
5147 leading to false ODR violation errors when merging two
5148 instances of the same function signature compiled by
5149 different front ends. */
5152 for (p
= TYPE_ARG_TYPES (type
); p
; p
= TREE_CHAIN (p
))
5154 tree arg_type
= TREE_VALUE (p
);
5156 if (TYPE_READONLY (arg_type
) || TYPE_VOLATILE (arg_type
))
5158 int quals
= TYPE_QUALS (arg_type
)
5160 & ~TYPE_QUAL_VOLATILE
;
5161 TREE_VALUE (p
) = build_qualified_type (arg_type
, quals
);
5162 free_lang_data_in_type (TREE_VALUE (p
));
5164 /* C++ FE uses TREE_PURPOSE to store initial values. */
5165 TREE_PURPOSE (p
) = NULL
;
5167 /* Java uses TYPE_MINVAL for TYPE_ARGUMENT_SIGNATURE. */
5168 TYPE_MINVAL (type
) = NULL
;
5170 if (TREE_CODE (type
) == METHOD_TYPE
)
5174 for (p
= TYPE_ARG_TYPES (type
); p
; p
= TREE_CHAIN (p
))
5176 /* C++ FE uses TREE_PURPOSE to store initial values. */
5177 TREE_PURPOSE (p
) = NULL
;
5179 /* Java uses TYPE_MINVAL for TYPE_ARGUMENT_SIGNATURE. */
5180 TYPE_MINVAL (type
) = NULL
;
5183 /* Remove members that are not actually FIELD_DECLs from the field
5184 list of an aggregate. These occur in C++. */
5185 if (RECORD_OR_UNION_TYPE_P (type
))
5189 /* Note that TYPE_FIELDS can be shared across distinct
5190 TREE_TYPEs. Therefore, if the first field of TYPE_FIELDS is
5191 to be removed, we cannot set its TREE_CHAIN to NULL.
5192 Otherwise, we would not be able to find all the other fields
5193 in the other instances of this TREE_TYPE.
5195 This was causing an ICE in testsuite/g++.dg/lto/20080915.C. */
5197 member
= TYPE_FIELDS (type
);
5200 if (TREE_CODE (member
) == FIELD_DECL
5201 || (TREE_CODE (member
) == TYPE_DECL
5202 && !DECL_IGNORED_P (member
)
5203 && debug_info_level
> DINFO_LEVEL_TERSE
5204 && !is_redundant_typedef (member
)))
5207 TREE_CHAIN (prev
) = member
;
5209 TYPE_FIELDS (type
) = member
;
5213 member
= TREE_CHAIN (member
);
5217 TREE_CHAIN (prev
) = NULL_TREE
;
5219 TYPE_FIELDS (type
) = NULL_TREE
;
5221 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
5222 and danagle the pointer from time to time. */
5223 if (TYPE_VFIELD (type
) && TREE_CODE (TYPE_VFIELD (type
)) != FIELD_DECL
)
5224 TYPE_VFIELD (type
) = NULL_TREE
;
5226 /* Remove TYPE_METHODS list. While it would be nice to keep it
5227 to enable ODR warnings about different method lists, doing so
5228 seems to impractically increase size of LTO data streamed.
5229 Keep the information if TYPE_METHODS was non-NULL. This is used
5230 by function.c and pretty printers. */
5231 if (TYPE_METHODS (type
))
5232 TYPE_METHODS (type
) = error_mark_node
;
5233 if (TYPE_BINFO (type
))
5235 free_lang_data_in_binfo (TYPE_BINFO (type
));
5236 /* We need to preserve link to bases and virtual table for all
5237 polymorphic types to make devirtualization machinery working.
5238 Debug output cares only about bases, but output also
5239 virtual table pointers so merging of -fdevirtualize and
5240 -fno-devirtualize units is easier. */
5241 if ((!BINFO_VTABLE (TYPE_BINFO (type
))
5242 || !flag_devirtualize
)
5243 && ((!BINFO_N_BASE_BINFOS (TYPE_BINFO (type
))
5244 && !BINFO_VTABLE (TYPE_BINFO (type
)))
5245 || debug_info_level
!= DINFO_LEVEL_NONE
))
5246 TYPE_BINFO (type
) = NULL
;
5251 /* For non-aggregate types, clear out the language slot (which
5252 overloads TYPE_BINFO). */
5253 TYPE_LANG_SLOT_1 (type
) = NULL_TREE
;
5255 if (INTEGRAL_TYPE_P (type
)
5256 || SCALAR_FLOAT_TYPE_P (type
)
5257 || FIXED_POINT_TYPE_P (type
))
5259 free_lang_data_in_one_sizepos (&TYPE_MIN_VALUE (type
));
5260 free_lang_data_in_one_sizepos (&TYPE_MAX_VALUE (type
));
5264 free_lang_data_in_one_sizepos (&TYPE_SIZE (type
));
5265 free_lang_data_in_one_sizepos (&TYPE_SIZE_UNIT (type
));
5267 if (TYPE_CONTEXT (type
)
5268 && TREE_CODE (TYPE_CONTEXT (type
)) == BLOCK
)
5270 tree ctx
= TYPE_CONTEXT (type
);
5273 ctx
= BLOCK_SUPERCONTEXT (ctx
);
5275 while (ctx
&& TREE_CODE (ctx
) == BLOCK
);
5276 TYPE_CONTEXT (type
) = ctx
;
5281 /* Return true if DECL may need an assembler name to be set. */
5284 need_assembler_name_p (tree decl
)
5286 /* We use DECL_ASSEMBLER_NAME to hold mangled type names for One Definition
5287 Rule merging. This makes type_odr_p to return true on those types during
5288 LTO and by comparing the mangled name, we can say what types are intended
5289 to be equivalent across compilation unit.
5291 We do not store names of type_in_anonymous_namespace_p.
5293 Record, union and enumeration type have linkage that allows use
5294 to check type_in_anonymous_namespace_p. We do not mangle compound types
5295 that always can be compared structurally.
5297 Similarly for builtin types, we compare properties of their main variant.
5298 A special case are integer types where mangling do make differences
5299 between char/signed char/unsigned char etc. Storing name for these makes
5300 e.g. -fno-signed-char/-fsigned-char mismatches to be handled well.
5301 See cp/mangle.c:write_builtin_type for details. */
5303 if (flag_lto_odr_type_mering
5304 && TREE_CODE (decl
) == TYPE_DECL
5306 && decl
== TYPE_NAME (TREE_TYPE (decl
))
5307 && TYPE_MAIN_VARIANT (TREE_TYPE (decl
)) == TREE_TYPE (decl
)
5308 && !TYPE_ARTIFICIAL (TREE_TYPE (decl
))
5309 && (type_with_linkage_p (TREE_TYPE (decl
))
5310 || TREE_CODE (TREE_TYPE (decl
)) == INTEGER_TYPE
)
5311 && !variably_modified_type_p (TREE_TYPE (decl
), NULL_TREE
))
5312 return !DECL_ASSEMBLER_NAME_SET_P (decl
);
5313 /* Only FUNCTION_DECLs and VAR_DECLs are considered. */
5314 if (!VAR_OR_FUNCTION_DECL_P (decl
))
5317 /* If DECL already has its assembler name set, it does not need a
5319 if (!HAS_DECL_ASSEMBLER_NAME_P (decl
)
5320 || DECL_ASSEMBLER_NAME_SET_P (decl
))
5323 /* Abstract decls do not need an assembler name. */
5324 if (DECL_ABSTRACT_P (decl
))
5327 /* For VAR_DECLs, only static, public and external symbols need an
5330 && !TREE_STATIC (decl
)
5331 && !TREE_PUBLIC (decl
)
5332 && !DECL_EXTERNAL (decl
))
5335 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5337 /* Do not set assembler name on builtins. Allow RTL expansion to
5338 decide whether to expand inline or via a regular call. */
5339 if (DECL_BUILT_IN (decl
)
5340 && DECL_BUILT_IN_CLASS (decl
) != BUILT_IN_FRONTEND
)
5343 /* Functions represented in the callgraph need an assembler name. */
5344 if (cgraph_node::get (decl
) != NULL
)
5347 /* Unused and not public functions don't need an assembler name. */
5348 if (!TREE_USED (decl
) && !TREE_PUBLIC (decl
))
5356 /* Reset all language specific information still present in symbol
5360 free_lang_data_in_decl (tree decl
)
5362 gcc_assert (DECL_P (decl
));
5364 /* Give the FE a chance to remove its own data first. */
5365 lang_hooks
.free_lang_data (decl
);
5367 TREE_LANG_FLAG_0 (decl
) = 0;
5368 TREE_LANG_FLAG_1 (decl
) = 0;
5369 TREE_LANG_FLAG_2 (decl
) = 0;
5370 TREE_LANG_FLAG_3 (decl
) = 0;
5371 TREE_LANG_FLAG_4 (decl
) = 0;
5372 TREE_LANG_FLAG_5 (decl
) = 0;
5373 TREE_LANG_FLAG_6 (decl
) = 0;
5375 free_lang_data_in_one_sizepos (&DECL_SIZE (decl
));
5376 free_lang_data_in_one_sizepos (&DECL_SIZE_UNIT (decl
));
5377 if (TREE_CODE (decl
) == FIELD_DECL
)
5379 free_lang_data_in_one_sizepos (&DECL_FIELD_OFFSET (decl
));
5380 if (TREE_CODE (DECL_CONTEXT (decl
)) == QUAL_UNION_TYPE
)
5381 DECL_QUALIFIER (decl
) = NULL_TREE
;
5384 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5386 struct cgraph_node
*node
;
5387 if (!(node
= cgraph_node::get (decl
))
5388 || (!node
->definition
&& !node
->clones
))
5391 node
->release_body ();
5394 release_function_body (decl
);
5395 DECL_ARGUMENTS (decl
) = NULL
;
5396 DECL_RESULT (decl
) = NULL
;
5397 DECL_INITIAL (decl
) = error_mark_node
;
5400 if (gimple_has_body_p (decl
) || (node
&& node
->thunk
.thunk_p
))
5404 /* If DECL has a gimple body, then the context for its
5405 arguments must be DECL. Otherwise, it doesn't really
5406 matter, as we will not be emitting any code for DECL. In
5407 general, there may be other instances of DECL created by
5408 the front end and since PARM_DECLs are generally shared,
5409 their DECL_CONTEXT changes as the replicas of DECL are
5410 created. The only time where DECL_CONTEXT is important
5411 is for the FUNCTION_DECLs that have a gimple body (since
5412 the PARM_DECL will be used in the function's body). */
5413 for (t
= DECL_ARGUMENTS (decl
); t
; t
= TREE_CHAIN (t
))
5414 DECL_CONTEXT (t
) = decl
;
5415 if (!DECL_FUNCTION_SPECIFIC_TARGET (decl
))
5416 DECL_FUNCTION_SPECIFIC_TARGET (decl
)
5417 = target_option_default_node
;
5418 if (!DECL_FUNCTION_SPECIFIC_OPTIMIZATION (decl
))
5419 DECL_FUNCTION_SPECIFIC_OPTIMIZATION (decl
)
5420 = optimization_default_node
;
5423 /* DECL_SAVED_TREE holds the GENERIC representation for DECL.
5424 At this point, it is not needed anymore. */
5425 DECL_SAVED_TREE (decl
) = NULL_TREE
;
5427 /* Clear the abstract origin if it refers to a method. Otherwise
5428 dwarf2out.c will ICE as we clear TYPE_METHODS and thus the
5429 origin will not be output correctly. */
5430 if (DECL_ABSTRACT_ORIGIN (decl
)
5431 && DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))
5432 && RECORD_OR_UNION_TYPE_P
5433 (DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))))
5434 DECL_ABSTRACT_ORIGIN (decl
) = NULL_TREE
;
5436 /* Sometimes the C++ frontend doesn't manage to transform a temporary
5437 DECL_VINDEX referring to itself into a vtable slot number as it
5438 should. Happens with functions that are copied and then forgotten
5439 about. Just clear it, it won't matter anymore. */
5440 if (DECL_VINDEX (decl
) && !tree_fits_shwi_p (DECL_VINDEX (decl
)))
5441 DECL_VINDEX (decl
) = NULL_TREE
;
5443 else if (VAR_P (decl
))
5445 if ((DECL_EXTERNAL (decl
)
5446 && (!TREE_STATIC (decl
) || !TREE_READONLY (decl
)))
5447 || (decl_function_context (decl
) && !TREE_STATIC (decl
)))
5448 DECL_INITIAL (decl
) = NULL_TREE
;
5450 else if (TREE_CODE (decl
) == TYPE_DECL
)
5452 DECL_VISIBILITY (decl
) = VISIBILITY_DEFAULT
;
5453 DECL_VISIBILITY_SPECIFIED (decl
) = 0;
5454 DECL_INITIAL (decl
) = NULL_TREE
;
5456 else if (TREE_CODE (decl
) == FIELD_DECL
)
5457 DECL_INITIAL (decl
) = NULL_TREE
;
5458 else if (TREE_CODE (decl
) == TRANSLATION_UNIT_DECL
5459 && DECL_INITIAL (decl
)
5460 && TREE_CODE (DECL_INITIAL (decl
)) == BLOCK
)
5462 /* Strip builtins from the translation-unit BLOCK. We still have targets
5463 without builtin_decl_explicit support and also builtins are shared
5464 nodes and thus we can't use TREE_CHAIN in multiple lists. */
5465 tree
*nextp
= &BLOCK_VARS (DECL_INITIAL (decl
));
5469 if (TREE_CODE (var
) == FUNCTION_DECL
5470 && DECL_BUILT_IN (var
))
5471 *nextp
= TREE_CHAIN (var
);
5473 nextp
= &TREE_CHAIN (var
);
5479 /* Data used when collecting DECLs and TYPEs for language data removal. */
5481 struct free_lang_data_d
5483 free_lang_data_d () : decls (100), types (100) {}
5485 /* Worklist to avoid excessive recursion. */
5486 auto_vec
<tree
> worklist
;
5488 /* Set of traversed objects. Used to avoid duplicate visits. */
5489 hash_set
<tree
> pset
;
5491 /* Array of symbols to process with free_lang_data_in_decl. */
5492 auto_vec
<tree
> decls
;
5494 /* Array of types to process with free_lang_data_in_type. */
5495 auto_vec
<tree
> types
;
5499 /* Save all language fields needed to generate proper debug information
5500 for DECL. This saves most fields cleared out by free_lang_data_in_decl. */
5503 save_debug_info_for_decl (tree t
)
5505 /*struct saved_debug_info_d *sdi;*/
5507 gcc_assert (debug_info_level
> DINFO_LEVEL_TERSE
&& t
&& DECL_P (t
));
5509 /* FIXME. Partial implementation for saving debug info removed. */
5513 /* Save all language fields needed to generate proper debug information
5514 for TYPE. This saves most fields cleared out by free_lang_data_in_type. */
5517 save_debug_info_for_type (tree t
)
5519 /*struct saved_debug_info_d *sdi;*/
5521 gcc_assert (debug_info_level
> DINFO_LEVEL_TERSE
&& t
&& TYPE_P (t
));
5523 /* FIXME. Partial implementation for saving debug info removed. */
5527 /* Add type or decl T to one of the list of tree nodes that need their
5528 language data removed. The lists are held inside FLD. */
5531 add_tree_to_fld_list (tree t
, struct free_lang_data_d
*fld
)
5535 fld
->decls
.safe_push (t
);
5536 if (debug_info_level
> DINFO_LEVEL_TERSE
)
5537 save_debug_info_for_decl (t
);
5539 else if (TYPE_P (t
))
5541 fld
->types
.safe_push (t
);
5542 if (debug_info_level
> DINFO_LEVEL_TERSE
)
5543 save_debug_info_for_type (t
);
5549 /* Push tree node T into FLD->WORKLIST. */
5552 fld_worklist_push (tree t
, struct free_lang_data_d
*fld
)
5554 if (t
&& !is_lang_specific (t
) && !fld
->pset
.contains (t
))
5555 fld
->worklist
.safe_push ((t
));
5559 /* Operand callback helper for free_lang_data_in_node. *TP is the
5560 subtree operand being considered. */
5563 find_decls_types_r (tree
*tp
, int *ws
, void *data
)
5566 struct free_lang_data_d
*fld
= (struct free_lang_data_d
*) data
;
5568 if (TREE_CODE (t
) == TREE_LIST
)
5571 /* Language specific nodes will be removed, so there is no need
5572 to gather anything under them. */
5573 if (is_lang_specific (t
))
5581 /* Note that walk_tree does not traverse every possible field in
5582 decls, so we have to do our own traversals here. */
5583 add_tree_to_fld_list (t
, fld
);
5585 fld_worklist_push (DECL_NAME (t
), fld
);
5586 fld_worklist_push (DECL_CONTEXT (t
), fld
);
5587 fld_worklist_push (DECL_SIZE (t
), fld
);
5588 fld_worklist_push (DECL_SIZE_UNIT (t
), fld
);
5590 /* We are going to remove everything under DECL_INITIAL for
5591 TYPE_DECLs. No point walking them. */
5592 if (TREE_CODE (t
) != TYPE_DECL
)
5593 fld_worklist_push (DECL_INITIAL (t
), fld
);
5595 fld_worklist_push (DECL_ATTRIBUTES (t
), fld
);
5596 fld_worklist_push (DECL_ABSTRACT_ORIGIN (t
), fld
);
5598 if (TREE_CODE (t
) == FUNCTION_DECL
)
5600 fld_worklist_push (DECL_ARGUMENTS (t
), fld
);
5601 fld_worklist_push (DECL_RESULT (t
), fld
);
5603 else if (TREE_CODE (t
) == TYPE_DECL
)
5605 fld_worklist_push (DECL_ORIGINAL_TYPE (t
), fld
);
5607 else if (TREE_CODE (t
) == FIELD_DECL
)
5609 fld_worklist_push (DECL_FIELD_OFFSET (t
), fld
);
5610 fld_worklist_push (DECL_BIT_FIELD_TYPE (t
), fld
);
5611 fld_worklist_push (DECL_FIELD_BIT_OFFSET (t
), fld
);
5612 fld_worklist_push (DECL_FCONTEXT (t
), fld
);
5615 if ((VAR_P (t
) || TREE_CODE (t
) == PARM_DECL
)
5616 && DECL_HAS_VALUE_EXPR_P (t
))
5617 fld_worklist_push (DECL_VALUE_EXPR (t
), fld
);
5619 if (TREE_CODE (t
) != FIELD_DECL
5620 && TREE_CODE (t
) != TYPE_DECL
)
5621 fld_worklist_push (TREE_CHAIN (t
), fld
);
5624 else if (TYPE_P (t
))
5626 /* Note that walk_tree does not traverse every possible field in
5627 types, so we have to do our own traversals here. */
5628 add_tree_to_fld_list (t
, fld
);
5630 if (!RECORD_OR_UNION_TYPE_P (t
))
5631 fld_worklist_push (TYPE_CACHED_VALUES (t
), fld
);
5632 fld_worklist_push (TYPE_SIZE (t
), fld
);
5633 fld_worklist_push (TYPE_SIZE_UNIT (t
), fld
);
5634 fld_worklist_push (TYPE_ATTRIBUTES (t
), fld
);
5635 fld_worklist_push (TYPE_POINTER_TO (t
), fld
);
5636 fld_worklist_push (TYPE_REFERENCE_TO (t
), fld
);
5637 fld_worklist_push (TYPE_NAME (t
), fld
);
5638 /* Do not walk TYPE_NEXT_PTR_TO or TYPE_NEXT_REF_TO. We do not stream
5639 them and thus do not and want not to reach unused pointer types
5641 if (!POINTER_TYPE_P (t
))
5642 fld_worklist_push (TYPE_MINVAL (t
), fld
);
5643 if (!RECORD_OR_UNION_TYPE_P (t
))
5644 fld_worklist_push (TYPE_MAXVAL (t
), fld
);
5645 fld_worklist_push (TYPE_MAIN_VARIANT (t
), fld
);
5646 /* Do not walk TYPE_NEXT_VARIANT. We do not stream it and thus
5647 do not and want not to reach unused variants this way. */
5648 if (TYPE_CONTEXT (t
))
5650 tree ctx
= TYPE_CONTEXT (t
);
5651 /* We adjust BLOCK TYPE_CONTEXTs to the innermost non-BLOCK one.
5652 So push that instead. */
5653 while (ctx
&& TREE_CODE (ctx
) == BLOCK
)
5654 ctx
= BLOCK_SUPERCONTEXT (ctx
);
5655 fld_worklist_push (ctx
, fld
);
5657 /* Do not walk TYPE_CANONICAL. We do not stream it and thus do not
5658 and want not to reach unused types this way. */
5660 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_BINFO (t
))
5664 FOR_EACH_VEC_ELT (*BINFO_BASE_BINFOS (TYPE_BINFO (t
)), i
, tem
)
5665 fld_worklist_push (TREE_TYPE (tem
), fld
);
5666 tem
= BINFO_VIRTUALS (TYPE_BINFO (t
));
5668 /* The Java FE overloads BINFO_VIRTUALS for its own purpose. */
5669 && TREE_CODE (tem
) == TREE_LIST
)
5672 fld_worklist_push (TREE_VALUE (tem
), fld
);
5673 tem
= TREE_CHAIN (tem
);
5677 if (RECORD_OR_UNION_TYPE_P (t
))
5680 /* Push all TYPE_FIELDS - there can be interleaving interesting
5681 and non-interesting things. */
5682 tem
= TYPE_FIELDS (t
);
5685 if (TREE_CODE (tem
) == FIELD_DECL
5686 || (TREE_CODE (tem
) == TYPE_DECL
5687 && !DECL_IGNORED_P (tem
)
5688 && debug_info_level
> DINFO_LEVEL_TERSE
5689 && !is_redundant_typedef (tem
)))
5690 fld_worklist_push (tem
, fld
);
5691 tem
= TREE_CHAIN (tem
);
5695 fld_worklist_push (TYPE_STUB_DECL (t
), fld
);
5698 else if (TREE_CODE (t
) == BLOCK
)
5701 for (tem
= BLOCK_VARS (t
); tem
; tem
= TREE_CHAIN (tem
))
5702 fld_worklist_push (tem
, fld
);
5703 for (tem
= BLOCK_SUBBLOCKS (t
); tem
; tem
= BLOCK_CHAIN (tem
))
5704 fld_worklist_push (tem
, fld
);
5705 fld_worklist_push (BLOCK_ABSTRACT_ORIGIN (t
), fld
);
5708 if (TREE_CODE (t
) != IDENTIFIER_NODE
5709 && CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_TYPED
))
5710 fld_worklist_push (TREE_TYPE (t
), fld
);
5716 /* Find decls and types in T. */
5719 find_decls_types (tree t
, struct free_lang_data_d
*fld
)
5723 if (!fld
->pset
.contains (t
))
5724 walk_tree (&t
, find_decls_types_r
, fld
, &fld
->pset
);
5725 if (fld
->worklist
.is_empty ())
5727 t
= fld
->worklist
.pop ();
5731 /* Translate all the types in LIST with the corresponding runtime
5735 get_eh_types_for_runtime (tree list
)
5739 if (list
== NULL_TREE
)
5742 head
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
5744 list
= TREE_CHAIN (list
);
5747 tree n
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
5748 TREE_CHAIN (prev
) = n
;
5749 prev
= TREE_CHAIN (prev
);
5750 list
= TREE_CHAIN (list
);
5757 /* Find decls and types referenced in EH region R and store them in
5758 FLD->DECLS and FLD->TYPES. */
5761 find_decls_types_in_eh_region (eh_region r
, struct free_lang_data_d
*fld
)
5772 /* The types referenced in each catch must first be changed to the
5773 EH types used at runtime. This removes references to FE types
5775 for (c
= r
->u
.eh_try
.first_catch
; c
; c
= c
->next_catch
)
5777 c
->type_list
= get_eh_types_for_runtime (c
->type_list
);
5778 walk_tree (&c
->type_list
, find_decls_types_r
, fld
, &fld
->pset
);
5783 case ERT_ALLOWED_EXCEPTIONS
:
5784 r
->u
.allowed
.type_list
5785 = get_eh_types_for_runtime (r
->u
.allowed
.type_list
);
5786 walk_tree (&r
->u
.allowed
.type_list
, find_decls_types_r
, fld
, &fld
->pset
);
5789 case ERT_MUST_NOT_THROW
:
5790 walk_tree (&r
->u
.must_not_throw
.failure_decl
,
5791 find_decls_types_r
, fld
, &fld
->pset
);
5797 /* Find decls and types referenced in cgraph node N and store them in
5798 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
5799 look for *every* kind of DECL and TYPE node reachable from N,
5800 including those embedded inside types and decls (i.e,, TYPE_DECLs,
5801 NAMESPACE_DECLs, etc). */
5804 find_decls_types_in_node (struct cgraph_node
*n
, struct free_lang_data_d
*fld
)
5807 struct function
*fn
;
5811 find_decls_types (n
->decl
, fld
);
5813 if (!gimple_has_body_p (n
->decl
))
5816 gcc_assert (current_function_decl
== NULL_TREE
&& cfun
== NULL
);
5818 fn
= DECL_STRUCT_FUNCTION (n
->decl
);
5820 /* Traverse locals. */
5821 FOR_EACH_LOCAL_DECL (fn
, ix
, t
)
5822 find_decls_types (t
, fld
);
5824 /* Traverse EH regions in FN. */
5827 FOR_ALL_EH_REGION_FN (r
, fn
)
5828 find_decls_types_in_eh_region (r
, fld
);
5831 /* Traverse every statement in FN. */
5832 FOR_EACH_BB_FN (bb
, fn
)
5835 gimple_stmt_iterator si
;
5838 for (psi
= gsi_start_phis (bb
); !gsi_end_p (psi
); gsi_next (&psi
))
5840 gphi
*phi
= psi
.phi ();
5842 for (i
= 0; i
< gimple_phi_num_args (phi
); i
++)
5844 tree
*arg_p
= gimple_phi_arg_def_ptr (phi
, i
);
5845 find_decls_types (*arg_p
, fld
);
5849 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
5851 gimple
*stmt
= gsi_stmt (si
);
5853 if (is_gimple_call (stmt
))
5854 find_decls_types (gimple_call_fntype (stmt
), fld
);
5856 for (i
= 0; i
< gimple_num_ops (stmt
); i
++)
5858 tree arg
= gimple_op (stmt
, i
);
5859 find_decls_types (arg
, fld
);
5866 /* Find decls and types referenced in varpool node N and store them in
5867 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
5868 look for *every* kind of DECL and TYPE node reachable from N,
5869 including those embedded inside types and decls (i.e,, TYPE_DECLs,
5870 NAMESPACE_DECLs, etc). */
5873 find_decls_types_in_var (varpool_node
*v
, struct free_lang_data_d
*fld
)
5875 find_decls_types (v
->decl
, fld
);
5878 /* If T needs an assembler name, have one created for it. */
5881 assign_assembler_name_if_needed (tree t
)
5883 if (need_assembler_name_p (t
))
5885 /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit
5886 diagnostics that use input_location to show locus
5887 information. The problem here is that, at this point,
5888 input_location is generally anchored to the end of the file
5889 (since the parser is long gone), so we don't have a good
5890 position to pin it to.
5892 To alleviate this problem, this uses the location of T's
5893 declaration. Examples of this are
5894 testsuite/g++.dg/template/cond2.C and
5895 testsuite/g++.dg/template/pr35240.C. */
5896 location_t saved_location
= input_location
;
5897 input_location
= DECL_SOURCE_LOCATION (t
);
5899 decl_assembler_name (t
);
5901 input_location
= saved_location
;
5906 /* Free language specific information for every operand and expression
5907 in every node of the call graph. This process operates in three stages:
5909 1- Every callgraph node and varpool node is traversed looking for
5910 decls and types embedded in them. This is a more exhaustive
5911 search than that done by find_referenced_vars, because it will
5912 also collect individual fields, decls embedded in types, etc.
5914 2- All the decls found are sent to free_lang_data_in_decl.
5916 3- All the types found are sent to free_lang_data_in_type.
5918 The ordering between decls and types is important because
5919 free_lang_data_in_decl sets assembler names, which includes
5920 mangling. So types cannot be freed up until assembler names have
5924 free_lang_data_in_cgraph (void)
5926 struct cgraph_node
*n
;
5928 struct free_lang_data_d fld
;
5933 /* Find decls and types in the body of every function in the callgraph. */
5934 FOR_EACH_FUNCTION (n
)
5935 find_decls_types_in_node (n
, &fld
);
5937 FOR_EACH_VEC_SAFE_ELT (alias_pairs
, i
, p
)
5938 find_decls_types (p
->decl
, &fld
);
5940 /* Find decls and types in every varpool symbol. */
5941 FOR_EACH_VARIABLE (v
)
5942 find_decls_types_in_var (v
, &fld
);
5944 /* Set the assembler name on every decl found. We need to do this
5945 now because free_lang_data_in_decl will invalidate data needed
5946 for mangling. This breaks mangling on interdependent decls. */
5947 FOR_EACH_VEC_ELT (fld
.decls
, i
, t
)
5948 assign_assembler_name_if_needed (t
);
5950 /* Traverse every decl found freeing its language data. */
5951 FOR_EACH_VEC_ELT (fld
.decls
, i
, t
)
5952 free_lang_data_in_decl (t
);
5954 /* Traverse every type found freeing its language data. */
5955 FOR_EACH_VEC_ELT (fld
.types
, i
, t
)
5956 free_lang_data_in_type (t
);
5959 FOR_EACH_VEC_ELT (fld
.types
, i
, t
)
5965 /* Free resources that are used by FE but are not needed once they are done. */
5968 free_lang_data (void)
5972 /* If we are the LTO frontend we have freed lang-specific data already. */
5974 || (!flag_generate_lto
&& !flag_generate_offload
))
5977 /* Allocate and assign alias sets to the standard integer types
5978 while the slots are still in the way the frontends generated them. */
5979 for (i
= 0; i
< itk_none
; ++i
)
5980 if (integer_types
[i
])
5981 TYPE_ALIAS_SET (integer_types
[i
]) = get_alias_set (integer_types
[i
]);
5983 /* Traverse the IL resetting language specific information for
5984 operands, expressions, etc. */
5985 free_lang_data_in_cgraph ();
5987 /* Create gimple variants for common types. */
5988 fileptr_type_node
= ptr_type_node
;
5989 const_tm_ptr_type_node
= const_ptr_type_node
;
5991 /* Reset some langhooks. Do not reset types_compatible_p, it may
5992 still be used indirectly via the get_alias_set langhook. */
5993 lang_hooks
.dwarf_name
= lhd_dwarf_name
;
5994 lang_hooks
.decl_printable_name
= gimple_decl_printable_name
;
5995 lang_hooks
.gimplify_expr
= lhd_gimplify_expr
;
5997 /* We do not want the default decl_assembler_name implementation,
5998 rather if we have fixed everything we want a wrapper around it
5999 asserting that all non-local symbols already got their assembler
6000 name and only produce assembler names for local symbols. Or rather
6001 make sure we never call decl_assembler_name on local symbols and
6002 devise a separate, middle-end private scheme for it. */
6004 /* Reset diagnostic machinery. */
6005 tree_diagnostics_defaults (global_dc
);
6013 const pass_data pass_data_ipa_free_lang_data
=
6015 SIMPLE_IPA_PASS
, /* type */
6016 "*free_lang_data", /* name */
6017 OPTGROUP_NONE
, /* optinfo_flags */
6018 TV_IPA_FREE_LANG_DATA
, /* tv_id */
6019 0, /* properties_required */
6020 0, /* properties_provided */
6021 0, /* properties_destroyed */
6022 0, /* todo_flags_start */
6023 0, /* todo_flags_finish */
6026 class pass_ipa_free_lang_data
: public simple_ipa_opt_pass
6029 pass_ipa_free_lang_data (gcc::context
*ctxt
)
6030 : simple_ipa_opt_pass (pass_data_ipa_free_lang_data
, ctxt
)
6033 /* opt_pass methods: */
6034 virtual unsigned int execute (function
*) { return free_lang_data (); }
6036 }; // class pass_ipa_free_lang_data
6040 simple_ipa_opt_pass
*
6041 make_pass_ipa_free_lang_data (gcc::context
*ctxt
)
6043 return new pass_ipa_free_lang_data (ctxt
);
6046 /* The backbone of is_attribute_p(). ATTR_LEN is the string length of
6047 ATTR_NAME. Also used internally by remove_attribute(). */
6049 private_is_attribute_p (const char *attr_name
, size_t attr_len
, const_tree ident
)
6051 size_t ident_len
= IDENTIFIER_LENGTH (ident
);
6053 if (ident_len
== attr_len
)
6055 if (strcmp (attr_name
, IDENTIFIER_POINTER (ident
)) == 0)
6058 else if (ident_len
== attr_len
+ 4)
6060 /* There is the possibility that ATTR is 'text' and IDENT is
6062 const char *p
= IDENTIFIER_POINTER (ident
);
6063 if (p
[0] == '_' && p
[1] == '_'
6064 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
6065 && strncmp (attr_name
, p
+ 2, attr_len
) == 0)
6072 /* The backbone of lookup_attribute(). ATTR_LEN is the string length
6073 of ATTR_NAME, and LIST is not NULL_TREE. */
6075 private_lookup_attribute (const char *attr_name
, size_t attr_len
, tree list
)
6079 size_t ident_len
= IDENTIFIER_LENGTH (get_attribute_name (list
));
6081 if (ident_len
== attr_len
)
6083 if (!strcmp (attr_name
,
6084 IDENTIFIER_POINTER (get_attribute_name (list
))))
6087 /* TODO: If we made sure that attributes were stored in the
6088 canonical form without '__...__' (ie, as in 'text' as opposed
6089 to '__text__') then we could avoid the following case. */
6090 else if (ident_len
== attr_len
+ 4)
6092 const char *p
= IDENTIFIER_POINTER (get_attribute_name (list
));
6093 if (p
[0] == '_' && p
[1] == '_'
6094 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
6095 && strncmp (attr_name
, p
+ 2, attr_len
) == 0)
6098 list
= TREE_CHAIN (list
);
6104 /* Given an attribute name ATTR_NAME and a list of attributes LIST,
6105 return a pointer to the attribute's list first element if the attribute
6106 starts with ATTR_NAME. ATTR_NAME must be in the form 'text' (not
6110 private_lookup_attribute_by_prefix (const char *attr_name
, size_t attr_len
,
6115 size_t ident_len
= IDENTIFIER_LENGTH (get_attribute_name (list
));
6117 if (attr_len
> ident_len
)
6119 list
= TREE_CHAIN (list
);
6123 const char *p
= IDENTIFIER_POINTER (get_attribute_name (list
));
6125 if (strncmp (attr_name
, p
, attr_len
) == 0)
6128 /* TODO: If we made sure that attributes were stored in the
6129 canonical form without '__...__' (ie, as in 'text' as opposed
6130 to '__text__') then we could avoid the following case. */
6131 if (p
[0] == '_' && p
[1] == '_' &&
6132 strncmp (attr_name
, p
+ 2, attr_len
) == 0)
6135 list
= TREE_CHAIN (list
);
6142 /* A variant of lookup_attribute() that can be used with an identifier
6143 as the first argument, and where the identifier can be either
6144 'text' or '__text__'.
6146 Given an attribute ATTR_IDENTIFIER, and a list of attributes LIST,
6147 return a pointer to the attribute's list element if the attribute
6148 is part of the list, or NULL_TREE if not found. If the attribute
6149 appears more than once, this only returns the first occurrence; the
6150 TREE_CHAIN of the return value should be passed back in if further
6151 occurrences are wanted. ATTR_IDENTIFIER must be an identifier but
6152 can be in the form 'text' or '__text__'. */
6154 lookup_ident_attribute (tree attr_identifier
, tree list
)
6156 gcc_checking_assert (TREE_CODE (attr_identifier
) == IDENTIFIER_NODE
);
6160 gcc_checking_assert (TREE_CODE (get_attribute_name (list
))
6161 == IDENTIFIER_NODE
);
6163 if (cmp_attrib_identifiers (attr_identifier
,
6164 get_attribute_name (list
)))
6167 list
= TREE_CHAIN (list
);
6173 /* Remove any instances of attribute ATTR_NAME in LIST and return the
6177 remove_attribute (const char *attr_name
, tree list
)
6180 size_t attr_len
= strlen (attr_name
);
6182 gcc_checking_assert (attr_name
[0] != '_');
6184 for (p
= &list
; *p
; )
6187 /* TODO: If we were storing attributes in normalized form, here
6188 we could use a simple strcmp(). */
6189 if (private_is_attribute_p (attr_name
, attr_len
, get_attribute_name (l
)))
6190 *p
= TREE_CHAIN (l
);
6192 p
= &TREE_CHAIN (l
);
6198 /* Return an attribute list that is the union of a1 and a2. */
6201 merge_attributes (tree a1
, tree a2
)
6205 /* Either one unset? Take the set one. */
6207 if ((attributes
= a1
) == 0)
6210 /* One that completely contains the other? Take it. */
6212 else if (a2
!= 0 && ! attribute_list_contained (a1
, a2
))
6214 if (attribute_list_contained (a2
, a1
))
6218 /* Pick the longest list, and hang on the other list. */
6220 if (list_length (a1
) < list_length (a2
))
6221 attributes
= a2
, a2
= a1
;
6223 for (; a2
!= 0; a2
= TREE_CHAIN (a2
))
6226 for (a
= lookup_ident_attribute (get_attribute_name (a2
),
6228 a
!= NULL_TREE
&& !attribute_value_equal (a
, a2
);
6229 a
= lookup_ident_attribute (get_attribute_name (a2
),
6234 a1
= copy_node (a2
);
6235 TREE_CHAIN (a1
) = attributes
;
6244 /* Given types T1 and T2, merge their attributes and return
6248 merge_type_attributes (tree t1
, tree t2
)
6250 return merge_attributes (TYPE_ATTRIBUTES (t1
),
6251 TYPE_ATTRIBUTES (t2
));
6254 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
6258 merge_decl_attributes (tree olddecl
, tree newdecl
)
6260 return merge_attributes (DECL_ATTRIBUTES (olddecl
),
6261 DECL_ATTRIBUTES (newdecl
));
6264 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
6266 /* Specialization of merge_decl_attributes for various Windows targets.
6268 This handles the following situation:
6270 __declspec (dllimport) int foo;
6273 The second instance of `foo' nullifies the dllimport. */
6276 merge_dllimport_decl_attributes (tree old
, tree new_tree
)
6279 int delete_dllimport_p
= 1;
6281 /* What we need to do here is remove from `old' dllimport if it doesn't
6282 appear in `new'. dllimport behaves like extern: if a declaration is
6283 marked dllimport and a definition appears later, then the object
6284 is not dllimport'd. We also remove a `new' dllimport if the old list
6285 contains dllexport: dllexport always overrides dllimport, regardless
6286 of the order of declaration. */
6287 if (!VAR_OR_FUNCTION_DECL_P (new_tree
))
6288 delete_dllimport_p
= 0;
6289 else if (DECL_DLLIMPORT_P (new_tree
)
6290 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (old
)))
6292 DECL_DLLIMPORT_P (new_tree
) = 0;
6293 warning (OPT_Wattributes
, "%q+D already declared with dllexport attribute: "
6294 "dllimport ignored", new_tree
);
6296 else if (DECL_DLLIMPORT_P (old
) && !DECL_DLLIMPORT_P (new_tree
))
6298 /* Warn about overriding a symbol that has already been used, e.g.:
6299 extern int __attribute__ ((dllimport)) foo;
6300 int* bar () {return &foo;}
6303 if (TREE_USED (old
))
6305 warning (0, "%q+D redeclared without dllimport attribute "
6306 "after being referenced with dll linkage", new_tree
);
6307 /* If we have used a variable's address with dllimport linkage,
6308 keep the old DECL_DLLIMPORT_P flag: the ADDR_EXPR using the
6309 decl may already have had TREE_CONSTANT computed.
6310 We still remove the attribute so that assembler code refers
6311 to '&foo rather than '_imp__foo'. */
6312 if (VAR_P (old
) && TREE_ADDRESSABLE (old
))
6313 DECL_DLLIMPORT_P (new_tree
) = 1;
6316 /* Let an inline definition silently override the external reference,
6317 but otherwise warn about attribute inconsistency. */
6318 else if (VAR_P (new_tree
) || !DECL_DECLARED_INLINE_P (new_tree
))
6319 warning (OPT_Wattributes
, "%q+D redeclared without dllimport attribute: "
6320 "previous dllimport ignored", new_tree
);
6323 delete_dllimport_p
= 0;
6325 a
= merge_attributes (DECL_ATTRIBUTES (old
), DECL_ATTRIBUTES (new_tree
));
6327 if (delete_dllimport_p
)
6328 a
= remove_attribute ("dllimport", a
);
6333 /* Handle a "dllimport" or "dllexport" attribute; arguments as in
6334 struct attribute_spec.handler. */
6337 handle_dll_attribute (tree
* pnode
, tree name
, tree args
, int flags
,
6343 /* These attributes may apply to structure and union types being created,
6344 but otherwise should pass to the declaration involved. */
6347 if (flags
& ((int) ATTR_FLAG_DECL_NEXT
| (int) ATTR_FLAG_FUNCTION_NEXT
6348 | (int) ATTR_FLAG_ARRAY_NEXT
))
6350 *no_add_attrs
= true;
6351 return tree_cons (name
, args
, NULL_TREE
);
6353 if (TREE_CODE (node
) == RECORD_TYPE
6354 || TREE_CODE (node
) == UNION_TYPE
)
6356 node
= TYPE_NAME (node
);
6362 warning (OPT_Wattributes
, "%qE attribute ignored",
6364 *no_add_attrs
= true;
6369 if (!VAR_OR_FUNCTION_DECL_P (node
) && TREE_CODE (node
) != TYPE_DECL
)
6371 *no_add_attrs
= true;
6372 warning (OPT_Wattributes
, "%qE attribute ignored",
6377 if (TREE_CODE (node
) == TYPE_DECL
6378 && TREE_CODE (TREE_TYPE (node
)) != RECORD_TYPE
6379 && TREE_CODE (TREE_TYPE (node
)) != UNION_TYPE
)
6381 *no_add_attrs
= true;
6382 warning (OPT_Wattributes
, "%qE attribute ignored",
6387 is_dllimport
= is_attribute_p ("dllimport", name
);
6389 /* Report error on dllimport ambiguities seen now before they cause
6393 /* Honor any target-specific overrides. */
6394 if (!targetm
.valid_dllimport_attribute_p (node
))
6395 *no_add_attrs
= true;
6397 else if (TREE_CODE (node
) == FUNCTION_DECL
6398 && DECL_DECLARED_INLINE_P (node
))
6400 warning (OPT_Wattributes
, "inline function %q+D declared as "
6401 " dllimport: attribute ignored", node
);
6402 *no_add_attrs
= true;
6404 /* Like MS, treat definition of dllimported variables and
6405 non-inlined functions on declaration as syntax errors. */
6406 else if (TREE_CODE (node
) == FUNCTION_DECL
&& DECL_INITIAL (node
))
6408 error ("function %q+D definition is marked dllimport", node
);
6409 *no_add_attrs
= true;
6412 else if (VAR_P (node
))
6414 if (DECL_INITIAL (node
))
6416 error ("variable %q+D definition is marked dllimport",
6418 *no_add_attrs
= true;
6421 /* `extern' needn't be specified with dllimport.
6422 Specify `extern' now and hope for the best. Sigh. */
6423 DECL_EXTERNAL (node
) = 1;
6424 /* Also, implicitly give dllimport'd variables declared within
6425 a function global scope, unless declared static. */
6426 if (current_function_decl
!= NULL_TREE
&& !TREE_STATIC (node
))
6427 TREE_PUBLIC (node
) = 1;
6430 if (*no_add_attrs
== false)
6431 DECL_DLLIMPORT_P (node
) = 1;
6433 else if (TREE_CODE (node
) == FUNCTION_DECL
6434 && DECL_DECLARED_INLINE_P (node
)
6435 && flag_keep_inline_dllexport
)
6436 /* An exported function, even if inline, must be emitted. */
6437 DECL_EXTERNAL (node
) = 0;
6439 /* Report error if symbol is not accessible at global scope. */
6440 if (!TREE_PUBLIC (node
) && VAR_OR_FUNCTION_DECL_P (node
))
6442 error ("external linkage required for symbol %q+D because of "
6443 "%qE attribute", node
, name
);
6444 *no_add_attrs
= true;
6447 /* A dllexport'd entity must have default visibility so that other
6448 program units (shared libraries or the main executable) can see
6449 it. A dllimport'd entity must have default visibility so that
6450 the linker knows that undefined references within this program
6451 unit can be resolved by the dynamic linker. */
6454 if (DECL_VISIBILITY_SPECIFIED (node
)
6455 && DECL_VISIBILITY (node
) != VISIBILITY_DEFAULT
)
6456 error ("%qE implies default visibility, but %qD has already "
6457 "been declared with a different visibility",
6459 DECL_VISIBILITY (node
) = VISIBILITY_DEFAULT
;
6460 DECL_VISIBILITY_SPECIFIED (node
) = 1;
6466 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
6468 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
6469 of the various TYPE_QUAL values. */
6472 set_type_quals (tree type
, int type_quals
)
6474 TYPE_READONLY (type
) = (type_quals
& TYPE_QUAL_CONST
) != 0;
6475 TYPE_VOLATILE (type
) = (type_quals
& TYPE_QUAL_VOLATILE
) != 0;
6476 TYPE_RESTRICT (type
) = (type_quals
& TYPE_QUAL_RESTRICT
) != 0;
6477 TYPE_ATOMIC (type
) = (type_quals
& TYPE_QUAL_ATOMIC
) != 0;
6478 TYPE_ADDR_SPACE (type
) = DECODE_QUAL_ADDR_SPACE (type_quals
);
6481 /* Returns true iff CAND and BASE have equivalent language-specific
6485 check_lang_type (const_tree cand
, const_tree base
)
6487 if (lang_hooks
.types
.type_hash_eq
== NULL
)
6489 /* type_hash_eq currently only applies to these types. */
6490 if (TREE_CODE (cand
) != FUNCTION_TYPE
6491 && TREE_CODE (cand
) != METHOD_TYPE
)
6493 return lang_hooks
.types
.type_hash_eq (cand
, base
);
6496 /* Returns true iff unqualified CAND and BASE are equivalent. */
6499 check_base_type (const_tree cand
, const_tree base
)
6501 return (TYPE_NAME (cand
) == TYPE_NAME (base
)
6502 /* Apparently this is needed for Objective-C. */
6503 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
6504 /* Check alignment. */
6505 && TYPE_ALIGN (cand
) == TYPE_ALIGN (base
)
6506 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
6507 TYPE_ATTRIBUTES (base
)));
6510 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
6513 check_qualified_type (const_tree cand
, const_tree base
, int type_quals
)
6515 return (TYPE_QUALS (cand
) == type_quals
6516 && check_base_type (cand
, base
)
6517 && check_lang_type (cand
, base
));
6520 /* Returns true iff CAND is equivalent to BASE with ALIGN. */
6523 check_aligned_type (const_tree cand
, const_tree base
, unsigned int align
)
6525 return (TYPE_QUALS (cand
) == TYPE_QUALS (base
)
6526 && TYPE_NAME (cand
) == TYPE_NAME (base
)
6527 /* Apparently this is needed for Objective-C. */
6528 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
6529 /* Check alignment. */
6530 && TYPE_ALIGN (cand
) == align
6531 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
6532 TYPE_ATTRIBUTES (base
))
6533 && check_lang_type (cand
, base
));
6536 /* This function checks to see if TYPE matches the size one of the built-in
6537 atomic types, and returns that core atomic type. */
6540 find_atomic_core_type (tree type
)
6542 tree base_atomic_type
;
6544 /* Only handle complete types. */
6545 if (TYPE_SIZE (type
) == NULL_TREE
)
6548 HOST_WIDE_INT type_size
= tree_to_uhwi (TYPE_SIZE (type
));
6552 base_atomic_type
= atomicQI_type_node
;
6556 base_atomic_type
= atomicHI_type_node
;
6560 base_atomic_type
= atomicSI_type_node
;
6564 base_atomic_type
= atomicDI_type_node
;
6568 base_atomic_type
= atomicTI_type_node
;
6572 base_atomic_type
= NULL_TREE
;
6575 return base_atomic_type
;
6578 /* Return a version of the TYPE, qualified as indicated by the
6579 TYPE_QUALS, if one exists. If no qualified version exists yet,
6580 return NULL_TREE. */
6583 get_qualified_type (tree type
, int type_quals
)
6587 if (TYPE_QUALS (type
) == type_quals
)
6590 /* Search the chain of variants to see if there is already one there just
6591 like the one we need to have. If so, use that existing one. We must
6592 preserve the TYPE_NAME, since there is code that depends on this. */
6593 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
6594 if (check_qualified_type (t
, type
, type_quals
))
6600 /* Like get_qualified_type, but creates the type if it does not
6601 exist. This function never returns NULL_TREE. */
6604 build_qualified_type (tree type
, int type_quals MEM_STAT_DECL
)
6608 /* See if we already have the appropriate qualified variant. */
6609 t
= get_qualified_type (type
, type_quals
);
6611 /* If not, build it. */
6614 t
= build_variant_type_copy (type PASS_MEM_STAT
);
6615 set_type_quals (t
, type_quals
);
6617 if (((type_quals
& TYPE_QUAL_ATOMIC
) == TYPE_QUAL_ATOMIC
))
6619 /* See if this object can map to a basic atomic type. */
6620 tree atomic_type
= find_atomic_core_type (type
);
6623 /* Ensure the alignment of this type is compatible with
6624 the required alignment of the atomic type. */
6625 if (TYPE_ALIGN (atomic_type
) > TYPE_ALIGN (t
))
6626 SET_TYPE_ALIGN (t
, TYPE_ALIGN (atomic_type
));
6630 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
6631 /* Propagate structural equality. */
6632 SET_TYPE_STRUCTURAL_EQUALITY (t
);
6633 else if (TYPE_CANONICAL (type
) != type
)
6634 /* Build the underlying canonical type, since it is different
6637 tree c
= build_qualified_type (TYPE_CANONICAL (type
), type_quals
);
6638 TYPE_CANONICAL (t
) = TYPE_CANONICAL (c
);
6641 /* T is its own canonical type. */
6642 TYPE_CANONICAL (t
) = t
;
6649 /* Create a variant of type T with alignment ALIGN. */
6652 build_aligned_type (tree type
, unsigned int align
)
6656 if (TYPE_PACKED (type
)
6657 || TYPE_ALIGN (type
) == align
)
6660 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
6661 if (check_aligned_type (t
, type
, align
))
6664 t
= build_variant_type_copy (type
);
6665 SET_TYPE_ALIGN (t
, align
);
6666 TYPE_USER_ALIGN (t
) = 1;
6671 /* Create a new distinct copy of TYPE. The new type is made its own
6672 MAIN_VARIANT. If TYPE requires structural equality checks, the
6673 resulting type requires structural equality checks; otherwise, its
6674 TYPE_CANONICAL points to itself. */
6677 build_distinct_type_copy (tree type MEM_STAT_DECL
)
6679 tree t
= copy_node_stat (type PASS_MEM_STAT
);
6681 TYPE_POINTER_TO (t
) = 0;
6682 TYPE_REFERENCE_TO (t
) = 0;
6684 /* Set the canonical type either to a new equivalence class, or
6685 propagate the need for structural equality checks. */
6686 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
6687 SET_TYPE_STRUCTURAL_EQUALITY (t
);
6689 TYPE_CANONICAL (t
) = t
;
6691 /* Make it its own variant. */
6692 TYPE_MAIN_VARIANT (t
) = t
;
6693 TYPE_NEXT_VARIANT (t
) = 0;
6695 /* We do not record methods in type copies nor variants
6696 so we do not need to keep them up to date when new method
6698 if (RECORD_OR_UNION_TYPE_P (t
))
6699 TYPE_METHODS (t
) = NULL_TREE
;
6701 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
6702 whose TREE_TYPE is not t. This can also happen in the Ada
6703 frontend when using subtypes. */
6708 /* Create a new variant of TYPE, equivalent but distinct. This is so
6709 the caller can modify it. TYPE_CANONICAL for the return type will
6710 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
6711 are considered equal by the language itself (or that both types
6712 require structural equality checks). */
6715 build_variant_type_copy (tree type MEM_STAT_DECL
)
6717 tree t
, m
= TYPE_MAIN_VARIANT (type
);
6719 t
= build_distinct_type_copy (type PASS_MEM_STAT
);
6721 /* Since we're building a variant, assume that it is a non-semantic
6722 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
6723 TYPE_CANONICAL (t
) = TYPE_CANONICAL (type
);
6724 /* Type variants have no alias set defined. */
6725 TYPE_ALIAS_SET (t
) = -1;
6727 /* Add the new type to the chain of variants of TYPE. */
6728 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (m
);
6729 TYPE_NEXT_VARIANT (m
) = t
;
6730 TYPE_MAIN_VARIANT (t
) = m
;
6735 /* Return true if the from tree in both tree maps are equal. */
6738 tree_map_base_eq (const void *va
, const void *vb
)
6740 const struct tree_map_base
*const a
= (const struct tree_map_base
*) va
,
6741 *const b
= (const struct tree_map_base
*) vb
;
6742 return (a
->from
== b
->from
);
6745 /* Hash a from tree in a tree_base_map. */
6748 tree_map_base_hash (const void *item
)
6750 return htab_hash_pointer (((const struct tree_map_base
*)item
)->from
);
6753 /* Return true if this tree map structure is marked for garbage collection
6754 purposes. We simply return true if the from tree is marked, so that this
6755 structure goes away when the from tree goes away. */
6758 tree_map_base_marked_p (const void *p
)
6760 return ggc_marked_p (((const struct tree_map_base
*) p
)->from
);
6763 /* Hash a from tree in a tree_map. */
6766 tree_map_hash (const void *item
)
6768 return (((const struct tree_map
*) item
)->hash
);
6771 /* Hash a from tree in a tree_decl_map. */
6774 tree_decl_map_hash (const void *item
)
6776 return DECL_UID (((const struct tree_decl_map
*) item
)->base
.from
);
6779 /* Return the initialization priority for DECL. */
6782 decl_init_priority_lookup (tree decl
)
6784 symtab_node
*snode
= symtab_node::get (decl
);
6787 return DEFAULT_INIT_PRIORITY
;
6789 snode
->get_init_priority ();
6792 /* Return the finalization priority for DECL. */
6795 decl_fini_priority_lookup (tree decl
)
6797 cgraph_node
*node
= cgraph_node::get (decl
);
6800 return DEFAULT_INIT_PRIORITY
;
6802 node
->get_fini_priority ();
6805 /* Set the initialization priority for DECL to PRIORITY. */
6808 decl_init_priority_insert (tree decl
, priority_type priority
)
6810 struct symtab_node
*snode
;
6812 if (priority
== DEFAULT_INIT_PRIORITY
)
6814 snode
= symtab_node::get (decl
);
6818 else if (VAR_P (decl
))
6819 snode
= varpool_node::get_create (decl
);
6821 snode
= cgraph_node::get_create (decl
);
6822 snode
->set_init_priority (priority
);
6825 /* Set the finalization priority for DECL to PRIORITY. */
6828 decl_fini_priority_insert (tree decl
, priority_type priority
)
6830 struct cgraph_node
*node
;
6832 if (priority
== DEFAULT_INIT_PRIORITY
)
6834 node
= cgraph_node::get (decl
);
6839 node
= cgraph_node::get_create (decl
);
6840 node
->set_fini_priority (priority
);
6843 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
6846 print_debug_expr_statistics (void)
6848 fprintf (stderr
, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
6849 (long) debug_expr_for_decl
->size (),
6850 (long) debug_expr_for_decl
->elements (),
6851 debug_expr_for_decl
->collisions ());
6854 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
6857 print_value_expr_statistics (void)
6859 fprintf (stderr
, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
6860 (long) value_expr_for_decl
->size (),
6861 (long) value_expr_for_decl
->elements (),
6862 value_expr_for_decl
->collisions ());
6865 /* Lookup a debug expression for FROM, and return it if we find one. */
6868 decl_debug_expr_lookup (tree from
)
6870 struct tree_decl_map
*h
, in
;
6871 in
.base
.from
= from
;
6873 h
= debug_expr_for_decl
->find_with_hash (&in
, DECL_UID (from
));
6879 /* Insert a mapping FROM->TO in the debug expression hashtable. */
6882 decl_debug_expr_insert (tree from
, tree to
)
6884 struct tree_decl_map
*h
;
6886 h
= ggc_alloc
<tree_decl_map
> ();
6887 h
->base
.from
= from
;
6889 *debug_expr_for_decl
->find_slot_with_hash (h
, DECL_UID (from
), INSERT
) = h
;
6892 /* Lookup a value expression for FROM, and return it if we find one. */
6895 decl_value_expr_lookup (tree from
)
6897 struct tree_decl_map
*h
, in
;
6898 in
.base
.from
= from
;
6900 h
= value_expr_for_decl
->find_with_hash (&in
, DECL_UID (from
));
6906 /* Insert a mapping FROM->TO in the value expression hashtable. */
6909 decl_value_expr_insert (tree from
, tree to
)
6911 struct tree_decl_map
*h
;
6913 h
= ggc_alloc
<tree_decl_map
> ();
6914 h
->base
.from
= from
;
6916 *value_expr_for_decl
->find_slot_with_hash (h
, DECL_UID (from
), INSERT
) = h
;
6919 /* Lookup a vector of debug arguments for FROM, and return it if we
6923 decl_debug_args_lookup (tree from
)
6925 struct tree_vec_map
*h
, in
;
6927 if (!DECL_HAS_DEBUG_ARGS_P (from
))
6929 gcc_checking_assert (debug_args_for_decl
!= NULL
);
6930 in
.base
.from
= from
;
6931 h
= debug_args_for_decl
->find_with_hash (&in
, DECL_UID (from
));
6937 /* Insert a mapping FROM->empty vector of debug arguments in the value
6938 expression hashtable. */
6941 decl_debug_args_insert (tree from
)
6943 struct tree_vec_map
*h
;
6946 if (DECL_HAS_DEBUG_ARGS_P (from
))
6947 return decl_debug_args_lookup (from
);
6948 if (debug_args_for_decl
== NULL
)
6949 debug_args_for_decl
= hash_table
<tree_vec_map_cache_hasher
>::create_ggc (64);
6950 h
= ggc_alloc
<tree_vec_map
> ();
6951 h
->base
.from
= from
;
6953 loc
= debug_args_for_decl
->find_slot_with_hash (h
, DECL_UID (from
), INSERT
);
6955 DECL_HAS_DEBUG_ARGS_P (from
) = 1;
6959 /* Hashing of types so that we don't make duplicates.
6960 The entry point is `type_hash_canon'. */
6962 /* Generate the default hash code for TYPE. This is designed for
6963 speed, rather than maximum entropy. */
6966 type_hash_canon_hash (tree type
)
6968 inchash::hash hstate
;
6970 hstate
.add_int (TREE_CODE (type
));
6972 if (TREE_TYPE (type
))
6973 hstate
.add_object (TYPE_HASH (TREE_TYPE (type
)));
6975 for (tree t
= TYPE_ATTRIBUTES (type
); t
; t
= TREE_CHAIN (t
))
6976 /* Just the identifier is adequate to distinguish. */
6977 hstate
.add_object (IDENTIFIER_HASH_VALUE (get_attribute_name (t
)));
6979 switch (TREE_CODE (type
))
6982 hstate
.add_object (TYPE_HASH (TYPE_METHOD_BASETYPE (type
)));
6985 for (tree t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
6986 if (TREE_VALUE (t
) != error_mark_node
)
6987 hstate
.add_object (TYPE_HASH (TREE_VALUE (t
)));
6991 hstate
.add_object (TYPE_HASH (TYPE_OFFSET_BASETYPE (type
)));
6996 if (TYPE_DOMAIN (type
))
6997 hstate
.add_object (TYPE_HASH (TYPE_DOMAIN (type
)));
6998 if (!AGGREGATE_TYPE_P (TREE_TYPE (type
)))
7000 unsigned typeless
= TYPE_TYPELESS_STORAGE (type
);
7001 hstate
.add_object (typeless
);
7008 tree t
= TYPE_MAX_VALUE (type
);
7010 t
= TYPE_MIN_VALUE (type
);
7011 for (int i
= 0; i
< TREE_INT_CST_NUNITS (t
); i
++)
7012 hstate
.add_object (TREE_INT_CST_ELT (t
, i
));
7017 case FIXED_POINT_TYPE
:
7019 unsigned prec
= TYPE_PRECISION (type
);
7020 hstate
.add_object (prec
);
7026 unsigned nunits
= TYPE_VECTOR_SUBPARTS (type
);
7027 hstate
.add_object (nunits
);
7035 return hstate
.end ();
7038 /* These are the Hashtable callback functions. */
7040 /* Returns true iff the types are equivalent. */
7043 type_cache_hasher::equal (type_hash
*a
, type_hash
*b
)
7045 /* First test the things that are the same for all types. */
7046 if (a
->hash
!= b
->hash
7047 || TREE_CODE (a
->type
) != TREE_CODE (b
->type
)
7048 || TREE_TYPE (a
->type
) != TREE_TYPE (b
->type
)
7049 || !attribute_list_equal (TYPE_ATTRIBUTES (a
->type
),
7050 TYPE_ATTRIBUTES (b
->type
))
7051 || (TREE_CODE (a
->type
) != COMPLEX_TYPE
7052 && TYPE_NAME (a
->type
) != TYPE_NAME (b
->type
)))
7055 /* Be careful about comparing arrays before and after the element type
7056 has been completed; don't compare TYPE_ALIGN unless both types are
7058 if (COMPLETE_TYPE_P (a
->type
) && COMPLETE_TYPE_P (b
->type
)
7059 && (TYPE_ALIGN (a
->type
) != TYPE_ALIGN (b
->type
)
7060 || TYPE_MODE (a
->type
) != TYPE_MODE (b
->type
)))
7063 switch (TREE_CODE (a
->type
))
7068 case REFERENCE_TYPE
:
7073 return TYPE_VECTOR_SUBPARTS (a
->type
) == TYPE_VECTOR_SUBPARTS (b
->type
);
7076 if (TYPE_VALUES (a
->type
) != TYPE_VALUES (b
->type
)
7077 && !(TYPE_VALUES (a
->type
)
7078 && TREE_CODE (TYPE_VALUES (a
->type
)) == TREE_LIST
7079 && TYPE_VALUES (b
->type
)
7080 && TREE_CODE (TYPE_VALUES (b
->type
)) == TREE_LIST
7081 && type_list_equal (TYPE_VALUES (a
->type
),
7082 TYPE_VALUES (b
->type
))))
7090 if (TYPE_PRECISION (a
->type
) != TYPE_PRECISION (b
->type
))
7092 return ((TYPE_MAX_VALUE (a
->type
) == TYPE_MAX_VALUE (b
->type
)
7093 || tree_int_cst_equal (TYPE_MAX_VALUE (a
->type
),
7094 TYPE_MAX_VALUE (b
->type
)))
7095 && (TYPE_MIN_VALUE (a
->type
) == TYPE_MIN_VALUE (b
->type
)
7096 || tree_int_cst_equal (TYPE_MIN_VALUE (a
->type
),
7097 TYPE_MIN_VALUE (b
->type
))));
7099 case FIXED_POINT_TYPE
:
7100 return TYPE_SATURATING (a
->type
) == TYPE_SATURATING (b
->type
);
7103 return TYPE_OFFSET_BASETYPE (a
->type
) == TYPE_OFFSET_BASETYPE (b
->type
);
7106 if (TYPE_METHOD_BASETYPE (a
->type
) == TYPE_METHOD_BASETYPE (b
->type
)
7107 && (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
7108 || (TYPE_ARG_TYPES (a
->type
)
7109 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
7110 && TYPE_ARG_TYPES (b
->type
)
7111 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
7112 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
7113 TYPE_ARG_TYPES (b
->type
)))))
7117 /* Don't compare TYPE_TYPELESS_STORAGE flag on aggregates,
7118 where the flag should be inherited from the element type
7119 and can change after ARRAY_TYPEs are created; on non-aggregates
7120 compare it and hash it, scalars will never have that flag set
7121 and we need to differentiate between arrays created by different
7122 front-ends or middle-end created arrays. */
7123 return (TYPE_DOMAIN (a
->type
) == TYPE_DOMAIN (b
->type
)
7124 && (AGGREGATE_TYPE_P (TREE_TYPE (a
->type
))
7125 || (TYPE_TYPELESS_STORAGE (a
->type
)
7126 == TYPE_TYPELESS_STORAGE (b
->type
))));
7130 case QUAL_UNION_TYPE
:
7131 return (TYPE_FIELDS (a
->type
) == TYPE_FIELDS (b
->type
)
7132 || (TYPE_FIELDS (a
->type
)
7133 && TREE_CODE (TYPE_FIELDS (a
->type
)) == TREE_LIST
7134 && TYPE_FIELDS (b
->type
)
7135 && TREE_CODE (TYPE_FIELDS (b
->type
)) == TREE_LIST
7136 && type_list_equal (TYPE_FIELDS (a
->type
),
7137 TYPE_FIELDS (b
->type
))));
7140 if (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
7141 || (TYPE_ARG_TYPES (a
->type
)
7142 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
7143 && TYPE_ARG_TYPES (b
->type
)
7144 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
7145 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
7146 TYPE_ARG_TYPES (b
->type
))))
7154 if (lang_hooks
.types
.type_hash_eq
!= NULL
)
7155 return lang_hooks
.types
.type_hash_eq (a
->type
, b
->type
);
7160 /* Given TYPE, and HASHCODE its hash code, return the canonical
7161 object for an identical type if one already exists.
7162 Otherwise, return TYPE, and record it as the canonical object.
7164 To use this function, first create a type of the sort you want.
7165 Then compute its hash code from the fields of the type that
7166 make it different from other similar types.
7167 Then call this function and use the value. */
7170 type_hash_canon (unsigned int hashcode
, tree type
)
7175 /* The hash table only contains main variants, so ensure that's what we're
7177 gcc_assert (TYPE_MAIN_VARIANT (type
) == type
);
7179 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
7180 must call that routine before comparing TYPE_ALIGNs. */
7186 loc
= type_hash_table
->find_slot_with_hash (&in
, hashcode
, INSERT
);
7189 tree t1
= ((type_hash
*) *loc
)->type
;
7190 gcc_assert (TYPE_MAIN_VARIANT (t1
) == t1
);
7196 struct type_hash
*h
;
7198 h
= ggc_alloc
<type_hash
> ();
7208 print_type_hash_statistics (void)
7210 fprintf (stderr
, "Type hash: size %ld, %ld elements, %f collisions\n",
7211 (long) type_hash_table
->size (),
7212 (long) type_hash_table
->elements (),
7213 type_hash_table
->collisions ());
7216 /* Given two lists of attributes, return true if list l2 is
7217 equivalent to l1. */
7220 attribute_list_equal (const_tree l1
, const_tree l2
)
7225 return attribute_list_contained (l1
, l2
)
7226 && attribute_list_contained (l2
, l1
);
7229 /* Given two lists of attributes, return true if list L2 is
7230 completely contained within L1. */
7231 /* ??? This would be faster if attribute names were stored in a canonicalized
7232 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
7233 must be used to show these elements are equivalent (which they are). */
7234 /* ??? It's not clear that attributes with arguments will always be handled
7238 attribute_list_contained (const_tree l1
, const_tree l2
)
7242 /* First check the obvious, maybe the lists are identical. */
7246 /* Maybe the lists are similar. */
7247 for (t1
= l1
, t2
= l2
;
7249 && get_attribute_name (t1
) == get_attribute_name (t2
)
7250 && TREE_VALUE (t1
) == TREE_VALUE (t2
);
7251 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
7254 /* Maybe the lists are equal. */
7255 if (t1
== 0 && t2
== 0)
7258 for (; t2
!= 0; t2
= TREE_CHAIN (t2
))
7261 /* This CONST_CAST is okay because lookup_attribute does not
7262 modify its argument and the return value is assigned to a
7264 for (attr
= lookup_ident_attribute (get_attribute_name (t2
),
7265 CONST_CAST_TREE (l1
));
7266 attr
!= NULL_TREE
&& !attribute_value_equal (t2
, attr
);
7267 attr
= lookup_ident_attribute (get_attribute_name (t2
),
7271 if (attr
== NULL_TREE
)
7278 /* Given two lists of types
7279 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
7280 return 1 if the lists contain the same types in the same order.
7281 Also, the TREE_PURPOSEs must match. */
7284 type_list_equal (const_tree l1
, const_tree l2
)
7288 for (t1
= l1
, t2
= l2
; t1
&& t2
; t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
7289 if (TREE_VALUE (t1
) != TREE_VALUE (t2
)
7290 || (TREE_PURPOSE (t1
) != TREE_PURPOSE (t2
)
7291 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
))
7292 && (TREE_TYPE (TREE_PURPOSE (t1
))
7293 == TREE_TYPE (TREE_PURPOSE (t2
))))))
7299 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
7300 given by TYPE. If the argument list accepts variable arguments,
7301 then this function counts only the ordinary arguments. */
7304 type_num_arguments (const_tree type
)
7309 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
7310 /* If the function does not take a variable number of arguments,
7311 the last element in the list will have type `void'. */
7312 if (VOID_TYPE_P (TREE_VALUE (t
)))
7320 /* Nonzero if integer constants T1 and T2
7321 represent the same constant value. */
7324 tree_int_cst_equal (const_tree t1
, const_tree t2
)
7329 if (t1
== 0 || t2
== 0)
7332 if (TREE_CODE (t1
) == INTEGER_CST
7333 && TREE_CODE (t2
) == INTEGER_CST
7334 && wi::to_widest (t1
) == wi::to_widest (t2
))
7340 /* Return true if T is an INTEGER_CST whose numerical value (extended
7341 according to TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. */
7344 tree_fits_shwi_p (const_tree t
)
7346 return (t
!= NULL_TREE
7347 && TREE_CODE (t
) == INTEGER_CST
7348 && wi::fits_shwi_p (wi::to_widest (t
)));
7351 /* Return true if T is an INTEGER_CST whose numerical value (extended
7352 according to TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. */
7355 tree_fits_uhwi_p (const_tree t
)
7357 return (t
!= NULL_TREE
7358 && TREE_CODE (t
) == INTEGER_CST
7359 && wi::fits_uhwi_p (wi::to_widest (t
)));
7362 /* T is an INTEGER_CST whose numerical value (extended according to
7363 TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. Return that
7367 tree_to_shwi (const_tree t
)
7369 gcc_assert (tree_fits_shwi_p (t
));
7370 return TREE_INT_CST_LOW (t
);
7373 /* T is an INTEGER_CST whose numerical value (extended according to
7374 TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. Return that
7377 unsigned HOST_WIDE_INT
7378 tree_to_uhwi (const_tree t
)
7380 gcc_assert (tree_fits_uhwi_p (t
));
7381 return TREE_INT_CST_LOW (t
);
7384 /* Return the most significant (sign) bit of T. */
7387 tree_int_cst_sign_bit (const_tree t
)
7389 unsigned bitno
= TYPE_PRECISION (TREE_TYPE (t
)) - 1;
7391 return wi::extract_uhwi (t
, bitno
, 1);
7394 /* Return an indication of the sign of the integer constant T.
7395 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
7396 Note that -1 will never be returned if T's type is unsigned. */
7399 tree_int_cst_sgn (const_tree t
)
7401 if (wi::eq_p (t
, 0))
7403 else if (TYPE_UNSIGNED (TREE_TYPE (t
)))
7405 else if (wi::neg_p (t
))
7411 /* Return the minimum number of bits needed to represent VALUE in a
7412 signed or unsigned type, UNSIGNEDP says which. */
7415 tree_int_cst_min_precision (tree value
, signop sgn
)
7417 /* If the value is negative, compute its negative minus 1. The latter
7418 adjustment is because the absolute value of the largest negative value
7419 is one larger than the largest positive value. This is equivalent to
7420 a bit-wise negation, so use that operation instead. */
7422 if (tree_int_cst_sgn (value
) < 0)
7423 value
= fold_build1 (BIT_NOT_EXPR
, TREE_TYPE (value
), value
);
7425 /* Return the number of bits needed, taking into account the fact
7426 that we need one more bit for a signed than unsigned type.
7427 If value is 0 or -1, the minimum precision is 1 no matter
7428 whether unsignedp is true or false. */
7430 if (integer_zerop (value
))
7433 return tree_floor_log2 (value
) + 1 + (sgn
== SIGNED
? 1 : 0) ;
7436 /* Return truthvalue of whether T1 is the same tree structure as T2.
7437 Return 1 if they are the same.
7438 Return 0 if they are understandably different.
7439 Return -1 if either contains tree structure not understood by
7443 simple_cst_equal (const_tree t1
, const_tree t2
)
7445 enum tree_code code1
, code2
;
7451 if (t1
== 0 || t2
== 0)
7454 code1
= TREE_CODE (t1
);
7455 code2
= TREE_CODE (t2
);
7457 if (CONVERT_EXPR_CODE_P (code1
) || code1
== NON_LVALUE_EXPR
)
7459 if (CONVERT_EXPR_CODE_P (code2
)
7460 || code2
== NON_LVALUE_EXPR
)
7461 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7463 return simple_cst_equal (TREE_OPERAND (t1
, 0), t2
);
7466 else if (CONVERT_EXPR_CODE_P (code2
)
7467 || code2
== NON_LVALUE_EXPR
)
7468 return simple_cst_equal (t1
, TREE_OPERAND (t2
, 0));
7476 return wi::to_widest (t1
) == wi::to_widest (t2
);
7479 return real_identical (&TREE_REAL_CST (t1
), &TREE_REAL_CST (t2
));
7482 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1
), TREE_FIXED_CST (t2
));
7485 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
7486 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
7487 TREE_STRING_LENGTH (t1
)));
7491 unsigned HOST_WIDE_INT idx
;
7492 vec
<constructor_elt
, va_gc
> *v1
= CONSTRUCTOR_ELTS (t1
);
7493 vec
<constructor_elt
, va_gc
> *v2
= CONSTRUCTOR_ELTS (t2
);
7495 if (vec_safe_length (v1
) != vec_safe_length (v2
))
7498 for (idx
= 0; idx
< vec_safe_length (v1
); ++idx
)
7499 /* ??? Should we handle also fields here? */
7500 if (!simple_cst_equal ((*v1
)[idx
].value
, (*v2
)[idx
].value
))
7506 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7509 cmp
= simple_cst_equal (CALL_EXPR_FN (t1
), CALL_EXPR_FN (t2
));
7512 if (call_expr_nargs (t1
) != call_expr_nargs (t2
))
7515 const_tree arg1
, arg2
;
7516 const_call_expr_arg_iterator iter1
, iter2
;
7517 for (arg1
= first_const_call_expr_arg (t1
, &iter1
),
7518 arg2
= first_const_call_expr_arg (t2
, &iter2
);
7520 arg1
= next_const_call_expr_arg (&iter1
),
7521 arg2
= next_const_call_expr_arg (&iter2
))
7523 cmp
= simple_cst_equal (arg1
, arg2
);
7527 return arg1
== arg2
;
7531 /* Special case: if either target is an unallocated VAR_DECL,
7532 it means that it's going to be unified with whatever the
7533 TARGET_EXPR is really supposed to initialize, so treat it
7534 as being equivalent to anything. */
7535 if ((TREE_CODE (TREE_OPERAND (t1
, 0)) == VAR_DECL
7536 && DECL_NAME (TREE_OPERAND (t1
, 0)) == NULL_TREE
7537 && !DECL_RTL_SET_P (TREE_OPERAND (t1
, 0)))
7538 || (TREE_CODE (TREE_OPERAND (t2
, 0)) == VAR_DECL
7539 && DECL_NAME (TREE_OPERAND (t2
, 0)) == NULL_TREE
7540 && !DECL_RTL_SET_P (TREE_OPERAND (t2
, 0))))
7543 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7548 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
7550 case WITH_CLEANUP_EXPR
:
7551 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7555 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t1
, 1));
7558 if (TREE_OPERAND (t1
, 1) == TREE_OPERAND (t2
, 1))
7559 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7573 /* This general rule works for most tree codes. All exceptions should be
7574 handled above. If this is a language-specific tree code, we can't
7575 trust what might be in the operand, so say we don't know
7577 if ((int) code1
>= (int) LAST_AND_UNUSED_TREE_CODE
)
7580 switch (TREE_CODE_CLASS (code1
))
7584 case tcc_comparison
:
7585 case tcc_expression
:
7589 for (i
= 0; i
< TREE_CODE_LENGTH (code1
); i
++)
7591 cmp
= simple_cst_equal (TREE_OPERAND (t1
, i
), TREE_OPERAND (t2
, i
));
7603 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
7604 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
7605 than U, respectively. */
7608 compare_tree_int (const_tree t
, unsigned HOST_WIDE_INT u
)
7610 if (tree_int_cst_sgn (t
) < 0)
7612 else if (!tree_fits_uhwi_p (t
))
7614 else if (TREE_INT_CST_LOW (t
) == u
)
7616 else if (TREE_INT_CST_LOW (t
) < u
)
7622 /* Return true if SIZE represents a constant size that is in bounds of
7623 what the middle-end and the backend accepts (covering not more than
7624 half of the address-space). */
7627 valid_constant_size_p (const_tree size
)
7629 if (! tree_fits_uhwi_p (size
)
7630 || TREE_OVERFLOW (size
)
7631 || tree_int_cst_sign_bit (size
) != 0)
7636 /* Return the precision of the type, or for a complex or vector type the
7637 precision of the type of its elements. */
7640 element_precision (const_tree type
)
7643 type
= TREE_TYPE (type
);
7644 enum tree_code code
= TREE_CODE (type
);
7645 if (code
== COMPLEX_TYPE
|| code
== VECTOR_TYPE
)
7646 type
= TREE_TYPE (type
);
7648 return TYPE_PRECISION (type
);
7651 /* Return true if CODE represents an associative tree code. Otherwise
7654 associative_tree_code (enum tree_code code
)
7673 /* Return true if CODE represents a commutative tree code. Otherwise
7676 commutative_tree_code (enum tree_code code
)
7682 case MULT_HIGHPART_EXPR
:
7690 case UNORDERED_EXPR
:
7694 case TRUTH_AND_EXPR
:
7695 case TRUTH_XOR_EXPR
:
7697 case WIDEN_MULT_EXPR
:
7698 case VEC_WIDEN_MULT_HI_EXPR
:
7699 case VEC_WIDEN_MULT_LO_EXPR
:
7700 case VEC_WIDEN_MULT_EVEN_EXPR
:
7701 case VEC_WIDEN_MULT_ODD_EXPR
:
7710 /* Return true if CODE represents a ternary tree code for which the
7711 first two operands are commutative. Otherwise return false. */
7713 commutative_ternary_tree_code (enum tree_code code
)
7717 case WIDEN_MULT_PLUS_EXPR
:
7718 case WIDEN_MULT_MINUS_EXPR
:
7729 /* Returns true if CODE can overflow. */
7732 operation_can_overflow (enum tree_code code
)
7740 /* Can overflow in various ways. */
7742 case TRUNC_DIV_EXPR
:
7743 case EXACT_DIV_EXPR
:
7744 case FLOOR_DIV_EXPR
:
7746 /* For INT_MIN / -1. */
7753 /* These operators cannot overflow. */
7758 /* Returns true if CODE operating on operands of type TYPE doesn't overflow, or
7759 ftrapv doesn't generate trapping insns for CODE. */
7762 operation_no_trapping_overflow (tree type
, enum tree_code code
)
7764 gcc_checking_assert (ANY_INTEGRAL_TYPE_P (type
));
7766 /* We don't generate instructions that trap on overflow for complex or vector
7768 if (!INTEGRAL_TYPE_P (type
))
7771 if (!TYPE_OVERFLOW_TRAPS (type
))
7781 /* These operators can overflow, and -ftrapv generates trapping code for
7784 case TRUNC_DIV_EXPR
:
7785 case EXACT_DIV_EXPR
:
7786 case FLOOR_DIV_EXPR
:
7789 /* These operators can overflow, but -ftrapv does not generate trapping
7793 /* These operators cannot overflow. */
7801 /* Generate a hash value for an expression. This can be used iteratively
7802 by passing a previous result as the HSTATE argument.
7804 This function is intended to produce the same hash for expressions which
7805 would compare equal using operand_equal_p. */
7807 add_expr (const_tree t
, inchash::hash
&hstate
, unsigned int flags
)
7810 enum tree_code code
;
7811 enum tree_code_class tclass
;
7813 if (t
== NULL_TREE
|| t
== error_mark_node
)
7815 hstate
.merge_hash (0);
7819 if (!(flags
& OEP_ADDRESS_OF
))
7822 code
= TREE_CODE (t
);
7826 /* Alas, constants aren't shared, so we can't rely on pointer
7829 hstate
.merge_hash (0);
7832 gcc_checking_assert (!(flags
& OEP_ADDRESS_OF
));
7833 for (i
= 0; i
< TREE_INT_CST_EXT_NUNITS (t
); i
++)
7834 hstate
.add_wide_int (TREE_INT_CST_ELT (t
, i
));
7839 if (!HONOR_SIGNED_ZEROS (t
) && real_zerop (t
))
7842 val2
= real_hash (TREE_REAL_CST_PTR (t
));
7843 hstate
.merge_hash (val2
);
7848 unsigned int val2
= fixed_hash (TREE_FIXED_CST_PTR (t
));
7849 hstate
.merge_hash (val2
);
7853 hstate
.add ((const void *) TREE_STRING_POINTER (t
),
7854 TREE_STRING_LENGTH (t
));
7857 inchash::add_expr (TREE_REALPART (t
), hstate
, flags
);
7858 inchash::add_expr (TREE_IMAGPART (t
), hstate
, flags
);
7863 for (i
= 0; i
< VECTOR_CST_NELTS (t
); ++i
)
7864 inchash::add_expr (VECTOR_CST_ELT (t
, i
), hstate
, flags
);
7868 /* We can just compare by pointer. */
7869 hstate
.add_wide_int (SSA_NAME_VERSION (t
));
7871 case PLACEHOLDER_EXPR
:
7872 /* The node itself doesn't matter. */
7879 /* A list of expressions, for a CALL_EXPR or as the elements of a
7881 for (; t
; t
= TREE_CHAIN (t
))
7882 inchash::add_expr (TREE_VALUE (t
), hstate
, flags
);
7886 unsigned HOST_WIDE_INT idx
;
7888 flags
&= ~OEP_ADDRESS_OF
;
7889 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t
), idx
, field
, value
)
7891 inchash::add_expr (field
, hstate
, flags
);
7892 inchash::add_expr (value
, hstate
, flags
);
7896 case STATEMENT_LIST
:
7898 tree_stmt_iterator i
;
7899 for (i
= tsi_start (CONST_CAST_TREE (t
));
7900 !tsi_end_p (i
); tsi_next (&i
))
7901 inchash::add_expr (tsi_stmt (i
), hstate
, flags
);
7905 for (i
= 0; i
< TREE_VEC_LENGTH (t
); ++i
)
7906 inchash::add_expr (TREE_VEC_ELT (t
, i
), hstate
, flags
);
7909 /* When referring to a built-in FUNCTION_DECL, use the __builtin__ form.
7910 Otherwise nodes that compare equal according to operand_equal_p might
7911 get different hash codes. However, don't do this for machine specific
7912 or front end builtins, since the function code is overloaded in those
7914 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
7915 && builtin_decl_explicit_p (DECL_FUNCTION_CODE (t
)))
7917 t
= builtin_decl_explicit (DECL_FUNCTION_CODE (t
));
7918 code
= TREE_CODE (t
);
7922 tclass
= TREE_CODE_CLASS (code
);
7924 if (tclass
== tcc_declaration
)
7926 /* DECL's have a unique ID */
7927 hstate
.add_wide_int (DECL_UID (t
));
7929 else if (tclass
== tcc_comparison
&& !commutative_tree_code (code
))
7931 /* For comparisons that can be swapped, use the lower
7933 enum tree_code ccode
= swap_tree_comparison (code
);
7936 hstate
.add_object (ccode
);
7937 inchash::add_expr (TREE_OPERAND (t
, ccode
!= code
), hstate
, flags
);
7938 inchash::add_expr (TREE_OPERAND (t
, ccode
== code
), hstate
, flags
);
7940 else if (CONVERT_EXPR_CODE_P (code
))
7942 /* NOP_EXPR and CONVERT_EXPR are considered equal by
7944 enum tree_code ccode
= NOP_EXPR
;
7945 hstate
.add_object (ccode
);
7947 /* Don't hash the type, that can lead to having nodes which
7948 compare equal according to operand_equal_p, but which
7949 have different hash codes. Make sure to include signedness
7950 in the hash computation. */
7951 hstate
.add_int (TYPE_UNSIGNED (TREE_TYPE (t
)));
7952 inchash::add_expr (TREE_OPERAND (t
, 0), hstate
, flags
);
7954 /* For OEP_ADDRESS_OF, hash MEM_EXPR[&decl, 0] the same as decl. */
7955 else if (code
== MEM_REF
7956 && (flags
& OEP_ADDRESS_OF
) != 0
7957 && TREE_CODE (TREE_OPERAND (t
, 0)) == ADDR_EXPR
7958 && DECL_P (TREE_OPERAND (TREE_OPERAND (t
, 0), 0))
7959 && integer_zerop (TREE_OPERAND (t
, 1)))
7960 inchash::add_expr (TREE_OPERAND (TREE_OPERAND (t
, 0), 0),
7962 /* Don't ICE on FE specific trees, or their arguments etc.
7963 during operand_equal_p hash verification. */
7964 else if (!IS_EXPR_CODE_CLASS (tclass
))
7965 gcc_assert (flags
& OEP_HASH_CHECK
);
7968 unsigned int sflags
= flags
;
7970 hstate
.add_object (code
);
7975 gcc_checking_assert (!(flags
& OEP_ADDRESS_OF
));
7976 flags
|= OEP_ADDRESS_OF
;
7982 case TARGET_MEM_REF
:
7983 flags
&= ~OEP_ADDRESS_OF
;
7988 case ARRAY_RANGE_REF
:
7991 sflags
&= ~OEP_ADDRESS_OF
;
7995 flags
&= ~OEP_ADDRESS_OF
;
7999 case WIDEN_MULT_PLUS_EXPR
:
8000 case WIDEN_MULT_MINUS_EXPR
:
8002 /* The multiplication operands are commutative. */
8003 inchash::hash one
, two
;
8004 inchash::add_expr (TREE_OPERAND (t
, 0), one
, flags
);
8005 inchash::add_expr (TREE_OPERAND (t
, 1), two
, flags
);
8006 hstate
.add_commutative (one
, two
);
8007 inchash::add_expr (TREE_OPERAND (t
, 2), two
, flags
);
8012 if (CALL_EXPR_FN (t
) == NULL_TREE
)
8013 hstate
.add_int (CALL_EXPR_IFN (t
));
8017 /* For TARGET_EXPR, just hash on the TARGET_EXPR_SLOT.
8018 Usually different TARGET_EXPRs just should use
8019 different temporaries in their slots. */
8020 inchash::add_expr (TARGET_EXPR_SLOT (t
), hstate
, flags
);
8027 /* Don't hash the type, that can lead to having nodes which
8028 compare equal according to operand_equal_p, but which
8029 have different hash codes. */
8030 if (code
== NON_LVALUE_EXPR
)
8032 /* Make sure to include signness in the hash computation. */
8033 hstate
.add_int (TYPE_UNSIGNED (TREE_TYPE (t
)));
8034 inchash::add_expr (TREE_OPERAND (t
, 0), hstate
, flags
);
8037 else if (commutative_tree_code (code
))
8039 /* It's a commutative expression. We want to hash it the same
8040 however it appears. We do this by first hashing both operands
8041 and then rehashing based on the order of their independent
8043 inchash::hash one
, two
;
8044 inchash::add_expr (TREE_OPERAND (t
, 0), one
, flags
);
8045 inchash::add_expr (TREE_OPERAND (t
, 1), two
, flags
);
8046 hstate
.add_commutative (one
, two
);
8049 for (i
= TREE_OPERAND_LENGTH (t
) - 1; i
>= 0; --i
)
8050 inchash::add_expr (TREE_OPERAND (t
, i
), hstate
,
8051 i
== 0 ? flags
: sflags
);
8059 /* Constructors for pointer, array and function types.
8060 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
8061 constructed by language-dependent code, not here.) */
8063 /* Construct, lay out and return the type of pointers to TO_TYPE with
8064 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
8065 reference all of memory. If such a type has already been
8066 constructed, reuse it. */
8069 build_pointer_type_for_mode (tree to_type
, machine_mode mode
,
8073 bool could_alias
= can_alias_all
;
8075 if (to_type
== error_mark_node
)
8076 return error_mark_node
;
8078 /* If the pointed-to type has the may_alias attribute set, force
8079 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
8080 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
8081 can_alias_all
= true;
8083 /* In some cases, languages will have things that aren't a POINTER_TYPE
8084 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
8085 In that case, return that type without regard to the rest of our
8088 ??? This is a kludge, but consistent with the way this function has
8089 always operated and there doesn't seem to be a good way to avoid this
8091 if (TYPE_POINTER_TO (to_type
) != 0
8092 && TREE_CODE (TYPE_POINTER_TO (to_type
)) != POINTER_TYPE
)
8093 return TYPE_POINTER_TO (to_type
);
8095 /* First, if we already have a type for pointers to TO_TYPE and it's
8096 the proper mode, use it. */
8097 for (t
= TYPE_POINTER_TO (to_type
); t
; t
= TYPE_NEXT_PTR_TO (t
))
8098 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
8101 t
= make_node (POINTER_TYPE
);
8103 TREE_TYPE (t
) = to_type
;
8104 SET_TYPE_MODE (t
, mode
);
8105 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
8106 TYPE_NEXT_PTR_TO (t
) = TYPE_POINTER_TO (to_type
);
8107 TYPE_POINTER_TO (to_type
) = t
;
8109 /* During LTO we do not set TYPE_CANONICAL of pointers and references. */
8110 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
) || in_lto_p
)
8111 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8112 else if (TYPE_CANONICAL (to_type
) != to_type
|| could_alias
)
8114 = build_pointer_type_for_mode (TYPE_CANONICAL (to_type
),
8117 /* Lay out the type. This function has many callers that are concerned
8118 with expression-construction, and this simplifies them all. */
8124 /* By default build pointers in ptr_mode. */
8127 build_pointer_type (tree to_type
)
8129 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
8130 : TYPE_ADDR_SPACE (to_type
);
8131 machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
8132 return build_pointer_type_for_mode (to_type
, pointer_mode
, false);
8135 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
8138 build_reference_type_for_mode (tree to_type
, machine_mode mode
,
8142 bool could_alias
= can_alias_all
;
8144 if (to_type
== error_mark_node
)
8145 return error_mark_node
;
8147 /* If the pointed-to type has the may_alias attribute set, force
8148 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
8149 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
8150 can_alias_all
= true;
8152 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
8153 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
8154 In that case, return that type without regard to the rest of our
8157 ??? This is a kludge, but consistent with the way this function has
8158 always operated and there doesn't seem to be a good way to avoid this
8160 if (TYPE_REFERENCE_TO (to_type
) != 0
8161 && TREE_CODE (TYPE_REFERENCE_TO (to_type
)) != REFERENCE_TYPE
)
8162 return TYPE_REFERENCE_TO (to_type
);
8164 /* First, if we already have a type for pointers to TO_TYPE and it's
8165 the proper mode, use it. */
8166 for (t
= TYPE_REFERENCE_TO (to_type
); t
; t
= TYPE_NEXT_REF_TO (t
))
8167 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
8170 t
= make_node (REFERENCE_TYPE
);
8172 TREE_TYPE (t
) = to_type
;
8173 SET_TYPE_MODE (t
, mode
);
8174 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
8175 TYPE_NEXT_REF_TO (t
) = TYPE_REFERENCE_TO (to_type
);
8176 TYPE_REFERENCE_TO (to_type
) = t
;
8178 /* During LTO we do not set TYPE_CANONICAL of pointers and references. */
8179 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
) || in_lto_p
)
8180 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8181 else if (TYPE_CANONICAL (to_type
) != to_type
|| could_alias
)
8183 = build_reference_type_for_mode (TYPE_CANONICAL (to_type
),
8192 /* Build the node for the type of references-to-TO_TYPE by default
8196 build_reference_type (tree to_type
)
8198 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
8199 : TYPE_ADDR_SPACE (to_type
);
8200 machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
8201 return build_reference_type_for_mode (to_type
, pointer_mode
, false);
8204 #define MAX_INT_CACHED_PREC \
8205 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
8206 static GTY(()) tree nonstandard_integer_type_cache
[2 * MAX_INT_CACHED_PREC
+ 2];
8208 /* Builds a signed or unsigned integer type of precision PRECISION.
8209 Used for C bitfields whose precision does not match that of
8210 built-in target types. */
8212 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision
,
8218 unsignedp
= MAX_INT_CACHED_PREC
+ 1;
8220 if (precision
<= MAX_INT_CACHED_PREC
)
8222 itype
= nonstandard_integer_type_cache
[precision
+ unsignedp
];
8227 itype
= make_node (INTEGER_TYPE
);
8228 TYPE_PRECISION (itype
) = precision
;
8231 fixup_unsigned_type (itype
);
8233 fixup_signed_type (itype
);
8236 if (tree_fits_uhwi_p (TYPE_MAX_VALUE (itype
)))
8237 ret
= type_hash_canon (tree_to_uhwi (TYPE_MAX_VALUE (itype
)), itype
);
8238 if (precision
<= MAX_INT_CACHED_PREC
)
8239 nonstandard_integer_type_cache
[precision
+ unsignedp
] = ret
;
8244 #define MAX_BOOL_CACHED_PREC \
8245 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
8246 static GTY(()) tree nonstandard_boolean_type_cache
[MAX_BOOL_CACHED_PREC
+ 1];
8248 /* Builds a boolean type of precision PRECISION.
8249 Used for boolean vectors to choose proper vector element size. */
8251 build_nonstandard_boolean_type (unsigned HOST_WIDE_INT precision
)
8255 if (precision
<= MAX_BOOL_CACHED_PREC
)
8257 type
= nonstandard_boolean_type_cache
[precision
];
8262 type
= make_node (BOOLEAN_TYPE
);
8263 TYPE_PRECISION (type
) = precision
;
8264 fixup_signed_type (type
);
8266 if (precision
<= MAX_INT_CACHED_PREC
)
8267 nonstandard_boolean_type_cache
[precision
] = type
;
8272 /* Create a range of some discrete type TYPE (an INTEGER_TYPE, ENUMERAL_TYPE
8273 or BOOLEAN_TYPE) with low bound LOWVAL and high bound HIGHVAL. If SHARED
8274 is true, reuse such a type that has already been constructed. */
8277 build_range_type_1 (tree type
, tree lowval
, tree highval
, bool shared
)
8279 tree itype
= make_node (INTEGER_TYPE
);
8281 TREE_TYPE (itype
) = type
;
8283 TYPE_MIN_VALUE (itype
) = fold_convert (type
, lowval
);
8284 TYPE_MAX_VALUE (itype
) = highval
? fold_convert (type
, highval
) : NULL
;
8286 TYPE_PRECISION (itype
) = TYPE_PRECISION (type
);
8287 SET_TYPE_MODE (itype
, TYPE_MODE (type
));
8288 TYPE_SIZE (itype
) = TYPE_SIZE (type
);
8289 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (type
);
8290 SET_TYPE_ALIGN (itype
, TYPE_ALIGN (type
));
8291 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (type
);
8296 if ((TYPE_MIN_VALUE (itype
)
8297 && TREE_CODE (TYPE_MIN_VALUE (itype
)) != INTEGER_CST
)
8298 || (TYPE_MAX_VALUE (itype
)
8299 && TREE_CODE (TYPE_MAX_VALUE (itype
)) != INTEGER_CST
))
8301 /* Since we cannot reliably merge this type, we need to compare it using
8302 structural equality checks. */
8303 SET_TYPE_STRUCTURAL_EQUALITY (itype
);
8307 hashval_t hash
= type_hash_canon_hash (itype
);
8308 itype
= type_hash_canon (hash
, itype
);
8313 /* Wrapper around build_range_type_1 with SHARED set to true. */
8316 build_range_type (tree type
, tree lowval
, tree highval
)
8318 return build_range_type_1 (type
, lowval
, highval
, true);
8321 /* Wrapper around build_range_type_1 with SHARED set to false. */
8324 build_nonshared_range_type (tree type
, tree lowval
, tree highval
)
8326 return build_range_type_1 (type
, lowval
, highval
, false);
8329 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
8330 MAXVAL should be the maximum value in the domain
8331 (one less than the length of the array).
8333 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
8334 We don't enforce this limit, that is up to caller (e.g. language front end).
8335 The limit exists because the result is a signed type and we don't handle
8336 sizes that use more than one HOST_WIDE_INT. */
8339 build_index_type (tree maxval
)
8341 return build_range_type (sizetype
, size_zero_node
, maxval
);
8344 /* Return true if the debug information for TYPE, a subtype, should be emitted
8345 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
8346 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
8347 debug info and doesn't reflect the source code. */
8350 subrange_type_for_debug_p (const_tree type
, tree
*lowval
, tree
*highval
)
8352 tree base_type
= TREE_TYPE (type
), low
, high
;
8354 /* Subrange types have a base type which is an integral type. */
8355 if (!INTEGRAL_TYPE_P (base_type
))
8358 /* Get the real bounds of the subtype. */
8359 if (lang_hooks
.types
.get_subrange_bounds
)
8360 lang_hooks
.types
.get_subrange_bounds (type
, &low
, &high
);
8363 low
= TYPE_MIN_VALUE (type
);
8364 high
= TYPE_MAX_VALUE (type
);
8367 /* If the type and its base type have the same representation and the same
8368 name, then the type is not a subrange but a copy of the base type. */
8369 if ((TREE_CODE (base_type
) == INTEGER_TYPE
8370 || TREE_CODE (base_type
) == BOOLEAN_TYPE
)
8371 && int_size_in_bytes (type
) == int_size_in_bytes (base_type
)
8372 && tree_int_cst_equal (low
, TYPE_MIN_VALUE (base_type
))
8373 && tree_int_cst_equal (high
, TYPE_MAX_VALUE (base_type
))
8374 && TYPE_IDENTIFIER (type
) == TYPE_IDENTIFIER (base_type
))
8384 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
8385 and number of elements specified by the range of values of INDEX_TYPE.
8386 If TYPELESS_STORAGE is true, TYPE_TYPELESS_STORAGE flag is set on the type.
8387 If SHARED is true, reuse such a type that has already been constructed. */
8390 build_array_type_1 (tree elt_type
, tree index_type
, bool typeless_storage
,
8395 if (TREE_CODE (elt_type
) == FUNCTION_TYPE
)
8397 error ("arrays of functions are not meaningful");
8398 elt_type
= integer_type_node
;
8401 t
= make_node (ARRAY_TYPE
);
8402 TREE_TYPE (t
) = elt_type
;
8403 TYPE_DOMAIN (t
) = index_type
;
8404 TYPE_ADDR_SPACE (t
) = TYPE_ADDR_SPACE (elt_type
);
8405 TYPE_TYPELESS_STORAGE (t
) = typeless_storage
;
8408 /* If the element type is incomplete at this point we get marked for
8409 structural equality. Do not record these types in the canonical
8411 if (TYPE_STRUCTURAL_EQUALITY_P (t
))
8416 hashval_t hash
= type_hash_canon_hash (t
);
8417 t
= type_hash_canon (hash
, t
);
8420 if (TYPE_CANONICAL (t
) == t
)
8422 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type
)
8423 || (index_type
&& TYPE_STRUCTURAL_EQUALITY_P (index_type
))
8425 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8426 else if (TYPE_CANONICAL (elt_type
) != elt_type
8427 || (index_type
&& TYPE_CANONICAL (index_type
) != index_type
))
8429 = build_array_type_1 (TYPE_CANONICAL (elt_type
),
8431 ? TYPE_CANONICAL (index_type
) : NULL_TREE
,
8432 typeless_storage
, shared
);
8438 /* Wrapper around build_array_type_1 with SHARED set to true. */
8441 build_array_type (tree elt_type
, tree index_type
, bool typeless_storage
)
8443 return build_array_type_1 (elt_type
, index_type
, typeless_storage
, true);
8446 /* Wrapper around build_array_type_1 with SHARED set to false. */
8449 build_nonshared_array_type (tree elt_type
, tree index_type
)
8451 return build_array_type_1 (elt_type
, index_type
, false, false);
8454 /* Return a representation of ELT_TYPE[NELTS], using indices of type
8458 build_array_type_nelts (tree elt_type
, unsigned HOST_WIDE_INT nelts
)
8460 return build_array_type (elt_type
, build_index_type (size_int (nelts
- 1)));
8463 /* Recursively examines the array elements of TYPE, until a non-array
8464 element type is found. */
8467 strip_array_types (tree type
)
8469 while (TREE_CODE (type
) == ARRAY_TYPE
)
8470 type
= TREE_TYPE (type
);
8475 /* Computes the canonical argument types from the argument type list
8478 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
8479 on entry to this function, or if any of the ARGTYPES are
8482 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
8483 true on entry to this function, or if any of the ARGTYPES are
8486 Returns a canonical argument list, which may be ARGTYPES when the
8487 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
8488 true) or would not differ from ARGTYPES. */
8491 maybe_canonicalize_argtypes (tree argtypes
,
8492 bool *any_structural_p
,
8493 bool *any_noncanonical_p
)
8496 bool any_noncanonical_argtypes_p
= false;
8498 for (arg
= argtypes
; arg
&& !(*any_structural_p
); arg
= TREE_CHAIN (arg
))
8500 if (!TREE_VALUE (arg
) || TREE_VALUE (arg
) == error_mark_node
)
8501 /* Fail gracefully by stating that the type is structural. */
8502 *any_structural_p
= true;
8503 else if (TYPE_STRUCTURAL_EQUALITY_P (TREE_VALUE (arg
)))
8504 *any_structural_p
= true;
8505 else if (TYPE_CANONICAL (TREE_VALUE (arg
)) != TREE_VALUE (arg
)
8506 || TREE_PURPOSE (arg
))
8507 /* If the argument has a default argument, we consider it
8508 non-canonical even though the type itself is canonical.
8509 That way, different variants of function and method types
8510 with default arguments will all point to the variant with
8511 no defaults as their canonical type. */
8512 any_noncanonical_argtypes_p
= true;
8515 if (*any_structural_p
)
8518 if (any_noncanonical_argtypes_p
)
8520 /* Build the canonical list of argument types. */
8521 tree canon_argtypes
= NULL_TREE
;
8522 bool is_void
= false;
8524 for (arg
= argtypes
; arg
; arg
= TREE_CHAIN (arg
))
8526 if (arg
== void_list_node
)
8529 canon_argtypes
= tree_cons (NULL_TREE
,
8530 TYPE_CANONICAL (TREE_VALUE (arg
)),
8534 canon_argtypes
= nreverse (canon_argtypes
);
8536 canon_argtypes
= chainon (canon_argtypes
, void_list_node
);
8538 /* There is a non-canonical type. */
8539 *any_noncanonical_p
= true;
8540 return canon_argtypes
;
8543 /* The canonical argument types are the same as ARGTYPES. */
8547 /* Construct, lay out and return
8548 the type of functions returning type VALUE_TYPE
8549 given arguments of types ARG_TYPES.
8550 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
8551 are data type nodes for the arguments of the function.
8552 If such a type has already been constructed, reuse it. */
8555 build_function_type (tree value_type
, tree arg_types
)
8558 inchash::hash hstate
;
8559 bool any_structural_p
, any_noncanonical_p
;
8560 tree canon_argtypes
;
8562 if (TREE_CODE (value_type
) == FUNCTION_TYPE
)
8564 error ("function return type cannot be function");
8565 value_type
= integer_type_node
;
8568 /* Make a node of the sort we want. */
8569 t
= make_node (FUNCTION_TYPE
);
8570 TREE_TYPE (t
) = value_type
;
8571 TYPE_ARG_TYPES (t
) = arg_types
;
8573 /* If we already have such a type, use the old one. */
8574 hashval_t hash
= type_hash_canon_hash (t
);
8575 t
= type_hash_canon (hash
, t
);
8577 /* Set up the canonical type. */
8578 any_structural_p
= TYPE_STRUCTURAL_EQUALITY_P (value_type
);
8579 any_noncanonical_p
= TYPE_CANONICAL (value_type
) != value_type
;
8580 canon_argtypes
= maybe_canonicalize_argtypes (arg_types
,
8582 &any_noncanonical_p
);
8583 if (any_structural_p
)
8584 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8585 else if (any_noncanonical_p
)
8586 TYPE_CANONICAL (t
) = build_function_type (TYPE_CANONICAL (value_type
),
8589 if (!COMPLETE_TYPE_P (t
))
8594 /* Build a function type. The RETURN_TYPE is the type returned by the
8595 function. If VAARGS is set, no void_type_node is appended to the
8596 list. ARGP must be always be terminated be a NULL_TREE. */
8599 build_function_type_list_1 (bool vaargs
, tree return_type
, va_list argp
)
8603 t
= va_arg (argp
, tree
);
8604 for (args
= NULL_TREE
; t
!= NULL_TREE
; t
= va_arg (argp
, tree
))
8605 args
= tree_cons (NULL_TREE
, t
, args
);
8610 if (args
!= NULL_TREE
)
8611 args
= nreverse (args
);
8612 gcc_assert (last
!= void_list_node
);
8614 else if (args
== NULL_TREE
)
8615 args
= void_list_node
;
8619 args
= nreverse (args
);
8620 TREE_CHAIN (last
) = void_list_node
;
8622 args
= build_function_type (return_type
, args
);
8627 /* Build a function type. The RETURN_TYPE is the type returned by the
8628 function. If additional arguments are provided, they are
8629 additional argument types. The list of argument types must always
8630 be terminated by NULL_TREE. */
8633 build_function_type_list (tree return_type
, ...)
8638 va_start (p
, return_type
);
8639 args
= build_function_type_list_1 (false, return_type
, p
);
8644 /* Build a variable argument function type. The RETURN_TYPE is the
8645 type returned by the function. If additional arguments are provided,
8646 they are additional argument types. The list of argument types must
8647 always be terminated by NULL_TREE. */
8650 build_varargs_function_type_list (tree return_type
, ...)
8655 va_start (p
, return_type
);
8656 args
= build_function_type_list_1 (true, return_type
, p
);
8662 /* Build a function type. RETURN_TYPE is the type returned by the
8663 function; VAARGS indicates whether the function takes varargs. The
8664 function takes N named arguments, the types of which are provided in
8668 build_function_type_array_1 (bool vaargs
, tree return_type
, int n
,
8672 tree t
= vaargs
? NULL_TREE
: void_list_node
;
8674 for (i
= n
- 1; i
>= 0; i
--)
8675 t
= tree_cons (NULL_TREE
, arg_types
[i
], t
);
8677 return build_function_type (return_type
, t
);
8680 /* Build a function type. RETURN_TYPE is the type returned by the
8681 function. The function takes N named arguments, the types of which
8682 are provided in ARG_TYPES. */
8685 build_function_type_array (tree return_type
, int n
, tree
*arg_types
)
8687 return build_function_type_array_1 (false, return_type
, n
, arg_types
);
8690 /* Build a variable argument function type. RETURN_TYPE is the type
8691 returned by the function. The function takes N named arguments, the
8692 types of which are provided in ARG_TYPES. */
8695 build_varargs_function_type_array (tree return_type
, int n
, tree
*arg_types
)
8697 return build_function_type_array_1 (true, return_type
, n
, arg_types
);
8700 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
8701 and ARGTYPES (a TREE_LIST) are the return type and arguments types
8702 for the method. An implicit additional parameter (of type
8703 pointer-to-BASETYPE) is added to the ARGTYPES. */
8706 build_method_type_directly (tree basetype
,
8712 bool any_structural_p
, any_noncanonical_p
;
8713 tree canon_argtypes
;
8715 /* Make a node of the sort we want. */
8716 t
= make_node (METHOD_TYPE
);
8718 TYPE_METHOD_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
8719 TREE_TYPE (t
) = rettype
;
8720 ptype
= build_pointer_type (basetype
);
8722 /* The actual arglist for this function includes a "hidden" argument
8723 which is "this". Put it into the list of argument types. */
8724 argtypes
= tree_cons (NULL_TREE
, ptype
, argtypes
);
8725 TYPE_ARG_TYPES (t
) = argtypes
;
8727 /* If we already have such a type, use the old one. */
8728 hashval_t hash
= type_hash_canon_hash (t
);
8729 t
= type_hash_canon (hash
, t
);
8731 /* Set up the canonical type. */
8733 = (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
8734 || TYPE_STRUCTURAL_EQUALITY_P (rettype
));
8736 = (TYPE_CANONICAL (basetype
) != basetype
8737 || TYPE_CANONICAL (rettype
) != rettype
);
8738 canon_argtypes
= maybe_canonicalize_argtypes (TREE_CHAIN (argtypes
),
8740 &any_noncanonical_p
);
8741 if (any_structural_p
)
8742 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8743 else if (any_noncanonical_p
)
8745 = build_method_type_directly (TYPE_CANONICAL (basetype
),
8746 TYPE_CANONICAL (rettype
),
8748 if (!COMPLETE_TYPE_P (t
))
8754 /* Construct, lay out and return the type of methods belonging to class
8755 BASETYPE and whose arguments and values are described by TYPE.
8756 If that type exists already, reuse it.
8757 TYPE must be a FUNCTION_TYPE node. */
8760 build_method_type (tree basetype
, tree type
)
8762 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
8764 return build_method_type_directly (basetype
,
8766 TYPE_ARG_TYPES (type
));
8769 /* Construct, lay out and return the type of offsets to a value
8770 of type TYPE, within an object of type BASETYPE.
8771 If a suitable offset type exists already, reuse it. */
8774 build_offset_type (tree basetype
, tree type
)
8778 /* Make a node of the sort we want. */
8779 t
= make_node (OFFSET_TYPE
);
8781 TYPE_OFFSET_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
8782 TREE_TYPE (t
) = type
;
8784 /* If we already have such a type, use the old one. */
8785 hashval_t hash
= type_hash_canon_hash (t
);
8786 t
= type_hash_canon (hash
, t
);
8788 if (!COMPLETE_TYPE_P (t
))
8791 if (TYPE_CANONICAL (t
) == t
)
8793 if (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
8794 || TYPE_STRUCTURAL_EQUALITY_P (type
))
8795 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8796 else if (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)) != basetype
8797 || TYPE_CANONICAL (type
) != type
)
8799 = build_offset_type (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)),
8800 TYPE_CANONICAL (type
));
8806 /* Create a complex type whose components are COMPONENT_TYPE.
8808 If NAMED is true, the type is given a TYPE_NAME. We do not always
8809 do so because this creates a DECL node and thus make the DECL_UIDs
8810 dependent on the type canonicalization hashtable, which is GC-ed,
8811 so the DECL_UIDs would not be stable wrt garbage collection. */
8814 build_complex_type (tree component_type
, bool named
)
8818 gcc_assert (INTEGRAL_TYPE_P (component_type
)
8819 || SCALAR_FLOAT_TYPE_P (component_type
)
8820 || FIXED_POINT_TYPE_P (component_type
));
8822 /* Make a node of the sort we want. */
8823 t
= make_node (COMPLEX_TYPE
);
8825 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (component_type
);
8827 /* If we already have such a type, use the old one. */
8828 hashval_t hash
= type_hash_canon_hash (t
);
8829 t
= type_hash_canon (hash
, t
);
8831 if (!COMPLETE_TYPE_P (t
))
8834 if (TYPE_CANONICAL (t
) == t
)
8836 if (TYPE_STRUCTURAL_EQUALITY_P (component_type
))
8837 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8838 else if (TYPE_CANONICAL (component_type
) != component_type
)
8840 = build_complex_type (TYPE_CANONICAL (component_type
), named
);
8843 /* We need to create a name, since complex is a fundamental type. */
8844 if (!TYPE_NAME (t
) && named
)
8847 if (component_type
== char_type_node
)
8848 name
= "complex char";
8849 else if (component_type
== signed_char_type_node
)
8850 name
= "complex signed char";
8851 else if (component_type
== unsigned_char_type_node
)
8852 name
= "complex unsigned char";
8853 else if (component_type
== short_integer_type_node
)
8854 name
= "complex short int";
8855 else if (component_type
== short_unsigned_type_node
)
8856 name
= "complex short unsigned int";
8857 else if (component_type
== integer_type_node
)
8858 name
= "complex int";
8859 else if (component_type
== unsigned_type_node
)
8860 name
= "complex unsigned int";
8861 else if (component_type
== long_integer_type_node
)
8862 name
= "complex long int";
8863 else if (component_type
== long_unsigned_type_node
)
8864 name
= "complex long unsigned int";
8865 else if (component_type
== long_long_integer_type_node
)
8866 name
= "complex long long int";
8867 else if (component_type
== long_long_unsigned_type_node
)
8868 name
= "complex long long unsigned int";
8873 TYPE_NAME (t
) = build_decl (UNKNOWN_LOCATION
, TYPE_DECL
,
8874 get_identifier (name
), t
);
8877 return build_qualified_type (t
, TYPE_QUALS (component_type
));
8880 /* If TYPE is a real or complex floating-point type and the target
8881 does not directly support arithmetic on TYPE then return the wider
8882 type to be used for arithmetic on TYPE. Otherwise, return
8886 excess_precision_type (tree type
)
8888 /* The target can give two different responses to the question of
8889 which excess precision mode it would like depending on whether we
8890 are in -fexcess-precision=standard or -fexcess-precision=fast. */
8892 enum excess_precision_type requested_type
8893 = (flag_excess_precision
== EXCESS_PRECISION_FAST
8894 ? EXCESS_PRECISION_TYPE_FAST
8895 : EXCESS_PRECISION_TYPE_STANDARD
);
8897 enum flt_eval_method target_flt_eval_method
8898 = targetm
.c
.excess_precision (requested_type
);
8900 /* The target should not ask for unpredictable float evaluation (though
8901 it might advertise that implicitly the evaluation is unpredictable,
8902 but we don't care about that here, it will have been reported
8903 elsewhere). If it does ask for unpredictable evaluation, we have
8904 nothing to do here. */
8905 gcc_assert (target_flt_eval_method
!= FLT_EVAL_METHOD_UNPREDICTABLE
);
8907 /* Nothing to do. The target has asked for all types we know about
8908 to be computed with their native precision and range. */
8909 if (target_flt_eval_method
== FLT_EVAL_METHOD_PROMOTE_TO_FLOAT16
)
8912 /* The target will promote this type in a target-dependent way, so excess
8913 precision ought to leave it alone. */
8914 if (targetm
.promoted_type (type
) != NULL_TREE
)
8917 machine_mode float16_type_mode
= (float16_type_node
8918 ? TYPE_MODE (float16_type_node
)
8920 machine_mode float_type_mode
= TYPE_MODE (float_type_node
);
8921 machine_mode double_type_mode
= TYPE_MODE (double_type_node
);
8923 switch (TREE_CODE (type
))
8927 machine_mode type_mode
= TYPE_MODE (type
);
8928 switch (target_flt_eval_method
)
8930 case FLT_EVAL_METHOD_PROMOTE_TO_FLOAT
:
8931 if (type_mode
== float16_type_mode
)
8932 return float_type_node
;
8934 case FLT_EVAL_METHOD_PROMOTE_TO_DOUBLE
:
8935 if (type_mode
== float16_type_mode
8936 || type_mode
== float_type_mode
)
8937 return double_type_node
;
8939 case FLT_EVAL_METHOD_PROMOTE_TO_LONG_DOUBLE
:
8940 if (type_mode
== float16_type_mode
8941 || type_mode
== float_type_mode
8942 || type_mode
== double_type_mode
)
8943 return long_double_type_node
;
8952 if (TREE_CODE (TREE_TYPE (type
)) != REAL_TYPE
)
8954 machine_mode type_mode
= TYPE_MODE (TREE_TYPE (type
));
8955 switch (target_flt_eval_method
)
8957 case FLT_EVAL_METHOD_PROMOTE_TO_FLOAT
:
8958 if (type_mode
== float16_type_mode
)
8959 return complex_float_type_node
;
8961 case FLT_EVAL_METHOD_PROMOTE_TO_DOUBLE
:
8962 if (type_mode
== float16_type_mode
8963 || type_mode
== float_type_mode
)
8964 return complex_double_type_node
;
8966 case FLT_EVAL_METHOD_PROMOTE_TO_LONG_DOUBLE
:
8967 if (type_mode
== float16_type_mode
8968 || type_mode
== float_type_mode
8969 || type_mode
== double_type_mode
)
8970 return complex_long_double_type_node
;
8984 /* Return OP, stripped of any conversions to wider types as much as is safe.
8985 Converting the value back to OP's type makes a value equivalent to OP.
8987 If FOR_TYPE is nonzero, we return a value which, if converted to
8988 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
8990 OP must have integer, real or enumeral type. Pointers are not allowed!
8992 There are some cases where the obvious value we could return
8993 would regenerate to OP if converted to OP's type,
8994 but would not extend like OP to wider types.
8995 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
8996 For example, if OP is (unsigned short)(signed char)-1,
8997 we avoid returning (signed char)-1 if FOR_TYPE is int,
8998 even though extending that to an unsigned short would regenerate OP,
8999 since the result of extending (signed char)-1 to (int)
9000 is different from (int) OP. */
9003 get_unwidened (tree op
, tree for_type
)
9005 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
9006 tree type
= TREE_TYPE (op
);
9008 = TYPE_PRECISION (for_type
!= 0 ? for_type
: type
);
9010 = (for_type
!= 0 && for_type
!= type
9011 && final_prec
> TYPE_PRECISION (type
)
9012 && TYPE_UNSIGNED (type
));
9015 while (CONVERT_EXPR_P (op
))
9019 /* TYPE_PRECISION on vector types has different meaning
9020 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
9021 so avoid them here. */
9022 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op
, 0))) == VECTOR_TYPE
)
9025 bitschange
= TYPE_PRECISION (TREE_TYPE (op
))
9026 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0)));
9028 /* Truncations are many-one so cannot be removed.
9029 Unless we are later going to truncate down even farther. */
9031 && final_prec
> TYPE_PRECISION (TREE_TYPE (op
)))
9034 /* See what's inside this conversion. If we decide to strip it,
9036 op
= TREE_OPERAND (op
, 0);
9038 /* If we have not stripped any zero-extensions (uns is 0),
9039 we can strip any kind of extension.
9040 If we have previously stripped a zero-extension,
9041 only zero-extensions can safely be stripped.
9042 Any extension can be stripped if the bits it would produce
9043 are all going to be discarded later by truncating to FOR_TYPE. */
9047 if (! uns
|| final_prec
<= TYPE_PRECISION (TREE_TYPE (op
)))
9049 /* TYPE_UNSIGNED says whether this is a zero-extension.
9050 Let's avoid computing it if it does not affect WIN
9051 and if UNS will not be needed again. */
9053 || CONVERT_EXPR_P (op
))
9054 && TYPE_UNSIGNED (TREE_TYPE (op
)))
9062 /* If we finally reach a constant see if it fits in sth smaller and
9063 in that case convert it. */
9064 if (TREE_CODE (win
) == INTEGER_CST
)
9066 tree wtype
= TREE_TYPE (win
);
9067 unsigned prec
= wi::min_precision (win
, TYPE_SIGN (wtype
));
9069 prec
= MAX (prec
, final_prec
);
9070 if (prec
< TYPE_PRECISION (wtype
))
9072 tree t
= lang_hooks
.types
.type_for_size (prec
, TYPE_UNSIGNED (wtype
));
9073 if (t
&& TYPE_PRECISION (t
) < TYPE_PRECISION (wtype
))
9074 win
= fold_convert (t
, win
);
9081 /* Return OP or a simpler expression for a narrower value
9082 which can be sign-extended or zero-extended to give back OP.
9083 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
9084 or 0 if the value should be sign-extended. */
9087 get_narrower (tree op
, int *unsignedp_ptr
)
9092 bool integral_p
= INTEGRAL_TYPE_P (TREE_TYPE (op
));
9094 while (TREE_CODE (op
) == NOP_EXPR
)
9097 = (TYPE_PRECISION (TREE_TYPE (op
))
9098 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0))));
9100 /* Truncations are many-one so cannot be removed. */
9104 /* See what's inside this conversion. If we decide to strip it,
9109 op
= TREE_OPERAND (op
, 0);
9110 /* An extension: the outermost one can be stripped,
9111 but remember whether it is zero or sign extension. */
9113 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
9114 /* Otherwise, if a sign extension has been stripped,
9115 only sign extensions can now be stripped;
9116 if a zero extension has been stripped, only zero-extensions. */
9117 else if (uns
!= TYPE_UNSIGNED (TREE_TYPE (op
)))
9121 else /* bitschange == 0 */
9123 /* A change in nominal type can always be stripped, but we must
9124 preserve the unsignedness. */
9126 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
9128 op
= TREE_OPERAND (op
, 0);
9129 /* Keep trying to narrow, but don't assign op to win if it
9130 would turn an integral type into something else. */
9131 if (INTEGRAL_TYPE_P (TREE_TYPE (op
)) != integral_p
)
9138 if (TREE_CODE (op
) == COMPONENT_REF
9139 /* Since type_for_size always gives an integer type. */
9140 && TREE_CODE (TREE_TYPE (op
)) != REAL_TYPE
9141 && TREE_CODE (TREE_TYPE (op
)) != FIXED_POINT_TYPE
9142 /* Ensure field is laid out already. */
9143 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0
9144 && tree_fits_uhwi_p (DECL_SIZE (TREE_OPERAND (op
, 1))))
9146 unsigned HOST_WIDE_INT innerprec
9147 = tree_to_uhwi (DECL_SIZE (TREE_OPERAND (op
, 1)));
9148 int unsignedp
= (DECL_UNSIGNED (TREE_OPERAND (op
, 1))
9149 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op
, 1))));
9150 tree type
= lang_hooks
.types
.type_for_size (innerprec
, unsignedp
);
9152 /* We can get this structure field in a narrower type that fits it,
9153 but the resulting extension to its nominal type (a fullword type)
9154 must satisfy the same conditions as for other extensions.
9156 Do this only for fields that are aligned (not bit-fields),
9157 because when bit-field insns will be used there is no
9158 advantage in doing this. */
9160 if (innerprec
< TYPE_PRECISION (TREE_TYPE (op
))
9161 && ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1))
9162 && (first
|| uns
== DECL_UNSIGNED (TREE_OPERAND (op
, 1)))
9166 uns
= DECL_UNSIGNED (TREE_OPERAND (op
, 1));
9167 win
= fold_convert (type
, op
);
9171 *unsignedp_ptr
= uns
;
9175 /* Return true if integer constant C has a value that is permissible
9176 for TYPE, an integral type. */
9179 int_fits_type_p (const_tree c
, const_tree type
)
9181 tree type_low_bound
, type_high_bound
;
9182 bool ok_for_low_bound
, ok_for_high_bound
;
9183 signop sgn_c
= TYPE_SIGN (TREE_TYPE (c
));
9185 /* Non-standard boolean types can have arbitrary precision but various
9186 transformations assume that they can only take values 0 and +/-1. */
9187 if (TREE_CODE (type
) == BOOLEAN_TYPE
)
9188 return wi::fits_to_boolean_p (c
, type
);
9191 type_low_bound
= TYPE_MIN_VALUE (type
);
9192 type_high_bound
= TYPE_MAX_VALUE (type
);
9194 /* If at least one bound of the type is a constant integer, we can check
9195 ourselves and maybe make a decision. If no such decision is possible, but
9196 this type is a subtype, try checking against that. Otherwise, use
9197 fits_to_tree_p, which checks against the precision.
9199 Compute the status for each possibly constant bound, and return if we see
9200 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
9201 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
9202 for "constant known to fit". */
9204 /* Check if c >= type_low_bound. */
9205 if (type_low_bound
&& TREE_CODE (type_low_bound
) == INTEGER_CST
)
9207 if (tree_int_cst_lt (c
, type_low_bound
))
9209 ok_for_low_bound
= true;
9212 ok_for_low_bound
= false;
9214 /* Check if c <= type_high_bound. */
9215 if (type_high_bound
&& TREE_CODE (type_high_bound
) == INTEGER_CST
)
9217 if (tree_int_cst_lt (type_high_bound
, c
))
9219 ok_for_high_bound
= true;
9222 ok_for_high_bound
= false;
9224 /* If the constant fits both bounds, the result is known. */
9225 if (ok_for_low_bound
&& ok_for_high_bound
)
9228 /* Perform some generic filtering which may allow making a decision
9229 even if the bounds are not constant. First, negative integers
9230 never fit in unsigned types, */
9231 if (TYPE_UNSIGNED (type
) && sgn_c
== SIGNED
&& wi::neg_p (c
))
9234 /* Second, narrower types always fit in wider ones. */
9235 if (TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (c
)))
9238 /* Third, unsigned integers with top bit set never fit signed types. */
9239 if (!TYPE_UNSIGNED (type
) && sgn_c
== UNSIGNED
)
9241 int prec
= GET_MODE_PRECISION (TYPE_MODE (TREE_TYPE (c
))) - 1;
9242 if (prec
< TYPE_PRECISION (TREE_TYPE (c
)))
9244 /* When a tree_cst is converted to a wide-int, the precision
9245 is taken from the type. However, if the precision of the
9246 mode underneath the type is smaller than that, it is
9247 possible that the value will not fit. The test below
9248 fails if any bit is set between the sign bit of the
9249 underlying mode and the top bit of the type. */
9250 if (wi::ne_p (wi::zext (c
, prec
- 1), c
))
9253 else if (wi::neg_p (c
))
9257 /* If we haven't been able to decide at this point, there nothing more we
9258 can check ourselves here. Look at the base type if we have one and it
9259 has the same precision. */
9260 if (TREE_CODE (type
) == INTEGER_TYPE
9261 && TREE_TYPE (type
) != 0
9262 && TYPE_PRECISION (type
) == TYPE_PRECISION (TREE_TYPE (type
)))
9264 type
= TREE_TYPE (type
);
9268 /* Or to fits_to_tree_p, if nothing else. */
9269 return wi::fits_to_tree_p (c
, type
);
9272 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
9273 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
9274 represented (assuming two's-complement arithmetic) within the bit
9275 precision of the type are returned instead. */
9278 get_type_static_bounds (const_tree type
, mpz_t min
, mpz_t max
)
9280 if (!POINTER_TYPE_P (type
) && TYPE_MIN_VALUE (type
)
9281 && TREE_CODE (TYPE_MIN_VALUE (type
)) == INTEGER_CST
)
9282 wi::to_mpz (TYPE_MIN_VALUE (type
), min
, TYPE_SIGN (type
));
9285 if (TYPE_UNSIGNED (type
))
9286 mpz_set_ui (min
, 0);
9289 wide_int mn
= wi::min_value (TYPE_PRECISION (type
), SIGNED
);
9290 wi::to_mpz (mn
, min
, SIGNED
);
9294 if (!POINTER_TYPE_P (type
) && TYPE_MAX_VALUE (type
)
9295 && TREE_CODE (TYPE_MAX_VALUE (type
)) == INTEGER_CST
)
9296 wi::to_mpz (TYPE_MAX_VALUE (type
), max
, TYPE_SIGN (type
));
9299 wide_int mn
= wi::max_value (TYPE_PRECISION (type
), TYPE_SIGN (type
));
9300 wi::to_mpz (mn
, max
, TYPE_SIGN (type
));
9304 /* Return true if VAR is an automatic variable defined in function FN. */
9307 auto_var_in_fn_p (const_tree var
, const_tree fn
)
9309 return (DECL_P (var
) && DECL_CONTEXT (var
) == fn
9310 && ((((VAR_P (var
) && ! DECL_EXTERNAL (var
))
9311 || TREE_CODE (var
) == PARM_DECL
)
9312 && ! TREE_STATIC (var
))
9313 || TREE_CODE (var
) == LABEL_DECL
9314 || TREE_CODE (var
) == RESULT_DECL
));
9317 /* Subprogram of following function. Called by walk_tree.
9319 Return *TP if it is an automatic variable or parameter of the
9320 function passed in as DATA. */
9323 find_var_from_fn (tree
*tp
, int *walk_subtrees
, void *data
)
9325 tree fn
= (tree
) data
;
9330 else if (DECL_P (*tp
)
9331 && auto_var_in_fn_p (*tp
, fn
))
9337 /* Returns true if T is, contains, or refers to a type with variable
9338 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
9339 arguments, but not the return type. If FN is nonzero, only return
9340 true if a modifier of the type or position of FN is a variable or
9341 parameter inside FN.
9343 This concept is more general than that of C99 'variably modified types':
9344 in C99, a struct type is never variably modified because a VLA may not
9345 appear as a structure member. However, in GNU C code like:
9347 struct S { int i[f()]; };
9349 is valid, and other languages may define similar constructs. */
9352 variably_modified_type_p (tree type
, tree fn
)
9356 /* Test if T is either variable (if FN is zero) or an expression containing
9357 a variable in FN. If TYPE isn't gimplified, return true also if
9358 gimplify_one_sizepos would gimplify the expression into a local
9360 #define RETURN_TRUE_IF_VAR(T) \
9361 do { tree _t = (T); \
9362 if (_t != NULL_TREE \
9363 && _t != error_mark_node \
9364 && TREE_CODE (_t) != INTEGER_CST \
9365 && TREE_CODE (_t) != PLACEHOLDER_EXPR \
9367 || (!TYPE_SIZES_GIMPLIFIED (type) \
9368 && !is_gimple_sizepos (_t)) \
9369 || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
9370 return true; } while (0)
9372 if (type
== error_mark_node
)
9375 /* If TYPE itself has variable size, it is variably modified. */
9376 RETURN_TRUE_IF_VAR (TYPE_SIZE (type
));
9377 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type
));
9379 switch (TREE_CODE (type
))
9382 case REFERENCE_TYPE
:
9384 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
9390 /* If TYPE is a function type, it is variably modified if the
9391 return type is variably modified. */
9392 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
9398 case FIXED_POINT_TYPE
:
9401 /* Scalar types are variably modified if their end points
9403 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type
));
9404 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type
));
9409 case QUAL_UNION_TYPE
:
9410 /* We can't see if any of the fields are variably-modified by the
9411 definition we normally use, since that would produce infinite
9412 recursion via pointers. */
9413 /* This is variably modified if some field's type is. */
9414 for (t
= TYPE_FIELDS (type
); t
; t
= DECL_CHAIN (t
))
9415 if (TREE_CODE (t
) == FIELD_DECL
)
9417 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t
));
9418 RETURN_TRUE_IF_VAR (DECL_SIZE (t
));
9419 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t
));
9421 if (TREE_CODE (type
) == QUAL_UNION_TYPE
)
9422 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t
));
9427 /* Do not call ourselves to avoid infinite recursion. This is
9428 variably modified if the element type is. */
9429 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type
)));
9430 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type
)));
9437 /* The current language may have other cases to check, but in general,
9438 all other types are not variably modified. */
9439 return lang_hooks
.tree_inlining
.var_mod_type_p (type
, fn
);
9441 #undef RETURN_TRUE_IF_VAR
9444 /* Given a DECL or TYPE, return the scope in which it was declared, or
9445 NULL_TREE if there is no containing scope. */
9448 get_containing_scope (const_tree t
)
9450 return (TYPE_P (t
) ? TYPE_CONTEXT (t
) : DECL_CONTEXT (t
));
9453 /* Return the innermost context enclosing DECL that is
9454 a FUNCTION_DECL, or zero if none. */
9457 decl_function_context (const_tree decl
)
9461 if (TREE_CODE (decl
) == ERROR_MARK
)
9464 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
9465 where we look up the function at runtime. Such functions always take
9466 a first argument of type 'pointer to real context'.
9468 C++ should really be fixed to use DECL_CONTEXT for the real context,
9469 and use something else for the "virtual context". */
9470 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VINDEX (decl
))
9473 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl
)))));
9475 context
= DECL_CONTEXT (decl
);
9477 while (context
&& TREE_CODE (context
) != FUNCTION_DECL
)
9479 if (TREE_CODE (context
) == BLOCK
)
9480 context
= BLOCK_SUPERCONTEXT (context
);
9482 context
= get_containing_scope (context
);
9488 /* Return the innermost context enclosing DECL that is
9489 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
9490 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
9493 decl_type_context (const_tree decl
)
9495 tree context
= DECL_CONTEXT (decl
);
9498 switch (TREE_CODE (context
))
9500 case NAMESPACE_DECL
:
9501 case TRANSLATION_UNIT_DECL
:
9506 case QUAL_UNION_TYPE
:
9511 context
= DECL_CONTEXT (context
);
9515 context
= BLOCK_SUPERCONTEXT (context
);
9525 /* CALL is a CALL_EXPR. Return the declaration for the function
9526 called, or NULL_TREE if the called function cannot be
9530 get_callee_fndecl (const_tree call
)
9534 if (call
== error_mark_node
)
9535 return error_mark_node
;
9537 /* It's invalid to call this function with anything but a
9539 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
9541 /* The first operand to the CALL is the address of the function
9543 addr
= CALL_EXPR_FN (call
);
9545 /* If there is no function, return early. */
9546 if (addr
== NULL_TREE
)
9551 /* If this is a readonly function pointer, extract its initial value. */
9552 if (DECL_P (addr
) && TREE_CODE (addr
) != FUNCTION_DECL
9553 && TREE_READONLY (addr
) && ! TREE_THIS_VOLATILE (addr
)
9554 && DECL_INITIAL (addr
))
9555 addr
= DECL_INITIAL (addr
);
9557 /* If the address is just `&f' for some function `f', then we know
9558 that `f' is being called. */
9559 if (TREE_CODE (addr
) == ADDR_EXPR
9560 && TREE_CODE (TREE_OPERAND (addr
, 0)) == FUNCTION_DECL
)
9561 return TREE_OPERAND (addr
, 0);
9563 /* We couldn't figure out what was being called. */
9567 /* If CALL_EXPR CALL calls a normal built-in function or an internal function,
9568 return the associated function code, otherwise return CFN_LAST. */
9571 get_call_combined_fn (const_tree call
)
9573 /* It's invalid to call this function with anything but a CALL_EXPR. */
9574 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
9576 if (!CALL_EXPR_FN (call
))
9577 return as_combined_fn (CALL_EXPR_IFN (call
));
9579 tree fndecl
= get_callee_fndecl (call
);
9580 if (fndecl
&& DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
)
9581 return as_combined_fn (DECL_FUNCTION_CODE (fndecl
));
9586 #define TREE_MEM_USAGE_SPACES 40
9588 /* Print debugging information about tree nodes generated during the compile,
9589 and any language-specific information. */
9592 dump_tree_statistics (void)
9594 if (GATHER_STATISTICS
)
9597 int total_nodes
, total_bytes
;
9598 fprintf (stderr
, "\nKind Nodes Bytes\n");
9599 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9600 total_nodes
= total_bytes
= 0;
9601 for (i
= 0; i
< (int) all_kinds
; i
++)
9603 fprintf (stderr
, "%-20s %7d %10d\n", tree_node_kind_names
[i
],
9604 tree_node_counts
[i
], tree_node_sizes
[i
]);
9605 total_nodes
+= tree_node_counts
[i
];
9606 total_bytes
+= tree_node_sizes
[i
];
9608 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9609 fprintf (stderr
, "%-20s %7d %10d\n", "Total", total_nodes
, total_bytes
);
9610 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9611 fprintf (stderr
, "Code Nodes\n");
9612 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9613 for (i
= 0; i
< (int) MAX_TREE_CODES
; i
++)
9614 fprintf (stderr
, "%-32s %7d\n", get_tree_code_name ((enum tree_code
) i
),
9615 tree_code_counts
[i
]);
9616 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9617 fprintf (stderr
, "\n");
9618 ssanames_print_statistics ();
9619 fprintf (stderr
, "\n");
9620 phinodes_print_statistics ();
9621 fprintf (stderr
, "\n");
9624 fprintf (stderr
, "(No per-node statistics)\n");
9626 print_type_hash_statistics ();
9627 print_debug_expr_statistics ();
9628 print_value_expr_statistics ();
9629 lang_hooks
.print_statistics ();
9632 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
9634 /* Generate a crc32 of the low BYTES bytes of VALUE. */
9637 crc32_unsigned_n (unsigned chksum
, unsigned value
, unsigned bytes
)
9639 /* This relies on the raw feedback's top 4 bits being zero. */
9640 #define FEEDBACK(X) ((X) * 0x04c11db7)
9641 #define SYNDROME(X) (FEEDBACK ((X) & 1) ^ FEEDBACK ((X) & 2) \
9642 ^ FEEDBACK ((X) & 4) ^ FEEDBACK ((X) & 8))
9643 static const unsigned syndromes
[16] =
9645 SYNDROME(0x0), SYNDROME(0x1), SYNDROME(0x2), SYNDROME(0x3),
9646 SYNDROME(0x4), SYNDROME(0x5), SYNDROME(0x6), SYNDROME(0x7),
9647 SYNDROME(0x8), SYNDROME(0x9), SYNDROME(0xa), SYNDROME(0xb),
9648 SYNDROME(0xc), SYNDROME(0xd), SYNDROME(0xe), SYNDROME(0xf),
9653 value
<<= (32 - bytes
* 8);
9654 for (unsigned ix
= bytes
* 2; ix
--; value
<<= 4)
9656 unsigned feedback
= syndromes
[((value
^ chksum
) >> 28) & 0xf];
9658 chksum
= (chksum
<< 4) ^ feedback
;
9664 /* Generate a crc32 of a string. */
9667 crc32_string (unsigned chksum
, const char *string
)
9670 chksum
= crc32_byte (chksum
, *string
);
9675 /* P is a string that will be used in a symbol. Mask out any characters
9676 that are not valid in that context. */
9679 clean_symbol_name (char *p
)
9683 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
9686 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
9693 /* For anonymous aggregate types, we need some sort of name to
9694 hold on to. In practice, this should not appear, but it should
9695 not be harmful if it does. */
9697 anon_aggrname_p(const_tree id_node
)
9699 #ifndef NO_DOT_IN_LABEL
9700 return (IDENTIFIER_POINTER (id_node
)[0] == '.'
9701 && IDENTIFIER_POINTER (id_node
)[1] == '_');
9702 #else /* NO_DOT_IN_LABEL */
9703 #ifndef NO_DOLLAR_IN_LABEL
9704 return (IDENTIFIER_POINTER (id_node
)[0] == '$' \
9705 && IDENTIFIER_POINTER (id_node
)[1] == '_');
9706 #else /* NO_DOLLAR_IN_LABEL */
9707 #define ANON_AGGRNAME_PREFIX "__anon_"
9708 return (!strncmp (IDENTIFIER_POINTER (id_node
), ANON_AGGRNAME_PREFIX
,
9709 sizeof (ANON_AGGRNAME_PREFIX
) - 1));
9710 #endif /* NO_DOLLAR_IN_LABEL */
9711 #endif /* NO_DOT_IN_LABEL */
9714 /* Return a format for an anonymous aggregate name. */
9716 anon_aggrname_format()
9718 #ifndef NO_DOT_IN_LABEL
9720 #else /* NO_DOT_IN_LABEL */
9721 #ifndef NO_DOLLAR_IN_LABEL
9723 #else /* NO_DOLLAR_IN_LABEL */
9725 #endif /* NO_DOLLAR_IN_LABEL */
9726 #endif /* NO_DOT_IN_LABEL */
9729 /* Generate a name for a special-purpose function.
9730 The generated name may need to be unique across the whole link.
9731 Changes to this function may also require corresponding changes to
9732 xstrdup_mask_random.
9733 TYPE is some string to identify the purpose of this function to the
9734 linker or collect2; it must start with an uppercase letter,
9736 I - for constructors
9738 N - for C++ anonymous namespaces
9739 F - for DWARF unwind frame information. */
9742 get_file_function_name (const char *type
)
9748 /* If we already have a name we know to be unique, just use that. */
9749 if (first_global_object_name
)
9750 p
= q
= ASTRDUP (first_global_object_name
);
9751 /* If the target is handling the constructors/destructors, they
9752 will be local to this file and the name is only necessary for
9754 We also assign sub_I and sub_D sufixes to constructors called from
9755 the global static constructors. These are always local. */
9756 else if (((type
[0] == 'I' || type
[0] == 'D') && targetm
.have_ctors_dtors
)
9757 || (strncmp (type
, "sub_", 4) == 0
9758 && (type
[4] == 'I' || type
[4] == 'D')))
9760 const char *file
= main_input_filename
;
9762 file
= LOCATION_FILE (input_location
);
9763 /* Just use the file's basename, because the full pathname
9764 might be quite long. */
9765 p
= q
= ASTRDUP (lbasename (file
));
9769 /* Otherwise, the name must be unique across the entire link.
9770 We don't have anything that we know to be unique to this translation
9771 unit, so use what we do have and throw in some randomness. */
9773 const char *name
= weak_global_object_name
;
9774 const char *file
= main_input_filename
;
9779 file
= LOCATION_FILE (input_location
);
9781 len
= strlen (file
);
9782 q
= (char *) alloca (9 + 19 + len
+ 1);
9783 memcpy (q
, file
, len
+ 1);
9785 snprintf (q
+ len
, 9 + 19 + 1, "_%08X_" HOST_WIDE_INT_PRINT_HEX
,
9786 crc32_string (0, name
), get_random_seed (false));
9791 clean_symbol_name (q
);
9792 buf
= (char *) alloca (sizeof (FILE_FUNCTION_FORMAT
) + strlen (p
)
9795 /* Set up the name of the file-level functions we may need.
9796 Use a global object (which is already required to be unique over
9797 the program) rather than the file name (which imposes extra
9799 sprintf (buf
, FILE_FUNCTION_FORMAT
, type
, p
);
9801 return get_identifier (buf
);
9804 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
9806 /* Complain that the tree code of NODE does not match the expected 0
9807 terminated list of trailing codes. The trailing code list can be
9808 empty, for a more vague error message. FILE, LINE, and FUNCTION
9809 are of the caller. */
9812 tree_check_failed (const_tree node
, const char *file
,
9813 int line
, const char *function
, ...)
9817 unsigned length
= 0;
9818 enum tree_code code
;
9820 va_start (args
, function
);
9821 while ((code
= (enum tree_code
) va_arg (args
, int)))
9822 length
+= 4 + strlen (get_tree_code_name (code
));
9827 va_start (args
, function
);
9828 length
+= strlen ("expected ");
9829 buffer
= tmp
= (char *) alloca (length
);
9831 while ((code
= (enum tree_code
) va_arg (args
, int)))
9833 const char *prefix
= length
? " or " : "expected ";
9835 strcpy (tmp
+ length
, prefix
);
9836 length
+= strlen (prefix
);
9837 strcpy (tmp
+ length
, get_tree_code_name (code
));
9838 length
+= strlen (get_tree_code_name (code
));
9843 buffer
= "unexpected node";
9845 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9846 buffer
, get_tree_code_name (TREE_CODE (node
)),
9847 function
, trim_filename (file
), line
);
9850 /* Complain that the tree code of NODE does match the expected 0
9851 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
9855 tree_not_check_failed (const_tree node
, const char *file
,
9856 int line
, const char *function
, ...)
9860 unsigned length
= 0;
9861 enum tree_code code
;
9863 va_start (args
, function
);
9864 while ((code
= (enum tree_code
) va_arg (args
, int)))
9865 length
+= 4 + strlen (get_tree_code_name (code
));
9867 va_start (args
, function
);
9868 buffer
= (char *) alloca (length
);
9870 while ((code
= (enum tree_code
) va_arg (args
, int)))
9874 strcpy (buffer
+ length
, " or ");
9877 strcpy (buffer
+ length
, get_tree_code_name (code
));
9878 length
+= strlen (get_tree_code_name (code
));
9882 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
9883 buffer
, get_tree_code_name (TREE_CODE (node
)),
9884 function
, trim_filename (file
), line
);
9887 /* Similar to tree_check_failed, except that we check for a class of tree
9888 code, given in CL. */
9891 tree_class_check_failed (const_tree node
, const enum tree_code_class cl
,
9892 const char *file
, int line
, const char *function
)
9895 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
9896 TREE_CODE_CLASS_STRING (cl
),
9897 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
9898 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9901 /* Similar to tree_check_failed, except that instead of specifying a
9902 dozen codes, use the knowledge that they're all sequential. */
9905 tree_range_check_failed (const_tree node
, const char *file
, int line
,
9906 const char *function
, enum tree_code c1
,
9910 unsigned length
= 0;
9913 for (c
= c1
; c
<= c2
; ++c
)
9914 length
+= 4 + strlen (get_tree_code_name ((enum tree_code
) c
));
9916 length
+= strlen ("expected ");
9917 buffer
= (char *) alloca (length
);
9920 for (c
= c1
; c
<= c2
; ++c
)
9922 const char *prefix
= length
? " or " : "expected ";
9924 strcpy (buffer
+ length
, prefix
);
9925 length
+= strlen (prefix
);
9926 strcpy (buffer
+ length
, get_tree_code_name ((enum tree_code
) c
));
9927 length
+= strlen (get_tree_code_name ((enum tree_code
) c
));
9930 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9931 buffer
, get_tree_code_name (TREE_CODE (node
)),
9932 function
, trim_filename (file
), line
);
9936 /* Similar to tree_check_failed, except that we check that a tree does
9937 not have the specified code, given in CL. */
9940 tree_not_class_check_failed (const_tree node
, const enum tree_code_class cl
,
9941 const char *file
, int line
, const char *function
)
9944 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
9945 TREE_CODE_CLASS_STRING (cl
),
9946 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
9947 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9951 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
9954 omp_clause_check_failed (const_tree node
, const char *file
, int line
,
9955 const char *function
, enum omp_clause_code code
)
9957 internal_error ("tree check: expected omp_clause %s, have %s in %s, at %s:%d",
9958 omp_clause_code_name
[code
], get_tree_code_name (TREE_CODE (node
)),
9959 function
, trim_filename (file
), line
);
9963 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
9966 omp_clause_range_check_failed (const_tree node
, const char *file
, int line
,
9967 const char *function
, enum omp_clause_code c1
,
9968 enum omp_clause_code c2
)
9971 unsigned length
= 0;
9974 for (c
= c1
; c
<= c2
; ++c
)
9975 length
+= 4 + strlen (omp_clause_code_name
[c
]);
9977 length
+= strlen ("expected ");
9978 buffer
= (char *) alloca (length
);
9981 for (c
= c1
; c
<= c2
; ++c
)
9983 const char *prefix
= length
? " or " : "expected ";
9985 strcpy (buffer
+ length
, prefix
);
9986 length
+= strlen (prefix
);
9987 strcpy (buffer
+ length
, omp_clause_code_name
[c
]);
9988 length
+= strlen (omp_clause_code_name
[c
]);
9991 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9992 buffer
, omp_clause_code_name
[TREE_CODE (node
)],
9993 function
, trim_filename (file
), line
);
9997 #undef DEFTREESTRUCT
9998 #define DEFTREESTRUCT(VAL, NAME) NAME,
10000 static const char *ts_enum_names
[] = {
10001 #include "treestruct.def"
10003 #undef DEFTREESTRUCT
10005 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
10007 /* Similar to tree_class_check_failed, except that we check for
10008 whether CODE contains the tree structure identified by EN. */
10011 tree_contains_struct_check_failed (const_tree node
,
10012 const enum tree_node_structure_enum en
,
10013 const char *file
, int line
,
10014 const char *function
)
10017 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
10019 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
10023 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
10024 (dynamically sized) vector. */
10027 tree_int_cst_elt_check_failed (int idx
, int len
, const char *file
, int line
,
10028 const char *function
)
10031 ("tree check: accessed elt %d of tree_int_cst with %d elts in %s, at %s:%d",
10032 idx
+ 1, len
, function
, trim_filename (file
), line
);
10035 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
10036 (dynamically sized) vector. */
10039 tree_vec_elt_check_failed (int idx
, int len
, const char *file
, int line
,
10040 const char *function
)
10043 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
10044 idx
+ 1, len
, function
, trim_filename (file
), line
);
10047 /* Similar to above, except that the check is for the bounds of the operand
10048 vector of an expression node EXP. */
10051 tree_operand_check_failed (int idx
, const_tree exp
, const char *file
,
10052 int line
, const char *function
)
10054 enum tree_code code
= TREE_CODE (exp
);
10056 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
10057 idx
+ 1, get_tree_code_name (code
), TREE_OPERAND_LENGTH (exp
),
10058 function
, trim_filename (file
), line
);
10061 /* Similar to above, except that the check is for the number of
10062 operands of an OMP_CLAUSE node. */
10065 omp_clause_operand_check_failed (int idx
, const_tree t
, const char *file
,
10066 int line
, const char *function
)
10069 ("tree check: accessed operand %d of omp_clause %s with %d operands "
10070 "in %s, at %s:%d", idx
+ 1, omp_clause_code_name
[OMP_CLAUSE_CODE (t
)],
10071 omp_clause_num_ops
[OMP_CLAUSE_CODE (t
)], function
,
10072 trim_filename (file
), line
);
10074 #endif /* ENABLE_TREE_CHECKING */
10076 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
10077 and mapped to the machine mode MODE. Initialize its fields and build
10078 the information necessary for debugging output. */
10081 make_vector_type (tree innertype
, int nunits
, machine_mode mode
)
10084 tree mv_innertype
= TYPE_MAIN_VARIANT (innertype
);
10086 t
= make_node (VECTOR_TYPE
);
10087 TREE_TYPE (t
) = mv_innertype
;
10088 SET_TYPE_VECTOR_SUBPARTS (t
, nunits
);
10089 SET_TYPE_MODE (t
, mode
);
10091 if (TYPE_STRUCTURAL_EQUALITY_P (mv_innertype
) || in_lto_p
)
10092 SET_TYPE_STRUCTURAL_EQUALITY (t
);
10093 else if ((TYPE_CANONICAL (mv_innertype
) != innertype
10094 || mode
!= VOIDmode
)
10095 && !VECTOR_BOOLEAN_TYPE_P (t
))
10097 = make_vector_type (TYPE_CANONICAL (mv_innertype
), nunits
, VOIDmode
);
10101 hashval_t hash
= type_hash_canon_hash (t
);
10102 t
= type_hash_canon (hash
, t
);
10104 /* We have built a main variant, based on the main variant of the
10105 inner type. Use it to build the variant we return. */
10106 if ((TYPE_ATTRIBUTES (innertype
) || TYPE_QUALS (innertype
))
10107 && TREE_TYPE (t
) != innertype
)
10108 return build_type_attribute_qual_variant (t
,
10109 TYPE_ATTRIBUTES (innertype
),
10110 TYPE_QUALS (innertype
));
10116 make_or_reuse_type (unsigned size
, int unsignedp
)
10120 if (size
== INT_TYPE_SIZE
)
10121 return unsignedp
? unsigned_type_node
: integer_type_node
;
10122 if (size
== CHAR_TYPE_SIZE
)
10123 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
10124 if (size
== SHORT_TYPE_SIZE
)
10125 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
10126 if (size
== LONG_TYPE_SIZE
)
10127 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
10128 if (size
== LONG_LONG_TYPE_SIZE
)
10129 return (unsignedp
? long_long_unsigned_type_node
10130 : long_long_integer_type_node
);
10132 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
10133 if (size
== int_n_data
[i
].bitsize
10134 && int_n_enabled_p
[i
])
10135 return (unsignedp
? int_n_trees
[i
].unsigned_type
10136 : int_n_trees
[i
].signed_type
);
10139 return make_unsigned_type (size
);
10141 return make_signed_type (size
);
10144 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
10147 make_or_reuse_fract_type (unsigned size
, int unsignedp
, int satp
)
10151 if (size
== SHORT_FRACT_TYPE_SIZE
)
10152 return unsignedp
? sat_unsigned_short_fract_type_node
10153 : sat_short_fract_type_node
;
10154 if (size
== FRACT_TYPE_SIZE
)
10155 return unsignedp
? sat_unsigned_fract_type_node
: sat_fract_type_node
;
10156 if (size
== LONG_FRACT_TYPE_SIZE
)
10157 return unsignedp
? sat_unsigned_long_fract_type_node
10158 : sat_long_fract_type_node
;
10159 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
10160 return unsignedp
? sat_unsigned_long_long_fract_type_node
10161 : sat_long_long_fract_type_node
;
10165 if (size
== SHORT_FRACT_TYPE_SIZE
)
10166 return unsignedp
? unsigned_short_fract_type_node
10167 : short_fract_type_node
;
10168 if (size
== FRACT_TYPE_SIZE
)
10169 return unsignedp
? unsigned_fract_type_node
: fract_type_node
;
10170 if (size
== LONG_FRACT_TYPE_SIZE
)
10171 return unsignedp
? unsigned_long_fract_type_node
10172 : long_fract_type_node
;
10173 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
10174 return unsignedp
? unsigned_long_long_fract_type_node
10175 : long_long_fract_type_node
;
10178 return make_fract_type (size
, unsignedp
, satp
);
10181 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
10184 make_or_reuse_accum_type (unsigned size
, int unsignedp
, int satp
)
10188 if (size
== SHORT_ACCUM_TYPE_SIZE
)
10189 return unsignedp
? sat_unsigned_short_accum_type_node
10190 : sat_short_accum_type_node
;
10191 if (size
== ACCUM_TYPE_SIZE
)
10192 return unsignedp
? sat_unsigned_accum_type_node
: sat_accum_type_node
;
10193 if (size
== LONG_ACCUM_TYPE_SIZE
)
10194 return unsignedp
? sat_unsigned_long_accum_type_node
10195 : sat_long_accum_type_node
;
10196 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
10197 return unsignedp
? sat_unsigned_long_long_accum_type_node
10198 : sat_long_long_accum_type_node
;
10202 if (size
== SHORT_ACCUM_TYPE_SIZE
)
10203 return unsignedp
? unsigned_short_accum_type_node
10204 : short_accum_type_node
;
10205 if (size
== ACCUM_TYPE_SIZE
)
10206 return unsignedp
? unsigned_accum_type_node
: accum_type_node
;
10207 if (size
== LONG_ACCUM_TYPE_SIZE
)
10208 return unsignedp
? unsigned_long_accum_type_node
10209 : long_accum_type_node
;
10210 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
10211 return unsignedp
? unsigned_long_long_accum_type_node
10212 : long_long_accum_type_node
;
10215 return make_accum_type (size
, unsignedp
, satp
);
10219 /* Create an atomic variant node for TYPE. This routine is called
10220 during initialization of data types to create the 5 basic atomic
10221 types. The generic build_variant_type function requires these to
10222 already be set up in order to function properly, so cannot be
10223 called from there. If ALIGN is non-zero, then ensure alignment is
10224 overridden to this value. */
10227 build_atomic_base (tree type
, unsigned int align
)
10231 /* Make sure its not already registered. */
10232 if ((t
= get_qualified_type (type
, TYPE_QUAL_ATOMIC
)))
10235 t
= build_variant_type_copy (type
);
10236 set_type_quals (t
, TYPE_QUAL_ATOMIC
);
10239 SET_TYPE_ALIGN (t
, align
);
10244 /* Information about the _FloatN and _FloatNx types. This must be in
10245 the same order as the corresponding TI_* enum values. */
10246 const floatn_type_info floatn_nx_types
[NUM_FLOATN_NX_TYPES
] =
10258 /* Create nodes for all integer types (and error_mark_node) using the sizes
10259 of C datatypes. SIGNED_CHAR specifies whether char is signed. */
10262 build_common_tree_nodes (bool signed_char
)
10266 error_mark_node
= make_node (ERROR_MARK
);
10267 TREE_TYPE (error_mark_node
) = error_mark_node
;
10269 initialize_sizetypes ();
10271 /* Define both `signed char' and `unsigned char'. */
10272 signed_char_type_node
= make_signed_type (CHAR_TYPE_SIZE
);
10273 TYPE_STRING_FLAG (signed_char_type_node
) = 1;
10274 unsigned_char_type_node
= make_unsigned_type (CHAR_TYPE_SIZE
);
10275 TYPE_STRING_FLAG (unsigned_char_type_node
) = 1;
10277 /* Define `char', which is like either `signed char' or `unsigned char'
10278 but not the same as either. */
10281 ? make_signed_type (CHAR_TYPE_SIZE
)
10282 : make_unsigned_type (CHAR_TYPE_SIZE
));
10283 TYPE_STRING_FLAG (char_type_node
) = 1;
10285 short_integer_type_node
= make_signed_type (SHORT_TYPE_SIZE
);
10286 short_unsigned_type_node
= make_unsigned_type (SHORT_TYPE_SIZE
);
10287 integer_type_node
= make_signed_type (INT_TYPE_SIZE
);
10288 unsigned_type_node
= make_unsigned_type (INT_TYPE_SIZE
);
10289 long_integer_type_node
= make_signed_type (LONG_TYPE_SIZE
);
10290 long_unsigned_type_node
= make_unsigned_type (LONG_TYPE_SIZE
);
10291 long_long_integer_type_node
= make_signed_type (LONG_LONG_TYPE_SIZE
);
10292 long_long_unsigned_type_node
= make_unsigned_type (LONG_LONG_TYPE_SIZE
);
10294 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
10296 int_n_trees
[i
].signed_type
= make_signed_type (int_n_data
[i
].bitsize
);
10297 int_n_trees
[i
].unsigned_type
= make_unsigned_type (int_n_data
[i
].bitsize
);
10298 TYPE_SIZE (int_n_trees
[i
].signed_type
) = bitsize_int (int_n_data
[i
].bitsize
);
10299 TYPE_SIZE (int_n_trees
[i
].unsigned_type
) = bitsize_int (int_n_data
[i
].bitsize
);
10301 if (int_n_data
[i
].bitsize
> LONG_LONG_TYPE_SIZE
10302 && int_n_enabled_p
[i
])
10304 integer_types
[itk_intN_0
+ i
* 2] = int_n_trees
[i
].signed_type
;
10305 integer_types
[itk_unsigned_intN_0
+ i
* 2] = int_n_trees
[i
].unsigned_type
;
10309 /* Define a boolean type. This type only represents boolean values but
10310 may be larger than char depending on the value of BOOL_TYPE_SIZE. */
10311 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
10312 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
10313 TYPE_PRECISION (boolean_type_node
) = 1;
10314 TYPE_MAX_VALUE (boolean_type_node
) = build_int_cst (boolean_type_node
, 1);
10316 /* Define what type to use for size_t. */
10317 if (strcmp (SIZE_TYPE
, "unsigned int") == 0)
10318 size_type_node
= unsigned_type_node
;
10319 else if (strcmp (SIZE_TYPE
, "long unsigned int") == 0)
10320 size_type_node
= long_unsigned_type_node
;
10321 else if (strcmp (SIZE_TYPE
, "long long unsigned int") == 0)
10322 size_type_node
= long_long_unsigned_type_node
;
10323 else if (strcmp (SIZE_TYPE
, "short unsigned int") == 0)
10324 size_type_node
= short_unsigned_type_node
;
10329 size_type_node
= NULL_TREE
;
10330 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
10331 if (int_n_enabled_p
[i
])
10334 sprintf (name
, "__int%d unsigned", int_n_data
[i
].bitsize
);
10336 if (strcmp (name
, SIZE_TYPE
) == 0)
10338 size_type_node
= int_n_trees
[i
].unsigned_type
;
10341 if (size_type_node
== NULL_TREE
)
10342 gcc_unreachable ();
10345 /* Define what type to use for ptrdiff_t. */
10346 if (strcmp (PTRDIFF_TYPE
, "int") == 0)
10347 ptrdiff_type_node
= integer_type_node
;
10348 else if (strcmp (PTRDIFF_TYPE
, "long int") == 0)
10349 ptrdiff_type_node
= long_integer_type_node
;
10350 else if (strcmp (PTRDIFF_TYPE
, "long long int") == 0)
10351 ptrdiff_type_node
= long_long_integer_type_node
;
10352 else if (strcmp (PTRDIFF_TYPE
, "short int") == 0)
10353 ptrdiff_type_node
= short_integer_type_node
;
10356 ptrdiff_type_node
= NULL_TREE
;
10357 for (int i
= 0; i
< NUM_INT_N_ENTS
; i
++)
10358 if (int_n_enabled_p
[i
])
10361 sprintf (name
, "__int%d", int_n_data
[i
].bitsize
);
10362 if (strcmp (name
, PTRDIFF_TYPE
) == 0)
10363 ptrdiff_type_node
= int_n_trees
[i
].signed_type
;
10365 if (ptrdiff_type_node
== NULL_TREE
)
10366 gcc_unreachable ();
10369 /* Fill in the rest of the sized types. Reuse existing type nodes
10371 intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 0);
10372 intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 0);
10373 intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 0);
10374 intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 0);
10375 intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 0);
10377 unsigned_intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 1);
10378 unsigned_intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 1);
10379 unsigned_intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 1);
10380 unsigned_intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 1);
10381 unsigned_intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 1);
10383 /* Don't call build_qualified type for atomics. That routine does
10384 special processing for atomics, and until they are initialized
10385 it's better not to make that call.
10387 Check to see if there is a target override for atomic types. */
10389 atomicQI_type_node
= build_atomic_base (unsigned_intQI_type_node
,
10390 targetm
.atomic_align_for_mode (QImode
));
10391 atomicHI_type_node
= build_atomic_base (unsigned_intHI_type_node
,
10392 targetm
.atomic_align_for_mode (HImode
));
10393 atomicSI_type_node
= build_atomic_base (unsigned_intSI_type_node
,
10394 targetm
.atomic_align_for_mode (SImode
));
10395 atomicDI_type_node
= build_atomic_base (unsigned_intDI_type_node
,
10396 targetm
.atomic_align_for_mode (DImode
));
10397 atomicTI_type_node
= build_atomic_base (unsigned_intTI_type_node
,
10398 targetm
.atomic_align_for_mode (TImode
));
10400 access_public_node
= get_identifier ("public");
10401 access_protected_node
= get_identifier ("protected");
10402 access_private_node
= get_identifier ("private");
10404 /* Define these next since types below may used them. */
10405 integer_zero_node
= build_int_cst (integer_type_node
, 0);
10406 integer_one_node
= build_int_cst (integer_type_node
, 1);
10407 integer_three_node
= build_int_cst (integer_type_node
, 3);
10408 integer_minus_one_node
= build_int_cst (integer_type_node
, -1);
10410 size_zero_node
= size_int (0);
10411 size_one_node
= size_int (1);
10412 bitsize_zero_node
= bitsize_int (0);
10413 bitsize_one_node
= bitsize_int (1);
10414 bitsize_unit_node
= bitsize_int (BITS_PER_UNIT
);
10416 boolean_false_node
= TYPE_MIN_VALUE (boolean_type_node
);
10417 boolean_true_node
= TYPE_MAX_VALUE (boolean_type_node
);
10419 void_type_node
= make_node (VOID_TYPE
);
10420 layout_type (void_type_node
);
10422 pointer_bounds_type_node
= targetm
.chkp_bound_type ();
10424 /* We are not going to have real types in C with less than byte alignment,
10425 so we might as well not have any types that claim to have it. */
10426 SET_TYPE_ALIGN (void_type_node
, BITS_PER_UNIT
);
10427 TYPE_USER_ALIGN (void_type_node
) = 0;
10429 void_node
= make_node (VOID_CST
);
10430 TREE_TYPE (void_node
) = void_type_node
;
10432 null_pointer_node
= build_int_cst (build_pointer_type (void_type_node
), 0);
10433 layout_type (TREE_TYPE (null_pointer_node
));
10435 ptr_type_node
= build_pointer_type (void_type_node
);
10436 const_ptr_type_node
10437 = build_pointer_type (build_type_variant (void_type_node
, 1, 0));
10438 fileptr_type_node
= ptr_type_node
;
10439 const_tm_ptr_type_node
= const_ptr_type_node
;
10441 pointer_sized_int_node
= build_nonstandard_integer_type (POINTER_SIZE
, 1);
10443 float_type_node
= make_node (REAL_TYPE
);
10444 TYPE_PRECISION (float_type_node
) = FLOAT_TYPE_SIZE
;
10445 layout_type (float_type_node
);
10447 double_type_node
= make_node (REAL_TYPE
);
10448 TYPE_PRECISION (double_type_node
) = DOUBLE_TYPE_SIZE
;
10449 layout_type (double_type_node
);
10451 long_double_type_node
= make_node (REAL_TYPE
);
10452 TYPE_PRECISION (long_double_type_node
) = LONG_DOUBLE_TYPE_SIZE
;
10453 layout_type (long_double_type_node
);
10455 for (i
= 0; i
< NUM_FLOATN_NX_TYPES
; i
++)
10457 int n
= floatn_nx_types
[i
].n
;
10458 bool extended
= floatn_nx_types
[i
].extended
;
10459 machine_mode mode
= targetm
.floatn_mode (n
, extended
);
10460 if (mode
== VOIDmode
)
10462 int precision
= GET_MODE_PRECISION (mode
);
10463 /* Work around the rs6000 KFmode having precision 113 not
10465 const struct real_format
*fmt
= REAL_MODE_FORMAT (mode
);
10466 gcc_assert (fmt
->b
== 2 && fmt
->emin
+ fmt
->emax
== 3);
10467 int min_precision
= fmt
->p
+ ceil_log2 (fmt
->emax
- fmt
->emin
);
10469 gcc_assert (min_precision
== n
);
10470 if (precision
< min_precision
)
10471 precision
= min_precision
;
10472 FLOATN_NX_TYPE_NODE (i
) = make_node (REAL_TYPE
);
10473 TYPE_PRECISION (FLOATN_NX_TYPE_NODE (i
)) = precision
;
10474 layout_type (FLOATN_NX_TYPE_NODE (i
));
10475 SET_TYPE_MODE (FLOATN_NX_TYPE_NODE (i
), mode
);
10478 float_ptr_type_node
= build_pointer_type (float_type_node
);
10479 double_ptr_type_node
= build_pointer_type (double_type_node
);
10480 long_double_ptr_type_node
= build_pointer_type (long_double_type_node
);
10481 integer_ptr_type_node
= build_pointer_type (integer_type_node
);
10483 /* Fixed size integer types. */
10484 uint16_type_node
= make_or_reuse_type (16, 1);
10485 uint32_type_node
= make_or_reuse_type (32, 1);
10486 uint64_type_node
= make_or_reuse_type (64, 1);
10488 /* Decimal float types. */
10489 dfloat32_type_node
= make_node (REAL_TYPE
);
10490 TYPE_PRECISION (dfloat32_type_node
) = DECIMAL32_TYPE_SIZE
;
10491 SET_TYPE_MODE (dfloat32_type_node
, SDmode
);
10492 layout_type (dfloat32_type_node
);
10493 dfloat32_ptr_type_node
= build_pointer_type (dfloat32_type_node
);
10495 dfloat64_type_node
= make_node (REAL_TYPE
);
10496 TYPE_PRECISION (dfloat64_type_node
) = DECIMAL64_TYPE_SIZE
;
10497 SET_TYPE_MODE (dfloat64_type_node
, DDmode
);
10498 layout_type (dfloat64_type_node
);
10499 dfloat64_ptr_type_node
= build_pointer_type (dfloat64_type_node
);
10501 dfloat128_type_node
= make_node (REAL_TYPE
);
10502 TYPE_PRECISION (dfloat128_type_node
) = DECIMAL128_TYPE_SIZE
;
10503 SET_TYPE_MODE (dfloat128_type_node
, TDmode
);
10504 layout_type (dfloat128_type_node
);
10505 dfloat128_ptr_type_node
= build_pointer_type (dfloat128_type_node
);
10507 complex_integer_type_node
= build_complex_type (integer_type_node
, true);
10508 complex_float_type_node
= build_complex_type (float_type_node
, true);
10509 complex_double_type_node
= build_complex_type (double_type_node
, true);
10510 complex_long_double_type_node
= build_complex_type (long_double_type_node
,
10513 for (i
= 0; i
< NUM_FLOATN_NX_TYPES
; i
++)
10515 if (FLOATN_NX_TYPE_NODE (i
) != NULL_TREE
)
10516 COMPLEX_FLOATN_NX_TYPE_NODE (i
)
10517 = build_complex_type (FLOATN_NX_TYPE_NODE (i
));
10520 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
10521 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
10522 sat_ ## KIND ## _type_node = \
10523 make_sat_signed_ ## KIND ## _type (SIZE); \
10524 sat_unsigned_ ## KIND ## _type_node = \
10525 make_sat_unsigned_ ## KIND ## _type (SIZE); \
10526 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
10527 unsigned_ ## KIND ## _type_node = \
10528 make_unsigned_ ## KIND ## _type (SIZE);
10530 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
10531 sat_ ## WIDTH ## KIND ## _type_node = \
10532 make_sat_signed_ ## KIND ## _type (SIZE); \
10533 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
10534 make_sat_unsigned_ ## KIND ## _type (SIZE); \
10535 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
10536 unsigned_ ## WIDTH ## KIND ## _type_node = \
10537 make_unsigned_ ## KIND ## _type (SIZE);
10539 /* Make fixed-point type nodes based on four different widths. */
10540 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
10541 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
10542 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
10543 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
10544 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
10546 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
10547 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
10548 NAME ## _type_node = \
10549 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
10550 u ## NAME ## _type_node = \
10551 make_or_reuse_unsigned_ ## KIND ## _type \
10552 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
10553 sat_ ## NAME ## _type_node = \
10554 make_or_reuse_sat_signed_ ## KIND ## _type \
10555 (GET_MODE_BITSIZE (MODE ## mode)); \
10556 sat_u ## NAME ## _type_node = \
10557 make_or_reuse_sat_unsigned_ ## KIND ## _type \
10558 (GET_MODE_BITSIZE (U ## MODE ## mode));
10560 /* Fixed-point type and mode nodes. */
10561 MAKE_FIXED_TYPE_NODE_FAMILY (fract
, FRACT
)
10562 MAKE_FIXED_TYPE_NODE_FAMILY (accum
, ACCUM
)
10563 MAKE_FIXED_MODE_NODE (fract
, qq
, QQ
)
10564 MAKE_FIXED_MODE_NODE (fract
, hq
, HQ
)
10565 MAKE_FIXED_MODE_NODE (fract
, sq
, SQ
)
10566 MAKE_FIXED_MODE_NODE (fract
, dq
, DQ
)
10567 MAKE_FIXED_MODE_NODE (fract
, tq
, TQ
)
10568 MAKE_FIXED_MODE_NODE (accum
, ha
, HA
)
10569 MAKE_FIXED_MODE_NODE (accum
, sa
, SA
)
10570 MAKE_FIXED_MODE_NODE (accum
, da
, DA
)
10571 MAKE_FIXED_MODE_NODE (accum
, ta
, TA
)
10574 tree t
= targetm
.build_builtin_va_list ();
10576 /* Many back-ends define record types without setting TYPE_NAME.
10577 If we copied the record type here, we'd keep the original
10578 record type without a name. This breaks name mangling. So,
10579 don't copy record types and let c_common_nodes_and_builtins()
10580 declare the type to be __builtin_va_list. */
10581 if (TREE_CODE (t
) != RECORD_TYPE
)
10582 t
= build_variant_type_copy (t
);
10584 va_list_type_node
= t
;
10588 /* Modify DECL for given flags.
10589 TM_PURE attribute is set only on types, so the function will modify
10590 DECL's type when ECF_TM_PURE is used. */
10593 set_call_expr_flags (tree decl
, int flags
)
10595 if (flags
& ECF_NOTHROW
)
10596 TREE_NOTHROW (decl
) = 1;
10597 if (flags
& ECF_CONST
)
10598 TREE_READONLY (decl
) = 1;
10599 if (flags
& ECF_PURE
)
10600 DECL_PURE_P (decl
) = 1;
10601 if (flags
& ECF_LOOPING_CONST_OR_PURE
)
10602 DECL_LOOPING_CONST_OR_PURE_P (decl
) = 1;
10603 if (flags
& ECF_NOVOPS
)
10604 DECL_IS_NOVOPS (decl
) = 1;
10605 if (flags
& ECF_NORETURN
)
10606 TREE_THIS_VOLATILE (decl
) = 1;
10607 if (flags
& ECF_MALLOC
)
10608 DECL_IS_MALLOC (decl
) = 1;
10609 if (flags
& ECF_RETURNS_TWICE
)
10610 DECL_IS_RETURNS_TWICE (decl
) = 1;
10611 if (flags
& ECF_LEAF
)
10612 DECL_ATTRIBUTES (decl
) = tree_cons (get_identifier ("leaf"),
10613 NULL
, DECL_ATTRIBUTES (decl
));
10614 if (flags
& ECF_RET1
)
10615 DECL_ATTRIBUTES (decl
)
10616 = tree_cons (get_identifier ("fn spec"),
10617 build_tree_list (NULL_TREE
, build_string (1, "1")),
10618 DECL_ATTRIBUTES (decl
));
10619 if ((flags
& ECF_TM_PURE
) && flag_tm
)
10620 apply_tm_attr (decl
, get_identifier ("transaction_pure"));
10621 /* Looping const or pure is implied by noreturn.
10622 There is currently no way to declare looping const or looping pure alone. */
10623 gcc_assert (!(flags
& ECF_LOOPING_CONST_OR_PURE
)
10624 || ((flags
& ECF_NORETURN
) && (flags
& (ECF_CONST
| ECF_PURE
))));
10628 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
10631 local_define_builtin (const char *name
, tree type
, enum built_in_function code
,
10632 const char *library_name
, int ecf_flags
)
10636 decl
= add_builtin_function (name
, type
, code
, BUILT_IN_NORMAL
,
10637 library_name
, NULL_TREE
);
10638 set_call_expr_flags (decl
, ecf_flags
);
10640 set_builtin_decl (code
, decl
, true);
10643 /* Call this function after instantiating all builtins that the language
10644 front end cares about. This will build the rest of the builtins
10645 and internal functions that are relied upon by the tree optimizers and
10649 build_common_builtin_nodes (void)
10654 if (!builtin_decl_explicit_p (BUILT_IN_UNREACHABLE
)
10655 || !builtin_decl_explicit_p (BUILT_IN_ABORT
))
10657 ftype
= build_function_type (void_type_node
, void_list_node
);
10658 if (!builtin_decl_explicit_p (BUILT_IN_UNREACHABLE
))
10659 local_define_builtin ("__builtin_unreachable", ftype
,
10660 BUILT_IN_UNREACHABLE
,
10661 "__builtin_unreachable",
10662 ECF_NOTHROW
| ECF_LEAF
| ECF_NORETURN
10664 if (!builtin_decl_explicit_p (BUILT_IN_ABORT
))
10665 local_define_builtin ("__builtin_abort", ftype
, BUILT_IN_ABORT
,
10667 ECF_LEAF
| ECF_NORETURN
| ECF_CONST
);
10670 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
)
10671 || !builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
10673 ftype
= build_function_type_list (ptr_type_node
,
10674 ptr_type_node
, const_ptr_type_node
,
10675 size_type_node
, NULL_TREE
);
10677 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
))
10678 local_define_builtin ("__builtin_memcpy", ftype
, BUILT_IN_MEMCPY
,
10679 "memcpy", ECF_NOTHROW
| ECF_LEAF
| ECF_RET1
);
10680 if (!builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
10681 local_define_builtin ("__builtin_memmove", ftype
, BUILT_IN_MEMMOVE
,
10682 "memmove", ECF_NOTHROW
| ECF_LEAF
| ECF_RET1
);
10685 if (!builtin_decl_explicit_p (BUILT_IN_MEMCMP
))
10687 ftype
= build_function_type_list (integer_type_node
, const_ptr_type_node
,
10688 const_ptr_type_node
, size_type_node
,
10690 local_define_builtin ("__builtin_memcmp", ftype
, BUILT_IN_MEMCMP
,
10691 "memcmp", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10694 if (!builtin_decl_explicit_p (BUILT_IN_MEMSET
))
10696 ftype
= build_function_type_list (ptr_type_node
,
10697 ptr_type_node
, integer_type_node
,
10698 size_type_node
, NULL_TREE
);
10699 local_define_builtin ("__builtin_memset", ftype
, BUILT_IN_MEMSET
,
10700 "memset", ECF_NOTHROW
| ECF_LEAF
| ECF_RET1
);
10703 /* If we're checking the stack, `alloca' can throw. */
10704 const int alloca_flags
10705 = ECF_MALLOC
| ECF_LEAF
| (flag_stack_check
? 0 : ECF_NOTHROW
);
10707 if (!builtin_decl_explicit_p (BUILT_IN_ALLOCA
))
10709 ftype
= build_function_type_list (ptr_type_node
,
10710 size_type_node
, NULL_TREE
);
10711 local_define_builtin ("__builtin_alloca", ftype
, BUILT_IN_ALLOCA
,
10712 "alloca", alloca_flags
);
10715 ftype
= build_function_type_list (ptr_type_node
, size_type_node
,
10716 size_type_node
, NULL_TREE
);
10717 local_define_builtin ("__builtin_alloca_with_align", ftype
,
10718 BUILT_IN_ALLOCA_WITH_ALIGN
,
10719 "__builtin_alloca_with_align",
10722 ftype
= build_function_type_list (void_type_node
,
10723 ptr_type_node
, ptr_type_node
,
10724 ptr_type_node
, NULL_TREE
);
10725 local_define_builtin ("__builtin_init_trampoline", ftype
,
10726 BUILT_IN_INIT_TRAMPOLINE
,
10727 "__builtin_init_trampoline", ECF_NOTHROW
| ECF_LEAF
);
10728 local_define_builtin ("__builtin_init_heap_trampoline", ftype
,
10729 BUILT_IN_INIT_HEAP_TRAMPOLINE
,
10730 "__builtin_init_heap_trampoline",
10731 ECF_NOTHROW
| ECF_LEAF
);
10732 local_define_builtin ("__builtin_init_descriptor", ftype
,
10733 BUILT_IN_INIT_DESCRIPTOR
,
10734 "__builtin_init_descriptor", ECF_NOTHROW
| ECF_LEAF
);
10736 ftype
= build_function_type_list (ptr_type_node
, ptr_type_node
, NULL_TREE
);
10737 local_define_builtin ("__builtin_adjust_trampoline", ftype
,
10738 BUILT_IN_ADJUST_TRAMPOLINE
,
10739 "__builtin_adjust_trampoline",
10740 ECF_CONST
| ECF_NOTHROW
);
10741 local_define_builtin ("__builtin_adjust_descriptor", ftype
,
10742 BUILT_IN_ADJUST_DESCRIPTOR
,
10743 "__builtin_adjust_descriptor",
10744 ECF_CONST
| ECF_NOTHROW
);
10746 ftype
= build_function_type_list (void_type_node
,
10747 ptr_type_node
, ptr_type_node
, NULL_TREE
);
10748 local_define_builtin ("__builtin_nonlocal_goto", ftype
,
10749 BUILT_IN_NONLOCAL_GOTO
,
10750 "__builtin_nonlocal_goto",
10751 ECF_NORETURN
| ECF_NOTHROW
);
10753 ftype
= build_function_type_list (void_type_node
,
10754 ptr_type_node
, ptr_type_node
, NULL_TREE
);
10755 local_define_builtin ("__builtin_setjmp_setup", ftype
,
10756 BUILT_IN_SETJMP_SETUP
,
10757 "__builtin_setjmp_setup", ECF_NOTHROW
);
10759 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10760 local_define_builtin ("__builtin_setjmp_receiver", ftype
,
10761 BUILT_IN_SETJMP_RECEIVER
,
10762 "__builtin_setjmp_receiver", ECF_NOTHROW
| ECF_LEAF
);
10764 ftype
= build_function_type_list (ptr_type_node
, NULL_TREE
);
10765 local_define_builtin ("__builtin_stack_save", ftype
, BUILT_IN_STACK_SAVE
,
10766 "__builtin_stack_save", ECF_NOTHROW
| ECF_LEAF
);
10768 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10769 local_define_builtin ("__builtin_stack_restore", ftype
,
10770 BUILT_IN_STACK_RESTORE
,
10771 "__builtin_stack_restore", ECF_NOTHROW
| ECF_LEAF
);
10773 ftype
= build_function_type_list (integer_type_node
, const_ptr_type_node
,
10774 const_ptr_type_node
, size_type_node
,
10776 local_define_builtin ("__builtin_memcmp_eq", ftype
, BUILT_IN_MEMCMP_EQ
,
10777 "__builtin_memcmp_eq",
10778 ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10780 /* If there's a possibility that we might use the ARM EABI, build the
10781 alternate __cxa_end_cleanup node used to resume from C++ and Java. */
10782 if (targetm
.arm_eabi_unwinder
)
10784 ftype
= build_function_type_list (void_type_node
, NULL_TREE
);
10785 local_define_builtin ("__builtin_cxa_end_cleanup", ftype
,
10786 BUILT_IN_CXA_END_CLEANUP
,
10787 "__cxa_end_cleanup", ECF_NORETURN
| ECF_LEAF
);
10790 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10791 local_define_builtin ("__builtin_unwind_resume", ftype
,
10792 BUILT_IN_UNWIND_RESUME
,
10793 ((targetm_common
.except_unwind_info (&global_options
)
10795 ? "_Unwind_SjLj_Resume" : "_Unwind_Resume"),
10798 if (builtin_decl_explicit (BUILT_IN_RETURN_ADDRESS
) == NULL_TREE
)
10800 ftype
= build_function_type_list (ptr_type_node
, integer_type_node
,
10802 local_define_builtin ("__builtin_return_address", ftype
,
10803 BUILT_IN_RETURN_ADDRESS
,
10804 "__builtin_return_address",
10808 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
)
10809 || !builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
10811 ftype
= build_function_type_list (void_type_node
, ptr_type_node
,
10812 ptr_type_node
, NULL_TREE
);
10813 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
))
10814 local_define_builtin ("__cyg_profile_func_enter", ftype
,
10815 BUILT_IN_PROFILE_FUNC_ENTER
,
10816 "__cyg_profile_func_enter", 0);
10817 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
10818 local_define_builtin ("__cyg_profile_func_exit", ftype
,
10819 BUILT_IN_PROFILE_FUNC_EXIT
,
10820 "__cyg_profile_func_exit", 0);
10823 /* The exception object and filter values from the runtime. The argument
10824 must be zero before exception lowering, i.e. from the front end. After
10825 exception lowering, it will be the region number for the exception
10826 landing pad. These functions are PURE instead of CONST to prevent
10827 them from being hoisted past the exception edge that will initialize
10828 its value in the landing pad. */
10829 ftype
= build_function_type_list (ptr_type_node
,
10830 integer_type_node
, NULL_TREE
);
10831 ecf_flags
= ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
;
10832 /* Only use TM_PURE if we have TM language support. */
10833 if (builtin_decl_explicit_p (BUILT_IN_TM_LOAD_1
))
10834 ecf_flags
|= ECF_TM_PURE
;
10835 local_define_builtin ("__builtin_eh_pointer", ftype
, BUILT_IN_EH_POINTER
,
10836 "__builtin_eh_pointer", ecf_flags
);
10838 tmp
= lang_hooks
.types
.type_for_mode (targetm
.eh_return_filter_mode (), 0);
10839 ftype
= build_function_type_list (tmp
, integer_type_node
, NULL_TREE
);
10840 local_define_builtin ("__builtin_eh_filter", ftype
, BUILT_IN_EH_FILTER
,
10841 "__builtin_eh_filter", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10843 ftype
= build_function_type_list (void_type_node
,
10844 integer_type_node
, integer_type_node
,
10846 local_define_builtin ("__builtin_eh_copy_values", ftype
,
10847 BUILT_IN_EH_COPY_VALUES
,
10848 "__builtin_eh_copy_values", ECF_NOTHROW
);
10850 /* Complex multiplication and division. These are handled as builtins
10851 rather than optabs because emit_library_call_value doesn't support
10852 complex. Further, we can do slightly better with folding these
10853 beasties if the real and complex parts of the arguments are separate. */
10857 for (mode
= MIN_MODE_COMPLEX_FLOAT
; mode
<= MAX_MODE_COMPLEX_FLOAT
; ++mode
)
10859 char mode_name_buf
[4], *q
;
10861 enum built_in_function mcode
, dcode
;
10862 tree type
, inner_type
;
10863 const char *prefix
= "__";
10865 if (targetm
.libfunc_gnu_prefix
)
10868 type
= lang_hooks
.types
.type_for_mode ((machine_mode
) mode
, 0);
10871 inner_type
= TREE_TYPE (type
);
10873 ftype
= build_function_type_list (type
, inner_type
, inner_type
,
10874 inner_type
, inner_type
, NULL_TREE
);
10876 mcode
= ((enum built_in_function
)
10877 (BUILT_IN_COMPLEX_MUL_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
10878 dcode
= ((enum built_in_function
)
10879 (BUILT_IN_COMPLEX_DIV_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
10881 for (p
= GET_MODE_NAME (mode
), q
= mode_name_buf
; *p
; p
++, q
++)
10885 built_in_names
[mcode
] = concat (prefix
, "mul", mode_name_buf
, "3",
10887 local_define_builtin (built_in_names
[mcode
], ftype
, mcode
,
10888 built_in_names
[mcode
],
10889 ECF_CONST
| ECF_NOTHROW
| ECF_LEAF
);
10891 built_in_names
[dcode
] = concat (prefix
, "div", mode_name_buf
, "3",
10893 local_define_builtin (built_in_names
[dcode
], ftype
, dcode
,
10894 built_in_names
[dcode
],
10895 ECF_CONST
| ECF_NOTHROW
| ECF_LEAF
);
10899 init_internal_fns ();
10902 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
10905 If we requested a pointer to a vector, build up the pointers that
10906 we stripped off while looking for the inner type. Similarly for
10907 return values from functions.
10909 The argument TYPE is the top of the chain, and BOTTOM is the
10910 new type which we will point to. */
10913 reconstruct_complex_type (tree type
, tree bottom
)
10917 if (TREE_CODE (type
) == POINTER_TYPE
)
10919 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10920 outer
= build_pointer_type_for_mode (inner
, TYPE_MODE (type
),
10921 TYPE_REF_CAN_ALIAS_ALL (type
));
10923 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
10925 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10926 outer
= build_reference_type_for_mode (inner
, TYPE_MODE (type
),
10927 TYPE_REF_CAN_ALIAS_ALL (type
));
10929 else if (TREE_CODE (type
) == ARRAY_TYPE
)
10931 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10932 outer
= build_array_type (inner
, TYPE_DOMAIN (type
));
10934 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10936 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10937 outer
= build_function_type (inner
, TYPE_ARG_TYPES (type
));
10939 else if (TREE_CODE (type
) == METHOD_TYPE
)
10941 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10942 /* The build_method_type_directly() routine prepends 'this' to argument list,
10943 so we must compensate by getting rid of it. */
10945 = build_method_type_directly
10946 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
))),
10948 TREE_CHAIN (TYPE_ARG_TYPES (type
)));
10950 else if (TREE_CODE (type
) == OFFSET_TYPE
)
10952 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10953 outer
= build_offset_type (TYPE_OFFSET_BASETYPE (type
), inner
);
10958 return build_type_attribute_qual_variant (outer
, TYPE_ATTRIBUTES (type
),
10959 TYPE_QUALS (type
));
10962 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
10965 build_vector_type_for_mode (tree innertype
, machine_mode mode
)
10969 switch (GET_MODE_CLASS (mode
))
10971 case MODE_VECTOR_INT
:
10972 case MODE_VECTOR_FLOAT
:
10973 case MODE_VECTOR_FRACT
:
10974 case MODE_VECTOR_UFRACT
:
10975 case MODE_VECTOR_ACCUM
:
10976 case MODE_VECTOR_UACCUM
:
10977 nunits
= GET_MODE_NUNITS (mode
);
10981 /* Check that there are no leftover bits. */
10982 gcc_assert (GET_MODE_BITSIZE (mode
)
10983 % TREE_INT_CST_LOW (TYPE_SIZE (innertype
)) == 0);
10985 nunits
= GET_MODE_BITSIZE (mode
)
10986 / TREE_INT_CST_LOW (TYPE_SIZE (innertype
));
10990 gcc_unreachable ();
10993 return make_vector_type (innertype
, nunits
, mode
);
10996 /* Similarly, but takes the inner type and number of units, which must be
11000 build_vector_type (tree innertype
, int nunits
)
11002 return make_vector_type (innertype
, nunits
, VOIDmode
);
11005 /* Build truth vector with specified length and number of units. */
11008 build_truth_vector_type (unsigned nunits
, unsigned vector_size
)
11010 machine_mode mask_mode
= targetm
.vectorize
.get_mask_mode (nunits
,
11013 gcc_assert (mask_mode
!= VOIDmode
);
11015 unsigned HOST_WIDE_INT vsize
;
11016 if (mask_mode
== BLKmode
)
11017 vsize
= vector_size
* BITS_PER_UNIT
;
11019 vsize
= GET_MODE_BITSIZE (mask_mode
);
11021 unsigned HOST_WIDE_INT esize
= vsize
/ nunits
;
11022 gcc_assert (esize
* nunits
== vsize
);
11024 tree bool_type
= build_nonstandard_boolean_type (esize
);
11026 return make_vector_type (bool_type
, nunits
, mask_mode
);
11029 /* Returns a vector type corresponding to a comparison of VECTYPE. */
11032 build_same_sized_truth_vector_type (tree vectype
)
11034 if (VECTOR_BOOLEAN_TYPE_P (vectype
))
11037 unsigned HOST_WIDE_INT size
= GET_MODE_SIZE (TYPE_MODE (vectype
));
11040 size
= tree_to_uhwi (TYPE_SIZE_UNIT (vectype
));
11042 return build_truth_vector_type (TYPE_VECTOR_SUBPARTS (vectype
), size
);
11045 /* Similarly, but builds a variant type with TYPE_VECTOR_OPAQUE set. */
11048 build_opaque_vector_type (tree innertype
, int nunits
)
11050 tree t
= make_vector_type (innertype
, nunits
, VOIDmode
);
11052 /* We always build the non-opaque variant before the opaque one,
11053 so if it already exists, it is TYPE_NEXT_VARIANT of this one. */
11054 cand
= TYPE_NEXT_VARIANT (t
);
11056 && TYPE_VECTOR_OPAQUE (cand
)
11057 && check_qualified_type (cand
, t
, TYPE_QUALS (t
)))
11059 /* Othewise build a variant type and make sure to queue it after
11060 the non-opaque type. */
11061 cand
= build_distinct_type_copy (t
);
11062 TYPE_VECTOR_OPAQUE (cand
) = true;
11063 TYPE_CANONICAL (cand
) = TYPE_CANONICAL (t
);
11064 TYPE_NEXT_VARIANT (cand
) = TYPE_NEXT_VARIANT (t
);
11065 TYPE_NEXT_VARIANT (t
) = cand
;
11066 TYPE_MAIN_VARIANT (cand
) = TYPE_MAIN_VARIANT (t
);
11071 /* Given an initializer INIT, return TRUE if INIT is zero or some
11072 aggregate of zeros. Otherwise return FALSE. */
11074 initializer_zerop (const_tree init
)
11080 switch (TREE_CODE (init
))
11083 return integer_zerop (init
);
11086 /* ??? Note that this is not correct for C4X float formats. There,
11087 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
11088 negative exponent. */
11089 return real_zerop (init
)
11090 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init
));
11093 return fixed_zerop (init
);
11096 return integer_zerop (init
)
11097 || (real_zerop (init
)
11098 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init
)))
11099 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init
))));
11104 for (i
= 0; i
< VECTOR_CST_NELTS (init
); ++i
)
11105 if (!initializer_zerop (VECTOR_CST_ELT (init
, i
)))
11112 unsigned HOST_WIDE_INT idx
;
11114 if (TREE_CLOBBER_P (init
))
11116 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init
), idx
, elt
)
11117 if (!initializer_zerop (elt
))
11126 /* We need to loop through all elements to handle cases like
11127 "\0" and "\0foobar". */
11128 for (i
= 0; i
< TREE_STRING_LENGTH (init
); ++i
)
11129 if (TREE_STRING_POINTER (init
)[i
] != '\0')
11140 /* Check if vector VEC consists of all the equal elements and
11141 that the number of elements corresponds to the type of VEC.
11142 The function returns first element of the vector
11143 or NULL_TREE if the vector is not uniform. */
11145 uniform_vector_p (const_tree vec
)
11150 if (vec
== NULL_TREE
)
11153 gcc_assert (VECTOR_TYPE_P (TREE_TYPE (vec
)));
11155 if (TREE_CODE (vec
) == VECTOR_CST
)
11157 first
= VECTOR_CST_ELT (vec
, 0);
11158 for (i
= 1; i
< VECTOR_CST_NELTS (vec
); ++i
)
11159 if (!operand_equal_p (first
, VECTOR_CST_ELT (vec
, i
), 0))
11165 else if (TREE_CODE (vec
) == CONSTRUCTOR
)
11167 first
= error_mark_node
;
11169 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (vec
), i
, t
)
11176 if (!operand_equal_p (first
, t
, 0))
11179 if (i
!= TYPE_VECTOR_SUBPARTS (TREE_TYPE (vec
)))
11188 /* Build an empty statement at location LOC. */
11191 build_empty_stmt (location_t loc
)
11193 tree t
= build1 (NOP_EXPR
, void_type_node
, size_zero_node
);
11194 SET_EXPR_LOCATION (t
, loc
);
11199 /* Build an OpenMP clause with code CODE. LOC is the location of the
11203 build_omp_clause (location_t loc
, enum omp_clause_code code
)
11208 length
= omp_clause_num_ops
[code
];
11209 size
= (sizeof (struct tree_omp_clause
) + (length
- 1) * sizeof (tree
));
11211 record_node_allocation_statistics (OMP_CLAUSE
, size
);
11213 t
= (tree
) ggc_internal_alloc (size
);
11214 memset (t
, 0, size
);
11215 TREE_SET_CODE (t
, OMP_CLAUSE
);
11216 OMP_CLAUSE_SET_CODE (t
, code
);
11217 OMP_CLAUSE_LOCATION (t
) = loc
;
11222 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
11223 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
11224 Except for the CODE and operand count field, other storage for the
11225 object is initialized to zeros. */
11228 build_vl_exp_stat (enum tree_code code
, int len MEM_STAT_DECL
)
11231 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_exp
);
11233 gcc_assert (TREE_CODE_CLASS (code
) == tcc_vl_exp
);
11234 gcc_assert (len
>= 1);
11236 record_node_allocation_statistics (code
, length
);
11238 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
11240 TREE_SET_CODE (t
, code
);
11242 /* Can't use TREE_OPERAND to store the length because if checking is
11243 enabled, it will try to check the length before we store it. :-P */
11244 t
->exp
.operands
[0] = build_int_cst (sizetype
, len
);
11249 /* Helper function for build_call_* functions; build a CALL_EXPR with
11250 indicated RETURN_TYPE, FN, and NARGS, but do not initialize any of
11251 the argument slots. */
11254 build_call_1 (tree return_type
, tree fn
, int nargs
)
11258 t
= build_vl_exp (CALL_EXPR
, nargs
+ 3);
11259 TREE_TYPE (t
) = return_type
;
11260 CALL_EXPR_FN (t
) = fn
;
11261 CALL_EXPR_STATIC_CHAIN (t
) = NULL
;
11266 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
11267 FN and a null static chain slot. NARGS is the number of call arguments
11268 which are specified as "..." arguments. */
11271 build_call_nary (tree return_type
, tree fn
, int nargs
, ...)
11275 va_start (args
, nargs
);
11276 ret
= build_call_valist (return_type
, fn
, nargs
, args
);
11281 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
11282 FN and a null static chain slot. NARGS is the number of call arguments
11283 which are specified as a va_list ARGS. */
11286 build_call_valist (tree return_type
, tree fn
, int nargs
, va_list args
)
11291 t
= build_call_1 (return_type
, fn
, nargs
);
11292 for (i
= 0; i
< nargs
; i
++)
11293 CALL_EXPR_ARG (t
, i
) = va_arg (args
, tree
);
11294 process_call_operands (t
);
11298 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
11299 FN and a null static chain slot. NARGS is the number of call arguments
11300 which are specified as a tree array ARGS. */
11303 build_call_array_loc (location_t loc
, tree return_type
, tree fn
,
11304 int nargs
, const tree
*args
)
11309 t
= build_call_1 (return_type
, fn
, nargs
);
11310 for (i
= 0; i
< nargs
; i
++)
11311 CALL_EXPR_ARG (t
, i
) = args
[i
];
11312 process_call_operands (t
);
11313 SET_EXPR_LOCATION (t
, loc
);
11317 /* Like build_call_array, but takes a vec. */
11320 build_call_vec (tree return_type
, tree fn
, vec
<tree
, va_gc
> *args
)
11325 ret
= build_call_1 (return_type
, fn
, vec_safe_length (args
));
11326 FOR_EACH_VEC_SAFE_ELT (args
, ix
, t
)
11327 CALL_EXPR_ARG (ret
, ix
) = t
;
11328 process_call_operands (ret
);
11332 /* Conveniently construct a function call expression. FNDECL names the
11333 function to be called and N arguments are passed in the array
11337 build_call_expr_loc_array (location_t loc
, tree fndecl
, int n
, tree
*argarray
)
11339 tree fntype
= TREE_TYPE (fndecl
);
11340 tree fn
= build1 (ADDR_EXPR
, build_pointer_type (fntype
), fndecl
);
11342 return fold_build_call_array_loc (loc
, TREE_TYPE (fntype
), fn
, n
, argarray
);
11345 /* Conveniently construct a function call expression. FNDECL names the
11346 function to be called and the arguments are passed in the vector
11350 build_call_expr_loc_vec (location_t loc
, tree fndecl
, vec
<tree
, va_gc
> *vec
)
11352 return build_call_expr_loc_array (loc
, fndecl
, vec_safe_length (vec
),
11353 vec_safe_address (vec
));
11357 /* Conveniently construct a function call expression. FNDECL names the
11358 function to be called, N is the number of arguments, and the "..."
11359 parameters are the argument expressions. */
11362 build_call_expr_loc (location_t loc
, tree fndecl
, int n
, ...)
11365 tree
*argarray
= XALLOCAVEC (tree
, n
);
11369 for (i
= 0; i
< n
; i
++)
11370 argarray
[i
] = va_arg (ap
, tree
);
11372 return build_call_expr_loc_array (loc
, fndecl
, n
, argarray
);
11375 /* Like build_call_expr_loc (UNKNOWN_LOCATION, ...). Duplicated because
11376 varargs macros aren't supported by all bootstrap compilers. */
11379 build_call_expr (tree fndecl
, int n
, ...)
11382 tree
*argarray
= XALLOCAVEC (tree
, n
);
11386 for (i
= 0; i
< n
; i
++)
11387 argarray
[i
] = va_arg (ap
, tree
);
11389 return build_call_expr_loc_array (UNKNOWN_LOCATION
, fndecl
, n
, argarray
);
11392 /* Build an internal call to IFN, with arguments ARGS[0:N-1] and with return
11393 type TYPE. This is just like CALL_EXPR, except its CALL_EXPR_FN is NULL.
11394 It will get gimplified later into an ordinary internal function. */
11397 build_call_expr_internal_loc_array (location_t loc
, internal_fn ifn
,
11398 tree type
, int n
, const tree
*args
)
11400 tree t
= build_call_1 (type
, NULL_TREE
, n
);
11401 for (int i
= 0; i
< n
; ++i
)
11402 CALL_EXPR_ARG (t
, i
) = args
[i
];
11403 SET_EXPR_LOCATION (t
, loc
);
11404 CALL_EXPR_IFN (t
) = ifn
;
11408 /* Build internal call expression. This is just like CALL_EXPR, except
11409 its CALL_EXPR_FN is NULL. It will get gimplified later into ordinary
11410 internal function. */
11413 build_call_expr_internal_loc (location_t loc
, enum internal_fn ifn
,
11414 tree type
, int n
, ...)
11417 tree
*argarray
= XALLOCAVEC (tree
, n
);
11421 for (i
= 0; i
< n
; i
++)
11422 argarray
[i
] = va_arg (ap
, tree
);
11424 return build_call_expr_internal_loc_array (loc
, ifn
, type
, n
, argarray
);
11427 /* Return a function call to FN, if the target is guaranteed to support it,
11430 N is the number of arguments, passed in the "...", and TYPE is the
11431 type of the return value. */
11434 maybe_build_call_expr_loc (location_t loc
, combined_fn fn
, tree type
,
11438 tree
*argarray
= XALLOCAVEC (tree
, n
);
11442 for (i
= 0; i
< n
; i
++)
11443 argarray
[i
] = va_arg (ap
, tree
);
11445 if (internal_fn_p (fn
))
11447 internal_fn ifn
= as_internal_fn (fn
);
11448 if (direct_internal_fn_p (ifn
))
11450 tree_pair types
= direct_internal_fn_types (ifn
, type
, argarray
);
11451 if (!direct_internal_fn_supported_p (ifn
, types
,
11452 OPTIMIZE_FOR_BOTH
))
11455 return build_call_expr_internal_loc_array (loc
, ifn
, type
, n
, argarray
);
11459 tree fndecl
= builtin_decl_implicit (as_builtin_fn (fn
));
11462 return build_call_expr_loc_array (loc
, fndecl
, n
, argarray
);
11466 /* Create a new constant string literal and return a char* pointer to it.
11467 The STRING_CST value is the LEN characters at STR. */
11469 build_string_literal (int len
, const char *str
)
11471 tree t
, elem
, index
, type
;
11473 t
= build_string (len
, str
);
11474 elem
= build_type_variant (char_type_node
, 1, 0);
11475 index
= build_index_type (size_int (len
- 1));
11476 type
= build_array_type (elem
, index
);
11477 TREE_TYPE (t
) = type
;
11478 TREE_CONSTANT (t
) = 1;
11479 TREE_READONLY (t
) = 1;
11480 TREE_STATIC (t
) = 1;
11482 type
= build_pointer_type (elem
);
11483 t
= build1 (ADDR_EXPR
, type
,
11484 build4 (ARRAY_REF
, elem
,
11485 t
, integer_zero_node
, NULL_TREE
, NULL_TREE
));
11491 /* Return true if T (assumed to be a DECL) must be assigned a memory
11495 needs_to_live_in_memory (const_tree t
)
11497 return (TREE_ADDRESSABLE (t
)
11498 || is_global_var (t
)
11499 || (TREE_CODE (t
) == RESULT_DECL
11500 && !DECL_BY_REFERENCE (t
)
11501 && aggregate_value_p (t
, current_function_decl
)));
11504 /* Return value of a constant X and sign-extend it. */
11507 int_cst_value (const_tree x
)
11509 unsigned bits
= TYPE_PRECISION (TREE_TYPE (x
));
11510 unsigned HOST_WIDE_INT val
= TREE_INT_CST_LOW (x
);
11512 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
11513 gcc_assert (cst_and_fits_in_hwi (x
));
11515 if (bits
< HOST_BITS_PER_WIDE_INT
)
11517 bool negative
= ((val
>> (bits
- 1)) & 1) != 0;
11519 val
|= HOST_WIDE_INT_M1U
<< (bits
- 1) << 1;
11521 val
&= ~(HOST_WIDE_INT_M1U
<< (bits
- 1) << 1);
11527 /* If TYPE is an integral or pointer type, return an integer type with
11528 the same precision which is unsigned iff UNSIGNEDP is true, or itself
11529 if TYPE is already an integer type of signedness UNSIGNEDP. */
11532 signed_or_unsigned_type_for (int unsignedp
, tree type
)
11534 if (TREE_CODE (type
) == INTEGER_TYPE
&& TYPE_UNSIGNED (type
) == unsignedp
)
11537 if (TREE_CODE (type
) == VECTOR_TYPE
)
11539 tree inner
= TREE_TYPE (type
);
11540 tree inner2
= signed_or_unsigned_type_for (unsignedp
, inner
);
11543 if (inner
== inner2
)
11545 return build_vector_type (inner2
, TYPE_VECTOR_SUBPARTS (type
));
11548 if (!INTEGRAL_TYPE_P (type
)
11549 && !POINTER_TYPE_P (type
)
11550 && TREE_CODE (type
) != OFFSET_TYPE
)
11553 return build_nonstandard_integer_type (TYPE_PRECISION (type
), unsignedp
);
11556 /* If TYPE is an integral or pointer type, return an integer type with
11557 the same precision which is unsigned, or itself if TYPE is already an
11558 unsigned integer type. */
11561 unsigned_type_for (tree type
)
11563 return signed_or_unsigned_type_for (1, type
);
11566 /* If TYPE is an integral or pointer type, return an integer type with
11567 the same precision which is signed, or itself if TYPE is already a
11568 signed integer type. */
11571 signed_type_for (tree type
)
11573 return signed_or_unsigned_type_for (0, type
);
11576 /* If TYPE is a vector type, return a signed integer vector type with the
11577 same width and number of subparts. Otherwise return boolean_type_node. */
11580 truth_type_for (tree type
)
11582 if (TREE_CODE (type
) == VECTOR_TYPE
)
11584 if (VECTOR_BOOLEAN_TYPE_P (type
))
11586 return build_truth_vector_type (TYPE_VECTOR_SUBPARTS (type
),
11587 GET_MODE_SIZE (TYPE_MODE (type
)));
11590 return boolean_type_node
;
11593 /* Returns the largest value obtainable by casting something in INNER type to
11597 upper_bound_in_type (tree outer
, tree inner
)
11599 unsigned int det
= 0;
11600 unsigned oprec
= TYPE_PRECISION (outer
);
11601 unsigned iprec
= TYPE_PRECISION (inner
);
11604 /* Compute a unique number for every combination. */
11605 det
|= (oprec
> iprec
) ? 4 : 0;
11606 det
|= TYPE_UNSIGNED (outer
) ? 2 : 0;
11607 det
|= TYPE_UNSIGNED (inner
) ? 1 : 0;
11609 /* Determine the exponent to use. */
11614 /* oprec <= iprec, outer: signed, inner: don't care. */
11619 /* oprec <= iprec, outer: unsigned, inner: don't care. */
11623 /* oprec > iprec, outer: signed, inner: signed. */
11627 /* oprec > iprec, outer: signed, inner: unsigned. */
11631 /* oprec > iprec, outer: unsigned, inner: signed. */
11635 /* oprec > iprec, outer: unsigned, inner: unsigned. */
11639 gcc_unreachable ();
11642 return wide_int_to_tree (outer
,
11643 wi::mask (prec
, false, TYPE_PRECISION (outer
)));
11646 /* Returns the smallest value obtainable by casting something in INNER type to
11650 lower_bound_in_type (tree outer
, tree inner
)
11652 unsigned oprec
= TYPE_PRECISION (outer
);
11653 unsigned iprec
= TYPE_PRECISION (inner
);
11655 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
11657 if (TYPE_UNSIGNED (outer
)
11658 /* If we are widening something of an unsigned type, OUTER type
11659 contains all values of INNER type. In particular, both INNER
11660 and OUTER types have zero in common. */
11661 || (oprec
> iprec
&& TYPE_UNSIGNED (inner
)))
11662 return build_int_cst (outer
, 0);
11665 /* If we are widening a signed type to another signed type, we
11666 want to obtain -2^^(iprec-1). If we are keeping the
11667 precision or narrowing to a signed type, we want to obtain
11669 unsigned prec
= oprec
> iprec
? iprec
: oprec
;
11670 return wide_int_to_tree (outer
,
11671 wi::mask (prec
- 1, true,
11672 TYPE_PRECISION (outer
)));
11676 /* Return nonzero if two operands that are suitable for PHI nodes are
11677 necessarily equal. Specifically, both ARG0 and ARG1 must be either
11678 SSA_NAME or invariant. Note that this is strictly an optimization.
11679 That is, callers of this function can directly call operand_equal_p
11680 and get the same result, only slower. */
11683 operand_equal_for_phi_arg_p (const_tree arg0
, const_tree arg1
)
11687 if (TREE_CODE (arg0
) == SSA_NAME
|| TREE_CODE (arg1
) == SSA_NAME
)
11689 return operand_equal_p (arg0
, arg1
, 0);
11692 /* Returns number of zeros at the end of binary representation of X. */
11695 num_ending_zeros (const_tree x
)
11697 return build_int_cst (TREE_TYPE (x
), wi::ctz (x
));
11701 #define WALK_SUBTREE(NODE) \
11704 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
11710 /* This is a subroutine of walk_tree that walks field of TYPE that are to
11711 be walked whenever a type is seen in the tree. Rest of operands and return
11712 value are as for walk_tree. */
11715 walk_type_fields (tree type
, walk_tree_fn func
, void *data
,
11716 hash_set
<tree
> *pset
, walk_tree_lh lh
)
11718 tree result
= NULL_TREE
;
11720 switch (TREE_CODE (type
))
11723 case REFERENCE_TYPE
:
11725 /* We have to worry about mutually recursive pointers. These can't
11726 be written in C. They can in Ada. It's pathological, but
11727 there's an ACATS test (c38102a) that checks it. Deal with this
11728 by checking if we're pointing to another pointer, that one
11729 points to another pointer, that one does too, and we have no htab.
11730 If so, get a hash table. We check three levels deep to avoid
11731 the cost of the hash table if we don't need one. */
11732 if (POINTER_TYPE_P (TREE_TYPE (type
))
11733 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type
)))
11734 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type
))))
11737 result
= walk_tree_without_duplicates (&TREE_TYPE (type
),
11748 WALK_SUBTREE (TREE_TYPE (type
));
11752 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type
));
11754 /* Fall through. */
11756 case FUNCTION_TYPE
:
11757 WALK_SUBTREE (TREE_TYPE (type
));
11761 /* We never want to walk into default arguments. */
11762 for (arg
= TYPE_ARG_TYPES (type
); arg
; arg
= TREE_CHAIN (arg
))
11763 WALK_SUBTREE (TREE_VALUE (arg
));
11768 /* Don't follow this nodes's type if a pointer for fear that
11769 we'll have infinite recursion. If we have a PSET, then we
11772 || (!POINTER_TYPE_P (TREE_TYPE (type
))
11773 && TREE_CODE (TREE_TYPE (type
)) != OFFSET_TYPE
))
11774 WALK_SUBTREE (TREE_TYPE (type
));
11775 WALK_SUBTREE (TYPE_DOMAIN (type
));
11779 WALK_SUBTREE (TREE_TYPE (type
));
11780 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type
));
11790 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
11791 called with the DATA and the address of each sub-tree. If FUNC returns a
11792 non-NULL value, the traversal is stopped, and the value returned by FUNC
11793 is returned. If PSET is non-NULL it is used to record the nodes visited,
11794 and to avoid visiting a node more than once. */
11797 walk_tree_1 (tree
*tp
, walk_tree_fn func
, void *data
,
11798 hash_set
<tree
> *pset
, walk_tree_lh lh
)
11800 enum tree_code code
;
11804 #define WALK_SUBTREE_TAIL(NODE) \
11808 goto tail_recurse; \
11813 /* Skip empty subtrees. */
11817 /* Don't walk the same tree twice, if the user has requested
11818 that we avoid doing so. */
11819 if (pset
&& pset
->add (*tp
))
11822 /* Call the function. */
11824 result
= (*func
) (tp
, &walk_subtrees
, data
);
11826 /* If we found something, return it. */
11830 code
= TREE_CODE (*tp
);
11832 /* Even if we didn't, FUNC may have decided that there was nothing
11833 interesting below this point in the tree. */
11834 if (!walk_subtrees
)
11836 /* But we still need to check our siblings. */
11837 if (code
== TREE_LIST
)
11838 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
11839 else if (code
== OMP_CLAUSE
)
11840 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11847 result
= (*lh
) (tp
, &walk_subtrees
, func
, data
, pset
);
11848 if (result
|| !walk_subtrees
)
11855 case IDENTIFIER_NODE
:
11862 case PLACEHOLDER_EXPR
:
11866 /* None of these have subtrees other than those already walked
11871 WALK_SUBTREE (TREE_VALUE (*tp
));
11872 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
11877 int len
= TREE_VEC_LENGTH (*tp
);
11882 /* Walk all elements but the first. */
11884 WALK_SUBTREE (TREE_VEC_ELT (*tp
, len
));
11886 /* Now walk the first one as a tail call. */
11887 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp
, 0));
11891 WALK_SUBTREE (TREE_REALPART (*tp
));
11892 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp
));
11896 unsigned HOST_WIDE_INT idx
;
11897 constructor_elt
*ce
;
11899 for (idx
= 0; vec_safe_iterate (CONSTRUCTOR_ELTS (*tp
), idx
, &ce
);
11901 WALK_SUBTREE (ce
->value
);
11906 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, 0));
11911 for (decl
= BIND_EXPR_VARS (*tp
); decl
; decl
= DECL_CHAIN (decl
))
11913 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
11914 into declarations that are just mentioned, rather than
11915 declared; they don't really belong to this part of the tree.
11916 And, we can see cycles: the initializer for a declaration
11917 can refer to the declaration itself. */
11918 WALK_SUBTREE (DECL_INITIAL (decl
));
11919 WALK_SUBTREE (DECL_SIZE (decl
));
11920 WALK_SUBTREE (DECL_SIZE_UNIT (decl
));
11922 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp
));
11925 case STATEMENT_LIST
:
11927 tree_stmt_iterator i
;
11928 for (i
= tsi_start (*tp
); !tsi_end_p (i
); tsi_next (&i
))
11929 WALK_SUBTREE (*tsi_stmt_ptr (i
));
11934 switch (OMP_CLAUSE_CODE (*tp
))
11936 case OMP_CLAUSE_GANG
:
11937 case OMP_CLAUSE__GRIDDIM_
:
11938 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 1));
11941 case OMP_CLAUSE_ASYNC
:
11942 case OMP_CLAUSE_WAIT
:
11943 case OMP_CLAUSE_WORKER
:
11944 case OMP_CLAUSE_VECTOR
:
11945 case OMP_CLAUSE_NUM_GANGS
:
11946 case OMP_CLAUSE_NUM_WORKERS
:
11947 case OMP_CLAUSE_VECTOR_LENGTH
:
11948 case OMP_CLAUSE_PRIVATE
:
11949 case OMP_CLAUSE_SHARED
:
11950 case OMP_CLAUSE_FIRSTPRIVATE
:
11951 case OMP_CLAUSE_COPYIN
:
11952 case OMP_CLAUSE_COPYPRIVATE
:
11953 case OMP_CLAUSE_FINAL
:
11954 case OMP_CLAUSE_IF
:
11955 case OMP_CLAUSE_NUM_THREADS
:
11956 case OMP_CLAUSE_SCHEDULE
:
11957 case OMP_CLAUSE_UNIFORM
:
11958 case OMP_CLAUSE_DEPEND
:
11959 case OMP_CLAUSE_NUM_TEAMS
:
11960 case OMP_CLAUSE_THREAD_LIMIT
:
11961 case OMP_CLAUSE_DEVICE
:
11962 case OMP_CLAUSE_DIST_SCHEDULE
:
11963 case OMP_CLAUSE_SAFELEN
:
11964 case OMP_CLAUSE_SIMDLEN
:
11965 case OMP_CLAUSE_ORDERED
:
11966 case OMP_CLAUSE_PRIORITY
:
11967 case OMP_CLAUSE_GRAINSIZE
:
11968 case OMP_CLAUSE_NUM_TASKS
:
11969 case OMP_CLAUSE_HINT
:
11970 case OMP_CLAUSE_TO_DECLARE
:
11971 case OMP_CLAUSE_LINK
:
11972 case OMP_CLAUSE_USE_DEVICE_PTR
:
11973 case OMP_CLAUSE_IS_DEVICE_PTR
:
11974 case OMP_CLAUSE__LOOPTEMP_
:
11975 case OMP_CLAUSE__SIMDUID_
:
11976 case OMP_CLAUSE__CILK_FOR_COUNT_
:
11977 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 0));
11980 case OMP_CLAUSE_INDEPENDENT
:
11981 case OMP_CLAUSE_NOWAIT
:
11982 case OMP_CLAUSE_DEFAULT
:
11983 case OMP_CLAUSE_UNTIED
:
11984 case OMP_CLAUSE_MERGEABLE
:
11985 case OMP_CLAUSE_PROC_BIND
:
11986 case OMP_CLAUSE_INBRANCH
:
11987 case OMP_CLAUSE_NOTINBRANCH
:
11988 case OMP_CLAUSE_FOR
:
11989 case OMP_CLAUSE_PARALLEL
:
11990 case OMP_CLAUSE_SECTIONS
:
11991 case OMP_CLAUSE_TASKGROUP
:
11992 case OMP_CLAUSE_NOGROUP
:
11993 case OMP_CLAUSE_THREADS
:
11994 case OMP_CLAUSE_SIMD
:
11995 case OMP_CLAUSE_DEFAULTMAP
:
11996 case OMP_CLAUSE_AUTO
:
11997 case OMP_CLAUSE_SEQ
:
11998 case OMP_CLAUSE_TILE
:
11999 case OMP_CLAUSE__SIMT_
:
12000 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
12002 case OMP_CLAUSE_LASTPRIVATE
:
12003 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
12004 WALK_SUBTREE (OMP_CLAUSE_LASTPRIVATE_STMT (*tp
));
12005 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
12007 case OMP_CLAUSE_COLLAPSE
:
12010 for (i
= 0; i
< 3; i
++)
12011 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
12012 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
12015 case OMP_CLAUSE_LINEAR
:
12016 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
12017 WALK_SUBTREE (OMP_CLAUSE_LINEAR_STEP (*tp
));
12018 WALK_SUBTREE (OMP_CLAUSE_LINEAR_STMT (*tp
));
12019 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
12021 case OMP_CLAUSE_ALIGNED
:
12022 case OMP_CLAUSE_FROM
:
12023 case OMP_CLAUSE_TO
:
12024 case OMP_CLAUSE_MAP
:
12025 case OMP_CLAUSE__CACHE_
:
12026 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
12027 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 1));
12028 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
12030 case OMP_CLAUSE_REDUCTION
:
12033 for (i
= 0; i
< 5; i
++)
12034 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
12035 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
12039 gcc_unreachable ();
12047 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
12048 But, we only want to walk once. */
12049 len
= (TREE_OPERAND (*tp
, 3) == TREE_OPERAND (*tp
, 1)) ? 2 : 3;
12050 for (i
= 0; i
< len
; ++i
)
12051 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
12052 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
));
12056 /* If this is a TYPE_DECL, walk into the fields of the type that it's
12057 defining. We only want to walk into these fields of a type in this
12058 case and not in the general case of a mere reference to the type.
12060 The criterion is as follows: if the field can be an expression, it
12061 must be walked only here. This should be in keeping with the fields
12062 that are directly gimplified in gimplify_type_sizes in order for the
12063 mark/copy-if-shared/unmark machinery of the gimplifier to work with
12064 variable-sized types.
12066 Note that DECLs get walked as part of processing the BIND_EXPR. */
12067 if (TREE_CODE (DECL_EXPR_DECL (*tp
)) == TYPE_DECL
)
12069 tree
*type_p
= &TREE_TYPE (DECL_EXPR_DECL (*tp
));
12070 if (TREE_CODE (*type_p
) == ERROR_MARK
)
12073 /* Call the function for the type. See if it returns anything or
12074 doesn't want us to continue. If we are to continue, walk both
12075 the normal fields and those for the declaration case. */
12076 result
= (*func
) (type_p
, &walk_subtrees
, data
);
12077 if (result
|| !walk_subtrees
)
12080 /* But do not walk a pointed-to type since it may itself need to
12081 be walked in the declaration case if it isn't anonymous. */
12082 if (!POINTER_TYPE_P (*type_p
))
12084 result
= walk_type_fields (*type_p
, func
, data
, pset
, lh
);
12089 /* If this is a record type, also walk the fields. */
12090 if (RECORD_OR_UNION_TYPE_P (*type_p
))
12094 for (field
= TYPE_FIELDS (*type_p
); field
;
12095 field
= DECL_CHAIN (field
))
12097 /* We'd like to look at the type of the field, but we can
12098 easily get infinite recursion. So assume it's pointed
12099 to elsewhere in the tree. Also, ignore things that
12101 if (TREE_CODE (field
) != FIELD_DECL
)
12104 WALK_SUBTREE (DECL_FIELD_OFFSET (field
));
12105 WALK_SUBTREE (DECL_SIZE (field
));
12106 WALK_SUBTREE (DECL_SIZE_UNIT (field
));
12107 if (TREE_CODE (*type_p
) == QUAL_UNION_TYPE
)
12108 WALK_SUBTREE (DECL_QUALIFIER (field
));
12112 /* Same for scalar types. */
12113 else if (TREE_CODE (*type_p
) == BOOLEAN_TYPE
12114 || TREE_CODE (*type_p
) == ENUMERAL_TYPE
12115 || TREE_CODE (*type_p
) == INTEGER_TYPE
12116 || TREE_CODE (*type_p
) == FIXED_POINT_TYPE
12117 || TREE_CODE (*type_p
) == REAL_TYPE
)
12119 WALK_SUBTREE (TYPE_MIN_VALUE (*type_p
));
12120 WALK_SUBTREE (TYPE_MAX_VALUE (*type_p
));
12123 WALK_SUBTREE (TYPE_SIZE (*type_p
));
12124 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p
));
12129 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code
)))
12133 /* Walk over all the sub-trees of this operand. */
12134 len
= TREE_OPERAND_LENGTH (*tp
);
12136 /* Go through the subtrees. We need to do this in forward order so
12137 that the scope of a FOR_EXPR is handled properly. */
12140 for (i
= 0; i
< len
- 1; ++i
)
12141 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
12142 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
- 1));
12145 /* If this is a type, walk the needed fields in the type. */
12146 else if (TYPE_P (*tp
))
12147 return walk_type_fields (*tp
, func
, data
, pset
, lh
);
12151 /* We didn't find what we were looking for. */
12154 #undef WALK_SUBTREE_TAIL
12156 #undef WALK_SUBTREE
12158 /* Like walk_tree, but does not walk duplicate nodes more than once. */
12161 walk_tree_without_duplicates_1 (tree
*tp
, walk_tree_fn func
, void *data
,
12166 hash_set
<tree
> pset
;
12167 result
= walk_tree_1 (tp
, func
, data
, &pset
, lh
);
12173 tree_block (tree t
)
12175 const enum tree_code_class c
= TREE_CODE_CLASS (TREE_CODE (t
));
12177 if (IS_EXPR_CODE_CLASS (c
))
12178 return LOCATION_BLOCK (t
->exp
.locus
);
12179 gcc_unreachable ();
12184 tree_set_block (tree t
, tree b
)
12186 const enum tree_code_class c
= TREE_CODE_CLASS (TREE_CODE (t
));
12188 if (IS_EXPR_CODE_CLASS (c
))
12190 t
->exp
.locus
= set_block (t
->exp
.locus
, b
);
12193 gcc_unreachable ();
12196 /* Create a nameless artificial label and put it in the current
12197 function context. The label has a location of LOC. Returns the
12198 newly created label. */
12201 create_artificial_label (location_t loc
)
12203 tree lab
= build_decl (loc
,
12204 LABEL_DECL
, NULL_TREE
, void_type_node
);
12206 DECL_ARTIFICIAL (lab
) = 1;
12207 DECL_IGNORED_P (lab
) = 1;
12208 DECL_CONTEXT (lab
) = current_function_decl
;
12212 /* Given a tree, try to return a useful variable name that we can use
12213 to prefix a temporary that is being assigned the value of the tree.
12214 I.E. given <temp> = &A, return A. */
12219 tree stripped_decl
;
12222 STRIP_NOPS (stripped_decl
);
12223 if (DECL_P (stripped_decl
) && DECL_NAME (stripped_decl
))
12224 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl
));
12225 else if (TREE_CODE (stripped_decl
) == SSA_NAME
)
12227 tree name
= SSA_NAME_IDENTIFIER (stripped_decl
);
12230 return IDENTIFIER_POINTER (name
);
12234 switch (TREE_CODE (stripped_decl
))
12237 return get_name (TREE_OPERAND (stripped_decl
, 0));
12244 /* Return true if TYPE has a variable argument list. */
12247 stdarg_p (const_tree fntype
)
12249 function_args_iterator args_iter
;
12250 tree n
= NULL_TREE
, t
;
12255 FOREACH_FUNCTION_ARGS (fntype
, t
, args_iter
)
12260 return n
!= NULL_TREE
&& n
!= void_type_node
;
12263 /* Return true if TYPE has a prototype. */
12266 prototype_p (const_tree fntype
)
12270 gcc_assert (fntype
!= NULL_TREE
);
12272 t
= TYPE_ARG_TYPES (fntype
);
12273 return (t
!= NULL_TREE
);
12276 /* If BLOCK is inlined from an __attribute__((__artificial__))
12277 routine, return pointer to location from where it has been
12280 block_nonartificial_location (tree block
)
12282 location_t
*ret
= NULL
;
12284 while (block
&& TREE_CODE (block
) == BLOCK
12285 && BLOCK_ABSTRACT_ORIGIN (block
))
12287 tree ao
= BLOCK_ABSTRACT_ORIGIN (block
);
12289 while (TREE_CODE (ao
) == BLOCK
12290 && BLOCK_ABSTRACT_ORIGIN (ao
)
12291 && BLOCK_ABSTRACT_ORIGIN (ao
) != ao
)
12292 ao
= BLOCK_ABSTRACT_ORIGIN (ao
);
12294 if (TREE_CODE (ao
) == FUNCTION_DECL
)
12296 /* If AO is an artificial inline, point RET to the
12297 call site locus at which it has been inlined and continue
12298 the loop, in case AO's caller is also an artificial
12300 if (DECL_DECLARED_INLINE_P (ao
)
12301 && lookup_attribute ("artificial", DECL_ATTRIBUTES (ao
)))
12302 ret
= &BLOCK_SOURCE_LOCATION (block
);
12306 else if (TREE_CODE (ao
) != BLOCK
)
12309 block
= BLOCK_SUPERCONTEXT (block
);
12315 /* If EXP is inlined from an __attribute__((__artificial__))
12316 function, return the location of the original call expression. */
12319 tree_nonartificial_location (tree exp
)
12321 location_t
*loc
= block_nonartificial_location (TREE_BLOCK (exp
));
12326 return EXPR_LOCATION (exp
);
12330 /* These are the hash table functions for the hash table of OPTIMIZATION_NODEq
12333 /* Return the hash code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
12336 cl_option_hasher::hash (tree x
)
12338 const_tree
const t
= x
;
12342 hashval_t hash
= 0;
12344 if (TREE_CODE (t
) == OPTIMIZATION_NODE
)
12346 p
= (const char *)TREE_OPTIMIZATION (t
);
12347 len
= sizeof (struct cl_optimization
);
12350 else if (TREE_CODE (t
) == TARGET_OPTION_NODE
)
12351 return cl_target_option_hash (TREE_TARGET_OPTION (t
));
12354 gcc_unreachable ();
12356 /* assume most opt flags are just 0/1, some are 2-3, and a few might be
12358 for (i
= 0; i
< len
; i
++)
12360 hash
= (hash
<< 4) ^ ((i
<< 2) | p
[i
]);
12365 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
12366 TARGET_OPTION tree node) is the same as that given by *Y, which is the
12370 cl_option_hasher::equal (tree x
, tree y
)
12372 const_tree
const xt
= x
;
12373 const_tree
const yt
= y
;
12378 if (TREE_CODE (xt
) != TREE_CODE (yt
))
12381 if (TREE_CODE (xt
) == OPTIMIZATION_NODE
)
12383 xp
= (const char *)TREE_OPTIMIZATION (xt
);
12384 yp
= (const char *)TREE_OPTIMIZATION (yt
);
12385 len
= sizeof (struct cl_optimization
);
12388 else if (TREE_CODE (xt
) == TARGET_OPTION_NODE
)
12390 return cl_target_option_eq (TREE_TARGET_OPTION (xt
),
12391 TREE_TARGET_OPTION (yt
));
12395 gcc_unreachable ();
12397 return (memcmp (xp
, yp
, len
) == 0);
12400 /* Build an OPTIMIZATION_NODE based on the options in OPTS. */
12403 build_optimization_node (struct gcc_options
*opts
)
12407 /* Use the cache of optimization nodes. */
12409 cl_optimization_save (TREE_OPTIMIZATION (cl_optimization_node
),
12412 tree
*slot
= cl_option_hash_table
->find_slot (cl_optimization_node
, INSERT
);
12416 /* Insert this one into the hash table. */
12417 t
= cl_optimization_node
;
12420 /* Make a new node for next time round. */
12421 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
12427 /* Build a TARGET_OPTION_NODE based on the options in OPTS. */
12430 build_target_option_node (struct gcc_options
*opts
)
12434 /* Use the cache of optimization nodes. */
12436 cl_target_option_save (TREE_TARGET_OPTION (cl_target_option_node
),
12439 tree
*slot
= cl_option_hash_table
->find_slot (cl_target_option_node
, INSERT
);
12443 /* Insert this one into the hash table. */
12444 t
= cl_target_option_node
;
12447 /* Make a new node for next time round. */
12448 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
12454 /* Clear TREE_TARGET_GLOBALS of all TARGET_OPTION_NODE trees,
12455 so that they aren't saved during PCH writing. */
12458 prepare_target_option_nodes_for_pch (void)
12460 hash_table
<cl_option_hasher
>::iterator iter
= cl_option_hash_table
->begin ();
12461 for (; iter
!= cl_option_hash_table
->end (); ++iter
)
12462 if (TREE_CODE (*iter
) == TARGET_OPTION_NODE
)
12463 TREE_TARGET_GLOBALS (*iter
) = NULL
;
12466 /* Determine the "ultimate origin" of a block. The block may be an inlined
12467 instance of an inlined instance of a block which is local to an inline
12468 function, so we have to trace all of the way back through the origin chain
12469 to find out what sort of node actually served as the original seed for the
12473 block_ultimate_origin (const_tree block
)
12475 tree immediate_origin
= BLOCK_ABSTRACT_ORIGIN (block
);
12477 /* BLOCK_ABSTRACT_ORIGIN can point to itself; ignore that if
12478 we're trying to output the abstract instance of this function. */
12479 if (BLOCK_ABSTRACT (block
) && immediate_origin
== block
)
12482 if (immediate_origin
== NULL_TREE
)
12487 tree lookahead
= immediate_origin
;
12491 ret_val
= lookahead
;
12492 lookahead
= (TREE_CODE (ret_val
) == BLOCK
12493 ? BLOCK_ABSTRACT_ORIGIN (ret_val
) : NULL
);
12495 while (lookahead
!= NULL
&& lookahead
!= ret_val
);
12497 /* The block's abstract origin chain may not be the *ultimate* origin of
12498 the block. It could lead to a DECL that has an abstract origin set.
12499 If so, we want that DECL's abstract origin (which is what DECL_ORIGIN
12500 will give us if it has one). Note that DECL's abstract origins are
12501 supposed to be the most distant ancestor (or so decl_ultimate_origin
12502 claims), so we don't need to loop following the DECL origins. */
12503 if (DECL_P (ret_val
))
12504 return DECL_ORIGIN (ret_val
);
12510 /* Return true iff conversion from INNER_TYPE to OUTER_TYPE generates
12514 tree_nop_conversion_p (const_tree outer_type
, const_tree inner_type
)
12516 /* Do not strip casts into or out of differing address spaces. */
12517 if (POINTER_TYPE_P (outer_type
)
12518 && TYPE_ADDR_SPACE (TREE_TYPE (outer_type
)) != ADDR_SPACE_GENERIC
)
12520 if (!POINTER_TYPE_P (inner_type
)
12521 || (TYPE_ADDR_SPACE (TREE_TYPE (outer_type
))
12522 != TYPE_ADDR_SPACE (TREE_TYPE (inner_type
))))
12525 else if (POINTER_TYPE_P (inner_type
)
12526 && TYPE_ADDR_SPACE (TREE_TYPE (inner_type
)) != ADDR_SPACE_GENERIC
)
12528 /* We already know that outer_type is not a pointer with
12529 a non-generic address space. */
12533 /* Use precision rather then machine mode when we can, which gives
12534 the correct answer even for submode (bit-field) types. */
12535 if ((INTEGRAL_TYPE_P (outer_type
)
12536 || POINTER_TYPE_P (outer_type
)
12537 || TREE_CODE (outer_type
) == OFFSET_TYPE
)
12538 && (INTEGRAL_TYPE_P (inner_type
)
12539 || POINTER_TYPE_P (inner_type
)
12540 || TREE_CODE (inner_type
) == OFFSET_TYPE
))
12541 return TYPE_PRECISION (outer_type
) == TYPE_PRECISION (inner_type
);
12543 /* Otherwise fall back on comparing machine modes (e.g. for
12544 aggregate types, floats). */
12545 return TYPE_MODE (outer_type
) == TYPE_MODE (inner_type
);
12548 /* Return true iff conversion in EXP generates no instruction. Mark
12549 it inline so that we fully inline into the stripping functions even
12550 though we have two uses of this function. */
12553 tree_nop_conversion (const_tree exp
)
12555 tree outer_type
, inner_type
;
12557 if (!CONVERT_EXPR_P (exp
)
12558 && TREE_CODE (exp
) != NON_LVALUE_EXPR
)
12560 if (TREE_OPERAND (exp
, 0) == error_mark_node
)
12563 outer_type
= TREE_TYPE (exp
);
12564 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
12569 return tree_nop_conversion_p (outer_type
, inner_type
);
12572 /* Return true iff conversion in EXP generates no instruction. Don't
12573 consider conversions changing the signedness. */
12576 tree_sign_nop_conversion (const_tree exp
)
12578 tree outer_type
, inner_type
;
12580 if (!tree_nop_conversion (exp
))
12583 outer_type
= TREE_TYPE (exp
);
12584 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
12586 return (TYPE_UNSIGNED (outer_type
) == TYPE_UNSIGNED (inner_type
)
12587 && POINTER_TYPE_P (outer_type
) == POINTER_TYPE_P (inner_type
));
12590 /* Strip conversions from EXP according to tree_nop_conversion and
12591 return the resulting expression. */
12594 tree_strip_nop_conversions (tree exp
)
12596 while (tree_nop_conversion (exp
))
12597 exp
= TREE_OPERAND (exp
, 0);
12601 /* Strip conversions from EXP according to tree_sign_nop_conversion
12602 and return the resulting expression. */
12605 tree_strip_sign_nop_conversions (tree exp
)
12607 while (tree_sign_nop_conversion (exp
))
12608 exp
= TREE_OPERAND (exp
, 0);
12612 /* Avoid any floating point extensions from EXP. */
12614 strip_float_extensions (tree exp
)
12616 tree sub
, expt
, subt
;
12618 /* For floating point constant look up the narrowest type that can hold
12619 it properly and handle it like (type)(narrowest_type)constant.
12620 This way we can optimize for instance a=a*2.0 where "a" is float
12621 but 2.0 is double constant. */
12622 if (TREE_CODE (exp
) == REAL_CST
&& !DECIMAL_FLOAT_TYPE_P (TREE_TYPE (exp
)))
12624 REAL_VALUE_TYPE orig
;
12627 orig
= TREE_REAL_CST (exp
);
12628 if (TYPE_PRECISION (TREE_TYPE (exp
)) > TYPE_PRECISION (float_type_node
)
12629 && exact_real_truncate (TYPE_MODE (float_type_node
), &orig
))
12630 type
= float_type_node
;
12631 else if (TYPE_PRECISION (TREE_TYPE (exp
))
12632 > TYPE_PRECISION (double_type_node
)
12633 && exact_real_truncate (TYPE_MODE (double_type_node
), &orig
))
12634 type
= double_type_node
;
12636 return build_real_truncate (type
, orig
);
12639 if (!CONVERT_EXPR_P (exp
))
12642 sub
= TREE_OPERAND (exp
, 0);
12643 subt
= TREE_TYPE (sub
);
12644 expt
= TREE_TYPE (exp
);
12646 if (!FLOAT_TYPE_P (subt
))
12649 if (DECIMAL_FLOAT_TYPE_P (expt
) != DECIMAL_FLOAT_TYPE_P (subt
))
12652 if (TYPE_PRECISION (subt
) > TYPE_PRECISION (expt
))
12655 return strip_float_extensions (sub
);
12658 /* Strip out all handled components that produce invariant
12662 strip_invariant_refs (const_tree op
)
12664 while (handled_component_p (op
))
12666 switch (TREE_CODE (op
))
12669 case ARRAY_RANGE_REF
:
12670 if (!is_gimple_constant (TREE_OPERAND (op
, 1))
12671 || TREE_OPERAND (op
, 2) != NULL_TREE
12672 || TREE_OPERAND (op
, 3) != NULL_TREE
)
12676 case COMPONENT_REF
:
12677 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
12683 op
= TREE_OPERAND (op
, 0);
12689 static GTY(()) tree gcc_eh_personality_decl
;
12691 /* Return the GCC personality function decl. */
12694 lhd_gcc_personality (void)
12696 if (!gcc_eh_personality_decl
)
12697 gcc_eh_personality_decl
= build_personality_function ("gcc");
12698 return gcc_eh_personality_decl
;
12701 /* TARGET is a call target of GIMPLE call statement
12702 (obtained by gimple_call_fn). Return true if it is
12703 OBJ_TYPE_REF representing an virtual call of C++ method.
12704 (As opposed to OBJ_TYPE_REF representing objc calls
12705 through a cast where middle-end devirtualization machinery
12709 virtual_method_call_p (const_tree target
)
12711 if (TREE_CODE (target
) != OBJ_TYPE_REF
)
12713 tree t
= TREE_TYPE (target
);
12714 gcc_checking_assert (TREE_CODE (t
) == POINTER_TYPE
);
12716 if (TREE_CODE (t
) == FUNCTION_TYPE
)
12718 gcc_checking_assert (TREE_CODE (t
) == METHOD_TYPE
);
12719 /* If we do not have BINFO associated, it means that type was built
12720 without devirtualization enabled. Do not consider this a virtual
12722 if (!TYPE_BINFO (obj_type_ref_class (target
)))
12727 /* REF is OBJ_TYPE_REF, return the class the ref corresponds to. */
12730 obj_type_ref_class (const_tree ref
)
12732 gcc_checking_assert (TREE_CODE (ref
) == OBJ_TYPE_REF
);
12733 ref
= TREE_TYPE (ref
);
12734 gcc_checking_assert (TREE_CODE (ref
) == POINTER_TYPE
);
12735 ref
= TREE_TYPE (ref
);
12736 /* We look for type THIS points to. ObjC also builds
12737 OBJ_TYPE_REF with non-method calls, Their first parameter
12738 ID however also corresponds to class type. */
12739 gcc_checking_assert (TREE_CODE (ref
) == METHOD_TYPE
12740 || TREE_CODE (ref
) == FUNCTION_TYPE
);
12741 ref
= TREE_VALUE (TYPE_ARG_TYPES (ref
));
12742 gcc_checking_assert (TREE_CODE (ref
) == POINTER_TYPE
);
12743 return TREE_TYPE (ref
);
12746 /* Lookup sub-BINFO of BINFO of TYPE at offset POS. */
12749 lookup_binfo_at_offset (tree binfo
, tree type
, HOST_WIDE_INT pos
)
12752 tree base_binfo
, b
;
12754 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
12755 if (pos
== tree_to_shwi (BINFO_OFFSET (base_binfo
))
12756 && types_same_for_odr (TREE_TYPE (base_binfo
), type
))
12758 else if ((b
= lookup_binfo_at_offset (base_binfo
, type
, pos
)) != NULL
)
12763 /* Try to find a base info of BINFO that would have its field decl at offset
12764 OFFSET within the BINFO type and which is of EXPECTED_TYPE. If it can be
12765 found, return, otherwise return NULL_TREE. */
12768 get_binfo_at_offset (tree binfo
, HOST_WIDE_INT offset
, tree expected_type
)
12770 tree type
= BINFO_TYPE (binfo
);
12774 HOST_WIDE_INT pos
, size
;
12778 if (types_same_for_odr (type
, expected_type
))
12783 for (fld
= TYPE_FIELDS (type
); fld
; fld
= DECL_CHAIN (fld
))
12785 if (TREE_CODE (fld
) != FIELD_DECL
|| !DECL_ARTIFICIAL (fld
))
12788 pos
= int_bit_position (fld
);
12789 size
= tree_to_uhwi (DECL_SIZE (fld
));
12790 if (pos
<= offset
&& (pos
+ size
) > offset
)
12793 if (!fld
|| TREE_CODE (TREE_TYPE (fld
)) != RECORD_TYPE
)
12796 /* Offset 0 indicates the primary base, whose vtable contents are
12797 represented in the binfo for the derived class. */
12798 else if (offset
!= 0)
12800 tree found_binfo
= NULL
, base_binfo
;
12801 /* Offsets in BINFO are in bytes relative to the whole structure
12802 while POS is in bits relative to the containing field. */
12803 int binfo_offset
= (tree_to_shwi (BINFO_OFFSET (binfo
)) + pos
12806 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
12807 if (tree_to_shwi (BINFO_OFFSET (base_binfo
)) == binfo_offset
12808 && types_same_for_odr (TREE_TYPE (base_binfo
), TREE_TYPE (fld
)))
12810 found_binfo
= base_binfo
;
12814 binfo
= found_binfo
;
12816 binfo
= lookup_binfo_at_offset (binfo
, TREE_TYPE (fld
),
12820 type
= TREE_TYPE (fld
);
12825 /* Returns true if X is a typedef decl. */
12828 is_typedef_decl (const_tree x
)
12830 return (x
&& TREE_CODE (x
) == TYPE_DECL
12831 && DECL_ORIGINAL_TYPE (x
) != NULL_TREE
);
12834 /* Returns true iff TYPE is a type variant created for a typedef. */
12837 typedef_variant_p (const_tree type
)
12839 return is_typedef_decl (TYPE_NAME (type
));
12842 /* Warn about a use of an identifier which was marked deprecated. */
12844 warn_deprecated_use (tree node
, tree attr
)
12848 if (node
== 0 || !warn_deprecated_decl
)
12854 attr
= DECL_ATTRIBUTES (node
);
12855 else if (TYPE_P (node
))
12857 tree decl
= TYPE_STUB_DECL (node
);
12859 attr
= lookup_attribute ("deprecated",
12860 TYPE_ATTRIBUTES (TREE_TYPE (decl
)));
12865 attr
= lookup_attribute ("deprecated", attr
);
12868 msg
= TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr
)));
12876 w
= warning (OPT_Wdeprecated_declarations
,
12877 "%qD is deprecated: %s", node
, msg
);
12879 w
= warning (OPT_Wdeprecated_declarations
,
12880 "%qD is deprecated", node
);
12882 inform (DECL_SOURCE_LOCATION (node
), "declared here");
12884 else if (TYPE_P (node
))
12886 tree what
= NULL_TREE
;
12887 tree decl
= TYPE_STUB_DECL (node
);
12889 if (TYPE_NAME (node
))
12891 if (TREE_CODE (TYPE_NAME (node
)) == IDENTIFIER_NODE
)
12892 what
= TYPE_NAME (node
);
12893 else if (TREE_CODE (TYPE_NAME (node
)) == TYPE_DECL
12894 && DECL_NAME (TYPE_NAME (node
)))
12895 what
= DECL_NAME (TYPE_NAME (node
));
12903 w
= warning (OPT_Wdeprecated_declarations
,
12904 "%qE is deprecated: %s", what
, msg
);
12906 w
= warning (OPT_Wdeprecated_declarations
,
12907 "%qE is deprecated", what
);
12912 w
= warning (OPT_Wdeprecated_declarations
,
12913 "type is deprecated: %s", msg
);
12915 w
= warning (OPT_Wdeprecated_declarations
,
12916 "type is deprecated");
12919 inform (DECL_SOURCE_LOCATION (decl
), "declared here");
12926 warning (OPT_Wdeprecated_declarations
, "%qE is deprecated: %s",
12929 warning (OPT_Wdeprecated_declarations
, "%qE is deprecated", what
);
12934 warning (OPT_Wdeprecated_declarations
, "type is deprecated: %s",
12937 warning (OPT_Wdeprecated_declarations
, "type is deprecated");
12943 /* Return true if REF has a COMPONENT_REF with a bit-field field declaration
12944 somewhere in it. */
12947 contains_bitfld_component_ref_p (const_tree ref
)
12949 while (handled_component_p (ref
))
12951 if (TREE_CODE (ref
) == COMPONENT_REF
12952 && DECL_BIT_FIELD (TREE_OPERAND (ref
, 1)))
12954 ref
= TREE_OPERAND (ref
, 0);
12960 /* Try to determine whether a TRY_CATCH expression can fall through.
12961 This is a subroutine of block_may_fallthru. */
12964 try_catch_may_fallthru (const_tree stmt
)
12966 tree_stmt_iterator i
;
12968 /* If the TRY block can fall through, the whole TRY_CATCH can
12970 if (block_may_fallthru (TREE_OPERAND (stmt
, 0)))
12973 i
= tsi_start (TREE_OPERAND (stmt
, 1));
12974 switch (TREE_CODE (tsi_stmt (i
)))
12977 /* We expect to see a sequence of CATCH_EXPR trees, each with a
12978 catch expression and a body. The whole TRY_CATCH may fall
12979 through iff any of the catch bodies falls through. */
12980 for (; !tsi_end_p (i
); tsi_next (&i
))
12982 if (block_may_fallthru (CATCH_BODY (tsi_stmt (i
))))
12987 case EH_FILTER_EXPR
:
12988 /* The exception filter expression only matters if there is an
12989 exception. If the exception does not match EH_FILTER_TYPES,
12990 we will execute EH_FILTER_FAILURE, and we will fall through
12991 if that falls through. If the exception does match
12992 EH_FILTER_TYPES, the stack unwinder will continue up the
12993 stack, so we will not fall through. We don't know whether we
12994 will throw an exception which matches EH_FILTER_TYPES or not,
12995 so we just ignore EH_FILTER_TYPES and assume that we might
12996 throw an exception which doesn't match. */
12997 return block_may_fallthru (EH_FILTER_FAILURE (tsi_stmt (i
)));
13000 /* This case represents statements to be executed when an
13001 exception occurs. Those statements are implicitly followed
13002 by a RESX statement to resume execution after the exception.
13003 So in this case the TRY_CATCH never falls through. */
13008 /* Try to determine if we can fall out of the bottom of BLOCK. This guess
13009 need not be 100% accurate; simply be conservative and return true if we
13010 don't know. This is used only to avoid stupidly generating extra code.
13011 If we're wrong, we'll just delete the extra code later. */
13014 block_may_fallthru (const_tree block
)
13016 /* This CONST_CAST is okay because expr_last returns its argument
13017 unmodified and we assign it to a const_tree. */
13018 const_tree stmt
= expr_last (CONST_CAST_TREE (block
));
13020 switch (stmt
? TREE_CODE (stmt
) : ERROR_MARK
)
13024 /* Easy cases. If the last statement of the block implies
13025 control transfer, then we can't fall through. */
13029 /* If SWITCH_LABELS is set, this is lowered, and represents a
13030 branch to a selected label and hence can not fall through.
13031 Otherwise SWITCH_BODY is set, and the switch can fall
13033 return SWITCH_LABELS (stmt
) == NULL_TREE
;
13036 if (block_may_fallthru (COND_EXPR_THEN (stmt
)))
13038 return block_may_fallthru (COND_EXPR_ELSE (stmt
));
13041 return block_may_fallthru (BIND_EXPR_BODY (stmt
));
13043 case TRY_CATCH_EXPR
:
13044 return try_catch_may_fallthru (stmt
);
13046 case TRY_FINALLY_EXPR
:
13047 /* The finally clause is always executed after the try clause,
13048 so if it does not fall through, then the try-finally will not
13049 fall through. Otherwise, if the try clause does not fall
13050 through, then when the finally clause falls through it will
13051 resume execution wherever the try clause was going. So the
13052 whole try-finally will only fall through if both the try
13053 clause and the finally clause fall through. */
13054 return (block_may_fallthru (TREE_OPERAND (stmt
, 0))
13055 && block_may_fallthru (TREE_OPERAND (stmt
, 1)));
13058 if (TREE_CODE (TREE_OPERAND (stmt
, 1)) == CALL_EXPR
)
13059 stmt
= TREE_OPERAND (stmt
, 1);
13065 /* Functions that do not return do not fall through. */
13066 return (call_expr_flags (stmt
) & ECF_NORETURN
) == 0;
13068 case CLEANUP_POINT_EXPR
:
13069 return block_may_fallthru (TREE_OPERAND (stmt
, 0));
13072 return block_may_fallthru (TREE_OPERAND (stmt
, 1));
13078 return lang_hooks
.block_may_fallthru (stmt
);
13082 /* True if we are using EH to handle cleanups. */
13083 static bool using_eh_for_cleanups_flag
= false;
13085 /* This routine is called from front ends to indicate eh should be used for
13088 using_eh_for_cleanups (void)
13090 using_eh_for_cleanups_flag
= true;
13093 /* Query whether EH is used for cleanups. */
13095 using_eh_for_cleanups_p (void)
13097 return using_eh_for_cleanups_flag
;
13100 /* Wrapper for tree_code_name to ensure that tree code is valid */
13102 get_tree_code_name (enum tree_code code
)
13104 const char *invalid
= "<invalid tree code>";
13106 if (code
>= MAX_TREE_CODES
)
13109 return tree_code_name
[code
];
13112 /* Drops the TREE_OVERFLOW flag from T. */
13115 drop_tree_overflow (tree t
)
13117 gcc_checking_assert (TREE_OVERFLOW (t
));
13119 /* For tree codes with a sharing machinery re-build the result. */
13120 if (TREE_CODE (t
) == INTEGER_CST
)
13121 return wide_int_to_tree (TREE_TYPE (t
), t
);
13123 /* Otherwise, as all tcc_constants are possibly shared, copy the node
13124 and drop the flag. */
13126 TREE_OVERFLOW (t
) = 0;
13130 /* Given a memory reference expression T, return its base address.
13131 The base address of a memory reference expression is the main
13132 object being referenced. For instance, the base address for
13133 'array[i].fld[j]' is 'array'. You can think of this as stripping
13134 away the offset part from a memory address.
13136 This function calls handled_component_p to strip away all the inner
13137 parts of the memory reference until it reaches the base object. */
13140 get_base_address (tree t
)
13142 while (handled_component_p (t
))
13143 t
= TREE_OPERAND (t
, 0);
13145 if ((TREE_CODE (t
) == MEM_REF
13146 || TREE_CODE (t
) == TARGET_MEM_REF
)
13147 && TREE_CODE (TREE_OPERAND (t
, 0)) == ADDR_EXPR
)
13148 t
= TREE_OPERAND (TREE_OPERAND (t
, 0), 0);
13150 /* ??? Either the alias oracle or all callers need to properly deal
13151 with WITH_SIZE_EXPRs before we can look through those. */
13152 if (TREE_CODE (t
) == WITH_SIZE_EXPR
)
13158 /* Return a tree of sizetype representing the size, in bytes, of the element
13159 of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
13162 array_ref_element_size (tree exp
)
13164 tree aligned_size
= TREE_OPERAND (exp
, 3);
13165 tree elmt_type
= TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp
, 0)));
13166 location_t loc
= EXPR_LOCATION (exp
);
13168 /* If a size was specified in the ARRAY_REF, it's the size measured
13169 in alignment units of the element type. So multiply by that value. */
13172 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
13173 sizetype from another type of the same width and signedness. */
13174 if (TREE_TYPE (aligned_size
) != sizetype
)
13175 aligned_size
= fold_convert_loc (loc
, sizetype
, aligned_size
);
13176 return size_binop_loc (loc
, MULT_EXPR
, aligned_size
,
13177 size_int (TYPE_ALIGN_UNIT (elmt_type
)));
13180 /* Otherwise, take the size from that of the element type. Substitute
13181 any PLACEHOLDER_EXPR that we have. */
13183 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_SIZE_UNIT (elmt_type
), exp
);
13186 /* Return a tree representing the lower bound of the array mentioned in
13187 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
13190 array_ref_low_bound (tree exp
)
13192 tree domain_type
= TYPE_DOMAIN (TREE_TYPE (TREE_OPERAND (exp
, 0)));
13194 /* If a lower bound is specified in EXP, use it. */
13195 if (TREE_OPERAND (exp
, 2))
13196 return TREE_OPERAND (exp
, 2);
13198 /* Otherwise, if there is a domain type and it has a lower bound, use it,
13199 substituting for a PLACEHOLDER_EXPR as needed. */
13200 if (domain_type
&& TYPE_MIN_VALUE (domain_type
))
13201 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_MIN_VALUE (domain_type
), exp
);
13203 /* Otherwise, return a zero of the appropriate type. */
13204 return build_int_cst (TREE_TYPE (TREE_OPERAND (exp
, 1)), 0);
13207 /* Return a tree representing the upper bound of the array mentioned in
13208 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
13211 array_ref_up_bound (tree exp
)
13213 tree domain_type
= TYPE_DOMAIN (TREE_TYPE (TREE_OPERAND (exp
, 0)));
13215 /* If there is a domain type and it has an upper bound, use it, substituting
13216 for a PLACEHOLDER_EXPR as needed. */
13217 if (domain_type
&& TYPE_MAX_VALUE (domain_type
))
13218 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_MAX_VALUE (domain_type
), exp
);
13220 /* Otherwise fail. */
13224 /* Returns true if REF is an array reference or a component reference
13225 to an array at the end of a structure.
13226 If this is the case, the array may be allocated larger
13227 than its upper bound implies. */
13230 array_at_struct_end_p (tree ref
)
13234 if (TREE_CODE (ref
) == ARRAY_REF
13235 || TREE_CODE (ref
) == ARRAY_RANGE_REF
)
13237 atype
= TREE_TYPE (TREE_OPERAND (ref
, 0));
13238 ref
= TREE_OPERAND (ref
, 0);
13240 else if (TREE_CODE (ref
) == COMPONENT_REF
13241 && TREE_CODE (TREE_TYPE (TREE_OPERAND (ref
, 1))) == ARRAY_TYPE
)
13242 atype
= TREE_TYPE (TREE_OPERAND (ref
, 1));
13246 while (handled_component_p (ref
))
13248 /* If the reference chain contains a component reference to a
13249 non-union type and there follows another field the reference
13250 is not at the end of a structure. */
13251 if (TREE_CODE (ref
) == COMPONENT_REF
)
13253 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (ref
, 0))) == RECORD_TYPE
)
13255 tree nextf
= DECL_CHAIN (TREE_OPERAND (ref
, 1));
13256 while (nextf
&& TREE_CODE (nextf
) != FIELD_DECL
)
13257 nextf
= DECL_CHAIN (nextf
);
13262 /* If we have a multi-dimensional array we do not consider
13263 a non-innermost dimension as flex array if the whole
13264 multi-dimensional array is at struct end.
13265 Same for an array of aggregates with a trailing array
13267 else if (TREE_CODE (ref
) == ARRAY_REF
)
13269 else if (TREE_CODE (ref
) == ARRAY_RANGE_REF
)
13271 /* If we view an underlying object as sth else then what we
13272 gathered up to now is what we have to rely on. */
13273 else if (TREE_CODE (ref
) == VIEW_CONVERT_EXPR
)
13276 gcc_unreachable ();
13278 ref
= TREE_OPERAND (ref
, 0);
13281 /* The array now is at struct end. Treat flexible arrays as
13282 always subject to extend, even into just padding constrained by
13283 an underlying decl. */
13284 if (! TYPE_SIZE (atype
))
13289 if (TREE_CODE (ref
) == MEM_REF
13290 && TREE_CODE (TREE_OPERAND (ref
, 0)) == ADDR_EXPR
)
13292 size
= TYPE_SIZE (TREE_TYPE (ref
));
13293 ref
= TREE_OPERAND (TREE_OPERAND (ref
, 0), 0);
13296 /* If the reference is based on a declared entity, the size of the array
13297 is constrained by its given domain. (Do not trust commons PR/69368). */
13299 /* Be sure the size of MEM_REF target match. For example:
13302 struct foo *str = (struct foo *)&buf;
13304 str->trailin_array[2] = 1;
13306 is valid because BUF allocate enough space. */
13308 && (!size
|| (DECL_SIZE (ref
) != NULL
13309 && operand_equal_p (DECL_SIZE (ref
), size
, 0)))
13310 && !(flag_unconstrained_commons
13311 && VAR_P (ref
) && DECL_COMMON (ref
)))
13317 /* Return a tree representing the offset, in bytes, of the field referenced
13318 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
13321 component_ref_field_offset (tree exp
)
13323 tree aligned_offset
= TREE_OPERAND (exp
, 2);
13324 tree field
= TREE_OPERAND (exp
, 1);
13325 location_t loc
= EXPR_LOCATION (exp
);
13327 /* If an offset was specified in the COMPONENT_REF, it's the offset measured
13328 in units of DECL_OFFSET_ALIGN / BITS_PER_UNIT. So multiply by that
13330 if (aligned_offset
)
13332 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
13333 sizetype from another type of the same width and signedness. */
13334 if (TREE_TYPE (aligned_offset
) != sizetype
)
13335 aligned_offset
= fold_convert_loc (loc
, sizetype
, aligned_offset
);
13336 return size_binop_loc (loc
, MULT_EXPR
, aligned_offset
,
13337 size_int (DECL_OFFSET_ALIGN (field
)
13341 /* Otherwise, take the offset from that of the field. Substitute
13342 any PLACEHOLDER_EXPR that we have. */
13344 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (DECL_FIELD_OFFSET (field
), exp
);
13347 /* Return the machine mode of T. For vectors, returns the mode of the
13348 inner type. The main use case is to feed the result to HONOR_NANS,
13349 avoiding the BLKmode that a direct TYPE_MODE (T) might return. */
13352 element_mode (const_tree t
)
13356 if (VECTOR_TYPE_P (t
) || TREE_CODE (t
) == COMPLEX_TYPE
)
13358 return TYPE_MODE (t
);
13362 /* Veirfy that basic properties of T match TV and thus T can be a variant of
13363 TV. TV should be the more specified variant (i.e. the main variant). */
13366 verify_type_variant (const_tree t
, tree tv
)
13368 /* Type variant can differ by:
13370 - TYPE_QUALS: TYPE_READONLY, TYPE_VOLATILE, TYPE_ATOMIC, TYPE_RESTRICT,
13371 ENCODE_QUAL_ADDR_SPACE.
13372 - main variant may be TYPE_COMPLETE_P and variant types !TYPE_COMPLETE_P
13373 in this case some values may not be set in the variant types
13374 (see TYPE_COMPLETE_P checks).
13375 - it is possible to have TYPE_ARTIFICIAL variant of non-artifical type
13376 - by TYPE_NAME and attributes (i.e. when variant originate by typedef)
13377 - TYPE_CANONICAL (TYPE_ALIAS_SET is the same among variants)
13378 - by the alignment: TYPE_ALIGN and TYPE_USER_ALIGN
13379 - during LTO by TYPE_CONTEXT if type is TYPE_FILE_SCOPE_P
13380 this is necessary to make it possible to merge types form different TUs
13381 - arrays, pointers and references may have TREE_TYPE that is a variant
13382 of TREE_TYPE of their main variants.
13383 - aggregates may have new TYPE_FIELDS list that list variants of
13384 the main variant TYPE_FIELDS.
13385 - vector types may differ by TYPE_VECTOR_OPAQUE
13386 - TYPE_METHODS is always NULL for variant types and maintained for
13390 /* Convenience macro for matching individual fields. */
13391 #define verify_variant_match(flag) \
13393 if (flag (tv) != flag (t)) \
13395 error ("type variant differs by " #flag "."); \
13401 /* tree_base checks. */
13403 verify_variant_match (TREE_CODE
);
13404 /* FIXME: Ada builds non-artificial variants of artificial types. */
13405 if (TYPE_ARTIFICIAL (tv
) && 0)
13406 verify_variant_match (TYPE_ARTIFICIAL
);
13407 if (POINTER_TYPE_P (tv
))
13408 verify_variant_match (TYPE_REF_CAN_ALIAS_ALL
);
13409 /* FIXME: TYPE_SIZES_GIMPLIFIED may differs for Ada build. */
13410 verify_variant_match (TYPE_UNSIGNED
);
13411 verify_variant_match (TYPE_PACKED
);
13412 if (TREE_CODE (t
) == REFERENCE_TYPE
)
13413 verify_variant_match (TYPE_REF_IS_RVALUE
);
13414 if (AGGREGATE_TYPE_P (t
))
13415 verify_variant_match (TYPE_REVERSE_STORAGE_ORDER
);
13417 verify_variant_match (TYPE_SATURATING
);
13418 /* FIXME: This check trigger during libstdc++ build. */
13419 if (RECORD_OR_UNION_TYPE_P (t
) && COMPLETE_TYPE_P (t
) && 0)
13420 verify_variant_match (TYPE_FINAL_P
);
13422 /* tree_type_common checks. */
13424 if (COMPLETE_TYPE_P (t
))
13426 verify_variant_match (TYPE_MODE
);
13427 if (TREE_CODE (TYPE_SIZE (t
)) != PLACEHOLDER_EXPR
13428 && TREE_CODE (TYPE_SIZE (tv
)) != PLACEHOLDER_EXPR
)
13429 verify_variant_match (TYPE_SIZE
);
13430 if (TREE_CODE (TYPE_SIZE_UNIT (t
)) != PLACEHOLDER_EXPR
13431 && TREE_CODE (TYPE_SIZE_UNIT (tv
)) != PLACEHOLDER_EXPR
13432 && TYPE_SIZE_UNIT (t
) != TYPE_SIZE_UNIT (tv
))
13434 gcc_assert (!operand_equal_p (TYPE_SIZE_UNIT (t
),
13435 TYPE_SIZE_UNIT (tv
), 0));
13436 error ("type variant has different TYPE_SIZE_UNIT");
13438 error ("type variant's TYPE_SIZE_UNIT");
13439 debug_tree (TYPE_SIZE_UNIT (tv
));
13440 error ("type's TYPE_SIZE_UNIT");
13441 debug_tree (TYPE_SIZE_UNIT (t
));
13445 verify_variant_match (TYPE_PRECISION
);
13446 verify_variant_match (TYPE_NEEDS_CONSTRUCTING
);
13447 if (RECORD_OR_UNION_TYPE_P (t
))
13448 verify_variant_match (TYPE_TRANSPARENT_AGGR
);
13449 else if (TREE_CODE (t
) == ARRAY_TYPE
)
13450 verify_variant_match (TYPE_NONALIASED_COMPONENT
);
13451 /* During LTO we merge variant lists from diferent translation units
13452 that may differ BY TYPE_CONTEXT that in turn may point
13453 to TRANSLATION_UNIT_DECL.
13454 Ada also builds variants of types with different TYPE_CONTEXT. */
13455 if ((!in_lto_p
|| !TYPE_FILE_SCOPE_P (t
)) && 0)
13456 verify_variant_match (TYPE_CONTEXT
);
13457 verify_variant_match (TYPE_STRING_FLAG
);
13458 if (TYPE_ALIAS_SET_KNOWN_P (t
))
13460 error ("type variant with TYPE_ALIAS_SET_KNOWN_P");
13465 /* tree_type_non_common checks. */
13467 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
13468 and dangle the pointer from time to time. */
13469 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_VFIELD (t
) != TYPE_VFIELD (tv
)
13470 && (in_lto_p
|| !TYPE_VFIELD (tv
)
13471 || TREE_CODE (TYPE_VFIELD (tv
)) != TREE_LIST
))
13473 error ("type variant has different TYPE_VFIELD");
13477 if ((TREE_CODE (t
) == ENUMERAL_TYPE
&& COMPLETE_TYPE_P (t
))
13478 || TREE_CODE (t
) == INTEGER_TYPE
13479 || TREE_CODE (t
) == BOOLEAN_TYPE
13480 || TREE_CODE (t
) == REAL_TYPE
13481 || TREE_CODE (t
) == FIXED_POINT_TYPE
)
13483 verify_variant_match (TYPE_MAX_VALUE
);
13484 verify_variant_match (TYPE_MIN_VALUE
);
13486 if (TREE_CODE (t
) == METHOD_TYPE
)
13487 verify_variant_match (TYPE_METHOD_BASETYPE
);
13488 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_METHODS (t
))
13490 error ("type variant has TYPE_METHODS");
13494 if (TREE_CODE (t
) == OFFSET_TYPE
)
13495 verify_variant_match (TYPE_OFFSET_BASETYPE
);
13496 if (TREE_CODE (t
) == ARRAY_TYPE
)
13497 verify_variant_match (TYPE_ARRAY_MAX_SIZE
);
13498 /* FIXME: Be lax and allow TYPE_BINFO to be missing in variant types
13499 or even type's main variant. This is needed to make bootstrap pass
13500 and the bug seems new in GCC 5.
13501 C++ FE should be updated to make this consistent and we should check
13502 that TYPE_BINFO is always NULL for !COMPLETE_TYPE_P and otherwise there
13503 is a match with main variant.
13505 Also disable the check for Java for now because of parser hack that builds
13506 first an dummy BINFO and then sometimes replace it by real BINFO in some
13508 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_BINFO (t
) && TYPE_BINFO (tv
)
13509 && TYPE_BINFO (t
) != TYPE_BINFO (tv
)
13510 /* FIXME: Java sometimes keep dump TYPE_BINFOs on variant types.
13511 Since there is no cheap way to tell C++/Java type w/o LTO, do checking
13512 at LTO time only. */
13513 && (in_lto_p
&& odr_type_p (t
)))
13515 error ("type variant has different TYPE_BINFO");
13517 error ("type variant's TYPE_BINFO");
13518 debug_tree (TYPE_BINFO (tv
));
13519 error ("type's TYPE_BINFO");
13520 debug_tree (TYPE_BINFO (t
));
13524 /* Check various uses of TYPE_VALUES_RAW. */
13525 if (TREE_CODE (t
) == ENUMERAL_TYPE
)
13526 verify_variant_match (TYPE_VALUES
);
13527 else if (TREE_CODE (t
) == ARRAY_TYPE
)
13528 verify_variant_match (TYPE_DOMAIN
);
13529 /* Permit incomplete variants of complete type. While FEs may complete
13530 all variants, this does not happen for C++ templates in all cases. */
13531 else if (RECORD_OR_UNION_TYPE_P (t
)
13532 && COMPLETE_TYPE_P (t
)
13533 && TYPE_FIELDS (t
) != TYPE_FIELDS (tv
))
13537 /* Fortran builds qualified variants as new records with items of
13538 qualified type. Verify that they looks same. */
13539 for (f1
= TYPE_FIELDS (t
), f2
= TYPE_FIELDS (tv
);
13541 f1
= TREE_CHAIN (f1
), f2
= TREE_CHAIN (f2
))
13542 if (TREE_CODE (f1
) != FIELD_DECL
|| TREE_CODE (f2
) != FIELD_DECL
13543 || (TYPE_MAIN_VARIANT (TREE_TYPE (f1
))
13544 != TYPE_MAIN_VARIANT (TREE_TYPE (f2
))
13545 /* FIXME: gfc_nonrestricted_type builds all types as variants
13546 with exception of pointer types. It deeply copies the type
13547 which means that we may end up with a variant type
13548 referring non-variant pointer. We may change it to
13549 produce types as variants, too, like
13550 objc_get_protocol_qualified_type does. */
13551 && !POINTER_TYPE_P (TREE_TYPE (f1
)))
13552 || DECL_FIELD_OFFSET (f1
) != DECL_FIELD_OFFSET (f2
)
13553 || DECL_FIELD_BIT_OFFSET (f1
) != DECL_FIELD_BIT_OFFSET (f2
))
13557 error ("type variant has different TYPE_FIELDS");
13559 error ("first mismatch is field");
13561 error ("and field");
13566 else if ((TREE_CODE (t
) == FUNCTION_TYPE
|| TREE_CODE (t
) == METHOD_TYPE
))
13567 verify_variant_match (TYPE_ARG_TYPES
);
13568 /* For C++ the qualified variant of array type is really an array type
13569 of qualified TREE_TYPE.
13570 objc builds variants of pointer where pointer to type is a variant, too
13571 in objc_get_protocol_qualified_type. */
13572 if (TREE_TYPE (t
) != TREE_TYPE (tv
)
13573 && ((TREE_CODE (t
) != ARRAY_TYPE
13574 && !POINTER_TYPE_P (t
))
13575 || TYPE_MAIN_VARIANT (TREE_TYPE (t
))
13576 != TYPE_MAIN_VARIANT (TREE_TYPE (tv
))))
13578 error ("type variant has different TREE_TYPE");
13580 error ("type variant's TREE_TYPE");
13581 debug_tree (TREE_TYPE (tv
));
13582 error ("type's TREE_TYPE");
13583 debug_tree (TREE_TYPE (t
));
13586 if (type_with_alias_set_p (t
)
13587 && !gimple_canonical_types_compatible_p (t
, tv
, false))
13589 error ("type is not compatible with its variant");
13591 error ("type variant's TREE_TYPE");
13592 debug_tree (TREE_TYPE (tv
));
13593 error ("type's TREE_TYPE");
13594 debug_tree (TREE_TYPE (t
));
13598 #undef verify_variant_match
13602 /* The TYPE_CANONICAL merging machinery. It should closely resemble
13603 the middle-end types_compatible_p function. It needs to avoid
13604 claiming types are different for types that should be treated
13605 the same with respect to TBAA. Canonical types are also used
13606 for IL consistency checks via the useless_type_conversion_p
13607 predicate which does not handle all type kinds itself but falls
13608 back to pointer-comparison of TYPE_CANONICAL for aggregates
13611 /* Return true if TYPE_UNSIGNED of TYPE should be ignored for canonical
13612 type calculation because we need to allow inter-operability between signed
13613 and unsigned variants. */
13616 type_with_interoperable_signedness (const_tree type
)
13618 /* Fortran standard require C_SIGNED_CHAR to be interoperable with both
13619 signed char and unsigned char. Similarly fortran FE builds
13620 C_SIZE_T as signed type, while C defines it unsigned. */
13622 return tree_code_for_canonical_type_merging (TREE_CODE (type
))
13624 && (TYPE_PRECISION (type
) == TYPE_PRECISION (signed_char_type_node
)
13625 || TYPE_PRECISION (type
) == TYPE_PRECISION (size_type_node
));
13628 /* Return true iff T1 and T2 are structurally identical for what
13630 This function is used both by lto.c canonical type merging and by the
13631 verifier. If TRUST_TYPE_CANONICAL we do not look into structure of types
13632 that have TYPE_CANONICAL defined and assume them equivalent. This is useful
13633 only for LTO because only in these cases TYPE_CANONICAL equivalence
13634 correspond to one defined by gimple_canonical_types_compatible_p. */
13637 gimple_canonical_types_compatible_p (const_tree t1
, const_tree t2
,
13638 bool trust_type_canonical
)
13640 /* Type variants should be same as the main variant. When not doing sanity
13641 checking to verify this fact, go to main variants and save some work. */
13642 if (trust_type_canonical
)
13644 t1
= TYPE_MAIN_VARIANT (t1
);
13645 t2
= TYPE_MAIN_VARIANT (t2
);
13648 /* Check first for the obvious case of pointer identity. */
13652 /* Check that we have two types to compare. */
13653 if (t1
== NULL_TREE
|| t2
== NULL_TREE
)
13656 /* We consider complete types always compatible with incomplete type.
13657 This does not make sense for canonical type calculation and thus we
13658 need to ensure that we are never called on it.
13660 FIXME: For more correctness the function probably should have three modes
13661 1) mode assuming that types are complete mathcing their structure
13662 2) mode allowing incomplete types but producing equivalence classes
13663 and thus ignoring all info from complete types
13664 3) mode allowing incomplete types to match complete but checking
13665 compatibility between complete types.
13667 1 and 2 can be used for canonical type calculation. 3 is the real
13668 definition of type compatibility that can be used i.e. for warnings during
13669 declaration merging. */
13671 gcc_assert (!trust_type_canonical
13672 || (type_with_alias_set_p (t1
) && type_with_alias_set_p (t2
)));
13673 /* If the types have been previously registered and found equal
13676 if (TYPE_CANONICAL (t1
) && TYPE_CANONICAL (t2
)
13677 && trust_type_canonical
)
13679 /* Do not use TYPE_CANONICAL of pointer types. For LTO streamed types
13680 they are always NULL, but they are set to non-NULL for types
13681 constructed by build_pointer_type and variants. In this case the
13682 TYPE_CANONICAL is more fine grained than the equivalnce we test (where
13683 all pointers are considered equal. Be sure to not return false
13685 gcc_checking_assert (canonical_type_used_p (t1
)
13686 && canonical_type_used_p (t2
));
13687 return TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
);
13690 /* Can't be the same type if the types don't have the same code. */
13691 enum tree_code code
= tree_code_for_canonical_type_merging (TREE_CODE (t1
));
13692 if (code
!= tree_code_for_canonical_type_merging (TREE_CODE (t2
)))
13695 /* Qualifiers do not matter for canonical type comparison purposes. */
13697 /* Void types and nullptr types are always the same. */
13698 if (TREE_CODE (t1
) == VOID_TYPE
13699 || TREE_CODE (t1
) == NULLPTR_TYPE
)
13702 /* Can't be the same type if they have different mode. */
13703 if (TYPE_MODE (t1
) != TYPE_MODE (t2
))
13706 /* Non-aggregate types can be handled cheaply. */
13707 if (INTEGRAL_TYPE_P (t1
)
13708 || SCALAR_FLOAT_TYPE_P (t1
)
13709 || FIXED_POINT_TYPE_P (t1
)
13710 || TREE_CODE (t1
) == VECTOR_TYPE
13711 || TREE_CODE (t1
) == COMPLEX_TYPE
13712 || TREE_CODE (t1
) == OFFSET_TYPE
13713 || POINTER_TYPE_P (t1
))
13715 /* Can't be the same type if they have different recision. */
13716 if (TYPE_PRECISION (t1
) != TYPE_PRECISION (t2
))
13719 /* In some cases the signed and unsigned types are required to be
13721 if (TYPE_UNSIGNED (t1
) != TYPE_UNSIGNED (t2
)
13722 && !type_with_interoperable_signedness (t1
))
13725 /* Fortran's C_SIGNED_CHAR is !TYPE_STRING_FLAG but needs to be
13726 interoperable with "signed char". Unless all frontends are revisited
13727 to agree on these types, we must ignore the flag completely. */
13729 /* Fortran standard define C_PTR type that is compatible with every
13730 C pointer. For this reason we need to glob all pointers into one.
13731 Still pointers in different address spaces are not compatible. */
13732 if (POINTER_TYPE_P (t1
))
13734 if (TYPE_ADDR_SPACE (TREE_TYPE (t1
))
13735 != TYPE_ADDR_SPACE (TREE_TYPE (t2
)))
13739 /* Tail-recurse to components. */
13740 if (TREE_CODE (t1
) == VECTOR_TYPE
13741 || TREE_CODE (t1
) == COMPLEX_TYPE
)
13742 return gimple_canonical_types_compatible_p (TREE_TYPE (t1
),
13744 trust_type_canonical
);
13749 /* Do type-specific comparisons. */
13750 switch (TREE_CODE (t1
))
13753 /* Array types are the same if the element types are the same and
13754 the number of elements are the same. */
13755 if (!gimple_canonical_types_compatible_p (TREE_TYPE (t1
), TREE_TYPE (t2
),
13756 trust_type_canonical
)
13757 || TYPE_STRING_FLAG (t1
) != TYPE_STRING_FLAG (t2
)
13758 || TYPE_REVERSE_STORAGE_ORDER (t1
) != TYPE_REVERSE_STORAGE_ORDER (t2
)
13759 || TYPE_NONALIASED_COMPONENT (t1
) != TYPE_NONALIASED_COMPONENT (t2
))
13763 tree i1
= TYPE_DOMAIN (t1
);
13764 tree i2
= TYPE_DOMAIN (t2
);
13766 /* For an incomplete external array, the type domain can be
13767 NULL_TREE. Check this condition also. */
13768 if (i1
== NULL_TREE
&& i2
== NULL_TREE
)
13770 else if (i1
== NULL_TREE
|| i2
== NULL_TREE
)
13774 tree min1
= TYPE_MIN_VALUE (i1
);
13775 tree min2
= TYPE_MIN_VALUE (i2
);
13776 tree max1
= TYPE_MAX_VALUE (i1
);
13777 tree max2
= TYPE_MAX_VALUE (i2
);
13779 /* The minimum/maximum values have to be the same. */
13782 && ((TREE_CODE (min1
) == PLACEHOLDER_EXPR
13783 && TREE_CODE (min2
) == PLACEHOLDER_EXPR
)
13784 || operand_equal_p (min1
, min2
, 0))))
13787 && ((TREE_CODE (max1
) == PLACEHOLDER_EXPR
13788 && TREE_CODE (max2
) == PLACEHOLDER_EXPR
)
13789 || operand_equal_p (max1
, max2
, 0)))))
13797 case FUNCTION_TYPE
:
13798 /* Function types are the same if the return type and arguments types
13800 if (!gimple_canonical_types_compatible_p (TREE_TYPE (t1
), TREE_TYPE (t2
),
13801 trust_type_canonical
))
13804 if (TYPE_ARG_TYPES (t1
) == TYPE_ARG_TYPES (t2
))
13808 tree parms1
, parms2
;
13810 for (parms1
= TYPE_ARG_TYPES (t1
), parms2
= TYPE_ARG_TYPES (t2
);
13812 parms1
= TREE_CHAIN (parms1
), parms2
= TREE_CHAIN (parms2
))
13814 if (!gimple_canonical_types_compatible_p
13815 (TREE_VALUE (parms1
), TREE_VALUE (parms2
),
13816 trust_type_canonical
))
13820 if (parms1
|| parms2
)
13828 case QUAL_UNION_TYPE
:
13832 /* Don't try to compare variants of an incomplete type, before
13833 TYPE_FIELDS has been copied around. */
13834 if (!COMPLETE_TYPE_P (t1
) && !COMPLETE_TYPE_P (t2
))
13838 if (TYPE_REVERSE_STORAGE_ORDER (t1
) != TYPE_REVERSE_STORAGE_ORDER (t2
))
13841 /* For aggregate types, all the fields must be the same. */
13842 for (f1
= TYPE_FIELDS (t1
), f2
= TYPE_FIELDS (t2
);
13844 f1
= TREE_CHAIN (f1
), f2
= TREE_CHAIN (f2
))
13846 /* Skip non-fields and zero-sized fields. */
13847 while (f1
&& (TREE_CODE (f1
) != FIELD_DECL
13849 && integer_zerop (DECL_SIZE (f1
)))))
13850 f1
= TREE_CHAIN (f1
);
13851 while (f2
&& (TREE_CODE (f2
) != FIELD_DECL
13853 && integer_zerop (DECL_SIZE (f2
)))))
13854 f2
= TREE_CHAIN (f2
);
13857 /* The fields must have the same name, offset and type. */
13858 if (DECL_NONADDRESSABLE_P (f1
) != DECL_NONADDRESSABLE_P (f2
)
13859 || !gimple_compare_field_offset (f1
, f2
)
13860 || !gimple_canonical_types_compatible_p
13861 (TREE_TYPE (f1
), TREE_TYPE (f2
),
13862 trust_type_canonical
))
13866 /* If one aggregate has more fields than the other, they
13867 are not the same. */
13875 /* Consider all types with language specific trees in them mutually
13876 compatible. This is executed only from verify_type and false
13877 positives can be tolerated. */
13878 gcc_assert (!in_lto_p
);
13883 /* Verify type T. */
13886 verify_type (const_tree t
)
13888 bool error_found
= false;
13889 tree mv
= TYPE_MAIN_VARIANT (t
);
13892 error ("Main variant is not defined");
13893 error_found
= true;
13895 else if (mv
!= TYPE_MAIN_VARIANT (mv
))
13897 error ("TYPE_MAIN_VARIANT has different TYPE_MAIN_VARIANT");
13899 error_found
= true;
13901 else if (t
!= mv
&& !verify_type_variant (t
, mv
))
13902 error_found
= true;
13904 tree ct
= TYPE_CANONICAL (t
);
13907 else if (TYPE_CANONICAL (t
) != ct
)
13909 error ("TYPE_CANONICAL has different TYPE_CANONICAL");
13911 error_found
= true;
13913 /* Method and function types can not be used to address memory and thus
13914 TYPE_CANONICAL really matters only for determining useless conversions.
13916 FIXME: C++ FE produce declarations of builtin functions that are not
13917 compatible with main variants. */
13918 else if (TREE_CODE (t
) == FUNCTION_TYPE
)
13921 /* FIXME: gimple_canonical_types_compatible_p can not compare types
13922 with variably sized arrays because their sizes possibly
13923 gimplified to different variables. */
13924 && !variably_modified_type_p (ct
, NULL
)
13925 && !gimple_canonical_types_compatible_p (t
, ct
, false))
13927 error ("TYPE_CANONICAL is not compatible");
13929 error_found
= true;
13932 if (COMPLETE_TYPE_P (t
) && TYPE_CANONICAL (t
)
13933 && TYPE_MODE (t
) != TYPE_MODE (TYPE_CANONICAL (t
)))
13935 error ("TYPE_MODE of TYPE_CANONICAL is not compatible");
13937 error_found
= true;
13939 /* FIXME: this is violated by the C++ FE as discussed in PR70029, when
13940 FUNCTION_*_QUALIFIED flags are set. */
13941 if (0 && TYPE_MAIN_VARIANT (t
) == t
&& ct
&& TYPE_MAIN_VARIANT (ct
) != ct
)
13943 error ("TYPE_CANONICAL of main variant is not main variant");
13945 debug_tree (TYPE_MAIN_VARIANT (ct
));
13946 error_found
= true;
13950 /* Check various uses of TYPE_MINVAL. */
13951 if (RECORD_OR_UNION_TYPE_P (t
))
13953 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
13954 and danagle the pointer from time to time. */
13955 if (TYPE_VFIELD (t
)
13956 && TREE_CODE (TYPE_VFIELD (t
)) != FIELD_DECL
13957 && TREE_CODE (TYPE_VFIELD (t
)) != TREE_LIST
)
13959 error ("TYPE_VFIELD is not FIELD_DECL nor TREE_LIST");
13960 debug_tree (TYPE_VFIELD (t
));
13961 error_found
= true;
13964 else if (TREE_CODE (t
) == POINTER_TYPE
)
13966 if (TYPE_NEXT_PTR_TO (t
)
13967 && TREE_CODE (TYPE_NEXT_PTR_TO (t
)) != POINTER_TYPE
)
13969 error ("TYPE_NEXT_PTR_TO is not POINTER_TYPE");
13970 debug_tree (TYPE_NEXT_PTR_TO (t
));
13971 error_found
= true;
13974 else if (TREE_CODE (t
) == REFERENCE_TYPE
)
13976 if (TYPE_NEXT_REF_TO (t
)
13977 && TREE_CODE (TYPE_NEXT_REF_TO (t
)) != REFERENCE_TYPE
)
13979 error ("TYPE_NEXT_REF_TO is not REFERENCE_TYPE");
13980 debug_tree (TYPE_NEXT_REF_TO (t
));
13981 error_found
= true;
13984 else if (INTEGRAL_TYPE_P (t
) || TREE_CODE (t
) == REAL_TYPE
13985 || TREE_CODE (t
) == FIXED_POINT_TYPE
)
13987 /* FIXME: The following check should pass:
13988 useless_type_conversion_p (const_cast <tree> (t),
13989 TREE_TYPE (TYPE_MIN_VALUE (t))
13990 but does not for C sizetypes in LTO. */
13992 /* Java uses TYPE_MINVAL for TYPE_ARGUMENT_SIGNATURE. */
13993 else if (TYPE_MINVAL (t
)
13994 && ((TREE_CODE (t
) != METHOD_TYPE
&& TREE_CODE (t
) != FUNCTION_TYPE
)
13997 error ("TYPE_MINVAL non-NULL");
13998 debug_tree (TYPE_MINVAL (t
));
13999 error_found
= true;
14002 /* Check various uses of TYPE_MAXVAL. */
14003 if (RECORD_OR_UNION_TYPE_P (t
))
14005 if (TYPE_METHODS (t
) && TREE_CODE (TYPE_METHODS (t
)) != FUNCTION_DECL
14006 && TREE_CODE (TYPE_METHODS (t
)) != TEMPLATE_DECL
14007 && TYPE_METHODS (t
) != error_mark_node
)
14009 error ("TYPE_METHODS is not FUNCTION_DECL, TEMPLATE_DECL nor error_mark_node");
14010 debug_tree (TYPE_METHODS (t
));
14011 error_found
= true;
14014 else if (TREE_CODE (t
) == FUNCTION_TYPE
|| TREE_CODE (t
) == METHOD_TYPE
)
14016 if (TYPE_METHOD_BASETYPE (t
)
14017 && TREE_CODE (TYPE_METHOD_BASETYPE (t
)) != RECORD_TYPE
14018 && TREE_CODE (TYPE_METHOD_BASETYPE (t
)) != UNION_TYPE
)
14020 error ("TYPE_METHOD_BASETYPE is not record nor union");
14021 debug_tree (TYPE_METHOD_BASETYPE (t
));
14022 error_found
= true;
14025 else if (TREE_CODE (t
) == OFFSET_TYPE
)
14027 if (TYPE_OFFSET_BASETYPE (t
)
14028 && TREE_CODE (TYPE_OFFSET_BASETYPE (t
)) != RECORD_TYPE
14029 && TREE_CODE (TYPE_OFFSET_BASETYPE (t
)) != UNION_TYPE
)
14031 error ("TYPE_OFFSET_BASETYPE is not record nor union");
14032 debug_tree (TYPE_OFFSET_BASETYPE (t
));
14033 error_found
= true;
14036 else if (INTEGRAL_TYPE_P (t
) || TREE_CODE (t
) == REAL_TYPE
14037 || TREE_CODE (t
) == FIXED_POINT_TYPE
)
14039 /* FIXME: The following check should pass:
14040 useless_type_conversion_p (const_cast <tree> (t),
14041 TREE_TYPE (TYPE_MAX_VALUE (t))
14042 but does not for C sizetypes in LTO. */
14044 else if (TREE_CODE (t
) == ARRAY_TYPE
)
14046 if (TYPE_ARRAY_MAX_SIZE (t
)
14047 && TREE_CODE (TYPE_ARRAY_MAX_SIZE (t
)) != INTEGER_CST
)
14049 error ("TYPE_ARRAY_MAX_SIZE not INTEGER_CST");
14050 debug_tree (TYPE_ARRAY_MAX_SIZE (t
));
14051 error_found
= true;
14054 else if (TYPE_MAXVAL (t
))
14056 error ("TYPE_MAXVAL non-NULL");
14057 debug_tree (TYPE_MAXVAL (t
));
14058 error_found
= true;
14061 /* Check various uses of TYPE_BINFO. */
14062 if (RECORD_OR_UNION_TYPE_P (t
))
14064 if (!TYPE_BINFO (t
))
14066 else if (TREE_CODE (TYPE_BINFO (t
)) != TREE_BINFO
)
14068 error ("TYPE_BINFO is not TREE_BINFO");
14069 debug_tree (TYPE_BINFO (t
));
14070 error_found
= true;
14072 /* FIXME: Java builds invalid empty binfos that do not have
14074 else if (TREE_TYPE (TYPE_BINFO (t
)) != TYPE_MAIN_VARIANT (t
) && 0)
14076 error ("TYPE_BINFO type is not TYPE_MAIN_VARIANT");
14077 debug_tree (TREE_TYPE (TYPE_BINFO (t
)));
14078 error_found
= true;
14081 else if (TYPE_LANG_SLOT_1 (t
) && in_lto_p
)
14083 error ("TYPE_LANG_SLOT_1 (binfo) field is non-NULL");
14084 debug_tree (TYPE_LANG_SLOT_1 (t
));
14085 error_found
= true;
14088 /* Check various uses of TYPE_VALUES_RAW. */
14089 if (TREE_CODE (t
) == ENUMERAL_TYPE
)
14090 for (tree l
= TYPE_VALUES (t
); l
; l
= TREE_CHAIN (l
))
14092 tree value
= TREE_VALUE (l
);
14093 tree name
= TREE_PURPOSE (l
);
14095 /* C FE porduce INTEGER_CST of INTEGER_TYPE, while C++ FE uses
14096 CONST_DECL of ENUMERAL TYPE. */
14097 if (TREE_CODE (value
) != INTEGER_CST
&& TREE_CODE (value
) != CONST_DECL
)
14099 error ("Enum value is not CONST_DECL or INTEGER_CST");
14100 debug_tree (value
);
14102 error_found
= true;
14104 if (TREE_CODE (TREE_TYPE (value
)) != INTEGER_TYPE
14105 && !useless_type_conversion_p (const_cast <tree
> (t
), TREE_TYPE (value
)))
14107 error ("Enum value type is not INTEGER_TYPE nor convertible to the enum");
14108 debug_tree (value
);
14110 error_found
= true;
14112 if (TREE_CODE (name
) != IDENTIFIER_NODE
)
14114 error ("Enum value name is not IDENTIFIER_NODE");
14115 debug_tree (value
);
14117 error_found
= true;
14120 else if (TREE_CODE (t
) == ARRAY_TYPE
)
14122 if (TYPE_DOMAIN (t
) && TREE_CODE (TYPE_DOMAIN (t
)) != INTEGER_TYPE
)
14124 error ("Array TYPE_DOMAIN is not integer type");
14125 debug_tree (TYPE_DOMAIN (t
));
14126 error_found
= true;
14129 else if (RECORD_OR_UNION_TYPE_P (t
))
14131 if (TYPE_FIELDS (t
) && !COMPLETE_TYPE_P (t
) && in_lto_p
)
14133 error ("TYPE_FIELDS defined in incomplete type");
14134 error_found
= true;
14136 for (tree fld
= TYPE_FIELDS (t
); fld
; fld
= TREE_CHAIN (fld
))
14138 /* TODO: verify properties of decls. */
14139 if (TREE_CODE (fld
) == FIELD_DECL
)
14141 else if (TREE_CODE (fld
) == TYPE_DECL
)
14143 else if (TREE_CODE (fld
) == CONST_DECL
)
14145 else if (VAR_P (fld
))
14147 else if (TREE_CODE (fld
) == TEMPLATE_DECL
)
14149 else if (TREE_CODE (fld
) == USING_DECL
)
14153 error ("Wrong tree in TYPE_FIELDS list");
14155 error_found
= true;
14159 else if (TREE_CODE (t
) == INTEGER_TYPE
14160 || TREE_CODE (t
) == BOOLEAN_TYPE
14161 || TREE_CODE (t
) == OFFSET_TYPE
14162 || TREE_CODE (t
) == REFERENCE_TYPE
14163 || TREE_CODE (t
) == NULLPTR_TYPE
14164 || TREE_CODE (t
) == POINTER_TYPE
)
14166 if (TYPE_CACHED_VALUES_P (t
) != (TYPE_CACHED_VALUES (t
) != NULL
))
14168 error ("TYPE_CACHED_VALUES_P is %i while TYPE_CACHED_VALUES is %p",
14169 TYPE_CACHED_VALUES_P (t
), (void *)TYPE_CACHED_VALUES (t
));
14170 error_found
= true;
14172 else if (TYPE_CACHED_VALUES_P (t
) && TREE_CODE (TYPE_CACHED_VALUES (t
)) != TREE_VEC
)
14174 error ("TYPE_CACHED_VALUES is not TREE_VEC");
14175 debug_tree (TYPE_CACHED_VALUES (t
));
14176 error_found
= true;
14178 /* Verify just enough of cache to ensure that no one copied it to new type.
14179 All copying should go by copy_node that should clear it. */
14180 else if (TYPE_CACHED_VALUES_P (t
))
14183 for (i
= 0; i
< TREE_VEC_LENGTH (TYPE_CACHED_VALUES (t
)); i
++)
14184 if (TREE_VEC_ELT (TYPE_CACHED_VALUES (t
), i
)
14185 && TREE_TYPE (TREE_VEC_ELT (TYPE_CACHED_VALUES (t
), i
)) != t
)
14187 error ("wrong TYPE_CACHED_VALUES entry");
14188 debug_tree (TREE_VEC_ELT (TYPE_CACHED_VALUES (t
), i
));
14189 error_found
= true;
14194 else if (TREE_CODE (t
) == FUNCTION_TYPE
|| TREE_CODE (t
) == METHOD_TYPE
)
14195 for (tree l
= TYPE_ARG_TYPES (t
); l
; l
= TREE_CHAIN (l
))
14197 /* C++ FE uses TREE_PURPOSE to store initial values. */
14198 if (TREE_PURPOSE (l
) && in_lto_p
)
14200 error ("TREE_PURPOSE is non-NULL in TYPE_ARG_TYPES list");
14202 error_found
= true;
14204 if (!TYPE_P (TREE_VALUE (l
)))
14206 error ("Wrong entry in TYPE_ARG_TYPES list");
14208 error_found
= true;
14211 else if (!is_lang_specific (t
) && TYPE_VALUES_RAW (t
))
14213 error ("TYPE_VALUES_RAW field is non-NULL");
14214 debug_tree (TYPE_VALUES_RAW (t
));
14215 error_found
= true;
14217 if (TREE_CODE (t
) != INTEGER_TYPE
14218 && TREE_CODE (t
) != BOOLEAN_TYPE
14219 && TREE_CODE (t
) != OFFSET_TYPE
14220 && TREE_CODE (t
) != REFERENCE_TYPE
14221 && TREE_CODE (t
) != NULLPTR_TYPE
14222 && TREE_CODE (t
) != POINTER_TYPE
14223 && TYPE_CACHED_VALUES_P (t
))
14225 error ("TYPE_CACHED_VALUES_P is set while it should not");
14226 error_found
= true;
14228 if (TYPE_STRING_FLAG (t
)
14229 && TREE_CODE (t
) != ARRAY_TYPE
&& TREE_CODE (t
) != INTEGER_TYPE
)
14231 error ("TYPE_STRING_FLAG is set on wrong type code");
14232 error_found
= true;
14234 else if (TYPE_STRING_FLAG (t
))
14237 if (TREE_CODE (b
) == ARRAY_TYPE
)
14239 /* Java builds arrays with TYPE_STRING_FLAG of promoted_char_type
14241 if (TREE_CODE (b
) != INTEGER_TYPE
)
14243 error ("TYPE_STRING_FLAG is set on type that does not look like "
14244 "char nor array of chars");
14245 error_found
= true;
14249 /* ipa-devirt makes an assumption that TYPE_METHOD_BASETYPE is always
14250 TYPE_MAIN_VARIANT and it would be odd to add methods only to variatns
14252 if (TREE_CODE (t
) == METHOD_TYPE
14253 && TYPE_MAIN_VARIANT (TYPE_METHOD_BASETYPE (t
)) != TYPE_METHOD_BASETYPE (t
))
14255 error ("TYPE_METHOD_BASETYPE is not main variant");
14256 error_found
= true;
14261 debug_tree (const_cast <tree
> (t
));
14262 internal_error ("verify_type failed");
14267 /* Return 1 if ARG interpreted as signed in its precision is known to be
14268 always positive or 2 if ARG is known to be always negative, or 3 if
14269 ARG may be positive or negative. */
14272 get_range_pos_neg (tree arg
)
14274 if (arg
== error_mark_node
)
14277 int prec
= TYPE_PRECISION (TREE_TYPE (arg
));
14279 if (TREE_CODE (arg
) == INTEGER_CST
)
14281 wide_int w
= wi::sext (arg
, prec
);
14287 while (CONVERT_EXPR_P (arg
)
14288 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (arg
, 0)))
14289 && TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (arg
, 0))) <= prec
)
14291 arg
= TREE_OPERAND (arg
, 0);
14292 /* Narrower value zero extended into wider type
14293 will always result in positive values. */
14294 if (TYPE_UNSIGNED (TREE_TYPE (arg
))
14295 && TYPE_PRECISION (TREE_TYPE (arg
)) < prec
)
14297 prec
= TYPE_PRECISION (TREE_TYPE (arg
));
14302 if (TREE_CODE (arg
) != SSA_NAME
)
14304 wide_int arg_min
, arg_max
;
14305 while (get_range_info (arg
, &arg_min
, &arg_max
) != VR_RANGE
)
14307 gimple
*g
= SSA_NAME_DEF_STMT (arg
);
14308 if (is_gimple_assign (g
)
14309 && CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (g
)))
14311 tree t
= gimple_assign_rhs1 (g
);
14312 if (INTEGRAL_TYPE_P (TREE_TYPE (t
))
14313 && TYPE_PRECISION (TREE_TYPE (t
)) <= prec
)
14315 if (TYPE_UNSIGNED (TREE_TYPE (t
))
14316 && TYPE_PRECISION (TREE_TYPE (t
)) < prec
)
14318 prec
= TYPE_PRECISION (TREE_TYPE (t
));
14327 if (TYPE_UNSIGNED (TREE_TYPE (arg
)))
14329 /* For unsigned values, the "positive" range comes
14330 below the "negative" range. */
14331 if (!wi::neg_p (wi::sext (arg_max
, prec
), SIGNED
))
14333 if (wi::neg_p (wi::sext (arg_min
, prec
), SIGNED
))
14338 if (!wi::neg_p (wi::sext (arg_min
, prec
), SIGNED
))
14340 if (wi::neg_p (wi::sext (arg_max
, prec
), SIGNED
))
14349 /* Return true if ARG is marked with the nonnull attribute in the
14350 current function signature. */
14353 nonnull_arg_p (const_tree arg
)
14355 tree t
, attrs
, fntype
;
14356 unsigned HOST_WIDE_INT arg_num
;
14358 gcc_assert (TREE_CODE (arg
) == PARM_DECL
14359 && (POINTER_TYPE_P (TREE_TYPE (arg
))
14360 || TREE_CODE (TREE_TYPE (arg
)) == OFFSET_TYPE
));
14362 /* The static chain decl is always non null. */
14363 if (arg
== cfun
->static_chain_decl
)
14366 /* THIS argument of method is always non-NULL. */
14367 if (TREE_CODE (TREE_TYPE (cfun
->decl
)) == METHOD_TYPE
14368 && arg
== DECL_ARGUMENTS (cfun
->decl
)
14369 && flag_delete_null_pointer_checks
)
14372 /* Values passed by reference are always non-NULL. */
14373 if (TREE_CODE (TREE_TYPE (arg
)) == REFERENCE_TYPE
14374 && flag_delete_null_pointer_checks
)
14377 fntype
= TREE_TYPE (cfun
->decl
);
14378 for (attrs
= TYPE_ATTRIBUTES (fntype
); attrs
; attrs
= TREE_CHAIN (attrs
))
14380 attrs
= lookup_attribute ("nonnull", attrs
);
14382 /* If "nonnull" wasn't specified, we know nothing about the argument. */
14383 if (attrs
== NULL_TREE
)
14386 /* If "nonnull" applies to all the arguments, then ARG is non-null. */
14387 if (TREE_VALUE (attrs
) == NULL_TREE
)
14390 /* Get the position number for ARG in the function signature. */
14391 for (arg_num
= 1, t
= DECL_ARGUMENTS (cfun
->decl
);
14393 t
= DECL_CHAIN (t
), arg_num
++)
14399 gcc_assert (t
== arg
);
14401 /* Now see if ARG_NUM is mentioned in the nonnull list. */
14402 for (t
= TREE_VALUE (attrs
); t
; t
= TREE_CHAIN (t
))
14404 if (compare_tree_int (TREE_VALUE (t
), arg_num
) == 0)
14412 /* Combine LOC and BLOCK to a combined adhoc loc, retaining any range
14416 set_block (location_t loc
, tree block
)
14418 location_t pure_loc
= get_pure_location (loc
);
14419 source_range src_range
= get_range_from_loc (line_table
, loc
);
14420 return COMBINE_LOCATION_DATA (line_table
, pure_loc
, src_range
, block
);
14424 set_source_range (tree expr
, location_t start
, location_t finish
)
14426 source_range src_range
;
14427 src_range
.m_start
= start
;
14428 src_range
.m_finish
= finish
;
14429 return set_source_range (expr
, src_range
);
14433 set_source_range (tree expr
, source_range src_range
)
14435 if (!EXPR_P (expr
))
14436 return UNKNOWN_LOCATION
;
14438 location_t pure_loc
= get_pure_location (EXPR_LOCATION (expr
));
14439 location_t adhoc
= COMBINE_LOCATION_DATA (line_table
,
14443 SET_EXPR_LOCATION (expr
, adhoc
);
14447 /* Return the name of combined function FN, for debugging purposes. */
14450 combined_fn_name (combined_fn fn
)
14452 if (builtin_fn_p (fn
))
14454 tree fndecl
= builtin_decl_explicit (as_builtin_fn (fn
));
14455 return IDENTIFIER_POINTER (DECL_NAME (fndecl
));
14458 return internal_fn_name (as_internal_fn (fn
));
14461 /* Return a bitmap with a bit set corresponding to each argument in
14462 a function call type FNTYPE declared with attribute nonnull,
14463 or null if none of the function's argument are nonnull. The caller
14464 must free the bitmap. */
14467 get_nonnull_args (const_tree fntype
)
14469 if (fntype
== NULL_TREE
)
14472 tree attrs
= TYPE_ATTRIBUTES (fntype
);
14476 bitmap argmap
= NULL
;
14478 /* A function declaration can specify multiple attribute nonnull,
14479 each with zero or more arguments. The loop below creates a bitmap
14480 representing a union of all the arguments. An empty (but non-null)
14481 bitmap means that all arguments have been declaraed nonnull. */
14482 for ( ; attrs
; attrs
= TREE_CHAIN (attrs
))
14484 attrs
= lookup_attribute ("nonnull", attrs
);
14489 argmap
= BITMAP_ALLOC (NULL
);
14491 if (!TREE_VALUE (attrs
))
14493 /* Clear the bitmap in case a previous attribute nonnull
14494 set it and this one overrides it for all arguments. */
14495 bitmap_clear (argmap
);
14499 /* Iterate over the indices of the format arguments declared nonnull
14500 and set a bit for each. */
14501 for (tree idx
= TREE_VALUE (attrs
); idx
; idx
= TREE_CHAIN (idx
))
14503 unsigned int val
= TREE_INT_CST_LOW (TREE_VALUE (idx
)) - 1;
14504 bitmap_set_bit (argmap
, val
);
14513 namespace selftest
{
14515 /* Selftests for tree. */
14517 /* Verify that integer constants are sane. */
14520 test_integer_constants ()
14522 ASSERT_TRUE (integer_type_node
!= NULL
);
14523 ASSERT_TRUE (build_int_cst (integer_type_node
, 0) != NULL
);
14525 tree type
= integer_type_node
;
14527 tree zero
= build_zero_cst (type
);
14528 ASSERT_EQ (INTEGER_CST
, TREE_CODE (zero
));
14529 ASSERT_EQ (type
, TREE_TYPE (zero
));
14531 tree one
= build_int_cst (type
, 1);
14532 ASSERT_EQ (INTEGER_CST
, TREE_CODE (one
));
14533 ASSERT_EQ (type
, TREE_TYPE (zero
));
14536 /* Verify identifiers. */
14539 test_identifiers ()
14541 tree identifier
= get_identifier ("foo");
14542 ASSERT_EQ (3, IDENTIFIER_LENGTH (identifier
));
14543 ASSERT_STREQ ("foo", IDENTIFIER_POINTER (identifier
));
14546 /* Verify LABEL_DECL. */
14551 tree identifier
= get_identifier ("err");
14552 tree label_decl
= build_decl (UNKNOWN_LOCATION
, LABEL_DECL
,
14553 identifier
, void_type_node
);
14554 ASSERT_EQ (-1, LABEL_DECL_UID (label_decl
));
14555 ASSERT_FALSE (FORCED_LABEL (label_decl
));
14558 /* Run all of the selftests within this file. */
14563 test_integer_constants ();
14564 test_identifiers ();
14568 } // namespace selftest
14570 #endif /* CHECKING_P */
14572 #include "gt-tree.h"