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(()) unsigned 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 (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 (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 (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 (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 (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 (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 (int len MEM_STAT_DECL
)
2271 size_t 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 (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 size_t oldlength
= (oldlen
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
2294 size_t 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 (tree parm
, tree value MEM_STAT_DECL
)
2873 tree t
= make_node (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 (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 (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 (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
)
3342 /* If the tree evaluates to a constant, then we don't want to hide that
3343 fact (i.e. this allows further folding, and direct checks for constants).
3344 However, a read-only object that has side effects cannot be bypassed.
3345 Since it is no problem to reevaluate literals, we just return the
3347 inner
= skip_simple_arithmetic (expr
);
3348 if (TREE_CODE (inner
) == ERROR_MARK
)
3351 if (tree_invariant_p_1 (inner
))
3354 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
3355 it means that the size or offset of some field of an object depends on
3356 the value within another field.
3358 Note that it must not be the case that EXPR contains both a PLACEHOLDER_EXPR
3359 and some variable since it would then need to be both evaluated once and
3360 evaluated more than once. Front-ends must assure this case cannot
3361 happen by surrounding any such subexpressions in their own SAVE_EXPR
3362 and forcing evaluation at the proper time. */
3363 if (contains_placeholder_p (inner
))
3366 expr
= build1_loc (EXPR_LOCATION (expr
), SAVE_EXPR
, TREE_TYPE (expr
), expr
);
3368 /* This expression might be placed ahead of a jump to ensure that the
3369 value was computed on both sides of the jump. So make sure it isn't
3370 eliminated as dead. */
3371 TREE_SIDE_EFFECTS (expr
) = 1;
3375 /* Look inside EXPR into any simple arithmetic operations. Return the
3376 outermost non-arithmetic or non-invariant node. */
3379 skip_simple_arithmetic (tree expr
)
3381 /* We don't care about whether this can be used as an lvalue in this
3383 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
3384 expr
= TREE_OPERAND (expr
, 0);
3386 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
3387 a constant, it will be more efficient to not make another SAVE_EXPR since
3388 it will allow better simplification and GCSE will be able to merge the
3389 computations if they actually occur. */
3392 if (UNARY_CLASS_P (expr
))
3393 expr
= TREE_OPERAND (expr
, 0);
3394 else if (BINARY_CLASS_P (expr
))
3396 if (tree_invariant_p (TREE_OPERAND (expr
, 1)))
3397 expr
= TREE_OPERAND (expr
, 0);
3398 else if (tree_invariant_p (TREE_OPERAND (expr
, 0)))
3399 expr
= TREE_OPERAND (expr
, 1);
3410 /* Look inside EXPR into simple arithmetic operations involving constants.
3411 Return the outermost non-arithmetic or non-constant node. */
3414 skip_simple_constant_arithmetic (tree expr
)
3416 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
3417 expr
= TREE_OPERAND (expr
, 0);
3421 if (UNARY_CLASS_P (expr
))
3422 expr
= TREE_OPERAND (expr
, 0);
3423 else if (BINARY_CLASS_P (expr
))
3425 if (TREE_CONSTANT (TREE_OPERAND (expr
, 1)))
3426 expr
= TREE_OPERAND (expr
, 0);
3427 else if (TREE_CONSTANT (TREE_OPERAND (expr
, 0)))
3428 expr
= TREE_OPERAND (expr
, 1);
3439 /* Return which tree structure is used by T. */
3441 enum tree_node_structure_enum
3442 tree_node_structure (const_tree t
)
3444 const enum tree_code code
= TREE_CODE (t
);
3445 return tree_node_structure_for_code (code
);
3448 /* Set various status flags when building a CALL_EXPR object T. */
3451 process_call_operands (tree t
)
3453 bool side_effects
= TREE_SIDE_EFFECTS (t
);
3454 bool read_only
= false;
3455 int i
= call_expr_flags (t
);
3457 /* Calls have side-effects, except those to const or pure functions. */
3458 if ((i
& ECF_LOOPING_CONST_OR_PURE
) || !(i
& (ECF_CONST
| ECF_PURE
)))
3459 side_effects
= true;
3460 /* Propagate TREE_READONLY of arguments for const functions. */
3464 if (!side_effects
|| read_only
)
3465 for (i
= 1; i
< TREE_OPERAND_LENGTH (t
); i
++)
3467 tree op
= TREE_OPERAND (t
, i
);
3468 if (op
&& TREE_SIDE_EFFECTS (op
))
3469 side_effects
= true;
3470 if (op
&& !TREE_READONLY (op
) && !CONSTANT_CLASS_P (op
))
3474 TREE_SIDE_EFFECTS (t
) = side_effects
;
3475 TREE_READONLY (t
) = read_only
;
3478 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
3479 size or offset that depends on a field within a record. */
3482 contains_placeholder_p (const_tree exp
)
3484 enum tree_code code
;
3489 code
= TREE_CODE (exp
);
3490 if (code
== PLACEHOLDER_EXPR
)
3493 switch (TREE_CODE_CLASS (code
))
3496 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
3497 position computations since they will be converted into a
3498 WITH_RECORD_EXPR involving the reference, which will assume
3499 here will be valid. */
3500 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
3502 case tcc_exceptional
:
3503 if (code
== TREE_LIST
)
3504 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp
))
3505 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp
)));
3510 case tcc_comparison
:
3511 case tcc_expression
:
3515 /* Ignoring the first operand isn't quite right, but works best. */
3516 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1));
3519 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
3520 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1))
3521 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 2)));
3524 /* The save_expr function never wraps anything containing
3525 a PLACEHOLDER_EXPR. */
3532 switch (TREE_CODE_LENGTH (code
))
3535 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
3537 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
3538 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1)));
3549 const_call_expr_arg_iterator iter
;
3550 FOR_EACH_CONST_CALL_EXPR_ARG (arg
, iter
, exp
)
3551 if (CONTAINS_PLACEHOLDER_P (arg
))
3565 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
3566 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
3570 type_contains_placeholder_1 (const_tree type
)
3572 /* If the size contains a placeholder or the parent type (component type in
3573 the case of arrays) type involves a placeholder, this type does. */
3574 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type
))
3575 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type
))
3576 || (!POINTER_TYPE_P (type
)
3578 && type_contains_placeholder_p (TREE_TYPE (type
))))
3581 /* Now do type-specific checks. Note that the last part of the check above
3582 greatly limits what we have to do below. */
3583 switch (TREE_CODE (type
))
3586 case POINTER_BOUNDS_TYPE
:
3592 case REFERENCE_TYPE
:
3601 case FIXED_POINT_TYPE
:
3602 /* Here we just check the bounds. */
3603 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type
))
3604 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type
)));
3607 /* We have already checked the component type above, so just check
3608 the domain type. Flexible array members have a null domain. */
3609 return TYPE_DOMAIN (type
) ?
3610 type_contains_placeholder_p (TYPE_DOMAIN (type
)) : false;
3614 case QUAL_UNION_TYPE
:
3618 for (field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
3619 if (TREE_CODE (field
) == FIELD_DECL
3620 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field
))
3621 || (TREE_CODE (type
) == QUAL_UNION_TYPE
3622 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field
)))
3623 || type_contains_placeholder_p (TREE_TYPE (field
))))
3634 /* Wrapper around above function used to cache its result. */
3637 type_contains_placeholder_p (tree type
)
3641 /* If the contains_placeholder_bits field has been initialized,
3642 then we know the answer. */
3643 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) > 0)
3644 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) - 1;
3646 /* Indicate that we've seen this type node, and the answer is false.
3647 This is what we want to return if we run into recursion via fields. */
3648 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = 1;
3650 /* Compute the real value. */
3651 result
= type_contains_placeholder_1 (type
);
3653 /* Store the real value. */
3654 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = result
+ 1;
3659 /* Push tree EXP onto vector QUEUE if it is not already present. */
3662 push_without_duplicates (tree exp
, vec
<tree
> *queue
)
3667 FOR_EACH_VEC_ELT (*queue
, i
, iter
)
3668 if (simple_cst_equal (iter
, exp
) == 1)
3672 queue
->safe_push (exp
);
3675 /* Given a tree EXP, find all occurrences of references to fields
3676 in a PLACEHOLDER_EXPR and place them in vector REFS without
3677 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
3678 we assume here that EXP contains only arithmetic expressions
3679 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
3683 find_placeholder_in_expr (tree exp
, vec
<tree
> *refs
)
3685 enum tree_code code
= TREE_CODE (exp
);
3689 /* We handle TREE_LIST and COMPONENT_REF separately. */
3690 if (code
== TREE_LIST
)
3692 FIND_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), refs
);
3693 FIND_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), refs
);
3695 else if (code
== COMPONENT_REF
)
3697 for (inner
= TREE_OPERAND (exp
, 0);
3698 REFERENCE_CLASS_P (inner
);
3699 inner
= TREE_OPERAND (inner
, 0))
3702 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
)
3703 push_without_duplicates (exp
, refs
);
3705 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), refs
);
3708 switch (TREE_CODE_CLASS (code
))
3713 case tcc_declaration
:
3714 /* Variables allocated to static storage can stay. */
3715 if (!TREE_STATIC (exp
))
3716 push_without_duplicates (exp
, refs
);
3719 case tcc_expression
:
3720 /* This is the pattern built in ada/make_aligning_type. */
3721 if (code
== ADDR_EXPR
3722 && TREE_CODE (TREE_OPERAND (exp
, 0)) == PLACEHOLDER_EXPR
)
3724 push_without_duplicates (exp
, refs
);
3730 case tcc_exceptional
:
3733 case tcc_comparison
:
3735 for (i
= 0; i
< TREE_CODE_LENGTH (code
); i
++)
3736 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
3740 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3741 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
3749 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
3750 return a tree with all occurrences of references to F in a
3751 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
3752 CONST_DECLs. Note that we assume here that EXP contains only
3753 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
3754 occurring only in their argument list. */
3757 substitute_in_expr (tree exp
, tree f
, tree r
)
3759 enum tree_code code
= TREE_CODE (exp
);
3760 tree op0
, op1
, op2
, op3
;
3763 /* We handle TREE_LIST and COMPONENT_REF separately. */
3764 if (code
== TREE_LIST
)
3766 op0
= SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp
), f
, r
);
3767 op1
= SUBSTITUTE_IN_EXPR (TREE_VALUE (exp
), f
, r
);
3768 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
3771 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
3773 else if (code
== COMPONENT_REF
)
3777 /* If this expression is getting a value from a PLACEHOLDER_EXPR
3778 and it is the right field, replace it with R. */
3779 for (inner
= TREE_OPERAND (exp
, 0);
3780 REFERENCE_CLASS_P (inner
);
3781 inner
= TREE_OPERAND (inner
, 0))
3785 op1
= TREE_OPERAND (exp
, 1);
3787 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& op1
== f
)
3790 /* If this expression hasn't been completed let, leave it alone. */
3791 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& !TREE_TYPE (inner
))
3794 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3795 if (op0
== TREE_OPERAND (exp
, 0))
3799 = fold_build3 (COMPONENT_REF
, TREE_TYPE (exp
), op0
, op1
, NULL_TREE
);
3802 switch (TREE_CODE_CLASS (code
))
3807 case tcc_declaration
:
3813 case tcc_expression
:
3819 case tcc_exceptional
:
3822 case tcc_comparison
:
3824 switch (TREE_CODE_LENGTH (code
))
3830 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3831 if (op0
== TREE_OPERAND (exp
, 0))
3834 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
3838 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3839 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3841 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
3844 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
3848 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3849 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3850 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
3852 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3853 && op2
== TREE_OPERAND (exp
, 2))
3856 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
3860 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3861 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3862 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
3863 op3
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 3), f
, r
);
3865 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3866 && op2
== TREE_OPERAND (exp
, 2)
3867 && op3
== TREE_OPERAND (exp
, 3))
3871 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
3883 new_tree
= NULL_TREE
;
3885 /* If we are trying to replace F with a constant or with another
3886 instance of one of the arguments of the call, inline back
3887 functions which do nothing else than computing a value from
3888 the arguments they are passed. This makes it possible to
3889 fold partially or entirely the replacement expression. */
3890 if (code
== CALL_EXPR
)
3892 bool maybe_inline
= false;
3893 if (CONSTANT_CLASS_P (r
))
3894 maybe_inline
= true;
3896 for (i
= 3; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3897 if (operand_equal_p (TREE_OPERAND (exp
, i
), r
, 0))
3899 maybe_inline
= true;
3904 tree t
= maybe_inline_call_in_expr (exp
);
3906 return SUBSTITUTE_IN_EXPR (t
, f
, r
);
3910 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3912 tree op
= TREE_OPERAND (exp
, i
);
3913 tree new_op
= SUBSTITUTE_IN_EXPR (op
, f
, r
);
3917 new_tree
= copy_node (exp
);
3918 TREE_OPERAND (new_tree
, i
) = new_op
;
3924 new_tree
= fold (new_tree
);
3925 if (TREE_CODE (new_tree
) == CALL_EXPR
)
3926 process_call_operands (new_tree
);
3937 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
3939 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
3940 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
3945 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
3946 for it within OBJ, a tree that is an object or a chain of references. */
3949 substitute_placeholder_in_expr (tree exp
, tree obj
)
3951 enum tree_code code
= TREE_CODE (exp
);
3952 tree op0
, op1
, op2
, op3
;
3955 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
3956 in the chain of OBJ. */
3957 if (code
== PLACEHOLDER_EXPR
)
3959 tree need_type
= TYPE_MAIN_VARIANT (TREE_TYPE (exp
));
3962 for (elt
= obj
; elt
!= 0;
3963 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
3964 || TREE_CODE (elt
) == COND_EXPR
)
3965 ? TREE_OPERAND (elt
, 1)
3966 : (REFERENCE_CLASS_P (elt
)
3967 || UNARY_CLASS_P (elt
)
3968 || BINARY_CLASS_P (elt
)
3969 || VL_EXP_CLASS_P (elt
)
3970 || EXPRESSION_CLASS_P (elt
))
3971 ? TREE_OPERAND (elt
, 0) : 0))
3972 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt
)) == need_type
)
3975 for (elt
= obj
; elt
!= 0;
3976 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
3977 || TREE_CODE (elt
) == COND_EXPR
)
3978 ? TREE_OPERAND (elt
, 1)
3979 : (REFERENCE_CLASS_P (elt
)
3980 || UNARY_CLASS_P (elt
)
3981 || BINARY_CLASS_P (elt
)
3982 || VL_EXP_CLASS_P (elt
)
3983 || EXPRESSION_CLASS_P (elt
))
3984 ? TREE_OPERAND (elt
, 0) : 0))
3985 if (POINTER_TYPE_P (TREE_TYPE (elt
))
3986 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt
)))
3988 return fold_build1 (INDIRECT_REF
, need_type
, elt
);
3990 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
3991 survives until RTL generation, there will be an error. */
3995 /* TREE_LIST is special because we need to look at TREE_VALUE
3996 and TREE_CHAIN, not TREE_OPERANDS. */
3997 else if (code
== TREE_LIST
)
3999 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), obj
);
4000 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), obj
);
4001 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
4004 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
4007 switch (TREE_CODE_CLASS (code
))
4010 case tcc_declaration
:
4013 case tcc_exceptional
:
4016 case tcc_comparison
:
4017 case tcc_expression
:
4020 switch (TREE_CODE_LENGTH (code
))
4026 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
4027 if (op0
== TREE_OPERAND (exp
, 0))
4030 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
4034 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
4035 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
4037 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
4040 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
4044 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
4045 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
4046 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
4048 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
4049 && op2
== TREE_OPERAND (exp
, 2))
4052 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
4056 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
4057 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
4058 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
4059 op3
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 3), obj
);
4061 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
4062 && op2
== TREE_OPERAND (exp
, 2)
4063 && op3
== TREE_OPERAND (exp
, 3))
4067 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
4079 new_tree
= NULL_TREE
;
4081 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
4083 tree op
= TREE_OPERAND (exp
, i
);
4084 tree new_op
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (op
, obj
);
4088 new_tree
= copy_node (exp
);
4089 TREE_OPERAND (new_tree
, i
) = new_op
;
4095 new_tree
= fold (new_tree
);
4096 if (TREE_CODE (new_tree
) == CALL_EXPR
)
4097 process_call_operands (new_tree
);
4108 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
4110 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
4111 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
4117 /* Subroutine of stabilize_reference; this is called for subtrees of
4118 references. Any expression with side-effects must be put in a SAVE_EXPR
4119 to ensure that it is only evaluated once.
4121 We don't put SAVE_EXPR nodes around everything, because assigning very
4122 simple expressions to temporaries causes us to miss good opportunities
4123 for optimizations. Among other things, the opportunity to fold in the
4124 addition of a constant into an addressing mode often gets lost, e.g.
4125 "y[i+1] += x;". In general, we take the approach that we should not make
4126 an assignment unless we are forced into it - i.e., that any non-side effect
4127 operator should be allowed, and that cse should take care of coalescing
4128 multiple utterances of the same expression should that prove fruitful. */
4131 stabilize_reference_1 (tree e
)
4134 enum tree_code code
= TREE_CODE (e
);
4136 /* We cannot ignore const expressions because it might be a reference
4137 to a const array but whose index contains side-effects. But we can
4138 ignore things that are actual constant or that already have been
4139 handled by this function. */
4141 if (tree_invariant_p (e
))
4144 switch (TREE_CODE_CLASS (code
))
4146 case tcc_exceptional
:
4148 case tcc_declaration
:
4149 case tcc_comparison
:
4151 case tcc_expression
:
4154 /* If the expression has side-effects, then encase it in a SAVE_EXPR
4155 so that it will only be evaluated once. */
4156 /* The reference (r) and comparison (<) classes could be handled as
4157 below, but it is generally faster to only evaluate them once. */
4158 if (TREE_SIDE_EFFECTS (e
))
4159 return save_expr (e
);
4163 /* Constants need no processing. In fact, we should never reach
4168 /* Division is slow and tends to be compiled with jumps,
4169 especially the division by powers of 2 that is often
4170 found inside of an array reference. So do it just once. */
4171 if (code
== TRUNC_DIV_EXPR
|| code
== TRUNC_MOD_EXPR
4172 || code
== FLOOR_DIV_EXPR
|| code
== FLOOR_MOD_EXPR
4173 || code
== CEIL_DIV_EXPR
|| code
== CEIL_MOD_EXPR
4174 || code
== ROUND_DIV_EXPR
|| code
== ROUND_MOD_EXPR
)
4175 return save_expr (e
);
4176 /* Recursively stabilize each operand. */
4177 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)),
4178 stabilize_reference_1 (TREE_OPERAND (e
, 1)));
4182 /* Recursively stabilize each operand. */
4183 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)));
4190 TREE_TYPE (result
) = TREE_TYPE (e
);
4191 TREE_READONLY (result
) = TREE_READONLY (e
);
4192 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (e
);
4193 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (e
);
4198 /* Stabilize a reference so that we can use it any number of times
4199 without causing its operands to be evaluated more than once.
4200 Returns the stabilized reference. This works by means of save_expr,
4201 so see the caveats in the comments about save_expr.
4203 Also allows conversion expressions whose operands are references.
4204 Any other kind of expression is returned unchanged. */
4207 stabilize_reference (tree ref
)
4210 enum tree_code code
= TREE_CODE (ref
);
4217 /* No action is needed in this case. */
4222 case FIX_TRUNC_EXPR
:
4223 result
= build_nt (code
, stabilize_reference (TREE_OPERAND (ref
, 0)));
4227 result
= build_nt (INDIRECT_REF
,
4228 stabilize_reference_1 (TREE_OPERAND (ref
, 0)));
4232 result
= build_nt (COMPONENT_REF
,
4233 stabilize_reference (TREE_OPERAND (ref
, 0)),
4234 TREE_OPERAND (ref
, 1), NULL_TREE
);
4238 result
= build_nt (BIT_FIELD_REF
,
4239 stabilize_reference (TREE_OPERAND (ref
, 0)),
4240 TREE_OPERAND (ref
, 1), TREE_OPERAND (ref
, 2));
4241 REF_REVERSE_STORAGE_ORDER (result
) = REF_REVERSE_STORAGE_ORDER (ref
);
4245 result
= build_nt (ARRAY_REF
,
4246 stabilize_reference (TREE_OPERAND (ref
, 0)),
4247 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
4248 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
4251 case ARRAY_RANGE_REF
:
4252 result
= build_nt (ARRAY_RANGE_REF
,
4253 stabilize_reference (TREE_OPERAND (ref
, 0)),
4254 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
4255 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
4259 /* We cannot wrap the first expression in a SAVE_EXPR, as then
4260 it wouldn't be ignored. This matters when dealing with
4262 return stabilize_reference_1 (ref
);
4264 /* If arg isn't a kind of lvalue we recognize, make no change.
4265 Caller should recognize the error for an invalid lvalue. */
4270 return error_mark_node
;
4273 TREE_TYPE (result
) = TREE_TYPE (ref
);
4274 TREE_READONLY (result
) = TREE_READONLY (ref
);
4275 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (ref
);
4276 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (ref
);
4281 /* Low-level constructors for expressions. */
4283 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
4284 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
4287 recompute_tree_invariant_for_addr_expr (tree t
)
4290 bool tc
= true, se
= false;
4292 gcc_assert (TREE_CODE (t
) == ADDR_EXPR
);
4294 /* We started out assuming this address is both invariant and constant, but
4295 does not have side effects. Now go down any handled components and see if
4296 any of them involve offsets that are either non-constant or non-invariant.
4297 Also check for side-effects.
4299 ??? Note that this code makes no attempt to deal with the case where
4300 taking the address of something causes a copy due to misalignment. */
4302 #define UPDATE_FLAGS(NODE) \
4303 do { tree _node = (NODE); \
4304 if (_node && !TREE_CONSTANT (_node)) tc = false; \
4305 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
4307 for (node
= TREE_OPERAND (t
, 0); handled_component_p (node
);
4308 node
= TREE_OPERAND (node
, 0))
4310 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
4311 array reference (probably made temporarily by the G++ front end),
4312 so ignore all the operands. */
4313 if ((TREE_CODE (node
) == ARRAY_REF
4314 || TREE_CODE (node
) == ARRAY_RANGE_REF
)
4315 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node
, 0))) == ARRAY_TYPE
)
4317 UPDATE_FLAGS (TREE_OPERAND (node
, 1));
4318 if (TREE_OPERAND (node
, 2))
4319 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
4320 if (TREE_OPERAND (node
, 3))
4321 UPDATE_FLAGS (TREE_OPERAND (node
, 3));
4323 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
4324 FIELD_DECL, apparently. The G++ front end can put something else
4325 there, at least temporarily. */
4326 else if (TREE_CODE (node
) == COMPONENT_REF
4327 && TREE_CODE (TREE_OPERAND (node
, 1)) == FIELD_DECL
)
4329 if (TREE_OPERAND (node
, 2))
4330 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
4334 node
= lang_hooks
.expr_to_decl (node
, &tc
, &se
);
4336 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
4337 the address, since &(*a)->b is a form of addition. If it's a constant, the
4338 address is constant too. If it's a decl, its address is constant if the
4339 decl is static. Everything else is not constant and, furthermore,
4340 taking the address of a volatile variable is not volatile. */
4341 if (TREE_CODE (node
) == INDIRECT_REF
4342 || TREE_CODE (node
) == MEM_REF
)
4343 UPDATE_FLAGS (TREE_OPERAND (node
, 0));
4344 else if (CONSTANT_CLASS_P (node
))
4346 else if (DECL_P (node
))
4347 tc
&= (staticp (node
) != NULL_TREE
);
4351 se
|= TREE_SIDE_EFFECTS (node
);
4355 TREE_CONSTANT (t
) = tc
;
4356 TREE_SIDE_EFFECTS (t
) = se
;
4360 /* Build an expression of code CODE, data type TYPE, and operands as
4361 specified. Expressions and reference nodes can be created this way.
4362 Constants, decls, types and misc nodes cannot be.
4364 We define 5 non-variadic functions, from 0 to 4 arguments. This is
4365 enough for all extant tree codes. */
4368 build0 (enum tree_code code
, tree tt MEM_STAT_DECL
)
4372 gcc_assert (TREE_CODE_LENGTH (code
) == 0);
4374 t
= make_node (code PASS_MEM_STAT
);
4381 build1 (enum tree_code code
, tree type
, tree node MEM_STAT_DECL
)
4383 int length
= sizeof (struct tree_exp
);
4386 record_node_allocation_statistics (code
, length
);
4388 gcc_assert (TREE_CODE_LENGTH (code
) == 1);
4390 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
4392 memset (t
, 0, sizeof (struct tree_common
));
4394 TREE_SET_CODE (t
, code
);
4396 TREE_TYPE (t
) = type
;
4397 SET_EXPR_LOCATION (t
, UNKNOWN_LOCATION
);
4398 TREE_OPERAND (t
, 0) = node
;
4399 if (node
&& !TYPE_P (node
))
4401 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (node
);
4402 TREE_READONLY (t
) = TREE_READONLY (node
);
4405 if (TREE_CODE_CLASS (code
) == tcc_statement
)
4406 TREE_SIDE_EFFECTS (t
) = 1;
4410 /* All of these have side-effects, no matter what their
4412 TREE_SIDE_EFFECTS (t
) = 1;
4413 TREE_READONLY (t
) = 0;
4417 /* Whether a dereference is readonly has nothing to do with whether
4418 its operand is readonly. */
4419 TREE_READONLY (t
) = 0;
4424 recompute_tree_invariant_for_addr_expr (t
);
4428 if ((TREE_CODE_CLASS (code
) == tcc_unary
|| code
== VIEW_CONVERT_EXPR
)
4429 && node
&& !TYPE_P (node
)
4430 && TREE_CONSTANT (node
))
4431 TREE_CONSTANT (t
) = 1;
4432 if (TREE_CODE_CLASS (code
) == tcc_reference
4433 && node
&& TREE_THIS_VOLATILE (node
))
4434 TREE_THIS_VOLATILE (t
) = 1;
4441 #define PROCESS_ARG(N) \
4443 TREE_OPERAND (t, N) = arg##N; \
4444 if (arg##N &&!TYPE_P (arg##N)) \
4446 if (TREE_SIDE_EFFECTS (arg##N)) \
4448 if (!TREE_READONLY (arg##N) \
4449 && !CONSTANT_CLASS_P (arg##N)) \
4450 (void) (read_only = 0); \
4451 if (!TREE_CONSTANT (arg##N)) \
4452 (void) (constant = 0); \
4457 build2 (enum tree_code code
, tree tt
, tree arg0
, tree arg1 MEM_STAT_DECL
)
4459 bool constant
, read_only
, side_effects
, div_by_zero
;
4462 gcc_assert (TREE_CODE_LENGTH (code
) == 2);
4464 if ((code
== MINUS_EXPR
|| code
== PLUS_EXPR
|| code
== MULT_EXPR
)
4465 && arg0
&& arg1
&& tt
&& POINTER_TYPE_P (tt
)
4466 /* When sizetype precision doesn't match that of pointers
4467 we need to be able to build explicit extensions or truncations
4468 of the offset argument. */
4469 && TYPE_PRECISION (sizetype
) == TYPE_PRECISION (tt
))
4470 gcc_assert (TREE_CODE (arg0
) == INTEGER_CST
4471 && TREE_CODE (arg1
) == INTEGER_CST
);
4473 if (code
== POINTER_PLUS_EXPR
&& arg0
&& arg1
&& tt
)
4474 gcc_assert (POINTER_TYPE_P (tt
) && POINTER_TYPE_P (TREE_TYPE (arg0
))
4475 && ptrofftype_p (TREE_TYPE (arg1
)));
4477 t
= make_node (code PASS_MEM_STAT
);
4480 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
4481 result based on those same flags for the arguments. But if the
4482 arguments aren't really even `tree' expressions, we shouldn't be trying
4485 /* Expressions without side effects may be constant if their
4486 arguments are as well. */
4487 constant
= (TREE_CODE_CLASS (code
) == tcc_comparison
4488 || TREE_CODE_CLASS (code
) == tcc_binary
);
4490 side_effects
= TREE_SIDE_EFFECTS (t
);
4494 case TRUNC_DIV_EXPR
:
4496 case FLOOR_DIV_EXPR
:
4497 case ROUND_DIV_EXPR
:
4498 case EXACT_DIV_EXPR
:
4500 case FLOOR_MOD_EXPR
:
4501 case ROUND_MOD_EXPR
:
4502 case TRUNC_MOD_EXPR
:
4503 div_by_zero
= integer_zerop (arg1
);
4506 div_by_zero
= false;
4512 TREE_SIDE_EFFECTS (t
) = side_effects
;
4513 if (code
== MEM_REF
)
4515 if (arg0
&& TREE_CODE (arg0
) == ADDR_EXPR
)
4517 tree o
= TREE_OPERAND (arg0
, 0);
4518 TREE_READONLY (t
) = TREE_READONLY (o
);
4519 TREE_THIS_VOLATILE (t
) = TREE_THIS_VOLATILE (o
);
4524 TREE_READONLY (t
) = read_only
;
4525 /* Don't mark X / 0 as constant. */
4526 TREE_CONSTANT (t
) = constant
&& !div_by_zero
;
4527 TREE_THIS_VOLATILE (t
)
4528 = (TREE_CODE_CLASS (code
) == tcc_reference
4529 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4537 build3 (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4538 tree arg2 MEM_STAT_DECL
)
4540 bool constant
, read_only
, side_effects
;
4543 gcc_assert (TREE_CODE_LENGTH (code
) == 3);
4544 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
4546 t
= make_node (code PASS_MEM_STAT
);
4551 /* As a special exception, if COND_EXPR has NULL branches, we
4552 assume that it is a gimple statement and always consider
4553 it to have side effects. */
4554 if (code
== COND_EXPR
4555 && tt
== void_type_node
4556 && arg1
== NULL_TREE
4557 && arg2
== NULL_TREE
)
4558 side_effects
= true;
4560 side_effects
= TREE_SIDE_EFFECTS (t
);
4566 if (code
== COND_EXPR
)
4567 TREE_READONLY (t
) = read_only
;
4569 TREE_SIDE_EFFECTS (t
) = side_effects
;
4570 TREE_THIS_VOLATILE (t
)
4571 = (TREE_CODE_CLASS (code
) == tcc_reference
4572 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4578 build4 (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4579 tree arg2
, tree arg3 MEM_STAT_DECL
)
4581 bool constant
, read_only
, side_effects
;
4584 gcc_assert (TREE_CODE_LENGTH (code
) == 4);
4586 t
= make_node (code PASS_MEM_STAT
);
4589 side_effects
= TREE_SIDE_EFFECTS (t
);
4596 TREE_SIDE_EFFECTS (t
) = side_effects
;
4597 TREE_THIS_VOLATILE (t
)
4598 = (TREE_CODE_CLASS (code
) == tcc_reference
4599 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4605 build5 (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4606 tree arg2
, tree arg3
, tree arg4 MEM_STAT_DECL
)
4608 bool constant
, read_only
, side_effects
;
4611 gcc_assert (TREE_CODE_LENGTH (code
) == 5);
4613 t
= make_node (code PASS_MEM_STAT
);
4616 side_effects
= TREE_SIDE_EFFECTS (t
);
4624 TREE_SIDE_EFFECTS (t
) = side_effects
;
4625 if (code
== TARGET_MEM_REF
)
4627 if (arg0
&& TREE_CODE (arg0
) == ADDR_EXPR
)
4629 tree o
= TREE_OPERAND (arg0
, 0);
4630 TREE_READONLY (t
) = TREE_READONLY (o
);
4631 TREE_THIS_VOLATILE (t
) = TREE_THIS_VOLATILE (o
);
4635 TREE_THIS_VOLATILE (t
)
4636 = (TREE_CODE_CLASS (code
) == tcc_reference
4637 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4642 /* Build a simple MEM_REF tree with the sematics of a plain INDIRECT_REF
4643 on the pointer PTR. */
4646 build_simple_mem_ref_loc (location_t loc
, tree ptr
)
4648 HOST_WIDE_INT offset
= 0;
4649 tree ptype
= TREE_TYPE (ptr
);
4651 /* For convenience allow addresses that collapse to a simple base
4653 if (TREE_CODE (ptr
) == ADDR_EXPR
4654 && (handled_component_p (TREE_OPERAND (ptr
, 0))
4655 || TREE_CODE (TREE_OPERAND (ptr
, 0)) == MEM_REF
))
4657 ptr
= get_addr_base_and_unit_offset (TREE_OPERAND (ptr
, 0), &offset
);
4659 ptr
= build_fold_addr_expr (ptr
);
4660 gcc_assert (is_gimple_reg (ptr
) || is_gimple_min_invariant (ptr
));
4662 tem
= build2 (MEM_REF
, TREE_TYPE (ptype
),
4663 ptr
, build_int_cst (ptype
, offset
));
4664 SET_EXPR_LOCATION (tem
, loc
);
4668 /* Return the constant offset of a MEM_REF or TARGET_MEM_REF tree T. */
4671 mem_ref_offset (const_tree t
)
4673 return offset_int::from (TREE_OPERAND (t
, 1), SIGNED
);
4676 /* Return an invariant ADDR_EXPR of type TYPE taking the address of BASE
4677 offsetted by OFFSET units. */
4680 build_invariant_address (tree type
, tree base
, HOST_WIDE_INT offset
)
4682 tree ref
= fold_build2 (MEM_REF
, TREE_TYPE (type
),
4683 build_fold_addr_expr (base
),
4684 build_int_cst (ptr_type_node
, offset
));
4685 tree addr
= build1 (ADDR_EXPR
, type
, ref
);
4686 recompute_tree_invariant_for_addr_expr (addr
);
4690 /* Similar except don't specify the TREE_TYPE
4691 and leave the TREE_SIDE_EFFECTS as 0.
4692 It is permissible for arguments to be null,
4693 or even garbage if their values do not matter. */
4696 build_nt (enum tree_code code
, ...)
4703 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
4707 t
= make_node (code
);
4708 length
= TREE_CODE_LENGTH (code
);
4710 for (i
= 0; i
< length
; i
++)
4711 TREE_OPERAND (t
, i
) = va_arg (p
, tree
);
4717 /* Similar to build_nt, but for creating a CALL_EXPR object with a
4721 build_nt_call_vec (tree fn
, vec
<tree
, va_gc
> *args
)
4726 ret
= build_vl_exp (CALL_EXPR
, vec_safe_length (args
) + 3);
4727 CALL_EXPR_FN (ret
) = fn
;
4728 CALL_EXPR_STATIC_CHAIN (ret
) = NULL_TREE
;
4729 FOR_EACH_VEC_SAFE_ELT (args
, ix
, t
)
4730 CALL_EXPR_ARG (ret
, ix
) = t
;
4734 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
4735 We do NOT enter this node in any sort of symbol table.
4737 LOC is the location of the decl.
4739 layout_decl is used to set up the decl's storage layout.
4740 Other slots are initialized to 0 or null pointers. */
4743 build_decl (location_t loc
, enum tree_code code
, tree name
,
4744 tree type MEM_STAT_DECL
)
4748 t
= make_node (code PASS_MEM_STAT
);
4749 DECL_SOURCE_LOCATION (t
) = loc
;
4751 /* if (type == error_mark_node)
4752 type = integer_type_node; */
4753 /* That is not done, deliberately, so that having error_mark_node
4754 as the type can suppress useless errors in the use of this variable. */
4756 DECL_NAME (t
) = name
;
4757 TREE_TYPE (t
) = type
;
4759 if (code
== VAR_DECL
|| code
== PARM_DECL
|| code
== RESULT_DECL
)
4765 /* Builds and returns function declaration with NAME and TYPE. */
4768 build_fn_decl (const char *name
, tree type
)
4770 tree id
= get_identifier (name
);
4771 tree decl
= build_decl (input_location
, FUNCTION_DECL
, id
, type
);
4773 DECL_EXTERNAL (decl
) = 1;
4774 TREE_PUBLIC (decl
) = 1;
4775 DECL_ARTIFICIAL (decl
) = 1;
4776 TREE_NOTHROW (decl
) = 1;
4781 vec
<tree
, va_gc
> *all_translation_units
;
4783 /* Builds a new translation-unit decl with name NAME, queues it in the
4784 global list of translation-unit decls and returns it. */
4787 build_translation_unit_decl (tree name
)
4789 tree tu
= build_decl (UNKNOWN_LOCATION
, TRANSLATION_UNIT_DECL
,
4791 TRANSLATION_UNIT_LANGUAGE (tu
) = lang_hooks
.name
;
4792 vec_safe_push (all_translation_units
, tu
);
4797 /* BLOCK nodes are used to represent the structure of binding contours
4798 and declarations, once those contours have been exited and their contents
4799 compiled. This information is used for outputting debugging info. */
4802 build_block (tree vars
, tree subblocks
, tree supercontext
, tree chain
)
4804 tree block
= make_node (BLOCK
);
4806 BLOCK_VARS (block
) = vars
;
4807 BLOCK_SUBBLOCKS (block
) = subblocks
;
4808 BLOCK_SUPERCONTEXT (block
) = supercontext
;
4809 BLOCK_CHAIN (block
) = chain
;
4814 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
4816 LOC is the location to use in tree T. */
4819 protected_set_expr_location (tree t
, location_t loc
)
4821 if (CAN_HAVE_LOCATION_P (t
))
4822 SET_EXPR_LOCATION (t
, loc
);
4825 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
4829 build_decl_attribute_variant (tree ddecl
, tree attribute
)
4831 DECL_ATTRIBUTES (ddecl
) = attribute
;
4835 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4836 is ATTRIBUTE and its qualifiers are QUALS.
4838 Record such modified types already made so we don't make duplicates. */
4841 build_type_attribute_qual_variant (tree ttype
, tree attribute
, int quals
)
4843 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype
), attribute
))
4847 /* Building a distinct copy of a tagged type is inappropriate; it
4848 causes breakage in code that expects there to be a one-to-one
4849 relationship between a struct and its fields.
4850 build_duplicate_type is another solution (as used in
4851 handle_transparent_union_attribute), but that doesn't play well
4852 with the stronger C++ type identity model. */
4853 if (TREE_CODE (ttype
) == RECORD_TYPE
4854 || TREE_CODE (ttype
) == UNION_TYPE
4855 || TREE_CODE (ttype
) == QUAL_UNION_TYPE
4856 || TREE_CODE (ttype
) == ENUMERAL_TYPE
)
4858 warning (OPT_Wattributes
,
4859 "ignoring attributes applied to %qT after definition",
4860 TYPE_MAIN_VARIANT (ttype
));
4861 return build_qualified_type (ttype
, quals
);
4864 ttype
= build_qualified_type (ttype
, TYPE_UNQUALIFIED
);
4865 ntype
= build_distinct_type_copy (ttype
);
4867 TYPE_ATTRIBUTES (ntype
) = attribute
;
4869 hashval_t hash
= type_hash_canon_hash (ntype
);
4870 ntype
= type_hash_canon (hash
, ntype
);
4872 /* If the target-dependent attributes make NTYPE different from
4873 its canonical type, we will need to use structural equality
4874 checks for this type. */
4875 if (TYPE_STRUCTURAL_EQUALITY_P (ttype
)
4876 || !comp_type_attributes (ntype
, ttype
))
4877 SET_TYPE_STRUCTURAL_EQUALITY (ntype
);
4878 else if (TYPE_CANONICAL (ntype
) == ntype
)
4879 TYPE_CANONICAL (ntype
) = TYPE_CANONICAL (ttype
);
4881 ttype
= build_qualified_type (ntype
, quals
);
4883 else if (TYPE_QUALS (ttype
) != quals
)
4884 ttype
= build_qualified_type (ttype
, quals
);
4889 /* Check if "omp declare simd" attribute arguments, CLAUSES1 and CLAUSES2, are
4893 omp_declare_simd_clauses_equal (tree clauses1
, tree clauses2
)
4896 for (cl1
= clauses1
, cl2
= clauses2
;
4898 cl1
= OMP_CLAUSE_CHAIN (cl1
), cl2
= OMP_CLAUSE_CHAIN (cl2
))
4900 if (OMP_CLAUSE_CODE (cl1
) != OMP_CLAUSE_CODE (cl2
))
4902 if (OMP_CLAUSE_CODE (cl1
) != OMP_CLAUSE_SIMDLEN
)
4904 if (simple_cst_equal (OMP_CLAUSE_DECL (cl1
),
4905 OMP_CLAUSE_DECL (cl2
)) != 1)
4908 switch (OMP_CLAUSE_CODE (cl1
))
4910 case OMP_CLAUSE_ALIGNED
:
4911 if (simple_cst_equal (OMP_CLAUSE_ALIGNED_ALIGNMENT (cl1
),
4912 OMP_CLAUSE_ALIGNED_ALIGNMENT (cl2
)) != 1)
4915 case OMP_CLAUSE_LINEAR
:
4916 if (simple_cst_equal (OMP_CLAUSE_LINEAR_STEP (cl1
),
4917 OMP_CLAUSE_LINEAR_STEP (cl2
)) != 1)
4920 case OMP_CLAUSE_SIMDLEN
:
4921 if (simple_cst_equal (OMP_CLAUSE_SIMDLEN_EXPR (cl1
),
4922 OMP_CLAUSE_SIMDLEN_EXPR (cl2
)) != 1)
4931 /* Compare two constructor-element-type constants. Return 1 if the lists
4932 are known to be equal; otherwise return 0. */
4935 simple_cst_list_equal (const_tree l1
, const_tree l2
)
4937 while (l1
!= NULL_TREE
&& l2
!= NULL_TREE
)
4939 if (simple_cst_equal (TREE_VALUE (l1
), TREE_VALUE (l2
)) != 1)
4942 l1
= TREE_CHAIN (l1
);
4943 l2
= TREE_CHAIN (l2
);
4949 /* Compare two identifier nodes representing attributes. Either one may
4950 be in wrapped __ATTR__ form. Return true if they are the same, false
4954 cmp_attrib_identifiers (const_tree attr1
, const_tree attr2
)
4956 /* Make sure we're dealing with IDENTIFIER_NODEs. */
4957 gcc_checking_assert (TREE_CODE (attr1
) == IDENTIFIER_NODE
4958 && TREE_CODE (attr2
) == IDENTIFIER_NODE
);
4960 /* Identifiers can be compared directly for equality. */
4964 /* If they are not equal, they may still be one in the form
4965 'text' while the other one is in the form '__text__'. TODO:
4966 If we were storing attributes in normalized 'text' form, then
4967 this could all go away and we could take full advantage of
4968 the fact that we're comparing identifiers. :-) */
4969 const size_t attr1_len
= IDENTIFIER_LENGTH (attr1
);
4970 const size_t attr2_len
= IDENTIFIER_LENGTH (attr2
);
4972 if (attr2_len
== attr1_len
+ 4)
4974 const char *p
= IDENTIFIER_POINTER (attr2
);
4975 const char *q
= IDENTIFIER_POINTER (attr1
);
4976 if (p
[0] == '_' && p
[1] == '_'
4977 && p
[attr2_len
- 2] == '_' && p
[attr2_len
- 1] == '_'
4978 && strncmp (q
, p
+ 2, attr1_len
) == 0)
4981 else if (attr2_len
+ 4 == attr1_len
)
4983 const char *p
= IDENTIFIER_POINTER (attr2
);
4984 const char *q
= IDENTIFIER_POINTER (attr1
);
4985 if (q
[0] == '_' && q
[1] == '_'
4986 && q
[attr1_len
- 2] == '_' && q
[attr1_len
- 1] == '_'
4987 && strncmp (q
+ 2, p
, attr2_len
) == 0)
4994 /* Compare two attributes for their value identity. Return true if the
4995 attribute values are known to be equal; otherwise return false. */
4998 attribute_value_equal (const_tree attr1
, const_tree attr2
)
5000 if (TREE_VALUE (attr1
) == TREE_VALUE (attr2
))
5003 if (TREE_VALUE (attr1
) != NULL_TREE
5004 && TREE_CODE (TREE_VALUE (attr1
)) == TREE_LIST
5005 && TREE_VALUE (attr2
) != NULL_TREE
5006 && TREE_CODE (TREE_VALUE (attr2
)) == TREE_LIST
)
5008 /* Handle attribute format. */
5009 if (is_attribute_p ("format", get_attribute_name (attr1
)))
5011 attr1
= TREE_VALUE (attr1
);
5012 attr2
= TREE_VALUE (attr2
);
5013 /* Compare the archetypes (printf/scanf/strftime/...). */
5014 if (!cmp_attrib_identifiers (TREE_VALUE (attr1
),
5015 TREE_VALUE (attr2
)))
5017 /* Archetypes are the same. Compare the rest. */
5018 return (simple_cst_list_equal (TREE_CHAIN (attr1
),
5019 TREE_CHAIN (attr2
)) == 1);
5021 return (simple_cst_list_equal (TREE_VALUE (attr1
),
5022 TREE_VALUE (attr2
)) == 1);
5025 if ((flag_openmp
|| flag_openmp_simd
)
5026 && TREE_VALUE (attr1
) && TREE_VALUE (attr2
)
5027 && TREE_CODE (TREE_VALUE (attr1
)) == OMP_CLAUSE
5028 && TREE_CODE (TREE_VALUE (attr2
)) == OMP_CLAUSE
)
5029 return omp_declare_simd_clauses_equal (TREE_VALUE (attr1
),
5030 TREE_VALUE (attr2
));
5032 return (simple_cst_equal (TREE_VALUE (attr1
), TREE_VALUE (attr2
)) == 1);
5035 /* Return 0 if the attributes for two types are incompatible, 1 if they
5036 are compatible, and 2 if they are nearly compatible (which causes a
5037 warning to be generated). */
5039 comp_type_attributes (const_tree type1
, const_tree type2
)
5041 const_tree a1
= TYPE_ATTRIBUTES (type1
);
5042 const_tree a2
= TYPE_ATTRIBUTES (type2
);
5047 for (a
= a1
; a
!= NULL_TREE
; a
= TREE_CHAIN (a
))
5049 const struct attribute_spec
*as
;
5052 as
= lookup_attribute_spec (get_attribute_name (a
));
5053 if (!as
|| as
->affects_type_identity
== false)
5056 attr
= lookup_attribute (as
->name
, CONST_CAST_TREE (a2
));
5057 if (!attr
|| !attribute_value_equal (a
, attr
))
5062 for (a
= a2
; a
!= NULL_TREE
; a
= TREE_CHAIN (a
))
5064 const struct attribute_spec
*as
;
5066 as
= lookup_attribute_spec (get_attribute_name (a
));
5067 if (!as
|| as
->affects_type_identity
== false)
5070 if (!lookup_attribute (as
->name
, CONST_CAST_TREE (a1
)))
5072 /* We don't need to compare trees again, as we did this
5073 already in first loop. */
5075 /* All types - affecting identity - are equal, so
5076 there is no need to call target hook for comparison. */
5080 if (lookup_attribute ("transaction_safe", CONST_CAST_TREE (a
)))
5082 /* As some type combinations - like default calling-convention - might
5083 be compatible, we have to call the target hook to get the final result. */
5084 return targetm
.comp_type_attributes (type1
, type2
);
5087 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
5090 Record such modified types already made so we don't make duplicates. */
5093 build_type_attribute_variant (tree ttype
, tree attribute
)
5095 return build_type_attribute_qual_variant (ttype
, attribute
,
5096 TYPE_QUALS (ttype
));
5100 /* Reset the expression *EXPR_P, a size or position.
5102 ??? We could reset all non-constant sizes or positions. But it's cheap
5103 enough to not do so and refrain from adding workarounds to dwarf2out.c.
5105 We need to reset self-referential sizes or positions because they cannot
5106 be gimplified and thus can contain a CALL_EXPR after the gimplification
5107 is finished, which will run afoul of LTO streaming. And they need to be
5108 reset to something essentially dummy but not constant, so as to preserve
5109 the properties of the object they are attached to. */
5112 free_lang_data_in_one_sizepos (tree
*expr_p
)
5114 tree expr
= *expr_p
;
5115 if (CONTAINS_PLACEHOLDER_P (expr
))
5116 *expr_p
= build0 (PLACEHOLDER_EXPR
, TREE_TYPE (expr
));
5120 /* Reset all the fields in a binfo node BINFO. We only keep
5121 BINFO_VTABLE, which is used by gimple_fold_obj_type_ref. */
5124 free_lang_data_in_binfo (tree binfo
)
5129 gcc_assert (TREE_CODE (binfo
) == TREE_BINFO
);
5131 BINFO_VIRTUALS (binfo
) = NULL_TREE
;
5132 BINFO_BASE_ACCESSES (binfo
) = NULL
;
5133 BINFO_INHERITANCE_CHAIN (binfo
) = NULL_TREE
;
5134 BINFO_SUBVTT_INDEX (binfo
) = NULL_TREE
;
5136 FOR_EACH_VEC_ELT (*BINFO_BASE_BINFOS (binfo
), i
, t
)
5137 free_lang_data_in_binfo (t
);
5141 /* Reset all language specific information still present in TYPE. */
5144 free_lang_data_in_type (tree type
)
5146 gcc_assert (TYPE_P (type
));
5148 /* Give the FE a chance to remove its own data first. */
5149 lang_hooks
.free_lang_data (type
);
5151 TREE_LANG_FLAG_0 (type
) = 0;
5152 TREE_LANG_FLAG_1 (type
) = 0;
5153 TREE_LANG_FLAG_2 (type
) = 0;
5154 TREE_LANG_FLAG_3 (type
) = 0;
5155 TREE_LANG_FLAG_4 (type
) = 0;
5156 TREE_LANG_FLAG_5 (type
) = 0;
5157 TREE_LANG_FLAG_6 (type
) = 0;
5159 if (TREE_CODE (type
) == FUNCTION_TYPE
)
5161 /* Remove the const and volatile qualifiers from arguments. The
5162 C++ front end removes them, but the C front end does not,
5163 leading to false ODR violation errors when merging two
5164 instances of the same function signature compiled by
5165 different front ends. */
5168 for (p
= TYPE_ARG_TYPES (type
); p
; p
= TREE_CHAIN (p
))
5170 tree arg_type
= TREE_VALUE (p
);
5172 if (TYPE_READONLY (arg_type
) || TYPE_VOLATILE (arg_type
))
5174 int quals
= TYPE_QUALS (arg_type
)
5176 & ~TYPE_QUAL_VOLATILE
;
5177 TREE_VALUE (p
) = build_qualified_type (arg_type
, quals
);
5178 free_lang_data_in_type (TREE_VALUE (p
));
5180 /* C++ FE uses TREE_PURPOSE to store initial values. */
5181 TREE_PURPOSE (p
) = NULL
;
5184 if (TREE_CODE (type
) == METHOD_TYPE
)
5188 for (p
= TYPE_ARG_TYPES (type
); p
; p
= TREE_CHAIN (p
))
5190 /* C++ FE uses TREE_PURPOSE to store initial values. */
5191 TREE_PURPOSE (p
) = NULL
;
5195 /* Remove members that are not actually FIELD_DECLs from the field
5196 list of an aggregate. These occur in C++. */
5197 if (RECORD_OR_UNION_TYPE_P (type
))
5201 /* Note that TYPE_FIELDS can be shared across distinct
5202 TREE_TYPEs. Therefore, if the first field of TYPE_FIELDS is
5203 to be removed, we cannot set its TREE_CHAIN to NULL.
5204 Otherwise, we would not be able to find all the other fields
5205 in the other instances of this TREE_TYPE.
5207 This was causing an ICE in testsuite/g++.dg/lto/20080915.C. */
5209 member
= TYPE_FIELDS (type
);
5212 if (TREE_CODE (member
) == FIELD_DECL
5213 || (TREE_CODE (member
) == TYPE_DECL
5214 && !DECL_IGNORED_P (member
)
5215 && debug_info_level
> DINFO_LEVEL_TERSE
5216 && !is_redundant_typedef (member
)))
5219 TREE_CHAIN (prev
) = member
;
5221 TYPE_FIELDS (type
) = member
;
5225 member
= TREE_CHAIN (member
);
5229 TREE_CHAIN (prev
) = NULL_TREE
;
5231 TYPE_FIELDS (type
) = NULL_TREE
;
5233 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
5234 and danagle the pointer from time to time. */
5235 if (TYPE_VFIELD (type
) && TREE_CODE (TYPE_VFIELD (type
)) != FIELD_DECL
)
5236 TYPE_VFIELD (type
) = NULL_TREE
;
5238 /* Splice out FUNCTION_DECLS and TEMPLATE_DECLS from
5239 TYPE_FIELDS. So LTO doesn't grow. */
5240 for (tree probe
, *prev
= &TYPE_FIELDS (type
); (probe
= *prev
); )
5241 if (TREE_CODE (probe
) == FUNCTION_DECL
5242 || TREE_CODE (probe
) == TEMPLATE_DECL
)
5245 prev
= &DECL_CHAIN (probe
);
5247 if (TYPE_BINFO (type
))
5249 free_lang_data_in_binfo (TYPE_BINFO (type
));
5250 /* We need to preserve link to bases and virtual table for all
5251 polymorphic types to make devirtualization machinery working.
5252 Debug output cares only about bases, but output also
5253 virtual table pointers so merging of -fdevirtualize and
5254 -fno-devirtualize units is easier. */
5255 if ((!BINFO_VTABLE (TYPE_BINFO (type
))
5256 || !flag_devirtualize
)
5257 && ((!BINFO_N_BASE_BINFOS (TYPE_BINFO (type
))
5258 && !BINFO_VTABLE (TYPE_BINFO (type
)))
5259 || debug_info_level
!= DINFO_LEVEL_NONE
))
5260 TYPE_BINFO (type
) = NULL
;
5265 /* For non-aggregate types, clear out the language slot (which
5266 overloads TYPE_BINFO). */
5267 TYPE_LANG_SLOT_1 (type
) = NULL_TREE
;
5269 if (INTEGRAL_TYPE_P (type
)
5270 || SCALAR_FLOAT_TYPE_P (type
)
5271 || FIXED_POINT_TYPE_P (type
))
5273 free_lang_data_in_one_sizepos (&TYPE_MIN_VALUE (type
));
5274 free_lang_data_in_one_sizepos (&TYPE_MAX_VALUE (type
));
5278 free_lang_data_in_one_sizepos (&TYPE_SIZE (type
));
5279 free_lang_data_in_one_sizepos (&TYPE_SIZE_UNIT (type
));
5281 if (TYPE_CONTEXT (type
)
5282 && TREE_CODE (TYPE_CONTEXT (type
)) == BLOCK
)
5284 tree ctx
= TYPE_CONTEXT (type
);
5287 ctx
= BLOCK_SUPERCONTEXT (ctx
);
5289 while (ctx
&& TREE_CODE (ctx
) == BLOCK
);
5290 TYPE_CONTEXT (type
) = ctx
;
5295 /* Return true if DECL may need an assembler name to be set. */
5298 need_assembler_name_p (tree decl
)
5300 /* We use DECL_ASSEMBLER_NAME to hold mangled type names for One Definition
5301 Rule merging. This makes type_odr_p to return true on those types during
5302 LTO and by comparing the mangled name, we can say what types are intended
5303 to be equivalent across compilation unit.
5305 We do not store names of type_in_anonymous_namespace_p.
5307 Record, union and enumeration type have linkage that allows use
5308 to check type_in_anonymous_namespace_p. We do not mangle compound types
5309 that always can be compared structurally.
5311 Similarly for builtin types, we compare properties of their main variant.
5312 A special case are integer types where mangling do make differences
5313 between char/signed char/unsigned char etc. Storing name for these makes
5314 e.g. -fno-signed-char/-fsigned-char mismatches to be handled well.
5315 See cp/mangle.c:write_builtin_type for details. */
5317 if (flag_lto_odr_type_mering
5318 && TREE_CODE (decl
) == TYPE_DECL
5320 && decl
== TYPE_NAME (TREE_TYPE (decl
))
5321 && TYPE_MAIN_VARIANT (TREE_TYPE (decl
)) == TREE_TYPE (decl
)
5322 && !TYPE_ARTIFICIAL (TREE_TYPE (decl
))
5323 && (type_with_linkage_p (TREE_TYPE (decl
))
5324 || TREE_CODE (TREE_TYPE (decl
)) == INTEGER_TYPE
)
5325 && !variably_modified_type_p (TREE_TYPE (decl
), NULL_TREE
))
5326 return !DECL_ASSEMBLER_NAME_SET_P (decl
);
5327 /* Only FUNCTION_DECLs and VAR_DECLs are considered. */
5328 if (!VAR_OR_FUNCTION_DECL_P (decl
))
5331 /* If DECL already has its assembler name set, it does not need a
5333 if (!HAS_DECL_ASSEMBLER_NAME_P (decl
)
5334 || DECL_ASSEMBLER_NAME_SET_P (decl
))
5337 /* Abstract decls do not need an assembler name. */
5338 if (DECL_ABSTRACT_P (decl
))
5341 /* For VAR_DECLs, only static, public and external symbols need an
5344 && !TREE_STATIC (decl
)
5345 && !TREE_PUBLIC (decl
)
5346 && !DECL_EXTERNAL (decl
))
5349 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5351 /* Do not set assembler name on builtins. Allow RTL expansion to
5352 decide whether to expand inline or via a regular call. */
5353 if (DECL_BUILT_IN (decl
)
5354 && DECL_BUILT_IN_CLASS (decl
) != BUILT_IN_FRONTEND
)
5357 /* Functions represented in the callgraph need an assembler name. */
5358 if (cgraph_node::get (decl
) != NULL
)
5361 /* Unused and not public functions don't need an assembler name. */
5362 if (!TREE_USED (decl
) && !TREE_PUBLIC (decl
))
5370 /* Reset all language specific information still present in symbol
5374 free_lang_data_in_decl (tree decl
)
5376 gcc_assert (DECL_P (decl
));
5378 /* Give the FE a chance to remove its own data first. */
5379 lang_hooks
.free_lang_data (decl
);
5381 TREE_LANG_FLAG_0 (decl
) = 0;
5382 TREE_LANG_FLAG_1 (decl
) = 0;
5383 TREE_LANG_FLAG_2 (decl
) = 0;
5384 TREE_LANG_FLAG_3 (decl
) = 0;
5385 TREE_LANG_FLAG_4 (decl
) = 0;
5386 TREE_LANG_FLAG_5 (decl
) = 0;
5387 TREE_LANG_FLAG_6 (decl
) = 0;
5389 free_lang_data_in_one_sizepos (&DECL_SIZE (decl
));
5390 free_lang_data_in_one_sizepos (&DECL_SIZE_UNIT (decl
));
5391 if (TREE_CODE (decl
) == FIELD_DECL
)
5393 free_lang_data_in_one_sizepos (&DECL_FIELD_OFFSET (decl
));
5394 if (TREE_CODE (DECL_CONTEXT (decl
)) == QUAL_UNION_TYPE
)
5395 DECL_QUALIFIER (decl
) = NULL_TREE
;
5398 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5400 struct cgraph_node
*node
;
5401 if (!(node
= cgraph_node::get (decl
))
5402 || (!node
->definition
&& !node
->clones
))
5405 node
->release_body ();
5408 release_function_body (decl
);
5409 DECL_ARGUMENTS (decl
) = NULL
;
5410 DECL_RESULT (decl
) = NULL
;
5411 DECL_INITIAL (decl
) = error_mark_node
;
5414 if (gimple_has_body_p (decl
) || (node
&& node
->thunk
.thunk_p
))
5418 /* If DECL has a gimple body, then the context for its
5419 arguments must be DECL. Otherwise, it doesn't really
5420 matter, as we will not be emitting any code for DECL. In
5421 general, there may be other instances of DECL created by
5422 the front end and since PARM_DECLs are generally shared,
5423 their DECL_CONTEXT changes as the replicas of DECL are
5424 created. The only time where DECL_CONTEXT is important
5425 is for the FUNCTION_DECLs that have a gimple body (since
5426 the PARM_DECL will be used in the function's body). */
5427 for (t
= DECL_ARGUMENTS (decl
); t
; t
= TREE_CHAIN (t
))
5428 DECL_CONTEXT (t
) = decl
;
5429 if (!DECL_FUNCTION_SPECIFIC_TARGET (decl
))
5430 DECL_FUNCTION_SPECIFIC_TARGET (decl
)
5431 = target_option_default_node
;
5432 if (!DECL_FUNCTION_SPECIFIC_OPTIMIZATION (decl
))
5433 DECL_FUNCTION_SPECIFIC_OPTIMIZATION (decl
)
5434 = optimization_default_node
;
5437 /* DECL_SAVED_TREE holds the GENERIC representation for DECL.
5438 At this point, it is not needed anymore. */
5439 DECL_SAVED_TREE (decl
) = NULL_TREE
;
5441 /* Clear the abstract origin if it refers to a method.
5442 Otherwise dwarf2out.c will ICE as we splice functions out of
5443 TYPE_FIELDS and thus the origin will not be output
5445 if (DECL_ABSTRACT_ORIGIN (decl
)
5446 && DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))
5447 && RECORD_OR_UNION_TYPE_P
5448 (DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))))
5449 DECL_ABSTRACT_ORIGIN (decl
) = NULL_TREE
;
5451 /* Sometimes the C++ frontend doesn't manage to transform a temporary
5452 DECL_VINDEX referring to itself into a vtable slot number as it
5453 should. Happens with functions that are copied and then forgotten
5454 about. Just clear it, it won't matter anymore. */
5455 if (DECL_VINDEX (decl
) && !tree_fits_shwi_p (DECL_VINDEX (decl
)))
5456 DECL_VINDEX (decl
) = NULL_TREE
;
5458 else if (VAR_P (decl
))
5460 if ((DECL_EXTERNAL (decl
)
5461 && (!TREE_STATIC (decl
) || !TREE_READONLY (decl
)))
5462 || (decl_function_context (decl
) && !TREE_STATIC (decl
)))
5463 DECL_INITIAL (decl
) = NULL_TREE
;
5465 else if (TREE_CODE (decl
) == TYPE_DECL
)
5467 DECL_VISIBILITY (decl
) = VISIBILITY_DEFAULT
;
5468 DECL_VISIBILITY_SPECIFIED (decl
) = 0;
5469 DECL_INITIAL (decl
) = NULL_TREE
;
5471 else if (TREE_CODE (decl
) == FIELD_DECL
)
5472 DECL_INITIAL (decl
) = NULL_TREE
;
5473 else if (TREE_CODE (decl
) == TRANSLATION_UNIT_DECL
5474 && DECL_INITIAL (decl
)
5475 && TREE_CODE (DECL_INITIAL (decl
)) == BLOCK
)
5477 /* Strip builtins from the translation-unit BLOCK. We still have targets
5478 without builtin_decl_explicit support and also builtins are shared
5479 nodes and thus we can't use TREE_CHAIN in multiple lists. */
5480 tree
*nextp
= &BLOCK_VARS (DECL_INITIAL (decl
));
5484 if (TREE_CODE (var
) == FUNCTION_DECL
5485 && DECL_BUILT_IN (var
))
5486 *nextp
= TREE_CHAIN (var
);
5488 nextp
= &TREE_CHAIN (var
);
5494 /* Data used when collecting DECLs and TYPEs for language data removal. */
5496 struct free_lang_data_d
5498 free_lang_data_d () : decls (100), types (100) {}
5500 /* Worklist to avoid excessive recursion. */
5501 auto_vec
<tree
> worklist
;
5503 /* Set of traversed objects. Used to avoid duplicate visits. */
5504 hash_set
<tree
> pset
;
5506 /* Array of symbols to process with free_lang_data_in_decl. */
5507 auto_vec
<tree
> decls
;
5509 /* Array of types to process with free_lang_data_in_type. */
5510 auto_vec
<tree
> types
;
5514 /* Save all language fields needed to generate proper debug information
5515 for DECL. This saves most fields cleared out by free_lang_data_in_decl. */
5518 save_debug_info_for_decl (tree t
)
5520 /*struct saved_debug_info_d *sdi;*/
5522 gcc_assert (debug_info_level
> DINFO_LEVEL_TERSE
&& t
&& DECL_P (t
));
5524 /* FIXME. Partial implementation for saving debug info removed. */
5528 /* Save all language fields needed to generate proper debug information
5529 for TYPE. This saves most fields cleared out by free_lang_data_in_type. */
5532 save_debug_info_for_type (tree t
)
5534 /*struct saved_debug_info_d *sdi;*/
5536 gcc_assert (debug_info_level
> DINFO_LEVEL_TERSE
&& t
&& TYPE_P (t
));
5538 /* FIXME. Partial implementation for saving debug info removed. */
5542 /* Add type or decl T to one of the list of tree nodes that need their
5543 language data removed. The lists are held inside FLD. */
5546 add_tree_to_fld_list (tree t
, struct free_lang_data_d
*fld
)
5550 fld
->decls
.safe_push (t
);
5551 if (debug_info_level
> DINFO_LEVEL_TERSE
)
5552 save_debug_info_for_decl (t
);
5554 else if (TYPE_P (t
))
5556 fld
->types
.safe_push (t
);
5557 if (debug_info_level
> DINFO_LEVEL_TERSE
)
5558 save_debug_info_for_type (t
);
5564 /* Push tree node T into FLD->WORKLIST. */
5567 fld_worklist_push (tree t
, struct free_lang_data_d
*fld
)
5569 if (t
&& !is_lang_specific (t
) && !fld
->pset
.contains (t
))
5570 fld
->worklist
.safe_push ((t
));
5574 /* Operand callback helper for free_lang_data_in_node. *TP is the
5575 subtree operand being considered. */
5578 find_decls_types_r (tree
*tp
, int *ws
, void *data
)
5581 struct free_lang_data_d
*fld
= (struct free_lang_data_d
*) data
;
5583 if (TREE_CODE (t
) == TREE_LIST
)
5586 /* Language specific nodes will be removed, so there is no need
5587 to gather anything under them. */
5588 if (is_lang_specific (t
))
5596 /* Note that walk_tree does not traverse every possible field in
5597 decls, so we have to do our own traversals here. */
5598 add_tree_to_fld_list (t
, fld
);
5600 fld_worklist_push (DECL_NAME (t
), fld
);
5601 fld_worklist_push (DECL_CONTEXT (t
), fld
);
5602 fld_worklist_push (DECL_SIZE (t
), fld
);
5603 fld_worklist_push (DECL_SIZE_UNIT (t
), fld
);
5605 /* We are going to remove everything under DECL_INITIAL for
5606 TYPE_DECLs. No point walking them. */
5607 if (TREE_CODE (t
) != TYPE_DECL
)
5608 fld_worklist_push (DECL_INITIAL (t
), fld
);
5610 fld_worklist_push (DECL_ATTRIBUTES (t
), fld
);
5611 fld_worklist_push (DECL_ABSTRACT_ORIGIN (t
), fld
);
5613 if (TREE_CODE (t
) == FUNCTION_DECL
)
5615 fld_worklist_push (DECL_ARGUMENTS (t
), fld
);
5616 fld_worklist_push (DECL_RESULT (t
), fld
);
5618 else if (TREE_CODE (t
) == TYPE_DECL
)
5620 fld_worklist_push (DECL_ORIGINAL_TYPE (t
), fld
);
5622 else if (TREE_CODE (t
) == FIELD_DECL
)
5624 fld_worklist_push (DECL_FIELD_OFFSET (t
), fld
);
5625 fld_worklist_push (DECL_BIT_FIELD_TYPE (t
), fld
);
5626 fld_worklist_push (DECL_FIELD_BIT_OFFSET (t
), fld
);
5627 fld_worklist_push (DECL_FCONTEXT (t
), fld
);
5630 if ((VAR_P (t
) || TREE_CODE (t
) == PARM_DECL
)
5631 && DECL_HAS_VALUE_EXPR_P (t
))
5632 fld_worklist_push (DECL_VALUE_EXPR (t
), fld
);
5634 if (TREE_CODE (t
) != FIELD_DECL
5635 && TREE_CODE (t
) != TYPE_DECL
)
5636 fld_worklist_push (TREE_CHAIN (t
), fld
);
5639 else if (TYPE_P (t
))
5641 /* Note that walk_tree does not traverse every possible field in
5642 types, so we have to do our own traversals here. */
5643 add_tree_to_fld_list (t
, fld
);
5645 if (!RECORD_OR_UNION_TYPE_P (t
))
5646 fld_worklist_push (TYPE_CACHED_VALUES (t
), fld
);
5647 fld_worklist_push (TYPE_SIZE (t
), fld
);
5648 fld_worklist_push (TYPE_SIZE_UNIT (t
), fld
);
5649 fld_worklist_push (TYPE_ATTRIBUTES (t
), fld
);
5650 fld_worklist_push (TYPE_POINTER_TO (t
), fld
);
5651 fld_worklist_push (TYPE_REFERENCE_TO (t
), fld
);
5652 fld_worklist_push (TYPE_NAME (t
), fld
);
5653 /* Do not walk TYPE_NEXT_PTR_TO or TYPE_NEXT_REF_TO. We do not stream
5654 them and thus do not and want not to reach unused pointer types
5656 if (!POINTER_TYPE_P (t
))
5657 fld_worklist_push (TYPE_MIN_VALUE_RAW (t
), fld
);
5658 if (!RECORD_OR_UNION_TYPE_P (t
))
5659 fld_worklist_push (TYPE_MAX_VALUE_RAW (t
), fld
);
5660 fld_worklist_push (TYPE_MAIN_VARIANT (t
), fld
);
5661 /* Do not walk TYPE_NEXT_VARIANT. We do not stream it and thus
5662 do not and want not to reach unused variants this way. */
5663 if (TYPE_CONTEXT (t
))
5665 tree ctx
= TYPE_CONTEXT (t
);
5666 /* We adjust BLOCK TYPE_CONTEXTs to the innermost non-BLOCK one.
5667 So push that instead. */
5668 while (ctx
&& TREE_CODE (ctx
) == BLOCK
)
5669 ctx
= BLOCK_SUPERCONTEXT (ctx
);
5670 fld_worklist_push (ctx
, fld
);
5672 /* Do not walk TYPE_CANONICAL. We do not stream it and thus do not
5673 and want not to reach unused types this way. */
5675 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_BINFO (t
))
5679 FOR_EACH_VEC_ELT (*BINFO_BASE_BINFOS (TYPE_BINFO (t
)), i
, tem
)
5680 fld_worklist_push (TREE_TYPE (tem
), fld
);
5681 fld_worklist_push (BINFO_VIRTUALS (TYPE_BINFO (t
)), fld
);
5683 if (RECORD_OR_UNION_TYPE_P (t
))
5686 /* Push all TYPE_FIELDS - there can be interleaving interesting
5687 and non-interesting things. */
5688 tem
= TYPE_FIELDS (t
);
5691 if (TREE_CODE (tem
) == FIELD_DECL
5692 || (TREE_CODE (tem
) == TYPE_DECL
5693 && !DECL_IGNORED_P (tem
)
5694 && debug_info_level
> DINFO_LEVEL_TERSE
5695 && !is_redundant_typedef (tem
)))
5696 fld_worklist_push (tem
, fld
);
5697 tem
= TREE_CHAIN (tem
);
5701 fld_worklist_push (TYPE_STUB_DECL (t
), fld
);
5704 else if (TREE_CODE (t
) == BLOCK
)
5707 for (tem
= BLOCK_VARS (t
); tem
; tem
= TREE_CHAIN (tem
))
5708 fld_worklist_push (tem
, fld
);
5709 for (tem
= BLOCK_SUBBLOCKS (t
); tem
; tem
= BLOCK_CHAIN (tem
))
5710 fld_worklist_push (tem
, fld
);
5711 fld_worklist_push (BLOCK_ABSTRACT_ORIGIN (t
), fld
);
5714 if (TREE_CODE (t
) != IDENTIFIER_NODE
5715 && CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_TYPED
))
5716 fld_worklist_push (TREE_TYPE (t
), fld
);
5722 /* Find decls and types in T. */
5725 find_decls_types (tree t
, struct free_lang_data_d
*fld
)
5729 if (!fld
->pset
.contains (t
))
5730 walk_tree (&t
, find_decls_types_r
, fld
, &fld
->pset
);
5731 if (fld
->worklist
.is_empty ())
5733 t
= fld
->worklist
.pop ();
5737 /* Translate all the types in LIST with the corresponding runtime
5741 get_eh_types_for_runtime (tree list
)
5745 if (list
== NULL_TREE
)
5748 head
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
5750 list
= TREE_CHAIN (list
);
5753 tree n
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
5754 TREE_CHAIN (prev
) = n
;
5755 prev
= TREE_CHAIN (prev
);
5756 list
= TREE_CHAIN (list
);
5763 /* Find decls and types referenced in EH region R and store them in
5764 FLD->DECLS and FLD->TYPES. */
5767 find_decls_types_in_eh_region (eh_region r
, struct free_lang_data_d
*fld
)
5778 /* The types referenced in each catch must first be changed to the
5779 EH types used at runtime. This removes references to FE types
5781 for (c
= r
->u
.eh_try
.first_catch
; c
; c
= c
->next_catch
)
5783 c
->type_list
= get_eh_types_for_runtime (c
->type_list
);
5784 walk_tree (&c
->type_list
, find_decls_types_r
, fld
, &fld
->pset
);
5789 case ERT_ALLOWED_EXCEPTIONS
:
5790 r
->u
.allowed
.type_list
5791 = get_eh_types_for_runtime (r
->u
.allowed
.type_list
);
5792 walk_tree (&r
->u
.allowed
.type_list
, find_decls_types_r
, fld
, &fld
->pset
);
5795 case ERT_MUST_NOT_THROW
:
5796 walk_tree (&r
->u
.must_not_throw
.failure_decl
,
5797 find_decls_types_r
, fld
, &fld
->pset
);
5803 /* Find decls and types referenced in cgraph node N and store them in
5804 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
5805 look for *every* kind of DECL and TYPE node reachable from N,
5806 including those embedded inside types and decls (i.e,, TYPE_DECLs,
5807 NAMESPACE_DECLs, etc). */
5810 find_decls_types_in_node (struct cgraph_node
*n
, struct free_lang_data_d
*fld
)
5813 struct function
*fn
;
5817 find_decls_types (n
->decl
, fld
);
5819 if (!gimple_has_body_p (n
->decl
))
5822 gcc_assert (current_function_decl
== NULL_TREE
&& cfun
== NULL
);
5824 fn
= DECL_STRUCT_FUNCTION (n
->decl
);
5826 /* Traverse locals. */
5827 FOR_EACH_LOCAL_DECL (fn
, ix
, t
)
5828 find_decls_types (t
, fld
);
5830 /* Traverse EH regions in FN. */
5833 FOR_ALL_EH_REGION_FN (r
, fn
)
5834 find_decls_types_in_eh_region (r
, fld
);
5837 /* Traverse every statement in FN. */
5838 FOR_EACH_BB_FN (bb
, fn
)
5841 gimple_stmt_iterator si
;
5844 for (psi
= gsi_start_phis (bb
); !gsi_end_p (psi
); gsi_next (&psi
))
5846 gphi
*phi
= psi
.phi ();
5848 for (i
= 0; i
< gimple_phi_num_args (phi
); i
++)
5850 tree
*arg_p
= gimple_phi_arg_def_ptr (phi
, i
);
5851 find_decls_types (*arg_p
, fld
);
5855 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
5857 gimple
*stmt
= gsi_stmt (si
);
5859 if (is_gimple_call (stmt
))
5860 find_decls_types (gimple_call_fntype (stmt
), fld
);
5862 for (i
= 0; i
< gimple_num_ops (stmt
); i
++)
5864 tree arg
= gimple_op (stmt
, i
);
5865 find_decls_types (arg
, fld
);
5872 /* Find decls and types referenced in varpool node N and store them in
5873 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
5874 look for *every* kind of DECL and TYPE node reachable from N,
5875 including those embedded inside types and decls (i.e,, TYPE_DECLs,
5876 NAMESPACE_DECLs, etc). */
5879 find_decls_types_in_var (varpool_node
*v
, struct free_lang_data_d
*fld
)
5881 find_decls_types (v
->decl
, fld
);
5884 /* If T needs an assembler name, have one created for it. */
5887 assign_assembler_name_if_needed (tree t
)
5889 if (need_assembler_name_p (t
))
5891 /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit
5892 diagnostics that use input_location to show locus
5893 information. The problem here is that, at this point,
5894 input_location is generally anchored to the end of the file
5895 (since the parser is long gone), so we don't have a good
5896 position to pin it to.
5898 To alleviate this problem, this uses the location of T's
5899 declaration. Examples of this are
5900 testsuite/g++.dg/template/cond2.C and
5901 testsuite/g++.dg/template/pr35240.C. */
5902 location_t saved_location
= input_location
;
5903 input_location
= DECL_SOURCE_LOCATION (t
);
5905 decl_assembler_name (t
);
5907 input_location
= saved_location
;
5912 /* Free language specific information for every operand and expression
5913 in every node of the call graph. This process operates in three stages:
5915 1- Every callgraph node and varpool node is traversed looking for
5916 decls and types embedded in them. This is a more exhaustive
5917 search than that done by find_referenced_vars, because it will
5918 also collect individual fields, decls embedded in types, etc.
5920 2- All the decls found are sent to free_lang_data_in_decl.
5922 3- All the types found are sent to free_lang_data_in_type.
5924 The ordering between decls and types is important because
5925 free_lang_data_in_decl sets assembler names, which includes
5926 mangling. So types cannot be freed up until assembler names have
5930 free_lang_data_in_cgraph (void)
5932 struct cgraph_node
*n
;
5934 struct free_lang_data_d fld
;
5939 /* Find decls and types in the body of every function in the callgraph. */
5940 FOR_EACH_FUNCTION (n
)
5941 find_decls_types_in_node (n
, &fld
);
5943 FOR_EACH_VEC_SAFE_ELT (alias_pairs
, i
, p
)
5944 find_decls_types (p
->decl
, &fld
);
5946 /* Find decls and types in every varpool symbol. */
5947 FOR_EACH_VARIABLE (v
)
5948 find_decls_types_in_var (v
, &fld
);
5950 /* Set the assembler name on every decl found. We need to do this
5951 now because free_lang_data_in_decl will invalidate data needed
5952 for mangling. This breaks mangling on interdependent decls. */
5953 FOR_EACH_VEC_ELT (fld
.decls
, i
, t
)
5954 assign_assembler_name_if_needed (t
);
5956 /* Traverse every decl found freeing its language data. */
5957 FOR_EACH_VEC_ELT (fld
.decls
, i
, t
)
5958 free_lang_data_in_decl (t
);
5960 /* Traverse every type found freeing its language data. */
5961 FOR_EACH_VEC_ELT (fld
.types
, i
, t
)
5962 free_lang_data_in_type (t
);
5965 FOR_EACH_VEC_ELT (fld
.types
, i
, t
)
5971 /* Free resources that are used by FE but are not needed once they are done. */
5974 free_lang_data (void)
5978 /* If we are the LTO frontend we have freed lang-specific data already. */
5980 || (!flag_generate_lto
&& !flag_generate_offload
))
5983 /* Allocate and assign alias sets to the standard integer types
5984 while the slots are still in the way the frontends generated them. */
5985 for (i
= 0; i
< itk_none
; ++i
)
5986 if (integer_types
[i
])
5987 TYPE_ALIAS_SET (integer_types
[i
]) = get_alias_set (integer_types
[i
]);
5989 /* Traverse the IL resetting language specific information for
5990 operands, expressions, etc. */
5991 free_lang_data_in_cgraph ();
5993 /* Create gimple variants for common types. */
5994 for (unsigned i
= 0;
5995 i
< sizeof (builtin_structptr_types
) / sizeof (builtin_structptr_type
);
5997 builtin_structptr_types
[i
].node
= builtin_structptr_types
[i
].base
;
5999 /* Reset some langhooks. Do not reset types_compatible_p, it may
6000 still be used indirectly via the get_alias_set langhook. */
6001 lang_hooks
.dwarf_name
= lhd_dwarf_name
;
6002 lang_hooks
.decl_printable_name
= gimple_decl_printable_name
;
6003 lang_hooks
.gimplify_expr
= lhd_gimplify_expr
;
6005 /* We do not want the default decl_assembler_name implementation,
6006 rather if we have fixed everything we want a wrapper around it
6007 asserting that all non-local symbols already got their assembler
6008 name and only produce assembler names for local symbols. Or rather
6009 make sure we never call decl_assembler_name on local symbols and
6010 devise a separate, middle-end private scheme for it. */
6012 /* Reset diagnostic machinery. */
6013 tree_diagnostics_defaults (global_dc
);
6021 const pass_data pass_data_ipa_free_lang_data
=
6023 SIMPLE_IPA_PASS
, /* type */
6024 "*free_lang_data", /* name */
6025 OPTGROUP_NONE
, /* optinfo_flags */
6026 TV_IPA_FREE_LANG_DATA
, /* tv_id */
6027 0, /* properties_required */
6028 0, /* properties_provided */
6029 0, /* properties_destroyed */
6030 0, /* todo_flags_start */
6031 0, /* todo_flags_finish */
6034 class pass_ipa_free_lang_data
: public simple_ipa_opt_pass
6037 pass_ipa_free_lang_data (gcc::context
*ctxt
)
6038 : simple_ipa_opt_pass (pass_data_ipa_free_lang_data
, ctxt
)
6041 /* opt_pass methods: */
6042 virtual unsigned int execute (function
*) { return free_lang_data (); }
6044 }; // class pass_ipa_free_lang_data
6048 simple_ipa_opt_pass
*
6049 make_pass_ipa_free_lang_data (gcc::context
*ctxt
)
6051 return new pass_ipa_free_lang_data (ctxt
);
6054 /* The backbone of is_attribute_p(). ATTR_LEN is the string length of
6055 ATTR_NAME. Also used internally by remove_attribute(). */
6057 private_is_attribute_p (const char *attr_name
, size_t attr_len
, const_tree ident
)
6059 size_t ident_len
= IDENTIFIER_LENGTH (ident
);
6061 if (ident_len
== attr_len
)
6063 if (id_equal (ident
, attr_name
))
6066 else if (ident_len
== attr_len
+ 4)
6068 /* There is the possibility that ATTR is 'text' and IDENT is
6070 const char *p
= IDENTIFIER_POINTER (ident
);
6071 if (p
[0] == '_' && p
[1] == '_'
6072 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
6073 && strncmp (attr_name
, p
+ 2, attr_len
) == 0)
6080 /* The backbone of lookup_attribute(). ATTR_LEN is the string length
6081 of ATTR_NAME, and LIST is not NULL_TREE. */
6083 private_lookup_attribute (const char *attr_name
, size_t attr_len
, tree list
)
6087 size_t ident_len
= IDENTIFIER_LENGTH (get_attribute_name (list
));
6089 if (ident_len
== attr_len
)
6091 if (!strcmp (attr_name
,
6092 IDENTIFIER_POINTER (get_attribute_name (list
))))
6095 /* TODO: If we made sure that attributes were stored in the
6096 canonical form without '__...__' (ie, as in 'text' as opposed
6097 to '__text__') then we could avoid the following case. */
6098 else if (ident_len
== attr_len
+ 4)
6100 const char *p
= IDENTIFIER_POINTER (get_attribute_name (list
));
6101 if (p
[0] == '_' && p
[1] == '_'
6102 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
6103 && strncmp (attr_name
, p
+ 2, attr_len
) == 0)
6106 list
= TREE_CHAIN (list
);
6112 /* Given an attribute name ATTR_NAME and a list of attributes LIST,
6113 return a pointer to the attribute's list first element if the attribute
6114 starts with ATTR_NAME. ATTR_NAME must be in the form 'text' (not
6118 private_lookup_attribute_by_prefix (const char *attr_name
, size_t attr_len
,
6123 size_t ident_len
= IDENTIFIER_LENGTH (get_attribute_name (list
));
6125 if (attr_len
> ident_len
)
6127 list
= TREE_CHAIN (list
);
6131 const char *p
= IDENTIFIER_POINTER (get_attribute_name (list
));
6133 if (strncmp (attr_name
, p
, attr_len
) == 0)
6136 /* TODO: If we made sure that attributes were stored in the
6137 canonical form without '__...__' (ie, as in 'text' as opposed
6138 to '__text__') then we could avoid the following case. */
6139 if (p
[0] == '_' && p
[1] == '_' &&
6140 strncmp (attr_name
, p
+ 2, attr_len
) == 0)
6143 list
= TREE_CHAIN (list
);
6150 /* A variant of lookup_attribute() that can be used with an identifier
6151 as the first argument, and where the identifier can be either
6152 'text' or '__text__'.
6154 Given an attribute ATTR_IDENTIFIER, and a list of attributes LIST,
6155 return a pointer to the attribute's list element if the attribute
6156 is part of the list, or NULL_TREE if not found. If the attribute
6157 appears more than once, this only returns the first occurrence; the
6158 TREE_CHAIN of the return value should be passed back in if further
6159 occurrences are wanted. ATTR_IDENTIFIER must be an identifier but
6160 can be in the form 'text' or '__text__'. */
6162 lookup_ident_attribute (tree attr_identifier
, tree list
)
6164 gcc_checking_assert (TREE_CODE (attr_identifier
) == IDENTIFIER_NODE
);
6168 gcc_checking_assert (TREE_CODE (get_attribute_name (list
))
6169 == IDENTIFIER_NODE
);
6171 if (cmp_attrib_identifiers (attr_identifier
,
6172 get_attribute_name (list
)))
6175 list
= TREE_CHAIN (list
);
6181 /* Remove any instances of attribute ATTR_NAME in LIST and return the
6185 remove_attribute (const char *attr_name
, tree list
)
6188 size_t attr_len
= strlen (attr_name
);
6190 gcc_checking_assert (attr_name
[0] != '_');
6192 for (p
= &list
; *p
; )
6195 /* TODO: If we were storing attributes in normalized form, here
6196 we could use a simple strcmp(). */
6197 if (private_is_attribute_p (attr_name
, attr_len
, get_attribute_name (l
)))
6198 *p
= TREE_CHAIN (l
);
6200 p
= &TREE_CHAIN (l
);
6206 /* Return an attribute list that is the union of a1 and a2. */
6209 merge_attributes (tree a1
, tree a2
)
6213 /* Either one unset? Take the set one. */
6215 if ((attributes
= a1
) == 0)
6218 /* One that completely contains the other? Take it. */
6220 else if (a2
!= 0 && ! attribute_list_contained (a1
, a2
))
6222 if (attribute_list_contained (a2
, a1
))
6226 /* Pick the longest list, and hang on the other list. */
6228 if (list_length (a1
) < list_length (a2
))
6229 attributes
= a2
, a2
= a1
;
6231 for (; a2
!= 0; a2
= TREE_CHAIN (a2
))
6234 for (a
= lookup_ident_attribute (get_attribute_name (a2
),
6236 a
!= NULL_TREE
&& !attribute_value_equal (a
, a2
);
6237 a
= lookup_ident_attribute (get_attribute_name (a2
),
6242 a1
= copy_node (a2
);
6243 TREE_CHAIN (a1
) = attributes
;
6252 /* Given types T1 and T2, merge their attributes and return
6256 merge_type_attributes (tree t1
, tree t2
)
6258 return merge_attributes (TYPE_ATTRIBUTES (t1
),
6259 TYPE_ATTRIBUTES (t2
));
6262 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
6266 merge_decl_attributes (tree olddecl
, tree newdecl
)
6268 return merge_attributes (DECL_ATTRIBUTES (olddecl
),
6269 DECL_ATTRIBUTES (newdecl
));
6272 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
6274 /* Specialization of merge_decl_attributes for various Windows targets.
6276 This handles the following situation:
6278 __declspec (dllimport) int foo;
6281 The second instance of `foo' nullifies the dllimport. */
6284 merge_dllimport_decl_attributes (tree old
, tree new_tree
)
6287 int delete_dllimport_p
= 1;
6289 /* What we need to do here is remove from `old' dllimport if it doesn't
6290 appear in `new'. dllimport behaves like extern: if a declaration is
6291 marked dllimport and a definition appears later, then the object
6292 is not dllimport'd. We also remove a `new' dllimport if the old list
6293 contains dllexport: dllexport always overrides dllimport, regardless
6294 of the order of declaration. */
6295 if (!VAR_OR_FUNCTION_DECL_P (new_tree
))
6296 delete_dllimport_p
= 0;
6297 else if (DECL_DLLIMPORT_P (new_tree
)
6298 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (old
)))
6300 DECL_DLLIMPORT_P (new_tree
) = 0;
6301 warning (OPT_Wattributes
, "%q+D already declared with dllexport attribute: "
6302 "dllimport ignored", new_tree
);
6304 else if (DECL_DLLIMPORT_P (old
) && !DECL_DLLIMPORT_P (new_tree
))
6306 /* Warn about overriding a symbol that has already been used, e.g.:
6307 extern int __attribute__ ((dllimport)) foo;
6308 int* bar () {return &foo;}
6311 if (TREE_USED (old
))
6313 warning (0, "%q+D redeclared without dllimport attribute "
6314 "after being referenced with dll linkage", new_tree
);
6315 /* If we have used a variable's address with dllimport linkage,
6316 keep the old DECL_DLLIMPORT_P flag: the ADDR_EXPR using the
6317 decl may already have had TREE_CONSTANT computed.
6318 We still remove the attribute so that assembler code refers
6319 to '&foo rather than '_imp__foo'. */
6320 if (VAR_P (old
) && TREE_ADDRESSABLE (old
))
6321 DECL_DLLIMPORT_P (new_tree
) = 1;
6324 /* Let an inline definition silently override the external reference,
6325 but otherwise warn about attribute inconsistency. */
6326 else if (VAR_P (new_tree
) || !DECL_DECLARED_INLINE_P (new_tree
))
6327 warning (OPT_Wattributes
, "%q+D redeclared without dllimport attribute: "
6328 "previous dllimport ignored", new_tree
);
6331 delete_dllimport_p
= 0;
6333 a
= merge_attributes (DECL_ATTRIBUTES (old
), DECL_ATTRIBUTES (new_tree
));
6335 if (delete_dllimport_p
)
6336 a
= remove_attribute ("dllimport", a
);
6341 /* Handle a "dllimport" or "dllexport" attribute; arguments as in
6342 struct attribute_spec.handler. */
6345 handle_dll_attribute (tree
* pnode
, tree name
, tree args
, int flags
,
6351 /* These attributes may apply to structure and union types being created,
6352 but otherwise should pass to the declaration involved. */
6355 if (flags
& ((int) ATTR_FLAG_DECL_NEXT
| (int) ATTR_FLAG_FUNCTION_NEXT
6356 | (int) ATTR_FLAG_ARRAY_NEXT
))
6358 *no_add_attrs
= true;
6359 return tree_cons (name
, args
, NULL_TREE
);
6361 if (TREE_CODE (node
) == RECORD_TYPE
6362 || TREE_CODE (node
) == UNION_TYPE
)
6364 node
= TYPE_NAME (node
);
6370 warning (OPT_Wattributes
, "%qE attribute ignored",
6372 *no_add_attrs
= true;
6377 if (!VAR_OR_FUNCTION_DECL_P (node
) && TREE_CODE (node
) != TYPE_DECL
)
6379 *no_add_attrs
= true;
6380 warning (OPT_Wattributes
, "%qE attribute ignored",
6385 if (TREE_CODE (node
) == TYPE_DECL
6386 && TREE_CODE (TREE_TYPE (node
)) != RECORD_TYPE
6387 && TREE_CODE (TREE_TYPE (node
)) != UNION_TYPE
)
6389 *no_add_attrs
= true;
6390 warning (OPT_Wattributes
, "%qE attribute ignored",
6395 is_dllimport
= is_attribute_p ("dllimport", name
);
6397 /* Report error on dllimport ambiguities seen now before they cause
6401 /* Honor any target-specific overrides. */
6402 if (!targetm
.valid_dllimport_attribute_p (node
))
6403 *no_add_attrs
= true;
6405 else if (TREE_CODE (node
) == FUNCTION_DECL
6406 && DECL_DECLARED_INLINE_P (node
))
6408 warning (OPT_Wattributes
, "inline function %q+D declared as "
6409 " dllimport: attribute ignored", node
);
6410 *no_add_attrs
= true;
6412 /* Like MS, treat definition of dllimported variables and
6413 non-inlined functions on declaration as syntax errors. */
6414 else if (TREE_CODE (node
) == FUNCTION_DECL
&& DECL_INITIAL (node
))
6416 error ("function %q+D definition is marked dllimport", node
);
6417 *no_add_attrs
= true;
6420 else if (VAR_P (node
))
6422 if (DECL_INITIAL (node
))
6424 error ("variable %q+D definition is marked dllimport",
6426 *no_add_attrs
= true;
6429 /* `extern' needn't be specified with dllimport.
6430 Specify `extern' now and hope for the best. Sigh. */
6431 DECL_EXTERNAL (node
) = 1;
6432 /* Also, implicitly give dllimport'd variables declared within
6433 a function global scope, unless declared static. */
6434 if (current_function_decl
!= NULL_TREE
&& !TREE_STATIC (node
))
6435 TREE_PUBLIC (node
) = 1;
6438 if (*no_add_attrs
== false)
6439 DECL_DLLIMPORT_P (node
) = 1;
6441 else if (TREE_CODE (node
) == FUNCTION_DECL
6442 && DECL_DECLARED_INLINE_P (node
)
6443 && flag_keep_inline_dllexport
)
6444 /* An exported function, even if inline, must be emitted. */
6445 DECL_EXTERNAL (node
) = 0;
6447 /* Report error if symbol is not accessible at global scope. */
6448 if (!TREE_PUBLIC (node
) && VAR_OR_FUNCTION_DECL_P (node
))
6450 error ("external linkage required for symbol %q+D because of "
6451 "%qE attribute", node
, name
);
6452 *no_add_attrs
= true;
6455 /* A dllexport'd entity must have default visibility so that other
6456 program units (shared libraries or the main executable) can see
6457 it. A dllimport'd entity must have default visibility so that
6458 the linker knows that undefined references within this program
6459 unit can be resolved by the dynamic linker. */
6462 if (DECL_VISIBILITY_SPECIFIED (node
)
6463 && DECL_VISIBILITY (node
) != VISIBILITY_DEFAULT
)
6464 error ("%qE implies default visibility, but %qD has already "
6465 "been declared with a different visibility",
6467 DECL_VISIBILITY (node
) = VISIBILITY_DEFAULT
;
6468 DECL_VISIBILITY_SPECIFIED (node
) = 1;
6474 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
6476 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
6477 of the various TYPE_QUAL values. */
6480 set_type_quals (tree type
, int type_quals
)
6482 TYPE_READONLY (type
) = (type_quals
& TYPE_QUAL_CONST
) != 0;
6483 TYPE_VOLATILE (type
) = (type_quals
& TYPE_QUAL_VOLATILE
) != 0;
6484 TYPE_RESTRICT (type
) = (type_quals
& TYPE_QUAL_RESTRICT
) != 0;
6485 TYPE_ATOMIC (type
) = (type_quals
& TYPE_QUAL_ATOMIC
) != 0;
6486 TYPE_ADDR_SPACE (type
) = DECODE_QUAL_ADDR_SPACE (type_quals
);
6489 /* Returns true iff CAND and BASE have equivalent language-specific
6493 check_lang_type (const_tree cand
, const_tree base
)
6495 if (lang_hooks
.types
.type_hash_eq
== NULL
)
6497 /* type_hash_eq currently only applies to these types. */
6498 if (TREE_CODE (cand
) != FUNCTION_TYPE
6499 && TREE_CODE (cand
) != METHOD_TYPE
)
6501 return lang_hooks
.types
.type_hash_eq (cand
, base
);
6504 /* Returns true iff unqualified CAND and BASE are equivalent. */
6507 check_base_type (const_tree cand
, const_tree base
)
6509 return (TYPE_NAME (cand
) == TYPE_NAME (base
)
6510 /* Apparently this is needed for Objective-C. */
6511 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
6512 /* Check alignment. */
6513 && TYPE_ALIGN (cand
) == TYPE_ALIGN (base
)
6514 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
6515 TYPE_ATTRIBUTES (base
)));
6518 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
6521 check_qualified_type (const_tree cand
, const_tree base
, int type_quals
)
6523 return (TYPE_QUALS (cand
) == type_quals
6524 && check_base_type (cand
, base
)
6525 && check_lang_type (cand
, base
));
6528 /* Returns true iff CAND is equivalent to BASE with ALIGN. */
6531 check_aligned_type (const_tree cand
, const_tree base
, unsigned int align
)
6533 return (TYPE_QUALS (cand
) == TYPE_QUALS (base
)
6534 && TYPE_NAME (cand
) == TYPE_NAME (base
)
6535 /* Apparently this is needed for Objective-C. */
6536 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
6537 /* Check alignment. */
6538 && TYPE_ALIGN (cand
) == align
6539 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
6540 TYPE_ATTRIBUTES (base
))
6541 && check_lang_type (cand
, base
));
6544 /* This function checks to see if TYPE matches the size one of the built-in
6545 atomic types, and returns that core atomic type. */
6548 find_atomic_core_type (tree type
)
6550 tree base_atomic_type
;
6552 /* Only handle complete types. */
6553 if (TYPE_SIZE (type
) == NULL_TREE
)
6556 HOST_WIDE_INT type_size
= tree_to_uhwi (TYPE_SIZE (type
));
6560 base_atomic_type
= atomicQI_type_node
;
6564 base_atomic_type
= atomicHI_type_node
;
6568 base_atomic_type
= atomicSI_type_node
;
6572 base_atomic_type
= atomicDI_type_node
;
6576 base_atomic_type
= atomicTI_type_node
;
6580 base_atomic_type
= NULL_TREE
;
6583 return base_atomic_type
;
6586 /* Return a version of the TYPE, qualified as indicated by the
6587 TYPE_QUALS, if one exists. If no qualified version exists yet,
6588 return NULL_TREE. */
6591 get_qualified_type (tree type
, int type_quals
)
6595 if (TYPE_QUALS (type
) == type_quals
)
6598 /* Search the chain of variants to see if there is already one there just
6599 like the one we need to have. If so, use that existing one. We must
6600 preserve the TYPE_NAME, since there is code that depends on this. */
6601 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
6602 if (check_qualified_type (t
, type
, type_quals
))
6608 /* Like get_qualified_type, but creates the type if it does not
6609 exist. This function never returns NULL_TREE. */
6612 build_qualified_type (tree type
, int type_quals MEM_STAT_DECL
)
6616 /* See if we already have the appropriate qualified variant. */
6617 t
= get_qualified_type (type
, type_quals
);
6619 /* If not, build it. */
6622 t
= build_variant_type_copy (type PASS_MEM_STAT
);
6623 set_type_quals (t
, type_quals
);
6625 if (((type_quals
& TYPE_QUAL_ATOMIC
) == TYPE_QUAL_ATOMIC
))
6627 /* See if this object can map to a basic atomic type. */
6628 tree atomic_type
= find_atomic_core_type (type
);
6631 /* Ensure the alignment of this type is compatible with
6632 the required alignment of the atomic type. */
6633 if (TYPE_ALIGN (atomic_type
) > TYPE_ALIGN (t
))
6634 SET_TYPE_ALIGN (t
, TYPE_ALIGN (atomic_type
));
6638 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
6639 /* Propagate structural equality. */
6640 SET_TYPE_STRUCTURAL_EQUALITY (t
);
6641 else if (TYPE_CANONICAL (type
) != type
)
6642 /* Build the underlying canonical type, since it is different
6645 tree c
= build_qualified_type (TYPE_CANONICAL (type
), type_quals
);
6646 TYPE_CANONICAL (t
) = TYPE_CANONICAL (c
);
6649 /* T is its own canonical type. */
6650 TYPE_CANONICAL (t
) = t
;
6657 /* Create a variant of type T with alignment ALIGN. */
6660 build_aligned_type (tree type
, unsigned int align
)
6664 if (TYPE_PACKED (type
)
6665 || TYPE_ALIGN (type
) == align
)
6668 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
6669 if (check_aligned_type (t
, type
, align
))
6672 t
= build_variant_type_copy (type
);
6673 SET_TYPE_ALIGN (t
, align
);
6674 TYPE_USER_ALIGN (t
) = 1;
6679 /* Create a new distinct copy of TYPE. The new type is made its own
6680 MAIN_VARIANT. If TYPE requires structural equality checks, the
6681 resulting type requires structural equality checks; otherwise, its
6682 TYPE_CANONICAL points to itself. */
6685 build_distinct_type_copy (tree type MEM_STAT_DECL
)
6687 tree t
= copy_node (type PASS_MEM_STAT
);
6689 TYPE_POINTER_TO (t
) = 0;
6690 TYPE_REFERENCE_TO (t
) = 0;
6692 /* Set the canonical type either to a new equivalence class, or
6693 propagate the need for structural equality checks. */
6694 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
6695 SET_TYPE_STRUCTURAL_EQUALITY (t
);
6697 TYPE_CANONICAL (t
) = t
;
6699 /* Make it its own variant. */
6700 TYPE_MAIN_VARIANT (t
) = t
;
6701 TYPE_NEXT_VARIANT (t
) = 0;
6703 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
6704 whose TREE_TYPE is not t. This can also happen in the Ada
6705 frontend when using subtypes. */
6710 /* Create a new variant of TYPE, equivalent but distinct. This is so
6711 the caller can modify it. TYPE_CANONICAL for the return type will
6712 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
6713 are considered equal by the language itself (or that both types
6714 require structural equality checks). */
6717 build_variant_type_copy (tree type MEM_STAT_DECL
)
6719 tree t
, m
= TYPE_MAIN_VARIANT (type
);
6721 t
= build_distinct_type_copy (type PASS_MEM_STAT
);
6723 /* Since we're building a variant, assume that it is a non-semantic
6724 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
6725 TYPE_CANONICAL (t
) = TYPE_CANONICAL (type
);
6726 /* Type variants have no alias set defined. */
6727 TYPE_ALIAS_SET (t
) = -1;
6729 /* Add the new type to the chain of variants of TYPE. */
6730 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (m
);
6731 TYPE_NEXT_VARIANT (m
) = t
;
6732 TYPE_MAIN_VARIANT (t
) = m
;
6737 /* Return true if the from tree in both tree maps are equal. */
6740 tree_map_base_eq (const void *va
, const void *vb
)
6742 const struct tree_map_base
*const a
= (const struct tree_map_base
*) va
,
6743 *const b
= (const struct tree_map_base
*) vb
;
6744 return (a
->from
== b
->from
);
6747 /* Hash a from tree in a tree_base_map. */
6750 tree_map_base_hash (const void *item
)
6752 return htab_hash_pointer (((const struct tree_map_base
*)item
)->from
);
6755 /* Return true if this tree map structure is marked for garbage collection
6756 purposes. We simply return true if the from tree is marked, so that this
6757 structure goes away when the from tree goes away. */
6760 tree_map_base_marked_p (const void *p
)
6762 return ggc_marked_p (((const struct tree_map_base
*) p
)->from
);
6765 /* Hash a from tree in a tree_map. */
6768 tree_map_hash (const void *item
)
6770 return (((const struct tree_map
*) item
)->hash
);
6773 /* Hash a from tree in a tree_decl_map. */
6776 tree_decl_map_hash (const void *item
)
6778 return DECL_UID (((const struct tree_decl_map
*) item
)->base
.from
);
6781 /* Return the initialization priority for DECL. */
6784 decl_init_priority_lookup (tree decl
)
6786 symtab_node
*snode
= symtab_node::get (decl
);
6789 return DEFAULT_INIT_PRIORITY
;
6791 snode
->get_init_priority ();
6794 /* Return the finalization priority for DECL. */
6797 decl_fini_priority_lookup (tree decl
)
6799 cgraph_node
*node
= cgraph_node::get (decl
);
6802 return DEFAULT_INIT_PRIORITY
;
6804 node
->get_fini_priority ();
6807 /* Set the initialization priority for DECL to PRIORITY. */
6810 decl_init_priority_insert (tree decl
, priority_type priority
)
6812 struct symtab_node
*snode
;
6814 if (priority
== DEFAULT_INIT_PRIORITY
)
6816 snode
= symtab_node::get (decl
);
6820 else if (VAR_P (decl
))
6821 snode
= varpool_node::get_create (decl
);
6823 snode
= cgraph_node::get_create (decl
);
6824 snode
->set_init_priority (priority
);
6827 /* Set the finalization priority for DECL to PRIORITY. */
6830 decl_fini_priority_insert (tree decl
, priority_type priority
)
6832 struct cgraph_node
*node
;
6834 if (priority
== DEFAULT_INIT_PRIORITY
)
6836 node
= cgraph_node::get (decl
);
6841 node
= cgraph_node::get_create (decl
);
6842 node
->set_fini_priority (priority
);
6845 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
6848 print_debug_expr_statistics (void)
6850 fprintf (stderr
, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
6851 (long) debug_expr_for_decl
->size (),
6852 (long) debug_expr_for_decl
->elements (),
6853 debug_expr_for_decl
->collisions ());
6856 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
6859 print_value_expr_statistics (void)
6861 fprintf (stderr
, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
6862 (long) value_expr_for_decl
->size (),
6863 (long) value_expr_for_decl
->elements (),
6864 value_expr_for_decl
->collisions ());
6867 /* Lookup a debug expression for FROM, and return it if we find one. */
6870 decl_debug_expr_lookup (tree from
)
6872 struct tree_decl_map
*h
, in
;
6873 in
.base
.from
= from
;
6875 h
= debug_expr_for_decl
->find_with_hash (&in
, DECL_UID (from
));
6881 /* Insert a mapping FROM->TO in the debug expression hashtable. */
6884 decl_debug_expr_insert (tree from
, tree to
)
6886 struct tree_decl_map
*h
;
6888 h
= ggc_alloc
<tree_decl_map
> ();
6889 h
->base
.from
= from
;
6891 *debug_expr_for_decl
->find_slot_with_hash (h
, DECL_UID (from
), INSERT
) = h
;
6894 /* Lookup a value expression for FROM, and return it if we find one. */
6897 decl_value_expr_lookup (tree from
)
6899 struct tree_decl_map
*h
, in
;
6900 in
.base
.from
= from
;
6902 h
= value_expr_for_decl
->find_with_hash (&in
, DECL_UID (from
));
6908 /* Insert a mapping FROM->TO in the value expression hashtable. */
6911 decl_value_expr_insert (tree from
, tree to
)
6913 struct tree_decl_map
*h
;
6915 h
= ggc_alloc
<tree_decl_map
> ();
6916 h
->base
.from
= from
;
6918 *value_expr_for_decl
->find_slot_with_hash (h
, DECL_UID (from
), INSERT
) = h
;
6921 /* Lookup a vector of debug arguments for FROM, and return it if we
6925 decl_debug_args_lookup (tree from
)
6927 struct tree_vec_map
*h
, in
;
6929 if (!DECL_HAS_DEBUG_ARGS_P (from
))
6931 gcc_checking_assert (debug_args_for_decl
!= NULL
);
6932 in
.base
.from
= from
;
6933 h
= debug_args_for_decl
->find_with_hash (&in
, DECL_UID (from
));
6939 /* Insert a mapping FROM->empty vector of debug arguments in the value
6940 expression hashtable. */
6943 decl_debug_args_insert (tree from
)
6945 struct tree_vec_map
*h
;
6948 if (DECL_HAS_DEBUG_ARGS_P (from
))
6949 return decl_debug_args_lookup (from
);
6950 if (debug_args_for_decl
== NULL
)
6951 debug_args_for_decl
= hash_table
<tree_vec_map_cache_hasher
>::create_ggc (64);
6952 h
= ggc_alloc
<tree_vec_map
> ();
6953 h
->base
.from
= from
;
6955 loc
= debug_args_for_decl
->find_slot_with_hash (h
, DECL_UID (from
), INSERT
);
6957 DECL_HAS_DEBUG_ARGS_P (from
) = 1;
6961 /* Hashing of types so that we don't make duplicates.
6962 The entry point is `type_hash_canon'. */
6964 /* Generate the default hash code for TYPE. This is designed for
6965 speed, rather than maximum entropy. */
6968 type_hash_canon_hash (tree type
)
6970 inchash::hash hstate
;
6972 hstate
.add_int (TREE_CODE (type
));
6974 if (TREE_TYPE (type
))
6975 hstate
.add_object (TYPE_HASH (TREE_TYPE (type
)));
6977 for (tree t
= TYPE_ATTRIBUTES (type
); t
; t
= TREE_CHAIN (t
))
6978 /* Just the identifier is adequate to distinguish. */
6979 hstate
.add_object (IDENTIFIER_HASH_VALUE (get_attribute_name (t
)));
6981 switch (TREE_CODE (type
))
6984 hstate
.add_object (TYPE_HASH (TYPE_METHOD_BASETYPE (type
)));
6987 for (tree t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
6988 if (TREE_VALUE (t
) != error_mark_node
)
6989 hstate
.add_object (TYPE_HASH (TREE_VALUE (t
)));
6993 hstate
.add_object (TYPE_HASH (TYPE_OFFSET_BASETYPE (type
)));
6998 if (TYPE_DOMAIN (type
))
6999 hstate
.add_object (TYPE_HASH (TYPE_DOMAIN (type
)));
7000 if (!AGGREGATE_TYPE_P (TREE_TYPE (type
)))
7002 unsigned typeless
= TYPE_TYPELESS_STORAGE (type
);
7003 hstate
.add_object (typeless
);
7010 tree t
= TYPE_MAX_VALUE (type
);
7012 t
= TYPE_MIN_VALUE (type
);
7013 for (int i
= 0; i
< TREE_INT_CST_NUNITS (t
); i
++)
7014 hstate
.add_object (TREE_INT_CST_ELT (t
, i
));
7019 case FIXED_POINT_TYPE
:
7021 unsigned prec
= TYPE_PRECISION (type
);
7022 hstate
.add_object (prec
);
7028 unsigned nunits
= TYPE_VECTOR_SUBPARTS (type
);
7029 hstate
.add_object (nunits
);
7037 return hstate
.end ();
7040 /* These are the Hashtable callback functions. */
7042 /* Returns true iff the types are equivalent. */
7045 type_cache_hasher::equal (type_hash
*a
, type_hash
*b
)
7047 /* First test the things that are the same for all types. */
7048 if (a
->hash
!= b
->hash
7049 || TREE_CODE (a
->type
) != TREE_CODE (b
->type
)
7050 || TREE_TYPE (a
->type
) != TREE_TYPE (b
->type
)
7051 || !attribute_list_equal (TYPE_ATTRIBUTES (a
->type
),
7052 TYPE_ATTRIBUTES (b
->type
))
7053 || (TREE_CODE (a
->type
) != COMPLEX_TYPE
7054 && TYPE_NAME (a
->type
) != TYPE_NAME (b
->type
)))
7057 /* Be careful about comparing arrays before and after the element type
7058 has been completed; don't compare TYPE_ALIGN unless both types are
7060 if (COMPLETE_TYPE_P (a
->type
) && COMPLETE_TYPE_P (b
->type
)
7061 && (TYPE_ALIGN (a
->type
) != TYPE_ALIGN (b
->type
)
7062 || TYPE_MODE (a
->type
) != TYPE_MODE (b
->type
)))
7065 switch (TREE_CODE (a
->type
))
7070 case REFERENCE_TYPE
:
7075 return TYPE_VECTOR_SUBPARTS (a
->type
) == TYPE_VECTOR_SUBPARTS (b
->type
);
7078 if (TYPE_VALUES (a
->type
) != TYPE_VALUES (b
->type
)
7079 && !(TYPE_VALUES (a
->type
)
7080 && TREE_CODE (TYPE_VALUES (a
->type
)) == TREE_LIST
7081 && TYPE_VALUES (b
->type
)
7082 && TREE_CODE (TYPE_VALUES (b
->type
)) == TREE_LIST
7083 && type_list_equal (TYPE_VALUES (a
->type
),
7084 TYPE_VALUES (b
->type
))))
7092 if (TYPE_PRECISION (a
->type
) != TYPE_PRECISION (b
->type
))
7094 return ((TYPE_MAX_VALUE (a
->type
) == TYPE_MAX_VALUE (b
->type
)
7095 || tree_int_cst_equal (TYPE_MAX_VALUE (a
->type
),
7096 TYPE_MAX_VALUE (b
->type
)))
7097 && (TYPE_MIN_VALUE (a
->type
) == TYPE_MIN_VALUE (b
->type
)
7098 || tree_int_cst_equal (TYPE_MIN_VALUE (a
->type
),
7099 TYPE_MIN_VALUE (b
->type
))));
7101 case FIXED_POINT_TYPE
:
7102 return TYPE_SATURATING (a
->type
) == TYPE_SATURATING (b
->type
);
7105 return TYPE_OFFSET_BASETYPE (a
->type
) == TYPE_OFFSET_BASETYPE (b
->type
);
7108 if (TYPE_METHOD_BASETYPE (a
->type
) == TYPE_METHOD_BASETYPE (b
->type
)
7109 && (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
7110 || (TYPE_ARG_TYPES (a
->type
)
7111 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
7112 && TYPE_ARG_TYPES (b
->type
)
7113 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
7114 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
7115 TYPE_ARG_TYPES (b
->type
)))))
7119 /* Don't compare TYPE_TYPELESS_STORAGE flag on aggregates,
7120 where the flag should be inherited from the element type
7121 and can change after ARRAY_TYPEs are created; on non-aggregates
7122 compare it and hash it, scalars will never have that flag set
7123 and we need to differentiate between arrays created by different
7124 front-ends or middle-end created arrays. */
7125 return (TYPE_DOMAIN (a
->type
) == TYPE_DOMAIN (b
->type
)
7126 && (AGGREGATE_TYPE_P (TREE_TYPE (a
->type
))
7127 || (TYPE_TYPELESS_STORAGE (a
->type
)
7128 == TYPE_TYPELESS_STORAGE (b
->type
))));
7132 case QUAL_UNION_TYPE
:
7133 return (TYPE_FIELDS (a
->type
) == TYPE_FIELDS (b
->type
)
7134 || (TYPE_FIELDS (a
->type
)
7135 && TREE_CODE (TYPE_FIELDS (a
->type
)) == TREE_LIST
7136 && TYPE_FIELDS (b
->type
)
7137 && TREE_CODE (TYPE_FIELDS (b
->type
)) == TREE_LIST
7138 && type_list_equal (TYPE_FIELDS (a
->type
),
7139 TYPE_FIELDS (b
->type
))));
7142 if (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
7143 || (TYPE_ARG_TYPES (a
->type
)
7144 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
7145 && TYPE_ARG_TYPES (b
->type
)
7146 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
7147 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
7148 TYPE_ARG_TYPES (b
->type
))))
7156 if (lang_hooks
.types
.type_hash_eq
!= NULL
)
7157 return lang_hooks
.types
.type_hash_eq (a
->type
, b
->type
);
7162 /* Given TYPE, and HASHCODE its hash code, return the canonical
7163 object for an identical type if one already exists.
7164 Otherwise, return TYPE, and record it as the canonical object.
7166 To use this function, first create a type of the sort you want.
7167 Then compute its hash code from the fields of the type that
7168 make it different from other similar types.
7169 Then call this function and use the value. */
7172 type_hash_canon (unsigned int hashcode
, tree type
)
7177 /* The hash table only contains main variants, so ensure that's what we're
7179 gcc_assert (TYPE_MAIN_VARIANT (type
) == type
);
7181 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
7182 must call that routine before comparing TYPE_ALIGNs. */
7188 loc
= type_hash_table
->find_slot_with_hash (&in
, hashcode
, INSERT
);
7191 tree t1
= ((type_hash
*) *loc
)->type
;
7192 gcc_assert (TYPE_MAIN_VARIANT (t1
) == t1
);
7193 if (TYPE_UID (type
) + 1 == next_type_uid
)
7195 /* Free also min/max values and the cache for integer
7196 types. This can't be done in free_node, as LTO frees
7197 those on its own. */
7198 if (TREE_CODE (type
) == INTEGER_TYPE
)
7200 if (TYPE_MIN_VALUE (type
)
7201 && TREE_TYPE (TYPE_MIN_VALUE (type
)) == type
)
7202 ggc_free (TYPE_MIN_VALUE (type
));
7203 if (TYPE_MAX_VALUE (type
)
7204 && TREE_TYPE (TYPE_MAX_VALUE (type
)) == type
)
7205 ggc_free (TYPE_MAX_VALUE (type
));
7206 if (TYPE_CACHED_VALUES_P (type
))
7207 ggc_free (TYPE_CACHED_VALUES (type
));
7214 struct type_hash
*h
;
7216 h
= ggc_alloc
<type_hash
> ();
7226 print_type_hash_statistics (void)
7228 fprintf (stderr
, "Type hash: size %ld, %ld elements, %f collisions\n",
7229 (long) type_hash_table
->size (),
7230 (long) type_hash_table
->elements (),
7231 type_hash_table
->collisions ());
7234 /* Given two lists of attributes, return true if list l2 is
7235 equivalent to l1. */
7238 attribute_list_equal (const_tree l1
, const_tree l2
)
7243 return attribute_list_contained (l1
, l2
)
7244 && attribute_list_contained (l2
, l1
);
7247 /* Given two lists of attributes, return true if list L2 is
7248 completely contained within L1. */
7249 /* ??? This would be faster if attribute names were stored in a canonicalized
7250 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
7251 must be used to show these elements are equivalent (which they are). */
7252 /* ??? It's not clear that attributes with arguments will always be handled
7256 attribute_list_contained (const_tree l1
, const_tree l2
)
7260 /* First check the obvious, maybe the lists are identical. */
7264 /* Maybe the lists are similar. */
7265 for (t1
= l1
, t2
= l2
;
7267 && get_attribute_name (t1
) == get_attribute_name (t2
)
7268 && TREE_VALUE (t1
) == TREE_VALUE (t2
);
7269 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
7272 /* Maybe the lists are equal. */
7273 if (t1
== 0 && t2
== 0)
7276 for (; t2
!= 0; t2
= TREE_CHAIN (t2
))
7279 /* This CONST_CAST is okay because lookup_attribute does not
7280 modify its argument and the return value is assigned to a
7282 for (attr
= lookup_ident_attribute (get_attribute_name (t2
),
7283 CONST_CAST_TREE (l1
));
7284 attr
!= NULL_TREE
&& !attribute_value_equal (t2
, attr
);
7285 attr
= lookup_ident_attribute (get_attribute_name (t2
),
7289 if (attr
== NULL_TREE
)
7296 /* Given two lists of types
7297 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
7298 return 1 if the lists contain the same types in the same order.
7299 Also, the TREE_PURPOSEs must match. */
7302 type_list_equal (const_tree l1
, const_tree l2
)
7306 for (t1
= l1
, t2
= l2
; t1
&& t2
; t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
7307 if (TREE_VALUE (t1
) != TREE_VALUE (t2
)
7308 || (TREE_PURPOSE (t1
) != TREE_PURPOSE (t2
)
7309 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
))
7310 && (TREE_TYPE (TREE_PURPOSE (t1
))
7311 == TREE_TYPE (TREE_PURPOSE (t2
))))))
7317 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
7318 given by TYPE. If the argument list accepts variable arguments,
7319 then this function counts only the ordinary arguments. */
7322 type_num_arguments (const_tree type
)
7327 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
7328 /* If the function does not take a variable number of arguments,
7329 the last element in the list will have type `void'. */
7330 if (VOID_TYPE_P (TREE_VALUE (t
)))
7338 /* Nonzero if integer constants T1 and T2
7339 represent the same constant value. */
7342 tree_int_cst_equal (const_tree t1
, const_tree t2
)
7347 if (t1
== 0 || t2
== 0)
7350 if (TREE_CODE (t1
) == INTEGER_CST
7351 && TREE_CODE (t2
) == INTEGER_CST
7352 && wi::to_widest (t1
) == wi::to_widest (t2
))
7358 /* Return true if T is an INTEGER_CST whose numerical value (extended
7359 according to TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. */
7362 tree_fits_shwi_p (const_tree t
)
7364 return (t
!= NULL_TREE
7365 && TREE_CODE (t
) == INTEGER_CST
7366 && wi::fits_shwi_p (wi::to_widest (t
)));
7369 /* Return true if T is an INTEGER_CST whose numerical value (extended
7370 according to TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. */
7373 tree_fits_uhwi_p (const_tree t
)
7375 return (t
!= NULL_TREE
7376 && TREE_CODE (t
) == INTEGER_CST
7377 && wi::fits_uhwi_p (wi::to_widest (t
)));
7380 /* T is an INTEGER_CST whose numerical value (extended according to
7381 TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. Return that
7385 tree_to_shwi (const_tree t
)
7387 gcc_assert (tree_fits_shwi_p (t
));
7388 return TREE_INT_CST_LOW (t
);
7391 /* T is an INTEGER_CST whose numerical value (extended according to
7392 TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. Return that
7395 unsigned HOST_WIDE_INT
7396 tree_to_uhwi (const_tree t
)
7398 gcc_assert (tree_fits_uhwi_p (t
));
7399 return TREE_INT_CST_LOW (t
);
7402 /* Return the most significant (sign) bit of T. */
7405 tree_int_cst_sign_bit (const_tree t
)
7407 unsigned bitno
= TYPE_PRECISION (TREE_TYPE (t
)) - 1;
7409 return wi::extract_uhwi (t
, bitno
, 1);
7412 /* Return an indication of the sign of the integer constant T.
7413 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
7414 Note that -1 will never be returned if T's type is unsigned. */
7417 tree_int_cst_sgn (const_tree t
)
7419 if (wi::eq_p (t
, 0))
7421 else if (TYPE_UNSIGNED (TREE_TYPE (t
)))
7423 else if (wi::neg_p (t
))
7429 /* Return the minimum number of bits needed to represent VALUE in a
7430 signed or unsigned type, UNSIGNEDP says which. */
7433 tree_int_cst_min_precision (tree value
, signop sgn
)
7435 /* If the value is negative, compute its negative minus 1. The latter
7436 adjustment is because the absolute value of the largest negative value
7437 is one larger than the largest positive value. This is equivalent to
7438 a bit-wise negation, so use that operation instead. */
7440 if (tree_int_cst_sgn (value
) < 0)
7441 value
= fold_build1 (BIT_NOT_EXPR
, TREE_TYPE (value
), value
);
7443 /* Return the number of bits needed, taking into account the fact
7444 that we need one more bit for a signed than unsigned type.
7445 If value is 0 or -1, the minimum precision is 1 no matter
7446 whether unsignedp is true or false. */
7448 if (integer_zerop (value
))
7451 return tree_floor_log2 (value
) + 1 + (sgn
== SIGNED
? 1 : 0) ;
7454 /* Return truthvalue of whether T1 is the same tree structure as T2.
7455 Return 1 if they are the same.
7456 Return 0 if they are understandably different.
7457 Return -1 if either contains tree structure not understood by
7461 simple_cst_equal (const_tree t1
, const_tree t2
)
7463 enum tree_code code1
, code2
;
7469 if (t1
== 0 || t2
== 0)
7472 code1
= TREE_CODE (t1
);
7473 code2
= TREE_CODE (t2
);
7475 if (CONVERT_EXPR_CODE_P (code1
) || code1
== NON_LVALUE_EXPR
)
7477 if (CONVERT_EXPR_CODE_P (code2
)
7478 || code2
== NON_LVALUE_EXPR
)
7479 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7481 return simple_cst_equal (TREE_OPERAND (t1
, 0), t2
);
7484 else if (CONVERT_EXPR_CODE_P (code2
)
7485 || code2
== NON_LVALUE_EXPR
)
7486 return simple_cst_equal (t1
, TREE_OPERAND (t2
, 0));
7494 return wi::to_widest (t1
) == wi::to_widest (t2
);
7497 return real_identical (&TREE_REAL_CST (t1
), &TREE_REAL_CST (t2
));
7500 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1
), TREE_FIXED_CST (t2
));
7503 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
7504 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
7505 TREE_STRING_LENGTH (t1
)));
7509 unsigned HOST_WIDE_INT idx
;
7510 vec
<constructor_elt
, va_gc
> *v1
= CONSTRUCTOR_ELTS (t1
);
7511 vec
<constructor_elt
, va_gc
> *v2
= CONSTRUCTOR_ELTS (t2
);
7513 if (vec_safe_length (v1
) != vec_safe_length (v2
))
7516 for (idx
= 0; idx
< vec_safe_length (v1
); ++idx
)
7517 /* ??? Should we handle also fields here? */
7518 if (!simple_cst_equal ((*v1
)[idx
].value
, (*v2
)[idx
].value
))
7524 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7527 cmp
= simple_cst_equal (CALL_EXPR_FN (t1
), CALL_EXPR_FN (t2
));
7530 if (call_expr_nargs (t1
) != call_expr_nargs (t2
))
7533 const_tree arg1
, arg2
;
7534 const_call_expr_arg_iterator iter1
, iter2
;
7535 for (arg1
= first_const_call_expr_arg (t1
, &iter1
),
7536 arg2
= first_const_call_expr_arg (t2
, &iter2
);
7538 arg1
= next_const_call_expr_arg (&iter1
),
7539 arg2
= next_const_call_expr_arg (&iter2
))
7541 cmp
= simple_cst_equal (arg1
, arg2
);
7545 return arg1
== arg2
;
7549 /* Special case: if either target is an unallocated VAR_DECL,
7550 it means that it's going to be unified with whatever the
7551 TARGET_EXPR is really supposed to initialize, so treat it
7552 as being equivalent to anything. */
7553 if ((TREE_CODE (TREE_OPERAND (t1
, 0)) == VAR_DECL
7554 && DECL_NAME (TREE_OPERAND (t1
, 0)) == NULL_TREE
7555 && !DECL_RTL_SET_P (TREE_OPERAND (t1
, 0)))
7556 || (TREE_CODE (TREE_OPERAND (t2
, 0)) == VAR_DECL
7557 && DECL_NAME (TREE_OPERAND (t2
, 0)) == NULL_TREE
7558 && !DECL_RTL_SET_P (TREE_OPERAND (t2
, 0))))
7561 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7566 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
7568 case WITH_CLEANUP_EXPR
:
7569 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7573 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t1
, 1));
7576 if (TREE_OPERAND (t1
, 1) == TREE_OPERAND (t2
, 1))
7577 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7591 /* This general rule works for most tree codes. All exceptions should be
7592 handled above. If this is a language-specific tree code, we can't
7593 trust what might be in the operand, so say we don't know
7595 if ((int) code1
>= (int) LAST_AND_UNUSED_TREE_CODE
)
7598 switch (TREE_CODE_CLASS (code1
))
7602 case tcc_comparison
:
7603 case tcc_expression
:
7607 for (i
= 0; i
< TREE_CODE_LENGTH (code1
); i
++)
7609 cmp
= simple_cst_equal (TREE_OPERAND (t1
, i
), TREE_OPERAND (t2
, i
));
7621 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
7622 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
7623 than U, respectively. */
7626 compare_tree_int (const_tree t
, unsigned HOST_WIDE_INT u
)
7628 if (tree_int_cst_sgn (t
) < 0)
7630 else if (!tree_fits_uhwi_p (t
))
7632 else if (TREE_INT_CST_LOW (t
) == u
)
7634 else if (TREE_INT_CST_LOW (t
) < u
)
7640 /* Return true if SIZE represents a constant size that is in bounds of
7641 what the middle-end and the backend accepts (covering not more than
7642 half of the address-space). */
7645 valid_constant_size_p (const_tree size
)
7647 if (! tree_fits_uhwi_p (size
)
7648 || TREE_OVERFLOW (size
)
7649 || tree_int_cst_sign_bit (size
) != 0)
7654 /* Return the precision of the type, or for a complex or vector type the
7655 precision of the type of its elements. */
7658 element_precision (const_tree type
)
7661 type
= TREE_TYPE (type
);
7662 enum tree_code code
= TREE_CODE (type
);
7663 if (code
== COMPLEX_TYPE
|| code
== VECTOR_TYPE
)
7664 type
= TREE_TYPE (type
);
7666 return TYPE_PRECISION (type
);
7669 /* Return true if CODE represents an associative tree code. Otherwise
7672 associative_tree_code (enum tree_code code
)
7691 /* Return true if CODE represents a commutative tree code. Otherwise
7694 commutative_tree_code (enum tree_code code
)
7700 case MULT_HIGHPART_EXPR
:
7708 case UNORDERED_EXPR
:
7712 case TRUTH_AND_EXPR
:
7713 case TRUTH_XOR_EXPR
:
7715 case WIDEN_MULT_EXPR
:
7716 case VEC_WIDEN_MULT_HI_EXPR
:
7717 case VEC_WIDEN_MULT_LO_EXPR
:
7718 case VEC_WIDEN_MULT_EVEN_EXPR
:
7719 case VEC_WIDEN_MULT_ODD_EXPR
:
7728 /* Return true if CODE represents a ternary tree code for which the
7729 first two operands are commutative. Otherwise return false. */
7731 commutative_ternary_tree_code (enum tree_code code
)
7735 case WIDEN_MULT_PLUS_EXPR
:
7736 case WIDEN_MULT_MINUS_EXPR
:
7747 /* Returns true if CODE can overflow. */
7750 operation_can_overflow (enum tree_code code
)
7758 /* Can overflow in various ways. */
7760 case TRUNC_DIV_EXPR
:
7761 case EXACT_DIV_EXPR
:
7762 case FLOOR_DIV_EXPR
:
7764 /* For INT_MIN / -1. */
7771 /* These operators cannot overflow. */
7776 /* Returns true if CODE operating on operands of type TYPE doesn't overflow, or
7777 ftrapv doesn't generate trapping insns for CODE. */
7780 operation_no_trapping_overflow (tree type
, enum tree_code code
)
7782 gcc_checking_assert (ANY_INTEGRAL_TYPE_P (type
));
7784 /* We don't generate instructions that trap on overflow for complex or vector
7786 if (!INTEGRAL_TYPE_P (type
))
7789 if (!TYPE_OVERFLOW_TRAPS (type
))
7799 /* These operators can overflow, and -ftrapv generates trapping code for
7802 case TRUNC_DIV_EXPR
:
7803 case EXACT_DIV_EXPR
:
7804 case FLOOR_DIV_EXPR
:
7807 /* These operators can overflow, but -ftrapv does not generate trapping
7811 /* These operators cannot overflow. */
7819 /* Generate a hash value for an expression. This can be used iteratively
7820 by passing a previous result as the HSTATE argument.
7822 This function is intended to produce the same hash for expressions which
7823 would compare equal using operand_equal_p. */
7825 add_expr (const_tree t
, inchash::hash
&hstate
, unsigned int flags
)
7828 enum tree_code code
;
7829 enum tree_code_class tclass
;
7831 if (t
== NULL_TREE
|| t
== error_mark_node
)
7833 hstate
.merge_hash (0);
7837 if (!(flags
& OEP_ADDRESS_OF
))
7840 code
= TREE_CODE (t
);
7844 /* Alas, constants aren't shared, so we can't rely on pointer
7847 hstate
.merge_hash (0);
7850 gcc_checking_assert (!(flags
& OEP_ADDRESS_OF
));
7851 for (i
= 0; i
< TREE_INT_CST_EXT_NUNITS (t
); i
++)
7852 hstate
.add_wide_int (TREE_INT_CST_ELT (t
, i
));
7857 if (!HONOR_SIGNED_ZEROS (t
) && real_zerop (t
))
7860 val2
= real_hash (TREE_REAL_CST_PTR (t
));
7861 hstate
.merge_hash (val2
);
7866 unsigned int val2
= fixed_hash (TREE_FIXED_CST_PTR (t
));
7867 hstate
.merge_hash (val2
);
7871 hstate
.add ((const void *) TREE_STRING_POINTER (t
),
7872 TREE_STRING_LENGTH (t
));
7875 inchash::add_expr (TREE_REALPART (t
), hstate
, flags
);
7876 inchash::add_expr (TREE_IMAGPART (t
), hstate
, flags
);
7881 for (i
= 0; i
< VECTOR_CST_NELTS (t
); ++i
)
7882 inchash::add_expr (VECTOR_CST_ELT (t
, i
), hstate
, flags
);
7886 /* We can just compare by pointer. */
7887 hstate
.add_wide_int (SSA_NAME_VERSION (t
));
7889 case PLACEHOLDER_EXPR
:
7890 /* The node itself doesn't matter. */
7897 /* A list of expressions, for a CALL_EXPR or as the elements of a
7899 for (; t
; t
= TREE_CHAIN (t
))
7900 inchash::add_expr (TREE_VALUE (t
), hstate
, flags
);
7904 unsigned HOST_WIDE_INT idx
;
7906 flags
&= ~OEP_ADDRESS_OF
;
7907 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t
), idx
, field
, value
)
7909 inchash::add_expr (field
, hstate
, flags
);
7910 inchash::add_expr (value
, hstate
, flags
);
7914 case STATEMENT_LIST
:
7916 tree_stmt_iterator i
;
7917 for (i
= tsi_start (CONST_CAST_TREE (t
));
7918 !tsi_end_p (i
); tsi_next (&i
))
7919 inchash::add_expr (tsi_stmt (i
), hstate
, flags
);
7923 for (i
= 0; i
< TREE_VEC_LENGTH (t
); ++i
)
7924 inchash::add_expr (TREE_VEC_ELT (t
, i
), hstate
, flags
);
7927 /* When referring to a built-in FUNCTION_DECL, use the __builtin__ form.
7928 Otherwise nodes that compare equal according to operand_equal_p might
7929 get different hash codes. However, don't do this for machine specific
7930 or front end builtins, since the function code is overloaded in those
7932 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
7933 && builtin_decl_explicit_p (DECL_FUNCTION_CODE (t
)))
7935 t
= builtin_decl_explicit (DECL_FUNCTION_CODE (t
));
7936 code
= TREE_CODE (t
);
7940 tclass
= TREE_CODE_CLASS (code
);
7942 if (tclass
== tcc_declaration
)
7944 /* DECL's have a unique ID */
7945 hstate
.add_wide_int (DECL_UID (t
));
7947 else if (tclass
== tcc_comparison
&& !commutative_tree_code (code
))
7949 /* For comparisons that can be swapped, use the lower
7951 enum tree_code ccode
= swap_tree_comparison (code
);
7954 hstate
.add_object (ccode
);
7955 inchash::add_expr (TREE_OPERAND (t
, ccode
!= code
), hstate
, flags
);
7956 inchash::add_expr (TREE_OPERAND (t
, ccode
== code
), hstate
, flags
);
7958 else if (CONVERT_EXPR_CODE_P (code
))
7960 /* NOP_EXPR and CONVERT_EXPR are considered equal by
7962 enum tree_code ccode
= NOP_EXPR
;
7963 hstate
.add_object (ccode
);
7965 /* Don't hash the type, that can lead to having nodes which
7966 compare equal according to operand_equal_p, but which
7967 have different hash codes. Make sure to include signedness
7968 in the hash computation. */
7969 hstate
.add_int (TYPE_UNSIGNED (TREE_TYPE (t
)));
7970 inchash::add_expr (TREE_OPERAND (t
, 0), hstate
, flags
);
7972 /* For OEP_ADDRESS_OF, hash MEM_EXPR[&decl, 0] the same as decl. */
7973 else if (code
== MEM_REF
7974 && (flags
& OEP_ADDRESS_OF
) != 0
7975 && TREE_CODE (TREE_OPERAND (t
, 0)) == ADDR_EXPR
7976 && DECL_P (TREE_OPERAND (TREE_OPERAND (t
, 0), 0))
7977 && integer_zerop (TREE_OPERAND (t
, 1)))
7978 inchash::add_expr (TREE_OPERAND (TREE_OPERAND (t
, 0), 0),
7980 /* Don't ICE on FE specific trees, or their arguments etc.
7981 during operand_equal_p hash verification. */
7982 else if (!IS_EXPR_CODE_CLASS (tclass
))
7983 gcc_assert (flags
& OEP_HASH_CHECK
);
7986 unsigned int sflags
= flags
;
7988 hstate
.add_object (code
);
7993 gcc_checking_assert (!(flags
& OEP_ADDRESS_OF
));
7994 flags
|= OEP_ADDRESS_OF
;
8000 case TARGET_MEM_REF
:
8001 flags
&= ~OEP_ADDRESS_OF
;
8006 case ARRAY_RANGE_REF
:
8009 sflags
&= ~OEP_ADDRESS_OF
;
8013 flags
&= ~OEP_ADDRESS_OF
;
8017 case WIDEN_MULT_PLUS_EXPR
:
8018 case WIDEN_MULT_MINUS_EXPR
:
8020 /* The multiplication operands are commutative. */
8021 inchash::hash one
, two
;
8022 inchash::add_expr (TREE_OPERAND (t
, 0), one
, flags
);
8023 inchash::add_expr (TREE_OPERAND (t
, 1), two
, flags
);
8024 hstate
.add_commutative (one
, two
);
8025 inchash::add_expr (TREE_OPERAND (t
, 2), two
, flags
);
8030 if (CALL_EXPR_FN (t
) == NULL_TREE
)
8031 hstate
.add_int (CALL_EXPR_IFN (t
));
8035 /* For TARGET_EXPR, just hash on the TARGET_EXPR_SLOT.
8036 Usually different TARGET_EXPRs just should use
8037 different temporaries in their slots. */
8038 inchash::add_expr (TARGET_EXPR_SLOT (t
), hstate
, flags
);
8045 /* Don't hash the type, that can lead to having nodes which
8046 compare equal according to operand_equal_p, but which
8047 have different hash codes. */
8048 if (code
== NON_LVALUE_EXPR
)
8050 /* Make sure to include signness in the hash computation. */
8051 hstate
.add_int (TYPE_UNSIGNED (TREE_TYPE (t
)));
8052 inchash::add_expr (TREE_OPERAND (t
, 0), hstate
, flags
);
8055 else if (commutative_tree_code (code
))
8057 /* It's a commutative expression. We want to hash it the same
8058 however it appears. We do this by first hashing both operands
8059 and then rehashing based on the order of their independent
8061 inchash::hash one
, two
;
8062 inchash::add_expr (TREE_OPERAND (t
, 0), one
, flags
);
8063 inchash::add_expr (TREE_OPERAND (t
, 1), two
, flags
);
8064 hstate
.add_commutative (one
, two
);
8067 for (i
= TREE_OPERAND_LENGTH (t
) - 1; i
>= 0; --i
)
8068 inchash::add_expr (TREE_OPERAND (t
, i
), hstate
,
8069 i
== 0 ? flags
: sflags
);
8077 /* Constructors for pointer, array and function types.
8078 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
8079 constructed by language-dependent code, not here.) */
8081 /* Construct, lay out and return the type of pointers to TO_TYPE with
8082 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
8083 reference all of memory. If such a type has already been
8084 constructed, reuse it. */
8087 build_pointer_type_for_mode (tree to_type
, machine_mode mode
,
8091 bool could_alias
= can_alias_all
;
8093 if (to_type
== error_mark_node
)
8094 return error_mark_node
;
8096 /* If the pointed-to type has the may_alias attribute set, force
8097 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
8098 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
8099 can_alias_all
= true;
8101 /* In some cases, languages will have things that aren't a POINTER_TYPE
8102 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
8103 In that case, return that type without regard to the rest of our
8106 ??? This is a kludge, but consistent with the way this function has
8107 always operated and there doesn't seem to be a good way to avoid this
8109 if (TYPE_POINTER_TO (to_type
) != 0
8110 && TREE_CODE (TYPE_POINTER_TO (to_type
)) != POINTER_TYPE
)
8111 return TYPE_POINTER_TO (to_type
);
8113 /* First, if we already have a type for pointers to TO_TYPE and it's
8114 the proper mode, use it. */
8115 for (t
= TYPE_POINTER_TO (to_type
); t
; t
= TYPE_NEXT_PTR_TO (t
))
8116 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
8119 t
= make_node (POINTER_TYPE
);
8121 TREE_TYPE (t
) = to_type
;
8122 SET_TYPE_MODE (t
, mode
);
8123 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
8124 TYPE_NEXT_PTR_TO (t
) = TYPE_POINTER_TO (to_type
);
8125 TYPE_POINTER_TO (to_type
) = t
;
8127 /* During LTO we do not set TYPE_CANONICAL of pointers and references. */
8128 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
) || in_lto_p
)
8129 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8130 else if (TYPE_CANONICAL (to_type
) != to_type
|| could_alias
)
8132 = build_pointer_type_for_mode (TYPE_CANONICAL (to_type
),
8135 /* Lay out the type. This function has many callers that are concerned
8136 with expression-construction, and this simplifies them all. */
8142 /* By default build pointers in ptr_mode. */
8145 build_pointer_type (tree to_type
)
8147 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
8148 : TYPE_ADDR_SPACE (to_type
);
8149 machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
8150 return build_pointer_type_for_mode (to_type
, pointer_mode
, false);
8153 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
8156 build_reference_type_for_mode (tree to_type
, machine_mode mode
,
8160 bool could_alias
= can_alias_all
;
8162 if (to_type
== error_mark_node
)
8163 return error_mark_node
;
8165 /* If the pointed-to type has the may_alias attribute set, force
8166 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
8167 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
8168 can_alias_all
= true;
8170 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
8171 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
8172 In that case, return that type without regard to the rest of our
8175 ??? This is a kludge, but consistent with the way this function has
8176 always operated and there doesn't seem to be a good way to avoid this
8178 if (TYPE_REFERENCE_TO (to_type
) != 0
8179 && TREE_CODE (TYPE_REFERENCE_TO (to_type
)) != REFERENCE_TYPE
)
8180 return TYPE_REFERENCE_TO (to_type
);
8182 /* First, if we already have a type for pointers to TO_TYPE and it's
8183 the proper mode, use it. */
8184 for (t
= TYPE_REFERENCE_TO (to_type
); t
; t
= TYPE_NEXT_REF_TO (t
))
8185 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
8188 t
= make_node (REFERENCE_TYPE
);
8190 TREE_TYPE (t
) = to_type
;
8191 SET_TYPE_MODE (t
, mode
);
8192 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
8193 TYPE_NEXT_REF_TO (t
) = TYPE_REFERENCE_TO (to_type
);
8194 TYPE_REFERENCE_TO (to_type
) = t
;
8196 /* During LTO we do not set TYPE_CANONICAL of pointers and references. */
8197 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
) || in_lto_p
)
8198 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8199 else if (TYPE_CANONICAL (to_type
) != to_type
|| could_alias
)
8201 = build_reference_type_for_mode (TYPE_CANONICAL (to_type
),
8210 /* Build the node for the type of references-to-TO_TYPE by default
8214 build_reference_type (tree to_type
)
8216 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
8217 : TYPE_ADDR_SPACE (to_type
);
8218 machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
8219 return build_reference_type_for_mode (to_type
, pointer_mode
, false);
8222 #define MAX_INT_CACHED_PREC \
8223 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
8224 static GTY(()) tree nonstandard_integer_type_cache
[2 * MAX_INT_CACHED_PREC
+ 2];
8226 /* Builds a signed or unsigned integer type of precision PRECISION.
8227 Used for C bitfields whose precision does not match that of
8228 built-in target types. */
8230 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision
,
8236 unsignedp
= MAX_INT_CACHED_PREC
+ 1;
8238 if (precision
<= MAX_INT_CACHED_PREC
)
8240 itype
= nonstandard_integer_type_cache
[precision
+ unsignedp
];
8245 itype
= make_node (INTEGER_TYPE
);
8246 TYPE_PRECISION (itype
) = precision
;
8249 fixup_unsigned_type (itype
);
8251 fixup_signed_type (itype
);
8254 if (tree_fits_uhwi_p (TYPE_MAX_VALUE (itype
)))
8255 ret
= type_hash_canon (tree_to_uhwi (TYPE_MAX_VALUE (itype
)), itype
);
8256 if (precision
<= MAX_INT_CACHED_PREC
)
8257 nonstandard_integer_type_cache
[precision
+ unsignedp
] = ret
;
8262 #define MAX_BOOL_CACHED_PREC \
8263 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
8264 static GTY(()) tree nonstandard_boolean_type_cache
[MAX_BOOL_CACHED_PREC
+ 1];
8266 /* Builds a boolean type of precision PRECISION.
8267 Used for boolean vectors to choose proper vector element size. */
8269 build_nonstandard_boolean_type (unsigned HOST_WIDE_INT precision
)
8273 if (precision
<= MAX_BOOL_CACHED_PREC
)
8275 type
= nonstandard_boolean_type_cache
[precision
];
8280 type
= make_node (BOOLEAN_TYPE
);
8281 TYPE_PRECISION (type
) = precision
;
8282 fixup_signed_type (type
);
8284 if (precision
<= MAX_INT_CACHED_PREC
)
8285 nonstandard_boolean_type_cache
[precision
] = type
;
8290 /* Create a range of some discrete type TYPE (an INTEGER_TYPE, ENUMERAL_TYPE
8291 or BOOLEAN_TYPE) with low bound LOWVAL and high bound HIGHVAL. If SHARED
8292 is true, reuse such a type that has already been constructed. */
8295 build_range_type_1 (tree type
, tree lowval
, tree highval
, bool shared
)
8297 tree itype
= make_node (INTEGER_TYPE
);
8299 TREE_TYPE (itype
) = type
;
8301 TYPE_MIN_VALUE (itype
) = fold_convert (type
, lowval
);
8302 TYPE_MAX_VALUE (itype
) = highval
? fold_convert (type
, highval
) : NULL
;
8304 TYPE_PRECISION (itype
) = TYPE_PRECISION (type
);
8305 SET_TYPE_MODE (itype
, TYPE_MODE (type
));
8306 TYPE_SIZE (itype
) = TYPE_SIZE (type
);
8307 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (type
);
8308 SET_TYPE_ALIGN (itype
, TYPE_ALIGN (type
));
8309 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (type
);
8314 if ((TYPE_MIN_VALUE (itype
)
8315 && TREE_CODE (TYPE_MIN_VALUE (itype
)) != INTEGER_CST
)
8316 || (TYPE_MAX_VALUE (itype
)
8317 && TREE_CODE (TYPE_MAX_VALUE (itype
)) != INTEGER_CST
))
8319 /* Since we cannot reliably merge this type, we need to compare it using
8320 structural equality checks. */
8321 SET_TYPE_STRUCTURAL_EQUALITY (itype
);
8325 hashval_t hash
= type_hash_canon_hash (itype
);
8326 itype
= type_hash_canon (hash
, itype
);
8331 /* Wrapper around build_range_type_1 with SHARED set to true. */
8334 build_range_type (tree type
, tree lowval
, tree highval
)
8336 return build_range_type_1 (type
, lowval
, highval
, true);
8339 /* Wrapper around build_range_type_1 with SHARED set to false. */
8342 build_nonshared_range_type (tree type
, tree lowval
, tree highval
)
8344 return build_range_type_1 (type
, lowval
, highval
, false);
8347 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
8348 MAXVAL should be the maximum value in the domain
8349 (one less than the length of the array).
8351 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
8352 We don't enforce this limit, that is up to caller (e.g. language front end).
8353 The limit exists because the result is a signed type and we don't handle
8354 sizes that use more than one HOST_WIDE_INT. */
8357 build_index_type (tree maxval
)
8359 return build_range_type (sizetype
, size_zero_node
, maxval
);
8362 /* Return true if the debug information for TYPE, a subtype, should be emitted
8363 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
8364 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
8365 debug info and doesn't reflect the source code. */
8368 subrange_type_for_debug_p (const_tree type
, tree
*lowval
, tree
*highval
)
8370 tree base_type
= TREE_TYPE (type
), low
, high
;
8372 /* Subrange types have a base type which is an integral type. */
8373 if (!INTEGRAL_TYPE_P (base_type
))
8376 /* Get the real bounds of the subtype. */
8377 if (lang_hooks
.types
.get_subrange_bounds
)
8378 lang_hooks
.types
.get_subrange_bounds (type
, &low
, &high
);
8381 low
= TYPE_MIN_VALUE (type
);
8382 high
= TYPE_MAX_VALUE (type
);
8385 /* If the type and its base type have the same representation and the same
8386 name, then the type is not a subrange but a copy of the base type. */
8387 if ((TREE_CODE (base_type
) == INTEGER_TYPE
8388 || TREE_CODE (base_type
) == BOOLEAN_TYPE
)
8389 && int_size_in_bytes (type
) == int_size_in_bytes (base_type
)
8390 && tree_int_cst_equal (low
, TYPE_MIN_VALUE (base_type
))
8391 && tree_int_cst_equal (high
, TYPE_MAX_VALUE (base_type
))
8392 && TYPE_IDENTIFIER (type
) == TYPE_IDENTIFIER (base_type
))
8402 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
8403 and number of elements specified by the range of values of INDEX_TYPE.
8404 If TYPELESS_STORAGE is true, TYPE_TYPELESS_STORAGE flag is set on the type.
8405 If SHARED is true, reuse such a type that has already been constructed. */
8408 build_array_type_1 (tree elt_type
, tree index_type
, bool typeless_storage
,
8413 if (TREE_CODE (elt_type
) == FUNCTION_TYPE
)
8415 error ("arrays of functions are not meaningful");
8416 elt_type
= integer_type_node
;
8419 t
= make_node (ARRAY_TYPE
);
8420 TREE_TYPE (t
) = elt_type
;
8421 TYPE_DOMAIN (t
) = index_type
;
8422 TYPE_ADDR_SPACE (t
) = TYPE_ADDR_SPACE (elt_type
);
8423 TYPE_TYPELESS_STORAGE (t
) = typeless_storage
;
8426 /* If the element type is incomplete at this point we get marked for
8427 structural equality. Do not record these types in the canonical
8429 if (TYPE_STRUCTURAL_EQUALITY_P (t
))
8434 hashval_t hash
= type_hash_canon_hash (t
);
8435 t
= type_hash_canon (hash
, t
);
8438 if (TYPE_CANONICAL (t
) == t
)
8440 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type
)
8441 || (index_type
&& TYPE_STRUCTURAL_EQUALITY_P (index_type
))
8443 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8444 else if (TYPE_CANONICAL (elt_type
) != elt_type
8445 || (index_type
&& TYPE_CANONICAL (index_type
) != index_type
))
8447 = build_array_type_1 (TYPE_CANONICAL (elt_type
),
8449 ? TYPE_CANONICAL (index_type
) : NULL_TREE
,
8450 typeless_storage
, shared
);
8456 /* Wrapper around build_array_type_1 with SHARED set to true. */
8459 build_array_type (tree elt_type
, tree index_type
, bool typeless_storage
)
8461 return build_array_type_1 (elt_type
, index_type
, typeless_storage
, true);
8464 /* Wrapper around build_array_type_1 with SHARED set to false. */
8467 build_nonshared_array_type (tree elt_type
, tree index_type
)
8469 return build_array_type_1 (elt_type
, index_type
, false, false);
8472 /* Return a representation of ELT_TYPE[NELTS], using indices of type
8476 build_array_type_nelts (tree elt_type
, unsigned HOST_WIDE_INT nelts
)
8478 return build_array_type (elt_type
, build_index_type (size_int (nelts
- 1)));
8481 /* Recursively examines the array elements of TYPE, until a non-array
8482 element type is found. */
8485 strip_array_types (tree type
)
8487 while (TREE_CODE (type
) == ARRAY_TYPE
)
8488 type
= TREE_TYPE (type
);
8493 /* Computes the canonical argument types from the argument type list
8496 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
8497 on entry to this function, or if any of the ARGTYPES are
8500 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
8501 true on entry to this function, or if any of the ARGTYPES are
8504 Returns a canonical argument list, which may be ARGTYPES when the
8505 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
8506 true) or would not differ from ARGTYPES. */
8509 maybe_canonicalize_argtypes (tree argtypes
,
8510 bool *any_structural_p
,
8511 bool *any_noncanonical_p
)
8514 bool any_noncanonical_argtypes_p
= false;
8516 for (arg
= argtypes
; arg
&& !(*any_structural_p
); arg
= TREE_CHAIN (arg
))
8518 if (!TREE_VALUE (arg
) || TREE_VALUE (arg
) == error_mark_node
)
8519 /* Fail gracefully by stating that the type is structural. */
8520 *any_structural_p
= true;
8521 else if (TYPE_STRUCTURAL_EQUALITY_P (TREE_VALUE (arg
)))
8522 *any_structural_p
= true;
8523 else if (TYPE_CANONICAL (TREE_VALUE (arg
)) != TREE_VALUE (arg
)
8524 || TREE_PURPOSE (arg
))
8525 /* If the argument has a default argument, we consider it
8526 non-canonical even though the type itself is canonical.
8527 That way, different variants of function and method types
8528 with default arguments will all point to the variant with
8529 no defaults as their canonical type. */
8530 any_noncanonical_argtypes_p
= true;
8533 if (*any_structural_p
)
8536 if (any_noncanonical_argtypes_p
)
8538 /* Build the canonical list of argument types. */
8539 tree canon_argtypes
= NULL_TREE
;
8540 bool is_void
= false;
8542 for (arg
= argtypes
; arg
; arg
= TREE_CHAIN (arg
))
8544 if (arg
== void_list_node
)
8547 canon_argtypes
= tree_cons (NULL_TREE
,
8548 TYPE_CANONICAL (TREE_VALUE (arg
)),
8552 canon_argtypes
= nreverse (canon_argtypes
);
8554 canon_argtypes
= chainon (canon_argtypes
, void_list_node
);
8556 /* There is a non-canonical type. */
8557 *any_noncanonical_p
= true;
8558 return canon_argtypes
;
8561 /* The canonical argument types are the same as ARGTYPES. */
8565 /* Construct, lay out and return
8566 the type of functions returning type VALUE_TYPE
8567 given arguments of types ARG_TYPES.
8568 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
8569 are data type nodes for the arguments of the function.
8570 If such a type has already been constructed, reuse it. */
8573 build_function_type (tree value_type
, tree arg_types
)
8576 inchash::hash hstate
;
8577 bool any_structural_p
, any_noncanonical_p
;
8578 tree canon_argtypes
;
8580 if (TREE_CODE (value_type
) == FUNCTION_TYPE
)
8582 error ("function return type cannot be function");
8583 value_type
= integer_type_node
;
8586 /* Make a node of the sort we want. */
8587 t
= make_node (FUNCTION_TYPE
);
8588 TREE_TYPE (t
) = value_type
;
8589 TYPE_ARG_TYPES (t
) = arg_types
;
8591 /* If we already have such a type, use the old one. */
8592 hashval_t hash
= type_hash_canon_hash (t
);
8593 t
= type_hash_canon (hash
, t
);
8595 /* Set up the canonical type. */
8596 any_structural_p
= TYPE_STRUCTURAL_EQUALITY_P (value_type
);
8597 any_noncanonical_p
= TYPE_CANONICAL (value_type
) != value_type
;
8598 canon_argtypes
= maybe_canonicalize_argtypes (arg_types
,
8600 &any_noncanonical_p
);
8601 if (any_structural_p
)
8602 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8603 else if (any_noncanonical_p
)
8604 TYPE_CANONICAL (t
) = build_function_type (TYPE_CANONICAL (value_type
),
8607 if (!COMPLETE_TYPE_P (t
))
8612 /* Build a function type. The RETURN_TYPE is the type returned by the
8613 function. If VAARGS is set, no void_type_node is appended to the
8614 list. ARGP must be always be terminated be a NULL_TREE. */
8617 build_function_type_list_1 (bool vaargs
, tree return_type
, va_list argp
)
8621 t
= va_arg (argp
, tree
);
8622 for (args
= NULL_TREE
; t
!= NULL_TREE
; t
= va_arg (argp
, tree
))
8623 args
= tree_cons (NULL_TREE
, t
, args
);
8628 if (args
!= NULL_TREE
)
8629 args
= nreverse (args
);
8630 gcc_assert (last
!= void_list_node
);
8632 else if (args
== NULL_TREE
)
8633 args
= void_list_node
;
8637 args
= nreverse (args
);
8638 TREE_CHAIN (last
) = void_list_node
;
8640 args
= build_function_type (return_type
, args
);
8645 /* Build a function type. The RETURN_TYPE is the type returned by the
8646 function. If additional arguments are provided, they are
8647 additional argument types. The list of argument types must always
8648 be terminated by NULL_TREE. */
8651 build_function_type_list (tree return_type
, ...)
8656 va_start (p
, return_type
);
8657 args
= build_function_type_list_1 (false, return_type
, p
);
8662 /* Build a variable argument function type. The RETURN_TYPE is the
8663 type returned by the function. If additional arguments are provided,
8664 they are additional argument types. The list of argument types must
8665 always be terminated by NULL_TREE. */
8668 build_varargs_function_type_list (tree return_type
, ...)
8673 va_start (p
, return_type
);
8674 args
= build_function_type_list_1 (true, return_type
, p
);
8680 /* Build a function type. RETURN_TYPE is the type returned by the
8681 function; VAARGS indicates whether the function takes varargs. The
8682 function takes N named arguments, the types of which are provided in
8686 build_function_type_array_1 (bool vaargs
, tree return_type
, int n
,
8690 tree t
= vaargs
? NULL_TREE
: void_list_node
;
8692 for (i
= n
- 1; i
>= 0; i
--)
8693 t
= tree_cons (NULL_TREE
, arg_types
[i
], t
);
8695 return build_function_type (return_type
, t
);
8698 /* Build a function type. RETURN_TYPE is the type returned by the
8699 function. The function takes N named arguments, the types of which
8700 are provided in ARG_TYPES. */
8703 build_function_type_array (tree return_type
, int n
, tree
*arg_types
)
8705 return build_function_type_array_1 (false, return_type
, n
, arg_types
);
8708 /* Build a variable argument function type. RETURN_TYPE is the type
8709 returned by the function. The function takes N named arguments, the
8710 types of which are provided in ARG_TYPES. */
8713 build_varargs_function_type_array (tree return_type
, int n
, tree
*arg_types
)
8715 return build_function_type_array_1 (true, return_type
, n
, arg_types
);
8718 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
8719 and ARGTYPES (a TREE_LIST) are the return type and arguments types
8720 for the method. An implicit additional parameter (of type
8721 pointer-to-BASETYPE) is added to the ARGTYPES. */
8724 build_method_type_directly (tree basetype
,
8730 bool any_structural_p
, any_noncanonical_p
;
8731 tree canon_argtypes
;
8733 /* Make a node of the sort we want. */
8734 t
= make_node (METHOD_TYPE
);
8736 TYPE_METHOD_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
8737 TREE_TYPE (t
) = rettype
;
8738 ptype
= build_pointer_type (basetype
);
8740 /* The actual arglist for this function includes a "hidden" argument
8741 which is "this". Put it into the list of argument types. */
8742 argtypes
= tree_cons (NULL_TREE
, ptype
, argtypes
);
8743 TYPE_ARG_TYPES (t
) = argtypes
;
8745 /* If we already have such a type, use the old one. */
8746 hashval_t hash
= type_hash_canon_hash (t
);
8747 t
= type_hash_canon (hash
, t
);
8749 /* Set up the canonical type. */
8751 = (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
8752 || TYPE_STRUCTURAL_EQUALITY_P (rettype
));
8754 = (TYPE_CANONICAL (basetype
) != basetype
8755 || TYPE_CANONICAL (rettype
) != rettype
);
8756 canon_argtypes
= maybe_canonicalize_argtypes (TREE_CHAIN (argtypes
),
8758 &any_noncanonical_p
);
8759 if (any_structural_p
)
8760 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8761 else if (any_noncanonical_p
)
8763 = build_method_type_directly (TYPE_CANONICAL (basetype
),
8764 TYPE_CANONICAL (rettype
),
8766 if (!COMPLETE_TYPE_P (t
))
8772 /* Construct, lay out and return the type of methods belonging to class
8773 BASETYPE and whose arguments and values are described by TYPE.
8774 If that type exists already, reuse it.
8775 TYPE must be a FUNCTION_TYPE node. */
8778 build_method_type (tree basetype
, tree type
)
8780 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
8782 return build_method_type_directly (basetype
,
8784 TYPE_ARG_TYPES (type
));
8787 /* Construct, lay out and return the type of offsets to a value
8788 of type TYPE, within an object of type BASETYPE.
8789 If a suitable offset type exists already, reuse it. */
8792 build_offset_type (tree basetype
, tree type
)
8796 /* Make a node of the sort we want. */
8797 t
= make_node (OFFSET_TYPE
);
8799 TYPE_OFFSET_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
8800 TREE_TYPE (t
) = type
;
8802 /* If we already have such a type, use the old one. */
8803 hashval_t hash
= type_hash_canon_hash (t
);
8804 t
= type_hash_canon (hash
, t
);
8806 if (!COMPLETE_TYPE_P (t
))
8809 if (TYPE_CANONICAL (t
) == t
)
8811 if (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
8812 || TYPE_STRUCTURAL_EQUALITY_P (type
))
8813 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8814 else if (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)) != basetype
8815 || TYPE_CANONICAL (type
) != type
)
8817 = build_offset_type (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)),
8818 TYPE_CANONICAL (type
));
8824 /* Create a complex type whose components are COMPONENT_TYPE.
8826 If NAMED is true, the type is given a TYPE_NAME. We do not always
8827 do so because this creates a DECL node and thus make the DECL_UIDs
8828 dependent on the type canonicalization hashtable, which is GC-ed,
8829 so the DECL_UIDs would not be stable wrt garbage collection. */
8832 build_complex_type (tree component_type
, bool named
)
8836 gcc_assert (INTEGRAL_TYPE_P (component_type
)
8837 || SCALAR_FLOAT_TYPE_P (component_type
)
8838 || FIXED_POINT_TYPE_P (component_type
));
8840 /* Make a node of the sort we want. */
8841 t
= make_node (COMPLEX_TYPE
);
8843 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (component_type
);
8845 /* If we already have such a type, use the old one. */
8846 hashval_t hash
= type_hash_canon_hash (t
);
8847 t
= type_hash_canon (hash
, t
);
8849 if (!COMPLETE_TYPE_P (t
))
8852 if (TYPE_CANONICAL (t
) == t
)
8854 if (TYPE_STRUCTURAL_EQUALITY_P (component_type
))
8855 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8856 else if (TYPE_CANONICAL (component_type
) != component_type
)
8858 = build_complex_type (TYPE_CANONICAL (component_type
), named
);
8861 /* We need to create a name, since complex is a fundamental type. */
8862 if (!TYPE_NAME (t
) && named
)
8865 if (component_type
== char_type_node
)
8866 name
= "complex char";
8867 else if (component_type
== signed_char_type_node
)
8868 name
= "complex signed char";
8869 else if (component_type
== unsigned_char_type_node
)
8870 name
= "complex unsigned char";
8871 else if (component_type
== short_integer_type_node
)
8872 name
= "complex short int";
8873 else if (component_type
== short_unsigned_type_node
)
8874 name
= "complex short unsigned int";
8875 else if (component_type
== integer_type_node
)
8876 name
= "complex int";
8877 else if (component_type
== unsigned_type_node
)
8878 name
= "complex unsigned int";
8879 else if (component_type
== long_integer_type_node
)
8880 name
= "complex long int";
8881 else if (component_type
== long_unsigned_type_node
)
8882 name
= "complex long unsigned int";
8883 else if (component_type
== long_long_integer_type_node
)
8884 name
= "complex long long int";
8885 else if (component_type
== long_long_unsigned_type_node
)
8886 name
= "complex long long unsigned int";
8891 TYPE_NAME (t
) = build_decl (UNKNOWN_LOCATION
, TYPE_DECL
,
8892 get_identifier (name
), t
);
8895 return build_qualified_type (t
, TYPE_QUALS (component_type
));
8898 /* If TYPE is a real or complex floating-point type and the target
8899 does not directly support arithmetic on TYPE then return the wider
8900 type to be used for arithmetic on TYPE. Otherwise, return
8904 excess_precision_type (tree type
)
8906 /* The target can give two different responses to the question of
8907 which excess precision mode it would like depending on whether we
8908 are in -fexcess-precision=standard or -fexcess-precision=fast. */
8910 enum excess_precision_type requested_type
8911 = (flag_excess_precision
== EXCESS_PRECISION_FAST
8912 ? EXCESS_PRECISION_TYPE_FAST
8913 : EXCESS_PRECISION_TYPE_STANDARD
);
8915 enum flt_eval_method target_flt_eval_method
8916 = targetm
.c
.excess_precision (requested_type
);
8918 /* The target should not ask for unpredictable float evaluation (though
8919 it might advertise that implicitly the evaluation is unpredictable,
8920 but we don't care about that here, it will have been reported
8921 elsewhere). If it does ask for unpredictable evaluation, we have
8922 nothing to do here. */
8923 gcc_assert (target_flt_eval_method
!= FLT_EVAL_METHOD_UNPREDICTABLE
);
8925 /* Nothing to do. The target has asked for all types we know about
8926 to be computed with their native precision and range. */
8927 if (target_flt_eval_method
== FLT_EVAL_METHOD_PROMOTE_TO_FLOAT16
)
8930 /* The target will promote this type in a target-dependent way, so excess
8931 precision ought to leave it alone. */
8932 if (targetm
.promoted_type (type
) != NULL_TREE
)
8935 machine_mode float16_type_mode
= (float16_type_node
8936 ? TYPE_MODE (float16_type_node
)
8938 machine_mode float_type_mode
= TYPE_MODE (float_type_node
);
8939 machine_mode double_type_mode
= TYPE_MODE (double_type_node
);
8941 switch (TREE_CODE (type
))
8945 machine_mode type_mode
= TYPE_MODE (type
);
8946 switch (target_flt_eval_method
)
8948 case FLT_EVAL_METHOD_PROMOTE_TO_FLOAT
:
8949 if (type_mode
== float16_type_mode
)
8950 return float_type_node
;
8952 case FLT_EVAL_METHOD_PROMOTE_TO_DOUBLE
:
8953 if (type_mode
== float16_type_mode
8954 || type_mode
== float_type_mode
)
8955 return double_type_node
;
8957 case FLT_EVAL_METHOD_PROMOTE_TO_LONG_DOUBLE
:
8958 if (type_mode
== float16_type_mode
8959 || type_mode
== float_type_mode
8960 || type_mode
== double_type_mode
)
8961 return long_double_type_node
;
8970 if (TREE_CODE (TREE_TYPE (type
)) != REAL_TYPE
)
8972 machine_mode type_mode
= TYPE_MODE (TREE_TYPE (type
));
8973 switch (target_flt_eval_method
)
8975 case FLT_EVAL_METHOD_PROMOTE_TO_FLOAT
:
8976 if (type_mode
== float16_type_mode
)
8977 return complex_float_type_node
;
8979 case FLT_EVAL_METHOD_PROMOTE_TO_DOUBLE
:
8980 if (type_mode
== float16_type_mode
8981 || type_mode
== float_type_mode
)
8982 return complex_double_type_node
;
8984 case FLT_EVAL_METHOD_PROMOTE_TO_LONG_DOUBLE
:
8985 if (type_mode
== float16_type_mode
8986 || type_mode
== float_type_mode
8987 || type_mode
== double_type_mode
)
8988 return complex_long_double_type_node
;
9002 /* Return OP, stripped of any conversions to wider types as much as is safe.
9003 Converting the value back to OP's type makes a value equivalent to OP.
9005 If FOR_TYPE is nonzero, we return a value which, if converted to
9006 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
9008 OP must have integer, real or enumeral type. Pointers are not allowed!
9010 There are some cases where the obvious value we could return
9011 would regenerate to OP if converted to OP's type,
9012 but would not extend like OP to wider types.
9013 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
9014 For example, if OP is (unsigned short)(signed char)-1,
9015 we avoid returning (signed char)-1 if FOR_TYPE is int,
9016 even though extending that to an unsigned short would regenerate OP,
9017 since the result of extending (signed char)-1 to (int)
9018 is different from (int) OP. */
9021 get_unwidened (tree op
, tree for_type
)
9023 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
9024 tree type
= TREE_TYPE (op
);
9026 = TYPE_PRECISION (for_type
!= 0 ? for_type
: type
);
9028 = (for_type
!= 0 && for_type
!= type
9029 && final_prec
> TYPE_PRECISION (type
)
9030 && TYPE_UNSIGNED (type
));
9033 while (CONVERT_EXPR_P (op
))
9037 /* TYPE_PRECISION on vector types has different meaning
9038 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
9039 so avoid them here. */
9040 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op
, 0))) == VECTOR_TYPE
)
9043 bitschange
= TYPE_PRECISION (TREE_TYPE (op
))
9044 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0)));
9046 /* Truncations are many-one so cannot be removed.
9047 Unless we are later going to truncate down even farther. */
9049 && final_prec
> TYPE_PRECISION (TREE_TYPE (op
)))
9052 /* See what's inside this conversion. If we decide to strip it,
9054 op
= TREE_OPERAND (op
, 0);
9056 /* If we have not stripped any zero-extensions (uns is 0),
9057 we can strip any kind of extension.
9058 If we have previously stripped a zero-extension,
9059 only zero-extensions can safely be stripped.
9060 Any extension can be stripped if the bits it would produce
9061 are all going to be discarded later by truncating to FOR_TYPE. */
9065 if (! uns
|| final_prec
<= TYPE_PRECISION (TREE_TYPE (op
)))
9067 /* TYPE_UNSIGNED says whether this is a zero-extension.
9068 Let's avoid computing it if it does not affect WIN
9069 and if UNS will not be needed again. */
9071 || CONVERT_EXPR_P (op
))
9072 && TYPE_UNSIGNED (TREE_TYPE (op
)))
9080 /* If we finally reach a constant see if it fits in sth smaller and
9081 in that case convert it. */
9082 if (TREE_CODE (win
) == INTEGER_CST
)
9084 tree wtype
= TREE_TYPE (win
);
9085 unsigned prec
= wi::min_precision (win
, TYPE_SIGN (wtype
));
9087 prec
= MAX (prec
, final_prec
);
9088 if (prec
< TYPE_PRECISION (wtype
))
9090 tree t
= lang_hooks
.types
.type_for_size (prec
, TYPE_UNSIGNED (wtype
));
9091 if (t
&& TYPE_PRECISION (t
) < TYPE_PRECISION (wtype
))
9092 win
= fold_convert (t
, win
);
9099 /* Return OP or a simpler expression for a narrower value
9100 which can be sign-extended or zero-extended to give back OP.
9101 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
9102 or 0 if the value should be sign-extended. */
9105 get_narrower (tree op
, int *unsignedp_ptr
)
9110 bool integral_p
= INTEGRAL_TYPE_P (TREE_TYPE (op
));
9112 while (TREE_CODE (op
) == NOP_EXPR
)
9115 = (TYPE_PRECISION (TREE_TYPE (op
))
9116 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0))));
9118 /* Truncations are many-one so cannot be removed. */
9122 /* See what's inside this conversion. If we decide to strip it,
9127 op
= TREE_OPERAND (op
, 0);
9128 /* An extension: the outermost one can be stripped,
9129 but remember whether it is zero or sign extension. */
9131 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
9132 /* Otherwise, if a sign extension has been stripped,
9133 only sign extensions can now be stripped;
9134 if a zero extension has been stripped, only zero-extensions. */
9135 else if (uns
!= TYPE_UNSIGNED (TREE_TYPE (op
)))
9139 else /* bitschange == 0 */
9141 /* A change in nominal type can always be stripped, but we must
9142 preserve the unsignedness. */
9144 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
9146 op
= TREE_OPERAND (op
, 0);
9147 /* Keep trying to narrow, but don't assign op to win if it
9148 would turn an integral type into something else. */
9149 if (INTEGRAL_TYPE_P (TREE_TYPE (op
)) != integral_p
)
9156 if (TREE_CODE (op
) == COMPONENT_REF
9157 /* Since type_for_size always gives an integer type. */
9158 && TREE_CODE (TREE_TYPE (op
)) != REAL_TYPE
9159 && TREE_CODE (TREE_TYPE (op
)) != FIXED_POINT_TYPE
9160 /* Ensure field is laid out already. */
9161 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0
9162 && tree_fits_uhwi_p (DECL_SIZE (TREE_OPERAND (op
, 1))))
9164 unsigned HOST_WIDE_INT innerprec
9165 = tree_to_uhwi (DECL_SIZE (TREE_OPERAND (op
, 1)));
9166 int unsignedp
= (DECL_UNSIGNED (TREE_OPERAND (op
, 1))
9167 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op
, 1))));
9168 tree type
= lang_hooks
.types
.type_for_size (innerprec
, unsignedp
);
9170 /* We can get this structure field in a narrower type that fits it,
9171 but the resulting extension to its nominal type (a fullword type)
9172 must satisfy the same conditions as for other extensions.
9174 Do this only for fields that are aligned (not bit-fields),
9175 because when bit-field insns will be used there is no
9176 advantage in doing this. */
9178 if (innerprec
< TYPE_PRECISION (TREE_TYPE (op
))
9179 && ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1))
9180 && (first
|| uns
== DECL_UNSIGNED (TREE_OPERAND (op
, 1)))
9184 uns
= DECL_UNSIGNED (TREE_OPERAND (op
, 1));
9185 win
= fold_convert (type
, op
);
9189 *unsignedp_ptr
= uns
;
9193 /* Return true if integer constant C has a value that is permissible
9194 for TYPE, an integral type. */
9197 int_fits_type_p (const_tree c
, const_tree type
)
9199 tree type_low_bound
, type_high_bound
;
9200 bool ok_for_low_bound
, ok_for_high_bound
;
9201 signop sgn_c
= TYPE_SIGN (TREE_TYPE (c
));
9203 /* Non-standard boolean types can have arbitrary precision but various
9204 transformations assume that they can only take values 0 and +/-1. */
9205 if (TREE_CODE (type
) == BOOLEAN_TYPE
)
9206 return wi::fits_to_boolean_p (c
, type
);
9209 type_low_bound
= TYPE_MIN_VALUE (type
);
9210 type_high_bound
= TYPE_MAX_VALUE (type
);
9212 /* If at least one bound of the type is a constant integer, we can check
9213 ourselves and maybe make a decision. If no such decision is possible, but
9214 this type is a subtype, try checking against that. Otherwise, use
9215 fits_to_tree_p, which checks against the precision.
9217 Compute the status for each possibly constant bound, and return if we see
9218 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
9219 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
9220 for "constant known to fit". */
9222 /* Check if c >= type_low_bound. */
9223 if (type_low_bound
&& TREE_CODE (type_low_bound
) == INTEGER_CST
)
9225 if (tree_int_cst_lt (c
, type_low_bound
))
9227 ok_for_low_bound
= true;
9230 ok_for_low_bound
= false;
9232 /* Check if c <= type_high_bound. */
9233 if (type_high_bound
&& TREE_CODE (type_high_bound
) == INTEGER_CST
)
9235 if (tree_int_cst_lt (type_high_bound
, c
))
9237 ok_for_high_bound
= true;
9240 ok_for_high_bound
= false;
9242 /* If the constant fits both bounds, the result is known. */
9243 if (ok_for_low_bound
&& ok_for_high_bound
)
9246 /* Perform some generic filtering which may allow making a decision
9247 even if the bounds are not constant. First, negative integers
9248 never fit in unsigned types, */
9249 if (TYPE_UNSIGNED (type
) && sgn_c
== SIGNED
&& wi::neg_p (c
))
9252 /* Second, narrower types always fit in wider ones. */
9253 if (TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (c
)))
9256 /* Third, unsigned integers with top bit set never fit signed types. */
9257 if (!TYPE_UNSIGNED (type
) && sgn_c
== UNSIGNED
)
9259 int prec
= GET_MODE_PRECISION (TYPE_MODE (TREE_TYPE (c
))) - 1;
9260 if (prec
< TYPE_PRECISION (TREE_TYPE (c
)))
9262 /* When a tree_cst is converted to a wide-int, the precision
9263 is taken from the type. However, if the precision of the
9264 mode underneath the type is smaller than that, it is
9265 possible that the value will not fit. The test below
9266 fails if any bit is set between the sign bit of the
9267 underlying mode and the top bit of the type. */
9268 if (wi::ne_p (wi::zext (c
, prec
- 1), c
))
9271 else if (wi::neg_p (c
))
9275 /* If we haven't been able to decide at this point, there nothing more we
9276 can check ourselves here. Look at the base type if we have one and it
9277 has the same precision. */
9278 if (TREE_CODE (type
) == INTEGER_TYPE
9279 && TREE_TYPE (type
) != 0
9280 && TYPE_PRECISION (type
) == TYPE_PRECISION (TREE_TYPE (type
)))
9282 type
= TREE_TYPE (type
);
9286 /* Or to fits_to_tree_p, if nothing else. */
9287 return wi::fits_to_tree_p (c
, type
);
9290 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
9291 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
9292 represented (assuming two's-complement arithmetic) within the bit
9293 precision of the type are returned instead. */
9296 get_type_static_bounds (const_tree type
, mpz_t min
, mpz_t max
)
9298 if (!POINTER_TYPE_P (type
) && TYPE_MIN_VALUE (type
)
9299 && TREE_CODE (TYPE_MIN_VALUE (type
)) == INTEGER_CST
)
9300 wi::to_mpz (TYPE_MIN_VALUE (type
), min
, TYPE_SIGN (type
));
9303 if (TYPE_UNSIGNED (type
))
9304 mpz_set_ui (min
, 0);
9307 wide_int mn
= wi::min_value (TYPE_PRECISION (type
), SIGNED
);
9308 wi::to_mpz (mn
, min
, SIGNED
);
9312 if (!POINTER_TYPE_P (type
) && TYPE_MAX_VALUE (type
)
9313 && TREE_CODE (TYPE_MAX_VALUE (type
)) == INTEGER_CST
)
9314 wi::to_mpz (TYPE_MAX_VALUE (type
), max
, TYPE_SIGN (type
));
9317 wide_int mn
= wi::max_value (TYPE_PRECISION (type
), TYPE_SIGN (type
));
9318 wi::to_mpz (mn
, max
, TYPE_SIGN (type
));
9322 /* Return true if VAR is an automatic variable defined in function FN. */
9325 auto_var_in_fn_p (const_tree var
, const_tree fn
)
9327 return (DECL_P (var
) && DECL_CONTEXT (var
) == fn
9328 && ((((VAR_P (var
) && ! DECL_EXTERNAL (var
))
9329 || TREE_CODE (var
) == PARM_DECL
)
9330 && ! TREE_STATIC (var
))
9331 || TREE_CODE (var
) == LABEL_DECL
9332 || TREE_CODE (var
) == RESULT_DECL
));
9335 /* Subprogram of following function. Called by walk_tree.
9337 Return *TP if it is an automatic variable or parameter of the
9338 function passed in as DATA. */
9341 find_var_from_fn (tree
*tp
, int *walk_subtrees
, void *data
)
9343 tree fn
= (tree
) data
;
9348 else if (DECL_P (*tp
)
9349 && auto_var_in_fn_p (*tp
, fn
))
9355 /* Returns true if T is, contains, or refers to a type with variable
9356 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
9357 arguments, but not the return type. If FN is nonzero, only return
9358 true if a modifier of the type or position of FN is a variable or
9359 parameter inside FN.
9361 This concept is more general than that of C99 'variably modified types':
9362 in C99, a struct type is never variably modified because a VLA may not
9363 appear as a structure member. However, in GNU C code like:
9365 struct S { int i[f()]; };
9367 is valid, and other languages may define similar constructs. */
9370 variably_modified_type_p (tree type
, tree fn
)
9374 /* Test if T is either variable (if FN is zero) or an expression containing
9375 a variable in FN. If TYPE isn't gimplified, return true also if
9376 gimplify_one_sizepos would gimplify the expression into a local
9378 #define RETURN_TRUE_IF_VAR(T) \
9379 do { tree _t = (T); \
9380 if (_t != NULL_TREE \
9381 && _t != error_mark_node \
9382 && TREE_CODE (_t) != INTEGER_CST \
9383 && TREE_CODE (_t) != PLACEHOLDER_EXPR \
9385 || (!TYPE_SIZES_GIMPLIFIED (type) \
9386 && !is_gimple_sizepos (_t)) \
9387 || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
9388 return true; } while (0)
9390 if (type
== error_mark_node
)
9393 /* If TYPE itself has variable size, it is variably modified. */
9394 RETURN_TRUE_IF_VAR (TYPE_SIZE (type
));
9395 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type
));
9397 switch (TREE_CODE (type
))
9400 case REFERENCE_TYPE
:
9402 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
9408 /* If TYPE is a function type, it is variably modified if the
9409 return type is variably modified. */
9410 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
9416 case FIXED_POINT_TYPE
:
9419 /* Scalar types are variably modified if their end points
9421 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type
));
9422 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type
));
9427 case QUAL_UNION_TYPE
:
9428 /* We can't see if any of the fields are variably-modified by the
9429 definition we normally use, since that would produce infinite
9430 recursion via pointers. */
9431 /* This is variably modified if some field's type is. */
9432 for (t
= TYPE_FIELDS (type
); t
; t
= DECL_CHAIN (t
))
9433 if (TREE_CODE (t
) == FIELD_DECL
)
9435 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t
));
9436 RETURN_TRUE_IF_VAR (DECL_SIZE (t
));
9437 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t
));
9439 if (TREE_CODE (type
) == QUAL_UNION_TYPE
)
9440 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t
));
9445 /* Do not call ourselves to avoid infinite recursion. This is
9446 variably modified if the element type is. */
9447 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type
)));
9448 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type
)));
9455 /* The current language may have other cases to check, but in general,
9456 all other types are not variably modified. */
9457 return lang_hooks
.tree_inlining
.var_mod_type_p (type
, fn
);
9459 #undef RETURN_TRUE_IF_VAR
9462 /* Given a DECL or TYPE, return the scope in which it was declared, or
9463 NULL_TREE if there is no containing scope. */
9466 get_containing_scope (const_tree t
)
9468 return (TYPE_P (t
) ? TYPE_CONTEXT (t
) : DECL_CONTEXT (t
));
9471 /* Return the innermost context enclosing DECL that is
9472 a FUNCTION_DECL, or zero if none. */
9475 decl_function_context (const_tree decl
)
9479 if (TREE_CODE (decl
) == ERROR_MARK
)
9482 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
9483 where we look up the function at runtime. Such functions always take
9484 a first argument of type 'pointer to real context'.
9486 C++ should really be fixed to use DECL_CONTEXT for the real context,
9487 and use something else for the "virtual context". */
9488 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VINDEX (decl
))
9491 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl
)))));
9493 context
= DECL_CONTEXT (decl
);
9495 while (context
&& TREE_CODE (context
) != FUNCTION_DECL
)
9497 if (TREE_CODE (context
) == BLOCK
)
9498 context
= BLOCK_SUPERCONTEXT (context
);
9500 context
= get_containing_scope (context
);
9506 /* Return the innermost context enclosing DECL that is
9507 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
9508 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
9511 decl_type_context (const_tree decl
)
9513 tree context
= DECL_CONTEXT (decl
);
9516 switch (TREE_CODE (context
))
9518 case NAMESPACE_DECL
:
9519 case TRANSLATION_UNIT_DECL
:
9524 case QUAL_UNION_TYPE
:
9529 context
= DECL_CONTEXT (context
);
9533 context
= BLOCK_SUPERCONTEXT (context
);
9543 /* CALL is a CALL_EXPR. Return the declaration for the function
9544 called, or NULL_TREE if the called function cannot be
9548 get_callee_fndecl (const_tree call
)
9552 if (call
== error_mark_node
)
9553 return error_mark_node
;
9555 /* It's invalid to call this function with anything but a
9557 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
9559 /* The first operand to the CALL is the address of the function
9561 addr
= CALL_EXPR_FN (call
);
9563 /* If there is no function, return early. */
9564 if (addr
== NULL_TREE
)
9569 /* If this is a readonly function pointer, extract its initial value. */
9570 if (DECL_P (addr
) && TREE_CODE (addr
) != FUNCTION_DECL
9571 && TREE_READONLY (addr
) && ! TREE_THIS_VOLATILE (addr
)
9572 && DECL_INITIAL (addr
))
9573 addr
= DECL_INITIAL (addr
);
9575 /* If the address is just `&f' for some function `f', then we know
9576 that `f' is being called. */
9577 if (TREE_CODE (addr
) == ADDR_EXPR
9578 && TREE_CODE (TREE_OPERAND (addr
, 0)) == FUNCTION_DECL
)
9579 return TREE_OPERAND (addr
, 0);
9581 /* We couldn't figure out what was being called. */
9585 /* If CALL_EXPR CALL calls a normal built-in function or an internal function,
9586 return the associated function code, otherwise return CFN_LAST. */
9589 get_call_combined_fn (const_tree call
)
9591 /* It's invalid to call this function with anything but a CALL_EXPR. */
9592 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
9594 if (!CALL_EXPR_FN (call
))
9595 return as_combined_fn (CALL_EXPR_IFN (call
));
9597 tree fndecl
= get_callee_fndecl (call
);
9598 if (fndecl
&& DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
)
9599 return as_combined_fn (DECL_FUNCTION_CODE (fndecl
));
9604 #define TREE_MEM_USAGE_SPACES 40
9606 /* Print debugging information about tree nodes generated during the compile,
9607 and any language-specific information. */
9610 dump_tree_statistics (void)
9612 if (GATHER_STATISTICS
)
9615 int total_nodes
, total_bytes
;
9616 fprintf (stderr
, "\nKind Nodes Bytes\n");
9617 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9618 total_nodes
= total_bytes
= 0;
9619 for (i
= 0; i
< (int) all_kinds
; i
++)
9621 fprintf (stderr
, "%-20s %7d %10d\n", tree_node_kind_names
[i
],
9622 tree_node_counts
[i
], tree_node_sizes
[i
]);
9623 total_nodes
+= tree_node_counts
[i
];
9624 total_bytes
+= tree_node_sizes
[i
];
9626 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9627 fprintf (stderr
, "%-20s %7d %10d\n", "Total", total_nodes
, total_bytes
);
9628 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9629 fprintf (stderr
, "Code Nodes\n");
9630 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9631 for (i
= 0; i
< (int) MAX_TREE_CODES
; i
++)
9632 fprintf (stderr
, "%-32s %7d\n", get_tree_code_name ((enum tree_code
) i
),
9633 tree_code_counts
[i
]);
9634 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9635 fprintf (stderr
, "\n");
9636 ssanames_print_statistics ();
9637 fprintf (stderr
, "\n");
9638 phinodes_print_statistics ();
9639 fprintf (stderr
, "\n");
9642 fprintf (stderr
, "(No per-node statistics)\n");
9644 print_type_hash_statistics ();
9645 print_debug_expr_statistics ();
9646 print_value_expr_statistics ();
9647 lang_hooks
.print_statistics ();
9650 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
9652 /* Generate a crc32 of the low BYTES bytes of VALUE. */
9655 crc32_unsigned_n (unsigned chksum
, unsigned value
, unsigned bytes
)
9657 /* This relies on the raw feedback's top 4 bits being zero. */
9658 #define FEEDBACK(X) ((X) * 0x04c11db7)
9659 #define SYNDROME(X) (FEEDBACK ((X) & 1) ^ FEEDBACK ((X) & 2) \
9660 ^ FEEDBACK ((X) & 4) ^ FEEDBACK ((X) & 8))
9661 static const unsigned syndromes
[16] =
9663 SYNDROME(0x0), SYNDROME(0x1), SYNDROME(0x2), SYNDROME(0x3),
9664 SYNDROME(0x4), SYNDROME(0x5), SYNDROME(0x6), SYNDROME(0x7),
9665 SYNDROME(0x8), SYNDROME(0x9), SYNDROME(0xa), SYNDROME(0xb),
9666 SYNDROME(0xc), SYNDROME(0xd), SYNDROME(0xe), SYNDROME(0xf),
9671 value
<<= (32 - bytes
* 8);
9672 for (unsigned ix
= bytes
* 2; ix
--; value
<<= 4)
9674 unsigned feedback
= syndromes
[((value
^ chksum
) >> 28) & 0xf];
9676 chksum
= (chksum
<< 4) ^ feedback
;
9682 /* Generate a crc32 of a string. */
9685 crc32_string (unsigned chksum
, const char *string
)
9688 chksum
= crc32_byte (chksum
, *string
);
9693 /* P is a string that will be used in a symbol. Mask out any characters
9694 that are not valid in that context. */
9697 clean_symbol_name (char *p
)
9701 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
9704 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
9711 /* For anonymous aggregate types, we need some sort of name to
9712 hold on to. In practice, this should not appear, but it should
9713 not be harmful if it does. */
9715 anon_aggrname_p(const_tree id_node
)
9717 #ifndef NO_DOT_IN_LABEL
9718 return (IDENTIFIER_POINTER (id_node
)[0] == '.'
9719 && IDENTIFIER_POINTER (id_node
)[1] == '_');
9720 #else /* NO_DOT_IN_LABEL */
9721 #ifndef NO_DOLLAR_IN_LABEL
9722 return (IDENTIFIER_POINTER (id_node
)[0] == '$' \
9723 && IDENTIFIER_POINTER (id_node
)[1] == '_');
9724 #else /* NO_DOLLAR_IN_LABEL */
9725 #define ANON_AGGRNAME_PREFIX "__anon_"
9726 return (!strncmp (IDENTIFIER_POINTER (id_node
), ANON_AGGRNAME_PREFIX
,
9727 sizeof (ANON_AGGRNAME_PREFIX
) - 1));
9728 #endif /* NO_DOLLAR_IN_LABEL */
9729 #endif /* NO_DOT_IN_LABEL */
9732 /* Return a format for an anonymous aggregate name. */
9734 anon_aggrname_format()
9736 #ifndef NO_DOT_IN_LABEL
9738 #else /* NO_DOT_IN_LABEL */
9739 #ifndef NO_DOLLAR_IN_LABEL
9741 #else /* NO_DOLLAR_IN_LABEL */
9743 #endif /* NO_DOLLAR_IN_LABEL */
9744 #endif /* NO_DOT_IN_LABEL */
9747 /* Generate a name for a special-purpose function.
9748 The generated name may need to be unique across the whole link.
9749 Changes to this function may also require corresponding changes to
9750 xstrdup_mask_random.
9751 TYPE is some string to identify the purpose of this function to the
9752 linker or collect2; it must start with an uppercase letter,
9754 I - for constructors
9756 N - for C++ anonymous namespaces
9757 F - for DWARF unwind frame information. */
9760 get_file_function_name (const char *type
)
9766 /* If we already have a name we know to be unique, just use that. */
9767 if (first_global_object_name
)
9768 p
= q
= ASTRDUP (first_global_object_name
);
9769 /* If the target is handling the constructors/destructors, they
9770 will be local to this file and the name is only necessary for
9772 We also assign sub_I and sub_D sufixes to constructors called from
9773 the global static constructors. These are always local. */
9774 else if (((type
[0] == 'I' || type
[0] == 'D') && targetm
.have_ctors_dtors
)
9775 || (strncmp (type
, "sub_", 4) == 0
9776 && (type
[4] == 'I' || type
[4] == 'D')))
9778 const char *file
= main_input_filename
;
9780 file
= LOCATION_FILE (input_location
);
9781 /* Just use the file's basename, because the full pathname
9782 might be quite long. */
9783 p
= q
= ASTRDUP (lbasename (file
));
9787 /* Otherwise, the name must be unique across the entire link.
9788 We don't have anything that we know to be unique to this translation
9789 unit, so use what we do have and throw in some randomness. */
9791 const char *name
= weak_global_object_name
;
9792 const char *file
= main_input_filename
;
9797 file
= LOCATION_FILE (input_location
);
9799 len
= strlen (file
);
9800 q
= (char *) alloca (9 + 19 + len
+ 1);
9801 memcpy (q
, file
, len
+ 1);
9803 snprintf (q
+ len
, 9 + 19 + 1, "_%08X_" HOST_WIDE_INT_PRINT_HEX
,
9804 crc32_string (0, name
), get_random_seed (false));
9809 clean_symbol_name (q
);
9810 buf
= (char *) alloca (sizeof (FILE_FUNCTION_FORMAT
) + strlen (p
)
9813 /* Set up the name of the file-level functions we may need.
9814 Use a global object (which is already required to be unique over
9815 the program) rather than the file name (which imposes extra
9817 sprintf (buf
, FILE_FUNCTION_FORMAT
, type
, p
);
9819 return get_identifier (buf
);
9822 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
9824 /* Complain that the tree code of NODE does not match the expected 0
9825 terminated list of trailing codes. The trailing code list can be
9826 empty, for a more vague error message. FILE, LINE, and FUNCTION
9827 are of the caller. */
9830 tree_check_failed (const_tree node
, const char *file
,
9831 int line
, const char *function
, ...)
9835 unsigned length
= 0;
9836 enum tree_code code
;
9838 va_start (args
, function
);
9839 while ((code
= (enum tree_code
) va_arg (args
, int)))
9840 length
+= 4 + strlen (get_tree_code_name (code
));
9845 va_start (args
, function
);
9846 length
+= strlen ("expected ");
9847 buffer
= tmp
= (char *) alloca (length
);
9849 while ((code
= (enum tree_code
) va_arg (args
, int)))
9851 const char *prefix
= length
? " or " : "expected ";
9853 strcpy (tmp
+ length
, prefix
);
9854 length
+= strlen (prefix
);
9855 strcpy (tmp
+ length
, get_tree_code_name (code
));
9856 length
+= strlen (get_tree_code_name (code
));
9861 buffer
= "unexpected node";
9863 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9864 buffer
, get_tree_code_name (TREE_CODE (node
)),
9865 function
, trim_filename (file
), line
);
9868 /* Complain that the tree code of NODE does match the expected 0
9869 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
9873 tree_not_check_failed (const_tree node
, const char *file
,
9874 int line
, const char *function
, ...)
9878 unsigned length
= 0;
9879 enum tree_code code
;
9881 va_start (args
, function
);
9882 while ((code
= (enum tree_code
) va_arg (args
, int)))
9883 length
+= 4 + strlen (get_tree_code_name (code
));
9885 va_start (args
, function
);
9886 buffer
= (char *) alloca (length
);
9888 while ((code
= (enum tree_code
) va_arg (args
, int)))
9892 strcpy (buffer
+ length
, " or ");
9895 strcpy (buffer
+ length
, get_tree_code_name (code
));
9896 length
+= strlen (get_tree_code_name (code
));
9900 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
9901 buffer
, get_tree_code_name (TREE_CODE (node
)),
9902 function
, trim_filename (file
), line
);
9905 /* Similar to tree_check_failed, except that we check for a class of tree
9906 code, given in CL. */
9909 tree_class_check_failed (const_tree node
, const enum tree_code_class cl
,
9910 const char *file
, int line
, const char *function
)
9913 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
9914 TREE_CODE_CLASS_STRING (cl
),
9915 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
9916 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9919 /* Similar to tree_check_failed, except that instead of specifying a
9920 dozen codes, use the knowledge that they're all sequential. */
9923 tree_range_check_failed (const_tree node
, const char *file
, int line
,
9924 const char *function
, enum tree_code c1
,
9928 unsigned length
= 0;
9931 for (c
= c1
; c
<= c2
; ++c
)
9932 length
+= 4 + strlen (get_tree_code_name ((enum tree_code
) c
));
9934 length
+= strlen ("expected ");
9935 buffer
= (char *) alloca (length
);
9938 for (c
= c1
; c
<= c2
; ++c
)
9940 const char *prefix
= length
? " or " : "expected ";
9942 strcpy (buffer
+ length
, prefix
);
9943 length
+= strlen (prefix
);
9944 strcpy (buffer
+ length
, get_tree_code_name ((enum tree_code
) c
));
9945 length
+= strlen (get_tree_code_name ((enum tree_code
) c
));
9948 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9949 buffer
, get_tree_code_name (TREE_CODE (node
)),
9950 function
, trim_filename (file
), line
);
9954 /* Similar to tree_check_failed, except that we check that a tree does
9955 not have the specified code, given in CL. */
9958 tree_not_class_check_failed (const_tree node
, const enum tree_code_class cl
,
9959 const char *file
, int line
, const char *function
)
9962 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
9963 TREE_CODE_CLASS_STRING (cl
),
9964 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
9965 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9969 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
9972 omp_clause_check_failed (const_tree node
, const char *file
, int line
,
9973 const char *function
, enum omp_clause_code code
)
9975 internal_error ("tree check: expected omp_clause %s, have %s in %s, at %s:%d",
9976 omp_clause_code_name
[code
], get_tree_code_name (TREE_CODE (node
)),
9977 function
, trim_filename (file
), line
);
9981 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
9984 omp_clause_range_check_failed (const_tree node
, const char *file
, int line
,
9985 const char *function
, enum omp_clause_code c1
,
9986 enum omp_clause_code c2
)
9989 unsigned length
= 0;
9992 for (c
= c1
; c
<= c2
; ++c
)
9993 length
+= 4 + strlen (omp_clause_code_name
[c
]);
9995 length
+= strlen ("expected ");
9996 buffer
= (char *) alloca (length
);
9999 for (c
= c1
; c
<= c2
; ++c
)
10001 const char *prefix
= length
? " or " : "expected ";
10003 strcpy (buffer
+ length
, prefix
);
10004 length
+= strlen (prefix
);
10005 strcpy (buffer
+ length
, omp_clause_code_name
[c
]);
10006 length
+= strlen (omp_clause_code_name
[c
]);
10009 internal_error ("tree check: %s, have %s in %s, at %s:%d",
10010 buffer
, omp_clause_code_name
[TREE_CODE (node
)],
10011 function
, trim_filename (file
), line
);
10015 #undef DEFTREESTRUCT
10016 #define DEFTREESTRUCT(VAL, NAME) NAME,
10018 static const char *ts_enum_names
[] = {
10019 #include "treestruct.def"
10021 #undef DEFTREESTRUCT
10023 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
10025 /* Similar to tree_class_check_failed, except that we check for
10026 whether CODE contains the tree structure identified by EN. */
10029 tree_contains_struct_check_failed (const_tree node
,
10030 const enum tree_node_structure_enum en
,
10031 const char *file
, int line
,
10032 const char *function
)
10035 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
10037 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
10041 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
10042 (dynamically sized) vector. */
10045 tree_int_cst_elt_check_failed (int idx
, int len
, const char *file
, int line
,
10046 const char *function
)
10049 ("tree check: accessed elt %d of tree_int_cst with %d elts in %s, at %s:%d",
10050 idx
+ 1, len
, function
, trim_filename (file
), line
);
10053 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
10054 (dynamically sized) vector. */
10057 tree_vec_elt_check_failed (int idx
, int len
, const char *file
, int line
,
10058 const char *function
)
10061 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
10062 idx
+ 1, len
, function
, trim_filename (file
), line
);
10065 /* Similar to above, except that the check is for the bounds of the operand
10066 vector of an expression node EXP. */
10069 tree_operand_check_failed (int idx
, const_tree exp
, const char *file
,
10070 int line
, const char *function
)
10072 enum tree_code code
= TREE_CODE (exp
);
10074 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
10075 idx
+ 1, get_tree_code_name (code
), TREE_OPERAND_LENGTH (exp
),
10076 function
, trim_filename (file
), line
);
10079 /* Similar to above, except that the check is for the number of
10080 operands of an OMP_CLAUSE node. */
10083 omp_clause_operand_check_failed (int idx
, const_tree t
, const char *file
,
10084 int line
, const char *function
)
10087 ("tree check: accessed operand %d of omp_clause %s with %d operands "
10088 "in %s, at %s:%d", idx
+ 1, omp_clause_code_name
[OMP_CLAUSE_CODE (t
)],
10089 omp_clause_num_ops
[OMP_CLAUSE_CODE (t
)], function
,
10090 trim_filename (file
), line
);
10092 #endif /* ENABLE_TREE_CHECKING */
10094 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
10095 and mapped to the machine mode MODE. Initialize its fields and build
10096 the information necessary for debugging output. */
10099 make_vector_type (tree innertype
, int nunits
, machine_mode mode
)
10102 tree mv_innertype
= TYPE_MAIN_VARIANT (innertype
);
10104 t
= make_node (VECTOR_TYPE
);
10105 TREE_TYPE (t
) = mv_innertype
;
10106 SET_TYPE_VECTOR_SUBPARTS (t
, nunits
);
10107 SET_TYPE_MODE (t
, mode
);
10109 if (TYPE_STRUCTURAL_EQUALITY_P (mv_innertype
) || in_lto_p
)
10110 SET_TYPE_STRUCTURAL_EQUALITY (t
);
10111 else if ((TYPE_CANONICAL (mv_innertype
) != innertype
10112 || mode
!= VOIDmode
)
10113 && !VECTOR_BOOLEAN_TYPE_P (t
))
10115 = make_vector_type (TYPE_CANONICAL (mv_innertype
), nunits
, VOIDmode
);
10119 hashval_t hash
= type_hash_canon_hash (t
);
10120 t
= type_hash_canon (hash
, t
);
10122 /* We have built a main variant, based on the main variant of the
10123 inner type. Use it to build the variant we return. */
10124 if ((TYPE_ATTRIBUTES (innertype
) || TYPE_QUALS (innertype
))
10125 && TREE_TYPE (t
) != innertype
)
10126 return build_type_attribute_qual_variant (t
,
10127 TYPE_ATTRIBUTES (innertype
),
10128 TYPE_QUALS (innertype
));
10134 make_or_reuse_type (unsigned size
, int unsignedp
)
10138 if (size
== INT_TYPE_SIZE
)
10139 return unsignedp
? unsigned_type_node
: integer_type_node
;
10140 if (size
== CHAR_TYPE_SIZE
)
10141 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
10142 if (size
== SHORT_TYPE_SIZE
)
10143 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
10144 if (size
== LONG_TYPE_SIZE
)
10145 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
10146 if (size
== LONG_LONG_TYPE_SIZE
)
10147 return (unsignedp
? long_long_unsigned_type_node
10148 : long_long_integer_type_node
);
10150 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
10151 if (size
== int_n_data
[i
].bitsize
10152 && int_n_enabled_p
[i
])
10153 return (unsignedp
? int_n_trees
[i
].unsigned_type
10154 : int_n_trees
[i
].signed_type
);
10157 return make_unsigned_type (size
);
10159 return make_signed_type (size
);
10162 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
10165 make_or_reuse_fract_type (unsigned size
, int unsignedp
, int satp
)
10169 if (size
== SHORT_FRACT_TYPE_SIZE
)
10170 return unsignedp
? sat_unsigned_short_fract_type_node
10171 : sat_short_fract_type_node
;
10172 if (size
== FRACT_TYPE_SIZE
)
10173 return unsignedp
? sat_unsigned_fract_type_node
: sat_fract_type_node
;
10174 if (size
== LONG_FRACT_TYPE_SIZE
)
10175 return unsignedp
? sat_unsigned_long_fract_type_node
10176 : sat_long_fract_type_node
;
10177 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
10178 return unsignedp
? sat_unsigned_long_long_fract_type_node
10179 : sat_long_long_fract_type_node
;
10183 if (size
== SHORT_FRACT_TYPE_SIZE
)
10184 return unsignedp
? unsigned_short_fract_type_node
10185 : short_fract_type_node
;
10186 if (size
== FRACT_TYPE_SIZE
)
10187 return unsignedp
? unsigned_fract_type_node
: fract_type_node
;
10188 if (size
== LONG_FRACT_TYPE_SIZE
)
10189 return unsignedp
? unsigned_long_fract_type_node
10190 : long_fract_type_node
;
10191 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
10192 return unsignedp
? unsigned_long_long_fract_type_node
10193 : long_long_fract_type_node
;
10196 return make_fract_type (size
, unsignedp
, satp
);
10199 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
10202 make_or_reuse_accum_type (unsigned size
, int unsignedp
, int satp
)
10206 if (size
== SHORT_ACCUM_TYPE_SIZE
)
10207 return unsignedp
? sat_unsigned_short_accum_type_node
10208 : sat_short_accum_type_node
;
10209 if (size
== ACCUM_TYPE_SIZE
)
10210 return unsignedp
? sat_unsigned_accum_type_node
: sat_accum_type_node
;
10211 if (size
== LONG_ACCUM_TYPE_SIZE
)
10212 return unsignedp
? sat_unsigned_long_accum_type_node
10213 : sat_long_accum_type_node
;
10214 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
10215 return unsignedp
? sat_unsigned_long_long_accum_type_node
10216 : sat_long_long_accum_type_node
;
10220 if (size
== SHORT_ACCUM_TYPE_SIZE
)
10221 return unsignedp
? unsigned_short_accum_type_node
10222 : short_accum_type_node
;
10223 if (size
== ACCUM_TYPE_SIZE
)
10224 return unsignedp
? unsigned_accum_type_node
: accum_type_node
;
10225 if (size
== LONG_ACCUM_TYPE_SIZE
)
10226 return unsignedp
? unsigned_long_accum_type_node
10227 : long_accum_type_node
;
10228 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
10229 return unsignedp
? unsigned_long_long_accum_type_node
10230 : long_long_accum_type_node
;
10233 return make_accum_type (size
, unsignedp
, satp
);
10237 /* Create an atomic variant node for TYPE. This routine is called
10238 during initialization of data types to create the 5 basic atomic
10239 types. The generic build_variant_type function requires these to
10240 already be set up in order to function properly, so cannot be
10241 called from there. If ALIGN is non-zero, then ensure alignment is
10242 overridden to this value. */
10245 build_atomic_base (tree type
, unsigned int align
)
10249 /* Make sure its not already registered. */
10250 if ((t
= get_qualified_type (type
, TYPE_QUAL_ATOMIC
)))
10253 t
= build_variant_type_copy (type
);
10254 set_type_quals (t
, TYPE_QUAL_ATOMIC
);
10257 SET_TYPE_ALIGN (t
, align
);
10262 /* Information about the _FloatN and _FloatNx types. This must be in
10263 the same order as the corresponding TI_* enum values. */
10264 const floatn_type_info floatn_nx_types
[NUM_FLOATN_NX_TYPES
] =
10276 /* Create nodes for all integer types (and error_mark_node) using the sizes
10277 of C datatypes. SIGNED_CHAR specifies whether char is signed. */
10280 build_common_tree_nodes (bool signed_char
)
10284 error_mark_node
= make_node (ERROR_MARK
);
10285 TREE_TYPE (error_mark_node
) = error_mark_node
;
10287 initialize_sizetypes ();
10289 /* Define both `signed char' and `unsigned char'. */
10290 signed_char_type_node
= make_signed_type (CHAR_TYPE_SIZE
);
10291 TYPE_STRING_FLAG (signed_char_type_node
) = 1;
10292 unsigned_char_type_node
= make_unsigned_type (CHAR_TYPE_SIZE
);
10293 TYPE_STRING_FLAG (unsigned_char_type_node
) = 1;
10295 /* Define `char', which is like either `signed char' or `unsigned char'
10296 but not the same as either. */
10299 ? make_signed_type (CHAR_TYPE_SIZE
)
10300 : make_unsigned_type (CHAR_TYPE_SIZE
));
10301 TYPE_STRING_FLAG (char_type_node
) = 1;
10303 short_integer_type_node
= make_signed_type (SHORT_TYPE_SIZE
);
10304 short_unsigned_type_node
= make_unsigned_type (SHORT_TYPE_SIZE
);
10305 integer_type_node
= make_signed_type (INT_TYPE_SIZE
);
10306 unsigned_type_node
= make_unsigned_type (INT_TYPE_SIZE
);
10307 long_integer_type_node
= make_signed_type (LONG_TYPE_SIZE
);
10308 long_unsigned_type_node
= make_unsigned_type (LONG_TYPE_SIZE
);
10309 long_long_integer_type_node
= make_signed_type (LONG_LONG_TYPE_SIZE
);
10310 long_long_unsigned_type_node
= make_unsigned_type (LONG_LONG_TYPE_SIZE
);
10312 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
10314 int_n_trees
[i
].signed_type
= make_signed_type (int_n_data
[i
].bitsize
);
10315 int_n_trees
[i
].unsigned_type
= make_unsigned_type (int_n_data
[i
].bitsize
);
10316 TYPE_SIZE (int_n_trees
[i
].signed_type
) = bitsize_int (int_n_data
[i
].bitsize
);
10317 TYPE_SIZE (int_n_trees
[i
].unsigned_type
) = bitsize_int (int_n_data
[i
].bitsize
);
10319 if (int_n_data
[i
].bitsize
> LONG_LONG_TYPE_SIZE
10320 && int_n_enabled_p
[i
])
10322 integer_types
[itk_intN_0
+ i
* 2] = int_n_trees
[i
].signed_type
;
10323 integer_types
[itk_unsigned_intN_0
+ i
* 2] = int_n_trees
[i
].unsigned_type
;
10327 /* Define a boolean type. This type only represents boolean values but
10328 may be larger than char depending on the value of BOOL_TYPE_SIZE. */
10329 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
10330 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
10331 TYPE_PRECISION (boolean_type_node
) = 1;
10332 TYPE_MAX_VALUE (boolean_type_node
) = build_int_cst (boolean_type_node
, 1);
10334 /* Define what type to use for size_t. */
10335 if (strcmp (SIZE_TYPE
, "unsigned int") == 0)
10336 size_type_node
= unsigned_type_node
;
10337 else if (strcmp (SIZE_TYPE
, "long unsigned int") == 0)
10338 size_type_node
= long_unsigned_type_node
;
10339 else if (strcmp (SIZE_TYPE
, "long long unsigned int") == 0)
10340 size_type_node
= long_long_unsigned_type_node
;
10341 else if (strcmp (SIZE_TYPE
, "short unsigned int") == 0)
10342 size_type_node
= short_unsigned_type_node
;
10347 size_type_node
= NULL_TREE
;
10348 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
10349 if (int_n_enabled_p
[i
])
10352 sprintf (name
, "__int%d unsigned", int_n_data
[i
].bitsize
);
10354 if (strcmp (name
, SIZE_TYPE
) == 0)
10356 size_type_node
= int_n_trees
[i
].unsigned_type
;
10359 if (size_type_node
== NULL_TREE
)
10360 gcc_unreachable ();
10363 /* Define what type to use for ptrdiff_t. */
10364 if (strcmp (PTRDIFF_TYPE
, "int") == 0)
10365 ptrdiff_type_node
= integer_type_node
;
10366 else if (strcmp (PTRDIFF_TYPE
, "long int") == 0)
10367 ptrdiff_type_node
= long_integer_type_node
;
10368 else if (strcmp (PTRDIFF_TYPE
, "long long int") == 0)
10369 ptrdiff_type_node
= long_long_integer_type_node
;
10370 else if (strcmp (PTRDIFF_TYPE
, "short int") == 0)
10371 ptrdiff_type_node
= short_integer_type_node
;
10374 ptrdiff_type_node
= NULL_TREE
;
10375 for (int i
= 0; i
< NUM_INT_N_ENTS
; i
++)
10376 if (int_n_enabled_p
[i
])
10379 sprintf (name
, "__int%d", int_n_data
[i
].bitsize
);
10380 if (strcmp (name
, PTRDIFF_TYPE
) == 0)
10381 ptrdiff_type_node
= int_n_trees
[i
].signed_type
;
10383 if (ptrdiff_type_node
== NULL_TREE
)
10384 gcc_unreachable ();
10387 /* Fill in the rest of the sized types. Reuse existing type nodes
10389 intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 0);
10390 intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 0);
10391 intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 0);
10392 intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 0);
10393 intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 0);
10395 unsigned_intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 1);
10396 unsigned_intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 1);
10397 unsigned_intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 1);
10398 unsigned_intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 1);
10399 unsigned_intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 1);
10401 /* Don't call build_qualified type for atomics. That routine does
10402 special processing for atomics, and until they are initialized
10403 it's better not to make that call.
10405 Check to see if there is a target override for atomic types. */
10407 atomicQI_type_node
= build_atomic_base (unsigned_intQI_type_node
,
10408 targetm
.atomic_align_for_mode (QImode
));
10409 atomicHI_type_node
= build_atomic_base (unsigned_intHI_type_node
,
10410 targetm
.atomic_align_for_mode (HImode
));
10411 atomicSI_type_node
= build_atomic_base (unsigned_intSI_type_node
,
10412 targetm
.atomic_align_for_mode (SImode
));
10413 atomicDI_type_node
= build_atomic_base (unsigned_intDI_type_node
,
10414 targetm
.atomic_align_for_mode (DImode
));
10415 atomicTI_type_node
= build_atomic_base (unsigned_intTI_type_node
,
10416 targetm
.atomic_align_for_mode (TImode
));
10418 access_public_node
= get_identifier ("public");
10419 access_protected_node
= get_identifier ("protected");
10420 access_private_node
= get_identifier ("private");
10422 /* Define these next since types below may used them. */
10423 integer_zero_node
= build_int_cst (integer_type_node
, 0);
10424 integer_one_node
= build_int_cst (integer_type_node
, 1);
10425 integer_three_node
= build_int_cst (integer_type_node
, 3);
10426 integer_minus_one_node
= build_int_cst (integer_type_node
, -1);
10428 size_zero_node
= size_int (0);
10429 size_one_node
= size_int (1);
10430 bitsize_zero_node
= bitsize_int (0);
10431 bitsize_one_node
= bitsize_int (1);
10432 bitsize_unit_node
= bitsize_int (BITS_PER_UNIT
);
10434 boolean_false_node
= TYPE_MIN_VALUE (boolean_type_node
);
10435 boolean_true_node
= TYPE_MAX_VALUE (boolean_type_node
);
10437 void_type_node
= make_node (VOID_TYPE
);
10438 layout_type (void_type_node
);
10440 pointer_bounds_type_node
= targetm
.chkp_bound_type ();
10442 /* We are not going to have real types in C with less than byte alignment,
10443 so we might as well not have any types that claim to have it. */
10444 SET_TYPE_ALIGN (void_type_node
, BITS_PER_UNIT
);
10445 TYPE_USER_ALIGN (void_type_node
) = 0;
10447 void_node
= make_node (VOID_CST
);
10448 TREE_TYPE (void_node
) = void_type_node
;
10450 null_pointer_node
= build_int_cst (build_pointer_type (void_type_node
), 0);
10451 layout_type (TREE_TYPE (null_pointer_node
));
10453 ptr_type_node
= build_pointer_type (void_type_node
);
10454 const_ptr_type_node
10455 = build_pointer_type (build_type_variant (void_type_node
, 1, 0));
10456 for (unsigned i
= 0;
10457 i
< sizeof (builtin_structptr_types
) / sizeof (builtin_structptr_type
);
10459 builtin_structptr_types
[i
].node
= builtin_structptr_types
[i
].base
;
10461 pointer_sized_int_node
= build_nonstandard_integer_type (POINTER_SIZE
, 1);
10463 float_type_node
= make_node (REAL_TYPE
);
10464 TYPE_PRECISION (float_type_node
) = FLOAT_TYPE_SIZE
;
10465 layout_type (float_type_node
);
10467 double_type_node
= make_node (REAL_TYPE
);
10468 TYPE_PRECISION (double_type_node
) = DOUBLE_TYPE_SIZE
;
10469 layout_type (double_type_node
);
10471 long_double_type_node
= make_node (REAL_TYPE
);
10472 TYPE_PRECISION (long_double_type_node
) = LONG_DOUBLE_TYPE_SIZE
;
10473 layout_type (long_double_type_node
);
10475 for (i
= 0; i
< NUM_FLOATN_NX_TYPES
; i
++)
10477 int n
= floatn_nx_types
[i
].n
;
10478 bool extended
= floatn_nx_types
[i
].extended
;
10479 machine_mode mode
= targetm
.floatn_mode (n
, extended
);
10480 if (mode
== VOIDmode
)
10482 int precision
= GET_MODE_PRECISION (mode
);
10483 /* Work around the rs6000 KFmode having precision 113 not
10485 const struct real_format
*fmt
= REAL_MODE_FORMAT (mode
);
10486 gcc_assert (fmt
->b
== 2 && fmt
->emin
+ fmt
->emax
== 3);
10487 int min_precision
= fmt
->p
+ ceil_log2 (fmt
->emax
- fmt
->emin
);
10489 gcc_assert (min_precision
== n
);
10490 if (precision
< min_precision
)
10491 precision
= min_precision
;
10492 FLOATN_NX_TYPE_NODE (i
) = make_node (REAL_TYPE
);
10493 TYPE_PRECISION (FLOATN_NX_TYPE_NODE (i
)) = precision
;
10494 layout_type (FLOATN_NX_TYPE_NODE (i
));
10495 SET_TYPE_MODE (FLOATN_NX_TYPE_NODE (i
), mode
);
10498 float_ptr_type_node
= build_pointer_type (float_type_node
);
10499 double_ptr_type_node
= build_pointer_type (double_type_node
);
10500 long_double_ptr_type_node
= build_pointer_type (long_double_type_node
);
10501 integer_ptr_type_node
= build_pointer_type (integer_type_node
);
10503 /* Fixed size integer types. */
10504 uint16_type_node
= make_or_reuse_type (16, 1);
10505 uint32_type_node
= make_or_reuse_type (32, 1);
10506 uint64_type_node
= make_or_reuse_type (64, 1);
10508 /* Decimal float types. */
10509 dfloat32_type_node
= make_node (REAL_TYPE
);
10510 TYPE_PRECISION (dfloat32_type_node
) = DECIMAL32_TYPE_SIZE
;
10511 SET_TYPE_MODE (dfloat32_type_node
, SDmode
);
10512 layout_type (dfloat32_type_node
);
10513 dfloat32_ptr_type_node
= build_pointer_type (dfloat32_type_node
);
10515 dfloat64_type_node
= make_node (REAL_TYPE
);
10516 TYPE_PRECISION (dfloat64_type_node
) = DECIMAL64_TYPE_SIZE
;
10517 SET_TYPE_MODE (dfloat64_type_node
, DDmode
);
10518 layout_type (dfloat64_type_node
);
10519 dfloat64_ptr_type_node
= build_pointer_type (dfloat64_type_node
);
10521 dfloat128_type_node
= make_node (REAL_TYPE
);
10522 TYPE_PRECISION (dfloat128_type_node
) = DECIMAL128_TYPE_SIZE
;
10523 SET_TYPE_MODE (dfloat128_type_node
, TDmode
);
10524 layout_type (dfloat128_type_node
);
10525 dfloat128_ptr_type_node
= build_pointer_type (dfloat128_type_node
);
10527 complex_integer_type_node
= build_complex_type (integer_type_node
, true);
10528 complex_float_type_node
= build_complex_type (float_type_node
, true);
10529 complex_double_type_node
= build_complex_type (double_type_node
, true);
10530 complex_long_double_type_node
= build_complex_type (long_double_type_node
,
10533 for (i
= 0; i
< NUM_FLOATN_NX_TYPES
; i
++)
10535 if (FLOATN_NX_TYPE_NODE (i
) != NULL_TREE
)
10536 COMPLEX_FLOATN_NX_TYPE_NODE (i
)
10537 = build_complex_type (FLOATN_NX_TYPE_NODE (i
));
10540 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
10541 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
10542 sat_ ## KIND ## _type_node = \
10543 make_sat_signed_ ## KIND ## _type (SIZE); \
10544 sat_unsigned_ ## KIND ## _type_node = \
10545 make_sat_unsigned_ ## KIND ## _type (SIZE); \
10546 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
10547 unsigned_ ## KIND ## _type_node = \
10548 make_unsigned_ ## KIND ## _type (SIZE);
10550 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
10551 sat_ ## WIDTH ## KIND ## _type_node = \
10552 make_sat_signed_ ## KIND ## _type (SIZE); \
10553 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
10554 make_sat_unsigned_ ## KIND ## _type (SIZE); \
10555 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
10556 unsigned_ ## WIDTH ## KIND ## _type_node = \
10557 make_unsigned_ ## KIND ## _type (SIZE);
10559 /* Make fixed-point type nodes based on four different widths. */
10560 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
10561 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
10562 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
10563 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
10564 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
10566 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
10567 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
10568 NAME ## _type_node = \
10569 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
10570 u ## NAME ## _type_node = \
10571 make_or_reuse_unsigned_ ## KIND ## _type \
10572 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
10573 sat_ ## NAME ## _type_node = \
10574 make_or_reuse_sat_signed_ ## KIND ## _type \
10575 (GET_MODE_BITSIZE (MODE ## mode)); \
10576 sat_u ## NAME ## _type_node = \
10577 make_or_reuse_sat_unsigned_ ## KIND ## _type \
10578 (GET_MODE_BITSIZE (U ## MODE ## mode));
10580 /* Fixed-point type and mode nodes. */
10581 MAKE_FIXED_TYPE_NODE_FAMILY (fract
, FRACT
)
10582 MAKE_FIXED_TYPE_NODE_FAMILY (accum
, ACCUM
)
10583 MAKE_FIXED_MODE_NODE (fract
, qq
, QQ
)
10584 MAKE_FIXED_MODE_NODE (fract
, hq
, HQ
)
10585 MAKE_FIXED_MODE_NODE (fract
, sq
, SQ
)
10586 MAKE_FIXED_MODE_NODE (fract
, dq
, DQ
)
10587 MAKE_FIXED_MODE_NODE (fract
, tq
, TQ
)
10588 MAKE_FIXED_MODE_NODE (accum
, ha
, HA
)
10589 MAKE_FIXED_MODE_NODE (accum
, sa
, SA
)
10590 MAKE_FIXED_MODE_NODE (accum
, da
, DA
)
10591 MAKE_FIXED_MODE_NODE (accum
, ta
, TA
)
10594 tree t
= targetm
.build_builtin_va_list ();
10596 /* Many back-ends define record types without setting TYPE_NAME.
10597 If we copied the record type here, we'd keep the original
10598 record type without a name. This breaks name mangling. So,
10599 don't copy record types and let c_common_nodes_and_builtins()
10600 declare the type to be __builtin_va_list. */
10601 if (TREE_CODE (t
) != RECORD_TYPE
)
10602 t
= build_variant_type_copy (t
);
10604 va_list_type_node
= t
;
10608 /* Modify DECL for given flags.
10609 TM_PURE attribute is set only on types, so the function will modify
10610 DECL's type when ECF_TM_PURE is used. */
10613 set_call_expr_flags (tree decl
, int flags
)
10615 if (flags
& ECF_NOTHROW
)
10616 TREE_NOTHROW (decl
) = 1;
10617 if (flags
& ECF_CONST
)
10618 TREE_READONLY (decl
) = 1;
10619 if (flags
& ECF_PURE
)
10620 DECL_PURE_P (decl
) = 1;
10621 if (flags
& ECF_LOOPING_CONST_OR_PURE
)
10622 DECL_LOOPING_CONST_OR_PURE_P (decl
) = 1;
10623 if (flags
& ECF_NOVOPS
)
10624 DECL_IS_NOVOPS (decl
) = 1;
10625 if (flags
& ECF_NORETURN
)
10626 TREE_THIS_VOLATILE (decl
) = 1;
10627 if (flags
& ECF_MALLOC
)
10628 DECL_IS_MALLOC (decl
) = 1;
10629 if (flags
& ECF_RETURNS_TWICE
)
10630 DECL_IS_RETURNS_TWICE (decl
) = 1;
10631 if (flags
& ECF_LEAF
)
10632 DECL_ATTRIBUTES (decl
) = tree_cons (get_identifier ("leaf"),
10633 NULL
, DECL_ATTRIBUTES (decl
));
10634 if (flags
& ECF_COLD
)
10635 DECL_ATTRIBUTES (decl
) = tree_cons (get_identifier ("cold"),
10636 NULL
, DECL_ATTRIBUTES (decl
));
10637 if (flags
& ECF_RET1
)
10638 DECL_ATTRIBUTES (decl
)
10639 = tree_cons (get_identifier ("fn spec"),
10640 build_tree_list (NULL_TREE
, build_string (1, "1")),
10641 DECL_ATTRIBUTES (decl
));
10642 if ((flags
& ECF_TM_PURE
) && flag_tm
)
10643 apply_tm_attr (decl
, get_identifier ("transaction_pure"));
10644 /* Looping const or pure is implied by noreturn.
10645 There is currently no way to declare looping const or looping pure alone. */
10646 gcc_assert (!(flags
& ECF_LOOPING_CONST_OR_PURE
)
10647 || ((flags
& ECF_NORETURN
) && (flags
& (ECF_CONST
| ECF_PURE
))));
10651 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
10654 local_define_builtin (const char *name
, tree type
, enum built_in_function code
,
10655 const char *library_name
, int ecf_flags
)
10659 decl
= add_builtin_function (name
, type
, code
, BUILT_IN_NORMAL
,
10660 library_name
, NULL_TREE
);
10661 set_call_expr_flags (decl
, ecf_flags
);
10663 set_builtin_decl (code
, decl
, true);
10666 /* Call this function after instantiating all builtins that the language
10667 front end cares about. This will build the rest of the builtins
10668 and internal functions that are relied upon by the tree optimizers and
10672 build_common_builtin_nodes (void)
10677 if (!builtin_decl_explicit_p (BUILT_IN_UNREACHABLE
)
10678 || !builtin_decl_explicit_p (BUILT_IN_ABORT
))
10680 ftype
= build_function_type (void_type_node
, void_list_node
);
10681 if (!builtin_decl_explicit_p (BUILT_IN_UNREACHABLE
))
10682 local_define_builtin ("__builtin_unreachable", ftype
,
10683 BUILT_IN_UNREACHABLE
,
10684 "__builtin_unreachable",
10685 ECF_NOTHROW
| ECF_LEAF
| ECF_NORETURN
10686 | ECF_CONST
| ECF_COLD
);
10687 if (!builtin_decl_explicit_p (BUILT_IN_ABORT
))
10688 local_define_builtin ("__builtin_abort", ftype
, BUILT_IN_ABORT
,
10690 ECF_LEAF
| ECF_NORETURN
| ECF_CONST
| ECF_COLD
);
10693 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
)
10694 || !builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
10696 ftype
= build_function_type_list (ptr_type_node
,
10697 ptr_type_node
, const_ptr_type_node
,
10698 size_type_node
, NULL_TREE
);
10700 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
))
10701 local_define_builtin ("__builtin_memcpy", ftype
, BUILT_IN_MEMCPY
,
10702 "memcpy", ECF_NOTHROW
| ECF_LEAF
| ECF_RET1
);
10703 if (!builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
10704 local_define_builtin ("__builtin_memmove", ftype
, BUILT_IN_MEMMOVE
,
10705 "memmove", ECF_NOTHROW
| ECF_LEAF
| ECF_RET1
);
10708 if (!builtin_decl_explicit_p (BUILT_IN_MEMCMP
))
10710 ftype
= build_function_type_list (integer_type_node
, const_ptr_type_node
,
10711 const_ptr_type_node
, size_type_node
,
10713 local_define_builtin ("__builtin_memcmp", ftype
, BUILT_IN_MEMCMP
,
10714 "memcmp", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10717 if (!builtin_decl_explicit_p (BUILT_IN_MEMSET
))
10719 ftype
= build_function_type_list (ptr_type_node
,
10720 ptr_type_node
, integer_type_node
,
10721 size_type_node
, NULL_TREE
);
10722 local_define_builtin ("__builtin_memset", ftype
, BUILT_IN_MEMSET
,
10723 "memset", ECF_NOTHROW
| ECF_LEAF
| ECF_RET1
);
10726 /* If we're checking the stack, `alloca' can throw. */
10727 const int alloca_flags
10728 = ECF_MALLOC
| ECF_LEAF
| (flag_stack_check
? 0 : ECF_NOTHROW
);
10730 if (!builtin_decl_explicit_p (BUILT_IN_ALLOCA
))
10732 ftype
= build_function_type_list (ptr_type_node
,
10733 size_type_node
, NULL_TREE
);
10734 local_define_builtin ("__builtin_alloca", ftype
, BUILT_IN_ALLOCA
,
10735 "alloca", alloca_flags
);
10738 ftype
= build_function_type_list (ptr_type_node
, size_type_node
,
10739 size_type_node
, NULL_TREE
);
10740 local_define_builtin ("__builtin_alloca_with_align", ftype
,
10741 BUILT_IN_ALLOCA_WITH_ALIGN
,
10742 "__builtin_alloca_with_align",
10745 ftype
= build_function_type_list (void_type_node
,
10746 ptr_type_node
, ptr_type_node
,
10747 ptr_type_node
, NULL_TREE
);
10748 local_define_builtin ("__builtin_init_trampoline", ftype
,
10749 BUILT_IN_INIT_TRAMPOLINE
,
10750 "__builtin_init_trampoline", ECF_NOTHROW
| ECF_LEAF
);
10751 local_define_builtin ("__builtin_init_heap_trampoline", ftype
,
10752 BUILT_IN_INIT_HEAP_TRAMPOLINE
,
10753 "__builtin_init_heap_trampoline",
10754 ECF_NOTHROW
| ECF_LEAF
);
10755 local_define_builtin ("__builtin_init_descriptor", ftype
,
10756 BUILT_IN_INIT_DESCRIPTOR
,
10757 "__builtin_init_descriptor", ECF_NOTHROW
| ECF_LEAF
);
10759 ftype
= build_function_type_list (ptr_type_node
, ptr_type_node
, NULL_TREE
);
10760 local_define_builtin ("__builtin_adjust_trampoline", ftype
,
10761 BUILT_IN_ADJUST_TRAMPOLINE
,
10762 "__builtin_adjust_trampoline",
10763 ECF_CONST
| ECF_NOTHROW
);
10764 local_define_builtin ("__builtin_adjust_descriptor", ftype
,
10765 BUILT_IN_ADJUST_DESCRIPTOR
,
10766 "__builtin_adjust_descriptor",
10767 ECF_CONST
| ECF_NOTHROW
);
10769 ftype
= build_function_type_list (void_type_node
,
10770 ptr_type_node
, ptr_type_node
, NULL_TREE
);
10771 local_define_builtin ("__builtin_nonlocal_goto", ftype
,
10772 BUILT_IN_NONLOCAL_GOTO
,
10773 "__builtin_nonlocal_goto",
10774 ECF_NORETURN
| ECF_NOTHROW
);
10776 ftype
= build_function_type_list (void_type_node
,
10777 ptr_type_node
, ptr_type_node
, NULL_TREE
);
10778 local_define_builtin ("__builtin_setjmp_setup", ftype
,
10779 BUILT_IN_SETJMP_SETUP
,
10780 "__builtin_setjmp_setup", ECF_NOTHROW
);
10782 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10783 local_define_builtin ("__builtin_setjmp_receiver", ftype
,
10784 BUILT_IN_SETJMP_RECEIVER
,
10785 "__builtin_setjmp_receiver", ECF_NOTHROW
| ECF_LEAF
);
10787 ftype
= build_function_type_list (ptr_type_node
, NULL_TREE
);
10788 local_define_builtin ("__builtin_stack_save", ftype
, BUILT_IN_STACK_SAVE
,
10789 "__builtin_stack_save", ECF_NOTHROW
| ECF_LEAF
);
10791 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10792 local_define_builtin ("__builtin_stack_restore", ftype
,
10793 BUILT_IN_STACK_RESTORE
,
10794 "__builtin_stack_restore", ECF_NOTHROW
| ECF_LEAF
);
10796 ftype
= build_function_type_list (integer_type_node
, const_ptr_type_node
,
10797 const_ptr_type_node
, size_type_node
,
10799 local_define_builtin ("__builtin_memcmp_eq", ftype
, BUILT_IN_MEMCMP_EQ
,
10800 "__builtin_memcmp_eq",
10801 ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10803 /* If there's a possibility that we might use the ARM EABI, build the
10804 alternate __cxa_end_cleanup node used to resume from C++. */
10805 if (targetm
.arm_eabi_unwinder
)
10807 ftype
= build_function_type_list (void_type_node
, NULL_TREE
);
10808 local_define_builtin ("__builtin_cxa_end_cleanup", ftype
,
10809 BUILT_IN_CXA_END_CLEANUP
,
10810 "__cxa_end_cleanup", ECF_NORETURN
| ECF_LEAF
);
10813 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10814 local_define_builtin ("__builtin_unwind_resume", ftype
,
10815 BUILT_IN_UNWIND_RESUME
,
10816 ((targetm_common
.except_unwind_info (&global_options
)
10818 ? "_Unwind_SjLj_Resume" : "_Unwind_Resume"),
10821 if (builtin_decl_explicit (BUILT_IN_RETURN_ADDRESS
) == NULL_TREE
)
10823 ftype
= build_function_type_list (ptr_type_node
, integer_type_node
,
10825 local_define_builtin ("__builtin_return_address", ftype
,
10826 BUILT_IN_RETURN_ADDRESS
,
10827 "__builtin_return_address",
10831 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
)
10832 || !builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
10834 ftype
= build_function_type_list (void_type_node
, ptr_type_node
,
10835 ptr_type_node
, NULL_TREE
);
10836 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
))
10837 local_define_builtin ("__cyg_profile_func_enter", ftype
,
10838 BUILT_IN_PROFILE_FUNC_ENTER
,
10839 "__cyg_profile_func_enter", 0);
10840 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
10841 local_define_builtin ("__cyg_profile_func_exit", ftype
,
10842 BUILT_IN_PROFILE_FUNC_EXIT
,
10843 "__cyg_profile_func_exit", 0);
10846 /* The exception object and filter values from the runtime. The argument
10847 must be zero before exception lowering, i.e. from the front end. After
10848 exception lowering, it will be the region number for the exception
10849 landing pad. These functions are PURE instead of CONST to prevent
10850 them from being hoisted past the exception edge that will initialize
10851 its value in the landing pad. */
10852 ftype
= build_function_type_list (ptr_type_node
,
10853 integer_type_node
, NULL_TREE
);
10854 ecf_flags
= ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
;
10855 /* Only use TM_PURE if we have TM language support. */
10856 if (builtin_decl_explicit_p (BUILT_IN_TM_LOAD_1
))
10857 ecf_flags
|= ECF_TM_PURE
;
10858 local_define_builtin ("__builtin_eh_pointer", ftype
, BUILT_IN_EH_POINTER
,
10859 "__builtin_eh_pointer", ecf_flags
);
10861 tmp
= lang_hooks
.types
.type_for_mode (targetm
.eh_return_filter_mode (), 0);
10862 ftype
= build_function_type_list (tmp
, integer_type_node
, NULL_TREE
);
10863 local_define_builtin ("__builtin_eh_filter", ftype
, BUILT_IN_EH_FILTER
,
10864 "__builtin_eh_filter", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10866 ftype
= build_function_type_list (void_type_node
,
10867 integer_type_node
, integer_type_node
,
10869 local_define_builtin ("__builtin_eh_copy_values", ftype
,
10870 BUILT_IN_EH_COPY_VALUES
,
10871 "__builtin_eh_copy_values", ECF_NOTHROW
);
10873 /* Complex multiplication and division. These are handled as builtins
10874 rather than optabs because emit_library_call_value doesn't support
10875 complex. Further, we can do slightly better with folding these
10876 beasties if the real and complex parts of the arguments are separate. */
10880 for (mode
= MIN_MODE_COMPLEX_FLOAT
; mode
<= MAX_MODE_COMPLEX_FLOAT
; ++mode
)
10882 char mode_name_buf
[4], *q
;
10884 enum built_in_function mcode
, dcode
;
10885 tree type
, inner_type
;
10886 const char *prefix
= "__";
10888 if (targetm
.libfunc_gnu_prefix
)
10891 type
= lang_hooks
.types
.type_for_mode ((machine_mode
) mode
, 0);
10894 inner_type
= TREE_TYPE (type
);
10896 ftype
= build_function_type_list (type
, inner_type
, inner_type
,
10897 inner_type
, inner_type
, NULL_TREE
);
10899 mcode
= ((enum built_in_function
)
10900 (BUILT_IN_COMPLEX_MUL_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
10901 dcode
= ((enum built_in_function
)
10902 (BUILT_IN_COMPLEX_DIV_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
10904 for (p
= GET_MODE_NAME (mode
), q
= mode_name_buf
; *p
; p
++, q
++)
10908 built_in_names
[mcode
] = concat (prefix
, "mul", mode_name_buf
, "3",
10910 local_define_builtin (built_in_names
[mcode
], ftype
, mcode
,
10911 built_in_names
[mcode
],
10912 ECF_CONST
| ECF_NOTHROW
| ECF_LEAF
);
10914 built_in_names
[dcode
] = concat (prefix
, "div", mode_name_buf
, "3",
10916 local_define_builtin (built_in_names
[dcode
], ftype
, dcode
,
10917 built_in_names
[dcode
],
10918 ECF_CONST
| ECF_NOTHROW
| ECF_LEAF
);
10922 init_internal_fns ();
10925 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
10928 If we requested a pointer to a vector, build up the pointers that
10929 we stripped off while looking for the inner type. Similarly for
10930 return values from functions.
10932 The argument TYPE is the top of the chain, and BOTTOM is the
10933 new type which we will point to. */
10936 reconstruct_complex_type (tree type
, tree bottom
)
10940 if (TREE_CODE (type
) == POINTER_TYPE
)
10942 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10943 outer
= build_pointer_type_for_mode (inner
, TYPE_MODE (type
),
10944 TYPE_REF_CAN_ALIAS_ALL (type
));
10946 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
10948 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10949 outer
= build_reference_type_for_mode (inner
, TYPE_MODE (type
),
10950 TYPE_REF_CAN_ALIAS_ALL (type
));
10952 else if (TREE_CODE (type
) == ARRAY_TYPE
)
10954 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10955 outer
= build_array_type (inner
, TYPE_DOMAIN (type
));
10957 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10959 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10960 outer
= build_function_type (inner
, TYPE_ARG_TYPES (type
));
10962 else if (TREE_CODE (type
) == METHOD_TYPE
)
10964 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10965 /* The build_method_type_directly() routine prepends 'this' to argument list,
10966 so we must compensate by getting rid of it. */
10968 = build_method_type_directly
10969 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
))),
10971 TREE_CHAIN (TYPE_ARG_TYPES (type
)));
10973 else if (TREE_CODE (type
) == OFFSET_TYPE
)
10975 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10976 outer
= build_offset_type (TYPE_OFFSET_BASETYPE (type
), inner
);
10981 return build_type_attribute_qual_variant (outer
, TYPE_ATTRIBUTES (type
),
10982 TYPE_QUALS (type
));
10985 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
10988 build_vector_type_for_mode (tree innertype
, machine_mode mode
)
10992 switch (GET_MODE_CLASS (mode
))
10994 case MODE_VECTOR_INT
:
10995 case MODE_VECTOR_FLOAT
:
10996 case MODE_VECTOR_FRACT
:
10997 case MODE_VECTOR_UFRACT
:
10998 case MODE_VECTOR_ACCUM
:
10999 case MODE_VECTOR_UACCUM
:
11000 nunits
= GET_MODE_NUNITS (mode
);
11004 /* Check that there are no leftover bits. */
11005 gcc_assert (GET_MODE_BITSIZE (mode
)
11006 % TREE_INT_CST_LOW (TYPE_SIZE (innertype
)) == 0);
11008 nunits
= GET_MODE_BITSIZE (mode
)
11009 / TREE_INT_CST_LOW (TYPE_SIZE (innertype
));
11013 gcc_unreachable ();
11016 return make_vector_type (innertype
, nunits
, mode
);
11019 /* Similarly, but takes the inner type and number of units, which must be
11023 build_vector_type (tree innertype
, int nunits
)
11025 return make_vector_type (innertype
, nunits
, VOIDmode
);
11028 /* Build truth vector with specified length and number of units. */
11031 build_truth_vector_type (unsigned nunits
, unsigned vector_size
)
11033 machine_mode mask_mode
= targetm
.vectorize
.get_mask_mode (nunits
,
11036 gcc_assert (mask_mode
!= VOIDmode
);
11038 unsigned HOST_WIDE_INT vsize
;
11039 if (mask_mode
== BLKmode
)
11040 vsize
= vector_size
* BITS_PER_UNIT
;
11042 vsize
= GET_MODE_BITSIZE (mask_mode
);
11044 unsigned HOST_WIDE_INT esize
= vsize
/ nunits
;
11045 gcc_assert (esize
* nunits
== vsize
);
11047 tree bool_type
= build_nonstandard_boolean_type (esize
);
11049 return make_vector_type (bool_type
, nunits
, mask_mode
);
11052 /* Returns a vector type corresponding to a comparison of VECTYPE. */
11055 build_same_sized_truth_vector_type (tree vectype
)
11057 if (VECTOR_BOOLEAN_TYPE_P (vectype
))
11060 unsigned HOST_WIDE_INT size
= GET_MODE_SIZE (TYPE_MODE (vectype
));
11063 size
= tree_to_uhwi (TYPE_SIZE_UNIT (vectype
));
11065 return build_truth_vector_type (TYPE_VECTOR_SUBPARTS (vectype
), size
);
11068 /* Similarly, but builds a variant type with TYPE_VECTOR_OPAQUE set. */
11071 build_opaque_vector_type (tree innertype
, int nunits
)
11073 tree t
= make_vector_type (innertype
, nunits
, VOIDmode
);
11075 /* We always build the non-opaque variant before the opaque one,
11076 so if it already exists, it is TYPE_NEXT_VARIANT of this one. */
11077 cand
= TYPE_NEXT_VARIANT (t
);
11079 && TYPE_VECTOR_OPAQUE (cand
)
11080 && check_qualified_type (cand
, t
, TYPE_QUALS (t
)))
11082 /* Othewise build a variant type and make sure to queue it after
11083 the non-opaque type. */
11084 cand
= build_distinct_type_copy (t
);
11085 TYPE_VECTOR_OPAQUE (cand
) = true;
11086 TYPE_CANONICAL (cand
) = TYPE_CANONICAL (t
);
11087 TYPE_NEXT_VARIANT (cand
) = TYPE_NEXT_VARIANT (t
);
11088 TYPE_NEXT_VARIANT (t
) = cand
;
11089 TYPE_MAIN_VARIANT (cand
) = TYPE_MAIN_VARIANT (t
);
11094 /* Given an initializer INIT, return TRUE if INIT is zero or some
11095 aggregate of zeros. Otherwise return FALSE. */
11097 initializer_zerop (const_tree init
)
11103 switch (TREE_CODE (init
))
11106 return integer_zerop (init
);
11109 /* ??? Note that this is not correct for C4X float formats. There,
11110 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
11111 negative exponent. */
11112 return real_zerop (init
)
11113 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init
));
11116 return fixed_zerop (init
);
11119 return integer_zerop (init
)
11120 || (real_zerop (init
)
11121 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init
)))
11122 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init
))));
11127 for (i
= 0; i
< VECTOR_CST_NELTS (init
); ++i
)
11128 if (!initializer_zerop (VECTOR_CST_ELT (init
, i
)))
11135 unsigned HOST_WIDE_INT idx
;
11137 if (TREE_CLOBBER_P (init
))
11139 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init
), idx
, elt
)
11140 if (!initializer_zerop (elt
))
11149 /* We need to loop through all elements to handle cases like
11150 "\0" and "\0foobar". */
11151 for (i
= 0; i
< TREE_STRING_LENGTH (init
); ++i
)
11152 if (TREE_STRING_POINTER (init
)[i
] != '\0')
11163 /* Check if vector VEC consists of all the equal elements and
11164 that the number of elements corresponds to the type of VEC.
11165 The function returns first element of the vector
11166 or NULL_TREE if the vector is not uniform. */
11168 uniform_vector_p (const_tree vec
)
11173 if (vec
== NULL_TREE
)
11176 gcc_assert (VECTOR_TYPE_P (TREE_TYPE (vec
)));
11178 if (TREE_CODE (vec
) == VECTOR_CST
)
11180 first
= VECTOR_CST_ELT (vec
, 0);
11181 for (i
= 1; i
< VECTOR_CST_NELTS (vec
); ++i
)
11182 if (!operand_equal_p (first
, VECTOR_CST_ELT (vec
, i
), 0))
11188 else if (TREE_CODE (vec
) == CONSTRUCTOR
)
11190 first
= error_mark_node
;
11192 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (vec
), i
, t
)
11199 if (!operand_equal_p (first
, t
, 0))
11202 if (i
!= TYPE_VECTOR_SUBPARTS (TREE_TYPE (vec
)))
11211 /* Build an empty statement at location LOC. */
11214 build_empty_stmt (location_t loc
)
11216 tree t
= build1 (NOP_EXPR
, void_type_node
, size_zero_node
);
11217 SET_EXPR_LOCATION (t
, loc
);
11222 /* Build an OpenMP clause with code CODE. LOC is the location of the
11226 build_omp_clause (location_t loc
, enum omp_clause_code code
)
11231 length
= omp_clause_num_ops
[code
];
11232 size
= (sizeof (struct tree_omp_clause
) + (length
- 1) * sizeof (tree
));
11234 record_node_allocation_statistics (OMP_CLAUSE
, size
);
11236 t
= (tree
) ggc_internal_alloc (size
);
11237 memset (t
, 0, size
);
11238 TREE_SET_CODE (t
, OMP_CLAUSE
);
11239 OMP_CLAUSE_SET_CODE (t
, code
);
11240 OMP_CLAUSE_LOCATION (t
) = loc
;
11245 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
11246 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
11247 Except for the CODE and operand count field, other storage for the
11248 object is initialized to zeros. */
11251 build_vl_exp (enum tree_code code
, int len MEM_STAT_DECL
)
11254 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_exp
);
11256 gcc_assert (TREE_CODE_CLASS (code
) == tcc_vl_exp
);
11257 gcc_assert (len
>= 1);
11259 record_node_allocation_statistics (code
, length
);
11261 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
11263 TREE_SET_CODE (t
, code
);
11265 /* Can't use TREE_OPERAND to store the length because if checking is
11266 enabled, it will try to check the length before we store it. :-P */
11267 t
->exp
.operands
[0] = build_int_cst (sizetype
, len
);
11272 /* Helper function for build_call_* functions; build a CALL_EXPR with
11273 indicated RETURN_TYPE, FN, and NARGS, but do not initialize any of
11274 the argument slots. */
11277 build_call_1 (tree return_type
, tree fn
, int nargs
)
11281 t
= build_vl_exp (CALL_EXPR
, nargs
+ 3);
11282 TREE_TYPE (t
) = return_type
;
11283 CALL_EXPR_FN (t
) = fn
;
11284 CALL_EXPR_STATIC_CHAIN (t
) = NULL
;
11289 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
11290 FN and a null static chain slot. NARGS is the number of call arguments
11291 which are specified as "..." arguments. */
11294 build_call_nary (tree return_type
, tree fn
, int nargs
, ...)
11298 va_start (args
, nargs
);
11299 ret
= build_call_valist (return_type
, fn
, nargs
, args
);
11304 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
11305 FN and a null static chain slot. NARGS is the number of call arguments
11306 which are specified as a va_list ARGS. */
11309 build_call_valist (tree return_type
, tree fn
, int nargs
, va_list args
)
11314 t
= build_call_1 (return_type
, fn
, nargs
);
11315 for (i
= 0; i
< nargs
; i
++)
11316 CALL_EXPR_ARG (t
, i
) = va_arg (args
, tree
);
11317 process_call_operands (t
);
11321 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
11322 FN and a null static chain slot. NARGS is the number of call arguments
11323 which are specified as a tree array ARGS. */
11326 build_call_array_loc (location_t loc
, tree return_type
, tree fn
,
11327 int nargs
, const tree
*args
)
11332 t
= build_call_1 (return_type
, fn
, nargs
);
11333 for (i
= 0; i
< nargs
; i
++)
11334 CALL_EXPR_ARG (t
, i
) = args
[i
];
11335 process_call_operands (t
);
11336 SET_EXPR_LOCATION (t
, loc
);
11340 /* Like build_call_array, but takes a vec. */
11343 build_call_vec (tree return_type
, tree fn
, vec
<tree
, va_gc
> *args
)
11348 ret
= build_call_1 (return_type
, fn
, vec_safe_length (args
));
11349 FOR_EACH_VEC_SAFE_ELT (args
, ix
, t
)
11350 CALL_EXPR_ARG (ret
, ix
) = t
;
11351 process_call_operands (ret
);
11355 /* Conveniently construct a function call expression. FNDECL names the
11356 function to be called and N arguments are passed in the array
11360 build_call_expr_loc_array (location_t loc
, tree fndecl
, int n
, tree
*argarray
)
11362 tree fntype
= TREE_TYPE (fndecl
);
11363 tree fn
= build1 (ADDR_EXPR
, build_pointer_type (fntype
), fndecl
);
11365 return fold_build_call_array_loc (loc
, TREE_TYPE (fntype
), fn
, n
, argarray
);
11368 /* Conveniently construct a function call expression. FNDECL names the
11369 function to be called and the arguments are passed in the vector
11373 build_call_expr_loc_vec (location_t loc
, tree fndecl
, vec
<tree
, va_gc
> *vec
)
11375 return build_call_expr_loc_array (loc
, fndecl
, vec_safe_length (vec
),
11376 vec_safe_address (vec
));
11380 /* Conveniently construct a function call expression. FNDECL names the
11381 function to be called, N is the number of arguments, and the "..."
11382 parameters are the argument expressions. */
11385 build_call_expr_loc (location_t loc
, tree fndecl
, int n
, ...)
11388 tree
*argarray
= XALLOCAVEC (tree
, n
);
11392 for (i
= 0; i
< n
; i
++)
11393 argarray
[i
] = va_arg (ap
, tree
);
11395 return build_call_expr_loc_array (loc
, fndecl
, n
, argarray
);
11398 /* Like build_call_expr_loc (UNKNOWN_LOCATION, ...). Duplicated because
11399 varargs macros aren't supported by all bootstrap compilers. */
11402 build_call_expr (tree fndecl
, int n
, ...)
11405 tree
*argarray
= XALLOCAVEC (tree
, n
);
11409 for (i
= 0; i
< n
; i
++)
11410 argarray
[i
] = va_arg (ap
, tree
);
11412 return build_call_expr_loc_array (UNKNOWN_LOCATION
, fndecl
, n
, argarray
);
11415 /* Build an internal call to IFN, with arguments ARGS[0:N-1] and with return
11416 type TYPE. This is just like CALL_EXPR, except its CALL_EXPR_FN is NULL.
11417 It will get gimplified later into an ordinary internal function. */
11420 build_call_expr_internal_loc_array (location_t loc
, internal_fn ifn
,
11421 tree type
, int n
, const tree
*args
)
11423 tree t
= build_call_1 (type
, NULL_TREE
, n
);
11424 for (int i
= 0; i
< n
; ++i
)
11425 CALL_EXPR_ARG (t
, i
) = args
[i
];
11426 SET_EXPR_LOCATION (t
, loc
);
11427 CALL_EXPR_IFN (t
) = ifn
;
11431 /* Build internal call expression. This is just like CALL_EXPR, except
11432 its CALL_EXPR_FN is NULL. It will get gimplified later into ordinary
11433 internal function. */
11436 build_call_expr_internal_loc (location_t loc
, enum internal_fn ifn
,
11437 tree type
, int n
, ...)
11440 tree
*argarray
= XALLOCAVEC (tree
, n
);
11444 for (i
= 0; i
< n
; i
++)
11445 argarray
[i
] = va_arg (ap
, tree
);
11447 return build_call_expr_internal_loc_array (loc
, ifn
, type
, n
, argarray
);
11450 /* Return a function call to FN, if the target is guaranteed to support it,
11453 N is the number of arguments, passed in the "...", and TYPE is the
11454 type of the return value. */
11457 maybe_build_call_expr_loc (location_t loc
, combined_fn fn
, tree type
,
11461 tree
*argarray
= XALLOCAVEC (tree
, n
);
11465 for (i
= 0; i
< n
; i
++)
11466 argarray
[i
] = va_arg (ap
, tree
);
11468 if (internal_fn_p (fn
))
11470 internal_fn ifn
= as_internal_fn (fn
);
11471 if (direct_internal_fn_p (ifn
))
11473 tree_pair types
= direct_internal_fn_types (ifn
, type
, argarray
);
11474 if (!direct_internal_fn_supported_p (ifn
, types
,
11475 OPTIMIZE_FOR_BOTH
))
11478 return build_call_expr_internal_loc_array (loc
, ifn
, type
, n
, argarray
);
11482 tree fndecl
= builtin_decl_implicit (as_builtin_fn (fn
));
11485 return build_call_expr_loc_array (loc
, fndecl
, n
, argarray
);
11489 /* Create a new constant string literal and return a char* pointer to it.
11490 The STRING_CST value is the LEN characters at STR. */
11492 build_string_literal (int len
, const char *str
)
11494 tree t
, elem
, index
, type
;
11496 t
= build_string (len
, str
);
11497 elem
= build_type_variant (char_type_node
, 1, 0);
11498 index
= build_index_type (size_int (len
- 1));
11499 type
= build_array_type (elem
, index
);
11500 TREE_TYPE (t
) = type
;
11501 TREE_CONSTANT (t
) = 1;
11502 TREE_READONLY (t
) = 1;
11503 TREE_STATIC (t
) = 1;
11505 type
= build_pointer_type (elem
);
11506 t
= build1 (ADDR_EXPR
, type
,
11507 build4 (ARRAY_REF
, elem
,
11508 t
, integer_zero_node
, NULL_TREE
, NULL_TREE
));
11514 /* Return true if T (assumed to be a DECL) must be assigned a memory
11518 needs_to_live_in_memory (const_tree t
)
11520 return (TREE_ADDRESSABLE (t
)
11521 || is_global_var (t
)
11522 || (TREE_CODE (t
) == RESULT_DECL
11523 && !DECL_BY_REFERENCE (t
)
11524 && aggregate_value_p (t
, current_function_decl
)));
11527 /* Return value of a constant X and sign-extend it. */
11530 int_cst_value (const_tree x
)
11532 unsigned bits
= TYPE_PRECISION (TREE_TYPE (x
));
11533 unsigned HOST_WIDE_INT val
= TREE_INT_CST_LOW (x
);
11535 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
11536 gcc_assert (cst_and_fits_in_hwi (x
));
11538 if (bits
< HOST_BITS_PER_WIDE_INT
)
11540 bool negative
= ((val
>> (bits
- 1)) & 1) != 0;
11542 val
|= HOST_WIDE_INT_M1U
<< (bits
- 1) << 1;
11544 val
&= ~(HOST_WIDE_INT_M1U
<< (bits
- 1) << 1);
11550 /* If TYPE is an integral or pointer type, return an integer type with
11551 the same precision which is unsigned iff UNSIGNEDP is true, or itself
11552 if TYPE is already an integer type of signedness UNSIGNEDP. */
11555 signed_or_unsigned_type_for (int unsignedp
, tree type
)
11557 if (TREE_CODE (type
) == INTEGER_TYPE
&& TYPE_UNSIGNED (type
) == unsignedp
)
11560 if (TREE_CODE (type
) == VECTOR_TYPE
)
11562 tree inner
= TREE_TYPE (type
);
11563 tree inner2
= signed_or_unsigned_type_for (unsignedp
, inner
);
11566 if (inner
== inner2
)
11568 return build_vector_type (inner2
, TYPE_VECTOR_SUBPARTS (type
));
11571 if (!INTEGRAL_TYPE_P (type
)
11572 && !POINTER_TYPE_P (type
)
11573 && TREE_CODE (type
) != OFFSET_TYPE
)
11576 return build_nonstandard_integer_type (TYPE_PRECISION (type
), unsignedp
);
11579 /* If TYPE is an integral or pointer type, return an integer type with
11580 the same precision which is unsigned, or itself if TYPE is already an
11581 unsigned integer type. */
11584 unsigned_type_for (tree type
)
11586 return signed_or_unsigned_type_for (1, type
);
11589 /* If TYPE is an integral or pointer type, return an integer type with
11590 the same precision which is signed, or itself if TYPE is already a
11591 signed integer type. */
11594 signed_type_for (tree type
)
11596 return signed_or_unsigned_type_for (0, type
);
11599 /* If TYPE is a vector type, return a signed integer vector type with the
11600 same width and number of subparts. Otherwise return boolean_type_node. */
11603 truth_type_for (tree type
)
11605 if (TREE_CODE (type
) == VECTOR_TYPE
)
11607 if (VECTOR_BOOLEAN_TYPE_P (type
))
11609 return build_truth_vector_type (TYPE_VECTOR_SUBPARTS (type
),
11610 GET_MODE_SIZE (TYPE_MODE (type
)));
11613 return boolean_type_node
;
11616 /* Returns the largest value obtainable by casting something in INNER type to
11620 upper_bound_in_type (tree outer
, tree inner
)
11622 unsigned int det
= 0;
11623 unsigned oprec
= TYPE_PRECISION (outer
);
11624 unsigned iprec
= TYPE_PRECISION (inner
);
11627 /* Compute a unique number for every combination. */
11628 det
|= (oprec
> iprec
) ? 4 : 0;
11629 det
|= TYPE_UNSIGNED (outer
) ? 2 : 0;
11630 det
|= TYPE_UNSIGNED (inner
) ? 1 : 0;
11632 /* Determine the exponent to use. */
11637 /* oprec <= iprec, outer: signed, inner: don't care. */
11642 /* oprec <= iprec, outer: unsigned, inner: don't care. */
11646 /* oprec > iprec, outer: signed, inner: signed. */
11650 /* oprec > iprec, outer: signed, inner: unsigned. */
11654 /* oprec > iprec, outer: unsigned, inner: signed. */
11658 /* oprec > iprec, outer: unsigned, inner: unsigned. */
11662 gcc_unreachable ();
11665 return wide_int_to_tree (outer
,
11666 wi::mask (prec
, false, TYPE_PRECISION (outer
)));
11669 /* Returns the smallest value obtainable by casting something in INNER type to
11673 lower_bound_in_type (tree outer
, tree inner
)
11675 unsigned oprec
= TYPE_PRECISION (outer
);
11676 unsigned iprec
= TYPE_PRECISION (inner
);
11678 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
11680 if (TYPE_UNSIGNED (outer
)
11681 /* If we are widening something of an unsigned type, OUTER type
11682 contains all values of INNER type. In particular, both INNER
11683 and OUTER types have zero in common. */
11684 || (oprec
> iprec
&& TYPE_UNSIGNED (inner
)))
11685 return build_int_cst (outer
, 0);
11688 /* If we are widening a signed type to another signed type, we
11689 want to obtain -2^^(iprec-1). If we are keeping the
11690 precision or narrowing to a signed type, we want to obtain
11692 unsigned prec
= oprec
> iprec
? iprec
: oprec
;
11693 return wide_int_to_tree (outer
,
11694 wi::mask (prec
- 1, true,
11695 TYPE_PRECISION (outer
)));
11699 /* Return nonzero if two operands that are suitable for PHI nodes are
11700 necessarily equal. Specifically, both ARG0 and ARG1 must be either
11701 SSA_NAME or invariant. Note that this is strictly an optimization.
11702 That is, callers of this function can directly call operand_equal_p
11703 and get the same result, only slower. */
11706 operand_equal_for_phi_arg_p (const_tree arg0
, const_tree arg1
)
11710 if (TREE_CODE (arg0
) == SSA_NAME
|| TREE_CODE (arg1
) == SSA_NAME
)
11712 return operand_equal_p (arg0
, arg1
, 0);
11715 /* Returns number of zeros at the end of binary representation of X. */
11718 num_ending_zeros (const_tree x
)
11720 return build_int_cst (TREE_TYPE (x
), wi::ctz (x
));
11724 #define WALK_SUBTREE(NODE) \
11727 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
11733 /* This is a subroutine of walk_tree that walks field of TYPE that are to
11734 be walked whenever a type is seen in the tree. Rest of operands and return
11735 value are as for walk_tree. */
11738 walk_type_fields (tree type
, walk_tree_fn func
, void *data
,
11739 hash_set
<tree
> *pset
, walk_tree_lh lh
)
11741 tree result
= NULL_TREE
;
11743 switch (TREE_CODE (type
))
11746 case REFERENCE_TYPE
:
11748 /* We have to worry about mutually recursive pointers. These can't
11749 be written in C. They can in Ada. It's pathological, but
11750 there's an ACATS test (c38102a) that checks it. Deal with this
11751 by checking if we're pointing to another pointer, that one
11752 points to another pointer, that one does too, and we have no htab.
11753 If so, get a hash table. We check three levels deep to avoid
11754 the cost of the hash table if we don't need one. */
11755 if (POINTER_TYPE_P (TREE_TYPE (type
))
11756 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type
)))
11757 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type
))))
11760 result
= walk_tree_without_duplicates (&TREE_TYPE (type
),
11771 WALK_SUBTREE (TREE_TYPE (type
));
11775 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type
));
11777 /* Fall through. */
11779 case FUNCTION_TYPE
:
11780 WALK_SUBTREE (TREE_TYPE (type
));
11784 /* We never want to walk into default arguments. */
11785 for (arg
= TYPE_ARG_TYPES (type
); arg
; arg
= TREE_CHAIN (arg
))
11786 WALK_SUBTREE (TREE_VALUE (arg
));
11791 /* Don't follow this nodes's type if a pointer for fear that
11792 we'll have infinite recursion. If we have a PSET, then we
11795 || (!POINTER_TYPE_P (TREE_TYPE (type
))
11796 && TREE_CODE (TREE_TYPE (type
)) != OFFSET_TYPE
))
11797 WALK_SUBTREE (TREE_TYPE (type
));
11798 WALK_SUBTREE (TYPE_DOMAIN (type
));
11802 WALK_SUBTREE (TREE_TYPE (type
));
11803 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type
));
11813 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
11814 called with the DATA and the address of each sub-tree. If FUNC returns a
11815 non-NULL value, the traversal is stopped, and the value returned by FUNC
11816 is returned. If PSET is non-NULL it is used to record the nodes visited,
11817 and to avoid visiting a node more than once. */
11820 walk_tree_1 (tree
*tp
, walk_tree_fn func
, void *data
,
11821 hash_set
<tree
> *pset
, walk_tree_lh lh
)
11823 enum tree_code code
;
11827 #define WALK_SUBTREE_TAIL(NODE) \
11831 goto tail_recurse; \
11836 /* Skip empty subtrees. */
11840 /* Don't walk the same tree twice, if the user has requested
11841 that we avoid doing so. */
11842 if (pset
&& pset
->add (*tp
))
11845 /* Call the function. */
11847 result
= (*func
) (tp
, &walk_subtrees
, data
);
11849 /* If we found something, return it. */
11853 code
= TREE_CODE (*tp
);
11855 /* Even if we didn't, FUNC may have decided that there was nothing
11856 interesting below this point in the tree. */
11857 if (!walk_subtrees
)
11859 /* But we still need to check our siblings. */
11860 if (code
== TREE_LIST
)
11861 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
11862 else if (code
== OMP_CLAUSE
)
11863 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11870 result
= (*lh
) (tp
, &walk_subtrees
, func
, data
, pset
);
11871 if (result
|| !walk_subtrees
)
11878 case IDENTIFIER_NODE
:
11885 case PLACEHOLDER_EXPR
:
11889 /* None of these have subtrees other than those already walked
11894 WALK_SUBTREE (TREE_VALUE (*tp
));
11895 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
11900 int len
= TREE_VEC_LENGTH (*tp
);
11905 /* Walk all elements but the first. */
11907 WALK_SUBTREE (TREE_VEC_ELT (*tp
, len
));
11909 /* Now walk the first one as a tail call. */
11910 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp
, 0));
11914 WALK_SUBTREE (TREE_REALPART (*tp
));
11915 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp
));
11919 unsigned HOST_WIDE_INT idx
;
11920 constructor_elt
*ce
;
11922 for (idx
= 0; vec_safe_iterate (CONSTRUCTOR_ELTS (*tp
), idx
, &ce
);
11924 WALK_SUBTREE (ce
->value
);
11929 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, 0));
11934 for (decl
= BIND_EXPR_VARS (*tp
); decl
; decl
= DECL_CHAIN (decl
))
11936 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
11937 into declarations that are just mentioned, rather than
11938 declared; they don't really belong to this part of the tree.
11939 And, we can see cycles: the initializer for a declaration
11940 can refer to the declaration itself. */
11941 WALK_SUBTREE (DECL_INITIAL (decl
));
11942 WALK_SUBTREE (DECL_SIZE (decl
));
11943 WALK_SUBTREE (DECL_SIZE_UNIT (decl
));
11945 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp
));
11948 case STATEMENT_LIST
:
11950 tree_stmt_iterator i
;
11951 for (i
= tsi_start (*tp
); !tsi_end_p (i
); tsi_next (&i
))
11952 WALK_SUBTREE (*tsi_stmt_ptr (i
));
11957 switch (OMP_CLAUSE_CODE (*tp
))
11959 case OMP_CLAUSE_GANG
:
11960 case OMP_CLAUSE__GRIDDIM_
:
11961 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 1));
11964 case OMP_CLAUSE_ASYNC
:
11965 case OMP_CLAUSE_WAIT
:
11966 case OMP_CLAUSE_WORKER
:
11967 case OMP_CLAUSE_VECTOR
:
11968 case OMP_CLAUSE_NUM_GANGS
:
11969 case OMP_CLAUSE_NUM_WORKERS
:
11970 case OMP_CLAUSE_VECTOR_LENGTH
:
11971 case OMP_CLAUSE_PRIVATE
:
11972 case OMP_CLAUSE_SHARED
:
11973 case OMP_CLAUSE_FIRSTPRIVATE
:
11974 case OMP_CLAUSE_COPYIN
:
11975 case OMP_CLAUSE_COPYPRIVATE
:
11976 case OMP_CLAUSE_FINAL
:
11977 case OMP_CLAUSE_IF
:
11978 case OMP_CLAUSE_NUM_THREADS
:
11979 case OMP_CLAUSE_SCHEDULE
:
11980 case OMP_CLAUSE_UNIFORM
:
11981 case OMP_CLAUSE_DEPEND
:
11982 case OMP_CLAUSE_NUM_TEAMS
:
11983 case OMP_CLAUSE_THREAD_LIMIT
:
11984 case OMP_CLAUSE_DEVICE
:
11985 case OMP_CLAUSE_DIST_SCHEDULE
:
11986 case OMP_CLAUSE_SAFELEN
:
11987 case OMP_CLAUSE_SIMDLEN
:
11988 case OMP_CLAUSE_ORDERED
:
11989 case OMP_CLAUSE_PRIORITY
:
11990 case OMP_CLAUSE_GRAINSIZE
:
11991 case OMP_CLAUSE_NUM_TASKS
:
11992 case OMP_CLAUSE_HINT
:
11993 case OMP_CLAUSE_TO_DECLARE
:
11994 case OMP_CLAUSE_LINK
:
11995 case OMP_CLAUSE_USE_DEVICE_PTR
:
11996 case OMP_CLAUSE_IS_DEVICE_PTR
:
11997 case OMP_CLAUSE__LOOPTEMP_
:
11998 case OMP_CLAUSE__SIMDUID_
:
11999 case OMP_CLAUSE__CILK_FOR_COUNT_
:
12000 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 0));
12003 case OMP_CLAUSE_INDEPENDENT
:
12004 case OMP_CLAUSE_NOWAIT
:
12005 case OMP_CLAUSE_DEFAULT
:
12006 case OMP_CLAUSE_UNTIED
:
12007 case OMP_CLAUSE_MERGEABLE
:
12008 case OMP_CLAUSE_PROC_BIND
:
12009 case OMP_CLAUSE_INBRANCH
:
12010 case OMP_CLAUSE_NOTINBRANCH
:
12011 case OMP_CLAUSE_FOR
:
12012 case OMP_CLAUSE_PARALLEL
:
12013 case OMP_CLAUSE_SECTIONS
:
12014 case OMP_CLAUSE_TASKGROUP
:
12015 case OMP_CLAUSE_NOGROUP
:
12016 case OMP_CLAUSE_THREADS
:
12017 case OMP_CLAUSE_SIMD
:
12018 case OMP_CLAUSE_DEFAULTMAP
:
12019 case OMP_CLAUSE_AUTO
:
12020 case OMP_CLAUSE_SEQ
:
12021 case OMP_CLAUSE_TILE
:
12022 case OMP_CLAUSE__SIMT_
:
12023 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
12025 case OMP_CLAUSE_LASTPRIVATE
:
12026 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
12027 WALK_SUBTREE (OMP_CLAUSE_LASTPRIVATE_STMT (*tp
));
12028 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
12030 case OMP_CLAUSE_COLLAPSE
:
12033 for (i
= 0; i
< 3; i
++)
12034 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
12035 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
12038 case OMP_CLAUSE_LINEAR
:
12039 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
12040 WALK_SUBTREE (OMP_CLAUSE_LINEAR_STEP (*tp
));
12041 WALK_SUBTREE (OMP_CLAUSE_LINEAR_STMT (*tp
));
12042 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
12044 case OMP_CLAUSE_ALIGNED
:
12045 case OMP_CLAUSE_FROM
:
12046 case OMP_CLAUSE_TO
:
12047 case OMP_CLAUSE_MAP
:
12048 case OMP_CLAUSE__CACHE_
:
12049 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
12050 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 1));
12051 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
12053 case OMP_CLAUSE_REDUCTION
:
12056 for (i
= 0; i
< 5; i
++)
12057 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
12058 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
12062 gcc_unreachable ();
12070 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
12071 But, we only want to walk once. */
12072 len
= (TREE_OPERAND (*tp
, 3) == TREE_OPERAND (*tp
, 1)) ? 2 : 3;
12073 for (i
= 0; i
< len
; ++i
)
12074 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
12075 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
));
12079 /* If this is a TYPE_DECL, walk into the fields of the type that it's
12080 defining. We only want to walk into these fields of a type in this
12081 case and not in the general case of a mere reference to the type.
12083 The criterion is as follows: if the field can be an expression, it
12084 must be walked only here. This should be in keeping with the fields
12085 that are directly gimplified in gimplify_type_sizes in order for the
12086 mark/copy-if-shared/unmark machinery of the gimplifier to work with
12087 variable-sized types.
12089 Note that DECLs get walked as part of processing the BIND_EXPR. */
12090 if (TREE_CODE (DECL_EXPR_DECL (*tp
)) == TYPE_DECL
)
12092 tree
*type_p
= &TREE_TYPE (DECL_EXPR_DECL (*tp
));
12093 if (TREE_CODE (*type_p
) == ERROR_MARK
)
12096 /* Call the function for the type. See if it returns anything or
12097 doesn't want us to continue. If we are to continue, walk both
12098 the normal fields and those for the declaration case. */
12099 result
= (*func
) (type_p
, &walk_subtrees
, data
);
12100 if (result
|| !walk_subtrees
)
12103 /* But do not walk a pointed-to type since it may itself need to
12104 be walked in the declaration case if it isn't anonymous. */
12105 if (!POINTER_TYPE_P (*type_p
))
12107 result
= walk_type_fields (*type_p
, func
, data
, pset
, lh
);
12112 /* If this is a record type, also walk the fields. */
12113 if (RECORD_OR_UNION_TYPE_P (*type_p
))
12117 for (field
= TYPE_FIELDS (*type_p
); field
;
12118 field
= DECL_CHAIN (field
))
12120 /* We'd like to look at the type of the field, but we can
12121 easily get infinite recursion. So assume it's pointed
12122 to elsewhere in the tree. Also, ignore things that
12124 if (TREE_CODE (field
) != FIELD_DECL
)
12127 WALK_SUBTREE (DECL_FIELD_OFFSET (field
));
12128 WALK_SUBTREE (DECL_SIZE (field
));
12129 WALK_SUBTREE (DECL_SIZE_UNIT (field
));
12130 if (TREE_CODE (*type_p
) == QUAL_UNION_TYPE
)
12131 WALK_SUBTREE (DECL_QUALIFIER (field
));
12135 /* Same for scalar types. */
12136 else if (TREE_CODE (*type_p
) == BOOLEAN_TYPE
12137 || TREE_CODE (*type_p
) == ENUMERAL_TYPE
12138 || TREE_CODE (*type_p
) == INTEGER_TYPE
12139 || TREE_CODE (*type_p
) == FIXED_POINT_TYPE
12140 || TREE_CODE (*type_p
) == REAL_TYPE
)
12142 WALK_SUBTREE (TYPE_MIN_VALUE (*type_p
));
12143 WALK_SUBTREE (TYPE_MAX_VALUE (*type_p
));
12146 WALK_SUBTREE (TYPE_SIZE (*type_p
));
12147 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p
));
12152 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code
)))
12156 /* Walk over all the sub-trees of this operand. */
12157 len
= TREE_OPERAND_LENGTH (*tp
);
12159 /* Go through the subtrees. We need to do this in forward order so
12160 that the scope of a FOR_EXPR is handled properly. */
12163 for (i
= 0; i
< len
- 1; ++i
)
12164 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
12165 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
- 1));
12168 /* If this is a type, walk the needed fields in the type. */
12169 else if (TYPE_P (*tp
))
12170 return walk_type_fields (*tp
, func
, data
, pset
, lh
);
12174 /* We didn't find what we were looking for. */
12177 #undef WALK_SUBTREE_TAIL
12179 #undef WALK_SUBTREE
12181 /* Like walk_tree, but does not walk duplicate nodes more than once. */
12184 walk_tree_without_duplicates_1 (tree
*tp
, walk_tree_fn func
, void *data
,
12189 hash_set
<tree
> pset
;
12190 result
= walk_tree_1 (tp
, func
, data
, &pset
, lh
);
12196 tree_block (tree t
)
12198 const enum tree_code_class c
= TREE_CODE_CLASS (TREE_CODE (t
));
12200 if (IS_EXPR_CODE_CLASS (c
))
12201 return LOCATION_BLOCK (t
->exp
.locus
);
12202 gcc_unreachable ();
12207 tree_set_block (tree t
, tree b
)
12209 const enum tree_code_class c
= TREE_CODE_CLASS (TREE_CODE (t
));
12211 if (IS_EXPR_CODE_CLASS (c
))
12213 t
->exp
.locus
= set_block (t
->exp
.locus
, b
);
12216 gcc_unreachable ();
12219 /* Create a nameless artificial label and put it in the current
12220 function context. The label has a location of LOC. Returns the
12221 newly created label. */
12224 create_artificial_label (location_t loc
)
12226 tree lab
= build_decl (loc
,
12227 LABEL_DECL
, NULL_TREE
, void_type_node
);
12229 DECL_ARTIFICIAL (lab
) = 1;
12230 DECL_IGNORED_P (lab
) = 1;
12231 DECL_CONTEXT (lab
) = current_function_decl
;
12235 /* Given a tree, try to return a useful variable name that we can use
12236 to prefix a temporary that is being assigned the value of the tree.
12237 I.E. given <temp> = &A, return A. */
12242 tree stripped_decl
;
12245 STRIP_NOPS (stripped_decl
);
12246 if (DECL_P (stripped_decl
) && DECL_NAME (stripped_decl
))
12247 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl
));
12248 else if (TREE_CODE (stripped_decl
) == SSA_NAME
)
12250 tree name
= SSA_NAME_IDENTIFIER (stripped_decl
);
12253 return IDENTIFIER_POINTER (name
);
12257 switch (TREE_CODE (stripped_decl
))
12260 return get_name (TREE_OPERAND (stripped_decl
, 0));
12267 /* Return true if TYPE has a variable argument list. */
12270 stdarg_p (const_tree fntype
)
12272 function_args_iterator args_iter
;
12273 tree n
= NULL_TREE
, t
;
12278 FOREACH_FUNCTION_ARGS (fntype
, t
, args_iter
)
12283 return n
!= NULL_TREE
&& n
!= void_type_node
;
12286 /* Return true if TYPE has a prototype. */
12289 prototype_p (const_tree fntype
)
12293 gcc_assert (fntype
!= NULL_TREE
);
12295 t
= TYPE_ARG_TYPES (fntype
);
12296 return (t
!= NULL_TREE
);
12299 /* If BLOCK is inlined from an __attribute__((__artificial__))
12300 routine, return pointer to location from where it has been
12303 block_nonartificial_location (tree block
)
12305 location_t
*ret
= NULL
;
12307 while (block
&& TREE_CODE (block
) == BLOCK
12308 && BLOCK_ABSTRACT_ORIGIN (block
))
12310 tree ao
= BLOCK_ABSTRACT_ORIGIN (block
);
12312 while (TREE_CODE (ao
) == BLOCK
12313 && BLOCK_ABSTRACT_ORIGIN (ao
)
12314 && BLOCK_ABSTRACT_ORIGIN (ao
) != ao
)
12315 ao
= BLOCK_ABSTRACT_ORIGIN (ao
);
12317 if (TREE_CODE (ao
) == FUNCTION_DECL
)
12319 /* If AO is an artificial inline, point RET to the
12320 call site locus at which it has been inlined and continue
12321 the loop, in case AO's caller is also an artificial
12323 if (DECL_DECLARED_INLINE_P (ao
)
12324 && lookup_attribute ("artificial", DECL_ATTRIBUTES (ao
)))
12325 ret
= &BLOCK_SOURCE_LOCATION (block
);
12329 else if (TREE_CODE (ao
) != BLOCK
)
12332 block
= BLOCK_SUPERCONTEXT (block
);
12338 /* If EXP is inlined from an __attribute__((__artificial__))
12339 function, return the location of the original call expression. */
12342 tree_nonartificial_location (tree exp
)
12344 location_t
*loc
= block_nonartificial_location (TREE_BLOCK (exp
));
12349 return EXPR_LOCATION (exp
);
12353 /* These are the hash table functions for the hash table of OPTIMIZATION_NODEq
12356 /* Return the hash code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
12359 cl_option_hasher::hash (tree x
)
12361 const_tree
const t
= x
;
12365 hashval_t hash
= 0;
12367 if (TREE_CODE (t
) == OPTIMIZATION_NODE
)
12369 p
= (const char *)TREE_OPTIMIZATION (t
);
12370 len
= sizeof (struct cl_optimization
);
12373 else if (TREE_CODE (t
) == TARGET_OPTION_NODE
)
12374 return cl_target_option_hash (TREE_TARGET_OPTION (t
));
12377 gcc_unreachable ();
12379 /* assume most opt flags are just 0/1, some are 2-3, and a few might be
12381 for (i
= 0; i
< len
; i
++)
12383 hash
= (hash
<< 4) ^ ((i
<< 2) | p
[i
]);
12388 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
12389 TARGET_OPTION tree node) is the same as that given by *Y, which is the
12393 cl_option_hasher::equal (tree x
, tree y
)
12395 const_tree
const xt
= x
;
12396 const_tree
const yt
= y
;
12401 if (TREE_CODE (xt
) != TREE_CODE (yt
))
12404 if (TREE_CODE (xt
) == OPTIMIZATION_NODE
)
12406 xp
= (const char *)TREE_OPTIMIZATION (xt
);
12407 yp
= (const char *)TREE_OPTIMIZATION (yt
);
12408 len
= sizeof (struct cl_optimization
);
12411 else if (TREE_CODE (xt
) == TARGET_OPTION_NODE
)
12413 return cl_target_option_eq (TREE_TARGET_OPTION (xt
),
12414 TREE_TARGET_OPTION (yt
));
12418 gcc_unreachable ();
12420 return (memcmp (xp
, yp
, len
) == 0);
12423 /* Build an OPTIMIZATION_NODE based on the options in OPTS. */
12426 build_optimization_node (struct gcc_options
*opts
)
12430 /* Use the cache of optimization nodes. */
12432 cl_optimization_save (TREE_OPTIMIZATION (cl_optimization_node
),
12435 tree
*slot
= cl_option_hash_table
->find_slot (cl_optimization_node
, INSERT
);
12439 /* Insert this one into the hash table. */
12440 t
= cl_optimization_node
;
12443 /* Make a new node for next time round. */
12444 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
12450 /* Build a TARGET_OPTION_NODE based on the options in OPTS. */
12453 build_target_option_node (struct gcc_options
*opts
)
12457 /* Use the cache of optimization nodes. */
12459 cl_target_option_save (TREE_TARGET_OPTION (cl_target_option_node
),
12462 tree
*slot
= cl_option_hash_table
->find_slot (cl_target_option_node
, INSERT
);
12466 /* Insert this one into the hash table. */
12467 t
= cl_target_option_node
;
12470 /* Make a new node for next time round. */
12471 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
12477 /* Clear TREE_TARGET_GLOBALS of all TARGET_OPTION_NODE trees,
12478 so that they aren't saved during PCH writing. */
12481 prepare_target_option_nodes_for_pch (void)
12483 hash_table
<cl_option_hasher
>::iterator iter
= cl_option_hash_table
->begin ();
12484 for (; iter
!= cl_option_hash_table
->end (); ++iter
)
12485 if (TREE_CODE (*iter
) == TARGET_OPTION_NODE
)
12486 TREE_TARGET_GLOBALS (*iter
) = NULL
;
12489 /* Determine the "ultimate origin" of a block. The block may be an inlined
12490 instance of an inlined instance of a block which is local to an inline
12491 function, so we have to trace all of the way back through the origin chain
12492 to find out what sort of node actually served as the original seed for the
12496 block_ultimate_origin (const_tree block
)
12498 tree immediate_origin
= BLOCK_ABSTRACT_ORIGIN (block
);
12500 /* BLOCK_ABSTRACT_ORIGIN can point to itself; ignore that if
12501 we're trying to output the abstract instance of this function. */
12502 if (BLOCK_ABSTRACT (block
) && immediate_origin
== block
)
12505 if (immediate_origin
== NULL_TREE
)
12510 tree lookahead
= immediate_origin
;
12514 ret_val
= lookahead
;
12515 lookahead
= (TREE_CODE (ret_val
) == BLOCK
12516 ? BLOCK_ABSTRACT_ORIGIN (ret_val
) : NULL
);
12518 while (lookahead
!= NULL
&& lookahead
!= ret_val
);
12520 /* The block's abstract origin chain may not be the *ultimate* origin of
12521 the block. It could lead to a DECL that has an abstract origin set.
12522 If so, we want that DECL's abstract origin (which is what DECL_ORIGIN
12523 will give us if it has one). Note that DECL's abstract origins are
12524 supposed to be the most distant ancestor (or so decl_ultimate_origin
12525 claims), so we don't need to loop following the DECL origins. */
12526 if (DECL_P (ret_val
))
12527 return DECL_ORIGIN (ret_val
);
12533 /* Return true iff conversion from INNER_TYPE to OUTER_TYPE generates
12537 tree_nop_conversion_p (const_tree outer_type
, const_tree inner_type
)
12539 /* Do not strip casts into or out of differing address spaces. */
12540 if (POINTER_TYPE_P (outer_type
)
12541 && TYPE_ADDR_SPACE (TREE_TYPE (outer_type
)) != ADDR_SPACE_GENERIC
)
12543 if (!POINTER_TYPE_P (inner_type
)
12544 || (TYPE_ADDR_SPACE (TREE_TYPE (outer_type
))
12545 != TYPE_ADDR_SPACE (TREE_TYPE (inner_type
))))
12548 else if (POINTER_TYPE_P (inner_type
)
12549 && TYPE_ADDR_SPACE (TREE_TYPE (inner_type
)) != ADDR_SPACE_GENERIC
)
12551 /* We already know that outer_type is not a pointer with
12552 a non-generic address space. */
12556 /* Use precision rather then machine mode when we can, which gives
12557 the correct answer even for submode (bit-field) types. */
12558 if ((INTEGRAL_TYPE_P (outer_type
)
12559 || POINTER_TYPE_P (outer_type
)
12560 || TREE_CODE (outer_type
) == OFFSET_TYPE
)
12561 && (INTEGRAL_TYPE_P (inner_type
)
12562 || POINTER_TYPE_P (inner_type
)
12563 || TREE_CODE (inner_type
) == OFFSET_TYPE
))
12564 return TYPE_PRECISION (outer_type
) == TYPE_PRECISION (inner_type
);
12566 /* Otherwise fall back on comparing machine modes (e.g. for
12567 aggregate types, floats). */
12568 return TYPE_MODE (outer_type
) == TYPE_MODE (inner_type
);
12571 /* Return true iff conversion in EXP generates no instruction. Mark
12572 it inline so that we fully inline into the stripping functions even
12573 though we have two uses of this function. */
12576 tree_nop_conversion (const_tree exp
)
12578 tree outer_type
, inner_type
;
12580 if (!CONVERT_EXPR_P (exp
)
12581 && TREE_CODE (exp
) != NON_LVALUE_EXPR
)
12583 if (TREE_OPERAND (exp
, 0) == error_mark_node
)
12586 outer_type
= TREE_TYPE (exp
);
12587 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
12592 return tree_nop_conversion_p (outer_type
, inner_type
);
12595 /* Return true iff conversion in EXP generates no instruction. Don't
12596 consider conversions changing the signedness. */
12599 tree_sign_nop_conversion (const_tree exp
)
12601 tree outer_type
, inner_type
;
12603 if (!tree_nop_conversion (exp
))
12606 outer_type
= TREE_TYPE (exp
);
12607 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
12609 return (TYPE_UNSIGNED (outer_type
) == TYPE_UNSIGNED (inner_type
)
12610 && POINTER_TYPE_P (outer_type
) == POINTER_TYPE_P (inner_type
));
12613 /* Strip conversions from EXP according to tree_nop_conversion and
12614 return the resulting expression. */
12617 tree_strip_nop_conversions (tree exp
)
12619 while (tree_nop_conversion (exp
))
12620 exp
= TREE_OPERAND (exp
, 0);
12624 /* Strip conversions from EXP according to tree_sign_nop_conversion
12625 and return the resulting expression. */
12628 tree_strip_sign_nop_conversions (tree exp
)
12630 while (tree_sign_nop_conversion (exp
))
12631 exp
= TREE_OPERAND (exp
, 0);
12635 /* Avoid any floating point extensions from EXP. */
12637 strip_float_extensions (tree exp
)
12639 tree sub
, expt
, subt
;
12641 /* For floating point constant look up the narrowest type that can hold
12642 it properly and handle it like (type)(narrowest_type)constant.
12643 This way we can optimize for instance a=a*2.0 where "a" is float
12644 but 2.0 is double constant. */
12645 if (TREE_CODE (exp
) == REAL_CST
&& !DECIMAL_FLOAT_TYPE_P (TREE_TYPE (exp
)))
12647 REAL_VALUE_TYPE orig
;
12650 orig
= TREE_REAL_CST (exp
);
12651 if (TYPE_PRECISION (TREE_TYPE (exp
)) > TYPE_PRECISION (float_type_node
)
12652 && exact_real_truncate (TYPE_MODE (float_type_node
), &orig
))
12653 type
= float_type_node
;
12654 else if (TYPE_PRECISION (TREE_TYPE (exp
))
12655 > TYPE_PRECISION (double_type_node
)
12656 && exact_real_truncate (TYPE_MODE (double_type_node
), &orig
))
12657 type
= double_type_node
;
12659 return build_real_truncate (type
, orig
);
12662 if (!CONVERT_EXPR_P (exp
))
12665 sub
= TREE_OPERAND (exp
, 0);
12666 subt
= TREE_TYPE (sub
);
12667 expt
= TREE_TYPE (exp
);
12669 if (!FLOAT_TYPE_P (subt
))
12672 if (DECIMAL_FLOAT_TYPE_P (expt
) != DECIMAL_FLOAT_TYPE_P (subt
))
12675 if (TYPE_PRECISION (subt
) > TYPE_PRECISION (expt
))
12678 return strip_float_extensions (sub
);
12681 /* Strip out all handled components that produce invariant
12685 strip_invariant_refs (const_tree op
)
12687 while (handled_component_p (op
))
12689 switch (TREE_CODE (op
))
12692 case ARRAY_RANGE_REF
:
12693 if (!is_gimple_constant (TREE_OPERAND (op
, 1))
12694 || TREE_OPERAND (op
, 2) != NULL_TREE
12695 || TREE_OPERAND (op
, 3) != NULL_TREE
)
12699 case COMPONENT_REF
:
12700 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
12706 op
= TREE_OPERAND (op
, 0);
12712 static GTY(()) tree gcc_eh_personality_decl
;
12714 /* Return the GCC personality function decl. */
12717 lhd_gcc_personality (void)
12719 if (!gcc_eh_personality_decl
)
12720 gcc_eh_personality_decl
= build_personality_function ("gcc");
12721 return gcc_eh_personality_decl
;
12724 /* TARGET is a call target of GIMPLE call statement
12725 (obtained by gimple_call_fn). Return true if it is
12726 OBJ_TYPE_REF representing an virtual call of C++ method.
12727 (As opposed to OBJ_TYPE_REF representing objc calls
12728 through a cast where middle-end devirtualization machinery
12732 virtual_method_call_p (const_tree target
)
12734 if (TREE_CODE (target
) != OBJ_TYPE_REF
)
12736 tree t
= TREE_TYPE (target
);
12737 gcc_checking_assert (TREE_CODE (t
) == POINTER_TYPE
);
12739 if (TREE_CODE (t
) == FUNCTION_TYPE
)
12741 gcc_checking_assert (TREE_CODE (t
) == METHOD_TYPE
);
12742 /* If we do not have BINFO associated, it means that type was built
12743 without devirtualization enabled. Do not consider this a virtual
12745 if (!TYPE_BINFO (obj_type_ref_class (target
)))
12750 /* REF is OBJ_TYPE_REF, return the class the ref corresponds to. */
12753 obj_type_ref_class (const_tree ref
)
12755 gcc_checking_assert (TREE_CODE (ref
) == OBJ_TYPE_REF
);
12756 ref
= TREE_TYPE (ref
);
12757 gcc_checking_assert (TREE_CODE (ref
) == POINTER_TYPE
);
12758 ref
= TREE_TYPE (ref
);
12759 /* We look for type THIS points to. ObjC also builds
12760 OBJ_TYPE_REF with non-method calls, Their first parameter
12761 ID however also corresponds to class type. */
12762 gcc_checking_assert (TREE_CODE (ref
) == METHOD_TYPE
12763 || TREE_CODE (ref
) == FUNCTION_TYPE
);
12764 ref
= TREE_VALUE (TYPE_ARG_TYPES (ref
));
12765 gcc_checking_assert (TREE_CODE (ref
) == POINTER_TYPE
);
12766 return TREE_TYPE (ref
);
12769 /* Lookup sub-BINFO of BINFO of TYPE at offset POS. */
12772 lookup_binfo_at_offset (tree binfo
, tree type
, HOST_WIDE_INT pos
)
12775 tree base_binfo
, b
;
12777 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
12778 if (pos
== tree_to_shwi (BINFO_OFFSET (base_binfo
))
12779 && types_same_for_odr (TREE_TYPE (base_binfo
), type
))
12781 else if ((b
= lookup_binfo_at_offset (base_binfo
, type
, pos
)) != NULL
)
12786 /* Try to find a base info of BINFO that would have its field decl at offset
12787 OFFSET within the BINFO type and which is of EXPECTED_TYPE. If it can be
12788 found, return, otherwise return NULL_TREE. */
12791 get_binfo_at_offset (tree binfo
, HOST_WIDE_INT offset
, tree expected_type
)
12793 tree type
= BINFO_TYPE (binfo
);
12797 HOST_WIDE_INT pos
, size
;
12801 if (types_same_for_odr (type
, expected_type
))
12806 for (fld
= TYPE_FIELDS (type
); fld
; fld
= DECL_CHAIN (fld
))
12808 if (TREE_CODE (fld
) != FIELD_DECL
|| !DECL_ARTIFICIAL (fld
))
12811 pos
= int_bit_position (fld
);
12812 size
= tree_to_uhwi (DECL_SIZE (fld
));
12813 if (pos
<= offset
&& (pos
+ size
) > offset
)
12816 if (!fld
|| TREE_CODE (TREE_TYPE (fld
)) != RECORD_TYPE
)
12819 /* Offset 0 indicates the primary base, whose vtable contents are
12820 represented in the binfo for the derived class. */
12821 else if (offset
!= 0)
12823 tree found_binfo
= NULL
, base_binfo
;
12824 /* Offsets in BINFO are in bytes relative to the whole structure
12825 while POS is in bits relative to the containing field. */
12826 int binfo_offset
= (tree_to_shwi (BINFO_OFFSET (binfo
)) + pos
12829 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
12830 if (tree_to_shwi (BINFO_OFFSET (base_binfo
)) == binfo_offset
12831 && types_same_for_odr (TREE_TYPE (base_binfo
), TREE_TYPE (fld
)))
12833 found_binfo
= base_binfo
;
12837 binfo
= found_binfo
;
12839 binfo
= lookup_binfo_at_offset (binfo
, TREE_TYPE (fld
),
12843 type
= TREE_TYPE (fld
);
12848 /* Returns true if X is a typedef decl. */
12851 is_typedef_decl (const_tree x
)
12853 return (x
&& TREE_CODE (x
) == TYPE_DECL
12854 && DECL_ORIGINAL_TYPE (x
) != NULL_TREE
);
12857 /* Returns true iff TYPE is a type variant created for a typedef. */
12860 typedef_variant_p (const_tree type
)
12862 return is_typedef_decl (TYPE_NAME (type
));
12865 /* Warn about a use of an identifier which was marked deprecated. */
12867 warn_deprecated_use (tree node
, tree attr
)
12871 if (node
== 0 || !warn_deprecated_decl
)
12877 attr
= DECL_ATTRIBUTES (node
);
12878 else if (TYPE_P (node
))
12880 tree decl
= TYPE_STUB_DECL (node
);
12882 attr
= lookup_attribute ("deprecated",
12883 TYPE_ATTRIBUTES (TREE_TYPE (decl
)));
12888 attr
= lookup_attribute ("deprecated", attr
);
12891 msg
= TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr
)));
12899 w
= warning (OPT_Wdeprecated_declarations
,
12900 "%qD is deprecated: %s", node
, msg
);
12902 w
= warning (OPT_Wdeprecated_declarations
,
12903 "%qD is deprecated", node
);
12905 inform (DECL_SOURCE_LOCATION (node
), "declared here");
12907 else if (TYPE_P (node
))
12909 tree what
= NULL_TREE
;
12910 tree decl
= TYPE_STUB_DECL (node
);
12912 if (TYPE_NAME (node
))
12914 if (TREE_CODE (TYPE_NAME (node
)) == IDENTIFIER_NODE
)
12915 what
= TYPE_NAME (node
);
12916 else if (TREE_CODE (TYPE_NAME (node
)) == TYPE_DECL
12917 && DECL_NAME (TYPE_NAME (node
)))
12918 what
= DECL_NAME (TYPE_NAME (node
));
12926 w
= warning (OPT_Wdeprecated_declarations
,
12927 "%qE is deprecated: %s", what
, msg
);
12929 w
= warning (OPT_Wdeprecated_declarations
,
12930 "%qE is deprecated", what
);
12935 w
= warning (OPT_Wdeprecated_declarations
,
12936 "type is deprecated: %s", msg
);
12938 w
= warning (OPT_Wdeprecated_declarations
,
12939 "type is deprecated");
12942 inform (DECL_SOURCE_LOCATION (decl
), "declared here");
12949 warning (OPT_Wdeprecated_declarations
, "%qE is deprecated: %s",
12952 warning (OPT_Wdeprecated_declarations
, "%qE is deprecated", what
);
12957 warning (OPT_Wdeprecated_declarations
, "type is deprecated: %s",
12960 warning (OPT_Wdeprecated_declarations
, "type is deprecated");
12966 /* Return true if REF has a COMPONENT_REF with a bit-field field declaration
12967 somewhere in it. */
12970 contains_bitfld_component_ref_p (const_tree ref
)
12972 while (handled_component_p (ref
))
12974 if (TREE_CODE (ref
) == COMPONENT_REF
12975 && DECL_BIT_FIELD (TREE_OPERAND (ref
, 1)))
12977 ref
= TREE_OPERAND (ref
, 0);
12983 /* Try to determine whether a TRY_CATCH expression can fall through.
12984 This is a subroutine of block_may_fallthru. */
12987 try_catch_may_fallthru (const_tree stmt
)
12989 tree_stmt_iterator i
;
12991 /* If the TRY block can fall through, the whole TRY_CATCH can
12993 if (block_may_fallthru (TREE_OPERAND (stmt
, 0)))
12996 i
= tsi_start (TREE_OPERAND (stmt
, 1));
12997 switch (TREE_CODE (tsi_stmt (i
)))
13000 /* We expect to see a sequence of CATCH_EXPR trees, each with a
13001 catch expression and a body. The whole TRY_CATCH may fall
13002 through iff any of the catch bodies falls through. */
13003 for (; !tsi_end_p (i
); tsi_next (&i
))
13005 if (block_may_fallthru (CATCH_BODY (tsi_stmt (i
))))
13010 case EH_FILTER_EXPR
:
13011 /* The exception filter expression only matters if there is an
13012 exception. If the exception does not match EH_FILTER_TYPES,
13013 we will execute EH_FILTER_FAILURE, and we will fall through
13014 if that falls through. If the exception does match
13015 EH_FILTER_TYPES, the stack unwinder will continue up the
13016 stack, so we will not fall through. We don't know whether we
13017 will throw an exception which matches EH_FILTER_TYPES or not,
13018 so we just ignore EH_FILTER_TYPES and assume that we might
13019 throw an exception which doesn't match. */
13020 return block_may_fallthru (EH_FILTER_FAILURE (tsi_stmt (i
)));
13023 /* This case represents statements to be executed when an
13024 exception occurs. Those statements are implicitly followed
13025 by a RESX statement to resume execution after the exception.
13026 So in this case the TRY_CATCH never falls through. */
13031 /* Try to determine if we can fall out of the bottom of BLOCK. This guess
13032 need not be 100% accurate; simply be conservative and return true if we
13033 don't know. This is used only to avoid stupidly generating extra code.
13034 If we're wrong, we'll just delete the extra code later. */
13037 block_may_fallthru (const_tree block
)
13039 /* This CONST_CAST is okay because expr_last returns its argument
13040 unmodified and we assign it to a const_tree. */
13041 const_tree stmt
= expr_last (CONST_CAST_TREE (block
));
13043 switch (stmt
? TREE_CODE (stmt
) : ERROR_MARK
)
13047 /* Easy cases. If the last statement of the block implies
13048 control transfer, then we can't fall through. */
13052 /* If SWITCH_LABELS is set, this is lowered, and represents a
13053 branch to a selected label and hence can not fall through.
13054 Otherwise SWITCH_BODY is set, and the switch can fall
13056 return SWITCH_LABELS (stmt
) == NULL_TREE
;
13059 if (block_may_fallthru (COND_EXPR_THEN (stmt
)))
13061 return block_may_fallthru (COND_EXPR_ELSE (stmt
));
13064 return block_may_fallthru (BIND_EXPR_BODY (stmt
));
13066 case TRY_CATCH_EXPR
:
13067 return try_catch_may_fallthru (stmt
);
13069 case TRY_FINALLY_EXPR
:
13070 /* The finally clause is always executed after the try clause,
13071 so if it does not fall through, then the try-finally will not
13072 fall through. Otherwise, if the try clause does not fall
13073 through, then when the finally clause falls through it will
13074 resume execution wherever the try clause was going. So the
13075 whole try-finally will only fall through if both the try
13076 clause and the finally clause fall through. */
13077 return (block_may_fallthru (TREE_OPERAND (stmt
, 0))
13078 && block_may_fallthru (TREE_OPERAND (stmt
, 1)));
13081 if (TREE_CODE (TREE_OPERAND (stmt
, 1)) == CALL_EXPR
)
13082 stmt
= TREE_OPERAND (stmt
, 1);
13088 /* Functions that do not return do not fall through. */
13089 return (call_expr_flags (stmt
) & ECF_NORETURN
) == 0;
13091 case CLEANUP_POINT_EXPR
:
13092 return block_may_fallthru (TREE_OPERAND (stmt
, 0));
13095 return block_may_fallthru (TREE_OPERAND (stmt
, 1));
13101 return lang_hooks
.block_may_fallthru (stmt
);
13105 /* True if we are using EH to handle cleanups. */
13106 static bool using_eh_for_cleanups_flag
= false;
13108 /* This routine is called from front ends to indicate eh should be used for
13111 using_eh_for_cleanups (void)
13113 using_eh_for_cleanups_flag
= true;
13116 /* Query whether EH is used for cleanups. */
13118 using_eh_for_cleanups_p (void)
13120 return using_eh_for_cleanups_flag
;
13123 /* Wrapper for tree_code_name to ensure that tree code is valid */
13125 get_tree_code_name (enum tree_code code
)
13127 const char *invalid
= "<invalid tree code>";
13129 if (code
>= MAX_TREE_CODES
)
13132 return tree_code_name
[code
];
13135 /* Drops the TREE_OVERFLOW flag from T. */
13138 drop_tree_overflow (tree t
)
13140 gcc_checking_assert (TREE_OVERFLOW (t
));
13142 /* For tree codes with a sharing machinery re-build the result. */
13143 if (TREE_CODE (t
) == INTEGER_CST
)
13144 return wide_int_to_tree (TREE_TYPE (t
), t
);
13146 /* Otherwise, as all tcc_constants are possibly shared, copy the node
13147 and drop the flag. */
13149 TREE_OVERFLOW (t
) = 0;
13151 /* For constants that contain nested constants, drop the flag
13152 from those as well. */
13153 if (TREE_CODE (t
) == COMPLEX_CST
)
13155 if (TREE_OVERFLOW (TREE_REALPART (t
)))
13156 TREE_REALPART (t
) = drop_tree_overflow (TREE_REALPART (t
));
13157 if (TREE_OVERFLOW (TREE_IMAGPART (t
)))
13158 TREE_IMAGPART (t
) = drop_tree_overflow (TREE_IMAGPART (t
));
13160 if (TREE_CODE (t
) == VECTOR_CST
)
13162 for (unsigned i
= 0; i
< VECTOR_CST_NELTS (t
); ++i
)
13164 tree
& elt
= VECTOR_CST_ELT (t
, i
);
13165 if (TREE_OVERFLOW (elt
))
13166 elt
= drop_tree_overflow (elt
);
13172 /* Given a memory reference expression T, return its base address.
13173 The base address of a memory reference expression is the main
13174 object being referenced. For instance, the base address for
13175 'array[i].fld[j]' is 'array'. You can think of this as stripping
13176 away the offset part from a memory address.
13178 This function calls handled_component_p to strip away all the inner
13179 parts of the memory reference until it reaches the base object. */
13182 get_base_address (tree t
)
13184 while (handled_component_p (t
))
13185 t
= TREE_OPERAND (t
, 0);
13187 if ((TREE_CODE (t
) == MEM_REF
13188 || TREE_CODE (t
) == TARGET_MEM_REF
)
13189 && TREE_CODE (TREE_OPERAND (t
, 0)) == ADDR_EXPR
)
13190 t
= TREE_OPERAND (TREE_OPERAND (t
, 0), 0);
13192 /* ??? Either the alias oracle or all callers need to properly deal
13193 with WITH_SIZE_EXPRs before we can look through those. */
13194 if (TREE_CODE (t
) == WITH_SIZE_EXPR
)
13200 /* Return a tree of sizetype representing the size, in bytes, of the element
13201 of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
13204 array_ref_element_size (tree exp
)
13206 tree aligned_size
= TREE_OPERAND (exp
, 3);
13207 tree elmt_type
= TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp
, 0)));
13208 location_t loc
= EXPR_LOCATION (exp
);
13210 /* If a size was specified in the ARRAY_REF, it's the size measured
13211 in alignment units of the element type. So multiply by that value. */
13214 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
13215 sizetype from another type of the same width and signedness. */
13216 if (TREE_TYPE (aligned_size
) != sizetype
)
13217 aligned_size
= fold_convert_loc (loc
, sizetype
, aligned_size
);
13218 return size_binop_loc (loc
, MULT_EXPR
, aligned_size
,
13219 size_int (TYPE_ALIGN_UNIT (elmt_type
)));
13222 /* Otherwise, take the size from that of the element type. Substitute
13223 any PLACEHOLDER_EXPR that we have. */
13225 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_SIZE_UNIT (elmt_type
), exp
);
13228 /* Return a tree representing the lower bound of the array mentioned in
13229 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
13232 array_ref_low_bound (tree exp
)
13234 tree domain_type
= TYPE_DOMAIN (TREE_TYPE (TREE_OPERAND (exp
, 0)));
13236 /* If a lower bound is specified in EXP, use it. */
13237 if (TREE_OPERAND (exp
, 2))
13238 return TREE_OPERAND (exp
, 2);
13240 /* Otherwise, if there is a domain type and it has a lower bound, use it,
13241 substituting for a PLACEHOLDER_EXPR as needed. */
13242 if (domain_type
&& TYPE_MIN_VALUE (domain_type
))
13243 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_MIN_VALUE (domain_type
), exp
);
13245 /* Otherwise, return a zero of the appropriate type. */
13246 return build_int_cst (TREE_TYPE (TREE_OPERAND (exp
, 1)), 0);
13249 /* Return a tree representing the upper bound of the array mentioned in
13250 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
13253 array_ref_up_bound (tree exp
)
13255 tree domain_type
= TYPE_DOMAIN (TREE_TYPE (TREE_OPERAND (exp
, 0)));
13257 /* If there is a domain type and it has an upper bound, use it, substituting
13258 for a PLACEHOLDER_EXPR as needed. */
13259 if (domain_type
&& TYPE_MAX_VALUE (domain_type
))
13260 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_MAX_VALUE (domain_type
), exp
);
13262 /* Otherwise fail. */
13266 /* Returns true if REF is an array reference or a component reference
13267 to an array at the end of a structure.
13268 If this is the case, the array may be allocated larger
13269 than its upper bound implies. */
13272 array_at_struct_end_p (tree ref
)
13276 if (TREE_CODE (ref
) == ARRAY_REF
13277 || TREE_CODE (ref
) == ARRAY_RANGE_REF
)
13279 atype
= TREE_TYPE (TREE_OPERAND (ref
, 0));
13280 ref
= TREE_OPERAND (ref
, 0);
13282 else if (TREE_CODE (ref
) == COMPONENT_REF
13283 && TREE_CODE (TREE_TYPE (TREE_OPERAND (ref
, 1))) == ARRAY_TYPE
)
13284 atype
= TREE_TYPE (TREE_OPERAND (ref
, 1));
13288 while (handled_component_p (ref
))
13290 /* If the reference chain contains a component reference to a
13291 non-union type and there follows another field the reference
13292 is not at the end of a structure. */
13293 if (TREE_CODE (ref
) == COMPONENT_REF
)
13295 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (ref
, 0))) == RECORD_TYPE
)
13297 tree nextf
= DECL_CHAIN (TREE_OPERAND (ref
, 1));
13298 while (nextf
&& TREE_CODE (nextf
) != FIELD_DECL
)
13299 nextf
= DECL_CHAIN (nextf
);
13304 /* If we have a multi-dimensional array we do not consider
13305 a non-innermost dimension as flex array if the whole
13306 multi-dimensional array is at struct end.
13307 Same for an array of aggregates with a trailing array
13309 else if (TREE_CODE (ref
) == ARRAY_REF
)
13311 else if (TREE_CODE (ref
) == ARRAY_RANGE_REF
)
13313 /* If we view an underlying object as sth else then what we
13314 gathered up to now is what we have to rely on. */
13315 else if (TREE_CODE (ref
) == VIEW_CONVERT_EXPR
)
13318 gcc_unreachable ();
13320 ref
= TREE_OPERAND (ref
, 0);
13323 /* The array now is at struct end. Treat flexible arrays as
13324 always subject to extend, even into just padding constrained by
13325 an underlying decl. */
13326 if (! TYPE_SIZE (atype
))
13331 if (TREE_CODE (ref
) == MEM_REF
13332 && TREE_CODE (TREE_OPERAND (ref
, 0)) == ADDR_EXPR
)
13334 size
= TYPE_SIZE (TREE_TYPE (ref
));
13335 ref
= TREE_OPERAND (TREE_OPERAND (ref
, 0), 0);
13338 /* If the reference is based on a declared entity, the size of the array
13339 is constrained by its given domain. (Do not trust commons PR/69368). */
13341 /* Be sure the size of MEM_REF target match. For example:
13344 struct foo *str = (struct foo *)&buf;
13346 str->trailin_array[2] = 1;
13348 is valid because BUF allocate enough space. */
13350 && (!size
|| (DECL_SIZE (ref
) != NULL
13351 && operand_equal_p (DECL_SIZE (ref
), size
, 0)))
13352 && !(flag_unconstrained_commons
13353 && VAR_P (ref
) && DECL_COMMON (ref
)))
13359 /* Return a tree representing the offset, in bytes, of the field referenced
13360 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
13363 component_ref_field_offset (tree exp
)
13365 tree aligned_offset
= TREE_OPERAND (exp
, 2);
13366 tree field
= TREE_OPERAND (exp
, 1);
13367 location_t loc
= EXPR_LOCATION (exp
);
13369 /* If an offset was specified in the COMPONENT_REF, it's the offset measured
13370 in units of DECL_OFFSET_ALIGN / BITS_PER_UNIT. So multiply by that
13372 if (aligned_offset
)
13374 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
13375 sizetype from another type of the same width and signedness. */
13376 if (TREE_TYPE (aligned_offset
) != sizetype
)
13377 aligned_offset
= fold_convert_loc (loc
, sizetype
, aligned_offset
);
13378 return size_binop_loc (loc
, MULT_EXPR
, aligned_offset
,
13379 size_int (DECL_OFFSET_ALIGN (field
)
13383 /* Otherwise, take the offset from that of the field. Substitute
13384 any PLACEHOLDER_EXPR that we have. */
13386 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (DECL_FIELD_OFFSET (field
), exp
);
13389 /* Return the machine mode of T. For vectors, returns the mode of the
13390 inner type. The main use case is to feed the result to HONOR_NANS,
13391 avoiding the BLKmode that a direct TYPE_MODE (T) might return. */
13394 element_mode (const_tree t
)
13398 if (VECTOR_TYPE_P (t
) || TREE_CODE (t
) == COMPLEX_TYPE
)
13400 return TYPE_MODE (t
);
13404 /* Veirfy that basic properties of T match TV and thus T can be a variant of
13405 TV. TV should be the more specified variant (i.e. the main variant). */
13408 verify_type_variant (const_tree t
, tree tv
)
13410 /* Type variant can differ by:
13412 - TYPE_QUALS: TYPE_READONLY, TYPE_VOLATILE, TYPE_ATOMIC, TYPE_RESTRICT,
13413 ENCODE_QUAL_ADDR_SPACE.
13414 - main variant may be TYPE_COMPLETE_P and variant types !TYPE_COMPLETE_P
13415 in this case some values may not be set in the variant types
13416 (see TYPE_COMPLETE_P checks).
13417 - it is possible to have TYPE_ARTIFICIAL variant of non-artifical type
13418 - by TYPE_NAME and attributes (i.e. when variant originate by typedef)
13419 - TYPE_CANONICAL (TYPE_ALIAS_SET is the same among variants)
13420 - by the alignment: TYPE_ALIGN and TYPE_USER_ALIGN
13421 - during LTO by TYPE_CONTEXT if type is TYPE_FILE_SCOPE_P
13422 this is necessary to make it possible to merge types form different TUs
13423 - arrays, pointers and references may have TREE_TYPE that is a variant
13424 of TREE_TYPE of their main variants.
13425 - aggregates may have new TYPE_FIELDS list that list variants of
13426 the main variant TYPE_FIELDS.
13427 - vector types may differ by TYPE_VECTOR_OPAQUE
13430 /* Convenience macro for matching individual fields. */
13431 #define verify_variant_match(flag) \
13433 if (flag (tv) != flag (t)) \
13435 error ("type variant differs by " #flag "."); \
13441 /* tree_base checks. */
13443 verify_variant_match (TREE_CODE
);
13444 /* FIXME: Ada builds non-artificial variants of artificial types. */
13445 if (TYPE_ARTIFICIAL (tv
) && 0)
13446 verify_variant_match (TYPE_ARTIFICIAL
);
13447 if (POINTER_TYPE_P (tv
))
13448 verify_variant_match (TYPE_REF_CAN_ALIAS_ALL
);
13449 /* FIXME: TYPE_SIZES_GIMPLIFIED may differs for Ada build. */
13450 verify_variant_match (TYPE_UNSIGNED
);
13451 verify_variant_match (TYPE_PACKED
);
13452 if (TREE_CODE (t
) == REFERENCE_TYPE
)
13453 verify_variant_match (TYPE_REF_IS_RVALUE
);
13454 if (AGGREGATE_TYPE_P (t
))
13455 verify_variant_match (TYPE_REVERSE_STORAGE_ORDER
);
13457 verify_variant_match (TYPE_SATURATING
);
13458 /* FIXME: This check trigger during libstdc++ build. */
13459 if (RECORD_OR_UNION_TYPE_P (t
) && COMPLETE_TYPE_P (t
) && 0)
13460 verify_variant_match (TYPE_FINAL_P
);
13462 /* tree_type_common checks. */
13464 if (COMPLETE_TYPE_P (t
))
13466 verify_variant_match (TYPE_MODE
);
13467 if (TREE_CODE (TYPE_SIZE (t
)) != PLACEHOLDER_EXPR
13468 && TREE_CODE (TYPE_SIZE (tv
)) != PLACEHOLDER_EXPR
)
13469 verify_variant_match (TYPE_SIZE
);
13470 if (TREE_CODE (TYPE_SIZE_UNIT (t
)) != PLACEHOLDER_EXPR
13471 && TREE_CODE (TYPE_SIZE_UNIT (tv
)) != PLACEHOLDER_EXPR
13472 && TYPE_SIZE_UNIT (t
) != TYPE_SIZE_UNIT (tv
))
13474 gcc_assert (!operand_equal_p (TYPE_SIZE_UNIT (t
),
13475 TYPE_SIZE_UNIT (tv
), 0));
13476 error ("type variant has different TYPE_SIZE_UNIT");
13478 error ("type variant's TYPE_SIZE_UNIT");
13479 debug_tree (TYPE_SIZE_UNIT (tv
));
13480 error ("type's TYPE_SIZE_UNIT");
13481 debug_tree (TYPE_SIZE_UNIT (t
));
13485 verify_variant_match (TYPE_PRECISION
);
13486 verify_variant_match (TYPE_NEEDS_CONSTRUCTING
);
13487 if (RECORD_OR_UNION_TYPE_P (t
))
13488 verify_variant_match (TYPE_TRANSPARENT_AGGR
);
13489 else if (TREE_CODE (t
) == ARRAY_TYPE
)
13490 verify_variant_match (TYPE_NONALIASED_COMPONENT
);
13491 /* During LTO we merge variant lists from diferent translation units
13492 that may differ BY TYPE_CONTEXT that in turn may point
13493 to TRANSLATION_UNIT_DECL.
13494 Ada also builds variants of types with different TYPE_CONTEXT. */
13495 if ((!in_lto_p
|| !TYPE_FILE_SCOPE_P (t
)) && 0)
13496 verify_variant_match (TYPE_CONTEXT
);
13497 verify_variant_match (TYPE_STRING_FLAG
);
13498 if (TYPE_ALIAS_SET_KNOWN_P (t
))
13500 error ("type variant with TYPE_ALIAS_SET_KNOWN_P");
13505 /* tree_type_non_common checks. */
13507 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
13508 and dangle the pointer from time to time. */
13509 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_VFIELD (t
) != TYPE_VFIELD (tv
)
13510 && (in_lto_p
|| !TYPE_VFIELD (tv
)
13511 || TREE_CODE (TYPE_VFIELD (tv
)) != TREE_LIST
))
13513 error ("type variant has different TYPE_VFIELD");
13517 if ((TREE_CODE (t
) == ENUMERAL_TYPE
&& COMPLETE_TYPE_P (t
))
13518 || TREE_CODE (t
) == INTEGER_TYPE
13519 || TREE_CODE (t
) == BOOLEAN_TYPE
13520 || TREE_CODE (t
) == REAL_TYPE
13521 || TREE_CODE (t
) == FIXED_POINT_TYPE
)
13523 verify_variant_match (TYPE_MAX_VALUE
);
13524 verify_variant_match (TYPE_MIN_VALUE
);
13526 if (TREE_CODE (t
) == METHOD_TYPE
)
13527 verify_variant_match (TYPE_METHOD_BASETYPE
);
13528 if (TREE_CODE (t
) == OFFSET_TYPE
)
13529 verify_variant_match (TYPE_OFFSET_BASETYPE
);
13530 if (TREE_CODE (t
) == ARRAY_TYPE
)
13531 verify_variant_match (TYPE_ARRAY_MAX_SIZE
);
13532 /* FIXME: Be lax and allow TYPE_BINFO to be missing in variant types
13533 or even type's main variant. This is needed to make bootstrap pass
13534 and the bug seems new in GCC 5.
13535 C++ FE should be updated to make this consistent and we should check
13536 that TYPE_BINFO is always NULL for !COMPLETE_TYPE_P and otherwise there
13537 is a match with main variant.
13539 Also disable the check for Java for now because of parser hack that builds
13540 first an dummy BINFO and then sometimes replace it by real BINFO in some
13542 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_BINFO (t
) && TYPE_BINFO (tv
)
13543 && TYPE_BINFO (t
) != TYPE_BINFO (tv
)
13544 /* FIXME: Java sometimes keep dump TYPE_BINFOs on variant types.
13545 Since there is no cheap way to tell C++/Java type w/o LTO, do checking
13546 at LTO time only. */
13547 && (in_lto_p
&& odr_type_p (t
)))
13549 error ("type variant has different TYPE_BINFO");
13551 error ("type variant's TYPE_BINFO");
13552 debug_tree (TYPE_BINFO (tv
));
13553 error ("type's TYPE_BINFO");
13554 debug_tree (TYPE_BINFO (t
));
13558 /* Check various uses of TYPE_VALUES_RAW. */
13559 if (TREE_CODE (t
) == ENUMERAL_TYPE
)
13560 verify_variant_match (TYPE_VALUES
);
13561 else if (TREE_CODE (t
) == ARRAY_TYPE
)
13562 verify_variant_match (TYPE_DOMAIN
);
13563 /* Permit incomplete variants of complete type. While FEs may complete
13564 all variants, this does not happen for C++ templates in all cases. */
13565 else if (RECORD_OR_UNION_TYPE_P (t
)
13566 && COMPLETE_TYPE_P (t
)
13567 && TYPE_FIELDS (t
) != TYPE_FIELDS (tv
))
13571 /* Fortran builds qualified variants as new records with items of
13572 qualified type. Verify that they looks same. */
13573 for (f1
= TYPE_FIELDS (t
), f2
= TYPE_FIELDS (tv
);
13575 f1
= TREE_CHAIN (f1
), f2
= TREE_CHAIN (f2
))
13576 if (TREE_CODE (f1
) != FIELD_DECL
|| TREE_CODE (f2
) != FIELD_DECL
13577 || (TYPE_MAIN_VARIANT (TREE_TYPE (f1
))
13578 != TYPE_MAIN_VARIANT (TREE_TYPE (f2
))
13579 /* FIXME: gfc_nonrestricted_type builds all types as variants
13580 with exception of pointer types. It deeply copies the type
13581 which means that we may end up with a variant type
13582 referring non-variant pointer. We may change it to
13583 produce types as variants, too, like
13584 objc_get_protocol_qualified_type does. */
13585 && !POINTER_TYPE_P (TREE_TYPE (f1
)))
13586 || DECL_FIELD_OFFSET (f1
) != DECL_FIELD_OFFSET (f2
)
13587 || DECL_FIELD_BIT_OFFSET (f1
) != DECL_FIELD_BIT_OFFSET (f2
))
13591 error ("type variant has different TYPE_FIELDS");
13593 error ("first mismatch is field");
13595 error ("and field");
13600 else if ((TREE_CODE (t
) == FUNCTION_TYPE
|| TREE_CODE (t
) == METHOD_TYPE
))
13601 verify_variant_match (TYPE_ARG_TYPES
);
13602 /* For C++ the qualified variant of array type is really an array type
13603 of qualified TREE_TYPE.
13604 objc builds variants of pointer where pointer to type is a variant, too
13605 in objc_get_protocol_qualified_type. */
13606 if (TREE_TYPE (t
) != TREE_TYPE (tv
)
13607 && ((TREE_CODE (t
) != ARRAY_TYPE
13608 && !POINTER_TYPE_P (t
))
13609 || TYPE_MAIN_VARIANT (TREE_TYPE (t
))
13610 != TYPE_MAIN_VARIANT (TREE_TYPE (tv
))))
13612 error ("type variant has different TREE_TYPE");
13614 error ("type variant's TREE_TYPE");
13615 debug_tree (TREE_TYPE (tv
));
13616 error ("type's TREE_TYPE");
13617 debug_tree (TREE_TYPE (t
));
13620 if (type_with_alias_set_p (t
)
13621 && !gimple_canonical_types_compatible_p (t
, tv
, false))
13623 error ("type is not compatible with its variant");
13625 error ("type variant's TREE_TYPE");
13626 debug_tree (TREE_TYPE (tv
));
13627 error ("type's TREE_TYPE");
13628 debug_tree (TREE_TYPE (t
));
13632 #undef verify_variant_match
13636 /* The TYPE_CANONICAL merging machinery. It should closely resemble
13637 the middle-end types_compatible_p function. It needs to avoid
13638 claiming types are different for types that should be treated
13639 the same with respect to TBAA. Canonical types are also used
13640 for IL consistency checks via the useless_type_conversion_p
13641 predicate which does not handle all type kinds itself but falls
13642 back to pointer-comparison of TYPE_CANONICAL for aggregates
13645 /* Return true if TYPE_UNSIGNED of TYPE should be ignored for canonical
13646 type calculation because we need to allow inter-operability between signed
13647 and unsigned variants. */
13650 type_with_interoperable_signedness (const_tree type
)
13652 /* Fortran standard require C_SIGNED_CHAR to be interoperable with both
13653 signed char and unsigned char. Similarly fortran FE builds
13654 C_SIZE_T as signed type, while C defines it unsigned. */
13656 return tree_code_for_canonical_type_merging (TREE_CODE (type
))
13658 && (TYPE_PRECISION (type
) == TYPE_PRECISION (signed_char_type_node
)
13659 || TYPE_PRECISION (type
) == TYPE_PRECISION (size_type_node
));
13662 /* Return true iff T1 and T2 are structurally identical for what
13664 This function is used both by lto.c canonical type merging and by the
13665 verifier. If TRUST_TYPE_CANONICAL we do not look into structure of types
13666 that have TYPE_CANONICAL defined and assume them equivalent. This is useful
13667 only for LTO because only in these cases TYPE_CANONICAL equivalence
13668 correspond to one defined by gimple_canonical_types_compatible_p. */
13671 gimple_canonical_types_compatible_p (const_tree t1
, const_tree t2
,
13672 bool trust_type_canonical
)
13674 /* Type variants should be same as the main variant. When not doing sanity
13675 checking to verify this fact, go to main variants and save some work. */
13676 if (trust_type_canonical
)
13678 t1
= TYPE_MAIN_VARIANT (t1
);
13679 t2
= TYPE_MAIN_VARIANT (t2
);
13682 /* Check first for the obvious case of pointer identity. */
13686 /* Check that we have two types to compare. */
13687 if (t1
== NULL_TREE
|| t2
== NULL_TREE
)
13690 /* We consider complete types always compatible with incomplete type.
13691 This does not make sense for canonical type calculation and thus we
13692 need to ensure that we are never called on it.
13694 FIXME: For more correctness the function probably should have three modes
13695 1) mode assuming that types are complete mathcing their structure
13696 2) mode allowing incomplete types but producing equivalence classes
13697 and thus ignoring all info from complete types
13698 3) mode allowing incomplete types to match complete but checking
13699 compatibility between complete types.
13701 1 and 2 can be used for canonical type calculation. 3 is the real
13702 definition of type compatibility that can be used i.e. for warnings during
13703 declaration merging. */
13705 gcc_assert (!trust_type_canonical
13706 || (type_with_alias_set_p (t1
) && type_with_alias_set_p (t2
)));
13707 /* If the types have been previously registered and found equal
13710 if (TYPE_CANONICAL (t1
) && TYPE_CANONICAL (t2
)
13711 && trust_type_canonical
)
13713 /* Do not use TYPE_CANONICAL of pointer types. For LTO streamed types
13714 they are always NULL, but they are set to non-NULL for types
13715 constructed by build_pointer_type and variants. In this case the
13716 TYPE_CANONICAL is more fine grained than the equivalnce we test (where
13717 all pointers are considered equal. Be sure to not return false
13719 gcc_checking_assert (canonical_type_used_p (t1
)
13720 && canonical_type_used_p (t2
));
13721 return TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
);
13724 /* Can't be the same type if the types don't have the same code. */
13725 enum tree_code code
= tree_code_for_canonical_type_merging (TREE_CODE (t1
));
13726 if (code
!= tree_code_for_canonical_type_merging (TREE_CODE (t2
)))
13729 /* Qualifiers do not matter for canonical type comparison purposes. */
13731 /* Void types and nullptr types are always the same. */
13732 if (TREE_CODE (t1
) == VOID_TYPE
13733 || TREE_CODE (t1
) == NULLPTR_TYPE
)
13736 /* Can't be the same type if they have different mode. */
13737 if (TYPE_MODE (t1
) != TYPE_MODE (t2
))
13740 /* Non-aggregate types can be handled cheaply. */
13741 if (INTEGRAL_TYPE_P (t1
)
13742 || SCALAR_FLOAT_TYPE_P (t1
)
13743 || FIXED_POINT_TYPE_P (t1
)
13744 || TREE_CODE (t1
) == VECTOR_TYPE
13745 || TREE_CODE (t1
) == COMPLEX_TYPE
13746 || TREE_CODE (t1
) == OFFSET_TYPE
13747 || POINTER_TYPE_P (t1
))
13749 /* Can't be the same type if they have different recision. */
13750 if (TYPE_PRECISION (t1
) != TYPE_PRECISION (t2
))
13753 /* In some cases the signed and unsigned types are required to be
13755 if (TYPE_UNSIGNED (t1
) != TYPE_UNSIGNED (t2
)
13756 && !type_with_interoperable_signedness (t1
))
13759 /* Fortran's C_SIGNED_CHAR is !TYPE_STRING_FLAG but needs to be
13760 interoperable with "signed char". Unless all frontends are revisited
13761 to agree on these types, we must ignore the flag completely. */
13763 /* Fortran standard define C_PTR type that is compatible with every
13764 C pointer. For this reason we need to glob all pointers into one.
13765 Still pointers in different address spaces are not compatible. */
13766 if (POINTER_TYPE_P (t1
))
13768 if (TYPE_ADDR_SPACE (TREE_TYPE (t1
))
13769 != TYPE_ADDR_SPACE (TREE_TYPE (t2
)))
13773 /* Tail-recurse to components. */
13774 if (TREE_CODE (t1
) == VECTOR_TYPE
13775 || TREE_CODE (t1
) == COMPLEX_TYPE
)
13776 return gimple_canonical_types_compatible_p (TREE_TYPE (t1
),
13778 trust_type_canonical
);
13783 /* Do type-specific comparisons. */
13784 switch (TREE_CODE (t1
))
13787 /* Array types are the same if the element types are the same and
13788 the number of elements are the same. */
13789 if (!gimple_canonical_types_compatible_p (TREE_TYPE (t1
), TREE_TYPE (t2
),
13790 trust_type_canonical
)
13791 || TYPE_STRING_FLAG (t1
) != TYPE_STRING_FLAG (t2
)
13792 || TYPE_REVERSE_STORAGE_ORDER (t1
) != TYPE_REVERSE_STORAGE_ORDER (t2
)
13793 || TYPE_NONALIASED_COMPONENT (t1
) != TYPE_NONALIASED_COMPONENT (t2
))
13797 tree i1
= TYPE_DOMAIN (t1
);
13798 tree i2
= TYPE_DOMAIN (t2
);
13800 /* For an incomplete external array, the type domain can be
13801 NULL_TREE. Check this condition also. */
13802 if (i1
== NULL_TREE
&& i2
== NULL_TREE
)
13804 else if (i1
== NULL_TREE
|| i2
== NULL_TREE
)
13808 tree min1
= TYPE_MIN_VALUE (i1
);
13809 tree min2
= TYPE_MIN_VALUE (i2
);
13810 tree max1
= TYPE_MAX_VALUE (i1
);
13811 tree max2
= TYPE_MAX_VALUE (i2
);
13813 /* The minimum/maximum values have to be the same. */
13816 && ((TREE_CODE (min1
) == PLACEHOLDER_EXPR
13817 && TREE_CODE (min2
) == PLACEHOLDER_EXPR
)
13818 || operand_equal_p (min1
, min2
, 0))))
13821 && ((TREE_CODE (max1
) == PLACEHOLDER_EXPR
13822 && TREE_CODE (max2
) == PLACEHOLDER_EXPR
)
13823 || operand_equal_p (max1
, max2
, 0)))))
13831 case FUNCTION_TYPE
:
13832 /* Function types are the same if the return type and arguments types
13834 if (!gimple_canonical_types_compatible_p (TREE_TYPE (t1
), TREE_TYPE (t2
),
13835 trust_type_canonical
))
13838 if (TYPE_ARG_TYPES (t1
) == TYPE_ARG_TYPES (t2
))
13842 tree parms1
, parms2
;
13844 for (parms1
= TYPE_ARG_TYPES (t1
), parms2
= TYPE_ARG_TYPES (t2
);
13846 parms1
= TREE_CHAIN (parms1
), parms2
= TREE_CHAIN (parms2
))
13848 if (!gimple_canonical_types_compatible_p
13849 (TREE_VALUE (parms1
), TREE_VALUE (parms2
),
13850 trust_type_canonical
))
13854 if (parms1
|| parms2
)
13862 case QUAL_UNION_TYPE
:
13866 /* Don't try to compare variants of an incomplete type, before
13867 TYPE_FIELDS has been copied around. */
13868 if (!COMPLETE_TYPE_P (t1
) && !COMPLETE_TYPE_P (t2
))
13872 if (TYPE_REVERSE_STORAGE_ORDER (t1
) != TYPE_REVERSE_STORAGE_ORDER (t2
))
13875 /* For aggregate types, all the fields must be the same. */
13876 for (f1
= TYPE_FIELDS (t1
), f2
= TYPE_FIELDS (t2
);
13878 f1
= TREE_CHAIN (f1
), f2
= TREE_CHAIN (f2
))
13880 /* Skip non-fields and zero-sized fields. */
13881 while (f1
&& (TREE_CODE (f1
) != FIELD_DECL
13883 && integer_zerop (DECL_SIZE (f1
)))))
13884 f1
= TREE_CHAIN (f1
);
13885 while (f2
&& (TREE_CODE (f2
) != FIELD_DECL
13887 && integer_zerop (DECL_SIZE (f2
)))))
13888 f2
= TREE_CHAIN (f2
);
13891 /* The fields must have the same name, offset and type. */
13892 if (DECL_NONADDRESSABLE_P (f1
) != DECL_NONADDRESSABLE_P (f2
)
13893 || !gimple_compare_field_offset (f1
, f2
)
13894 || !gimple_canonical_types_compatible_p
13895 (TREE_TYPE (f1
), TREE_TYPE (f2
),
13896 trust_type_canonical
))
13900 /* If one aggregate has more fields than the other, they
13901 are not the same. */
13909 /* Consider all types with language specific trees in them mutually
13910 compatible. This is executed only from verify_type and false
13911 positives can be tolerated. */
13912 gcc_assert (!in_lto_p
);
13917 /* Verify type T. */
13920 verify_type (const_tree t
)
13922 bool error_found
= false;
13923 tree mv
= TYPE_MAIN_VARIANT (t
);
13926 error ("Main variant is not defined");
13927 error_found
= true;
13929 else if (mv
!= TYPE_MAIN_VARIANT (mv
))
13931 error ("TYPE_MAIN_VARIANT has different TYPE_MAIN_VARIANT");
13933 error_found
= true;
13935 else if (t
!= mv
&& !verify_type_variant (t
, mv
))
13936 error_found
= true;
13938 tree ct
= TYPE_CANONICAL (t
);
13941 else if (TYPE_CANONICAL (t
) != ct
)
13943 error ("TYPE_CANONICAL has different TYPE_CANONICAL");
13945 error_found
= true;
13947 /* Method and function types can not be used to address memory and thus
13948 TYPE_CANONICAL really matters only for determining useless conversions.
13950 FIXME: C++ FE produce declarations of builtin functions that are not
13951 compatible with main variants. */
13952 else if (TREE_CODE (t
) == FUNCTION_TYPE
)
13955 /* FIXME: gimple_canonical_types_compatible_p can not compare types
13956 with variably sized arrays because their sizes possibly
13957 gimplified to different variables. */
13958 && !variably_modified_type_p (ct
, NULL
)
13959 && !gimple_canonical_types_compatible_p (t
, ct
, false))
13961 error ("TYPE_CANONICAL is not compatible");
13963 error_found
= true;
13966 if (COMPLETE_TYPE_P (t
) && TYPE_CANONICAL (t
)
13967 && TYPE_MODE (t
) != TYPE_MODE (TYPE_CANONICAL (t
)))
13969 error ("TYPE_MODE of TYPE_CANONICAL is not compatible");
13971 error_found
= true;
13973 /* FIXME: this is violated by the C++ FE as discussed in PR70029, when
13974 FUNCTION_*_QUALIFIED flags are set. */
13975 if (0 && TYPE_MAIN_VARIANT (t
) == t
&& ct
&& TYPE_MAIN_VARIANT (ct
) != ct
)
13977 error ("TYPE_CANONICAL of main variant is not main variant");
13979 debug_tree (TYPE_MAIN_VARIANT (ct
));
13980 error_found
= true;
13984 /* Check various uses of TYPE_MIN_VALUE_RAW. */
13985 if (RECORD_OR_UNION_TYPE_P (t
))
13987 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
13988 and danagle the pointer from time to time. */
13989 if (TYPE_VFIELD (t
)
13990 && TREE_CODE (TYPE_VFIELD (t
)) != FIELD_DECL
13991 && TREE_CODE (TYPE_VFIELD (t
)) != TREE_LIST
)
13993 error ("TYPE_VFIELD is not FIELD_DECL nor TREE_LIST");
13994 debug_tree (TYPE_VFIELD (t
));
13995 error_found
= true;
13998 else if (TREE_CODE (t
) == POINTER_TYPE
)
14000 if (TYPE_NEXT_PTR_TO (t
)
14001 && TREE_CODE (TYPE_NEXT_PTR_TO (t
)) != POINTER_TYPE
)
14003 error ("TYPE_NEXT_PTR_TO is not POINTER_TYPE");
14004 debug_tree (TYPE_NEXT_PTR_TO (t
));
14005 error_found
= true;
14008 else if (TREE_CODE (t
) == REFERENCE_TYPE
)
14010 if (TYPE_NEXT_REF_TO (t
)
14011 && TREE_CODE (TYPE_NEXT_REF_TO (t
)) != REFERENCE_TYPE
)
14013 error ("TYPE_NEXT_REF_TO is not REFERENCE_TYPE");
14014 debug_tree (TYPE_NEXT_REF_TO (t
));
14015 error_found
= true;
14018 else if (INTEGRAL_TYPE_P (t
) || TREE_CODE (t
) == REAL_TYPE
14019 || TREE_CODE (t
) == FIXED_POINT_TYPE
)
14021 /* FIXME: The following check should pass:
14022 useless_type_conversion_p (const_cast <tree> (t),
14023 TREE_TYPE (TYPE_MIN_VALUE (t))
14024 but does not for C sizetypes in LTO. */
14027 /* Check various uses of TYPE_MAXVAL. */
14028 if (RECORD_OR_UNION_TYPE_P (t
))
14031 else if (TREE_CODE (t
) == FUNCTION_TYPE
|| TREE_CODE (t
) == METHOD_TYPE
)
14033 if (TYPE_METHOD_BASETYPE (t
)
14034 && TREE_CODE (TYPE_METHOD_BASETYPE (t
)) != RECORD_TYPE
14035 && TREE_CODE (TYPE_METHOD_BASETYPE (t
)) != UNION_TYPE
)
14037 error ("TYPE_METHOD_BASETYPE is not record nor union");
14038 debug_tree (TYPE_METHOD_BASETYPE (t
));
14039 error_found
= true;
14042 else if (TREE_CODE (t
) == OFFSET_TYPE
)
14044 if (TYPE_OFFSET_BASETYPE (t
)
14045 && TREE_CODE (TYPE_OFFSET_BASETYPE (t
)) != RECORD_TYPE
14046 && TREE_CODE (TYPE_OFFSET_BASETYPE (t
)) != UNION_TYPE
)
14048 error ("TYPE_OFFSET_BASETYPE is not record nor union");
14049 debug_tree (TYPE_OFFSET_BASETYPE (t
));
14050 error_found
= true;
14053 else if (INTEGRAL_TYPE_P (t
) || TREE_CODE (t
) == REAL_TYPE
14054 || TREE_CODE (t
) == FIXED_POINT_TYPE
)
14056 /* FIXME: The following check should pass:
14057 useless_type_conversion_p (const_cast <tree> (t),
14058 TREE_TYPE (TYPE_MAX_VALUE (t))
14059 but does not for C sizetypes in LTO. */
14061 else if (TREE_CODE (t
) == ARRAY_TYPE
)
14063 if (TYPE_ARRAY_MAX_SIZE (t
)
14064 && TREE_CODE (TYPE_ARRAY_MAX_SIZE (t
)) != INTEGER_CST
)
14066 error ("TYPE_ARRAY_MAX_SIZE not INTEGER_CST");
14067 debug_tree (TYPE_ARRAY_MAX_SIZE (t
));
14068 error_found
= true;
14071 else if (TYPE_MAX_VALUE_RAW (t
))
14073 error ("TYPE_MAX_VALUE_RAW non-NULL");
14074 debug_tree (TYPE_MAX_VALUE_RAW (t
));
14075 error_found
= true;
14078 /* Check various uses of TYPE_BINFO. */
14079 if (RECORD_OR_UNION_TYPE_P (t
))
14081 if (!TYPE_BINFO (t
))
14083 else if (TREE_CODE (TYPE_BINFO (t
)) != TREE_BINFO
)
14085 error ("TYPE_BINFO is not TREE_BINFO");
14086 debug_tree (TYPE_BINFO (t
));
14087 error_found
= true;
14090 else if (TYPE_LANG_SLOT_1 (t
) && in_lto_p
)
14092 error ("TYPE_LANG_SLOT_1 (binfo) field is non-NULL");
14093 debug_tree (TYPE_LANG_SLOT_1 (t
));
14094 error_found
= true;
14097 /* Check various uses of TYPE_VALUES_RAW. */
14098 if (TREE_CODE (t
) == ENUMERAL_TYPE
)
14099 for (tree l
= TYPE_VALUES (t
); l
; l
= TREE_CHAIN (l
))
14101 tree value
= TREE_VALUE (l
);
14102 tree name
= TREE_PURPOSE (l
);
14104 /* C FE porduce INTEGER_CST of INTEGER_TYPE, while C++ FE uses
14105 CONST_DECL of ENUMERAL TYPE. */
14106 if (TREE_CODE (value
) != INTEGER_CST
&& TREE_CODE (value
) != CONST_DECL
)
14108 error ("Enum value is not CONST_DECL or INTEGER_CST");
14109 debug_tree (value
);
14111 error_found
= true;
14113 if (TREE_CODE (TREE_TYPE (value
)) != INTEGER_TYPE
14114 && !useless_type_conversion_p (const_cast <tree
> (t
), TREE_TYPE (value
)))
14116 error ("Enum value type is not INTEGER_TYPE nor convertible to the enum");
14117 debug_tree (value
);
14119 error_found
= true;
14121 if (TREE_CODE (name
) != IDENTIFIER_NODE
)
14123 error ("Enum value name is not IDENTIFIER_NODE");
14124 debug_tree (value
);
14126 error_found
= true;
14129 else if (TREE_CODE (t
) == ARRAY_TYPE
)
14131 if (TYPE_DOMAIN (t
) && TREE_CODE (TYPE_DOMAIN (t
)) != INTEGER_TYPE
)
14133 error ("Array TYPE_DOMAIN is not integer type");
14134 debug_tree (TYPE_DOMAIN (t
));
14135 error_found
= true;
14138 else if (RECORD_OR_UNION_TYPE_P (t
))
14140 if (TYPE_FIELDS (t
) && !COMPLETE_TYPE_P (t
) && in_lto_p
)
14142 error ("TYPE_FIELDS defined in incomplete type");
14143 error_found
= true;
14145 for (tree fld
= TYPE_FIELDS (t
); fld
; fld
= TREE_CHAIN (fld
))
14147 /* TODO: verify properties of decls. */
14148 if (TREE_CODE (fld
) == FIELD_DECL
)
14150 else if (TREE_CODE (fld
) == TYPE_DECL
)
14152 else if (TREE_CODE (fld
) == CONST_DECL
)
14154 else if (VAR_P (fld
))
14156 else if (TREE_CODE (fld
) == TEMPLATE_DECL
)
14158 else if (TREE_CODE (fld
) == USING_DECL
)
14160 else if (TREE_CODE (fld
) == FUNCTION_DECL
)
14164 error ("Wrong tree in TYPE_FIELDS list");
14166 error_found
= true;
14170 else if (TREE_CODE (t
) == INTEGER_TYPE
14171 || TREE_CODE (t
) == BOOLEAN_TYPE
14172 || TREE_CODE (t
) == OFFSET_TYPE
14173 || TREE_CODE (t
) == REFERENCE_TYPE
14174 || TREE_CODE (t
) == NULLPTR_TYPE
14175 || TREE_CODE (t
) == POINTER_TYPE
)
14177 if (TYPE_CACHED_VALUES_P (t
) != (TYPE_CACHED_VALUES (t
) != NULL
))
14179 error ("TYPE_CACHED_VALUES_P is %i while TYPE_CACHED_VALUES is %p",
14180 TYPE_CACHED_VALUES_P (t
), (void *)TYPE_CACHED_VALUES (t
));
14181 error_found
= true;
14183 else if (TYPE_CACHED_VALUES_P (t
) && TREE_CODE (TYPE_CACHED_VALUES (t
)) != TREE_VEC
)
14185 error ("TYPE_CACHED_VALUES is not TREE_VEC");
14186 debug_tree (TYPE_CACHED_VALUES (t
));
14187 error_found
= true;
14189 /* Verify just enough of cache to ensure that no one copied it to new type.
14190 All copying should go by copy_node that should clear it. */
14191 else if (TYPE_CACHED_VALUES_P (t
))
14194 for (i
= 0; i
< TREE_VEC_LENGTH (TYPE_CACHED_VALUES (t
)); i
++)
14195 if (TREE_VEC_ELT (TYPE_CACHED_VALUES (t
), i
)
14196 && TREE_TYPE (TREE_VEC_ELT (TYPE_CACHED_VALUES (t
), i
)) != t
)
14198 error ("wrong TYPE_CACHED_VALUES entry");
14199 debug_tree (TREE_VEC_ELT (TYPE_CACHED_VALUES (t
), i
));
14200 error_found
= true;
14205 else if (TREE_CODE (t
) == FUNCTION_TYPE
|| TREE_CODE (t
) == METHOD_TYPE
)
14206 for (tree l
= TYPE_ARG_TYPES (t
); l
; l
= TREE_CHAIN (l
))
14208 /* C++ FE uses TREE_PURPOSE to store initial values. */
14209 if (TREE_PURPOSE (l
) && in_lto_p
)
14211 error ("TREE_PURPOSE is non-NULL in TYPE_ARG_TYPES list");
14213 error_found
= true;
14215 if (!TYPE_P (TREE_VALUE (l
)))
14217 error ("Wrong entry in TYPE_ARG_TYPES list");
14219 error_found
= true;
14222 else if (!is_lang_specific (t
) && TYPE_VALUES_RAW (t
))
14224 error ("TYPE_VALUES_RAW field is non-NULL");
14225 debug_tree (TYPE_VALUES_RAW (t
));
14226 error_found
= true;
14228 if (TREE_CODE (t
) != INTEGER_TYPE
14229 && TREE_CODE (t
) != BOOLEAN_TYPE
14230 && TREE_CODE (t
) != OFFSET_TYPE
14231 && TREE_CODE (t
) != REFERENCE_TYPE
14232 && TREE_CODE (t
) != NULLPTR_TYPE
14233 && TREE_CODE (t
) != POINTER_TYPE
14234 && TYPE_CACHED_VALUES_P (t
))
14236 error ("TYPE_CACHED_VALUES_P is set while it should not");
14237 error_found
= true;
14239 if (TYPE_STRING_FLAG (t
)
14240 && TREE_CODE (t
) != ARRAY_TYPE
&& TREE_CODE (t
) != INTEGER_TYPE
)
14242 error ("TYPE_STRING_FLAG is set on wrong type code");
14243 error_found
= true;
14246 /* ipa-devirt makes an assumption that TYPE_METHOD_BASETYPE is always
14247 TYPE_MAIN_VARIANT and it would be odd to add methods only to variatns
14249 if (TREE_CODE (t
) == METHOD_TYPE
14250 && TYPE_MAIN_VARIANT (TYPE_METHOD_BASETYPE (t
)) != TYPE_METHOD_BASETYPE (t
))
14252 error ("TYPE_METHOD_BASETYPE is not main variant");
14253 error_found
= true;
14258 debug_tree (const_cast <tree
> (t
));
14259 internal_error ("verify_type failed");
14264 /* Return 1 if ARG interpreted as signed in its precision is known to be
14265 always positive or 2 if ARG is known to be always negative, or 3 if
14266 ARG may be positive or negative. */
14269 get_range_pos_neg (tree arg
)
14271 if (arg
== error_mark_node
)
14274 int prec
= TYPE_PRECISION (TREE_TYPE (arg
));
14276 if (TREE_CODE (arg
) == INTEGER_CST
)
14278 wide_int w
= wi::sext (arg
, prec
);
14284 while (CONVERT_EXPR_P (arg
)
14285 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (arg
, 0)))
14286 && TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (arg
, 0))) <= prec
)
14288 arg
= TREE_OPERAND (arg
, 0);
14289 /* Narrower value zero extended into wider type
14290 will always result in positive values. */
14291 if (TYPE_UNSIGNED (TREE_TYPE (arg
))
14292 && TYPE_PRECISION (TREE_TYPE (arg
)) < prec
)
14294 prec
= TYPE_PRECISION (TREE_TYPE (arg
));
14299 if (TREE_CODE (arg
) != SSA_NAME
)
14301 wide_int arg_min
, arg_max
;
14302 while (get_range_info (arg
, &arg_min
, &arg_max
) != VR_RANGE
)
14304 gimple
*g
= SSA_NAME_DEF_STMT (arg
);
14305 if (is_gimple_assign (g
)
14306 && CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (g
)))
14308 tree t
= gimple_assign_rhs1 (g
);
14309 if (INTEGRAL_TYPE_P (TREE_TYPE (t
))
14310 && TYPE_PRECISION (TREE_TYPE (t
)) <= prec
)
14312 if (TYPE_UNSIGNED (TREE_TYPE (t
))
14313 && TYPE_PRECISION (TREE_TYPE (t
)) < prec
)
14315 prec
= TYPE_PRECISION (TREE_TYPE (t
));
14324 if (TYPE_UNSIGNED (TREE_TYPE (arg
)))
14326 /* For unsigned values, the "positive" range comes
14327 below the "negative" range. */
14328 if (!wi::neg_p (wi::sext (arg_max
, prec
), SIGNED
))
14330 if (wi::neg_p (wi::sext (arg_min
, prec
), SIGNED
))
14335 if (!wi::neg_p (wi::sext (arg_min
, prec
), SIGNED
))
14337 if (wi::neg_p (wi::sext (arg_max
, prec
), SIGNED
))
14346 /* Return true if ARG is marked with the nonnull attribute in the
14347 current function signature. */
14350 nonnull_arg_p (const_tree arg
)
14352 tree t
, attrs
, fntype
;
14353 unsigned HOST_WIDE_INT arg_num
;
14355 gcc_assert (TREE_CODE (arg
) == PARM_DECL
14356 && (POINTER_TYPE_P (TREE_TYPE (arg
))
14357 || TREE_CODE (TREE_TYPE (arg
)) == OFFSET_TYPE
));
14359 /* The static chain decl is always non null. */
14360 if (arg
== cfun
->static_chain_decl
)
14363 /* THIS argument of method is always non-NULL. */
14364 if (TREE_CODE (TREE_TYPE (cfun
->decl
)) == METHOD_TYPE
14365 && arg
== DECL_ARGUMENTS (cfun
->decl
)
14366 && flag_delete_null_pointer_checks
)
14369 /* Values passed by reference are always non-NULL. */
14370 if (TREE_CODE (TREE_TYPE (arg
)) == REFERENCE_TYPE
14371 && flag_delete_null_pointer_checks
)
14374 fntype
= TREE_TYPE (cfun
->decl
);
14375 for (attrs
= TYPE_ATTRIBUTES (fntype
); attrs
; attrs
= TREE_CHAIN (attrs
))
14377 attrs
= lookup_attribute ("nonnull", attrs
);
14379 /* If "nonnull" wasn't specified, we know nothing about the argument. */
14380 if (attrs
== NULL_TREE
)
14383 /* If "nonnull" applies to all the arguments, then ARG is non-null. */
14384 if (TREE_VALUE (attrs
) == NULL_TREE
)
14387 /* Get the position number for ARG in the function signature. */
14388 for (arg_num
= 1, t
= DECL_ARGUMENTS (cfun
->decl
);
14390 t
= DECL_CHAIN (t
), arg_num
++)
14396 gcc_assert (t
== arg
);
14398 /* Now see if ARG_NUM is mentioned in the nonnull list. */
14399 for (t
= TREE_VALUE (attrs
); t
; t
= TREE_CHAIN (t
))
14401 if (compare_tree_int (TREE_VALUE (t
), arg_num
) == 0)
14409 /* Combine LOC and BLOCK to a combined adhoc loc, retaining any range
14413 set_block (location_t loc
, tree block
)
14415 location_t pure_loc
= get_pure_location (loc
);
14416 source_range src_range
= get_range_from_loc (line_table
, loc
);
14417 return COMBINE_LOCATION_DATA (line_table
, pure_loc
, src_range
, block
);
14421 set_source_range (tree expr
, location_t start
, location_t finish
)
14423 source_range src_range
;
14424 src_range
.m_start
= start
;
14425 src_range
.m_finish
= finish
;
14426 return set_source_range (expr
, src_range
);
14430 set_source_range (tree expr
, source_range src_range
)
14432 if (!EXPR_P (expr
))
14433 return UNKNOWN_LOCATION
;
14435 location_t pure_loc
= get_pure_location (EXPR_LOCATION (expr
));
14436 location_t adhoc
= COMBINE_LOCATION_DATA (line_table
,
14440 SET_EXPR_LOCATION (expr
, adhoc
);
14444 /* Return the name of combined function FN, for debugging purposes. */
14447 combined_fn_name (combined_fn fn
)
14449 if (builtin_fn_p (fn
))
14451 tree fndecl
= builtin_decl_explicit (as_builtin_fn (fn
));
14452 return IDENTIFIER_POINTER (DECL_NAME (fndecl
));
14455 return internal_fn_name (as_internal_fn (fn
));
14458 /* Return a bitmap with a bit set corresponding to each argument in
14459 a function call type FNTYPE declared with attribute nonnull,
14460 or null if none of the function's argument are nonnull. The caller
14461 must free the bitmap. */
14464 get_nonnull_args (const_tree fntype
)
14466 if (fntype
== NULL_TREE
)
14469 tree attrs
= TYPE_ATTRIBUTES (fntype
);
14473 bitmap argmap
= NULL
;
14475 /* A function declaration can specify multiple attribute nonnull,
14476 each with zero or more arguments. The loop below creates a bitmap
14477 representing a union of all the arguments. An empty (but non-null)
14478 bitmap means that all arguments have been declaraed nonnull. */
14479 for ( ; attrs
; attrs
= TREE_CHAIN (attrs
))
14481 attrs
= lookup_attribute ("nonnull", attrs
);
14486 argmap
= BITMAP_ALLOC (NULL
);
14488 if (!TREE_VALUE (attrs
))
14490 /* Clear the bitmap in case a previous attribute nonnull
14491 set it and this one overrides it for all arguments. */
14492 bitmap_clear (argmap
);
14496 /* Iterate over the indices of the format arguments declared nonnull
14497 and set a bit for each. */
14498 for (tree idx
= TREE_VALUE (attrs
); idx
; idx
= TREE_CHAIN (idx
))
14500 unsigned int val
= TREE_INT_CST_LOW (TREE_VALUE (idx
)) - 1;
14501 bitmap_set_bit (argmap
, val
);
14508 /* List of pointer types used to declare builtins before we have seen their
14511 Keep the size up to date in tree.h ! */
14512 const builtin_structptr_type builtin_structptr_types
[6] =
14514 { fileptr_type_node
, ptr_type_node
, "FILE" },
14515 { const_tm_ptr_type_node
, const_ptr_type_node
, "tm" },
14516 { fenv_t_ptr_type_node
, ptr_type_node
, "fenv_t" },
14517 { const_fenv_t_ptr_type_node
, const_ptr_type_node
, "fenv_t" },
14518 { fexcept_t_ptr_type_node
, ptr_type_node
, "fexcept_t" },
14519 { const_fexcept_t_ptr_type_node
, const_ptr_type_node
, "fexcept_t" }
14524 namespace selftest
{
14526 /* Selftests for tree. */
14528 /* Verify that integer constants are sane. */
14531 test_integer_constants ()
14533 ASSERT_TRUE (integer_type_node
!= NULL
);
14534 ASSERT_TRUE (build_int_cst (integer_type_node
, 0) != NULL
);
14536 tree type
= integer_type_node
;
14538 tree zero
= build_zero_cst (type
);
14539 ASSERT_EQ (INTEGER_CST
, TREE_CODE (zero
));
14540 ASSERT_EQ (type
, TREE_TYPE (zero
));
14542 tree one
= build_int_cst (type
, 1);
14543 ASSERT_EQ (INTEGER_CST
, TREE_CODE (one
));
14544 ASSERT_EQ (type
, TREE_TYPE (zero
));
14547 /* Verify identifiers. */
14550 test_identifiers ()
14552 tree identifier
= get_identifier ("foo");
14553 ASSERT_EQ (3, IDENTIFIER_LENGTH (identifier
));
14554 ASSERT_STREQ ("foo", IDENTIFIER_POINTER (identifier
));
14557 /* Verify LABEL_DECL. */
14562 tree identifier
= get_identifier ("err");
14563 tree label_decl
= build_decl (UNKNOWN_LOCATION
, LABEL_DECL
,
14564 identifier
, void_type_node
);
14565 ASSERT_EQ (-1, LABEL_DECL_UID (label_decl
));
14566 ASSERT_FALSE (FORCED_LABEL (label_decl
));
14569 /* Run all of the selftests within this file. */
14574 test_integer_constants ();
14575 test_identifiers ();
14579 } // namespace selftest
14581 #endif /* CHECKING_P */
14583 #include "gt-tree.h"