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 occasionally
28 calls language-dependent routines defined (for C) in typecheck.c. */
32 #include "coretypes.h"
38 #include "double-int.h"
45 #include "fold-const.h"
46 #include "stor-layout.h"
52 #include "hard-reg-set.h"
56 #include "toplev.h" /* get_random_seed */
58 #include "filenames.h"
61 #include "common/common-target.h"
62 #include "langhooks.h"
63 #include "tree-inline.h"
64 #include "tree-iterator.h"
66 #include "dominance.h"
68 #include "basic-block.h"
70 #include "tree-ssa-alias.h"
71 #include "internal-fn.h"
72 #include "gimple-expr.h"
75 #include "gimple-iterator.h"
77 #include "gimple-ssa.h"
79 #include "plugin-api.h"
82 #include "tree-phinodes.h"
83 #include "stringpool.h"
84 #include "tree-ssanames.h"
88 #include "tree-pass.h"
89 #include "langhooks-def.h"
90 #include "diagnostic.h"
91 #include "tree-diagnostic.h"
92 #include "tree-pretty-print.h"
99 /* Tree code classes. */
101 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) TYPE,
102 #define END_OF_BASE_TREE_CODES tcc_exceptional,
104 const enum tree_code_class tree_code_type
[] = {
105 #include "all-tree.def"
109 #undef END_OF_BASE_TREE_CODES
111 /* Table indexed by tree code giving number of expression
112 operands beyond the fixed part of the node structure.
113 Not used for types or decls. */
115 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) LENGTH,
116 #define END_OF_BASE_TREE_CODES 0,
118 const unsigned char tree_code_length
[] = {
119 #include "all-tree.def"
123 #undef END_OF_BASE_TREE_CODES
125 /* Names of tree components.
126 Used for printing out the tree and error messages. */
127 #define DEFTREECODE(SYM, NAME, TYPE, LEN) NAME,
128 #define END_OF_BASE_TREE_CODES "@dummy",
130 static const char *const tree_code_name
[] = {
131 #include "all-tree.def"
135 #undef END_OF_BASE_TREE_CODES
137 /* Each tree code class has an associated string representation.
138 These must correspond to the tree_code_class entries. */
140 const char *const tree_code_class_strings
[] =
155 /* obstack.[ch] explicitly declined to prototype this. */
156 extern int _obstack_allocated_p (struct obstack
*h
, void *obj
);
158 /* Statistics-gathering stuff. */
160 static int tree_code_counts
[MAX_TREE_CODES
];
161 int tree_node_counts
[(int) all_kinds
];
162 int tree_node_sizes
[(int) all_kinds
];
164 /* Keep in sync with tree.h:enum tree_node_kind. */
165 static const char * const tree_node_kind_names
[] = {
184 /* Unique id for next decl created. */
185 static GTY(()) int next_decl_uid
;
186 /* Unique id for next type created. */
187 static GTY(()) int next_type_uid
= 1;
188 /* Unique id for next debug decl created. Use negative numbers,
189 to catch erroneous uses. */
190 static GTY(()) int next_debug_decl_uid
;
192 /* Since we cannot rehash a type after it is in the table, we have to
193 keep the hash code. */
195 struct GTY((for_user
)) type_hash
{
200 /* Initial size of the hash table (rounded to next prime). */
201 #define TYPE_HASH_INITIAL_SIZE 1000
203 struct type_cache_hasher
: ggc_cache_hasher
<type_hash
*>
205 static hashval_t
hash (type_hash
*t
) { return t
->hash
; }
206 static bool equal (type_hash
*a
, type_hash
*b
);
209 handle_cache_entry (type_hash
*&t
)
211 extern void gt_ggc_mx (type_hash
*&);
212 if (t
== HTAB_DELETED_ENTRY
|| t
== HTAB_EMPTY_ENTRY
)
214 else if (ggc_marked_p (t
->type
))
217 t
= static_cast<type_hash
*> (HTAB_DELETED_ENTRY
);
221 /* Now here is the hash table. When recording a type, it is added to
222 the slot whose index is the hash code. Note that the hash table is
223 used for several kinds of types (function types, array types and
224 array index range types, for now). While all these live in the
225 same table, they are completely independent, and the hash code is
226 computed differently for each of these. */
228 static GTY ((cache
)) hash_table
<type_cache_hasher
> *type_hash_table
;
230 /* Hash table and temporary node for larger integer const values. */
231 static GTY (()) tree int_cst_node
;
233 struct int_cst_hasher
: ggc_cache_hasher
<tree
>
235 static hashval_t
hash (tree t
);
236 static bool equal (tree x
, tree y
);
239 static GTY ((cache
)) hash_table
<int_cst_hasher
> *int_cst_hash_table
;
241 /* Hash table for optimization flags and target option flags. Use the same
242 hash table for both sets of options. Nodes for building the current
243 optimization and target option nodes. The assumption is most of the time
244 the options created will already be in the hash table, so we avoid
245 allocating and freeing up a node repeatably. */
246 static GTY (()) tree cl_optimization_node
;
247 static GTY (()) tree cl_target_option_node
;
249 struct cl_option_hasher
: ggc_cache_hasher
<tree
>
251 static hashval_t
hash (tree t
);
252 static bool equal (tree x
, tree y
);
255 static GTY ((cache
)) hash_table
<cl_option_hasher
> *cl_option_hash_table
;
257 /* General tree->tree mapping structure for use in hash tables. */
261 hash_table
<tree_decl_map_cache_hasher
> *debug_expr_for_decl
;
264 hash_table
<tree_decl_map_cache_hasher
> *value_expr_for_decl
;
266 struct tree_vec_map_cache_hasher
: ggc_cache_hasher
<tree_vec_map
*>
268 static hashval_t
hash (tree_vec_map
*m
) { return DECL_UID (m
->base
.from
); }
271 equal (tree_vec_map
*a
, tree_vec_map
*b
)
273 return a
->base
.from
== b
->base
.from
;
277 handle_cache_entry (tree_vec_map
*&m
)
279 extern void gt_ggc_mx (tree_vec_map
*&);
280 if (m
== HTAB_EMPTY_ENTRY
|| m
== HTAB_DELETED_ENTRY
)
282 else if (ggc_marked_p (m
->base
.from
))
285 m
= static_cast<tree_vec_map
*> (HTAB_DELETED_ENTRY
);
290 hash_table
<tree_vec_map_cache_hasher
> *debug_args_for_decl
;
292 static void set_type_quals (tree
, int);
293 static void print_type_hash_statistics (void);
294 static void print_debug_expr_statistics (void);
295 static void print_value_expr_statistics (void);
296 static void type_hash_list (const_tree
, inchash::hash
&);
297 static void attribute_hash_list (const_tree
, inchash::hash
&);
299 tree global_trees
[TI_MAX
];
300 tree integer_types
[itk_none
];
302 bool int_n_enabled_p
[NUM_INT_N_ENTS
];
303 struct int_n_trees_t int_n_trees
[NUM_INT_N_ENTS
];
305 unsigned char tree_contains_struct
[MAX_TREE_CODES
][64];
307 /* Number of operands for each OpenMP clause. */
308 unsigned const char omp_clause_num_ops
[] =
310 0, /* OMP_CLAUSE_ERROR */
311 1, /* OMP_CLAUSE_PRIVATE */
312 1, /* OMP_CLAUSE_SHARED */
313 1, /* OMP_CLAUSE_FIRSTPRIVATE */
314 2, /* OMP_CLAUSE_LASTPRIVATE */
315 4, /* OMP_CLAUSE_REDUCTION */
316 1, /* OMP_CLAUSE_COPYIN */
317 1, /* OMP_CLAUSE_COPYPRIVATE */
318 3, /* OMP_CLAUSE_LINEAR */
319 2, /* OMP_CLAUSE_ALIGNED */
320 1, /* OMP_CLAUSE_DEPEND */
321 1, /* OMP_CLAUSE_UNIFORM */
322 2, /* OMP_CLAUSE_FROM */
323 2, /* OMP_CLAUSE_TO */
324 2, /* OMP_CLAUSE_MAP */
325 1, /* OMP_CLAUSE__LOOPTEMP_ */
326 1, /* OMP_CLAUSE_IF */
327 1, /* OMP_CLAUSE_NUM_THREADS */
328 1, /* OMP_CLAUSE_SCHEDULE */
329 0, /* OMP_CLAUSE_NOWAIT */
330 0, /* OMP_CLAUSE_ORDERED */
331 0, /* OMP_CLAUSE_DEFAULT */
332 3, /* OMP_CLAUSE_COLLAPSE */
333 0, /* OMP_CLAUSE_UNTIED */
334 1, /* OMP_CLAUSE_FINAL */
335 0, /* OMP_CLAUSE_MERGEABLE */
336 1, /* OMP_CLAUSE_DEVICE */
337 1, /* OMP_CLAUSE_DIST_SCHEDULE */
338 0, /* OMP_CLAUSE_INBRANCH */
339 0, /* OMP_CLAUSE_NOTINBRANCH */
340 1, /* OMP_CLAUSE_NUM_TEAMS */
341 1, /* OMP_CLAUSE_THREAD_LIMIT */
342 0, /* OMP_CLAUSE_PROC_BIND */
343 1, /* OMP_CLAUSE_SAFELEN */
344 1, /* OMP_CLAUSE_SIMDLEN */
345 0, /* OMP_CLAUSE_FOR */
346 0, /* OMP_CLAUSE_PARALLEL */
347 0, /* OMP_CLAUSE_SECTIONS */
348 0, /* OMP_CLAUSE_TASKGROUP */
349 1, /* OMP_CLAUSE__SIMDUID_ */
350 1, /* OMP_CLAUSE__CILK_FOR_COUNT_ */
353 const char * const omp_clause_code_name
[] =
399 /* Return the tree node structure used by tree code CODE. */
401 static inline enum tree_node_structure_enum
402 tree_node_structure_for_code (enum tree_code code
)
404 switch (TREE_CODE_CLASS (code
))
406 case tcc_declaration
:
411 return TS_FIELD_DECL
;
417 return TS_LABEL_DECL
;
419 return TS_RESULT_DECL
;
420 case DEBUG_EXPR_DECL
:
423 return TS_CONST_DECL
;
427 return TS_FUNCTION_DECL
;
428 case TRANSLATION_UNIT_DECL
:
429 return TS_TRANSLATION_UNIT_DECL
;
431 return TS_DECL_NON_COMMON
;
435 return TS_TYPE_NON_COMMON
;
444 default: /* tcc_constant and tcc_exceptional */
449 /* tcc_constant cases. */
450 case VOID_CST
: return TS_TYPED
;
451 case INTEGER_CST
: return TS_INT_CST
;
452 case REAL_CST
: return TS_REAL_CST
;
453 case FIXED_CST
: return TS_FIXED_CST
;
454 case COMPLEX_CST
: return TS_COMPLEX
;
455 case VECTOR_CST
: return TS_VECTOR
;
456 case STRING_CST
: return TS_STRING
;
457 /* tcc_exceptional cases. */
458 case ERROR_MARK
: return TS_COMMON
;
459 case IDENTIFIER_NODE
: return TS_IDENTIFIER
;
460 case TREE_LIST
: return TS_LIST
;
461 case TREE_VEC
: return TS_VEC
;
462 case SSA_NAME
: return TS_SSA_NAME
;
463 case PLACEHOLDER_EXPR
: return TS_COMMON
;
464 case STATEMENT_LIST
: return TS_STATEMENT_LIST
;
465 case BLOCK
: return TS_BLOCK
;
466 case CONSTRUCTOR
: return TS_CONSTRUCTOR
;
467 case TREE_BINFO
: return TS_BINFO
;
468 case OMP_CLAUSE
: return TS_OMP_CLAUSE
;
469 case OPTIMIZATION_NODE
: return TS_OPTIMIZATION
;
470 case TARGET_OPTION_NODE
: return TS_TARGET_OPTION
;
478 /* Initialize tree_contains_struct to describe the hierarchy of tree
482 initialize_tree_contains_struct (void)
486 for (i
= ERROR_MARK
; i
< LAST_AND_UNUSED_TREE_CODE
; i
++)
489 enum tree_node_structure_enum ts_code
;
491 code
= (enum tree_code
) i
;
492 ts_code
= tree_node_structure_for_code (code
);
494 /* Mark the TS structure itself. */
495 tree_contains_struct
[code
][ts_code
] = 1;
497 /* Mark all the structures that TS is derived from. */
515 case TS_STATEMENT_LIST
:
516 MARK_TS_TYPED (code
);
520 case TS_DECL_MINIMAL
:
526 case TS_OPTIMIZATION
:
527 case TS_TARGET_OPTION
:
528 MARK_TS_COMMON (code
);
531 case TS_TYPE_WITH_LANG_SPECIFIC
:
532 MARK_TS_TYPE_COMMON (code
);
535 case TS_TYPE_NON_COMMON
:
536 MARK_TS_TYPE_WITH_LANG_SPECIFIC (code
);
540 MARK_TS_DECL_MINIMAL (code
);
545 MARK_TS_DECL_COMMON (code
);
548 case TS_DECL_NON_COMMON
:
549 MARK_TS_DECL_WITH_VIS (code
);
552 case TS_DECL_WITH_VIS
:
556 MARK_TS_DECL_WRTL (code
);
560 MARK_TS_DECL_COMMON (code
);
564 MARK_TS_DECL_WITH_VIS (code
);
568 case TS_FUNCTION_DECL
:
569 MARK_TS_DECL_NON_COMMON (code
);
572 case TS_TRANSLATION_UNIT_DECL
:
573 MARK_TS_DECL_COMMON (code
);
581 /* Basic consistency checks for attributes used in fold. */
582 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_NON_COMMON
]);
583 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_NON_COMMON
]);
584 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_DECL_COMMON
]);
585 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_COMMON
]);
586 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_COMMON
]);
587 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_COMMON
]);
588 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_COMMON
]);
589 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_COMMON
]);
590 gcc_assert (tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_COMMON
]);
591 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_COMMON
]);
592 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_DECL_COMMON
]);
593 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_WRTL
]);
594 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_WRTL
]);
595 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_WRTL
]);
596 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WRTL
]);
597 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_WRTL
]);
598 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_DECL_MINIMAL
]);
599 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_MINIMAL
]);
600 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_MINIMAL
]);
601 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_MINIMAL
]);
602 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_MINIMAL
]);
603 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_MINIMAL
]);
604 gcc_assert (tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_MINIMAL
]);
605 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_MINIMAL
]);
606 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_DECL_MINIMAL
]);
607 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_WITH_VIS
]);
608 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WITH_VIS
]);
609 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_WITH_VIS
]);
610 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_VAR_DECL
]);
611 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_FIELD_DECL
]);
612 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_PARM_DECL
]);
613 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_LABEL_DECL
]);
614 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_RESULT_DECL
]);
615 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_CONST_DECL
]);
616 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_TYPE_DECL
]);
617 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_FUNCTION_DECL
]);
618 gcc_assert (tree_contains_struct
[IMPORTED_DECL
][TS_DECL_MINIMAL
]);
619 gcc_assert (tree_contains_struct
[IMPORTED_DECL
][TS_DECL_COMMON
]);
620 gcc_assert (tree_contains_struct
[NAMELIST_DECL
][TS_DECL_MINIMAL
]);
621 gcc_assert (tree_contains_struct
[NAMELIST_DECL
][TS_DECL_COMMON
]);
630 /* Initialize the hash table of types. */
632 = hash_table
<type_cache_hasher
>::create_ggc (TYPE_HASH_INITIAL_SIZE
);
635 = hash_table
<tree_decl_map_cache_hasher
>::create_ggc (512);
638 = hash_table
<tree_decl_map_cache_hasher
>::create_ggc (512);
640 int_cst_hash_table
= hash_table
<int_cst_hasher
>::create_ggc (1024);
642 int_cst_node
= make_int_cst (1, 1);
644 cl_option_hash_table
= hash_table
<cl_option_hasher
>::create_ggc (64);
646 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
647 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
649 /* Initialize the tree_contains_struct array. */
650 initialize_tree_contains_struct ();
651 lang_hooks
.init_ts ();
655 /* The name of the object as the assembler will see it (but before any
656 translations made by ASM_OUTPUT_LABELREF). Often this is the same
657 as DECL_NAME. It is an IDENTIFIER_NODE. */
659 decl_assembler_name (tree decl
)
661 if (!DECL_ASSEMBLER_NAME_SET_P (decl
))
662 lang_hooks
.set_decl_assembler_name (decl
);
663 return DECL_WITH_VIS_CHECK (decl
)->decl_with_vis
.assembler_name
;
666 /* When the target supports COMDAT groups, this indicates which group the
667 DECL is associated with. This can be either an IDENTIFIER_NODE or a
668 decl, in which case its DECL_ASSEMBLER_NAME identifies the group. */
670 decl_comdat_group (const_tree node
)
672 struct symtab_node
*snode
= symtab_node::get (node
);
675 return snode
->get_comdat_group ();
678 /* Likewise, but make sure it's been reduced to an IDENTIFIER_NODE. */
680 decl_comdat_group_id (const_tree node
)
682 struct symtab_node
*snode
= symtab_node::get (node
);
685 return snode
->get_comdat_group_id ();
688 /* When the target supports named section, return its name as IDENTIFIER_NODE
689 or NULL if it is in no section. */
691 decl_section_name (const_tree node
)
693 struct symtab_node
*snode
= symtab_node::get (node
);
696 return snode
->get_section ();
699 /* Set section section name of NODE to VALUE (that is expected to
700 be identifier node) */
702 set_decl_section_name (tree node
, const char *value
)
704 struct symtab_node
*snode
;
708 snode
= symtab_node::get (node
);
712 else if (TREE_CODE (node
) == VAR_DECL
)
713 snode
= varpool_node::get_create (node
);
715 snode
= cgraph_node::get_create (node
);
716 snode
->set_section (value
);
719 /* Return TLS model of a variable NODE. */
721 decl_tls_model (const_tree node
)
723 struct varpool_node
*snode
= varpool_node::get (node
);
725 return TLS_MODEL_NONE
;
726 return snode
->tls_model
;
729 /* Set TLS model of variable NODE to MODEL. */
731 set_decl_tls_model (tree node
, enum tls_model model
)
733 struct varpool_node
*vnode
;
735 if (model
== TLS_MODEL_NONE
)
737 vnode
= varpool_node::get (node
);
742 vnode
= varpool_node::get_create (node
);
743 vnode
->tls_model
= model
;
746 /* Compute the number of bytes occupied by a tree with code CODE.
747 This function cannot be used for nodes that have variable sizes,
748 including TREE_VEC, INTEGER_CST, STRING_CST, and CALL_EXPR. */
750 tree_code_size (enum tree_code code
)
752 switch (TREE_CODE_CLASS (code
))
754 case tcc_declaration
: /* A decl node */
759 return sizeof (struct tree_field_decl
);
761 return sizeof (struct tree_parm_decl
);
763 return sizeof (struct tree_var_decl
);
765 return sizeof (struct tree_label_decl
);
767 return sizeof (struct tree_result_decl
);
769 return sizeof (struct tree_const_decl
);
771 return sizeof (struct tree_type_decl
);
773 return sizeof (struct tree_function_decl
);
774 case DEBUG_EXPR_DECL
:
775 return sizeof (struct tree_decl_with_rtl
);
776 case TRANSLATION_UNIT_DECL
:
777 return sizeof (struct tree_translation_unit_decl
);
781 return sizeof (struct tree_decl_non_common
);
783 return lang_hooks
.tree_size (code
);
787 case tcc_type
: /* a type node */
788 return sizeof (struct tree_type_non_common
);
790 case tcc_reference
: /* a reference */
791 case tcc_expression
: /* an expression */
792 case tcc_statement
: /* an expression with side effects */
793 case tcc_comparison
: /* a comparison expression */
794 case tcc_unary
: /* a unary arithmetic expression */
795 case tcc_binary
: /* a binary arithmetic expression */
796 return (sizeof (struct tree_exp
)
797 + (TREE_CODE_LENGTH (code
) - 1) * sizeof (tree
));
799 case tcc_constant
: /* a constant */
802 case VOID_CST
: return sizeof (struct tree_typed
);
803 case INTEGER_CST
: gcc_unreachable ();
804 case REAL_CST
: return sizeof (struct tree_real_cst
);
805 case FIXED_CST
: return sizeof (struct tree_fixed_cst
);
806 case COMPLEX_CST
: return sizeof (struct tree_complex
);
807 case VECTOR_CST
: return sizeof (struct tree_vector
);
808 case STRING_CST
: gcc_unreachable ();
810 return lang_hooks
.tree_size (code
);
813 case tcc_exceptional
: /* something random, like an identifier. */
816 case IDENTIFIER_NODE
: return lang_hooks
.identifier_size
;
817 case TREE_LIST
: return sizeof (struct tree_list
);
820 case PLACEHOLDER_EXPR
: return sizeof (struct tree_common
);
823 case OMP_CLAUSE
: gcc_unreachable ();
825 case SSA_NAME
: return sizeof (struct tree_ssa_name
);
827 case STATEMENT_LIST
: return sizeof (struct tree_statement_list
);
828 case BLOCK
: return sizeof (struct tree_block
);
829 case CONSTRUCTOR
: return sizeof (struct tree_constructor
);
830 case OPTIMIZATION_NODE
: return sizeof (struct tree_optimization_option
);
831 case TARGET_OPTION_NODE
: return sizeof (struct tree_target_option
);
834 return lang_hooks
.tree_size (code
);
842 /* Compute the number of bytes occupied by NODE. This routine only
843 looks at TREE_CODE, except for those nodes that have variable sizes. */
845 tree_size (const_tree node
)
847 const enum tree_code code
= TREE_CODE (node
);
851 return (sizeof (struct tree_int_cst
)
852 + (TREE_INT_CST_EXT_NUNITS (node
) - 1) * sizeof (HOST_WIDE_INT
));
855 return (offsetof (struct tree_binfo
, base_binfos
)
857 ::embedded_size (BINFO_N_BASE_BINFOS (node
)));
860 return (sizeof (struct tree_vec
)
861 + (TREE_VEC_LENGTH (node
) - 1) * sizeof (tree
));
864 return (sizeof (struct tree_vector
)
865 + (TYPE_VECTOR_SUBPARTS (TREE_TYPE (node
)) - 1) * sizeof (tree
));
868 return TREE_STRING_LENGTH (node
) + offsetof (struct tree_string
, str
) + 1;
871 return (sizeof (struct tree_omp_clause
)
872 + (omp_clause_num_ops
[OMP_CLAUSE_CODE (node
)] - 1)
876 if (TREE_CODE_CLASS (code
) == tcc_vl_exp
)
877 return (sizeof (struct tree_exp
)
878 + (VL_EXP_OPERAND_LENGTH (node
) - 1) * sizeof (tree
));
880 return tree_code_size (code
);
884 /* Record interesting allocation statistics for a tree node with CODE
888 record_node_allocation_statistics (enum tree_code code ATTRIBUTE_UNUSED
,
889 size_t length ATTRIBUTE_UNUSED
)
891 enum tree_code_class type
= TREE_CODE_CLASS (code
);
894 if (!GATHER_STATISTICS
)
899 case tcc_declaration
: /* A decl node */
903 case tcc_type
: /* a type node */
907 case tcc_statement
: /* an expression with side effects */
911 case tcc_reference
: /* a reference */
915 case tcc_expression
: /* an expression */
916 case tcc_comparison
: /* a comparison expression */
917 case tcc_unary
: /* a unary arithmetic expression */
918 case tcc_binary
: /* a binary arithmetic expression */
922 case tcc_constant
: /* a constant */
926 case tcc_exceptional
: /* something random, like an identifier. */
929 case IDENTIFIER_NODE
:
942 kind
= ssa_name_kind
;
954 kind
= omp_clause_kind
;
971 tree_code_counts
[(int) code
]++;
972 tree_node_counts
[(int) kind
]++;
973 tree_node_sizes
[(int) kind
] += length
;
976 /* Allocate and return a new UID from the DECL_UID namespace. */
979 allocate_decl_uid (void)
981 return next_decl_uid
++;
984 /* Return a newly allocated node of code CODE. For decl and type
985 nodes, some other fields are initialized. The rest of the node is
986 initialized to zero. This function cannot be used for TREE_VEC,
987 INTEGER_CST or OMP_CLAUSE nodes, which is enforced by asserts in
990 Achoo! I got a code in the node. */
993 make_node_stat (enum tree_code code MEM_STAT_DECL
)
996 enum tree_code_class type
= TREE_CODE_CLASS (code
);
997 size_t length
= tree_code_size (code
);
999 record_node_allocation_statistics (code
, length
);
1001 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
1002 TREE_SET_CODE (t
, code
);
1007 TREE_SIDE_EFFECTS (t
) = 1;
1010 case tcc_declaration
:
1011 if (CODE_CONTAINS_STRUCT (code
, TS_DECL_COMMON
))
1013 if (code
== FUNCTION_DECL
)
1015 DECL_ALIGN (t
) = FUNCTION_BOUNDARY
;
1016 DECL_MODE (t
) = FUNCTION_MODE
;
1021 DECL_SOURCE_LOCATION (t
) = input_location
;
1022 if (TREE_CODE (t
) == DEBUG_EXPR_DECL
)
1023 DECL_UID (t
) = --next_debug_decl_uid
;
1026 DECL_UID (t
) = allocate_decl_uid ();
1027 SET_DECL_PT_UID (t
, -1);
1029 if (TREE_CODE (t
) == LABEL_DECL
)
1030 LABEL_DECL_UID (t
) = -1;
1035 TYPE_UID (t
) = next_type_uid
++;
1036 TYPE_ALIGN (t
) = BITS_PER_UNIT
;
1037 TYPE_USER_ALIGN (t
) = 0;
1038 TYPE_MAIN_VARIANT (t
) = t
;
1039 TYPE_CANONICAL (t
) = t
;
1041 /* Default to no attributes for type, but let target change that. */
1042 TYPE_ATTRIBUTES (t
) = NULL_TREE
;
1043 targetm
.set_default_type_attributes (t
);
1045 /* We have not yet computed the alias set for this type. */
1046 TYPE_ALIAS_SET (t
) = -1;
1050 TREE_CONSTANT (t
) = 1;
1053 case tcc_expression
:
1059 case PREDECREMENT_EXPR
:
1060 case PREINCREMENT_EXPR
:
1061 case POSTDECREMENT_EXPR
:
1062 case POSTINCREMENT_EXPR
:
1063 /* All of these have side-effects, no matter what their
1065 TREE_SIDE_EFFECTS (t
) = 1;
1074 /* Other classes need no special treatment. */
1081 /* Return a new node with the same contents as NODE except that its
1082 TREE_CHAIN, if it has one, is zero and it has a fresh uid. */
1085 copy_node_stat (tree node MEM_STAT_DECL
)
1088 enum tree_code code
= TREE_CODE (node
);
1091 gcc_assert (code
!= STATEMENT_LIST
);
1093 length
= tree_size (node
);
1094 record_node_allocation_statistics (code
, length
);
1095 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
1096 memcpy (t
, node
, length
);
1098 if (CODE_CONTAINS_STRUCT (code
, TS_COMMON
))
1100 TREE_ASM_WRITTEN (t
) = 0;
1101 TREE_VISITED (t
) = 0;
1103 if (TREE_CODE_CLASS (code
) == tcc_declaration
)
1105 if (code
== DEBUG_EXPR_DECL
)
1106 DECL_UID (t
) = --next_debug_decl_uid
;
1109 DECL_UID (t
) = allocate_decl_uid ();
1110 if (DECL_PT_UID_SET_P (node
))
1111 SET_DECL_PT_UID (t
, DECL_PT_UID (node
));
1113 if ((TREE_CODE (node
) == PARM_DECL
|| TREE_CODE (node
) == VAR_DECL
)
1114 && DECL_HAS_VALUE_EXPR_P (node
))
1116 SET_DECL_VALUE_EXPR (t
, DECL_VALUE_EXPR (node
));
1117 DECL_HAS_VALUE_EXPR_P (t
) = 1;
1119 /* DECL_DEBUG_EXPR is copied explicitely by callers. */
1120 if (TREE_CODE (node
) == VAR_DECL
)
1122 DECL_HAS_DEBUG_EXPR_P (t
) = 0;
1123 t
->decl_with_vis
.symtab_node
= NULL
;
1125 if (TREE_CODE (node
) == VAR_DECL
&& DECL_HAS_INIT_PRIORITY_P (node
))
1127 SET_DECL_INIT_PRIORITY (t
, DECL_INIT_PRIORITY (node
));
1128 DECL_HAS_INIT_PRIORITY_P (t
) = 1;
1130 if (TREE_CODE (node
) == FUNCTION_DECL
)
1132 DECL_STRUCT_FUNCTION (t
) = NULL
;
1133 t
->decl_with_vis
.symtab_node
= NULL
;
1136 else if (TREE_CODE_CLASS (code
) == tcc_type
)
1138 TYPE_UID (t
) = next_type_uid
++;
1139 /* The following is so that the debug code for
1140 the copy is different from the original type.
1141 The two statements usually duplicate each other
1142 (because they clear fields of the same union),
1143 but the optimizer should catch that. */
1144 TYPE_SYMTAB_POINTER (t
) = 0;
1145 TYPE_SYMTAB_ADDRESS (t
) = 0;
1147 /* Do not copy the values cache. */
1148 if (TYPE_CACHED_VALUES_P (t
))
1150 TYPE_CACHED_VALUES_P (t
) = 0;
1151 TYPE_CACHED_VALUES (t
) = NULL_TREE
;
1158 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
1159 For example, this can copy a list made of TREE_LIST nodes. */
1162 copy_list (tree list
)
1170 head
= prev
= copy_node (list
);
1171 next
= TREE_CHAIN (list
);
1174 TREE_CHAIN (prev
) = copy_node (next
);
1175 prev
= TREE_CHAIN (prev
);
1176 next
= TREE_CHAIN (next
);
1182 /* Return the value that TREE_INT_CST_EXT_NUNITS should have for an
1183 INTEGER_CST with value CST and type TYPE. */
1186 get_int_cst_ext_nunits (tree type
, const wide_int
&cst
)
1188 gcc_checking_assert (cst
.get_precision () == TYPE_PRECISION (type
));
1189 /* We need an extra zero HWI if CST is an unsigned integer with its
1190 upper bit set, and if CST occupies a whole number of HWIs. */
1191 if (TYPE_UNSIGNED (type
)
1193 && (cst
.get_precision () % HOST_BITS_PER_WIDE_INT
) == 0)
1194 return cst
.get_precision () / HOST_BITS_PER_WIDE_INT
+ 1;
1195 return cst
.get_len ();
1198 /* Return a new INTEGER_CST with value CST and type TYPE. */
1201 build_new_int_cst (tree type
, const wide_int
&cst
)
1203 unsigned int len
= cst
.get_len ();
1204 unsigned int ext_len
= get_int_cst_ext_nunits (type
, cst
);
1205 tree nt
= make_int_cst (len
, ext_len
);
1210 TREE_INT_CST_ELT (nt
, ext_len
) = 0;
1211 for (unsigned int i
= len
; i
< ext_len
; ++i
)
1212 TREE_INT_CST_ELT (nt
, i
) = -1;
1214 else if (TYPE_UNSIGNED (type
)
1215 && cst
.get_precision () < len
* HOST_BITS_PER_WIDE_INT
)
1218 TREE_INT_CST_ELT (nt
, len
)
1219 = zext_hwi (cst
.elt (len
),
1220 cst
.get_precision () % HOST_BITS_PER_WIDE_INT
);
1223 for (unsigned int i
= 0; i
< len
; i
++)
1224 TREE_INT_CST_ELT (nt
, i
) = cst
.elt (i
);
1225 TREE_TYPE (nt
) = type
;
1229 /* Create an INT_CST node with a LOW value sign extended to TYPE. */
1232 build_int_cst (tree type
, HOST_WIDE_INT low
)
1234 /* Support legacy code. */
1236 type
= integer_type_node
;
1238 return wide_int_to_tree (type
, wi::shwi (low
, TYPE_PRECISION (type
)));
1242 build_int_cstu (tree type
, unsigned HOST_WIDE_INT cst
)
1244 return wide_int_to_tree (type
, wi::uhwi (cst
, TYPE_PRECISION (type
)));
1247 /* Create an INT_CST node with a LOW value sign extended to TYPE. */
1250 build_int_cst_type (tree type
, HOST_WIDE_INT low
)
1253 return wide_int_to_tree (type
, wi::shwi (low
, TYPE_PRECISION (type
)));
1256 /* Constructs tree in type TYPE from with value given by CST. Signedness
1257 of CST is assumed to be the same as the signedness of TYPE. */
1260 double_int_to_tree (tree type
, double_int cst
)
1262 return wide_int_to_tree (type
, widest_int::from (cst
, TYPE_SIGN (type
)));
1265 /* We force the wide_int CST to the range of the type TYPE by sign or
1266 zero extending it. OVERFLOWABLE indicates if we are interested in
1267 overflow of the value, when >0 we are only interested in signed
1268 overflow, for <0 we are interested in any overflow. OVERFLOWED
1269 indicates whether overflow has already occurred. CONST_OVERFLOWED
1270 indicates whether constant overflow has already occurred. We force
1271 T's value to be within range of T's type (by setting to 0 or 1 all
1272 the bits outside the type's range). We set TREE_OVERFLOWED if,
1273 OVERFLOWED is nonzero,
1274 or OVERFLOWABLE is >0 and signed overflow occurs
1275 or OVERFLOWABLE is <0 and any overflow occurs
1276 We return a new tree node for the extended wide_int. The node
1277 is shared if no overflow flags are set. */
1281 force_fit_type (tree type
, const wide_int_ref
&cst
,
1282 int overflowable
, bool overflowed
)
1284 signop sign
= TYPE_SIGN (type
);
1286 /* If we need to set overflow flags, return a new unshared node. */
1287 if (overflowed
|| !wi::fits_to_tree_p (cst
, type
))
1291 || (overflowable
> 0 && sign
== SIGNED
))
1293 wide_int tmp
= wide_int::from (cst
, TYPE_PRECISION (type
), sign
);
1294 tree t
= build_new_int_cst (type
, tmp
);
1295 TREE_OVERFLOW (t
) = 1;
1300 /* Else build a shared node. */
1301 return wide_int_to_tree (type
, cst
);
1304 /* These are the hash table functions for the hash table of INTEGER_CST
1305 nodes of a sizetype. */
1307 /* Return the hash code code X, an INTEGER_CST. */
1310 int_cst_hasher::hash (tree x
)
1312 const_tree
const t
= x
;
1313 hashval_t code
= TYPE_UID (TREE_TYPE (t
));
1316 for (i
= 0; i
< TREE_INT_CST_NUNITS (t
); i
++)
1317 code
^= TREE_INT_CST_ELT (t
, i
);
1322 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
1323 is the same as that given by *Y, which is the same. */
1326 int_cst_hasher::equal (tree x
, tree y
)
1328 const_tree
const xt
= x
;
1329 const_tree
const yt
= y
;
1331 if (TREE_TYPE (xt
) != TREE_TYPE (yt
)
1332 || TREE_INT_CST_NUNITS (xt
) != TREE_INT_CST_NUNITS (yt
)
1333 || TREE_INT_CST_EXT_NUNITS (xt
) != TREE_INT_CST_EXT_NUNITS (yt
))
1336 for (int i
= 0; i
< TREE_INT_CST_NUNITS (xt
); i
++)
1337 if (TREE_INT_CST_ELT (xt
, i
) != TREE_INT_CST_ELT (yt
, i
))
1343 /* Create an INT_CST node of TYPE and value CST.
1344 The returned node is always shared. For small integers we use a
1345 per-type vector cache, for larger ones we use a single hash table.
1346 The value is extended from its precision according to the sign of
1347 the type to be a multiple of HOST_BITS_PER_WIDE_INT. This defines
1348 the upper bits and ensures that hashing and value equality based
1349 upon the underlying HOST_WIDE_INTs works without masking. */
1352 wide_int_to_tree (tree type
, const wide_int_ref
&pcst
)
1359 unsigned int prec
= TYPE_PRECISION (type
);
1360 signop sgn
= TYPE_SIGN (type
);
1362 /* Verify that everything is canonical. */
1363 int l
= pcst
.get_len ();
1366 if (pcst
.elt (l
- 1) == 0)
1367 gcc_checking_assert (pcst
.elt (l
- 2) < 0);
1368 if (pcst
.elt (l
- 1) == (HOST_WIDE_INT
) -1)
1369 gcc_checking_assert (pcst
.elt (l
- 2) >= 0);
1372 wide_int cst
= wide_int::from (pcst
, prec
, sgn
);
1373 unsigned int ext_len
= get_int_cst_ext_nunits (type
, cst
);
1377 /* We just need to store a single HOST_WIDE_INT. */
1379 if (TYPE_UNSIGNED (type
))
1380 hwi
= cst
.to_uhwi ();
1382 hwi
= cst
.to_shwi ();
1384 switch (TREE_CODE (type
))
1387 gcc_assert (hwi
== 0);
1391 case REFERENCE_TYPE
:
1392 case POINTER_BOUNDS_TYPE
:
1393 /* Cache NULL pointer and zero bounds. */
1402 /* Cache false or true. */
1410 if (TYPE_SIGN (type
) == UNSIGNED
)
1413 limit
= INTEGER_SHARE_LIMIT
;
1414 if (IN_RANGE (hwi
, 0, INTEGER_SHARE_LIMIT
- 1))
1419 /* Cache [-1, N). */
1420 limit
= INTEGER_SHARE_LIMIT
+ 1;
1421 if (IN_RANGE (hwi
, -1, INTEGER_SHARE_LIMIT
- 1))
1435 /* Look for it in the type's vector of small shared ints. */
1436 if (!TYPE_CACHED_VALUES_P (type
))
1438 TYPE_CACHED_VALUES_P (type
) = 1;
1439 TYPE_CACHED_VALUES (type
) = make_tree_vec (limit
);
1442 t
= TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
);
1444 /* Make sure no one is clobbering the shared constant. */
1445 gcc_checking_assert (TREE_TYPE (t
) == type
1446 && TREE_INT_CST_NUNITS (t
) == 1
1447 && TREE_INT_CST_OFFSET_NUNITS (t
) == 1
1448 && TREE_INT_CST_EXT_NUNITS (t
) == 1
1449 && TREE_INT_CST_ELT (t
, 0) == hwi
);
1452 /* Create a new shared int. */
1453 t
= build_new_int_cst (type
, cst
);
1454 TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) = t
;
1459 /* Use the cache of larger shared ints, using int_cst_node as
1462 TREE_INT_CST_ELT (int_cst_node
, 0) = hwi
;
1463 TREE_TYPE (int_cst_node
) = type
;
1465 tree
*slot
= int_cst_hash_table
->find_slot (int_cst_node
, INSERT
);
1469 /* Insert this one into the hash table. */
1472 /* Make a new node for next time round. */
1473 int_cst_node
= make_int_cst (1, 1);
1479 /* The value either hashes properly or we drop it on the floor
1480 for the gc to take care of. There will not be enough of them
1483 tree nt
= build_new_int_cst (type
, cst
);
1484 tree
*slot
= int_cst_hash_table
->find_slot (nt
, INSERT
);
1488 /* Insert this one into the hash table. */
1498 cache_integer_cst (tree t
)
1500 tree type
= TREE_TYPE (t
);
1503 int prec
= TYPE_PRECISION (type
);
1505 gcc_assert (!TREE_OVERFLOW (t
));
1507 switch (TREE_CODE (type
))
1510 gcc_assert (integer_zerop (t
));
1514 case REFERENCE_TYPE
:
1515 /* Cache NULL pointer. */
1516 if (integer_zerop (t
))
1524 /* Cache false or true. */
1526 if (wi::ltu_p (t
, 2))
1527 ix
= TREE_INT_CST_ELT (t
, 0);
1532 if (TYPE_UNSIGNED (type
))
1535 limit
= INTEGER_SHARE_LIMIT
;
1537 /* This is a little hokie, but if the prec is smaller than
1538 what is necessary to hold INTEGER_SHARE_LIMIT, then the
1539 obvious test will not get the correct answer. */
1540 if (prec
< HOST_BITS_PER_WIDE_INT
)
1542 if (tree_to_uhwi (t
) < (unsigned HOST_WIDE_INT
) INTEGER_SHARE_LIMIT
)
1543 ix
= tree_to_uhwi (t
);
1545 else if (wi::ltu_p (t
, INTEGER_SHARE_LIMIT
))
1546 ix
= tree_to_uhwi (t
);
1551 limit
= INTEGER_SHARE_LIMIT
+ 1;
1553 if (integer_minus_onep (t
))
1555 else if (!wi::neg_p (t
))
1557 if (prec
< HOST_BITS_PER_WIDE_INT
)
1559 if (tree_to_shwi (t
) < INTEGER_SHARE_LIMIT
)
1560 ix
= tree_to_shwi (t
) + 1;
1562 else if (wi::ltu_p (t
, INTEGER_SHARE_LIMIT
))
1563 ix
= tree_to_shwi (t
) + 1;
1577 /* Look for it in the type's vector of small shared ints. */
1578 if (!TYPE_CACHED_VALUES_P (type
))
1580 TYPE_CACHED_VALUES_P (type
) = 1;
1581 TYPE_CACHED_VALUES (type
) = make_tree_vec (limit
);
1584 gcc_assert (TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) == NULL_TREE
);
1585 TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) = t
;
1589 /* Use the cache of larger shared ints. */
1590 tree
*slot
= int_cst_hash_table
->find_slot (t
, INSERT
);
1591 /* If there is already an entry for the number verify it's the
1594 gcc_assert (wi::eq_p (tree (*slot
), t
));
1596 /* Otherwise insert this one into the hash table. */
1602 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
1603 and the rest are zeros. */
1606 build_low_bits_mask (tree type
, unsigned bits
)
1608 gcc_assert (bits
<= TYPE_PRECISION (type
));
1610 return wide_int_to_tree (type
, wi::mask (bits
, false,
1611 TYPE_PRECISION (type
)));
1614 /* Checks that X is integer constant that can be expressed in (unsigned)
1615 HOST_WIDE_INT without loss of precision. */
1618 cst_and_fits_in_hwi (const_tree x
)
1620 if (TREE_CODE (x
) != INTEGER_CST
)
1623 if (TYPE_PRECISION (TREE_TYPE (x
)) > HOST_BITS_PER_WIDE_INT
)
1626 return TREE_INT_CST_NUNITS (x
) == 1;
1629 /* Build a newly constructed TREE_VEC node of length LEN. */
1632 make_vector_stat (unsigned len MEM_STAT_DECL
)
1635 unsigned length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vector
);
1637 record_node_allocation_statistics (VECTOR_CST
, length
);
1639 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
1641 TREE_SET_CODE (t
, VECTOR_CST
);
1642 TREE_CONSTANT (t
) = 1;
1647 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1648 are in a list pointed to by VALS. */
1651 build_vector_stat (tree type
, tree
*vals MEM_STAT_DECL
)
1655 tree v
= make_vector (TYPE_VECTOR_SUBPARTS (type
));
1656 TREE_TYPE (v
) = type
;
1658 /* Iterate through elements and check for overflow. */
1659 for (cnt
= 0; cnt
< TYPE_VECTOR_SUBPARTS (type
); ++cnt
)
1661 tree value
= vals
[cnt
];
1663 VECTOR_CST_ELT (v
, cnt
) = value
;
1665 /* Don't crash if we get an address constant. */
1666 if (!CONSTANT_CLASS_P (value
))
1669 over
|= TREE_OVERFLOW (value
);
1672 TREE_OVERFLOW (v
) = over
;
1676 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1677 are extracted from V, a vector of CONSTRUCTOR_ELT. */
1680 build_vector_from_ctor (tree type
, vec
<constructor_elt
, va_gc
> *v
)
1682 tree
*vec
= XALLOCAVEC (tree
, TYPE_VECTOR_SUBPARTS (type
));
1683 unsigned HOST_WIDE_INT idx
;
1686 FOR_EACH_CONSTRUCTOR_VALUE (v
, idx
, value
)
1688 for (; idx
< TYPE_VECTOR_SUBPARTS (type
); ++idx
)
1689 vec
[idx
] = build_zero_cst (TREE_TYPE (type
));
1691 return build_vector (type
, vec
);
1694 /* Build a vector of type VECTYPE where all the elements are SCs. */
1696 build_vector_from_val (tree vectype
, tree sc
)
1698 int i
, nunits
= TYPE_VECTOR_SUBPARTS (vectype
);
1700 if (sc
== error_mark_node
)
1703 /* Verify that the vector type is suitable for SC. Note that there
1704 is some inconsistency in the type-system with respect to restrict
1705 qualifications of pointers. Vector types always have a main-variant
1706 element type and the qualification is applied to the vector-type.
1707 So TREE_TYPE (vector-type) does not return a properly qualified
1708 vector element-type. */
1709 gcc_checking_assert (types_compatible_p (TYPE_MAIN_VARIANT (TREE_TYPE (sc
)),
1710 TREE_TYPE (vectype
)));
1712 if (CONSTANT_CLASS_P (sc
))
1714 tree
*v
= XALLOCAVEC (tree
, nunits
);
1715 for (i
= 0; i
< nunits
; ++i
)
1717 return build_vector (vectype
, v
);
1721 vec
<constructor_elt
, va_gc
> *v
;
1722 vec_alloc (v
, nunits
);
1723 for (i
= 0; i
< nunits
; ++i
)
1724 CONSTRUCTOR_APPEND_ELT (v
, NULL_TREE
, sc
);
1725 return build_constructor (vectype
, v
);
1729 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1730 are in the vec pointed to by VALS. */
1732 build_constructor (tree type
, vec
<constructor_elt
, va_gc
> *vals
)
1734 tree c
= make_node (CONSTRUCTOR
);
1736 constructor_elt
*elt
;
1737 bool constant_p
= true;
1738 bool side_effects_p
= false;
1740 TREE_TYPE (c
) = type
;
1741 CONSTRUCTOR_ELTS (c
) = vals
;
1743 FOR_EACH_VEC_SAFE_ELT (vals
, i
, elt
)
1745 /* Mostly ctors will have elts that don't have side-effects, so
1746 the usual case is to scan all the elements. Hence a single
1747 loop for both const and side effects, rather than one loop
1748 each (with early outs). */
1749 if (!TREE_CONSTANT (elt
->value
))
1751 if (TREE_SIDE_EFFECTS (elt
->value
))
1752 side_effects_p
= true;
1755 TREE_SIDE_EFFECTS (c
) = side_effects_p
;
1756 TREE_CONSTANT (c
) = constant_p
;
1761 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
1764 build_constructor_single (tree type
, tree index
, tree value
)
1766 vec
<constructor_elt
, va_gc
> *v
;
1767 constructor_elt elt
= {index
, value
};
1770 v
->quick_push (elt
);
1772 return build_constructor (type
, v
);
1776 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1777 are in a list pointed to by VALS. */
1779 build_constructor_from_list (tree type
, tree vals
)
1782 vec
<constructor_elt
, va_gc
> *v
= NULL
;
1786 vec_alloc (v
, list_length (vals
));
1787 for (t
= vals
; t
; t
= TREE_CHAIN (t
))
1788 CONSTRUCTOR_APPEND_ELT (v
, TREE_PURPOSE (t
), TREE_VALUE (t
));
1791 return build_constructor (type
, v
);
1794 /* Return a new CONSTRUCTOR node whose type is TYPE. NELTS is the number
1795 of elements, provided as index/value pairs. */
1798 build_constructor_va (tree type
, int nelts
, ...)
1800 vec
<constructor_elt
, va_gc
> *v
= NULL
;
1803 va_start (p
, nelts
);
1804 vec_alloc (v
, nelts
);
1807 tree index
= va_arg (p
, tree
);
1808 tree value
= va_arg (p
, tree
);
1809 CONSTRUCTOR_APPEND_ELT (v
, index
, value
);
1812 return build_constructor (type
, v
);
1815 /* Return a new FIXED_CST node whose type is TYPE and value is F. */
1818 build_fixed (tree type
, FIXED_VALUE_TYPE f
)
1821 FIXED_VALUE_TYPE
*fp
;
1823 v
= make_node (FIXED_CST
);
1824 fp
= ggc_alloc
<fixed_value
> ();
1825 memcpy (fp
, &f
, sizeof (FIXED_VALUE_TYPE
));
1827 TREE_TYPE (v
) = type
;
1828 TREE_FIXED_CST_PTR (v
) = fp
;
1832 /* Return a new REAL_CST node whose type is TYPE and value is D. */
1835 build_real (tree type
, REAL_VALUE_TYPE d
)
1838 REAL_VALUE_TYPE
*dp
;
1841 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
1842 Consider doing it via real_convert now. */
1844 v
= make_node (REAL_CST
);
1845 dp
= ggc_alloc
<real_value
> ();
1846 memcpy (dp
, &d
, sizeof (REAL_VALUE_TYPE
));
1848 TREE_TYPE (v
) = type
;
1849 TREE_REAL_CST_PTR (v
) = dp
;
1850 TREE_OVERFLOW (v
) = overflow
;
1854 /* Return a new REAL_CST node whose type is TYPE
1855 and whose value is the integer value of the INTEGER_CST node I. */
1858 real_value_from_int_cst (const_tree type
, const_tree i
)
1862 /* Clear all bits of the real value type so that we can later do
1863 bitwise comparisons to see if two values are the same. */
1864 memset (&d
, 0, sizeof d
);
1866 real_from_integer (&d
, type
? TYPE_MODE (type
) : VOIDmode
, i
,
1867 TYPE_SIGN (TREE_TYPE (i
)));
1871 /* Given a tree representing an integer constant I, return a tree
1872 representing the same value as a floating-point constant of type TYPE. */
1875 build_real_from_int_cst (tree type
, const_tree i
)
1878 int overflow
= TREE_OVERFLOW (i
);
1880 v
= build_real (type
, real_value_from_int_cst (type
, i
));
1882 TREE_OVERFLOW (v
) |= overflow
;
1886 /* Return a newly constructed STRING_CST node whose value is
1887 the LEN characters at STR.
1888 Note that for a C string literal, LEN should include the trailing NUL.
1889 The TREE_TYPE is not initialized. */
1892 build_string (int len
, const char *str
)
1897 /* Do not waste bytes provided by padding of struct tree_string. */
1898 length
= len
+ offsetof (struct tree_string
, str
) + 1;
1900 record_node_allocation_statistics (STRING_CST
, length
);
1902 s
= (tree
) ggc_internal_alloc (length
);
1904 memset (s
, 0, sizeof (struct tree_typed
));
1905 TREE_SET_CODE (s
, STRING_CST
);
1906 TREE_CONSTANT (s
) = 1;
1907 TREE_STRING_LENGTH (s
) = len
;
1908 memcpy (s
->string
.str
, str
, len
);
1909 s
->string
.str
[len
] = '\0';
1914 /* Return a newly constructed COMPLEX_CST node whose value is
1915 specified by the real and imaginary parts REAL and IMAG.
1916 Both REAL and IMAG should be constant nodes. TYPE, if specified,
1917 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
1920 build_complex (tree type
, tree real
, tree imag
)
1922 tree t
= make_node (COMPLEX_CST
);
1924 TREE_REALPART (t
) = real
;
1925 TREE_IMAGPART (t
) = imag
;
1926 TREE_TYPE (t
) = type
? type
: build_complex_type (TREE_TYPE (real
));
1927 TREE_OVERFLOW (t
) = TREE_OVERFLOW (real
) | TREE_OVERFLOW (imag
);
1931 /* Return a constant of arithmetic type TYPE which is the
1932 multiplicative identity of the set TYPE. */
1935 build_one_cst (tree type
)
1937 switch (TREE_CODE (type
))
1939 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
1940 case POINTER_TYPE
: case REFERENCE_TYPE
:
1942 return build_int_cst (type
, 1);
1945 return build_real (type
, dconst1
);
1947 case FIXED_POINT_TYPE
:
1948 /* We can only generate 1 for accum types. */
1949 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type
)));
1950 return build_fixed (type
, FCONST1 (TYPE_MODE (type
)));
1954 tree scalar
= build_one_cst (TREE_TYPE (type
));
1956 return build_vector_from_val (type
, scalar
);
1960 return build_complex (type
,
1961 build_one_cst (TREE_TYPE (type
)),
1962 build_zero_cst (TREE_TYPE (type
)));
1969 /* Return an integer of type TYPE containing all 1's in as much precision as
1970 it contains, or a complex or vector whose subparts are such integers. */
1973 build_all_ones_cst (tree type
)
1975 if (TREE_CODE (type
) == COMPLEX_TYPE
)
1977 tree scalar
= build_all_ones_cst (TREE_TYPE (type
));
1978 return build_complex (type
, scalar
, scalar
);
1981 return build_minus_one_cst (type
);
1984 /* Return a constant of arithmetic type TYPE which is the
1985 opposite of the multiplicative identity of the set TYPE. */
1988 build_minus_one_cst (tree type
)
1990 switch (TREE_CODE (type
))
1992 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
1993 case POINTER_TYPE
: case REFERENCE_TYPE
:
1995 return build_int_cst (type
, -1);
1998 return build_real (type
, dconstm1
);
2000 case FIXED_POINT_TYPE
:
2001 /* We can only generate 1 for accum types. */
2002 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type
)));
2003 return build_fixed (type
, fixed_from_double_int (double_int_minus_one
,
2008 tree scalar
= build_minus_one_cst (TREE_TYPE (type
));
2010 return build_vector_from_val (type
, scalar
);
2014 return build_complex (type
,
2015 build_minus_one_cst (TREE_TYPE (type
)),
2016 build_zero_cst (TREE_TYPE (type
)));
2023 /* Build 0 constant of type TYPE. This is used by constructor folding
2024 and thus the constant should be represented in memory by
2028 build_zero_cst (tree type
)
2030 switch (TREE_CODE (type
))
2032 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
2033 case POINTER_TYPE
: case REFERENCE_TYPE
:
2034 case OFFSET_TYPE
: case NULLPTR_TYPE
:
2035 return build_int_cst (type
, 0);
2038 return build_real (type
, dconst0
);
2040 case FIXED_POINT_TYPE
:
2041 return build_fixed (type
, FCONST0 (TYPE_MODE (type
)));
2045 tree scalar
= build_zero_cst (TREE_TYPE (type
));
2047 return build_vector_from_val (type
, scalar
);
2052 tree zero
= build_zero_cst (TREE_TYPE (type
));
2054 return build_complex (type
, zero
, zero
);
2058 if (!AGGREGATE_TYPE_P (type
))
2059 return fold_convert (type
, integer_zero_node
);
2060 return build_constructor (type
, NULL
);
2065 /* Build a BINFO with LEN language slots. */
2068 make_tree_binfo_stat (unsigned base_binfos MEM_STAT_DECL
)
2071 size_t length
= (offsetof (struct tree_binfo
, base_binfos
)
2072 + vec
<tree
, va_gc
>::embedded_size (base_binfos
));
2074 record_node_allocation_statistics (TREE_BINFO
, length
);
2076 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
2078 memset (t
, 0, offsetof (struct tree_binfo
, base_binfos
));
2080 TREE_SET_CODE (t
, TREE_BINFO
);
2082 BINFO_BASE_BINFOS (t
)->embedded_init (base_binfos
);
2087 /* Create a CASE_LABEL_EXPR tree node and return it. */
2090 build_case_label (tree low_value
, tree high_value
, tree label_decl
)
2092 tree t
= make_node (CASE_LABEL_EXPR
);
2094 TREE_TYPE (t
) = void_type_node
;
2095 SET_EXPR_LOCATION (t
, DECL_SOURCE_LOCATION (label_decl
));
2097 CASE_LOW (t
) = low_value
;
2098 CASE_HIGH (t
) = high_value
;
2099 CASE_LABEL (t
) = label_decl
;
2100 CASE_CHAIN (t
) = NULL_TREE
;
2105 /* Build a newly constructed INTEGER_CST node. LEN and EXT_LEN are the
2106 values of TREE_INT_CST_NUNITS and TREE_INT_CST_EXT_NUNITS respectively.
2107 The latter determines the length of the HOST_WIDE_INT vector. */
2110 make_int_cst_stat (int len
, int ext_len MEM_STAT_DECL
)
2113 int length
= ((ext_len
- 1) * sizeof (HOST_WIDE_INT
)
2114 + sizeof (struct tree_int_cst
));
2117 record_node_allocation_statistics (INTEGER_CST
, length
);
2119 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
2121 TREE_SET_CODE (t
, INTEGER_CST
);
2122 TREE_INT_CST_NUNITS (t
) = len
;
2123 TREE_INT_CST_EXT_NUNITS (t
) = ext_len
;
2124 /* to_offset can only be applied to trees that are offset_int-sized
2125 or smaller. EXT_LEN is correct if it fits, otherwise the constant
2126 must be exactly the precision of offset_int and so LEN is correct. */
2127 if (ext_len
<= OFFSET_INT_ELTS
)
2128 TREE_INT_CST_OFFSET_NUNITS (t
) = ext_len
;
2130 TREE_INT_CST_OFFSET_NUNITS (t
) = len
;
2132 TREE_CONSTANT (t
) = 1;
2137 /* Build a newly constructed TREE_VEC node of length LEN. */
2140 make_tree_vec_stat (int len MEM_STAT_DECL
)
2143 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
2145 record_node_allocation_statistics (TREE_VEC
, length
);
2147 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
2149 TREE_SET_CODE (t
, TREE_VEC
);
2150 TREE_VEC_LENGTH (t
) = len
;
2155 /* Grow a TREE_VEC node to new length LEN. */
2158 grow_tree_vec_stat (tree v
, int len MEM_STAT_DECL
)
2160 gcc_assert (TREE_CODE (v
) == TREE_VEC
);
2162 int oldlen
= TREE_VEC_LENGTH (v
);
2163 gcc_assert (len
> oldlen
);
2165 int oldlength
= (oldlen
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
2166 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
2168 record_node_allocation_statistics (TREE_VEC
, length
- oldlength
);
2170 v
= (tree
) ggc_realloc (v
, length PASS_MEM_STAT
);
2172 TREE_VEC_LENGTH (v
) = len
;
2177 /* Return 1 if EXPR is the integer constant zero or a complex constant
2181 integer_zerop (const_tree expr
)
2185 switch (TREE_CODE (expr
))
2188 return wi::eq_p (expr
, 0);
2190 return (integer_zerop (TREE_REALPART (expr
))
2191 && integer_zerop (TREE_IMAGPART (expr
)));
2195 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2196 if (!integer_zerop (VECTOR_CST_ELT (expr
, i
)))
2205 /* Return 1 if EXPR is the integer constant one or the corresponding
2206 complex constant. */
2209 integer_onep (const_tree expr
)
2213 switch (TREE_CODE (expr
))
2216 return wi::eq_p (wi::to_widest (expr
), 1);
2218 return (integer_onep (TREE_REALPART (expr
))
2219 && integer_zerop (TREE_IMAGPART (expr
)));
2223 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2224 if (!integer_onep (VECTOR_CST_ELT (expr
, i
)))
2233 /* Return 1 if EXPR is the integer constant one. For complex and vector,
2234 return 1 if every piece is the integer constant one. */
2237 integer_each_onep (const_tree expr
)
2241 if (TREE_CODE (expr
) == COMPLEX_CST
)
2242 return (integer_onep (TREE_REALPART (expr
))
2243 && integer_onep (TREE_IMAGPART (expr
)));
2245 return integer_onep (expr
);
2248 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
2249 it contains, or a complex or vector whose subparts are such integers. */
2252 integer_all_onesp (const_tree expr
)
2256 if (TREE_CODE (expr
) == COMPLEX_CST
2257 && integer_all_onesp (TREE_REALPART (expr
))
2258 && integer_all_onesp (TREE_IMAGPART (expr
)))
2261 else if (TREE_CODE (expr
) == VECTOR_CST
)
2264 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2265 if (!integer_all_onesp (VECTOR_CST_ELT (expr
, i
)))
2270 else if (TREE_CODE (expr
) != INTEGER_CST
)
2273 return wi::max_value (TYPE_PRECISION (TREE_TYPE (expr
)), UNSIGNED
) == expr
;
2276 /* Return 1 if EXPR is the integer constant minus one. */
2279 integer_minus_onep (const_tree expr
)
2283 if (TREE_CODE (expr
) == COMPLEX_CST
)
2284 return (integer_all_onesp (TREE_REALPART (expr
))
2285 && integer_zerop (TREE_IMAGPART (expr
)));
2287 return integer_all_onesp (expr
);
2290 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
2294 integer_pow2p (const_tree expr
)
2298 if (TREE_CODE (expr
) == COMPLEX_CST
2299 && integer_pow2p (TREE_REALPART (expr
))
2300 && integer_zerop (TREE_IMAGPART (expr
)))
2303 if (TREE_CODE (expr
) != INTEGER_CST
)
2306 return wi::popcount (expr
) == 1;
2309 /* Return 1 if EXPR is an integer constant other than zero or a
2310 complex constant other than zero. */
2313 integer_nonzerop (const_tree expr
)
2317 return ((TREE_CODE (expr
) == INTEGER_CST
2318 && !wi::eq_p (expr
, 0))
2319 || (TREE_CODE (expr
) == COMPLEX_CST
2320 && (integer_nonzerop (TREE_REALPART (expr
))
2321 || integer_nonzerop (TREE_IMAGPART (expr
)))));
2324 /* Return 1 if EXPR is the integer constant one. For vector,
2325 return 1 if every piece is the integer constant minus one
2326 (representing the value TRUE). */
2329 integer_truep (const_tree expr
)
2333 if (TREE_CODE (expr
) == VECTOR_CST
)
2334 return integer_all_onesp (expr
);
2335 return integer_onep (expr
);
2338 /* Return 1 if EXPR is the fixed-point constant zero. */
2341 fixed_zerop (const_tree expr
)
2343 return (TREE_CODE (expr
) == FIXED_CST
2344 && TREE_FIXED_CST (expr
).data
.is_zero ());
2347 /* Return the power of two represented by a tree node known to be a
2351 tree_log2 (const_tree expr
)
2355 if (TREE_CODE (expr
) == COMPLEX_CST
)
2356 return tree_log2 (TREE_REALPART (expr
));
2358 return wi::exact_log2 (expr
);
2361 /* Similar, but return the largest integer Y such that 2 ** Y is less
2362 than or equal to EXPR. */
2365 tree_floor_log2 (const_tree expr
)
2369 if (TREE_CODE (expr
) == COMPLEX_CST
)
2370 return tree_log2 (TREE_REALPART (expr
));
2372 return wi::floor_log2 (expr
);
2375 /* Return number of known trailing zero bits in EXPR, or, if the value of
2376 EXPR is known to be zero, the precision of it's type. */
2379 tree_ctz (const_tree expr
)
2381 if (!INTEGRAL_TYPE_P (TREE_TYPE (expr
))
2382 && !POINTER_TYPE_P (TREE_TYPE (expr
)))
2385 unsigned int ret1
, ret2
, prec
= TYPE_PRECISION (TREE_TYPE (expr
));
2386 switch (TREE_CODE (expr
))
2389 ret1
= wi::ctz (expr
);
2390 return MIN (ret1
, prec
);
2392 ret1
= wi::ctz (get_nonzero_bits (expr
));
2393 return MIN (ret1
, prec
);
2400 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2403 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2404 return MIN (ret1
, ret2
);
2405 case POINTER_PLUS_EXPR
:
2406 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2407 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2408 /* Second operand is sizetype, which could be in theory
2409 wider than pointer's precision. Make sure we never
2410 return more than prec. */
2411 ret2
= MIN (ret2
, prec
);
2412 return MIN (ret1
, ret2
);
2414 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2415 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2416 return MAX (ret1
, ret2
);
2418 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2419 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2420 return MIN (ret1
+ ret2
, prec
);
2422 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2423 if (tree_fits_uhwi_p (TREE_OPERAND (expr
, 1))
2424 && (tree_to_uhwi (TREE_OPERAND (expr
, 1)) < prec
))
2426 ret2
= tree_to_uhwi (TREE_OPERAND (expr
, 1));
2427 return MIN (ret1
+ ret2
, prec
);
2431 if (tree_fits_uhwi_p (TREE_OPERAND (expr
, 1))
2432 && (tree_to_uhwi (TREE_OPERAND (expr
, 1)) < prec
))
2434 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2435 ret2
= tree_to_uhwi (TREE_OPERAND (expr
, 1));
2440 case TRUNC_DIV_EXPR
:
2442 case FLOOR_DIV_EXPR
:
2443 case ROUND_DIV_EXPR
:
2444 case EXACT_DIV_EXPR
:
2445 if (TREE_CODE (TREE_OPERAND (expr
, 1)) == INTEGER_CST
2446 && tree_int_cst_sgn (TREE_OPERAND (expr
, 1)) == 1)
2448 int l
= tree_log2 (TREE_OPERAND (expr
, 1));
2451 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2459 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2460 if (ret1
&& ret1
== TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (expr
, 0))))
2462 return MIN (ret1
, prec
);
2464 return tree_ctz (TREE_OPERAND (expr
, 0));
2466 ret1
= tree_ctz (TREE_OPERAND (expr
, 1));
2469 ret2
= tree_ctz (TREE_OPERAND (expr
, 2));
2470 return MIN (ret1
, ret2
);
2472 return tree_ctz (TREE_OPERAND (expr
, 1));
2474 ret1
= get_pointer_alignment (CONST_CAST_TREE (expr
));
2475 if (ret1
> BITS_PER_UNIT
)
2477 ret1
= ctz_hwi (ret1
/ BITS_PER_UNIT
);
2478 return MIN (ret1
, prec
);
2486 /* Return 1 if EXPR is the real constant zero. Trailing zeroes matter for
2487 decimal float constants, so don't return 1 for them. */
2490 real_zerop (const_tree expr
)
2494 switch (TREE_CODE (expr
))
2497 return REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst0
)
2498 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2500 return real_zerop (TREE_REALPART (expr
))
2501 && real_zerop (TREE_IMAGPART (expr
));
2505 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2506 if (!real_zerop (VECTOR_CST_ELT (expr
, i
)))
2515 /* Return 1 if EXPR is the real constant one in real or complex form.
2516 Trailing zeroes matter for decimal float constants, so don't return
2520 real_onep (const_tree expr
)
2524 switch (TREE_CODE (expr
))
2527 return REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst1
)
2528 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2530 return real_onep (TREE_REALPART (expr
))
2531 && real_zerop (TREE_IMAGPART (expr
));
2535 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2536 if (!real_onep (VECTOR_CST_ELT (expr
, i
)))
2545 /* Return 1 if EXPR is the real constant minus one. Trailing zeroes
2546 matter for decimal float constants, so don't return 1 for them. */
2549 real_minus_onep (const_tree expr
)
2553 switch (TREE_CODE (expr
))
2556 return REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconstm1
)
2557 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2559 return real_minus_onep (TREE_REALPART (expr
))
2560 && real_zerop (TREE_IMAGPART (expr
));
2564 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2565 if (!real_minus_onep (VECTOR_CST_ELT (expr
, i
)))
2574 /* Nonzero if EXP is a constant or a cast of a constant. */
2577 really_constant_p (const_tree exp
)
2579 /* This is not quite the same as STRIP_NOPS. It does more. */
2580 while (CONVERT_EXPR_P (exp
)
2581 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
2582 exp
= TREE_OPERAND (exp
, 0);
2583 return TREE_CONSTANT (exp
);
2586 /* Return first list element whose TREE_VALUE is ELEM.
2587 Return 0 if ELEM is not in LIST. */
2590 value_member (tree elem
, tree list
)
2594 if (elem
== TREE_VALUE (list
))
2596 list
= TREE_CHAIN (list
);
2601 /* Return first list element whose TREE_PURPOSE is ELEM.
2602 Return 0 if ELEM is not in LIST. */
2605 purpose_member (const_tree elem
, tree list
)
2609 if (elem
== TREE_PURPOSE (list
))
2611 list
= TREE_CHAIN (list
);
2616 /* Return true if ELEM is in V. */
2619 vec_member (const_tree elem
, vec
<tree
, va_gc
> *v
)
2623 FOR_EACH_VEC_SAFE_ELT (v
, ix
, t
)
2629 /* Returns element number IDX (zero-origin) of chain CHAIN, or
2633 chain_index (int idx
, tree chain
)
2635 for (; chain
&& idx
> 0; --idx
)
2636 chain
= TREE_CHAIN (chain
);
2640 /* Return nonzero if ELEM is part of the chain CHAIN. */
2643 chain_member (const_tree elem
, const_tree chain
)
2649 chain
= DECL_CHAIN (chain
);
2655 /* Return the length of a chain of nodes chained through TREE_CHAIN.
2656 We expect a null pointer to mark the end of the chain.
2657 This is the Lisp primitive `length'. */
2660 list_length (const_tree t
)
2663 #ifdef ENABLE_TREE_CHECKING
2671 #ifdef ENABLE_TREE_CHECKING
2674 gcc_assert (p
!= q
);
2682 /* Returns the first FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
2683 UNION_TYPE TYPE, or NULL_TREE if none. */
2686 first_field (const_tree type
)
2688 tree t
= TYPE_FIELDS (type
);
2689 while (t
&& TREE_CODE (t
) != FIELD_DECL
)
2694 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
2695 by modifying the last node in chain 1 to point to chain 2.
2696 This is the Lisp primitive `nconc'. */
2699 chainon (tree op1
, tree op2
)
2708 for (t1
= op1
; TREE_CHAIN (t1
); t1
= TREE_CHAIN (t1
))
2710 TREE_CHAIN (t1
) = op2
;
2712 #ifdef ENABLE_TREE_CHECKING
2715 for (t2
= op2
; t2
; t2
= TREE_CHAIN (t2
))
2716 gcc_assert (t2
!= t1
);
2723 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
2726 tree_last (tree chain
)
2730 while ((next
= TREE_CHAIN (chain
)))
2735 /* Reverse the order of elements in the chain T,
2736 and return the new head of the chain (old last element). */
2741 tree prev
= 0, decl
, next
;
2742 for (decl
= t
; decl
; decl
= next
)
2744 /* We shouldn't be using this function to reverse BLOCK chains; we
2745 have blocks_nreverse for that. */
2746 gcc_checking_assert (TREE_CODE (decl
) != BLOCK
);
2747 next
= TREE_CHAIN (decl
);
2748 TREE_CHAIN (decl
) = prev
;
2754 /* Return a newly created TREE_LIST node whose
2755 purpose and value fields are PARM and VALUE. */
2758 build_tree_list_stat (tree parm
, tree value MEM_STAT_DECL
)
2760 tree t
= make_node_stat (TREE_LIST PASS_MEM_STAT
);
2761 TREE_PURPOSE (t
) = parm
;
2762 TREE_VALUE (t
) = value
;
2766 /* Build a chain of TREE_LIST nodes from a vector. */
2769 build_tree_list_vec_stat (const vec
<tree
, va_gc
> *vec MEM_STAT_DECL
)
2771 tree ret
= NULL_TREE
;
2775 FOR_EACH_VEC_SAFE_ELT (vec
, i
, t
)
2777 *pp
= build_tree_list_stat (NULL
, t PASS_MEM_STAT
);
2778 pp
= &TREE_CHAIN (*pp
);
2783 /* Return a newly created TREE_LIST node whose
2784 purpose and value fields are PURPOSE and VALUE
2785 and whose TREE_CHAIN is CHAIN. */
2788 tree_cons_stat (tree purpose
, tree value
, tree chain MEM_STAT_DECL
)
2792 node
= ggc_alloc_tree_node_stat (sizeof (struct tree_list
) PASS_MEM_STAT
);
2793 memset (node
, 0, sizeof (struct tree_common
));
2795 record_node_allocation_statistics (TREE_LIST
, sizeof (struct tree_list
));
2797 TREE_SET_CODE (node
, TREE_LIST
);
2798 TREE_CHAIN (node
) = chain
;
2799 TREE_PURPOSE (node
) = purpose
;
2800 TREE_VALUE (node
) = value
;
2804 /* Return the values of the elements of a CONSTRUCTOR as a vector of
2808 ctor_to_vec (tree ctor
)
2810 vec
<tree
, va_gc
> *vec
;
2811 vec_alloc (vec
, CONSTRUCTOR_NELTS (ctor
));
2815 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), ix
, val
)
2816 vec
->quick_push (val
);
2821 /* Return the size nominally occupied by an object of type TYPE
2822 when it resides in memory. The value is measured in units of bytes,
2823 and its data type is that normally used for type sizes
2824 (which is the first type created by make_signed_type or
2825 make_unsigned_type). */
2828 size_in_bytes (const_tree type
)
2832 if (type
== error_mark_node
)
2833 return integer_zero_node
;
2835 type
= TYPE_MAIN_VARIANT (type
);
2836 t
= TYPE_SIZE_UNIT (type
);
2840 lang_hooks
.types
.incomplete_type_error (NULL_TREE
, type
);
2841 return size_zero_node
;
2847 /* Return the size of TYPE (in bytes) as a wide integer
2848 or return -1 if the size can vary or is larger than an integer. */
2851 int_size_in_bytes (const_tree type
)
2855 if (type
== error_mark_node
)
2858 type
= TYPE_MAIN_VARIANT (type
);
2859 t
= TYPE_SIZE_UNIT (type
);
2861 if (t
&& tree_fits_uhwi_p (t
))
2862 return TREE_INT_CST_LOW (t
);
2867 /* Return the maximum size of TYPE (in bytes) as a wide integer
2868 or return -1 if the size can vary or is larger than an integer. */
2871 max_int_size_in_bytes (const_tree type
)
2873 HOST_WIDE_INT size
= -1;
2876 /* If this is an array type, check for a possible MAX_SIZE attached. */
2878 if (TREE_CODE (type
) == ARRAY_TYPE
)
2880 size_tree
= TYPE_ARRAY_MAX_SIZE (type
);
2882 if (size_tree
&& tree_fits_uhwi_p (size_tree
))
2883 size
= tree_to_uhwi (size_tree
);
2886 /* If we still haven't been able to get a size, see if the language
2887 can compute a maximum size. */
2891 size_tree
= lang_hooks
.types
.max_size (type
);
2893 if (size_tree
&& tree_fits_uhwi_p (size_tree
))
2894 size
= tree_to_uhwi (size_tree
);
2900 /* Return the bit position of FIELD, in bits from the start of the record.
2901 This is a tree of type bitsizetype. */
2904 bit_position (const_tree field
)
2906 return bit_from_pos (DECL_FIELD_OFFSET (field
),
2907 DECL_FIELD_BIT_OFFSET (field
));
2910 /* Return the byte position of FIELD, in bytes from the start of the record.
2911 This is a tree of type sizetype. */
2914 byte_position (const_tree field
)
2916 return byte_from_pos (DECL_FIELD_OFFSET (field
),
2917 DECL_FIELD_BIT_OFFSET (field
));
2920 /* Likewise, but return as an integer. It must be representable in
2921 that way (since it could be a signed value, we don't have the
2922 option of returning -1 like int_size_in_byte can. */
2925 int_byte_position (const_tree field
)
2927 return tree_to_shwi (byte_position (field
));
2930 /* Return the strictest alignment, in bits, that T is known to have. */
2933 expr_align (const_tree t
)
2935 unsigned int align0
, align1
;
2937 switch (TREE_CODE (t
))
2939 CASE_CONVERT
: case NON_LVALUE_EXPR
:
2940 /* If we have conversions, we know that the alignment of the
2941 object must meet each of the alignments of the types. */
2942 align0
= expr_align (TREE_OPERAND (t
, 0));
2943 align1
= TYPE_ALIGN (TREE_TYPE (t
));
2944 return MAX (align0
, align1
);
2946 case SAVE_EXPR
: case COMPOUND_EXPR
: case MODIFY_EXPR
:
2947 case INIT_EXPR
: case TARGET_EXPR
: case WITH_CLEANUP_EXPR
:
2948 case CLEANUP_POINT_EXPR
:
2949 /* These don't change the alignment of an object. */
2950 return expr_align (TREE_OPERAND (t
, 0));
2953 /* The best we can do is say that the alignment is the least aligned
2955 align0
= expr_align (TREE_OPERAND (t
, 1));
2956 align1
= expr_align (TREE_OPERAND (t
, 2));
2957 return MIN (align0
, align1
);
2959 /* FIXME: LABEL_DECL and CONST_DECL never have DECL_ALIGN set
2960 meaningfully, it's always 1. */
2961 case LABEL_DECL
: case CONST_DECL
:
2962 case VAR_DECL
: case PARM_DECL
: case RESULT_DECL
:
2964 gcc_assert (DECL_ALIGN (t
) != 0);
2965 return DECL_ALIGN (t
);
2971 /* Otherwise take the alignment from that of the type. */
2972 return TYPE_ALIGN (TREE_TYPE (t
));
2975 /* Return, as a tree node, the number of elements for TYPE (which is an
2976 ARRAY_TYPE) minus one. This counts only elements of the top array. */
2979 array_type_nelts (const_tree type
)
2981 tree index_type
, min
, max
;
2983 /* If they did it with unspecified bounds, then we should have already
2984 given an error about it before we got here. */
2985 if (! TYPE_DOMAIN (type
))
2986 return error_mark_node
;
2988 index_type
= TYPE_DOMAIN (type
);
2989 min
= TYPE_MIN_VALUE (index_type
);
2990 max
= TYPE_MAX_VALUE (index_type
);
2992 /* TYPE_MAX_VALUE may not be set if the array has unknown length. */
2994 return error_mark_node
;
2996 return (integer_zerop (min
)
2998 : fold_build2 (MINUS_EXPR
, TREE_TYPE (max
), max
, min
));
3001 /* If arg is static -- a reference to an object in static storage -- then
3002 return the object. This is not the same as the C meaning of `static'.
3003 If arg isn't static, return NULL. */
3008 switch (TREE_CODE (arg
))
3011 /* Nested functions are static, even though taking their address will
3012 involve a trampoline as we unnest the nested function and create
3013 the trampoline on the tree level. */
3017 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
3018 && ! DECL_THREAD_LOCAL_P (arg
)
3019 && ! DECL_DLLIMPORT_P (arg
)
3023 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
3027 return TREE_STATIC (arg
) ? arg
: NULL
;
3034 /* If the thing being referenced is not a field, then it is
3035 something language specific. */
3036 gcc_assert (TREE_CODE (TREE_OPERAND (arg
, 1)) == FIELD_DECL
);
3038 /* If we are referencing a bitfield, we can't evaluate an
3039 ADDR_EXPR at compile time and so it isn't a constant. */
3040 if (DECL_BIT_FIELD (TREE_OPERAND (arg
, 1)))
3043 return staticp (TREE_OPERAND (arg
, 0));
3049 return TREE_CONSTANT (TREE_OPERAND (arg
, 0)) ? arg
: NULL
;
3052 case ARRAY_RANGE_REF
:
3053 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg
))) == INTEGER_CST
3054 && TREE_CODE (TREE_OPERAND (arg
, 1)) == INTEGER_CST
)
3055 return staticp (TREE_OPERAND (arg
, 0));
3059 case COMPOUND_LITERAL_EXPR
:
3060 return TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (arg
)) ? arg
: NULL
;
3070 /* Return whether OP is a DECL whose address is function-invariant. */
3073 decl_address_invariant_p (const_tree op
)
3075 /* The conditions below are slightly less strict than the one in
3078 switch (TREE_CODE (op
))
3087 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
3088 || DECL_THREAD_LOCAL_P (op
)
3089 || DECL_CONTEXT (op
) == current_function_decl
3090 || decl_function_context (op
) == current_function_decl
)
3095 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
3096 || decl_function_context (op
) == current_function_decl
)
3107 /* Return whether OP is a DECL whose address is interprocedural-invariant. */
3110 decl_address_ip_invariant_p (const_tree op
)
3112 /* The conditions below are slightly less strict than the one in
3115 switch (TREE_CODE (op
))
3123 if (((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
3124 && !DECL_DLLIMPORT_P (op
))
3125 || DECL_THREAD_LOCAL_P (op
))
3130 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
)))
3142 /* Return true if T is function-invariant (internal function, does
3143 not handle arithmetic; that's handled in skip_simple_arithmetic and
3144 tree_invariant_p). */
3146 static bool tree_invariant_p (tree t
);
3149 tree_invariant_p_1 (tree t
)
3153 if (TREE_CONSTANT (t
)
3154 || (TREE_READONLY (t
) && !TREE_SIDE_EFFECTS (t
)))
3157 switch (TREE_CODE (t
))
3163 op
= TREE_OPERAND (t
, 0);
3164 while (handled_component_p (op
))
3166 switch (TREE_CODE (op
))
3169 case ARRAY_RANGE_REF
:
3170 if (!tree_invariant_p (TREE_OPERAND (op
, 1))
3171 || TREE_OPERAND (op
, 2) != NULL_TREE
3172 || TREE_OPERAND (op
, 3) != NULL_TREE
)
3177 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
3183 op
= TREE_OPERAND (op
, 0);
3186 return CONSTANT_CLASS_P (op
) || decl_address_invariant_p (op
);
3195 /* Return true if T is function-invariant. */
3198 tree_invariant_p (tree t
)
3200 tree inner
= skip_simple_arithmetic (t
);
3201 return tree_invariant_p_1 (inner
);
3204 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
3205 Do this to any expression which may be used in more than one place,
3206 but must be evaluated only once.
3208 Normally, expand_expr would reevaluate the expression each time.
3209 Calling save_expr produces something that is evaluated and recorded
3210 the first time expand_expr is called on it. Subsequent calls to
3211 expand_expr just reuse the recorded value.
3213 The call to expand_expr that generates code that actually computes
3214 the value is the first call *at compile time*. Subsequent calls
3215 *at compile time* generate code to use the saved value.
3216 This produces correct result provided that *at run time* control
3217 always flows through the insns made by the first expand_expr
3218 before reaching the other places where the save_expr was evaluated.
3219 You, the caller of save_expr, must make sure this is so.
3221 Constants, and certain read-only nodes, are returned with no
3222 SAVE_EXPR because that is safe. Expressions containing placeholders
3223 are not touched; see tree.def for an explanation of what these
3227 save_expr (tree expr
)
3229 tree t
= fold (expr
);
3232 /* If the tree evaluates to a constant, then we don't want to hide that
3233 fact (i.e. this allows further folding, and direct checks for constants).
3234 However, a read-only object that has side effects cannot be bypassed.
3235 Since it is no problem to reevaluate literals, we just return the
3237 inner
= skip_simple_arithmetic (t
);
3238 if (TREE_CODE (inner
) == ERROR_MARK
)
3241 if (tree_invariant_p_1 (inner
))
3244 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
3245 it means that the size or offset of some field of an object depends on
3246 the value within another field.
3248 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
3249 and some variable since it would then need to be both evaluated once and
3250 evaluated more than once. Front-ends must assure this case cannot
3251 happen by surrounding any such subexpressions in their own SAVE_EXPR
3252 and forcing evaluation at the proper time. */
3253 if (contains_placeholder_p (inner
))
3256 t
= build1 (SAVE_EXPR
, TREE_TYPE (expr
), t
);
3257 SET_EXPR_LOCATION (t
, EXPR_LOCATION (expr
));
3259 /* This expression might be placed ahead of a jump to ensure that the
3260 value was computed on both sides of the jump. So make sure it isn't
3261 eliminated as dead. */
3262 TREE_SIDE_EFFECTS (t
) = 1;
3266 /* Look inside EXPR into any simple arithmetic operations. Return the
3267 outermost non-arithmetic or non-invariant node. */
3270 skip_simple_arithmetic (tree expr
)
3272 /* We don't care about whether this can be used as an lvalue in this
3274 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
3275 expr
= TREE_OPERAND (expr
, 0);
3277 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
3278 a constant, it will be more efficient to not make another SAVE_EXPR since
3279 it will allow better simplification and GCSE will be able to merge the
3280 computations if they actually occur. */
3283 if (UNARY_CLASS_P (expr
))
3284 expr
= TREE_OPERAND (expr
, 0);
3285 else if (BINARY_CLASS_P (expr
))
3287 if (tree_invariant_p (TREE_OPERAND (expr
, 1)))
3288 expr
= TREE_OPERAND (expr
, 0);
3289 else if (tree_invariant_p (TREE_OPERAND (expr
, 0)))
3290 expr
= TREE_OPERAND (expr
, 1);
3301 /* Look inside EXPR into simple arithmetic operations involving constants.
3302 Return the outermost non-arithmetic or non-constant node. */
3305 skip_simple_constant_arithmetic (tree expr
)
3307 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
3308 expr
= TREE_OPERAND (expr
, 0);
3312 if (UNARY_CLASS_P (expr
))
3313 expr
= TREE_OPERAND (expr
, 0);
3314 else if (BINARY_CLASS_P (expr
))
3316 if (TREE_CONSTANT (TREE_OPERAND (expr
, 1)))
3317 expr
= TREE_OPERAND (expr
, 0);
3318 else if (TREE_CONSTANT (TREE_OPERAND (expr
, 0)))
3319 expr
= TREE_OPERAND (expr
, 1);
3330 /* Return which tree structure is used by T. */
3332 enum tree_node_structure_enum
3333 tree_node_structure (const_tree t
)
3335 const enum tree_code code
= TREE_CODE (t
);
3336 return tree_node_structure_for_code (code
);
3339 /* Set various status flags when building a CALL_EXPR object T. */
3342 process_call_operands (tree t
)
3344 bool side_effects
= TREE_SIDE_EFFECTS (t
);
3345 bool read_only
= false;
3346 int i
= call_expr_flags (t
);
3348 /* Calls have side-effects, except those to const or pure functions. */
3349 if ((i
& ECF_LOOPING_CONST_OR_PURE
) || !(i
& (ECF_CONST
| ECF_PURE
)))
3350 side_effects
= true;
3351 /* Propagate TREE_READONLY of arguments for const functions. */
3355 if (!side_effects
|| read_only
)
3356 for (i
= 1; i
< TREE_OPERAND_LENGTH (t
); i
++)
3358 tree op
= TREE_OPERAND (t
, i
);
3359 if (op
&& TREE_SIDE_EFFECTS (op
))
3360 side_effects
= true;
3361 if (op
&& !TREE_READONLY (op
) && !CONSTANT_CLASS_P (op
))
3365 TREE_SIDE_EFFECTS (t
) = side_effects
;
3366 TREE_READONLY (t
) = read_only
;
3369 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
3370 size or offset that depends on a field within a record. */
3373 contains_placeholder_p (const_tree exp
)
3375 enum tree_code code
;
3380 code
= TREE_CODE (exp
);
3381 if (code
== PLACEHOLDER_EXPR
)
3384 switch (TREE_CODE_CLASS (code
))
3387 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
3388 position computations since they will be converted into a
3389 WITH_RECORD_EXPR involving the reference, which will assume
3390 here will be valid. */
3391 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
3393 case tcc_exceptional
:
3394 if (code
== TREE_LIST
)
3395 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp
))
3396 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp
)));
3401 case tcc_comparison
:
3402 case tcc_expression
:
3406 /* Ignoring the first operand isn't quite right, but works best. */
3407 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1));
3410 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
3411 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1))
3412 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 2)));
3415 /* The save_expr function never wraps anything containing
3416 a PLACEHOLDER_EXPR. */
3423 switch (TREE_CODE_LENGTH (code
))
3426 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
3428 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
3429 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1)));
3440 const_call_expr_arg_iterator iter
;
3441 FOR_EACH_CONST_CALL_EXPR_ARG (arg
, iter
, exp
)
3442 if (CONTAINS_PLACEHOLDER_P (arg
))
3456 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
3457 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
3461 type_contains_placeholder_1 (const_tree type
)
3463 /* If the size contains a placeholder or the parent type (component type in
3464 the case of arrays) type involves a placeholder, this type does. */
3465 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type
))
3466 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type
))
3467 || (!POINTER_TYPE_P (type
)
3469 && type_contains_placeholder_p (TREE_TYPE (type
))))
3472 /* Now do type-specific checks. Note that the last part of the check above
3473 greatly limits what we have to do below. */
3474 switch (TREE_CODE (type
))
3477 case POINTER_BOUNDS_TYPE
:
3483 case REFERENCE_TYPE
:
3492 case FIXED_POINT_TYPE
:
3493 /* Here we just check the bounds. */
3494 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type
))
3495 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type
)));
3498 /* We have already checked the component type above, so just check the
3500 return type_contains_placeholder_p (TYPE_DOMAIN (type
));
3504 case QUAL_UNION_TYPE
:
3508 for (field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
3509 if (TREE_CODE (field
) == FIELD_DECL
3510 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field
))
3511 || (TREE_CODE (type
) == QUAL_UNION_TYPE
3512 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field
)))
3513 || type_contains_placeholder_p (TREE_TYPE (field
))))
3524 /* Wrapper around above function used to cache its result. */
3527 type_contains_placeholder_p (tree type
)
3531 /* If the contains_placeholder_bits field has been initialized,
3532 then we know the answer. */
3533 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) > 0)
3534 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) - 1;
3536 /* Indicate that we've seen this type node, and the answer is false.
3537 This is what we want to return if we run into recursion via fields. */
3538 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = 1;
3540 /* Compute the real value. */
3541 result
= type_contains_placeholder_1 (type
);
3543 /* Store the real value. */
3544 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = result
+ 1;
3549 /* Push tree EXP onto vector QUEUE if it is not already present. */
3552 push_without_duplicates (tree exp
, vec
<tree
> *queue
)
3557 FOR_EACH_VEC_ELT (*queue
, i
, iter
)
3558 if (simple_cst_equal (iter
, exp
) == 1)
3562 queue
->safe_push (exp
);
3565 /* Given a tree EXP, find all occurrences of references to fields
3566 in a PLACEHOLDER_EXPR and place them in vector REFS without
3567 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
3568 we assume here that EXP contains only arithmetic expressions
3569 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
3573 find_placeholder_in_expr (tree exp
, vec
<tree
> *refs
)
3575 enum tree_code code
= TREE_CODE (exp
);
3579 /* We handle TREE_LIST and COMPONENT_REF separately. */
3580 if (code
== TREE_LIST
)
3582 FIND_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), refs
);
3583 FIND_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), refs
);
3585 else if (code
== COMPONENT_REF
)
3587 for (inner
= TREE_OPERAND (exp
, 0);
3588 REFERENCE_CLASS_P (inner
);
3589 inner
= TREE_OPERAND (inner
, 0))
3592 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
)
3593 push_without_duplicates (exp
, refs
);
3595 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), refs
);
3598 switch (TREE_CODE_CLASS (code
))
3603 case tcc_declaration
:
3604 /* Variables allocated to static storage can stay. */
3605 if (!TREE_STATIC (exp
))
3606 push_without_duplicates (exp
, refs
);
3609 case tcc_expression
:
3610 /* This is the pattern built in ada/make_aligning_type. */
3611 if (code
== ADDR_EXPR
3612 && TREE_CODE (TREE_OPERAND (exp
, 0)) == PLACEHOLDER_EXPR
)
3614 push_without_duplicates (exp
, refs
);
3618 /* Fall through... */
3620 case tcc_exceptional
:
3623 case tcc_comparison
:
3625 for (i
= 0; i
< TREE_CODE_LENGTH (code
); i
++)
3626 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
3630 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3631 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
3639 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
3640 return a tree with all occurrences of references to F in a
3641 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
3642 CONST_DECLs. Note that we assume here that EXP contains only
3643 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
3644 occurring only in their argument list. */
3647 substitute_in_expr (tree exp
, tree f
, tree r
)
3649 enum tree_code code
= TREE_CODE (exp
);
3650 tree op0
, op1
, op2
, op3
;
3653 /* We handle TREE_LIST and COMPONENT_REF separately. */
3654 if (code
== TREE_LIST
)
3656 op0
= SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp
), f
, r
);
3657 op1
= SUBSTITUTE_IN_EXPR (TREE_VALUE (exp
), f
, r
);
3658 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
3661 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
3663 else if (code
== COMPONENT_REF
)
3667 /* If this expression is getting a value from a PLACEHOLDER_EXPR
3668 and it is the right field, replace it with R. */
3669 for (inner
= TREE_OPERAND (exp
, 0);
3670 REFERENCE_CLASS_P (inner
);
3671 inner
= TREE_OPERAND (inner
, 0))
3675 op1
= TREE_OPERAND (exp
, 1);
3677 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& op1
== f
)
3680 /* If this expression hasn't been completed let, leave it alone. */
3681 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& !TREE_TYPE (inner
))
3684 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3685 if (op0
== TREE_OPERAND (exp
, 0))
3689 = fold_build3 (COMPONENT_REF
, TREE_TYPE (exp
), op0
, op1
, NULL_TREE
);
3692 switch (TREE_CODE_CLASS (code
))
3697 case tcc_declaration
:
3703 case tcc_expression
:
3707 /* Fall through... */
3709 case tcc_exceptional
:
3712 case tcc_comparison
:
3714 switch (TREE_CODE_LENGTH (code
))
3720 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3721 if (op0
== TREE_OPERAND (exp
, 0))
3724 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
3728 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3729 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3731 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
3734 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
3738 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3739 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3740 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
3742 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3743 && op2
== TREE_OPERAND (exp
, 2))
3746 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
3750 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3751 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3752 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
3753 op3
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 3), f
, r
);
3755 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3756 && op2
== TREE_OPERAND (exp
, 2)
3757 && op3
== TREE_OPERAND (exp
, 3))
3761 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
3773 new_tree
= NULL_TREE
;
3775 /* If we are trying to replace F with a constant, inline back
3776 functions which do nothing else than computing a value from
3777 the arguments they are passed. This makes it possible to
3778 fold partially or entirely the replacement expression. */
3779 if (CONSTANT_CLASS_P (r
) && code
== CALL_EXPR
)
3781 tree t
= maybe_inline_call_in_expr (exp
);
3783 return SUBSTITUTE_IN_EXPR (t
, f
, r
);
3786 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3788 tree op
= TREE_OPERAND (exp
, i
);
3789 tree new_op
= SUBSTITUTE_IN_EXPR (op
, f
, r
);
3793 new_tree
= copy_node (exp
);
3794 TREE_OPERAND (new_tree
, i
) = new_op
;
3800 new_tree
= fold (new_tree
);
3801 if (TREE_CODE (new_tree
) == CALL_EXPR
)
3802 process_call_operands (new_tree
);
3813 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
3815 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
3816 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
3821 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
3822 for it within OBJ, a tree that is an object or a chain of references. */
3825 substitute_placeholder_in_expr (tree exp
, tree obj
)
3827 enum tree_code code
= TREE_CODE (exp
);
3828 tree op0
, op1
, op2
, op3
;
3831 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
3832 in the chain of OBJ. */
3833 if (code
== PLACEHOLDER_EXPR
)
3835 tree need_type
= TYPE_MAIN_VARIANT (TREE_TYPE (exp
));
3838 for (elt
= obj
; elt
!= 0;
3839 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
3840 || TREE_CODE (elt
) == COND_EXPR
)
3841 ? TREE_OPERAND (elt
, 1)
3842 : (REFERENCE_CLASS_P (elt
)
3843 || UNARY_CLASS_P (elt
)
3844 || BINARY_CLASS_P (elt
)
3845 || VL_EXP_CLASS_P (elt
)
3846 || EXPRESSION_CLASS_P (elt
))
3847 ? TREE_OPERAND (elt
, 0) : 0))
3848 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt
)) == need_type
)
3851 for (elt
= obj
; elt
!= 0;
3852 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
3853 || TREE_CODE (elt
) == COND_EXPR
)
3854 ? TREE_OPERAND (elt
, 1)
3855 : (REFERENCE_CLASS_P (elt
)
3856 || UNARY_CLASS_P (elt
)
3857 || BINARY_CLASS_P (elt
)
3858 || VL_EXP_CLASS_P (elt
)
3859 || EXPRESSION_CLASS_P (elt
))
3860 ? TREE_OPERAND (elt
, 0) : 0))
3861 if (POINTER_TYPE_P (TREE_TYPE (elt
))
3862 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt
)))
3864 return fold_build1 (INDIRECT_REF
, need_type
, elt
);
3866 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
3867 survives until RTL generation, there will be an error. */
3871 /* TREE_LIST is special because we need to look at TREE_VALUE
3872 and TREE_CHAIN, not TREE_OPERANDS. */
3873 else if (code
== TREE_LIST
)
3875 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), obj
);
3876 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), obj
);
3877 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
3880 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
3883 switch (TREE_CODE_CLASS (code
))
3886 case tcc_declaration
:
3889 case tcc_exceptional
:
3892 case tcc_comparison
:
3893 case tcc_expression
:
3896 switch (TREE_CODE_LENGTH (code
))
3902 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3903 if (op0
== TREE_OPERAND (exp
, 0))
3906 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
3910 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3911 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
3913 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
3916 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
3920 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3921 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
3922 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
3924 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3925 && op2
== TREE_OPERAND (exp
, 2))
3928 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
3932 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3933 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
3934 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
3935 op3
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 3), obj
);
3937 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3938 && op2
== TREE_OPERAND (exp
, 2)
3939 && op3
== TREE_OPERAND (exp
, 3))
3943 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
3955 new_tree
= NULL_TREE
;
3957 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3959 tree op
= TREE_OPERAND (exp
, i
);
3960 tree new_op
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (op
, obj
);
3964 new_tree
= copy_node (exp
);
3965 TREE_OPERAND (new_tree
, i
) = new_op
;
3971 new_tree
= fold (new_tree
);
3972 if (TREE_CODE (new_tree
) == CALL_EXPR
)
3973 process_call_operands (new_tree
);
3984 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
3986 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
3987 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
3993 /* Subroutine of stabilize_reference; this is called for subtrees of
3994 references. Any expression with side-effects must be put in a SAVE_EXPR
3995 to ensure that it is only evaluated once.
3997 We don't put SAVE_EXPR nodes around everything, because assigning very
3998 simple expressions to temporaries causes us to miss good opportunities
3999 for optimizations. Among other things, the opportunity to fold in the
4000 addition of a constant into an addressing mode often gets lost, e.g.
4001 "y[i+1] += x;". In general, we take the approach that we should not make
4002 an assignment unless we are forced into it - i.e., that any non-side effect
4003 operator should be allowed, and that cse should take care of coalescing
4004 multiple utterances of the same expression should that prove fruitful. */
4007 stabilize_reference_1 (tree e
)
4010 enum tree_code code
= TREE_CODE (e
);
4012 /* We cannot ignore const expressions because it might be a reference
4013 to a const array but whose index contains side-effects. But we can
4014 ignore things that are actual constant or that already have been
4015 handled by this function. */
4017 if (tree_invariant_p (e
))
4020 switch (TREE_CODE_CLASS (code
))
4022 case tcc_exceptional
:
4024 case tcc_declaration
:
4025 case tcc_comparison
:
4027 case tcc_expression
:
4030 /* If the expression has side-effects, then encase it in a SAVE_EXPR
4031 so that it will only be evaluated once. */
4032 /* The reference (r) and comparison (<) classes could be handled as
4033 below, but it is generally faster to only evaluate them once. */
4034 if (TREE_SIDE_EFFECTS (e
))
4035 return save_expr (e
);
4039 /* Constants need no processing. In fact, we should never reach
4044 /* Division is slow and tends to be compiled with jumps,
4045 especially the division by powers of 2 that is often
4046 found inside of an array reference. So do it just once. */
4047 if (code
== TRUNC_DIV_EXPR
|| code
== TRUNC_MOD_EXPR
4048 || code
== FLOOR_DIV_EXPR
|| code
== FLOOR_MOD_EXPR
4049 || code
== CEIL_DIV_EXPR
|| code
== CEIL_MOD_EXPR
4050 || code
== ROUND_DIV_EXPR
|| code
== ROUND_MOD_EXPR
)
4051 return save_expr (e
);
4052 /* Recursively stabilize each operand. */
4053 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)),
4054 stabilize_reference_1 (TREE_OPERAND (e
, 1)));
4058 /* Recursively stabilize each operand. */
4059 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)));
4066 TREE_TYPE (result
) = TREE_TYPE (e
);
4067 TREE_READONLY (result
) = TREE_READONLY (e
);
4068 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (e
);
4069 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (e
);
4074 /* Stabilize a reference so that we can use it any number of times
4075 without causing its operands to be evaluated more than once.
4076 Returns the stabilized reference. This works by means of save_expr,
4077 so see the caveats in the comments about save_expr.
4079 Also allows conversion expressions whose operands are references.
4080 Any other kind of expression is returned unchanged. */
4083 stabilize_reference (tree ref
)
4086 enum tree_code code
= TREE_CODE (ref
);
4093 /* No action is needed in this case. */
4098 case FIX_TRUNC_EXPR
:
4099 result
= build_nt (code
, stabilize_reference (TREE_OPERAND (ref
, 0)));
4103 result
= build_nt (INDIRECT_REF
,
4104 stabilize_reference_1 (TREE_OPERAND (ref
, 0)));
4108 result
= build_nt (COMPONENT_REF
,
4109 stabilize_reference (TREE_OPERAND (ref
, 0)),
4110 TREE_OPERAND (ref
, 1), NULL_TREE
);
4114 result
= build_nt (BIT_FIELD_REF
,
4115 stabilize_reference (TREE_OPERAND (ref
, 0)),
4116 TREE_OPERAND (ref
, 1), TREE_OPERAND (ref
, 2));
4120 result
= build_nt (ARRAY_REF
,
4121 stabilize_reference (TREE_OPERAND (ref
, 0)),
4122 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
4123 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
4126 case ARRAY_RANGE_REF
:
4127 result
= build_nt (ARRAY_RANGE_REF
,
4128 stabilize_reference (TREE_OPERAND (ref
, 0)),
4129 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
4130 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
4134 /* We cannot wrap the first expression in a SAVE_EXPR, as then
4135 it wouldn't be ignored. This matters when dealing with
4137 return stabilize_reference_1 (ref
);
4139 /* If arg isn't a kind of lvalue we recognize, make no change.
4140 Caller should recognize the error for an invalid lvalue. */
4145 return error_mark_node
;
4148 TREE_TYPE (result
) = TREE_TYPE (ref
);
4149 TREE_READONLY (result
) = TREE_READONLY (ref
);
4150 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (ref
);
4151 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (ref
);
4156 /* Low-level constructors for expressions. */
4158 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
4159 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
4162 recompute_tree_invariant_for_addr_expr (tree t
)
4165 bool tc
= true, se
= false;
4167 /* We started out assuming this address is both invariant and constant, but
4168 does not have side effects. Now go down any handled components and see if
4169 any of them involve offsets that are either non-constant or non-invariant.
4170 Also check for side-effects.
4172 ??? Note that this code makes no attempt to deal with the case where
4173 taking the address of something causes a copy due to misalignment. */
4175 #define UPDATE_FLAGS(NODE) \
4176 do { tree _node = (NODE); \
4177 if (_node && !TREE_CONSTANT (_node)) tc = false; \
4178 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
4180 for (node
= TREE_OPERAND (t
, 0); handled_component_p (node
);
4181 node
= TREE_OPERAND (node
, 0))
4183 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
4184 array reference (probably made temporarily by the G++ front end),
4185 so ignore all the operands. */
4186 if ((TREE_CODE (node
) == ARRAY_REF
4187 || TREE_CODE (node
) == ARRAY_RANGE_REF
)
4188 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node
, 0))) == ARRAY_TYPE
)
4190 UPDATE_FLAGS (TREE_OPERAND (node
, 1));
4191 if (TREE_OPERAND (node
, 2))
4192 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
4193 if (TREE_OPERAND (node
, 3))
4194 UPDATE_FLAGS (TREE_OPERAND (node
, 3));
4196 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
4197 FIELD_DECL, apparently. The G++ front end can put something else
4198 there, at least temporarily. */
4199 else if (TREE_CODE (node
) == COMPONENT_REF
4200 && TREE_CODE (TREE_OPERAND (node
, 1)) == FIELD_DECL
)
4202 if (TREE_OPERAND (node
, 2))
4203 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
4207 node
= lang_hooks
.expr_to_decl (node
, &tc
, &se
);
4209 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
4210 the address, since &(*a)->b is a form of addition. If it's a constant, the
4211 address is constant too. If it's a decl, its address is constant if the
4212 decl is static. Everything else is not constant and, furthermore,
4213 taking the address of a volatile variable is not volatile. */
4214 if (TREE_CODE (node
) == INDIRECT_REF
4215 || TREE_CODE (node
) == MEM_REF
)
4216 UPDATE_FLAGS (TREE_OPERAND (node
, 0));
4217 else if (CONSTANT_CLASS_P (node
))
4219 else if (DECL_P (node
))
4220 tc
&= (staticp (node
) != NULL_TREE
);
4224 se
|= TREE_SIDE_EFFECTS (node
);
4228 TREE_CONSTANT (t
) = tc
;
4229 TREE_SIDE_EFFECTS (t
) = se
;
4233 /* Build an expression of code CODE, data type TYPE, and operands as
4234 specified. Expressions and reference nodes can be created this way.
4235 Constants, decls, types and misc nodes cannot be.
4237 We define 5 non-variadic functions, from 0 to 4 arguments. This is
4238 enough for all extant tree codes. */
4241 build0_stat (enum tree_code code
, tree tt MEM_STAT_DECL
)
4245 gcc_assert (TREE_CODE_LENGTH (code
) == 0);
4247 t
= make_node_stat (code PASS_MEM_STAT
);
4254 build1_stat (enum tree_code code
, tree type
, tree node MEM_STAT_DECL
)
4256 int length
= sizeof (struct tree_exp
);
4259 record_node_allocation_statistics (code
, length
);
4261 gcc_assert (TREE_CODE_LENGTH (code
) == 1);
4263 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
4265 memset (t
, 0, sizeof (struct tree_common
));
4267 TREE_SET_CODE (t
, code
);
4269 TREE_TYPE (t
) = type
;
4270 SET_EXPR_LOCATION (t
, UNKNOWN_LOCATION
);
4271 TREE_OPERAND (t
, 0) = node
;
4272 if (node
&& !TYPE_P (node
))
4274 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (node
);
4275 TREE_READONLY (t
) = TREE_READONLY (node
);
4278 if (TREE_CODE_CLASS (code
) == tcc_statement
)
4279 TREE_SIDE_EFFECTS (t
) = 1;
4283 /* All of these have side-effects, no matter what their
4285 TREE_SIDE_EFFECTS (t
) = 1;
4286 TREE_READONLY (t
) = 0;
4290 /* Whether a dereference is readonly has nothing to do with whether
4291 its operand is readonly. */
4292 TREE_READONLY (t
) = 0;
4297 recompute_tree_invariant_for_addr_expr (t
);
4301 if ((TREE_CODE_CLASS (code
) == tcc_unary
|| code
== VIEW_CONVERT_EXPR
)
4302 && node
&& !TYPE_P (node
)
4303 && TREE_CONSTANT (node
))
4304 TREE_CONSTANT (t
) = 1;
4305 if (TREE_CODE_CLASS (code
) == tcc_reference
4306 && node
&& TREE_THIS_VOLATILE (node
))
4307 TREE_THIS_VOLATILE (t
) = 1;
4314 #define PROCESS_ARG(N) \
4316 TREE_OPERAND (t, N) = arg##N; \
4317 if (arg##N &&!TYPE_P (arg##N)) \
4319 if (TREE_SIDE_EFFECTS (arg##N)) \
4321 if (!TREE_READONLY (arg##N) \
4322 && !CONSTANT_CLASS_P (arg##N)) \
4323 (void) (read_only = 0); \
4324 if (!TREE_CONSTANT (arg##N)) \
4325 (void) (constant = 0); \
4330 build2_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1 MEM_STAT_DECL
)
4332 bool constant
, read_only
, side_effects
;
4335 gcc_assert (TREE_CODE_LENGTH (code
) == 2);
4337 if ((code
== MINUS_EXPR
|| code
== PLUS_EXPR
|| code
== MULT_EXPR
)
4338 && arg0
&& arg1
&& tt
&& POINTER_TYPE_P (tt
)
4339 /* When sizetype precision doesn't match that of pointers
4340 we need to be able to build explicit extensions or truncations
4341 of the offset argument. */
4342 && TYPE_PRECISION (sizetype
) == TYPE_PRECISION (tt
))
4343 gcc_assert (TREE_CODE (arg0
) == INTEGER_CST
4344 && TREE_CODE (arg1
) == INTEGER_CST
);
4346 if (code
== POINTER_PLUS_EXPR
&& arg0
&& arg1
&& tt
)
4347 gcc_assert (POINTER_TYPE_P (tt
) && POINTER_TYPE_P (TREE_TYPE (arg0
))
4348 && ptrofftype_p (TREE_TYPE (arg1
)));
4350 t
= make_node_stat (code PASS_MEM_STAT
);
4353 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
4354 result based on those same flags for the arguments. But if the
4355 arguments aren't really even `tree' expressions, we shouldn't be trying
4358 /* Expressions without side effects may be constant if their
4359 arguments are as well. */
4360 constant
= (TREE_CODE_CLASS (code
) == tcc_comparison
4361 || TREE_CODE_CLASS (code
) == tcc_binary
);
4363 side_effects
= TREE_SIDE_EFFECTS (t
);
4368 TREE_SIDE_EFFECTS (t
) = side_effects
;
4369 if (code
== MEM_REF
)
4371 if (arg0
&& TREE_CODE (arg0
) == ADDR_EXPR
)
4373 tree o
= TREE_OPERAND (arg0
, 0);
4374 TREE_READONLY (t
) = TREE_READONLY (o
);
4375 TREE_THIS_VOLATILE (t
) = TREE_THIS_VOLATILE (o
);
4380 TREE_READONLY (t
) = read_only
;
4381 TREE_CONSTANT (t
) = constant
;
4382 TREE_THIS_VOLATILE (t
)
4383 = (TREE_CODE_CLASS (code
) == tcc_reference
4384 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4392 build3_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4393 tree arg2 MEM_STAT_DECL
)
4395 bool constant
, read_only
, side_effects
;
4398 gcc_assert (TREE_CODE_LENGTH (code
) == 3);
4399 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
4401 t
= make_node_stat (code PASS_MEM_STAT
);
4406 /* As a special exception, if COND_EXPR has NULL branches, we
4407 assume that it is a gimple statement and always consider
4408 it to have side effects. */
4409 if (code
== COND_EXPR
4410 && tt
== void_type_node
4411 && arg1
== NULL_TREE
4412 && arg2
== NULL_TREE
)
4413 side_effects
= true;
4415 side_effects
= TREE_SIDE_EFFECTS (t
);
4421 if (code
== COND_EXPR
)
4422 TREE_READONLY (t
) = read_only
;
4424 TREE_SIDE_EFFECTS (t
) = side_effects
;
4425 TREE_THIS_VOLATILE (t
)
4426 = (TREE_CODE_CLASS (code
) == tcc_reference
4427 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4433 build4_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4434 tree arg2
, tree arg3 MEM_STAT_DECL
)
4436 bool constant
, read_only
, side_effects
;
4439 gcc_assert (TREE_CODE_LENGTH (code
) == 4);
4441 t
= make_node_stat (code PASS_MEM_STAT
);
4444 side_effects
= TREE_SIDE_EFFECTS (t
);
4451 TREE_SIDE_EFFECTS (t
) = side_effects
;
4452 TREE_THIS_VOLATILE (t
)
4453 = (TREE_CODE_CLASS (code
) == tcc_reference
4454 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4460 build5_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4461 tree arg2
, tree arg3
, tree arg4 MEM_STAT_DECL
)
4463 bool constant
, read_only
, side_effects
;
4466 gcc_assert (TREE_CODE_LENGTH (code
) == 5);
4468 t
= make_node_stat (code PASS_MEM_STAT
);
4471 side_effects
= TREE_SIDE_EFFECTS (t
);
4479 TREE_SIDE_EFFECTS (t
) = side_effects
;
4480 if (code
== TARGET_MEM_REF
)
4482 if (arg0
&& TREE_CODE (arg0
) == ADDR_EXPR
)
4484 tree o
= TREE_OPERAND (arg0
, 0);
4485 TREE_READONLY (t
) = TREE_READONLY (o
);
4486 TREE_THIS_VOLATILE (t
) = TREE_THIS_VOLATILE (o
);
4490 TREE_THIS_VOLATILE (t
)
4491 = (TREE_CODE_CLASS (code
) == tcc_reference
4492 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4497 /* Build a simple MEM_REF tree with the sematics of a plain INDIRECT_REF
4498 on the pointer PTR. */
4501 build_simple_mem_ref_loc (location_t loc
, tree ptr
)
4503 HOST_WIDE_INT offset
= 0;
4504 tree ptype
= TREE_TYPE (ptr
);
4506 /* For convenience allow addresses that collapse to a simple base
4508 if (TREE_CODE (ptr
) == ADDR_EXPR
4509 && (handled_component_p (TREE_OPERAND (ptr
, 0))
4510 || TREE_CODE (TREE_OPERAND (ptr
, 0)) == MEM_REF
))
4512 ptr
= get_addr_base_and_unit_offset (TREE_OPERAND (ptr
, 0), &offset
);
4514 ptr
= build_fold_addr_expr (ptr
);
4515 gcc_assert (is_gimple_reg (ptr
) || is_gimple_min_invariant (ptr
));
4517 tem
= build2 (MEM_REF
, TREE_TYPE (ptype
),
4518 ptr
, build_int_cst (ptype
, offset
));
4519 SET_EXPR_LOCATION (tem
, loc
);
4523 /* Return the constant offset of a MEM_REF or TARGET_MEM_REF tree T. */
4526 mem_ref_offset (const_tree t
)
4528 return offset_int::from (TREE_OPERAND (t
, 1), SIGNED
);
4531 /* Return an invariant ADDR_EXPR of type TYPE taking the address of BASE
4532 offsetted by OFFSET units. */
4535 build_invariant_address (tree type
, tree base
, HOST_WIDE_INT offset
)
4537 tree ref
= fold_build2 (MEM_REF
, TREE_TYPE (type
),
4538 build_fold_addr_expr (base
),
4539 build_int_cst (ptr_type_node
, offset
));
4540 tree addr
= build1 (ADDR_EXPR
, type
, ref
);
4541 recompute_tree_invariant_for_addr_expr (addr
);
4545 /* Similar except don't specify the TREE_TYPE
4546 and leave the TREE_SIDE_EFFECTS as 0.
4547 It is permissible for arguments to be null,
4548 or even garbage if their values do not matter. */
4551 build_nt (enum tree_code code
, ...)
4558 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
4562 t
= make_node (code
);
4563 length
= TREE_CODE_LENGTH (code
);
4565 for (i
= 0; i
< length
; i
++)
4566 TREE_OPERAND (t
, i
) = va_arg (p
, tree
);
4572 /* Similar to build_nt, but for creating a CALL_EXPR object with a
4576 build_nt_call_vec (tree fn
, vec
<tree
, va_gc
> *args
)
4581 ret
= build_vl_exp (CALL_EXPR
, vec_safe_length (args
) + 3);
4582 CALL_EXPR_FN (ret
) = fn
;
4583 CALL_EXPR_STATIC_CHAIN (ret
) = NULL_TREE
;
4584 FOR_EACH_VEC_SAFE_ELT (args
, ix
, t
)
4585 CALL_EXPR_ARG (ret
, ix
) = t
;
4589 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
4590 We do NOT enter this node in any sort of symbol table.
4592 LOC is the location of the decl.
4594 layout_decl is used to set up the decl's storage layout.
4595 Other slots are initialized to 0 or null pointers. */
4598 build_decl_stat (location_t loc
, enum tree_code code
, tree name
,
4599 tree type MEM_STAT_DECL
)
4603 t
= make_node_stat (code PASS_MEM_STAT
);
4604 DECL_SOURCE_LOCATION (t
) = loc
;
4606 /* if (type == error_mark_node)
4607 type = integer_type_node; */
4608 /* That is not done, deliberately, so that having error_mark_node
4609 as the type can suppress useless errors in the use of this variable. */
4611 DECL_NAME (t
) = name
;
4612 TREE_TYPE (t
) = type
;
4614 if (code
== VAR_DECL
|| code
== PARM_DECL
|| code
== RESULT_DECL
)
4620 /* Builds and returns function declaration with NAME and TYPE. */
4623 build_fn_decl (const char *name
, tree type
)
4625 tree id
= get_identifier (name
);
4626 tree decl
= build_decl (input_location
, FUNCTION_DECL
, id
, type
);
4628 DECL_EXTERNAL (decl
) = 1;
4629 TREE_PUBLIC (decl
) = 1;
4630 DECL_ARTIFICIAL (decl
) = 1;
4631 TREE_NOTHROW (decl
) = 1;
4636 vec
<tree
, va_gc
> *all_translation_units
;
4638 /* Builds a new translation-unit decl with name NAME, queues it in the
4639 global list of translation-unit decls and returns it. */
4642 build_translation_unit_decl (tree name
)
4644 tree tu
= build_decl (UNKNOWN_LOCATION
, TRANSLATION_UNIT_DECL
,
4646 TRANSLATION_UNIT_LANGUAGE (tu
) = lang_hooks
.name
;
4647 vec_safe_push (all_translation_units
, tu
);
4652 /* BLOCK nodes are used to represent the structure of binding contours
4653 and declarations, once those contours have been exited and their contents
4654 compiled. This information is used for outputting debugging info. */
4657 build_block (tree vars
, tree subblocks
, tree supercontext
, tree chain
)
4659 tree block
= make_node (BLOCK
);
4661 BLOCK_VARS (block
) = vars
;
4662 BLOCK_SUBBLOCKS (block
) = subblocks
;
4663 BLOCK_SUPERCONTEXT (block
) = supercontext
;
4664 BLOCK_CHAIN (block
) = chain
;
4669 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
4671 LOC is the location to use in tree T. */
4674 protected_set_expr_location (tree t
, location_t loc
)
4676 if (CAN_HAVE_LOCATION_P (t
))
4677 SET_EXPR_LOCATION (t
, loc
);
4680 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
4684 build_decl_attribute_variant (tree ddecl
, tree attribute
)
4686 DECL_ATTRIBUTES (ddecl
) = attribute
;
4690 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4691 is ATTRIBUTE and its qualifiers are QUALS.
4693 Record such modified types already made so we don't make duplicates. */
4696 build_type_attribute_qual_variant (tree ttype
, tree attribute
, int quals
)
4698 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype
), attribute
))
4700 inchash::hash hstate
;
4704 enum tree_code code
= TREE_CODE (ttype
);
4706 /* Building a distinct copy of a tagged type is inappropriate; it
4707 causes breakage in code that expects there to be a one-to-one
4708 relationship between a struct and its fields.
4709 build_duplicate_type is another solution (as used in
4710 handle_transparent_union_attribute), but that doesn't play well
4711 with the stronger C++ type identity model. */
4712 if (TREE_CODE (ttype
) == RECORD_TYPE
4713 || TREE_CODE (ttype
) == UNION_TYPE
4714 || TREE_CODE (ttype
) == QUAL_UNION_TYPE
4715 || TREE_CODE (ttype
) == ENUMERAL_TYPE
)
4717 warning (OPT_Wattributes
,
4718 "ignoring attributes applied to %qT after definition",
4719 TYPE_MAIN_VARIANT (ttype
));
4720 return build_qualified_type (ttype
, quals
);
4723 ttype
= build_qualified_type (ttype
, TYPE_UNQUALIFIED
);
4724 ntype
= build_distinct_type_copy (ttype
);
4726 TYPE_ATTRIBUTES (ntype
) = attribute
;
4728 hstate
.add_int (code
);
4729 if (TREE_TYPE (ntype
))
4730 hstate
.add_object (TYPE_HASH (TREE_TYPE (ntype
)));
4731 attribute_hash_list (attribute
, hstate
);
4733 switch (TREE_CODE (ntype
))
4736 type_hash_list (TYPE_ARG_TYPES (ntype
), hstate
);
4739 if (TYPE_DOMAIN (ntype
))
4740 hstate
.add_object (TYPE_HASH (TYPE_DOMAIN (ntype
)));
4743 t
= TYPE_MAX_VALUE (ntype
);
4744 for (i
= 0; i
< TREE_INT_CST_NUNITS (t
); i
++)
4745 hstate
.add_object (TREE_INT_CST_ELT (t
, i
));
4748 case FIXED_POINT_TYPE
:
4750 unsigned int precision
= TYPE_PRECISION (ntype
);
4751 hstate
.add_object (precision
);
4758 ntype
= type_hash_canon (hstate
.end(), ntype
);
4760 /* If the target-dependent attributes make NTYPE different from
4761 its canonical type, we will need to use structural equality
4762 checks for this type. */
4763 if (TYPE_STRUCTURAL_EQUALITY_P (ttype
)
4764 || !comp_type_attributes (ntype
, ttype
))
4765 SET_TYPE_STRUCTURAL_EQUALITY (ntype
);
4766 else if (TYPE_CANONICAL (ntype
) == ntype
)
4767 TYPE_CANONICAL (ntype
) = TYPE_CANONICAL (ttype
);
4769 ttype
= build_qualified_type (ntype
, quals
);
4771 else if (TYPE_QUALS (ttype
) != quals
)
4772 ttype
= build_qualified_type (ttype
, quals
);
4777 /* Check if "omp declare simd" attribute arguments, CLAUSES1 and CLAUSES2, are
4781 omp_declare_simd_clauses_equal (tree clauses1
, tree clauses2
)
4784 for (cl1
= clauses1
, cl2
= clauses2
;
4786 cl1
= OMP_CLAUSE_CHAIN (cl1
), cl2
= OMP_CLAUSE_CHAIN (cl2
))
4788 if (OMP_CLAUSE_CODE (cl1
) != OMP_CLAUSE_CODE (cl2
))
4790 if (OMP_CLAUSE_CODE (cl1
) != OMP_CLAUSE_SIMDLEN
)
4792 if (simple_cst_equal (OMP_CLAUSE_DECL (cl1
),
4793 OMP_CLAUSE_DECL (cl2
)) != 1)
4796 switch (OMP_CLAUSE_CODE (cl1
))
4798 case OMP_CLAUSE_ALIGNED
:
4799 if (simple_cst_equal (OMP_CLAUSE_ALIGNED_ALIGNMENT (cl1
),
4800 OMP_CLAUSE_ALIGNED_ALIGNMENT (cl2
)) != 1)
4803 case OMP_CLAUSE_LINEAR
:
4804 if (simple_cst_equal (OMP_CLAUSE_LINEAR_STEP (cl1
),
4805 OMP_CLAUSE_LINEAR_STEP (cl2
)) != 1)
4808 case OMP_CLAUSE_SIMDLEN
:
4809 if (simple_cst_equal (OMP_CLAUSE_SIMDLEN_EXPR (cl1
),
4810 OMP_CLAUSE_SIMDLEN_EXPR (cl2
)) != 1)
4819 /* Compare two constructor-element-type constants. Return 1 if the lists
4820 are known to be equal; otherwise return 0. */
4823 simple_cst_list_equal (const_tree l1
, const_tree l2
)
4825 while (l1
!= NULL_TREE
&& l2
!= NULL_TREE
)
4827 if (simple_cst_equal (TREE_VALUE (l1
), TREE_VALUE (l2
)) != 1)
4830 l1
= TREE_CHAIN (l1
);
4831 l2
= TREE_CHAIN (l2
);
4837 /* Compare two attributes for their value identity. Return true if the
4838 attribute values are known to be equal; otherwise return false.
4842 attribute_value_equal (const_tree attr1
, const_tree attr2
)
4844 if (TREE_VALUE (attr1
) == TREE_VALUE (attr2
))
4847 if (TREE_VALUE (attr1
) != NULL_TREE
4848 && TREE_CODE (TREE_VALUE (attr1
)) == TREE_LIST
4849 && TREE_VALUE (attr2
) != NULL
4850 && TREE_CODE (TREE_VALUE (attr2
)) == TREE_LIST
)
4851 return (simple_cst_list_equal (TREE_VALUE (attr1
),
4852 TREE_VALUE (attr2
)) == 1);
4854 if ((flag_openmp
|| flag_openmp_simd
)
4855 && TREE_VALUE (attr1
) && TREE_VALUE (attr2
)
4856 && TREE_CODE (TREE_VALUE (attr1
)) == OMP_CLAUSE
4857 && TREE_CODE (TREE_VALUE (attr2
)) == OMP_CLAUSE
)
4858 return omp_declare_simd_clauses_equal (TREE_VALUE (attr1
),
4859 TREE_VALUE (attr2
));
4861 return (simple_cst_equal (TREE_VALUE (attr1
), TREE_VALUE (attr2
)) == 1);
4864 /* Return 0 if the attributes for two types are incompatible, 1 if they
4865 are compatible, and 2 if they are nearly compatible (which causes a
4866 warning to be generated). */
4868 comp_type_attributes (const_tree type1
, const_tree type2
)
4870 const_tree a1
= TYPE_ATTRIBUTES (type1
);
4871 const_tree a2
= TYPE_ATTRIBUTES (type2
);
4876 for (a
= a1
; a
!= NULL_TREE
; a
= TREE_CHAIN (a
))
4878 const struct attribute_spec
*as
;
4881 as
= lookup_attribute_spec (get_attribute_name (a
));
4882 if (!as
|| as
->affects_type_identity
== false)
4885 attr
= lookup_attribute (as
->name
, CONST_CAST_TREE (a2
));
4886 if (!attr
|| !attribute_value_equal (a
, attr
))
4891 for (a
= a2
; a
!= NULL_TREE
; a
= TREE_CHAIN (a
))
4893 const struct attribute_spec
*as
;
4895 as
= lookup_attribute_spec (get_attribute_name (a
));
4896 if (!as
|| as
->affects_type_identity
== false)
4899 if (!lookup_attribute (as
->name
, CONST_CAST_TREE (a1
)))
4901 /* We don't need to compare trees again, as we did this
4902 already in first loop. */
4904 /* All types - affecting identity - are equal, so
4905 there is no need to call target hook for comparison. */
4909 /* As some type combinations - like default calling-convention - might
4910 be compatible, we have to call the target hook to get the final result. */
4911 return targetm
.comp_type_attributes (type1
, type2
);
4914 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4917 Record such modified types already made so we don't make duplicates. */
4920 build_type_attribute_variant (tree ttype
, tree attribute
)
4922 return build_type_attribute_qual_variant (ttype
, attribute
,
4923 TYPE_QUALS (ttype
));
4927 /* Reset the expression *EXPR_P, a size or position.
4929 ??? We could reset all non-constant sizes or positions. But it's cheap
4930 enough to not do so and refrain from adding workarounds to dwarf2out.c.
4932 We need to reset self-referential sizes or positions because they cannot
4933 be gimplified and thus can contain a CALL_EXPR after the gimplification
4934 is finished, which will run afoul of LTO streaming. And they need to be
4935 reset to something essentially dummy but not constant, so as to preserve
4936 the properties of the object they are attached to. */
4939 free_lang_data_in_one_sizepos (tree
*expr_p
)
4941 tree expr
= *expr_p
;
4942 if (CONTAINS_PLACEHOLDER_P (expr
))
4943 *expr_p
= build0 (PLACEHOLDER_EXPR
, TREE_TYPE (expr
));
4947 /* Reset all the fields in a binfo node BINFO. We only keep
4948 BINFO_VTABLE, which is used by gimple_fold_obj_type_ref. */
4951 free_lang_data_in_binfo (tree binfo
)
4956 gcc_assert (TREE_CODE (binfo
) == TREE_BINFO
);
4958 BINFO_VIRTUALS (binfo
) = NULL_TREE
;
4959 BINFO_BASE_ACCESSES (binfo
) = NULL
;
4960 BINFO_INHERITANCE_CHAIN (binfo
) = NULL_TREE
;
4961 BINFO_SUBVTT_INDEX (binfo
) = NULL_TREE
;
4963 FOR_EACH_VEC_ELT (*BINFO_BASE_BINFOS (binfo
), i
, t
)
4964 free_lang_data_in_binfo (t
);
4968 /* Reset all language specific information still present in TYPE. */
4971 free_lang_data_in_type (tree type
)
4973 gcc_assert (TYPE_P (type
));
4975 /* Give the FE a chance to remove its own data first. */
4976 lang_hooks
.free_lang_data (type
);
4978 TREE_LANG_FLAG_0 (type
) = 0;
4979 TREE_LANG_FLAG_1 (type
) = 0;
4980 TREE_LANG_FLAG_2 (type
) = 0;
4981 TREE_LANG_FLAG_3 (type
) = 0;
4982 TREE_LANG_FLAG_4 (type
) = 0;
4983 TREE_LANG_FLAG_5 (type
) = 0;
4984 TREE_LANG_FLAG_6 (type
) = 0;
4986 if (TREE_CODE (type
) == FUNCTION_TYPE
)
4988 /* Remove the const and volatile qualifiers from arguments. The
4989 C++ front end removes them, but the C front end does not,
4990 leading to false ODR violation errors when merging two
4991 instances of the same function signature compiled by
4992 different front ends. */
4995 for (p
= TYPE_ARG_TYPES (type
); p
; p
= TREE_CHAIN (p
))
4997 tree arg_type
= TREE_VALUE (p
);
4999 if (TYPE_READONLY (arg_type
) || TYPE_VOLATILE (arg_type
))
5001 int quals
= TYPE_QUALS (arg_type
)
5003 & ~TYPE_QUAL_VOLATILE
;
5004 TREE_VALUE (p
) = build_qualified_type (arg_type
, quals
);
5005 free_lang_data_in_type (TREE_VALUE (p
));
5010 /* Remove members that are not actually FIELD_DECLs from the field
5011 list of an aggregate. These occur in C++. */
5012 if (RECORD_OR_UNION_TYPE_P (type
))
5016 /* Note that TYPE_FIELDS can be shared across distinct
5017 TREE_TYPEs. Therefore, if the first field of TYPE_FIELDS is
5018 to be removed, we cannot set its TREE_CHAIN to NULL.
5019 Otherwise, we would not be able to find all the other fields
5020 in the other instances of this TREE_TYPE.
5022 This was causing an ICE in testsuite/g++.dg/lto/20080915.C. */
5024 member
= TYPE_FIELDS (type
);
5027 if (TREE_CODE (member
) == FIELD_DECL
5028 || TREE_CODE (member
) == TYPE_DECL
)
5031 TREE_CHAIN (prev
) = member
;
5033 TYPE_FIELDS (type
) = member
;
5037 member
= TREE_CHAIN (member
);
5041 TREE_CHAIN (prev
) = NULL_TREE
;
5043 TYPE_FIELDS (type
) = NULL_TREE
;
5045 TYPE_METHODS (type
) = NULL_TREE
;
5046 if (TYPE_BINFO (type
))
5048 free_lang_data_in_binfo (TYPE_BINFO (type
));
5049 if ((!BINFO_VTABLE (TYPE_BINFO (type
))
5050 || !flag_devirtualize
)
5051 && (!BINFO_N_BASE_BINFOS (TYPE_BINFO (type
))
5052 || debug_info_level
!= DINFO_LEVEL_NONE
))
5053 TYPE_BINFO (type
) = NULL
;
5058 /* For non-aggregate types, clear out the language slot (which
5059 overloads TYPE_BINFO). */
5060 TYPE_LANG_SLOT_1 (type
) = NULL_TREE
;
5062 if (INTEGRAL_TYPE_P (type
)
5063 || SCALAR_FLOAT_TYPE_P (type
)
5064 || FIXED_POINT_TYPE_P (type
))
5066 free_lang_data_in_one_sizepos (&TYPE_MIN_VALUE (type
));
5067 free_lang_data_in_one_sizepos (&TYPE_MAX_VALUE (type
));
5071 free_lang_data_in_one_sizepos (&TYPE_SIZE (type
));
5072 free_lang_data_in_one_sizepos (&TYPE_SIZE_UNIT (type
));
5074 if (TYPE_CONTEXT (type
)
5075 && TREE_CODE (TYPE_CONTEXT (type
)) == BLOCK
)
5077 tree ctx
= TYPE_CONTEXT (type
);
5080 ctx
= BLOCK_SUPERCONTEXT (ctx
);
5082 while (ctx
&& TREE_CODE (ctx
) == BLOCK
);
5083 TYPE_CONTEXT (type
) = ctx
;
5088 /* Return true if DECL may need an assembler name to be set. */
5091 need_assembler_name_p (tree decl
)
5093 /* We use DECL_ASSEMBLER_NAME to hold mangled type names for One Definition Rule
5095 if (flag_lto_odr_type_mering
5096 && TREE_CODE (decl
) == TYPE_DECL
5098 && decl
== TYPE_NAME (TREE_TYPE (decl
))
5099 && !is_lang_specific (TREE_TYPE (decl
))
5100 && AGGREGATE_TYPE_P (TREE_TYPE (decl
))
5101 && !variably_modified_type_p (TREE_TYPE (decl
), NULL_TREE
)
5102 && !type_in_anonymous_namespace_p (TREE_TYPE (decl
)))
5103 return !DECL_ASSEMBLER_NAME_SET_P (decl
);
5104 /* Only FUNCTION_DECLs and VAR_DECLs are considered. */
5105 if (TREE_CODE (decl
) != FUNCTION_DECL
5106 && TREE_CODE (decl
) != VAR_DECL
)
5109 /* If DECL already has its assembler name set, it does not need a
5111 if (!HAS_DECL_ASSEMBLER_NAME_P (decl
)
5112 || DECL_ASSEMBLER_NAME_SET_P (decl
))
5115 /* Abstract decls do not need an assembler name. */
5116 if (DECL_ABSTRACT_P (decl
))
5119 /* For VAR_DECLs, only static, public and external symbols need an
5121 if (TREE_CODE (decl
) == VAR_DECL
5122 && !TREE_STATIC (decl
)
5123 && !TREE_PUBLIC (decl
)
5124 && !DECL_EXTERNAL (decl
))
5127 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5129 /* Do not set assembler name on builtins. Allow RTL expansion to
5130 decide whether to expand inline or via a regular call. */
5131 if (DECL_BUILT_IN (decl
)
5132 && DECL_BUILT_IN_CLASS (decl
) != BUILT_IN_FRONTEND
)
5135 /* Functions represented in the callgraph need an assembler name. */
5136 if (cgraph_node::get (decl
) != NULL
)
5139 /* Unused and not public functions don't need an assembler name. */
5140 if (!TREE_USED (decl
) && !TREE_PUBLIC (decl
))
5148 /* Reset all language specific information still present in symbol
5152 free_lang_data_in_decl (tree decl
)
5154 gcc_assert (DECL_P (decl
));
5156 /* Give the FE a chance to remove its own data first. */
5157 lang_hooks
.free_lang_data (decl
);
5159 TREE_LANG_FLAG_0 (decl
) = 0;
5160 TREE_LANG_FLAG_1 (decl
) = 0;
5161 TREE_LANG_FLAG_2 (decl
) = 0;
5162 TREE_LANG_FLAG_3 (decl
) = 0;
5163 TREE_LANG_FLAG_4 (decl
) = 0;
5164 TREE_LANG_FLAG_5 (decl
) = 0;
5165 TREE_LANG_FLAG_6 (decl
) = 0;
5167 free_lang_data_in_one_sizepos (&DECL_SIZE (decl
));
5168 free_lang_data_in_one_sizepos (&DECL_SIZE_UNIT (decl
));
5169 if (TREE_CODE (decl
) == FIELD_DECL
)
5171 free_lang_data_in_one_sizepos (&DECL_FIELD_OFFSET (decl
));
5172 if (TREE_CODE (DECL_CONTEXT (decl
)) == QUAL_UNION_TYPE
)
5173 DECL_QUALIFIER (decl
) = NULL_TREE
;
5176 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5178 struct cgraph_node
*node
;
5179 if (!(node
= cgraph_node::get (decl
))
5180 || (!node
->definition
&& !node
->clones
))
5183 node
->release_body ();
5186 release_function_body (decl
);
5187 DECL_ARGUMENTS (decl
) = NULL
;
5188 DECL_RESULT (decl
) = NULL
;
5189 DECL_INITIAL (decl
) = error_mark_node
;
5192 if (gimple_has_body_p (decl
))
5196 /* If DECL has a gimple body, then the context for its
5197 arguments must be DECL. Otherwise, it doesn't really
5198 matter, as we will not be emitting any code for DECL. In
5199 general, there may be other instances of DECL created by
5200 the front end and since PARM_DECLs are generally shared,
5201 their DECL_CONTEXT changes as the replicas of DECL are
5202 created. The only time where DECL_CONTEXT is important
5203 is for the FUNCTION_DECLs that have a gimple body (since
5204 the PARM_DECL will be used in the function's body). */
5205 for (t
= DECL_ARGUMENTS (decl
); t
; t
= TREE_CHAIN (t
))
5206 DECL_CONTEXT (t
) = decl
;
5207 if (!DECL_FUNCTION_SPECIFIC_TARGET (decl
))
5208 DECL_FUNCTION_SPECIFIC_TARGET (decl
)
5209 = target_option_default_node
;
5210 if (!DECL_FUNCTION_SPECIFIC_OPTIMIZATION (decl
))
5211 DECL_FUNCTION_SPECIFIC_OPTIMIZATION (decl
)
5212 = optimization_default_node
;
5215 /* DECL_SAVED_TREE holds the GENERIC representation for DECL.
5216 At this point, it is not needed anymore. */
5217 DECL_SAVED_TREE (decl
) = NULL_TREE
;
5219 /* Clear the abstract origin if it refers to a method. Otherwise
5220 dwarf2out.c will ICE as we clear TYPE_METHODS and thus the
5221 origin will not be output correctly. */
5222 if (DECL_ABSTRACT_ORIGIN (decl
)
5223 && DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))
5224 && RECORD_OR_UNION_TYPE_P
5225 (DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))))
5226 DECL_ABSTRACT_ORIGIN (decl
) = NULL_TREE
;
5228 /* Sometimes the C++ frontend doesn't manage to transform a temporary
5229 DECL_VINDEX referring to itself into a vtable slot number as it
5230 should. Happens with functions that are copied and then forgotten
5231 about. Just clear it, it won't matter anymore. */
5232 if (DECL_VINDEX (decl
) && !tree_fits_shwi_p (DECL_VINDEX (decl
)))
5233 DECL_VINDEX (decl
) = NULL_TREE
;
5235 else if (TREE_CODE (decl
) == VAR_DECL
)
5237 if ((DECL_EXTERNAL (decl
)
5238 && (!TREE_STATIC (decl
) || !TREE_READONLY (decl
)))
5239 || (decl_function_context (decl
) && !TREE_STATIC (decl
)))
5240 DECL_INITIAL (decl
) = NULL_TREE
;
5242 else if (TREE_CODE (decl
) == TYPE_DECL
5243 || TREE_CODE (decl
) == FIELD_DECL
)
5244 DECL_INITIAL (decl
) = NULL_TREE
;
5245 else if (TREE_CODE (decl
) == TRANSLATION_UNIT_DECL
5246 && DECL_INITIAL (decl
)
5247 && TREE_CODE (DECL_INITIAL (decl
)) == BLOCK
)
5249 /* Strip builtins from the translation-unit BLOCK. We still have targets
5250 without builtin_decl_explicit support and also builtins are shared
5251 nodes and thus we can't use TREE_CHAIN in multiple lists. */
5252 tree
*nextp
= &BLOCK_VARS (DECL_INITIAL (decl
));
5256 if (TREE_CODE (var
) == FUNCTION_DECL
5257 && DECL_BUILT_IN (var
))
5258 *nextp
= TREE_CHAIN (var
);
5260 nextp
= &TREE_CHAIN (var
);
5266 /* Data used when collecting DECLs and TYPEs for language data removal. */
5268 struct free_lang_data_d
5270 /* Worklist to avoid excessive recursion. */
5273 /* Set of traversed objects. Used to avoid duplicate visits. */
5274 hash_set
<tree
> *pset
;
5276 /* Array of symbols to process with free_lang_data_in_decl. */
5279 /* Array of types to process with free_lang_data_in_type. */
5284 /* Save all language fields needed to generate proper debug information
5285 for DECL. This saves most fields cleared out by free_lang_data_in_decl. */
5288 save_debug_info_for_decl (tree t
)
5290 /*struct saved_debug_info_d *sdi;*/
5292 gcc_assert (debug_info_level
> DINFO_LEVEL_TERSE
&& t
&& DECL_P (t
));
5294 /* FIXME. Partial implementation for saving debug info removed. */
5298 /* Save all language fields needed to generate proper debug information
5299 for TYPE. This saves most fields cleared out by free_lang_data_in_type. */
5302 save_debug_info_for_type (tree t
)
5304 /*struct saved_debug_info_d *sdi;*/
5306 gcc_assert (debug_info_level
> DINFO_LEVEL_TERSE
&& t
&& TYPE_P (t
));
5308 /* FIXME. Partial implementation for saving debug info removed. */
5312 /* Add type or decl T to one of the list of tree nodes that need their
5313 language data removed. The lists are held inside FLD. */
5316 add_tree_to_fld_list (tree t
, struct free_lang_data_d
*fld
)
5320 fld
->decls
.safe_push (t
);
5321 if (debug_info_level
> DINFO_LEVEL_TERSE
)
5322 save_debug_info_for_decl (t
);
5324 else if (TYPE_P (t
))
5326 fld
->types
.safe_push (t
);
5327 if (debug_info_level
> DINFO_LEVEL_TERSE
)
5328 save_debug_info_for_type (t
);
5334 /* Push tree node T into FLD->WORKLIST. */
5337 fld_worklist_push (tree t
, struct free_lang_data_d
*fld
)
5339 if (t
&& !is_lang_specific (t
) && !fld
->pset
->contains (t
))
5340 fld
->worklist
.safe_push ((t
));
5344 /* Operand callback helper for free_lang_data_in_node. *TP is the
5345 subtree operand being considered. */
5348 find_decls_types_r (tree
*tp
, int *ws
, void *data
)
5351 struct free_lang_data_d
*fld
= (struct free_lang_data_d
*) data
;
5353 if (TREE_CODE (t
) == TREE_LIST
)
5356 /* Language specific nodes will be removed, so there is no need
5357 to gather anything under them. */
5358 if (is_lang_specific (t
))
5366 /* Note that walk_tree does not traverse every possible field in
5367 decls, so we have to do our own traversals here. */
5368 add_tree_to_fld_list (t
, fld
);
5370 fld_worklist_push (DECL_NAME (t
), fld
);
5371 fld_worklist_push (DECL_CONTEXT (t
), fld
);
5372 fld_worklist_push (DECL_SIZE (t
), fld
);
5373 fld_worklist_push (DECL_SIZE_UNIT (t
), fld
);
5375 /* We are going to remove everything under DECL_INITIAL for
5376 TYPE_DECLs. No point walking them. */
5377 if (TREE_CODE (t
) != TYPE_DECL
)
5378 fld_worklist_push (DECL_INITIAL (t
), fld
);
5380 fld_worklist_push (DECL_ATTRIBUTES (t
), fld
);
5381 fld_worklist_push (DECL_ABSTRACT_ORIGIN (t
), fld
);
5383 if (TREE_CODE (t
) == FUNCTION_DECL
)
5385 fld_worklist_push (DECL_ARGUMENTS (t
), fld
);
5386 fld_worklist_push (DECL_RESULT (t
), fld
);
5388 else if (TREE_CODE (t
) == TYPE_DECL
)
5390 fld_worklist_push (DECL_ORIGINAL_TYPE (t
), fld
);
5392 else if (TREE_CODE (t
) == FIELD_DECL
)
5394 fld_worklist_push (DECL_FIELD_OFFSET (t
), fld
);
5395 fld_worklist_push (DECL_BIT_FIELD_TYPE (t
), fld
);
5396 fld_worklist_push (DECL_FIELD_BIT_OFFSET (t
), fld
);
5397 fld_worklist_push (DECL_FCONTEXT (t
), fld
);
5400 if ((TREE_CODE (t
) == VAR_DECL
|| TREE_CODE (t
) == PARM_DECL
)
5401 && DECL_HAS_VALUE_EXPR_P (t
))
5402 fld_worklist_push (DECL_VALUE_EXPR (t
), fld
);
5404 if (TREE_CODE (t
) != FIELD_DECL
5405 && TREE_CODE (t
) != TYPE_DECL
)
5406 fld_worklist_push (TREE_CHAIN (t
), fld
);
5409 else if (TYPE_P (t
))
5411 /* Note that walk_tree does not traverse every possible field in
5412 types, so we have to do our own traversals here. */
5413 add_tree_to_fld_list (t
, fld
);
5415 if (!RECORD_OR_UNION_TYPE_P (t
))
5416 fld_worklist_push (TYPE_CACHED_VALUES (t
), fld
);
5417 fld_worklist_push (TYPE_SIZE (t
), fld
);
5418 fld_worklist_push (TYPE_SIZE_UNIT (t
), fld
);
5419 fld_worklist_push (TYPE_ATTRIBUTES (t
), fld
);
5420 fld_worklist_push (TYPE_POINTER_TO (t
), fld
);
5421 fld_worklist_push (TYPE_REFERENCE_TO (t
), fld
);
5422 fld_worklist_push (TYPE_NAME (t
), fld
);
5423 /* Do not walk TYPE_NEXT_PTR_TO or TYPE_NEXT_REF_TO. We do not stream
5424 them and thus do not and want not to reach unused pointer types
5426 if (!POINTER_TYPE_P (t
))
5427 fld_worklist_push (TYPE_MINVAL (t
), fld
);
5428 if (!RECORD_OR_UNION_TYPE_P (t
))
5429 fld_worklist_push (TYPE_MAXVAL (t
), fld
);
5430 fld_worklist_push (TYPE_MAIN_VARIANT (t
), fld
);
5431 /* Do not walk TYPE_NEXT_VARIANT. We do not stream it and thus
5432 do not and want not to reach unused variants this way. */
5433 if (TYPE_CONTEXT (t
))
5435 tree ctx
= TYPE_CONTEXT (t
);
5436 /* We adjust BLOCK TYPE_CONTEXTs to the innermost non-BLOCK one.
5437 So push that instead. */
5438 while (ctx
&& TREE_CODE (ctx
) == BLOCK
)
5439 ctx
= BLOCK_SUPERCONTEXT (ctx
);
5440 fld_worklist_push (ctx
, fld
);
5442 /* Do not walk TYPE_CANONICAL. We do not stream it and thus do not
5443 and want not to reach unused types this way. */
5445 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_BINFO (t
))
5449 FOR_EACH_VEC_ELT (*BINFO_BASE_BINFOS (TYPE_BINFO (t
)), i
, tem
)
5450 fld_worklist_push (TREE_TYPE (tem
), fld
);
5451 tem
= BINFO_VIRTUALS (TYPE_BINFO (t
));
5453 /* The Java FE overloads BINFO_VIRTUALS for its own purpose. */
5454 && TREE_CODE (tem
) == TREE_LIST
)
5457 fld_worklist_push (TREE_VALUE (tem
), fld
);
5458 tem
= TREE_CHAIN (tem
);
5462 if (RECORD_OR_UNION_TYPE_P (t
))
5465 /* Push all TYPE_FIELDS - there can be interleaving interesting
5466 and non-interesting things. */
5467 tem
= TYPE_FIELDS (t
);
5470 if (TREE_CODE (tem
) == FIELD_DECL
5471 || TREE_CODE (tem
) == TYPE_DECL
)
5472 fld_worklist_push (tem
, fld
);
5473 tem
= TREE_CHAIN (tem
);
5477 fld_worklist_push (TYPE_STUB_DECL (t
), fld
);
5480 else if (TREE_CODE (t
) == BLOCK
)
5483 for (tem
= BLOCK_VARS (t
); tem
; tem
= TREE_CHAIN (tem
))
5484 fld_worklist_push (tem
, fld
);
5485 for (tem
= BLOCK_SUBBLOCKS (t
); tem
; tem
= BLOCK_CHAIN (tem
))
5486 fld_worklist_push (tem
, fld
);
5487 fld_worklist_push (BLOCK_ABSTRACT_ORIGIN (t
), fld
);
5490 if (TREE_CODE (t
) != IDENTIFIER_NODE
5491 && CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_TYPED
))
5492 fld_worklist_push (TREE_TYPE (t
), fld
);
5498 /* Find decls and types in T. */
5501 find_decls_types (tree t
, struct free_lang_data_d
*fld
)
5505 if (!fld
->pset
->contains (t
))
5506 walk_tree (&t
, find_decls_types_r
, fld
, fld
->pset
);
5507 if (fld
->worklist
.is_empty ())
5509 t
= fld
->worklist
.pop ();
5513 /* Translate all the types in LIST with the corresponding runtime
5517 get_eh_types_for_runtime (tree list
)
5521 if (list
== NULL_TREE
)
5524 head
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
5526 list
= TREE_CHAIN (list
);
5529 tree n
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
5530 TREE_CHAIN (prev
) = n
;
5531 prev
= TREE_CHAIN (prev
);
5532 list
= TREE_CHAIN (list
);
5539 /* Find decls and types referenced in EH region R and store them in
5540 FLD->DECLS and FLD->TYPES. */
5543 find_decls_types_in_eh_region (eh_region r
, struct free_lang_data_d
*fld
)
5554 /* The types referenced in each catch must first be changed to the
5555 EH types used at runtime. This removes references to FE types
5557 for (c
= r
->u
.eh_try
.first_catch
; c
; c
= c
->next_catch
)
5559 c
->type_list
= get_eh_types_for_runtime (c
->type_list
);
5560 walk_tree (&c
->type_list
, find_decls_types_r
, fld
, fld
->pset
);
5565 case ERT_ALLOWED_EXCEPTIONS
:
5566 r
->u
.allowed
.type_list
5567 = get_eh_types_for_runtime (r
->u
.allowed
.type_list
);
5568 walk_tree (&r
->u
.allowed
.type_list
, find_decls_types_r
, fld
, fld
->pset
);
5571 case ERT_MUST_NOT_THROW
:
5572 walk_tree (&r
->u
.must_not_throw
.failure_decl
,
5573 find_decls_types_r
, fld
, fld
->pset
);
5579 /* Find decls and types referenced in cgraph node N and store them in
5580 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
5581 look for *every* kind of DECL and TYPE node reachable from N,
5582 including those embedded inside types and decls (i.e,, TYPE_DECLs,
5583 NAMESPACE_DECLs, etc). */
5586 find_decls_types_in_node (struct cgraph_node
*n
, struct free_lang_data_d
*fld
)
5589 struct function
*fn
;
5593 find_decls_types (n
->decl
, fld
);
5595 if (!gimple_has_body_p (n
->decl
))
5598 gcc_assert (current_function_decl
== NULL_TREE
&& cfun
== NULL
);
5600 fn
= DECL_STRUCT_FUNCTION (n
->decl
);
5602 /* Traverse locals. */
5603 FOR_EACH_LOCAL_DECL (fn
, ix
, t
)
5604 find_decls_types (t
, fld
);
5606 /* Traverse EH regions in FN. */
5609 FOR_ALL_EH_REGION_FN (r
, fn
)
5610 find_decls_types_in_eh_region (r
, fld
);
5613 /* Traverse every statement in FN. */
5614 FOR_EACH_BB_FN (bb
, fn
)
5617 gimple_stmt_iterator si
;
5620 for (psi
= gsi_start_phis (bb
); !gsi_end_p (psi
); gsi_next (&psi
))
5622 gphi
*phi
= psi
.phi ();
5624 for (i
= 0; i
< gimple_phi_num_args (phi
); i
++)
5626 tree
*arg_p
= gimple_phi_arg_def_ptr (phi
, i
);
5627 find_decls_types (*arg_p
, fld
);
5631 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
5633 gimple stmt
= gsi_stmt (si
);
5635 if (is_gimple_call (stmt
))
5636 find_decls_types (gimple_call_fntype (stmt
), fld
);
5638 for (i
= 0; i
< gimple_num_ops (stmt
); i
++)
5640 tree arg
= gimple_op (stmt
, i
);
5641 find_decls_types (arg
, fld
);
5648 /* Find decls and types referenced in varpool node N and store them in
5649 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
5650 look for *every* kind of DECL and TYPE node reachable from N,
5651 including those embedded inside types and decls (i.e,, TYPE_DECLs,
5652 NAMESPACE_DECLs, etc). */
5655 find_decls_types_in_var (varpool_node
*v
, struct free_lang_data_d
*fld
)
5657 find_decls_types (v
->decl
, fld
);
5660 /* If T needs an assembler name, have one created for it. */
5663 assign_assembler_name_if_neeeded (tree t
)
5665 if (need_assembler_name_p (t
))
5667 /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit
5668 diagnostics that use input_location to show locus
5669 information. The problem here is that, at this point,
5670 input_location is generally anchored to the end of the file
5671 (since the parser is long gone), so we don't have a good
5672 position to pin it to.
5674 To alleviate this problem, this uses the location of T's
5675 declaration. Examples of this are
5676 testsuite/g++.dg/template/cond2.C and
5677 testsuite/g++.dg/template/pr35240.C. */
5678 location_t saved_location
= input_location
;
5679 input_location
= DECL_SOURCE_LOCATION (t
);
5681 decl_assembler_name (t
);
5683 input_location
= saved_location
;
5688 /* Free language specific information for every operand and expression
5689 in every node of the call graph. This process operates in three stages:
5691 1- Every callgraph node and varpool node is traversed looking for
5692 decls and types embedded in them. This is a more exhaustive
5693 search than that done by find_referenced_vars, because it will
5694 also collect individual fields, decls embedded in types, etc.
5696 2- All the decls found are sent to free_lang_data_in_decl.
5698 3- All the types found are sent to free_lang_data_in_type.
5700 The ordering between decls and types is important because
5701 free_lang_data_in_decl sets assembler names, which includes
5702 mangling. So types cannot be freed up until assembler names have
5706 free_lang_data_in_cgraph (void)
5708 struct cgraph_node
*n
;
5710 struct free_lang_data_d fld
;
5715 /* Initialize sets and arrays to store referenced decls and types. */
5716 fld
.pset
= new hash_set
<tree
>;
5717 fld
.worklist
.create (0);
5718 fld
.decls
.create (100);
5719 fld
.types
.create (100);
5721 /* Find decls and types in the body of every function in the callgraph. */
5722 FOR_EACH_FUNCTION (n
)
5723 find_decls_types_in_node (n
, &fld
);
5725 FOR_EACH_VEC_SAFE_ELT (alias_pairs
, i
, p
)
5726 find_decls_types (p
->decl
, &fld
);
5728 /* Find decls and types in every varpool symbol. */
5729 FOR_EACH_VARIABLE (v
)
5730 find_decls_types_in_var (v
, &fld
);
5732 /* Set the assembler name on every decl found. We need to do this
5733 now because free_lang_data_in_decl will invalidate data needed
5734 for mangling. This breaks mangling on interdependent decls. */
5735 FOR_EACH_VEC_ELT (fld
.decls
, i
, t
)
5736 assign_assembler_name_if_neeeded (t
);
5738 /* Traverse every decl found freeing its language data. */
5739 FOR_EACH_VEC_ELT (fld
.decls
, i
, t
)
5740 free_lang_data_in_decl (t
);
5742 /* Traverse every type found freeing its language data. */
5743 FOR_EACH_VEC_ELT (fld
.types
, i
, t
)
5744 free_lang_data_in_type (t
);
5747 fld
.worklist
.release ();
5748 fld
.decls
.release ();
5749 fld
.types
.release ();
5753 /* Free resources that are used by FE but are not needed once they are done. */
5756 free_lang_data (void)
5760 /* If we are the LTO frontend we have freed lang-specific data already. */
5762 || (!flag_generate_lto
&& !flag_generate_offload
))
5765 /* Allocate and assign alias sets to the standard integer types
5766 while the slots are still in the way the frontends generated them. */
5767 for (i
= 0; i
< itk_none
; ++i
)
5768 if (integer_types
[i
])
5769 TYPE_ALIAS_SET (integer_types
[i
]) = get_alias_set (integer_types
[i
]);
5771 /* Traverse the IL resetting language specific information for
5772 operands, expressions, etc. */
5773 free_lang_data_in_cgraph ();
5775 /* Create gimple variants for common types. */
5776 ptrdiff_type_node
= integer_type_node
;
5777 fileptr_type_node
= ptr_type_node
;
5779 /* Reset some langhooks. Do not reset types_compatible_p, it may
5780 still be used indirectly via the get_alias_set langhook. */
5781 lang_hooks
.dwarf_name
= lhd_dwarf_name
;
5782 lang_hooks
.decl_printable_name
= gimple_decl_printable_name
;
5783 /* We do not want the default decl_assembler_name implementation,
5784 rather if we have fixed everything we want a wrapper around it
5785 asserting that all non-local symbols already got their assembler
5786 name and only produce assembler names for local symbols. Or rather
5787 make sure we never call decl_assembler_name on local symbols and
5788 devise a separate, middle-end private scheme for it. */
5790 /* Reset diagnostic machinery. */
5791 tree_diagnostics_defaults (global_dc
);
5799 const pass_data pass_data_ipa_free_lang_data
=
5801 SIMPLE_IPA_PASS
, /* type */
5802 "*free_lang_data", /* name */
5803 OPTGROUP_NONE
, /* optinfo_flags */
5804 TV_IPA_FREE_LANG_DATA
, /* tv_id */
5805 0, /* properties_required */
5806 0, /* properties_provided */
5807 0, /* properties_destroyed */
5808 0, /* todo_flags_start */
5809 0, /* todo_flags_finish */
5812 class pass_ipa_free_lang_data
: public simple_ipa_opt_pass
5815 pass_ipa_free_lang_data (gcc::context
*ctxt
)
5816 : simple_ipa_opt_pass (pass_data_ipa_free_lang_data
, ctxt
)
5819 /* opt_pass methods: */
5820 virtual unsigned int execute (function
*) { return free_lang_data (); }
5822 }; // class pass_ipa_free_lang_data
5826 simple_ipa_opt_pass
*
5827 make_pass_ipa_free_lang_data (gcc::context
*ctxt
)
5829 return new pass_ipa_free_lang_data (ctxt
);
5832 /* The backbone of is_attribute_p(). ATTR_LEN is the string length of
5833 ATTR_NAME. Also used internally by remove_attribute(). */
5835 private_is_attribute_p (const char *attr_name
, size_t attr_len
, const_tree ident
)
5837 size_t ident_len
= IDENTIFIER_LENGTH (ident
);
5839 if (ident_len
== attr_len
)
5841 if (strcmp (attr_name
, IDENTIFIER_POINTER (ident
)) == 0)
5844 else if (ident_len
== attr_len
+ 4)
5846 /* There is the possibility that ATTR is 'text' and IDENT is
5848 const char *p
= IDENTIFIER_POINTER (ident
);
5849 if (p
[0] == '_' && p
[1] == '_'
5850 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
5851 && strncmp (attr_name
, p
+ 2, attr_len
) == 0)
5858 /* The backbone of lookup_attribute(). ATTR_LEN is the string length
5859 of ATTR_NAME, and LIST is not NULL_TREE. */
5861 private_lookup_attribute (const char *attr_name
, size_t attr_len
, tree list
)
5865 size_t ident_len
= IDENTIFIER_LENGTH (get_attribute_name (list
));
5867 if (ident_len
== attr_len
)
5869 if (!strcmp (attr_name
,
5870 IDENTIFIER_POINTER (get_attribute_name (list
))))
5873 /* TODO: If we made sure that attributes were stored in the
5874 canonical form without '__...__' (ie, as in 'text' as opposed
5875 to '__text__') then we could avoid the following case. */
5876 else if (ident_len
== attr_len
+ 4)
5878 const char *p
= IDENTIFIER_POINTER (get_attribute_name (list
));
5879 if (p
[0] == '_' && p
[1] == '_'
5880 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
5881 && strncmp (attr_name
, p
+ 2, attr_len
) == 0)
5884 list
= TREE_CHAIN (list
);
5890 /* Given an attribute name ATTR_NAME and a list of attributes LIST,
5891 return a pointer to the attribute's list first element if the attribute
5892 starts with ATTR_NAME. ATTR_NAME must be in the form 'text' (not
5896 private_lookup_attribute_by_prefix (const char *attr_name
, size_t attr_len
,
5901 size_t ident_len
= IDENTIFIER_LENGTH (get_attribute_name (list
));
5903 if (attr_len
> ident_len
)
5905 list
= TREE_CHAIN (list
);
5909 const char *p
= IDENTIFIER_POINTER (get_attribute_name (list
));
5911 if (strncmp (attr_name
, p
, attr_len
) == 0)
5914 /* TODO: If we made sure that attributes were stored in the
5915 canonical form without '__...__' (ie, as in 'text' as opposed
5916 to '__text__') then we could avoid the following case. */
5917 if (p
[0] == '_' && p
[1] == '_' &&
5918 strncmp (attr_name
, p
+ 2, attr_len
) == 0)
5921 list
= TREE_CHAIN (list
);
5928 /* A variant of lookup_attribute() that can be used with an identifier
5929 as the first argument, and where the identifier can be either
5930 'text' or '__text__'.
5932 Given an attribute ATTR_IDENTIFIER, and a list of attributes LIST,
5933 return a pointer to the attribute's list element if the attribute
5934 is part of the list, or NULL_TREE if not found. If the attribute
5935 appears more than once, this only returns the first occurrence; the
5936 TREE_CHAIN of the return value should be passed back in if further
5937 occurrences are wanted. ATTR_IDENTIFIER must be an identifier but
5938 can be in the form 'text' or '__text__'. */
5940 lookup_ident_attribute (tree attr_identifier
, tree list
)
5942 gcc_checking_assert (TREE_CODE (attr_identifier
) == IDENTIFIER_NODE
);
5946 gcc_checking_assert (TREE_CODE (get_attribute_name (list
))
5947 == IDENTIFIER_NODE
);
5949 /* Identifiers can be compared directly for equality. */
5950 if (attr_identifier
== get_attribute_name (list
))
5953 /* If they are not equal, they may still be one in the form
5954 'text' while the other one is in the form '__text__'. TODO:
5955 If we were storing attributes in normalized 'text' form, then
5956 this could all go away and we could take full advantage of
5957 the fact that we're comparing identifiers. :-) */
5959 size_t attr_len
= IDENTIFIER_LENGTH (attr_identifier
);
5960 size_t ident_len
= IDENTIFIER_LENGTH (get_attribute_name (list
));
5962 if (ident_len
== attr_len
+ 4)
5964 const char *p
= IDENTIFIER_POINTER (get_attribute_name (list
));
5965 const char *q
= IDENTIFIER_POINTER (attr_identifier
);
5966 if (p
[0] == '_' && p
[1] == '_'
5967 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
5968 && strncmp (q
, p
+ 2, attr_len
) == 0)
5971 else if (ident_len
+ 4 == attr_len
)
5973 const char *p
= IDENTIFIER_POINTER (get_attribute_name (list
));
5974 const char *q
= IDENTIFIER_POINTER (attr_identifier
);
5975 if (q
[0] == '_' && q
[1] == '_'
5976 && q
[attr_len
- 2] == '_' && q
[attr_len
- 1] == '_'
5977 && strncmp (q
+ 2, p
, ident_len
) == 0)
5981 list
= TREE_CHAIN (list
);
5987 /* Remove any instances of attribute ATTR_NAME in LIST and return the
5991 remove_attribute (const char *attr_name
, tree list
)
5994 size_t attr_len
= strlen (attr_name
);
5996 gcc_checking_assert (attr_name
[0] != '_');
5998 for (p
= &list
; *p
; )
6001 /* TODO: If we were storing attributes in normalized form, here
6002 we could use a simple strcmp(). */
6003 if (private_is_attribute_p (attr_name
, attr_len
, get_attribute_name (l
)))
6004 *p
= TREE_CHAIN (l
);
6006 p
= &TREE_CHAIN (l
);
6012 /* Return an attribute list that is the union of a1 and a2. */
6015 merge_attributes (tree a1
, tree a2
)
6019 /* Either one unset? Take the set one. */
6021 if ((attributes
= a1
) == 0)
6024 /* One that completely contains the other? Take it. */
6026 else if (a2
!= 0 && ! attribute_list_contained (a1
, a2
))
6028 if (attribute_list_contained (a2
, a1
))
6032 /* Pick the longest list, and hang on the other list. */
6034 if (list_length (a1
) < list_length (a2
))
6035 attributes
= a2
, a2
= a1
;
6037 for (; a2
!= 0; a2
= TREE_CHAIN (a2
))
6040 for (a
= lookup_ident_attribute (get_attribute_name (a2
),
6042 a
!= NULL_TREE
&& !attribute_value_equal (a
, a2
);
6043 a
= lookup_ident_attribute (get_attribute_name (a2
),
6048 a1
= copy_node (a2
);
6049 TREE_CHAIN (a1
) = attributes
;
6058 /* Given types T1 and T2, merge their attributes and return
6062 merge_type_attributes (tree t1
, tree t2
)
6064 return merge_attributes (TYPE_ATTRIBUTES (t1
),
6065 TYPE_ATTRIBUTES (t2
));
6068 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
6072 merge_decl_attributes (tree olddecl
, tree newdecl
)
6074 return merge_attributes (DECL_ATTRIBUTES (olddecl
),
6075 DECL_ATTRIBUTES (newdecl
));
6078 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
6080 /* Specialization of merge_decl_attributes for various Windows targets.
6082 This handles the following situation:
6084 __declspec (dllimport) int foo;
6087 The second instance of `foo' nullifies the dllimport. */
6090 merge_dllimport_decl_attributes (tree old
, tree new_tree
)
6093 int delete_dllimport_p
= 1;
6095 /* What we need to do here is remove from `old' dllimport if it doesn't
6096 appear in `new'. dllimport behaves like extern: if a declaration is
6097 marked dllimport and a definition appears later, then the object
6098 is not dllimport'd. We also remove a `new' dllimport if the old list
6099 contains dllexport: dllexport always overrides dllimport, regardless
6100 of the order of declaration. */
6101 if (!VAR_OR_FUNCTION_DECL_P (new_tree
))
6102 delete_dllimport_p
= 0;
6103 else if (DECL_DLLIMPORT_P (new_tree
)
6104 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (old
)))
6106 DECL_DLLIMPORT_P (new_tree
) = 0;
6107 warning (OPT_Wattributes
, "%q+D already declared with dllexport attribute: "
6108 "dllimport ignored", new_tree
);
6110 else if (DECL_DLLIMPORT_P (old
) && !DECL_DLLIMPORT_P (new_tree
))
6112 /* Warn about overriding a symbol that has already been used, e.g.:
6113 extern int __attribute__ ((dllimport)) foo;
6114 int* bar () {return &foo;}
6117 if (TREE_USED (old
))
6119 warning (0, "%q+D redeclared without dllimport attribute "
6120 "after being referenced with dll linkage", new_tree
);
6121 /* If we have used a variable's address with dllimport linkage,
6122 keep the old DECL_DLLIMPORT_P flag: the ADDR_EXPR using the
6123 decl may already have had TREE_CONSTANT computed.
6124 We still remove the attribute so that assembler code refers
6125 to '&foo rather than '_imp__foo'. */
6126 if (TREE_CODE (old
) == VAR_DECL
&& TREE_ADDRESSABLE (old
))
6127 DECL_DLLIMPORT_P (new_tree
) = 1;
6130 /* Let an inline definition silently override the external reference,
6131 but otherwise warn about attribute inconsistency. */
6132 else if (TREE_CODE (new_tree
) == VAR_DECL
6133 || !DECL_DECLARED_INLINE_P (new_tree
))
6134 warning (OPT_Wattributes
, "%q+D redeclared without dllimport attribute: "
6135 "previous dllimport ignored", new_tree
);
6138 delete_dllimport_p
= 0;
6140 a
= merge_attributes (DECL_ATTRIBUTES (old
), DECL_ATTRIBUTES (new_tree
));
6142 if (delete_dllimport_p
)
6143 a
= remove_attribute ("dllimport", a
);
6148 /* Handle a "dllimport" or "dllexport" attribute; arguments as in
6149 struct attribute_spec.handler. */
6152 handle_dll_attribute (tree
* pnode
, tree name
, tree args
, int flags
,
6158 /* These attributes may apply to structure and union types being created,
6159 but otherwise should pass to the declaration involved. */
6162 if (flags
& ((int) ATTR_FLAG_DECL_NEXT
| (int) ATTR_FLAG_FUNCTION_NEXT
6163 | (int) ATTR_FLAG_ARRAY_NEXT
))
6165 *no_add_attrs
= true;
6166 return tree_cons (name
, args
, NULL_TREE
);
6168 if (TREE_CODE (node
) == RECORD_TYPE
6169 || TREE_CODE (node
) == UNION_TYPE
)
6171 node
= TYPE_NAME (node
);
6177 warning (OPT_Wattributes
, "%qE attribute ignored",
6179 *no_add_attrs
= true;
6184 if (TREE_CODE (node
) != FUNCTION_DECL
6185 && TREE_CODE (node
) != VAR_DECL
6186 && TREE_CODE (node
) != TYPE_DECL
)
6188 *no_add_attrs
= true;
6189 warning (OPT_Wattributes
, "%qE attribute ignored",
6194 if (TREE_CODE (node
) == TYPE_DECL
6195 && TREE_CODE (TREE_TYPE (node
)) != RECORD_TYPE
6196 && TREE_CODE (TREE_TYPE (node
)) != UNION_TYPE
)
6198 *no_add_attrs
= true;
6199 warning (OPT_Wattributes
, "%qE attribute ignored",
6204 is_dllimport
= is_attribute_p ("dllimport", name
);
6206 /* Report error on dllimport ambiguities seen now before they cause
6210 /* Honor any target-specific overrides. */
6211 if (!targetm
.valid_dllimport_attribute_p (node
))
6212 *no_add_attrs
= true;
6214 else if (TREE_CODE (node
) == FUNCTION_DECL
6215 && DECL_DECLARED_INLINE_P (node
))
6217 warning (OPT_Wattributes
, "inline function %q+D declared as "
6218 " dllimport: attribute ignored", node
);
6219 *no_add_attrs
= true;
6221 /* Like MS, treat definition of dllimported variables and
6222 non-inlined functions on declaration as syntax errors. */
6223 else if (TREE_CODE (node
) == FUNCTION_DECL
&& DECL_INITIAL (node
))
6225 error ("function %q+D definition is marked dllimport", node
);
6226 *no_add_attrs
= true;
6229 else if (TREE_CODE (node
) == VAR_DECL
)
6231 if (DECL_INITIAL (node
))
6233 error ("variable %q+D definition is marked dllimport",
6235 *no_add_attrs
= true;
6238 /* `extern' needn't be specified with dllimport.
6239 Specify `extern' now and hope for the best. Sigh. */
6240 DECL_EXTERNAL (node
) = 1;
6241 /* Also, implicitly give dllimport'd variables declared within
6242 a function global scope, unless declared static. */
6243 if (current_function_decl
!= NULL_TREE
&& !TREE_STATIC (node
))
6244 TREE_PUBLIC (node
) = 1;
6247 if (*no_add_attrs
== false)
6248 DECL_DLLIMPORT_P (node
) = 1;
6250 else if (TREE_CODE (node
) == FUNCTION_DECL
6251 && DECL_DECLARED_INLINE_P (node
)
6252 && flag_keep_inline_dllexport
)
6253 /* An exported function, even if inline, must be emitted. */
6254 DECL_EXTERNAL (node
) = 0;
6256 /* Report error if symbol is not accessible at global scope. */
6257 if (!TREE_PUBLIC (node
)
6258 && (TREE_CODE (node
) == VAR_DECL
6259 || TREE_CODE (node
) == FUNCTION_DECL
))
6261 error ("external linkage required for symbol %q+D because of "
6262 "%qE attribute", node
, name
);
6263 *no_add_attrs
= true;
6266 /* A dllexport'd entity must have default visibility so that other
6267 program units (shared libraries or the main executable) can see
6268 it. A dllimport'd entity must have default visibility so that
6269 the linker knows that undefined references within this program
6270 unit can be resolved by the dynamic linker. */
6273 if (DECL_VISIBILITY_SPECIFIED (node
)
6274 && DECL_VISIBILITY (node
) != VISIBILITY_DEFAULT
)
6275 error ("%qE implies default visibility, but %qD has already "
6276 "been declared with a different visibility",
6278 DECL_VISIBILITY (node
) = VISIBILITY_DEFAULT
;
6279 DECL_VISIBILITY_SPECIFIED (node
) = 1;
6285 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
6287 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
6288 of the various TYPE_QUAL values. */
6291 set_type_quals (tree type
, int type_quals
)
6293 TYPE_READONLY (type
) = (type_quals
& TYPE_QUAL_CONST
) != 0;
6294 TYPE_VOLATILE (type
) = (type_quals
& TYPE_QUAL_VOLATILE
) != 0;
6295 TYPE_RESTRICT (type
) = (type_quals
& TYPE_QUAL_RESTRICT
) != 0;
6296 TYPE_ATOMIC (type
) = (type_quals
& TYPE_QUAL_ATOMIC
) != 0;
6297 TYPE_ADDR_SPACE (type
) = DECODE_QUAL_ADDR_SPACE (type_quals
);
6300 /* Returns true iff unqualified CAND and BASE are equivalent. */
6303 check_base_type (const_tree cand
, const_tree base
)
6305 return (TYPE_NAME (cand
) == TYPE_NAME (base
)
6306 /* Apparently this is needed for Objective-C. */
6307 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
6308 /* Check alignment. */
6309 && TYPE_ALIGN (cand
) == TYPE_ALIGN (base
)
6310 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
6311 TYPE_ATTRIBUTES (base
)));
6314 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
6317 check_qualified_type (const_tree cand
, const_tree base
, int type_quals
)
6319 return (TYPE_QUALS (cand
) == type_quals
6320 && check_base_type (cand
, base
));
6323 /* Returns true iff CAND is equivalent to BASE with ALIGN. */
6326 check_aligned_type (const_tree cand
, const_tree base
, unsigned int align
)
6328 return (TYPE_QUALS (cand
) == TYPE_QUALS (base
)
6329 && TYPE_NAME (cand
) == TYPE_NAME (base
)
6330 /* Apparently this is needed for Objective-C. */
6331 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
6332 /* Check alignment. */
6333 && TYPE_ALIGN (cand
) == align
6334 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
6335 TYPE_ATTRIBUTES (base
)));
6338 /* This function checks to see if TYPE matches the size one of the built-in
6339 atomic types, and returns that core atomic type. */
6342 find_atomic_core_type (tree type
)
6344 tree base_atomic_type
;
6346 /* Only handle complete types. */
6347 if (TYPE_SIZE (type
) == NULL_TREE
)
6350 HOST_WIDE_INT type_size
= tree_to_uhwi (TYPE_SIZE (type
));
6354 base_atomic_type
= atomicQI_type_node
;
6358 base_atomic_type
= atomicHI_type_node
;
6362 base_atomic_type
= atomicSI_type_node
;
6366 base_atomic_type
= atomicDI_type_node
;
6370 base_atomic_type
= atomicTI_type_node
;
6374 base_atomic_type
= NULL_TREE
;
6377 return base_atomic_type
;
6380 /* Return a version of the TYPE, qualified as indicated by the
6381 TYPE_QUALS, if one exists. If no qualified version exists yet,
6382 return NULL_TREE. */
6385 get_qualified_type (tree type
, int type_quals
)
6389 if (TYPE_QUALS (type
) == type_quals
)
6392 /* Search the chain of variants to see if there is already one there just
6393 like the one we need to have. If so, use that existing one. We must
6394 preserve the TYPE_NAME, since there is code that depends on this. */
6395 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
6396 if (check_qualified_type (t
, type
, type_quals
))
6402 /* Like get_qualified_type, but creates the type if it does not
6403 exist. This function never returns NULL_TREE. */
6406 build_qualified_type (tree type
, int type_quals
)
6410 /* See if we already have the appropriate qualified variant. */
6411 t
= get_qualified_type (type
, type_quals
);
6413 /* If not, build it. */
6416 t
= build_variant_type_copy (type
);
6417 set_type_quals (t
, type_quals
);
6419 if (((type_quals
& TYPE_QUAL_ATOMIC
) == TYPE_QUAL_ATOMIC
))
6421 /* See if this object can map to a basic atomic type. */
6422 tree atomic_type
= find_atomic_core_type (type
);
6425 /* Ensure the alignment of this type is compatible with
6426 the required alignment of the atomic type. */
6427 if (TYPE_ALIGN (atomic_type
) > TYPE_ALIGN (t
))
6428 TYPE_ALIGN (t
) = TYPE_ALIGN (atomic_type
);
6432 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
6433 /* Propagate structural equality. */
6434 SET_TYPE_STRUCTURAL_EQUALITY (t
);
6435 else if (TYPE_CANONICAL (type
) != type
)
6436 /* Build the underlying canonical type, since it is different
6439 tree c
= build_qualified_type (TYPE_CANONICAL (type
), type_quals
);
6440 TYPE_CANONICAL (t
) = TYPE_CANONICAL (c
);
6443 /* T is its own canonical type. */
6444 TYPE_CANONICAL (t
) = t
;
6451 /* Create a variant of type T with alignment ALIGN. */
6454 build_aligned_type (tree type
, unsigned int align
)
6458 if (TYPE_PACKED (type
)
6459 || TYPE_ALIGN (type
) == align
)
6462 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
6463 if (check_aligned_type (t
, type
, align
))
6466 t
= build_variant_type_copy (type
);
6467 TYPE_ALIGN (t
) = align
;
6472 /* Create a new distinct copy of TYPE. The new type is made its own
6473 MAIN_VARIANT. If TYPE requires structural equality checks, the
6474 resulting type requires structural equality checks; otherwise, its
6475 TYPE_CANONICAL points to itself. */
6478 build_distinct_type_copy (tree type
)
6480 tree t
= copy_node (type
);
6482 TYPE_POINTER_TO (t
) = 0;
6483 TYPE_REFERENCE_TO (t
) = 0;
6485 /* Set the canonical type either to a new equivalence class, or
6486 propagate the need for structural equality checks. */
6487 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
6488 SET_TYPE_STRUCTURAL_EQUALITY (t
);
6490 TYPE_CANONICAL (t
) = t
;
6492 /* Make it its own variant. */
6493 TYPE_MAIN_VARIANT (t
) = t
;
6494 TYPE_NEXT_VARIANT (t
) = 0;
6496 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
6497 whose TREE_TYPE is not t. This can also happen in the Ada
6498 frontend when using subtypes. */
6503 /* Create a new variant of TYPE, equivalent but distinct. This is so
6504 the caller can modify it. TYPE_CANONICAL for the return type will
6505 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
6506 are considered equal by the language itself (or that both types
6507 require structural equality checks). */
6510 build_variant_type_copy (tree type
)
6512 tree t
, m
= TYPE_MAIN_VARIANT (type
);
6514 t
= build_distinct_type_copy (type
);
6516 /* Since we're building a variant, assume that it is a non-semantic
6517 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
6518 TYPE_CANONICAL (t
) = TYPE_CANONICAL (type
);
6520 /* Add the new type to the chain of variants of TYPE. */
6521 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (m
);
6522 TYPE_NEXT_VARIANT (m
) = t
;
6523 TYPE_MAIN_VARIANT (t
) = m
;
6528 /* Return true if the from tree in both tree maps are equal. */
6531 tree_map_base_eq (const void *va
, const void *vb
)
6533 const struct tree_map_base
*const a
= (const struct tree_map_base
*) va
,
6534 *const b
= (const struct tree_map_base
*) vb
;
6535 return (a
->from
== b
->from
);
6538 /* Hash a from tree in a tree_base_map. */
6541 tree_map_base_hash (const void *item
)
6543 return htab_hash_pointer (((const struct tree_map_base
*)item
)->from
);
6546 /* Return true if this tree map structure is marked for garbage collection
6547 purposes. We simply return true if the from tree is marked, so that this
6548 structure goes away when the from tree goes away. */
6551 tree_map_base_marked_p (const void *p
)
6553 return ggc_marked_p (((const struct tree_map_base
*) p
)->from
);
6556 /* Hash a from tree in a tree_map. */
6559 tree_map_hash (const void *item
)
6561 return (((const struct tree_map
*) item
)->hash
);
6564 /* Hash a from tree in a tree_decl_map. */
6567 tree_decl_map_hash (const void *item
)
6569 return DECL_UID (((const struct tree_decl_map
*) item
)->base
.from
);
6572 /* Return the initialization priority for DECL. */
6575 decl_init_priority_lookup (tree decl
)
6577 symtab_node
*snode
= symtab_node::get (decl
);
6580 return DEFAULT_INIT_PRIORITY
;
6582 snode
->get_init_priority ();
6585 /* Return the finalization priority for DECL. */
6588 decl_fini_priority_lookup (tree decl
)
6590 cgraph_node
*node
= cgraph_node::get (decl
);
6593 return DEFAULT_INIT_PRIORITY
;
6595 node
->get_fini_priority ();
6598 /* Set the initialization priority for DECL to PRIORITY. */
6601 decl_init_priority_insert (tree decl
, priority_type priority
)
6603 struct symtab_node
*snode
;
6605 if (priority
== DEFAULT_INIT_PRIORITY
)
6607 snode
= symtab_node::get (decl
);
6611 else if (TREE_CODE (decl
) == VAR_DECL
)
6612 snode
= varpool_node::get_create (decl
);
6614 snode
= cgraph_node::get_create (decl
);
6615 snode
->set_init_priority (priority
);
6618 /* Set the finalization priority for DECL to PRIORITY. */
6621 decl_fini_priority_insert (tree decl
, priority_type priority
)
6623 struct cgraph_node
*node
;
6625 if (priority
== DEFAULT_INIT_PRIORITY
)
6627 node
= cgraph_node::get (decl
);
6632 node
= cgraph_node::get_create (decl
);
6633 node
->set_fini_priority (priority
);
6636 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
6639 print_debug_expr_statistics (void)
6641 fprintf (stderr
, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
6642 (long) debug_expr_for_decl
->size (),
6643 (long) debug_expr_for_decl
->elements (),
6644 debug_expr_for_decl
->collisions ());
6647 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
6650 print_value_expr_statistics (void)
6652 fprintf (stderr
, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
6653 (long) value_expr_for_decl
->size (),
6654 (long) value_expr_for_decl
->elements (),
6655 value_expr_for_decl
->collisions ());
6658 /* Lookup a debug expression for FROM, and return it if we find one. */
6661 decl_debug_expr_lookup (tree from
)
6663 struct tree_decl_map
*h
, in
;
6664 in
.base
.from
= from
;
6666 h
= debug_expr_for_decl
->find_with_hash (&in
, DECL_UID (from
));
6672 /* Insert a mapping FROM->TO in the debug expression hashtable. */
6675 decl_debug_expr_insert (tree from
, tree to
)
6677 struct tree_decl_map
*h
;
6679 h
= ggc_alloc
<tree_decl_map
> ();
6680 h
->base
.from
= from
;
6682 *debug_expr_for_decl
->find_slot_with_hash (h
, DECL_UID (from
), INSERT
) = h
;
6685 /* Lookup a value expression for FROM, and return it if we find one. */
6688 decl_value_expr_lookup (tree from
)
6690 struct tree_decl_map
*h
, in
;
6691 in
.base
.from
= from
;
6693 h
= value_expr_for_decl
->find_with_hash (&in
, DECL_UID (from
));
6699 /* Insert a mapping FROM->TO in the value expression hashtable. */
6702 decl_value_expr_insert (tree from
, tree to
)
6704 struct tree_decl_map
*h
;
6706 h
= ggc_alloc
<tree_decl_map
> ();
6707 h
->base
.from
= from
;
6709 *value_expr_for_decl
->find_slot_with_hash (h
, DECL_UID (from
), INSERT
) = h
;
6712 /* Lookup a vector of debug arguments for FROM, and return it if we
6716 decl_debug_args_lookup (tree from
)
6718 struct tree_vec_map
*h
, in
;
6720 if (!DECL_HAS_DEBUG_ARGS_P (from
))
6722 gcc_checking_assert (debug_args_for_decl
!= NULL
);
6723 in
.base
.from
= from
;
6724 h
= debug_args_for_decl
->find_with_hash (&in
, DECL_UID (from
));
6730 /* Insert a mapping FROM->empty vector of debug arguments in the value
6731 expression hashtable. */
6734 decl_debug_args_insert (tree from
)
6736 struct tree_vec_map
*h
;
6739 if (DECL_HAS_DEBUG_ARGS_P (from
))
6740 return decl_debug_args_lookup (from
);
6741 if (debug_args_for_decl
== NULL
)
6742 debug_args_for_decl
= hash_table
<tree_vec_map_cache_hasher
>::create_ggc (64);
6743 h
= ggc_alloc
<tree_vec_map
> ();
6744 h
->base
.from
= from
;
6746 loc
= debug_args_for_decl
->find_slot_with_hash (h
, DECL_UID (from
), INSERT
);
6748 DECL_HAS_DEBUG_ARGS_P (from
) = 1;
6752 /* Hashing of types so that we don't make duplicates.
6753 The entry point is `type_hash_canon'. */
6755 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
6756 with types in the TREE_VALUE slots), by adding the hash codes
6757 of the individual types. */
6760 type_hash_list (const_tree list
, inchash::hash
&hstate
)
6764 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
6765 if (TREE_VALUE (tail
) != error_mark_node
)
6766 hstate
.add_object (TYPE_HASH (TREE_VALUE (tail
)));
6769 /* These are the Hashtable callback functions. */
6771 /* Returns true iff the types are equivalent. */
6774 type_cache_hasher::equal (type_hash
*a
, type_hash
*b
)
6776 /* First test the things that are the same for all types. */
6777 if (a
->hash
!= b
->hash
6778 || TREE_CODE (a
->type
) != TREE_CODE (b
->type
)
6779 || TREE_TYPE (a
->type
) != TREE_TYPE (b
->type
)
6780 || !attribute_list_equal (TYPE_ATTRIBUTES (a
->type
),
6781 TYPE_ATTRIBUTES (b
->type
))
6782 || (TREE_CODE (a
->type
) != COMPLEX_TYPE
6783 && TYPE_NAME (a
->type
) != TYPE_NAME (b
->type
)))
6786 /* Be careful about comparing arrays before and after the element type
6787 has been completed; don't compare TYPE_ALIGN unless both types are
6789 if (COMPLETE_TYPE_P (a
->type
) && COMPLETE_TYPE_P (b
->type
)
6790 && (TYPE_ALIGN (a
->type
) != TYPE_ALIGN (b
->type
)
6791 || TYPE_MODE (a
->type
) != TYPE_MODE (b
->type
)))
6794 switch (TREE_CODE (a
->type
))
6799 case REFERENCE_TYPE
:
6804 return TYPE_VECTOR_SUBPARTS (a
->type
) == TYPE_VECTOR_SUBPARTS (b
->type
);
6807 if (TYPE_VALUES (a
->type
) != TYPE_VALUES (b
->type
)
6808 && !(TYPE_VALUES (a
->type
)
6809 && TREE_CODE (TYPE_VALUES (a
->type
)) == TREE_LIST
6810 && TYPE_VALUES (b
->type
)
6811 && TREE_CODE (TYPE_VALUES (b
->type
)) == TREE_LIST
6812 && type_list_equal (TYPE_VALUES (a
->type
),
6813 TYPE_VALUES (b
->type
))))
6816 /* ... fall through ... */
6821 if (TYPE_PRECISION (a
->type
) != TYPE_PRECISION (b
->type
))
6823 return ((TYPE_MAX_VALUE (a
->type
) == TYPE_MAX_VALUE (b
->type
)
6824 || tree_int_cst_equal (TYPE_MAX_VALUE (a
->type
),
6825 TYPE_MAX_VALUE (b
->type
)))
6826 && (TYPE_MIN_VALUE (a
->type
) == TYPE_MIN_VALUE (b
->type
)
6827 || tree_int_cst_equal (TYPE_MIN_VALUE (a
->type
),
6828 TYPE_MIN_VALUE (b
->type
))));
6830 case FIXED_POINT_TYPE
:
6831 return TYPE_SATURATING (a
->type
) == TYPE_SATURATING (b
->type
);
6834 return TYPE_OFFSET_BASETYPE (a
->type
) == TYPE_OFFSET_BASETYPE (b
->type
);
6837 if (TYPE_METHOD_BASETYPE (a
->type
) == TYPE_METHOD_BASETYPE (b
->type
)
6838 && (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
6839 || (TYPE_ARG_TYPES (a
->type
)
6840 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
6841 && TYPE_ARG_TYPES (b
->type
)
6842 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
6843 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
6844 TYPE_ARG_TYPES (b
->type
)))))
6848 return TYPE_DOMAIN (a
->type
) == TYPE_DOMAIN (b
->type
);
6852 case QUAL_UNION_TYPE
:
6853 return (TYPE_FIELDS (a
->type
) == TYPE_FIELDS (b
->type
)
6854 || (TYPE_FIELDS (a
->type
)
6855 && TREE_CODE (TYPE_FIELDS (a
->type
)) == TREE_LIST
6856 && TYPE_FIELDS (b
->type
)
6857 && TREE_CODE (TYPE_FIELDS (b
->type
)) == TREE_LIST
6858 && type_list_equal (TYPE_FIELDS (a
->type
),
6859 TYPE_FIELDS (b
->type
))));
6862 if (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
6863 || (TYPE_ARG_TYPES (a
->type
)
6864 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
6865 && TYPE_ARG_TYPES (b
->type
)
6866 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
6867 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
6868 TYPE_ARG_TYPES (b
->type
))))
6876 if (lang_hooks
.types
.type_hash_eq
!= NULL
)
6877 return lang_hooks
.types
.type_hash_eq (a
->type
, b
->type
);
6882 /* Given TYPE, and HASHCODE its hash code, return the canonical
6883 object for an identical type if one already exists.
6884 Otherwise, return TYPE, and record it as the canonical object.
6886 To use this function, first create a type of the sort you want.
6887 Then compute its hash code from the fields of the type that
6888 make it different from other similar types.
6889 Then call this function and use the value. */
6892 type_hash_canon (unsigned int hashcode
, tree type
)
6897 /* The hash table only contains main variants, so ensure that's what we're
6899 gcc_assert (TYPE_MAIN_VARIANT (type
) == type
);
6901 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
6902 must call that routine before comparing TYPE_ALIGNs. */
6908 loc
= type_hash_table
->find_slot_with_hash (&in
, hashcode
, INSERT
);
6911 tree t1
= ((type_hash
*) *loc
)->type
;
6912 gcc_assert (TYPE_MAIN_VARIANT (t1
) == t1
);
6913 if (GATHER_STATISTICS
)
6915 tree_code_counts
[(int) TREE_CODE (type
)]--;
6916 tree_node_counts
[(int) t_kind
]--;
6917 tree_node_sizes
[(int) t_kind
] -= sizeof (struct tree_type_non_common
);
6923 struct type_hash
*h
;
6925 h
= ggc_alloc
<type_hash
> ();
6935 print_type_hash_statistics (void)
6937 fprintf (stderr
, "Type hash: size %ld, %ld elements, %f collisions\n",
6938 (long) type_hash_table
->size (),
6939 (long) type_hash_table
->elements (),
6940 type_hash_table
->collisions ());
6943 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
6944 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
6945 by adding the hash codes of the individual attributes. */
6948 attribute_hash_list (const_tree list
, inchash::hash
&hstate
)
6952 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
6953 /* ??? Do we want to add in TREE_VALUE too? */
6954 hstate
.add_object (IDENTIFIER_HASH_VALUE (get_attribute_name (tail
)));
6957 /* Given two lists of attributes, return true if list l2 is
6958 equivalent to l1. */
6961 attribute_list_equal (const_tree l1
, const_tree l2
)
6966 return attribute_list_contained (l1
, l2
)
6967 && attribute_list_contained (l2
, l1
);
6970 /* Given two lists of attributes, return true if list L2 is
6971 completely contained within L1. */
6972 /* ??? This would be faster if attribute names were stored in a canonicalized
6973 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
6974 must be used to show these elements are equivalent (which they are). */
6975 /* ??? It's not clear that attributes with arguments will always be handled
6979 attribute_list_contained (const_tree l1
, const_tree l2
)
6983 /* First check the obvious, maybe the lists are identical. */
6987 /* Maybe the lists are similar. */
6988 for (t1
= l1
, t2
= l2
;
6990 && get_attribute_name (t1
) == get_attribute_name (t2
)
6991 && TREE_VALUE (t1
) == TREE_VALUE (t2
);
6992 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
6995 /* Maybe the lists are equal. */
6996 if (t1
== 0 && t2
== 0)
6999 for (; t2
!= 0; t2
= TREE_CHAIN (t2
))
7002 /* This CONST_CAST is okay because lookup_attribute does not
7003 modify its argument and the return value is assigned to a
7005 for (attr
= lookup_ident_attribute (get_attribute_name (t2
),
7006 CONST_CAST_TREE (l1
));
7007 attr
!= NULL_TREE
&& !attribute_value_equal (t2
, attr
);
7008 attr
= lookup_ident_attribute (get_attribute_name (t2
),
7012 if (attr
== NULL_TREE
)
7019 /* Given two lists of types
7020 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
7021 return 1 if the lists contain the same types in the same order.
7022 Also, the TREE_PURPOSEs must match. */
7025 type_list_equal (const_tree l1
, const_tree l2
)
7029 for (t1
= l1
, t2
= l2
; t1
&& t2
; t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
7030 if (TREE_VALUE (t1
) != TREE_VALUE (t2
)
7031 || (TREE_PURPOSE (t1
) != TREE_PURPOSE (t2
)
7032 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
))
7033 && (TREE_TYPE (TREE_PURPOSE (t1
))
7034 == TREE_TYPE (TREE_PURPOSE (t2
))))))
7040 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
7041 given by TYPE. If the argument list accepts variable arguments,
7042 then this function counts only the ordinary arguments. */
7045 type_num_arguments (const_tree type
)
7050 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
7051 /* If the function does not take a variable number of arguments,
7052 the last element in the list will have type `void'. */
7053 if (VOID_TYPE_P (TREE_VALUE (t
)))
7061 /* Nonzero if integer constants T1 and T2
7062 represent the same constant value. */
7065 tree_int_cst_equal (const_tree t1
, const_tree t2
)
7070 if (t1
== 0 || t2
== 0)
7073 if (TREE_CODE (t1
) == INTEGER_CST
7074 && TREE_CODE (t2
) == INTEGER_CST
7075 && wi::to_widest (t1
) == wi::to_widest (t2
))
7081 /* Return true if T is an INTEGER_CST whose numerical value (extended
7082 according to TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. */
7085 tree_fits_shwi_p (const_tree t
)
7087 return (t
!= NULL_TREE
7088 && TREE_CODE (t
) == INTEGER_CST
7089 && wi::fits_shwi_p (wi::to_widest (t
)));
7092 /* Return true if T is an INTEGER_CST whose numerical value (extended
7093 according to TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. */
7096 tree_fits_uhwi_p (const_tree t
)
7098 return (t
!= NULL_TREE
7099 && TREE_CODE (t
) == INTEGER_CST
7100 && wi::fits_uhwi_p (wi::to_widest (t
)));
7103 /* T is an INTEGER_CST whose numerical value (extended according to
7104 TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. Return that
7108 tree_to_shwi (const_tree t
)
7110 gcc_assert (tree_fits_shwi_p (t
));
7111 return TREE_INT_CST_LOW (t
);
7114 /* T is an INTEGER_CST whose numerical value (extended according to
7115 TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. Return that
7118 unsigned HOST_WIDE_INT
7119 tree_to_uhwi (const_tree t
)
7121 gcc_assert (tree_fits_uhwi_p (t
));
7122 return TREE_INT_CST_LOW (t
);
7125 /* Return the most significant (sign) bit of T. */
7128 tree_int_cst_sign_bit (const_tree t
)
7130 unsigned bitno
= TYPE_PRECISION (TREE_TYPE (t
)) - 1;
7132 return wi::extract_uhwi (t
, bitno
, 1);
7135 /* Return an indication of the sign of the integer constant T.
7136 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
7137 Note that -1 will never be returned if T's type is unsigned. */
7140 tree_int_cst_sgn (const_tree t
)
7142 if (wi::eq_p (t
, 0))
7144 else if (TYPE_UNSIGNED (TREE_TYPE (t
)))
7146 else if (wi::neg_p (t
))
7152 /* Return the minimum number of bits needed to represent VALUE in a
7153 signed or unsigned type, UNSIGNEDP says which. */
7156 tree_int_cst_min_precision (tree value
, signop sgn
)
7158 /* If the value is negative, compute its negative minus 1. The latter
7159 adjustment is because the absolute value of the largest negative value
7160 is one larger than the largest positive value. This is equivalent to
7161 a bit-wise negation, so use that operation instead. */
7163 if (tree_int_cst_sgn (value
) < 0)
7164 value
= fold_build1 (BIT_NOT_EXPR
, TREE_TYPE (value
), value
);
7166 /* Return the number of bits needed, taking into account the fact
7167 that we need one more bit for a signed than unsigned type.
7168 If value is 0 or -1, the minimum precision is 1 no matter
7169 whether unsignedp is true or false. */
7171 if (integer_zerop (value
))
7174 return tree_floor_log2 (value
) + 1 + (sgn
== SIGNED
? 1 : 0) ;
7177 /* Return truthvalue of whether T1 is the same tree structure as T2.
7178 Return 1 if they are the same.
7179 Return 0 if they are understandably different.
7180 Return -1 if either contains tree structure not understood by
7184 simple_cst_equal (const_tree t1
, const_tree t2
)
7186 enum tree_code code1
, code2
;
7192 if (t1
== 0 || t2
== 0)
7195 code1
= TREE_CODE (t1
);
7196 code2
= TREE_CODE (t2
);
7198 if (CONVERT_EXPR_CODE_P (code1
) || code1
== NON_LVALUE_EXPR
)
7200 if (CONVERT_EXPR_CODE_P (code2
)
7201 || code2
== NON_LVALUE_EXPR
)
7202 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7204 return simple_cst_equal (TREE_OPERAND (t1
, 0), t2
);
7207 else if (CONVERT_EXPR_CODE_P (code2
)
7208 || code2
== NON_LVALUE_EXPR
)
7209 return simple_cst_equal (t1
, TREE_OPERAND (t2
, 0));
7217 return wi::to_widest (t1
) == wi::to_widest (t2
);
7220 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1
), TREE_REAL_CST (t2
));
7223 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1
), TREE_FIXED_CST (t2
));
7226 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
7227 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
7228 TREE_STRING_LENGTH (t1
)));
7232 unsigned HOST_WIDE_INT idx
;
7233 vec
<constructor_elt
, va_gc
> *v1
= CONSTRUCTOR_ELTS (t1
);
7234 vec
<constructor_elt
, va_gc
> *v2
= CONSTRUCTOR_ELTS (t2
);
7236 if (vec_safe_length (v1
) != vec_safe_length (v2
))
7239 for (idx
= 0; idx
< vec_safe_length (v1
); ++idx
)
7240 /* ??? Should we handle also fields here? */
7241 if (!simple_cst_equal ((*v1
)[idx
].value
, (*v2
)[idx
].value
))
7247 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7250 cmp
= simple_cst_equal (CALL_EXPR_FN (t1
), CALL_EXPR_FN (t2
));
7253 if (call_expr_nargs (t1
) != call_expr_nargs (t2
))
7256 const_tree arg1
, arg2
;
7257 const_call_expr_arg_iterator iter1
, iter2
;
7258 for (arg1
= first_const_call_expr_arg (t1
, &iter1
),
7259 arg2
= first_const_call_expr_arg (t2
, &iter2
);
7261 arg1
= next_const_call_expr_arg (&iter1
),
7262 arg2
= next_const_call_expr_arg (&iter2
))
7264 cmp
= simple_cst_equal (arg1
, arg2
);
7268 return arg1
== arg2
;
7272 /* Special case: if either target is an unallocated VAR_DECL,
7273 it means that it's going to be unified with whatever the
7274 TARGET_EXPR is really supposed to initialize, so treat it
7275 as being equivalent to anything. */
7276 if ((TREE_CODE (TREE_OPERAND (t1
, 0)) == VAR_DECL
7277 && DECL_NAME (TREE_OPERAND (t1
, 0)) == NULL_TREE
7278 && !DECL_RTL_SET_P (TREE_OPERAND (t1
, 0)))
7279 || (TREE_CODE (TREE_OPERAND (t2
, 0)) == VAR_DECL
7280 && DECL_NAME (TREE_OPERAND (t2
, 0)) == NULL_TREE
7281 && !DECL_RTL_SET_P (TREE_OPERAND (t2
, 0))))
7284 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7289 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
7291 case WITH_CLEANUP_EXPR
:
7292 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7296 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t1
, 1));
7299 if (TREE_OPERAND (t1
, 1) == TREE_OPERAND (t2
, 1))
7300 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7314 /* This general rule works for most tree codes. All exceptions should be
7315 handled above. If this is a language-specific tree code, we can't
7316 trust what might be in the operand, so say we don't know
7318 if ((int) code1
>= (int) LAST_AND_UNUSED_TREE_CODE
)
7321 switch (TREE_CODE_CLASS (code1
))
7325 case tcc_comparison
:
7326 case tcc_expression
:
7330 for (i
= 0; i
< TREE_CODE_LENGTH (code1
); i
++)
7332 cmp
= simple_cst_equal (TREE_OPERAND (t1
, i
), TREE_OPERAND (t2
, i
));
7344 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
7345 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
7346 than U, respectively. */
7349 compare_tree_int (const_tree t
, unsigned HOST_WIDE_INT u
)
7351 if (tree_int_cst_sgn (t
) < 0)
7353 else if (!tree_fits_uhwi_p (t
))
7355 else if (TREE_INT_CST_LOW (t
) == u
)
7357 else if (TREE_INT_CST_LOW (t
) < u
)
7363 /* Return true if SIZE represents a constant size that is in bounds of
7364 what the middle-end and the backend accepts (covering not more than
7365 half of the address-space). */
7368 valid_constant_size_p (const_tree size
)
7370 if (! tree_fits_uhwi_p (size
)
7371 || TREE_OVERFLOW (size
)
7372 || tree_int_cst_sign_bit (size
) != 0)
7377 /* Return the precision of the type, or for a complex or vector type the
7378 precision of the type of its elements. */
7381 element_precision (const_tree type
)
7383 enum tree_code code
= TREE_CODE (type
);
7384 if (code
== COMPLEX_TYPE
|| code
== VECTOR_TYPE
)
7385 type
= TREE_TYPE (type
);
7387 return TYPE_PRECISION (type
);
7390 /* Return true if CODE represents an associative tree code. Otherwise
7393 associative_tree_code (enum tree_code code
)
7412 /* Return true if CODE represents a commutative tree code. Otherwise
7415 commutative_tree_code (enum tree_code code
)
7421 case MULT_HIGHPART_EXPR
:
7429 case UNORDERED_EXPR
:
7433 case TRUTH_AND_EXPR
:
7434 case TRUTH_XOR_EXPR
:
7436 case WIDEN_MULT_EXPR
:
7437 case VEC_WIDEN_MULT_HI_EXPR
:
7438 case VEC_WIDEN_MULT_LO_EXPR
:
7439 case VEC_WIDEN_MULT_EVEN_EXPR
:
7440 case VEC_WIDEN_MULT_ODD_EXPR
:
7449 /* Return true if CODE represents a ternary tree code for which the
7450 first two operands are commutative. Otherwise return false. */
7452 commutative_ternary_tree_code (enum tree_code code
)
7456 case WIDEN_MULT_PLUS_EXPR
:
7457 case WIDEN_MULT_MINUS_EXPR
:
7471 /* Generate a hash value for an expression. This can be used iteratively
7472 by passing a previous result as the HSTATE argument.
7474 This function is intended to produce the same hash for expressions which
7475 would compare equal using operand_equal_p. */
7477 add_expr (const_tree t
, inchash::hash
&hstate
)
7480 enum tree_code code
;
7481 enum tree_code_class tclass
;
7485 hstate
.merge_hash (0);
7489 code
= TREE_CODE (t
);
7493 /* Alas, constants aren't shared, so we can't rely on pointer
7496 hstate
.merge_hash (0);
7499 for (i
= 0; i
< TREE_INT_CST_NUNITS (t
); i
++)
7500 hstate
.add_wide_int (TREE_INT_CST_ELT (t
, i
));
7504 unsigned int val2
= real_hash (TREE_REAL_CST_PTR (t
));
7505 hstate
.merge_hash (val2
);
7510 unsigned int val2
= fixed_hash (TREE_FIXED_CST_PTR (t
));
7511 hstate
.merge_hash (val2
);
7515 hstate
.add ((const void *) TREE_STRING_POINTER (t
), TREE_STRING_LENGTH (t
));
7518 inchash::add_expr (TREE_REALPART (t
), hstate
);
7519 inchash::add_expr (TREE_IMAGPART (t
), hstate
);
7524 for (i
= 0; i
< VECTOR_CST_NELTS (t
); ++i
)
7525 inchash::add_expr (VECTOR_CST_ELT (t
, i
), hstate
);
7529 /* We can just compare by pointer. */
7530 hstate
.add_wide_int (SSA_NAME_VERSION (t
));
7532 case PLACEHOLDER_EXPR
:
7533 /* The node itself doesn't matter. */
7536 /* A list of expressions, for a CALL_EXPR or as the elements of a
7538 for (; t
; t
= TREE_CHAIN (t
))
7539 inchash::add_expr (TREE_VALUE (t
), hstate
);
7543 unsigned HOST_WIDE_INT idx
;
7545 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t
), idx
, field
, value
)
7547 inchash::add_expr (field
, hstate
);
7548 inchash::add_expr (value
, hstate
);
7553 /* When referring to a built-in FUNCTION_DECL, use the __builtin__ form.
7554 Otherwise nodes that compare equal according to operand_equal_p might
7555 get different hash codes. However, don't do this for machine specific
7556 or front end builtins, since the function code is overloaded in those
7558 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
7559 && builtin_decl_explicit_p (DECL_FUNCTION_CODE (t
)))
7561 t
= builtin_decl_explicit (DECL_FUNCTION_CODE (t
));
7562 code
= TREE_CODE (t
);
7566 tclass
= TREE_CODE_CLASS (code
);
7568 if (tclass
== tcc_declaration
)
7570 /* DECL's have a unique ID */
7571 hstate
.add_wide_int (DECL_UID (t
));
7575 gcc_assert (IS_EXPR_CODE_CLASS (tclass
));
7577 hstate
.add_object (code
);
7579 /* Don't hash the type, that can lead to having nodes which
7580 compare equal according to operand_equal_p, but which
7581 have different hash codes. */
7582 if (CONVERT_EXPR_CODE_P (code
)
7583 || code
== NON_LVALUE_EXPR
)
7585 /* Make sure to include signness in the hash computation. */
7586 hstate
.add_int (TYPE_UNSIGNED (TREE_TYPE (t
)));
7587 inchash::add_expr (TREE_OPERAND (t
, 0), hstate
);
7590 else if (commutative_tree_code (code
))
7592 /* It's a commutative expression. We want to hash it the same
7593 however it appears. We do this by first hashing both operands
7594 and then rehashing based on the order of their independent
7596 inchash::hash one
, two
;
7597 inchash::add_expr (TREE_OPERAND (t
, 0), one
);
7598 inchash::add_expr (TREE_OPERAND (t
, 1), two
);
7599 hstate
.add_commutative (one
, two
);
7602 for (i
= TREE_OPERAND_LENGTH (t
) - 1; i
>= 0; --i
)
7603 inchash::add_expr (TREE_OPERAND (t
, i
), hstate
);
7611 /* Constructors for pointer, array and function types.
7612 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
7613 constructed by language-dependent code, not here.) */
7615 /* Construct, lay out and return the type of pointers to TO_TYPE with
7616 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
7617 reference all of memory. If such a type has already been
7618 constructed, reuse it. */
7621 build_pointer_type_for_mode (tree to_type
, machine_mode mode
,
7626 if (to_type
== error_mark_node
)
7627 return error_mark_node
;
7629 /* If the pointed-to type has the may_alias attribute set, force
7630 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7631 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
7632 can_alias_all
= true;
7634 /* In some cases, languages will have things that aren't a POINTER_TYPE
7635 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
7636 In that case, return that type without regard to the rest of our
7639 ??? This is a kludge, but consistent with the way this function has
7640 always operated and there doesn't seem to be a good way to avoid this
7642 if (TYPE_POINTER_TO (to_type
) != 0
7643 && TREE_CODE (TYPE_POINTER_TO (to_type
)) != POINTER_TYPE
)
7644 return TYPE_POINTER_TO (to_type
);
7646 /* First, if we already have a type for pointers to TO_TYPE and it's
7647 the proper mode, use it. */
7648 for (t
= TYPE_POINTER_TO (to_type
); t
; t
= TYPE_NEXT_PTR_TO (t
))
7649 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
7652 t
= make_node (POINTER_TYPE
);
7654 TREE_TYPE (t
) = to_type
;
7655 SET_TYPE_MODE (t
, mode
);
7656 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
7657 TYPE_NEXT_PTR_TO (t
) = TYPE_POINTER_TO (to_type
);
7658 TYPE_POINTER_TO (to_type
) = t
;
7660 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
))
7661 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7662 else if (TYPE_CANONICAL (to_type
) != to_type
)
7664 = build_pointer_type_for_mode (TYPE_CANONICAL (to_type
),
7665 mode
, can_alias_all
);
7667 /* Lay out the type. This function has many callers that are concerned
7668 with expression-construction, and this simplifies them all. */
7674 /* By default build pointers in ptr_mode. */
7677 build_pointer_type (tree to_type
)
7679 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
7680 : TYPE_ADDR_SPACE (to_type
);
7681 machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
7682 return build_pointer_type_for_mode (to_type
, pointer_mode
, false);
7685 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
7688 build_reference_type_for_mode (tree to_type
, machine_mode mode
,
7693 if (to_type
== error_mark_node
)
7694 return error_mark_node
;
7696 /* If the pointed-to type has the may_alias attribute set, force
7697 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7698 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
7699 can_alias_all
= true;
7701 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
7702 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
7703 In that case, return that type without regard to the rest of our
7706 ??? This is a kludge, but consistent with the way this function has
7707 always operated and there doesn't seem to be a good way to avoid this
7709 if (TYPE_REFERENCE_TO (to_type
) != 0
7710 && TREE_CODE (TYPE_REFERENCE_TO (to_type
)) != REFERENCE_TYPE
)
7711 return TYPE_REFERENCE_TO (to_type
);
7713 /* First, if we already have a type for pointers to TO_TYPE and it's
7714 the proper mode, use it. */
7715 for (t
= TYPE_REFERENCE_TO (to_type
); t
; t
= TYPE_NEXT_REF_TO (t
))
7716 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
7719 t
= make_node (REFERENCE_TYPE
);
7721 TREE_TYPE (t
) = to_type
;
7722 SET_TYPE_MODE (t
, mode
);
7723 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
7724 TYPE_NEXT_REF_TO (t
) = TYPE_REFERENCE_TO (to_type
);
7725 TYPE_REFERENCE_TO (to_type
) = t
;
7727 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
))
7728 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7729 else if (TYPE_CANONICAL (to_type
) != to_type
)
7731 = build_reference_type_for_mode (TYPE_CANONICAL (to_type
),
7732 mode
, can_alias_all
);
7740 /* Build the node for the type of references-to-TO_TYPE by default
7744 build_reference_type (tree to_type
)
7746 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
7747 : TYPE_ADDR_SPACE (to_type
);
7748 machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
7749 return build_reference_type_for_mode (to_type
, pointer_mode
, false);
7752 #define MAX_INT_CACHED_PREC \
7753 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
7754 static GTY(()) tree nonstandard_integer_type_cache
[2 * MAX_INT_CACHED_PREC
+ 2];
7756 /* Builds a signed or unsigned integer type of precision PRECISION.
7757 Used for C bitfields whose precision does not match that of
7758 built-in target types. */
7760 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision
,
7766 unsignedp
= MAX_INT_CACHED_PREC
+ 1;
7768 if (precision
<= MAX_INT_CACHED_PREC
)
7770 itype
= nonstandard_integer_type_cache
[precision
+ unsignedp
];
7775 itype
= make_node (INTEGER_TYPE
);
7776 TYPE_PRECISION (itype
) = precision
;
7779 fixup_unsigned_type (itype
);
7781 fixup_signed_type (itype
);
7784 if (tree_fits_uhwi_p (TYPE_MAX_VALUE (itype
)))
7785 ret
= type_hash_canon (tree_to_uhwi (TYPE_MAX_VALUE (itype
)), itype
);
7786 if (precision
<= MAX_INT_CACHED_PREC
)
7787 nonstandard_integer_type_cache
[precision
+ unsignedp
] = ret
;
7792 /* Create a range of some discrete type TYPE (an INTEGER_TYPE, ENUMERAL_TYPE
7793 or BOOLEAN_TYPE) with low bound LOWVAL and high bound HIGHVAL. If SHARED
7794 is true, reuse such a type that has already been constructed. */
7797 build_range_type_1 (tree type
, tree lowval
, tree highval
, bool shared
)
7799 tree itype
= make_node (INTEGER_TYPE
);
7800 inchash::hash hstate
;
7802 TREE_TYPE (itype
) = type
;
7804 TYPE_MIN_VALUE (itype
) = fold_convert (type
, lowval
);
7805 TYPE_MAX_VALUE (itype
) = highval
? fold_convert (type
, highval
) : NULL
;
7807 TYPE_PRECISION (itype
) = TYPE_PRECISION (type
);
7808 SET_TYPE_MODE (itype
, TYPE_MODE (type
));
7809 TYPE_SIZE (itype
) = TYPE_SIZE (type
);
7810 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (type
);
7811 TYPE_ALIGN (itype
) = TYPE_ALIGN (type
);
7812 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (type
);
7817 if ((TYPE_MIN_VALUE (itype
)
7818 && TREE_CODE (TYPE_MIN_VALUE (itype
)) != INTEGER_CST
)
7819 || (TYPE_MAX_VALUE (itype
)
7820 && TREE_CODE (TYPE_MAX_VALUE (itype
)) != INTEGER_CST
))
7822 /* Since we cannot reliably merge this type, we need to compare it using
7823 structural equality checks. */
7824 SET_TYPE_STRUCTURAL_EQUALITY (itype
);
7828 inchash::add_expr (TYPE_MIN_VALUE (itype
), hstate
);
7829 inchash::add_expr (TYPE_MAX_VALUE (itype
), hstate
);
7830 hstate
.merge_hash (TYPE_HASH (type
));
7831 itype
= type_hash_canon (hstate
.end (), itype
);
7836 /* Wrapper around build_range_type_1 with SHARED set to true. */
7839 build_range_type (tree type
, tree lowval
, tree highval
)
7841 return build_range_type_1 (type
, lowval
, highval
, true);
7844 /* Wrapper around build_range_type_1 with SHARED set to false. */
7847 build_nonshared_range_type (tree type
, tree lowval
, tree highval
)
7849 return build_range_type_1 (type
, lowval
, highval
, false);
7852 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
7853 MAXVAL should be the maximum value in the domain
7854 (one less than the length of the array).
7856 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
7857 We don't enforce this limit, that is up to caller (e.g. language front end).
7858 The limit exists because the result is a signed type and we don't handle
7859 sizes that use more than one HOST_WIDE_INT. */
7862 build_index_type (tree maxval
)
7864 return build_range_type (sizetype
, size_zero_node
, maxval
);
7867 /* Return true if the debug information for TYPE, a subtype, should be emitted
7868 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
7869 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
7870 debug info and doesn't reflect the source code. */
7873 subrange_type_for_debug_p (const_tree type
, tree
*lowval
, tree
*highval
)
7875 tree base_type
= TREE_TYPE (type
), low
, high
;
7877 /* Subrange types have a base type which is an integral type. */
7878 if (!INTEGRAL_TYPE_P (base_type
))
7881 /* Get the real bounds of the subtype. */
7882 if (lang_hooks
.types
.get_subrange_bounds
)
7883 lang_hooks
.types
.get_subrange_bounds (type
, &low
, &high
);
7886 low
= TYPE_MIN_VALUE (type
);
7887 high
= TYPE_MAX_VALUE (type
);
7890 /* If the type and its base type have the same representation and the same
7891 name, then the type is not a subrange but a copy of the base type. */
7892 if ((TREE_CODE (base_type
) == INTEGER_TYPE
7893 || TREE_CODE (base_type
) == BOOLEAN_TYPE
)
7894 && int_size_in_bytes (type
) == int_size_in_bytes (base_type
)
7895 && tree_int_cst_equal (low
, TYPE_MIN_VALUE (base_type
))
7896 && tree_int_cst_equal (high
, TYPE_MAX_VALUE (base_type
))
7897 && TYPE_IDENTIFIER (type
) == TYPE_IDENTIFIER (base_type
))
7907 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
7908 and number of elements specified by the range of values of INDEX_TYPE.
7909 If SHARED is true, reuse such a type that has already been constructed. */
7912 build_array_type_1 (tree elt_type
, tree index_type
, bool shared
)
7916 if (TREE_CODE (elt_type
) == FUNCTION_TYPE
)
7918 error ("arrays of functions are not meaningful");
7919 elt_type
= integer_type_node
;
7922 t
= make_node (ARRAY_TYPE
);
7923 TREE_TYPE (t
) = elt_type
;
7924 TYPE_DOMAIN (t
) = index_type
;
7925 TYPE_ADDR_SPACE (t
) = TYPE_ADDR_SPACE (elt_type
);
7928 /* If the element type is incomplete at this point we get marked for
7929 structural equality. Do not record these types in the canonical
7931 if (TYPE_STRUCTURAL_EQUALITY_P (t
))
7936 inchash::hash hstate
;
7937 hstate
.add_object (TYPE_HASH (elt_type
));
7939 hstate
.add_object (TYPE_HASH (index_type
));
7940 t
= type_hash_canon (hstate
.end (), t
);
7943 if (TYPE_CANONICAL (t
) == t
)
7945 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type
)
7946 || (index_type
&& TYPE_STRUCTURAL_EQUALITY_P (index_type
)))
7947 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7948 else if (TYPE_CANONICAL (elt_type
) != elt_type
7949 || (index_type
&& TYPE_CANONICAL (index_type
) != index_type
))
7951 = build_array_type_1 (TYPE_CANONICAL (elt_type
),
7953 ? TYPE_CANONICAL (index_type
) : NULL_TREE
,
7960 /* Wrapper around build_array_type_1 with SHARED set to true. */
7963 build_array_type (tree elt_type
, tree index_type
)
7965 return build_array_type_1 (elt_type
, index_type
, true);
7968 /* Wrapper around build_array_type_1 with SHARED set to false. */
7971 build_nonshared_array_type (tree elt_type
, tree index_type
)
7973 return build_array_type_1 (elt_type
, index_type
, false);
7976 /* Return a representation of ELT_TYPE[NELTS], using indices of type
7980 build_array_type_nelts (tree elt_type
, unsigned HOST_WIDE_INT nelts
)
7982 return build_array_type (elt_type
, build_index_type (size_int (nelts
- 1)));
7985 /* Recursively examines the array elements of TYPE, until a non-array
7986 element type is found. */
7989 strip_array_types (tree type
)
7991 while (TREE_CODE (type
) == ARRAY_TYPE
)
7992 type
= TREE_TYPE (type
);
7997 /* Computes the canonical argument types from the argument type list
8000 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
8001 on entry to this function, or if any of the ARGTYPES are
8004 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
8005 true on entry to this function, or if any of the ARGTYPES are
8008 Returns a canonical argument list, which may be ARGTYPES when the
8009 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
8010 true) or would not differ from ARGTYPES. */
8013 maybe_canonicalize_argtypes (tree argtypes
,
8014 bool *any_structural_p
,
8015 bool *any_noncanonical_p
)
8018 bool any_noncanonical_argtypes_p
= false;
8020 for (arg
= argtypes
; arg
&& !(*any_structural_p
); arg
= TREE_CHAIN (arg
))
8022 if (!TREE_VALUE (arg
) || TREE_VALUE (arg
) == error_mark_node
)
8023 /* Fail gracefully by stating that the type is structural. */
8024 *any_structural_p
= true;
8025 else if (TYPE_STRUCTURAL_EQUALITY_P (TREE_VALUE (arg
)))
8026 *any_structural_p
= true;
8027 else if (TYPE_CANONICAL (TREE_VALUE (arg
)) != TREE_VALUE (arg
)
8028 || TREE_PURPOSE (arg
))
8029 /* If the argument has a default argument, we consider it
8030 non-canonical even though the type itself is canonical.
8031 That way, different variants of function and method types
8032 with default arguments will all point to the variant with
8033 no defaults as their canonical type. */
8034 any_noncanonical_argtypes_p
= true;
8037 if (*any_structural_p
)
8040 if (any_noncanonical_argtypes_p
)
8042 /* Build the canonical list of argument types. */
8043 tree canon_argtypes
= NULL_TREE
;
8044 bool is_void
= false;
8046 for (arg
= argtypes
; arg
; arg
= TREE_CHAIN (arg
))
8048 if (arg
== void_list_node
)
8051 canon_argtypes
= tree_cons (NULL_TREE
,
8052 TYPE_CANONICAL (TREE_VALUE (arg
)),
8056 canon_argtypes
= nreverse (canon_argtypes
);
8058 canon_argtypes
= chainon (canon_argtypes
, void_list_node
);
8060 /* There is a non-canonical type. */
8061 *any_noncanonical_p
= true;
8062 return canon_argtypes
;
8065 /* The canonical argument types are the same as ARGTYPES. */
8069 /* Construct, lay out and return
8070 the type of functions returning type VALUE_TYPE
8071 given arguments of types ARG_TYPES.
8072 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
8073 are data type nodes for the arguments of the function.
8074 If such a type has already been constructed, reuse it. */
8077 build_function_type (tree value_type
, tree arg_types
)
8080 inchash::hash hstate
;
8081 bool any_structural_p
, any_noncanonical_p
;
8082 tree canon_argtypes
;
8084 if (TREE_CODE (value_type
) == FUNCTION_TYPE
)
8086 error ("function return type cannot be function");
8087 value_type
= integer_type_node
;
8090 /* Make a node of the sort we want. */
8091 t
= make_node (FUNCTION_TYPE
);
8092 TREE_TYPE (t
) = value_type
;
8093 TYPE_ARG_TYPES (t
) = arg_types
;
8095 /* If we already have such a type, use the old one. */
8096 hstate
.add_object (TYPE_HASH (value_type
));
8097 type_hash_list (arg_types
, hstate
);
8098 t
= type_hash_canon (hstate
.end (), t
);
8100 /* Set up the canonical type. */
8101 any_structural_p
= TYPE_STRUCTURAL_EQUALITY_P (value_type
);
8102 any_noncanonical_p
= TYPE_CANONICAL (value_type
) != value_type
;
8103 canon_argtypes
= maybe_canonicalize_argtypes (arg_types
,
8105 &any_noncanonical_p
);
8106 if (any_structural_p
)
8107 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8108 else if (any_noncanonical_p
)
8109 TYPE_CANONICAL (t
) = build_function_type (TYPE_CANONICAL (value_type
),
8112 if (!COMPLETE_TYPE_P (t
))
8117 /* Build a function type. The RETURN_TYPE is the type returned by the
8118 function. If VAARGS is set, no void_type_node is appended to the
8119 the list. ARGP must be always be terminated be a NULL_TREE. */
8122 build_function_type_list_1 (bool vaargs
, tree return_type
, va_list argp
)
8126 t
= va_arg (argp
, tree
);
8127 for (args
= NULL_TREE
; t
!= NULL_TREE
; t
= va_arg (argp
, tree
))
8128 args
= tree_cons (NULL_TREE
, t
, args
);
8133 if (args
!= NULL_TREE
)
8134 args
= nreverse (args
);
8135 gcc_assert (last
!= void_list_node
);
8137 else if (args
== NULL_TREE
)
8138 args
= void_list_node
;
8142 args
= nreverse (args
);
8143 TREE_CHAIN (last
) = void_list_node
;
8145 args
= build_function_type (return_type
, args
);
8150 /* Build a function type. The RETURN_TYPE is the type returned by the
8151 function. If additional arguments are provided, they are
8152 additional argument types. The list of argument types must always
8153 be terminated by NULL_TREE. */
8156 build_function_type_list (tree return_type
, ...)
8161 va_start (p
, return_type
);
8162 args
= build_function_type_list_1 (false, return_type
, p
);
8167 /* Build a variable argument function type. The RETURN_TYPE is the
8168 type returned by the function. If additional arguments are provided,
8169 they are additional argument types. The list of argument types must
8170 always be terminated by NULL_TREE. */
8173 build_varargs_function_type_list (tree return_type
, ...)
8178 va_start (p
, return_type
);
8179 args
= build_function_type_list_1 (true, return_type
, p
);
8185 /* Build a function type. RETURN_TYPE is the type returned by the
8186 function; VAARGS indicates whether the function takes varargs. The
8187 function takes N named arguments, the types of which are provided in
8191 build_function_type_array_1 (bool vaargs
, tree return_type
, int n
,
8195 tree t
= vaargs
? NULL_TREE
: void_list_node
;
8197 for (i
= n
- 1; i
>= 0; i
--)
8198 t
= tree_cons (NULL_TREE
, arg_types
[i
], t
);
8200 return build_function_type (return_type
, t
);
8203 /* Build a function type. RETURN_TYPE is the type returned by the
8204 function. The function takes N named arguments, the types of which
8205 are provided in ARG_TYPES. */
8208 build_function_type_array (tree return_type
, int n
, tree
*arg_types
)
8210 return build_function_type_array_1 (false, return_type
, n
, arg_types
);
8213 /* Build a variable argument function type. RETURN_TYPE is the type
8214 returned by the function. The function takes N named arguments, the
8215 types of which are provided in ARG_TYPES. */
8218 build_varargs_function_type_array (tree return_type
, int n
, tree
*arg_types
)
8220 return build_function_type_array_1 (true, return_type
, n
, arg_types
);
8223 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
8224 and ARGTYPES (a TREE_LIST) are the return type and arguments types
8225 for the method. An implicit additional parameter (of type
8226 pointer-to-BASETYPE) is added to the ARGTYPES. */
8229 build_method_type_directly (tree basetype
,
8235 inchash::hash hstate
;
8236 bool any_structural_p
, any_noncanonical_p
;
8237 tree canon_argtypes
;
8239 /* Make a node of the sort we want. */
8240 t
= make_node (METHOD_TYPE
);
8242 TYPE_METHOD_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
8243 TREE_TYPE (t
) = rettype
;
8244 ptype
= build_pointer_type (basetype
);
8246 /* The actual arglist for this function includes a "hidden" argument
8247 which is "this". Put it into the list of argument types. */
8248 argtypes
= tree_cons (NULL_TREE
, ptype
, argtypes
);
8249 TYPE_ARG_TYPES (t
) = argtypes
;
8251 /* If we already have such a type, use the old one. */
8252 hstate
.add_object (TYPE_HASH (basetype
));
8253 hstate
.add_object (TYPE_HASH (rettype
));
8254 type_hash_list (argtypes
, hstate
);
8255 t
= type_hash_canon (hstate
.end (), t
);
8257 /* Set up the canonical type. */
8259 = (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
8260 || TYPE_STRUCTURAL_EQUALITY_P (rettype
));
8262 = (TYPE_CANONICAL (basetype
) != basetype
8263 || TYPE_CANONICAL (rettype
) != rettype
);
8264 canon_argtypes
= maybe_canonicalize_argtypes (TREE_CHAIN (argtypes
),
8266 &any_noncanonical_p
);
8267 if (any_structural_p
)
8268 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8269 else if (any_noncanonical_p
)
8271 = build_method_type_directly (TYPE_CANONICAL (basetype
),
8272 TYPE_CANONICAL (rettype
),
8274 if (!COMPLETE_TYPE_P (t
))
8280 /* Construct, lay out and return the type of methods belonging to class
8281 BASETYPE and whose arguments and values are described by TYPE.
8282 If that type exists already, reuse it.
8283 TYPE must be a FUNCTION_TYPE node. */
8286 build_method_type (tree basetype
, tree type
)
8288 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
8290 return build_method_type_directly (basetype
,
8292 TYPE_ARG_TYPES (type
));
8295 /* Construct, lay out and return the type of offsets to a value
8296 of type TYPE, within an object of type BASETYPE.
8297 If a suitable offset type exists already, reuse it. */
8300 build_offset_type (tree basetype
, tree type
)
8303 inchash::hash hstate
;
8305 /* Make a node of the sort we want. */
8306 t
= make_node (OFFSET_TYPE
);
8308 TYPE_OFFSET_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
8309 TREE_TYPE (t
) = type
;
8311 /* If we already have such a type, use the old one. */
8312 hstate
.add_object (TYPE_HASH (basetype
));
8313 hstate
.add_object (TYPE_HASH (type
));
8314 t
= type_hash_canon (hstate
.end (), t
);
8316 if (!COMPLETE_TYPE_P (t
))
8319 if (TYPE_CANONICAL (t
) == t
)
8321 if (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
8322 || TYPE_STRUCTURAL_EQUALITY_P (type
))
8323 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8324 else if (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)) != basetype
8325 || TYPE_CANONICAL (type
) != type
)
8327 = build_offset_type (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)),
8328 TYPE_CANONICAL (type
));
8334 /* Create a complex type whose components are COMPONENT_TYPE. */
8337 build_complex_type (tree component_type
)
8340 inchash::hash hstate
;
8342 gcc_assert (INTEGRAL_TYPE_P (component_type
)
8343 || SCALAR_FLOAT_TYPE_P (component_type
)
8344 || FIXED_POINT_TYPE_P (component_type
));
8346 /* Make a node of the sort we want. */
8347 t
= make_node (COMPLEX_TYPE
);
8349 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (component_type
);
8351 /* If we already have such a type, use the old one. */
8352 hstate
.add_object (TYPE_HASH (component_type
));
8353 t
= type_hash_canon (hstate
.end (), t
);
8355 if (!COMPLETE_TYPE_P (t
))
8358 if (TYPE_CANONICAL (t
) == t
)
8360 if (TYPE_STRUCTURAL_EQUALITY_P (component_type
))
8361 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8362 else if (TYPE_CANONICAL (component_type
) != component_type
)
8364 = build_complex_type (TYPE_CANONICAL (component_type
));
8367 /* We need to create a name, since complex is a fundamental type. */
8368 if (! TYPE_NAME (t
))
8371 if (component_type
== char_type_node
)
8372 name
= "complex char";
8373 else if (component_type
== signed_char_type_node
)
8374 name
= "complex signed char";
8375 else if (component_type
== unsigned_char_type_node
)
8376 name
= "complex unsigned char";
8377 else if (component_type
== short_integer_type_node
)
8378 name
= "complex short int";
8379 else if (component_type
== short_unsigned_type_node
)
8380 name
= "complex short unsigned int";
8381 else if (component_type
== integer_type_node
)
8382 name
= "complex int";
8383 else if (component_type
== unsigned_type_node
)
8384 name
= "complex unsigned int";
8385 else if (component_type
== long_integer_type_node
)
8386 name
= "complex long int";
8387 else if (component_type
== long_unsigned_type_node
)
8388 name
= "complex long unsigned int";
8389 else if (component_type
== long_long_integer_type_node
)
8390 name
= "complex long long int";
8391 else if (component_type
== long_long_unsigned_type_node
)
8392 name
= "complex long long unsigned int";
8397 TYPE_NAME (t
) = build_decl (UNKNOWN_LOCATION
, TYPE_DECL
,
8398 get_identifier (name
), t
);
8401 return build_qualified_type (t
, TYPE_QUALS (component_type
));
8404 /* If TYPE is a real or complex floating-point type and the target
8405 does not directly support arithmetic on TYPE then return the wider
8406 type to be used for arithmetic on TYPE. Otherwise, return
8410 excess_precision_type (tree type
)
8412 if (flag_excess_precision
!= EXCESS_PRECISION_FAST
)
8414 int flt_eval_method
= TARGET_FLT_EVAL_METHOD
;
8415 switch (TREE_CODE (type
))
8418 switch (flt_eval_method
)
8421 if (TYPE_MODE (type
) == TYPE_MODE (float_type_node
))
8422 return double_type_node
;
8425 if (TYPE_MODE (type
) == TYPE_MODE (float_type_node
)
8426 || TYPE_MODE (type
) == TYPE_MODE (double_type_node
))
8427 return long_double_type_node
;
8434 if (TREE_CODE (TREE_TYPE (type
)) != REAL_TYPE
)
8436 switch (flt_eval_method
)
8439 if (TYPE_MODE (TREE_TYPE (type
)) == TYPE_MODE (float_type_node
))
8440 return complex_double_type_node
;
8443 if (TYPE_MODE (TREE_TYPE (type
)) == TYPE_MODE (float_type_node
)
8444 || (TYPE_MODE (TREE_TYPE (type
))
8445 == TYPE_MODE (double_type_node
)))
8446 return complex_long_double_type_node
;
8459 /* Return OP, stripped of any conversions to wider types as much as is safe.
8460 Converting the value back to OP's type makes a value equivalent to OP.
8462 If FOR_TYPE is nonzero, we return a value which, if converted to
8463 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
8465 OP must have integer, real or enumeral type. Pointers are not allowed!
8467 There are some cases where the obvious value we could return
8468 would regenerate to OP if converted to OP's type,
8469 but would not extend like OP to wider types.
8470 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
8471 For example, if OP is (unsigned short)(signed char)-1,
8472 we avoid returning (signed char)-1 if FOR_TYPE is int,
8473 even though extending that to an unsigned short would regenerate OP,
8474 since the result of extending (signed char)-1 to (int)
8475 is different from (int) OP. */
8478 get_unwidened (tree op
, tree for_type
)
8480 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
8481 tree type
= TREE_TYPE (op
);
8483 = TYPE_PRECISION (for_type
!= 0 ? for_type
: type
);
8485 = (for_type
!= 0 && for_type
!= type
8486 && final_prec
> TYPE_PRECISION (type
)
8487 && TYPE_UNSIGNED (type
));
8490 while (CONVERT_EXPR_P (op
))
8494 /* TYPE_PRECISION on vector types has different meaning
8495 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
8496 so avoid them here. */
8497 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op
, 0))) == VECTOR_TYPE
)
8500 bitschange
= TYPE_PRECISION (TREE_TYPE (op
))
8501 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0)));
8503 /* Truncations are many-one so cannot be removed.
8504 Unless we are later going to truncate down even farther. */
8506 && final_prec
> TYPE_PRECISION (TREE_TYPE (op
)))
8509 /* See what's inside this conversion. If we decide to strip it,
8511 op
= TREE_OPERAND (op
, 0);
8513 /* If we have not stripped any zero-extensions (uns is 0),
8514 we can strip any kind of extension.
8515 If we have previously stripped a zero-extension,
8516 only zero-extensions can safely be stripped.
8517 Any extension can be stripped if the bits it would produce
8518 are all going to be discarded later by truncating to FOR_TYPE. */
8522 if (! uns
|| final_prec
<= TYPE_PRECISION (TREE_TYPE (op
)))
8524 /* TYPE_UNSIGNED says whether this is a zero-extension.
8525 Let's avoid computing it if it does not affect WIN
8526 and if UNS will not be needed again. */
8528 || CONVERT_EXPR_P (op
))
8529 && TYPE_UNSIGNED (TREE_TYPE (op
)))
8537 /* If we finally reach a constant see if it fits in for_type and
8538 in that case convert it. */
8540 && TREE_CODE (win
) == INTEGER_CST
8541 && TREE_TYPE (win
) != for_type
8542 && int_fits_type_p (win
, for_type
))
8543 win
= fold_convert (for_type
, win
);
8548 /* Return OP or a simpler expression for a narrower value
8549 which can be sign-extended or zero-extended to give back OP.
8550 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
8551 or 0 if the value should be sign-extended. */
8554 get_narrower (tree op
, int *unsignedp_ptr
)
8559 bool integral_p
= INTEGRAL_TYPE_P (TREE_TYPE (op
));
8561 while (TREE_CODE (op
) == NOP_EXPR
)
8564 = (TYPE_PRECISION (TREE_TYPE (op
))
8565 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0))));
8567 /* Truncations are many-one so cannot be removed. */
8571 /* See what's inside this conversion. If we decide to strip it,
8576 op
= TREE_OPERAND (op
, 0);
8577 /* An extension: the outermost one can be stripped,
8578 but remember whether it is zero or sign extension. */
8580 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
8581 /* Otherwise, if a sign extension has been stripped,
8582 only sign extensions can now be stripped;
8583 if a zero extension has been stripped, only zero-extensions. */
8584 else if (uns
!= TYPE_UNSIGNED (TREE_TYPE (op
)))
8588 else /* bitschange == 0 */
8590 /* A change in nominal type can always be stripped, but we must
8591 preserve the unsignedness. */
8593 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
8595 op
= TREE_OPERAND (op
, 0);
8596 /* Keep trying to narrow, but don't assign op to win if it
8597 would turn an integral type into something else. */
8598 if (INTEGRAL_TYPE_P (TREE_TYPE (op
)) != integral_p
)
8605 if (TREE_CODE (op
) == COMPONENT_REF
8606 /* Since type_for_size always gives an integer type. */
8607 && TREE_CODE (TREE_TYPE (op
)) != REAL_TYPE
8608 && TREE_CODE (TREE_TYPE (op
)) != FIXED_POINT_TYPE
8609 /* Ensure field is laid out already. */
8610 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0
8611 && tree_fits_uhwi_p (DECL_SIZE (TREE_OPERAND (op
, 1))))
8613 unsigned HOST_WIDE_INT innerprec
8614 = tree_to_uhwi (DECL_SIZE (TREE_OPERAND (op
, 1)));
8615 int unsignedp
= (DECL_UNSIGNED (TREE_OPERAND (op
, 1))
8616 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op
, 1))));
8617 tree type
= lang_hooks
.types
.type_for_size (innerprec
, unsignedp
);
8619 /* We can get this structure field in a narrower type that fits it,
8620 but the resulting extension to its nominal type (a fullword type)
8621 must satisfy the same conditions as for other extensions.
8623 Do this only for fields that are aligned (not bit-fields),
8624 because when bit-field insns will be used there is no
8625 advantage in doing this. */
8627 if (innerprec
< TYPE_PRECISION (TREE_TYPE (op
))
8628 && ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1))
8629 && (first
|| uns
== DECL_UNSIGNED (TREE_OPERAND (op
, 1)))
8633 uns
= DECL_UNSIGNED (TREE_OPERAND (op
, 1));
8634 win
= fold_convert (type
, op
);
8638 *unsignedp_ptr
= uns
;
8642 /* Returns true if integer constant C has a value that is permissible
8643 for type TYPE (an INTEGER_TYPE). */
8646 int_fits_type_p (const_tree c
, const_tree type
)
8648 tree type_low_bound
, type_high_bound
;
8649 bool ok_for_low_bound
, ok_for_high_bound
;
8650 signop sgn_c
= TYPE_SIGN (TREE_TYPE (c
));
8653 type_low_bound
= TYPE_MIN_VALUE (type
);
8654 type_high_bound
= TYPE_MAX_VALUE (type
);
8656 /* If at least one bound of the type is a constant integer, we can check
8657 ourselves and maybe make a decision. If no such decision is possible, but
8658 this type is a subtype, try checking against that. Otherwise, use
8659 fits_to_tree_p, which checks against the precision.
8661 Compute the status for each possibly constant bound, and return if we see
8662 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
8663 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
8664 for "constant known to fit". */
8666 /* Check if c >= type_low_bound. */
8667 if (type_low_bound
&& TREE_CODE (type_low_bound
) == INTEGER_CST
)
8669 if (tree_int_cst_lt (c
, type_low_bound
))
8671 ok_for_low_bound
= true;
8674 ok_for_low_bound
= false;
8676 /* Check if c <= type_high_bound. */
8677 if (type_high_bound
&& TREE_CODE (type_high_bound
) == INTEGER_CST
)
8679 if (tree_int_cst_lt (type_high_bound
, c
))
8681 ok_for_high_bound
= true;
8684 ok_for_high_bound
= false;
8686 /* If the constant fits both bounds, the result is known. */
8687 if (ok_for_low_bound
&& ok_for_high_bound
)
8690 /* Perform some generic filtering which may allow making a decision
8691 even if the bounds are not constant. First, negative integers
8692 never fit in unsigned types, */
8693 if (TYPE_UNSIGNED (type
) && sgn_c
== SIGNED
&& wi::neg_p (c
))
8696 /* Second, narrower types always fit in wider ones. */
8697 if (TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (c
)))
8700 /* Third, unsigned integers with top bit set never fit signed types. */
8701 if (!TYPE_UNSIGNED (type
) && sgn_c
== UNSIGNED
)
8703 int prec
= GET_MODE_PRECISION (TYPE_MODE (TREE_TYPE (c
))) - 1;
8704 if (prec
< TYPE_PRECISION (TREE_TYPE (c
)))
8706 /* When a tree_cst is converted to a wide-int, the precision
8707 is taken from the type. However, if the precision of the
8708 mode underneath the type is smaller than that, it is
8709 possible that the value will not fit. The test below
8710 fails if any bit is set between the sign bit of the
8711 underlying mode and the top bit of the type. */
8712 if (wi::ne_p (wi::zext (c
, prec
- 1), c
))
8715 else if (wi::neg_p (c
))
8719 /* If we haven't been able to decide at this point, there nothing more we
8720 can check ourselves here. Look at the base type if we have one and it
8721 has the same precision. */
8722 if (TREE_CODE (type
) == INTEGER_TYPE
8723 && TREE_TYPE (type
) != 0
8724 && TYPE_PRECISION (type
) == TYPE_PRECISION (TREE_TYPE (type
)))
8726 type
= TREE_TYPE (type
);
8730 /* Or to fits_to_tree_p, if nothing else. */
8731 return wi::fits_to_tree_p (c
, type
);
8734 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
8735 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
8736 represented (assuming two's-complement arithmetic) within the bit
8737 precision of the type are returned instead. */
8740 get_type_static_bounds (const_tree type
, mpz_t min
, mpz_t max
)
8742 if (!POINTER_TYPE_P (type
) && TYPE_MIN_VALUE (type
)
8743 && TREE_CODE (TYPE_MIN_VALUE (type
)) == INTEGER_CST
)
8744 wi::to_mpz (TYPE_MIN_VALUE (type
), min
, TYPE_SIGN (type
));
8747 if (TYPE_UNSIGNED (type
))
8748 mpz_set_ui (min
, 0);
8751 wide_int mn
= wi::min_value (TYPE_PRECISION (type
), SIGNED
);
8752 wi::to_mpz (mn
, min
, SIGNED
);
8756 if (!POINTER_TYPE_P (type
) && TYPE_MAX_VALUE (type
)
8757 && TREE_CODE (TYPE_MAX_VALUE (type
)) == INTEGER_CST
)
8758 wi::to_mpz (TYPE_MAX_VALUE (type
), max
, TYPE_SIGN (type
));
8761 wide_int mn
= wi::max_value (TYPE_PRECISION (type
), TYPE_SIGN (type
));
8762 wi::to_mpz (mn
, max
, TYPE_SIGN (type
));
8766 /* Return true if VAR is an automatic variable defined in function FN. */
8769 auto_var_in_fn_p (const_tree var
, const_tree fn
)
8771 return (DECL_P (var
) && DECL_CONTEXT (var
) == fn
8772 && ((((TREE_CODE (var
) == VAR_DECL
&& ! DECL_EXTERNAL (var
))
8773 || TREE_CODE (var
) == PARM_DECL
)
8774 && ! TREE_STATIC (var
))
8775 || TREE_CODE (var
) == LABEL_DECL
8776 || TREE_CODE (var
) == RESULT_DECL
));
8779 /* Subprogram of following function. Called by walk_tree.
8781 Return *TP if it is an automatic variable or parameter of the
8782 function passed in as DATA. */
8785 find_var_from_fn (tree
*tp
, int *walk_subtrees
, void *data
)
8787 tree fn
= (tree
) data
;
8792 else if (DECL_P (*tp
)
8793 && auto_var_in_fn_p (*tp
, fn
))
8799 /* Returns true if T is, contains, or refers to a type with variable
8800 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
8801 arguments, but not the return type. If FN is nonzero, only return
8802 true if a modifier of the type or position of FN is a variable or
8803 parameter inside FN.
8805 This concept is more general than that of C99 'variably modified types':
8806 in C99, a struct type is never variably modified because a VLA may not
8807 appear as a structure member. However, in GNU C code like:
8809 struct S { int i[f()]; };
8811 is valid, and other languages may define similar constructs. */
8814 variably_modified_type_p (tree type
, tree fn
)
8818 /* Test if T is either variable (if FN is zero) or an expression containing
8819 a variable in FN. If TYPE isn't gimplified, return true also if
8820 gimplify_one_sizepos would gimplify the expression into a local
8822 #define RETURN_TRUE_IF_VAR(T) \
8823 do { tree _t = (T); \
8824 if (_t != NULL_TREE \
8825 && _t != error_mark_node \
8826 && TREE_CODE (_t) != INTEGER_CST \
8827 && TREE_CODE (_t) != PLACEHOLDER_EXPR \
8829 || (!TYPE_SIZES_GIMPLIFIED (type) \
8830 && !is_gimple_sizepos (_t)) \
8831 || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
8832 return true; } while (0)
8834 if (type
== error_mark_node
)
8837 /* If TYPE itself has variable size, it is variably modified. */
8838 RETURN_TRUE_IF_VAR (TYPE_SIZE (type
));
8839 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type
));
8841 switch (TREE_CODE (type
))
8844 case REFERENCE_TYPE
:
8846 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
8852 /* If TYPE is a function type, it is variably modified if the
8853 return type is variably modified. */
8854 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
8860 case FIXED_POINT_TYPE
:
8863 /* Scalar types are variably modified if their end points
8865 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type
));
8866 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type
));
8871 case QUAL_UNION_TYPE
:
8872 /* We can't see if any of the fields are variably-modified by the
8873 definition we normally use, since that would produce infinite
8874 recursion via pointers. */
8875 /* This is variably modified if some field's type is. */
8876 for (t
= TYPE_FIELDS (type
); t
; t
= DECL_CHAIN (t
))
8877 if (TREE_CODE (t
) == FIELD_DECL
)
8879 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t
));
8880 RETURN_TRUE_IF_VAR (DECL_SIZE (t
));
8881 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t
));
8883 if (TREE_CODE (type
) == QUAL_UNION_TYPE
)
8884 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t
));
8889 /* Do not call ourselves to avoid infinite recursion. This is
8890 variably modified if the element type is. */
8891 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type
)));
8892 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type
)));
8899 /* The current language may have other cases to check, but in general,
8900 all other types are not variably modified. */
8901 return lang_hooks
.tree_inlining
.var_mod_type_p (type
, fn
);
8903 #undef RETURN_TRUE_IF_VAR
8906 /* Given a DECL or TYPE, return the scope in which it was declared, or
8907 NULL_TREE if there is no containing scope. */
8910 get_containing_scope (const_tree t
)
8912 return (TYPE_P (t
) ? TYPE_CONTEXT (t
) : DECL_CONTEXT (t
));
8915 /* Return the innermost context enclosing DECL that is
8916 a FUNCTION_DECL, or zero if none. */
8919 decl_function_context (const_tree decl
)
8923 if (TREE_CODE (decl
) == ERROR_MARK
)
8926 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
8927 where we look up the function at runtime. Such functions always take
8928 a first argument of type 'pointer to real context'.
8930 C++ should really be fixed to use DECL_CONTEXT for the real context,
8931 and use something else for the "virtual context". */
8932 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VINDEX (decl
))
8935 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl
)))));
8937 context
= DECL_CONTEXT (decl
);
8939 while (context
&& TREE_CODE (context
) != FUNCTION_DECL
)
8941 if (TREE_CODE (context
) == BLOCK
)
8942 context
= BLOCK_SUPERCONTEXT (context
);
8944 context
= get_containing_scope (context
);
8950 /* Return the innermost context enclosing DECL that is
8951 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
8952 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
8955 decl_type_context (const_tree decl
)
8957 tree context
= DECL_CONTEXT (decl
);
8960 switch (TREE_CODE (context
))
8962 case NAMESPACE_DECL
:
8963 case TRANSLATION_UNIT_DECL
:
8968 case QUAL_UNION_TYPE
:
8973 context
= DECL_CONTEXT (context
);
8977 context
= BLOCK_SUPERCONTEXT (context
);
8987 /* CALL is a CALL_EXPR. Return the declaration for the function
8988 called, or NULL_TREE if the called function cannot be
8992 get_callee_fndecl (const_tree call
)
8996 if (call
== error_mark_node
)
8997 return error_mark_node
;
8999 /* It's invalid to call this function with anything but a
9001 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
9003 /* The first operand to the CALL is the address of the function
9005 addr
= CALL_EXPR_FN (call
);
9007 /* If there is no function, return early. */
9008 if (addr
== NULL_TREE
)
9013 /* If this is a readonly function pointer, extract its initial value. */
9014 if (DECL_P (addr
) && TREE_CODE (addr
) != FUNCTION_DECL
9015 && TREE_READONLY (addr
) && ! TREE_THIS_VOLATILE (addr
)
9016 && DECL_INITIAL (addr
))
9017 addr
= DECL_INITIAL (addr
);
9019 /* If the address is just `&f' for some function `f', then we know
9020 that `f' is being called. */
9021 if (TREE_CODE (addr
) == ADDR_EXPR
9022 && TREE_CODE (TREE_OPERAND (addr
, 0)) == FUNCTION_DECL
)
9023 return TREE_OPERAND (addr
, 0);
9025 /* We couldn't figure out what was being called. */
9029 /* Print debugging information about tree nodes generated during the compile,
9030 and any language-specific information. */
9033 dump_tree_statistics (void)
9035 if (GATHER_STATISTICS
)
9038 int total_nodes
, total_bytes
;
9039 fprintf (stderr
, "Kind Nodes Bytes\n");
9040 fprintf (stderr
, "---------------------------------------\n");
9041 total_nodes
= total_bytes
= 0;
9042 for (i
= 0; i
< (int) all_kinds
; i
++)
9044 fprintf (stderr
, "%-20s %7d %10d\n", tree_node_kind_names
[i
],
9045 tree_node_counts
[i
], tree_node_sizes
[i
]);
9046 total_nodes
+= tree_node_counts
[i
];
9047 total_bytes
+= tree_node_sizes
[i
];
9049 fprintf (stderr
, "---------------------------------------\n");
9050 fprintf (stderr
, "%-20s %7d %10d\n", "Total", total_nodes
, total_bytes
);
9051 fprintf (stderr
, "---------------------------------------\n");
9052 fprintf (stderr
, "Code Nodes\n");
9053 fprintf (stderr
, "----------------------------\n");
9054 for (i
= 0; i
< (int) MAX_TREE_CODES
; i
++)
9055 fprintf (stderr
, "%-20s %7d\n", get_tree_code_name ((enum tree_code
) i
),
9056 tree_code_counts
[i
]);
9057 fprintf (stderr
, "----------------------------\n");
9058 ssanames_print_statistics ();
9059 phinodes_print_statistics ();
9062 fprintf (stderr
, "(No per-node statistics)\n");
9064 print_type_hash_statistics ();
9065 print_debug_expr_statistics ();
9066 print_value_expr_statistics ();
9067 lang_hooks
.print_statistics ();
9070 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
9072 /* Generate a crc32 of a byte. */
9075 crc32_unsigned_bits (unsigned chksum
, unsigned value
, unsigned bits
)
9079 for (ix
= bits
; ix
--; value
<<= 1)
9083 feedback
= (value
^ chksum
) & 0x80000000 ? 0x04c11db7 : 0;
9090 /* Generate a crc32 of a 32-bit unsigned. */
9093 crc32_unsigned (unsigned chksum
, unsigned value
)
9095 return crc32_unsigned_bits (chksum
, value
, 32);
9098 /* Generate a crc32 of a byte. */
9101 crc32_byte (unsigned chksum
, char byte
)
9103 return crc32_unsigned_bits (chksum
, (unsigned) byte
<< 24, 8);
9106 /* Generate a crc32 of a string. */
9109 crc32_string (unsigned chksum
, const char *string
)
9113 chksum
= crc32_byte (chksum
, *string
);
9119 /* P is a string that will be used in a symbol. Mask out any characters
9120 that are not valid in that context. */
9123 clean_symbol_name (char *p
)
9127 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
9130 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
9137 /* Generate a name for a special-purpose function.
9138 The generated name may need to be unique across the whole link.
9139 Changes to this function may also require corresponding changes to
9140 xstrdup_mask_random.
9141 TYPE is some string to identify the purpose of this function to the
9142 linker or collect2; it must start with an uppercase letter,
9144 I - for constructors
9146 N - for C++ anonymous namespaces
9147 F - for DWARF unwind frame information. */
9150 get_file_function_name (const char *type
)
9156 /* If we already have a name we know to be unique, just use that. */
9157 if (first_global_object_name
)
9158 p
= q
= ASTRDUP (first_global_object_name
);
9159 /* If the target is handling the constructors/destructors, they
9160 will be local to this file and the name is only necessary for
9162 We also assign sub_I and sub_D sufixes to constructors called from
9163 the global static constructors. These are always local. */
9164 else if (((type
[0] == 'I' || type
[0] == 'D') && targetm
.have_ctors_dtors
)
9165 || (strncmp (type
, "sub_", 4) == 0
9166 && (type
[4] == 'I' || type
[4] == 'D')))
9168 const char *file
= main_input_filename
;
9170 file
= LOCATION_FILE (input_location
);
9171 /* Just use the file's basename, because the full pathname
9172 might be quite long. */
9173 p
= q
= ASTRDUP (lbasename (file
));
9177 /* Otherwise, the name must be unique across the entire link.
9178 We don't have anything that we know to be unique to this translation
9179 unit, so use what we do have and throw in some randomness. */
9181 const char *name
= weak_global_object_name
;
9182 const char *file
= main_input_filename
;
9187 file
= LOCATION_FILE (input_location
);
9189 len
= strlen (file
);
9190 q
= (char *) alloca (9 + 17 + len
+ 1);
9191 memcpy (q
, file
, len
+ 1);
9193 snprintf (q
+ len
, 9 + 17 + 1, "_%08X_" HOST_WIDE_INT_PRINT_HEX
,
9194 crc32_string (0, name
), get_random_seed (false));
9199 clean_symbol_name (q
);
9200 buf
= (char *) alloca (sizeof (FILE_FUNCTION_FORMAT
) + strlen (p
)
9203 /* Set up the name of the file-level functions we may need.
9204 Use a global object (which is already required to be unique over
9205 the program) rather than the file name (which imposes extra
9207 sprintf (buf
, FILE_FUNCTION_FORMAT
, type
, p
);
9209 return get_identifier (buf
);
9212 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
9214 /* Complain that the tree code of NODE does not match the expected 0
9215 terminated list of trailing codes. The trailing code list can be
9216 empty, for a more vague error message. FILE, LINE, and FUNCTION
9217 are of the caller. */
9220 tree_check_failed (const_tree node
, const char *file
,
9221 int line
, const char *function
, ...)
9225 unsigned length
= 0;
9226 enum tree_code code
;
9228 va_start (args
, function
);
9229 while ((code
= (enum tree_code
) va_arg (args
, int)))
9230 length
+= 4 + strlen (get_tree_code_name (code
));
9235 va_start (args
, function
);
9236 length
+= strlen ("expected ");
9237 buffer
= tmp
= (char *) alloca (length
);
9239 while ((code
= (enum tree_code
) va_arg (args
, int)))
9241 const char *prefix
= length
? " or " : "expected ";
9243 strcpy (tmp
+ length
, prefix
);
9244 length
+= strlen (prefix
);
9245 strcpy (tmp
+ length
, get_tree_code_name (code
));
9246 length
+= strlen (get_tree_code_name (code
));
9251 buffer
= "unexpected node";
9253 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9254 buffer
, get_tree_code_name (TREE_CODE (node
)),
9255 function
, trim_filename (file
), line
);
9258 /* Complain that the tree code of NODE does match the expected 0
9259 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
9263 tree_not_check_failed (const_tree node
, const char *file
,
9264 int line
, const char *function
, ...)
9268 unsigned length
= 0;
9269 enum tree_code code
;
9271 va_start (args
, function
);
9272 while ((code
= (enum tree_code
) va_arg (args
, int)))
9273 length
+= 4 + strlen (get_tree_code_name (code
));
9275 va_start (args
, function
);
9276 buffer
= (char *) alloca (length
);
9278 while ((code
= (enum tree_code
) va_arg (args
, int)))
9282 strcpy (buffer
+ length
, " or ");
9285 strcpy (buffer
+ length
, get_tree_code_name (code
));
9286 length
+= strlen (get_tree_code_name (code
));
9290 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
9291 buffer
, get_tree_code_name (TREE_CODE (node
)),
9292 function
, trim_filename (file
), line
);
9295 /* Similar to tree_check_failed, except that we check for a class of tree
9296 code, given in CL. */
9299 tree_class_check_failed (const_tree node
, const enum tree_code_class cl
,
9300 const char *file
, int line
, const char *function
)
9303 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
9304 TREE_CODE_CLASS_STRING (cl
),
9305 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
9306 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9309 /* Similar to tree_check_failed, except that instead of specifying a
9310 dozen codes, use the knowledge that they're all sequential. */
9313 tree_range_check_failed (const_tree node
, const char *file
, int line
,
9314 const char *function
, enum tree_code c1
,
9318 unsigned length
= 0;
9321 for (c
= c1
; c
<= c2
; ++c
)
9322 length
+= 4 + strlen (get_tree_code_name ((enum tree_code
) c
));
9324 length
+= strlen ("expected ");
9325 buffer
= (char *) alloca (length
);
9328 for (c
= c1
; c
<= c2
; ++c
)
9330 const char *prefix
= length
? " or " : "expected ";
9332 strcpy (buffer
+ length
, prefix
);
9333 length
+= strlen (prefix
);
9334 strcpy (buffer
+ length
, get_tree_code_name ((enum tree_code
) c
));
9335 length
+= strlen (get_tree_code_name ((enum tree_code
) c
));
9338 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9339 buffer
, get_tree_code_name (TREE_CODE (node
)),
9340 function
, trim_filename (file
), line
);
9344 /* Similar to tree_check_failed, except that we check that a tree does
9345 not have the specified code, given in CL. */
9348 tree_not_class_check_failed (const_tree node
, const enum tree_code_class cl
,
9349 const char *file
, int line
, const char *function
)
9352 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
9353 TREE_CODE_CLASS_STRING (cl
),
9354 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
9355 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9359 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
9362 omp_clause_check_failed (const_tree node
, const char *file
, int line
,
9363 const char *function
, enum omp_clause_code code
)
9365 internal_error ("tree check: expected omp_clause %s, have %s in %s, at %s:%d",
9366 omp_clause_code_name
[code
], get_tree_code_name (TREE_CODE (node
)),
9367 function
, trim_filename (file
), line
);
9371 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
9374 omp_clause_range_check_failed (const_tree node
, const char *file
, int line
,
9375 const char *function
, enum omp_clause_code c1
,
9376 enum omp_clause_code c2
)
9379 unsigned length
= 0;
9382 for (c
= c1
; c
<= c2
; ++c
)
9383 length
+= 4 + strlen (omp_clause_code_name
[c
]);
9385 length
+= strlen ("expected ");
9386 buffer
= (char *) alloca (length
);
9389 for (c
= c1
; c
<= c2
; ++c
)
9391 const char *prefix
= length
? " or " : "expected ";
9393 strcpy (buffer
+ length
, prefix
);
9394 length
+= strlen (prefix
);
9395 strcpy (buffer
+ length
, omp_clause_code_name
[c
]);
9396 length
+= strlen (omp_clause_code_name
[c
]);
9399 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9400 buffer
, omp_clause_code_name
[TREE_CODE (node
)],
9401 function
, trim_filename (file
), line
);
9405 #undef DEFTREESTRUCT
9406 #define DEFTREESTRUCT(VAL, NAME) NAME,
9408 static const char *ts_enum_names
[] = {
9409 #include "treestruct.def"
9411 #undef DEFTREESTRUCT
9413 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
9415 /* Similar to tree_class_check_failed, except that we check for
9416 whether CODE contains the tree structure identified by EN. */
9419 tree_contains_struct_check_failed (const_tree node
,
9420 const enum tree_node_structure_enum en
,
9421 const char *file
, int line
,
9422 const char *function
)
9425 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
9427 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9431 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9432 (dynamically sized) vector. */
9435 tree_int_cst_elt_check_failed (int idx
, int len
, const char *file
, int line
,
9436 const char *function
)
9439 ("tree check: accessed elt %d of tree_int_cst with %d elts in %s, at %s:%d",
9440 idx
+ 1, len
, function
, trim_filename (file
), line
);
9443 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9444 (dynamically sized) vector. */
9447 tree_vec_elt_check_failed (int idx
, int len
, const char *file
, int line
,
9448 const char *function
)
9451 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
9452 idx
+ 1, len
, function
, trim_filename (file
), line
);
9455 /* Similar to above, except that the check is for the bounds of the operand
9456 vector of an expression node EXP. */
9459 tree_operand_check_failed (int idx
, const_tree exp
, const char *file
,
9460 int line
, const char *function
)
9462 enum tree_code code
= TREE_CODE (exp
);
9464 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
9465 idx
+ 1, get_tree_code_name (code
), TREE_OPERAND_LENGTH (exp
),
9466 function
, trim_filename (file
), line
);
9469 /* Similar to above, except that the check is for the number of
9470 operands of an OMP_CLAUSE node. */
9473 omp_clause_operand_check_failed (int idx
, const_tree t
, const char *file
,
9474 int line
, const char *function
)
9477 ("tree check: accessed operand %d of omp_clause %s with %d operands "
9478 "in %s, at %s:%d", idx
+ 1, omp_clause_code_name
[OMP_CLAUSE_CODE (t
)],
9479 omp_clause_num_ops
[OMP_CLAUSE_CODE (t
)], function
,
9480 trim_filename (file
), line
);
9482 #endif /* ENABLE_TREE_CHECKING */
9484 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
9485 and mapped to the machine mode MODE. Initialize its fields and build
9486 the information necessary for debugging output. */
9489 make_vector_type (tree innertype
, int nunits
, machine_mode mode
)
9492 inchash::hash hstate
;
9494 t
= make_node (VECTOR_TYPE
);
9495 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (innertype
);
9496 SET_TYPE_VECTOR_SUBPARTS (t
, nunits
);
9497 SET_TYPE_MODE (t
, mode
);
9499 if (TYPE_STRUCTURAL_EQUALITY_P (innertype
))
9500 SET_TYPE_STRUCTURAL_EQUALITY (t
);
9501 else if (TYPE_CANONICAL (innertype
) != innertype
9502 || mode
!= VOIDmode
)
9504 = make_vector_type (TYPE_CANONICAL (innertype
), nunits
, VOIDmode
);
9508 hstate
.add_wide_int (VECTOR_TYPE
);
9509 hstate
.add_wide_int (nunits
);
9510 hstate
.add_wide_int (mode
);
9511 hstate
.add_object (TYPE_HASH (TREE_TYPE (t
)));
9512 t
= type_hash_canon (hstate
.end (), t
);
9514 /* We have built a main variant, based on the main variant of the
9515 inner type. Use it to build the variant we return. */
9516 if ((TYPE_ATTRIBUTES (innertype
) || TYPE_QUALS (innertype
))
9517 && TREE_TYPE (t
) != innertype
)
9518 return build_type_attribute_qual_variant (t
,
9519 TYPE_ATTRIBUTES (innertype
),
9520 TYPE_QUALS (innertype
));
9526 make_or_reuse_type (unsigned size
, int unsignedp
)
9530 if (size
== INT_TYPE_SIZE
)
9531 return unsignedp
? unsigned_type_node
: integer_type_node
;
9532 if (size
== CHAR_TYPE_SIZE
)
9533 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
9534 if (size
== SHORT_TYPE_SIZE
)
9535 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
9536 if (size
== LONG_TYPE_SIZE
)
9537 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
9538 if (size
== LONG_LONG_TYPE_SIZE
)
9539 return (unsignedp
? long_long_unsigned_type_node
9540 : long_long_integer_type_node
);
9542 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
9543 if (size
== int_n_data
[i
].bitsize
9544 && int_n_enabled_p
[i
])
9545 return (unsignedp
? int_n_trees
[i
].unsigned_type
9546 : int_n_trees
[i
].signed_type
);
9549 return make_unsigned_type (size
);
9551 return make_signed_type (size
);
9554 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
9557 make_or_reuse_fract_type (unsigned size
, int unsignedp
, int satp
)
9561 if (size
== SHORT_FRACT_TYPE_SIZE
)
9562 return unsignedp
? sat_unsigned_short_fract_type_node
9563 : sat_short_fract_type_node
;
9564 if (size
== FRACT_TYPE_SIZE
)
9565 return unsignedp
? sat_unsigned_fract_type_node
: sat_fract_type_node
;
9566 if (size
== LONG_FRACT_TYPE_SIZE
)
9567 return unsignedp
? sat_unsigned_long_fract_type_node
9568 : sat_long_fract_type_node
;
9569 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
9570 return unsignedp
? sat_unsigned_long_long_fract_type_node
9571 : sat_long_long_fract_type_node
;
9575 if (size
== SHORT_FRACT_TYPE_SIZE
)
9576 return unsignedp
? unsigned_short_fract_type_node
9577 : short_fract_type_node
;
9578 if (size
== FRACT_TYPE_SIZE
)
9579 return unsignedp
? unsigned_fract_type_node
: fract_type_node
;
9580 if (size
== LONG_FRACT_TYPE_SIZE
)
9581 return unsignedp
? unsigned_long_fract_type_node
9582 : long_fract_type_node
;
9583 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
9584 return unsignedp
? unsigned_long_long_fract_type_node
9585 : long_long_fract_type_node
;
9588 return make_fract_type (size
, unsignedp
, satp
);
9591 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
9594 make_or_reuse_accum_type (unsigned size
, int unsignedp
, int satp
)
9598 if (size
== SHORT_ACCUM_TYPE_SIZE
)
9599 return unsignedp
? sat_unsigned_short_accum_type_node
9600 : sat_short_accum_type_node
;
9601 if (size
== ACCUM_TYPE_SIZE
)
9602 return unsignedp
? sat_unsigned_accum_type_node
: sat_accum_type_node
;
9603 if (size
== LONG_ACCUM_TYPE_SIZE
)
9604 return unsignedp
? sat_unsigned_long_accum_type_node
9605 : sat_long_accum_type_node
;
9606 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
9607 return unsignedp
? sat_unsigned_long_long_accum_type_node
9608 : sat_long_long_accum_type_node
;
9612 if (size
== SHORT_ACCUM_TYPE_SIZE
)
9613 return unsignedp
? unsigned_short_accum_type_node
9614 : short_accum_type_node
;
9615 if (size
== ACCUM_TYPE_SIZE
)
9616 return unsignedp
? unsigned_accum_type_node
: accum_type_node
;
9617 if (size
== LONG_ACCUM_TYPE_SIZE
)
9618 return unsignedp
? unsigned_long_accum_type_node
9619 : long_accum_type_node
;
9620 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
9621 return unsignedp
? unsigned_long_long_accum_type_node
9622 : long_long_accum_type_node
;
9625 return make_accum_type (size
, unsignedp
, satp
);
9629 /* Create an atomic variant node for TYPE. This routine is called
9630 during initialization of data types to create the 5 basic atomic
9631 types. The generic build_variant_type function requires these to
9632 already be set up in order to function properly, so cannot be
9633 called from there. If ALIGN is non-zero, then ensure alignment is
9634 overridden to this value. */
9637 build_atomic_base (tree type
, unsigned int align
)
9641 /* Make sure its not already registered. */
9642 if ((t
= get_qualified_type (type
, TYPE_QUAL_ATOMIC
)))
9645 t
= build_variant_type_copy (type
);
9646 set_type_quals (t
, TYPE_QUAL_ATOMIC
);
9649 TYPE_ALIGN (t
) = align
;
9654 /* Create nodes for all integer types (and error_mark_node) using the sizes
9655 of C datatypes. SIGNED_CHAR specifies whether char is signed,
9656 SHORT_DOUBLE specifies whether double should be of the same precision
9660 build_common_tree_nodes (bool signed_char
, bool short_double
)
9664 error_mark_node
= make_node (ERROR_MARK
);
9665 TREE_TYPE (error_mark_node
) = error_mark_node
;
9667 initialize_sizetypes ();
9669 /* Define both `signed char' and `unsigned char'. */
9670 signed_char_type_node
= make_signed_type (CHAR_TYPE_SIZE
);
9671 TYPE_STRING_FLAG (signed_char_type_node
) = 1;
9672 unsigned_char_type_node
= make_unsigned_type (CHAR_TYPE_SIZE
);
9673 TYPE_STRING_FLAG (unsigned_char_type_node
) = 1;
9675 /* Define `char', which is like either `signed char' or `unsigned char'
9676 but not the same as either. */
9679 ? make_signed_type (CHAR_TYPE_SIZE
)
9680 : make_unsigned_type (CHAR_TYPE_SIZE
));
9681 TYPE_STRING_FLAG (char_type_node
) = 1;
9683 short_integer_type_node
= make_signed_type (SHORT_TYPE_SIZE
);
9684 short_unsigned_type_node
= make_unsigned_type (SHORT_TYPE_SIZE
);
9685 integer_type_node
= make_signed_type (INT_TYPE_SIZE
);
9686 unsigned_type_node
= make_unsigned_type (INT_TYPE_SIZE
);
9687 long_integer_type_node
= make_signed_type (LONG_TYPE_SIZE
);
9688 long_unsigned_type_node
= make_unsigned_type (LONG_TYPE_SIZE
);
9689 long_long_integer_type_node
= make_signed_type (LONG_LONG_TYPE_SIZE
);
9690 long_long_unsigned_type_node
= make_unsigned_type (LONG_LONG_TYPE_SIZE
);
9692 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
9694 int_n_trees
[i
].signed_type
= make_signed_type (int_n_data
[i
].bitsize
);
9695 int_n_trees
[i
].unsigned_type
= make_unsigned_type (int_n_data
[i
].bitsize
);
9696 TYPE_SIZE (int_n_trees
[i
].signed_type
) = bitsize_int (int_n_data
[i
].bitsize
);
9697 TYPE_SIZE (int_n_trees
[i
].unsigned_type
) = bitsize_int (int_n_data
[i
].bitsize
);
9699 if (int_n_data
[i
].bitsize
> LONG_LONG_TYPE_SIZE
9700 && int_n_enabled_p
[i
])
9702 integer_types
[itk_intN_0
+ i
* 2] = int_n_trees
[i
].signed_type
;
9703 integer_types
[itk_unsigned_intN_0
+ i
* 2] = int_n_trees
[i
].unsigned_type
;
9707 /* Define a boolean type. This type only represents boolean values but
9708 may be larger than char depending on the value of BOOL_TYPE_SIZE. */
9709 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
9710 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
9711 TYPE_PRECISION (boolean_type_node
) = 1;
9712 TYPE_MAX_VALUE (boolean_type_node
) = build_int_cst (boolean_type_node
, 1);
9714 /* Define what type to use for size_t. */
9715 if (strcmp (SIZE_TYPE
, "unsigned int") == 0)
9716 size_type_node
= unsigned_type_node
;
9717 else if (strcmp (SIZE_TYPE
, "long unsigned int") == 0)
9718 size_type_node
= long_unsigned_type_node
;
9719 else if (strcmp (SIZE_TYPE
, "long long unsigned int") == 0)
9720 size_type_node
= long_long_unsigned_type_node
;
9721 else if (strcmp (SIZE_TYPE
, "short unsigned int") == 0)
9722 size_type_node
= short_unsigned_type_node
;
9727 size_type_node
= NULL_TREE
;
9728 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
9729 if (int_n_enabled_p
[i
])
9732 sprintf (name
, "__int%d unsigned", int_n_data
[i
].bitsize
);
9734 if (strcmp (name
, SIZE_TYPE
) == 0)
9736 size_type_node
= int_n_trees
[i
].unsigned_type
;
9739 if (size_type_node
== NULL_TREE
)
9743 /* Fill in the rest of the sized types. Reuse existing type nodes
9745 intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 0);
9746 intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 0);
9747 intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 0);
9748 intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 0);
9749 intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 0);
9751 unsigned_intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 1);
9752 unsigned_intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 1);
9753 unsigned_intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 1);
9754 unsigned_intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 1);
9755 unsigned_intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 1);
9757 /* Don't call build_qualified type for atomics. That routine does
9758 special processing for atomics, and until they are initialized
9759 it's better not to make that call.
9761 Check to see if there is a target override for atomic types. */
9763 atomicQI_type_node
= build_atomic_base (unsigned_intQI_type_node
,
9764 targetm
.atomic_align_for_mode (QImode
));
9765 atomicHI_type_node
= build_atomic_base (unsigned_intHI_type_node
,
9766 targetm
.atomic_align_for_mode (HImode
));
9767 atomicSI_type_node
= build_atomic_base (unsigned_intSI_type_node
,
9768 targetm
.atomic_align_for_mode (SImode
));
9769 atomicDI_type_node
= build_atomic_base (unsigned_intDI_type_node
,
9770 targetm
.atomic_align_for_mode (DImode
));
9771 atomicTI_type_node
= build_atomic_base (unsigned_intTI_type_node
,
9772 targetm
.atomic_align_for_mode (TImode
));
9774 access_public_node
= get_identifier ("public");
9775 access_protected_node
= get_identifier ("protected");
9776 access_private_node
= get_identifier ("private");
9778 /* Define these next since types below may used them. */
9779 integer_zero_node
= build_int_cst (integer_type_node
, 0);
9780 integer_one_node
= build_int_cst (integer_type_node
, 1);
9781 integer_three_node
= build_int_cst (integer_type_node
, 3);
9782 integer_minus_one_node
= build_int_cst (integer_type_node
, -1);
9784 size_zero_node
= size_int (0);
9785 size_one_node
= size_int (1);
9786 bitsize_zero_node
= bitsize_int (0);
9787 bitsize_one_node
= bitsize_int (1);
9788 bitsize_unit_node
= bitsize_int (BITS_PER_UNIT
);
9790 boolean_false_node
= TYPE_MIN_VALUE (boolean_type_node
);
9791 boolean_true_node
= TYPE_MAX_VALUE (boolean_type_node
);
9793 void_type_node
= make_node (VOID_TYPE
);
9794 layout_type (void_type_node
);
9796 pointer_bounds_type_node
= targetm
.chkp_bound_type ();
9798 /* We are not going to have real types in C with less than byte alignment,
9799 so we might as well not have any types that claim to have it. */
9800 TYPE_ALIGN (void_type_node
) = BITS_PER_UNIT
;
9801 TYPE_USER_ALIGN (void_type_node
) = 0;
9803 void_node
= make_node (VOID_CST
);
9804 TREE_TYPE (void_node
) = void_type_node
;
9806 null_pointer_node
= build_int_cst (build_pointer_type (void_type_node
), 0);
9807 layout_type (TREE_TYPE (null_pointer_node
));
9809 ptr_type_node
= build_pointer_type (void_type_node
);
9811 = build_pointer_type (build_type_variant (void_type_node
, 1, 0));
9812 fileptr_type_node
= ptr_type_node
;
9814 pointer_sized_int_node
= build_nonstandard_integer_type (POINTER_SIZE
, 1);
9816 float_type_node
= make_node (REAL_TYPE
);
9817 TYPE_PRECISION (float_type_node
) = FLOAT_TYPE_SIZE
;
9818 layout_type (float_type_node
);
9820 double_type_node
= make_node (REAL_TYPE
);
9822 TYPE_PRECISION (double_type_node
) = FLOAT_TYPE_SIZE
;
9824 TYPE_PRECISION (double_type_node
) = DOUBLE_TYPE_SIZE
;
9825 layout_type (double_type_node
);
9827 long_double_type_node
= make_node (REAL_TYPE
);
9828 TYPE_PRECISION (long_double_type_node
) = LONG_DOUBLE_TYPE_SIZE
;
9829 layout_type (long_double_type_node
);
9831 float_ptr_type_node
= build_pointer_type (float_type_node
);
9832 double_ptr_type_node
= build_pointer_type (double_type_node
);
9833 long_double_ptr_type_node
= build_pointer_type (long_double_type_node
);
9834 integer_ptr_type_node
= build_pointer_type (integer_type_node
);
9836 /* Fixed size integer types. */
9837 uint16_type_node
= make_or_reuse_type (16, 1);
9838 uint32_type_node
= make_or_reuse_type (32, 1);
9839 uint64_type_node
= make_or_reuse_type (64, 1);
9841 /* Decimal float types. */
9842 dfloat32_type_node
= make_node (REAL_TYPE
);
9843 TYPE_PRECISION (dfloat32_type_node
) = DECIMAL32_TYPE_SIZE
;
9844 layout_type (dfloat32_type_node
);
9845 SET_TYPE_MODE (dfloat32_type_node
, SDmode
);
9846 dfloat32_ptr_type_node
= build_pointer_type (dfloat32_type_node
);
9848 dfloat64_type_node
= make_node (REAL_TYPE
);
9849 TYPE_PRECISION (dfloat64_type_node
) = DECIMAL64_TYPE_SIZE
;
9850 layout_type (dfloat64_type_node
);
9851 SET_TYPE_MODE (dfloat64_type_node
, DDmode
);
9852 dfloat64_ptr_type_node
= build_pointer_type (dfloat64_type_node
);
9854 dfloat128_type_node
= make_node (REAL_TYPE
);
9855 TYPE_PRECISION (dfloat128_type_node
) = DECIMAL128_TYPE_SIZE
;
9856 layout_type (dfloat128_type_node
);
9857 SET_TYPE_MODE (dfloat128_type_node
, TDmode
);
9858 dfloat128_ptr_type_node
= build_pointer_type (dfloat128_type_node
);
9860 complex_integer_type_node
= build_complex_type (integer_type_node
);
9861 complex_float_type_node
= build_complex_type (float_type_node
);
9862 complex_double_type_node
= build_complex_type (double_type_node
);
9863 complex_long_double_type_node
= build_complex_type (long_double_type_node
);
9865 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
9866 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
9867 sat_ ## KIND ## _type_node = \
9868 make_sat_signed_ ## KIND ## _type (SIZE); \
9869 sat_unsigned_ ## KIND ## _type_node = \
9870 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9871 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9872 unsigned_ ## KIND ## _type_node = \
9873 make_unsigned_ ## KIND ## _type (SIZE);
9875 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
9876 sat_ ## WIDTH ## KIND ## _type_node = \
9877 make_sat_signed_ ## KIND ## _type (SIZE); \
9878 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
9879 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9880 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9881 unsigned_ ## WIDTH ## KIND ## _type_node = \
9882 make_unsigned_ ## KIND ## _type (SIZE);
9884 /* Make fixed-point type nodes based on four different widths. */
9885 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
9886 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
9887 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
9888 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
9889 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
9891 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
9892 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
9893 NAME ## _type_node = \
9894 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
9895 u ## NAME ## _type_node = \
9896 make_or_reuse_unsigned_ ## KIND ## _type \
9897 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
9898 sat_ ## NAME ## _type_node = \
9899 make_or_reuse_sat_signed_ ## KIND ## _type \
9900 (GET_MODE_BITSIZE (MODE ## mode)); \
9901 sat_u ## NAME ## _type_node = \
9902 make_or_reuse_sat_unsigned_ ## KIND ## _type \
9903 (GET_MODE_BITSIZE (U ## MODE ## mode));
9905 /* Fixed-point type and mode nodes. */
9906 MAKE_FIXED_TYPE_NODE_FAMILY (fract
, FRACT
)
9907 MAKE_FIXED_TYPE_NODE_FAMILY (accum
, ACCUM
)
9908 MAKE_FIXED_MODE_NODE (fract
, qq
, QQ
)
9909 MAKE_FIXED_MODE_NODE (fract
, hq
, HQ
)
9910 MAKE_FIXED_MODE_NODE (fract
, sq
, SQ
)
9911 MAKE_FIXED_MODE_NODE (fract
, dq
, DQ
)
9912 MAKE_FIXED_MODE_NODE (fract
, tq
, TQ
)
9913 MAKE_FIXED_MODE_NODE (accum
, ha
, HA
)
9914 MAKE_FIXED_MODE_NODE (accum
, sa
, SA
)
9915 MAKE_FIXED_MODE_NODE (accum
, da
, DA
)
9916 MAKE_FIXED_MODE_NODE (accum
, ta
, TA
)
9919 tree t
= targetm
.build_builtin_va_list ();
9921 /* Many back-ends define record types without setting TYPE_NAME.
9922 If we copied the record type here, we'd keep the original
9923 record type without a name. This breaks name mangling. So,
9924 don't copy record types and let c_common_nodes_and_builtins()
9925 declare the type to be __builtin_va_list. */
9926 if (TREE_CODE (t
) != RECORD_TYPE
)
9927 t
= build_variant_type_copy (t
);
9929 va_list_type_node
= t
;
9933 /* Modify DECL for given flags.
9934 TM_PURE attribute is set only on types, so the function will modify
9935 DECL's type when ECF_TM_PURE is used. */
9938 set_call_expr_flags (tree decl
, int flags
)
9940 if (flags
& ECF_NOTHROW
)
9941 TREE_NOTHROW (decl
) = 1;
9942 if (flags
& ECF_CONST
)
9943 TREE_READONLY (decl
) = 1;
9944 if (flags
& ECF_PURE
)
9945 DECL_PURE_P (decl
) = 1;
9946 if (flags
& ECF_LOOPING_CONST_OR_PURE
)
9947 DECL_LOOPING_CONST_OR_PURE_P (decl
) = 1;
9948 if (flags
& ECF_NOVOPS
)
9949 DECL_IS_NOVOPS (decl
) = 1;
9950 if (flags
& ECF_NORETURN
)
9951 TREE_THIS_VOLATILE (decl
) = 1;
9952 if (flags
& ECF_MALLOC
)
9953 DECL_IS_MALLOC (decl
) = 1;
9954 if (flags
& ECF_RETURNS_TWICE
)
9955 DECL_IS_RETURNS_TWICE (decl
) = 1;
9956 if (flags
& ECF_LEAF
)
9957 DECL_ATTRIBUTES (decl
) = tree_cons (get_identifier ("leaf"),
9958 NULL
, DECL_ATTRIBUTES (decl
));
9959 if ((flags
& ECF_TM_PURE
) && flag_tm
)
9960 apply_tm_attr (decl
, get_identifier ("transaction_pure"));
9961 /* Looping const or pure is implied by noreturn.
9962 There is currently no way to declare looping const or looping pure alone. */
9963 gcc_assert (!(flags
& ECF_LOOPING_CONST_OR_PURE
)
9964 || ((flags
& ECF_NORETURN
) && (flags
& (ECF_CONST
| ECF_PURE
))));
9968 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
9971 local_define_builtin (const char *name
, tree type
, enum built_in_function code
,
9972 const char *library_name
, int ecf_flags
)
9976 decl
= add_builtin_function (name
, type
, code
, BUILT_IN_NORMAL
,
9977 library_name
, NULL_TREE
);
9978 set_call_expr_flags (decl
, ecf_flags
);
9980 set_builtin_decl (code
, decl
, true);
9983 /* Call this function after instantiating all builtins that the language
9984 front end cares about. This will build the rest of the builtins
9985 and internal functions that are relied upon by the tree optimizers and
9989 build_common_builtin_nodes (void)
9994 if (!builtin_decl_explicit_p (BUILT_IN_UNREACHABLE
))
9996 ftype
= build_function_type (void_type_node
, void_list_node
);
9997 local_define_builtin ("__builtin_unreachable", ftype
, BUILT_IN_UNREACHABLE
,
9998 "__builtin_unreachable",
9999 ECF_NOTHROW
| ECF_LEAF
| ECF_NORETURN
10003 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
)
10004 || !builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
10006 ftype
= build_function_type_list (ptr_type_node
,
10007 ptr_type_node
, const_ptr_type_node
,
10008 size_type_node
, NULL_TREE
);
10010 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
))
10011 local_define_builtin ("__builtin_memcpy", ftype
, BUILT_IN_MEMCPY
,
10012 "memcpy", ECF_NOTHROW
| ECF_LEAF
);
10013 if (!builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
10014 local_define_builtin ("__builtin_memmove", ftype
, BUILT_IN_MEMMOVE
,
10015 "memmove", ECF_NOTHROW
| ECF_LEAF
);
10018 if (!builtin_decl_explicit_p (BUILT_IN_MEMCMP
))
10020 ftype
= build_function_type_list (integer_type_node
, const_ptr_type_node
,
10021 const_ptr_type_node
, size_type_node
,
10023 local_define_builtin ("__builtin_memcmp", ftype
, BUILT_IN_MEMCMP
,
10024 "memcmp", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10027 if (!builtin_decl_explicit_p (BUILT_IN_MEMSET
))
10029 ftype
= build_function_type_list (ptr_type_node
,
10030 ptr_type_node
, integer_type_node
,
10031 size_type_node
, NULL_TREE
);
10032 local_define_builtin ("__builtin_memset", ftype
, BUILT_IN_MEMSET
,
10033 "memset", ECF_NOTHROW
| ECF_LEAF
);
10036 if (!builtin_decl_explicit_p (BUILT_IN_ALLOCA
))
10038 ftype
= build_function_type_list (ptr_type_node
,
10039 size_type_node
, NULL_TREE
);
10040 local_define_builtin ("__builtin_alloca", ftype
, BUILT_IN_ALLOCA
,
10041 "alloca", ECF_MALLOC
| ECF_NOTHROW
| ECF_LEAF
);
10044 ftype
= build_function_type_list (ptr_type_node
, size_type_node
,
10045 size_type_node
, NULL_TREE
);
10046 local_define_builtin ("__builtin_alloca_with_align", ftype
,
10047 BUILT_IN_ALLOCA_WITH_ALIGN
, "alloca",
10048 ECF_MALLOC
| ECF_NOTHROW
| ECF_LEAF
);
10050 /* If we're checking the stack, `alloca' can throw. */
10051 if (flag_stack_check
)
10053 TREE_NOTHROW (builtin_decl_explicit (BUILT_IN_ALLOCA
)) = 0;
10054 TREE_NOTHROW (builtin_decl_explicit (BUILT_IN_ALLOCA_WITH_ALIGN
)) = 0;
10057 ftype
= build_function_type_list (void_type_node
,
10058 ptr_type_node
, ptr_type_node
,
10059 ptr_type_node
, NULL_TREE
);
10060 local_define_builtin ("__builtin_init_trampoline", ftype
,
10061 BUILT_IN_INIT_TRAMPOLINE
,
10062 "__builtin_init_trampoline", ECF_NOTHROW
| ECF_LEAF
);
10063 local_define_builtin ("__builtin_init_heap_trampoline", ftype
,
10064 BUILT_IN_INIT_HEAP_TRAMPOLINE
,
10065 "__builtin_init_heap_trampoline",
10066 ECF_NOTHROW
| ECF_LEAF
);
10068 ftype
= build_function_type_list (ptr_type_node
, ptr_type_node
, NULL_TREE
);
10069 local_define_builtin ("__builtin_adjust_trampoline", ftype
,
10070 BUILT_IN_ADJUST_TRAMPOLINE
,
10071 "__builtin_adjust_trampoline",
10072 ECF_CONST
| ECF_NOTHROW
);
10074 ftype
= build_function_type_list (void_type_node
,
10075 ptr_type_node
, ptr_type_node
, NULL_TREE
);
10076 local_define_builtin ("__builtin_nonlocal_goto", ftype
,
10077 BUILT_IN_NONLOCAL_GOTO
,
10078 "__builtin_nonlocal_goto",
10079 ECF_NORETURN
| ECF_NOTHROW
);
10081 ftype
= build_function_type_list (void_type_node
,
10082 ptr_type_node
, ptr_type_node
, NULL_TREE
);
10083 local_define_builtin ("__builtin_setjmp_setup", ftype
,
10084 BUILT_IN_SETJMP_SETUP
,
10085 "__builtin_setjmp_setup", ECF_NOTHROW
);
10087 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10088 local_define_builtin ("__builtin_setjmp_receiver", ftype
,
10089 BUILT_IN_SETJMP_RECEIVER
,
10090 "__builtin_setjmp_receiver", ECF_NOTHROW
| ECF_LEAF
);
10092 ftype
= build_function_type_list (ptr_type_node
, NULL_TREE
);
10093 local_define_builtin ("__builtin_stack_save", ftype
, BUILT_IN_STACK_SAVE
,
10094 "__builtin_stack_save", ECF_NOTHROW
| ECF_LEAF
);
10096 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10097 local_define_builtin ("__builtin_stack_restore", ftype
,
10098 BUILT_IN_STACK_RESTORE
,
10099 "__builtin_stack_restore", ECF_NOTHROW
| ECF_LEAF
);
10101 /* If there's a possibility that we might use the ARM EABI, build the
10102 alternate __cxa_end_cleanup node used to resume from C++ and Java. */
10103 if (targetm
.arm_eabi_unwinder
)
10105 ftype
= build_function_type_list (void_type_node
, NULL_TREE
);
10106 local_define_builtin ("__builtin_cxa_end_cleanup", ftype
,
10107 BUILT_IN_CXA_END_CLEANUP
,
10108 "__cxa_end_cleanup", ECF_NORETURN
| ECF_LEAF
);
10111 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10112 local_define_builtin ("__builtin_unwind_resume", ftype
,
10113 BUILT_IN_UNWIND_RESUME
,
10114 ((targetm_common
.except_unwind_info (&global_options
)
10116 ? "_Unwind_SjLj_Resume" : "_Unwind_Resume"),
10119 if (builtin_decl_explicit (BUILT_IN_RETURN_ADDRESS
) == NULL_TREE
)
10121 ftype
= build_function_type_list (ptr_type_node
, integer_type_node
,
10123 local_define_builtin ("__builtin_return_address", ftype
,
10124 BUILT_IN_RETURN_ADDRESS
,
10125 "__builtin_return_address",
10129 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
)
10130 || !builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
10132 ftype
= build_function_type_list (void_type_node
, ptr_type_node
,
10133 ptr_type_node
, NULL_TREE
);
10134 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
))
10135 local_define_builtin ("__cyg_profile_func_enter", ftype
,
10136 BUILT_IN_PROFILE_FUNC_ENTER
,
10137 "__cyg_profile_func_enter", 0);
10138 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
10139 local_define_builtin ("__cyg_profile_func_exit", ftype
,
10140 BUILT_IN_PROFILE_FUNC_EXIT
,
10141 "__cyg_profile_func_exit", 0);
10144 /* The exception object and filter values from the runtime. The argument
10145 must be zero before exception lowering, i.e. from the front end. After
10146 exception lowering, it will be the region number for the exception
10147 landing pad. These functions are PURE instead of CONST to prevent
10148 them from being hoisted past the exception edge that will initialize
10149 its value in the landing pad. */
10150 ftype
= build_function_type_list (ptr_type_node
,
10151 integer_type_node
, NULL_TREE
);
10152 ecf_flags
= ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
;
10153 /* Only use TM_PURE if we we have TM language support. */
10154 if (builtin_decl_explicit_p (BUILT_IN_TM_LOAD_1
))
10155 ecf_flags
|= ECF_TM_PURE
;
10156 local_define_builtin ("__builtin_eh_pointer", ftype
, BUILT_IN_EH_POINTER
,
10157 "__builtin_eh_pointer", ecf_flags
);
10159 tmp
= lang_hooks
.types
.type_for_mode (targetm
.eh_return_filter_mode (), 0);
10160 ftype
= build_function_type_list (tmp
, integer_type_node
, NULL_TREE
);
10161 local_define_builtin ("__builtin_eh_filter", ftype
, BUILT_IN_EH_FILTER
,
10162 "__builtin_eh_filter", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10164 ftype
= build_function_type_list (void_type_node
,
10165 integer_type_node
, integer_type_node
,
10167 local_define_builtin ("__builtin_eh_copy_values", ftype
,
10168 BUILT_IN_EH_COPY_VALUES
,
10169 "__builtin_eh_copy_values", ECF_NOTHROW
);
10171 /* Complex multiplication and division. These are handled as builtins
10172 rather than optabs because emit_library_call_value doesn't support
10173 complex. Further, we can do slightly better with folding these
10174 beasties if the real and complex parts of the arguments are separate. */
10178 for (mode
= MIN_MODE_COMPLEX_FLOAT
; mode
<= MAX_MODE_COMPLEX_FLOAT
; ++mode
)
10180 char mode_name_buf
[4], *q
;
10182 enum built_in_function mcode
, dcode
;
10183 tree type
, inner_type
;
10184 const char *prefix
= "__";
10186 if (targetm
.libfunc_gnu_prefix
)
10189 type
= lang_hooks
.types
.type_for_mode ((machine_mode
) mode
, 0);
10192 inner_type
= TREE_TYPE (type
);
10194 ftype
= build_function_type_list (type
, inner_type
, inner_type
,
10195 inner_type
, inner_type
, NULL_TREE
);
10197 mcode
= ((enum built_in_function
)
10198 (BUILT_IN_COMPLEX_MUL_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
10199 dcode
= ((enum built_in_function
)
10200 (BUILT_IN_COMPLEX_DIV_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
10202 for (p
= GET_MODE_NAME (mode
), q
= mode_name_buf
; *p
; p
++, q
++)
10206 built_in_names
[mcode
] = concat (prefix
, "mul", mode_name_buf
, "3",
10208 local_define_builtin (built_in_names
[mcode
], ftype
, mcode
,
10209 built_in_names
[mcode
],
10210 ECF_CONST
| ECF_NOTHROW
| ECF_LEAF
);
10212 built_in_names
[dcode
] = concat (prefix
, "div", mode_name_buf
, "3",
10214 local_define_builtin (built_in_names
[dcode
], ftype
, dcode
,
10215 built_in_names
[dcode
],
10216 ECF_CONST
| ECF_NOTHROW
| ECF_LEAF
);
10220 init_internal_fns ();
10223 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
10226 If we requested a pointer to a vector, build up the pointers that
10227 we stripped off while looking for the inner type. Similarly for
10228 return values from functions.
10230 The argument TYPE is the top of the chain, and BOTTOM is the
10231 new type which we will point to. */
10234 reconstruct_complex_type (tree type
, tree bottom
)
10238 if (TREE_CODE (type
) == POINTER_TYPE
)
10240 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10241 outer
= build_pointer_type_for_mode (inner
, TYPE_MODE (type
),
10242 TYPE_REF_CAN_ALIAS_ALL (type
));
10244 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
10246 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10247 outer
= build_reference_type_for_mode (inner
, TYPE_MODE (type
),
10248 TYPE_REF_CAN_ALIAS_ALL (type
));
10250 else if (TREE_CODE (type
) == ARRAY_TYPE
)
10252 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10253 outer
= build_array_type (inner
, TYPE_DOMAIN (type
));
10255 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10257 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10258 outer
= build_function_type (inner
, TYPE_ARG_TYPES (type
));
10260 else if (TREE_CODE (type
) == METHOD_TYPE
)
10262 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10263 /* The build_method_type_directly() routine prepends 'this' to argument list,
10264 so we must compensate by getting rid of it. */
10266 = build_method_type_directly
10267 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
))),
10269 TREE_CHAIN (TYPE_ARG_TYPES (type
)));
10271 else if (TREE_CODE (type
) == OFFSET_TYPE
)
10273 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10274 outer
= build_offset_type (TYPE_OFFSET_BASETYPE (type
), inner
);
10279 return build_type_attribute_qual_variant (outer
, TYPE_ATTRIBUTES (type
),
10280 TYPE_QUALS (type
));
10283 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
10286 build_vector_type_for_mode (tree innertype
, machine_mode mode
)
10290 switch (GET_MODE_CLASS (mode
))
10292 case MODE_VECTOR_INT
:
10293 case MODE_VECTOR_FLOAT
:
10294 case MODE_VECTOR_FRACT
:
10295 case MODE_VECTOR_UFRACT
:
10296 case MODE_VECTOR_ACCUM
:
10297 case MODE_VECTOR_UACCUM
:
10298 nunits
= GET_MODE_NUNITS (mode
);
10302 /* Check that there are no leftover bits. */
10303 gcc_assert (GET_MODE_BITSIZE (mode
)
10304 % TREE_INT_CST_LOW (TYPE_SIZE (innertype
)) == 0);
10306 nunits
= GET_MODE_BITSIZE (mode
)
10307 / TREE_INT_CST_LOW (TYPE_SIZE (innertype
));
10311 gcc_unreachable ();
10314 return make_vector_type (innertype
, nunits
, mode
);
10317 /* Similarly, but takes the inner type and number of units, which must be
10321 build_vector_type (tree innertype
, int nunits
)
10323 return make_vector_type (innertype
, nunits
, VOIDmode
);
10326 /* Similarly, but builds a variant type with TYPE_VECTOR_OPAQUE set. */
10329 build_opaque_vector_type (tree innertype
, int nunits
)
10331 tree t
= make_vector_type (innertype
, nunits
, VOIDmode
);
10333 /* We always build the non-opaque variant before the opaque one,
10334 so if it already exists, it is TYPE_NEXT_VARIANT of this one. */
10335 cand
= TYPE_NEXT_VARIANT (t
);
10337 && TYPE_VECTOR_OPAQUE (cand
)
10338 && check_qualified_type (cand
, t
, TYPE_QUALS (t
)))
10340 /* Othewise build a variant type and make sure to queue it after
10341 the non-opaque type. */
10342 cand
= build_distinct_type_copy (t
);
10343 TYPE_VECTOR_OPAQUE (cand
) = true;
10344 TYPE_CANONICAL (cand
) = TYPE_CANONICAL (t
);
10345 TYPE_NEXT_VARIANT (cand
) = TYPE_NEXT_VARIANT (t
);
10346 TYPE_NEXT_VARIANT (t
) = cand
;
10347 TYPE_MAIN_VARIANT (cand
) = TYPE_MAIN_VARIANT (t
);
10352 /* Given an initializer INIT, return TRUE if INIT is zero or some
10353 aggregate of zeros. Otherwise return FALSE. */
10355 initializer_zerop (const_tree init
)
10361 switch (TREE_CODE (init
))
10364 return integer_zerop (init
);
10367 /* ??? Note that this is not correct for C4X float formats. There,
10368 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
10369 negative exponent. */
10370 return real_zerop (init
)
10371 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init
));
10374 return fixed_zerop (init
);
10377 return integer_zerop (init
)
10378 || (real_zerop (init
)
10379 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init
)))
10380 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init
))));
10385 for (i
= 0; i
< VECTOR_CST_NELTS (init
); ++i
)
10386 if (!initializer_zerop (VECTOR_CST_ELT (init
, i
)))
10393 unsigned HOST_WIDE_INT idx
;
10395 if (TREE_CLOBBER_P (init
))
10397 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init
), idx
, elt
)
10398 if (!initializer_zerop (elt
))
10407 /* We need to loop through all elements to handle cases like
10408 "\0" and "\0foobar". */
10409 for (i
= 0; i
< TREE_STRING_LENGTH (init
); ++i
)
10410 if (TREE_STRING_POINTER (init
)[i
] != '\0')
10421 /* Check if vector VEC consists of all the equal elements and
10422 that the number of elements corresponds to the type of VEC.
10423 The function returns first element of the vector
10424 or NULL_TREE if the vector is not uniform. */
10426 uniform_vector_p (const_tree vec
)
10431 if (vec
== NULL_TREE
)
10434 gcc_assert (VECTOR_TYPE_P (TREE_TYPE (vec
)));
10436 if (TREE_CODE (vec
) == VECTOR_CST
)
10438 first
= VECTOR_CST_ELT (vec
, 0);
10439 for (i
= 1; i
< VECTOR_CST_NELTS (vec
); ++i
)
10440 if (!operand_equal_p (first
, VECTOR_CST_ELT (vec
, i
), 0))
10446 else if (TREE_CODE (vec
) == CONSTRUCTOR
)
10448 first
= error_mark_node
;
10450 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (vec
), i
, t
)
10457 if (!operand_equal_p (first
, t
, 0))
10460 if (i
!= TYPE_VECTOR_SUBPARTS (TREE_TYPE (vec
)))
10469 /* Build an empty statement at location LOC. */
10472 build_empty_stmt (location_t loc
)
10474 tree t
= build1 (NOP_EXPR
, void_type_node
, size_zero_node
);
10475 SET_EXPR_LOCATION (t
, loc
);
10480 /* Build an OpenMP clause with code CODE. LOC is the location of the
10484 build_omp_clause (location_t loc
, enum omp_clause_code code
)
10489 length
= omp_clause_num_ops
[code
];
10490 size
= (sizeof (struct tree_omp_clause
) + (length
- 1) * sizeof (tree
));
10492 record_node_allocation_statistics (OMP_CLAUSE
, size
);
10494 t
= (tree
) ggc_internal_alloc (size
);
10495 memset (t
, 0, size
);
10496 TREE_SET_CODE (t
, OMP_CLAUSE
);
10497 OMP_CLAUSE_SET_CODE (t
, code
);
10498 OMP_CLAUSE_LOCATION (t
) = loc
;
10503 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
10504 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
10505 Except for the CODE and operand count field, other storage for the
10506 object is initialized to zeros. */
10509 build_vl_exp_stat (enum tree_code code
, int len MEM_STAT_DECL
)
10512 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_exp
);
10514 gcc_assert (TREE_CODE_CLASS (code
) == tcc_vl_exp
);
10515 gcc_assert (len
>= 1);
10517 record_node_allocation_statistics (code
, length
);
10519 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
10521 TREE_SET_CODE (t
, code
);
10523 /* Can't use TREE_OPERAND to store the length because if checking is
10524 enabled, it will try to check the length before we store it. :-P */
10525 t
->exp
.operands
[0] = build_int_cst (sizetype
, len
);
10530 /* Helper function for build_call_* functions; build a CALL_EXPR with
10531 indicated RETURN_TYPE, FN, and NARGS, but do not initialize any of
10532 the argument slots. */
10535 build_call_1 (tree return_type
, tree fn
, int nargs
)
10539 t
= build_vl_exp (CALL_EXPR
, nargs
+ 3);
10540 TREE_TYPE (t
) = return_type
;
10541 CALL_EXPR_FN (t
) = fn
;
10542 CALL_EXPR_STATIC_CHAIN (t
) = NULL
;
10547 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10548 FN and a null static chain slot. NARGS is the number of call arguments
10549 which are specified as "..." arguments. */
10552 build_call_nary (tree return_type
, tree fn
, int nargs
, ...)
10556 va_start (args
, nargs
);
10557 ret
= build_call_valist (return_type
, fn
, nargs
, args
);
10562 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10563 FN and a null static chain slot. NARGS is the number of call arguments
10564 which are specified as a va_list ARGS. */
10567 build_call_valist (tree return_type
, tree fn
, int nargs
, va_list args
)
10572 t
= build_call_1 (return_type
, fn
, nargs
);
10573 for (i
= 0; i
< nargs
; i
++)
10574 CALL_EXPR_ARG (t
, i
) = va_arg (args
, tree
);
10575 process_call_operands (t
);
10579 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10580 FN and a null static chain slot. NARGS is the number of call arguments
10581 which are specified as a tree array ARGS. */
10584 build_call_array_loc (location_t loc
, tree return_type
, tree fn
,
10585 int nargs
, const tree
*args
)
10590 t
= build_call_1 (return_type
, fn
, nargs
);
10591 for (i
= 0; i
< nargs
; i
++)
10592 CALL_EXPR_ARG (t
, i
) = args
[i
];
10593 process_call_operands (t
);
10594 SET_EXPR_LOCATION (t
, loc
);
10598 /* Like build_call_array, but takes a vec. */
10601 build_call_vec (tree return_type
, tree fn
, vec
<tree
, va_gc
> *args
)
10606 ret
= build_call_1 (return_type
, fn
, vec_safe_length (args
));
10607 FOR_EACH_VEC_SAFE_ELT (args
, ix
, t
)
10608 CALL_EXPR_ARG (ret
, ix
) = t
;
10609 process_call_operands (ret
);
10613 /* Conveniently construct a function call expression. FNDECL names the
10614 function to be called and N arguments are passed in the array
10618 build_call_expr_loc_array (location_t loc
, tree fndecl
, int n
, tree
*argarray
)
10620 tree fntype
= TREE_TYPE (fndecl
);
10621 tree fn
= build1 (ADDR_EXPR
, build_pointer_type (fntype
), fndecl
);
10623 return fold_build_call_array_loc (loc
, TREE_TYPE (fntype
), fn
, n
, argarray
);
10626 /* Conveniently construct a function call expression. FNDECL names the
10627 function to be called and the arguments are passed in the vector
10631 build_call_expr_loc_vec (location_t loc
, tree fndecl
, vec
<tree
, va_gc
> *vec
)
10633 return build_call_expr_loc_array (loc
, fndecl
, vec_safe_length (vec
),
10634 vec_safe_address (vec
));
10638 /* Conveniently construct a function call expression. FNDECL names the
10639 function to be called, N is the number of arguments, and the "..."
10640 parameters are the argument expressions. */
10643 build_call_expr_loc (location_t loc
, tree fndecl
, int n
, ...)
10646 tree
*argarray
= XALLOCAVEC (tree
, n
);
10650 for (i
= 0; i
< n
; i
++)
10651 argarray
[i
] = va_arg (ap
, tree
);
10653 return build_call_expr_loc_array (loc
, fndecl
, n
, argarray
);
10656 /* Like build_call_expr_loc (UNKNOWN_LOCATION, ...). Duplicated because
10657 varargs macros aren't supported by all bootstrap compilers. */
10660 build_call_expr (tree fndecl
, int n
, ...)
10663 tree
*argarray
= XALLOCAVEC (tree
, n
);
10667 for (i
= 0; i
< n
; i
++)
10668 argarray
[i
] = va_arg (ap
, tree
);
10670 return build_call_expr_loc_array (UNKNOWN_LOCATION
, fndecl
, n
, argarray
);
10673 /* Build internal call expression. This is just like CALL_EXPR, except
10674 its CALL_EXPR_FN is NULL. It will get gimplified later into ordinary
10675 internal function. */
10678 build_call_expr_internal_loc (location_t loc
, enum internal_fn ifn
,
10679 tree type
, int n
, ...)
10684 tree fn
= build_call_1 (type
, NULL_TREE
, n
);
10686 for (i
= 0; i
< n
; i
++)
10687 CALL_EXPR_ARG (fn
, i
) = va_arg (ap
, tree
);
10689 SET_EXPR_LOCATION (fn
, loc
);
10690 CALL_EXPR_IFN (fn
) = ifn
;
10694 /* Create a new constant string literal and return a char* pointer to it.
10695 The STRING_CST value is the LEN characters at STR. */
10697 build_string_literal (int len
, const char *str
)
10699 tree t
, elem
, index
, type
;
10701 t
= build_string (len
, str
);
10702 elem
= build_type_variant (char_type_node
, 1, 0);
10703 index
= build_index_type (size_int (len
- 1));
10704 type
= build_array_type (elem
, index
);
10705 TREE_TYPE (t
) = type
;
10706 TREE_CONSTANT (t
) = 1;
10707 TREE_READONLY (t
) = 1;
10708 TREE_STATIC (t
) = 1;
10710 type
= build_pointer_type (elem
);
10711 t
= build1 (ADDR_EXPR
, type
,
10712 build4 (ARRAY_REF
, elem
,
10713 t
, integer_zero_node
, NULL_TREE
, NULL_TREE
));
10719 /* Return true if T (assumed to be a DECL) must be assigned a memory
10723 needs_to_live_in_memory (const_tree t
)
10725 return (TREE_ADDRESSABLE (t
)
10726 || is_global_var (t
)
10727 || (TREE_CODE (t
) == RESULT_DECL
10728 && !DECL_BY_REFERENCE (t
)
10729 && aggregate_value_p (t
, current_function_decl
)));
10732 /* Return value of a constant X and sign-extend it. */
10735 int_cst_value (const_tree x
)
10737 unsigned bits
= TYPE_PRECISION (TREE_TYPE (x
));
10738 unsigned HOST_WIDE_INT val
= TREE_INT_CST_LOW (x
);
10740 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
10741 gcc_assert (cst_and_fits_in_hwi (x
));
10743 if (bits
< HOST_BITS_PER_WIDE_INT
)
10745 bool negative
= ((val
>> (bits
- 1)) & 1) != 0;
10747 val
|= (~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1;
10749 val
&= ~((~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1);
10755 /* If TYPE is an integral or pointer type, return an integer type with
10756 the same precision which is unsigned iff UNSIGNEDP is true, or itself
10757 if TYPE is already an integer type of signedness UNSIGNEDP. */
10760 signed_or_unsigned_type_for (int unsignedp
, tree type
)
10762 if (TREE_CODE (type
) == INTEGER_TYPE
&& TYPE_UNSIGNED (type
) == unsignedp
)
10765 if (TREE_CODE (type
) == VECTOR_TYPE
)
10767 tree inner
= TREE_TYPE (type
);
10768 tree inner2
= signed_or_unsigned_type_for (unsignedp
, inner
);
10771 if (inner
== inner2
)
10773 return build_vector_type (inner2
, TYPE_VECTOR_SUBPARTS (type
));
10776 if (!INTEGRAL_TYPE_P (type
)
10777 && !POINTER_TYPE_P (type
)
10778 && TREE_CODE (type
) != OFFSET_TYPE
)
10781 return build_nonstandard_integer_type (TYPE_PRECISION (type
), unsignedp
);
10784 /* If TYPE is an integral or pointer type, return an integer type with
10785 the same precision which is unsigned, or itself if TYPE is already an
10786 unsigned integer type. */
10789 unsigned_type_for (tree type
)
10791 return signed_or_unsigned_type_for (1, type
);
10794 /* If TYPE is an integral or pointer type, return an integer type with
10795 the same precision which is signed, or itself if TYPE is already a
10796 signed integer type. */
10799 signed_type_for (tree type
)
10801 return signed_or_unsigned_type_for (0, type
);
10804 /* If TYPE is a vector type, return a signed integer vector type with the
10805 same width and number of subparts. Otherwise return boolean_type_node. */
10808 truth_type_for (tree type
)
10810 if (TREE_CODE (type
) == VECTOR_TYPE
)
10812 tree elem
= lang_hooks
.types
.type_for_size
10813 (GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (type
))), 0);
10814 return build_opaque_vector_type (elem
, TYPE_VECTOR_SUBPARTS (type
));
10817 return boolean_type_node
;
10820 /* Returns the largest value obtainable by casting something in INNER type to
10824 upper_bound_in_type (tree outer
, tree inner
)
10826 unsigned int det
= 0;
10827 unsigned oprec
= TYPE_PRECISION (outer
);
10828 unsigned iprec
= TYPE_PRECISION (inner
);
10831 /* Compute a unique number for every combination. */
10832 det
|= (oprec
> iprec
) ? 4 : 0;
10833 det
|= TYPE_UNSIGNED (outer
) ? 2 : 0;
10834 det
|= TYPE_UNSIGNED (inner
) ? 1 : 0;
10836 /* Determine the exponent to use. */
10841 /* oprec <= iprec, outer: signed, inner: don't care. */
10846 /* oprec <= iprec, outer: unsigned, inner: don't care. */
10850 /* oprec > iprec, outer: signed, inner: signed. */
10854 /* oprec > iprec, outer: signed, inner: unsigned. */
10858 /* oprec > iprec, outer: unsigned, inner: signed. */
10862 /* oprec > iprec, outer: unsigned, inner: unsigned. */
10866 gcc_unreachable ();
10869 return wide_int_to_tree (outer
,
10870 wi::mask (prec
, false, TYPE_PRECISION (outer
)));
10873 /* Returns the smallest value obtainable by casting something in INNER type to
10877 lower_bound_in_type (tree outer
, tree inner
)
10879 unsigned oprec
= TYPE_PRECISION (outer
);
10880 unsigned iprec
= TYPE_PRECISION (inner
);
10882 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
10884 if (TYPE_UNSIGNED (outer
)
10885 /* If we are widening something of an unsigned type, OUTER type
10886 contains all values of INNER type. In particular, both INNER
10887 and OUTER types have zero in common. */
10888 || (oprec
> iprec
&& TYPE_UNSIGNED (inner
)))
10889 return build_int_cst (outer
, 0);
10892 /* If we are widening a signed type to another signed type, we
10893 want to obtain -2^^(iprec-1). If we are keeping the
10894 precision or narrowing to a signed type, we want to obtain
10896 unsigned prec
= oprec
> iprec
? iprec
: oprec
;
10897 return wide_int_to_tree (outer
,
10898 wi::mask (prec
- 1, true,
10899 TYPE_PRECISION (outer
)));
10903 /* Return nonzero if two operands that are suitable for PHI nodes are
10904 necessarily equal. Specifically, both ARG0 and ARG1 must be either
10905 SSA_NAME or invariant. Note that this is strictly an optimization.
10906 That is, callers of this function can directly call operand_equal_p
10907 and get the same result, only slower. */
10910 operand_equal_for_phi_arg_p (const_tree arg0
, const_tree arg1
)
10914 if (TREE_CODE (arg0
) == SSA_NAME
|| TREE_CODE (arg1
) == SSA_NAME
)
10916 return operand_equal_p (arg0
, arg1
, 0);
10919 /* Returns number of zeros at the end of binary representation of X. */
10922 num_ending_zeros (const_tree x
)
10924 return build_int_cst (TREE_TYPE (x
), wi::ctz (x
));
10928 #define WALK_SUBTREE(NODE) \
10931 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
10937 /* This is a subroutine of walk_tree that walks field of TYPE that are to
10938 be walked whenever a type is seen in the tree. Rest of operands and return
10939 value are as for walk_tree. */
10942 walk_type_fields (tree type
, walk_tree_fn func
, void *data
,
10943 hash_set
<tree
> *pset
, walk_tree_lh lh
)
10945 tree result
= NULL_TREE
;
10947 switch (TREE_CODE (type
))
10950 case REFERENCE_TYPE
:
10952 /* We have to worry about mutually recursive pointers. These can't
10953 be written in C. They can in Ada. It's pathological, but
10954 there's an ACATS test (c38102a) that checks it. Deal with this
10955 by checking if we're pointing to another pointer, that one
10956 points to another pointer, that one does too, and we have no htab.
10957 If so, get a hash table. We check three levels deep to avoid
10958 the cost of the hash table if we don't need one. */
10959 if (POINTER_TYPE_P (TREE_TYPE (type
))
10960 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type
)))
10961 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type
))))
10964 result
= walk_tree_without_duplicates (&TREE_TYPE (type
),
10972 /* ... fall through ... */
10975 WALK_SUBTREE (TREE_TYPE (type
));
10979 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type
));
10981 /* Fall through. */
10983 case FUNCTION_TYPE
:
10984 WALK_SUBTREE (TREE_TYPE (type
));
10988 /* We never want to walk into default arguments. */
10989 for (arg
= TYPE_ARG_TYPES (type
); arg
; arg
= TREE_CHAIN (arg
))
10990 WALK_SUBTREE (TREE_VALUE (arg
));
10995 /* Don't follow this nodes's type if a pointer for fear that
10996 we'll have infinite recursion. If we have a PSET, then we
10999 || (!POINTER_TYPE_P (TREE_TYPE (type
))
11000 && TREE_CODE (TREE_TYPE (type
)) != OFFSET_TYPE
))
11001 WALK_SUBTREE (TREE_TYPE (type
));
11002 WALK_SUBTREE (TYPE_DOMAIN (type
));
11006 WALK_SUBTREE (TREE_TYPE (type
));
11007 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type
));
11017 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
11018 called with the DATA and the address of each sub-tree. If FUNC returns a
11019 non-NULL value, the traversal is stopped, and the value returned by FUNC
11020 is returned. If PSET is non-NULL it is used to record the nodes visited,
11021 and to avoid visiting a node more than once. */
11024 walk_tree_1 (tree
*tp
, walk_tree_fn func
, void *data
,
11025 hash_set
<tree
> *pset
, walk_tree_lh lh
)
11027 enum tree_code code
;
11031 #define WALK_SUBTREE_TAIL(NODE) \
11035 goto tail_recurse; \
11040 /* Skip empty subtrees. */
11044 /* Don't walk the same tree twice, if the user has requested
11045 that we avoid doing so. */
11046 if (pset
&& pset
->add (*tp
))
11049 /* Call the function. */
11051 result
= (*func
) (tp
, &walk_subtrees
, data
);
11053 /* If we found something, return it. */
11057 code
= TREE_CODE (*tp
);
11059 /* Even if we didn't, FUNC may have decided that there was nothing
11060 interesting below this point in the tree. */
11061 if (!walk_subtrees
)
11063 /* But we still need to check our siblings. */
11064 if (code
== TREE_LIST
)
11065 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
11066 else if (code
== OMP_CLAUSE
)
11067 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11074 result
= (*lh
) (tp
, &walk_subtrees
, func
, data
, pset
);
11075 if (result
|| !walk_subtrees
)
11082 case IDENTIFIER_NODE
:
11089 case PLACEHOLDER_EXPR
:
11093 /* None of these have subtrees other than those already walked
11098 WALK_SUBTREE (TREE_VALUE (*tp
));
11099 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
11104 int len
= TREE_VEC_LENGTH (*tp
);
11109 /* Walk all elements but the first. */
11111 WALK_SUBTREE (TREE_VEC_ELT (*tp
, len
));
11113 /* Now walk the first one as a tail call. */
11114 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp
, 0));
11118 WALK_SUBTREE (TREE_REALPART (*tp
));
11119 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp
));
11123 unsigned HOST_WIDE_INT idx
;
11124 constructor_elt
*ce
;
11126 for (idx
= 0; vec_safe_iterate (CONSTRUCTOR_ELTS (*tp
), idx
, &ce
);
11128 WALK_SUBTREE (ce
->value
);
11133 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, 0));
11138 for (decl
= BIND_EXPR_VARS (*tp
); decl
; decl
= DECL_CHAIN (decl
))
11140 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
11141 into declarations that are just mentioned, rather than
11142 declared; they don't really belong to this part of the tree.
11143 And, we can see cycles: the initializer for a declaration
11144 can refer to the declaration itself. */
11145 WALK_SUBTREE (DECL_INITIAL (decl
));
11146 WALK_SUBTREE (DECL_SIZE (decl
));
11147 WALK_SUBTREE (DECL_SIZE_UNIT (decl
));
11149 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp
));
11152 case STATEMENT_LIST
:
11154 tree_stmt_iterator i
;
11155 for (i
= tsi_start (*tp
); !tsi_end_p (i
); tsi_next (&i
))
11156 WALK_SUBTREE (*tsi_stmt_ptr (i
));
11161 switch (OMP_CLAUSE_CODE (*tp
))
11163 case OMP_CLAUSE_PRIVATE
:
11164 case OMP_CLAUSE_SHARED
:
11165 case OMP_CLAUSE_FIRSTPRIVATE
:
11166 case OMP_CLAUSE_COPYIN
:
11167 case OMP_CLAUSE_COPYPRIVATE
:
11168 case OMP_CLAUSE_FINAL
:
11169 case OMP_CLAUSE_IF
:
11170 case OMP_CLAUSE_NUM_THREADS
:
11171 case OMP_CLAUSE_SCHEDULE
:
11172 case OMP_CLAUSE_UNIFORM
:
11173 case OMP_CLAUSE_DEPEND
:
11174 case OMP_CLAUSE_NUM_TEAMS
:
11175 case OMP_CLAUSE_THREAD_LIMIT
:
11176 case OMP_CLAUSE_DEVICE
:
11177 case OMP_CLAUSE_DIST_SCHEDULE
:
11178 case OMP_CLAUSE_SAFELEN
:
11179 case OMP_CLAUSE_SIMDLEN
:
11180 case OMP_CLAUSE__LOOPTEMP_
:
11181 case OMP_CLAUSE__SIMDUID_
:
11182 case OMP_CLAUSE__CILK_FOR_COUNT_
:
11183 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 0));
11186 case OMP_CLAUSE_NOWAIT
:
11187 case OMP_CLAUSE_ORDERED
:
11188 case OMP_CLAUSE_DEFAULT
:
11189 case OMP_CLAUSE_UNTIED
:
11190 case OMP_CLAUSE_MERGEABLE
:
11191 case OMP_CLAUSE_PROC_BIND
:
11192 case OMP_CLAUSE_INBRANCH
:
11193 case OMP_CLAUSE_NOTINBRANCH
:
11194 case OMP_CLAUSE_FOR
:
11195 case OMP_CLAUSE_PARALLEL
:
11196 case OMP_CLAUSE_SECTIONS
:
11197 case OMP_CLAUSE_TASKGROUP
:
11198 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11200 case OMP_CLAUSE_LASTPRIVATE
:
11201 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
11202 WALK_SUBTREE (OMP_CLAUSE_LASTPRIVATE_STMT (*tp
));
11203 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11205 case OMP_CLAUSE_COLLAPSE
:
11208 for (i
= 0; i
< 3; i
++)
11209 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
11210 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11213 case OMP_CLAUSE_LINEAR
:
11214 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
11215 WALK_SUBTREE (OMP_CLAUSE_LINEAR_STEP (*tp
));
11216 WALK_SUBTREE (OMP_CLAUSE_LINEAR_STMT (*tp
));
11217 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11219 case OMP_CLAUSE_ALIGNED
:
11220 case OMP_CLAUSE_FROM
:
11221 case OMP_CLAUSE_TO
:
11222 case OMP_CLAUSE_MAP
:
11223 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
11224 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 1));
11225 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11227 case OMP_CLAUSE_REDUCTION
:
11230 for (i
= 0; i
< 4; i
++)
11231 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
11232 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11236 gcc_unreachable ();
11244 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
11245 But, we only want to walk once. */
11246 len
= (TREE_OPERAND (*tp
, 3) == TREE_OPERAND (*tp
, 1)) ? 2 : 3;
11247 for (i
= 0; i
< len
; ++i
)
11248 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
11249 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
));
11253 /* If this is a TYPE_DECL, walk into the fields of the type that it's
11254 defining. We only want to walk into these fields of a type in this
11255 case and not in the general case of a mere reference to the type.
11257 The criterion is as follows: if the field can be an expression, it
11258 must be walked only here. This should be in keeping with the fields
11259 that are directly gimplified in gimplify_type_sizes in order for the
11260 mark/copy-if-shared/unmark machinery of the gimplifier to work with
11261 variable-sized types.
11263 Note that DECLs get walked as part of processing the BIND_EXPR. */
11264 if (TREE_CODE (DECL_EXPR_DECL (*tp
)) == TYPE_DECL
)
11266 tree
*type_p
= &TREE_TYPE (DECL_EXPR_DECL (*tp
));
11267 if (TREE_CODE (*type_p
) == ERROR_MARK
)
11270 /* Call the function for the type. See if it returns anything or
11271 doesn't want us to continue. If we are to continue, walk both
11272 the normal fields and those for the declaration case. */
11273 result
= (*func
) (type_p
, &walk_subtrees
, data
);
11274 if (result
|| !walk_subtrees
)
11277 /* But do not walk a pointed-to type since it may itself need to
11278 be walked in the declaration case if it isn't anonymous. */
11279 if (!POINTER_TYPE_P (*type_p
))
11281 result
= walk_type_fields (*type_p
, func
, data
, pset
, lh
);
11286 /* If this is a record type, also walk the fields. */
11287 if (RECORD_OR_UNION_TYPE_P (*type_p
))
11291 for (field
= TYPE_FIELDS (*type_p
); field
;
11292 field
= DECL_CHAIN (field
))
11294 /* We'd like to look at the type of the field, but we can
11295 easily get infinite recursion. So assume it's pointed
11296 to elsewhere in the tree. Also, ignore things that
11298 if (TREE_CODE (field
) != FIELD_DECL
)
11301 WALK_SUBTREE (DECL_FIELD_OFFSET (field
));
11302 WALK_SUBTREE (DECL_SIZE (field
));
11303 WALK_SUBTREE (DECL_SIZE_UNIT (field
));
11304 if (TREE_CODE (*type_p
) == QUAL_UNION_TYPE
)
11305 WALK_SUBTREE (DECL_QUALIFIER (field
));
11309 /* Same for scalar types. */
11310 else if (TREE_CODE (*type_p
) == BOOLEAN_TYPE
11311 || TREE_CODE (*type_p
) == ENUMERAL_TYPE
11312 || TREE_CODE (*type_p
) == INTEGER_TYPE
11313 || TREE_CODE (*type_p
) == FIXED_POINT_TYPE
11314 || TREE_CODE (*type_p
) == REAL_TYPE
)
11316 WALK_SUBTREE (TYPE_MIN_VALUE (*type_p
));
11317 WALK_SUBTREE (TYPE_MAX_VALUE (*type_p
));
11320 WALK_SUBTREE (TYPE_SIZE (*type_p
));
11321 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p
));
11326 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code
)))
11330 /* Walk over all the sub-trees of this operand. */
11331 len
= TREE_OPERAND_LENGTH (*tp
);
11333 /* Go through the subtrees. We need to do this in forward order so
11334 that the scope of a FOR_EXPR is handled properly. */
11337 for (i
= 0; i
< len
- 1; ++i
)
11338 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
11339 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
- 1));
11342 /* If this is a type, walk the needed fields in the type. */
11343 else if (TYPE_P (*tp
))
11344 return walk_type_fields (*tp
, func
, data
, pset
, lh
);
11348 /* We didn't find what we were looking for. */
11351 #undef WALK_SUBTREE_TAIL
11353 #undef WALK_SUBTREE
11355 /* Like walk_tree, but does not walk duplicate nodes more than once. */
11358 walk_tree_without_duplicates_1 (tree
*tp
, walk_tree_fn func
, void *data
,
11363 hash_set
<tree
> pset
;
11364 result
= walk_tree_1 (tp
, func
, data
, &pset
, lh
);
11370 tree_block (tree t
)
11372 const enum tree_code_class c
= TREE_CODE_CLASS (TREE_CODE (t
));
11374 if (IS_EXPR_CODE_CLASS (c
))
11375 return LOCATION_BLOCK (t
->exp
.locus
);
11376 gcc_unreachable ();
11381 tree_set_block (tree t
, tree b
)
11383 const enum tree_code_class c
= TREE_CODE_CLASS (TREE_CODE (t
));
11385 if (IS_EXPR_CODE_CLASS (c
))
11388 t
->exp
.locus
= COMBINE_LOCATION_DATA (line_table
, t
->exp
.locus
, b
);
11390 t
->exp
.locus
= LOCATION_LOCUS (t
->exp
.locus
);
11393 gcc_unreachable ();
11396 /* Create a nameless artificial label and put it in the current
11397 function context. The label has a location of LOC. Returns the
11398 newly created label. */
11401 create_artificial_label (location_t loc
)
11403 tree lab
= build_decl (loc
,
11404 LABEL_DECL
, NULL_TREE
, void_type_node
);
11406 DECL_ARTIFICIAL (lab
) = 1;
11407 DECL_IGNORED_P (lab
) = 1;
11408 DECL_CONTEXT (lab
) = current_function_decl
;
11412 /* Given a tree, try to return a useful variable name that we can use
11413 to prefix a temporary that is being assigned the value of the tree.
11414 I.E. given <temp> = &A, return A. */
11419 tree stripped_decl
;
11422 STRIP_NOPS (stripped_decl
);
11423 if (DECL_P (stripped_decl
) && DECL_NAME (stripped_decl
))
11424 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl
));
11425 else if (TREE_CODE (stripped_decl
) == SSA_NAME
)
11427 tree name
= SSA_NAME_IDENTIFIER (stripped_decl
);
11430 return IDENTIFIER_POINTER (name
);
11434 switch (TREE_CODE (stripped_decl
))
11437 return get_name (TREE_OPERAND (stripped_decl
, 0));
11444 /* Return true if TYPE has a variable argument list. */
11447 stdarg_p (const_tree fntype
)
11449 function_args_iterator args_iter
;
11450 tree n
= NULL_TREE
, t
;
11455 FOREACH_FUNCTION_ARGS (fntype
, t
, args_iter
)
11460 return n
!= NULL_TREE
&& n
!= void_type_node
;
11463 /* Return true if TYPE has a prototype. */
11466 prototype_p (tree fntype
)
11470 gcc_assert (fntype
!= NULL_TREE
);
11472 t
= TYPE_ARG_TYPES (fntype
);
11473 return (t
!= NULL_TREE
);
11476 /* If BLOCK is inlined from an __attribute__((__artificial__))
11477 routine, return pointer to location from where it has been
11480 block_nonartificial_location (tree block
)
11482 location_t
*ret
= NULL
;
11484 while (block
&& TREE_CODE (block
) == BLOCK
11485 && BLOCK_ABSTRACT_ORIGIN (block
))
11487 tree ao
= BLOCK_ABSTRACT_ORIGIN (block
);
11489 while (TREE_CODE (ao
) == BLOCK
11490 && BLOCK_ABSTRACT_ORIGIN (ao
)
11491 && BLOCK_ABSTRACT_ORIGIN (ao
) != ao
)
11492 ao
= BLOCK_ABSTRACT_ORIGIN (ao
);
11494 if (TREE_CODE (ao
) == FUNCTION_DECL
)
11496 /* If AO is an artificial inline, point RET to the
11497 call site locus at which it has been inlined and continue
11498 the loop, in case AO's caller is also an artificial
11500 if (DECL_DECLARED_INLINE_P (ao
)
11501 && lookup_attribute ("artificial", DECL_ATTRIBUTES (ao
)))
11502 ret
= &BLOCK_SOURCE_LOCATION (block
);
11506 else if (TREE_CODE (ao
) != BLOCK
)
11509 block
= BLOCK_SUPERCONTEXT (block
);
11515 /* If EXP is inlined from an __attribute__((__artificial__))
11516 function, return the location of the original call expression. */
11519 tree_nonartificial_location (tree exp
)
11521 location_t
*loc
= block_nonartificial_location (TREE_BLOCK (exp
));
11526 return EXPR_LOCATION (exp
);
11530 /* These are the hash table functions for the hash table of OPTIMIZATION_NODEq
11533 /* Return the hash code code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
11536 cl_option_hasher::hash (tree x
)
11538 const_tree
const t
= x
;
11542 hashval_t hash
= 0;
11544 if (TREE_CODE (t
) == OPTIMIZATION_NODE
)
11546 p
= (const char *)TREE_OPTIMIZATION (t
);
11547 len
= sizeof (struct cl_optimization
);
11550 else if (TREE_CODE (t
) == TARGET_OPTION_NODE
)
11551 return cl_target_option_hash (TREE_TARGET_OPTION (t
));
11554 gcc_unreachable ();
11556 /* assume most opt flags are just 0/1, some are 2-3, and a few might be
11558 for (i
= 0; i
< len
; i
++)
11560 hash
= (hash
<< 4) ^ ((i
<< 2) | p
[i
]);
11565 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
11566 TARGET_OPTION tree node) is the same as that given by *Y, which is the
11570 cl_option_hasher::equal (tree x
, tree y
)
11572 const_tree
const xt
= x
;
11573 const_tree
const yt
= y
;
11578 if (TREE_CODE (xt
) != TREE_CODE (yt
))
11581 if (TREE_CODE (xt
) == OPTIMIZATION_NODE
)
11583 xp
= (const char *)TREE_OPTIMIZATION (xt
);
11584 yp
= (const char *)TREE_OPTIMIZATION (yt
);
11585 len
= sizeof (struct cl_optimization
);
11588 else if (TREE_CODE (xt
) == TARGET_OPTION_NODE
)
11590 return cl_target_option_eq (TREE_TARGET_OPTION (xt
),
11591 TREE_TARGET_OPTION (yt
));
11595 gcc_unreachable ();
11597 return (memcmp (xp
, yp
, len
) == 0);
11600 /* Build an OPTIMIZATION_NODE based on the options in OPTS. */
11603 build_optimization_node (struct gcc_options
*opts
)
11607 /* Use the cache of optimization nodes. */
11609 cl_optimization_save (TREE_OPTIMIZATION (cl_optimization_node
),
11612 tree
*slot
= cl_option_hash_table
->find_slot (cl_optimization_node
, INSERT
);
11616 /* Insert this one into the hash table. */
11617 t
= cl_optimization_node
;
11620 /* Make a new node for next time round. */
11621 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
11627 /* Build a TARGET_OPTION_NODE based on the options in OPTS. */
11630 build_target_option_node (struct gcc_options
*opts
)
11634 /* Use the cache of optimization nodes. */
11636 cl_target_option_save (TREE_TARGET_OPTION (cl_target_option_node
),
11639 tree
*slot
= cl_option_hash_table
->find_slot (cl_target_option_node
, INSERT
);
11643 /* Insert this one into the hash table. */
11644 t
= cl_target_option_node
;
11647 /* Make a new node for next time round. */
11648 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
11654 /* Clear TREE_TARGET_GLOBALS of all TARGET_OPTION_NODE trees,
11655 so that they aren't saved during PCH writing. */
11658 prepare_target_option_nodes_for_pch (void)
11660 hash_table
<cl_option_hasher
>::iterator iter
= cl_option_hash_table
->begin ();
11661 for (; iter
!= cl_option_hash_table
->end (); ++iter
)
11662 if (TREE_CODE (*iter
) == TARGET_OPTION_NODE
)
11663 TREE_TARGET_GLOBALS (*iter
) = NULL
;
11666 /* Determine the "ultimate origin" of a block. The block may be an inlined
11667 instance of an inlined instance of a block which is local to an inline
11668 function, so we have to trace all of the way back through the origin chain
11669 to find out what sort of node actually served as the original seed for the
11673 block_ultimate_origin (const_tree block
)
11675 tree immediate_origin
= BLOCK_ABSTRACT_ORIGIN (block
);
11677 /* BLOCK_ABSTRACT_ORIGIN can point to itself; ignore that if
11678 we're trying to output the abstract instance of this function. */
11679 if (BLOCK_ABSTRACT (block
) && immediate_origin
== block
)
11682 if (immediate_origin
== NULL_TREE
)
11687 tree lookahead
= immediate_origin
;
11691 ret_val
= lookahead
;
11692 lookahead
= (TREE_CODE (ret_val
) == BLOCK
11693 ? BLOCK_ABSTRACT_ORIGIN (ret_val
) : NULL
);
11695 while (lookahead
!= NULL
&& lookahead
!= ret_val
);
11697 /* The block's abstract origin chain may not be the *ultimate* origin of
11698 the block. It could lead to a DECL that has an abstract origin set.
11699 If so, we want that DECL's abstract origin (which is what DECL_ORIGIN
11700 will give us if it has one). Note that DECL's abstract origins are
11701 supposed to be the most distant ancestor (or so decl_ultimate_origin
11702 claims), so we don't need to loop following the DECL origins. */
11703 if (DECL_P (ret_val
))
11704 return DECL_ORIGIN (ret_val
);
11710 /* Return true iff conversion from INNER_TYPE to OUTER_TYPE generates
11714 tree_nop_conversion_p (const_tree outer_type
, const_tree inner_type
)
11716 /* Use precision rather then machine mode when we can, which gives
11717 the correct answer even for submode (bit-field) types. */
11718 if ((INTEGRAL_TYPE_P (outer_type
)
11719 || POINTER_TYPE_P (outer_type
)
11720 || TREE_CODE (outer_type
) == OFFSET_TYPE
)
11721 && (INTEGRAL_TYPE_P (inner_type
)
11722 || POINTER_TYPE_P (inner_type
)
11723 || TREE_CODE (inner_type
) == OFFSET_TYPE
))
11724 return TYPE_PRECISION (outer_type
) == TYPE_PRECISION (inner_type
);
11726 /* Otherwise fall back on comparing machine modes (e.g. for
11727 aggregate types, floats). */
11728 return TYPE_MODE (outer_type
) == TYPE_MODE (inner_type
);
11731 /* Return true iff conversion in EXP generates no instruction. Mark
11732 it inline so that we fully inline into the stripping functions even
11733 though we have two uses of this function. */
11736 tree_nop_conversion (const_tree exp
)
11738 tree outer_type
, inner_type
;
11740 if (!CONVERT_EXPR_P (exp
)
11741 && TREE_CODE (exp
) != NON_LVALUE_EXPR
)
11743 if (TREE_OPERAND (exp
, 0) == error_mark_node
)
11746 outer_type
= TREE_TYPE (exp
);
11747 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
11752 return tree_nop_conversion_p (outer_type
, inner_type
);
11755 /* Return true iff conversion in EXP generates no instruction. Don't
11756 consider conversions changing the signedness. */
11759 tree_sign_nop_conversion (const_tree exp
)
11761 tree outer_type
, inner_type
;
11763 if (!tree_nop_conversion (exp
))
11766 outer_type
= TREE_TYPE (exp
);
11767 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
11769 return (TYPE_UNSIGNED (outer_type
) == TYPE_UNSIGNED (inner_type
)
11770 && POINTER_TYPE_P (outer_type
) == POINTER_TYPE_P (inner_type
));
11773 /* Strip conversions from EXP according to tree_nop_conversion and
11774 return the resulting expression. */
11777 tree_strip_nop_conversions (tree exp
)
11779 while (tree_nop_conversion (exp
))
11780 exp
= TREE_OPERAND (exp
, 0);
11784 /* Strip conversions from EXP according to tree_sign_nop_conversion
11785 and return the resulting expression. */
11788 tree_strip_sign_nop_conversions (tree exp
)
11790 while (tree_sign_nop_conversion (exp
))
11791 exp
= TREE_OPERAND (exp
, 0);
11795 /* Avoid any floating point extensions from EXP. */
11797 strip_float_extensions (tree exp
)
11799 tree sub
, expt
, subt
;
11801 /* For floating point constant look up the narrowest type that can hold
11802 it properly and handle it like (type)(narrowest_type)constant.
11803 This way we can optimize for instance a=a*2.0 where "a" is float
11804 but 2.0 is double constant. */
11805 if (TREE_CODE (exp
) == REAL_CST
&& !DECIMAL_FLOAT_TYPE_P (TREE_TYPE (exp
)))
11807 REAL_VALUE_TYPE orig
;
11810 orig
= TREE_REAL_CST (exp
);
11811 if (TYPE_PRECISION (TREE_TYPE (exp
)) > TYPE_PRECISION (float_type_node
)
11812 && exact_real_truncate (TYPE_MODE (float_type_node
), &orig
))
11813 type
= float_type_node
;
11814 else if (TYPE_PRECISION (TREE_TYPE (exp
))
11815 > TYPE_PRECISION (double_type_node
)
11816 && exact_real_truncate (TYPE_MODE (double_type_node
), &orig
))
11817 type
= double_type_node
;
11819 return build_real (type
, real_value_truncate (TYPE_MODE (type
), orig
));
11822 if (!CONVERT_EXPR_P (exp
))
11825 sub
= TREE_OPERAND (exp
, 0);
11826 subt
= TREE_TYPE (sub
);
11827 expt
= TREE_TYPE (exp
);
11829 if (!FLOAT_TYPE_P (subt
))
11832 if (DECIMAL_FLOAT_TYPE_P (expt
) != DECIMAL_FLOAT_TYPE_P (subt
))
11835 if (TYPE_PRECISION (subt
) > TYPE_PRECISION (expt
))
11838 return strip_float_extensions (sub
);
11841 /* Strip out all handled components that produce invariant
11845 strip_invariant_refs (const_tree op
)
11847 while (handled_component_p (op
))
11849 switch (TREE_CODE (op
))
11852 case ARRAY_RANGE_REF
:
11853 if (!is_gimple_constant (TREE_OPERAND (op
, 1))
11854 || TREE_OPERAND (op
, 2) != NULL_TREE
11855 || TREE_OPERAND (op
, 3) != NULL_TREE
)
11859 case COMPONENT_REF
:
11860 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
11866 op
= TREE_OPERAND (op
, 0);
11872 static GTY(()) tree gcc_eh_personality_decl
;
11874 /* Return the GCC personality function decl. */
11877 lhd_gcc_personality (void)
11879 if (!gcc_eh_personality_decl
)
11880 gcc_eh_personality_decl
= build_personality_function ("gcc");
11881 return gcc_eh_personality_decl
;
11884 /* TARGET is a call target of GIMPLE call statement
11885 (obtained by gimple_call_fn). Return true if it is
11886 OBJ_TYPE_REF representing an virtual call of C++ method.
11887 (As opposed to OBJ_TYPE_REF representing objc calls
11888 through a cast where middle-end devirtualization machinery
11892 virtual_method_call_p (tree target
)
11894 if (TREE_CODE (target
) != OBJ_TYPE_REF
)
11896 tree t
= TREE_TYPE (target
);
11897 gcc_checking_assert (TREE_CODE (t
) == POINTER_TYPE
);
11899 if (TREE_CODE (t
) == FUNCTION_TYPE
)
11901 gcc_checking_assert (TREE_CODE (t
) == METHOD_TYPE
);
11902 /* If we do not have BINFO associated, it means that type was built
11903 without devirtualization enabled. Do not consider this a virtual
11905 if (!TYPE_BINFO (obj_type_ref_class (target
)))
11910 /* REF is OBJ_TYPE_REF, return the class the ref corresponds to. */
11913 obj_type_ref_class (tree ref
)
11915 gcc_checking_assert (TREE_CODE (ref
) == OBJ_TYPE_REF
);
11916 ref
= TREE_TYPE (ref
);
11917 gcc_checking_assert (TREE_CODE (ref
) == POINTER_TYPE
);
11918 ref
= TREE_TYPE (ref
);
11919 /* We look for type THIS points to. ObjC also builds
11920 OBJ_TYPE_REF with non-method calls, Their first parameter
11921 ID however also corresponds to class type. */
11922 gcc_checking_assert (TREE_CODE (ref
) == METHOD_TYPE
11923 || TREE_CODE (ref
) == FUNCTION_TYPE
);
11924 ref
= TREE_VALUE (TYPE_ARG_TYPES (ref
));
11925 gcc_checking_assert (TREE_CODE (ref
) == POINTER_TYPE
);
11926 return TREE_TYPE (ref
);
11929 /* Return true if T is in anonymous namespace. */
11932 type_in_anonymous_namespace_p (const_tree t
)
11934 /* TREE_PUBLIC of TYPE_STUB_DECL may not be properly set for
11935 bulitin types; those have CONTEXT NULL. */
11936 if (!TYPE_CONTEXT (t
))
11938 return (TYPE_STUB_DECL (t
) && !TREE_PUBLIC (TYPE_STUB_DECL (t
)));
11941 /* Try to find a base info of BINFO that would have its field decl at offset
11942 OFFSET within the BINFO type and which is of EXPECTED_TYPE. If it can be
11943 found, return, otherwise return NULL_TREE. */
11946 get_binfo_at_offset (tree binfo
, HOST_WIDE_INT offset
, tree expected_type
)
11948 tree type
= BINFO_TYPE (binfo
);
11952 HOST_WIDE_INT pos
, size
;
11956 if (types_same_for_odr (type
, expected_type
))
11961 for (fld
= TYPE_FIELDS (type
); fld
; fld
= DECL_CHAIN (fld
))
11963 if (TREE_CODE (fld
) != FIELD_DECL
|| !DECL_ARTIFICIAL (fld
))
11966 pos
= int_bit_position (fld
);
11967 size
= tree_to_uhwi (DECL_SIZE (fld
));
11968 if (pos
<= offset
&& (pos
+ size
) > offset
)
11971 if (!fld
|| TREE_CODE (TREE_TYPE (fld
)) != RECORD_TYPE
)
11974 /* Offset 0 indicates the primary base, whose vtable contents are
11975 represented in the binfo for the derived class. */
11976 else if (offset
!= 0)
11978 tree base_binfo
, binfo2
= binfo
;
11980 /* Find BINFO corresponding to FLD. This is bit harder
11981 by a fact that in virtual inheritance we may need to walk down
11982 the non-virtual inheritance chain. */
11985 tree containing_binfo
= NULL
, found_binfo
= NULL
;
11986 for (i
= 0; BINFO_BASE_ITERATE (binfo2
, i
, base_binfo
); i
++)
11987 if (types_same_for_odr (TREE_TYPE (base_binfo
), TREE_TYPE (fld
)))
11989 found_binfo
= base_binfo
;
11993 if ((tree_to_shwi (BINFO_OFFSET (base_binfo
))
11994 - tree_to_shwi (BINFO_OFFSET (binfo
)))
11995 * BITS_PER_UNIT
< pos
11996 /* Rule out types with no virtual methods or we can get confused
11997 here by zero sized bases. */
11998 && TYPE_BINFO (BINFO_TYPE (base_binfo
))
11999 && BINFO_VTABLE (TYPE_BINFO (BINFO_TYPE (base_binfo
)))
12000 && (!containing_binfo
12001 || (tree_to_shwi (BINFO_OFFSET (containing_binfo
))
12002 < tree_to_shwi (BINFO_OFFSET (base_binfo
)))))
12003 containing_binfo
= base_binfo
;
12006 binfo
= found_binfo
;
12009 if (!containing_binfo
)
12011 binfo2
= containing_binfo
;
12015 type
= TREE_TYPE (fld
);
12020 /* Returns true if X is a typedef decl. */
12023 is_typedef_decl (tree x
)
12025 return (x
&& TREE_CODE (x
) == TYPE_DECL
12026 && DECL_ORIGINAL_TYPE (x
) != NULL_TREE
);
12029 /* Returns true iff TYPE is a type variant created for a typedef. */
12032 typedef_variant_p (tree type
)
12034 return is_typedef_decl (TYPE_NAME (type
));
12037 /* Warn about a use of an identifier which was marked deprecated. */
12039 warn_deprecated_use (tree node
, tree attr
)
12043 if (node
== 0 || !warn_deprecated_decl
)
12049 attr
= DECL_ATTRIBUTES (node
);
12050 else if (TYPE_P (node
))
12052 tree decl
= TYPE_STUB_DECL (node
);
12054 attr
= lookup_attribute ("deprecated",
12055 TYPE_ATTRIBUTES (TREE_TYPE (decl
)));
12060 attr
= lookup_attribute ("deprecated", attr
);
12063 msg
= TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr
)));
12071 w
= warning (OPT_Wdeprecated_declarations
,
12072 "%qD is deprecated: %s", node
, msg
);
12074 w
= warning (OPT_Wdeprecated_declarations
,
12075 "%qD is deprecated", node
);
12077 inform (DECL_SOURCE_LOCATION (node
), "declared here");
12079 else if (TYPE_P (node
))
12081 tree what
= NULL_TREE
;
12082 tree decl
= TYPE_STUB_DECL (node
);
12084 if (TYPE_NAME (node
))
12086 if (TREE_CODE (TYPE_NAME (node
)) == IDENTIFIER_NODE
)
12087 what
= TYPE_NAME (node
);
12088 else if (TREE_CODE (TYPE_NAME (node
)) == TYPE_DECL
12089 && DECL_NAME (TYPE_NAME (node
)))
12090 what
= DECL_NAME (TYPE_NAME (node
));
12098 w
= warning (OPT_Wdeprecated_declarations
,
12099 "%qE is deprecated: %s", what
, msg
);
12101 w
= warning (OPT_Wdeprecated_declarations
,
12102 "%qE is deprecated", what
);
12107 w
= warning (OPT_Wdeprecated_declarations
,
12108 "type is deprecated: %s", msg
);
12110 w
= warning (OPT_Wdeprecated_declarations
,
12111 "type is deprecated");
12114 inform (DECL_SOURCE_LOCATION (decl
), "declared here");
12121 warning (OPT_Wdeprecated_declarations
, "%qE is deprecated: %s",
12124 warning (OPT_Wdeprecated_declarations
, "%qE is deprecated", what
);
12129 warning (OPT_Wdeprecated_declarations
, "type is deprecated: %s",
12132 warning (OPT_Wdeprecated_declarations
, "type is deprecated");
12138 /* Return true if REF has a COMPONENT_REF with a bit-field field declaration
12139 somewhere in it. */
12142 contains_bitfld_component_ref_p (const_tree ref
)
12144 while (handled_component_p (ref
))
12146 if (TREE_CODE (ref
) == COMPONENT_REF
12147 && DECL_BIT_FIELD (TREE_OPERAND (ref
, 1)))
12149 ref
= TREE_OPERAND (ref
, 0);
12155 /* Try to determine whether a TRY_CATCH expression can fall through.
12156 This is a subroutine of block_may_fallthru. */
12159 try_catch_may_fallthru (const_tree stmt
)
12161 tree_stmt_iterator i
;
12163 /* If the TRY block can fall through, the whole TRY_CATCH can
12165 if (block_may_fallthru (TREE_OPERAND (stmt
, 0)))
12168 i
= tsi_start (TREE_OPERAND (stmt
, 1));
12169 switch (TREE_CODE (tsi_stmt (i
)))
12172 /* We expect to see a sequence of CATCH_EXPR trees, each with a
12173 catch expression and a body. The whole TRY_CATCH may fall
12174 through iff any of the catch bodies falls through. */
12175 for (; !tsi_end_p (i
); tsi_next (&i
))
12177 if (block_may_fallthru (CATCH_BODY (tsi_stmt (i
))))
12182 case EH_FILTER_EXPR
:
12183 /* The exception filter expression only matters if there is an
12184 exception. If the exception does not match EH_FILTER_TYPES,
12185 we will execute EH_FILTER_FAILURE, and we will fall through
12186 if that falls through. If the exception does match
12187 EH_FILTER_TYPES, the stack unwinder will continue up the
12188 stack, so we will not fall through. We don't know whether we
12189 will throw an exception which matches EH_FILTER_TYPES or not,
12190 so we just ignore EH_FILTER_TYPES and assume that we might
12191 throw an exception which doesn't match. */
12192 return block_may_fallthru (EH_FILTER_FAILURE (tsi_stmt (i
)));
12195 /* This case represents statements to be executed when an
12196 exception occurs. Those statements are implicitly followed
12197 by a RESX statement to resume execution after the exception.
12198 So in this case the TRY_CATCH never falls through. */
12203 /* Try to determine if we can fall out of the bottom of BLOCK. This guess
12204 need not be 100% accurate; simply be conservative and return true if we
12205 don't know. This is used only to avoid stupidly generating extra code.
12206 If we're wrong, we'll just delete the extra code later. */
12209 block_may_fallthru (const_tree block
)
12211 /* This CONST_CAST is okay because expr_last returns its argument
12212 unmodified and we assign it to a const_tree. */
12213 const_tree stmt
= expr_last (CONST_CAST_TREE (block
));
12215 switch (stmt
? TREE_CODE (stmt
) : ERROR_MARK
)
12219 /* Easy cases. If the last statement of the block implies
12220 control transfer, then we can't fall through. */
12224 /* If SWITCH_LABELS is set, this is lowered, and represents a
12225 branch to a selected label and hence can not fall through.
12226 Otherwise SWITCH_BODY is set, and the switch can fall
12228 return SWITCH_LABELS (stmt
) == NULL_TREE
;
12231 if (block_may_fallthru (COND_EXPR_THEN (stmt
)))
12233 return block_may_fallthru (COND_EXPR_ELSE (stmt
));
12236 return block_may_fallthru (BIND_EXPR_BODY (stmt
));
12238 case TRY_CATCH_EXPR
:
12239 return try_catch_may_fallthru (stmt
);
12241 case TRY_FINALLY_EXPR
:
12242 /* The finally clause is always executed after the try clause,
12243 so if it does not fall through, then the try-finally will not
12244 fall through. Otherwise, if the try clause does not fall
12245 through, then when the finally clause falls through it will
12246 resume execution wherever the try clause was going. So the
12247 whole try-finally will only fall through if both the try
12248 clause and the finally clause fall through. */
12249 return (block_may_fallthru (TREE_OPERAND (stmt
, 0))
12250 && block_may_fallthru (TREE_OPERAND (stmt
, 1)));
12253 if (TREE_CODE (TREE_OPERAND (stmt
, 1)) == CALL_EXPR
)
12254 stmt
= TREE_OPERAND (stmt
, 1);
12260 /* Functions that do not return do not fall through. */
12261 return (call_expr_flags (stmt
) & ECF_NORETURN
) == 0;
12263 case CLEANUP_POINT_EXPR
:
12264 return block_may_fallthru (TREE_OPERAND (stmt
, 0));
12267 return block_may_fallthru (TREE_OPERAND (stmt
, 1));
12273 return lang_hooks
.block_may_fallthru (stmt
);
12277 /* True if we are using EH to handle cleanups. */
12278 static bool using_eh_for_cleanups_flag
= false;
12280 /* This routine is called from front ends to indicate eh should be used for
12283 using_eh_for_cleanups (void)
12285 using_eh_for_cleanups_flag
= true;
12288 /* Query whether EH is used for cleanups. */
12290 using_eh_for_cleanups_p (void)
12292 return using_eh_for_cleanups_flag
;
12295 /* Wrapper for tree_code_name to ensure that tree code is valid */
12297 get_tree_code_name (enum tree_code code
)
12299 const char *invalid
= "<invalid tree code>";
12301 if (code
>= MAX_TREE_CODES
)
12304 return tree_code_name
[code
];
12307 /* Drops the TREE_OVERFLOW flag from T. */
12310 drop_tree_overflow (tree t
)
12312 gcc_checking_assert (TREE_OVERFLOW (t
));
12314 /* For tree codes with a sharing machinery re-build the result. */
12315 if (TREE_CODE (t
) == INTEGER_CST
)
12316 return wide_int_to_tree (TREE_TYPE (t
), t
);
12318 /* Otherwise, as all tcc_constants are possibly shared, copy the node
12319 and drop the flag. */
12321 TREE_OVERFLOW (t
) = 0;
12325 /* Given a memory reference expression T, return its base address.
12326 The base address of a memory reference expression is the main
12327 object being referenced. For instance, the base address for
12328 'array[i].fld[j]' is 'array'. You can think of this as stripping
12329 away the offset part from a memory address.
12331 This function calls handled_component_p to strip away all the inner
12332 parts of the memory reference until it reaches the base object. */
12335 get_base_address (tree t
)
12337 while (handled_component_p (t
))
12338 t
= TREE_OPERAND (t
, 0);
12340 if ((TREE_CODE (t
) == MEM_REF
12341 || TREE_CODE (t
) == TARGET_MEM_REF
)
12342 && TREE_CODE (TREE_OPERAND (t
, 0)) == ADDR_EXPR
)
12343 t
= TREE_OPERAND (TREE_OPERAND (t
, 0), 0);
12345 /* ??? Either the alias oracle or all callers need to properly deal
12346 with WITH_SIZE_EXPRs before we can look through those. */
12347 if (TREE_CODE (t
) == WITH_SIZE_EXPR
)
12353 /* Return the machine mode of T. For vectors, returns the mode of the
12354 inner type. The main use case is to feed the result to HONOR_NANS,
12355 avoiding the BLKmode that a direct TYPE_MODE (T) might return. */
12358 element_mode (const_tree t
)
12362 if (VECTOR_TYPE_P (t
) || TREE_CODE (t
) == COMPLEX_TYPE
)
12364 return TYPE_MODE (t
);
12367 #include "gt-tree.h"