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 1, /* OMP_CLAUSE_DEVICE_RESIDENT */
285 2, /* OMP_CLAUSE_GANG */
286 1, /* OMP_CLAUSE_ASYNC */
287 1, /* OMP_CLAUSE_WAIT */
288 0, /* OMP_CLAUSE_AUTO */
289 0, /* OMP_CLAUSE_SEQ */
290 1, /* OMP_CLAUSE__LOOPTEMP_ */
291 1, /* OMP_CLAUSE_IF */
292 1, /* OMP_CLAUSE_NUM_THREADS */
293 1, /* OMP_CLAUSE_SCHEDULE */
294 0, /* OMP_CLAUSE_NOWAIT */
295 1, /* OMP_CLAUSE_ORDERED */
296 0, /* OMP_CLAUSE_DEFAULT */
297 3, /* OMP_CLAUSE_COLLAPSE */
298 0, /* OMP_CLAUSE_UNTIED */
299 1, /* OMP_CLAUSE_FINAL */
300 0, /* OMP_CLAUSE_MERGEABLE */
301 1, /* OMP_CLAUSE_DEVICE */
302 1, /* OMP_CLAUSE_DIST_SCHEDULE */
303 0, /* OMP_CLAUSE_INBRANCH */
304 0, /* OMP_CLAUSE_NOTINBRANCH */
305 1, /* OMP_CLAUSE_NUM_TEAMS */
306 1, /* OMP_CLAUSE_THREAD_LIMIT */
307 0, /* OMP_CLAUSE_PROC_BIND */
308 1, /* OMP_CLAUSE_SAFELEN */
309 1, /* OMP_CLAUSE_SIMDLEN */
310 0, /* OMP_CLAUSE_FOR */
311 0, /* OMP_CLAUSE_PARALLEL */
312 0, /* OMP_CLAUSE_SECTIONS */
313 0, /* OMP_CLAUSE_TASKGROUP */
314 1, /* OMP_CLAUSE_PRIORITY */
315 1, /* OMP_CLAUSE_GRAINSIZE */
316 1, /* OMP_CLAUSE_NUM_TASKS */
317 0, /* OMP_CLAUSE_NOGROUP */
318 0, /* OMP_CLAUSE_THREADS */
319 0, /* OMP_CLAUSE_SIMD */
320 1, /* OMP_CLAUSE_HINT */
321 0, /* OMP_CLAUSE_DEFALTMAP */
322 1, /* OMP_CLAUSE__SIMDUID_ */
323 1, /* OMP_CLAUSE__CILK_FOR_COUNT_ */
324 0, /* OMP_CLAUSE_INDEPENDENT */
325 1, /* OMP_CLAUSE_WORKER */
326 1, /* OMP_CLAUSE_VECTOR */
327 1, /* OMP_CLAUSE_NUM_GANGS */
328 1, /* OMP_CLAUSE_NUM_WORKERS */
329 1, /* OMP_CLAUSE_VECTOR_LENGTH */
330 1, /* OMP_CLAUSE_TILE */
331 2, /* OMP_CLAUSE__GRIDDIM_ */
334 const char * const omp_clause_code_name
[] =
407 /* Return the tree node structure used by tree code CODE. */
409 static inline enum tree_node_structure_enum
410 tree_node_structure_for_code (enum tree_code code
)
412 switch (TREE_CODE_CLASS (code
))
414 case tcc_declaration
:
419 return TS_FIELD_DECL
;
425 return TS_LABEL_DECL
;
427 return TS_RESULT_DECL
;
428 case DEBUG_EXPR_DECL
:
431 return TS_CONST_DECL
;
435 return TS_FUNCTION_DECL
;
436 case TRANSLATION_UNIT_DECL
:
437 return TS_TRANSLATION_UNIT_DECL
;
439 return TS_DECL_NON_COMMON
;
443 return TS_TYPE_NON_COMMON
;
452 default: /* tcc_constant and tcc_exceptional */
457 /* tcc_constant cases. */
458 case VOID_CST
: return TS_TYPED
;
459 case INTEGER_CST
: return TS_INT_CST
;
460 case REAL_CST
: return TS_REAL_CST
;
461 case FIXED_CST
: return TS_FIXED_CST
;
462 case COMPLEX_CST
: return TS_COMPLEX
;
463 case VECTOR_CST
: return TS_VECTOR
;
464 case STRING_CST
: return TS_STRING
;
465 /* tcc_exceptional cases. */
466 case ERROR_MARK
: return TS_COMMON
;
467 case IDENTIFIER_NODE
: return TS_IDENTIFIER
;
468 case TREE_LIST
: return TS_LIST
;
469 case TREE_VEC
: return TS_VEC
;
470 case SSA_NAME
: return TS_SSA_NAME
;
471 case PLACEHOLDER_EXPR
: return TS_COMMON
;
472 case STATEMENT_LIST
: return TS_STATEMENT_LIST
;
473 case BLOCK
: return TS_BLOCK
;
474 case CONSTRUCTOR
: return TS_CONSTRUCTOR
;
475 case TREE_BINFO
: return TS_BINFO
;
476 case OMP_CLAUSE
: return TS_OMP_CLAUSE
;
477 case OPTIMIZATION_NODE
: return TS_OPTIMIZATION
;
478 case TARGET_OPTION_NODE
: return TS_TARGET_OPTION
;
486 /* Initialize tree_contains_struct to describe the hierarchy of tree
490 initialize_tree_contains_struct (void)
494 for (i
= ERROR_MARK
; i
< LAST_AND_UNUSED_TREE_CODE
; i
++)
497 enum tree_node_structure_enum ts_code
;
499 code
= (enum tree_code
) i
;
500 ts_code
= tree_node_structure_for_code (code
);
502 /* Mark the TS structure itself. */
503 tree_contains_struct
[code
][ts_code
] = 1;
505 /* Mark all the structures that TS is derived from. */
523 case TS_STATEMENT_LIST
:
524 MARK_TS_TYPED (code
);
528 case TS_DECL_MINIMAL
:
534 case TS_OPTIMIZATION
:
535 case TS_TARGET_OPTION
:
536 MARK_TS_COMMON (code
);
539 case TS_TYPE_WITH_LANG_SPECIFIC
:
540 MARK_TS_TYPE_COMMON (code
);
543 case TS_TYPE_NON_COMMON
:
544 MARK_TS_TYPE_WITH_LANG_SPECIFIC (code
);
548 MARK_TS_DECL_MINIMAL (code
);
553 MARK_TS_DECL_COMMON (code
);
556 case TS_DECL_NON_COMMON
:
557 MARK_TS_DECL_WITH_VIS (code
);
560 case TS_DECL_WITH_VIS
:
564 MARK_TS_DECL_WRTL (code
);
568 MARK_TS_DECL_COMMON (code
);
572 MARK_TS_DECL_WITH_VIS (code
);
576 case TS_FUNCTION_DECL
:
577 MARK_TS_DECL_NON_COMMON (code
);
580 case TS_TRANSLATION_UNIT_DECL
:
581 MARK_TS_DECL_COMMON (code
);
589 /* Basic consistency checks for attributes used in fold. */
590 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_NON_COMMON
]);
591 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_NON_COMMON
]);
592 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_DECL_COMMON
]);
593 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_COMMON
]);
594 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_COMMON
]);
595 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_COMMON
]);
596 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_COMMON
]);
597 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_COMMON
]);
598 gcc_assert (tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_COMMON
]);
599 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_COMMON
]);
600 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_DECL_COMMON
]);
601 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_WRTL
]);
602 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_WRTL
]);
603 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_WRTL
]);
604 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WRTL
]);
605 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_WRTL
]);
606 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_DECL_MINIMAL
]);
607 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_MINIMAL
]);
608 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_MINIMAL
]);
609 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_MINIMAL
]);
610 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_MINIMAL
]);
611 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_MINIMAL
]);
612 gcc_assert (tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_MINIMAL
]);
613 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_MINIMAL
]);
614 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_DECL_MINIMAL
]);
615 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_WITH_VIS
]);
616 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WITH_VIS
]);
617 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_WITH_VIS
]);
618 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_VAR_DECL
]);
619 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_FIELD_DECL
]);
620 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_PARM_DECL
]);
621 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_LABEL_DECL
]);
622 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_RESULT_DECL
]);
623 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_CONST_DECL
]);
624 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_TYPE_DECL
]);
625 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_FUNCTION_DECL
]);
626 gcc_assert (tree_contains_struct
[IMPORTED_DECL
][TS_DECL_MINIMAL
]);
627 gcc_assert (tree_contains_struct
[IMPORTED_DECL
][TS_DECL_COMMON
]);
628 gcc_assert (tree_contains_struct
[NAMELIST_DECL
][TS_DECL_MINIMAL
]);
629 gcc_assert (tree_contains_struct
[NAMELIST_DECL
][TS_DECL_COMMON
]);
638 /* Initialize the hash table of types. */
640 = hash_table
<type_cache_hasher
>::create_ggc (TYPE_HASH_INITIAL_SIZE
);
643 = hash_table
<tree_decl_map_cache_hasher
>::create_ggc (512);
646 = hash_table
<tree_decl_map_cache_hasher
>::create_ggc (512);
648 int_cst_hash_table
= hash_table
<int_cst_hasher
>::create_ggc (1024);
650 int_cst_node
= make_int_cst (1, 1);
652 cl_option_hash_table
= hash_table
<cl_option_hasher
>::create_ggc (64);
654 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
655 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
657 /* Initialize the tree_contains_struct array. */
658 initialize_tree_contains_struct ();
659 lang_hooks
.init_ts ();
663 /* The name of the object as the assembler will see it (but before any
664 translations made by ASM_OUTPUT_LABELREF). Often this is the same
665 as DECL_NAME. It is an IDENTIFIER_NODE. */
667 decl_assembler_name (tree decl
)
669 if (!DECL_ASSEMBLER_NAME_SET_P (decl
))
670 lang_hooks
.set_decl_assembler_name (decl
);
671 return DECL_WITH_VIS_CHECK (decl
)->decl_with_vis
.assembler_name
;
674 /* When the target supports COMDAT groups, this indicates which group the
675 DECL is associated with. This can be either an IDENTIFIER_NODE or a
676 decl, in which case its DECL_ASSEMBLER_NAME identifies the group. */
678 decl_comdat_group (const_tree node
)
680 struct symtab_node
*snode
= symtab_node::get (node
);
683 return snode
->get_comdat_group ();
686 /* Likewise, but make sure it's been reduced to an IDENTIFIER_NODE. */
688 decl_comdat_group_id (const_tree node
)
690 struct symtab_node
*snode
= symtab_node::get (node
);
693 return snode
->get_comdat_group_id ();
696 /* When the target supports named section, return its name as IDENTIFIER_NODE
697 or NULL if it is in no section. */
699 decl_section_name (const_tree node
)
701 struct symtab_node
*snode
= symtab_node::get (node
);
704 return snode
->get_section ();
707 /* Set section name of NODE to VALUE (that is expected to be
710 set_decl_section_name (tree node
, const char *value
)
712 struct symtab_node
*snode
;
716 snode
= symtab_node::get (node
);
720 else if (TREE_CODE (node
) == VAR_DECL
)
721 snode
= varpool_node::get_create (node
);
723 snode
= cgraph_node::get_create (node
);
724 snode
->set_section (value
);
727 /* Return TLS model of a variable NODE. */
729 decl_tls_model (const_tree node
)
731 struct varpool_node
*snode
= varpool_node::get (node
);
733 return TLS_MODEL_NONE
;
734 return snode
->tls_model
;
737 /* Set TLS model of variable NODE to MODEL. */
739 set_decl_tls_model (tree node
, enum tls_model model
)
741 struct varpool_node
*vnode
;
743 if (model
== TLS_MODEL_NONE
)
745 vnode
= varpool_node::get (node
);
750 vnode
= varpool_node::get_create (node
);
751 vnode
->tls_model
= model
;
754 /* Compute the number of bytes occupied by a tree with code CODE.
755 This function cannot be used for nodes that have variable sizes,
756 including TREE_VEC, INTEGER_CST, STRING_CST, and CALL_EXPR. */
758 tree_code_size (enum tree_code code
)
760 switch (TREE_CODE_CLASS (code
))
762 case tcc_declaration
: /* A decl node */
767 return sizeof (struct tree_field_decl
);
769 return sizeof (struct tree_parm_decl
);
771 return sizeof (struct tree_var_decl
);
773 return sizeof (struct tree_label_decl
);
775 return sizeof (struct tree_result_decl
);
777 return sizeof (struct tree_const_decl
);
779 return sizeof (struct tree_type_decl
);
781 return sizeof (struct tree_function_decl
);
782 case DEBUG_EXPR_DECL
:
783 return sizeof (struct tree_decl_with_rtl
);
784 case TRANSLATION_UNIT_DECL
:
785 return sizeof (struct tree_translation_unit_decl
);
789 return sizeof (struct tree_decl_non_common
);
791 return lang_hooks
.tree_size (code
);
795 case tcc_type
: /* a type node */
796 return sizeof (struct tree_type_non_common
);
798 case tcc_reference
: /* a reference */
799 case tcc_expression
: /* an expression */
800 case tcc_statement
: /* an expression with side effects */
801 case tcc_comparison
: /* a comparison expression */
802 case tcc_unary
: /* a unary arithmetic expression */
803 case tcc_binary
: /* a binary arithmetic expression */
804 return (sizeof (struct tree_exp
)
805 + (TREE_CODE_LENGTH (code
) - 1) * sizeof (tree
));
807 case tcc_constant
: /* a constant */
810 case VOID_CST
: return sizeof (struct tree_typed
);
811 case INTEGER_CST
: gcc_unreachable ();
812 case REAL_CST
: return sizeof (struct tree_real_cst
);
813 case FIXED_CST
: return sizeof (struct tree_fixed_cst
);
814 case COMPLEX_CST
: return sizeof (struct tree_complex
);
815 case VECTOR_CST
: return sizeof (struct tree_vector
);
816 case STRING_CST
: gcc_unreachable ();
818 return lang_hooks
.tree_size (code
);
821 case tcc_exceptional
: /* something random, like an identifier. */
824 case IDENTIFIER_NODE
: return lang_hooks
.identifier_size
;
825 case TREE_LIST
: return sizeof (struct tree_list
);
828 case PLACEHOLDER_EXPR
: return sizeof (struct tree_common
);
831 case OMP_CLAUSE
: gcc_unreachable ();
833 case SSA_NAME
: return sizeof (struct tree_ssa_name
);
835 case STATEMENT_LIST
: return sizeof (struct tree_statement_list
);
836 case BLOCK
: return sizeof (struct tree_block
);
837 case CONSTRUCTOR
: return sizeof (struct tree_constructor
);
838 case OPTIMIZATION_NODE
: return sizeof (struct tree_optimization_option
);
839 case TARGET_OPTION_NODE
: return sizeof (struct tree_target_option
);
842 return lang_hooks
.tree_size (code
);
850 /* Compute the number of bytes occupied by NODE. This routine only
851 looks at TREE_CODE, except for those nodes that have variable sizes. */
853 tree_size (const_tree node
)
855 const enum tree_code code
= TREE_CODE (node
);
859 return (sizeof (struct tree_int_cst
)
860 + (TREE_INT_CST_EXT_NUNITS (node
) - 1) * sizeof (HOST_WIDE_INT
));
863 return (offsetof (struct tree_binfo
, base_binfos
)
865 ::embedded_size (BINFO_N_BASE_BINFOS (node
)));
868 return (sizeof (struct tree_vec
)
869 + (TREE_VEC_LENGTH (node
) - 1) * sizeof (tree
));
872 return (sizeof (struct tree_vector
)
873 + (TYPE_VECTOR_SUBPARTS (TREE_TYPE (node
)) - 1) * sizeof (tree
));
876 return TREE_STRING_LENGTH (node
) + offsetof (struct tree_string
, str
) + 1;
879 return (sizeof (struct tree_omp_clause
)
880 + (omp_clause_num_ops
[OMP_CLAUSE_CODE (node
)] - 1)
884 if (TREE_CODE_CLASS (code
) == tcc_vl_exp
)
885 return (sizeof (struct tree_exp
)
886 + (VL_EXP_OPERAND_LENGTH (node
) - 1) * sizeof (tree
));
888 return tree_code_size (code
);
892 /* Record interesting allocation statistics for a tree node with CODE
896 record_node_allocation_statistics (enum tree_code code ATTRIBUTE_UNUSED
,
897 size_t length ATTRIBUTE_UNUSED
)
899 enum tree_code_class type
= TREE_CODE_CLASS (code
);
902 if (!GATHER_STATISTICS
)
907 case tcc_declaration
: /* A decl node */
911 case tcc_type
: /* a type node */
915 case tcc_statement
: /* an expression with side effects */
919 case tcc_reference
: /* a reference */
923 case tcc_expression
: /* an expression */
924 case tcc_comparison
: /* a comparison expression */
925 case tcc_unary
: /* a unary arithmetic expression */
926 case tcc_binary
: /* a binary arithmetic expression */
930 case tcc_constant
: /* a constant */
934 case tcc_exceptional
: /* something random, like an identifier. */
937 case IDENTIFIER_NODE
:
950 kind
= ssa_name_kind
;
962 kind
= omp_clause_kind
;
979 tree_code_counts
[(int) code
]++;
980 tree_node_counts
[(int) kind
]++;
981 tree_node_sizes
[(int) kind
] += length
;
984 /* Allocate and return a new UID from the DECL_UID namespace. */
987 allocate_decl_uid (void)
989 return next_decl_uid
++;
992 /* Return a newly allocated node of code CODE. For decl and type
993 nodes, some other fields are initialized. The rest of the node is
994 initialized to zero. This function cannot be used for TREE_VEC,
995 INTEGER_CST or OMP_CLAUSE nodes, which is enforced by asserts in
998 Achoo! I got a code in the node. */
1001 make_node_stat (enum tree_code code MEM_STAT_DECL
)
1004 enum tree_code_class type
= TREE_CODE_CLASS (code
);
1005 size_t length
= tree_code_size (code
);
1007 record_node_allocation_statistics (code
, length
);
1009 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
1010 TREE_SET_CODE (t
, code
);
1015 TREE_SIDE_EFFECTS (t
) = 1;
1018 case tcc_declaration
:
1019 if (CODE_CONTAINS_STRUCT (code
, TS_DECL_COMMON
))
1021 if (code
== FUNCTION_DECL
)
1023 SET_DECL_ALIGN (t
, FUNCTION_BOUNDARY
);
1024 DECL_MODE (t
) = FUNCTION_MODE
;
1027 SET_DECL_ALIGN (t
, 1);
1029 DECL_SOURCE_LOCATION (t
) = input_location
;
1030 if (TREE_CODE (t
) == DEBUG_EXPR_DECL
)
1031 DECL_UID (t
) = --next_debug_decl_uid
;
1034 DECL_UID (t
) = allocate_decl_uid ();
1035 SET_DECL_PT_UID (t
, -1);
1037 if (TREE_CODE (t
) == LABEL_DECL
)
1038 LABEL_DECL_UID (t
) = -1;
1043 TYPE_UID (t
) = next_type_uid
++;
1044 SET_TYPE_ALIGN (t
, BITS_PER_UNIT
);
1045 TYPE_USER_ALIGN (t
) = 0;
1046 TYPE_MAIN_VARIANT (t
) = t
;
1047 TYPE_CANONICAL (t
) = t
;
1049 /* Default to no attributes for type, but let target change that. */
1050 TYPE_ATTRIBUTES (t
) = NULL_TREE
;
1051 targetm
.set_default_type_attributes (t
);
1053 /* We have not yet computed the alias set for this type. */
1054 TYPE_ALIAS_SET (t
) = -1;
1058 TREE_CONSTANT (t
) = 1;
1061 case tcc_expression
:
1067 case PREDECREMENT_EXPR
:
1068 case PREINCREMENT_EXPR
:
1069 case POSTDECREMENT_EXPR
:
1070 case POSTINCREMENT_EXPR
:
1071 /* All of these have side-effects, no matter what their
1073 TREE_SIDE_EFFECTS (t
) = 1;
1081 case tcc_exceptional
:
1084 case TARGET_OPTION_NODE
:
1085 TREE_TARGET_OPTION(t
)
1086 = ggc_cleared_alloc
<struct cl_target_option
> ();
1089 case OPTIMIZATION_NODE
:
1090 TREE_OPTIMIZATION (t
)
1091 = ggc_cleared_alloc
<struct cl_optimization
> ();
1100 /* Other classes need no special treatment. */
1107 /* Free tree node. */
1110 free_node (tree node
)
1112 enum tree_code code
= TREE_CODE (node
);
1113 if (GATHER_STATISTICS
)
1115 tree_code_counts
[(int) TREE_CODE (node
)]--;
1116 tree_node_counts
[(int) t_kind
]--;
1117 tree_node_sizes
[(int) t_kind
] -= tree_size (node
);
1119 if (CODE_CONTAINS_STRUCT (code
, TS_CONSTRUCTOR
))
1120 vec_free (CONSTRUCTOR_ELTS (node
));
1121 else if (code
== BLOCK
)
1122 vec_free (BLOCK_NONLOCALIZED_VARS (node
));
1123 else if (code
== TREE_BINFO
)
1124 vec_free (BINFO_BASE_ACCESSES (node
));
1128 /* Return a new node with the same contents as NODE except that its
1129 TREE_CHAIN, if it has one, is zero and it has a fresh uid. */
1132 copy_node_stat (tree node MEM_STAT_DECL
)
1135 enum tree_code code
= TREE_CODE (node
);
1138 gcc_assert (code
!= STATEMENT_LIST
);
1140 length
= tree_size (node
);
1141 record_node_allocation_statistics (code
, length
);
1142 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
1143 memcpy (t
, node
, length
);
1145 if (CODE_CONTAINS_STRUCT (code
, TS_COMMON
))
1147 TREE_ASM_WRITTEN (t
) = 0;
1148 TREE_VISITED (t
) = 0;
1150 if (TREE_CODE_CLASS (code
) == tcc_declaration
)
1152 if (code
== DEBUG_EXPR_DECL
)
1153 DECL_UID (t
) = --next_debug_decl_uid
;
1156 DECL_UID (t
) = allocate_decl_uid ();
1157 if (DECL_PT_UID_SET_P (node
))
1158 SET_DECL_PT_UID (t
, DECL_PT_UID (node
));
1160 if ((TREE_CODE (node
) == PARM_DECL
|| TREE_CODE (node
) == VAR_DECL
)
1161 && DECL_HAS_VALUE_EXPR_P (node
))
1163 SET_DECL_VALUE_EXPR (t
, DECL_VALUE_EXPR (node
));
1164 DECL_HAS_VALUE_EXPR_P (t
) = 1;
1166 /* DECL_DEBUG_EXPR is copied explicitely by callers. */
1167 if (TREE_CODE (node
) == VAR_DECL
)
1169 DECL_HAS_DEBUG_EXPR_P (t
) = 0;
1170 t
->decl_with_vis
.symtab_node
= NULL
;
1172 if (TREE_CODE (node
) == VAR_DECL
&& DECL_HAS_INIT_PRIORITY_P (node
))
1174 SET_DECL_INIT_PRIORITY (t
, DECL_INIT_PRIORITY (node
));
1175 DECL_HAS_INIT_PRIORITY_P (t
) = 1;
1177 if (TREE_CODE (node
) == FUNCTION_DECL
)
1179 DECL_STRUCT_FUNCTION (t
) = NULL
;
1180 t
->decl_with_vis
.symtab_node
= NULL
;
1183 else if (TREE_CODE_CLASS (code
) == tcc_type
)
1185 TYPE_UID (t
) = next_type_uid
++;
1186 /* The following is so that the debug code for
1187 the copy is different from the original type.
1188 The two statements usually duplicate each other
1189 (because they clear fields of the same union),
1190 but the optimizer should catch that. */
1191 TYPE_SYMTAB_POINTER (t
) = 0;
1192 TYPE_SYMTAB_ADDRESS (t
) = 0;
1194 /* Do not copy the values cache. */
1195 if (TYPE_CACHED_VALUES_P (t
))
1197 TYPE_CACHED_VALUES_P (t
) = 0;
1198 TYPE_CACHED_VALUES (t
) = NULL_TREE
;
1201 else if (code
== TARGET_OPTION_NODE
)
1203 TREE_TARGET_OPTION (t
) = ggc_alloc
<struct cl_target_option
>();
1204 memcpy (TREE_TARGET_OPTION (t
), TREE_TARGET_OPTION (node
),
1205 sizeof (struct cl_target_option
));
1207 else if (code
== OPTIMIZATION_NODE
)
1209 TREE_OPTIMIZATION (t
) = ggc_alloc
<struct cl_optimization
>();
1210 memcpy (TREE_OPTIMIZATION (t
), TREE_OPTIMIZATION (node
),
1211 sizeof (struct cl_optimization
));
1217 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
1218 For example, this can copy a list made of TREE_LIST nodes. */
1221 copy_list (tree list
)
1229 head
= prev
= copy_node (list
);
1230 next
= TREE_CHAIN (list
);
1233 TREE_CHAIN (prev
) = copy_node (next
);
1234 prev
= TREE_CHAIN (prev
);
1235 next
= TREE_CHAIN (next
);
1241 /* Return the value that TREE_INT_CST_EXT_NUNITS should have for an
1242 INTEGER_CST with value CST and type TYPE. */
1245 get_int_cst_ext_nunits (tree type
, const wide_int
&cst
)
1247 gcc_checking_assert (cst
.get_precision () == TYPE_PRECISION (type
));
1248 /* We need extra HWIs if CST is an unsigned integer with its
1250 if (TYPE_UNSIGNED (type
) && wi::neg_p (cst
))
1251 return cst
.get_precision () / HOST_BITS_PER_WIDE_INT
+ 1;
1252 return cst
.get_len ();
1255 /* Return a new INTEGER_CST with value CST and type TYPE. */
1258 build_new_int_cst (tree type
, const wide_int
&cst
)
1260 unsigned int len
= cst
.get_len ();
1261 unsigned int ext_len
= get_int_cst_ext_nunits (type
, cst
);
1262 tree nt
= make_int_cst (len
, ext_len
);
1267 TREE_INT_CST_ELT (nt
, ext_len
)
1268 = zext_hwi (-1, cst
.get_precision () % HOST_BITS_PER_WIDE_INT
);
1269 for (unsigned int i
= len
; i
< ext_len
; ++i
)
1270 TREE_INT_CST_ELT (nt
, i
) = -1;
1272 else if (TYPE_UNSIGNED (type
)
1273 && cst
.get_precision () < len
* HOST_BITS_PER_WIDE_INT
)
1276 TREE_INT_CST_ELT (nt
, len
)
1277 = zext_hwi (cst
.elt (len
),
1278 cst
.get_precision () % HOST_BITS_PER_WIDE_INT
);
1281 for (unsigned int i
= 0; i
< len
; i
++)
1282 TREE_INT_CST_ELT (nt
, i
) = cst
.elt (i
);
1283 TREE_TYPE (nt
) = type
;
1287 /* Create an INT_CST node with a LOW value sign extended to TYPE. */
1290 build_int_cst (tree type
, HOST_WIDE_INT low
)
1292 /* Support legacy code. */
1294 type
= integer_type_node
;
1296 return wide_int_to_tree (type
, wi::shwi (low
, TYPE_PRECISION (type
)));
1300 build_int_cstu (tree type
, unsigned HOST_WIDE_INT cst
)
1302 return wide_int_to_tree (type
, wi::uhwi (cst
, TYPE_PRECISION (type
)));
1305 /* Create an INT_CST node with a LOW value sign extended to TYPE. */
1308 build_int_cst_type (tree type
, HOST_WIDE_INT low
)
1311 return wide_int_to_tree (type
, wi::shwi (low
, TYPE_PRECISION (type
)));
1314 /* Constructs tree in type TYPE from with value given by CST. Signedness
1315 of CST is assumed to be the same as the signedness of TYPE. */
1318 double_int_to_tree (tree type
, double_int cst
)
1320 return wide_int_to_tree (type
, widest_int::from (cst
, TYPE_SIGN (type
)));
1323 /* We force the wide_int CST to the range of the type TYPE by sign or
1324 zero extending it. OVERFLOWABLE indicates if we are interested in
1325 overflow of the value, when >0 we are only interested in signed
1326 overflow, for <0 we are interested in any overflow. OVERFLOWED
1327 indicates whether overflow has already occurred. CONST_OVERFLOWED
1328 indicates whether constant overflow has already occurred. We force
1329 T's value to be within range of T's type (by setting to 0 or 1 all
1330 the bits outside the type's range). We set TREE_OVERFLOWED if,
1331 OVERFLOWED is nonzero,
1332 or OVERFLOWABLE is >0 and signed overflow occurs
1333 or OVERFLOWABLE is <0 and any overflow occurs
1334 We return a new tree node for the extended wide_int. The node
1335 is shared if no overflow flags are set. */
1339 force_fit_type (tree type
, const wide_int_ref
&cst
,
1340 int overflowable
, bool overflowed
)
1342 signop sign
= TYPE_SIGN (type
);
1344 /* If we need to set overflow flags, return a new unshared node. */
1345 if (overflowed
|| !wi::fits_to_tree_p (cst
, type
))
1349 || (overflowable
> 0 && sign
== SIGNED
))
1351 wide_int tmp
= wide_int::from (cst
, TYPE_PRECISION (type
), sign
);
1352 tree t
= build_new_int_cst (type
, tmp
);
1353 TREE_OVERFLOW (t
) = 1;
1358 /* Else build a shared node. */
1359 return wide_int_to_tree (type
, cst
);
1362 /* These are the hash table functions for the hash table of INTEGER_CST
1363 nodes of a sizetype. */
1365 /* Return the hash code X, an INTEGER_CST. */
1368 int_cst_hasher::hash (tree x
)
1370 const_tree
const t
= x
;
1371 hashval_t code
= TYPE_UID (TREE_TYPE (t
));
1374 for (i
= 0; i
< TREE_INT_CST_NUNITS (t
); i
++)
1375 code
= iterative_hash_host_wide_int (TREE_INT_CST_ELT(t
, i
), code
);
1380 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
1381 is the same as that given by *Y, which is the same. */
1384 int_cst_hasher::equal (tree x
, tree y
)
1386 const_tree
const xt
= x
;
1387 const_tree
const yt
= y
;
1389 if (TREE_TYPE (xt
) != TREE_TYPE (yt
)
1390 || TREE_INT_CST_NUNITS (xt
) != TREE_INT_CST_NUNITS (yt
)
1391 || TREE_INT_CST_EXT_NUNITS (xt
) != TREE_INT_CST_EXT_NUNITS (yt
))
1394 for (int i
= 0; i
< TREE_INT_CST_NUNITS (xt
); i
++)
1395 if (TREE_INT_CST_ELT (xt
, i
) != TREE_INT_CST_ELT (yt
, i
))
1401 /* Create an INT_CST node of TYPE and value CST.
1402 The returned node is always shared. For small integers we use a
1403 per-type vector cache, for larger ones we use a single hash table.
1404 The value is extended from its precision according to the sign of
1405 the type to be a multiple of HOST_BITS_PER_WIDE_INT. This defines
1406 the upper bits and ensures that hashing and value equality based
1407 upon the underlying HOST_WIDE_INTs works without masking. */
1410 wide_int_to_tree (tree type
, const wide_int_ref
&pcst
)
1417 unsigned int prec
= TYPE_PRECISION (type
);
1418 signop sgn
= TYPE_SIGN (type
);
1420 /* Verify that everything is canonical. */
1421 int l
= pcst
.get_len ();
1424 if (pcst
.elt (l
- 1) == 0)
1425 gcc_checking_assert (pcst
.elt (l
- 2) < 0);
1426 if (pcst
.elt (l
- 1) == (HOST_WIDE_INT
) -1)
1427 gcc_checking_assert (pcst
.elt (l
- 2) >= 0);
1430 wide_int cst
= wide_int::from (pcst
, prec
, sgn
);
1431 unsigned int ext_len
= get_int_cst_ext_nunits (type
, cst
);
1435 /* We just need to store a single HOST_WIDE_INT. */
1437 if (TYPE_UNSIGNED (type
))
1438 hwi
= cst
.to_uhwi ();
1440 hwi
= cst
.to_shwi ();
1442 switch (TREE_CODE (type
))
1445 gcc_assert (hwi
== 0);
1449 case REFERENCE_TYPE
:
1450 case POINTER_BOUNDS_TYPE
:
1451 /* Cache NULL pointer and zero bounds. */
1460 /* Cache false or true. */
1462 if (IN_RANGE (hwi
, 0, 1))
1468 if (TYPE_SIGN (type
) == UNSIGNED
)
1471 limit
= INTEGER_SHARE_LIMIT
;
1472 if (IN_RANGE (hwi
, 0, INTEGER_SHARE_LIMIT
- 1))
1477 /* Cache [-1, N). */
1478 limit
= INTEGER_SHARE_LIMIT
+ 1;
1479 if (IN_RANGE (hwi
, -1, INTEGER_SHARE_LIMIT
- 1))
1493 /* Look for it in the type's vector of small shared ints. */
1494 if (!TYPE_CACHED_VALUES_P (type
))
1496 TYPE_CACHED_VALUES_P (type
) = 1;
1497 TYPE_CACHED_VALUES (type
) = make_tree_vec (limit
);
1500 t
= TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
);
1502 /* Make sure no one is clobbering the shared constant. */
1503 gcc_checking_assert (TREE_TYPE (t
) == type
1504 && TREE_INT_CST_NUNITS (t
) == 1
1505 && TREE_INT_CST_OFFSET_NUNITS (t
) == 1
1506 && TREE_INT_CST_EXT_NUNITS (t
) == 1
1507 && TREE_INT_CST_ELT (t
, 0) == hwi
);
1510 /* Create a new shared int. */
1511 t
= build_new_int_cst (type
, cst
);
1512 TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) = t
;
1517 /* Use the cache of larger shared ints, using int_cst_node as
1520 TREE_INT_CST_ELT (int_cst_node
, 0) = hwi
;
1521 TREE_TYPE (int_cst_node
) = type
;
1523 tree
*slot
= int_cst_hash_table
->find_slot (int_cst_node
, INSERT
);
1527 /* Insert this one into the hash table. */
1530 /* Make a new node for next time round. */
1531 int_cst_node
= make_int_cst (1, 1);
1537 /* The value either hashes properly or we drop it on the floor
1538 for the gc to take care of. There will not be enough of them
1541 tree nt
= build_new_int_cst (type
, cst
);
1542 tree
*slot
= int_cst_hash_table
->find_slot (nt
, INSERT
);
1546 /* Insert this one into the hash table. */
1556 cache_integer_cst (tree t
)
1558 tree type
= TREE_TYPE (t
);
1561 int prec
= TYPE_PRECISION (type
);
1563 gcc_assert (!TREE_OVERFLOW (t
));
1565 switch (TREE_CODE (type
))
1568 gcc_assert (integer_zerop (t
));
1572 case REFERENCE_TYPE
:
1573 /* Cache NULL pointer. */
1574 if (integer_zerop (t
))
1582 /* Cache false or true. */
1584 if (wi::ltu_p (t
, 2))
1585 ix
= TREE_INT_CST_ELT (t
, 0);
1590 if (TYPE_UNSIGNED (type
))
1593 limit
= INTEGER_SHARE_LIMIT
;
1595 /* This is a little hokie, but if the prec is smaller than
1596 what is necessary to hold INTEGER_SHARE_LIMIT, then the
1597 obvious test will not get the correct answer. */
1598 if (prec
< HOST_BITS_PER_WIDE_INT
)
1600 if (tree_to_uhwi (t
) < (unsigned HOST_WIDE_INT
) INTEGER_SHARE_LIMIT
)
1601 ix
= tree_to_uhwi (t
);
1603 else if (wi::ltu_p (t
, INTEGER_SHARE_LIMIT
))
1604 ix
= tree_to_uhwi (t
);
1609 limit
= INTEGER_SHARE_LIMIT
+ 1;
1611 if (integer_minus_onep (t
))
1613 else if (!wi::neg_p (t
))
1615 if (prec
< HOST_BITS_PER_WIDE_INT
)
1617 if (tree_to_shwi (t
) < INTEGER_SHARE_LIMIT
)
1618 ix
= tree_to_shwi (t
) + 1;
1620 else if (wi::ltu_p (t
, INTEGER_SHARE_LIMIT
))
1621 ix
= tree_to_shwi (t
) + 1;
1635 /* Look for it in the type's vector of small shared ints. */
1636 if (!TYPE_CACHED_VALUES_P (type
))
1638 TYPE_CACHED_VALUES_P (type
) = 1;
1639 TYPE_CACHED_VALUES (type
) = make_tree_vec (limit
);
1642 gcc_assert (TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) == NULL_TREE
);
1643 TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) = t
;
1647 /* Use the cache of larger shared ints. */
1648 tree
*slot
= int_cst_hash_table
->find_slot (t
, INSERT
);
1649 /* If there is already an entry for the number verify it's the
1652 gcc_assert (wi::eq_p (tree (*slot
), t
));
1654 /* Otherwise insert this one into the hash table. */
1660 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
1661 and the rest are zeros. */
1664 build_low_bits_mask (tree type
, unsigned bits
)
1666 gcc_assert (bits
<= TYPE_PRECISION (type
));
1668 return wide_int_to_tree (type
, wi::mask (bits
, false,
1669 TYPE_PRECISION (type
)));
1672 /* Checks that X is integer constant that can be expressed in (unsigned)
1673 HOST_WIDE_INT without loss of precision. */
1676 cst_and_fits_in_hwi (const_tree x
)
1678 if (TREE_CODE (x
) != INTEGER_CST
)
1681 if (TYPE_PRECISION (TREE_TYPE (x
)) > HOST_BITS_PER_WIDE_INT
)
1684 return TREE_INT_CST_NUNITS (x
) == 1;
1687 /* Build a newly constructed VECTOR_CST node of length LEN. */
1690 make_vector_stat (unsigned len MEM_STAT_DECL
)
1693 unsigned length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vector
);
1695 record_node_allocation_statistics (VECTOR_CST
, length
);
1697 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
1699 TREE_SET_CODE (t
, VECTOR_CST
);
1700 TREE_CONSTANT (t
) = 1;
1705 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1706 are in a list pointed to by VALS. */
1709 build_vector_stat (tree type
, tree
*vals MEM_STAT_DECL
)
1713 tree v
= make_vector (TYPE_VECTOR_SUBPARTS (type
));
1714 TREE_TYPE (v
) = type
;
1716 /* Iterate through elements and check for overflow. */
1717 for (cnt
= 0; cnt
< TYPE_VECTOR_SUBPARTS (type
); ++cnt
)
1719 tree value
= vals
[cnt
];
1721 VECTOR_CST_ELT (v
, cnt
) = value
;
1723 /* Don't crash if we get an address constant. */
1724 if (!CONSTANT_CLASS_P (value
))
1727 over
|= TREE_OVERFLOW (value
);
1730 TREE_OVERFLOW (v
) = over
;
1734 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1735 are extracted from V, a vector of CONSTRUCTOR_ELT. */
1738 build_vector_from_ctor (tree type
, vec
<constructor_elt
, va_gc
> *v
)
1740 tree
*vec
= XALLOCAVEC (tree
, TYPE_VECTOR_SUBPARTS (type
));
1741 unsigned HOST_WIDE_INT idx
, pos
= 0;
1744 FOR_EACH_CONSTRUCTOR_VALUE (v
, idx
, value
)
1746 if (TREE_CODE (value
) == VECTOR_CST
)
1747 for (unsigned i
= 0; i
< VECTOR_CST_NELTS (value
); ++i
)
1748 vec
[pos
++] = VECTOR_CST_ELT (value
, i
);
1752 while (pos
< TYPE_VECTOR_SUBPARTS (type
))
1753 vec
[pos
++] = build_zero_cst (TREE_TYPE (type
));
1755 return build_vector (type
, vec
);
1758 /* Build a vector of type VECTYPE where all the elements are SCs. */
1760 build_vector_from_val (tree vectype
, tree sc
)
1762 int i
, nunits
= TYPE_VECTOR_SUBPARTS (vectype
);
1764 if (sc
== error_mark_node
)
1767 /* Verify that the vector type is suitable for SC. Note that there
1768 is some inconsistency in the type-system with respect to restrict
1769 qualifications of pointers. Vector types always have a main-variant
1770 element type and the qualification is applied to the vector-type.
1771 So TREE_TYPE (vector-type) does not return a properly qualified
1772 vector element-type. */
1773 gcc_checking_assert (types_compatible_p (TYPE_MAIN_VARIANT (TREE_TYPE (sc
)),
1774 TREE_TYPE (vectype
)));
1776 if (CONSTANT_CLASS_P (sc
))
1778 tree
*v
= XALLOCAVEC (tree
, nunits
);
1779 for (i
= 0; i
< nunits
; ++i
)
1781 return build_vector (vectype
, v
);
1785 vec
<constructor_elt
, va_gc
> *v
;
1786 vec_alloc (v
, nunits
);
1787 for (i
= 0; i
< nunits
; ++i
)
1788 CONSTRUCTOR_APPEND_ELT (v
, NULL_TREE
, sc
);
1789 return build_constructor (vectype
, v
);
1793 /* Something has messed with the elements of CONSTRUCTOR C after it was built;
1794 calculate TREE_CONSTANT and TREE_SIDE_EFFECTS. */
1797 recompute_constructor_flags (tree c
)
1801 bool constant_p
= true;
1802 bool side_effects_p
= false;
1803 vec
<constructor_elt
, va_gc
> *vals
= CONSTRUCTOR_ELTS (c
);
1805 FOR_EACH_CONSTRUCTOR_VALUE (vals
, i
, val
)
1807 /* Mostly ctors will have elts that don't have side-effects, so
1808 the usual case is to scan all the elements. Hence a single
1809 loop for both const and side effects, rather than one loop
1810 each (with early outs). */
1811 if (!TREE_CONSTANT (val
))
1813 if (TREE_SIDE_EFFECTS (val
))
1814 side_effects_p
= true;
1817 TREE_SIDE_EFFECTS (c
) = side_effects_p
;
1818 TREE_CONSTANT (c
) = constant_p
;
1821 /* Make sure that TREE_CONSTANT and TREE_SIDE_EFFECTS are correct for
1825 verify_constructor_flags (tree c
)
1829 bool constant_p
= TREE_CONSTANT (c
);
1830 bool side_effects_p
= TREE_SIDE_EFFECTS (c
);
1831 vec
<constructor_elt
, va_gc
> *vals
= CONSTRUCTOR_ELTS (c
);
1833 FOR_EACH_CONSTRUCTOR_VALUE (vals
, i
, val
)
1835 if (constant_p
&& !TREE_CONSTANT (val
))
1836 internal_error ("non-constant element in constant CONSTRUCTOR");
1837 if (!side_effects_p
&& TREE_SIDE_EFFECTS (val
))
1838 internal_error ("side-effects element in no-side-effects CONSTRUCTOR");
1842 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1843 are in the vec pointed to by VALS. */
1845 build_constructor (tree type
, vec
<constructor_elt
, va_gc
> *vals
)
1847 tree c
= make_node (CONSTRUCTOR
);
1849 TREE_TYPE (c
) = type
;
1850 CONSTRUCTOR_ELTS (c
) = vals
;
1852 recompute_constructor_flags (c
);
1857 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
1860 build_constructor_single (tree type
, tree index
, tree value
)
1862 vec
<constructor_elt
, va_gc
> *v
;
1863 constructor_elt elt
= {index
, value
};
1866 v
->quick_push (elt
);
1868 return build_constructor (type
, v
);
1872 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1873 are in a list pointed to by VALS. */
1875 build_constructor_from_list (tree type
, tree vals
)
1878 vec
<constructor_elt
, va_gc
> *v
= NULL
;
1882 vec_alloc (v
, list_length (vals
));
1883 for (t
= vals
; t
; t
= TREE_CHAIN (t
))
1884 CONSTRUCTOR_APPEND_ELT (v
, TREE_PURPOSE (t
), TREE_VALUE (t
));
1887 return build_constructor (type
, v
);
1890 /* Return a new CONSTRUCTOR node whose type is TYPE. NELTS is the number
1891 of elements, provided as index/value pairs. */
1894 build_constructor_va (tree type
, int nelts
, ...)
1896 vec
<constructor_elt
, va_gc
> *v
= NULL
;
1899 va_start (p
, nelts
);
1900 vec_alloc (v
, nelts
);
1903 tree index
= va_arg (p
, tree
);
1904 tree value
= va_arg (p
, tree
);
1905 CONSTRUCTOR_APPEND_ELT (v
, index
, value
);
1908 return build_constructor (type
, v
);
1911 /* Return a new FIXED_CST node whose type is TYPE and value is F. */
1914 build_fixed (tree type
, FIXED_VALUE_TYPE f
)
1917 FIXED_VALUE_TYPE
*fp
;
1919 v
= make_node (FIXED_CST
);
1920 fp
= ggc_alloc
<fixed_value
> ();
1921 memcpy (fp
, &f
, sizeof (FIXED_VALUE_TYPE
));
1923 TREE_TYPE (v
) = type
;
1924 TREE_FIXED_CST_PTR (v
) = fp
;
1928 /* Return a new REAL_CST node whose type is TYPE and value is D. */
1931 build_real (tree type
, REAL_VALUE_TYPE d
)
1934 REAL_VALUE_TYPE
*dp
;
1937 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
1938 Consider doing it via real_convert now. */
1940 v
= make_node (REAL_CST
);
1941 dp
= ggc_alloc
<real_value
> ();
1942 memcpy (dp
, &d
, sizeof (REAL_VALUE_TYPE
));
1944 TREE_TYPE (v
) = type
;
1945 TREE_REAL_CST_PTR (v
) = dp
;
1946 TREE_OVERFLOW (v
) = overflow
;
1950 /* Like build_real, but first truncate D to the type. */
1953 build_real_truncate (tree type
, REAL_VALUE_TYPE d
)
1955 return build_real (type
, real_value_truncate (TYPE_MODE (type
), d
));
1958 /* Return a new REAL_CST node whose type is TYPE
1959 and whose value is the integer value of the INTEGER_CST node I. */
1962 real_value_from_int_cst (const_tree type
, const_tree i
)
1966 /* Clear all bits of the real value type so that we can later do
1967 bitwise comparisons to see if two values are the same. */
1968 memset (&d
, 0, sizeof d
);
1970 real_from_integer (&d
, type
? TYPE_MODE (type
) : VOIDmode
, i
,
1971 TYPE_SIGN (TREE_TYPE (i
)));
1975 /* Given a tree representing an integer constant I, return a tree
1976 representing the same value as a floating-point constant of type TYPE. */
1979 build_real_from_int_cst (tree type
, const_tree i
)
1982 int overflow
= TREE_OVERFLOW (i
);
1984 v
= build_real (type
, real_value_from_int_cst (type
, i
));
1986 TREE_OVERFLOW (v
) |= overflow
;
1990 /* Return a newly constructed STRING_CST node whose value is
1991 the LEN characters at STR.
1992 Note that for a C string literal, LEN should include the trailing NUL.
1993 The TREE_TYPE is not initialized. */
1996 build_string (int len
, const char *str
)
2001 /* Do not waste bytes provided by padding of struct tree_string. */
2002 length
= len
+ offsetof (struct tree_string
, str
) + 1;
2004 record_node_allocation_statistics (STRING_CST
, length
);
2006 s
= (tree
) ggc_internal_alloc (length
);
2008 memset (s
, 0, sizeof (struct tree_typed
));
2009 TREE_SET_CODE (s
, STRING_CST
);
2010 TREE_CONSTANT (s
) = 1;
2011 TREE_STRING_LENGTH (s
) = len
;
2012 memcpy (s
->string
.str
, str
, len
);
2013 s
->string
.str
[len
] = '\0';
2018 /* Return a newly constructed COMPLEX_CST node whose value is
2019 specified by the real and imaginary parts REAL and IMAG.
2020 Both REAL and IMAG should be constant nodes. TYPE, if specified,
2021 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
2024 build_complex (tree type
, tree real
, tree imag
)
2026 tree t
= make_node (COMPLEX_CST
);
2028 TREE_REALPART (t
) = real
;
2029 TREE_IMAGPART (t
) = imag
;
2030 TREE_TYPE (t
) = type
? type
: build_complex_type (TREE_TYPE (real
));
2031 TREE_OVERFLOW (t
) = TREE_OVERFLOW (real
) | TREE_OVERFLOW (imag
);
2035 /* Build a complex (inf +- 0i), such as for the result of cproj.
2036 TYPE is the complex tree type of the result. If NEG is true, the
2037 imaginary zero is negative. */
2040 build_complex_inf (tree type
, bool neg
)
2042 REAL_VALUE_TYPE rinf
, rzero
= dconst0
;
2046 return build_complex (type
, build_real (TREE_TYPE (type
), rinf
),
2047 build_real (TREE_TYPE (type
), rzero
));
2050 /* Return the constant 1 in type TYPE. If TYPE has several elements, each
2051 element is set to 1. In particular, this is 1 + i for complex types. */
2054 build_each_one_cst (tree type
)
2056 if (TREE_CODE (type
) == COMPLEX_TYPE
)
2058 tree scalar
= build_one_cst (TREE_TYPE (type
));
2059 return build_complex (type
, scalar
, scalar
);
2062 return build_one_cst (type
);
2065 /* Return a constant of arithmetic type TYPE which is the
2066 multiplicative identity of the set TYPE. */
2069 build_one_cst (tree type
)
2071 switch (TREE_CODE (type
))
2073 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
2074 case POINTER_TYPE
: case REFERENCE_TYPE
:
2076 return build_int_cst (type
, 1);
2079 return build_real (type
, dconst1
);
2081 case FIXED_POINT_TYPE
:
2082 /* We can only generate 1 for accum types. */
2083 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type
)));
2084 return build_fixed (type
, FCONST1 (TYPE_MODE (type
)));
2088 tree scalar
= build_one_cst (TREE_TYPE (type
));
2090 return build_vector_from_val (type
, scalar
);
2094 return build_complex (type
,
2095 build_one_cst (TREE_TYPE (type
)),
2096 build_zero_cst (TREE_TYPE (type
)));
2103 /* Return an integer of type TYPE containing all 1's in as much precision as
2104 it contains, or a complex or vector whose subparts are such integers. */
2107 build_all_ones_cst (tree type
)
2109 if (TREE_CODE (type
) == COMPLEX_TYPE
)
2111 tree scalar
= build_all_ones_cst (TREE_TYPE (type
));
2112 return build_complex (type
, scalar
, scalar
);
2115 return build_minus_one_cst (type
);
2118 /* Return a constant of arithmetic type TYPE which is the
2119 opposite of the multiplicative identity of the set TYPE. */
2122 build_minus_one_cst (tree type
)
2124 switch (TREE_CODE (type
))
2126 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
2127 case POINTER_TYPE
: case REFERENCE_TYPE
:
2129 return build_int_cst (type
, -1);
2132 return build_real (type
, dconstm1
);
2134 case FIXED_POINT_TYPE
:
2135 /* We can only generate 1 for accum types. */
2136 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type
)));
2137 return build_fixed (type
, fixed_from_double_int (double_int_minus_one
,
2142 tree scalar
= build_minus_one_cst (TREE_TYPE (type
));
2144 return build_vector_from_val (type
, scalar
);
2148 return build_complex (type
,
2149 build_minus_one_cst (TREE_TYPE (type
)),
2150 build_zero_cst (TREE_TYPE (type
)));
2157 /* Build 0 constant of type TYPE. This is used by constructor folding
2158 and thus the constant should be represented in memory by
2162 build_zero_cst (tree type
)
2164 switch (TREE_CODE (type
))
2166 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
2167 case POINTER_TYPE
: case REFERENCE_TYPE
:
2168 case OFFSET_TYPE
: case NULLPTR_TYPE
:
2169 return build_int_cst (type
, 0);
2172 return build_real (type
, dconst0
);
2174 case FIXED_POINT_TYPE
:
2175 return build_fixed (type
, FCONST0 (TYPE_MODE (type
)));
2179 tree scalar
= build_zero_cst (TREE_TYPE (type
));
2181 return build_vector_from_val (type
, scalar
);
2186 tree zero
= build_zero_cst (TREE_TYPE (type
));
2188 return build_complex (type
, zero
, zero
);
2192 if (!AGGREGATE_TYPE_P (type
))
2193 return fold_convert (type
, integer_zero_node
);
2194 return build_constructor (type
, NULL
);
2199 /* Build a BINFO with LEN language slots. */
2202 make_tree_binfo_stat (unsigned base_binfos MEM_STAT_DECL
)
2205 size_t length
= (offsetof (struct tree_binfo
, base_binfos
)
2206 + vec
<tree
, va_gc
>::embedded_size (base_binfos
));
2208 record_node_allocation_statistics (TREE_BINFO
, length
);
2210 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
2212 memset (t
, 0, offsetof (struct tree_binfo
, base_binfos
));
2214 TREE_SET_CODE (t
, TREE_BINFO
);
2216 BINFO_BASE_BINFOS (t
)->embedded_init (base_binfos
);
2221 /* Create a CASE_LABEL_EXPR tree node and return it. */
2224 build_case_label (tree low_value
, tree high_value
, tree label_decl
)
2226 tree t
= make_node (CASE_LABEL_EXPR
);
2228 TREE_TYPE (t
) = void_type_node
;
2229 SET_EXPR_LOCATION (t
, DECL_SOURCE_LOCATION (label_decl
));
2231 CASE_LOW (t
) = low_value
;
2232 CASE_HIGH (t
) = high_value
;
2233 CASE_LABEL (t
) = label_decl
;
2234 CASE_CHAIN (t
) = NULL_TREE
;
2239 /* Build a newly constructed INTEGER_CST node. LEN and EXT_LEN are the
2240 values of TREE_INT_CST_NUNITS and TREE_INT_CST_EXT_NUNITS respectively.
2241 The latter determines the length of the HOST_WIDE_INT vector. */
2244 make_int_cst_stat (int len
, int ext_len MEM_STAT_DECL
)
2247 int length
= ((ext_len
- 1) * sizeof (HOST_WIDE_INT
)
2248 + sizeof (struct tree_int_cst
));
2251 record_node_allocation_statistics (INTEGER_CST
, length
);
2253 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
2255 TREE_SET_CODE (t
, INTEGER_CST
);
2256 TREE_INT_CST_NUNITS (t
) = len
;
2257 TREE_INT_CST_EXT_NUNITS (t
) = ext_len
;
2258 /* to_offset can only be applied to trees that are offset_int-sized
2259 or smaller. EXT_LEN is correct if it fits, otherwise the constant
2260 must be exactly the precision of offset_int and so LEN is correct. */
2261 if (ext_len
<= OFFSET_INT_ELTS
)
2262 TREE_INT_CST_OFFSET_NUNITS (t
) = ext_len
;
2264 TREE_INT_CST_OFFSET_NUNITS (t
) = len
;
2266 TREE_CONSTANT (t
) = 1;
2271 /* Build a newly constructed TREE_VEC node of length LEN. */
2274 make_tree_vec_stat (int len MEM_STAT_DECL
)
2277 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
2279 record_node_allocation_statistics (TREE_VEC
, length
);
2281 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
2283 TREE_SET_CODE (t
, TREE_VEC
);
2284 TREE_VEC_LENGTH (t
) = len
;
2289 /* Grow a TREE_VEC node to new length LEN. */
2292 grow_tree_vec_stat (tree v
, int len MEM_STAT_DECL
)
2294 gcc_assert (TREE_CODE (v
) == TREE_VEC
);
2296 int oldlen
= TREE_VEC_LENGTH (v
);
2297 gcc_assert (len
> oldlen
);
2299 int oldlength
= (oldlen
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
2300 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
2302 record_node_allocation_statistics (TREE_VEC
, length
- oldlength
);
2304 v
= (tree
) ggc_realloc (v
, length PASS_MEM_STAT
);
2306 TREE_VEC_LENGTH (v
) = len
;
2311 /* Return 1 if EXPR is the constant zero, whether it is integral, float or
2312 fixed, and scalar, complex or vector. */
2315 zerop (const_tree expr
)
2317 return (integer_zerop (expr
)
2318 || real_zerop (expr
)
2319 || fixed_zerop (expr
));
2322 /* Return 1 if EXPR is the integer constant zero or a complex constant
2326 integer_zerop (const_tree expr
)
2328 switch (TREE_CODE (expr
))
2331 return wi::eq_p (expr
, 0);
2333 return (integer_zerop (TREE_REALPART (expr
))
2334 && integer_zerop (TREE_IMAGPART (expr
)));
2338 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2339 if (!integer_zerop (VECTOR_CST_ELT (expr
, i
)))
2348 /* Return 1 if EXPR is the integer constant one or the corresponding
2349 complex constant. */
2352 integer_onep (const_tree expr
)
2354 switch (TREE_CODE (expr
))
2357 return wi::eq_p (wi::to_widest (expr
), 1);
2359 return (integer_onep (TREE_REALPART (expr
))
2360 && integer_zerop (TREE_IMAGPART (expr
)));
2364 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2365 if (!integer_onep (VECTOR_CST_ELT (expr
, i
)))
2374 /* Return 1 if EXPR is the integer constant one. For complex and vector,
2375 return 1 if every piece is the integer constant one. */
2378 integer_each_onep (const_tree expr
)
2380 if (TREE_CODE (expr
) == COMPLEX_CST
)
2381 return (integer_onep (TREE_REALPART (expr
))
2382 && integer_onep (TREE_IMAGPART (expr
)));
2384 return integer_onep (expr
);
2387 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
2388 it contains, or a complex or vector whose subparts are such integers. */
2391 integer_all_onesp (const_tree expr
)
2393 if (TREE_CODE (expr
) == COMPLEX_CST
2394 && integer_all_onesp (TREE_REALPART (expr
))
2395 && integer_all_onesp (TREE_IMAGPART (expr
)))
2398 else if (TREE_CODE (expr
) == VECTOR_CST
)
2401 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2402 if (!integer_all_onesp (VECTOR_CST_ELT (expr
, i
)))
2407 else if (TREE_CODE (expr
) != INTEGER_CST
)
2410 return wi::max_value (TYPE_PRECISION (TREE_TYPE (expr
)), UNSIGNED
) == expr
;
2413 /* Return 1 if EXPR is the integer constant minus one. */
2416 integer_minus_onep (const_tree expr
)
2418 if (TREE_CODE (expr
) == COMPLEX_CST
)
2419 return (integer_all_onesp (TREE_REALPART (expr
))
2420 && integer_zerop (TREE_IMAGPART (expr
)));
2422 return integer_all_onesp (expr
);
2425 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
2429 integer_pow2p (const_tree expr
)
2431 if (TREE_CODE (expr
) == COMPLEX_CST
2432 && integer_pow2p (TREE_REALPART (expr
))
2433 && integer_zerop (TREE_IMAGPART (expr
)))
2436 if (TREE_CODE (expr
) != INTEGER_CST
)
2439 return wi::popcount (expr
) == 1;
2442 /* Return 1 if EXPR is an integer constant other than zero or a
2443 complex constant other than zero. */
2446 integer_nonzerop (const_tree expr
)
2448 return ((TREE_CODE (expr
) == INTEGER_CST
2449 && !wi::eq_p (expr
, 0))
2450 || (TREE_CODE (expr
) == COMPLEX_CST
2451 && (integer_nonzerop (TREE_REALPART (expr
))
2452 || integer_nonzerop (TREE_IMAGPART (expr
)))));
2455 /* Return 1 if EXPR is the integer constant one. For vector,
2456 return 1 if every piece is the integer constant minus one
2457 (representing the value TRUE). */
2460 integer_truep (const_tree expr
)
2462 if (TREE_CODE (expr
) == VECTOR_CST
)
2463 return integer_all_onesp (expr
);
2464 return integer_onep (expr
);
2467 /* Return 1 if EXPR is the fixed-point constant zero. */
2470 fixed_zerop (const_tree expr
)
2472 return (TREE_CODE (expr
) == FIXED_CST
2473 && TREE_FIXED_CST (expr
).data
.is_zero ());
2476 /* Return the power of two represented by a tree node known to be a
2480 tree_log2 (const_tree expr
)
2482 if (TREE_CODE (expr
) == COMPLEX_CST
)
2483 return tree_log2 (TREE_REALPART (expr
));
2485 return wi::exact_log2 (expr
);
2488 /* Similar, but return the largest integer Y such that 2 ** Y is less
2489 than or equal to EXPR. */
2492 tree_floor_log2 (const_tree expr
)
2494 if (TREE_CODE (expr
) == COMPLEX_CST
)
2495 return tree_log2 (TREE_REALPART (expr
));
2497 return wi::floor_log2 (expr
);
2500 /* Return number of known trailing zero bits in EXPR, or, if the value of
2501 EXPR is known to be zero, the precision of it's type. */
2504 tree_ctz (const_tree expr
)
2506 if (!INTEGRAL_TYPE_P (TREE_TYPE (expr
))
2507 && !POINTER_TYPE_P (TREE_TYPE (expr
)))
2510 unsigned int ret1
, ret2
, prec
= TYPE_PRECISION (TREE_TYPE (expr
));
2511 switch (TREE_CODE (expr
))
2514 ret1
= wi::ctz (expr
);
2515 return MIN (ret1
, prec
);
2517 ret1
= wi::ctz (get_nonzero_bits (expr
));
2518 return MIN (ret1
, prec
);
2525 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2528 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2529 return MIN (ret1
, ret2
);
2530 case POINTER_PLUS_EXPR
:
2531 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2532 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2533 /* Second operand is sizetype, which could be in theory
2534 wider than pointer's precision. Make sure we never
2535 return more than prec. */
2536 ret2
= MIN (ret2
, prec
);
2537 return MIN (ret1
, ret2
);
2539 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2540 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2541 return MAX (ret1
, ret2
);
2543 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2544 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2545 return MIN (ret1
+ ret2
, prec
);
2547 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2548 if (tree_fits_uhwi_p (TREE_OPERAND (expr
, 1))
2549 && (tree_to_uhwi (TREE_OPERAND (expr
, 1)) < prec
))
2551 ret2
= tree_to_uhwi (TREE_OPERAND (expr
, 1));
2552 return MIN (ret1
+ ret2
, prec
);
2556 if (tree_fits_uhwi_p (TREE_OPERAND (expr
, 1))
2557 && (tree_to_uhwi (TREE_OPERAND (expr
, 1)) < prec
))
2559 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2560 ret2
= tree_to_uhwi (TREE_OPERAND (expr
, 1));
2565 case TRUNC_DIV_EXPR
:
2567 case FLOOR_DIV_EXPR
:
2568 case ROUND_DIV_EXPR
:
2569 case EXACT_DIV_EXPR
:
2570 if (TREE_CODE (TREE_OPERAND (expr
, 1)) == INTEGER_CST
2571 && tree_int_cst_sgn (TREE_OPERAND (expr
, 1)) == 1)
2573 int l
= tree_log2 (TREE_OPERAND (expr
, 1));
2576 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2584 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2585 if (ret1
&& ret1
== TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (expr
, 0))))
2587 return MIN (ret1
, prec
);
2589 return tree_ctz (TREE_OPERAND (expr
, 0));
2591 ret1
= tree_ctz (TREE_OPERAND (expr
, 1));
2594 ret2
= tree_ctz (TREE_OPERAND (expr
, 2));
2595 return MIN (ret1
, ret2
);
2597 return tree_ctz (TREE_OPERAND (expr
, 1));
2599 ret1
= get_pointer_alignment (CONST_CAST_TREE (expr
));
2600 if (ret1
> BITS_PER_UNIT
)
2602 ret1
= ctz_hwi (ret1
/ BITS_PER_UNIT
);
2603 return MIN (ret1
, prec
);
2611 /* Return 1 if EXPR is the real constant zero. Trailing zeroes matter for
2612 decimal float constants, so don't return 1 for them. */
2615 real_zerop (const_tree expr
)
2617 switch (TREE_CODE (expr
))
2620 return real_equal (&TREE_REAL_CST (expr
), &dconst0
)
2621 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2623 return real_zerop (TREE_REALPART (expr
))
2624 && real_zerop (TREE_IMAGPART (expr
));
2628 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2629 if (!real_zerop (VECTOR_CST_ELT (expr
, i
)))
2638 /* Return 1 if EXPR is the real constant one in real or complex form.
2639 Trailing zeroes matter for decimal float constants, so don't return
2643 real_onep (const_tree expr
)
2645 switch (TREE_CODE (expr
))
2648 return real_equal (&TREE_REAL_CST (expr
), &dconst1
)
2649 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2651 return real_onep (TREE_REALPART (expr
))
2652 && real_zerop (TREE_IMAGPART (expr
));
2656 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2657 if (!real_onep (VECTOR_CST_ELT (expr
, i
)))
2666 /* Return 1 if EXPR is the real constant minus one. Trailing zeroes
2667 matter for decimal float constants, so don't return 1 for them. */
2670 real_minus_onep (const_tree expr
)
2672 switch (TREE_CODE (expr
))
2675 return real_equal (&TREE_REAL_CST (expr
), &dconstm1
)
2676 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2678 return real_minus_onep (TREE_REALPART (expr
))
2679 && real_zerop (TREE_IMAGPART (expr
));
2683 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2684 if (!real_minus_onep (VECTOR_CST_ELT (expr
, i
)))
2693 /* Nonzero if EXP is a constant or a cast of a constant. */
2696 really_constant_p (const_tree exp
)
2698 /* This is not quite the same as STRIP_NOPS. It does more. */
2699 while (CONVERT_EXPR_P (exp
)
2700 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
2701 exp
= TREE_OPERAND (exp
, 0);
2702 return TREE_CONSTANT (exp
);
2705 /* Return first list element whose TREE_VALUE is ELEM.
2706 Return 0 if ELEM is not in LIST. */
2709 value_member (tree elem
, tree list
)
2713 if (elem
== TREE_VALUE (list
))
2715 list
= TREE_CHAIN (list
);
2720 /* Return first list element whose TREE_PURPOSE is ELEM.
2721 Return 0 if ELEM is not in LIST. */
2724 purpose_member (const_tree elem
, tree list
)
2728 if (elem
== TREE_PURPOSE (list
))
2730 list
= TREE_CHAIN (list
);
2735 /* Return true if ELEM is in V. */
2738 vec_member (const_tree elem
, vec
<tree
, va_gc
> *v
)
2742 FOR_EACH_VEC_SAFE_ELT (v
, ix
, t
)
2748 /* Returns element number IDX (zero-origin) of chain CHAIN, or
2752 chain_index (int idx
, tree chain
)
2754 for (; chain
&& idx
> 0; --idx
)
2755 chain
= TREE_CHAIN (chain
);
2759 /* Return nonzero if ELEM is part of the chain CHAIN. */
2762 chain_member (const_tree elem
, const_tree chain
)
2768 chain
= DECL_CHAIN (chain
);
2774 /* Return the length of a chain of nodes chained through TREE_CHAIN.
2775 We expect a null pointer to mark the end of the chain.
2776 This is the Lisp primitive `length'. */
2779 list_length (const_tree t
)
2782 #ifdef ENABLE_TREE_CHECKING
2790 #ifdef ENABLE_TREE_CHECKING
2793 gcc_assert (p
!= q
);
2801 /* Returns the first FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
2802 UNION_TYPE TYPE, or NULL_TREE if none. */
2805 first_field (const_tree type
)
2807 tree t
= TYPE_FIELDS (type
);
2808 while (t
&& TREE_CODE (t
) != FIELD_DECL
)
2813 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
2814 by modifying the last node in chain 1 to point to chain 2.
2815 This is the Lisp primitive `nconc'. */
2818 chainon (tree op1
, tree op2
)
2827 for (t1
= op1
; TREE_CHAIN (t1
); t1
= TREE_CHAIN (t1
))
2829 TREE_CHAIN (t1
) = op2
;
2831 #ifdef ENABLE_TREE_CHECKING
2834 for (t2
= op2
; t2
; t2
= TREE_CHAIN (t2
))
2835 gcc_assert (t2
!= t1
);
2842 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
2845 tree_last (tree chain
)
2849 while ((next
= TREE_CHAIN (chain
)))
2854 /* Reverse the order of elements in the chain T,
2855 and return the new head of the chain (old last element). */
2860 tree prev
= 0, decl
, next
;
2861 for (decl
= t
; decl
; decl
= next
)
2863 /* We shouldn't be using this function to reverse BLOCK chains; we
2864 have blocks_nreverse for that. */
2865 gcc_checking_assert (TREE_CODE (decl
) != BLOCK
);
2866 next
= TREE_CHAIN (decl
);
2867 TREE_CHAIN (decl
) = prev
;
2873 /* Return a newly created TREE_LIST node whose
2874 purpose and value fields are PARM and VALUE. */
2877 build_tree_list_stat (tree parm
, tree value MEM_STAT_DECL
)
2879 tree t
= make_node_stat (TREE_LIST PASS_MEM_STAT
);
2880 TREE_PURPOSE (t
) = parm
;
2881 TREE_VALUE (t
) = value
;
2885 /* Build a chain of TREE_LIST nodes from a vector. */
2888 build_tree_list_vec_stat (const vec
<tree
, va_gc
> *vec MEM_STAT_DECL
)
2890 tree ret
= NULL_TREE
;
2894 FOR_EACH_VEC_SAFE_ELT (vec
, i
, t
)
2896 *pp
= build_tree_list_stat (NULL
, t PASS_MEM_STAT
);
2897 pp
= &TREE_CHAIN (*pp
);
2902 /* Return a newly created TREE_LIST node whose
2903 purpose and value fields are PURPOSE and VALUE
2904 and whose TREE_CHAIN is CHAIN. */
2907 tree_cons_stat (tree purpose
, tree value
, tree chain MEM_STAT_DECL
)
2911 node
= ggc_alloc_tree_node_stat (sizeof (struct tree_list
) PASS_MEM_STAT
);
2912 memset (node
, 0, sizeof (struct tree_common
));
2914 record_node_allocation_statistics (TREE_LIST
, sizeof (struct tree_list
));
2916 TREE_SET_CODE (node
, TREE_LIST
);
2917 TREE_CHAIN (node
) = chain
;
2918 TREE_PURPOSE (node
) = purpose
;
2919 TREE_VALUE (node
) = value
;
2923 /* Return the values of the elements of a CONSTRUCTOR as a vector of
2927 ctor_to_vec (tree ctor
)
2929 vec
<tree
, va_gc
> *vec
;
2930 vec_alloc (vec
, CONSTRUCTOR_NELTS (ctor
));
2934 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), ix
, val
)
2935 vec
->quick_push (val
);
2940 /* Return the size nominally occupied by an object of type TYPE
2941 when it resides in memory. The value is measured in units of bytes,
2942 and its data type is that normally used for type sizes
2943 (which is the first type created by make_signed_type or
2944 make_unsigned_type). */
2947 size_in_bytes (const_tree type
)
2951 if (type
== error_mark_node
)
2952 return integer_zero_node
;
2954 type
= TYPE_MAIN_VARIANT (type
);
2955 t
= TYPE_SIZE_UNIT (type
);
2959 lang_hooks
.types
.incomplete_type_error (NULL_TREE
, type
);
2960 return size_zero_node
;
2966 /* Return the size of TYPE (in bytes) as a wide integer
2967 or return -1 if the size can vary or is larger than an integer. */
2970 int_size_in_bytes (const_tree type
)
2974 if (type
== error_mark_node
)
2977 type
= TYPE_MAIN_VARIANT (type
);
2978 t
= TYPE_SIZE_UNIT (type
);
2980 if (t
&& tree_fits_uhwi_p (t
))
2981 return TREE_INT_CST_LOW (t
);
2986 /* Return the maximum size of TYPE (in bytes) as a wide integer
2987 or return -1 if the size can vary or is larger than an integer. */
2990 max_int_size_in_bytes (const_tree type
)
2992 HOST_WIDE_INT size
= -1;
2995 /* If this is an array type, check for a possible MAX_SIZE attached. */
2997 if (TREE_CODE (type
) == ARRAY_TYPE
)
2999 size_tree
= TYPE_ARRAY_MAX_SIZE (type
);
3001 if (size_tree
&& tree_fits_uhwi_p (size_tree
))
3002 size
= tree_to_uhwi (size_tree
);
3005 /* If we still haven't been able to get a size, see if the language
3006 can compute a maximum size. */
3010 size_tree
= lang_hooks
.types
.max_size (type
);
3012 if (size_tree
&& tree_fits_uhwi_p (size_tree
))
3013 size
= tree_to_uhwi (size_tree
);
3019 /* Return the bit position of FIELD, in bits from the start of the record.
3020 This is a tree of type bitsizetype. */
3023 bit_position (const_tree field
)
3025 return bit_from_pos (DECL_FIELD_OFFSET (field
),
3026 DECL_FIELD_BIT_OFFSET (field
));
3029 /* Return the byte position of FIELD, in bytes from the start of the record.
3030 This is a tree of type sizetype. */
3033 byte_position (const_tree field
)
3035 return byte_from_pos (DECL_FIELD_OFFSET (field
),
3036 DECL_FIELD_BIT_OFFSET (field
));
3039 /* Likewise, but return as an integer. It must be representable in
3040 that way (since it could be a signed value, we don't have the
3041 option of returning -1 like int_size_in_byte can. */
3044 int_byte_position (const_tree field
)
3046 return tree_to_shwi (byte_position (field
));
3049 /* Return the strictest alignment, in bits, that T is known to have. */
3052 expr_align (const_tree t
)
3054 unsigned int align0
, align1
;
3056 switch (TREE_CODE (t
))
3058 CASE_CONVERT
: case NON_LVALUE_EXPR
:
3059 /* If we have conversions, we know that the alignment of the
3060 object must meet each of the alignments of the types. */
3061 align0
= expr_align (TREE_OPERAND (t
, 0));
3062 align1
= TYPE_ALIGN (TREE_TYPE (t
));
3063 return MAX (align0
, align1
);
3065 case SAVE_EXPR
: case COMPOUND_EXPR
: case MODIFY_EXPR
:
3066 case INIT_EXPR
: case TARGET_EXPR
: case WITH_CLEANUP_EXPR
:
3067 case CLEANUP_POINT_EXPR
:
3068 /* These don't change the alignment of an object. */
3069 return expr_align (TREE_OPERAND (t
, 0));
3072 /* The best we can do is say that the alignment is the least aligned
3074 align0
= expr_align (TREE_OPERAND (t
, 1));
3075 align1
= expr_align (TREE_OPERAND (t
, 2));
3076 return MIN (align0
, align1
);
3078 /* FIXME: LABEL_DECL and CONST_DECL never have DECL_ALIGN set
3079 meaningfully, it's always 1. */
3080 case LABEL_DECL
: case CONST_DECL
:
3081 case VAR_DECL
: case PARM_DECL
: case RESULT_DECL
:
3083 gcc_assert (DECL_ALIGN (t
) != 0);
3084 return DECL_ALIGN (t
);
3090 /* Otherwise take the alignment from that of the type. */
3091 return TYPE_ALIGN (TREE_TYPE (t
));
3094 /* Return, as a tree node, the number of elements for TYPE (which is an
3095 ARRAY_TYPE) minus one. This counts only elements of the top array. */
3098 array_type_nelts (const_tree type
)
3100 tree index_type
, min
, max
;
3102 /* If they did it with unspecified bounds, then we should have already
3103 given an error about it before we got here. */
3104 if (! TYPE_DOMAIN (type
))
3105 return error_mark_node
;
3107 index_type
= TYPE_DOMAIN (type
);
3108 min
= TYPE_MIN_VALUE (index_type
);
3109 max
= TYPE_MAX_VALUE (index_type
);
3111 /* TYPE_MAX_VALUE may not be set if the array has unknown length. */
3113 return error_mark_node
;
3115 return (integer_zerop (min
)
3117 : fold_build2 (MINUS_EXPR
, TREE_TYPE (max
), max
, min
));
3120 /* If arg is static -- a reference to an object in static storage -- then
3121 return the object. This is not the same as the C meaning of `static'.
3122 If arg isn't static, return NULL. */
3127 switch (TREE_CODE (arg
))
3130 /* Nested functions are static, even though taking their address will
3131 involve a trampoline as we unnest the nested function and create
3132 the trampoline on the tree level. */
3136 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
3137 && ! DECL_THREAD_LOCAL_P (arg
)
3138 && ! DECL_DLLIMPORT_P (arg
)
3142 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
3146 return TREE_STATIC (arg
) ? arg
: NULL
;
3153 /* If the thing being referenced is not a field, then it is
3154 something language specific. */
3155 gcc_assert (TREE_CODE (TREE_OPERAND (arg
, 1)) == FIELD_DECL
);
3157 /* If we are referencing a bitfield, we can't evaluate an
3158 ADDR_EXPR at compile time and so it isn't a constant. */
3159 if (DECL_BIT_FIELD (TREE_OPERAND (arg
, 1)))
3162 return staticp (TREE_OPERAND (arg
, 0));
3168 return TREE_CONSTANT (TREE_OPERAND (arg
, 0)) ? arg
: NULL
;
3171 case ARRAY_RANGE_REF
:
3172 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg
))) == INTEGER_CST
3173 && TREE_CODE (TREE_OPERAND (arg
, 1)) == INTEGER_CST
)
3174 return staticp (TREE_OPERAND (arg
, 0));
3178 case COMPOUND_LITERAL_EXPR
:
3179 return TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (arg
)) ? arg
: NULL
;
3189 /* Return whether OP is a DECL whose address is function-invariant. */
3192 decl_address_invariant_p (const_tree op
)
3194 /* The conditions below are slightly less strict than the one in
3197 switch (TREE_CODE (op
))
3206 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
3207 || DECL_THREAD_LOCAL_P (op
)
3208 || DECL_CONTEXT (op
) == current_function_decl
3209 || decl_function_context (op
) == current_function_decl
)
3214 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
3215 || decl_function_context (op
) == current_function_decl
)
3226 /* Return whether OP is a DECL whose address is interprocedural-invariant. */
3229 decl_address_ip_invariant_p (const_tree op
)
3231 /* The conditions below are slightly less strict than the one in
3234 switch (TREE_CODE (op
))
3242 if (((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
3243 && !DECL_DLLIMPORT_P (op
))
3244 || DECL_THREAD_LOCAL_P (op
))
3249 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
)))
3261 /* Return true if T is function-invariant (internal function, does
3262 not handle arithmetic; that's handled in skip_simple_arithmetic and
3263 tree_invariant_p). */
3266 tree_invariant_p_1 (tree t
)
3270 if (TREE_CONSTANT (t
)
3271 || (TREE_READONLY (t
) && !TREE_SIDE_EFFECTS (t
)))
3274 switch (TREE_CODE (t
))
3280 op
= TREE_OPERAND (t
, 0);
3281 while (handled_component_p (op
))
3283 switch (TREE_CODE (op
))
3286 case ARRAY_RANGE_REF
:
3287 if (!tree_invariant_p (TREE_OPERAND (op
, 1))
3288 || TREE_OPERAND (op
, 2) != NULL_TREE
3289 || TREE_OPERAND (op
, 3) != NULL_TREE
)
3294 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
3300 op
= TREE_OPERAND (op
, 0);
3303 return CONSTANT_CLASS_P (op
) || decl_address_invariant_p (op
);
3312 /* Return true if T is function-invariant. */
3315 tree_invariant_p (tree t
)
3317 tree inner
= skip_simple_arithmetic (t
);
3318 return tree_invariant_p_1 (inner
);
3321 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
3322 Do this to any expression which may be used in more than one place,
3323 but must be evaluated only once.
3325 Normally, expand_expr would reevaluate the expression each time.
3326 Calling save_expr produces something that is evaluated and recorded
3327 the first time expand_expr is called on it. Subsequent calls to
3328 expand_expr just reuse the recorded value.
3330 The call to expand_expr that generates code that actually computes
3331 the value is the first call *at compile time*. Subsequent calls
3332 *at compile time* generate code to use the saved value.
3333 This produces correct result provided that *at run time* control
3334 always flows through the insns made by the first expand_expr
3335 before reaching the other places where the save_expr was evaluated.
3336 You, the caller of save_expr, must make sure this is so.
3338 Constants, and certain read-only nodes, are returned with no
3339 SAVE_EXPR because that is safe. Expressions containing placeholders
3340 are not touched; see tree.def for an explanation of what these
3344 save_expr (tree expr
)
3346 tree t
= fold (expr
);
3349 /* If the tree evaluates to a constant, then we don't want to hide that
3350 fact (i.e. this allows further folding, and direct checks for constants).
3351 However, a read-only object that has side effects cannot be bypassed.
3352 Since it is no problem to reevaluate literals, we just return the
3354 inner
= skip_simple_arithmetic (t
);
3355 if (TREE_CODE (inner
) == ERROR_MARK
)
3358 if (tree_invariant_p_1 (inner
))
3361 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
3362 it means that the size or offset of some field of an object depends on
3363 the value within another field.
3365 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
3366 and some variable since it would then need to be both evaluated once and
3367 evaluated more than once. Front-ends must assure this case cannot
3368 happen by surrounding any such subexpressions in their own SAVE_EXPR
3369 and forcing evaluation at the proper time. */
3370 if (contains_placeholder_p (inner
))
3373 t
= build1 (SAVE_EXPR
, TREE_TYPE (expr
), t
);
3374 SET_EXPR_LOCATION (t
, EXPR_LOCATION (expr
));
3376 /* This expression might be placed ahead of a jump to ensure that the
3377 value was computed on both sides of the jump. So make sure it isn't
3378 eliminated as dead. */
3379 TREE_SIDE_EFFECTS (t
) = 1;
3383 /* Look inside EXPR into any simple arithmetic operations. Return the
3384 outermost non-arithmetic or non-invariant node. */
3387 skip_simple_arithmetic (tree expr
)
3389 /* We don't care about whether this can be used as an lvalue in this
3391 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
3392 expr
= TREE_OPERAND (expr
, 0);
3394 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
3395 a constant, it will be more efficient to not make another SAVE_EXPR since
3396 it will allow better simplification and GCSE will be able to merge the
3397 computations if they actually occur. */
3400 if (UNARY_CLASS_P (expr
))
3401 expr
= TREE_OPERAND (expr
, 0);
3402 else if (BINARY_CLASS_P (expr
))
3404 if (tree_invariant_p (TREE_OPERAND (expr
, 1)))
3405 expr
= TREE_OPERAND (expr
, 0);
3406 else if (tree_invariant_p (TREE_OPERAND (expr
, 0)))
3407 expr
= TREE_OPERAND (expr
, 1);
3418 /* Look inside EXPR into simple arithmetic operations involving constants.
3419 Return the outermost non-arithmetic or non-constant node. */
3422 skip_simple_constant_arithmetic (tree expr
)
3424 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
3425 expr
= TREE_OPERAND (expr
, 0);
3429 if (UNARY_CLASS_P (expr
))
3430 expr
= TREE_OPERAND (expr
, 0);
3431 else if (BINARY_CLASS_P (expr
))
3433 if (TREE_CONSTANT (TREE_OPERAND (expr
, 1)))
3434 expr
= TREE_OPERAND (expr
, 0);
3435 else if (TREE_CONSTANT (TREE_OPERAND (expr
, 0)))
3436 expr
= TREE_OPERAND (expr
, 1);
3447 /* Return which tree structure is used by T. */
3449 enum tree_node_structure_enum
3450 tree_node_structure (const_tree t
)
3452 const enum tree_code code
= TREE_CODE (t
);
3453 return tree_node_structure_for_code (code
);
3456 /* Set various status flags when building a CALL_EXPR object T. */
3459 process_call_operands (tree t
)
3461 bool side_effects
= TREE_SIDE_EFFECTS (t
);
3462 bool read_only
= false;
3463 int i
= call_expr_flags (t
);
3465 /* Calls have side-effects, except those to const or pure functions. */
3466 if ((i
& ECF_LOOPING_CONST_OR_PURE
) || !(i
& (ECF_CONST
| ECF_PURE
)))
3467 side_effects
= true;
3468 /* Propagate TREE_READONLY of arguments for const functions. */
3472 if (!side_effects
|| read_only
)
3473 for (i
= 1; i
< TREE_OPERAND_LENGTH (t
); i
++)
3475 tree op
= TREE_OPERAND (t
, i
);
3476 if (op
&& TREE_SIDE_EFFECTS (op
))
3477 side_effects
= true;
3478 if (op
&& !TREE_READONLY (op
) && !CONSTANT_CLASS_P (op
))
3482 TREE_SIDE_EFFECTS (t
) = side_effects
;
3483 TREE_READONLY (t
) = read_only
;
3486 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
3487 size or offset that depends on a field within a record. */
3490 contains_placeholder_p (const_tree exp
)
3492 enum tree_code code
;
3497 code
= TREE_CODE (exp
);
3498 if (code
== PLACEHOLDER_EXPR
)
3501 switch (TREE_CODE_CLASS (code
))
3504 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
3505 position computations since they will be converted into a
3506 WITH_RECORD_EXPR involving the reference, which will assume
3507 here will be valid. */
3508 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
3510 case tcc_exceptional
:
3511 if (code
== TREE_LIST
)
3512 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp
))
3513 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp
)));
3518 case tcc_comparison
:
3519 case tcc_expression
:
3523 /* Ignoring the first operand isn't quite right, but works best. */
3524 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1));
3527 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
3528 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1))
3529 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 2)));
3532 /* The save_expr function never wraps anything containing
3533 a PLACEHOLDER_EXPR. */
3540 switch (TREE_CODE_LENGTH (code
))
3543 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
3545 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
3546 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1)));
3557 const_call_expr_arg_iterator iter
;
3558 FOR_EACH_CONST_CALL_EXPR_ARG (arg
, iter
, exp
)
3559 if (CONTAINS_PLACEHOLDER_P (arg
))
3573 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
3574 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
3578 type_contains_placeholder_1 (const_tree type
)
3580 /* If the size contains a placeholder or the parent type (component type in
3581 the case of arrays) type involves a placeholder, this type does. */
3582 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type
))
3583 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type
))
3584 || (!POINTER_TYPE_P (type
)
3586 && type_contains_placeholder_p (TREE_TYPE (type
))))
3589 /* Now do type-specific checks. Note that the last part of the check above
3590 greatly limits what we have to do below. */
3591 switch (TREE_CODE (type
))
3594 case POINTER_BOUNDS_TYPE
:
3600 case REFERENCE_TYPE
:
3609 case FIXED_POINT_TYPE
:
3610 /* Here we just check the bounds. */
3611 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type
))
3612 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type
)));
3615 /* We have already checked the component type above, so just check
3616 the domain type. Flexible array members have a null domain. */
3617 return TYPE_DOMAIN (type
) ?
3618 type_contains_placeholder_p (TYPE_DOMAIN (type
)) : false;
3622 case QUAL_UNION_TYPE
:
3626 for (field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
3627 if (TREE_CODE (field
) == FIELD_DECL
3628 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field
))
3629 || (TREE_CODE (type
) == QUAL_UNION_TYPE
3630 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field
)))
3631 || type_contains_placeholder_p (TREE_TYPE (field
))))
3642 /* Wrapper around above function used to cache its result. */
3645 type_contains_placeholder_p (tree type
)
3649 /* If the contains_placeholder_bits field has been initialized,
3650 then we know the answer. */
3651 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) > 0)
3652 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) - 1;
3654 /* Indicate that we've seen this type node, and the answer is false.
3655 This is what we want to return if we run into recursion via fields. */
3656 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = 1;
3658 /* Compute the real value. */
3659 result
= type_contains_placeholder_1 (type
);
3661 /* Store the real value. */
3662 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = result
+ 1;
3667 /* Push tree EXP onto vector QUEUE if it is not already present. */
3670 push_without_duplicates (tree exp
, vec
<tree
> *queue
)
3675 FOR_EACH_VEC_ELT (*queue
, i
, iter
)
3676 if (simple_cst_equal (iter
, exp
) == 1)
3680 queue
->safe_push (exp
);
3683 /* Given a tree EXP, find all occurrences of references to fields
3684 in a PLACEHOLDER_EXPR and place them in vector REFS without
3685 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
3686 we assume here that EXP contains only arithmetic expressions
3687 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
3691 find_placeholder_in_expr (tree exp
, vec
<tree
> *refs
)
3693 enum tree_code code
= TREE_CODE (exp
);
3697 /* We handle TREE_LIST and COMPONENT_REF separately. */
3698 if (code
== TREE_LIST
)
3700 FIND_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), refs
);
3701 FIND_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), refs
);
3703 else if (code
== COMPONENT_REF
)
3705 for (inner
= TREE_OPERAND (exp
, 0);
3706 REFERENCE_CLASS_P (inner
);
3707 inner
= TREE_OPERAND (inner
, 0))
3710 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
)
3711 push_without_duplicates (exp
, refs
);
3713 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), refs
);
3716 switch (TREE_CODE_CLASS (code
))
3721 case tcc_declaration
:
3722 /* Variables allocated to static storage can stay. */
3723 if (!TREE_STATIC (exp
))
3724 push_without_duplicates (exp
, refs
);
3727 case tcc_expression
:
3728 /* This is the pattern built in ada/make_aligning_type. */
3729 if (code
== ADDR_EXPR
3730 && TREE_CODE (TREE_OPERAND (exp
, 0)) == PLACEHOLDER_EXPR
)
3732 push_without_duplicates (exp
, refs
);
3736 /* Fall through... */
3738 case tcc_exceptional
:
3741 case tcc_comparison
:
3743 for (i
= 0; i
< TREE_CODE_LENGTH (code
); i
++)
3744 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
3748 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3749 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
3757 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
3758 return a tree with all occurrences of references to F in a
3759 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
3760 CONST_DECLs. Note that we assume here that EXP contains only
3761 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
3762 occurring only in their argument list. */
3765 substitute_in_expr (tree exp
, tree f
, tree r
)
3767 enum tree_code code
= TREE_CODE (exp
);
3768 tree op0
, op1
, op2
, op3
;
3771 /* We handle TREE_LIST and COMPONENT_REF separately. */
3772 if (code
== TREE_LIST
)
3774 op0
= SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp
), f
, r
);
3775 op1
= SUBSTITUTE_IN_EXPR (TREE_VALUE (exp
), f
, r
);
3776 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
3779 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
3781 else if (code
== COMPONENT_REF
)
3785 /* If this expression is getting a value from a PLACEHOLDER_EXPR
3786 and it is the right field, replace it with R. */
3787 for (inner
= TREE_OPERAND (exp
, 0);
3788 REFERENCE_CLASS_P (inner
);
3789 inner
= TREE_OPERAND (inner
, 0))
3793 op1
= TREE_OPERAND (exp
, 1);
3795 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& op1
== f
)
3798 /* If this expression hasn't been completed let, leave it alone. */
3799 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& !TREE_TYPE (inner
))
3802 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3803 if (op0
== TREE_OPERAND (exp
, 0))
3807 = fold_build3 (COMPONENT_REF
, TREE_TYPE (exp
), op0
, op1
, NULL_TREE
);
3810 switch (TREE_CODE_CLASS (code
))
3815 case tcc_declaration
:
3821 case tcc_expression
:
3825 /* Fall through... */
3827 case tcc_exceptional
:
3830 case tcc_comparison
:
3832 switch (TREE_CODE_LENGTH (code
))
3838 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3839 if (op0
== TREE_OPERAND (exp
, 0))
3842 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
3846 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3847 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3849 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
3852 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
3856 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3857 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3858 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
3860 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3861 && op2
== TREE_OPERAND (exp
, 2))
3864 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
3868 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3869 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3870 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
3871 op3
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 3), f
, r
);
3873 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3874 && op2
== TREE_OPERAND (exp
, 2)
3875 && op3
== TREE_OPERAND (exp
, 3))
3879 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
3891 new_tree
= NULL_TREE
;
3893 /* If we are trying to replace F with a constant, inline back
3894 functions which do nothing else than computing a value from
3895 the arguments they are passed. This makes it possible to
3896 fold partially or entirely the replacement expression. */
3897 if (CONSTANT_CLASS_P (r
) && code
== CALL_EXPR
)
3899 tree t
= maybe_inline_call_in_expr (exp
);
3901 return SUBSTITUTE_IN_EXPR (t
, f
, r
);
3904 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3906 tree op
= TREE_OPERAND (exp
, i
);
3907 tree new_op
= SUBSTITUTE_IN_EXPR (op
, f
, r
);
3911 new_tree
= copy_node (exp
);
3912 TREE_OPERAND (new_tree
, i
) = new_op
;
3918 new_tree
= fold (new_tree
);
3919 if (TREE_CODE (new_tree
) == CALL_EXPR
)
3920 process_call_operands (new_tree
);
3931 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
3933 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
3934 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
3939 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
3940 for it within OBJ, a tree that is an object or a chain of references. */
3943 substitute_placeholder_in_expr (tree exp
, tree obj
)
3945 enum tree_code code
= TREE_CODE (exp
);
3946 tree op0
, op1
, op2
, op3
;
3949 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
3950 in the chain of OBJ. */
3951 if (code
== PLACEHOLDER_EXPR
)
3953 tree need_type
= TYPE_MAIN_VARIANT (TREE_TYPE (exp
));
3956 for (elt
= obj
; elt
!= 0;
3957 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
3958 || TREE_CODE (elt
) == COND_EXPR
)
3959 ? TREE_OPERAND (elt
, 1)
3960 : (REFERENCE_CLASS_P (elt
)
3961 || UNARY_CLASS_P (elt
)
3962 || BINARY_CLASS_P (elt
)
3963 || VL_EXP_CLASS_P (elt
)
3964 || EXPRESSION_CLASS_P (elt
))
3965 ? TREE_OPERAND (elt
, 0) : 0))
3966 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt
)) == need_type
)
3969 for (elt
= obj
; elt
!= 0;
3970 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
3971 || TREE_CODE (elt
) == COND_EXPR
)
3972 ? TREE_OPERAND (elt
, 1)
3973 : (REFERENCE_CLASS_P (elt
)
3974 || UNARY_CLASS_P (elt
)
3975 || BINARY_CLASS_P (elt
)
3976 || VL_EXP_CLASS_P (elt
)
3977 || EXPRESSION_CLASS_P (elt
))
3978 ? TREE_OPERAND (elt
, 0) : 0))
3979 if (POINTER_TYPE_P (TREE_TYPE (elt
))
3980 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt
)))
3982 return fold_build1 (INDIRECT_REF
, need_type
, elt
);
3984 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
3985 survives until RTL generation, there will be an error. */
3989 /* TREE_LIST is special because we need to look at TREE_VALUE
3990 and TREE_CHAIN, not TREE_OPERANDS. */
3991 else if (code
== TREE_LIST
)
3993 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), obj
);
3994 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), obj
);
3995 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
3998 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
4001 switch (TREE_CODE_CLASS (code
))
4004 case tcc_declaration
:
4007 case tcc_exceptional
:
4010 case tcc_comparison
:
4011 case tcc_expression
:
4014 switch (TREE_CODE_LENGTH (code
))
4020 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
4021 if (op0
== TREE_OPERAND (exp
, 0))
4024 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
4028 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
4029 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
4031 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
4034 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
4038 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
4039 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
4040 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
4042 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
4043 && op2
== TREE_OPERAND (exp
, 2))
4046 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
4050 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
4051 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
4052 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
4053 op3
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 3), obj
);
4055 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
4056 && op2
== TREE_OPERAND (exp
, 2)
4057 && op3
== TREE_OPERAND (exp
, 3))
4061 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
4073 new_tree
= NULL_TREE
;
4075 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
4077 tree op
= TREE_OPERAND (exp
, i
);
4078 tree new_op
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (op
, obj
);
4082 new_tree
= copy_node (exp
);
4083 TREE_OPERAND (new_tree
, i
) = new_op
;
4089 new_tree
= fold (new_tree
);
4090 if (TREE_CODE (new_tree
) == CALL_EXPR
)
4091 process_call_operands (new_tree
);
4102 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
4104 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
4105 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
4111 /* Subroutine of stabilize_reference; this is called for subtrees of
4112 references. Any expression with side-effects must be put in a SAVE_EXPR
4113 to ensure that it is only evaluated once.
4115 We don't put SAVE_EXPR nodes around everything, because assigning very
4116 simple expressions to temporaries causes us to miss good opportunities
4117 for optimizations. Among other things, the opportunity to fold in the
4118 addition of a constant into an addressing mode often gets lost, e.g.
4119 "y[i+1] += x;". In general, we take the approach that we should not make
4120 an assignment unless we are forced into it - i.e., that any non-side effect
4121 operator should be allowed, and that cse should take care of coalescing
4122 multiple utterances of the same expression should that prove fruitful. */
4125 stabilize_reference_1 (tree e
)
4128 enum tree_code code
= TREE_CODE (e
);
4130 /* We cannot ignore const expressions because it might be a reference
4131 to a const array but whose index contains side-effects. But we can
4132 ignore things that are actual constant or that already have been
4133 handled by this function. */
4135 if (tree_invariant_p (e
))
4138 switch (TREE_CODE_CLASS (code
))
4140 case tcc_exceptional
:
4142 case tcc_declaration
:
4143 case tcc_comparison
:
4145 case tcc_expression
:
4148 /* If the expression has side-effects, then encase it in a SAVE_EXPR
4149 so that it will only be evaluated once. */
4150 /* The reference (r) and comparison (<) classes could be handled as
4151 below, but it is generally faster to only evaluate them once. */
4152 if (TREE_SIDE_EFFECTS (e
))
4153 return save_expr (e
);
4157 /* Constants need no processing. In fact, we should never reach
4162 /* Division is slow and tends to be compiled with jumps,
4163 especially the division by powers of 2 that is often
4164 found inside of an array reference. So do it just once. */
4165 if (code
== TRUNC_DIV_EXPR
|| code
== TRUNC_MOD_EXPR
4166 || code
== FLOOR_DIV_EXPR
|| code
== FLOOR_MOD_EXPR
4167 || code
== CEIL_DIV_EXPR
|| code
== CEIL_MOD_EXPR
4168 || code
== ROUND_DIV_EXPR
|| code
== ROUND_MOD_EXPR
)
4169 return save_expr (e
);
4170 /* Recursively stabilize each operand. */
4171 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)),
4172 stabilize_reference_1 (TREE_OPERAND (e
, 1)));
4176 /* Recursively stabilize each operand. */
4177 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)));
4184 TREE_TYPE (result
) = TREE_TYPE (e
);
4185 TREE_READONLY (result
) = TREE_READONLY (e
);
4186 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (e
);
4187 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (e
);
4192 /* Stabilize a reference so that we can use it any number of times
4193 without causing its operands to be evaluated more than once.
4194 Returns the stabilized reference. This works by means of save_expr,
4195 so see the caveats in the comments about save_expr.
4197 Also allows conversion expressions whose operands are references.
4198 Any other kind of expression is returned unchanged. */
4201 stabilize_reference (tree ref
)
4204 enum tree_code code
= TREE_CODE (ref
);
4211 /* No action is needed in this case. */
4216 case FIX_TRUNC_EXPR
:
4217 result
= build_nt (code
, stabilize_reference (TREE_OPERAND (ref
, 0)));
4221 result
= build_nt (INDIRECT_REF
,
4222 stabilize_reference_1 (TREE_OPERAND (ref
, 0)));
4226 result
= build_nt (COMPONENT_REF
,
4227 stabilize_reference (TREE_OPERAND (ref
, 0)),
4228 TREE_OPERAND (ref
, 1), NULL_TREE
);
4232 result
= build_nt (BIT_FIELD_REF
,
4233 stabilize_reference (TREE_OPERAND (ref
, 0)),
4234 TREE_OPERAND (ref
, 1), TREE_OPERAND (ref
, 2));
4235 REF_REVERSE_STORAGE_ORDER (result
) = REF_REVERSE_STORAGE_ORDER (ref
);
4239 result
= build_nt (ARRAY_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));
4245 case ARRAY_RANGE_REF
:
4246 result
= build_nt (ARRAY_RANGE_REF
,
4247 stabilize_reference (TREE_OPERAND (ref
, 0)),
4248 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
4249 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
4253 /* We cannot wrap the first expression in a SAVE_EXPR, as then
4254 it wouldn't be ignored. This matters when dealing with
4256 return stabilize_reference_1 (ref
);
4258 /* If arg isn't a kind of lvalue we recognize, make no change.
4259 Caller should recognize the error for an invalid lvalue. */
4264 return error_mark_node
;
4267 TREE_TYPE (result
) = TREE_TYPE (ref
);
4268 TREE_READONLY (result
) = TREE_READONLY (ref
);
4269 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (ref
);
4270 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (ref
);
4275 /* Low-level constructors for expressions. */
4277 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
4278 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
4281 recompute_tree_invariant_for_addr_expr (tree t
)
4284 bool tc
= true, se
= false;
4286 gcc_assert (TREE_CODE (t
) == ADDR_EXPR
);
4288 /* We started out assuming this address is both invariant and constant, but
4289 does not have side effects. Now go down any handled components and see if
4290 any of them involve offsets that are either non-constant or non-invariant.
4291 Also check for side-effects.
4293 ??? Note that this code makes no attempt to deal with the case where
4294 taking the address of something causes a copy due to misalignment. */
4296 #define UPDATE_FLAGS(NODE) \
4297 do { tree _node = (NODE); \
4298 if (_node && !TREE_CONSTANT (_node)) tc = false; \
4299 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
4301 for (node
= TREE_OPERAND (t
, 0); handled_component_p (node
);
4302 node
= TREE_OPERAND (node
, 0))
4304 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
4305 array reference (probably made temporarily by the G++ front end),
4306 so ignore all the operands. */
4307 if ((TREE_CODE (node
) == ARRAY_REF
4308 || TREE_CODE (node
) == ARRAY_RANGE_REF
)
4309 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node
, 0))) == ARRAY_TYPE
)
4311 UPDATE_FLAGS (TREE_OPERAND (node
, 1));
4312 if (TREE_OPERAND (node
, 2))
4313 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
4314 if (TREE_OPERAND (node
, 3))
4315 UPDATE_FLAGS (TREE_OPERAND (node
, 3));
4317 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
4318 FIELD_DECL, apparently. The G++ front end can put something else
4319 there, at least temporarily. */
4320 else if (TREE_CODE (node
) == COMPONENT_REF
4321 && TREE_CODE (TREE_OPERAND (node
, 1)) == FIELD_DECL
)
4323 if (TREE_OPERAND (node
, 2))
4324 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
4328 node
= lang_hooks
.expr_to_decl (node
, &tc
, &se
);
4330 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
4331 the address, since &(*a)->b is a form of addition. If it's a constant, the
4332 address is constant too. If it's a decl, its address is constant if the
4333 decl is static. Everything else is not constant and, furthermore,
4334 taking the address of a volatile variable is not volatile. */
4335 if (TREE_CODE (node
) == INDIRECT_REF
4336 || TREE_CODE (node
) == MEM_REF
)
4337 UPDATE_FLAGS (TREE_OPERAND (node
, 0));
4338 else if (CONSTANT_CLASS_P (node
))
4340 else if (DECL_P (node
))
4341 tc
&= (staticp (node
) != NULL_TREE
);
4345 se
|= TREE_SIDE_EFFECTS (node
);
4349 TREE_CONSTANT (t
) = tc
;
4350 TREE_SIDE_EFFECTS (t
) = se
;
4354 /* Build an expression of code CODE, data type TYPE, and operands as
4355 specified. Expressions and reference nodes can be created this way.
4356 Constants, decls, types and misc nodes cannot be.
4358 We define 5 non-variadic functions, from 0 to 4 arguments. This is
4359 enough for all extant tree codes. */
4362 build0_stat (enum tree_code code
, tree tt MEM_STAT_DECL
)
4366 gcc_assert (TREE_CODE_LENGTH (code
) == 0);
4368 t
= make_node_stat (code PASS_MEM_STAT
);
4375 build1_stat (enum tree_code code
, tree type
, tree node MEM_STAT_DECL
)
4377 int length
= sizeof (struct tree_exp
);
4380 record_node_allocation_statistics (code
, length
);
4382 gcc_assert (TREE_CODE_LENGTH (code
) == 1);
4384 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
4386 memset (t
, 0, sizeof (struct tree_common
));
4388 TREE_SET_CODE (t
, code
);
4390 TREE_TYPE (t
) = type
;
4391 SET_EXPR_LOCATION (t
, UNKNOWN_LOCATION
);
4392 TREE_OPERAND (t
, 0) = node
;
4393 if (node
&& !TYPE_P (node
))
4395 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (node
);
4396 TREE_READONLY (t
) = TREE_READONLY (node
);
4399 if (TREE_CODE_CLASS (code
) == tcc_statement
)
4400 TREE_SIDE_EFFECTS (t
) = 1;
4404 /* All of these have side-effects, no matter what their
4406 TREE_SIDE_EFFECTS (t
) = 1;
4407 TREE_READONLY (t
) = 0;
4411 /* Whether a dereference is readonly has nothing to do with whether
4412 its operand is readonly. */
4413 TREE_READONLY (t
) = 0;
4418 recompute_tree_invariant_for_addr_expr (t
);
4422 if ((TREE_CODE_CLASS (code
) == tcc_unary
|| code
== VIEW_CONVERT_EXPR
)
4423 && node
&& !TYPE_P (node
)
4424 && TREE_CONSTANT (node
))
4425 TREE_CONSTANT (t
) = 1;
4426 if (TREE_CODE_CLASS (code
) == tcc_reference
4427 && node
&& TREE_THIS_VOLATILE (node
))
4428 TREE_THIS_VOLATILE (t
) = 1;
4435 #define PROCESS_ARG(N) \
4437 TREE_OPERAND (t, N) = arg##N; \
4438 if (arg##N &&!TYPE_P (arg##N)) \
4440 if (TREE_SIDE_EFFECTS (arg##N)) \
4442 if (!TREE_READONLY (arg##N) \
4443 && !CONSTANT_CLASS_P (arg##N)) \
4444 (void) (read_only = 0); \
4445 if (!TREE_CONSTANT (arg##N)) \
4446 (void) (constant = 0); \
4451 build2_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1 MEM_STAT_DECL
)
4453 bool constant
, read_only
, side_effects
;
4456 gcc_assert (TREE_CODE_LENGTH (code
) == 2);
4458 if ((code
== MINUS_EXPR
|| code
== PLUS_EXPR
|| code
== MULT_EXPR
)
4459 && arg0
&& arg1
&& tt
&& POINTER_TYPE_P (tt
)
4460 /* When sizetype precision doesn't match that of pointers
4461 we need to be able to build explicit extensions or truncations
4462 of the offset argument. */
4463 && TYPE_PRECISION (sizetype
) == TYPE_PRECISION (tt
))
4464 gcc_assert (TREE_CODE (arg0
) == INTEGER_CST
4465 && TREE_CODE (arg1
) == INTEGER_CST
);
4467 if (code
== POINTER_PLUS_EXPR
&& arg0
&& arg1
&& tt
)
4468 gcc_assert (POINTER_TYPE_P (tt
) && POINTER_TYPE_P (TREE_TYPE (arg0
))
4469 && ptrofftype_p (TREE_TYPE (arg1
)));
4471 t
= make_node_stat (code PASS_MEM_STAT
);
4474 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
4475 result based on those same flags for the arguments. But if the
4476 arguments aren't really even `tree' expressions, we shouldn't be trying
4479 /* Expressions without side effects may be constant if their
4480 arguments are as well. */
4481 constant
= (TREE_CODE_CLASS (code
) == tcc_comparison
4482 || TREE_CODE_CLASS (code
) == tcc_binary
);
4484 side_effects
= TREE_SIDE_EFFECTS (t
);
4489 TREE_SIDE_EFFECTS (t
) = side_effects
;
4490 if (code
== MEM_REF
)
4492 if (arg0
&& TREE_CODE (arg0
) == ADDR_EXPR
)
4494 tree o
= TREE_OPERAND (arg0
, 0);
4495 TREE_READONLY (t
) = TREE_READONLY (o
);
4496 TREE_THIS_VOLATILE (t
) = TREE_THIS_VOLATILE (o
);
4501 TREE_READONLY (t
) = read_only
;
4502 TREE_CONSTANT (t
) = constant
;
4503 TREE_THIS_VOLATILE (t
)
4504 = (TREE_CODE_CLASS (code
) == tcc_reference
4505 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4513 build3_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4514 tree arg2 MEM_STAT_DECL
)
4516 bool constant
, read_only
, side_effects
;
4519 gcc_assert (TREE_CODE_LENGTH (code
) == 3);
4520 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
4522 t
= make_node_stat (code PASS_MEM_STAT
);
4527 /* As a special exception, if COND_EXPR has NULL branches, we
4528 assume that it is a gimple statement and always consider
4529 it to have side effects. */
4530 if (code
== COND_EXPR
4531 && tt
== void_type_node
4532 && arg1
== NULL_TREE
4533 && arg2
== NULL_TREE
)
4534 side_effects
= true;
4536 side_effects
= TREE_SIDE_EFFECTS (t
);
4542 if (code
== COND_EXPR
)
4543 TREE_READONLY (t
) = read_only
;
4545 TREE_SIDE_EFFECTS (t
) = side_effects
;
4546 TREE_THIS_VOLATILE (t
)
4547 = (TREE_CODE_CLASS (code
) == tcc_reference
4548 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4554 build4_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4555 tree arg2
, tree arg3 MEM_STAT_DECL
)
4557 bool constant
, read_only
, side_effects
;
4560 gcc_assert (TREE_CODE_LENGTH (code
) == 4);
4562 t
= make_node_stat (code PASS_MEM_STAT
);
4565 side_effects
= TREE_SIDE_EFFECTS (t
);
4572 TREE_SIDE_EFFECTS (t
) = side_effects
;
4573 TREE_THIS_VOLATILE (t
)
4574 = (TREE_CODE_CLASS (code
) == tcc_reference
4575 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4581 build5_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4582 tree arg2
, tree arg3
, tree arg4 MEM_STAT_DECL
)
4584 bool constant
, read_only
, side_effects
;
4587 gcc_assert (TREE_CODE_LENGTH (code
) == 5);
4589 t
= make_node_stat (code PASS_MEM_STAT
);
4592 side_effects
= TREE_SIDE_EFFECTS (t
);
4600 TREE_SIDE_EFFECTS (t
) = side_effects
;
4601 if (code
== TARGET_MEM_REF
)
4603 if (arg0
&& TREE_CODE (arg0
) == ADDR_EXPR
)
4605 tree o
= TREE_OPERAND (arg0
, 0);
4606 TREE_READONLY (t
) = TREE_READONLY (o
);
4607 TREE_THIS_VOLATILE (t
) = TREE_THIS_VOLATILE (o
);
4611 TREE_THIS_VOLATILE (t
)
4612 = (TREE_CODE_CLASS (code
) == tcc_reference
4613 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4618 /* Build a simple MEM_REF tree with the sematics of a plain INDIRECT_REF
4619 on the pointer PTR. */
4622 build_simple_mem_ref_loc (location_t loc
, tree ptr
)
4624 HOST_WIDE_INT offset
= 0;
4625 tree ptype
= TREE_TYPE (ptr
);
4627 /* For convenience allow addresses that collapse to a simple base
4629 if (TREE_CODE (ptr
) == ADDR_EXPR
4630 && (handled_component_p (TREE_OPERAND (ptr
, 0))
4631 || TREE_CODE (TREE_OPERAND (ptr
, 0)) == MEM_REF
))
4633 ptr
= get_addr_base_and_unit_offset (TREE_OPERAND (ptr
, 0), &offset
);
4635 ptr
= build_fold_addr_expr (ptr
);
4636 gcc_assert (is_gimple_reg (ptr
) || is_gimple_min_invariant (ptr
));
4638 tem
= build2 (MEM_REF
, TREE_TYPE (ptype
),
4639 ptr
, build_int_cst (ptype
, offset
));
4640 SET_EXPR_LOCATION (tem
, loc
);
4644 /* Return the constant offset of a MEM_REF or TARGET_MEM_REF tree T. */
4647 mem_ref_offset (const_tree t
)
4649 return offset_int::from (TREE_OPERAND (t
, 1), SIGNED
);
4652 /* Return an invariant ADDR_EXPR of type TYPE taking the address of BASE
4653 offsetted by OFFSET units. */
4656 build_invariant_address (tree type
, tree base
, HOST_WIDE_INT offset
)
4658 tree ref
= fold_build2 (MEM_REF
, TREE_TYPE (type
),
4659 build_fold_addr_expr (base
),
4660 build_int_cst (ptr_type_node
, offset
));
4661 tree addr
= build1 (ADDR_EXPR
, type
, ref
);
4662 recompute_tree_invariant_for_addr_expr (addr
);
4666 /* Similar except don't specify the TREE_TYPE
4667 and leave the TREE_SIDE_EFFECTS as 0.
4668 It is permissible for arguments to be null,
4669 or even garbage if their values do not matter. */
4672 build_nt (enum tree_code code
, ...)
4679 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
4683 t
= make_node (code
);
4684 length
= TREE_CODE_LENGTH (code
);
4686 for (i
= 0; i
< length
; i
++)
4687 TREE_OPERAND (t
, i
) = va_arg (p
, tree
);
4693 /* Similar to build_nt, but for creating a CALL_EXPR object with a
4697 build_nt_call_vec (tree fn
, vec
<tree
, va_gc
> *args
)
4702 ret
= build_vl_exp (CALL_EXPR
, vec_safe_length (args
) + 3);
4703 CALL_EXPR_FN (ret
) = fn
;
4704 CALL_EXPR_STATIC_CHAIN (ret
) = NULL_TREE
;
4705 FOR_EACH_VEC_SAFE_ELT (args
, ix
, t
)
4706 CALL_EXPR_ARG (ret
, ix
) = t
;
4710 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
4711 We do NOT enter this node in any sort of symbol table.
4713 LOC is the location of the decl.
4715 layout_decl is used to set up the decl's storage layout.
4716 Other slots are initialized to 0 or null pointers. */
4719 build_decl_stat (location_t loc
, enum tree_code code
, tree name
,
4720 tree type MEM_STAT_DECL
)
4724 t
= make_node_stat (code PASS_MEM_STAT
);
4725 DECL_SOURCE_LOCATION (t
) = loc
;
4727 /* if (type == error_mark_node)
4728 type = integer_type_node; */
4729 /* That is not done, deliberately, so that having error_mark_node
4730 as the type can suppress useless errors in the use of this variable. */
4732 DECL_NAME (t
) = name
;
4733 TREE_TYPE (t
) = type
;
4735 if (code
== VAR_DECL
|| code
== PARM_DECL
|| code
== RESULT_DECL
)
4741 /* Builds and returns function declaration with NAME and TYPE. */
4744 build_fn_decl (const char *name
, tree type
)
4746 tree id
= get_identifier (name
);
4747 tree decl
= build_decl (input_location
, FUNCTION_DECL
, id
, type
);
4749 DECL_EXTERNAL (decl
) = 1;
4750 TREE_PUBLIC (decl
) = 1;
4751 DECL_ARTIFICIAL (decl
) = 1;
4752 TREE_NOTHROW (decl
) = 1;
4757 vec
<tree
, va_gc
> *all_translation_units
;
4759 /* Builds a new translation-unit decl with name NAME, queues it in the
4760 global list of translation-unit decls and returns it. */
4763 build_translation_unit_decl (tree name
)
4765 tree tu
= build_decl (UNKNOWN_LOCATION
, TRANSLATION_UNIT_DECL
,
4767 TRANSLATION_UNIT_LANGUAGE (tu
) = lang_hooks
.name
;
4768 vec_safe_push (all_translation_units
, tu
);
4773 /* BLOCK nodes are used to represent the structure of binding contours
4774 and declarations, once those contours have been exited and their contents
4775 compiled. This information is used for outputting debugging info. */
4778 build_block (tree vars
, tree subblocks
, tree supercontext
, tree chain
)
4780 tree block
= make_node (BLOCK
);
4782 BLOCK_VARS (block
) = vars
;
4783 BLOCK_SUBBLOCKS (block
) = subblocks
;
4784 BLOCK_SUPERCONTEXT (block
) = supercontext
;
4785 BLOCK_CHAIN (block
) = chain
;
4790 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
4792 LOC is the location to use in tree T. */
4795 protected_set_expr_location (tree t
, location_t loc
)
4797 if (CAN_HAVE_LOCATION_P (t
))
4798 SET_EXPR_LOCATION (t
, loc
);
4801 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
4805 build_decl_attribute_variant (tree ddecl
, tree attribute
)
4807 DECL_ATTRIBUTES (ddecl
) = attribute
;
4811 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4812 is ATTRIBUTE and its qualifiers are QUALS.
4814 Record such modified types already made so we don't make duplicates. */
4817 build_type_attribute_qual_variant (tree ttype
, tree attribute
, int quals
)
4819 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype
), attribute
))
4821 inchash::hash hstate
;
4825 enum tree_code code
= TREE_CODE (ttype
);
4827 /* Building a distinct copy of a tagged type is inappropriate; it
4828 causes breakage in code that expects there to be a one-to-one
4829 relationship between a struct and its fields.
4830 build_duplicate_type is another solution (as used in
4831 handle_transparent_union_attribute), but that doesn't play well
4832 with the stronger C++ type identity model. */
4833 if (TREE_CODE (ttype
) == RECORD_TYPE
4834 || TREE_CODE (ttype
) == UNION_TYPE
4835 || TREE_CODE (ttype
) == QUAL_UNION_TYPE
4836 || TREE_CODE (ttype
) == ENUMERAL_TYPE
)
4838 warning (OPT_Wattributes
,
4839 "ignoring attributes applied to %qT after definition",
4840 TYPE_MAIN_VARIANT (ttype
));
4841 return build_qualified_type (ttype
, quals
);
4844 ttype
= build_qualified_type (ttype
, TYPE_UNQUALIFIED
);
4845 ntype
= build_distinct_type_copy (ttype
);
4847 TYPE_ATTRIBUTES (ntype
) = attribute
;
4849 hstate
.add_int (code
);
4850 if (TREE_TYPE (ntype
))
4851 hstate
.add_object (TYPE_HASH (TREE_TYPE (ntype
)));
4852 attribute_hash_list (attribute
, hstate
);
4854 switch (TREE_CODE (ntype
))
4857 type_hash_list (TYPE_ARG_TYPES (ntype
), hstate
);
4860 if (TYPE_DOMAIN (ntype
))
4861 hstate
.add_object (TYPE_HASH (TYPE_DOMAIN (ntype
)));
4864 t
= TYPE_MAX_VALUE (ntype
);
4865 for (i
= 0; i
< TREE_INT_CST_NUNITS (t
); i
++)
4866 hstate
.add_object (TREE_INT_CST_ELT (t
, i
));
4869 case FIXED_POINT_TYPE
:
4871 unsigned int precision
= TYPE_PRECISION (ntype
);
4872 hstate
.add_object (precision
);
4879 ntype
= type_hash_canon (hstate
.end(), ntype
);
4881 /* If the target-dependent attributes make NTYPE different from
4882 its canonical type, we will need to use structural equality
4883 checks for this type. */
4884 if (TYPE_STRUCTURAL_EQUALITY_P (ttype
)
4885 || !comp_type_attributes (ntype
, ttype
))
4886 SET_TYPE_STRUCTURAL_EQUALITY (ntype
);
4887 else if (TYPE_CANONICAL (ntype
) == ntype
)
4888 TYPE_CANONICAL (ntype
) = TYPE_CANONICAL (ttype
);
4890 ttype
= build_qualified_type (ntype
, quals
);
4892 else if (TYPE_QUALS (ttype
) != quals
)
4893 ttype
= build_qualified_type (ttype
, quals
);
4898 /* Check if "omp declare simd" attribute arguments, CLAUSES1 and CLAUSES2, are
4902 omp_declare_simd_clauses_equal (tree clauses1
, tree clauses2
)
4905 for (cl1
= clauses1
, cl2
= clauses2
;
4907 cl1
= OMP_CLAUSE_CHAIN (cl1
), cl2
= OMP_CLAUSE_CHAIN (cl2
))
4909 if (OMP_CLAUSE_CODE (cl1
) != OMP_CLAUSE_CODE (cl2
))
4911 if (OMP_CLAUSE_CODE (cl1
) != OMP_CLAUSE_SIMDLEN
)
4913 if (simple_cst_equal (OMP_CLAUSE_DECL (cl1
),
4914 OMP_CLAUSE_DECL (cl2
)) != 1)
4917 switch (OMP_CLAUSE_CODE (cl1
))
4919 case OMP_CLAUSE_ALIGNED
:
4920 if (simple_cst_equal (OMP_CLAUSE_ALIGNED_ALIGNMENT (cl1
),
4921 OMP_CLAUSE_ALIGNED_ALIGNMENT (cl2
)) != 1)
4924 case OMP_CLAUSE_LINEAR
:
4925 if (simple_cst_equal (OMP_CLAUSE_LINEAR_STEP (cl1
),
4926 OMP_CLAUSE_LINEAR_STEP (cl2
)) != 1)
4929 case OMP_CLAUSE_SIMDLEN
:
4930 if (simple_cst_equal (OMP_CLAUSE_SIMDLEN_EXPR (cl1
),
4931 OMP_CLAUSE_SIMDLEN_EXPR (cl2
)) != 1)
4940 /* Compare two constructor-element-type constants. Return 1 if the lists
4941 are known to be equal; otherwise return 0. */
4944 simple_cst_list_equal (const_tree l1
, const_tree l2
)
4946 while (l1
!= NULL_TREE
&& l2
!= NULL_TREE
)
4948 if (simple_cst_equal (TREE_VALUE (l1
), TREE_VALUE (l2
)) != 1)
4951 l1
= TREE_CHAIN (l1
);
4952 l2
= TREE_CHAIN (l2
);
4958 /* Compare two identifier nodes representing attributes. Either one may
4959 be in wrapped __ATTR__ form. Return true if they are the same, false
4963 cmp_attrib_identifiers (const_tree attr1
, const_tree attr2
)
4965 /* Make sure we're dealing with IDENTIFIER_NODEs. */
4966 gcc_checking_assert (TREE_CODE (attr1
) == IDENTIFIER_NODE
4967 && TREE_CODE (attr2
) == IDENTIFIER_NODE
);
4969 /* Identifiers can be compared directly for equality. */
4973 /* If they are not equal, they may still be one in the form
4974 'text' while the other one is in the form '__text__'. TODO:
4975 If we were storing attributes in normalized 'text' form, then
4976 this could all go away and we could take full advantage of
4977 the fact that we're comparing identifiers. :-) */
4978 const size_t attr1_len
= IDENTIFIER_LENGTH (attr1
);
4979 const size_t attr2_len
= IDENTIFIER_LENGTH (attr2
);
4981 if (attr2_len
== attr1_len
+ 4)
4983 const char *p
= IDENTIFIER_POINTER (attr2
);
4984 const char *q
= IDENTIFIER_POINTER (attr1
);
4985 if (p
[0] == '_' && p
[1] == '_'
4986 && p
[attr2_len
- 2] == '_' && p
[attr2_len
- 1] == '_'
4987 && strncmp (q
, p
+ 2, attr1_len
) == 0)
4990 else if (attr2_len
+ 4 == attr1_len
)
4992 const char *p
= IDENTIFIER_POINTER (attr2
);
4993 const char *q
= IDENTIFIER_POINTER (attr1
);
4994 if (q
[0] == '_' && q
[1] == '_'
4995 && q
[attr1_len
- 2] == '_' && q
[attr1_len
- 1] == '_'
4996 && strncmp (q
+ 2, p
, attr2_len
) == 0)
5003 /* Compare two attributes for their value identity. Return true if the
5004 attribute values are known to be equal; otherwise return false. */
5007 attribute_value_equal (const_tree attr1
, const_tree attr2
)
5009 if (TREE_VALUE (attr1
) == TREE_VALUE (attr2
))
5012 if (TREE_VALUE (attr1
) != NULL_TREE
5013 && TREE_CODE (TREE_VALUE (attr1
)) == TREE_LIST
5014 && TREE_VALUE (attr2
) != NULL_TREE
5015 && TREE_CODE (TREE_VALUE (attr2
)) == TREE_LIST
)
5017 /* Handle attribute format. */
5018 if (is_attribute_p ("format", TREE_PURPOSE (attr1
)))
5020 attr1
= TREE_VALUE (attr1
);
5021 attr2
= TREE_VALUE (attr2
);
5022 /* Compare the archetypes (printf/scanf/strftime/...). */
5023 if (!cmp_attrib_identifiers (TREE_VALUE (attr1
),
5024 TREE_VALUE (attr2
)))
5026 /* Archetypes are the same. Compare the rest. */
5027 return (simple_cst_list_equal (TREE_CHAIN (attr1
),
5028 TREE_CHAIN (attr2
)) == 1);
5030 return (simple_cst_list_equal (TREE_VALUE (attr1
),
5031 TREE_VALUE (attr2
)) == 1);
5034 if ((flag_openmp
|| flag_openmp_simd
)
5035 && TREE_VALUE (attr1
) && TREE_VALUE (attr2
)
5036 && TREE_CODE (TREE_VALUE (attr1
)) == OMP_CLAUSE
5037 && TREE_CODE (TREE_VALUE (attr2
)) == OMP_CLAUSE
)
5038 return omp_declare_simd_clauses_equal (TREE_VALUE (attr1
),
5039 TREE_VALUE (attr2
));
5041 return (simple_cst_equal (TREE_VALUE (attr1
), TREE_VALUE (attr2
)) == 1);
5044 /* Return 0 if the attributes for two types are incompatible, 1 if they
5045 are compatible, and 2 if they are nearly compatible (which causes a
5046 warning to be generated). */
5048 comp_type_attributes (const_tree type1
, const_tree type2
)
5050 const_tree a1
= TYPE_ATTRIBUTES (type1
);
5051 const_tree a2
= TYPE_ATTRIBUTES (type2
);
5056 for (a
= a1
; a
!= NULL_TREE
; a
= TREE_CHAIN (a
))
5058 const struct attribute_spec
*as
;
5061 as
= lookup_attribute_spec (get_attribute_name (a
));
5062 if (!as
|| as
->affects_type_identity
== false)
5065 attr
= lookup_attribute (as
->name
, CONST_CAST_TREE (a2
));
5066 if (!attr
|| !attribute_value_equal (a
, attr
))
5071 for (a
= a2
; a
!= NULL_TREE
; a
= TREE_CHAIN (a
))
5073 const struct attribute_spec
*as
;
5075 as
= lookup_attribute_spec (get_attribute_name (a
));
5076 if (!as
|| as
->affects_type_identity
== false)
5079 if (!lookup_attribute (as
->name
, CONST_CAST_TREE (a1
)))
5081 /* We don't need to compare trees again, as we did this
5082 already in first loop. */
5084 /* All types - affecting identity - are equal, so
5085 there is no need to call target hook for comparison. */
5089 if (lookup_attribute ("transaction_safe", CONST_CAST_TREE (a
)))
5091 /* As some type combinations - like default calling-convention - might
5092 be compatible, we have to call the target hook to get the final result. */
5093 return targetm
.comp_type_attributes (type1
, type2
);
5096 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
5099 Record such modified types already made so we don't make duplicates. */
5102 build_type_attribute_variant (tree ttype
, tree attribute
)
5104 return build_type_attribute_qual_variant (ttype
, attribute
,
5105 TYPE_QUALS (ttype
));
5109 /* Reset the expression *EXPR_P, a size or position.
5111 ??? We could reset all non-constant sizes or positions. But it's cheap
5112 enough to not do so and refrain from adding workarounds to dwarf2out.c.
5114 We need to reset self-referential sizes or positions because they cannot
5115 be gimplified and thus can contain a CALL_EXPR after the gimplification
5116 is finished, which will run afoul of LTO streaming. And they need to be
5117 reset to something essentially dummy but not constant, so as to preserve
5118 the properties of the object they are attached to. */
5121 free_lang_data_in_one_sizepos (tree
*expr_p
)
5123 tree expr
= *expr_p
;
5124 if (CONTAINS_PLACEHOLDER_P (expr
))
5125 *expr_p
= build0 (PLACEHOLDER_EXPR
, TREE_TYPE (expr
));
5129 /* Reset all the fields in a binfo node BINFO. We only keep
5130 BINFO_VTABLE, which is used by gimple_fold_obj_type_ref. */
5133 free_lang_data_in_binfo (tree binfo
)
5138 gcc_assert (TREE_CODE (binfo
) == TREE_BINFO
);
5140 BINFO_VIRTUALS (binfo
) = NULL_TREE
;
5141 BINFO_BASE_ACCESSES (binfo
) = NULL
;
5142 BINFO_INHERITANCE_CHAIN (binfo
) = NULL_TREE
;
5143 BINFO_SUBVTT_INDEX (binfo
) = NULL_TREE
;
5145 FOR_EACH_VEC_ELT (*BINFO_BASE_BINFOS (binfo
), i
, t
)
5146 free_lang_data_in_binfo (t
);
5150 /* Reset all language specific information still present in TYPE. */
5153 free_lang_data_in_type (tree type
)
5155 gcc_assert (TYPE_P (type
));
5157 /* Give the FE a chance to remove its own data first. */
5158 lang_hooks
.free_lang_data (type
);
5160 TREE_LANG_FLAG_0 (type
) = 0;
5161 TREE_LANG_FLAG_1 (type
) = 0;
5162 TREE_LANG_FLAG_2 (type
) = 0;
5163 TREE_LANG_FLAG_3 (type
) = 0;
5164 TREE_LANG_FLAG_4 (type
) = 0;
5165 TREE_LANG_FLAG_5 (type
) = 0;
5166 TREE_LANG_FLAG_6 (type
) = 0;
5168 if (TREE_CODE (type
) == FUNCTION_TYPE
)
5170 /* Remove the const and volatile qualifiers from arguments. The
5171 C++ front end removes them, but the C front end does not,
5172 leading to false ODR violation errors when merging two
5173 instances of the same function signature compiled by
5174 different front ends. */
5177 for (p
= TYPE_ARG_TYPES (type
); p
; p
= TREE_CHAIN (p
))
5179 tree arg_type
= TREE_VALUE (p
);
5181 if (TYPE_READONLY (arg_type
) || TYPE_VOLATILE (arg_type
))
5183 int quals
= TYPE_QUALS (arg_type
)
5185 & ~TYPE_QUAL_VOLATILE
;
5186 TREE_VALUE (p
) = build_qualified_type (arg_type
, quals
);
5187 free_lang_data_in_type (TREE_VALUE (p
));
5189 /* C++ FE uses TREE_PURPOSE to store initial values. */
5190 TREE_PURPOSE (p
) = NULL
;
5192 /* Java uses TYPE_MINVAL for TYPE_ARGUMENT_SIGNATURE. */
5193 TYPE_MINVAL (type
) = NULL
;
5195 if (TREE_CODE (type
) == METHOD_TYPE
)
5199 for (p
= TYPE_ARG_TYPES (type
); p
; p
= TREE_CHAIN (p
))
5201 /* C++ FE uses TREE_PURPOSE to store initial values. */
5202 TREE_PURPOSE (p
) = NULL
;
5204 /* Java uses TYPE_MINVAL for TYPE_ARGUMENT_SIGNATURE. */
5205 TYPE_MINVAL (type
) = NULL
;
5208 /* Remove members that are not actually FIELD_DECLs from the field
5209 list of an aggregate. These occur in C++. */
5210 if (RECORD_OR_UNION_TYPE_P (type
))
5214 /* Note that TYPE_FIELDS can be shared across distinct
5215 TREE_TYPEs. Therefore, if the first field of TYPE_FIELDS is
5216 to be removed, we cannot set its TREE_CHAIN to NULL.
5217 Otherwise, we would not be able to find all the other fields
5218 in the other instances of this TREE_TYPE.
5220 This was causing an ICE in testsuite/g++.dg/lto/20080915.C. */
5222 member
= TYPE_FIELDS (type
);
5225 if (TREE_CODE (member
) == FIELD_DECL
5226 || (TREE_CODE (member
) == TYPE_DECL
5227 && !DECL_IGNORED_P (member
)
5228 && debug_info_level
> DINFO_LEVEL_TERSE
5229 && !is_redundant_typedef (member
)))
5232 TREE_CHAIN (prev
) = member
;
5234 TYPE_FIELDS (type
) = member
;
5238 member
= TREE_CHAIN (member
);
5242 TREE_CHAIN (prev
) = NULL_TREE
;
5244 TYPE_FIELDS (type
) = NULL_TREE
;
5246 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
5247 and danagle the pointer from time to time. */
5248 if (TYPE_VFIELD (type
) && TREE_CODE (TYPE_VFIELD (type
)) != FIELD_DECL
)
5249 TYPE_VFIELD (type
) = NULL_TREE
;
5251 /* Remove TYPE_METHODS list. While it would be nice to keep it
5252 to enable ODR warnings about different method lists, doing so
5253 seems to impractically increase size of LTO data streamed.
5254 Keep the information if TYPE_METHODS was non-NULL. This is used
5255 by function.c and pretty printers. */
5256 if (TYPE_METHODS (type
))
5257 TYPE_METHODS (type
) = error_mark_node
;
5258 if (TYPE_BINFO (type
))
5260 free_lang_data_in_binfo (TYPE_BINFO (type
));
5261 /* We need to preserve link to bases and virtual table for all
5262 polymorphic types to make devirtualization machinery working.
5263 Debug output cares only about bases, but output also
5264 virtual table pointers so merging of -fdevirtualize and
5265 -fno-devirtualize units is easier. */
5266 if ((!BINFO_VTABLE (TYPE_BINFO (type
))
5267 || !flag_devirtualize
)
5268 && ((!BINFO_N_BASE_BINFOS (TYPE_BINFO (type
))
5269 && !BINFO_VTABLE (TYPE_BINFO (type
)))
5270 || debug_info_level
!= DINFO_LEVEL_NONE
))
5271 TYPE_BINFO (type
) = NULL
;
5276 /* For non-aggregate types, clear out the language slot (which
5277 overloads TYPE_BINFO). */
5278 TYPE_LANG_SLOT_1 (type
) = NULL_TREE
;
5280 if (INTEGRAL_TYPE_P (type
)
5281 || SCALAR_FLOAT_TYPE_P (type
)
5282 || FIXED_POINT_TYPE_P (type
))
5284 free_lang_data_in_one_sizepos (&TYPE_MIN_VALUE (type
));
5285 free_lang_data_in_one_sizepos (&TYPE_MAX_VALUE (type
));
5289 free_lang_data_in_one_sizepos (&TYPE_SIZE (type
));
5290 free_lang_data_in_one_sizepos (&TYPE_SIZE_UNIT (type
));
5292 if (TYPE_CONTEXT (type
)
5293 && TREE_CODE (TYPE_CONTEXT (type
)) == BLOCK
)
5295 tree ctx
= TYPE_CONTEXT (type
);
5298 ctx
= BLOCK_SUPERCONTEXT (ctx
);
5300 while (ctx
&& TREE_CODE (ctx
) == BLOCK
);
5301 TYPE_CONTEXT (type
) = ctx
;
5306 /* Return true if DECL may need an assembler name to be set. */
5309 need_assembler_name_p (tree decl
)
5311 /* We use DECL_ASSEMBLER_NAME to hold mangled type names for One Definition
5312 Rule merging. This makes type_odr_p to return true on those types during
5313 LTO and by comparing the mangled name, we can say what types are intended
5314 to be equivalent across compilation unit.
5316 We do not store names of type_in_anonymous_namespace_p.
5318 Record, union and enumeration type have linkage that allows use
5319 to check type_in_anonymous_namespace_p. We do not mangle compound types
5320 that always can be compared structurally.
5322 Similarly for builtin types, we compare properties of their main variant.
5323 A special case are integer types where mangling do make differences
5324 between char/signed char/unsigned char etc. Storing name for these makes
5325 e.g. -fno-signed-char/-fsigned-char mismatches to be handled well.
5326 See cp/mangle.c:write_builtin_type for details. */
5328 if (flag_lto_odr_type_mering
5329 && TREE_CODE (decl
) == TYPE_DECL
5331 && decl
== TYPE_NAME (TREE_TYPE (decl
))
5332 && TYPE_MAIN_VARIANT (TREE_TYPE (decl
)) == TREE_TYPE (decl
)
5333 && !TYPE_ARTIFICIAL (TREE_TYPE (decl
))
5334 && (type_with_linkage_p (TREE_TYPE (decl
))
5335 || TREE_CODE (TREE_TYPE (decl
)) == INTEGER_TYPE
)
5336 && !variably_modified_type_p (TREE_TYPE (decl
), NULL_TREE
))
5337 return !DECL_ASSEMBLER_NAME_SET_P (decl
);
5338 /* Only FUNCTION_DECLs and VAR_DECLs are considered. */
5339 if (TREE_CODE (decl
) != FUNCTION_DECL
5340 && TREE_CODE (decl
) != VAR_DECL
)
5343 /* If DECL already has its assembler name set, it does not need a
5345 if (!HAS_DECL_ASSEMBLER_NAME_P (decl
)
5346 || DECL_ASSEMBLER_NAME_SET_P (decl
))
5349 /* Abstract decls do not need an assembler name. */
5350 if (DECL_ABSTRACT_P (decl
))
5353 /* For VAR_DECLs, only static, public and external symbols need an
5355 if (TREE_CODE (decl
) == VAR_DECL
5356 && !TREE_STATIC (decl
)
5357 && !TREE_PUBLIC (decl
)
5358 && !DECL_EXTERNAL (decl
))
5361 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5363 /* Do not set assembler name on builtins. Allow RTL expansion to
5364 decide whether to expand inline or via a regular call. */
5365 if (DECL_BUILT_IN (decl
)
5366 && DECL_BUILT_IN_CLASS (decl
) != BUILT_IN_FRONTEND
)
5369 /* Functions represented in the callgraph need an assembler name. */
5370 if (cgraph_node::get (decl
) != NULL
)
5373 /* Unused and not public functions don't need an assembler name. */
5374 if (!TREE_USED (decl
) && !TREE_PUBLIC (decl
))
5382 /* Reset all language specific information still present in symbol
5386 free_lang_data_in_decl (tree decl
)
5388 gcc_assert (DECL_P (decl
));
5390 /* Give the FE a chance to remove its own data first. */
5391 lang_hooks
.free_lang_data (decl
);
5393 TREE_LANG_FLAG_0 (decl
) = 0;
5394 TREE_LANG_FLAG_1 (decl
) = 0;
5395 TREE_LANG_FLAG_2 (decl
) = 0;
5396 TREE_LANG_FLAG_3 (decl
) = 0;
5397 TREE_LANG_FLAG_4 (decl
) = 0;
5398 TREE_LANG_FLAG_5 (decl
) = 0;
5399 TREE_LANG_FLAG_6 (decl
) = 0;
5401 free_lang_data_in_one_sizepos (&DECL_SIZE (decl
));
5402 free_lang_data_in_one_sizepos (&DECL_SIZE_UNIT (decl
));
5403 if (TREE_CODE (decl
) == FIELD_DECL
)
5405 free_lang_data_in_one_sizepos (&DECL_FIELD_OFFSET (decl
));
5406 if (TREE_CODE (DECL_CONTEXT (decl
)) == QUAL_UNION_TYPE
)
5407 DECL_QUALIFIER (decl
) = NULL_TREE
;
5410 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5412 struct cgraph_node
*node
;
5413 if (!(node
= cgraph_node::get (decl
))
5414 || (!node
->definition
&& !node
->clones
))
5417 node
->release_body ();
5420 release_function_body (decl
);
5421 DECL_ARGUMENTS (decl
) = NULL
;
5422 DECL_RESULT (decl
) = NULL
;
5423 DECL_INITIAL (decl
) = error_mark_node
;
5426 if (gimple_has_body_p (decl
))
5430 /* If DECL has a gimple body, then the context for its
5431 arguments must be DECL. Otherwise, it doesn't really
5432 matter, as we will not be emitting any code for DECL. In
5433 general, there may be other instances of DECL created by
5434 the front end and since PARM_DECLs are generally shared,
5435 their DECL_CONTEXT changes as the replicas of DECL are
5436 created. The only time where DECL_CONTEXT is important
5437 is for the FUNCTION_DECLs that have a gimple body (since
5438 the PARM_DECL will be used in the function's body). */
5439 for (t
= DECL_ARGUMENTS (decl
); t
; t
= TREE_CHAIN (t
))
5440 DECL_CONTEXT (t
) = decl
;
5441 if (!DECL_FUNCTION_SPECIFIC_TARGET (decl
))
5442 DECL_FUNCTION_SPECIFIC_TARGET (decl
)
5443 = target_option_default_node
;
5444 if (!DECL_FUNCTION_SPECIFIC_OPTIMIZATION (decl
))
5445 DECL_FUNCTION_SPECIFIC_OPTIMIZATION (decl
)
5446 = optimization_default_node
;
5449 /* DECL_SAVED_TREE holds the GENERIC representation for DECL.
5450 At this point, it is not needed anymore. */
5451 DECL_SAVED_TREE (decl
) = NULL_TREE
;
5453 /* Clear the abstract origin if it refers to a method. Otherwise
5454 dwarf2out.c will ICE as we clear TYPE_METHODS and thus the
5455 origin will not be output correctly. */
5456 if (DECL_ABSTRACT_ORIGIN (decl
)
5457 && DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))
5458 && RECORD_OR_UNION_TYPE_P
5459 (DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))))
5460 DECL_ABSTRACT_ORIGIN (decl
) = NULL_TREE
;
5462 /* Sometimes the C++ frontend doesn't manage to transform a temporary
5463 DECL_VINDEX referring to itself into a vtable slot number as it
5464 should. Happens with functions that are copied and then forgotten
5465 about. Just clear it, it won't matter anymore. */
5466 if (DECL_VINDEX (decl
) && !tree_fits_shwi_p (DECL_VINDEX (decl
)))
5467 DECL_VINDEX (decl
) = NULL_TREE
;
5469 else if (TREE_CODE (decl
) == VAR_DECL
)
5471 if ((DECL_EXTERNAL (decl
)
5472 && (!TREE_STATIC (decl
) || !TREE_READONLY (decl
)))
5473 || (decl_function_context (decl
) && !TREE_STATIC (decl
)))
5474 DECL_INITIAL (decl
) = NULL_TREE
;
5476 else if (TREE_CODE (decl
) == TYPE_DECL
)
5478 DECL_VISIBILITY (decl
) = VISIBILITY_DEFAULT
;
5479 DECL_VISIBILITY_SPECIFIED (decl
) = 0;
5480 DECL_INITIAL (decl
) = NULL_TREE
;
5482 else if (TREE_CODE (decl
) == FIELD_DECL
)
5483 DECL_INITIAL (decl
) = NULL_TREE
;
5484 else if (TREE_CODE (decl
) == TRANSLATION_UNIT_DECL
5485 && DECL_INITIAL (decl
)
5486 && TREE_CODE (DECL_INITIAL (decl
)) == BLOCK
)
5488 /* Strip builtins from the translation-unit BLOCK. We still have targets
5489 without builtin_decl_explicit support and also builtins are shared
5490 nodes and thus we can't use TREE_CHAIN in multiple lists. */
5491 tree
*nextp
= &BLOCK_VARS (DECL_INITIAL (decl
));
5495 if (TREE_CODE (var
) == FUNCTION_DECL
5496 && DECL_BUILT_IN (var
))
5497 *nextp
= TREE_CHAIN (var
);
5499 nextp
= &TREE_CHAIN (var
);
5505 /* Data used when collecting DECLs and TYPEs for language data removal. */
5507 struct free_lang_data_d
5509 /* Worklist to avoid excessive recursion. */
5512 /* Set of traversed objects. Used to avoid duplicate visits. */
5513 hash_set
<tree
> *pset
;
5515 /* Array of symbols to process with free_lang_data_in_decl. */
5518 /* Array of types to process with free_lang_data_in_type. */
5523 /* Save all language fields needed to generate proper debug information
5524 for DECL. This saves most fields cleared out by free_lang_data_in_decl. */
5527 save_debug_info_for_decl (tree t
)
5529 /*struct saved_debug_info_d *sdi;*/
5531 gcc_assert (debug_info_level
> DINFO_LEVEL_TERSE
&& t
&& DECL_P (t
));
5533 /* FIXME. Partial implementation for saving debug info removed. */
5537 /* Save all language fields needed to generate proper debug information
5538 for TYPE. This saves most fields cleared out by free_lang_data_in_type. */
5541 save_debug_info_for_type (tree t
)
5543 /*struct saved_debug_info_d *sdi;*/
5545 gcc_assert (debug_info_level
> DINFO_LEVEL_TERSE
&& t
&& TYPE_P (t
));
5547 /* FIXME. Partial implementation for saving debug info removed. */
5551 /* Add type or decl T to one of the list of tree nodes that need their
5552 language data removed. The lists are held inside FLD. */
5555 add_tree_to_fld_list (tree t
, struct free_lang_data_d
*fld
)
5559 fld
->decls
.safe_push (t
);
5560 if (debug_info_level
> DINFO_LEVEL_TERSE
)
5561 save_debug_info_for_decl (t
);
5563 else if (TYPE_P (t
))
5565 fld
->types
.safe_push (t
);
5566 if (debug_info_level
> DINFO_LEVEL_TERSE
)
5567 save_debug_info_for_type (t
);
5573 /* Push tree node T into FLD->WORKLIST. */
5576 fld_worklist_push (tree t
, struct free_lang_data_d
*fld
)
5578 if (t
&& !is_lang_specific (t
) && !fld
->pset
->contains (t
))
5579 fld
->worklist
.safe_push ((t
));
5583 /* Operand callback helper for free_lang_data_in_node. *TP is the
5584 subtree operand being considered. */
5587 find_decls_types_r (tree
*tp
, int *ws
, void *data
)
5590 struct free_lang_data_d
*fld
= (struct free_lang_data_d
*) data
;
5592 if (TREE_CODE (t
) == TREE_LIST
)
5595 /* Language specific nodes will be removed, so there is no need
5596 to gather anything under them. */
5597 if (is_lang_specific (t
))
5605 /* Note that walk_tree does not traverse every possible field in
5606 decls, so we have to do our own traversals here. */
5607 add_tree_to_fld_list (t
, fld
);
5609 fld_worklist_push (DECL_NAME (t
), fld
);
5610 fld_worklist_push (DECL_CONTEXT (t
), fld
);
5611 fld_worklist_push (DECL_SIZE (t
), fld
);
5612 fld_worklist_push (DECL_SIZE_UNIT (t
), fld
);
5614 /* We are going to remove everything under DECL_INITIAL for
5615 TYPE_DECLs. No point walking them. */
5616 if (TREE_CODE (t
) != TYPE_DECL
)
5617 fld_worklist_push (DECL_INITIAL (t
), fld
);
5619 fld_worklist_push (DECL_ATTRIBUTES (t
), fld
);
5620 fld_worklist_push (DECL_ABSTRACT_ORIGIN (t
), fld
);
5622 if (TREE_CODE (t
) == FUNCTION_DECL
)
5624 fld_worklist_push (DECL_ARGUMENTS (t
), fld
);
5625 fld_worklist_push (DECL_RESULT (t
), fld
);
5627 else if (TREE_CODE (t
) == TYPE_DECL
)
5629 fld_worklist_push (DECL_ORIGINAL_TYPE (t
), fld
);
5631 else if (TREE_CODE (t
) == FIELD_DECL
)
5633 fld_worklist_push (DECL_FIELD_OFFSET (t
), fld
);
5634 fld_worklist_push (DECL_BIT_FIELD_TYPE (t
), fld
);
5635 fld_worklist_push (DECL_FIELD_BIT_OFFSET (t
), fld
);
5636 fld_worklist_push (DECL_FCONTEXT (t
), fld
);
5639 if ((TREE_CODE (t
) == VAR_DECL
|| TREE_CODE (t
) == PARM_DECL
)
5640 && DECL_HAS_VALUE_EXPR_P (t
))
5641 fld_worklist_push (DECL_VALUE_EXPR (t
), fld
);
5643 if (TREE_CODE (t
) != FIELD_DECL
5644 && TREE_CODE (t
) != TYPE_DECL
)
5645 fld_worklist_push (TREE_CHAIN (t
), fld
);
5648 else if (TYPE_P (t
))
5650 /* Note that walk_tree does not traverse every possible field in
5651 types, so we have to do our own traversals here. */
5652 add_tree_to_fld_list (t
, fld
);
5654 if (!RECORD_OR_UNION_TYPE_P (t
))
5655 fld_worklist_push (TYPE_CACHED_VALUES (t
), fld
);
5656 fld_worklist_push (TYPE_SIZE (t
), fld
);
5657 fld_worklist_push (TYPE_SIZE_UNIT (t
), fld
);
5658 fld_worklist_push (TYPE_ATTRIBUTES (t
), fld
);
5659 fld_worklist_push (TYPE_POINTER_TO (t
), fld
);
5660 fld_worklist_push (TYPE_REFERENCE_TO (t
), fld
);
5661 fld_worklist_push (TYPE_NAME (t
), fld
);
5662 /* Do not walk TYPE_NEXT_PTR_TO or TYPE_NEXT_REF_TO. We do not stream
5663 them and thus do not and want not to reach unused pointer types
5665 if (!POINTER_TYPE_P (t
))
5666 fld_worklist_push (TYPE_MINVAL (t
), fld
);
5667 if (!RECORD_OR_UNION_TYPE_P (t
))
5668 fld_worklist_push (TYPE_MAXVAL (t
), fld
);
5669 fld_worklist_push (TYPE_MAIN_VARIANT (t
), fld
);
5670 /* Do not walk TYPE_NEXT_VARIANT. We do not stream it and thus
5671 do not and want not to reach unused variants this way. */
5672 if (TYPE_CONTEXT (t
))
5674 tree ctx
= TYPE_CONTEXT (t
);
5675 /* We adjust BLOCK TYPE_CONTEXTs to the innermost non-BLOCK one.
5676 So push that instead. */
5677 while (ctx
&& TREE_CODE (ctx
) == BLOCK
)
5678 ctx
= BLOCK_SUPERCONTEXT (ctx
);
5679 fld_worklist_push (ctx
, fld
);
5681 /* Do not walk TYPE_CANONICAL. We do not stream it and thus do not
5682 and want not to reach unused types this way. */
5684 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_BINFO (t
))
5688 FOR_EACH_VEC_ELT (*BINFO_BASE_BINFOS (TYPE_BINFO (t
)), i
, tem
)
5689 fld_worklist_push (TREE_TYPE (tem
), fld
);
5690 tem
= BINFO_VIRTUALS (TYPE_BINFO (t
));
5692 /* The Java FE overloads BINFO_VIRTUALS for its own purpose. */
5693 && TREE_CODE (tem
) == TREE_LIST
)
5696 fld_worklist_push (TREE_VALUE (tem
), fld
);
5697 tem
= TREE_CHAIN (tem
);
5701 if (RECORD_OR_UNION_TYPE_P (t
))
5704 /* Push all TYPE_FIELDS - there can be interleaving interesting
5705 and non-interesting things. */
5706 tem
= TYPE_FIELDS (t
);
5709 if (TREE_CODE (tem
) == FIELD_DECL
5710 || (TREE_CODE (tem
) == TYPE_DECL
5711 && !DECL_IGNORED_P (tem
)
5712 && debug_info_level
> DINFO_LEVEL_TERSE
5713 && !is_redundant_typedef (tem
)))
5714 fld_worklist_push (tem
, fld
);
5715 tem
= TREE_CHAIN (tem
);
5719 fld_worklist_push (TYPE_STUB_DECL (t
), fld
);
5722 else if (TREE_CODE (t
) == BLOCK
)
5725 for (tem
= BLOCK_VARS (t
); tem
; tem
= TREE_CHAIN (tem
))
5726 fld_worklist_push (tem
, fld
);
5727 for (tem
= BLOCK_SUBBLOCKS (t
); tem
; tem
= BLOCK_CHAIN (tem
))
5728 fld_worklist_push (tem
, fld
);
5729 fld_worklist_push (BLOCK_ABSTRACT_ORIGIN (t
), fld
);
5732 if (TREE_CODE (t
) != IDENTIFIER_NODE
5733 && CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_TYPED
))
5734 fld_worklist_push (TREE_TYPE (t
), fld
);
5740 /* Find decls and types in T. */
5743 find_decls_types (tree t
, struct free_lang_data_d
*fld
)
5747 if (!fld
->pset
->contains (t
))
5748 walk_tree (&t
, find_decls_types_r
, fld
, fld
->pset
);
5749 if (fld
->worklist
.is_empty ())
5751 t
= fld
->worklist
.pop ();
5755 /* Translate all the types in LIST with the corresponding runtime
5759 get_eh_types_for_runtime (tree list
)
5763 if (list
== NULL_TREE
)
5766 head
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
5768 list
= TREE_CHAIN (list
);
5771 tree n
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
5772 TREE_CHAIN (prev
) = n
;
5773 prev
= TREE_CHAIN (prev
);
5774 list
= TREE_CHAIN (list
);
5781 /* Find decls and types referenced in EH region R and store them in
5782 FLD->DECLS and FLD->TYPES. */
5785 find_decls_types_in_eh_region (eh_region r
, struct free_lang_data_d
*fld
)
5796 /* The types referenced in each catch must first be changed to the
5797 EH types used at runtime. This removes references to FE types
5799 for (c
= r
->u
.eh_try
.first_catch
; c
; c
= c
->next_catch
)
5801 c
->type_list
= get_eh_types_for_runtime (c
->type_list
);
5802 walk_tree (&c
->type_list
, find_decls_types_r
, fld
, fld
->pset
);
5807 case ERT_ALLOWED_EXCEPTIONS
:
5808 r
->u
.allowed
.type_list
5809 = get_eh_types_for_runtime (r
->u
.allowed
.type_list
);
5810 walk_tree (&r
->u
.allowed
.type_list
, find_decls_types_r
, fld
, fld
->pset
);
5813 case ERT_MUST_NOT_THROW
:
5814 walk_tree (&r
->u
.must_not_throw
.failure_decl
,
5815 find_decls_types_r
, fld
, fld
->pset
);
5821 /* Find decls and types referenced in cgraph node N and store them in
5822 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
5823 look for *every* kind of DECL and TYPE node reachable from N,
5824 including those embedded inside types and decls (i.e,, TYPE_DECLs,
5825 NAMESPACE_DECLs, etc). */
5828 find_decls_types_in_node (struct cgraph_node
*n
, struct free_lang_data_d
*fld
)
5831 struct function
*fn
;
5835 find_decls_types (n
->decl
, fld
);
5837 if (!gimple_has_body_p (n
->decl
))
5840 gcc_assert (current_function_decl
== NULL_TREE
&& cfun
== NULL
);
5842 fn
= DECL_STRUCT_FUNCTION (n
->decl
);
5844 /* Traverse locals. */
5845 FOR_EACH_LOCAL_DECL (fn
, ix
, t
)
5846 find_decls_types (t
, fld
);
5848 /* Traverse EH regions in FN. */
5851 FOR_ALL_EH_REGION_FN (r
, fn
)
5852 find_decls_types_in_eh_region (r
, fld
);
5855 /* Traverse every statement in FN. */
5856 FOR_EACH_BB_FN (bb
, fn
)
5859 gimple_stmt_iterator si
;
5862 for (psi
= gsi_start_phis (bb
); !gsi_end_p (psi
); gsi_next (&psi
))
5864 gphi
*phi
= psi
.phi ();
5866 for (i
= 0; i
< gimple_phi_num_args (phi
); i
++)
5868 tree
*arg_p
= gimple_phi_arg_def_ptr (phi
, i
);
5869 find_decls_types (*arg_p
, fld
);
5873 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
5875 gimple
*stmt
= gsi_stmt (si
);
5877 if (is_gimple_call (stmt
))
5878 find_decls_types (gimple_call_fntype (stmt
), fld
);
5880 for (i
= 0; i
< gimple_num_ops (stmt
); i
++)
5882 tree arg
= gimple_op (stmt
, i
);
5883 find_decls_types (arg
, fld
);
5890 /* Find decls and types referenced in varpool node N and store them in
5891 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
5892 look for *every* kind of DECL and TYPE node reachable from N,
5893 including those embedded inside types and decls (i.e,, TYPE_DECLs,
5894 NAMESPACE_DECLs, etc). */
5897 find_decls_types_in_var (varpool_node
*v
, struct free_lang_data_d
*fld
)
5899 find_decls_types (v
->decl
, fld
);
5902 /* If T needs an assembler name, have one created for it. */
5905 assign_assembler_name_if_neeeded (tree t
)
5907 if (need_assembler_name_p (t
))
5909 /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit
5910 diagnostics that use input_location to show locus
5911 information. The problem here is that, at this point,
5912 input_location is generally anchored to the end of the file
5913 (since the parser is long gone), so we don't have a good
5914 position to pin it to.
5916 To alleviate this problem, this uses the location of T's
5917 declaration. Examples of this are
5918 testsuite/g++.dg/template/cond2.C and
5919 testsuite/g++.dg/template/pr35240.C. */
5920 location_t saved_location
= input_location
;
5921 input_location
= DECL_SOURCE_LOCATION (t
);
5923 decl_assembler_name (t
);
5925 input_location
= saved_location
;
5930 /* Free language specific information for every operand and expression
5931 in every node of the call graph. This process operates in three stages:
5933 1- Every callgraph node and varpool node is traversed looking for
5934 decls and types embedded in them. This is a more exhaustive
5935 search than that done by find_referenced_vars, because it will
5936 also collect individual fields, decls embedded in types, etc.
5938 2- All the decls found are sent to free_lang_data_in_decl.
5940 3- All the types found are sent to free_lang_data_in_type.
5942 The ordering between decls and types is important because
5943 free_lang_data_in_decl sets assembler names, which includes
5944 mangling. So types cannot be freed up until assembler names have
5948 free_lang_data_in_cgraph (void)
5950 struct cgraph_node
*n
;
5952 struct free_lang_data_d fld
;
5957 /* Initialize sets and arrays to store referenced decls and types. */
5958 fld
.pset
= new hash_set
<tree
>;
5959 fld
.worklist
.create (0);
5960 fld
.decls
.create (100);
5961 fld
.types
.create (100);
5963 /* Find decls and types in the body of every function in the callgraph. */
5964 FOR_EACH_FUNCTION (n
)
5965 find_decls_types_in_node (n
, &fld
);
5967 FOR_EACH_VEC_SAFE_ELT (alias_pairs
, i
, p
)
5968 find_decls_types (p
->decl
, &fld
);
5970 /* Find decls and types in every varpool symbol. */
5971 FOR_EACH_VARIABLE (v
)
5972 find_decls_types_in_var (v
, &fld
);
5974 /* Set the assembler name on every decl found. We need to do this
5975 now because free_lang_data_in_decl will invalidate data needed
5976 for mangling. This breaks mangling on interdependent decls. */
5977 FOR_EACH_VEC_ELT (fld
.decls
, i
, t
)
5978 assign_assembler_name_if_neeeded (t
);
5980 /* Traverse every decl found freeing its language data. */
5981 FOR_EACH_VEC_ELT (fld
.decls
, i
, t
)
5982 free_lang_data_in_decl (t
);
5984 /* Traverse every type found freeing its language data. */
5985 FOR_EACH_VEC_ELT (fld
.types
, i
, t
)
5986 free_lang_data_in_type (t
);
5989 FOR_EACH_VEC_ELT (fld
.types
, i
, t
)
5994 fld
.worklist
.release ();
5995 fld
.decls
.release ();
5996 fld
.types
.release ();
6000 /* Free resources that are used by FE but are not needed once they are done. */
6003 free_lang_data (void)
6007 /* If we are the LTO frontend we have freed lang-specific data already. */
6009 || (!flag_generate_lto
&& !flag_generate_offload
))
6012 /* Allocate and assign alias sets to the standard integer types
6013 while the slots are still in the way the frontends generated them. */
6014 for (i
= 0; i
< itk_none
; ++i
)
6015 if (integer_types
[i
])
6016 TYPE_ALIAS_SET (integer_types
[i
]) = get_alias_set (integer_types
[i
]);
6018 /* Traverse the IL resetting language specific information for
6019 operands, expressions, etc. */
6020 free_lang_data_in_cgraph ();
6022 /* Create gimple variants for common types. */
6023 ptrdiff_type_node
= integer_type_node
;
6024 fileptr_type_node
= ptr_type_node
;
6026 /* Reset some langhooks. Do not reset types_compatible_p, it may
6027 still be used indirectly via the get_alias_set langhook. */
6028 lang_hooks
.dwarf_name
= lhd_dwarf_name
;
6029 lang_hooks
.decl_printable_name
= gimple_decl_printable_name
;
6030 lang_hooks
.gimplify_expr
= lhd_gimplify_expr
;
6032 /* We do not want the default decl_assembler_name implementation,
6033 rather if we have fixed everything we want a wrapper around it
6034 asserting that all non-local symbols already got their assembler
6035 name and only produce assembler names for local symbols. Or rather
6036 make sure we never call decl_assembler_name on local symbols and
6037 devise a separate, middle-end private scheme for it. */
6039 /* Reset diagnostic machinery. */
6040 tree_diagnostics_defaults (global_dc
);
6048 const pass_data pass_data_ipa_free_lang_data
=
6050 SIMPLE_IPA_PASS
, /* type */
6051 "*free_lang_data", /* name */
6052 OPTGROUP_NONE
, /* optinfo_flags */
6053 TV_IPA_FREE_LANG_DATA
, /* tv_id */
6054 0, /* properties_required */
6055 0, /* properties_provided */
6056 0, /* properties_destroyed */
6057 0, /* todo_flags_start */
6058 0, /* todo_flags_finish */
6061 class pass_ipa_free_lang_data
: public simple_ipa_opt_pass
6064 pass_ipa_free_lang_data (gcc::context
*ctxt
)
6065 : simple_ipa_opt_pass (pass_data_ipa_free_lang_data
, ctxt
)
6068 /* opt_pass methods: */
6069 virtual unsigned int execute (function
*) { return free_lang_data (); }
6071 }; // class pass_ipa_free_lang_data
6075 simple_ipa_opt_pass
*
6076 make_pass_ipa_free_lang_data (gcc::context
*ctxt
)
6078 return new pass_ipa_free_lang_data (ctxt
);
6081 /* The backbone of is_attribute_p(). ATTR_LEN is the string length of
6082 ATTR_NAME. Also used internally by remove_attribute(). */
6084 private_is_attribute_p (const char *attr_name
, size_t attr_len
, const_tree ident
)
6086 size_t ident_len
= IDENTIFIER_LENGTH (ident
);
6088 if (ident_len
== attr_len
)
6090 if (strcmp (attr_name
, IDENTIFIER_POINTER (ident
)) == 0)
6093 else if (ident_len
== attr_len
+ 4)
6095 /* There is the possibility that ATTR is 'text' and IDENT is
6097 const char *p
= IDENTIFIER_POINTER (ident
);
6098 if (p
[0] == '_' && p
[1] == '_'
6099 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
6100 && strncmp (attr_name
, p
+ 2, attr_len
) == 0)
6107 /* The backbone of lookup_attribute(). ATTR_LEN is the string length
6108 of ATTR_NAME, and LIST is not NULL_TREE. */
6110 private_lookup_attribute (const char *attr_name
, size_t attr_len
, tree list
)
6114 size_t ident_len
= IDENTIFIER_LENGTH (get_attribute_name (list
));
6116 if (ident_len
== attr_len
)
6118 if (!strcmp (attr_name
,
6119 IDENTIFIER_POINTER (get_attribute_name (list
))))
6122 /* TODO: If we made sure that attributes were stored in the
6123 canonical form without '__...__' (ie, as in 'text' as opposed
6124 to '__text__') then we could avoid the following case. */
6125 else if (ident_len
== attr_len
+ 4)
6127 const char *p
= IDENTIFIER_POINTER (get_attribute_name (list
));
6128 if (p
[0] == '_' && p
[1] == '_'
6129 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
6130 && strncmp (attr_name
, p
+ 2, attr_len
) == 0)
6133 list
= TREE_CHAIN (list
);
6139 /* Given an attribute name ATTR_NAME and a list of attributes LIST,
6140 return a pointer to the attribute's list first element if the attribute
6141 starts with ATTR_NAME. ATTR_NAME must be in the form 'text' (not
6145 private_lookup_attribute_by_prefix (const char *attr_name
, size_t attr_len
,
6150 size_t ident_len
= IDENTIFIER_LENGTH (get_attribute_name (list
));
6152 if (attr_len
> ident_len
)
6154 list
= TREE_CHAIN (list
);
6158 const char *p
= IDENTIFIER_POINTER (get_attribute_name (list
));
6160 if (strncmp (attr_name
, p
, attr_len
) == 0)
6163 /* TODO: If we made sure that attributes were stored in the
6164 canonical form without '__...__' (ie, as in 'text' as opposed
6165 to '__text__') then we could avoid the following case. */
6166 if (p
[0] == '_' && p
[1] == '_' &&
6167 strncmp (attr_name
, p
+ 2, attr_len
) == 0)
6170 list
= TREE_CHAIN (list
);
6177 /* A variant of lookup_attribute() that can be used with an identifier
6178 as the first argument, and where the identifier can be either
6179 'text' or '__text__'.
6181 Given an attribute ATTR_IDENTIFIER, and a list of attributes LIST,
6182 return a pointer to the attribute's list element if the attribute
6183 is part of the list, or NULL_TREE if not found. If the attribute
6184 appears more than once, this only returns the first occurrence; the
6185 TREE_CHAIN of the return value should be passed back in if further
6186 occurrences are wanted. ATTR_IDENTIFIER must be an identifier but
6187 can be in the form 'text' or '__text__'. */
6189 lookup_ident_attribute (tree attr_identifier
, tree list
)
6191 gcc_checking_assert (TREE_CODE (attr_identifier
) == IDENTIFIER_NODE
);
6195 gcc_checking_assert (TREE_CODE (get_attribute_name (list
))
6196 == IDENTIFIER_NODE
);
6198 if (cmp_attrib_identifiers (attr_identifier
,
6199 get_attribute_name (list
)))
6202 list
= TREE_CHAIN (list
);
6208 /* Remove any instances of attribute ATTR_NAME in LIST and return the
6212 remove_attribute (const char *attr_name
, tree list
)
6215 size_t attr_len
= strlen (attr_name
);
6217 gcc_checking_assert (attr_name
[0] != '_');
6219 for (p
= &list
; *p
; )
6222 /* TODO: If we were storing attributes in normalized form, here
6223 we could use a simple strcmp(). */
6224 if (private_is_attribute_p (attr_name
, attr_len
, get_attribute_name (l
)))
6225 *p
= TREE_CHAIN (l
);
6227 p
= &TREE_CHAIN (l
);
6233 /* Return an attribute list that is the union of a1 and a2. */
6236 merge_attributes (tree a1
, tree a2
)
6240 /* Either one unset? Take the set one. */
6242 if ((attributes
= a1
) == 0)
6245 /* One that completely contains the other? Take it. */
6247 else if (a2
!= 0 && ! attribute_list_contained (a1
, a2
))
6249 if (attribute_list_contained (a2
, a1
))
6253 /* Pick the longest list, and hang on the other list. */
6255 if (list_length (a1
) < list_length (a2
))
6256 attributes
= a2
, a2
= a1
;
6258 for (; a2
!= 0; a2
= TREE_CHAIN (a2
))
6261 for (a
= lookup_ident_attribute (get_attribute_name (a2
),
6263 a
!= NULL_TREE
&& !attribute_value_equal (a
, a2
);
6264 a
= lookup_ident_attribute (get_attribute_name (a2
),
6269 a1
= copy_node (a2
);
6270 TREE_CHAIN (a1
) = attributes
;
6279 /* Given types T1 and T2, merge their attributes and return
6283 merge_type_attributes (tree t1
, tree t2
)
6285 return merge_attributes (TYPE_ATTRIBUTES (t1
),
6286 TYPE_ATTRIBUTES (t2
));
6289 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
6293 merge_decl_attributes (tree olddecl
, tree newdecl
)
6295 return merge_attributes (DECL_ATTRIBUTES (olddecl
),
6296 DECL_ATTRIBUTES (newdecl
));
6299 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
6301 /* Specialization of merge_decl_attributes for various Windows targets.
6303 This handles the following situation:
6305 __declspec (dllimport) int foo;
6308 The second instance of `foo' nullifies the dllimport. */
6311 merge_dllimport_decl_attributes (tree old
, tree new_tree
)
6314 int delete_dllimport_p
= 1;
6316 /* What we need to do here is remove from `old' dllimport if it doesn't
6317 appear in `new'. dllimport behaves like extern: if a declaration is
6318 marked dllimport and a definition appears later, then the object
6319 is not dllimport'd. We also remove a `new' dllimport if the old list
6320 contains dllexport: dllexport always overrides dllimport, regardless
6321 of the order of declaration. */
6322 if (!VAR_OR_FUNCTION_DECL_P (new_tree
))
6323 delete_dllimport_p
= 0;
6324 else if (DECL_DLLIMPORT_P (new_tree
)
6325 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (old
)))
6327 DECL_DLLIMPORT_P (new_tree
) = 0;
6328 warning (OPT_Wattributes
, "%q+D already declared with dllexport attribute: "
6329 "dllimport ignored", new_tree
);
6331 else if (DECL_DLLIMPORT_P (old
) && !DECL_DLLIMPORT_P (new_tree
))
6333 /* Warn about overriding a symbol that has already been used, e.g.:
6334 extern int __attribute__ ((dllimport)) foo;
6335 int* bar () {return &foo;}
6338 if (TREE_USED (old
))
6340 warning (0, "%q+D redeclared without dllimport attribute "
6341 "after being referenced with dll linkage", new_tree
);
6342 /* If we have used a variable's address with dllimport linkage,
6343 keep the old DECL_DLLIMPORT_P flag: the ADDR_EXPR using the
6344 decl may already have had TREE_CONSTANT computed.
6345 We still remove the attribute so that assembler code refers
6346 to '&foo rather than '_imp__foo'. */
6347 if (TREE_CODE (old
) == VAR_DECL
&& TREE_ADDRESSABLE (old
))
6348 DECL_DLLIMPORT_P (new_tree
) = 1;
6351 /* Let an inline definition silently override the external reference,
6352 but otherwise warn about attribute inconsistency. */
6353 else if (TREE_CODE (new_tree
) == VAR_DECL
6354 || !DECL_DECLARED_INLINE_P (new_tree
))
6355 warning (OPT_Wattributes
, "%q+D redeclared without dllimport attribute: "
6356 "previous dllimport ignored", new_tree
);
6359 delete_dllimport_p
= 0;
6361 a
= merge_attributes (DECL_ATTRIBUTES (old
), DECL_ATTRIBUTES (new_tree
));
6363 if (delete_dllimport_p
)
6364 a
= remove_attribute ("dllimport", a
);
6369 /* Handle a "dllimport" or "dllexport" attribute; arguments as in
6370 struct attribute_spec.handler. */
6373 handle_dll_attribute (tree
* pnode
, tree name
, tree args
, int flags
,
6379 /* These attributes may apply to structure and union types being created,
6380 but otherwise should pass to the declaration involved. */
6383 if (flags
& ((int) ATTR_FLAG_DECL_NEXT
| (int) ATTR_FLAG_FUNCTION_NEXT
6384 | (int) ATTR_FLAG_ARRAY_NEXT
))
6386 *no_add_attrs
= true;
6387 return tree_cons (name
, args
, NULL_TREE
);
6389 if (TREE_CODE (node
) == RECORD_TYPE
6390 || TREE_CODE (node
) == UNION_TYPE
)
6392 node
= TYPE_NAME (node
);
6398 warning (OPT_Wattributes
, "%qE attribute ignored",
6400 *no_add_attrs
= true;
6405 if (TREE_CODE (node
) != FUNCTION_DECL
6406 && TREE_CODE (node
) != VAR_DECL
6407 && TREE_CODE (node
) != TYPE_DECL
)
6409 *no_add_attrs
= true;
6410 warning (OPT_Wattributes
, "%qE attribute ignored",
6415 if (TREE_CODE (node
) == TYPE_DECL
6416 && TREE_CODE (TREE_TYPE (node
)) != RECORD_TYPE
6417 && TREE_CODE (TREE_TYPE (node
)) != UNION_TYPE
)
6419 *no_add_attrs
= true;
6420 warning (OPT_Wattributes
, "%qE attribute ignored",
6425 is_dllimport
= is_attribute_p ("dllimport", name
);
6427 /* Report error on dllimport ambiguities seen now before they cause
6431 /* Honor any target-specific overrides. */
6432 if (!targetm
.valid_dllimport_attribute_p (node
))
6433 *no_add_attrs
= true;
6435 else if (TREE_CODE (node
) == FUNCTION_DECL
6436 && DECL_DECLARED_INLINE_P (node
))
6438 warning (OPT_Wattributes
, "inline function %q+D declared as "
6439 " dllimport: attribute ignored", node
);
6440 *no_add_attrs
= true;
6442 /* Like MS, treat definition of dllimported variables and
6443 non-inlined functions on declaration as syntax errors. */
6444 else if (TREE_CODE (node
) == FUNCTION_DECL
&& DECL_INITIAL (node
))
6446 error ("function %q+D definition is marked dllimport", node
);
6447 *no_add_attrs
= true;
6450 else if (TREE_CODE (node
) == VAR_DECL
)
6452 if (DECL_INITIAL (node
))
6454 error ("variable %q+D definition is marked dllimport",
6456 *no_add_attrs
= true;
6459 /* `extern' needn't be specified with dllimport.
6460 Specify `extern' now and hope for the best. Sigh. */
6461 DECL_EXTERNAL (node
) = 1;
6462 /* Also, implicitly give dllimport'd variables declared within
6463 a function global scope, unless declared static. */
6464 if (current_function_decl
!= NULL_TREE
&& !TREE_STATIC (node
))
6465 TREE_PUBLIC (node
) = 1;
6468 if (*no_add_attrs
== false)
6469 DECL_DLLIMPORT_P (node
) = 1;
6471 else if (TREE_CODE (node
) == FUNCTION_DECL
6472 && DECL_DECLARED_INLINE_P (node
)
6473 && flag_keep_inline_dllexport
)
6474 /* An exported function, even if inline, must be emitted. */
6475 DECL_EXTERNAL (node
) = 0;
6477 /* Report error if symbol is not accessible at global scope. */
6478 if (!TREE_PUBLIC (node
)
6479 && (TREE_CODE (node
) == VAR_DECL
6480 || TREE_CODE (node
) == FUNCTION_DECL
))
6482 error ("external linkage required for symbol %q+D because of "
6483 "%qE attribute", node
, name
);
6484 *no_add_attrs
= true;
6487 /* A dllexport'd entity must have default visibility so that other
6488 program units (shared libraries or the main executable) can see
6489 it. A dllimport'd entity must have default visibility so that
6490 the linker knows that undefined references within this program
6491 unit can be resolved by the dynamic linker. */
6494 if (DECL_VISIBILITY_SPECIFIED (node
)
6495 && DECL_VISIBILITY (node
) != VISIBILITY_DEFAULT
)
6496 error ("%qE implies default visibility, but %qD has already "
6497 "been declared with a different visibility",
6499 DECL_VISIBILITY (node
) = VISIBILITY_DEFAULT
;
6500 DECL_VISIBILITY_SPECIFIED (node
) = 1;
6506 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
6508 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
6509 of the various TYPE_QUAL values. */
6512 set_type_quals (tree type
, int type_quals
)
6514 TYPE_READONLY (type
) = (type_quals
& TYPE_QUAL_CONST
) != 0;
6515 TYPE_VOLATILE (type
) = (type_quals
& TYPE_QUAL_VOLATILE
) != 0;
6516 TYPE_RESTRICT (type
) = (type_quals
& TYPE_QUAL_RESTRICT
) != 0;
6517 TYPE_ATOMIC (type
) = (type_quals
& TYPE_QUAL_ATOMIC
) != 0;
6518 TYPE_ADDR_SPACE (type
) = DECODE_QUAL_ADDR_SPACE (type_quals
);
6521 /* Returns true iff unqualified CAND and BASE are equivalent. */
6524 check_base_type (const_tree cand
, const_tree base
)
6526 return (TYPE_NAME (cand
) == TYPE_NAME (base
)
6527 /* Apparently this is needed for Objective-C. */
6528 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
6529 /* Check alignment. */
6530 && TYPE_ALIGN (cand
) == TYPE_ALIGN (base
)
6531 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
6532 TYPE_ATTRIBUTES (base
)));
6535 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
6538 check_qualified_type (const_tree cand
, const_tree base
, int type_quals
)
6540 return (TYPE_QUALS (cand
) == type_quals
6541 && check_base_type (cand
, base
));
6544 /* Returns true iff CAND is equivalent to BASE with ALIGN. */
6547 check_aligned_type (const_tree cand
, const_tree base
, unsigned int align
)
6549 return (TYPE_QUALS (cand
) == TYPE_QUALS (base
)
6550 && TYPE_NAME (cand
) == TYPE_NAME (base
)
6551 /* Apparently this is needed for Objective-C. */
6552 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
6553 /* Check alignment. */
6554 && TYPE_ALIGN (cand
) == align
6555 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
6556 TYPE_ATTRIBUTES (base
)));
6559 /* This function checks to see if TYPE matches the size one of the built-in
6560 atomic types, and returns that core atomic type. */
6563 find_atomic_core_type (tree type
)
6565 tree base_atomic_type
;
6567 /* Only handle complete types. */
6568 if (TYPE_SIZE (type
) == NULL_TREE
)
6571 HOST_WIDE_INT type_size
= tree_to_uhwi (TYPE_SIZE (type
));
6575 base_atomic_type
= atomicQI_type_node
;
6579 base_atomic_type
= atomicHI_type_node
;
6583 base_atomic_type
= atomicSI_type_node
;
6587 base_atomic_type
= atomicDI_type_node
;
6591 base_atomic_type
= atomicTI_type_node
;
6595 base_atomic_type
= NULL_TREE
;
6598 return base_atomic_type
;
6601 /* Return a version of the TYPE, qualified as indicated by the
6602 TYPE_QUALS, if one exists. If no qualified version exists yet,
6603 return NULL_TREE. */
6606 get_qualified_type (tree type
, int type_quals
)
6610 if (TYPE_QUALS (type
) == type_quals
)
6613 /* Search the chain of variants to see if there is already one there just
6614 like the one we need to have. If so, use that existing one. We must
6615 preserve the TYPE_NAME, since there is code that depends on this. */
6616 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
6617 if (check_qualified_type (t
, type
, type_quals
))
6623 /* Like get_qualified_type, but creates the type if it does not
6624 exist. This function never returns NULL_TREE. */
6627 build_qualified_type (tree type
, int type_quals
)
6631 /* See if we already have the appropriate qualified variant. */
6632 t
= get_qualified_type (type
, type_quals
);
6634 /* If not, build it. */
6637 t
= build_variant_type_copy (type
);
6638 set_type_quals (t
, type_quals
);
6640 if (((type_quals
& TYPE_QUAL_ATOMIC
) == TYPE_QUAL_ATOMIC
))
6642 /* See if this object can map to a basic atomic type. */
6643 tree atomic_type
= find_atomic_core_type (type
);
6646 /* Ensure the alignment of this type is compatible with
6647 the required alignment of the atomic type. */
6648 if (TYPE_ALIGN (atomic_type
) > TYPE_ALIGN (t
))
6649 SET_TYPE_ALIGN (t
, TYPE_ALIGN (atomic_type
));
6653 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
6654 /* Propagate structural equality. */
6655 SET_TYPE_STRUCTURAL_EQUALITY (t
);
6656 else if (TYPE_CANONICAL (type
) != type
)
6657 /* Build the underlying canonical type, since it is different
6660 tree c
= build_qualified_type (TYPE_CANONICAL (type
), type_quals
);
6661 TYPE_CANONICAL (t
) = TYPE_CANONICAL (c
);
6664 /* T is its own canonical type. */
6665 TYPE_CANONICAL (t
) = t
;
6672 /* Create a variant of type T with alignment ALIGN. */
6675 build_aligned_type (tree type
, unsigned int align
)
6679 if (TYPE_PACKED (type
)
6680 || TYPE_ALIGN (type
) == align
)
6683 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
6684 if (check_aligned_type (t
, type
, align
))
6687 t
= build_variant_type_copy (type
);
6688 SET_TYPE_ALIGN (t
, align
);
6693 /* Create a new distinct copy of TYPE. The new type is made its own
6694 MAIN_VARIANT. If TYPE requires structural equality checks, the
6695 resulting type requires structural equality checks; otherwise, its
6696 TYPE_CANONICAL points to itself. */
6699 build_distinct_type_copy (tree type
)
6701 tree t
= copy_node (type
);
6703 TYPE_POINTER_TO (t
) = 0;
6704 TYPE_REFERENCE_TO (t
) = 0;
6706 /* Set the canonical type either to a new equivalence class, or
6707 propagate the need for structural equality checks. */
6708 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
6709 SET_TYPE_STRUCTURAL_EQUALITY (t
);
6711 TYPE_CANONICAL (t
) = t
;
6713 /* Make it its own variant. */
6714 TYPE_MAIN_VARIANT (t
) = t
;
6715 TYPE_NEXT_VARIANT (t
) = 0;
6717 /* We do not record methods in type copies nor variants
6718 so we do not need to keep them up to date when new method
6720 if (RECORD_OR_UNION_TYPE_P (t
))
6721 TYPE_METHODS (t
) = NULL_TREE
;
6723 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
6724 whose TREE_TYPE is not t. This can also happen in the Ada
6725 frontend when using subtypes. */
6730 /* Create a new variant of TYPE, equivalent but distinct. This is so
6731 the caller can modify it. TYPE_CANONICAL for the return type will
6732 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
6733 are considered equal by the language itself (or that both types
6734 require structural equality checks). */
6737 build_variant_type_copy (tree type
)
6739 tree t
, m
= TYPE_MAIN_VARIANT (type
);
6741 t
= build_distinct_type_copy (type
);
6743 /* Since we're building a variant, assume that it is a non-semantic
6744 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
6745 TYPE_CANONICAL (t
) = TYPE_CANONICAL (type
);
6746 /* Type variants have no alias set defined. */
6747 TYPE_ALIAS_SET (t
) = -1;
6749 /* Add the new type to the chain of variants of TYPE. */
6750 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (m
);
6751 TYPE_NEXT_VARIANT (m
) = t
;
6752 TYPE_MAIN_VARIANT (t
) = m
;
6757 /* Return true if the from tree in both tree maps are equal. */
6760 tree_map_base_eq (const void *va
, const void *vb
)
6762 const struct tree_map_base
*const a
= (const struct tree_map_base
*) va
,
6763 *const b
= (const struct tree_map_base
*) vb
;
6764 return (a
->from
== b
->from
);
6767 /* Hash a from tree in a tree_base_map. */
6770 tree_map_base_hash (const void *item
)
6772 return htab_hash_pointer (((const struct tree_map_base
*)item
)->from
);
6775 /* Return true if this tree map structure is marked for garbage collection
6776 purposes. We simply return true if the from tree is marked, so that this
6777 structure goes away when the from tree goes away. */
6780 tree_map_base_marked_p (const void *p
)
6782 return ggc_marked_p (((const struct tree_map_base
*) p
)->from
);
6785 /* Hash a from tree in a tree_map. */
6788 tree_map_hash (const void *item
)
6790 return (((const struct tree_map
*) item
)->hash
);
6793 /* Hash a from tree in a tree_decl_map. */
6796 tree_decl_map_hash (const void *item
)
6798 return DECL_UID (((const struct tree_decl_map
*) item
)->base
.from
);
6801 /* Return the initialization priority for DECL. */
6804 decl_init_priority_lookup (tree decl
)
6806 symtab_node
*snode
= symtab_node::get (decl
);
6809 return DEFAULT_INIT_PRIORITY
;
6811 snode
->get_init_priority ();
6814 /* Return the finalization priority for DECL. */
6817 decl_fini_priority_lookup (tree decl
)
6819 cgraph_node
*node
= cgraph_node::get (decl
);
6822 return DEFAULT_INIT_PRIORITY
;
6824 node
->get_fini_priority ();
6827 /* Set the initialization priority for DECL to PRIORITY. */
6830 decl_init_priority_insert (tree decl
, priority_type priority
)
6832 struct symtab_node
*snode
;
6834 if (priority
== DEFAULT_INIT_PRIORITY
)
6836 snode
= symtab_node::get (decl
);
6840 else if (TREE_CODE (decl
) == VAR_DECL
)
6841 snode
= varpool_node::get_create (decl
);
6843 snode
= cgraph_node::get_create (decl
);
6844 snode
->set_init_priority (priority
);
6847 /* Set the finalization priority for DECL to PRIORITY. */
6850 decl_fini_priority_insert (tree decl
, priority_type priority
)
6852 struct cgraph_node
*node
;
6854 if (priority
== DEFAULT_INIT_PRIORITY
)
6856 node
= cgraph_node::get (decl
);
6861 node
= cgraph_node::get_create (decl
);
6862 node
->set_fini_priority (priority
);
6865 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
6868 print_debug_expr_statistics (void)
6870 fprintf (stderr
, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
6871 (long) debug_expr_for_decl
->size (),
6872 (long) debug_expr_for_decl
->elements (),
6873 debug_expr_for_decl
->collisions ());
6876 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
6879 print_value_expr_statistics (void)
6881 fprintf (stderr
, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
6882 (long) value_expr_for_decl
->size (),
6883 (long) value_expr_for_decl
->elements (),
6884 value_expr_for_decl
->collisions ());
6887 /* Lookup a debug expression for FROM, and return it if we find one. */
6890 decl_debug_expr_lookup (tree from
)
6892 struct tree_decl_map
*h
, in
;
6893 in
.base
.from
= from
;
6895 h
= debug_expr_for_decl
->find_with_hash (&in
, DECL_UID (from
));
6901 /* Insert a mapping FROM->TO in the debug expression hashtable. */
6904 decl_debug_expr_insert (tree from
, tree to
)
6906 struct tree_decl_map
*h
;
6908 h
= ggc_alloc
<tree_decl_map
> ();
6909 h
->base
.from
= from
;
6911 *debug_expr_for_decl
->find_slot_with_hash (h
, DECL_UID (from
), INSERT
) = h
;
6914 /* Lookup a value expression for FROM, and return it if we find one. */
6917 decl_value_expr_lookup (tree from
)
6919 struct tree_decl_map
*h
, in
;
6920 in
.base
.from
= from
;
6922 h
= value_expr_for_decl
->find_with_hash (&in
, DECL_UID (from
));
6928 /* Insert a mapping FROM->TO in the value expression hashtable. */
6931 decl_value_expr_insert (tree from
, tree to
)
6933 struct tree_decl_map
*h
;
6935 h
= ggc_alloc
<tree_decl_map
> ();
6936 h
->base
.from
= from
;
6938 *value_expr_for_decl
->find_slot_with_hash (h
, DECL_UID (from
), INSERT
) = h
;
6941 /* Lookup a vector of debug arguments for FROM, and return it if we
6945 decl_debug_args_lookup (tree from
)
6947 struct tree_vec_map
*h
, in
;
6949 if (!DECL_HAS_DEBUG_ARGS_P (from
))
6951 gcc_checking_assert (debug_args_for_decl
!= NULL
);
6952 in
.base
.from
= from
;
6953 h
= debug_args_for_decl
->find_with_hash (&in
, DECL_UID (from
));
6959 /* Insert a mapping FROM->empty vector of debug arguments in the value
6960 expression hashtable. */
6963 decl_debug_args_insert (tree from
)
6965 struct tree_vec_map
*h
;
6968 if (DECL_HAS_DEBUG_ARGS_P (from
))
6969 return decl_debug_args_lookup (from
);
6970 if (debug_args_for_decl
== NULL
)
6971 debug_args_for_decl
= hash_table
<tree_vec_map_cache_hasher
>::create_ggc (64);
6972 h
= ggc_alloc
<tree_vec_map
> ();
6973 h
->base
.from
= from
;
6975 loc
= debug_args_for_decl
->find_slot_with_hash (h
, DECL_UID (from
), INSERT
);
6977 DECL_HAS_DEBUG_ARGS_P (from
) = 1;
6981 /* Hashing of types so that we don't make duplicates.
6982 The entry point is `type_hash_canon'. */
6984 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
6985 with types in the TREE_VALUE slots), by adding the hash codes
6986 of the individual types. */
6989 type_hash_list (const_tree list
, inchash::hash
&hstate
)
6993 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
6994 if (TREE_VALUE (tail
) != error_mark_node
)
6995 hstate
.add_object (TYPE_HASH (TREE_VALUE (tail
)));
6998 /* These are the Hashtable callback functions. */
7000 /* Returns true iff the types are equivalent. */
7003 type_cache_hasher::equal (type_hash
*a
, type_hash
*b
)
7005 /* First test the things that are the same for all types. */
7006 if (a
->hash
!= b
->hash
7007 || TREE_CODE (a
->type
) != TREE_CODE (b
->type
)
7008 || TREE_TYPE (a
->type
) != TREE_TYPE (b
->type
)
7009 || !attribute_list_equal (TYPE_ATTRIBUTES (a
->type
),
7010 TYPE_ATTRIBUTES (b
->type
))
7011 || (TREE_CODE (a
->type
) != COMPLEX_TYPE
7012 && TYPE_NAME (a
->type
) != TYPE_NAME (b
->type
)))
7015 /* Be careful about comparing arrays before and after the element type
7016 has been completed; don't compare TYPE_ALIGN unless both types are
7018 if (COMPLETE_TYPE_P (a
->type
) && COMPLETE_TYPE_P (b
->type
)
7019 && (TYPE_ALIGN (a
->type
) != TYPE_ALIGN (b
->type
)
7020 || TYPE_MODE (a
->type
) != TYPE_MODE (b
->type
)))
7023 switch (TREE_CODE (a
->type
))
7028 case REFERENCE_TYPE
:
7033 return TYPE_VECTOR_SUBPARTS (a
->type
) == TYPE_VECTOR_SUBPARTS (b
->type
);
7036 if (TYPE_VALUES (a
->type
) != TYPE_VALUES (b
->type
)
7037 && !(TYPE_VALUES (a
->type
)
7038 && TREE_CODE (TYPE_VALUES (a
->type
)) == TREE_LIST
7039 && TYPE_VALUES (b
->type
)
7040 && TREE_CODE (TYPE_VALUES (b
->type
)) == TREE_LIST
7041 && type_list_equal (TYPE_VALUES (a
->type
),
7042 TYPE_VALUES (b
->type
))))
7045 /* ... fall through ... */
7050 if (TYPE_PRECISION (a
->type
) != TYPE_PRECISION (b
->type
))
7052 return ((TYPE_MAX_VALUE (a
->type
) == TYPE_MAX_VALUE (b
->type
)
7053 || tree_int_cst_equal (TYPE_MAX_VALUE (a
->type
),
7054 TYPE_MAX_VALUE (b
->type
)))
7055 && (TYPE_MIN_VALUE (a
->type
) == TYPE_MIN_VALUE (b
->type
)
7056 || tree_int_cst_equal (TYPE_MIN_VALUE (a
->type
),
7057 TYPE_MIN_VALUE (b
->type
))));
7059 case FIXED_POINT_TYPE
:
7060 return TYPE_SATURATING (a
->type
) == TYPE_SATURATING (b
->type
);
7063 return TYPE_OFFSET_BASETYPE (a
->type
) == TYPE_OFFSET_BASETYPE (b
->type
);
7066 if (TYPE_METHOD_BASETYPE (a
->type
) == TYPE_METHOD_BASETYPE (b
->type
)
7067 && (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
7068 || (TYPE_ARG_TYPES (a
->type
)
7069 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
7070 && TYPE_ARG_TYPES (b
->type
)
7071 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
7072 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
7073 TYPE_ARG_TYPES (b
->type
)))))
7077 return TYPE_DOMAIN (a
->type
) == TYPE_DOMAIN (b
->type
);
7081 case QUAL_UNION_TYPE
:
7082 return (TYPE_FIELDS (a
->type
) == TYPE_FIELDS (b
->type
)
7083 || (TYPE_FIELDS (a
->type
)
7084 && TREE_CODE (TYPE_FIELDS (a
->type
)) == TREE_LIST
7085 && TYPE_FIELDS (b
->type
)
7086 && TREE_CODE (TYPE_FIELDS (b
->type
)) == TREE_LIST
7087 && type_list_equal (TYPE_FIELDS (a
->type
),
7088 TYPE_FIELDS (b
->type
))));
7091 if (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
7092 || (TYPE_ARG_TYPES (a
->type
)
7093 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
7094 && TYPE_ARG_TYPES (b
->type
)
7095 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
7096 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
7097 TYPE_ARG_TYPES (b
->type
))))
7105 if (lang_hooks
.types
.type_hash_eq
!= NULL
)
7106 return lang_hooks
.types
.type_hash_eq (a
->type
, b
->type
);
7111 /* Given TYPE, and HASHCODE its hash code, return the canonical
7112 object for an identical type if one already exists.
7113 Otherwise, return TYPE, and record it as the canonical object.
7115 To use this function, first create a type of the sort you want.
7116 Then compute its hash code from the fields of the type that
7117 make it different from other similar types.
7118 Then call this function and use the value. */
7121 type_hash_canon (unsigned int hashcode
, tree type
)
7126 /* The hash table only contains main variants, so ensure that's what we're
7128 gcc_assert (TYPE_MAIN_VARIANT (type
) == type
);
7130 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
7131 must call that routine before comparing TYPE_ALIGNs. */
7137 loc
= type_hash_table
->find_slot_with_hash (&in
, hashcode
, INSERT
);
7140 tree t1
= ((type_hash
*) *loc
)->type
;
7141 gcc_assert (TYPE_MAIN_VARIANT (t1
) == t1
);
7147 struct type_hash
*h
;
7149 h
= ggc_alloc
<type_hash
> ();
7159 print_type_hash_statistics (void)
7161 fprintf (stderr
, "Type hash: size %ld, %ld elements, %f collisions\n",
7162 (long) type_hash_table
->size (),
7163 (long) type_hash_table
->elements (),
7164 type_hash_table
->collisions ());
7167 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
7168 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
7169 by adding the hash codes of the individual attributes. */
7172 attribute_hash_list (const_tree list
, inchash::hash
&hstate
)
7176 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
7177 /* ??? Do we want to add in TREE_VALUE too? */
7178 hstate
.add_object (IDENTIFIER_HASH_VALUE (get_attribute_name (tail
)));
7181 /* Given two lists of attributes, return true if list l2 is
7182 equivalent to l1. */
7185 attribute_list_equal (const_tree l1
, const_tree l2
)
7190 return attribute_list_contained (l1
, l2
)
7191 && attribute_list_contained (l2
, l1
);
7194 /* Given two lists of attributes, return true if list L2 is
7195 completely contained within L1. */
7196 /* ??? This would be faster if attribute names were stored in a canonicalized
7197 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
7198 must be used to show these elements are equivalent (which they are). */
7199 /* ??? It's not clear that attributes with arguments will always be handled
7203 attribute_list_contained (const_tree l1
, const_tree l2
)
7207 /* First check the obvious, maybe the lists are identical. */
7211 /* Maybe the lists are similar. */
7212 for (t1
= l1
, t2
= l2
;
7214 && get_attribute_name (t1
) == get_attribute_name (t2
)
7215 && TREE_VALUE (t1
) == TREE_VALUE (t2
);
7216 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
7219 /* Maybe the lists are equal. */
7220 if (t1
== 0 && t2
== 0)
7223 for (; t2
!= 0; t2
= TREE_CHAIN (t2
))
7226 /* This CONST_CAST is okay because lookup_attribute does not
7227 modify its argument and the return value is assigned to a
7229 for (attr
= lookup_ident_attribute (get_attribute_name (t2
),
7230 CONST_CAST_TREE (l1
));
7231 attr
!= NULL_TREE
&& !attribute_value_equal (t2
, attr
);
7232 attr
= lookup_ident_attribute (get_attribute_name (t2
),
7236 if (attr
== NULL_TREE
)
7243 /* Given two lists of types
7244 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
7245 return 1 if the lists contain the same types in the same order.
7246 Also, the TREE_PURPOSEs must match. */
7249 type_list_equal (const_tree l1
, const_tree l2
)
7253 for (t1
= l1
, t2
= l2
; t1
&& t2
; t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
7254 if (TREE_VALUE (t1
) != TREE_VALUE (t2
)
7255 || (TREE_PURPOSE (t1
) != TREE_PURPOSE (t2
)
7256 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
))
7257 && (TREE_TYPE (TREE_PURPOSE (t1
))
7258 == TREE_TYPE (TREE_PURPOSE (t2
))))))
7264 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
7265 given by TYPE. If the argument list accepts variable arguments,
7266 then this function counts only the ordinary arguments. */
7269 type_num_arguments (const_tree type
)
7274 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
7275 /* If the function does not take a variable number of arguments,
7276 the last element in the list will have type `void'. */
7277 if (VOID_TYPE_P (TREE_VALUE (t
)))
7285 /* Nonzero if integer constants T1 and T2
7286 represent the same constant value. */
7289 tree_int_cst_equal (const_tree t1
, const_tree t2
)
7294 if (t1
== 0 || t2
== 0)
7297 if (TREE_CODE (t1
) == INTEGER_CST
7298 && TREE_CODE (t2
) == INTEGER_CST
7299 && wi::to_widest (t1
) == wi::to_widest (t2
))
7305 /* Return true if T is an INTEGER_CST whose numerical value (extended
7306 according to TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. */
7309 tree_fits_shwi_p (const_tree t
)
7311 return (t
!= NULL_TREE
7312 && TREE_CODE (t
) == INTEGER_CST
7313 && wi::fits_shwi_p (wi::to_widest (t
)));
7316 /* Return true if T is an INTEGER_CST whose numerical value (extended
7317 according to TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. */
7320 tree_fits_uhwi_p (const_tree t
)
7322 return (t
!= NULL_TREE
7323 && TREE_CODE (t
) == INTEGER_CST
7324 && wi::fits_uhwi_p (wi::to_widest (t
)));
7327 /* T is an INTEGER_CST whose numerical value (extended according to
7328 TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. Return that
7332 tree_to_shwi (const_tree t
)
7334 gcc_assert (tree_fits_shwi_p (t
));
7335 return TREE_INT_CST_LOW (t
);
7338 /* T is an INTEGER_CST whose numerical value (extended according to
7339 TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. Return that
7342 unsigned HOST_WIDE_INT
7343 tree_to_uhwi (const_tree t
)
7345 gcc_assert (tree_fits_uhwi_p (t
));
7346 return TREE_INT_CST_LOW (t
);
7349 /* Return the most significant (sign) bit of T. */
7352 tree_int_cst_sign_bit (const_tree t
)
7354 unsigned bitno
= TYPE_PRECISION (TREE_TYPE (t
)) - 1;
7356 return wi::extract_uhwi (t
, bitno
, 1);
7359 /* Return an indication of the sign of the integer constant T.
7360 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
7361 Note that -1 will never be returned if T's type is unsigned. */
7364 tree_int_cst_sgn (const_tree t
)
7366 if (wi::eq_p (t
, 0))
7368 else if (TYPE_UNSIGNED (TREE_TYPE (t
)))
7370 else if (wi::neg_p (t
))
7376 /* Return the minimum number of bits needed to represent VALUE in a
7377 signed or unsigned type, UNSIGNEDP says which. */
7380 tree_int_cst_min_precision (tree value
, signop sgn
)
7382 /* If the value is negative, compute its negative minus 1. The latter
7383 adjustment is because the absolute value of the largest negative value
7384 is one larger than the largest positive value. This is equivalent to
7385 a bit-wise negation, so use that operation instead. */
7387 if (tree_int_cst_sgn (value
) < 0)
7388 value
= fold_build1 (BIT_NOT_EXPR
, TREE_TYPE (value
), value
);
7390 /* Return the number of bits needed, taking into account the fact
7391 that we need one more bit for a signed than unsigned type.
7392 If value is 0 or -1, the minimum precision is 1 no matter
7393 whether unsignedp is true or false. */
7395 if (integer_zerop (value
))
7398 return tree_floor_log2 (value
) + 1 + (sgn
== SIGNED
? 1 : 0) ;
7401 /* Return truthvalue of whether T1 is the same tree structure as T2.
7402 Return 1 if they are the same.
7403 Return 0 if they are understandably different.
7404 Return -1 if either contains tree structure not understood by
7408 simple_cst_equal (const_tree t1
, const_tree t2
)
7410 enum tree_code code1
, code2
;
7416 if (t1
== 0 || t2
== 0)
7419 code1
= TREE_CODE (t1
);
7420 code2
= TREE_CODE (t2
);
7422 if (CONVERT_EXPR_CODE_P (code1
) || code1
== NON_LVALUE_EXPR
)
7424 if (CONVERT_EXPR_CODE_P (code2
)
7425 || code2
== NON_LVALUE_EXPR
)
7426 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7428 return simple_cst_equal (TREE_OPERAND (t1
, 0), t2
);
7431 else if (CONVERT_EXPR_CODE_P (code2
)
7432 || code2
== NON_LVALUE_EXPR
)
7433 return simple_cst_equal (t1
, TREE_OPERAND (t2
, 0));
7441 return wi::to_widest (t1
) == wi::to_widest (t2
);
7444 return real_identical (&TREE_REAL_CST (t1
), &TREE_REAL_CST (t2
));
7447 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1
), TREE_FIXED_CST (t2
));
7450 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
7451 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
7452 TREE_STRING_LENGTH (t1
)));
7456 unsigned HOST_WIDE_INT idx
;
7457 vec
<constructor_elt
, va_gc
> *v1
= CONSTRUCTOR_ELTS (t1
);
7458 vec
<constructor_elt
, va_gc
> *v2
= CONSTRUCTOR_ELTS (t2
);
7460 if (vec_safe_length (v1
) != vec_safe_length (v2
))
7463 for (idx
= 0; idx
< vec_safe_length (v1
); ++idx
)
7464 /* ??? Should we handle also fields here? */
7465 if (!simple_cst_equal ((*v1
)[idx
].value
, (*v2
)[idx
].value
))
7471 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7474 cmp
= simple_cst_equal (CALL_EXPR_FN (t1
), CALL_EXPR_FN (t2
));
7477 if (call_expr_nargs (t1
) != call_expr_nargs (t2
))
7480 const_tree arg1
, arg2
;
7481 const_call_expr_arg_iterator iter1
, iter2
;
7482 for (arg1
= first_const_call_expr_arg (t1
, &iter1
),
7483 arg2
= first_const_call_expr_arg (t2
, &iter2
);
7485 arg1
= next_const_call_expr_arg (&iter1
),
7486 arg2
= next_const_call_expr_arg (&iter2
))
7488 cmp
= simple_cst_equal (arg1
, arg2
);
7492 return arg1
== arg2
;
7496 /* Special case: if either target is an unallocated VAR_DECL,
7497 it means that it's going to be unified with whatever the
7498 TARGET_EXPR is really supposed to initialize, so treat it
7499 as being equivalent to anything. */
7500 if ((TREE_CODE (TREE_OPERAND (t1
, 0)) == VAR_DECL
7501 && DECL_NAME (TREE_OPERAND (t1
, 0)) == NULL_TREE
7502 && !DECL_RTL_SET_P (TREE_OPERAND (t1
, 0)))
7503 || (TREE_CODE (TREE_OPERAND (t2
, 0)) == VAR_DECL
7504 && DECL_NAME (TREE_OPERAND (t2
, 0)) == NULL_TREE
7505 && !DECL_RTL_SET_P (TREE_OPERAND (t2
, 0))))
7508 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7513 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
7515 case WITH_CLEANUP_EXPR
:
7516 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7520 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t1
, 1));
7523 if (TREE_OPERAND (t1
, 1) == TREE_OPERAND (t2
, 1))
7524 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7538 /* This general rule works for most tree codes. All exceptions should be
7539 handled above. If this is a language-specific tree code, we can't
7540 trust what might be in the operand, so say we don't know
7542 if ((int) code1
>= (int) LAST_AND_UNUSED_TREE_CODE
)
7545 switch (TREE_CODE_CLASS (code1
))
7549 case tcc_comparison
:
7550 case tcc_expression
:
7554 for (i
= 0; i
< TREE_CODE_LENGTH (code1
); i
++)
7556 cmp
= simple_cst_equal (TREE_OPERAND (t1
, i
), TREE_OPERAND (t2
, i
));
7568 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
7569 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
7570 than U, respectively. */
7573 compare_tree_int (const_tree t
, unsigned HOST_WIDE_INT u
)
7575 if (tree_int_cst_sgn (t
) < 0)
7577 else if (!tree_fits_uhwi_p (t
))
7579 else if (TREE_INT_CST_LOW (t
) == u
)
7581 else if (TREE_INT_CST_LOW (t
) < u
)
7587 /* Return true if SIZE represents a constant size that is in bounds of
7588 what the middle-end and the backend accepts (covering not more than
7589 half of the address-space). */
7592 valid_constant_size_p (const_tree size
)
7594 if (! tree_fits_uhwi_p (size
)
7595 || TREE_OVERFLOW (size
)
7596 || tree_int_cst_sign_bit (size
) != 0)
7601 /* Return the precision of the type, or for a complex or vector type the
7602 precision of the type of its elements. */
7605 element_precision (const_tree type
)
7608 type
= TREE_TYPE (type
);
7609 enum tree_code code
= TREE_CODE (type
);
7610 if (code
== COMPLEX_TYPE
|| code
== VECTOR_TYPE
)
7611 type
= TREE_TYPE (type
);
7613 return TYPE_PRECISION (type
);
7616 /* Return true if CODE represents an associative tree code. Otherwise
7619 associative_tree_code (enum tree_code code
)
7638 /* Return true if CODE represents a commutative tree code. Otherwise
7641 commutative_tree_code (enum tree_code code
)
7647 case MULT_HIGHPART_EXPR
:
7655 case UNORDERED_EXPR
:
7659 case TRUTH_AND_EXPR
:
7660 case TRUTH_XOR_EXPR
:
7662 case WIDEN_MULT_EXPR
:
7663 case VEC_WIDEN_MULT_HI_EXPR
:
7664 case VEC_WIDEN_MULT_LO_EXPR
:
7665 case VEC_WIDEN_MULT_EVEN_EXPR
:
7666 case VEC_WIDEN_MULT_ODD_EXPR
:
7675 /* Return true if CODE represents a ternary tree code for which the
7676 first two operands are commutative. Otherwise return false. */
7678 commutative_ternary_tree_code (enum tree_code code
)
7682 case WIDEN_MULT_PLUS_EXPR
:
7683 case WIDEN_MULT_MINUS_EXPR
:
7694 /* Returns true if CODE can overflow. */
7697 operation_can_overflow (enum tree_code code
)
7705 /* Can overflow in various ways. */
7707 case TRUNC_DIV_EXPR
:
7708 case EXACT_DIV_EXPR
:
7709 case FLOOR_DIV_EXPR
:
7711 /* For INT_MIN / -1. */
7718 /* These operators cannot overflow. */
7723 /* Returns true if CODE operating on operands of type TYPE doesn't overflow, or
7724 ftrapv doesn't generate trapping insns for CODE. */
7727 operation_no_trapping_overflow (tree type
, enum tree_code code
)
7729 gcc_checking_assert (ANY_INTEGRAL_TYPE_P (type
));
7731 /* We don't generate instructions that trap on overflow for complex or vector
7733 if (!INTEGRAL_TYPE_P (type
))
7736 if (!TYPE_OVERFLOW_TRAPS (type
))
7746 /* These operators can overflow, and -ftrapv generates trapping code for
7749 case TRUNC_DIV_EXPR
:
7750 case EXACT_DIV_EXPR
:
7751 case FLOOR_DIV_EXPR
:
7754 /* These operators can overflow, but -ftrapv does not generate trapping
7758 /* These operators cannot overflow. */
7766 /* Generate a hash value for an expression. This can be used iteratively
7767 by passing a previous result as the HSTATE argument.
7769 This function is intended to produce the same hash for expressions which
7770 would compare equal using operand_equal_p. */
7772 add_expr (const_tree t
, inchash::hash
&hstate
, unsigned int flags
)
7775 enum tree_code code
;
7776 enum tree_code_class tclass
;
7780 hstate
.merge_hash (0);
7784 if (!(flags
& OEP_ADDRESS_OF
))
7787 code
= TREE_CODE (t
);
7791 /* Alas, constants aren't shared, so we can't rely on pointer
7794 hstate
.merge_hash (0);
7797 gcc_checking_assert (!(flags
& OEP_ADDRESS_OF
));
7798 for (i
= 0; i
< TREE_INT_CST_EXT_NUNITS (t
); i
++)
7799 hstate
.add_wide_int (TREE_INT_CST_ELT (t
, i
));
7804 if (!HONOR_SIGNED_ZEROS (t
) && real_zerop (t
))
7807 val2
= real_hash (TREE_REAL_CST_PTR (t
));
7808 hstate
.merge_hash (val2
);
7813 unsigned int val2
= fixed_hash (TREE_FIXED_CST_PTR (t
));
7814 hstate
.merge_hash (val2
);
7818 hstate
.add ((const void *) TREE_STRING_POINTER (t
),
7819 TREE_STRING_LENGTH (t
));
7822 inchash::add_expr (TREE_REALPART (t
), hstate
, flags
);
7823 inchash::add_expr (TREE_IMAGPART (t
), hstate
, flags
);
7828 for (i
= 0; i
< VECTOR_CST_NELTS (t
); ++i
)
7829 inchash::add_expr (VECTOR_CST_ELT (t
, i
), hstate
, flags
);
7833 /* We can just compare by pointer. */
7834 hstate
.add_wide_int (SSA_NAME_VERSION (t
));
7836 case PLACEHOLDER_EXPR
:
7837 /* The node itself doesn't matter. */
7844 /* A list of expressions, for a CALL_EXPR or as the elements of a
7846 for (; t
; t
= TREE_CHAIN (t
))
7847 inchash::add_expr (TREE_VALUE (t
), hstate
, flags
);
7851 unsigned HOST_WIDE_INT idx
;
7853 flags
&= ~OEP_ADDRESS_OF
;
7854 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t
), idx
, field
, value
)
7856 inchash::add_expr (field
, hstate
, flags
);
7857 inchash::add_expr (value
, hstate
, flags
);
7861 case STATEMENT_LIST
:
7863 tree_stmt_iterator i
;
7864 for (i
= tsi_start (CONST_CAST_TREE (t
));
7865 !tsi_end_p (i
); tsi_next (&i
))
7866 inchash::add_expr (tsi_stmt (i
), hstate
, flags
);
7870 /* When referring to a built-in FUNCTION_DECL, use the __builtin__ form.
7871 Otherwise nodes that compare equal according to operand_equal_p might
7872 get different hash codes. However, don't do this for machine specific
7873 or front end builtins, since the function code is overloaded in those
7875 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
7876 && builtin_decl_explicit_p (DECL_FUNCTION_CODE (t
)))
7878 t
= builtin_decl_explicit (DECL_FUNCTION_CODE (t
));
7879 code
= TREE_CODE (t
);
7883 tclass
= TREE_CODE_CLASS (code
);
7885 if (tclass
== tcc_declaration
)
7887 /* DECL's have a unique ID */
7888 hstate
.add_wide_int (DECL_UID (t
));
7890 else if (tclass
== tcc_comparison
&& !commutative_tree_code (code
))
7892 /* For comparisons that can be swapped, use the lower
7894 enum tree_code ccode
= swap_tree_comparison (code
);
7897 hstate
.add_object (ccode
);
7898 inchash::add_expr (TREE_OPERAND (t
, ccode
!= code
), hstate
, flags
);
7899 inchash::add_expr (TREE_OPERAND (t
, ccode
== code
), hstate
, flags
);
7901 else if (CONVERT_EXPR_CODE_P (code
))
7903 /* NOP_EXPR and CONVERT_EXPR are considered equal by
7905 enum tree_code ccode
= NOP_EXPR
;
7906 hstate
.add_object (ccode
);
7908 /* Don't hash the type, that can lead to having nodes which
7909 compare equal according to operand_equal_p, but which
7910 have different hash codes. Make sure to include signedness
7911 in the hash computation. */
7912 hstate
.add_int (TYPE_UNSIGNED (TREE_TYPE (t
)));
7913 inchash::add_expr (TREE_OPERAND (t
, 0), hstate
, flags
);
7915 /* For OEP_ADDRESS_OF, hash MEM_EXPR[&decl, 0] the same as decl. */
7916 else if (code
== MEM_REF
7917 && (flags
& OEP_ADDRESS_OF
) != 0
7918 && TREE_CODE (TREE_OPERAND (t
, 0)) == ADDR_EXPR
7919 && DECL_P (TREE_OPERAND (TREE_OPERAND (t
, 0), 0))
7920 && integer_zerop (TREE_OPERAND (t
, 1)))
7921 inchash::add_expr (TREE_OPERAND (TREE_OPERAND (t
, 0), 0),
7925 gcc_assert (IS_EXPR_CODE_CLASS (tclass
));
7926 unsigned int sflags
= flags
;
7928 hstate
.add_object (code
);
7933 gcc_checking_assert (!(flags
& OEP_ADDRESS_OF
));
7934 flags
|= OEP_ADDRESS_OF
;
7940 case TARGET_MEM_REF
:
7941 flags
&= ~OEP_ADDRESS_OF
;
7946 case ARRAY_RANGE_REF
:
7949 sflags
&= ~OEP_ADDRESS_OF
;
7953 flags
&= ~OEP_ADDRESS_OF
;
7957 case WIDEN_MULT_PLUS_EXPR
:
7958 case WIDEN_MULT_MINUS_EXPR
:
7960 /* The multiplication operands are commutative. */
7961 inchash::hash one
, two
;
7962 inchash::add_expr (TREE_OPERAND (t
, 0), one
, flags
);
7963 inchash::add_expr (TREE_OPERAND (t
, 1), two
, flags
);
7964 hstate
.add_commutative (one
, two
);
7965 inchash::add_expr (TREE_OPERAND (t
, 2), two
, flags
);
7970 if (CALL_EXPR_FN (t
) == NULL_TREE
)
7971 hstate
.add_int (CALL_EXPR_IFN (t
));
7978 /* Don't hash the type, that can lead to having nodes which
7979 compare equal according to operand_equal_p, but which
7980 have different hash codes. */
7981 if (code
== NON_LVALUE_EXPR
)
7983 /* Make sure to include signness in the hash computation. */
7984 hstate
.add_int (TYPE_UNSIGNED (TREE_TYPE (t
)));
7985 inchash::add_expr (TREE_OPERAND (t
, 0), hstate
, flags
);
7988 else if (commutative_tree_code (code
))
7990 /* It's a commutative expression. We want to hash it the same
7991 however it appears. We do this by first hashing both operands
7992 and then rehashing based on the order of their independent
7994 inchash::hash one
, two
;
7995 inchash::add_expr (TREE_OPERAND (t
, 0), one
, flags
);
7996 inchash::add_expr (TREE_OPERAND (t
, 1), two
, flags
);
7997 hstate
.add_commutative (one
, two
);
8000 for (i
= TREE_OPERAND_LENGTH (t
) - 1; i
>= 0; --i
)
8001 inchash::add_expr (TREE_OPERAND (t
, i
), hstate
,
8002 i
== 0 ? flags
: sflags
);
8010 /* Constructors for pointer, array and function types.
8011 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
8012 constructed by language-dependent code, not here.) */
8014 /* Construct, lay out and return the type of pointers to TO_TYPE with
8015 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
8016 reference all of memory. If such a type has already been
8017 constructed, reuse it. */
8020 build_pointer_type_for_mode (tree to_type
, machine_mode mode
,
8024 bool could_alias
= can_alias_all
;
8026 if (to_type
== error_mark_node
)
8027 return error_mark_node
;
8029 /* If the pointed-to type has the may_alias attribute set, force
8030 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
8031 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
8032 can_alias_all
= true;
8034 /* In some cases, languages will have things that aren't a POINTER_TYPE
8035 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
8036 In that case, return that type without regard to the rest of our
8039 ??? This is a kludge, but consistent with the way this function has
8040 always operated and there doesn't seem to be a good way to avoid this
8042 if (TYPE_POINTER_TO (to_type
) != 0
8043 && TREE_CODE (TYPE_POINTER_TO (to_type
)) != POINTER_TYPE
)
8044 return TYPE_POINTER_TO (to_type
);
8046 /* First, if we already have a type for pointers to TO_TYPE and it's
8047 the proper mode, use it. */
8048 for (t
= TYPE_POINTER_TO (to_type
); t
; t
= TYPE_NEXT_PTR_TO (t
))
8049 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
8052 t
= make_node (POINTER_TYPE
);
8054 TREE_TYPE (t
) = to_type
;
8055 SET_TYPE_MODE (t
, mode
);
8056 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
8057 TYPE_NEXT_PTR_TO (t
) = TYPE_POINTER_TO (to_type
);
8058 TYPE_POINTER_TO (to_type
) = t
;
8060 /* During LTO we do not set TYPE_CANONICAL of pointers and references. */
8061 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
) || in_lto_p
)
8062 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8063 else if (TYPE_CANONICAL (to_type
) != to_type
|| could_alias
)
8065 = build_pointer_type_for_mode (TYPE_CANONICAL (to_type
),
8068 /* Lay out the type. This function has many callers that are concerned
8069 with expression-construction, and this simplifies them all. */
8075 /* By default build pointers in ptr_mode. */
8078 build_pointer_type (tree to_type
)
8080 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
8081 : TYPE_ADDR_SPACE (to_type
);
8082 machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
8083 return build_pointer_type_for_mode (to_type
, pointer_mode
, false);
8086 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
8089 build_reference_type_for_mode (tree to_type
, machine_mode mode
,
8093 bool could_alias
= can_alias_all
;
8095 if (to_type
== error_mark_node
)
8096 return error_mark_node
;
8098 /* If the pointed-to type has the may_alias attribute set, force
8099 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
8100 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
8101 can_alias_all
= true;
8103 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
8104 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
8105 In that case, return that type without regard to the rest of our
8108 ??? This is a kludge, but consistent with the way this function has
8109 always operated and there doesn't seem to be a good way to avoid this
8111 if (TYPE_REFERENCE_TO (to_type
) != 0
8112 && TREE_CODE (TYPE_REFERENCE_TO (to_type
)) != REFERENCE_TYPE
)
8113 return TYPE_REFERENCE_TO (to_type
);
8115 /* First, if we already have a type for pointers to TO_TYPE and it's
8116 the proper mode, use it. */
8117 for (t
= TYPE_REFERENCE_TO (to_type
); t
; t
= TYPE_NEXT_REF_TO (t
))
8118 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
8121 t
= make_node (REFERENCE_TYPE
);
8123 TREE_TYPE (t
) = to_type
;
8124 SET_TYPE_MODE (t
, mode
);
8125 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
8126 TYPE_NEXT_REF_TO (t
) = TYPE_REFERENCE_TO (to_type
);
8127 TYPE_REFERENCE_TO (to_type
) = t
;
8129 /* During LTO we do not set TYPE_CANONICAL of pointers and references. */
8130 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
) || in_lto_p
)
8131 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8132 else if (TYPE_CANONICAL (to_type
) != to_type
|| could_alias
)
8134 = build_reference_type_for_mode (TYPE_CANONICAL (to_type
),
8143 /* Build the node for the type of references-to-TO_TYPE by default
8147 build_reference_type (tree to_type
)
8149 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
8150 : TYPE_ADDR_SPACE (to_type
);
8151 machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
8152 return build_reference_type_for_mode (to_type
, pointer_mode
, false);
8155 #define MAX_INT_CACHED_PREC \
8156 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
8157 static GTY(()) tree nonstandard_integer_type_cache
[2 * MAX_INT_CACHED_PREC
+ 2];
8159 /* Builds a signed or unsigned integer type of precision PRECISION.
8160 Used for C bitfields whose precision does not match that of
8161 built-in target types. */
8163 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision
,
8169 unsignedp
= MAX_INT_CACHED_PREC
+ 1;
8171 if (precision
<= MAX_INT_CACHED_PREC
)
8173 itype
= nonstandard_integer_type_cache
[precision
+ unsignedp
];
8178 itype
= make_node (INTEGER_TYPE
);
8179 TYPE_PRECISION (itype
) = precision
;
8182 fixup_unsigned_type (itype
);
8184 fixup_signed_type (itype
);
8187 if (tree_fits_uhwi_p (TYPE_MAX_VALUE (itype
)))
8188 ret
= type_hash_canon (tree_to_uhwi (TYPE_MAX_VALUE (itype
)), itype
);
8189 if (precision
<= MAX_INT_CACHED_PREC
)
8190 nonstandard_integer_type_cache
[precision
+ unsignedp
] = ret
;
8195 #define MAX_BOOL_CACHED_PREC \
8196 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
8197 static GTY(()) tree nonstandard_boolean_type_cache
[MAX_BOOL_CACHED_PREC
+ 1];
8199 /* Builds a boolean type of precision PRECISION.
8200 Used for boolean vectors to choose proper vector element size. */
8202 build_nonstandard_boolean_type (unsigned HOST_WIDE_INT precision
)
8206 if (precision
<= MAX_BOOL_CACHED_PREC
)
8208 type
= nonstandard_boolean_type_cache
[precision
];
8213 type
= make_node (BOOLEAN_TYPE
);
8214 TYPE_PRECISION (type
) = precision
;
8215 fixup_signed_type (type
);
8217 if (precision
<= MAX_INT_CACHED_PREC
)
8218 nonstandard_boolean_type_cache
[precision
] = type
;
8223 /* Create a range of some discrete type TYPE (an INTEGER_TYPE, ENUMERAL_TYPE
8224 or BOOLEAN_TYPE) with low bound LOWVAL and high bound HIGHVAL. If SHARED
8225 is true, reuse such a type that has already been constructed. */
8228 build_range_type_1 (tree type
, tree lowval
, tree highval
, bool shared
)
8230 tree itype
= make_node (INTEGER_TYPE
);
8231 inchash::hash hstate
;
8233 TREE_TYPE (itype
) = type
;
8235 TYPE_MIN_VALUE (itype
) = fold_convert (type
, lowval
);
8236 TYPE_MAX_VALUE (itype
) = highval
? fold_convert (type
, highval
) : NULL
;
8238 TYPE_PRECISION (itype
) = TYPE_PRECISION (type
);
8239 SET_TYPE_MODE (itype
, TYPE_MODE (type
));
8240 TYPE_SIZE (itype
) = TYPE_SIZE (type
);
8241 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (type
);
8242 SET_TYPE_ALIGN (itype
, TYPE_ALIGN (type
));
8243 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (type
);
8248 if ((TYPE_MIN_VALUE (itype
)
8249 && TREE_CODE (TYPE_MIN_VALUE (itype
)) != INTEGER_CST
)
8250 || (TYPE_MAX_VALUE (itype
)
8251 && TREE_CODE (TYPE_MAX_VALUE (itype
)) != INTEGER_CST
))
8253 /* Since we cannot reliably merge this type, we need to compare it using
8254 structural equality checks. */
8255 SET_TYPE_STRUCTURAL_EQUALITY (itype
);
8259 inchash::add_expr (TYPE_MIN_VALUE (itype
), hstate
);
8260 inchash::add_expr (TYPE_MAX_VALUE (itype
), hstate
);
8261 hstate
.merge_hash (TYPE_HASH (type
));
8262 itype
= type_hash_canon (hstate
.end (), itype
);
8267 /* Wrapper around build_range_type_1 with SHARED set to true. */
8270 build_range_type (tree type
, tree lowval
, tree highval
)
8272 return build_range_type_1 (type
, lowval
, highval
, true);
8275 /* Wrapper around build_range_type_1 with SHARED set to false. */
8278 build_nonshared_range_type (tree type
, tree lowval
, tree highval
)
8280 return build_range_type_1 (type
, lowval
, highval
, false);
8283 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
8284 MAXVAL should be the maximum value in the domain
8285 (one less than the length of the array).
8287 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
8288 We don't enforce this limit, that is up to caller (e.g. language front end).
8289 The limit exists because the result is a signed type and we don't handle
8290 sizes that use more than one HOST_WIDE_INT. */
8293 build_index_type (tree maxval
)
8295 return build_range_type (sizetype
, size_zero_node
, maxval
);
8298 /* Return true if the debug information for TYPE, a subtype, should be emitted
8299 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
8300 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
8301 debug info and doesn't reflect the source code. */
8304 subrange_type_for_debug_p (const_tree type
, tree
*lowval
, tree
*highval
)
8306 tree base_type
= TREE_TYPE (type
), low
, high
;
8308 /* Subrange types have a base type which is an integral type. */
8309 if (!INTEGRAL_TYPE_P (base_type
))
8312 /* Get the real bounds of the subtype. */
8313 if (lang_hooks
.types
.get_subrange_bounds
)
8314 lang_hooks
.types
.get_subrange_bounds (type
, &low
, &high
);
8317 low
= TYPE_MIN_VALUE (type
);
8318 high
= TYPE_MAX_VALUE (type
);
8321 /* If the type and its base type have the same representation and the same
8322 name, then the type is not a subrange but a copy of the base type. */
8323 if ((TREE_CODE (base_type
) == INTEGER_TYPE
8324 || TREE_CODE (base_type
) == BOOLEAN_TYPE
)
8325 && int_size_in_bytes (type
) == int_size_in_bytes (base_type
)
8326 && tree_int_cst_equal (low
, TYPE_MIN_VALUE (base_type
))
8327 && tree_int_cst_equal (high
, TYPE_MAX_VALUE (base_type
))
8328 && TYPE_IDENTIFIER (type
) == TYPE_IDENTIFIER (base_type
))
8338 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
8339 and number of elements specified by the range of values of INDEX_TYPE.
8340 If SHARED is true, reuse such a type that has already been constructed. */
8343 build_array_type_1 (tree elt_type
, tree index_type
, bool shared
)
8347 if (TREE_CODE (elt_type
) == FUNCTION_TYPE
)
8349 error ("arrays of functions are not meaningful");
8350 elt_type
= integer_type_node
;
8353 t
= make_node (ARRAY_TYPE
);
8354 TREE_TYPE (t
) = elt_type
;
8355 TYPE_DOMAIN (t
) = index_type
;
8356 TYPE_ADDR_SPACE (t
) = TYPE_ADDR_SPACE (elt_type
);
8359 /* If the element type is incomplete at this point we get marked for
8360 structural equality. Do not record these types in the canonical
8362 if (TYPE_STRUCTURAL_EQUALITY_P (t
))
8367 inchash::hash hstate
;
8368 hstate
.add_object (TYPE_HASH (elt_type
));
8370 hstate
.add_object (TYPE_HASH (index_type
));
8371 t
= type_hash_canon (hstate
.end (), t
);
8374 if (TYPE_CANONICAL (t
) == t
)
8376 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type
)
8377 || (index_type
&& TYPE_STRUCTURAL_EQUALITY_P (index_type
))
8379 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8380 else if (TYPE_CANONICAL (elt_type
) != elt_type
8381 || (index_type
&& TYPE_CANONICAL (index_type
) != index_type
))
8383 = build_array_type_1 (TYPE_CANONICAL (elt_type
),
8385 ? TYPE_CANONICAL (index_type
) : NULL_TREE
,
8392 /* Wrapper around build_array_type_1 with SHARED set to true. */
8395 build_array_type (tree elt_type
, tree index_type
)
8397 return build_array_type_1 (elt_type
, index_type
, true);
8400 /* Wrapper around build_array_type_1 with SHARED set to false. */
8403 build_nonshared_array_type (tree elt_type
, tree index_type
)
8405 return build_array_type_1 (elt_type
, index_type
, false);
8408 /* Return a representation of ELT_TYPE[NELTS], using indices of type
8412 build_array_type_nelts (tree elt_type
, unsigned HOST_WIDE_INT nelts
)
8414 return build_array_type (elt_type
, build_index_type (size_int (nelts
- 1)));
8417 /* Recursively examines the array elements of TYPE, until a non-array
8418 element type is found. */
8421 strip_array_types (tree type
)
8423 while (TREE_CODE (type
) == ARRAY_TYPE
)
8424 type
= TREE_TYPE (type
);
8429 /* Computes the canonical argument types from the argument type list
8432 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
8433 on entry to this function, or if any of the ARGTYPES are
8436 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
8437 true on entry to this function, or if any of the ARGTYPES are
8440 Returns a canonical argument list, which may be ARGTYPES when the
8441 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
8442 true) or would not differ from ARGTYPES. */
8445 maybe_canonicalize_argtypes (tree argtypes
,
8446 bool *any_structural_p
,
8447 bool *any_noncanonical_p
)
8450 bool any_noncanonical_argtypes_p
= false;
8452 for (arg
= argtypes
; arg
&& !(*any_structural_p
); arg
= TREE_CHAIN (arg
))
8454 if (!TREE_VALUE (arg
) || TREE_VALUE (arg
) == error_mark_node
)
8455 /* Fail gracefully by stating that the type is structural. */
8456 *any_structural_p
= true;
8457 else if (TYPE_STRUCTURAL_EQUALITY_P (TREE_VALUE (arg
)))
8458 *any_structural_p
= true;
8459 else if (TYPE_CANONICAL (TREE_VALUE (arg
)) != TREE_VALUE (arg
)
8460 || TREE_PURPOSE (arg
))
8461 /* If the argument has a default argument, we consider it
8462 non-canonical even though the type itself is canonical.
8463 That way, different variants of function and method types
8464 with default arguments will all point to the variant with
8465 no defaults as their canonical type. */
8466 any_noncanonical_argtypes_p
= true;
8469 if (*any_structural_p
)
8472 if (any_noncanonical_argtypes_p
)
8474 /* Build the canonical list of argument types. */
8475 tree canon_argtypes
= NULL_TREE
;
8476 bool is_void
= false;
8478 for (arg
= argtypes
; arg
; arg
= TREE_CHAIN (arg
))
8480 if (arg
== void_list_node
)
8483 canon_argtypes
= tree_cons (NULL_TREE
,
8484 TYPE_CANONICAL (TREE_VALUE (arg
)),
8488 canon_argtypes
= nreverse (canon_argtypes
);
8490 canon_argtypes
= chainon (canon_argtypes
, void_list_node
);
8492 /* There is a non-canonical type. */
8493 *any_noncanonical_p
= true;
8494 return canon_argtypes
;
8497 /* The canonical argument types are the same as ARGTYPES. */
8501 /* Construct, lay out and return
8502 the type of functions returning type VALUE_TYPE
8503 given arguments of types ARG_TYPES.
8504 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
8505 are data type nodes for the arguments of the function.
8506 If such a type has already been constructed, reuse it. */
8509 build_function_type (tree value_type
, tree arg_types
)
8512 inchash::hash hstate
;
8513 bool any_structural_p
, any_noncanonical_p
;
8514 tree canon_argtypes
;
8516 if (TREE_CODE (value_type
) == FUNCTION_TYPE
)
8518 error ("function return type cannot be function");
8519 value_type
= integer_type_node
;
8522 /* Make a node of the sort we want. */
8523 t
= make_node (FUNCTION_TYPE
);
8524 TREE_TYPE (t
) = value_type
;
8525 TYPE_ARG_TYPES (t
) = arg_types
;
8527 /* If we already have such a type, use the old one. */
8528 hstate
.add_object (TYPE_HASH (value_type
));
8529 type_hash_list (arg_types
, hstate
);
8530 t
= type_hash_canon (hstate
.end (), t
);
8532 /* Set up the canonical type. */
8533 any_structural_p
= TYPE_STRUCTURAL_EQUALITY_P (value_type
);
8534 any_noncanonical_p
= TYPE_CANONICAL (value_type
) != value_type
;
8535 canon_argtypes
= maybe_canonicalize_argtypes (arg_types
,
8537 &any_noncanonical_p
);
8538 if (any_structural_p
)
8539 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8540 else if (any_noncanonical_p
)
8541 TYPE_CANONICAL (t
) = build_function_type (TYPE_CANONICAL (value_type
),
8544 if (!COMPLETE_TYPE_P (t
))
8549 /* Build a function type. The RETURN_TYPE is the type returned by the
8550 function. If VAARGS is set, no void_type_node is appended to the
8551 list. ARGP must be always be terminated be a NULL_TREE. */
8554 build_function_type_list_1 (bool vaargs
, tree return_type
, va_list argp
)
8558 t
= va_arg (argp
, tree
);
8559 for (args
= NULL_TREE
; t
!= NULL_TREE
; t
= va_arg (argp
, tree
))
8560 args
= tree_cons (NULL_TREE
, t
, args
);
8565 if (args
!= NULL_TREE
)
8566 args
= nreverse (args
);
8567 gcc_assert (last
!= void_list_node
);
8569 else if (args
== NULL_TREE
)
8570 args
= void_list_node
;
8574 args
= nreverse (args
);
8575 TREE_CHAIN (last
) = void_list_node
;
8577 args
= build_function_type (return_type
, args
);
8582 /* Build a function type. The RETURN_TYPE is the type returned by the
8583 function. If additional arguments are provided, they are
8584 additional argument types. The list of argument types must always
8585 be terminated by NULL_TREE. */
8588 build_function_type_list (tree return_type
, ...)
8593 va_start (p
, return_type
);
8594 args
= build_function_type_list_1 (false, return_type
, p
);
8599 /* Build a variable argument function type. The RETURN_TYPE is the
8600 type returned by the function. If additional arguments are provided,
8601 they are additional argument types. The list of argument types must
8602 always be terminated by NULL_TREE. */
8605 build_varargs_function_type_list (tree return_type
, ...)
8610 va_start (p
, return_type
);
8611 args
= build_function_type_list_1 (true, return_type
, p
);
8617 /* Build a function type. RETURN_TYPE is the type returned by the
8618 function; VAARGS indicates whether the function takes varargs. The
8619 function takes N named arguments, the types of which are provided in
8623 build_function_type_array_1 (bool vaargs
, tree return_type
, int n
,
8627 tree t
= vaargs
? NULL_TREE
: void_list_node
;
8629 for (i
= n
- 1; i
>= 0; i
--)
8630 t
= tree_cons (NULL_TREE
, arg_types
[i
], t
);
8632 return build_function_type (return_type
, t
);
8635 /* Build a function type. RETURN_TYPE is the type returned by the
8636 function. The function takes N named arguments, the types of which
8637 are provided in ARG_TYPES. */
8640 build_function_type_array (tree return_type
, int n
, tree
*arg_types
)
8642 return build_function_type_array_1 (false, return_type
, n
, arg_types
);
8645 /* Build a variable argument function type. RETURN_TYPE is the type
8646 returned by the function. The function takes N named arguments, the
8647 types of which are provided in ARG_TYPES. */
8650 build_varargs_function_type_array (tree return_type
, int n
, tree
*arg_types
)
8652 return build_function_type_array_1 (true, return_type
, n
, arg_types
);
8655 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
8656 and ARGTYPES (a TREE_LIST) are the return type and arguments types
8657 for the method. An implicit additional parameter (of type
8658 pointer-to-BASETYPE) is added to the ARGTYPES. */
8661 build_method_type_directly (tree basetype
,
8667 inchash::hash hstate
;
8668 bool any_structural_p
, any_noncanonical_p
;
8669 tree canon_argtypes
;
8671 /* Make a node of the sort we want. */
8672 t
= make_node (METHOD_TYPE
);
8674 TYPE_METHOD_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
8675 TREE_TYPE (t
) = rettype
;
8676 ptype
= build_pointer_type (basetype
);
8678 /* The actual arglist for this function includes a "hidden" argument
8679 which is "this". Put it into the list of argument types. */
8680 argtypes
= tree_cons (NULL_TREE
, ptype
, argtypes
);
8681 TYPE_ARG_TYPES (t
) = argtypes
;
8683 /* If we already have such a type, use the old one. */
8684 hstate
.add_object (TYPE_HASH (basetype
));
8685 hstate
.add_object (TYPE_HASH (rettype
));
8686 type_hash_list (argtypes
, hstate
);
8687 t
= type_hash_canon (hstate
.end (), t
);
8689 /* Set up the canonical type. */
8691 = (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
8692 || TYPE_STRUCTURAL_EQUALITY_P (rettype
));
8694 = (TYPE_CANONICAL (basetype
) != basetype
8695 || TYPE_CANONICAL (rettype
) != rettype
);
8696 canon_argtypes
= maybe_canonicalize_argtypes (TREE_CHAIN (argtypes
),
8698 &any_noncanonical_p
);
8699 if (any_structural_p
)
8700 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8701 else if (any_noncanonical_p
)
8703 = build_method_type_directly (TYPE_CANONICAL (basetype
),
8704 TYPE_CANONICAL (rettype
),
8706 if (!COMPLETE_TYPE_P (t
))
8712 /* Construct, lay out and return the type of methods belonging to class
8713 BASETYPE and whose arguments and values are described by TYPE.
8714 If that type exists already, reuse it.
8715 TYPE must be a FUNCTION_TYPE node. */
8718 build_method_type (tree basetype
, tree type
)
8720 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
8722 return build_method_type_directly (basetype
,
8724 TYPE_ARG_TYPES (type
));
8727 /* Construct, lay out and return the type of offsets to a value
8728 of type TYPE, within an object of type BASETYPE.
8729 If a suitable offset type exists already, reuse it. */
8732 build_offset_type (tree basetype
, tree type
)
8735 inchash::hash hstate
;
8737 /* Make a node of the sort we want. */
8738 t
= make_node (OFFSET_TYPE
);
8740 TYPE_OFFSET_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
8741 TREE_TYPE (t
) = type
;
8743 /* If we already have such a type, use the old one. */
8744 hstate
.add_object (TYPE_HASH (basetype
));
8745 hstate
.add_object (TYPE_HASH (type
));
8746 t
= type_hash_canon (hstate
.end (), t
);
8748 if (!COMPLETE_TYPE_P (t
))
8751 if (TYPE_CANONICAL (t
) == t
)
8753 if (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
8754 || TYPE_STRUCTURAL_EQUALITY_P (type
))
8755 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8756 else if (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)) != basetype
8757 || TYPE_CANONICAL (type
) != type
)
8759 = build_offset_type (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)),
8760 TYPE_CANONICAL (type
));
8766 /* Create a complex type whose components are COMPONENT_TYPE. */
8769 build_complex_type (tree component_type
)
8772 inchash::hash hstate
;
8774 gcc_assert (INTEGRAL_TYPE_P (component_type
)
8775 || SCALAR_FLOAT_TYPE_P (component_type
)
8776 || FIXED_POINT_TYPE_P (component_type
));
8778 /* Make a node of the sort we want. */
8779 t
= make_node (COMPLEX_TYPE
);
8781 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (component_type
);
8783 /* If we already have such a type, use the old one. */
8784 hstate
.add_object (TYPE_HASH (component_type
));
8785 t
= type_hash_canon (hstate
.end (), t
);
8787 if (!COMPLETE_TYPE_P (t
))
8790 if (TYPE_CANONICAL (t
) == t
)
8792 if (TYPE_STRUCTURAL_EQUALITY_P (component_type
))
8793 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8794 else if (TYPE_CANONICAL (component_type
) != component_type
)
8796 = build_complex_type (TYPE_CANONICAL (component_type
));
8799 /* We need to create a name, since complex is a fundamental type. */
8800 if (! TYPE_NAME (t
))
8803 if (component_type
== char_type_node
)
8804 name
= "complex char";
8805 else if (component_type
== signed_char_type_node
)
8806 name
= "complex signed char";
8807 else if (component_type
== unsigned_char_type_node
)
8808 name
= "complex unsigned char";
8809 else if (component_type
== short_integer_type_node
)
8810 name
= "complex short int";
8811 else if (component_type
== short_unsigned_type_node
)
8812 name
= "complex short unsigned int";
8813 else if (component_type
== integer_type_node
)
8814 name
= "complex int";
8815 else if (component_type
== unsigned_type_node
)
8816 name
= "complex unsigned int";
8817 else if (component_type
== long_integer_type_node
)
8818 name
= "complex long int";
8819 else if (component_type
== long_unsigned_type_node
)
8820 name
= "complex long unsigned int";
8821 else if (component_type
== long_long_integer_type_node
)
8822 name
= "complex long long int";
8823 else if (component_type
== long_long_unsigned_type_node
)
8824 name
= "complex long long unsigned int";
8829 TYPE_NAME (t
) = build_decl (UNKNOWN_LOCATION
, TYPE_DECL
,
8830 get_identifier (name
), t
);
8833 return build_qualified_type (t
, TYPE_QUALS (component_type
));
8836 /* If TYPE is a real or complex floating-point type and the target
8837 does not directly support arithmetic on TYPE then return the wider
8838 type to be used for arithmetic on TYPE. Otherwise, return
8842 excess_precision_type (tree type
)
8844 if (flag_excess_precision
!= EXCESS_PRECISION_FAST
)
8846 int flt_eval_method
= TARGET_FLT_EVAL_METHOD
;
8847 switch (TREE_CODE (type
))
8850 switch (flt_eval_method
)
8853 if (TYPE_MODE (type
) == TYPE_MODE (float_type_node
))
8854 return double_type_node
;
8857 if (TYPE_MODE (type
) == TYPE_MODE (float_type_node
)
8858 || TYPE_MODE (type
) == TYPE_MODE (double_type_node
))
8859 return long_double_type_node
;
8866 if (TREE_CODE (TREE_TYPE (type
)) != REAL_TYPE
)
8868 switch (flt_eval_method
)
8871 if (TYPE_MODE (TREE_TYPE (type
)) == TYPE_MODE (float_type_node
))
8872 return complex_double_type_node
;
8875 if (TYPE_MODE (TREE_TYPE (type
)) == TYPE_MODE (float_type_node
)
8876 || (TYPE_MODE (TREE_TYPE (type
))
8877 == TYPE_MODE (double_type_node
)))
8878 return complex_long_double_type_node
;
8891 /* Return OP, stripped of any conversions to wider types as much as is safe.
8892 Converting the value back to OP's type makes a value equivalent to OP.
8894 If FOR_TYPE is nonzero, we return a value which, if converted to
8895 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
8897 OP must have integer, real or enumeral type. Pointers are not allowed!
8899 There are some cases where the obvious value we could return
8900 would regenerate to OP if converted to OP's type,
8901 but would not extend like OP to wider types.
8902 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
8903 For example, if OP is (unsigned short)(signed char)-1,
8904 we avoid returning (signed char)-1 if FOR_TYPE is int,
8905 even though extending that to an unsigned short would regenerate OP,
8906 since the result of extending (signed char)-1 to (int)
8907 is different from (int) OP. */
8910 get_unwidened (tree op
, tree for_type
)
8912 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
8913 tree type
= TREE_TYPE (op
);
8915 = TYPE_PRECISION (for_type
!= 0 ? for_type
: type
);
8917 = (for_type
!= 0 && for_type
!= type
8918 && final_prec
> TYPE_PRECISION (type
)
8919 && TYPE_UNSIGNED (type
));
8922 while (CONVERT_EXPR_P (op
))
8926 /* TYPE_PRECISION on vector types has different meaning
8927 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
8928 so avoid them here. */
8929 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op
, 0))) == VECTOR_TYPE
)
8932 bitschange
= TYPE_PRECISION (TREE_TYPE (op
))
8933 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0)));
8935 /* Truncations are many-one so cannot be removed.
8936 Unless we are later going to truncate down even farther. */
8938 && final_prec
> TYPE_PRECISION (TREE_TYPE (op
)))
8941 /* See what's inside this conversion. If we decide to strip it,
8943 op
= TREE_OPERAND (op
, 0);
8945 /* If we have not stripped any zero-extensions (uns is 0),
8946 we can strip any kind of extension.
8947 If we have previously stripped a zero-extension,
8948 only zero-extensions can safely be stripped.
8949 Any extension can be stripped if the bits it would produce
8950 are all going to be discarded later by truncating to FOR_TYPE. */
8954 if (! uns
|| final_prec
<= TYPE_PRECISION (TREE_TYPE (op
)))
8956 /* TYPE_UNSIGNED says whether this is a zero-extension.
8957 Let's avoid computing it if it does not affect WIN
8958 and if UNS will not be needed again. */
8960 || CONVERT_EXPR_P (op
))
8961 && TYPE_UNSIGNED (TREE_TYPE (op
)))
8969 /* If we finally reach a constant see if it fits in for_type and
8970 in that case convert it. */
8972 && TREE_CODE (win
) == INTEGER_CST
8973 && TREE_TYPE (win
) != for_type
8974 && int_fits_type_p (win
, for_type
))
8975 win
= fold_convert (for_type
, win
);
8980 /* Return OP or a simpler expression for a narrower value
8981 which can be sign-extended or zero-extended to give back OP.
8982 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
8983 or 0 if the value should be sign-extended. */
8986 get_narrower (tree op
, int *unsignedp_ptr
)
8991 bool integral_p
= INTEGRAL_TYPE_P (TREE_TYPE (op
));
8993 while (TREE_CODE (op
) == NOP_EXPR
)
8996 = (TYPE_PRECISION (TREE_TYPE (op
))
8997 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0))));
8999 /* Truncations are many-one so cannot be removed. */
9003 /* See what's inside this conversion. If we decide to strip it,
9008 op
= TREE_OPERAND (op
, 0);
9009 /* An extension: the outermost one can be stripped,
9010 but remember whether it is zero or sign extension. */
9012 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
9013 /* Otherwise, if a sign extension has been stripped,
9014 only sign extensions can now be stripped;
9015 if a zero extension has been stripped, only zero-extensions. */
9016 else if (uns
!= TYPE_UNSIGNED (TREE_TYPE (op
)))
9020 else /* bitschange == 0 */
9022 /* A change in nominal type can always be stripped, but we must
9023 preserve the unsignedness. */
9025 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
9027 op
= TREE_OPERAND (op
, 0);
9028 /* Keep trying to narrow, but don't assign op to win if it
9029 would turn an integral type into something else. */
9030 if (INTEGRAL_TYPE_P (TREE_TYPE (op
)) != integral_p
)
9037 if (TREE_CODE (op
) == COMPONENT_REF
9038 /* Since type_for_size always gives an integer type. */
9039 && TREE_CODE (TREE_TYPE (op
)) != REAL_TYPE
9040 && TREE_CODE (TREE_TYPE (op
)) != FIXED_POINT_TYPE
9041 /* Ensure field is laid out already. */
9042 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0
9043 && tree_fits_uhwi_p (DECL_SIZE (TREE_OPERAND (op
, 1))))
9045 unsigned HOST_WIDE_INT innerprec
9046 = tree_to_uhwi (DECL_SIZE (TREE_OPERAND (op
, 1)));
9047 int unsignedp
= (DECL_UNSIGNED (TREE_OPERAND (op
, 1))
9048 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op
, 1))));
9049 tree type
= lang_hooks
.types
.type_for_size (innerprec
, unsignedp
);
9051 /* We can get this structure field in a narrower type that fits it,
9052 but the resulting extension to its nominal type (a fullword type)
9053 must satisfy the same conditions as for other extensions.
9055 Do this only for fields that are aligned (not bit-fields),
9056 because when bit-field insns will be used there is no
9057 advantage in doing this. */
9059 if (innerprec
< TYPE_PRECISION (TREE_TYPE (op
))
9060 && ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1))
9061 && (first
|| uns
== DECL_UNSIGNED (TREE_OPERAND (op
, 1)))
9065 uns
= DECL_UNSIGNED (TREE_OPERAND (op
, 1));
9066 win
= fold_convert (type
, op
);
9070 *unsignedp_ptr
= uns
;
9074 /* Returns true if integer constant C has a value that is permissible
9075 for type TYPE (an INTEGER_TYPE). */
9078 int_fits_type_p (const_tree c
, const_tree type
)
9080 tree type_low_bound
, type_high_bound
;
9081 bool ok_for_low_bound
, ok_for_high_bound
;
9082 signop sgn_c
= TYPE_SIGN (TREE_TYPE (c
));
9085 type_low_bound
= TYPE_MIN_VALUE (type
);
9086 type_high_bound
= TYPE_MAX_VALUE (type
);
9088 /* If at least one bound of the type is a constant integer, we can check
9089 ourselves and maybe make a decision. If no such decision is possible, but
9090 this type is a subtype, try checking against that. Otherwise, use
9091 fits_to_tree_p, which checks against the precision.
9093 Compute the status for each possibly constant bound, and return if we see
9094 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
9095 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
9096 for "constant known to fit". */
9098 /* Check if c >= type_low_bound. */
9099 if (type_low_bound
&& TREE_CODE (type_low_bound
) == INTEGER_CST
)
9101 if (tree_int_cst_lt (c
, type_low_bound
))
9103 ok_for_low_bound
= true;
9106 ok_for_low_bound
= false;
9108 /* Check if c <= type_high_bound. */
9109 if (type_high_bound
&& TREE_CODE (type_high_bound
) == INTEGER_CST
)
9111 if (tree_int_cst_lt (type_high_bound
, c
))
9113 ok_for_high_bound
= true;
9116 ok_for_high_bound
= false;
9118 /* If the constant fits both bounds, the result is known. */
9119 if (ok_for_low_bound
&& ok_for_high_bound
)
9122 /* Perform some generic filtering which may allow making a decision
9123 even if the bounds are not constant. First, negative integers
9124 never fit in unsigned types, */
9125 if (TYPE_UNSIGNED (type
) && sgn_c
== SIGNED
&& wi::neg_p (c
))
9128 /* Second, narrower types always fit in wider ones. */
9129 if (TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (c
)))
9132 /* Third, unsigned integers with top bit set never fit signed types. */
9133 if (!TYPE_UNSIGNED (type
) && sgn_c
== UNSIGNED
)
9135 int prec
= GET_MODE_PRECISION (TYPE_MODE (TREE_TYPE (c
))) - 1;
9136 if (prec
< TYPE_PRECISION (TREE_TYPE (c
)))
9138 /* When a tree_cst is converted to a wide-int, the precision
9139 is taken from the type. However, if the precision of the
9140 mode underneath the type is smaller than that, it is
9141 possible that the value will not fit. The test below
9142 fails if any bit is set between the sign bit of the
9143 underlying mode and the top bit of the type. */
9144 if (wi::ne_p (wi::zext (c
, prec
- 1), c
))
9147 else if (wi::neg_p (c
))
9151 /* If we haven't been able to decide at this point, there nothing more we
9152 can check ourselves here. Look at the base type if we have one and it
9153 has the same precision. */
9154 if (TREE_CODE (type
) == INTEGER_TYPE
9155 && TREE_TYPE (type
) != 0
9156 && TYPE_PRECISION (type
) == TYPE_PRECISION (TREE_TYPE (type
)))
9158 type
= TREE_TYPE (type
);
9162 /* Or to fits_to_tree_p, if nothing else. */
9163 return wi::fits_to_tree_p (c
, type
);
9166 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
9167 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
9168 represented (assuming two's-complement arithmetic) within the bit
9169 precision of the type are returned instead. */
9172 get_type_static_bounds (const_tree type
, mpz_t min
, mpz_t max
)
9174 if (!POINTER_TYPE_P (type
) && TYPE_MIN_VALUE (type
)
9175 && TREE_CODE (TYPE_MIN_VALUE (type
)) == INTEGER_CST
)
9176 wi::to_mpz (TYPE_MIN_VALUE (type
), min
, TYPE_SIGN (type
));
9179 if (TYPE_UNSIGNED (type
))
9180 mpz_set_ui (min
, 0);
9183 wide_int mn
= wi::min_value (TYPE_PRECISION (type
), SIGNED
);
9184 wi::to_mpz (mn
, min
, SIGNED
);
9188 if (!POINTER_TYPE_P (type
) && TYPE_MAX_VALUE (type
)
9189 && TREE_CODE (TYPE_MAX_VALUE (type
)) == INTEGER_CST
)
9190 wi::to_mpz (TYPE_MAX_VALUE (type
), max
, TYPE_SIGN (type
));
9193 wide_int mn
= wi::max_value (TYPE_PRECISION (type
), TYPE_SIGN (type
));
9194 wi::to_mpz (mn
, max
, TYPE_SIGN (type
));
9198 /* Return true if VAR is an automatic variable defined in function FN. */
9201 auto_var_in_fn_p (const_tree var
, const_tree fn
)
9203 return (DECL_P (var
) && DECL_CONTEXT (var
) == fn
9204 && ((((TREE_CODE (var
) == VAR_DECL
&& ! DECL_EXTERNAL (var
))
9205 || TREE_CODE (var
) == PARM_DECL
)
9206 && ! TREE_STATIC (var
))
9207 || TREE_CODE (var
) == LABEL_DECL
9208 || TREE_CODE (var
) == RESULT_DECL
));
9211 /* Subprogram of following function. Called by walk_tree.
9213 Return *TP if it is an automatic variable or parameter of the
9214 function passed in as DATA. */
9217 find_var_from_fn (tree
*tp
, int *walk_subtrees
, void *data
)
9219 tree fn
= (tree
) data
;
9224 else if (DECL_P (*tp
)
9225 && auto_var_in_fn_p (*tp
, fn
))
9231 /* Returns true if T is, contains, or refers to a type with variable
9232 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
9233 arguments, but not the return type. If FN is nonzero, only return
9234 true if a modifier of the type or position of FN is a variable or
9235 parameter inside FN.
9237 This concept is more general than that of C99 'variably modified types':
9238 in C99, a struct type is never variably modified because a VLA may not
9239 appear as a structure member. However, in GNU C code like:
9241 struct S { int i[f()]; };
9243 is valid, and other languages may define similar constructs. */
9246 variably_modified_type_p (tree type
, tree fn
)
9250 /* Test if T is either variable (if FN is zero) or an expression containing
9251 a variable in FN. If TYPE isn't gimplified, return true also if
9252 gimplify_one_sizepos would gimplify the expression into a local
9254 #define RETURN_TRUE_IF_VAR(T) \
9255 do { tree _t = (T); \
9256 if (_t != NULL_TREE \
9257 && _t != error_mark_node \
9258 && TREE_CODE (_t) != INTEGER_CST \
9259 && TREE_CODE (_t) != PLACEHOLDER_EXPR \
9261 || (!TYPE_SIZES_GIMPLIFIED (type) \
9262 && !is_gimple_sizepos (_t)) \
9263 || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
9264 return true; } while (0)
9266 if (type
== error_mark_node
)
9269 /* If TYPE itself has variable size, it is variably modified. */
9270 RETURN_TRUE_IF_VAR (TYPE_SIZE (type
));
9271 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type
));
9273 switch (TREE_CODE (type
))
9276 case REFERENCE_TYPE
:
9278 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
9284 /* If TYPE is a function type, it is variably modified if the
9285 return type is variably modified. */
9286 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
9292 case FIXED_POINT_TYPE
:
9295 /* Scalar types are variably modified if their end points
9297 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type
));
9298 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type
));
9303 case QUAL_UNION_TYPE
:
9304 /* We can't see if any of the fields are variably-modified by the
9305 definition we normally use, since that would produce infinite
9306 recursion via pointers. */
9307 /* This is variably modified if some field's type is. */
9308 for (t
= TYPE_FIELDS (type
); t
; t
= DECL_CHAIN (t
))
9309 if (TREE_CODE (t
) == FIELD_DECL
)
9311 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t
));
9312 RETURN_TRUE_IF_VAR (DECL_SIZE (t
));
9313 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t
));
9315 if (TREE_CODE (type
) == QUAL_UNION_TYPE
)
9316 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t
));
9321 /* Do not call ourselves to avoid infinite recursion. This is
9322 variably modified if the element type is. */
9323 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type
)));
9324 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type
)));
9331 /* The current language may have other cases to check, but in general,
9332 all other types are not variably modified. */
9333 return lang_hooks
.tree_inlining
.var_mod_type_p (type
, fn
);
9335 #undef RETURN_TRUE_IF_VAR
9338 /* Given a DECL or TYPE, return the scope in which it was declared, or
9339 NULL_TREE if there is no containing scope. */
9342 get_containing_scope (const_tree t
)
9344 return (TYPE_P (t
) ? TYPE_CONTEXT (t
) : DECL_CONTEXT (t
));
9347 /* Return the innermost context enclosing DECL that is
9348 a FUNCTION_DECL, or zero if none. */
9351 decl_function_context (const_tree decl
)
9355 if (TREE_CODE (decl
) == ERROR_MARK
)
9358 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
9359 where we look up the function at runtime. Such functions always take
9360 a first argument of type 'pointer to real context'.
9362 C++ should really be fixed to use DECL_CONTEXT for the real context,
9363 and use something else for the "virtual context". */
9364 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VINDEX (decl
))
9367 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl
)))));
9369 context
= DECL_CONTEXT (decl
);
9371 while (context
&& TREE_CODE (context
) != FUNCTION_DECL
)
9373 if (TREE_CODE (context
) == BLOCK
)
9374 context
= BLOCK_SUPERCONTEXT (context
);
9376 context
= get_containing_scope (context
);
9382 /* Return the innermost context enclosing DECL that is
9383 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
9384 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
9387 decl_type_context (const_tree decl
)
9389 tree context
= DECL_CONTEXT (decl
);
9392 switch (TREE_CODE (context
))
9394 case NAMESPACE_DECL
:
9395 case TRANSLATION_UNIT_DECL
:
9400 case QUAL_UNION_TYPE
:
9405 context
= DECL_CONTEXT (context
);
9409 context
= BLOCK_SUPERCONTEXT (context
);
9419 /* CALL is a CALL_EXPR. Return the declaration for the function
9420 called, or NULL_TREE if the called function cannot be
9424 get_callee_fndecl (const_tree call
)
9428 if (call
== error_mark_node
)
9429 return error_mark_node
;
9431 /* It's invalid to call this function with anything but a
9433 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
9435 /* The first operand to the CALL is the address of the function
9437 addr
= CALL_EXPR_FN (call
);
9439 /* If there is no function, return early. */
9440 if (addr
== NULL_TREE
)
9445 /* If this is a readonly function pointer, extract its initial value. */
9446 if (DECL_P (addr
) && TREE_CODE (addr
) != FUNCTION_DECL
9447 && TREE_READONLY (addr
) && ! TREE_THIS_VOLATILE (addr
)
9448 && DECL_INITIAL (addr
))
9449 addr
= DECL_INITIAL (addr
);
9451 /* If the address is just `&f' for some function `f', then we know
9452 that `f' is being called. */
9453 if (TREE_CODE (addr
) == ADDR_EXPR
9454 && TREE_CODE (TREE_OPERAND (addr
, 0)) == FUNCTION_DECL
)
9455 return TREE_OPERAND (addr
, 0);
9457 /* We couldn't figure out what was being called. */
9461 /* If CALL_EXPR CALL calls a normal built-in function or an internal function,
9462 return the associated function code, otherwise return CFN_LAST. */
9465 get_call_combined_fn (const_tree call
)
9467 /* It's invalid to call this function with anything but a CALL_EXPR. */
9468 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
9470 if (!CALL_EXPR_FN (call
))
9471 return as_combined_fn (CALL_EXPR_IFN (call
));
9473 tree fndecl
= get_callee_fndecl (call
);
9474 if (fndecl
&& DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
)
9475 return as_combined_fn (DECL_FUNCTION_CODE (fndecl
));
9480 #define TREE_MEM_USAGE_SPACES 40
9482 /* Print debugging information about tree nodes generated during the compile,
9483 and any language-specific information. */
9486 dump_tree_statistics (void)
9488 if (GATHER_STATISTICS
)
9491 int total_nodes
, total_bytes
;
9492 fprintf (stderr
, "\nKind Nodes Bytes\n");
9493 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9494 total_nodes
= total_bytes
= 0;
9495 for (i
= 0; i
< (int) all_kinds
; i
++)
9497 fprintf (stderr
, "%-20s %7d %10d\n", tree_node_kind_names
[i
],
9498 tree_node_counts
[i
], tree_node_sizes
[i
]);
9499 total_nodes
+= tree_node_counts
[i
];
9500 total_bytes
+= tree_node_sizes
[i
];
9502 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9503 fprintf (stderr
, "%-20s %7d %10d\n", "Total", total_nodes
, total_bytes
);
9504 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9505 fprintf (stderr
, "Code Nodes\n");
9506 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9507 for (i
= 0; i
< (int) MAX_TREE_CODES
; i
++)
9508 fprintf (stderr
, "%-32s %7d\n", get_tree_code_name ((enum tree_code
) i
),
9509 tree_code_counts
[i
]);
9510 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9511 fprintf (stderr
, "\n");
9512 ssanames_print_statistics ();
9513 fprintf (stderr
, "\n");
9514 phinodes_print_statistics ();
9515 fprintf (stderr
, "\n");
9518 fprintf (stderr
, "(No per-node statistics)\n");
9520 print_type_hash_statistics ();
9521 print_debug_expr_statistics ();
9522 print_value_expr_statistics ();
9523 lang_hooks
.print_statistics ();
9526 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
9528 /* Generate a crc32 of a byte. */
9531 crc32_unsigned_bits (unsigned chksum
, unsigned value
, unsigned bits
)
9535 for (ix
= bits
; ix
--; value
<<= 1)
9539 feedback
= (value
^ chksum
) & 0x80000000 ? 0x04c11db7 : 0;
9546 /* Generate a crc32 of a 32-bit unsigned. */
9549 crc32_unsigned (unsigned chksum
, unsigned value
)
9551 return crc32_unsigned_bits (chksum
, value
, 32);
9554 /* Generate a crc32 of a byte. */
9557 crc32_byte (unsigned chksum
, char byte
)
9559 return crc32_unsigned_bits (chksum
, (unsigned) byte
<< 24, 8);
9562 /* Generate a crc32 of a string. */
9565 crc32_string (unsigned chksum
, const char *string
)
9569 chksum
= crc32_byte (chksum
, *string
);
9575 /* P is a string that will be used in a symbol. Mask out any characters
9576 that are not valid in that context. */
9579 clean_symbol_name (char *p
)
9583 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
9586 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
9593 /* For anonymous aggregate types, we need some sort of name to
9594 hold on to. In practice, this should not appear, but it should
9595 not be harmful if it does. */
9597 anon_aggrname_p(const_tree id_node
)
9599 #ifndef NO_DOT_IN_LABEL
9600 return (IDENTIFIER_POINTER (id_node
)[0] == '.'
9601 && IDENTIFIER_POINTER (id_node
)[1] == '_');
9602 #else /* NO_DOT_IN_LABEL */
9603 #ifndef NO_DOLLAR_IN_LABEL
9604 return (IDENTIFIER_POINTER (id_node
)[0] == '$' \
9605 && IDENTIFIER_POINTER (id_node
)[1] == '_');
9606 #else /* NO_DOLLAR_IN_LABEL */
9607 #define ANON_AGGRNAME_PREFIX "__anon_"
9608 return (!strncmp (IDENTIFIER_POINTER (id_node
), ANON_AGGRNAME_PREFIX
,
9609 sizeof (ANON_AGGRNAME_PREFIX
) - 1));
9610 #endif /* NO_DOLLAR_IN_LABEL */
9611 #endif /* NO_DOT_IN_LABEL */
9614 /* Return a format for an anonymous aggregate name. */
9616 anon_aggrname_format()
9618 #ifndef NO_DOT_IN_LABEL
9620 #else /* NO_DOT_IN_LABEL */
9621 #ifndef NO_DOLLAR_IN_LABEL
9623 #else /* NO_DOLLAR_IN_LABEL */
9625 #endif /* NO_DOLLAR_IN_LABEL */
9626 #endif /* NO_DOT_IN_LABEL */
9629 /* Generate a name for a special-purpose function.
9630 The generated name may need to be unique across the whole link.
9631 Changes to this function may also require corresponding changes to
9632 xstrdup_mask_random.
9633 TYPE is some string to identify the purpose of this function to the
9634 linker or collect2; it must start with an uppercase letter,
9636 I - for constructors
9638 N - for C++ anonymous namespaces
9639 F - for DWARF unwind frame information. */
9642 get_file_function_name (const char *type
)
9648 /* If we already have a name we know to be unique, just use that. */
9649 if (first_global_object_name
)
9650 p
= q
= ASTRDUP (first_global_object_name
);
9651 /* If the target is handling the constructors/destructors, they
9652 will be local to this file and the name is only necessary for
9654 We also assign sub_I and sub_D sufixes to constructors called from
9655 the global static constructors. These are always local. */
9656 else if (((type
[0] == 'I' || type
[0] == 'D') && targetm
.have_ctors_dtors
)
9657 || (strncmp (type
, "sub_", 4) == 0
9658 && (type
[4] == 'I' || type
[4] == 'D')))
9660 const char *file
= main_input_filename
;
9662 file
= LOCATION_FILE (input_location
);
9663 /* Just use the file's basename, because the full pathname
9664 might be quite long. */
9665 p
= q
= ASTRDUP (lbasename (file
));
9669 /* Otherwise, the name must be unique across the entire link.
9670 We don't have anything that we know to be unique to this translation
9671 unit, so use what we do have and throw in some randomness. */
9673 const char *name
= weak_global_object_name
;
9674 const char *file
= main_input_filename
;
9679 file
= LOCATION_FILE (input_location
);
9681 len
= strlen (file
);
9682 q
= (char *) alloca (9 + 17 + len
+ 1);
9683 memcpy (q
, file
, len
+ 1);
9685 snprintf (q
+ len
, 9 + 17 + 1, "_%08X_" HOST_WIDE_INT_PRINT_HEX
,
9686 crc32_string (0, name
), get_random_seed (false));
9691 clean_symbol_name (q
);
9692 buf
= (char *) alloca (sizeof (FILE_FUNCTION_FORMAT
) + strlen (p
)
9695 /* Set up the name of the file-level functions we may need.
9696 Use a global object (which is already required to be unique over
9697 the program) rather than the file name (which imposes extra
9699 sprintf (buf
, FILE_FUNCTION_FORMAT
, type
, p
);
9701 return get_identifier (buf
);
9704 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
9706 /* Complain that the tree code of NODE does not match the expected 0
9707 terminated list of trailing codes. The trailing code list can be
9708 empty, for a more vague error message. FILE, LINE, and FUNCTION
9709 are of the caller. */
9712 tree_check_failed (const_tree node
, const char *file
,
9713 int line
, const char *function
, ...)
9717 unsigned length
= 0;
9718 enum tree_code code
;
9720 va_start (args
, function
);
9721 while ((code
= (enum tree_code
) va_arg (args
, int)))
9722 length
+= 4 + strlen (get_tree_code_name (code
));
9727 va_start (args
, function
);
9728 length
+= strlen ("expected ");
9729 buffer
= tmp
= (char *) alloca (length
);
9731 while ((code
= (enum tree_code
) va_arg (args
, int)))
9733 const char *prefix
= length
? " or " : "expected ";
9735 strcpy (tmp
+ length
, prefix
);
9736 length
+= strlen (prefix
);
9737 strcpy (tmp
+ length
, get_tree_code_name (code
));
9738 length
+= strlen (get_tree_code_name (code
));
9743 buffer
= "unexpected node";
9745 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9746 buffer
, get_tree_code_name (TREE_CODE (node
)),
9747 function
, trim_filename (file
), line
);
9750 /* Complain that the tree code of NODE does match the expected 0
9751 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
9755 tree_not_check_failed (const_tree node
, const char *file
,
9756 int line
, const char *function
, ...)
9760 unsigned length
= 0;
9761 enum tree_code code
;
9763 va_start (args
, function
);
9764 while ((code
= (enum tree_code
) va_arg (args
, int)))
9765 length
+= 4 + strlen (get_tree_code_name (code
));
9767 va_start (args
, function
);
9768 buffer
= (char *) alloca (length
);
9770 while ((code
= (enum tree_code
) va_arg (args
, int)))
9774 strcpy (buffer
+ length
, " or ");
9777 strcpy (buffer
+ length
, get_tree_code_name (code
));
9778 length
+= strlen (get_tree_code_name (code
));
9782 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
9783 buffer
, get_tree_code_name (TREE_CODE (node
)),
9784 function
, trim_filename (file
), line
);
9787 /* Similar to tree_check_failed, except that we check for a class of tree
9788 code, given in CL. */
9791 tree_class_check_failed (const_tree node
, const enum tree_code_class cl
,
9792 const char *file
, int line
, const char *function
)
9795 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
9796 TREE_CODE_CLASS_STRING (cl
),
9797 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
9798 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9801 /* Similar to tree_check_failed, except that instead of specifying a
9802 dozen codes, use the knowledge that they're all sequential. */
9805 tree_range_check_failed (const_tree node
, const char *file
, int line
,
9806 const char *function
, enum tree_code c1
,
9810 unsigned length
= 0;
9813 for (c
= c1
; c
<= c2
; ++c
)
9814 length
+= 4 + strlen (get_tree_code_name ((enum tree_code
) c
));
9816 length
+= strlen ("expected ");
9817 buffer
= (char *) alloca (length
);
9820 for (c
= c1
; c
<= c2
; ++c
)
9822 const char *prefix
= length
? " or " : "expected ";
9824 strcpy (buffer
+ length
, prefix
);
9825 length
+= strlen (prefix
);
9826 strcpy (buffer
+ length
, get_tree_code_name ((enum tree_code
) c
));
9827 length
+= strlen (get_tree_code_name ((enum tree_code
) c
));
9830 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9831 buffer
, get_tree_code_name (TREE_CODE (node
)),
9832 function
, trim_filename (file
), line
);
9836 /* Similar to tree_check_failed, except that we check that a tree does
9837 not have the specified code, given in CL. */
9840 tree_not_class_check_failed (const_tree node
, const enum tree_code_class cl
,
9841 const char *file
, int line
, const char *function
)
9844 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
9845 TREE_CODE_CLASS_STRING (cl
),
9846 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
9847 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9851 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
9854 omp_clause_check_failed (const_tree node
, const char *file
, int line
,
9855 const char *function
, enum omp_clause_code code
)
9857 internal_error ("tree check: expected omp_clause %s, have %s in %s, at %s:%d",
9858 omp_clause_code_name
[code
], get_tree_code_name (TREE_CODE (node
)),
9859 function
, trim_filename (file
), line
);
9863 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
9866 omp_clause_range_check_failed (const_tree node
, const char *file
, int line
,
9867 const char *function
, enum omp_clause_code c1
,
9868 enum omp_clause_code c2
)
9871 unsigned length
= 0;
9874 for (c
= c1
; c
<= c2
; ++c
)
9875 length
+= 4 + strlen (omp_clause_code_name
[c
]);
9877 length
+= strlen ("expected ");
9878 buffer
= (char *) alloca (length
);
9881 for (c
= c1
; c
<= c2
; ++c
)
9883 const char *prefix
= length
? " or " : "expected ";
9885 strcpy (buffer
+ length
, prefix
);
9886 length
+= strlen (prefix
);
9887 strcpy (buffer
+ length
, omp_clause_code_name
[c
]);
9888 length
+= strlen (omp_clause_code_name
[c
]);
9891 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9892 buffer
, omp_clause_code_name
[TREE_CODE (node
)],
9893 function
, trim_filename (file
), line
);
9897 #undef DEFTREESTRUCT
9898 #define DEFTREESTRUCT(VAL, NAME) NAME,
9900 static const char *ts_enum_names
[] = {
9901 #include "treestruct.def"
9903 #undef DEFTREESTRUCT
9905 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
9907 /* Similar to tree_class_check_failed, except that we check for
9908 whether CODE contains the tree structure identified by EN. */
9911 tree_contains_struct_check_failed (const_tree node
,
9912 const enum tree_node_structure_enum en
,
9913 const char *file
, int line
,
9914 const char *function
)
9917 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
9919 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9923 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9924 (dynamically sized) vector. */
9927 tree_int_cst_elt_check_failed (int idx
, int len
, const char *file
, int line
,
9928 const char *function
)
9931 ("tree check: accessed elt %d of tree_int_cst with %d elts in %s, at %s:%d",
9932 idx
+ 1, len
, function
, trim_filename (file
), line
);
9935 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9936 (dynamically sized) vector. */
9939 tree_vec_elt_check_failed (int idx
, int len
, const char *file
, int line
,
9940 const char *function
)
9943 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
9944 idx
+ 1, len
, function
, trim_filename (file
), line
);
9947 /* Similar to above, except that the check is for the bounds of the operand
9948 vector of an expression node EXP. */
9951 tree_operand_check_failed (int idx
, const_tree exp
, const char *file
,
9952 int line
, const char *function
)
9954 enum tree_code code
= TREE_CODE (exp
);
9956 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
9957 idx
+ 1, get_tree_code_name (code
), TREE_OPERAND_LENGTH (exp
),
9958 function
, trim_filename (file
), line
);
9961 /* Similar to above, except that the check is for the number of
9962 operands of an OMP_CLAUSE node. */
9965 omp_clause_operand_check_failed (int idx
, const_tree t
, const char *file
,
9966 int line
, const char *function
)
9969 ("tree check: accessed operand %d of omp_clause %s with %d operands "
9970 "in %s, at %s:%d", idx
+ 1, omp_clause_code_name
[OMP_CLAUSE_CODE (t
)],
9971 omp_clause_num_ops
[OMP_CLAUSE_CODE (t
)], function
,
9972 trim_filename (file
), line
);
9974 #endif /* ENABLE_TREE_CHECKING */
9976 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
9977 and mapped to the machine mode MODE. Initialize its fields and build
9978 the information necessary for debugging output. */
9981 make_vector_type (tree innertype
, int nunits
, machine_mode mode
)
9984 inchash::hash hstate
;
9985 tree mv_innertype
= TYPE_MAIN_VARIANT (innertype
);
9987 t
= make_node (VECTOR_TYPE
);
9988 TREE_TYPE (t
) = mv_innertype
;
9989 SET_TYPE_VECTOR_SUBPARTS (t
, nunits
);
9990 SET_TYPE_MODE (t
, mode
);
9992 if (TYPE_STRUCTURAL_EQUALITY_P (mv_innertype
) || in_lto_p
)
9993 SET_TYPE_STRUCTURAL_EQUALITY (t
);
9994 else if ((TYPE_CANONICAL (mv_innertype
) != innertype
9995 || mode
!= VOIDmode
)
9996 && !VECTOR_BOOLEAN_TYPE_P (t
))
9998 = make_vector_type (TYPE_CANONICAL (mv_innertype
), nunits
, VOIDmode
);
10002 hstate
.add_wide_int (VECTOR_TYPE
);
10003 hstate
.add_wide_int (nunits
);
10004 hstate
.add_wide_int (mode
);
10005 hstate
.add_object (TYPE_HASH (TREE_TYPE (t
)));
10006 t
= type_hash_canon (hstate
.end (), t
);
10008 /* We have built a main variant, based on the main variant of the
10009 inner type. Use it to build the variant we return. */
10010 if ((TYPE_ATTRIBUTES (innertype
) || TYPE_QUALS (innertype
))
10011 && TREE_TYPE (t
) != innertype
)
10012 return build_type_attribute_qual_variant (t
,
10013 TYPE_ATTRIBUTES (innertype
),
10014 TYPE_QUALS (innertype
));
10020 make_or_reuse_type (unsigned size
, int unsignedp
)
10024 if (size
== INT_TYPE_SIZE
)
10025 return unsignedp
? unsigned_type_node
: integer_type_node
;
10026 if (size
== CHAR_TYPE_SIZE
)
10027 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
10028 if (size
== SHORT_TYPE_SIZE
)
10029 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
10030 if (size
== LONG_TYPE_SIZE
)
10031 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
10032 if (size
== LONG_LONG_TYPE_SIZE
)
10033 return (unsignedp
? long_long_unsigned_type_node
10034 : long_long_integer_type_node
);
10036 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
10037 if (size
== int_n_data
[i
].bitsize
10038 && int_n_enabled_p
[i
])
10039 return (unsignedp
? int_n_trees
[i
].unsigned_type
10040 : int_n_trees
[i
].signed_type
);
10043 return make_unsigned_type (size
);
10045 return make_signed_type (size
);
10048 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
10051 make_or_reuse_fract_type (unsigned size
, int unsignedp
, int satp
)
10055 if (size
== SHORT_FRACT_TYPE_SIZE
)
10056 return unsignedp
? sat_unsigned_short_fract_type_node
10057 : sat_short_fract_type_node
;
10058 if (size
== FRACT_TYPE_SIZE
)
10059 return unsignedp
? sat_unsigned_fract_type_node
: sat_fract_type_node
;
10060 if (size
== LONG_FRACT_TYPE_SIZE
)
10061 return unsignedp
? sat_unsigned_long_fract_type_node
10062 : sat_long_fract_type_node
;
10063 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
10064 return unsignedp
? sat_unsigned_long_long_fract_type_node
10065 : sat_long_long_fract_type_node
;
10069 if (size
== SHORT_FRACT_TYPE_SIZE
)
10070 return unsignedp
? unsigned_short_fract_type_node
10071 : short_fract_type_node
;
10072 if (size
== FRACT_TYPE_SIZE
)
10073 return unsignedp
? unsigned_fract_type_node
: fract_type_node
;
10074 if (size
== LONG_FRACT_TYPE_SIZE
)
10075 return unsignedp
? unsigned_long_fract_type_node
10076 : long_fract_type_node
;
10077 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
10078 return unsignedp
? unsigned_long_long_fract_type_node
10079 : long_long_fract_type_node
;
10082 return make_fract_type (size
, unsignedp
, satp
);
10085 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
10088 make_or_reuse_accum_type (unsigned size
, int unsignedp
, int satp
)
10092 if (size
== SHORT_ACCUM_TYPE_SIZE
)
10093 return unsignedp
? sat_unsigned_short_accum_type_node
10094 : sat_short_accum_type_node
;
10095 if (size
== ACCUM_TYPE_SIZE
)
10096 return unsignedp
? sat_unsigned_accum_type_node
: sat_accum_type_node
;
10097 if (size
== LONG_ACCUM_TYPE_SIZE
)
10098 return unsignedp
? sat_unsigned_long_accum_type_node
10099 : sat_long_accum_type_node
;
10100 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
10101 return unsignedp
? sat_unsigned_long_long_accum_type_node
10102 : sat_long_long_accum_type_node
;
10106 if (size
== SHORT_ACCUM_TYPE_SIZE
)
10107 return unsignedp
? unsigned_short_accum_type_node
10108 : short_accum_type_node
;
10109 if (size
== ACCUM_TYPE_SIZE
)
10110 return unsignedp
? unsigned_accum_type_node
: accum_type_node
;
10111 if (size
== LONG_ACCUM_TYPE_SIZE
)
10112 return unsignedp
? unsigned_long_accum_type_node
10113 : long_accum_type_node
;
10114 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
10115 return unsignedp
? unsigned_long_long_accum_type_node
10116 : long_long_accum_type_node
;
10119 return make_accum_type (size
, unsignedp
, satp
);
10123 /* Create an atomic variant node for TYPE. This routine is called
10124 during initialization of data types to create the 5 basic atomic
10125 types. The generic build_variant_type function requires these to
10126 already be set up in order to function properly, so cannot be
10127 called from there. If ALIGN is non-zero, then ensure alignment is
10128 overridden to this value. */
10131 build_atomic_base (tree type
, unsigned int align
)
10135 /* Make sure its not already registered. */
10136 if ((t
= get_qualified_type (type
, TYPE_QUAL_ATOMIC
)))
10139 t
= build_variant_type_copy (type
);
10140 set_type_quals (t
, TYPE_QUAL_ATOMIC
);
10143 SET_TYPE_ALIGN (t
, align
);
10148 /* Create nodes for all integer types (and error_mark_node) using the sizes
10149 of C datatypes. SIGNED_CHAR specifies whether char is signed. */
10152 build_common_tree_nodes (bool signed_char
)
10156 error_mark_node
= make_node (ERROR_MARK
);
10157 TREE_TYPE (error_mark_node
) = error_mark_node
;
10159 initialize_sizetypes ();
10161 /* Define both `signed char' and `unsigned char'. */
10162 signed_char_type_node
= make_signed_type (CHAR_TYPE_SIZE
);
10163 TYPE_STRING_FLAG (signed_char_type_node
) = 1;
10164 unsigned_char_type_node
= make_unsigned_type (CHAR_TYPE_SIZE
);
10165 TYPE_STRING_FLAG (unsigned_char_type_node
) = 1;
10167 /* Define `char', which is like either `signed char' or `unsigned char'
10168 but not the same as either. */
10171 ? make_signed_type (CHAR_TYPE_SIZE
)
10172 : make_unsigned_type (CHAR_TYPE_SIZE
));
10173 TYPE_STRING_FLAG (char_type_node
) = 1;
10175 short_integer_type_node
= make_signed_type (SHORT_TYPE_SIZE
);
10176 short_unsigned_type_node
= make_unsigned_type (SHORT_TYPE_SIZE
);
10177 integer_type_node
= make_signed_type (INT_TYPE_SIZE
);
10178 unsigned_type_node
= make_unsigned_type (INT_TYPE_SIZE
);
10179 long_integer_type_node
= make_signed_type (LONG_TYPE_SIZE
);
10180 long_unsigned_type_node
= make_unsigned_type (LONG_TYPE_SIZE
);
10181 long_long_integer_type_node
= make_signed_type (LONG_LONG_TYPE_SIZE
);
10182 long_long_unsigned_type_node
= make_unsigned_type (LONG_LONG_TYPE_SIZE
);
10184 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
10186 int_n_trees
[i
].signed_type
= make_signed_type (int_n_data
[i
].bitsize
);
10187 int_n_trees
[i
].unsigned_type
= make_unsigned_type (int_n_data
[i
].bitsize
);
10188 TYPE_SIZE (int_n_trees
[i
].signed_type
) = bitsize_int (int_n_data
[i
].bitsize
);
10189 TYPE_SIZE (int_n_trees
[i
].unsigned_type
) = bitsize_int (int_n_data
[i
].bitsize
);
10191 if (int_n_data
[i
].bitsize
> LONG_LONG_TYPE_SIZE
10192 && int_n_enabled_p
[i
])
10194 integer_types
[itk_intN_0
+ i
* 2] = int_n_trees
[i
].signed_type
;
10195 integer_types
[itk_unsigned_intN_0
+ i
* 2] = int_n_trees
[i
].unsigned_type
;
10199 /* Define a boolean type. This type only represents boolean values but
10200 may be larger than char depending on the value of BOOL_TYPE_SIZE. */
10201 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
10202 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
10203 TYPE_PRECISION (boolean_type_node
) = 1;
10204 TYPE_MAX_VALUE (boolean_type_node
) = build_int_cst (boolean_type_node
, 1);
10206 /* Define what type to use for size_t. */
10207 if (strcmp (SIZE_TYPE
, "unsigned int") == 0)
10208 size_type_node
= unsigned_type_node
;
10209 else if (strcmp (SIZE_TYPE
, "long unsigned int") == 0)
10210 size_type_node
= long_unsigned_type_node
;
10211 else if (strcmp (SIZE_TYPE
, "long long unsigned int") == 0)
10212 size_type_node
= long_long_unsigned_type_node
;
10213 else if (strcmp (SIZE_TYPE
, "short unsigned int") == 0)
10214 size_type_node
= short_unsigned_type_node
;
10219 size_type_node
= NULL_TREE
;
10220 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
10221 if (int_n_enabled_p
[i
])
10224 sprintf (name
, "__int%d unsigned", int_n_data
[i
].bitsize
);
10226 if (strcmp (name
, SIZE_TYPE
) == 0)
10228 size_type_node
= int_n_trees
[i
].unsigned_type
;
10231 if (size_type_node
== NULL_TREE
)
10232 gcc_unreachable ();
10235 /* Fill in the rest of the sized types. Reuse existing type nodes
10237 intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 0);
10238 intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 0);
10239 intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 0);
10240 intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 0);
10241 intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 0);
10243 unsigned_intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 1);
10244 unsigned_intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 1);
10245 unsigned_intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 1);
10246 unsigned_intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 1);
10247 unsigned_intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 1);
10249 /* Don't call build_qualified type for atomics. That routine does
10250 special processing for atomics, and until they are initialized
10251 it's better not to make that call.
10253 Check to see if there is a target override for atomic types. */
10255 atomicQI_type_node
= build_atomic_base (unsigned_intQI_type_node
,
10256 targetm
.atomic_align_for_mode (QImode
));
10257 atomicHI_type_node
= build_atomic_base (unsigned_intHI_type_node
,
10258 targetm
.atomic_align_for_mode (HImode
));
10259 atomicSI_type_node
= build_atomic_base (unsigned_intSI_type_node
,
10260 targetm
.atomic_align_for_mode (SImode
));
10261 atomicDI_type_node
= build_atomic_base (unsigned_intDI_type_node
,
10262 targetm
.atomic_align_for_mode (DImode
));
10263 atomicTI_type_node
= build_atomic_base (unsigned_intTI_type_node
,
10264 targetm
.atomic_align_for_mode (TImode
));
10266 access_public_node
= get_identifier ("public");
10267 access_protected_node
= get_identifier ("protected");
10268 access_private_node
= get_identifier ("private");
10270 /* Define these next since types below may used them. */
10271 integer_zero_node
= build_int_cst (integer_type_node
, 0);
10272 integer_one_node
= build_int_cst (integer_type_node
, 1);
10273 integer_three_node
= build_int_cst (integer_type_node
, 3);
10274 integer_minus_one_node
= build_int_cst (integer_type_node
, -1);
10276 size_zero_node
= size_int (0);
10277 size_one_node
= size_int (1);
10278 bitsize_zero_node
= bitsize_int (0);
10279 bitsize_one_node
= bitsize_int (1);
10280 bitsize_unit_node
= bitsize_int (BITS_PER_UNIT
);
10282 boolean_false_node
= TYPE_MIN_VALUE (boolean_type_node
);
10283 boolean_true_node
= TYPE_MAX_VALUE (boolean_type_node
);
10285 void_type_node
= make_node (VOID_TYPE
);
10286 layout_type (void_type_node
);
10288 pointer_bounds_type_node
= targetm
.chkp_bound_type ();
10290 /* We are not going to have real types in C with less than byte alignment,
10291 so we might as well not have any types that claim to have it. */
10292 SET_TYPE_ALIGN (void_type_node
, BITS_PER_UNIT
);
10293 TYPE_USER_ALIGN (void_type_node
) = 0;
10295 void_node
= make_node (VOID_CST
);
10296 TREE_TYPE (void_node
) = void_type_node
;
10298 null_pointer_node
= build_int_cst (build_pointer_type (void_type_node
), 0);
10299 layout_type (TREE_TYPE (null_pointer_node
));
10301 ptr_type_node
= build_pointer_type (void_type_node
);
10302 const_ptr_type_node
10303 = build_pointer_type (build_type_variant (void_type_node
, 1, 0));
10304 fileptr_type_node
= ptr_type_node
;
10306 pointer_sized_int_node
= build_nonstandard_integer_type (POINTER_SIZE
, 1);
10308 float_type_node
= make_node (REAL_TYPE
);
10309 TYPE_PRECISION (float_type_node
) = FLOAT_TYPE_SIZE
;
10310 layout_type (float_type_node
);
10312 double_type_node
= make_node (REAL_TYPE
);
10313 TYPE_PRECISION (double_type_node
) = DOUBLE_TYPE_SIZE
;
10314 layout_type (double_type_node
);
10316 long_double_type_node
= make_node (REAL_TYPE
);
10317 TYPE_PRECISION (long_double_type_node
) = LONG_DOUBLE_TYPE_SIZE
;
10318 layout_type (long_double_type_node
);
10320 float_ptr_type_node
= build_pointer_type (float_type_node
);
10321 double_ptr_type_node
= build_pointer_type (double_type_node
);
10322 long_double_ptr_type_node
= build_pointer_type (long_double_type_node
);
10323 integer_ptr_type_node
= build_pointer_type (integer_type_node
);
10325 /* Fixed size integer types. */
10326 uint16_type_node
= make_or_reuse_type (16, 1);
10327 uint32_type_node
= make_or_reuse_type (32, 1);
10328 uint64_type_node
= make_or_reuse_type (64, 1);
10330 /* Decimal float types. */
10331 dfloat32_type_node
= make_node (REAL_TYPE
);
10332 TYPE_PRECISION (dfloat32_type_node
) = DECIMAL32_TYPE_SIZE
;
10333 layout_type (dfloat32_type_node
);
10334 SET_TYPE_MODE (dfloat32_type_node
, SDmode
);
10335 dfloat32_ptr_type_node
= build_pointer_type (dfloat32_type_node
);
10337 dfloat64_type_node
= make_node (REAL_TYPE
);
10338 TYPE_PRECISION (dfloat64_type_node
) = DECIMAL64_TYPE_SIZE
;
10339 layout_type (dfloat64_type_node
);
10340 SET_TYPE_MODE (dfloat64_type_node
, DDmode
);
10341 dfloat64_ptr_type_node
= build_pointer_type (dfloat64_type_node
);
10343 dfloat128_type_node
= make_node (REAL_TYPE
);
10344 TYPE_PRECISION (dfloat128_type_node
) = DECIMAL128_TYPE_SIZE
;
10345 layout_type (dfloat128_type_node
);
10346 SET_TYPE_MODE (dfloat128_type_node
, TDmode
);
10347 dfloat128_ptr_type_node
= build_pointer_type (dfloat128_type_node
);
10349 complex_integer_type_node
= build_complex_type (integer_type_node
);
10350 complex_float_type_node
= build_complex_type (float_type_node
);
10351 complex_double_type_node
= build_complex_type (double_type_node
);
10352 complex_long_double_type_node
= build_complex_type (long_double_type_node
);
10354 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
10355 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
10356 sat_ ## KIND ## _type_node = \
10357 make_sat_signed_ ## KIND ## _type (SIZE); \
10358 sat_unsigned_ ## KIND ## _type_node = \
10359 make_sat_unsigned_ ## KIND ## _type (SIZE); \
10360 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
10361 unsigned_ ## KIND ## _type_node = \
10362 make_unsigned_ ## KIND ## _type (SIZE);
10364 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
10365 sat_ ## WIDTH ## KIND ## _type_node = \
10366 make_sat_signed_ ## KIND ## _type (SIZE); \
10367 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
10368 make_sat_unsigned_ ## KIND ## _type (SIZE); \
10369 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
10370 unsigned_ ## WIDTH ## KIND ## _type_node = \
10371 make_unsigned_ ## KIND ## _type (SIZE);
10373 /* Make fixed-point type nodes based on four different widths. */
10374 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
10375 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
10376 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
10377 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
10378 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
10380 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
10381 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
10382 NAME ## _type_node = \
10383 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
10384 u ## NAME ## _type_node = \
10385 make_or_reuse_unsigned_ ## KIND ## _type \
10386 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
10387 sat_ ## NAME ## _type_node = \
10388 make_or_reuse_sat_signed_ ## KIND ## _type \
10389 (GET_MODE_BITSIZE (MODE ## mode)); \
10390 sat_u ## NAME ## _type_node = \
10391 make_or_reuse_sat_unsigned_ ## KIND ## _type \
10392 (GET_MODE_BITSIZE (U ## MODE ## mode));
10394 /* Fixed-point type and mode nodes. */
10395 MAKE_FIXED_TYPE_NODE_FAMILY (fract
, FRACT
)
10396 MAKE_FIXED_TYPE_NODE_FAMILY (accum
, ACCUM
)
10397 MAKE_FIXED_MODE_NODE (fract
, qq
, QQ
)
10398 MAKE_FIXED_MODE_NODE (fract
, hq
, HQ
)
10399 MAKE_FIXED_MODE_NODE (fract
, sq
, SQ
)
10400 MAKE_FIXED_MODE_NODE (fract
, dq
, DQ
)
10401 MAKE_FIXED_MODE_NODE (fract
, tq
, TQ
)
10402 MAKE_FIXED_MODE_NODE (accum
, ha
, HA
)
10403 MAKE_FIXED_MODE_NODE (accum
, sa
, SA
)
10404 MAKE_FIXED_MODE_NODE (accum
, da
, DA
)
10405 MAKE_FIXED_MODE_NODE (accum
, ta
, TA
)
10408 tree t
= targetm
.build_builtin_va_list ();
10410 /* Many back-ends define record types without setting TYPE_NAME.
10411 If we copied the record type here, we'd keep the original
10412 record type without a name. This breaks name mangling. So,
10413 don't copy record types and let c_common_nodes_and_builtins()
10414 declare the type to be __builtin_va_list. */
10415 if (TREE_CODE (t
) != RECORD_TYPE
)
10416 t
= build_variant_type_copy (t
);
10418 va_list_type_node
= t
;
10422 /* Modify DECL for given flags.
10423 TM_PURE attribute is set only on types, so the function will modify
10424 DECL's type when ECF_TM_PURE is used. */
10427 set_call_expr_flags (tree decl
, int flags
)
10429 if (flags
& ECF_NOTHROW
)
10430 TREE_NOTHROW (decl
) = 1;
10431 if (flags
& ECF_CONST
)
10432 TREE_READONLY (decl
) = 1;
10433 if (flags
& ECF_PURE
)
10434 DECL_PURE_P (decl
) = 1;
10435 if (flags
& ECF_LOOPING_CONST_OR_PURE
)
10436 DECL_LOOPING_CONST_OR_PURE_P (decl
) = 1;
10437 if (flags
& ECF_NOVOPS
)
10438 DECL_IS_NOVOPS (decl
) = 1;
10439 if (flags
& ECF_NORETURN
)
10440 TREE_THIS_VOLATILE (decl
) = 1;
10441 if (flags
& ECF_MALLOC
)
10442 DECL_IS_MALLOC (decl
) = 1;
10443 if (flags
& ECF_RETURNS_TWICE
)
10444 DECL_IS_RETURNS_TWICE (decl
) = 1;
10445 if (flags
& ECF_LEAF
)
10446 DECL_ATTRIBUTES (decl
) = tree_cons (get_identifier ("leaf"),
10447 NULL
, DECL_ATTRIBUTES (decl
));
10448 if ((flags
& ECF_TM_PURE
) && flag_tm
)
10449 apply_tm_attr (decl
, get_identifier ("transaction_pure"));
10450 /* Looping const or pure is implied by noreturn.
10451 There is currently no way to declare looping const or looping pure alone. */
10452 gcc_assert (!(flags
& ECF_LOOPING_CONST_OR_PURE
)
10453 || ((flags
& ECF_NORETURN
) && (flags
& (ECF_CONST
| ECF_PURE
))));
10457 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
10460 local_define_builtin (const char *name
, tree type
, enum built_in_function code
,
10461 const char *library_name
, int ecf_flags
)
10465 decl
= add_builtin_function (name
, type
, code
, BUILT_IN_NORMAL
,
10466 library_name
, NULL_TREE
);
10467 set_call_expr_flags (decl
, ecf_flags
);
10469 set_builtin_decl (code
, decl
, true);
10472 /* Call this function after instantiating all builtins that the language
10473 front end cares about. This will build the rest of the builtins
10474 and internal functions that are relied upon by the tree optimizers and
10478 build_common_builtin_nodes (void)
10483 if (!builtin_decl_explicit_p (BUILT_IN_UNREACHABLE
))
10485 ftype
= build_function_type (void_type_node
, void_list_node
);
10486 local_define_builtin ("__builtin_unreachable", ftype
, BUILT_IN_UNREACHABLE
,
10487 "__builtin_unreachable",
10488 ECF_NOTHROW
| ECF_LEAF
| ECF_NORETURN
10492 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
)
10493 || !builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
10495 ftype
= build_function_type_list (ptr_type_node
,
10496 ptr_type_node
, const_ptr_type_node
,
10497 size_type_node
, NULL_TREE
);
10499 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
))
10500 local_define_builtin ("__builtin_memcpy", ftype
, BUILT_IN_MEMCPY
,
10501 "memcpy", ECF_NOTHROW
| ECF_LEAF
);
10502 if (!builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
10503 local_define_builtin ("__builtin_memmove", ftype
, BUILT_IN_MEMMOVE
,
10504 "memmove", ECF_NOTHROW
| ECF_LEAF
);
10507 if (!builtin_decl_explicit_p (BUILT_IN_MEMCMP
))
10509 ftype
= build_function_type_list (integer_type_node
, const_ptr_type_node
,
10510 const_ptr_type_node
, size_type_node
,
10512 local_define_builtin ("__builtin_memcmp", ftype
, BUILT_IN_MEMCMP
,
10513 "memcmp", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10516 if (!builtin_decl_explicit_p (BUILT_IN_MEMSET
))
10518 ftype
= build_function_type_list (ptr_type_node
,
10519 ptr_type_node
, integer_type_node
,
10520 size_type_node
, NULL_TREE
);
10521 local_define_builtin ("__builtin_memset", ftype
, BUILT_IN_MEMSET
,
10522 "memset", ECF_NOTHROW
| ECF_LEAF
);
10525 if (!builtin_decl_explicit_p (BUILT_IN_ALLOCA
))
10527 ftype
= build_function_type_list (ptr_type_node
,
10528 size_type_node
, NULL_TREE
);
10529 local_define_builtin ("__builtin_alloca", ftype
, BUILT_IN_ALLOCA
,
10530 "alloca", ECF_MALLOC
| ECF_NOTHROW
| ECF_LEAF
);
10533 ftype
= build_function_type_list (ptr_type_node
, size_type_node
,
10534 size_type_node
, NULL_TREE
);
10535 local_define_builtin ("__builtin_alloca_with_align", ftype
,
10536 BUILT_IN_ALLOCA_WITH_ALIGN
,
10537 "__builtin_alloca_with_align",
10538 ECF_MALLOC
| ECF_NOTHROW
| ECF_LEAF
);
10540 /* If we're checking the stack, `alloca' can throw. */
10541 if (flag_stack_check
)
10543 TREE_NOTHROW (builtin_decl_explicit (BUILT_IN_ALLOCA
)) = 0;
10544 TREE_NOTHROW (builtin_decl_explicit (BUILT_IN_ALLOCA_WITH_ALIGN
)) = 0;
10547 ftype
= build_function_type_list (void_type_node
,
10548 ptr_type_node
, ptr_type_node
,
10549 ptr_type_node
, NULL_TREE
);
10550 local_define_builtin ("__builtin_init_trampoline", ftype
,
10551 BUILT_IN_INIT_TRAMPOLINE
,
10552 "__builtin_init_trampoline", ECF_NOTHROW
| ECF_LEAF
);
10553 local_define_builtin ("__builtin_init_heap_trampoline", ftype
,
10554 BUILT_IN_INIT_HEAP_TRAMPOLINE
,
10555 "__builtin_init_heap_trampoline",
10556 ECF_NOTHROW
| ECF_LEAF
);
10558 ftype
= build_function_type_list (ptr_type_node
, ptr_type_node
, NULL_TREE
);
10559 local_define_builtin ("__builtin_adjust_trampoline", ftype
,
10560 BUILT_IN_ADJUST_TRAMPOLINE
,
10561 "__builtin_adjust_trampoline",
10562 ECF_CONST
| ECF_NOTHROW
);
10564 ftype
= build_function_type_list (void_type_node
,
10565 ptr_type_node
, ptr_type_node
, NULL_TREE
);
10566 local_define_builtin ("__builtin_nonlocal_goto", ftype
,
10567 BUILT_IN_NONLOCAL_GOTO
,
10568 "__builtin_nonlocal_goto",
10569 ECF_NORETURN
| ECF_NOTHROW
);
10571 ftype
= build_function_type_list (void_type_node
,
10572 ptr_type_node
, ptr_type_node
, NULL_TREE
);
10573 local_define_builtin ("__builtin_setjmp_setup", ftype
,
10574 BUILT_IN_SETJMP_SETUP
,
10575 "__builtin_setjmp_setup", ECF_NOTHROW
);
10577 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10578 local_define_builtin ("__builtin_setjmp_receiver", ftype
,
10579 BUILT_IN_SETJMP_RECEIVER
,
10580 "__builtin_setjmp_receiver", ECF_NOTHROW
| ECF_LEAF
);
10582 ftype
= build_function_type_list (ptr_type_node
, NULL_TREE
);
10583 local_define_builtin ("__builtin_stack_save", ftype
, BUILT_IN_STACK_SAVE
,
10584 "__builtin_stack_save", ECF_NOTHROW
| ECF_LEAF
);
10586 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10587 local_define_builtin ("__builtin_stack_restore", ftype
,
10588 BUILT_IN_STACK_RESTORE
,
10589 "__builtin_stack_restore", ECF_NOTHROW
| ECF_LEAF
);
10591 /* If there's a possibility that we might use the ARM EABI, build the
10592 alternate __cxa_end_cleanup node used to resume from C++ and Java. */
10593 if (targetm
.arm_eabi_unwinder
)
10595 ftype
= build_function_type_list (void_type_node
, NULL_TREE
);
10596 local_define_builtin ("__builtin_cxa_end_cleanup", ftype
,
10597 BUILT_IN_CXA_END_CLEANUP
,
10598 "__cxa_end_cleanup", ECF_NORETURN
| ECF_LEAF
);
10601 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10602 local_define_builtin ("__builtin_unwind_resume", ftype
,
10603 BUILT_IN_UNWIND_RESUME
,
10604 ((targetm_common
.except_unwind_info (&global_options
)
10606 ? "_Unwind_SjLj_Resume" : "_Unwind_Resume"),
10609 if (builtin_decl_explicit (BUILT_IN_RETURN_ADDRESS
) == NULL_TREE
)
10611 ftype
= build_function_type_list (ptr_type_node
, integer_type_node
,
10613 local_define_builtin ("__builtin_return_address", ftype
,
10614 BUILT_IN_RETURN_ADDRESS
,
10615 "__builtin_return_address",
10619 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
)
10620 || !builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
10622 ftype
= build_function_type_list (void_type_node
, ptr_type_node
,
10623 ptr_type_node
, NULL_TREE
);
10624 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
))
10625 local_define_builtin ("__cyg_profile_func_enter", ftype
,
10626 BUILT_IN_PROFILE_FUNC_ENTER
,
10627 "__cyg_profile_func_enter", 0);
10628 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
10629 local_define_builtin ("__cyg_profile_func_exit", ftype
,
10630 BUILT_IN_PROFILE_FUNC_EXIT
,
10631 "__cyg_profile_func_exit", 0);
10634 /* The exception object and filter values from the runtime. The argument
10635 must be zero before exception lowering, i.e. from the front end. After
10636 exception lowering, it will be the region number for the exception
10637 landing pad. These functions are PURE instead of CONST to prevent
10638 them from being hoisted past the exception edge that will initialize
10639 its value in the landing pad. */
10640 ftype
= build_function_type_list (ptr_type_node
,
10641 integer_type_node
, NULL_TREE
);
10642 ecf_flags
= ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
;
10643 /* Only use TM_PURE if we have TM language support. */
10644 if (builtin_decl_explicit_p (BUILT_IN_TM_LOAD_1
))
10645 ecf_flags
|= ECF_TM_PURE
;
10646 local_define_builtin ("__builtin_eh_pointer", ftype
, BUILT_IN_EH_POINTER
,
10647 "__builtin_eh_pointer", ecf_flags
);
10649 tmp
= lang_hooks
.types
.type_for_mode (targetm
.eh_return_filter_mode (), 0);
10650 ftype
= build_function_type_list (tmp
, integer_type_node
, NULL_TREE
);
10651 local_define_builtin ("__builtin_eh_filter", ftype
, BUILT_IN_EH_FILTER
,
10652 "__builtin_eh_filter", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10654 ftype
= build_function_type_list (void_type_node
,
10655 integer_type_node
, integer_type_node
,
10657 local_define_builtin ("__builtin_eh_copy_values", ftype
,
10658 BUILT_IN_EH_COPY_VALUES
,
10659 "__builtin_eh_copy_values", ECF_NOTHROW
);
10661 /* Complex multiplication and division. These are handled as builtins
10662 rather than optabs because emit_library_call_value doesn't support
10663 complex. Further, we can do slightly better with folding these
10664 beasties if the real and complex parts of the arguments are separate. */
10668 for (mode
= MIN_MODE_COMPLEX_FLOAT
; mode
<= MAX_MODE_COMPLEX_FLOAT
; ++mode
)
10670 char mode_name_buf
[4], *q
;
10672 enum built_in_function mcode
, dcode
;
10673 tree type
, inner_type
;
10674 const char *prefix
= "__";
10676 if (targetm
.libfunc_gnu_prefix
)
10679 type
= lang_hooks
.types
.type_for_mode ((machine_mode
) mode
, 0);
10682 inner_type
= TREE_TYPE (type
);
10684 ftype
= build_function_type_list (type
, inner_type
, inner_type
,
10685 inner_type
, inner_type
, NULL_TREE
);
10687 mcode
= ((enum built_in_function
)
10688 (BUILT_IN_COMPLEX_MUL_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
10689 dcode
= ((enum built_in_function
)
10690 (BUILT_IN_COMPLEX_DIV_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
10692 for (p
= GET_MODE_NAME (mode
), q
= mode_name_buf
; *p
; p
++, q
++)
10696 built_in_names
[mcode
] = concat (prefix
, "mul", mode_name_buf
, "3",
10698 local_define_builtin (built_in_names
[mcode
], ftype
, mcode
,
10699 built_in_names
[mcode
],
10700 ECF_CONST
| ECF_NOTHROW
| ECF_LEAF
);
10702 built_in_names
[dcode
] = concat (prefix
, "div", mode_name_buf
, "3",
10704 local_define_builtin (built_in_names
[dcode
], ftype
, dcode
,
10705 built_in_names
[dcode
],
10706 ECF_CONST
| ECF_NOTHROW
| ECF_LEAF
);
10710 init_internal_fns ();
10713 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
10716 If we requested a pointer to a vector, build up the pointers that
10717 we stripped off while looking for the inner type. Similarly for
10718 return values from functions.
10720 The argument TYPE is the top of the chain, and BOTTOM is the
10721 new type which we will point to. */
10724 reconstruct_complex_type (tree type
, tree bottom
)
10728 if (TREE_CODE (type
) == POINTER_TYPE
)
10730 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10731 outer
= build_pointer_type_for_mode (inner
, TYPE_MODE (type
),
10732 TYPE_REF_CAN_ALIAS_ALL (type
));
10734 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
10736 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10737 outer
= build_reference_type_for_mode (inner
, TYPE_MODE (type
),
10738 TYPE_REF_CAN_ALIAS_ALL (type
));
10740 else if (TREE_CODE (type
) == ARRAY_TYPE
)
10742 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10743 outer
= build_array_type (inner
, TYPE_DOMAIN (type
));
10745 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10747 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10748 outer
= build_function_type (inner
, TYPE_ARG_TYPES (type
));
10750 else if (TREE_CODE (type
) == METHOD_TYPE
)
10752 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10753 /* The build_method_type_directly() routine prepends 'this' to argument list,
10754 so we must compensate by getting rid of it. */
10756 = build_method_type_directly
10757 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
))),
10759 TREE_CHAIN (TYPE_ARG_TYPES (type
)));
10761 else if (TREE_CODE (type
) == OFFSET_TYPE
)
10763 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10764 outer
= build_offset_type (TYPE_OFFSET_BASETYPE (type
), inner
);
10769 return build_type_attribute_qual_variant (outer
, TYPE_ATTRIBUTES (type
),
10770 TYPE_QUALS (type
));
10773 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
10776 build_vector_type_for_mode (tree innertype
, machine_mode mode
)
10780 switch (GET_MODE_CLASS (mode
))
10782 case MODE_VECTOR_INT
:
10783 case MODE_VECTOR_FLOAT
:
10784 case MODE_VECTOR_FRACT
:
10785 case MODE_VECTOR_UFRACT
:
10786 case MODE_VECTOR_ACCUM
:
10787 case MODE_VECTOR_UACCUM
:
10788 nunits
= GET_MODE_NUNITS (mode
);
10792 /* Check that there are no leftover bits. */
10793 gcc_assert (GET_MODE_BITSIZE (mode
)
10794 % TREE_INT_CST_LOW (TYPE_SIZE (innertype
)) == 0);
10796 nunits
= GET_MODE_BITSIZE (mode
)
10797 / TREE_INT_CST_LOW (TYPE_SIZE (innertype
));
10801 gcc_unreachable ();
10804 return make_vector_type (innertype
, nunits
, mode
);
10807 /* Similarly, but takes the inner type and number of units, which must be
10811 build_vector_type (tree innertype
, int nunits
)
10813 return make_vector_type (innertype
, nunits
, VOIDmode
);
10816 /* Build truth vector with specified length and number of units. */
10819 build_truth_vector_type (unsigned nunits
, unsigned vector_size
)
10821 machine_mode mask_mode
= targetm
.vectorize
.get_mask_mode (nunits
,
10824 gcc_assert (mask_mode
!= VOIDmode
);
10826 unsigned HOST_WIDE_INT vsize
;
10827 if (mask_mode
== BLKmode
)
10828 vsize
= vector_size
* BITS_PER_UNIT
;
10830 vsize
= GET_MODE_BITSIZE (mask_mode
);
10832 unsigned HOST_WIDE_INT esize
= vsize
/ nunits
;
10833 gcc_assert (esize
* nunits
== vsize
);
10835 tree bool_type
= build_nonstandard_boolean_type (esize
);
10837 return make_vector_type (bool_type
, nunits
, mask_mode
);
10840 /* Returns a vector type corresponding to a comparison of VECTYPE. */
10843 build_same_sized_truth_vector_type (tree vectype
)
10845 if (VECTOR_BOOLEAN_TYPE_P (vectype
))
10848 unsigned HOST_WIDE_INT size
= GET_MODE_SIZE (TYPE_MODE (vectype
));
10851 size
= tree_to_uhwi (TYPE_SIZE_UNIT (vectype
));
10853 return build_truth_vector_type (TYPE_VECTOR_SUBPARTS (vectype
), size
);
10856 /* Similarly, but builds a variant type with TYPE_VECTOR_OPAQUE set. */
10859 build_opaque_vector_type (tree innertype
, int nunits
)
10861 tree t
= make_vector_type (innertype
, nunits
, VOIDmode
);
10863 /* We always build the non-opaque variant before the opaque one,
10864 so if it already exists, it is TYPE_NEXT_VARIANT of this one. */
10865 cand
= TYPE_NEXT_VARIANT (t
);
10867 && TYPE_VECTOR_OPAQUE (cand
)
10868 && check_qualified_type (cand
, t
, TYPE_QUALS (t
)))
10870 /* Othewise build a variant type and make sure to queue it after
10871 the non-opaque type. */
10872 cand
= build_distinct_type_copy (t
);
10873 TYPE_VECTOR_OPAQUE (cand
) = true;
10874 TYPE_CANONICAL (cand
) = TYPE_CANONICAL (t
);
10875 TYPE_NEXT_VARIANT (cand
) = TYPE_NEXT_VARIANT (t
);
10876 TYPE_NEXT_VARIANT (t
) = cand
;
10877 TYPE_MAIN_VARIANT (cand
) = TYPE_MAIN_VARIANT (t
);
10882 /* Given an initializer INIT, return TRUE if INIT is zero or some
10883 aggregate of zeros. Otherwise return FALSE. */
10885 initializer_zerop (const_tree init
)
10891 switch (TREE_CODE (init
))
10894 return integer_zerop (init
);
10897 /* ??? Note that this is not correct for C4X float formats. There,
10898 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
10899 negative exponent. */
10900 return real_zerop (init
)
10901 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init
));
10904 return fixed_zerop (init
);
10907 return integer_zerop (init
)
10908 || (real_zerop (init
)
10909 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init
)))
10910 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init
))));
10915 for (i
= 0; i
< VECTOR_CST_NELTS (init
); ++i
)
10916 if (!initializer_zerop (VECTOR_CST_ELT (init
, i
)))
10923 unsigned HOST_WIDE_INT idx
;
10925 if (TREE_CLOBBER_P (init
))
10927 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init
), idx
, elt
)
10928 if (!initializer_zerop (elt
))
10937 /* We need to loop through all elements to handle cases like
10938 "\0" and "\0foobar". */
10939 for (i
= 0; i
< TREE_STRING_LENGTH (init
); ++i
)
10940 if (TREE_STRING_POINTER (init
)[i
] != '\0')
10951 /* Check if vector VEC consists of all the equal elements and
10952 that the number of elements corresponds to the type of VEC.
10953 The function returns first element of the vector
10954 or NULL_TREE if the vector is not uniform. */
10956 uniform_vector_p (const_tree vec
)
10961 if (vec
== NULL_TREE
)
10964 gcc_assert (VECTOR_TYPE_P (TREE_TYPE (vec
)));
10966 if (TREE_CODE (vec
) == VECTOR_CST
)
10968 first
= VECTOR_CST_ELT (vec
, 0);
10969 for (i
= 1; i
< VECTOR_CST_NELTS (vec
); ++i
)
10970 if (!operand_equal_p (first
, VECTOR_CST_ELT (vec
, i
), 0))
10976 else if (TREE_CODE (vec
) == CONSTRUCTOR
)
10978 first
= error_mark_node
;
10980 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (vec
), i
, t
)
10987 if (!operand_equal_p (first
, t
, 0))
10990 if (i
!= TYPE_VECTOR_SUBPARTS (TREE_TYPE (vec
)))
10999 /* Build an empty statement at location LOC. */
11002 build_empty_stmt (location_t loc
)
11004 tree t
= build1 (NOP_EXPR
, void_type_node
, size_zero_node
);
11005 SET_EXPR_LOCATION (t
, loc
);
11010 /* Build an OpenMP clause with code CODE. LOC is the location of the
11014 build_omp_clause (location_t loc
, enum omp_clause_code code
)
11019 length
= omp_clause_num_ops
[code
];
11020 size
= (sizeof (struct tree_omp_clause
) + (length
- 1) * sizeof (tree
));
11022 record_node_allocation_statistics (OMP_CLAUSE
, size
);
11024 t
= (tree
) ggc_internal_alloc (size
);
11025 memset (t
, 0, size
);
11026 TREE_SET_CODE (t
, OMP_CLAUSE
);
11027 OMP_CLAUSE_SET_CODE (t
, code
);
11028 OMP_CLAUSE_LOCATION (t
) = loc
;
11033 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
11034 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
11035 Except for the CODE and operand count field, other storage for the
11036 object is initialized to zeros. */
11039 build_vl_exp_stat (enum tree_code code
, int len MEM_STAT_DECL
)
11042 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_exp
);
11044 gcc_assert (TREE_CODE_CLASS (code
) == tcc_vl_exp
);
11045 gcc_assert (len
>= 1);
11047 record_node_allocation_statistics (code
, length
);
11049 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
11051 TREE_SET_CODE (t
, code
);
11053 /* Can't use TREE_OPERAND to store the length because if checking is
11054 enabled, it will try to check the length before we store it. :-P */
11055 t
->exp
.operands
[0] = build_int_cst (sizetype
, len
);
11060 /* Helper function for build_call_* functions; build a CALL_EXPR with
11061 indicated RETURN_TYPE, FN, and NARGS, but do not initialize any of
11062 the argument slots. */
11065 build_call_1 (tree return_type
, tree fn
, int nargs
)
11069 t
= build_vl_exp (CALL_EXPR
, nargs
+ 3);
11070 TREE_TYPE (t
) = return_type
;
11071 CALL_EXPR_FN (t
) = fn
;
11072 CALL_EXPR_STATIC_CHAIN (t
) = NULL
;
11077 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
11078 FN and a null static chain slot. NARGS is the number of call arguments
11079 which are specified as "..." arguments. */
11082 build_call_nary (tree return_type
, tree fn
, int nargs
, ...)
11086 va_start (args
, nargs
);
11087 ret
= build_call_valist (return_type
, fn
, nargs
, args
);
11092 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
11093 FN and a null static chain slot. NARGS is the number of call arguments
11094 which are specified as a va_list ARGS. */
11097 build_call_valist (tree return_type
, tree fn
, int nargs
, va_list args
)
11102 t
= build_call_1 (return_type
, fn
, nargs
);
11103 for (i
= 0; i
< nargs
; i
++)
11104 CALL_EXPR_ARG (t
, i
) = va_arg (args
, tree
);
11105 process_call_operands (t
);
11109 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
11110 FN and a null static chain slot. NARGS is the number of call arguments
11111 which are specified as a tree array ARGS. */
11114 build_call_array_loc (location_t loc
, tree return_type
, tree fn
,
11115 int nargs
, const tree
*args
)
11120 t
= build_call_1 (return_type
, fn
, nargs
);
11121 for (i
= 0; i
< nargs
; i
++)
11122 CALL_EXPR_ARG (t
, i
) = args
[i
];
11123 process_call_operands (t
);
11124 SET_EXPR_LOCATION (t
, loc
);
11128 /* Like build_call_array, but takes a vec. */
11131 build_call_vec (tree return_type
, tree fn
, vec
<tree
, va_gc
> *args
)
11136 ret
= build_call_1 (return_type
, fn
, vec_safe_length (args
));
11137 FOR_EACH_VEC_SAFE_ELT (args
, ix
, t
)
11138 CALL_EXPR_ARG (ret
, ix
) = t
;
11139 process_call_operands (ret
);
11143 /* Conveniently construct a function call expression. FNDECL names the
11144 function to be called and N arguments are passed in the array
11148 build_call_expr_loc_array (location_t loc
, tree fndecl
, int n
, tree
*argarray
)
11150 tree fntype
= TREE_TYPE (fndecl
);
11151 tree fn
= build1 (ADDR_EXPR
, build_pointer_type (fntype
), fndecl
);
11153 return fold_build_call_array_loc (loc
, TREE_TYPE (fntype
), fn
, n
, argarray
);
11156 /* Conveniently construct a function call expression. FNDECL names the
11157 function to be called and the arguments are passed in the vector
11161 build_call_expr_loc_vec (location_t loc
, tree fndecl
, vec
<tree
, va_gc
> *vec
)
11163 return build_call_expr_loc_array (loc
, fndecl
, vec_safe_length (vec
),
11164 vec_safe_address (vec
));
11168 /* Conveniently construct a function call expression. FNDECL names the
11169 function to be called, N is the number of arguments, and the "..."
11170 parameters are the argument expressions. */
11173 build_call_expr_loc (location_t loc
, tree fndecl
, int n
, ...)
11176 tree
*argarray
= XALLOCAVEC (tree
, n
);
11180 for (i
= 0; i
< n
; i
++)
11181 argarray
[i
] = va_arg (ap
, tree
);
11183 return build_call_expr_loc_array (loc
, fndecl
, n
, argarray
);
11186 /* Like build_call_expr_loc (UNKNOWN_LOCATION, ...). Duplicated because
11187 varargs macros aren't supported by all bootstrap compilers. */
11190 build_call_expr (tree fndecl
, int n
, ...)
11193 tree
*argarray
= XALLOCAVEC (tree
, n
);
11197 for (i
= 0; i
< n
; i
++)
11198 argarray
[i
] = va_arg (ap
, tree
);
11200 return build_call_expr_loc_array (UNKNOWN_LOCATION
, fndecl
, n
, argarray
);
11203 /* Build an internal call to IFN, with arguments ARGS[0:N-1] and with return
11204 type TYPE. This is just like CALL_EXPR, except its CALL_EXPR_FN is NULL.
11205 It will get gimplified later into an ordinary internal function. */
11208 build_call_expr_internal_loc_array (location_t loc
, internal_fn ifn
,
11209 tree type
, int n
, const tree
*args
)
11211 tree t
= build_call_1 (type
, NULL_TREE
, n
);
11212 for (int i
= 0; i
< n
; ++i
)
11213 CALL_EXPR_ARG (t
, i
) = args
[i
];
11214 SET_EXPR_LOCATION (t
, loc
);
11215 CALL_EXPR_IFN (t
) = ifn
;
11219 /* Build internal call expression. This is just like CALL_EXPR, except
11220 its CALL_EXPR_FN is NULL. It will get gimplified later into ordinary
11221 internal function. */
11224 build_call_expr_internal_loc (location_t loc
, enum internal_fn ifn
,
11225 tree type
, int n
, ...)
11228 tree
*argarray
= XALLOCAVEC (tree
, n
);
11232 for (i
= 0; i
< n
; i
++)
11233 argarray
[i
] = va_arg (ap
, tree
);
11235 return build_call_expr_internal_loc_array (loc
, ifn
, type
, n
, argarray
);
11238 /* Return a function call to FN, if the target is guaranteed to support it,
11241 N is the number of arguments, passed in the "...", and TYPE is the
11242 type of the return value. */
11245 maybe_build_call_expr_loc (location_t loc
, combined_fn fn
, tree type
,
11249 tree
*argarray
= XALLOCAVEC (tree
, n
);
11253 for (i
= 0; i
< n
; i
++)
11254 argarray
[i
] = va_arg (ap
, tree
);
11256 if (internal_fn_p (fn
))
11258 internal_fn ifn
= as_internal_fn (fn
);
11259 if (direct_internal_fn_p (ifn
))
11261 tree_pair types
= direct_internal_fn_types (ifn
, type
, argarray
);
11262 if (!direct_internal_fn_supported_p (ifn
, types
,
11263 OPTIMIZE_FOR_BOTH
))
11266 return build_call_expr_internal_loc_array (loc
, ifn
, type
, n
, argarray
);
11270 tree fndecl
= builtin_decl_implicit (as_builtin_fn (fn
));
11273 return build_call_expr_loc_array (loc
, fndecl
, n
, argarray
);
11277 /* Create a new constant string literal and return a char* pointer to it.
11278 The STRING_CST value is the LEN characters at STR. */
11280 build_string_literal (int len
, const char *str
)
11282 tree t
, elem
, index
, type
;
11284 t
= build_string (len
, str
);
11285 elem
= build_type_variant (char_type_node
, 1, 0);
11286 index
= build_index_type (size_int (len
- 1));
11287 type
= build_array_type (elem
, index
);
11288 TREE_TYPE (t
) = type
;
11289 TREE_CONSTANT (t
) = 1;
11290 TREE_READONLY (t
) = 1;
11291 TREE_STATIC (t
) = 1;
11293 type
= build_pointer_type (elem
);
11294 t
= build1 (ADDR_EXPR
, type
,
11295 build4 (ARRAY_REF
, elem
,
11296 t
, integer_zero_node
, NULL_TREE
, NULL_TREE
));
11302 /* Return true if T (assumed to be a DECL) must be assigned a memory
11306 needs_to_live_in_memory (const_tree t
)
11308 return (TREE_ADDRESSABLE (t
)
11309 || is_global_var (t
)
11310 || (TREE_CODE (t
) == RESULT_DECL
11311 && !DECL_BY_REFERENCE (t
)
11312 && aggregate_value_p (t
, current_function_decl
)));
11315 /* Return value of a constant X and sign-extend it. */
11318 int_cst_value (const_tree x
)
11320 unsigned bits
= TYPE_PRECISION (TREE_TYPE (x
));
11321 unsigned HOST_WIDE_INT val
= TREE_INT_CST_LOW (x
);
11323 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
11324 gcc_assert (cst_and_fits_in_hwi (x
));
11326 if (bits
< HOST_BITS_PER_WIDE_INT
)
11328 bool negative
= ((val
>> (bits
- 1)) & 1) != 0;
11330 val
|= (~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1;
11332 val
&= ~((~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1);
11338 /* If TYPE is an integral or pointer type, return an integer type with
11339 the same precision which is unsigned iff UNSIGNEDP is true, or itself
11340 if TYPE is already an integer type of signedness UNSIGNEDP. */
11343 signed_or_unsigned_type_for (int unsignedp
, tree type
)
11345 if (TREE_CODE (type
) == INTEGER_TYPE
&& TYPE_UNSIGNED (type
) == unsignedp
)
11348 if (TREE_CODE (type
) == VECTOR_TYPE
)
11350 tree inner
= TREE_TYPE (type
);
11351 tree inner2
= signed_or_unsigned_type_for (unsignedp
, inner
);
11354 if (inner
== inner2
)
11356 return build_vector_type (inner2
, TYPE_VECTOR_SUBPARTS (type
));
11359 if (!INTEGRAL_TYPE_P (type
)
11360 && !POINTER_TYPE_P (type
)
11361 && TREE_CODE (type
) != OFFSET_TYPE
)
11364 return build_nonstandard_integer_type (TYPE_PRECISION (type
), unsignedp
);
11367 /* If TYPE is an integral or pointer type, return an integer type with
11368 the same precision which is unsigned, or itself if TYPE is already an
11369 unsigned integer type. */
11372 unsigned_type_for (tree type
)
11374 return signed_or_unsigned_type_for (1, type
);
11377 /* If TYPE is an integral or pointer type, return an integer type with
11378 the same precision which is signed, or itself if TYPE is already a
11379 signed integer type. */
11382 signed_type_for (tree type
)
11384 return signed_or_unsigned_type_for (0, type
);
11387 /* If TYPE is a vector type, return a signed integer vector type with the
11388 same width and number of subparts. Otherwise return boolean_type_node. */
11391 truth_type_for (tree type
)
11393 if (TREE_CODE (type
) == VECTOR_TYPE
)
11395 if (VECTOR_BOOLEAN_TYPE_P (type
))
11397 return build_truth_vector_type (TYPE_VECTOR_SUBPARTS (type
),
11398 GET_MODE_SIZE (TYPE_MODE (type
)));
11401 return boolean_type_node
;
11404 /* Returns the largest value obtainable by casting something in INNER type to
11408 upper_bound_in_type (tree outer
, tree inner
)
11410 unsigned int det
= 0;
11411 unsigned oprec
= TYPE_PRECISION (outer
);
11412 unsigned iprec
= TYPE_PRECISION (inner
);
11415 /* Compute a unique number for every combination. */
11416 det
|= (oprec
> iprec
) ? 4 : 0;
11417 det
|= TYPE_UNSIGNED (outer
) ? 2 : 0;
11418 det
|= TYPE_UNSIGNED (inner
) ? 1 : 0;
11420 /* Determine the exponent to use. */
11425 /* oprec <= iprec, outer: signed, inner: don't care. */
11430 /* oprec <= iprec, outer: unsigned, inner: don't care. */
11434 /* oprec > iprec, outer: signed, inner: signed. */
11438 /* oprec > iprec, outer: signed, inner: unsigned. */
11442 /* oprec > iprec, outer: unsigned, inner: signed. */
11446 /* oprec > iprec, outer: unsigned, inner: unsigned. */
11450 gcc_unreachable ();
11453 return wide_int_to_tree (outer
,
11454 wi::mask (prec
, false, TYPE_PRECISION (outer
)));
11457 /* Returns the smallest value obtainable by casting something in INNER type to
11461 lower_bound_in_type (tree outer
, tree inner
)
11463 unsigned oprec
= TYPE_PRECISION (outer
);
11464 unsigned iprec
= TYPE_PRECISION (inner
);
11466 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
11468 if (TYPE_UNSIGNED (outer
)
11469 /* If we are widening something of an unsigned type, OUTER type
11470 contains all values of INNER type. In particular, both INNER
11471 and OUTER types have zero in common. */
11472 || (oprec
> iprec
&& TYPE_UNSIGNED (inner
)))
11473 return build_int_cst (outer
, 0);
11476 /* If we are widening a signed type to another signed type, we
11477 want to obtain -2^^(iprec-1). If we are keeping the
11478 precision or narrowing to a signed type, we want to obtain
11480 unsigned prec
= oprec
> iprec
? iprec
: oprec
;
11481 return wide_int_to_tree (outer
,
11482 wi::mask (prec
- 1, true,
11483 TYPE_PRECISION (outer
)));
11487 /* Return nonzero if two operands that are suitable for PHI nodes are
11488 necessarily equal. Specifically, both ARG0 and ARG1 must be either
11489 SSA_NAME or invariant. Note that this is strictly an optimization.
11490 That is, callers of this function can directly call operand_equal_p
11491 and get the same result, only slower. */
11494 operand_equal_for_phi_arg_p (const_tree arg0
, const_tree arg1
)
11498 if (TREE_CODE (arg0
) == SSA_NAME
|| TREE_CODE (arg1
) == SSA_NAME
)
11500 return operand_equal_p (arg0
, arg1
, 0);
11503 /* Returns number of zeros at the end of binary representation of X. */
11506 num_ending_zeros (const_tree x
)
11508 return build_int_cst (TREE_TYPE (x
), wi::ctz (x
));
11512 #define WALK_SUBTREE(NODE) \
11515 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
11521 /* This is a subroutine of walk_tree that walks field of TYPE that are to
11522 be walked whenever a type is seen in the tree. Rest of operands and return
11523 value are as for walk_tree. */
11526 walk_type_fields (tree type
, walk_tree_fn func
, void *data
,
11527 hash_set
<tree
> *pset
, walk_tree_lh lh
)
11529 tree result
= NULL_TREE
;
11531 switch (TREE_CODE (type
))
11534 case REFERENCE_TYPE
:
11536 /* We have to worry about mutually recursive pointers. These can't
11537 be written in C. They can in Ada. It's pathological, but
11538 there's an ACATS test (c38102a) that checks it. Deal with this
11539 by checking if we're pointing to another pointer, that one
11540 points to another pointer, that one does too, and we have no htab.
11541 If so, get a hash table. We check three levels deep to avoid
11542 the cost of the hash table if we don't need one. */
11543 if (POINTER_TYPE_P (TREE_TYPE (type
))
11544 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type
)))
11545 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type
))))
11548 result
= walk_tree_without_duplicates (&TREE_TYPE (type
),
11556 /* ... fall through ... */
11559 WALK_SUBTREE (TREE_TYPE (type
));
11563 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type
));
11565 /* Fall through. */
11567 case FUNCTION_TYPE
:
11568 WALK_SUBTREE (TREE_TYPE (type
));
11572 /* We never want to walk into default arguments. */
11573 for (arg
= TYPE_ARG_TYPES (type
); arg
; arg
= TREE_CHAIN (arg
))
11574 WALK_SUBTREE (TREE_VALUE (arg
));
11579 /* Don't follow this nodes's type if a pointer for fear that
11580 we'll have infinite recursion. If we have a PSET, then we
11583 || (!POINTER_TYPE_P (TREE_TYPE (type
))
11584 && TREE_CODE (TREE_TYPE (type
)) != OFFSET_TYPE
))
11585 WALK_SUBTREE (TREE_TYPE (type
));
11586 WALK_SUBTREE (TYPE_DOMAIN (type
));
11590 WALK_SUBTREE (TREE_TYPE (type
));
11591 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type
));
11601 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
11602 called with the DATA and the address of each sub-tree. If FUNC returns a
11603 non-NULL value, the traversal is stopped, and the value returned by FUNC
11604 is returned. If PSET is non-NULL it is used to record the nodes visited,
11605 and to avoid visiting a node more than once. */
11608 walk_tree_1 (tree
*tp
, walk_tree_fn func
, void *data
,
11609 hash_set
<tree
> *pset
, walk_tree_lh lh
)
11611 enum tree_code code
;
11615 #define WALK_SUBTREE_TAIL(NODE) \
11619 goto tail_recurse; \
11624 /* Skip empty subtrees. */
11628 /* Don't walk the same tree twice, if the user has requested
11629 that we avoid doing so. */
11630 if (pset
&& pset
->add (*tp
))
11633 /* Call the function. */
11635 result
= (*func
) (tp
, &walk_subtrees
, data
);
11637 /* If we found something, return it. */
11641 code
= TREE_CODE (*tp
);
11643 /* Even if we didn't, FUNC may have decided that there was nothing
11644 interesting below this point in the tree. */
11645 if (!walk_subtrees
)
11647 /* But we still need to check our siblings. */
11648 if (code
== TREE_LIST
)
11649 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
11650 else if (code
== OMP_CLAUSE
)
11651 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11658 result
= (*lh
) (tp
, &walk_subtrees
, func
, data
, pset
);
11659 if (result
|| !walk_subtrees
)
11666 case IDENTIFIER_NODE
:
11673 case PLACEHOLDER_EXPR
:
11677 /* None of these have subtrees other than those already walked
11682 WALK_SUBTREE (TREE_VALUE (*tp
));
11683 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
11688 int len
= TREE_VEC_LENGTH (*tp
);
11693 /* Walk all elements but the first. */
11695 WALK_SUBTREE (TREE_VEC_ELT (*tp
, len
));
11697 /* Now walk the first one as a tail call. */
11698 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp
, 0));
11702 WALK_SUBTREE (TREE_REALPART (*tp
));
11703 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp
));
11707 unsigned HOST_WIDE_INT idx
;
11708 constructor_elt
*ce
;
11710 for (idx
= 0; vec_safe_iterate (CONSTRUCTOR_ELTS (*tp
), idx
, &ce
);
11712 WALK_SUBTREE (ce
->value
);
11717 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, 0));
11722 for (decl
= BIND_EXPR_VARS (*tp
); decl
; decl
= DECL_CHAIN (decl
))
11724 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
11725 into declarations that are just mentioned, rather than
11726 declared; they don't really belong to this part of the tree.
11727 And, we can see cycles: the initializer for a declaration
11728 can refer to the declaration itself. */
11729 WALK_SUBTREE (DECL_INITIAL (decl
));
11730 WALK_SUBTREE (DECL_SIZE (decl
));
11731 WALK_SUBTREE (DECL_SIZE_UNIT (decl
));
11733 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp
));
11736 case STATEMENT_LIST
:
11738 tree_stmt_iterator i
;
11739 for (i
= tsi_start (*tp
); !tsi_end_p (i
); tsi_next (&i
))
11740 WALK_SUBTREE (*tsi_stmt_ptr (i
));
11745 switch (OMP_CLAUSE_CODE (*tp
))
11747 case OMP_CLAUSE_GANG
:
11748 case OMP_CLAUSE__GRIDDIM_
:
11749 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 1));
11752 case OMP_CLAUSE_DEVICE_RESIDENT
:
11753 case OMP_CLAUSE_ASYNC
:
11754 case OMP_CLAUSE_WAIT
:
11755 case OMP_CLAUSE_WORKER
:
11756 case OMP_CLAUSE_VECTOR
:
11757 case OMP_CLAUSE_NUM_GANGS
:
11758 case OMP_CLAUSE_NUM_WORKERS
:
11759 case OMP_CLAUSE_VECTOR_LENGTH
:
11760 case OMP_CLAUSE_PRIVATE
:
11761 case OMP_CLAUSE_SHARED
:
11762 case OMP_CLAUSE_FIRSTPRIVATE
:
11763 case OMP_CLAUSE_COPYIN
:
11764 case OMP_CLAUSE_COPYPRIVATE
:
11765 case OMP_CLAUSE_FINAL
:
11766 case OMP_CLAUSE_IF
:
11767 case OMP_CLAUSE_NUM_THREADS
:
11768 case OMP_CLAUSE_SCHEDULE
:
11769 case OMP_CLAUSE_UNIFORM
:
11770 case OMP_CLAUSE_DEPEND
:
11771 case OMP_CLAUSE_NUM_TEAMS
:
11772 case OMP_CLAUSE_THREAD_LIMIT
:
11773 case OMP_CLAUSE_DEVICE
:
11774 case OMP_CLAUSE_DIST_SCHEDULE
:
11775 case OMP_CLAUSE_SAFELEN
:
11776 case OMP_CLAUSE_SIMDLEN
:
11777 case OMP_CLAUSE_ORDERED
:
11778 case OMP_CLAUSE_PRIORITY
:
11779 case OMP_CLAUSE_GRAINSIZE
:
11780 case OMP_CLAUSE_NUM_TASKS
:
11781 case OMP_CLAUSE_HINT
:
11782 case OMP_CLAUSE_TO_DECLARE
:
11783 case OMP_CLAUSE_LINK
:
11784 case OMP_CLAUSE_USE_DEVICE_PTR
:
11785 case OMP_CLAUSE_IS_DEVICE_PTR
:
11786 case OMP_CLAUSE__LOOPTEMP_
:
11787 case OMP_CLAUSE__SIMDUID_
:
11788 case OMP_CLAUSE__CILK_FOR_COUNT_
:
11789 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 0));
11792 case OMP_CLAUSE_INDEPENDENT
:
11793 case OMP_CLAUSE_NOWAIT
:
11794 case OMP_CLAUSE_DEFAULT
:
11795 case OMP_CLAUSE_UNTIED
:
11796 case OMP_CLAUSE_MERGEABLE
:
11797 case OMP_CLAUSE_PROC_BIND
:
11798 case OMP_CLAUSE_INBRANCH
:
11799 case OMP_CLAUSE_NOTINBRANCH
:
11800 case OMP_CLAUSE_FOR
:
11801 case OMP_CLAUSE_PARALLEL
:
11802 case OMP_CLAUSE_SECTIONS
:
11803 case OMP_CLAUSE_TASKGROUP
:
11804 case OMP_CLAUSE_NOGROUP
:
11805 case OMP_CLAUSE_THREADS
:
11806 case OMP_CLAUSE_SIMD
:
11807 case OMP_CLAUSE_DEFAULTMAP
:
11808 case OMP_CLAUSE_AUTO
:
11809 case OMP_CLAUSE_SEQ
:
11810 case OMP_CLAUSE_TILE
:
11811 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11813 case OMP_CLAUSE_LASTPRIVATE
:
11814 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
11815 WALK_SUBTREE (OMP_CLAUSE_LASTPRIVATE_STMT (*tp
));
11816 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11818 case OMP_CLAUSE_COLLAPSE
:
11821 for (i
= 0; i
< 3; i
++)
11822 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
11823 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11826 case OMP_CLAUSE_LINEAR
:
11827 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
11828 WALK_SUBTREE (OMP_CLAUSE_LINEAR_STEP (*tp
));
11829 WALK_SUBTREE (OMP_CLAUSE_LINEAR_STMT (*tp
));
11830 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11832 case OMP_CLAUSE_ALIGNED
:
11833 case OMP_CLAUSE_FROM
:
11834 case OMP_CLAUSE_TO
:
11835 case OMP_CLAUSE_MAP
:
11836 case OMP_CLAUSE__CACHE_
:
11837 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
11838 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 1));
11839 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11841 case OMP_CLAUSE_REDUCTION
:
11844 for (i
= 0; i
< 5; i
++)
11845 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
11846 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11850 gcc_unreachable ();
11858 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
11859 But, we only want to walk once. */
11860 len
= (TREE_OPERAND (*tp
, 3) == TREE_OPERAND (*tp
, 1)) ? 2 : 3;
11861 for (i
= 0; i
< len
; ++i
)
11862 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
11863 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
));
11867 /* If this is a TYPE_DECL, walk into the fields of the type that it's
11868 defining. We only want to walk into these fields of a type in this
11869 case and not in the general case of a mere reference to the type.
11871 The criterion is as follows: if the field can be an expression, it
11872 must be walked only here. This should be in keeping with the fields
11873 that are directly gimplified in gimplify_type_sizes in order for the
11874 mark/copy-if-shared/unmark machinery of the gimplifier to work with
11875 variable-sized types.
11877 Note that DECLs get walked as part of processing the BIND_EXPR. */
11878 if (TREE_CODE (DECL_EXPR_DECL (*tp
)) == TYPE_DECL
)
11880 tree
*type_p
= &TREE_TYPE (DECL_EXPR_DECL (*tp
));
11881 if (TREE_CODE (*type_p
) == ERROR_MARK
)
11884 /* Call the function for the type. See if it returns anything or
11885 doesn't want us to continue. If we are to continue, walk both
11886 the normal fields and those for the declaration case. */
11887 result
= (*func
) (type_p
, &walk_subtrees
, data
);
11888 if (result
|| !walk_subtrees
)
11891 /* But do not walk a pointed-to type since it may itself need to
11892 be walked in the declaration case if it isn't anonymous. */
11893 if (!POINTER_TYPE_P (*type_p
))
11895 result
= walk_type_fields (*type_p
, func
, data
, pset
, lh
);
11900 /* If this is a record type, also walk the fields. */
11901 if (RECORD_OR_UNION_TYPE_P (*type_p
))
11905 for (field
= TYPE_FIELDS (*type_p
); field
;
11906 field
= DECL_CHAIN (field
))
11908 /* We'd like to look at the type of the field, but we can
11909 easily get infinite recursion. So assume it's pointed
11910 to elsewhere in the tree. Also, ignore things that
11912 if (TREE_CODE (field
) != FIELD_DECL
)
11915 WALK_SUBTREE (DECL_FIELD_OFFSET (field
));
11916 WALK_SUBTREE (DECL_SIZE (field
));
11917 WALK_SUBTREE (DECL_SIZE_UNIT (field
));
11918 if (TREE_CODE (*type_p
) == QUAL_UNION_TYPE
)
11919 WALK_SUBTREE (DECL_QUALIFIER (field
));
11923 /* Same for scalar types. */
11924 else if (TREE_CODE (*type_p
) == BOOLEAN_TYPE
11925 || TREE_CODE (*type_p
) == ENUMERAL_TYPE
11926 || TREE_CODE (*type_p
) == INTEGER_TYPE
11927 || TREE_CODE (*type_p
) == FIXED_POINT_TYPE
11928 || TREE_CODE (*type_p
) == REAL_TYPE
)
11930 WALK_SUBTREE (TYPE_MIN_VALUE (*type_p
));
11931 WALK_SUBTREE (TYPE_MAX_VALUE (*type_p
));
11934 WALK_SUBTREE (TYPE_SIZE (*type_p
));
11935 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p
));
11940 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code
)))
11944 /* Walk over all the sub-trees of this operand. */
11945 len
= TREE_OPERAND_LENGTH (*tp
);
11947 /* Go through the subtrees. We need to do this in forward order so
11948 that the scope of a FOR_EXPR is handled properly. */
11951 for (i
= 0; i
< len
- 1; ++i
)
11952 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
11953 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
- 1));
11956 /* If this is a type, walk the needed fields in the type. */
11957 else if (TYPE_P (*tp
))
11958 return walk_type_fields (*tp
, func
, data
, pset
, lh
);
11962 /* We didn't find what we were looking for. */
11965 #undef WALK_SUBTREE_TAIL
11967 #undef WALK_SUBTREE
11969 /* Like walk_tree, but does not walk duplicate nodes more than once. */
11972 walk_tree_without_duplicates_1 (tree
*tp
, walk_tree_fn func
, void *data
,
11977 hash_set
<tree
> pset
;
11978 result
= walk_tree_1 (tp
, func
, data
, &pset
, lh
);
11984 tree_block (tree t
)
11986 const enum tree_code_class c
= TREE_CODE_CLASS (TREE_CODE (t
));
11988 if (IS_EXPR_CODE_CLASS (c
))
11989 return LOCATION_BLOCK (t
->exp
.locus
);
11990 gcc_unreachable ();
11995 tree_set_block (tree t
, tree b
)
11997 const enum tree_code_class c
= TREE_CODE_CLASS (TREE_CODE (t
));
11999 if (IS_EXPR_CODE_CLASS (c
))
12001 t
->exp
.locus
= set_block (t
->exp
.locus
, b
);
12004 gcc_unreachable ();
12007 /* Create a nameless artificial label and put it in the current
12008 function context. The label has a location of LOC. Returns the
12009 newly created label. */
12012 create_artificial_label (location_t loc
)
12014 tree lab
= build_decl (loc
,
12015 LABEL_DECL
, NULL_TREE
, void_type_node
);
12017 DECL_ARTIFICIAL (lab
) = 1;
12018 DECL_IGNORED_P (lab
) = 1;
12019 DECL_CONTEXT (lab
) = current_function_decl
;
12023 /* Given a tree, try to return a useful variable name that we can use
12024 to prefix a temporary that is being assigned the value of the tree.
12025 I.E. given <temp> = &A, return A. */
12030 tree stripped_decl
;
12033 STRIP_NOPS (stripped_decl
);
12034 if (DECL_P (stripped_decl
) && DECL_NAME (stripped_decl
))
12035 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl
));
12036 else if (TREE_CODE (stripped_decl
) == SSA_NAME
)
12038 tree name
= SSA_NAME_IDENTIFIER (stripped_decl
);
12041 return IDENTIFIER_POINTER (name
);
12045 switch (TREE_CODE (stripped_decl
))
12048 return get_name (TREE_OPERAND (stripped_decl
, 0));
12055 /* Return true if TYPE has a variable argument list. */
12058 stdarg_p (const_tree fntype
)
12060 function_args_iterator args_iter
;
12061 tree n
= NULL_TREE
, t
;
12066 FOREACH_FUNCTION_ARGS (fntype
, t
, args_iter
)
12071 return n
!= NULL_TREE
&& n
!= void_type_node
;
12074 /* Return true if TYPE has a prototype. */
12077 prototype_p (const_tree fntype
)
12081 gcc_assert (fntype
!= NULL_TREE
);
12083 t
= TYPE_ARG_TYPES (fntype
);
12084 return (t
!= NULL_TREE
);
12087 /* If BLOCK is inlined from an __attribute__((__artificial__))
12088 routine, return pointer to location from where it has been
12091 block_nonartificial_location (tree block
)
12093 location_t
*ret
= NULL
;
12095 while (block
&& TREE_CODE (block
) == BLOCK
12096 && BLOCK_ABSTRACT_ORIGIN (block
))
12098 tree ao
= BLOCK_ABSTRACT_ORIGIN (block
);
12100 while (TREE_CODE (ao
) == BLOCK
12101 && BLOCK_ABSTRACT_ORIGIN (ao
)
12102 && BLOCK_ABSTRACT_ORIGIN (ao
) != ao
)
12103 ao
= BLOCK_ABSTRACT_ORIGIN (ao
);
12105 if (TREE_CODE (ao
) == FUNCTION_DECL
)
12107 /* If AO is an artificial inline, point RET to the
12108 call site locus at which it has been inlined and continue
12109 the loop, in case AO's caller is also an artificial
12111 if (DECL_DECLARED_INLINE_P (ao
)
12112 && lookup_attribute ("artificial", DECL_ATTRIBUTES (ao
)))
12113 ret
= &BLOCK_SOURCE_LOCATION (block
);
12117 else if (TREE_CODE (ao
) != BLOCK
)
12120 block
= BLOCK_SUPERCONTEXT (block
);
12126 /* If EXP is inlined from an __attribute__((__artificial__))
12127 function, return the location of the original call expression. */
12130 tree_nonartificial_location (tree exp
)
12132 location_t
*loc
= block_nonartificial_location (TREE_BLOCK (exp
));
12137 return EXPR_LOCATION (exp
);
12141 /* These are the hash table functions for the hash table of OPTIMIZATION_NODEq
12144 /* Return the hash code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
12147 cl_option_hasher::hash (tree x
)
12149 const_tree
const t
= x
;
12153 hashval_t hash
= 0;
12155 if (TREE_CODE (t
) == OPTIMIZATION_NODE
)
12157 p
= (const char *)TREE_OPTIMIZATION (t
);
12158 len
= sizeof (struct cl_optimization
);
12161 else if (TREE_CODE (t
) == TARGET_OPTION_NODE
)
12162 return cl_target_option_hash (TREE_TARGET_OPTION (t
));
12165 gcc_unreachable ();
12167 /* assume most opt flags are just 0/1, some are 2-3, and a few might be
12169 for (i
= 0; i
< len
; i
++)
12171 hash
= (hash
<< 4) ^ ((i
<< 2) | p
[i
]);
12176 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
12177 TARGET_OPTION tree node) is the same as that given by *Y, which is the
12181 cl_option_hasher::equal (tree x
, tree y
)
12183 const_tree
const xt
= x
;
12184 const_tree
const yt
= y
;
12189 if (TREE_CODE (xt
) != TREE_CODE (yt
))
12192 if (TREE_CODE (xt
) == OPTIMIZATION_NODE
)
12194 xp
= (const char *)TREE_OPTIMIZATION (xt
);
12195 yp
= (const char *)TREE_OPTIMIZATION (yt
);
12196 len
= sizeof (struct cl_optimization
);
12199 else if (TREE_CODE (xt
) == TARGET_OPTION_NODE
)
12201 return cl_target_option_eq (TREE_TARGET_OPTION (xt
),
12202 TREE_TARGET_OPTION (yt
));
12206 gcc_unreachable ();
12208 return (memcmp (xp
, yp
, len
) == 0);
12211 /* Build an OPTIMIZATION_NODE based on the options in OPTS. */
12214 build_optimization_node (struct gcc_options
*opts
)
12218 /* Use the cache of optimization nodes. */
12220 cl_optimization_save (TREE_OPTIMIZATION (cl_optimization_node
),
12223 tree
*slot
= cl_option_hash_table
->find_slot (cl_optimization_node
, INSERT
);
12227 /* Insert this one into the hash table. */
12228 t
= cl_optimization_node
;
12231 /* Make a new node for next time round. */
12232 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
12238 /* Build a TARGET_OPTION_NODE based on the options in OPTS. */
12241 build_target_option_node (struct gcc_options
*opts
)
12245 /* Use the cache of optimization nodes. */
12247 cl_target_option_save (TREE_TARGET_OPTION (cl_target_option_node
),
12250 tree
*slot
= cl_option_hash_table
->find_slot (cl_target_option_node
, INSERT
);
12254 /* Insert this one into the hash table. */
12255 t
= cl_target_option_node
;
12258 /* Make a new node for next time round. */
12259 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
12265 /* Clear TREE_TARGET_GLOBALS of all TARGET_OPTION_NODE trees,
12266 so that they aren't saved during PCH writing. */
12269 prepare_target_option_nodes_for_pch (void)
12271 hash_table
<cl_option_hasher
>::iterator iter
= cl_option_hash_table
->begin ();
12272 for (; iter
!= cl_option_hash_table
->end (); ++iter
)
12273 if (TREE_CODE (*iter
) == TARGET_OPTION_NODE
)
12274 TREE_TARGET_GLOBALS (*iter
) = NULL
;
12277 /* Determine the "ultimate origin" of a block. The block may be an inlined
12278 instance of an inlined instance of a block which is local to an inline
12279 function, so we have to trace all of the way back through the origin chain
12280 to find out what sort of node actually served as the original seed for the
12284 block_ultimate_origin (const_tree block
)
12286 tree immediate_origin
= BLOCK_ABSTRACT_ORIGIN (block
);
12288 /* BLOCK_ABSTRACT_ORIGIN can point to itself; ignore that if
12289 we're trying to output the abstract instance of this function. */
12290 if (BLOCK_ABSTRACT (block
) && immediate_origin
== block
)
12293 if (immediate_origin
== NULL_TREE
)
12298 tree lookahead
= immediate_origin
;
12302 ret_val
= lookahead
;
12303 lookahead
= (TREE_CODE (ret_val
) == BLOCK
12304 ? BLOCK_ABSTRACT_ORIGIN (ret_val
) : NULL
);
12306 while (lookahead
!= NULL
&& lookahead
!= ret_val
);
12308 /* The block's abstract origin chain may not be the *ultimate* origin of
12309 the block. It could lead to a DECL that has an abstract origin set.
12310 If so, we want that DECL's abstract origin (which is what DECL_ORIGIN
12311 will give us if it has one). Note that DECL's abstract origins are
12312 supposed to be the most distant ancestor (or so decl_ultimate_origin
12313 claims), so we don't need to loop following the DECL origins. */
12314 if (DECL_P (ret_val
))
12315 return DECL_ORIGIN (ret_val
);
12321 /* Return true iff conversion from INNER_TYPE to OUTER_TYPE generates
12325 tree_nop_conversion_p (const_tree outer_type
, const_tree inner_type
)
12327 /* Do not strip casts into or out of differing address spaces. */
12328 if (POINTER_TYPE_P (outer_type
)
12329 && TYPE_ADDR_SPACE (TREE_TYPE (outer_type
)) != ADDR_SPACE_GENERIC
)
12331 if (!POINTER_TYPE_P (inner_type
)
12332 || (TYPE_ADDR_SPACE (TREE_TYPE (outer_type
))
12333 != TYPE_ADDR_SPACE (TREE_TYPE (inner_type
))))
12336 else if (POINTER_TYPE_P (inner_type
)
12337 && TYPE_ADDR_SPACE (TREE_TYPE (inner_type
)) != ADDR_SPACE_GENERIC
)
12339 /* We already know that outer_type is not a pointer with
12340 a non-generic address space. */
12344 /* Use precision rather then machine mode when we can, which gives
12345 the correct answer even for submode (bit-field) types. */
12346 if ((INTEGRAL_TYPE_P (outer_type
)
12347 || POINTER_TYPE_P (outer_type
)
12348 || TREE_CODE (outer_type
) == OFFSET_TYPE
)
12349 && (INTEGRAL_TYPE_P (inner_type
)
12350 || POINTER_TYPE_P (inner_type
)
12351 || TREE_CODE (inner_type
) == OFFSET_TYPE
))
12352 return TYPE_PRECISION (outer_type
) == TYPE_PRECISION (inner_type
);
12354 /* Otherwise fall back on comparing machine modes (e.g. for
12355 aggregate types, floats). */
12356 return TYPE_MODE (outer_type
) == TYPE_MODE (inner_type
);
12359 /* Return true iff conversion in EXP generates no instruction. Mark
12360 it inline so that we fully inline into the stripping functions even
12361 though we have two uses of this function. */
12364 tree_nop_conversion (const_tree exp
)
12366 tree outer_type
, inner_type
;
12368 if (!CONVERT_EXPR_P (exp
)
12369 && TREE_CODE (exp
) != NON_LVALUE_EXPR
)
12371 if (TREE_OPERAND (exp
, 0) == error_mark_node
)
12374 outer_type
= TREE_TYPE (exp
);
12375 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
12380 return tree_nop_conversion_p (outer_type
, inner_type
);
12383 /* Return true iff conversion in EXP generates no instruction. Don't
12384 consider conversions changing the signedness. */
12387 tree_sign_nop_conversion (const_tree exp
)
12389 tree outer_type
, inner_type
;
12391 if (!tree_nop_conversion (exp
))
12394 outer_type
= TREE_TYPE (exp
);
12395 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
12397 return (TYPE_UNSIGNED (outer_type
) == TYPE_UNSIGNED (inner_type
)
12398 && POINTER_TYPE_P (outer_type
) == POINTER_TYPE_P (inner_type
));
12401 /* Strip conversions from EXP according to tree_nop_conversion and
12402 return the resulting expression. */
12405 tree_strip_nop_conversions (tree exp
)
12407 while (tree_nop_conversion (exp
))
12408 exp
= TREE_OPERAND (exp
, 0);
12412 /* Strip conversions from EXP according to tree_sign_nop_conversion
12413 and return the resulting expression. */
12416 tree_strip_sign_nop_conversions (tree exp
)
12418 while (tree_sign_nop_conversion (exp
))
12419 exp
= TREE_OPERAND (exp
, 0);
12423 /* Avoid any floating point extensions from EXP. */
12425 strip_float_extensions (tree exp
)
12427 tree sub
, expt
, subt
;
12429 /* For floating point constant look up the narrowest type that can hold
12430 it properly and handle it like (type)(narrowest_type)constant.
12431 This way we can optimize for instance a=a*2.0 where "a" is float
12432 but 2.0 is double constant. */
12433 if (TREE_CODE (exp
) == REAL_CST
&& !DECIMAL_FLOAT_TYPE_P (TREE_TYPE (exp
)))
12435 REAL_VALUE_TYPE orig
;
12438 orig
= TREE_REAL_CST (exp
);
12439 if (TYPE_PRECISION (TREE_TYPE (exp
)) > TYPE_PRECISION (float_type_node
)
12440 && exact_real_truncate (TYPE_MODE (float_type_node
), &orig
))
12441 type
= float_type_node
;
12442 else if (TYPE_PRECISION (TREE_TYPE (exp
))
12443 > TYPE_PRECISION (double_type_node
)
12444 && exact_real_truncate (TYPE_MODE (double_type_node
), &orig
))
12445 type
= double_type_node
;
12447 return build_real_truncate (type
, orig
);
12450 if (!CONVERT_EXPR_P (exp
))
12453 sub
= TREE_OPERAND (exp
, 0);
12454 subt
= TREE_TYPE (sub
);
12455 expt
= TREE_TYPE (exp
);
12457 if (!FLOAT_TYPE_P (subt
))
12460 if (DECIMAL_FLOAT_TYPE_P (expt
) != DECIMAL_FLOAT_TYPE_P (subt
))
12463 if (TYPE_PRECISION (subt
) > TYPE_PRECISION (expt
))
12466 return strip_float_extensions (sub
);
12469 /* Strip out all handled components that produce invariant
12473 strip_invariant_refs (const_tree op
)
12475 while (handled_component_p (op
))
12477 switch (TREE_CODE (op
))
12480 case ARRAY_RANGE_REF
:
12481 if (!is_gimple_constant (TREE_OPERAND (op
, 1))
12482 || TREE_OPERAND (op
, 2) != NULL_TREE
12483 || TREE_OPERAND (op
, 3) != NULL_TREE
)
12487 case COMPONENT_REF
:
12488 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
12494 op
= TREE_OPERAND (op
, 0);
12500 static GTY(()) tree gcc_eh_personality_decl
;
12502 /* Return the GCC personality function decl. */
12505 lhd_gcc_personality (void)
12507 if (!gcc_eh_personality_decl
)
12508 gcc_eh_personality_decl
= build_personality_function ("gcc");
12509 return gcc_eh_personality_decl
;
12512 /* TARGET is a call target of GIMPLE call statement
12513 (obtained by gimple_call_fn). Return true if it is
12514 OBJ_TYPE_REF representing an virtual call of C++ method.
12515 (As opposed to OBJ_TYPE_REF representing objc calls
12516 through a cast where middle-end devirtualization machinery
12520 virtual_method_call_p (const_tree target
)
12522 if (TREE_CODE (target
) != OBJ_TYPE_REF
)
12524 tree t
= TREE_TYPE (target
);
12525 gcc_checking_assert (TREE_CODE (t
) == POINTER_TYPE
);
12527 if (TREE_CODE (t
) == FUNCTION_TYPE
)
12529 gcc_checking_assert (TREE_CODE (t
) == METHOD_TYPE
);
12530 /* If we do not have BINFO associated, it means that type was built
12531 without devirtualization enabled. Do not consider this a virtual
12533 if (!TYPE_BINFO (obj_type_ref_class (target
)))
12538 /* REF is OBJ_TYPE_REF, return the class the ref corresponds to. */
12541 obj_type_ref_class (const_tree ref
)
12543 gcc_checking_assert (TREE_CODE (ref
) == OBJ_TYPE_REF
);
12544 ref
= TREE_TYPE (ref
);
12545 gcc_checking_assert (TREE_CODE (ref
) == POINTER_TYPE
);
12546 ref
= TREE_TYPE (ref
);
12547 /* We look for type THIS points to. ObjC also builds
12548 OBJ_TYPE_REF with non-method calls, Their first parameter
12549 ID however also corresponds to class type. */
12550 gcc_checking_assert (TREE_CODE (ref
) == METHOD_TYPE
12551 || TREE_CODE (ref
) == FUNCTION_TYPE
);
12552 ref
= TREE_VALUE (TYPE_ARG_TYPES (ref
));
12553 gcc_checking_assert (TREE_CODE (ref
) == POINTER_TYPE
);
12554 return TREE_TYPE (ref
);
12557 /* Lookup sub-BINFO of BINFO of TYPE at offset POS. */
12560 lookup_binfo_at_offset (tree binfo
, tree type
, HOST_WIDE_INT pos
)
12563 tree base_binfo
, b
;
12565 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
12566 if (pos
== tree_to_shwi (BINFO_OFFSET (base_binfo
))
12567 && types_same_for_odr (TREE_TYPE (base_binfo
), type
))
12569 else if ((b
= lookup_binfo_at_offset (base_binfo
, type
, pos
)) != NULL
)
12574 /* Try to find a base info of BINFO that would have its field decl at offset
12575 OFFSET within the BINFO type and which is of EXPECTED_TYPE. If it can be
12576 found, return, otherwise return NULL_TREE. */
12579 get_binfo_at_offset (tree binfo
, HOST_WIDE_INT offset
, tree expected_type
)
12581 tree type
= BINFO_TYPE (binfo
);
12585 HOST_WIDE_INT pos
, size
;
12589 if (types_same_for_odr (type
, expected_type
))
12594 for (fld
= TYPE_FIELDS (type
); fld
; fld
= DECL_CHAIN (fld
))
12596 if (TREE_CODE (fld
) != FIELD_DECL
|| !DECL_ARTIFICIAL (fld
))
12599 pos
= int_bit_position (fld
);
12600 size
= tree_to_uhwi (DECL_SIZE (fld
));
12601 if (pos
<= offset
&& (pos
+ size
) > offset
)
12604 if (!fld
|| TREE_CODE (TREE_TYPE (fld
)) != RECORD_TYPE
)
12607 /* Offset 0 indicates the primary base, whose vtable contents are
12608 represented in the binfo for the derived class. */
12609 else if (offset
!= 0)
12611 tree found_binfo
= NULL
, base_binfo
;
12612 /* Offsets in BINFO are in bytes relative to the whole structure
12613 while POS is in bits relative to the containing field. */
12614 int binfo_offset
= (tree_to_shwi (BINFO_OFFSET (binfo
)) + pos
12617 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
12618 if (tree_to_shwi (BINFO_OFFSET (base_binfo
)) == binfo_offset
12619 && types_same_for_odr (TREE_TYPE (base_binfo
), TREE_TYPE (fld
)))
12621 found_binfo
= base_binfo
;
12625 binfo
= found_binfo
;
12627 binfo
= lookup_binfo_at_offset (binfo
, TREE_TYPE (fld
),
12631 type
= TREE_TYPE (fld
);
12636 /* Returns true if X is a typedef decl. */
12639 is_typedef_decl (const_tree x
)
12641 return (x
&& TREE_CODE (x
) == TYPE_DECL
12642 && DECL_ORIGINAL_TYPE (x
) != NULL_TREE
);
12645 /* Returns true iff TYPE is a type variant created for a typedef. */
12648 typedef_variant_p (const_tree type
)
12650 return is_typedef_decl (TYPE_NAME (type
));
12653 /* Warn about a use of an identifier which was marked deprecated. */
12655 warn_deprecated_use (tree node
, tree attr
)
12659 if (node
== 0 || !warn_deprecated_decl
)
12665 attr
= DECL_ATTRIBUTES (node
);
12666 else if (TYPE_P (node
))
12668 tree decl
= TYPE_STUB_DECL (node
);
12670 attr
= lookup_attribute ("deprecated",
12671 TYPE_ATTRIBUTES (TREE_TYPE (decl
)));
12676 attr
= lookup_attribute ("deprecated", attr
);
12679 msg
= TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr
)));
12687 w
= warning (OPT_Wdeprecated_declarations
,
12688 "%qD is deprecated: %s", node
, msg
);
12690 w
= warning (OPT_Wdeprecated_declarations
,
12691 "%qD is deprecated", node
);
12693 inform (DECL_SOURCE_LOCATION (node
), "declared here");
12695 else if (TYPE_P (node
))
12697 tree what
= NULL_TREE
;
12698 tree decl
= TYPE_STUB_DECL (node
);
12700 if (TYPE_NAME (node
))
12702 if (TREE_CODE (TYPE_NAME (node
)) == IDENTIFIER_NODE
)
12703 what
= TYPE_NAME (node
);
12704 else if (TREE_CODE (TYPE_NAME (node
)) == TYPE_DECL
12705 && DECL_NAME (TYPE_NAME (node
)))
12706 what
= DECL_NAME (TYPE_NAME (node
));
12714 w
= warning (OPT_Wdeprecated_declarations
,
12715 "%qE is deprecated: %s", what
, msg
);
12717 w
= warning (OPT_Wdeprecated_declarations
,
12718 "%qE is deprecated", what
);
12723 w
= warning (OPT_Wdeprecated_declarations
,
12724 "type is deprecated: %s", msg
);
12726 w
= warning (OPT_Wdeprecated_declarations
,
12727 "type is deprecated");
12730 inform (DECL_SOURCE_LOCATION (decl
), "declared here");
12737 warning (OPT_Wdeprecated_declarations
, "%qE is deprecated: %s",
12740 warning (OPT_Wdeprecated_declarations
, "%qE is deprecated", what
);
12745 warning (OPT_Wdeprecated_declarations
, "type is deprecated: %s",
12748 warning (OPT_Wdeprecated_declarations
, "type is deprecated");
12754 /* Return true if REF has a COMPONENT_REF with a bit-field field declaration
12755 somewhere in it. */
12758 contains_bitfld_component_ref_p (const_tree ref
)
12760 while (handled_component_p (ref
))
12762 if (TREE_CODE (ref
) == COMPONENT_REF
12763 && DECL_BIT_FIELD (TREE_OPERAND (ref
, 1)))
12765 ref
= TREE_OPERAND (ref
, 0);
12771 /* Try to determine whether a TRY_CATCH expression can fall through.
12772 This is a subroutine of block_may_fallthru. */
12775 try_catch_may_fallthru (const_tree stmt
)
12777 tree_stmt_iterator i
;
12779 /* If the TRY block can fall through, the whole TRY_CATCH can
12781 if (block_may_fallthru (TREE_OPERAND (stmt
, 0)))
12784 i
= tsi_start (TREE_OPERAND (stmt
, 1));
12785 switch (TREE_CODE (tsi_stmt (i
)))
12788 /* We expect to see a sequence of CATCH_EXPR trees, each with a
12789 catch expression and a body. The whole TRY_CATCH may fall
12790 through iff any of the catch bodies falls through. */
12791 for (; !tsi_end_p (i
); tsi_next (&i
))
12793 if (block_may_fallthru (CATCH_BODY (tsi_stmt (i
))))
12798 case EH_FILTER_EXPR
:
12799 /* The exception filter expression only matters if there is an
12800 exception. If the exception does not match EH_FILTER_TYPES,
12801 we will execute EH_FILTER_FAILURE, and we will fall through
12802 if that falls through. If the exception does match
12803 EH_FILTER_TYPES, the stack unwinder will continue up the
12804 stack, so we will not fall through. We don't know whether we
12805 will throw an exception which matches EH_FILTER_TYPES or not,
12806 so we just ignore EH_FILTER_TYPES and assume that we might
12807 throw an exception which doesn't match. */
12808 return block_may_fallthru (EH_FILTER_FAILURE (tsi_stmt (i
)));
12811 /* This case represents statements to be executed when an
12812 exception occurs. Those statements are implicitly followed
12813 by a RESX statement to resume execution after the exception.
12814 So in this case the TRY_CATCH never falls through. */
12819 /* Try to determine if we can fall out of the bottom of BLOCK. This guess
12820 need not be 100% accurate; simply be conservative and return true if we
12821 don't know. This is used only to avoid stupidly generating extra code.
12822 If we're wrong, we'll just delete the extra code later. */
12825 block_may_fallthru (const_tree block
)
12827 /* This CONST_CAST is okay because expr_last returns its argument
12828 unmodified and we assign it to a const_tree. */
12829 const_tree stmt
= expr_last (CONST_CAST_TREE (block
));
12831 switch (stmt
? TREE_CODE (stmt
) : ERROR_MARK
)
12835 /* Easy cases. If the last statement of the block implies
12836 control transfer, then we can't fall through. */
12840 /* If SWITCH_LABELS is set, this is lowered, and represents a
12841 branch to a selected label and hence can not fall through.
12842 Otherwise SWITCH_BODY is set, and the switch can fall
12844 return SWITCH_LABELS (stmt
) == NULL_TREE
;
12847 if (block_may_fallthru (COND_EXPR_THEN (stmt
)))
12849 return block_may_fallthru (COND_EXPR_ELSE (stmt
));
12852 return block_may_fallthru (BIND_EXPR_BODY (stmt
));
12854 case TRY_CATCH_EXPR
:
12855 return try_catch_may_fallthru (stmt
);
12857 case TRY_FINALLY_EXPR
:
12858 /* The finally clause is always executed after the try clause,
12859 so if it does not fall through, then the try-finally will not
12860 fall through. Otherwise, if the try clause does not fall
12861 through, then when the finally clause falls through it will
12862 resume execution wherever the try clause was going. So the
12863 whole try-finally will only fall through if both the try
12864 clause and the finally clause fall through. */
12865 return (block_may_fallthru (TREE_OPERAND (stmt
, 0))
12866 && block_may_fallthru (TREE_OPERAND (stmt
, 1)));
12869 if (TREE_CODE (TREE_OPERAND (stmt
, 1)) == CALL_EXPR
)
12870 stmt
= TREE_OPERAND (stmt
, 1);
12876 /* Functions that do not return do not fall through. */
12877 return (call_expr_flags (stmt
) & ECF_NORETURN
) == 0;
12879 case CLEANUP_POINT_EXPR
:
12880 return block_may_fallthru (TREE_OPERAND (stmt
, 0));
12883 return block_may_fallthru (TREE_OPERAND (stmt
, 1));
12889 return lang_hooks
.block_may_fallthru (stmt
);
12893 /* True if we are using EH to handle cleanups. */
12894 static bool using_eh_for_cleanups_flag
= false;
12896 /* This routine is called from front ends to indicate eh should be used for
12899 using_eh_for_cleanups (void)
12901 using_eh_for_cleanups_flag
= true;
12904 /* Query whether EH is used for cleanups. */
12906 using_eh_for_cleanups_p (void)
12908 return using_eh_for_cleanups_flag
;
12911 /* Wrapper for tree_code_name to ensure that tree code is valid */
12913 get_tree_code_name (enum tree_code code
)
12915 const char *invalid
= "<invalid tree code>";
12917 if (code
>= MAX_TREE_CODES
)
12920 return tree_code_name
[code
];
12923 /* Drops the TREE_OVERFLOW flag from T. */
12926 drop_tree_overflow (tree t
)
12928 gcc_checking_assert (TREE_OVERFLOW (t
));
12930 /* For tree codes with a sharing machinery re-build the result. */
12931 if (TREE_CODE (t
) == INTEGER_CST
)
12932 return wide_int_to_tree (TREE_TYPE (t
), t
);
12934 /* Otherwise, as all tcc_constants are possibly shared, copy the node
12935 and drop the flag. */
12937 TREE_OVERFLOW (t
) = 0;
12941 /* Given a memory reference expression T, return its base address.
12942 The base address of a memory reference expression is the main
12943 object being referenced. For instance, the base address for
12944 'array[i].fld[j]' is 'array'. You can think of this as stripping
12945 away the offset part from a memory address.
12947 This function calls handled_component_p to strip away all the inner
12948 parts of the memory reference until it reaches the base object. */
12951 get_base_address (tree t
)
12953 while (handled_component_p (t
))
12954 t
= TREE_OPERAND (t
, 0);
12956 if ((TREE_CODE (t
) == MEM_REF
12957 || TREE_CODE (t
) == TARGET_MEM_REF
)
12958 && TREE_CODE (TREE_OPERAND (t
, 0)) == ADDR_EXPR
)
12959 t
= TREE_OPERAND (TREE_OPERAND (t
, 0), 0);
12961 /* ??? Either the alias oracle or all callers need to properly deal
12962 with WITH_SIZE_EXPRs before we can look through those. */
12963 if (TREE_CODE (t
) == WITH_SIZE_EXPR
)
12969 /* Return a tree of sizetype representing the size, in bytes, of the element
12970 of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
12973 array_ref_element_size (tree exp
)
12975 tree aligned_size
= TREE_OPERAND (exp
, 3);
12976 tree elmt_type
= TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp
, 0)));
12977 location_t loc
= EXPR_LOCATION (exp
);
12979 /* If a size was specified in the ARRAY_REF, it's the size measured
12980 in alignment units of the element type. So multiply by that value. */
12983 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
12984 sizetype from another type of the same width and signedness. */
12985 if (TREE_TYPE (aligned_size
) != sizetype
)
12986 aligned_size
= fold_convert_loc (loc
, sizetype
, aligned_size
);
12987 return size_binop_loc (loc
, MULT_EXPR
, aligned_size
,
12988 size_int (TYPE_ALIGN_UNIT (elmt_type
)));
12991 /* Otherwise, take the size from that of the element type. Substitute
12992 any PLACEHOLDER_EXPR that we have. */
12994 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_SIZE_UNIT (elmt_type
), exp
);
12997 /* Return a tree representing the lower bound of the array mentioned in
12998 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
13001 array_ref_low_bound (tree exp
)
13003 tree domain_type
= TYPE_DOMAIN (TREE_TYPE (TREE_OPERAND (exp
, 0)));
13005 /* If a lower bound is specified in EXP, use it. */
13006 if (TREE_OPERAND (exp
, 2))
13007 return TREE_OPERAND (exp
, 2);
13009 /* Otherwise, if there is a domain type and it has a lower bound, use it,
13010 substituting for a PLACEHOLDER_EXPR as needed. */
13011 if (domain_type
&& TYPE_MIN_VALUE (domain_type
))
13012 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_MIN_VALUE (domain_type
), exp
);
13014 /* Otherwise, return a zero of the appropriate type. */
13015 return build_int_cst (TREE_TYPE (TREE_OPERAND (exp
, 1)), 0);
13018 /* Return a tree representing the upper bound of the array mentioned in
13019 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
13022 array_ref_up_bound (tree exp
)
13024 tree domain_type
= TYPE_DOMAIN (TREE_TYPE (TREE_OPERAND (exp
, 0)));
13026 /* If there is a domain type and it has an upper bound, use it, substituting
13027 for a PLACEHOLDER_EXPR as needed. */
13028 if (domain_type
&& TYPE_MAX_VALUE (domain_type
))
13029 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_MAX_VALUE (domain_type
), exp
);
13031 /* Otherwise fail. */
13035 /* Returns true if REF is an array reference to an array at the end of
13036 a structure. If this is the case, the array may be allocated larger
13037 than its upper bound implies. */
13040 array_at_struct_end_p (tree ref
)
13042 if (TREE_CODE (ref
) != ARRAY_REF
13043 && TREE_CODE (ref
) != ARRAY_RANGE_REF
)
13046 while (handled_component_p (ref
))
13048 /* If the reference chain contains a component reference to a
13049 non-union type and there follows another field the reference
13050 is not at the end of a structure. */
13051 if (TREE_CODE (ref
) == COMPONENT_REF
13052 && TREE_CODE (TREE_TYPE (TREE_OPERAND (ref
, 0))) == RECORD_TYPE
)
13054 tree nextf
= DECL_CHAIN (TREE_OPERAND (ref
, 1));
13055 while (nextf
&& TREE_CODE (nextf
) != FIELD_DECL
)
13056 nextf
= DECL_CHAIN (nextf
);
13061 ref
= TREE_OPERAND (ref
, 0);
13064 /* If the reference is based on a declared entity, the size of the array
13065 is constrained by its given domain. (Do not trust commons PR/69368). */
13067 && !(flag_unconstrained_commons
13068 && TREE_CODE (ref
) == VAR_DECL
&& DECL_COMMON (ref
)))
13074 /* Return a tree representing the offset, in bytes, of the field referenced
13075 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
13078 component_ref_field_offset (tree exp
)
13080 tree aligned_offset
= TREE_OPERAND (exp
, 2);
13081 tree field
= TREE_OPERAND (exp
, 1);
13082 location_t loc
= EXPR_LOCATION (exp
);
13084 /* If an offset was specified in the COMPONENT_REF, it's the offset measured
13085 in units of DECL_OFFSET_ALIGN / BITS_PER_UNIT. So multiply by that
13087 if (aligned_offset
)
13089 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
13090 sizetype from another type of the same width and signedness. */
13091 if (TREE_TYPE (aligned_offset
) != sizetype
)
13092 aligned_offset
= fold_convert_loc (loc
, sizetype
, aligned_offset
);
13093 return size_binop_loc (loc
, MULT_EXPR
, aligned_offset
,
13094 size_int (DECL_OFFSET_ALIGN (field
)
13098 /* Otherwise, take the offset from that of the field. Substitute
13099 any PLACEHOLDER_EXPR that we have. */
13101 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (DECL_FIELD_OFFSET (field
), exp
);
13104 /* Return the machine mode of T. For vectors, returns the mode of the
13105 inner type. The main use case is to feed the result to HONOR_NANS,
13106 avoiding the BLKmode that a direct TYPE_MODE (T) might return. */
13109 element_mode (const_tree t
)
13113 if (VECTOR_TYPE_P (t
) || TREE_CODE (t
) == COMPLEX_TYPE
)
13115 return TYPE_MODE (t
);
13119 /* Veirfy that basic properties of T match TV and thus T can be a variant of
13120 TV. TV should be the more specified variant (i.e. the main variant). */
13123 verify_type_variant (const_tree t
, tree tv
)
13125 /* Type variant can differ by:
13127 - TYPE_QUALS: TYPE_READONLY, TYPE_VOLATILE, TYPE_ATOMIC, TYPE_RESTRICT,
13128 ENCODE_QUAL_ADDR_SPACE.
13129 - main variant may be TYPE_COMPLETE_P and variant types !TYPE_COMPLETE_P
13130 in this case some values may not be set in the variant types
13131 (see TYPE_COMPLETE_P checks).
13132 - it is possible to have TYPE_ARTIFICIAL variant of non-artifical type
13133 - by TYPE_NAME and attributes (i.e. when variant originate by typedef)
13134 - TYPE_CANONICAL (TYPE_ALIAS_SET is the same among variants)
13135 - by the alignment: TYPE_ALIGN and TYPE_USER_ALIGN
13136 - during LTO by TYPE_CONTEXT if type is TYPE_FILE_SCOPE_P
13137 this is necessary to make it possible to merge types form different TUs
13138 - arrays, pointers and references may have TREE_TYPE that is a variant
13139 of TREE_TYPE of their main variants.
13140 - aggregates may have new TYPE_FIELDS list that list variants of
13141 the main variant TYPE_FIELDS.
13142 - vector types may differ by TYPE_VECTOR_OPAQUE
13143 - TYPE_METHODS is always NULL for vairant types and maintained for
13147 /* Convenience macro for matching individual fields. */
13148 #define verify_variant_match(flag) \
13150 if (flag (tv) != flag (t)) \
13152 error ("type variant differs by " #flag "."); \
13158 /* tree_base checks. */
13160 verify_variant_match (TREE_CODE
);
13161 /* FIXME: Ada builds non-artificial variants of artificial types. */
13162 if (TYPE_ARTIFICIAL (tv
) && 0)
13163 verify_variant_match (TYPE_ARTIFICIAL
);
13164 if (POINTER_TYPE_P (tv
))
13165 verify_variant_match (TYPE_REF_CAN_ALIAS_ALL
);
13166 /* FIXME: TYPE_SIZES_GIMPLIFIED may differs for Ada build. */
13167 verify_variant_match (TYPE_UNSIGNED
);
13168 verify_variant_match (TYPE_ALIGN_OK
);
13169 verify_variant_match (TYPE_PACKED
);
13170 if (TREE_CODE (t
) == REFERENCE_TYPE
)
13171 verify_variant_match (TYPE_REF_IS_RVALUE
);
13172 if (AGGREGATE_TYPE_P (t
))
13173 verify_variant_match (TYPE_REVERSE_STORAGE_ORDER
);
13175 verify_variant_match (TYPE_SATURATING
);
13176 /* FIXME: This check trigger during libstdc++ build. */
13177 if (RECORD_OR_UNION_TYPE_P (t
) && COMPLETE_TYPE_P (t
) && 0)
13178 verify_variant_match (TYPE_FINAL_P
);
13180 /* tree_type_common checks. */
13182 if (COMPLETE_TYPE_P (t
))
13184 verify_variant_match (TYPE_SIZE
);
13185 verify_variant_match (TYPE_MODE
);
13186 if (TYPE_SIZE_UNIT (t
) != TYPE_SIZE_UNIT (tv
)
13187 /* FIXME: ideally we should compare pointer equality, but java FE
13188 produce variants where size is INTEGER_CST of different type (int
13189 wrt size_type) during libjava biuld. */
13190 && !operand_equal_p (TYPE_SIZE_UNIT (t
), TYPE_SIZE_UNIT (tv
), 0))
13192 error ("type variant has different TYPE_SIZE_UNIT");
13194 error ("type variant's TYPE_SIZE_UNIT");
13195 debug_tree (TYPE_SIZE_UNIT (tv
));
13196 error ("type's TYPE_SIZE_UNIT");
13197 debug_tree (TYPE_SIZE_UNIT (t
));
13201 verify_variant_match (TYPE_PRECISION
);
13202 verify_variant_match (TYPE_NEEDS_CONSTRUCTING
);
13203 if (RECORD_OR_UNION_TYPE_P (t
))
13204 verify_variant_match (TYPE_TRANSPARENT_AGGR
);
13205 else if (TREE_CODE (t
) == ARRAY_TYPE
)
13206 verify_variant_match (TYPE_NONALIASED_COMPONENT
);
13207 /* During LTO we merge variant lists from diferent translation units
13208 that may differ BY TYPE_CONTEXT that in turn may point
13209 to TRANSLATION_UNIT_DECL.
13210 Ada also builds variants of types with different TYPE_CONTEXT. */
13211 if ((!in_lto_p
|| !TYPE_FILE_SCOPE_P (t
)) && 0)
13212 verify_variant_match (TYPE_CONTEXT
);
13213 verify_variant_match (TYPE_STRING_FLAG
);
13214 if (TYPE_ALIAS_SET_KNOWN_P (t
))
13216 error ("type variant with TYPE_ALIAS_SET_KNOWN_P");
13221 /* tree_type_non_common checks. */
13223 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
13224 and dangle the pointer from time to time. */
13225 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_VFIELD (t
) != TYPE_VFIELD (tv
)
13226 && (in_lto_p
|| !TYPE_VFIELD (tv
)
13227 || TREE_CODE (TYPE_VFIELD (tv
)) != TREE_LIST
))
13229 error ("type variant has different TYPE_VFIELD");
13233 if ((TREE_CODE (t
) == ENUMERAL_TYPE
&& COMPLETE_TYPE_P (t
))
13234 || TREE_CODE (t
) == INTEGER_TYPE
13235 || TREE_CODE (t
) == BOOLEAN_TYPE
13236 || TREE_CODE (t
) == REAL_TYPE
13237 || TREE_CODE (t
) == FIXED_POINT_TYPE
)
13239 verify_variant_match (TYPE_MAX_VALUE
);
13240 verify_variant_match (TYPE_MIN_VALUE
);
13242 if (TREE_CODE (t
) == METHOD_TYPE
)
13243 verify_variant_match (TYPE_METHOD_BASETYPE
);
13244 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_METHODS (t
))
13246 error ("type variant has TYPE_METHODS");
13250 if (TREE_CODE (t
) == OFFSET_TYPE
)
13251 verify_variant_match (TYPE_OFFSET_BASETYPE
);
13252 if (TREE_CODE (t
) == ARRAY_TYPE
)
13253 verify_variant_match (TYPE_ARRAY_MAX_SIZE
);
13254 /* FIXME: Be lax and allow TYPE_BINFO to be missing in variant types
13255 or even type's main variant. This is needed to make bootstrap pass
13256 and the bug seems new in GCC 5.
13257 C++ FE should be updated to make this consistent and we should check
13258 that TYPE_BINFO is always NULL for !COMPLETE_TYPE_P and otherwise there
13259 is a match with main variant.
13261 Also disable the check for Java for now because of parser hack that builds
13262 first an dummy BINFO and then sometimes replace it by real BINFO in some
13264 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_BINFO (t
) && TYPE_BINFO (tv
)
13265 && TYPE_BINFO (t
) != TYPE_BINFO (tv
)
13266 /* FIXME: Java sometimes keep dump TYPE_BINFOs on variant types.
13267 Since there is no cheap way to tell C++/Java type w/o LTO, do checking
13268 at LTO time only. */
13269 && (in_lto_p
&& odr_type_p (t
)))
13271 error ("type variant has different TYPE_BINFO");
13273 error ("type variant's TYPE_BINFO");
13274 debug_tree (TYPE_BINFO (tv
));
13275 error ("type's TYPE_BINFO");
13276 debug_tree (TYPE_BINFO (t
));
13280 /* Check various uses of TYPE_VALUES_RAW. */
13281 if (TREE_CODE (t
) == ENUMERAL_TYPE
)
13282 verify_variant_match (TYPE_VALUES
);
13283 else if (TREE_CODE (t
) == ARRAY_TYPE
)
13284 verify_variant_match (TYPE_DOMAIN
);
13285 /* Permit incomplete variants of complete type. While FEs may complete
13286 all variants, this does not happen for C++ templates in all cases. */
13287 else if (RECORD_OR_UNION_TYPE_P (t
)
13288 && COMPLETE_TYPE_P (t
)
13289 && TYPE_FIELDS (t
) != TYPE_FIELDS (tv
))
13293 /* Fortran builds qualified variants as new records with items of
13294 qualified type. Verify that they looks same. */
13295 for (f1
= TYPE_FIELDS (t
), f2
= TYPE_FIELDS (tv
);
13297 f1
= TREE_CHAIN (f1
), f2
= TREE_CHAIN (f2
))
13298 if (TREE_CODE (f1
) != FIELD_DECL
|| TREE_CODE (f2
) != FIELD_DECL
13299 || (TYPE_MAIN_VARIANT (TREE_TYPE (f1
))
13300 != TYPE_MAIN_VARIANT (TREE_TYPE (f2
))
13301 /* FIXME: gfc_nonrestricted_type builds all types as variants
13302 with exception of pointer types. It deeply copies the type
13303 which means that we may end up with a variant type
13304 referring non-variant pointer. We may change it to
13305 produce types as variants, too, like
13306 objc_get_protocol_qualified_type does. */
13307 && !POINTER_TYPE_P (TREE_TYPE (f1
)))
13308 || DECL_FIELD_OFFSET (f1
) != DECL_FIELD_OFFSET (f2
)
13309 || DECL_FIELD_BIT_OFFSET (f1
) != DECL_FIELD_BIT_OFFSET (f2
))
13313 error ("type variant has different TYPE_FIELDS");
13315 error ("first mismatch is field");
13317 error ("and field");
13322 else if ((TREE_CODE (t
) == FUNCTION_TYPE
|| TREE_CODE (t
) == METHOD_TYPE
))
13323 verify_variant_match (TYPE_ARG_TYPES
);
13324 /* For C++ the qualified variant of array type is really an array type
13325 of qualified TREE_TYPE.
13326 objc builds variants of pointer where pointer to type is a variant, too
13327 in objc_get_protocol_qualified_type. */
13328 if (TREE_TYPE (t
) != TREE_TYPE (tv
)
13329 && ((TREE_CODE (t
) != ARRAY_TYPE
13330 && !POINTER_TYPE_P (t
))
13331 || TYPE_MAIN_VARIANT (TREE_TYPE (t
))
13332 != TYPE_MAIN_VARIANT (TREE_TYPE (tv
))))
13334 error ("type variant has different TREE_TYPE");
13336 error ("type variant's TREE_TYPE");
13337 debug_tree (TREE_TYPE (tv
));
13338 error ("type's TREE_TYPE");
13339 debug_tree (TREE_TYPE (t
));
13342 if (type_with_alias_set_p (t
)
13343 && !gimple_canonical_types_compatible_p (t
, tv
, false))
13345 error ("type is not compatible with its vairant");
13347 error ("type variant's TREE_TYPE");
13348 debug_tree (TREE_TYPE (tv
));
13349 error ("type's TREE_TYPE");
13350 debug_tree (TREE_TYPE (t
));
13354 #undef verify_variant_match
13358 /* The TYPE_CANONICAL merging machinery. It should closely resemble
13359 the middle-end types_compatible_p function. It needs to avoid
13360 claiming types are different for types that should be treated
13361 the same with respect to TBAA. Canonical types are also used
13362 for IL consistency checks via the useless_type_conversion_p
13363 predicate which does not handle all type kinds itself but falls
13364 back to pointer-comparison of TYPE_CANONICAL for aggregates
13367 /* Return true if TYPE_UNSIGNED of TYPE should be ignored for canonical
13368 type calculation because we need to allow inter-operability between signed
13369 and unsigned variants. */
13372 type_with_interoperable_signedness (const_tree type
)
13374 /* Fortran standard require C_SIGNED_CHAR to be interoperable with both
13375 signed char and unsigned char. Similarly fortran FE builds
13376 C_SIZE_T as signed type, while C defines it unsigned. */
13378 return tree_code_for_canonical_type_merging (TREE_CODE (type
))
13380 && (TYPE_PRECISION (type
) == TYPE_PRECISION (signed_char_type_node
)
13381 || TYPE_PRECISION (type
) == TYPE_PRECISION (size_type_node
));
13384 /* Return true iff T1 and T2 are structurally identical for what
13386 This function is used both by lto.c canonical type merging and by the
13387 verifier. If TRUST_TYPE_CANONICAL we do not look into structure of types
13388 that have TYPE_CANONICAL defined and assume them equivalent. This is useful
13389 only for LTO because only in these cases TYPE_CANONICAL equivalence
13390 correspond to one defined by gimple_canonical_types_compatible_p. */
13393 gimple_canonical_types_compatible_p (const_tree t1
, const_tree t2
,
13394 bool trust_type_canonical
)
13396 /* Type variants should be same as the main variant. When not doing sanity
13397 checking to verify this fact, go to main variants and save some work. */
13398 if (trust_type_canonical
)
13400 t1
= TYPE_MAIN_VARIANT (t1
);
13401 t2
= TYPE_MAIN_VARIANT (t2
);
13404 /* Check first for the obvious case of pointer identity. */
13408 /* Check that we have two types to compare. */
13409 if (t1
== NULL_TREE
|| t2
== NULL_TREE
)
13412 /* We consider complete types always compatible with incomplete type.
13413 This does not make sense for canonical type calculation and thus we
13414 need to ensure that we are never called on it.
13416 FIXME: For more correctness the function probably should have three modes
13417 1) mode assuming that types are complete mathcing their structure
13418 2) mode allowing incomplete types but producing equivalence classes
13419 and thus ignoring all info from complete types
13420 3) mode allowing incomplete types to match complete but checking
13421 compatibility between complete types.
13423 1 and 2 can be used for canonical type calculation. 3 is the real
13424 definition of type compatibility that can be used i.e. for warnings during
13425 declaration merging. */
13427 gcc_assert (!trust_type_canonical
13428 || (type_with_alias_set_p (t1
) && type_with_alias_set_p (t2
)));
13429 /* If the types have been previously registered and found equal
13432 if (TYPE_CANONICAL (t1
) && TYPE_CANONICAL (t2
)
13433 && trust_type_canonical
)
13435 /* Do not use TYPE_CANONICAL of pointer types. For LTO streamed types
13436 they are always NULL, but they are set to non-NULL for types
13437 constructed by build_pointer_type and variants. In this case the
13438 TYPE_CANONICAL is more fine grained than the equivalnce we test (where
13439 all pointers are considered equal. Be sure to not return false
13441 gcc_checking_assert (canonical_type_used_p (t1
)
13442 && canonical_type_used_p (t2
));
13443 return TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
);
13446 /* Can't be the same type if the types don't have the same code. */
13447 enum tree_code code
= tree_code_for_canonical_type_merging (TREE_CODE (t1
));
13448 if (code
!= tree_code_for_canonical_type_merging (TREE_CODE (t2
)))
13451 /* Qualifiers do not matter for canonical type comparison purposes. */
13453 /* Void types and nullptr types are always the same. */
13454 if (TREE_CODE (t1
) == VOID_TYPE
13455 || TREE_CODE (t1
) == NULLPTR_TYPE
)
13458 /* Can't be the same type if they have different mode. */
13459 if (TYPE_MODE (t1
) != TYPE_MODE (t2
))
13462 /* Non-aggregate types can be handled cheaply. */
13463 if (INTEGRAL_TYPE_P (t1
)
13464 || SCALAR_FLOAT_TYPE_P (t1
)
13465 || FIXED_POINT_TYPE_P (t1
)
13466 || TREE_CODE (t1
) == VECTOR_TYPE
13467 || TREE_CODE (t1
) == COMPLEX_TYPE
13468 || TREE_CODE (t1
) == OFFSET_TYPE
13469 || POINTER_TYPE_P (t1
))
13471 /* Can't be the same type if they have different recision. */
13472 if (TYPE_PRECISION (t1
) != TYPE_PRECISION (t2
))
13475 /* In some cases the signed and unsigned types are required to be
13477 if (TYPE_UNSIGNED (t1
) != TYPE_UNSIGNED (t2
)
13478 && !type_with_interoperable_signedness (t1
))
13481 /* Fortran's C_SIGNED_CHAR is !TYPE_STRING_FLAG but needs to be
13482 interoperable with "signed char". Unless all frontends are revisited
13483 to agree on these types, we must ignore the flag completely. */
13485 /* Fortran standard define C_PTR type that is compatible with every
13486 C pointer. For this reason we need to glob all pointers into one.
13487 Still pointers in different address spaces are not compatible. */
13488 if (POINTER_TYPE_P (t1
))
13490 if (TYPE_ADDR_SPACE (TREE_TYPE (t1
))
13491 != TYPE_ADDR_SPACE (TREE_TYPE (t2
)))
13495 /* Tail-recurse to components. */
13496 if (TREE_CODE (t1
) == VECTOR_TYPE
13497 || TREE_CODE (t1
) == COMPLEX_TYPE
)
13498 return gimple_canonical_types_compatible_p (TREE_TYPE (t1
),
13500 trust_type_canonical
);
13505 /* Do type-specific comparisons. */
13506 switch (TREE_CODE (t1
))
13509 /* Array types are the same if the element types are the same and
13510 the number of elements are the same. */
13511 if (!gimple_canonical_types_compatible_p (TREE_TYPE (t1
), TREE_TYPE (t2
),
13512 trust_type_canonical
)
13513 || TYPE_STRING_FLAG (t1
) != TYPE_STRING_FLAG (t2
)
13514 || TYPE_REVERSE_STORAGE_ORDER (t1
) != TYPE_REVERSE_STORAGE_ORDER (t2
)
13515 || TYPE_NONALIASED_COMPONENT (t1
) != TYPE_NONALIASED_COMPONENT (t2
))
13519 tree i1
= TYPE_DOMAIN (t1
);
13520 tree i2
= TYPE_DOMAIN (t2
);
13522 /* For an incomplete external array, the type domain can be
13523 NULL_TREE. Check this condition also. */
13524 if (i1
== NULL_TREE
&& i2
== NULL_TREE
)
13526 else if (i1
== NULL_TREE
|| i2
== NULL_TREE
)
13530 tree min1
= TYPE_MIN_VALUE (i1
);
13531 tree min2
= TYPE_MIN_VALUE (i2
);
13532 tree max1
= TYPE_MAX_VALUE (i1
);
13533 tree max2
= TYPE_MAX_VALUE (i2
);
13535 /* The minimum/maximum values have to be the same. */
13538 && ((TREE_CODE (min1
) == PLACEHOLDER_EXPR
13539 && TREE_CODE (min2
) == PLACEHOLDER_EXPR
)
13540 || operand_equal_p (min1
, min2
, 0))))
13543 && ((TREE_CODE (max1
) == PLACEHOLDER_EXPR
13544 && TREE_CODE (max2
) == PLACEHOLDER_EXPR
)
13545 || operand_equal_p (max1
, max2
, 0)))))
13553 case FUNCTION_TYPE
:
13554 /* Function types are the same if the return type and arguments types
13556 if (!gimple_canonical_types_compatible_p (TREE_TYPE (t1
), TREE_TYPE (t2
),
13557 trust_type_canonical
))
13560 if (TYPE_ARG_TYPES (t1
) == TYPE_ARG_TYPES (t2
))
13564 tree parms1
, parms2
;
13566 for (parms1
= TYPE_ARG_TYPES (t1
), parms2
= TYPE_ARG_TYPES (t2
);
13568 parms1
= TREE_CHAIN (parms1
), parms2
= TREE_CHAIN (parms2
))
13570 if (!gimple_canonical_types_compatible_p
13571 (TREE_VALUE (parms1
), TREE_VALUE (parms2
),
13572 trust_type_canonical
))
13576 if (parms1
|| parms2
)
13584 case QUAL_UNION_TYPE
:
13588 /* Don't try to compare variants of an incomplete type, before
13589 TYPE_FIELDS has been copied around. */
13590 if (!COMPLETE_TYPE_P (t1
) && !COMPLETE_TYPE_P (t2
))
13594 if (TYPE_REVERSE_STORAGE_ORDER (t1
) != TYPE_REVERSE_STORAGE_ORDER (t2
))
13597 /* For aggregate types, all the fields must be the same. */
13598 for (f1
= TYPE_FIELDS (t1
), f2
= TYPE_FIELDS (t2
);
13600 f1
= TREE_CHAIN (f1
), f2
= TREE_CHAIN (f2
))
13602 /* Skip non-fields. */
13603 while (f1
&& TREE_CODE (f1
) != FIELD_DECL
)
13604 f1
= TREE_CHAIN (f1
);
13605 while (f2
&& TREE_CODE (f2
) != FIELD_DECL
)
13606 f2
= TREE_CHAIN (f2
);
13609 /* The fields must have the same name, offset and type. */
13610 if (DECL_NONADDRESSABLE_P (f1
) != DECL_NONADDRESSABLE_P (f2
)
13611 || !gimple_compare_field_offset (f1
, f2
)
13612 || !gimple_canonical_types_compatible_p
13613 (TREE_TYPE (f1
), TREE_TYPE (f2
),
13614 trust_type_canonical
))
13618 /* If one aggregate has more fields than the other, they
13619 are not the same. */
13627 /* Consider all types with language specific trees in them mutually
13628 compatible. This is executed only from verify_type and false
13629 positives can be tolerated. */
13630 gcc_assert (!in_lto_p
);
13635 /* Verify type T. */
13638 verify_type (const_tree t
)
13640 bool error_found
= false;
13641 tree mv
= TYPE_MAIN_VARIANT (t
);
13644 error ("Main variant is not defined");
13645 error_found
= true;
13647 else if (mv
!= TYPE_MAIN_VARIANT (mv
))
13649 error ("TYPE_MAIN_VARIANT has different TYPE_MAIN_VARIANT");
13651 error_found
= true;
13653 else if (t
!= mv
&& !verify_type_variant (t
, mv
))
13654 error_found
= true;
13656 tree ct
= TYPE_CANONICAL (t
);
13659 else if (TYPE_CANONICAL (t
) != ct
)
13661 error ("TYPE_CANONICAL has different TYPE_CANONICAL");
13663 error_found
= true;
13665 /* Method and function types can not be used to address memory and thus
13666 TYPE_CANONICAL really matters only for determining useless conversions.
13668 FIXME: C++ FE produce declarations of builtin functions that are not
13669 compatible with main variants. */
13670 else if (TREE_CODE (t
) == FUNCTION_TYPE
)
13673 /* FIXME: gimple_canonical_types_compatible_p can not compare types
13674 with variably sized arrays because their sizes possibly
13675 gimplified to different variables. */
13676 && !variably_modified_type_p (ct
, NULL
)
13677 && !gimple_canonical_types_compatible_p (t
, ct
, false))
13679 error ("TYPE_CANONICAL is not compatible");
13681 error_found
= true;
13684 if (COMPLETE_TYPE_P (t
) && TYPE_CANONICAL (t
)
13685 && TYPE_MODE (t
) != TYPE_MODE (TYPE_CANONICAL (t
)))
13687 error ("TYPE_MODE of TYPE_CANONICAL is not compatible");
13689 error_found
= true;
13691 /* FIXME: this is violated by the C++ FE as discussed in PR70029, when
13692 FUNCTION_*_QUALIFIED flags are set. */
13693 if (0 && TYPE_MAIN_VARIANT (t
) == t
&& ct
&& TYPE_MAIN_VARIANT (ct
) != ct
)
13695 error ("TYPE_CANONICAL of main variant is not main variant");
13697 debug_tree (TYPE_MAIN_VARIANT (ct
));
13698 error_found
= true;
13702 /* Check various uses of TYPE_MINVAL. */
13703 if (RECORD_OR_UNION_TYPE_P (t
))
13705 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
13706 and danagle the pointer from time to time. */
13707 if (TYPE_VFIELD (t
)
13708 && TREE_CODE (TYPE_VFIELD (t
)) != FIELD_DECL
13709 && TREE_CODE (TYPE_VFIELD (t
)) != TREE_LIST
)
13711 error ("TYPE_VFIELD is not FIELD_DECL nor TREE_LIST");
13712 debug_tree (TYPE_VFIELD (t
));
13713 error_found
= true;
13716 else if (TREE_CODE (t
) == POINTER_TYPE
)
13718 if (TYPE_NEXT_PTR_TO (t
)
13719 && TREE_CODE (TYPE_NEXT_PTR_TO (t
)) != POINTER_TYPE
)
13721 error ("TYPE_NEXT_PTR_TO is not POINTER_TYPE");
13722 debug_tree (TYPE_NEXT_PTR_TO (t
));
13723 error_found
= true;
13726 else if (TREE_CODE (t
) == REFERENCE_TYPE
)
13728 if (TYPE_NEXT_REF_TO (t
)
13729 && TREE_CODE (TYPE_NEXT_REF_TO (t
)) != REFERENCE_TYPE
)
13731 error ("TYPE_NEXT_REF_TO is not REFERENCE_TYPE");
13732 debug_tree (TYPE_NEXT_REF_TO (t
));
13733 error_found
= true;
13736 else if (INTEGRAL_TYPE_P (t
) || TREE_CODE (t
) == REAL_TYPE
13737 || TREE_CODE (t
) == FIXED_POINT_TYPE
)
13739 /* FIXME: The following check should pass:
13740 useless_type_conversion_p (const_cast <tree> (t),
13741 TREE_TYPE (TYPE_MIN_VALUE (t))
13742 but does not for C sizetypes in LTO. */
13744 /* Java uses TYPE_MINVAL for TYPE_ARGUMENT_SIGNATURE. */
13745 else if (TYPE_MINVAL (t
)
13746 && ((TREE_CODE (t
) != METHOD_TYPE
&& TREE_CODE (t
) != FUNCTION_TYPE
)
13749 error ("TYPE_MINVAL non-NULL");
13750 debug_tree (TYPE_MINVAL (t
));
13751 error_found
= true;
13754 /* Check various uses of TYPE_MAXVAL. */
13755 if (RECORD_OR_UNION_TYPE_P (t
))
13757 if (TYPE_METHODS (t
) && TREE_CODE (TYPE_METHODS (t
)) != FUNCTION_DECL
13758 && TREE_CODE (TYPE_METHODS (t
)) != TEMPLATE_DECL
13759 && TYPE_METHODS (t
) != error_mark_node
)
13761 error ("TYPE_METHODS is not FUNCTION_DECL, TEMPLATE_DECL nor error_mark_node");
13762 debug_tree (TYPE_METHODS (t
));
13763 error_found
= true;
13766 else if (TREE_CODE (t
) == FUNCTION_TYPE
|| TREE_CODE (t
) == METHOD_TYPE
)
13768 if (TYPE_METHOD_BASETYPE (t
)
13769 && TREE_CODE (TYPE_METHOD_BASETYPE (t
)) != RECORD_TYPE
13770 && TREE_CODE (TYPE_METHOD_BASETYPE (t
)) != UNION_TYPE
)
13772 error ("TYPE_METHOD_BASETYPE is not record nor union");
13773 debug_tree (TYPE_METHOD_BASETYPE (t
));
13774 error_found
= true;
13777 else if (TREE_CODE (t
) == OFFSET_TYPE
)
13779 if (TYPE_OFFSET_BASETYPE (t
)
13780 && TREE_CODE (TYPE_OFFSET_BASETYPE (t
)) != RECORD_TYPE
13781 && TREE_CODE (TYPE_OFFSET_BASETYPE (t
)) != UNION_TYPE
)
13783 error ("TYPE_OFFSET_BASETYPE is not record nor union");
13784 debug_tree (TYPE_OFFSET_BASETYPE (t
));
13785 error_found
= true;
13788 else if (INTEGRAL_TYPE_P (t
) || TREE_CODE (t
) == REAL_TYPE
13789 || TREE_CODE (t
) == FIXED_POINT_TYPE
)
13791 /* FIXME: The following check should pass:
13792 useless_type_conversion_p (const_cast <tree> (t),
13793 TREE_TYPE (TYPE_MAX_VALUE (t))
13794 but does not for C sizetypes in LTO. */
13796 else if (TREE_CODE (t
) == ARRAY_TYPE
)
13798 if (TYPE_ARRAY_MAX_SIZE (t
)
13799 && TREE_CODE (TYPE_ARRAY_MAX_SIZE (t
)) != INTEGER_CST
)
13801 error ("TYPE_ARRAY_MAX_SIZE not INTEGER_CST");
13802 debug_tree (TYPE_ARRAY_MAX_SIZE (t
));
13803 error_found
= true;
13806 else if (TYPE_MAXVAL (t
))
13808 error ("TYPE_MAXVAL non-NULL");
13809 debug_tree (TYPE_MAXVAL (t
));
13810 error_found
= true;
13813 /* Check various uses of TYPE_BINFO. */
13814 if (RECORD_OR_UNION_TYPE_P (t
))
13816 if (!TYPE_BINFO (t
))
13818 else if (TREE_CODE (TYPE_BINFO (t
)) != TREE_BINFO
)
13820 error ("TYPE_BINFO is not TREE_BINFO");
13821 debug_tree (TYPE_BINFO (t
));
13822 error_found
= true;
13824 /* FIXME: Java builds invalid empty binfos that do not have
13826 else if (TREE_TYPE (TYPE_BINFO (t
)) != TYPE_MAIN_VARIANT (t
) && 0)
13828 error ("TYPE_BINFO type is not TYPE_MAIN_VARIANT");
13829 debug_tree (TREE_TYPE (TYPE_BINFO (t
)));
13830 error_found
= true;
13833 else if (TYPE_LANG_SLOT_1 (t
) && in_lto_p
)
13835 error ("TYPE_LANG_SLOT_1 (binfo) field is non-NULL");
13836 debug_tree (TYPE_LANG_SLOT_1 (t
));
13837 error_found
= true;
13840 /* Check various uses of TYPE_VALUES_RAW. */
13841 if (TREE_CODE (t
) == ENUMERAL_TYPE
)
13842 for (tree l
= TYPE_VALUES (t
); l
; l
= TREE_CHAIN (l
))
13844 tree value
= TREE_VALUE (l
);
13845 tree name
= TREE_PURPOSE (l
);
13847 /* C FE porduce INTEGER_CST of INTEGER_TYPE, while C++ FE uses
13848 CONST_DECL of ENUMERAL TYPE. */
13849 if (TREE_CODE (value
) != INTEGER_CST
&& TREE_CODE (value
) != CONST_DECL
)
13851 error ("Enum value is not CONST_DECL or INTEGER_CST");
13852 debug_tree (value
);
13854 error_found
= true;
13856 if (TREE_CODE (TREE_TYPE (value
)) != INTEGER_TYPE
13857 && !useless_type_conversion_p (const_cast <tree
> (t
), TREE_TYPE (value
)))
13859 error ("Enum value type is not INTEGER_TYPE nor convertible to the enum");
13860 debug_tree (value
);
13862 error_found
= true;
13864 if (TREE_CODE (name
) != IDENTIFIER_NODE
)
13866 error ("Enum value name is not IDENTIFIER_NODE");
13867 debug_tree (value
);
13869 error_found
= true;
13872 else if (TREE_CODE (t
) == ARRAY_TYPE
)
13874 if (TYPE_DOMAIN (t
) && TREE_CODE (TYPE_DOMAIN (t
)) != INTEGER_TYPE
)
13876 error ("Array TYPE_DOMAIN is not integer type");
13877 debug_tree (TYPE_DOMAIN (t
));
13878 error_found
= true;
13881 else if (RECORD_OR_UNION_TYPE_P (t
))
13883 if (TYPE_FIELDS (t
) && !COMPLETE_TYPE_P (t
) && in_lto_p
)
13885 error ("TYPE_FIELDS defined in incomplete type");
13886 error_found
= true;
13888 for (tree fld
= TYPE_FIELDS (t
); fld
; fld
= TREE_CHAIN (fld
))
13890 /* TODO: verify properties of decls. */
13891 if (TREE_CODE (fld
) == FIELD_DECL
)
13893 else if (TREE_CODE (fld
) == TYPE_DECL
)
13895 else if (TREE_CODE (fld
) == CONST_DECL
)
13897 else if (TREE_CODE (fld
) == VAR_DECL
)
13899 else if (TREE_CODE (fld
) == TEMPLATE_DECL
)
13901 else if (TREE_CODE (fld
) == USING_DECL
)
13905 error ("Wrong tree in TYPE_FIELDS list");
13907 error_found
= true;
13911 else if (TREE_CODE (t
) == INTEGER_TYPE
13912 || TREE_CODE (t
) == BOOLEAN_TYPE
13913 || TREE_CODE (t
) == OFFSET_TYPE
13914 || TREE_CODE (t
) == REFERENCE_TYPE
13915 || TREE_CODE (t
) == NULLPTR_TYPE
13916 || TREE_CODE (t
) == POINTER_TYPE
)
13918 if (TYPE_CACHED_VALUES_P (t
) != (TYPE_CACHED_VALUES (t
) != NULL
))
13920 error ("TYPE_CACHED_VALUES_P is %i while TYPE_CACHED_VALUES is %p",
13921 TYPE_CACHED_VALUES_P (t
), (void *)TYPE_CACHED_VALUES (t
));
13922 error_found
= true;
13924 else if (TYPE_CACHED_VALUES_P (t
) && TREE_CODE (TYPE_CACHED_VALUES (t
)) != TREE_VEC
)
13926 error ("TYPE_CACHED_VALUES is not TREE_VEC");
13927 debug_tree (TYPE_CACHED_VALUES (t
));
13928 error_found
= true;
13930 /* Verify just enough of cache to ensure that no one copied it to new type.
13931 All copying should go by copy_node that should clear it. */
13932 else if (TYPE_CACHED_VALUES_P (t
))
13935 for (i
= 0; i
< TREE_VEC_LENGTH (TYPE_CACHED_VALUES (t
)); i
++)
13936 if (TREE_VEC_ELT (TYPE_CACHED_VALUES (t
), i
)
13937 && TREE_TYPE (TREE_VEC_ELT (TYPE_CACHED_VALUES (t
), i
)) != t
)
13939 error ("wrong TYPE_CACHED_VALUES entry");
13940 debug_tree (TREE_VEC_ELT (TYPE_CACHED_VALUES (t
), i
));
13941 error_found
= true;
13946 else if (TREE_CODE (t
) == FUNCTION_TYPE
|| TREE_CODE (t
) == METHOD_TYPE
)
13947 for (tree l
= TYPE_ARG_TYPES (t
); l
; l
= TREE_CHAIN (l
))
13949 /* C++ FE uses TREE_PURPOSE to store initial values. */
13950 if (TREE_PURPOSE (l
) && in_lto_p
)
13952 error ("TREE_PURPOSE is non-NULL in TYPE_ARG_TYPES list");
13954 error_found
= true;
13956 if (!TYPE_P (TREE_VALUE (l
)))
13958 error ("Wrong entry in TYPE_ARG_TYPES list");
13960 error_found
= true;
13963 else if (!is_lang_specific (t
) && TYPE_VALUES_RAW (t
))
13965 error ("TYPE_VALUES_RAW field is non-NULL");
13966 debug_tree (TYPE_VALUES_RAW (t
));
13967 error_found
= true;
13969 if (TREE_CODE (t
) != INTEGER_TYPE
13970 && TREE_CODE (t
) != BOOLEAN_TYPE
13971 && TREE_CODE (t
) != OFFSET_TYPE
13972 && TREE_CODE (t
) != REFERENCE_TYPE
13973 && TREE_CODE (t
) != NULLPTR_TYPE
13974 && TREE_CODE (t
) != POINTER_TYPE
13975 && TYPE_CACHED_VALUES_P (t
))
13977 error ("TYPE_CACHED_VALUES_P is set while it should not");
13978 error_found
= true;
13980 if (TYPE_STRING_FLAG (t
)
13981 && TREE_CODE (t
) != ARRAY_TYPE
&& TREE_CODE (t
) != INTEGER_TYPE
)
13983 error ("TYPE_STRING_FLAG is set on wrong type code");
13984 error_found
= true;
13986 else if (TYPE_STRING_FLAG (t
))
13989 if (TREE_CODE (b
) == ARRAY_TYPE
)
13991 /* Java builds arrays with TYPE_STRING_FLAG of promoted_char_type
13993 if (TREE_CODE (b
) != INTEGER_TYPE
)
13995 error ("TYPE_STRING_FLAG is set on type that does not look like "
13996 "char nor array of chars");
13997 error_found
= true;
14001 /* ipa-devirt makes an assumption that TYPE_METHOD_BASETYPE is always
14002 TYPE_MAIN_VARIANT and it would be odd to add methods only to variatns
14004 if (TREE_CODE (t
) == METHOD_TYPE
14005 && TYPE_MAIN_VARIANT (TYPE_METHOD_BASETYPE (t
)) != TYPE_METHOD_BASETYPE (t
))
14007 error ("TYPE_METHOD_BASETYPE is not main variant");
14008 error_found
= true;
14013 debug_tree (const_cast <tree
> (t
));
14014 internal_error ("verify_type failed");
14019 /* Return true if ARG is marked with the nonnull attribute in the
14020 current function signature. */
14023 nonnull_arg_p (const_tree arg
)
14025 tree t
, attrs
, fntype
;
14026 unsigned HOST_WIDE_INT arg_num
;
14028 gcc_assert (TREE_CODE (arg
) == PARM_DECL
14029 && (POINTER_TYPE_P (TREE_TYPE (arg
))
14030 || TREE_CODE (TREE_TYPE (arg
)) == OFFSET_TYPE
));
14032 /* The static chain decl is always non null. */
14033 if (arg
== cfun
->static_chain_decl
)
14036 /* THIS argument of method is always non-NULL. */
14037 if (TREE_CODE (TREE_TYPE (cfun
->decl
)) == METHOD_TYPE
14038 && arg
== DECL_ARGUMENTS (cfun
->decl
)
14039 && flag_delete_null_pointer_checks
)
14042 /* Values passed by reference are always non-NULL. */
14043 if (TREE_CODE (TREE_TYPE (arg
)) == REFERENCE_TYPE
14044 && flag_delete_null_pointer_checks
)
14047 fntype
= TREE_TYPE (cfun
->decl
);
14048 for (attrs
= TYPE_ATTRIBUTES (fntype
); attrs
; attrs
= TREE_CHAIN (attrs
))
14050 attrs
= lookup_attribute ("nonnull", attrs
);
14052 /* If "nonnull" wasn't specified, we know nothing about the argument. */
14053 if (attrs
== NULL_TREE
)
14056 /* If "nonnull" applies to all the arguments, then ARG is non-null. */
14057 if (TREE_VALUE (attrs
) == NULL_TREE
)
14060 /* Get the position number for ARG in the function signature. */
14061 for (arg_num
= 1, t
= DECL_ARGUMENTS (cfun
->decl
);
14063 t
= DECL_CHAIN (t
), arg_num
++)
14069 gcc_assert (t
== arg
);
14071 /* Now see if ARG_NUM is mentioned in the nonnull list. */
14072 for (t
= TREE_VALUE (attrs
); t
; t
= TREE_CHAIN (t
))
14074 if (compare_tree_int (TREE_VALUE (t
), arg_num
) == 0)
14082 /* Given location LOC, strip away any packed range information
14083 or ad-hoc information. */
14086 get_pure_location (location_t loc
)
14088 if (IS_ADHOC_LOC (loc
))
14090 = line_table
->location_adhoc_data_map
.data
[loc
& MAX_SOURCE_LOCATION
].locus
;
14092 if (loc
>= LINEMAPS_MACRO_LOWEST_LOCATION (line_table
))
14095 if (loc
< RESERVED_LOCATION_COUNT
)
14098 const line_map
*map
= linemap_lookup (line_table
, loc
);
14099 const line_map_ordinary
*ordmap
= linemap_check_ordinary (map
);
14101 return loc
& ~((1 << ordmap
->m_range_bits
) - 1);
14104 /* Combine LOC and BLOCK to a combined adhoc loc, retaining any range
14108 set_block (location_t loc
, tree block
)
14110 location_t pure_loc
= get_pure_location (loc
);
14111 source_range src_range
= get_range_from_loc (line_table
, loc
);
14112 return COMBINE_LOCATION_DATA (line_table
, pure_loc
, src_range
, block
);
14116 set_source_range (tree expr
, location_t start
, location_t finish
)
14118 source_range src_range
;
14119 src_range
.m_start
= start
;
14120 src_range
.m_finish
= finish
;
14121 return set_source_range (expr
, src_range
);
14125 set_source_range (tree expr
, source_range src_range
)
14127 if (!EXPR_P (expr
))
14128 return UNKNOWN_LOCATION
;
14130 location_t pure_loc
= get_pure_location (EXPR_LOCATION (expr
));
14131 location_t adhoc
= COMBINE_LOCATION_DATA (line_table
,
14135 SET_EXPR_LOCATION (expr
, adhoc
);
14140 make_location (location_t caret
, location_t start
, location_t finish
)
14142 location_t pure_loc
= get_pure_location (caret
);
14143 source_range src_range
;
14144 src_range
.m_start
= start
;
14145 src_range
.m_finish
= finish
;
14146 location_t combined_loc
= COMBINE_LOCATION_DATA (line_table
,
14150 return combined_loc
;
14153 /* Return the name of combined function FN, for debugging purposes. */
14156 combined_fn_name (combined_fn fn
)
14158 if (builtin_fn_p (fn
))
14160 tree fndecl
= builtin_decl_explicit (as_builtin_fn (fn
));
14161 return IDENTIFIER_POINTER (DECL_NAME (fndecl
));
14164 return internal_fn_name (as_internal_fn (fn
));
14167 #include "gt-tree.h"