1 /* Language-independent node constructors for parse phase of GNU compiler.
2 Copyright (C) 1987-2016 Free Software Foundation, Inc.
4 This file is part of GCC.
6 GCC is free software; you can redistribute it and/or modify it under
7 the terms of the GNU General Public License as published by the Free
8 Software Foundation; either version 3, or (at your option) any later
11 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
12 WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
16 You should have received a copy of the GNU General Public License
17 along with GCC; see the file COPYING3. If not see
18 <http://www.gnu.org/licenses/>. */
20 /* This file contains the low level primitives for operating on tree nodes,
21 including allocation, list operations, interning of identifiers,
22 construction of data type nodes and statement nodes,
23 and construction of type conversion nodes. It also contains
24 tables index by tree code that describe how to take apart
27 It is intended to be language-independent but can occasionally
28 calls language-dependent routines. */
32 #include "coretypes.h"
37 #include "tree-pass.h"
40 #include "diagnostic.h"
43 #include "fold-const.h"
44 #include "stor-layout.h"
47 #include "toplev.h" /* get_random_seed */
49 #include "common/common-target.h"
50 #include "langhooks.h"
51 #include "tree-inline.h"
52 #include "tree-iterator.h"
53 #include "internal-fn.h"
54 #include "gimple-iterator.h"
58 #include "langhooks-def.h"
59 #include "tree-diagnostic.h"
62 #include "print-tree.h"
63 #include "ipa-utils.h"
65 /* Tree code classes. */
67 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) TYPE,
68 #define END_OF_BASE_TREE_CODES tcc_exceptional,
70 const enum tree_code_class tree_code_type
[] = {
71 #include "all-tree.def"
75 #undef END_OF_BASE_TREE_CODES
77 /* Table indexed by tree code giving number of expression
78 operands beyond the fixed part of the node structure.
79 Not used for types or decls. */
81 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) LENGTH,
82 #define END_OF_BASE_TREE_CODES 0,
84 const unsigned char tree_code_length
[] = {
85 #include "all-tree.def"
89 #undef END_OF_BASE_TREE_CODES
91 /* Names of tree components.
92 Used for printing out the tree and error messages. */
93 #define DEFTREECODE(SYM, NAME, TYPE, LEN) NAME,
94 #define END_OF_BASE_TREE_CODES "@dummy",
96 static const char *const tree_code_name
[] = {
97 #include "all-tree.def"
101 #undef END_OF_BASE_TREE_CODES
103 /* Each tree code class has an associated string representation.
104 These must correspond to the tree_code_class entries. */
106 const char *const tree_code_class_strings
[] =
121 /* obstack.[ch] explicitly declined to prototype this. */
122 extern int _obstack_allocated_p (struct obstack
*h
, void *obj
);
124 /* Statistics-gathering stuff. */
126 static int tree_code_counts
[MAX_TREE_CODES
];
127 int tree_node_counts
[(int) all_kinds
];
128 int tree_node_sizes
[(int) all_kinds
];
130 /* Keep in sync with tree.h:enum tree_node_kind. */
131 static const char * const tree_node_kind_names
[] = {
150 /* Unique id for next decl created. */
151 static GTY(()) int next_decl_uid
;
152 /* Unique id for next type created. */
153 static GTY(()) int next_type_uid
= 1;
154 /* Unique id for next debug decl created. Use negative numbers,
155 to catch erroneous uses. */
156 static GTY(()) int next_debug_decl_uid
;
158 /* Since we cannot rehash a type after it is in the table, we have to
159 keep the hash code. */
161 struct GTY((for_user
)) type_hash
{
166 /* Initial size of the hash table (rounded to next prime). */
167 #define TYPE_HASH_INITIAL_SIZE 1000
169 struct type_cache_hasher
: ggc_cache_ptr_hash
<type_hash
>
171 static hashval_t
hash (type_hash
*t
) { return t
->hash
; }
172 static bool equal (type_hash
*a
, type_hash
*b
);
175 keep_cache_entry (type_hash
*&t
)
177 return ggc_marked_p (t
->type
);
181 /* Now here is the hash table. When recording a type, it is added to
182 the slot whose index is the hash code. Note that the hash table is
183 used for several kinds of types (function types, array types and
184 array index range types, for now). While all these live in the
185 same table, they are completely independent, and the hash code is
186 computed differently for each of these. */
188 static GTY ((cache
)) hash_table
<type_cache_hasher
> *type_hash_table
;
190 /* Hash table and temporary node for larger integer const values. */
191 static GTY (()) tree int_cst_node
;
193 struct int_cst_hasher
: ggc_cache_ptr_hash
<tree_node
>
195 static hashval_t
hash (tree t
);
196 static bool equal (tree x
, tree y
);
199 static GTY ((cache
)) hash_table
<int_cst_hasher
> *int_cst_hash_table
;
201 /* Hash table for optimization flags and target option flags. Use the same
202 hash table for both sets of options. Nodes for building the current
203 optimization and target option nodes. The assumption is most of the time
204 the options created will already be in the hash table, so we avoid
205 allocating and freeing up a node repeatably. */
206 static GTY (()) tree cl_optimization_node
;
207 static GTY (()) tree cl_target_option_node
;
209 struct cl_option_hasher
: ggc_cache_ptr_hash
<tree_node
>
211 static hashval_t
hash (tree t
);
212 static bool equal (tree x
, tree y
);
215 static GTY ((cache
)) hash_table
<cl_option_hasher
> *cl_option_hash_table
;
217 /* General tree->tree mapping structure for use in hash tables. */
221 hash_table
<tree_decl_map_cache_hasher
> *debug_expr_for_decl
;
224 hash_table
<tree_decl_map_cache_hasher
> *value_expr_for_decl
;
226 struct tree_vec_map_cache_hasher
: ggc_cache_ptr_hash
<tree_vec_map
>
228 static hashval_t
hash (tree_vec_map
*m
) { return DECL_UID (m
->base
.from
); }
231 equal (tree_vec_map
*a
, tree_vec_map
*b
)
233 return a
->base
.from
== b
->base
.from
;
237 keep_cache_entry (tree_vec_map
*&m
)
239 return ggc_marked_p (m
->base
.from
);
244 hash_table
<tree_vec_map_cache_hasher
> *debug_args_for_decl
;
246 static void set_type_quals (tree
, int);
247 static void print_type_hash_statistics (void);
248 static void print_debug_expr_statistics (void);
249 static void print_value_expr_statistics (void);
250 static void type_hash_list (const_tree
, inchash::hash
&);
251 static void attribute_hash_list (const_tree
, inchash::hash
&);
253 tree global_trees
[TI_MAX
];
254 tree integer_types
[itk_none
];
256 bool int_n_enabled_p
[NUM_INT_N_ENTS
];
257 struct int_n_trees_t int_n_trees
[NUM_INT_N_ENTS
];
259 unsigned char tree_contains_struct
[MAX_TREE_CODES
][64];
261 /* Number of operands for each OpenMP clause. */
262 unsigned const char omp_clause_num_ops
[] =
264 0, /* OMP_CLAUSE_ERROR */
265 1, /* OMP_CLAUSE_PRIVATE */
266 1, /* OMP_CLAUSE_SHARED */
267 1, /* OMP_CLAUSE_FIRSTPRIVATE */
268 2, /* OMP_CLAUSE_LASTPRIVATE */
269 5, /* OMP_CLAUSE_REDUCTION */
270 1, /* OMP_CLAUSE_COPYIN */
271 1, /* OMP_CLAUSE_COPYPRIVATE */
272 3, /* OMP_CLAUSE_LINEAR */
273 2, /* OMP_CLAUSE_ALIGNED */
274 1, /* OMP_CLAUSE_DEPEND */
275 1, /* OMP_CLAUSE_UNIFORM */
276 1, /* OMP_CLAUSE_TO_DECLARE */
277 1, /* OMP_CLAUSE_LINK */
278 2, /* OMP_CLAUSE_FROM */
279 2, /* OMP_CLAUSE_TO */
280 2, /* OMP_CLAUSE_MAP */
281 1, /* OMP_CLAUSE_USE_DEVICE_PTR */
282 1, /* OMP_CLAUSE_IS_DEVICE_PTR */
283 2, /* OMP_CLAUSE__CACHE_ */
284 2, /* OMP_CLAUSE_GANG */
285 1, /* OMP_CLAUSE_ASYNC */
286 1, /* OMP_CLAUSE_WAIT */
287 0, /* OMP_CLAUSE_AUTO */
288 0, /* OMP_CLAUSE_SEQ */
289 1, /* OMP_CLAUSE__LOOPTEMP_ */
290 1, /* OMP_CLAUSE_IF */
291 1, /* OMP_CLAUSE_NUM_THREADS */
292 1, /* OMP_CLAUSE_SCHEDULE */
293 0, /* OMP_CLAUSE_NOWAIT */
294 1, /* OMP_CLAUSE_ORDERED */
295 0, /* OMP_CLAUSE_DEFAULT */
296 3, /* OMP_CLAUSE_COLLAPSE */
297 0, /* OMP_CLAUSE_UNTIED */
298 1, /* OMP_CLAUSE_FINAL */
299 0, /* OMP_CLAUSE_MERGEABLE */
300 1, /* OMP_CLAUSE_DEVICE */
301 1, /* OMP_CLAUSE_DIST_SCHEDULE */
302 0, /* OMP_CLAUSE_INBRANCH */
303 0, /* OMP_CLAUSE_NOTINBRANCH */
304 1, /* OMP_CLAUSE_NUM_TEAMS */
305 1, /* OMP_CLAUSE_THREAD_LIMIT */
306 0, /* OMP_CLAUSE_PROC_BIND */
307 1, /* OMP_CLAUSE_SAFELEN */
308 1, /* OMP_CLAUSE_SIMDLEN */
309 0, /* OMP_CLAUSE_FOR */
310 0, /* OMP_CLAUSE_PARALLEL */
311 0, /* OMP_CLAUSE_SECTIONS */
312 0, /* OMP_CLAUSE_TASKGROUP */
313 1, /* OMP_CLAUSE_PRIORITY */
314 1, /* OMP_CLAUSE_GRAINSIZE */
315 1, /* OMP_CLAUSE_NUM_TASKS */
316 0, /* OMP_CLAUSE_NOGROUP */
317 0, /* OMP_CLAUSE_THREADS */
318 0, /* OMP_CLAUSE_SIMD */
319 1, /* OMP_CLAUSE_HINT */
320 0, /* OMP_CLAUSE_DEFALTMAP */
321 1, /* OMP_CLAUSE__SIMDUID_ */
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 1, /* OMP_CLAUSE_TILE */
330 2, /* OMP_CLAUSE__GRIDDIM_ */
333 const char * const omp_clause_code_name
[] =
405 /* Return the tree node structure used by tree code CODE. */
407 static inline enum tree_node_structure_enum
408 tree_node_structure_for_code (enum tree_code code
)
410 switch (TREE_CODE_CLASS (code
))
412 case tcc_declaration
:
417 return TS_FIELD_DECL
;
423 return TS_LABEL_DECL
;
425 return TS_RESULT_DECL
;
426 case DEBUG_EXPR_DECL
:
429 return TS_CONST_DECL
;
433 return TS_FUNCTION_DECL
;
434 case TRANSLATION_UNIT_DECL
:
435 return TS_TRANSLATION_UNIT_DECL
;
437 return TS_DECL_NON_COMMON
;
441 return TS_TYPE_NON_COMMON
;
450 default: /* tcc_constant and tcc_exceptional */
455 /* tcc_constant cases. */
456 case VOID_CST
: return TS_TYPED
;
457 case INTEGER_CST
: return TS_INT_CST
;
458 case REAL_CST
: return TS_REAL_CST
;
459 case FIXED_CST
: return TS_FIXED_CST
;
460 case COMPLEX_CST
: return TS_COMPLEX
;
461 case VECTOR_CST
: return TS_VECTOR
;
462 case STRING_CST
: return TS_STRING
;
463 /* tcc_exceptional cases. */
464 case ERROR_MARK
: return TS_COMMON
;
465 case IDENTIFIER_NODE
: return TS_IDENTIFIER
;
466 case TREE_LIST
: return TS_LIST
;
467 case TREE_VEC
: return TS_VEC
;
468 case SSA_NAME
: return TS_SSA_NAME
;
469 case PLACEHOLDER_EXPR
: return TS_COMMON
;
470 case STATEMENT_LIST
: return TS_STATEMENT_LIST
;
471 case BLOCK
: return TS_BLOCK
;
472 case CONSTRUCTOR
: return TS_CONSTRUCTOR
;
473 case TREE_BINFO
: return TS_BINFO
;
474 case OMP_CLAUSE
: return TS_OMP_CLAUSE
;
475 case OPTIMIZATION_NODE
: return TS_OPTIMIZATION
;
476 case TARGET_OPTION_NODE
: return TS_TARGET_OPTION
;
484 /* Initialize tree_contains_struct to describe the hierarchy of tree
488 initialize_tree_contains_struct (void)
492 for (i
= ERROR_MARK
; i
< LAST_AND_UNUSED_TREE_CODE
; i
++)
495 enum tree_node_structure_enum ts_code
;
497 code
= (enum tree_code
) i
;
498 ts_code
= tree_node_structure_for_code (code
);
500 /* Mark the TS structure itself. */
501 tree_contains_struct
[code
][ts_code
] = 1;
503 /* Mark all the structures that TS is derived from. */
521 case TS_STATEMENT_LIST
:
522 MARK_TS_TYPED (code
);
526 case TS_DECL_MINIMAL
:
532 case TS_OPTIMIZATION
:
533 case TS_TARGET_OPTION
:
534 MARK_TS_COMMON (code
);
537 case TS_TYPE_WITH_LANG_SPECIFIC
:
538 MARK_TS_TYPE_COMMON (code
);
541 case TS_TYPE_NON_COMMON
:
542 MARK_TS_TYPE_WITH_LANG_SPECIFIC (code
);
546 MARK_TS_DECL_MINIMAL (code
);
551 MARK_TS_DECL_COMMON (code
);
554 case TS_DECL_NON_COMMON
:
555 MARK_TS_DECL_WITH_VIS (code
);
558 case TS_DECL_WITH_VIS
:
562 MARK_TS_DECL_WRTL (code
);
566 MARK_TS_DECL_COMMON (code
);
570 MARK_TS_DECL_WITH_VIS (code
);
574 case TS_FUNCTION_DECL
:
575 MARK_TS_DECL_NON_COMMON (code
);
578 case TS_TRANSLATION_UNIT_DECL
:
579 MARK_TS_DECL_COMMON (code
);
587 /* Basic consistency checks for attributes used in fold. */
588 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_NON_COMMON
]);
589 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_NON_COMMON
]);
590 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_DECL_COMMON
]);
591 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_COMMON
]);
592 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_COMMON
]);
593 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_COMMON
]);
594 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_COMMON
]);
595 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_COMMON
]);
596 gcc_assert (tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_COMMON
]);
597 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_COMMON
]);
598 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_DECL_COMMON
]);
599 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_WRTL
]);
600 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_WRTL
]);
601 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_WRTL
]);
602 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WRTL
]);
603 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_WRTL
]);
604 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_DECL_MINIMAL
]);
605 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_MINIMAL
]);
606 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_MINIMAL
]);
607 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_MINIMAL
]);
608 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_MINIMAL
]);
609 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_MINIMAL
]);
610 gcc_assert (tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_MINIMAL
]);
611 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_MINIMAL
]);
612 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_DECL_MINIMAL
]);
613 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_WITH_VIS
]);
614 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WITH_VIS
]);
615 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_WITH_VIS
]);
616 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_VAR_DECL
]);
617 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_FIELD_DECL
]);
618 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_PARM_DECL
]);
619 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_LABEL_DECL
]);
620 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_RESULT_DECL
]);
621 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_CONST_DECL
]);
622 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_TYPE_DECL
]);
623 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_FUNCTION_DECL
]);
624 gcc_assert (tree_contains_struct
[IMPORTED_DECL
][TS_DECL_MINIMAL
]);
625 gcc_assert (tree_contains_struct
[IMPORTED_DECL
][TS_DECL_COMMON
]);
626 gcc_assert (tree_contains_struct
[NAMELIST_DECL
][TS_DECL_MINIMAL
]);
627 gcc_assert (tree_contains_struct
[NAMELIST_DECL
][TS_DECL_COMMON
]);
636 /* Initialize the hash table of types. */
638 = hash_table
<type_cache_hasher
>::create_ggc (TYPE_HASH_INITIAL_SIZE
);
641 = hash_table
<tree_decl_map_cache_hasher
>::create_ggc (512);
644 = hash_table
<tree_decl_map_cache_hasher
>::create_ggc (512);
646 int_cst_hash_table
= hash_table
<int_cst_hasher
>::create_ggc (1024);
648 int_cst_node
= make_int_cst (1, 1);
650 cl_option_hash_table
= hash_table
<cl_option_hasher
>::create_ggc (64);
652 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
653 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
655 /* Initialize the tree_contains_struct array. */
656 initialize_tree_contains_struct ();
657 lang_hooks
.init_ts ();
661 /* The name of the object as the assembler will see it (but before any
662 translations made by ASM_OUTPUT_LABELREF). Often this is the same
663 as DECL_NAME. It is an IDENTIFIER_NODE. */
665 decl_assembler_name (tree decl
)
667 if (!DECL_ASSEMBLER_NAME_SET_P (decl
))
668 lang_hooks
.set_decl_assembler_name (decl
);
669 return DECL_WITH_VIS_CHECK (decl
)->decl_with_vis
.assembler_name
;
672 /* When the target supports COMDAT groups, this indicates which group the
673 DECL is associated with. This can be either an IDENTIFIER_NODE or a
674 decl, in which case its DECL_ASSEMBLER_NAME identifies the group. */
676 decl_comdat_group (const_tree node
)
678 struct symtab_node
*snode
= symtab_node::get (node
);
681 return snode
->get_comdat_group ();
684 /* Likewise, but make sure it's been reduced to an IDENTIFIER_NODE. */
686 decl_comdat_group_id (const_tree node
)
688 struct symtab_node
*snode
= symtab_node::get (node
);
691 return snode
->get_comdat_group_id ();
694 /* When the target supports named section, return its name as IDENTIFIER_NODE
695 or NULL if it is in no section. */
697 decl_section_name (const_tree node
)
699 struct symtab_node
*snode
= symtab_node::get (node
);
702 return snode
->get_section ();
705 /* Set section name of NODE to VALUE (that is expected to be
708 set_decl_section_name (tree node
, const char *value
)
710 struct symtab_node
*snode
;
714 snode
= symtab_node::get (node
);
718 else if (TREE_CODE (node
) == VAR_DECL
)
719 snode
= varpool_node::get_create (node
);
721 snode
= cgraph_node::get_create (node
);
722 snode
->set_section (value
);
725 /* Return TLS model of a variable NODE. */
727 decl_tls_model (const_tree node
)
729 struct varpool_node
*snode
= varpool_node::get (node
);
731 return TLS_MODEL_NONE
;
732 return snode
->tls_model
;
735 /* Set TLS model of variable NODE to MODEL. */
737 set_decl_tls_model (tree node
, enum tls_model model
)
739 struct varpool_node
*vnode
;
741 if (model
== TLS_MODEL_NONE
)
743 vnode
= varpool_node::get (node
);
748 vnode
= varpool_node::get_create (node
);
749 vnode
->tls_model
= model
;
752 /* Compute the number of bytes occupied by a tree with code CODE.
753 This function cannot be used for nodes that have variable sizes,
754 including TREE_VEC, INTEGER_CST, STRING_CST, and CALL_EXPR. */
756 tree_code_size (enum tree_code code
)
758 switch (TREE_CODE_CLASS (code
))
760 case tcc_declaration
: /* A decl node */
765 return sizeof (struct tree_field_decl
);
767 return sizeof (struct tree_parm_decl
);
769 return sizeof (struct tree_var_decl
);
771 return sizeof (struct tree_label_decl
);
773 return sizeof (struct tree_result_decl
);
775 return sizeof (struct tree_const_decl
);
777 return sizeof (struct tree_type_decl
);
779 return sizeof (struct tree_function_decl
);
780 case DEBUG_EXPR_DECL
:
781 return sizeof (struct tree_decl_with_rtl
);
782 case TRANSLATION_UNIT_DECL
:
783 return sizeof (struct tree_translation_unit_decl
);
787 return sizeof (struct tree_decl_non_common
);
789 return lang_hooks
.tree_size (code
);
793 case tcc_type
: /* a type node */
794 return sizeof (struct tree_type_non_common
);
796 case tcc_reference
: /* a reference */
797 case tcc_expression
: /* an expression */
798 case tcc_statement
: /* an expression with side effects */
799 case tcc_comparison
: /* a comparison expression */
800 case tcc_unary
: /* a unary arithmetic expression */
801 case tcc_binary
: /* a binary arithmetic expression */
802 return (sizeof (struct tree_exp
)
803 + (TREE_CODE_LENGTH (code
) - 1) * sizeof (tree
));
805 case tcc_constant
: /* a constant */
808 case VOID_CST
: return sizeof (struct tree_typed
);
809 case INTEGER_CST
: gcc_unreachable ();
810 case REAL_CST
: return sizeof (struct tree_real_cst
);
811 case FIXED_CST
: return sizeof (struct tree_fixed_cst
);
812 case COMPLEX_CST
: return sizeof (struct tree_complex
);
813 case VECTOR_CST
: return sizeof (struct tree_vector
);
814 case STRING_CST
: gcc_unreachable ();
816 return lang_hooks
.tree_size (code
);
819 case tcc_exceptional
: /* something random, like an identifier. */
822 case IDENTIFIER_NODE
: return lang_hooks
.identifier_size
;
823 case TREE_LIST
: return sizeof (struct tree_list
);
826 case PLACEHOLDER_EXPR
: return sizeof (struct tree_common
);
829 case OMP_CLAUSE
: gcc_unreachable ();
831 case SSA_NAME
: return sizeof (struct tree_ssa_name
);
833 case STATEMENT_LIST
: return sizeof (struct tree_statement_list
);
834 case BLOCK
: return sizeof (struct tree_block
);
835 case CONSTRUCTOR
: return sizeof (struct tree_constructor
);
836 case OPTIMIZATION_NODE
: return sizeof (struct tree_optimization_option
);
837 case TARGET_OPTION_NODE
: return sizeof (struct tree_target_option
);
840 return lang_hooks
.tree_size (code
);
848 /* Compute the number of bytes occupied by NODE. This routine only
849 looks at TREE_CODE, except for those nodes that have variable sizes. */
851 tree_size (const_tree node
)
853 const enum tree_code code
= TREE_CODE (node
);
857 return (sizeof (struct tree_int_cst
)
858 + (TREE_INT_CST_EXT_NUNITS (node
) - 1) * sizeof (HOST_WIDE_INT
));
861 return (offsetof (struct tree_binfo
, base_binfos
)
863 ::embedded_size (BINFO_N_BASE_BINFOS (node
)));
866 return (sizeof (struct tree_vec
)
867 + (TREE_VEC_LENGTH (node
) - 1) * sizeof (tree
));
870 return (sizeof (struct tree_vector
)
871 + (TYPE_VECTOR_SUBPARTS (TREE_TYPE (node
)) - 1) * sizeof (tree
));
874 return TREE_STRING_LENGTH (node
) + offsetof (struct tree_string
, str
) + 1;
877 return (sizeof (struct tree_omp_clause
)
878 + (omp_clause_num_ops
[OMP_CLAUSE_CODE (node
)] - 1)
882 if (TREE_CODE_CLASS (code
) == tcc_vl_exp
)
883 return (sizeof (struct tree_exp
)
884 + (VL_EXP_OPERAND_LENGTH (node
) - 1) * sizeof (tree
));
886 return tree_code_size (code
);
890 /* Record interesting allocation statistics for a tree node with CODE
894 record_node_allocation_statistics (enum tree_code code ATTRIBUTE_UNUSED
,
895 size_t length ATTRIBUTE_UNUSED
)
897 enum tree_code_class type
= TREE_CODE_CLASS (code
);
900 if (!GATHER_STATISTICS
)
905 case tcc_declaration
: /* A decl node */
909 case tcc_type
: /* a type node */
913 case tcc_statement
: /* an expression with side effects */
917 case tcc_reference
: /* a reference */
921 case tcc_expression
: /* an expression */
922 case tcc_comparison
: /* a comparison expression */
923 case tcc_unary
: /* a unary arithmetic expression */
924 case tcc_binary
: /* a binary arithmetic expression */
928 case tcc_constant
: /* a constant */
932 case tcc_exceptional
: /* something random, like an identifier. */
935 case IDENTIFIER_NODE
:
948 kind
= ssa_name_kind
;
960 kind
= omp_clause_kind
;
977 tree_code_counts
[(int) code
]++;
978 tree_node_counts
[(int) kind
]++;
979 tree_node_sizes
[(int) kind
] += length
;
982 /* Allocate and return a new UID from the DECL_UID namespace. */
985 allocate_decl_uid (void)
987 return next_decl_uid
++;
990 /* Return a newly allocated node of code CODE. For decl and type
991 nodes, some other fields are initialized. The rest of the node is
992 initialized to zero. This function cannot be used for TREE_VEC,
993 INTEGER_CST or OMP_CLAUSE nodes, which is enforced by asserts in
996 Achoo! I got a code in the node. */
999 make_node_stat (enum tree_code code MEM_STAT_DECL
)
1002 enum tree_code_class type
= TREE_CODE_CLASS (code
);
1003 size_t length
= tree_code_size (code
);
1005 record_node_allocation_statistics (code
, length
);
1007 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
1008 TREE_SET_CODE (t
, code
);
1013 TREE_SIDE_EFFECTS (t
) = 1;
1016 case tcc_declaration
:
1017 if (CODE_CONTAINS_STRUCT (code
, TS_DECL_COMMON
))
1019 if (code
== FUNCTION_DECL
)
1021 SET_DECL_ALIGN (t
, FUNCTION_BOUNDARY
);
1022 DECL_MODE (t
) = FUNCTION_MODE
;
1025 SET_DECL_ALIGN (t
, 1);
1027 DECL_SOURCE_LOCATION (t
) = input_location
;
1028 if (TREE_CODE (t
) == DEBUG_EXPR_DECL
)
1029 DECL_UID (t
) = --next_debug_decl_uid
;
1032 DECL_UID (t
) = allocate_decl_uid ();
1033 SET_DECL_PT_UID (t
, -1);
1035 if (TREE_CODE (t
) == LABEL_DECL
)
1036 LABEL_DECL_UID (t
) = -1;
1041 TYPE_UID (t
) = next_type_uid
++;
1042 SET_TYPE_ALIGN (t
, BITS_PER_UNIT
);
1043 TYPE_USER_ALIGN (t
) = 0;
1044 TYPE_MAIN_VARIANT (t
) = t
;
1045 TYPE_CANONICAL (t
) = t
;
1047 /* Default to no attributes for type, but let target change that. */
1048 TYPE_ATTRIBUTES (t
) = NULL_TREE
;
1049 targetm
.set_default_type_attributes (t
);
1051 /* We have not yet computed the alias set for this type. */
1052 TYPE_ALIAS_SET (t
) = -1;
1056 TREE_CONSTANT (t
) = 1;
1059 case tcc_expression
:
1065 case PREDECREMENT_EXPR
:
1066 case PREINCREMENT_EXPR
:
1067 case POSTDECREMENT_EXPR
:
1068 case POSTINCREMENT_EXPR
:
1069 /* All of these have side-effects, no matter what their
1071 TREE_SIDE_EFFECTS (t
) = 1;
1079 case tcc_exceptional
:
1082 case TARGET_OPTION_NODE
:
1083 TREE_TARGET_OPTION(t
)
1084 = ggc_cleared_alloc
<struct cl_target_option
> ();
1087 case OPTIMIZATION_NODE
:
1088 TREE_OPTIMIZATION (t
)
1089 = ggc_cleared_alloc
<struct cl_optimization
> ();
1098 /* Other classes need no special treatment. */
1105 /* Free tree node. */
1108 free_node (tree node
)
1110 enum tree_code code
= TREE_CODE (node
);
1111 if (GATHER_STATISTICS
)
1113 tree_code_counts
[(int) TREE_CODE (node
)]--;
1114 tree_node_counts
[(int) t_kind
]--;
1115 tree_node_sizes
[(int) t_kind
] -= tree_size (node
);
1117 if (CODE_CONTAINS_STRUCT (code
, TS_CONSTRUCTOR
))
1118 vec_free (CONSTRUCTOR_ELTS (node
));
1119 else if (code
== BLOCK
)
1120 vec_free (BLOCK_NONLOCALIZED_VARS (node
));
1121 else if (code
== TREE_BINFO
)
1122 vec_free (BINFO_BASE_ACCESSES (node
));
1126 /* Return a new node with the same contents as NODE except that its
1127 TREE_CHAIN, if it has one, is zero and it has a fresh uid. */
1130 copy_node_stat (tree node MEM_STAT_DECL
)
1133 enum tree_code code
= TREE_CODE (node
);
1136 gcc_assert (code
!= STATEMENT_LIST
);
1138 length
= tree_size (node
);
1139 record_node_allocation_statistics (code
, length
);
1140 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
1141 memcpy (t
, node
, length
);
1143 if (CODE_CONTAINS_STRUCT (code
, TS_COMMON
))
1145 TREE_ASM_WRITTEN (t
) = 0;
1146 TREE_VISITED (t
) = 0;
1148 if (TREE_CODE_CLASS (code
) == tcc_declaration
)
1150 if (code
== DEBUG_EXPR_DECL
)
1151 DECL_UID (t
) = --next_debug_decl_uid
;
1154 DECL_UID (t
) = allocate_decl_uid ();
1155 if (DECL_PT_UID_SET_P (node
))
1156 SET_DECL_PT_UID (t
, DECL_PT_UID (node
));
1158 if ((TREE_CODE (node
) == PARM_DECL
|| TREE_CODE (node
) == VAR_DECL
)
1159 && DECL_HAS_VALUE_EXPR_P (node
))
1161 SET_DECL_VALUE_EXPR (t
, DECL_VALUE_EXPR (node
));
1162 DECL_HAS_VALUE_EXPR_P (t
) = 1;
1164 /* DECL_DEBUG_EXPR is copied explicitely by callers. */
1165 if (TREE_CODE (node
) == VAR_DECL
)
1167 DECL_HAS_DEBUG_EXPR_P (t
) = 0;
1168 t
->decl_with_vis
.symtab_node
= NULL
;
1170 if (TREE_CODE (node
) == VAR_DECL
&& DECL_HAS_INIT_PRIORITY_P (node
))
1172 SET_DECL_INIT_PRIORITY (t
, DECL_INIT_PRIORITY (node
));
1173 DECL_HAS_INIT_PRIORITY_P (t
) = 1;
1175 if (TREE_CODE (node
) == FUNCTION_DECL
)
1177 DECL_STRUCT_FUNCTION (t
) = NULL
;
1178 t
->decl_with_vis
.symtab_node
= NULL
;
1181 else if (TREE_CODE_CLASS (code
) == tcc_type
)
1183 TYPE_UID (t
) = next_type_uid
++;
1184 /* The following is so that the debug code for
1185 the copy is different from the original type.
1186 The two statements usually duplicate each other
1187 (because they clear fields of the same union),
1188 but the optimizer should catch that. */
1189 TYPE_SYMTAB_POINTER (t
) = 0;
1190 TYPE_SYMTAB_ADDRESS (t
) = 0;
1192 /* Do not copy the values cache. */
1193 if (TYPE_CACHED_VALUES_P (t
))
1195 TYPE_CACHED_VALUES_P (t
) = 0;
1196 TYPE_CACHED_VALUES (t
) = NULL_TREE
;
1199 else if (code
== TARGET_OPTION_NODE
)
1201 TREE_TARGET_OPTION (t
) = ggc_alloc
<struct cl_target_option
>();
1202 memcpy (TREE_TARGET_OPTION (t
), TREE_TARGET_OPTION (node
),
1203 sizeof (struct cl_target_option
));
1205 else if (code
== OPTIMIZATION_NODE
)
1207 TREE_OPTIMIZATION (t
) = ggc_alloc
<struct cl_optimization
>();
1208 memcpy (TREE_OPTIMIZATION (t
), TREE_OPTIMIZATION (node
),
1209 sizeof (struct cl_optimization
));
1215 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
1216 For example, this can copy a list made of TREE_LIST nodes. */
1219 copy_list (tree list
)
1227 head
= prev
= copy_node (list
);
1228 next
= TREE_CHAIN (list
);
1231 TREE_CHAIN (prev
) = copy_node (next
);
1232 prev
= TREE_CHAIN (prev
);
1233 next
= TREE_CHAIN (next
);
1239 /* Return the value that TREE_INT_CST_EXT_NUNITS should have for an
1240 INTEGER_CST with value CST and type TYPE. */
1243 get_int_cst_ext_nunits (tree type
, const wide_int
&cst
)
1245 gcc_checking_assert (cst
.get_precision () == TYPE_PRECISION (type
));
1246 /* We need extra HWIs if CST is an unsigned integer with its
1248 if (TYPE_UNSIGNED (type
) && wi::neg_p (cst
))
1249 return cst
.get_precision () / HOST_BITS_PER_WIDE_INT
+ 1;
1250 return cst
.get_len ();
1253 /* Return a new INTEGER_CST with value CST and type TYPE. */
1256 build_new_int_cst (tree type
, const wide_int
&cst
)
1258 unsigned int len
= cst
.get_len ();
1259 unsigned int ext_len
= get_int_cst_ext_nunits (type
, cst
);
1260 tree nt
= make_int_cst (len
, ext_len
);
1265 TREE_INT_CST_ELT (nt
, ext_len
)
1266 = zext_hwi (-1, cst
.get_precision () % HOST_BITS_PER_WIDE_INT
);
1267 for (unsigned int i
= len
; i
< ext_len
; ++i
)
1268 TREE_INT_CST_ELT (nt
, i
) = -1;
1270 else if (TYPE_UNSIGNED (type
)
1271 && cst
.get_precision () < len
* HOST_BITS_PER_WIDE_INT
)
1274 TREE_INT_CST_ELT (nt
, len
)
1275 = zext_hwi (cst
.elt (len
),
1276 cst
.get_precision () % HOST_BITS_PER_WIDE_INT
);
1279 for (unsigned int i
= 0; i
< len
; i
++)
1280 TREE_INT_CST_ELT (nt
, i
) = cst
.elt (i
);
1281 TREE_TYPE (nt
) = type
;
1285 /* Create an INT_CST node with a LOW value sign extended to TYPE. */
1288 build_int_cst (tree type
, HOST_WIDE_INT low
)
1290 /* Support legacy code. */
1292 type
= integer_type_node
;
1294 return wide_int_to_tree (type
, wi::shwi (low
, TYPE_PRECISION (type
)));
1298 build_int_cstu (tree type
, unsigned HOST_WIDE_INT cst
)
1300 return wide_int_to_tree (type
, wi::uhwi (cst
, TYPE_PRECISION (type
)));
1303 /* Create an INT_CST node with a LOW value sign extended to TYPE. */
1306 build_int_cst_type (tree type
, HOST_WIDE_INT low
)
1309 return wide_int_to_tree (type
, wi::shwi (low
, TYPE_PRECISION (type
)));
1312 /* Constructs tree in type TYPE from with value given by CST. Signedness
1313 of CST is assumed to be the same as the signedness of TYPE. */
1316 double_int_to_tree (tree type
, double_int cst
)
1318 return wide_int_to_tree (type
, widest_int::from (cst
, TYPE_SIGN (type
)));
1321 /* We force the wide_int CST to the range of the type TYPE by sign or
1322 zero extending it. OVERFLOWABLE indicates if we are interested in
1323 overflow of the value, when >0 we are only interested in signed
1324 overflow, for <0 we are interested in any overflow. OVERFLOWED
1325 indicates whether overflow has already occurred. CONST_OVERFLOWED
1326 indicates whether constant overflow has already occurred. We force
1327 T's value to be within range of T's type (by setting to 0 or 1 all
1328 the bits outside the type's range). We set TREE_OVERFLOWED if,
1329 OVERFLOWED is nonzero,
1330 or OVERFLOWABLE is >0 and signed overflow occurs
1331 or OVERFLOWABLE is <0 and any overflow occurs
1332 We return a new tree node for the extended wide_int. The node
1333 is shared if no overflow flags are set. */
1337 force_fit_type (tree type
, const wide_int_ref
&cst
,
1338 int overflowable
, bool overflowed
)
1340 signop sign
= TYPE_SIGN (type
);
1342 /* If we need to set overflow flags, return a new unshared node. */
1343 if (overflowed
|| !wi::fits_to_tree_p (cst
, type
))
1347 || (overflowable
> 0 && sign
== SIGNED
))
1349 wide_int tmp
= wide_int::from (cst
, TYPE_PRECISION (type
), sign
);
1350 tree t
= build_new_int_cst (type
, tmp
);
1351 TREE_OVERFLOW (t
) = 1;
1356 /* Else build a shared node. */
1357 return wide_int_to_tree (type
, cst
);
1360 /* These are the hash table functions for the hash table of INTEGER_CST
1361 nodes of a sizetype. */
1363 /* Return the hash code X, an INTEGER_CST. */
1366 int_cst_hasher::hash (tree x
)
1368 const_tree
const t
= x
;
1369 hashval_t code
= TYPE_UID (TREE_TYPE (t
));
1372 for (i
= 0; i
< TREE_INT_CST_NUNITS (t
); i
++)
1373 code
= iterative_hash_host_wide_int (TREE_INT_CST_ELT(t
, i
), code
);
1378 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
1379 is the same as that given by *Y, which is the same. */
1382 int_cst_hasher::equal (tree x
, tree y
)
1384 const_tree
const xt
= x
;
1385 const_tree
const yt
= y
;
1387 if (TREE_TYPE (xt
) != TREE_TYPE (yt
)
1388 || TREE_INT_CST_NUNITS (xt
) != TREE_INT_CST_NUNITS (yt
)
1389 || TREE_INT_CST_EXT_NUNITS (xt
) != TREE_INT_CST_EXT_NUNITS (yt
))
1392 for (int i
= 0; i
< TREE_INT_CST_NUNITS (xt
); i
++)
1393 if (TREE_INT_CST_ELT (xt
, i
) != TREE_INT_CST_ELT (yt
, i
))
1399 /* Create an INT_CST node of TYPE and value CST.
1400 The returned node is always shared. For small integers we use a
1401 per-type vector cache, for larger ones we use a single hash table.
1402 The value is extended from its precision according to the sign of
1403 the type to be a multiple of HOST_BITS_PER_WIDE_INT. This defines
1404 the upper bits and ensures that hashing and value equality based
1405 upon the underlying HOST_WIDE_INTs works without masking. */
1408 wide_int_to_tree (tree type
, const wide_int_ref
&pcst
)
1415 unsigned int prec
= TYPE_PRECISION (type
);
1416 signop sgn
= TYPE_SIGN (type
);
1418 /* Verify that everything is canonical. */
1419 int l
= pcst
.get_len ();
1422 if (pcst
.elt (l
- 1) == 0)
1423 gcc_checking_assert (pcst
.elt (l
- 2) < 0);
1424 if (pcst
.elt (l
- 1) == (HOST_WIDE_INT
) -1)
1425 gcc_checking_assert (pcst
.elt (l
- 2) >= 0);
1428 wide_int cst
= wide_int::from (pcst
, prec
, sgn
);
1429 unsigned int ext_len
= get_int_cst_ext_nunits (type
, cst
);
1433 /* We just need to store a single HOST_WIDE_INT. */
1435 if (TYPE_UNSIGNED (type
))
1436 hwi
= cst
.to_uhwi ();
1438 hwi
= cst
.to_shwi ();
1440 switch (TREE_CODE (type
))
1443 gcc_assert (hwi
== 0);
1447 case REFERENCE_TYPE
:
1448 case POINTER_BOUNDS_TYPE
:
1449 /* Cache NULL pointer and zero bounds. */
1458 /* Cache false or true. */
1460 if (IN_RANGE (hwi
, 0, 1))
1466 if (TYPE_SIGN (type
) == UNSIGNED
)
1469 limit
= INTEGER_SHARE_LIMIT
;
1470 if (IN_RANGE (hwi
, 0, INTEGER_SHARE_LIMIT
- 1))
1475 /* Cache [-1, N). */
1476 limit
= INTEGER_SHARE_LIMIT
+ 1;
1477 if (IN_RANGE (hwi
, -1, INTEGER_SHARE_LIMIT
- 1))
1491 /* Look for it in the type's vector of small shared ints. */
1492 if (!TYPE_CACHED_VALUES_P (type
))
1494 TYPE_CACHED_VALUES_P (type
) = 1;
1495 TYPE_CACHED_VALUES (type
) = make_tree_vec (limit
);
1498 t
= TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
);
1500 /* Make sure no one is clobbering the shared constant. */
1501 gcc_checking_assert (TREE_TYPE (t
) == type
1502 && TREE_INT_CST_NUNITS (t
) == 1
1503 && TREE_INT_CST_OFFSET_NUNITS (t
) == 1
1504 && TREE_INT_CST_EXT_NUNITS (t
) == 1
1505 && TREE_INT_CST_ELT (t
, 0) == hwi
);
1508 /* Create a new shared int. */
1509 t
= build_new_int_cst (type
, cst
);
1510 TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) = t
;
1515 /* Use the cache of larger shared ints, using int_cst_node as
1518 TREE_INT_CST_ELT (int_cst_node
, 0) = hwi
;
1519 TREE_TYPE (int_cst_node
) = type
;
1521 tree
*slot
= int_cst_hash_table
->find_slot (int_cst_node
, INSERT
);
1525 /* Insert this one into the hash table. */
1528 /* Make a new node for next time round. */
1529 int_cst_node
= make_int_cst (1, 1);
1535 /* The value either hashes properly or we drop it on the floor
1536 for the gc to take care of. There will not be enough of them
1539 tree nt
= build_new_int_cst (type
, cst
);
1540 tree
*slot
= int_cst_hash_table
->find_slot (nt
, INSERT
);
1544 /* Insert this one into the hash table. */
1554 cache_integer_cst (tree t
)
1556 tree type
= TREE_TYPE (t
);
1559 int prec
= TYPE_PRECISION (type
);
1561 gcc_assert (!TREE_OVERFLOW (t
));
1563 switch (TREE_CODE (type
))
1566 gcc_assert (integer_zerop (t
));
1570 case REFERENCE_TYPE
:
1571 /* Cache NULL pointer. */
1572 if (integer_zerop (t
))
1580 /* Cache false or true. */
1582 if (wi::ltu_p (t
, 2))
1583 ix
= TREE_INT_CST_ELT (t
, 0);
1588 if (TYPE_UNSIGNED (type
))
1591 limit
= INTEGER_SHARE_LIMIT
;
1593 /* This is a little hokie, but if the prec is smaller than
1594 what is necessary to hold INTEGER_SHARE_LIMIT, then the
1595 obvious test will not get the correct answer. */
1596 if (prec
< HOST_BITS_PER_WIDE_INT
)
1598 if (tree_to_uhwi (t
) < (unsigned HOST_WIDE_INT
) INTEGER_SHARE_LIMIT
)
1599 ix
= tree_to_uhwi (t
);
1601 else if (wi::ltu_p (t
, INTEGER_SHARE_LIMIT
))
1602 ix
= tree_to_uhwi (t
);
1607 limit
= INTEGER_SHARE_LIMIT
+ 1;
1609 if (integer_minus_onep (t
))
1611 else if (!wi::neg_p (t
))
1613 if (prec
< HOST_BITS_PER_WIDE_INT
)
1615 if (tree_to_shwi (t
) < INTEGER_SHARE_LIMIT
)
1616 ix
= tree_to_shwi (t
) + 1;
1618 else if (wi::ltu_p (t
, INTEGER_SHARE_LIMIT
))
1619 ix
= tree_to_shwi (t
) + 1;
1633 /* Look for it in the type's vector of small shared ints. */
1634 if (!TYPE_CACHED_VALUES_P (type
))
1636 TYPE_CACHED_VALUES_P (type
) = 1;
1637 TYPE_CACHED_VALUES (type
) = make_tree_vec (limit
);
1640 gcc_assert (TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) == NULL_TREE
);
1641 TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) = t
;
1645 /* Use the cache of larger shared ints. */
1646 tree
*slot
= int_cst_hash_table
->find_slot (t
, INSERT
);
1647 /* If there is already an entry for the number verify it's the
1650 gcc_assert (wi::eq_p (tree (*slot
), t
));
1652 /* Otherwise insert this one into the hash table. */
1658 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
1659 and the rest are zeros. */
1662 build_low_bits_mask (tree type
, unsigned bits
)
1664 gcc_assert (bits
<= TYPE_PRECISION (type
));
1666 return wide_int_to_tree (type
, wi::mask (bits
, false,
1667 TYPE_PRECISION (type
)));
1670 /* Checks that X is integer constant that can be expressed in (unsigned)
1671 HOST_WIDE_INT without loss of precision. */
1674 cst_and_fits_in_hwi (const_tree x
)
1676 return (TREE_CODE (x
) == INTEGER_CST
1677 && TYPE_PRECISION (TREE_TYPE (x
)) <= HOST_BITS_PER_WIDE_INT
);
1680 /* Build a newly constructed VECTOR_CST node of length LEN. */
1683 make_vector_stat (unsigned len MEM_STAT_DECL
)
1686 unsigned length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vector
);
1688 record_node_allocation_statistics (VECTOR_CST
, length
);
1690 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
1692 TREE_SET_CODE (t
, VECTOR_CST
);
1693 TREE_CONSTANT (t
) = 1;
1698 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1699 are in a list pointed to by VALS. */
1702 build_vector_stat (tree type
, tree
*vals MEM_STAT_DECL
)
1706 tree v
= make_vector (TYPE_VECTOR_SUBPARTS (type
));
1707 TREE_TYPE (v
) = type
;
1709 /* Iterate through elements and check for overflow. */
1710 for (cnt
= 0; cnt
< TYPE_VECTOR_SUBPARTS (type
); ++cnt
)
1712 tree value
= vals
[cnt
];
1714 VECTOR_CST_ELT (v
, cnt
) = value
;
1716 /* Don't crash if we get an address constant. */
1717 if (!CONSTANT_CLASS_P (value
))
1720 over
|= TREE_OVERFLOW (value
);
1723 TREE_OVERFLOW (v
) = over
;
1727 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1728 are extracted from V, a vector of CONSTRUCTOR_ELT. */
1731 build_vector_from_ctor (tree type
, vec
<constructor_elt
, va_gc
> *v
)
1733 tree
*vec
= XALLOCAVEC (tree
, TYPE_VECTOR_SUBPARTS (type
));
1734 unsigned HOST_WIDE_INT idx
, pos
= 0;
1737 FOR_EACH_CONSTRUCTOR_VALUE (v
, idx
, value
)
1739 if (TREE_CODE (value
) == VECTOR_CST
)
1740 for (unsigned i
= 0; i
< VECTOR_CST_NELTS (value
); ++i
)
1741 vec
[pos
++] = VECTOR_CST_ELT (value
, i
);
1745 while (pos
< TYPE_VECTOR_SUBPARTS (type
))
1746 vec
[pos
++] = build_zero_cst (TREE_TYPE (type
));
1748 return build_vector (type
, vec
);
1751 /* Build a vector of type VECTYPE where all the elements are SCs. */
1753 build_vector_from_val (tree vectype
, tree sc
)
1755 int i
, nunits
= TYPE_VECTOR_SUBPARTS (vectype
);
1757 if (sc
== error_mark_node
)
1760 /* Verify that the vector type is suitable for SC. Note that there
1761 is some inconsistency in the type-system with respect to restrict
1762 qualifications of pointers. Vector types always have a main-variant
1763 element type and the qualification is applied to the vector-type.
1764 So TREE_TYPE (vector-type) does not return a properly qualified
1765 vector element-type. */
1766 gcc_checking_assert (types_compatible_p (TYPE_MAIN_VARIANT (TREE_TYPE (sc
)),
1767 TREE_TYPE (vectype
)));
1769 if (CONSTANT_CLASS_P (sc
))
1771 tree
*v
= XALLOCAVEC (tree
, nunits
);
1772 for (i
= 0; i
< nunits
; ++i
)
1774 return build_vector (vectype
, v
);
1778 vec
<constructor_elt
, va_gc
> *v
;
1779 vec_alloc (v
, nunits
);
1780 for (i
= 0; i
< nunits
; ++i
)
1781 CONSTRUCTOR_APPEND_ELT (v
, NULL_TREE
, sc
);
1782 return build_constructor (vectype
, v
);
1786 /* Something has messed with the elements of CONSTRUCTOR C after it was built;
1787 calculate TREE_CONSTANT and TREE_SIDE_EFFECTS. */
1790 recompute_constructor_flags (tree c
)
1794 bool constant_p
= true;
1795 bool side_effects_p
= false;
1796 vec
<constructor_elt
, va_gc
> *vals
= CONSTRUCTOR_ELTS (c
);
1798 FOR_EACH_CONSTRUCTOR_VALUE (vals
, i
, val
)
1800 /* Mostly ctors will have elts that don't have side-effects, so
1801 the usual case is to scan all the elements. Hence a single
1802 loop for both const and side effects, rather than one loop
1803 each (with early outs). */
1804 if (!TREE_CONSTANT (val
))
1806 if (TREE_SIDE_EFFECTS (val
))
1807 side_effects_p
= true;
1810 TREE_SIDE_EFFECTS (c
) = side_effects_p
;
1811 TREE_CONSTANT (c
) = constant_p
;
1814 /* Make sure that TREE_CONSTANT and TREE_SIDE_EFFECTS are correct for
1818 verify_constructor_flags (tree c
)
1822 bool constant_p
= TREE_CONSTANT (c
);
1823 bool side_effects_p
= TREE_SIDE_EFFECTS (c
);
1824 vec
<constructor_elt
, va_gc
> *vals
= CONSTRUCTOR_ELTS (c
);
1826 FOR_EACH_CONSTRUCTOR_VALUE (vals
, i
, val
)
1828 if (constant_p
&& !TREE_CONSTANT (val
))
1829 internal_error ("non-constant element in constant CONSTRUCTOR");
1830 if (!side_effects_p
&& TREE_SIDE_EFFECTS (val
))
1831 internal_error ("side-effects element in no-side-effects CONSTRUCTOR");
1835 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1836 are in the vec pointed to by VALS. */
1838 build_constructor (tree type
, vec
<constructor_elt
, va_gc
> *vals
)
1840 tree c
= make_node (CONSTRUCTOR
);
1842 TREE_TYPE (c
) = type
;
1843 CONSTRUCTOR_ELTS (c
) = vals
;
1845 recompute_constructor_flags (c
);
1850 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
1853 build_constructor_single (tree type
, tree index
, tree value
)
1855 vec
<constructor_elt
, va_gc
> *v
;
1856 constructor_elt elt
= {index
, value
};
1859 v
->quick_push (elt
);
1861 return build_constructor (type
, v
);
1865 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1866 are in a list pointed to by VALS. */
1868 build_constructor_from_list (tree type
, tree vals
)
1871 vec
<constructor_elt
, va_gc
> *v
= NULL
;
1875 vec_alloc (v
, list_length (vals
));
1876 for (t
= vals
; t
; t
= TREE_CHAIN (t
))
1877 CONSTRUCTOR_APPEND_ELT (v
, TREE_PURPOSE (t
), TREE_VALUE (t
));
1880 return build_constructor (type
, v
);
1883 /* Return a new CONSTRUCTOR node whose type is TYPE. NELTS is the number
1884 of elements, provided as index/value pairs. */
1887 build_constructor_va (tree type
, int nelts
, ...)
1889 vec
<constructor_elt
, va_gc
> *v
= NULL
;
1892 va_start (p
, nelts
);
1893 vec_alloc (v
, nelts
);
1896 tree index
= va_arg (p
, tree
);
1897 tree value
= va_arg (p
, tree
);
1898 CONSTRUCTOR_APPEND_ELT (v
, index
, value
);
1901 return build_constructor (type
, v
);
1904 /* Return a new FIXED_CST node whose type is TYPE and value is F. */
1907 build_fixed (tree type
, FIXED_VALUE_TYPE f
)
1910 FIXED_VALUE_TYPE
*fp
;
1912 v
= make_node (FIXED_CST
);
1913 fp
= ggc_alloc
<fixed_value
> ();
1914 memcpy (fp
, &f
, sizeof (FIXED_VALUE_TYPE
));
1916 TREE_TYPE (v
) = type
;
1917 TREE_FIXED_CST_PTR (v
) = fp
;
1921 /* Return a new REAL_CST node whose type is TYPE and value is D. */
1924 build_real (tree type
, REAL_VALUE_TYPE d
)
1927 REAL_VALUE_TYPE
*dp
;
1930 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
1931 Consider doing it via real_convert now. */
1933 v
= make_node (REAL_CST
);
1934 dp
= ggc_alloc
<real_value
> ();
1935 memcpy (dp
, &d
, sizeof (REAL_VALUE_TYPE
));
1937 TREE_TYPE (v
) = type
;
1938 TREE_REAL_CST_PTR (v
) = dp
;
1939 TREE_OVERFLOW (v
) = overflow
;
1943 /* Like build_real, but first truncate D to the type. */
1946 build_real_truncate (tree type
, REAL_VALUE_TYPE d
)
1948 return build_real (type
, real_value_truncate (TYPE_MODE (type
), d
));
1951 /* Return a new REAL_CST node whose type is TYPE
1952 and whose value is the integer value of the INTEGER_CST node I. */
1955 real_value_from_int_cst (const_tree type
, const_tree i
)
1959 /* Clear all bits of the real value type so that we can later do
1960 bitwise comparisons to see if two values are the same. */
1961 memset (&d
, 0, sizeof d
);
1963 real_from_integer (&d
, type
? TYPE_MODE (type
) : VOIDmode
, i
,
1964 TYPE_SIGN (TREE_TYPE (i
)));
1968 /* Given a tree representing an integer constant I, return a tree
1969 representing the same value as a floating-point constant of type TYPE. */
1972 build_real_from_int_cst (tree type
, const_tree i
)
1975 int overflow
= TREE_OVERFLOW (i
);
1977 v
= build_real (type
, real_value_from_int_cst (type
, i
));
1979 TREE_OVERFLOW (v
) |= overflow
;
1983 /* Return a newly constructed STRING_CST node whose value is
1984 the LEN characters at STR.
1985 Note that for a C string literal, LEN should include the trailing NUL.
1986 The TREE_TYPE is not initialized. */
1989 build_string (int len
, const char *str
)
1994 /* Do not waste bytes provided by padding of struct tree_string. */
1995 length
= len
+ offsetof (struct tree_string
, str
) + 1;
1997 record_node_allocation_statistics (STRING_CST
, length
);
1999 s
= (tree
) ggc_internal_alloc (length
);
2001 memset (s
, 0, sizeof (struct tree_typed
));
2002 TREE_SET_CODE (s
, STRING_CST
);
2003 TREE_CONSTANT (s
) = 1;
2004 TREE_STRING_LENGTH (s
) = len
;
2005 memcpy (s
->string
.str
, str
, len
);
2006 s
->string
.str
[len
] = '\0';
2011 /* Return a newly constructed COMPLEX_CST node whose value is
2012 specified by the real and imaginary parts REAL and IMAG.
2013 Both REAL and IMAG should be constant nodes. TYPE, if specified,
2014 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
2017 build_complex (tree type
, tree real
, tree imag
)
2019 tree t
= make_node (COMPLEX_CST
);
2021 TREE_REALPART (t
) = real
;
2022 TREE_IMAGPART (t
) = imag
;
2023 TREE_TYPE (t
) = type
? type
: build_complex_type (TREE_TYPE (real
));
2024 TREE_OVERFLOW (t
) = TREE_OVERFLOW (real
) | TREE_OVERFLOW (imag
);
2028 /* Build a complex (inf +- 0i), such as for the result of cproj.
2029 TYPE is the complex tree type of the result. If NEG is true, the
2030 imaginary zero is negative. */
2033 build_complex_inf (tree type
, bool neg
)
2035 REAL_VALUE_TYPE rinf
, rzero
= dconst0
;
2039 return build_complex (type
, build_real (TREE_TYPE (type
), rinf
),
2040 build_real (TREE_TYPE (type
), rzero
));
2043 /* Return the constant 1 in type TYPE. If TYPE has several elements, each
2044 element is set to 1. In particular, this is 1 + i for complex types. */
2047 build_each_one_cst (tree type
)
2049 if (TREE_CODE (type
) == COMPLEX_TYPE
)
2051 tree scalar
= build_one_cst (TREE_TYPE (type
));
2052 return build_complex (type
, scalar
, scalar
);
2055 return build_one_cst (type
);
2058 /* Return a constant of arithmetic type TYPE which is the
2059 multiplicative identity of the set TYPE. */
2062 build_one_cst (tree type
)
2064 switch (TREE_CODE (type
))
2066 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
2067 case POINTER_TYPE
: case REFERENCE_TYPE
:
2069 return build_int_cst (type
, 1);
2072 return build_real (type
, dconst1
);
2074 case FIXED_POINT_TYPE
:
2075 /* We can only generate 1 for accum types. */
2076 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type
)));
2077 return build_fixed (type
, FCONST1 (TYPE_MODE (type
)));
2081 tree scalar
= build_one_cst (TREE_TYPE (type
));
2083 return build_vector_from_val (type
, scalar
);
2087 return build_complex (type
,
2088 build_one_cst (TREE_TYPE (type
)),
2089 build_zero_cst (TREE_TYPE (type
)));
2096 /* Return an integer of type TYPE containing all 1's in as much precision as
2097 it contains, or a complex or vector whose subparts are such integers. */
2100 build_all_ones_cst (tree type
)
2102 if (TREE_CODE (type
) == COMPLEX_TYPE
)
2104 tree scalar
= build_all_ones_cst (TREE_TYPE (type
));
2105 return build_complex (type
, scalar
, scalar
);
2108 return build_minus_one_cst (type
);
2111 /* Return a constant of arithmetic type TYPE which is the
2112 opposite of the multiplicative identity of the set TYPE. */
2115 build_minus_one_cst (tree type
)
2117 switch (TREE_CODE (type
))
2119 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
2120 case POINTER_TYPE
: case REFERENCE_TYPE
:
2122 return build_int_cst (type
, -1);
2125 return build_real (type
, dconstm1
);
2127 case FIXED_POINT_TYPE
:
2128 /* We can only generate 1 for accum types. */
2129 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type
)));
2130 return build_fixed (type
, fixed_from_double_int (double_int_minus_one
,
2135 tree scalar
= build_minus_one_cst (TREE_TYPE (type
));
2137 return build_vector_from_val (type
, scalar
);
2141 return build_complex (type
,
2142 build_minus_one_cst (TREE_TYPE (type
)),
2143 build_zero_cst (TREE_TYPE (type
)));
2150 /* Build 0 constant of type TYPE. This is used by constructor folding
2151 and thus the constant should be represented in memory by
2155 build_zero_cst (tree type
)
2157 switch (TREE_CODE (type
))
2159 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
2160 case POINTER_TYPE
: case REFERENCE_TYPE
:
2161 case OFFSET_TYPE
: case NULLPTR_TYPE
:
2162 return build_int_cst (type
, 0);
2165 return build_real (type
, dconst0
);
2167 case FIXED_POINT_TYPE
:
2168 return build_fixed (type
, FCONST0 (TYPE_MODE (type
)));
2172 tree scalar
= build_zero_cst (TREE_TYPE (type
));
2174 return build_vector_from_val (type
, scalar
);
2179 tree zero
= build_zero_cst (TREE_TYPE (type
));
2181 return build_complex (type
, zero
, zero
);
2185 if (!AGGREGATE_TYPE_P (type
))
2186 return fold_convert (type
, integer_zero_node
);
2187 return build_constructor (type
, NULL
);
2192 /* Build a BINFO with LEN language slots. */
2195 make_tree_binfo_stat (unsigned base_binfos MEM_STAT_DECL
)
2198 size_t length
= (offsetof (struct tree_binfo
, base_binfos
)
2199 + vec
<tree
, va_gc
>::embedded_size (base_binfos
));
2201 record_node_allocation_statistics (TREE_BINFO
, length
);
2203 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
2205 memset (t
, 0, offsetof (struct tree_binfo
, base_binfos
));
2207 TREE_SET_CODE (t
, TREE_BINFO
);
2209 BINFO_BASE_BINFOS (t
)->embedded_init (base_binfos
);
2214 /* Create a CASE_LABEL_EXPR tree node and return it. */
2217 build_case_label (tree low_value
, tree high_value
, tree label_decl
)
2219 tree t
= make_node (CASE_LABEL_EXPR
);
2221 TREE_TYPE (t
) = void_type_node
;
2222 SET_EXPR_LOCATION (t
, DECL_SOURCE_LOCATION (label_decl
));
2224 CASE_LOW (t
) = low_value
;
2225 CASE_HIGH (t
) = high_value
;
2226 CASE_LABEL (t
) = label_decl
;
2227 CASE_CHAIN (t
) = NULL_TREE
;
2232 /* Build a newly constructed INTEGER_CST node. LEN and EXT_LEN are the
2233 values of TREE_INT_CST_NUNITS and TREE_INT_CST_EXT_NUNITS respectively.
2234 The latter determines the length of the HOST_WIDE_INT vector. */
2237 make_int_cst_stat (int len
, int ext_len MEM_STAT_DECL
)
2240 int length
= ((ext_len
- 1) * sizeof (HOST_WIDE_INT
)
2241 + sizeof (struct tree_int_cst
));
2244 record_node_allocation_statistics (INTEGER_CST
, length
);
2246 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
2248 TREE_SET_CODE (t
, INTEGER_CST
);
2249 TREE_INT_CST_NUNITS (t
) = len
;
2250 TREE_INT_CST_EXT_NUNITS (t
) = ext_len
;
2251 /* to_offset can only be applied to trees that are offset_int-sized
2252 or smaller. EXT_LEN is correct if it fits, otherwise the constant
2253 must be exactly the precision of offset_int and so LEN is correct. */
2254 if (ext_len
<= OFFSET_INT_ELTS
)
2255 TREE_INT_CST_OFFSET_NUNITS (t
) = ext_len
;
2257 TREE_INT_CST_OFFSET_NUNITS (t
) = len
;
2259 TREE_CONSTANT (t
) = 1;
2264 /* Build a newly constructed TREE_VEC node of length LEN. */
2267 make_tree_vec_stat (int len MEM_STAT_DECL
)
2270 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
2272 record_node_allocation_statistics (TREE_VEC
, length
);
2274 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
2276 TREE_SET_CODE (t
, TREE_VEC
);
2277 TREE_VEC_LENGTH (t
) = len
;
2282 /* Grow a TREE_VEC node to new length LEN. */
2285 grow_tree_vec_stat (tree v
, int len MEM_STAT_DECL
)
2287 gcc_assert (TREE_CODE (v
) == TREE_VEC
);
2289 int oldlen
= TREE_VEC_LENGTH (v
);
2290 gcc_assert (len
> oldlen
);
2292 int oldlength
= (oldlen
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
2293 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
2295 record_node_allocation_statistics (TREE_VEC
, length
- oldlength
);
2297 v
= (tree
) ggc_realloc (v
, length PASS_MEM_STAT
);
2299 TREE_VEC_LENGTH (v
) = len
;
2304 /* Return 1 if EXPR is the constant zero, whether it is integral, float or
2305 fixed, and scalar, complex or vector. */
2308 zerop (const_tree expr
)
2310 return (integer_zerop (expr
)
2311 || real_zerop (expr
)
2312 || fixed_zerop (expr
));
2315 /* Return 1 if EXPR is the integer constant zero or a complex constant
2319 integer_zerop (const_tree expr
)
2321 switch (TREE_CODE (expr
))
2324 return wi::eq_p (expr
, 0);
2326 return (integer_zerop (TREE_REALPART (expr
))
2327 && integer_zerop (TREE_IMAGPART (expr
)));
2331 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2332 if (!integer_zerop (VECTOR_CST_ELT (expr
, i
)))
2341 /* Return 1 if EXPR is the integer constant one or the corresponding
2342 complex constant. */
2345 integer_onep (const_tree expr
)
2347 switch (TREE_CODE (expr
))
2350 return wi::eq_p (wi::to_widest (expr
), 1);
2352 return (integer_onep (TREE_REALPART (expr
))
2353 && integer_zerop (TREE_IMAGPART (expr
)));
2357 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2358 if (!integer_onep (VECTOR_CST_ELT (expr
, i
)))
2367 /* Return 1 if EXPR is the integer constant one. For complex and vector,
2368 return 1 if every piece is the integer constant one. */
2371 integer_each_onep (const_tree expr
)
2373 if (TREE_CODE (expr
) == COMPLEX_CST
)
2374 return (integer_onep (TREE_REALPART (expr
))
2375 && integer_onep (TREE_IMAGPART (expr
)));
2377 return integer_onep (expr
);
2380 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
2381 it contains, or a complex or vector whose subparts are such integers. */
2384 integer_all_onesp (const_tree expr
)
2386 if (TREE_CODE (expr
) == COMPLEX_CST
2387 && integer_all_onesp (TREE_REALPART (expr
))
2388 && integer_all_onesp (TREE_IMAGPART (expr
)))
2391 else if (TREE_CODE (expr
) == VECTOR_CST
)
2394 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2395 if (!integer_all_onesp (VECTOR_CST_ELT (expr
, i
)))
2400 else if (TREE_CODE (expr
) != INTEGER_CST
)
2403 return wi::max_value (TYPE_PRECISION (TREE_TYPE (expr
)), UNSIGNED
) == expr
;
2406 /* Return 1 if EXPR is the integer constant minus one. */
2409 integer_minus_onep (const_tree expr
)
2411 if (TREE_CODE (expr
) == COMPLEX_CST
)
2412 return (integer_all_onesp (TREE_REALPART (expr
))
2413 && integer_zerop (TREE_IMAGPART (expr
)));
2415 return integer_all_onesp (expr
);
2418 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
2422 integer_pow2p (const_tree expr
)
2424 if (TREE_CODE (expr
) == COMPLEX_CST
2425 && integer_pow2p (TREE_REALPART (expr
))
2426 && integer_zerop (TREE_IMAGPART (expr
)))
2429 if (TREE_CODE (expr
) != INTEGER_CST
)
2432 return wi::popcount (expr
) == 1;
2435 /* Return 1 if EXPR is an integer constant other than zero or a
2436 complex constant other than zero. */
2439 integer_nonzerop (const_tree expr
)
2441 return ((TREE_CODE (expr
) == INTEGER_CST
2442 && !wi::eq_p (expr
, 0))
2443 || (TREE_CODE (expr
) == COMPLEX_CST
2444 && (integer_nonzerop (TREE_REALPART (expr
))
2445 || integer_nonzerop (TREE_IMAGPART (expr
)))));
2448 /* Return 1 if EXPR is the integer constant one. For vector,
2449 return 1 if every piece is the integer constant minus one
2450 (representing the value TRUE). */
2453 integer_truep (const_tree expr
)
2455 if (TREE_CODE (expr
) == VECTOR_CST
)
2456 return integer_all_onesp (expr
);
2457 return integer_onep (expr
);
2460 /* Return 1 if EXPR is the fixed-point constant zero. */
2463 fixed_zerop (const_tree expr
)
2465 return (TREE_CODE (expr
) == FIXED_CST
2466 && TREE_FIXED_CST (expr
).data
.is_zero ());
2469 /* Return the power of two represented by a tree node known to be a
2473 tree_log2 (const_tree expr
)
2475 if (TREE_CODE (expr
) == COMPLEX_CST
)
2476 return tree_log2 (TREE_REALPART (expr
));
2478 return wi::exact_log2 (expr
);
2481 /* Similar, but return the largest integer Y such that 2 ** Y is less
2482 than or equal to EXPR. */
2485 tree_floor_log2 (const_tree expr
)
2487 if (TREE_CODE (expr
) == COMPLEX_CST
)
2488 return tree_log2 (TREE_REALPART (expr
));
2490 return wi::floor_log2 (expr
);
2493 /* Return number of known trailing zero bits in EXPR, or, if the value of
2494 EXPR is known to be zero, the precision of it's type. */
2497 tree_ctz (const_tree expr
)
2499 if (!INTEGRAL_TYPE_P (TREE_TYPE (expr
))
2500 && !POINTER_TYPE_P (TREE_TYPE (expr
)))
2503 unsigned int ret1
, ret2
, prec
= TYPE_PRECISION (TREE_TYPE (expr
));
2504 switch (TREE_CODE (expr
))
2507 ret1
= wi::ctz (expr
);
2508 return MIN (ret1
, prec
);
2510 ret1
= wi::ctz (get_nonzero_bits (expr
));
2511 return MIN (ret1
, prec
);
2518 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2521 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2522 return MIN (ret1
, ret2
);
2523 case POINTER_PLUS_EXPR
:
2524 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2525 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2526 /* Second operand is sizetype, which could be in theory
2527 wider than pointer's precision. Make sure we never
2528 return more than prec. */
2529 ret2
= MIN (ret2
, prec
);
2530 return MIN (ret1
, ret2
);
2532 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2533 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2534 return MAX (ret1
, ret2
);
2536 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2537 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2538 return MIN (ret1
+ ret2
, prec
);
2540 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2541 if (tree_fits_uhwi_p (TREE_OPERAND (expr
, 1))
2542 && (tree_to_uhwi (TREE_OPERAND (expr
, 1)) < prec
))
2544 ret2
= tree_to_uhwi (TREE_OPERAND (expr
, 1));
2545 return MIN (ret1
+ ret2
, prec
);
2549 if (tree_fits_uhwi_p (TREE_OPERAND (expr
, 1))
2550 && (tree_to_uhwi (TREE_OPERAND (expr
, 1)) < prec
))
2552 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2553 ret2
= tree_to_uhwi (TREE_OPERAND (expr
, 1));
2558 case TRUNC_DIV_EXPR
:
2560 case FLOOR_DIV_EXPR
:
2561 case ROUND_DIV_EXPR
:
2562 case EXACT_DIV_EXPR
:
2563 if (TREE_CODE (TREE_OPERAND (expr
, 1)) == INTEGER_CST
2564 && tree_int_cst_sgn (TREE_OPERAND (expr
, 1)) == 1)
2566 int l
= tree_log2 (TREE_OPERAND (expr
, 1));
2569 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2577 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2578 if (ret1
&& ret1
== TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (expr
, 0))))
2580 return MIN (ret1
, prec
);
2582 return tree_ctz (TREE_OPERAND (expr
, 0));
2584 ret1
= tree_ctz (TREE_OPERAND (expr
, 1));
2587 ret2
= tree_ctz (TREE_OPERAND (expr
, 2));
2588 return MIN (ret1
, ret2
);
2590 return tree_ctz (TREE_OPERAND (expr
, 1));
2592 ret1
= get_pointer_alignment (CONST_CAST_TREE (expr
));
2593 if (ret1
> BITS_PER_UNIT
)
2595 ret1
= ctz_hwi (ret1
/ BITS_PER_UNIT
);
2596 return MIN (ret1
, prec
);
2604 /* Return 1 if EXPR is the real constant zero. Trailing zeroes matter for
2605 decimal float constants, so don't return 1 for them. */
2608 real_zerop (const_tree expr
)
2610 switch (TREE_CODE (expr
))
2613 return real_equal (&TREE_REAL_CST (expr
), &dconst0
)
2614 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2616 return real_zerop (TREE_REALPART (expr
))
2617 && real_zerop (TREE_IMAGPART (expr
));
2621 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2622 if (!real_zerop (VECTOR_CST_ELT (expr
, i
)))
2631 /* Return 1 if EXPR is the real constant one in real or complex form.
2632 Trailing zeroes matter for decimal float constants, so don't return
2636 real_onep (const_tree expr
)
2638 switch (TREE_CODE (expr
))
2641 return real_equal (&TREE_REAL_CST (expr
), &dconst1
)
2642 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2644 return real_onep (TREE_REALPART (expr
))
2645 && real_zerop (TREE_IMAGPART (expr
));
2649 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2650 if (!real_onep (VECTOR_CST_ELT (expr
, i
)))
2659 /* Return 1 if EXPR is the real constant minus one. Trailing zeroes
2660 matter for decimal float constants, so don't return 1 for them. */
2663 real_minus_onep (const_tree expr
)
2665 switch (TREE_CODE (expr
))
2668 return real_equal (&TREE_REAL_CST (expr
), &dconstm1
)
2669 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2671 return real_minus_onep (TREE_REALPART (expr
))
2672 && real_zerop (TREE_IMAGPART (expr
));
2676 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2677 if (!real_minus_onep (VECTOR_CST_ELT (expr
, i
)))
2686 /* Nonzero if EXP is a constant or a cast of a constant. */
2689 really_constant_p (const_tree exp
)
2691 /* This is not quite the same as STRIP_NOPS. It does more. */
2692 while (CONVERT_EXPR_P (exp
)
2693 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
2694 exp
= TREE_OPERAND (exp
, 0);
2695 return TREE_CONSTANT (exp
);
2698 /* Return first list element whose TREE_VALUE is ELEM.
2699 Return 0 if ELEM is not in LIST. */
2702 value_member (tree elem
, tree list
)
2706 if (elem
== TREE_VALUE (list
))
2708 list
= TREE_CHAIN (list
);
2713 /* Return first list element whose TREE_PURPOSE is ELEM.
2714 Return 0 if ELEM is not in LIST. */
2717 purpose_member (const_tree elem
, tree list
)
2721 if (elem
== TREE_PURPOSE (list
))
2723 list
= TREE_CHAIN (list
);
2728 /* Return true if ELEM is in V. */
2731 vec_member (const_tree elem
, vec
<tree
, va_gc
> *v
)
2735 FOR_EACH_VEC_SAFE_ELT (v
, ix
, t
)
2741 /* Returns element number IDX (zero-origin) of chain CHAIN, or
2745 chain_index (int idx
, tree chain
)
2747 for (; chain
&& idx
> 0; --idx
)
2748 chain
= TREE_CHAIN (chain
);
2752 /* Return nonzero if ELEM is part of the chain CHAIN. */
2755 chain_member (const_tree elem
, const_tree chain
)
2761 chain
= DECL_CHAIN (chain
);
2767 /* Return the length of a chain of nodes chained through TREE_CHAIN.
2768 We expect a null pointer to mark the end of the chain.
2769 This is the Lisp primitive `length'. */
2772 list_length (const_tree t
)
2775 #ifdef ENABLE_TREE_CHECKING
2783 #ifdef ENABLE_TREE_CHECKING
2786 gcc_assert (p
!= q
);
2794 /* Returns the first FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
2795 UNION_TYPE TYPE, or NULL_TREE if none. */
2798 first_field (const_tree type
)
2800 tree t
= TYPE_FIELDS (type
);
2801 while (t
&& TREE_CODE (t
) != FIELD_DECL
)
2806 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
2807 by modifying the last node in chain 1 to point to chain 2.
2808 This is the Lisp primitive `nconc'. */
2811 chainon (tree op1
, tree op2
)
2820 for (t1
= op1
; TREE_CHAIN (t1
); t1
= TREE_CHAIN (t1
))
2822 TREE_CHAIN (t1
) = op2
;
2824 #ifdef ENABLE_TREE_CHECKING
2827 for (t2
= op2
; t2
; t2
= TREE_CHAIN (t2
))
2828 gcc_assert (t2
!= t1
);
2835 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
2838 tree_last (tree chain
)
2842 while ((next
= TREE_CHAIN (chain
)))
2847 /* Reverse the order of elements in the chain T,
2848 and return the new head of the chain (old last element). */
2853 tree prev
= 0, decl
, next
;
2854 for (decl
= t
; decl
; decl
= next
)
2856 /* We shouldn't be using this function to reverse BLOCK chains; we
2857 have blocks_nreverse for that. */
2858 gcc_checking_assert (TREE_CODE (decl
) != BLOCK
);
2859 next
= TREE_CHAIN (decl
);
2860 TREE_CHAIN (decl
) = prev
;
2866 /* Return a newly created TREE_LIST node whose
2867 purpose and value fields are PARM and VALUE. */
2870 build_tree_list_stat (tree parm
, tree value MEM_STAT_DECL
)
2872 tree t
= make_node_stat (TREE_LIST PASS_MEM_STAT
);
2873 TREE_PURPOSE (t
) = parm
;
2874 TREE_VALUE (t
) = value
;
2878 /* Build a chain of TREE_LIST nodes from a vector. */
2881 build_tree_list_vec_stat (const vec
<tree
, va_gc
> *vec MEM_STAT_DECL
)
2883 tree ret
= NULL_TREE
;
2887 FOR_EACH_VEC_SAFE_ELT (vec
, i
, t
)
2889 *pp
= build_tree_list_stat (NULL
, t PASS_MEM_STAT
);
2890 pp
= &TREE_CHAIN (*pp
);
2895 /* Return a newly created TREE_LIST node whose
2896 purpose and value fields are PURPOSE and VALUE
2897 and whose TREE_CHAIN is CHAIN. */
2900 tree_cons_stat (tree purpose
, tree value
, tree chain MEM_STAT_DECL
)
2904 node
= ggc_alloc_tree_node_stat (sizeof (struct tree_list
) PASS_MEM_STAT
);
2905 memset (node
, 0, sizeof (struct tree_common
));
2907 record_node_allocation_statistics (TREE_LIST
, sizeof (struct tree_list
));
2909 TREE_SET_CODE (node
, TREE_LIST
);
2910 TREE_CHAIN (node
) = chain
;
2911 TREE_PURPOSE (node
) = purpose
;
2912 TREE_VALUE (node
) = value
;
2916 /* Return the values of the elements of a CONSTRUCTOR as a vector of
2920 ctor_to_vec (tree ctor
)
2922 vec
<tree
, va_gc
> *vec
;
2923 vec_alloc (vec
, CONSTRUCTOR_NELTS (ctor
));
2927 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), ix
, val
)
2928 vec
->quick_push (val
);
2933 /* Return the size nominally occupied by an object of type TYPE
2934 when it resides in memory. The value is measured in units of bytes,
2935 and its data type is that normally used for type sizes
2936 (which is the first type created by make_signed_type or
2937 make_unsigned_type). */
2940 size_in_bytes_loc (location_t loc
, const_tree type
)
2944 if (type
== error_mark_node
)
2945 return integer_zero_node
;
2947 type
= TYPE_MAIN_VARIANT (type
);
2948 t
= TYPE_SIZE_UNIT (type
);
2952 lang_hooks
.types
.incomplete_type_error (loc
, NULL_TREE
, type
);
2953 return size_zero_node
;
2959 /* Return the size of TYPE (in bytes) as a wide integer
2960 or return -1 if the size can vary or is larger than an integer. */
2963 int_size_in_bytes (const_tree type
)
2967 if (type
== error_mark_node
)
2970 type
= TYPE_MAIN_VARIANT (type
);
2971 t
= TYPE_SIZE_UNIT (type
);
2973 if (t
&& tree_fits_uhwi_p (t
))
2974 return TREE_INT_CST_LOW (t
);
2979 /* Return the maximum size of TYPE (in bytes) as a wide integer
2980 or return -1 if the size can vary or is larger than an integer. */
2983 max_int_size_in_bytes (const_tree type
)
2985 HOST_WIDE_INT size
= -1;
2988 /* If this is an array type, check for a possible MAX_SIZE attached. */
2990 if (TREE_CODE (type
) == ARRAY_TYPE
)
2992 size_tree
= TYPE_ARRAY_MAX_SIZE (type
);
2994 if (size_tree
&& tree_fits_uhwi_p (size_tree
))
2995 size
= tree_to_uhwi (size_tree
);
2998 /* If we still haven't been able to get a size, see if the language
2999 can compute a maximum size. */
3003 size_tree
= lang_hooks
.types
.max_size (type
);
3005 if (size_tree
&& tree_fits_uhwi_p (size_tree
))
3006 size
= tree_to_uhwi (size_tree
);
3012 /* Return the bit position of FIELD, in bits from the start of the record.
3013 This is a tree of type bitsizetype. */
3016 bit_position (const_tree field
)
3018 return bit_from_pos (DECL_FIELD_OFFSET (field
),
3019 DECL_FIELD_BIT_OFFSET (field
));
3022 /* Return the byte position of FIELD, in bytes from the start of the record.
3023 This is a tree of type sizetype. */
3026 byte_position (const_tree field
)
3028 return byte_from_pos (DECL_FIELD_OFFSET (field
),
3029 DECL_FIELD_BIT_OFFSET (field
));
3032 /* Likewise, but return as an integer. It must be representable in
3033 that way (since it could be a signed value, we don't have the
3034 option of returning -1 like int_size_in_byte can. */
3037 int_byte_position (const_tree field
)
3039 return tree_to_shwi (byte_position (field
));
3042 /* Return the strictest alignment, in bits, that T is known to have. */
3045 expr_align (const_tree t
)
3047 unsigned int align0
, align1
;
3049 switch (TREE_CODE (t
))
3051 CASE_CONVERT
: case NON_LVALUE_EXPR
:
3052 /* If we have conversions, we know that the alignment of the
3053 object must meet each of the alignments of the types. */
3054 align0
= expr_align (TREE_OPERAND (t
, 0));
3055 align1
= TYPE_ALIGN (TREE_TYPE (t
));
3056 return MAX (align0
, align1
);
3058 case SAVE_EXPR
: case COMPOUND_EXPR
: case MODIFY_EXPR
:
3059 case INIT_EXPR
: case TARGET_EXPR
: case WITH_CLEANUP_EXPR
:
3060 case CLEANUP_POINT_EXPR
:
3061 /* These don't change the alignment of an object. */
3062 return expr_align (TREE_OPERAND (t
, 0));
3065 /* The best we can do is say that the alignment is the least aligned
3067 align0
= expr_align (TREE_OPERAND (t
, 1));
3068 align1
= expr_align (TREE_OPERAND (t
, 2));
3069 return MIN (align0
, align1
);
3071 /* FIXME: LABEL_DECL and CONST_DECL never have DECL_ALIGN set
3072 meaningfully, it's always 1. */
3073 case LABEL_DECL
: case CONST_DECL
:
3074 case VAR_DECL
: case PARM_DECL
: case RESULT_DECL
:
3076 gcc_assert (DECL_ALIGN (t
) != 0);
3077 return DECL_ALIGN (t
);
3083 /* Otherwise take the alignment from that of the type. */
3084 return TYPE_ALIGN (TREE_TYPE (t
));
3087 /* Return, as a tree node, the number of elements for TYPE (which is an
3088 ARRAY_TYPE) minus one. This counts only elements of the top array. */
3091 array_type_nelts (const_tree type
)
3093 tree index_type
, min
, max
;
3095 /* If they did it with unspecified bounds, then we should have already
3096 given an error about it before we got here. */
3097 if (! TYPE_DOMAIN (type
))
3098 return error_mark_node
;
3100 index_type
= TYPE_DOMAIN (type
);
3101 min
= TYPE_MIN_VALUE (index_type
);
3102 max
= TYPE_MAX_VALUE (index_type
);
3104 /* TYPE_MAX_VALUE may not be set if the array has unknown length. */
3106 return error_mark_node
;
3108 return (integer_zerop (min
)
3110 : fold_build2 (MINUS_EXPR
, TREE_TYPE (max
), max
, min
));
3113 /* If arg is static -- a reference to an object in static storage -- then
3114 return the object. This is not the same as the C meaning of `static'.
3115 If arg isn't static, return NULL. */
3120 switch (TREE_CODE (arg
))
3123 /* Nested functions are static, even though taking their address will
3124 involve a trampoline as we unnest the nested function and create
3125 the trampoline on the tree level. */
3129 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
3130 && ! DECL_THREAD_LOCAL_P (arg
)
3131 && ! DECL_DLLIMPORT_P (arg
)
3135 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
3139 return TREE_STATIC (arg
) ? arg
: NULL
;
3146 /* If the thing being referenced is not a field, then it is
3147 something language specific. */
3148 gcc_assert (TREE_CODE (TREE_OPERAND (arg
, 1)) == FIELD_DECL
);
3150 /* If we are referencing a bitfield, we can't evaluate an
3151 ADDR_EXPR at compile time and so it isn't a constant. */
3152 if (DECL_BIT_FIELD (TREE_OPERAND (arg
, 1)))
3155 return staticp (TREE_OPERAND (arg
, 0));
3161 return TREE_CONSTANT (TREE_OPERAND (arg
, 0)) ? arg
: NULL
;
3164 case ARRAY_RANGE_REF
:
3165 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg
))) == INTEGER_CST
3166 && TREE_CODE (TREE_OPERAND (arg
, 1)) == INTEGER_CST
)
3167 return staticp (TREE_OPERAND (arg
, 0));
3171 case COMPOUND_LITERAL_EXPR
:
3172 return TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (arg
)) ? arg
: NULL
;
3182 /* Return whether OP is a DECL whose address is function-invariant. */
3185 decl_address_invariant_p (const_tree op
)
3187 /* The conditions below are slightly less strict than the one in
3190 switch (TREE_CODE (op
))
3199 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
3200 || DECL_THREAD_LOCAL_P (op
)
3201 || DECL_CONTEXT (op
) == current_function_decl
3202 || decl_function_context (op
) == current_function_decl
)
3207 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
3208 || decl_function_context (op
) == current_function_decl
)
3219 /* Return whether OP is a DECL whose address is interprocedural-invariant. */
3222 decl_address_ip_invariant_p (const_tree op
)
3224 /* The conditions below are slightly less strict than the one in
3227 switch (TREE_CODE (op
))
3235 if (((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
3236 && !DECL_DLLIMPORT_P (op
))
3237 || DECL_THREAD_LOCAL_P (op
))
3242 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
)))
3254 /* Return true if T is function-invariant (internal function, does
3255 not handle arithmetic; that's handled in skip_simple_arithmetic and
3256 tree_invariant_p). */
3259 tree_invariant_p_1 (tree t
)
3263 if (TREE_CONSTANT (t
)
3264 || (TREE_READONLY (t
) && !TREE_SIDE_EFFECTS (t
)))
3267 switch (TREE_CODE (t
))
3273 op
= TREE_OPERAND (t
, 0);
3274 while (handled_component_p (op
))
3276 switch (TREE_CODE (op
))
3279 case ARRAY_RANGE_REF
:
3280 if (!tree_invariant_p (TREE_OPERAND (op
, 1))
3281 || TREE_OPERAND (op
, 2) != NULL_TREE
3282 || TREE_OPERAND (op
, 3) != NULL_TREE
)
3287 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
3293 op
= TREE_OPERAND (op
, 0);
3296 return CONSTANT_CLASS_P (op
) || decl_address_invariant_p (op
);
3305 /* Return true if T is function-invariant. */
3308 tree_invariant_p (tree t
)
3310 tree inner
= skip_simple_arithmetic (t
);
3311 return tree_invariant_p_1 (inner
);
3314 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
3315 Do this to any expression which may be used in more than one place,
3316 but must be evaluated only once.
3318 Normally, expand_expr would reevaluate the expression each time.
3319 Calling save_expr produces something that is evaluated and recorded
3320 the first time expand_expr is called on it. Subsequent calls to
3321 expand_expr just reuse the recorded value.
3323 The call to expand_expr that generates code that actually computes
3324 the value is the first call *at compile time*. Subsequent calls
3325 *at compile time* generate code to use the saved value.
3326 This produces correct result provided that *at run time* control
3327 always flows through the insns made by the first expand_expr
3328 before reaching the other places where the save_expr was evaluated.
3329 You, the caller of save_expr, must make sure this is so.
3331 Constants, and certain read-only nodes, are returned with no
3332 SAVE_EXPR because that is safe. Expressions containing placeholders
3333 are not touched; see tree.def for an explanation of what these
3337 save_expr (tree expr
)
3339 tree t
= fold (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 (t
);
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 T 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 t
= build1 (SAVE_EXPR
, TREE_TYPE (expr
), t
);
3367 SET_EXPR_LOCATION (t
, EXPR_LOCATION (expr
));
3369 /* This expression might be placed ahead of a jump to ensure that the
3370 value was computed on both sides of the jump. So make sure it isn't
3371 eliminated as dead. */
3372 TREE_SIDE_EFFECTS (t
) = 1;
3376 /* Look inside EXPR into any simple arithmetic operations. Return the
3377 outermost non-arithmetic or non-invariant node. */
3380 skip_simple_arithmetic (tree expr
)
3382 /* We don't care about whether this can be used as an lvalue in this
3384 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
3385 expr
= TREE_OPERAND (expr
, 0);
3387 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
3388 a constant, it will be more efficient to not make another SAVE_EXPR since
3389 it will allow better simplification and GCSE will be able to merge the
3390 computations if they actually occur. */
3393 if (UNARY_CLASS_P (expr
))
3394 expr
= TREE_OPERAND (expr
, 0);
3395 else if (BINARY_CLASS_P (expr
))
3397 if (tree_invariant_p (TREE_OPERAND (expr
, 1)))
3398 expr
= TREE_OPERAND (expr
, 0);
3399 else if (tree_invariant_p (TREE_OPERAND (expr
, 0)))
3400 expr
= TREE_OPERAND (expr
, 1);
3411 /* Look inside EXPR into simple arithmetic operations involving constants.
3412 Return the outermost non-arithmetic or non-constant node. */
3415 skip_simple_constant_arithmetic (tree expr
)
3417 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
3418 expr
= TREE_OPERAND (expr
, 0);
3422 if (UNARY_CLASS_P (expr
))
3423 expr
= TREE_OPERAND (expr
, 0);
3424 else if (BINARY_CLASS_P (expr
))
3426 if (TREE_CONSTANT (TREE_OPERAND (expr
, 1)))
3427 expr
= TREE_OPERAND (expr
, 0);
3428 else if (TREE_CONSTANT (TREE_OPERAND (expr
, 0)))
3429 expr
= TREE_OPERAND (expr
, 1);
3440 /* Return which tree structure is used by T. */
3442 enum tree_node_structure_enum
3443 tree_node_structure (const_tree t
)
3445 const enum tree_code code
= TREE_CODE (t
);
3446 return tree_node_structure_for_code (code
);
3449 /* Set various status flags when building a CALL_EXPR object T. */
3452 process_call_operands (tree t
)
3454 bool side_effects
= TREE_SIDE_EFFECTS (t
);
3455 bool read_only
= false;
3456 int i
= call_expr_flags (t
);
3458 /* Calls have side-effects, except those to const or pure functions. */
3459 if ((i
& ECF_LOOPING_CONST_OR_PURE
) || !(i
& (ECF_CONST
| ECF_PURE
)))
3460 side_effects
= true;
3461 /* Propagate TREE_READONLY of arguments for const functions. */
3465 if (!side_effects
|| read_only
)
3466 for (i
= 1; i
< TREE_OPERAND_LENGTH (t
); i
++)
3468 tree op
= TREE_OPERAND (t
, i
);
3469 if (op
&& TREE_SIDE_EFFECTS (op
))
3470 side_effects
= true;
3471 if (op
&& !TREE_READONLY (op
) && !CONSTANT_CLASS_P (op
))
3475 TREE_SIDE_EFFECTS (t
) = side_effects
;
3476 TREE_READONLY (t
) = read_only
;
3479 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
3480 size or offset that depends on a field within a record. */
3483 contains_placeholder_p (const_tree exp
)
3485 enum tree_code code
;
3490 code
= TREE_CODE (exp
);
3491 if (code
== PLACEHOLDER_EXPR
)
3494 switch (TREE_CODE_CLASS (code
))
3497 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
3498 position computations since they will be converted into a
3499 WITH_RECORD_EXPR involving the reference, which will assume
3500 here will be valid. */
3501 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
3503 case tcc_exceptional
:
3504 if (code
== TREE_LIST
)
3505 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp
))
3506 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp
)));
3511 case tcc_comparison
:
3512 case tcc_expression
:
3516 /* Ignoring the first operand isn't quite right, but works best. */
3517 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1));
3520 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
3521 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1))
3522 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 2)));
3525 /* The save_expr function never wraps anything containing
3526 a PLACEHOLDER_EXPR. */
3533 switch (TREE_CODE_LENGTH (code
))
3536 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
3538 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
3539 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1)));
3550 const_call_expr_arg_iterator iter
;
3551 FOR_EACH_CONST_CALL_EXPR_ARG (arg
, iter
, exp
)
3552 if (CONTAINS_PLACEHOLDER_P (arg
))
3566 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
3567 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
3571 type_contains_placeholder_1 (const_tree type
)
3573 /* If the size contains a placeholder or the parent type (component type in
3574 the case of arrays) type involves a placeholder, this type does. */
3575 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type
))
3576 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type
))
3577 || (!POINTER_TYPE_P (type
)
3579 && type_contains_placeholder_p (TREE_TYPE (type
))))
3582 /* Now do type-specific checks. Note that the last part of the check above
3583 greatly limits what we have to do below. */
3584 switch (TREE_CODE (type
))
3587 case POINTER_BOUNDS_TYPE
:
3593 case REFERENCE_TYPE
:
3602 case FIXED_POINT_TYPE
:
3603 /* Here we just check the bounds. */
3604 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type
))
3605 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type
)));
3608 /* We have already checked the component type above, so just check
3609 the domain type. Flexible array members have a null domain. */
3610 return TYPE_DOMAIN (type
) ?
3611 type_contains_placeholder_p (TYPE_DOMAIN (type
)) : false;
3615 case QUAL_UNION_TYPE
:
3619 for (field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
3620 if (TREE_CODE (field
) == FIELD_DECL
3621 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field
))
3622 || (TREE_CODE (type
) == QUAL_UNION_TYPE
3623 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field
)))
3624 || type_contains_placeholder_p (TREE_TYPE (field
))))
3635 /* Wrapper around above function used to cache its result. */
3638 type_contains_placeholder_p (tree type
)
3642 /* If the contains_placeholder_bits field has been initialized,
3643 then we know the answer. */
3644 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) > 0)
3645 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) - 1;
3647 /* Indicate that we've seen this type node, and the answer is false.
3648 This is what we want to return if we run into recursion via fields. */
3649 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = 1;
3651 /* Compute the real value. */
3652 result
= type_contains_placeholder_1 (type
);
3654 /* Store the real value. */
3655 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = result
+ 1;
3660 /* Push tree EXP onto vector QUEUE if it is not already present. */
3663 push_without_duplicates (tree exp
, vec
<tree
> *queue
)
3668 FOR_EACH_VEC_ELT (*queue
, i
, iter
)
3669 if (simple_cst_equal (iter
, exp
) == 1)
3673 queue
->safe_push (exp
);
3676 /* Given a tree EXP, find all occurrences of references to fields
3677 in a PLACEHOLDER_EXPR and place them in vector REFS without
3678 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
3679 we assume here that EXP contains only arithmetic expressions
3680 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
3684 find_placeholder_in_expr (tree exp
, vec
<tree
> *refs
)
3686 enum tree_code code
= TREE_CODE (exp
);
3690 /* We handle TREE_LIST and COMPONENT_REF separately. */
3691 if (code
== TREE_LIST
)
3693 FIND_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), refs
);
3694 FIND_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), refs
);
3696 else if (code
== COMPONENT_REF
)
3698 for (inner
= TREE_OPERAND (exp
, 0);
3699 REFERENCE_CLASS_P (inner
);
3700 inner
= TREE_OPERAND (inner
, 0))
3703 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
)
3704 push_without_duplicates (exp
, refs
);
3706 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), refs
);
3709 switch (TREE_CODE_CLASS (code
))
3714 case tcc_declaration
:
3715 /* Variables allocated to static storage can stay. */
3716 if (!TREE_STATIC (exp
))
3717 push_without_duplicates (exp
, refs
);
3720 case tcc_expression
:
3721 /* This is the pattern built in ada/make_aligning_type. */
3722 if (code
== ADDR_EXPR
3723 && TREE_CODE (TREE_OPERAND (exp
, 0)) == PLACEHOLDER_EXPR
)
3725 push_without_duplicates (exp
, refs
);
3729 /* Fall through... */
3731 case tcc_exceptional
:
3734 case tcc_comparison
:
3736 for (i
= 0; i
< TREE_CODE_LENGTH (code
); i
++)
3737 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
3741 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3742 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
3750 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
3751 return a tree with all occurrences of references to F in a
3752 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
3753 CONST_DECLs. Note that we assume here that EXP contains only
3754 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
3755 occurring only in their argument list. */
3758 substitute_in_expr (tree exp
, tree f
, tree r
)
3760 enum tree_code code
= TREE_CODE (exp
);
3761 tree op0
, op1
, op2
, op3
;
3764 /* We handle TREE_LIST and COMPONENT_REF separately. */
3765 if (code
== TREE_LIST
)
3767 op0
= SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp
), f
, r
);
3768 op1
= SUBSTITUTE_IN_EXPR (TREE_VALUE (exp
), f
, r
);
3769 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
3772 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
3774 else if (code
== COMPONENT_REF
)
3778 /* If this expression is getting a value from a PLACEHOLDER_EXPR
3779 and it is the right field, replace it with R. */
3780 for (inner
= TREE_OPERAND (exp
, 0);
3781 REFERENCE_CLASS_P (inner
);
3782 inner
= TREE_OPERAND (inner
, 0))
3786 op1
= TREE_OPERAND (exp
, 1);
3788 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& op1
== f
)
3791 /* If this expression hasn't been completed let, leave it alone. */
3792 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& !TREE_TYPE (inner
))
3795 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3796 if (op0
== TREE_OPERAND (exp
, 0))
3800 = fold_build3 (COMPONENT_REF
, TREE_TYPE (exp
), op0
, op1
, NULL_TREE
);
3803 switch (TREE_CODE_CLASS (code
))
3808 case tcc_declaration
:
3814 case tcc_expression
:
3818 /* Fall through... */
3820 case tcc_exceptional
:
3823 case tcc_comparison
:
3825 switch (TREE_CODE_LENGTH (code
))
3831 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3832 if (op0
== TREE_OPERAND (exp
, 0))
3835 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
3839 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3840 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3842 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
3845 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
3849 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3850 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3851 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
3853 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3854 && op2
== TREE_OPERAND (exp
, 2))
3857 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
3861 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3862 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3863 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
3864 op3
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 3), f
, r
);
3866 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3867 && op2
== TREE_OPERAND (exp
, 2)
3868 && op3
== TREE_OPERAND (exp
, 3))
3872 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
3884 new_tree
= NULL_TREE
;
3886 /* If we are trying to replace F with a constant, 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 (CONSTANT_CLASS_P (r
) && code
== CALL_EXPR
)
3892 tree t
= maybe_inline_call_in_expr (exp
);
3894 return SUBSTITUTE_IN_EXPR (t
, f
, r
);
3897 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3899 tree op
= TREE_OPERAND (exp
, i
);
3900 tree new_op
= SUBSTITUTE_IN_EXPR (op
, f
, r
);
3904 new_tree
= copy_node (exp
);
3905 TREE_OPERAND (new_tree
, i
) = new_op
;
3911 new_tree
= fold (new_tree
);
3912 if (TREE_CODE (new_tree
) == CALL_EXPR
)
3913 process_call_operands (new_tree
);
3924 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
3926 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
3927 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
3932 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
3933 for it within OBJ, a tree that is an object or a chain of references. */
3936 substitute_placeholder_in_expr (tree exp
, tree obj
)
3938 enum tree_code code
= TREE_CODE (exp
);
3939 tree op0
, op1
, op2
, op3
;
3942 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
3943 in the chain of OBJ. */
3944 if (code
== PLACEHOLDER_EXPR
)
3946 tree need_type
= TYPE_MAIN_VARIANT (TREE_TYPE (exp
));
3949 for (elt
= obj
; elt
!= 0;
3950 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
3951 || TREE_CODE (elt
) == COND_EXPR
)
3952 ? TREE_OPERAND (elt
, 1)
3953 : (REFERENCE_CLASS_P (elt
)
3954 || UNARY_CLASS_P (elt
)
3955 || BINARY_CLASS_P (elt
)
3956 || VL_EXP_CLASS_P (elt
)
3957 || EXPRESSION_CLASS_P (elt
))
3958 ? TREE_OPERAND (elt
, 0) : 0))
3959 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt
)) == need_type
)
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 (POINTER_TYPE_P (TREE_TYPE (elt
))
3973 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt
)))
3975 return fold_build1 (INDIRECT_REF
, need_type
, elt
);
3977 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
3978 survives until RTL generation, there will be an error. */
3982 /* TREE_LIST is special because we need to look at TREE_VALUE
3983 and TREE_CHAIN, not TREE_OPERANDS. */
3984 else if (code
== TREE_LIST
)
3986 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), obj
);
3987 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), obj
);
3988 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
3991 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
3994 switch (TREE_CODE_CLASS (code
))
3997 case tcc_declaration
:
4000 case tcc_exceptional
:
4003 case tcc_comparison
:
4004 case tcc_expression
:
4007 switch (TREE_CODE_LENGTH (code
))
4013 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
4014 if (op0
== TREE_OPERAND (exp
, 0))
4017 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
4021 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
4022 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
4024 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
4027 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
4031 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
4032 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
4033 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
4035 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
4036 && op2
== TREE_OPERAND (exp
, 2))
4039 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
4043 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
4044 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
4045 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
4046 op3
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 3), obj
);
4048 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
4049 && op2
== TREE_OPERAND (exp
, 2)
4050 && op3
== TREE_OPERAND (exp
, 3))
4054 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
4066 new_tree
= NULL_TREE
;
4068 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
4070 tree op
= TREE_OPERAND (exp
, i
);
4071 tree new_op
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (op
, obj
);
4075 new_tree
= copy_node (exp
);
4076 TREE_OPERAND (new_tree
, i
) = new_op
;
4082 new_tree
= fold (new_tree
);
4083 if (TREE_CODE (new_tree
) == CALL_EXPR
)
4084 process_call_operands (new_tree
);
4095 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
4097 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
4098 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
4104 /* Subroutine of stabilize_reference; this is called for subtrees of
4105 references. Any expression with side-effects must be put in a SAVE_EXPR
4106 to ensure that it is only evaluated once.
4108 We don't put SAVE_EXPR nodes around everything, because assigning very
4109 simple expressions to temporaries causes us to miss good opportunities
4110 for optimizations. Among other things, the opportunity to fold in the
4111 addition of a constant into an addressing mode often gets lost, e.g.
4112 "y[i+1] += x;". In general, we take the approach that we should not make
4113 an assignment unless we are forced into it - i.e., that any non-side effect
4114 operator should be allowed, and that cse should take care of coalescing
4115 multiple utterances of the same expression should that prove fruitful. */
4118 stabilize_reference_1 (tree e
)
4121 enum tree_code code
= TREE_CODE (e
);
4123 /* We cannot ignore const expressions because it might be a reference
4124 to a const array but whose index contains side-effects. But we can
4125 ignore things that are actual constant or that already have been
4126 handled by this function. */
4128 if (tree_invariant_p (e
))
4131 switch (TREE_CODE_CLASS (code
))
4133 case tcc_exceptional
:
4135 case tcc_declaration
:
4136 case tcc_comparison
:
4138 case tcc_expression
:
4141 /* If the expression has side-effects, then encase it in a SAVE_EXPR
4142 so that it will only be evaluated once. */
4143 /* The reference (r) and comparison (<) classes could be handled as
4144 below, but it is generally faster to only evaluate them once. */
4145 if (TREE_SIDE_EFFECTS (e
))
4146 return save_expr (e
);
4150 /* Constants need no processing. In fact, we should never reach
4155 /* Division is slow and tends to be compiled with jumps,
4156 especially the division by powers of 2 that is often
4157 found inside of an array reference. So do it just once. */
4158 if (code
== TRUNC_DIV_EXPR
|| code
== TRUNC_MOD_EXPR
4159 || code
== FLOOR_DIV_EXPR
|| code
== FLOOR_MOD_EXPR
4160 || code
== CEIL_DIV_EXPR
|| code
== CEIL_MOD_EXPR
4161 || code
== ROUND_DIV_EXPR
|| code
== ROUND_MOD_EXPR
)
4162 return save_expr (e
);
4163 /* Recursively stabilize each operand. */
4164 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)),
4165 stabilize_reference_1 (TREE_OPERAND (e
, 1)));
4169 /* Recursively stabilize each operand. */
4170 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)));
4177 TREE_TYPE (result
) = TREE_TYPE (e
);
4178 TREE_READONLY (result
) = TREE_READONLY (e
);
4179 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (e
);
4180 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (e
);
4185 /* Stabilize a reference so that we can use it any number of times
4186 without causing its operands to be evaluated more than once.
4187 Returns the stabilized reference. This works by means of save_expr,
4188 so see the caveats in the comments about save_expr.
4190 Also allows conversion expressions whose operands are references.
4191 Any other kind of expression is returned unchanged. */
4194 stabilize_reference (tree ref
)
4197 enum tree_code code
= TREE_CODE (ref
);
4204 /* No action is needed in this case. */
4209 case FIX_TRUNC_EXPR
:
4210 result
= build_nt (code
, stabilize_reference (TREE_OPERAND (ref
, 0)));
4214 result
= build_nt (INDIRECT_REF
,
4215 stabilize_reference_1 (TREE_OPERAND (ref
, 0)));
4219 result
= build_nt (COMPONENT_REF
,
4220 stabilize_reference (TREE_OPERAND (ref
, 0)),
4221 TREE_OPERAND (ref
, 1), NULL_TREE
);
4225 result
= build_nt (BIT_FIELD_REF
,
4226 stabilize_reference (TREE_OPERAND (ref
, 0)),
4227 TREE_OPERAND (ref
, 1), TREE_OPERAND (ref
, 2));
4228 REF_REVERSE_STORAGE_ORDER (result
) = REF_REVERSE_STORAGE_ORDER (ref
);
4232 result
= build_nt (ARRAY_REF
,
4233 stabilize_reference (TREE_OPERAND (ref
, 0)),
4234 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
4235 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
4238 case ARRAY_RANGE_REF
:
4239 result
= build_nt (ARRAY_RANGE_REF
,
4240 stabilize_reference (TREE_OPERAND (ref
, 0)),
4241 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
4242 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
4246 /* We cannot wrap the first expression in a SAVE_EXPR, as then
4247 it wouldn't be ignored. This matters when dealing with
4249 return stabilize_reference_1 (ref
);
4251 /* If arg isn't a kind of lvalue we recognize, make no change.
4252 Caller should recognize the error for an invalid lvalue. */
4257 return error_mark_node
;
4260 TREE_TYPE (result
) = TREE_TYPE (ref
);
4261 TREE_READONLY (result
) = TREE_READONLY (ref
);
4262 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (ref
);
4263 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (ref
);
4268 /* Low-level constructors for expressions. */
4270 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
4271 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
4274 recompute_tree_invariant_for_addr_expr (tree t
)
4277 bool tc
= true, se
= false;
4279 gcc_assert (TREE_CODE (t
) == ADDR_EXPR
);
4281 /* We started out assuming this address is both invariant and constant, but
4282 does not have side effects. Now go down any handled components and see if
4283 any of them involve offsets that are either non-constant or non-invariant.
4284 Also check for side-effects.
4286 ??? Note that this code makes no attempt to deal with the case where
4287 taking the address of something causes a copy due to misalignment. */
4289 #define UPDATE_FLAGS(NODE) \
4290 do { tree _node = (NODE); \
4291 if (_node && !TREE_CONSTANT (_node)) tc = false; \
4292 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
4294 for (node
= TREE_OPERAND (t
, 0); handled_component_p (node
);
4295 node
= TREE_OPERAND (node
, 0))
4297 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
4298 array reference (probably made temporarily by the G++ front end),
4299 so ignore all the operands. */
4300 if ((TREE_CODE (node
) == ARRAY_REF
4301 || TREE_CODE (node
) == ARRAY_RANGE_REF
)
4302 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node
, 0))) == ARRAY_TYPE
)
4304 UPDATE_FLAGS (TREE_OPERAND (node
, 1));
4305 if (TREE_OPERAND (node
, 2))
4306 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
4307 if (TREE_OPERAND (node
, 3))
4308 UPDATE_FLAGS (TREE_OPERAND (node
, 3));
4310 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
4311 FIELD_DECL, apparently. The G++ front end can put something else
4312 there, at least temporarily. */
4313 else if (TREE_CODE (node
) == COMPONENT_REF
4314 && TREE_CODE (TREE_OPERAND (node
, 1)) == FIELD_DECL
)
4316 if (TREE_OPERAND (node
, 2))
4317 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
4321 node
= lang_hooks
.expr_to_decl (node
, &tc
, &se
);
4323 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
4324 the address, since &(*a)->b is a form of addition. If it's a constant, the
4325 address is constant too. If it's a decl, its address is constant if the
4326 decl is static. Everything else is not constant and, furthermore,
4327 taking the address of a volatile variable is not volatile. */
4328 if (TREE_CODE (node
) == INDIRECT_REF
4329 || TREE_CODE (node
) == MEM_REF
)
4330 UPDATE_FLAGS (TREE_OPERAND (node
, 0));
4331 else if (CONSTANT_CLASS_P (node
))
4333 else if (DECL_P (node
))
4334 tc
&= (staticp (node
) != NULL_TREE
);
4338 se
|= TREE_SIDE_EFFECTS (node
);
4342 TREE_CONSTANT (t
) = tc
;
4343 TREE_SIDE_EFFECTS (t
) = se
;
4347 /* Build an expression of code CODE, data type TYPE, and operands as
4348 specified. Expressions and reference nodes can be created this way.
4349 Constants, decls, types and misc nodes cannot be.
4351 We define 5 non-variadic functions, from 0 to 4 arguments. This is
4352 enough for all extant tree codes. */
4355 build0_stat (enum tree_code code
, tree tt MEM_STAT_DECL
)
4359 gcc_assert (TREE_CODE_LENGTH (code
) == 0);
4361 t
= make_node_stat (code PASS_MEM_STAT
);
4368 build1_stat (enum tree_code code
, tree type
, tree node MEM_STAT_DECL
)
4370 int length
= sizeof (struct tree_exp
);
4373 record_node_allocation_statistics (code
, length
);
4375 gcc_assert (TREE_CODE_LENGTH (code
) == 1);
4377 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
4379 memset (t
, 0, sizeof (struct tree_common
));
4381 TREE_SET_CODE (t
, code
);
4383 TREE_TYPE (t
) = type
;
4384 SET_EXPR_LOCATION (t
, UNKNOWN_LOCATION
);
4385 TREE_OPERAND (t
, 0) = node
;
4386 if (node
&& !TYPE_P (node
))
4388 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (node
);
4389 TREE_READONLY (t
) = TREE_READONLY (node
);
4392 if (TREE_CODE_CLASS (code
) == tcc_statement
)
4393 TREE_SIDE_EFFECTS (t
) = 1;
4397 /* All of these have side-effects, no matter what their
4399 TREE_SIDE_EFFECTS (t
) = 1;
4400 TREE_READONLY (t
) = 0;
4404 /* Whether a dereference is readonly has nothing to do with whether
4405 its operand is readonly. */
4406 TREE_READONLY (t
) = 0;
4411 recompute_tree_invariant_for_addr_expr (t
);
4415 if ((TREE_CODE_CLASS (code
) == tcc_unary
|| code
== VIEW_CONVERT_EXPR
)
4416 && node
&& !TYPE_P (node
)
4417 && TREE_CONSTANT (node
))
4418 TREE_CONSTANT (t
) = 1;
4419 if (TREE_CODE_CLASS (code
) == tcc_reference
4420 && node
&& TREE_THIS_VOLATILE (node
))
4421 TREE_THIS_VOLATILE (t
) = 1;
4428 #define PROCESS_ARG(N) \
4430 TREE_OPERAND (t, N) = arg##N; \
4431 if (arg##N &&!TYPE_P (arg##N)) \
4433 if (TREE_SIDE_EFFECTS (arg##N)) \
4435 if (!TREE_READONLY (arg##N) \
4436 && !CONSTANT_CLASS_P (arg##N)) \
4437 (void) (read_only = 0); \
4438 if (!TREE_CONSTANT (arg##N)) \
4439 (void) (constant = 0); \
4444 build2_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1 MEM_STAT_DECL
)
4446 bool constant
, read_only
, side_effects
;
4449 gcc_assert (TREE_CODE_LENGTH (code
) == 2);
4451 if ((code
== MINUS_EXPR
|| code
== PLUS_EXPR
|| code
== MULT_EXPR
)
4452 && arg0
&& arg1
&& tt
&& POINTER_TYPE_P (tt
)
4453 /* When sizetype precision doesn't match that of pointers
4454 we need to be able to build explicit extensions or truncations
4455 of the offset argument. */
4456 && TYPE_PRECISION (sizetype
) == TYPE_PRECISION (tt
))
4457 gcc_assert (TREE_CODE (arg0
) == INTEGER_CST
4458 && TREE_CODE (arg1
) == INTEGER_CST
);
4460 if (code
== POINTER_PLUS_EXPR
&& arg0
&& arg1
&& tt
)
4461 gcc_assert (POINTER_TYPE_P (tt
) && POINTER_TYPE_P (TREE_TYPE (arg0
))
4462 && ptrofftype_p (TREE_TYPE (arg1
)));
4464 t
= make_node_stat (code PASS_MEM_STAT
);
4467 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
4468 result based on those same flags for the arguments. But if the
4469 arguments aren't really even `tree' expressions, we shouldn't be trying
4472 /* Expressions without side effects may be constant if their
4473 arguments are as well. */
4474 constant
= (TREE_CODE_CLASS (code
) == tcc_comparison
4475 || TREE_CODE_CLASS (code
) == tcc_binary
);
4477 side_effects
= TREE_SIDE_EFFECTS (t
);
4482 TREE_SIDE_EFFECTS (t
) = side_effects
;
4483 if (code
== MEM_REF
)
4485 if (arg0
&& TREE_CODE (arg0
) == ADDR_EXPR
)
4487 tree o
= TREE_OPERAND (arg0
, 0);
4488 TREE_READONLY (t
) = TREE_READONLY (o
);
4489 TREE_THIS_VOLATILE (t
) = TREE_THIS_VOLATILE (o
);
4494 TREE_READONLY (t
) = read_only
;
4495 TREE_CONSTANT (t
) = constant
;
4496 TREE_THIS_VOLATILE (t
)
4497 = (TREE_CODE_CLASS (code
) == tcc_reference
4498 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4506 build3_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4507 tree arg2 MEM_STAT_DECL
)
4509 bool constant
, read_only
, side_effects
;
4512 gcc_assert (TREE_CODE_LENGTH (code
) == 3);
4513 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
4515 t
= make_node_stat (code PASS_MEM_STAT
);
4520 /* As a special exception, if COND_EXPR has NULL branches, we
4521 assume that it is a gimple statement and always consider
4522 it to have side effects. */
4523 if (code
== COND_EXPR
4524 && tt
== void_type_node
4525 && arg1
== NULL_TREE
4526 && arg2
== NULL_TREE
)
4527 side_effects
= true;
4529 side_effects
= TREE_SIDE_EFFECTS (t
);
4535 if (code
== COND_EXPR
)
4536 TREE_READONLY (t
) = read_only
;
4538 TREE_SIDE_EFFECTS (t
) = side_effects
;
4539 TREE_THIS_VOLATILE (t
)
4540 = (TREE_CODE_CLASS (code
) == tcc_reference
4541 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4547 build4_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4548 tree arg2
, tree arg3 MEM_STAT_DECL
)
4550 bool constant
, read_only
, side_effects
;
4553 gcc_assert (TREE_CODE_LENGTH (code
) == 4);
4555 t
= make_node_stat (code PASS_MEM_STAT
);
4558 side_effects
= TREE_SIDE_EFFECTS (t
);
4565 TREE_SIDE_EFFECTS (t
) = side_effects
;
4566 TREE_THIS_VOLATILE (t
)
4567 = (TREE_CODE_CLASS (code
) == tcc_reference
4568 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4574 build5_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4575 tree arg2
, tree arg3
, tree arg4 MEM_STAT_DECL
)
4577 bool constant
, read_only
, side_effects
;
4580 gcc_assert (TREE_CODE_LENGTH (code
) == 5);
4582 t
= make_node_stat (code PASS_MEM_STAT
);
4585 side_effects
= TREE_SIDE_EFFECTS (t
);
4593 TREE_SIDE_EFFECTS (t
) = side_effects
;
4594 if (code
== TARGET_MEM_REF
)
4596 if (arg0
&& TREE_CODE (arg0
) == ADDR_EXPR
)
4598 tree o
= TREE_OPERAND (arg0
, 0);
4599 TREE_READONLY (t
) = TREE_READONLY (o
);
4600 TREE_THIS_VOLATILE (t
) = TREE_THIS_VOLATILE (o
);
4604 TREE_THIS_VOLATILE (t
)
4605 = (TREE_CODE_CLASS (code
) == tcc_reference
4606 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4611 /* Build a simple MEM_REF tree with the sematics of a plain INDIRECT_REF
4612 on the pointer PTR. */
4615 build_simple_mem_ref_loc (location_t loc
, tree ptr
)
4617 HOST_WIDE_INT offset
= 0;
4618 tree ptype
= TREE_TYPE (ptr
);
4620 /* For convenience allow addresses that collapse to a simple base
4622 if (TREE_CODE (ptr
) == ADDR_EXPR
4623 && (handled_component_p (TREE_OPERAND (ptr
, 0))
4624 || TREE_CODE (TREE_OPERAND (ptr
, 0)) == MEM_REF
))
4626 ptr
= get_addr_base_and_unit_offset (TREE_OPERAND (ptr
, 0), &offset
);
4628 ptr
= build_fold_addr_expr (ptr
);
4629 gcc_assert (is_gimple_reg (ptr
) || is_gimple_min_invariant (ptr
));
4631 tem
= build2 (MEM_REF
, TREE_TYPE (ptype
),
4632 ptr
, build_int_cst (ptype
, offset
));
4633 SET_EXPR_LOCATION (tem
, loc
);
4637 /* Return the constant offset of a MEM_REF or TARGET_MEM_REF tree T. */
4640 mem_ref_offset (const_tree t
)
4642 return offset_int::from (TREE_OPERAND (t
, 1), SIGNED
);
4645 /* Return an invariant ADDR_EXPR of type TYPE taking the address of BASE
4646 offsetted by OFFSET units. */
4649 build_invariant_address (tree type
, tree base
, HOST_WIDE_INT offset
)
4651 tree ref
= fold_build2 (MEM_REF
, TREE_TYPE (type
),
4652 build_fold_addr_expr (base
),
4653 build_int_cst (ptr_type_node
, offset
));
4654 tree addr
= build1 (ADDR_EXPR
, type
, ref
);
4655 recompute_tree_invariant_for_addr_expr (addr
);
4659 /* Similar except don't specify the TREE_TYPE
4660 and leave the TREE_SIDE_EFFECTS as 0.
4661 It is permissible for arguments to be null,
4662 or even garbage if their values do not matter. */
4665 build_nt (enum tree_code code
, ...)
4672 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
4676 t
= make_node (code
);
4677 length
= TREE_CODE_LENGTH (code
);
4679 for (i
= 0; i
< length
; i
++)
4680 TREE_OPERAND (t
, i
) = va_arg (p
, tree
);
4686 /* Similar to build_nt, but for creating a CALL_EXPR object with a
4690 build_nt_call_vec (tree fn
, vec
<tree
, va_gc
> *args
)
4695 ret
= build_vl_exp (CALL_EXPR
, vec_safe_length (args
) + 3);
4696 CALL_EXPR_FN (ret
) = fn
;
4697 CALL_EXPR_STATIC_CHAIN (ret
) = NULL_TREE
;
4698 FOR_EACH_VEC_SAFE_ELT (args
, ix
, t
)
4699 CALL_EXPR_ARG (ret
, ix
) = t
;
4703 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
4704 We do NOT enter this node in any sort of symbol table.
4706 LOC is the location of the decl.
4708 layout_decl is used to set up the decl's storage layout.
4709 Other slots are initialized to 0 or null pointers. */
4712 build_decl_stat (location_t loc
, enum tree_code code
, tree name
,
4713 tree type MEM_STAT_DECL
)
4717 t
= make_node_stat (code PASS_MEM_STAT
);
4718 DECL_SOURCE_LOCATION (t
) = loc
;
4720 /* if (type == error_mark_node)
4721 type = integer_type_node; */
4722 /* That is not done, deliberately, so that having error_mark_node
4723 as the type can suppress useless errors in the use of this variable. */
4725 DECL_NAME (t
) = name
;
4726 TREE_TYPE (t
) = type
;
4728 if (code
== VAR_DECL
|| code
== PARM_DECL
|| code
== RESULT_DECL
)
4734 /* Builds and returns function declaration with NAME and TYPE. */
4737 build_fn_decl (const char *name
, tree type
)
4739 tree id
= get_identifier (name
);
4740 tree decl
= build_decl (input_location
, FUNCTION_DECL
, id
, type
);
4742 DECL_EXTERNAL (decl
) = 1;
4743 TREE_PUBLIC (decl
) = 1;
4744 DECL_ARTIFICIAL (decl
) = 1;
4745 TREE_NOTHROW (decl
) = 1;
4750 vec
<tree
, va_gc
> *all_translation_units
;
4752 /* Builds a new translation-unit decl with name NAME, queues it in the
4753 global list of translation-unit decls and returns it. */
4756 build_translation_unit_decl (tree name
)
4758 tree tu
= build_decl (UNKNOWN_LOCATION
, TRANSLATION_UNIT_DECL
,
4760 TRANSLATION_UNIT_LANGUAGE (tu
) = lang_hooks
.name
;
4761 vec_safe_push (all_translation_units
, tu
);
4766 /* BLOCK nodes are used to represent the structure of binding contours
4767 and declarations, once those contours have been exited and their contents
4768 compiled. This information is used for outputting debugging info. */
4771 build_block (tree vars
, tree subblocks
, tree supercontext
, tree chain
)
4773 tree block
= make_node (BLOCK
);
4775 BLOCK_VARS (block
) = vars
;
4776 BLOCK_SUBBLOCKS (block
) = subblocks
;
4777 BLOCK_SUPERCONTEXT (block
) = supercontext
;
4778 BLOCK_CHAIN (block
) = chain
;
4783 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
4785 LOC is the location to use in tree T. */
4788 protected_set_expr_location (tree t
, location_t loc
)
4790 if (CAN_HAVE_LOCATION_P (t
))
4791 SET_EXPR_LOCATION (t
, loc
);
4794 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
4798 build_decl_attribute_variant (tree ddecl
, tree attribute
)
4800 DECL_ATTRIBUTES (ddecl
) = attribute
;
4804 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4805 is ATTRIBUTE and its qualifiers are QUALS.
4807 Record such modified types already made so we don't make duplicates. */
4810 build_type_attribute_qual_variant (tree ttype
, tree attribute
, int quals
)
4812 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype
), attribute
))
4814 inchash::hash hstate
;
4818 enum tree_code code
= TREE_CODE (ttype
);
4820 /* Building a distinct copy of a tagged type is inappropriate; it
4821 causes breakage in code that expects there to be a one-to-one
4822 relationship between a struct and its fields.
4823 build_duplicate_type is another solution (as used in
4824 handle_transparent_union_attribute), but that doesn't play well
4825 with the stronger C++ type identity model. */
4826 if (TREE_CODE (ttype
) == RECORD_TYPE
4827 || TREE_CODE (ttype
) == UNION_TYPE
4828 || TREE_CODE (ttype
) == QUAL_UNION_TYPE
4829 || TREE_CODE (ttype
) == ENUMERAL_TYPE
)
4831 warning (OPT_Wattributes
,
4832 "ignoring attributes applied to %qT after definition",
4833 TYPE_MAIN_VARIANT (ttype
));
4834 return build_qualified_type (ttype
, quals
);
4837 ttype
= build_qualified_type (ttype
, TYPE_UNQUALIFIED
);
4838 ntype
= build_distinct_type_copy (ttype
);
4840 TYPE_ATTRIBUTES (ntype
) = attribute
;
4842 hstate
.add_int (code
);
4843 if (TREE_TYPE (ntype
))
4844 hstate
.add_object (TYPE_HASH (TREE_TYPE (ntype
)));
4845 attribute_hash_list (attribute
, hstate
);
4847 switch (TREE_CODE (ntype
))
4850 type_hash_list (TYPE_ARG_TYPES (ntype
), hstate
);
4853 if (TYPE_DOMAIN (ntype
))
4854 hstate
.add_object (TYPE_HASH (TYPE_DOMAIN (ntype
)));
4857 t
= TYPE_MAX_VALUE (ntype
);
4858 for (i
= 0; i
< TREE_INT_CST_NUNITS (t
); i
++)
4859 hstate
.add_object (TREE_INT_CST_ELT (t
, i
));
4862 case FIXED_POINT_TYPE
:
4864 unsigned int precision
= TYPE_PRECISION (ntype
);
4865 hstate
.add_object (precision
);
4872 ntype
= type_hash_canon (hstate
.end(), ntype
);
4874 /* If the target-dependent attributes make NTYPE different from
4875 its canonical type, we will need to use structural equality
4876 checks for this type. */
4877 if (TYPE_STRUCTURAL_EQUALITY_P (ttype
)
4878 || !comp_type_attributes (ntype
, ttype
))
4879 SET_TYPE_STRUCTURAL_EQUALITY (ntype
);
4880 else if (TYPE_CANONICAL (ntype
) == ntype
)
4881 TYPE_CANONICAL (ntype
) = TYPE_CANONICAL (ttype
);
4883 ttype
= build_qualified_type (ntype
, quals
);
4885 else if (TYPE_QUALS (ttype
) != quals
)
4886 ttype
= build_qualified_type (ttype
, quals
);
4891 /* Check if "omp declare simd" attribute arguments, CLAUSES1 and CLAUSES2, are
4895 omp_declare_simd_clauses_equal (tree clauses1
, tree clauses2
)
4898 for (cl1
= clauses1
, cl2
= clauses2
;
4900 cl1
= OMP_CLAUSE_CHAIN (cl1
), cl2
= OMP_CLAUSE_CHAIN (cl2
))
4902 if (OMP_CLAUSE_CODE (cl1
) != OMP_CLAUSE_CODE (cl2
))
4904 if (OMP_CLAUSE_CODE (cl1
) != OMP_CLAUSE_SIMDLEN
)
4906 if (simple_cst_equal (OMP_CLAUSE_DECL (cl1
),
4907 OMP_CLAUSE_DECL (cl2
)) != 1)
4910 switch (OMP_CLAUSE_CODE (cl1
))
4912 case OMP_CLAUSE_ALIGNED
:
4913 if (simple_cst_equal (OMP_CLAUSE_ALIGNED_ALIGNMENT (cl1
),
4914 OMP_CLAUSE_ALIGNED_ALIGNMENT (cl2
)) != 1)
4917 case OMP_CLAUSE_LINEAR
:
4918 if (simple_cst_equal (OMP_CLAUSE_LINEAR_STEP (cl1
),
4919 OMP_CLAUSE_LINEAR_STEP (cl2
)) != 1)
4922 case OMP_CLAUSE_SIMDLEN
:
4923 if (simple_cst_equal (OMP_CLAUSE_SIMDLEN_EXPR (cl1
),
4924 OMP_CLAUSE_SIMDLEN_EXPR (cl2
)) != 1)
4933 /* Compare two constructor-element-type constants. Return 1 if the lists
4934 are known to be equal; otherwise return 0. */
4937 simple_cst_list_equal (const_tree l1
, const_tree l2
)
4939 while (l1
!= NULL_TREE
&& l2
!= NULL_TREE
)
4941 if (simple_cst_equal (TREE_VALUE (l1
), TREE_VALUE (l2
)) != 1)
4944 l1
= TREE_CHAIN (l1
);
4945 l2
= TREE_CHAIN (l2
);
4951 /* Compare two identifier nodes representing attributes. Either one may
4952 be in wrapped __ATTR__ form. Return true if they are the same, false
4956 cmp_attrib_identifiers (const_tree attr1
, const_tree attr2
)
4958 /* Make sure we're dealing with IDENTIFIER_NODEs. */
4959 gcc_checking_assert (TREE_CODE (attr1
) == IDENTIFIER_NODE
4960 && TREE_CODE (attr2
) == IDENTIFIER_NODE
);
4962 /* Identifiers can be compared directly for equality. */
4966 /* If they are not equal, they may still be one in the form
4967 'text' while the other one is in the form '__text__'. TODO:
4968 If we were storing attributes in normalized 'text' form, then
4969 this could all go away and we could take full advantage of
4970 the fact that we're comparing identifiers. :-) */
4971 const size_t attr1_len
= IDENTIFIER_LENGTH (attr1
);
4972 const size_t attr2_len
= IDENTIFIER_LENGTH (attr2
);
4974 if (attr2_len
== attr1_len
+ 4)
4976 const char *p
= IDENTIFIER_POINTER (attr2
);
4977 const char *q
= IDENTIFIER_POINTER (attr1
);
4978 if (p
[0] == '_' && p
[1] == '_'
4979 && p
[attr2_len
- 2] == '_' && p
[attr2_len
- 1] == '_'
4980 && strncmp (q
, p
+ 2, attr1_len
) == 0)
4983 else if (attr2_len
+ 4 == attr1_len
)
4985 const char *p
= IDENTIFIER_POINTER (attr2
);
4986 const char *q
= IDENTIFIER_POINTER (attr1
);
4987 if (q
[0] == '_' && q
[1] == '_'
4988 && q
[attr1_len
- 2] == '_' && q
[attr1_len
- 1] == '_'
4989 && strncmp (q
+ 2, p
, attr2_len
) == 0)
4996 /* Compare two attributes for their value identity. Return true if the
4997 attribute values are known to be equal; otherwise return false. */
5000 attribute_value_equal (const_tree attr1
, const_tree attr2
)
5002 if (TREE_VALUE (attr1
) == TREE_VALUE (attr2
))
5005 if (TREE_VALUE (attr1
) != NULL_TREE
5006 && TREE_CODE (TREE_VALUE (attr1
)) == TREE_LIST
5007 && TREE_VALUE (attr2
) != NULL_TREE
5008 && TREE_CODE (TREE_VALUE (attr2
)) == TREE_LIST
)
5010 /* Handle attribute format. */
5011 if (is_attribute_p ("format", TREE_PURPOSE (attr1
)))
5013 attr1
= TREE_VALUE (attr1
);
5014 attr2
= TREE_VALUE (attr2
);
5015 /* Compare the archetypes (printf/scanf/strftime/...). */
5016 if (!cmp_attrib_identifiers (TREE_VALUE (attr1
),
5017 TREE_VALUE (attr2
)))
5019 /* Archetypes are the same. Compare the rest. */
5020 return (simple_cst_list_equal (TREE_CHAIN (attr1
),
5021 TREE_CHAIN (attr2
)) == 1);
5023 return (simple_cst_list_equal (TREE_VALUE (attr1
),
5024 TREE_VALUE (attr2
)) == 1);
5027 if ((flag_openmp
|| flag_openmp_simd
)
5028 && TREE_VALUE (attr1
) && TREE_VALUE (attr2
)
5029 && TREE_CODE (TREE_VALUE (attr1
)) == OMP_CLAUSE
5030 && TREE_CODE (TREE_VALUE (attr2
)) == OMP_CLAUSE
)
5031 return omp_declare_simd_clauses_equal (TREE_VALUE (attr1
),
5032 TREE_VALUE (attr2
));
5034 return (simple_cst_equal (TREE_VALUE (attr1
), TREE_VALUE (attr2
)) == 1);
5037 /* Return 0 if the attributes for two types are incompatible, 1 if they
5038 are compatible, and 2 if they are nearly compatible (which causes a
5039 warning to be generated). */
5041 comp_type_attributes (const_tree type1
, const_tree type2
)
5043 const_tree a1
= TYPE_ATTRIBUTES (type1
);
5044 const_tree a2
= TYPE_ATTRIBUTES (type2
);
5049 for (a
= a1
; a
!= NULL_TREE
; a
= TREE_CHAIN (a
))
5051 const struct attribute_spec
*as
;
5054 as
= lookup_attribute_spec (get_attribute_name (a
));
5055 if (!as
|| as
->affects_type_identity
== false)
5058 attr
= lookup_attribute (as
->name
, CONST_CAST_TREE (a2
));
5059 if (!attr
|| !attribute_value_equal (a
, attr
))
5064 for (a
= a2
; a
!= NULL_TREE
; a
= TREE_CHAIN (a
))
5066 const struct attribute_spec
*as
;
5068 as
= lookup_attribute_spec (get_attribute_name (a
));
5069 if (!as
|| as
->affects_type_identity
== false)
5072 if (!lookup_attribute (as
->name
, CONST_CAST_TREE (a1
)))
5074 /* We don't need to compare trees again, as we did this
5075 already in first loop. */
5077 /* All types - affecting identity - are equal, so
5078 there is no need to call target hook for comparison. */
5082 if (lookup_attribute ("transaction_safe", CONST_CAST_TREE (a
)))
5084 /* As some type combinations - like default calling-convention - might
5085 be compatible, we have to call the target hook to get the final result. */
5086 return targetm
.comp_type_attributes (type1
, type2
);
5089 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
5092 Record such modified types already made so we don't make duplicates. */
5095 build_type_attribute_variant (tree ttype
, tree attribute
)
5097 return build_type_attribute_qual_variant (ttype
, attribute
,
5098 TYPE_QUALS (ttype
));
5102 /* Reset the expression *EXPR_P, a size or position.
5104 ??? We could reset all non-constant sizes or positions. But it's cheap
5105 enough to not do so and refrain from adding workarounds to dwarf2out.c.
5107 We need to reset self-referential sizes or positions because they cannot
5108 be gimplified and thus can contain a CALL_EXPR after the gimplification
5109 is finished, which will run afoul of LTO streaming. And they need to be
5110 reset to something essentially dummy but not constant, so as to preserve
5111 the properties of the object they are attached to. */
5114 free_lang_data_in_one_sizepos (tree
*expr_p
)
5116 tree expr
= *expr_p
;
5117 if (CONTAINS_PLACEHOLDER_P (expr
))
5118 *expr_p
= build0 (PLACEHOLDER_EXPR
, TREE_TYPE (expr
));
5122 /* Reset all the fields in a binfo node BINFO. We only keep
5123 BINFO_VTABLE, which is used by gimple_fold_obj_type_ref. */
5126 free_lang_data_in_binfo (tree binfo
)
5131 gcc_assert (TREE_CODE (binfo
) == TREE_BINFO
);
5133 BINFO_VIRTUALS (binfo
) = NULL_TREE
;
5134 BINFO_BASE_ACCESSES (binfo
) = NULL
;
5135 BINFO_INHERITANCE_CHAIN (binfo
) = NULL_TREE
;
5136 BINFO_SUBVTT_INDEX (binfo
) = NULL_TREE
;
5138 FOR_EACH_VEC_ELT (*BINFO_BASE_BINFOS (binfo
), i
, t
)
5139 free_lang_data_in_binfo (t
);
5143 /* Reset all language specific information still present in TYPE. */
5146 free_lang_data_in_type (tree type
)
5148 gcc_assert (TYPE_P (type
));
5150 /* Give the FE a chance to remove its own data first. */
5151 lang_hooks
.free_lang_data (type
);
5153 TREE_LANG_FLAG_0 (type
) = 0;
5154 TREE_LANG_FLAG_1 (type
) = 0;
5155 TREE_LANG_FLAG_2 (type
) = 0;
5156 TREE_LANG_FLAG_3 (type
) = 0;
5157 TREE_LANG_FLAG_4 (type
) = 0;
5158 TREE_LANG_FLAG_5 (type
) = 0;
5159 TREE_LANG_FLAG_6 (type
) = 0;
5161 if (TREE_CODE (type
) == FUNCTION_TYPE
)
5163 /* Remove the const and volatile qualifiers from arguments. The
5164 C++ front end removes them, but the C front end does not,
5165 leading to false ODR violation errors when merging two
5166 instances of the same function signature compiled by
5167 different front ends. */
5170 for (p
= TYPE_ARG_TYPES (type
); p
; p
= TREE_CHAIN (p
))
5172 tree arg_type
= TREE_VALUE (p
);
5174 if (TYPE_READONLY (arg_type
) || TYPE_VOLATILE (arg_type
))
5176 int quals
= TYPE_QUALS (arg_type
)
5178 & ~TYPE_QUAL_VOLATILE
;
5179 TREE_VALUE (p
) = build_qualified_type (arg_type
, quals
);
5180 free_lang_data_in_type (TREE_VALUE (p
));
5182 /* C++ FE uses TREE_PURPOSE to store initial values. */
5183 TREE_PURPOSE (p
) = NULL
;
5185 /* Java uses TYPE_MINVAL for TYPE_ARGUMENT_SIGNATURE. */
5186 TYPE_MINVAL (type
) = NULL
;
5188 if (TREE_CODE (type
) == METHOD_TYPE
)
5192 for (p
= TYPE_ARG_TYPES (type
); p
; p
= TREE_CHAIN (p
))
5194 /* C++ FE uses TREE_PURPOSE to store initial values. */
5195 TREE_PURPOSE (p
) = NULL
;
5197 /* Java uses TYPE_MINVAL for TYPE_ARGUMENT_SIGNATURE. */
5198 TYPE_MINVAL (type
) = NULL
;
5201 /* Remove members that are not actually FIELD_DECLs from the field
5202 list of an aggregate. These occur in C++. */
5203 if (RECORD_OR_UNION_TYPE_P (type
))
5207 /* Note that TYPE_FIELDS can be shared across distinct
5208 TREE_TYPEs. Therefore, if the first field of TYPE_FIELDS is
5209 to be removed, we cannot set its TREE_CHAIN to NULL.
5210 Otherwise, we would not be able to find all the other fields
5211 in the other instances of this TREE_TYPE.
5213 This was causing an ICE in testsuite/g++.dg/lto/20080915.C. */
5215 member
= TYPE_FIELDS (type
);
5218 if (TREE_CODE (member
) == FIELD_DECL
5219 || (TREE_CODE (member
) == TYPE_DECL
5220 && !DECL_IGNORED_P (member
)
5221 && debug_info_level
> DINFO_LEVEL_TERSE
5222 && !is_redundant_typedef (member
)))
5225 TREE_CHAIN (prev
) = member
;
5227 TYPE_FIELDS (type
) = member
;
5231 member
= TREE_CHAIN (member
);
5235 TREE_CHAIN (prev
) = NULL_TREE
;
5237 TYPE_FIELDS (type
) = NULL_TREE
;
5239 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
5240 and danagle the pointer from time to time. */
5241 if (TYPE_VFIELD (type
) && TREE_CODE (TYPE_VFIELD (type
)) != FIELD_DECL
)
5242 TYPE_VFIELD (type
) = NULL_TREE
;
5244 /* Remove TYPE_METHODS list. While it would be nice to keep it
5245 to enable ODR warnings about different method lists, doing so
5246 seems to impractically increase size of LTO data streamed.
5247 Keep the information if TYPE_METHODS was non-NULL. This is used
5248 by function.c and pretty printers. */
5249 if (TYPE_METHODS (type
))
5250 TYPE_METHODS (type
) = error_mark_node
;
5251 if (TYPE_BINFO (type
))
5253 free_lang_data_in_binfo (TYPE_BINFO (type
));
5254 /* We need to preserve link to bases and virtual table for all
5255 polymorphic types to make devirtualization machinery working.
5256 Debug output cares only about bases, but output also
5257 virtual table pointers so merging of -fdevirtualize and
5258 -fno-devirtualize units is easier. */
5259 if ((!BINFO_VTABLE (TYPE_BINFO (type
))
5260 || !flag_devirtualize
)
5261 && ((!BINFO_N_BASE_BINFOS (TYPE_BINFO (type
))
5262 && !BINFO_VTABLE (TYPE_BINFO (type
)))
5263 || debug_info_level
!= DINFO_LEVEL_NONE
))
5264 TYPE_BINFO (type
) = NULL
;
5269 /* For non-aggregate types, clear out the language slot (which
5270 overloads TYPE_BINFO). */
5271 TYPE_LANG_SLOT_1 (type
) = NULL_TREE
;
5273 if (INTEGRAL_TYPE_P (type
)
5274 || SCALAR_FLOAT_TYPE_P (type
)
5275 || FIXED_POINT_TYPE_P (type
))
5277 free_lang_data_in_one_sizepos (&TYPE_MIN_VALUE (type
));
5278 free_lang_data_in_one_sizepos (&TYPE_MAX_VALUE (type
));
5282 free_lang_data_in_one_sizepos (&TYPE_SIZE (type
));
5283 free_lang_data_in_one_sizepos (&TYPE_SIZE_UNIT (type
));
5285 if (TYPE_CONTEXT (type
)
5286 && TREE_CODE (TYPE_CONTEXT (type
)) == BLOCK
)
5288 tree ctx
= TYPE_CONTEXT (type
);
5291 ctx
= BLOCK_SUPERCONTEXT (ctx
);
5293 while (ctx
&& TREE_CODE (ctx
) == BLOCK
);
5294 TYPE_CONTEXT (type
) = ctx
;
5299 /* Return true if DECL may need an assembler name to be set. */
5302 need_assembler_name_p (tree decl
)
5304 /* We use DECL_ASSEMBLER_NAME to hold mangled type names for One Definition
5305 Rule merging. This makes type_odr_p to return true on those types during
5306 LTO and by comparing the mangled name, we can say what types are intended
5307 to be equivalent across compilation unit.
5309 We do not store names of type_in_anonymous_namespace_p.
5311 Record, union and enumeration type have linkage that allows use
5312 to check type_in_anonymous_namespace_p. We do not mangle compound types
5313 that always can be compared structurally.
5315 Similarly for builtin types, we compare properties of their main variant.
5316 A special case are integer types where mangling do make differences
5317 between char/signed char/unsigned char etc. Storing name for these makes
5318 e.g. -fno-signed-char/-fsigned-char mismatches to be handled well.
5319 See cp/mangle.c:write_builtin_type for details. */
5321 if (flag_lto_odr_type_mering
5322 && TREE_CODE (decl
) == TYPE_DECL
5324 && decl
== TYPE_NAME (TREE_TYPE (decl
))
5325 && TYPE_MAIN_VARIANT (TREE_TYPE (decl
)) == TREE_TYPE (decl
)
5326 && !TYPE_ARTIFICIAL (TREE_TYPE (decl
))
5327 && (type_with_linkage_p (TREE_TYPE (decl
))
5328 || TREE_CODE (TREE_TYPE (decl
)) == INTEGER_TYPE
)
5329 && !variably_modified_type_p (TREE_TYPE (decl
), NULL_TREE
))
5330 return !DECL_ASSEMBLER_NAME_SET_P (decl
);
5331 /* Only FUNCTION_DECLs and VAR_DECLs are considered. */
5332 if (TREE_CODE (decl
) != FUNCTION_DECL
5333 && TREE_CODE (decl
) != VAR_DECL
)
5336 /* If DECL already has its assembler name set, it does not need a
5338 if (!HAS_DECL_ASSEMBLER_NAME_P (decl
)
5339 || DECL_ASSEMBLER_NAME_SET_P (decl
))
5342 /* Abstract decls do not need an assembler name. */
5343 if (DECL_ABSTRACT_P (decl
))
5346 /* For VAR_DECLs, only static, public and external symbols need an
5348 if (TREE_CODE (decl
) == VAR_DECL
5349 && !TREE_STATIC (decl
)
5350 && !TREE_PUBLIC (decl
)
5351 && !DECL_EXTERNAL (decl
))
5354 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5356 /* Do not set assembler name on builtins. Allow RTL expansion to
5357 decide whether to expand inline or via a regular call. */
5358 if (DECL_BUILT_IN (decl
)
5359 && DECL_BUILT_IN_CLASS (decl
) != BUILT_IN_FRONTEND
)
5362 /* Functions represented in the callgraph need an assembler name. */
5363 if (cgraph_node::get (decl
) != NULL
)
5366 /* Unused and not public functions don't need an assembler name. */
5367 if (!TREE_USED (decl
) && !TREE_PUBLIC (decl
))
5375 /* Reset all language specific information still present in symbol
5379 free_lang_data_in_decl (tree decl
)
5381 gcc_assert (DECL_P (decl
));
5383 /* Give the FE a chance to remove its own data first. */
5384 lang_hooks
.free_lang_data (decl
);
5386 TREE_LANG_FLAG_0 (decl
) = 0;
5387 TREE_LANG_FLAG_1 (decl
) = 0;
5388 TREE_LANG_FLAG_2 (decl
) = 0;
5389 TREE_LANG_FLAG_3 (decl
) = 0;
5390 TREE_LANG_FLAG_4 (decl
) = 0;
5391 TREE_LANG_FLAG_5 (decl
) = 0;
5392 TREE_LANG_FLAG_6 (decl
) = 0;
5394 free_lang_data_in_one_sizepos (&DECL_SIZE (decl
));
5395 free_lang_data_in_one_sizepos (&DECL_SIZE_UNIT (decl
));
5396 if (TREE_CODE (decl
) == FIELD_DECL
)
5398 free_lang_data_in_one_sizepos (&DECL_FIELD_OFFSET (decl
));
5399 if (TREE_CODE (DECL_CONTEXT (decl
)) == QUAL_UNION_TYPE
)
5400 DECL_QUALIFIER (decl
) = NULL_TREE
;
5403 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5405 struct cgraph_node
*node
;
5406 if (!(node
= cgraph_node::get (decl
))
5407 || (!node
->definition
&& !node
->clones
))
5410 node
->release_body ();
5413 release_function_body (decl
);
5414 DECL_ARGUMENTS (decl
) = NULL
;
5415 DECL_RESULT (decl
) = NULL
;
5416 DECL_INITIAL (decl
) = error_mark_node
;
5419 if (gimple_has_body_p (decl
) || (node
&& node
->thunk
.thunk_p
))
5423 /* If DECL has a gimple body, then the context for its
5424 arguments must be DECL. Otherwise, it doesn't really
5425 matter, as we will not be emitting any code for DECL. In
5426 general, there may be other instances of DECL created by
5427 the front end and since PARM_DECLs are generally shared,
5428 their DECL_CONTEXT changes as the replicas of DECL are
5429 created. The only time where DECL_CONTEXT is important
5430 is for the FUNCTION_DECLs that have a gimple body (since
5431 the PARM_DECL will be used in the function's body). */
5432 for (t
= DECL_ARGUMENTS (decl
); t
; t
= TREE_CHAIN (t
))
5433 DECL_CONTEXT (t
) = decl
;
5434 if (!DECL_FUNCTION_SPECIFIC_TARGET (decl
))
5435 DECL_FUNCTION_SPECIFIC_TARGET (decl
)
5436 = target_option_default_node
;
5437 if (!DECL_FUNCTION_SPECIFIC_OPTIMIZATION (decl
))
5438 DECL_FUNCTION_SPECIFIC_OPTIMIZATION (decl
)
5439 = optimization_default_node
;
5442 /* DECL_SAVED_TREE holds the GENERIC representation for DECL.
5443 At this point, it is not needed anymore. */
5444 DECL_SAVED_TREE (decl
) = NULL_TREE
;
5446 /* Clear the abstract origin if it refers to a method. Otherwise
5447 dwarf2out.c will ICE as we clear TYPE_METHODS and thus the
5448 origin will not be output correctly. */
5449 if (DECL_ABSTRACT_ORIGIN (decl
)
5450 && DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))
5451 && RECORD_OR_UNION_TYPE_P
5452 (DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))))
5453 DECL_ABSTRACT_ORIGIN (decl
) = NULL_TREE
;
5455 /* Sometimes the C++ frontend doesn't manage to transform a temporary
5456 DECL_VINDEX referring to itself into a vtable slot number as it
5457 should. Happens with functions that are copied and then forgotten
5458 about. Just clear it, it won't matter anymore. */
5459 if (DECL_VINDEX (decl
) && !tree_fits_shwi_p (DECL_VINDEX (decl
)))
5460 DECL_VINDEX (decl
) = NULL_TREE
;
5462 else if (TREE_CODE (decl
) == VAR_DECL
)
5464 if ((DECL_EXTERNAL (decl
)
5465 && (!TREE_STATIC (decl
) || !TREE_READONLY (decl
)))
5466 || (decl_function_context (decl
) && !TREE_STATIC (decl
)))
5467 DECL_INITIAL (decl
) = NULL_TREE
;
5469 else if (TREE_CODE (decl
) == TYPE_DECL
)
5471 DECL_VISIBILITY (decl
) = VISIBILITY_DEFAULT
;
5472 DECL_VISIBILITY_SPECIFIED (decl
) = 0;
5473 DECL_INITIAL (decl
) = NULL_TREE
;
5475 else if (TREE_CODE (decl
) == FIELD_DECL
)
5476 DECL_INITIAL (decl
) = NULL_TREE
;
5477 else if (TREE_CODE (decl
) == TRANSLATION_UNIT_DECL
5478 && DECL_INITIAL (decl
)
5479 && TREE_CODE (DECL_INITIAL (decl
)) == BLOCK
)
5481 /* Strip builtins from the translation-unit BLOCK. We still have targets
5482 without builtin_decl_explicit support and also builtins are shared
5483 nodes and thus we can't use TREE_CHAIN in multiple lists. */
5484 tree
*nextp
= &BLOCK_VARS (DECL_INITIAL (decl
));
5488 if (TREE_CODE (var
) == FUNCTION_DECL
5489 && DECL_BUILT_IN (var
))
5490 *nextp
= TREE_CHAIN (var
);
5492 nextp
= &TREE_CHAIN (var
);
5498 /* Data used when collecting DECLs and TYPEs for language data removal. */
5500 struct free_lang_data_d
5502 /* Worklist to avoid excessive recursion. */
5505 /* Set of traversed objects. Used to avoid duplicate visits. */
5506 hash_set
<tree
> *pset
;
5508 /* Array of symbols to process with free_lang_data_in_decl. */
5511 /* Array of types to process with free_lang_data_in_type. */
5516 /* Save all language fields needed to generate proper debug information
5517 for DECL. This saves most fields cleared out by free_lang_data_in_decl. */
5520 save_debug_info_for_decl (tree t
)
5522 /*struct saved_debug_info_d *sdi;*/
5524 gcc_assert (debug_info_level
> DINFO_LEVEL_TERSE
&& t
&& DECL_P (t
));
5526 /* FIXME. Partial implementation for saving debug info removed. */
5530 /* Save all language fields needed to generate proper debug information
5531 for TYPE. This saves most fields cleared out by free_lang_data_in_type. */
5534 save_debug_info_for_type (tree t
)
5536 /*struct saved_debug_info_d *sdi;*/
5538 gcc_assert (debug_info_level
> DINFO_LEVEL_TERSE
&& t
&& TYPE_P (t
));
5540 /* FIXME. Partial implementation for saving debug info removed. */
5544 /* Add type or decl T to one of the list of tree nodes that need their
5545 language data removed. The lists are held inside FLD. */
5548 add_tree_to_fld_list (tree t
, struct free_lang_data_d
*fld
)
5552 fld
->decls
.safe_push (t
);
5553 if (debug_info_level
> DINFO_LEVEL_TERSE
)
5554 save_debug_info_for_decl (t
);
5556 else if (TYPE_P (t
))
5558 fld
->types
.safe_push (t
);
5559 if (debug_info_level
> DINFO_LEVEL_TERSE
)
5560 save_debug_info_for_type (t
);
5566 /* Push tree node T into FLD->WORKLIST. */
5569 fld_worklist_push (tree t
, struct free_lang_data_d
*fld
)
5571 if (t
&& !is_lang_specific (t
) && !fld
->pset
->contains (t
))
5572 fld
->worklist
.safe_push ((t
));
5576 /* Operand callback helper for free_lang_data_in_node. *TP is the
5577 subtree operand being considered. */
5580 find_decls_types_r (tree
*tp
, int *ws
, void *data
)
5583 struct free_lang_data_d
*fld
= (struct free_lang_data_d
*) data
;
5585 if (TREE_CODE (t
) == TREE_LIST
)
5588 /* Language specific nodes will be removed, so there is no need
5589 to gather anything under them. */
5590 if (is_lang_specific (t
))
5598 /* Note that walk_tree does not traverse every possible field in
5599 decls, so we have to do our own traversals here. */
5600 add_tree_to_fld_list (t
, fld
);
5602 fld_worklist_push (DECL_NAME (t
), fld
);
5603 fld_worklist_push (DECL_CONTEXT (t
), fld
);
5604 fld_worklist_push (DECL_SIZE (t
), fld
);
5605 fld_worklist_push (DECL_SIZE_UNIT (t
), fld
);
5607 /* We are going to remove everything under DECL_INITIAL for
5608 TYPE_DECLs. No point walking them. */
5609 if (TREE_CODE (t
) != TYPE_DECL
)
5610 fld_worklist_push (DECL_INITIAL (t
), fld
);
5612 fld_worklist_push (DECL_ATTRIBUTES (t
), fld
);
5613 fld_worklist_push (DECL_ABSTRACT_ORIGIN (t
), fld
);
5615 if (TREE_CODE (t
) == FUNCTION_DECL
)
5617 fld_worklist_push (DECL_ARGUMENTS (t
), fld
);
5618 fld_worklist_push (DECL_RESULT (t
), fld
);
5620 else if (TREE_CODE (t
) == TYPE_DECL
)
5622 fld_worklist_push (DECL_ORIGINAL_TYPE (t
), fld
);
5624 else if (TREE_CODE (t
) == FIELD_DECL
)
5626 fld_worklist_push (DECL_FIELD_OFFSET (t
), fld
);
5627 fld_worklist_push (DECL_BIT_FIELD_TYPE (t
), fld
);
5628 fld_worklist_push (DECL_FIELD_BIT_OFFSET (t
), fld
);
5629 fld_worklist_push (DECL_FCONTEXT (t
), fld
);
5632 if ((TREE_CODE (t
) == VAR_DECL
|| TREE_CODE (t
) == PARM_DECL
)
5633 && DECL_HAS_VALUE_EXPR_P (t
))
5634 fld_worklist_push (DECL_VALUE_EXPR (t
), fld
);
5636 if (TREE_CODE (t
) != FIELD_DECL
5637 && TREE_CODE (t
) != TYPE_DECL
)
5638 fld_worklist_push (TREE_CHAIN (t
), fld
);
5641 else if (TYPE_P (t
))
5643 /* Note that walk_tree does not traverse every possible field in
5644 types, so we have to do our own traversals here. */
5645 add_tree_to_fld_list (t
, fld
);
5647 if (!RECORD_OR_UNION_TYPE_P (t
))
5648 fld_worklist_push (TYPE_CACHED_VALUES (t
), fld
);
5649 fld_worklist_push (TYPE_SIZE (t
), fld
);
5650 fld_worklist_push (TYPE_SIZE_UNIT (t
), fld
);
5651 fld_worklist_push (TYPE_ATTRIBUTES (t
), fld
);
5652 fld_worklist_push (TYPE_POINTER_TO (t
), fld
);
5653 fld_worklist_push (TYPE_REFERENCE_TO (t
), fld
);
5654 fld_worklist_push (TYPE_NAME (t
), fld
);
5655 /* Do not walk TYPE_NEXT_PTR_TO or TYPE_NEXT_REF_TO. We do not stream
5656 them and thus do not and want not to reach unused pointer types
5658 if (!POINTER_TYPE_P (t
))
5659 fld_worklist_push (TYPE_MINVAL (t
), fld
);
5660 if (!RECORD_OR_UNION_TYPE_P (t
))
5661 fld_worklist_push (TYPE_MAXVAL (t
), fld
);
5662 fld_worklist_push (TYPE_MAIN_VARIANT (t
), fld
);
5663 /* Do not walk TYPE_NEXT_VARIANT. We do not stream it and thus
5664 do not and want not to reach unused variants this way. */
5665 if (TYPE_CONTEXT (t
))
5667 tree ctx
= TYPE_CONTEXT (t
);
5668 /* We adjust BLOCK TYPE_CONTEXTs to the innermost non-BLOCK one.
5669 So push that instead. */
5670 while (ctx
&& TREE_CODE (ctx
) == BLOCK
)
5671 ctx
= BLOCK_SUPERCONTEXT (ctx
);
5672 fld_worklist_push (ctx
, fld
);
5674 /* Do not walk TYPE_CANONICAL. We do not stream it and thus do not
5675 and want not to reach unused types this way. */
5677 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_BINFO (t
))
5681 FOR_EACH_VEC_ELT (*BINFO_BASE_BINFOS (TYPE_BINFO (t
)), i
, tem
)
5682 fld_worklist_push (TREE_TYPE (tem
), fld
);
5683 tem
= BINFO_VIRTUALS (TYPE_BINFO (t
));
5685 /* The Java FE overloads BINFO_VIRTUALS for its own purpose. */
5686 && TREE_CODE (tem
) == TREE_LIST
)
5689 fld_worklist_push (TREE_VALUE (tem
), fld
);
5690 tem
= TREE_CHAIN (tem
);
5694 if (RECORD_OR_UNION_TYPE_P (t
))
5697 /* Push all TYPE_FIELDS - there can be interleaving interesting
5698 and non-interesting things. */
5699 tem
= TYPE_FIELDS (t
);
5702 if (TREE_CODE (tem
) == FIELD_DECL
5703 || (TREE_CODE (tem
) == TYPE_DECL
5704 && !DECL_IGNORED_P (tem
)
5705 && debug_info_level
> DINFO_LEVEL_TERSE
5706 && !is_redundant_typedef (tem
)))
5707 fld_worklist_push (tem
, fld
);
5708 tem
= TREE_CHAIN (tem
);
5712 fld_worklist_push (TYPE_STUB_DECL (t
), fld
);
5715 else if (TREE_CODE (t
) == BLOCK
)
5718 for (tem
= BLOCK_VARS (t
); tem
; tem
= TREE_CHAIN (tem
))
5719 fld_worklist_push (tem
, fld
);
5720 for (tem
= BLOCK_SUBBLOCKS (t
); tem
; tem
= BLOCK_CHAIN (tem
))
5721 fld_worklist_push (tem
, fld
);
5722 fld_worklist_push (BLOCK_ABSTRACT_ORIGIN (t
), fld
);
5725 if (TREE_CODE (t
) != IDENTIFIER_NODE
5726 && CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_TYPED
))
5727 fld_worklist_push (TREE_TYPE (t
), fld
);
5733 /* Find decls and types in T. */
5736 find_decls_types (tree t
, struct free_lang_data_d
*fld
)
5740 if (!fld
->pset
->contains (t
))
5741 walk_tree (&t
, find_decls_types_r
, fld
, fld
->pset
);
5742 if (fld
->worklist
.is_empty ())
5744 t
= fld
->worklist
.pop ();
5748 /* Translate all the types in LIST with the corresponding runtime
5752 get_eh_types_for_runtime (tree list
)
5756 if (list
== NULL_TREE
)
5759 head
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
5761 list
= TREE_CHAIN (list
);
5764 tree n
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
5765 TREE_CHAIN (prev
) = n
;
5766 prev
= TREE_CHAIN (prev
);
5767 list
= TREE_CHAIN (list
);
5774 /* Find decls and types referenced in EH region R and store them in
5775 FLD->DECLS and FLD->TYPES. */
5778 find_decls_types_in_eh_region (eh_region r
, struct free_lang_data_d
*fld
)
5789 /* The types referenced in each catch must first be changed to the
5790 EH types used at runtime. This removes references to FE types
5792 for (c
= r
->u
.eh_try
.first_catch
; c
; c
= c
->next_catch
)
5794 c
->type_list
= get_eh_types_for_runtime (c
->type_list
);
5795 walk_tree (&c
->type_list
, find_decls_types_r
, fld
, fld
->pset
);
5800 case ERT_ALLOWED_EXCEPTIONS
:
5801 r
->u
.allowed
.type_list
5802 = get_eh_types_for_runtime (r
->u
.allowed
.type_list
);
5803 walk_tree (&r
->u
.allowed
.type_list
, find_decls_types_r
, fld
, fld
->pset
);
5806 case ERT_MUST_NOT_THROW
:
5807 walk_tree (&r
->u
.must_not_throw
.failure_decl
,
5808 find_decls_types_r
, fld
, fld
->pset
);
5814 /* Find decls and types referenced in cgraph node N and store them in
5815 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
5816 look for *every* kind of DECL and TYPE node reachable from N,
5817 including those embedded inside types and decls (i.e,, TYPE_DECLs,
5818 NAMESPACE_DECLs, etc). */
5821 find_decls_types_in_node (struct cgraph_node
*n
, struct free_lang_data_d
*fld
)
5824 struct function
*fn
;
5828 find_decls_types (n
->decl
, fld
);
5830 if (!gimple_has_body_p (n
->decl
))
5833 gcc_assert (current_function_decl
== NULL_TREE
&& cfun
== NULL
);
5835 fn
= DECL_STRUCT_FUNCTION (n
->decl
);
5837 /* Traverse locals. */
5838 FOR_EACH_LOCAL_DECL (fn
, ix
, t
)
5839 find_decls_types (t
, fld
);
5841 /* Traverse EH regions in FN. */
5844 FOR_ALL_EH_REGION_FN (r
, fn
)
5845 find_decls_types_in_eh_region (r
, fld
);
5848 /* Traverse every statement in FN. */
5849 FOR_EACH_BB_FN (bb
, fn
)
5852 gimple_stmt_iterator si
;
5855 for (psi
= gsi_start_phis (bb
); !gsi_end_p (psi
); gsi_next (&psi
))
5857 gphi
*phi
= psi
.phi ();
5859 for (i
= 0; i
< gimple_phi_num_args (phi
); i
++)
5861 tree
*arg_p
= gimple_phi_arg_def_ptr (phi
, i
);
5862 find_decls_types (*arg_p
, fld
);
5866 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
5868 gimple
*stmt
= gsi_stmt (si
);
5870 if (is_gimple_call (stmt
))
5871 find_decls_types (gimple_call_fntype (stmt
), fld
);
5873 for (i
= 0; i
< gimple_num_ops (stmt
); i
++)
5875 tree arg
= gimple_op (stmt
, i
);
5876 find_decls_types (arg
, fld
);
5883 /* Find decls and types referenced in varpool node N and store them in
5884 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
5885 look for *every* kind of DECL and TYPE node reachable from N,
5886 including those embedded inside types and decls (i.e,, TYPE_DECLs,
5887 NAMESPACE_DECLs, etc). */
5890 find_decls_types_in_var (varpool_node
*v
, struct free_lang_data_d
*fld
)
5892 find_decls_types (v
->decl
, fld
);
5895 /* If T needs an assembler name, have one created for it. */
5898 assign_assembler_name_if_neeeded (tree t
)
5900 if (need_assembler_name_p (t
))
5902 /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit
5903 diagnostics that use input_location to show locus
5904 information. The problem here is that, at this point,
5905 input_location is generally anchored to the end of the file
5906 (since the parser is long gone), so we don't have a good
5907 position to pin it to.
5909 To alleviate this problem, this uses the location of T's
5910 declaration. Examples of this are
5911 testsuite/g++.dg/template/cond2.C and
5912 testsuite/g++.dg/template/pr35240.C. */
5913 location_t saved_location
= input_location
;
5914 input_location
= DECL_SOURCE_LOCATION (t
);
5916 decl_assembler_name (t
);
5918 input_location
= saved_location
;
5923 /* Free language specific information for every operand and expression
5924 in every node of the call graph. This process operates in three stages:
5926 1- Every callgraph node and varpool node is traversed looking for
5927 decls and types embedded in them. This is a more exhaustive
5928 search than that done by find_referenced_vars, because it will
5929 also collect individual fields, decls embedded in types, etc.
5931 2- All the decls found are sent to free_lang_data_in_decl.
5933 3- All the types found are sent to free_lang_data_in_type.
5935 The ordering between decls and types is important because
5936 free_lang_data_in_decl sets assembler names, which includes
5937 mangling. So types cannot be freed up until assembler names have
5941 free_lang_data_in_cgraph (void)
5943 struct cgraph_node
*n
;
5945 struct free_lang_data_d fld
;
5950 /* Initialize sets and arrays to store referenced decls and types. */
5951 fld
.pset
= new hash_set
<tree
>;
5952 fld
.worklist
.create (0);
5953 fld
.decls
.create (100);
5954 fld
.types
.create (100);
5956 /* Find decls and types in the body of every function in the callgraph. */
5957 FOR_EACH_FUNCTION (n
)
5958 find_decls_types_in_node (n
, &fld
);
5960 FOR_EACH_VEC_SAFE_ELT (alias_pairs
, i
, p
)
5961 find_decls_types (p
->decl
, &fld
);
5963 /* Find decls and types in every varpool symbol. */
5964 FOR_EACH_VARIABLE (v
)
5965 find_decls_types_in_var (v
, &fld
);
5967 /* Set the assembler name on every decl found. We need to do this
5968 now because free_lang_data_in_decl will invalidate data needed
5969 for mangling. This breaks mangling on interdependent decls. */
5970 FOR_EACH_VEC_ELT (fld
.decls
, i
, t
)
5971 assign_assembler_name_if_neeeded (t
);
5973 /* Traverse every decl found freeing its language data. */
5974 FOR_EACH_VEC_ELT (fld
.decls
, i
, t
)
5975 free_lang_data_in_decl (t
);
5977 /* Traverse every type found freeing its language data. */
5978 FOR_EACH_VEC_ELT (fld
.types
, i
, t
)
5979 free_lang_data_in_type (t
);
5982 FOR_EACH_VEC_ELT (fld
.types
, i
, t
)
5987 fld
.worklist
.release ();
5988 fld
.decls
.release ();
5989 fld
.types
.release ();
5993 /* Free resources that are used by FE but are not needed once they are done. */
5996 free_lang_data (void)
6000 /* If we are the LTO frontend we have freed lang-specific data already. */
6002 || (!flag_generate_lto
&& !flag_generate_offload
))
6005 /* Allocate and assign alias sets to the standard integer types
6006 while the slots are still in the way the frontends generated them. */
6007 for (i
= 0; i
< itk_none
; ++i
)
6008 if (integer_types
[i
])
6009 TYPE_ALIAS_SET (integer_types
[i
]) = get_alias_set (integer_types
[i
]);
6011 /* Traverse the IL resetting language specific information for
6012 operands, expressions, etc. */
6013 free_lang_data_in_cgraph ();
6015 /* Create gimple variants for common types. */
6016 ptrdiff_type_node
= integer_type_node
;
6017 fileptr_type_node
= ptr_type_node
;
6019 /* Reset some langhooks. Do not reset types_compatible_p, it may
6020 still be used indirectly via the get_alias_set langhook. */
6021 lang_hooks
.dwarf_name
= lhd_dwarf_name
;
6022 lang_hooks
.decl_printable_name
= gimple_decl_printable_name
;
6023 lang_hooks
.gimplify_expr
= lhd_gimplify_expr
;
6025 /* We do not want the default decl_assembler_name implementation,
6026 rather if we have fixed everything we want a wrapper around it
6027 asserting that all non-local symbols already got their assembler
6028 name and only produce assembler names for local symbols. Or rather
6029 make sure we never call decl_assembler_name on local symbols and
6030 devise a separate, middle-end private scheme for it. */
6032 /* Reset diagnostic machinery. */
6033 tree_diagnostics_defaults (global_dc
);
6041 const pass_data pass_data_ipa_free_lang_data
=
6043 SIMPLE_IPA_PASS
, /* type */
6044 "*free_lang_data", /* name */
6045 OPTGROUP_NONE
, /* optinfo_flags */
6046 TV_IPA_FREE_LANG_DATA
, /* tv_id */
6047 0, /* properties_required */
6048 0, /* properties_provided */
6049 0, /* properties_destroyed */
6050 0, /* todo_flags_start */
6051 0, /* todo_flags_finish */
6054 class pass_ipa_free_lang_data
: public simple_ipa_opt_pass
6057 pass_ipa_free_lang_data (gcc::context
*ctxt
)
6058 : simple_ipa_opt_pass (pass_data_ipa_free_lang_data
, ctxt
)
6061 /* opt_pass methods: */
6062 virtual unsigned int execute (function
*) { return free_lang_data (); }
6064 }; // class pass_ipa_free_lang_data
6068 simple_ipa_opt_pass
*
6069 make_pass_ipa_free_lang_data (gcc::context
*ctxt
)
6071 return new pass_ipa_free_lang_data (ctxt
);
6074 /* The backbone of is_attribute_p(). ATTR_LEN is the string length of
6075 ATTR_NAME. Also used internally by remove_attribute(). */
6077 private_is_attribute_p (const char *attr_name
, size_t attr_len
, const_tree ident
)
6079 size_t ident_len
= IDENTIFIER_LENGTH (ident
);
6081 if (ident_len
== attr_len
)
6083 if (strcmp (attr_name
, IDENTIFIER_POINTER (ident
)) == 0)
6086 else if (ident_len
== attr_len
+ 4)
6088 /* There is the possibility that ATTR is 'text' and IDENT is
6090 const char *p
= IDENTIFIER_POINTER (ident
);
6091 if (p
[0] == '_' && p
[1] == '_'
6092 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
6093 && strncmp (attr_name
, p
+ 2, attr_len
) == 0)
6100 /* The backbone of lookup_attribute(). ATTR_LEN is the string length
6101 of ATTR_NAME, and LIST is not NULL_TREE. */
6103 private_lookup_attribute (const char *attr_name
, size_t attr_len
, tree list
)
6107 size_t ident_len
= IDENTIFIER_LENGTH (get_attribute_name (list
));
6109 if (ident_len
== attr_len
)
6111 if (!strcmp (attr_name
,
6112 IDENTIFIER_POINTER (get_attribute_name (list
))))
6115 /* TODO: If we made sure that attributes were stored in the
6116 canonical form without '__...__' (ie, as in 'text' as opposed
6117 to '__text__') then we could avoid the following case. */
6118 else if (ident_len
== attr_len
+ 4)
6120 const char *p
= IDENTIFIER_POINTER (get_attribute_name (list
));
6121 if (p
[0] == '_' && p
[1] == '_'
6122 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
6123 && strncmp (attr_name
, p
+ 2, attr_len
) == 0)
6126 list
= TREE_CHAIN (list
);
6132 /* Given an attribute name ATTR_NAME and a list of attributes LIST,
6133 return a pointer to the attribute's list first element if the attribute
6134 starts with ATTR_NAME. ATTR_NAME must be in the form 'text' (not
6138 private_lookup_attribute_by_prefix (const char *attr_name
, size_t attr_len
,
6143 size_t ident_len
= IDENTIFIER_LENGTH (get_attribute_name (list
));
6145 if (attr_len
> ident_len
)
6147 list
= TREE_CHAIN (list
);
6151 const char *p
= IDENTIFIER_POINTER (get_attribute_name (list
));
6153 if (strncmp (attr_name
, p
, attr_len
) == 0)
6156 /* TODO: If we made sure that attributes were stored in the
6157 canonical form without '__...__' (ie, as in 'text' as opposed
6158 to '__text__') then we could avoid the following case. */
6159 if (p
[0] == '_' && p
[1] == '_' &&
6160 strncmp (attr_name
, p
+ 2, attr_len
) == 0)
6163 list
= TREE_CHAIN (list
);
6170 /* A variant of lookup_attribute() that can be used with an identifier
6171 as the first argument, and where the identifier can be either
6172 'text' or '__text__'.
6174 Given an attribute ATTR_IDENTIFIER, and a list of attributes LIST,
6175 return a pointer to the attribute's list element if the attribute
6176 is part of the list, or NULL_TREE if not found. If the attribute
6177 appears more than once, this only returns the first occurrence; the
6178 TREE_CHAIN of the return value should be passed back in if further
6179 occurrences are wanted. ATTR_IDENTIFIER must be an identifier but
6180 can be in the form 'text' or '__text__'. */
6182 lookup_ident_attribute (tree attr_identifier
, tree list
)
6184 gcc_checking_assert (TREE_CODE (attr_identifier
) == IDENTIFIER_NODE
);
6188 gcc_checking_assert (TREE_CODE (get_attribute_name (list
))
6189 == IDENTIFIER_NODE
);
6191 if (cmp_attrib_identifiers (attr_identifier
,
6192 get_attribute_name (list
)))
6195 list
= TREE_CHAIN (list
);
6201 /* Remove any instances of attribute ATTR_NAME in LIST and return the
6205 remove_attribute (const char *attr_name
, tree list
)
6208 size_t attr_len
= strlen (attr_name
);
6210 gcc_checking_assert (attr_name
[0] != '_');
6212 for (p
= &list
; *p
; )
6215 /* TODO: If we were storing attributes in normalized form, here
6216 we could use a simple strcmp(). */
6217 if (private_is_attribute_p (attr_name
, attr_len
, get_attribute_name (l
)))
6218 *p
= TREE_CHAIN (l
);
6220 p
= &TREE_CHAIN (l
);
6226 /* Return an attribute list that is the union of a1 and a2. */
6229 merge_attributes (tree a1
, tree a2
)
6233 /* Either one unset? Take the set one. */
6235 if ((attributes
= a1
) == 0)
6238 /* One that completely contains the other? Take it. */
6240 else if (a2
!= 0 && ! attribute_list_contained (a1
, a2
))
6242 if (attribute_list_contained (a2
, a1
))
6246 /* Pick the longest list, and hang on the other list. */
6248 if (list_length (a1
) < list_length (a2
))
6249 attributes
= a2
, a2
= a1
;
6251 for (; a2
!= 0; a2
= TREE_CHAIN (a2
))
6254 for (a
= lookup_ident_attribute (get_attribute_name (a2
),
6256 a
!= NULL_TREE
&& !attribute_value_equal (a
, a2
);
6257 a
= lookup_ident_attribute (get_attribute_name (a2
),
6262 a1
= copy_node (a2
);
6263 TREE_CHAIN (a1
) = attributes
;
6272 /* Given types T1 and T2, merge their attributes and return
6276 merge_type_attributes (tree t1
, tree t2
)
6278 return merge_attributes (TYPE_ATTRIBUTES (t1
),
6279 TYPE_ATTRIBUTES (t2
));
6282 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
6286 merge_decl_attributes (tree olddecl
, tree newdecl
)
6288 return merge_attributes (DECL_ATTRIBUTES (olddecl
),
6289 DECL_ATTRIBUTES (newdecl
));
6292 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
6294 /* Specialization of merge_decl_attributes for various Windows targets.
6296 This handles the following situation:
6298 __declspec (dllimport) int foo;
6301 The second instance of `foo' nullifies the dllimport. */
6304 merge_dllimport_decl_attributes (tree old
, tree new_tree
)
6307 int delete_dllimport_p
= 1;
6309 /* What we need to do here is remove from `old' dllimport if it doesn't
6310 appear in `new'. dllimport behaves like extern: if a declaration is
6311 marked dllimport and a definition appears later, then the object
6312 is not dllimport'd. We also remove a `new' dllimport if the old list
6313 contains dllexport: dllexport always overrides dllimport, regardless
6314 of the order of declaration. */
6315 if (!VAR_OR_FUNCTION_DECL_P (new_tree
))
6316 delete_dllimport_p
= 0;
6317 else if (DECL_DLLIMPORT_P (new_tree
)
6318 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (old
)))
6320 DECL_DLLIMPORT_P (new_tree
) = 0;
6321 warning (OPT_Wattributes
, "%q+D already declared with dllexport attribute: "
6322 "dllimport ignored", new_tree
);
6324 else if (DECL_DLLIMPORT_P (old
) && !DECL_DLLIMPORT_P (new_tree
))
6326 /* Warn about overriding a symbol that has already been used, e.g.:
6327 extern int __attribute__ ((dllimport)) foo;
6328 int* bar () {return &foo;}
6331 if (TREE_USED (old
))
6333 warning (0, "%q+D redeclared without dllimport attribute "
6334 "after being referenced with dll linkage", new_tree
);
6335 /* If we have used a variable's address with dllimport linkage,
6336 keep the old DECL_DLLIMPORT_P flag: the ADDR_EXPR using the
6337 decl may already have had TREE_CONSTANT computed.
6338 We still remove the attribute so that assembler code refers
6339 to '&foo rather than '_imp__foo'. */
6340 if (TREE_CODE (old
) == VAR_DECL
&& TREE_ADDRESSABLE (old
))
6341 DECL_DLLIMPORT_P (new_tree
) = 1;
6344 /* Let an inline definition silently override the external reference,
6345 but otherwise warn about attribute inconsistency. */
6346 else if (TREE_CODE (new_tree
) == VAR_DECL
6347 || !DECL_DECLARED_INLINE_P (new_tree
))
6348 warning (OPT_Wattributes
, "%q+D redeclared without dllimport attribute: "
6349 "previous dllimport ignored", new_tree
);
6352 delete_dllimport_p
= 0;
6354 a
= merge_attributes (DECL_ATTRIBUTES (old
), DECL_ATTRIBUTES (new_tree
));
6356 if (delete_dllimport_p
)
6357 a
= remove_attribute ("dllimport", a
);
6362 /* Handle a "dllimport" or "dllexport" attribute; arguments as in
6363 struct attribute_spec.handler. */
6366 handle_dll_attribute (tree
* pnode
, tree name
, tree args
, int flags
,
6372 /* These attributes may apply to structure and union types being created,
6373 but otherwise should pass to the declaration involved. */
6376 if (flags
& ((int) ATTR_FLAG_DECL_NEXT
| (int) ATTR_FLAG_FUNCTION_NEXT
6377 | (int) ATTR_FLAG_ARRAY_NEXT
))
6379 *no_add_attrs
= true;
6380 return tree_cons (name
, args
, NULL_TREE
);
6382 if (TREE_CODE (node
) == RECORD_TYPE
6383 || TREE_CODE (node
) == UNION_TYPE
)
6385 node
= TYPE_NAME (node
);
6391 warning (OPT_Wattributes
, "%qE attribute ignored",
6393 *no_add_attrs
= true;
6398 if (TREE_CODE (node
) != FUNCTION_DECL
6399 && TREE_CODE (node
) != VAR_DECL
6400 && TREE_CODE (node
) != TYPE_DECL
)
6402 *no_add_attrs
= true;
6403 warning (OPT_Wattributes
, "%qE attribute ignored",
6408 if (TREE_CODE (node
) == TYPE_DECL
6409 && TREE_CODE (TREE_TYPE (node
)) != RECORD_TYPE
6410 && TREE_CODE (TREE_TYPE (node
)) != UNION_TYPE
)
6412 *no_add_attrs
= true;
6413 warning (OPT_Wattributes
, "%qE attribute ignored",
6418 is_dllimport
= is_attribute_p ("dllimport", name
);
6420 /* Report error on dllimport ambiguities seen now before they cause
6424 /* Honor any target-specific overrides. */
6425 if (!targetm
.valid_dllimport_attribute_p (node
))
6426 *no_add_attrs
= true;
6428 else if (TREE_CODE (node
) == FUNCTION_DECL
6429 && DECL_DECLARED_INLINE_P (node
))
6431 warning (OPT_Wattributes
, "inline function %q+D declared as "
6432 " dllimport: attribute ignored", node
);
6433 *no_add_attrs
= true;
6435 /* Like MS, treat definition of dllimported variables and
6436 non-inlined functions on declaration as syntax errors. */
6437 else if (TREE_CODE (node
) == FUNCTION_DECL
&& DECL_INITIAL (node
))
6439 error ("function %q+D definition is marked dllimport", node
);
6440 *no_add_attrs
= true;
6443 else if (TREE_CODE (node
) == VAR_DECL
)
6445 if (DECL_INITIAL (node
))
6447 error ("variable %q+D definition is marked dllimport",
6449 *no_add_attrs
= true;
6452 /* `extern' needn't be specified with dllimport.
6453 Specify `extern' now and hope for the best. Sigh. */
6454 DECL_EXTERNAL (node
) = 1;
6455 /* Also, implicitly give dllimport'd variables declared within
6456 a function global scope, unless declared static. */
6457 if (current_function_decl
!= NULL_TREE
&& !TREE_STATIC (node
))
6458 TREE_PUBLIC (node
) = 1;
6461 if (*no_add_attrs
== false)
6462 DECL_DLLIMPORT_P (node
) = 1;
6464 else if (TREE_CODE (node
) == FUNCTION_DECL
6465 && DECL_DECLARED_INLINE_P (node
)
6466 && flag_keep_inline_dllexport
)
6467 /* An exported function, even if inline, must be emitted. */
6468 DECL_EXTERNAL (node
) = 0;
6470 /* Report error if symbol is not accessible at global scope. */
6471 if (!TREE_PUBLIC (node
)
6472 && (TREE_CODE (node
) == VAR_DECL
6473 || TREE_CODE (node
) == FUNCTION_DECL
))
6475 error ("external linkage required for symbol %q+D because of "
6476 "%qE attribute", node
, name
);
6477 *no_add_attrs
= true;
6480 /* A dllexport'd entity must have default visibility so that other
6481 program units (shared libraries or the main executable) can see
6482 it. A dllimport'd entity must have default visibility so that
6483 the linker knows that undefined references within this program
6484 unit can be resolved by the dynamic linker. */
6487 if (DECL_VISIBILITY_SPECIFIED (node
)
6488 && DECL_VISIBILITY (node
) != VISIBILITY_DEFAULT
)
6489 error ("%qE implies default visibility, but %qD has already "
6490 "been declared with a different visibility",
6492 DECL_VISIBILITY (node
) = VISIBILITY_DEFAULT
;
6493 DECL_VISIBILITY_SPECIFIED (node
) = 1;
6499 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
6501 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
6502 of the various TYPE_QUAL values. */
6505 set_type_quals (tree type
, int type_quals
)
6507 TYPE_READONLY (type
) = (type_quals
& TYPE_QUAL_CONST
) != 0;
6508 TYPE_VOLATILE (type
) = (type_quals
& TYPE_QUAL_VOLATILE
) != 0;
6509 TYPE_RESTRICT (type
) = (type_quals
& TYPE_QUAL_RESTRICT
) != 0;
6510 TYPE_ATOMIC (type
) = (type_quals
& TYPE_QUAL_ATOMIC
) != 0;
6511 TYPE_ADDR_SPACE (type
) = DECODE_QUAL_ADDR_SPACE (type_quals
);
6514 /* Returns true iff unqualified CAND and BASE are equivalent. */
6517 check_base_type (const_tree cand
, const_tree base
)
6519 return (TYPE_NAME (cand
) == TYPE_NAME (base
)
6520 /* Apparently this is needed for Objective-C. */
6521 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
6522 /* Check alignment. */
6523 && TYPE_ALIGN (cand
) == TYPE_ALIGN (base
)
6524 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
6525 TYPE_ATTRIBUTES (base
)));
6528 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
6531 check_qualified_type (const_tree cand
, const_tree base
, int type_quals
)
6533 return (TYPE_QUALS (cand
) == type_quals
6534 && check_base_type (cand
, base
));
6537 /* Returns true iff CAND is equivalent to BASE with ALIGN. */
6540 check_aligned_type (const_tree cand
, const_tree base
, unsigned int align
)
6542 return (TYPE_QUALS (cand
) == TYPE_QUALS (base
)
6543 && TYPE_NAME (cand
) == TYPE_NAME (base
)
6544 /* Apparently this is needed for Objective-C. */
6545 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
6546 /* Check alignment. */
6547 && TYPE_ALIGN (cand
) == align
6548 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
6549 TYPE_ATTRIBUTES (base
)));
6552 /* This function checks to see if TYPE matches the size one of the built-in
6553 atomic types, and returns that core atomic type. */
6556 find_atomic_core_type (tree type
)
6558 tree base_atomic_type
;
6560 /* Only handle complete types. */
6561 if (TYPE_SIZE (type
) == NULL_TREE
)
6564 HOST_WIDE_INT type_size
= tree_to_uhwi (TYPE_SIZE (type
));
6568 base_atomic_type
= atomicQI_type_node
;
6572 base_atomic_type
= atomicHI_type_node
;
6576 base_atomic_type
= atomicSI_type_node
;
6580 base_atomic_type
= atomicDI_type_node
;
6584 base_atomic_type
= atomicTI_type_node
;
6588 base_atomic_type
= NULL_TREE
;
6591 return base_atomic_type
;
6594 /* Return a version of the TYPE, qualified as indicated by the
6595 TYPE_QUALS, if one exists. If no qualified version exists yet,
6596 return NULL_TREE. */
6599 get_qualified_type (tree type
, int type_quals
)
6603 if (TYPE_QUALS (type
) == type_quals
)
6606 /* Search the chain of variants to see if there is already one there just
6607 like the one we need to have. If so, use that existing one. We must
6608 preserve the TYPE_NAME, since there is code that depends on this. */
6609 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
6610 if (check_qualified_type (t
, type
, type_quals
))
6616 /* Like get_qualified_type, but creates the type if it does not
6617 exist. This function never returns NULL_TREE. */
6620 build_qualified_type (tree type
, int type_quals
)
6624 /* See if we already have the appropriate qualified variant. */
6625 t
= get_qualified_type (type
, type_quals
);
6627 /* If not, build it. */
6630 t
= build_variant_type_copy (type
);
6631 set_type_quals (t
, type_quals
);
6633 if (((type_quals
& TYPE_QUAL_ATOMIC
) == TYPE_QUAL_ATOMIC
))
6635 /* See if this object can map to a basic atomic type. */
6636 tree atomic_type
= find_atomic_core_type (type
);
6639 /* Ensure the alignment of this type is compatible with
6640 the required alignment of the atomic type. */
6641 if (TYPE_ALIGN (atomic_type
) > TYPE_ALIGN (t
))
6642 SET_TYPE_ALIGN (t
, TYPE_ALIGN (atomic_type
));
6646 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
6647 /* Propagate structural equality. */
6648 SET_TYPE_STRUCTURAL_EQUALITY (t
);
6649 else if (TYPE_CANONICAL (type
) != type
)
6650 /* Build the underlying canonical type, since it is different
6653 tree c
= build_qualified_type (TYPE_CANONICAL (type
), type_quals
);
6654 TYPE_CANONICAL (t
) = TYPE_CANONICAL (c
);
6657 /* T is its own canonical type. */
6658 TYPE_CANONICAL (t
) = t
;
6665 /* Create a variant of type T with alignment ALIGN. */
6668 build_aligned_type (tree type
, unsigned int align
)
6672 if (TYPE_PACKED (type
)
6673 || TYPE_ALIGN (type
) == align
)
6676 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
6677 if (check_aligned_type (t
, type
, align
))
6680 t
= build_variant_type_copy (type
);
6681 SET_TYPE_ALIGN (t
, align
);
6686 /* Create a new distinct copy of TYPE. The new type is made its own
6687 MAIN_VARIANT. If TYPE requires structural equality checks, the
6688 resulting type requires structural equality checks; otherwise, its
6689 TYPE_CANONICAL points to itself. */
6692 build_distinct_type_copy (tree type
)
6694 tree t
= copy_node (type
);
6696 TYPE_POINTER_TO (t
) = 0;
6697 TYPE_REFERENCE_TO (t
) = 0;
6699 /* Set the canonical type either to a new equivalence class, or
6700 propagate the need for structural equality checks. */
6701 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
6702 SET_TYPE_STRUCTURAL_EQUALITY (t
);
6704 TYPE_CANONICAL (t
) = t
;
6706 /* Make it its own variant. */
6707 TYPE_MAIN_VARIANT (t
) = t
;
6708 TYPE_NEXT_VARIANT (t
) = 0;
6710 /* We do not record methods in type copies nor variants
6711 so we do not need to keep them up to date when new method
6713 if (RECORD_OR_UNION_TYPE_P (t
))
6714 TYPE_METHODS (t
) = NULL_TREE
;
6716 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
6717 whose TREE_TYPE is not t. This can also happen in the Ada
6718 frontend when using subtypes. */
6723 /* Create a new variant of TYPE, equivalent but distinct. This is so
6724 the caller can modify it. TYPE_CANONICAL for the return type will
6725 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
6726 are considered equal by the language itself (or that both types
6727 require structural equality checks). */
6730 build_variant_type_copy (tree type
)
6732 tree t
, m
= TYPE_MAIN_VARIANT (type
);
6734 t
= build_distinct_type_copy (type
);
6736 /* Since we're building a variant, assume that it is a non-semantic
6737 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
6738 TYPE_CANONICAL (t
) = TYPE_CANONICAL (type
);
6739 /* Type variants have no alias set defined. */
6740 TYPE_ALIAS_SET (t
) = -1;
6742 /* Add the new type to the chain of variants of TYPE. */
6743 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (m
);
6744 TYPE_NEXT_VARIANT (m
) = t
;
6745 TYPE_MAIN_VARIANT (t
) = m
;
6750 /* Return true if the from tree in both tree maps are equal. */
6753 tree_map_base_eq (const void *va
, const void *vb
)
6755 const struct tree_map_base
*const a
= (const struct tree_map_base
*) va
,
6756 *const b
= (const struct tree_map_base
*) vb
;
6757 return (a
->from
== b
->from
);
6760 /* Hash a from tree in a tree_base_map. */
6763 tree_map_base_hash (const void *item
)
6765 return htab_hash_pointer (((const struct tree_map_base
*)item
)->from
);
6768 /* Return true if this tree map structure is marked for garbage collection
6769 purposes. We simply return true if the from tree is marked, so that this
6770 structure goes away when the from tree goes away. */
6773 tree_map_base_marked_p (const void *p
)
6775 return ggc_marked_p (((const struct tree_map_base
*) p
)->from
);
6778 /* Hash a from tree in a tree_map. */
6781 tree_map_hash (const void *item
)
6783 return (((const struct tree_map
*) item
)->hash
);
6786 /* Hash a from tree in a tree_decl_map. */
6789 tree_decl_map_hash (const void *item
)
6791 return DECL_UID (((const struct tree_decl_map
*) item
)->base
.from
);
6794 /* Return the initialization priority for DECL. */
6797 decl_init_priority_lookup (tree decl
)
6799 symtab_node
*snode
= symtab_node::get (decl
);
6802 return DEFAULT_INIT_PRIORITY
;
6804 snode
->get_init_priority ();
6807 /* Return the finalization priority for DECL. */
6810 decl_fini_priority_lookup (tree decl
)
6812 cgraph_node
*node
= cgraph_node::get (decl
);
6815 return DEFAULT_INIT_PRIORITY
;
6817 node
->get_fini_priority ();
6820 /* Set the initialization priority for DECL to PRIORITY. */
6823 decl_init_priority_insert (tree decl
, priority_type priority
)
6825 struct symtab_node
*snode
;
6827 if (priority
== DEFAULT_INIT_PRIORITY
)
6829 snode
= symtab_node::get (decl
);
6833 else if (TREE_CODE (decl
) == VAR_DECL
)
6834 snode
= varpool_node::get_create (decl
);
6836 snode
= cgraph_node::get_create (decl
);
6837 snode
->set_init_priority (priority
);
6840 /* Set the finalization priority for DECL to PRIORITY. */
6843 decl_fini_priority_insert (tree decl
, priority_type priority
)
6845 struct cgraph_node
*node
;
6847 if (priority
== DEFAULT_INIT_PRIORITY
)
6849 node
= cgraph_node::get (decl
);
6854 node
= cgraph_node::get_create (decl
);
6855 node
->set_fini_priority (priority
);
6858 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
6861 print_debug_expr_statistics (void)
6863 fprintf (stderr
, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
6864 (long) debug_expr_for_decl
->size (),
6865 (long) debug_expr_for_decl
->elements (),
6866 debug_expr_for_decl
->collisions ());
6869 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
6872 print_value_expr_statistics (void)
6874 fprintf (stderr
, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
6875 (long) value_expr_for_decl
->size (),
6876 (long) value_expr_for_decl
->elements (),
6877 value_expr_for_decl
->collisions ());
6880 /* Lookup a debug expression for FROM, and return it if we find one. */
6883 decl_debug_expr_lookup (tree from
)
6885 struct tree_decl_map
*h
, in
;
6886 in
.base
.from
= from
;
6888 h
= debug_expr_for_decl
->find_with_hash (&in
, DECL_UID (from
));
6894 /* Insert a mapping FROM->TO in the debug expression hashtable. */
6897 decl_debug_expr_insert (tree from
, tree to
)
6899 struct tree_decl_map
*h
;
6901 h
= ggc_alloc
<tree_decl_map
> ();
6902 h
->base
.from
= from
;
6904 *debug_expr_for_decl
->find_slot_with_hash (h
, DECL_UID (from
), INSERT
) = h
;
6907 /* Lookup a value expression for FROM, and return it if we find one. */
6910 decl_value_expr_lookup (tree from
)
6912 struct tree_decl_map
*h
, in
;
6913 in
.base
.from
= from
;
6915 h
= value_expr_for_decl
->find_with_hash (&in
, DECL_UID (from
));
6921 /* Insert a mapping FROM->TO in the value expression hashtable. */
6924 decl_value_expr_insert (tree from
, tree to
)
6926 struct tree_decl_map
*h
;
6928 h
= ggc_alloc
<tree_decl_map
> ();
6929 h
->base
.from
= from
;
6931 *value_expr_for_decl
->find_slot_with_hash (h
, DECL_UID (from
), INSERT
) = h
;
6934 /* Lookup a vector of debug arguments for FROM, and return it if we
6938 decl_debug_args_lookup (tree from
)
6940 struct tree_vec_map
*h
, in
;
6942 if (!DECL_HAS_DEBUG_ARGS_P (from
))
6944 gcc_checking_assert (debug_args_for_decl
!= NULL
);
6945 in
.base
.from
= from
;
6946 h
= debug_args_for_decl
->find_with_hash (&in
, DECL_UID (from
));
6952 /* Insert a mapping FROM->empty vector of debug arguments in the value
6953 expression hashtable. */
6956 decl_debug_args_insert (tree from
)
6958 struct tree_vec_map
*h
;
6961 if (DECL_HAS_DEBUG_ARGS_P (from
))
6962 return decl_debug_args_lookup (from
);
6963 if (debug_args_for_decl
== NULL
)
6964 debug_args_for_decl
= hash_table
<tree_vec_map_cache_hasher
>::create_ggc (64);
6965 h
= ggc_alloc
<tree_vec_map
> ();
6966 h
->base
.from
= from
;
6968 loc
= debug_args_for_decl
->find_slot_with_hash (h
, DECL_UID (from
), INSERT
);
6970 DECL_HAS_DEBUG_ARGS_P (from
) = 1;
6974 /* Hashing of types so that we don't make duplicates.
6975 The entry point is `type_hash_canon'. */
6977 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
6978 with types in the TREE_VALUE slots), by adding the hash codes
6979 of the individual types. */
6982 type_hash_list (const_tree list
, inchash::hash
&hstate
)
6986 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
6987 if (TREE_VALUE (tail
) != error_mark_node
)
6988 hstate
.add_object (TYPE_HASH (TREE_VALUE (tail
)));
6991 /* These are the Hashtable callback functions. */
6993 /* Returns true iff the types are equivalent. */
6996 type_cache_hasher::equal (type_hash
*a
, type_hash
*b
)
6998 /* First test the things that are the same for all types. */
6999 if (a
->hash
!= b
->hash
7000 || TREE_CODE (a
->type
) != TREE_CODE (b
->type
)
7001 || TREE_TYPE (a
->type
) != TREE_TYPE (b
->type
)
7002 || !attribute_list_equal (TYPE_ATTRIBUTES (a
->type
),
7003 TYPE_ATTRIBUTES (b
->type
))
7004 || (TREE_CODE (a
->type
) != COMPLEX_TYPE
7005 && TYPE_NAME (a
->type
) != TYPE_NAME (b
->type
)))
7008 /* Be careful about comparing arrays before and after the element type
7009 has been completed; don't compare TYPE_ALIGN unless both types are
7011 if (COMPLETE_TYPE_P (a
->type
) && COMPLETE_TYPE_P (b
->type
)
7012 && (TYPE_ALIGN (a
->type
) != TYPE_ALIGN (b
->type
)
7013 || TYPE_MODE (a
->type
) != TYPE_MODE (b
->type
)))
7016 switch (TREE_CODE (a
->type
))
7021 case REFERENCE_TYPE
:
7026 return TYPE_VECTOR_SUBPARTS (a
->type
) == TYPE_VECTOR_SUBPARTS (b
->type
);
7029 if (TYPE_VALUES (a
->type
) != TYPE_VALUES (b
->type
)
7030 && !(TYPE_VALUES (a
->type
)
7031 && TREE_CODE (TYPE_VALUES (a
->type
)) == TREE_LIST
7032 && TYPE_VALUES (b
->type
)
7033 && TREE_CODE (TYPE_VALUES (b
->type
)) == TREE_LIST
7034 && type_list_equal (TYPE_VALUES (a
->type
),
7035 TYPE_VALUES (b
->type
))))
7038 /* ... fall through ... */
7043 if (TYPE_PRECISION (a
->type
) != TYPE_PRECISION (b
->type
))
7045 return ((TYPE_MAX_VALUE (a
->type
) == TYPE_MAX_VALUE (b
->type
)
7046 || tree_int_cst_equal (TYPE_MAX_VALUE (a
->type
),
7047 TYPE_MAX_VALUE (b
->type
)))
7048 && (TYPE_MIN_VALUE (a
->type
) == TYPE_MIN_VALUE (b
->type
)
7049 || tree_int_cst_equal (TYPE_MIN_VALUE (a
->type
),
7050 TYPE_MIN_VALUE (b
->type
))));
7052 case FIXED_POINT_TYPE
:
7053 return TYPE_SATURATING (a
->type
) == TYPE_SATURATING (b
->type
);
7056 return TYPE_OFFSET_BASETYPE (a
->type
) == TYPE_OFFSET_BASETYPE (b
->type
);
7059 if (TYPE_METHOD_BASETYPE (a
->type
) == TYPE_METHOD_BASETYPE (b
->type
)
7060 && (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
7061 || (TYPE_ARG_TYPES (a
->type
)
7062 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
7063 && TYPE_ARG_TYPES (b
->type
)
7064 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
7065 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
7066 TYPE_ARG_TYPES (b
->type
)))))
7070 return TYPE_DOMAIN (a
->type
) == TYPE_DOMAIN (b
->type
);
7074 case QUAL_UNION_TYPE
:
7075 return (TYPE_FIELDS (a
->type
) == TYPE_FIELDS (b
->type
)
7076 || (TYPE_FIELDS (a
->type
)
7077 && TREE_CODE (TYPE_FIELDS (a
->type
)) == TREE_LIST
7078 && TYPE_FIELDS (b
->type
)
7079 && TREE_CODE (TYPE_FIELDS (b
->type
)) == TREE_LIST
7080 && type_list_equal (TYPE_FIELDS (a
->type
),
7081 TYPE_FIELDS (b
->type
))));
7084 if (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
7085 || (TYPE_ARG_TYPES (a
->type
)
7086 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
7087 && TYPE_ARG_TYPES (b
->type
)
7088 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
7089 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
7090 TYPE_ARG_TYPES (b
->type
))))
7098 if (lang_hooks
.types
.type_hash_eq
!= NULL
)
7099 return lang_hooks
.types
.type_hash_eq (a
->type
, b
->type
);
7104 /* Given TYPE, and HASHCODE its hash code, return the canonical
7105 object for an identical type if one already exists.
7106 Otherwise, return TYPE, and record it as the canonical object.
7108 To use this function, first create a type of the sort you want.
7109 Then compute its hash code from the fields of the type that
7110 make it different from other similar types.
7111 Then call this function and use the value. */
7114 type_hash_canon (unsigned int hashcode
, tree type
)
7119 /* The hash table only contains main variants, so ensure that's what we're
7121 gcc_assert (TYPE_MAIN_VARIANT (type
) == type
);
7123 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
7124 must call that routine before comparing TYPE_ALIGNs. */
7130 loc
= type_hash_table
->find_slot_with_hash (&in
, hashcode
, INSERT
);
7133 tree t1
= ((type_hash
*) *loc
)->type
;
7134 gcc_assert (TYPE_MAIN_VARIANT (t1
) == t1
);
7140 struct type_hash
*h
;
7142 h
= ggc_alloc
<type_hash
> ();
7152 print_type_hash_statistics (void)
7154 fprintf (stderr
, "Type hash: size %ld, %ld elements, %f collisions\n",
7155 (long) type_hash_table
->size (),
7156 (long) type_hash_table
->elements (),
7157 type_hash_table
->collisions ());
7160 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
7161 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
7162 by adding the hash codes of the individual attributes. */
7165 attribute_hash_list (const_tree list
, inchash::hash
&hstate
)
7169 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
7170 /* ??? Do we want to add in TREE_VALUE too? */
7171 hstate
.add_object (IDENTIFIER_HASH_VALUE (get_attribute_name (tail
)));
7174 /* Given two lists of attributes, return true if list l2 is
7175 equivalent to l1. */
7178 attribute_list_equal (const_tree l1
, const_tree l2
)
7183 return attribute_list_contained (l1
, l2
)
7184 && attribute_list_contained (l2
, l1
);
7187 /* Given two lists of attributes, return true if list L2 is
7188 completely contained within L1. */
7189 /* ??? This would be faster if attribute names were stored in a canonicalized
7190 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
7191 must be used to show these elements are equivalent (which they are). */
7192 /* ??? It's not clear that attributes with arguments will always be handled
7196 attribute_list_contained (const_tree l1
, const_tree l2
)
7200 /* First check the obvious, maybe the lists are identical. */
7204 /* Maybe the lists are similar. */
7205 for (t1
= l1
, t2
= l2
;
7207 && get_attribute_name (t1
) == get_attribute_name (t2
)
7208 && TREE_VALUE (t1
) == TREE_VALUE (t2
);
7209 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
7212 /* Maybe the lists are equal. */
7213 if (t1
== 0 && t2
== 0)
7216 for (; t2
!= 0; t2
= TREE_CHAIN (t2
))
7219 /* This CONST_CAST is okay because lookup_attribute does not
7220 modify its argument and the return value is assigned to a
7222 for (attr
= lookup_ident_attribute (get_attribute_name (t2
),
7223 CONST_CAST_TREE (l1
));
7224 attr
!= NULL_TREE
&& !attribute_value_equal (t2
, attr
);
7225 attr
= lookup_ident_attribute (get_attribute_name (t2
),
7229 if (attr
== NULL_TREE
)
7236 /* Given two lists of types
7237 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
7238 return 1 if the lists contain the same types in the same order.
7239 Also, the TREE_PURPOSEs must match. */
7242 type_list_equal (const_tree l1
, const_tree l2
)
7246 for (t1
= l1
, t2
= l2
; t1
&& t2
; t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
7247 if (TREE_VALUE (t1
) != TREE_VALUE (t2
)
7248 || (TREE_PURPOSE (t1
) != TREE_PURPOSE (t2
)
7249 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
))
7250 && (TREE_TYPE (TREE_PURPOSE (t1
))
7251 == TREE_TYPE (TREE_PURPOSE (t2
))))))
7257 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
7258 given by TYPE. If the argument list accepts variable arguments,
7259 then this function counts only the ordinary arguments. */
7262 type_num_arguments (const_tree type
)
7267 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
7268 /* If the function does not take a variable number of arguments,
7269 the last element in the list will have type `void'. */
7270 if (VOID_TYPE_P (TREE_VALUE (t
)))
7278 /* Nonzero if integer constants T1 and T2
7279 represent the same constant value. */
7282 tree_int_cst_equal (const_tree t1
, const_tree t2
)
7287 if (t1
== 0 || t2
== 0)
7290 if (TREE_CODE (t1
) == INTEGER_CST
7291 && TREE_CODE (t2
) == INTEGER_CST
7292 && wi::to_widest (t1
) == wi::to_widest (t2
))
7298 /* Return true if T is an INTEGER_CST whose numerical value (extended
7299 according to TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. */
7302 tree_fits_shwi_p (const_tree t
)
7304 return (t
!= NULL_TREE
7305 && TREE_CODE (t
) == INTEGER_CST
7306 && wi::fits_shwi_p (wi::to_widest (t
)));
7309 /* Return true if T is an INTEGER_CST whose numerical value (extended
7310 according to TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. */
7313 tree_fits_uhwi_p (const_tree t
)
7315 return (t
!= NULL_TREE
7316 && TREE_CODE (t
) == INTEGER_CST
7317 && wi::fits_uhwi_p (wi::to_widest (t
)));
7320 /* T is an INTEGER_CST whose numerical value (extended according to
7321 TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. Return that
7325 tree_to_shwi (const_tree t
)
7327 gcc_assert (tree_fits_shwi_p (t
));
7328 return TREE_INT_CST_LOW (t
);
7331 /* T is an INTEGER_CST whose numerical value (extended according to
7332 TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. Return that
7335 unsigned HOST_WIDE_INT
7336 tree_to_uhwi (const_tree t
)
7338 gcc_assert (tree_fits_uhwi_p (t
));
7339 return TREE_INT_CST_LOW (t
);
7342 /* Return the most significant (sign) bit of T. */
7345 tree_int_cst_sign_bit (const_tree t
)
7347 unsigned bitno
= TYPE_PRECISION (TREE_TYPE (t
)) - 1;
7349 return wi::extract_uhwi (t
, bitno
, 1);
7352 /* Return an indication of the sign of the integer constant T.
7353 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
7354 Note that -1 will never be returned if T's type is unsigned. */
7357 tree_int_cst_sgn (const_tree t
)
7359 if (wi::eq_p (t
, 0))
7361 else if (TYPE_UNSIGNED (TREE_TYPE (t
)))
7363 else if (wi::neg_p (t
))
7369 /* Return the minimum number of bits needed to represent VALUE in a
7370 signed or unsigned type, UNSIGNEDP says which. */
7373 tree_int_cst_min_precision (tree value
, signop sgn
)
7375 /* If the value is negative, compute its negative minus 1. The latter
7376 adjustment is because the absolute value of the largest negative value
7377 is one larger than the largest positive value. This is equivalent to
7378 a bit-wise negation, so use that operation instead. */
7380 if (tree_int_cst_sgn (value
) < 0)
7381 value
= fold_build1 (BIT_NOT_EXPR
, TREE_TYPE (value
), value
);
7383 /* Return the number of bits needed, taking into account the fact
7384 that we need one more bit for a signed than unsigned type.
7385 If value is 0 or -1, the minimum precision is 1 no matter
7386 whether unsignedp is true or false. */
7388 if (integer_zerop (value
))
7391 return tree_floor_log2 (value
) + 1 + (sgn
== SIGNED
? 1 : 0) ;
7394 /* Return truthvalue of whether T1 is the same tree structure as T2.
7395 Return 1 if they are the same.
7396 Return 0 if they are understandably different.
7397 Return -1 if either contains tree structure not understood by
7401 simple_cst_equal (const_tree t1
, const_tree t2
)
7403 enum tree_code code1
, code2
;
7409 if (t1
== 0 || t2
== 0)
7412 code1
= TREE_CODE (t1
);
7413 code2
= TREE_CODE (t2
);
7415 if (CONVERT_EXPR_CODE_P (code1
) || code1
== NON_LVALUE_EXPR
)
7417 if (CONVERT_EXPR_CODE_P (code2
)
7418 || code2
== NON_LVALUE_EXPR
)
7419 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7421 return simple_cst_equal (TREE_OPERAND (t1
, 0), t2
);
7424 else if (CONVERT_EXPR_CODE_P (code2
)
7425 || code2
== NON_LVALUE_EXPR
)
7426 return simple_cst_equal (t1
, TREE_OPERAND (t2
, 0));
7434 return wi::to_widest (t1
) == wi::to_widest (t2
);
7437 return real_identical (&TREE_REAL_CST (t1
), &TREE_REAL_CST (t2
));
7440 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1
), TREE_FIXED_CST (t2
));
7443 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
7444 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
7445 TREE_STRING_LENGTH (t1
)));
7449 unsigned HOST_WIDE_INT idx
;
7450 vec
<constructor_elt
, va_gc
> *v1
= CONSTRUCTOR_ELTS (t1
);
7451 vec
<constructor_elt
, va_gc
> *v2
= CONSTRUCTOR_ELTS (t2
);
7453 if (vec_safe_length (v1
) != vec_safe_length (v2
))
7456 for (idx
= 0; idx
< vec_safe_length (v1
); ++idx
)
7457 /* ??? Should we handle also fields here? */
7458 if (!simple_cst_equal ((*v1
)[idx
].value
, (*v2
)[idx
].value
))
7464 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7467 cmp
= simple_cst_equal (CALL_EXPR_FN (t1
), CALL_EXPR_FN (t2
));
7470 if (call_expr_nargs (t1
) != call_expr_nargs (t2
))
7473 const_tree arg1
, arg2
;
7474 const_call_expr_arg_iterator iter1
, iter2
;
7475 for (arg1
= first_const_call_expr_arg (t1
, &iter1
),
7476 arg2
= first_const_call_expr_arg (t2
, &iter2
);
7478 arg1
= next_const_call_expr_arg (&iter1
),
7479 arg2
= next_const_call_expr_arg (&iter2
))
7481 cmp
= simple_cst_equal (arg1
, arg2
);
7485 return arg1
== arg2
;
7489 /* Special case: if either target is an unallocated VAR_DECL,
7490 it means that it's going to be unified with whatever the
7491 TARGET_EXPR is really supposed to initialize, so treat it
7492 as being equivalent to anything. */
7493 if ((TREE_CODE (TREE_OPERAND (t1
, 0)) == VAR_DECL
7494 && DECL_NAME (TREE_OPERAND (t1
, 0)) == NULL_TREE
7495 && !DECL_RTL_SET_P (TREE_OPERAND (t1
, 0)))
7496 || (TREE_CODE (TREE_OPERAND (t2
, 0)) == VAR_DECL
7497 && DECL_NAME (TREE_OPERAND (t2
, 0)) == NULL_TREE
7498 && !DECL_RTL_SET_P (TREE_OPERAND (t2
, 0))))
7501 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7506 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
7508 case WITH_CLEANUP_EXPR
:
7509 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7513 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t1
, 1));
7516 if (TREE_OPERAND (t1
, 1) == TREE_OPERAND (t2
, 1))
7517 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7531 /* This general rule works for most tree codes. All exceptions should be
7532 handled above. If this is a language-specific tree code, we can't
7533 trust what might be in the operand, so say we don't know
7535 if ((int) code1
>= (int) LAST_AND_UNUSED_TREE_CODE
)
7538 switch (TREE_CODE_CLASS (code1
))
7542 case tcc_comparison
:
7543 case tcc_expression
:
7547 for (i
= 0; i
< TREE_CODE_LENGTH (code1
); i
++)
7549 cmp
= simple_cst_equal (TREE_OPERAND (t1
, i
), TREE_OPERAND (t2
, i
));
7561 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
7562 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
7563 than U, respectively. */
7566 compare_tree_int (const_tree t
, unsigned HOST_WIDE_INT u
)
7568 if (tree_int_cst_sgn (t
) < 0)
7570 else if (!tree_fits_uhwi_p (t
))
7572 else if (TREE_INT_CST_LOW (t
) == u
)
7574 else if (TREE_INT_CST_LOW (t
) < u
)
7580 /* Return true if SIZE represents a constant size that is in bounds of
7581 what the middle-end and the backend accepts (covering not more than
7582 half of the address-space). */
7585 valid_constant_size_p (const_tree size
)
7587 if (! tree_fits_uhwi_p (size
)
7588 || TREE_OVERFLOW (size
)
7589 || tree_int_cst_sign_bit (size
) != 0)
7594 /* Return the precision of the type, or for a complex or vector type the
7595 precision of the type of its elements. */
7598 element_precision (const_tree type
)
7601 type
= TREE_TYPE (type
);
7602 enum tree_code code
= TREE_CODE (type
);
7603 if (code
== COMPLEX_TYPE
|| code
== VECTOR_TYPE
)
7604 type
= TREE_TYPE (type
);
7606 return TYPE_PRECISION (type
);
7609 /* Return true if CODE represents an associative tree code. Otherwise
7612 associative_tree_code (enum tree_code code
)
7631 /* Return true if CODE represents a commutative tree code. Otherwise
7634 commutative_tree_code (enum tree_code code
)
7640 case MULT_HIGHPART_EXPR
:
7648 case UNORDERED_EXPR
:
7652 case TRUTH_AND_EXPR
:
7653 case TRUTH_XOR_EXPR
:
7655 case WIDEN_MULT_EXPR
:
7656 case VEC_WIDEN_MULT_HI_EXPR
:
7657 case VEC_WIDEN_MULT_LO_EXPR
:
7658 case VEC_WIDEN_MULT_EVEN_EXPR
:
7659 case VEC_WIDEN_MULT_ODD_EXPR
:
7668 /* Return true if CODE represents a ternary tree code for which the
7669 first two operands are commutative. Otherwise return false. */
7671 commutative_ternary_tree_code (enum tree_code code
)
7675 case WIDEN_MULT_PLUS_EXPR
:
7676 case WIDEN_MULT_MINUS_EXPR
:
7687 /* Returns true if CODE can overflow. */
7690 operation_can_overflow (enum tree_code code
)
7698 /* Can overflow in various ways. */
7700 case TRUNC_DIV_EXPR
:
7701 case EXACT_DIV_EXPR
:
7702 case FLOOR_DIV_EXPR
:
7704 /* For INT_MIN / -1. */
7711 /* These operators cannot overflow. */
7716 /* Returns true if CODE operating on operands of type TYPE doesn't overflow, or
7717 ftrapv doesn't generate trapping insns for CODE. */
7720 operation_no_trapping_overflow (tree type
, enum tree_code code
)
7722 gcc_checking_assert (ANY_INTEGRAL_TYPE_P (type
));
7724 /* We don't generate instructions that trap on overflow for complex or vector
7726 if (!INTEGRAL_TYPE_P (type
))
7729 if (!TYPE_OVERFLOW_TRAPS (type
))
7739 /* These operators can overflow, and -ftrapv generates trapping code for
7742 case TRUNC_DIV_EXPR
:
7743 case EXACT_DIV_EXPR
:
7744 case FLOOR_DIV_EXPR
:
7747 /* These operators can overflow, but -ftrapv does not generate trapping
7751 /* These operators cannot overflow. */
7759 /* Generate a hash value for an expression. This can be used iteratively
7760 by passing a previous result as the HSTATE argument.
7762 This function is intended to produce the same hash for expressions which
7763 would compare equal using operand_equal_p. */
7765 add_expr (const_tree t
, inchash::hash
&hstate
, unsigned int flags
)
7768 enum tree_code code
;
7769 enum tree_code_class tclass
;
7773 hstate
.merge_hash (0);
7777 if (!(flags
& OEP_ADDRESS_OF
))
7780 code
= TREE_CODE (t
);
7784 /* Alas, constants aren't shared, so we can't rely on pointer
7787 hstate
.merge_hash (0);
7790 gcc_checking_assert (!(flags
& OEP_ADDRESS_OF
));
7791 for (i
= 0; i
< TREE_INT_CST_EXT_NUNITS (t
); i
++)
7792 hstate
.add_wide_int (TREE_INT_CST_ELT (t
, i
));
7797 if (!HONOR_SIGNED_ZEROS (t
) && real_zerop (t
))
7800 val2
= real_hash (TREE_REAL_CST_PTR (t
));
7801 hstate
.merge_hash (val2
);
7806 unsigned int val2
= fixed_hash (TREE_FIXED_CST_PTR (t
));
7807 hstate
.merge_hash (val2
);
7811 hstate
.add ((const void *) TREE_STRING_POINTER (t
),
7812 TREE_STRING_LENGTH (t
));
7815 inchash::add_expr (TREE_REALPART (t
), hstate
, flags
);
7816 inchash::add_expr (TREE_IMAGPART (t
), hstate
, flags
);
7821 for (i
= 0; i
< VECTOR_CST_NELTS (t
); ++i
)
7822 inchash::add_expr (VECTOR_CST_ELT (t
, i
), hstate
, flags
);
7826 /* We can just compare by pointer. */
7827 hstate
.add_wide_int (SSA_NAME_VERSION (t
));
7829 case PLACEHOLDER_EXPR
:
7830 /* The node itself doesn't matter. */
7837 /* A list of expressions, for a CALL_EXPR or as the elements of a
7839 for (; t
; t
= TREE_CHAIN (t
))
7840 inchash::add_expr (TREE_VALUE (t
), hstate
, flags
);
7844 unsigned HOST_WIDE_INT idx
;
7846 flags
&= ~OEP_ADDRESS_OF
;
7847 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t
), idx
, field
, value
)
7849 inchash::add_expr (field
, hstate
, flags
);
7850 inchash::add_expr (value
, hstate
, flags
);
7854 case STATEMENT_LIST
:
7856 tree_stmt_iterator i
;
7857 for (i
= tsi_start (CONST_CAST_TREE (t
));
7858 !tsi_end_p (i
); tsi_next (&i
))
7859 inchash::add_expr (tsi_stmt (i
), hstate
, flags
);
7863 /* When referring to a built-in FUNCTION_DECL, use the __builtin__ form.
7864 Otherwise nodes that compare equal according to operand_equal_p might
7865 get different hash codes. However, don't do this for machine specific
7866 or front end builtins, since the function code is overloaded in those
7868 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
7869 && builtin_decl_explicit_p (DECL_FUNCTION_CODE (t
)))
7871 t
= builtin_decl_explicit (DECL_FUNCTION_CODE (t
));
7872 code
= TREE_CODE (t
);
7876 tclass
= TREE_CODE_CLASS (code
);
7878 if (tclass
== tcc_declaration
)
7880 /* DECL's have a unique ID */
7881 hstate
.add_wide_int (DECL_UID (t
));
7883 else if (tclass
== tcc_comparison
&& !commutative_tree_code (code
))
7885 /* For comparisons that can be swapped, use the lower
7887 enum tree_code ccode
= swap_tree_comparison (code
);
7890 hstate
.add_object (ccode
);
7891 inchash::add_expr (TREE_OPERAND (t
, ccode
!= code
), hstate
, flags
);
7892 inchash::add_expr (TREE_OPERAND (t
, ccode
== code
), hstate
, flags
);
7894 else if (CONVERT_EXPR_CODE_P (code
))
7896 /* NOP_EXPR and CONVERT_EXPR are considered equal by
7898 enum tree_code ccode
= NOP_EXPR
;
7899 hstate
.add_object (ccode
);
7901 /* Don't hash the type, that can lead to having nodes which
7902 compare equal according to operand_equal_p, but which
7903 have different hash codes. Make sure to include signedness
7904 in the hash computation. */
7905 hstate
.add_int (TYPE_UNSIGNED (TREE_TYPE (t
)));
7906 inchash::add_expr (TREE_OPERAND (t
, 0), hstate
, flags
);
7908 /* For OEP_ADDRESS_OF, hash MEM_EXPR[&decl, 0] the same as decl. */
7909 else if (code
== MEM_REF
7910 && (flags
& OEP_ADDRESS_OF
) != 0
7911 && TREE_CODE (TREE_OPERAND (t
, 0)) == ADDR_EXPR
7912 && DECL_P (TREE_OPERAND (TREE_OPERAND (t
, 0), 0))
7913 && integer_zerop (TREE_OPERAND (t
, 1)))
7914 inchash::add_expr (TREE_OPERAND (TREE_OPERAND (t
, 0), 0),
7916 /* Don't ICE on FE specific trees, or their arguments etc.
7917 during operand_equal_p hash verification. */
7918 else if (!IS_EXPR_CODE_CLASS (tclass
))
7919 gcc_assert (flags
& OEP_HASH_CHECK
);
7922 unsigned int sflags
= flags
;
7924 hstate
.add_object (code
);
7929 gcc_checking_assert (!(flags
& OEP_ADDRESS_OF
));
7930 flags
|= OEP_ADDRESS_OF
;
7936 case TARGET_MEM_REF
:
7937 flags
&= ~OEP_ADDRESS_OF
;
7942 case ARRAY_RANGE_REF
:
7945 sflags
&= ~OEP_ADDRESS_OF
;
7949 flags
&= ~OEP_ADDRESS_OF
;
7953 case WIDEN_MULT_PLUS_EXPR
:
7954 case WIDEN_MULT_MINUS_EXPR
:
7956 /* The multiplication operands are commutative. */
7957 inchash::hash one
, two
;
7958 inchash::add_expr (TREE_OPERAND (t
, 0), one
, flags
);
7959 inchash::add_expr (TREE_OPERAND (t
, 1), two
, flags
);
7960 hstate
.add_commutative (one
, two
);
7961 inchash::add_expr (TREE_OPERAND (t
, 2), two
, flags
);
7966 if (CALL_EXPR_FN (t
) == NULL_TREE
)
7967 hstate
.add_int (CALL_EXPR_IFN (t
));
7971 /* For TARGET_EXPR, just hash on the TARGET_EXPR_SLOT.
7972 Usually different TARGET_EXPRs just should use
7973 different temporaries in their slots. */
7974 inchash::add_expr (TARGET_EXPR_SLOT (t
), hstate
, flags
);
7981 /* Don't hash the type, that can lead to having nodes which
7982 compare equal according to operand_equal_p, but which
7983 have different hash codes. */
7984 if (code
== NON_LVALUE_EXPR
)
7986 /* Make sure to include signness in the hash computation. */
7987 hstate
.add_int (TYPE_UNSIGNED (TREE_TYPE (t
)));
7988 inchash::add_expr (TREE_OPERAND (t
, 0), hstate
, flags
);
7991 else if (commutative_tree_code (code
))
7993 /* It's a commutative expression. We want to hash it the same
7994 however it appears. We do this by first hashing both operands
7995 and then rehashing based on the order of their independent
7997 inchash::hash one
, two
;
7998 inchash::add_expr (TREE_OPERAND (t
, 0), one
, flags
);
7999 inchash::add_expr (TREE_OPERAND (t
, 1), two
, flags
);
8000 hstate
.add_commutative (one
, two
);
8003 for (i
= TREE_OPERAND_LENGTH (t
) - 1; i
>= 0; --i
)
8004 inchash::add_expr (TREE_OPERAND (t
, i
), hstate
,
8005 i
== 0 ? flags
: sflags
);
8013 /* Constructors for pointer, array and function types.
8014 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
8015 constructed by language-dependent code, not here.) */
8017 /* Construct, lay out and return the type of pointers to TO_TYPE with
8018 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
8019 reference all of memory. If such a type has already been
8020 constructed, reuse it. */
8023 build_pointer_type_for_mode (tree to_type
, machine_mode mode
,
8027 bool could_alias
= can_alias_all
;
8029 if (to_type
== error_mark_node
)
8030 return error_mark_node
;
8032 /* If the pointed-to type has the may_alias attribute set, force
8033 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
8034 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
8035 can_alias_all
= true;
8037 /* In some cases, languages will have things that aren't a POINTER_TYPE
8038 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
8039 In that case, return that type without regard to the rest of our
8042 ??? This is a kludge, but consistent with the way this function has
8043 always operated and there doesn't seem to be a good way to avoid this
8045 if (TYPE_POINTER_TO (to_type
) != 0
8046 && TREE_CODE (TYPE_POINTER_TO (to_type
)) != POINTER_TYPE
)
8047 return TYPE_POINTER_TO (to_type
);
8049 /* First, if we already have a type for pointers to TO_TYPE and it's
8050 the proper mode, use it. */
8051 for (t
= TYPE_POINTER_TO (to_type
); t
; t
= TYPE_NEXT_PTR_TO (t
))
8052 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
8055 t
= make_node (POINTER_TYPE
);
8057 TREE_TYPE (t
) = to_type
;
8058 SET_TYPE_MODE (t
, mode
);
8059 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
8060 TYPE_NEXT_PTR_TO (t
) = TYPE_POINTER_TO (to_type
);
8061 TYPE_POINTER_TO (to_type
) = t
;
8063 /* During LTO we do not set TYPE_CANONICAL of pointers and references. */
8064 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
) || in_lto_p
)
8065 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8066 else if (TYPE_CANONICAL (to_type
) != to_type
|| could_alias
)
8068 = build_pointer_type_for_mode (TYPE_CANONICAL (to_type
),
8071 /* Lay out the type. This function has many callers that are concerned
8072 with expression-construction, and this simplifies them all. */
8078 /* By default build pointers in ptr_mode. */
8081 build_pointer_type (tree to_type
)
8083 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
8084 : TYPE_ADDR_SPACE (to_type
);
8085 machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
8086 return build_pointer_type_for_mode (to_type
, pointer_mode
, false);
8089 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
8092 build_reference_type_for_mode (tree to_type
, machine_mode mode
,
8096 bool could_alias
= can_alias_all
;
8098 if (to_type
== error_mark_node
)
8099 return error_mark_node
;
8101 /* If the pointed-to type has the may_alias attribute set, force
8102 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
8103 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
8104 can_alias_all
= true;
8106 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
8107 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
8108 In that case, return that type without regard to the rest of our
8111 ??? This is a kludge, but consistent with the way this function has
8112 always operated and there doesn't seem to be a good way to avoid this
8114 if (TYPE_REFERENCE_TO (to_type
) != 0
8115 && TREE_CODE (TYPE_REFERENCE_TO (to_type
)) != REFERENCE_TYPE
)
8116 return TYPE_REFERENCE_TO (to_type
);
8118 /* First, if we already have a type for pointers to TO_TYPE and it's
8119 the proper mode, use it. */
8120 for (t
= TYPE_REFERENCE_TO (to_type
); t
; t
= TYPE_NEXT_REF_TO (t
))
8121 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
8124 t
= make_node (REFERENCE_TYPE
);
8126 TREE_TYPE (t
) = to_type
;
8127 SET_TYPE_MODE (t
, mode
);
8128 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
8129 TYPE_NEXT_REF_TO (t
) = TYPE_REFERENCE_TO (to_type
);
8130 TYPE_REFERENCE_TO (to_type
) = t
;
8132 /* During LTO we do not set TYPE_CANONICAL of pointers and references. */
8133 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
) || in_lto_p
)
8134 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8135 else if (TYPE_CANONICAL (to_type
) != to_type
|| could_alias
)
8137 = build_reference_type_for_mode (TYPE_CANONICAL (to_type
),
8146 /* Build the node for the type of references-to-TO_TYPE by default
8150 build_reference_type (tree to_type
)
8152 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
8153 : TYPE_ADDR_SPACE (to_type
);
8154 machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
8155 return build_reference_type_for_mode (to_type
, pointer_mode
, false);
8158 #define MAX_INT_CACHED_PREC \
8159 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
8160 static GTY(()) tree nonstandard_integer_type_cache
[2 * MAX_INT_CACHED_PREC
+ 2];
8162 /* Builds a signed or unsigned integer type of precision PRECISION.
8163 Used for C bitfields whose precision does not match that of
8164 built-in target types. */
8166 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision
,
8172 unsignedp
= MAX_INT_CACHED_PREC
+ 1;
8174 if (precision
<= MAX_INT_CACHED_PREC
)
8176 itype
= nonstandard_integer_type_cache
[precision
+ unsignedp
];
8181 itype
= make_node (INTEGER_TYPE
);
8182 TYPE_PRECISION (itype
) = precision
;
8185 fixup_unsigned_type (itype
);
8187 fixup_signed_type (itype
);
8190 if (tree_fits_uhwi_p (TYPE_MAX_VALUE (itype
)))
8191 ret
= type_hash_canon (tree_to_uhwi (TYPE_MAX_VALUE (itype
)), itype
);
8192 if (precision
<= MAX_INT_CACHED_PREC
)
8193 nonstandard_integer_type_cache
[precision
+ unsignedp
] = ret
;
8198 #define MAX_BOOL_CACHED_PREC \
8199 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
8200 static GTY(()) tree nonstandard_boolean_type_cache
[MAX_BOOL_CACHED_PREC
+ 1];
8202 /* Builds a boolean type of precision PRECISION.
8203 Used for boolean vectors to choose proper vector element size. */
8205 build_nonstandard_boolean_type (unsigned HOST_WIDE_INT precision
)
8209 if (precision
<= MAX_BOOL_CACHED_PREC
)
8211 type
= nonstandard_boolean_type_cache
[precision
];
8216 type
= make_node (BOOLEAN_TYPE
);
8217 TYPE_PRECISION (type
) = precision
;
8218 fixup_signed_type (type
);
8220 if (precision
<= MAX_INT_CACHED_PREC
)
8221 nonstandard_boolean_type_cache
[precision
] = type
;
8226 /* Create a range of some discrete type TYPE (an INTEGER_TYPE, ENUMERAL_TYPE
8227 or BOOLEAN_TYPE) with low bound LOWVAL and high bound HIGHVAL. If SHARED
8228 is true, reuse such a type that has already been constructed. */
8231 build_range_type_1 (tree type
, tree lowval
, tree highval
, bool shared
)
8233 tree itype
= make_node (INTEGER_TYPE
);
8234 inchash::hash hstate
;
8236 TREE_TYPE (itype
) = type
;
8238 TYPE_MIN_VALUE (itype
) = fold_convert (type
, lowval
);
8239 TYPE_MAX_VALUE (itype
) = highval
? fold_convert (type
, highval
) : NULL
;
8241 TYPE_PRECISION (itype
) = TYPE_PRECISION (type
);
8242 SET_TYPE_MODE (itype
, TYPE_MODE (type
));
8243 TYPE_SIZE (itype
) = TYPE_SIZE (type
);
8244 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (type
);
8245 SET_TYPE_ALIGN (itype
, TYPE_ALIGN (type
));
8246 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (type
);
8251 if ((TYPE_MIN_VALUE (itype
)
8252 && TREE_CODE (TYPE_MIN_VALUE (itype
)) != INTEGER_CST
)
8253 || (TYPE_MAX_VALUE (itype
)
8254 && TREE_CODE (TYPE_MAX_VALUE (itype
)) != INTEGER_CST
))
8256 /* Since we cannot reliably merge this type, we need to compare it using
8257 structural equality checks. */
8258 SET_TYPE_STRUCTURAL_EQUALITY (itype
);
8262 inchash::add_expr (TYPE_MIN_VALUE (itype
), hstate
);
8263 inchash::add_expr (TYPE_MAX_VALUE (itype
), hstate
);
8264 hstate
.merge_hash (TYPE_HASH (type
));
8265 itype
= type_hash_canon (hstate
.end (), itype
);
8270 /* Wrapper around build_range_type_1 with SHARED set to true. */
8273 build_range_type (tree type
, tree lowval
, tree highval
)
8275 return build_range_type_1 (type
, lowval
, highval
, true);
8278 /* Wrapper around build_range_type_1 with SHARED set to false. */
8281 build_nonshared_range_type (tree type
, tree lowval
, tree highval
)
8283 return build_range_type_1 (type
, lowval
, highval
, false);
8286 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
8287 MAXVAL should be the maximum value in the domain
8288 (one less than the length of the array).
8290 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
8291 We don't enforce this limit, that is up to caller (e.g. language front end).
8292 The limit exists because the result is a signed type and we don't handle
8293 sizes that use more than one HOST_WIDE_INT. */
8296 build_index_type (tree maxval
)
8298 return build_range_type (sizetype
, size_zero_node
, maxval
);
8301 /* Return true if the debug information for TYPE, a subtype, should be emitted
8302 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
8303 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
8304 debug info and doesn't reflect the source code. */
8307 subrange_type_for_debug_p (const_tree type
, tree
*lowval
, tree
*highval
)
8309 tree base_type
= TREE_TYPE (type
), low
, high
;
8311 /* Subrange types have a base type which is an integral type. */
8312 if (!INTEGRAL_TYPE_P (base_type
))
8315 /* Get the real bounds of the subtype. */
8316 if (lang_hooks
.types
.get_subrange_bounds
)
8317 lang_hooks
.types
.get_subrange_bounds (type
, &low
, &high
);
8320 low
= TYPE_MIN_VALUE (type
);
8321 high
= TYPE_MAX_VALUE (type
);
8324 /* If the type and its base type have the same representation and the same
8325 name, then the type is not a subrange but a copy of the base type. */
8326 if ((TREE_CODE (base_type
) == INTEGER_TYPE
8327 || TREE_CODE (base_type
) == BOOLEAN_TYPE
)
8328 && int_size_in_bytes (type
) == int_size_in_bytes (base_type
)
8329 && tree_int_cst_equal (low
, TYPE_MIN_VALUE (base_type
))
8330 && tree_int_cst_equal (high
, TYPE_MAX_VALUE (base_type
))
8331 && TYPE_IDENTIFIER (type
) == TYPE_IDENTIFIER (base_type
))
8341 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
8342 and number of elements specified by the range of values of INDEX_TYPE.
8343 If SHARED is true, reuse such a type that has already been constructed. */
8346 build_array_type_1 (tree elt_type
, tree index_type
, bool shared
)
8350 if (TREE_CODE (elt_type
) == FUNCTION_TYPE
)
8352 error ("arrays of functions are not meaningful");
8353 elt_type
= integer_type_node
;
8356 t
= make_node (ARRAY_TYPE
);
8357 TREE_TYPE (t
) = elt_type
;
8358 TYPE_DOMAIN (t
) = index_type
;
8359 TYPE_ADDR_SPACE (t
) = TYPE_ADDR_SPACE (elt_type
);
8362 /* If the element type is incomplete at this point we get marked for
8363 structural equality. Do not record these types in the canonical
8365 if (TYPE_STRUCTURAL_EQUALITY_P (t
))
8370 inchash::hash hstate
;
8371 hstate
.add_object (TYPE_HASH (elt_type
));
8373 hstate
.add_object (TYPE_HASH (index_type
));
8374 t
= type_hash_canon (hstate
.end (), t
);
8377 if (TYPE_CANONICAL (t
) == t
)
8379 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type
)
8380 || (index_type
&& TYPE_STRUCTURAL_EQUALITY_P (index_type
))
8382 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8383 else if (TYPE_CANONICAL (elt_type
) != elt_type
8384 || (index_type
&& TYPE_CANONICAL (index_type
) != index_type
))
8386 = build_array_type_1 (TYPE_CANONICAL (elt_type
),
8388 ? TYPE_CANONICAL (index_type
) : NULL_TREE
,
8395 /* Wrapper around build_array_type_1 with SHARED set to true. */
8398 build_array_type (tree elt_type
, tree index_type
)
8400 return build_array_type_1 (elt_type
, index_type
, true);
8403 /* Wrapper around build_array_type_1 with SHARED set to false. */
8406 build_nonshared_array_type (tree elt_type
, tree index_type
)
8408 return build_array_type_1 (elt_type
, index_type
, false);
8411 /* Return a representation of ELT_TYPE[NELTS], using indices of type
8415 build_array_type_nelts (tree elt_type
, unsigned HOST_WIDE_INT nelts
)
8417 return build_array_type (elt_type
, build_index_type (size_int (nelts
- 1)));
8420 /* Recursively examines the array elements of TYPE, until a non-array
8421 element type is found. */
8424 strip_array_types (tree type
)
8426 while (TREE_CODE (type
) == ARRAY_TYPE
)
8427 type
= TREE_TYPE (type
);
8432 /* Computes the canonical argument types from the argument type list
8435 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
8436 on entry to this function, or if any of the ARGTYPES are
8439 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
8440 true on entry to this function, or if any of the ARGTYPES are
8443 Returns a canonical argument list, which may be ARGTYPES when the
8444 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
8445 true) or would not differ from ARGTYPES. */
8448 maybe_canonicalize_argtypes (tree argtypes
,
8449 bool *any_structural_p
,
8450 bool *any_noncanonical_p
)
8453 bool any_noncanonical_argtypes_p
= false;
8455 for (arg
= argtypes
; arg
&& !(*any_structural_p
); arg
= TREE_CHAIN (arg
))
8457 if (!TREE_VALUE (arg
) || TREE_VALUE (arg
) == error_mark_node
)
8458 /* Fail gracefully by stating that the type is structural. */
8459 *any_structural_p
= true;
8460 else if (TYPE_STRUCTURAL_EQUALITY_P (TREE_VALUE (arg
)))
8461 *any_structural_p
= true;
8462 else if (TYPE_CANONICAL (TREE_VALUE (arg
)) != TREE_VALUE (arg
)
8463 || TREE_PURPOSE (arg
))
8464 /* If the argument has a default argument, we consider it
8465 non-canonical even though the type itself is canonical.
8466 That way, different variants of function and method types
8467 with default arguments will all point to the variant with
8468 no defaults as their canonical type. */
8469 any_noncanonical_argtypes_p
= true;
8472 if (*any_structural_p
)
8475 if (any_noncanonical_argtypes_p
)
8477 /* Build the canonical list of argument types. */
8478 tree canon_argtypes
= NULL_TREE
;
8479 bool is_void
= false;
8481 for (arg
= argtypes
; arg
; arg
= TREE_CHAIN (arg
))
8483 if (arg
== void_list_node
)
8486 canon_argtypes
= tree_cons (NULL_TREE
,
8487 TYPE_CANONICAL (TREE_VALUE (arg
)),
8491 canon_argtypes
= nreverse (canon_argtypes
);
8493 canon_argtypes
= chainon (canon_argtypes
, void_list_node
);
8495 /* There is a non-canonical type. */
8496 *any_noncanonical_p
= true;
8497 return canon_argtypes
;
8500 /* The canonical argument types are the same as ARGTYPES. */
8504 /* Construct, lay out and return
8505 the type of functions returning type VALUE_TYPE
8506 given arguments of types ARG_TYPES.
8507 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
8508 are data type nodes for the arguments of the function.
8509 If such a type has already been constructed, reuse it. */
8512 build_function_type (tree value_type
, tree arg_types
)
8515 inchash::hash hstate
;
8516 bool any_structural_p
, any_noncanonical_p
;
8517 tree canon_argtypes
;
8519 if (TREE_CODE (value_type
) == FUNCTION_TYPE
)
8521 error ("function return type cannot be function");
8522 value_type
= integer_type_node
;
8525 /* Make a node of the sort we want. */
8526 t
= make_node (FUNCTION_TYPE
);
8527 TREE_TYPE (t
) = value_type
;
8528 TYPE_ARG_TYPES (t
) = arg_types
;
8530 /* If we already have such a type, use the old one. */
8531 hstate
.add_object (TYPE_HASH (value_type
));
8532 type_hash_list (arg_types
, hstate
);
8533 t
= type_hash_canon (hstate
.end (), t
);
8535 /* Set up the canonical type. */
8536 any_structural_p
= TYPE_STRUCTURAL_EQUALITY_P (value_type
);
8537 any_noncanonical_p
= TYPE_CANONICAL (value_type
) != value_type
;
8538 canon_argtypes
= maybe_canonicalize_argtypes (arg_types
,
8540 &any_noncanonical_p
);
8541 if (any_structural_p
)
8542 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8543 else if (any_noncanonical_p
)
8544 TYPE_CANONICAL (t
) = build_function_type (TYPE_CANONICAL (value_type
),
8547 if (!COMPLETE_TYPE_P (t
))
8552 /* Build a function type. The RETURN_TYPE is the type returned by the
8553 function. If VAARGS is set, no void_type_node is appended to the
8554 list. ARGP must be always be terminated be a NULL_TREE. */
8557 build_function_type_list_1 (bool vaargs
, tree return_type
, va_list argp
)
8561 t
= va_arg (argp
, tree
);
8562 for (args
= NULL_TREE
; t
!= NULL_TREE
; t
= va_arg (argp
, tree
))
8563 args
= tree_cons (NULL_TREE
, t
, args
);
8568 if (args
!= NULL_TREE
)
8569 args
= nreverse (args
);
8570 gcc_assert (last
!= void_list_node
);
8572 else if (args
== NULL_TREE
)
8573 args
= void_list_node
;
8577 args
= nreverse (args
);
8578 TREE_CHAIN (last
) = void_list_node
;
8580 args
= build_function_type (return_type
, args
);
8585 /* Build a function type. The RETURN_TYPE is the type returned by the
8586 function. If additional arguments are provided, they are
8587 additional argument types. The list of argument types must always
8588 be terminated by NULL_TREE. */
8591 build_function_type_list (tree return_type
, ...)
8596 va_start (p
, return_type
);
8597 args
= build_function_type_list_1 (false, return_type
, p
);
8602 /* Build a variable argument function type. The RETURN_TYPE is the
8603 type returned by the function. If additional arguments are provided,
8604 they are additional argument types. The list of argument types must
8605 always be terminated by NULL_TREE. */
8608 build_varargs_function_type_list (tree return_type
, ...)
8613 va_start (p
, return_type
);
8614 args
= build_function_type_list_1 (true, return_type
, p
);
8620 /* Build a function type. RETURN_TYPE is the type returned by the
8621 function; VAARGS indicates whether the function takes varargs. The
8622 function takes N named arguments, the types of which are provided in
8626 build_function_type_array_1 (bool vaargs
, tree return_type
, int n
,
8630 tree t
= vaargs
? NULL_TREE
: void_list_node
;
8632 for (i
= n
- 1; i
>= 0; i
--)
8633 t
= tree_cons (NULL_TREE
, arg_types
[i
], t
);
8635 return build_function_type (return_type
, t
);
8638 /* Build a function type. RETURN_TYPE is the type returned by the
8639 function. The function takes N named arguments, the types of which
8640 are provided in ARG_TYPES. */
8643 build_function_type_array (tree return_type
, int n
, tree
*arg_types
)
8645 return build_function_type_array_1 (false, return_type
, n
, arg_types
);
8648 /* Build a variable argument function type. RETURN_TYPE is the type
8649 returned by the function. The function takes N named arguments, the
8650 types of which are provided in ARG_TYPES. */
8653 build_varargs_function_type_array (tree return_type
, int n
, tree
*arg_types
)
8655 return build_function_type_array_1 (true, return_type
, n
, arg_types
);
8658 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
8659 and ARGTYPES (a TREE_LIST) are the return type and arguments types
8660 for the method. An implicit additional parameter (of type
8661 pointer-to-BASETYPE) is added to the ARGTYPES. */
8664 build_method_type_directly (tree basetype
,
8670 inchash::hash hstate
;
8671 bool any_structural_p
, any_noncanonical_p
;
8672 tree canon_argtypes
;
8674 /* Make a node of the sort we want. */
8675 t
= make_node (METHOD_TYPE
);
8677 TYPE_METHOD_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
8678 TREE_TYPE (t
) = rettype
;
8679 ptype
= build_pointer_type (basetype
);
8681 /* The actual arglist for this function includes a "hidden" argument
8682 which is "this". Put it into the list of argument types. */
8683 argtypes
= tree_cons (NULL_TREE
, ptype
, argtypes
);
8684 TYPE_ARG_TYPES (t
) = argtypes
;
8686 /* If we already have such a type, use the old one. */
8687 hstate
.add_object (TYPE_HASH (basetype
));
8688 hstate
.add_object (TYPE_HASH (rettype
));
8689 type_hash_list (argtypes
, hstate
);
8690 t
= type_hash_canon (hstate
.end (), t
);
8692 /* Set up the canonical type. */
8694 = (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
8695 || TYPE_STRUCTURAL_EQUALITY_P (rettype
));
8697 = (TYPE_CANONICAL (basetype
) != basetype
8698 || TYPE_CANONICAL (rettype
) != rettype
);
8699 canon_argtypes
= maybe_canonicalize_argtypes (TREE_CHAIN (argtypes
),
8701 &any_noncanonical_p
);
8702 if (any_structural_p
)
8703 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8704 else if (any_noncanonical_p
)
8706 = build_method_type_directly (TYPE_CANONICAL (basetype
),
8707 TYPE_CANONICAL (rettype
),
8709 if (!COMPLETE_TYPE_P (t
))
8715 /* Construct, lay out and return the type of methods belonging to class
8716 BASETYPE and whose arguments and values are described by TYPE.
8717 If that type exists already, reuse it.
8718 TYPE must be a FUNCTION_TYPE node. */
8721 build_method_type (tree basetype
, tree type
)
8723 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
8725 return build_method_type_directly (basetype
,
8727 TYPE_ARG_TYPES (type
));
8730 /* Construct, lay out and return the type of offsets to a value
8731 of type TYPE, within an object of type BASETYPE.
8732 If a suitable offset type exists already, reuse it. */
8735 build_offset_type (tree basetype
, tree type
)
8738 inchash::hash hstate
;
8740 /* Make a node of the sort we want. */
8741 t
= make_node (OFFSET_TYPE
);
8743 TYPE_OFFSET_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
8744 TREE_TYPE (t
) = type
;
8746 /* If we already have such a type, use the old one. */
8747 hstate
.add_object (TYPE_HASH (basetype
));
8748 hstate
.add_object (TYPE_HASH (type
));
8749 t
= type_hash_canon (hstate
.end (), t
);
8751 if (!COMPLETE_TYPE_P (t
))
8754 if (TYPE_CANONICAL (t
) == t
)
8756 if (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
8757 || TYPE_STRUCTURAL_EQUALITY_P (type
))
8758 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8759 else if (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)) != basetype
8760 || TYPE_CANONICAL (type
) != type
)
8762 = build_offset_type (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)),
8763 TYPE_CANONICAL (type
));
8769 /* Create a complex type whose components are COMPONENT_TYPE. */
8772 build_complex_type (tree component_type
)
8775 inchash::hash hstate
;
8777 gcc_assert (INTEGRAL_TYPE_P (component_type
)
8778 || SCALAR_FLOAT_TYPE_P (component_type
)
8779 || FIXED_POINT_TYPE_P (component_type
));
8781 /* Make a node of the sort we want. */
8782 t
= make_node (COMPLEX_TYPE
);
8784 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (component_type
);
8785 SET_TYPE_MODE (t
, GET_MODE_COMPLEX_MODE (TYPE_MODE (component_type
)));
8787 /* If we already have such a type, use the old one. */
8788 hstate
.add_object (TYPE_HASH (component_type
));
8789 t
= type_hash_canon (hstate
.end (), t
);
8791 if (!COMPLETE_TYPE_P (t
))
8794 if (TYPE_CANONICAL (t
) == t
)
8796 if (TYPE_STRUCTURAL_EQUALITY_P (component_type
))
8797 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8798 else if (TYPE_CANONICAL (component_type
) != component_type
)
8800 = build_complex_type (TYPE_CANONICAL (component_type
));
8803 /* We need to create a name, since complex is a fundamental type. */
8804 if (! TYPE_NAME (t
))
8807 if (component_type
== char_type_node
)
8808 name
= "complex char";
8809 else if (component_type
== signed_char_type_node
)
8810 name
= "complex signed char";
8811 else if (component_type
== unsigned_char_type_node
)
8812 name
= "complex unsigned char";
8813 else if (component_type
== short_integer_type_node
)
8814 name
= "complex short int";
8815 else if (component_type
== short_unsigned_type_node
)
8816 name
= "complex short unsigned int";
8817 else if (component_type
== integer_type_node
)
8818 name
= "complex int";
8819 else if (component_type
== unsigned_type_node
)
8820 name
= "complex unsigned int";
8821 else if (component_type
== long_integer_type_node
)
8822 name
= "complex long int";
8823 else if (component_type
== long_unsigned_type_node
)
8824 name
= "complex long unsigned int";
8825 else if (component_type
== long_long_integer_type_node
)
8826 name
= "complex long long int";
8827 else if (component_type
== long_long_unsigned_type_node
)
8828 name
= "complex long long unsigned int";
8833 TYPE_NAME (t
) = build_decl (UNKNOWN_LOCATION
, TYPE_DECL
,
8834 get_identifier (name
), t
);
8837 return build_qualified_type (t
, TYPE_QUALS (component_type
));
8840 /* If TYPE is a real or complex floating-point type and the target
8841 does not directly support arithmetic on TYPE then return the wider
8842 type to be used for arithmetic on TYPE. Otherwise, return
8846 excess_precision_type (tree type
)
8848 if (flag_excess_precision
!= EXCESS_PRECISION_FAST
)
8850 int flt_eval_method
= TARGET_FLT_EVAL_METHOD
;
8851 switch (TREE_CODE (type
))
8854 switch (flt_eval_method
)
8857 if (TYPE_MODE (type
) == TYPE_MODE (float_type_node
))
8858 return double_type_node
;
8861 if (TYPE_MODE (type
) == TYPE_MODE (float_type_node
)
8862 || TYPE_MODE (type
) == TYPE_MODE (double_type_node
))
8863 return long_double_type_node
;
8870 if (TREE_CODE (TREE_TYPE (type
)) != REAL_TYPE
)
8872 switch (flt_eval_method
)
8875 if (TYPE_MODE (TREE_TYPE (type
)) == TYPE_MODE (float_type_node
))
8876 return complex_double_type_node
;
8879 if (TYPE_MODE (TREE_TYPE (type
)) == TYPE_MODE (float_type_node
)
8880 || (TYPE_MODE (TREE_TYPE (type
))
8881 == TYPE_MODE (double_type_node
)))
8882 return complex_long_double_type_node
;
8895 /* Return OP, stripped of any conversions to wider types as much as is safe.
8896 Converting the value back to OP's type makes a value equivalent to OP.
8898 If FOR_TYPE is nonzero, we return a value which, if converted to
8899 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
8901 OP must have integer, real or enumeral type. Pointers are not allowed!
8903 There are some cases where the obvious value we could return
8904 would regenerate to OP if converted to OP's type,
8905 but would not extend like OP to wider types.
8906 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
8907 For example, if OP is (unsigned short)(signed char)-1,
8908 we avoid returning (signed char)-1 if FOR_TYPE is int,
8909 even though extending that to an unsigned short would regenerate OP,
8910 since the result of extending (signed char)-1 to (int)
8911 is different from (int) OP. */
8914 get_unwidened (tree op
, tree for_type
)
8916 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
8917 tree type
= TREE_TYPE (op
);
8919 = TYPE_PRECISION (for_type
!= 0 ? for_type
: type
);
8921 = (for_type
!= 0 && for_type
!= type
8922 && final_prec
> TYPE_PRECISION (type
)
8923 && TYPE_UNSIGNED (type
));
8926 while (CONVERT_EXPR_P (op
))
8930 /* TYPE_PRECISION on vector types has different meaning
8931 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
8932 so avoid them here. */
8933 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op
, 0))) == VECTOR_TYPE
)
8936 bitschange
= TYPE_PRECISION (TREE_TYPE (op
))
8937 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0)));
8939 /* Truncations are many-one so cannot be removed.
8940 Unless we are later going to truncate down even farther. */
8942 && final_prec
> TYPE_PRECISION (TREE_TYPE (op
)))
8945 /* See what's inside this conversion. If we decide to strip it,
8947 op
= TREE_OPERAND (op
, 0);
8949 /* If we have not stripped any zero-extensions (uns is 0),
8950 we can strip any kind of extension.
8951 If we have previously stripped a zero-extension,
8952 only zero-extensions can safely be stripped.
8953 Any extension can be stripped if the bits it would produce
8954 are all going to be discarded later by truncating to FOR_TYPE. */
8958 if (! uns
|| final_prec
<= TYPE_PRECISION (TREE_TYPE (op
)))
8960 /* TYPE_UNSIGNED says whether this is a zero-extension.
8961 Let's avoid computing it if it does not affect WIN
8962 and if UNS will not be needed again. */
8964 || CONVERT_EXPR_P (op
))
8965 && TYPE_UNSIGNED (TREE_TYPE (op
)))
8973 /* If we finally reach a constant see if it fits in for_type and
8974 in that case convert it. */
8976 && TREE_CODE (win
) == INTEGER_CST
8977 && TREE_TYPE (win
) != for_type
8978 && int_fits_type_p (win
, for_type
))
8979 win
= fold_convert (for_type
, win
);
8984 /* Return OP or a simpler expression for a narrower value
8985 which can be sign-extended or zero-extended to give back OP.
8986 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
8987 or 0 if the value should be sign-extended. */
8990 get_narrower (tree op
, int *unsignedp_ptr
)
8995 bool integral_p
= INTEGRAL_TYPE_P (TREE_TYPE (op
));
8997 while (TREE_CODE (op
) == NOP_EXPR
)
9000 = (TYPE_PRECISION (TREE_TYPE (op
))
9001 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0))));
9003 /* Truncations are many-one so cannot be removed. */
9007 /* See what's inside this conversion. If we decide to strip it,
9012 op
= TREE_OPERAND (op
, 0);
9013 /* An extension: the outermost one can be stripped,
9014 but remember whether it is zero or sign extension. */
9016 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
9017 /* Otherwise, if a sign extension has been stripped,
9018 only sign extensions can now be stripped;
9019 if a zero extension has been stripped, only zero-extensions. */
9020 else if (uns
!= TYPE_UNSIGNED (TREE_TYPE (op
)))
9024 else /* bitschange == 0 */
9026 /* A change in nominal type can always be stripped, but we must
9027 preserve the unsignedness. */
9029 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
9031 op
= TREE_OPERAND (op
, 0);
9032 /* Keep trying to narrow, but don't assign op to win if it
9033 would turn an integral type into something else. */
9034 if (INTEGRAL_TYPE_P (TREE_TYPE (op
)) != integral_p
)
9041 if (TREE_CODE (op
) == COMPONENT_REF
9042 /* Since type_for_size always gives an integer type. */
9043 && TREE_CODE (TREE_TYPE (op
)) != REAL_TYPE
9044 && TREE_CODE (TREE_TYPE (op
)) != FIXED_POINT_TYPE
9045 /* Ensure field is laid out already. */
9046 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0
9047 && tree_fits_uhwi_p (DECL_SIZE (TREE_OPERAND (op
, 1))))
9049 unsigned HOST_WIDE_INT innerprec
9050 = tree_to_uhwi (DECL_SIZE (TREE_OPERAND (op
, 1)));
9051 int unsignedp
= (DECL_UNSIGNED (TREE_OPERAND (op
, 1))
9052 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op
, 1))));
9053 tree type
= lang_hooks
.types
.type_for_size (innerprec
, unsignedp
);
9055 /* We can get this structure field in a narrower type that fits it,
9056 but the resulting extension to its nominal type (a fullword type)
9057 must satisfy the same conditions as for other extensions.
9059 Do this only for fields that are aligned (not bit-fields),
9060 because when bit-field insns will be used there is no
9061 advantage in doing this. */
9063 if (innerprec
< TYPE_PRECISION (TREE_TYPE (op
))
9064 && ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1))
9065 && (first
|| uns
== DECL_UNSIGNED (TREE_OPERAND (op
, 1)))
9069 uns
= DECL_UNSIGNED (TREE_OPERAND (op
, 1));
9070 win
= fold_convert (type
, op
);
9074 *unsignedp_ptr
= uns
;
9078 /* Returns true if integer constant C has a value that is permissible
9079 for type TYPE (an INTEGER_TYPE). */
9082 int_fits_type_p (const_tree c
, const_tree type
)
9084 tree type_low_bound
, type_high_bound
;
9085 bool ok_for_low_bound
, ok_for_high_bound
;
9086 signop sgn_c
= TYPE_SIGN (TREE_TYPE (c
));
9089 type_low_bound
= TYPE_MIN_VALUE (type
);
9090 type_high_bound
= TYPE_MAX_VALUE (type
);
9092 /* If at least one bound of the type is a constant integer, we can check
9093 ourselves and maybe make a decision. If no such decision is possible, but
9094 this type is a subtype, try checking against that. Otherwise, use
9095 fits_to_tree_p, which checks against the precision.
9097 Compute the status for each possibly constant bound, and return if we see
9098 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
9099 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
9100 for "constant known to fit". */
9102 /* Check if c >= type_low_bound. */
9103 if (type_low_bound
&& TREE_CODE (type_low_bound
) == INTEGER_CST
)
9105 if (tree_int_cst_lt (c
, type_low_bound
))
9107 ok_for_low_bound
= true;
9110 ok_for_low_bound
= false;
9112 /* Check if c <= type_high_bound. */
9113 if (type_high_bound
&& TREE_CODE (type_high_bound
) == INTEGER_CST
)
9115 if (tree_int_cst_lt (type_high_bound
, c
))
9117 ok_for_high_bound
= true;
9120 ok_for_high_bound
= false;
9122 /* If the constant fits both bounds, the result is known. */
9123 if (ok_for_low_bound
&& ok_for_high_bound
)
9126 /* Perform some generic filtering which may allow making a decision
9127 even if the bounds are not constant. First, negative integers
9128 never fit in unsigned types, */
9129 if (TYPE_UNSIGNED (type
) && sgn_c
== SIGNED
&& wi::neg_p (c
))
9132 /* Second, narrower types always fit in wider ones. */
9133 if (TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (c
)))
9136 /* Third, unsigned integers with top bit set never fit signed types. */
9137 if (!TYPE_UNSIGNED (type
) && sgn_c
== UNSIGNED
)
9139 int prec
= GET_MODE_PRECISION (TYPE_MODE (TREE_TYPE (c
))) - 1;
9140 if (prec
< TYPE_PRECISION (TREE_TYPE (c
)))
9142 /* When a tree_cst is converted to a wide-int, the precision
9143 is taken from the type. However, if the precision of the
9144 mode underneath the type is smaller than that, it is
9145 possible that the value will not fit. The test below
9146 fails if any bit is set between the sign bit of the
9147 underlying mode and the top bit of the type. */
9148 if (wi::ne_p (wi::zext (c
, prec
- 1), c
))
9151 else if (wi::neg_p (c
))
9155 /* If we haven't been able to decide at this point, there nothing more we
9156 can check ourselves here. Look at the base type if we have one and it
9157 has the same precision. */
9158 if (TREE_CODE (type
) == INTEGER_TYPE
9159 && TREE_TYPE (type
) != 0
9160 && TYPE_PRECISION (type
) == TYPE_PRECISION (TREE_TYPE (type
)))
9162 type
= TREE_TYPE (type
);
9166 /* Or to fits_to_tree_p, if nothing else. */
9167 return wi::fits_to_tree_p (c
, type
);
9170 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
9171 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
9172 represented (assuming two's-complement arithmetic) within the bit
9173 precision of the type are returned instead. */
9176 get_type_static_bounds (const_tree type
, mpz_t min
, mpz_t max
)
9178 if (!POINTER_TYPE_P (type
) && TYPE_MIN_VALUE (type
)
9179 && TREE_CODE (TYPE_MIN_VALUE (type
)) == INTEGER_CST
)
9180 wi::to_mpz (TYPE_MIN_VALUE (type
), min
, TYPE_SIGN (type
));
9183 if (TYPE_UNSIGNED (type
))
9184 mpz_set_ui (min
, 0);
9187 wide_int mn
= wi::min_value (TYPE_PRECISION (type
), SIGNED
);
9188 wi::to_mpz (mn
, min
, SIGNED
);
9192 if (!POINTER_TYPE_P (type
) && TYPE_MAX_VALUE (type
)
9193 && TREE_CODE (TYPE_MAX_VALUE (type
)) == INTEGER_CST
)
9194 wi::to_mpz (TYPE_MAX_VALUE (type
), max
, TYPE_SIGN (type
));
9197 wide_int mn
= wi::max_value (TYPE_PRECISION (type
), TYPE_SIGN (type
));
9198 wi::to_mpz (mn
, max
, TYPE_SIGN (type
));
9202 /* Return true if VAR is an automatic variable defined in function FN. */
9205 auto_var_in_fn_p (const_tree var
, const_tree fn
)
9207 return (DECL_P (var
) && DECL_CONTEXT (var
) == fn
9208 && ((((TREE_CODE (var
) == VAR_DECL
&& ! DECL_EXTERNAL (var
))
9209 || TREE_CODE (var
) == PARM_DECL
)
9210 && ! TREE_STATIC (var
))
9211 || TREE_CODE (var
) == LABEL_DECL
9212 || TREE_CODE (var
) == RESULT_DECL
));
9215 /* Subprogram of following function. Called by walk_tree.
9217 Return *TP if it is an automatic variable or parameter of the
9218 function passed in as DATA. */
9221 find_var_from_fn (tree
*tp
, int *walk_subtrees
, void *data
)
9223 tree fn
= (tree
) data
;
9228 else if (DECL_P (*tp
)
9229 && auto_var_in_fn_p (*tp
, fn
))
9235 /* Returns true if T is, contains, or refers to a type with variable
9236 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
9237 arguments, but not the return type. If FN is nonzero, only return
9238 true if a modifier of the type or position of FN is a variable or
9239 parameter inside FN.
9241 This concept is more general than that of C99 'variably modified types':
9242 in C99, a struct type is never variably modified because a VLA may not
9243 appear as a structure member. However, in GNU C code like:
9245 struct S { int i[f()]; };
9247 is valid, and other languages may define similar constructs. */
9250 variably_modified_type_p (tree type
, tree fn
)
9254 /* Test if T is either variable (if FN is zero) or an expression containing
9255 a variable in FN. If TYPE isn't gimplified, return true also if
9256 gimplify_one_sizepos would gimplify the expression into a local
9258 #define RETURN_TRUE_IF_VAR(T) \
9259 do { tree _t = (T); \
9260 if (_t != NULL_TREE \
9261 && _t != error_mark_node \
9262 && TREE_CODE (_t) != INTEGER_CST \
9263 && TREE_CODE (_t) != PLACEHOLDER_EXPR \
9265 || (!TYPE_SIZES_GIMPLIFIED (type) \
9266 && !is_gimple_sizepos (_t)) \
9267 || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
9268 return true; } while (0)
9270 if (type
== error_mark_node
)
9273 /* If TYPE itself has variable size, it is variably modified. */
9274 RETURN_TRUE_IF_VAR (TYPE_SIZE (type
));
9275 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type
));
9277 switch (TREE_CODE (type
))
9280 case REFERENCE_TYPE
:
9282 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
9288 /* If TYPE is a function type, it is variably modified if the
9289 return type is variably modified. */
9290 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
9296 case FIXED_POINT_TYPE
:
9299 /* Scalar types are variably modified if their end points
9301 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type
));
9302 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type
));
9307 case QUAL_UNION_TYPE
:
9308 /* We can't see if any of the fields are variably-modified by the
9309 definition we normally use, since that would produce infinite
9310 recursion via pointers. */
9311 /* This is variably modified if some field's type is. */
9312 for (t
= TYPE_FIELDS (type
); t
; t
= DECL_CHAIN (t
))
9313 if (TREE_CODE (t
) == FIELD_DECL
)
9315 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t
));
9316 RETURN_TRUE_IF_VAR (DECL_SIZE (t
));
9317 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t
));
9319 if (TREE_CODE (type
) == QUAL_UNION_TYPE
)
9320 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t
));
9325 /* Do not call ourselves to avoid infinite recursion. This is
9326 variably modified if the element type is. */
9327 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type
)));
9328 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type
)));
9335 /* The current language may have other cases to check, but in general,
9336 all other types are not variably modified. */
9337 return lang_hooks
.tree_inlining
.var_mod_type_p (type
, fn
);
9339 #undef RETURN_TRUE_IF_VAR
9342 /* Given a DECL or TYPE, return the scope in which it was declared, or
9343 NULL_TREE if there is no containing scope. */
9346 get_containing_scope (const_tree t
)
9348 return (TYPE_P (t
) ? TYPE_CONTEXT (t
) : DECL_CONTEXT (t
));
9351 /* Return the innermost context enclosing DECL that is
9352 a FUNCTION_DECL, or zero if none. */
9355 decl_function_context (const_tree decl
)
9359 if (TREE_CODE (decl
) == ERROR_MARK
)
9362 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
9363 where we look up the function at runtime. Such functions always take
9364 a first argument of type 'pointer to real context'.
9366 C++ should really be fixed to use DECL_CONTEXT for the real context,
9367 and use something else for the "virtual context". */
9368 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VINDEX (decl
))
9371 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl
)))));
9373 context
= DECL_CONTEXT (decl
);
9375 while (context
&& TREE_CODE (context
) != FUNCTION_DECL
)
9377 if (TREE_CODE (context
) == BLOCK
)
9378 context
= BLOCK_SUPERCONTEXT (context
);
9380 context
= get_containing_scope (context
);
9386 /* Return the innermost context enclosing DECL that is
9387 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
9388 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
9391 decl_type_context (const_tree decl
)
9393 tree context
= DECL_CONTEXT (decl
);
9396 switch (TREE_CODE (context
))
9398 case NAMESPACE_DECL
:
9399 case TRANSLATION_UNIT_DECL
:
9404 case QUAL_UNION_TYPE
:
9409 context
= DECL_CONTEXT (context
);
9413 context
= BLOCK_SUPERCONTEXT (context
);
9423 /* CALL is a CALL_EXPR. Return the declaration for the function
9424 called, or NULL_TREE if the called function cannot be
9428 get_callee_fndecl (const_tree call
)
9432 if (call
== error_mark_node
)
9433 return error_mark_node
;
9435 /* It's invalid to call this function with anything but a
9437 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
9439 /* The first operand to the CALL is the address of the function
9441 addr
= CALL_EXPR_FN (call
);
9443 /* If there is no function, return early. */
9444 if (addr
== NULL_TREE
)
9449 /* If this is a readonly function pointer, extract its initial value. */
9450 if (DECL_P (addr
) && TREE_CODE (addr
) != FUNCTION_DECL
9451 && TREE_READONLY (addr
) && ! TREE_THIS_VOLATILE (addr
)
9452 && DECL_INITIAL (addr
))
9453 addr
= DECL_INITIAL (addr
);
9455 /* If the address is just `&f' for some function `f', then we know
9456 that `f' is being called. */
9457 if (TREE_CODE (addr
) == ADDR_EXPR
9458 && TREE_CODE (TREE_OPERAND (addr
, 0)) == FUNCTION_DECL
)
9459 return TREE_OPERAND (addr
, 0);
9461 /* We couldn't figure out what was being called. */
9465 /* If CALL_EXPR CALL calls a normal built-in function or an internal function,
9466 return the associated function code, otherwise return CFN_LAST. */
9469 get_call_combined_fn (const_tree call
)
9471 /* It's invalid to call this function with anything but a CALL_EXPR. */
9472 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
9474 if (!CALL_EXPR_FN (call
))
9475 return as_combined_fn (CALL_EXPR_IFN (call
));
9477 tree fndecl
= get_callee_fndecl (call
);
9478 if (fndecl
&& DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
)
9479 return as_combined_fn (DECL_FUNCTION_CODE (fndecl
));
9484 #define TREE_MEM_USAGE_SPACES 40
9486 /* Print debugging information about tree nodes generated during the compile,
9487 and any language-specific information. */
9490 dump_tree_statistics (void)
9492 if (GATHER_STATISTICS
)
9495 int total_nodes
, total_bytes
;
9496 fprintf (stderr
, "\nKind Nodes Bytes\n");
9497 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9498 total_nodes
= total_bytes
= 0;
9499 for (i
= 0; i
< (int) all_kinds
; i
++)
9501 fprintf (stderr
, "%-20s %7d %10d\n", tree_node_kind_names
[i
],
9502 tree_node_counts
[i
], tree_node_sizes
[i
]);
9503 total_nodes
+= tree_node_counts
[i
];
9504 total_bytes
+= tree_node_sizes
[i
];
9506 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9507 fprintf (stderr
, "%-20s %7d %10d\n", "Total", total_nodes
, total_bytes
);
9508 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9509 fprintf (stderr
, "Code Nodes\n");
9510 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9511 for (i
= 0; i
< (int) MAX_TREE_CODES
; i
++)
9512 fprintf (stderr
, "%-32s %7d\n", get_tree_code_name ((enum tree_code
) i
),
9513 tree_code_counts
[i
]);
9514 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9515 fprintf (stderr
, "\n");
9516 ssanames_print_statistics ();
9517 fprintf (stderr
, "\n");
9518 phinodes_print_statistics ();
9519 fprintf (stderr
, "\n");
9522 fprintf (stderr
, "(No per-node statistics)\n");
9524 print_type_hash_statistics ();
9525 print_debug_expr_statistics ();
9526 print_value_expr_statistics ();
9527 lang_hooks
.print_statistics ();
9530 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
9532 /* Generate a crc32 of a byte. */
9535 crc32_unsigned_bits (unsigned chksum
, unsigned value
, unsigned bits
)
9539 for (ix
= bits
; ix
--; value
<<= 1)
9543 feedback
= (value
^ chksum
) & 0x80000000 ? 0x04c11db7 : 0;
9550 /* Generate a crc32 of a 32-bit unsigned. */
9553 crc32_unsigned (unsigned chksum
, unsigned value
)
9555 return crc32_unsigned_bits (chksum
, value
, 32);
9558 /* Generate a crc32 of a byte. */
9561 crc32_byte (unsigned chksum
, char byte
)
9563 return crc32_unsigned_bits (chksum
, (unsigned) byte
<< 24, 8);
9566 /* Generate a crc32 of a string. */
9569 crc32_string (unsigned chksum
, const char *string
)
9573 chksum
= crc32_byte (chksum
, *string
);
9579 /* P is a string that will be used in a symbol. Mask out any characters
9580 that are not valid in that context. */
9583 clean_symbol_name (char *p
)
9587 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
9590 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
9597 /* For anonymous aggregate types, we need some sort of name to
9598 hold on to. In practice, this should not appear, but it should
9599 not be harmful if it does. */
9601 anon_aggrname_p(const_tree id_node
)
9603 #ifndef NO_DOT_IN_LABEL
9604 return (IDENTIFIER_POINTER (id_node
)[0] == '.'
9605 && IDENTIFIER_POINTER (id_node
)[1] == '_');
9606 #else /* NO_DOT_IN_LABEL */
9607 #ifndef NO_DOLLAR_IN_LABEL
9608 return (IDENTIFIER_POINTER (id_node
)[0] == '$' \
9609 && IDENTIFIER_POINTER (id_node
)[1] == '_');
9610 #else /* NO_DOLLAR_IN_LABEL */
9611 #define ANON_AGGRNAME_PREFIX "__anon_"
9612 return (!strncmp (IDENTIFIER_POINTER (id_node
), ANON_AGGRNAME_PREFIX
,
9613 sizeof (ANON_AGGRNAME_PREFIX
) - 1));
9614 #endif /* NO_DOLLAR_IN_LABEL */
9615 #endif /* NO_DOT_IN_LABEL */
9618 /* Return a format for an anonymous aggregate name. */
9620 anon_aggrname_format()
9622 #ifndef NO_DOT_IN_LABEL
9624 #else /* NO_DOT_IN_LABEL */
9625 #ifndef NO_DOLLAR_IN_LABEL
9627 #else /* NO_DOLLAR_IN_LABEL */
9629 #endif /* NO_DOLLAR_IN_LABEL */
9630 #endif /* NO_DOT_IN_LABEL */
9633 /* Generate a name for a special-purpose function.
9634 The generated name may need to be unique across the whole link.
9635 Changes to this function may also require corresponding changes to
9636 xstrdup_mask_random.
9637 TYPE is some string to identify the purpose of this function to the
9638 linker or collect2; it must start with an uppercase letter,
9640 I - for constructors
9642 N - for C++ anonymous namespaces
9643 F - for DWARF unwind frame information. */
9646 get_file_function_name (const char *type
)
9652 /* If we already have a name we know to be unique, just use that. */
9653 if (first_global_object_name
)
9654 p
= q
= ASTRDUP (first_global_object_name
);
9655 /* If the target is handling the constructors/destructors, they
9656 will be local to this file and the name is only necessary for
9658 We also assign sub_I and sub_D sufixes to constructors called from
9659 the global static constructors. These are always local. */
9660 else if (((type
[0] == 'I' || type
[0] == 'D') && targetm
.have_ctors_dtors
)
9661 || (strncmp (type
, "sub_", 4) == 0
9662 && (type
[4] == 'I' || type
[4] == 'D')))
9664 const char *file
= main_input_filename
;
9666 file
= LOCATION_FILE (input_location
);
9667 /* Just use the file's basename, because the full pathname
9668 might be quite long. */
9669 p
= q
= ASTRDUP (lbasename (file
));
9673 /* Otherwise, the name must be unique across the entire link.
9674 We don't have anything that we know to be unique to this translation
9675 unit, so use what we do have and throw in some randomness. */
9677 const char *name
= weak_global_object_name
;
9678 const char *file
= main_input_filename
;
9683 file
= LOCATION_FILE (input_location
);
9685 len
= strlen (file
);
9686 q
= (char *) alloca (9 + 17 + len
+ 1);
9687 memcpy (q
, file
, len
+ 1);
9689 snprintf (q
+ len
, 9 + 17 + 1, "_%08X_" HOST_WIDE_INT_PRINT_HEX
,
9690 crc32_string (0, name
), get_random_seed (false));
9695 clean_symbol_name (q
);
9696 buf
= (char *) alloca (sizeof (FILE_FUNCTION_FORMAT
) + strlen (p
)
9699 /* Set up the name of the file-level functions we may need.
9700 Use a global object (which is already required to be unique over
9701 the program) rather than the file name (which imposes extra
9703 sprintf (buf
, FILE_FUNCTION_FORMAT
, type
, p
);
9705 return get_identifier (buf
);
9708 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
9710 /* Complain that the tree code of NODE does not match the expected 0
9711 terminated list of trailing codes. The trailing code list can be
9712 empty, for a more vague error message. FILE, LINE, and FUNCTION
9713 are of the caller. */
9716 tree_check_failed (const_tree node
, const char *file
,
9717 int line
, const char *function
, ...)
9721 unsigned length
= 0;
9722 enum tree_code code
;
9724 va_start (args
, function
);
9725 while ((code
= (enum tree_code
) va_arg (args
, int)))
9726 length
+= 4 + strlen (get_tree_code_name (code
));
9731 va_start (args
, function
);
9732 length
+= strlen ("expected ");
9733 buffer
= tmp
= (char *) alloca (length
);
9735 while ((code
= (enum tree_code
) va_arg (args
, int)))
9737 const char *prefix
= length
? " or " : "expected ";
9739 strcpy (tmp
+ length
, prefix
);
9740 length
+= strlen (prefix
);
9741 strcpy (tmp
+ length
, get_tree_code_name (code
));
9742 length
+= strlen (get_tree_code_name (code
));
9747 buffer
= "unexpected node";
9749 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9750 buffer
, get_tree_code_name (TREE_CODE (node
)),
9751 function
, trim_filename (file
), line
);
9754 /* Complain that the tree code of NODE does match the expected 0
9755 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
9759 tree_not_check_failed (const_tree node
, const char *file
,
9760 int line
, const char *function
, ...)
9764 unsigned length
= 0;
9765 enum tree_code code
;
9767 va_start (args
, function
);
9768 while ((code
= (enum tree_code
) va_arg (args
, int)))
9769 length
+= 4 + strlen (get_tree_code_name (code
));
9771 va_start (args
, function
);
9772 buffer
= (char *) alloca (length
);
9774 while ((code
= (enum tree_code
) va_arg (args
, int)))
9778 strcpy (buffer
+ length
, " or ");
9781 strcpy (buffer
+ length
, get_tree_code_name (code
));
9782 length
+= strlen (get_tree_code_name (code
));
9786 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
9787 buffer
, get_tree_code_name (TREE_CODE (node
)),
9788 function
, trim_filename (file
), line
);
9791 /* Similar to tree_check_failed, except that we check for a class of tree
9792 code, given in CL. */
9795 tree_class_check_failed (const_tree node
, const enum tree_code_class cl
,
9796 const char *file
, int line
, const char *function
)
9799 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
9800 TREE_CODE_CLASS_STRING (cl
),
9801 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
9802 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9805 /* Similar to tree_check_failed, except that instead of specifying a
9806 dozen codes, use the knowledge that they're all sequential. */
9809 tree_range_check_failed (const_tree node
, const char *file
, int line
,
9810 const char *function
, enum tree_code c1
,
9814 unsigned length
= 0;
9817 for (c
= c1
; c
<= c2
; ++c
)
9818 length
+= 4 + strlen (get_tree_code_name ((enum tree_code
) c
));
9820 length
+= strlen ("expected ");
9821 buffer
= (char *) alloca (length
);
9824 for (c
= c1
; c
<= c2
; ++c
)
9826 const char *prefix
= length
? " or " : "expected ";
9828 strcpy (buffer
+ length
, prefix
);
9829 length
+= strlen (prefix
);
9830 strcpy (buffer
+ length
, get_tree_code_name ((enum tree_code
) c
));
9831 length
+= strlen (get_tree_code_name ((enum tree_code
) c
));
9834 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9835 buffer
, get_tree_code_name (TREE_CODE (node
)),
9836 function
, trim_filename (file
), line
);
9840 /* Similar to tree_check_failed, except that we check that a tree does
9841 not have the specified code, given in CL. */
9844 tree_not_class_check_failed (const_tree node
, const enum tree_code_class cl
,
9845 const char *file
, int line
, const char *function
)
9848 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
9849 TREE_CODE_CLASS_STRING (cl
),
9850 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
9851 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9855 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
9858 omp_clause_check_failed (const_tree node
, const char *file
, int line
,
9859 const char *function
, enum omp_clause_code code
)
9861 internal_error ("tree check: expected omp_clause %s, have %s in %s, at %s:%d",
9862 omp_clause_code_name
[code
], get_tree_code_name (TREE_CODE (node
)),
9863 function
, trim_filename (file
), line
);
9867 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
9870 omp_clause_range_check_failed (const_tree node
, const char *file
, int line
,
9871 const char *function
, enum omp_clause_code c1
,
9872 enum omp_clause_code c2
)
9875 unsigned length
= 0;
9878 for (c
= c1
; c
<= c2
; ++c
)
9879 length
+= 4 + strlen (omp_clause_code_name
[c
]);
9881 length
+= strlen ("expected ");
9882 buffer
= (char *) alloca (length
);
9885 for (c
= c1
; c
<= c2
; ++c
)
9887 const char *prefix
= length
? " or " : "expected ";
9889 strcpy (buffer
+ length
, prefix
);
9890 length
+= strlen (prefix
);
9891 strcpy (buffer
+ length
, omp_clause_code_name
[c
]);
9892 length
+= strlen (omp_clause_code_name
[c
]);
9895 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9896 buffer
, omp_clause_code_name
[TREE_CODE (node
)],
9897 function
, trim_filename (file
), line
);
9901 #undef DEFTREESTRUCT
9902 #define DEFTREESTRUCT(VAL, NAME) NAME,
9904 static const char *ts_enum_names
[] = {
9905 #include "treestruct.def"
9907 #undef DEFTREESTRUCT
9909 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
9911 /* Similar to tree_class_check_failed, except that we check for
9912 whether CODE contains the tree structure identified by EN. */
9915 tree_contains_struct_check_failed (const_tree node
,
9916 const enum tree_node_structure_enum en
,
9917 const char *file
, int line
,
9918 const char *function
)
9921 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
9923 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9927 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9928 (dynamically sized) vector. */
9931 tree_int_cst_elt_check_failed (int idx
, int len
, const char *file
, int line
,
9932 const char *function
)
9935 ("tree check: accessed elt %d of tree_int_cst with %d elts in %s, at %s:%d",
9936 idx
+ 1, len
, function
, trim_filename (file
), line
);
9939 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9940 (dynamically sized) vector. */
9943 tree_vec_elt_check_failed (int idx
, int len
, const char *file
, int line
,
9944 const char *function
)
9947 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
9948 idx
+ 1, len
, function
, trim_filename (file
), line
);
9951 /* Similar to above, except that the check is for the bounds of the operand
9952 vector of an expression node EXP. */
9955 tree_operand_check_failed (int idx
, const_tree exp
, const char *file
,
9956 int line
, const char *function
)
9958 enum tree_code code
= TREE_CODE (exp
);
9960 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
9961 idx
+ 1, get_tree_code_name (code
), TREE_OPERAND_LENGTH (exp
),
9962 function
, trim_filename (file
), line
);
9965 /* Similar to above, except that the check is for the number of
9966 operands of an OMP_CLAUSE node. */
9969 omp_clause_operand_check_failed (int idx
, const_tree t
, const char *file
,
9970 int line
, const char *function
)
9973 ("tree check: accessed operand %d of omp_clause %s with %d operands "
9974 "in %s, at %s:%d", idx
+ 1, omp_clause_code_name
[OMP_CLAUSE_CODE (t
)],
9975 omp_clause_num_ops
[OMP_CLAUSE_CODE (t
)], function
,
9976 trim_filename (file
), line
);
9978 #endif /* ENABLE_TREE_CHECKING */
9980 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
9981 and mapped to the machine mode MODE. Initialize its fields and build
9982 the information necessary for debugging output. */
9985 make_vector_type (tree innertype
, int nunits
, machine_mode mode
)
9988 inchash::hash hstate
;
9989 tree mv_innertype
= TYPE_MAIN_VARIANT (innertype
);
9991 t
= make_node (VECTOR_TYPE
);
9992 TREE_TYPE (t
) = mv_innertype
;
9993 SET_TYPE_VECTOR_SUBPARTS (t
, nunits
);
9994 SET_TYPE_MODE (t
, mode
);
9996 if (TYPE_STRUCTURAL_EQUALITY_P (mv_innertype
) || in_lto_p
)
9997 SET_TYPE_STRUCTURAL_EQUALITY (t
);
9998 else if ((TYPE_CANONICAL (mv_innertype
) != innertype
9999 || mode
!= VOIDmode
)
10000 && !VECTOR_BOOLEAN_TYPE_P (t
))
10002 = make_vector_type (TYPE_CANONICAL (mv_innertype
), nunits
, VOIDmode
);
10006 hstate
.add_wide_int (VECTOR_TYPE
);
10007 hstate
.add_wide_int (nunits
);
10008 hstate
.add_wide_int (mode
);
10009 hstate
.add_object (TYPE_HASH (TREE_TYPE (t
)));
10010 t
= type_hash_canon (hstate
.end (), t
);
10012 /* We have built a main variant, based on the main variant of the
10013 inner type. Use it to build the variant we return. */
10014 if ((TYPE_ATTRIBUTES (innertype
) || TYPE_QUALS (innertype
))
10015 && TREE_TYPE (t
) != innertype
)
10016 return build_type_attribute_qual_variant (t
,
10017 TYPE_ATTRIBUTES (innertype
),
10018 TYPE_QUALS (innertype
));
10024 make_or_reuse_type (unsigned size
, int unsignedp
)
10028 if (size
== INT_TYPE_SIZE
)
10029 return unsignedp
? unsigned_type_node
: integer_type_node
;
10030 if (size
== CHAR_TYPE_SIZE
)
10031 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
10032 if (size
== SHORT_TYPE_SIZE
)
10033 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
10034 if (size
== LONG_TYPE_SIZE
)
10035 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
10036 if (size
== LONG_LONG_TYPE_SIZE
)
10037 return (unsignedp
? long_long_unsigned_type_node
10038 : long_long_integer_type_node
);
10040 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
10041 if (size
== int_n_data
[i
].bitsize
10042 && int_n_enabled_p
[i
])
10043 return (unsignedp
? int_n_trees
[i
].unsigned_type
10044 : int_n_trees
[i
].signed_type
);
10047 return make_unsigned_type (size
);
10049 return make_signed_type (size
);
10052 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
10055 make_or_reuse_fract_type (unsigned size
, int unsignedp
, int satp
)
10059 if (size
== SHORT_FRACT_TYPE_SIZE
)
10060 return unsignedp
? sat_unsigned_short_fract_type_node
10061 : sat_short_fract_type_node
;
10062 if (size
== FRACT_TYPE_SIZE
)
10063 return unsignedp
? sat_unsigned_fract_type_node
: sat_fract_type_node
;
10064 if (size
== LONG_FRACT_TYPE_SIZE
)
10065 return unsignedp
? sat_unsigned_long_fract_type_node
10066 : sat_long_fract_type_node
;
10067 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
10068 return unsignedp
? sat_unsigned_long_long_fract_type_node
10069 : sat_long_long_fract_type_node
;
10073 if (size
== SHORT_FRACT_TYPE_SIZE
)
10074 return unsignedp
? unsigned_short_fract_type_node
10075 : short_fract_type_node
;
10076 if (size
== FRACT_TYPE_SIZE
)
10077 return unsignedp
? unsigned_fract_type_node
: fract_type_node
;
10078 if (size
== LONG_FRACT_TYPE_SIZE
)
10079 return unsignedp
? unsigned_long_fract_type_node
10080 : long_fract_type_node
;
10081 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
10082 return unsignedp
? unsigned_long_long_fract_type_node
10083 : long_long_fract_type_node
;
10086 return make_fract_type (size
, unsignedp
, satp
);
10089 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
10092 make_or_reuse_accum_type (unsigned size
, int unsignedp
, int satp
)
10096 if (size
== SHORT_ACCUM_TYPE_SIZE
)
10097 return unsignedp
? sat_unsigned_short_accum_type_node
10098 : sat_short_accum_type_node
;
10099 if (size
== ACCUM_TYPE_SIZE
)
10100 return unsignedp
? sat_unsigned_accum_type_node
: sat_accum_type_node
;
10101 if (size
== LONG_ACCUM_TYPE_SIZE
)
10102 return unsignedp
? sat_unsigned_long_accum_type_node
10103 : sat_long_accum_type_node
;
10104 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
10105 return unsignedp
? sat_unsigned_long_long_accum_type_node
10106 : sat_long_long_accum_type_node
;
10110 if (size
== SHORT_ACCUM_TYPE_SIZE
)
10111 return unsignedp
? unsigned_short_accum_type_node
10112 : short_accum_type_node
;
10113 if (size
== ACCUM_TYPE_SIZE
)
10114 return unsignedp
? unsigned_accum_type_node
: accum_type_node
;
10115 if (size
== LONG_ACCUM_TYPE_SIZE
)
10116 return unsignedp
? unsigned_long_accum_type_node
10117 : long_accum_type_node
;
10118 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
10119 return unsignedp
? unsigned_long_long_accum_type_node
10120 : long_long_accum_type_node
;
10123 return make_accum_type (size
, unsignedp
, satp
);
10127 /* Create an atomic variant node for TYPE. This routine is called
10128 during initialization of data types to create the 5 basic atomic
10129 types. The generic build_variant_type function requires these to
10130 already be set up in order to function properly, so cannot be
10131 called from there. If ALIGN is non-zero, then ensure alignment is
10132 overridden to this value. */
10135 build_atomic_base (tree type
, unsigned int align
)
10139 /* Make sure its not already registered. */
10140 if ((t
= get_qualified_type (type
, TYPE_QUAL_ATOMIC
)))
10143 t
= build_variant_type_copy (type
);
10144 set_type_quals (t
, TYPE_QUAL_ATOMIC
);
10147 SET_TYPE_ALIGN (t
, align
);
10152 /* Create nodes for all integer types (and error_mark_node) using the sizes
10153 of C datatypes. SIGNED_CHAR specifies whether char is signed. */
10156 build_common_tree_nodes (bool signed_char
)
10160 error_mark_node
= make_node (ERROR_MARK
);
10161 TREE_TYPE (error_mark_node
) = error_mark_node
;
10163 initialize_sizetypes ();
10165 /* Define both `signed char' and `unsigned char'. */
10166 signed_char_type_node
= make_signed_type (CHAR_TYPE_SIZE
);
10167 TYPE_STRING_FLAG (signed_char_type_node
) = 1;
10168 unsigned_char_type_node
= make_unsigned_type (CHAR_TYPE_SIZE
);
10169 TYPE_STRING_FLAG (unsigned_char_type_node
) = 1;
10171 /* Define `char', which is like either `signed char' or `unsigned char'
10172 but not the same as either. */
10175 ? make_signed_type (CHAR_TYPE_SIZE
)
10176 : make_unsigned_type (CHAR_TYPE_SIZE
));
10177 TYPE_STRING_FLAG (char_type_node
) = 1;
10179 short_integer_type_node
= make_signed_type (SHORT_TYPE_SIZE
);
10180 short_unsigned_type_node
= make_unsigned_type (SHORT_TYPE_SIZE
);
10181 integer_type_node
= make_signed_type (INT_TYPE_SIZE
);
10182 unsigned_type_node
= make_unsigned_type (INT_TYPE_SIZE
);
10183 long_integer_type_node
= make_signed_type (LONG_TYPE_SIZE
);
10184 long_unsigned_type_node
= make_unsigned_type (LONG_TYPE_SIZE
);
10185 long_long_integer_type_node
= make_signed_type (LONG_LONG_TYPE_SIZE
);
10186 long_long_unsigned_type_node
= make_unsigned_type (LONG_LONG_TYPE_SIZE
);
10188 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
10190 int_n_trees
[i
].signed_type
= make_signed_type (int_n_data
[i
].bitsize
);
10191 int_n_trees
[i
].unsigned_type
= make_unsigned_type (int_n_data
[i
].bitsize
);
10192 TYPE_SIZE (int_n_trees
[i
].signed_type
) = bitsize_int (int_n_data
[i
].bitsize
);
10193 TYPE_SIZE (int_n_trees
[i
].unsigned_type
) = bitsize_int (int_n_data
[i
].bitsize
);
10195 if (int_n_data
[i
].bitsize
> LONG_LONG_TYPE_SIZE
10196 && int_n_enabled_p
[i
])
10198 integer_types
[itk_intN_0
+ i
* 2] = int_n_trees
[i
].signed_type
;
10199 integer_types
[itk_unsigned_intN_0
+ i
* 2] = int_n_trees
[i
].unsigned_type
;
10203 /* Define a boolean type. This type only represents boolean values but
10204 may be larger than char depending on the value of BOOL_TYPE_SIZE. */
10205 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
10206 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
10207 TYPE_PRECISION (boolean_type_node
) = 1;
10208 TYPE_MAX_VALUE (boolean_type_node
) = build_int_cst (boolean_type_node
, 1);
10210 /* Define what type to use for size_t. */
10211 if (strcmp (SIZE_TYPE
, "unsigned int") == 0)
10212 size_type_node
= unsigned_type_node
;
10213 else if (strcmp (SIZE_TYPE
, "long unsigned int") == 0)
10214 size_type_node
= long_unsigned_type_node
;
10215 else if (strcmp (SIZE_TYPE
, "long long unsigned int") == 0)
10216 size_type_node
= long_long_unsigned_type_node
;
10217 else if (strcmp (SIZE_TYPE
, "short unsigned int") == 0)
10218 size_type_node
= short_unsigned_type_node
;
10223 size_type_node
= NULL_TREE
;
10224 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
10225 if (int_n_enabled_p
[i
])
10228 sprintf (name
, "__int%d unsigned", int_n_data
[i
].bitsize
);
10230 if (strcmp (name
, SIZE_TYPE
) == 0)
10232 size_type_node
= int_n_trees
[i
].unsigned_type
;
10235 if (size_type_node
== NULL_TREE
)
10236 gcc_unreachable ();
10239 /* Fill in the rest of the sized types. Reuse existing type nodes
10241 intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 0);
10242 intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 0);
10243 intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 0);
10244 intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 0);
10245 intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 0);
10247 unsigned_intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 1);
10248 unsigned_intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 1);
10249 unsigned_intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 1);
10250 unsigned_intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 1);
10251 unsigned_intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 1);
10253 /* Don't call build_qualified type for atomics. That routine does
10254 special processing for atomics, and until they are initialized
10255 it's better not to make that call.
10257 Check to see if there is a target override for atomic types. */
10259 atomicQI_type_node
= build_atomic_base (unsigned_intQI_type_node
,
10260 targetm
.atomic_align_for_mode (QImode
));
10261 atomicHI_type_node
= build_atomic_base (unsigned_intHI_type_node
,
10262 targetm
.atomic_align_for_mode (HImode
));
10263 atomicSI_type_node
= build_atomic_base (unsigned_intSI_type_node
,
10264 targetm
.atomic_align_for_mode (SImode
));
10265 atomicDI_type_node
= build_atomic_base (unsigned_intDI_type_node
,
10266 targetm
.atomic_align_for_mode (DImode
));
10267 atomicTI_type_node
= build_atomic_base (unsigned_intTI_type_node
,
10268 targetm
.atomic_align_for_mode (TImode
));
10270 access_public_node
= get_identifier ("public");
10271 access_protected_node
= get_identifier ("protected");
10272 access_private_node
= get_identifier ("private");
10274 /* Define these next since types below may used them. */
10275 integer_zero_node
= build_int_cst (integer_type_node
, 0);
10276 integer_one_node
= build_int_cst (integer_type_node
, 1);
10277 integer_three_node
= build_int_cst (integer_type_node
, 3);
10278 integer_minus_one_node
= build_int_cst (integer_type_node
, -1);
10280 size_zero_node
= size_int (0);
10281 size_one_node
= size_int (1);
10282 bitsize_zero_node
= bitsize_int (0);
10283 bitsize_one_node
= bitsize_int (1);
10284 bitsize_unit_node
= bitsize_int (BITS_PER_UNIT
);
10286 boolean_false_node
= TYPE_MIN_VALUE (boolean_type_node
);
10287 boolean_true_node
= TYPE_MAX_VALUE (boolean_type_node
);
10289 void_type_node
= make_node (VOID_TYPE
);
10290 layout_type (void_type_node
);
10292 pointer_bounds_type_node
= targetm
.chkp_bound_type ();
10294 /* We are not going to have real types in C with less than byte alignment,
10295 so we might as well not have any types that claim to have it. */
10296 SET_TYPE_ALIGN (void_type_node
, BITS_PER_UNIT
);
10297 TYPE_USER_ALIGN (void_type_node
) = 0;
10299 void_node
= make_node (VOID_CST
);
10300 TREE_TYPE (void_node
) = void_type_node
;
10302 null_pointer_node
= build_int_cst (build_pointer_type (void_type_node
), 0);
10303 layout_type (TREE_TYPE (null_pointer_node
));
10305 ptr_type_node
= build_pointer_type (void_type_node
);
10306 const_ptr_type_node
10307 = build_pointer_type (build_type_variant (void_type_node
, 1, 0));
10308 fileptr_type_node
= ptr_type_node
;
10310 pointer_sized_int_node
= build_nonstandard_integer_type (POINTER_SIZE
, 1);
10312 float_type_node
= make_node (REAL_TYPE
);
10313 TYPE_PRECISION (float_type_node
) = FLOAT_TYPE_SIZE
;
10314 layout_type (float_type_node
);
10316 double_type_node
= make_node (REAL_TYPE
);
10317 TYPE_PRECISION (double_type_node
) = DOUBLE_TYPE_SIZE
;
10318 layout_type (double_type_node
);
10320 long_double_type_node
= make_node (REAL_TYPE
);
10321 TYPE_PRECISION (long_double_type_node
) = LONG_DOUBLE_TYPE_SIZE
;
10322 layout_type (long_double_type_node
);
10324 float_ptr_type_node
= build_pointer_type (float_type_node
);
10325 double_ptr_type_node
= build_pointer_type (double_type_node
);
10326 long_double_ptr_type_node
= build_pointer_type (long_double_type_node
);
10327 integer_ptr_type_node
= build_pointer_type (integer_type_node
);
10329 /* Fixed size integer types. */
10330 uint16_type_node
= make_or_reuse_type (16, 1);
10331 uint32_type_node
= make_or_reuse_type (32, 1);
10332 uint64_type_node
= make_or_reuse_type (64, 1);
10334 /* Decimal float types. */
10335 dfloat32_type_node
= make_node (REAL_TYPE
);
10336 TYPE_PRECISION (dfloat32_type_node
) = DECIMAL32_TYPE_SIZE
;
10337 layout_type (dfloat32_type_node
);
10338 SET_TYPE_MODE (dfloat32_type_node
, SDmode
);
10339 dfloat32_ptr_type_node
= build_pointer_type (dfloat32_type_node
);
10341 dfloat64_type_node
= make_node (REAL_TYPE
);
10342 TYPE_PRECISION (dfloat64_type_node
) = DECIMAL64_TYPE_SIZE
;
10343 layout_type (dfloat64_type_node
);
10344 SET_TYPE_MODE (dfloat64_type_node
, DDmode
);
10345 dfloat64_ptr_type_node
= build_pointer_type (dfloat64_type_node
);
10347 dfloat128_type_node
= make_node (REAL_TYPE
);
10348 TYPE_PRECISION (dfloat128_type_node
) = DECIMAL128_TYPE_SIZE
;
10349 layout_type (dfloat128_type_node
);
10350 SET_TYPE_MODE (dfloat128_type_node
, TDmode
);
10351 dfloat128_ptr_type_node
= build_pointer_type (dfloat128_type_node
);
10353 complex_integer_type_node
= build_complex_type (integer_type_node
);
10354 complex_float_type_node
= build_complex_type (float_type_node
);
10355 complex_double_type_node
= build_complex_type (double_type_node
);
10356 complex_long_double_type_node
= build_complex_type (long_double_type_node
);
10358 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
10359 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
10360 sat_ ## KIND ## _type_node = \
10361 make_sat_signed_ ## KIND ## _type (SIZE); \
10362 sat_unsigned_ ## KIND ## _type_node = \
10363 make_sat_unsigned_ ## KIND ## _type (SIZE); \
10364 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
10365 unsigned_ ## KIND ## _type_node = \
10366 make_unsigned_ ## KIND ## _type (SIZE);
10368 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
10369 sat_ ## WIDTH ## KIND ## _type_node = \
10370 make_sat_signed_ ## KIND ## _type (SIZE); \
10371 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
10372 make_sat_unsigned_ ## KIND ## _type (SIZE); \
10373 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
10374 unsigned_ ## WIDTH ## KIND ## _type_node = \
10375 make_unsigned_ ## KIND ## _type (SIZE);
10377 /* Make fixed-point type nodes based on four different widths. */
10378 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
10379 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
10380 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
10381 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
10382 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
10384 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
10385 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
10386 NAME ## _type_node = \
10387 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
10388 u ## NAME ## _type_node = \
10389 make_or_reuse_unsigned_ ## KIND ## _type \
10390 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
10391 sat_ ## NAME ## _type_node = \
10392 make_or_reuse_sat_signed_ ## KIND ## _type \
10393 (GET_MODE_BITSIZE (MODE ## mode)); \
10394 sat_u ## NAME ## _type_node = \
10395 make_or_reuse_sat_unsigned_ ## KIND ## _type \
10396 (GET_MODE_BITSIZE (U ## MODE ## mode));
10398 /* Fixed-point type and mode nodes. */
10399 MAKE_FIXED_TYPE_NODE_FAMILY (fract
, FRACT
)
10400 MAKE_FIXED_TYPE_NODE_FAMILY (accum
, ACCUM
)
10401 MAKE_FIXED_MODE_NODE (fract
, qq
, QQ
)
10402 MAKE_FIXED_MODE_NODE (fract
, hq
, HQ
)
10403 MAKE_FIXED_MODE_NODE (fract
, sq
, SQ
)
10404 MAKE_FIXED_MODE_NODE (fract
, dq
, DQ
)
10405 MAKE_FIXED_MODE_NODE (fract
, tq
, TQ
)
10406 MAKE_FIXED_MODE_NODE (accum
, ha
, HA
)
10407 MAKE_FIXED_MODE_NODE (accum
, sa
, SA
)
10408 MAKE_FIXED_MODE_NODE (accum
, da
, DA
)
10409 MAKE_FIXED_MODE_NODE (accum
, ta
, TA
)
10412 tree t
= targetm
.build_builtin_va_list ();
10414 /* Many back-ends define record types without setting TYPE_NAME.
10415 If we copied the record type here, we'd keep the original
10416 record type without a name. This breaks name mangling. So,
10417 don't copy record types and let c_common_nodes_and_builtins()
10418 declare the type to be __builtin_va_list. */
10419 if (TREE_CODE (t
) != RECORD_TYPE
)
10420 t
= build_variant_type_copy (t
);
10422 va_list_type_node
= t
;
10426 /* Modify DECL for given flags.
10427 TM_PURE attribute is set only on types, so the function will modify
10428 DECL's type when ECF_TM_PURE is used. */
10431 set_call_expr_flags (tree decl
, int flags
)
10433 if (flags
& ECF_NOTHROW
)
10434 TREE_NOTHROW (decl
) = 1;
10435 if (flags
& ECF_CONST
)
10436 TREE_READONLY (decl
) = 1;
10437 if (flags
& ECF_PURE
)
10438 DECL_PURE_P (decl
) = 1;
10439 if (flags
& ECF_LOOPING_CONST_OR_PURE
)
10440 DECL_LOOPING_CONST_OR_PURE_P (decl
) = 1;
10441 if (flags
& ECF_NOVOPS
)
10442 DECL_IS_NOVOPS (decl
) = 1;
10443 if (flags
& ECF_NORETURN
)
10444 TREE_THIS_VOLATILE (decl
) = 1;
10445 if (flags
& ECF_MALLOC
)
10446 DECL_IS_MALLOC (decl
) = 1;
10447 if (flags
& ECF_RETURNS_TWICE
)
10448 DECL_IS_RETURNS_TWICE (decl
) = 1;
10449 if (flags
& ECF_LEAF
)
10450 DECL_ATTRIBUTES (decl
) = tree_cons (get_identifier ("leaf"),
10451 NULL
, DECL_ATTRIBUTES (decl
));
10452 if (flags
& ECF_RET1
)
10453 DECL_ATTRIBUTES (decl
)
10454 = tree_cons (get_identifier ("fn spec"),
10455 build_tree_list (NULL_TREE
, build_string (1, "1")),
10456 DECL_ATTRIBUTES (decl
));
10457 if ((flags
& ECF_TM_PURE
) && flag_tm
)
10458 apply_tm_attr (decl
, get_identifier ("transaction_pure"));
10459 /* Looping const or pure is implied by noreturn.
10460 There is currently no way to declare looping const or looping pure alone. */
10461 gcc_assert (!(flags
& ECF_LOOPING_CONST_OR_PURE
)
10462 || ((flags
& ECF_NORETURN
) && (flags
& (ECF_CONST
| ECF_PURE
))));
10466 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
10469 local_define_builtin (const char *name
, tree type
, enum built_in_function code
,
10470 const char *library_name
, int ecf_flags
)
10474 decl
= add_builtin_function (name
, type
, code
, BUILT_IN_NORMAL
,
10475 library_name
, NULL_TREE
);
10476 set_call_expr_flags (decl
, ecf_flags
);
10478 set_builtin_decl (code
, decl
, true);
10481 /* Call this function after instantiating all builtins that the language
10482 front end cares about. This will build the rest of the builtins
10483 and internal functions that are relied upon by the tree optimizers and
10487 build_common_builtin_nodes (void)
10492 if (!builtin_decl_explicit_p (BUILT_IN_UNREACHABLE
)
10493 || !builtin_decl_explicit_p (BUILT_IN_ABORT
))
10495 ftype
= build_function_type (void_type_node
, void_list_node
);
10496 if (!builtin_decl_explicit_p (BUILT_IN_UNREACHABLE
))
10497 local_define_builtin ("__builtin_unreachable", ftype
,
10498 BUILT_IN_UNREACHABLE
,
10499 "__builtin_unreachable",
10500 ECF_NOTHROW
| ECF_LEAF
| ECF_NORETURN
10502 if (!builtin_decl_explicit_p (BUILT_IN_ABORT
))
10503 local_define_builtin ("__builtin_abort", ftype
, BUILT_IN_ABORT
,
10505 ECF_LEAF
| ECF_NORETURN
| ECF_CONST
);
10508 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
)
10509 || !builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
10511 ftype
= build_function_type_list (ptr_type_node
,
10512 ptr_type_node
, const_ptr_type_node
,
10513 size_type_node
, NULL_TREE
);
10515 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
))
10516 local_define_builtin ("__builtin_memcpy", ftype
, BUILT_IN_MEMCPY
,
10517 "memcpy", ECF_NOTHROW
| ECF_LEAF
| ECF_RET1
);
10518 if (!builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
10519 local_define_builtin ("__builtin_memmove", ftype
, BUILT_IN_MEMMOVE
,
10520 "memmove", ECF_NOTHROW
| ECF_LEAF
| ECF_RET1
);
10523 if (!builtin_decl_explicit_p (BUILT_IN_MEMCMP
))
10525 ftype
= build_function_type_list (integer_type_node
, const_ptr_type_node
,
10526 const_ptr_type_node
, size_type_node
,
10528 local_define_builtin ("__builtin_memcmp", ftype
, BUILT_IN_MEMCMP
,
10529 "memcmp", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10532 if (!builtin_decl_explicit_p (BUILT_IN_MEMSET
))
10534 ftype
= build_function_type_list (ptr_type_node
,
10535 ptr_type_node
, integer_type_node
,
10536 size_type_node
, NULL_TREE
);
10537 local_define_builtin ("__builtin_memset", ftype
, BUILT_IN_MEMSET
,
10538 "memset", ECF_NOTHROW
| ECF_LEAF
| ECF_RET1
);
10541 /* If we're checking the stack, `alloca' can throw. */
10542 const int alloca_flags
10543 = ECF_MALLOC
| ECF_LEAF
| (flag_stack_check
? 0 : ECF_NOTHROW
);
10545 if (!builtin_decl_explicit_p (BUILT_IN_ALLOCA
))
10547 ftype
= build_function_type_list (ptr_type_node
,
10548 size_type_node
, NULL_TREE
);
10549 local_define_builtin ("__builtin_alloca", ftype
, BUILT_IN_ALLOCA
,
10550 "alloca", alloca_flags
);
10553 ftype
= build_function_type_list (ptr_type_node
, size_type_node
,
10554 size_type_node
, NULL_TREE
);
10555 local_define_builtin ("__builtin_alloca_with_align", ftype
,
10556 BUILT_IN_ALLOCA_WITH_ALIGN
,
10557 "__builtin_alloca_with_align",
10560 ftype
= build_function_type_list (void_type_node
,
10561 ptr_type_node
, ptr_type_node
,
10562 ptr_type_node
, NULL_TREE
);
10563 local_define_builtin ("__builtin_init_trampoline", ftype
,
10564 BUILT_IN_INIT_TRAMPOLINE
,
10565 "__builtin_init_trampoline", ECF_NOTHROW
| ECF_LEAF
);
10566 local_define_builtin ("__builtin_init_heap_trampoline", ftype
,
10567 BUILT_IN_INIT_HEAP_TRAMPOLINE
,
10568 "__builtin_init_heap_trampoline",
10569 ECF_NOTHROW
| ECF_LEAF
);
10571 ftype
= build_function_type_list (ptr_type_node
, ptr_type_node
, NULL_TREE
);
10572 local_define_builtin ("__builtin_adjust_trampoline", ftype
,
10573 BUILT_IN_ADJUST_TRAMPOLINE
,
10574 "__builtin_adjust_trampoline",
10575 ECF_CONST
| ECF_NOTHROW
);
10577 ftype
= build_function_type_list (void_type_node
,
10578 ptr_type_node
, ptr_type_node
, NULL_TREE
);
10579 local_define_builtin ("__builtin_nonlocal_goto", ftype
,
10580 BUILT_IN_NONLOCAL_GOTO
,
10581 "__builtin_nonlocal_goto",
10582 ECF_NORETURN
| ECF_NOTHROW
);
10584 ftype
= build_function_type_list (void_type_node
,
10585 ptr_type_node
, ptr_type_node
, NULL_TREE
);
10586 local_define_builtin ("__builtin_setjmp_setup", ftype
,
10587 BUILT_IN_SETJMP_SETUP
,
10588 "__builtin_setjmp_setup", ECF_NOTHROW
);
10590 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10591 local_define_builtin ("__builtin_setjmp_receiver", ftype
,
10592 BUILT_IN_SETJMP_RECEIVER
,
10593 "__builtin_setjmp_receiver", ECF_NOTHROW
| ECF_LEAF
);
10595 ftype
= build_function_type_list (ptr_type_node
, NULL_TREE
);
10596 local_define_builtin ("__builtin_stack_save", ftype
, BUILT_IN_STACK_SAVE
,
10597 "__builtin_stack_save", ECF_NOTHROW
| ECF_LEAF
);
10599 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10600 local_define_builtin ("__builtin_stack_restore", ftype
,
10601 BUILT_IN_STACK_RESTORE
,
10602 "__builtin_stack_restore", ECF_NOTHROW
| ECF_LEAF
);
10604 ftype
= build_function_type_list (integer_type_node
, const_ptr_type_node
,
10605 const_ptr_type_node
, size_type_node
,
10607 local_define_builtin ("__builtin_memcmp_eq", ftype
, BUILT_IN_MEMCMP_EQ
,
10608 "__builtin_memcmp_eq",
10609 ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10611 /* If there's a possibility that we might use the ARM EABI, build the
10612 alternate __cxa_end_cleanup node used to resume from C++ and Java. */
10613 if (targetm
.arm_eabi_unwinder
)
10615 ftype
= build_function_type_list (void_type_node
, NULL_TREE
);
10616 local_define_builtin ("__builtin_cxa_end_cleanup", ftype
,
10617 BUILT_IN_CXA_END_CLEANUP
,
10618 "__cxa_end_cleanup", ECF_NORETURN
| ECF_LEAF
);
10621 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10622 local_define_builtin ("__builtin_unwind_resume", ftype
,
10623 BUILT_IN_UNWIND_RESUME
,
10624 ((targetm_common
.except_unwind_info (&global_options
)
10626 ? "_Unwind_SjLj_Resume" : "_Unwind_Resume"),
10629 if (builtin_decl_explicit (BUILT_IN_RETURN_ADDRESS
) == NULL_TREE
)
10631 ftype
= build_function_type_list (ptr_type_node
, integer_type_node
,
10633 local_define_builtin ("__builtin_return_address", ftype
,
10634 BUILT_IN_RETURN_ADDRESS
,
10635 "__builtin_return_address",
10639 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
)
10640 || !builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
10642 ftype
= build_function_type_list (void_type_node
, ptr_type_node
,
10643 ptr_type_node
, NULL_TREE
);
10644 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
))
10645 local_define_builtin ("__cyg_profile_func_enter", ftype
,
10646 BUILT_IN_PROFILE_FUNC_ENTER
,
10647 "__cyg_profile_func_enter", 0);
10648 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
10649 local_define_builtin ("__cyg_profile_func_exit", ftype
,
10650 BUILT_IN_PROFILE_FUNC_EXIT
,
10651 "__cyg_profile_func_exit", 0);
10654 /* The exception object and filter values from the runtime. The argument
10655 must be zero before exception lowering, i.e. from the front end. After
10656 exception lowering, it will be the region number for the exception
10657 landing pad. These functions are PURE instead of CONST to prevent
10658 them from being hoisted past the exception edge that will initialize
10659 its value in the landing pad. */
10660 ftype
= build_function_type_list (ptr_type_node
,
10661 integer_type_node
, NULL_TREE
);
10662 ecf_flags
= ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
;
10663 /* Only use TM_PURE if we have TM language support. */
10664 if (builtin_decl_explicit_p (BUILT_IN_TM_LOAD_1
))
10665 ecf_flags
|= ECF_TM_PURE
;
10666 local_define_builtin ("__builtin_eh_pointer", ftype
, BUILT_IN_EH_POINTER
,
10667 "__builtin_eh_pointer", ecf_flags
);
10669 tmp
= lang_hooks
.types
.type_for_mode (targetm
.eh_return_filter_mode (), 0);
10670 ftype
= build_function_type_list (tmp
, integer_type_node
, NULL_TREE
);
10671 local_define_builtin ("__builtin_eh_filter", ftype
, BUILT_IN_EH_FILTER
,
10672 "__builtin_eh_filter", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10674 ftype
= build_function_type_list (void_type_node
,
10675 integer_type_node
, integer_type_node
,
10677 local_define_builtin ("__builtin_eh_copy_values", ftype
,
10678 BUILT_IN_EH_COPY_VALUES
,
10679 "__builtin_eh_copy_values", ECF_NOTHROW
);
10681 /* Complex multiplication and division. These are handled as builtins
10682 rather than optabs because emit_library_call_value doesn't support
10683 complex. Further, we can do slightly better with folding these
10684 beasties if the real and complex parts of the arguments are separate. */
10688 for (mode
= MIN_MODE_COMPLEX_FLOAT
; mode
<= MAX_MODE_COMPLEX_FLOAT
; ++mode
)
10690 char mode_name_buf
[4], *q
;
10692 enum built_in_function mcode
, dcode
;
10693 tree type
, inner_type
;
10694 const char *prefix
= "__";
10696 if (targetm
.libfunc_gnu_prefix
)
10699 type
= lang_hooks
.types
.type_for_mode ((machine_mode
) mode
, 0);
10702 inner_type
= TREE_TYPE (type
);
10704 ftype
= build_function_type_list (type
, inner_type
, inner_type
,
10705 inner_type
, inner_type
, NULL_TREE
);
10707 mcode
= ((enum built_in_function
)
10708 (BUILT_IN_COMPLEX_MUL_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
10709 dcode
= ((enum built_in_function
)
10710 (BUILT_IN_COMPLEX_DIV_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
10712 for (p
= GET_MODE_NAME (mode
), q
= mode_name_buf
; *p
; p
++, q
++)
10716 built_in_names
[mcode
] = concat (prefix
, "mul", mode_name_buf
, "3",
10718 local_define_builtin (built_in_names
[mcode
], ftype
, mcode
,
10719 built_in_names
[mcode
],
10720 ECF_CONST
| ECF_NOTHROW
| ECF_LEAF
);
10722 built_in_names
[dcode
] = concat (prefix
, "div", mode_name_buf
, "3",
10724 local_define_builtin (built_in_names
[dcode
], ftype
, dcode
,
10725 built_in_names
[dcode
],
10726 ECF_CONST
| ECF_NOTHROW
| ECF_LEAF
);
10730 init_internal_fns ();
10733 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
10736 If we requested a pointer to a vector, build up the pointers that
10737 we stripped off while looking for the inner type. Similarly for
10738 return values from functions.
10740 The argument TYPE is the top of the chain, and BOTTOM is the
10741 new type which we will point to. */
10744 reconstruct_complex_type (tree type
, tree bottom
)
10748 if (TREE_CODE (type
) == POINTER_TYPE
)
10750 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10751 outer
= build_pointer_type_for_mode (inner
, TYPE_MODE (type
),
10752 TYPE_REF_CAN_ALIAS_ALL (type
));
10754 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
10756 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10757 outer
= build_reference_type_for_mode (inner
, TYPE_MODE (type
),
10758 TYPE_REF_CAN_ALIAS_ALL (type
));
10760 else if (TREE_CODE (type
) == ARRAY_TYPE
)
10762 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10763 outer
= build_array_type (inner
, TYPE_DOMAIN (type
));
10765 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10767 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10768 outer
= build_function_type (inner
, TYPE_ARG_TYPES (type
));
10770 else if (TREE_CODE (type
) == METHOD_TYPE
)
10772 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10773 /* The build_method_type_directly() routine prepends 'this' to argument list,
10774 so we must compensate by getting rid of it. */
10776 = build_method_type_directly
10777 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
))),
10779 TREE_CHAIN (TYPE_ARG_TYPES (type
)));
10781 else if (TREE_CODE (type
) == OFFSET_TYPE
)
10783 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10784 outer
= build_offset_type (TYPE_OFFSET_BASETYPE (type
), inner
);
10789 return build_type_attribute_qual_variant (outer
, TYPE_ATTRIBUTES (type
),
10790 TYPE_QUALS (type
));
10793 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
10796 build_vector_type_for_mode (tree innertype
, machine_mode mode
)
10800 switch (GET_MODE_CLASS (mode
))
10802 case MODE_VECTOR_INT
:
10803 case MODE_VECTOR_FLOAT
:
10804 case MODE_VECTOR_FRACT
:
10805 case MODE_VECTOR_UFRACT
:
10806 case MODE_VECTOR_ACCUM
:
10807 case MODE_VECTOR_UACCUM
:
10808 nunits
= GET_MODE_NUNITS (mode
);
10812 /* Check that there are no leftover bits. */
10813 gcc_assert (GET_MODE_BITSIZE (mode
)
10814 % TREE_INT_CST_LOW (TYPE_SIZE (innertype
)) == 0);
10816 nunits
= GET_MODE_BITSIZE (mode
)
10817 / TREE_INT_CST_LOW (TYPE_SIZE (innertype
));
10821 gcc_unreachable ();
10824 return make_vector_type (innertype
, nunits
, mode
);
10827 /* Similarly, but takes the inner type and number of units, which must be
10831 build_vector_type (tree innertype
, int nunits
)
10833 return make_vector_type (innertype
, nunits
, VOIDmode
);
10836 /* Build truth vector with specified length and number of units. */
10839 build_truth_vector_type (unsigned nunits
, unsigned vector_size
)
10841 machine_mode mask_mode
= targetm
.vectorize
.get_mask_mode (nunits
,
10844 gcc_assert (mask_mode
!= VOIDmode
);
10846 unsigned HOST_WIDE_INT vsize
;
10847 if (mask_mode
== BLKmode
)
10848 vsize
= vector_size
* BITS_PER_UNIT
;
10850 vsize
= GET_MODE_BITSIZE (mask_mode
);
10852 unsigned HOST_WIDE_INT esize
= vsize
/ nunits
;
10853 gcc_assert (esize
* nunits
== vsize
);
10855 tree bool_type
= build_nonstandard_boolean_type (esize
);
10857 return make_vector_type (bool_type
, nunits
, mask_mode
);
10860 /* Returns a vector type corresponding to a comparison of VECTYPE. */
10863 build_same_sized_truth_vector_type (tree vectype
)
10865 if (VECTOR_BOOLEAN_TYPE_P (vectype
))
10868 unsigned HOST_WIDE_INT size
= GET_MODE_SIZE (TYPE_MODE (vectype
));
10871 size
= tree_to_uhwi (TYPE_SIZE_UNIT (vectype
));
10873 return build_truth_vector_type (TYPE_VECTOR_SUBPARTS (vectype
), size
);
10876 /* Similarly, but builds a variant type with TYPE_VECTOR_OPAQUE set. */
10879 build_opaque_vector_type (tree innertype
, int nunits
)
10881 tree t
= make_vector_type (innertype
, nunits
, VOIDmode
);
10883 /* We always build the non-opaque variant before the opaque one,
10884 so if it already exists, it is TYPE_NEXT_VARIANT of this one. */
10885 cand
= TYPE_NEXT_VARIANT (t
);
10887 && TYPE_VECTOR_OPAQUE (cand
)
10888 && check_qualified_type (cand
, t
, TYPE_QUALS (t
)))
10890 /* Othewise build a variant type and make sure to queue it after
10891 the non-opaque type. */
10892 cand
= build_distinct_type_copy (t
);
10893 TYPE_VECTOR_OPAQUE (cand
) = true;
10894 TYPE_CANONICAL (cand
) = TYPE_CANONICAL (t
);
10895 TYPE_NEXT_VARIANT (cand
) = TYPE_NEXT_VARIANT (t
);
10896 TYPE_NEXT_VARIANT (t
) = cand
;
10897 TYPE_MAIN_VARIANT (cand
) = TYPE_MAIN_VARIANT (t
);
10902 /* Given an initializer INIT, return TRUE if INIT is zero or some
10903 aggregate of zeros. Otherwise return FALSE. */
10905 initializer_zerop (const_tree init
)
10911 switch (TREE_CODE (init
))
10914 return integer_zerop (init
);
10917 /* ??? Note that this is not correct for C4X float formats. There,
10918 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
10919 negative exponent. */
10920 return real_zerop (init
)
10921 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init
));
10924 return fixed_zerop (init
);
10927 return integer_zerop (init
)
10928 || (real_zerop (init
)
10929 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init
)))
10930 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init
))));
10935 for (i
= 0; i
< VECTOR_CST_NELTS (init
); ++i
)
10936 if (!initializer_zerop (VECTOR_CST_ELT (init
, i
)))
10943 unsigned HOST_WIDE_INT idx
;
10945 if (TREE_CLOBBER_P (init
))
10947 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init
), idx
, elt
)
10948 if (!initializer_zerop (elt
))
10957 /* We need to loop through all elements to handle cases like
10958 "\0" and "\0foobar". */
10959 for (i
= 0; i
< TREE_STRING_LENGTH (init
); ++i
)
10960 if (TREE_STRING_POINTER (init
)[i
] != '\0')
10971 /* Check if vector VEC consists of all the equal elements and
10972 that the number of elements corresponds to the type of VEC.
10973 The function returns first element of the vector
10974 or NULL_TREE if the vector is not uniform. */
10976 uniform_vector_p (const_tree vec
)
10981 if (vec
== NULL_TREE
)
10984 gcc_assert (VECTOR_TYPE_P (TREE_TYPE (vec
)));
10986 if (TREE_CODE (vec
) == VECTOR_CST
)
10988 first
= VECTOR_CST_ELT (vec
, 0);
10989 for (i
= 1; i
< VECTOR_CST_NELTS (vec
); ++i
)
10990 if (!operand_equal_p (first
, VECTOR_CST_ELT (vec
, i
), 0))
10996 else if (TREE_CODE (vec
) == CONSTRUCTOR
)
10998 first
= error_mark_node
;
11000 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (vec
), i
, t
)
11007 if (!operand_equal_p (first
, t
, 0))
11010 if (i
!= TYPE_VECTOR_SUBPARTS (TREE_TYPE (vec
)))
11019 /* Build an empty statement at location LOC. */
11022 build_empty_stmt (location_t loc
)
11024 tree t
= build1 (NOP_EXPR
, void_type_node
, size_zero_node
);
11025 SET_EXPR_LOCATION (t
, loc
);
11030 /* Build an OpenMP clause with code CODE. LOC is the location of the
11034 build_omp_clause (location_t loc
, enum omp_clause_code code
)
11039 length
= omp_clause_num_ops
[code
];
11040 size
= (sizeof (struct tree_omp_clause
) + (length
- 1) * sizeof (tree
));
11042 record_node_allocation_statistics (OMP_CLAUSE
, size
);
11044 t
= (tree
) ggc_internal_alloc (size
);
11045 memset (t
, 0, size
);
11046 TREE_SET_CODE (t
, OMP_CLAUSE
);
11047 OMP_CLAUSE_SET_CODE (t
, code
);
11048 OMP_CLAUSE_LOCATION (t
) = loc
;
11053 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
11054 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
11055 Except for the CODE and operand count field, other storage for the
11056 object is initialized to zeros. */
11059 build_vl_exp_stat (enum tree_code code
, int len MEM_STAT_DECL
)
11062 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_exp
);
11064 gcc_assert (TREE_CODE_CLASS (code
) == tcc_vl_exp
);
11065 gcc_assert (len
>= 1);
11067 record_node_allocation_statistics (code
, length
);
11069 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
11071 TREE_SET_CODE (t
, code
);
11073 /* Can't use TREE_OPERAND to store the length because if checking is
11074 enabled, it will try to check the length before we store it. :-P */
11075 t
->exp
.operands
[0] = build_int_cst (sizetype
, len
);
11080 /* Helper function for build_call_* functions; build a CALL_EXPR with
11081 indicated RETURN_TYPE, FN, and NARGS, but do not initialize any of
11082 the argument slots. */
11085 build_call_1 (tree return_type
, tree fn
, int nargs
)
11089 t
= build_vl_exp (CALL_EXPR
, nargs
+ 3);
11090 TREE_TYPE (t
) = return_type
;
11091 CALL_EXPR_FN (t
) = fn
;
11092 CALL_EXPR_STATIC_CHAIN (t
) = NULL
;
11097 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
11098 FN and a null static chain slot. NARGS is the number of call arguments
11099 which are specified as "..." arguments. */
11102 build_call_nary (tree return_type
, tree fn
, int nargs
, ...)
11106 va_start (args
, nargs
);
11107 ret
= build_call_valist (return_type
, fn
, nargs
, args
);
11112 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
11113 FN and a null static chain slot. NARGS is the number of call arguments
11114 which are specified as a va_list ARGS. */
11117 build_call_valist (tree return_type
, tree fn
, int nargs
, va_list args
)
11122 t
= build_call_1 (return_type
, fn
, nargs
);
11123 for (i
= 0; i
< nargs
; i
++)
11124 CALL_EXPR_ARG (t
, i
) = va_arg (args
, tree
);
11125 process_call_operands (t
);
11129 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
11130 FN and a null static chain slot. NARGS is the number of call arguments
11131 which are specified as a tree array ARGS. */
11134 build_call_array_loc (location_t loc
, tree return_type
, tree fn
,
11135 int nargs
, const tree
*args
)
11140 t
= build_call_1 (return_type
, fn
, nargs
);
11141 for (i
= 0; i
< nargs
; i
++)
11142 CALL_EXPR_ARG (t
, i
) = args
[i
];
11143 process_call_operands (t
);
11144 SET_EXPR_LOCATION (t
, loc
);
11148 /* Like build_call_array, but takes a vec. */
11151 build_call_vec (tree return_type
, tree fn
, vec
<tree
, va_gc
> *args
)
11156 ret
= build_call_1 (return_type
, fn
, vec_safe_length (args
));
11157 FOR_EACH_VEC_SAFE_ELT (args
, ix
, t
)
11158 CALL_EXPR_ARG (ret
, ix
) = t
;
11159 process_call_operands (ret
);
11163 /* Conveniently construct a function call expression. FNDECL names the
11164 function to be called and N arguments are passed in the array
11168 build_call_expr_loc_array (location_t loc
, tree fndecl
, int n
, tree
*argarray
)
11170 tree fntype
= TREE_TYPE (fndecl
);
11171 tree fn
= build1 (ADDR_EXPR
, build_pointer_type (fntype
), fndecl
);
11173 return fold_build_call_array_loc (loc
, TREE_TYPE (fntype
), fn
, n
, argarray
);
11176 /* Conveniently construct a function call expression. FNDECL names the
11177 function to be called and the arguments are passed in the vector
11181 build_call_expr_loc_vec (location_t loc
, tree fndecl
, vec
<tree
, va_gc
> *vec
)
11183 return build_call_expr_loc_array (loc
, fndecl
, vec_safe_length (vec
),
11184 vec_safe_address (vec
));
11188 /* Conveniently construct a function call expression. FNDECL names the
11189 function to be called, N is the number of arguments, and the "..."
11190 parameters are the argument expressions. */
11193 build_call_expr_loc (location_t loc
, tree fndecl
, int n
, ...)
11196 tree
*argarray
= XALLOCAVEC (tree
, n
);
11200 for (i
= 0; i
< n
; i
++)
11201 argarray
[i
] = va_arg (ap
, tree
);
11203 return build_call_expr_loc_array (loc
, fndecl
, n
, argarray
);
11206 /* Like build_call_expr_loc (UNKNOWN_LOCATION, ...). Duplicated because
11207 varargs macros aren't supported by all bootstrap compilers. */
11210 build_call_expr (tree fndecl
, int n
, ...)
11213 tree
*argarray
= XALLOCAVEC (tree
, n
);
11217 for (i
= 0; i
< n
; i
++)
11218 argarray
[i
] = va_arg (ap
, tree
);
11220 return build_call_expr_loc_array (UNKNOWN_LOCATION
, fndecl
, n
, argarray
);
11223 /* Build an internal call to IFN, with arguments ARGS[0:N-1] and with return
11224 type TYPE. This is just like CALL_EXPR, except its CALL_EXPR_FN is NULL.
11225 It will get gimplified later into an ordinary internal function. */
11228 build_call_expr_internal_loc_array (location_t loc
, internal_fn ifn
,
11229 tree type
, int n
, const tree
*args
)
11231 tree t
= build_call_1 (type
, NULL_TREE
, n
);
11232 for (int i
= 0; i
< n
; ++i
)
11233 CALL_EXPR_ARG (t
, i
) = args
[i
];
11234 SET_EXPR_LOCATION (t
, loc
);
11235 CALL_EXPR_IFN (t
) = ifn
;
11239 /* Build internal call expression. This is just like CALL_EXPR, except
11240 its CALL_EXPR_FN is NULL. It will get gimplified later into ordinary
11241 internal function. */
11244 build_call_expr_internal_loc (location_t loc
, enum internal_fn ifn
,
11245 tree type
, int n
, ...)
11248 tree
*argarray
= XALLOCAVEC (tree
, n
);
11252 for (i
= 0; i
< n
; i
++)
11253 argarray
[i
] = va_arg (ap
, tree
);
11255 return build_call_expr_internal_loc_array (loc
, ifn
, type
, n
, argarray
);
11258 /* Return a function call to FN, if the target is guaranteed to support it,
11261 N is the number of arguments, passed in the "...", and TYPE is the
11262 type of the return value. */
11265 maybe_build_call_expr_loc (location_t loc
, combined_fn fn
, tree type
,
11269 tree
*argarray
= XALLOCAVEC (tree
, n
);
11273 for (i
= 0; i
< n
; i
++)
11274 argarray
[i
] = va_arg (ap
, tree
);
11276 if (internal_fn_p (fn
))
11278 internal_fn ifn
= as_internal_fn (fn
);
11279 if (direct_internal_fn_p (ifn
))
11281 tree_pair types
= direct_internal_fn_types (ifn
, type
, argarray
);
11282 if (!direct_internal_fn_supported_p (ifn
, types
,
11283 OPTIMIZE_FOR_BOTH
))
11286 return build_call_expr_internal_loc_array (loc
, ifn
, type
, n
, argarray
);
11290 tree fndecl
= builtin_decl_implicit (as_builtin_fn (fn
));
11293 return build_call_expr_loc_array (loc
, fndecl
, n
, argarray
);
11297 /* Create a new constant string literal and return a char* pointer to it.
11298 The STRING_CST value is the LEN characters at STR. */
11300 build_string_literal (int len
, const char *str
)
11302 tree t
, elem
, index
, type
;
11304 t
= build_string (len
, str
);
11305 elem
= build_type_variant (char_type_node
, 1, 0);
11306 index
= build_index_type (size_int (len
- 1));
11307 type
= build_array_type (elem
, index
);
11308 TREE_TYPE (t
) = type
;
11309 TREE_CONSTANT (t
) = 1;
11310 TREE_READONLY (t
) = 1;
11311 TREE_STATIC (t
) = 1;
11313 type
= build_pointer_type (elem
);
11314 t
= build1 (ADDR_EXPR
, type
,
11315 build4 (ARRAY_REF
, elem
,
11316 t
, integer_zero_node
, NULL_TREE
, NULL_TREE
));
11322 /* Return true if T (assumed to be a DECL) must be assigned a memory
11326 needs_to_live_in_memory (const_tree t
)
11328 return (TREE_ADDRESSABLE (t
)
11329 || is_global_var (t
)
11330 || (TREE_CODE (t
) == RESULT_DECL
11331 && !DECL_BY_REFERENCE (t
)
11332 && aggregate_value_p (t
, current_function_decl
)));
11335 /* Return value of a constant X and sign-extend it. */
11338 int_cst_value (const_tree x
)
11340 unsigned bits
= TYPE_PRECISION (TREE_TYPE (x
));
11341 unsigned HOST_WIDE_INT val
= TREE_INT_CST_LOW (x
);
11343 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
11344 gcc_assert (cst_and_fits_in_hwi (x
));
11346 if (bits
< HOST_BITS_PER_WIDE_INT
)
11348 bool negative
= ((val
>> (bits
- 1)) & 1) != 0;
11350 val
|= (~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1;
11352 val
&= ~((~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1);
11358 /* If TYPE is an integral or pointer type, return an integer type with
11359 the same precision which is unsigned iff UNSIGNEDP is true, or itself
11360 if TYPE is already an integer type of signedness UNSIGNEDP. */
11363 signed_or_unsigned_type_for (int unsignedp
, tree type
)
11365 if (TREE_CODE (type
) == INTEGER_TYPE
&& TYPE_UNSIGNED (type
) == unsignedp
)
11368 if (TREE_CODE (type
) == VECTOR_TYPE
)
11370 tree inner
= TREE_TYPE (type
);
11371 tree inner2
= signed_or_unsigned_type_for (unsignedp
, inner
);
11374 if (inner
== inner2
)
11376 return build_vector_type (inner2
, TYPE_VECTOR_SUBPARTS (type
));
11379 if (!INTEGRAL_TYPE_P (type
)
11380 && !POINTER_TYPE_P (type
)
11381 && TREE_CODE (type
) != OFFSET_TYPE
)
11384 return build_nonstandard_integer_type (TYPE_PRECISION (type
), unsignedp
);
11387 /* If TYPE is an integral or pointer type, return an integer type with
11388 the same precision which is unsigned, or itself if TYPE is already an
11389 unsigned integer type. */
11392 unsigned_type_for (tree type
)
11394 return signed_or_unsigned_type_for (1, type
);
11397 /* If TYPE is an integral or pointer type, return an integer type with
11398 the same precision which is signed, or itself if TYPE is already a
11399 signed integer type. */
11402 signed_type_for (tree type
)
11404 return signed_or_unsigned_type_for (0, type
);
11407 /* If TYPE is a vector type, return a signed integer vector type with the
11408 same width and number of subparts. Otherwise return boolean_type_node. */
11411 truth_type_for (tree type
)
11413 if (TREE_CODE (type
) == VECTOR_TYPE
)
11415 if (VECTOR_BOOLEAN_TYPE_P (type
))
11417 return build_truth_vector_type (TYPE_VECTOR_SUBPARTS (type
),
11418 GET_MODE_SIZE (TYPE_MODE (type
)));
11421 return boolean_type_node
;
11424 /* Returns the largest value obtainable by casting something in INNER type to
11428 upper_bound_in_type (tree outer
, tree inner
)
11430 unsigned int det
= 0;
11431 unsigned oprec
= TYPE_PRECISION (outer
);
11432 unsigned iprec
= TYPE_PRECISION (inner
);
11435 /* Compute a unique number for every combination. */
11436 det
|= (oprec
> iprec
) ? 4 : 0;
11437 det
|= TYPE_UNSIGNED (outer
) ? 2 : 0;
11438 det
|= TYPE_UNSIGNED (inner
) ? 1 : 0;
11440 /* Determine the exponent to use. */
11445 /* oprec <= iprec, outer: signed, inner: don't care. */
11450 /* oprec <= iprec, outer: unsigned, inner: don't care. */
11454 /* oprec > iprec, outer: signed, inner: signed. */
11458 /* oprec > iprec, outer: signed, inner: unsigned. */
11462 /* oprec > iprec, outer: unsigned, inner: signed. */
11466 /* oprec > iprec, outer: unsigned, inner: unsigned. */
11470 gcc_unreachable ();
11473 return wide_int_to_tree (outer
,
11474 wi::mask (prec
, false, TYPE_PRECISION (outer
)));
11477 /* Returns the smallest value obtainable by casting something in INNER type to
11481 lower_bound_in_type (tree outer
, tree inner
)
11483 unsigned oprec
= TYPE_PRECISION (outer
);
11484 unsigned iprec
= TYPE_PRECISION (inner
);
11486 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
11488 if (TYPE_UNSIGNED (outer
)
11489 /* If we are widening something of an unsigned type, OUTER type
11490 contains all values of INNER type. In particular, both INNER
11491 and OUTER types have zero in common. */
11492 || (oprec
> iprec
&& TYPE_UNSIGNED (inner
)))
11493 return build_int_cst (outer
, 0);
11496 /* If we are widening a signed type to another signed type, we
11497 want to obtain -2^^(iprec-1). If we are keeping the
11498 precision or narrowing to a signed type, we want to obtain
11500 unsigned prec
= oprec
> iprec
? iprec
: oprec
;
11501 return wide_int_to_tree (outer
,
11502 wi::mask (prec
- 1, true,
11503 TYPE_PRECISION (outer
)));
11507 /* Return nonzero if two operands that are suitable for PHI nodes are
11508 necessarily equal. Specifically, both ARG0 and ARG1 must be either
11509 SSA_NAME or invariant. Note that this is strictly an optimization.
11510 That is, callers of this function can directly call operand_equal_p
11511 and get the same result, only slower. */
11514 operand_equal_for_phi_arg_p (const_tree arg0
, const_tree arg1
)
11518 if (TREE_CODE (arg0
) == SSA_NAME
|| TREE_CODE (arg1
) == SSA_NAME
)
11520 return operand_equal_p (arg0
, arg1
, 0);
11523 /* Returns number of zeros at the end of binary representation of X. */
11526 num_ending_zeros (const_tree x
)
11528 return build_int_cst (TREE_TYPE (x
), wi::ctz (x
));
11532 #define WALK_SUBTREE(NODE) \
11535 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
11541 /* This is a subroutine of walk_tree that walks field of TYPE that are to
11542 be walked whenever a type is seen in the tree. Rest of operands and return
11543 value are as for walk_tree. */
11546 walk_type_fields (tree type
, walk_tree_fn func
, void *data
,
11547 hash_set
<tree
> *pset
, walk_tree_lh lh
)
11549 tree result
= NULL_TREE
;
11551 switch (TREE_CODE (type
))
11554 case REFERENCE_TYPE
:
11556 /* We have to worry about mutually recursive pointers. These can't
11557 be written in C. They can in Ada. It's pathological, but
11558 there's an ACATS test (c38102a) that checks it. Deal with this
11559 by checking if we're pointing to another pointer, that one
11560 points to another pointer, that one does too, and we have no htab.
11561 If so, get a hash table. We check three levels deep to avoid
11562 the cost of the hash table if we don't need one. */
11563 if (POINTER_TYPE_P (TREE_TYPE (type
))
11564 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type
)))
11565 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type
))))
11568 result
= walk_tree_without_duplicates (&TREE_TYPE (type
),
11576 /* ... fall through ... */
11579 WALK_SUBTREE (TREE_TYPE (type
));
11583 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type
));
11585 /* Fall through. */
11587 case FUNCTION_TYPE
:
11588 WALK_SUBTREE (TREE_TYPE (type
));
11592 /* We never want to walk into default arguments. */
11593 for (arg
= TYPE_ARG_TYPES (type
); arg
; arg
= TREE_CHAIN (arg
))
11594 WALK_SUBTREE (TREE_VALUE (arg
));
11599 /* Don't follow this nodes's type if a pointer for fear that
11600 we'll have infinite recursion. If we have a PSET, then we
11603 || (!POINTER_TYPE_P (TREE_TYPE (type
))
11604 && TREE_CODE (TREE_TYPE (type
)) != OFFSET_TYPE
))
11605 WALK_SUBTREE (TREE_TYPE (type
));
11606 WALK_SUBTREE (TYPE_DOMAIN (type
));
11610 WALK_SUBTREE (TREE_TYPE (type
));
11611 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type
));
11621 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
11622 called with the DATA and the address of each sub-tree. If FUNC returns a
11623 non-NULL value, the traversal is stopped, and the value returned by FUNC
11624 is returned. If PSET is non-NULL it is used to record the nodes visited,
11625 and to avoid visiting a node more than once. */
11628 walk_tree_1 (tree
*tp
, walk_tree_fn func
, void *data
,
11629 hash_set
<tree
> *pset
, walk_tree_lh lh
)
11631 enum tree_code code
;
11635 #define WALK_SUBTREE_TAIL(NODE) \
11639 goto tail_recurse; \
11644 /* Skip empty subtrees. */
11648 /* Don't walk the same tree twice, if the user has requested
11649 that we avoid doing so. */
11650 if (pset
&& pset
->add (*tp
))
11653 /* Call the function. */
11655 result
= (*func
) (tp
, &walk_subtrees
, data
);
11657 /* If we found something, return it. */
11661 code
= TREE_CODE (*tp
);
11663 /* Even if we didn't, FUNC may have decided that there was nothing
11664 interesting below this point in the tree. */
11665 if (!walk_subtrees
)
11667 /* But we still need to check our siblings. */
11668 if (code
== TREE_LIST
)
11669 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
11670 else if (code
== OMP_CLAUSE
)
11671 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11678 result
= (*lh
) (tp
, &walk_subtrees
, func
, data
, pset
);
11679 if (result
|| !walk_subtrees
)
11686 case IDENTIFIER_NODE
:
11693 case PLACEHOLDER_EXPR
:
11697 /* None of these have subtrees other than those already walked
11702 WALK_SUBTREE (TREE_VALUE (*tp
));
11703 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
11708 int len
= TREE_VEC_LENGTH (*tp
);
11713 /* Walk all elements but the first. */
11715 WALK_SUBTREE (TREE_VEC_ELT (*tp
, len
));
11717 /* Now walk the first one as a tail call. */
11718 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp
, 0));
11722 WALK_SUBTREE (TREE_REALPART (*tp
));
11723 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp
));
11727 unsigned HOST_WIDE_INT idx
;
11728 constructor_elt
*ce
;
11730 for (idx
= 0; vec_safe_iterate (CONSTRUCTOR_ELTS (*tp
), idx
, &ce
);
11732 WALK_SUBTREE (ce
->value
);
11737 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, 0));
11742 for (decl
= BIND_EXPR_VARS (*tp
); decl
; decl
= DECL_CHAIN (decl
))
11744 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
11745 into declarations that are just mentioned, rather than
11746 declared; they don't really belong to this part of the tree.
11747 And, we can see cycles: the initializer for a declaration
11748 can refer to the declaration itself. */
11749 WALK_SUBTREE (DECL_INITIAL (decl
));
11750 WALK_SUBTREE (DECL_SIZE (decl
));
11751 WALK_SUBTREE (DECL_SIZE_UNIT (decl
));
11753 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp
));
11756 case STATEMENT_LIST
:
11758 tree_stmt_iterator i
;
11759 for (i
= tsi_start (*tp
); !tsi_end_p (i
); tsi_next (&i
))
11760 WALK_SUBTREE (*tsi_stmt_ptr (i
));
11765 switch (OMP_CLAUSE_CODE (*tp
))
11767 case OMP_CLAUSE_GANG
:
11768 case OMP_CLAUSE__GRIDDIM_
:
11769 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 1));
11772 case OMP_CLAUSE_ASYNC
:
11773 case OMP_CLAUSE_WAIT
:
11774 case OMP_CLAUSE_WORKER
:
11775 case OMP_CLAUSE_VECTOR
:
11776 case OMP_CLAUSE_NUM_GANGS
:
11777 case OMP_CLAUSE_NUM_WORKERS
:
11778 case OMP_CLAUSE_VECTOR_LENGTH
:
11779 case OMP_CLAUSE_PRIVATE
:
11780 case OMP_CLAUSE_SHARED
:
11781 case OMP_CLAUSE_FIRSTPRIVATE
:
11782 case OMP_CLAUSE_COPYIN
:
11783 case OMP_CLAUSE_COPYPRIVATE
:
11784 case OMP_CLAUSE_FINAL
:
11785 case OMP_CLAUSE_IF
:
11786 case OMP_CLAUSE_NUM_THREADS
:
11787 case OMP_CLAUSE_SCHEDULE
:
11788 case OMP_CLAUSE_UNIFORM
:
11789 case OMP_CLAUSE_DEPEND
:
11790 case OMP_CLAUSE_NUM_TEAMS
:
11791 case OMP_CLAUSE_THREAD_LIMIT
:
11792 case OMP_CLAUSE_DEVICE
:
11793 case OMP_CLAUSE_DIST_SCHEDULE
:
11794 case OMP_CLAUSE_SAFELEN
:
11795 case OMP_CLAUSE_SIMDLEN
:
11796 case OMP_CLAUSE_ORDERED
:
11797 case OMP_CLAUSE_PRIORITY
:
11798 case OMP_CLAUSE_GRAINSIZE
:
11799 case OMP_CLAUSE_NUM_TASKS
:
11800 case OMP_CLAUSE_HINT
:
11801 case OMP_CLAUSE_TO_DECLARE
:
11802 case OMP_CLAUSE_LINK
:
11803 case OMP_CLAUSE_USE_DEVICE_PTR
:
11804 case OMP_CLAUSE_IS_DEVICE_PTR
:
11805 case OMP_CLAUSE__LOOPTEMP_
:
11806 case OMP_CLAUSE__SIMDUID_
:
11807 case OMP_CLAUSE__CILK_FOR_COUNT_
:
11808 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 0));
11811 case OMP_CLAUSE_INDEPENDENT
:
11812 case OMP_CLAUSE_NOWAIT
:
11813 case OMP_CLAUSE_DEFAULT
:
11814 case OMP_CLAUSE_UNTIED
:
11815 case OMP_CLAUSE_MERGEABLE
:
11816 case OMP_CLAUSE_PROC_BIND
:
11817 case OMP_CLAUSE_INBRANCH
:
11818 case OMP_CLAUSE_NOTINBRANCH
:
11819 case OMP_CLAUSE_FOR
:
11820 case OMP_CLAUSE_PARALLEL
:
11821 case OMP_CLAUSE_SECTIONS
:
11822 case OMP_CLAUSE_TASKGROUP
:
11823 case OMP_CLAUSE_NOGROUP
:
11824 case OMP_CLAUSE_THREADS
:
11825 case OMP_CLAUSE_SIMD
:
11826 case OMP_CLAUSE_DEFAULTMAP
:
11827 case OMP_CLAUSE_AUTO
:
11828 case OMP_CLAUSE_SEQ
:
11829 case OMP_CLAUSE_TILE
:
11830 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11832 case OMP_CLAUSE_LASTPRIVATE
:
11833 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
11834 WALK_SUBTREE (OMP_CLAUSE_LASTPRIVATE_STMT (*tp
));
11835 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11837 case OMP_CLAUSE_COLLAPSE
:
11840 for (i
= 0; i
< 3; i
++)
11841 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
11842 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11845 case OMP_CLAUSE_LINEAR
:
11846 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
11847 WALK_SUBTREE (OMP_CLAUSE_LINEAR_STEP (*tp
));
11848 WALK_SUBTREE (OMP_CLAUSE_LINEAR_STMT (*tp
));
11849 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11851 case OMP_CLAUSE_ALIGNED
:
11852 case OMP_CLAUSE_FROM
:
11853 case OMP_CLAUSE_TO
:
11854 case OMP_CLAUSE_MAP
:
11855 case OMP_CLAUSE__CACHE_
:
11856 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
11857 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 1));
11858 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11860 case OMP_CLAUSE_REDUCTION
:
11863 for (i
= 0; i
< 5; i
++)
11864 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
11865 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11869 gcc_unreachable ();
11877 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
11878 But, we only want to walk once. */
11879 len
= (TREE_OPERAND (*tp
, 3) == TREE_OPERAND (*tp
, 1)) ? 2 : 3;
11880 for (i
= 0; i
< len
; ++i
)
11881 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
11882 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
));
11886 /* If this is a TYPE_DECL, walk into the fields of the type that it's
11887 defining. We only want to walk into these fields of a type in this
11888 case and not in the general case of a mere reference to the type.
11890 The criterion is as follows: if the field can be an expression, it
11891 must be walked only here. This should be in keeping with the fields
11892 that are directly gimplified in gimplify_type_sizes in order for the
11893 mark/copy-if-shared/unmark machinery of the gimplifier to work with
11894 variable-sized types.
11896 Note that DECLs get walked as part of processing the BIND_EXPR. */
11897 if (TREE_CODE (DECL_EXPR_DECL (*tp
)) == TYPE_DECL
)
11899 tree
*type_p
= &TREE_TYPE (DECL_EXPR_DECL (*tp
));
11900 if (TREE_CODE (*type_p
) == ERROR_MARK
)
11903 /* Call the function for the type. See if it returns anything or
11904 doesn't want us to continue. If we are to continue, walk both
11905 the normal fields and those for the declaration case. */
11906 result
= (*func
) (type_p
, &walk_subtrees
, data
);
11907 if (result
|| !walk_subtrees
)
11910 /* But do not walk a pointed-to type since it may itself need to
11911 be walked in the declaration case if it isn't anonymous. */
11912 if (!POINTER_TYPE_P (*type_p
))
11914 result
= walk_type_fields (*type_p
, func
, data
, pset
, lh
);
11919 /* If this is a record type, also walk the fields. */
11920 if (RECORD_OR_UNION_TYPE_P (*type_p
))
11924 for (field
= TYPE_FIELDS (*type_p
); field
;
11925 field
= DECL_CHAIN (field
))
11927 /* We'd like to look at the type of the field, but we can
11928 easily get infinite recursion. So assume it's pointed
11929 to elsewhere in the tree. Also, ignore things that
11931 if (TREE_CODE (field
) != FIELD_DECL
)
11934 WALK_SUBTREE (DECL_FIELD_OFFSET (field
));
11935 WALK_SUBTREE (DECL_SIZE (field
));
11936 WALK_SUBTREE (DECL_SIZE_UNIT (field
));
11937 if (TREE_CODE (*type_p
) == QUAL_UNION_TYPE
)
11938 WALK_SUBTREE (DECL_QUALIFIER (field
));
11942 /* Same for scalar types. */
11943 else if (TREE_CODE (*type_p
) == BOOLEAN_TYPE
11944 || TREE_CODE (*type_p
) == ENUMERAL_TYPE
11945 || TREE_CODE (*type_p
) == INTEGER_TYPE
11946 || TREE_CODE (*type_p
) == FIXED_POINT_TYPE
11947 || TREE_CODE (*type_p
) == REAL_TYPE
)
11949 WALK_SUBTREE (TYPE_MIN_VALUE (*type_p
));
11950 WALK_SUBTREE (TYPE_MAX_VALUE (*type_p
));
11953 WALK_SUBTREE (TYPE_SIZE (*type_p
));
11954 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p
));
11959 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code
)))
11963 /* Walk over all the sub-trees of this operand. */
11964 len
= TREE_OPERAND_LENGTH (*tp
);
11966 /* Go through the subtrees. We need to do this in forward order so
11967 that the scope of a FOR_EXPR is handled properly. */
11970 for (i
= 0; i
< len
- 1; ++i
)
11971 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
11972 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
- 1));
11975 /* If this is a type, walk the needed fields in the type. */
11976 else if (TYPE_P (*tp
))
11977 return walk_type_fields (*tp
, func
, data
, pset
, lh
);
11981 /* We didn't find what we were looking for. */
11984 #undef WALK_SUBTREE_TAIL
11986 #undef WALK_SUBTREE
11988 /* Like walk_tree, but does not walk duplicate nodes more than once. */
11991 walk_tree_without_duplicates_1 (tree
*tp
, walk_tree_fn func
, void *data
,
11996 hash_set
<tree
> pset
;
11997 result
= walk_tree_1 (tp
, func
, data
, &pset
, lh
);
12003 tree_block (tree t
)
12005 const enum tree_code_class c
= TREE_CODE_CLASS (TREE_CODE (t
));
12007 if (IS_EXPR_CODE_CLASS (c
))
12008 return LOCATION_BLOCK (t
->exp
.locus
);
12009 gcc_unreachable ();
12014 tree_set_block (tree t
, tree b
)
12016 const enum tree_code_class c
= TREE_CODE_CLASS (TREE_CODE (t
));
12018 if (IS_EXPR_CODE_CLASS (c
))
12020 t
->exp
.locus
= set_block (t
->exp
.locus
, b
);
12023 gcc_unreachable ();
12026 /* Create a nameless artificial label and put it in the current
12027 function context. The label has a location of LOC. Returns the
12028 newly created label. */
12031 create_artificial_label (location_t loc
)
12033 tree lab
= build_decl (loc
,
12034 LABEL_DECL
, NULL_TREE
, void_type_node
);
12036 DECL_ARTIFICIAL (lab
) = 1;
12037 DECL_IGNORED_P (lab
) = 1;
12038 DECL_CONTEXT (lab
) = current_function_decl
;
12042 /* Given a tree, try to return a useful variable name that we can use
12043 to prefix a temporary that is being assigned the value of the tree.
12044 I.E. given <temp> = &A, return A. */
12049 tree stripped_decl
;
12052 STRIP_NOPS (stripped_decl
);
12053 if (DECL_P (stripped_decl
) && DECL_NAME (stripped_decl
))
12054 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl
));
12055 else if (TREE_CODE (stripped_decl
) == SSA_NAME
)
12057 tree name
= SSA_NAME_IDENTIFIER (stripped_decl
);
12060 return IDENTIFIER_POINTER (name
);
12064 switch (TREE_CODE (stripped_decl
))
12067 return get_name (TREE_OPERAND (stripped_decl
, 0));
12074 /* Return true if TYPE has a variable argument list. */
12077 stdarg_p (const_tree fntype
)
12079 function_args_iterator args_iter
;
12080 tree n
= NULL_TREE
, t
;
12085 FOREACH_FUNCTION_ARGS (fntype
, t
, args_iter
)
12090 return n
!= NULL_TREE
&& n
!= void_type_node
;
12093 /* Return true if TYPE has a prototype. */
12096 prototype_p (const_tree fntype
)
12100 gcc_assert (fntype
!= NULL_TREE
);
12102 t
= TYPE_ARG_TYPES (fntype
);
12103 return (t
!= NULL_TREE
);
12106 /* If BLOCK is inlined from an __attribute__((__artificial__))
12107 routine, return pointer to location from where it has been
12110 block_nonartificial_location (tree block
)
12112 location_t
*ret
= NULL
;
12114 while (block
&& TREE_CODE (block
) == BLOCK
12115 && BLOCK_ABSTRACT_ORIGIN (block
))
12117 tree ao
= BLOCK_ABSTRACT_ORIGIN (block
);
12119 while (TREE_CODE (ao
) == BLOCK
12120 && BLOCK_ABSTRACT_ORIGIN (ao
)
12121 && BLOCK_ABSTRACT_ORIGIN (ao
) != ao
)
12122 ao
= BLOCK_ABSTRACT_ORIGIN (ao
);
12124 if (TREE_CODE (ao
) == FUNCTION_DECL
)
12126 /* If AO is an artificial inline, point RET to the
12127 call site locus at which it has been inlined and continue
12128 the loop, in case AO's caller is also an artificial
12130 if (DECL_DECLARED_INLINE_P (ao
)
12131 && lookup_attribute ("artificial", DECL_ATTRIBUTES (ao
)))
12132 ret
= &BLOCK_SOURCE_LOCATION (block
);
12136 else if (TREE_CODE (ao
) != BLOCK
)
12139 block
= BLOCK_SUPERCONTEXT (block
);
12145 /* If EXP is inlined from an __attribute__((__artificial__))
12146 function, return the location of the original call expression. */
12149 tree_nonartificial_location (tree exp
)
12151 location_t
*loc
= block_nonartificial_location (TREE_BLOCK (exp
));
12156 return EXPR_LOCATION (exp
);
12160 /* These are the hash table functions for the hash table of OPTIMIZATION_NODEq
12163 /* Return the hash code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
12166 cl_option_hasher::hash (tree x
)
12168 const_tree
const t
= x
;
12172 hashval_t hash
= 0;
12174 if (TREE_CODE (t
) == OPTIMIZATION_NODE
)
12176 p
= (const char *)TREE_OPTIMIZATION (t
);
12177 len
= sizeof (struct cl_optimization
);
12180 else if (TREE_CODE (t
) == TARGET_OPTION_NODE
)
12181 return cl_target_option_hash (TREE_TARGET_OPTION (t
));
12184 gcc_unreachable ();
12186 /* assume most opt flags are just 0/1, some are 2-3, and a few might be
12188 for (i
= 0; i
< len
; i
++)
12190 hash
= (hash
<< 4) ^ ((i
<< 2) | p
[i
]);
12195 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
12196 TARGET_OPTION tree node) is the same as that given by *Y, which is the
12200 cl_option_hasher::equal (tree x
, tree y
)
12202 const_tree
const xt
= x
;
12203 const_tree
const yt
= y
;
12208 if (TREE_CODE (xt
) != TREE_CODE (yt
))
12211 if (TREE_CODE (xt
) == OPTIMIZATION_NODE
)
12213 xp
= (const char *)TREE_OPTIMIZATION (xt
);
12214 yp
= (const char *)TREE_OPTIMIZATION (yt
);
12215 len
= sizeof (struct cl_optimization
);
12218 else if (TREE_CODE (xt
) == TARGET_OPTION_NODE
)
12220 return cl_target_option_eq (TREE_TARGET_OPTION (xt
),
12221 TREE_TARGET_OPTION (yt
));
12225 gcc_unreachable ();
12227 return (memcmp (xp
, yp
, len
) == 0);
12230 /* Build an OPTIMIZATION_NODE based on the options in OPTS. */
12233 build_optimization_node (struct gcc_options
*opts
)
12237 /* Use the cache of optimization nodes. */
12239 cl_optimization_save (TREE_OPTIMIZATION (cl_optimization_node
),
12242 tree
*slot
= cl_option_hash_table
->find_slot (cl_optimization_node
, INSERT
);
12246 /* Insert this one into the hash table. */
12247 t
= cl_optimization_node
;
12250 /* Make a new node for next time round. */
12251 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
12257 /* Build a TARGET_OPTION_NODE based on the options in OPTS. */
12260 build_target_option_node (struct gcc_options
*opts
)
12264 /* Use the cache of optimization nodes. */
12266 cl_target_option_save (TREE_TARGET_OPTION (cl_target_option_node
),
12269 tree
*slot
= cl_option_hash_table
->find_slot (cl_target_option_node
, INSERT
);
12273 /* Insert this one into the hash table. */
12274 t
= cl_target_option_node
;
12277 /* Make a new node for next time round. */
12278 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
12284 /* Clear TREE_TARGET_GLOBALS of all TARGET_OPTION_NODE trees,
12285 so that they aren't saved during PCH writing. */
12288 prepare_target_option_nodes_for_pch (void)
12290 hash_table
<cl_option_hasher
>::iterator iter
= cl_option_hash_table
->begin ();
12291 for (; iter
!= cl_option_hash_table
->end (); ++iter
)
12292 if (TREE_CODE (*iter
) == TARGET_OPTION_NODE
)
12293 TREE_TARGET_GLOBALS (*iter
) = NULL
;
12296 /* Determine the "ultimate origin" of a block. The block may be an inlined
12297 instance of an inlined instance of a block which is local to an inline
12298 function, so we have to trace all of the way back through the origin chain
12299 to find out what sort of node actually served as the original seed for the
12303 block_ultimate_origin (const_tree block
)
12305 tree immediate_origin
= BLOCK_ABSTRACT_ORIGIN (block
);
12307 /* BLOCK_ABSTRACT_ORIGIN can point to itself; ignore that if
12308 we're trying to output the abstract instance of this function. */
12309 if (BLOCK_ABSTRACT (block
) && immediate_origin
== block
)
12312 if (immediate_origin
== NULL_TREE
)
12317 tree lookahead
= immediate_origin
;
12321 ret_val
= lookahead
;
12322 lookahead
= (TREE_CODE (ret_val
) == BLOCK
12323 ? BLOCK_ABSTRACT_ORIGIN (ret_val
) : NULL
);
12325 while (lookahead
!= NULL
&& lookahead
!= ret_val
);
12327 /* The block's abstract origin chain may not be the *ultimate* origin of
12328 the block. It could lead to a DECL that has an abstract origin set.
12329 If so, we want that DECL's abstract origin (which is what DECL_ORIGIN
12330 will give us if it has one). Note that DECL's abstract origins are
12331 supposed to be the most distant ancestor (or so decl_ultimate_origin
12332 claims), so we don't need to loop following the DECL origins. */
12333 if (DECL_P (ret_val
))
12334 return DECL_ORIGIN (ret_val
);
12340 /* Return true iff conversion from INNER_TYPE to OUTER_TYPE generates
12344 tree_nop_conversion_p (const_tree outer_type
, const_tree inner_type
)
12346 /* Do not strip casts into or out of differing address spaces. */
12347 if (POINTER_TYPE_P (outer_type
)
12348 && TYPE_ADDR_SPACE (TREE_TYPE (outer_type
)) != ADDR_SPACE_GENERIC
)
12350 if (!POINTER_TYPE_P (inner_type
)
12351 || (TYPE_ADDR_SPACE (TREE_TYPE (outer_type
))
12352 != TYPE_ADDR_SPACE (TREE_TYPE (inner_type
))))
12355 else if (POINTER_TYPE_P (inner_type
)
12356 && TYPE_ADDR_SPACE (TREE_TYPE (inner_type
)) != ADDR_SPACE_GENERIC
)
12358 /* We already know that outer_type is not a pointer with
12359 a non-generic address space. */
12363 /* Use precision rather then machine mode when we can, which gives
12364 the correct answer even for submode (bit-field) types. */
12365 if ((INTEGRAL_TYPE_P (outer_type
)
12366 || POINTER_TYPE_P (outer_type
)
12367 || TREE_CODE (outer_type
) == OFFSET_TYPE
)
12368 && (INTEGRAL_TYPE_P (inner_type
)
12369 || POINTER_TYPE_P (inner_type
)
12370 || TREE_CODE (inner_type
) == OFFSET_TYPE
))
12371 return TYPE_PRECISION (outer_type
) == TYPE_PRECISION (inner_type
);
12373 /* Otherwise fall back on comparing machine modes (e.g. for
12374 aggregate types, floats). */
12375 return TYPE_MODE (outer_type
) == TYPE_MODE (inner_type
);
12378 /* Return true iff conversion in EXP generates no instruction. Mark
12379 it inline so that we fully inline into the stripping functions even
12380 though we have two uses of this function. */
12383 tree_nop_conversion (const_tree exp
)
12385 tree outer_type
, inner_type
;
12387 if (!CONVERT_EXPR_P (exp
)
12388 && TREE_CODE (exp
) != NON_LVALUE_EXPR
)
12390 if (TREE_OPERAND (exp
, 0) == error_mark_node
)
12393 outer_type
= TREE_TYPE (exp
);
12394 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
12399 return tree_nop_conversion_p (outer_type
, inner_type
);
12402 /* Return true iff conversion in EXP generates no instruction. Don't
12403 consider conversions changing the signedness. */
12406 tree_sign_nop_conversion (const_tree exp
)
12408 tree outer_type
, inner_type
;
12410 if (!tree_nop_conversion (exp
))
12413 outer_type
= TREE_TYPE (exp
);
12414 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
12416 return (TYPE_UNSIGNED (outer_type
) == TYPE_UNSIGNED (inner_type
)
12417 && POINTER_TYPE_P (outer_type
) == POINTER_TYPE_P (inner_type
));
12420 /* Strip conversions from EXP according to tree_nop_conversion and
12421 return the resulting expression. */
12424 tree_strip_nop_conversions (tree exp
)
12426 while (tree_nop_conversion (exp
))
12427 exp
= TREE_OPERAND (exp
, 0);
12431 /* Strip conversions from EXP according to tree_sign_nop_conversion
12432 and return the resulting expression. */
12435 tree_strip_sign_nop_conversions (tree exp
)
12437 while (tree_sign_nop_conversion (exp
))
12438 exp
= TREE_OPERAND (exp
, 0);
12442 /* Avoid any floating point extensions from EXP. */
12444 strip_float_extensions (tree exp
)
12446 tree sub
, expt
, subt
;
12448 /* For floating point constant look up the narrowest type that can hold
12449 it properly and handle it like (type)(narrowest_type)constant.
12450 This way we can optimize for instance a=a*2.0 where "a" is float
12451 but 2.0 is double constant. */
12452 if (TREE_CODE (exp
) == REAL_CST
&& !DECIMAL_FLOAT_TYPE_P (TREE_TYPE (exp
)))
12454 REAL_VALUE_TYPE orig
;
12457 orig
= TREE_REAL_CST (exp
);
12458 if (TYPE_PRECISION (TREE_TYPE (exp
)) > TYPE_PRECISION (float_type_node
)
12459 && exact_real_truncate (TYPE_MODE (float_type_node
), &orig
))
12460 type
= float_type_node
;
12461 else if (TYPE_PRECISION (TREE_TYPE (exp
))
12462 > TYPE_PRECISION (double_type_node
)
12463 && exact_real_truncate (TYPE_MODE (double_type_node
), &orig
))
12464 type
= double_type_node
;
12466 return build_real_truncate (type
, orig
);
12469 if (!CONVERT_EXPR_P (exp
))
12472 sub
= TREE_OPERAND (exp
, 0);
12473 subt
= TREE_TYPE (sub
);
12474 expt
= TREE_TYPE (exp
);
12476 if (!FLOAT_TYPE_P (subt
))
12479 if (DECIMAL_FLOAT_TYPE_P (expt
) != DECIMAL_FLOAT_TYPE_P (subt
))
12482 if (TYPE_PRECISION (subt
) > TYPE_PRECISION (expt
))
12485 return strip_float_extensions (sub
);
12488 /* Strip out all handled components that produce invariant
12492 strip_invariant_refs (const_tree op
)
12494 while (handled_component_p (op
))
12496 switch (TREE_CODE (op
))
12499 case ARRAY_RANGE_REF
:
12500 if (!is_gimple_constant (TREE_OPERAND (op
, 1))
12501 || TREE_OPERAND (op
, 2) != NULL_TREE
12502 || TREE_OPERAND (op
, 3) != NULL_TREE
)
12506 case COMPONENT_REF
:
12507 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
12513 op
= TREE_OPERAND (op
, 0);
12519 static GTY(()) tree gcc_eh_personality_decl
;
12521 /* Return the GCC personality function decl. */
12524 lhd_gcc_personality (void)
12526 if (!gcc_eh_personality_decl
)
12527 gcc_eh_personality_decl
= build_personality_function ("gcc");
12528 return gcc_eh_personality_decl
;
12531 /* TARGET is a call target of GIMPLE call statement
12532 (obtained by gimple_call_fn). Return true if it is
12533 OBJ_TYPE_REF representing an virtual call of C++ method.
12534 (As opposed to OBJ_TYPE_REF representing objc calls
12535 through a cast where middle-end devirtualization machinery
12539 virtual_method_call_p (const_tree target
)
12541 if (TREE_CODE (target
) != OBJ_TYPE_REF
)
12543 tree t
= TREE_TYPE (target
);
12544 gcc_checking_assert (TREE_CODE (t
) == POINTER_TYPE
);
12546 if (TREE_CODE (t
) == FUNCTION_TYPE
)
12548 gcc_checking_assert (TREE_CODE (t
) == METHOD_TYPE
);
12549 /* If we do not have BINFO associated, it means that type was built
12550 without devirtualization enabled. Do not consider this a virtual
12552 if (!TYPE_BINFO (obj_type_ref_class (target
)))
12557 /* REF is OBJ_TYPE_REF, return the class the ref corresponds to. */
12560 obj_type_ref_class (const_tree ref
)
12562 gcc_checking_assert (TREE_CODE (ref
) == OBJ_TYPE_REF
);
12563 ref
= TREE_TYPE (ref
);
12564 gcc_checking_assert (TREE_CODE (ref
) == POINTER_TYPE
);
12565 ref
= TREE_TYPE (ref
);
12566 /* We look for type THIS points to. ObjC also builds
12567 OBJ_TYPE_REF with non-method calls, Their first parameter
12568 ID however also corresponds to class type. */
12569 gcc_checking_assert (TREE_CODE (ref
) == METHOD_TYPE
12570 || TREE_CODE (ref
) == FUNCTION_TYPE
);
12571 ref
= TREE_VALUE (TYPE_ARG_TYPES (ref
));
12572 gcc_checking_assert (TREE_CODE (ref
) == POINTER_TYPE
);
12573 return TREE_TYPE (ref
);
12576 /* Lookup sub-BINFO of BINFO of TYPE at offset POS. */
12579 lookup_binfo_at_offset (tree binfo
, tree type
, HOST_WIDE_INT pos
)
12582 tree base_binfo
, b
;
12584 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
12585 if (pos
== tree_to_shwi (BINFO_OFFSET (base_binfo
))
12586 && types_same_for_odr (TREE_TYPE (base_binfo
), type
))
12588 else if ((b
= lookup_binfo_at_offset (base_binfo
, type
, pos
)) != NULL
)
12593 /* Try to find a base info of BINFO that would have its field decl at offset
12594 OFFSET within the BINFO type and which is of EXPECTED_TYPE. If it can be
12595 found, return, otherwise return NULL_TREE. */
12598 get_binfo_at_offset (tree binfo
, HOST_WIDE_INT offset
, tree expected_type
)
12600 tree type
= BINFO_TYPE (binfo
);
12604 HOST_WIDE_INT pos
, size
;
12608 if (types_same_for_odr (type
, expected_type
))
12613 for (fld
= TYPE_FIELDS (type
); fld
; fld
= DECL_CHAIN (fld
))
12615 if (TREE_CODE (fld
) != FIELD_DECL
|| !DECL_ARTIFICIAL (fld
))
12618 pos
= int_bit_position (fld
);
12619 size
= tree_to_uhwi (DECL_SIZE (fld
));
12620 if (pos
<= offset
&& (pos
+ size
) > offset
)
12623 if (!fld
|| TREE_CODE (TREE_TYPE (fld
)) != RECORD_TYPE
)
12626 /* Offset 0 indicates the primary base, whose vtable contents are
12627 represented in the binfo for the derived class. */
12628 else if (offset
!= 0)
12630 tree found_binfo
= NULL
, base_binfo
;
12631 /* Offsets in BINFO are in bytes relative to the whole structure
12632 while POS is in bits relative to the containing field. */
12633 int binfo_offset
= (tree_to_shwi (BINFO_OFFSET (binfo
)) + pos
12636 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
12637 if (tree_to_shwi (BINFO_OFFSET (base_binfo
)) == binfo_offset
12638 && types_same_for_odr (TREE_TYPE (base_binfo
), TREE_TYPE (fld
)))
12640 found_binfo
= base_binfo
;
12644 binfo
= found_binfo
;
12646 binfo
= lookup_binfo_at_offset (binfo
, TREE_TYPE (fld
),
12650 type
= TREE_TYPE (fld
);
12655 /* Returns true if X is a typedef decl. */
12658 is_typedef_decl (const_tree x
)
12660 return (x
&& TREE_CODE (x
) == TYPE_DECL
12661 && DECL_ORIGINAL_TYPE (x
) != NULL_TREE
);
12664 /* Returns true iff TYPE is a type variant created for a typedef. */
12667 typedef_variant_p (const_tree type
)
12669 return is_typedef_decl (TYPE_NAME (type
));
12672 /* Warn about a use of an identifier which was marked deprecated. */
12674 warn_deprecated_use (tree node
, tree attr
)
12678 if (node
== 0 || !warn_deprecated_decl
)
12684 attr
= DECL_ATTRIBUTES (node
);
12685 else if (TYPE_P (node
))
12687 tree decl
= TYPE_STUB_DECL (node
);
12689 attr
= lookup_attribute ("deprecated",
12690 TYPE_ATTRIBUTES (TREE_TYPE (decl
)));
12695 attr
= lookup_attribute ("deprecated", attr
);
12698 msg
= TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr
)));
12706 w
= warning (OPT_Wdeprecated_declarations
,
12707 "%qD is deprecated: %s", node
, msg
);
12709 w
= warning (OPT_Wdeprecated_declarations
,
12710 "%qD is deprecated", node
);
12712 inform (DECL_SOURCE_LOCATION (node
), "declared here");
12714 else if (TYPE_P (node
))
12716 tree what
= NULL_TREE
;
12717 tree decl
= TYPE_STUB_DECL (node
);
12719 if (TYPE_NAME (node
))
12721 if (TREE_CODE (TYPE_NAME (node
)) == IDENTIFIER_NODE
)
12722 what
= TYPE_NAME (node
);
12723 else if (TREE_CODE (TYPE_NAME (node
)) == TYPE_DECL
12724 && DECL_NAME (TYPE_NAME (node
)))
12725 what
= DECL_NAME (TYPE_NAME (node
));
12733 w
= warning (OPT_Wdeprecated_declarations
,
12734 "%qE is deprecated: %s", what
, msg
);
12736 w
= warning (OPT_Wdeprecated_declarations
,
12737 "%qE is deprecated", what
);
12742 w
= warning (OPT_Wdeprecated_declarations
,
12743 "type is deprecated: %s", msg
);
12745 w
= warning (OPT_Wdeprecated_declarations
,
12746 "type is deprecated");
12749 inform (DECL_SOURCE_LOCATION (decl
), "declared here");
12756 warning (OPT_Wdeprecated_declarations
, "%qE is deprecated: %s",
12759 warning (OPT_Wdeprecated_declarations
, "%qE is deprecated", what
);
12764 warning (OPT_Wdeprecated_declarations
, "type is deprecated: %s",
12767 warning (OPT_Wdeprecated_declarations
, "type is deprecated");
12773 /* Return true if REF has a COMPONENT_REF with a bit-field field declaration
12774 somewhere in it. */
12777 contains_bitfld_component_ref_p (const_tree ref
)
12779 while (handled_component_p (ref
))
12781 if (TREE_CODE (ref
) == COMPONENT_REF
12782 && DECL_BIT_FIELD (TREE_OPERAND (ref
, 1)))
12784 ref
= TREE_OPERAND (ref
, 0);
12790 /* Try to determine whether a TRY_CATCH expression can fall through.
12791 This is a subroutine of block_may_fallthru. */
12794 try_catch_may_fallthru (const_tree stmt
)
12796 tree_stmt_iterator i
;
12798 /* If the TRY block can fall through, the whole TRY_CATCH can
12800 if (block_may_fallthru (TREE_OPERAND (stmt
, 0)))
12803 i
= tsi_start (TREE_OPERAND (stmt
, 1));
12804 switch (TREE_CODE (tsi_stmt (i
)))
12807 /* We expect to see a sequence of CATCH_EXPR trees, each with a
12808 catch expression and a body. The whole TRY_CATCH may fall
12809 through iff any of the catch bodies falls through. */
12810 for (; !tsi_end_p (i
); tsi_next (&i
))
12812 if (block_may_fallthru (CATCH_BODY (tsi_stmt (i
))))
12817 case EH_FILTER_EXPR
:
12818 /* The exception filter expression only matters if there is an
12819 exception. If the exception does not match EH_FILTER_TYPES,
12820 we will execute EH_FILTER_FAILURE, and we will fall through
12821 if that falls through. If the exception does match
12822 EH_FILTER_TYPES, the stack unwinder will continue up the
12823 stack, so we will not fall through. We don't know whether we
12824 will throw an exception which matches EH_FILTER_TYPES or not,
12825 so we just ignore EH_FILTER_TYPES and assume that we might
12826 throw an exception which doesn't match. */
12827 return block_may_fallthru (EH_FILTER_FAILURE (tsi_stmt (i
)));
12830 /* This case represents statements to be executed when an
12831 exception occurs. Those statements are implicitly followed
12832 by a RESX statement to resume execution after the exception.
12833 So in this case the TRY_CATCH never falls through. */
12838 /* Try to determine if we can fall out of the bottom of BLOCK. This guess
12839 need not be 100% accurate; simply be conservative and return true if we
12840 don't know. This is used only to avoid stupidly generating extra code.
12841 If we're wrong, we'll just delete the extra code later. */
12844 block_may_fallthru (const_tree block
)
12846 /* This CONST_CAST is okay because expr_last returns its argument
12847 unmodified and we assign it to a const_tree. */
12848 const_tree stmt
= expr_last (CONST_CAST_TREE (block
));
12850 switch (stmt
? TREE_CODE (stmt
) : ERROR_MARK
)
12854 /* Easy cases. If the last statement of the block implies
12855 control transfer, then we can't fall through. */
12859 /* If SWITCH_LABELS is set, this is lowered, and represents a
12860 branch to a selected label and hence can not fall through.
12861 Otherwise SWITCH_BODY is set, and the switch can fall
12863 return SWITCH_LABELS (stmt
) == NULL_TREE
;
12866 if (block_may_fallthru (COND_EXPR_THEN (stmt
)))
12868 return block_may_fallthru (COND_EXPR_ELSE (stmt
));
12871 return block_may_fallthru (BIND_EXPR_BODY (stmt
));
12873 case TRY_CATCH_EXPR
:
12874 return try_catch_may_fallthru (stmt
);
12876 case TRY_FINALLY_EXPR
:
12877 /* The finally clause is always executed after the try clause,
12878 so if it does not fall through, then the try-finally will not
12879 fall through. Otherwise, if the try clause does not fall
12880 through, then when the finally clause falls through it will
12881 resume execution wherever the try clause was going. So the
12882 whole try-finally will only fall through if both the try
12883 clause and the finally clause fall through. */
12884 return (block_may_fallthru (TREE_OPERAND (stmt
, 0))
12885 && block_may_fallthru (TREE_OPERAND (stmt
, 1)));
12888 if (TREE_CODE (TREE_OPERAND (stmt
, 1)) == CALL_EXPR
)
12889 stmt
= TREE_OPERAND (stmt
, 1);
12895 /* Functions that do not return do not fall through. */
12896 return (call_expr_flags (stmt
) & ECF_NORETURN
) == 0;
12898 case CLEANUP_POINT_EXPR
:
12899 return block_may_fallthru (TREE_OPERAND (stmt
, 0));
12902 return block_may_fallthru (TREE_OPERAND (stmt
, 1));
12908 return lang_hooks
.block_may_fallthru (stmt
);
12912 /* True if we are using EH to handle cleanups. */
12913 static bool using_eh_for_cleanups_flag
= false;
12915 /* This routine is called from front ends to indicate eh should be used for
12918 using_eh_for_cleanups (void)
12920 using_eh_for_cleanups_flag
= true;
12923 /* Query whether EH is used for cleanups. */
12925 using_eh_for_cleanups_p (void)
12927 return using_eh_for_cleanups_flag
;
12930 /* Wrapper for tree_code_name to ensure that tree code is valid */
12932 get_tree_code_name (enum tree_code code
)
12934 const char *invalid
= "<invalid tree code>";
12936 if (code
>= MAX_TREE_CODES
)
12939 return tree_code_name
[code
];
12942 /* Drops the TREE_OVERFLOW flag from T. */
12945 drop_tree_overflow (tree t
)
12947 gcc_checking_assert (TREE_OVERFLOW (t
));
12949 /* For tree codes with a sharing machinery re-build the result. */
12950 if (TREE_CODE (t
) == INTEGER_CST
)
12951 return wide_int_to_tree (TREE_TYPE (t
), t
);
12953 /* Otherwise, as all tcc_constants are possibly shared, copy the node
12954 and drop the flag. */
12956 TREE_OVERFLOW (t
) = 0;
12960 /* Given a memory reference expression T, return its base address.
12961 The base address of a memory reference expression is the main
12962 object being referenced. For instance, the base address for
12963 'array[i].fld[j]' is 'array'. You can think of this as stripping
12964 away the offset part from a memory address.
12966 This function calls handled_component_p to strip away all the inner
12967 parts of the memory reference until it reaches the base object. */
12970 get_base_address (tree t
)
12972 while (handled_component_p (t
))
12973 t
= TREE_OPERAND (t
, 0);
12975 if ((TREE_CODE (t
) == MEM_REF
12976 || TREE_CODE (t
) == TARGET_MEM_REF
)
12977 && TREE_CODE (TREE_OPERAND (t
, 0)) == ADDR_EXPR
)
12978 t
= TREE_OPERAND (TREE_OPERAND (t
, 0), 0);
12980 /* ??? Either the alias oracle or all callers need to properly deal
12981 with WITH_SIZE_EXPRs before we can look through those. */
12982 if (TREE_CODE (t
) == WITH_SIZE_EXPR
)
12988 /* Return a tree of sizetype representing the size, in bytes, of the element
12989 of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
12992 array_ref_element_size (tree exp
)
12994 tree aligned_size
= TREE_OPERAND (exp
, 3);
12995 tree elmt_type
= TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp
, 0)));
12996 location_t loc
= EXPR_LOCATION (exp
);
12998 /* If a size was specified in the ARRAY_REF, it's the size measured
12999 in alignment units of the element type. So multiply by that value. */
13002 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
13003 sizetype from another type of the same width and signedness. */
13004 if (TREE_TYPE (aligned_size
) != sizetype
)
13005 aligned_size
= fold_convert_loc (loc
, sizetype
, aligned_size
);
13006 return size_binop_loc (loc
, MULT_EXPR
, aligned_size
,
13007 size_int (TYPE_ALIGN_UNIT (elmt_type
)));
13010 /* Otherwise, take the size from that of the element type. Substitute
13011 any PLACEHOLDER_EXPR that we have. */
13013 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_SIZE_UNIT (elmt_type
), exp
);
13016 /* Return a tree representing the lower bound of the array mentioned in
13017 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
13020 array_ref_low_bound (tree exp
)
13022 tree domain_type
= TYPE_DOMAIN (TREE_TYPE (TREE_OPERAND (exp
, 0)));
13024 /* If a lower bound is specified in EXP, use it. */
13025 if (TREE_OPERAND (exp
, 2))
13026 return TREE_OPERAND (exp
, 2);
13028 /* Otherwise, if there is a domain type and it has a lower bound, use it,
13029 substituting for a PLACEHOLDER_EXPR as needed. */
13030 if (domain_type
&& TYPE_MIN_VALUE (domain_type
))
13031 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_MIN_VALUE (domain_type
), exp
);
13033 /* Otherwise, return a zero of the appropriate type. */
13034 return build_int_cst (TREE_TYPE (TREE_OPERAND (exp
, 1)), 0);
13037 /* Return a tree representing the upper bound of the array mentioned in
13038 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
13041 array_ref_up_bound (tree exp
)
13043 tree domain_type
= TYPE_DOMAIN (TREE_TYPE (TREE_OPERAND (exp
, 0)));
13045 /* If there is a domain type and it has an upper bound, use it, substituting
13046 for a PLACEHOLDER_EXPR as needed. */
13047 if (domain_type
&& TYPE_MAX_VALUE (domain_type
))
13048 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_MAX_VALUE (domain_type
), exp
);
13050 /* Otherwise fail. */
13054 /* Returns true if REF is an array reference to an array at the end of
13055 a structure. If this is the case, the array may be allocated larger
13056 than its upper bound implies. */
13059 array_at_struct_end_p (tree ref
)
13061 if (TREE_CODE (ref
) != ARRAY_REF
13062 && TREE_CODE (ref
) != ARRAY_RANGE_REF
)
13065 while (handled_component_p (ref
))
13067 /* If the reference chain contains a component reference to a
13068 non-union type and there follows another field the reference
13069 is not at the end of a structure. */
13070 if (TREE_CODE (ref
) == COMPONENT_REF
13071 && TREE_CODE (TREE_TYPE (TREE_OPERAND (ref
, 0))) == RECORD_TYPE
)
13073 tree nextf
= DECL_CHAIN (TREE_OPERAND (ref
, 1));
13074 while (nextf
&& TREE_CODE (nextf
) != FIELD_DECL
)
13075 nextf
= DECL_CHAIN (nextf
);
13080 ref
= TREE_OPERAND (ref
, 0);
13085 if (TREE_CODE (ref
) == MEM_REF
13086 && TREE_CODE (TREE_OPERAND (ref
, 0)) == ADDR_EXPR
)
13088 size
= TYPE_SIZE (TREE_TYPE (ref
));
13089 ref
= TREE_OPERAND (TREE_OPERAND (ref
, 0), 0);
13092 /* If the reference is based on a declared entity, the size of the array
13093 is constrained by its given domain. (Do not trust commons PR/69368). */
13095 /* Be sure the size of MEM_REF target match. For example:
13098 struct foo *str = (struct foo *)&buf;
13100 str->trailin_array[2] = 1;
13102 is valid because BUF allocate enough space. */
13104 && (!size
|| (DECL_SIZE (ref
) != NULL
13105 && operand_equal_p (DECL_SIZE (ref
), size
, 0)))
13106 && !(flag_unconstrained_commons
13107 && TREE_CODE (ref
) == VAR_DECL
&& DECL_COMMON (ref
)))
13113 /* Return a tree representing the offset, in bytes, of the field referenced
13114 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
13117 component_ref_field_offset (tree exp
)
13119 tree aligned_offset
= TREE_OPERAND (exp
, 2);
13120 tree field
= TREE_OPERAND (exp
, 1);
13121 location_t loc
= EXPR_LOCATION (exp
);
13123 /* If an offset was specified in the COMPONENT_REF, it's the offset measured
13124 in units of DECL_OFFSET_ALIGN / BITS_PER_UNIT. So multiply by that
13126 if (aligned_offset
)
13128 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
13129 sizetype from another type of the same width and signedness. */
13130 if (TREE_TYPE (aligned_offset
) != sizetype
)
13131 aligned_offset
= fold_convert_loc (loc
, sizetype
, aligned_offset
);
13132 return size_binop_loc (loc
, MULT_EXPR
, aligned_offset
,
13133 size_int (DECL_OFFSET_ALIGN (field
)
13137 /* Otherwise, take the offset from that of the field. Substitute
13138 any PLACEHOLDER_EXPR that we have. */
13140 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (DECL_FIELD_OFFSET (field
), exp
);
13143 /* Return the machine mode of T. For vectors, returns the mode of the
13144 inner type. The main use case is to feed the result to HONOR_NANS,
13145 avoiding the BLKmode that a direct TYPE_MODE (T) might return. */
13148 element_mode (const_tree t
)
13152 if (VECTOR_TYPE_P (t
) || TREE_CODE (t
) == COMPLEX_TYPE
)
13154 return TYPE_MODE (t
);
13158 /* Veirfy that basic properties of T match TV and thus T can be a variant of
13159 TV. TV should be the more specified variant (i.e. the main variant). */
13162 verify_type_variant (const_tree t
, tree tv
)
13164 /* Type variant can differ by:
13166 - TYPE_QUALS: TYPE_READONLY, TYPE_VOLATILE, TYPE_ATOMIC, TYPE_RESTRICT,
13167 ENCODE_QUAL_ADDR_SPACE.
13168 - main variant may be TYPE_COMPLETE_P and variant types !TYPE_COMPLETE_P
13169 in this case some values may not be set in the variant types
13170 (see TYPE_COMPLETE_P checks).
13171 - it is possible to have TYPE_ARTIFICIAL variant of non-artifical type
13172 - by TYPE_NAME and attributes (i.e. when variant originate by typedef)
13173 - TYPE_CANONICAL (TYPE_ALIAS_SET is the same among variants)
13174 - by the alignment: TYPE_ALIGN and TYPE_USER_ALIGN
13175 - during LTO by TYPE_CONTEXT if type is TYPE_FILE_SCOPE_P
13176 this is necessary to make it possible to merge types form different TUs
13177 - arrays, pointers and references may have TREE_TYPE that is a variant
13178 of TREE_TYPE of their main variants.
13179 - aggregates may have new TYPE_FIELDS list that list variants of
13180 the main variant TYPE_FIELDS.
13181 - vector types may differ by TYPE_VECTOR_OPAQUE
13182 - TYPE_METHODS is always NULL for vairant types and maintained for
13186 /* Convenience macro for matching individual fields. */
13187 #define verify_variant_match(flag) \
13189 if (flag (tv) != flag (t)) \
13191 error ("type variant differs by " #flag "."); \
13197 /* tree_base checks. */
13199 verify_variant_match (TREE_CODE
);
13200 /* FIXME: Ada builds non-artificial variants of artificial types. */
13201 if (TYPE_ARTIFICIAL (tv
) && 0)
13202 verify_variant_match (TYPE_ARTIFICIAL
);
13203 if (POINTER_TYPE_P (tv
))
13204 verify_variant_match (TYPE_REF_CAN_ALIAS_ALL
);
13205 /* FIXME: TYPE_SIZES_GIMPLIFIED may differs for Ada build. */
13206 verify_variant_match (TYPE_UNSIGNED
);
13207 verify_variant_match (TYPE_ALIGN_OK
);
13208 verify_variant_match (TYPE_PACKED
);
13209 if (TREE_CODE (t
) == REFERENCE_TYPE
)
13210 verify_variant_match (TYPE_REF_IS_RVALUE
);
13211 if (AGGREGATE_TYPE_P (t
))
13212 verify_variant_match (TYPE_REVERSE_STORAGE_ORDER
);
13214 verify_variant_match (TYPE_SATURATING
);
13215 /* FIXME: This check trigger during libstdc++ build. */
13216 if (RECORD_OR_UNION_TYPE_P (t
) && COMPLETE_TYPE_P (t
) && 0)
13217 verify_variant_match (TYPE_FINAL_P
);
13219 /* tree_type_common checks. */
13221 if (COMPLETE_TYPE_P (t
))
13223 verify_variant_match (TYPE_SIZE
);
13224 verify_variant_match (TYPE_MODE
);
13225 if (TYPE_SIZE_UNIT (t
) != TYPE_SIZE_UNIT (tv
)
13226 /* FIXME: ideally we should compare pointer equality, but java FE
13227 produce variants where size is INTEGER_CST of different type (int
13228 wrt size_type) during libjava biuld. */
13229 && !operand_equal_p (TYPE_SIZE_UNIT (t
), TYPE_SIZE_UNIT (tv
), 0))
13231 error ("type variant has different TYPE_SIZE_UNIT");
13233 error ("type variant's TYPE_SIZE_UNIT");
13234 debug_tree (TYPE_SIZE_UNIT (tv
));
13235 error ("type's TYPE_SIZE_UNIT");
13236 debug_tree (TYPE_SIZE_UNIT (t
));
13240 verify_variant_match (TYPE_PRECISION
);
13241 verify_variant_match (TYPE_NEEDS_CONSTRUCTING
);
13242 if (RECORD_OR_UNION_TYPE_P (t
))
13243 verify_variant_match (TYPE_TRANSPARENT_AGGR
);
13244 else if (TREE_CODE (t
) == ARRAY_TYPE
)
13245 verify_variant_match (TYPE_NONALIASED_COMPONENT
);
13246 /* During LTO we merge variant lists from diferent translation units
13247 that may differ BY TYPE_CONTEXT that in turn may point
13248 to TRANSLATION_UNIT_DECL.
13249 Ada also builds variants of types with different TYPE_CONTEXT. */
13250 if ((!in_lto_p
|| !TYPE_FILE_SCOPE_P (t
)) && 0)
13251 verify_variant_match (TYPE_CONTEXT
);
13252 verify_variant_match (TYPE_STRING_FLAG
);
13253 if (TYPE_ALIAS_SET_KNOWN_P (t
))
13255 error ("type variant with TYPE_ALIAS_SET_KNOWN_P");
13260 /* tree_type_non_common checks. */
13262 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
13263 and dangle the pointer from time to time. */
13264 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_VFIELD (t
) != TYPE_VFIELD (tv
)
13265 && (in_lto_p
|| !TYPE_VFIELD (tv
)
13266 || TREE_CODE (TYPE_VFIELD (tv
)) != TREE_LIST
))
13268 error ("type variant has different TYPE_VFIELD");
13272 if ((TREE_CODE (t
) == ENUMERAL_TYPE
&& COMPLETE_TYPE_P (t
))
13273 || TREE_CODE (t
) == INTEGER_TYPE
13274 || TREE_CODE (t
) == BOOLEAN_TYPE
13275 || TREE_CODE (t
) == REAL_TYPE
13276 || TREE_CODE (t
) == FIXED_POINT_TYPE
)
13278 verify_variant_match (TYPE_MAX_VALUE
);
13279 verify_variant_match (TYPE_MIN_VALUE
);
13281 if (TREE_CODE (t
) == METHOD_TYPE
)
13282 verify_variant_match (TYPE_METHOD_BASETYPE
);
13283 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_METHODS (t
))
13285 error ("type variant has TYPE_METHODS");
13289 if (TREE_CODE (t
) == OFFSET_TYPE
)
13290 verify_variant_match (TYPE_OFFSET_BASETYPE
);
13291 if (TREE_CODE (t
) == ARRAY_TYPE
)
13292 verify_variant_match (TYPE_ARRAY_MAX_SIZE
);
13293 /* FIXME: Be lax and allow TYPE_BINFO to be missing in variant types
13294 or even type's main variant. This is needed to make bootstrap pass
13295 and the bug seems new in GCC 5.
13296 C++ FE should be updated to make this consistent and we should check
13297 that TYPE_BINFO is always NULL for !COMPLETE_TYPE_P and otherwise there
13298 is a match with main variant.
13300 Also disable the check for Java for now because of parser hack that builds
13301 first an dummy BINFO and then sometimes replace it by real BINFO in some
13303 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_BINFO (t
) && TYPE_BINFO (tv
)
13304 && TYPE_BINFO (t
) != TYPE_BINFO (tv
)
13305 /* FIXME: Java sometimes keep dump TYPE_BINFOs on variant types.
13306 Since there is no cheap way to tell C++/Java type w/o LTO, do checking
13307 at LTO time only. */
13308 && (in_lto_p
&& odr_type_p (t
)))
13310 error ("type variant has different TYPE_BINFO");
13312 error ("type variant's TYPE_BINFO");
13313 debug_tree (TYPE_BINFO (tv
));
13314 error ("type's TYPE_BINFO");
13315 debug_tree (TYPE_BINFO (t
));
13319 /* Check various uses of TYPE_VALUES_RAW. */
13320 if (TREE_CODE (t
) == ENUMERAL_TYPE
)
13321 verify_variant_match (TYPE_VALUES
);
13322 else if (TREE_CODE (t
) == ARRAY_TYPE
)
13323 verify_variant_match (TYPE_DOMAIN
);
13324 /* Permit incomplete variants of complete type. While FEs may complete
13325 all variants, this does not happen for C++ templates in all cases. */
13326 else if (RECORD_OR_UNION_TYPE_P (t
)
13327 && COMPLETE_TYPE_P (t
)
13328 && TYPE_FIELDS (t
) != TYPE_FIELDS (tv
))
13332 /* Fortran builds qualified variants as new records with items of
13333 qualified type. Verify that they looks same. */
13334 for (f1
= TYPE_FIELDS (t
), f2
= TYPE_FIELDS (tv
);
13336 f1
= TREE_CHAIN (f1
), f2
= TREE_CHAIN (f2
))
13337 if (TREE_CODE (f1
) != FIELD_DECL
|| TREE_CODE (f2
) != FIELD_DECL
13338 || (TYPE_MAIN_VARIANT (TREE_TYPE (f1
))
13339 != TYPE_MAIN_VARIANT (TREE_TYPE (f2
))
13340 /* FIXME: gfc_nonrestricted_type builds all types as variants
13341 with exception of pointer types. It deeply copies the type
13342 which means that we may end up with a variant type
13343 referring non-variant pointer. We may change it to
13344 produce types as variants, too, like
13345 objc_get_protocol_qualified_type does. */
13346 && !POINTER_TYPE_P (TREE_TYPE (f1
)))
13347 || DECL_FIELD_OFFSET (f1
) != DECL_FIELD_OFFSET (f2
)
13348 || DECL_FIELD_BIT_OFFSET (f1
) != DECL_FIELD_BIT_OFFSET (f2
))
13352 error ("type variant has different TYPE_FIELDS");
13354 error ("first mismatch is field");
13356 error ("and field");
13361 else if ((TREE_CODE (t
) == FUNCTION_TYPE
|| TREE_CODE (t
) == METHOD_TYPE
))
13362 verify_variant_match (TYPE_ARG_TYPES
);
13363 /* For C++ the qualified variant of array type is really an array type
13364 of qualified TREE_TYPE.
13365 objc builds variants of pointer where pointer to type is a variant, too
13366 in objc_get_protocol_qualified_type. */
13367 if (TREE_TYPE (t
) != TREE_TYPE (tv
)
13368 && ((TREE_CODE (t
) != ARRAY_TYPE
13369 && !POINTER_TYPE_P (t
))
13370 || TYPE_MAIN_VARIANT (TREE_TYPE (t
))
13371 != TYPE_MAIN_VARIANT (TREE_TYPE (tv
))))
13373 error ("type variant has different TREE_TYPE");
13375 error ("type variant's TREE_TYPE");
13376 debug_tree (TREE_TYPE (tv
));
13377 error ("type's TREE_TYPE");
13378 debug_tree (TREE_TYPE (t
));
13381 if (type_with_alias_set_p (t
)
13382 && !gimple_canonical_types_compatible_p (t
, tv
, false))
13384 error ("type is not compatible with its vairant");
13386 error ("type variant's TREE_TYPE");
13387 debug_tree (TREE_TYPE (tv
));
13388 error ("type's TREE_TYPE");
13389 debug_tree (TREE_TYPE (t
));
13393 #undef verify_variant_match
13397 /* The TYPE_CANONICAL merging machinery. It should closely resemble
13398 the middle-end types_compatible_p function. It needs to avoid
13399 claiming types are different for types that should be treated
13400 the same with respect to TBAA. Canonical types are also used
13401 for IL consistency checks via the useless_type_conversion_p
13402 predicate which does not handle all type kinds itself but falls
13403 back to pointer-comparison of TYPE_CANONICAL for aggregates
13406 /* Return true if TYPE_UNSIGNED of TYPE should be ignored for canonical
13407 type calculation because we need to allow inter-operability between signed
13408 and unsigned variants. */
13411 type_with_interoperable_signedness (const_tree type
)
13413 /* Fortran standard require C_SIGNED_CHAR to be interoperable with both
13414 signed char and unsigned char. Similarly fortran FE builds
13415 C_SIZE_T as signed type, while C defines it unsigned. */
13417 return tree_code_for_canonical_type_merging (TREE_CODE (type
))
13419 && (TYPE_PRECISION (type
) == TYPE_PRECISION (signed_char_type_node
)
13420 || TYPE_PRECISION (type
) == TYPE_PRECISION (size_type_node
));
13423 /* Return true iff T1 and T2 are structurally identical for what
13425 This function is used both by lto.c canonical type merging and by the
13426 verifier. If TRUST_TYPE_CANONICAL we do not look into structure of types
13427 that have TYPE_CANONICAL defined and assume them equivalent. This is useful
13428 only for LTO because only in these cases TYPE_CANONICAL equivalence
13429 correspond to one defined by gimple_canonical_types_compatible_p. */
13432 gimple_canonical_types_compatible_p (const_tree t1
, const_tree t2
,
13433 bool trust_type_canonical
)
13435 /* Type variants should be same as the main variant. When not doing sanity
13436 checking to verify this fact, go to main variants and save some work. */
13437 if (trust_type_canonical
)
13439 t1
= TYPE_MAIN_VARIANT (t1
);
13440 t2
= TYPE_MAIN_VARIANT (t2
);
13443 /* Check first for the obvious case of pointer identity. */
13447 /* Check that we have two types to compare. */
13448 if (t1
== NULL_TREE
|| t2
== NULL_TREE
)
13451 /* We consider complete types always compatible with incomplete type.
13452 This does not make sense for canonical type calculation and thus we
13453 need to ensure that we are never called on it.
13455 FIXME: For more correctness the function probably should have three modes
13456 1) mode assuming that types are complete mathcing their structure
13457 2) mode allowing incomplete types but producing equivalence classes
13458 and thus ignoring all info from complete types
13459 3) mode allowing incomplete types to match complete but checking
13460 compatibility between complete types.
13462 1 and 2 can be used for canonical type calculation. 3 is the real
13463 definition of type compatibility that can be used i.e. for warnings during
13464 declaration merging. */
13466 gcc_assert (!trust_type_canonical
13467 || (type_with_alias_set_p (t1
) && type_with_alias_set_p (t2
)));
13468 /* If the types have been previously registered and found equal
13471 if (TYPE_CANONICAL (t1
) && TYPE_CANONICAL (t2
)
13472 && trust_type_canonical
)
13474 /* Do not use TYPE_CANONICAL of pointer types. For LTO streamed types
13475 they are always NULL, but they are set to non-NULL for types
13476 constructed by build_pointer_type and variants. In this case the
13477 TYPE_CANONICAL is more fine grained than the equivalnce we test (where
13478 all pointers are considered equal. Be sure to not return false
13480 gcc_checking_assert (canonical_type_used_p (t1
)
13481 && canonical_type_used_p (t2
));
13482 return TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
);
13485 /* Can't be the same type if the types don't have the same code. */
13486 enum tree_code code
= tree_code_for_canonical_type_merging (TREE_CODE (t1
));
13487 if (code
!= tree_code_for_canonical_type_merging (TREE_CODE (t2
)))
13490 /* Qualifiers do not matter for canonical type comparison purposes. */
13492 /* Void types and nullptr types are always the same. */
13493 if (TREE_CODE (t1
) == VOID_TYPE
13494 || TREE_CODE (t1
) == NULLPTR_TYPE
)
13497 /* Can't be the same type if they have different mode. */
13498 if (TYPE_MODE (t1
) != TYPE_MODE (t2
))
13501 /* Non-aggregate types can be handled cheaply. */
13502 if (INTEGRAL_TYPE_P (t1
)
13503 || SCALAR_FLOAT_TYPE_P (t1
)
13504 || FIXED_POINT_TYPE_P (t1
)
13505 || TREE_CODE (t1
) == VECTOR_TYPE
13506 || TREE_CODE (t1
) == COMPLEX_TYPE
13507 || TREE_CODE (t1
) == OFFSET_TYPE
13508 || POINTER_TYPE_P (t1
))
13510 /* Can't be the same type if they have different recision. */
13511 if (TYPE_PRECISION (t1
) != TYPE_PRECISION (t2
))
13514 /* In some cases the signed and unsigned types are required to be
13516 if (TYPE_UNSIGNED (t1
) != TYPE_UNSIGNED (t2
)
13517 && !type_with_interoperable_signedness (t1
))
13520 /* Fortran's C_SIGNED_CHAR is !TYPE_STRING_FLAG but needs to be
13521 interoperable with "signed char". Unless all frontends are revisited
13522 to agree on these types, we must ignore the flag completely. */
13524 /* Fortran standard define C_PTR type that is compatible with every
13525 C pointer. For this reason we need to glob all pointers into one.
13526 Still pointers in different address spaces are not compatible. */
13527 if (POINTER_TYPE_P (t1
))
13529 if (TYPE_ADDR_SPACE (TREE_TYPE (t1
))
13530 != TYPE_ADDR_SPACE (TREE_TYPE (t2
)))
13534 /* Tail-recurse to components. */
13535 if (TREE_CODE (t1
) == VECTOR_TYPE
13536 || TREE_CODE (t1
) == COMPLEX_TYPE
)
13537 return gimple_canonical_types_compatible_p (TREE_TYPE (t1
),
13539 trust_type_canonical
);
13544 /* Do type-specific comparisons. */
13545 switch (TREE_CODE (t1
))
13548 /* Array types are the same if the element types are the same and
13549 the number of elements are the same. */
13550 if (!gimple_canonical_types_compatible_p (TREE_TYPE (t1
), TREE_TYPE (t2
),
13551 trust_type_canonical
)
13552 || TYPE_STRING_FLAG (t1
) != TYPE_STRING_FLAG (t2
)
13553 || TYPE_REVERSE_STORAGE_ORDER (t1
) != TYPE_REVERSE_STORAGE_ORDER (t2
)
13554 || TYPE_NONALIASED_COMPONENT (t1
) != TYPE_NONALIASED_COMPONENT (t2
))
13558 tree i1
= TYPE_DOMAIN (t1
);
13559 tree i2
= TYPE_DOMAIN (t2
);
13561 /* For an incomplete external array, the type domain can be
13562 NULL_TREE. Check this condition also. */
13563 if (i1
== NULL_TREE
&& i2
== NULL_TREE
)
13565 else if (i1
== NULL_TREE
|| i2
== NULL_TREE
)
13569 tree min1
= TYPE_MIN_VALUE (i1
);
13570 tree min2
= TYPE_MIN_VALUE (i2
);
13571 tree max1
= TYPE_MAX_VALUE (i1
);
13572 tree max2
= TYPE_MAX_VALUE (i2
);
13574 /* The minimum/maximum values have to be the same. */
13577 && ((TREE_CODE (min1
) == PLACEHOLDER_EXPR
13578 && TREE_CODE (min2
) == PLACEHOLDER_EXPR
)
13579 || operand_equal_p (min1
, min2
, 0))))
13582 && ((TREE_CODE (max1
) == PLACEHOLDER_EXPR
13583 && TREE_CODE (max2
) == PLACEHOLDER_EXPR
)
13584 || operand_equal_p (max1
, max2
, 0)))))
13592 case FUNCTION_TYPE
:
13593 /* Function types are the same if the return type and arguments types
13595 if (!gimple_canonical_types_compatible_p (TREE_TYPE (t1
), TREE_TYPE (t2
),
13596 trust_type_canonical
))
13599 if (TYPE_ARG_TYPES (t1
) == TYPE_ARG_TYPES (t2
))
13603 tree parms1
, parms2
;
13605 for (parms1
= TYPE_ARG_TYPES (t1
), parms2
= TYPE_ARG_TYPES (t2
);
13607 parms1
= TREE_CHAIN (parms1
), parms2
= TREE_CHAIN (parms2
))
13609 if (!gimple_canonical_types_compatible_p
13610 (TREE_VALUE (parms1
), TREE_VALUE (parms2
),
13611 trust_type_canonical
))
13615 if (parms1
|| parms2
)
13623 case QUAL_UNION_TYPE
:
13627 /* Don't try to compare variants of an incomplete type, before
13628 TYPE_FIELDS has been copied around. */
13629 if (!COMPLETE_TYPE_P (t1
) && !COMPLETE_TYPE_P (t2
))
13633 if (TYPE_REVERSE_STORAGE_ORDER (t1
) != TYPE_REVERSE_STORAGE_ORDER (t2
))
13636 /* For aggregate types, all the fields must be the same. */
13637 for (f1
= TYPE_FIELDS (t1
), f2
= TYPE_FIELDS (t2
);
13639 f1
= TREE_CHAIN (f1
), f2
= TREE_CHAIN (f2
))
13641 /* Skip non-fields. */
13642 while (f1
&& TREE_CODE (f1
) != FIELD_DECL
)
13643 f1
= TREE_CHAIN (f1
);
13644 while (f2
&& TREE_CODE (f2
) != FIELD_DECL
)
13645 f2
= TREE_CHAIN (f2
);
13648 /* The fields must have the same name, offset and type. */
13649 if (DECL_NONADDRESSABLE_P (f1
) != DECL_NONADDRESSABLE_P (f2
)
13650 || !gimple_compare_field_offset (f1
, f2
)
13651 || !gimple_canonical_types_compatible_p
13652 (TREE_TYPE (f1
), TREE_TYPE (f2
),
13653 trust_type_canonical
))
13657 /* If one aggregate has more fields than the other, they
13658 are not the same. */
13666 /* Consider all types with language specific trees in them mutually
13667 compatible. This is executed only from verify_type and false
13668 positives can be tolerated. */
13669 gcc_assert (!in_lto_p
);
13674 /* Verify type T. */
13677 verify_type (const_tree t
)
13679 bool error_found
= false;
13680 tree mv
= TYPE_MAIN_VARIANT (t
);
13683 error ("Main variant is not defined");
13684 error_found
= true;
13686 else if (mv
!= TYPE_MAIN_VARIANT (mv
))
13688 error ("TYPE_MAIN_VARIANT has different TYPE_MAIN_VARIANT");
13690 error_found
= true;
13692 else if (t
!= mv
&& !verify_type_variant (t
, mv
))
13693 error_found
= true;
13695 tree ct
= TYPE_CANONICAL (t
);
13698 else if (TYPE_CANONICAL (t
) != ct
)
13700 error ("TYPE_CANONICAL has different TYPE_CANONICAL");
13702 error_found
= true;
13704 /* Method and function types can not be used to address memory and thus
13705 TYPE_CANONICAL really matters only for determining useless conversions.
13707 FIXME: C++ FE produce declarations of builtin functions that are not
13708 compatible with main variants. */
13709 else if (TREE_CODE (t
) == FUNCTION_TYPE
)
13712 /* FIXME: gimple_canonical_types_compatible_p can not compare types
13713 with variably sized arrays because their sizes possibly
13714 gimplified to different variables. */
13715 && !variably_modified_type_p (ct
, NULL
)
13716 && !gimple_canonical_types_compatible_p (t
, ct
, false))
13718 error ("TYPE_CANONICAL is not compatible");
13720 error_found
= true;
13723 if (COMPLETE_TYPE_P (t
) && TYPE_CANONICAL (t
)
13724 && TYPE_MODE (t
) != TYPE_MODE (TYPE_CANONICAL (t
)))
13726 error ("TYPE_MODE of TYPE_CANONICAL is not compatible");
13728 error_found
= true;
13730 /* FIXME: this is violated by the C++ FE as discussed in PR70029, when
13731 FUNCTION_*_QUALIFIED flags are set. */
13732 if (0 && TYPE_MAIN_VARIANT (t
) == t
&& ct
&& TYPE_MAIN_VARIANT (ct
) != ct
)
13734 error ("TYPE_CANONICAL of main variant is not main variant");
13736 debug_tree (TYPE_MAIN_VARIANT (ct
));
13737 error_found
= true;
13741 /* Check various uses of TYPE_MINVAL. */
13742 if (RECORD_OR_UNION_TYPE_P (t
))
13744 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
13745 and danagle the pointer from time to time. */
13746 if (TYPE_VFIELD (t
)
13747 && TREE_CODE (TYPE_VFIELD (t
)) != FIELD_DECL
13748 && TREE_CODE (TYPE_VFIELD (t
)) != TREE_LIST
)
13750 error ("TYPE_VFIELD is not FIELD_DECL nor TREE_LIST");
13751 debug_tree (TYPE_VFIELD (t
));
13752 error_found
= true;
13755 else if (TREE_CODE (t
) == POINTER_TYPE
)
13757 if (TYPE_NEXT_PTR_TO (t
)
13758 && TREE_CODE (TYPE_NEXT_PTR_TO (t
)) != POINTER_TYPE
)
13760 error ("TYPE_NEXT_PTR_TO is not POINTER_TYPE");
13761 debug_tree (TYPE_NEXT_PTR_TO (t
));
13762 error_found
= true;
13765 else if (TREE_CODE (t
) == REFERENCE_TYPE
)
13767 if (TYPE_NEXT_REF_TO (t
)
13768 && TREE_CODE (TYPE_NEXT_REF_TO (t
)) != REFERENCE_TYPE
)
13770 error ("TYPE_NEXT_REF_TO is not REFERENCE_TYPE");
13771 debug_tree (TYPE_NEXT_REF_TO (t
));
13772 error_found
= true;
13775 else if (INTEGRAL_TYPE_P (t
) || TREE_CODE (t
) == REAL_TYPE
13776 || TREE_CODE (t
) == FIXED_POINT_TYPE
)
13778 /* FIXME: The following check should pass:
13779 useless_type_conversion_p (const_cast <tree> (t),
13780 TREE_TYPE (TYPE_MIN_VALUE (t))
13781 but does not for C sizetypes in LTO. */
13783 /* Java uses TYPE_MINVAL for TYPE_ARGUMENT_SIGNATURE. */
13784 else if (TYPE_MINVAL (t
)
13785 && ((TREE_CODE (t
) != METHOD_TYPE
&& TREE_CODE (t
) != FUNCTION_TYPE
)
13788 error ("TYPE_MINVAL non-NULL");
13789 debug_tree (TYPE_MINVAL (t
));
13790 error_found
= true;
13793 /* Check various uses of TYPE_MAXVAL. */
13794 if (RECORD_OR_UNION_TYPE_P (t
))
13796 if (TYPE_METHODS (t
) && TREE_CODE (TYPE_METHODS (t
)) != FUNCTION_DECL
13797 && TREE_CODE (TYPE_METHODS (t
)) != TEMPLATE_DECL
13798 && TYPE_METHODS (t
) != error_mark_node
)
13800 error ("TYPE_METHODS is not FUNCTION_DECL, TEMPLATE_DECL nor error_mark_node");
13801 debug_tree (TYPE_METHODS (t
));
13802 error_found
= true;
13805 else if (TREE_CODE (t
) == FUNCTION_TYPE
|| TREE_CODE (t
) == METHOD_TYPE
)
13807 if (TYPE_METHOD_BASETYPE (t
)
13808 && TREE_CODE (TYPE_METHOD_BASETYPE (t
)) != RECORD_TYPE
13809 && TREE_CODE (TYPE_METHOD_BASETYPE (t
)) != UNION_TYPE
)
13811 error ("TYPE_METHOD_BASETYPE is not record nor union");
13812 debug_tree (TYPE_METHOD_BASETYPE (t
));
13813 error_found
= true;
13816 else if (TREE_CODE (t
) == OFFSET_TYPE
)
13818 if (TYPE_OFFSET_BASETYPE (t
)
13819 && TREE_CODE (TYPE_OFFSET_BASETYPE (t
)) != RECORD_TYPE
13820 && TREE_CODE (TYPE_OFFSET_BASETYPE (t
)) != UNION_TYPE
)
13822 error ("TYPE_OFFSET_BASETYPE is not record nor union");
13823 debug_tree (TYPE_OFFSET_BASETYPE (t
));
13824 error_found
= true;
13827 else if (INTEGRAL_TYPE_P (t
) || TREE_CODE (t
) == REAL_TYPE
13828 || TREE_CODE (t
) == FIXED_POINT_TYPE
)
13830 /* FIXME: The following check should pass:
13831 useless_type_conversion_p (const_cast <tree> (t),
13832 TREE_TYPE (TYPE_MAX_VALUE (t))
13833 but does not for C sizetypes in LTO. */
13835 else if (TREE_CODE (t
) == ARRAY_TYPE
)
13837 if (TYPE_ARRAY_MAX_SIZE (t
)
13838 && TREE_CODE (TYPE_ARRAY_MAX_SIZE (t
)) != INTEGER_CST
)
13840 error ("TYPE_ARRAY_MAX_SIZE not INTEGER_CST");
13841 debug_tree (TYPE_ARRAY_MAX_SIZE (t
));
13842 error_found
= true;
13845 else if (TYPE_MAXVAL (t
))
13847 error ("TYPE_MAXVAL non-NULL");
13848 debug_tree (TYPE_MAXVAL (t
));
13849 error_found
= true;
13852 /* Check various uses of TYPE_BINFO. */
13853 if (RECORD_OR_UNION_TYPE_P (t
))
13855 if (!TYPE_BINFO (t
))
13857 else if (TREE_CODE (TYPE_BINFO (t
)) != TREE_BINFO
)
13859 error ("TYPE_BINFO is not TREE_BINFO");
13860 debug_tree (TYPE_BINFO (t
));
13861 error_found
= true;
13863 /* FIXME: Java builds invalid empty binfos that do not have
13865 else if (TREE_TYPE (TYPE_BINFO (t
)) != TYPE_MAIN_VARIANT (t
) && 0)
13867 error ("TYPE_BINFO type is not TYPE_MAIN_VARIANT");
13868 debug_tree (TREE_TYPE (TYPE_BINFO (t
)));
13869 error_found
= true;
13872 else if (TYPE_LANG_SLOT_1 (t
) && in_lto_p
)
13874 error ("TYPE_LANG_SLOT_1 (binfo) field is non-NULL");
13875 debug_tree (TYPE_LANG_SLOT_1 (t
));
13876 error_found
= true;
13879 /* Check various uses of TYPE_VALUES_RAW. */
13880 if (TREE_CODE (t
) == ENUMERAL_TYPE
)
13881 for (tree l
= TYPE_VALUES (t
); l
; l
= TREE_CHAIN (l
))
13883 tree value
= TREE_VALUE (l
);
13884 tree name
= TREE_PURPOSE (l
);
13886 /* C FE porduce INTEGER_CST of INTEGER_TYPE, while C++ FE uses
13887 CONST_DECL of ENUMERAL TYPE. */
13888 if (TREE_CODE (value
) != INTEGER_CST
&& TREE_CODE (value
) != CONST_DECL
)
13890 error ("Enum value is not CONST_DECL or INTEGER_CST");
13891 debug_tree (value
);
13893 error_found
= true;
13895 if (TREE_CODE (TREE_TYPE (value
)) != INTEGER_TYPE
13896 && !useless_type_conversion_p (const_cast <tree
> (t
), TREE_TYPE (value
)))
13898 error ("Enum value type is not INTEGER_TYPE nor convertible to the enum");
13899 debug_tree (value
);
13901 error_found
= true;
13903 if (TREE_CODE (name
) != IDENTIFIER_NODE
)
13905 error ("Enum value name is not IDENTIFIER_NODE");
13906 debug_tree (value
);
13908 error_found
= true;
13911 else if (TREE_CODE (t
) == ARRAY_TYPE
)
13913 if (TYPE_DOMAIN (t
) && TREE_CODE (TYPE_DOMAIN (t
)) != INTEGER_TYPE
)
13915 error ("Array TYPE_DOMAIN is not integer type");
13916 debug_tree (TYPE_DOMAIN (t
));
13917 error_found
= true;
13920 else if (RECORD_OR_UNION_TYPE_P (t
))
13922 if (TYPE_FIELDS (t
) && !COMPLETE_TYPE_P (t
) && in_lto_p
)
13924 error ("TYPE_FIELDS defined in incomplete type");
13925 error_found
= true;
13927 for (tree fld
= TYPE_FIELDS (t
); fld
; fld
= TREE_CHAIN (fld
))
13929 /* TODO: verify properties of decls. */
13930 if (TREE_CODE (fld
) == FIELD_DECL
)
13932 else if (TREE_CODE (fld
) == TYPE_DECL
)
13934 else if (TREE_CODE (fld
) == CONST_DECL
)
13936 else if (TREE_CODE (fld
) == VAR_DECL
)
13938 else if (TREE_CODE (fld
) == TEMPLATE_DECL
)
13940 else if (TREE_CODE (fld
) == USING_DECL
)
13944 error ("Wrong tree in TYPE_FIELDS list");
13946 error_found
= true;
13950 else if (TREE_CODE (t
) == INTEGER_TYPE
13951 || TREE_CODE (t
) == BOOLEAN_TYPE
13952 || TREE_CODE (t
) == OFFSET_TYPE
13953 || TREE_CODE (t
) == REFERENCE_TYPE
13954 || TREE_CODE (t
) == NULLPTR_TYPE
13955 || TREE_CODE (t
) == POINTER_TYPE
)
13957 if (TYPE_CACHED_VALUES_P (t
) != (TYPE_CACHED_VALUES (t
) != NULL
))
13959 error ("TYPE_CACHED_VALUES_P is %i while TYPE_CACHED_VALUES is %p",
13960 TYPE_CACHED_VALUES_P (t
), (void *)TYPE_CACHED_VALUES (t
));
13961 error_found
= true;
13963 else if (TYPE_CACHED_VALUES_P (t
) && TREE_CODE (TYPE_CACHED_VALUES (t
)) != TREE_VEC
)
13965 error ("TYPE_CACHED_VALUES is not TREE_VEC");
13966 debug_tree (TYPE_CACHED_VALUES (t
));
13967 error_found
= true;
13969 /* Verify just enough of cache to ensure that no one copied it to new type.
13970 All copying should go by copy_node that should clear it. */
13971 else if (TYPE_CACHED_VALUES_P (t
))
13974 for (i
= 0; i
< TREE_VEC_LENGTH (TYPE_CACHED_VALUES (t
)); i
++)
13975 if (TREE_VEC_ELT (TYPE_CACHED_VALUES (t
), i
)
13976 && TREE_TYPE (TREE_VEC_ELT (TYPE_CACHED_VALUES (t
), i
)) != t
)
13978 error ("wrong TYPE_CACHED_VALUES entry");
13979 debug_tree (TREE_VEC_ELT (TYPE_CACHED_VALUES (t
), i
));
13980 error_found
= true;
13985 else if (TREE_CODE (t
) == FUNCTION_TYPE
|| TREE_CODE (t
) == METHOD_TYPE
)
13986 for (tree l
= TYPE_ARG_TYPES (t
); l
; l
= TREE_CHAIN (l
))
13988 /* C++ FE uses TREE_PURPOSE to store initial values. */
13989 if (TREE_PURPOSE (l
) && in_lto_p
)
13991 error ("TREE_PURPOSE is non-NULL in TYPE_ARG_TYPES list");
13993 error_found
= true;
13995 if (!TYPE_P (TREE_VALUE (l
)))
13997 error ("Wrong entry in TYPE_ARG_TYPES list");
13999 error_found
= true;
14002 else if (!is_lang_specific (t
) && TYPE_VALUES_RAW (t
))
14004 error ("TYPE_VALUES_RAW field is non-NULL");
14005 debug_tree (TYPE_VALUES_RAW (t
));
14006 error_found
= true;
14008 if (TREE_CODE (t
) != INTEGER_TYPE
14009 && TREE_CODE (t
) != BOOLEAN_TYPE
14010 && TREE_CODE (t
) != OFFSET_TYPE
14011 && TREE_CODE (t
) != REFERENCE_TYPE
14012 && TREE_CODE (t
) != NULLPTR_TYPE
14013 && TREE_CODE (t
) != POINTER_TYPE
14014 && TYPE_CACHED_VALUES_P (t
))
14016 error ("TYPE_CACHED_VALUES_P is set while it should not");
14017 error_found
= true;
14019 if (TYPE_STRING_FLAG (t
)
14020 && TREE_CODE (t
) != ARRAY_TYPE
&& TREE_CODE (t
) != INTEGER_TYPE
)
14022 error ("TYPE_STRING_FLAG is set on wrong type code");
14023 error_found
= true;
14025 else if (TYPE_STRING_FLAG (t
))
14028 if (TREE_CODE (b
) == ARRAY_TYPE
)
14030 /* Java builds arrays with TYPE_STRING_FLAG of promoted_char_type
14032 if (TREE_CODE (b
) != INTEGER_TYPE
)
14034 error ("TYPE_STRING_FLAG is set on type that does not look like "
14035 "char nor array of chars");
14036 error_found
= true;
14040 /* ipa-devirt makes an assumption that TYPE_METHOD_BASETYPE is always
14041 TYPE_MAIN_VARIANT and it would be odd to add methods only to variatns
14043 if (TREE_CODE (t
) == METHOD_TYPE
14044 && TYPE_MAIN_VARIANT (TYPE_METHOD_BASETYPE (t
)) != TYPE_METHOD_BASETYPE (t
))
14046 error ("TYPE_METHOD_BASETYPE is not main variant");
14047 error_found
= true;
14052 debug_tree (const_cast <tree
> (t
));
14053 internal_error ("verify_type failed");
14058 /* Return true if ARG is marked with the nonnull attribute in the
14059 current function signature. */
14062 nonnull_arg_p (const_tree arg
)
14064 tree t
, attrs
, fntype
;
14065 unsigned HOST_WIDE_INT arg_num
;
14067 gcc_assert (TREE_CODE (arg
) == PARM_DECL
14068 && (POINTER_TYPE_P (TREE_TYPE (arg
))
14069 || TREE_CODE (TREE_TYPE (arg
)) == OFFSET_TYPE
));
14071 /* The static chain decl is always non null. */
14072 if (arg
== cfun
->static_chain_decl
)
14075 /* THIS argument of method is always non-NULL. */
14076 if (TREE_CODE (TREE_TYPE (cfun
->decl
)) == METHOD_TYPE
14077 && arg
== DECL_ARGUMENTS (cfun
->decl
)
14078 && flag_delete_null_pointer_checks
)
14081 /* Values passed by reference are always non-NULL. */
14082 if (TREE_CODE (TREE_TYPE (arg
)) == REFERENCE_TYPE
14083 && flag_delete_null_pointer_checks
)
14086 fntype
= TREE_TYPE (cfun
->decl
);
14087 for (attrs
= TYPE_ATTRIBUTES (fntype
); attrs
; attrs
= TREE_CHAIN (attrs
))
14089 attrs
= lookup_attribute ("nonnull", attrs
);
14091 /* If "nonnull" wasn't specified, we know nothing about the argument. */
14092 if (attrs
== NULL_TREE
)
14095 /* If "nonnull" applies to all the arguments, then ARG is non-null. */
14096 if (TREE_VALUE (attrs
) == NULL_TREE
)
14099 /* Get the position number for ARG in the function signature. */
14100 for (arg_num
= 1, t
= DECL_ARGUMENTS (cfun
->decl
);
14102 t
= DECL_CHAIN (t
), arg_num
++)
14108 gcc_assert (t
== arg
);
14110 /* Now see if ARG_NUM is mentioned in the nonnull list. */
14111 for (t
= TREE_VALUE (attrs
); t
; t
= TREE_CHAIN (t
))
14113 if (compare_tree_int (TREE_VALUE (t
), arg_num
) == 0)
14121 /* Given location LOC, strip away any packed range information
14122 or ad-hoc information. */
14125 get_pure_location (location_t loc
)
14127 if (IS_ADHOC_LOC (loc
))
14129 = line_table
->location_adhoc_data_map
.data
[loc
& MAX_SOURCE_LOCATION
].locus
;
14131 if (loc
>= LINEMAPS_MACRO_LOWEST_LOCATION (line_table
))
14134 if (loc
< RESERVED_LOCATION_COUNT
)
14137 const line_map
*map
= linemap_lookup (line_table
, loc
);
14138 const line_map_ordinary
*ordmap
= linemap_check_ordinary (map
);
14140 return loc
& ~((1 << ordmap
->m_range_bits
) - 1);
14143 /* Combine LOC and BLOCK to a combined adhoc loc, retaining any range
14147 set_block (location_t loc
, tree block
)
14149 location_t pure_loc
= get_pure_location (loc
);
14150 source_range src_range
= get_range_from_loc (line_table
, loc
);
14151 return COMBINE_LOCATION_DATA (line_table
, pure_loc
, src_range
, block
);
14155 set_source_range (tree expr
, location_t start
, location_t finish
)
14157 source_range src_range
;
14158 src_range
.m_start
= start
;
14159 src_range
.m_finish
= finish
;
14160 return set_source_range (expr
, src_range
);
14164 set_source_range (tree expr
, source_range src_range
)
14166 if (!EXPR_P (expr
))
14167 return UNKNOWN_LOCATION
;
14169 location_t pure_loc
= get_pure_location (EXPR_LOCATION (expr
));
14170 location_t adhoc
= COMBINE_LOCATION_DATA (line_table
,
14174 SET_EXPR_LOCATION (expr
, adhoc
);
14179 make_location (location_t caret
, location_t start
, location_t finish
)
14181 location_t pure_loc
= get_pure_location (caret
);
14182 source_range src_range
;
14183 src_range
.m_start
= start
;
14184 src_range
.m_finish
= finish
;
14185 location_t combined_loc
= COMBINE_LOCATION_DATA (line_table
,
14189 return combined_loc
;
14192 /* Return the name of combined function FN, for debugging purposes. */
14195 combined_fn_name (combined_fn fn
)
14197 if (builtin_fn_p (fn
))
14199 tree fndecl
= builtin_decl_explicit (as_builtin_fn (fn
));
14200 return IDENTIFIER_POINTER (DECL_NAME (fndecl
));
14203 return internal_fn_name (as_internal_fn (fn
));
14206 #include "gt-tree.h"