1 /* Language-independent node constructors for parse phase of GNU compiler.
2 Copyright (C) 1987-2015 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"
40 #include "fold-const.h"
41 #include "stor-layout.h"
46 #include "toplev.h" /* get_random_seed */
47 #include "filenames.h"
50 #include "common/common-target.h"
51 #include "langhooks.h"
52 #include "tree-inline.h"
53 #include "tree-iterator.h"
54 #include "internal-fn.h"
55 #include "gimple-iterator.h"
58 #include "insn-config.h"
67 #include "tree-pass.h"
68 #include "langhooks-def.h"
69 #include "diagnostic.h"
70 #include "tree-diagnostic.h"
71 #include "tree-pretty-print.h"
76 #include "print-tree.h"
77 #include "ipa-utils.h"
79 /* Tree code classes. */
81 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) TYPE,
82 #define END_OF_BASE_TREE_CODES tcc_exceptional,
84 const enum tree_code_class tree_code_type
[] = {
85 #include "all-tree.def"
89 #undef END_OF_BASE_TREE_CODES
91 /* Table indexed by tree code giving number of expression
92 operands beyond the fixed part of the node structure.
93 Not used for types or decls. */
95 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) LENGTH,
96 #define END_OF_BASE_TREE_CODES 0,
98 const unsigned char tree_code_length
[] = {
99 #include "all-tree.def"
103 #undef END_OF_BASE_TREE_CODES
105 /* Names of tree components.
106 Used for printing out the tree and error messages. */
107 #define DEFTREECODE(SYM, NAME, TYPE, LEN) NAME,
108 #define END_OF_BASE_TREE_CODES "@dummy",
110 static const char *const tree_code_name
[] = {
111 #include "all-tree.def"
115 #undef END_OF_BASE_TREE_CODES
117 /* Each tree code class has an associated string representation.
118 These must correspond to the tree_code_class entries. */
120 const char *const tree_code_class_strings
[] =
135 /* obstack.[ch] explicitly declined to prototype this. */
136 extern int _obstack_allocated_p (struct obstack
*h
, void *obj
);
138 /* Statistics-gathering stuff. */
140 static int tree_code_counts
[MAX_TREE_CODES
];
141 int tree_node_counts
[(int) all_kinds
];
142 int tree_node_sizes
[(int) all_kinds
];
144 /* Keep in sync with tree.h:enum tree_node_kind. */
145 static const char * const tree_node_kind_names
[] = {
164 /* Unique id for next decl created. */
165 static GTY(()) int next_decl_uid
;
166 /* Unique id for next type created. */
167 static GTY(()) int next_type_uid
= 1;
168 /* Unique id for next debug decl created. Use negative numbers,
169 to catch erroneous uses. */
170 static GTY(()) int next_debug_decl_uid
;
172 /* Since we cannot rehash a type after it is in the table, we have to
173 keep the hash code. */
175 struct GTY((for_user
)) type_hash
{
180 /* Initial size of the hash table (rounded to next prime). */
181 #define TYPE_HASH_INITIAL_SIZE 1000
183 struct type_cache_hasher
: ggc_cache_ptr_hash
<type_hash
>
185 static hashval_t
hash (type_hash
*t
) { return t
->hash
; }
186 static bool equal (type_hash
*a
, type_hash
*b
);
189 keep_cache_entry (type_hash
*&t
)
191 return ggc_marked_p (t
->type
);
195 /* Now here is the hash table. When recording a type, it is added to
196 the slot whose index is the hash code. Note that the hash table is
197 used for several kinds of types (function types, array types and
198 array index range types, for now). While all these live in the
199 same table, they are completely independent, and the hash code is
200 computed differently for each of these. */
202 static GTY ((cache
)) hash_table
<type_cache_hasher
> *type_hash_table
;
204 /* Hash table and temporary node for larger integer const values. */
205 static GTY (()) tree int_cst_node
;
207 struct int_cst_hasher
: ggc_cache_ptr_hash
<tree_node
>
209 static hashval_t
hash (tree t
);
210 static bool equal (tree x
, tree y
);
213 static GTY ((cache
)) hash_table
<int_cst_hasher
> *int_cst_hash_table
;
215 /* Hash table for optimization flags and target option flags. Use the same
216 hash table for both sets of options. Nodes for building the current
217 optimization and target option nodes. The assumption is most of the time
218 the options created will already be in the hash table, so we avoid
219 allocating and freeing up a node repeatably. */
220 static GTY (()) tree cl_optimization_node
;
221 static GTY (()) tree cl_target_option_node
;
223 struct cl_option_hasher
: ggc_cache_ptr_hash
<tree_node
>
225 static hashval_t
hash (tree t
);
226 static bool equal (tree x
, tree y
);
229 static GTY ((cache
)) hash_table
<cl_option_hasher
> *cl_option_hash_table
;
231 /* General tree->tree mapping structure for use in hash tables. */
235 hash_table
<tree_decl_map_cache_hasher
> *debug_expr_for_decl
;
238 hash_table
<tree_decl_map_cache_hasher
> *value_expr_for_decl
;
240 struct tree_vec_map_cache_hasher
: ggc_cache_ptr_hash
<tree_vec_map
>
242 static hashval_t
hash (tree_vec_map
*m
) { return DECL_UID (m
->base
.from
); }
245 equal (tree_vec_map
*a
, tree_vec_map
*b
)
247 return a
->base
.from
== b
->base
.from
;
251 keep_cache_entry (tree_vec_map
*&m
)
253 return ggc_marked_p (m
->base
.from
);
258 hash_table
<tree_vec_map_cache_hasher
> *debug_args_for_decl
;
260 static void set_type_quals (tree
, int);
261 static void print_type_hash_statistics (void);
262 static void print_debug_expr_statistics (void);
263 static void print_value_expr_statistics (void);
264 static void type_hash_list (const_tree
, inchash::hash
&);
265 static void attribute_hash_list (const_tree
, inchash::hash
&);
267 tree global_trees
[TI_MAX
];
268 tree integer_types
[itk_none
];
270 bool int_n_enabled_p
[NUM_INT_N_ENTS
];
271 struct int_n_trees_t int_n_trees
[NUM_INT_N_ENTS
];
273 unsigned char tree_contains_struct
[MAX_TREE_CODES
][64];
275 /* Number of operands for each OpenMP clause. */
276 unsigned const char omp_clause_num_ops
[] =
278 0, /* OMP_CLAUSE_ERROR */
279 1, /* OMP_CLAUSE_PRIVATE */
280 1, /* OMP_CLAUSE_SHARED */
281 1, /* OMP_CLAUSE_FIRSTPRIVATE */
282 2, /* OMP_CLAUSE_LASTPRIVATE */
283 5, /* OMP_CLAUSE_REDUCTION */
284 1, /* OMP_CLAUSE_COPYIN */
285 1, /* OMP_CLAUSE_COPYPRIVATE */
286 3, /* OMP_CLAUSE_LINEAR */
287 2, /* OMP_CLAUSE_ALIGNED */
288 1, /* OMP_CLAUSE_DEPEND */
289 1, /* OMP_CLAUSE_UNIFORM */
290 1, /* OMP_CLAUSE_TO_DECLARE */
291 1, /* OMP_CLAUSE_LINK */
292 2, /* OMP_CLAUSE_FROM */
293 2, /* OMP_CLAUSE_TO */
294 2, /* OMP_CLAUSE_MAP */
295 1, /* OMP_CLAUSE_USE_DEVICE_PTR */
296 1, /* OMP_CLAUSE_IS_DEVICE_PTR */
297 2, /* OMP_CLAUSE__CACHE_ */
298 1, /* OMP_CLAUSE_DEVICE_RESIDENT */
299 1, /* OMP_CLAUSE_USE_DEVICE */
300 2, /* OMP_CLAUSE_GANG */
301 1, /* OMP_CLAUSE_ASYNC */
302 1, /* OMP_CLAUSE_WAIT */
303 0, /* OMP_CLAUSE_AUTO */
304 0, /* OMP_CLAUSE_SEQ */
305 1, /* OMP_CLAUSE__LOOPTEMP_ */
306 1, /* OMP_CLAUSE_IF */
307 1, /* OMP_CLAUSE_NUM_THREADS */
308 1, /* OMP_CLAUSE_SCHEDULE */
309 0, /* OMP_CLAUSE_NOWAIT */
310 1, /* OMP_CLAUSE_ORDERED */
311 0, /* OMP_CLAUSE_DEFAULT */
312 3, /* OMP_CLAUSE_COLLAPSE */
313 0, /* OMP_CLAUSE_UNTIED */
314 1, /* OMP_CLAUSE_FINAL */
315 0, /* OMP_CLAUSE_MERGEABLE */
316 1, /* OMP_CLAUSE_DEVICE */
317 1, /* OMP_CLAUSE_DIST_SCHEDULE */
318 0, /* OMP_CLAUSE_INBRANCH */
319 0, /* OMP_CLAUSE_NOTINBRANCH */
320 1, /* OMP_CLAUSE_NUM_TEAMS */
321 1, /* OMP_CLAUSE_THREAD_LIMIT */
322 0, /* OMP_CLAUSE_PROC_BIND */
323 1, /* OMP_CLAUSE_SAFELEN */
324 1, /* OMP_CLAUSE_SIMDLEN */
325 0, /* OMP_CLAUSE_FOR */
326 0, /* OMP_CLAUSE_PARALLEL */
327 0, /* OMP_CLAUSE_SECTIONS */
328 0, /* OMP_CLAUSE_TASKGROUP */
329 1, /* OMP_CLAUSE_PRIORITY */
330 1, /* OMP_CLAUSE_GRAINSIZE */
331 1, /* OMP_CLAUSE_NUM_TASKS */
332 0, /* OMP_CLAUSE_NOGROUP */
333 0, /* OMP_CLAUSE_THREADS */
334 0, /* OMP_CLAUSE_SIMD */
335 1, /* OMP_CLAUSE_HINT */
336 0, /* OMP_CLAUSE_DEFALTMAP */
337 1, /* OMP_CLAUSE__SIMDUID_ */
338 1, /* OMP_CLAUSE__CILK_FOR_COUNT_ */
339 0, /* OMP_CLAUSE_INDEPENDENT */
340 1, /* OMP_CLAUSE_WORKER */
341 1, /* OMP_CLAUSE_VECTOR */
342 1, /* OMP_CLAUSE_NUM_GANGS */
343 1, /* OMP_CLAUSE_NUM_WORKERS */
344 1, /* OMP_CLAUSE_VECTOR_LENGTH */
347 const char * const omp_clause_code_name
[] =
419 /* Return the tree node structure used by tree code CODE. */
421 static inline enum tree_node_structure_enum
422 tree_node_structure_for_code (enum tree_code code
)
424 switch (TREE_CODE_CLASS (code
))
426 case tcc_declaration
:
431 return TS_FIELD_DECL
;
437 return TS_LABEL_DECL
;
439 return TS_RESULT_DECL
;
440 case DEBUG_EXPR_DECL
:
443 return TS_CONST_DECL
;
447 return TS_FUNCTION_DECL
;
448 case TRANSLATION_UNIT_DECL
:
449 return TS_TRANSLATION_UNIT_DECL
;
451 return TS_DECL_NON_COMMON
;
455 return TS_TYPE_NON_COMMON
;
464 default: /* tcc_constant and tcc_exceptional */
469 /* tcc_constant cases. */
470 case VOID_CST
: return TS_TYPED
;
471 case INTEGER_CST
: return TS_INT_CST
;
472 case REAL_CST
: return TS_REAL_CST
;
473 case FIXED_CST
: return TS_FIXED_CST
;
474 case COMPLEX_CST
: return TS_COMPLEX
;
475 case VECTOR_CST
: return TS_VECTOR
;
476 case STRING_CST
: return TS_STRING
;
477 /* tcc_exceptional cases. */
478 case ERROR_MARK
: return TS_COMMON
;
479 case IDENTIFIER_NODE
: return TS_IDENTIFIER
;
480 case TREE_LIST
: return TS_LIST
;
481 case TREE_VEC
: return TS_VEC
;
482 case SSA_NAME
: return TS_SSA_NAME
;
483 case PLACEHOLDER_EXPR
: return TS_COMMON
;
484 case STATEMENT_LIST
: return TS_STATEMENT_LIST
;
485 case BLOCK
: return TS_BLOCK
;
486 case CONSTRUCTOR
: return TS_CONSTRUCTOR
;
487 case TREE_BINFO
: return TS_BINFO
;
488 case OMP_CLAUSE
: return TS_OMP_CLAUSE
;
489 case OPTIMIZATION_NODE
: return TS_OPTIMIZATION
;
490 case TARGET_OPTION_NODE
: return TS_TARGET_OPTION
;
498 /* Initialize tree_contains_struct to describe the hierarchy of tree
502 initialize_tree_contains_struct (void)
506 for (i
= ERROR_MARK
; i
< LAST_AND_UNUSED_TREE_CODE
; i
++)
509 enum tree_node_structure_enum ts_code
;
511 code
= (enum tree_code
) i
;
512 ts_code
= tree_node_structure_for_code (code
);
514 /* Mark the TS structure itself. */
515 tree_contains_struct
[code
][ts_code
] = 1;
517 /* Mark all the structures that TS is derived from. */
535 case TS_STATEMENT_LIST
:
536 MARK_TS_TYPED (code
);
540 case TS_DECL_MINIMAL
:
546 case TS_OPTIMIZATION
:
547 case TS_TARGET_OPTION
:
548 MARK_TS_COMMON (code
);
551 case TS_TYPE_WITH_LANG_SPECIFIC
:
552 MARK_TS_TYPE_COMMON (code
);
555 case TS_TYPE_NON_COMMON
:
556 MARK_TS_TYPE_WITH_LANG_SPECIFIC (code
);
560 MARK_TS_DECL_MINIMAL (code
);
565 MARK_TS_DECL_COMMON (code
);
568 case TS_DECL_NON_COMMON
:
569 MARK_TS_DECL_WITH_VIS (code
);
572 case TS_DECL_WITH_VIS
:
576 MARK_TS_DECL_WRTL (code
);
580 MARK_TS_DECL_COMMON (code
);
584 MARK_TS_DECL_WITH_VIS (code
);
588 case TS_FUNCTION_DECL
:
589 MARK_TS_DECL_NON_COMMON (code
);
592 case TS_TRANSLATION_UNIT_DECL
:
593 MARK_TS_DECL_COMMON (code
);
601 /* Basic consistency checks for attributes used in fold. */
602 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_NON_COMMON
]);
603 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_NON_COMMON
]);
604 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_DECL_COMMON
]);
605 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_COMMON
]);
606 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_COMMON
]);
607 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_COMMON
]);
608 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_COMMON
]);
609 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_COMMON
]);
610 gcc_assert (tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_COMMON
]);
611 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_COMMON
]);
612 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_DECL_COMMON
]);
613 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_WRTL
]);
614 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_WRTL
]);
615 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_WRTL
]);
616 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WRTL
]);
617 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_WRTL
]);
618 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_DECL_MINIMAL
]);
619 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_MINIMAL
]);
620 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_MINIMAL
]);
621 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_MINIMAL
]);
622 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_MINIMAL
]);
623 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_MINIMAL
]);
624 gcc_assert (tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_MINIMAL
]);
625 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_MINIMAL
]);
626 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_DECL_MINIMAL
]);
627 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_WITH_VIS
]);
628 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WITH_VIS
]);
629 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_WITH_VIS
]);
630 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_VAR_DECL
]);
631 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_FIELD_DECL
]);
632 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_PARM_DECL
]);
633 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_LABEL_DECL
]);
634 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_RESULT_DECL
]);
635 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_CONST_DECL
]);
636 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_TYPE_DECL
]);
637 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_FUNCTION_DECL
]);
638 gcc_assert (tree_contains_struct
[IMPORTED_DECL
][TS_DECL_MINIMAL
]);
639 gcc_assert (tree_contains_struct
[IMPORTED_DECL
][TS_DECL_COMMON
]);
640 gcc_assert (tree_contains_struct
[NAMELIST_DECL
][TS_DECL_MINIMAL
]);
641 gcc_assert (tree_contains_struct
[NAMELIST_DECL
][TS_DECL_COMMON
]);
650 /* Initialize the hash table of types. */
652 = hash_table
<type_cache_hasher
>::create_ggc (TYPE_HASH_INITIAL_SIZE
);
655 = hash_table
<tree_decl_map_cache_hasher
>::create_ggc (512);
658 = hash_table
<tree_decl_map_cache_hasher
>::create_ggc (512);
660 int_cst_hash_table
= hash_table
<int_cst_hasher
>::create_ggc (1024);
662 int_cst_node
= make_int_cst (1, 1);
664 cl_option_hash_table
= hash_table
<cl_option_hasher
>::create_ggc (64);
666 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
667 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
669 /* Initialize the tree_contains_struct array. */
670 initialize_tree_contains_struct ();
671 lang_hooks
.init_ts ();
675 /* The name of the object as the assembler will see it (but before any
676 translations made by ASM_OUTPUT_LABELREF). Often this is the same
677 as DECL_NAME. It is an IDENTIFIER_NODE. */
679 decl_assembler_name (tree decl
)
681 if (!DECL_ASSEMBLER_NAME_SET_P (decl
))
682 lang_hooks
.set_decl_assembler_name (decl
);
683 return DECL_WITH_VIS_CHECK (decl
)->decl_with_vis
.assembler_name
;
686 /* When the target supports COMDAT groups, this indicates which group the
687 DECL is associated with. This can be either an IDENTIFIER_NODE or a
688 decl, in which case its DECL_ASSEMBLER_NAME identifies the group. */
690 decl_comdat_group (const_tree node
)
692 struct symtab_node
*snode
= symtab_node::get (node
);
695 return snode
->get_comdat_group ();
698 /* Likewise, but make sure it's been reduced to an IDENTIFIER_NODE. */
700 decl_comdat_group_id (const_tree node
)
702 struct symtab_node
*snode
= symtab_node::get (node
);
705 return snode
->get_comdat_group_id ();
708 /* When the target supports named section, return its name as IDENTIFIER_NODE
709 or NULL if it is in no section. */
711 decl_section_name (const_tree node
)
713 struct symtab_node
*snode
= symtab_node::get (node
);
716 return snode
->get_section ();
719 /* Set section name of NODE to VALUE (that is expected to be
722 set_decl_section_name (tree node
, const char *value
)
724 struct symtab_node
*snode
;
728 snode
= symtab_node::get (node
);
732 else if (TREE_CODE (node
) == VAR_DECL
)
733 snode
= varpool_node::get_create (node
);
735 snode
= cgraph_node::get_create (node
);
736 snode
->set_section (value
);
739 /* Return TLS model of a variable NODE. */
741 decl_tls_model (const_tree node
)
743 struct varpool_node
*snode
= varpool_node::get (node
);
745 return TLS_MODEL_NONE
;
746 return snode
->tls_model
;
749 /* Set TLS model of variable NODE to MODEL. */
751 set_decl_tls_model (tree node
, enum tls_model model
)
753 struct varpool_node
*vnode
;
755 if (model
== TLS_MODEL_NONE
)
757 vnode
= varpool_node::get (node
);
762 vnode
= varpool_node::get_create (node
);
763 vnode
->tls_model
= model
;
766 /* Compute the number of bytes occupied by a tree with code CODE.
767 This function cannot be used for nodes that have variable sizes,
768 including TREE_VEC, INTEGER_CST, STRING_CST, and CALL_EXPR. */
770 tree_code_size (enum tree_code code
)
772 switch (TREE_CODE_CLASS (code
))
774 case tcc_declaration
: /* A decl node */
779 return sizeof (struct tree_field_decl
);
781 return sizeof (struct tree_parm_decl
);
783 return sizeof (struct tree_var_decl
);
785 return sizeof (struct tree_label_decl
);
787 return sizeof (struct tree_result_decl
);
789 return sizeof (struct tree_const_decl
);
791 return sizeof (struct tree_type_decl
);
793 return sizeof (struct tree_function_decl
);
794 case DEBUG_EXPR_DECL
:
795 return sizeof (struct tree_decl_with_rtl
);
796 case TRANSLATION_UNIT_DECL
:
797 return sizeof (struct tree_translation_unit_decl
);
801 return sizeof (struct tree_decl_non_common
);
803 return lang_hooks
.tree_size (code
);
807 case tcc_type
: /* a type node */
808 return sizeof (struct tree_type_non_common
);
810 case tcc_reference
: /* a reference */
811 case tcc_expression
: /* an expression */
812 case tcc_statement
: /* an expression with side effects */
813 case tcc_comparison
: /* a comparison expression */
814 case tcc_unary
: /* a unary arithmetic expression */
815 case tcc_binary
: /* a binary arithmetic expression */
816 return (sizeof (struct tree_exp
)
817 + (TREE_CODE_LENGTH (code
) - 1) * sizeof (tree
));
819 case tcc_constant
: /* a constant */
822 case VOID_CST
: return sizeof (struct tree_typed
);
823 case INTEGER_CST
: gcc_unreachable ();
824 case REAL_CST
: return sizeof (struct tree_real_cst
);
825 case FIXED_CST
: return sizeof (struct tree_fixed_cst
);
826 case COMPLEX_CST
: return sizeof (struct tree_complex
);
827 case VECTOR_CST
: return sizeof (struct tree_vector
);
828 case STRING_CST
: gcc_unreachable ();
830 return lang_hooks
.tree_size (code
);
833 case tcc_exceptional
: /* something random, like an identifier. */
836 case IDENTIFIER_NODE
: return lang_hooks
.identifier_size
;
837 case TREE_LIST
: return sizeof (struct tree_list
);
840 case PLACEHOLDER_EXPR
: return sizeof (struct tree_common
);
843 case OMP_CLAUSE
: gcc_unreachable ();
845 case SSA_NAME
: return sizeof (struct tree_ssa_name
);
847 case STATEMENT_LIST
: return sizeof (struct tree_statement_list
);
848 case BLOCK
: return sizeof (struct tree_block
);
849 case CONSTRUCTOR
: return sizeof (struct tree_constructor
);
850 case OPTIMIZATION_NODE
: return sizeof (struct tree_optimization_option
);
851 case TARGET_OPTION_NODE
: return sizeof (struct tree_target_option
);
854 return lang_hooks
.tree_size (code
);
862 /* Compute the number of bytes occupied by NODE. This routine only
863 looks at TREE_CODE, except for those nodes that have variable sizes. */
865 tree_size (const_tree node
)
867 const enum tree_code code
= TREE_CODE (node
);
871 return (sizeof (struct tree_int_cst
)
872 + (TREE_INT_CST_EXT_NUNITS (node
) - 1) * sizeof (HOST_WIDE_INT
));
875 return (offsetof (struct tree_binfo
, base_binfos
)
877 ::embedded_size (BINFO_N_BASE_BINFOS (node
)));
880 return (sizeof (struct tree_vec
)
881 + (TREE_VEC_LENGTH (node
) - 1) * sizeof (tree
));
884 return (sizeof (struct tree_vector
)
885 + (TYPE_VECTOR_SUBPARTS (TREE_TYPE (node
)) - 1) * sizeof (tree
));
888 return TREE_STRING_LENGTH (node
) + offsetof (struct tree_string
, str
) + 1;
891 return (sizeof (struct tree_omp_clause
)
892 + (omp_clause_num_ops
[OMP_CLAUSE_CODE (node
)] - 1)
896 if (TREE_CODE_CLASS (code
) == tcc_vl_exp
)
897 return (sizeof (struct tree_exp
)
898 + (VL_EXP_OPERAND_LENGTH (node
) - 1) * sizeof (tree
));
900 return tree_code_size (code
);
904 /* Record interesting allocation statistics for a tree node with CODE
908 record_node_allocation_statistics (enum tree_code code ATTRIBUTE_UNUSED
,
909 size_t length ATTRIBUTE_UNUSED
)
911 enum tree_code_class type
= TREE_CODE_CLASS (code
);
914 if (!GATHER_STATISTICS
)
919 case tcc_declaration
: /* A decl node */
923 case tcc_type
: /* a type node */
927 case tcc_statement
: /* an expression with side effects */
931 case tcc_reference
: /* a reference */
935 case tcc_expression
: /* an expression */
936 case tcc_comparison
: /* a comparison expression */
937 case tcc_unary
: /* a unary arithmetic expression */
938 case tcc_binary
: /* a binary arithmetic expression */
942 case tcc_constant
: /* a constant */
946 case tcc_exceptional
: /* something random, like an identifier. */
949 case IDENTIFIER_NODE
:
962 kind
= ssa_name_kind
;
974 kind
= omp_clause_kind
;
991 tree_code_counts
[(int) code
]++;
992 tree_node_counts
[(int) kind
]++;
993 tree_node_sizes
[(int) kind
] += length
;
996 /* Allocate and return a new UID from the DECL_UID namespace. */
999 allocate_decl_uid (void)
1001 return next_decl_uid
++;
1004 /* Return a newly allocated node of code CODE. For decl and type
1005 nodes, some other fields are initialized. The rest of the node is
1006 initialized to zero. This function cannot be used for TREE_VEC,
1007 INTEGER_CST or OMP_CLAUSE nodes, which is enforced by asserts in
1010 Achoo! I got a code in the node. */
1013 make_node_stat (enum tree_code code MEM_STAT_DECL
)
1016 enum tree_code_class type
= TREE_CODE_CLASS (code
);
1017 size_t length
= tree_code_size (code
);
1019 record_node_allocation_statistics (code
, length
);
1021 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
1022 TREE_SET_CODE (t
, code
);
1027 TREE_SIDE_EFFECTS (t
) = 1;
1030 case tcc_declaration
:
1031 if (CODE_CONTAINS_STRUCT (code
, TS_DECL_COMMON
))
1033 if (code
== FUNCTION_DECL
)
1035 DECL_ALIGN (t
) = FUNCTION_BOUNDARY
;
1036 DECL_MODE (t
) = FUNCTION_MODE
;
1041 DECL_SOURCE_LOCATION (t
) = input_location
;
1042 if (TREE_CODE (t
) == DEBUG_EXPR_DECL
)
1043 DECL_UID (t
) = --next_debug_decl_uid
;
1046 DECL_UID (t
) = allocate_decl_uid ();
1047 SET_DECL_PT_UID (t
, -1);
1049 if (TREE_CODE (t
) == LABEL_DECL
)
1050 LABEL_DECL_UID (t
) = -1;
1055 TYPE_UID (t
) = next_type_uid
++;
1056 TYPE_ALIGN (t
) = BITS_PER_UNIT
;
1057 TYPE_USER_ALIGN (t
) = 0;
1058 TYPE_MAIN_VARIANT (t
) = t
;
1059 TYPE_CANONICAL (t
) = t
;
1061 /* Default to no attributes for type, but let target change that. */
1062 TYPE_ATTRIBUTES (t
) = NULL_TREE
;
1063 targetm
.set_default_type_attributes (t
);
1065 /* We have not yet computed the alias set for this type. */
1066 TYPE_ALIAS_SET (t
) = -1;
1070 TREE_CONSTANT (t
) = 1;
1073 case tcc_expression
:
1079 case PREDECREMENT_EXPR
:
1080 case PREINCREMENT_EXPR
:
1081 case POSTDECREMENT_EXPR
:
1082 case POSTINCREMENT_EXPR
:
1083 /* All of these have side-effects, no matter what their
1085 TREE_SIDE_EFFECTS (t
) = 1;
1093 case tcc_exceptional
:
1096 case TARGET_OPTION_NODE
:
1097 TREE_TARGET_OPTION(t
)
1098 = ggc_cleared_alloc
<struct cl_target_option
> ();
1101 case OPTIMIZATION_NODE
:
1102 TREE_OPTIMIZATION (t
)
1103 = ggc_cleared_alloc
<struct cl_optimization
> ();
1112 /* Other classes need no special treatment. */
1119 /* Return a new node with the same contents as NODE except that its
1120 TREE_CHAIN, if it has one, is zero and it has a fresh uid. */
1123 copy_node_stat (tree node MEM_STAT_DECL
)
1126 enum tree_code code
= TREE_CODE (node
);
1129 gcc_assert (code
!= STATEMENT_LIST
);
1131 length
= tree_size (node
);
1132 record_node_allocation_statistics (code
, length
);
1133 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
1134 memcpy (t
, node
, length
);
1136 if (CODE_CONTAINS_STRUCT (code
, TS_COMMON
))
1138 TREE_ASM_WRITTEN (t
) = 0;
1139 TREE_VISITED (t
) = 0;
1141 if (TREE_CODE_CLASS (code
) == tcc_declaration
)
1143 if (code
== DEBUG_EXPR_DECL
)
1144 DECL_UID (t
) = --next_debug_decl_uid
;
1147 DECL_UID (t
) = allocate_decl_uid ();
1148 if (DECL_PT_UID_SET_P (node
))
1149 SET_DECL_PT_UID (t
, DECL_PT_UID (node
));
1151 if ((TREE_CODE (node
) == PARM_DECL
|| TREE_CODE (node
) == VAR_DECL
)
1152 && DECL_HAS_VALUE_EXPR_P (node
))
1154 SET_DECL_VALUE_EXPR (t
, DECL_VALUE_EXPR (node
));
1155 DECL_HAS_VALUE_EXPR_P (t
) = 1;
1157 /* DECL_DEBUG_EXPR is copied explicitely by callers. */
1158 if (TREE_CODE (node
) == VAR_DECL
)
1160 DECL_HAS_DEBUG_EXPR_P (t
) = 0;
1161 t
->decl_with_vis
.symtab_node
= NULL
;
1163 if (TREE_CODE (node
) == VAR_DECL
&& DECL_HAS_INIT_PRIORITY_P (node
))
1165 SET_DECL_INIT_PRIORITY (t
, DECL_INIT_PRIORITY (node
));
1166 DECL_HAS_INIT_PRIORITY_P (t
) = 1;
1168 if (TREE_CODE (node
) == FUNCTION_DECL
)
1170 DECL_STRUCT_FUNCTION (t
) = NULL
;
1171 t
->decl_with_vis
.symtab_node
= NULL
;
1174 else if (TREE_CODE_CLASS (code
) == tcc_type
)
1176 TYPE_UID (t
) = next_type_uid
++;
1177 /* The following is so that the debug code for
1178 the copy is different from the original type.
1179 The two statements usually duplicate each other
1180 (because they clear fields of the same union),
1181 but the optimizer should catch that. */
1182 TYPE_SYMTAB_POINTER (t
) = 0;
1183 TYPE_SYMTAB_ADDRESS (t
) = 0;
1185 /* Do not copy the values cache. */
1186 if (TYPE_CACHED_VALUES_P (t
))
1188 TYPE_CACHED_VALUES_P (t
) = 0;
1189 TYPE_CACHED_VALUES (t
) = NULL_TREE
;
1192 else if (code
== TARGET_OPTION_NODE
)
1194 TREE_TARGET_OPTION (t
) = ggc_alloc
<struct cl_target_option
>();
1195 memcpy (TREE_TARGET_OPTION (t
), TREE_TARGET_OPTION (node
),
1196 sizeof (struct cl_target_option
));
1198 else if (code
== OPTIMIZATION_NODE
)
1200 TREE_OPTIMIZATION (t
) = ggc_alloc
<struct cl_optimization
>();
1201 memcpy (TREE_OPTIMIZATION (t
), TREE_OPTIMIZATION (node
),
1202 sizeof (struct cl_optimization
));
1208 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
1209 For example, this can copy a list made of TREE_LIST nodes. */
1212 copy_list (tree list
)
1220 head
= prev
= copy_node (list
);
1221 next
= TREE_CHAIN (list
);
1224 TREE_CHAIN (prev
) = copy_node (next
);
1225 prev
= TREE_CHAIN (prev
);
1226 next
= TREE_CHAIN (next
);
1232 /* Return the value that TREE_INT_CST_EXT_NUNITS should have for an
1233 INTEGER_CST with value CST and type TYPE. */
1236 get_int_cst_ext_nunits (tree type
, const wide_int
&cst
)
1238 gcc_checking_assert (cst
.get_precision () == TYPE_PRECISION (type
));
1239 /* We need an extra zero HWI if CST is an unsigned integer with its
1240 upper bit set, and if CST occupies a whole number of HWIs. */
1241 if (TYPE_UNSIGNED (type
)
1243 && (cst
.get_precision () % HOST_BITS_PER_WIDE_INT
) == 0)
1244 return cst
.get_precision () / HOST_BITS_PER_WIDE_INT
+ 1;
1245 return cst
.get_len ();
1248 /* Return a new INTEGER_CST with value CST and type TYPE. */
1251 build_new_int_cst (tree type
, const wide_int
&cst
)
1253 unsigned int len
= cst
.get_len ();
1254 unsigned int ext_len
= get_int_cst_ext_nunits (type
, cst
);
1255 tree nt
= make_int_cst (len
, ext_len
);
1260 TREE_INT_CST_ELT (nt
, ext_len
) = 0;
1261 for (unsigned int i
= len
; i
< ext_len
; ++i
)
1262 TREE_INT_CST_ELT (nt
, i
) = -1;
1264 else if (TYPE_UNSIGNED (type
)
1265 && cst
.get_precision () < len
* HOST_BITS_PER_WIDE_INT
)
1268 TREE_INT_CST_ELT (nt
, len
)
1269 = zext_hwi (cst
.elt (len
),
1270 cst
.get_precision () % HOST_BITS_PER_WIDE_INT
);
1273 for (unsigned int i
= 0; i
< len
; i
++)
1274 TREE_INT_CST_ELT (nt
, i
) = cst
.elt (i
);
1275 TREE_TYPE (nt
) = type
;
1279 /* Create an INT_CST node with a LOW value sign extended to TYPE. */
1282 build_int_cst (tree type
, HOST_WIDE_INT low
)
1284 /* Support legacy code. */
1286 type
= integer_type_node
;
1288 return wide_int_to_tree (type
, wi::shwi (low
, TYPE_PRECISION (type
)));
1292 build_int_cstu (tree type
, unsigned HOST_WIDE_INT cst
)
1294 return wide_int_to_tree (type
, wi::uhwi (cst
, TYPE_PRECISION (type
)));
1297 /* Create an INT_CST node with a LOW value sign extended to TYPE. */
1300 build_int_cst_type (tree type
, HOST_WIDE_INT low
)
1303 return wide_int_to_tree (type
, wi::shwi (low
, TYPE_PRECISION (type
)));
1306 /* Constructs tree in type TYPE from with value given by CST. Signedness
1307 of CST is assumed to be the same as the signedness of TYPE. */
1310 double_int_to_tree (tree type
, double_int cst
)
1312 return wide_int_to_tree (type
, widest_int::from (cst
, TYPE_SIGN (type
)));
1315 /* We force the wide_int CST to the range of the type TYPE by sign or
1316 zero extending it. OVERFLOWABLE indicates if we are interested in
1317 overflow of the value, when >0 we are only interested in signed
1318 overflow, for <0 we are interested in any overflow. OVERFLOWED
1319 indicates whether overflow has already occurred. CONST_OVERFLOWED
1320 indicates whether constant overflow has already occurred. We force
1321 T's value to be within range of T's type (by setting to 0 or 1 all
1322 the bits outside the type's range). We set TREE_OVERFLOWED if,
1323 OVERFLOWED is nonzero,
1324 or OVERFLOWABLE is >0 and signed overflow occurs
1325 or OVERFLOWABLE is <0 and any overflow occurs
1326 We return a new tree node for the extended wide_int. The node
1327 is shared if no overflow flags are set. */
1331 force_fit_type (tree type
, const wide_int_ref
&cst
,
1332 int overflowable
, bool overflowed
)
1334 signop sign
= TYPE_SIGN (type
);
1336 /* If we need to set overflow flags, return a new unshared node. */
1337 if (overflowed
|| !wi::fits_to_tree_p (cst
, type
))
1341 || (overflowable
> 0 && sign
== SIGNED
))
1343 wide_int tmp
= wide_int::from (cst
, TYPE_PRECISION (type
), sign
);
1344 tree t
= build_new_int_cst (type
, tmp
);
1345 TREE_OVERFLOW (t
) = 1;
1350 /* Else build a shared node. */
1351 return wide_int_to_tree (type
, cst
);
1354 /* These are the hash table functions for the hash table of INTEGER_CST
1355 nodes of a sizetype. */
1357 /* Return the hash code X, an INTEGER_CST. */
1360 int_cst_hasher::hash (tree x
)
1362 const_tree
const t
= x
;
1363 hashval_t code
= TYPE_UID (TREE_TYPE (t
));
1366 for (i
= 0; i
< TREE_INT_CST_NUNITS (t
); i
++)
1367 code
= iterative_hash_host_wide_int (TREE_INT_CST_ELT(t
, i
), code
);
1372 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
1373 is the same as that given by *Y, which is the same. */
1376 int_cst_hasher::equal (tree x
, tree y
)
1378 const_tree
const xt
= x
;
1379 const_tree
const yt
= y
;
1381 if (TREE_TYPE (xt
) != TREE_TYPE (yt
)
1382 || TREE_INT_CST_NUNITS (xt
) != TREE_INT_CST_NUNITS (yt
)
1383 || TREE_INT_CST_EXT_NUNITS (xt
) != TREE_INT_CST_EXT_NUNITS (yt
))
1386 for (int i
= 0; i
< TREE_INT_CST_NUNITS (xt
); i
++)
1387 if (TREE_INT_CST_ELT (xt
, i
) != TREE_INT_CST_ELT (yt
, i
))
1393 /* Create an INT_CST node of TYPE and value CST.
1394 The returned node is always shared. For small integers we use a
1395 per-type vector cache, for larger ones we use a single hash table.
1396 The value is extended from its precision according to the sign of
1397 the type to be a multiple of HOST_BITS_PER_WIDE_INT. This defines
1398 the upper bits and ensures that hashing and value equality based
1399 upon the underlying HOST_WIDE_INTs works without masking. */
1402 wide_int_to_tree (tree type
, const wide_int_ref
&pcst
)
1409 unsigned int prec
= TYPE_PRECISION (type
);
1410 signop sgn
= TYPE_SIGN (type
);
1412 /* Verify that everything is canonical. */
1413 int l
= pcst
.get_len ();
1416 if (pcst
.elt (l
- 1) == 0)
1417 gcc_checking_assert (pcst
.elt (l
- 2) < 0);
1418 if (pcst
.elt (l
- 1) == (HOST_WIDE_INT
) -1)
1419 gcc_checking_assert (pcst
.elt (l
- 2) >= 0);
1422 wide_int cst
= wide_int::from (pcst
, prec
, sgn
);
1423 unsigned int ext_len
= get_int_cst_ext_nunits (type
, cst
);
1427 /* We just need to store a single HOST_WIDE_INT. */
1429 if (TYPE_UNSIGNED (type
))
1430 hwi
= cst
.to_uhwi ();
1432 hwi
= cst
.to_shwi ();
1434 switch (TREE_CODE (type
))
1437 gcc_assert (hwi
== 0);
1441 case REFERENCE_TYPE
:
1442 case POINTER_BOUNDS_TYPE
:
1443 /* Cache NULL pointer and zero bounds. */
1452 /* Cache false or true. */
1460 if (TYPE_SIGN (type
) == UNSIGNED
)
1463 limit
= INTEGER_SHARE_LIMIT
;
1464 if (IN_RANGE (hwi
, 0, INTEGER_SHARE_LIMIT
- 1))
1469 /* Cache [-1, N). */
1470 limit
= INTEGER_SHARE_LIMIT
+ 1;
1471 if (IN_RANGE (hwi
, -1, INTEGER_SHARE_LIMIT
- 1))
1485 /* Look for it in the type's vector of small shared ints. */
1486 if (!TYPE_CACHED_VALUES_P (type
))
1488 TYPE_CACHED_VALUES_P (type
) = 1;
1489 TYPE_CACHED_VALUES (type
) = make_tree_vec (limit
);
1492 t
= TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
);
1494 /* Make sure no one is clobbering the shared constant. */
1495 gcc_checking_assert (TREE_TYPE (t
) == type
1496 && TREE_INT_CST_NUNITS (t
) == 1
1497 && TREE_INT_CST_OFFSET_NUNITS (t
) == 1
1498 && TREE_INT_CST_EXT_NUNITS (t
) == 1
1499 && TREE_INT_CST_ELT (t
, 0) == hwi
);
1502 /* Create a new shared int. */
1503 t
= build_new_int_cst (type
, cst
);
1504 TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) = t
;
1509 /* Use the cache of larger shared ints, using int_cst_node as
1512 TREE_INT_CST_ELT (int_cst_node
, 0) = hwi
;
1513 TREE_TYPE (int_cst_node
) = type
;
1515 tree
*slot
= int_cst_hash_table
->find_slot (int_cst_node
, INSERT
);
1519 /* Insert this one into the hash table. */
1522 /* Make a new node for next time round. */
1523 int_cst_node
= make_int_cst (1, 1);
1529 /* The value either hashes properly or we drop it on the floor
1530 for the gc to take care of. There will not be enough of them
1533 tree nt
= build_new_int_cst (type
, cst
);
1534 tree
*slot
= int_cst_hash_table
->find_slot (nt
, INSERT
);
1538 /* Insert this one into the hash table. */
1548 cache_integer_cst (tree t
)
1550 tree type
= TREE_TYPE (t
);
1553 int prec
= TYPE_PRECISION (type
);
1555 gcc_assert (!TREE_OVERFLOW (t
));
1557 switch (TREE_CODE (type
))
1560 gcc_assert (integer_zerop (t
));
1564 case REFERENCE_TYPE
:
1565 /* Cache NULL pointer. */
1566 if (integer_zerop (t
))
1574 /* Cache false or true. */
1576 if (wi::ltu_p (t
, 2))
1577 ix
= TREE_INT_CST_ELT (t
, 0);
1582 if (TYPE_UNSIGNED (type
))
1585 limit
= INTEGER_SHARE_LIMIT
;
1587 /* This is a little hokie, but if the prec is smaller than
1588 what is necessary to hold INTEGER_SHARE_LIMIT, then the
1589 obvious test will not get the correct answer. */
1590 if (prec
< HOST_BITS_PER_WIDE_INT
)
1592 if (tree_to_uhwi (t
) < (unsigned HOST_WIDE_INT
) INTEGER_SHARE_LIMIT
)
1593 ix
= tree_to_uhwi (t
);
1595 else if (wi::ltu_p (t
, INTEGER_SHARE_LIMIT
))
1596 ix
= tree_to_uhwi (t
);
1601 limit
= INTEGER_SHARE_LIMIT
+ 1;
1603 if (integer_minus_onep (t
))
1605 else if (!wi::neg_p (t
))
1607 if (prec
< HOST_BITS_PER_WIDE_INT
)
1609 if (tree_to_shwi (t
) < INTEGER_SHARE_LIMIT
)
1610 ix
= tree_to_shwi (t
) + 1;
1612 else if (wi::ltu_p (t
, INTEGER_SHARE_LIMIT
))
1613 ix
= tree_to_shwi (t
) + 1;
1627 /* Look for it in the type's vector of small shared ints. */
1628 if (!TYPE_CACHED_VALUES_P (type
))
1630 TYPE_CACHED_VALUES_P (type
) = 1;
1631 TYPE_CACHED_VALUES (type
) = make_tree_vec (limit
);
1634 gcc_assert (TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) == NULL_TREE
);
1635 TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) = t
;
1639 /* Use the cache of larger shared ints. */
1640 tree
*slot
= int_cst_hash_table
->find_slot (t
, INSERT
);
1641 /* If there is already an entry for the number verify it's the
1644 gcc_assert (wi::eq_p (tree (*slot
), t
));
1646 /* Otherwise insert this one into the hash table. */
1652 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
1653 and the rest are zeros. */
1656 build_low_bits_mask (tree type
, unsigned bits
)
1658 gcc_assert (bits
<= TYPE_PRECISION (type
));
1660 return wide_int_to_tree (type
, wi::mask (bits
, false,
1661 TYPE_PRECISION (type
)));
1664 /* Checks that X is integer constant that can be expressed in (unsigned)
1665 HOST_WIDE_INT without loss of precision. */
1668 cst_and_fits_in_hwi (const_tree x
)
1670 if (TREE_CODE (x
) != INTEGER_CST
)
1673 if (TYPE_PRECISION (TREE_TYPE (x
)) > HOST_BITS_PER_WIDE_INT
)
1676 return TREE_INT_CST_NUNITS (x
) == 1;
1679 /* Build a newly constructed VECTOR_CST node of length LEN. */
1682 make_vector_stat (unsigned len MEM_STAT_DECL
)
1685 unsigned length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vector
);
1687 record_node_allocation_statistics (VECTOR_CST
, length
);
1689 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
1691 TREE_SET_CODE (t
, VECTOR_CST
);
1692 TREE_CONSTANT (t
) = 1;
1697 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1698 are in a list pointed to by VALS. */
1701 build_vector_stat (tree type
, tree
*vals MEM_STAT_DECL
)
1705 tree v
= make_vector (TYPE_VECTOR_SUBPARTS (type
));
1706 TREE_TYPE (v
) = type
;
1708 /* Iterate through elements and check for overflow. */
1709 for (cnt
= 0; cnt
< TYPE_VECTOR_SUBPARTS (type
); ++cnt
)
1711 tree value
= vals
[cnt
];
1713 VECTOR_CST_ELT (v
, cnt
) = value
;
1715 /* Don't crash if we get an address constant. */
1716 if (!CONSTANT_CLASS_P (value
))
1719 over
|= TREE_OVERFLOW (value
);
1722 TREE_OVERFLOW (v
) = over
;
1726 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1727 are extracted from V, a vector of CONSTRUCTOR_ELT. */
1730 build_vector_from_ctor (tree type
, vec
<constructor_elt
, va_gc
> *v
)
1732 tree
*vec
= XALLOCAVEC (tree
, TYPE_VECTOR_SUBPARTS (type
));
1733 unsigned HOST_WIDE_INT idx
;
1736 FOR_EACH_CONSTRUCTOR_VALUE (v
, idx
, value
)
1738 for (; idx
< TYPE_VECTOR_SUBPARTS (type
); ++idx
)
1739 vec
[idx
] = build_zero_cst (TREE_TYPE (type
));
1741 return build_vector (type
, vec
);
1744 /* Build a vector of type VECTYPE where all the elements are SCs. */
1746 build_vector_from_val (tree vectype
, tree sc
)
1748 int i
, nunits
= TYPE_VECTOR_SUBPARTS (vectype
);
1750 if (sc
== error_mark_node
)
1753 /* Verify that the vector type is suitable for SC. Note that there
1754 is some inconsistency in the type-system with respect to restrict
1755 qualifications of pointers. Vector types always have a main-variant
1756 element type and the qualification is applied to the vector-type.
1757 So TREE_TYPE (vector-type) does not return a properly qualified
1758 vector element-type. */
1759 gcc_checking_assert (types_compatible_p (TYPE_MAIN_VARIANT (TREE_TYPE (sc
)),
1760 TREE_TYPE (vectype
)));
1762 if (CONSTANT_CLASS_P (sc
))
1764 tree
*v
= XALLOCAVEC (tree
, nunits
);
1765 for (i
= 0; i
< nunits
; ++i
)
1767 return build_vector (vectype
, v
);
1771 vec
<constructor_elt
, va_gc
> *v
;
1772 vec_alloc (v
, nunits
);
1773 for (i
= 0; i
< nunits
; ++i
)
1774 CONSTRUCTOR_APPEND_ELT (v
, NULL_TREE
, sc
);
1775 return build_constructor (vectype
, v
);
1779 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1780 are in the vec pointed to by VALS. */
1782 build_constructor (tree type
, vec
<constructor_elt
, va_gc
> *vals
)
1784 tree c
= make_node (CONSTRUCTOR
);
1786 constructor_elt
*elt
;
1787 bool constant_p
= true;
1788 bool side_effects_p
= false;
1790 TREE_TYPE (c
) = type
;
1791 CONSTRUCTOR_ELTS (c
) = vals
;
1793 FOR_EACH_VEC_SAFE_ELT (vals
, i
, elt
)
1795 /* Mostly ctors will have elts that don't have side-effects, so
1796 the usual case is to scan all the elements. Hence a single
1797 loop for both const and side effects, rather than one loop
1798 each (with early outs). */
1799 if (!TREE_CONSTANT (elt
->value
))
1801 if (TREE_SIDE_EFFECTS (elt
->value
))
1802 side_effects_p
= true;
1805 TREE_SIDE_EFFECTS (c
) = side_effects_p
;
1806 TREE_CONSTANT (c
) = constant_p
;
1811 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
1814 build_constructor_single (tree type
, tree index
, tree value
)
1816 vec
<constructor_elt
, va_gc
> *v
;
1817 constructor_elt elt
= {index
, value
};
1820 v
->quick_push (elt
);
1822 return build_constructor (type
, v
);
1826 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1827 are in a list pointed to by VALS. */
1829 build_constructor_from_list (tree type
, tree vals
)
1832 vec
<constructor_elt
, va_gc
> *v
= NULL
;
1836 vec_alloc (v
, list_length (vals
));
1837 for (t
= vals
; t
; t
= TREE_CHAIN (t
))
1838 CONSTRUCTOR_APPEND_ELT (v
, TREE_PURPOSE (t
), TREE_VALUE (t
));
1841 return build_constructor (type
, v
);
1844 /* Return a new CONSTRUCTOR node whose type is TYPE. NELTS is the number
1845 of elements, provided as index/value pairs. */
1848 build_constructor_va (tree type
, int nelts
, ...)
1850 vec
<constructor_elt
, va_gc
> *v
= NULL
;
1853 va_start (p
, nelts
);
1854 vec_alloc (v
, nelts
);
1857 tree index
= va_arg (p
, tree
);
1858 tree value
= va_arg (p
, tree
);
1859 CONSTRUCTOR_APPEND_ELT (v
, index
, value
);
1862 return build_constructor (type
, v
);
1865 /* Return a new FIXED_CST node whose type is TYPE and value is F. */
1868 build_fixed (tree type
, FIXED_VALUE_TYPE f
)
1871 FIXED_VALUE_TYPE
*fp
;
1873 v
= make_node (FIXED_CST
);
1874 fp
= ggc_alloc
<fixed_value
> ();
1875 memcpy (fp
, &f
, sizeof (FIXED_VALUE_TYPE
));
1877 TREE_TYPE (v
) = type
;
1878 TREE_FIXED_CST_PTR (v
) = fp
;
1882 /* Return a new REAL_CST node whose type is TYPE and value is D. */
1885 build_real (tree type
, REAL_VALUE_TYPE d
)
1888 REAL_VALUE_TYPE
*dp
;
1891 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
1892 Consider doing it via real_convert now. */
1894 v
= make_node (REAL_CST
);
1895 dp
= ggc_alloc
<real_value
> ();
1896 memcpy (dp
, &d
, sizeof (REAL_VALUE_TYPE
));
1898 TREE_TYPE (v
) = type
;
1899 TREE_REAL_CST_PTR (v
) = dp
;
1900 TREE_OVERFLOW (v
) = overflow
;
1904 /* Like build_real, but first truncate D to the type. */
1907 build_real_truncate (tree type
, REAL_VALUE_TYPE d
)
1909 return build_real (type
, real_value_truncate (TYPE_MODE (type
), d
));
1912 /* Return a new REAL_CST node whose type is TYPE
1913 and whose value is the integer value of the INTEGER_CST node I. */
1916 real_value_from_int_cst (const_tree type
, const_tree i
)
1920 /* Clear all bits of the real value type so that we can later do
1921 bitwise comparisons to see if two values are the same. */
1922 memset (&d
, 0, sizeof d
);
1924 real_from_integer (&d
, type
? TYPE_MODE (type
) : VOIDmode
, i
,
1925 TYPE_SIGN (TREE_TYPE (i
)));
1929 /* Given a tree representing an integer constant I, return a tree
1930 representing the same value as a floating-point constant of type TYPE. */
1933 build_real_from_int_cst (tree type
, const_tree i
)
1936 int overflow
= TREE_OVERFLOW (i
);
1938 v
= build_real (type
, real_value_from_int_cst (type
, i
));
1940 TREE_OVERFLOW (v
) |= overflow
;
1944 /* Return a newly constructed STRING_CST node whose value is
1945 the LEN characters at STR.
1946 Note that for a C string literal, LEN should include the trailing NUL.
1947 The TREE_TYPE is not initialized. */
1950 build_string (int len
, const char *str
)
1955 /* Do not waste bytes provided by padding of struct tree_string. */
1956 length
= len
+ offsetof (struct tree_string
, str
) + 1;
1958 record_node_allocation_statistics (STRING_CST
, length
);
1960 s
= (tree
) ggc_internal_alloc (length
);
1962 memset (s
, 0, sizeof (struct tree_typed
));
1963 TREE_SET_CODE (s
, STRING_CST
);
1964 TREE_CONSTANT (s
) = 1;
1965 TREE_STRING_LENGTH (s
) = len
;
1966 memcpy (s
->string
.str
, str
, len
);
1967 s
->string
.str
[len
] = '\0';
1972 /* Return a newly constructed COMPLEX_CST node whose value is
1973 specified by the real and imaginary parts REAL and IMAG.
1974 Both REAL and IMAG should be constant nodes. TYPE, if specified,
1975 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
1978 build_complex (tree type
, tree real
, tree imag
)
1980 tree t
= make_node (COMPLEX_CST
);
1982 TREE_REALPART (t
) = real
;
1983 TREE_IMAGPART (t
) = imag
;
1984 TREE_TYPE (t
) = type
? type
: build_complex_type (TREE_TYPE (real
));
1985 TREE_OVERFLOW (t
) = TREE_OVERFLOW (real
) | TREE_OVERFLOW (imag
);
1989 /* Build a complex (inf +- 0i), such as for the result of cproj.
1990 TYPE is the complex tree type of the result. If NEG is true, the
1991 imaginary zero is negative. */
1994 build_complex_inf (tree type
, bool neg
)
1996 REAL_VALUE_TYPE rinf
, rzero
= dconst0
;
2000 return build_complex (type
, build_real (TREE_TYPE (type
), rinf
),
2001 build_real (TREE_TYPE (type
), rzero
));
2004 /* Return the constant 1 in type TYPE. If TYPE has several elements, each
2005 element is set to 1. In particular, this is 1 + i for complex types. */
2008 build_each_one_cst (tree type
)
2010 if (TREE_CODE (type
) == COMPLEX_TYPE
)
2012 tree scalar
= build_one_cst (TREE_TYPE (type
));
2013 return build_complex (type
, scalar
, scalar
);
2016 return build_one_cst (type
);
2019 /* Return a constant of arithmetic type TYPE which is the
2020 multiplicative identity of the set TYPE. */
2023 build_one_cst (tree type
)
2025 switch (TREE_CODE (type
))
2027 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
2028 case POINTER_TYPE
: case REFERENCE_TYPE
:
2030 return build_int_cst (type
, 1);
2033 return build_real (type
, dconst1
);
2035 case FIXED_POINT_TYPE
:
2036 /* We can only generate 1 for accum types. */
2037 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type
)));
2038 return build_fixed (type
, FCONST1 (TYPE_MODE (type
)));
2042 tree scalar
= build_one_cst (TREE_TYPE (type
));
2044 return build_vector_from_val (type
, scalar
);
2048 return build_complex (type
,
2049 build_one_cst (TREE_TYPE (type
)),
2050 build_zero_cst (TREE_TYPE (type
)));
2057 /* Return an integer of type TYPE containing all 1's in as much precision as
2058 it contains, or a complex or vector whose subparts are such integers. */
2061 build_all_ones_cst (tree type
)
2063 if (TREE_CODE (type
) == COMPLEX_TYPE
)
2065 tree scalar
= build_all_ones_cst (TREE_TYPE (type
));
2066 return build_complex (type
, scalar
, scalar
);
2069 return build_minus_one_cst (type
);
2072 /* Return a constant of arithmetic type TYPE which is the
2073 opposite of the multiplicative identity of the set TYPE. */
2076 build_minus_one_cst (tree type
)
2078 switch (TREE_CODE (type
))
2080 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
2081 case POINTER_TYPE
: case REFERENCE_TYPE
:
2083 return build_int_cst (type
, -1);
2086 return build_real (type
, dconstm1
);
2088 case FIXED_POINT_TYPE
:
2089 /* We can only generate 1 for accum types. */
2090 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type
)));
2091 return build_fixed (type
, fixed_from_double_int (double_int_minus_one
,
2096 tree scalar
= build_minus_one_cst (TREE_TYPE (type
));
2098 return build_vector_from_val (type
, scalar
);
2102 return build_complex (type
,
2103 build_minus_one_cst (TREE_TYPE (type
)),
2104 build_zero_cst (TREE_TYPE (type
)));
2111 /* Build 0 constant of type TYPE. This is used by constructor folding
2112 and thus the constant should be represented in memory by
2116 build_zero_cst (tree type
)
2118 switch (TREE_CODE (type
))
2120 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
2121 case POINTER_TYPE
: case REFERENCE_TYPE
:
2122 case OFFSET_TYPE
: case NULLPTR_TYPE
:
2123 return build_int_cst (type
, 0);
2126 return build_real (type
, dconst0
);
2128 case FIXED_POINT_TYPE
:
2129 return build_fixed (type
, FCONST0 (TYPE_MODE (type
)));
2133 tree scalar
= build_zero_cst (TREE_TYPE (type
));
2135 return build_vector_from_val (type
, scalar
);
2140 tree zero
= build_zero_cst (TREE_TYPE (type
));
2142 return build_complex (type
, zero
, zero
);
2146 if (!AGGREGATE_TYPE_P (type
))
2147 return fold_convert (type
, integer_zero_node
);
2148 return build_constructor (type
, NULL
);
2153 /* Build a BINFO with LEN language slots. */
2156 make_tree_binfo_stat (unsigned base_binfos MEM_STAT_DECL
)
2159 size_t length
= (offsetof (struct tree_binfo
, base_binfos
)
2160 + vec
<tree
, va_gc
>::embedded_size (base_binfos
));
2162 record_node_allocation_statistics (TREE_BINFO
, length
);
2164 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
2166 memset (t
, 0, offsetof (struct tree_binfo
, base_binfos
));
2168 TREE_SET_CODE (t
, TREE_BINFO
);
2170 BINFO_BASE_BINFOS (t
)->embedded_init (base_binfos
);
2175 /* Create a CASE_LABEL_EXPR tree node and return it. */
2178 build_case_label (tree low_value
, tree high_value
, tree label_decl
)
2180 tree t
= make_node (CASE_LABEL_EXPR
);
2182 TREE_TYPE (t
) = void_type_node
;
2183 SET_EXPR_LOCATION (t
, DECL_SOURCE_LOCATION (label_decl
));
2185 CASE_LOW (t
) = low_value
;
2186 CASE_HIGH (t
) = high_value
;
2187 CASE_LABEL (t
) = label_decl
;
2188 CASE_CHAIN (t
) = NULL_TREE
;
2193 /* Build a newly constructed INTEGER_CST node. LEN and EXT_LEN are the
2194 values of TREE_INT_CST_NUNITS and TREE_INT_CST_EXT_NUNITS respectively.
2195 The latter determines the length of the HOST_WIDE_INT vector. */
2198 make_int_cst_stat (int len
, int ext_len MEM_STAT_DECL
)
2201 int length
= ((ext_len
- 1) * sizeof (HOST_WIDE_INT
)
2202 + sizeof (struct tree_int_cst
));
2205 record_node_allocation_statistics (INTEGER_CST
, length
);
2207 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
2209 TREE_SET_CODE (t
, INTEGER_CST
);
2210 TREE_INT_CST_NUNITS (t
) = len
;
2211 TREE_INT_CST_EXT_NUNITS (t
) = ext_len
;
2212 /* to_offset can only be applied to trees that are offset_int-sized
2213 or smaller. EXT_LEN is correct if it fits, otherwise the constant
2214 must be exactly the precision of offset_int and so LEN is correct. */
2215 if (ext_len
<= OFFSET_INT_ELTS
)
2216 TREE_INT_CST_OFFSET_NUNITS (t
) = ext_len
;
2218 TREE_INT_CST_OFFSET_NUNITS (t
) = len
;
2220 TREE_CONSTANT (t
) = 1;
2225 /* Build a newly constructed TREE_VEC node of length LEN. */
2228 make_tree_vec_stat (int len MEM_STAT_DECL
)
2231 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
2233 record_node_allocation_statistics (TREE_VEC
, length
);
2235 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
2237 TREE_SET_CODE (t
, TREE_VEC
);
2238 TREE_VEC_LENGTH (t
) = len
;
2243 /* Grow a TREE_VEC node to new length LEN. */
2246 grow_tree_vec_stat (tree v
, int len MEM_STAT_DECL
)
2248 gcc_assert (TREE_CODE (v
) == TREE_VEC
);
2250 int oldlen
= TREE_VEC_LENGTH (v
);
2251 gcc_assert (len
> oldlen
);
2253 int oldlength
= (oldlen
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
2254 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
2256 record_node_allocation_statistics (TREE_VEC
, length
- oldlength
);
2258 v
= (tree
) ggc_realloc (v
, length PASS_MEM_STAT
);
2260 TREE_VEC_LENGTH (v
) = len
;
2265 /* Return 1 if EXPR is the constant zero, whether it is integral, float or
2266 fixed, and scalar, complex or vector. */
2269 zerop (const_tree expr
)
2271 return (integer_zerop (expr
)
2272 || real_zerop (expr
)
2273 || fixed_zerop (expr
));
2276 /* Return 1 if EXPR is the integer constant zero or a complex constant
2280 integer_zerop (const_tree expr
)
2284 switch (TREE_CODE (expr
))
2287 return wi::eq_p (expr
, 0);
2289 return (integer_zerop (TREE_REALPART (expr
))
2290 && integer_zerop (TREE_IMAGPART (expr
)));
2294 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2295 if (!integer_zerop (VECTOR_CST_ELT (expr
, i
)))
2304 /* Return 1 if EXPR is the integer constant one or the corresponding
2305 complex constant. */
2308 integer_onep (const_tree expr
)
2312 switch (TREE_CODE (expr
))
2315 return wi::eq_p (wi::to_widest (expr
), 1);
2317 return (integer_onep (TREE_REALPART (expr
))
2318 && integer_zerop (TREE_IMAGPART (expr
)));
2322 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2323 if (!integer_onep (VECTOR_CST_ELT (expr
, i
)))
2332 /* Return 1 if EXPR is the integer constant one. For complex and vector,
2333 return 1 if every piece is the integer constant one. */
2336 integer_each_onep (const_tree expr
)
2340 if (TREE_CODE (expr
) == COMPLEX_CST
)
2341 return (integer_onep (TREE_REALPART (expr
))
2342 && integer_onep (TREE_IMAGPART (expr
)));
2344 return integer_onep (expr
);
2347 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
2348 it contains, or a complex or vector whose subparts are such integers. */
2351 integer_all_onesp (const_tree expr
)
2355 if (TREE_CODE (expr
) == COMPLEX_CST
2356 && integer_all_onesp (TREE_REALPART (expr
))
2357 && integer_all_onesp (TREE_IMAGPART (expr
)))
2360 else if (TREE_CODE (expr
) == VECTOR_CST
)
2363 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2364 if (!integer_all_onesp (VECTOR_CST_ELT (expr
, i
)))
2369 else if (TREE_CODE (expr
) != INTEGER_CST
)
2372 return wi::max_value (TYPE_PRECISION (TREE_TYPE (expr
)), UNSIGNED
) == expr
;
2375 /* Return 1 if EXPR is the integer constant minus one. */
2378 integer_minus_onep (const_tree expr
)
2382 if (TREE_CODE (expr
) == COMPLEX_CST
)
2383 return (integer_all_onesp (TREE_REALPART (expr
))
2384 && integer_zerop (TREE_IMAGPART (expr
)));
2386 return integer_all_onesp (expr
);
2389 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
2393 integer_pow2p (const_tree expr
)
2397 if (TREE_CODE (expr
) == COMPLEX_CST
2398 && integer_pow2p (TREE_REALPART (expr
))
2399 && integer_zerop (TREE_IMAGPART (expr
)))
2402 if (TREE_CODE (expr
) != INTEGER_CST
)
2405 return wi::popcount (expr
) == 1;
2408 /* Return 1 if EXPR is an integer constant other than zero or a
2409 complex constant other than zero. */
2412 integer_nonzerop (const_tree expr
)
2416 return ((TREE_CODE (expr
) == INTEGER_CST
2417 && !wi::eq_p (expr
, 0))
2418 || (TREE_CODE (expr
) == COMPLEX_CST
2419 && (integer_nonzerop (TREE_REALPART (expr
))
2420 || integer_nonzerop (TREE_IMAGPART (expr
)))));
2423 /* Return 1 if EXPR is the integer constant one. For vector,
2424 return 1 if every piece is the integer constant minus one
2425 (representing the value TRUE). */
2428 integer_truep (const_tree expr
)
2432 if (TREE_CODE (expr
) == VECTOR_CST
)
2433 return integer_all_onesp (expr
);
2434 return integer_onep (expr
);
2437 /* Return 1 if EXPR is the fixed-point constant zero. */
2440 fixed_zerop (const_tree expr
)
2442 return (TREE_CODE (expr
) == FIXED_CST
2443 && TREE_FIXED_CST (expr
).data
.is_zero ());
2446 /* Return the power of two represented by a tree node known to be a
2450 tree_log2 (const_tree expr
)
2454 if (TREE_CODE (expr
) == COMPLEX_CST
)
2455 return tree_log2 (TREE_REALPART (expr
));
2457 return wi::exact_log2 (expr
);
2460 /* Similar, but return the largest integer Y such that 2 ** Y is less
2461 than or equal to EXPR. */
2464 tree_floor_log2 (const_tree expr
)
2468 if (TREE_CODE (expr
) == COMPLEX_CST
)
2469 return tree_log2 (TREE_REALPART (expr
));
2471 return wi::floor_log2 (expr
);
2474 /* Return number of known trailing zero bits in EXPR, or, if the value of
2475 EXPR is known to be zero, the precision of it's type. */
2478 tree_ctz (const_tree expr
)
2480 if (!INTEGRAL_TYPE_P (TREE_TYPE (expr
))
2481 && !POINTER_TYPE_P (TREE_TYPE (expr
)))
2484 unsigned int ret1
, ret2
, prec
= TYPE_PRECISION (TREE_TYPE (expr
));
2485 switch (TREE_CODE (expr
))
2488 ret1
= wi::ctz (expr
);
2489 return MIN (ret1
, prec
);
2491 ret1
= wi::ctz (get_nonzero_bits (expr
));
2492 return MIN (ret1
, prec
);
2499 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2502 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2503 return MIN (ret1
, ret2
);
2504 case POINTER_PLUS_EXPR
:
2505 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2506 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2507 /* Second operand is sizetype, which could be in theory
2508 wider than pointer's precision. Make sure we never
2509 return more than prec. */
2510 ret2
= MIN (ret2
, prec
);
2511 return MIN (ret1
, ret2
);
2513 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2514 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2515 return MAX (ret1
, ret2
);
2517 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2518 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2519 return MIN (ret1
+ ret2
, prec
);
2521 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2522 if (tree_fits_uhwi_p (TREE_OPERAND (expr
, 1))
2523 && (tree_to_uhwi (TREE_OPERAND (expr
, 1)) < prec
))
2525 ret2
= tree_to_uhwi (TREE_OPERAND (expr
, 1));
2526 return MIN (ret1
+ ret2
, prec
);
2530 if (tree_fits_uhwi_p (TREE_OPERAND (expr
, 1))
2531 && (tree_to_uhwi (TREE_OPERAND (expr
, 1)) < prec
))
2533 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2534 ret2
= tree_to_uhwi (TREE_OPERAND (expr
, 1));
2539 case TRUNC_DIV_EXPR
:
2541 case FLOOR_DIV_EXPR
:
2542 case ROUND_DIV_EXPR
:
2543 case EXACT_DIV_EXPR
:
2544 if (TREE_CODE (TREE_OPERAND (expr
, 1)) == INTEGER_CST
2545 && tree_int_cst_sgn (TREE_OPERAND (expr
, 1)) == 1)
2547 int l
= tree_log2 (TREE_OPERAND (expr
, 1));
2550 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2558 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2559 if (ret1
&& ret1
== TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (expr
, 0))))
2561 return MIN (ret1
, prec
);
2563 return tree_ctz (TREE_OPERAND (expr
, 0));
2565 ret1
= tree_ctz (TREE_OPERAND (expr
, 1));
2568 ret2
= tree_ctz (TREE_OPERAND (expr
, 2));
2569 return MIN (ret1
, ret2
);
2571 return tree_ctz (TREE_OPERAND (expr
, 1));
2573 ret1
= get_pointer_alignment (CONST_CAST_TREE (expr
));
2574 if (ret1
> BITS_PER_UNIT
)
2576 ret1
= ctz_hwi (ret1
/ BITS_PER_UNIT
);
2577 return MIN (ret1
, prec
);
2585 /* Return 1 if EXPR is the real constant zero. Trailing zeroes matter for
2586 decimal float constants, so don't return 1 for them. */
2589 real_zerop (const_tree expr
)
2593 switch (TREE_CODE (expr
))
2596 return real_equal (&TREE_REAL_CST (expr
), &dconst0
)
2597 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2599 return real_zerop (TREE_REALPART (expr
))
2600 && real_zerop (TREE_IMAGPART (expr
));
2604 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2605 if (!real_zerop (VECTOR_CST_ELT (expr
, i
)))
2614 /* Return 1 if EXPR is the real constant one in real or complex form.
2615 Trailing zeroes matter for decimal float constants, so don't return
2619 real_onep (const_tree expr
)
2623 switch (TREE_CODE (expr
))
2626 return real_equal (&TREE_REAL_CST (expr
), &dconst1
)
2627 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2629 return real_onep (TREE_REALPART (expr
))
2630 && real_zerop (TREE_IMAGPART (expr
));
2634 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2635 if (!real_onep (VECTOR_CST_ELT (expr
, i
)))
2644 /* Return 1 if EXPR is the real constant minus one. Trailing zeroes
2645 matter for decimal float constants, so don't return 1 for them. */
2648 real_minus_onep (const_tree expr
)
2652 switch (TREE_CODE (expr
))
2655 return real_equal (&TREE_REAL_CST (expr
), &dconstm1
)
2656 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2658 return real_minus_onep (TREE_REALPART (expr
))
2659 && real_zerop (TREE_IMAGPART (expr
));
2663 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2664 if (!real_minus_onep (VECTOR_CST_ELT (expr
, i
)))
2673 /* Nonzero if EXP is a constant or a cast of a constant. */
2676 really_constant_p (const_tree exp
)
2678 /* This is not quite the same as STRIP_NOPS. It does more. */
2679 while (CONVERT_EXPR_P (exp
)
2680 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
2681 exp
= TREE_OPERAND (exp
, 0);
2682 return TREE_CONSTANT (exp
);
2685 /* Return first list element whose TREE_VALUE is ELEM.
2686 Return 0 if ELEM is not in LIST. */
2689 value_member (tree elem
, tree list
)
2693 if (elem
== TREE_VALUE (list
))
2695 list
= TREE_CHAIN (list
);
2700 /* Return first list element whose TREE_PURPOSE is ELEM.
2701 Return 0 if ELEM is not in LIST. */
2704 purpose_member (const_tree elem
, tree list
)
2708 if (elem
== TREE_PURPOSE (list
))
2710 list
= TREE_CHAIN (list
);
2715 /* Return true if ELEM is in V. */
2718 vec_member (const_tree elem
, vec
<tree
, va_gc
> *v
)
2722 FOR_EACH_VEC_SAFE_ELT (v
, ix
, t
)
2728 /* Returns element number IDX (zero-origin) of chain CHAIN, or
2732 chain_index (int idx
, tree chain
)
2734 for (; chain
&& idx
> 0; --idx
)
2735 chain
= TREE_CHAIN (chain
);
2739 /* Return nonzero if ELEM is part of the chain CHAIN. */
2742 chain_member (const_tree elem
, const_tree chain
)
2748 chain
= DECL_CHAIN (chain
);
2754 /* Return the length of a chain of nodes chained through TREE_CHAIN.
2755 We expect a null pointer to mark the end of the chain.
2756 This is the Lisp primitive `length'. */
2759 list_length (const_tree t
)
2762 #ifdef ENABLE_TREE_CHECKING
2770 #ifdef ENABLE_TREE_CHECKING
2773 gcc_assert (p
!= q
);
2781 /* Returns the first FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
2782 UNION_TYPE TYPE, or NULL_TREE if none. */
2785 first_field (const_tree type
)
2787 tree t
= TYPE_FIELDS (type
);
2788 while (t
&& TREE_CODE (t
) != FIELD_DECL
)
2793 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
2794 by modifying the last node in chain 1 to point to chain 2.
2795 This is the Lisp primitive `nconc'. */
2798 chainon (tree op1
, tree op2
)
2807 for (t1
= op1
; TREE_CHAIN (t1
); t1
= TREE_CHAIN (t1
))
2809 TREE_CHAIN (t1
) = op2
;
2811 #ifdef ENABLE_TREE_CHECKING
2814 for (t2
= op2
; t2
; t2
= TREE_CHAIN (t2
))
2815 gcc_assert (t2
!= t1
);
2822 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
2825 tree_last (tree chain
)
2829 while ((next
= TREE_CHAIN (chain
)))
2834 /* Reverse the order of elements in the chain T,
2835 and return the new head of the chain (old last element). */
2840 tree prev
= 0, decl
, next
;
2841 for (decl
= t
; decl
; decl
= next
)
2843 /* We shouldn't be using this function to reverse BLOCK chains; we
2844 have blocks_nreverse for that. */
2845 gcc_checking_assert (TREE_CODE (decl
) != BLOCK
);
2846 next
= TREE_CHAIN (decl
);
2847 TREE_CHAIN (decl
) = prev
;
2853 /* Return a newly created TREE_LIST node whose
2854 purpose and value fields are PARM and VALUE. */
2857 build_tree_list_stat (tree parm
, tree value MEM_STAT_DECL
)
2859 tree t
= make_node_stat (TREE_LIST PASS_MEM_STAT
);
2860 TREE_PURPOSE (t
) = parm
;
2861 TREE_VALUE (t
) = value
;
2865 /* Build a chain of TREE_LIST nodes from a vector. */
2868 build_tree_list_vec_stat (const vec
<tree
, va_gc
> *vec MEM_STAT_DECL
)
2870 tree ret
= NULL_TREE
;
2874 FOR_EACH_VEC_SAFE_ELT (vec
, i
, t
)
2876 *pp
= build_tree_list_stat (NULL
, t PASS_MEM_STAT
);
2877 pp
= &TREE_CHAIN (*pp
);
2882 /* Return a newly created TREE_LIST node whose
2883 purpose and value fields are PURPOSE and VALUE
2884 and whose TREE_CHAIN is CHAIN. */
2887 tree_cons_stat (tree purpose
, tree value
, tree chain MEM_STAT_DECL
)
2891 node
= ggc_alloc_tree_node_stat (sizeof (struct tree_list
) PASS_MEM_STAT
);
2892 memset (node
, 0, sizeof (struct tree_common
));
2894 record_node_allocation_statistics (TREE_LIST
, sizeof (struct tree_list
));
2896 TREE_SET_CODE (node
, TREE_LIST
);
2897 TREE_CHAIN (node
) = chain
;
2898 TREE_PURPOSE (node
) = purpose
;
2899 TREE_VALUE (node
) = value
;
2903 /* Return the values of the elements of a CONSTRUCTOR as a vector of
2907 ctor_to_vec (tree ctor
)
2909 vec
<tree
, va_gc
> *vec
;
2910 vec_alloc (vec
, CONSTRUCTOR_NELTS (ctor
));
2914 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), ix
, val
)
2915 vec
->quick_push (val
);
2920 /* Return the size nominally occupied by an object of type TYPE
2921 when it resides in memory. The value is measured in units of bytes,
2922 and its data type is that normally used for type sizes
2923 (which is the first type created by make_signed_type or
2924 make_unsigned_type). */
2927 size_in_bytes (const_tree type
)
2931 if (type
== error_mark_node
)
2932 return integer_zero_node
;
2934 type
= TYPE_MAIN_VARIANT (type
);
2935 t
= TYPE_SIZE_UNIT (type
);
2939 lang_hooks
.types
.incomplete_type_error (NULL_TREE
, type
);
2940 return size_zero_node
;
2946 /* Return the size of TYPE (in bytes) as a wide integer
2947 or return -1 if the size can vary or is larger than an integer. */
2950 int_size_in_bytes (const_tree type
)
2954 if (type
== error_mark_node
)
2957 type
= TYPE_MAIN_VARIANT (type
);
2958 t
= TYPE_SIZE_UNIT (type
);
2960 if (t
&& tree_fits_uhwi_p (t
))
2961 return TREE_INT_CST_LOW (t
);
2966 /* Return the maximum 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 max_int_size_in_bytes (const_tree type
)
2972 HOST_WIDE_INT size
= -1;
2975 /* If this is an array type, check for a possible MAX_SIZE attached. */
2977 if (TREE_CODE (type
) == ARRAY_TYPE
)
2979 size_tree
= TYPE_ARRAY_MAX_SIZE (type
);
2981 if (size_tree
&& tree_fits_uhwi_p (size_tree
))
2982 size
= tree_to_uhwi (size_tree
);
2985 /* If we still haven't been able to get a size, see if the language
2986 can compute a maximum size. */
2990 size_tree
= lang_hooks
.types
.max_size (type
);
2992 if (size_tree
&& tree_fits_uhwi_p (size_tree
))
2993 size
= tree_to_uhwi (size_tree
);
2999 /* Return the bit position of FIELD, in bits from the start of the record.
3000 This is a tree of type bitsizetype. */
3003 bit_position (const_tree field
)
3005 return bit_from_pos (DECL_FIELD_OFFSET (field
),
3006 DECL_FIELD_BIT_OFFSET (field
));
3009 /* Return the byte position of FIELD, in bytes from the start of the record.
3010 This is a tree of type sizetype. */
3013 byte_position (const_tree field
)
3015 return byte_from_pos (DECL_FIELD_OFFSET (field
),
3016 DECL_FIELD_BIT_OFFSET (field
));
3019 /* Likewise, but return as an integer. It must be representable in
3020 that way (since it could be a signed value, we don't have the
3021 option of returning -1 like int_size_in_byte can. */
3024 int_byte_position (const_tree field
)
3026 return tree_to_shwi (byte_position (field
));
3029 /* Return the strictest alignment, in bits, that T is known to have. */
3032 expr_align (const_tree t
)
3034 unsigned int align0
, align1
;
3036 switch (TREE_CODE (t
))
3038 CASE_CONVERT
: case NON_LVALUE_EXPR
:
3039 /* If we have conversions, we know that the alignment of the
3040 object must meet each of the alignments of the types. */
3041 align0
= expr_align (TREE_OPERAND (t
, 0));
3042 align1
= TYPE_ALIGN (TREE_TYPE (t
));
3043 return MAX (align0
, align1
);
3045 case SAVE_EXPR
: case COMPOUND_EXPR
: case MODIFY_EXPR
:
3046 case INIT_EXPR
: case TARGET_EXPR
: case WITH_CLEANUP_EXPR
:
3047 case CLEANUP_POINT_EXPR
:
3048 /* These don't change the alignment of an object. */
3049 return expr_align (TREE_OPERAND (t
, 0));
3052 /* The best we can do is say that the alignment is the least aligned
3054 align0
= expr_align (TREE_OPERAND (t
, 1));
3055 align1
= expr_align (TREE_OPERAND (t
, 2));
3056 return MIN (align0
, align1
);
3058 /* FIXME: LABEL_DECL and CONST_DECL never have DECL_ALIGN set
3059 meaningfully, it's always 1. */
3060 case LABEL_DECL
: case CONST_DECL
:
3061 case VAR_DECL
: case PARM_DECL
: case RESULT_DECL
:
3063 gcc_assert (DECL_ALIGN (t
) != 0);
3064 return DECL_ALIGN (t
);
3070 /* Otherwise take the alignment from that of the type. */
3071 return TYPE_ALIGN (TREE_TYPE (t
));
3074 /* Return, as a tree node, the number of elements for TYPE (which is an
3075 ARRAY_TYPE) minus one. This counts only elements of the top array. */
3078 array_type_nelts (const_tree type
)
3080 tree index_type
, min
, max
;
3082 /* If they did it with unspecified bounds, then we should have already
3083 given an error about it before we got here. */
3084 if (! TYPE_DOMAIN (type
))
3085 return error_mark_node
;
3087 index_type
= TYPE_DOMAIN (type
);
3088 min
= TYPE_MIN_VALUE (index_type
);
3089 max
= TYPE_MAX_VALUE (index_type
);
3091 /* TYPE_MAX_VALUE may not be set if the array has unknown length. */
3093 return error_mark_node
;
3095 return (integer_zerop (min
)
3097 : fold_build2 (MINUS_EXPR
, TREE_TYPE (max
), max
, min
));
3100 /* If arg is static -- a reference to an object in static storage -- then
3101 return the object. This is not the same as the C meaning of `static'.
3102 If arg isn't static, return NULL. */
3107 switch (TREE_CODE (arg
))
3110 /* Nested functions are static, even though taking their address will
3111 involve a trampoline as we unnest the nested function and create
3112 the trampoline on the tree level. */
3116 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
3117 && ! DECL_THREAD_LOCAL_P (arg
)
3118 && ! DECL_DLLIMPORT_P (arg
)
3122 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
3126 return TREE_STATIC (arg
) ? arg
: NULL
;
3133 /* If the thing being referenced is not a field, then it is
3134 something language specific. */
3135 gcc_assert (TREE_CODE (TREE_OPERAND (arg
, 1)) == FIELD_DECL
);
3137 /* If we are referencing a bitfield, we can't evaluate an
3138 ADDR_EXPR at compile time and so it isn't a constant. */
3139 if (DECL_BIT_FIELD (TREE_OPERAND (arg
, 1)))
3142 return staticp (TREE_OPERAND (arg
, 0));
3148 return TREE_CONSTANT (TREE_OPERAND (arg
, 0)) ? arg
: NULL
;
3151 case ARRAY_RANGE_REF
:
3152 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg
))) == INTEGER_CST
3153 && TREE_CODE (TREE_OPERAND (arg
, 1)) == INTEGER_CST
)
3154 return staticp (TREE_OPERAND (arg
, 0));
3158 case COMPOUND_LITERAL_EXPR
:
3159 return TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (arg
)) ? arg
: NULL
;
3169 /* Return whether OP is a DECL whose address is function-invariant. */
3172 decl_address_invariant_p (const_tree op
)
3174 /* The conditions below are slightly less strict than the one in
3177 switch (TREE_CODE (op
))
3186 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
3187 || DECL_THREAD_LOCAL_P (op
)
3188 || DECL_CONTEXT (op
) == current_function_decl
3189 || decl_function_context (op
) == current_function_decl
)
3194 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
3195 || decl_function_context (op
) == current_function_decl
)
3206 /* Return whether OP is a DECL whose address is interprocedural-invariant. */
3209 decl_address_ip_invariant_p (const_tree op
)
3211 /* The conditions below are slightly less strict than the one in
3214 switch (TREE_CODE (op
))
3222 if (((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
3223 && !DECL_DLLIMPORT_P (op
))
3224 || DECL_THREAD_LOCAL_P (op
))
3229 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
)))
3241 /* Return true if T is function-invariant (internal function, does
3242 not handle arithmetic; that's handled in skip_simple_arithmetic and
3243 tree_invariant_p). */
3245 static bool tree_invariant_p (tree t
);
3248 tree_invariant_p_1 (tree t
)
3252 if (TREE_CONSTANT (t
)
3253 || (TREE_READONLY (t
) && !TREE_SIDE_EFFECTS (t
)))
3256 switch (TREE_CODE (t
))
3262 op
= TREE_OPERAND (t
, 0);
3263 while (handled_component_p (op
))
3265 switch (TREE_CODE (op
))
3268 case ARRAY_RANGE_REF
:
3269 if (!tree_invariant_p (TREE_OPERAND (op
, 1))
3270 || TREE_OPERAND (op
, 2) != NULL_TREE
3271 || TREE_OPERAND (op
, 3) != NULL_TREE
)
3276 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
3282 op
= TREE_OPERAND (op
, 0);
3285 return CONSTANT_CLASS_P (op
) || decl_address_invariant_p (op
);
3294 /* Return true if T is function-invariant. */
3297 tree_invariant_p (tree t
)
3299 tree inner
= skip_simple_arithmetic (t
);
3300 return tree_invariant_p_1 (inner
);
3303 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
3304 Do this to any expression which may be used in more than one place,
3305 but must be evaluated only once.
3307 Normally, expand_expr would reevaluate the expression each time.
3308 Calling save_expr produces something that is evaluated and recorded
3309 the first time expand_expr is called on it. Subsequent calls to
3310 expand_expr just reuse the recorded value.
3312 The call to expand_expr that generates code that actually computes
3313 the value is the first call *at compile time*. Subsequent calls
3314 *at compile time* generate code to use the saved value.
3315 This produces correct result provided that *at run time* control
3316 always flows through the insns made by the first expand_expr
3317 before reaching the other places where the save_expr was evaluated.
3318 You, the caller of save_expr, must make sure this is so.
3320 Constants, and certain read-only nodes, are returned with no
3321 SAVE_EXPR because that is safe. Expressions containing placeholders
3322 are not touched; see tree.def for an explanation of what these
3326 save_expr (tree expr
)
3328 tree t
= fold (expr
);
3331 /* If the tree evaluates to a constant, then we don't want to hide that
3332 fact (i.e. this allows further folding, and direct checks for constants).
3333 However, a read-only object that has side effects cannot be bypassed.
3334 Since it is no problem to reevaluate literals, we just return the
3336 inner
= skip_simple_arithmetic (t
);
3337 if (TREE_CODE (inner
) == ERROR_MARK
)
3340 if (tree_invariant_p_1 (inner
))
3343 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
3344 it means that the size or offset of some field of an object depends on
3345 the value within another field.
3347 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
3348 and some variable since it would then need to be both evaluated once and
3349 evaluated more than once. Front-ends must assure this case cannot
3350 happen by surrounding any such subexpressions in their own SAVE_EXPR
3351 and forcing evaluation at the proper time. */
3352 if (contains_placeholder_p (inner
))
3355 t
= build1 (SAVE_EXPR
, TREE_TYPE (expr
), t
);
3356 SET_EXPR_LOCATION (t
, EXPR_LOCATION (expr
));
3358 /* This expression might be placed ahead of a jump to ensure that the
3359 value was computed on both sides of the jump. So make sure it isn't
3360 eliminated as dead. */
3361 TREE_SIDE_EFFECTS (t
) = 1;
3365 /* Look inside EXPR into any simple arithmetic operations. Return the
3366 outermost non-arithmetic or non-invariant node. */
3369 skip_simple_arithmetic (tree expr
)
3371 /* We don't care about whether this can be used as an lvalue in this
3373 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
3374 expr
= TREE_OPERAND (expr
, 0);
3376 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
3377 a constant, it will be more efficient to not make another SAVE_EXPR since
3378 it will allow better simplification and GCSE will be able to merge the
3379 computations if they actually occur. */
3382 if (UNARY_CLASS_P (expr
))
3383 expr
= TREE_OPERAND (expr
, 0);
3384 else if (BINARY_CLASS_P (expr
))
3386 if (tree_invariant_p (TREE_OPERAND (expr
, 1)))
3387 expr
= TREE_OPERAND (expr
, 0);
3388 else if (tree_invariant_p (TREE_OPERAND (expr
, 0)))
3389 expr
= TREE_OPERAND (expr
, 1);
3400 /* Look inside EXPR into simple arithmetic operations involving constants.
3401 Return the outermost non-arithmetic or non-constant node. */
3404 skip_simple_constant_arithmetic (tree expr
)
3406 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
3407 expr
= TREE_OPERAND (expr
, 0);
3411 if (UNARY_CLASS_P (expr
))
3412 expr
= TREE_OPERAND (expr
, 0);
3413 else if (BINARY_CLASS_P (expr
))
3415 if (TREE_CONSTANT (TREE_OPERAND (expr
, 1)))
3416 expr
= TREE_OPERAND (expr
, 0);
3417 else if (TREE_CONSTANT (TREE_OPERAND (expr
, 0)))
3418 expr
= TREE_OPERAND (expr
, 1);
3429 /* Return which tree structure is used by T. */
3431 enum tree_node_structure_enum
3432 tree_node_structure (const_tree t
)
3434 const enum tree_code code
= TREE_CODE (t
);
3435 return tree_node_structure_for_code (code
);
3438 /* Set various status flags when building a CALL_EXPR object T. */
3441 process_call_operands (tree t
)
3443 bool side_effects
= TREE_SIDE_EFFECTS (t
);
3444 bool read_only
= false;
3445 int i
= call_expr_flags (t
);
3447 /* Calls have side-effects, except those to const or pure functions. */
3448 if ((i
& ECF_LOOPING_CONST_OR_PURE
) || !(i
& (ECF_CONST
| ECF_PURE
)))
3449 side_effects
= true;
3450 /* Propagate TREE_READONLY of arguments for const functions. */
3454 if (!side_effects
|| read_only
)
3455 for (i
= 1; i
< TREE_OPERAND_LENGTH (t
); i
++)
3457 tree op
= TREE_OPERAND (t
, i
);
3458 if (op
&& TREE_SIDE_EFFECTS (op
))
3459 side_effects
= true;
3460 if (op
&& !TREE_READONLY (op
) && !CONSTANT_CLASS_P (op
))
3464 TREE_SIDE_EFFECTS (t
) = side_effects
;
3465 TREE_READONLY (t
) = read_only
;
3468 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
3469 size or offset that depends on a field within a record. */
3472 contains_placeholder_p (const_tree exp
)
3474 enum tree_code code
;
3479 code
= TREE_CODE (exp
);
3480 if (code
== PLACEHOLDER_EXPR
)
3483 switch (TREE_CODE_CLASS (code
))
3486 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
3487 position computations since they will be converted into a
3488 WITH_RECORD_EXPR involving the reference, which will assume
3489 here will be valid. */
3490 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
3492 case tcc_exceptional
:
3493 if (code
== TREE_LIST
)
3494 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp
))
3495 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp
)));
3500 case tcc_comparison
:
3501 case tcc_expression
:
3505 /* Ignoring the first operand isn't quite right, but works best. */
3506 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1));
3509 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
3510 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1))
3511 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 2)));
3514 /* The save_expr function never wraps anything containing
3515 a PLACEHOLDER_EXPR. */
3522 switch (TREE_CODE_LENGTH (code
))
3525 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
3527 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
3528 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1)));
3539 const_call_expr_arg_iterator iter
;
3540 FOR_EACH_CONST_CALL_EXPR_ARG (arg
, iter
, exp
)
3541 if (CONTAINS_PLACEHOLDER_P (arg
))
3555 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
3556 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
3560 type_contains_placeholder_1 (const_tree type
)
3562 /* If the size contains a placeholder or the parent type (component type in
3563 the case of arrays) type involves a placeholder, this type does. */
3564 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type
))
3565 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type
))
3566 || (!POINTER_TYPE_P (type
)
3568 && type_contains_placeholder_p (TREE_TYPE (type
))))
3571 /* Now do type-specific checks. Note that the last part of the check above
3572 greatly limits what we have to do below. */
3573 switch (TREE_CODE (type
))
3576 case POINTER_BOUNDS_TYPE
:
3582 case REFERENCE_TYPE
:
3591 case FIXED_POINT_TYPE
:
3592 /* Here we just check the bounds. */
3593 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type
))
3594 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type
)));
3597 /* We have already checked the component type above, so just check the
3599 return type_contains_placeholder_p (TYPE_DOMAIN (type
));
3603 case QUAL_UNION_TYPE
:
3607 for (field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
3608 if (TREE_CODE (field
) == FIELD_DECL
3609 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field
))
3610 || (TREE_CODE (type
) == QUAL_UNION_TYPE
3611 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field
)))
3612 || type_contains_placeholder_p (TREE_TYPE (field
))))
3623 /* Wrapper around above function used to cache its result. */
3626 type_contains_placeholder_p (tree type
)
3630 /* If the contains_placeholder_bits field has been initialized,
3631 then we know the answer. */
3632 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) > 0)
3633 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) - 1;
3635 /* Indicate that we've seen this type node, and the answer is false.
3636 This is what we want to return if we run into recursion via fields. */
3637 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = 1;
3639 /* Compute the real value. */
3640 result
= type_contains_placeholder_1 (type
);
3642 /* Store the real value. */
3643 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = result
+ 1;
3648 /* Push tree EXP onto vector QUEUE if it is not already present. */
3651 push_without_duplicates (tree exp
, vec
<tree
> *queue
)
3656 FOR_EACH_VEC_ELT (*queue
, i
, iter
)
3657 if (simple_cst_equal (iter
, exp
) == 1)
3661 queue
->safe_push (exp
);
3664 /* Given a tree EXP, find all occurrences of references to fields
3665 in a PLACEHOLDER_EXPR and place them in vector REFS without
3666 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
3667 we assume here that EXP contains only arithmetic expressions
3668 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
3672 find_placeholder_in_expr (tree exp
, vec
<tree
> *refs
)
3674 enum tree_code code
= TREE_CODE (exp
);
3678 /* We handle TREE_LIST and COMPONENT_REF separately. */
3679 if (code
== TREE_LIST
)
3681 FIND_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), refs
);
3682 FIND_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), refs
);
3684 else if (code
== COMPONENT_REF
)
3686 for (inner
= TREE_OPERAND (exp
, 0);
3687 REFERENCE_CLASS_P (inner
);
3688 inner
= TREE_OPERAND (inner
, 0))
3691 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
)
3692 push_without_duplicates (exp
, refs
);
3694 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), refs
);
3697 switch (TREE_CODE_CLASS (code
))
3702 case tcc_declaration
:
3703 /* Variables allocated to static storage can stay. */
3704 if (!TREE_STATIC (exp
))
3705 push_without_duplicates (exp
, refs
);
3708 case tcc_expression
:
3709 /* This is the pattern built in ada/make_aligning_type. */
3710 if (code
== ADDR_EXPR
3711 && TREE_CODE (TREE_OPERAND (exp
, 0)) == PLACEHOLDER_EXPR
)
3713 push_without_duplicates (exp
, refs
);
3717 /* Fall through... */
3719 case tcc_exceptional
:
3722 case tcc_comparison
:
3724 for (i
= 0; i
< TREE_CODE_LENGTH (code
); i
++)
3725 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
3729 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3730 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
3738 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
3739 return a tree with all occurrences of references to F in a
3740 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
3741 CONST_DECLs. Note that we assume here that EXP contains only
3742 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
3743 occurring only in their argument list. */
3746 substitute_in_expr (tree exp
, tree f
, tree r
)
3748 enum tree_code code
= TREE_CODE (exp
);
3749 tree op0
, op1
, op2
, op3
;
3752 /* We handle TREE_LIST and COMPONENT_REF separately. */
3753 if (code
== TREE_LIST
)
3755 op0
= SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp
), f
, r
);
3756 op1
= SUBSTITUTE_IN_EXPR (TREE_VALUE (exp
), f
, r
);
3757 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
3760 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
3762 else if (code
== COMPONENT_REF
)
3766 /* If this expression is getting a value from a PLACEHOLDER_EXPR
3767 and it is the right field, replace it with R. */
3768 for (inner
= TREE_OPERAND (exp
, 0);
3769 REFERENCE_CLASS_P (inner
);
3770 inner
= TREE_OPERAND (inner
, 0))
3774 op1
= TREE_OPERAND (exp
, 1);
3776 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& op1
== f
)
3779 /* If this expression hasn't been completed let, leave it alone. */
3780 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& !TREE_TYPE (inner
))
3783 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3784 if (op0
== TREE_OPERAND (exp
, 0))
3788 = fold_build3 (COMPONENT_REF
, TREE_TYPE (exp
), op0
, op1
, NULL_TREE
);
3791 switch (TREE_CODE_CLASS (code
))
3796 case tcc_declaration
:
3802 case tcc_expression
:
3806 /* Fall through... */
3808 case tcc_exceptional
:
3811 case tcc_comparison
:
3813 switch (TREE_CODE_LENGTH (code
))
3819 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3820 if (op0
== TREE_OPERAND (exp
, 0))
3823 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
3827 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3828 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3830 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
3833 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
3837 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3838 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3839 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
3841 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3842 && op2
== TREE_OPERAND (exp
, 2))
3845 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
3849 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3850 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3851 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
3852 op3
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 3), f
, r
);
3854 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3855 && op2
== TREE_OPERAND (exp
, 2)
3856 && op3
== TREE_OPERAND (exp
, 3))
3860 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
3872 new_tree
= NULL_TREE
;
3874 /* If we are trying to replace F with a constant, inline back
3875 functions which do nothing else than computing a value from
3876 the arguments they are passed. This makes it possible to
3877 fold partially or entirely the replacement expression. */
3878 if (CONSTANT_CLASS_P (r
) && code
== CALL_EXPR
)
3880 tree t
= maybe_inline_call_in_expr (exp
);
3882 return SUBSTITUTE_IN_EXPR (t
, f
, r
);
3885 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3887 tree op
= TREE_OPERAND (exp
, i
);
3888 tree new_op
= SUBSTITUTE_IN_EXPR (op
, f
, r
);
3892 new_tree
= copy_node (exp
);
3893 TREE_OPERAND (new_tree
, i
) = new_op
;
3899 new_tree
= fold (new_tree
);
3900 if (TREE_CODE (new_tree
) == CALL_EXPR
)
3901 process_call_operands (new_tree
);
3912 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
3914 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
3915 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
3920 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
3921 for it within OBJ, a tree that is an object or a chain of references. */
3924 substitute_placeholder_in_expr (tree exp
, tree obj
)
3926 enum tree_code code
= TREE_CODE (exp
);
3927 tree op0
, op1
, op2
, op3
;
3930 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
3931 in the chain of OBJ. */
3932 if (code
== PLACEHOLDER_EXPR
)
3934 tree need_type
= TYPE_MAIN_VARIANT (TREE_TYPE (exp
));
3937 for (elt
= obj
; elt
!= 0;
3938 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
3939 || TREE_CODE (elt
) == COND_EXPR
)
3940 ? TREE_OPERAND (elt
, 1)
3941 : (REFERENCE_CLASS_P (elt
)
3942 || UNARY_CLASS_P (elt
)
3943 || BINARY_CLASS_P (elt
)
3944 || VL_EXP_CLASS_P (elt
)
3945 || EXPRESSION_CLASS_P (elt
))
3946 ? TREE_OPERAND (elt
, 0) : 0))
3947 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt
)) == need_type
)
3950 for (elt
= obj
; elt
!= 0;
3951 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
3952 || TREE_CODE (elt
) == COND_EXPR
)
3953 ? TREE_OPERAND (elt
, 1)
3954 : (REFERENCE_CLASS_P (elt
)
3955 || UNARY_CLASS_P (elt
)
3956 || BINARY_CLASS_P (elt
)
3957 || VL_EXP_CLASS_P (elt
)
3958 || EXPRESSION_CLASS_P (elt
))
3959 ? TREE_OPERAND (elt
, 0) : 0))
3960 if (POINTER_TYPE_P (TREE_TYPE (elt
))
3961 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt
)))
3963 return fold_build1 (INDIRECT_REF
, need_type
, elt
);
3965 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
3966 survives until RTL generation, there will be an error. */
3970 /* TREE_LIST is special because we need to look at TREE_VALUE
3971 and TREE_CHAIN, not TREE_OPERANDS. */
3972 else if (code
== TREE_LIST
)
3974 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), obj
);
3975 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), obj
);
3976 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
3979 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
3982 switch (TREE_CODE_CLASS (code
))
3985 case tcc_declaration
:
3988 case tcc_exceptional
:
3991 case tcc_comparison
:
3992 case tcc_expression
:
3995 switch (TREE_CODE_LENGTH (code
))
4001 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
4002 if (op0
== TREE_OPERAND (exp
, 0))
4005 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
4009 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
4010 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
4012 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
4015 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
4019 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
4020 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
4021 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
4023 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
4024 && op2
== TREE_OPERAND (exp
, 2))
4027 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
4031 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
4032 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
4033 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
4034 op3
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 3), obj
);
4036 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
4037 && op2
== TREE_OPERAND (exp
, 2)
4038 && op3
== TREE_OPERAND (exp
, 3))
4042 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
4054 new_tree
= NULL_TREE
;
4056 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
4058 tree op
= TREE_OPERAND (exp
, i
);
4059 tree new_op
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (op
, obj
);
4063 new_tree
= copy_node (exp
);
4064 TREE_OPERAND (new_tree
, i
) = new_op
;
4070 new_tree
= fold (new_tree
);
4071 if (TREE_CODE (new_tree
) == CALL_EXPR
)
4072 process_call_operands (new_tree
);
4083 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
4085 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
4086 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
4092 /* Subroutine of stabilize_reference; this is called for subtrees of
4093 references. Any expression with side-effects must be put in a SAVE_EXPR
4094 to ensure that it is only evaluated once.
4096 We don't put SAVE_EXPR nodes around everything, because assigning very
4097 simple expressions to temporaries causes us to miss good opportunities
4098 for optimizations. Among other things, the opportunity to fold in the
4099 addition of a constant into an addressing mode often gets lost, e.g.
4100 "y[i+1] += x;". In general, we take the approach that we should not make
4101 an assignment unless we are forced into it - i.e., that any non-side effect
4102 operator should be allowed, and that cse should take care of coalescing
4103 multiple utterances of the same expression should that prove fruitful. */
4106 stabilize_reference_1 (tree e
)
4109 enum tree_code code
= TREE_CODE (e
);
4111 /* We cannot ignore const expressions because it might be a reference
4112 to a const array but whose index contains side-effects. But we can
4113 ignore things that are actual constant or that already have been
4114 handled by this function. */
4116 if (tree_invariant_p (e
))
4119 switch (TREE_CODE_CLASS (code
))
4121 case tcc_exceptional
:
4123 case tcc_declaration
:
4124 case tcc_comparison
:
4126 case tcc_expression
:
4129 /* If the expression has side-effects, then encase it in a SAVE_EXPR
4130 so that it will only be evaluated once. */
4131 /* The reference (r) and comparison (<) classes could be handled as
4132 below, but it is generally faster to only evaluate them once. */
4133 if (TREE_SIDE_EFFECTS (e
))
4134 return save_expr (e
);
4138 /* Constants need no processing. In fact, we should never reach
4143 /* Division is slow and tends to be compiled with jumps,
4144 especially the division by powers of 2 that is often
4145 found inside of an array reference. So do it just once. */
4146 if (code
== TRUNC_DIV_EXPR
|| code
== TRUNC_MOD_EXPR
4147 || code
== FLOOR_DIV_EXPR
|| code
== FLOOR_MOD_EXPR
4148 || code
== CEIL_DIV_EXPR
|| code
== CEIL_MOD_EXPR
4149 || code
== ROUND_DIV_EXPR
|| code
== ROUND_MOD_EXPR
)
4150 return save_expr (e
);
4151 /* Recursively stabilize each operand. */
4152 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)),
4153 stabilize_reference_1 (TREE_OPERAND (e
, 1)));
4157 /* Recursively stabilize each operand. */
4158 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)));
4165 TREE_TYPE (result
) = TREE_TYPE (e
);
4166 TREE_READONLY (result
) = TREE_READONLY (e
);
4167 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (e
);
4168 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (e
);
4173 /* Stabilize a reference so that we can use it any number of times
4174 without causing its operands to be evaluated more than once.
4175 Returns the stabilized reference. This works by means of save_expr,
4176 so see the caveats in the comments about save_expr.
4178 Also allows conversion expressions whose operands are references.
4179 Any other kind of expression is returned unchanged. */
4182 stabilize_reference (tree ref
)
4185 enum tree_code code
= TREE_CODE (ref
);
4192 /* No action is needed in this case. */
4197 case FIX_TRUNC_EXPR
:
4198 result
= build_nt (code
, stabilize_reference (TREE_OPERAND (ref
, 0)));
4202 result
= build_nt (INDIRECT_REF
,
4203 stabilize_reference_1 (TREE_OPERAND (ref
, 0)));
4207 result
= build_nt (COMPONENT_REF
,
4208 stabilize_reference (TREE_OPERAND (ref
, 0)),
4209 TREE_OPERAND (ref
, 1), NULL_TREE
);
4213 result
= build_nt (BIT_FIELD_REF
,
4214 stabilize_reference (TREE_OPERAND (ref
, 0)),
4215 TREE_OPERAND (ref
, 1), TREE_OPERAND (ref
, 2));
4219 result
= build_nt (ARRAY_REF
,
4220 stabilize_reference (TREE_OPERAND (ref
, 0)),
4221 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
4222 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
4225 case ARRAY_RANGE_REF
:
4226 result
= build_nt (ARRAY_RANGE_REF
,
4227 stabilize_reference (TREE_OPERAND (ref
, 0)),
4228 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
4229 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
4233 /* We cannot wrap the first expression in a SAVE_EXPR, as then
4234 it wouldn't be ignored. This matters when dealing with
4236 return stabilize_reference_1 (ref
);
4238 /* If arg isn't a kind of lvalue we recognize, make no change.
4239 Caller should recognize the error for an invalid lvalue. */
4244 return error_mark_node
;
4247 TREE_TYPE (result
) = TREE_TYPE (ref
);
4248 TREE_READONLY (result
) = TREE_READONLY (ref
);
4249 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (ref
);
4250 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (ref
);
4255 /* Low-level constructors for expressions. */
4257 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
4258 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
4261 recompute_tree_invariant_for_addr_expr (tree t
)
4264 bool tc
= true, se
= false;
4266 gcc_assert (TREE_CODE (t
) == ADDR_EXPR
);
4268 /* We started out assuming this address is both invariant and constant, but
4269 does not have side effects. Now go down any handled components and see if
4270 any of them involve offsets that are either non-constant or non-invariant.
4271 Also check for side-effects.
4273 ??? Note that this code makes no attempt to deal with the case where
4274 taking the address of something causes a copy due to misalignment. */
4276 #define UPDATE_FLAGS(NODE) \
4277 do { tree _node = (NODE); \
4278 if (_node && !TREE_CONSTANT (_node)) tc = false; \
4279 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
4281 for (node
= TREE_OPERAND (t
, 0); handled_component_p (node
);
4282 node
= TREE_OPERAND (node
, 0))
4284 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
4285 array reference (probably made temporarily by the G++ front end),
4286 so ignore all the operands. */
4287 if ((TREE_CODE (node
) == ARRAY_REF
4288 || TREE_CODE (node
) == ARRAY_RANGE_REF
)
4289 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node
, 0))) == ARRAY_TYPE
)
4291 UPDATE_FLAGS (TREE_OPERAND (node
, 1));
4292 if (TREE_OPERAND (node
, 2))
4293 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
4294 if (TREE_OPERAND (node
, 3))
4295 UPDATE_FLAGS (TREE_OPERAND (node
, 3));
4297 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
4298 FIELD_DECL, apparently. The G++ front end can put something else
4299 there, at least temporarily. */
4300 else if (TREE_CODE (node
) == COMPONENT_REF
4301 && TREE_CODE (TREE_OPERAND (node
, 1)) == FIELD_DECL
)
4303 if (TREE_OPERAND (node
, 2))
4304 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
4308 node
= lang_hooks
.expr_to_decl (node
, &tc
, &se
);
4310 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
4311 the address, since &(*a)->b is a form of addition. If it's a constant, the
4312 address is constant too. If it's a decl, its address is constant if the
4313 decl is static. Everything else is not constant and, furthermore,
4314 taking the address of a volatile variable is not volatile. */
4315 if (TREE_CODE (node
) == INDIRECT_REF
4316 || TREE_CODE (node
) == MEM_REF
)
4317 UPDATE_FLAGS (TREE_OPERAND (node
, 0));
4318 else if (CONSTANT_CLASS_P (node
))
4320 else if (DECL_P (node
))
4321 tc
&= (staticp (node
) != NULL_TREE
);
4325 se
|= TREE_SIDE_EFFECTS (node
);
4329 TREE_CONSTANT (t
) = tc
;
4330 TREE_SIDE_EFFECTS (t
) = se
;
4334 /* Build an expression of code CODE, data type TYPE, and operands as
4335 specified. Expressions and reference nodes can be created this way.
4336 Constants, decls, types and misc nodes cannot be.
4338 We define 5 non-variadic functions, from 0 to 4 arguments. This is
4339 enough for all extant tree codes. */
4342 build0_stat (enum tree_code code
, tree tt MEM_STAT_DECL
)
4346 gcc_assert (TREE_CODE_LENGTH (code
) == 0);
4348 t
= make_node_stat (code PASS_MEM_STAT
);
4355 build1_stat (enum tree_code code
, tree type
, tree node MEM_STAT_DECL
)
4357 int length
= sizeof (struct tree_exp
);
4360 record_node_allocation_statistics (code
, length
);
4362 gcc_assert (TREE_CODE_LENGTH (code
) == 1);
4364 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
4366 memset (t
, 0, sizeof (struct tree_common
));
4368 TREE_SET_CODE (t
, code
);
4370 TREE_TYPE (t
) = type
;
4371 SET_EXPR_LOCATION (t
, UNKNOWN_LOCATION
);
4372 TREE_OPERAND (t
, 0) = node
;
4373 if (node
&& !TYPE_P (node
))
4375 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (node
);
4376 TREE_READONLY (t
) = TREE_READONLY (node
);
4379 if (TREE_CODE_CLASS (code
) == tcc_statement
)
4380 TREE_SIDE_EFFECTS (t
) = 1;
4384 /* All of these have side-effects, no matter what their
4386 TREE_SIDE_EFFECTS (t
) = 1;
4387 TREE_READONLY (t
) = 0;
4391 /* Whether a dereference is readonly has nothing to do with whether
4392 its operand is readonly. */
4393 TREE_READONLY (t
) = 0;
4398 recompute_tree_invariant_for_addr_expr (t
);
4402 if ((TREE_CODE_CLASS (code
) == tcc_unary
|| code
== VIEW_CONVERT_EXPR
)
4403 && node
&& !TYPE_P (node
)
4404 && TREE_CONSTANT (node
))
4405 TREE_CONSTANT (t
) = 1;
4406 if (TREE_CODE_CLASS (code
) == tcc_reference
4407 && node
&& TREE_THIS_VOLATILE (node
))
4408 TREE_THIS_VOLATILE (t
) = 1;
4415 #define PROCESS_ARG(N) \
4417 TREE_OPERAND (t, N) = arg##N; \
4418 if (arg##N &&!TYPE_P (arg##N)) \
4420 if (TREE_SIDE_EFFECTS (arg##N)) \
4422 if (!TREE_READONLY (arg##N) \
4423 && !CONSTANT_CLASS_P (arg##N)) \
4424 (void) (read_only = 0); \
4425 if (!TREE_CONSTANT (arg##N)) \
4426 (void) (constant = 0); \
4431 build2_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1 MEM_STAT_DECL
)
4433 bool constant
, read_only
, side_effects
;
4436 gcc_assert (TREE_CODE_LENGTH (code
) == 2);
4438 if ((code
== MINUS_EXPR
|| code
== PLUS_EXPR
|| code
== MULT_EXPR
)
4439 && arg0
&& arg1
&& tt
&& POINTER_TYPE_P (tt
)
4440 /* When sizetype precision doesn't match that of pointers
4441 we need to be able to build explicit extensions or truncations
4442 of the offset argument. */
4443 && TYPE_PRECISION (sizetype
) == TYPE_PRECISION (tt
))
4444 gcc_assert (TREE_CODE (arg0
) == INTEGER_CST
4445 && TREE_CODE (arg1
) == INTEGER_CST
);
4447 if (code
== POINTER_PLUS_EXPR
&& arg0
&& arg1
&& tt
)
4448 gcc_assert (POINTER_TYPE_P (tt
) && POINTER_TYPE_P (TREE_TYPE (arg0
))
4449 && ptrofftype_p (TREE_TYPE (arg1
)));
4451 t
= make_node_stat (code PASS_MEM_STAT
);
4454 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
4455 result based on those same flags for the arguments. But if the
4456 arguments aren't really even `tree' expressions, we shouldn't be trying
4459 /* Expressions without side effects may be constant if their
4460 arguments are as well. */
4461 constant
= (TREE_CODE_CLASS (code
) == tcc_comparison
4462 || TREE_CODE_CLASS (code
) == tcc_binary
);
4464 side_effects
= TREE_SIDE_EFFECTS (t
);
4469 TREE_SIDE_EFFECTS (t
) = side_effects
;
4470 if (code
== MEM_REF
)
4472 if (arg0
&& TREE_CODE (arg0
) == ADDR_EXPR
)
4474 tree o
= TREE_OPERAND (arg0
, 0);
4475 TREE_READONLY (t
) = TREE_READONLY (o
);
4476 TREE_THIS_VOLATILE (t
) = TREE_THIS_VOLATILE (o
);
4481 TREE_READONLY (t
) = read_only
;
4482 TREE_CONSTANT (t
) = constant
;
4483 TREE_THIS_VOLATILE (t
)
4484 = (TREE_CODE_CLASS (code
) == tcc_reference
4485 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4493 build3_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4494 tree arg2 MEM_STAT_DECL
)
4496 bool constant
, read_only
, side_effects
;
4499 gcc_assert (TREE_CODE_LENGTH (code
) == 3);
4500 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
4502 t
= make_node_stat (code PASS_MEM_STAT
);
4507 /* As a special exception, if COND_EXPR has NULL branches, we
4508 assume that it is a gimple statement and always consider
4509 it to have side effects. */
4510 if (code
== COND_EXPR
4511 && tt
== void_type_node
4512 && arg1
== NULL_TREE
4513 && arg2
== NULL_TREE
)
4514 side_effects
= true;
4516 side_effects
= TREE_SIDE_EFFECTS (t
);
4522 if (code
== COND_EXPR
)
4523 TREE_READONLY (t
) = read_only
;
4525 TREE_SIDE_EFFECTS (t
) = side_effects
;
4526 TREE_THIS_VOLATILE (t
)
4527 = (TREE_CODE_CLASS (code
) == tcc_reference
4528 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4534 build4_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4535 tree arg2
, tree arg3 MEM_STAT_DECL
)
4537 bool constant
, read_only
, side_effects
;
4540 gcc_assert (TREE_CODE_LENGTH (code
) == 4);
4542 t
= make_node_stat (code PASS_MEM_STAT
);
4545 side_effects
= TREE_SIDE_EFFECTS (t
);
4552 TREE_SIDE_EFFECTS (t
) = side_effects
;
4553 TREE_THIS_VOLATILE (t
)
4554 = (TREE_CODE_CLASS (code
) == tcc_reference
4555 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4561 build5_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4562 tree arg2
, tree arg3
, tree arg4 MEM_STAT_DECL
)
4564 bool constant
, read_only
, side_effects
;
4567 gcc_assert (TREE_CODE_LENGTH (code
) == 5);
4569 t
= make_node_stat (code PASS_MEM_STAT
);
4572 side_effects
= TREE_SIDE_EFFECTS (t
);
4580 TREE_SIDE_EFFECTS (t
) = side_effects
;
4581 if (code
== TARGET_MEM_REF
)
4583 if (arg0
&& TREE_CODE (arg0
) == ADDR_EXPR
)
4585 tree o
= TREE_OPERAND (arg0
, 0);
4586 TREE_READONLY (t
) = TREE_READONLY (o
);
4587 TREE_THIS_VOLATILE (t
) = TREE_THIS_VOLATILE (o
);
4591 TREE_THIS_VOLATILE (t
)
4592 = (TREE_CODE_CLASS (code
) == tcc_reference
4593 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4598 /* Build a simple MEM_REF tree with the sematics of a plain INDIRECT_REF
4599 on the pointer PTR. */
4602 build_simple_mem_ref_loc (location_t loc
, tree ptr
)
4604 HOST_WIDE_INT offset
= 0;
4605 tree ptype
= TREE_TYPE (ptr
);
4607 /* For convenience allow addresses that collapse to a simple base
4609 if (TREE_CODE (ptr
) == ADDR_EXPR
4610 && (handled_component_p (TREE_OPERAND (ptr
, 0))
4611 || TREE_CODE (TREE_OPERAND (ptr
, 0)) == MEM_REF
))
4613 ptr
= get_addr_base_and_unit_offset (TREE_OPERAND (ptr
, 0), &offset
);
4615 ptr
= build_fold_addr_expr (ptr
);
4616 gcc_assert (is_gimple_reg (ptr
) || is_gimple_min_invariant (ptr
));
4618 tem
= build2 (MEM_REF
, TREE_TYPE (ptype
),
4619 ptr
, build_int_cst (ptype
, offset
));
4620 SET_EXPR_LOCATION (tem
, loc
);
4624 /* Return the constant offset of a MEM_REF or TARGET_MEM_REF tree T. */
4627 mem_ref_offset (const_tree t
)
4629 return offset_int::from (TREE_OPERAND (t
, 1), SIGNED
);
4632 /* Return an invariant ADDR_EXPR of type TYPE taking the address of BASE
4633 offsetted by OFFSET units. */
4636 build_invariant_address (tree type
, tree base
, HOST_WIDE_INT offset
)
4638 tree ref
= fold_build2 (MEM_REF
, TREE_TYPE (type
),
4639 build_fold_addr_expr (base
),
4640 build_int_cst (ptr_type_node
, offset
));
4641 tree addr
= build1 (ADDR_EXPR
, type
, ref
);
4642 recompute_tree_invariant_for_addr_expr (addr
);
4646 /* Similar except don't specify the TREE_TYPE
4647 and leave the TREE_SIDE_EFFECTS as 0.
4648 It is permissible for arguments to be null,
4649 or even garbage if their values do not matter. */
4652 build_nt (enum tree_code code
, ...)
4659 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
4663 t
= make_node (code
);
4664 length
= TREE_CODE_LENGTH (code
);
4666 for (i
= 0; i
< length
; i
++)
4667 TREE_OPERAND (t
, i
) = va_arg (p
, tree
);
4673 /* Similar to build_nt, but for creating a CALL_EXPR object with a
4677 build_nt_call_vec (tree fn
, vec
<tree
, va_gc
> *args
)
4682 ret
= build_vl_exp (CALL_EXPR
, vec_safe_length (args
) + 3);
4683 CALL_EXPR_FN (ret
) = fn
;
4684 CALL_EXPR_STATIC_CHAIN (ret
) = NULL_TREE
;
4685 FOR_EACH_VEC_SAFE_ELT (args
, ix
, t
)
4686 CALL_EXPR_ARG (ret
, ix
) = t
;
4690 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
4691 We do NOT enter this node in any sort of symbol table.
4693 LOC is the location of the decl.
4695 layout_decl is used to set up the decl's storage layout.
4696 Other slots are initialized to 0 or null pointers. */
4699 build_decl_stat (location_t loc
, enum tree_code code
, tree name
,
4700 tree type MEM_STAT_DECL
)
4704 t
= make_node_stat (code PASS_MEM_STAT
);
4705 DECL_SOURCE_LOCATION (t
) = loc
;
4707 /* if (type == error_mark_node)
4708 type = integer_type_node; */
4709 /* That is not done, deliberately, so that having error_mark_node
4710 as the type can suppress useless errors in the use of this variable. */
4712 DECL_NAME (t
) = name
;
4713 TREE_TYPE (t
) = type
;
4715 if (code
== VAR_DECL
|| code
== PARM_DECL
|| code
== RESULT_DECL
)
4721 /* Builds and returns function declaration with NAME and TYPE. */
4724 build_fn_decl (const char *name
, tree type
)
4726 tree id
= get_identifier (name
);
4727 tree decl
= build_decl (input_location
, FUNCTION_DECL
, id
, type
);
4729 DECL_EXTERNAL (decl
) = 1;
4730 TREE_PUBLIC (decl
) = 1;
4731 DECL_ARTIFICIAL (decl
) = 1;
4732 TREE_NOTHROW (decl
) = 1;
4737 vec
<tree
, va_gc
> *all_translation_units
;
4739 /* Builds a new translation-unit decl with name NAME, queues it in the
4740 global list of translation-unit decls and returns it. */
4743 build_translation_unit_decl (tree name
)
4745 tree tu
= build_decl (UNKNOWN_LOCATION
, TRANSLATION_UNIT_DECL
,
4747 TRANSLATION_UNIT_LANGUAGE (tu
) = lang_hooks
.name
;
4748 vec_safe_push (all_translation_units
, tu
);
4753 /* BLOCK nodes are used to represent the structure of binding contours
4754 and declarations, once those contours have been exited and their contents
4755 compiled. This information is used for outputting debugging info. */
4758 build_block (tree vars
, tree subblocks
, tree supercontext
, tree chain
)
4760 tree block
= make_node (BLOCK
);
4762 BLOCK_VARS (block
) = vars
;
4763 BLOCK_SUBBLOCKS (block
) = subblocks
;
4764 BLOCK_SUPERCONTEXT (block
) = supercontext
;
4765 BLOCK_CHAIN (block
) = chain
;
4770 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
4772 LOC is the location to use in tree T. */
4775 protected_set_expr_location (tree t
, location_t loc
)
4777 if (CAN_HAVE_LOCATION_P (t
))
4778 SET_EXPR_LOCATION (t
, loc
);
4781 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
4785 build_decl_attribute_variant (tree ddecl
, tree attribute
)
4787 DECL_ATTRIBUTES (ddecl
) = attribute
;
4791 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4792 is ATTRIBUTE and its qualifiers are QUALS.
4794 Record such modified types already made so we don't make duplicates. */
4797 build_type_attribute_qual_variant (tree ttype
, tree attribute
, int quals
)
4799 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype
), attribute
))
4801 inchash::hash hstate
;
4805 enum tree_code code
= TREE_CODE (ttype
);
4807 /* Building a distinct copy of a tagged type is inappropriate; it
4808 causes breakage in code that expects there to be a one-to-one
4809 relationship between a struct and its fields.
4810 build_duplicate_type is another solution (as used in
4811 handle_transparent_union_attribute), but that doesn't play well
4812 with the stronger C++ type identity model. */
4813 if (TREE_CODE (ttype
) == RECORD_TYPE
4814 || TREE_CODE (ttype
) == UNION_TYPE
4815 || TREE_CODE (ttype
) == QUAL_UNION_TYPE
4816 || TREE_CODE (ttype
) == ENUMERAL_TYPE
)
4818 warning (OPT_Wattributes
,
4819 "ignoring attributes applied to %qT after definition",
4820 TYPE_MAIN_VARIANT (ttype
));
4821 return build_qualified_type (ttype
, quals
);
4824 ttype
= build_qualified_type (ttype
, TYPE_UNQUALIFIED
);
4825 ntype
= build_distinct_type_copy (ttype
);
4827 TYPE_ATTRIBUTES (ntype
) = attribute
;
4829 hstate
.add_int (code
);
4830 if (TREE_TYPE (ntype
))
4831 hstate
.add_object (TYPE_HASH (TREE_TYPE (ntype
)));
4832 attribute_hash_list (attribute
, hstate
);
4834 switch (TREE_CODE (ntype
))
4837 type_hash_list (TYPE_ARG_TYPES (ntype
), hstate
);
4840 if (TYPE_DOMAIN (ntype
))
4841 hstate
.add_object (TYPE_HASH (TYPE_DOMAIN (ntype
)));
4844 t
= TYPE_MAX_VALUE (ntype
);
4845 for (i
= 0; i
< TREE_INT_CST_NUNITS (t
); i
++)
4846 hstate
.add_object (TREE_INT_CST_ELT (t
, i
));
4849 case FIXED_POINT_TYPE
:
4851 unsigned int precision
= TYPE_PRECISION (ntype
);
4852 hstate
.add_object (precision
);
4859 ntype
= type_hash_canon (hstate
.end(), ntype
);
4861 /* If the target-dependent attributes make NTYPE different from
4862 its canonical type, we will need to use structural equality
4863 checks for this type. */
4864 if (TYPE_STRUCTURAL_EQUALITY_P (ttype
)
4865 || !comp_type_attributes (ntype
, ttype
))
4866 SET_TYPE_STRUCTURAL_EQUALITY (ntype
);
4867 else if (TYPE_CANONICAL (ntype
) == ntype
)
4868 TYPE_CANONICAL (ntype
) = TYPE_CANONICAL (ttype
);
4870 ttype
= build_qualified_type (ntype
, quals
);
4872 else if (TYPE_QUALS (ttype
) != quals
)
4873 ttype
= build_qualified_type (ttype
, quals
);
4878 /* Check if "omp declare simd" attribute arguments, CLAUSES1 and CLAUSES2, are
4882 omp_declare_simd_clauses_equal (tree clauses1
, tree clauses2
)
4885 for (cl1
= clauses1
, cl2
= clauses2
;
4887 cl1
= OMP_CLAUSE_CHAIN (cl1
), cl2
= OMP_CLAUSE_CHAIN (cl2
))
4889 if (OMP_CLAUSE_CODE (cl1
) != OMP_CLAUSE_CODE (cl2
))
4891 if (OMP_CLAUSE_CODE (cl1
) != OMP_CLAUSE_SIMDLEN
)
4893 if (simple_cst_equal (OMP_CLAUSE_DECL (cl1
),
4894 OMP_CLAUSE_DECL (cl2
)) != 1)
4897 switch (OMP_CLAUSE_CODE (cl1
))
4899 case OMP_CLAUSE_ALIGNED
:
4900 if (simple_cst_equal (OMP_CLAUSE_ALIGNED_ALIGNMENT (cl1
),
4901 OMP_CLAUSE_ALIGNED_ALIGNMENT (cl2
)) != 1)
4904 case OMP_CLAUSE_LINEAR
:
4905 if (simple_cst_equal (OMP_CLAUSE_LINEAR_STEP (cl1
),
4906 OMP_CLAUSE_LINEAR_STEP (cl2
)) != 1)
4909 case OMP_CLAUSE_SIMDLEN
:
4910 if (simple_cst_equal (OMP_CLAUSE_SIMDLEN_EXPR (cl1
),
4911 OMP_CLAUSE_SIMDLEN_EXPR (cl2
)) != 1)
4920 /* Compare two constructor-element-type constants. Return 1 if the lists
4921 are known to be equal; otherwise return 0. */
4924 simple_cst_list_equal (const_tree l1
, const_tree l2
)
4926 while (l1
!= NULL_TREE
&& l2
!= NULL_TREE
)
4928 if (simple_cst_equal (TREE_VALUE (l1
), TREE_VALUE (l2
)) != 1)
4931 l1
= TREE_CHAIN (l1
);
4932 l2
= TREE_CHAIN (l2
);
4938 /* Compare two identifier nodes representing attributes. Either one may
4939 be in wrapped __ATTR__ form. Return true if they are the same, false
4943 cmp_attrib_identifiers (const_tree attr1
, const_tree attr2
)
4945 /* Make sure we're dealing with IDENTIFIER_NODEs. */
4946 gcc_checking_assert (TREE_CODE (attr1
) == IDENTIFIER_NODE
4947 && TREE_CODE (attr2
) == IDENTIFIER_NODE
);
4949 /* Identifiers can be compared directly for equality. */
4953 /* If they are not equal, they may still be one in the form
4954 'text' while the other one is in the form '__text__'. TODO:
4955 If we were storing attributes in normalized 'text' form, then
4956 this could all go away and we could take full advantage of
4957 the fact that we're comparing identifiers. :-) */
4958 const size_t attr1_len
= IDENTIFIER_LENGTH (attr1
);
4959 const size_t attr2_len
= IDENTIFIER_LENGTH (attr2
);
4961 if (attr2_len
== attr1_len
+ 4)
4963 const char *p
= IDENTIFIER_POINTER (attr2
);
4964 const char *q
= IDENTIFIER_POINTER (attr1
);
4965 if (p
[0] == '_' && p
[1] == '_'
4966 && p
[attr2_len
- 2] == '_' && p
[attr2_len
- 1] == '_'
4967 && strncmp (q
, p
+ 2, attr1_len
) == 0)
4970 else if (attr2_len
+ 4 == attr1_len
)
4972 const char *p
= IDENTIFIER_POINTER (attr2
);
4973 const char *q
= IDENTIFIER_POINTER (attr1
);
4974 if (q
[0] == '_' && q
[1] == '_'
4975 && q
[attr1_len
- 2] == '_' && q
[attr1_len
- 1] == '_'
4976 && strncmp (q
+ 2, p
, attr2_len
) == 0)
4983 /* Compare two attributes for their value identity. Return true if the
4984 attribute values are known to be equal; otherwise return false. */
4987 attribute_value_equal (const_tree attr1
, const_tree attr2
)
4989 if (TREE_VALUE (attr1
) == TREE_VALUE (attr2
))
4992 if (TREE_VALUE (attr1
) != NULL_TREE
4993 && TREE_CODE (TREE_VALUE (attr1
)) == TREE_LIST
4994 && TREE_VALUE (attr2
) != NULL_TREE
4995 && TREE_CODE (TREE_VALUE (attr2
)) == TREE_LIST
)
4997 /* Handle attribute format. */
4998 if (is_attribute_p ("format", TREE_PURPOSE (attr1
)))
5000 attr1
= TREE_VALUE (attr1
);
5001 attr2
= TREE_VALUE (attr2
);
5002 /* Compare the archetypes (printf/scanf/strftime/...). */
5003 if (!cmp_attrib_identifiers (TREE_VALUE (attr1
),
5004 TREE_VALUE (attr2
)))
5006 /* Archetypes are the same. Compare the rest. */
5007 return (simple_cst_list_equal (TREE_CHAIN (attr1
),
5008 TREE_CHAIN (attr2
)) == 1);
5010 return (simple_cst_list_equal (TREE_VALUE (attr1
),
5011 TREE_VALUE (attr2
)) == 1);
5014 if ((flag_openmp
|| flag_openmp_simd
)
5015 && TREE_VALUE (attr1
) && TREE_VALUE (attr2
)
5016 && TREE_CODE (TREE_VALUE (attr1
)) == OMP_CLAUSE
5017 && TREE_CODE (TREE_VALUE (attr2
)) == OMP_CLAUSE
)
5018 return omp_declare_simd_clauses_equal (TREE_VALUE (attr1
),
5019 TREE_VALUE (attr2
));
5021 return (simple_cst_equal (TREE_VALUE (attr1
), TREE_VALUE (attr2
)) == 1);
5024 /* Return 0 if the attributes for two types are incompatible, 1 if they
5025 are compatible, and 2 if they are nearly compatible (which causes a
5026 warning to be generated). */
5028 comp_type_attributes (const_tree type1
, const_tree type2
)
5030 const_tree a1
= TYPE_ATTRIBUTES (type1
);
5031 const_tree a2
= TYPE_ATTRIBUTES (type2
);
5036 for (a
= a1
; a
!= NULL_TREE
; a
= TREE_CHAIN (a
))
5038 const struct attribute_spec
*as
;
5041 as
= lookup_attribute_spec (get_attribute_name (a
));
5042 if (!as
|| as
->affects_type_identity
== false)
5045 attr
= lookup_attribute (as
->name
, CONST_CAST_TREE (a2
));
5046 if (!attr
|| !attribute_value_equal (a
, attr
))
5051 for (a
= a2
; a
!= NULL_TREE
; a
= TREE_CHAIN (a
))
5053 const struct attribute_spec
*as
;
5055 as
= lookup_attribute_spec (get_attribute_name (a
));
5056 if (!as
|| as
->affects_type_identity
== false)
5059 if (!lookup_attribute (as
->name
, CONST_CAST_TREE (a1
)))
5061 /* We don't need to compare trees again, as we did this
5062 already in first loop. */
5064 /* All types - affecting identity - are equal, so
5065 there is no need to call target hook for comparison. */
5069 if (lookup_attribute ("transaction_safe", CONST_CAST_TREE (a
)))
5071 /* As some type combinations - like default calling-convention - might
5072 be compatible, we have to call the target hook to get the final result. */
5073 return targetm
.comp_type_attributes (type1
, type2
);
5076 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
5079 Record such modified types already made so we don't make duplicates. */
5082 build_type_attribute_variant (tree ttype
, tree attribute
)
5084 return build_type_attribute_qual_variant (ttype
, attribute
,
5085 TYPE_QUALS (ttype
));
5089 /* Reset the expression *EXPR_P, a size or position.
5091 ??? We could reset all non-constant sizes or positions. But it's cheap
5092 enough to not do so and refrain from adding workarounds to dwarf2out.c.
5094 We need to reset self-referential sizes or positions because they cannot
5095 be gimplified and thus can contain a CALL_EXPR after the gimplification
5096 is finished, which will run afoul of LTO streaming. And they need to be
5097 reset to something essentially dummy but not constant, so as to preserve
5098 the properties of the object they are attached to. */
5101 free_lang_data_in_one_sizepos (tree
*expr_p
)
5103 tree expr
= *expr_p
;
5104 if (CONTAINS_PLACEHOLDER_P (expr
))
5105 *expr_p
= build0 (PLACEHOLDER_EXPR
, TREE_TYPE (expr
));
5109 /* Reset all the fields in a binfo node BINFO. We only keep
5110 BINFO_VTABLE, which is used by gimple_fold_obj_type_ref. */
5113 free_lang_data_in_binfo (tree binfo
)
5118 gcc_assert (TREE_CODE (binfo
) == TREE_BINFO
);
5120 BINFO_VIRTUALS (binfo
) = NULL_TREE
;
5121 BINFO_BASE_ACCESSES (binfo
) = NULL
;
5122 BINFO_INHERITANCE_CHAIN (binfo
) = NULL_TREE
;
5123 BINFO_SUBVTT_INDEX (binfo
) = NULL_TREE
;
5125 FOR_EACH_VEC_ELT (*BINFO_BASE_BINFOS (binfo
), i
, t
)
5126 free_lang_data_in_binfo (t
);
5130 /* Reset all language specific information still present in TYPE. */
5133 free_lang_data_in_type (tree type
)
5135 gcc_assert (TYPE_P (type
));
5137 /* Give the FE a chance to remove its own data first. */
5138 lang_hooks
.free_lang_data (type
);
5140 TREE_LANG_FLAG_0 (type
) = 0;
5141 TREE_LANG_FLAG_1 (type
) = 0;
5142 TREE_LANG_FLAG_2 (type
) = 0;
5143 TREE_LANG_FLAG_3 (type
) = 0;
5144 TREE_LANG_FLAG_4 (type
) = 0;
5145 TREE_LANG_FLAG_5 (type
) = 0;
5146 TREE_LANG_FLAG_6 (type
) = 0;
5148 if (TREE_CODE (type
) == FUNCTION_TYPE
)
5150 /* Remove the const and volatile qualifiers from arguments. The
5151 C++ front end removes them, but the C front end does not,
5152 leading to false ODR violation errors when merging two
5153 instances of the same function signature compiled by
5154 different front ends. */
5157 for (p
= TYPE_ARG_TYPES (type
); p
; p
= TREE_CHAIN (p
))
5159 tree arg_type
= TREE_VALUE (p
);
5161 if (TYPE_READONLY (arg_type
) || TYPE_VOLATILE (arg_type
))
5163 int quals
= TYPE_QUALS (arg_type
)
5165 & ~TYPE_QUAL_VOLATILE
;
5166 TREE_VALUE (p
) = build_qualified_type (arg_type
, quals
);
5167 free_lang_data_in_type (TREE_VALUE (p
));
5169 /* C++ FE uses TREE_PURPOSE to store initial values. */
5170 TREE_PURPOSE (p
) = NULL
;
5172 /* Java uses TYPE_MINVAL for TYPE_ARGUMENT_SIGNATURE. */
5173 TYPE_MINVAL (type
) = NULL
;
5175 if (TREE_CODE (type
) == METHOD_TYPE
)
5179 for (p
= TYPE_ARG_TYPES (type
); p
; p
= TREE_CHAIN (p
))
5181 /* C++ FE uses TREE_PURPOSE to store initial values. */
5182 TREE_PURPOSE (p
) = NULL
;
5184 /* Java uses TYPE_MINVAL for TYPE_ARGUMENT_SIGNATURE. */
5185 TYPE_MINVAL (type
) = NULL
;
5188 /* Remove members that are not actually FIELD_DECLs from the field
5189 list of an aggregate. These occur in C++. */
5190 if (RECORD_OR_UNION_TYPE_P (type
))
5194 /* Note that TYPE_FIELDS can be shared across distinct
5195 TREE_TYPEs. Therefore, if the first field of TYPE_FIELDS is
5196 to be removed, we cannot set its TREE_CHAIN to NULL.
5197 Otherwise, we would not be able to find all the other fields
5198 in the other instances of this TREE_TYPE.
5200 This was causing an ICE in testsuite/g++.dg/lto/20080915.C. */
5202 member
= TYPE_FIELDS (type
);
5205 if (TREE_CODE (member
) == FIELD_DECL
5206 || TREE_CODE (member
) == TYPE_DECL
)
5209 TREE_CHAIN (prev
) = member
;
5211 TYPE_FIELDS (type
) = member
;
5215 member
= TREE_CHAIN (member
);
5219 TREE_CHAIN (prev
) = NULL_TREE
;
5221 TYPE_FIELDS (type
) = NULL_TREE
;
5223 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
5224 and danagle the pointer from time to time. */
5225 if (TYPE_VFIELD (type
) && TREE_CODE (TYPE_VFIELD (type
)) != FIELD_DECL
)
5226 TYPE_VFIELD (type
) = NULL_TREE
;
5228 /* Remove TYPE_METHODS list. While it would be nice to keep it
5229 to enable ODR warnings about different method lists, doing so
5230 seems to impractically increase size of LTO data streamed.
5231 Keep the infrmation if TYPE_METHODS was non-NULL. This is used
5232 by function.c and pretty printers. */
5233 if (TYPE_METHODS (type
))
5234 TYPE_METHODS (type
) = error_mark_node
;
5235 if (TYPE_BINFO (type
))
5237 free_lang_data_in_binfo (TYPE_BINFO (type
));
5238 /* We need to preserve link to bases and virtual table for all
5239 polymorphic types to make devirtualization machinery working.
5240 Debug output cares only about bases, but output also
5241 virtual table pointers so merging of -fdevirtualize and
5242 -fno-devirtualize units is easier. */
5243 if ((!BINFO_VTABLE (TYPE_BINFO (type
))
5244 || !flag_devirtualize
)
5245 && ((!BINFO_N_BASE_BINFOS (TYPE_BINFO (type
))
5246 && !BINFO_VTABLE (TYPE_BINFO (type
)))
5247 || debug_info_level
!= DINFO_LEVEL_NONE
))
5248 TYPE_BINFO (type
) = NULL
;
5253 /* For non-aggregate types, clear out the language slot (which
5254 overloads TYPE_BINFO). */
5255 TYPE_LANG_SLOT_1 (type
) = NULL_TREE
;
5257 if (INTEGRAL_TYPE_P (type
)
5258 || SCALAR_FLOAT_TYPE_P (type
)
5259 || FIXED_POINT_TYPE_P (type
))
5261 free_lang_data_in_one_sizepos (&TYPE_MIN_VALUE (type
));
5262 free_lang_data_in_one_sizepos (&TYPE_MAX_VALUE (type
));
5266 free_lang_data_in_one_sizepos (&TYPE_SIZE (type
));
5267 free_lang_data_in_one_sizepos (&TYPE_SIZE_UNIT (type
));
5269 if (TYPE_CONTEXT (type
)
5270 && TREE_CODE (TYPE_CONTEXT (type
)) == BLOCK
)
5272 tree ctx
= TYPE_CONTEXT (type
);
5275 ctx
= BLOCK_SUPERCONTEXT (ctx
);
5277 while (ctx
&& TREE_CODE (ctx
) == BLOCK
);
5278 TYPE_CONTEXT (type
) = ctx
;
5283 /* Return true if DECL may need an assembler name to be set. */
5286 need_assembler_name_p (tree decl
)
5288 /* We use DECL_ASSEMBLER_NAME to hold mangled type names for One Definition
5289 Rule merging. This makes type_odr_p to return true on those types during
5290 LTO and by comparing the mangled name, we can say what types are intended
5291 to be equivalent across compilation unit.
5293 We do not store names of type_in_anonymous_namespace_p.
5295 Record, union and enumeration type have linkage that allows use
5296 to check type_in_anonymous_namespace_p. We do not mangle compound types
5297 that always can be compared structurally.
5299 Similarly for builtin types, we compare properties of their main variant.
5300 A special case are integer types where mangling do make differences
5301 between char/signed char/unsigned char etc. Storing name for these makes
5302 e.g. -fno-signed-char/-fsigned-char mismatches to be handled well.
5303 See cp/mangle.c:write_builtin_type for details. */
5305 if (flag_lto_odr_type_mering
5306 && TREE_CODE (decl
) == TYPE_DECL
5308 && decl
== TYPE_NAME (TREE_TYPE (decl
))
5309 && !TYPE_ARTIFICIAL (TREE_TYPE (decl
))
5310 && (type_with_linkage_p (TREE_TYPE (decl
))
5311 || TREE_CODE (TREE_TYPE (decl
)) == INTEGER_TYPE
)
5312 && !variably_modified_type_p (TREE_TYPE (decl
), NULL_TREE
))
5313 return !DECL_ASSEMBLER_NAME_SET_P (decl
);
5314 /* Only FUNCTION_DECLs and VAR_DECLs are considered. */
5315 if (TREE_CODE (decl
) != FUNCTION_DECL
5316 && TREE_CODE (decl
) != VAR_DECL
)
5319 /* If DECL already has its assembler name set, it does not need a
5321 if (!HAS_DECL_ASSEMBLER_NAME_P (decl
)
5322 || DECL_ASSEMBLER_NAME_SET_P (decl
))
5325 /* Abstract decls do not need an assembler name. */
5326 if (DECL_ABSTRACT_P (decl
))
5329 /* For VAR_DECLs, only static, public and external symbols need an
5331 if (TREE_CODE (decl
) == VAR_DECL
5332 && !TREE_STATIC (decl
)
5333 && !TREE_PUBLIC (decl
)
5334 && !DECL_EXTERNAL (decl
))
5337 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5339 /* Do not set assembler name on builtins. Allow RTL expansion to
5340 decide whether to expand inline or via a regular call. */
5341 if (DECL_BUILT_IN (decl
)
5342 && DECL_BUILT_IN_CLASS (decl
) != BUILT_IN_FRONTEND
)
5345 /* Functions represented in the callgraph need an assembler name. */
5346 if (cgraph_node::get (decl
) != NULL
)
5349 /* Unused and not public functions don't need an assembler name. */
5350 if (!TREE_USED (decl
) && !TREE_PUBLIC (decl
))
5358 /* Reset all language specific information still present in symbol
5362 free_lang_data_in_decl (tree decl
)
5364 gcc_assert (DECL_P (decl
));
5366 /* Give the FE a chance to remove its own data first. */
5367 lang_hooks
.free_lang_data (decl
);
5369 TREE_LANG_FLAG_0 (decl
) = 0;
5370 TREE_LANG_FLAG_1 (decl
) = 0;
5371 TREE_LANG_FLAG_2 (decl
) = 0;
5372 TREE_LANG_FLAG_3 (decl
) = 0;
5373 TREE_LANG_FLAG_4 (decl
) = 0;
5374 TREE_LANG_FLAG_5 (decl
) = 0;
5375 TREE_LANG_FLAG_6 (decl
) = 0;
5377 free_lang_data_in_one_sizepos (&DECL_SIZE (decl
));
5378 free_lang_data_in_one_sizepos (&DECL_SIZE_UNIT (decl
));
5379 if (TREE_CODE (decl
) == FIELD_DECL
)
5381 free_lang_data_in_one_sizepos (&DECL_FIELD_OFFSET (decl
));
5382 if (TREE_CODE (DECL_CONTEXT (decl
)) == QUAL_UNION_TYPE
)
5383 DECL_QUALIFIER (decl
) = NULL_TREE
;
5386 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5388 struct cgraph_node
*node
;
5389 if (!(node
= cgraph_node::get (decl
))
5390 || (!node
->definition
&& !node
->clones
))
5393 node
->release_body ();
5396 release_function_body (decl
);
5397 DECL_ARGUMENTS (decl
) = NULL
;
5398 DECL_RESULT (decl
) = NULL
;
5399 DECL_INITIAL (decl
) = error_mark_node
;
5402 if (gimple_has_body_p (decl
))
5406 /* If DECL has a gimple body, then the context for its
5407 arguments must be DECL. Otherwise, it doesn't really
5408 matter, as we will not be emitting any code for DECL. In
5409 general, there may be other instances of DECL created by
5410 the front end and since PARM_DECLs are generally shared,
5411 their DECL_CONTEXT changes as the replicas of DECL are
5412 created. The only time where DECL_CONTEXT is important
5413 is for the FUNCTION_DECLs that have a gimple body (since
5414 the PARM_DECL will be used in the function's body). */
5415 for (t
= DECL_ARGUMENTS (decl
); t
; t
= TREE_CHAIN (t
))
5416 DECL_CONTEXT (t
) = decl
;
5417 if (!DECL_FUNCTION_SPECIFIC_TARGET (decl
))
5418 DECL_FUNCTION_SPECIFIC_TARGET (decl
)
5419 = target_option_default_node
;
5420 if (!DECL_FUNCTION_SPECIFIC_OPTIMIZATION (decl
))
5421 DECL_FUNCTION_SPECIFIC_OPTIMIZATION (decl
)
5422 = optimization_default_node
;
5425 /* DECL_SAVED_TREE holds the GENERIC representation for DECL.
5426 At this point, it is not needed anymore. */
5427 DECL_SAVED_TREE (decl
) = NULL_TREE
;
5429 /* Clear the abstract origin if it refers to a method. Otherwise
5430 dwarf2out.c will ICE as we clear TYPE_METHODS and thus the
5431 origin will not be output correctly. */
5432 if (DECL_ABSTRACT_ORIGIN (decl
)
5433 && DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))
5434 && RECORD_OR_UNION_TYPE_P
5435 (DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))))
5436 DECL_ABSTRACT_ORIGIN (decl
) = NULL_TREE
;
5438 /* Sometimes the C++ frontend doesn't manage to transform a temporary
5439 DECL_VINDEX referring to itself into a vtable slot number as it
5440 should. Happens with functions that are copied and then forgotten
5441 about. Just clear it, it won't matter anymore. */
5442 if (DECL_VINDEX (decl
) && !tree_fits_shwi_p (DECL_VINDEX (decl
)))
5443 DECL_VINDEX (decl
) = NULL_TREE
;
5445 else if (TREE_CODE (decl
) == VAR_DECL
)
5447 if ((DECL_EXTERNAL (decl
)
5448 && (!TREE_STATIC (decl
) || !TREE_READONLY (decl
)))
5449 || (decl_function_context (decl
) && !TREE_STATIC (decl
)))
5450 DECL_INITIAL (decl
) = NULL_TREE
;
5452 else if (TREE_CODE (decl
) == TYPE_DECL
5453 || TREE_CODE (decl
) == FIELD_DECL
)
5454 DECL_INITIAL (decl
) = NULL_TREE
;
5455 else if (TREE_CODE (decl
) == TRANSLATION_UNIT_DECL
5456 && DECL_INITIAL (decl
)
5457 && TREE_CODE (DECL_INITIAL (decl
)) == BLOCK
)
5459 /* Strip builtins from the translation-unit BLOCK. We still have targets
5460 without builtin_decl_explicit support and also builtins are shared
5461 nodes and thus we can't use TREE_CHAIN in multiple lists. */
5462 tree
*nextp
= &BLOCK_VARS (DECL_INITIAL (decl
));
5466 if (TREE_CODE (var
) == FUNCTION_DECL
5467 && DECL_BUILT_IN (var
))
5468 *nextp
= TREE_CHAIN (var
);
5470 nextp
= &TREE_CHAIN (var
);
5476 /* Data used when collecting DECLs and TYPEs for language data removal. */
5478 struct free_lang_data_d
5480 /* Worklist to avoid excessive recursion. */
5483 /* Set of traversed objects. Used to avoid duplicate visits. */
5484 hash_set
<tree
> *pset
;
5486 /* Array of symbols to process with free_lang_data_in_decl. */
5489 /* Array of types to process with free_lang_data_in_type. */
5494 /* Save all language fields needed to generate proper debug information
5495 for DECL. This saves most fields cleared out by free_lang_data_in_decl. */
5498 save_debug_info_for_decl (tree t
)
5500 /*struct saved_debug_info_d *sdi;*/
5502 gcc_assert (debug_info_level
> DINFO_LEVEL_TERSE
&& t
&& DECL_P (t
));
5504 /* FIXME. Partial implementation for saving debug info removed. */
5508 /* Save all language fields needed to generate proper debug information
5509 for TYPE. This saves most fields cleared out by free_lang_data_in_type. */
5512 save_debug_info_for_type (tree t
)
5514 /*struct saved_debug_info_d *sdi;*/
5516 gcc_assert (debug_info_level
> DINFO_LEVEL_TERSE
&& t
&& TYPE_P (t
));
5518 /* FIXME. Partial implementation for saving debug info removed. */
5522 /* Add type or decl T to one of the list of tree nodes that need their
5523 language data removed. The lists are held inside FLD. */
5526 add_tree_to_fld_list (tree t
, struct free_lang_data_d
*fld
)
5530 fld
->decls
.safe_push (t
);
5531 if (debug_info_level
> DINFO_LEVEL_TERSE
)
5532 save_debug_info_for_decl (t
);
5534 else if (TYPE_P (t
))
5536 fld
->types
.safe_push (t
);
5537 if (debug_info_level
> DINFO_LEVEL_TERSE
)
5538 save_debug_info_for_type (t
);
5544 /* Push tree node T into FLD->WORKLIST. */
5547 fld_worklist_push (tree t
, struct free_lang_data_d
*fld
)
5549 if (t
&& !is_lang_specific (t
) && !fld
->pset
->contains (t
))
5550 fld
->worklist
.safe_push ((t
));
5554 /* Operand callback helper for free_lang_data_in_node. *TP is the
5555 subtree operand being considered. */
5558 find_decls_types_r (tree
*tp
, int *ws
, void *data
)
5561 struct free_lang_data_d
*fld
= (struct free_lang_data_d
*) data
;
5563 if (TREE_CODE (t
) == TREE_LIST
)
5566 /* Language specific nodes will be removed, so there is no need
5567 to gather anything under them. */
5568 if (is_lang_specific (t
))
5576 /* Note that walk_tree does not traverse every possible field in
5577 decls, so we have to do our own traversals here. */
5578 add_tree_to_fld_list (t
, fld
);
5580 fld_worklist_push (DECL_NAME (t
), fld
);
5581 fld_worklist_push (DECL_CONTEXT (t
), fld
);
5582 fld_worklist_push (DECL_SIZE (t
), fld
);
5583 fld_worklist_push (DECL_SIZE_UNIT (t
), fld
);
5585 /* We are going to remove everything under DECL_INITIAL for
5586 TYPE_DECLs. No point walking them. */
5587 if (TREE_CODE (t
) != TYPE_DECL
)
5588 fld_worklist_push (DECL_INITIAL (t
), fld
);
5590 fld_worklist_push (DECL_ATTRIBUTES (t
), fld
);
5591 fld_worklist_push (DECL_ABSTRACT_ORIGIN (t
), fld
);
5593 if (TREE_CODE (t
) == FUNCTION_DECL
)
5595 fld_worklist_push (DECL_ARGUMENTS (t
), fld
);
5596 fld_worklist_push (DECL_RESULT (t
), fld
);
5598 else if (TREE_CODE (t
) == TYPE_DECL
)
5600 fld_worklist_push (DECL_ORIGINAL_TYPE (t
), fld
);
5602 else if (TREE_CODE (t
) == FIELD_DECL
)
5604 fld_worklist_push (DECL_FIELD_OFFSET (t
), fld
);
5605 fld_worklist_push (DECL_BIT_FIELD_TYPE (t
), fld
);
5606 fld_worklist_push (DECL_FIELD_BIT_OFFSET (t
), fld
);
5607 fld_worklist_push (DECL_FCONTEXT (t
), fld
);
5610 if ((TREE_CODE (t
) == VAR_DECL
|| TREE_CODE (t
) == PARM_DECL
)
5611 && DECL_HAS_VALUE_EXPR_P (t
))
5612 fld_worklist_push (DECL_VALUE_EXPR (t
), fld
);
5614 if (TREE_CODE (t
) != FIELD_DECL
5615 && TREE_CODE (t
) != TYPE_DECL
)
5616 fld_worklist_push (TREE_CHAIN (t
), fld
);
5619 else if (TYPE_P (t
))
5621 /* Note that walk_tree does not traverse every possible field in
5622 types, so we have to do our own traversals here. */
5623 add_tree_to_fld_list (t
, fld
);
5625 if (!RECORD_OR_UNION_TYPE_P (t
))
5626 fld_worklist_push (TYPE_CACHED_VALUES (t
), fld
);
5627 fld_worklist_push (TYPE_SIZE (t
), fld
);
5628 fld_worklist_push (TYPE_SIZE_UNIT (t
), fld
);
5629 fld_worklist_push (TYPE_ATTRIBUTES (t
), fld
);
5630 fld_worklist_push (TYPE_POINTER_TO (t
), fld
);
5631 fld_worklist_push (TYPE_REFERENCE_TO (t
), fld
);
5632 fld_worklist_push (TYPE_NAME (t
), fld
);
5633 /* Do not walk TYPE_NEXT_PTR_TO or TYPE_NEXT_REF_TO. We do not stream
5634 them and thus do not and want not to reach unused pointer types
5636 if (!POINTER_TYPE_P (t
))
5637 fld_worklist_push (TYPE_MINVAL (t
), fld
);
5638 if (!RECORD_OR_UNION_TYPE_P (t
))
5639 fld_worklist_push (TYPE_MAXVAL (t
), fld
);
5640 fld_worklist_push (TYPE_MAIN_VARIANT (t
), fld
);
5641 /* Do not walk TYPE_NEXT_VARIANT. We do not stream it and thus
5642 do not and want not to reach unused variants this way. */
5643 if (TYPE_CONTEXT (t
))
5645 tree ctx
= TYPE_CONTEXT (t
);
5646 /* We adjust BLOCK TYPE_CONTEXTs to the innermost non-BLOCK one.
5647 So push that instead. */
5648 while (ctx
&& TREE_CODE (ctx
) == BLOCK
)
5649 ctx
= BLOCK_SUPERCONTEXT (ctx
);
5650 fld_worklist_push (ctx
, fld
);
5652 /* Do not walk TYPE_CANONICAL. We do not stream it and thus do not
5653 and want not to reach unused types this way. */
5655 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_BINFO (t
))
5659 FOR_EACH_VEC_ELT (*BINFO_BASE_BINFOS (TYPE_BINFO (t
)), i
, tem
)
5660 fld_worklist_push (TREE_TYPE (tem
), fld
);
5661 tem
= BINFO_VIRTUALS (TYPE_BINFO (t
));
5663 /* The Java FE overloads BINFO_VIRTUALS for its own purpose. */
5664 && TREE_CODE (tem
) == TREE_LIST
)
5667 fld_worklist_push (TREE_VALUE (tem
), fld
);
5668 tem
= TREE_CHAIN (tem
);
5672 if (RECORD_OR_UNION_TYPE_P (t
))
5675 /* Push all TYPE_FIELDS - there can be interleaving interesting
5676 and non-interesting things. */
5677 tem
= TYPE_FIELDS (t
);
5680 if (TREE_CODE (tem
) == FIELD_DECL
5681 || TREE_CODE (tem
) == TYPE_DECL
)
5682 fld_worklist_push (tem
, fld
);
5683 tem
= TREE_CHAIN (tem
);
5687 fld_worklist_push (TYPE_STUB_DECL (t
), fld
);
5690 else if (TREE_CODE (t
) == BLOCK
)
5693 for (tem
= BLOCK_VARS (t
); tem
; tem
= TREE_CHAIN (tem
))
5694 fld_worklist_push (tem
, fld
);
5695 for (tem
= BLOCK_SUBBLOCKS (t
); tem
; tem
= BLOCK_CHAIN (tem
))
5696 fld_worklist_push (tem
, fld
);
5697 fld_worklist_push (BLOCK_ABSTRACT_ORIGIN (t
), fld
);
5700 if (TREE_CODE (t
) != IDENTIFIER_NODE
5701 && CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_TYPED
))
5702 fld_worklist_push (TREE_TYPE (t
), fld
);
5708 /* Find decls and types in T. */
5711 find_decls_types (tree t
, struct free_lang_data_d
*fld
)
5715 if (!fld
->pset
->contains (t
))
5716 walk_tree (&t
, find_decls_types_r
, fld
, fld
->pset
);
5717 if (fld
->worklist
.is_empty ())
5719 t
= fld
->worklist
.pop ();
5723 /* Translate all the types in LIST with the corresponding runtime
5727 get_eh_types_for_runtime (tree list
)
5731 if (list
== NULL_TREE
)
5734 head
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
5736 list
= TREE_CHAIN (list
);
5739 tree n
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
5740 TREE_CHAIN (prev
) = n
;
5741 prev
= TREE_CHAIN (prev
);
5742 list
= TREE_CHAIN (list
);
5749 /* Find decls and types referenced in EH region R and store them in
5750 FLD->DECLS and FLD->TYPES. */
5753 find_decls_types_in_eh_region (eh_region r
, struct free_lang_data_d
*fld
)
5764 /* The types referenced in each catch must first be changed to the
5765 EH types used at runtime. This removes references to FE types
5767 for (c
= r
->u
.eh_try
.first_catch
; c
; c
= c
->next_catch
)
5769 c
->type_list
= get_eh_types_for_runtime (c
->type_list
);
5770 walk_tree (&c
->type_list
, find_decls_types_r
, fld
, fld
->pset
);
5775 case ERT_ALLOWED_EXCEPTIONS
:
5776 r
->u
.allowed
.type_list
5777 = get_eh_types_for_runtime (r
->u
.allowed
.type_list
);
5778 walk_tree (&r
->u
.allowed
.type_list
, find_decls_types_r
, fld
, fld
->pset
);
5781 case ERT_MUST_NOT_THROW
:
5782 walk_tree (&r
->u
.must_not_throw
.failure_decl
,
5783 find_decls_types_r
, fld
, fld
->pset
);
5789 /* Find decls and types referenced in cgraph node N and store them in
5790 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
5791 look for *every* kind of DECL and TYPE node reachable from N,
5792 including those embedded inside types and decls (i.e,, TYPE_DECLs,
5793 NAMESPACE_DECLs, etc). */
5796 find_decls_types_in_node (struct cgraph_node
*n
, struct free_lang_data_d
*fld
)
5799 struct function
*fn
;
5803 find_decls_types (n
->decl
, fld
);
5805 if (!gimple_has_body_p (n
->decl
))
5808 gcc_assert (current_function_decl
== NULL_TREE
&& cfun
== NULL
);
5810 fn
= DECL_STRUCT_FUNCTION (n
->decl
);
5812 /* Traverse locals. */
5813 FOR_EACH_LOCAL_DECL (fn
, ix
, t
)
5814 find_decls_types (t
, fld
);
5816 /* Traverse EH regions in FN. */
5819 FOR_ALL_EH_REGION_FN (r
, fn
)
5820 find_decls_types_in_eh_region (r
, fld
);
5823 /* Traverse every statement in FN. */
5824 FOR_EACH_BB_FN (bb
, fn
)
5827 gimple_stmt_iterator si
;
5830 for (psi
= gsi_start_phis (bb
); !gsi_end_p (psi
); gsi_next (&psi
))
5832 gphi
*phi
= psi
.phi ();
5834 for (i
= 0; i
< gimple_phi_num_args (phi
); i
++)
5836 tree
*arg_p
= gimple_phi_arg_def_ptr (phi
, i
);
5837 find_decls_types (*arg_p
, fld
);
5841 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
5843 gimple
*stmt
= gsi_stmt (si
);
5845 if (is_gimple_call (stmt
))
5846 find_decls_types (gimple_call_fntype (stmt
), fld
);
5848 for (i
= 0; i
< gimple_num_ops (stmt
); i
++)
5850 tree arg
= gimple_op (stmt
, i
);
5851 find_decls_types (arg
, fld
);
5858 /* Find decls and types referenced in varpool node N and store them in
5859 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
5860 look for *every* kind of DECL and TYPE node reachable from N,
5861 including those embedded inside types and decls (i.e,, TYPE_DECLs,
5862 NAMESPACE_DECLs, etc). */
5865 find_decls_types_in_var (varpool_node
*v
, struct free_lang_data_d
*fld
)
5867 find_decls_types (v
->decl
, fld
);
5870 /* If T needs an assembler name, have one created for it. */
5873 assign_assembler_name_if_neeeded (tree t
)
5875 if (need_assembler_name_p (t
))
5877 /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit
5878 diagnostics that use input_location to show locus
5879 information. The problem here is that, at this point,
5880 input_location is generally anchored to the end of the file
5881 (since the parser is long gone), so we don't have a good
5882 position to pin it to.
5884 To alleviate this problem, this uses the location of T's
5885 declaration. Examples of this are
5886 testsuite/g++.dg/template/cond2.C and
5887 testsuite/g++.dg/template/pr35240.C. */
5888 location_t saved_location
= input_location
;
5889 input_location
= DECL_SOURCE_LOCATION (t
);
5891 decl_assembler_name (t
);
5893 input_location
= saved_location
;
5898 /* Free language specific information for every operand and expression
5899 in every node of the call graph. This process operates in three stages:
5901 1- Every callgraph node and varpool node is traversed looking for
5902 decls and types embedded in them. This is a more exhaustive
5903 search than that done by find_referenced_vars, because it will
5904 also collect individual fields, decls embedded in types, etc.
5906 2- All the decls found are sent to free_lang_data_in_decl.
5908 3- All the types found are sent to free_lang_data_in_type.
5910 The ordering between decls and types is important because
5911 free_lang_data_in_decl sets assembler names, which includes
5912 mangling. So types cannot be freed up until assembler names have
5916 free_lang_data_in_cgraph (void)
5918 struct cgraph_node
*n
;
5920 struct free_lang_data_d fld
;
5925 /* Initialize sets and arrays to store referenced decls and types. */
5926 fld
.pset
= new hash_set
<tree
>;
5927 fld
.worklist
.create (0);
5928 fld
.decls
.create (100);
5929 fld
.types
.create (100);
5931 /* Find decls and types in the body of every function in the callgraph. */
5932 FOR_EACH_FUNCTION (n
)
5933 find_decls_types_in_node (n
, &fld
);
5935 FOR_EACH_VEC_SAFE_ELT (alias_pairs
, i
, p
)
5936 find_decls_types (p
->decl
, &fld
);
5938 /* Find decls and types in every varpool symbol. */
5939 FOR_EACH_VARIABLE (v
)
5940 find_decls_types_in_var (v
, &fld
);
5942 /* Set the assembler name on every decl found. We need to do this
5943 now because free_lang_data_in_decl will invalidate data needed
5944 for mangling. This breaks mangling on interdependent decls. */
5945 FOR_EACH_VEC_ELT (fld
.decls
, i
, t
)
5946 assign_assembler_name_if_neeeded (t
);
5948 /* Traverse every decl found freeing its language data. */
5949 FOR_EACH_VEC_ELT (fld
.decls
, i
, t
)
5950 free_lang_data_in_decl (t
);
5952 /* Traverse every type found freeing its language data. */
5953 FOR_EACH_VEC_ELT (fld
.types
, i
, t
)
5954 free_lang_data_in_type (t
);
5957 FOR_EACH_VEC_ELT (fld
.types
, i
, t
)
5962 fld
.worklist
.release ();
5963 fld
.decls
.release ();
5964 fld
.types
.release ();
5968 /* Free resources that are used by FE but are not needed once they are done. */
5971 free_lang_data (void)
5975 /* If we are the LTO frontend we have freed lang-specific data already. */
5977 || (!flag_generate_lto
&& !flag_generate_offload
))
5980 /* Allocate and assign alias sets to the standard integer types
5981 while the slots are still in the way the frontends generated them. */
5982 for (i
= 0; i
< itk_none
; ++i
)
5983 if (integer_types
[i
])
5984 TYPE_ALIAS_SET (integer_types
[i
]) = get_alias_set (integer_types
[i
]);
5986 /* Traverse the IL resetting language specific information for
5987 operands, expressions, etc. */
5988 free_lang_data_in_cgraph ();
5990 /* Create gimple variants for common types. */
5991 ptrdiff_type_node
= integer_type_node
;
5992 fileptr_type_node
= ptr_type_node
;
5994 /* Reset some langhooks. Do not reset types_compatible_p, it may
5995 still be used indirectly via the get_alias_set langhook. */
5996 lang_hooks
.dwarf_name
= lhd_dwarf_name
;
5997 lang_hooks
.decl_printable_name
= gimple_decl_printable_name
;
5998 lang_hooks
.gimplify_expr
= lhd_gimplify_expr
;
6000 /* We do not want the default decl_assembler_name implementation,
6001 rather if we have fixed everything we want a wrapper around it
6002 asserting that all non-local symbols already got their assembler
6003 name and only produce assembler names for local symbols. Or rather
6004 make sure we never call decl_assembler_name on local symbols and
6005 devise a separate, middle-end private scheme for it. */
6007 /* Reset diagnostic machinery. */
6008 tree_diagnostics_defaults (global_dc
);
6016 const pass_data pass_data_ipa_free_lang_data
=
6018 SIMPLE_IPA_PASS
, /* type */
6019 "*free_lang_data", /* name */
6020 OPTGROUP_NONE
, /* optinfo_flags */
6021 TV_IPA_FREE_LANG_DATA
, /* tv_id */
6022 0, /* properties_required */
6023 0, /* properties_provided */
6024 0, /* properties_destroyed */
6025 0, /* todo_flags_start */
6026 0, /* todo_flags_finish */
6029 class pass_ipa_free_lang_data
: public simple_ipa_opt_pass
6032 pass_ipa_free_lang_data (gcc::context
*ctxt
)
6033 : simple_ipa_opt_pass (pass_data_ipa_free_lang_data
, ctxt
)
6036 /* opt_pass methods: */
6037 virtual unsigned int execute (function
*) { return free_lang_data (); }
6039 }; // class pass_ipa_free_lang_data
6043 simple_ipa_opt_pass
*
6044 make_pass_ipa_free_lang_data (gcc::context
*ctxt
)
6046 return new pass_ipa_free_lang_data (ctxt
);
6049 /* The backbone of is_attribute_p(). ATTR_LEN is the string length of
6050 ATTR_NAME. Also used internally by remove_attribute(). */
6052 private_is_attribute_p (const char *attr_name
, size_t attr_len
, const_tree ident
)
6054 size_t ident_len
= IDENTIFIER_LENGTH (ident
);
6056 if (ident_len
== attr_len
)
6058 if (strcmp (attr_name
, IDENTIFIER_POINTER (ident
)) == 0)
6061 else if (ident_len
== attr_len
+ 4)
6063 /* There is the possibility that ATTR is 'text' and IDENT is
6065 const char *p
= IDENTIFIER_POINTER (ident
);
6066 if (p
[0] == '_' && p
[1] == '_'
6067 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
6068 && strncmp (attr_name
, p
+ 2, attr_len
) == 0)
6075 /* The backbone of lookup_attribute(). ATTR_LEN is the string length
6076 of ATTR_NAME, and LIST is not NULL_TREE. */
6078 private_lookup_attribute (const char *attr_name
, size_t attr_len
, tree list
)
6082 size_t ident_len
= IDENTIFIER_LENGTH (get_attribute_name (list
));
6084 if (ident_len
== attr_len
)
6086 if (!strcmp (attr_name
,
6087 IDENTIFIER_POINTER (get_attribute_name (list
))))
6090 /* TODO: If we made sure that attributes were stored in the
6091 canonical form without '__...__' (ie, as in 'text' as opposed
6092 to '__text__') then we could avoid the following case. */
6093 else if (ident_len
== attr_len
+ 4)
6095 const char *p
= IDENTIFIER_POINTER (get_attribute_name (list
));
6096 if (p
[0] == '_' && p
[1] == '_'
6097 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
6098 && strncmp (attr_name
, p
+ 2, attr_len
) == 0)
6101 list
= TREE_CHAIN (list
);
6107 /* Given an attribute name ATTR_NAME and a list of attributes LIST,
6108 return a pointer to the attribute's list first element if the attribute
6109 starts with ATTR_NAME. ATTR_NAME must be in the form 'text' (not
6113 private_lookup_attribute_by_prefix (const char *attr_name
, size_t attr_len
,
6118 size_t ident_len
= IDENTIFIER_LENGTH (get_attribute_name (list
));
6120 if (attr_len
> ident_len
)
6122 list
= TREE_CHAIN (list
);
6126 const char *p
= IDENTIFIER_POINTER (get_attribute_name (list
));
6128 if (strncmp (attr_name
, p
, attr_len
) == 0)
6131 /* TODO: If we made sure that attributes were stored in the
6132 canonical form without '__...__' (ie, as in 'text' as opposed
6133 to '__text__') then we could avoid the following case. */
6134 if (p
[0] == '_' && p
[1] == '_' &&
6135 strncmp (attr_name
, p
+ 2, attr_len
) == 0)
6138 list
= TREE_CHAIN (list
);
6145 /* A variant of lookup_attribute() that can be used with an identifier
6146 as the first argument, and where the identifier can be either
6147 'text' or '__text__'.
6149 Given an attribute ATTR_IDENTIFIER, and a list of attributes LIST,
6150 return a pointer to the attribute's list element if the attribute
6151 is part of the list, or NULL_TREE if not found. If the attribute
6152 appears more than once, this only returns the first occurrence; the
6153 TREE_CHAIN of the return value should be passed back in if further
6154 occurrences are wanted. ATTR_IDENTIFIER must be an identifier but
6155 can be in the form 'text' or '__text__'. */
6157 lookup_ident_attribute (tree attr_identifier
, tree list
)
6159 gcc_checking_assert (TREE_CODE (attr_identifier
) == IDENTIFIER_NODE
);
6163 gcc_checking_assert (TREE_CODE (get_attribute_name (list
))
6164 == IDENTIFIER_NODE
);
6166 if (cmp_attrib_identifiers (attr_identifier
,
6167 get_attribute_name (list
)))
6170 list
= TREE_CHAIN (list
);
6176 /* Remove any instances of attribute ATTR_NAME in LIST and return the
6180 remove_attribute (const char *attr_name
, tree list
)
6183 size_t attr_len
= strlen (attr_name
);
6185 gcc_checking_assert (attr_name
[0] != '_');
6187 for (p
= &list
; *p
; )
6190 /* TODO: If we were storing attributes in normalized form, here
6191 we could use a simple strcmp(). */
6192 if (private_is_attribute_p (attr_name
, attr_len
, get_attribute_name (l
)))
6193 *p
= TREE_CHAIN (l
);
6195 p
= &TREE_CHAIN (l
);
6201 /* Return an attribute list that is the union of a1 and a2. */
6204 merge_attributes (tree a1
, tree a2
)
6208 /* Either one unset? Take the set one. */
6210 if ((attributes
= a1
) == 0)
6213 /* One that completely contains the other? Take it. */
6215 else if (a2
!= 0 && ! attribute_list_contained (a1
, a2
))
6217 if (attribute_list_contained (a2
, a1
))
6221 /* Pick the longest list, and hang on the other list. */
6223 if (list_length (a1
) < list_length (a2
))
6224 attributes
= a2
, a2
= a1
;
6226 for (; a2
!= 0; a2
= TREE_CHAIN (a2
))
6229 for (a
= lookup_ident_attribute (get_attribute_name (a2
),
6231 a
!= NULL_TREE
&& !attribute_value_equal (a
, a2
);
6232 a
= lookup_ident_attribute (get_attribute_name (a2
),
6237 a1
= copy_node (a2
);
6238 TREE_CHAIN (a1
) = attributes
;
6247 /* Given types T1 and T2, merge their attributes and return
6251 merge_type_attributes (tree t1
, tree t2
)
6253 return merge_attributes (TYPE_ATTRIBUTES (t1
),
6254 TYPE_ATTRIBUTES (t2
));
6257 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
6261 merge_decl_attributes (tree olddecl
, tree newdecl
)
6263 return merge_attributes (DECL_ATTRIBUTES (olddecl
),
6264 DECL_ATTRIBUTES (newdecl
));
6267 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
6269 /* Specialization of merge_decl_attributes for various Windows targets.
6271 This handles the following situation:
6273 __declspec (dllimport) int foo;
6276 The second instance of `foo' nullifies the dllimport. */
6279 merge_dllimport_decl_attributes (tree old
, tree new_tree
)
6282 int delete_dllimport_p
= 1;
6284 /* What we need to do here is remove from `old' dllimport if it doesn't
6285 appear in `new'. dllimport behaves like extern: if a declaration is
6286 marked dllimport and a definition appears later, then the object
6287 is not dllimport'd. We also remove a `new' dllimport if the old list
6288 contains dllexport: dllexport always overrides dllimport, regardless
6289 of the order of declaration. */
6290 if (!VAR_OR_FUNCTION_DECL_P (new_tree
))
6291 delete_dllimport_p
= 0;
6292 else if (DECL_DLLIMPORT_P (new_tree
)
6293 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (old
)))
6295 DECL_DLLIMPORT_P (new_tree
) = 0;
6296 warning (OPT_Wattributes
, "%q+D already declared with dllexport attribute: "
6297 "dllimport ignored", new_tree
);
6299 else if (DECL_DLLIMPORT_P (old
) && !DECL_DLLIMPORT_P (new_tree
))
6301 /* Warn about overriding a symbol that has already been used, e.g.:
6302 extern int __attribute__ ((dllimport)) foo;
6303 int* bar () {return &foo;}
6306 if (TREE_USED (old
))
6308 warning (0, "%q+D redeclared without dllimport attribute "
6309 "after being referenced with dll linkage", new_tree
);
6310 /* If we have used a variable's address with dllimport linkage,
6311 keep the old DECL_DLLIMPORT_P flag: the ADDR_EXPR using the
6312 decl may already have had TREE_CONSTANT computed.
6313 We still remove the attribute so that assembler code refers
6314 to '&foo rather than '_imp__foo'. */
6315 if (TREE_CODE (old
) == VAR_DECL
&& TREE_ADDRESSABLE (old
))
6316 DECL_DLLIMPORT_P (new_tree
) = 1;
6319 /* Let an inline definition silently override the external reference,
6320 but otherwise warn about attribute inconsistency. */
6321 else if (TREE_CODE (new_tree
) == VAR_DECL
6322 || !DECL_DECLARED_INLINE_P (new_tree
))
6323 warning (OPT_Wattributes
, "%q+D redeclared without dllimport attribute: "
6324 "previous dllimport ignored", new_tree
);
6327 delete_dllimport_p
= 0;
6329 a
= merge_attributes (DECL_ATTRIBUTES (old
), DECL_ATTRIBUTES (new_tree
));
6331 if (delete_dllimport_p
)
6332 a
= remove_attribute ("dllimport", a
);
6337 /* Handle a "dllimport" or "dllexport" attribute; arguments as in
6338 struct attribute_spec.handler. */
6341 handle_dll_attribute (tree
* pnode
, tree name
, tree args
, int flags
,
6347 /* These attributes may apply to structure and union types being created,
6348 but otherwise should pass to the declaration involved. */
6351 if (flags
& ((int) ATTR_FLAG_DECL_NEXT
| (int) ATTR_FLAG_FUNCTION_NEXT
6352 | (int) ATTR_FLAG_ARRAY_NEXT
))
6354 *no_add_attrs
= true;
6355 return tree_cons (name
, args
, NULL_TREE
);
6357 if (TREE_CODE (node
) == RECORD_TYPE
6358 || TREE_CODE (node
) == UNION_TYPE
)
6360 node
= TYPE_NAME (node
);
6366 warning (OPT_Wattributes
, "%qE attribute ignored",
6368 *no_add_attrs
= true;
6373 if (TREE_CODE (node
) != FUNCTION_DECL
6374 && TREE_CODE (node
) != VAR_DECL
6375 && TREE_CODE (node
) != TYPE_DECL
)
6377 *no_add_attrs
= true;
6378 warning (OPT_Wattributes
, "%qE attribute ignored",
6383 if (TREE_CODE (node
) == TYPE_DECL
6384 && TREE_CODE (TREE_TYPE (node
)) != RECORD_TYPE
6385 && TREE_CODE (TREE_TYPE (node
)) != UNION_TYPE
)
6387 *no_add_attrs
= true;
6388 warning (OPT_Wattributes
, "%qE attribute ignored",
6393 is_dllimport
= is_attribute_p ("dllimport", name
);
6395 /* Report error on dllimport ambiguities seen now before they cause
6399 /* Honor any target-specific overrides. */
6400 if (!targetm
.valid_dllimport_attribute_p (node
))
6401 *no_add_attrs
= true;
6403 else if (TREE_CODE (node
) == FUNCTION_DECL
6404 && DECL_DECLARED_INLINE_P (node
))
6406 warning (OPT_Wattributes
, "inline function %q+D declared as "
6407 " dllimport: attribute ignored", node
);
6408 *no_add_attrs
= true;
6410 /* Like MS, treat definition of dllimported variables and
6411 non-inlined functions on declaration as syntax errors. */
6412 else if (TREE_CODE (node
) == FUNCTION_DECL
&& DECL_INITIAL (node
))
6414 error ("function %q+D definition is marked dllimport", node
);
6415 *no_add_attrs
= true;
6418 else if (TREE_CODE (node
) == VAR_DECL
)
6420 if (DECL_INITIAL (node
))
6422 error ("variable %q+D definition is marked dllimport",
6424 *no_add_attrs
= true;
6427 /* `extern' needn't be specified with dllimport.
6428 Specify `extern' now and hope for the best. Sigh. */
6429 DECL_EXTERNAL (node
) = 1;
6430 /* Also, implicitly give dllimport'd variables declared within
6431 a function global scope, unless declared static. */
6432 if (current_function_decl
!= NULL_TREE
&& !TREE_STATIC (node
))
6433 TREE_PUBLIC (node
) = 1;
6436 if (*no_add_attrs
== false)
6437 DECL_DLLIMPORT_P (node
) = 1;
6439 else if (TREE_CODE (node
) == FUNCTION_DECL
6440 && DECL_DECLARED_INLINE_P (node
)
6441 && flag_keep_inline_dllexport
)
6442 /* An exported function, even if inline, must be emitted. */
6443 DECL_EXTERNAL (node
) = 0;
6445 /* Report error if symbol is not accessible at global scope. */
6446 if (!TREE_PUBLIC (node
)
6447 && (TREE_CODE (node
) == VAR_DECL
6448 || TREE_CODE (node
) == FUNCTION_DECL
))
6450 error ("external linkage required for symbol %q+D because of "
6451 "%qE attribute", node
, name
);
6452 *no_add_attrs
= true;
6455 /* A dllexport'd entity must have default visibility so that other
6456 program units (shared libraries or the main executable) can see
6457 it. A dllimport'd entity must have default visibility so that
6458 the linker knows that undefined references within this program
6459 unit can be resolved by the dynamic linker. */
6462 if (DECL_VISIBILITY_SPECIFIED (node
)
6463 && DECL_VISIBILITY (node
) != VISIBILITY_DEFAULT
)
6464 error ("%qE implies default visibility, but %qD has already "
6465 "been declared with a different visibility",
6467 DECL_VISIBILITY (node
) = VISIBILITY_DEFAULT
;
6468 DECL_VISIBILITY_SPECIFIED (node
) = 1;
6474 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
6476 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
6477 of the various TYPE_QUAL values. */
6480 set_type_quals (tree type
, int type_quals
)
6482 TYPE_READONLY (type
) = (type_quals
& TYPE_QUAL_CONST
) != 0;
6483 TYPE_VOLATILE (type
) = (type_quals
& TYPE_QUAL_VOLATILE
) != 0;
6484 TYPE_RESTRICT (type
) = (type_quals
& TYPE_QUAL_RESTRICT
) != 0;
6485 TYPE_ATOMIC (type
) = (type_quals
& TYPE_QUAL_ATOMIC
) != 0;
6486 TYPE_ADDR_SPACE (type
) = DECODE_QUAL_ADDR_SPACE (type_quals
);
6489 /* Returns true iff unqualified CAND and BASE are equivalent. */
6492 check_base_type (const_tree cand
, const_tree base
)
6494 return (TYPE_NAME (cand
) == TYPE_NAME (base
)
6495 /* Apparently this is needed for Objective-C. */
6496 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
6497 /* Check alignment. */
6498 && TYPE_ALIGN (cand
) == TYPE_ALIGN (base
)
6499 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
6500 TYPE_ATTRIBUTES (base
)));
6503 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
6506 check_qualified_type (const_tree cand
, const_tree base
, int type_quals
)
6508 return (TYPE_QUALS (cand
) == type_quals
6509 && check_base_type (cand
, base
));
6512 /* Returns true iff CAND is equivalent to BASE with ALIGN. */
6515 check_aligned_type (const_tree cand
, const_tree base
, unsigned int align
)
6517 return (TYPE_QUALS (cand
) == TYPE_QUALS (base
)
6518 && TYPE_NAME (cand
) == TYPE_NAME (base
)
6519 /* Apparently this is needed for Objective-C. */
6520 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
6521 /* Check alignment. */
6522 && TYPE_ALIGN (cand
) == align
6523 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
6524 TYPE_ATTRIBUTES (base
)));
6527 /* This function checks to see if TYPE matches the size one of the built-in
6528 atomic types, and returns that core atomic type. */
6531 find_atomic_core_type (tree type
)
6533 tree base_atomic_type
;
6535 /* Only handle complete types. */
6536 if (TYPE_SIZE (type
) == NULL_TREE
)
6539 HOST_WIDE_INT type_size
= tree_to_uhwi (TYPE_SIZE (type
));
6543 base_atomic_type
= atomicQI_type_node
;
6547 base_atomic_type
= atomicHI_type_node
;
6551 base_atomic_type
= atomicSI_type_node
;
6555 base_atomic_type
= atomicDI_type_node
;
6559 base_atomic_type
= atomicTI_type_node
;
6563 base_atomic_type
= NULL_TREE
;
6566 return base_atomic_type
;
6569 /* Return a version of the TYPE, qualified as indicated by the
6570 TYPE_QUALS, if one exists. If no qualified version exists yet,
6571 return NULL_TREE. */
6574 get_qualified_type (tree type
, int type_quals
)
6578 if (TYPE_QUALS (type
) == type_quals
)
6581 /* Search the chain of variants to see if there is already one there just
6582 like the one we need to have. If so, use that existing one. We must
6583 preserve the TYPE_NAME, since there is code that depends on this. */
6584 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
6585 if (check_qualified_type (t
, type
, type_quals
))
6591 /* Like get_qualified_type, but creates the type if it does not
6592 exist. This function never returns NULL_TREE. */
6595 build_qualified_type (tree type
, int type_quals
)
6599 /* See if we already have the appropriate qualified variant. */
6600 t
= get_qualified_type (type
, type_quals
);
6602 /* If not, build it. */
6605 t
= build_variant_type_copy (type
);
6606 set_type_quals (t
, type_quals
);
6608 if (((type_quals
& TYPE_QUAL_ATOMIC
) == TYPE_QUAL_ATOMIC
))
6610 /* See if this object can map to a basic atomic type. */
6611 tree atomic_type
= find_atomic_core_type (type
);
6614 /* Ensure the alignment of this type is compatible with
6615 the required alignment of the atomic type. */
6616 if (TYPE_ALIGN (atomic_type
) > TYPE_ALIGN (t
))
6617 TYPE_ALIGN (t
) = TYPE_ALIGN (atomic_type
);
6621 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
6622 /* Propagate structural equality. */
6623 SET_TYPE_STRUCTURAL_EQUALITY (t
);
6624 else if (TYPE_CANONICAL (type
) != type
)
6625 /* Build the underlying canonical type, since it is different
6628 tree c
= build_qualified_type (TYPE_CANONICAL (type
), type_quals
);
6629 TYPE_CANONICAL (t
) = TYPE_CANONICAL (c
);
6632 /* T is its own canonical type. */
6633 TYPE_CANONICAL (t
) = t
;
6640 /* Create a variant of type T with alignment ALIGN. */
6643 build_aligned_type (tree type
, unsigned int align
)
6647 if (TYPE_PACKED (type
)
6648 || TYPE_ALIGN (type
) == align
)
6651 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
6652 if (check_aligned_type (t
, type
, align
))
6655 t
= build_variant_type_copy (type
);
6656 TYPE_ALIGN (t
) = align
;
6661 /* Create a new distinct copy of TYPE. The new type is made its own
6662 MAIN_VARIANT. If TYPE requires structural equality checks, the
6663 resulting type requires structural equality checks; otherwise, its
6664 TYPE_CANONICAL points to itself. */
6667 build_distinct_type_copy (tree type
)
6669 tree t
= copy_node (type
);
6671 TYPE_POINTER_TO (t
) = 0;
6672 TYPE_REFERENCE_TO (t
) = 0;
6674 /* Set the canonical type either to a new equivalence class, or
6675 propagate the need for structural equality checks. */
6676 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
6677 SET_TYPE_STRUCTURAL_EQUALITY (t
);
6679 TYPE_CANONICAL (t
) = t
;
6681 /* Make it its own variant. */
6682 TYPE_MAIN_VARIANT (t
) = t
;
6683 TYPE_NEXT_VARIANT (t
) = 0;
6685 /* We do not record methods in type copies nor variants
6686 so we do not need to keep them up to date when new method
6688 if (RECORD_OR_UNION_TYPE_P (t
))
6689 TYPE_METHODS (t
) = NULL_TREE
;
6691 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
6692 whose TREE_TYPE is not t. This can also happen in the Ada
6693 frontend when using subtypes. */
6698 /* Create a new variant of TYPE, equivalent but distinct. This is so
6699 the caller can modify it. TYPE_CANONICAL for the return type will
6700 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
6701 are considered equal by the language itself (or that both types
6702 require structural equality checks). */
6705 build_variant_type_copy (tree type
)
6707 tree t
, m
= TYPE_MAIN_VARIANT (type
);
6709 t
= build_distinct_type_copy (type
);
6711 /* Since we're building a variant, assume that it is a non-semantic
6712 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
6713 TYPE_CANONICAL (t
) = TYPE_CANONICAL (type
);
6715 /* Add the new type to the chain of variants of TYPE. */
6716 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (m
);
6717 TYPE_NEXT_VARIANT (m
) = t
;
6718 TYPE_MAIN_VARIANT (t
) = m
;
6723 /* Return true if the from tree in both tree maps are equal. */
6726 tree_map_base_eq (const void *va
, const void *vb
)
6728 const struct tree_map_base
*const a
= (const struct tree_map_base
*) va
,
6729 *const b
= (const struct tree_map_base
*) vb
;
6730 return (a
->from
== b
->from
);
6733 /* Hash a from tree in a tree_base_map. */
6736 tree_map_base_hash (const void *item
)
6738 return htab_hash_pointer (((const struct tree_map_base
*)item
)->from
);
6741 /* Return true if this tree map structure is marked for garbage collection
6742 purposes. We simply return true if the from tree is marked, so that this
6743 structure goes away when the from tree goes away. */
6746 tree_map_base_marked_p (const void *p
)
6748 return ggc_marked_p (((const struct tree_map_base
*) p
)->from
);
6751 /* Hash a from tree in a tree_map. */
6754 tree_map_hash (const void *item
)
6756 return (((const struct tree_map
*) item
)->hash
);
6759 /* Hash a from tree in a tree_decl_map. */
6762 tree_decl_map_hash (const void *item
)
6764 return DECL_UID (((const struct tree_decl_map
*) item
)->base
.from
);
6767 /* Return the initialization priority for DECL. */
6770 decl_init_priority_lookup (tree decl
)
6772 symtab_node
*snode
= symtab_node::get (decl
);
6775 return DEFAULT_INIT_PRIORITY
;
6777 snode
->get_init_priority ();
6780 /* Return the finalization priority for DECL. */
6783 decl_fini_priority_lookup (tree decl
)
6785 cgraph_node
*node
= cgraph_node::get (decl
);
6788 return DEFAULT_INIT_PRIORITY
;
6790 node
->get_fini_priority ();
6793 /* Set the initialization priority for DECL to PRIORITY. */
6796 decl_init_priority_insert (tree decl
, priority_type priority
)
6798 struct symtab_node
*snode
;
6800 if (priority
== DEFAULT_INIT_PRIORITY
)
6802 snode
= symtab_node::get (decl
);
6806 else if (TREE_CODE (decl
) == VAR_DECL
)
6807 snode
= varpool_node::get_create (decl
);
6809 snode
= cgraph_node::get_create (decl
);
6810 snode
->set_init_priority (priority
);
6813 /* Set the finalization priority for DECL to PRIORITY. */
6816 decl_fini_priority_insert (tree decl
, priority_type priority
)
6818 struct cgraph_node
*node
;
6820 if (priority
== DEFAULT_INIT_PRIORITY
)
6822 node
= cgraph_node::get (decl
);
6827 node
= cgraph_node::get_create (decl
);
6828 node
->set_fini_priority (priority
);
6831 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
6834 print_debug_expr_statistics (void)
6836 fprintf (stderr
, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
6837 (long) debug_expr_for_decl
->size (),
6838 (long) debug_expr_for_decl
->elements (),
6839 debug_expr_for_decl
->collisions ());
6842 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
6845 print_value_expr_statistics (void)
6847 fprintf (stderr
, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
6848 (long) value_expr_for_decl
->size (),
6849 (long) value_expr_for_decl
->elements (),
6850 value_expr_for_decl
->collisions ());
6853 /* Lookup a debug expression for FROM, and return it if we find one. */
6856 decl_debug_expr_lookup (tree from
)
6858 struct tree_decl_map
*h
, in
;
6859 in
.base
.from
= from
;
6861 h
= debug_expr_for_decl
->find_with_hash (&in
, DECL_UID (from
));
6867 /* Insert a mapping FROM->TO in the debug expression hashtable. */
6870 decl_debug_expr_insert (tree from
, tree to
)
6872 struct tree_decl_map
*h
;
6874 h
= ggc_alloc
<tree_decl_map
> ();
6875 h
->base
.from
= from
;
6877 *debug_expr_for_decl
->find_slot_with_hash (h
, DECL_UID (from
), INSERT
) = h
;
6880 /* Lookup a value expression for FROM, and return it if we find one. */
6883 decl_value_expr_lookup (tree from
)
6885 struct tree_decl_map
*h
, in
;
6886 in
.base
.from
= from
;
6888 h
= value_expr_for_decl
->find_with_hash (&in
, DECL_UID (from
));
6894 /* Insert a mapping FROM->TO in the value expression hashtable. */
6897 decl_value_expr_insert (tree from
, tree to
)
6899 struct tree_decl_map
*h
;
6901 h
= ggc_alloc
<tree_decl_map
> ();
6902 h
->base
.from
= from
;
6904 *value_expr_for_decl
->find_slot_with_hash (h
, DECL_UID (from
), INSERT
) = h
;
6907 /* Lookup a vector of debug arguments for FROM, and return it if we
6911 decl_debug_args_lookup (tree from
)
6913 struct tree_vec_map
*h
, in
;
6915 if (!DECL_HAS_DEBUG_ARGS_P (from
))
6917 gcc_checking_assert (debug_args_for_decl
!= NULL
);
6918 in
.base
.from
= from
;
6919 h
= debug_args_for_decl
->find_with_hash (&in
, DECL_UID (from
));
6925 /* Insert a mapping FROM->empty vector of debug arguments in the value
6926 expression hashtable. */
6929 decl_debug_args_insert (tree from
)
6931 struct tree_vec_map
*h
;
6934 if (DECL_HAS_DEBUG_ARGS_P (from
))
6935 return decl_debug_args_lookup (from
);
6936 if (debug_args_for_decl
== NULL
)
6937 debug_args_for_decl
= hash_table
<tree_vec_map_cache_hasher
>::create_ggc (64);
6938 h
= ggc_alloc
<tree_vec_map
> ();
6939 h
->base
.from
= from
;
6941 loc
= debug_args_for_decl
->find_slot_with_hash (h
, DECL_UID (from
), INSERT
);
6943 DECL_HAS_DEBUG_ARGS_P (from
) = 1;
6947 /* Hashing of types so that we don't make duplicates.
6948 The entry point is `type_hash_canon'. */
6950 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
6951 with types in the TREE_VALUE slots), by adding the hash codes
6952 of the individual types. */
6955 type_hash_list (const_tree list
, inchash::hash
&hstate
)
6959 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
6960 if (TREE_VALUE (tail
) != error_mark_node
)
6961 hstate
.add_object (TYPE_HASH (TREE_VALUE (tail
)));
6964 /* These are the Hashtable callback functions. */
6966 /* Returns true iff the types are equivalent. */
6969 type_cache_hasher::equal (type_hash
*a
, type_hash
*b
)
6971 /* First test the things that are the same for all types. */
6972 if (a
->hash
!= b
->hash
6973 || TREE_CODE (a
->type
) != TREE_CODE (b
->type
)
6974 || TREE_TYPE (a
->type
) != TREE_TYPE (b
->type
)
6975 || !attribute_list_equal (TYPE_ATTRIBUTES (a
->type
),
6976 TYPE_ATTRIBUTES (b
->type
))
6977 || (TREE_CODE (a
->type
) != COMPLEX_TYPE
6978 && TYPE_NAME (a
->type
) != TYPE_NAME (b
->type
)))
6981 /* Be careful about comparing arrays before and after the element type
6982 has been completed; don't compare TYPE_ALIGN unless both types are
6984 if (COMPLETE_TYPE_P (a
->type
) && COMPLETE_TYPE_P (b
->type
)
6985 && (TYPE_ALIGN (a
->type
) != TYPE_ALIGN (b
->type
)
6986 || TYPE_MODE (a
->type
) != TYPE_MODE (b
->type
)))
6989 switch (TREE_CODE (a
->type
))
6994 case REFERENCE_TYPE
:
6999 return TYPE_VECTOR_SUBPARTS (a
->type
) == TYPE_VECTOR_SUBPARTS (b
->type
);
7002 if (TYPE_VALUES (a
->type
) != TYPE_VALUES (b
->type
)
7003 && !(TYPE_VALUES (a
->type
)
7004 && TREE_CODE (TYPE_VALUES (a
->type
)) == TREE_LIST
7005 && TYPE_VALUES (b
->type
)
7006 && TREE_CODE (TYPE_VALUES (b
->type
)) == TREE_LIST
7007 && type_list_equal (TYPE_VALUES (a
->type
),
7008 TYPE_VALUES (b
->type
))))
7011 /* ... fall through ... */
7016 if (TYPE_PRECISION (a
->type
) != TYPE_PRECISION (b
->type
))
7018 return ((TYPE_MAX_VALUE (a
->type
) == TYPE_MAX_VALUE (b
->type
)
7019 || tree_int_cst_equal (TYPE_MAX_VALUE (a
->type
),
7020 TYPE_MAX_VALUE (b
->type
)))
7021 && (TYPE_MIN_VALUE (a
->type
) == TYPE_MIN_VALUE (b
->type
)
7022 || tree_int_cst_equal (TYPE_MIN_VALUE (a
->type
),
7023 TYPE_MIN_VALUE (b
->type
))));
7025 case FIXED_POINT_TYPE
:
7026 return TYPE_SATURATING (a
->type
) == TYPE_SATURATING (b
->type
);
7029 return TYPE_OFFSET_BASETYPE (a
->type
) == TYPE_OFFSET_BASETYPE (b
->type
);
7032 if (TYPE_METHOD_BASETYPE (a
->type
) == TYPE_METHOD_BASETYPE (b
->type
)
7033 && (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
7034 || (TYPE_ARG_TYPES (a
->type
)
7035 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
7036 && TYPE_ARG_TYPES (b
->type
)
7037 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
7038 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
7039 TYPE_ARG_TYPES (b
->type
)))))
7043 return TYPE_DOMAIN (a
->type
) == TYPE_DOMAIN (b
->type
);
7047 case QUAL_UNION_TYPE
:
7048 return (TYPE_FIELDS (a
->type
) == TYPE_FIELDS (b
->type
)
7049 || (TYPE_FIELDS (a
->type
)
7050 && TREE_CODE (TYPE_FIELDS (a
->type
)) == TREE_LIST
7051 && TYPE_FIELDS (b
->type
)
7052 && TREE_CODE (TYPE_FIELDS (b
->type
)) == TREE_LIST
7053 && type_list_equal (TYPE_FIELDS (a
->type
),
7054 TYPE_FIELDS (b
->type
))));
7057 if (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
7058 || (TYPE_ARG_TYPES (a
->type
)
7059 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
7060 && TYPE_ARG_TYPES (b
->type
)
7061 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
7062 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
7063 TYPE_ARG_TYPES (b
->type
))))
7071 if (lang_hooks
.types
.type_hash_eq
!= NULL
)
7072 return lang_hooks
.types
.type_hash_eq (a
->type
, b
->type
);
7077 /* Given TYPE, and HASHCODE its hash code, return the canonical
7078 object for an identical type if one already exists.
7079 Otherwise, return TYPE, and record it as the canonical object.
7081 To use this function, first create a type of the sort you want.
7082 Then compute its hash code from the fields of the type that
7083 make it different from other similar types.
7084 Then call this function and use the value. */
7087 type_hash_canon (unsigned int hashcode
, tree type
)
7092 /* The hash table only contains main variants, so ensure that's what we're
7094 gcc_assert (TYPE_MAIN_VARIANT (type
) == type
);
7096 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
7097 must call that routine before comparing TYPE_ALIGNs. */
7103 loc
= type_hash_table
->find_slot_with_hash (&in
, hashcode
, INSERT
);
7106 tree t1
= ((type_hash
*) *loc
)->type
;
7107 gcc_assert (TYPE_MAIN_VARIANT (t1
) == t1
);
7108 if (GATHER_STATISTICS
)
7110 tree_code_counts
[(int) TREE_CODE (type
)]--;
7111 tree_node_counts
[(int) t_kind
]--;
7112 tree_node_sizes
[(int) t_kind
] -= sizeof (struct tree_type_non_common
);
7118 struct type_hash
*h
;
7120 h
= ggc_alloc
<type_hash
> ();
7130 print_type_hash_statistics (void)
7132 fprintf (stderr
, "Type hash: size %ld, %ld elements, %f collisions\n",
7133 (long) type_hash_table
->size (),
7134 (long) type_hash_table
->elements (),
7135 type_hash_table
->collisions ());
7138 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
7139 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
7140 by adding the hash codes of the individual attributes. */
7143 attribute_hash_list (const_tree list
, inchash::hash
&hstate
)
7147 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
7148 /* ??? Do we want to add in TREE_VALUE too? */
7149 hstate
.add_object (IDENTIFIER_HASH_VALUE (get_attribute_name (tail
)));
7152 /* Given two lists of attributes, return true if list l2 is
7153 equivalent to l1. */
7156 attribute_list_equal (const_tree l1
, const_tree l2
)
7161 return attribute_list_contained (l1
, l2
)
7162 && attribute_list_contained (l2
, l1
);
7165 /* Given two lists of attributes, return true if list L2 is
7166 completely contained within L1. */
7167 /* ??? This would be faster if attribute names were stored in a canonicalized
7168 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
7169 must be used to show these elements are equivalent (which they are). */
7170 /* ??? It's not clear that attributes with arguments will always be handled
7174 attribute_list_contained (const_tree l1
, const_tree l2
)
7178 /* First check the obvious, maybe the lists are identical. */
7182 /* Maybe the lists are similar. */
7183 for (t1
= l1
, t2
= l2
;
7185 && get_attribute_name (t1
) == get_attribute_name (t2
)
7186 && TREE_VALUE (t1
) == TREE_VALUE (t2
);
7187 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
7190 /* Maybe the lists are equal. */
7191 if (t1
== 0 && t2
== 0)
7194 for (; t2
!= 0; t2
= TREE_CHAIN (t2
))
7197 /* This CONST_CAST is okay because lookup_attribute does not
7198 modify its argument and the return value is assigned to a
7200 for (attr
= lookup_ident_attribute (get_attribute_name (t2
),
7201 CONST_CAST_TREE (l1
));
7202 attr
!= NULL_TREE
&& !attribute_value_equal (t2
, attr
);
7203 attr
= lookup_ident_attribute (get_attribute_name (t2
),
7207 if (attr
== NULL_TREE
)
7214 /* Given two lists of types
7215 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
7216 return 1 if the lists contain the same types in the same order.
7217 Also, the TREE_PURPOSEs must match. */
7220 type_list_equal (const_tree l1
, const_tree l2
)
7224 for (t1
= l1
, t2
= l2
; t1
&& t2
; t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
7225 if (TREE_VALUE (t1
) != TREE_VALUE (t2
)
7226 || (TREE_PURPOSE (t1
) != TREE_PURPOSE (t2
)
7227 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
))
7228 && (TREE_TYPE (TREE_PURPOSE (t1
))
7229 == TREE_TYPE (TREE_PURPOSE (t2
))))))
7235 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
7236 given by TYPE. If the argument list accepts variable arguments,
7237 then this function counts only the ordinary arguments. */
7240 type_num_arguments (const_tree type
)
7245 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
7246 /* If the function does not take a variable number of arguments,
7247 the last element in the list will have type `void'. */
7248 if (VOID_TYPE_P (TREE_VALUE (t
)))
7256 /* Nonzero if integer constants T1 and T2
7257 represent the same constant value. */
7260 tree_int_cst_equal (const_tree t1
, const_tree t2
)
7265 if (t1
== 0 || t2
== 0)
7268 if (TREE_CODE (t1
) == INTEGER_CST
7269 && TREE_CODE (t2
) == INTEGER_CST
7270 && wi::to_widest (t1
) == wi::to_widest (t2
))
7276 /* Return true if T is an INTEGER_CST whose numerical value (extended
7277 according to TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. */
7280 tree_fits_shwi_p (const_tree t
)
7282 return (t
!= NULL_TREE
7283 && TREE_CODE (t
) == INTEGER_CST
7284 && wi::fits_shwi_p (wi::to_widest (t
)));
7287 /* Return true if T is an INTEGER_CST whose numerical value (extended
7288 according to TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. */
7291 tree_fits_uhwi_p (const_tree t
)
7293 return (t
!= NULL_TREE
7294 && TREE_CODE (t
) == INTEGER_CST
7295 && wi::fits_uhwi_p (wi::to_widest (t
)));
7298 /* T is an INTEGER_CST whose numerical value (extended according to
7299 TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. Return that
7303 tree_to_shwi (const_tree t
)
7305 gcc_assert (tree_fits_shwi_p (t
));
7306 return TREE_INT_CST_LOW (t
);
7309 /* T is an INTEGER_CST whose numerical value (extended according to
7310 TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. Return that
7313 unsigned HOST_WIDE_INT
7314 tree_to_uhwi (const_tree t
)
7316 gcc_assert (tree_fits_uhwi_p (t
));
7317 return TREE_INT_CST_LOW (t
);
7320 /* Return the most significant (sign) bit of T. */
7323 tree_int_cst_sign_bit (const_tree t
)
7325 unsigned bitno
= TYPE_PRECISION (TREE_TYPE (t
)) - 1;
7327 return wi::extract_uhwi (t
, bitno
, 1);
7330 /* Return an indication of the sign of the integer constant T.
7331 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
7332 Note that -1 will never be returned if T's type is unsigned. */
7335 tree_int_cst_sgn (const_tree t
)
7337 if (wi::eq_p (t
, 0))
7339 else if (TYPE_UNSIGNED (TREE_TYPE (t
)))
7341 else if (wi::neg_p (t
))
7347 /* Return the minimum number of bits needed to represent VALUE in a
7348 signed or unsigned type, UNSIGNEDP says which. */
7351 tree_int_cst_min_precision (tree value
, signop sgn
)
7353 /* If the value is negative, compute its negative minus 1. The latter
7354 adjustment is because the absolute value of the largest negative value
7355 is one larger than the largest positive value. This is equivalent to
7356 a bit-wise negation, so use that operation instead. */
7358 if (tree_int_cst_sgn (value
) < 0)
7359 value
= fold_build1 (BIT_NOT_EXPR
, TREE_TYPE (value
), value
);
7361 /* Return the number of bits needed, taking into account the fact
7362 that we need one more bit for a signed than unsigned type.
7363 If value is 0 or -1, the minimum precision is 1 no matter
7364 whether unsignedp is true or false. */
7366 if (integer_zerop (value
))
7369 return tree_floor_log2 (value
) + 1 + (sgn
== SIGNED
? 1 : 0) ;
7372 /* Return truthvalue of whether T1 is the same tree structure as T2.
7373 Return 1 if they are the same.
7374 Return 0 if they are understandably different.
7375 Return -1 if either contains tree structure not understood by
7379 simple_cst_equal (const_tree t1
, const_tree t2
)
7381 enum tree_code code1
, code2
;
7387 if (t1
== 0 || t2
== 0)
7390 code1
= TREE_CODE (t1
);
7391 code2
= TREE_CODE (t2
);
7393 if (CONVERT_EXPR_CODE_P (code1
) || code1
== NON_LVALUE_EXPR
)
7395 if (CONVERT_EXPR_CODE_P (code2
)
7396 || code2
== NON_LVALUE_EXPR
)
7397 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7399 return simple_cst_equal (TREE_OPERAND (t1
, 0), t2
);
7402 else if (CONVERT_EXPR_CODE_P (code2
)
7403 || code2
== NON_LVALUE_EXPR
)
7404 return simple_cst_equal (t1
, TREE_OPERAND (t2
, 0));
7412 return wi::to_widest (t1
) == wi::to_widest (t2
);
7415 return real_identical (&TREE_REAL_CST (t1
), &TREE_REAL_CST (t2
));
7418 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1
), TREE_FIXED_CST (t2
));
7421 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
7422 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
7423 TREE_STRING_LENGTH (t1
)));
7427 unsigned HOST_WIDE_INT idx
;
7428 vec
<constructor_elt
, va_gc
> *v1
= CONSTRUCTOR_ELTS (t1
);
7429 vec
<constructor_elt
, va_gc
> *v2
= CONSTRUCTOR_ELTS (t2
);
7431 if (vec_safe_length (v1
) != vec_safe_length (v2
))
7434 for (idx
= 0; idx
< vec_safe_length (v1
); ++idx
)
7435 /* ??? Should we handle also fields here? */
7436 if (!simple_cst_equal ((*v1
)[idx
].value
, (*v2
)[idx
].value
))
7442 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7445 cmp
= simple_cst_equal (CALL_EXPR_FN (t1
), CALL_EXPR_FN (t2
));
7448 if (call_expr_nargs (t1
) != call_expr_nargs (t2
))
7451 const_tree arg1
, arg2
;
7452 const_call_expr_arg_iterator iter1
, iter2
;
7453 for (arg1
= first_const_call_expr_arg (t1
, &iter1
),
7454 arg2
= first_const_call_expr_arg (t2
, &iter2
);
7456 arg1
= next_const_call_expr_arg (&iter1
),
7457 arg2
= next_const_call_expr_arg (&iter2
))
7459 cmp
= simple_cst_equal (arg1
, arg2
);
7463 return arg1
== arg2
;
7467 /* Special case: if either target is an unallocated VAR_DECL,
7468 it means that it's going to be unified with whatever the
7469 TARGET_EXPR is really supposed to initialize, so treat it
7470 as being equivalent to anything. */
7471 if ((TREE_CODE (TREE_OPERAND (t1
, 0)) == VAR_DECL
7472 && DECL_NAME (TREE_OPERAND (t1
, 0)) == NULL_TREE
7473 && !DECL_RTL_SET_P (TREE_OPERAND (t1
, 0)))
7474 || (TREE_CODE (TREE_OPERAND (t2
, 0)) == VAR_DECL
7475 && DECL_NAME (TREE_OPERAND (t2
, 0)) == NULL_TREE
7476 && !DECL_RTL_SET_P (TREE_OPERAND (t2
, 0))))
7479 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7484 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
7486 case WITH_CLEANUP_EXPR
:
7487 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7491 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t1
, 1));
7494 if (TREE_OPERAND (t1
, 1) == TREE_OPERAND (t2
, 1))
7495 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7509 /* This general rule works for most tree codes. All exceptions should be
7510 handled above. If this is a language-specific tree code, we can't
7511 trust what might be in the operand, so say we don't know
7513 if ((int) code1
>= (int) LAST_AND_UNUSED_TREE_CODE
)
7516 switch (TREE_CODE_CLASS (code1
))
7520 case tcc_comparison
:
7521 case tcc_expression
:
7525 for (i
= 0; i
< TREE_CODE_LENGTH (code1
); i
++)
7527 cmp
= simple_cst_equal (TREE_OPERAND (t1
, i
), TREE_OPERAND (t2
, i
));
7539 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
7540 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
7541 than U, respectively. */
7544 compare_tree_int (const_tree t
, unsigned HOST_WIDE_INT u
)
7546 if (tree_int_cst_sgn (t
) < 0)
7548 else if (!tree_fits_uhwi_p (t
))
7550 else if (TREE_INT_CST_LOW (t
) == u
)
7552 else if (TREE_INT_CST_LOW (t
) < u
)
7558 /* Return true if SIZE represents a constant size that is in bounds of
7559 what the middle-end and the backend accepts (covering not more than
7560 half of the address-space). */
7563 valid_constant_size_p (const_tree size
)
7565 if (! tree_fits_uhwi_p (size
)
7566 || TREE_OVERFLOW (size
)
7567 || tree_int_cst_sign_bit (size
) != 0)
7572 /* Return the precision of the type, or for a complex or vector type the
7573 precision of the type of its elements. */
7576 element_precision (const_tree type
)
7579 type
= TREE_TYPE (type
);
7580 enum tree_code code
= TREE_CODE (type
);
7581 if (code
== COMPLEX_TYPE
|| code
== VECTOR_TYPE
)
7582 type
= TREE_TYPE (type
);
7584 return TYPE_PRECISION (type
);
7587 /* Return true if CODE represents an associative tree code. Otherwise
7590 associative_tree_code (enum tree_code code
)
7609 /* Return true if CODE represents a commutative tree code. Otherwise
7612 commutative_tree_code (enum tree_code code
)
7618 case MULT_HIGHPART_EXPR
:
7626 case UNORDERED_EXPR
:
7630 case TRUTH_AND_EXPR
:
7631 case TRUTH_XOR_EXPR
:
7633 case WIDEN_MULT_EXPR
:
7634 case VEC_WIDEN_MULT_HI_EXPR
:
7635 case VEC_WIDEN_MULT_LO_EXPR
:
7636 case VEC_WIDEN_MULT_EVEN_EXPR
:
7637 case VEC_WIDEN_MULT_ODD_EXPR
:
7646 /* Return true if CODE represents a ternary tree code for which the
7647 first two operands are commutative. Otherwise return false. */
7649 commutative_ternary_tree_code (enum tree_code code
)
7653 case WIDEN_MULT_PLUS_EXPR
:
7654 case WIDEN_MULT_MINUS_EXPR
:
7665 /* Returns true if CODE can overflow. */
7668 operation_can_overflow (enum tree_code code
)
7676 /* Can overflow in various ways. */
7678 case TRUNC_DIV_EXPR
:
7679 case EXACT_DIV_EXPR
:
7680 case FLOOR_DIV_EXPR
:
7682 /* For INT_MIN / -1. */
7689 /* These operators cannot overflow. */
7694 /* Returns true if CODE operating on operands of type TYPE doesn't overflow, or
7695 ftrapv doesn't generate trapping insns for CODE. */
7698 operation_no_trapping_overflow (tree type
, enum tree_code code
)
7700 gcc_checking_assert (ANY_INTEGRAL_TYPE_P (type
));
7702 /* We don't generate instructions that trap on overflow for complex or vector
7704 if (!INTEGRAL_TYPE_P (type
))
7707 if (!TYPE_OVERFLOW_TRAPS (type
))
7717 /* These operators can overflow, and -ftrapv generates trapping code for
7720 case TRUNC_DIV_EXPR
:
7721 case EXACT_DIV_EXPR
:
7722 case FLOOR_DIV_EXPR
:
7725 /* These operators can overflow, but -ftrapv does not generate trapping
7729 /* These operators cannot overflow. */
7737 /* Generate a hash value for an expression. This can be used iteratively
7738 by passing a previous result as the HSTATE argument.
7740 This function is intended to produce the same hash for expressions which
7741 would compare equal using operand_equal_p. */
7743 add_expr (const_tree t
, inchash::hash
&hstate
)
7746 enum tree_code code
;
7747 enum tree_code_class tclass
;
7751 hstate
.merge_hash (0);
7755 code
= TREE_CODE (t
);
7759 /* Alas, constants aren't shared, so we can't rely on pointer
7762 hstate
.merge_hash (0);
7765 for (i
= 0; i
< TREE_INT_CST_NUNITS (t
); i
++)
7766 hstate
.add_wide_int (TREE_INT_CST_ELT (t
, i
));
7770 unsigned int val2
= real_hash (TREE_REAL_CST_PTR (t
));
7771 hstate
.merge_hash (val2
);
7776 unsigned int val2
= fixed_hash (TREE_FIXED_CST_PTR (t
));
7777 hstate
.merge_hash (val2
);
7781 hstate
.add ((const void *) TREE_STRING_POINTER (t
), TREE_STRING_LENGTH (t
));
7784 inchash::add_expr (TREE_REALPART (t
), hstate
);
7785 inchash::add_expr (TREE_IMAGPART (t
), hstate
);
7790 for (i
= 0; i
< VECTOR_CST_NELTS (t
); ++i
)
7791 inchash::add_expr (VECTOR_CST_ELT (t
, i
), hstate
);
7795 /* We can just compare by pointer. */
7796 hstate
.add_wide_int (SSA_NAME_VERSION (t
));
7798 case PLACEHOLDER_EXPR
:
7799 /* The node itself doesn't matter. */
7802 /* A list of expressions, for a CALL_EXPR or as the elements of a
7804 for (; t
; t
= TREE_CHAIN (t
))
7805 inchash::add_expr (TREE_VALUE (t
), hstate
);
7809 unsigned HOST_WIDE_INT idx
;
7811 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t
), idx
, field
, value
)
7813 inchash::add_expr (field
, hstate
);
7814 inchash::add_expr (value
, hstate
);
7819 /* When referring to a built-in FUNCTION_DECL, use the __builtin__ form.
7820 Otherwise nodes that compare equal according to operand_equal_p might
7821 get different hash codes. However, don't do this for machine specific
7822 or front end builtins, since the function code is overloaded in those
7824 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
7825 && builtin_decl_explicit_p (DECL_FUNCTION_CODE (t
)))
7827 t
= builtin_decl_explicit (DECL_FUNCTION_CODE (t
));
7828 code
= TREE_CODE (t
);
7832 tclass
= TREE_CODE_CLASS (code
);
7834 if (tclass
== tcc_declaration
)
7836 /* DECL's have a unique ID */
7837 hstate
.add_wide_int (DECL_UID (t
));
7841 gcc_assert (IS_EXPR_CODE_CLASS (tclass
));
7843 hstate
.add_object (code
);
7845 /* Don't hash the type, that can lead to having nodes which
7846 compare equal according to operand_equal_p, but which
7847 have different hash codes. */
7848 if (CONVERT_EXPR_CODE_P (code
)
7849 || code
== NON_LVALUE_EXPR
)
7851 /* Make sure to include signness in the hash computation. */
7852 hstate
.add_int (TYPE_UNSIGNED (TREE_TYPE (t
)));
7853 inchash::add_expr (TREE_OPERAND (t
, 0), hstate
);
7856 else if (commutative_tree_code (code
))
7858 /* It's a commutative expression. We want to hash it the same
7859 however it appears. We do this by first hashing both operands
7860 and then rehashing based on the order of their independent
7862 inchash::hash one
, two
;
7863 inchash::add_expr (TREE_OPERAND (t
, 0), one
);
7864 inchash::add_expr (TREE_OPERAND (t
, 1), two
);
7865 hstate
.add_commutative (one
, two
);
7868 for (i
= TREE_OPERAND_LENGTH (t
) - 1; i
>= 0; --i
)
7869 inchash::add_expr (TREE_OPERAND (t
, i
), hstate
);
7877 /* Constructors for pointer, array and function types.
7878 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
7879 constructed by language-dependent code, not here.) */
7881 /* Construct, lay out and return the type of pointers to TO_TYPE with
7882 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
7883 reference all of memory. If such a type has already been
7884 constructed, reuse it. */
7887 build_pointer_type_for_mode (tree to_type
, machine_mode mode
,
7891 bool could_alias
= can_alias_all
;
7893 if (to_type
== error_mark_node
)
7894 return error_mark_node
;
7896 /* If the pointed-to type has the may_alias attribute set, force
7897 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7898 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
7899 can_alias_all
= true;
7901 /* In some cases, languages will have things that aren't a POINTER_TYPE
7902 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
7903 In that case, return that type without regard to the rest of our
7906 ??? This is a kludge, but consistent with the way this function has
7907 always operated and there doesn't seem to be a good way to avoid this
7909 if (TYPE_POINTER_TO (to_type
) != 0
7910 && TREE_CODE (TYPE_POINTER_TO (to_type
)) != POINTER_TYPE
)
7911 return TYPE_POINTER_TO (to_type
);
7913 /* First, if we already have a type for pointers to TO_TYPE and it's
7914 the proper mode, use it. */
7915 for (t
= TYPE_POINTER_TO (to_type
); t
; t
= TYPE_NEXT_PTR_TO (t
))
7916 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
7919 t
= make_node (POINTER_TYPE
);
7921 TREE_TYPE (t
) = to_type
;
7922 SET_TYPE_MODE (t
, mode
);
7923 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
7924 TYPE_NEXT_PTR_TO (t
) = TYPE_POINTER_TO (to_type
);
7925 TYPE_POINTER_TO (to_type
) = t
;
7927 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
))
7928 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7929 else if (TYPE_CANONICAL (to_type
) != to_type
|| could_alias
)
7931 = build_pointer_type_for_mode (TYPE_CANONICAL (to_type
),
7934 /* Lay out the type. This function has many callers that are concerned
7935 with expression-construction, and this simplifies them all. */
7941 /* By default build pointers in ptr_mode. */
7944 build_pointer_type (tree to_type
)
7946 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
7947 : TYPE_ADDR_SPACE (to_type
);
7948 machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
7949 return build_pointer_type_for_mode (to_type
, pointer_mode
, false);
7952 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
7955 build_reference_type_for_mode (tree to_type
, machine_mode mode
,
7959 bool could_alias
= can_alias_all
;
7961 if (to_type
== error_mark_node
)
7962 return error_mark_node
;
7964 /* If the pointed-to type has the may_alias attribute set, force
7965 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7966 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
7967 can_alias_all
= true;
7969 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
7970 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
7971 In that case, return that type without regard to the rest of our
7974 ??? This is a kludge, but consistent with the way this function has
7975 always operated and there doesn't seem to be a good way to avoid this
7977 if (TYPE_REFERENCE_TO (to_type
) != 0
7978 && TREE_CODE (TYPE_REFERENCE_TO (to_type
)) != REFERENCE_TYPE
)
7979 return TYPE_REFERENCE_TO (to_type
);
7981 /* First, if we already have a type for pointers to TO_TYPE and it's
7982 the proper mode, use it. */
7983 for (t
= TYPE_REFERENCE_TO (to_type
); t
; t
= TYPE_NEXT_REF_TO (t
))
7984 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
7987 t
= make_node (REFERENCE_TYPE
);
7989 TREE_TYPE (t
) = to_type
;
7990 SET_TYPE_MODE (t
, mode
);
7991 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
7992 TYPE_NEXT_REF_TO (t
) = TYPE_REFERENCE_TO (to_type
);
7993 TYPE_REFERENCE_TO (to_type
) = t
;
7995 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
))
7996 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7997 else if (TYPE_CANONICAL (to_type
) != to_type
|| could_alias
)
7999 = build_reference_type_for_mode (TYPE_CANONICAL (to_type
),
8008 /* Build the node for the type of references-to-TO_TYPE by default
8012 build_reference_type (tree to_type
)
8014 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
8015 : TYPE_ADDR_SPACE (to_type
);
8016 machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
8017 return build_reference_type_for_mode (to_type
, pointer_mode
, false);
8020 #define MAX_INT_CACHED_PREC \
8021 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
8022 static GTY(()) tree nonstandard_integer_type_cache
[2 * MAX_INT_CACHED_PREC
+ 2];
8024 /* Builds a signed or unsigned integer type of precision PRECISION.
8025 Used for C bitfields whose precision does not match that of
8026 built-in target types. */
8028 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision
,
8034 unsignedp
= MAX_INT_CACHED_PREC
+ 1;
8036 if (precision
<= MAX_INT_CACHED_PREC
)
8038 itype
= nonstandard_integer_type_cache
[precision
+ unsignedp
];
8043 itype
= make_node (INTEGER_TYPE
);
8044 TYPE_PRECISION (itype
) = precision
;
8047 fixup_unsigned_type (itype
);
8049 fixup_signed_type (itype
);
8052 if (tree_fits_uhwi_p (TYPE_MAX_VALUE (itype
)))
8053 ret
= type_hash_canon (tree_to_uhwi (TYPE_MAX_VALUE (itype
)), itype
);
8054 if (precision
<= MAX_INT_CACHED_PREC
)
8055 nonstandard_integer_type_cache
[precision
+ unsignedp
] = ret
;
8060 #define MAX_BOOL_CACHED_PREC \
8061 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
8062 static GTY(()) tree nonstandard_boolean_type_cache
[MAX_BOOL_CACHED_PREC
+ 1];
8064 /* Builds a boolean type of precision PRECISION.
8065 Used for boolean vectors to choose proper vector element size. */
8067 build_nonstandard_boolean_type (unsigned HOST_WIDE_INT precision
)
8071 if (precision
<= MAX_BOOL_CACHED_PREC
)
8073 type
= nonstandard_boolean_type_cache
[precision
];
8078 type
= make_node (BOOLEAN_TYPE
);
8079 TYPE_PRECISION (type
) = precision
;
8080 fixup_unsigned_type (type
);
8082 if (precision
<= MAX_INT_CACHED_PREC
)
8083 nonstandard_boolean_type_cache
[precision
] = type
;
8088 /* Create a range of some discrete type TYPE (an INTEGER_TYPE, ENUMERAL_TYPE
8089 or BOOLEAN_TYPE) with low bound LOWVAL and high bound HIGHVAL. If SHARED
8090 is true, reuse such a type that has already been constructed. */
8093 build_range_type_1 (tree type
, tree lowval
, tree highval
, bool shared
)
8095 tree itype
= make_node (INTEGER_TYPE
);
8096 inchash::hash hstate
;
8098 TREE_TYPE (itype
) = type
;
8100 TYPE_MIN_VALUE (itype
) = fold_convert (type
, lowval
);
8101 TYPE_MAX_VALUE (itype
) = highval
? fold_convert (type
, highval
) : NULL
;
8103 TYPE_PRECISION (itype
) = TYPE_PRECISION (type
);
8104 SET_TYPE_MODE (itype
, TYPE_MODE (type
));
8105 TYPE_SIZE (itype
) = TYPE_SIZE (type
);
8106 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (type
);
8107 TYPE_ALIGN (itype
) = TYPE_ALIGN (type
);
8108 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (type
);
8113 if ((TYPE_MIN_VALUE (itype
)
8114 && TREE_CODE (TYPE_MIN_VALUE (itype
)) != INTEGER_CST
)
8115 || (TYPE_MAX_VALUE (itype
)
8116 && TREE_CODE (TYPE_MAX_VALUE (itype
)) != INTEGER_CST
))
8118 /* Since we cannot reliably merge this type, we need to compare it using
8119 structural equality checks. */
8120 SET_TYPE_STRUCTURAL_EQUALITY (itype
);
8124 inchash::add_expr (TYPE_MIN_VALUE (itype
), hstate
);
8125 inchash::add_expr (TYPE_MAX_VALUE (itype
), hstate
);
8126 hstate
.merge_hash (TYPE_HASH (type
));
8127 itype
= type_hash_canon (hstate
.end (), itype
);
8132 /* Wrapper around build_range_type_1 with SHARED set to true. */
8135 build_range_type (tree type
, tree lowval
, tree highval
)
8137 return build_range_type_1 (type
, lowval
, highval
, true);
8140 /* Wrapper around build_range_type_1 with SHARED set to false. */
8143 build_nonshared_range_type (tree type
, tree lowval
, tree highval
)
8145 return build_range_type_1 (type
, lowval
, highval
, false);
8148 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
8149 MAXVAL should be the maximum value in the domain
8150 (one less than the length of the array).
8152 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
8153 We don't enforce this limit, that is up to caller (e.g. language front end).
8154 The limit exists because the result is a signed type and we don't handle
8155 sizes that use more than one HOST_WIDE_INT. */
8158 build_index_type (tree maxval
)
8160 return build_range_type (sizetype
, size_zero_node
, maxval
);
8163 /* Return true if the debug information for TYPE, a subtype, should be emitted
8164 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
8165 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
8166 debug info and doesn't reflect the source code. */
8169 subrange_type_for_debug_p (const_tree type
, tree
*lowval
, tree
*highval
)
8171 tree base_type
= TREE_TYPE (type
), low
, high
;
8173 /* Subrange types have a base type which is an integral type. */
8174 if (!INTEGRAL_TYPE_P (base_type
))
8177 /* Get the real bounds of the subtype. */
8178 if (lang_hooks
.types
.get_subrange_bounds
)
8179 lang_hooks
.types
.get_subrange_bounds (type
, &low
, &high
);
8182 low
= TYPE_MIN_VALUE (type
);
8183 high
= TYPE_MAX_VALUE (type
);
8186 /* If the type and its base type have the same representation and the same
8187 name, then the type is not a subrange but a copy of the base type. */
8188 if ((TREE_CODE (base_type
) == INTEGER_TYPE
8189 || TREE_CODE (base_type
) == BOOLEAN_TYPE
)
8190 && int_size_in_bytes (type
) == int_size_in_bytes (base_type
)
8191 && tree_int_cst_equal (low
, TYPE_MIN_VALUE (base_type
))
8192 && tree_int_cst_equal (high
, TYPE_MAX_VALUE (base_type
))
8193 && TYPE_IDENTIFIER (type
) == TYPE_IDENTIFIER (base_type
))
8203 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
8204 and number of elements specified by the range of values of INDEX_TYPE.
8205 If SHARED is true, reuse such a type that has already been constructed. */
8208 build_array_type_1 (tree elt_type
, tree index_type
, bool shared
)
8212 if (TREE_CODE (elt_type
) == FUNCTION_TYPE
)
8214 error ("arrays of functions are not meaningful");
8215 elt_type
= integer_type_node
;
8218 t
= make_node (ARRAY_TYPE
);
8219 TREE_TYPE (t
) = elt_type
;
8220 TYPE_DOMAIN (t
) = index_type
;
8221 TYPE_ADDR_SPACE (t
) = TYPE_ADDR_SPACE (elt_type
);
8224 /* If the element type is incomplete at this point we get marked for
8225 structural equality. Do not record these types in the canonical
8227 if (TYPE_STRUCTURAL_EQUALITY_P (t
))
8232 inchash::hash hstate
;
8233 hstate
.add_object (TYPE_HASH (elt_type
));
8235 hstate
.add_object (TYPE_HASH (index_type
));
8236 t
= type_hash_canon (hstate
.end (), t
);
8239 if (TYPE_CANONICAL (t
) == t
)
8241 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type
)
8242 || (index_type
&& TYPE_STRUCTURAL_EQUALITY_P (index_type
)))
8243 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8244 else if (TYPE_CANONICAL (elt_type
) != elt_type
8245 || (index_type
&& TYPE_CANONICAL (index_type
) != index_type
))
8247 = build_array_type_1 (TYPE_CANONICAL (elt_type
),
8249 ? TYPE_CANONICAL (index_type
) : NULL_TREE
,
8256 /* Wrapper around build_array_type_1 with SHARED set to true. */
8259 build_array_type (tree elt_type
, tree index_type
)
8261 return build_array_type_1 (elt_type
, index_type
, true);
8264 /* Wrapper around build_array_type_1 with SHARED set to false. */
8267 build_nonshared_array_type (tree elt_type
, tree index_type
)
8269 return build_array_type_1 (elt_type
, index_type
, false);
8272 /* Return a representation of ELT_TYPE[NELTS], using indices of type
8276 build_array_type_nelts (tree elt_type
, unsigned HOST_WIDE_INT nelts
)
8278 return build_array_type (elt_type
, build_index_type (size_int (nelts
- 1)));
8281 /* Recursively examines the array elements of TYPE, until a non-array
8282 element type is found. */
8285 strip_array_types (tree type
)
8287 while (TREE_CODE (type
) == ARRAY_TYPE
)
8288 type
= TREE_TYPE (type
);
8293 /* Computes the canonical argument types from the argument type list
8296 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
8297 on entry to this function, or if any of the ARGTYPES are
8300 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
8301 true on entry to this function, or if any of the ARGTYPES are
8304 Returns a canonical argument list, which may be ARGTYPES when the
8305 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
8306 true) or would not differ from ARGTYPES. */
8309 maybe_canonicalize_argtypes (tree argtypes
,
8310 bool *any_structural_p
,
8311 bool *any_noncanonical_p
)
8314 bool any_noncanonical_argtypes_p
= false;
8316 for (arg
= argtypes
; arg
&& !(*any_structural_p
); arg
= TREE_CHAIN (arg
))
8318 if (!TREE_VALUE (arg
) || TREE_VALUE (arg
) == error_mark_node
)
8319 /* Fail gracefully by stating that the type is structural. */
8320 *any_structural_p
= true;
8321 else if (TYPE_STRUCTURAL_EQUALITY_P (TREE_VALUE (arg
)))
8322 *any_structural_p
= true;
8323 else if (TYPE_CANONICAL (TREE_VALUE (arg
)) != TREE_VALUE (arg
)
8324 || TREE_PURPOSE (arg
))
8325 /* If the argument has a default argument, we consider it
8326 non-canonical even though the type itself is canonical.
8327 That way, different variants of function and method types
8328 with default arguments will all point to the variant with
8329 no defaults as their canonical type. */
8330 any_noncanonical_argtypes_p
= true;
8333 if (*any_structural_p
)
8336 if (any_noncanonical_argtypes_p
)
8338 /* Build the canonical list of argument types. */
8339 tree canon_argtypes
= NULL_TREE
;
8340 bool is_void
= false;
8342 for (arg
= argtypes
; arg
; arg
= TREE_CHAIN (arg
))
8344 if (arg
== void_list_node
)
8347 canon_argtypes
= tree_cons (NULL_TREE
,
8348 TYPE_CANONICAL (TREE_VALUE (arg
)),
8352 canon_argtypes
= nreverse (canon_argtypes
);
8354 canon_argtypes
= chainon (canon_argtypes
, void_list_node
);
8356 /* There is a non-canonical type. */
8357 *any_noncanonical_p
= true;
8358 return canon_argtypes
;
8361 /* The canonical argument types are the same as ARGTYPES. */
8365 /* Construct, lay out and return
8366 the type of functions returning type VALUE_TYPE
8367 given arguments of types ARG_TYPES.
8368 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
8369 are data type nodes for the arguments of the function.
8370 If such a type has already been constructed, reuse it. */
8373 build_function_type (tree value_type
, tree arg_types
)
8376 inchash::hash hstate
;
8377 bool any_structural_p
, any_noncanonical_p
;
8378 tree canon_argtypes
;
8380 if (TREE_CODE (value_type
) == FUNCTION_TYPE
)
8382 error ("function return type cannot be function");
8383 value_type
= integer_type_node
;
8386 /* Make a node of the sort we want. */
8387 t
= make_node (FUNCTION_TYPE
);
8388 TREE_TYPE (t
) = value_type
;
8389 TYPE_ARG_TYPES (t
) = arg_types
;
8391 /* If we already have such a type, use the old one. */
8392 hstate
.add_object (TYPE_HASH (value_type
));
8393 type_hash_list (arg_types
, hstate
);
8394 t
= type_hash_canon (hstate
.end (), t
);
8396 /* Set up the canonical type. */
8397 any_structural_p
= TYPE_STRUCTURAL_EQUALITY_P (value_type
);
8398 any_noncanonical_p
= TYPE_CANONICAL (value_type
) != value_type
;
8399 canon_argtypes
= maybe_canonicalize_argtypes (arg_types
,
8401 &any_noncanonical_p
);
8402 if (any_structural_p
)
8403 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8404 else if (any_noncanonical_p
)
8405 TYPE_CANONICAL (t
) = build_function_type (TYPE_CANONICAL (value_type
),
8408 if (!COMPLETE_TYPE_P (t
))
8413 /* Build a function type. The RETURN_TYPE is the type returned by the
8414 function. If VAARGS is set, no void_type_node is appended to the
8415 the list. ARGP must be always be terminated be a NULL_TREE. */
8418 build_function_type_list_1 (bool vaargs
, tree return_type
, va_list argp
)
8422 t
= va_arg (argp
, tree
);
8423 for (args
= NULL_TREE
; t
!= NULL_TREE
; t
= va_arg (argp
, tree
))
8424 args
= tree_cons (NULL_TREE
, t
, args
);
8429 if (args
!= NULL_TREE
)
8430 args
= nreverse (args
);
8431 gcc_assert (last
!= void_list_node
);
8433 else if (args
== NULL_TREE
)
8434 args
= void_list_node
;
8438 args
= nreverse (args
);
8439 TREE_CHAIN (last
) = void_list_node
;
8441 args
= build_function_type (return_type
, args
);
8446 /* Build a function type. The RETURN_TYPE is the type returned by the
8447 function. If additional arguments are provided, they are
8448 additional argument types. The list of argument types must always
8449 be terminated by NULL_TREE. */
8452 build_function_type_list (tree return_type
, ...)
8457 va_start (p
, return_type
);
8458 args
= build_function_type_list_1 (false, return_type
, p
);
8463 /* Build a variable argument function type. The RETURN_TYPE is the
8464 type returned by the function. If additional arguments are provided,
8465 they are additional argument types. The list of argument types must
8466 always be terminated by NULL_TREE. */
8469 build_varargs_function_type_list (tree return_type
, ...)
8474 va_start (p
, return_type
);
8475 args
= build_function_type_list_1 (true, return_type
, p
);
8481 /* Build a function type. RETURN_TYPE is the type returned by the
8482 function; VAARGS indicates whether the function takes varargs. The
8483 function takes N named arguments, the types of which are provided in
8487 build_function_type_array_1 (bool vaargs
, tree return_type
, int n
,
8491 tree t
= vaargs
? NULL_TREE
: void_list_node
;
8493 for (i
= n
- 1; i
>= 0; i
--)
8494 t
= tree_cons (NULL_TREE
, arg_types
[i
], t
);
8496 return build_function_type (return_type
, t
);
8499 /* Build a function type. RETURN_TYPE is the type returned by the
8500 function. The function takes N named arguments, the types of which
8501 are provided in ARG_TYPES. */
8504 build_function_type_array (tree return_type
, int n
, tree
*arg_types
)
8506 return build_function_type_array_1 (false, return_type
, n
, arg_types
);
8509 /* Build a variable argument function type. RETURN_TYPE is the type
8510 returned by the function. The function takes N named arguments, the
8511 types of which are provided in ARG_TYPES. */
8514 build_varargs_function_type_array (tree return_type
, int n
, tree
*arg_types
)
8516 return build_function_type_array_1 (true, return_type
, n
, arg_types
);
8519 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
8520 and ARGTYPES (a TREE_LIST) are the return type and arguments types
8521 for the method. An implicit additional parameter (of type
8522 pointer-to-BASETYPE) is added to the ARGTYPES. */
8525 build_method_type_directly (tree basetype
,
8531 inchash::hash hstate
;
8532 bool any_structural_p
, any_noncanonical_p
;
8533 tree canon_argtypes
;
8535 /* Make a node of the sort we want. */
8536 t
= make_node (METHOD_TYPE
);
8538 TYPE_METHOD_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
8539 TREE_TYPE (t
) = rettype
;
8540 ptype
= build_pointer_type (basetype
);
8542 /* The actual arglist for this function includes a "hidden" argument
8543 which is "this". Put it into the list of argument types. */
8544 argtypes
= tree_cons (NULL_TREE
, ptype
, argtypes
);
8545 TYPE_ARG_TYPES (t
) = argtypes
;
8547 /* If we already have such a type, use the old one. */
8548 hstate
.add_object (TYPE_HASH (basetype
));
8549 hstate
.add_object (TYPE_HASH (rettype
));
8550 type_hash_list (argtypes
, hstate
);
8551 t
= type_hash_canon (hstate
.end (), t
);
8553 /* Set up the canonical type. */
8555 = (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
8556 || TYPE_STRUCTURAL_EQUALITY_P (rettype
));
8558 = (TYPE_CANONICAL (basetype
) != basetype
8559 || TYPE_CANONICAL (rettype
) != rettype
);
8560 canon_argtypes
= maybe_canonicalize_argtypes (TREE_CHAIN (argtypes
),
8562 &any_noncanonical_p
);
8563 if (any_structural_p
)
8564 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8565 else if (any_noncanonical_p
)
8567 = build_method_type_directly (TYPE_CANONICAL (basetype
),
8568 TYPE_CANONICAL (rettype
),
8570 if (!COMPLETE_TYPE_P (t
))
8576 /* Construct, lay out and return the type of methods belonging to class
8577 BASETYPE and whose arguments and values are described by TYPE.
8578 If that type exists already, reuse it.
8579 TYPE must be a FUNCTION_TYPE node. */
8582 build_method_type (tree basetype
, tree type
)
8584 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
8586 return build_method_type_directly (basetype
,
8588 TYPE_ARG_TYPES (type
));
8591 /* Construct, lay out and return the type of offsets to a value
8592 of type TYPE, within an object of type BASETYPE.
8593 If a suitable offset type exists already, reuse it. */
8596 build_offset_type (tree basetype
, tree type
)
8599 inchash::hash hstate
;
8601 /* Make a node of the sort we want. */
8602 t
= make_node (OFFSET_TYPE
);
8604 TYPE_OFFSET_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
8605 TREE_TYPE (t
) = type
;
8607 /* If we already have such a type, use the old one. */
8608 hstate
.add_object (TYPE_HASH (basetype
));
8609 hstate
.add_object (TYPE_HASH (type
));
8610 t
= type_hash_canon (hstate
.end (), t
);
8612 if (!COMPLETE_TYPE_P (t
))
8615 if (TYPE_CANONICAL (t
) == t
)
8617 if (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
8618 || TYPE_STRUCTURAL_EQUALITY_P (type
))
8619 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8620 else if (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)) != basetype
8621 || TYPE_CANONICAL (type
) != type
)
8623 = build_offset_type (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)),
8624 TYPE_CANONICAL (type
));
8630 /* Create a complex type whose components are COMPONENT_TYPE. */
8633 build_complex_type (tree component_type
)
8636 inchash::hash hstate
;
8638 gcc_assert (INTEGRAL_TYPE_P (component_type
)
8639 || SCALAR_FLOAT_TYPE_P (component_type
)
8640 || FIXED_POINT_TYPE_P (component_type
));
8642 /* Make a node of the sort we want. */
8643 t
= make_node (COMPLEX_TYPE
);
8645 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (component_type
);
8647 /* If we already have such a type, use the old one. */
8648 hstate
.add_object (TYPE_HASH (component_type
));
8649 t
= type_hash_canon (hstate
.end (), t
);
8651 if (!COMPLETE_TYPE_P (t
))
8654 if (TYPE_CANONICAL (t
) == t
)
8656 if (TYPE_STRUCTURAL_EQUALITY_P (component_type
))
8657 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8658 else if (TYPE_CANONICAL (component_type
) != component_type
)
8660 = build_complex_type (TYPE_CANONICAL (component_type
));
8663 /* We need to create a name, since complex is a fundamental type. */
8664 if (! TYPE_NAME (t
))
8667 if (component_type
== char_type_node
)
8668 name
= "complex char";
8669 else if (component_type
== signed_char_type_node
)
8670 name
= "complex signed char";
8671 else if (component_type
== unsigned_char_type_node
)
8672 name
= "complex unsigned char";
8673 else if (component_type
== short_integer_type_node
)
8674 name
= "complex short int";
8675 else if (component_type
== short_unsigned_type_node
)
8676 name
= "complex short unsigned int";
8677 else if (component_type
== integer_type_node
)
8678 name
= "complex int";
8679 else if (component_type
== unsigned_type_node
)
8680 name
= "complex unsigned int";
8681 else if (component_type
== long_integer_type_node
)
8682 name
= "complex long int";
8683 else if (component_type
== long_unsigned_type_node
)
8684 name
= "complex long unsigned int";
8685 else if (component_type
== long_long_integer_type_node
)
8686 name
= "complex long long int";
8687 else if (component_type
== long_long_unsigned_type_node
)
8688 name
= "complex long long unsigned int";
8693 TYPE_NAME (t
) = build_decl (UNKNOWN_LOCATION
, TYPE_DECL
,
8694 get_identifier (name
), t
);
8697 return build_qualified_type (t
, TYPE_QUALS (component_type
));
8700 /* If TYPE is a real or complex floating-point type and the target
8701 does not directly support arithmetic on TYPE then return the wider
8702 type to be used for arithmetic on TYPE. Otherwise, return
8706 excess_precision_type (tree type
)
8708 if (flag_excess_precision
!= EXCESS_PRECISION_FAST
)
8710 int flt_eval_method
= TARGET_FLT_EVAL_METHOD
;
8711 switch (TREE_CODE (type
))
8714 switch (flt_eval_method
)
8717 if (TYPE_MODE (type
) == TYPE_MODE (float_type_node
))
8718 return double_type_node
;
8721 if (TYPE_MODE (type
) == TYPE_MODE (float_type_node
)
8722 || TYPE_MODE (type
) == TYPE_MODE (double_type_node
))
8723 return long_double_type_node
;
8730 if (TREE_CODE (TREE_TYPE (type
)) != REAL_TYPE
)
8732 switch (flt_eval_method
)
8735 if (TYPE_MODE (TREE_TYPE (type
)) == TYPE_MODE (float_type_node
))
8736 return complex_double_type_node
;
8739 if (TYPE_MODE (TREE_TYPE (type
)) == TYPE_MODE (float_type_node
)
8740 || (TYPE_MODE (TREE_TYPE (type
))
8741 == TYPE_MODE (double_type_node
)))
8742 return complex_long_double_type_node
;
8755 /* Return OP, stripped of any conversions to wider types as much as is safe.
8756 Converting the value back to OP's type makes a value equivalent to OP.
8758 If FOR_TYPE is nonzero, we return a value which, if converted to
8759 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
8761 OP must have integer, real or enumeral type. Pointers are not allowed!
8763 There are some cases where the obvious value we could return
8764 would regenerate to OP if converted to OP's type,
8765 but would not extend like OP to wider types.
8766 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
8767 For example, if OP is (unsigned short)(signed char)-1,
8768 we avoid returning (signed char)-1 if FOR_TYPE is int,
8769 even though extending that to an unsigned short would regenerate OP,
8770 since the result of extending (signed char)-1 to (int)
8771 is different from (int) OP. */
8774 get_unwidened (tree op
, tree for_type
)
8776 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
8777 tree type
= TREE_TYPE (op
);
8779 = TYPE_PRECISION (for_type
!= 0 ? for_type
: type
);
8781 = (for_type
!= 0 && for_type
!= type
8782 && final_prec
> TYPE_PRECISION (type
)
8783 && TYPE_UNSIGNED (type
));
8786 while (CONVERT_EXPR_P (op
))
8790 /* TYPE_PRECISION on vector types has different meaning
8791 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
8792 so avoid them here. */
8793 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op
, 0))) == VECTOR_TYPE
)
8796 bitschange
= TYPE_PRECISION (TREE_TYPE (op
))
8797 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0)));
8799 /* Truncations are many-one so cannot be removed.
8800 Unless we are later going to truncate down even farther. */
8802 && final_prec
> TYPE_PRECISION (TREE_TYPE (op
)))
8805 /* See what's inside this conversion. If we decide to strip it,
8807 op
= TREE_OPERAND (op
, 0);
8809 /* If we have not stripped any zero-extensions (uns is 0),
8810 we can strip any kind of extension.
8811 If we have previously stripped a zero-extension,
8812 only zero-extensions can safely be stripped.
8813 Any extension can be stripped if the bits it would produce
8814 are all going to be discarded later by truncating to FOR_TYPE. */
8818 if (! uns
|| final_prec
<= TYPE_PRECISION (TREE_TYPE (op
)))
8820 /* TYPE_UNSIGNED says whether this is a zero-extension.
8821 Let's avoid computing it if it does not affect WIN
8822 and if UNS will not be needed again. */
8824 || CONVERT_EXPR_P (op
))
8825 && TYPE_UNSIGNED (TREE_TYPE (op
)))
8833 /* If we finally reach a constant see if it fits in for_type and
8834 in that case convert it. */
8836 && TREE_CODE (win
) == INTEGER_CST
8837 && TREE_TYPE (win
) != for_type
8838 && int_fits_type_p (win
, for_type
))
8839 win
= fold_convert (for_type
, win
);
8844 /* Return OP or a simpler expression for a narrower value
8845 which can be sign-extended or zero-extended to give back OP.
8846 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
8847 or 0 if the value should be sign-extended. */
8850 get_narrower (tree op
, int *unsignedp_ptr
)
8855 bool integral_p
= INTEGRAL_TYPE_P (TREE_TYPE (op
));
8857 while (TREE_CODE (op
) == NOP_EXPR
)
8860 = (TYPE_PRECISION (TREE_TYPE (op
))
8861 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0))));
8863 /* Truncations are many-one so cannot be removed. */
8867 /* See what's inside this conversion. If we decide to strip it,
8872 op
= TREE_OPERAND (op
, 0);
8873 /* An extension: the outermost one can be stripped,
8874 but remember whether it is zero or sign extension. */
8876 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
8877 /* Otherwise, if a sign extension has been stripped,
8878 only sign extensions can now be stripped;
8879 if a zero extension has been stripped, only zero-extensions. */
8880 else if (uns
!= TYPE_UNSIGNED (TREE_TYPE (op
)))
8884 else /* bitschange == 0 */
8886 /* A change in nominal type can always be stripped, but we must
8887 preserve the unsignedness. */
8889 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
8891 op
= TREE_OPERAND (op
, 0);
8892 /* Keep trying to narrow, but don't assign op to win if it
8893 would turn an integral type into something else. */
8894 if (INTEGRAL_TYPE_P (TREE_TYPE (op
)) != integral_p
)
8901 if (TREE_CODE (op
) == COMPONENT_REF
8902 /* Since type_for_size always gives an integer type. */
8903 && TREE_CODE (TREE_TYPE (op
)) != REAL_TYPE
8904 && TREE_CODE (TREE_TYPE (op
)) != FIXED_POINT_TYPE
8905 /* Ensure field is laid out already. */
8906 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0
8907 && tree_fits_uhwi_p (DECL_SIZE (TREE_OPERAND (op
, 1))))
8909 unsigned HOST_WIDE_INT innerprec
8910 = tree_to_uhwi (DECL_SIZE (TREE_OPERAND (op
, 1)));
8911 int unsignedp
= (DECL_UNSIGNED (TREE_OPERAND (op
, 1))
8912 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op
, 1))));
8913 tree type
= lang_hooks
.types
.type_for_size (innerprec
, unsignedp
);
8915 /* We can get this structure field in a narrower type that fits it,
8916 but the resulting extension to its nominal type (a fullword type)
8917 must satisfy the same conditions as for other extensions.
8919 Do this only for fields that are aligned (not bit-fields),
8920 because when bit-field insns will be used there is no
8921 advantage in doing this. */
8923 if (innerprec
< TYPE_PRECISION (TREE_TYPE (op
))
8924 && ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1))
8925 && (first
|| uns
== DECL_UNSIGNED (TREE_OPERAND (op
, 1)))
8929 uns
= DECL_UNSIGNED (TREE_OPERAND (op
, 1));
8930 win
= fold_convert (type
, op
);
8934 *unsignedp_ptr
= uns
;
8938 /* Returns true if integer constant C has a value that is permissible
8939 for type TYPE (an INTEGER_TYPE). */
8942 int_fits_type_p (const_tree c
, const_tree type
)
8944 tree type_low_bound
, type_high_bound
;
8945 bool ok_for_low_bound
, ok_for_high_bound
;
8946 signop sgn_c
= TYPE_SIGN (TREE_TYPE (c
));
8949 type_low_bound
= TYPE_MIN_VALUE (type
);
8950 type_high_bound
= TYPE_MAX_VALUE (type
);
8952 /* If at least one bound of the type is a constant integer, we can check
8953 ourselves and maybe make a decision. If no such decision is possible, but
8954 this type is a subtype, try checking against that. Otherwise, use
8955 fits_to_tree_p, which checks against the precision.
8957 Compute the status for each possibly constant bound, and return if we see
8958 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
8959 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
8960 for "constant known to fit". */
8962 /* Check if c >= type_low_bound. */
8963 if (type_low_bound
&& TREE_CODE (type_low_bound
) == INTEGER_CST
)
8965 if (tree_int_cst_lt (c
, type_low_bound
))
8967 ok_for_low_bound
= true;
8970 ok_for_low_bound
= false;
8972 /* Check if c <= type_high_bound. */
8973 if (type_high_bound
&& TREE_CODE (type_high_bound
) == INTEGER_CST
)
8975 if (tree_int_cst_lt (type_high_bound
, c
))
8977 ok_for_high_bound
= true;
8980 ok_for_high_bound
= false;
8982 /* If the constant fits both bounds, the result is known. */
8983 if (ok_for_low_bound
&& ok_for_high_bound
)
8986 /* Perform some generic filtering which may allow making a decision
8987 even if the bounds are not constant. First, negative integers
8988 never fit in unsigned types, */
8989 if (TYPE_UNSIGNED (type
) && sgn_c
== SIGNED
&& wi::neg_p (c
))
8992 /* Second, narrower types always fit in wider ones. */
8993 if (TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (c
)))
8996 /* Third, unsigned integers with top bit set never fit signed types. */
8997 if (!TYPE_UNSIGNED (type
) && sgn_c
== UNSIGNED
)
8999 int prec
= GET_MODE_PRECISION (TYPE_MODE (TREE_TYPE (c
))) - 1;
9000 if (prec
< TYPE_PRECISION (TREE_TYPE (c
)))
9002 /* When a tree_cst is converted to a wide-int, the precision
9003 is taken from the type. However, if the precision of the
9004 mode underneath the type is smaller than that, it is
9005 possible that the value will not fit. The test below
9006 fails if any bit is set between the sign bit of the
9007 underlying mode and the top bit of the type. */
9008 if (wi::ne_p (wi::zext (c
, prec
- 1), c
))
9011 else if (wi::neg_p (c
))
9015 /* If we haven't been able to decide at this point, there nothing more we
9016 can check ourselves here. Look at the base type if we have one and it
9017 has the same precision. */
9018 if (TREE_CODE (type
) == INTEGER_TYPE
9019 && TREE_TYPE (type
) != 0
9020 && TYPE_PRECISION (type
) == TYPE_PRECISION (TREE_TYPE (type
)))
9022 type
= TREE_TYPE (type
);
9026 /* Or to fits_to_tree_p, if nothing else. */
9027 return wi::fits_to_tree_p (c
, type
);
9030 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
9031 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
9032 represented (assuming two's-complement arithmetic) within the bit
9033 precision of the type are returned instead. */
9036 get_type_static_bounds (const_tree type
, mpz_t min
, mpz_t max
)
9038 if (!POINTER_TYPE_P (type
) && TYPE_MIN_VALUE (type
)
9039 && TREE_CODE (TYPE_MIN_VALUE (type
)) == INTEGER_CST
)
9040 wi::to_mpz (TYPE_MIN_VALUE (type
), min
, TYPE_SIGN (type
));
9043 if (TYPE_UNSIGNED (type
))
9044 mpz_set_ui (min
, 0);
9047 wide_int mn
= wi::min_value (TYPE_PRECISION (type
), SIGNED
);
9048 wi::to_mpz (mn
, min
, SIGNED
);
9052 if (!POINTER_TYPE_P (type
) && TYPE_MAX_VALUE (type
)
9053 && TREE_CODE (TYPE_MAX_VALUE (type
)) == INTEGER_CST
)
9054 wi::to_mpz (TYPE_MAX_VALUE (type
), max
, TYPE_SIGN (type
));
9057 wide_int mn
= wi::max_value (TYPE_PRECISION (type
), TYPE_SIGN (type
));
9058 wi::to_mpz (mn
, max
, TYPE_SIGN (type
));
9062 /* Return true if VAR is an automatic variable defined in function FN. */
9065 auto_var_in_fn_p (const_tree var
, const_tree fn
)
9067 return (DECL_P (var
) && DECL_CONTEXT (var
) == fn
9068 && ((((TREE_CODE (var
) == VAR_DECL
&& ! DECL_EXTERNAL (var
))
9069 || TREE_CODE (var
) == PARM_DECL
)
9070 && ! TREE_STATIC (var
))
9071 || TREE_CODE (var
) == LABEL_DECL
9072 || TREE_CODE (var
) == RESULT_DECL
));
9075 /* Subprogram of following function. Called by walk_tree.
9077 Return *TP if it is an automatic variable or parameter of the
9078 function passed in as DATA. */
9081 find_var_from_fn (tree
*tp
, int *walk_subtrees
, void *data
)
9083 tree fn
= (tree
) data
;
9088 else if (DECL_P (*tp
)
9089 && auto_var_in_fn_p (*tp
, fn
))
9095 /* Returns true if T is, contains, or refers to a type with variable
9096 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
9097 arguments, but not the return type. If FN is nonzero, only return
9098 true if a modifier of the type or position of FN is a variable or
9099 parameter inside FN.
9101 This concept is more general than that of C99 'variably modified types':
9102 in C99, a struct type is never variably modified because a VLA may not
9103 appear as a structure member. However, in GNU C code like:
9105 struct S { int i[f()]; };
9107 is valid, and other languages may define similar constructs. */
9110 variably_modified_type_p (tree type
, tree fn
)
9114 /* Test if T is either variable (if FN is zero) or an expression containing
9115 a variable in FN. If TYPE isn't gimplified, return true also if
9116 gimplify_one_sizepos would gimplify the expression into a local
9118 #define RETURN_TRUE_IF_VAR(T) \
9119 do { tree _t = (T); \
9120 if (_t != NULL_TREE \
9121 && _t != error_mark_node \
9122 && TREE_CODE (_t) != INTEGER_CST \
9123 && TREE_CODE (_t) != PLACEHOLDER_EXPR \
9125 || (!TYPE_SIZES_GIMPLIFIED (type) \
9126 && !is_gimple_sizepos (_t)) \
9127 || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
9128 return true; } while (0)
9130 if (type
== error_mark_node
)
9133 /* If TYPE itself has variable size, it is variably modified. */
9134 RETURN_TRUE_IF_VAR (TYPE_SIZE (type
));
9135 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type
));
9137 switch (TREE_CODE (type
))
9140 case REFERENCE_TYPE
:
9142 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
9148 /* If TYPE is a function type, it is variably modified if the
9149 return type is variably modified. */
9150 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
9156 case FIXED_POINT_TYPE
:
9159 /* Scalar types are variably modified if their end points
9161 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type
));
9162 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type
));
9167 case QUAL_UNION_TYPE
:
9168 /* We can't see if any of the fields are variably-modified by the
9169 definition we normally use, since that would produce infinite
9170 recursion via pointers. */
9171 /* This is variably modified if some field's type is. */
9172 for (t
= TYPE_FIELDS (type
); t
; t
= DECL_CHAIN (t
))
9173 if (TREE_CODE (t
) == FIELD_DECL
)
9175 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t
));
9176 RETURN_TRUE_IF_VAR (DECL_SIZE (t
));
9177 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t
));
9179 if (TREE_CODE (type
) == QUAL_UNION_TYPE
)
9180 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t
));
9185 /* Do not call ourselves to avoid infinite recursion. This is
9186 variably modified if the element type is. */
9187 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type
)));
9188 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type
)));
9195 /* The current language may have other cases to check, but in general,
9196 all other types are not variably modified. */
9197 return lang_hooks
.tree_inlining
.var_mod_type_p (type
, fn
);
9199 #undef RETURN_TRUE_IF_VAR
9202 /* Given a DECL or TYPE, return the scope in which it was declared, or
9203 NULL_TREE if there is no containing scope. */
9206 get_containing_scope (const_tree t
)
9208 return (TYPE_P (t
) ? TYPE_CONTEXT (t
) : DECL_CONTEXT (t
));
9211 /* Return the innermost context enclosing DECL that is
9212 a FUNCTION_DECL, or zero if none. */
9215 decl_function_context (const_tree decl
)
9219 if (TREE_CODE (decl
) == ERROR_MARK
)
9222 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
9223 where we look up the function at runtime. Such functions always take
9224 a first argument of type 'pointer to real context'.
9226 C++ should really be fixed to use DECL_CONTEXT for the real context,
9227 and use something else for the "virtual context". */
9228 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VINDEX (decl
))
9231 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl
)))));
9233 context
= DECL_CONTEXT (decl
);
9235 while (context
&& TREE_CODE (context
) != FUNCTION_DECL
)
9237 if (TREE_CODE (context
) == BLOCK
)
9238 context
= BLOCK_SUPERCONTEXT (context
);
9240 context
= get_containing_scope (context
);
9246 /* Return the innermost context enclosing DECL that is
9247 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
9248 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
9251 decl_type_context (const_tree decl
)
9253 tree context
= DECL_CONTEXT (decl
);
9256 switch (TREE_CODE (context
))
9258 case NAMESPACE_DECL
:
9259 case TRANSLATION_UNIT_DECL
:
9264 case QUAL_UNION_TYPE
:
9269 context
= DECL_CONTEXT (context
);
9273 context
= BLOCK_SUPERCONTEXT (context
);
9283 /* CALL is a CALL_EXPR. Return the declaration for the function
9284 called, or NULL_TREE if the called function cannot be
9288 get_callee_fndecl (const_tree call
)
9292 if (call
== error_mark_node
)
9293 return error_mark_node
;
9295 /* It's invalid to call this function with anything but a
9297 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
9299 /* The first operand to the CALL is the address of the function
9301 addr
= CALL_EXPR_FN (call
);
9303 /* If there is no function, return early. */
9304 if (addr
== NULL_TREE
)
9309 /* If this is a readonly function pointer, extract its initial value. */
9310 if (DECL_P (addr
) && TREE_CODE (addr
) != FUNCTION_DECL
9311 && TREE_READONLY (addr
) && ! TREE_THIS_VOLATILE (addr
)
9312 && DECL_INITIAL (addr
))
9313 addr
= DECL_INITIAL (addr
);
9315 /* If the address is just `&f' for some function `f', then we know
9316 that `f' is being called. */
9317 if (TREE_CODE (addr
) == ADDR_EXPR
9318 && TREE_CODE (TREE_OPERAND (addr
, 0)) == FUNCTION_DECL
)
9319 return TREE_OPERAND (addr
, 0);
9321 /* We couldn't figure out what was being called. */
9325 #define TREE_MEM_USAGE_SPACES 40
9327 /* Print debugging information about tree nodes generated during the compile,
9328 and any language-specific information. */
9331 dump_tree_statistics (void)
9333 if (GATHER_STATISTICS
)
9336 int total_nodes
, total_bytes
;
9337 fprintf (stderr
, "\nKind Nodes Bytes\n");
9338 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9339 total_nodes
= total_bytes
= 0;
9340 for (i
= 0; i
< (int) all_kinds
; i
++)
9342 fprintf (stderr
, "%-20s %7d %10d\n", tree_node_kind_names
[i
],
9343 tree_node_counts
[i
], tree_node_sizes
[i
]);
9344 total_nodes
+= tree_node_counts
[i
];
9345 total_bytes
+= tree_node_sizes
[i
];
9347 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9348 fprintf (stderr
, "%-20s %7d %10d\n", "Total", total_nodes
, total_bytes
);
9349 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9350 fprintf (stderr
, "Code Nodes\n");
9351 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9352 for (i
= 0; i
< (int) MAX_TREE_CODES
; i
++)
9353 fprintf (stderr
, "%-32s %7d\n", get_tree_code_name ((enum tree_code
) i
),
9354 tree_code_counts
[i
]);
9355 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9356 fprintf (stderr
, "\n");
9357 ssanames_print_statistics ();
9358 fprintf (stderr
, "\n");
9359 phinodes_print_statistics ();
9360 fprintf (stderr
, "\n");
9363 fprintf (stderr
, "(No per-node statistics)\n");
9365 print_type_hash_statistics ();
9366 print_debug_expr_statistics ();
9367 print_value_expr_statistics ();
9368 lang_hooks
.print_statistics ();
9371 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
9373 /* Generate a crc32 of a byte. */
9376 crc32_unsigned_bits (unsigned chksum
, unsigned value
, unsigned bits
)
9380 for (ix
= bits
; ix
--; value
<<= 1)
9384 feedback
= (value
^ chksum
) & 0x80000000 ? 0x04c11db7 : 0;
9391 /* Generate a crc32 of a 32-bit unsigned. */
9394 crc32_unsigned (unsigned chksum
, unsigned value
)
9396 return crc32_unsigned_bits (chksum
, value
, 32);
9399 /* Generate a crc32 of a byte. */
9402 crc32_byte (unsigned chksum
, char byte
)
9404 return crc32_unsigned_bits (chksum
, (unsigned) byte
<< 24, 8);
9407 /* Generate a crc32 of a string. */
9410 crc32_string (unsigned chksum
, const char *string
)
9414 chksum
= crc32_byte (chksum
, *string
);
9420 /* P is a string that will be used in a symbol. Mask out any characters
9421 that are not valid in that context. */
9424 clean_symbol_name (char *p
)
9428 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
9431 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
9438 /* For anonymous aggregate types, we need some sort of name to
9439 hold on to. In practice, this should not appear, but it should
9440 not be harmful if it does. */
9442 anon_aggrname_p(const_tree id_node
)
9444 #ifndef NO_DOT_IN_LABEL
9445 return (IDENTIFIER_POINTER (id_node
)[0] == '.'
9446 && IDENTIFIER_POINTER (id_node
)[1] == '_');
9447 #else /* NO_DOT_IN_LABEL */
9448 #ifndef NO_DOLLAR_IN_LABEL
9449 return (IDENTIFIER_POINTER (id_node
)[0] == '$' \
9450 && IDENTIFIER_POINTER (id_node
)[1] == '_');
9451 #else /* NO_DOLLAR_IN_LABEL */
9452 #define ANON_AGGRNAME_PREFIX "__anon_"
9453 return (!strncmp (IDENTIFIER_POINTER (id_node
), ANON_AGGRNAME_PREFIX
,
9454 sizeof (ANON_AGGRNAME_PREFIX
) - 1));
9455 #endif /* NO_DOLLAR_IN_LABEL */
9456 #endif /* NO_DOT_IN_LABEL */
9459 /* Return a format for an anonymous aggregate name. */
9461 anon_aggrname_format()
9463 #ifndef NO_DOT_IN_LABEL
9465 #else /* NO_DOT_IN_LABEL */
9466 #ifndef NO_DOLLAR_IN_LABEL
9468 #else /* NO_DOLLAR_IN_LABEL */
9470 #endif /* NO_DOLLAR_IN_LABEL */
9471 #endif /* NO_DOT_IN_LABEL */
9474 /* Generate a name for a special-purpose function.
9475 The generated name may need to be unique across the whole link.
9476 Changes to this function may also require corresponding changes to
9477 xstrdup_mask_random.
9478 TYPE is some string to identify the purpose of this function to the
9479 linker or collect2; it must start with an uppercase letter,
9481 I - for constructors
9483 N - for C++ anonymous namespaces
9484 F - for DWARF unwind frame information. */
9487 get_file_function_name (const char *type
)
9493 /* If we already have a name we know to be unique, just use that. */
9494 if (first_global_object_name
)
9495 p
= q
= ASTRDUP (first_global_object_name
);
9496 /* If the target is handling the constructors/destructors, they
9497 will be local to this file and the name is only necessary for
9499 We also assign sub_I and sub_D sufixes to constructors called from
9500 the global static constructors. These are always local. */
9501 else if (((type
[0] == 'I' || type
[0] == 'D') && targetm
.have_ctors_dtors
)
9502 || (strncmp (type
, "sub_", 4) == 0
9503 && (type
[4] == 'I' || type
[4] == 'D')))
9505 const char *file
= main_input_filename
;
9507 file
= LOCATION_FILE (input_location
);
9508 /* Just use the file's basename, because the full pathname
9509 might be quite long. */
9510 p
= q
= ASTRDUP (lbasename (file
));
9514 /* Otherwise, the name must be unique across the entire link.
9515 We don't have anything that we know to be unique to this translation
9516 unit, so use what we do have and throw in some randomness. */
9518 const char *name
= weak_global_object_name
;
9519 const char *file
= main_input_filename
;
9524 file
= LOCATION_FILE (input_location
);
9526 len
= strlen (file
);
9527 q
= (char *) alloca (9 + 17 + len
+ 1);
9528 memcpy (q
, file
, len
+ 1);
9530 snprintf (q
+ len
, 9 + 17 + 1, "_%08X_" HOST_WIDE_INT_PRINT_HEX
,
9531 crc32_string (0, name
), get_random_seed (false));
9536 clean_symbol_name (q
);
9537 buf
= (char *) alloca (sizeof (FILE_FUNCTION_FORMAT
) + strlen (p
)
9540 /* Set up the name of the file-level functions we may need.
9541 Use a global object (which is already required to be unique over
9542 the program) rather than the file name (which imposes extra
9544 sprintf (buf
, FILE_FUNCTION_FORMAT
, type
, p
);
9546 return get_identifier (buf
);
9549 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
9551 /* Complain that the tree code of NODE does not match the expected 0
9552 terminated list of trailing codes. The trailing code list can be
9553 empty, for a more vague error message. FILE, LINE, and FUNCTION
9554 are of the caller. */
9557 tree_check_failed (const_tree node
, const char *file
,
9558 int line
, const char *function
, ...)
9562 unsigned length
= 0;
9563 enum tree_code code
;
9565 va_start (args
, function
);
9566 while ((code
= (enum tree_code
) va_arg (args
, int)))
9567 length
+= 4 + strlen (get_tree_code_name (code
));
9572 va_start (args
, function
);
9573 length
+= strlen ("expected ");
9574 buffer
= tmp
= (char *) alloca (length
);
9576 while ((code
= (enum tree_code
) va_arg (args
, int)))
9578 const char *prefix
= length
? " or " : "expected ";
9580 strcpy (tmp
+ length
, prefix
);
9581 length
+= strlen (prefix
);
9582 strcpy (tmp
+ length
, get_tree_code_name (code
));
9583 length
+= strlen (get_tree_code_name (code
));
9588 buffer
= "unexpected node";
9590 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9591 buffer
, get_tree_code_name (TREE_CODE (node
)),
9592 function
, trim_filename (file
), line
);
9595 /* Complain that the tree code of NODE does match the expected 0
9596 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
9600 tree_not_check_failed (const_tree node
, const char *file
,
9601 int line
, const char *function
, ...)
9605 unsigned length
= 0;
9606 enum tree_code code
;
9608 va_start (args
, function
);
9609 while ((code
= (enum tree_code
) va_arg (args
, int)))
9610 length
+= 4 + strlen (get_tree_code_name (code
));
9612 va_start (args
, function
);
9613 buffer
= (char *) alloca (length
);
9615 while ((code
= (enum tree_code
) va_arg (args
, int)))
9619 strcpy (buffer
+ length
, " or ");
9622 strcpy (buffer
+ length
, get_tree_code_name (code
));
9623 length
+= strlen (get_tree_code_name (code
));
9627 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
9628 buffer
, get_tree_code_name (TREE_CODE (node
)),
9629 function
, trim_filename (file
), line
);
9632 /* Similar to tree_check_failed, except that we check for a class of tree
9633 code, given in CL. */
9636 tree_class_check_failed (const_tree node
, const enum tree_code_class cl
,
9637 const char *file
, int line
, const char *function
)
9640 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
9641 TREE_CODE_CLASS_STRING (cl
),
9642 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
9643 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9646 /* Similar to tree_check_failed, except that instead of specifying a
9647 dozen codes, use the knowledge that they're all sequential. */
9650 tree_range_check_failed (const_tree node
, const char *file
, int line
,
9651 const char *function
, enum tree_code c1
,
9655 unsigned length
= 0;
9658 for (c
= c1
; c
<= c2
; ++c
)
9659 length
+= 4 + strlen (get_tree_code_name ((enum tree_code
) c
));
9661 length
+= strlen ("expected ");
9662 buffer
= (char *) alloca (length
);
9665 for (c
= c1
; c
<= c2
; ++c
)
9667 const char *prefix
= length
? " or " : "expected ";
9669 strcpy (buffer
+ length
, prefix
);
9670 length
+= strlen (prefix
);
9671 strcpy (buffer
+ length
, get_tree_code_name ((enum tree_code
) c
));
9672 length
+= strlen (get_tree_code_name ((enum tree_code
) c
));
9675 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9676 buffer
, get_tree_code_name (TREE_CODE (node
)),
9677 function
, trim_filename (file
), line
);
9681 /* Similar to tree_check_failed, except that we check that a tree does
9682 not have the specified code, given in CL. */
9685 tree_not_class_check_failed (const_tree node
, const enum tree_code_class cl
,
9686 const char *file
, int line
, const char *function
)
9689 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
9690 TREE_CODE_CLASS_STRING (cl
),
9691 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
9692 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9696 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
9699 omp_clause_check_failed (const_tree node
, const char *file
, int line
,
9700 const char *function
, enum omp_clause_code code
)
9702 internal_error ("tree check: expected omp_clause %s, have %s in %s, at %s:%d",
9703 omp_clause_code_name
[code
], get_tree_code_name (TREE_CODE (node
)),
9704 function
, trim_filename (file
), line
);
9708 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
9711 omp_clause_range_check_failed (const_tree node
, const char *file
, int line
,
9712 const char *function
, enum omp_clause_code c1
,
9713 enum omp_clause_code c2
)
9716 unsigned length
= 0;
9719 for (c
= c1
; c
<= c2
; ++c
)
9720 length
+= 4 + strlen (omp_clause_code_name
[c
]);
9722 length
+= strlen ("expected ");
9723 buffer
= (char *) alloca (length
);
9726 for (c
= c1
; c
<= c2
; ++c
)
9728 const char *prefix
= length
? " or " : "expected ";
9730 strcpy (buffer
+ length
, prefix
);
9731 length
+= strlen (prefix
);
9732 strcpy (buffer
+ length
, omp_clause_code_name
[c
]);
9733 length
+= strlen (omp_clause_code_name
[c
]);
9736 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9737 buffer
, omp_clause_code_name
[TREE_CODE (node
)],
9738 function
, trim_filename (file
), line
);
9742 #undef DEFTREESTRUCT
9743 #define DEFTREESTRUCT(VAL, NAME) NAME,
9745 static const char *ts_enum_names
[] = {
9746 #include "treestruct.def"
9748 #undef DEFTREESTRUCT
9750 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
9752 /* Similar to tree_class_check_failed, except that we check for
9753 whether CODE contains the tree structure identified by EN. */
9756 tree_contains_struct_check_failed (const_tree node
,
9757 const enum tree_node_structure_enum en
,
9758 const char *file
, int line
,
9759 const char *function
)
9762 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
9764 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9768 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9769 (dynamically sized) vector. */
9772 tree_int_cst_elt_check_failed (int idx
, int len
, const char *file
, int line
,
9773 const char *function
)
9776 ("tree check: accessed elt %d of tree_int_cst with %d elts in %s, at %s:%d",
9777 idx
+ 1, len
, function
, trim_filename (file
), line
);
9780 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9781 (dynamically sized) vector. */
9784 tree_vec_elt_check_failed (int idx
, int len
, const char *file
, int line
,
9785 const char *function
)
9788 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
9789 idx
+ 1, len
, function
, trim_filename (file
), line
);
9792 /* Similar to above, except that the check is for the bounds of the operand
9793 vector of an expression node EXP. */
9796 tree_operand_check_failed (int idx
, const_tree exp
, const char *file
,
9797 int line
, const char *function
)
9799 enum tree_code code
= TREE_CODE (exp
);
9801 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
9802 idx
+ 1, get_tree_code_name (code
), TREE_OPERAND_LENGTH (exp
),
9803 function
, trim_filename (file
), line
);
9806 /* Similar to above, except that the check is for the number of
9807 operands of an OMP_CLAUSE node. */
9810 omp_clause_operand_check_failed (int idx
, const_tree t
, const char *file
,
9811 int line
, const char *function
)
9814 ("tree check: accessed operand %d of omp_clause %s with %d operands "
9815 "in %s, at %s:%d", idx
+ 1, omp_clause_code_name
[OMP_CLAUSE_CODE (t
)],
9816 omp_clause_num_ops
[OMP_CLAUSE_CODE (t
)], function
,
9817 trim_filename (file
), line
);
9819 #endif /* ENABLE_TREE_CHECKING */
9821 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
9822 and mapped to the machine mode MODE. Initialize its fields and build
9823 the information necessary for debugging output. */
9826 make_vector_type (tree innertype
, int nunits
, machine_mode mode
)
9829 inchash::hash hstate
;
9831 t
= make_node (VECTOR_TYPE
);
9832 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (innertype
);
9833 SET_TYPE_VECTOR_SUBPARTS (t
, nunits
);
9834 SET_TYPE_MODE (t
, mode
);
9836 if (TYPE_STRUCTURAL_EQUALITY_P (innertype
))
9837 SET_TYPE_STRUCTURAL_EQUALITY (t
);
9838 else if ((TYPE_CANONICAL (innertype
) != innertype
9839 || mode
!= VOIDmode
)
9840 && !VECTOR_BOOLEAN_TYPE_P (t
))
9842 = make_vector_type (TYPE_CANONICAL (innertype
), nunits
, VOIDmode
);
9846 hstate
.add_wide_int (VECTOR_TYPE
);
9847 hstate
.add_wide_int (nunits
);
9848 hstate
.add_wide_int (mode
);
9849 hstate
.add_object (TYPE_HASH (TREE_TYPE (t
)));
9850 t
= type_hash_canon (hstate
.end (), t
);
9852 /* We have built a main variant, based on the main variant of the
9853 inner type. Use it to build the variant we return. */
9854 if ((TYPE_ATTRIBUTES (innertype
) || TYPE_QUALS (innertype
))
9855 && TREE_TYPE (t
) != innertype
)
9856 return build_type_attribute_qual_variant (t
,
9857 TYPE_ATTRIBUTES (innertype
),
9858 TYPE_QUALS (innertype
));
9864 make_or_reuse_type (unsigned size
, int unsignedp
)
9868 if (size
== INT_TYPE_SIZE
)
9869 return unsignedp
? unsigned_type_node
: integer_type_node
;
9870 if (size
== CHAR_TYPE_SIZE
)
9871 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
9872 if (size
== SHORT_TYPE_SIZE
)
9873 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
9874 if (size
== LONG_TYPE_SIZE
)
9875 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
9876 if (size
== LONG_LONG_TYPE_SIZE
)
9877 return (unsignedp
? long_long_unsigned_type_node
9878 : long_long_integer_type_node
);
9880 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
9881 if (size
== int_n_data
[i
].bitsize
9882 && int_n_enabled_p
[i
])
9883 return (unsignedp
? int_n_trees
[i
].unsigned_type
9884 : int_n_trees
[i
].signed_type
);
9887 return make_unsigned_type (size
);
9889 return make_signed_type (size
);
9892 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
9895 make_or_reuse_fract_type (unsigned size
, int unsignedp
, int satp
)
9899 if (size
== SHORT_FRACT_TYPE_SIZE
)
9900 return unsignedp
? sat_unsigned_short_fract_type_node
9901 : sat_short_fract_type_node
;
9902 if (size
== FRACT_TYPE_SIZE
)
9903 return unsignedp
? sat_unsigned_fract_type_node
: sat_fract_type_node
;
9904 if (size
== LONG_FRACT_TYPE_SIZE
)
9905 return unsignedp
? sat_unsigned_long_fract_type_node
9906 : sat_long_fract_type_node
;
9907 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
9908 return unsignedp
? sat_unsigned_long_long_fract_type_node
9909 : sat_long_long_fract_type_node
;
9913 if (size
== SHORT_FRACT_TYPE_SIZE
)
9914 return unsignedp
? unsigned_short_fract_type_node
9915 : short_fract_type_node
;
9916 if (size
== FRACT_TYPE_SIZE
)
9917 return unsignedp
? unsigned_fract_type_node
: fract_type_node
;
9918 if (size
== LONG_FRACT_TYPE_SIZE
)
9919 return unsignedp
? unsigned_long_fract_type_node
9920 : long_fract_type_node
;
9921 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
9922 return unsignedp
? unsigned_long_long_fract_type_node
9923 : long_long_fract_type_node
;
9926 return make_fract_type (size
, unsignedp
, satp
);
9929 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
9932 make_or_reuse_accum_type (unsigned size
, int unsignedp
, int satp
)
9936 if (size
== SHORT_ACCUM_TYPE_SIZE
)
9937 return unsignedp
? sat_unsigned_short_accum_type_node
9938 : sat_short_accum_type_node
;
9939 if (size
== ACCUM_TYPE_SIZE
)
9940 return unsignedp
? sat_unsigned_accum_type_node
: sat_accum_type_node
;
9941 if (size
== LONG_ACCUM_TYPE_SIZE
)
9942 return unsignedp
? sat_unsigned_long_accum_type_node
9943 : sat_long_accum_type_node
;
9944 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
9945 return unsignedp
? sat_unsigned_long_long_accum_type_node
9946 : sat_long_long_accum_type_node
;
9950 if (size
== SHORT_ACCUM_TYPE_SIZE
)
9951 return unsignedp
? unsigned_short_accum_type_node
9952 : short_accum_type_node
;
9953 if (size
== ACCUM_TYPE_SIZE
)
9954 return unsignedp
? unsigned_accum_type_node
: accum_type_node
;
9955 if (size
== LONG_ACCUM_TYPE_SIZE
)
9956 return unsignedp
? unsigned_long_accum_type_node
9957 : long_accum_type_node
;
9958 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
9959 return unsignedp
? unsigned_long_long_accum_type_node
9960 : long_long_accum_type_node
;
9963 return make_accum_type (size
, unsignedp
, satp
);
9967 /* Create an atomic variant node for TYPE. This routine is called
9968 during initialization of data types to create the 5 basic atomic
9969 types. The generic build_variant_type function requires these to
9970 already be set up in order to function properly, so cannot be
9971 called from there. If ALIGN is non-zero, then ensure alignment is
9972 overridden to this value. */
9975 build_atomic_base (tree type
, unsigned int align
)
9979 /* Make sure its not already registered. */
9980 if ((t
= get_qualified_type (type
, TYPE_QUAL_ATOMIC
)))
9983 t
= build_variant_type_copy (type
);
9984 set_type_quals (t
, TYPE_QUAL_ATOMIC
);
9987 TYPE_ALIGN (t
) = align
;
9992 /* Create nodes for all integer types (and error_mark_node) using the sizes
9993 of C datatypes. SIGNED_CHAR specifies whether char is signed,
9994 SHORT_DOUBLE specifies whether double should be of the same precision
9998 build_common_tree_nodes (bool signed_char
, bool short_double
)
10002 error_mark_node
= make_node (ERROR_MARK
);
10003 TREE_TYPE (error_mark_node
) = error_mark_node
;
10005 initialize_sizetypes ();
10007 /* Define both `signed char' and `unsigned char'. */
10008 signed_char_type_node
= make_signed_type (CHAR_TYPE_SIZE
);
10009 TYPE_STRING_FLAG (signed_char_type_node
) = 1;
10010 unsigned_char_type_node
= make_unsigned_type (CHAR_TYPE_SIZE
);
10011 TYPE_STRING_FLAG (unsigned_char_type_node
) = 1;
10013 /* Define `char', which is like either `signed char' or `unsigned char'
10014 but not the same as either. */
10017 ? make_signed_type (CHAR_TYPE_SIZE
)
10018 : make_unsigned_type (CHAR_TYPE_SIZE
));
10019 TYPE_STRING_FLAG (char_type_node
) = 1;
10021 short_integer_type_node
= make_signed_type (SHORT_TYPE_SIZE
);
10022 short_unsigned_type_node
= make_unsigned_type (SHORT_TYPE_SIZE
);
10023 integer_type_node
= make_signed_type (INT_TYPE_SIZE
);
10024 unsigned_type_node
= make_unsigned_type (INT_TYPE_SIZE
);
10025 long_integer_type_node
= make_signed_type (LONG_TYPE_SIZE
);
10026 long_unsigned_type_node
= make_unsigned_type (LONG_TYPE_SIZE
);
10027 long_long_integer_type_node
= make_signed_type (LONG_LONG_TYPE_SIZE
);
10028 long_long_unsigned_type_node
= make_unsigned_type (LONG_LONG_TYPE_SIZE
);
10030 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
10032 int_n_trees
[i
].signed_type
= make_signed_type (int_n_data
[i
].bitsize
);
10033 int_n_trees
[i
].unsigned_type
= make_unsigned_type (int_n_data
[i
].bitsize
);
10034 TYPE_SIZE (int_n_trees
[i
].signed_type
) = bitsize_int (int_n_data
[i
].bitsize
);
10035 TYPE_SIZE (int_n_trees
[i
].unsigned_type
) = bitsize_int (int_n_data
[i
].bitsize
);
10037 if (int_n_data
[i
].bitsize
> LONG_LONG_TYPE_SIZE
10038 && int_n_enabled_p
[i
])
10040 integer_types
[itk_intN_0
+ i
* 2] = int_n_trees
[i
].signed_type
;
10041 integer_types
[itk_unsigned_intN_0
+ i
* 2] = int_n_trees
[i
].unsigned_type
;
10045 /* Define a boolean type. This type only represents boolean values but
10046 may be larger than char depending on the value of BOOL_TYPE_SIZE. */
10047 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
10048 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
10049 TYPE_PRECISION (boolean_type_node
) = 1;
10050 TYPE_MAX_VALUE (boolean_type_node
) = build_int_cst (boolean_type_node
, 1);
10052 /* Define what type to use for size_t. */
10053 if (strcmp (SIZE_TYPE
, "unsigned int") == 0)
10054 size_type_node
= unsigned_type_node
;
10055 else if (strcmp (SIZE_TYPE
, "long unsigned int") == 0)
10056 size_type_node
= long_unsigned_type_node
;
10057 else if (strcmp (SIZE_TYPE
, "long long unsigned int") == 0)
10058 size_type_node
= long_long_unsigned_type_node
;
10059 else if (strcmp (SIZE_TYPE
, "short unsigned int") == 0)
10060 size_type_node
= short_unsigned_type_node
;
10065 size_type_node
= NULL_TREE
;
10066 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
10067 if (int_n_enabled_p
[i
])
10070 sprintf (name
, "__int%d unsigned", int_n_data
[i
].bitsize
);
10072 if (strcmp (name
, SIZE_TYPE
) == 0)
10074 size_type_node
= int_n_trees
[i
].unsigned_type
;
10077 if (size_type_node
== NULL_TREE
)
10078 gcc_unreachable ();
10081 /* Fill in the rest of the sized types. Reuse existing type nodes
10083 intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 0);
10084 intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 0);
10085 intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 0);
10086 intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 0);
10087 intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 0);
10089 unsigned_intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 1);
10090 unsigned_intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 1);
10091 unsigned_intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 1);
10092 unsigned_intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 1);
10093 unsigned_intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 1);
10095 /* Don't call build_qualified type for atomics. That routine does
10096 special processing for atomics, and until they are initialized
10097 it's better not to make that call.
10099 Check to see if there is a target override for atomic types. */
10101 atomicQI_type_node
= build_atomic_base (unsigned_intQI_type_node
,
10102 targetm
.atomic_align_for_mode (QImode
));
10103 atomicHI_type_node
= build_atomic_base (unsigned_intHI_type_node
,
10104 targetm
.atomic_align_for_mode (HImode
));
10105 atomicSI_type_node
= build_atomic_base (unsigned_intSI_type_node
,
10106 targetm
.atomic_align_for_mode (SImode
));
10107 atomicDI_type_node
= build_atomic_base (unsigned_intDI_type_node
,
10108 targetm
.atomic_align_for_mode (DImode
));
10109 atomicTI_type_node
= build_atomic_base (unsigned_intTI_type_node
,
10110 targetm
.atomic_align_for_mode (TImode
));
10112 access_public_node
= get_identifier ("public");
10113 access_protected_node
= get_identifier ("protected");
10114 access_private_node
= get_identifier ("private");
10116 /* Define these next since types below may used them. */
10117 integer_zero_node
= build_int_cst (integer_type_node
, 0);
10118 integer_one_node
= build_int_cst (integer_type_node
, 1);
10119 integer_three_node
= build_int_cst (integer_type_node
, 3);
10120 integer_minus_one_node
= build_int_cst (integer_type_node
, -1);
10122 size_zero_node
= size_int (0);
10123 size_one_node
= size_int (1);
10124 bitsize_zero_node
= bitsize_int (0);
10125 bitsize_one_node
= bitsize_int (1);
10126 bitsize_unit_node
= bitsize_int (BITS_PER_UNIT
);
10128 boolean_false_node
= TYPE_MIN_VALUE (boolean_type_node
);
10129 boolean_true_node
= TYPE_MAX_VALUE (boolean_type_node
);
10131 void_type_node
= make_node (VOID_TYPE
);
10132 layout_type (void_type_node
);
10134 pointer_bounds_type_node
= targetm
.chkp_bound_type ();
10136 /* We are not going to have real types in C with less than byte alignment,
10137 so we might as well not have any types that claim to have it. */
10138 TYPE_ALIGN (void_type_node
) = BITS_PER_UNIT
;
10139 TYPE_USER_ALIGN (void_type_node
) = 0;
10141 void_node
= make_node (VOID_CST
);
10142 TREE_TYPE (void_node
) = void_type_node
;
10144 null_pointer_node
= build_int_cst (build_pointer_type (void_type_node
), 0);
10145 layout_type (TREE_TYPE (null_pointer_node
));
10147 ptr_type_node
= build_pointer_type (void_type_node
);
10148 const_ptr_type_node
10149 = build_pointer_type (build_type_variant (void_type_node
, 1, 0));
10150 fileptr_type_node
= ptr_type_node
;
10152 pointer_sized_int_node
= build_nonstandard_integer_type (POINTER_SIZE
, 1);
10154 float_type_node
= make_node (REAL_TYPE
);
10155 TYPE_PRECISION (float_type_node
) = FLOAT_TYPE_SIZE
;
10156 layout_type (float_type_node
);
10158 double_type_node
= make_node (REAL_TYPE
);
10160 TYPE_PRECISION (double_type_node
) = FLOAT_TYPE_SIZE
;
10162 TYPE_PRECISION (double_type_node
) = DOUBLE_TYPE_SIZE
;
10163 layout_type (double_type_node
);
10165 long_double_type_node
= make_node (REAL_TYPE
);
10166 TYPE_PRECISION (long_double_type_node
) = LONG_DOUBLE_TYPE_SIZE
;
10167 layout_type (long_double_type_node
);
10169 float_ptr_type_node
= build_pointer_type (float_type_node
);
10170 double_ptr_type_node
= build_pointer_type (double_type_node
);
10171 long_double_ptr_type_node
= build_pointer_type (long_double_type_node
);
10172 integer_ptr_type_node
= build_pointer_type (integer_type_node
);
10174 /* Fixed size integer types. */
10175 uint16_type_node
= make_or_reuse_type (16, 1);
10176 uint32_type_node
= make_or_reuse_type (32, 1);
10177 uint64_type_node
= make_or_reuse_type (64, 1);
10179 /* Decimal float types. */
10180 dfloat32_type_node
= make_node (REAL_TYPE
);
10181 TYPE_PRECISION (dfloat32_type_node
) = DECIMAL32_TYPE_SIZE
;
10182 layout_type (dfloat32_type_node
);
10183 SET_TYPE_MODE (dfloat32_type_node
, SDmode
);
10184 dfloat32_ptr_type_node
= build_pointer_type (dfloat32_type_node
);
10186 dfloat64_type_node
= make_node (REAL_TYPE
);
10187 TYPE_PRECISION (dfloat64_type_node
) = DECIMAL64_TYPE_SIZE
;
10188 layout_type (dfloat64_type_node
);
10189 SET_TYPE_MODE (dfloat64_type_node
, DDmode
);
10190 dfloat64_ptr_type_node
= build_pointer_type (dfloat64_type_node
);
10192 dfloat128_type_node
= make_node (REAL_TYPE
);
10193 TYPE_PRECISION (dfloat128_type_node
) = DECIMAL128_TYPE_SIZE
;
10194 layout_type (dfloat128_type_node
);
10195 SET_TYPE_MODE (dfloat128_type_node
, TDmode
);
10196 dfloat128_ptr_type_node
= build_pointer_type (dfloat128_type_node
);
10198 complex_integer_type_node
= build_complex_type (integer_type_node
);
10199 complex_float_type_node
= build_complex_type (float_type_node
);
10200 complex_double_type_node
= build_complex_type (double_type_node
);
10201 complex_long_double_type_node
= build_complex_type (long_double_type_node
);
10203 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
10204 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
10205 sat_ ## KIND ## _type_node = \
10206 make_sat_signed_ ## KIND ## _type (SIZE); \
10207 sat_unsigned_ ## KIND ## _type_node = \
10208 make_sat_unsigned_ ## KIND ## _type (SIZE); \
10209 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
10210 unsigned_ ## KIND ## _type_node = \
10211 make_unsigned_ ## KIND ## _type (SIZE);
10213 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
10214 sat_ ## WIDTH ## KIND ## _type_node = \
10215 make_sat_signed_ ## KIND ## _type (SIZE); \
10216 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
10217 make_sat_unsigned_ ## KIND ## _type (SIZE); \
10218 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
10219 unsigned_ ## WIDTH ## KIND ## _type_node = \
10220 make_unsigned_ ## KIND ## _type (SIZE);
10222 /* Make fixed-point type nodes based on four different widths. */
10223 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
10224 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
10225 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
10226 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
10227 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
10229 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
10230 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
10231 NAME ## _type_node = \
10232 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
10233 u ## NAME ## _type_node = \
10234 make_or_reuse_unsigned_ ## KIND ## _type \
10235 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
10236 sat_ ## NAME ## _type_node = \
10237 make_or_reuse_sat_signed_ ## KIND ## _type \
10238 (GET_MODE_BITSIZE (MODE ## mode)); \
10239 sat_u ## NAME ## _type_node = \
10240 make_or_reuse_sat_unsigned_ ## KIND ## _type \
10241 (GET_MODE_BITSIZE (U ## MODE ## mode));
10243 /* Fixed-point type and mode nodes. */
10244 MAKE_FIXED_TYPE_NODE_FAMILY (fract
, FRACT
)
10245 MAKE_FIXED_TYPE_NODE_FAMILY (accum
, ACCUM
)
10246 MAKE_FIXED_MODE_NODE (fract
, qq
, QQ
)
10247 MAKE_FIXED_MODE_NODE (fract
, hq
, HQ
)
10248 MAKE_FIXED_MODE_NODE (fract
, sq
, SQ
)
10249 MAKE_FIXED_MODE_NODE (fract
, dq
, DQ
)
10250 MAKE_FIXED_MODE_NODE (fract
, tq
, TQ
)
10251 MAKE_FIXED_MODE_NODE (accum
, ha
, HA
)
10252 MAKE_FIXED_MODE_NODE (accum
, sa
, SA
)
10253 MAKE_FIXED_MODE_NODE (accum
, da
, DA
)
10254 MAKE_FIXED_MODE_NODE (accum
, ta
, TA
)
10257 tree t
= targetm
.build_builtin_va_list ();
10259 /* Many back-ends define record types without setting TYPE_NAME.
10260 If we copied the record type here, we'd keep the original
10261 record type without a name. This breaks name mangling. So,
10262 don't copy record types and let c_common_nodes_and_builtins()
10263 declare the type to be __builtin_va_list. */
10264 if (TREE_CODE (t
) != RECORD_TYPE
)
10265 t
= build_variant_type_copy (t
);
10267 va_list_type_node
= t
;
10271 /* Modify DECL for given flags.
10272 TM_PURE attribute is set only on types, so the function will modify
10273 DECL's type when ECF_TM_PURE is used. */
10276 set_call_expr_flags (tree decl
, int flags
)
10278 if (flags
& ECF_NOTHROW
)
10279 TREE_NOTHROW (decl
) = 1;
10280 if (flags
& ECF_CONST
)
10281 TREE_READONLY (decl
) = 1;
10282 if (flags
& ECF_PURE
)
10283 DECL_PURE_P (decl
) = 1;
10284 if (flags
& ECF_LOOPING_CONST_OR_PURE
)
10285 DECL_LOOPING_CONST_OR_PURE_P (decl
) = 1;
10286 if (flags
& ECF_NOVOPS
)
10287 DECL_IS_NOVOPS (decl
) = 1;
10288 if (flags
& ECF_NORETURN
)
10289 TREE_THIS_VOLATILE (decl
) = 1;
10290 if (flags
& ECF_MALLOC
)
10291 DECL_IS_MALLOC (decl
) = 1;
10292 if (flags
& ECF_RETURNS_TWICE
)
10293 DECL_IS_RETURNS_TWICE (decl
) = 1;
10294 if (flags
& ECF_LEAF
)
10295 DECL_ATTRIBUTES (decl
) = tree_cons (get_identifier ("leaf"),
10296 NULL
, DECL_ATTRIBUTES (decl
));
10297 if ((flags
& ECF_TM_PURE
) && flag_tm
)
10298 apply_tm_attr (decl
, get_identifier ("transaction_pure"));
10299 /* Looping const or pure is implied by noreturn.
10300 There is currently no way to declare looping const or looping pure alone. */
10301 gcc_assert (!(flags
& ECF_LOOPING_CONST_OR_PURE
)
10302 || ((flags
& ECF_NORETURN
) && (flags
& (ECF_CONST
| ECF_PURE
))));
10306 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
10309 local_define_builtin (const char *name
, tree type
, enum built_in_function code
,
10310 const char *library_name
, int ecf_flags
)
10314 decl
= add_builtin_function (name
, type
, code
, BUILT_IN_NORMAL
,
10315 library_name
, NULL_TREE
);
10316 set_call_expr_flags (decl
, ecf_flags
);
10318 set_builtin_decl (code
, decl
, true);
10321 /* Call this function after instantiating all builtins that the language
10322 front end cares about. This will build the rest of the builtins
10323 and internal functions that are relied upon by the tree optimizers and
10327 build_common_builtin_nodes (void)
10332 if (!builtin_decl_explicit_p (BUILT_IN_UNREACHABLE
))
10334 ftype
= build_function_type (void_type_node
, void_list_node
);
10335 local_define_builtin ("__builtin_unreachable", ftype
, BUILT_IN_UNREACHABLE
,
10336 "__builtin_unreachable",
10337 ECF_NOTHROW
| ECF_LEAF
| ECF_NORETURN
10341 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
)
10342 || !builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
10344 ftype
= build_function_type_list (ptr_type_node
,
10345 ptr_type_node
, const_ptr_type_node
,
10346 size_type_node
, NULL_TREE
);
10348 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
))
10349 local_define_builtin ("__builtin_memcpy", ftype
, BUILT_IN_MEMCPY
,
10350 "memcpy", ECF_NOTHROW
| ECF_LEAF
);
10351 if (!builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
10352 local_define_builtin ("__builtin_memmove", ftype
, BUILT_IN_MEMMOVE
,
10353 "memmove", ECF_NOTHROW
| ECF_LEAF
);
10356 if (!builtin_decl_explicit_p (BUILT_IN_MEMCMP
))
10358 ftype
= build_function_type_list (integer_type_node
, const_ptr_type_node
,
10359 const_ptr_type_node
, size_type_node
,
10361 local_define_builtin ("__builtin_memcmp", ftype
, BUILT_IN_MEMCMP
,
10362 "memcmp", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10365 if (!builtin_decl_explicit_p (BUILT_IN_MEMSET
))
10367 ftype
= build_function_type_list (ptr_type_node
,
10368 ptr_type_node
, integer_type_node
,
10369 size_type_node
, NULL_TREE
);
10370 local_define_builtin ("__builtin_memset", ftype
, BUILT_IN_MEMSET
,
10371 "memset", ECF_NOTHROW
| ECF_LEAF
);
10374 if (!builtin_decl_explicit_p (BUILT_IN_ALLOCA
))
10376 ftype
= build_function_type_list (ptr_type_node
,
10377 size_type_node
, NULL_TREE
);
10378 local_define_builtin ("__builtin_alloca", ftype
, BUILT_IN_ALLOCA
,
10379 "alloca", ECF_MALLOC
| ECF_NOTHROW
| ECF_LEAF
);
10382 ftype
= build_function_type_list (ptr_type_node
, size_type_node
,
10383 size_type_node
, NULL_TREE
);
10384 local_define_builtin ("__builtin_alloca_with_align", ftype
,
10385 BUILT_IN_ALLOCA_WITH_ALIGN
,
10386 "__builtin_alloca_with_align",
10387 ECF_MALLOC
| ECF_NOTHROW
| ECF_LEAF
);
10389 /* If we're checking the stack, `alloca' can throw. */
10390 if (flag_stack_check
)
10392 TREE_NOTHROW (builtin_decl_explicit (BUILT_IN_ALLOCA
)) = 0;
10393 TREE_NOTHROW (builtin_decl_explicit (BUILT_IN_ALLOCA_WITH_ALIGN
)) = 0;
10396 ftype
= build_function_type_list (void_type_node
,
10397 ptr_type_node
, ptr_type_node
,
10398 ptr_type_node
, NULL_TREE
);
10399 local_define_builtin ("__builtin_init_trampoline", ftype
,
10400 BUILT_IN_INIT_TRAMPOLINE
,
10401 "__builtin_init_trampoline", ECF_NOTHROW
| ECF_LEAF
);
10402 local_define_builtin ("__builtin_init_heap_trampoline", ftype
,
10403 BUILT_IN_INIT_HEAP_TRAMPOLINE
,
10404 "__builtin_init_heap_trampoline",
10405 ECF_NOTHROW
| ECF_LEAF
);
10407 ftype
= build_function_type_list (ptr_type_node
, ptr_type_node
, NULL_TREE
);
10408 local_define_builtin ("__builtin_adjust_trampoline", ftype
,
10409 BUILT_IN_ADJUST_TRAMPOLINE
,
10410 "__builtin_adjust_trampoline",
10411 ECF_CONST
| ECF_NOTHROW
);
10413 ftype
= build_function_type_list (void_type_node
,
10414 ptr_type_node
, ptr_type_node
, NULL_TREE
);
10415 local_define_builtin ("__builtin_nonlocal_goto", ftype
,
10416 BUILT_IN_NONLOCAL_GOTO
,
10417 "__builtin_nonlocal_goto",
10418 ECF_NORETURN
| ECF_NOTHROW
);
10420 ftype
= build_function_type_list (void_type_node
,
10421 ptr_type_node
, ptr_type_node
, NULL_TREE
);
10422 local_define_builtin ("__builtin_setjmp_setup", ftype
,
10423 BUILT_IN_SETJMP_SETUP
,
10424 "__builtin_setjmp_setup", ECF_NOTHROW
);
10426 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10427 local_define_builtin ("__builtin_setjmp_receiver", ftype
,
10428 BUILT_IN_SETJMP_RECEIVER
,
10429 "__builtin_setjmp_receiver", ECF_NOTHROW
| ECF_LEAF
);
10431 ftype
= build_function_type_list (ptr_type_node
, NULL_TREE
);
10432 local_define_builtin ("__builtin_stack_save", ftype
, BUILT_IN_STACK_SAVE
,
10433 "__builtin_stack_save", ECF_NOTHROW
| ECF_LEAF
);
10435 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10436 local_define_builtin ("__builtin_stack_restore", ftype
,
10437 BUILT_IN_STACK_RESTORE
,
10438 "__builtin_stack_restore", ECF_NOTHROW
| ECF_LEAF
);
10440 /* If there's a possibility that we might use the ARM EABI, build the
10441 alternate __cxa_end_cleanup node used to resume from C++ and Java. */
10442 if (targetm
.arm_eabi_unwinder
)
10444 ftype
= build_function_type_list (void_type_node
, NULL_TREE
);
10445 local_define_builtin ("__builtin_cxa_end_cleanup", ftype
,
10446 BUILT_IN_CXA_END_CLEANUP
,
10447 "__cxa_end_cleanup", ECF_NORETURN
| ECF_LEAF
);
10450 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10451 local_define_builtin ("__builtin_unwind_resume", ftype
,
10452 BUILT_IN_UNWIND_RESUME
,
10453 ((targetm_common
.except_unwind_info (&global_options
)
10455 ? "_Unwind_SjLj_Resume" : "_Unwind_Resume"),
10458 if (builtin_decl_explicit (BUILT_IN_RETURN_ADDRESS
) == NULL_TREE
)
10460 ftype
= build_function_type_list (ptr_type_node
, integer_type_node
,
10462 local_define_builtin ("__builtin_return_address", ftype
,
10463 BUILT_IN_RETURN_ADDRESS
,
10464 "__builtin_return_address",
10468 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
)
10469 || !builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
10471 ftype
= build_function_type_list (void_type_node
, ptr_type_node
,
10472 ptr_type_node
, NULL_TREE
);
10473 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
))
10474 local_define_builtin ("__cyg_profile_func_enter", ftype
,
10475 BUILT_IN_PROFILE_FUNC_ENTER
,
10476 "__cyg_profile_func_enter", 0);
10477 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
10478 local_define_builtin ("__cyg_profile_func_exit", ftype
,
10479 BUILT_IN_PROFILE_FUNC_EXIT
,
10480 "__cyg_profile_func_exit", 0);
10483 /* The exception object and filter values from the runtime. The argument
10484 must be zero before exception lowering, i.e. from the front end. After
10485 exception lowering, it will be the region number for the exception
10486 landing pad. These functions are PURE instead of CONST to prevent
10487 them from being hoisted past the exception edge that will initialize
10488 its value in the landing pad. */
10489 ftype
= build_function_type_list (ptr_type_node
,
10490 integer_type_node
, NULL_TREE
);
10491 ecf_flags
= ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
;
10492 /* Only use TM_PURE if we have TM language support. */
10493 if (builtin_decl_explicit_p (BUILT_IN_TM_LOAD_1
))
10494 ecf_flags
|= ECF_TM_PURE
;
10495 local_define_builtin ("__builtin_eh_pointer", ftype
, BUILT_IN_EH_POINTER
,
10496 "__builtin_eh_pointer", ecf_flags
);
10498 tmp
= lang_hooks
.types
.type_for_mode (targetm
.eh_return_filter_mode (), 0);
10499 ftype
= build_function_type_list (tmp
, integer_type_node
, NULL_TREE
);
10500 local_define_builtin ("__builtin_eh_filter", ftype
, BUILT_IN_EH_FILTER
,
10501 "__builtin_eh_filter", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10503 ftype
= build_function_type_list (void_type_node
,
10504 integer_type_node
, integer_type_node
,
10506 local_define_builtin ("__builtin_eh_copy_values", ftype
,
10507 BUILT_IN_EH_COPY_VALUES
,
10508 "__builtin_eh_copy_values", ECF_NOTHROW
);
10510 /* Complex multiplication and division. These are handled as builtins
10511 rather than optabs because emit_library_call_value doesn't support
10512 complex. Further, we can do slightly better with folding these
10513 beasties if the real and complex parts of the arguments are separate. */
10517 for (mode
= MIN_MODE_COMPLEX_FLOAT
; mode
<= MAX_MODE_COMPLEX_FLOAT
; ++mode
)
10519 char mode_name_buf
[4], *q
;
10521 enum built_in_function mcode
, dcode
;
10522 tree type
, inner_type
;
10523 const char *prefix
= "__";
10525 if (targetm
.libfunc_gnu_prefix
)
10528 type
= lang_hooks
.types
.type_for_mode ((machine_mode
) mode
, 0);
10531 inner_type
= TREE_TYPE (type
);
10533 ftype
= build_function_type_list (type
, inner_type
, inner_type
,
10534 inner_type
, inner_type
, NULL_TREE
);
10536 mcode
= ((enum built_in_function
)
10537 (BUILT_IN_COMPLEX_MUL_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
10538 dcode
= ((enum built_in_function
)
10539 (BUILT_IN_COMPLEX_DIV_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
10541 for (p
= GET_MODE_NAME (mode
), q
= mode_name_buf
; *p
; p
++, q
++)
10545 built_in_names
[mcode
] = concat (prefix
, "mul", mode_name_buf
, "3",
10547 local_define_builtin (built_in_names
[mcode
], ftype
, mcode
,
10548 built_in_names
[mcode
],
10549 ECF_CONST
| ECF_NOTHROW
| ECF_LEAF
);
10551 built_in_names
[dcode
] = concat (prefix
, "div", mode_name_buf
, "3",
10553 local_define_builtin (built_in_names
[dcode
], ftype
, dcode
,
10554 built_in_names
[dcode
],
10555 ECF_CONST
| ECF_NOTHROW
| ECF_LEAF
);
10559 init_internal_fns ();
10562 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
10565 If we requested a pointer to a vector, build up the pointers that
10566 we stripped off while looking for the inner type. Similarly for
10567 return values from functions.
10569 The argument TYPE is the top of the chain, and BOTTOM is the
10570 new type which we will point to. */
10573 reconstruct_complex_type (tree type
, tree bottom
)
10577 if (TREE_CODE (type
) == POINTER_TYPE
)
10579 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10580 outer
= build_pointer_type_for_mode (inner
, TYPE_MODE (type
),
10581 TYPE_REF_CAN_ALIAS_ALL (type
));
10583 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
10585 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10586 outer
= build_reference_type_for_mode (inner
, TYPE_MODE (type
),
10587 TYPE_REF_CAN_ALIAS_ALL (type
));
10589 else if (TREE_CODE (type
) == ARRAY_TYPE
)
10591 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10592 outer
= build_array_type (inner
, TYPE_DOMAIN (type
));
10594 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10596 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10597 outer
= build_function_type (inner
, TYPE_ARG_TYPES (type
));
10599 else if (TREE_CODE (type
) == METHOD_TYPE
)
10601 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10602 /* The build_method_type_directly() routine prepends 'this' to argument list,
10603 so we must compensate by getting rid of it. */
10605 = build_method_type_directly
10606 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
))),
10608 TREE_CHAIN (TYPE_ARG_TYPES (type
)));
10610 else if (TREE_CODE (type
) == OFFSET_TYPE
)
10612 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10613 outer
= build_offset_type (TYPE_OFFSET_BASETYPE (type
), inner
);
10618 return build_type_attribute_qual_variant (outer
, TYPE_ATTRIBUTES (type
),
10619 TYPE_QUALS (type
));
10622 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
10625 build_vector_type_for_mode (tree innertype
, machine_mode mode
)
10629 switch (GET_MODE_CLASS (mode
))
10631 case MODE_VECTOR_INT
:
10632 case MODE_VECTOR_FLOAT
:
10633 case MODE_VECTOR_FRACT
:
10634 case MODE_VECTOR_UFRACT
:
10635 case MODE_VECTOR_ACCUM
:
10636 case MODE_VECTOR_UACCUM
:
10637 nunits
= GET_MODE_NUNITS (mode
);
10641 /* Check that there are no leftover bits. */
10642 gcc_assert (GET_MODE_BITSIZE (mode
)
10643 % TREE_INT_CST_LOW (TYPE_SIZE (innertype
)) == 0);
10645 nunits
= GET_MODE_BITSIZE (mode
)
10646 / TREE_INT_CST_LOW (TYPE_SIZE (innertype
));
10650 gcc_unreachable ();
10653 return make_vector_type (innertype
, nunits
, mode
);
10656 /* Similarly, but takes the inner type and number of units, which must be
10660 build_vector_type (tree innertype
, int nunits
)
10662 return make_vector_type (innertype
, nunits
, VOIDmode
);
10665 /* Build truth vector with specified length and number of units. */
10668 build_truth_vector_type (unsigned nunits
, unsigned vector_size
)
10670 machine_mode mask_mode
= targetm
.vectorize
.get_mask_mode (nunits
,
10673 gcc_assert (mask_mode
!= VOIDmode
);
10675 unsigned HOST_WIDE_INT vsize
;
10676 if (mask_mode
== BLKmode
)
10677 vsize
= vector_size
* BITS_PER_UNIT
;
10679 vsize
= GET_MODE_BITSIZE (mask_mode
);
10681 unsigned HOST_WIDE_INT esize
= vsize
/ nunits
;
10682 gcc_assert (esize
* nunits
== vsize
);
10684 tree bool_type
= build_nonstandard_boolean_type (esize
);
10686 return make_vector_type (bool_type
, nunits
, mask_mode
);
10689 /* Returns a vector type corresponding to a comparison of VECTYPE. */
10692 build_same_sized_truth_vector_type (tree vectype
)
10694 if (VECTOR_BOOLEAN_TYPE_P (vectype
))
10697 unsigned HOST_WIDE_INT size
= GET_MODE_SIZE (TYPE_MODE (vectype
));
10700 size
= tree_to_uhwi (TYPE_SIZE_UNIT (vectype
));
10702 return build_truth_vector_type (TYPE_VECTOR_SUBPARTS (vectype
), size
);
10705 /* Similarly, but builds a variant type with TYPE_VECTOR_OPAQUE set. */
10708 build_opaque_vector_type (tree innertype
, int nunits
)
10710 tree t
= make_vector_type (innertype
, nunits
, VOIDmode
);
10712 /* We always build the non-opaque variant before the opaque one,
10713 so if it already exists, it is TYPE_NEXT_VARIANT of this one. */
10714 cand
= TYPE_NEXT_VARIANT (t
);
10716 && TYPE_VECTOR_OPAQUE (cand
)
10717 && check_qualified_type (cand
, t
, TYPE_QUALS (t
)))
10719 /* Othewise build a variant type and make sure to queue it after
10720 the non-opaque type. */
10721 cand
= build_distinct_type_copy (t
);
10722 TYPE_VECTOR_OPAQUE (cand
) = true;
10723 TYPE_CANONICAL (cand
) = TYPE_CANONICAL (t
);
10724 TYPE_NEXT_VARIANT (cand
) = TYPE_NEXT_VARIANT (t
);
10725 TYPE_NEXT_VARIANT (t
) = cand
;
10726 TYPE_MAIN_VARIANT (cand
) = TYPE_MAIN_VARIANT (t
);
10731 /* Given an initializer INIT, return TRUE if INIT is zero or some
10732 aggregate of zeros. Otherwise return FALSE. */
10734 initializer_zerop (const_tree init
)
10740 switch (TREE_CODE (init
))
10743 return integer_zerop (init
);
10746 /* ??? Note that this is not correct for C4X float formats. There,
10747 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
10748 negative exponent. */
10749 return real_zerop (init
)
10750 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init
));
10753 return fixed_zerop (init
);
10756 return integer_zerop (init
)
10757 || (real_zerop (init
)
10758 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init
)))
10759 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init
))));
10764 for (i
= 0; i
< VECTOR_CST_NELTS (init
); ++i
)
10765 if (!initializer_zerop (VECTOR_CST_ELT (init
, i
)))
10772 unsigned HOST_WIDE_INT idx
;
10774 if (TREE_CLOBBER_P (init
))
10776 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init
), idx
, elt
)
10777 if (!initializer_zerop (elt
))
10786 /* We need to loop through all elements to handle cases like
10787 "\0" and "\0foobar". */
10788 for (i
= 0; i
< TREE_STRING_LENGTH (init
); ++i
)
10789 if (TREE_STRING_POINTER (init
)[i
] != '\0')
10800 /* Check if vector VEC consists of all the equal elements and
10801 that the number of elements corresponds to the type of VEC.
10802 The function returns first element of the vector
10803 or NULL_TREE if the vector is not uniform. */
10805 uniform_vector_p (const_tree vec
)
10810 if (vec
== NULL_TREE
)
10813 gcc_assert (VECTOR_TYPE_P (TREE_TYPE (vec
)));
10815 if (TREE_CODE (vec
) == VECTOR_CST
)
10817 first
= VECTOR_CST_ELT (vec
, 0);
10818 for (i
= 1; i
< VECTOR_CST_NELTS (vec
); ++i
)
10819 if (!operand_equal_p (first
, VECTOR_CST_ELT (vec
, i
), 0))
10825 else if (TREE_CODE (vec
) == CONSTRUCTOR
)
10827 first
= error_mark_node
;
10829 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (vec
), i
, t
)
10836 if (!operand_equal_p (first
, t
, 0))
10839 if (i
!= TYPE_VECTOR_SUBPARTS (TREE_TYPE (vec
)))
10848 /* Build an empty statement at location LOC. */
10851 build_empty_stmt (location_t loc
)
10853 tree t
= build1 (NOP_EXPR
, void_type_node
, size_zero_node
);
10854 SET_EXPR_LOCATION (t
, loc
);
10859 /* Build an OpenMP clause with code CODE. LOC is the location of the
10863 build_omp_clause (location_t loc
, enum omp_clause_code code
)
10868 length
= omp_clause_num_ops
[code
];
10869 size
= (sizeof (struct tree_omp_clause
) + (length
- 1) * sizeof (tree
));
10871 record_node_allocation_statistics (OMP_CLAUSE
, size
);
10873 t
= (tree
) ggc_internal_alloc (size
);
10874 memset (t
, 0, size
);
10875 TREE_SET_CODE (t
, OMP_CLAUSE
);
10876 OMP_CLAUSE_SET_CODE (t
, code
);
10877 OMP_CLAUSE_LOCATION (t
) = loc
;
10882 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
10883 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
10884 Except for the CODE and operand count field, other storage for the
10885 object is initialized to zeros. */
10888 build_vl_exp_stat (enum tree_code code
, int len MEM_STAT_DECL
)
10891 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_exp
);
10893 gcc_assert (TREE_CODE_CLASS (code
) == tcc_vl_exp
);
10894 gcc_assert (len
>= 1);
10896 record_node_allocation_statistics (code
, length
);
10898 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
10900 TREE_SET_CODE (t
, code
);
10902 /* Can't use TREE_OPERAND to store the length because if checking is
10903 enabled, it will try to check the length before we store it. :-P */
10904 t
->exp
.operands
[0] = build_int_cst (sizetype
, len
);
10909 /* Helper function for build_call_* functions; build a CALL_EXPR with
10910 indicated RETURN_TYPE, FN, and NARGS, but do not initialize any of
10911 the argument slots. */
10914 build_call_1 (tree return_type
, tree fn
, int nargs
)
10918 t
= build_vl_exp (CALL_EXPR
, nargs
+ 3);
10919 TREE_TYPE (t
) = return_type
;
10920 CALL_EXPR_FN (t
) = fn
;
10921 CALL_EXPR_STATIC_CHAIN (t
) = NULL
;
10926 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10927 FN and a null static chain slot. NARGS is the number of call arguments
10928 which are specified as "..." arguments. */
10931 build_call_nary (tree return_type
, tree fn
, int nargs
, ...)
10935 va_start (args
, nargs
);
10936 ret
= build_call_valist (return_type
, fn
, nargs
, args
);
10941 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10942 FN and a null static chain slot. NARGS is the number of call arguments
10943 which are specified as a va_list ARGS. */
10946 build_call_valist (tree return_type
, tree fn
, int nargs
, va_list args
)
10951 t
= build_call_1 (return_type
, fn
, nargs
);
10952 for (i
= 0; i
< nargs
; i
++)
10953 CALL_EXPR_ARG (t
, i
) = va_arg (args
, tree
);
10954 process_call_operands (t
);
10958 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10959 FN and a null static chain slot. NARGS is the number of call arguments
10960 which are specified as a tree array ARGS. */
10963 build_call_array_loc (location_t loc
, tree return_type
, tree fn
,
10964 int nargs
, const tree
*args
)
10969 t
= build_call_1 (return_type
, fn
, nargs
);
10970 for (i
= 0; i
< nargs
; i
++)
10971 CALL_EXPR_ARG (t
, i
) = args
[i
];
10972 process_call_operands (t
);
10973 SET_EXPR_LOCATION (t
, loc
);
10977 /* Like build_call_array, but takes a vec. */
10980 build_call_vec (tree return_type
, tree fn
, vec
<tree
, va_gc
> *args
)
10985 ret
= build_call_1 (return_type
, fn
, vec_safe_length (args
));
10986 FOR_EACH_VEC_SAFE_ELT (args
, ix
, t
)
10987 CALL_EXPR_ARG (ret
, ix
) = t
;
10988 process_call_operands (ret
);
10992 /* Conveniently construct a function call expression. FNDECL names the
10993 function to be called and N arguments are passed in the array
10997 build_call_expr_loc_array (location_t loc
, tree fndecl
, int n
, tree
*argarray
)
10999 tree fntype
= TREE_TYPE (fndecl
);
11000 tree fn
= build1 (ADDR_EXPR
, build_pointer_type (fntype
), fndecl
);
11002 return fold_build_call_array_loc (loc
, TREE_TYPE (fntype
), fn
, n
, argarray
);
11005 /* Conveniently construct a function call expression. FNDECL names the
11006 function to be called and the arguments are passed in the vector
11010 build_call_expr_loc_vec (location_t loc
, tree fndecl
, vec
<tree
, va_gc
> *vec
)
11012 return build_call_expr_loc_array (loc
, fndecl
, vec_safe_length (vec
),
11013 vec_safe_address (vec
));
11017 /* Conveniently construct a function call expression. FNDECL names the
11018 function to be called, N is the number of arguments, and the "..."
11019 parameters are the argument expressions. */
11022 build_call_expr_loc (location_t loc
, tree fndecl
, int n
, ...)
11025 tree
*argarray
= XALLOCAVEC (tree
, n
);
11029 for (i
= 0; i
< n
; i
++)
11030 argarray
[i
] = va_arg (ap
, tree
);
11032 return build_call_expr_loc_array (loc
, fndecl
, n
, argarray
);
11035 /* Like build_call_expr_loc (UNKNOWN_LOCATION, ...). Duplicated because
11036 varargs macros aren't supported by all bootstrap compilers. */
11039 build_call_expr (tree fndecl
, int n
, ...)
11042 tree
*argarray
= XALLOCAVEC (tree
, n
);
11046 for (i
= 0; i
< n
; i
++)
11047 argarray
[i
] = va_arg (ap
, tree
);
11049 return build_call_expr_loc_array (UNKNOWN_LOCATION
, fndecl
, n
, argarray
);
11052 /* Build internal call expression. This is just like CALL_EXPR, except
11053 its CALL_EXPR_FN is NULL. It will get gimplified later into ordinary
11054 internal function. */
11057 build_call_expr_internal_loc (location_t loc
, enum internal_fn ifn
,
11058 tree type
, int n
, ...)
11063 tree fn
= build_call_1 (type
, NULL_TREE
, n
);
11065 for (i
= 0; i
< n
; i
++)
11066 CALL_EXPR_ARG (fn
, i
) = va_arg (ap
, tree
);
11068 SET_EXPR_LOCATION (fn
, loc
);
11069 CALL_EXPR_IFN (fn
) = ifn
;
11073 /* Create a new constant string literal and return a char* pointer to it.
11074 The STRING_CST value is the LEN characters at STR. */
11076 build_string_literal (int len
, const char *str
)
11078 tree t
, elem
, index
, type
;
11080 t
= build_string (len
, str
);
11081 elem
= build_type_variant (char_type_node
, 1, 0);
11082 index
= build_index_type (size_int (len
- 1));
11083 type
= build_array_type (elem
, index
);
11084 TREE_TYPE (t
) = type
;
11085 TREE_CONSTANT (t
) = 1;
11086 TREE_READONLY (t
) = 1;
11087 TREE_STATIC (t
) = 1;
11089 type
= build_pointer_type (elem
);
11090 t
= build1 (ADDR_EXPR
, type
,
11091 build4 (ARRAY_REF
, elem
,
11092 t
, integer_zero_node
, NULL_TREE
, NULL_TREE
));
11098 /* Return true if T (assumed to be a DECL) must be assigned a memory
11102 needs_to_live_in_memory (const_tree t
)
11104 return (TREE_ADDRESSABLE (t
)
11105 || is_global_var (t
)
11106 || (TREE_CODE (t
) == RESULT_DECL
11107 && !DECL_BY_REFERENCE (t
)
11108 && aggregate_value_p (t
, current_function_decl
)));
11111 /* Return value of a constant X and sign-extend it. */
11114 int_cst_value (const_tree x
)
11116 unsigned bits
= TYPE_PRECISION (TREE_TYPE (x
));
11117 unsigned HOST_WIDE_INT val
= TREE_INT_CST_LOW (x
);
11119 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
11120 gcc_assert (cst_and_fits_in_hwi (x
));
11122 if (bits
< HOST_BITS_PER_WIDE_INT
)
11124 bool negative
= ((val
>> (bits
- 1)) & 1) != 0;
11126 val
|= (~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1;
11128 val
&= ~((~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1);
11134 /* If TYPE is an integral or pointer type, return an integer type with
11135 the same precision which is unsigned iff UNSIGNEDP is true, or itself
11136 if TYPE is already an integer type of signedness UNSIGNEDP. */
11139 signed_or_unsigned_type_for (int unsignedp
, tree type
)
11141 if (TREE_CODE (type
) == INTEGER_TYPE
&& TYPE_UNSIGNED (type
) == unsignedp
)
11144 if (TREE_CODE (type
) == VECTOR_TYPE
)
11146 tree inner
= TREE_TYPE (type
);
11147 tree inner2
= signed_or_unsigned_type_for (unsignedp
, inner
);
11150 if (inner
== inner2
)
11152 return build_vector_type (inner2
, TYPE_VECTOR_SUBPARTS (type
));
11155 if (!INTEGRAL_TYPE_P (type
)
11156 && !POINTER_TYPE_P (type
)
11157 && TREE_CODE (type
) != OFFSET_TYPE
)
11160 return build_nonstandard_integer_type (TYPE_PRECISION (type
), unsignedp
);
11163 /* If TYPE is an integral or pointer type, return an integer type with
11164 the same precision which is unsigned, or itself if TYPE is already an
11165 unsigned integer type. */
11168 unsigned_type_for (tree type
)
11170 return signed_or_unsigned_type_for (1, type
);
11173 /* If TYPE is an integral or pointer type, return an integer type with
11174 the same precision which is signed, or itself if TYPE is already a
11175 signed integer type. */
11178 signed_type_for (tree type
)
11180 return signed_or_unsigned_type_for (0, type
);
11183 /* If TYPE is a vector type, return a signed integer vector type with the
11184 same width and number of subparts. Otherwise return boolean_type_node. */
11187 truth_type_for (tree type
)
11189 if (TREE_CODE (type
) == VECTOR_TYPE
)
11191 if (VECTOR_BOOLEAN_TYPE_P (type
))
11193 return build_truth_vector_type (TYPE_VECTOR_SUBPARTS (type
),
11194 GET_MODE_SIZE (TYPE_MODE (type
)));
11197 return boolean_type_node
;
11200 /* Returns the largest value obtainable by casting something in INNER type to
11204 upper_bound_in_type (tree outer
, tree inner
)
11206 unsigned int det
= 0;
11207 unsigned oprec
= TYPE_PRECISION (outer
);
11208 unsigned iprec
= TYPE_PRECISION (inner
);
11211 /* Compute a unique number for every combination. */
11212 det
|= (oprec
> iprec
) ? 4 : 0;
11213 det
|= TYPE_UNSIGNED (outer
) ? 2 : 0;
11214 det
|= TYPE_UNSIGNED (inner
) ? 1 : 0;
11216 /* Determine the exponent to use. */
11221 /* oprec <= iprec, outer: signed, inner: don't care. */
11226 /* oprec <= iprec, outer: unsigned, inner: don't care. */
11230 /* oprec > iprec, outer: signed, inner: signed. */
11234 /* oprec > iprec, outer: signed, inner: unsigned. */
11238 /* oprec > iprec, outer: unsigned, inner: signed. */
11242 /* oprec > iprec, outer: unsigned, inner: unsigned. */
11246 gcc_unreachable ();
11249 return wide_int_to_tree (outer
,
11250 wi::mask (prec
, false, TYPE_PRECISION (outer
)));
11253 /* Returns the smallest value obtainable by casting something in INNER type to
11257 lower_bound_in_type (tree outer
, tree inner
)
11259 unsigned oprec
= TYPE_PRECISION (outer
);
11260 unsigned iprec
= TYPE_PRECISION (inner
);
11262 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
11264 if (TYPE_UNSIGNED (outer
)
11265 /* If we are widening something of an unsigned type, OUTER type
11266 contains all values of INNER type. In particular, both INNER
11267 and OUTER types have zero in common. */
11268 || (oprec
> iprec
&& TYPE_UNSIGNED (inner
)))
11269 return build_int_cst (outer
, 0);
11272 /* If we are widening a signed type to another signed type, we
11273 want to obtain -2^^(iprec-1). If we are keeping the
11274 precision or narrowing to a signed type, we want to obtain
11276 unsigned prec
= oprec
> iprec
? iprec
: oprec
;
11277 return wide_int_to_tree (outer
,
11278 wi::mask (prec
- 1, true,
11279 TYPE_PRECISION (outer
)));
11283 /* Return nonzero if two operands that are suitable for PHI nodes are
11284 necessarily equal. Specifically, both ARG0 and ARG1 must be either
11285 SSA_NAME or invariant. Note that this is strictly an optimization.
11286 That is, callers of this function can directly call operand_equal_p
11287 and get the same result, only slower. */
11290 operand_equal_for_phi_arg_p (const_tree arg0
, const_tree arg1
)
11294 if (TREE_CODE (arg0
) == SSA_NAME
|| TREE_CODE (arg1
) == SSA_NAME
)
11296 return operand_equal_p (arg0
, arg1
, 0);
11299 /* Returns number of zeros at the end of binary representation of X. */
11302 num_ending_zeros (const_tree x
)
11304 return build_int_cst (TREE_TYPE (x
), wi::ctz (x
));
11308 #define WALK_SUBTREE(NODE) \
11311 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
11317 /* This is a subroutine of walk_tree that walks field of TYPE that are to
11318 be walked whenever a type is seen in the tree. Rest of operands and return
11319 value are as for walk_tree. */
11322 walk_type_fields (tree type
, walk_tree_fn func
, void *data
,
11323 hash_set
<tree
> *pset
, walk_tree_lh lh
)
11325 tree result
= NULL_TREE
;
11327 switch (TREE_CODE (type
))
11330 case REFERENCE_TYPE
:
11332 /* We have to worry about mutually recursive pointers. These can't
11333 be written in C. They can in Ada. It's pathological, but
11334 there's an ACATS test (c38102a) that checks it. Deal with this
11335 by checking if we're pointing to another pointer, that one
11336 points to another pointer, that one does too, and we have no htab.
11337 If so, get a hash table. We check three levels deep to avoid
11338 the cost of the hash table if we don't need one. */
11339 if (POINTER_TYPE_P (TREE_TYPE (type
))
11340 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type
)))
11341 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type
))))
11344 result
= walk_tree_without_duplicates (&TREE_TYPE (type
),
11352 /* ... fall through ... */
11355 WALK_SUBTREE (TREE_TYPE (type
));
11359 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type
));
11361 /* Fall through. */
11363 case FUNCTION_TYPE
:
11364 WALK_SUBTREE (TREE_TYPE (type
));
11368 /* We never want to walk into default arguments. */
11369 for (arg
= TYPE_ARG_TYPES (type
); arg
; arg
= TREE_CHAIN (arg
))
11370 WALK_SUBTREE (TREE_VALUE (arg
));
11375 /* Don't follow this nodes's type if a pointer for fear that
11376 we'll have infinite recursion. If we have a PSET, then we
11379 || (!POINTER_TYPE_P (TREE_TYPE (type
))
11380 && TREE_CODE (TREE_TYPE (type
)) != OFFSET_TYPE
))
11381 WALK_SUBTREE (TREE_TYPE (type
));
11382 WALK_SUBTREE (TYPE_DOMAIN (type
));
11386 WALK_SUBTREE (TREE_TYPE (type
));
11387 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type
));
11397 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
11398 called with the DATA and the address of each sub-tree. If FUNC returns a
11399 non-NULL value, the traversal is stopped, and the value returned by FUNC
11400 is returned. If PSET is non-NULL it is used to record the nodes visited,
11401 and to avoid visiting a node more than once. */
11404 walk_tree_1 (tree
*tp
, walk_tree_fn func
, void *data
,
11405 hash_set
<tree
> *pset
, walk_tree_lh lh
)
11407 enum tree_code code
;
11411 #define WALK_SUBTREE_TAIL(NODE) \
11415 goto tail_recurse; \
11420 /* Skip empty subtrees. */
11424 /* Don't walk the same tree twice, if the user has requested
11425 that we avoid doing so. */
11426 if (pset
&& pset
->add (*tp
))
11429 /* Call the function. */
11431 result
= (*func
) (tp
, &walk_subtrees
, data
);
11433 /* If we found something, return it. */
11437 code
= TREE_CODE (*tp
);
11439 /* Even if we didn't, FUNC may have decided that there was nothing
11440 interesting below this point in the tree. */
11441 if (!walk_subtrees
)
11443 /* But we still need to check our siblings. */
11444 if (code
== TREE_LIST
)
11445 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
11446 else if (code
== OMP_CLAUSE
)
11447 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11454 result
= (*lh
) (tp
, &walk_subtrees
, func
, data
, pset
);
11455 if (result
|| !walk_subtrees
)
11462 case IDENTIFIER_NODE
:
11469 case PLACEHOLDER_EXPR
:
11473 /* None of these have subtrees other than those already walked
11478 WALK_SUBTREE (TREE_VALUE (*tp
));
11479 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
11484 int len
= TREE_VEC_LENGTH (*tp
);
11489 /* Walk all elements but the first. */
11491 WALK_SUBTREE (TREE_VEC_ELT (*tp
, len
));
11493 /* Now walk the first one as a tail call. */
11494 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp
, 0));
11498 WALK_SUBTREE (TREE_REALPART (*tp
));
11499 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp
));
11503 unsigned HOST_WIDE_INT idx
;
11504 constructor_elt
*ce
;
11506 for (idx
= 0; vec_safe_iterate (CONSTRUCTOR_ELTS (*tp
), idx
, &ce
);
11508 WALK_SUBTREE (ce
->value
);
11513 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, 0));
11518 for (decl
= BIND_EXPR_VARS (*tp
); decl
; decl
= DECL_CHAIN (decl
))
11520 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
11521 into declarations that are just mentioned, rather than
11522 declared; they don't really belong to this part of the tree.
11523 And, we can see cycles: the initializer for a declaration
11524 can refer to the declaration itself. */
11525 WALK_SUBTREE (DECL_INITIAL (decl
));
11526 WALK_SUBTREE (DECL_SIZE (decl
));
11527 WALK_SUBTREE (DECL_SIZE_UNIT (decl
));
11529 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp
));
11532 case STATEMENT_LIST
:
11534 tree_stmt_iterator i
;
11535 for (i
= tsi_start (*tp
); !tsi_end_p (i
); tsi_next (&i
))
11536 WALK_SUBTREE (*tsi_stmt_ptr (i
));
11541 switch (OMP_CLAUSE_CODE (*tp
))
11543 case OMP_CLAUSE_GANG
:
11544 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 1));
11547 case OMP_CLAUSE_DEVICE_RESIDENT
:
11548 case OMP_CLAUSE_USE_DEVICE
:
11549 case OMP_CLAUSE_ASYNC
:
11550 case OMP_CLAUSE_WAIT
:
11551 case OMP_CLAUSE_WORKER
:
11552 case OMP_CLAUSE_VECTOR
:
11553 case OMP_CLAUSE_NUM_GANGS
:
11554 case OMP_CLAUSE_NUM_WORKERS
:
11555 case OMP_CLAUSE_VECTOR_LENGTH
:
11556 case OMP_CLAUSE_PRIVATE
:
11557 case OMP_CLAUSE_SHARED
:
11558 case OMP_CLAUSE_FIRSTPRIVATE
:
11559 case OMP_CLAUSE_COPYIN
:
11560 case OMP_CLAUSE_COPYPRIVATE
:
11561 case OMP_CLAUSE_FINAL
:
11562 case OMP_CLAUSE_IF
:
11563 case OMP_CLAUSE_NUM_THREADS
:
11564 case OMP_CLAUSE_SCHEDULE
:
11565 case OMP_CLAUSE_UNIFORM
:
11566 case OMP_CLAUSE_DEPEND
:
11567 case OMP_CLAUSE_NUM_TEAMS
:
11568 case OMP_CLAUSE_THREAD_LIMIT
:
11569 case OMP_CLAUSE_DEVICE
:
11570 case OMP_CLAUSE_DIST_SCHEDULE
:
11571 case OMP_CLAUSE_SAFELEN
:
11572 case OMP_CLAUSE_SIMDLEN
:
11573 case OMP_CLAUSE_ORDERED
:
11574 case OMP_CLAUSE_PRIORITY
:
11575 case OMP_CLAUSE_GRAINSIZE
:
11576 case OMP_CLAUSE_NUM_TASKS
:
11577 case OMP_CLAUSE_HINT
:
11578 case OMP_CLAUSE_TO_DECLARE
:
11579 case OMP_CLAUSE_LINK
:
11580 case OMP_CLAUSE_USE_DEVICE_PTR
:
11581 case OMP_CLAUSE_IS_DEVICE_PTR
:
11582 case OMP_CLAUSE__LOOPTEMP_
:
11583 case OMP_CLAUSE__SIMDUID_
:
11584 case OMP_CLAUSE__CILK_FOR_COUNT_
:
11585 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 0));
11588 case OMP_CLAUSE_INDEPENDENT
:
11589 case OMP_CLAUSE_NOWAIT
:
11590 case OMP_CLAUSE_DEFAULT
:
11591 case OMP_CLAUSE_UNTIED
:
11592 case OMP_CLAUSE_MERGEABLE
:
11593 case OMP_CLAUSE_PROC_BIND
:
11594 case OMP_CLAUSE_INBRANCH
:
11595 case OMP_CLAUSE_NOTINBRANCH
:
11596 case OMP_CLAUSE_FOR
:
11597 case OMP_CLAUSE_PARALLEL
:
11598 case OMP_CLAUSE_SECTIONS
:
11599 case OMP_CLAUSE_TASKGROUP
:
11600 case OMP_CLAUSE_NOGROUP
:
11601 case OMP_CLAUSE_THREADS
:
11602 case OMP_CLAUSE_SIMD
:
11603 case OMP_CLAUSE_DEFAULTMAP
:
11604 case OMP_CLAUSE_AUTO
:
11605 case OMP_CLAUSE_SEQ
:
11606 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11608 case OMP_CLAUSE_LASTPRIVATE
:
11609 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
11610 WALK_SUBTREE (OMP_CLAUSE_LASTPRIVATE_STMT (*tp
));
11611 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11613 case OMP_CLAUSE_COLLAPSE
:
11616 for (i
= 0; i
< 3; i
++)
11617 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
11618 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11621 case OMP_CLAUSE_LINEAR
:
11622 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
11623 WALK_SUBTREE (OMP_CLAUSE_LINEAR_STEP (*tp
));
11624 WALK_SUBTREE (OMP_CLAUSE_LINEAR_STMT (*tp
));
11625 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11627 case OMP_CLAUSE_ALIGNED
:
11628 case OMP_CLAUSE_FROM
:
11629 case OMP_CLAUSE_TO
:
11630 case OMP_CLAUSE_MAP
:
11631 case OMP_CLAUSE__CACHE_
:
11632 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
11633 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 1));
11634 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11636 case OMP_CLAUSE_REDUCTION
:
11639 for (i
= 0; i
< 5; i
++)
11640 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
11641 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11645 gcc_unreachable ();
11653 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
11654 But, we only want to walk once. */
11655 len
= (TREE_OPERAND (*tp
, 3) == TREE_OPERAND (*tp
, 1)) ? 2 : 3;
11656 for (i
= 0; i
< len
; ++i
)
11657 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
11658 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
));
11662 /* If this is a TYPE_DECL, walk into the fields of the type that it's
11663 defining. We only want to walk into these fields of a type in this
11664 case and not in the general case of a mere reference to the type.
11666 The criterion is as follows: if the field can be an expression, it
11667 must be walked only here. This should be in keeping with the fields
11668 that are directly gimplified in gimplify_type_sizes in order for the
11669 mark/copy-if-shared/unmark machinery of the gimplifier to work with
11670 variable-sized types.
11672 Note that DECLs get walked as part of processing the BIND_EXPR. */
11673 if (TREE_CODE (DECL_EXPR_DECL (*tp
)) == TYPE_DECL
)
11675 tree
*type_p
= &TREE_TYPE (DECL_EXPR_DECL (*tp
));
11676 if (TREE_CODE (*type_p
) == ERROR_MARK
)
11679 /* Call the function for the type. See if it returns anything or
11680 doesn't want us to continue. If we are to continue, walk both
11681 the normal fields and those for the declaration case. */
11682 result
= (*func
) (type_p
, &walk_subtrees
, data
);
11683 if (result
|| !walk_subtrees
)
11686 /* But do not walk a pointed-to type since it may itself need to
11687 be walked in the declaration case if it isn't anonymous. */
11688 if (!POINTER_TYPE_P (*type_p
))
11690 result
= walk_type_fields (*type_p
, func
, data
, pset
, lh
);
11695 /* If this is a record type, also walk the fields. */
11696 if (RECORD_OR_UNION_TYPE_P (*type_p
))
11700 for (field
= TYPE_FIELDS (*type_p
); field
;
11701 field
= DECL_CHAIN (field
))
11703 /* We'd like to look at the type of the field, but we can
11704 easily get infinite recursion. So assume it's pointed
11705 to elsewhere in the tree. Also, ignore things that
11707 if (TREE_CODE (field
) != FIELD_DECL
)
11710 WALK_SUBTREE (DECL_FIELD_OFFSET (field
));
11711 WALK_SUBTREE (DECL_SIZE (field
));
11712 WALK_SUBTREE (DECL_SIZE_UNIT (field
));
11713 if (TREE_CODE (*type_p
) == QUAL_UNION_TYPE
)
11714 WALK_SUBTREE (DECL_QUALIFIER (field
));
11718 /* Same for scalar types. */
11719 else if (TREE_CODE (*type_p
) == BOOLEAN_TYPE
11720 || TREE_CODE (*type_p
) == ENUMERAL_TYPE
11721 || TREE_CODE (*type_p
) == INTEGER_TYPE
11722 || TREE_CODE (*type_p
) == FIXED_POINT_TYPE
11723 || TREE_CODE (*type_p
) == REAL_TYPE
)
11725 WALK_SUBTREE (TYPE_MIN_VALUE (*type_p
));
11726 WALK_SUBTREE (TYPE_MAX_VALUE (*type_p
));
11729 WALK_SUBTREE (TYPE_SIZE (*type_p
));
11730 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p
));
11735 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code
)))
11739 /* Walk over all the sub-trees of this operand. */
11740 len
= TREE_OPERAND_LENGTH (*tp
);
11742 /* Go through the subtrees. We need to do this in forward order so
11743 that the scope of a FOR_EXPR is handled properly. */
11746 for (i
= 0; i
< len
- 1; ++i
)
11747 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
11748 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
- 1));
11751 /* If this is a type, walk the needed fields in the type. */
11752 else if (TYPE_P (*tp
))
11753 return walk_type_fields (*tp
, func
, data
, pset
, lh
);
11757 /* We didn't find what we were looking for. */
11760 #undef WALK_SUBTREE_TAIL
11762 #undef WALK_SUBTREE
11764 /* Like walk_tree, but does not walk duplicate nodes more than once. */
11767 walk_tree_without_duplicates_1 (tree
*tp
, walk_tree_fn func
, void *data
,
11772 hash_set
<tree
> pset
;
11773 result
= walk_tree_1 (tp
, func
, data
, &pset
, lh
);
11779 tree_block (tree t
)
11781 const enum tree_code_class c
= TREE_CODE_CLASS (TREE_CODE (t
));
11783 if (IS_EXPR_CODE_CLASS (c
))
11784 return LOCATION_BLOCK (t
->exp
.locus
);
11785 gcc_unreachable ();
11790 tree_set_block (tree t
, tree b
)
11792 const enum tree_code_class c
= TREE_CODE_CLASS (TREE_CODE (t
));
11794 if (IS_EXPR_CODE_CLASS (c
))
11797 t
->exp
.locus
= COMBINE_LOCATION_DATA (line_table
, t
->exp
.locus
, b
);
11799 t
->exp
.locus
= LOCATION_LOCUS (t
->exp
.locus
);
11802 gcc_unreachable ();
11805 /* Create a nameless artificial label and put it in the current
11806 function context. The label has a location of LOC. Returns the
11807 newly created label. */
11810 create_artificial_label (location_t loc
)
11812 tree lab
= build_decl (loc
,
11813 LABEL_DECL
, NULL_TREE
, void_type_node
);
11815 DECL_ARTIFICIAL (lab
) = 1;
11816 DECL_IGNORED_P (lab
) = 1;
11817 DECL_CONTEXT (lab
) = current_function_decl
;
11821 /* Given a tree, try to return a useful variable name that we can use
11822 to prefix a temporary that is being assigned the value of the tree.
11823 I.E. given <temp> = &A, return A. */
11828 tree stripped_decl
;
11831 STRIP_NOPS (stripped_decl
);
11832 if (DECL_P (stripped_decl
) && DECL_NAME (stripped_decl
))
11833 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl
));
11834 else if (TREE_CODE (stripped_decl
) == SSA_NAME
)
11836 tree name
= SSA_NAME_IDENTIFIER (stripped_decl
);
11839 return IDENTIFIER_POINTER (name
);
11843 switch (TREE_CODE (stripped_decl
))
11846 return get_name (TREE_OPERAND (stripped_decl
, 0));
11853 /* Return true if TYPE has a variable argument list. */
11856 stdarg_p (const_tree fntype
)
11858 function_args_iterator args_iter
;
11859 tree n
= NULL_TREE
, t
;
11864 FOREACH_FUNCTION_ARGS (fntype
, t
, args_iter
)
11869 return n
!= NULL_TREE
&& n
!= void_type_node
;
11872 /* Return true if TYPE has a prototype. */
11875 prototype_p (const_tree fntype
)
11879 gcc_assert (fntype
!= NULL_TREE
);
11881 t
= TYPE_ARG_TYPES (fntype
);
11882 return (t
!= NULL_TREE
);
11885 /* If BLOCK is inlined from an __attribute__((__artificial__))
11886 routine, return pointer to location from where it has been
11889 block_nonartificial_location (tree block
)
11891 location_t
*ret
= NULL
;
11893 while (block
&& TREE_CODE (block
) == BLOCK
11894 && BLOCK_ABSTRACT_ORIGIN (block
))
11896 tree ao
= BLOCK_ABSTRACT_ORIGIN (block
);
11898 while (TREE_CODE (ao
) == BLOCK
11899 && BLOCK_ABSTRACT_ORIGIN (ao
)
11900 && BLOCK_ABSTRACT_ORIGIN (ao
) != ao
)
11901 ao
= BLOCK_ABSTRACT_ORIGIN (ao
);
11903 if (TREE_CODE (ao
) == FUNCTION_DECL
)
11905 /* If AO is an artificial inline, point RET to the
11906 call site locus at which it has been inlined and continue
11907 the loop, in case AO's caller is also an artificial
11909 if (DECL_DECLARED_INLINE_P (ao
)
11910 && lookup_attribute ("artificial", DECL_ATTRIBUTES (ao
)))
11911 ret
= &BLOCK_SOURCE_LOCATION (block
);
11915 else if (TREE_CODE (ao
) != BLOCK
)
11918 block
= BLOCK_SUPERCONTEXT (block
);
11924 /* If EXP is inlined from an __attribute__((__artificial__))
11925 function, return the location of the original call expression. */
11928 tree_nonartificial_location (tree exp
)
11930 location_t
*loc
= block_nonartificial_location (TREE_BLOCK (exp
));
11935 return EXPR_LOCATION (exp
);
11939 /* These are the hash table functions for the hash table of OPTIMIZATION_NODEq
11942 /* Return the hash code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
11945 cl_option_hasher::hash (tree x
)
11947 const_tree
const t
= x
;
11951 hashval_t hash
= 0;
11953 if (TREE_CODE (t
) == OPTIMIZATION_NODE
)
11955 p
= (const char *)TREE_OPTIMIZATION (t
);
11956 len
= sizeof (struct cl_optimization
);
11959 else if (TREE_CODE (t
) == TARGET_OPTION_NODE
)
11960 return cl_target_option_hash (TREE_TARGET_OPTION (t
));
11963 gcc_unreachable ();
11965 /* assume most opt flags are just 0/1, some are 2-3, and a few might be
11967 for (i
= 0; i
< len
; i
++)
11969 hash
= (hash
<< 4) ^ ((i
<< 2) | p
[i
]);
11974 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
11975 TARGET_OPTION tree node) is the same as that given by *Y, which is the
11979 cl_option_hasher::equal (tree x
, tree y
)
11981 const_tree
const xt
= x
;
11982 const_tree
const yt
= y
;
11987 if (TREE_CODE (xt
) != TREE_CODE (yt
))
11990 if (TREE_CODE (xt
) == OPTIMIZATION_NODE
)
11992 xp
= (const char *)TREE_OPTIMIZATION (xt
);
11993 yp
= (const char *)TREE_OPTIMIZATION (yt
);
11994 len
= sizeof (struct cl_optimization
);
11997 else if (TREE_CODE (xt
) == TARGET_OPTION_NODE
)
11999 return cl_target_option_eq (TREE_TARGET_OPTION (xt
),
12000 TREE_TARGET_OPTION (yt
));
12004 gcc_unreachable ();
12006 return (memcmp (xp
, yp
, len
) == 0);
12009 /* Build an OPTIMIZATION_NODE based on the options in OPTS. */
12012 build_optimization_node (struct gcc_options
*opts
)
12016 /* Use the cache of optimization nodes. */
12018 cl_optimization_save (TREE_OPTIMIZATION (cl_optimization_node
),
12021 tree
*slot
= cl_option_hash_table
->find_slot (cl_optimization_node
, INSERT
);
12025 /* Insert this one into the hash table. */
12026 t
= cl_optimization_node
;
12029 /* Make a new node for next time round. */
12030 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
12036 /* Build a TARGET_OPTION_NODE based on the options in OPTS. */
12039 build_target_option_node (struct gcc_options
*opts
)
12043 /* Use the cache of optimization nodes. */
12045 cl_target_option_save (TREE_TARGET_OPTION (cl_target_option_node
),
12048 tree
*slot
= cl_option_hash_table
->find_slot (cl_target_option_node
, INSERT
);
12052 /* Insert this one into the hash table. */
12053 t
= cl_target_option_node
;
12056 /* Make a new node for next time round. */
12057 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
12063 /* Clear TREE_TARGET_GLOBALS of all TARGET_OPTION_NODE trees,
12064 so that they aren't saved during PCH writing. */
12067 prepare_target_option_nodes_for_pch (void)
12069 hash_table
<cl_option_hasher
>::iterator iter
= cl_option_hash_table
->begin ();
12070 for (; iter
!= cl_option_hash_table
->end (); ++iter
)
12071 if (TREE_CODE (*iter
) == TARGET_OPTION_NODE
)
12072 TREE_TARGET_GLOBALS (*iter
) = NULL
;
12075 /* Determine the "ultimate origin" of a block. The block may be an inlined
12076 instance of an inlined instance of a block which is local to an inline
12077 function, so we have to trace all of the way back through the origin chain
12078 to find out what sort of node actually served as the original seed for the
12082 block_ultimate_origin (const_tree block
)
12084 tree immediate_origin
= BLOCK_ABSTRACT_ORIGIN (block
);
12086 /* BLOCK_ABSTRACT_ORIGIN can point to itself; ignore that if
12087 we're trying to output the abstract instance of this function. */
12088 if (BLOCK_ABSTRACT (block
) && immediate_origin
== block
)
12091 if (immediate_origin
== NULL_TREE
)
12096 tree lookahead
= immediate_origin
;
12100 ret_val
= lookahead
;
12101 lookahead
= (TREE_CODE (ret_val
) == BLOCK
12102 ? BLOCK_ABSTRACT_ORIGIN (ret_val
) : NULL
);
12104 while (lookahead
!= NULL
&& lookahead
!= ret_val
);
12106 /* The block's abstract origin chain may not be the *ultimate* origin of
12107 the block. It could lead to a DECL that has an abstract origin set.
12108 If so, we want that DECL's abstract origin (which is what DECL_ORIGIN
12109 will give us if it has one). Note that DECL's abstract origins are
12110 supposed to be the most distant ancestor (or so decl_ultimate_origin
12111 claims), so we don't need to loop following the DECL origins. */
12112 if (DECL_P (ret_val
))
12113 return DECL_ORIGIN (ret_val
);
12119 /* Return true iff conversion from INNER_TYPE to OUTER_TYPE generates
12123 tree_nop_conversion_p (const_tree outer_type
, const_tree inner_type
)
12125 /* Use precision rather then machine mode when we can, which gives
12126 the correct answer even for submode (bit-field) types. */
12127 if ((INTEGRAL_TYPE_P (outer_type
)
12128 || POINTER_TYPE_P (outer_type
)
12129 || TREE_CODE (outer_type
) == OFFSET_TYPE
)
12130 && (INTEGRAL_TYPE_P (inner_type
)
12131 || POINTER_TYPE_P (inner_type
)
12132 || TREE_CODE (inner_type
) == OFFSET_TYPE
))
12133 return TYPE_PRECISION (outer_type
) == TYPE_PRECISION (inner_type
);
12135 /* Otherwise fall back on comparing machine modes (e.g. for
12136 aggregate types, floats). */
12137 return TYPE_MODE (outer_type
) == TYPE_MODE (inner_type
);
12140 /* Return true iff conversion in EXP generates no instruction. Mark
12141 it inline so that we fully inline into the stripping functions even
12142 though we have two uses of this function. */
12145 tree_nop_conversion (const_tree exp
)
12147 tree outer_type
, inner_type
;
12149 if (!CONVERT_EXPR_P (exp
)
12150 && TREE_CODE (exp
) != NON_LVALUE_EXPR
)
12152 if (TREE_OPERAND (exp
, 0) == error_mark_node
)
12155 outer_type
= TREE_TYPE (exp
);
12156 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
12161 return tree_nop_conversion_p (outer_type
, inner_type
);
12164 /* Return true iff conversion in EXP generates no instruction. Don't
12165 consider conversions changing the signedness. */
12168 tree_sign_nop_conversion (const_tree exp
)
12170 tree outer_type
, inner_type
;
12172 if (!tree_nop_conversion (exp
))
12175 outer_type
= TREE_TYPE (exp
);
12176 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
12178 return (TYPE_UNSIGNED (outer_type
) == TYPE_UNSIGNED (inner_type
)
12179 && POINTER_TYPE_P (outer_type
) == POINTER_TYPE_P (inner_type
));
12182 /* Strip conversions from EXP according to tree_nop_conversion and
12183 return the resulting expression. */
12186 tree_strip_nop_conversions (tree exp
)
12188 while (tree_nop_conversion (exp
))
12189 exp
= TREE_OPERAND (exp
, 0);
12193 /* Strip conversions from EXP according to tree_sign_nop_conversion
12194 and return the resulting expression. */
12197 tree_strip_sign_nop_conversions (tree exp
)
12199 while (tree_sign_nop_conversion (exp
))
12200 exp
= TREE_OPERAND (exp
, 0);
12204 /* Avoid any floating point extensions from EXP. */
12206 strip_float_extensions (tree exp
)
12208 tree sub
, expt
, subt
;
12210 /* For floating point constant look up the narrowest type that can hold
12211 it properly and handle it like (type)(narrowest_type)constant.
12212 This way we can optimize for instance a=a*2.0 where "a" is float
12213 but 2.0 is double constant. */
12214 if (TREE_CODE (exp
) == REAL_CST
&& !DECIMAL_FLOAT_TYPE_P (TREE_TYPE (exp
)))
12216 REAL_VALUE_TYPE orig
;
12219 orig
= TREE_REAL_CST (exp
);
12220 if (TYPE_PRECISION (TREE_TYPE (exp
)) > TYPE_PRECISION (float_type_node
)
12221 && exact_real_truncate (TYPE_MODE (float_type_node
), &orig
))
12222 type
= float_type_node
;
12223 else if (TYPE_PRECISION (TREE_TYPE (exp
))
12224 > TYPE_PRECISION (double_type_node
)
12225 && exact_real_truncate (TYPE_MODE (double_type_node
), &orig
))
12226 type
= double_type_node
;
12228 return build_real_truncate (type
, orig
);
12231 if (!CONVERT_EXPR_P (exp
))
12234 sub
= TREE_OPERAND (exp
, 0);
12235 subt
= TREE_TYPE (sub
);
12236 expt
= TREE_TYPE (exp
);
12238 if (!FLOAT_TYPE_P (subt
))
12241 if (DECIMAL_FLOAT_TYPE_P (expt
) != DECIMAL_FLOAT_TYPE_P (subt
))
12244 if (TYPE_PRECISION (subt
) > TYPE_PRECISION (expt
))
12247 return strip_float_extensions (sub
);
12250 /* Strip out all handled components that produce invariant
12254 strip_invariant_refs (const_tree op
)
12256 while (handled_component_p (op
))
12258 switch (TREE_CODE (op
))
12261 case ARRAY_RANGE_REF
:
12262 if (!is_gimple_constant (TREE_OPERAND (op
, 1))
12263 || TREE_OPERAND (op
, 2) != NULL_TREE
12264 || TREE_OPERAND (op
, 3) != NULL_TREE
)
12268 case COMPONENT_REF
:
12269 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
12275 op
= TREE_OPERAND (op
, 0);
12281 static GTY(()) tree gcc_eh_personality_decl
;
12283 /* Return the GCC personality function decl. */
12286 lhd_gcc_personality (void)
12288 if (!gcc_eh_personality_decl
)
12289 gcc_eh_personality_decl
= build_personality_function ("gcc");
12290 return gcc_eh_personality_decl
;
12293 /* TARGET is a call target of GIMPLE call statement
12294 (obtained by gimple_call_fn). Return true if it is
12295 OBJ_TYPE_REF representing an virtual call of C++ method.
12296 (As opposed to OBJ_TYPE_REF representing objc calls
12297 through a cast where middle-end devirtualization machinery
12301 virtual_method_call_p (const_tree target
)
12303 if (TREE_CODE (target
) != OBJ_TYPE_REF
)
12305 tree t
= TREE_TYPE (target
);
12306 gcc_checking_assert (TREE_CODE (t
) == POINTER_TYPE
);
12308 if (TREE_CODE (t
) == FUNCTION_TYPE
)
12310 gcc_checking_assert (TREE_CODE (t
) == METHOD_TYPE
);
12311 /* If we do not have BINFO associated, it means that type was built
12312 without devirtualization enabled. Do not consider this a virtual
12314 if (!TYPE_BINFO (obj_type_ref_class (target
)))
12319 /* REF is OBJ_TYPE_REF, return the class the ref corresponds to. */
12322 obj_type_ref_class (const_tree ref
)
12324 gcc_checking_assert (TREE_CODE (ref
) == OBJ_TYPE_REF
);
12325 ref
= TREE_TYPE (ref
);
12326 gcc_checking_assert (TREE_CODE (ref
) == POINTER_TYPE
);
12327 ref
= TREE_TYPE (ref
);
12328 /* We look for type THIS points to. ObjC also builds
12329 OBJ_TYPE_REF with non-method calls, Their first parameter
12330 ID however also corresponds to class type. */
12331 gcc_checking_assert (TREE_CODE (ref
) == METHOD_TYPE
12332 || TREE_CODE (ref
) == FUNCTION_TYPE
);
12333 ref
= TREE_VALUE (TYPE_ARG_TYPES (ref
));
12334 gcc_checking_assert (TREE_CODE (ref
) == POINTER_TYPE
);
12335 return TREE_TYPE (ref
);
12338 /* Lookup sub-BINFO of BINFO of TYPE at offset POS. */
12341 lookup_binfo_at_offset (tree binfo
, tree type
, HOST_WIDE_INT pos
)
12344 tree base_binfo
, b
;
12346 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
12347 if (pos
== tree_to_shwi (BINFO_OFFSET (base_binfo
))
12348 && types_same_for_odr (TREE_TYPE (base_binfo
), type
))
12350 else if ((b
= lookup_binfo_at_offset (base_binfo
, type
, pos
)) != NULL
)
12355 /* Try to find a base info of BINFO that would have its field decl at offset
12356 OFFSET within the BINFO type and which is of EXPECTED_TYPE. If it can be
12357 found, return, otherwise return NULL_TREE. */
12360 get_binfo_at_offset (tree binfo
, HOST_WIDE_INT offset
, tree expected_type
)
12362 tree type
= BINFO_TYPE (binfo
);
12366 HOST_WIDE_INT pos
, size
;
12370 if (types_same_for_odr (type
, expected_type
))
12375 for (fld
= TYPE_FIELDS (type
); fld
; fld
= DECL_CHAIN (fld
))
12377 if (TREE_CODE (fld
) != FIELD_DECL
|| !DECL_ARTIFICIAL (fld
))
12380 pos
= int_bit_position (fld
);
12381 size
= tree_to_uhwi (DECL_SIZE (fld
));
12382 if (pos
<= offset
&& (pos
+ size
) > offset
)
12385 if (!fld
|| TREE_CODE (TREE_TYPE (fld
)) != RECORD_TYPE
)
12388 /* Offset 0 indicates the primary base, whose vtable contents are
12389 represented in the binfo for the derived class. */
12390 else if (offset
!= 0)
12392 tree found_binfo
= NULL
, base_binfo
;
12393 /* Offsets in BINFO are in bytes relative to the whole structure
12394 while POS is in bits relative to the containing field. */
12395 int binfo_offset
= (tree_to_shwi (BINFO_OFFSET (binfo
)) + pos
12398 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
12399 if (tree_to_shwi (BINFO_OFFSET (base_binfo
)) == binfo_offset
12400 && types_same_for_odr (TREE_TYPE (base_binfo
), TREE_TYPE (fld
)))
12402 found_binfo
= base_binfo
;
12406 binfo
= found_binfo
;
12408 binfo
= lookup_binfo_at_offset (binfo
, TREE_TYPE (fld
),
12412 type
= TREE_TYPE (fld
);
12417 /* Returns true if X is a typedef decl. */
12420 is_typedef_decl (const_tree x
)
12422 return (x
&& TREE_CODE (x
) == TYPE_DECL
12423 && DECL_ORIGINAL_TYPE (x
) != NULL_TREE
);
12426 /* Returns true iff TYPE is a type variant created for a typedef. */
12429 typedef_variant_p (const_tree type
)
12431 return is_typedef_decl (TYPE_NAME (type
));
12434 /* Warn about a use of an identifier which was marked deprecated. */
12436 warn_deprecated_use (tree node
, tree attr
)
12440 if (node
== 0 || !warn_deprecated_decl
)
12446 attr
= DECL_ATTRIBUTES (node
);
12447 else if (TYPE_P (node
))
12449 tree decl
= TYPE_STUB_DECL (node
);
12451 attr
= lookup_attribute ("deprecated",
12452 TYPE_ATTRIBUTES (TREE_TYPE (decl
)));
12457 attr
= lookup_attribute ("deprecated", attr
);
12460 msg
= TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr
)));
12468 w
= warning (OPT_Wdeprecated_declarations
,
12469 "%qD is deprecated: %s", node
, msg
);
12471 w
= warning (OPT_Wdeprecated_declarations
,
12472 "%qD is deprecated", node
);
12474 inform (DECL_SOURCE_LOCATION (node
), "declared here");
12476 else if (TYPE_P (node
))
12478 tree what
= NULL_TREE
;
12479 tree decl
= TYPE_STUB_DECL (node
);
12481 if (TYPE_NAME (node
))
12483 if (TREE_CODE (TYPE_NAME (node
)) == IDENTIFIER_NODE
)
12484 what
= TYPE_NAME (node
);
12485 else if (TREE_CODE (TYPE_NAME (node
)) == TYPE_DECL
12486 && DECL_NAME (TYPE_NAME (node
)))
12487 what
= DECL_NAME (TYPE_NAME (node
));
12495 w
= warning (OPT_Wdeprecated_declarations
,
12496 "%qE is deprecated: %s", what
, msg
);
12498 w
= warning (OPT_Wdeprecated_declarations
,
12499 "%qE is deprecated", what
);
12504 w
= warning (OPT_Wdeprecated_declarations
,
12505 "type is deprecated: %s", msg
);
12507 w
= warning (OPT_Wdeprecated_declarations
,
12508 "type is deprecated");
12511 inform (DECL_SOURCE_LOCATION (decl
), "declared here");
12518 warning (OPT_Wdeprecated_declarations
, "%qE is deprecated: %s",
12521 warning (OPT_Wdeprecated_declarations
, "%qE is deprecated", what
);
12526 warning (OPT_Wdeprecated_declarations
, "type is deprecated: %s",
12529 warning (OPT_Wdeprecated_declarations
, "type is deprecated");
12535 /* Return true if REF has a COMPONENT_REF with a bit-field field declaration
12536 somewhere in it. */
12539 contains_bitfld_component_ref_p (const_tree ref
)
12541 while (handled_component_p (ref
))
12543 if (TREE_CODE (ref
) == COMPONENT_REF
12544 && DECL_BIT_FIELD (TREE_OPERAND (ref
, 1)))
12546 ref
= TREE_OPERAND (ref
, 0);
12552 /* Try to determine whether a TRY_CATCH expression can fall through.
12553 This is a subroutine of block_may_fallthru. */
12556 try_catch_may_fallthru (const_tree stmt
)
12558 tree_stmt_iterator i
;
12560 /* If the TRY block can fall through, the whole TRY_CATCH can
12562 if (block_may_fallthru (TREE_OPERAND (stmt
, 0)))
12565 i
= tsi_start (TREE_OPERAND (stmt
, 1));
12566 switch (TREE_CODE (tsi_stmt (i
)))
12569 /* We expect to see a sequence of CATCH_EXPR trees, each with a
12570 catch expression and a body. The whole TRY_CATCH may fall
12571 through iff any of the catch bodies falls through. */
12572 for (; !tsi_end_p (i
); tsi_next (&i
))
12574 if (block_may_fallthru (CATCH_BODY (tsi_stmt (i
))))
12579 case EH_FILTER_EXPR
:
12580 /* The exception filter expression only matters if there is an
12581 exception. If the exception does not match EH_FILTER_TYPES,
12582 we will execute EH_FILTER_FAILURE, and we will fall through
12583 if that falls through. If the exception does match
12584 EH_FILTER_TYPES, the stack unwinder will continue up the
12585 stack, so we will not fall through. We don't know whether we
12586 will throw an exception which matches EH_FILTER_TYPES or not,
12587 so we just ignore EH_FILTER_TYPES and assume that we might
12588 throw an exception which doesn't match. */
12589 return block_may_fallthru (EH_FILTER_FAILURE (tsi_stmt (i
)));
12592 /* This case represents statements to be executed when an
12593 exception occurs. Those statements are implicitly followed
12594 by a RESX statement to resume execution after the exception.
12595 So in this case the TRY_CATCH never falls through. */
12600 /* Try to determine if we can fall out of the bottom of BLOCK. This guess
12601 need not be 100% accurate; simply be conservative and return true if we
12602 don't know. This is used only to avoid stupidly generating extra code.
12603 If we're wrong, we'll just delete the extra code later. */
12606 block_may_fallthru (const_tree block
)
12608 /* This CONST_CAST is okay because expr_last returns its argument
12609 unmodified and we assign it to a const_tree. */
12610 const_tree stmt
= expr_last (CONST_CAST_TREE (block
));
12612 switch (stmt
? TREE_CODE (stmt
) : ERROR_MARK
)
12616 /* Easy cases. If the last statement of the block implies
12617 control transfer, then we can't fall through. */
12621 /* If SWITCH_LABELS is set, this is lowered, and represents a
12622 branch to a selected label and hence can not fall through.
12623 Otherwise SWITCH_BODY is set, and the switch can fall
12625 return SWITCH_LABELS (stmt
) == NULL_TREE
;
12628 if (block_may_fallthru (COND_EXPR_THEN (stmt
)))
12630 return block_may_fallthru (COND_EXPR_ELSE (stmt
));
12633 return block_may_fallthru (BIND_EXPR_BODY (stmt
));
12635 case TRY_CATCH_EXPR
:
12636 return try_catch_may_fallthru (stmt
);
12638 case TRY_FINALLY_EXPR
:
12639 /* The finally clause is always executed after the try clause,
12640 so if it does not fall through, then the try-finally will not
12641 fall through. Otherwise, if the try clause does not fall
12642 through, then when the finally clause falls through it will
12643 resume execution wherever the try clause was going. So the
12644 whole try-finally will only fall through if both the try
12645 clause and the finally clause fall through. */
12646 return (block_may_fallthru (TREE_OPERAND (stmt
, 0))
12647 && block_may_fallthru (TREE_OPERAND (stmt
, 1)));
12650 if (TREE_CODE (TREE_OPERAND (stmt
, 1)) == CALL_EXPR
)
12651 stmt
= TREE_OPERAND (stmt
, 1);
12657 /* Functions that do not return do not fall through. */
12658 return (call_expr_flags (stmt
) & ECF_NORETURN
) == 0;
12660 case CLEANUP_POINT_EXPR
:
12661 return block_may_fallthru (TREE_OPERAND (stmt
, 0));
12664 return block_may_fallthru (TREE_OPERAND (stmt
, 1));
12670 return lang_hooks
.block_may_fallthru (stmt
);
12674 /* True if we are using EH to handle cleanups. */
12675 static bool using_eh_for_cleanups_flag
= false;
12677 /* This routine is called from front ends to indicate eh should be used for
12680 using_eh_for_cleanups (void)
12682 using_eh_for_cleanups_flag
= true;
12685 /* Query whether EH is used for cleanups. */
12687 using_eh_for_cleanups_p (void)
12689 return using_eh_for_cleanups_flag
;
12692 /* Wrapper for tree_code_name to ensure that tree code is valid */
12694 get_tree_code_name (enum tree_code code
)
12696 const char *invalid
= "<invalid tree code>";
12698 if (code
>= MAX_TREE_CODES
)
12701 return tree_code_name
[code
];
12704 /* Drops the TREE_OVERFLOW flag from T. */
12707 drop_tree_overflow (tree t
)
12709 gcc_checking_assert (TREE_OVERFLOW (t
));
12711 /* For tree codes with a sharing machinery re-build the result. */
12712 if (TREE_CODE (t
) == INTEGER_CST
)
12713 return wide_int_to_tree (TREE_TYPE (t
), t
);
12715 /* Otherwise, as all tcc_constants are possibly shared, copy the node
12716 and drop the flag. */
12718 TREE_OVERFLOW (t
) = 0;
12722 /* Given a memory reference expression T, return its base address.
12723 The base address of a memory reference expression is the main
12724 object being referenced. For instance, the base address for
12725 'array[i].fld[j]' is 'array'. You can think of this as stripping
12726 away the offset part from a memory address.
12728 This function calls handled_component_p to strip away all the inner
12729 parts of the memory reference until it reaches the base object. */
12732 get_base_address (tree t
)
12734 while (handled_component_p (t
))
12735 t
= TREE_OPERAND (t
, 0);
12737 if ((TREE_CODE (t
) == MEM_REF
12738 || TREE_CODE (t
) == TARGET_MEM_REF
)
12739 && TREE_CODE (TREE_OPERAND (t
, 0)) == ADDR_EXPR
)
12740 t
= TREE_OPERAND (TREE_OPERAND (t
, 0), 0);
12742 /* ??? Either the alias oracle or all callers need to properly deal
12743 with WITH_SIZE_EXPRs before we can look through those. */
12744 if (TREE_CODE (t
) == WITH_SIZE_EXPR
)
12750 /* Return a tree of sizetype representing the size, in bytes, of the element
12751 of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
12754 array_ref_element_size (tree exp
)
12756 tree aligned_size
= TREE_OPERAND (exp
, 3);
12757 tree elmt_type
= TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp
, 0)));
12758 location_t loc
= EXPR_LOCATION (exp
);
12760 /* If a size was specified in the ARRAY_REF, it's the size measured
12761 in alignment units of the element type. So multiply by that value. */
12764 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
12765 sizetype from another type of the same width and signedness. */
12766 if (TREE_TYPE (aligned_size
) != sizetype
)
12767 aligned_size
= fold_convert_loc (loc
, sizetype
, aligned_size
);
12768 return size_binop_loc (loc
, MULT_EXPR
, aligned_size
,
12769 size_int (TYPE_ALIGN_UNIT (elmt_type
)));
12772 /* Otherwise, take the size from that of the element type. Substitute
12773 any PLACEHOLDER_EXPR that we have. */
12775 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_SIZE_UNIT (elmt_type
), exp
);
12778 /* Return a tree representing the lower bound of the array mentioned in
12779 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
12782 array_ref_low_bound (tree exp
)
12784 tree domain_type
= TYPE_DOMAIN (TREE_TYPE (TREE_OPERAND (exp
, 0)));
12786 /* If a lower bound is specified in EXP, use it. */
12787 if (TREE_OPERAND (exp
, 2))
12788 return TREE_OPERAND (exp
, 2);
12790 /* Otherwise, if there is a domain type and it has a lower bound, use it,
12791 substituting for a PLACEHOLDER_EXPR as needed. */
12792 if (domain_type
&& TYPE_MIN_VALUE (domain_type
))
12793 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_MIN_VALUE (domain_type
), exp
);
12795 /* Otherwise, return a zero of the appropriate type. */
12796 return build_int_cst (TREE_TYPE (TREE_OPERAND (exp
, 1)), 0);
12799 /* Return a tree representing the upper bound of the array mentioned in
12800 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
12803 array_ref_up_bound (tree exp
)
12805 tree domain_type
= TYPE_DOMAIN (TREE_TYPE (TREE_OPERAND (exp
, 0)));
12807 /* If there is a domain type and it has an upper bound, use it, substituting
12808 for a PLACEHOLDER_EXPR as needed. */
12809 if (domain_type
&& TYPE_MAX_VALUE (domain_type
))
12810 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_MAX_VALUE (domain_type
), exp
);
12812 /* Otherwise fail. */
12816 /* Returns true if REF is an array reference to an array at the end of
12817 a structure. If this is the case, the array may be allocated larger
12818 than its upper bound implies. */
12821 array_at_struct_end_p (tree ref
)
12823 if (TREE_CODE (ref
) != ARRAY_REF
12824 && TREE_CODE (ref
) != ARRAY_RANGE_REF
)
12827 while (handled_component_p (ref
))
12829 /* If the reference chain contains a component reference to a
12830 non-union type and there follows another field the reference
12831 is not at the end of a structure. */
12832 if (TREE_CODE (ref
) == COMPONENT_REF
12833 && TREE_CODE (TREE_TYPE (TREE_OPERAND (ref
, 0))) == RECORD_TYPE
)
12835 tree nextf
= DECL_CHAIN (TREE_OPERAND (ref
, 1));
12836 while (nextf
&& TREE_CODE (nextf
) != FIELD_DECL
)
12837 nextf
= DECL_CHAIN (nextf
);
12842 ref
= TREE_OPERAND (ref
, 0);
12845 /* If the reference is based on a declared entity, the size of the array
12846 is constrained by its given domain. */
12853 /* Return a tree representing the offset, in bytes, of the field referenced
12854 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
12857 component_ref_field_offset (tree exp
)
12859 tree aligned_offset
= TREE_OPERAND (exp
, 2);
12860 tree field
= TREE_OPERAND (exp
, 1);
12861 location_t loc
= EXPR_LOCATION (exp
);
12863 /* If an offset was specified in the COMPONENT_REF, it's the offset measured
12864 in units of DECL_OFFSET_ALIGN / BITS_PER_UNIT. So multiply by that
12866 if (aligned_offset
)
12868 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
12869 sizetype from another type of the same width and signedness. */
12870 if (TREE_TYPE (aligned_offset
) != sizetype
)
12871 aligned_offset
= fold_convert_loc (loc
, sizetype
, aligned_offset
);
12872 return size_binop_loc (loc
, MULT_EXPR
, aligned_offset
,
12873 size_int (DECL_OFFSET_ALIGN (field
)
12877 /* Otherwise, take the offset from that of the field. Substitute
12878 any PLACEHOLDER_EXPR that we have. */
12880 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (DECL_FIELD_OFFSET (field
), exp
);
12883 /* Return the machine mode of T. For vectors, returns the mode of the
12884 inner type. The main use case is to feed the result to HONOR_NANS,
12885 avoiding the BLKmode that a direct TYPE_MODE (T) might return. */
12888 element_mode (const_tree t
)
12892 if (VECTOR_TYPE_P (t
) || TREE_CODE (t
) == COMPLEX_TYPE
)
12894 return TYPE_MODE (t
);
12898 /* Veirfy that basic properties of T match TV and thus T can be a variant of
12899 TV. TV should be the more specified variant (i.e. the main variant). */
12902 verify_type_variant (const_tree t
, tree tv
)
12904 /* Type variant can differ by:
12906 - TYPE_QUALS: TYPE_READONLY, TYPE_VOLATILE, TYPE_ATOMIC, TYPE_RESTRICT,
12907 ENCODE_QUAL_ADDR_SPACE.
12908 - main variant may be TYPE_COMPLETE_P and variant types !TYPE_COMPLETE_P
12909 in this case some values may not be set in the variant types
12910 (see TYPE_COMPLETE_P checks).
12911 - it is possible to have TYPE_ARTIFICIAL variant of non-artifical type
12912 - by TYPE_NAME and attributes (i.e. when variant originate by typedef)
12913 - TYPE_CANONICAL (TYPE_ALIAS_SET is the same among variants)
12914 - by the alignment: TYPE_ALIGN and TYPE_USER_ALIGN
12915 - during LTO by TYPE_CONTEXT if type is TYPE_FILE_SCOPE_P
12916 this is necessary to make it possible to merge types form different TUs
12917 - arrays, pointers and references may have TREE_TYPE that is a variant
12918 of TREE_TYPE of their main variants.
12919 - aggregates may have new TYPE_FIELDS list that list variants of
12920 the main variant TYPE_FIELDS.
12921 - vector types may differ by TYPE_VECTOR_OPAQUE
12922 - TYPE_METHODS is always NULL for vairant types and maintained for
12926 /* Convenience macro for matching individual fields. */
12927 #define verify_variant_match(flag) \
12929 if (flag (tv) != flag (t)) \
12931 error ("type variant differs by " #flag "."); \
12937 /* tree_base checks. */
12939 verify_variant_match (TREE_CODE
);
12940 /* FIXME: Ada builds non-artificial variants of artificial types. */
12941 if (TYPE_ARTIFICIAL (tv
) && 0)
12942 verify_variant_match (TYPE_ARTIFICIAL
);
12943 if (POINTER_TYPE_P (tv
))
12944 verify_variant_match (TYPE_REF_CAN_ALIAS_ALL
);
12945 /* FIXME: TYPE_SIZES_GIMPLIFIED may differs for Ada build. */
12946 verify_variant_match (TYPE_UNSIGNED
);
12947 verify_variant_match (TYPE_ALIGN_OK
);
12948 verify_variant_match (TYPE_PACKED
);
12949 if (TREE_CODE (t
) == REFERENCE_TYPE
)
12950 verify_variant_match (TYPE_REF_IS_RVALUE
);
12951 verify_variant_match (TYPE_SATURATING
);
12952 /* FIXME: This check trigger during libstdc++ build. */
12953 if (RECORD_OR_UNION_TYPE_P (t
) && COMPLETE_TYPE_P (t
) && 0)
12954 verify_variant_match (TYPE_FINAL_P
);
12956 /* tree_type_common checks. */
12958 if (COMPLETE_TYPE_P (t
))
12960 verify_variant_match (TYPE_SIZE
);
12961 verify_variant_match (TYPE_MODE
);
12962 if (TYPE_SIZE_UNIT (t
) != TYPE_SIZE_UNIT (tv
)
12963 /* FIXME: ideally we should compare pointer equality, but java FE
12964 produce variants where size is INTEGER_CST of different type (int
12965 wrt size_type) during libjava biuld. */
12966 && !operand_equal_p (TYPE_SIZE_UNIT (t
), TYPE_SIZE_UNIT (tv
), 0))
12968 error ("type variant has different TYPE_SIZE_UNIT");
12970 error ("type variant's TYPE_SIZE_UNIT");
12971 debug_tree (TYPE_SIZE_UNIT (tv
));
12972 error ("type's TYPE_SIZE_UNIT");
12973 debug_tree (TYPE_SIZE_UNIT (t
));
12977 verify_variant_match (TYPE_PRECISION
);
12978 verify_variant_match (TYPE_NEEDS_CONSTRUCTING
);
12979 if (RECORD_OR_UNION_TYPE_P (t
))
12980 verify_variant_match (TYPE_TRANSPARENT_AGGR
);
12981 else if (TREE_CODE (t
) == ARRAY_TYPE
)
12982 verify_variant_match (TYPE_NONALIASED_COMPONENT
);
12983 /* During LTO we merge variant lists from diferent translation units
12984 that may differ BY TYPE_CONTEXT that in turn may point
12985 to TRANSLATION_UNIT_DECL.
12986 Ada also builds variants of types with different TYPE_CONTEXT. */
12987 if ((!in_lto_p
|| !TYPE_FILE_SCOPE_P (t
)) && 0)
12988 verify_variant_match (TYPE_CONTEXT
);
12989 verify_variant_match (TYPE_STRING_FLAG
);
12990 if (TYPE_ALIAS_SET_KNOWN_P (t
) && TYPE_ALIAS_SET_KNOWN_P (tv
))
12991 verify_variant_match (TYPE_ALIAS_SET
);
12993 /* tree_type_non_common checks. */
12995 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
12996 and dangle the pointer from time to time. */
12997 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_VFIELD (t
) != TYPE_VFIELD (tv
)
12998 && (in_lto_p
|| !TYPE_VFIELD (tv
)
12999 || TREE_CODE (TYPE_VFIELD (tv
)) != TREE_LIST
))
13001 error ("type variant has different TYPE_VFIELD");
13005 if ((TREE_CODE (t
) == ENUMERAL_TYPE
&& COMPLETE_TYPE_P (t
))
13006 || TREE_CODE (t
) == INTEGER_TYPE
13007 || TREE_CODE (t
) == BOOLEAN_TYPE
13008 || TREE_CODE (t
) == REAL_TYPE
13009 || TREE_CODE (t
) == FIXED_POINT_TYPE
)
13011 verify_variant_match (TYPE_MAX_VALUE
);
13012 verify_variant_match (TYPE_MIN_VALUE
);
13014 if (TREE_CODE (t
) == METHOD_TYPE
)
13015 verify_variant_match (TYPE_METHOD_BASETYPE
);
13016 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_METHODS (t
))
13018 error ("type variant has TYPE_METHODS");
13022 if (TREE_CODE (t
) == OFFSET_TYPE
)
13023 verify_variant_match (TYPE_OFFSET_BASETYPE
);
13024 if (TREE_CODE (t
) == ARRAY_TYPE
)
13025 verify_variant_match (TYPE_ARRAY_MAX_SIZE
);
13026 /* FIXME: Be lax and allow TYPE_BINFO to be missing in variant types
13027 or even type's main variant. This is needed to make bootstrap pass
13028 and the bug seems new in GCC 5.
13029 C++ FE should be updated to make this consistent and we should check
13030 that TYPE_BINFO is always NULL for !COMPLETE_TYPE_P and otherwise there
13031 is a match with main variant.
13033 Also disable the check for Java for now because of parser hack that builds
13034 first an dummy BINFO and then sometimes replace it by real BINFO in some
13036 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_BINFO (t
) && TYPE_BINFO (tv
)
13037 && TYPE_BINFO (t
) != TYPE_BINFO (tv
)
13038 /* FIXME: Java sometimes keep dump TYPE_BINFOs on variant types.
13039 Since there is no cheap way to tell C++/Java type w/o LTO, do checking
13040 at LTO time only. */
13041 && (in_lto_p
&& odr_type_p (t
)))
13043 error ("type variant has different TYPE_BINFO");
13045 error ("type variant's TYPE_BINFO");
13046 debug_tree (TYPE_BINFO (tv
));
13047 error ("type's TYPE_BINFO");
13048 debug_tree (TYPE_BINFO (t
));
13052 /* Check various uses of TYPE_VALUES_RAW. */
13053 if (TREE_CODE (t
) == ENUMERAL_TYPE
)
13054 verify_variant_match (TYPE_VALUES
);
13055 else if (TREE_CODE (t
) == ARRAY_TYPE
)
13056 verify_variant_match (TYPE_DOMAIN
);
13057 /* Permit incomplete variants of complete type. While FEs may complete
13058 all variants, this does not happen for C++ templates in all cases. */
13059 else if (RECORD_OR_UNION_TYPE_P (t
)
13060 && COMPLETE_TYPE_P (t
)
13061 && TYPE_FIELDS (t
) != TYPE_FIELDS (tv
))
13065 /* Fortran builds qualified variants as new records with items of
13066 qualified type. Verify that they looks same. */
13067 for (f1
= TYPE_FIELDS (t
), f2
= TYPE_FIELDS (tv
);
13069 f1
= TREE_CHAIN (f1
), f2
= TREE_CHAIN (f2
))
13070 if (TREE_CODE (f1
) != FIELD_DECL
|| TREE_CODE (f2
) != FIELD_DECL
13071 || (TYPE_MAIN_VARIANT (TREE_TYPE (f1
))
13072 != TYPE_MAIN_VARIANT (TREE_TYPE (f2
))
13073 /* FIXME: gfc_nonrestricted_type builds all types as variants
13074 with exception of pointer types. It deeply copies the type
13075 which means that we may end up with a variant type
13076 referring non-variant pointer. We may change it to
13077 produce types as variants, too, like
13078 objc_get_protocol_qualified_type does. */
13079 && !POINTER_TYPE_P (TREE_TYPE (f1
)))
13080 || DECL_FIELD_OFFSET (f1
) != DECL_FIELD_OFFSET (f2
)
13081 || DECL_FIELD_BIT_OFFSET (f1
) != DECL_FIELD_BIT_OFFSET (f2
))
13085 error ("type variant has different TYPE_FIELDS");
13087 error ("first mismatch is field");
13089 error ("and field");
13094 else if ((TREE_CODE (t
) == FUNCTION_TYPE
|| TREE_CODE (t
) == METHOD_TYPE
))
13095 verify_variant_match (TYPE_ARG_TYPES
);
13096 /* For C++ the qualified variant of array type is really an array type
13097 of qualified TREE_TYPE.
13098 objc builds variants of pointer where pointer to type is a variant, too
13099 in objc_get_protocol_qualified_type. */
13100 if (TREE_TYPE (t
) != TREE_TYPE (tv
)
13101 && ((TREE_CODE (t
) != ARRAY_TYPE
13102 && !POINTER_TYPE_P (t
))
13103 || TYPE_MAIN_VARIANT (TREE_TYPE (t
))
13104 != TYPE_MAIN_VARIANT (TREE_TYPE (tv
))))
13106 error ("type variant has different TREE_TYPE");
13108 error ("type variant's TREE_TYPE");
13109 debug_tree (TREE_TYPE (tv
));
13110 error ("type's TREE_TYPE");
13111 debug_tree (TREE_TYPE (t
));
13114 if (type_with_alias_set_p (t
)
13115 && !gimple_canonical_types_compatible_p (t
, tv
, false))
13117 error ("type is not compatible with its vairant");
13119 error ("type variant's TREE_TYPE");
13120 debug_tree (TREE_TYPE (tv
));
13121 error ("type's TREE_TYPE");
13122 debug_tree (TREE_TYPE (t
));
13126 #undef verify_variant_match
13130 /* The TYPE_CANONICAL merging machinery. It should closely resemble
13131 the middle-end types_compatible_p function. It needs to avoid
13132 claiming types are different for types that should be treated
13133 the same with respect to TBAA. Canonical types are also used
13134 for IL consistency checks via the useless_type_conversion_p
13135 predicate which does not handle all type kinds itself but falls
13136 back to pointer-comparison of TYPE_CANONICAL for aggregates
13139 /* Return true if TYPE_UNSIGNED of TYPE should be ignored for canonical
13140 type calculation because we need to allow inter-operability between signed
13141 and unsigned variants. */
13144 type_with_interoperable_signedness (const_tree type
)
13146 /* Fortran standard require C_SIGNED_CHAR to be interoperable with both
13147 signed char and unsigned char. Similarly fortran FE builds
13148 C_SIZE_T as signed type, while C defines it unsigned. */
13150 return tree_code_for_canonical_type_merging (TREE_CODE (type
))
13152 && (TYPE_PRECISION (type
) == TYPE_PRECISION (signed_char_type_node
)
13153 || TYPE_PRECISION (type
) == TYPE_PRECISION (size_type_node
));
13156 /* Return true iff T1 and T2 are structurally identical for what
13158 This function is used both by lto.c canonical type merging and by the
13159 verifier. If TRUST_TYPE_CANONICAL we do not look into structure of types
13160 that have TYPE_CANONICAL defined and assume them equivalent. */
13163 gimple_canonical_types_compatible_p (const_tree t1
, const_tree t2
,
13164 bool trust_type_canonical
)
13166 /* Type variants should be same as the main variant. When not doing sanity
13167 checking to verify this fact, go to main variants and save some work. */
13168 if (trust_type_canonical
)
13170 t1
= TYPE_MAIN_VARIANT (t1
);
13171 t2
= TYPE_MAIN_VARIANT (t2
);
13174 /* Check first for the obvious case of pointer identity. */
13178 /* Check that we have two types to compare. */
13179 if (t1
== NULL_TREE
|| t2
== NULL_TREE
)
13182 /* We consider complete types always compatible with incomplete type.
13183 This does not make sense for canonical type calculation and thus we
13184 need to ensure that we are never called on it.
13186 FIXME: For more correctness the function probably should have three modes
13187 1) mode assuming that types are complete mathcing their structure
13188 2) mode allowing incomplete types but producing equivalence classes
13189 and thus ignoring all info from complete types
13190 3) mode allowing incomplete types to match complete but checking
13191 compatibility between complete types.
13193 1 and 2 can be used for canonical type calculation. 3 is the real
13194 definition of type compatibility that can be used i.e. for warnings during
13195 declaration merging. */
13197 gcc_assert (!trust_type_canonical
13198 || (type_with_alias_set_p (t1
) && type_with_alias_set_p (t2
)));
13199 /* If the types have been previously registered and found equal
13201 if (TYPE_CANONICAL (t1
) && TYPE_CANONICAL (t2
)
13202 && trust_type_canonical
)
13203 return TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
);
13205 /* Can't be the same type if the types don't have the same code. */
13206 enum tree_code code
= tree_code_for_canonical_type_merging (TREE_CODE (t1
));
13207 if (code
!= tree_code_for_canonical_type_merging (TREE_CODE (t2
)))
13210 /* Qualifiers do not matter for canonical type comparison purposes. */
13212 /* Void types and nullptr types are always the same. */
13213 if (TREE_CODE (t1
) == VOID_TYPE
13214 || TREE_CODE (t1
) == NULLPTR_TYPE
)
13217 /* Can't be the same type if they have different mode. */
13218 if (TYPE_MODE (t1
) != TYPE_MODE (t2
))
13221 /* Non-aggregate types can be handled cheaply. */
13222 if (INTEGRAL_TYPE_P (t1
)
13223 || SCALAR_FLOAT_TYPE_P (t1
)
13224 || FIXED_POINT_TYPE_P (t1
)
13225 || TREE_CODE (t1
) == VECTOR_TYPE
13226 || TREE_CODE (t1
) == COMPLEX_TYPE
13227 || TREE_CODE (t1
) == OFFSET_TYPE
13228 || POINTER_TYPE_P (t1
))
13230 /* Can't be the same type if they have different recision. */
13231 if (TYPE_PRECISION (t1
) != TYPE_PRECISION (t2
))
13234 /* In some cases the signed and unsigned types are required to be
13236 if (TYPE_UNSIGNED (t1
) != TYPE_UNSIGNED (t2
)
13237 && !type_with_interoperable_signedness (t1
))
13240 /* Fortran's C_SIGNED_CHAR is !TYPE_STRING_FLAG but needs to be
13241 interoperable with "signed char". Unless all frontends are revisited
13242 to agree on these types, we must ignore the flag completely. */
13244 /* Fortran standard define C_PTR type that is compatible with every
13245 C pointer. For this reason we need to glob all pointers into one.
13246 Still pointers in different address spaces are not compatible. */
13247 if (POINTER_TYPE_P (t1
))
13249 if (TYPE_ADDR_SPACE (TREE_TYPE (t1
))
13250 != TYPE_ADDR_SPACE (TREE_TYPE (t2
)))
13254 /* Tail-recurse to components. */
13255 if (TREE_CODE (t1
) == VECTOR_TYPE
13256 || TREE_CODE (t1
) == COMPLEX_TYPE
)
13257 return gimple_canonical_types_compatible_p (TREE_TYPE (t1
),
13259 trust_type_canonical
);
13264 /* Do type-specific comparisons. */
13265 switch (TREE_CODE (t1
))
13268 /* Array types are the same if the element types are the same and
13269 the number of elements are the same. */
13270 if (!gimple_canonical_types_compatible_p (TREE_TYPE (t1
), TREE_TYPE (t2
),
13271 trust_type_canonical
)
13272 || TYPE_STRING_FLAG (t1
) != TYPE_STRING_FLAG (t2
)
13273 || TYPE_NONALIASED_COMPONENT (t1
) != TYPE_NONALIASED_COMPONENT (t2
))
13277 tree i1
= TYPE_DOMAIN (t1
);
13278 tree i2
= TYPE_DOMAIN (t2
);
13280 /* For an incomplete external array, the type domain can be
13281 NULL_TREE. Check this condition also. */
13282 if (i1
== NULL_TREE
&& i2
== NULL_TREE
)
13284 else if (i1
== NULL_TREE
|| i2
== NULL_TREE
)
13288 tree min1
= TYPE_MIN_VALUE (i1
);
13289 tree min2
= TYPE_MIN_VALUE (i2
);
13290 tree max1
= TYPE_MAX_VALUE (i1
);
13291 tree max2
= TYPE_MAX_VALUE (i2
);
13293 /* The minimum/maximum values have to be the same. */
13296 && ((TREE_CODE (min1
) == PLACEHOLDER_EXPR
13297 && TREE_CODE (min2
) == PLACEHOLDER_EXPR
)
13298 || operand_equal_p (min1
, min2
, 0))))
13301 && ((TREE_CODE (max1
) == PLACEHOLDER_EXPR
13302 && TREE_CODE (max2
) == PLACEHOLDER_EXPR
)
13303 || operand_equal_p (max1
, max2
, 0)))))
13311 case FUNCTION_TYPE
:
13312 /* Function types are the same if the return type and arguments types
13314 if (!gimple_canonical_types_compatible_p (TREE_TYPE (t1
), TREE_TYPE (t2
),
13315 trust_type_canonical
))
13318 if (TYPE_ARG_TYPES (t1
) == TYPE_ARG_TYPES (t2
))
13322 tree parms1
, parms2
;
13324 for (parms1
= TYPE_ARG_TYPES (t1
), parms2
= TYPE_ARG_TYPES (t2
);
13326 parms1
= TREE_CHAIN (parms1
), parms2
= TREE_CHAIN (parms2
))
13328 if (!gimple_canonical_types_compatible_p
13329 (TREE_VALUE (parms1
), TREE_VALUE (parms2
),
13330 trust_type_canonical
))
13334 if (parms1
|| parms2
)
13342 case QUAL_UNION_TYPE
:
13346 /* For aggregate types, all the fields must be the same. */
13347 for (f1
= TYPE_FIELDS (t1
), f2
= TYPE_FIELDS (t2
);
13349 f1
= TREE_CHAIN (f1
), f2
= TREE_CHAIN (f2
))
13351 /* Skip non-fields. */
13352 while (f1
&& TREE_CODE (f1
) != FIELD_DECL
)
13353 f1
= TREE_CHAIN (f1
);
13354 while (f2
&& TREE_CODE (f2
) != FIELD_DECL
)
13355 f2
= TREE_CHAIN (f2
);
13358 /* The fields must have the same name, offset and type. */
13359 if (DECL_NONADDRESSABLE_P (f1
) != DECL_NONADDRESSABLE_P (f2
)
13360 || !gimple_compare_field_offset (f1
, f2
)
13361 || !gimple_canonical_types_compatible_p
13362 (TREE_TYPE (f1
), TREE_TYPE (f2
),
13363 trust_type_canonical
))
13367 /* If one aggregate has more fields than the other, they
13368 are not the same. */
13376 /* Consider all types with language specific trees in them mutually
13377 compatible. This is executed only from verify_type and false
13378 positives can be tolerated. */
13379 gcc_assert (!in_lto_p
);
13384 /* Verify type T. */
13387 verify_type (const_tree t
)
13389 bool error_found
= false;
13390 tree mv
= TYPE_MAIN_VARIANT (t
);
13393 error ("Main variant is not defined");
13394 error_found
= true;
13396 else if (mv
!= TYPE_MAIN_VARIANT (mv
))
13398 error ("TYPE_MAIN_VARIANT has different TYPE_MAIN_VARIANT");
13400 error_found
= true;
13402 else if (t
!= mv
&& !verify_type_variant (t
, mv
))
13403 error_found
= true;
13405 tree ct
= TYPE_CANONICAL (t
);
13408 else if (TYPE_CANONICAL (t
) != ct
)
13410 error ("TYPE_CANONICAL has different TYPE_CANONICAL");
13412 error_found
= true;
13414 /* Method and function types can not be used to address memory and thus
13415 TYPE_CANONICAL really matters only for determining useless conversions.
13417 FIXME: C++ FE produce declarations of builtin functions that are not
13418 compatible with main variants. */
13419 else if (TREE_CODE (t
) == FUNCTION_TYPE
)
13422 /* FIXME: gimple_canonical_types_compatible_p can not compare types
13423 with variably sized arrays because their sizes possibly
13424 gimplified to different variables. */
13425 && !variably_modified_type_p (ct
, NULL
)
13426 && !gimple_canonical_types_compatible_p (t
, ct
, false))
13428 error ("TYPE_CANONICAL is not compatible");
13430 error_found
= true;
13433 if (COMPLETE_TYPE_P (t
) && TYPE_CANONICAL (t
)
13434 && TYPE_MODE (t
) != TYPE_MODE (TYPE_CANONICAL (t
)))
13436 error ("TYPE_MODE of TYPE_CANONICAL is not compatible");
13438 error_found
= true;
13442 /* Check various uses of TYPE_MINVAL. */
13443 if (RECORD_OR_UNION_TYPE_P (t
))
13445 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
13446 and danagle the pointer from time to time. */
13447 if (TYPE_VFIELD (t
)
13448 && TREE_CODE (TYPE_VFIELD (t
)) != FIELD_DECL
13449 && TREE_CODE (TYPE_VFIELD (t
)) != TREE_LIST
)
13451 error ("TYPE_VFIELD is not FIELD_DECL nor TREE_LIST");
13452 debug_tree (TYPE_VFIELD (t
));
13453 error_found
= true;
13456 else if (TREE_CODE (t
) == POINTER_TYPE
)
13458 if (TYPE_NEXT_PTR_TO (t
)
13459 && TREE_CODE (TYPE_NEXT_PTR_TO (t
)) != POINTER_TYPE
)
13461 error ("TYPE_NEXT_PTR_TO is not POINTER_TYPE");
13462 debug_tree (TYPE_NEXT_PTR_TO (t
));
13463 error_found
= true;
13466 else if (TREE_CODE (t
) == REFERENCE_TYPE
)
13468 if (TYPE_NEXT_REF_TO (t
)
13469 && TREE_CODE (TYPE_NEXT_REF_TO (t
)) != REFERENCE_TYPE
)
13471 error ("TYPE_NEXT_REF_TO is not REFERENCE_TYPE");
13472 debug_tree (TYPE_NEXT_REF_TO (t
));
13473 error_found
= true;
13476 else if (INTEGRAL_TYPE_P (t
) || TREE_CODE (t
) == REAL_TYPE
13477 || TREE_CODE (t
) == FIXED_POINT_TYPE
)
13479 /* FIXME: The following check should pass:
13480 useless_type_conversion_p (const_cast <tree> (t),
13481 TREE_TYPE (TYPE_MIN_VALUE (t))
13482 but does not for C sizetypes in LTO. */
13484 /* Java uses TYPE_MINVAL for TYPE_ARGUMENT_SIGNATURE. */
13485 else if (TYPE_MINVAL (t
)
13486 && ((TREE_CODE (t
) != METHOD_TYPE
&& TREE_CODE (t
) != FUNCTION_TYPE
)
13489 error ("TYPE_MINVAL non-NULL");
13490 debug_tree (TYPE_MINVAL (t
));
13491 error_found
= true;
13494 /* Check various uses of TYPE_MAXVAL. */
13495 if (RECORD_OR_UNION_TYPE_P (t
))
13497 if (TYPE_METHODS (t
) && TREE_CODE (TYPE_METHODS (t
)) != FUNCTION_DECL
13498 && TREE_CODE (TYPE_METHODS (t
)) != TEMPLATE_DECL
13499 && TYPE_METHODS (t
) != error_mark_node
)
13501 error ("TYPE_METHODS is not FUNCTION_DECL, TEMPLATE_DECL nor error_mark_node");
13502 debug_tree (TYPE_METHODS (t
));
13503 error_found
= true;
13506 else if (TREE_CODE (t
) == FUNCTION_TYPE
|| TREE_CODE (t
) == METHOD_TYPE
)
13508 if (TYPE_METHOD_BASETYPE (t
)
13509 && TREE_CODE (TYPE_METHOD_BASETYPE (t
)) != RECORD_TYPE
13510 && TREE_CODE (TYPE_METHOD_BASETYPE (t
)) != UNION_TYPE
)
13512 error ("TYPE_METHOD_BASETYPE is not record nor union");
13513 debug_tree (TYPE_METHOD_BASETYPE (t
));
13514 error_found
= true;
13517 else if (TREE_CODE (t
) == OFFSET_TYPE
)
13519 if (TYPE_OFFSET_BASETYPE (t
)
13520 && TREE_CODE (TYPE_OFFSET_BASETYPE (t
)) != RECORD_TYPE
13521 && TREE_CODE (TYPE_OFFSET_BASETYPE (t
)) != UNION_TYPE
)
13523 error ("TYPE_OFFSET_BASETYPE is not record nor union");
13524 debug_tree (TYPE_OFFSET_BASETYPE (t
));
13525 error_found
= true;
13528 else if (INTEGRAL_TYPE_P (t
) || TREE_CODE (t
) == REAL_TYPE
13529 || TREE_CODE (t
) == FIXED_POINT_TYPE
)
13531 /* FIXME: The following check should pass:
13532 useless_type_conversion_p (const_cast <tree> (t),
13533 TREE_TYPE (TYPE_MAX_VALUE (t))
13534 but does not for C sizetypes in LTO. */
13536 else if (TREE_CODE (t
) == ARRAY_TYPE
)
13538 if (TYPE_ARRAY_MAX_SIZE (t
)
13539 && TREE_CODE (TYPE_ARRAY_MAX_SIZE (t
)) != INTEGER_CST
)
13541 error ("TYPE_ARRAY_MAX_SIZE not INTEGER_CST");
13542 debug_tree (TYPE_ARRAY_MAX_SIZE (t
));
13543 error_found
= true;
13546 else if (TYPE_MAXVAL (t
))
13548 error ("TYPE_MAXVAL non-NULL");
13549 debug_tree (TYPE_MAXVAL (t
));
13550 error_found
= true;
13553 /* Check various uses of TYPE_BINFO. */
13554 if (RECORD_OR_UNION_TYPE_P (t
))
13556 if (!TYPE_BINFO (t
))
13558 else if (TREE_CODE (TYPE_BINFO (t
)) != TREE_BINFO
)
13560 error ("TYPE_BINFO is not TREE_BINFO");
13561 debug_tree (TYPE_BINFO (t
));
13562 error_found
= true;
13564 /* FIXME: Java builds invalid empty binfos that do not have
13566 else if (TREE_TYPE (TYPE_BINFO (t
)) != TYPE_MAIN_VARIANT (t
) && 0)
13568 error ("TYPE_BINFO type is not TYPE_MAIN_VARIANT");
13569 debug_tree (TREE_TYPE (TYPE_BINFO (t
)));
13570 error_found
= true;
13573 else if (TYPE_LANG_SLOT_1 (t
) && in_lto_p
)
13575 error ("TYPE_LANG_SLOT_1 (binfo) field is non-NULL");
13576 debug_tree (TYPE_LANG_SLOT_1 (t
));
13577 error_found
= true;
13580 /* Check various uses of TYPE_VALUES_RAW. */
13581 if (TREE_CODE (t
) == ENUMERAL_TYPE
)
13582 for (tree l
= TYPE_VALUES (t
); l
; l
= TREE_CHAIN (l
))
13584 tree value
= TREE_VALUE (l
);
13585 tree name
= TREE_PURPOSE (l
);
13587 /* C FE porduce INTEGER_CST of INTEGER_TYPE, while C++ FE uses
13588 CONST_DECL of ENUMERAL TYPE. */
13589 if (TREE_CODE (value
) != INTEGER_CST
&& TREE_CODE (value
) != CONST_DECL
)
13591 error ("Enum value is not CONST_DECL or INTEGER_CST");
13592 debug_tree (value
);
13594 error_found
= true;
13596 if (TREE_CODE (TREE_TYPE (value
)) != INTEGER_TYPE
13597 && !useless_type_conversion_p (const_cast <tree
> (t
), TREE_TYPE (value
)))
13599 error ("Enum value type is not INTEGER_TYPE nor convertible to the enum");
13600 debug_tree (value
);
13602 error_found
= true;
13604 if (TREE_CODE (name
) != IDENTIFIER_NODE
)
13606 error ("Enum value name is not IDENTIFIER_NODE");
13607 debug_tree (value
);
13609 error_found
= true;
13612 else if (TREE_CODE (t
) == ARRAY_TYPE
)
13614 if (TYPE_DOMAIN (t
) && TREE_CODE (TYPE_DOMAIN (t
)) != INTEGER_TYPE
)
13616 error ("Array TYPE_DOMAIN is not integer type");
13617 debug_tree (TYPE_DOMAIN (t
));
13618 error_found
= true;
13621 else if (RECORD_OR_UNION_TYPE_P (t
))
13622 for (tree fld
= TYPE_FIELDS (t
); fld
; fld
= TREE_CHAIN (fld
))
13624 /* TODO: verify properties of decls. */
13625 if (TREE_CODE (fld
) == FIELD_DECL
)
13627 else if (TREE_CODE (fld
) == TYPE_DECL
)
13629 else if (TREE_CODE (fld
) == CONST_DECL
)
13631 else if (TREE_CODE (fld
) == VAR_DECL
)
13633 else if (TREE_CODE (fld
) == TEMPLATE_DECL
)
13635 else if (TREE_CODE (fld
) == USING_DECL
)
13639 error ("Wrong tree in TYPE_FIELDS list");
13641 error_found
= true;
13644 else if (TREE_CODE (t
) == INTEGER_TYPE
13645 || TREE_CODE (t
) == BOOLEAN_TYPE
13646 || TREE_CODE (t
) == OFFSET_TYPE
13647 || TREE_CODE (t
) == REFERENCE_TYPE
13648 || TREE_CODE (t
) == NULLPTR_TYPE
13649 || TREE_CODE (t
) == POINTER_TYPE
)
13651 if (TYPE_CACHED_VALUES_P (t
) != (TYPE_CACHED_VALUES (t
) != NULL
))
13653 error ("TYPE_CACHED_VALUES_P is %i while TYPE_CACHED_VALUES is %p",
13654 TYPE_CACHED_VALUES_P (t
), (void *)TYPE_CACHED_VALUES (t
));
13655 error_found
= true;
13657 else if (TYPE_CACHED_VALUES_P (t
) && TREE_CODE (TYPE_CACHED_VALUES (t
)) != TREE_VEC
)
13659 error ("TYPE_CACHED_VALUES is not TREE_VEC");
13660 debug_tree (TYPE_CACHED_VALUES (t
));
13661 error_found
= true;
13663 /* Verify just enough of cache to ensure that no one copied it to new type.
13664 All copying should go by copy_node that should clear it. */
13665 else if (TYPE_CACHED_VALUES_P (t
))
13668 for (i
= 0; i
< TREE_VEC_LENGTH (TYPE_CACHED_VALUES (t
)); i
++)
13669 if (TREE_VEC_ELT (TYPE_CACHED_VALUES (t
), i
)
13670 && TREE_TYPE (TREE_VEC_ELT (TYPE_CACHED_VALUES (t
), i
)) != t
)
13672 error ("wrong TYPE_CACHED_VALUES entry");
13673 debug_tree (TREE_VEC_ELT (TYPE_CACHED_VALUES (t
), i
));
13674 error_found
= true;
13679 else if (TREE_CODE (t
) == FUNCTION_TYPE
|| TREE_CODE (t
) == METHOD_TYPE
)
13680 for (tree l
= TYPE_ARG_TYPES (t
); l
; l
= TREE_CHAIN (l
))
13682 /* C++ FE uses TREE_PURPOSE to store initial values. */
13683 if (TREE_PURPOSE (l
) && in_lto_p
)
13685 error ("TREE_PURPOSE is non-NULL in TYPE_ARG_TYPES list");
13687 error_found
= true;
13689 if (!TYPE_P (TREE_VALUE (l
)))
13691 error ("Wrong entry in TYPE_ARG_TYPES list");
13693 error_found
= true;
13696 else if (!is_lang_specific (t
) && TYPE_VALUES_RAW (t
))
13698 error ("TYPE_VALUES_RAW field is non-NULL");
13699 debug_tree (TYPE_VALUES_RAW (t
));
13700 error_found
= true;
13702 if (TREE_CODE (t
) != INTEGER_TYPE
13703 && TREE_CODE (t
) != BOOLEAN_TYPE
13704 && TREE_CODE (t
) != OFFSET_TYPE
13705 && TREE_CODE (t
) != REFERENCE_TYPE
13706 && TREE_CODE (t
) != NULLPTR_TYPE
13707 && TREE_CODE (t
) != POINTER_TYPE
13708 && TYPE_CACHED_VALUES_P (t
))
13710 error ("TYPE_CACHED_VALUES_P is set while it should not");
13711 error_found
= true;
13713 if (TYPE_STRING_FLAG (t
)
13714 && TREE_CODE (t
) != ARRAY_TYPE
&& TREE_CODE (t
) != INTEGER_TYPE
)
13716 error ("TYPE_STRING_FLAG is set on wrong type code");
13717 error_found
= true;
13719 else if (TYPE_STRING_FLAG (t
))
13722 if (TREE_CODE (b
) == ARRAY_TYPE
)
13724 /* Java builds arrays with TYPE_STRING_FLAG of promoted_char_type
13726 if (TREE_CODE (b
) != INTEGER_TYPE
)
13728 error ("TYPE_STRING_FLAG is set on type that does not look like "
13729 "char nor array of chars");
13730 error_found
= true;
13734 /* ipa-devirt makes an assumption that TYPE_METHOD_BASETYPE is always
13735 TYPE_MAIN_VARIANT and it would be odd to add methods only to variatns
13737 if (TREE_CODE (t
) == METHOD_TYPE
13738 && TYPE_MAIN_VARIANT (TYPE_METHOD_BASETYPE (t
)) != TYPE_METHOD_BASETYPE (t
))
13740 error ("TYPE_METHOD_BASETYPE is not main variant");
13741 error_found
= true;
13746 debug_tree (const_cast <tree
> (t
));
13747 internal_error ("verify_type failed");
13752 /* Return true if ARG is marked with the nonnull attribute in the
13753 current function signature. */
13756 nonnull_arg_p (const_tree arg
)
13758 tree t
, attrs
, fntype
;
13759 unsigned HOST_WIDE_INT arg_num
;
13761 gcc_assert (TREE_CODE (arg
) == PARM_DECL
&& POINTER_TYPE_P (TREE_TYPE (arg
)));
13763 /* The static chain decl is always non null. */
13764 if (arg
== cfun
->static_chain_decl
)
13767 /* THIS argument of method is always non-NULL. */
13768 if (TREE_CODE (TREE_TYPE (cfun
->decl
)) == METHOD_TYPE
13769 && arg
== DECL_ARGUMENTS (cfun
->decl
)
13770 && flag_delete_null_pointer_checks
)
13773 /* Values passed by reference are always non-NULL. */
13774 if (TREE_CODE (TREE_TYPE (arg
)) == REFERENCE_TYPE
13775 && flag_delete_null_pointer_checks
)
13778 fntype
= TREE_TYPE (cfun
->decl
);
13779 for (attrs
= TYPE_ATTRIBUTES (fntype
); attrs
; attrs
= TREE_CHAIN (attrs
))
13781 attrs
= lookup_attribute ("nonnull", attrs
);
13783 /* If "nonnull" wasn't specified, we know nothing about the argument. */
13784 if (attrs
== NULL_TREE
)
13787 /* If "nonnull" applies to all the arguments, then ARG is non-null. */
13788 if (TREE_VALUE (attrs
) == NULL_TREE
)
13791 /* Get the position number for ARG in the function signature. */
13792 for (arg_num
= 1, t
= DECL_ARGUMENTS (cfun
->decl
);
13794 t
= DECL_CHAIN (t
), arg_num
++)
13800 gcc_assert (t
== arg
);
13802 /* Now see if ARG_NUM is mentioned in the nonnull list. */
13803 for (t
= TREE_VALUE (attrs
); t
; t
= TREE_CHAIN (t
))
13805 if (compare_tree_int (TREE_VALUE (t
), arg_num
) == 0)
13814 #include "gt-tree.h"