1 /* Language-independent node constructors for parse phase of GNU compiler.
2 Copyright (C) 1987-2014 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"
36 #include "stor-layout.h"
45 #include "hard-reg-set.h"
49 #include "toplev.h" /* get_random_seed */
51 #include "filenames.h"
54 #include "common/common-target.h"
55 #include "langhooks.h"
56 #include "tree-inline.h"
57 #include "tree-iterator.h"
59 #include "dominance.h"
61 #include "basic-block.h"
63 #include "tree-ssa-alias.h"
64 #include "internal-fn.h"
65 #include "gimple-expr.h"
68 #include "gimple-iterator.h"
70 #include "gimple-ssa.h"
72 #include "plugin-api.h"
75 #include "tree-phinodes.h"
76 #include "stringpool.h"
77 #include "tree-ssanames.h"
81 #include "tree-pass.h"
82 #include "langhooks-def.h"
83 #include "diagnostic.h"
84 #include "tree-diagnostic.h"
85 #include "tree-pretty-print.h"
92 /* Tree code classes. */
94 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) TYPE,
95 #define END_OF_BASE_TREE_CODES tcc_exceptional,
97 const enum tree_code_class tree_code_type
[] = {
98 #include "all-tree.def"
102 #undef END_OF_BASE_TREE_CODES
104 /* Table indexed by tree code giving number of expression
105 operands beyond the fixed part of the node structure.
106 Not used for types or decls. */
108 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) LENGTH,
109 #define END_OF_BASE_TREE_CODES 0,
111 const unsigned char tree_code_length
[] = {
112 #include "all-tree.def"
116 #undef END_OF_BASE_TREE_CODES
118 /* Names of tree components.
119 Used for printing out the tree and error messages. */
120 #define DEFTREECODE(SYM, NAME, TYPE, LEN) NAME,
121 #define END_OF_BASE_TREE_CODES "@dummy",
123 static const char *const tree_code_name
[] = {
124 #include "all-tree.def"
128 #undef END_OF_BASE_TREE_CODES
130 /* Each tree code class has an associated string representation.
131 These must correspond to the tree_code_class entries. */
133 const char *const tree_code_class_strings
[] =
148 /* obstack.[ch] explicitly declined to prototype this. */
149 extern int _obstack_allocated_p (struct obstack
*h
, void *obj
);
151 /* Statistics-gathering stuff. */
153 static int tree_code_counts
[MAX_TREE_CODES
];
154 int tree_node_counts
[(int) all_kinds
];
155 int tree_node_sizes
[(int) all_kinds
];
157 /* Keep in sync with tree.h:enum tree_node_kind. */
158 static const char * const tree_node_kind_names
[] = {
177 /* Unique id for next decl created. */
178 static GTY(()) int next_decl_uid
;
179 /* Unique id for next type created. */
180 static GTY(()) int next_type_uid
= 1;
181 /* Unique id for next debug decl created. Use negative numbers,
182 to catch erroneous uses. */
183 static GTY(()) int next_debug_decl_uid
;
185 /* Since we cannot rehash a type after it is in the table, we have to
186 keep the hash code. */
188 struct GTY(()) type_hash
{
193 /* Initial size of the hash table (rounded to next prime). */
194 #define TYPE_HASH_INITIAL_SIZE 1000
196 /* Now here is the hash table. When recording a type, it is added to
197 the slot whose index is the hash code. Note that the hash table is
198 used for several kinds of types (function types, array types and
199 array index range types, for now). While all these live in the
200 same table, they are completely independent, and the hash code is
201 computed differently for each of these. */
203 static GTY ((if_marked ("type_hash_marked_p"), param_is (struct type_hash
)))
204 htab_t type_hash_table
;
206 /* Hash table and temporary node for larger integer const values. */
207 static GTY (()) tree int_cst_node
;
209 struct int_cst_hasher
: ggc_cache_hasher
<tree
>
211 static hashval_t
hash (tree t
);
212 static bool equal (tree x
, tree y
);
215 static GTY ((cache
)) hash_table
<int_cst_hasher
> *int_cst_hash_table
;
217 /* Hash table for optimization flags and target option flags. Use the same
218 hash table for both sets of options. Nodes for building the current
219 optimization and target option nodes. The assumption is most of the time
220 the options created will already be in the hash table, so we avoid
221 allocating and freeing up a node repeatably. */
222 static GTY (()) tree cl_optimization_node
;
223 static GTY (()) tree cl_target_option_node
;
225 struct cl_option_hasher
: ggc_cache_hasher
<tree
>
227 static hashval_t
hash (tree t
);
228 static bool equal (tree x
, tree y
);
231 static GTY ((cache
)) hash_table
<cl_option_hasher
> *cl_option_hash_table
;
233 /* General tree->tree mapping structure for use in hash tables. */
236 static GTY ((if_marked ("tree_decl_map_marked_p"), param_is (struct tree_decl_map
)))
237 htab_t debug_expr_for_decl
;
239 static GTY ((if_marked ("tree_decl_map_marked_p"), param_is (struct tree_decl_map
)))
240 htab_t value_expr_for_decl
;
242 static GTY ((if_marked ("tree_vec_map_marked_p"), param_is (struct tree_vec_map
)))
243 htab_t debug_args_for_decl
;
245 static void set_type_quals (tree
, int);
246 static int type_hash_eq (const void *, const void *);
247 static hashval_t
type_hash_hash (const void *);
248 static void print_type_hash_statistics (void);
249 static void print_debug_expr_statistics (void);
250 static void print_value_expr_statistics (void);
251 static int type_hash_marked_p (const void *);
252 static void type_hash_list (const_tree
, inchash::hash
&);
253 static void attribute_hash_list (const_tree
, inchash::hash
&);
255 tree global_trees
[TI_MAX
];
256 tree integer_types
[itk_none
];
258 bool int_n_enabled_p
[NUM_INT_N_ENTS
];
259 struct int_n_trees_t int_n_trees
[NUM_INT_N_ENTS
];
261 unsigned char tree_contains_struct
[MAX_TREE_CODES
][64];
263 /* Number of operands for each OpenMP clause. */
264 unsigned const char omp_clause_num_ops
[] =
266 0, /* OMP_CLAUSE_ERROR */
267 1, /* OMP_CLAUSE_PRIVATE */
268 1, /* OMP_CLAUSE_SHARED */
269 1, /* OMP_CLAUSE_FIRSTPRIVATE */
270 2, /* OMP_CLAUSE_LASTPRIVATE */
271 4, /* OMP_CLAUSE_REDUCTION */
272 1, /* OMP_CLAUSE_COPYIN */
273 1, /* OMP_CLAUSE_COPYPRIVATE */
274 3, /* OMP_CLAUSE_LINEAR */
275 2, /* OMP_CLAUSE_ALIGNED */
276 1, /* OMP_CLAUSE_DEPEND */
277 1, /* OMP_CLAUSE_UNIFORM */
278 2, /* OMP_CLAUSE_FROM */
279 2, /* OMP_CLAUSE_TO */
280 2, /* OMP_CLAUSE_MAP */
281 1, /* OMP_CLAUSE__LOOPTEMP_ */
282 1, /* OMP_CLAUSE_IF */
283 1, /* OMP_CLAUSE_NUM_THREADS */
284 1, /* OMP_CLAUSE_SCHEDULE */
285 0, /* OMP_CLAUSE_NOWAIT */
286 0, /* OMP_CLAUSE_ORDERED */
287 0, /* OMP_CLAUSE_DEFAULT */
288 3, /* OMP_CLAUSE_COLLAPSE */
289 0, /* OMP_CLAUSE_UNTIED */
290 1, /* OMP_CLAUSE_FINAL */
291 0, /* OMP_CLAUSE_MERGEABLE */
292 1, /* OMP_CLAUSE_DEVICE */
293 1, /* OMP_CLAUSE_DIST_SCHEDULE */
294 0, /* OMP_CLAUSE_INBRANCH */
295 0, /* OMP_CLAUSE_NOTINBRANCH */
296 1, /* OMP_CLAUSE_NUM_TEAMS */
297 1, /* OMP_CLAUSE_THREAD_LIMIT */
298 0, /* OMP_CLAUSE_PROC_BIND */
299 1, /* OMP_CLAUSE_SAFELEN */
300 1, /* OMP_CLAUSE_SIMDLEN */
301 0, /* OMP_CLAUSE_FOR */
302 0, /* OMP_CLAUSE_PARALLEL */
303 0, /* OMP_CLAUSE_SECTIONS */
304 0, /* OMP_CLAUSE_TASKGROUP */
305 1, /* OMP_CLAUSE__SIMDUID_ */
306 1, /* OMP_CLAUSE__CILK_FOR_COUNT_ */
309 const char * const omp_clause_code_name
[] =
355 /* Return the tree node structure used by tree code CODE. */
357 static inline enum tree_node_structure_enum
358 tree_node_structure_for_code (enum tree_code code
)
360 switch (TREE_CODE_CLASS (code
))
362 case tcc_declaration
:
367 return TS_FIELD_DECL
;
373 return TS_LABEL_DECL
;
375 return TS_RESULT_DECL
;
376 case DEBUG_EXPR_DECL
:
379 return TS_CONST_DECL
;
383 return TS_FUNCTION_DECL
;
384 case TRANSLATION_UNIT_DECL
:
385 return TS_TRANSLATION_UNIT_DECL
;
387 return TS_DECL_NON_COMMON
;
391 return TS_TYPE_NON_COMMON
;
400 default: /* tcc_constant and tcc_exceptional */
405 /* tcc_constant cases. */
406 case VOID_CST
: return TS_TYPED
;
407 case INTEGER_CST
: return TS_INT_CST
;
408 case REAL_CST
: return TS_REAL_CST
;
409 case FIXED_CST
: return TS_FIXED_CST
;
410 case COMPLEX_CST
: return TS_COMPLEX
;
411 case VECTOR_CST
: return TS_VECTOR
;
412 case STRING_CST
: return TS_STRING
;
413 /* tcc_exceptional cases. */
414 case ERROR_MARK
: return TS_COMMON
;
415 case IDENTIFIER_NODE
: return TS_IDENTIFIER
;
416 case TREE_LIST
: return TS_LIST
;
417 case TREE_VEC
: return TS_VEC
;
418 case SSA_NAME
: return TS_SSA_NAME
;
419 case PLACEHOLDER_EXPR
: return TS_COMMON
;
420 case STATEMENT_LIST
: return TS_STATEMENT_LIST
;
421 case BLOCK
: return TS_BLOCK
;
422 case CONSTRUCTOR
: return TS_CONSTRUCTOR
;
423 case TREE_BINFO
: return TS_BINFO
;
424 case OMP_CLAUSE
: return TS_OMP_CLAUSE
;
425 case OPTIMIZATION_NODE
: return TS_OPTIMIZATION
;
426 case TARGET_OPTION_NODE
: return TS_TARGET_OPTION
;
434 /* Initialize tree_contains_struct to describe the hierarchy of tree
438 initialize_tree_contains_struct (void)
442 for (i
= ERROR_MARK
; i
< LAST_AND_UNUSED_TREE_CODE
; i
++)
445 enum tree_node_structure_enum ts_code
;
447 code
= (enum tree_code
) i
;
448 ts_code
= tree_node_structure_for_code (code
);
450 /* Mark the TS structure itself. */
451 tree_contains_struct
[code
][ts_code
] = 1;
453 /* Mark all the structures that TS is derived from. */
471 case TS_STATEMENT_LIST
:
472 MARK_TS_TYPED (code
);
476 case TS_DECL_MINIMAL
:
482 case TS_OPTIMIZATION
:
483 case TS_TARGET_OPTION
:
484 MARK_TS_COMMON (code
);
487 case TS_TYPE_WITH_LANG_SPECIFIC
:
488 MARK_TS_TYPE_COMMON (code
);
491 case TS_TYPE_NON_COMMON
:
492 MARK_TS_TYPE_WITH_LANG_SPECIFIC (code
);
496 MARK_TS_DECL_MINIMAL (code
);
501 MARK_TS_DECL_COMMON (code
);
504 case TS_DECL_NON_COMMON
:
505 MARK_TS_DECL_WITH_VIS (code
);
508 case TS_DECL_WITH_VIS
:
512 MARK_TS_DECL_WRTL (code
);
516 MARK_TS_DECL_COMMON (code
);
520 MARK_TS_DECL_WITH_VIS (code
);
524 case TS_FUNCTION_DECL
:
525 MARK_TS_DECL_NON_COMMON (code
);
528 case TS_TRANSLATION_UNIT_DECL
:
529 MARK_TS_DECL_COMMON (code
);
537 /* Basic consistency checks for attributes used in fold. */
538 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_NON_COMMON
]);
539 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_NON_COMMON
]);
540 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_DECL_COMMON
]);
541 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_COMMON
]);
542 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_COMMON
]);
543 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_COMMON
]);
544 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_COMMON
]);
545 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_COMMON
]);
546 gcc_assert (tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_COMMON
]);
547 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_COMMON
]);
548 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_DECL_COMMON
]);
549 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_WRTL
]);
550 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_WRTL
]);
551 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_WRTL
]);
552 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WRTL
]);
553 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_WRTL
]);
554 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_DECL_MINIMAL
]);
555 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_MINIMAL
]);
556 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_MINIMAL
]);
557 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_MINIMAL
]);
558 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_MINIMAL
]);
559 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_MINIMAL
]);
560 gcc_assert (tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_MINIMAL
]);
561 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_MINIMAL
]);
562 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_DECL_MINIMAL
]);
563 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_WITH_VIS
]);
564 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WITH_VIS
]);
565 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_WITH_VIS
]);
566 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_VAR_DECL
]);
567 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_FIELD_DECL
]);
568 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_PARM_DECL
]);
569 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_LABEL_DECL
]);
570 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_RESULT_DECL
]);
571 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_CONST_DECL
]);
572 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_TYPE_DECL
]);
573 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_FUNCTION_DECL
]);
574 gcc_assert (tree_contains_struct
[IMPORTED_DECL
][TS_DECL_MINIMAL
]);
575 gcc_assert (tree_contains_struct
[IMPORTED_DECL
][TS_DECL_COMMON
]);
576 gcc_assert (tree_contains_struct
[NAMELIST_DECL
][TS_DECL_MINIMAL
]);
577 gcc_assert (tree_contains_struct
[NAMELIST_DECL
][TS_DECL_COMMON
]);
586 /* Initialize the hash table of types. */
587 type_hash_table
= htab_create_ggc (TYPE_HASH_INITIAL_SIZE
, type_hash_hash
,
590 debug_expr_for_decl
= htab_create_ggc (512, tree_decl_map_hash
,
591 tree_decl_map_eq
, 0);
593 value_expr_for_decl
= htab_create_ggc (512, tree_decl_map_hash
,
594 tree_decl_map_eq
, 0);
596 int_cst_hash_table
= hash_table
<int_cst_hasher
>::create_ggc (1024);
598 int_cst_node
= make_int_cst (1, 1);
600 cl_option_hash_table
= hash_table
<cl_option_hasher
>::create_ggc (64);
602 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
603 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
605 /* Initialize the tree_contains_struct array. */
606 initialize_tree_contains_struct ();
607 lang_hooks
.init_ts ();
611 /* The name of the object as the assembler will see it (but before any
612 translations made by ASM_OUTPUT_LABELREF). Often this is the same
613 as DECL_NAME. It is an IDENTIFIER_NODE. */
615 decl_assembler_name (tree decl
)
617 if (!DECL_ASSEMBLER_NAME_SET_P (decl
))
618 lang_hooks
.set_decl_assembler_name (decl
);
619 return DECL_WITH_VIS_CHECK (decl
)->decl_with_vis
.assembler_name
;
622 /* When the target supports COMDAT groups, this indicates which group the
623 DECL is associated with. This can be either an IDENTIFIER_NODE or a
624 decl, in which case its DECL_ASSEMBLER_NAME identifies the group. */
626 decl_comdat_group (const_tree node
)
628 struct symtab_node
*snode
= symtab_node::get (node
);
631 return snode
->get_comdat_group ();
634 /* Likewise, but make sure it's been reduced to an IDENTIFIER_NODE. */
636 decl_comdat_group_id (const_tree node
)
638 struct symtab_node
*snode
= symtab_node::get (node
);
641 return snode
->get_comdat_group_id ();
644 /* When the target supports named section, return its name as IDENTIFIER_NODE
645 or NULL if it is in no section. */
647 decl_section_name (const_tree node
)
649 struct symtab_node
*snode
= symtab_node::get (node
);
652 return snode
->get_section ();
655 /* Set section section name of NODE to VALUE (that is expected to
656 be identifier node) */
658 set_decl_section_name (tree node
, const char *value
)
660 struct symtab_node
*snode
;
664 snode
= symtab_node::get (node
);
668 else if (TREE_CODE (node
) == VAR_DECL
)
669 snode
= varpool_node::get_create (node
);
671 snode
= cgraph_node::get_create (node
);
672 snode
->set_section (value
);
675 /* Return TLS model of a variable NODE. */
677 decl_tls_model (const_tree node
)
679 struct varpool_node
*snode
= varpool_node::get (node
);
681 return TLS_MODEL_NONE
;
682 return snode
->tls_model
;
685 /* Set TLS model of variable NODE to MODEL. */
687 set_decl_tls_model (tree node
, enum tls_model model
)
689 struct varpool_node
*vnode
;
691 if (model
== TLS_MODEL_NONE
)
693 vnode
= varpool_node::get (node
);
698 vnode
= varpool_node::get_create (node
);
699 vnode
->tls_model
= model
;
702 /* Compute the number of bytes occupied by a tree with code CODE.
703 This function cannot be used for nodes that have variable sizes,
704 including TREE_VEC, INTEGER_CST, STRING_CST, and CALL_EXPR. */
706 tree_code_size (enum tree_code code
)
708 switch (TREE_CODE_CLASS (code
))
710 case tcc_declaration
: /* A decl node */
715 return sizeof (struct tree_field_decl
);
717 return sizeof (struct tree_parm_decl
);
719 return sizeof (struct tree_var_decl
);
721 return sizeof (struct tree_label_decl
);
723 return sizeof (struct tree_result_decl
);
725 return sizeof (struct tree_const_decl
);
727 return sizeof (struct tree_type_decl
);
729 return sizeof (struct tree_function_decl
);
730 case DEBUG_EXPR_DECL
:
731 return sizeof (struct tree_decl_with_rtl
);
732 case TRANSLATION_UNIT_DECL
:
733 return sizeof (struct tree_translation_unit_decl
);
737 return sizeof (struct tree_decl_non_common
);
739 return lang_hooks
.tree_size (code
);
743 case tcc_type
: /* a type node */
744 return sizeof (struct tree_type_non_common
);
746 case tcc_reference
: /* a reference */
747 case tcc_expression
: /* an expression */
748 case tcc_statement
: /* an expression with side effects */
749 case tcc_comparison
: /* a comparison expression */
750 case tcc_unary
: /* a unary arithmetic expression */
751 case tcc_binary
: /* a binary arithmetic expression */
752 return (sizeof (struct tree_exp
)
753 + (TREE_CODE_LENGTH (code
) - 1) * sizeof (tree
));
755 case tcc_constant
: /* a constant */
758 case VOID_CST
: return sizeof (struct tree_typed
);
759 case INTEGER_CST
: gcc_unreachable ();
760 case REAL_CST
: return sizeof (struct tree_real_cst
);
761 case FIXED_CST
: return sizeof (struct tree_fixed_cst
);
762 case COMPLEX_CST
: return sizeof (struct tree_complex
);
763 case VECTOR_CST
: return sizeof (struct tree_vector
);
764 case STRING_CST
: gcc_unreachable ();
766 return lang_hooks
.tree_size (code
);
769 case tcc_exceptional
: /* something random, like an identifier. */
772 case IDENTIFIER_NODE
: return lang_hooks
.identifier_size
;
773 case TREE_LIST
: return sizeof (struct tree_list
);
776 case PLACEHOLDER_EXPR
: return sizeof (struct tree_common
);
779 case OMP_CLAUSE
: gcc_unreachable ();
781 case SSA_NAME
: return sizeof (struct tree_ssa_name
);
783 case STATEMENT_LIST
: return sizeof (struct tree_statement_list
);
784 case BLOCK
: return sizeof (struct tree_block
);
785 case CONSTRUCTOR
: return sizeof (struct tree_constructor
);
786 case OPTIMIZATION_NODE
: return sizeof (struct tree_optimization_option
);
787 case TARGET_OPTION_NODE
: return sizeof (struct tree_target_option
);
790 return lang_hooks
.tree_size (code
);
798 /* Compute the number of bytes occupied by NODE. This routine only
799 looks at TREE_CODE, except for those nodes that have variable sizes. */
801 tree_size (const_tree node
)
803 const enum tree_code code
= TREE_CODE (node
);
807 return (sizeof (struct tree_int_cst
)
808 + (TREE_INT_CST_EXT_NUNITS (node
) - 1) * sizeof (HOST_WIDE_INT
));
811 return (offsetof (struct tree_binfo
, base_binfos
)
813 ::embedded_size (BINFO_N_BASE_BINFOS (node
)));
816 return (sizeof (struct tree_vec
)
817 + (TREE_VEC_LENGTH (node
) - 1) * sizeof (tree
));
820 return (sizeof (struct tree_vector
)
821 + (TYPE_VECTOR_SUBPARTS (TREE_TYPE (node
)) - 1) * sizeof (tree
));
824 return TREE_STRING_LENGTH (node
) + offsetof (struct tree_string
, str
) + 1;
827 return (sizeof (struct tree_omp_clause
)
828 + (omp_clause_num_ops
[OMP_CLAUSE_CODE (node
)] - 1)
832 if (TREE_CODE_CLASS (code
) == tcc_vl_exp
)
833 return (sizeof (struct tree_exp
)
834 + (VL_EXP_OPERAND_LENGTH (node
) - 1) * sizeof (tree
));
836 return tree_code_size (code
);
840 /* Record interesting allocation statistics for a tree node with CODE
844 record_node_allocation_statistics (enum tree_code code ATTRIBUTE_UNUSED
,
845 size_t length ATTRIBUTE_UNUSED
)
847 enum tree_code_class type
= TREE_CODE_CLASS (code
);
850 if (!GATHER_STATISTICS
)
855 case tcc_declaration
: /* A decl node */
859 case tcc_type
: /* a type node */
863 case tcc_statement
: /* an expression with side effects */
867 case tcc_reference
: /* a reference */
871 case tcc_expression
: /* an expression */
872 case tcc_comparison
: /* a comparison expression */
873 case tcc_unary
: /* a unary arithmetic expression */
874 case tcc_binary
: /* a binary arithmetic expression */
878 case tcc_constant
: /* a constant */
882 case tcc_exceptional
: /* something random, like an identifier. */
885 case IDENTIFIER_NODE
:
898 kind
= ssa_name_kind
;
910 kind
= omp_clause_kind
;
927 tree_code_counts
[(int) code
]++;
928 tree_node_counts
[(int) kind
]++;
929 tree_node_sizes
[(int) kind
] += length
;
932 /* Allocate and return a new UID from the DECL_UID namespace. */
935 allocate_decl_uid (void)
937 return next_decl_uid
++;
940 /* Return a newly allocated node of code CODE. For decl and type
941 nodes, some other fields are initialized. The rest of the node is
942 initialized to zero. This function cannot be used for TREE_VEC,
943 INTEGER_CST or OMP_CLAUSE nodes, which is enforced by asserts in
946 Achoo! I got a code in the node. */
949 make_node_stat (enum tree_code code MEM_STAT_DECL
)
952 enum tree_code_class type
= TREE_CODE_CLASS (code
);
953 size_t length
= tree_code_size (code
);
955 record_node_allocation_statistics (code
, length
);
957 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
958 TREE_SET_CODE (t
, code
);
963 TREE_SIDE_EFFECTS (t
) = 1;
966 case tcc_declaration
:
967 if (CODE_CONTAINS_STRUCT (code
, TS_DECL_COMMON
))
969 if (code
== FUNCTION_DECL
)
971 DECL_ALIGN (t
) = FUNCTION_BOUNDARY
;
972 DECL_MODE (t
) = FUNCTION_MODE
;
977 DECL_SOURCE_LOCATION (t
) = input_location
;
978 if (TREE_CODE (t
) == DEBUG_EXPR_DECL
)
979 DECL_UID (t
) = --next_debug_decl_uid
;
982 DECL_UID (t
) = allocate_decl_uid ();
983 SET_DECL_PT_UID (t
, -1);
985 if (TREE_CODE (t
) == LABEL_DECL
)
986 LABEL_DECL_UID (t
) = -1;
991 TYPE_UID (t
) = next_type_uid
++;
992 TYPE_ALIGN (t
) = BITS_PER_UNIT
;
993 TYPE_USER_ALIGN (t
) = 0;
994 TYPE_MAIN_VARIANT (t
) = t
;
995 TYPE_CANONICAL (t
) = t
;
997 /* Default to no attributes for type, but let target change that. */
998 TYPE_ATTRIBUTES (t
) = NULL_TREE
;
999 targetm
.set_default_type_attributes (t
);
1001 /* We have not yet computed the alias set for this type. */
1002 TYPE_ALIAS_SET (t
) = -1;
1006 TREE_CONSTANT (t
) = 1;
1009 case tcc_expression
:
1015 case PREDECREMENT_EXPR
:
1016 case PREINCREMENT_EXPR
:
1017 case POSTDECREMENT_EXPR
:
1018 case POSTINCREMENT_EXPR
:
1019 /* All of these have side-effects, no matter what their
1021 TREE_SIDE_EFFECTS (t
) = 1;
1030 /* Other classes need no special treatment. */
1037 /* Return a new node with the same contents as NODE except that its
1038 TREE_CHAIN, if it has one, is zero and it has a fresh uid. */
1041 copy_node_stat (tree node MEM_STAT_DECL
)
1044 enum tree_code code
= TREE_CODE (node
);
1047 gcc_assert (code
!= STATEMENT_LIST
);
1049 length
= tree_size (node
);
1050 record_node_allocation_statistics (code
, length
);
1051 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
1052 memcpy (t
, node
, length
);
1054 if (CODE_CONTAINS_STRUCT (code
, TS_COMMON
))
1056 TREE_ASM_WRITTEN (t
) = 0;
1057 TREE_VISITED (t
) = 0;
1059 if (TREE_CODE_CLASS (code
) == tcc_declaration
)
1061 if (code
== DEBUG_EXPR_DECL
)
1062 DECL_UID (t
) = --next_debug_decl_uid
;
1065 DECL_UID (t
) = allocate_decl_uid ();
1066 if (DECL_PT_UID_SET_P (node
))
1067 SET_DECL_PT_UID (t
, DECL_PT_UID (node
));
1069 if ((TREE_CODE (node
) == PARM_DECL
|| TREE_CODE (node
) == VAR_DECL
)
1070 && DECL_HAS_VALUE_EXPR_P (node
))
1072 SET_DECL_VALUE_EXPR (t
, DECL_VALUE_EXPR (node
));
1073 DECL_HAS_VALUE_EXPR_P (t
) = 1;
1075 /* DECL_DEBUG_EXPR is copied explicitely by callers. */
1076 if (TREE_CODE (node
) == VAR_DECL
)
1078 DECL_HAS_DEBUG_EXPR_P (t
) = 0;
1079 t
->decl_with_vis
.symtab_node
= NULL
;
1081 if (TREE_CODE (node
) == VAR_DECL
&& DECL_HAS_INIT_PRIORITY_P (node
))
1083 SET_DECL_INIT_PRIORITY (t
, DECL_INIT_PRIORITY (node
));
1084 DECL_HAS_INIT_PRIORITY_P (t
) = 1;
1086 if (TREE_CODE (node
) == FUNCTION_DECL
)
1088 DECL_STRUCT_FUNCTION (t
) = NULL
;
1089 t
->decl_with_vis
.symtab_node
= NULL
;
1092 else if (TREE_CODE_CLASS (code
) == tcc_type
)
1094 TYPE_UID (t
) = next_type_uid
++;
1095 /* The following is so that the debug code for
1096 the copy is different from the original type.
1097 The two statements usually duplicate each other
1098 (because they clear fields of the same union),
1099 but the optimizer should catch that. */
1100 TYPE_SYMTAB_POINTER (t
) = 0;
1101 TYPE_SYMTAB_ADDRESS (t
) = 0;
1103 /* Do not copy the values cache. */
1104 if (TYPE_CACHED_VALUES_P (t
))
1106 TYPE_CACHED_VALUES_P (t
) = 0;
1107 TYPE_CACHED_VALUES (t
) = NULL_TREE
;
1114 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
1115 For example, this can copy a list made of TREE_LIST nodes. */
1118 copy_list (tree list
)
1126 head
= prev
= copy_node (list
);
1127 next
= TREE_CHAIN (list
);
1130 TREE_CHAIN (prev
) = copy_node (next
);
1131 prev
= TREE_CHAIN (prev
);
1132 next
= TREE_CHAIN (next
);
1138 /* Return the value that TREE_INT_CST_EXT_NUNITS should have for an
1139 INTEGER_CST with value CST and type TYPE. */
1142 get_int_cst_ext_nunits (tree type
, const wide_int
&cst
)
1144 gcc_checking_assert (cst
.get_precision () == TYPE_PRECISION (type
));
1145 /* We need an extra zero HWI if CST is an unsigned integer with its
1146 upper bit set, and if CST occupies a whole number of HWIs. */
1147 if (TYPE_UNSIGNED (type
)
1149 && (cst
.get_precision () % HOST_BITS_PER_WIDE_INT
) == 0)
1150 return cst
.get_precision () / HOST_BITS_PER_WIDE_INT
+ 1;
1151 return cst
.get_len ();
1154 /* Return a new INTEGER_CST with value CST and type TYPE. */
1157 build_new_int_cst (tree type
, const wide_int
&cst
)
1159 unsigned int len
= cst
.get_len ();
1160 unsigned int ext_len
= get_int_cst_ext_nunits (type
, cst
);
1161 tree nt
= make_int_cst (len
, ext_len
);
1166 TREE_INT_CST_ELT (nt
, ext_len
) = 0;
1167 for (unsigned int i
= len
; i
< ext_len
; ++i
)
1168 TREE_INT_CST_ELT (nt
, i
) = -1;
1170 else if (TYPE_UNSIGNED (type
)
1171 && cst
.get_precision () < len
* HOST_BITS_PER_WIDE_INT
)
1174 TREE_INT_CST_ELT (nt
, len
)
1175 = zext_hwi (cst
.elt (len
),
1176 cst
.get_precision () % HOST_BITS_PER_WIDE_INT
);
1179 for (unsigned int i
= 0; i
< len
; i
++)
1180 TREE_INT_CST_ELT (nt
, i
) = cst
.elt (i
);
1181 TREE_TYPE (nt
) = type
;
1185 /* Create an INT_CST node with a LOW value sign extended to TYPE. */
1188 build_int_cst (tree type
, HOST_WIDE_INT low
)
1190 /* Support legacy code. */
1192 type
= integer_type_node
;
1194 return wide_int_to_tree (type
, wi::shwi (low
, TYPE_PRECISION (type
)));
1198 build_int_cstu (tree type
, unsigned HOST_WIDE_INT cst
)
1200 return wide_int_to_tree (type
, wi::uhwi (cst
, TYPE_PRECISION (type
)));
1203 /* Create an INT_CST node with a LOW value sign extended to TYPE. */
1206 build_int_cst_type (tree type
, HOST_WIDE_INT low
)
1209 return wide_int_to_tree (type
, wi::shwi (low
, TYPE_PRECISION (type
)));
1212 /* Constructs tree in type TYPE from with value given by CST. Signedness
1213 of CST is assumed to be the same as the signedness of TYPE. */
1216 double_int_to_tree (tree type
, double_int cst
)
1218 return wide_int_to_tree (type
, widest_int::from (cst
, TYPE_SIGN (type
)));
1221 /* We force the wide_int CST to the range of the type TYPE by sign or
1222 zero extending it. OVERFLOWABLE indicates if we are interested in
1223 overflow of the value, when >0 we are only interested in signed
1224 overflow, for <0 we are interested in any overflow. OVERFLOWED
1225 indicates whether overflow has already occurred. CONST_OVERFLOWED
1226 indicates whether constant overflow has already occurred. We force
1227 T's value to be within range of T's type (by setting to 0 or 1 all
1228 the bits outside the type's range). We set TREE_OVERFLOWED if,
1229 OVERFLOWED is nonzero,
1230 or OVERFLOWABLE is >0 and signed overflow occurs
1231 or OVERFLOWABLE is <0 and any overflow occurs
1232 We return a new tree node for the extended wide_int. The node
1233 is shared if no overflow flags are set. */
1237 force_fit_type (tree type
, const wide_int_ref
&cst
,
1238 int overflowable
, bool overflowed
)
1240 signop sign
= TYPE_SIGN (type
);
1242 /* If we need to set overflow flags, return a new unshared node. */
1243 if (overflowed
|| !wi::fits_to_tree_p (cst
, type
))
1247 || (overflowable
> 0 && sign
== SIGNED
))
1249 wide_int tmp
= wide_int::from (cst
, TYPE_PRECISION (type
), sign
);
1250 tree t
= build_new_int_cst (type
, tmp
);
1251 TREE_OVERFLOW (t
) = 1;
1256 /* Else build a shared node. */
1257 return wide_int_to_tree (type
, cst
);
1260 /* These are the hash table functions for the hash table of INTEGER_CST
1261 nodes of a sizetype. */
1263 /* Return the hash code code X, an INTEGER_CST. */
1266 int_cst_hasher::hash (tree x
)
1268 const_tree
const t
= x
;
1269 hashval_t code
= htab_hash_pointer (TREE_TYPE (t
));
1272 for (i
= 0; i
< TREE_INT_CST_NUNITS (t
); i
++)
1273 code
^= TREE_INT_CST_ELT (t
, i
);
1278 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
1279 is the same as that given by *Y, which is the same. */
1282 int_cst_hasher::equal (tree x
, tree y
)
1284 const_tree
const xt
= x
;
1285 const_tree
const yt
= y
;
1287 if (TREE_TYPE (xt
) != TREE_TYPE (yt
)
1288 || TREE_INT_CST_NUNITS (xt
) != TREE_INT_CST_NUNITS (yt
)
1289 || TREE_INT_CST_EXT_NUNITS (xt
) != TREE_INT_CST_EXT_NUNITS (yt
))
1292 for (int i
= 0; i
< TREE_INT_CST_NUNITS (xt
); i
++)
1293 if (TREE_INT_CST_ELT (xt
, i
) != TREE_INT_CST_ELT (yt
, i
))
1299 /* Create an INT_CST node of TYPE and value CST.
1300 The returned node is always shared. For small integers we use a
1301 per-type vector cache, for larger ones we use a single hash table.
1302 The value is extended from its precision according to the sign of
1303 the type to be a multiple of HOST_BITS_PER_WIDE_INT. This defines
1304 the upper bits and ensures that hashing and value equality based
1305 upon the underlying HOST_WIDE_INTs works without masking. */
1308 wide_int_to_tree (tree type
, const wide_int_ref
&pcst
)
1315 unsigned int prec
= TYPE_PRECISION (type
);
1316 signop sgn
= TYPE_SIGN (type
);
1318 /* Verify that everything is canonical. */
1319 int l
= pcst
.get_len ();
1322 if (pcst
.elt (l
- 1) == 0)
1323 gcc_checking_assert (pcst
.elt (l
- 2) < 0);
1324 if (pcst
.elt (l
- 1) == (HOST_WIDE_INT
) -1)
1325 gcc_checking_assert (pcst
.elt (l
- 2) >= 0);
1328 wide_int cst
= wide_int::from (pcst
, prec
, sgn
);
1329 unsigned int ext_len
= get_int_cst_ext_nunits (type
, cst
);
1333 /* We just need to store a single HOST_WIDE_INT. */
1335 if (TYPE_UNSIGNED (type
))
1336 hwi
= cst
.to_uhwi ();
1338 hwi
= cst
.to_shwi ();
1340 switch (TREE_CODE (type
))
1343 gcc_assert (hwi
== 0);
1347 case REFERENCE_TYPE
:
1348 case POINTER_BOUNDS_TYPE
:
1349 /* Cache NULL pointer and zero bounds. */
1358 /* Cache false or true. */
1366 if (TYPE_SIGN (type
) == UNSIGNED
)
1369 limit
= INTEGER_SHARE_LIMIT
;
1370 if (IN_RANGE (hwi
, 0, INTEGER_SHARE_LIMIT
- 1))
1375 /* Cache [-1, N). */
1376 limit
= INTEGER_SHARE_LIMIT
+ 1;
1377 if (IN_RANGE (hwi
, -1, INTEGER_SHARE_LIMIT
- 1))
1391 /* Look for it in the type's vector of small shared ints. */
1392 if (!TYPE_CACHED_VALUES_P (type
))
1394 TYPE_CACHED_VALUES_P (type
) = 1;
1395 TYPE_CACHED_VALUES (type
) = make_tree_vec (limit
);
1398 t
= TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
);
1400 /* Make sure no one is clobbering the shared constant. */
1401 gcc_checking_assert (TREE_TYPE (t
) == type
1402 && TREE_INT_CST_NUNITS (t
) == 1
1403 && TREE_INT_CST_OFFSET_NUNITS (t
) == 1
1404 && TREE_INT_CST_EXT_NUNITS (t
) == 1
1405 && TREE_INT_CST_ELT (t
, 0) == hwi
);
1408 /* Create a new shared int. */
1409 t
= build_new_int_cst (type
, cst
);
1410 TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) = t
;
1415 /* Use the cache of larger shared ints, using int_cst_node as
1418 TREE_INT_CST_ELT (int_cst_node
, 0) = hwi
;
1419 TREE_TYPE (int_cst_node
) = type
;
1421 tree
*slot
= int_cst_hash_table
->find_slot (int_cst_node
, INSERT
);
1425 /* Insert this one into the hash table. */
1428 /* Make a new node for next time round. */
1429 int_cst_node
= make_int_cst (1, 1);
1435 /* The value either hashes properly or we drop it on the floor
1436 for the gc to take care of. There will not be enough of them
1439 tree nt
= build_new_int_cst (type
, cst
);
1440 tree
*slot
= int_cst_hash_table
->find_slot (nt
, INSERT
);
1444 /* Insert this one into the hash table. */
1454 cache_integer_cst (tree t
)
1456 tree type
= TREE_TYPE (t
);
1459 int prec
= TYPE_PRECISION (type
);
1461 gcc_assert (!TREE_OVERFLOW (t
));
1463 switch (TREE_CODE (type
))
1466 gcc_assert (integer_zerop (t
));
1470 case REFERENCE_TYPE
:
1471 /* Cache NULL pointer. */
1472 if (integer_zerop (t
))
1480 /* Cache false or true. */
1482 if (wi::ltu_p (t
, 2))
1483 ix
= TREE_INT_CST_ELT (t
, 0);
1488 if (TYPE_UNSIGNED (type
))
1491 limit
= INTEGER_SHARE_LIMIT
;
1493 /* This is a little hokie, but if the prec is smaller than
1494 what is necessary to hold INTEGER_SHARE_LIMIT, then the
1495 obvious test will not get the correct answer. */
1496 if (prec
< HOST_BITS_PER_WIDE_INT
)
1498 if (tree_to_uhwi (t
) < (unsigned HOST_WIDE_INT
) INTEGER_SHARE_LIMIT
)
1499 ix
= tree_to_uhwi (t
);
1501 else if (wi::ltu_p (t
, INTEGER_SHARE_LIMIT
))
1502 ix
= tree_to_uhwi (t
);
1507 limit
= INTEGER_SHARE_LIMIT
+ 1;
1509 if (integer_minus_onep (t
))
1511 else if (!wi::neg_p (t
))
1513 if (prec
< HOST_BITS_PER_WIDE_INT
)
1515 if (tree_to_shwi (t
) < INTEGER_SHARE_LIMIT
)
1516 ix
= tree_to_shwi (t
) + 1;
1518 else if (wi::ltu_p (t
, INTEGER_SHARE_LIMIT
))
1519 ix
= tree_to_shwi (t
) + 1;
1533 /* Look for it in the type's vector of small shared ints. */
1534 if (!TYPE_CACHED_VALUES_P (type
))
1536 TYPE_CACHED_VALUES_P (type
) = 1;
1537 TYPE_CACHED_VALUES (type
) = make_tree_vec (limit
);
1540 gcc_assert (TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) == NULL_TREE
);
1541 TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) = t
;
1545 /* Use the cache of larger shared ints. */
1546 tree
*slot
= int_cst_hash_table
->find_slot (t
, INSERT
);
1547 /* If there is already an entry for the number verify it's the
1550 gcc_assert (wi::eq_p (tree (*slot
), t
));
1552 /* Otherwise insert this one into the hash table. */
1558 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
1559 and the rest are zeros. */
1562 build_low_bits_mask (tree type
, unsigned bits
)
1564 gcc_assert (bits
<= TYPE_PRECISION (type
));
1566 return wide_int_to_tree (type
, wi::mask (bits
, false,
1567 TYPE_PRECISION (type
)));
1570 /* Checks that X is integer constant that can be expressed in (unsigned)
1571 HOST_WIDE_INT without loss of precision. */
1574 cst_and_fits_in_hwi (const_tree x
)
1576 if (TREE_CODE (x
) != INTEGER_CST
)
1579 if (TYPE_PRECISION (TREE_TYPE (x
)) > HOST_BITS_PER_WIDE_INT
)
1582 return TREE_INT_CST_NUNITS (x
) == 1;
1585 /* Build a newly constructed TREE_VEC node of length LEN. */
1588 make_vector_stat (unsigned len MEM_STAT_DECL
)
1591 unsigned length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vector
);
1593 record_node_allocation_statistics (VECTOR_CST
, length
);
1595 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
1597 TREE_SET_CODE (t
, VECTOR_CST
);
1598 TREE_CONSTANT (t
) = 1;
1603 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1604 are in a list pointed to by VALS. */
1607 build_vector_stat (tree type
, tree
*vals MEM_STAT_DECL
)
1611 tree v
= make_vector (TYPE_VECTOR_SUBPARTS (type
));
1612 TREE_TYPE (v
) = type
;
1614 /* Iterate through elements and check for overflow. */
1615 for (cnt
= 0; cnt
< TYPE_VECTOR_SUBPARTS (type
); ++cnt
)
1617 tree value
= vals
[cnt
];
1619 VECTOR_CST_ELT (v
, cnt
) = value
;
1621 /* Don't crash if we get an address constant. */
1622 if (!CONSTANT_CLASS_P (value
))
1625 over
|= TREE_OVERFLOW (value
);
1628 TREE_OVERFLOW (v
) = over
;
1632 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1633 are extracted from V, a vector of CONSTRUCTOR_ELT. */
1636 build_vector_from_ctor (tree type
, vec
<constructor_elt
, va_gc
> *v
)
1638 tree
*vec
= XALLOCAVEC (tree
, TYPE_VECTOR_SUBPARTS (type
));
1639 unsigned HOST_WIDE_INT idx
;
1642 FOR_EACH_CONSTRUCTOR_VALUE (v
, idx
, value
)
1644 for (; idx
< TYPE_VECTOR_SUBPARTS (type
); ++idx
)
1645 vec
[idx
] = build_zero_cst (TREE_TYPE (type
));
1647 return build_vector (type
, vec
);
1650 /* Build a vector of type VECTYPE where all the elements are SCs. */
1652 build_vector_from_val (tree vectype
, tree sc
)
1654 int i
, nunits
= TYPE_VECTOR_SUBPARTS (vectype
);
1656 if (sc
== error_mark_node
)
1659 /* Verify that the vector type is suitable for SC. Note that there
1660 is some inconsistency in the type-system with respect to restrict
1661 qualifications of pointers. Vector types always have a main-variant
1662 element type and the qualification is applied to the vector-type.
1663 So TREE_TYPE (vector-type) does not return a properly qualified
1664 vector element-type. */
1665 gcc_checking_assert (types_compatible_p (TYPE_MAIN_VARIANT (TREE_TYPE (sc
)),
1666 TREE_TYPE (vectype
)));
1668 if (CONSTANT_CLASS_P (sc
))
1670 tree
*v
= XALLOCAVEC (tree
, nunits
);
1671 for (i
= 0; i
< nunits
; ++i
)
1673 return build_vector (vectype
, v
);
1677 vec
<constructor_elt
, va_gc
> *v
;
1678 vec_alloc (v
, nunits
);
1679 for (i
= 0; i
< nunits
; ++i
)
1680 CONSTRUCTOR_APPEND_ELT (v
, NULL_TREE
, sc
);
1681 return build_constructor (vectype
, v
);
1685 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1686 are in the vec pointed to by VALS. */
1688 build_constructor (tree type
, vec
<constructor_elt
, va_gc
> *vals
)
1690 tree c
= make_node (CONSTRUCTOR
);
1692 constructor_elt
*elt
;
1693 bool constant_p
= true;
1694 bool side_effects_p
= false;
1696 TREE_TYPE (c
) = type
;
1697 CONSTRUCTOR_ELTS (c
) = vals
;
1699 FOR_EACH_VEC_SAFE_ELT (vals
, i
, elt
)
1701 /* Mostly ctors will have elts that don't have side-effects, so
1702 the usual case is to scan all the elements. Hence a single
1703 loop for both const and side effects, rather than one loop
1704 each (with early outs). */
1705 if (!TREE_CONSTANT (elt
->value
))
1707 if (TREE_SIDE_EFFECTS (elt
->value
))
1708 side_effects_p
= true;
1711 TREE_SIDE_EFFECTS (c
) = side_effects_p
;
1712 TREE_CONSTANT (c
) = constant_p
;
1717 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
1720 build_constructor_single (tree type
, tree index
, tree value
)
1722 vec
<constructor_elt
, va_gc
> *v
;
1723 constructor_elt elt
= {index
, value
};
1726 v
->quick_push (elt
);
1728 return build_constructor (type
, v
);
1732 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1733 are in a list pointed to by VALS. */
1735 build_constructor_from_list (tree type
, tree vals
)
1738 vec
<constructor_elt
, va_gc
> *v
= NULL
;
1742 vec_alloc (v
, list_length (vals
));
1743 for (t
= vals
; t
; t
= TREE_CHAIN (t
))
1744 CONSTRUCTOR_APPEND_ELT (v
, TREE_PURPOSE (t
), TREE_VALUE (t
));
1747 return build_constructor (type
, v
);
1750 /* Return a new CONSTRUCTOR node whose type is TYPE. NELTS is the number
1751 of elements, provided as index/value pairs. */
1754 build_constructor_va (tree type
, int nelts
, ...)
1756 vec
<constructor_elt
, va_gc
> *v
= NULL
;
1759 va_start (p
, nelts
);
1760 vec_alloc (v
, nelts
);
1763 tree index
= va_arg (p
, tree
);
1764 tree value
= va_arg (p
, tree
);
1765 CONSTRUCTOR_APPEND_ELT (v
, index
, value
);
1768 return build_constructor (type
, v
);
1771 /* Return a new FIXED_CST node whose type is TYPE and value is F. */
1774 build_fixed (tree type
, FIXED_VALUE_TYPE f
)
1777 FIXED_VALUE_TYPE
*fp
;
1779 v
= make_node (FIXED_CST
);
1780 fp
= ggc_alloc
<fixed_value
> ();
1781 memcpy (fp
, &f
, sizeof (FIXED_VALUE_TYPE
));
1783 TREE_TYPE (v
) = type
;
1784 TREE_FIXED_CST_PTR (v
) = fp
;
1788 /* Return a new REAL_CST node whose type is TYPE and value is D. */
1791 build_real (tree type
, REAL_VALUE_TYPE d
)
1794 REAL_VALUE_TYPE
*dp
;
1797 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
1798 Consider doing it via real_convert now. */
1800 v
= make_node (REAL_CST
);
1801 dp
= ggc_alloc
<real_value
> ();
1802 memcpy (dp
, &d
, sizeof (REAL_VALUE_TYPE
));
1804 TREE_TYPE (v
) = type
;
1805 TREE_REAL_CST_PTR (v
) = dp
;
1806 TREE_OVERFLOW (v
) = overflow
;
1810 /* Return a new REAL_CST node whose type is TYPE
1811 and whose value is the integer value of the INTEGER_CST node I. */
1814 real_value_from_int_cst (const_tree type
, const_tree i
)
1818 /* Clear all bits of the real value type so that we can later do
1819 bitwise comparisons to see if two values are the same. */
1820 memset (&d
, 0, sizeof d
);
1822 real_from_integer (&d
, type
? TYPE_MODE (type
) : VOIDmode
, i
,
1823 TYPE_SIGN (TREE_TYPE (i
)));
1827 /* Given a tree representing an integer constant I, return a tree
1828 representing the same value as a floating-point constant of type TYPE. */
1831 build_real_from_int_cst (tree type
, const_tree i
)
1834 int overflow
= TREE_OVERFLOW (i
);
1836 v
= build_real (type
, real_value_from_int_cst (type
, i
));
1838 TREE_OVERFLOW (v
) |= overflow
;
1842 /* Return a newly constructed STRING_CST node whose value is
1843 the LEN characters at STR.
1844 Note that for a C string literal, LEN should include the trailing NUL.
1845 The TREE_TYPE is not initialized. */
1848 build_string (int len
, const char *str
)
1853 /* Do not waste bytes provided by padding of struct tree_string. */
1854 length
= len
+ offsetof (struct tree_string
, str
) + 1;
1856 record_node_allocation_statistics (STRING_CST
, length
);
1858 s
= (tree
) ggc_internal_alloc (length
);
1860 memset (s
, 0, sizeof (struct tree_typed
));
1861 TREE_SET_CODE (s
, STRING_CST
);
1862 TREE_CONSTANT (s
) = 1;
1863 TREE_STRING_LENGTH (s
) = len
;
1864 memcpy (s
->string
.str
, str
, len
);
1865 s
->string
.str
[len
] = '\0';
1870 /* Return a newly constructed COMPLEX_CST node whose value is
1871 specified by the real and imaginary parts REAL and IMAG.
1872 Both REAL and IMAG should be constant nodes. TYPE, if specified,
1873 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
1876 build_complex (tree type
, tree real
, tree imag
)
1878 tree t
= make_node (COMPLEX_CST
);
1880 TREE_REALPART (t
) = real
;
1881 TREE_IMAGPART (t
) = imag
;
1882 TREE_TYPE (t
) = type
? type
: build_complex_type (TREE_TYPE (real
));
1883 TREE_OVERFLOW (t
) = TREE_OVERFLOW (real
) | TREE_OVERFLOW (imag
);
1887 /* Return a constant of arithmetic type TYPE which is the
1888 multiplicative identity of the set TYPE. */
1891 build_one_cst (tree type
)
1893 switch (TREE_CODE (type
))
1895 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
1896 case POINTER_TYPE
: case REFERENCE_TYPE
:
1898 return build_int_cst (type
, 1);
1901 return build_real (type
, dconst1
);
1903 case FIXED_POINT_TYPE
:
1904 /* We can only generate 1 for accum types. */
1905 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type
)));
1906 return build_fixed (type
, FCONST1 (TYPE_MODE (type
)));
1910 tree scalar
= build_one_cst (TREE_TYPE (type
));
1912 return build_vector_from_val (type
, scalar
);
1916 return build_complex (type
,
1917 build_one_cst (TREE_TYPE (type
)),
1918 build_zero_cst (TREE_TYPE (type
)));
1925 /* Return an integer of type TYPE containing all 1's in as much precision as
1926 it contains, or a complex or vector whose subparts are such integers. */
1929 build_all_ones_cst (tree type
)
1931 if (TREE_CODE (type
) == COMPLEX_TYPE
)
1933 tree scalar
= build_all_ones_cst (TREE_TYPE (type
));
1934 return build_complex (type
, scalar
, scalar
);
1937 return build_minus_one_cst (type
);
1940 /* Return a constant of arithmetic type TYPE which is the
1941 opposite of the multiplicative identity of the set TYPE. */
1944 build_minus_one_cst (tree type
)
1946 switch (TREE_CODE (type
))
1948 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
1949 case POINTER_TYPE
: case REFERENCE_TYPE
:
1951 return build_int_cst (type
, -1);
1954 return build_real (type
, dconstm1
);
1956 case FIXED_POINT_TYPE
:
1957 /* We can only generate 1 for accum types. */
1958 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type
)));
1959 return build_fixed (type
, fixed_from_double_int (double_int_minus_one
,
1964 tree scalar
= build_minus_one_cst (TREE_TYPE (type
));
1966 return build_vector_from_val (type
, scalar
);
1970 return build_complex (type
,
1971 build_minus_one_cst (TREE_TYPE (type
)),
1972 build_zero_cst (TREE_TYPE (type
)));
1979 /* Build 0 constant of type TYPE. This is used by constructor folding
1980 and thus the constant should be represented in memory by
1984 build_zero_cst (tree type
)
1986 switch (TREE_CODE (type
))
1988 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
1989 case POINTER_TYPE
: case REFERENCE_TYPE
:
1990 case OFFSET_TYPE
: case NULLPTR_TYPE
:
1991 return build_int_cst (type
, 0);
1994 return build_real (type
, dconst0
);
1996 case FIXED_POINT_TYPE
:
1997 return build_fixed (type
, FCONST0 (TYPE_MODE (type
)));
2001 tree scalar
= build_zero_cst (TREE_TYPE (type
));
2003 return build_vector_from_val (type
, scalar
);
2008 tree zero
= build_zero_cst (TREE_TYPE (type
));
2010 return build_complex (type
, zero
, zero
);
2014 if (!AGGREGATE_TYPE_P (type
))
2015 return fold_convert (type
, integer_zero_node
);
2016 return build_constructor (type
, NULL
);
2021 /* Build a BINFO with LEN language slots. */
2024 make_tree_binfo_stat (unsigned base_binfos MEM_STAT_DECL
)
2027 size_t length
= (offsetof (struct tree_binfo
, base_binfos
)
2028 + vec
<tree
, va_gc
>::embedded_size (base_binfos
));
2030 record_node_allocation_statistics (TREE_BINFO
, length
);
2032 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
2034 memset (t
, 0, offsetof (struct tree_binfo
, base_binfos
));
2036 TREE_SET_CODE (t
, TREE_BINFO
);
2038 BINFO_BASE_BINFOS (t
)->embedded_init (base_binfos
);
2043 /* Create a CASE_LABEL_EXPR tree node and return it. */
2046 build_case_label (tree low_value
, tree high_value
, tree label_decl
)
2048 tree t
= make_node (CASE_LABEL_EXPR
);
2050 TREE_TYPE (t
) = void_type_node
;
2051 SET_EXPR_LOCATION (t
, DECL_SOURCE_LOCATION (label_decl
));
2053 CASE_LOW (t
) = low_value
;
2054 CASE_HIGH (t
) = high_value
;
2055 CASE_LABEL (t
) = label_decl
;
2056 CASE_CHAIN (t
) = NULL_TREE
;
2061 /* Build a newly constructed INTEGER_CST node. LEN and EXT_LEN are the
2062 values of TREE_INT_CST_NUNITS and TREE_INT_CST_EXT_NUNITS respectively.
2063 The latter determines the length of the HOST_WIDE_INT vector. */
2066 make_int_cst_stat (int len
, int ext_len MEM_STAT_DECL
)
2069 int length
= ((ext_len
- 1) * sizeof (HOST_WIDE_INT
)
2070 + sizeof (struct tree_int_cst
));
2073 record_node_allocation_statistics (INTEGER_CST
, length
);
2075 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
2077 TREE_SET_CODE (t
, INTEGER_CST
);
2078 TREE_INT_CST_NUNITS (t
) = len
;
2079 TREE_INT_CST_EXT_NUNITS (t
) = ext_len
;
2080 /* to_offset can only be applied to trees that are offset_int-sized
2081 or smaller. EXT_LEN is correct if it fits, otherwise the constant
2082 must be exactly the precision of offset_int and so LEN is correct. */
2083 if (ext_len
<= OFFSET_INT_ELTS
)
2084 TREE_INT_CST_OFFSET_NUNITS (t
) = ext_len
;
2086 TREE_INT_CST_OFFSET_NUNITS (t
) = len
;
2088 TREE_CONSTANT (t
) = 1;
2093 /* Build a newly constructed TREE_VEC node of length LEN. */
2096 make_tree_vec_stat (int len MEM_STAT_DECL
)
2099 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
2101 record_node_allocation_statistics (TREE_VEC
, length
);
2103 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
2105 TREE_SET_CODE (t
, TREE_VEC
);
2106 TREE_VEC_LENGTH (t
) = len
;
2111 /* Grow a TREE_VEC node to new length LEN. */
2114 grow_tree_vec_stat (tree v
, int len MEM_STAT_DECL
)
2116 gcc_assert (TREE_CODE (v
) == TREE_VEC
);
2118 int oldlen
= TREE_VEC_LENGTH (v
);
2119 gcc_assert (len
> oldlen
);
2121 int oldlength
= (oldlen
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
2122 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
2124 record_node_allocation_statistics (TREE_VEC
, length
- oldlength
);
2126 v
= (tree
) ggc_realloc (v
, length PASS_MEM_STAT
);
2128 TREE_VEC_LENGTH (v
) = len
;
2133 /* Return 1 if EXPR is the integer constant zero or a complex constant
2137 integer_zerop (const_tree expr
)
2141 switch (TREE_CODE (expr
))
2144 return wi::eq_p (expr
, 0);
2146 return (integer_zerop (TREE_REALPART (expr
))
2147 && integer_zerop (TREE_IMAGPART (expr
)));
2151 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2152 if (!integer_zerop (VECTOR_CST_ELT (expr
, i
)))
2161 /* Return 1 if EXPR is the integer constant one or the corresponding
2162 complex constant. */
2165 integer_onep (const_tree expr
)
2169 switch (TREE_CODE (expr
))
2172 return wi::eq_p (wi::to_widest (expr
), 1);
2174 return (integer_onep (TREE_REALPART (expr
))
2175 && integer_zerop (TREE_IMAGPART (expr
)));
2179 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2180 if (!integer_onep (VECTOR_CST_ELT (expr
, i
)))
2189 /* Return 1 if EXPR is the integer constant one. For complex and vector,
2190 return 1 if every piece is the integer constant one. */
2193 integer_each_onep (const_tree expr
)
2197 if (TREE_CODE (expr
) == COMPLEX_CST
)
2198 return (integer_onep (TREE_REALPART (expr
))
2199 && integer_onep (TREE_IMAGPART (expr
)));
2201 return integer_onep (expr
);
2204 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
2205 it contains, or a complex or vector whose subparts are such integers. */
2208 integer_all_onesp (const_tree expr
)
2212 if (TREE_CODE (expr
) == COMPLEX_CST
2213 && integer_all_onesp (TREE_REALPART (expr
))
2214 && integer_all_onesp (TREE_IMAGPART (expr
)))
2217 else if (TREE_CODE (expr
) == VECTOR_CST
)
2220 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2221 if (!integer_all_onesp (VECTOR_CST_ELT (expr
, i
)))
2226 else if (TREE_CODE (expr
) != INTEGER_CST
)
2229 return wi::max_value (TYPE_PRECISION (TREE_TYPE (expr
)), UNSIGNED
) == expr
;
2232 /* Return 1 if EXPR is the integer constant minus one. */
2235 integer_minus_onep (const_tree expr
)
2239 if (TREE_CODE (expr
) == COMPLEX_CST
)
2240 return (integer_all_onesp (TREE_REALPART (expr
))
2241 && integer_zerop (TREE_IMAGPART (expr
)));
2243 return integer_all_onesp (expr
);
2246 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
2250 integer_pow2p (const_tree expr
)
2254 if (TREE_CODE (expr
) == COMPLEX_CST
2255 && integer_pow2p (TREE_REALPART (expr
))
2256 && integer_zerop (TREE_IMAGPART (expr
)))
2259 if (TREE_CODE (expr
) != INTEGER_CST
)
2262 return wi::popcount (expr
) == 1;
2265 /* Return 1 if EXPR is an integer constant other than zero or a
2266 complex constant other than zero. */
2269 integer_nonzerop (const_tree expr
)
2273 return ((TREE_CODE (expr
) == INTEGER_CST
2274 && !wi::eq_p (expr
, 0))
2275 || (TREE_CODE (expr
) == COMPLEX_CST
2276 && (integer_nonzerop (TREE_REALPART (expr
))
2277 || integer_nonzerop (TREE_IMAGPART (expr
)))));
2280 /* Return 1 if EXPR is the integer constant one. For vector,
2281 return 1 if every piece is the integer constant minus one
2282 (representing the value TRUE). */
2285 integer_truep (const_tree expr
)
2289 if (TREE_CODE (expr
) == VECTOR_CST
)
2290 return integer_all_onesp (expr
);
2291 return integer_onep (expr
);
2294 /* Return 1 if EXPR is the fixed-point constant zero. */
2297 fixed_zerop (const_tree expr
)
2299 return (TREE_CODE (expr
) == FIXED_CST
2300 && TREE_FIXED_CST (expr
).data
.is_zero ());
2303 /* Return the power of two represented by a tree node known to be a
2307 tree_log2 (const_tree expr
)
2311 if (TREE_CODE (expr
) == COMPLEX_CST
)
2312 return tree_log2 (TREE_REALPART (expr
));
2314 return wi::exact_log2 (expr
);
2317 /* Similar, but return the largest integer Y such that 2 ** Y is less
2318 than or equal to EXPR. */
2321 tree_floor_log2 (const_tree expr
)
2325 if (TREE_CODE (expr
) == COMPLEX_CST
)
2326 return tree_log2 (TREE_REALPART (expr
));
2328 return wi::floor_log2 (expr
);
2331 /* Return number of known trailing zero bits in EXPR, or, if the value of
2332 EXPR is known to be zero, the precision of it's type. */
2335 tree_ctz (const_tree expr
)
2337 if (!INTEGRAL_TYPE_P (TREE_TYPE (expr
))
2338 && !POINTER_TYPE_P (TREE_TYPE (expr
)))
2341 unsigned int ret1
, ret2
, prec
= TYPE_PRECISION (TREE_TYPE (expr
));
2342 switch (TREE_CODE (expr
))
2345 ret1
= wi::ctz (expr
);
2346 return MIN (ret1
, prec
);
2348 ret1
= wi::ctz (get_nonzero_bits (expr
));
2349 return MIN (ret1
, prec
);
2356 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2359 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2360 return MIN (ret1
, ret2
);
2361 case POINTER_PLUS_EXPR
:
2362 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2363 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2364 /* Second operand is sizetype, which could be in theory
2365 wider than pointer's precision. Make sure we never
2366 return more than prec. */
2367 ret2
= MIN (ret2
, prec
);
2368 return MIN (ret1
, ret2
);
2370 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2371 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2372 return MAX (ret1
, ret2
);
2374 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2375 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2376 return MIN (ret1
+ ret2
, prec
);
2378 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2379 if (tree_fits_uhwi_p (TREE_OPERAND (expr
, 1))
2380 && (tree_to_uhwi (TREE_OPERAND (expr
, 1)) < prec
))
2382 ret2
= tree_to_uhwi (TREE_OPERAND (expr
, 1));
2383 return MIN (ret1
+ ret2
, prec
);
2387 if (tree_fits_uhwi_p (TREE_OPERAND (expr
, 1))
2388 && (tree_to_uhwi (TREE_OPERAND (expr
, 1)) < prec
))
2390 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2391 ret2
= tree_to_uhwi (TREE_OPERAND (expr
, 1));
2396 case TRUNC_DIV_EXPR
:
2398 case FLOOR_DIV_EXPR
:
2399 case ROUND_DIV_EXPR
:
2400 case EXACT_DIV_EXPR
:
2401 if (TREE_CODE (TREE_OPERAND (expr
, 1)) == INTEGER_CST
2402 && tree_int_cst_sgn (TREE_OPERAND (expr
, 1)) == 1)
2404 int l
= tree_log2 (TREE_OPERAND (expr
, 1));
2407 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2415 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2416 if (ret1
&& ret1
== TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (expr
, 0))))
2418 return MIN (ret1
, prec
);
2420 return tree_ctz (TREE_OPERAND (expr
, 0));
2422 ret1
= tree_ctz (TREE_OPERAND (expr
, 1));
2425 ret2
= tree_ctz (TREE_OPERAND (expr
, 2));
2426 return MIN (ret1
, ret2
);
2428 return tree_ctz (TREE_OPERAND (expr
, 1));
2430 ret1
= get_pointer_alignment (CONST_CAST_TREE (expr
));
2431 if (ret1
> BITS_PER_UNIT
)
2433 ret1
= ctz_hwi (ret1
/ BITS_PER_UNIT
);
2434 return MIN (ret1
, prec
);
2442 /* Return 1 if EXPR is the real constant zero. Trailing zeroes matter for
2443 decimal float constants, so don't return 1 for them. */
2446 real_zerop (const_tree expr
)
2450 switch (TREE_CODE (expr
))
2453 return REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst0
)
2454 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2456 return real_zerop (TREE_REALPART (expr
))
2457 && real_zerop (TREE_IMAGPART (expr
));
2461 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2462 if (!real_zerop (VECTOR_CST_ELT (expr
, i
)))
2471 /* Return 1 if EXPR is the real constant one in real or complex form.
2472 Trailing zeroes matter for decimal float constants, so don't return
2476 real_onep (const_tree expr
)
2480 switch (TREE_CODE (expr
))
2483 return REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst1
)
2484 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2486 return real_onep (TREE_REALPART (expr
))
2487 && real_zerop (TREE_IMAGPART (expr
));
2491 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2492 if (!real_onep (VECTOR_CST_ELT (expr
, i
)))
2501 /* Return 1 if EXPR is the real constant minus one. Trailing zeroes
2502 matter for decimal float constants, so don't return 1 for them. */
2505 real_minus_onep (const_tree expr
)
2509 switch (TREE_CODE (expr
))
2512 return REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconstm1
)
2513 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2515 return real_minus_onep (TREE_REALPART (expr
))
2516 && real_zerop (TREE_IMAGPART (expr
));
2520 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2521 if (!real_minus_onep (VECTOR_CST_ELT (expr
, i
)))
2530 /* Nonzero if EXP is a constant or a cast of a constant. */
2533 really_constant_p (const_tree exp
)
2535 /* This is not quite the same as STRIP_NOPS. It does more. */
2536 while (CONVERT_EXPR_P (exp
)
2537 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
2538 exp
= TREE_OPERAND (exp
, 0);
2539 return TREE_CONSTANT (exp
);
2542 /* Return first list element whose TREE_VALUE is ELEM.
2543 Return 0 if ELEM is not in LIST. */
2546 value_member (tree elem
, tree list
)
2550 if (elem
== TREE_VALUE (list
))
2552 list
= TREE_CHAIN (list
);
2557 /* Return first list element whose TREE_PURPOSE is ELEM.
2558 Return 0 if ELEM is not in LIST. */
2561 purpose_member (const_tree elem
, tree list
)
2565 if (elem
== TREE_PURPOSE (list
))
2567 list
= TREE_CHAIN (list
);
2572 /* Return true if ELEM is in V. */
2575 vec_member (const_tree elem
, vec
<tree
, va_gc
> *v
)
2579 FOR_EACH_VEC_SAFE_ELT (v
, ix
, t
)
2585 /* Returns element number IDX (zero-origin) of chain CHAIN, or
2589 chain_index (int idx
, tree chain
)
2591 for (; chain
&& idx
> 0; --idx
)
2592 chain
= TREE_CHAIN (chain
);
2596 /* Return nonzero if ELEM is part of the chain CHAIN. */
2599 chain_member (const_tree elem
, const_tree chain
)
2605 chain
= DECL_CHAIN (chain
);
2611 /* Return the length of a chain of nodes chained through TREE_CHAIN.
2612 We expect a null pointer to mark the end of the chain.
2613 This is the Lisp primitive `length'. */
2616 list_length (const_tree t
)
2619 #ifdef ENABLE_TREE_CHECKING
2627 #ifdef ENABLE_TREE_CHECKING
2630 gcc_assert (p
!= q
);
2638 /* Returns the first FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
2639 UNION_TYPE TYPE, or NULL_TREE if none. */
2642 first_field (const_tree type
)
2644 tree t
= TYPE_FIELDS (type
);
2645 while (t
&& TREE_CODE (t
) != FIELD_DECL
)
2650 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
2651 by modifying the last node in chain 1 to point to chain 2.
2652 This is the Lisp primitive `nconc'. */
2655 chainon (tree op1
, tree op2
)
2664 for (t1
= op1
; TREE_CHAIN (t1
); t1
= TREE_CHAIN (t1
))
2666 TREE_CHAIN (t1
) = op2
;
2668 #ifdef ENABLE_TREE_CHECKING
2671 for (t2
= op2
; t2
; t2
= TREE_CHAIN (t2
))
2672 gcc_assert (t2
!= t1
);
2679 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
2682 tree_last (tree chain
)
2686 while ((next
= TREE_CHAIN (chain
)))
2691 /* Reverse the order of elements in the chain T,
2692 and return the new head of the chain (old last element). */
2697 tree prev
= 0, decl
, next
;
2698 for (decl
= t
; decl
; decl
= next
)
2700 /* We shouldn't be using this function to reverse BLOCK chains; we
2701 have blocks_nreverse for that. */
2702 gcc_checking_assert (TREE_CODE (decl
) != BLOCK
);
2703 next
= TREE_CHAIN (decl
);
2704 TREE_CHAIN (decl
) = prev
;
2710 /* Return a newly created TREE_LIST node whose
2711 purpose and value fields are PARM and VALUE. */
2714 build_tree_list_stat (tree parm
, tree value MEM_STAT_DECL
)
2716 tree t
= make_node_stat (TREE_LIST PASS_MEM_STAT
);
2717 TREE_PURPOSE (t
) = parm
;
2718 TREE_VALUE (t
) = value
;
2722 /* Build a chain of TREE_LIST nodes from a vector. */
2725 build_tree_list_vec_stat (const vec
<tree
, va_gc
> *vec MEM_STAT_DECL
)
2727 tree ret
= NULL_TREE
;
2731 FOR_EACH_VEC_SAFE_ELT (vec
, i
, t
)
2733 *pp
= build_tree_list_stat (NULL
, t PASS_MEM_STAT
);
2734 pp
= &TREE_CHAIN (*pp
);
2739 /* Return a newly created TREE_LIST node whose
2740 purpose and value fields are PURPOSE and VALUE
2741 and whose TREE_CHAIN is CHAIN. */
2744 tree_cons_stat (tree purpose
, tree value
, tree chain MEM_STAT_DECL
)
2748 node
= ggc_alloc_tree_node_stat (sizeof (struct tree_list
) PASS_MEM_STAT
);
2749 memset (node
, 0, sizeof (struct tree_common
));
2751 record_node_allocation_statistics (TREE_LIST
, sizeof (struct tree_list
));
2753 TREE_SET_CODE (node
, TREE_LIST
);
2754 TREE_CHAIN (node
) = chain
;
2755 TREE_PURPOSE (node
) = purpose
;
2756 TREE_VALUE (node
) = value
;
2760 /* Return the values of the elements of a CONSTRUCTOR as a vector of
2764 ctor_to_vec (tree ctor
)
2766 vec
<tree
, va_gc
> *vec
;
2767 vec_alloc (vec
, CONSTRUCTOR_NELTS (ctor
));
2771 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), ix
, val
)
2772 vec
->quick_push (val
);
2777 /* Return the size nominally occupied by an object of type TYPE
2778 when it resides in memory. The value is measured in units of bytes,
2779 and its data type is that normally used for type sizes
2780 (which is the first type created by make_signed_type or
2781 make_unsigned_type). */
2784 size_in_bytes (const_tree type
)
2788 if (type
== error_mark_node
)
2789 return integer_zero_node
;
2791 type
= TYPE_MAIN_VARIANT (type
);
2792 t
= TYPE_SIZE_UNIT (type
);
2796 lang_hooks
.types
.incomplete_type_error (NULL_TREE
, type
);
2797 return size_zero_node
;
2803 /* Return the size of TYPE (in bytes) as a wide integer
2804 or return -1 if the size can vary or is larger than an integer. */
2807 int_size_in_bytes (const_tree type
)
2811 if (type
== error_mark_node
)
2814 type
= TYPE_MAIN_VARIANT (type
);
2815 t
= TYPE_SIZE_UNIT (type
);
2817 if (t
&& tree_fits_uhwi_p (t
))
2818 return TREE_INT_CST_LOW (t
);
2823 /* Return the maximum size of TYPE (in bytes) as a wide integer
2824 or return -1 if the size can vary or is larger than an integer. */
2827 max_int_size_in_bytes (const_tree type
)
2829 HOST_WIDE_INT size
= -1;
2832 /* If this is an array type, check for a possible MAX_SIZE attached. */
2834 if (TREE_CODE (type
) == ARRAY_TYPE
)
2836 size_tree
= TYPE_ARRAY_MAX_SIZE (type
);
2838 if (size_tree
&& tree_fits_uhwi_p (size_tree
))
2839 size
= tree_to_uhwi (size_tree
);
2842 /* If we still haven't been able to get a size, see if the language
2843 can compute a maximum size. */
2847 size_tree
= lang_hooks
.types
.max_size (type
);
2849 if (size_tree
&& tree_fits_uhwi_p (size_tree
))
2850 size
= tree_to_uhwi (size_tree
);
2856 /* Return the bit position of FIELD, in bits from the start of the record.
2857 This is a tree of type bitsizetype. */
2860 bit_position (const_tree field
)
2862 return bit_from_pos (DECL_FIELD_OFFSET (field
),
2863 DECL_FIELD_BIT_OFFSET (field
));
2866 /* Return the byte position of FIELD, in bytes from the start of the record.
2867 This is a tree of type sizetype. */
2870 byte_position (const_tree field
)
2872 return byte_from_pos (DECL_FIELD_OFFSET (field
),
2873 DECL_FIELD_BIT_OFFSET (field
));
2876 /* Likewise, but return as an integer. It must be representable in
2877 that way (since it could be a signed value, we don't have the
2878 option of returning -1 like int_size_in_byte can. */
2881 int_byte_position (const_tree field
)
2883 return tree_to_shwi (byte_position (field
));
2886 /* Return the strictest alignment, in bits, that T is known to have. */
2889 expr_align (const_tree t
)
2891 unsigned int align0
, align1
;
2893 switch (TREE_CODE (t
))
2895 CASE_CONVERT
: case NON_LVALUE_EXPR
:
2896 /* If we have conversions, we know that the alignment of the
2897 object must meet each of the alignments of the types. */
2898 align0
= expr_align (TREE_OPERAND (t
, 0));
2899 align1
= TYPE_ALIGN (TREE_TYPE (t
));
2900 return MAX (align0
, align1
);
2902 case SAVE_EXPR
: case COMPOUND_EXPR
: case MODIFY_EXPR
:
2903 case INIT_EXPR
: case TARGET_EXPR
: case WITH_CLEANUP_EXPR
:
2904 case CLEANUP_POINT_EXPR
:
2905 /* These don't change the alignment of an object. */
2906 return expr_align (TREE_OPERAND (t
, 0));
2909 /* The best we can do is say that the alignment is the least aligned
2911 align0
= expr_align (TREE_OPERAND (t
, 1));
2912 align1
= expr_align (TREE_OPERAND (t
, 2));
2913 return MIN (align0
, align1
);
2915 /* FIXME: LABEL_DECL and CONST_DECL never have DECL_ALIGN set
2916 meaningfully, it's always 1. */
2917 case LABEL_DECL
: case CONST_DECL
:
2918 case VAR_DECL
: case PARM_DECL
: case RESULT_DECL
:
2920 gcc_assert (DECL_ALIGN (t
) != 0);
2921 return DECL_ALIGN (t
);
2927 /* Otherwise take the alignment from that of the type. */
2928 return TYPE_ALIGN (TREE_TYPE (t
));
2931 /* Return, as a tree node, the number of elements for TYPE (which is an
2932 ARRAY_TYPE) minus one. This counts only elements of the top array. */
2935 array_type_nelts (const_tree type
)
2937 tree index_type
, min
, max
;
2939 /* If they did it with unspecified bounds, then we should have already
2940 given an error about it before we got here. */
2941 if (! TYPE_DOMAIN (type
))
2942 return error_mark_node
;
2944 index_type
= TYPE_DOMAIN (type
);
2945 min
= TYPE_MIN_VALUE (index_type
);
2946 max
= TYPE_MAX_VALUE (index_type
);
2948 /* TYPE_MAX_VALUE may not be set if the array has unknown length. */
2950 return error_mark_node
;
2952 return (integer_zerop (min
)
2954 : fold_build2 (MINUS_EXPR
, TREE_TYPE (max
), max
, min
));
2957 /* If arg is static -- a reference to an object in static storage -- then
2958 return the object. This is not the same as the C meaning of `static'.
2959 If arg isn't static, return NULL. */
2964 switch (TREE_CODE (arg
))
2967 /* Nested functions are static, even though taking their address will
2968 involve a trampoline as we unnest the nested function and create
2969 the trampoline on the tree level. */
2973 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
2974 && ! DECL_THREAD_LOCAL_P (arg
)
2975 && ! DECL_DLLIMPORT_P (arg
)
2979 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
2983 return TREE_STATIC (arg
) ? arg
: NULL
;
2990 /* If the thing being referenced is not a field, then it is
2991 something language specific. */
2992 gcc_assert (TREE_CODE (TREE_OPERAND (arg
, 1)) == FIELD_DECL
);
2994 /* If we are referencing a bitfield, we can't evaluate an
2995 ADDR_EXPR at compile time and so it isn't a constant. */
2996 if (DECL_BIT_FIELD (TREE_OPERAND (arg
, 1)))
2999 return staticp (TREE_OPERAND (arg
, 0));
3005 return TREE_CONSTANT (TREE_OPERAND (arg
, 0)) ? arg
: NULL
;
3008 case ARRAY_RANGE_REF
:
3009 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg
))) == INTEGER_CST
3010 && TREE_CODE (TREE_OPERAND (arg
, 1)) == INTEGER_CST
)
3011 return staticp (TREE_OPERAND (arg
, 0));
3015 case COMPOUND_LITERAL_EXPR
:
3016 return TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (arg
)) ? arg
: NULL
;
3026 /* Return whether OP is a DECL whose address is function-invariant. */
3029 decl_address_invariant_p (const_tree op
)
3031 /* The conditions below are slightly less strict than the one in
3034 switch (TREE_CODE (op
))
3043 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
3044 || DECL_THREAD_LOCAL_P (op
)
3045 || DECL_CONTEXT (op
) == current_function_decl
3046 || decl_function_context (op
) == current_function_decl
)
3051 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
3052 || decl_function_context (op
) == current_function_decl
)
3063 /* Return whether OP is a DECL whose address is interprocedural-invariant. */
3066 decl_address_ip_invariant_p (const_tree op
)
3068 /* The conditions below are slightly less strict than the one in
3071 switch (TREE_CODE (op
))
3079 if (((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
3080 && !DECL_DLLIMPORT_P (op
))
3081 || DECL_THREAD_LOCAL_P (op
))
3086 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
)))
3098 /* Return true if T is function-invariant (internal function, does
3099 not handle arithmetic; that's handled in skip_simple_arithmetic and
3100 tree_invariant_p). */
3102 static bool tree_invariant_p (tree t
);
3105 tree_invariant_p_1 (tree t
)
3109 if (TREE_CONSTANT (t
)
3110 || (TREE_READONLY (t
) && !TREE_SIDE_EFFECTS (t
)))
3113 switch (TREE_CODE (t
))
3119 op
= TREE_OPERAND (t
, 0);
3120 while (handled_component_p (op
))
3122 switch (TREE_CODE (op
))
3125 case ARRAY_RANGE_REF
:
3126 if (!tree_invariant_p (TREE_OPERAND (op
, 1))
3127 || TREE_OPERAND (op
, 2) != NULL_TREE
3128 || TREE_OPERAND (op
, 3) != NULL_TREE
)
3133 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
3139 op
= TREE_OPERAND (op
, 0);
3142 return CONSTANT_CLASS_P (op
) || decl_address_invariant_p (op
);
3151 /* Return true if T is function-invariant. */
3154 tree_invariant_p (tree t
)
3156 tree inner
= skip_simple_arithmetic (t
);
3157 return tree_invariant_p_1 (inner
);
3160 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
3161 Do this to any expression which may be used in more than one place,
3162 but must be evaluated only once.
3164 Normally, expand_expr would reevaluate the expression each time.
3165 Calling save_expr produces something that is evaluated and recorded
3166 the first time expand_expr is called on it. Subsequent calls to
3167 expand_expr just reuse the recorded value.
3169 The call to expand_expr that generates code that actually computes
3170 the value is the first call *at compile time*. Subsequent calls
3171 *at compile time* generate code to use the saved value.
3172 This produces correct result provided that *at run time* control
3173 always flows through the insns made by the first expand_expr
3174 before reaching the other places where the save_expr was evaluated.
3175 You, the caller of save_expr, must make sure this is so.
3177 Constants, and certain read-only nodes, are returned with no
3178 SAVE_EXPR because that is safe. Expressions containing placeholders
3179 are not touched; see tree.def for an explanation of what these
3183 save_expr (tree expr
)
3185 tree t
= fold (expr
);
3188 /* If the tree evaluates to a constant, then we don't want to hide that
3189 fact (i.e. this allows further folding, and direct checks for constants).
3190 However, a read-only object that has side effects cannot be bypassed.
3191 Since it is no problem to reevaluate literals, we just return the
3193 inner
= skip_simple_arithmetic (t
);
3194 if (TREE_CODE (inner
) == ERROR_MARK
)
3197 if (tree_invariant_p_1 (inner
))
3200 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
3201 it means that the size or offset of some field of an object depends on
3202 the value within another field.
3204 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
3205 and some variable since it would then need to be both evaluated once and
3206 evaluated more than once. Front-ends must assure this case cannot
3207 happen by surrounding any such subexpressions in their own SAVE_EXPR
3208 and forcing evaluation at the proper time. */
3209 if (contains_placeholder_p (inner
))
3212 t
= build1 (SAVE_EXPR
, TREE_TYPE (expr
), t
);
3213 SET_EXPR_LOCATION (t
, EXPR_LOCATION (expr
));
3215 /* This expression might be placed ahead of a jump to ensure that the
3216 value was computed on both sides of the jump. So make sure it isn't
3217 eliminated as dead. */
3218 TREE_SIDE_EFFECTS (t
) = 1;
3222 /* Look inside EXPR into any simple arithmetic operations. Return the
3223 outermost non-arithmetic or non-invariant node. */
3226 skip_simple_arithmetic (tree expr
)
3228 /* We don't care about whether this can be used as an lvalue in this
3230 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
3231 expr
= TREE_OPERAND (expr
, 0);
3233 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
3234 a constant, it will be more efficient to not make another SAVE_EXPR since
3235 it will allow better simplification and GCSE will be able to merge the
3236 computations if they actually occur. */
3239 if (UNARY_CLASS_P (expr
))
3240 expr
= TREE_OPERAND (expr
, 0);
3241 else if (BINARY_CLASS_P (expr
))
3243 if (tree_invariant_p (TREE_OPERAND (expr
, 1)))
3244 expr
= TREE_OPERAND (expr
, 0);
3245 else if (tree_invariant_p (TREE_OPERAND (expr
, 0)))
3246 expr
= TREE_OPERAND (expr
, 1);
3257 /* Look inside EXPR into simple arithmetic operations involving constants.
3258 Return the outermost non-arithmetic or non-constant node. */
3261 skip_simple_constant_arithmetic (tree expr
)
3263 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
3264 expr
= TREE_OPERAND (expr
, 0);
3268 if (UNARY_CLASS_P (expr
))
3269 expr
= TREE_OPERAND (expr
, 0);
3270 else if (BINARY_CLASS_P (expr
))
3272 if (TREE_CONSTANT (TREE_OPERAND (expr
, 1)))
3273 expr
= TREE_OPERAND (expr
, 0);
3274 else if (TREE_CONSTANT (TREE_OPERAND (expr
, 0)))
3275 expr
= TREE_OPERAND (expr
, 1);
3286 /* Return which tree structure is used by T. */
3288 enum tree_node_structure_enum
3289 tree_node_structure (const_tree t
)
3291 const enum tree_code code
= TREE_CODE (t
);
3292 return tree_node_structure_for_code (code
);
3295 /* Set various status flags when building a CALL_EXPR object T. */
3298 process_call_operands (tree t
)
3300 bool side_effects
= TREE_SIDE_EFFECTS (t
);
3301 bool read_only
= false;
3302 int i
= call_expr_flags (t
);
3304 /* Calls have side-effects, except those to const or pure functions. */
3305 if ((i
& ECF_LOOPING_CONST_OR_PURE
) || !(i
& (ECF_CONST
| ECF_PURE
)))
3306 side_effects
= true;
3307 /* Propagate TREE_READONLY of arguments for const functions. */
3311 if (!side_effects
|| read_only
)
3312 for (i
= 1; i
< TREE_OPERAND_LENGTH (t
); i
++)
3314 tree op
= TREE_OPERAND (t
, i
);
3315 if (op
&& TREE_SIDE_EFFECTS (op
))
3316 side_effects
= true;
3317 if (op
&& !TREE_READONLY (op
) && !CONSTANT_CLASS_P (op
))
3321 TREE_SIDE_EFFECTS (t
) = side_effects
;
3322 TREE_READONLY (t
) = read_only
;
3325 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
3326 size or offset that depends on a field within a record. */
3329 contains_placeholder_p (const_tree exp
)
3331 enum tree_code code
;
3336 code
= TREE_CODE (exp
);
3337 if (code
== PLACEHOLDER_EXPR
)
3340 switch (TREE_CODE_CLASS (code
))
3343 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
3344 position computations since they will be converted into a
3345 WITH_RECORD_EXPR involving the reference, which will assume
3346 here will be valid. */
3347 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
3349 case tcc_exceptional
:
3350 if (code
== TREE_LIST
)
3351 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp
))
3352 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp
)));
3357 case tcc_comparison
:
3358 case tcc_expression
:
3362 /* Ignoring the first operand isn't quite right, but works best. */
3363 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1));
3366 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
3367 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1))
3368 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 2)));
3371 /* The save_expr function never wraps anything containing
3372 a PLACEHOLDER_EXPR. */
3379 switch (TREE_CODE_LENGTH (code
))
3382 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
3384 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
3385 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1)));
3396 const_call_expr_arg_iterator iter
;
3397 FOR_EACH_CONST_CALL_EXPR_ARG (arg
, iter
, exp
)
3398 if (CONTAINS_PLACEHOLDER_P (arg
))
3412 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
3413 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
3417 type_contains_placeholder_1 (const_tree type
)
3419 /* If the size contains a placeholder or the parent type (component type in
3420 the case of arrays) type involves a placeholder, this type does. */
3421 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type
))
3422 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type
))
3423 || (!POINTER_TYPE_P (type
)
3425 && type_contains_placeholder_p (TREE_TYPE (type
))))
3428 /* Now do type-specific checks. Note that the last part of the check above
3429 greatly limits what we have to do below. */
3430 switch (TREE_CODE (type
))
3433 case POINTER_BOUNDS_TYPE
:
3439 case REFERENCE_TYPE
:
3448 case FIXED_POINT_TYPE
:
3449 /* Here we just check the bounds. */
3450 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type
))
3451 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type
)));
3454 /* We have already checked the component type above, so just check the
3456 return type_contains_placeholder_p (TYPE_DOMAIN (type
));
3460 case QUAL_UNION_TYPE
:
3464 for (field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
3465 if (TREE_CODE (field
) == FIELD_DECL
3466 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field
))
3467 || (TREE_CODE (type
) == QUAL_UNION_TYPE
3468 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field
)))
3469 || type_contains_placeholder_p (TREE_TYPE (field
))))
3480 /* Wrapper around above function used to cache its result. */
3483 type_contains_placeholder_p (tree type
)
3487 /* If the contains_placeholder_bits field has been initialized,
3488 then we know the answer. */
3489 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) > 0)
3490 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) - 1;
3492 /* Indicate that we've seen this type node, and the answer is false.
3493 This is what we want to return if we run into recursion via fields. */
3494 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = 1;
3496 /* Compute the real value. */
3497 result
= type_contains_placeholder_1 (type
);
3499 /* Store the real value. */
3500 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = result
+ 1;
3505 /* Push tree EXP onto vector QUEUE if it is not already present. */
3508 push_without_duplicates (tree exp
, vec
<tree
> *queue
)
3513 FOR_EACH_VEC_ELT (*queue
, i
, iter
)
3514 if (simple_cst_equal (iter
, exp
) == 1)
3518 queue
->safe_push (exp
);
3521 /* Given a tree EXP, find all occurrences of references to fields
3522 in a PLACEHOLDER_EXPR and place them in vector REFS without
3523 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
3524 we assume here that EXP contains only arithmetic expressions
3525 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
3529 find_placeholder_in_expr (tree exp
, vec
<tree
> *refs
)
3531 enum tree_code code
= TREE_CODE (exp
);
3535 /* We handle TREE_LIST and COMPONENT_REF separately. */
3536 if (code
== TREE_LIST
)
3538 FIND_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), refs
);
3539 FIND_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), refs
);
3541 else if (code
== COMPONENT_REF
)
3543 for (inner
= TREE_OPERAND (exp
, 0);
3544 REFERENCE_CLASS_P (inner
);
3545 inner
= TREE_OPERAND (inner
, 0))
3548 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
)
3549 push_without_duplicates (exp
, refs
);
3551 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), refs
);
3554 switch (TREE_CODE_CLASS (code
))
3559 case tcc_declaration
:
3560 /* Variables allocated to static storage can stay. */
3561 if (!TREE_STATIC (exp
))
3562 push_without_duplicates (exp
, refs
);
3565 case tcc_expression
:
3566 /* This is the pattern built in ada/make_aligning_type. */
3567 if (code
== ADDR_EXPR
3568 && TREE_CODE (TREE_OPERAND (exp
, 0)) == PLACEHOLDER_EXPR
)
3570 push_without_duplicates (exp
, refs
);
3574 /* Fall through... */
3576 case tcc_exceptional
:
3579 case tcc_comparison
:
3581 for (i
= 0; i
< TREE_CODE_LENGTH (code
); i
++)
3582 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
3586 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3587 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
3595 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
3596 return a tree with all occurrences of references to F in a
3597 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
3598 CONST_DECLs. Note that we assume here that EXP contains only
3599 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
3600 occurring only in their argument list. */
3603 substitute_in_expr (tree exp
, tree f
, tree r
)
3605 enum tree_code code
= TREE_CODE (exp
);
3606 tree op0
, op1
, op2
, op3
;
3609 /* We handle TREE_LIST and COMPONENT_REF separately. */
3610 if (code
== TREE_LIST
)
3612 op0
= SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp
), f
, r
);
3613 op1
= SUBSTITUTE_IN_EXPR (TREE_VALUE (exp
), f
, r
);
3614 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
3617 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
3619 else if (code
== COMPONENT_REF
)
3623 /* If this expression is getting a value from a PLACEHOLDER_EXPR
3624 and it is the right field, replace it with R. */
3625 for (inner
= TREE_OPERAND (exp
, 0);
3626 REFERENCE_CLASS_P (inner
);
3627 inner
= TREE_OPERAND (inner
, 0))
3631 op1
= TREE_OPERAND (exp
, 1);
3633 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& op1
== f
)
3636 /* If this expression hasn't been completed let, leave it alone. */
3637 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& !TREE_TYPE (inner
))
3640 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3641 if (op0
== TREE_OPERAND (exp
, 0))
3645 = fold_build3 (COMPONENT_REF
, TREE_TYPE (exp
), op0
, op1
, NULL_TREE
);
3648 switch (TREE_CODE_CLASS (code
))
3653 case tcc_declaration
:
3659 case tcc_expression
:
3663 /* Fall through... */
3665 case tcc_exceptional
:
3668 case tcc_comparison
:
3670 switch (TREE_CODE_LENGTH (code
))
3676 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3677 if (op0
== TREE_OPERAND (exp
, 0))
3680 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
3684 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3685 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3687 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
3690 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
3694 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3695 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3696 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
3698 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3699 && op2
== TREE_OPERAND (exp
, 2))
3702 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
3706 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3707 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3708 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
3709 op3
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 3), f
, r
);
3711 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3712 && op2
== TREE_OPERAND (exp
, 2)
3713 && op3
== TREE_OPERAND (exp
, 3))
3717 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
3729 new_tree
= NULL_TREE
;
3731 /* If we are trying to replace F with a constant, inline back
3732 functions which do nothing else than computing a value from
3733 the arguments they are passed. This makes it possible to
3734 fold partially or entirely the replacement expression. */
3735 if (CONSTANT_CLASS_P (r
) && code
== CALL_EXPR
)
3737 tree t
= maybe_inline_call_in_expr (exp
);
3739 return SUBSTITUTE_IN_EXPR (t
, f
, r
);
3742 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3744 tree op
= TREE_OPERAND (exp
, i
);
3745 tree new_op
= SUBSTITUTE_IN_EXPR (op
, f
, r
);
3749 new_tree
= copy_node (exp
);
3750 TREE_OPERAND (new_tree
, i
) = new_op
;
3756 new_tree
= fold (new_tree
);
3757 if (TREE_CODE (new_tree
) == CALL_EXPR
)
3758 process_call_operands (new_tree
);
3769 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
3771 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
3772 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
3777 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
3778 for it within OBJ, a tree that is an object or a chain of references. */
3781 substitute_placeholder_in_expr (tree exp
, tree obj
)
3783 enum tree_code code
= TREE_CODE (exp
);
3784 tree op0
, op1
, op2
, op3
;
3787 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
3788 in the chain of OBJ. */
3789 if (code
== PLACEHOLDER_EXPR
)
3791 tree need_type
= TYPE_MAIN_VARIANT (TREE_TYPE (exp
));
3794 for (elt
= obj
; elt
!= 0;
3795 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
3796 || TREE_CODE (elt
) == COND_EXPR
)
3797 ? TREE_OPERAND (elt
, 1)
3798 : (REFERENCE_CLASS_P (elt
)
3799 || UNARY_CLASS_P (elt
)
3800 || BINARY_CLASS_P (elt
)
3801 || VL_EXP_CLASS_P (elt
)
3802 || EXPRESSION_CLASS_P (elt
))
3803 ? TREE_OPERAND (elt
, 0) : 0))
3804 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt
)) == need_type
)
3807 for (elt
= obj
; elt
!= 0;
3808 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
3809 || TREE_CODE (elt
) == COND_EXPR
)
3810 ? TREE_OPERAND (elt
, 1)
3811 : (REFERENCE_CLASS_P (elt
)
3812 || UNARY_CLASS_P (elt
)
3813 || BINARY_CLASS_P (elt
)
3814 || VL_EXP_CLASS_P (elt
)
3815 || EXPRESSION_CLASS_P (elt
))
3816 ? TREE_OPERAND (elt
, 0) : 0))
3817 if (POINTER_TYPE_P (TREE_TYPE (elt
))
3818 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt
)))
3820 return fold_build1 (INDIRECT_REF
, need_type
, elt
);
3822 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
3823 survives until RTL generation, there will be an error. */
3827 /* TREE_LIST is special because we need to look at TREE_VALUE
3828 and TREE_CHAIN, not TREE_OPERANDS. */
3829 else if (code
== TREE_LIST
)
3831 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), obj
);
3832 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), obj
);
3833 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
3836 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
3839 switch (TREE_CODE_CLASS (code
))
3842 case tcc_declaration
:
3845 case tcc_exceptional
:
3848 case tcc_comparison
:
3849 case tcc_expression
:
3852 switch (TREE_CODE_LENGTH (code
))
3858 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3859 if (op0
== TREE_OPERAND (exp
, 0))
3862 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
3866 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3867 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
3869 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
3872 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
3876 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3877 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
3878 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
3880 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3881 && op2
== TREE_OPERAND (exp
, 2))
3884 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
3888 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3889 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
3890 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
3891 op3
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 3), obj
);
3893 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3894 && op2
== TREE_OPERAND (exp
, 2)
3895 && op3
== TREE_OPERAND (exp
, 3))
3899 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
3911 new_tree
= NULL_TREE
;
3913 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3915 tree op
= TREE_OPERAND (exp
, i
);
3916 tree new_op
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (op
, obj
);
3920 new_tree
= copy_node (exp
);
3921 TREE_OPERAND (new_tree
, i
) = new_op
;
3927 new_tree
= fold (new_tree
);
3928 if (TREE_CODE (new_tree
) == CALL_EXPR
)
3929 process_call_operands (new_tree
);
3940 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
3942 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
3943 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
3949 /* Subroutine of stabilize_reference; this is called for subtrees of
3950 references. Any expression with side-effects must be put in a SAVE_EXPR
3951 to ensure that it is only evaluated once.
3953 We don't put SAVE_EXPR nodes around everything, because assigning very
3954 simple expressions to temporaries causes us to miss good opportunities
3955 for optimizations. Among other things, the opportunity to fold in the
3956 addition of a constant into an addressing mode often gets lost, e.g.
3957 "y[i+1] += x;". In general, we take the approach that we should not make
3958 an assignment unless we are forced into it - i.e., that any non-side effect
3959 operator should be allowed, and that cse should take care of coalescing
3960 multiple utterances of the same expression should that prove fruitful. */
3963 stabilize_reference_1 (tree e
)
3966 enum tree_code code
= TREE_CODE (e
);
3968 /* We cannot ignore const expressions because it might be a reference
3969 to a const array but whose index contains side-effects. But we can
3970 ignore things that are actual constant or that already have been
3971 handled by this function. */
3973 if (tree_invariant_p (e
))
3976 switch (TREE_CODE_CLASS (code
))
3978 case tcc_exceptional
:
3980 case tcc_declaration
:
3981 case tcc_comparison
:
3983 case tcc_expression
:
3986 /* If the expression has side-effects, then encase it in a SAVE_EXPR
3987 so that it will only be evaluated once. */
3988 /* The reference (r) and comparison (<) classes could be handled as
3989 below, but it is generally faster to only evaluate them once. */
3990 if (TREE_SIDE_EFFECTS (e
))
3991 return save_expr (e
);
3995 /* Constants need no processing. In fact, we should never reach
4000 /* Division is slow and tends to be compiled with jumps,
4001 especially the division by powers of 2 that is often
4002 found inside of an array reference. So do it just once. */
4003 if (code
== TRUNC_DIV_EXPR
|| code
== TRUNC_MOD_EXPR
4004 || code
== FLOOR_DIV_EXPR
|| code
== FLOOR_MOD_EXPR
4005 || code
== CEIL_DIV_EXPR
|| code
== CEIL_MOD_EXPR
4006 || code
== ROUND_DIV_EXPR
|| code
== ROUND_MOD_EXPR
)
4007 return save_expr (e
);
4008 /* Recursively stabilize each operand. */
4009 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)),
4010 stabilize_reference_1 (TREE_OPERAND (e
, 1)));
4014 /* Recursively stabilize each operand. */
4015 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)));
4022 TREE_TYPE (result
) = TREE_TYPE (e
);
4023 TREE_READONLY (result
) = TREE_READONLY (e
);
4024 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (e
);
4025 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (e
);
4030 /* Stabilize a reference so that we can use it any number of times
4031 without causing its operands to be evaluated more than once.
4032 Returns the stabilized reference. This works by means of save_expr,
4033 so see the caveats in the comments about save_expr.
4035 Also allows conversion expressions whose operands are references.
4036 Any other kind of expression is returned unchanged. */
4039 stabilize_reference (tree ref
)
4042 enum tree_code code
= TREE_CODE (ref
);
4049 /* No action is needed in this case. */
4054 case FIX_TRUNC_EXPR
:
4055 result
= build_nt (code
, stabilize_reference (TREE_OPERAND (ref
, 0)));
4059 result
= build_nt (INDIRECT_REF
,
4060 stabilize_reference_1 (TREE_OPERAND (ref
, 0)));
4064 result
= build_nt (COMPONENT_REF
,
4065 stabilize_reference (TREE_OPERAND (ref
, 0)),
4066 TREE_OPERAND (ref
, 1), NULL_TREE
);
4070 result
= build_nt (BIT_FIELD_REF
,
4071 stabilize_reference (TREE_OPERAND (ref
, 0)),
4072 TREE_OPERAND (ref
, 1), TREE_OPERAND (ref
, 2));
4076 result
= build_nt (ARRAY_REF
,
4077 stabilize_reference (TREE_OPERAND (ref
, 0)),
4078 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
4079 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
4082 case ARRAY_RANGE_REF
:
4083 result
= build_nt (ARRAY_RANGE_REF
,
4084 stabilize_reference (TREE_OPERAND (ref
, 0)),
4085 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
4086 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
4090 /* We cannot wrap the first expression in a SAVE_EXPR, as then
4091 it wouldn't be ignored. This matters when dealing with
4093 return stabilize_reference_1 (ref
);
4095 /* If arg isn't a kind of lvalue we recognize, make no change.
4096 Caller should recognize the error for an invalid lvalue. */
4101 return error_mark_node
;
4104 TREE_TYPE (result
) = TREE_TYPE (ref
);
4105 TREE_READONLY (result
) = TREE_READONLY (ref
);
4106 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (ref
);
4107 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (ref
);
4112 /* Low-level constructors for expressions. */
4114 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
4115 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
4118 recompute_tree_invariant_for_addr_expr (tree t
)
4121 bool tc
= true, se
= false;
4123 /* We started out assuming this address is both invariant and constant, but
4124 does not have side effects. Now go down any handled components and see if
4125 any of them involve offsets that are either non-constant or non-invariant.
4126 Also check for side-effects.
4128 ??? Note that this code makes no attempt to deal with the case where
4129 taking the address of something causes a copy due to misalignment. */
4131 #define UPDATE_FLAGS(NODE) \
4132 do { tree _node = (NODE); \
4133 if (_node && !TREE_CONSTANT (_node)) tc = false; \
4134 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
4136 for (node
= TREE_OPERAND (t
, 0); handled_component_p (node
);
4137 node
= TREE_OPERAND (node
, 0))
4139 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
4140 array reference (probably made temporarily by the G++ front end),
4141 so ignore all the operands. */
4142 if ((TREE_CODE (node
) == ARRAY_REF
4143 || TREE_CODE (node
) == ARRAY_RANGE_REF
)
4144 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node
, 0))) == ARRAY_TYPE
)
4146 UPDATE_FLAGS (TREE_OPERAND (node
, 1));
4147 if (TREE_OPERAND (node
, 2))
4148 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
4149 if (TREE_OPERAND (node
, 3))
4150 UPDATE_FLAGS (TREE_OPERAND (node
, 3));
4152 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
4153 FIELD_DECL, apparently. The G++ front end can put something else
4154 there, at least temporarily. */
4155 else if (TREE_CODE (node
) == COMPONENT_REF
4156 && TREE_CODE (TREE_OPERAND (node
, 1)) == FIELD_DECL
)
4158 if (TREE_OPERAND (node
, 2))
4159 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
4163 node
= lang_hooks
.expr_to_decl (node
, &tc
, &se
);
4165 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
4166 the address, since &(*a)->b is a form of addition. If it's a constant, the
4167 address is constant too. If it's a decl, its address is constant if the
4168 decl is static. Everything else is not constant and, furthermore,
4169 taking the address of a volatile variable is not volatile. */
4170 if (TREE_CODE (node
) == INDIRECT_REF
4171 || TREE_CODE (node
) == MEM_REF
)
4172 UPDATE_FLAGS (TREE_OPERAND (node
, 0));
4173 else if (CONSTANT_CLASS_P (node
))
4175 else if (DECL_P (node
))
4176 tc
&= (staticp (node
) != NULL_TREE
);
4180 se
|= TREE_SIDE_EFFECTS (node
);
4184 TREE_CONSTANT (t
) = tc
;
4185 TREE_SIDE_EFFECTS (t
) = se
;
4189 /* Build an expression of code CODE, data type TYPE, and operands as
4190 specified. Expressions and reference nodes can be created this way.
4191 Constants, decls, types and misc nodes cannot be.
4193 We define 5 non-variadic functions, from 0 to 4 arguments. This is
4194 enough for all extant tree codes. */
4197 build0_stat (enum tree_code code
, tree tt MEM_STAT_DECL
)
4201 gcc_assert (TREE_CODE_LENGTH (code
) == 0);
4203 t
= make_node_stat (code PASS_MEM_STAT
);
4210 build1_stat (enum tree_code code
, tree type
, tree node MEM_STAT_DECL
)
4212 int length
= sizeof (struct tree_exp
);
4215 record_node_allocation_statistics (code
, length
);
4217 gcc_assert (TREE_CODE_LENGTH (code
) == 1);
4219 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
4221 memset (t
, 0, sizeof (struct tree_common
));
4223 TREE_SET_CODE (t
, code
);
4225 TREE_TYPE (t
) = type
;
4226 SET_EXPR_LOCATION (t
, UNKNOWN_LOCATION
);
4227 TREE_OPERAND (t
, 0) = node
;
4228 if (node
&& !TYPE_P (node
))
4230 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (node
);
4231 TREE_READONLY (t
) = TREE_READONLY (node
);
4234 if (TREE_CODE_CLASS (code
) == tcc_statement
)
4235 TREE_SIDE_EFFECTS (t
) = 1;
4239 /* All of these have side-effects, no matter what their
4241 TREE_SIDE_EFFECTS (t
) = 1;
4242 TREE_READONLY (t
) = 0;
4246 /* Whether a dereference is readonly has nothing to do with whether
4247 its operand is readonly. */
4248 TREE_READONLY (t
) = 0;
4253 recompute_tree_invariant_for_addr_expr (t
);
4257 if ((TREE_CODE_CLASS (code
) == tcc_unary
|| code
== VIEW_CONVERT_EXPR
)
4258 && node
&& !TYPE_P (node
)
4259 && TREE_CONSTANT (node
))
4260 TREE_CONSTANT (t
) = 1;
4261 if (TREE_CODE_CLASS (code
) == tcc_reference
4262 && node
&& TREE_THIS_VOLATILE (node
))
4263 TREE_THIS_VOLATILE (t
) = 1;
4270 #define PROCESS_ARG(N) \
4272 TREE_OPERAND (t, N) = arg##N; \
4273 if (arg##N &&!TYPE_P (arg##N)) \
4275 if (TREE_SIDE_EFFECTS (arg##N)) \
4277 if (!TREE_READONLY (arg##N) \
4278 && !CONSTANT_CLASS_P (arg##N)) \
4279 (void) (read_only = 0); \
4280 if (!TREE_CONSTANT (arg##N)) \
4281 (void) (constant = 0); \
4286 build2_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1 MEM_STAT_DECL
)
4288 bool constant
, read_only
, side_effects
;
4291 gcc_assert (TREE_CODE_LENGTH (code
) == 2);
4293 if ((code
== MINUS_EXPR
|| code
== PLUS_EXPR
|| code
== MULT_EXPR
)
4294 && arg0
&& arg1
&& tt
&& POINTER_TYPE_P (tt
)
4295 /* When sizetype precision doesn't match that of pointers
4296 we need to be able to build explicit extensions or truncations
4297 of the offset argument. */
4298 && TYPE_PRECISION (sizetype
) == TYPE_PRECISION (tt
))
4299 gcc_assert (TREE_CODE (arg0
) == INTEGER_CST
4300 && TREE_CODE (arg1
) == INTEGER_CST
);
4302 if (code
== POINTER_PLUS_EXPR
&& arg0
&& arg1
&& tt
)
4303 gcc_assert (POINTER_TYPE_P (tt
) && POINTER_TYPE_P (TREE_TYPE (arg0
))
4304 && ptrofftype_p (TREE_TYPE (arg1
)));
4306 t
= make_node_stat (code PASS_MEM_STAT
);
4309 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
4310 result based on those same flags for the arguments. But if the
4311 arguments aren't really even `tree' expressions, we shouldn't be trying
4314 /* Expressions without side effects may be constant if their
4315 arguments are as well. */
4316 constant
= (TREE_CODE_CLASS (code
) == tcc_comparison
4317 || TREE_CODE_CLASS (code
) == tcc_binary
);
4319 side_effects
= TREE_SIDE_EFFECTS (t
);
4324 TREE_READONLY (t
) = read_only
;
4325 TREE_CONSTANT (t
) = constant
;
4326 TREE_SIDE_EFFECTS (t
) = side_effects
;
4327 TREE_THIS_VOLATILE (t
)
4328 = (TREE_CODE_CLASS (code
) == tcc_reference
4329 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4336 build3_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4337 tree arg2 MEM_STAT_DECL
)
4339 bool constant
, read_only
, side_effects
;
4342 gcc_assert (TREE_CODE_LENGTH (code
) == 3);
4343 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
4345 t
= make_node_stat (code PASS_MEM_STAT
);
4350 /* As a special exception, if COND_EXPR has NULL branches, we
4351 assume that it is a gimple statement and always consider
4352 it to have side effects. */
4353 if (code
== COND_EXPR
4354 && tt
== void_type_node
4355 && arg1
== NULL_TREE
4356 && arg2
== NULL_TREE
)
4357 side_effects
= true;
4359 side_effects
= TREE_SIDE_EFFECTS (t
);
4365 if (code
== COND_EXPR
)
4366 TREE_READONLY (t
) = read_only
;
4368 TREE_SIDE_EFFECTS (t
) = side_effects
;
4369 TREE_THIS_VOLATILE (t
)
4370 = (TREE_CODE_CLASS (code
) == tcc_reference
4371 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4377 build4_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4378 tree arg2
, tree arg3 MEM_STAT_DECL
)
4380 bool constant
, read_only
, side_effects
;
4383 gcc_assert (TREE_CODE_LENGTH (code
) == 4);
4385 t
= make_node_stat (code PASS_MEM_STAT
);
4388 side_effects
= TREE_SIDE_EFFECTS (t
);
4395 TREE_SIDE_EFFECTS (t
) = side_effects
;
4396 TREE_THIS_VOLATILE (t
)
4397 = (TREE_CODE_CLASS (code
) == tcc_reference
4398 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4404 build5_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4405 tree arg2
, tree arg3
, tree arg4 MEM_STAT_DECL
)
4407 bool constant
, read_only
, side_effects
;
4410 gcc_assert (TREE_CODE_LENGTH (code
) == 5);
4412 t
= make_node_stat (code PASS_MEM_STAT
);
4415 side_effects
= TREE_SIDE_EFFECTS (t
);
4423 TREE_SIDE_EFFECTS (t
) = side_effects
;
4424 TREE_THIS_VOLATILE (t
)
4425 = (TREE_CODE_CLASS (code
) == tcc_reference
4426 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4431 /* Build a simple MEM_REF tree with the sematics of a plain INDIRECT_REF
4432 on the pointer PTR. */
4435 build_simple_mem_ref_loc (location_t loc
, tree ptr
)
4437 HOST_WIDE_INT offset
= 0;
4438 tree ptype
= TREE_TYPE (ptr
);
4440 /* For convenience allow addresses that collapse to a simple base
4442 if (TREE_CODE (ptr
) == ADDR_EXPR
4443 && (handled_component_p (TREE_OPERAND (ptr
, 0))
4444 || TREE_CODE (TREE_OPERAND (ptr
, 0)) == MEM_REF
))
4446 ptr
= get_addr_base_and_unit_offset (TREE_OPERAND (ptr
, 0), &offset
);
4448 ptr
= build_fold_addr_expr (ptr
);
4449 gcc_assert (is_gimple_reg (ptr
) || is_gimple_min_invariant (ptr
));
4451 tem
= build2 (MEM_REF
, TREE_TYPE (ptype
),
4452 ptr
, build_int_cst (ptype
, offset
));
4453 SET_EXPR_LOCATION (tem
, loc
);
4457 /* Return the constant offset of a MEM_REF or TARGET_MEM_REF tree T. */
4460 mem_ref_offset (const_tree t
)
4462 return offset_int::from (TREE_OPERAND (t
, 1), SIGNED
);
4465 /* Return an invariant ADDR_EXPR of type TYPE taking the address of BASE
4466 offsetted by OFFSET units. */
4469 build_invariant_address (tree type
, tree base
, HOST_WIDE_INT offset
)
4471 tree ref
= fold_build2 (MEM_REF
, TREE_TYPE (type
),
4472 build_fold_addr_expr (base
),
4473 build_int_cst (ptr_type_node
, offset
));
4474 tree addr
= build1 (ADDR_EXPR
, type
, ref
);
4475 recompute_tree_invariant_for_addr_expr (addr
);
4479 /* Similar except don't specify the TREE_TYPE
4480 and leave the TREE_SIDE_EFFECTS as 0.
4481 It is permissible for arguments to be null,
4482 or even garbage if their values do not matter. */
4485 build_nt (enum tree_code code
, ...)
4492 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
4496 t
= make_node (code
);
4497 length
= TREE_CODE_LENGTH (code
);
4499 for (i
= 0; i
< length
; i
++)
4500 TREE_OPERAND (t
, i
) = va_arg (p
, tree
);
4506 /* Similar to build_nt, but for creating a CALL_EXPR object with a
4510 build_nt_call_vec (tree fn
, vec
<tree
, va_gc
> *args
)
4515 ret
= build_vl_exp (CALL_EXPR
, vec_safe_length (args
) + 3);
4516 CALL_EXPR_FN (ret
) = fn
;
4517 CALL_EXPR_STATIC_CHAIN (ret
) = NULL_TREE
;
4518 FOR_EACH_VEC_SAFE_ELT (args
, ix
, t
)
4519 CALL_EXPR_ARG (ret
, ix
) = t
;
4523 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
4524 We do NOT enter this node in any sort of symbol table.
4526 LOC is the location of the decl.
4528 layout_decl is used to set up the decl's storage layout.
4529 Other slots are initialized to 0 or null pointers. */
4532 build_decl_stat (location_t loc
, enum tree_code code
, tree name
,
4533 tree type MEM_STAT_DECL
)
4537 t
= make_node_stat (code PASS_MEM_STAT
);
4538 DECL_SOURCE_LOCATION (t
) = loc
;
4540 /* if (type == error_mark_node)
4541 type = integer_type_node; */
4542 /* That is not done, deliberately, so that having error_mark_node
4543 as the type can suppress useless errors in the use of this variable. */
4545 DECL_NAME (t
) = name
;
4546 TREE_TYPE (t
) = type
;
4548 if (code
== VAR_DECL
|| code
== PARM_DECL
|| code
== RESULT_DECL
)
4554 /* Builds and returns function declaration with NAME and TYPE. */
4557 build_fn_decl (const char *name
, tree type
)
4559 tree id
= get_identifier (name
);
4560 tree decl
= build_decl (input_location
, FUNCTION_DECL
, id
, type
);
4562 DECL_EXTERNAL (decl
) = 1;
4563 TREE_PUBLIC (decl
) = 1;
4564 DECL_ARTIFICIAL (decl
) = 1;
4565 TREE_NOTHROW (decl
) = 1;
4570 vec
<tree
, va_gc
> *all_translation_units
;
4572 /* Builds a new translation-unit decl with name NAME, queues it in the
4573 global list of translation-unit decls and returns it. */
4576 build_translation_unit_decl (tree name
)
4578 tree tu
= build_decl (UNKNOWN_LOCATION
, TRANSLATION_UNIT_DECL
,
4580 TRANSLATION_UNIT_LANGUAGE (tu
) = lang_hooks
.name
;
4581 vec_safe_push (all_translation_units
, tu
);
4586 /* BLOCK nodes are used to represent the structure of binding contours
4587 and declarations, once those contours have been exited and their contents
4588 compiled. This information is used for outputting debugging info. */
4591 build_block (tree vars
, tree subblocks
, tree supercontext
, tree chain
)
4593 tree block
= make_node (BLOCK
);
4595 BLOCK_VARS (block
) = vars
;
4596 BLOCK_SUBBLOCKS (block
) = subblocks
;
4597 BLOCK_SUPERCONTEXT (block
) = supercontext
;
4598 BLOCK_CHAIN (block
) = chain
;
4603 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
4605 LOC is the location to use in tree T. */
4608 protected_set_expr_location (tree t
, location_t loc
)
4610 if (CAN_HAVE_LOCATION_P (t
))
4611 SET_EXPR_LOCATION (t
, loc
);
4614 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
4618 build_decl_attribute_variant (tree ddecl
, tree attribute
)
4620 DECL_ATTRIBUTES (ddecl
) = attribute
;
4624 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4625 is ATTRIBUTE and its qualifiers are QUALS.
4627 Record such modified types already made so we don't make duplicates. */
4630 build_type_attribute_qual_variant (tree ttype
, tree attribute
, int quals
)
4632 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype
), attribute
))
4634 inchash::hash hstate
;
4638 enum tree_code code
= TREE_CODE (ttype
);
4640 /* Building a distinct copy of a tagged type is inappropriate; it
4641 causes breakage in code that expects there to be a one-to-one
4642 relationship between a struct and its fields.
4643 build_duplicate_type is another solution (as used in
4644 handle_transparent_union_attribute), but that doesn't play well
4645 with the stronger C++ type identity model. */
4646 if (TREE_CODE (ttype
) == RECORD_TYPE
4647 || TREE_CODE (ttype
) == UNION_TYPE
4648 || TREE_CODE (ttype
) == QUAL_UNION_TYPE
4649 || TREE_CODE (ttype
) == ENUMERAL_TYPE
)
4651 warning (OPT_Wattributes
,
4652 "ignoring attributes applied to %qT after definition",
4653 TYPE_MAIN_VARIANT (ttype
));
4654 return build_qualified_type (ttype
, quals
);
4657 ttype
= build_qualified_type (ttype
, TYPE_UNQUALIFIED
);
4658 ntype
= build_distinct_type_copy (ttype
);
4660 TYPE_ATTRIBUTES (ntype
) = attribute
;
4662 hstate
.add_int (code
);
4663 if (TREE_TYPE (ntype
))
4664 hstate
.add_object (TYPE_HASH (TREE_TYPE (ntype
)));
4665 attribute_hash_list (attribute
, hstate
);
4667 switch (TREE_CODE (ntype
))
4670 type_hash_list (TYPE_ARG_TYPES (ntype
), hstate
);
4673 if (TYPE_DOMAIN (ntype
))
4674 hstate
.add_object (TYPE_HASH (TYPE_DOMAIN (ntype
)));
4677 t
= TYPE_MAX_VALUE (ntype
);
4678 for (i
= 0; i
< TREE_INT_CST_NUNITS (t
); i
++)
4679 hstate
.add_object (TREE_INT_CST_ELT (t
, i
));
4682 case FIXED_POINT_TYPE
:
4684 unsigned int precision
= TYPE_PRECISION (ntype
);
4685 hstate
.add_object (precision
);
4692 ntype
= type_hash_canon (hstate
.end(), ntype
);
4694 /* If the target-dependent attributes make NTYPE different from
4695 its canonical type, we will need to use structural equality
4696 checks for this type. */
4697 if (TYPE_STRUCTURAL_EQUALITY_P (ttype
)
4698 || !comp_type_attributes (ntype
, ttype
))
4699 SET_TYPE_STRUCTURAL_EQUALITY (ntype
);
4700 else if (TYPE_CANONICAL (ntype
) == ntype
)
4701 TYPE_CANONICAL (ntype
) = TYPE_CANONICAL (ttype
);
4703 ttype
= build_qualified_type (ntype
, quals
);
4705 else if (TYPE_QUALS (ttype
) != quals
)
4706 ttype
= build_qualified_type (ttype
, quals
);
4711 /* Check if "omp declare simd" attribute arguments, CLAUSES1 and CLAUSES2, are
4715 omp_declare_simd_clauses_equal (tree clauses1
, tree clauses2
)
4718 for (cl1
= clauses1
, cl2
= clauses2
;
4720 cl1
= OMP_CLAUSE_CHAIN (cl1
), cl2
= OMP_CLAUSE_CHAIN (cl2
))
4722 if (OMP_CLAUSE_CODE (cl1
) != OMP_CLAUSE_CODE (cl2
))
4724 if (OMP_CLAUSE_CODE (cl1
) != OMP_CLAUSE_SIMDLEN
)
4726 if (simple_cst_equal (OMP_CLAUSE_DECL (cl1
),
4727 OMP_CLAUSE_DECL (cl2
)) != 1)
4730 switch (OMP_CLAUSE_CODE (cl1
))
4732 case OMP_CLAUSE_ALIGNED
:
4733 if (simple_cst_equal (OMP_CLAUSE_ALIGNED_ALIGNMENT (cl1
),
4734 OMP_CLAUSE_ALIGNED_ALIGNMENT (cl2
)) != 1)
4737 case OMP_CLAUSE_LINEAR
:
4738 if (simple_cst_equal (OMP_CLAUSE_LINEAR_STEP (cl1
),
4739 OMP_CLAUSE_LINEAR_STEP (cl2
)) != 1)
4742 case OMP_CLAUSE_SIMDLEN
:
4743 if (simple_cst_equal (OMP_CLAUSE_SIMDLEN_EXPR (cl1
),
4744 OMP_CLAUSE_SIMDLEN_EXPR (cl2
)) != 1)
4753 /* Compare two constructor-element-type constants. Return 1 if the lists
4754 are known to be equal; otherwise return 0. */
4757 simple_cst_list_equal (const_tree l1
, const_tree l2
)
4759 while (l1
!= NULL_TREE
&& l2
!= NULL_TREE
)
4761 if (simple_cst_equal (TREE_VALUE (l1
), TREE_VALUE (l2
)) != 1)
4764 l1
= TREE_CHAIN (l1
);
4765 l2
= TREE_CHAIN (l2
);
4771 /* Compare two attributes for their value identity. Return true if the
4772 attribute values are known to be equal; otherwise return false.
4776 attribute_value_equal (const_tree attr1
, const_tree attr2
)
4778 if (TREE_VALUE (attr1
) == TREE_VALUE (attr2
))
4781 if (TREE_VALUE (attr1
) != NULL_TREE
4782 && TREE_CODE (TREE_VALUE (attr1
)) == TREE_LIST
4783 && TREE_VALUE (attr2
) != NULL
4784 && TREE_CODE (TREE_VALUE (attr2
)) == TREE_LIST
)
4785 return (simple_cst_list_equal (TREE_VALUE (attr1
),
4786 TREE_VALUE (attr2
)) == 1);
4788 if ((flag_openmp
|| flag_openmp_simd
)
4789 && TREE_VALUE (attr1
) && TREE_VALUE (attr2
)
4790 && TREE_CODE (TREE_VALUE (attr1
)) == OMP_CLAUSE
4791 && TREE_CODE (TREE_VALUE (attr2
)) == OMP_CLAUSE
)
4792 return omp_declare_simd_clauses_equal (TREE_VALUE (attr1
),
4793 TREE_VALUE (attr2
));
4795 return (simple_cst_equal (TREE_VALUE (attr1
), TREE_VALUE (attr2
)) == 1);
4798 /* Return 0 if the attributes for two types are incompatible, 1 if they
4799 are compatible, and 2 if they are nearly compatible (which causes a
4800 warning to be generated). */
4802 comp_type_attributes (const_tree type1
, const_tree type2
)
4804 const_tree a1
= TYPE_ATTRIBUTES (type1
);
4805 const_tree a2
= TYPE_ATTRIBUTES (type2
);
4810 for (a
= a1
; a
!= NULL_TREE
; a
= TREE_CHAIN (a
))
4812 const struct attribute_spec
*as
;
4815 as
= lookup_attribute_spec (get_attribute_name (a
));
4816 if (!as
|| as
->affects_type_identity
== false)
4819 attr
= lookup_attribute (as
->name
, CONST_CAST_TREE (a2
));
4820 if (!attr
|| !attribute_value_equal (a
, attr
))
4825 for (a
= a2
; a
!= NULL_TREE
; a
= TREE_CHAIN (a
))
4827 const struct attribute_spec
*as
;
4829 as
= lookup_attribute_spec (get_attribute_name (a
));
4830 if (!as
|| as
->affects_type_identity
== false)
4833 if (!lookup_attribute (as
->name
, CONST_CAST_TREE (a1
)))
4835 /* We don't need to compare trees again, as we did this
4836 already in first loop. */
4838 /* All types - affecting identity - are equal, so
4839 there is no need to call target hook for comparison. */
4843 /* As some type combinations - like default calling-convention - might
4844 be compatible, we have to call the target hook to get the final result. */
4845 return targetm
.comp_type_attributes (type1
, type2
);
4848 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4851 Record such modified types already made so we don't make duplicates. */
4854 build_type_attribute_variant (tree ttype
, tree attribute
)
4856 return build_type_attribute_qual_variant (ttype
, attribute
,
4857 TYPE_QUALS (ttype
));
4861 /* Reset the expression *EXPR_P, a size or position.
4863 ??? We could reset all non-constant sizes or positions. But it's cheap
4864 enough to not do so and refrain from adding workarounds to dwarf2out.c.
4866 We need to reset self-referential sizes or positions because they cannot
4867 be gimplified and thus can contain a CALL_EXPR after the gimplification
4868 is finished, which will run afoul of LTO streaming. And they need to be
4869 reset to something essentially dummy but not constant, so as to preserve
4870 the properties of the object they are attached to. */
4873 free_lang_data_in_one_sizepos (tree
*expr_p
)
4875 tree expr
= *expr_p
;
4876 if (CONTAINS_PLACEHOLDER_P (expr
))
4877 *expr_p
= build0 (PLACEHOLDER_EXPR
, TREE_TYPE (expr
));
4881 /* Reset all the fields in a binfo node BINFO. We only keep
4882 BINFO_VTABLE, which is used by gimple_fold_obj_type_ref. */
4885 free_lang_data_in_binfo (tree binfo
)
4890 gcc_assert (TREE_CODE (binfo
) == TREE_BINFO
);
4892 BINFO_VIRTUALS (binfo
) = NULL_TREE
;
4893 BINFO_BASE_ACCESSES (binfo
) = NULL
;
4894 BINFO_INHERITANCE_CHAIN (binfo
) = NULL_TREE
;
4895 BINFO_SUBVTT_INDEX (binfo
) = NULL_TREE
;
4897 FOR_EACH_VEC_ELT (*BINFO_BASE_BINFOS (binfo
), i
, t
)
4898 free_lang_data_in_binfo (t
);
4902 /* Reset all language specific information still present in TYPE. */
4905 free_lang_data_in_type (tree type
)
4907 gcc_assert (TYPE_P (type
));
4909 /* Give the FE a chance to remove its own data first. */
4910 lang_hooks
.free_lang_data (type
);
4912 TREE_LANG_FLAG_0 (type
) = 0;
4913 TREE_LANG_FLAG_1 (type
) = 0;
4914 TREE_LANG_FLAG_2 (type
) = 0;
4915 TREE_LANG_FLAG_3 (type
) = 0;
4916 TREE_LANG_FLAG_4 (type
) = 0;
4917 TREE_LANG_FLAG_5 (type
) = 0;
4918 TREE_LANG_FLAG_6 (type
) = 0;
4920 if (TREE_CODE (type
) == FUNCTION_TYPE
)
4922 /* Remove the const and volatile qualifiers from arguments. The
4923 C++ front end removes them, but the C front end does not,
4924 leading to false ODR violation errors when merging two
4925 instances of the same function signature compiled by
4926 different front ends. */
4929 for (p
= TYPE_ARG_TYPES (type
); p
; p
= TREE_CHAIN (p
))
4931 tree arg_type
= TREE_VALUE (p
);
4933 if (TYPE_READONLY (arg_type
) || TYPE_VOLATILE (arg_type
))
4935 int quals
= TYPE_QUALS (arg_type
)
4937 & ~TYPE_QUAL_VOLATILE
;
4938 TREE_VALUE (p
) = build_qualified_type (arg_type
, quals
);
4939 free_lang_data_in_type (TREE_VALUE (p
));
4944 /* Remove members that are not actually FIELD_DECLs from the field
4945 list of an aggregate. These occur in C++. */
4946 if (RECORD_OR_UNION_TYPE_P (type
))
4950 /* Note that TYPE_FIELDS can be shared across distinct
4951 TREE_TYPEs. Therefore, if the first field of TYPE_FIELDS is
4952 to be removed, we cannot set its TREE_CHAIN to NULL.
4953 Otherwise, we would not be able to find all the other fields
4954 in the other instances of this TREE_TYPE.
4956 This was causing an ICE in testsuite/g++.dg/lto/20080915.C. */
4958 member
= TYPE_FIELDS (type
);
4961 if (TREE_CODE (member
) == FIELD_DECL
4962 || TREE_CODE (member
) == TYPE_DECL
)
4965 TREE_CHAIN (prev
) = member
;
4967 TYPE_FIELDS (type
) = member
;
4971 member
= TREE_CHAIN (member
);
4975 TREE_CHAIN (prev
) = NULL_TREE
;
4977 TYPE_FIELDS (type
) = NULL_TREE
;
4979 TYPE_METHODS (type
) = NULL_TREE
;
4980 if (TYPE_BINFO (type
))
4982 free_lang_data_in_binfo (TYPE_BINFO (type
));
4983 if ((!BINFO_VTABLE (TYPE_BINFO (type
))
4984 || !flag_devirtualize
)
4985 && (!BINFO_N_BASE_BINFOS (TYPE_BINFO (type
))
4986 || debug_info_level
!= DINFO_LEVEL_NONE
))
4987 TYPE_BINFO (type
) = NULL
;
4992 /* For non-aggregate types, clear out the language slot (which
4993 overloads TYPE_BINFO). */
4994 TYPE_LANG_SLOT_1 (type
) = NULL_TREE
;
4996 if (INTEGRAL_TYPE_P (type
)
4997 || SCALAR_FLOAT_TYPE_P (type
)
4998 || FIXED_POINT_TYPE_P (type
))
5000 free_lang_data_in_one_sizepos (&TYPE_MIN_VALUE (type
));
5001 free_lang_data_in_one_sizepos (&TYPE_MAX_VALUE (type
));
5005 free_lang_data_in_one_sizepos (&TYPE_SIZE (type
));
5006 free_lang_data_in_one_sizepos (&TYPE_SIZE_UNIT (type
));
5008 if (TYPE_CONTEXT (type
)
5009 && TREE_CODE (TYPE_CONTEXT (type
)) == BLOCK
)
5011 tree ctx
= TYPE_CONTEXT (type
);
5014 ctx
= BLOCK_SUPERCONTEXT (ctx
);
5016 while (ctx
&& TREE_CODE (ctx
) == BLOCK
);
5017 TYPE_CONTEXT (type
) = ctx
;
5022 /* Return true if DECL may need an assembler name to be set. */
5025 need_assembler_name_p (tree decl
)
5027 /* We use DECL_ASSEMBLER_NAME to hold mangled type names for One Definition Rule
5029 if (flag_lto_odr_type_mering
5030 && TREE_CODE (decl
) == TYPE_DECL
5032 && decl
== TYPE_NAME (TREE_TYPE (decl
))
5033 && !is_lang_specific (TREE_TYPE (decl
))
5034 && AGGREGATE_TYPE_P (TREE_TYPE (decl
))
5035 && !variably_modified_type_p (TREE_TYPE (decl
), NULL_TREE
)
5036 && !type_in_anonymous_namespace_p (TREE_TYPE (decl
)))
5037 return !DECL_ASSEMBLER_NAME_SET_P (decl
);
5038 /* Only FUNCTION_DECLs and VAR_DECLs are considered. */
5039 if (TREE_CODE (decl
) != FUNCTION_DECL
5040 && TREE_CODE (decl
) != VAR_DECL
)
5043 /* If DECL already has its assembler name set, it does not need a
5045 if (!HAS_DECL_ASSEMBLER_NAME_P (decl
)
5046 || DECL_ASSEMBLER_NAME_SET_P (decl
))
5049 /* Abstract decls do not need an assembler name. */
5050 if (DECL_ABSTRACT_P (decl
))
5053 /* For VAR_DECLs, only static, public and external symbols need an
5055 if (TREE_CODE (decl
) == VAR_DECL
5056 && !TREE_STATIC (decl
)
5057 && !TREE_PUBLIC (decl
)
5058 && !DECL_EXTERNAL (decl
))
5061 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5063 /* Do not set assembler name on builtins. Allow RTL expansion to
5064 decide whether to expand inline or via a regular call. */
5065 if (DECL_BUILT_IN (decl
)
5066 && DECL_BUILT_IN_CLASS (decl
) != BUILT_IN_FRONTEND
)
5069 /* Functions represented in the callgraph need an assembler name. */
5070 if (cgraph_node::get (decl
) != NULL
)
5073 /* Unused and not public functions don't need an assembler name. */
5074 if (!TREE_USED (decl
) && !TREE_PUBLIC (decl
))
5082 /* Reset all language specific information still present in symbol
5086 free_lang_data_in_decl (tree decl
)
5088 gcc_assert (DECL_P (decl
));
5090 /* Give the FE a chance to remove its own data first. */
5091 lang_hooks
.free_lang_data (decl
);
5093 TREE_LANG_FLAG_0 (decl
) = 0;
5094 TREE_LANG_FLAG_1 (decl
) = 0;
5095 TREE_LANG_FLAG_2 (decl
) = 0;
5096 TREE_LANG_FLAG_3 (decl
) = 0;
5097 TREE_LANG_FLAG_4 (decl
) = 0;
5098 TREE_LANG_FLAG_5 (decl
) = 0;
5099 TREE_LANG_FLAG_6 (decl
) = 0;
5101 free_lang_data_in_one_sizepos (&DECL_SIZE (decl
));
5102 free_lang_data_in_one_sizepos (&DECL_SIZE_UNIT (decl
));
5103 if (TREE_CODE (decl
) == FIELD_DECL
)
5105 free_lang_data_in_one_sizepos (&DECL_FIELD_OFFSET (decl
));
5106 if (TREE_CODE (DECL_CONTEXT (decl
)) == QUAL_UNION_TYPE
)
5107 DECL_QUALIFIER (decl
) = NULL_TREE
;
5110 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5112 struct cgraph_node
*node
;
5113 if (!(node
= cgraph_node::get (decl
))
5114 || (!node
->definition
&& !node
->clones
))
5117 node
->release_body ();
5120 release_function_body (decl
);
5121 DECL_ARGUMENTS (decl
) = NULL
;
5122 DECL_RESULT (decl
) = NULL
;
5123 DECL_INITIAL (decl
) = error_mark_node
;
5126 if (gimple_has_body_p (decl
))
5130 /* If DECL has a gimple body, then the context for its
5131 arguments must be DECL. Otherwise, it doesn't really
5132 matter, as we will not be emitting any code for DECL. In
5133 general, there may be other instances of DECL created by
5134 the front end and since PARM_DECLs are generally shared,
5135 their DECL_CONTEXT changes as the replicas of DECL are
5136 created. The only time where DECL_CONTEXT is important
5137 is for the FUNCTION_DECLs that have a gimple body (since
5138 the PARM_DECL will be used in the function's body). */
5139 for (t
= DECL_ARGUMENTS (decl
); t
; t
= TREE_CHAIN (t
))
5140 DECL_CONTEXT (t
) = decl
;
5141 if (!DECL_FUNCTION_SPECIFIC_TARGET (decl
))
5142 DECL_FUNCTION_SPECIFIC_TARGET (decl
)
5143 = target_option_default_node
;
5144 if (!DECL_FUNCTION_SPECIFIC_OPTIMIZATION (decl
))
5145 DECL_FUNCTION_SPECIFIC_OPTIMIZATION (decl
)
5146 = optimization_default_node
;
5149 /* DECL_SAVED_TREE holds the GENERIC representation for DECL.
5150 At this point, it is not needed anymore. */
5151 DECL_SAVED_TREE (decl
) = NULL_TREE
;
5153 /* Clear the abstract origin if it refers to a method. Otherwise
5154 dwarf2out.c will ICE as we clear TYPE_METHODS and thus the
5155 origin will not be output correctly. */
5156 if (DECL_ABSTRACT_ORIGIN (decl
)
5157 && DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))
5158 && RECORD_OR_UNION_TYPE_P
5159 (DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))))
5160 DECL_ABSTRACT_ORIGIN (decl
) = NULL_TREE
;
5162 /* Sometimes the C++ frontend doesn't manage to transform a temporary
5163 DECL_VINDEX referring to itself into a vtable slot number as it
5164 should. Happens with functions that are copied and then forgotten
5165 about. Just clear it, it won't matter anymore. */
5166 if (DECL_VINDEX (decl
) && !tree_fits_shwi_p (DECL_VINDEX (decl
)))
5167 DECL_VINDEX (decl
) = NULL_TREE
;
5169 else if (TREE_CODE (decl
) == VAR_DECL
)
5171 if ((DECL_EXTERNAL (decl
)
5172 && (!TREE_STATIC (decl
) || !TREE_READONLY (decl
)))
5173 || (decl_function_context (decl
) && !TREE_STATIC (decl
)))
5174 DECL_INITIAL (decl
) = NULL_TREE
;
5176 else if (TREE_CODE (decl
) == TYPE_DECL
5177 || TREE_CODE (decl
) == FIELD_DECL
)
5178 DECL_INITIAL (decl
) = NULL_TREE
;
5179 else if (TREE_CODE (decl
) == TRANSLATION_UNIT_DECL
5180 && DECL_INITIAL (decl
)
5181 && TREE_CODE (DECL_INITIAL (decl
)) == BLOCK
)
5183 /* Strip builtins from the translation-unit BLOCK. We still have targets
5184 without builtin_decl_explicit support and also builtins are shared
5185 nodes and thus we can't use TREE_CHAIN in multiple lists. */
5186 tree
*nextp
= &BLOCK_VARS (DECL_INITIAL (decl
));
5190 if (TREE_CODE (var
) == FUNCTION_DECL
5191 && DECL_BUILT_IN (var
))
5192 *nextp
= TREE_CHAIN (var
);
5194 nextp
= &TREE_CHAIN (var
);
5200 /* Data used when collecting DECLs and TYPEs for language data removal. */
5202 struct free_lang_data_d
5204 /* Worklist to avoid excessive recursion. */
5207 /* Set of traversed objects. Used to avoid duplicate visits. */
5208 hash_set
<tree
> *pset
;
5210 /* Array of symbols to process with free_lang_data_in_decl. */
5213 /* Array of types to process with free_lang_data_in_type. */
5218 /* Save all language fields needed to generate proper debug information
5219 for DECL. This saves most fields cleared out by free_lang_data_in_decl. */
5222 save_debug_info_for_decl (tree t
)
5224 /*struct saved_debug_info_d *sdi;*/
5226 gcc_assert (debug_info_level
> DINFO_LEVEL_TERSE
&& t
&& DECL_P (t
));
5228 /* FIXME. Partial implementation for saving debug info removed. */
5232 /* Save all language fields needed to generate proper debug information
5233 for TYPE. This saves most fields cleared out by free_lang_data_in_type. */
5236 save_debug_info_for_type (tree t
)
5238 /*struct saved_debug_info_d *sdi;*/
5240 gcc_assert (debug_info_level
> DINFO_LEVEL_TERSE
&& t
&& TYPE_P (t
));
5242 /* FIXME. Partial implementation for saving debug info removed. */
5246 /* Add type or decl T to one of the list of tree nodes that need their
5247 language data removed. The lists are held inside FLD. */
5250 add_tree_to_fld_list (tree t
, struct free_lang_data_d
*fld
)
5254 fld
->decls
.safe_push (t
);
5255 if (debug_info_level
> DINFO_LEVEL_TERSE
)
5256 save_debug_info_for_decl (t
);
5258 else if (TYPE_P (t
))
5260 fld
->types
.safe_push (t
);
5261 if (debug_info_level
> DINFO_LEVEL_TERSE
)
5262 save_debug_info_for_type (t
);
5268 /* Push tree node T into FLD->WORKLIST. */
5271 fld_worklist_push (tree t
, struct free_lang_data_d
*fld
)
5273 if (t
&& !is_lang_specific (t
) && !fld
->pset
->contains (t
))
5274 fld
->worklist
.safe_push ((t
));
5278 /* Operand callback helper for free_lang_data_in_node. *TP is the
5279 subtree operand being considered. */
5282 find_decls_types_r (tree
*tp
, int *ws
, void *data
)
5285 struct free_lang_data_d
*fld
= (struct free_lang_data_d
*) data
;
5287 if (TREE_CODE (t
) == TREE_LIST
)
5290 /* Language specific nodes will be removed, so there is no need
5291 to gather anything under them. */
5292 if (is_lang_specific (t
))
5300 /* Note that walk_tree does not traverse every possible field in
5301 decls, so we have to do our own traversals here. */
5302 add_tree_to_fld_list (t
, fld
);
5304 fld_worklist_push (DECL_NAME (t
), fld
);
5305 fld_worklist_push (DECL_CONTEXT (t
), fld
);
5306 fld_worklist_push (DECL_SIZE (t
), fld
);
5307 fld_worklist_push (DECL_SIZE_UNIT (t
), fld
);
5309 /* We are going to remove everything under DECL_INITIAL for
5310 TYPE_DECLs. No point walking them. */
5311 if (TREE_CODE (t
) != TYPE_DECL
)
5312 fld_worklist_push (DECL_INITIAL (t
), fld
);
5314 fld_worklist_push (DECL_ATTRIBUTES (t
), fld
);
5315 fld_worklist_push (DECL_ABSTRACT_ORIGIN (t
), fld
);
5317 if (TREE_CODE (t
) == FUNCTION_DECL
)
5319 fld_worklist_push (DECL_ARGUMENTS (t
), fld
);
5320 fld_worklist_push (DECL_RESULT (t
), fld
);
5322 else if (TREE_CODE (t
) == TYPE_DECL
)
5324 fld_worklist_push (DECL_ORIGINAL_TYPE (t
), fld
);
5326 else if (TREE_CODE (t
) == FIELD_DECL
)
5328 fld_worklist_push (DECL_FIELD_OFFSET (t
), fld
);
5329 fld_worklist_push (DECL_BIT_FIELD_TYPE (t
), fld
);
5330 fld_worklist_push (DECL_FIELD_BIT_OFFSET (t
), fld
);
5331 fld_worklist_push (DECL_FCONTEXT (t
), fld
);
5334 if ((TREE_CODE (t
) == VAR_DECL
|| TREE_CODE (t
) == PARM_DECL
)
5335 && DECL_HAS_VALUE_EXPR_P (t
))
5336 fld_worklist_push (DECL_VALUE_EXPR (t
), fld
);
5338 if (TREE_CODE (t
) != FIELD_DECL
5339 && TREE_CODE (t
) != TYPE_DECL
)
5340 fld_worklist_push (TREE_CHAIN (t
), fld
);
5343 else if (TYPE_P (t
))
5345 /* Note that walk_tree does not traverse every possible field in
5346 types, so we have to do our own traversals here. */
5347 add_tree_to_fld_list (t
, fld
);
5349 if (!RECORD_OR_UNION_TYPE_P (t
))
5350 fld_worklist_push (TYPE_CACHED_VALUES (t
), fld
);
5351 fld_worklist_push (TYPE_SIZE (t
), fld
);
5352 fld_worklist_push (TYPE_SIZE_UNIT (t
), fld
);
5353 fld_worklist_push (TYPE_ATTRIBUTES (t
), fld
);
5354 fld_worklist_push (TYPE_POINTER_TO (t
), fld
);
5355 fld_worklist_push (TYPE_REFERENCE_TO (t
), fld
);
5356 fld_worklist_push (TYPE_NAME (t
), fld
);
5357 /* Do not walk TYPE_NEXT_PTR_TO or TYPE_NEXT_REF_TO. We do not stream
5358 them and thus do not and want not to reach unused pointer types
5360 if (!POINTER_TYPE_P (t
))
5361 fld_worklist_push (TYPE_MINVAL (t
), fld
);
5362 if (!RECORD_OR_UNION_TYPE_P (t
))
5363 fld_worklist_push (TYPE_MAXVAL (t
), fld
);
5364 fld_worklist_push (TYPE_MAIN_VARIANT (t
), fld
);
5365 /* Do not walk TYPE_NEXT_VARIANT. We do not stream it and thus
5366 do not and want not to reach unused variants this way. */
5367 if (TYPE_CONTEXT (t
))
5369 tree ctx
= TYPE_CONTEXT (t
);
5370 /* We adjust BLOCK TYPE_CONTEXTs to the innermost non-BLOCK one.
5371 So push that instead. */
5372 while (ctx
&& TREE_CODE (ctx
) == BLOCK
)
5373 ctx
= BLOCK_SUPERCONTEXT (ctx
);
5374 fld_worklist_push (ctx
, fld
);
5376 /* Do not walk TYPE_CANONICAL. We do not stream it and thus do not
5377 and want not to reach unused types this way. */
5379 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_BINFO (t
))
5383 FOR_EACH_VEC_ELT (*BINFO_BASE_BINFOS (TYPE_BINFO (t
)), i
, tem
)
5384 fld_worklist_push (TREE_TYPE (tem
), fld
);
5385 tem
= BINFO_VIRTUALS (TYPE_BINFO (t
));
5387 /* The Java FE overloads BINFO_VIRTUALS for its own purpose. */
5388 && TREE_CODE (tem
) == TREE_LIST
)
5391 fld_worklist_push (TREE_VALUE (tem
), fld
);
5392 tem
= TREE_CHAIN (tem
);
5396 if (RECORD_OR_UNION_TYPE_P (t
))
5399 /* Push all TYPE_FIELDS - there can be interleaving interesting
5400 and non-interesting things. */
5401 tem
= TYPE_FIELDS (t
);
5404 if (TREE_CODE (tem
) == FIELD_DECL
5405 || TREE_CODE (tem
) == TYPE_DECL
)
5406 fld_worklist_push (tem
, fld
);
5407 tem
= TREE_CHAIN (tem
);
5411 fld_worklist_push (TYPE_STUB_DECL (t
), fld
);
5414 else if (TREE_CODE (t
) == BLOCK
)
5417 for (tem
= BLOCK_VARS (t
); tem
; tem
= TREE_CHAIN (tem
))
5418 fld_worklist_push (tem
, fld
);
5419 for (tem
= BLOCK_SUBBLOCKS (t
); tem
; tem
= BLOCK_CHAIN (tem
))
5420 fld_worklist_push (tem
, fld
);
5421 fld_worklist_push (BLOCK_ABSTRACT_ORIGIN (t
), fld
);
5424 if (TREE_CODE (t
) != IDENTIFIER_NODE
5425 && CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_TYPED
))
5426 fld_worklist_push (TREE_TYPE (t
), fld
);
5432 /* Find decls and types in T. */
5435 find_decls_types (tree t
, struct free_lang_data_d
*fld
)
5439 if (!fld
->pset
->contains (t
))
5440 walk_tree (&t
, find_decls_types_r
, fld
, fld
->pset
);
5441 if (fld
->worklist
.is_empty ())
5443 t
= fld
->worklist
.pop ();
5447 /* Translate all the types in LIST with the corresponding runtime
5451 get_eh_types_for_runtime (tree list
)
5455 if (list
== NULL_TREE
)
5458 head
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
5460 list
= TREE_CHAIN (list
);
5463 tree n
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
5464 TREE_CHAIN (prev
) = n
;
5465 prev
= TREE_CHAIN (prev
);
5466 list
= TREE_CHAIN (list
);
5473 /* Find decls and types referenced in EH region R and store them in
5474 FLD->DECLS and FLD->TYPES. */
5477 find_decls_types_in_eh_region (eh_region r
, struct free_lang_data_d
*fld
)
5488 /* The types referenced in each catch must first be changed to the
5489 EH types used at runtime. This removes references to FE types
5491 for (c
= r
->u
.eh_try
.first_catch
; c
; c
= c
->next_catch
)
5493 c
->type_list
= get_eh_types_for_runtime (c
->type_list
);
5494 walk_tree (&c
->type_list
, find_decls_types_r
, fld
, fld
->pset
);
5499 case ERT_ALLOWED_EXCEPTIONS
:
5500 r
->u
.allowed
.type_list
5501 = get_eh_types_for_runtime (r
->u
.allowed
.type_list
);
5502 walk_tree (&r
->u
.allowed
.type_list
, find_decls_types_r
, fld
, fld
->pset
);
5505 case ERT_MUST_NOT_THROW
:
5506 walk_tree (&r
->u
.must_not_throw
.failure_decl
,
5507 find_decls_types_r
, fld
, fld
->pset
);
5513 /* Find decls and types referenced in cgraph node N and store them in
5514 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
5515 look for *every* kind of DECL and TYPE node reachable from N,
5516 including those embedded inside types and decls (i.e,, TYPE_DECLs,
5517 NAMESPACE_DECLs, etc). */
5520 find_decls_types_in_node (struct cgraph_node
*n
, struct free_lang_data_d
*fld
)
5523 struct function
*fn
;
5527 find_decls_types (n
->decl
, fld
);
5529 if (!gimple_has_body_p (n
->decl
))
5532 gcc_assert (current_function_decl
== NULL_TREE
&& cfun
== NULL
);
5534 fn
= DECL_STRUCT_FUNCTION (n
->decl
);
5536 /* Traverse locals. */
5537 FOR_EACH_LOCAL_DECL (fn
, ix
, t
)
5538 find_decls_types (t
, fld
);
5540 /* Traverse EH regions in FN. */
5543 FOR_ALL_EH_REGION_FN (r
, fn
)
5544 find_decls_types_in_eh_region (r
, fld
);
5547 /* Traverse every statement in FN. */
5548 FOR_EACH_BB_FN (bb
, fn
)
5551 gimple_stmt_iterator si
;
5554 for (psi
= gsi_start_phis (bb
); !gsi_end_p (psi
); gsi_next (&psi
))
5556 gphi
*phi
= psi
.phi ();
5558 for (i
= 0; i
< gimple_phi_num_args (phi
); i
++)
5560 tree
*arg_p
= gimple_phi_arg_def_ptr (phi
, i
);
5561 find_decls_types (*arg_p
, fld
);
5565 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
5567 gimple stmt
= gsi_stmt (si
);
5569 if (is_gimple_call (stmt
))
5570 find_decls_types (gimple_call_fntype (stmt
), fld
);
5572 for (i
= 0; i
< gimple_num_ops (stmt
); i
++)
5574 tree arg
= gimple_op (stmt
, i
);
5575 find_decls_types (arg
, fld
);
5582 /* Find decls and types referenced in varpool node N and store them in
5583 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
5584 look for *every* kind of DECL and TYPE node reachable from N,
5585 including those embedded inside types and decls (i.e,, TYPE_DECLs,
5586 NAMESPACE_DECLs, etc). */
5589 find_decls_types_in_var (varpool_node
*v
, struct free_lang_data_d
*fld
)
5591 find_decls_types (v
->decl
, fld
);
5594 /* If T needs an assembler name, have one created for it. */
5597 assign_assembler_name_if_neeeded (tree t
)
5599 if (need_assembler_name_p (t
))
5601 /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit
5602 diagnostics that use input_location to show locus
5603 information. The problem here is that, at this point,
5604 input_location is generally anchored to the end of the file
5605 (since the parser is long gone), so we don't have a good
5606 position to pin it to.
5608 To alleviate this problem, this uses the location of T's
5609 declaration. Examples of this are
5610 testsuite/g++.dg/template/cond2.C and
5611 testsuite/g++.dg/template/pr35240.C. */
5612 location_t saved_location
= input_location
;
5613 input_location
= DECL_SOURCE_LOCATION (t
);
5615 decl_assembler_name (t
);
5617 input_location
= saved_location
;
5622 /* Free language specific information for every operand and expression
5623 in every node of the call graph. This process operates in three stages:
5625 1- Every callgraph node and varpool node is traversed looking for
5626 decls and types embedded in them. This is a more exhaustive
5627 search than that done by find_referenced_vars, because it will
5628 also collect individual fields, decls embedded in types, etc.
5630 2- All the decls found are sent to free_lang_data_in_decl.
5632 3- All the types found are sent to free_lang_data_in_type.
5634 The ordering between decls and types is important because
5635 free_lang_data_in_decl sets assembler names, which includes
5636 mangling. So types cannot be freed up until assembler names have
5640 free_lang_data_in_cgraph (void)
5642 struct cgraph_node
*n
;
5644 struct free_lang_data_d fld
;
5649 /* Initialize sets and arrays to store referenced decls and types. */
5650 fld
.pset
= new hash_set
<tree
>;
5651 fld
.worklist
.create (0);
5652 fld
.decls
.create (100);
5653 fld
.types
.create (100);
5655 /* Find decls and types in the body of every function in the callgraph. */
5656 FOR_EACH_FUNCTION (n
)
5657 find_decls_types_in_node (n
, &fld
);
5659 FOR_EACH_VEC_SAFE_ELT (alias_pairs
, i
, p
)
5660 find_decls_types (p
->decl
, &fld
);
5662 /* Find decls and types in every varpool symbol. */
5663 FOR_EACH_VARIABLE (v
)
5664 find_decls_types_in_var (v
, &fld
);
5666 /* Set the assembler name on every decl found. We need to do this
5667 now because free_lang_data_in_decl will invalidate data needed
5668 for mangling. This breaks mangling on interdependent decls. */
5669 FOR_EACH_VEC_ELT (fld
.decls
, i
, t
)
5670 assign_assembler_name_if_neeeded (t
);
5672 /* Traverse every decl found freeing its language data. */
5673 FOR_EACH_VEC_ELT (fld
.decls
, i
, t
)
5674 free_lang_data_in_decl (t
);
5676 /* Traverse every type found freeing its language data. */
5677 FOR_EACH_VEC_ELT (fld
.types
, i
, t
)
5678 free_lang_data_in_type (t
);
5681 fld
.worklist
.release ();
5682 fld
.decls
.release ();
5683 fld
.types
.release ();
5687 /* Free resources that are used by FE but are not needed once they are done. */
5690 free_lang_data (void)
5694 /* If we are the LTO frontend we have freed lang-specific data already. */
5696 || !flag_generate_lto
)
5699 /* Allocate and assign alias sets to the standard integer types
5700 while the slots are still in the way the frontends generated them. */
5701 for (i
= 0; i
< itk_none
; ++i
)
5702 if (integer_types
[i
])
5703 TYPE_ALIAS_SET (integer_types
[i
]) = get_alias_set (integer_types
[i
]);
5705 /* Traverse the IL resetting language specific information for
5706 operands, expressions, etc. */
5707 free_lang_data_in_cgraph ();
5709 /* Create gimple variants for common types. */
5710 ptrdiff_type_node
= integer_type_node
;
5711 fileptr_type_node
= ptr_type_node
;
5713 /* Reset some langhooks. Do not reset types_compatible_p, it may
5714 still be used indirectly via the get_alias_set langhook. */
5715 lang_hooks
.dwarf_name
= lhd_dwarf_name
;
5716 lang_hooks
.decl_printable_name
= gimple_decl_printable_name
;
5717 /* We do not want the default decl_assembler_name implementation,
5718 rather if we have fixed everything we want a wrapper around it
5719 asserting that all non-local symbols already got their assembler
5720 name and only produce assembler names for local symbols. Or rather
5721 make sure we never call decl_assembler_name on local symbols and
5722 devise a separate, middle-end private scheme for it. */
5724 /* Reset diagnostic machinery. */
5725 tree_diagnostics_defaults (global_dc
);
5733 const pass_data pass_data_ipa_free_lang_data
=
5735 SIMPLE_IPA_PASS
, /* type */
5736 "*free_lang_data", /* name */
5737 OPTGROUP_NONE
, /* optinfo_flags */
5738 TV_IPA_FREE_LANG_DATA
, /* tv_id */
5739 0, /* properties_required */
5740 0, /* properties_provided */
5741 0, /* properties_destroyed */
5742 0, /* todo_flags_start */
5743 0, /* todo_flags_finish */
5746 class pass_ipa_free_lang_data
: public simple_ipa_opt_pass
5749 pass_ipa_free_lang_data (gcc::context
*ctxt
)
5750 : simple_ipa_opt_pass (pass_data_ipa_free_lang_data
, ctxt
)
5753 /* opt_pass methods: */
5754 virtual unsigned int execute (function
*) { return free_lang_data (); }
5756 }; // class pass_ipa_free_lang_data
5760 simple_ipa_opt_pass
*
5761 make_pass_ipa_free_lang_data (gcc::context
*ctxt
)
5763 return new pass_ipa_free_lang_data (ctxt
);
5766 /* The backbone of is_attribute_p(). ATTR_LEN is the string length of
5767 ATTR_NAME. Also used internally by remove_attribute(). */
5769 private_is_attribute_p (const char *attr_name
, size_t attr_len
, const_tree ident
)
5771 size_t ident_len
= IDENTIFIER_LENGTH (ident
);
5773 if (ident_len
== attr_len
)
5775 if (strcmp (attr_name
, IDENTIFIER_POINTER (ident
)) == 0)
5778 else if (ident_len
== attr_len
+ 4)
5780 /* There is the possibility that ATTR is 'text' and IDENT is
5782 const char *p
= IDENTIFIER_POINTER (ident
);
5783 if (p
[0] == '_' && p
[1] == '_'
5784 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
5785 && strncmp (attr_name
, p
+ 2, attr_len
) == 0)
5792 /* The backbone of lookup_attribute(). ATTR_LEN is the string length
5793 of ATTR_NAME, and LIST is not NULL_TREE. */
5795 private_lookup_attribute (const char *attr_name
, size_t attr_len
, tree list
)
5799 size_t ident_len
= IDENTIFIER_LENGTH (get_attribute_name (list
));
5801 if (ident_len
== attr_len
)
5803 if (!strcmp (attr_name
,
5804 IDENTIFIER_POINTER (get_attribute_name (list
))))
5807 /* TODO: If we made sure that attributes were stored in the
5808 canonical form without '__...__' (ie, as in 'text' as opposed
5809 to '__text__') then we could avoid the following case. */
5810 else if (ident_len
== attr_len
+ 4)
5812 const char *p
= IDENTIFIER_POINTER (get_attribute_name (list
));
5813 if (p
[0] == '_' && p
[1] == '_'
5814 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
5815 && strncmp (attr_name
, p
+ 2, attr_len
) == 0)
5818 list
= TREE_CHAIN (list
);
5824 /* Given an attribute name ATTR_NAME and a list of attributes LIST,
5825 return a pointer to the attribute's list first element if the attribute
5826 starts with ATTR_NAME. ATTR_NAME must be in the form 'text' (not
5830 private_lookup_attribute_by_prefix (const char *attr_name
, size_t attr_len
,
5835 size_t ident_len
= IDENTIFIER_LENGTH (get_attribute_name (list
));
5837 if (attr_len
> ident_len
)
5839 list
= TREE_CHAIN (list
);
5843 const char *p
= IDENTIFIER_POINTER (get_attribute_name (list
));
5845 if (strncmp (attr_name
, p
, attr_len
) == 0)
5848 /* TODO: If we made sure that attributes were stored in the
5849 canonical form without '__...__' (ie, as in 'text' as opposed
5850 to '__text__') then we could avoid the following case. */
5851 if (p
[0] == '_' && p
[1] == '_' &&
5852 strncmp (attr_name
, p
+ 2, attr_len
) == 0)
5855 list
= TREE_CHAIN (list
);
5862 /* A variant of lookup_attribute() that can be used with an identifier
5863 as the first argument, and where the identifier can be either
5864 'text' or '__text__'.
5866 Given an attribute ATTR_IDENTIFIER, and a list of attributes LIST,
5867 return a pointer to the attribute's list element if the attribute
5868 is part of the list, or NULL_TREE if not found. If the attribute
5869 appears more than once, this only returns the first occurrence; the
5870 TREE_CHAIN of the return value should be passed back in if further
5871 occurrences are wanted. ATTR_IDENTIFIER must be an identifier but
5872 can be in the form 'text' or '__text__'. */
5874 lookup_ident_attribute (tree attr_identifier
, tree list
)
5876 gcc_checking_assert (TREE_CODE (attr_identifier
) == IDENTIFIER_NODE
);
5880 gcc_checking_assert (TREE_CODE (get_attribute_name (list
))
5881 == IDENTIFIER_NODE
);
5883 /* Identifiers can be compared directly for equality. */
5884 if (attr_identifier
== get_attribute_name (list
))
5887 /* If they are not equal, they may still be one in the form
5888 'text' while the other one is in the form '__text__'. TODO:
5889 If we were storing attributes in normalized 'text' form, then
5890 this could all go away and we could take full advantage of
5891 the fact that we're comparing identifiers. :-) */
5893 size_t attr_len
= IDENTIFIER_LENGTH (attr_identifier
);
5894 size_t ident_len
= IDENTIFIER_LENGTH (get_attribute_name (list
));
5896 if (ident_len
== attr_len
+ 4)
5898 const char *p
= IDENTIFIER_POINTER (get_attribute_name (list
));
5899 const char *q
= IDENTIFIER_POINTER (attr_identifier
);
5900 if (p
[0] == '_' && p
[1] == '_'
5901 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
5902 && strncmp (q
, p
+ 2, attr_len
) == 0)
5905 else if (ident_len
+ 4 == attr_len
)
5907 const char *p
= IDENTIFIER_POINTER (get_attribute_name (list
));
5908 const char *q
= IDENTIFIER_POINTER (attr_identifier
);
5909 if (q
[0] == '_' && q
[1] == '_'
5910 && q
[attr_len
- 2] == '_' && q
[attr_len
- 1] == '_'
5911 && strncmp (q
+ 2, p
, ident_len
) == 0)
5915 list
= TREE_CHAIN (list
);
5921 /* Remove any instances of attribute ATTR_NAME in LIST and return the
5925 remove_attribute (const char *attr_name
, tree list
)
5928 size_t attr_len
= strlen (attr_name
);
5930 gcc_checking_assert (attr_name
[0] != '_');
5932 for (p
= &list
; *p
; )
5935 /* TODO: If we were storing attributes in normalized form, here
5936 we could use a simple strcmp(). */
5937 if (private_is_attribute_p (attr_name
, attr_len
, get_attribute_name (l
)))
5938 *p
= TREE_CHAIN (l
);
5940 p
= &TREE_CHAIN (l
);
5946 /* Return an attribute list that is the union of a1 and a2. */
5949 merge_attributes (tree a1
, tree a2
)
5953 /* Either one unset? Take the set one. */
5955 if ((attributes
= a1
) == 0)
5958 /* One that completely contains the other? Take it. */
5960 else if (a2
!= 0 && ! attribute_list_contained (a1
, a2
))
5962 if (attribute_list_contained (a2
, a1
))
5966 /* Pick the longest list, and hang on the other list. */
5968 if (list_length (a1
) < list_length (a2
))
5969 attributes
= a2
, a2
= a1
;
5971 for (; a2
!= 0; a2
= TREE_CHAIN (a2
))
5974 for (a
= lookup_ident_attribute (get_attribute_name (a2
),
5976 a
!= NULL_TREE
&& !attribute_value_equal (a
, a2
);
5977 a
= lookup_ident_attribute (get_attribute_name (a2
),
5982 a1
= copy_node (a2
);
5983 TREE_CHAIN (a1
) = attributes
;
5992 /* Given types T1 and T2, merge their attributes and return
5996 merge_type_attributes (tree t1
, tree t2
)
5998 return merge_attributes (TYPE_ATTRIBUTES (t1
),
5999 TYPE_ATTRIBUTES (t2
));
6002 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
6006 merge_decl_attributes (tree olddecl
, tree newdecl
)
6008 return merge_attributes (DECL_ATTRIBUTES (olddecl
),
6009 DECL_ATTRIBUTES (newdecl
));
6012 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
6014 /* Specialization of merge_decl_attributes for various Windows targets.
6016 This handles the following situation:
6018 __declspec (dllimport) int foo;
6021 The second instance of `foo' nullifies the dllimport. */
6024 merge_dllimport_decl_attributes (tree old
, tree new_tree
)
6027 int delete_dllimport_p
= 1;
6029 /* What we need to do here is remove from `old' dllimport if it doesn't
6030 appear in `new'. dllimport behaves like extern: if a declaration is
6031 marked dllimport and a definition appears later, then the object
6032 is not dllimport'd. We also remove a `new' dllimport if the old list
6033 contains dllexport: dllexport always overrides dllimport, regardless
6034 of the order of declaration. */
6035 if (!VAR_OR_FUNCTION_DECL_P (new_tree
))
6036 delete_dllimport_p
= 0;
6037 else if (DECL_DLLIMPORT_P (new_tree
)
6038 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (old
)))
6040 DECL_DLLIMPORT_P (new_tree
) = 0;
6041 warning (OPT_Wattributes
, "%q+D already declared with dllexport attribute: "
6042 "dllimport ignored", new_tree
);
6044 else if (DECL_DLLIMPORT_P (old
) && !DECL_DLLIMPORT_P (new_tree
))
6046 /* Warn about overriding a symbol that has already been used, e.g.:
6047 extern int __attribute__ ((dllimport)) foo;
6048 int* bar () {return &foo;}
6051 if (TREE_USED (old
))
6053 warning (0, "%q+D redeclared without dllimport attribute "
6054 "after being referenced with dll linkage", new_tree
);
6055 /* If we have used a variable's address with dllimport linkage,
6056 keep the old DECL_DLLIMPORT_P flag: the ADDR_EXPR using the
6057 decl may already have had TREE_CONSTANT computed.
6058 We still remove the attribute so that assembler code refers
6059 to '&foo rather than '_imp__foo'. */
6060 if (TREE_CODE (old
) == VAR_DECL
&& TREE_ADDRESSABLE (old
))
6061 DECL_DLLIMPORT_P (new_tree
) = 1;
6064 /* Let an inline definition silently override the external reference,
6065 but otherwise warn about attribute inconsistency. */
6066 else if (TREE_CODE (new_tree
) == VAR_DECL
6067 || !DECL_DECLARED_INLINE_P (new_tree
))
6068 warning (OPT_Wattributes
, "%q+D redeclared without dllimport attribute: "
6069 "previous dllimport ignored", new_tree
);
6072 delete_dllimport_p
= 0;
6074 a
= merge_attributes (DECL_ATTRIBUTES (old
), DECL_ATTRIBUTES (new_tree
));
6076 if (delete_dllimport_p
)
6077 a
= remove_attribute ("dllimport", a
);
6082 /* Handle a "dllimport" or "dllexport" attribute; arguments as in
6083 struct attribute_spec.handler. */
6086 handle_dll_attribute (tree
* pnode
, tree name
, tree args
, int flags
,
6092 /* These attributes may apply to structure and union types being created,
6093 but otherwise should pass to the declaration involved. */
6096 if (flags
& ((int) ATTR_FLAG_DECL_NEXT
| (int) ATTR_FLAG_FUNCTION_NEXT
6097 | (int) ATTR_FLAG_ARRAY_NEXT
))
6099 *no_add_attrs
= true;
6100 return tree_cons (name
, args
, NULL_TREE
);
6102 if (TREE_CODE (node
) == RECORD_TYPE
6103 || TREE_CODE (node
) == UNION_TYPE
)
6105 node
= TYPE_NAME (node
);
6111 warning (OPT_Wattributes
, "%qE attribute ignored",
6113 *no_add_attrs
= true;
6118 if (TREE_CODE (node
) != FUNCTION_DECL
6119 && TREE_CODE (node
) != VAR_DECL
6120 && TREE_CODE (node
) != TYPE_DECL
)
6122 *no_add_attrs
= true;
6123 warning (OPT_Wattributes
, "%qE attribute ignored",
6128 if (TREE_CODE (node
) == TYPE_DECL
6129 && TREE_CODE (TREE_TYPE (node
)) != RECORD_TYPE
6130 && TREE_CODE (TREE_TYPE (node
)) != UNION_TYPE
)
6132 *no_add_attrs
= true;
6133 warning (OPT_Wattributes
, "%qE attribute ignored",
6138 is_dllimport
= is_attribute_p ("dllimport", name
);
6140 /* Report error on dllimport ambiguities seen now before they cause
6144 /* Honor any target-specific overrides. */
6145 if (!targetm
.valid_dllimport_attribute_p (node
))
6146 *no_add_attrs
= true;
6148 else if (TREE_CODE (node
) == FUNCTION_DECL
6149 && DECL_DECLARED_INLINE_P (node
))
6151 warning (OPT_Wattributes
, "inline function %q+D declared as "
6152 " dllimport: attribute ignored", node
);
6153 *no_add_attrs
= true;
6155 /* Like MS, treat definition of dllimported variables and
6156 non-inlined functions on declaration as syntax errors. */
6157 else if (TREE_CODE (node
) == FUNCTION_DECL
&& DECL_INITIAL (node
))
6159 error ("function %q+D definition is marked dllimport", node
);
6160 *no_add_attrs
= true;
6163 else if (TREE_CODE (node
) == VAR_DECL
)
6165 if (DECL_INITIAL (node
))
6167 error ("variable %q+D definition is marked dllimport",
6169 *no_add_attrs
= true;
6172 /* `extern' needn't be specified with dllimport.
6173 Specify `extern' now and hope for the best. Sigh. */
6174 DECL_EXTERNAL (node
) = 1;
6175 /* Also, implicitly give dllimport'd variables declared within
6176 a function global scope, unless declared static. */
6177 if (current_function_decl
!= NULL_TREE
&& !TREE_STATIC (node
))
6178 TREE_PUBLIC (node
) = 1;
6181 if (*no_add_attrs
== false)
6182 DECL_DLLIMPORT_P (node
) = 1;
6184 else if (TREE_CODE (node
) == FUNCTION_DECL
6185 && DECL_DECLARED_INLINE_P (node
)
6186 && flag_keep_inline_dllexport
)
6187 /* An exported function, even if inline, must be emitted. */
6188 DECL_EXTERNAL (node
) = 0;
6190 /* Report error if symbol is not accessible at global scope. */
6191 if (!TREE_PUBLIC (node
)
6192 && (TREE_CODE (node
) == VAR_DECL
6193 || TREE_CODE (node
) == FUNCTION_DECL
))
6195 error ("external linkage required for symbol %q+D because of "
6196 "%qE attribute", node
, name
);
6197 *no_add_attrs
= true;
6200 /* A dllexport'd entity must have default visibility so that other
6201 program units (shared libraries or the main executable) can see
6202 it. A dllimport'd entity must have default visibility so that
6203 the linker knows that undefined references within this program
6204 unit can be resolved by the dynamic linker. */
6207 if (DECL_VISIBILITY_SPECIFIED (node
)
6208 && DECL_VISIBILITY (node
) != VISIBILITY_DEFAULT
)
6209 error ("%qE implies default visibility, but %qD has already "
6210 "been declared with a different visibility",
6212 DECL_VISIBILITY (node
) = VISIBILITY_DEFAULT
;
6213 DECL_VISIBILITY_SPECIFIED (node
) = 1;
6219 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
6221 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
6222 of the various TYPE_QUAL values. */
6225 set_type_quals (tree type
, int type_quals
)
6227 TYPE_READONLY (type
) = (type_quals
& TYPE_QUAL_CONST
) != 0;
6228 TYPE_VOLATILE (type
) = (type_quals
& TYPE_QUAL_VOLATILE
) != 0;
6229 TYPE_RESTRICT (type
) = (type_quals
& TYPE_QUAL_RESTRICT
) != 0;
6230 TYPE_ATOMIC (type
) = (type_quals
& TYPE_QUAL_ATOMIC
) != 0;
6231 TYPE_ADDR_SPACE (type
) = DECODE_QUAL_ADDR_SPACE (type_quals
);
6234 /* Returns true iff unqualified CAND and BASE are equivalent. */
6237 check_base_type (const_tree cand
, const_tree base
)
6239 return (TYPE_NAME (cand
) == TYPE_NAME (base
)
6240 /* Apparently this is needed for Objective-C. */
6241 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
6242 /* Check alignment. */
6243 && TYPE_ALIGN (cand
) == TYPE_ALIGN (base
)
6244 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
6245 TYPE_ATTRIBUTES (base
)));
6248 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
6251 check_qualified_type (const_tree cand
, const_tree base
, int type_quals
)
6253 return (TYPE_QUALS (cand
) == type_quals
6254 && check_base_type (cand
, base
));
6257 /* Returns true iff CAND is equivalent to BASE with ALIGN. */
6260 check_aligned_type (const_tree cand
, const_tree base
, unsigned int align
)
6262 return (TYPE_QUALS (cand
) == TYPE_QUALS (base
)
6263 && TYPE_NAME (cand
) == TYPE_NAME (base
)
6264 /* Apparently this is needed for Objective-C. */
6265 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
6266 /* Check alignment. */
6267 && TYPE_ALIGN (cand
) == align
6268 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
6269 TYPE_ATTRIBUTES (base
)));
6272 /* This function checks to see if TYPE matches the size one of the built-in
6273 atomic types, and returns that core atomic type. */
6276 find_atomic_core_type (tree type
)
6278 tree base_atomic_type
;
6280 /* Only handle complete types. */
6281 if (TYPE_SIZE (type
) == NULL_TREE
)
6284 HOST_WIDE_INT type_size
= tree_to_uhwi (TYPE_SIZE (type
));
6288 base_atomic_type
= atomicQI_type_node
;
6292 base_atomic_type
= atomicHI_type_node
;
6296 base_atomic_type
= atomicSI_type_node
;
6300 base_atomic_type
= atomicDI_type_node
;
6304 base_atomic_type
= atomicTI_type_node
;
6308 base_atomic_type
= NULL_TREE
;
6311 return base_atomic_type
;
6314 /* Return a version of the TYPE, qualified as indicated by the
6315 TYPE_QUALS, if one exists. If no qualified version exists yet,
6316 return NULL_TREE. */
6319 get_qualified_type (tree type
, int type_quals
)
6323 if (TYPE_QUALS (type
) == type_quals
)
6326 /* Search the chain of variants to see if there is already one there just
6327 like the one we need to have. If so, use that existing one. We must
6328 preserve the TYPE_NAME, since there is code that depends on this. */
6329 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
6330 if (check_qualified_type (t
, type
, type_quals
))
6336 /* Like get_qualified_type, but creates the type if it does not
6337 exist. This function never returns NULL_TREE. */
6340 build_qualified_type (tree type
, int type_quals
)
6344 /* See if we already have the appropriate qualified variant. */
6345 t
= get_qualified_type (type
, type_quals
);
6347 /* If not, build it. */
6350 t
= build_variant_type_copy (type
);
6351 set_type_quals (t
, type_quals
);
6353 if (((type_quals
& TYPE_QUAL_ATOMIC
) == TYPE_QUAL_ATOMIC
))
6355 /* See if this object can map to a basic atomic type. */
6356 tree atomic_type
= find_atomic_core_type (type
);
6359 /* Ensure the alignment of this type is compatible with
6360 the required alignment of the atomic type. */
6361 if (TYPE_ALIGN (atomic_type
) > TYPE_ALIGN (t
))
6362 TYPE_ALIGN (t
) = TYPE_ALIGN (atomic_type
);
6366 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
6367 /* Propagate structural equality. */
6368 SET_TYPE_STRUCTURAL_EQUALITY (t
);
6369 else if (TYPE_CANONICAL (type
) != type
)
6370 /* Build the underlying canonical type, since it is different
6373 tree c
= build_qualified_type (TYPE_CANONICAL (type
), type_quals
);
6374 TYPE_CANONICAL (t
) = TYPE_CANONICAL (c
);
6377 /* T is its own canonical type. */
6378 TYPE_CANONICAL (t
) = t
;
6385 /* Create a variant of type T with alignment ALIGN. */
6388 build_aligned_type (tree type
, unsigned int align
)
6392 if (TYPE_PACKED (type
)
6393 || TYPE_ALIGN (type
) == align
)
6396 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
6397 if (check_aligned_type (t
, type
, align
))
6400 t
= build_variant_type_copy (type
);
6401 TYPE_ALIGN (t
) = align
;
6406 /* Create a new distinct copy of TYPE. The new type is made its own
6407 MAIN_VARIANT. If TYPE requires structural equality checks, the
6408 resulting type requires structural equality checks; otherwise, its
6409 TYPE_CANONICAL points to itself. */
6412 build_distinct_type_copy (tree type
)
6414 tree t
= copy_node (type
);
6416 TYPE_POINTER_TO (t
) = 0;
6417 TYPE_REFERENCE_TO (t
) = 0;
6419 /* Set the canonical type either to a new equivalence class, or
6420 propagate the need for structural equality checks. */
6421 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
6422 SET_TYPE_STRUCTURAL_EQUALITY (t
);
6424 TYPE_CANONICAL (t
) = t
;
6426 /* Make it its own variant. */
6427 TYPE_MAIN_VARIANT (t
) = t
;
6428 TYPE_NEXT_VARIANT (t
) = 0;
6430 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
6431 whose TREE_TYPE is not t. This can also happen in the Ada
6432 frontend when using subtypes. */
6437 /* Create a new variant of TYPE, equivalent but distinct. This is so
6438 the caller can modify it. TYPE_CANONICAL for the return type will
6439 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
6440 are considered equal by the language itself (or that both types
6441 require structural equality checks). */
6444 build_variant_type_copy (tree type
)
6446 tree t
, m
= TYPE_MAIN_VARIANT (type
);
6448 t
= build_distinct_type_copy (type
);
6450 /* Since we're building a variant, assume that it is a non-semantic
6451 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
6452 TYPE_CANONICAL (t
) = TYPE_CANONICAL (type
);
6454 /* Add the new type to the chain of variants of TYPE. */
6455 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (m
);
6456 TYPE_NEXT_VARIANT (m
) = t
;
6457 TYPE_MAIN_VARIANT (t
) = m
;
6462 /* Return true if the from tree in both tree maps are equal. */
6465 tree_map_base_eq (const void *va
, const void *vb
)
6467 const struct tree_map_base
*const a
= (const struct tree_map_base
*) va
,
6468 *const b
= (const struct tree_map_base
*) vb
;
6469 return (a
->from
== b
->from
);
6472 /* Hash a from tree in a tree_base_map. */
6475 tree_map_base_hash (const void *item
)
6477 return htab_hash_pointer (((const struct tree_map_base
*)item
)->from
);
6480 /* Return true if this tree map structure is marked for garbage collection
6481 purposes. We simply return true if the from tree is marked, so that this
6482 structure goes away when the from tree goes away. */
6485 tree_map_base_marked_p (const void *p
)
6487 return ggc_marked_p (((const struct tree_map_base
*) p
)->from
);
6490 /* Hash a from tree in a tree_map. */
6493 tree_map_hash (const void *item
)
6495 return (((const struct tree_map
*) item
)->hash
);
6498 /* Hash a from tree in a tree_decl_map. */
6501 tree_decl_map_hash (const void *item
)
6503 return DECL_UID (((const struct tree_decl_map
*) item
)->base
.from
);
6506 /* Return the initialization priority for DECL. */
6509 decl_init_priority_lookup (tree decl
)
6511 symtab_node
*snode
= symtab_node::get (decl
);
6514 return DEFAULT_INIT_PRIORITY
;
6516 snode
->get_init_priority ();
6519 /* Return the finalization priority for DECL. */
6522 decl_fini_priority_lookup (tree decl
)
6524 cgraph_node
*node
= cgraph_node::get (decl
);
6527 return DEFAULT_INIT_PRIORITY
;
6529 node
->get_fini_priority ();
6532 /* Set the initialization priority for DECL to PRIORITY. */
6535 decl_init_priority_insert (tree decl
, priority_type priority
)
6537 struct symtab_node
*snode
;
6539 if (priority
== DEFAULT_INIT_PRIORITY
)
6541 snode
= symtab_node::get (decl
);
6545 else if (TREE_CODE (decl
) == VAR_DECL
)
6546 snode
= varpool_node::get_create (decl
);
6548 snode
= cgraph_node::get_create (decl
);
6549 snode
->set_init_priority (priority
);
6552 /* Set the finalization priority for DECL to PRIORITY. */
6555 decl_fini_priority_insert (tree decl
, priority_type priority
)
6557 struct cgraph_node
*node
;
6559 if (priority
== DEFAULT_INIT_PRIORITY
)
6561 node
= cgraph_node::get (decl
);
6566 node
= cgraph_node::get_create (decl
);
6567 node
->set_fini_priority (priority
);
6570 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
6573 print_debug_expr_statistics (void)
6575 fprintf (stderr
, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
6576 (long) htab_size (debug_expr_for_decl
),
6577 (long) htab_elements (debug_expr_for_decl
),
6578 htab_collisions (debug_expr_for_decl
));
6581 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
6584 print_value_expr_statistics (void)
6586 fprintf (stderr
, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
6587 (long) htab_size (value_expr_for_decl
),
6588 (long) htab_elements (value_expr_for_decl
),
6589 htab_collisions (value_expr_for_decl
));
6592 /* Lookup a debug expression for FROM, and return it if we find one. */
6595 decl_debug_expr_lookup (tree from
)
6597 struct tree_decl_map
*h
, in
;
6598 in
.base
.from
= from
;
6600 h
= (struct tree_decl_map
*)
6601 htab_find_with_hash (debug_expr_for_decl
, &in
, DECL_UID (from
));
6607 /* Insert a mapping FROM->TO in the debug expression hashtable. */
6610 decl_debug_expr_insert (tree from
, tree to
)
6612 struct tree_decl_map
*h
;
6615 h
= ggc_alloc
<tree_decl_map
> ();
6616 h
->base
.from
= from
;
6618 loc
= htab_find_slot_with_hash (debug_expr_for_decl
, h
, DECL_UID (from
),
6620 *(struct tree_decl_map
**) loc
= h
;
6623 /* Lookup a value expression for FROM, and return it if we find one. */
6626 decl_value_expr_lookup (tree from
)
6628 struct tree_decl_map
*h
, in
;
6629 in
.base
.from
= from
;
6631 h
= (struct tree_decl_map
*)
6632 htab_find_with_hash (value_expr_for_decl
, &in
, DECL_UID (from
));
6638 /* Insert a mapping FROM->TO in the value expression hashtable. */
6641 decl_value_expr_insert (tree from
, tree to
)
6643 struct tree_decl_map
*h
;
6646 h
= ggc_alloc
<tree_decl_map
> ();
6647 h
->base
.from
= from
;
6649 loc
= htab_find_slot_with_hash (value_expr_for_decl
, h
, DECL_UID (from
),
6651 *(struct tree_decl_map
**) loc
= h
;
6654 /* Lookup a vector of debug arguments for FROM, and return it if we
6658 decl_debug_args_lookup (tree from
)
6660 struct tree_vec_map
*h
, in
;
6662 if (!DECL_HAS_DEBUG_ARGS_P (from
))
6664 gcc_checking_assert (debug_args_for_decl
!= NULL
);
6665 in
.base
.from
= from
;
6666 h
= (struct tree_vec_map
*)
6667 htab_find_with_hash (debug_args_for_decl
, &in
, DECL_UID (from
));
6673 /* Insert a mapping FROM->empty vector of debug arguments in the value
6674 expression hashtable. */
6677 decl_debug_args_insert (tree from
)
6679 struct tree_vec_map
*h
;
6682 if (DECL_HAS_DEBUG_ARGS_P (from
))
6683 return decl_debug_args_lookup (from
);
6684 if (debug_args_for_decl
== NULL
)
6685 debug_args_for_decl
= htab_create_ggc (64, tree_vec_map_hash
,
6686 tree_vec_map_eq
, 0);
6687 h
= ggc_alloc
<tree_vec_map
> ();
6688 h
->base
.from
= from
;
6690 loc
= htab_find_slot_with_hash (debug_args_for_decl
, h
, DECL_UID (from
),
6692 *(struct tree_vec_map
**) loc
= h
;
6693 DECL_HAS_DEBUG_ARGS_P (from
) = 1;
6697 /* Hashing of types so that we don't make duplicates.
6698 The entry point is `type_hash_canon'. */
6700 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
6701 with types in the TREE_VALUE slots), by adding the hash codes
6702 of the individual types. */
6705 type_hash_list (const_tree list
, inchash::hash
&hstate
)
6709 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
6710 if (TREE_VALUE (tail
) != error_mark_node
)
6711 hstate
.add_object (TYPE_HASH (TREE_VALUE (tail
)));
6714 /* These are the Hashtable callback functions. */
6716 /* Returns true iff the types are equivalent. */
6719 type_hash_eq (const void *va
, const void *vb
)
6721 const struct type_hash
*const a
= (const struct type_hash
*) va
,
6722 *const b
= (const struct type_hash
*) vb
;
6724 /* First test the things that are the same for all types. */
6725 if (a
->hash
!= b
->hash
6726 || TREE_CODE (a
->type
) != TREE_CODE (b
->type
)
6727 || TREE_TYPE (a
->type
) != TREE_TYPE (b
->type
)
6728 || !attribute_list_equal (TYPE_ATTRIBUTES (a
->type
),
6729 TYPE_ATTRIBUTES (b
->type
))
6730 || (TREE_CODE (a
->type
) != COMPLEX_TYPE
6731 && TYPE_NAME (a
->type
) != TYPE_NAME (b
->type
)))
6734 /* Be careful about comparing arrays before and after the element type
6735 has been completed; don't compare TYPE_ALIGN unless both types are
6737 if (COMPLETE_TYPE_P (a
->type
) && COMPLETE_TYPE_P (b
->type
)
6738 && (TYPE_ALIGN (a
->type
) != TYPE_ALIGN (b
->type
)
6739 || TYPE_MODE (a
->type
) != TYPE_MODE (b
->type
)))
6742 switch (TREE_CODE (a
->type
))
6747 case REFERENCE_TYPE
:
6752 return TYPE_VECTOR_SUBPARTS (a
->type
) == TYPE_VECTOR_SUBPARTS (b
->type
);
6755 if (TYPE_VALUES (a
->type
) != TYPE_VALUES (b
->type
)
6756 && !(TYPE_VALUES (a
->type
)
6757 && TREE_CODE (TYPE_VALUES (a
->type
)) == TREE_LIST
6758 && TYPE_VALUES (b
->type
)
6759 && TREE_CODE (TYPE_VALUES (b
->type
)) == TREE_LIST
6760 && type_list_equal (TYPE_VALUES (a
->type
),
6761 TYPE_VALUES (b
->type
))))
6764 /* ... fall through ... */
6769 if (TYPE_PRECISION (a
->type
) != TYPE_PRECISION (b
->type
))
6771 return ((TYPE_MAX_VALUE (a
->type
) == TYPE_MAX_VALUE (b
->type
)
6772 || tree_int_cst_equal (TYPE_MAX_VALUE (a
->type
),
6773 TYPE_MAX_VALUE (b
->type
)))
6774 && (TYPE_MIN_VALUE (a
->type
) == TYPE_MIN_VALUE (b
->type
)
6775 || tree_int_cst_equal (TYPE_MIN_VALUE (a
->type
),
6776 TYPE_MIN_VALUE (b
->type
))));
6778 case FIXED_POINT_TYPE
:
6779 return TYPE_SATURATING (a
->type
) == TYPE_SATURATING (b
->type
);
6782 return TYPE_OFFSET_BASETYPE (a
->type
) == TYPE_OFFSET_BASETYPE (b
->type
);
6785 if (TYPE_METHOD_BASETYPE (a
->type
) == TYPE_METHOD_BASETYPE (b
->type
)
6786 && (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
6787 || (TYPE_ARG_TYPES (a
->type
)
6788 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
6789 && TYPE_ARG_TYPES (b
->type
)
6790 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
6791 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
6792 TYPE_ARG_TYPES (b
->type
)))))
6796 return TYPE_DOMAIN (a
->type
) == TYPE_DOMAIN (b
->type
);
6800 case QUAL_UNION_TYPE
:
6801 return (TYPE_FIELDS (a
->type
) == TYPE_FIELDS (b
->type
)
6802 || (TYPE_FIELDS (a
->type
)
6803 && TREE_CODE (TYPE_FIELDS (a
->type
)) == TREE_LIST
6804 && TYPE_FIELDS (b
->type
)
6805 && TREE_CODE (TYPE_FIELDS (b
->type
)) == TREE_LIST
6806 && type_list_equal (TYPE_FIELDS (a
->type
),
6807 TYPE_FIELDS (b
->type
))));
6810 if (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
6811 || (TYPE_ARG_TYPES (a
->type
)
6812 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
6813 && TYPE_ARG_TYPES (b
->type
)
6814 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
6815 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
6816 TYPE_ARG_TYPES (b
->type
))))
6824 if (lang_hooks
.types
.type_hash_eq
!= NULL
)
6825 return lang_hooks
.types
.type_hash_eq (a
->type
, b
->type
);
6830 /* Return the cached hash value. */
6833 type_hash_hash (const void *item
)
6835 return ((const struct type_hash
*) item
)->hash
;
6838 /* Given TYPE, and HASHCODE its hash code, return the canonical
6839 object for an identical type if one already exists.
6840 Otherwise, return TYPE, and record it as the canonical object.
6842 To use this function, first create a type of the sort you want.
6843 Then compute its hash code from the fields of the type that
6844 make it different from other similar types.
6845 Then call this function and use the value. */
6848 type_hash_canon (unsigned int hashcode
, tree type
)
6853 /* The hash table only contains main variants, so ensure that's what we're
6855 gcc_assert (TYPE_MAIN_VARIANT (type
) == type
);
6857 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
6858 must call that routine before comparing TYPE_ALIGNs. */
6864 loc
= htab_find_slot_with_hash (type_hash_table
, &in
, hashcode
, INSERT
);
6867 tree t1
= ((type_hash
*) *loc
)->type
;
6868 gcc_assert (TYPE_MAIN_VARIANT (t1
) == t1
);
6869 if (GATHER_STATISTICS
)
6871 tree_code_counts
[(int) TREE_CODE (type
)]--;
6872 tree_node_counts
[(int) t_kind
]--;
6873 tree_node_sizes
[(int) t_kind
] -= sizeof (struct tree_type_non_common
);
6879 struct type_hash
*h
;
6881 h
= ggc_alloc
<type_hash
> ();
6890 /* See if the data pointed to by the type hash table is marked. We consider
6891 it marked if the type is marked or if a debug type number or symbol
6892 table entry has been made for the type. */
6895 type_hash_marked_p (const void *p
)
6897 const_tree
const type
= ((const struct type_hash
*) p
)->type
;
6899 return ggc_marked_p (type
);
6903 print_type_hash_statistics (void)
6905 fprintf (stderr
, "Type hash: size %ld, %ld elements, %f collisions\n",
6906 (long) htab_size (type_hash_table
),
6907 (long) htab_elements (type_hash_table
),
6908 htab_collisions (type_hash_table
));
6911 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
6912 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
6913 by adding the hash codes of the individual attributes. */
6916 attribute_hash_list (const_tree list
, inchash::hash
&hstate
)
6920 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
6921 /* ??? Do we want to add in TREE_VALUE too? */
6922 hstate
.add_object (IDENTIFIER_HASH_VALUE (get_attribute_name (tail
)));
6925 /* Given two lists of attributes, return true if list l2 is
6926 equivalent to l1. */
6929 attribute_list_equal (const_tree l1
, const_tree l2
)
6934 return attribute_list_contained (l1
, l2
)
6935 && attribute_list_contained (l2
, l1
);
6938 /* Given two lists of attributes, return true if list L2 is
6939 completely contained within L1. */
6940 /* ??? This would be faster if attribute names were stored in a canonicalized
6941 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
6942 must be used to show these elements are equivalent (which they are). */
6943 /* ??? It's not clear that attributes with arguments will always be handled
6947 attribute_list_contained (const_tree l1
, const_tree l2
)
6951 /* First check the obvious, maybe the lists are identical. */
6955 /* Maybe the lists are similar. */
6956 for (t1
= l1
, t2
= l2
;
6958 && get_attribute_name (t1
) == get_attribute_name (t2
)
6959 && TREE_VALUE (t1
) == TREE_VALUE (t2
);
6960 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
6963 /* Maybe the lists are equal. */
6964 if (t1
== 0 && t2
== 0)
6967 for (; t2
!= 0; t2
= TREE_CHAIN (t2
))
6970 /* This CONST_CAST is okay because lookup_attribute does not
6971 modify its argument and the return value is assigned to a
6973 for (attr
= lookup_ident_attribute (get_attribute_name (t2
),
6974 CONST_CAST_TREE (l1
));
6975 attr
!= NULL_TREE
&& !attribute_value_equal (t2
, attr
);
6976 attr
= lookup_ident_attribute (get_attribute_name (t2
),
6980 if (attr
== NULL_TREE
)
6987 /* Given two lists of types
6988 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
6989 return 1 if the lists contain the same types in the same order.
6990 Also, the TREE_PURPOSEs must match. */
6993 type_list_equal (const_tree l1
, const_tree l2
)
6997 for (t1
= l1
, t2
= l2
; t1
&& t2
; t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
6998 if (TREE_VALUE (t1
) != TREE_VALUE (t2
)
6999 || (TREE_PURPOSE (t1
) != TREE_PURPOSE (t2
)
7000 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
))
7001 && (TREE_TYPE (TREE_PURPOSE (t1
))
7002 == TREE_TYPE (TREE_PURPOSE (t2
))))))
7008 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
7009 given by TYPE. If the argument list accepts variable arguments,
7010 then this function counts only the ordinary arguments. */
7013 type_num_arguments (const_tree type
)
7018 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
7019 /* If the function does not take a variable number of arguments,
7020 the last element in the list will have type `void'. */
7021 if (VOID_TYPE_P (TREE_VALUE (t
)))
7029 /* Nonzero if integer constants T1 and T2
7030 represent the same constant value. */
7033 tree_int_cst_equal (const_tree t1
, const_tree t2
)
7038 if (t1
== 0 || t2
== 0)
7041 if (TREE_CODE (t1
) == INTEGER_CST
7042 && TREE_CODE (t2
) == INTEGER_CST
7043 && wi::to_widest (t1
) == wi::to_widest (t2
))
7049 /* Return true if T is an INTEGER_CST whose numerical value (extended
7050 according to TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. */
7053 tree_fits_shwi_p (const_tree t
)
7055 return (t
!= NULL_TREE
7056 && TREE_CODE (t
) == INTEGER_CST
7057 && wi::fits_shwi_p (wi::to_widest (t
)));
7060 /* Return true if T is an INTEGER_CST whose numerical value (extended
7061 according to TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. */
7064 tree_fits_uhwi_p (const_tree t
)
7066 return (t
!= NULL_TREE
7067 && TREE_CODE (t
) == INTEGER_CST
7068 && wi::fits_uhwi_p (wi::to_widest (t
)));
7071 /* T is an INTEGER_CST whose numerical value (extended according to
7072 TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. Return that
7076 tree_to_shwi (const_tree t
)
7078 gcc_assert (tree_fits_shwi_p (t
));
7079 return TREE_INT_CST_LOW (t
);
7082 /* T is an INTEGER_CST whose numerical value (extended according to
7083 TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. Return that
7086 unsigned HOST_WIDE_INT
7087 tree_to_uhwi (const_tree t
)
7089 gcc_assert (tree_fits_uhwi_p (t
));
7090 return TREE_INT_CST_LOW (t
);
7093 /* Return the most significant (sign) bit of T. */
7096 tree_int_cst_sign_bit (const_tree t
)
7098 unsigned bitno
= TYPE_PRECISION (TREE_TYPE (t
)) - 1;
7100 return wi::extract_uhwi (t
, bitno
, 1);
7103 /* Return an indication of the sign of the integer constant T.
7104 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
7105 Note that -1 will never be returned if T's type is unsigned. */
7108 tree_int_cst_sgn (const_tree t
)
7110 if (wi::eq_p (t
, 0))
7112 else if (TYPE_UNSIGNED (TREE_TYPE (t
)))
7114 else if (wi::neg_p (t
))
7120 /* Return the minimum number of bits needed to represent VALUE in a
7121 signed or unsigned type, UNSIGNEDP says which. */
7124 tree_int_cst_min_precision (tree value
, signop sgn
)
7126 /* If the value is negative, compute its negative minus 1. The latter
7127 adjustment is because the absolute value of the largest negative value
7128 is one larger than the largest positive value. This is equivalent to
7129 a bit-wise negation, so use that operation instead. */
7131 if (tree_int_cst_sgn (value
) < 0)
7132 value
= fold_build1 (BIT_NOT_EXPR
, TREE_TYPE (value
), value
);
7134 /* Return the number of bits needed, taking into account the fact
7135 that we need one more bit for a signed than unsigned type.
7136 If value is 0 or -1, the minimum precision is 1 no matter
7137 whether unsignedp is true or false. */
7139 if (integer_zerop (value
))
7142 return tree_floor_log2 (value
) + 1 + (sgn
== SIGNED
? 1 : 0) ;
7145 /* Return truthvalue of whether T1 is the same tree structure as T2.
7146 Return 1 if they are the same.
7147 Return 0 if they are understandably different.
7148 Return -1 if either contains tree structure not understood by
7152 simple_cst_equal (const_tree t1
, const_tree t2
)
7154 enum tree_code code1
, code2
;
7160 if (t1
== 0 || t2
== 0)
7163 code1
= TREE_CODE (t1
);
7164 code2
= TREE_CODE (t2
);
7166 if (CONVERT_EXPR_CODE_P (code1
) || code1
== NON_LVALUE_EXPR
)
7168 if (CONVERT_EXPR_CODE_P (code2
)
7169 || code2
== NON_LVALUE_EXPR
)
7170 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7172 return simple_cst_equal (TREE_OPERAND (t1
, 0), t2
);
7175 else if (CONVERT_EXPR_CODE_P (code2
)
7176 || code2
== NON_LVALUE_EXPR
)
7177 return simple_cst_equal (t1
, TREE_OPERAND (t2
, 0));
7185 return wi::to_widest (t1
) == wi::to_widest (t2
);
7188 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1
), TREE_REAL_CST (t2
));
7191 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1
), TREE_FIXED_CST (t2
));
7194 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
7195 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
7196 TREE_STRING_LENGTH (t1
)));
7200 unsigned HOST_WIDE_INT idx
;
7201 vec
<constructor_elt
, va_gc
> *v1
= CONSTRUCTOR_ELTS (t1
);
7202 vec
<constructor_elt
, va_gc
> *v2
= CONSTRUCTOR_ELTS (t2
);
7204 if (vec_safe_length (v1
) != vec_safe_length (v2
))
7207 for (idx
= 0; idx
< vec_safe_length (v1
); ++idx
)
7208 /* ??? Should we handle also fields here? */
7209 if (!simple_cst_equal ((*v1
)[idx
].value
, (*v2
)[idx
].value
))
7215 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7218 cmp
= simple_cst_equal (CALL_EXPR_FN (t1
), CALL_EXPR_FN (t2
));
7221 if (call_expr_nargs (t1
) != call_expr_nargs (t2
))
7224 const_tree arg1
, arg2
;
7225 const_call_expr_arg_iterator iter1
, iter2
;
7226 for (arg1
= first_const_call_expr_arg (t1
, &iter1
),
7227 arg2
= first_const_call_expr_arg (t2
, &iter2
);
7229 arg1
= next_const_call_expr_arg (&iter1
),
7230 arg2
= next_const_call_expr_arg (&iter2
))
7232 cmp
= simple_cst_equal (arg1
, arg2
);
7236 return arg1
== arg2
;
7240 /* Special case: if either target is an unallocated VAR_DECL,
7241 it means that it's going to be unified with whatever the
7242 TARGET_EXPR is really supposed to initialize, so treat it
7243 as being equivalent to anything. */
7244 if ((TREE_CODE (TREE_OPERAND (t1
, 0)) == VAR_DECL
7245 && DECL_NAME (TREE_OPERAND (t1
, 0)) == NULL_TREE
7246 && !DECL_RTL_SET_P (TREE_OPERAND (t1
, 0)))
7247 || (TREE_CODE (TREE_OPERAND (t2
, 0)) == VAR_DECL
7248 && DECL_NAME (TREE_OPERAND (t2
, 0)) == NULL_TREE
7249 && !DECL_RTL_SET_P (TREE_OPERAND (t2
, 0))))
7252 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7257 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
7259 case WITH_CLEANUP_EXPR
:
7260 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7264 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t1
, 1));
7267 if (TREE_OPERAND (t1
, 1) == TREE_OPERAND (t2
, 1))
7268 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7282 /* This general rule works for most tree codes. All exceptions should be
7283 handled above. If this is a language-specific tree code, we can't
7284 trust what might be in the operand, so say we don't know
7286 if ((int) code1
>= (int) LAST_AND_UNUSED_TREE_CODE
)
7289 switch (TREE_CODE_CLASS (code1
))
7293 case tcc_comparison
:
7294 case tcc_expression
:
7298 for (i
= 0; i
< TREE_CODE_LENGTH (code1
); i
++)
7300 cmp
= simple_cst_equal (TREE_OPERAND (t1
, i
), TREE_OPERAND (t2
, i
));
7312 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
7313 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
7314 than U, respectively. */
7317 compare_tree_int (const_tree t
, unsigned HOST_WIDE_INT u
)
7319 if (tree_int_cst_sgn (t
) < 0)
7321 else if (!tree_fits_uhwi_p (t
))
7323 else if (TREE_INT_CST_LOW (t
) == u
)
7325 else if (TREE_INT_CST_LOW (t
) < u
)
7331 /* Return true if SIZE represents a constant size that is in bounds of
7332 what the middle-end and the backend accepts (covering not more than
7333 half of the address-space). */
7336 valid_constant_size_p (const_tree size
)
7338 if (! tree_fits_uhwi_p (size
)
7339 || TREE_OVERFLOW (size
)
7340 || tree_int_cst_sign_bit (size
) != 0)
7345 /* Return the precision of the type, or for a complex or vector type the
7346 precision of the type of its elements. */
7349 element_precision (const_tree type
)
7351 enum tree_code code
= TREE_CODE (type
);
7352 if (code
== COMPLEX_TYPE
|| code
== VECTOR_TYPE
)
7353 type
= TREE_TYPE (type
);
7355 return TYPE_PRECISION (type
);
7358 /* Return true if CODE represents an associative tree code. Otherwise
7361 associative_tree_code (enum tree_code code
)
7380 /* Return true if CODE represents a commutative tree code. Otherwise
7383 commutative_tree_code (enum tree_code code
)
7389 case MULT_HIGHPART_EXPR
:
7397 case UNORDERED_EXPR
:
7401 case TRUTH_AND_EXPR
:
7402 case TRUTH_XOR_EXPR
:
7404 case WIDEN_MULT_EXPR
:
7405 case VEC_WIDEN_MULT_HI_EXPR
:
7406 case VEC_WIDEN_MULT_LO_EXPR
:
7407 case VEC_WIDEN_MULT_EVEN_EXPR
:
7408 case VEC_WIDEN_MULT_ODD_EXPR
:
7417 /* Return true if CODE represents a ternary tree code for which the
7418 first two operands are commutative. Otherwise return false. */
7420 commutative_ternary_tree_code (enum tree_code code
)
7424 case WIDEN_MULT_PLUS_EXPR
:
7425 case WIDEN_MULT_MINUS_EXPR
:
7439 /* Generate a hash value for an expression. This can be used iteratively
7440 by passing a previous result as the HSTATE argument.
7442 This function is intended to produce the same hash for expressions which
7443 would compare equal using operand_equal_p. */
7445 add_expr (const_tree t
, inchash::hash
&hstate
)
7448 enum tree_code code
;
7449 enum tree_code_class tclass
;
7453 hstate
.merge_hash (0);
7457 code
= TREE_CODE (t
);
7461 /* Alas, constants aren't shared, so we can't rely on pointer
7464 hstate
.merge_hash (0);
7467 for (i
= 0; i
< TREE_INT_CST_NUNITS (t
); i
++)
7468 hstate
.add_wide_int (TREE_INT_CST_ELT (t
, i
));
7472 unsigned int val2
= real_hash (TREE_REAL_CST_PTR (t
));
7473 hstate
.merge_hash (val2
);
7478 unsigned int val2
= fixed_hash (TREE_FIXED_CST_PTR (t
));
7479 hstate
.merge_hash (val2
);
7483 hstate
.add ((const void *) TREE_STRING_POINTER (t
), TREE_STRING_LENGTH (t
));
7486 inchash::add_expr (TREE_REALPART (t
), hstate
);
7487 inchash::add_expr (TREE_IMAGPART (t
), hstate
);
7492 for (i
= 0; i
< VECTOR_CST_NELTS (t
); ++i
)
7493 inchash::add_expr (VECTOR_CST_ELT (t
, i
), hstate
);
7497 /* We can just compare by pointer. */
7498 hstate
.add_wide_int (SSA_NAME_VERSION (t
));
7500 case PLACEHOLDER_EXPR
:
7501 /* The node itself doesn't matter. */
7504 /* A list of expressions, for a CALL_EXPR or as the elements of a
7506 for (; t
; t
= TREE_CHAIN (t
))
7507 inchash::add_expr (TREE_VALUE (t
), hstate
);
7511 unsigned HOST_WIDE_INT idx
;
7513 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t
), idx
, field
, value
)
7515 inchash::add_expr (field
, hstate
);
7516 inchash::add_expr (value
, hstate
);
7521 /* When referring to a built-in FUNCTION_DECL, use the __builtin__ form.
7522 Otherwise nodes that compare equal according to operand_equal_p might
7523 get different hash codes. However, don't do this for machine specific
7524 or front end builtins, since the function code is overloaded in those
7526 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
7527 && builtin_decl_explicit_p (DECL_FUNCTION_CODE (t
)))
7529 t
= builtin_decl_explicit (DECL_FUNCTION_CODE (t
));
7530 code
= TREE_CODE (t
);
7534 tclass
= TREE_CODE_CLASS (code
);
7536 if (tclass
== tcc_declaration
)
7538 /* DECL's have a unique ID */
7539 hstate
.add_wide_int (DECL_UID (t
));
7543 gcc_assert (IS_EXPR_CODE_CLASS (tclass
));
7545 hstate
.add_object (code
);
7547 /* Don't hash the type, that can lead to having nodes which
7548 compare equal according to operand_equal_p, but which
7549 have different hash codes. */
7550 if (CONVERT_EXPR_CODE_P (code
)
7551 || code
== NON_LVALUE_EXPR
)
7553 /* Make sure to include signness in the hash computation. */
7554 hstate
.add_int (TYPE_UNSIGNED (TREE_TYPE (t
)));
7555 inchash::add_expr (TREE_OPERAND (t
, 0), hstate
);
7558 else if (commutative_tree_code (code
))
7560 /* It's a commutative expression. We want to hash it the same
7561 however it appears. We do this by first hashing both operands
7562 and then rehashing based on the order of their independent
7564 inchash::hash one
, two
;
7565 inchash::add_expr (TREE_OPERAND (t
, 0), one
);
7566 inchash::add_expr (TREE_OPERAND (t
, 1), two
);
7567 hstate
.add_commutative (one
, two
);
7570 for (i
= TREE_OPERAND_LENGTH (t
) - 1; i
>= 0; --i
)
7571 inchash::add_expr (TREE_OPERAND (t
, i
), hstate
);
7579 /* Constructors for pointer, array and function types.
7580 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
7581 constructed by language-dependent code, not here.) */
7583 /* Construct, lay out and return the type of pointers to TO_TYPE with
7584 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
7585 reference all of memory. If such a type has already been
7586 constructed, reuse it. */
7589 build_pointer_type_for_mode (tree to_type
, machine_mode mode
,
7594 if (to_type
== error_mark_node
)
7595 return error_mark_node
;
7597 /* If the pointed-to type has the may_alias attribute set, force
7598 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7599 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
7600 can_alias_all
= true;
7602 /* In some cases, languages will have things that aren't a POINTER_TYPE
7603 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
7604 In that case, return that type without regard to the rest of our
7607 ??? This is a kludge, but consistent with the way this function has
7608 always operated and there doesn't seem to be a good way to avoid this
7610 if (TYPE_POINTER_TO (to_type
) != 0
7611 && TREE_CODE (TYPE_POINTER_TO (to_type
)) != POINTER_TYPE
)
7612 return TYPE_POINTER_TO (to_type
);
7614 /* First, if we already have a type for pointers to TO_TYPE and it's
7615 the proper mode, use it. */
7616 for (t
= TYPE_POINTER_TO (to_type
); t
; t
= TYPE_NEXT_PTR_TO (t
))
7617 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
7620 t
= make_node (POINTER_TYPE
);
7622 TREE_TYPE (t
) = to_type
;
7623 SET_TYPE_MODE (t
, mode
);
7624 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
7625 TYPE_NEXT_PTR_TO (t
) = TYPE_POINTER_TO (to_type
);
7626 TYPE_POINTER_TO (to_type
) = t
;
7628 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
))
7629 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7630 else if (TYPE_CANONICAL (to_type
) != to_type
)
7632 = build_pointer_type_for_mode (TYPE_CANONICAL (to_type
),
7633 mode
, can_alias_all
);
7635 /* Lay out the type. This function has many callers that are concerned
7636 with expression-construction, and this simplifies them all. */
7642 /* By default build pointers in ptr_mode. */
7645 build_pointer_type (tree to_type
)
7647 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
7648 : TYPE_ADDR_SPACE (to_type
);
7649 machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
7650 return build_pointer_type_for_mode (to_type
, pointer_mode
, false);
7653 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
7656 build_reference_type_for_mode (tree to_type
, machine_mode mode
,
7661 if (to_type
== error_mark_node
)
7662 return error_mark_node
;
7664 /* If the pointed-to type has the may_alias attribute set, force
7665 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7666 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
7667 can_alias_all
= true;
7669 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
7670 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
7671 In that case, return that type without regard to the rest of our
7674 ??? This is a kludge, but consistent with the way this function has
7675 always operated and there doesn't seem to be a good way to avoid this
7677 if (TYPE_REFERENCE_TO (to_type
) != 0
7678 && TREE_CODE (TYPE_REFERENCE_TO (to_type
)) != REFERENCE_TYPE
)
7679 return TYPE_REFERENCE_TO (to_type
);
7681 /* First, if we already have a type for pointers to TO_TYPE and it's
7682 the proper mode, use it. */
7683 for (t
= TYPE_REFERENCE_TO (to_type
); t
; t
= TYPE_NEXT_REF_TO (t
))
7684 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
7687 t
= make_node (REFERENCE_TYPE
);
7689 TREE_TYPE (t
) = to_type
;
7690 SET_TYPE_MODE (t
, mode
);
7691 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
7692 TYPE_NEXT_REF_TO (t
) = TYPE_REFERENCE_TO (to_type
);
7693 TYPE_REFERENCE_TO (to_type
) = t
;
7695 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
))
7696 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7697 else if (TYPE_CANONICAL (to_type
) != to_type
)
7699 = build_reference_type_for_mode (TYPE_CANONICAL (to_type
),
7700 mode
, can_alias_all
);
7708 /* Build the node for the type of references-to-TO_TYPE by default
7712 build_reference_type (tree to_type
)
7714 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
7715 : TYPE_ADDR_SPACE (to_type
);
7716 machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
7717 return build_reference_type_for_mode (to_type
, pointer_mode
, false);
7720 #define MAX_INT_CACHED_PREC \
7721 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
7722 static GTY(()) tree nonstandard_integer_type_cache
[2 * MAX_INT_CACHED_PREC
+ 2];
7724 /* Builds a signed or unsigned integer type of precision PRECISION.
7725 Used for C bitfields whose precision does not match that of
7726 built-in target types. */
7728 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision
,
7734 unsignedp
= MAX_INT_CACHED_PREC
+ 1;
7736 if (precision
<= MAX_INT_CACHED_PREC
)
7738 itype
= nonstandard_integer_type_cache
[precision
+ unsignedp
];
7743 itype
= make_node (INTEGER_TYPE
);
7744 TYPE_PRECISION (itype
) = precision
;
7747 fixup_unsigned_type (itype
);
7749 fixup_signed_type (itype
);
7752 if (tree_fits_uhwi_p (TYPE_MAX_VALUE (itype
)))
7753 ret
= type_hash_canon (tree_to_uhwi (TYPE_MAX_VALUE (itype
)), itype
);
7754 if (precision
<= MAX_INT_CACHED_PREC
)
7755 nonstandard_integer_type_cache
[precision
+ unsignedp
] = ret
;
7760 /* Create a range of some discrete type TYPE (an INTEGER_TYPE, ENUMERAL_TYPE
7761 or BOOLEAN_TYPE) with low bound LOWVAL and high bound HIGHVAL. If SHARED
7762 is true, reuse such a type that has already been constructed. */
7765 build_range_type_1 (tree type
, tree lowval
, tree highval
, bool shared
)
7767 tree itype
= make_node (INTEGER_TYPE
);
7768 inchash::hash hstate
;
7770 TREE_TYPE (itype
) = type
;
7772 TYPE_MIN_VALUE (itype
) = fold_convert (type
, lowval
);
7773 TYPE_MAX_VALUE (itype
) = highval
? fold_convert (type
, highval
) : NULL
;
7775 TYPE_PRECISION (itype
) = TYPE_PRECISION (type
);
7776 SET_TYPE_MODE (itype
, TYPE_MODE (type
));
7777 TYPE_SIZE (itype
) = TYPE_SIZE (type
);
7778 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (type
);
7779 TYPE_ALIGN (itype
) = TYPE_ALIGN (type
);
7780 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (type
);
7785 if ((TYPE_MIN_VALUE (itype
)
7786 && TREE_CODE (TYPE_MIN_VALUE (itype
)) != INTEGER_CST
)
7787 || (TYPE_MAX_VALUE (itype
)
7788 && TREE_CODE (TYPE_MAX_VALUE (itype
)) != INTEGER_CST
))
7790 /* Since we cannot reliably merge this type, we need to compare it using
7791 structural equality checks. */
7792 SET_TYPE_STRUCTURAL_EQUALITY (itype
);
7796 inchash::add_expr (TYPE_MIN_VALUE (itype
), hstate
);
7797 inchash::add_expr (TYPE_MAX_VALUE (itype
), hstate
);
7798 hstate
.merge_hash (TYPE_HASH (type
));
7799 itype
= type_hash_canon (hstate
.end (), itype
);
7804 /* Wrapper around build_range_type_1 with SHARED set to true. */
7807 build_range_type (tree type
, tree lowval
, tree highval
)
7809 return build_range_type_1 (type
, lowval
, highval
, true);
7812 /* Wrapper around build_range_type_1 with SHARED set to false. */
7815 build_nonshared_range_type (tree type
, tree lowval
, tree highval
)
7817 return build_range_type_1 (type
, lowval
, highval
, false);
7820 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
7821 MAXVAL should be the maximum value in the domain
7822 (one less than the length of the array).
7824 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
7825 We don't enforce this limit, that is up to caller (e.g. language front end).
7826 The limit exists because the result is a signed type and we don't handle
7827 sizes that use more than one HOST_WIDE_INT. */
7830 build_index_type (tree maxval
)
7832 return build_range_type (sizetype
, size_zero_node
, maxval
);
7835 /* Return true if the debug information for TYPE, a subtype, should be emitted
7836 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
7837 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
7838 debug info and doesn't reflect the source code. */
7841 subrange_type_for_debug_p (const_tree type
, tree
*lowval
, tree
*highval
)
7843 tree base_type
= TREE_TYPE (type
), low
, high
;
7845 /* Subrange types have a base type which is an integral type. */
7846 if (!INTEGRAL_TYPE_P (base_type
))
7849 /* Get the real bounds of the subtype. */
7850 if (lang_hooks
.types
.get_subrange_bounds
)
7851 lang_hooks
.types
.get_subrange_bounds (type
, &low
, &high
);
7854 low
= TYPE_MIN_VALUE (type
);
7855 high
= TYPE_MAX_VALUE (type
);
7858 /* If the type and its base type have the same representation and the same
7859 name, then the type is not a subrange but a copy of the base type. */
7860 if ((TREE_CODE (base_type
) == INTEGER_TYPE
7861 || TREE_CODE (base_type
) == BOOLEAN_TYPE
)
7862 && int_size_in_bytes (type
) == int_size_in_bytes (base_type
)
7863 && tree_int_cst_equal (low
, TYPE_MIN_VALUE (base_type
))
7864 && tree_int_cst_equal (high
, TYPE_MAX_VALUE (base_type
))
7865 && TYPE_IDENTIFIER (type
) == TYPE_IDENTIFIER (base_type
))
7875 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
7876 and number of elements specified by the range of values of INDEX_TYPE.
7877 If SHARED is true, reuse such a type that has already been constructed. */
7880 build_array_type_1 (tree elt_type
, tree index_type
, bool shared
)
7884 if (TREE_CODE (elt_type
) == FUNCTION_TYPE
)
7886 error ("arrays of functions are not meaningful");
7887 elt_type
= integer_type_node
;
7890 t
= make_node (ARRAY_TYPE
);
7891 TREE_TYPE (t
) = elt_type
;
7892 TYPE_DOMAIN (t
) = index_type
;
7893 TYPE_ADDR_SPACE (t
) = TYPE_ADDR_SPACE (elt_type
);
7896 /* If the element type is incomplete at this point we get marked for
7897 structural equality. Do not record these types in the canonical
7899 if (TYPE_STRUCTURAL_EQUALITY_P (t
))
7904 inchash::hash hstate
;
7905 hstate
.add_object (TYPE_HASH (elt_type
));
7907 hstate
.add_object (TYPE_HASH (index_type
));
7908 t
= type_hash_canon (hstate
.end (), t
);
7911 if (TYPE_CANONICAL (t
) == t
)
7913 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type
)
7914 || (index_type
&& TYPE_STRUCTURAL_EQUALITY_P (index_type
)))
7915 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7916 else if (TYPE_CANONICAL (elt_type
) != elt_type
7917 || (index_type
&& TYPE_CANONICAL (index_type
) != index_type
))
7919 = build_array_type_1 (TYPE_CANONICAL (elt_type
),
7921 ? TYPE_CANONICAL (index_type
) : NULL_TREE
,
7928 /* Wrapper around build_array_type_1 with SHARED set to true. */
7931 build_array_type (tree elt_type
, tree index_type
)
7933 return build_array_type_1 (elt_type
, index_type
, true);
7936 /* Wrapper around build_array_type_1 with SHARED set to false. */
7939 build_nonshared_array_type (tree elt_type
, tree index_type
)
7941 return build_array_type_1 (elt_type
, index_type
, false);
7944 /* Return a representation of ELT_TYPE[NELTS], using indices of type
7948 build_array_type_nelts (tree elt_type
, unsigned HOST_WIDE_INT nelts
)
7950 return build_array_type (elt_type
, build_index_type (size_int (nelts
- 1)));
7953 /* Recursively examines the array elements of TYPE, until a non-array
7954 element type is found. */
7957 strip_array_types (tree type
)
7959 while (TREE_CODE (type
) == ARRAY_TYPE
)
7960 type
= TREE_TYPE (type
);
7965 /* Computes the canonical argument types from the argument type list
7968 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
7969 on entry to this function, or if any of the ARGTYPES are
7972 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
7973 true on entry to this function, or if any of the ARGTYPES are
7976 Returns a canonical argument list, which may be ARGTYPES when the
7977 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
7978 true) or would not differ from ARGTYPES. */
7981 maybe_canonicalize_argtypes (tree argtypes
,
7982 bool *any_structural_p
,
7983 bool *any_noncanonical_p
)
7986 bool any_noncanonical_argtypes_p
= false;
7988 for (arg
= argtypes
; arg
&& !(*any_structural_p
); arg
= TREE_CHAIN (arg
))
7990 if (!TREE_VALUE (arg
) || TREE_VALUE (arg
) == error_mark_node
)
7991 /* Fail gracefully by stating that the type is structural. */
7992 *any_structural_p
= true;
7993 else if (TYPE_STRUCTURAL_EQUALITY_P (TREE_VALUE (arg
)))
7994 *any_structural_p
= true;
7995 else if (TYPE_CANONICAL (TREE_VALUE (arg
)) != TREE_VALUE (arg
)
7996 || TREE_PURPOSE (arg
))
7997 /* If the argument has a default argument, we consider it
7998 non-canonical even though the type itself is canonical.
7999 That way, different variants of function and method types
8000 with default arguments will all point to the variant with
8001 no defaults as their canonical type. */
8002 any_noncanonical_argtypes_p
= true;
8005 if (*any_structural_p
)
8008 if (any_noncanonical_argtypes_p
)
8010 /* Build the canonical list of argument types. */
8011 tree canon_argtypes
= NULL_TREE
;
8012 bool is_void
= false;
8014 for (arg
= argtypes
; arg
; arg
= TREE_CHAIN (arg
))
8016 if (arg
== void_list_node
)
8019 canon_argtypes
= tree_cons (NULL_TREE
,
8020 TYPE_CANONICAL (TREE_VALUE (arg
)),
8024 canon_argtypes
= nreverse (canon_argtypes
);
8026 canon_argtypes
= chainon (canon_argtypes
, void_list_node
);
8028 /* There is a non-canonical type. */
8029 *any_noncanonical_p
= true;
8030 return canon_argtypes
;
8033 /* The canonical argument types are the same as ARGTYPES. */
8037 /* Construct, lay out and return
8038 the type of functions returning type VALUE_TYPE
8039 given arguments of types ARG_TYPES.
8040 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
8041 are data type nodes for the arguments of the function.
8042 If such a type has already been constructed, reuse it. */
8045 build_function_type (tree value_type
, tree arg_types
)
8048 inchash::hash hstate
;
8049 bool any_structural_p
, any_noncanonical_p
;
8050 tree canon_argtypes
;
8052 if (TREE_CODE (value_type
) == FUNCTION_TYPE
)
8054 error ("function return type cannot be function");
8055 value_type
= integer_type_node
;
8058 /* Make a node of the sort we want. */
8059 t
= make_node (FUNCTION_TYPE
);
8060 TREE_TYPE (t
) = value_type
;
8061 TYPE_ARG_TYPES (t
) = arg_types
;
8063 /* If we already have such a type, use the old one. */
8064 hstate
.add_object (TYPE_HASH (value_type
));
8065 type_hash_list (arg_types
, hstate
);
8066 t
= type_hash_canon (hstate
.end (), t
);
8068 /* Set up the canonical type. */
8069 any_structural_p
= TYPE_STRUCTURAL_EQUALITY_P (value_type
);
8070 any_noncanonical_p
= TYPE_CANONICAL (value_type
) != value_type
;
8071 canon_argtypes
= maybe_canonicalize_argtypes (arg_types
,
8073 &any_noncanonical_p
);
8074 if (any_structural_p
)
8075 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8076 else if (any_noncanonical_p
)
8077 TYPE_CANONICAL (t
) = build_function_type (TYPE_CANONICAL (value_type
),
8080 if (!COMPLETE_TYPE_P (t
))
8085 /* Build a function type. The RETURN_TYPE is the type returned by the
8086 function. If VAARGS is set, no void_type_node is appended to the
8087 the list. ARGP must be always be terminated be a NULL_TREE. */
8090 build_function_type_list_1 (bool vaargs
, tree return_type
, va_list argp
)
8094 t
= va_arg (argp
, tree
);
8095 for (args
= NULL_TREE
; t
!= NULL_TREE
; t
= va_arg (argp
, tree
))
8096 args
= tree_cons (NULL_TREE
, t
, args
);
8101 if (args
!= NULL_TREE
)
8102 args
= nreverse (args
);
8103 gcc_assert (last
!= void_list_node
);
8105 else if (args
== NULL_TREE
)
8106 args
= void_list_node
;
8110 args
= nreverse (args
);
8111 TREE_CHAIN (last
) = void_list_node
;
8113 args
= build_function_type (return_type
, args
);
8118 /* Build a function type. The RETURN_TYPE is the type returned by the
8119 function. If additional arguments are provided, they are
8120 additional argument types. The list of argument types must always
8121 be terminated by NULL_TREE. */
8124 build_function_type_list (tree return_type
, ...)
8129 va_start (p
, return_type
);
8130 args
= build_function_type_list_1 (false, return_type
, p
);
8135 /* Build a variable argument function type. The RETURN_TYPE is the
8136 type returned by the function. If additional arguments are provided,
8137 they are additional argument types. The list of argument types must
8138 always be terminated by NULL_TREE. */
8141 build_varargs_function_type_list (tree return_type
, ...)
8146 va_start (p
, return_type
);
8147 args
= build_function_type_list_1 (true, return_type
, p
);
8153 /* Build a function type. RETURN_TYPE is the type returned by the
8154 function; VAARGS indicates whether the function takes varargs. The
8155 function takes N named arguments, the types of which are provided in
8159 build_function_type_array_1 (bool vaargs
, tree return_type
, int n
,
8163 tree t
= vaargs
? NULL_TREE
: void_list_node
;
8165 for (i
= n
- 1; i
>= 0; i
--)
8166 t
= tree_cons (NULL_TREE
, arg_types
[i
], t
);
8168 return build_function_type (return_type
, t
);
8171 /* Build a function type. RETURN_TYPE is the type returned by the
8172 function. The function takes N named arguments, the types of which
8173 are provided in ARG_TYPES. */
8176 build_function_type_array (tree return_type
, int n
, tree
*arg_types
)
8178 return build_function_type_array_1 (false, return_type
, n
, arg_types
);
8181 /* Build a variable argument function type. RETURN_TYPE is the type
8182 returned by the function. The function takes N named arguments, the
8183 types of which are provided in ARG_TYPES. */
8186 build_varargs_function_type_array (tree return_type
, int n
, tree
*arg_types
)
8188 return build_function_type_array_1 (true, return_type
, n
, arg_types
);
8191 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
8192 and ARGTYPES (a TREE_LIST) are the return type and arguments types
8193 for the method. An implicit additional parameter (of type
8194 pointer-to-BASETYPE) is added to the ARGTYPES. */
8197 build_method_type_directly (tree basetype
,
8203 inchash::hash hstate
;
8204 bool any_structural_p
, any_noncanonical_p
;
8205 tree canon_argtypes
;
8207 /* Make a node of the sort we want. */
8208 t
= make_node (METHOD_TYPE
);
8210 TYPE_METHOD_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
8211 TREE_TYPE (t
) = rettype
;
8212 ptype
= build_pointer_type (basetype
);
8214 /* The actual arglist for this function includes a "hidden" argument
8215 which is "this". Put it into the list of argument types. */
8216 argtypes
= tree_cons (NULL_TREE
, ptype
, argtypes
);
8217 TYPE_ARG_TYPES (t
) = argtypes
;
8219 /* If we already have such a type, use the old one. */
8220 hstate
.add_object (TYPE_HASH (basetype
));
8221 hstate
.add_object (TYPE_HASH (rettype
));
8222 type_hash_list (argtypes
, hstate
);
8223 t
= type_hash_canon (hstate
.end (), t
);
8225 /* Set up the canonical type. */
8227 = (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
8228 || TYPE_STRUCTURAL_EQUALITY_P (rettype
));
8230 = (TYPE_CANONICAL (basetype
) != basetype
8231 || TYPE_CANONICAL (rettype
) != rettype
);
8232 canon_argtypes
= maybe_canonicalize_argtypes (TREE_CHAIN (argtypes
),
8234 &any_noncanonical_p
);
8235 if (any_structural_p
)
8236 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8237 else if (any_noncanonical_p
)
8239 = build_method_type_directly (TYPE_CANONICAL (basetype
),
8240 TYPE_CANONICAL (rettype
),
8242 if (!COMPLETE_TYPE_P (t
))
8248 /* Construct, lay out and return the type of methods belonging to class
8249 BASETYPE and whose arguments and values are described by TYPE.
8250 If that type exists already, reuse it.
8251 TYPE must be a FUNCTION_TYPE node. */
8254 build_method_type (tree basetype
, tree type
)
8256 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
8258 return build_method_type_directly (basetype
,
8260 TYPE_ARG_TYPES (type
));
8263 /* Construct, lay out and return the type of offsets to a value
8264 of type TYPE, within an object of type BASETYPE.
8265 If a suitable offset type exists already, reuse it. */
8268 build_offset_type (tree basetype
, tree type
)
8271 inchash::hash hstate
;
8273 /* Make a node of the sort we want. */
8274 t
= make_node (OFFSET_TYPE
);
8276 TYPE_OFFSET_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
8277 TREE_TYPE (t
) = type
;
8279 /* If we already have such a type, use the old one. */
8280 hstate
.add_object (TYPE_HASH (basetype
));
8281 hstate
.add_object (TYPE_HASH (type
));
8282 t
= type_hash_canon (hstate
.end (), t
);
8284 if (!COMPLETE_TYPE_P (t
))
8287 if (TYPE_CANONICAL (t
) == t
)
8289 if (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
8290 || TYPE_STRUCTURAL_EQUALITY_P (type
))
8291 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8292 else if (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)) != basetype
8293 || TYPE_CANONICAL (type
) != type
)
8295 = build_offset_type (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)),
8296 TYPE_CANONICAL (type
));
8302 /* Create a complex type whose components are COMPONENT_TYPE. */
8305 build_complex_type (tree component_type
)
8308 inchash::hash hstate
;
8310 gcc_assert (INTEGRAL_TYPE_P (component_type
)
8311 || SCALAR_FLOAT_TYPE_P (component_type
)
8312 || FIXED_POINT_TYPE_P (component_type
));
8314 /* Make a node of the sort we want. */
8315 t
= make_node (COMPLEX_TYPE
);
8317 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (component_type
);
8319 /* If we already have such a type, use the old one. */
8320 hstate
.add_object (TYPE_HASH (component_type
));
8321 t
= type_hash_canon (hstate
.end (), t
);
8323 if (!COMPLETE_TYPE_P (t
))
8326 if (TYPE_CANONICAL (t
) == t
)
8328 if (TYPE_STRUCTURAL_EQUALITY_P (component_type
))
8329 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8330 else if (TYPE_CANONICAL (component_type
) != component_type
)
8332 = build_complex_type (TYPE_CANONICAL (component_type
));
8335 /* We need to create a name, since complex is a fundamental type. */
8336 if (! TYPE_NAME (t
))
8339 if (component_type
== char_type_node
)
8340 name
= "complex char";
8341 else if (component_type
== signed_char_type_node
)
8342 name
= "complex signed char";
8343 else if (component_type
== unsigned_char_type_node
)
8344 name
= "complex unsigned char";
8345 else if (component_type
== short_integer_type_node
)
8346 name
= "complex short int";
8347 else if (component_type
== short_unsigned_type_node
)
8348 name
= "complex short unsigned int";
8349 else if (component_type
== integer_type_node
)
8350 name
= "complex int";
8351 else if (component_type
== unsigned_type_node
)
8352 name
= "complex unsigned int";
8353 else if (component_type
== long_integer_type_node
)
8354 name
= "complex long int";
8355 else if (component_type
== long_unsigned_type_node
)
8356 name
= "complex long unsigned int";
8357 else if (component_type
== long_long_integer_type_node
)
8358 name
= "complex long long int";
8359 else if (component_type
== long_long_unsigned_type_node
)
8360 name
= "complex long long unsigned int";
8365 TYPE_NAME (t
) = build_decl (UNKNOWN_LOCATION
, TYPE_DECL
,
8366 get_identifier (name
), t
);
8369 return build_qualified_type (t
, TYPE_QUALS (component_type
));
8372 /* If TYPE is a real or complex floating-point type and the target
8373 does not directly support arithmetic on TYPE then return the wider
8374 type to be used for arithmetic on TYPE. Otherwise, return
8378 excess_precision_type (tree type
)
8380 if (flag_excess_precision
!= EXCESS_PRECISION_FAST
)
8382 int flt_eval_method
= TARGET_FLT_EVAL_METHOD
;
8383 switch (TREE_CODE (type
))
8386 switch (flt_eval_method
)
8389 if (TYPE_MODE (type
) == TYPE_MODE (float_type_node
))
8390 return double_type_node
;
8393 if (TYPE_MODE (type
) == TYPE_MODE (float_type_node
)
8394 || TYPE_MODE (type
) == TYPE_MODE (double_type_node
))
8395 return long_double_type_node
;
8402 if (TREE_CODE (TREE_TYPE (type
)) != REAL_TYPE
)
8404 switch (flt_eval_method
)
8407 if (TYPE_MODE (TREE_TYPE (type
)) == TYPE_MODE (float_type_node
))
8408 return complex_double_type_node
;
8411 if (TYPE_MODE (TREE_TYPE (type
)) == TYPE_MODE (float_type_node
)
8412 || (TYPE_MODE (TREE_TYPE (type
))
8413 == TYPE_MODE (double_type_node
)))
8414 return complex_long_double_type_node
;
8427 /* Return OP, stripped of any conversions to wider types as much as is safe.
8428 Converting the value back to OP's type makes a value equivalent to OP.
8430 If FOR_TYPE is nonzero, we return a value which, if converted to
8431 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
8433 OP must have integer, real or enumeral type. Pointers are not allowed!
8435 There are some cases where the obvious value we could return
8436 would regenerate to OP if converted to OP's type,
8437 but would not extend like OP to wider types.
8438 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
8439 For example, if OP is (unsigned short)(signed char)-1,
8440 we avoid returning (signed char)-1 if FOR_TYPE is int,
8441 even though extending that to an unsigned short would regenerate OP,
8442 since the result of extending (signed char)-1 to (int)
8443 is different from (int) OP. */
8446 get_unwidened (tree op
, tree for_type
)
8448 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
8449 tree type
= TREE_TYPE (op
);
8451 = TYPE_PRECISION (for_type
!= 0 ? for_type
: type
);
8453 = (for_type
!= 0 && for_type
!= type
8454 && final_prec
> TYPE_PRECISION (type
)
8455 && TYPE_UNSIGNED (type
));
8458 while (CONVERT_EXPR_P (op
))
8462 /* TYPE_PRECISION on vector types has different meaning
8463 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
8464 so avoid them here. */
8465 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op
, 0))) == VECTOR_TYPE
)
8468 bitschange
= TYPE_PRECISION (TREE_TYPE (op
))
8469 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0)));
8471 /* Truncations are many-one so cannot be removed.
8472 Unless we are later going to truncate down even farther. */
8474 && final_prec
> TYPE_PRECISION (TREE_TYPE (op
)))
8477 /* See what's inside this conversion. If we decide to strip it,
8479 op
= TREE_OPERAND (op
, 0);
8481 /* If we have not stripped any zero-extensions (uns is 0),
8482 we can strip any kind of extension.
8483 If we have previously stripped a zero-extension,
8484 only zero-extensions can safely be stripped.
8485 Any extension can be stripped if the bits it would produce
8486 are all going to be discarded later by truncating to FOR_TYPE. */
8490 if (! uns
|| final_prec
<= TYPE_PRECISION (TREE_TYPE (op
)))
8492 /* TYPE_UNSIGNED says whether this is a zero-extension.
8493 Let's avoid computing it if it does not affect WIN
8494 and if UNS will not be needed again. */
8496 || CONVERT_EXPR_P (op
))
8497 && TYPE_UNSIGNED (TREE_TYPE (op
)))
8505 /* If we finally reach a constant see if it fits in for_type and
8506 in that case convert it. */
8508 && TREE_CODE (win
) == INTEGER_CST
8509 && TREE_TYPE (win
) != for_type
8510 && int_fits_type_p (win
, for_type
))
8511 win
= fold_convert (for_type
, win
);
8516 /* Return OP or a simpler expression for a narrower value
8517 which can be sign-extended or zero-extended to give back OP.
8518 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
8519 or 0 if the value should be sign-extended. */
8522 get_narrower (tree op
, int *unsignedp_ptr
)
8527 bool integral_p
= INTEGRAL_TYPE_P (TREE_TYPE (op
));
8529 while (TREE_CODE (op
) == NOP_EXPR
)
8532 = (TYPE_PRECISION (TREE_TYPE (op
))
8533 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0))));
8535 /* Truncations are many-one so cannot be removed. */
8539 /* See what's inside this conversion. If we decide to strip it,
8544 op
= TREE_OPERAND (op
, 0);
8545 /* An extension: the outermost one can be stripped,
8546 but remember whether it is zero or sign extension. */
8548 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
8549 /* Otherwise, if a sign extension has been stripped,
8550 only sign extensions can now be stripped;
8551 if a zero extension has been stripped, only zero-extensions. */
8552 else if (uns
!= TYPE_UNSIGNED (TREE_TYPE (op
)))
8556 else /* bitschange == 0 */
8558 /* A change in nominal type can always be stripped, but we must
8559 preserve the unsignedness. */
8561 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
8563 op
= TREE_OPERAND (op
, 0);
8564 /* Keep trying to narrow, but don't assign op to win if it
8565 would turn an integral type into something else. */
8566 if (INTEGRAL_TYPE_P (TREE_TYPE (op
)) != integral_p
)
8573 if (TREE_CODE (op
) == COMPONENT_REF
8574 /* Since type_for_size always gives an integer type. */
8575 && TREE_CODE (TREE_TYPE (op
)) != REAL_TYPE
8576 && TREE_CODE (TREE_TYPE (op
)) != FIXED_POINT_TYPE
8577 /* Ensure field is laid out already. */
8578 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0
8579 && tree_fits_uhwi_p (DECL_SIZE (TREE_OPERAND (op
, 1))))
8581 unsigned HOST_WIDE_INT innerprec
8582 = tree_to_uhwi (DECL_SIZE (TREE_OPERAND (op
, 1)));
8583 int unsignedp
= (DECL_UNSIGNED (TREE_OPERAND (op
, 1))
8584 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op
, 1))));
8585 tree type
= lang_hooks
.types
.type_for_size (innerprec
, unsignedp
);
8587 /* We can get this structure field in a narrower type that fits it,
8588 but the resulting extension to its nominal type (a fullword type)
8589 must satisfy the same conditions as for other extensions.
8591 Do this only for fields that are aligned (not bit-fields),
8592 because when bit-field insns will be used there is no
8593 advantage in doing this. */
8595 if (innerprec
< TYPE_PRECISION (TREE_TYPE (op
))
8596 && ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1))
8597 && (first
|| uns
== DECL_UNSIGNED (TREE_OPERAND (op
, 1)))
8601 uns
= DECL_UNSIGNED (TREE_OPERAND (op
, 1));
8602 win
= fold_convert (type
, op
);
8606 *unsignedp_ptr
= uns
;
8610 /* Returns true if integer constant C has a value that is permissible
8611 for type TYPE (an INTEGER_TYPE). */
8614 int_fits_type_p (const_tree c
, const_tree type
)
8616 tree type_low_bound
, type_high_bound
;
8617 bool ok_for_low_bound
, ok_for_high_bound
;
8618 signop sgn_c
= TYPE_SIGN (TREE_TYPE (c
));
8621 type_low_bound
= TYPE_MIN_VALUE (type
);
8622 type_high_bound
= TYPE_MAX_VALUE (type
);
8624 /* If at least one bound of the type is a constant integer, we can check
8625 ourselves and maybe make a decision. If no such decision is possible, but
8626 this type is a subtype, try checking against that. Otherwise, use
8627 fits_to_tree_p, which checks against the precision.
8629 Compute the status for each possibly constant bound, and return if we see
8630 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
8631 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
8632 for "constant known to fit". */
8634 /* Check if c >= type_low_bound. */
8635 if (type_low_bound
&& TREE_CODE (type_low_bound
) == INTEGER_CST
)
8637 if (tree_int_cst_lt (c
, type_low_bound
))
8639 ok_for_low_bound
= true;
8642 ok_for_low_bound
= false;
8644 /* Check if c <= type_high_bound. */
8645 if (type_high_bound
&& TREE_CODE (type_high_bound
) == INTEGER_CST
)
8647 if (tree_int_cst_lt (type_high_bound
, c
))
8649 ok_for_high_bound
= true;
8652 ok_for_high_bound
= false;
8654 /* If the constant fits both bounds, the result is known. */
8655 if (ok_for_low_bound
&& ok_for_high_bound
)
8658 /* Perform some generic filtering which may allow making a decision
8659 even if the bounds are not constant. First, negative integers
8660 never fit in unsigned types, */
8661 if (TYPE_UNSIGNED (type
) && sgn_c
== SIGNED
&& wi::neg_p (c
))
8664 /* Second, narrower types always fit in wider ones. */
8665 if (TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (c
)))
8668 /* Third, unsigned integers with top bit set never fit signed types. */
8669 if (!TYPE_UNSIGNED (type
) && sgn_c
== UNSIGNED
)
8671 int prec
= GET_MODE_PRECISION (TYPE_MODE (TREE_TYPE (c
))) - 1;
8672 if (prec
< TYPE_PRECISION (TREE_TYPE (c
)))
8674 /* When a tree_cst is converted to a wide-int, the precision
8675 is taken from the type. However, if the precision of the
8676 mode underneath the type is smaller than that, it is
8677 possible that the value will not fit. The test below
8678 fails if any bit is set between the sign bit of the
8679 underlying mode and the top bit of the type. */
8680 if (wi::ne_p (wi::zext (c
, prec
- 1), c
))
8683 else if (wi::neg_p (c
))
8687 /* If we haven't been able to decide at this point, there nothing more we
8688 can check ourselves here. Look at the base type if we have one and it
8689 has the same precision. */
8690 if (TREE_CODE (type
) == INTEGER_TYPE
8691 && TREE_TYPE (type
) != 0
8692 && TYPE_PRECISION (type
) == TYPE_PRECISION (TREE_TYPE (type
)))
8694 type
= TREE_TYPE (type
);
8698 /* Or to fits_to_tree_p, if nothing else. */
8699 return wi::fits_to_tree_p (c
, type
);
8702 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
8703 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
8704 represented (assuming two's-complement arithmetic) within the bit
8705 precision of the type are returned instead. */
8708 get_type_static_bounds (const_tree type
, mpz_t min
, mpz_t max
)
8710 if (!POINTER_TYPE_P (type
) && TYPE_MIN_VALUE (type
)
8711 && TREE_CODE (TYPE_MIN_VALUE (type
)) == INTEGER_CST
)
8712 wi::to_mpz (TYPE_MIN_VALUE (type
), min
, TYPE_SIGN (type
));
8715 if (TYPE_UNSIGNED (type
))
8716 mpz_set_ui (min
, 0);
8719 wide_int mn
= wi::min_value (TYPE_PRECISION (type
), SIGNED
);
8720 wi::to_mpz (mn
, min
, SIGNED
);
8724 if (!POINTER_TYPE_P (type
) && TYPE_MAX_VALUE (type
)
8725 && TREE_CODE (TYPE_MAX_VALUE (type
)) == INTEGER_CST
)
8726 wi::to_mpz (TYPE_MAX_VALUE (type
), max
, TYPE_SIGN (type
));
8729 wide_int mn
= wi::max_value (TYPE_PRECISION (type
), TYPE_SIGN (type
));
8730 wi::to_mpz (mn
, max
, TYPE_SIGN (type
));
8734 /* Return true if VAR is an automatic variable defined in function FN. */
8737 auto_var_in_fn_p (const_tree var
, const_tree fn
)
8739 return (DECL_P (var
) && DECL_CONTEXT (var
) == fn
8740 && ((((TREE_CODE (var
) == VAR_DECL
&& ! DECL_EXTERNAL (var
))
8741 || TREE_CODE (var
) == PARM_DECL
)
8742 && ! TREE_STATIC (var
))
8743 || TREE_CODE (var
) == LABEL_DECL
8744 || TREE_CODE (var
) == RESULT_DECL
));
8747 /* Subprogram of following function. Called by walk_tree.
8749 Return *TP if it is an automatic variable or parameter of the
8750 function passed in as DATA. */
8753 find_var_from_fn (tree
*tp
, int *walk_subtrees
, void *data
)
8755 tree fn
= (tree
) data
;
8760 else if (DECL_P (*tp
)
8761 && auto_var_in_fn_p (*tp
, fn
))
8767 /* Returns true if T is, contains, or refers to a type with variable
8768 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
8769 arguments, but not the return type. If FN is nonzero, only return
8770 true if a modifier of the type or position of FN is a variable or
8771 parameter inside FN.
8773 This concept is more general than that of C99 'variably modified types':
8774 in C99, a struct type is never variably modified because a VLA may not
8775 appear as a structure member. However, in GNU C code like:
8777 struct S { int i[f()]; };
8779 is valid, and other languages may define similar constructs. */
8782 variably_modified_type_p (tree type
, tree fn
)
8786 /* Test if T is either variable (if FN is zero) or an expression containing
8787 a variable in FN. If TYPE isn't gimplified, return true also if
8788 gimplify_one_sizepos would gimplify the expression into a local
8790 #define RETURN_TRUE_IF_VAR(T) \
8791 do { tree _t = (T); \
8792 if (_t != NULL_TREE \
8793 && _t != error_mark_node \
8794 && TREE_CODE (_t) != INTEGER_CST \
8795 && TREE_CODE (_t) != PLACEHOLDER_EXPR \
8797 || (!TYPE_SIZES_GIMPLIFIED (type) \
8798 && !is_gimple_sizepos (_t)) \
8799 || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
8800 return true; } while (0)
8802 if (type
== error_mark_node
)
8805 /* If TYPE itself has variable size, it is variably modified. */
8806 RETURN_TRUE_IF_VAR (TYPE_SIZE (type
));
8807 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type
));
8809 switch (TREE_CODE (type
))
8812 case REFERENCE_TYPE
:
8814 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
8820 /* If TYPE is a function type, it is variably modified if the
8821 return type is variably modified. */
8822 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
8828 case FIXED_POINT_TYPE
:
8831 /* Scalar types are variably modified if their end points
8833 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type
));
8834 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type
));
8839 case QUAL_UNION_TYPE
:
8840 /* We can't see if any of the fields are variably-modified by the
8841 definition we normally use, since that would produce infinite
8842 recursion via pointers. */
8843 /* This is variably modified if some field's type is. */
8844 for (t
= TYPE_FIELDS (type
); t
; t
= DECL_CHAIN (t
))
8845 if (TREE_CODE (t
) == FIELD_DECL
)
8847 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t
));
8848 RETURN_TRUE_IF_VAR (DECL_SIZE (t
));
8849 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t
));
8851 if (TREE_CODE (type
) == QUAL_UNION_TYPE
)
8852 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t
));
8857 /* Do not call ourselves to avoid infinite recursion. This is
8858 variably modified if the element type is. */
8859 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type
)));
8860 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type
)));
8867 /* The current language may have other cases to check, but in general,
8868 all other types are not variably modified. */
8869 return lang_hooks
.tree_inlining
.var_mod_type_p (type
, fn
);
8871 #undef RETURN_TRUE_IF_VAR
8874 /* Given a DECL or TYPE, return the scope in which it was declared, or
8875 NULL_TREE if there is no containing scope. */
8878 get_containing_scope (const_tree t
)
8880 return (TYPE_P (t
) ? TYPE_CONTEXT (t
) : DECL_CONTEXT (t
));
8883 /* Return the innermost context enclosing DECL that is
8884 a FUNCTION_DECL, or zero if none. */
8887 decl_function_context (const_tree decl
)
8891 if (TREE_CODE (decl
) == ERROR_MARK
)
8894 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
8895 where we look up the function at runtime. Such functions always take
8896 a first argument of type 'pointer to real context'.
8898 C++ should really be fixed to use DECL_CONTEXT for the real context,
8899 and use something else for the "virtual context". */
8900 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VINDEX (decl
))
8903 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl
)))));
8905 context
= DECL_CONTEXT (decl
);
8907 while (context
&& TREE_CODE (context
) != FUNCTION_DECL
)
8909 if (TREE_CODE (context
) == BLOCK
)
8910 context
= BLOCK_SUPERCONTEXT (context
);
8912 context
= get_containing_scope (context
);
8918 /* Return the innermost context enclosing DECL that is
8919 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
8920 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
8923 decl_type_context (const_tree decl
)
8925 tree context
= DECL_CONTEXT (decl
);
8928 switch (TREE_CODE (context
))
8930 case NAMESPACE_DECL
:
8931 case TRANSLATION_UNIT_DECL
:
8936 case QUAL_UNION_TYPE
:
8941 context
= DECL_CONTEXT (context
);
8945 context
= BLOCK_SUPERCONTEXT (context
);
8955 /* CALL is a CALL_EXPR. Return the declaration for the function
8956 called, or NULL_TREE if the called function cannot be
8960 get_callee_fndecl (const_tree call
)
8964 if (call
== error_mark_node
)
8965 return error_mark_node
;
8967 /* It's invalid to call this function with anything but a
8969 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
8971 /* The first operand to the CALL is the address of the function
8973 addr
= CALL_EXPR_FN (call
);
8975 /* If there is no function, return early. */
8976 if (addr
== NULL_TREE
)
8981 /* If this is a readonly function pointer, extract its initial value. */
8982 if (DECL_P (addr
) && TREE_CODE (addr
) != FUNCTION_DECL
8983 && TREE_READONLY (addr
) && ! TREE_THIS_VOLATILE (addr
)
8984 && DECL_INITIAL (addr
))
8985 addr
= DECL_INITIAL (addr
);
8987 /* If the address is just `&f' for some function `f', then we know
8988 that `f' is being called. */
8989 if (TREE_CODE (addr
) == ADDR_EXPR
8990 && TREE_CODE (TREE_OPERAND (addr
, 0)) == FUNCTION_DECL
)
8991 return TREE_OPERAND (addr
, 0);
8993 /* We couldn't figure out what was being called. */
8997 /* Print debugging information about tree nodes generated during the compile,
8998 and any language-specific information. */
9001 dump_tree_statistics (void)
9003 if (GATHER_STATISTICS
)
9006 int total_nodes
, total_bytes
;
9007 fprintf (stderr
, "Kind Nodes Bytes\n");
9008 fprintf (stderr
, "---------------------------------------\n");
9009 total_nodes
= total_bytes
= 0;
9010 for (i
= 0; i
< (int) all_kinds
; i
++)
9012 fprintf (stderr
, "%-20s %7d %10d\n", tree_node_kind_names
[i
],
9013 tree_node_counts
[i
], tree_node_sizes
[i
]);
9014 total_nodes
+= tree_node_counts
[i
];
9015 total_bytes
+= tree_node_sizes
[i
];
9017 fprintf (stderr
, "---------------------------------------\n");
9018 fprintf (stderr
, "%-20s %7d %10d\n", "Total", total_nodes
, total_bytes
);
9019 fprintf (stderr
, "---------------------------------------\n");
9020 fprintf (stderr
, "Code Nodes\n");
9021 fprintf (stderr
, "----------------------------\n");
9022 for (i
= 0; i
< (int) MAX_TREE_CODES
; i
++)
9023 fprintf (stderr
, "%-20s %7d\n", get_tree_code_name ((enum tree_code
) i
),
9024 tree_code_counts
[i
]);
9025 fprintf (stderr
, "----------------------------\n");
9026 ssanames_print_statistics ();
9027 phinodes_print_statistics ();
9030 fprintf (stderr
, "(No per-node statistics)\n");
9032 print_type_hash_statistics ();
9033 print_debug_expr_statistics ();
9034 print_value_expr_statistics ();
9035 lang_hooks
.print_statistics ();
9038 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
9040 /* Generate a crc32 of a byte. */
9043 crc32_unsigned_bits (unsigned chksum
, unsigned value
, unsigned bits
)
9047 for (ix
= bits
; ix
--; value
<<= 1)
9051 feedback
= (value
^ chksum
) & 0x80000000 ? 0x04c11db7 : 0;
9058 /* Generate a crc32 of a 32-bit unsigned. */
9061 crc32_unsigned (unsigned chksum
, unsigned value
)
9063 return crc32_unsigned_bits (chksum
, value
, 32);
9066 /* Generate a crc32 of a byte. */
9069 crc32_byte (unsigned chksum
, char byte
)
9071 return crc32_unsigned_bits (chksum
, (unsigned) byte
<< 24, 8);
9074 /* Generate a crc32 of a string. */
9077 crc32_string (unsigned chksum
, const char *string
)
9081 chksum
= crc32_byte (chksum
, *string
);
9087 /* P is a string that will be used in a symbol. Mask out any characters
9088 that are not valid in that context. */
9091 clean_symbol_name (char *p
)
9095 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
9098 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
9105 /* Generate a name for a special-purpose function.
9106 The generated name may need to be unique across the whole link.
9107 Changes to this function may also require corresponding changes to
9108 xstrdup_mask_random.
9109 TYPE is some string to identify the purpose of this function to the
9110 linker or collect2; it must start with an uppercase letter,
9112 I - for constructors
9114 N - for C++ anonymous namespaces
9115 F - for DWARF unwind frame information. */
9118 get_file_function_name (const char *type
)
9124 /* If we already have a name we know to be unique, just use that. */
9125 if (first_global_object_name
)
9126 p
= q
= ASTRDUP (first_global_object_name
);
9127 /* If the target is handling the constructors/destructors, they
9128 will be local to this file and the name is only necessary for
9130 We also assign sub_I and sub_D sufixes to constructors called from
9131 the global static constructors. These are always local. */
9132 else if (((type
[0] == 'I' || type
[0] == 'D') && targetm
.have_ctors_dtors
)
9133 || (strncmp (type
, "sub_", 4) == 0
9134 && (type
[4] == 'I' || type
[4] == 'D')))
9136 const char *file
= main_input_filename
;
9138 file
= LOCATION_FILE (input_location
);
9139 /* Just use the file's basename, because the full pathname
9140 might be quite long. */
9141 p
= q
= ASTRDUP (lbasename (file
));
9145 /* Otherwise, the name must be unique across the entire link.
9146 We don't have anything that we know to be unique to this translation
9147 unit, so use what we do have and throw in some randomness. */
9149 const char *name
= weak_global_object_name
;
9150 const char *file
= main_input_filename
;
9155 file
= LOCATION_FILE (input_location
);
9157 len
= strlen (file
);
9158 q
= (char *) alloca (9 + 17 + len
+ 1);
9159 memcpy (q
, file
, len
+ 1);
9161 snprintf (q
+ len
, 9 + 17 + 1, "_%08X_" HOST_WIDE_INT_PRINT_HEX
,
9162 crc32_string (0, name
), get_random_seed (false));
9167 clean_symbol_name (q
);
9168 buf
= (char *) alloca (sizeof (FILE_FUNCTION_FORMAT
) + strlen (p
)
9171 /* Set up the name of the file-level functions we may need.
9172 Use a global object (which is already required to be unique over
9173 the program) rather than the file name (which imposes extra
9175 sprintf (buf
, FILE_FUNCTION_FORMAT
, type
, p
);
9177 return get_identifier (buf
);
9180 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
9182 /* Complain that the tree code of NODE does not match the expected 0
9183 terminated list of trailing codes. The trailing code list can be
9184 empty, for a more vague error message. FILE, LINE, and FUNCTION
9185 are of the caller. */
9188 tree_check_failed (const_tree node
, const char *file
,
9189 int line
, const char *function
, ...)
9193 unsigned length
= 0;
9194 enum tree_code code
;
9196 va_start (args
, function
);
9197 while ((code
= (enum tree_code
) va_arg (args
, int)))
9198 length
+= 4 + strlen (get_tree_code_name (code
));
9203 va_start (args
, function
);
9204 length
+= strlen ("expected ");
9205 buffer
= tmp
= (char *) alloca (length
);
9207 while ((code
= (enum tree_code
) va_arg (args
, int)))
9209 const char *prefix
= length
? " or " : "expected ";
9211 strcpy (tmp
+ length
, prefix
);
9212 length
+= strlen (prefix
);
9213 strcpy (tmp
+ length
, get_tree_code_name (code
));
9214 length
+= strlen (get_tree_code_name (code
));
9219 buffer
= "unexpected node";
9221 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9222 buffer
, get_tree_code_name (TREE_CODE (node
)),
9223 function
, trim_filename (file
), line
);
9226 /* Complain that the tree code of NODE does match the expected 0
9227 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
9231 tree_not_check_failed (const_tree node
, const char *file
,
9232 int line
, const char *function
, ...)
9236 unsigned length
= 0;
9237 enum tree_code code
;
9239 va_start (args
, function
);
9240 while ((code
= (enum tree_code
) va_arg (args
, int)))
9241 length
+= 4 + strlen (get_tree_code_name (code
));
9243 va_start (args
, function
);
9244 buffer
= (char *) alloca (length
);
9246 while ((code
= (enum tree_code
) va_arg (args
, int)))
9250 strcpy (buffer
+ length
, " or ");
9253 strcpy (buffer
+ length
, get_tree_code_name (code
));
9254 length
+= strlen (get_tree_code_name (code
));
9258 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
9259 buffer
, get_tree_code_name (TREE_CODE (node
)),
9260 function
, trim_filename (file
), line
);
9263 /* Similar to tree_check_failed, except that we check for a class of tree
9264 code, given in CL. */
9267 tree_class_check_failed (const_tree node
, const enum tree_code_class cl
,
9268 const char *file
, int line
, const char *function
)
9271 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
9272 TREE_CODE_CLASS_STRING (cl
),
9273 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
9274 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9277 /* Similar to tree_check_failed, except that instead of specifying a
9278 dozen codes, use the knowledge that they're all sequential. */
9281 tree_range_check_failed (const_tree node
, const char *file
, int line
,
9282 const char *function
, enum tree_code c1
,
9286 unsigned length
= 0;
9289 for (c
= c1
; c
<= c2
; ++c
)
9290 length
+= 4 + strlen (get_tree_code_name ((enum tree_code
) c
));
9292 length
+= strlen ("expected ");
9293 buffer
= (char *) alloca (length
);
9296 for (c
= c1
; c
<= c2
; ++c
)
9298 const char *prefix
= length
? " or " : "expected ";
9300 strcpy (buffer
+ length
, prefix
);
9301 length
+= strlen (prefix
);
9302 strcpy (buffer
+ length
, get_tree_code_name ((enum tree_code
) c
));
9303 length
+= strlen (get_tree_code_name ((enum tree_code
) c
));
9306 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9307 buffer
, get_tree_code_name (TREE_CODE (node
)),
9308 function
, trim_filename (file
), line
);
9312 /* Similar to tree_check_failed, except that we check that a tree does
9313 not have the specified code, given in CL. */
9316 tree_not_class_check_failed (const_tree node
, const enum tree_code_class cl
,
9317 const char *file
, int line
, const char *function
)
9320 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
9321 TREE_CODE_CLASS_STRING (cl
),
9322 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
9323 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9327 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
9330 omp_clause_check_failed (const_tree node
, const char *file
, int line
,
9331 const char *function
, enum omp_clause_code code
)
9333 internal_error ("tree check: expected omp_clause %s, have %s in %s, at %s:%d",
9334 omp_clause_code_name
[code
], get_tree_code_name (TREE_CODE (node
)),
9335 function
, trim_filename (file
), line
);
9339 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
9342 omp_clause_range_check_failed (const_tree node
, const char *file
, int line
,
9343 const char *function
, enum omp_clause_code c1
,
9344 enum omp_clause_code c2
)
9347 unsigned length
= 0;
9350 for (c
= c1
; c
<= c2
; ++c
)
9351 length
+= 4 + strlen (omp_clause_code_name
[c
]);
9353 length
+= strlen ("expected ");
9354 buffer
= (char *) alloca (length
);
9357 for (c
= c1
; c
<= c2
; ++c
)
9359 const char *prefix
= length
? " or " : "expected ";
9361 strcpy (buffer
+ length
, prefix
);
9362 length
+= strlen (prefix
);
9363 strcpy (buffer
+ length
, omp_clause_code_name
[c
]);
9364 length
+= strlen (omp_clause_code_name
[c
]);
9367 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9368 buffer
, omp_clause_code_name
[TREE_CODE (node
)],
9369 function
, trim_filename (file
), line
);
9373 #undef DEFTREESTRUCT
9374 #define DEFTREESTRUCT(VAL, NAME) NAME,
9376 static const char *ts_enum_names
[] = {
9377 #include "treestruct.def"
9379 #undef DEFTREESTRUCT
9381 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
9383 /* Similar to tree_class_check_failed, except that we check for
9384 whether CODE contains the tree structure identified by EN. */
9387 tree_contains_struct_check_failed (const_tree node
,
9388 const enum tree_node_structure_enum en
,
9389 const char *file
, int line
,
9390 const char *function
)
9393 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
9395 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9399 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9400 (dynamically sized) vector. */
9403 tree_int_cst_elt_check_failed (int idx
, int len
, const char *file
, int line
,
9404 const char *function
)
9407 ("tree check: accessed elt %d of tree_int_cst with %d elts in %s, at %s:%d",
9408 idx
+ 1, len
, function
, trim_filename (file
), line
);
9411 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9412 (dynamically sized) vector. */
9415 tree_vec_elt_check_failed (int idx
, int len
, const char *file
, int line
,
9416 const char *function
)
9419 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
9420 idx
+ 1, len
, function
, trim_filename (file
), line
);
9423 /* Similar to above, except that the check is for the bounds of the operand
9424 vector of an expression node EXP. */
9427 tree_operand_check_failed (int idx
, const_tree exp
, const char *file
,
9428 int line
, const char *function
)
9430 enum tree_code code
= TREE_CODE (exp
);
9432 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
9433 idx
+ 1, get_tree_code_name (code
), TREE_OPERAND_LENGTH (exp
),
9434 function
, trim_filename (file
), line
);
9437 /* Similar to above, except that the check is for the number of
9438 operands of an OMP_CLAUSE node. */
9441 omp_clause_operand_check_failed (int idx
, const_tree t
, const char *file
,
9442 int line
, const char *function
)
9445 ("tree check: accessed operand %d of omp_clause %s with %d operands "
9446 "in %s, at %s:%d", idx
+ 1, omp_clause_code_name
[OMP_CLAUSE_CODE (t
)],
9447 omp_clause_num_ops
[OMP_CLAUSE_CODE (t
)], function
,
9448 trim_filename (file
), line
);
9450 #endif /* ENABLE_TREE_CHECKING */
9452 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
9453 and mapped to the machine mode MODE. Initialize its fields and build
9454 the information necessary for debugging output. */
9457 make_vector_type (tree innertype
, int nunits
, machine_mode mode
)
9460 inchash::hash hstate
;
9462 t
= make_node (VECTOR_TYPE
);
9463 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (innertype
);
9464 SET_TYPE_VECTOR_SUBPARTS (t
, nunits
);
9465 SET_TYPE_MODE (t
, mode
);
9467 if (TYPE_STRUCTURAL_EQUALITY_P (innertype
))
9468 SET_TYPE_STRUCTURAL_EQUALITY (t
);
9469 else if (TYPE_CANONICAL (innertype
) != innertype
9470 || mode
!= VOIDmode
)
9472 = make_vector_type (TYPE_CANONICAL (innertype
), nunits
, VOIDmode
);
9476 hstate
.add_wide_int (VECTOR_TYPE
);
9477 hstate
.add_wide_int (nunits
);
9478 hstate
.add_wide_int (mode
);
9479 hstate
.add_object (TYPE_HASH (TREE_TYPE (t
)));
9480 t
= type_hash_canon (hstate
.end (), t
);
9482 /* We have built a main variant, based on the main variant of the
9483 inner type. Use it to build the variant we return. */
9484 if ((TYPE_ATTRIBUTES (innertype
) || TYPE_QUALS (innertype
))
9485 && TREE_TYPE (t
) != innertype
)
9486 return build_type_attribute_qual_variant (t
,
9487 TYPE_ATTRIBUTES (innertype
),
9488 TYPE_QUALS (innertype
));
9494 make_or_reuse_type (unsigned size
, int unsignedp
)
9498 if (size
== INT_TYPE_SIZE
)
9499 return unsignedp
? unsigned_type_node
: integer_type_node
;
9500 if (size
== CHAR_TYPE_SIZE
)
9501 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
9502 if (size
== SHORT_TYPE_SIZE
)
9503 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
9504 if (size
== LONG_TYPE_SIZE
)
9505 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
9506 if (size
== LONG_LONG_TYPE_SIZE
)
9507 return (unsignedp
? long_long_unsigned_type_node
9508 : long_long_integer_type_node
);
9510 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
9511 if (size
== int_n_data
[i
].bitsize
9512 && int_n_enabled_p
[i
])
9513 return (unsignedp
? int_n_trees
[i
].unsigned_type
9514 : int_n_trees
[i
].signed_type
);
9517 return make_unsigned_type (size
);
9519 return make_signed_type (size
);
9522 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
9525 make_or_reuse_fract_type (unsigned size
, int unsignedp
, int satp
)
9529 if (size
== SHORT_FRACT_TYPE_SIZE
)
9530 return unsignedp
? sat_unsigned_short_fract_type_node
9531 : sat_short_fract_type_node
;
9532 if (size
== FRACT_TYPE_SIZE
)
9533 return unsignedp
? sat_unsigned_fract_type_node
: sat_fract_type_node
;
9534 if (size
== LONG_FRACT_TYPE_SIZE
)
9535 return unsignedp
? sat_unsigned_long_fract_type_node
9536 : sat_long_fract_type_node
;
9537 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
9538 return unsignedp
? sat_unsigned_long_long_fract_type_node
9539 : sat_long_long_fract_type_node
;
9543 if (size
== SHORT_FRACT_TYPE_SIZE
)
9544 return unsignedp
? unsigned_short_fract_type_node
9545 : short_fract_type_node
;
9546 if (size
== FRACT_TYPE_SIZE
)
9547 return unsignedp
? unsigned_fract_type_node
: fract_type_node
;
9548 if (size
== LONG_FRACT_TYPE_SIZE
)
9549 return unsignedp
? unsigned_long_fract_type_node
9550 : long_fract_type_node
;
9551 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
9552 return unsignedp
? unsigned_long_long_fract_type_node
9553 : long_long_fract_type_node
;
9556 return make_fract_type (size
, unsignedp
, satp
);
9559 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
9562 make_or_reuse_accum_type (unsigned size
, int unsignedp
, int satp
)
9566 if (size
== SHORT_ACCUM_TYPE_SIZE
)
9567 return unsignedp
? sat_unsigned_short_accum_type_node
9568 : sat_short_accum_type_node
;
9569 if (size
== ACCUM_TYPE_SIZE
)
9570 return unsignedp
? sat_unsigned_accum_type_node
: sat_accum_type_node
;
9571 if (size
== LONG_ACCUM_TYPE_SIZE
)
9572 return unsignedp
? sat_unsigned_long_accum_type_node
9573 : sat_long_accum_type_node
;
9574 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
9575 return unsignedp
? sat_unsigned_long_long_accum_type_node
9576 : sat_long_long_accum_type_node
;
9580 if (size
== SHORT_ACCUM_TYPE_SIZE
)
9581 return unsignedp
? unsigned_short_accum_type_node
9582 : short_accum_type_node
;
9583 if (size
== ACCUM_TYPE_SIZE
)
9584 return unsignedp
? unsigned_accum_type_node
: accum_type_node
;
9585 if (size
== LONG_ACCUM_TYPE_SIZE
)
9586 return unsignedp
? unsigned_long_accum_type_node
9587 : long_accum_type_node
;
9588 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
9589 return unsignedp
? unsigned_long_long_accum_type_node
9590 : long_long_accum_type_node
;
9593 return make_accum_type (size
, unsignedp
, satp
);
9597 /* Create an atomic variant node for TYPE. This routine is called
9598 during initialization of data types to create the 5 basic atomic
9599 types. The generic build_variant_type function requires these to
9600 already be set up in order to function properly, so cannot be
9601 called from there. If ALIGN is non-zero, then ensure alignment is
9602 overridden to this value. */
9605 build_atomic_base (tree type
, unsigned int align
)
9609 /* Make sure its not already registered. */
9610 if ((t
= get_qualified_type (type
, TYPE_QUAL_ATOMIC
)))
9613 t
= build_variant_type_copy (type
);
9614 set_type_quals (t
, TYPE_QUAL_ATOMIC
);
9617 TYPE_ALIGN (t
) = align
;
9622 /* Create nodes for all integer types (and error_mark_node) using the sizes
9623 of C datatypes. SIGNED_CHAR specifies whether char is signed,
9624 SHORT_DOUBLE specifies whether double should be of the same precision
9628 build_common_tree_nodes (bool signed_char
, bool short_double
)
9632 error_mark_node
= make_node (ERROR_MARK
);
9633 TREE_TYPE (error_mark_node
) = error_mark_node
;
9635 initialize_sizetypes ();
9637 /* Define both `signed char' and `unsigned char'. */
9638 signed_char_type_node
= make_signed_type (CHAR_TYPE_SIZE
);
9639 TYPE_STRING_FLAG (signed_char_type_node
) = 1;
9640 unsigned_char_type_node
= make_unsigned_type (CHAR_TYPE_SIZE
);
9641 TYPE_STRING_FLAG (unsigned_char_type_node
) = 1;
9643 /* Define `char', which is like either `signed char' or `unsigned char'
9644 but not the same as either. */
9647 ? make_signed_type (CHAR_TYPE_SIZE
)
9648 : make_unsigned_type (CHAR_TYPE_SIZE
));
9649 TYPE_STRING_FLAG (char_type_node
) = 1;
9651 short_integer_type_node
= make_signed_type (SHORT_TYPE_SIZE
);
9652 short_unsigned_type_node
= make_unsigned_type (SHORT_TYPE_SIZE
);
9653 integer_type_node
= make_signed_type (INT_TYPE_SIZE
);
9654 unsigned_type_node
= make_unsigned_type (INT_TYPE_SIZE
);
9655 long_integer_type_node
= make_signed_type (LONG_TYPE_SIZE
);
9656 long_unsigned_type_node
= make_unsigned_type (LONG_TYPE_SIZE
);
9657 long_long_integer_type_node
= make_signed_type (LONG_LONG_TYPE_SIZE
);
9658 long_long_unsigned_type_node
= make_unsigned_type (LONG_LONG_TYPE_SIZE
);
9660 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
9662 int_n_trees
[i
].signed_type
= make_signed_type (int_n_data
[i
].bitsize
);
9663 int_n_trees
[i
].unsigned_type
= make_unsigned_type (int_n_data
[i
].bitsize
);
9664 TYPE_SIZE (int_n_trees
[i
].signed_type
) = bitsize_int (int_n_data
[i
].bitsize
);
9665 TYPE_SIZE (int_n_trees
[i
].unsigned_type
) = bitsize_int (int_n_data
[i
].bitsize
);
9667 if (int_n_data
[i
].bitsize
> LONG_LONG_TYPE_SIZE
9668 && int_n_enabled_p
[i
])
9670 integer_types
[itk_intN_0
+ i
* 2] = int_n_trees
[i
].signed_type
;
9671 integer_types
[itk_unsigned_intN_0
+ i
* 2] = int_n_trees
[i
].unsigned_type
;
9675 /* Define a boolean type. This type only represents boolean values but
9676 may be larger than char depending on the value of BOOL_TYPE_SIZE. */
9677 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
9678 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
9679 TYPE_PRECISION (boolean_type_node
) = 1;
9680 TYPE_MAX_VALUE (boolean_type_node
) = build_int_cst (boolean_type_node
, 1);
9682 /* Define what type to use for size_t. */
9683 if (strcmp (SIZE_TYPE
, "unsigned int") == 0)
9684 size_type_node
= unsigned_type_node
;
9685 else if (strcmp (SIZE_TYPE
, "long unsigned int") == 0)
9686 size_type_node
= long_unsigned_type_node
;
9687 else if (strcmp (SIZE_TYPE
, "long long unsigned int") == 0)
9688 size_type_node
= long_long_unsigned_type_node
;
9689 else if (strcmp (SIZE_TYPE
, "short unsigned int") == 0)
9690 size_type_node
= short_unsigned_type_node
;
9695 size_type_node
= NULL_TREE
;
9696 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
9697 if (int_n_enabled_p
[i
])
9700 sprintf (name
, "__int%d unsigned", int_n_data
[i
].bitsize
);
9702 if (strcmp (name
, SIZE_TYPE
) == 0)
9704 size_type_node
= int_n_trees
[i
].unsigned_type
;
9707 if (size_type_node
== NULL_TREE
)
9711 /* Fill in the rest of the sized types. Reuse existing type nodes
9713 intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 0);
9714 intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 0);
9715 intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 0);
9716 intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 0);
9717 intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 0);
9719 unsigned_intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 1);
9720 unsigned_intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 1);
9721 unsigned_intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 1);
9722 unsigned_intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 1);
9723 unsigned_intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 1);
9725 /* Don't call build_qualified type for atomics. That routine does
9726 special processing for atomics, and until they are initialized
9727 it's better not to make that call.
9729 Check to see if there is a target override for atomic types. */
9731 atomicQI_type_node
= build_atomic_base (unsigned_intQI_type_node
,
9732 targetm
.atomic_align_for_mode (QImode
));
9733 atomicHI_type_node
= build_atomic_base (unsigned_intHI_type_node
,
9734 targetm
.atomic_align_for_mode (HImode
));
9735 atomicSI_type_node
= build_atomic_base (unsigned_intSI_type_node
,
9736 targetm
.atomic_align_for_mode (SImode
));
9737 atomicDI_type_node
= build_atomic_base (unsigned_intDI_type_node
,
9738 targetm
.atomic_align_for_mode (DImode
));
9739 atomicTI_type_node
= build_atomic_base (unsigned_intTI_type_node
,
9740 targetm
.atomic_align_for_mode (TImode
));
9742 access_public_node
= get_identifier ("public");
9743 access_protected_node
= get_identifier ("protected");
9744 access_private_node
= get_identifier ("private");
9746 /* Define these next since types below may used them. */
9747 integer_zero_node
= build_int_cst (integer_type_node
, 0);
9748 integer_one_node
= build_int_cst (integer_type_node
, 1);
9749 integer_three_node
= build_int_cst (integer_type_node
, 3);
9750 integer_minus_one_node
= build_int_cst (integer_type_node
, -1);
9752 size_zero_node
= size_int (0);
9753 size_one_node
= size_int (1);
9754 bitsize_zero_node
= bitsize_int (0);
9755 bitsize_one_node
= bitsize_int (1);
9756 bitsize_unit_node
= bitsize_int (BITS_PER_UNIT
);
9758 boolean_false_node
= TYPE_MIN_VALUE (boolean_type_node
);
9759 boolean_true_node
= TYPE_MAX_VALUE (boolean_type_node
);
9761 void_type_node
= make_node (VOID_TYPE
);
9762 layout_type (void_type_node
);
9764 pointer_bounds_type_node
= targetm
.chkp_bound_type ();
9766 /* We are not going to have real types in C with less than byte alignment,
9767 so we might as well not have any types that claim to have it. */
9768 TYPE_ALIGN (void_type_node
) = BITS_PER_UNIT
;
9769 TYPE_USER_ALIGN (void_type_node
) = 0;
9771 void_node
= make_node (VOID_CST
);
9772 TREE_TYPE (void_node
) = void_type_node
;
9774 null_pointer_node
= build_int_cst (build_pointer_type (void_type_node
), 0);
9775 layout_type (TREE_TYPE (null_pointer_node
));
9777 ptr_type_node
= build_pointer_type (void_type_node
);
9779 = build_pointer_type (build_type_variant (void_type_node
, 1, 0));
9780 fileptr_type_node
= ptr_type_node
;
9782 pointer_sized_int_node
= build_nonstandard_integer_type (POINTER_SIZE
, 1);
9784 float_type_node
= make_node (REAL_TYPE
);
9785 TYPE_PRECISION (float_type_node
) = FLOAT_TYPE_SIZE
;
9786 layout_type (float_type_node
);
9788 double_type_node
= make_node (REAL_TYPE
);
9790 TYPE_PRECISION (double_type_node
) = FLOAT_TYPE_SIZE
;
9792 TYPE_PRECISION (double_type_node
) = DOUBLE_TYPE_SIZE
;
9793 layout_type (double_type_node
);
9795 long_double_type_node
= make_node (REAL_TYPE
);
9796 TYPE_PRECISION (long_double_type_node
) = LONG_DOUBLE_TYPE_SIZE
;
9797 layout_type (long_double_type_node
);
9799 float_ptr_type_node
= build_pointer_type (float_type_node
);
9800 double_ptr_type_node
= build_pointer_type (double_type_node
);
9801 long_double_ptr_type_node
= build_pointer_type (long_double_type_node
);
9802 integer_ptr_type_node
= build_pointer_type (integer_type_node
);
9804 /* Fixed size integer types. */
9805 uint16_type_node
= make_or_reuse_type (16, 1);
9806 uint32_type_node
= make_or_reuse_type (32, 1);
9807 uint64_type_node
= make_or_reuse_type (64, 1);
9809 /* Decimal float types. */
9810 dfloat32_type_node
= make_node (REAL_TYPE
);
9811 TYPE_PRECISION (dfloat32_type_node
) = DECIMAL32_TYPE_SIZE
;
9812 layout_type (dfloat32_type_node
);
9813 SET_TYPE_MODE (dfloat32_type_node
, SDmode
);
9814 dfloat32_ptr_type_node
= build_pointer_type (dfloat32_type_node
);
9816 dfloat64_type_node
= make_node (REAL_TYPE
);
9817 TYPE_PRECISION (dfloat64_type_node
) = DECIMAL64_TYPE_SIZE
;
9818 layout_type (dfloat64_type_node
);
9819 SET_TYPE_MODE (dfloat64_type_node
, DDmode
);
9820 dfloat64_ptr_type_node
= build_pointer_type (dfloat64_type_node
);
9822 dfloat128_type_node
= make_node (REAL_TYPE
);
9823 TYPE_PRECISION (dfloat128_type_node
) = DECIMAL128_TYPE_SIZE
;
9824 layout_type (dfloat128_type_node
);
9825 SET_TYPE_MODE (dfloat128_type_node
, TDmode
);
9826 dfloat128_ptr_type_node
= build_pointer_type (dfloat128_type_node
);
9828 complex_integer_type_node
= build_complex_type (integer_type_node
);
9829 complex_float_type_node
= build_complex_type (float_type_node
);
9830 complex_double_type_node
= build_complex_type (double_type_node
);
9831 complex_long_double_type_node
= build_complex_type (long_double_type_node
);
9833 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
9834 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
9835 sat_ ## KIND ## _type_node = \
9836 make_sat_signed_ ## KIND ## _type (SIZE); \
9837 sat_unsigned_ ## KIND ## _type_node = \
9838 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9839 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9840 unsigned_ ## KIND ## _type_node = \
9841 make_unsigned_ ## KIND ## _type (SIZE);
9843 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
9844 sat_ ## WIDTH ## KIND ## _type_node = \
9845 make_sat_signed_ ## KIND ## _type (SIZE); \
9846 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
9847 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9848 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9849 unsigned_ ## WIDTH ## KIND ## _type_node = \
9850 make_unsigned_ ## KIND ## _type (SIZE);
9852 /* Make fixed-point type nodes based on four different widths. */
9853 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
9854 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
9855 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
9856 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
9857 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
9859 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
9860 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
9861 NAME ## _type_node = \
9862 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
9863 u ## NAME ## _type_node = \
9864 make_or_reuse_unsigned_ ## KIND ## _type \
9865 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
9866 sat_ ## NAME ## _type_node = \
9867 make_or_reuse_sat_signed_ ## KIND ## _type \
9868 (GET_MODE_BITSIZE (MODE ## mode)); \
9869 sat_u ## NAME ## _type_node = \
9870 make_or_reuse_sat_unsigned_ ## KIND ## _type \
9871 (GET_MODE_BITSIZE (U ## MODE ## mode));
9873 /* Fixed-point type and mode nodes. */
9874 MAKE_FIXED_TYPE_NODE_FAMILY (fract
, FRACT
)
9875 MAKE_FIXED_TYPE_NODE_FAMILY (accum
, ACCUM
)
9876 MAKE_FIXED_MODE_NODE (fract
, qq
, QQ
)
9877 MAKE_FIXED_MODE_NODE (fract
, hq
, HQ
)
9878 MAKE_FIXED_MODE_NODE (fract
, sq
, SQ
)
9879 MAKE_FIXED_MODE_NODE (fract
, dq
, DQ
)
9880 MAKE_FIXED_MODE_NODE (fract
, tq
, TQ
)
9881 MAKE_FIXED_MODE_NODE (accum
, ha
, HA
)
9882 MAKE_FIXED_MODE_NODE (accum
, sa
, SA
)
9883 MAKE_FIXED_MODE_NODE (accum
, da
, DA
)
9884 MAKE_FIXED_MODE_NODE (accum
, ta
, TA
)
9887 tree t
= targetm
.build_builtin_va_list ();
9889 /* Many back-ends define record types without setting TYPE_NAME.
9890 If we copied the record type here, we'd keep the original
9891 record type without a name. This breaks name mangling. So,
9892 don't copy record types and let c_common_nodes_and_builtins()
9893 declare the type to be __builtin_va_list. */
9894 if (TREE_CODE (t
) != RECORD_TYPE
)
9895 t
= build_variant_type_copy (t
);
9897 va_list_type_node
= t
;
9901 /* Modify DECL for given flags.
9902 TM_PURE attribute is set only on types, so the function will modify
9903 DECL's type when ECF_TM_PURE is used. */
9906 set_call_expr_flags (tree decl
, int flags
)
9908 if (flags
& ECF_NOTHROW
)
9909 TREE_NOTHROW (decl
) = 1;
9910 if (flags
& ECF_CONST
)
9911 TREE_READONLY (decl
) = 1;
9912 if (flags
& ECF_PURE
)
9913 DECL_PURE_P (decl
) = 1;
9914 if (flags
& ECF_LOOPING_CONST_OR_PURE
)
9915 DECL_LOOPING_CONST_OR_PURE_P (decl
) = 1;
9916 if (flags
& ECF_NOVOPS
)
9917 DECL_IS_NOVOPS (decl
) = 1;
9918 if (flags
& ECF_NORETURN
)
9919 TREE_THIS_VOLATILE (decl
) = 1;
9920 if (flags
& ECF_MALLOC
)
9921 DECL_IS_MALLOC (decl
) = 1;
9922 if (flags
& ECF_RETURNS_TWICE
)
9923 DECL_IS_RETURNS_TWICE (decl
) = 1;
9924 if (flags
& ECF_LEAF
)
9925 DECL_ATTRIBUTES (decl
) = tree_cons (get_identifier ("leaf"),
9926 NULL
, DECL_ATTRIBUTES (decl
));
9927 if ((flags
& ECF_TM_PURE
) && flag_tm
)
9928 apply_tm_attr (decl
, get_identifier ("transaction_pure"));
9929 /* Looping const or pure is implied by noreturn.
9930 There is currently no way to declare looping const or looping pure alone. */
9931 gcc_assert (!(flags
& ECF_LOOPING_CONST_OR_PURE
)
9932 || ((flags
& ECF_NORETURN
) && (flags
& (ECF_CONST
| ECF_PURE
))));
9936 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
9939 local_define_builtin (const char *name
, tree type
, enum built_in_function code
,
9940 const char *library_name
, int ecf_flags
)
9944 decl
= add_builtin_function (name
, type
, code
, BUILT_IN_NORMAL
,
9945 library_name
, NULL_TREE
);
9946 set_call_expr_flags (decl
, ecf_flags
);
9948 set_builtin_decl (code
, decl
, true);
9951 /* Call this function after instantiating all builtins that the language
9952 front end cares about. This will build the rest of the builtins
9953 and internal functions that are relied upon by the tree optimizers and
9957 build_common_builtin_nodes (void)
9962 if (!builtin_decl_explicit_p (BUILT_IN_UNREACHABLE
))
9964 ftype
= build_function_type (void_type_node
, void_list_node
);
9965 local_define_builtin ("__builtin_unreachable", ftype
, BUILT_IN_UNREACHABLE
,
9966 "__builtin_unreachable",
9967 ECF_NOTHROW
| ECF_LEAF
| ECF_NORETURN
9971 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
)
9972 || !builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
9974 ftype
= build_function_type_list (ptr_type_node
,
9975 ptr_type_node
, const_ptr_type_node
,
9976 size_type_node
, NULL_TREE
);
9978 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
))
9979 local_define_builtin ("__builtin_memcpy", ftype
, BUILT_IN_MEMCPY
,
9980 "memcpy", ECF_NOTHROW
| ECF_LEAF
);
9981 if (!builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
9982 local_define_builtin ("__builtin_memmove", ftype
, BUILT_IN_MEMMOVE
,
9983 "memmove", ECF_NOTHROW
| ECF_LEAF
);
9986 if (!builtin_decl_explicit_p (BUILT_IN_MEMCMP
))
9988 ftype
= build_function_type_list (integer_type_node
, const_ptr_type_node
,
9989 const_ptr_type_node
, size_type_node
,
9991 local_define_builtin ("__builtin_memcmp", ftype
, BUILT_IN_MEMCMP
,
9992 "memcmp", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
9995 if (!builtin_decl_explicit_p (BUILT_IN_MEMSET
))
9997 ftype
= build_function_type_list (ptr_type_node
,
9998 ptr_type_node
, integer_type_node
,
9999 size_type_node
, NULL_TREE
);
10000 local_define_builtin ("__builtin_memset", ftype
, BUILT_IN_MEMSET
,
10001 "memset", ECF_NOTHROW
| ECF_LEAF
);
10004 if (!builtin_decl_explicit_p (BUILT_IN_ALLOCA
))
10006 ftype
= build_function_type_list (ptr_type_node
,
10007 size_type_node
, NULL_TREE
);
10008 local_define_builtin ("__builtin_alloca", ftype
, BUILT_IN_ALLOCA
,
10009 "alloca", ECF_MALLOC
| ECF_NOTHROW
| ECF_LEAF
);
10012 ftype
= build_function_type_list (ptr_type_node
, size_type_node
,
10013 size_type_node
, NULL_TREE
);
10014 local_define_builtin ("__builtin_alloca_with_align", ftype
,
10015 BUILT_IN_ALLOCA_WITH_ALIGN
, "alloca",
10016 ECF_MALLOC
| ECF_NOTHROW
| ECF_LEAF
);
10018 /* If we're checking the stack, `alloca' can throw. */
10019 if (flag_stack_check
)
10021 TREE_NOTHROW (builtin_decl_explicit (BUILT_IN_ALLOCA
)) = 0;
10022 TREE_NOTHROW (builtin_decl_explicit (BUILT_IN_ALLOCA_WITH_ALIGN
)) = 0;
10025 ftype
= build_function_type_list (void_type_node
,
10026 ptr_type_node
, ptr_type_node
,
10027 ptr_type_node
, NULL_TREE
);
10028 local_define_builtin ("__builtin_init_trampoline", ftype
,
10029 BUILT_IN_INIT_TRAMPOLINE
,
10030 "__builtin_init_trampoline", ECF_NOTHROW
| ECF_LEAF
);
10031 local_define_builtin ("__builtin_init_heap_trampoline", ftype
,
10032 BUILT_IN_INIT_HEAP_TRAMPOLINE
,
10033 "__builtin_init_heap_trampoline",
10034 ECF_NOTHROW
| ECF_LEAF
);
10036 ftype
= build_function_type_list (ptr_type_node
, ptr_type_node
, NULL_TREE
);
10037 local_define_builtin ("__builtin_adjust_trampoline", ftype
,
10038 BUILT_IN_ADJUST_TRAMPOLINE
,
10039 "__builtin_adjust_trampoline",
10040 ECF_CONST
| ECF_NOTHROW
);
10042 ftype
= build_function_type_list (void_type_node
,
10043 ptr_type_node
, ptr_type_node
, NULL_TREE
);
10044 local_define_builtin ("__builtin_nonlocal_goto", ftype
,
10045 BUILT_IN_NONLOCAL_GOTO
,
10046 "__builtin_nonlocal_goto",
10047 ECF_NORETURN
| ECF_NOTHROW
);
10049 ftype
= build_function_type_list (void_type_node
,
10050 ptr_type_node
, ptr_type_node
, NULL_TREE
);
10051 local_define_builtin ("__builtin_setjmp_setup", ftype
,
10052 BUILT_IN_SETJMP_SETUP
,
10053 "__builtin_setjmp_setup", ECF_NOTHROW
);
10055 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10056 local_define_builtin ("__builtin_setjmp_receiver", ftype
,
10057 BUILT_IN_SETJMP_RECEIVER
,
10058 "__builtin_setjmp_receiver", ECF_NOTHROW
| ECF_LEAF
);
10060 ftype
= build_function_type_list (ptr_type_node
, NULL_TREE
);
10061 local_define_builtin ("__builtin_stack_save", ftype
, BUILT_IN_STACK_SAVE
,
10062 "__builtin_stack_save", ECF_NOTHROW
| ECF_LEAF
);
10064 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10065 local_define_builtin ("__builtin_stack_restore", ftype
,
10066 BUILT_IN_STACK_RESTORE
,
10067 "__builtin_stack_restore", ECF_NOTHROW
| ECF_LEAF
);
10069 /* If there's a possibility that we might use the ARM EABI, build the
10070 alternate __cxa_end_cleanup node used to resume from C++ and Java. */
10071 if (targetm
.arm_eabi_unwinder
)
10073 ftype
= build_function_type_list (void_type_node
, NULL_TREE
);
10074 local_define_builtin ("__builtin_cxa_end_cleanup", ftype
,
10075 BUILT_IN_CXA_END_CLEANUP
,
10076 "__cxa_end_cleanup", ECF_NORETURN
| ECF_LEAF
);
10079 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10080 local_define_builtin ("__builtin_unwind_resume", ftype
,
10081 BUILT_IN_UNWIND_RESUME
,
10082 ((targetm_common
.except_unwind_info (&global_options
)
10084 ? "_Unwind_SjLj_Resume" : "_Unwind_Resume"),
10087 if (builtin_decl_explicit (BUILT_IN_RETURN_ADDRESS
) == NULL_TREE
)
10089 ftype
= build_function_type_list (ptr_type_node
, integer_type_node
,
10091 local_define_builtin ("__builtin_return_address", ftype
,
10092 BUILT_IN_RETURN_ADDRESS
,
10093 "__builtin_return_address",
10097 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
)
10098 || !builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
10100 ftype
= build_function_type_list (void_type_node
, ptr_type_node
,
10101 ptr_type_node
, NULL_TREE
);
10102 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
))
10103 local_define_builtin ("__cyg_profile_func_enter", ftype
,
10104 BUILT_IN_PROFILE_FUNC_ENTER
,
10105 "__cyg_profile_func_enter", 0);
10106 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
10107 local_define_builtin ("__cyg_profile_func_exit", ftype
,
10108 BUILT_IN_PROFILE_FUNC_EXIT
,
10109 "__cyg_profile_func_exit", 0);
10112 /* The exception object and filter values from the runtime. The argument
10113 must be zero before exception lowering, i.e. from the front end. After
10114 exception lowering, it will be the region number for the exception
10115 landing pad. These functions are PURE instead of CONST to prevent
10116 them from being hoisted past the exception edge that will initialize
10117 its value in the landing pad. */
10118 ftype
= build_function_type_list (ptr_type_node
,
10119 integer_type_node
, NULL_TREE
);
10120 ecf_flags
= ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
;
10121 /* Only use TM_PURE if we we have TM language support. */
10122 if (builtin_decl_explicit_p (BUILT_IN_TM_LOAD_1
))
10123 ecf_flags
|= ECF_TM_PURE
;
10124 local_define_builtin ("__builtin_eh_pointer", ftype
, BUILT_IN_EH_POINTER
,
10125 "__builtin_eh_pointer", ecf_flags
);
10127 tmp
= lang_hooks
.types
.type_for_mode (targetm
.eh_return_filter_mode (), 0);
10128 ftype
= build_function_type_list (tmp
, integer_type_node
, NULL_TREE
);
10129 local_define_builtin ("__builtin_eh_filter", ftype
, BUILT_IN_EH_FILTER
,
10130 "__builtin_eh_filter", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10132 ftype
= build_function_type_list (void_type_node
,
10133 integer_type_node
, integer_type_node
,
10135 local_define_builtin ("__builtin_eh_copy_values", ftype
,
10136 BUILT_IN_EH_COPY_VALUES
,
10137 "__builtin_eh_copy_values", ECF_NOTHROW
);
10139 /* Complex multiplication and division. These are handled as builtins
10140 rather than optabs because emit_library_call_value doesn't support
10141 complex. Further, we can do slightly better with folding these
10142 beasties if the real and complex parts of the arguments are separate. */
10146 for (mode
= MIN_MODE_COMPLEX_FLOAT
; mode
<= MAX_MODE_COMPLEX_FLOAT
; ++mode
)
10148 char mode_name_buf
[4], *q
;
10150 enum built_in_function mcode
, dcode
;
10151 tree type
, inner_type
;
10152 const char *prefix
= "__";
10154 if (targetm
.libfunc_gnu_prefix
)
10157 type
= lang_hooks
.types
.type_for_mode ((machine_mode
) mode
, 0);
10160 inner_type
= TREE_TYPE (type
);
10162 ftype
= build_function_type_list (type
, inner_type
, inner_type
,
10163 inner_type
, inner_type
, NULL_TREE
);
10165 mcode
= ((enum built_in_function
)
10166 (BUILT_IN_COMPLEX_MUL_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
10167 dcode
= ((enum built_in_function
)
10168 (BUILT_IN_COMPLEX_DIV_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
10170 for (p
= GET_MODE_NAME (mode
), q
= mode_name_buf
; *p
; p
++, q
++)
10174 built_in_names
[mcode
] = concat (prefix
, "mul", mode_name_buf
, "3",
10176 local_define_builtin (built_in_names
[mcode
], ftype
, mcode
,
10177 built_in_names
[mcode
],
10178 ECF_CONST
| ECF_NOTHROW
| ECF_LEAF
);
10180 built_in_names
[dcode
] = concat (prefix
, "div", mode_name_buf
, "3",
10182 local_define_builtin (built_in_names
[dcode
], ftype
, dcode
,
10183 built_in_names
[dcode
],
10184 ECF_CONST
| ECF_NOTHROW
| ECF_LEAF
);
10188 init_internal_fns ();
10191 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
10194 If we requested a pointer to a vector, build up the pointers that
10195 we stripped off while looking for the inner type. Similarly for
10196 return values from functions.
10198 The argument TYPE is the top of the chain, and BOTTOM is the
10199 new type which we will point to. */
10202 reconstruct_complex_type (tree type
, tree bottom
)
10206 if (TREE_CODE (type
) == POINTER_TYPE
)
10208 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10209 outer
= build_pointer_type_for_mode (inner
, TYPE_MODE (type
),
10210 TYPE_REF_CAN_ALIAS_ALL (type
));
10212 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
10214 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10215 outer
= build_reference_type_for_mode (inner
, TYPE_MODE (type
),
10216 TYPE_REF_CAN_ALIAS_ALL (type
));
10218 else if (TREE_CODE (type
) == ARRAY_TYPE
)
10220 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10221 outer
= build_array_type (inner
, TYPE_DOMAIN (type
));
10223 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10225 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10226 outer
= build_function_type (inner
, TYPE_ARG_TYPES (type
));
10228 else if (TREE_CODE (type
) == METHOD_TYPE
)
10230 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10231 /* The build_method_type_directly() routine prepends 'this' to argument list,
10232 so we must compensate by getting rid of it. */
10234 = build_method_type_directly
10235 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
))),
10237 TREE_CHAIN (TYPE_ARG_TYPES (type
)));
10239 else if (TREE_CODE (type
) == OFFSET_TYPE
)
10241 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10242 outer
= build_offset_type (TYPE_OFFSET_BASETYPE (type
), inner
);
10247 return build_type_attribute_qual_variant (outer
, TYPE_ATTRIBUTES (type
),
10248 TYPE_QUALS (type
));
10251 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
10254 build_vector_type_for_mode (tree innertype
, machine_mode mode
)
10258 switch (GET_MODE_CLASS (mode
))
10260 case MODE_VECTOR_INT
:
10261 case MODE_VECTOR_FLOAT
:
10262 case MODE_VECTOR_FRACT
:
10263 case MODE_VECTOR_UFRACT
:
10264 case MODE_VECTOR_ACCUM
:
10265 case MODE_VECTOR_UACCUM
:
10266 nunits
= GET_MODE_NUNITS (mode
);
10270 /* Check that there are no leftover bits. */
10271 gcc_assert (GET_MODE_BITSIZE (mode
)
10272 % TREE_INT_CST_LOW (TYPE_SIZE (innertype
)) == 0);
10274 nunits
= GET_MODE_BITSIZE (mode
)
10275 / TREE_INT_CST_LOW (TYPE_SIZE (innertype
));
10279 gcc_unreachable ();
10282 return make_vector_type (innertype
, nunits
, mode
);
10285 /* Similarly, but takes the inner type and number of units, which must be
10289 build_vector_type (tree innertype
, int nunits
)
10291 return make_vector_type (innertype
, nunits
, VOIDmode
);
10294 /* Similarly, but builds a variant type with TYPE_VECTOR_OPAQUE set. */
10297 build_opaque_vector_type (tree innertype
, int nunits
)
10299 tree t
= make_vector_type (innertype
, nunits
, VOIDmode
);
10301 /* We always build the non-opaque variant before the opaque one,
10302 so if it already exists, it is TYPE_NEXT_VARIANT of this one. */
10303 cand
= TYPE_NEXT_VARIANT (t
);
10305 && TYPE_VECTOR_OPAQUE (cand
)
10306 && check_qualified_type (cand
, t
, TYPE_QUALS (t
)))
10308 /* Othewise build a variant type and make sure to queue it after
10309 the non-opaque type. */
10310 cand
= build_distinct_type_copy (t
);
10311 TYPE_VECTOR_OPAQUE (cand
) = true;
10312 TYPE_CANONICAL (cand
) = TYPE_CANONICAL (t
);
10313 TYPE_NEXT_VARIANT (cand
) = TYPE_NEXT_VARIANT (t
);
10314 TYPE_NEXT_VARIANT (t
) = cand
;
10315 TYPE_MAIN_VARIANT (cand
) = TYPE_MAIN_VARIANT (t
);
10320 /* Given an initializer INIT, return TRUE if INIT is zero or some
10321 aggregate of zeros. Otherwise return FALSE. */
10323 initializer_zerop (const_tree init
)
10329 switch (TREE_CODE (init
))
10332 return integer_zerop (init
);
10335 /* ??? Note that this is not correct for C4X float formats. There,
10336 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
10337 negative exponent. */
10338 return real_zerop (init
)
10339 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init
));
10342 return fixed_zerop (init
);
10345 return integer_zerop (init
)
10346 || (real_zerop (init
)
10347 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init
)))
10348 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init
))));
10353 for (i
= 0; i
< VECTOR_CST_NELTS (init
); ++i
)
10354 if (!initializer_zerop (VECTOR_CST_ELT (init
, i
)))
10361 unsigned HOST_WIDE_INT idx
;
10363 if (TREE_CLOBBER_P (init
))
10365 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init
), idx
, elt
)
10366 if (!initializer_zerop (elt
))
10375 /* We need to loop through all elements to handle cases like
10376 "\0" and "\0foobar". */
10377 for (i
= 0; i
< TREE_STRING_LENGTH (init
); ++i
)
10378 if (TREE_STRING_POINTER (init
)[i
] != '\0')
10389 /* Check if vector VEC consists of all the equal elements and
10390 that the number of elements corresponds to the type of VEC.
10391 The function returns first element of the vector
10392 or NULL_TREE if the vector is not uniform. */
10394 uniform_vector_p (const_tree vec
)
10399 if (vec
== NULL_TREE
)
10402 gcc_assert (VECTOR_TYPE_P (TREE_TYPE (vec
)));
10404 if (TREE_CODE (vec
) == VECTOR_CST
)
10406 first
= VECTOR_CST_ELT (vec
, 0);
10407 for (i
= 1; i
< VECTOR_CST_NELTS (vec
); ++i
)
10408 if (!operand_equal_p (first
, VECTOR_CST_ELT (vec
, i
), 0))
10414 else if (TREE_CODE (vec
) == CONSTRUCTOR
)
10416 first
= error_mark_node
;
10418 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (vec
), i
, t
)
10425 if (!operand_equal_p (first
, t
, 0))
10428 if (i
!= TYPE_VECTOR_SUBPARTS (TREE_TYPE (vec
)))
10437 /* Build an empty statement at location LOC. */
10440 build_empty_stmt (location_t loc
)
10442 tree t
= build1 (NOP_EXPR
, void_type_node
, size_zero_node
);
10443 SET_EXPR_LOCATION (t
, loc
);
10448 /* Build an OpenMP clause with code CODE. LOC is the location of the
10452 build_omp_clause (location_t loc
, enum omp_clause_code code
)
10457 length
= omp_clause_num_ops
[code
];
10458 size
= (sizeof (struct tree_omp_clause
) + (length
- 1) * sizeof (tree
));
10460 record_node_allocation_statistics (OMP_CLAUSE
, size
);
10462 t
= (tree
) ggc_internal_alloc (size
);
10463 memset (t
, 0, size
);
10464 TREE_SET_CODE (t
, OMP_CLAUSE
);
10465 OMP_CLAUSE_SET_CODE (t
, code
);
10466 OMP_CLAUSE_LOCATION (t
) = loc
;
10471 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
10472 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
10473 Except for the CODE and operand count field, other storage for the
10474 object is initialized to zeros. */
10477 build_vl_exp_stat (enum tree_code code
, int len MEM_STAT_DECL
)
10480 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_exp
);
10482 gcc_assert (TREE_CODE_CLASS (code
) == tcc_vl_exp
);
10483 gcc_assert (len
>= 1);
10485 record_node_allocation_statistics (code
, length
);
10487 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
10489 TREE_SET_CODE (t
, code
);
10491 /* Can't use TREE_OPERAND to store the length because if checking is
10492 enabled, it will try to check the length before we store it. :-P */
10493 t
->exp
.operands
[0] = build_int_cst (sizetype
, len
);
10498 /* Helper function for build_call_* functions; build a CALL_EXPR with
10499 indicated RETURN_TYPE, FN, and NARGS, but do not initialize any of
10500 the argument slots. */
10503 build_call_1 (tree return_type
, tree fn
, int nargs
)
10507 t
= build_vl_exp (CALL_EXPR
, nargs
+ 3);
10508 TREE_TYPE (t
) = return_type
;
10509 CALL_EXPR_FN (t
) = fn
;
10510 CALL_EXPR_STATIC_CHAIN (t
) = NULL
;
10515 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10516 FN and a null static chain slot. NARGS is the number of call arguments
10517 which are specified as "..." arguments. */
10520 build_call_nary (tree return_type
, tree fn
, int nargs
, ...)
10524 va_start (args
, nargs
);
10525 ret
= build_call_valist (return_type
, fn
, nargs
, args
);
10530 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10531 FN and a null static chain slot. NARGS is the number of call arguments
10532 which are specified as a va_list ARGS. */
10535 build_call_valist (tree return_type
, tree fn
, int nargs
, va_list args
)
10540 t
= build_call_1 (return_type
, fn
, nargs
);
10541 for (i
= 0; i
< nargs
; i
++)
10542 CALL_EXPR_ARG (t
, i
) = va_arg (args
, tree
);
10543 process_call_operands (t
);
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 a tree array ARGS. */
10552 build_call_array_loc (location_t loc
, tree return_type
, tree fn
,
10553 int nargs
, const tree
*args
)
10558 t
= build_call_1 (return_type
, fn
, nargs
);
10559 for (i
= 0; i
< nargs
; i
++)
10560 CALL_EXPR_ARG (t
, i
) = args
[i
];
10561 process_call_operands (t
);
10562 SET_EXPR_LOCATION (t
, loc
);
10566 /* Like build_call_array, but takes a vec. */
10569 build_call_vec (tree return_type
, tree fn
, vec
<tree
, va_gc
> *args
)
10574 ret
= build_call_1 (return_type
, fn
, vec_safe_length (args
));
10575 FOR_EACH_VEC_SAFE_ELT (args
, ix
, t
)
10576 CALL_EXPR_ARG (ret
, ix
) = t
;
10577 process_call_operands (ret
);
10581 /* Conveniently construct a function call expression. FNDECL names the
10582 function to be called and N arguments are passed in the array
10586 build_call_expr_loc_array (location_t loc
, tree fndecl
, int n
, tree
*argarray
)
10588 tree fntype
= TREE_TYPE (fndecl
);
10589 tree fn
= build1 (ADDR_EXPR
, build_pointer_type (fntype
), fndecl
);
10591 return fold_builtin_call_array (loc
, TREE_TYPE (fntype
), fn
, n
, argarray
);
10594 /* Conveniently construct a function call expression. FNDECL names the
10595 function to be called and the arguments are passed in the vector
10599 build_call_expr_loc_vec (location_t loc
, tree fndecl
, vec
<tree
, va_gc
> *vec
)
10601 return build_call_expr_loc_array (loc
, fndecl
, vec_safe_length (vec
),
10602 vec_safe_address (vec
));
10606 /* Conveniently construct a function call expression. FNDECL names the
10607 function to be called, N is the number of arguments, and the "..."
10608 parameters are the argument expressions. */
10611 build_call_expr_loc (location_t loc
, tree fndecl
, int n
, ...)
10614 tree
*argarray
= XALLOCAVEC (tree
, n
);
10618 for (i
= 0; i
< n
; i
++)
10619 argarray
[i
] = va_arg (ap
, tree
);
10621 return build_call_expr_loc_array (loc
, fndecl
, n
, argarray
);
10624 /* Like build_call_expr_loc (UNKNOWN_LOCATION, ...). Duplicated because
10625 varargs macros aren't supported by all bootstrap compilers. */
10628 build_call_expr (tree fndecl
, int n
, ...)
10631 tree
*argarray
= XALLOCAVEC (tree
, n
);
10635 for (i
= 0; i
< n
; i
++)
10636 argarray
[i
] = va_arg (ap
, tree
);
10638 return build_call_expr_loc_array (UNKNOWN_LOCATION
, fndecl
, n
, argarray
);
10641 /* Build internal call expression. This is just like CALL_EXPR, except
10642 its CALL_EXPR_FN is NULL. It will get gimplified later into ordinary
10643 internal function. */
10646 build_call_expr_internal_loc (location_t loc
, enum internal_fn ifn
,
10647 tree type
, int n
, ...)
10652 tree fn
= build_call_1 (type
, NULL_TREE
, n
);
10654 for (i
= 0; i
< n
; i
++)
10655 CALL_EXPR_ARG (fn
, i
) = va_arg (ap
, tree
);
10657 SET_EXPR_LOCATION (fn
, loc
);
10658 CALL_EXPR_IFN (fn
) = ifn
;
10662 /* Create a new constant string literal and return a char* pointer to it.
10663 The STRING_CST value is the LEN characters at STR. */
10665 build_string_literal (int len
, const char *str
)
10667 tree t
, elem
, index
, type
;
10669 t
= build_string (len
, str
);
10670 elem
= build_type_variant (char_type_node
, 1, 0);
10671 index
= build_index_type (size_int (len
- 1));
10672 type
= build_array_type (elem
, index
);
10673 TREE_TYPE (t
) = type
;
10674 TREE_CONSTANT (t
) = 1;
10675 TREE_READONLY (t
) = 1;
10676 TREE_STATIC (t
) = 1;
10678 type
= build_pointer_type (elem
);
10679 t
= build1 (ADDR_EXPR
, type
,
10680 build4 (ARRAY_REF
, elem
,
10681 t
, integer_zero_node
, NULL_TREE
, NULL_TREE
));
10687 /* Return true if T (assumed to be a DECL) must be assigned a memory
10691 needs_to_live_in_memory (const_tree t
)
10693 return (TREE_ADDRESSABLE (t
)
10694 || is_global_var (t
)
10695 || (TREE_CODE (t
) == RESULT_DECL
10696 && !DECL_BY_REFERENCE (t
)
10697 && aggregate_value_p (t
, current_function_decl
)));
10700 /* Return value of a constant X and sign-extend it. */
10703 int_cst_value (const_tree x
)
10705 unsigned bits
= TYPE_PRECISION (TREE_TYPE (x
));
10706 unsigned HOST_WIDE_INT val
= TREE_INT_CST_LOW (x
);
10708 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
10709 gcc_assert (cst_and_fits_in_hwi (x
));
10711 if (bits
< HOST_BITS_PER_WIDE_INT
)
10713 bool negative
= ((val
>> (bits
- 1)) & 1) != 0;
10715 val
|= (~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1;
10717 val
&= ~((~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1);
10723 /* If TYPE is an integral or pointer type, return an integer type with
10724 the same precision which is unsigned iff UNSIGNEDP is true, or itself
10725 if TYPE is already an integer type of signedness UNSIGNEDP. */
10728 signed_or_unsigned_type_for (int unsignedp
, tree type
)
10730 if (TREE_CODE (type
) == INTEGER_TYPE
&& TYPE_UNSIGNED (type
) == unsignedp
)
10733 if (TREE_CODE (type
) == VECTOR_TYPE
)
10735 tree inner
= TREE_TYPE (type
);
10736 tree inner2
= signed_or_unsigned_type_for (unsignedp
, inner
);
10739 if (inner
== inner2
)
10741 return build_vector_type (inner2
, TYPE_VECTOR_SUBPARTS (type
));
10744 if (!INTEGRAL_TYPE_P (type
)
10745 && !POINTER_TYPE_P (type
)
10746 && TREE_CODE (type
) != OFFSET_TYPE
)
10749 return build_nonstandard_integer_type (TYPE_PRECISION (type
), unsignedp
);
10752 /* If TYPE is an integral or pointer type, return an integer type with
10753 the same precision which is unsigned, or itself if TYPE is already an
10754 unsigned integer type. */
10757 unsigned_type_for (tree type
)
10759 return signed_or_unsigned_type_for (1, type
);
10762 /* If TYPE is an integral or pointer type, return an integer type with
10763 the same precision which is signed, or itself if TYPE is already a
10764 signed integer type. */
10767 signed_type_for (tree type
)
10769 return signed_or_unsigned_type_for (0, type
);
10772 /* If TYPE is a vector type, return a signed integer vector type with the
10773 same width and number of subparts. Otherwise return boolean_type_node. */
10776 truth_type_for (tree type
)
10778 if (TREE_CODE (type
) == VECTOR_TYPE
)
10780 tree elem
= lang_hooks
.types
.type_for_size
10781 (GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (type
))), 0);
10782 return build_opaque_vector_type (elem
, TYPE_VECTOR_SUBPARTS (type
));
10785 return boolean_type_node
;
10788 /* Returns the largest value obtainable by casting something in INNER type to
10792 upper_bound_in_type (tree outer
, tree inner
)
10794 unsigned int det
= 0;
10795 unsigned oprec
= TYPE_PRECISION (outer
);
10796 unsigned iprec
= TYPE_PRECISION (inner
);
10799 /* Compute a unique number for every combination. */
10800 det
|= (oprec
> iprec
) ? 4 : 0;
10801 det
|= TYPE_UNSIGNED (outer
) ? 2 : 0;
10802 det
|= TYPE_UNSIGNED (inner
) ? 1 : 0;
10804 /* Determine the exponent to use. */
10809 /* oprec <= iprec, outer: signed, inner: don't care. */
10814 /* oprec <= iprec, outer: unsigned, inner: don't care. */
10818 /* oprec > iprec, outer: signed, inner: signed. */
10822 /* oprec > iprec, outer: signed, inner: unsigned. */
10826 /* oprec > iprec, outer: unsigned, inner: signed. */
10830 /* oprec > iprec, outer: unsigned, inner: unsigned. */
10834 gcc_unreachable ();
10837 return wide_int_to_tree (outer
,
10838 wi::mask (prec
, false, TYPE_PRECISION (outer
)));
10841 /* Returns the smallest value obtainable by casting something in INNER type to
10845 lower_bound_in_type (tree outer
, tree inner
)
10847 unsigned oprec
= TYPE_PRECISION (outer
);
10848 unsigned iprec
= TYPE_PRECISION (inner
);
10850 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
10852 if (TYPE_UNSIGNED (outer
)
10853 /* If we are widening something of an unsigned type, OUTER type
10854 contains all values of INNER type. In particular, both INNER
10855 and OUTER types have zero in common. */
10856 || (oprec
> iprec
&& TYPE_UNSIGNED (inner
)))
10857 return build_int_cst (outer
, 0);
10860 /* If we are widening a signed type to another signed type, we
10861 want to obtain -2^^(iprec-1). If we are keeping the
10862 precision or narrowing to a signed type, we want to obtain
10864 unsigned prec
= oprec
> iprec
? iprec
: oprec
;
10865 return wide_int_to_tree (outer
,
10866 wi::mask (prec
- 1, true,
10867 TYPE_PRECISION (outer
)));
10871 /* Return nonzero if two operands that are suitable for PHI nodes are
10872 necessarily equal. Specifically, both ARG0 and ARG1 must be either
10873 SSA_NAME or invariant. Note that this is strictly an optimization.
10874 That is, callers of this function can directly call operand_equal_p
10875 and get the same result, only slower. */
10878 operand_equal_for_phi_arg_p (const_tree arg0
, const_tree arg1
)
10882 if (TREE_CODE (arg0
) == SSA_NAME
|| TREE_CODE (arg1
) == SSA_NAME
)
10884 return operand_equal_p (arg0
, arg1
, 0);
10887 /* Returns number of zeros at the end of binary representation of X. */
10890 num_ending_zeros (const_tree x
)
10892 return build_int_cst (TREE_TYPE (x
), wi::ctz (x
));
10896 #define WALK_SUBTREE(NODE) \
10899 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
10905 /* This is a subroutine of walk_tree that walks field of TYPE that are to
10906 be walked whenever a type is seen in the tree. Rest of operands and return
10907 value are as for walk_tree. */
10910 walk_type_fields (tree type
, walk_tree_fn func
, void *data
,
10911 hash_set
<tree
> *pset
, walk_tree_lh lh
)
10913 tree result
= NULL_TREE
;
10915 switch (TREE_CODE (type
))
10918 case REFERENCE_TYPE
:
10920 /* We have to worry about mutually recursive pointers. These can't
10921 be written in C. They can in Ada. It's pathological, but
10922 there's an ACATS test (c38102a) that checks it. Deal with this
10923 by checking if we're pointing to another pointer, that one
10924 points to another pointer, that one does too, and we have no htab.
10925 If so, get a hash table. We check three levels deep to avoid
10926 the cost of the hash table if we don't need one. */
10927 if (POINTER_TYPE_P (TREE_TYPE (type
))
10928 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type
)))
10929 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type
))))
10932 result
= walk_tree_without_duplicates (&TREE_TYPE (type
),
10940 /* ... fall through ... */
10943 WALK_SUBTREE (TREE_TYPE (type
));
10947 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type
));
10949 /* Fall through. */
10951 case FUNCTION_TYPE
:
10952 WALK_SUBTREE (TREE_TYPE (type
));
10956 /* We never want to walk into default arguments. */
10957 for (arg
= TYPE_ARG_TYPES (type
); arg
; arg
= TREE_CHAIN (arg
))
10958 WALK_SUBTREE (TREE_VALUE (arg
));
10963 /* Don't follow this nodes's type if a pointer for fear that
10964 we'll have infinite recursion. If we have a PSET, then we
10967 || (!POINTER_TYPE_P (TREE_TYPE (type
))
10968 && TREE_CODE (TREE_TYPE (type
)) != OFFSET_TYPE
))
10969 WALK_SUBTREE (TREE_TYPE (type
));
10970 WALK_SUBTREE (TYPE_DOMAIN (type
));
10974 WALK_SUBTREE (TREE_TYPE (type
));
10975 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type
));
10985 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
10986 called with the DATA and the address of each sub-tree. If FUNC returns a
10987 non-NULL value, the traversal is stopped, and the value returned by FUNC
10988 is returned. If PSET is non-NULL it is used to record the nodes visited,
10989 and to avoid visiting a node more than once. */
10992 walk_tree_1 (tree
*tp
, walk_tree_fn func
, void *data
,
10993 hash_set
<tree
> *pset
, walk_tree_lh lh
)
10995 enum tree_code code
;
10999 #define WALK_SUBTREE_TAIL(NODE) \
11003 goto tail_recurse; \
11008 /* Skip empty subtrees. */
11012 /* Don't walk the same tree twice, if the user has requested
11013 that we avoid doing so. */
11014 if (pset
&& pset
->add (*tp
))
11017 /* Call the function. */
11019 result
= (*func
) (tp
, &walk_subtrees
, data
);
11021 /* If we found something, return it. */
11025 code
= TREE_CODE (*tp
);
11027 /* Even if we didn't, FUNC may have decided that there was nothing
11028 interesting below this point in the tree. */
11029 if (!walk_subtrees
)
11031 /* But we still need to check our siblings. */
11032 if (code
== TREE_LIST
)
11033 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
11034 else if (code
== OMP_CLAUSE
)
11035 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11042 result
= (*lh
) (tp
, &walk_subtrees
, func
, data
, pset
);
11043 if (result
|| !walk_subtrees
)
11050 case IDENTIFIER_NODE
:
11057 case PLACEHOLDER_EXPR
:
11061 /* None of these have subtrees other than those already walked
11066 WALK_SUBTREE (TREE_VALUE (*tp
));
11067 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
11072 int len
= TREE_VEC_LENGTH (*tp
);
11077 /* Walk all elements but the first. */
11079 WALK_SUBTREE (TREE_VEC_ELT (*tp
, len
));
11081 /* Now walk the first one as a tail call. */
11082 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp
, 0));
11086 WALK_SUBTREE (TREE_REALPART (*tp
));
11087 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp
));
11091 unsigned HOST_WIDE_INT idx
;
11092 constructor_elt
*ce
;
11094 for (idx
= 0; vec_safe_iterate (CONSTRUCTOR_ELTS (*tp
), idx
, &ce
);
11096 WALK_SUBTREE (ce
->value
);
11101 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, 0));
11106 for (decl
= BIND_EXPR_VARS (*tp
); decl
; decl
= DECL_CHAIN (decl
))
11108 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
11109 into declarations that are just mentioned, rather than
11110 declared; they don't really belong to this part of the tree.
11111 And, we can see cycles: the initializer for a declaration
11112 can refer to the declaration itself. */
11113 WALK_SUBTREE (DECL_INITIAL (decl
));
11114 WALK_SUBTREE (DECL_SIZE (decl
));
11115 WALK_SUBTREE (DECL_SIZE_UNIT (decl
));
11117 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp
));
11120 case STATEMENT_LIST
:
11122 tree_stmt_iterator i
;
11123 for (i
= tsi_start (*tp
); !tsi_end_p (i
); tsi_next (&i
))
11124 WALK_SUBTREE (*tsi_stmt_ptr (i
));
11129 switch (OMP_CLAUSE_CODE (*tp
))
11131 case OMP_CLAUSE_PRIVATE
:
11132 case OMP_CLAUSE_SHARED
:
11133 case OMP_CLAUSE_FIRSTPRIVATE
:
11134 case OMP_CLAUSE_COPYIN
:
11135 case OMP_CLAUSE_COPYPRIVATE
:
11136 case OMP_CLAUSE_FINAL
:
11137 case OMP_CLAUSE_IF
:
11138 case OMP_CLAUSE_NUM_THREADS
:
11139 case OMP_CLAUSE_SCHEDULE
:
11140 case OMP_CLAUSE_UNIFORM
:
11141 case OMP_CLAUSE_DEPEND
:
11142 case OMP_CLAUSE_NUM_TEAMS
:
11143 case OMP_CLAUSE_THREAD_LIMIT
:
11144 case OMP_CLAUSE_DEVICE
:
11145 case OMP_CLAUSE_DIST_SCHEDULE
:
11146 case OMP_CLAUSE_SAFELEN
:
11147 case OMP_CLAUSE_SIMDLEN
:
11148 case OMP_CLAUSE__LOOPTEMP_
:
11149 case OMP_CLAUSE__SIMDUID_
:
11150 case OMP_CLAUSE__CILK_FOR_COUNT_
:
11151 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 0));
11154 case OMP_CLAUSE_NOWAIT
:
11155 case OMP_CLAUSE_ORDERED
:
11156 case OMP_CLAUSE_DEFAULT
:
11157 case OMP_CLAUSE_UNTIED
:
11158 case OMP_CLAUSE_MERGEABLE
:
11159 case OMP_CLAUSE_PROC_BIND
:
11160 case OMP_CLAUSE_INBRANCH
:
11161 case OMP_CLAUSE_NOTINBRANCH
:
11162 case OMP_CLAUSE_FOR
:
11163 case OMP_CLAUSE_PARALLEL
:
11164 case OMP_CLAUSE_SECTIONS
:
11165 case OMP_CLAUSE_TASKGROUP
:
11166 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11168 case OMP_CLAUSE_LASTPRIVATE
:
11169 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
11170 WALK_SUBTREE (OMP_CLAUSE_LASTPRIVATE_STMT (*tp
));
11171 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11173 case OMP_CLAUSE_COLLAPSE
:
11176 for (i
= 0; i
< 3; i
++)
11177 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
11178 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11181 case OMP_CLAUSE_LINEAR
:
11182 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
11183 WALK_SUBTREE (OMP_CLAUSE_LINEAR_STEP (*tp
));
11184 WALK_SUBTREE (OMP_CLAUSE_LINEAR_STMT (*tp
));
11185 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11187 case OMP_CLAUSE_ALIGNED
:
11188 case OMP_CLAUSE_FROM
:
11189 case OMP_CLAUSE_TO
:
11190 case OMP_CLAUSE_MAP
:
11191 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
11192 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 1));
11193 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11195 case OMP_CLAUSE_REDUCTION
:
11198 for (i
= 0; i
< 4; i
++)
11199 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
11200 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11204 gcc_unreachable ();
11212 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
11213 But, we only want to walk once. */
11214 len
= (TREE_OPERAND (*tp
, 3) == TREE_OPERAND (*tp
, 1)) ? 2 : 3;
11215 for (i
= 0; i
< len
; ++i
)
11216 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
11217 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
));
11221 /* If this is a TYPE_DECL, walk into the fields of the type that it's
11222 defining. We only want to walk into these fields of a type in this
11223 case and not in the general case of a mere reference to the type.
11225 The criterion is as follows: if the field can be an expression, it
11226 must be walked only here. This should be in keeping with the fields
11227 that are directly gimplified in gimplify_type_sizes in order for the
11228 mark/copy-if-shared/unmark machinery of the gimplifier to work with
11229 variable-sized types.
11231 Note that DECLs get walked as part of processing the BIND_EXPR. */
11232 if (TREE_CODE (DECL_EXPR_DECL (*tp
)) == TYPE_DECL
)
11234 tree
*type_p
= &TREE_TYPE (DECL_EXPR_DECL (*tp
));
11235 if (TREE_CODE (*type_p
) == ERROR_MARK
)
11238 /* Call the function for the type. See if it returns anything or
11239 doesn't want us to continue. If we are to continue, walk both
11240 the normal fields and those for the declaration case. */
11241 result
= (*func
) (type_p
, &walk_subtrees
, data
);
11242 if (result
|| !walk_subtrees
)
11245 /* But do not walk a pointed-to type since it may itself need to
11246 be walked in the declaration case if it isn't anonymous. */
11247 if (!POINTER_TYPE_P (*type_p
))
11249 result
= walk_type_fields (*type_p
, func
, data
, pset
, lh
);
11254 /* If this is a record type, also walk the fields. */
11255 if (RECORD_OR_UNION_TYPE_P (*type_p
))
11259 for (field
= TYPE_FIELDS (*type_p
); field
;
11260 field
= DECL_CHAIN (field
))
11262 /* We'd like to look at the type of the field, but we can
11263 easily get infinite recursion. So assume it's pointed
11264 to elsewhere in the tree. Also, ignore things that
11266 if (TREE_CODE (field
) != FIELD_DECL
)
11269 WALK_SUBTREE (DECL_FIELD_OFFSET (field
));
11270 WALK_SUBTREE (DECL_SIZE (field
));
11271 WALK_SUBTREE (DECL_SIZE_UNIT (field
));
11272 if (TREE_CODE (*type_p
) == QUAL_UNION_TYPE
)
11273 WALK_SUBTREE (DECL_QUALIFIER (field
));
11277 /* Same for scalar types. */
11278 else if (TREE_CODE (*type_p
) == BOOLEAN_TYPE
11279 || TREE_CODE (*type_p
) == ENUMERAL_TYPE
11280 || TREE_CODE (*type_p
) == INTEGER_TYPE
11281 || TREE_CODE (*type_p
) == FIXED_POINT_TYPE
11282 || TREE_CODE (*type_p
) == REAL_TYPE
)
11284 WALK_SUBTREE (TYPE_MIN_VALUE (*type_p
));
11285 WALK_SUBTREE (TYPE_MAX_VALUE (*type_p
));
11288 WALK_SUBTREE (TYPE_SIZE (*type_p
));
11289 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p
));
11294 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code
)))
11298 /* Walk over all the sub-trees of this operand. */
11299 len
= TREE_OPERAND_LENGTH (*tp
);
11301 /* Go through the subtrees. We need to do this in forward order so
11302 that the scope of a FOR_EXPR is handled properly. */
11305 for (i
= 0; i
< len
- 1; ++i
)
11306 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
11307 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
- 1));
11310 /* If this is a type, walk the needed fields in the type. */
11311 else if (TYPE_P (*tp
))
11312 return walk_type_fields (*tp
, func
, data
, pset
, lh
);
11316 /* We didn't find what we were looking for. */
11319 #undef WALK_SUBTREE_TAIL
11321 #undef WALK_SUBTREE
11323 /* Like walk_tree, but does not walk duplicate nodes more than once. */
11326 walk_tree_without_duplicates_1 (tree
*tp
, walk_tree_fn func
, void *data
,
11331 hash_set
<tree
> pset
;
11332 result
= walk_tree_1 (tp
, func
, data
, &pset
, lh
);
11338 tree_block (tree t
)
11340 const enum tree_code_class c
= TREE_CODE_CLASS (TREE_CODE (t
));
11342 if (IS_EXPR_CODE_CLASS (c
))
11343 return LOCATION_BLOCK (t
->exp
.locus
);
11344 gcc_unreachable ();
11349 tree_set_block (tree t
, tree b
)
11351 const enum tree_code_class c
= TREE_CODE_CLASS (TREE_CODE (t
));
11353 if (IS_EXPR_CODE_CLASS (c
))
11356 t
->exp
.locus
= COMBINE_LOCATION_DATA (line_table
, t
->exp
.locus
, b
);
11358 t
->exp
.locus
= LOCATION_LOCUS (t
->exp
.locus
);
11361 gcc_unreachable ();
11364 /* Create a nameless artificial label and put it in the current
11365 function context. The label has a location of LOC. Returns the
11366 newly created label. */
11369 create_artificial_label (location_t loc
)
11371 tree lab
= build_decl (loc
,
11372 LABEL_DECL
, NULL_TREE
, void_type_node
);
11374 DECL_ARTIFICIAL (lab
) = 1;
11375 DECL_IGNORED_P (lab
) = 1;
11376 DECL_CONTEXT (lab
) = current_function_decl
;
11380 /* Given a tree, try to return a useful variable name that we can use
11381 to prefix a temporary that is being assigned the value of the tree.
11382 I.E. given <temp> = &A, return A. */
11387 tree stripped_decl
;
11390 STRIP_NOPS (stripped_decl
);
11391 if (DECL_P (stripped_decl
) && DECL_NAME (stripped_decl
))
11392 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl
));
11393 else if (TREE_CODE (stripped_decl
) == SSA_NAME
)
11395 tree name
= SSA_NAME_IDENTIFIER (stripped_decl
);
11398 return IDENTIFIER_POINTER (name
);
11402 switch (TREE_CODE (stripped_decl
))
11405 return get_name (TREE_OPERAND (stripped_decl
, 0));
11412 /* Return true if TYPE has a variable argument list. */
11415 stdarg_p (const_tree fntype
)
11417 function_args_iterator args_iter
;
11418 tree n
= NULL_TREE
, t
;
11423 FOREACH_FUNCTION_ARGS (fntype
, t
, args_iter
)
11428 return n
!= NULL_TREE
&& n
!= void_type_node
;
11431 /* Return true if TYPE has a prototype. */
11434 prototype_p (tree fntype
)
11438 gcc_assert (fntype
!= NULL_TREE
);
11440 t
= TYPE_ARG_TYPES (fntype
);
11441 return (t
!= NULL_TREE
);
11444 /* If BLOCK is inlined from an __attribute__((__artificial__))
11445 routine, return pointer to location from where it has been
11448 block_nonartificial_location (tree block
)
11450 location_t
*ret
= NULL
;
11452 while (block
&& TREE_CODE (block
) == BLOCK
11453 && BLOCK_ABSTRACT_ORIGIN (block
))
11455 tree ao
= BLOCK_ABSTRACT_ORIGIN (block
);
11457 while (TREE_CODE (ao
) == BLOCK
11458 && BLOCK_ABSTRACT_ORIGIN (ao
)
11459 && BLOCK_ABSTRACT_ORIGIN (ao
) != ao
)
11460 ao
= BLOCK_ABSTRACT_ORIGIN (ao
);
11462 if (TREE_CODE (ao
) == FUNCTION_DECL
)
11464 /* If AO is an artificial inline, point RET to the
11465 call site locus at which it has been inlined and continue
11466 the loop, in case AO's caller is also an artificial
11468 if (DECL_DECLARED_INLINE_P (ao
)
11469 && lookup_attribute ("artificial", DECL_ATTRIBUTES (ao
)))
11470 ret
= &BLOCK_SOURCE_LOCATION (block
);
11474 else if (TREE_CODE (ao
) != BLOCK
)
11477 block
= BLOCK_SUPERCONTEXT (block
);
11483 /* If EXP is inlined from an __attribute__((__artificial__))
11484 function, return the location of the original call expression. */
11487 tree_nonartificial_location (tree exp
)
11489 location_t
*loc
= block_nonartificial_location (TREE_BLOCK (exp
));
11494 return EXPR_LOCATION (exp
);
11498 /* These are the hash table functions for the hash table of OPTIMIZATION_NODEq
11501 /* Return the hash code code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
11504 cl_option_hasher::hash (tree x
)
11506 const_tree
const t
= x
;
11510 hashval_t hash
= 0;
11512 if (TREE_CODE (t
) == OPTIMIZATION_NODE
)
11514 p
= (const char *)TREE_OPTIMIZATION (t
);
11515 len
= sizeof (struct cl_optimization
);
11518 else if (TREE_CODE (t
) == TARGET_OPTION_NODE
)
11519 return cl_target_option_hash (TREE_TARGET_OPTION (t
));
11522 gcc_unreachable ();
11524 /* assume most opt flags are just 0/1, some are 2-3, and a few might be
11526 for (i
= 0; i
< len
; i
++)
11528 hash
= (hash
<< 4) ^ ((i
<< 2) | p
[i
]);
11533 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
11534 TARGET_OPTION tree node) is the same as that given by *Y, which is the
11538 cl_option_hasher::equal (tree x
, tree y
)
11540 const_tree
const xt
= x
;
11541 const_tree
const yt
= y
;
11546 if (TREE_CODE (xt
) != TREE_CODE (yt
))
11549 if (TREE_CODE (xt
) == OPTIMIZATION_NODE
)
11551 xp
= (const char *)TREE_OPTIMIZATION (xt
);
11552 yp
= (const char *)TREE_OPTIMIZATION (yt
);
11553 len
= sizeof (struct cl_optimization
);
11556 else if (TREE_CODE (xt
) == TARGET_OPTION_NODE
)
11558 return cl_target_option_eq (TREE_TARGET_OPTION (xt
),
11559 TREE_TARGET_OPTION (yt
));
11563 gcc_unreachable ();
11565 return (memcmp (xp
, yp
, len
) == 0);
11568 /* Build an OPTIMIZATION_NODE based on the options in OPTS. */
11571 build_optimization_node (struct gcc_options
*opts
)
11575 /* Use the cache of optimization nodes. */
11577 cl_optimization_save (TREE_OPTIMIZATION (cl_optimization_node
),
11580 tree
*slot
= cl_option_hash_table
->find_slot (cl_optimization_node
, INSERT
);
11584 /* Insert this one into the hash table. */
11585 t
= cl_optimization_node
;
11588 /* Make a new node for next time round. */
11589 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
11595 /* Build a TARGET_OPTION_NODE based on the options in OPTS. */
11598 build_target_option_node (struct gcc_options
*opts
)
11602 /* Use the cache of optimization nodes. */
11604 cl_target_option_save (TREE_TARGET_OPTION (cl_target_option_node
),
11607 tree
*slot
= cl_option_hash_table
->find_slot (cl_target_option_node
, INSERT
);
11611 /* Insert this one into the hash table. */
11612 t
= cl_target_option_node
;
11615 /* Make a new node for next time round. */
11616 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
11622 /* Clear TREE_TARGET_GLOBALS of all TARGET_OPTION_NODE trees,
11623 so that they aren't saved during PCH writing. */
11626 prepare_target_option_nodes_for_pch (void)
11628 hash_table
<cl_option_hasher
>::iterator iter
= cl_option_hash_table
->begin ();
11629 for (; iter
!= cl_option_hash_table
->end (); ++iter
)
11630 if (TREE_CODE (*iter
) == TARGET_OPTION_NODE
)
11631 TREE_TARGET_GLOBALS (*iter
) = NULL
;
11634 /* Determine the "ultimate origin" of a block. The block may be an inlined
11635 instance of an inlined instance of a block which is local to an inline
11636 function, so we have to trace all of the way back through the origin chain
11637 to find out what sort of node actually served as the original seed for the
11641 block_ultimate_origin (const_tree block
)
11643 tree immediate_origin
= BLOCK_ABSTRACT_ORIGIN (block
);
11645 /* BLOCK_ABSTRACT_ORIGIN can point to itself; ignore that if
11646 we're trying to output the abstract instance of this function. */
11647 if (BLOCK_ABSTRACT (block
) && immediate_origin
== block
)
11650 if (immediate_origin
== NULL_TREE
)
11655 tree lookahead
= immediate_origin
;
11659 ret_val
= lookahead
;
11660 lookahead
= (TREE_CODE (ret_val
) == BLOCK
11661 ? BLOCK_ABSTRACT_ORIGIN (ret_val
) : NULL
);
11663 while (lookahead
!= NULL
&& lookahead
!= ret_val
);
11665 /* The block's abstract origin chain may not be the *ultimate* origin of
11666 the block. It could lead to a DECL that has an abstract origin set.
11667 If so, we want that DECL's abstract origin (which is what DECL_ORIGIN
11668 will give us if it has one). Note that DECL's abstract origins are
11669 supposed to be the most distant ancestor (or so decl_ultimate_origin
11670 claims), so we don't need to loop following the DECL origins. */
11671 if (DECL_P (ret_val
))
11672 return DECL_ORIGIN (ret_val
);
11678 /* Return true iff conversion from INNER_TYPE to OUTER_TYPE generates
11682 tree_nop_conversion_p (const_tree outer_type
, const_tree inner_type
)
11684 /* Use precision rather then machine mode when we can, which gives
11685 the correct answer even for submode (bit-field) types. */
11686 if ((INTEGRAL_TYPE_P (outer_type
)
11687 || POINTER_TYPE_P (outer_type
)
11688 || TREE_CODE (outer_type
) == OFFSET_TYPE
)
11689 && (INTEGRAL_TYPE_P (inner_type
)
11690 || POINTER_TYPE_P (inner_type
)
11691 || TREE_CODE (inner_type
) == OFFSET_TYPE
))
11692 return TYPE_PRECISION (outer_type
) == TYPE_PRECISION (inner_type
);
11694 /* Otherwise fall back on comparing machine modes (e.g. for
11695 aggregate types, floats). */
11696 return TYPE_MODE (outer_type
) == TYPE_MODE (inner_type
);
11699 /* Return true iff conversion in EXP generates no instruction. Mark
11700 it inline so that we fully inline into the stripping functions even
11701 though we have two uses of this function. */
11704 tree_nop_conversion (const_tree exp
)
11706 tree outer_type
, inner_type
;
11708 if (!CONVERT_EXPR_P (exp
)
11709 && TREE_CODE (exp
) != NON_LVALUE_EXPR
)
11711 if (TREE_OPERAND (exp
, 0) == error_mark_node
)
11714 outer_type
= TREE_TYPE (exp
);
11715 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
11720 return tree_nop_conversion_p (outer_type
, inner_type
);
11723 /* Return true iff conversion in EXP generates no instruction. Don't
11724 consider conversions changing the signedness. */
11727 tree_sign_nop_conversion (const_tree exp
)
11729 tree outer_type
, inner_type
;
11731 if (!tree_nop_conversion (exp
))
11734 outer_type
= TREE_TYPE (exp
);
11735 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
11737 return (TYPE_UNSIGNED (outer_type
) == TYPE_UNSIGNED (inner_type
)
11738 && POINTER_TYPE_P (outer_type
) == POINTER_TYPE_P (inner_type
));
11741 /* Strip conversions from EXP according to tree_nop_conversion and
11742 return the resulting expression. */
11745 tree_strip_nop_conversions (tree exp
)
11747 while (tree_nop_conversion (exp
))
11748 exp
= TREE_OPERAND (exp
, 0);
11752 /* Strip conversions from EXP according to tree_sign_nop_conversion
11753 and return the resulting expression. */
11756 tree_strip_sign_nop_conversions (tree exp
)
11758 while (tree_sign_nop_conversion (exp
))
11759 exp
= TREE_OPERAND (exp
, 0);
11763 /* Avoid any floating point extensions from EXP. */
11765 strip_float_extensions (tree exp
)
11767 tree sub
, expt
, subt
;
11769 /* For floating point constant look up the narrowest type that can hold
11770 it properly and handle it like (type)(narrowest_type)constant.
11771 This way we can optimize for instance a=a*2.0 where "a" is float
11772 but 2.0 is double constant. */
11773 if (TREE_CODE (exp
) == REAL_CST
&& !DECIMAL_FLOAT_TYPE_P (TREE_TYPE (exp
)))
11775 REAL_VALUE_TYPE orig
;
11778 orig
= TREE_REAL_CST (exp
);
11779 if (TYPE_PRECISION (TREE_TYPE (exp
)) > TYPE_PRECISION (float_type_node
)
11780 && exact_real_truncate (TYPE_MODE (float_type_node
), &orig
))
11781 type
= float_type_node
;
11782 else if (TYPE_PRECISION (TREE_TYPE (exp
))
11783 > TYPE_PRECISION (double_type_node
)
11784 && exact_real_truncate (TYPE_MODE (double_type_node
), &orig
))
11785 type
= double_type_node
;
11787 return build_real (type
, real_value_truncate (TYPE_MODE (type
), orig
));
11790 if (!CONVERT_EXPR_P (exp
))
11793 sub
= TREE_OPERAND (exp
, 0);
11794 subt
= TREE_TYPE (sub
);
11795 expt
= TREE_TYPE (exp
);
11797 if (!FLOAT_TYPE_P (subt
))
11800 if (DECIMAL_FLOAT_TYPE_P (expt
) != DECIMAL_FLOAT_TYPE_P (subt
))
11803 if (TYPE_PRECISION (subt
) > TYPE_PRECISION (expt
))
11806 return strip_float_extensions (sub
);
11809 /* Strip out all handled components that produce invariant
11813 strip_invariant_refs (const_tree op
)
11815 while (handled_component_p (op
))
11817 switch (TREE_CODE (op
))
11820 case ARRAY_RANGE_REF
:
11821 if (!is_gimple_constant (TREE_OPERAND (op
, 1))
11822 || TREE_OPERAND (op
, 2) != NULL_TREE
11823 || TREE_OPERAND (op
, 3) != NULL_TREE
)
11827 case COMPONENT_REF
:
11828 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
11834 op
= TREE_OPERAND (op
, 0);
11840 static GTY(()) tree gcc_eh_personality_decl
;
11842 /* Return the GCC personality function decl. */
11845 lhd_gcc_personality (void)
11847 if (!gcc_eh_personality_decl
)
11848 gcc_eh_personality_decl
= build_personality_function ("gcc");
11849 return gcc_eh_personality_decl
;
11852 /* TARGET is a call target of GIMPLE call statement
11853 (obtained by gimple_call_fn). Return true if it is
11854 OBJ_TYPE_REF representing an virtual call of C++ method.
11855 (As opposed to OBJ_TYPE_REF representing objc calls
11856 through a cast where middle-end devirtualization machinery
11860 virtual_method_call_p (tree target
)
11862 if (TREE_CODE (target
) != OBJ_TYPE_REF
)
11864 target
= TREE_TYPE (target
);
11865 gcc_checking_assert (TREE_CODE (target
) == POINTER_TYPE
);
11866 target
= TREE_TYPE (target
);
11867 if (TREE_CODE (target
) == FUNCTION_TYPE
)
11869 gcc_checking_assert (TREE_CODE (target
) == METHOD_TYPE
);
11873 /* REF is OBJ_TYPE_REF, return the class the ref corresponds to. */
11876 obj_type_ref_class (tree ref
)
11878 gcc_checking_assert (TREE_CODE (ref
) == OBJ_TYPE_REF
);
11879 ref
= TREE_TYPE (ref
);
11880 gcc_checking_assert (TREE_CODE (ref
) == POINTER_TYPE
);
11881 ref
= TREE_TYPE (ref
);
11882 /* We look for type THIS points to. ObjC also builds
11883 OBJ_TYPE_REF with non-method calls, Their first parameter
11884 ID however also corresponds to class type. */
11885 gcc_checking_assert (TREE_CODE (ref
) == METHOD_TYPE
11886 || TREE_CODE (ref
) == FUNCTION_TYPE
);
11887 ref
= TREE_VALUE (TYPE_ARG_TYPES (ref
));
11888 gcc_checking_assert (TREE_CODE (ref
) == POINTER_TYPE
);
11889 return TREE_TYPE (ref
);
11892 /* Return true if T is in anonymous namespace. */
11895 type_in_anonymous_namespace_p (const_tree t
)
11897 /* TREE_PUBLIC of TYPE_STUB_DECL may not be properly set for
11898 bulitin types; those have CONTEXT NULL. */
11899 if (!TYPE_CONTEXT (t
))
11901 return (TYPE_STUB_DECL (t
) && !TREE_PUBLIC (TYPE_STUB_DECL (t
)));
11904 /* Try to find a base info of BINFO that would have its field decl at offset
11905 OFFSET within the BINFO type and which is of EXPECTED_TYPE. If it can be
11906 found, return, otherwise return NULL_TREE. */
11909 get_binfo_at_offset (tree binfo
, HOST_WIDE_INT offset
, tree expected_type
)
11911 tree type
= BINFO_TYPE (binfo
);
11915 HOST_WIDE_INT pos
, size
;
11919 if (types_same_for_odr (type
, expected_type
))
11924 for (fld
= TYPE_FIELDS (type
); fld
; fld
= DECL_CHAIN (fld
))
11926 if (TREE_CODE (fld
) != FIELD_DECL
|| !DECL_ARTIFICIAL (fld
))
11929 pos
= int_bit_position (fld
);
11930 size
= tree_to_uhwi (DECL_SIZE (fld
));
11931 if (pos
<= offset
&& (pos
+ size
) > offset
)
11934 if (!fld
|| TREE_CODE (TREE_TYPE (fld
)) != RECORD_TYPE
)
11937 /* Offset 0 indicates the primary base, whose vtable contents are
11938 represented in the binfo for the derived class. */
11939 else if (offset
!= 0)
11941 tree base_binfo
, binfo2
= binfo
;
11943 /* Find BINFO corresponding to FLD. This is bit harder
11944 by a fact that in virtual inheritance we may need to walk down
11945 the non-virtual inheritance chain. */
11948 tree containing_binfo
= NULL
, found_binfo
= NULL
;
11949 for (i
= 0; BINFO_BASE_ITERATE (binfo2
, i
, base_binfo
); i
++)
11950 if (types_same_for_odr (TREE_TYPE (base_binfo
), TREE_TYPE (fld
)))
11952 found_binfo
= base_binfo
;
11956 if ((tree_to_shwi (BINFO_OFFSET (base_binfo
))
11957 - tree_to_shwi (BINFO_OFFSET (binfo
)))
11958 * BITS_PER_UNIT
< pos
11959 /* Rule out types with no virtual methods or we can get confused
11960 here by zero sized bases. */
11961 && TYPE_BINFO (BINFO_TYPE (base_binfo
))
11962 && BINFO_VTABLE (TYPE_BINFO (BINFO_TYPE (base_binfo
)))
11963 && (!containing_binfo
11964 || (tree_to_shwi (BINFO_OFFSET (containing_binfo
))
11965 < tree_to_shwi (BINFO_OFFSET (base_binfo
)))))
11966 containing_binfo
= base_binfo
;
11969 binfo
= found_binfo
;
11972 if (!containing_binfo
)
11974 binfo2
= containing_binfo
;
11978 type
= TREE_TYPE (fld
);
11983 /* Returns true if X is a typedef decl. */
11986 is_typedef_decl (tree x
)
11988 return (x
&& TREE_CODE (x
) == TYPE_DECL
11989 && DECL_ORIGINAL_TYPE (x
) != NULL_TREE
);
11992 /* Returns true iff TYPE is a type variant created for a typedef. */
11995 typedef_variant_p (tree type
)
11997 return is_typedef_decl (TYPE_NAME (type
));
12000 /* Warn about a use of an identifier which was marked deprecated. */
12002 warn_deprecated_use (tree node
, tree attr
)
12006 if (node
== 0 || !warn_deprecated_decl
)
12012 attr
= DECL_ATTRIBUTES (node
);
12013 else if (TYPE_P (node
))
12015 tree decl
= TYPE_STUB_DECL (node
);
12017 attr
= lookup_attribute ("deprecated",
12018 TYPE_ATTRIBUTES (TREE_TYPE (decl
)));
12023 attr
= lookup_attribute ("deprecated", attr
);
12026 msg
= TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr
)));
12034 w
= warning (OPT_Wdeprecated_declarations
,
12035 "%qD is deprecated: %s", node
, msg
);
12037 w
= warning (OPT_Wdeprecated_declarations
,
12038 "%qD is deprecated", node
);
12040 inform (DECL_SOURCE_LOCATION (node
), "declared here");
12042 else if (TYPE_P (node
))
12044 tree what
= NULL_TREE
;
12045 tree decl
= TYPE_STUB_DECL (node
);
12047 if (TYPE_NAME (node
))
12049 if (TREE_CODE (TYPE_NAME (node
)) == IDENTIFIER_NODE
)
12050 what
= TYPE_NAME (node
);
12051 else if (TREE_CODE (TYPE_NAME (node
)) == TYPE_DECL
12052 && DECL_NAME (TYPE_NAME (node
)))
12053 what
= DECL_NAME (TYPE_NAME (node
));
12061 w
= warning (OPT_Wdeprecated_declarations
,
12062 "%qE is deprecated: %s", what
, msg
);
12064 w
= warning (OPT_Wdeprecated_declarations
,
12065 "%qE is deprecated", what
);
12070 w
= warning (OPT_Wdeprecated_declarations
,
12071 "type is deprecated: %s", msg
);
12073 w
= warning (OPT_Wdeprecated_declarations
,
12074 "type is deprecated");
12077 inform (DECL_SOURCE_LOCATION (decl
), "declared here");
12084 warning (OPT_Wdeprecated_declarations
, "%qE is deprecated: %s",
12087 warning (OPT_Wdeprecated_declarations
, "%qE is deprecated", what
);
12092 warning (OPT_Wdeprecated_declarations
, "type is deprecated: %s",
12095 warning (OPT_Wdeprecated_declarations
, "type is deprecated");
12101 /* Return true if REF has a COMPONENT_REF with a bit-field field declaration
12102 somewhere in it. */
12105 contains_bitfld_component_ref_p (const_tree ref
)
12107 while (handled_component_p (ref
))
12109 if (TREE_CODE (ref
) == COMPONENT_REF
12110 && DECL_BIT_FIELD (TREE_OPERAND (ref
, 1)))
12112 ref
= TREE_OPERAND (ref
, 0);
12118 /* Try to determine whether a TRY_CATCH expression can fall through.
12119 This is a subroutine of block_may_fallthru. */
12122 try_catch_may_fallthru (const_tree stmt
)
12124 tree_stmt_iterator i
;
12126 /* If the TRY block can fall through, the whole TRY_CATCH can
12128 if (block_may_fallthru (TREE_OPERAND (stmt
, 0)))
12131 i
= tsi_start (TREE_OPERAND (stmt
, 1));
12132 switch (TREE_CODE (tsi_stmt (i
)))
12135 /* We expect to see a sequence of CATCH_EXPR trees, each with a
12136 catch expression and a body. The whole TRY_CATCH may fall
12137 through iff any of the catch bodies falls through. */
12138 for (; !tsi_end_p (i
); tsi_next (&i
))
12140 if (block_may_fallthru (CATCH_BODY (tsi_stmt (i
))))
12145 case EH_FILTER_EXPR
:
12146 /* The exception filter expression only matters if there is an
12147 exception. If the exception does not match EH_FILTER_TYPES,
12148 we will execute EH_FILTER_FAILURE, and we will fall through
12149 if that falls through. If the exception does match
12150 EH_FILTER_TYPES, the stack unwinder will continue up the
12151 stack, so we will not fall through. We don't know whether we
12152 will throw an exception which matches EH_FILTER_TYPES or not,
12153 so we just ignore EH_FILTER_TYPES and assume that we might
12154 throw an exception which doesn't match. */
12155 return block_may_fallthru (EH_FILTER_FAILURE (tsi_stmt (i
)));
12158 /* This case represents statements to be executed when an
12159 exception occurs. Those statements are implicitly followed
12160 by a RESX statement to resume execution after the exception.
12161 So in this case the TRY_CATCH never falls through. */
12166 /* Try to determine if we can fall out of the bottom of BLOCK. This guess
12167 need not be 100% accurate; simply be conservative and return true if we
12168 don't know. This is used only to avoid stupidly generating extra code.
12169 If we're wrong, we'll just delete the extra code later. */
12172 block_may_fallthru (const_tree block
)
12174 /* This CONST_CAST is okay because expr_last returns its argument
12175 unmodified and we assign it to a const_tree. */
12176 const_tree stmt
= expr_last (CONST_CAST_TREE (block
));
12178 switch (stmt
? TREE_CODE (stmt
) : ERROR_MARK
)
12182 /* Easy cases. If the last statement of the block implies
12183 control transfer, then we can't fall through. */
12187 /* If SWITCH_LABELS is set, this is lowered, and represents a
12188 branch to a selected label and hence can not fall through.
12189 Otherwise SWITCH_BODY is set, and the switch can fall
12191 return SWITCH_LABELS (stmt
) == NULL_TREE
;
12194 if (block_may_fallthru (COND_EXPR_THEN (stmt
)))
12196 return block_may_fallthru (COND_EXPR_ELSE (stmt
));
12199 return block_may_fallthru (BIND_EXPR_BODY (stmt
));
12201 case TRY_CATCH_EXPR
:
12202 return try_catch_may_fallthru (stmt
);
12204 case TRY_FINALLY_EXPR
:
12205 /* The finally clause is always executed after the try clause,
12206 so if it does not fall through, then the try-finally will not
12207 fall through. Otherwise, if the try clause does not fall
12208 through, then when the finally clause falls through it will
12209 resume execution wherever the try clause was going. So the
12210 whole try-finally will only fall through if both the try
12211 clause and the finally clause fall through. */
12212 return (block_may_fallthru (TREE_OPERAND (stmt
, 0))
12213 && block_may_fallthru (TREE_OPERAND (stmt
, 1)));
12216 if (TREE_CODE (TREE_OPERAND (stmt
, 1)) == CALL_EXPR
)
12217 stmt
= TREE_OPERAND (stmt
, 1);
12223 /* Functions that do not return do not fall through. */
12224 return (call_expr_flags (stmt
) & ECF_NORETURN
) == 0;
12226 case CLEANUP_POINT_EXPR
:
12227 return block_may_fallthru (TREE_OPERAND (stmt
, 0));
12230 return block_may_fallthru (TREE_OPERAND (stmt
, 1));
12236 return lang_hooks
.block_may_fallthru (stmt
);
12240 /* True if we are using EH to handle cleanups. */
12241 static bool using_eh_for_cleanups_flag
= false;
12243 /* This routine is called from front ends to indicate eh should be used for
12246 using_eh_for_cleanups (void)
12248 using_eh_for_cleanups_flag
= true;
12251 /* Query whether EH is used for cleanups. */
12253 using_eh_for_cleanups_p (void)
12255 return using_eh_for_cleanups_flag
;
12258 /* Wrapper for tree_code_name to ensure that tree code is valid */
12260 get_tree_code_name (enum tree_code code
)
12262 const char *invalid
= "<invalid tree code>";
12264 if (code
>= MAX_TREE_CODES
)
12267 return tree_code_name
[code
];
12270 /* Drops the TREE_OVERFLOW flag from T. */
12273 drop_tree_overflow (tree t
)
12275 gcc_checking_assert (TREE_OVERFLOW (t
));
12277 /* For tree codes with a sharing machinery re-build the result. */
12278 if (TREE_CODE (t
) == INTEGER_CST
)
12279 return wide_int_to_tree (TREE_TYPE (t
), t
);
12281 /* Otherwise, as all tcc_constants are possibly shared, copy the node
12282 and drop the flag. */
12284 TREE_OVERFLOW (t
) = 0;
12288 /* Given a memory reference expression T, return its base address.
12289 The base address of a memory reference expression is the main
12290 object being referenced. For instance, the base address for
12291 'array[i].fld[j]' is 'array'. You can think of this as stripping
12292 away the offset part from a memory address.
12294 This function calls handled_component_p to strip away all the inner
12295 parts of the memory reference until it reaches the base object. */
12298 get_base_address (tree t
)
12300 while (handled_component_p (t
))
12301 t
= TREE_OPERAND (t
, 0);
12303 if ((TREE_CODE (t
) == MEM_REF
12304 || TREE_CODE (t
) == TARGET_MEM_REF
)
12305 && TREE_CODE (TREE_OPERAND (t
, 0)) == ADDR_EXPR
)
12306 t
= TREE_OPERAND (TREE_OPERAND (t
, 0), 0);
12308 /* ??? Either the alias oracle or all callers need to properly deal
12309 with WITH_SIZE_EXPRs before we can look through those. */
12310 if (TREE_CODE (t
) == WITH_SIZE_EXPR
)
12316 /* Return the machine mode of T. For vectors, returns the mode of the
12317 inner type. The main use case is to feed the result to HONOR_NANS,
12318 avoiding the BLKmode that a direct TYPE_MODE (T) might return. */
12321 element_mode (const_tree t
)
12325 if (VECTOR_TYPE_P (t
) || TREE_CODE (t
) == COMPLEX_TYPE
)
12327 return TYPE_MODE (t
);
12330 #include "gt-tree.h"