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
;
208 static GTY ((if_marked ("ggc_marked_p"), param_is (union tree_node
)))
209 htab_t int_cst_hash_table
;
211 /* Hash table for optimization flags and target option flags. Use the same
212 hash table for both sets of options. Nodes for building the current
213 optimization and target option nodes. The assumption is most of the time
214 the options created will already be in the hash table, so we avoid
215 allocating and freeing up a node repeatably. */
216 static GTY (()) tree cl_optimization_node
;
217 static GTY (()) tree cl_target_option_node
;
218 static GTY ((if_marked ("ggc_marked_p"), param_is (union tree_node
)))
219 htab_t cl_option_hash_table
;
221 /* General tree->tree mapping structure for use in hash tables. */
224 static GTY ((if_marked ("tree_decl_map_marked_p"), param_is (struct tree_decl_map
)))
225 htab_t debug_expr_for_decl
;
227 static GTY ((if_marked ("tree_decl_map_marked_p"), param_is (struct tree_decl_map
)))
228 htab_t value_expr_for_decl
;
230 static GTY ((if_marked ("tree_vec_map_marked_p"), param_is (struct tree_vec_map
)))
231 htab_t debug_args_for_decl
;
233 static void set_type_quals (tree
, int);
234 static int type_hash_eq (const void *, const void *);
235 static hashval_t
type_hash_hash (const void *);
236 static hashval_t
int_cst_hash_hash (const void *);
237 static int int_cst_hash_eq (const void *, const void *);
238 static hashval_t
cl_option_hash_hash (const void *);
239 static int cl_option_hash_eq (const void *, const void *);
240 static void print_type_hash_statistics (void);
241 static void print_debug_expr_statistics (void);
242 static void print_value_expr_statistics (void);
243 static int type_hash_marked_p (const void *);
244 static void type_hash_list (const_tree
, inchash::hash
&);
245 static void attribute_hash_list (const_tree
, inchash::hash
&);
247 tree global_trees
[TI_MAX
];
248 tree integer_types
[itk_none
];
250 bool int_n_enabled_p
[NUM_INT_N_ENTS
];
251 struct int_n_trees_t int_n_trees
[NUM_INT_N_ENTS
];
253 unsigned char tree_contains_struct
[MAX_TREE_CODES
][64];
255 /* Number of operands for each OpenMP clause. */
256 unsigned const char omp_clause_num_ops
[] =
258 0, /* OMP_CLAUSE_ERROR */
259 1, /* OMP_CLAUSE_PRIVATE */
260 1, /* OMP_CLAUSE_SHARED */
261 1, /* OMP_CLAUSE_FIRSTPRIVATE */
262 2, /* OMP_CLAUSE_LASTPRIVATE */
263 4, /* OMP_CLAUSE_REDUCTION */
264 1, /* OMP_CLAUSE_COPYIN */
265 1, /* OMP_CLAUSE_COPYPRIVATE */
266 3, /* OMP_CLAUSE_LINEAR */
267 2, /* OMP_CLAUSE_ALIGNED */
268 1, /* OMP_CLAUSE_DEPEND */
269 1, /* OMP_CLAUSE_UNIFORM */
270 2, /* OMP_CLAUSE_FROM */
271 2, /* OMP_CLAUSE_TO */
272 2, /* OMP_CLAUSE_MAP */
273 1, /* OMP_CLAUSE__LOOPTEMP_ */
274 1, /* OMP_CLAUSE_IF */
275 1, /* OMP_CLAUSE_NUM_THREADS */
276 1, /* OMP_CLAUSE_SCHEDULE */
277 0, /* OMP_CLAUSE_NOWAIT */
278 0, /* OMP_CLAUSE_ORDERED */
279 0, /* OMP_CLAUSE_DEFAULT */
280 3, /* OMP_CLAUSE_COLLAPSE */
281 0, /* OMP_CLAUSE_UNTIED */
282 1, /* OMP_CLAUSE_FINAL */
283 0, /* OMP_CLAUSE_MERGEABLE */
284 1, /* OMP_CLAUSE_DEVICE */
285 1, /* OMP_CLAUSE_DIST_SCHEDULE */
286 0, /* OMP_CLAUSE_INBRANCH */
287 0, /* OMP_CLAUSE_NOTINBRANCH */
288 1, /* OMP_CLAUSE_NUM_TEAMS */
289 1, /* OMP_CLAUSE_THREAD_LIMIT */
290 0, /* OMP_CLAUSE_PROC_BIND */
291 1, /* OMP_CLAUSE_SAFELEN */
292 1, /* OMP_CLAUSE_SIMDLEN */
293 0, /* OMP_CLAUSE_FOR */
294 0, /* OMP_CLAUSE_PARALLEL */
295 0, /* OMP_CLAUSE_SECTIONS */
296 0, /* OMP_CLAUSE_TASKGROUP */
297 1, /* OMP_CLAUSE__SIMDUID_ */
298 1, /* OMP_CLAUSE__CILK_FOR_COUNT_ */
301 const char * const omp_clause_code_name
[] =
347 /* Return the tree node structure used by tree code CODE. */
349 static inline enum tree_node_structure_enum
350 tree_node_structure_for_code (enum tree_code code
)
352 switch (TREE_CODE_CLASS (code
))
354 case tcc_declaration
:
359 return TS_FIELD_DECL
;
365 return TS_LABEL_DECL
;
367 return TS_RESULT_DECL
;
368 case DEBUG_EXPR_DECL
:
371 return TS_CONST_DECL
;
375 return TS_FUNCTION_DECL
;
376 case TRANSLATION_UNIT_DECL
:
377 return TS_TRANSLATION_UNIT_DECL
;
379 return TS_DECL_NON_COMMON
;
383 return TS_TYPE_NON_COMMON
;
392 default: /* tcc_constant and tcc_exceptional */
397 /* tcc_constant cases. */
398 case VOID_CST
: return TS_TYPED
;
399 case INTEGER_CST
: return TS_INT_CST
;
400 case REAL_CST
: return TS_REAL_CST
;
401 case FIXED_CST
: return TS_FIXED_CST
;
402 case COMPLEX_CST
: return TS_COMPLEX
;
403 case VECTOR_CST
: return TS_VECTOR
;
404 case STRING_CST
: return TS_STRING
;
405 /* tcc_exceptional cases. */
406 case ERROR_MARK
: return TS_COMMON
;
407 case IDENTIFIER_NODE
: return TS_IDENTIFIER
;
408 case TREE_LIST
: return TS_LIST
;
409 case TREE_VEC
: return TS_VEC
;
410 case SSA_NAME
: return TS_SSA_NAME
;
411 case PLACEHOLDER_EXPR
: return TS_COMMON
;
412 case STATEMENT_LIST
: return TS_STATEMENT_LIST
;
413 case BLOCK
: return TS_BLOCK
;
414 case CONSTRUCTOR
: return TS_CONSTRUCTOR
;
415 case TREE_BINFO
: return TS_BINFO
;
416 case OMP_CLAUSE
: return TS_OMP_CLAUSE
;
417 case OPTIMIZATION_NODE
: return TS_OPTIMIZATION
;
418 case TARGET_OPTION_NODE
: return TS_TARGET_OPTION
;
426 /* Initialize tree_contains_struct to describe the hierarchy of tree
430 initialize_tree_contains_struct (void)
434 for (i
= ERROR_MARK
; i
< LAST_AND_UNUSED_TREE_CODE
; i
++)
437 enum tree_node_structure_enum ts_code
;
439 code
= (enum tree_code
) i
;
440 ts_code
= tree_node_structure_for_code (code
);
442 /* Mark the TS structure itself. */
443 tree_contains_struct
[code
][ts_code
] = 1;
445 /* Mark all the structures that TS is derived from. */
463 case TS_STATEMENT_LIST
:
464 MARK_TS_TYPED (code
);
468 case TS_DECL_MINIMAL
:
474 case TS_OPTIMIZATION
:
475 case TS_TARGET_OPTION
:
476 MARK_TS_COMMON (code
);
479 case TS_TYPE_WITH_LANG_SPECIFIC
:
480 MARK_TS_TYPE_COMMON (code
);
483 case TS_TYPE_NON_COMMON
:
484 MARK_TS_TYPE_WITH_LANG_SPECIFIC (code
);
488 MARK_TS_DECL_MINIMAL (code
);
493 MARK_TS_DECL_COMMON (code
);
496 case TS_DECL_NON_COMMON
:
497 MARK_TS_DECL_WITH_VIS (code
);
500 case TS_DECL_WITH_VIS
:
504 MARK_TS_DECL_WRTL (code
);
508 MARK_TS_DECL_COMMON (code
);
512 MARK_TS_DECL_WITH_VIS (code
);
516 case TS_FUNCTION_DECL
:
517 MARK_TS_DECL_NON_COMMON (code
);
520 case TS_TRANSLATION_UNIT_DECL
:
521 MARK_TS_DECL_COMMON (code
);
529 /* Basic consistency checks for attributes used in fold. */
530 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_NON_COMMON
]);
531 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_NON_COMMON
]);
532 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_DECL_COMMON
]);
533 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_COMMON
]);
534 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_COMMON
]);
535 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_COMMON
]);
536 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_COMMON
]);
537 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_COMMON
]);
538 gcc_assert (tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_COMMON
]);
539 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_COMMON
]);
540 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_DECL_COMMON
]);
541 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_WRTL
]);
542 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_WRTL
]);
543 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_WRTL
]);
544 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WRTL
]);
545 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_WRTL
]);
546 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_DECL_MINIMAL
]);
547 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_MINIMAL
]);
548 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_MINIMAL
]);
549 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_MINIMAL
]);
550 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_MINIMAL
]);
551 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_MINIMAL
]);
552 gcc_assert (tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_MINIMAL
]);
553 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_MINIMAL
]);
554 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_DECL_MINIMAL
]);
555 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_WITH_VIS
]);
556 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WITH_VIS
]);
557 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_WITH_VIS
]);
558 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_VAR_DECL
]);
559 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_FIELD_DECL
]);
560 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_PARM_DECL
]);
561 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_LABEL_DECL
]);
562 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_RESULT_DECL
]);
563 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_CONST_DECL
]);
564 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_TYPE_DECL
]);
565 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_FUNCTION_DECL
]);
566 gcc_assert (tree_contains_struct
[IMPORTED_DECL
][TS_DECL_MINIMAL
]);
567 gcc_assert (tree_contains_struct
[IMPORTED_DECL
][TS_DECL_COMMON
]);
568 gcc_assert (tree_contains_struct
[NAMELIST_DECL
][TS_DECL_MINIMAL
]);
569 gcc_assert (tree_contains_struct
[NAMELIST_DECL
][TS_DECL_COMMON
]);
578 /* Initialize the hash table of types. */
579 type_hash_table
= htab_create_ggc (TYPE_HASH_INITIAL_SIZE
, type_hash_hash
,
582 debug_expr_for_decl
= htab_create_ggc (512, tree_decl_map_hash
,
583 tree_decl_map_eq
, 0);
585 value_expr_for_decl
= htab_create_ggc (512, tree_decl_map_hash
,
586 tree_decl_map_eq
, 0);
588 int_cst_hash_table
= htab_create_ggc (1024, int_cst_hash_hash
,
589 int_cst_hash_eq
, NULL
);
591 int_cst_node
= make_int_cst (1, 1);
593 cl_option_hash_table
= htab_create_ggc (64, cl_option_hash_hash
,
594 cl_option_hash_eq
, NULL
);
596 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
597 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
599 /* Initialize the tree_contains_struct array. */
600 initialize_tree_contains_struct ();
601 lang_hooks
.init_ts ();
605 /* The name of the object as the assembler will see it (but before any
606 translations made by ASM_OUTPUT_LABELREF). Often this is the same
607 as DECL_NAME. It is an IDENTIFIER_NODE. */
609 decl_assembler_name (tree decl
)
611 if (!DECL_ASSEMBLER_NAME_SET_P (decl
))
612 lang_hooks
.set_decl_assembler_name (decl
);
613 return DECL_WITH_VIS_CHECK (decl
)->decl_with_vis
.assembler_name
;
616 /* When the target supports COMDAT groups, this indicates which group the
617 DECL is associated with. This can be either an IDENTIFIER_NODE or a
618 decl, in which case its DECL_ASSEMBLER_NAME identifies the group. */
620 decl_comdat_group (const_tree node
)
622 struct symtab_node
*snode
= symtab_node::get (node
);
625 return snode
->get_comdat_group ();
628 /* Likewise, but make sure it's been reduced to an IDENTIFIER_NODE. */
630 decl_comdat_group_id (const_tree node
)
632 struct symtab_node
*snode
= symtab_node::get (node
);
635 return snode
->get_comdat_group_id ();
638 /* When the target supports named section, return its name as IDENTIFIER_NODE
639 or NULL if it is in no section. */
641 decl_section_name (const_tree node
)
643 struct symtab_node
*snode
= symtab_node::get (node
);
646 return snode
->get_section ();
649 /* Set section section name of NODE to VALUE (that is expected to
650 be identifier node) */
652 set_decl_section_name (tree node
, const char *value
)
654 struct symtab_node
*snode
;
658 snode
= symtab_node::get (node
);
662 else if (TREE_CODE (node
) == VAR_DECL
)
663 snode
= varpool_node::get_create (node
);
665 snode
= cgraph_node::get_create (node
);
666 snode
->set_section (value
);
669 /* Return TLS model of a variable NODE. */
671 decl_tls_model (const_tree node
)
673 struct varpool_node
*snode
= varpool_node::get (node
);
675 return TLS_MODEL_NONE
;
676 return snode
->tls_model
;
679 /* Set TLS model of variable NODE to MODEL. */
681 set_decl_tls_model (tree node
, enum tls_model model
)
683 struct varpool_node
*vnode
;
685 if (model
== TLS_MODEL_NONE
)
687 vnode
= varpool_node::get (node
);
692 vnode
= varpool_node::get_create (node
);
693 vnode
->tls_model
= model
;
696 /* Compute the number of bytes occupied by a tree with code CODE.
697 This function cannot be used for nodes that have variable sizes,
698 including TREE_VEC, INTEGER_CST, STRING_CST, and CALL_EXPR. */
700 tree_code_size (enum tree_code code
)
702 switch (TREE_CODE_CLASS (code
))
704 case tcc_declaration
: /* A decl node */
709 return sizeof (struct tree_field_decl
);
711 return sizeof (struct tree_parm_decl
);
713 return sizeof (struct tree_var_decl
);
715 return sizeof (struct tree_label_decl
);
717 return sizeof (struct tree_result_decl
);
719 return sizeof (struct tree_const_decl
);
721 return sizeof (struct tree_type_decl
);
723 return sizeof (struct tree_function_decl
);
724 case DEBUG_EXPR_DECL
:
725 return sizeof (struct tree_decl_with_rtl
);
726 case TRANSLATION_UNIT_DECL
:
727 return sizeof (struct tree_translation_unit_decl
);
731 return sizeof (struct tree_decl_non_common
);
733 return lang_hooks
.tree_size (code
);
737 case tcc_type
: /* a type node */
738 return sizeof (struct tree_type_non_common
);
740 case tcc_reference
: /* a reference */
741 case tcc_expression
: /* an expression */
742 case tcc_statement
: /* an expression with side effects */
743 case tcc_comparison
: /* a comparison expression */
744 case tcc_unary
: /* a unary arithmetic expression */
745 case tcc_binary
: /* a binary arithmetic expression */
746 return (sizeof (struct tree_exp
)
747 + (TREE_CODE_LENGTH (code
) - 1) * sizeof (tree
));
749 case tcc_constant
: /* a constant */
752 case VOID_CST
: return sizeof (struct tree_typed
);
753 case INTEGER_CST
: gcc_unreachable ();
754 case REAL_CST
: return sizeof (struct tree_real_cst
);
755 case FIXED_CST
: return sizeof (struct tree_fixed_cst
);
756 case COMPLEX_CST
: return sizeof (struct tree_complex
);
757 case VECTOR_CST
: return sizeof (struct tree_vector
);
758 case STRING_CST
: gcc_unreachable ();
760 return lang_hooks
.tree_size (code
);
763 case tcc_exceptional
: /* something random, like an identifier. */
766 case IDENTIFIER_NODE
: return lang_hooks
.identifier_size
;
767 case TREE_LIST
: return sizeof (struct tree_list
);
770 case PLACEHOLDER_EXPR
: return sizeof (struct tree_common
);
773 case OMP_CLAUSE
: gcc_unreachable ();
775 case SSA_NAME
: return sizeof (struct tree_ssa_name
);
777 case STATEMENT_LIST
: return sizeof (struct tree_statement_list
);
778 case BLOCK
: return sizeof (struct tree_block
);
779 case CONSTRUCTOR
: return sizeof (struct tree_constructor
);
780 case OPTIMIZATION_NODE
: return sizeof (struct tree_optimization_option
);
781 case TARGET_OPTION_NODE
: return sizeof (struct tree_target_option
);
784 return lang_hooks
.tree_size (code
);
792 /* Compute the number of bytes occupied by NODE. This routine only
793 looks at TREE_CODE, except for those nodes that have variable sizes. */
795 tree_size (const_tree node
)
797 const enum tree_code code
= TREE_CODE (node
);
801 return (sizeof (struct tree_int_cst
)
802 + (TREE_INT_CST_EXT_NUNITS (node
) - 1) * sizeof (HOST_WIDE_INT
));
805 return (offsetof (struct tree_binfo
, base_binfos
)
807 ::embedded_size (BINFO_N_BASE_BINFOS (node
)));
810 return (sizeof (struct tree_vec
)
811 + (TREE_VEC_LENGTH (node
) - 1) * sizeof (tree
));
814 return (sizeof (struct tree_vector
)
815 + (TYPE_VECTOR_SUBPARTS (TREE_TYPE (node
)) - 1) * sizeof (tree
));
818 return TREE_STRING_LENGTH (node
) + offsetof (struct tree_string
, str
) + 1;
821 return (sizeof (struct tree_omp_clause
)
822 + (omp_clause_num_ops
[OMP_CLAUSE_CODE (node
)] - 1)
826 if (TREE_CODE_CLASS (code
) == tcc_vl_exp
)
827 return (sizeof (struct tree_exp
)
828 + (VL_EXP_OPERAND_LENGTH (node
) - 1) * sizeof (tree
));
830 return tree_code_size (code
);
834 /* Record interesting allocation statistics for a tree node with CODE
838 record_node_allocation_statistics (enum tree_code code ATTRIBUTE_UNUSED
,
839 size_t length ATTRIBUTE_UNUSED
)
841 enum tree_code_class type
= TREE_CODE_CLASS (code
);
844 if (!GATHER_STATISTICS
)
849 case tcc_declaration
: /* A decl node */
853 case tcc_type
: /* a type node */
857 case tcc_statement
: /* an expression with side effects */
861 case tcc_reference
: /* a reference */
865 case tcc_expression
: /* an expression */
866 case tcc_comparison
: /* a comparison expression */
867 case tcc_unary
: /* a unary arithmetic expression */
868 case tcc_binary
: /* a binary arithmetic expression */
872 case tcc_constant
: /* a constant */
876 case tcc_exceptional
: /* something random, like an identifier. */
879 case IDENTIFIER_NODE
:
892 kind
= ssa_name_kind
;
904 kind
= omp_clause_kind
;
921 tree_code_counts
[(int) code
]++;
922 tree_node_counts
[(int) kind
]++;
923 tree_node_sizes
[(int) kind
] += length
;
926 /* Allocate and return a new UID from the DECL_UID namespace. */
929 allocate_decl_uid (void)
931 return next_decl_uid
++;
934 /* Return a newly allocated node of code CODE. For decl and type
935 nodes, some other fields are initialized. The rest of the node is
936 initialized to zero. This function cannot be used for TREE_VEC,
937 INTEGER_CST or OMP_CLAUSE nodes, which is enforced by asserts in
940 Achoo! I got a code in the node. */
943 make_node_stat (enum tree_code code MEM_STAT_DECL
)
946 enum tree_code_class type
= TREE_CODE_CLASS (code
);
947 size_t length
= tree_code_size (code
);
949 record_node_allocation_statistics (code
, length
);
951 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
952 TREE_SET_CODE (t
, code
);
957 TREE_SIDE_EFFECTS (t
) = 1;
960 case tcc_declaration
:
961 if (CODE_CONTAINS_STRUCT (code
, TS_DECL_COMMON
))
963 if (code
== FUNCTION_DECL
)
965 DECL_ALIGN (t
) = FUNCTION_BOUNDARY
;
966 DECL_MODE (t
) = FUNCTION_MODE
;
971 DECL_SOURCE_LOCATION (t
) = input_location
;
972 if (TREE_CODE (t
) == DEBUG_EXPR_DECL
)
973 DECL_UID (t
) = --next_debug_decl_uid
;
976 DECL_UID (t
) = allocate_decl_uid ();
977 SET_DECL_PT_UID (t
, -1);
979 if (TREE_CODE (t
) == LABEL_DECL
)
980 LABEL_DECL_UID (t
) = -1;
985 TYPE_UID (t
) = next_type_uid
++;
986 TYPE_ALIGN (t
) = BITS_PER_UNIT
;
987 TYPE_USER_ALIGN (t
) = 0;
988 TYPE_MAIN_VARIANT (t
) = t
;
989 TYPE_CANONICAL (t
) = t
;
991 /* Default to no attributes for type, but let target change that. */
992 TYPE_ATTRIBUTES (t
) = NULL_TREE
;
993 targetm
.set_default_type_attributes (t
);
995 /* We have not yet computed the alias set for this type. */
996 TYPE_ALIAS_SET (t
) = -1;
1000 TREE_CONSTANT (t
) = 1;
1003 case tcc_expression
:
1009 case PREDECREMENT_EXPR
:
1010 case PREINCREMENT_EXPR
:
1011 case POSTDECREMENT_EXPR
:
1012 case POSTINCREMENT_EXPR
:
1013 /* All of these have side-effects, no matter what their
1015 TREE_SIDE_EFFECTS (t
) = 1;
1024 /* Other classes need no special treatment. */
1031 /* Return a new node with the same contents as NODE except that its
1032 TREE_CHAIN, if it has one, is zero and it has a fresh uid. */
1035 copy_node_stat (tree node MEM_STAT_DECL
)
1038 enum tree_code code
= TREE_CODE (node
);
1041 gcc_assert (code
!= STATEMENT_LIST
);
1043 length
= tree_size (node
);
1044 record_node_allocation_statistics (code
, length
);
1045 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
1046 memcpy (t
, node
, length
);
1048 if (CODE_CONTAINS_STRUCT (code
, TS_COMMON
))
1050 TREE_ASM_WRITTEN (t
) = 0;
1051 TREE_VISITED (t
) = 0;
1053 if (TREE_CODE_CLASS (code
) == tcc_declaration
)
1055 if (code
== DEBUG_EXPR_DECL
)
1056 DECL_UID (t
) = --next_debug_decl_uid
;
1059 DECL_UID (t
) = allocate_decl_uid ();
1060 if (DECL_PT_UID_SET_P (node
))
1061 SET_DECL_PT_UID (t
, DECL_PT_UID (node
));
1063 if ((TREE_CODE (node
) == PARM_DECL
|| TREE_CODE (node
) == VAR_DECL
)
1064 && DECL_HAS_VALUE_EXPR_P (node
))
1066 SET_DECL_VALUE_EXPR (t
, DECL_VALUE_EXPR (node
));
1067 DECL_HAS_VALUE_EXPR_P (t
) = 1;
1069 /* DECL_DEBUG_EXPR is copied explicitely by callers. */
1070 if (TREE_CODE (node
) == VAR_DECL
)
1072 DECL_HAS_DEBUG_EXPR_P (t
) = 0;
1073 t
->decl_with_vis
.symtab_node
= NULL
;
1075 if (TREE_CODE (node
) == VAR_DECL
&& DECL_HAS_INIT_PRIORITY_P (node
))
1077 SET_DECL_INIT_PRIORITY (t
, DECL_INIT_PRIORITY (node
));
1078 DECL_HAS_INIT_PRIORITY_P (t
) = 1;
1080 if (TREE_CODE (node
) == FUNCTION_DECL
)
1082 DECL_STRUCT_FUNCTION (t
) = NULL
;
1083 t
->decl_with_vis
.symtab_node
= NULL
;
1086 else if (TREE_CODE_CLASS (code
) == tcc_type
)
1088 TYPE_UID (t
) = next_type_uid
++;
1089 /* The following is so that the debug code for
1090 the copy is different from the original type.
1091 The two statements usually duplicate each other
1092 (because they clear fields of the same union),
1093 but the optimizer should catch that. */
1094 TYPE_SYMTAB_POINTER (t
) = 0;
1095 TYPE_SYMTAB_ADDRESS (t
) = 0;
1097 /* Do not copy the values cache. */
1098 if (TYPE_CACHED_VALUES_P (t
))
1100 TYPE_CACHED_VALUES_P (t
) = 0;
1101 TYPE_CACHED_VALUES (t
) = NULL_TREE
;
1108 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
1109 For example, this can copy a list made of TREE_LIST nodes. */
1112 copy_list (tree list
)
1120 head
= prev
= copy_node (list
);
1121 next
= TREE_CHAIN (list
);
1124 TREE_CHAIN (prev
) = copy_node (next
);
1125 prev
= TREE_CHAIN (prev
);
1126 next
= TREE_CHAIN (next
);
1132 /* Return the value that TREE_INT_CST_EXT_NUNITS should have for an
1133 INTEGER_CST with value CST and type TYPE. */
1136 get_int_cst_ext_nunits (tree type
, const wide_int
&cst
)
1138 gcc_checking_assert (cst
.get_precision () == TYPE_PRECISION (type
));
1139 /* We need an extra zero HWI if CST is an unsigned integer with its
1140 upper bit set, and if CST occupies a whole number of HWIs. */
1141 if (TYPE_UNSIGNED (type
)
1143 && (cst
.get_precision () % HOST_BITS_PER_WIDE_INT
) == 0)
1144 return cst
.get_precision () / HOST_BITS_PER_WIDE_INT
+ 1;
1145 return cst
.get_len ();
1148 /* Return a new INTEGER_CST with value CST and type TYPE. */
1151 build_new_int_cst (tree type
, const wide_int
&cst
)
1153 unsigned int len
= cst
.get_len ();
1154 unsigned int ext_len
= get_int_cst_ext_nunits (type
, cst
);
1155 tree nt
= make_int_cst (len
, ext_len
);
1160 TREE_INT_CST_ELT (nt
, ext_len
) = 0;
1161 for (unsigned int i
= len
; i
< ext_len
; ++i
)
1162 TREE_INT_CST_ELT (nt
, i
) = -1;
1164 else if (TYPE_UNSIGNED (type
)
1165 && cst
.get_precision () < len
* HOST_BITS_PER_WIDE_INT
)
1168 TREE_INT_CST_ELT (nt
, len
)
1169 = zext_hwi (cst
.elt (len
),
1170 cst
.get_precision () % HOST_BITS_PER_WIDE_INT
);
1173 for (unsigned int i
= 0; i
< len
; i
++)
1174 TREE_INT_CST_ELT (nt
, i
) = cst
.elt (i
);
1175 TREE_TYPE (nt
) = type
;
1179 /* Create an INT_CST node with a LOW value sign extended to TYPE. */
1182 build_int_cst (tree type
, HOST_WIDE_INT low
)
1184 /* Support legacy code. */
1186 type
= integer_type_node
;
1188 return wide_int_to_tree (type
, wi::shwi (low
, TYPE_PRECISION (type
)));
1192 build_int_cstu (tree type
, unsigned HOST_WIDE_INT cst
)
1194 return wide_int_to_tree (type
, wi::uhwi (cst
, TYPE_PRECISION (type
)));
1197 /* Create an INT_CST node with a LOW value sign extended to TYPE. */
1200 build_int_cst_type (tree type
, HOST_WIDE_INT low
)
1203 return wide_int_to_tree (type
, wi::shwi (low
, TYPE_PRECISION (type
)));
1206 /* Constructs tree in type TYPE from with value given by CST. Signedness
1207 of CST is assumed to be the same as the signedness of TYPE. */
1210 double_int_to_tree (tree type
, double_int cst
)
1212 return wide_int_to_tree (type
, widest_int::from (cst
, TYPE_SIGN (type
)));
1215 /* We force the wide_int CST to the range of the type TYPE by sign or
1216 zero extending it. OVERFLOWABLE indicates if we are interested in
1217 overflow of the value, when >0 we are only interested in signed
1218 overflow, for <0 we are interested in any overflow. OVERFLOWED
1219 indicates whether overflow has already occurred. CONST_OVERFLOWED
1220 indicates whether constant overflow has already occurred. We force
1221 T's value to be within range of T's type (by setting to 0 or 1 all
1222 the bits outside the type's range). We set TREE_OVERFLOWED if,
1223 OVERFLOWED is nonzero,
1224 or OVERFLOWABLE is >0 and signed overflow occurs
1225 or OVERFLOWABLE is <0 and any overflow occurs
1226 We return a new tree node for the extended wide_int. The node
1227 is shared if no overflow flags are set. */
1231 force_fit_type (tree type
, const wide_int_ref
&cst
,
1232 int overflowable
, bool overflowed
)
1234 signop sign
= TYPE_SIGN (type
);
1236 /* If we need to set overflow flags, return a new unshared node. */
1237 if (overflowed
|| !wi::fits_to_tree_p (cst
, type
))
1241 || (overflowable
> 0 && sign
== SIGNED
))
1243 wide_int tmp
= wide_int::from (cst
, TYPE_PRECISION (type
), sign
);
1244 tree t
= build_new_int_cst (type
, tmp
);
1245 TREE_OVERFLOW (t
) = 1;
1250 /* Else build a shared node. */
1251 return wide_int_to_tree (type
, cst
);
1254 /* These are the hash table functions for the hash table of INTEGER_CST
1255 nodes of a sizetype. */
1257 /* Return the hash code code X, an INTEGER_CST. */
1260 int_cst_hash_hash (const void *x
)
1262 const_tree
const t
= (const_tree
) x
;
1263 hashval_t code
= htab_hash_pointer (TREE_TYPE (t
));
1266 for (i
= 0; i
< TREE_INT_CST_NUNITS (t
); i
++)
1267 code
^= TREE_INT_CST_ELT (t
, i
);
1272 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
1273 is the same as that given by *Y, which is the same. */
1276 int_cst_hash_eq (const void *x
, const void *y
)
1278 const_tree
const xt
= (const_tree
) x
;
1279 const_tree
const yt
= (const_tree
) y
;
1281 if (TREE_TYPE (xt
) != TREE_TYPE (yt
)
1282 || TREE_INT_CST_NUNITS (xt
) != TREE_INT_CST_NUNITS (yt
)
1283 || TREE_INT_CST_EXT_NUNITS (xt
) != TREE_INT_CST_EXT_NUNITS (yt
))
1286 for (int i
= 0; i
< TREE_INT_CST_NUNITS (xt
); i
++)
1287 if (TREE_INT_CST_ELT (xt
, i
) != TREE_INT_CST_ELT (yt
, i
))
1293 /* Create an INT_CST node of TYPE and value CST.
1294 The returned node is always shared. For small integers we use a
1295 per-type vector cache, for larger ones we use a single hash table.
1296 The value is extended from its precision according to the sign of
1297 the type to be a multiple of HOST_BITS_PER_WIDE_INT. This defines
1298 the upper bits and ensures that hashing and value equality based
1299 upon the underlying HOST_WIDE_INTs works without masking. */
1302 wide_int_to_tree (tree type
, const wide_int_ref
&pcst
)
1309 unsigned int prec
= TYPE_PRECISION (type
);
1310 signop sgn
= TYPE_SIGN (type
);
1312 /* Verify that everything is canonical. */
1313 int l
= pcst
.get_len ();
1316 if (pcst
.elt (l
- 1) == 0)
1317 gcc_checking_assert (pcst
.elt (l
- 2) < 0);
1318 if (pcst
.elt (l
- 1) == (HOST_WIDE_INT
) -1)
1319 gcc_checking_assert (pcst
.elt (l
- 2) >= 0);
1322 wide_int cst
= wide_int::from (pcst
, prec
, sgn
);
1323 unsigned int ext_len
= get_int_cst_ext_nunits (type
, cst
);
1327 /* We just need to store a single HOST_WIDE_INT. */
1329 if (TYPE_UNSIGNED (type
))
1330 hwi
= cst
.to_uhwi ();
1332 hwi
= cst
.to_shwi ();
1334 switch (TREE_CODE (type
))
1337 gcc_assert (hwi
== 0);
1341 case REFERENCE_TYPE
:
1342 case POINTER_BOUNDS_TYPE
:
1343 /* Cache NULL pointer and zero bounds. */
1352 /* Cache false or true. */
1360 if (TYPE_SIGN (type
) == UNSIGNED
)
1363 limit
= INTEGER_SHARE_LIMIT
;
1364 if (IN_RANGE (hwi
, 0, INTEGER_SHARE_LIMIT
- 1))
1369 /* Cache [-1, N). */
1370 limit
= INTEGER_SHARE_LIMIT
+ 1;
1371 if (IN_RANGE (hwi
, -1, INTEGER_SHARE_LIMIT
- 1))
1385 /* Look for it in the type's vector of small shared ints. */
1386 if (!TYPE_CACHED_VALUES_P (type
))
1388 TYPE_CACHED_VALUES_P (type
) = 1;
1389 TYPE_CACHED_VALUES (type
) = make_tree_vec (limit
);
1392 t
= TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
);
1394 /* Make sure no one is clobbering the shared constant. */
1395 gcc_checking_assert (TREE_TYPE (t
) == type
1396 && TREE_INT_CST_NUNITS (t
) == 1
1397 && TREE_INT_CST_OFFSET_NUNITS (t
) == 1
1398 && TREE_INT_CST_EXT_NUNITS (t
) == 1
1399 && TREE_INT_CST_ELT (t
, 0) == hwi
);
1402 /* Create a new shared int. */
1403 t
= build_new_int_cst (type
, cst
);
1404 TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) = t
;
1409 /* Use the cache of larger shared ints, using int_cst_node as
1413 TREE_INT_CST_ELT (int_cst_node
, 0) = hwi
;
1414 TREE_TYPE (int_cst_node
) = type
;
1416 slot
= htab_find_slot (int_cst_hash_table
, int_cst_node
, INSERT
);
1420 /* Insert this one into the hash table. */
1423 /* Make a new node for next time round. */
1424 int_cst_node
= make_int_cst (1, 1);
1430 /* The value either hashes properly or we drop it on the floor
1431 for the gc to take care of. There will not be enough of them
1435 tree nt
= build_new_int_cst (type
, cst
);
1436 slot
= htab_find_slot (int_cst_hash_table
, nt
, INSERT
);
1440 /* Insert this one into the hash table. */
1450 cache_integer_cst (tree t
)
1452 tree type
= TREE_TYPE (t
);
1455 int prec
= TYPE_PRECISION (type
);
1457 gcc_assert (!TREE_OVERFLOW (t
));
1459 switch (TREE_CODE (type
))
1462 gcc_assert (integer_zerop (t
));
1466 case REFERENCE_TYPE
:
1467 /* Cache NULL pointer. */
1468 if (integer_zerop (t
))
1476 /* Cache false or true. */
1478 if (wi::ltu_p (t
, 2))
1479 ix
= TREE_INT_CST_ELT (t
, 0);
1484 if (TYPE_UNSIGNED (type
))
1487 limit
= INTEGER_SHARE_LIMIT
;
1489 /* This is a little hokie, but if the prec is smaller than
1490 what is necessary to hold INTEGER_SHARE_LIMIT, then the
1491 obvious test will not get the correct answer. */
1492 if (prec
< HOST_BITS_PER_WIDE_INT
)
1494 if (tree_to_uhwi (t
) < (unsigned HOST_WIDE_INT
) INTEGER_SHARE_LIMIT
)
1495 ix
= tree_to_uhwi (t
);
1497 else if (wi::ltu_p (t
, INTEGER_SHARE_LIMIT
))
1498 ix
= tree_to_uhwi (t
);
1503 limit
= INTEGER_SHARE_LIMIT
+ 1;
1505 if (integer_minus_onep (t
))
1507 else if (!wi::neg_p (t
))
1509 if (prec
< HOST_BITS_PER_WIDE_INT
)
1511 if (tree_to_shwi (t
) < INTEGER_SHARE_LIMIT
)
1512 ix
= tree_to_shwi (t
) + 1;
1514 else if (wi::ltu_p (t
, INTEGER_SHARE_LIMIT
))
1515 ix
= tree_to_shwi (t
) + 1;
1529 /* Look for it in the type's vector of small shared ints. */
1530 if (!TYPE_CACHED_VALUES_P (type
))
1532 TYPE_CACHED_VALUES_P (type
) = 1;
1533 TYPE_CACHED_VALUES (type
) = make_tree_vec (limit
);
1536 gcc_assert (TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) == NULL_TREE
);
1537 TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) = t
;
1541 /* Use the cache of larger shared ints. */
1544 slot
= htab_find_slot (int_cst_hash_table
, t
, INSERT
);
1545 /* If there is already an entry for the number verify it's the
1548 gcc_assert (wi::eq_p (tree (*slot
), t
));
1550 /* Otherwise insert this one into the hash table. */
1556 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
1557 and the rest are zeros. */
1560 build_low_bits_mask (tree type
, unsigned bits
)
1562 gcc_assert (bits
<= TYPE_PRECISION (type
));
1564 return wide_int_to_tree (type
, wi::mask (bits
, false,
1565 TYPE_PRECISION (type
)));
1568 /* Checks that X is integer constant that can be expressed in (unsigned)
1569 HOST_WIDE_INT without loss of precision. */
1572 cst_and_fits_in_hwi (const_tree x
)
1574 if (TREE_CODE (x
) != INTEGER_CST
)
1577 if (TYPE_PRECISION (TREE_TYPE (x
)) > HOST_BITS_PER_WIDE_INT
)
1580 return TREE_INT_CST_NUNITS (x
) == 1;
1583 /* Build a newly constructed TREE_VEC node of length LEN. */
1586 make_vector_stat (unsigned len MEM_STAT_DECL
)
1589 unsigned length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vector
);
1591 record_node_allocation_statistics (VECTOR_CST
, length
);
1593 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
1595 TREE_SET_CODE (t
, VECTOR_CST
);
1596 TREE_CONSTANT (t
) = 1;
1601 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1602 are in a list pointed to by VALS. */
1605 build_vector_stat (tree type
, tree
*vals MEM_STAT_DECL
)
1609 tree v
= make_vector (TYPE_VECTOR_SUBPARTS (type
));
1610 TREE_TYPE (v
) = type
;
1612 /* Iterate through elements and check for overflow. */
1613 for (cnt
= 0; cnt
< TYPE_VECTOR_SUBPARTS (type
); ++cnt
)
1615 tree value
= vals
[cnt
];
1617 VECTOR_CST_ELT (v
, cnt
) = value
;
1619 /* Don't crash if we get an address constant. */
1620 if (!CONSTANT_CLASS_P (value
))
1623 over
|= TREE_OVERFLOW (value
);
1626 TREE_OVERFLOW (v
) = over
;
1630 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1631 are extracted from V, a vector of CONSTRUCTOR_ELT. */
1634 build_vector_from_ctor (tree type
, vec
<constructor_elt
, va_gc
> *v
)
1636 tree
*vec
= XALLOCAVEC (tree
, TYPE_VECTOR_SUBPARTS (type
));
1637 unsigned HOST_WIDE_INT idx
;
1640 FOR_EACH_CONSTRUCTOR_VALUE (v
, idx
, value
)
1642 for (; idx
< TYPE_VECTOR_SUBPARTS (type
); ++idx
)
1643 vec
[idx
] = build_zero_cst (TREE_TYPE (type
));
1645 return build_vector (type
, vec
);
1648 /* Build a vector of type VECTYPE where all the elements are SCs. */
1650 build_vector_from_val (tree vectype
, tree sc
)
1652 int i
, nunits
= TYPE_VECTOR_SUBPARTS (vectype
);
1654 if (sc
== error_mark_node
)
1657 /* Verify that the vector type is suitable for SC. Note that there
1658 is some inconsistency in the type-system with respect to restrict
1659 qualifications of pointers. Vector types always have a main-variant
1660 element type and the qualification is applied to the vector-type.
1661 So TREE_TYPE (vector-type) does not return a properly qualified
1662 vector element-type. */
1663 gcc_checking_assert (types_compatible_p (TYPE_MAIN_VARIANT (TREE_TYPE (sc
)),
1664 TREE_TYPE (vectype
)));
1666 if (CONSTANT_CLASS_P (sc
))
1668 tree
*v
= XALLOCAVEC (tree
, nunits
);
1669 for (i
= 0; i
< nunits
; ++i
)
1671 return build_vector (vectype
, v
);
1675 vec
<constructor_elt
, va_gc
> *v
;
1676 vec_alloc (v
, nunits
);
1677 for (i
= 0; i
< nunits
; ++i
)
1678 CONSTRUCTOR_APPEND_ELT (v
, NULL_TREE
, sc
);
1679 return build_constructor (vectype
, v
);
1683 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1684 are in the vec pointed to by VALS. */
1686 build_constructor (tree type
, vec
<constructor_elt
, va_gc
> *vals
)
1688 tree c
= make_node (CONSTRUCTOR
);
1690 constructor_elt
*elt
;
1691 bool constant_p
= true;
1692 bool side_effects_p
= false;
1694 TREE_TYPE (c
) = type
;
1695 CONSTRUCTOR_ELTS (c
) = vals
;
1697 FOR_EACH_VEC_SAFE_ELT (vals
, i
, elt
)
1699 /* Mostly ctors will have elts that don't have side-effects, so
1700 the usual case is to scan all the elements. Hence a single
1701 loop for both const and side effects, rather than one loop
1702 each (with early outs). */
1703 if (!TREE_CONSTANT (elt
->value
))
1705 if (TREE_SIDE_EFFECTS (elt
->value
))
1706 side_effects_p
= true;
1709 TREE_SIDE_EFFECTS (c
) = side_effects_p
;
1710 TREE_CONSTANT (c
) = constant_p
;
1715 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
1718 build_constructor_single (tree type
, tree index
, tree value
)
1720 vec
<constructor_elt
, va_gc
> *v
;
1721 constructor_elt elt
= {index
, value
};
1724 v
->quick_push (elt
);
1726 return build_constructor (type
, v
);
1730 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1731 are in a list pointed to by VALS. */
1733 build_constructor_from_list (tree type
, tree vals
)
1736 vec
<constructor_elt
, va_gc
> *v
= NULL
;
1740 vec_alloc (v
, list_length (vals
));
1741 for (t
= vals
; t
; t
= TREE_CHAIN (t
))
1742 CONSTRUCTOR_APPEND_ELT (v
, TREE_PURPOSE (t
), TREE_VALUE (t
));
1745 return build_constructor (type
, v
);
1748 /* Return a new CONSTRUCTOR node whose type is TYPE. NELTS is the number
1749 of elements, provided as index/value pairs. */
1752 build_constructor_va (tree type
, int nelts
, ...)
1754 vec
<constructor_elt
, va_gc
> *v
= NULL
;
1757 va_start (p
, nelts
);
1758 vec_alloc (v
, nelts
);
1761 tree index
= va_arg (p
, tree
);
1762 tree value
= va_arg (p
, tree
);
1763 CONSTRUCTOR_APPEND_ELT (v
, index
, value
);
1766 return build_constructor (type
, v
);
1769 /* Return a new FIXED_CST node whose type is TYPE and value is F. */
1772 build_fixed (tree type
, FIXED_VALUE_TYPE f
)
1775 FIXED_VALUE_TYPE
*fp
;
1777 v
= make_node (FIXED_CST
);
1778 fp
= ggc_alloc
<fixed_value
> ();
1779 memcpy (fp
, &f
, sizeof (FIXED_VALUE_TYPE
));
1781 TREE_TYPE (v
) = type
;
1782 TREE_FIXED_CST_PTR (v
) = fp
;
1786 /* Return a new REAL_CST node whose type is TYPE and value is D. */
1789 build_real (tree type
, REAL_VALUE_TYPE d
)
1792 REAL_VALUE_TYPE
*dp
;
1795 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
1796 Consider doing it via real_convert now. */
1798 v
= make_node (REAL_CST
);
1799 dp
= ggc_alloc
<real_value
> ();
1800 memcpy (dp
, &d
, sizeof (REAL_VALUE_TYPE
));
1802 TREE_TYPE (v
) = type
;
1803 TREE_REAL_CST_PTR (v
) = dp
;
1804 TREE_OVERFLOW (v
) = overflow
;
1808 /* Return a new REAL_CST node whose type is TYPE
1809 and whose value is the integer value of the INTEGER_CST node I. */
1812 real_value_from_int_cst (const_tree type
, const_tree i
)
1816 /* Clear all bits of the real value type so that we can later do
1817 bitwise comparisons to see if two values are the same. */
1818 memset (&d
, 0, sizeof d
);
1820 real_from_integer (&d
, type
? TYPE_MODE (type
) : VOIDmode
, i
,
1821 TYPE_SIGN (TREE_TYPE (i
)));
1825 /* Given a tree representing an integer constant I, return a tree
1826 representing the same value as a floating-point constant of type TYPE. */
1829 build_real_from_int_cst (tree type
, const_tree i
)
1832 int overflow
= TREE_OVERFLOW (i
);
1834 v
= build_real (type
, real_value_from_int_cst (type
, i
));
1836 TREE_OVERFLOW (v
) |= overflow
;
1840 /* Return a newly constructed STRING_CST node whose value is
1841 the LEN characters at STR.
1842 Note that for a C string literal, LEN should include the trailing NUL.
1843 The TREE_TYPE is not initialized. */
1846 build_string (int len
, const char *str
)
1851 /* Do not waste bytes provided by padding of struct tree_string. */
1852 length
= len
+ offsetof (struct tree_string
, str
) + 1;
1854 record_node_allocation_statistics (STRING_CST
, length
);
1856 s
= (tree
) ggc_internal_alloc (length
);
1858 memset (s
, 0, sizeof (struct tree_typed
));
1859 TREE_SET_CODE (s
, STRING_CST
);
1860 TREE_CONSTANT (s
) = 1;
1861 TREE_STRING_LENGTH (s
) = len
;
1862 memcpy (s
->string
.str
, str
, len
);
1863 s
->string
.str
[len
] = '\0';
1868 /* Return a newly constructed COMPLEX_CST node whose value is
1869 specified by the real and imaginary parts REAL and IMAG.
1870 Both REAL and IMAG should be constant nodes. TYPE, if specified,
1871 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
1874 build_complex (tree type
, tree real
, tree imag
)
1876 tree t
= make_node (COMPLEX_CST
);
1878 TREE_REALPART (t
) = real
;
1879 TREE_IMAGPART (t
) = imag
;
1880 TREE_TYPE (t
) = type
? type
: build_complex_type (TREE_TYPE (real
));
1881 TREE_OVERFLOW (t
) = TREE_OVERFLOW (real
) | TREE_OVERFLOW (imag
);
1885 /* Return a constant of arithmetic type TYPE which is the
1886 multiplicative identity of the set TYPE. */
1889 build_one_cst (tree type
)
1891 switch (TREE_CODE (type
))
1893 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
1894 case POINTER_TYPE
: case REFERENCE_TYPE
:
1896 return build_int_cst (type
, 1);
1899 return build_real (type
, dconst1
);
1901 case FIXED_POINT_TYPE
:
1902 /* We can only generate 1 for accum types. */
1903 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type
)));
1904 return build_fixed (type
, FCONST1 (TYPE_MODE (type
)));
1908 tree scalar
= build_one_cst (TREE_TYPE (type
));
1910 return build_vector_from_val (type
, scalar
);
1914 return build_complex (type
,
1915 build_one_cst (TREE_TYPE (type
)),
1916 build_zero_cst (TREE_TYPE (type
)));
1923 /* Return an integer of type TYPE containing all 1's in as much precision as
1924 it contains, or a complex or vector whose subparts are such integers. */
1927 build_all_ones_cst (tree type
)
1929 if (TREE_CODE (type
) == COMPLEX_TYPE
)
1931 tree scalar
= build_all_ones_cst (TREE_TYPE (type
));
1932 return build_complex (type
, scalar
, scalar
);
1935 return build_minus_one_cst (type
);
1938 /* Return a constant of arithmetic type TYPE which is the
1939 opposite of the multiplicative identity of the set TYPE. */
1942 build_minus_one_cst (tree type
)
1944 switch (TREE_CODE (type
))
1946 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
1947 case POINTER_TYPE
: case REFERENCE_TYPE
:
1949 return build_int_cst (type
, -1);
1952 return build_real (type
, dconstm1
);
1954 case FIXED_POINT_TYPE
:
1955 /* We can only generate 1 for accum types. */
1956 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type
)));
1957 return build_fixed (type
, fixed_from_double_int (double_int_minus_one
,
1962 tree scalar
= build_minus_one_cst (TREE_TYPE (type
));
1964 return build_vector_from_val (type
, scalar
);
1968 return build_complex (type
,
1969 build_minus_one_cst (TREE_TYPE (type
)),
1970 build_zero_cst (TREE_TYPE (type
)));
1977 /* Build 0 constant of type TYPE. This is used by constructor folding
1978 and thus the constant should be represented in memory by
1982 build_zero_cst (tree type
)
1984 switch (TREE_CODE (type
))
1986 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
1987 case POINTER_TYPE
: case REFERENCE_TYPE
:
1988 case OFFSET_TYPE
: case NULLPTR_TYPE
:
1989 return build_int_cst (type
, 0);
1992 return build_real (type
, dconst0
);
1994 case FIXED_POINT_TYPE
:
1995 return build_fixed (type
, FCONST0 (TYPE_MODE (type
)));
1999 tree scalar
= build_zero_cst (TREE_TYPE (type
));
2001 return build_vector_from_val (type
, scalar
);
2006 tree zero
= build_zero_cst (TREE_TYPE (type
));
2008 return build_complex (type
, zero
, zero
);
2012 if (!AGGREGATE_TYPE_P (type
))
2013 return fold_convert (type
, integer_zero_node
);
2014 return build_constructor (type
, NULL
);
2019 /* Build a BINFO with LEN language slots. */
2022 make_tree_binfo_stat (unsigned base_binfos MEM_STAT_DECL
)
2025 size_t length
= (offsetof (struct tree_binfo
, base_binfos
)
2026 + vec
<tree
, va_gc
>::embedded_size (base_binfos
));
2028 record_node_allocation_statistics (TREE_BINFO
, length
);
2030 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
2032 memset (t
, 0, offsetof (struct tree_binfo
, base_binfos
));
2034 TREE_SET_CODE (t
, TREE_BINFO
);
2036 BINFO_BASE_BINFOS (t
)->embedded_init (base_binfos
);
2041 /* Create a CASE_LABEL_EXPR tree node and return it. */
2044 build_case_label (tree low_value
, tree high_value
, tree label_decl
)
2046 tree t
= make_node (CASE_LABEL_EXPR
);
2048 TREE_TYPE (t
) = void_type_node
;
2049 SET_EXPR_LOCATION (t
, DECL_SOURCE_LOCATION (label_decl
));
2051 CASE_LOW (t
) = low_value
;
2052 CASE_HIGH (t
) = high_value
;
2053 CASE_LABEL (t
) = label_decl
;
2054 CASE_CHAIN (t
) = NULL_TREE
;
2059 /* Build a newly constructed INTEGER_CST node. LEN and EXT_LEN are the
2060 values of TREE_INT_CST_NUNITS and TREE_INT_CST_EXT_NUNITS respectively.
2061 The latter determines the length of the HOST_WIDE_INT vector. */
2064 make_int_cst_stat (int len
, int ext_len MEM_STAT_DECL
)
2067 int length
= ((ext_len
- 1) * sizeof (HOST_WIDE_INT
)
2068 + sizeof (struct tree_int_cst
));
2071 record_node_allocation_statistics (INTEGER_CST
, length
);
2073 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
2075 TREE_SET_CODE (t
, INTEGER_CST
);
2076 TREE_INT_CST_NUNITS (t
) = len
;
2077 TREE_INT_CST_EXT_NUNITS (t
) = ext_len
;
2078 /* to_offset can only be applied to trees that are offset_int-sized
2079 or smaller. EXT_LEN is correct if it fits, otherwise the constant
2080 must be exactly the precision of offset_int and so LEN is correct. */
2081 if (ext_len
<= OFFSET_INT_ELTS
)
2082 TREE_INT_CST_OFFSET_NUNITS (t
) = ext_len
;
2084 TREE_INT_CST_OFFSET_NUNITS (t
) = len
;
2086 TREE_CONSTANT (t
) = 1;
2091 /* Build a newly constructed TREE_VEC node of length LEN. */
2094 make_tree_vec_stat (int len MEM_STAT_DECL
)
2097 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
2099 record_node_allocation_statistics (TREE_VEC
, length
);
2101 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
2103 TREE_SET_CODE (t
, TREE_VEC
);
2104 TREE_VEC_LENGTH (t
) = len
;
2109 /* Grow a TREE_VEC node to new length LEN. */
2112 grow_tree_vec_stat (tree v
, int len MEM_STAT_DECL
)
2114 gcc_assert (TREE_CODE (v
) == TREE_VEC
);
2116 int oldlen
= TREE_VEC_LENGTH (v
);
2117 gcc_assert (len
> oldlen
);
2119 int oldlength
= (oldlen
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
2120 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
2122 record_node_allocation_statistics (TREE_VEC
, length
- oldlength
);
2124 v
= (tree
) ggc_realloc (v
, length PASS_MEM_STAT
);
2126 TREE_VEC_LENGTH (v
) = len
;
2131 /* Return 1 if EXPR is the integer constant zero or a complex constant
2135 integer_zerop (const_tree expr
)
2139 switch (TREE_CODE (expr
))
2142 return wi::eq_p (expr
, 0);
2144 return (integer_zerop (TREE_REALPART (expr
))
2145 && integer_zerop (TREE_IMAGPART (expr
)));
2149 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2150 if (!integer_zerop (VECTOR_CST_ELT (expr
, i
)))
2159 /* Return 1 if EXPR is the integer constant one or the corresponding
2160 complex constant. */
2163 integer_onep (const_tree expr
)
2167 switch (TREE_CODE (expr
))
2170 return wi::eq_p (wi::to_widest (expr
), 1);
2172 return (integer_onep (TREE_REALPART (expr
))
2173 && integer_zerop (TREE_IMAGPART (expr
)));
2177 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2178 if (!integer_onep (VECTOR_CST_ELT (expr
, i
)))
2187 /* Return 1 if EXPR is the integer constant one. For complex and vector,
2188 return 1 if every piece is the integer constant one. */
2191 integer_each_onep (const_tree expr
)
2195 if (TREE_CODE (expr
) == COMPLEX_CST
)
2196 return (integer_onep (TREE_REALPART (expr
))
2197 && integer_onep (TREE_IMAGPART (expr
)));
2199 return integer_onep (expr
);
2202 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
2203 it contains, or a complex or vector whose subparts are such integers. */
2206 integer_all_onesp (const_tree expr
)
2210 if (TREE_CODE (expr
) == COMPLEX_CST
2211 && integer_all_onesp (TREE_REALPART (expr
))
2212 && integer_all_onesp (TREE_IMAGPART (expr
)))
2215 else if (TREE_CODE (expr
) == VECTOR_CST
)
2218 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2219 if (!integer_all_onesp (VECTOR_CST_ELT (expr
, i
)))
2224 else if (TREE_CODE (expr
) != INTEGER_CST
)
2227 return wi::max_value (TYPE_PRECISION (TREE_TYPE (expr
)), UNSIGNED
) == expr
;
2230 /* Return 1 if EXPR is the integer constant minus one. */
2233 integer_minus_onep (const_tree expr
)
2237 if (TREE_CODE (expr
) == COMPLEX_CST
)
2238 return (integer_all_onesp (TREE_REALPART (expr
))
2239 && integer_zerop (TREE_IMAGPART (expr
)));
2241 return integer_all_onesp (expr
);
2244 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
2248 integer_pow2p (const_tree expr
)
2252 if (TREE_CODE (expr
) == COMPLEX_CST
2253 && integer_pow2p (TREE_REALPART (expr
))
2254 && integer_zerop (TREE_IMAGPART (expr
)))
2257 if (TREE_CODE (expr
) != INTEGER_CST
)
2260 return wi::popcount (expr
) == 1;
2263 /* Return 1 if EXPR is an integer constant other than zero or a
2264 complex constant other than zero. */
2267 integer_nonzerop (const_tree expr
)
2271 return ((TREE_CODE (expr
) == INTEGER_CST
2272 && !wi::eq_p (expr
, 0))
2273 || (TREE_CODE (expr
) == COMPLEX_CST
2274 && (integer_nonzerop (TREE_REALPART (expr
))
2275 || integer_nonzerop (TREE_IMAGPART (expr
)))));
2278 /* Return 1 if EXPR is the fixed-point constant zero. */
2281 fixed_zerop (const_tree expr
)
2283 return (TREE_CODE (expr
) == FIXED_CST
2284 && TREE_FIXED_CST (expr
).data
.is_zero ());
2287 /* Return the power of two represented by a tree node known to be a
2291 tree_log2 (const_tree expr
)
2295 if (TREE_CODE (expr
) == COMPLEX_CST
)
2296 return tree_log2 (TREE_REALPART (expr
));
2298 return wi::exact_log2 (expr
);
2301 /* Similar, but return the largest integer Y such that 2 ** Y is less
2302 than or equal to EXPR. */
2305 tree_floor_log2 (const_tree expr
)
2309 if (TREE_CODE (expr
) == COMPLEX_CST
)
2310 return tree_log2 (TREE_REALPART (expr
));
2312 return wi::floor_log2 (expr
);
2315 /* Return number of known trailing zero bits in EXPR, or, if the value of
2316 EXPR is known to be zero, the precision of it's type. */
2319 tree_ctz (const_tree expr
)
2321 if (!INTEGRAL_TYPE_P (TREE_TYPE (expr
))
2322 && !POINTER_TYPE_P (TREE_TYPE (expr
)))
2325 unsigned int ret1
, ret2
, prec
= TYPE_PRECISION (TREE_TYPE (expr
));
2326 switch (TREE_CODE (expr
))
2329 ret1
= wi::ctz (expr
);
2330 return MIN (ret1
, prec
);
2332 ret1
= wi::ctz (get_nonzero_bits (expr
));
2333 return MIN (ret1
, prec
);
2340 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2343 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2344 return MIN (ret1
, ret2
);
2345 case POINTER_PLUS_EXPR
:
2346 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2347 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2348 /* Second operand is sizetype, which could be in theory
2349 wider than pointer's precision. Make sure we never
2350 return more than prec. */
2351 ret2
= MIN (ret2
, prec
);
2352 return MIN (ret1
, ret2
);
2354 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2355 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2356 return MAX (ret1
, ret2
);
2358 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2359 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2360 return MIN (ret1
+ ret2
, prec
);
2362 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2363 if (tree_fits_uhwi_p (TREE_OPERAND (expr
, 1))
2364 && (tree_to_uhwi (TREE_OPERAND (expr
, 1)) < prec
))
2366 ret2
= tree_to_uhwi (TREE_OPERAND (expr
, 1));
2367 return MIN (ret1
+ ret2
, prec
);
2371 if (tree_fits_uhwi_p (TREE_OPERAND (expr
, 1))
2372 && (tree_to_uhwi (TREE_OPERAND (expr
, 1)) < prec
))
2374 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2375 ret2
= tree_to_uhwi (TREE_OPERAND (expr
, 1));
2380 case TRUNC_DIV_EXPR
:
2382 case FLOOR_DIV_EXPR
:
2383 case ROUND_DIV_EXPR
:
2384 case EXACT_DIV_EXPR
:
2385 if (TREE_CODE (TREE_OPERAND (expr
, 1)) == INTEGER_CST
2386 && tree_int_cst_sgn (TREE_OPERAND (expr
, 1)) == 1)
2388 int l
= tree_log2 (TREE_OPERAND (expr
, 1));
2391 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2399 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2400 if (ret1
&& ret1
== TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (expr
, 0))))
2402 return MIN (ret1
, prec
);
2404 return tree_ctz (TREE_OPERAND (expr
, 0));
2406 ret1
= tree_ctz (TREE_OPERAND (expr
, 1));
2409 ret2
= tree_ctz (TREE_OPERAND (expr
, 2));
2410 return MIN (ret1
, ret2
);
2412 return tree_ctz (TREE_OPERAND (expr
, 1));
2414 ret1
= get_pointer_alignment (CONST_CAST_TREE (expr
));
2415 if (ret1
> BITS_PER_UNIT
)
2417 ret1
= ctz_hwi (ret1
/ BITS_PER_UNIT
);
2418 return MIN (ret1
, prec
);
2426 /* Return 1 if EXPR is the real constant zero. Trailing zeroes matter for
2427 decimal float constants, so don't return 1 for them. */
2430 real_zerop (const_tree expr
)
2434 switch (TREE_CODE (expr
))
2437 return REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst0
)
2438 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2440 return real_zerop (TREE_REALPART (expr
))
2441 && real_zerop (TREE_IMAGPART (expr
));
2445 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2446 if (!real_zerop (VECTOR_CST_ELT (expr
, i
)))
2455 /* Return 1 if EXPR is the real constant one in real or complex form.
2456 Trailing zeroes matter for decimal float constants, so don't return
2460 real_onep (const_tree expr
)
2464 switch (TREE_CODE (expr
))
2467 return REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst1
)
2468 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2470 return real_onep (TREE_REALPART (expr
))
2471 && real_zerop (TREE_IMAGPART (expr
));
2475 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2476 if (!real_onep (VECTOR_CST_ELT (expr
, i
)))
2485 /* Return 1 if EXPR is the real constant minus one. Trailing zeroes
2486 matter for decimal float constants, so don't return 1 for them. */
2489 real_minus_onep (const_tree expr
)
2493 switch (TREE_CODE (expr
))
2496 return REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconstm1
)
2497 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2499 return real_minus_onep (TREE_REALPART (expr
))
2500 && real_zerop (TREE_IMAGPART (expr
));
2504 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2505 if (!real_minus_onep (VECTOR_CST_ELT (expr
, i
)))
2514 /* Nonzero if EXP is a constant or a cast of a constant. */
2517 really_constant_p (const_tree exp
)
2519 /* This is not quite the same as STRIP_NOPS. It does more. */
2520 while (CONVERT_EXPR_P (exp
)
2521 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
2522 exp
= TREE_OPERAND (exp
, 0);
2523 return TREE_CONSTANT (exp
);
2526 /* Return first list element whose TREE_VALUE is ELEM.
2527 Return 0 if ELEM is not in LIST. */
2530 value_member (tree elem
, tree list
)
2534 if (elem
== TREE_VALUE (list
))
2536 list
= TREE_CHAIN (list
);
2541 /* Return first list element whose TREE_PURPOSE is ELEM.
2542 Return 0 if ELEM is not in LIST. */
2545 purpose_member (const_tree elem
, tree list
)
2549 if (elem
== TREE_PURPOSE (list
))
2551 list
= TREE_CHAIN (list
);
2556 /* Return true if ELEM is in V. */
2559 vec_member (const_tree elem
, vec
<tree
, va_gc
> *v
)
2563 FOR_EACH_VEC_SAFE_ELT (v
, ix
, t
)
2569 /* Returns element number IDX (zero-origin) of chain CHAIN, or
2573 chain_index (int idx
, tree chain
)
2575 for (; chain
&& idx
> 0; --idx
)
2576 chain
= TREE_CHAIN (chain
);
2580 /* Return nonzero if ELEM is part of the chain CHAIN. */
2583 chain_member (const_tree elem
, const_tree chain
)
2589 chain
= DECL_CHAIN (chain
);
2595 /* Return the length of a chain of nodes chained through TREE_CHAIN.
2596 We expect a null pointer to mark the end of the chain.
2597 This is the Lisp primitive `length'. */
2600 list_length (const_tree t
)
2603 #ifdef ENABLE_TREE_CHECKING
2611 #ifdef ENABLE_TREE_CHECKING
2614 gcc_assert (p
!= q
);
2622 /* Returns the first FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
2623 UNION_TYPE TYPE, or NULL_TREE if none. */
2626 first_field (const_tree type
)
2628 tree t
= TYPE_FIELDS (type
);
2629 while (t
&& TREE_CODE (t
) != FIELD_DECL
)
2634 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
2635 by modifying the last node in chain 1 to point to chain 2.
2636 This is the Lisp primitive `nconc'. */
2639 chainon (tree op1
, tree op2
)
2648 for (t1
= op1
; TREE_CHAIN (t1
); t1
= TREE_CHAIN (t1
))
2650 TREE_CHAIN (t1
) = op2
;
2652 #ifdef ENABLE_TREE_CHECKING
2655 for (t2
= op2
; t2
; t2
= TREE_CHAIN (t2
))
2656 gcc_assert (t2
!= t1
);
2663 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
2666 tree_last (tree chain
)
2670 while ((next
= TREE_CHAIN (chain
)))
2675 /* Reverse the order of elements in the chain T,
2676 and return the new head of the chain (old last element). */
2681 tree prev
= 0, decl
, next
;
2682 for (decl
= t
; decl
; decl
= next
)
2684 /* We shouldn't be using this function to reverse BLOCK chains; we
2685 have blocks_nreverse for that. */
2686 gcc_checking_assert (TREE_CODE (decl
) != BLOCK
);
2687 next
= TREE_CHAIN (decl
);
2688 TREE_CHAIN (decl
) = prev
;
2694 /* Return a newly created TREE_LIST node whose
2695 purpose and value fields are PARM and VALUE. */
2698 build_tree_list_stat (tree parm
, tree value MEM_STAT_DECL
)
2700 tree t
= make_node_stat (TREE_LIST PASS_MEM_STAT
);
2701 TREE_PURPOSE (t
) = parm
;
2702 TREE_VALUE (t
) = value
;
2706 /* Build a chain of TREE_LIST nodes from a vector. */
2709 build_tree_list_vec_stat (const vec
<tree
, va_gc
> *vec MEM_STAT_DECL
)
2711 tree ret
= NULL_TREE
;
2715 FOR_EACH_VEC_SAFE_ELT (vec
, i
, t
)
2717 *pp
= build_tree_list_stat (NULL
, t PASS_MEM_STAT
);
2718 pp
= &TREE_CHAIN (*pp
);
2723 /* Return a newly created TREE_LIST node whose
2724 purpose and value fields are PURPOSE and VALUE
2725 and whose TREE_CHAIN is CHAIN. */
2728 tree_cons_stat (tree purpose
, tree value
, tree chain MEM_STAT_DECL
)
2732 node
= ggc_alloc_tree_node_stat (sizeof (struct tree_list
) PASS_MEM_STAT
);
2733 memset (node
, 0, sizeof (struct tree_common
));
2735 record_node_allocation_statistics (TREE_LIST
, sizeof (struct tree_list
));
2737 TREE_SET_CODE (node
, TREE_LIST
);
2738 TREE_CHAIN (node
) = chain
;
2739 TREE_PURPOSE (node
) = purpose
;
2740 TREE_VALUE (node
) = value
;
2744 /* Return the values of the elements of a CONSTRUCTOR as a vector of
2748 ctor_to_vec (tree ctor
)
2750 vec
<tree
, va_gc
> *vec
;
2751 vec_alloc (vec
, CONSTRUCTOR_NELTS (ctor
));
2755 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), ix
, val
)
2756 vec
->quick_push (val
);
2761 /* Return the size nominally occupied by an object of type TYPE
2762 when it resides in memory. The value is measured in units of bytes,
2763 and its data type is that normally used for type sizes
2764 (which is the first type created by make_signed_type or
2765 make_unsigned_type). */
2768 size_in_bytes (const_tree type
)
2772 if (type
== error_mark_node
)
2773 return integer_zero_node
;
2775 type
= TYPE_MAIN_VARIANT (type
);
2776 t
= TYPE_SIZE_UNIT (type
);
2780 lang_hooks
.types
.incomplete_type_error (NULL_TREE
, type
);
2781 return size_zero_node
;
2787 /* Return the size of TYPE (in bytes) as a wide integer
2788 or return -1 if the size can vary or is larger than an integer. */
2791 int_size_in_bytes (const_tree type
)
2795 if (type
== error_mark_node
)
2798 type
= TYPE_MAIN_VARIANT (type
);
2799 t
= TYPE_SIZE_UNIT (type
);
2801 if (t
&& tree_fits_uhwi_p (t
))
2802 return TREE_INT_CST_LOW (t
);
2807 /* Return the maximum size of TYPE (in bytes) as a wide integer
2808 or return -1 if the size can vary or is larger than an integer. */
2811 max_int_size_in_bytes (const_tree type
)
2813 HOST_WIDE_INT size
= -1;
2816 /* If this is an array type, check for a possible MAX_SIZE attached. */
2818 if (TREE_CODE (type
) == ARRAY_TYPE
)
2820 size_tree
= TYPE_ARRAY_MAX_SIZE (type
);
2822 if (size_tree
&& tree_fits_uhwi_p (size_tree
))
2823 size
= tree_to_uhwi (size_tree
);
2826 /* If we still haven't been able to get a size, see if the language
2827 can compute a maximum size. */
2831 size_tree
= lang_hooks
.types
.max_size (type
);
2833 if (size_tree
&& tree_fits_uhwi_p (size_tree
))
2834 size
= tree_to_uhwi (size_tree
);
2840 /* Return the bit position of FIELD, in bits from the start of the record.
2841 This is a tree of type bitsizetype. */
2844 bit_position (const_tree field
)
2846 return bit_from_pos (DECL_FIELD_OFFSET (field
),
2847 DECL_FIELD_BIT_OFFSET (field
));
2850 /* Return the byte position of FIELD, in bytes from the start of the record.
2851 This is a tree of type sizetype. */
2854 byte_position (const_tree field
)
2856 return byte_from_pos (DECL_FIELD_OFFSET (field
),
2857 DECL_FIELD_BIT_OFFSET (field
));
2860 /* Likewise, but return as an integer. It must be representable in
2861 that way (since it could be a signed value, we don't have the
2862 option of returning -1 like int_size_in_byte can. */
2865 int_byte_position (const_tree field
)
2867 return tree_to_shwi (byte_position (field
));
2870 /* Return the strictest alignment, in bits, that T is known to have. */
2873 expr_align (const_tree t
)
2875 unsigned int align0
, align1
;
2877 switch (TREE_CODE (t
))
2879 CASE_CONVERT
: case NON_LVALUE_EXPR
:
2880 /* If we have conversions, we know that the alignment of the
2881 object must meet each of the alignments of the types. */
2882 align0
= expr_align (TREE_OPERAND (t
, 0));
2883 align1
= TYPE_ALIGN (TREE_TYPE (t
));
2884 return MAX (align0
, align1
);
2886 case SAVE_EXPR
: case COMPOUND_EXPR
: case MODIFY_EXPR
:
2887 case INIT_EXPR
: case TARGET_EXPR
: case WITH_CLEANUP_EXPR
:
2888 case CLEANUP_POINT_EXPR
:
2889 /* These don't change the alignment of an object. */
2890 return expr_align (TREE_OPERAND (t
, 0));
2893 /* The best we can do is say that the alignment is the least aligned
2895 align0
= expr_align (TREE_OPERAND (t
, 1));
2896 align1
= expr_align (TREE_OPERAND (t
, 2));
2897 return MIN (align0
, align1
);
2899 /* FIXME: LABEL_DECL and CONST_DECL never have DECL_ALIGN set
2900 meaningfully, it's always 1. */
2901 case LABEL_DECL
: case CONST_DECL
:
2902 case VAR_DECL
: case PARM_DECL
: case RESULT_DECL
:
2904 gcc_assert (DECL_ALIGN (t
) != 0);
2905 return DECL_ALIGN (t
);
2911 /* Otherwise take the alignment from that of the type. */
2912 return TYPE_ALIGN (TREE_TYPE (t
));
2915 /* Return, as a tree node, the number of elements for TYPE (which is an
2916 ARRAY_TYPE) minus one. This counts only elements of the top array. */
2919 array_type_nelts (const_tree type
)
2921 tree index_type
, min
, max
;
2923 /* If they did it with unspecified bounds, then we should have already
2924 given an error about it before we got here. */
2925 if (! TYPE_DOMAIN (type
))
2926 return error_mark_node
;
2928 index_type
= TYPE_DOMAIN (type
);
2929 min
= TYPE_MIN_VALUE (index_type
);
2930 max
= TYPE_MAX_VALUE (index_type
);
2932 /* TYPE_MAX_VALUE may not be set if the array has unknown length. */
2934 return error_mark_node
;
2936 return (integer_zerop (min
)
2938 : fold_build2 (MINUS_EXPR
, TREE_TYPE (max
), max
, min
));
2941 /* If arg is static -- a reference to an object in static storage -- then
2942 return the object. This is not the same as the C meaning of `static'.
2943 If arg isn't static, return NULL. */
2948 switch (TREE_CODE (arg
))
2951 /* Nested functions are static, even though taking their address will
2952 involve a trampoline as we unnest the nested function and create
2953 the trampoline on the tree level. */
2957 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
2958 && ! DECL_THREAD_LOCAL_P (arg
)
2959 && ! DECL_DLLIMPORT_P (arg
)
2963 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
2967 return TREE_STATIC (arg
) ? arg
: NULL
;
2974 /* If the thing being referenced is not a field, then it is
2975 something language specific. */
2976 gcc_assert (TREE_CODE (TREE_OPERAND (arg
, 1)) == FIELD_DECL
);
2978 /* If we are referencing a bitfield, we can't evaluate an
2979 ADDR_EXPR at compile time and so it isn't a constant. */
2980 if (DECL_BIT_FIELD (TREE_OPERAND (arg
, 1)))
2983 return staticp (TREE_OPERAND (arg
, 0));
2989 return TREE_CONSTANT (TREE_OPERAND (arg
, 0)) ? arg
: NULL
;
2992 case ARRAY_RANGE_REF
:
2993 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg
))) == INTEGER_CST
2994 && TREE_CODE (TREE_OPERAND (arg
, 1)) == INTEGER_CST
)
2995 return staticp (TREE_OPERAND (arg
, 0));
2999 case COMPOUND_LITERAL_EXPR
:
3000 return TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (arg
)) ? arg
: NULL
;
3010 /* Return whether OP is a DECL whose address is function-invariant. */
3013 decl_address_invariant_p (const_tree op
)
3015 /* The conditions below are slightly less strict than the one in
3018 switch (TREE_CODE (op
))
3027 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
3028 || DECL_THREAD_LOCAL_P (op
)
3029 || DECL_CONTEXT (op
) == current_function_decl
3030 || decl_function_context (op
) == current_function_decl
)
3035 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
3036 || decl_function_context (op
) == current_function_decl
)
3047 /* Return whether OP is a DECL whose address is interprocedural-invariant. */
3050 decl_address_ip_invariant_p (const_tree op
)
3052 /* The conditions below are slightly less strict than the one in
3055 switch (TREE_CODE (op
))
3063 if (((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
3064 && !DECL_DLLIMPORT_P (op
))
3065 || DECL_THREAD_LOCAL_P (op
))
3070 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
)))
3082 /* Return true if T is function-invariant (internal function, does
3083 not handle arithmetic; that's handled in skip_simple_arithmetic and
3084 tree_invariant_p). */
3086 static bool tree_invariant_p (tree t
);
3089 tree_invariant_p_1 (tree t
)
3093 if (TREE_CONSTANT (t
)
3094 || (TREE_READONLY (t
) && !TREE_SIDE_EFFECTS (t
)))
3097 switch (TREE_CODE (t
))
3103 op
= TREE_OPERAND (t
, 0);
3104 while (handled_component_p (op
))
3106 switch (TREE_CODE (op
))
3109 case ARRAY_RANGE_REF
:
3110 if (!tree_invariant_p (TREE_OPERAND (op
, 1))
3111 || TREE_OPERAND (op
, 2) != NULL_TREE
3112 || TREE_OPERAND (op
, 3) != NULL_TREE
)
3117 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
3123 op
= TREE_OPERAND (op
, 0);
3126 return CONSTANT_CLASS_P (op
) || decl_address_invariant_p (op
);
3135 /* Return true if T is function-invariant. */
3138 tree_invariant_p (tree t
)
3140 tree inner
= skip_simple_arithmetic (t
);
3141 return tree_invariant_p_1 (inner
);
3144 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
3145 Do this to any expression which may be used in more than one place,
3146 but must be evaluated only once.
3148 Normally, expand_expr would reevaluate the expression each time.
3149 Calling save_expr produces something that is evaluated and recorded
3150 the first time expand_expr is called on it. Subsequent calls to
3151 expand_expr just reuse the recorded value.
3153 The call to expand_expr that generates code that actually computes
3154 the value is the first call *at compile time*. Subsequent calls
3155 *at compile time* generate code to use the saved value.
3156 This produces correct result provided that *at run time* control
3157 always flows through the insns made by the first expand_expr
3158 before reaching the other places where the save_expr was evaluated.
3159 You, the caller of save_expr, must make sure this is so.
3161 Constants, and certain read-only nodes, are returned with no
3162 SAVE_EXPR because that is safe. Expressions containing placeholders
3163 are not touched; see tree.def for an explanation of what these
3167 save_expr (tree expr
)
3169 tree t
= fold (expr
);
3172 /* If the tree evaluates to a constant, then we don't want to hide that
3173 fact (i.e. this allows further folding, and direct checks for constants).
3174 However, a read-only object that has side effects cannot be bypassed.
3175 Since it is no problem to reevaluate literals, we just return the
3177 inner
= skip_simple_arithmetic (t
);
3178 if (TREE_CODE (inner
) == ERROR_MARK
)
3181 if (tree_invariant_p_1 (inner
))
3184 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
3185 it means that the size or offset of some field of an object depends on
3186 the value within another field.
3188 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
3189 and some variable since it would then need to be both evaluated once and
3190 evaluated more than once. Front-ends must assure this case cannot
3191 happen by surrounding any such subexpressions in their own SAVE_EXPR
3192 and forcing evaluation at the proper time. */
3193 if (contains_placeholder_p (inner
))
3196 t
= build1 (SAVE_EXPR
, TREE_TYPE (expr
), t
);
3197 SET_EXPR_LOCATION (t
, EXPR_LOCATION (expr
));
3199 /* This expression might be placed ahead of a jump to ensure that the
3200 value was computed on both sides of the jump. So make sure it isn't
3201 eliminated as dead. */
3202 TREE_SIDE_EFFECTS (t
) = 1;
3206 /* Look inside EXPR into any simple arithmetic operations. Return the
3207 outermost non-arithmetic or non-invariant node. */
3210 skip_simple_arithmetic (tree expr
)
3212 /* We don't care about whether this can be used as an lvalue in this
3214 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
3215 expr
= TREE_OPERAND (expr
, 0);
3217 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
3218 a constant, it will be more efficient to not make another SAVE_EXPR since
3219 it will allow better simplification and GCSE will be able to merge the
3220 computations if they actually occur. */
3223 if (UNARY_CLASS_P (expr
))
3224 expr
= TREE_OPERAND (expr
, 0);
3225 else if (BINARY_CLASS_P (expr
))
3227 if (tree_invariant_p (TREE_OPERAND (expr
, 1)))
3228 expr
= TREE_OPERAND (expr
, 0);
3229 else if (tree_invariant_p (TREE_OPERAND (expr
, 0)))
3230 expr
= TREE_OPERAND (expr
, 1);
3241 /* Look inside EXPR into simple arithmetic operations involving constants.
3242 Return the outermost non-arithmetic or non-constant node. */
3245 skip_simple_constant_arithmetic (tree expr
)
3247 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
3248 expr
= TREE_OPERAND (expr
, 0);
3252 if (UNARY_CLASS_P (expr
))
3253 expr
= TREE_OPERAND (expr
, 0);
3254 else if (BINARY_CLASS_P (expr
))
3256 if (TREE_CONSTANT (TREE_OPERAND (expr
, 1)))
3257 expr
= TREE_OPERAND (expr
, 0);
3258 else if (TREE_CONSTANT (TREE_OPERAND (expr
, 0)))
3259 expr
= TREE_OPERAND (expr
, 1);
3270 /* Return which tree structure is used by T. */
3272 enum tree_node_structure_enum
3273 tree_node_structure (const_tree t
)
3275 const enum tree_code code
= TREE_CODE (t
);
3276 return tree_node_structure_for_code (code
);
3279 /* Set various status flags when building a CALL_EXPR object T. */
3282 process_call_operands (tree t
)
3284 bool side_effects
= TREE_SIDE_EFFECTS (t
);
3285 bool read_only
= false;
3286 int i
= call_expr_flags (t
);
3288 /* Calls have side-effects, except those to const or pure functions. */
3289 if ((i
& ECF_LOOPING_CONST_OR_PURE
) || !(i
& (ECF_CONST
| ECF_PURE
)))
3290 side_effects
= true;
3291 /* Propagate TREE_READONLY of arguments for const functions. */
3295 if (!side_effects
|| read_only
)
3296 for (i
= 1; i
< TREE_OPERAND_LENGTH (t
); i
++)
3298 tree op
= TREE_OPERAND (t
, i
);
3299 if (op
&& TREE_SIDE_EFFECTS (op
))
3300 side_effects
= true;
3301 if (op
&& !TREE_READONLY (op
) && !CONSTANT_CLASS_P (op
))
3305 TREE_SIDE_EFFECTS (t
) = side_effects
;
3306 TREE_READONLY (t
) = read_only
;
3309 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
3310 size or offset that depends on a field within a record. */
3313 contains_placeholder_p (const_tree exp
)
3315 enum tree_code code
;
3320 code
= TREE_CODE (exp
);
3321 if (code
== PLACEHOLDER_EXPR
)
3324 switch (TREE_CODE_CLASS (code
))
3327 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
3328 position computations since they will be converted into a
3329 WITH_RECORD_EXPR involving the reference, which will assume
3330 here will be valid. */
3331 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
3333 case tcc_exceptional
:
3334 if (code
== TREE_LIST
)
3335 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp
))
3336 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp
)));
3341 case tcc_comparison
:
3342 case tcc_expression
:
3346 /* Ignoring the first operand isn't quite right, but works best. */
3347 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1));
3350 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
3351 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1))
3352 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 2)));
3355 /* The save_expr function never wraps anything containing
3356 a PLACEHOLDER_EXPR. */
3363 switch (TREE_CODE_LENGTH (code
))
3366 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
3368 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
3369 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1)));
3380 const_call_expr_arg_iterator iter
;
3381 FOR_EACH_CONST_CALL_EXPR_ARG (arg
, iter
, exp
)
3382 if (CONTAINS_PLACEHOLDER_P (arg
))
3396 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
3397 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
3401 type_contains_placeholder_1 (const_tree type
)
3403 /* If the size contains a placeholder or the parent type (component type in
3404 the case of arrays) type involves a placeholder, this type does. */
3405 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type
))
3406 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type
))
3407 || (!POINTER_TYPE_P (type
)
3409 && type_contains_placeholder_p (TREE_TYPE (type
))))
3412 /* Now do type-specific checks. Note that the last part of the check above
3413 greatly limits what we have to do below. */
3414 switch (TREE_CODE (type
))
3417 case POINTER_BOUNDS_TYPE
:
3423 case REFERENCE_TYPE
:
3432 case FIXED_POINT_TYPE
:
3433 /* Here we just check the bounds. */
3434 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type
))
3435 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type
)));
3438 /* We have already checked the component type above, so just check the
3440 return type_contains_placeholder_p (TYPE_DOMAIN (type
));
3444 case QUAL_UNION_TYPE
:
3448 for (field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
3449 if (TREE_CODE (field
) == FIELD_DECL
3450 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field
))
3451 || (TREE_CODE (type
) == QUAL_UNION_TYPE
3452 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field
)))
3453 || type_contains_placeholder_p (TREE_TYPE (field
))))
3464 /* Wrapper around above function used to cache its result. */
3467 type_contains_placeholder_p (tree type
)
3471 /* If the contains_placeholder_bits field has been initialized,
3472 then we know the answer. */
3473 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) > 0)
3474 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) - 1;
3476 /* Indicate that we've seen this type node, and the answer is false.
3477 This is what we want to return if we run into recursion via fields. */
3478 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = 1;
3480 /* Compute the real value. */
3481 result
= type_contains_placeholder_1 (type
);
3483 /* Store the real value. */
3484 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = result
+ 1;
3489 /* Push tree EXP onto vector QUEUE if it is not already present. */
3492 push_without_duplicates (tree exp
, vec
<tree
> *queue
)
3497 FOR_EACH_VEC_ELT (*queue
, i
, iter
)
3498 if (simple_cst_equal (iter
, exp
) == 1)
3502 queue
->safe_push (exp
);
3505 /* Given a tree EXP, find all occurrences of references to fields
3506 in a PLACEHOLDER_EXPR and place them in vector REFS without
3507 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
3508 we assume here that EXP contains only arithmetic expressions
3509 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
3513 find_placeholder_in_expr (tree exp
, vec
<tree
> *refs
)
3515 enum tree_code code
= TREE_CODE (exp
);
3519 /* We handle TREE_LIST and COMPONENT_REF separately. */
3520 if (code
== TREE_LIST
)
3522 FIND_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), refs
);
3523 FIND_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), refs
);
3525 else if (code
== COMPONENT_REF
)
3527 for (inner
= TREE_OPERAND (exp
, 0);
3528 REFERENCE_CLASS_P (inner
);
3529 inner
= TREE_OPERAND (inner
, 0))
3532 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
)
3533 push_without_duplicates (exp
, refs
);
3535 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), refs
);
3538 switch (TREE_CODE_CLASS (code
))
3543 case tcc_declaration
:
3544 /* Variables allocated to static storage can stay. */
3545 if (!TREE_STATIC (exp
))
3546 push_without_duplicates (exp
, refs
);
3549 case tcc_expression
:
3550 /* This is the pattern built in ada/make_aligning_type. */
3551 if (code
== ADDR_EXPR
3552 && TREE_CODE (TREE_OPERAND (exp
, 0)) == PLACEHOLDER_EXPR
)
3554 push_without_duplicates (exp
, refs
);
3558 /* Fall through... */
3560 case tcc_exceptional
:
3563 case tcc_comparison
:
3565 for (i
= 0; i
< TREE_CODE_LENGTH (code
); i
++)
3566 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
3570 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3571 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
3579 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
3580 return a tree with all occurrences of references to F in a
3581 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
3582 CONST_DECLs. Note that we assume here that EXP contains only
3583 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
3584 occurring only in their argument list. */
3587 substitute_in_expr (tree exp
, tree f
, tree r
)
3589 enum tree_code code
= TREE_CODE (exp
);
3590 tree op0
, op1
, op2
, op3
;
3593 /* We handle TREE_LIST and COMPONENT_REF separately. */
3594 if (code
== TREE_LIST
)
3596 op0
= SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp
), f
, r
);
3597 op1
= SUBSTITUTE_IN_EXPR (TREE_VALUE (exp
), f
, r
);
3598 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
3601 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
3603 else if (code
== COMPONENT_REF
)
3607 /* If this expression is getting a value from a PLACEHOLDER_EXPR
3608 and it is the right field, replace it with R. */
3609 for (inner
= TREE_OPERAND (exp
, 0);
3610 REFERENCE_CLASS_P (inner
);
3611 inner
= TREE_OPERAND (inner
, 0))
3615 op1
= TREE_OPERAND (exp
, 1);
3617 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& op1
== f
)
3620 /* If this expression hasn't been completed let, leave it alone. */
3621 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& !TREE_TYPE (inner
))
3624 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3625 if (op0
== TREE_OPERAND (exp
, 0))
3629 = fold_build3 (COMPONENT_REF
, TREE_TYPE (exp
), op0
, op1
, NULL_TREE
);
3632 switch (TREE_CODE_CLASS (code
))
3637 case tcc_declaration
:
3643 case tcc_expression
:
3647 /* Fall through... */
3649 case tcc_exceptional
:
3652 case tcc_comparison
:
3654 switch (TREE_CODE_LENGTH (code
))
3660 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3661 if (op0
== TREE_OPERAND (exp
, 0))
3664 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
3668 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3669 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3671 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
3674 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
3678 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3679 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3680 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
3682 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3683 && op2
== TREE_OPERAND (exp
, 2))
3686 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
3690 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3691 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3692 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
3693 op3
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 3), f
, r
);
3695 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3696 && op2
== TREE_OPERAND (exp
, 2)
3697 && op3
== TREE_OPERAND (exp
, 3))
3701 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
3713 new_tree
= NULL_TREE
;
3715 /* If we are trying to replace F with a constant, inline back
3716 functions which do nothing else than computing a value from
3717 the arguments they are passed. This makes it possible to
3718 fold partially or entirely the replacement expression. */
3719 if (CONSTANT_CLASS_P (r
) && code
== CALL_EXPR
)
3721 tree t
= maybe_inline_call_in_expr (exp
);
3723 return SUBSTITUTE_IN_EXPR (t
, f
, r
);
3726 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3728 tree op
= TREE_OPERAND (exp
, i
);
3729 tree new_op
= SUBSTITUTE_IN_EXPR (op
, f
, r
);
3733 new_tree
= copy_node (exp
);
3734 TREE_OPERAND (new_tree
, i
) = new_op
;
3740 new_tree
= fold (new_tree
);
3741 if (TREE_CODE (new_tree
) == CALL_EXPR
)
3742 process_call_operands (new_tree
);
3753 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
3755 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
3756 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
3761 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
3762 for it within OBJ, a tree that is an object or a chain of references. */
3765 substitute_placeholder_in_expr (tree exp
, tree obj
)
3767 enum tree_code code
= TREE_CODE (exp
);
3768 tree op0
, op1
, op2
, op3
;
3771 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
3772 in the chain of OBJ. */
3773 if (code
== PLACEHOLDER_EXPR
)
3775 tree need_type
= TYPE_MAIN_VARIANT (TREE_TYPE (exp
));
3778 for (elt
= obj
; elt
!= 0;
3779 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
3780 || TREE_CODE (elt
) == COND_EXPR
)
3781 ? TREE_OPERAND (elt
, 1)
3782 : (REFERENCE_CLASS_P (elt
)
3783 || UNARY_CLASS_P (elt
)
3784 || BINARY_CLASS_P (elt
)
3785 || VL_EXP_CLASS_P (elt
)
3786 || EXPRESSION_CLASS_P (elt
))
3787 ? TREE_OPERAND (elt
, 0) : 0))
3788 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt
)) == need_type
)
3791 for (elt
= obj
; elt
!= 0;
3792 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
3793 || TREE_CODE (elt
) == COND_EXPR
)
3794 ? TREE_OPERAND (elt
, 1)
3795 : (REFERENCE_CLASS_P (elt
)
3796 || UNARY_CLASS_P (elt
)
3797 || BINARY_CLASS_P (elt
)
3798 || VL_EXP_CLASS_P (elt
)
3799 || EXPRESSION_CLASS_P (elt
))
3800 ? TREE_OPERAND (elt
, 0) : 0))
3801 if (POINTER_TYPE_P (TREE_TYPE (elt
))
3802 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt
)))
3804 return fold_build1 (INDIRECT_REF
, need_type
, elt
);
3806 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
3807 survives until RTL generation, there will be an error. */
3811 /* TREE_LIST is special because we need to look at TREE_VALUE
3812 and TREE_CHAIN, not TREE_OPERANDS. */
3813 else if (code
== TREE_LIST
)
3815 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), obj
);
3816 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), obj
);
3817 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
3820 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
3823 switch (TREE_CODE_CLASS (code
))
3826 case tcc_declaration
:
3829 case tcc_exceptional
:
3832 case tcc_comparison
:
3833 case tcc_expression
:
3836 switch (TREE_CODE_LENGTH (code
))
3842 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3843 if (op0
== TREE_OPERAND (exp
, 0))
3846 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
3850 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3851 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
3853 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
3856 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
3860 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3861 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
3862 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
3864 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3865 && op2
== TREE_OPERAND (exp
, 2))
3868 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
3872 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3873 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
3874 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
3875 op3
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 3), obj
);
3877 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3878 && op2
== TREE_OPERAND (exp
, 2)
3879 && op3
== TREE_OPERAND (exp
, 3))
3883 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
3895 new_tree
= NULL_TREE
;
3897 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3899 tree op
= TREE_OPERAND (exp
, i
);
3900 tree new_op
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (op
, obj
);
3904 new_tree
= copy_node (exp
);
3905 TREE_OPERAND (new_tree
, i
) = new_op
;
3911 new_tree
= fold (new_tree
);
3912 if (TREE_CODE (new_tree
) == CALL_EXPR
)
3913 process_call_operands (new_tree
);
3924 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
3926 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
3927 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
3933 /* Subroutine of stabilize_reference; this is called for subtrees of
3934 references. Any expression with side-effects must be put in a SAVE_EXPR
3935 to ensure that it is only evaluated once.
3937 We don't put SAVE_EXPR nodes around everything, because assigning very
3938 simple expressions to temporaries causes us to miss good opportunities
3939 for optimizations. Among other things, the opportunity to fold in the
3940 addition of a constant into an addressing mode often gets lost, e.g.
3941 "y[i+1] += x;". In general, we take the approach that we should not make
3942 an assignment unless we are forced into it - i.e., that any non-side effect
3943 operator should be allowed, and that cse should take care of coalescing
3944 multiple utterances of the same expression should that prove fruitful. */
3947 stabilize_reference_1 (tree e
)
3950 enum tree_code code
= TREE_CODE (e
);
3952 /* We cannot ignore const expressions because it might be a reference
3953 to a const array but whose index contains side-effects. But we can
3954 ignore things that are actual constant or that already have been
3955 handled by this function. */
3957 if (tree_invariant_p (e
))
3960 switch (TREE_CODE_CLASS (code
))
3962 case tcc_exceptional
:
3964 case tcc_declaration
:
3965 case tcc_comparison
:
3967 case tcc_expression
:
3970 /* If the expression has side-effects, then encase it in a SAVE_EXPR
3971 so that it will only be evaluated once. */
3972 /* The reference (r) and comparison (<) classes could be handled as
3973 below, but it is generally faster to only evaluate them once. */
3974 if (TREE_SIDE_EFFECTS (e
))
3975 return save_expr (e
);
3979 /* Constants need no processing. In fact, we should never reach
3984 /* Division is slow and tends to be compiled with jumps,
3985 especially the division by powers of 2 that is often
3986 found inside of an array reference. So do it just once. */
3987 if (code
== TRUNC_DIV_EXPR
|| code
== TRUNC_MOD_EXPR
3988 || code
== FLOOR_DIV_EXPR
|| code
== FLOOR_MOD_EXPR
3989 || code
== CEIL_DIV_EXPR
|| code
== CEIL_MOD_EXPR
3990 || code
== ROUND_DIV_EXPR
|| code
== ROUND_MOD_EXPR
)
3991 return save_expr (e
);
3992 /* Recursively stabilize each operand. */
3993 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)),
3994 stabilize_reference_1 (TREE_OPERAND (e
, 1)));
3998 /* Recursively stabilize each operand. */
3999 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)));
4006 TREE_TYPE (result
) = TREE_TYPE (e
);
4007 TREE_READONLY (result
) = TREE_READONLY (e
);
4008 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (e
);
4009 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (e
);
4014 /* Stabilize a reference so that we can use it any number of times
4015 without causing its operands to be evaluated more than once.
4016 Returns the stabilized reference. This works by means of save_expr,
4017 so see the caveats in the comments about save_expr.
4019 Also allows conversion expressions whose operands are references.
4020 Any other kind of expression is returned unchanged. */
4023 stabilize_reference (tree ref
)
4026 enum tree_code code
= TREE_CODE (ref
);
4033 /* No action is needed in this case. */
4038 case FIX_TRUNC_EXPR
:
4039 result
= build_nt (code
, stabilize_reference (TREE_OPERAND (ref
, 0)));
4043 result
= build_nt (INDIRECT_REF
,
4044 stabilize_reference_1 (TREE_OPERAND (ref
, 0)));
4048 result
= build_nt (COMPONENT_REF
,
4049 stabilize_reference (TREE_OPERAND (ref
, 0)),
4050 TREE_OPERAND (ref
, 1), NULL_TREE
);
4054 result
= build_nt (BIT_FIELD_REF
,
4055 stabilize_reference (TREE_OPERAND (ref
, 0)),
4056 TREE_OPERAND (ref
, 1), TREE_OPERAND (ref
, 2));
4060 result
= build_nt (ARRAY_REF
,
4061 stabilize_reference (TREE_OPERAND (ref
, 0)),
4062 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
4063 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
4066 case ARRAY_RANGE_REF
:
4067 result
= build_nt (ARRAY_RANGE_REF
,
4068 stabilize_reference (TREE_OPERAND (ref
, 0)),
4069 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
4070 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
4074 /* We cannot wrap the first expression in a SAVE_EXPR, as then
4075 it wouldn't be ignored. This matters when dealing with
4077 return stabilize_reference_1 (ref
);
4079 /* If arg isn't a kind of lvalue we recognize, make no change.
4080 Caller should recognize the error for an invalid lvalue. */
4085 return error_mark_node
;
4088 TREE_TYPE (result
) = TREE_TYPE (ref
);
4089 TREE_READONLY (result
) = TREE_READONLY (ref
);
4090 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (ref
);
4091 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (ref
);
4096 /* Low-level constructors for expressions. */
4098 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
4099 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
4102 recompute_tree_invariant_for_addr_expr (tree t
)
4105 bool tc
= true, se
= false;
4107 /* We started out assuming this address is both invariant and constant, but
4108 does not have side effects. Now go down any handled components and see if
4109 any of them involve offsets that are either non-constant or non-invariant.
4110 Also check for side-effects.
4112 ??? Note that this code makes no attempt to deal with the case where
4113 taking the address of something causes a copy due to misalignment. */
4115 #define UPDATE_FLAGS(NODE) \
4116 do { tree _node = (NODE); \
4117 if (_node && !TREE_CONSTANT (_node)) tc = false; \
4118 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
4120 for (node
= TREE_OPERAND (t
, 0); handled_component_p (node
);
4121 node
= TREE_OPERAND (node
, 0))
4123 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
4124 array reference (probably made temporarily by the G++ front end),
4125 so ignore all the operands. */
4126 if ((TREE_CODE (node
) == ARRAY_REF
4127 || TREE_CODE (node
) == ARRAY_RANGE_REF
)
4128 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node
, 0))) == ARRAY_TYPE
)
4130 UPDATE_FLAGS (TREE_OPERAND (node
, 1));
4131 if (TREE_OPERAND (node
, 2))
4132 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
4133 if (TREE_OPERAND (node
, 3))
4134 UPDATE_FLAGS (TREE_OPERAND (node
, 3));
4136 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
4137 FIELD_DECL, apparently. The G++ front end can put something else
4138 there, at least temporarily. */
4139 else if (TREE_CODE (node
) == COMPONENT_REF
4140 && TREE_CODE (TREE_OPERAND (node
, 1)) == FIELD_DECL
)
4142 if (TREE_OPERAND (node
, 2))
4143 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
4147 node
= lang_hooks
.expr_to_decl (node
, &tc
, &se
);
4149 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
4150 the address, since &(*a)->b is a form of addition. If it's a constant, the
4151 address is constant too. If it's a decl, its address is constant if the
4152 decl is static. Everything else is not constant and, furthermore,
4153 taking the address of a volatile variable is not volatile. */
4154 if (TREE_CODE (node
) == INDIRECT_REF
4155 || TREE_CODE (node
) == MEM_REF
)
4156 UPDATE_FLAGS (TREE_OPERAND (node
, 0));
4157 else if (CONSTANT_CLASS_P (node
))
4159 else if (DECL_P (node
))
4160 tc
&= (staticp (node
) != NULL_TREE
);
4164 se
|= TREE_SIDE_EFFECTS (node
);
4168 TREE_CONSTANT (t
) = tc
;
4169 TREE_SIDE_EFFECTS (t
) = se
;
4173 /* Build an expression of code CODE, data type TYPE, and operands as
4174 specified. Expressions and reference nodes can be created this way.
4175 Constants, decls, types and misc nodes cannot be.
4177 We define 5 non-variadic functions, from 0 to 4 arguments. This is
4178 enough for all extant tree codes. */
4181 build0_stat (enum tree_code code
, tree tt MEM_STAT_DECL
)
4185 gcc_assert (TREE_CODE_LENGTH (code
) == 0);
4187 t
= make_node_stat (code PASS_MEM_STAT
);
4194 build1_stat (enum tree_code code
, tree type
, tree node MEM_STAT_DECL
)
4196 int length
= sizeof (struct tree_exp
);
4199 record_node_allocation_statistics (code
, length
);
4201 gcc_assert (TREE_CODE_LENGTH (code
) == 1);
4203 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
4205 memset (t
, 0, sizeof (struct tree_common
));
4207 TREE_SET_CODE (t
, code
);
4209 TREE_TYPE (t
) = type
;
4210 SET_EXPR_LOCATION (t
, UNKNOWN_LOCATION
);
4211 TREE_OPERAND (t
, 0) = node
;
4212 if (node
&& !TYPE_P (node
))
4214 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (node
);
4215 TREE_READONLY (t
) = TREE_READONLY (node
);
4218 if (TREE_CODE_CLASS (code
) == tcc_statement
)
4219 TREE_SIDE_EFFECTS (t
) = 1;
4223 /* All of these have side-effects, no matter what their
4225 TREE_SIDE_EFFECTS (t
) = 1;
4226 TREE_READONLY (t
) = 0;
4230 /* Whether a dereference is readonly has nothing to do with whether
4231 its operand is readonly. */
4232 TREE_READONLY (t
) = 0;
4237 recompute_tree_invariant_for_addr_expr (t
);
4241 if ((TREE_CODE_CLASS (code
) == tcc_unary
|| code
== VIEW_CONVERT_EXPR
)
4242 && node
&& !TYPE_P (node
)
4243 && TREE_CONSTANT (node
))
4244 TREE_CONSTANT (t
) = 1;
4245 if (TREE_CODE_CLASS (code
) == tcc_reference
4246 && node
&& TREE_THIS_VOLATILE (node
))
4247 TREE_THIS_VOLATILE (t
) = 1;
4254 #define PROCESS_ARG(N) \
4256 TREE_OPERAND (t, N) = arg##N; \
4257 if (arg##N &&!TYPE_P (arg##N)) \
4259 if (TREE_SIDE_EFFECTS (arg##N)) \
4261 if (!TREE_READONLY (arg##N) \
4262 && !CONSTANT_CLASS_P (arg##N)) \
4263 (void) (read_only = 0); \
4264 if (!TREE_CONSTANT (arg##N)) \
4265 (void) (constant = 0); \
4270 build2_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1 MEM_STAT_DECL
)
4272 bool constant
, read_only
, side_effects
;
4275 gcc_assert (TREE_CODE_LENGTH (code
) == 2);
4277 if ((code
== MINUS_EXPR
|| code
== PLUS_EXPR
|| code
== MULT_EXPR
)
4278 && arg0
&& arg1
&& tt
&& POINTER_TYPE_P (tt
)
4279 /* When sizetype precision doesn't match that of pointers
4280 we need to be able to build explicit extensions or truncations
4281 of the offset argument. */
4282 && TYPE_PRECISION (sizetype
) == TYPE_PRECISION (tt
))
4283 gcc_assert (TREE_CODE (arg0
) == INTEGER_CST
4284 && TREE_CODE (arg1
) == INTEGER_CST
);
4286 if (code
== POINTER_PLUS_EXPR
&& arg0
&& arg1
&& tt
)
4287 gcc_assert (POINTER_TYPE_P (tt
) && POINTER_TYPE_P (TREE_TYPE (arg0
))
4288 && ptrofftype_p (TREE_TYPE (arg1
)));
4290 t
= make_node_stat (code PASS_MEM_STAT
);
4293 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
4294 result based on those same flags for the arguments. But if the
4295 arguments aren't really even `tree' expressions, we shouldn't be trying
4298 /* Expressions without side effects may be constant if their
4299 arguments are as well. */
4300 constant
= (TREE_CODE_CLASS (code
) == tcc_comparison
4301 || TREE_CODE_CLASS (code
) == tcc_binary
);
4303 side_effects
= TREE_SIDE_EFFECTS (t
);
4308 TREE_READONLY (t
) = read_only
;
4309 TREE_CONSTANT (t
) = constant
;
4310 TREE_SIDE_EFFECTS (t
) = side_effects
;
4311 TREE_THIS_VOLATILE (t
)
4312 = (TREE_CODE_CLASS (code
) == tcc_reference
4313 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4320 build3_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4321 tree arg2 MEM_STAT_DECL
)
4323 bool constant
, read_only
, side_effects
;
4326 gcc_assert (TREE_CODE_LENGTH (code
) == 3);
4327 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
4329 t
= make_node_stat (code PASS_MEM_STAT
);
4334 /* As a special exception, if COND_EXPR has NULL branches, we
4335 assume that it is a gimple statement and always consider
4336 it to have side effects. */
4337 if (code
== COND_EXPR
4338 && tt
== void_type_node
4339 && arg1
== NULL_TREE
4340 && arg2
== NULL_TREE
)
4341 side_effects
= true;
4343 side_effects
= TREE_SIDE_EFFECTS (t
);
4349 if (code
== COND_EXPR
)
4350 TREE_READONLY (t
) = read_only
;
4352 TREE_SIDE_EFFECTS (t
) = side_effects
;
4353 TREE_THIS_VOLATILE (t
)
4354 = (TREE_CODE_CLASS (code
) == tcc_reference
4355 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4361 build4_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4362 tree arg2
, tree arg3 MEM_STAT_DECL
)
4364 bool constant
, read_only
, side_effects
;
4367 gcc_assert (TREE_CODE_LENGTH (code
) == 4);
4369 t
= make_node_stat (code PASS_MEM_STAT
);
4372 side_effects
= TREE_SIDE_EFFECTS (t
);
4379 TREE_SIDE_EFFECTS (t
) = side_effects
;
4380 TREE_THIS_VOLATILE (t
)
4381 = (TREE_CODE_CLASS (code
) == tcc_reference
4382 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4388 build5_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4389 tree arg2
, tree arg3
, tree arg4 MEM_STAT_DECL
)
4391 bool constant
, read_only
, side_effects
;
4394 gcc_assert (TREE_CODE_LENGTH (code
) == 5);
4396 t
= make_node_stat (code PASS_MEM_STAT
);
4399 side_effects
= TREE_SIDE_EFFECTS (t
);
4407 TREE_SIDE_EFFECTS (t
) = side_effects
;
4408 TREE_THIS_VOLATILE (t
)
4409 = (TREE_CODE_CLASS (code
) == tcc_reference
4410 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4415 /* Build a simple MEM_REF tree with the sematics of a plain INDIRECT_REF
4416 on the pointer PTR. */
4419 build_simple_mem_ref_loc (location_t loc
, tree ptr
)
4421 HOST_WIDE_INT offset
= 0;
4422 tree ptype
= TREE_TYPE (ptr
);
4424 /* For convenience allow addresses that collapse to a simple base
4426 if (TREE_CODE (ptr
) == ADDR_EXPR
4427 && (handled_component_p (TREE_OPERAND (ptr
, 0))
4428 || TREE_CODE (TREE_OPERAND (ptr
, 0)) == MEM_REF
))
4430 ptr
= get_addr_base_and_unit_offset (TREE_OPERAND (ptr
, 0), &offset
);
4432 ptr
= build_fold_addr_expr (ptr
);
4433 gcc_assert (is_gimple_reg (ptr
) || is_gimple_min_invariant (ptr
));
4435 tem
= build2 (MEM_REF
, TREE_TYPE (ptype
),
4436 ptr
, build_int_cst (ptype
, offset
));
4437 SET_EXPR_LOCATION (tem
, loc
);
4441 /* Return the constant offset of a MEM_REF or TARGET_MEM_REF tree T. */
4444 mem_ref_offset (const_tree t
)
4446 return offset_int::from (TREE_OPERAND (t
, 1), SIGNED
);
4449 /* Return an invariant ADDR_EXPR of type TYPE taking the address of BASE
4450 offsetted by OFFSET units. */
4453 build_invariant_address (tree type
, tree base
, HOST_WIDE_INT offset
)
4455 tree ref
= fold_build2 (MEM_REF
, TREE_TYPE (type
),
4456 build_fold_addr_expr (base
),
4457 build_int_cst (ptr_type_node
, offset
));
4458 tree addr
= build1 (ADDR_EXPR
, type
, ref
);
4459 recompute_tree_invariant_for_addr_expr (addr
);
4463 /* Similar except don't specify the TREE_TYPE
4464 and leave the TREE_SIDE_EFFECTS as 0.
4465 It is permissible for arguments to be null,
4466 or even garbage if their values do not matter. */
4469 build_nt (enum tree_code code
, ...)
4476 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
4480 t
= make_node (code
);
4481 length
= TREE_CODE_LENGTH (code
);
4483 for (i
= 0; i
< length
; i
++)
4484 TREE_OPERAND (t
, i
) = va_arg (p
, tree
);
4490 /* Similar to build_nt, but for creating a CALL_EXPR object with a
4494 build_nt_call_vec (tree fn
, vec
<tree
, va_gc
> *args
)
4499 ret
= build_vl_exp (CALL_EXPR
, vec_safe_length (args
) + 3);
4500 CALL_EXPR_FN (ret
) = fn
;
4501 CALL_EXPR_STATIC_CHAIN (ret
) = NULL_TREE
;
4502 FOR_EACH_VEC_SAFE_ELT (args
, ix
, t
)
4503 CALL_EXPR_ARG (ret
, ix
) = t
;
4507 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
4508 We do NOT enter this node in any sort of symbol table.
4510 LOC is the location of the decl.
4512 layout_decl is used to set up the decl's storage layout.
4513 Other slots are initialized to 0 or null pointers. */
4516 build_decl_stat (location_t loc
, enum tree_code code
, tree name
,
4517 tree type MEM_STAT_DECL
)
4521 t
= make_node_stat (code PASS_MEM_STAT
);
4522 DECL_SOURCE_LOCATION (t
) = loc
;
4524 /* if (type == error_mark_node)
4525 type = integer_type_node; */
4526 /* That is not done, deliberately, so that having error_mark_node
4527 as the type can suppress useless errors in the use of this variable. */
4529 DECL_NAME (t
) = name
;
4530 TREE_TYPE (t
) = type
;
4532 if (code
== VAR_DECL
|| code
== PARM_DECL
|| code
== RESULT_DECL
)
4538 /* Builds and returns function declaration with NAME and TYPE. */
4541 build_fn_decl (const char *name
, tree type
)
4543 tree id
= get_identifier (name
);
4544 tree decl
= build_decl (input_location
, FUNCTION_DECL
, id
, type
);
4546 DECL_EXTERNAL (decl
) = 1;
4547 TREE_PUBLIC (decl
) = 1;
4548 DECL_ARTIFICIAL (decl
) = 1;
4549 TREE_NOTHROW (decl
) = 1;
4554 vec
<tree
, va_gc
> *all_translation_units
;
4556 /* Builds a new translation-unit decl with name NAME, queues it in the
4557 global list of translation-unit decls and returns it. */
4560 build_translation_unit_decl (tree name
)
4562 tree tu
= build_decl (UNKNOWN_LOCATION
, TRANSLATION_UNIT_DECL
,
4564 TRANSLATION_UNIT_LANGUAGE (tu
) = lang_hooks
.name
;
4565 vec_safe_push (all_translation_units
, tu
);
4570 /* BLOCK nodes are used to represent the structure of binding contours
4571 and declarations, once those contours have been exited and their contents
4572 compiled. This information is used for outputting debugging info. */
4575 build_block (tree vars
, tree subblocks
, tree supercontext
, tree chain
)
4577 tree block
= make_node (BLOCK
);
4579 BLOCK_VARS (block
) = vars
;
4580 BLOCK_SUBBLOCKS (block
) = subblocks
;
4581 BLOCK_SUPERCONTEXT (block
) = supercontext
;
4582 BLOCK_CHAIN (block
) = chain
;
4587 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
4589 LOC is the location to use in tree T. */
4592 protected_set_expr_location (tree t
, location_t loc
)
4594 if (CAN_HAVE_LOCATION_P (t
))
4595 SET_EXPR_LOCATION (t
, loc
);
4598 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
4602 build_decl_attribute_variant (tree ddecl
, tree attribute
)
4604 DECL_ATTRIBUTES (ddecl
) = attribute
;
4608 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4609 is ATTRIBUTE and its qualifiers are QUALS.
4611 Record such modified types already made so we don't make duplicates. */
4614 build_type_attribute_qual_variant (tree ttype
, tree attribute
, int quals
)
4616 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype
), attribute
))
4618 inchash::hash hstate
;
4622 enum tree_code code
= TREE_CODE (ttype
);
4624 /* Building a distinct copy of a tagged type is inappropriate; it
4625 causes breakage in code that expects there to be a one-to-one
4626 relationship between a struct and its fields.
4627 build_duplicate_type is another solution (as used in
4628 handle_transparent_union_attribute), but that doesn't play well
4629 with the stronger C++ type identity model. */
4630 if (TREE_CODE (ttype
) == RECORD_TYPE
4631 || TREE_CODE (ttype
) == UNION_TYPE
4632 || TREE_CODE (ttype
) == QUAL_UNION_TYPE
4633 || TREE_CODE (ttype
) == ENUMERAL_TYPE
)
4635 warning (OPT_Wattributes
,
4636 "ignoring attributes applied to %qT after definition",
4637 TYPE_MAIN_VARIANT (ttype
));
4638 return build_qualified_type (ttype
, quals
);
4641 ttype
= build_qualified_type (ttype
, TYPE_UNQUALIFIED
);
4642 ntype
= build_distinct_type_copy (ttype
);
4644 TYPE_ATTRIBUTES (ntype
) = attribute
;
4646 hstate
.add_int (code
);
4647 if (TREE_TYPE (ntype
))
4648 hstate
.add_object (TYPE_HASH (TREE_TYPE (ntype
)));
4649 attribute_hash_list (attribute
, hstate
);
4651 switch (TREE_CODE (ntype
))
4654 type_hash_list (TYPE_ARG_TYPES (ntype
), hstate
);
4657 if (TYPE_DOMAIN (ntype
))
4658 hstate
.add_object (TYPE_HASH (TYPE_DOMAIN (ntype
)));
4661 t
= TYPE_MAX_VALUE (ntype
);
4662 for (i
= 0; i
< TREE_INT_CST_NUNITS (t
); i
++)
4663 hstate
.add_object (TREE_INT_CST_ELT (t
, i
));
4666 case FIXED_POINT_TYPE
:
4668 unsigned int precision
= TYPE_PRECISION (ntype
);
4669 hstate
.add_object (precision
);
4676 ntype
= type_hash_canon (hstate
.end(), ntype
);
4678 /* If the target-dependent attributes make NTYPE different from
4679 its canonical type, we will need to use structural equality
4680 checks for this type. */
4681 if (TYPE_STRUCTURAL_EQUALITY_P (ttype
)
4682 || !comp_type_attributes (ntype
, ttype
))
4683 SET_TYPE_STRUCTURAL_EQUALITY (ntype
);
4684 else if (TYPE_CANONICAL (ntype
) == ntype
)
4685 TYPE_CANONICAL (ntype
) = TYPE_CANONICAL (ttype
);
4687 ttype
= build_qualified_type (ntype
, quals
);
4689 else if (TYPE_QUALS (ttype
) != quals
)
4690 ttype
= build_qualified_type (ttype
, quals
);
4695 /* Check if "omp declare simd" attribute arguments, CLAUSES1 and CLAUSES2, are
4699 omp_declare_simd_clauses_equal (tree clauses1
, tree clauses2
)
4702 for (cl1
= clauses1
, cl2
= clauses2
;
4704 cl1
= OMP_CLAUSE_CHAIN (cl1
), cl2
= OMP_CLAUSE_CHAIN (cl2
))
4706 if (OMP_CLAUSE_CODE (cl1
) != OMP_CLAUSE_CODE (cl2
))
4708 if (OMP_CLAUSE_CODE (cl1
) != OMP_CLAUSE_SIMDLEN
)
4710 if (simple_cst_equal (OMP_CLAUSE_DECL (cl1
),
4711 OMP_CLAUSE_DECL (cl2
)) != 1)
4714 switch (OMP_CLAUSE_CODE (cl1
))
4716 case OMP_CLAUSE_ALIGNED
:
4717 if (simple_cst_equal (OMP_CLAUSE_ALIGNED_ALIGNMENT (cl1
),
4718 OMP_CLAUSE_ALIGNED_ALIGNMENT (cl2
)) != 1)
4721 case OMP_CLAUSE_LINEAR
:
4722 if (simple_cst_equal (OMP_CLAUSE_LINEAR_STEP (cl1
),
4723 OMP_CLAUSE_LINEAR_STEP (cl2
)) != 1)
4726 case OMP_CLAUSE_SIMDLEN
:
4727 if (simple_cst_equal (OMP_CLAUSE_SIMDLEN_EXPR (cl1
),
4728 OMP_CLAUSE_SIMDLEN_EXPR (cl2
)) != 1)
4737 /* Compare two constructor-element-type constants. Return 1 if the lists
4738 are known to be equal; otherwise return 0. */
4741 simple_cst_list_equal (const_tree l1
, const_tree l2
)
4743 while (l1
!= NULL_TREE
&& l2
!= NULL_TREE
)
4745 if (simple_cst_equal (TREE_VALUE (l1
), TREE_VALUE (l2
)) != 1)
4748 l1
= TREE_CHAIN (l1
);
4749 l2
= TREE_CHAIN (l2
);
4755 /* Compare two attributes for their value identity. Return true if the
4756 attribute values are known to be equal; otherwise return false.
4760 attribute_value_equal (const_tree attr1
, const_tree attr2
)
4762 if (TREE_VALUE (attr1
) == TREE_VALUE (attr2
))
4765 if (TREE_VALUE (attr1
) != NULL_TREE
4766 && TREE_CODE (TREE_VALUE (attr1
)) == TREE_LIST
4767 && TREE_VALUE (attr2
) != NULL
4768 && TREE_CODE (TREE_VALUE (attr2
)) == TREE_LIST
)
4769 return (simple_cst_list_equal (TREE_VALUE (attr1
),
4770 TREE_VALUE (attr2
)) == 1);
4772 if ((flag_openmp
|| flag_openmp_simd
)
4773 && TREE_VALUE (attr1
) && TREE_VALUE (attr2
)
4774 && TREE_CODE (TREE_VALUE (attr1
)) == OMP_CLAUSE
4775 && TREE_CODE (TREE_VALUE (attr2
)) == OMP_CLAUSE
)
4776 return omp_declare_simd_clauses_equal (TREE_VALUE (attr1
),
4777 TREE_VALUE (attr2
));
4779 return (simple_cst_equal (TREE_VALUE (attr1
), TREE_VALUE (attr2
)) == 1);
4782 /* Return 0 if the attributes for two types are incompatible, 1 if they
4783 are compatible, and 2 if they are nearly compatible (which causes a
4784 warning to be generated). */
4786 comp_type_attributes (const_tree type1
, const_tree type2
)
4788 const_tree a1
= TYPE_ATTRIBUTES (type1
);
4789 const_tree a2
= TYPE_ATTRIBUTES (type2
);
4794 for (a
= a1
; a
!= NULL_TREE
; a
= TREE_CHAIN (a
))
4796 const struct attribute_spec
*as
;
4799 as
= lookup_attribute_spec (get_attribute_name (a
));
4800 if (!as
|| as
->affects_type_identity
== false)
4803 attr
= lookup_attribute (as
->name
, CONST_CAST_TREE (a2
));
4804 if (!attr
|| !attribute_value_equal (a
, attr
))
4809 for (a
= a2
; a
!= NULL_TREE
; a
= TREE_CHAIN (a
))
4811 const struct attribute_spec
*as
;
4813 as
= lookup_attribute_spec (get_attribute_name (a
));
4814 if (!as
|| as
->affects_type_identity
== false)
4817 if (!lookup_attribute (as
->name
, CONST_CAST_TREE (a1
)))
4819 /* We don't need to compare trees again, as we did this
4820 already in first loop. */
4822 /* All types - affecting identity - are equal, so
4823 there is no need to call target hook for comparison. */
4827 /* As some type combinations - like default calling-convention - might
4828 be compatible, we have to call the target hook to get the final result. */
4829 return targetm
.comp_type_attributes (type1
, type2
);
4832 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4835 Record such modified types already made so we don't make duplicates. */
4838 build_type_attribute_variant (tree ttype
, tree attribute
)
4840 return build_type_attribute_qual_variant (ttype
, attribute
,
4841 TYPE_QUALS (ttype
));
4845 /* Reset the expression *EXPR_P, a size or position.
4847 ??? We could reset all non-constant sizes or positions. But it's cheap
4848 enough to not do so and refrain from adding workarounds to dwarf2out.c.
4850 We need to reset self-referential sizes or positions because they cannot
4851 be gimplified and thus can contain a CALL_EXPR after the gimplification
4852 is finished, which will run afoul of LTO streaming. And they need to be
4853 reset to something essentially dummy but not constant, so as to preserve
4854 the properties of the object they are attached to. */
4857 free_lang_data_in_one_sizepos (tree
*expr_p
)
4859 tree expr
= *expr_p
;
4860 if (CONTAINS_PLACEHOLDER_P (expr
))
4861 *expr_p
= build0 (PLACEHOLDER_EXPR
, TREE_TYPE (expr
));
4865 /* Reset all the fields in a binfo node BINFO. We only keep
4866 BINFO_VTABLE, which is used by gimple_fold_obj_type_ref. */
4869 free_lang_data_in_binfo (tree binfo
)
4874 gcc_assert (TREE_CODE (binfo
) == TREE_BINFO
);
4876 BINFO_VIRTUALS (binfo
) = NULL_TREE
;
4877 BINFO_BASE_ACCESSES (binfo
) = NULL
;
4878 BINFO_INHERITANCE_CHAIN (binfo
) = NULL_TREE
;
4879 BINFO_SUBVTT_INDEX (binfo
) = NULL_TREE
;
4881 FOR_EACH_VEC_ELT (*BINFO_BASE_BINFOS (binfo
), i
, t
)
4882 free_lang_data_in_binfo (t
);
4886 /* Reset all language specific information still present in TYPE. */
4889 free_lang_data_in_type (tree type
)
4891 gcc_assert (TYPE_P (type
));
4893 /* Give the FE a chance to remove its own data first. */
4894 lang_hooks
.free_lang_data (type
);
4896 TREE_LANG_FLAG_0 (type
) = 0;
4897 TREE_LANG_FLAG_1 (type
) = 0;
4898 TREE_LANG_FLAG_2 (type
) = 0;
4899 TREE_LANG_FLAG_3 (type
) = 0;
4900 TREE_LANG_FLAG_4 (type
) = 0;
4901 TREE_LANG_FLAG_5 (type
) = 0;
4902 TREE_LANG_FLAG_6 (type
) = 0;
4904 if (TREE_CODE (type
) == FUNCTION_TYPE
)
4906 /* Remove the const and volatile qualifiers from arguments. The
4907 C++ front end removes them, but the C front end does not,
4908 leading to false ODR violation errors when merging two
4909 instances of the same function signature compiled by
4910 different front ends. */
4913 for (p
= TYPE_ARG_TYPES (type
); p
; p
= TREE_CHAIN (p
))
4915 tree arg_type
= TREE_VALUE (p
);
4917 if (TYPE_READONLY (arg_type
) || TYPE_VOLATILE (arg_type
))
4919 int quals
= TYPE_QUALS (arg_type
)
4921 & ~TYPE_QUAL_VOLATILE
;
4922 TREE_VALUE (p
) = build_qualified_type (arg_type
, quals
);
4923 free_lang_data_in_type (TREE_VALUE (p
));
4928 /* Remove members that are not actually FIELD_DECLs from the field
4929 list of an aggregate. These occur in C++. */
4930 if (RECORD_OR_UNION_TYPE_P (type
))
4934 /* Note that TYPE_FIELDS can be shared across distinct
4935 TREE_TYPEs. Therefore, if the first field of TYPE_FIELDS is
4936 to be removed, we cannot set its TREE_CHAIN to NULL.
4937 Otherwise, we would not be able to find all the other fields
4938 in the other instances of this TREE_TYPE.
4940 This was causing an ICE in testsuite/g++.dg/lto/20080915.C. */
4942 member
= TYPE_FIELDS (type
);
4945 if (TREE_CODE (member
) == FIELD_DECL
4946 || TREE_CODE (member
) == TYPE_DECL
)
4949 TREE_CHAIN (prev
) = member
;
4951 TYPE_FIELDS (type
) = member
;
4955 member
= TREE_CHAIN (member
);
4959 TREE_CHAIN (prev
) = NULL_TREE
;
4961 TYPE_FIELDS (type
) = NULL_TREE
;
4963 TYPE_METHODS (type
) = NULL_TREE
;
4964 if (TYPE_BINFO (type
))
4965 free_lang_data_in_binfo (TYPE_BINFO (type
));
4969 /* For non-aggregate types, clear out the language slot (which
4970 overloads TYPE_BINFO). */
4971 TYPE_LANG_SLOT_1 (type
) = NULL_TREE
;
4973 if (INTEGRAL_TYPE_P (type
)
4974 || SCALAR_FLOAT_TYPE_P (type
)
4975 || FIXED_POINT_TYPE_P (type
))
4977 free_lang_data_in_one_sizepos (&TYPE_MIN_VALUE (type
));
4978 free_lang_data_in_one_sizepos (&TYPE_MAX_VALUE (type
));
4982 free_lang_data_in_one_sizepos (&TYPE_SIZE (type
));
4983 free_lang_data_in_one_sizepos (&TYPE_SIZE_UNIT (type
));
4985 if (TYPE_CONTEXT (type
)
4986 && TREE_CODE (TYPE_CONTEXT (type
)) == BLOCK
)
4988 tree ctx
= TYPE_CONTEXT (type
);
4991 ctx
= BLOCK_SUPERCONTEXT (ctx
);
4993 while (ctx
&& TREE_CODE (ctx
) == BLOCK
);
4994 TYPE_CONTEXT (type
) = ctx
;
4999 /* Return true if DECL may need an assembler name to be set. */
5002 need_assembler_name_p (tree decl
)
5004 /* We use DECL_ASSEMBLER_NAME to hold mangled type names for One Definition Rule
5006 if (flag_lto_odr_type_mering
5007 && TREE_CODE (decl
) == TYPE_DECL
5009 && decl
== TYPE_NAME (TREE_TYPE (decl
))
5010 && !is_lang_specific (TREE_TYPE (decl
))
5011 && AGGREGATE_TYPE_P (TREE_TYPE (decl
))
5012 && !variably_modified_type_p (TREE_TYPE (decl
), NULL_TREE
)
5013 && !type_in_anonymous_namespace_p (TREE_TYPE (decl
)))
5014 return !DECL_ASSEMBLER_NAME_SET_P (decl
);
5015 /* Only FUNCTION_DECLs and VAR_DECLs are considered. */
5016 if (TREE_CODE (decl
) != FUNCTION_DECL
5017 && TREE_CODE (decl
) != VAR_DECL
)
5020 /* If DECL already has its assembler name set, it does not need a
5022 if (!HAS_DECL_ASSEMBLER_NAME_P (decl
)
5023 || DECL_ASSEMBLER_NAME_SET_P (decl
))
5026 /* Abstract decls do not need an assembler name. */
5027 if (DECL_ABSTRACT_P (decl
))
5030 /* For VAR_DECLs, only static, public and external symbols need an
5032 if (TREE_CODE (decl
) == VAR_DECL
5033 && !TREE_STATIC (decl
)
5034 && !TREE_PUBLIC (decl
)
5035 && !DECL_EXTERNAL (decl
))
5038 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5040 /* Do not set assembler name on builtins. Allow RTL expansion to
5041 decide whether to expand inline or via a regular call. */
5042 if (DECL_BUILT_IN (decl
)
5043 && DECL_BUILT_IN_CLASS (decl
) != BUILT_IN_FRONTEND
)
5046 /* Functions represented in the callgraph need an assembler name. */
5047 if (cgraph_node::get (decl
) != NULL
)
5050 /* Unused and not public functions don't need an assembler name. */
5051 if (!TREE_USED (decl
) && !TREE_PUBLIC (decl
))
5059 /* Reset all language specific information still present in symbol
5063 free_lang_data_in_decl (tree decl
)
5065 gcc_assert (DECL_P (decl
));
5067 /* Give the FE a chance to remove its own data first. */
5068 lang_hooks
.free_lang_data (decl
);
5070 TREE_LANG_FLAG_0 (decl
) = 0;
5071 TREE_LANG_FLAG_1 (decl
) = 0;
5072 TREE_LANG_FLAG_2 (decl
) = 0;
5073 TREE_LANG_FLAG_3 (decl
) = 0;
5074 TREE_LANG_FLAG_4 (decl
) = 0;
5075 TREE_LANG_FLAG_5 (decl
) = 0;
5076 TREE_LANG_FLAG_6 (decl
) = 0;
5078 free_lang_data_in_one_sizepos (&DECL_SIZE (decl
));
5079 free_lang_data_in_one_sizepos (&DECL_SIZE_UNIT (decl
));
5080 if (TREE_CODE (decl
) == FIELD_DECL
)
5082 free_lang_data_in_one_sizepos (&DECL_FIELD_OFFSET (decl
));
5083 if (TREE_CODE (DECL_CONTEXT (decl
)) == QUAL_UNION_TYPE
)
5084 DECL_QUALIFIER (decl
) = NULL_TREE
;
5087 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5089 struct cgraph_node
*node
;
5090 if (!(node
= cgraph_node::get (decl
))
5091 || (!node
->definition
&& !node
->clones
))
5094 node
->release_body ();
5097 release_function_body (decl
);
5098 DECL_ARGUMENTS (decl
) = NULL
;
5099 DECL_RESULT (decl
) = NULL
;
5100 DECL_INITIAL (decl
) = error_mark_node
;
5103 if (gimple_has_body_p (decl
))
5107 /* If DECL has a gimple body, then the context for its
5108 arguments must be DECL. Otherwise, it doesn't really
5109 matter, as we will not be emitting any code for DECL. In
5110 general, there may be other instances of DECL created by
5111 the front end and since PARM_DECLs are generally shared,
5112 their DECL_CONTEXT changes as the replicas of DECL are
5113 created. The only time where DECL_CONTEXT is important
5114 is for the FUNCTION_DECLs that have a gimple body (since
5115 the PARM_DECL will be used in the function's body). */
5116 for (t
= DECL_ARGUMENTS (decl
); t
; t
= TREE_CHAIN (t
))
5117 DECL_CONTEXT (t
) = decl
;
5120 /* DECL_SAVED_TREE holds the GENERIC representation for DECL.
5121 At this point, it is not needed anymore. */
5122 DECL_SAVED_TREE (decl
) = NULL_TREE
;
5124 /* Clear the abstract origin if it refers to a method. Otherwise
5125 dwarf2out.c will ICE as we clear TYPE_METHODS and thus the
5126 origin will not be output correctly. */
5127 if (DECL_ABSTRACT_ORIGIN (decl
)
5128 && DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))
5129 && RECORD_OR_UNION_TYPE_P
5130 (DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))))
5131 DECL_ABSTRACT_ORIGIN (decl
) = NULL_TREE
;
5133 /* Sometimes the C++ frontend doesn't manage to transform a temporary
5134 DECL_VINDEX referring to itself into a vtable slot number as it
5135 should. Happens with functions that are copied and then forgotten
5136 about. Just clear it, it won't matter anymore. */
5137 if (DECL_VINDEX (decl
) && !tree_fits_shwi_p (DECL_VINDEX (decl
)))
5138 DECL_VINDEX (decl
) = NULL_TREE
;
5140 else if (TREE_CODE (decl
) == VAR_DECL
)
5142 if ((DECL_EXTERNAL (decl
)
5143 && (!TREE_STATIC (decl
) || !TREE_READONLY (decl
)))
5144 || (decl_function_context (decl
) && !TREE_STATIC (decl
)))
5145 DECL_INITIAL (decl
) = NULL_TREE
;
5147 else if (TREE_CODE (decl
) == TYPE_DECL
5148 || TREE_CODE (decl
) == FIELD_DECL
)
5149 DECL_INITIAL (decl
) = NULL_TREE
;
5150 else if (TREE_CODE (decl
) == TRANSLATION_UNIT_DECL
5151 && DECL_INITIAL (decl
)
5152 && TREE_CODE (DECL_INITIAL (decl
)) == BLOCK
)
5154 /* Strip builtins from the translation-unit BLOCK. We still have targets
5155 without builtin_decl_explicit support and also builtins are shared
5156 nodes and thus we can't use TREE_CHAIN in multiple lists. */
5157 tree
*nextp
= &BLOCK_VARS (DECL_INITIAL (decl
));
5161 if (TREE_CODE (var
) == FUNCTION_DECL
5162 && DECL_BUILT_IN (var
))
5163 *nextp
= TREE_CHAIN (var
);
5165 nextp
= &TREE_CHAIN (var
);
5171 /* Data used when collecting DECLs and TYPEs for language data removal. */
5173 struct free_lang_data_d
5175 /* Worklist to avoid excessive recursion. */
5178 /* Set of traversed objects. Used to avoid duplicate visits. */
5179 hash_set
<tree
> *pset
;
5181 /* Array of symbols to process with free_lang_data_in_decl. */
5184 /* Array of types to process with free_lang_data_in_type. */
5189 /* Save all language fields needed to generate proper debug information
5190 for DECL. This saves most fields cleared out by free_lang_data_in_decl. */
5193 save_debug_info_for_decl (tree t
)
5195 /*struct saved_debug_info_d *sdi;*/
5197 gcc_assert (debug_info_level
> DINFO_LEVEL_TERSE
&& t
&& DECL_P (t
));
5199 /* FIXME. Partial implementation for saving debug info removed. */
5203 /* Save all language fields needed to generate proper debug information
5204 for TYPE. This saves most fields cleared out by free_lang_data_in_type. */
5207 save_debug_info_for_type (tree t
)
5209 /*struct saved_debug_info_d *sdi;*/
5211 gcc_assert (debug_info_level
> DINFO_LEVEL_TERSE
&& t
&& TYPE_P (t
));
5213 /* FIXME. Partial implementation for saving debug info removed. */
5217 /* Add type or decl T to one of the list of tree nodes that need their
5218 language data removed. The lists are held inside FLD. */
5221 add_tree_to_fld_list (tree t
, struct free_lang_data_d
*fld
)
5225 fld
->decls
.safe_push (t
);
5226 if (debug_info_level
> DINFO_LEVEL_TERSE
)
5227 save_debug_info_for_decl (t
);
5229 else if (TYPE_P (t
))
5231 fld
->types
.safe_push (t
);
5232 if (debug_info_level
> DINFO_LEVEL_TERSE
)
5233 save_debug_info_for_type (t
);
5239 /* Push tree node T into FLD->WORKLIST. */
5242 fld_worklist_push (tree t
, struct free_lang_data_d
*fld
)
5244 if (t
&& !is_lang_specific (t
) && !fld
->pset
->contains (t
))
5245 fld
->worklist
.safe_push ((t
));
5249 /* Operand callback helper for free_lang_data_in_node. *TP is the
5250 subtree operand being considered. */
5253 find_decls_types_r (tree
*tp
, int *ws
, void *data
)
5256 struct free_lang_data_d
*fld
= (struct free_lang_data_d
*) data
;
5258 if (TREE_CODE (t
) == TREE_LIST
)
5261 /* Language specific nodes will be removed, so there is no need
5262 to gather anything under them. */
5263 if (is_lang_specific (t
))
5271 /* Note that walk_tree does not traverse every possible field in
5272 decls, so we have to do our own traversals here. */
5273 add_tree_to_fld_list (t
, fld
);
5275 fld_worklist_push (DECL_NAME (t
), fld
);
5276 fld_worklist_push (DECL_CONTEXT (t
), fld
);
5277 fld_worklist_push (DECL_SIZE (t
), fld
);
5278 fld_worklist_push (DECL_SIZE_UNIT (t
), fld
);
5280 /* We are going to remove everything under DECL_INITIAL for
5281 TYPE_DECLs. No point walking them. */
5282 if (TREE_CODE (t
) != TYPE_DECL
)
5283 fld_worklist_push (DECL_INITIAL (t
), fld
);
5285 fld_worklist_push (DECL_ATTRIBUTES (t
), fld
);
5286 fld_worklist_push (DECL_ABSTRACT_ORIGIN (t
), fld
);
5288 if (TREE_CODE (t
) == FUNCTION_DECL
)
5290 fld_worklist_push (DECL_ARGUMENTS (t
), fld
);
5291 fld_worklist_push (DECL_RESULT (t
), fld
);
5293 else if (TREE_CODE (t
) == TYPE_DECL
)
5295 fld_worklist_push (DECL_ORIGINAL_TYPE (t
), fld
);
5297 else if (TREE_CODE (t
) == FIELD_DECL
)
5299 fld_worklist_push (DECL_FIELD_OFFSET (t
), fld
);
5300 fld_worklist_push (DECL_BIT_FIELD_TYPE (t
), fld
);
5301 fld_worklist_push (DECL_FIELD_BIT_OFFSET (t
), fld
);
5302 fld_worklist_push (DECL_FCONTEXT (t
), fld
);
5305 if ((TREE_CODE (t
) == VAR_DECL
|| TREE_CODE (t
) == PARM_DECL
)
5306 && DECL_HAS_VALUE_EXPR_P (t
))
5307 fld_worklist_push (DECL_VALUE_EXPR (t
), fld
);
5309 if (TREE_CODE (t
) != FIELD_DECL
5310 && TREE_CODE (t
) != TYPE_DECL
)
5311 fld_worklist_push (TREE_CHAIN (t
), fld
);
5314 else if (TYPE_P (t
))
5316 /* Note that walk_tree does not traverse every possible field in
5317 types, so we have to do our own traversals here. */
5318 add_tree_to_fld_list (t
, fld
);
5320 if (!RECORD_OR_UNION_TYPE_P (t
))
5321 fld_worklist_push (TYPE_CACHED_VALUES (t
), fld
);
5322 fld_worklist_push (TYPE_SIZE (t
), fld
);
5323 fld_worklist_push (TYPE_SIZE_UNIT (t
), fld
);
5324 fld_worklist_push (TYPE_ATTRIBUTES (t
), fld
);
5325 fld_worklist_push (TYPE_POINTER_TO (t
), fld
);
5326 fld_worklist_push (TYPE_REFERENCE_TO (t
), fld
);
5327 fld_worklist_push (TYPE_NAME (t
), fld
);
5328 /* Do not walk TYPE_NEXT_PTR_TO or TYPE_NEXT_REF_TO. We do not stream
5329 them and thus do not and want not to reach unused pointer types
5331 if (!POINTER_TYPE_P (t
))
5332 fld_worklist_push (TYPE_MINVAL (t
), fld
);
5333 if (!RECORD_OR_UNION_TYPE_P (t
))
5334 fld_worklist_push (TYPE_MAXVAL (t
), fld
);
5335 fld_worklist_push (TYPE_MAIN_VARIANT (t
), fld
);
5336 /* Do not walk TYPE_NEXT_VARIANT. We do not stream it and thus
5337 do not and want not to reach unused variants this way. */
5338 if (TYPE_CONTEXT (t
))
5340 tree ctx
= TYPE_CONTEXT (t
);
5341 /* We adjust BLOCK TYPE_CONTEXTs to the innermost non-BLOCK one.
5342 So push that instead. */
5343 while (ctx
&& TREE_CODE (ctx
) == BLOCK
)
5344 ctx
= BLOCK_SUPERCONTEXT (ctx
);
5345 fld_worklist_push (ctx
, fld
);
5347 /* Do not walk TYPE_CANONICAL. We do not stream it and thus do not
5348 and want not to reach unused types this way. */
5350 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_BINFO (t
))
5354 FOR_EACH_VEC_ELT (*BINFO_BASE_BINFOS (TYPE_BINFO (t
)), i
, tem
)
5355 fld_worklist_push (TREE_TYPE (tem
), fld
);
5356 tem
= BINFO_VIRTUALS (TYPE_BINFO (t
));
5358 /* The Java FE overloads BINFO_VIRTUALS for its own purpose. */
5359 && TREE_CODE (tem
) == TREE_LIST
)
5362 fld_worklist_push (TREE_VALUE (tem
), fld
);
5363 tem
= TREE_CHAIN (tem
);
5367 if (RECORD_OR_UNION_TYPE_P (t
))
5370 /* Push all TYPE_FIELDS - there can be interleaving interesting
5371 and non-interesting things. */
5372 tem
= TYPE_FIELDS (t
);
5375 if (TREE_CODE (tem
) == FIELD_DECL
5376 || TREE_CODE (tem
) == TYPE_DECL
)
5377 fld_worklist_push (tem
, fld
);
5378 tem
= TREE_CHAIN (tem
);
5382 fld_worklist_push (TYPE_STUB_DECL (t
), fld
);
5385 else if (TREE_CODE (t
) == BLOCK
)
5388 for (tem
= BLOCK_VARS (t
); tem
; tem
= TREE_CHAIN (tem
))
5389 fld_worklist_push (tem
, fld
);
5390 for (tem
= BLOCK_SUBBLOCKS (t
); tem
; tem
= BLOCK_CHAIN (tem
))
5391 fld_worklist_push (tem
, fld
);
5392 fld_worklist_push (BLOCK_ABSTRACT_ORIGIN (t
), fld
);
5395 if (TREE_CODE (t
) != IDENTIFIER_NODE
5396 && CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_TYPED
))
5397 fld_worklist_push (TREE_TYPE (t
), fld
);
5403 /* Find decls and types in T. */
5406 find_decls_types (tree t
, struct free_lang_data_d
*fld
)
5410 if (!fld
->pset
->contains (t
))
5411 walk_tree (&t
, find_decls_types_r
, fld
, fld
->pset
);
5412 if (fld
->worklist
.is_empty ())
5414 t
= fld
->worklist
.pop ();
5418 /* Translate all the types in LIST with the corresponding runtime
5422 get_eh_types_for_runtime (tree list
)
5426 if (list
== NULL_TREE
)
5429 head
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
5431 list
= TREE_CHAIN (list
);
5434 tree n
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
5435 TREE_CHAIN (prev
) = n
;
5436 prev
= TREE_CHAIN (prev
);
5437 list
= TREE_CHAIN (list
);
5444 /* Find decls and types referenced in EH region R and store them in
5445 FLD->DECLS and FLD->TYPES. */
5448 find_decls_types_in_eh_region (eh_region r
, struct free_lang_data_d
*fld
)
5459 /* The types referenced in each catch must first be changed to the
5460 EH types used at runtime. This removes references to FE types
5462 for (c
= r
->u
.eh_try
.first_catch
; c
; c
= c
->next_catch
)
5464 c
->type_list
= get_eh_types_for_runtime (c
->type_list
);
5465 walk_tree (&c
->type_list
, find_decls_types_r
, fld
, fld
->pset
);
5470 case ERT_ALLOWED_EXCEPTIONS
:
5471 r
->u
.allowed
.type_list
5472 = get_eh_types_for_runtime (r
->u
.allowed
.type_list
);
5473 walk_tree (&r
->u
.allowed
.type_list
, find_decls_types_r
, fld
, fld
->pset
);
5476 case ERT_MUST_NOT_THROW
:
5477 walk_tree (&r
->u
.must_not_throw
.failure_decl
,
5478 find_decls_types_r
, fld
, fld
->pset
);
5484 /* Find decls and types referenced in cgraph node N and store them in
5485 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
5486 look for *every* kind of DECL and TYPE node reachable from N,
5487 including those embedded inside types and decls (i.e,, TYPE_DECLs,
5488 NAMESPACE_DECLs, etc). */
5491 find_decls_types_in_node (struct cgraph_node
*n
, struct free_lang_data_d
*fld
)
5494 struct function
*fn
;
5498 find_decls_types (n
->decl
, fld
);
5500 if (!gimple_has_body_p (n
->decl
))
5503 gcc_assert (current_function_decl
== NULL_TREE
&& cfun
== NULL
);
5505 fn
= DECL_STRUCT_FUNCTION (n
->decl
);
5507 /* Traverse locals. */
5508 FOR_EACH_LOCAL_DECL (fn
, ix
, t
)
5509 find_decls_types (t
, fld
);
5511 /* Traverse EH regions in FN. */
5514 FOR_ALL_EH_REGION_FN (r
, fn
)
5515 find_decls_types_in_eh_region (r
, fld
);
5518 /* Traverse every statement in FN. */
5519 FOR_EACH_BB_FN (bb
, fn
)
5521 gimple_stmt_iterator si
;
5524 for (si
= gsi_start_phis (bb
); !gsi_end_p (si
); gsi_next (&si
))
5526 gimple phi
= gsi_stmt (si
);
5528 for (i
= 0; i
< gimple_phi_num_args (phi
); i
++)
5530 tree
*arg_p
= gimple_phi_arg_def_ptr (phi
, i
);
5531 find_decls_types (*arg_p
, fld
);
5535 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
5537 gimple stmt
= gsi_stmt (si
);
5539 if (is_gimple_call (stmt
))
5540 find_decls_types (gimple_call_fntype (stmt
), fld
);
5542 for (i
= 0; i
< gimple_num_ops (stmt
); i
++)
5544 tree arg
= gimple_op (stmt
, i
);
5545 find_decls_types (arg
, fld
);
5552 /* Find decls and types referenced in varpool node N and store them in
5553 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
5554 look for *every* kind of DECL and TYPE node reachable from N,
5555 including those embedded inside types and decls (i.e,, TYPE_DECLs,
5556 NAMESPACE_DECLs, etc). */
5559 find_decls_types_in_var (varpool_node
*v
, struct free_lang_data_d
*fld
)
5561 find_decls_types (v
->decl
, fld
);
5564 /* If T needs an assembler name, have one created for it. */
5567 assign_assembler_name_if_neeeded (tree t
)
5569 if (need_assembler_name_p (t
))
5571 /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit
5572 diagnostics that use input_location to show locus
5573 information. The problem here is that, at this point,
5574 input_location is generally anchored to the end of the file
5575 (since the parser is long gone), so we don't have a good
5576 position to pin it to.
5578 To alleviate this problem, this uses the location of T's
5579 declaration. Examples of this are
5580 testsuite/g++.dg/template/cond2.C and
5581 testsuite/g++.dg/template/pr35240.C. */
5582 location_t saved_location
= input_location
;
5583 input_location
= DECL_SOURCE_LOCATION (t
);
5585 decl_assembler_name (t
);
5587 input_location
= saved_location
;
5592 /* Free language specific information for every operand and expression
5593 in every node of the call graph. This process operates in three stages:
5595 1- Every callgraph node and varpool node is traversed looking for
5596 decls and types embedded in them. This is a more exhaustive
5597 search than that done by find_referenced_vars, because it will
5598 also collect individual fields, decls embedded in types, etc.
5600 2- All the decls found are sent to free_lang_data_in_decl.
5602 3- All the types found are sent to free_lang_data_in_type.
5604 The ordering between decls and types is important because
5605 free_lang_data_in_decl sets assembler names, which includes
5606 mangling. So types cannot be freed up until assembler names have
5610 free_lang_data_in_cgraph (void)
5612 struct cgraph_node
*n
;
5614 struct free_lang_data_d fld
;
5619 /* Initialize sets and arrays to store referenced decls and types. */
5620 fld
.pset
= new hash_set
<tree
>;
5621 fld
.worklist
.create (0);
5622 fld
.decls
.create (100);
5623 fld
.types
.create (100);
5625 /* Find decls and types in the body of every function in the callgraph. */
5626 FOR_EACH_FUNCTION (n
)
5627 find_decls_types_in_node (n
, &fld
);
5629 FOR_EACH_VEC_SAFE_ELT (alias_pairs
, i
, p
)
5630 find_decls_types (p
->decl
, &fld
);
5632 /* Find decls and types in every varpool symbol. */
5633 FOR_EACH_VARIABLE (v
)
5634 find_decls_types_in_var (v
, &fld
);
5636 /* Set the assembler name on every decl found. We need to do this
5637 now because free_lang_data_in_decl will invalidate data needed
5638 for mangling. This breaks mangling on interdependent decls. */
5639 FOR_EACH_VEC_ELT (fld
.decls
, i
, t
)
5640 assign_assembler_name_if_neeeded (t
);
5642 /* Traverse every decl found freeing its language data. */
5643 FOR_EACH_VEC_ELT (fld
.decls
, i
, t
)
5644 free_lang_data_in_decl (t
);
5646 /* Traverse every type found freeing its language data. */
5647 FOR_EACH_VEC_ELT (fld
.types
, i
, t
)
5648 free_lang_data_in_type (t
);
5651 fld
.worklist
.release ();
5652 fld
.decls
.release ();
5653 fld
.types
.release ();
5657 /* Free resources that are used by FE but are not needed once they are done. */
5660 free_lang_data (void)
5664 /* If we are the LTO frontend we have freed lang-specific data already. */
5666 || !flag_generate_lto
)
5669 /* Allocate and assign alias sets to the standard integer types
5670 while the slots are still in the way the frontends generated them. */
5671 for (i
= 0; i
< itk_none
; ++i
)
5672 if (integer_types
[i
])
5673 TYPE_ALIAS_SET (integer_types
[i
]) = get_alias_set (integer_types
[i
]);
5675 /* Traverse the IL resetting language specific information for
5676 operands, expressions, etc. */
5677 free_lang_data_in_cgraph ();
5679 /* Create gimple variants for common types. */
5680 ptrdiff_type_node
= integer_type_node
;
5681 fileptr_type_node
= ptr_type_node
;
5683 /* Reset some langhooks. Do not reset types_compatible_p, it may
5684 still be used indirectly via the get_alias_set langhook. */
5685 lang_hooks
.dwarf_name
= lhd_dwarf_name
;
5686 lang_hooks
.decl_printable_name
= gimple_decl_printable_name
;
5687 /* We do not want the default decl_assembler_name implementation,
5688 rather if we have fixed everything we want a wrapper around it
5689 asserting that all non-local symbols already got their assembler
5690 name and only produce assembler names for local symbols. Or rather
5691 make sure we never call decl_assembler_name on local symbols and
5692 devise a separate, middle-end private scheme for it. */
5694 /* Reset diagnostic machinery. */
5695 tree_diagnostics_defaults (global_dc
);
5703 const pass_data pass_data_ipa_free_lang_data
=
5705 SIMPLE_IPA_PASS
, /* type */
5706 "*free_lang_data", /* name */
5707 OPTGROUP_NONE
, /* optinfo_flags */
5708 TV_IPA_FREE_LANG_DATA
, /* tv_id */
5709 0, /* properties_required */
5710 0, /* properties_provided */
5711 0, /* properties_destroyed */
5712 0, /* todo_flags_start */
5713 0, /* todo_flags_finish */
5716 class pass_ipa_free_lang_data
: public simple_ipa_opt_pass
5719 pass_ipa_free_lang_data (gcc::context
*ctxt
)
5720 : simple_ipa_opt_pass (pass_data_ipa_free_lang_data
, ctxt
)
5723 /* opt_pass methods: */
5724 virtual unsigned int execute (function
*) { return free_lang_data (); }
5726 }; // class pass_ipa_free_lang_data
5730 simple_ipa_opt_pass
*
5731 make_pass_ipa_free_lang_data (gcc::context
*ctxt
)
5733 return new pass_ipa_free_lang_data (ctxt
);
5736 /* The backbone of is_attribute_p(). ATTR_LEN is the string length of
5737 ATTR_NAME. Also used internally by remove_attribute(). */
5739 private_is_attribute_p (const char *attr_name
, size_t attr_len
, const_tree ident
)
5741 size_t ident_len
= IDENTIFIER_LENGTH (ident
);
5743 if (ident_len
== attr_len
)
5745 if (strcmp (attr_name
, IDENTIFIER_POINTER (ident
)) == 0)
5748 else if (ident_len
== attr_len
+ 4)
5750 /* There is the possibility that ATTR is 'text' and IDENT is
5752 const char *p
= IDENTIFIER_POINTER (ident
);
5753 if (p
[0] == '_' && p
[1] == '_'
5754 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
5755 && strncmp (attr_name
, p
+ 2, attr_len
) == 0)
5762 /* The backbone of lookup_attribute(). ATTR_LEN is the string length
5763 of ATTR_NAME, and LIST is not NULL_TREE. */
5765 private_lookup_attribute (const char *attr_name
, size_t attr_len
, tree list
)
5769 size_t ident_len
= IDENTIFIER_LENGTH (get_attribute_name (list
));
5771 if (ident_len
== attr_len
)
5773 if (!strcmp (attr_name
,
5774 IDENTIFIER_POINTER (get_attribute_name (list
))))
5777 /* TODO: If we made sure that attributes were stored in the
5778 canonical form without '__...__' (ie, as in 'text' as opposed
5779 to '__text__') then we could avoid the following case. */
5780 else if (ident_len
== attr_len
+ 4)
5782 const char *p
= IDENTIFIER_POINTER (get_attribute_name (list
));
5783 if (p
[0] == '_' && p
[1] == '_'
5784 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
5785 && strncmp (attr_name
, p
+ 2, attr_len
) == 0)
5788 list
= TREE_CHAIN (list
);
5794 /* Given an attribute name ATTR_NAME and a list of attributes LIST,
5795 return a pointer to the attribute's list first element if the attribute
5796 starts with ATTR_NAME. ATTR_NAME must be in the form 'text' (not
5800 private_lookup_attribute_by_prefix (const char *attr_name
, size_t attr_len
,
5805 size_t ident_len
= IDENTIFIER_LENGTH (get_attribute_name (list
));
5807 if (attr_len
> ident_len
)
5809 list
= TREE_CHAIN (list
);
5813 const char *p
= IDENTIFIER_POINTER (get_attribute_name (list
));
5815 if (strncmp (attr_name
, p
, attr_len
) == 0)
5818 /* TODO: If we made sure that attributes were stored in the
5819 canonical form without '__...__' (ie, as in 'text' as opposed
5820 to '__text__') then we could avoid the following case. */
5821 if (p
[0] == '_' && p
[1] == '_' &&
5822 strncmp (attr_name
, p
+ 2, attr_len
) == 0)
5825 list
= TREE_CHAIN (list
);
5832 /* A variant of lookup_attribute() that can be used with an identifier
5833 as the first argument, and where the identifier can be either
5834 'text' or '__text__'.
5836 Given an attribute ATTR_IDENTIFIER, and a list of attributes LIST,
5837 return a pointer to the attribute's list element if the attribute
5838 is part of the list, or NULL_TREE if not found. If the attribute
5839 appears more than once, this only returns the first occurrence; the
5840 TREE_CHAIN of the return value should be passed back in if further
5841 occurrences are wanted. ATTR_IDENTIFIER must be an identifier but
5842 can be in the form 'text' or '__text__'. */
5844 lookup_ident_attribute (tree attr_identifier
, tree list
)
5846 gcc_checking_assert (TREE_CODE (attr_identifier
) == IDENTIFIER_NODE
);
5850 gcc_checking_assert (TREE_CODE (get_attribute_name (list
))
5851 == IDENTIFIER_NODE
);
5853 /* Identifiers can be compared directly for equality. */
5854 if (attr_identifier
== get_attribute_name (list
))
5857 /* If they are not equal, they may still be one in the form
5858 'text' while the other one is in the form '__text__'. TODO:
5859 If we were storing attributes in normalized 'text' form, then
5860 this could all go away and we could take full advantage of
5861 the fact that we're comparing identifiers. :-) */
5863 size_t attr_len
= IDENTIFIER_LENGTH (attr_identifier
);
5864 size_t ident_len
= IDENTIFIER_LENGTH (get_attribute_name (list
));
5866 if (ident_len
== attr_len
+ 4)
5868 const char *p
= IDENTIFIER_POINTER (get_attribute_name (list
));
5869 const char *q
= IDENTIFIER_POINTER (attr_identifier
);
5870 if (p
[0] == '_' && p
[1] == '_'
5871 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
5872 && strncmp (q
, p
+ 2, attr_len
) == 0)
5875 else if (ident_len
+ 4 == attr_len
)
5877 const char *p
= IDENTIFIER_POINTER (get_attribute_name (list
));
5878 const char *q
= IDENTIFIER_POINTER (attr_identifier
);
5879 if (q
[0] == '_' && q
[1] == '_'
5880 && q
[attr_len
- 2] == '_' && q
[attr_len
- 1] == '_'
5881 && strncmp (q
+ 2, p
, ident_len
) == 0)
5885 list
= TREE_CHAIN (list
);
5891 /* Remove any instances of attribute ATTR_NAME in LIST and return the
5895 remove_attribute (const char *attr_name
, tree list
)
5898 size_t attr_len
= strlen (attr_name
);
5900 gcc_checking_assert (attr_name
[0] != '_');
5902 for (p
= &list
; *p
; )
5905 /* TODO: If we were storing attributes in normalized form, here
5906 we could use a simple strcmp(). */
5907 if (private_is_attribute_p (attr_name
, attr_len
, get_attribute_name (l
)))
5908 *p
= TREE_CHAIN (l
);
5910 p
= &TREE_CHAIN (l
);
5916 /* Return an attribute list that is the union of a1 and a2. */
5919 merge_attributes (tree a1
, tree a2
)
5923 /* Either one unset? Take the set one. */
5925 if ((attributes
= a1
) == 0)
5928 /* One that completely contains the other? Take it. */
5930 else if (a2
!= 0 && ! attribute_list_contained (a1
, a2
))
5932 if (attribute_list_contained (a2
, a1
))
5936 /* Pick the longest list, and hang on the other list. */
5938 if (list_length (a1
) < list_length (a2
))
5939 attributes
= a2
, a2
= a1
;
5941 for (; a2
!= 0; a2
= TREE_CHAIN (a2
))
5944 for (a
= lookup_ident_attribute (get_attribute_name (a2
),
5946 a
!= NULL_TREE
&& !attribute_value_equal (a
, a2
);
5947 a
= lookup_ident_attribute (get_attribute_name (a2
),
5952 a1
= copy_node (a2
);
5953 TREE_CHAIN (a1
) = attributes
;
5962 /* Given types T1 and T2, merge their attributes and return
5966 merge_type_attributes (tree t1
, tree t2
)
5968 return merge_attributes (TYPE_ATTRIBUTES (t1
),
5969 TYPE_ATTRIBUTES (t2
));
5972 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
5976 merge_decl_attributes (tree olddecl
, tree newdecl
)
5978 return merge_attributes (DECL_ATTRIBUTES (olddecl
),
5979 DECL_ATTRIBUTES (newdecl
));
5982 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
5984 /* Specialization of merge_decl_attributes for various Windows targets.
5986 This handles the following situation:
5988 __declspec (dllimport) int foo;
5991 The second instance of `foo' nullifies the dllimport. */
5994 merge_dllimport_decl_attributes (tree old
, tree new_tree
)
5997 int delete_dllimport_p
= 1;
5999 /* What we need to do here is remove from `old' dllimport if it doesn't
6000 appear in `new'. dllimport behaves like extern: if a declaration is
6001 marked dllimport and a definition appears later, then the object
6002 is not dllimport'd. We also remove a `new' dllimport if the old list
6003 contains dllexport: dllexport always overrides dllimport, regardless
6004 of the order of declaration. */
6005 if (!VAR_OR_FUNCTION_DECL_P (new_tree
))
6006 delete_dllimport_p
= 0;
6007 else if (DECL_DLLIMPORT_P (new_tree
)
6008 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (old
)))
6010 DECL_DLLIMPORT_P (new_tree
) = 0;
6011 warning (OPT_Wattributes
, "%q+D already declared with dllexport attribute: "
6012 "dllimport ignored", new_tree
);
6014 else if (DECL_DLLIMPORT_P (old
) && !DECL_DLLIMPORT_P (new_tree
))
6016 /* Warn about overriding a symbol that has already been used, e.g.:
6017 extern int __attribute__ ((dllimport)) foo;
6018 int* bar () {return &foo;}
6021 if (TREE_USED (old
))
6023 warning (0, "%q+D redeclared without dllimport attribute "
6024 "after being referenced with dll linkage", new_tree
);
6025 /* If we have used a variable's address with dllimport linkage,
6026 keep the old DECL_DLLIMPORT_P flag: the ADDR_EXPR using the
6027 decl may already have had TREE_CONSTANT computed.
6028 We still remove the attribute so that assembler code refers
6029 to '&foo rather than '_imp__foo'. */
6030 if (TREE_CODE (old
) == VAR_DECL
&& TREE_ADDRESSABLE (old
))
6031 DECL_DLLIMPORT_P (new_tree
) = 1;
6034 /* Let an inline definition silently override the external reference,
6035 but otherwise warn about attribute inconsistency. */
6036 else if (TREE_CODE (new_tree
) == VAR_DECL
6037 || !DECL_DECLARED_INLINE_P (new_tree
))
6038 warning (OPT_Wattributes
, "%q+D redeclared without dllimport attribute: "
6039 "previous dllimport ignored", new_tree
);
6042 delete_dllimport_p
= 0;
6044 a
= merge_attributes (DECL_ATTRIBUTES (old
), DECL_ATTRIBUTES (new_tree
));
6046 if (delete_dllimport_p
)
6047 a
= remove_attribute ("dllimport", a
);
6052 /* Handle a "dllimport" or "dllexport" attribute; arguments as in
6053 struct attribute_spec.handler. */
6056 handle_dll_attribute (tree
* pnode
, tree name
, tree args
, int flags
,
6062 /* These attributes may apply to structure and union types being created,
6063 but otherwise should pass to the declaration involved. */
6066 if (flags
& ((int) ATTR_FLAG_DECL_NEXT
| (int) ATTR_FLAG_FUNCTION_NEXT
6067 | (int) ATTR_FLAG_ARRAY_NEXT
))
6069 *no_add_attrs
= true;
6070 return tree_cons (name
, args
, NULL_TREE
);
6072 if (TREE_CODE (node
) == RECORD_TYPE
6073 || TREE_CODE (node
) == UNION_TYPE
)
6075 node
= TYPE_NAME (node
);
6081 warning (OPT_Wattributes
, "%qE attribute ignored",
6083 *no_add_attrs
= true;
6088 if (TREE_CODE (node
) != FUNCTION_DECL
6089 && TREE_CODE (node
) != VAR_DECL
6090 && TREE_CODE (node
) != TYPE_DECL
)
6092 *no_add_attrs
= true;
6093 warning (OPT_Wattributes
, "%qE attribute ignored",
6098 if (TREE_CODE (node
) == TYPE_DECL
6099 && TREE_CODE (TREE_TYPE (node
)) != RECORD_TYPE
6100 && TREE_CODE (TREE_TYPE (node
)) != UNION_TYPE
)
6102 *no_add_attrs
= true;
6103 warning (OPT_Wattributes
, "%qE attribute ignored",
6108 is_dllimport
= is_attribute_p ("dllimport", name
);
6110 /* Report error on dllimport ambiguities seen now before they cause
6114 /* Honor any target-specific overrides. */
6115 if (!targetm
.valid_dllimport_attribute_p (node
))
6116 *no_add_attrs
= true;
6118 else if (TREE_CODE (node
) == FUNCTION_DECL
6119 && DECL_DECLARED_INLINE_P (node
))
6121 warning (OPT_Wattributes
, "inline function %q+D declared as "
6122 " dllimport: attribute ignored", node
);
6123 *no_add_attrs
= true;
6125 /* Like MS, treat definition of dllimported variables and
6126 non-inlined functions on declaration as syntax errors. */
6127 else if (TREE_CODE (node
) == FUNCTION_DECL
&& DECL_INITIAL (node
))
6129 error ("function %q+D definition is marked dllimport", node
);
6130 *no_add_attrs
= true;
6133 else if (TREE_CODE (node
) == VAR_DECL
)
6135 if (DECL_INITIAL (node
))
6137 error ("variable %q+D definition is marked dllimport",
6139 *no_add_attrs
= true;
6142 /* `extern' needn't be specified with dllimport.
6143 Specify `extern' now and hope for the best. Sigh. */
6144 DECL_EXTERNAL (node
) = 1;
6145 /* Also, implicitly give dllimport'd variables declared within
6146 a function global scope, unless declared static. */
6147 if (current_function_decl
!= NULL_TREE
&& !TREE_STATIC (node
))
6148 TREE_PUBLIC (node
) = 1;
6151 if (*no_add_attrs
== false)
6152 DECL_DLLIMPORT_P (node
) = 1;
6154 else if (TREE_CODE (node
) == FUNCTION_DECL
6155 && DECL_DECLARED_INLINE_P (node
)
6156 && flag_keep_inline_dllexport
)
6157 /* An exported function, even if inline, must be emitted. */
6158 DECL_EXTERNAL (node
) = 0;
6160 /* Report error if symbol is not accessible at global scope. */
6161 if (!TREE_PUBLIC (node
)
6162 && (TREE_CODE (node
) == VAR_DECL
6163 || TREE_CODE (node
) == FUNCTION_DECL
))
6165 error ("external linkage required for symbol %q+D because of "
6166 "%qE attribute", node
, name
);
6167 *no_add_attrs
= true;
6170 /* A dllexport'd entity must have default visibility so that other
6171 program units (shared libraries or the main executable) can see
6172 it. A dllimport'd entity must have default visibility so that
6173 the linker knows that undefined references within this program
6174 unit can be resolved by the dynamic linker. */
6177 if (DECL_VISIBILITY_SPECIFIED (node
)
6178 && DECL_VISIBILITY (node
) != VISIBILITY_DEFAULT
)
6179 error ("%qE implies default visibility, but %qD has already "
6180 "been declared with a different visibility",
6182 DECL_VISIBILITY (node
) = VISIBILITY_DEFAULT
;
6183 DECL_VISIBILITY_SPECIFIED (node
) = 1;
6189 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
6191 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
6192 of the various TYPE_QUAL values. */
6195 set_type_quals (tree type
, int type_quals
)
6197 TYPE_READONLY (type
) = (type_quals
& TYPE_QUAL_CONST
) != 0;
6198 TYPE_VOLATILE (type
) = (type_quals
& TYPE_QUAL_VOLATILE
) != 0;
6199 TYPE_RESTRICT (type
) = (type_quals
& TYPE_QUAL_RESTRICT
) != 0;
6200 TYPE_ATOMIC (type
) = (type_quals
& TYPE_QUAL_ATOMIC
) != 0;
6201 TYPE_ADDR_SPACE (type
) = DECODE_QUAL_ADDR_SPACE (type_quals
);
6204 /* Returns true iff unqualified CAND and BASE are equivalent. */
6207 check_base_type (const_tree cand
, const_tree base
)
6209 return (TYPE_NAME (cand
) == TYPE_NAME (base
)
6210 /* Apparently this is needed for Objective-C. */
6211 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
6212 /* Check alignment. */
6213 && TYPE_ALIGN (cand
) == TYPE_ALIGN (base
)
6214 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
6215 TYPE_ATTRIBUTES (base
)));
6218 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
6221 check_qualified_type (const_tree cand
, const_tree base
, int type_quals
)
6223 return (TYPE_QUALS (cand
) == type_quals
6224 && check_base_type (cand
, base
));
6227 /* Returns true iff CAND is equivalent to BASE with ALIGN. */
6230 check_aligned_type (const_tree cand
, const_tree base
, unsigned int align
)
6232 return (TYPE_QUALS (cand
) == TYPE_QUALS (base
)
6233 && TYPE_NAME (cand
) == TYPE_NAME (base
)
6234 /* Apparently this is needed for Objective-C. */
6235 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
6236 /* Check alignment. */
6237 && TYPE_ALIGN (cand
) == align
6238 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
6239 TYPE_ATTRIBUTES (base
)));
6242 /* This function checks to see if TYPE matches the size one of the built-in
6243 atomic types, and returns that core atomic type. */
6246 find_atomic_core_type (tree type
)
6248 tree base_atomic_type
;
6250 /* Only handle complete types. */
6251 if (TYPE_SIZE (type
) == NULL_TREE
)
6254 HOST_WIDE_INT type_size
= tree_to_uhwi (TYPE_SIZE (type
));
6258 base_atomic_type
= atomicQI_type_node
;
6262 base_atomic_type
= atomicHI_type_node
;
6266 base_atomic_type
= atomicSI_type_node
;
6270 base_atomic_type
= atomicDI_type_node
;
6274 base_atomic_type
= atomicTI_type_node
;
6278 base_atomic_type
= NULL_TREE
;
6281 return base_atomic_type
;
6284 /* Return a version of the TYPE, qualified as indicated by the
6285 TYPE_QUALS, if one exists. If no qualified version exists yet,
6286 return NULL_TREE. */
6289 get_qualified_type (tree type
, int type_quals
)
6293 if (TYPE_QUALS (type
) == type_quals
)
6296 /* Search the chain of variants to see if there is already one there just
6297 like the one we need to have. If so, use that existing one. We must
6298 preserve the TYPE_NAME, since there is code that depends on this. */
6299 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
6300 if (check_qualified_type (t
, type
, type_quals
))
6306 /* Like get_qualified_type, but creates the type if it does not
6307 exist. This function never returns NULL_TREE. */
6310 build_qualified_type (tree type
, int type_quals
)
6314 /* See if we already have the appropriate qualified variant. */
6315 t
= get_qualified_type (type
, type_quals
);
6317 /* If not, build it. */
6320 t
= build_variant_type_copy (type
);
6321 set_type_quals (t
, type_quals
);
6323 if (((type_quals
& TYPE_QUAL_ATOMIC
) == TYPE_QUAL_ATOMIC
))
6325 /* See if this object can map to a basic atomic type. */
6326 tree atomic_type
= find_atomic_core_type (type
);
6329 /* Ensure the alignment of this type is compatible with
6330 the required alignment of the atomic type. */
6331 if (TYPE_ALIGN (atomic_type
) > TYPE_ALIGN (t
))
6332 TYPE_ALIGN (t
) = TYPE_ALIGN (atomic_type
);
6336 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
6337 /* Propagate structural equality. */
6338 SET_TYPE_STRUCTURAL_EQUALITY (t
);
6339 else if (TYPE_CANONICAL (type
) != type
)
6340 /* Build the underlying canonical type, since it is different
6343 tree c
= build_qualified_type (TYPE_CANONICAL (type
), type_quals
);
6344 TYPE_CANONICAL (t
) = TYPE_CANONICAL (c
);
6347 /* T is its own canonical type. */
6348 TYPE_CANONICAL (t
) = t
;
6355 /* Create a variant of type T with alignment ALIGN. */
6358 build_aligned_type (tree type
, unsigned int align
)
6362 if (TYPE_PACKED (type
)
6363 || TYPE_ALIGN (type
) == align
)
6366 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
6367 if (check_aligned_type (t
, type
, align
))
6370 t
= build_variant_type_copy (type
);
6371 TYPE_ALIGN (t
) = align
;
6376 /* Create a new distinct copy of TYPE. The new type is made its own
6377 MAIN_VARIANT. If TYPE requires structural equality checks, the
6378 resulting type requires structural equality checks; otherwise, its
6379 TYPE_CANONICAL points to itself. */
6382 build_distinct_type_copy (tree type
)
6384 tree t
= copy_node (type
);
6386 TYPE_POINTER_TO (t
) = 0;
6387 TYPE_REFERENCE_TO (t
) = 0;
6389 /* Set the canonical type either to a new equivalence class, or
6390 propagate the need for structural equality checks. */
6391 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
6392 SET_TYPE_STRUCTURAL_EQUALITY (t
);
6394 TYPE_CANONICAL (t
) = t
;
6396 /* Make it its own variant. */
6397 TYPE_MAIN_VARIANT (t
) = t
;
6398 TYPE_NEXT_VARIANT (t
) = 0;
6400 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
6401 whose TREE_TYPE is not t. This can also happen in the Ada
6402 frontend when using subtypes. */
6407 /* Create a new variant of TYPE, equivalent but distinct. This is so
6408 the caller can modify it. TYPE_CANONICAL for the return type will
6409 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
6410 are considered equal by the language itself (or that both types
6411 require structural equality checks). */
6414 build_variant_type_copy (tree type
)
6416 tree t
, m
= TYPE_MAIN_VARIANT (type
);
6418 t
= build_distinct_type_copy (type
);
6420 /* Since we're building a variant, assume that it is a non-semantic
6421 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
6422 TYPE_CANONICAL (t
) = TYPE_CANONICAL (type
);
6424 /* Add the new type to the chain of variants of TYPE. */
6425 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (m
);
6426 TYPE_NEXT_VARIANT (m
) = t
;
6427 TYPE_MAIN_VARIANT (t
) = m
;
6432 /* Return true if the from tree in both tree maps are equal. */
6435 tree_map_base_eq (const void *va
, const void *vb
)
6437 const struct tree_map_base
*const a
= (const struct tree_map_base
*) va
,
6438 *const b
= (const struct tree_map_base
*) vb
;
6439 return (a
->from
== b
->from
);
6442 /* Hash a from tree in a tree_base_map. */
6445 tree_map_base_hash (const void *item
)
6447 return htab_hash_pointer (((const struct tree_map_base
*)item
)->from
);
6450 /* Return true if this tree map structure is marked for garbage collection
6451 purposes. We simply return true if the from tree is marked, so that this
6452 structure goes away when the from tree goes away. */
6455 tree_map_base_marked_p (const void *p
)
6457 return ggc_marked_p (((const struct tree_map_base
*) p
)->from
);
6460 /* Hash a from tree in a tree_map. */
6463 tree_map_hash (const void *item
)
6465 return (((const struct tree_map
*) item
)->hash
);
6468 /* Hash a from tree in a tree_decl_map. */
6471 tree_decl_map_hash (const void *item
)
6473 return DECL_UID (((const struct tree_decl_map
*) item
)->base
.from
);
6476 /* Return the initialization priority for DECL. */
6479 decl_init_priority_lookup (tree decl
)
6481 symtab_node
*snode
= symtab_node::get (decl
);
6484 return DEFAULT_INIT_PRIORITY
;
6486 snode
->get_init_priority ();
6489 /* Return the finalization priority for DECL. */
6492 decl_fini_priority_lookup (tree decl
)
6494 cgraph_node
*node
= cgraph_node::get (decl
);
6497 return DEFAULT_INIT_PRIORITY
;
6499 node
->get_fini_priority ();
6502 /* Set the initialization priority for DECL to PRIORITY. */
6505 decl_init_priority_insert (tree decl
, priority_type priority
)
6507 struct symtab_node
*snode
;
6509 if (priority
== DEFAULT_INIT_PRIORITY
)
6511 snode
= symtab_node::get (decl
);
6515 else if (TREE_CODE (decl
) == VAR_DECL
)
6516 snode
= varpool_node::get_create (decl
);
6518 snode
= cgraph_node::get_create (decl
);
6519 snode
->set_init_priority (priority
);
6522 /* Set the finalization priority for DECL to PRIORITY. */
6525 decl_fini_priority_insert (tree decl
, priority_type priority
)
6527 struct cgraph_node
*node
;
6529 if (priority
== DEFAULT_INIT_PRIORITY
)
6531 node
= cgraph_node::get (decl
);
6536 node
= cgraph_node::get_create (decl
);
6537 node
->set_fini_priority (priority
);
6540 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
6543 print_debug_expr_statistics (void)
6545 fprintf (stderr
, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
6546 (long) htab_size (debug_expr_for_decl
),
6547 (long) htab_elements (debug_expr_for_decl
),
6548 htab_collisions (debug_expr_for_decl
));
6551 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
6554 print_value_expr_statistics (void)
6556 fprintf (stderr
, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
6557 (long) htab_size (value_expr_for_decl
),
6558 (long) htab_elements (value_expr_for_decl
),
6559 htab_collisions (value_expr_for_decl
));
6562 /* Lookup a debug expression for FROM, and return it if we find one. */
6565 decl_debug_expr_lookup (tree from
)
6567 struct tree_decl_map
*h
, in
;
6568 in
.base
.from
= from
;
6570 h
= (struct tree_decl_map
*)
6571 htab_find_with_hash (debug_expr_for_decl
, &in
, DECL_UID (from
));
6577 /* Insert a mapping FROM->TO in the debug expression hashtable. */
6580 decl_debug_expr_insert (tree from
, tree to
)
6582 struct tree_decl_map
*h
;
6585 h
= ggc_alloc
<tree_decl_map
> ();
6586 h
->base
.from
= from
;
6588 loc
= htab_find_slot_with_hash (debug_expr_for_decl
, h
, DECL_UID (from
),
6590 *(struct tree_decl_map
**) loc
= h
;
6593 /* Lookup a value expression for FROM, and return it if we find one. */
6596 decl_value_expr_lookup (tree from
)
6598 struct tree_decl_map
*h
, in
;
6599 in
.base
.from
= from
;
6601 h
= (struct tree_decl_map
*)
6602 htab_find_with_hash (value_expr_for_decl
, &in
, DECL_UID (from
));
6608 /* Insert a mapping FROM->TO in the value expression hashtable. */
6611 decl_value_expr_insert (tree from
, tree to
)
6613 struct tree_decl_map
*h
;
6616 h
= ggc_alloc
<tree_decl_map
> ();
6617 h
->base
.from
= from
;
6619 loc
= htab_find_slot_with_hash (value_expr_for_decl
, h
, DECL_UID (from
),
6621 *(struct tree_decl_map
**) loc
= h
;
6624 /* Lookup a vector of debug arguments for FROM, and return it if we
6628 decl_debug_args_lookup (tree from
)
6630 struct tree_vec_map
*h
, in
;
6632 if (!DECL_HAS_DEBUG_ARGS_P (from
))
6634 gcc_checking_assert (debug_args_for_decl
!= NULL
);
6635 in
.base
.from
= from
;
6636 h
= (struct tree_vec_map
*)
6637 htab_find_with_hash (debug_args_for_decl
, &in
, DECL_UID (from
));
6643 /* Insert a mapping FROM->empty vector of debug arguments in the value
6644 expression hashtable. */
6647 decl_debug_args_insert (tree from
)
6649 struct tree_vec_map
*h
;
6652 if (DECL_HAS_DEBUG_ARGS_P (from
))
6653 return decl_debug_args_lookup (from
);
6654 if (debug_args_for_decl
== NULL
)
6655 debug_args_for_decl
= htab_create_ggc (64, tree_vec_map_hash
,
6656 tree_vec_map_eq
, 0);
6657 h
= ggc_alloc
<tree_vec_map
> ();
6658 h
->base
.from
= from
;
6660 loc
= htab_find_slot_with_hash (debug_args_for_decl
, h
, DECL_UID (from
),
6662 *(struct tree_vec_map
**) loc
= h
;
6663 DECL_HAS_DEBUG_ARGS_P (from
) = 1;
6667 /* Hashing of types so that we don't make duplicates.
6668 The entry point is `type_hash_canon'. */
6670 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
6671 with types in the TREE_VALUE slots), by adding the hash codes
6672 of the individual types. */
6675 type_hash_list (const_tree list
, inchash::hash
&hstate
)
6679 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
6680 if (TREE_VALUE (tail
) != error_mark_node
)
6681 hstate
.add_object (TYPE_HASH (TREE_VALUE (tail
)));
6684 /* These are the Hashtable callback functions. */
6686 /* Returns true iff the types are equivalent. */
6689 type_hash_eq (const void *va
, const void *vb
)
6691 const struct type_hash
*const a
= (const struct type_hash
*) va
,
6692 *const b
= (const struct type_hash
*) vb
;
6694 /* First test the things that are the same for all types. */
6695 if (a
->hash
!= b
->hash
6696 || TREE_CODE (a
->type
) != TREE_CODE (b
->type
)
6697 || TREE_TYPE (a
->type
) != TREE_TYPE (b
->type
)
6698 || !attribute_list_equal (TYPE_ATTRIBUTES (a
->type
),
6699 TYPE_ATTRIBUTES (b
->type
))
6700 || (TREE_CODE (a
->type
) != COMPLEX_TYPE
6701 && TYPE_NAME (a
->type
) != TYPE_NAME (b
->type
)))
6704 /* Be careful about comparing arrays before and after the element type
6705 has been completed; don't compare TYPE_ALIGN unless both types are
6707 if (COMPLETE_TYPE_P (a
->type
) && COMPLETE_TYPE_P (b
->type
)
6708 && (TYPE_ALIGN (a
->type
) != TYPE_ALIGN (b
->type
)
6709 || TYPE_MODE (a
->type
) != TYPE_MODE (b
->type
)))
6712 switch (TREE_CODE (a
->type
))
6717 case REFERENCE_TYPE
:
6722 return TYPE_VECTOR_SUBPARTS (a
->type
) == TYPE_VECTOR_SUBPARTS (b
->type
);
6725 if (TYPE_VALUES (a
->type
) != TYPE_VALUES (b
->type
)
6726 && !(TYPE_VALUES (a
->type
)
6727 && TREE_CODE (TYPE_VALUES (a
->type
)) == TREE_LIST
6728 && TYPE_VALUES (b
->type
)
6729 && TREE_CODE (TYPE_VALUES (b
->type
)) == TREE_LIST
6730 && type_list_equal (TYPE_VALUES (a
->type
),
6731 TYPE_VALUES (b
->type
))))
6734 /* ... fall through ... */
6739 if (TYPE_PRECISION (a
->type
) != TYPE_PRECISION (b
->type
))
6741 return ((TYPE_MAX_VALUE (a
->type
) == TYPE_MAX_VALUE (b
->type
)
6742 || tree_int_cst_equal (TYPE_MAX_VALUE (a
->type
),
6743 TYPE_MAX_VALUE (b
->type
)))
6744 && (TYPE_MIN_VALUE (a
->type
) == TYPE_MIN_VALUE (b
->type
)
6745 || tree_int_cst_equal (TYPE_MIN_VALUE (a
->type
),
6746 TYPE_MIN_VALUE (b
->type
))));
6748 case FIXED_POINT_TYPE
:
6749 return TYPE_SATURATING (a
->type
) == TYPE_SATURATING (b
->type
);
6752 return TYPE_OFFSET_BASETYPE (a
->type
) == TYPE_OFFSET_BASETYPE (b
->type
);
6755 if (TYPE_METHOD_BASETYPE (a
->type
) == TYPE_METHOD_BASETYPE (b
->type
)
6756 && (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
6757 || (TYPE_ARG_TYPES (a
->type
)
6758 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
6759 && TYPE_ARG_TYPES (b
->type
)
6760 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
6761 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
6762 TYPE_ARG_TYPES (b
->type
)))))
6766 return TYPE_DOMAIN (a
->type
) == TYPE_DOMAIN (b
->type
);
6770 case QUAL_UNION_TYPE
:
6771 return (TYPE_FIELDS (a
->type
) == TYPE_FIELDS (b
->type
)
6772 || (TYPE_FIELDS (a
->type
)
6773 && TREE_CODE (TYPE_FIELDS (a
->type
)) == TREE_LIST
6774 && TYPE_FIELDS (b
->type
)
6775 && TREE_CODE (TYPE_FIELDS (b
->type
)) == TREE_LIST
6776 && type_list_equal (TYPE_FIELDS (a
->type
),
6777 TYPE_FIELDS (b
->type
))));
6780 if (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
6781 || (TYPE_ARG_TYPES (a
->type
)
6782 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
6783 && TYPE_ARG_TYPES (b
->type
)
6784 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
6785 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
6786 TYPE_ARG_TYPES (b
->type
))))
6794 if (lang_hooks
.types
.type_hash_eq
!= NULL
)
6795 return lang_hooks
.types
.type_hash_eq (a
->type
, b
->type
);
6800 /* Return the cached hash value. */
6803 type_hash_hash (const void *item
)
6805 return ((const struct type_hash
*) item
)->hash
;
6808 /* Given TYPE, and HASHCODE its hash code, return the canonical
6809 object for an identical type if one already exists.
6810 Otherwise, return TYPE, and record it as the canonical object.
6812 To use this function, first create a type of the sort you want.
6813 Then compute its hash code from the fields of the type that
6814 make it different from other similar types.
6815 Then call this function and use the value. */
6818 type_hash_canon (unsigned int hashcode
, tree type
)
6823 /* The hash table only contains main variants, so ensure that's what we're
6825 gcc_assert (TYPE_MAIN_VARIANT (type
) == type
);
6827 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
6828 must call that routine before comparing TYPE_ALIGNs. */
6834 loc
= htab_find_slot_with_hash (type_hash_table
, &in
, hashcode
, INSERT
);
6837 tree t1
= ((type_hash
*) *loc
)->type
;
6838 gcc_assert (TYPE_MAIN_VARIANT (t1
) == t1
);
6839 if (GATHER_STATISTICS
)
6841 tree_code_counts
[(int) TREE_CODE (type
)]--;
6842 tree_node_counts
[(int) t_kind
]--;
6843 tree_node_sizes
[(int) t_kind
] -= sizeof (struct tree_type_non_common
);
6849 struct type_hash
*h
;
6851 h
= ggc_alloc
<type_hash
> ();
6860 /* See if the data pointed to by the type hash table is marked. We consider
6861 it marked if the type is marked or if a debug type number or symbol
6862 table entry has been made for the type. */
6865 type_hash_marked_p (const void *p
)
6867 const_tree
const type
= ((const struct type_hash
*) p
)->type
;
6869 return ggc_marked_p (type
);
6873 print_type_hash_statistics (void)
6875 fprintf (stderr
, "Type hash: size %ld, %ld elements, %f collisions\n",
6876 (long) htab_size (type_hash_table
),
6877 (long) htab_elements (type_hash_table
),
6878 htab_collisions (type_hash_table
));
6881 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
6882 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
6883 by adding the hash codes of the individual attributes. */
6886 attribute_hash_list (const_tree list
, inchash::hash
&hstate
)
6890 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
6891 /* ??? Do we want to add in TREE_VALUE too? */
6892 hstate
.add_object (IDENTIFIER_HASH_VALUE (get_attribute_name (tail
)));
6895 /* Given two lists of attributes, return true if list l2 is
6896 equivalent to l1. */
6899 attribute_list_equal (const_tree l1
, const_tree l2
)
6904 return attribute_list_contained (l1
, l2
)
6905 && attribute_list_contained (l2
, l1
);
6908 /* Given two lists of attributes, return true if list L2 is
6909 completely contained within L1. */
6910 /* ??? This would be faster if attribute names were stored in a canonicalized
6911 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
6912 must be used to show these elements are equivalent (which they are). */
6913 /* ??? It's not clear that attributes with arguments will always be handled
6917 attribute_list_contained (const_tree l1
, const_tree l2
)
6921 /* First check the obvious, maybe the lists are identical. */
6925 /* Maybe the lists are similar. */
6926 for (t1
= l1
, t2
= l2
;
6928 && get_attribute_name (t1
) == get_attribute_name (t2
)
6929 && TREE_VALUE (t1
) == TREE_VALUE (t2
);
6930 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
6933 /* Maybe the lists are equal. */
6934 if (t1
== 0 && t2
== 0)
6937 for (; t2
!= 0; t2
= TREE_CHAIN (t2
))
6940 /* This CONST_CAST is okay because lookup_attribute does not
6941 modify its argument and the return value is assigned to a
6943 for (attr
= lookup_ident_attribute (get_attribute_name (t2
),
6944 CONST_CAST_TREE (l1
));
6945 attr
!= NULL_TREE
&& !attribute_value_equal (t2
, attr
);
6946 attr
= lookup_ident_attribute (get_attribute_name (t2
),
6950 if (attr
== NULL_TREE
)
6957 /* Given two lists of types
6958 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
6959 return 1 if the lists contain the same types in the same order.
6960 Also, the TREE_PURPOSEs must match. */
6963 type_list_equal (const_tree l1
, const_tree l2
)
6967 for (t1
= l1
, t2
= l2
; t1
&& t2
; t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
6968 if (TREE_VALUE (t1
) != TREE_VALUE (t2
)
6969 || (TREE_PURPOSE (t1
) != TREE_PURPOSE (t2
)
6970 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
))
6971 && (TREE_TYPE (TREE_PURPOSE (t1
))
6972 == TREE_TYPE (TREE_PURPOSE (t2
))))))
6978 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
6979 given by TYPE. If the argument list accepts variable arguments,
6980 then this function counts only the ordinary arguments. */
6983 type_num_arguments (const_tree type
)
6988 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
6989 /* If the function does not take a variable number of arguments,
6990 the last element in the list will have type `void'. */
6991 if (VOID_TYPE_P (TREE_VALUE (t
)))
6999 /* Nonzero if integer constants T1 and T2
7000 represent the same constant value. */
7003 tree_int_cst_equal (const_tree t1
, const_tree t2
)
7008 if (t1
== 0 || t2
== 0)
7011 if (TREE_CODE (t1
) == INTEGER_CST
7012 && TREE_CODE (t2
) == INTEGER_CST
7013 && wi::to_widest (t1
) == wi::to_widest (t2
))
7019 /* Return true if T is an INTEGER_CST whose numerical value (extended
7020 according to TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. */
7023 tree_fits_shwi_p (const_tree t
)
7025 return (t
!= NULL_TREE
7026 && TREE_CODE (t
) == INTEGER_CST
7027 && wi::fits_shwi_p (wi::to_widest (t
)));
7030 /* Return true if T is an INTEGER_CST whose numerical value (extended
7031 according to TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. */
7034 tree_fits_uhwi_p (const_tree t
)
7036 return (t
!= NULL_TREE
7037 && TREE_CODE (t
) == INTEGER_CST
7038 && wi::fits_uhwi_p (wi::to_widest (t
)));
7041 /* T is an INTEGER_CST whose numerical value (extended according to
7042 TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. Return that
7046 tree_to_shwi (const_tree t
)
7048 gcc_assert (tree_fits_shwi_p (t
));
7049 return TREE_INT_CST_LOW (t
);
7052 /* T is an INTEGER_CST whose numerical value (extended according to
7053 TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. Return that
7056 unsigned HOST_WIDE_INT
7057 tree_to_uhwi (const_tree t
)
7059 gcc_assert (tree_fits_uhwi_p (t
));
7060 return TREE_INT_CST_LOW (t
);
7063 /* Return the most significant (sign) bit of T. */
7066 tree_int_cst_sign_bit (const_tree t
)
7068 unsigned bitno
= TYPE_PRECISION (TREE_TYPE (t
)) - 1;
7070 return wi::extract_uhwi (t
, bitno
, 1);
7073 /* Return an indication of the sign of the integer constant T.
7074 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
7075 Note that -1 will never be returned if T's type is unsigned. */
7078 tree_int_cst_sgn (const_tree t
)
7080 if (wi::eq_p (t
, 0))
7082 else if (TYPE_UNSIGNED (TREE_TYPE (t
)))
7084 else if (wi::neg_p (t
))
7090 /* Return the minimum number of bits needed to represent VALUE in a
7091 signed or unsigned type, UNSIGNEDP says which. */
7094 tree_int_cst_min_precision (tree value
, signop sgn
)
7096 /* If the value is negative, compute its negative minus 1. The latter
7097 adjustment is because the absolute value of the largest negative value
7098 is one larger than the largest positive value. This is equivalent to
7099 a bit-wise negation, so use that operation instead. */
7101 if (tree_int_cst_sgn (value
) < 0)
7102 value
= fold_build1 (BIT_NOT_EXPR
, TREE_TYPE (value
), value
);
7104 /* Return the number of bits needed, taking into account the fact
7105 that we need one more bit for a signed than unsigned type.
7106 If value is 0 or -1, the minimum precision is 1 no matter
7107 whether unsignedp is true or false. */
7109 if (integer_zerop (value
))
7112 return tree_floor_log2 (value
) + 1 + (sgn
== SIGNED
? 1 : 0) ;
7115 /* Return truthvalue of whether T1 is the same tree structure as T2.
7116 Return 1 if they are the same.
7117 Return 0 if they are understandably different.
7118 Return -1 if either contains tree structure not understood by
7122 simple_cst_equal (const_tree t1
, const_tree t2
)
7124 enum tree_code code1
, code2
;
7130 if (t1
== 0 || t2
== 0)
7133 code1
= TREE_CODE (t1
);
7134 code2
= TREE_CODE (t2
);
7136 if (CONVERT_EXPR_CODE_P (code1
) || code1
== NON_LVALUE_EXPR
)
7138 if (CONVERT_EXPR_CODE_P (code2
)
7139 || code2
== NON_LVALUE_EXPR
)
7140 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7142 return simple_cst_equal (TREE_OPERAND (t1
, 0), t2
);
7145 else if (CONVERT_EXPR_CODE_P (code2
)
7146 || code2
== NON_LVALUE_EXPR
)
7147 return simple_cst_equal (t1
, TREE_OPERAND (t2
, 0));
7155 return wi::to_widest (t1
) == wi::to_widest (t2
);
7158 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1
), TREE_REAL_CST (t2
));
7161 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1
), TREE_FIXED_CST (t2
));
7164 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
7165 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
7166 TREE_STRING_LENGTH (t1
)));
7170 unsigned HOST_WIDE_INT idx
;
7171 vec
<constructor_elt
, va_gc
> *v1
= CONSTRUCTOR_ELTS (t1
);
7172 vec
<constructor_elt
, va_gc
> *v2
= CONSTRUCTOR_ELTS (t2
);
7174 if (vec_safe_length (v1
) != vec_safe_length (v2
))
7177 for (idx
= 0; idx
< vec_safe_length (v1
); ++idx
)
7178 /* ??? Should we handle also fields here? */
7179 if (!simple_cst_equal ((*v1
)[idx
].value
, (*v2
)[idx
].value
))
7185 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7188 cmp
= simple_cst_equal (CALL_EXPR_FN (t1
), CALL_EXPR_FN (t2
));
7191 if (call_expr_nargs (t1
) != call_expr_nargs (t2
))
7194 const_tree arg1
, arg2
;
7195 const_call_expr_arg_iterator iter1
, iter2
;
7196 for (arg1
= first_const_call_expr_arg (t1
, &iter1
),
7197 arg2
= first_const_call_expr_arg (t2
, &iter2
);
7199 arg1
= next_const_call_expr_arg (&iter1
),
7200 arg2
= next_const_call_expr_arg (&iter2
))
7202 cmp
= simple_cst_equal (arg1
, arg2
);
7206 return arg1
== arg2
;
7210 /* Special case: if either target is an unallocated VAR_DECL,
7211 it means that it's going to be unified with whatever the
7212 TARGET_EXPR is really supposed to initialize, so treat it
7213 as being equivalent to anything. */
7214 if ((TREE_CODE (TREE_OPERAND (t1
, 0)) == VAR_DECL
7215 && DECL_NAME (TREE_OPERAND (t1
, 0)) == NULL_TREE
7216 && !DECL_RTL_SET_P (TREE_OPERAND (t1
, 0)))
7217 || (TREE_CODE (TREE_OPERAND (t2
, 0)) == VAR_DECL
7218 && DECL_NAME (TREE_OPERAND (t2
, 0)) == NULL_TREE
7219 && !DECL_RTL_SET_P (TREE_OPERAND (t2
, 0))))
7222 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7227 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
7229 case WITH_CLEANUP_EXPR
:
7230 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7234 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t1
, 1));
7237 if (TREE_OPERAND (t1
, 1) == TREE_OPERAND (t2
, 1))
7238 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7252 /* This general rule works for most tree codes. All exceptions should be
7253 handled above. If this is a language-specific tree code, we can't
7254 trust what might be in the operand, so say we don't know
7256 if ((int) code1
>= (int) LAST_AND_UNUSED_TREE_CODE
)
7259 switch (TREE_CODE_CLASS (code1
))
7263 case tcc_comparison
:
7264 case tcc_expression
:
7268 for (i
= 0; i
< TREE_CODE_LENGTH (code1
); i
++)
7270 cmp
= simple_cst_equal (TREE_OPERAND (t1
, i
), TREE_OPERAND (t2
, i
));
7282 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
7283 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
7284 than U, respectively. */
7287 compare_tree_int (const_tree t
, unsigned HOST_WIDE_INT u
)
7289 if (tree_int_cst_sgn (t
) < 0)
7291 else if (!tree_fits_uhwi_p (t
))
7293 else if (TREE_INT_CST_LOW (t
) == u
)
7295 else if (TREE_INT_CST_LOW (t
) < u
)
7301 /* Return true if SIZE represents a constant size that is in bounds of
7302 what the middle-end and the backend accepts (covering not more than
7303 half of the address-space). */
7306 valid_constant_size_p (const_tree size
)
7308 if (! tree_fits_uhwi_p (size
)
7309 || TREE_OVERFLOW (size
)
7310 || tree_int_cst_sign_bit (size
) != 0)
7315 /* Return the precision of the type, or for a complex or vector type the
7316 precision of the type of its elements. */
7319 element_precision (const_tree type
)
7321 enum tree_code code
= TREE_CODE (type
);
7322 if (code
== COMPLEX_TYPE
|| code
== VECTOR_TYPE
)
7323 type
= TREE_TYPE (type
);
7325 return TYPE_PRECISION (type
);
7328 /* Return true if CODE represents an associative tree code. Otherwise
7331 associative_tree_code (enum tree_code code
)
7350 /* Return true if CODE represents a commutative tree code. Otherwise
7353 commutative_tree_code (enum tree_code code
)
7359 case MULT_HIGHPART_EXPR
:
7367 case UNORDERED_EXPR
:
7371 case TRUTH_AND_EXPR
:
7372 case TRUTH_XOR_EXPR
:
7374 case WIDEN_MULT_EXPR
:
7375 case VEC_WIDEN_MULT_HI_EXPR
:
7376 case VEC_WIDEN_MULT_LO_EXPR
:
7377 case VEC_WIDEN_MULT_EVEN_EXPR
:
7378 case VEC_WIDEN_MULT_ODD_EXPR
:
7387 /* Return true if CODE represents a ternary tree code for which the
7388 first two operands are commutative. Otherwise return false. */
7390 commutative_ternary_tree_code (enum tree_code code
)
7394 case WIDEN_MULT_PLUS_EXPR
:
7395 case WIDEN_MULT_MINUS_EXPR
:
7409 /* Generate a hash value for an expression. This can be used iteratively
7410 by passing a previous result as the HSTATE argument.
7412 This function is intended to produce the same hash for expressions which
7413 would compare equal using operand_equal_p. */
7415 add_expr (const_tree t
, inchash::hash
&hstate
)
7418 enum tree_code code
;
7419 enum tree_code_class tclass
;
7423 hstate
.merge_hash (0);
7427 code
= TREE_CODE (t
);
7431 /* Alas, constants aren't shared, so we can't rely on pointer
7434 hstate
.merge_hash (0);
7437 for (i
= 0; i
< TREE_INT_CST_NUNITS (t
); i
++)
7438 hstate
.add_wide_int (TREE_INT_CST_ELT (t
, i
));
7442 unsigned int val2
= real_hash (TREE_REAL_CST_PTR (t
));
7443 hstate
.merge_hash (val2
);
7448 unsigned int val2
= fixed_hash (TREE_FIXED_CST_PTR (t
));
7449 hstate
.merge_hash (val2
);
7453 hstate
.add ((const void *) TREE_STRING_POINTER (t
), TREE_STRING_LENGTH (t
));
7456 inchash::add_expr (TREE_REALPART (t
), hstate
);
7457 inchash::add_expr (TREE_IMAGPART (t
), hstate
);
7462 for (i
= 0; i
< VECTOR_CST_NELTS (t
); ++i
)
7463 inchash::add_expr (VECTOR_CST_ELT (t
, i
), hstate
);
7467 /* We can just compare by pointer. */
7468 hstate
.add_wide_int (SSA_NAME_VERSION (t
));
7470 case PLACEHOLDER_EXPR
:
7471 /* The node itself doesn't matter. */
7474 /* A list of expressions, for a CALL_EXPR or as the elements of a
7476 for (; t
; t
= TREE_CHAIN (t
))
7477 inchash::add_expr (TREE_VALUE (t
), hstate
);
7481 unsigned HOST_WIDE_INT idx
;
7483 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t
), idx
, field
, value
)
7485 inchash::add_expr (field
, hstate
);
7486 inchash::add_expr (value
, hstate
);
7491 /* When referring to a built-in FUNCTION_DECL, use the __builtin__ form.
7492 Otherwise nodes that compare equal according to operand_equal_p might
7493 get different hash codes. However, don't do this for machine specific
7494 or front end builtins, since the function code is overloaded in those
7496 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
7497 && builtin_decl_explicit_p (DECL_FUNCTION_CODE (t
)))
7499 t
= builtin_decl_explicit (DECL_FUNCTION_CODE (t
));
7500 code
= TREE_CODE (t
);
7504 tclass
= TREE_CODE_CLASS (code
);
7506 if (tclass
== tcc_declaration
)
7508 /* DECL's have a unique ID */
7509 hstate
.add_wide_int (DECL_UID (t
));
7513 gcc_assert (IS_EXPR_CODE_CLASS (tclass
));
7515 hstate
.add_object (code
);
7517 /* Don't hash the type, that can lead to having nodes which
7518 compare equal according to operand_equal_p, but which
7519 have different hash codes. */
7520 if (CONVERT_EXPR_CODE_P (code
)
7521 || code
== NON_LVALUE_EXPR
)
7523 /* Make sure to include signness in the hash computation. */
7524 hstate
.add_int (TYPE_UNSIGNED (TREE_TYPE (t
)));
7525 inchash::add_expr (TREE_OPERAND (t
, 0), hstate
);
7528 else if (commutative_tree_code (code
))
7530 /* It's a commutative expression. We want to hash it the same
7531 however it appears. We do this by first hashing both operands
7532 and then rehashing based on the order of their independent
7534 inchash::hash one
, two
;
7535 inchash::add_expr (TREE_OPERAND (t
, 0), one
);
7536 inchash::add_expr (TREE_OPERAND (t
, 1), two
);
7537 hstate
.add_commutative (one
, two
);
7540 for (i
= TREE_OPERAND_LENGTH (t
) - 1; i
>= 0; --i
)
7541 inchash::add_expr (TREE_OPERAND (t
, i
), hstate
);
7549 /* Constructors for pointer, array and function types.
7550 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
7551 constructed by language-dependent code, not here.) */
7553 /* Construct, lay out and return the type of pointers to TO_TYPE with
7554 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
7555 reference all of memory. If such a type has already been
7556 constructed, reuse it. */
7559 build_pointer_type_for_mode (tree to_type
, machine_mode mode
,
7564 if (to_type
== error_mark_node
)
7565 return error_mark_node
;
7567 /* If the pointed-to type has the may_alias attribute set, force
7568 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7569 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
7570 can_alias_all
= true;
7572 /* In some cases, languages will have things that aren't a POINTER_TYPE
7573 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
7574 In that case, return that type without regard to the rest of our
7577 ??? This is a kludge, but consistent with the way this function has
7578 always operated and there doesn't seem to be a good way to avoid this
7580 if (TYPE_POINTER_TO (to_type
) != 0
7581 && TREE_CODE (TYPE_POINTER_TO (to_type
)) != POINTER_TYPE
)
7582 return TYPE_POINTER_TO (to_type
);
7584 /* First, if we already have a type for pointers to TO_TYPE and it's
7585 the proper mode, use it. */
7586 for (t
= TYPE_POINTER_TO (to_type
); t
; t
= TYPE_NEXT_PTR_TO (t
))
7587 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
7590 t
= make_node (POINTER_TYPE
);
7592 TREE_TYPE (t
) = to_type
;
7593 SET_TYPE_MODE (t
, mode
);
7594 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
7595 TYPE_NEXT_PTR_TO (t
) = TYPE_POINTER_TO (to_type
);
7596 TYPE_POINTER_TO (to_type
) = t
;
7598 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
))
7599 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7600 else if (TYPE_CANONICAL (to_type
) != to_type
)
7602 = build_pointer_type_for_mode (TYPE_CANONICAL (to_type
),
7603 mode
, can_alias_all
);
7605 /* Lay out the type. This function has many callers that are concerned
7606 with expression-construction, and this simplifies them all. */
7612 /* By default build pointers in ptr_mode. */
7615 build_pointer_type (tree to_type
)
7617 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
7618 : TYPE_ADDR_SPACE (to_type
);
7619 machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
7620 return build_pointer_type_for_mode (to_type
, pointer_mode
, false);
7623 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
7626 build_reference_type_for_mode (tree to_type
, machine_mode mode
,
7631 if (to_type
== error_mark_node
)
7632 return error_mark_node
;
7634 /* If the pointed-to type has the may_alias attribute set, force
7635 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7636 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
7637 can_alias_all
= true;
7639 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
7640 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
7641 In that case, return that type without regard to the rest of our
7644 ??? This is a kludge, but consistent with the way this function has
7645 always operated and there doesn't seem to be a good way to avoid this
7647 if (TYPE_REFERENCE_TO (to_type
) != 0
7648 && TREE_CODE (TYPE_REFERENCE_TO (to_type
)) != REFERENCE_TYPE
)
7649 return TYPE_REFERENCE_TO (to_type
);
7651 /* First, if we already have a type for pointers to TO_TYPE and it's
7652 the proper mode, use it. */
7653 for (t
= TYPE_REFERENCE_TO (to_type
); t
; t
= TYPE_NEXT_REF_TO (t
))
7654 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
7657 t
= make_node (REFERENCE_TYPE
);
7659 TREE_TYPE (t
) = to_type
;
7660 SET_TYPE_MODE (t
, mode
);
7661 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
7662 TYPE_NEXT_REF_TO (t
) = TYPE_REFERENCE_TO (to_type
);
7663 TYPE_REFERENCE_TO (to_type
) = t
;
7665 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
))
7666 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7667 else if (TYPE_CANONICAL (to_type
) != to_type
)
7669 = build_reference_type_for_mode (TYPE_CANONICAL (to_type
),
7670 mode
, can_alias_all
);
7678 /* Build the node for the type of references-to-TO_TYPE by default
7682 build_reference_type (tree to_type
)
7684 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
7685 : TYPE_ADDR_SPACE (to_type
);
7686 machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
7687 return build_reference_type_for_mode (to_type
, pointer_mode
, false);
7690 #define MAX_INT_CACHED_PREC \
7691 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
7692 static GTY(()) tree nonstandard_integer_type_cache
[2 * MAX_INT_CACHED_PREC
+ 2];
7694 /* Builds a signed or unsigned integer type of precision PRECISION.
7695 Used for C bitfields whose precision does not match that of
7696 built-in target types. */
7698 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision
,
7704 unsignedp
= MAX_INT_CACHED_PREC
+ 1;
7706 if (precision
<= MAX_INT_CACHED_PREC
)
7708 itype
= nonstandard_integer_type_cache
[precision
+ unsignedp
];
7713 itype
= make_node (INTEGER_TYPE
);
7714 TYPE_PRECISION (itype
) = precision
;
7717 fixup_unsigned_type (itype
);
7719 fixup_signed_type (itype
);
7722 if (tree_fits_uhwi_p (TYPE_MAX_VALUE (itype
)))
7723 ret
= type_hash_canon (tree_to_uhwi (TYPE_MAX_VALUE (itype
)), itype
);
7724 if (precision
<= MAX_INT_CACHED_PREC
)
7725 nonstandard_integer_type_cache
[precision
+ unsignedp
] = ret
;
7730 /* Create a range of some discrete type TYPE (an INTEGER_TYPE, ENUMERAL_TYPE
7731 or BOOLEAN_TYPE) with low bound LOWVAL and high bound HIGHVAL. If SHARED
7732 is true, reuse such a type that has already been constructed. */
7735 build_range_type_1 (tree type
, tree lowval
, tree highval
, bool shared
)
7737 tree itype
= make_node (INTEGER_TYPE
);
7738 inchash::hash hstate
;
7740 TREE_TYPE (itype
) = type
;
7742 TYPE_MIN_VALUE (itype
) = fold_convert (type
, lowval
);
7743 TYPE_MAX_VALUE (itype
) = highval
? fold_convert (type
, highval
) : NULL
;
7745 TYPE_PRECISION (itype
) = TYPE_PRECISION (type
);
7746 SET_TYPE_MODE (itype
, TYPE_MODE (type
));
7747 TYPE_SIZE (itype
) = TYPE_SIZE (type
);
7748 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (type
);
7749 TYPE_ALIGN (itype
) = TYPE_ALIGN (type
);
7750 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (type
);
7755 if ((TYPE_MIN_VALUE (itype
)
7756 && TREE_CODE (TYPE_MIN_VALUE (itype
)) != INTEGER_CST
)
7757 || (TYPE_MAX_VALUE (itype
)
7758 && TREE_CODE (TYPE_MAX_VALUE (itype
)) != INTEGER_CST
))
7760 /* Since we cannot reliably merge this type, we need to compare it using
7761 structural equality checks. */
7762 SET_TYPE_STRUCTURAL_EQUALITY (itype
);
7766 inchash::add_expr (TYPE_MIN_VALUE (itype
), hstate
);
7767 inchash::add_expr (TYPE_MAX_VALUE (itype
), hstate
);
7768 hstate
.merge_hash (TYPE_HASH (type
));
7769 itype
= type_hash_canon (hstate
.end (), itype
);
7774 /* Wrapper around build_range_type_1 with SHARED set to true. */
7777 build_range_type (tree type
, tree lowval
, tree highval
)
7779 return build_range_type_1 (type
, lowval
, highval
, true);
7782 /* Wrapper around build_range_type_1 with SHARED set to false. */
7785 build_nonshared_range_type (tree type
, tree lowval
, tree highval
)
7787 return build_range_type_1 (type
, lowval
, highval
, false);
7790 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
7791 MAXVAL should be the maximum value in the domain
7792 (one less than the length of the array).
7794 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
7795 We don't enforce this limit, that is up to caller (e.g. language front end).
7796 The limit exists because the result is a signed type and we don't handle
7797 sizes that use more than one HOST_WIDE_INT. */
7800 build_index_type (tree maxval
)
7802 return build_range_type (sizetype
, size_zero_node
, maxval
);
7805 /* Return true if the debug information for TYPE, a subtype, should be emitted
7806 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
7807 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
7808 debug info and doesn't reflect the source code. */
7811 subrange_type_for_debug_p (const_tree type
, tree
*lowval
, tree
*highval
)
7813 tree base_type
= TREE_TYPE (type
), low
, high
;
7815 /* Subrange types have a base type which is an integral type. */
7816 if (!INTEGRAL_TYPE_P (base_type
))
7819 /* Get the real bounds of the subtype. */
7820 if (lang_hooks
.types
.get_subrange_bounds
)
7821 lang_hooks
.types
.get_subrange_bounds (type
, &low
, &high
);
7824 low
= TYPE_MIN_VALUE (type
);
7825 high
= TYPE_MAX_VALUE (type
);
7828 /* If the type and its base type have the same representation and the same
7829 name, then the type is not a subrange but a copy of the base type. */
7830 if ((TREE_CODE (base_type
) == INTEGER_TYPE
7831 || TREE_CODE (base_type
) == BOOLEAN_TYPE
)
7832 && int_size_in_bytes (type
) == int_size_in_bytes (base_type
)
7833 && tree_int_cst_equal (low
, TYPE_MIN_VALUE (base_type
))
7834 && tree_int_cst_equal (high
, TYPE_MAX_VALUE (base_type
))
7835 && TYPE_IDENTIFIER (type
) == TYPE_IDENTIFIER (base_type
))
7845 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
7846 and number of elements specified by the range of values of INDEX_TYPE.
7847 If SHARED is true, reuse such a type that has already been constructed. */
7850 build_array_type_1 (tree elt_type
, tree index_type
, bool shared
)
7854 if (TREE_CODE (elt_type
) == FUNCTION_TYPE
)
7856 error ("arrays of functions are not meaningful");
7857 elt_type
= integer_type_node
;
7860 t
= make_node (ARRAY_TYPE
);
7861 TREE_TYPE (t
) = elt_type
;
7862 TYPE_DOMAIN (t
) = index_type
;
7863 TYPE_ADDR_SPACE (t
) = TYPE_ADDR_SPACE (elt_type
);
7866 /* If the element type is incomplete at this point we get marked for
7867 structural equality. Do not record these types in the canonical
7869 if (TYPE_STRUCTURAL_EQUALITY_P (t
))
7874 inchash::hash hstate
;
7875 hstate
.add_object (TYPE_HASH (elt_type
));
7877 hstate
.add_object (TYPE_HASH (index_type
));
7878 t
= type_hash_canon (hstate
.end (), t
);
7881 if (TYPE_CANONICAL (t
) == t
)
7883 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type
)
7884 || (index_type
&& TYPE_STRUCTURAL_EQUALITY_P (index_type
)))
7885 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7886 else if (TYPE_CANONICAL (elt_type
) != elt_type
7887 || (index_type
&& TYPE_CANONICAL (index_type
) != index_type
))
7889 = build_array_type_1 (TYPE_CANONICAL (elt_type
),
7891 ? TYPE_CANONICAL (index_type
) : NULL_TREE
,
7898 /* Wrapper around build_array_type_1 with SHARED set to true. */
7901 build_array_type (tree elt_type
, tree index_type
)
7903 return build_array_type_1 (elt_type
, index_type
, true);
7906 /* Wrapper around build_array_type_1 with SHARED set to false. */
7909 build_nonshared_array_type (tree elt_type
, tree index_type
)
7911 return build_array_type_1 (elt_type
, index_type
, false);
7914 /* Return a representation of ELT_TYPE[NELTS], using indices of type
7918 build_array_type_nelts (tree elt_type
, unsigned HOST_WIDE_INT nelts
)
7920 return build_array_type (elt_type
, build_index_type (size_int (nelts
- 1)));
7923 /* Recursively examines the array elements of TYPE, until a non-array
7924 element type is found. */
7927 strip_array_types (tree type
)
7929 while (TREE_CODE (type
) == ARRAY_TYPE
)
7930 type
= TREE_TYPE (type
);
7935 /* Computes the canonical argument types from the argument type list
7938 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
7939 on entry to this function, or if any of the ARGTYPES are
7942 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
7943 true on entry to this function, or if any of the ARGTYPES are
7946 Returns a canonical argument list, which may be ARGTYPES when the
7947 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
7948 true) or would not differ from ARGTYPES. */
7951 maybe_canonicalize_argtypes (tree argtypes
,
7952 bool *any_structural_p
,
7953 bool *any_noncanonical_p
)
7956 bool any_noncanonical_argtypes_p
= false;
7958 for (arg
= argtypes
; arg
&& !(*any_structural_p
); arg
= TREE_CHAIN (arg
))
7960 if (!TREE_VALUE (arg
) || TREE_VALUE (arg
) == error_mark_node
)
7961 /* Fail gracefully by stating that the type is structural. */
7962 *any_structural_p
= true;
7963 else if (TYPE_STRUCTURAL_EQUALITY_P (TREE_VALUE (arg
)))
7964 *any_structural_p
= true;
7965 else if (TYPE_CANONICAL (TREE_VALUE (arg
)) != TREE_VALUE (arg
)
7966 || TREE_PURPOSE (arg
))
7967 /* If the argument has a default argument, we consider it
7968 non-canonical even though the type itself is canonical.
7969 That way, different variants of function and method types
7970 with default arguments will all point to the variant with
7971 no defaults as their canonical type. */
7972 any_noncanonical_argtypes_p
= true;
7975 if (*any_structural_p
)
7978 if (any_noncanonical_argtypes_p
)
7980 /* Build the canonical list of argument types. */
7981 tree canon_argtypes
= NULL_TREE
;
7982 bool is_void
= false;
7984 for (arg
= argtypes
; arg
; arg
= TREE_CHAIN (arg
))
7986 if (arg
== void_list_node
)
7989 canon_argtypes
= tree_cons (NULL_TREE
,
7990 TYPE_CANONICAL (TREE_VALUE (arg
)),
7994 canon_argtypes
= nreverse (canon_argtypes
);
7996 canon_argtypes
= chainon (canon_argtypes
, void_list_node
);
7998 /* There is a non-canonical type. */
7999 *any_noncanonical_p
= true;
8000 return canon_argtypes
;
8003 /* The canonical argument types are the same as ARGTYPES. */
8007 /* Construct, lay out and return
8008 the type of functions returning type VALUE_TYPE
8009 given arguments of types ARG_TYPES.
8010 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
8011 are data type nodes for the arguments of the function.
8012 If such a type has already been constructed, reuse it. */
8015 build_function_type (tree value_type
, tree arg_types
)
8018 inchash::hash hstate
;
8019 bool any_structural_p
, any_noncanonical_p
;
8020 tree canon_argtypes
;
8022 if (TREE_CODE (value_type
) == FUNCTION_TYPE
)
8024 error ("function return type cannot be function");
8025 value_type
= integer_type_node
;
8028 /* Make a node of the sort we want. */
8029 t
= make_node (FUNCTION_TYPE
);
8030 TREE_TYPE (t
) = value_type
;
8031 TYPE_ARG_TYPES (t
) = arg_types
;
8033 /* If we already have such a type, use the old one. */
8034 hstate
.add_object (TYPE_HASH (value_type
));
8035 type_hash_list (arg_types
, hstate
);
8036 t
= type_hash_canon (hstate
.end (), t
);
8038 /* Set up the canonical type. */
8039 any_structural_p
= TYPE_STRUCTURAL_EQUALITY_P (value_type
);
8040 any_noncanonical_p
= TYPE_CANONICAL (value_type
) != value_type
;
8041 canon_argtypes
= maybe_canonicalize_argtypes (arg_types
,
8043 &any_noncanonical_p
);
8044 if (any_structural_p
)
8045 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8046 else if (any_noncanonical_p
)
8047 TYPE_CANONICAL (t
) = build_function_type (TYPE_CANONICAL (value_type
),
8050 if (!COMPLETE_TYPE_P (t
))
8055 /* Build a function type. The RETURN_TYPE is the type returned by the
8056 function. If VAARGS is set, no void_type_node is appended to the
8057 the list. ARGP must be always be terminated be a NULL_TREE. */
8060 build_function_type_list_1 (bool vaargs
, tree return_type
, va_list argp
)
8064 t
= va_arg (argp
, tree
);
8065 for (args
= NULL_TREE
; t
!= NULL_TREE
; t
= va_arg (argp
, tree
))
8066 args
= tree_cons (NULL_TREE
, t
, args
);
8071 if (args
!= NULL_TREE
)
8072 args
= nreverse (args
);
8073 gcc_assert (last
!= void_list_node
);
8075 else if (args
== NULL_TREE
)
8076 args
= void_list_node
;
8080 args
= nreverse (args
);
8081 TREE_CHAIN (last
) = void_list_node
;
8083 args
= build_function_type (return_type
, args
);
8088 /* Build a function type. The RETURN_TYPE is the type returned by the
8089 function. If additional arguments are provided, they are
8090 additional argument types. The list of argument types must always
8091 be terminated by NULL_TREE. */
8094 build_function_type_list (tree return_type
, ...)
8099 va_start (p
, return_type
);
8100 args
= build_function_type_list_1 (false, return_type
, p
);
8105 /* Build a variable argument function type. The RETURN_TYPE is the
8106 type returned by the function. If additional arguments are provided,
8107 they are additional argument types. The list of argument types must
8108 always be terminated by NULL_TREE. */
8111 build_varargs_function_type_list (tree return_type
, ...)
8116 va_start (p
, return_type
);
8117 args
= build_function_type_list_1 (true, return_type
, p
);
8123 /* Build a function type. RETURN_TYPE is the type returned by the
8124 function; VAARGS indicates whether the function takes varargs. The
8125 function takes N named arguments, the types of which are provided in
8129 build_function_type_array_1 (bool vaargs
, tree return_type
, int n
,
8133 tree t
= vaargs
? NULL_TREE
: void_list_node
;
8135 for (i
= n
- 1; i
>= 0; i
--)
8136 t
= tree_cons (NULL_TREE
, arg_types
[i
], t
);
8138 return build_function_type (return_type
, t
);
8141 /* Build a function type. RETURN_TYPE is the type returned by the
8142 function. The function takes N named arguments, the types of which
8143 are provided in ARG_TYPES. */
8146 build_function_type_array (tree return_type
, int n
, tree
*arg_types
)
8148 return build_function_type_array_1 (false, return_type
, n
, arg_types
);
8151 /* Build a variable argument function type. RETURN_TYPE is the type
8152 returned by the function. The function takes N named arguments, the
8153 types of which are provided in ARG_TYPES. */
8156 build_varargs_function_type_array (tree return_type
, int n
, tree
*arg_types
)
8158 return build_function_type_array_1 (true, return_type
, n
, arg_types
);
8161 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
8162 and ARGTYPES (a TREE_LIST) are the return type and arguments types
8163 for the method. An implicit additional parameter (of type
8164 pointer-to-BASETYPE) is added to the ARGTYPES. */
8167 build_method_type_directly (tree basetype
,
8173 inchash::hash hstate
;
8174 bool any_structural_p
, any_noncanonical_p
;
8175 tree canon_argtypes
;
8177 /* Make a node of the sort we want. */
8178 t
= make_node (METHOD_TYPE
);
8180 TYPE_METHOD_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
8181 TREE_TYPE (t
) = rettype
;
8182 ptype
= build_pointer_type (basetype
);
8184 /* The actual arglist for this function includes a "hidden" argument
8185 which is "this". Put it into the list of argument types. */
8186 argtypes
= tree_cons (NULL_TREE
, ptype
, argtypes
);
8187 TYPE_ARG_TYPES (t
) = argtypes
;
8189 /* If we already have such a type, use the old one. */
8190 hstate
.add_object (TYPE_HASH (basetype
));
8191 hstate
.add_object (TYPE_HASH (rettype
));
8192 type_hash_list (argtypes
, hstate
);
8193 t
= type_hash_canon (hstate
.end (), t
);
8195 /* Set up the canonical type. */
8197 = (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
8198 || TYPE_STRUCTURAL_EQUALITY_P (rettype
));
8200 = (TYPE_CANONICAL (basetype
) != basetype
8201 || TYPE_CANONICAL (rettype
) != rettype
);
8202 canon_argtypes
= maybe_canonicalize_argtypes (TREE_CHAIN (argtypes
),
8204 &any_noncanonical_p
);
8205 if (any_structural_p
)
8206 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8207 else if (any_noncanonical_p
)
8209 = build_method_type_directly (TYPE_CANONICAL (basetype
),
8210 TYPE_CANONICAL (rettype
),
8212 if (!COMPLETE_TYPE_P (t
))
8218 /* Construct, lay out and return the type of methods belonging to class
8219 BASETYPE and whose arguments and values are described by TYPE.
8220 If that type exists already, reuse it.
8221 TYPE must be a FUNCTION_TYPE node. */
8224 build_method_type (tree basetype
, tree type
)
8226 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
8228 return build_method_type_directly (basetype
,
8230 TYPE_ARG_TYPES (type
));
8233 /* Construct, lay out and return the type of offsets to a value
8234 of type TYPE, within an object of type BASETYPE.
8235 If a suitable offset type exists already, reuse it. */
8238 build_offset_type (tree basetype
, tree type
)
8241 inchash::hash hstate
;
8243 /* Make a node of the sort we want. */
8244 t
= make_node (OFFSET_TYPE
);
8246 TYPE_OFFSET_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
8247 TREE_TYPE (t
) = type
;
8249 /* If we already have such a type, use the old one. */
8250 hstate
.add_object (TYPE_HASH (basetype
));
8251 hstate
.add_object (TYPE_HASH (type
));
8252 t
= type_hash_canon (hstate
.end (), t
);
8254 if (!COMPLETE_TYPE_P (t
))
8257 if (TYPE_CANONICAL (t
) == t
)
8259 if (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
8260 || TYPE_STRUCTURAL_EQUALITY_P (type
))
8261 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8262 else if (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)) != basetype
8263 || TYPE_CANONICAL (type
) != type
)
8265 = build_offset_type (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)),
8266 TYPE_CANONICAL (type
));
8272 /* Create a complex type whose components are COMPONENT_TYPE. */
8275 build_complex_type (tree component_type
)
8278 inchash::hash hstate
;
8280 gcc_assert (INTEGRAL_TYPE_P (component_type
)
8281 || SCALAR_FLOAT_TYPE_P (component_type
)
8282 || FIXED_POINT_TYPE_P (component_type
));
8284 /* Make a node of the sort we want. */
8285 t
= make_node (COMPLEX_TYPE
);
8287 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (component_type
);
8289 /* If we already have such a type, use the old one. */
8290 hstate
.add_object (TYPE_HASH (component_type
));
8291 t
= type_hash_canon (hstate
.end (), t
);
8293 if (!COMPLETE_TYPE_P (t
))
8296 if (TYPE_CANONICAL (t
) == t
)
8298 if (TYPE_STRUCTURAL_EQUALITY_P (component_type
))
8299 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8300 else if (TYPE_CANONICAL (component_type
) != component_type
)
8302 = build_complex_type (TYPE_CANONICAL (component_type
));
8305 /* We need to create a name, since complex is a fundamental type. */
8306 if (! TYPE_NAME (t
))
8309 if (component_type
== char_type_node
)
8310 name
= "complex char";
8311 else if (component_type
== signed_char_type_node
)
8312 name
= "complex signed char";
8313 else if (component_type
== unsigned_char_type_node
)
8314 name
= "complex unsigned char";
8315 else if (component_type
== short_integer_type_node
)
8316 name
= "complex short int";
8317 else if (component_type
== short_unsigned_type_node
)
8318 name
= "complex short unsigned int";
8319 else if (component_type
== integer_type_node
)
8320 name
= "complex int";
8321 else if (component_type
== unsigned_type_node
)
8322 name
= "complex unsigned int";
8323 else if (component_type
== long_integer_type_node
)
8324 name
= "complex long int";
8325 else if (component_type
== long_unsigned_type_node
)
8326 name
= "complex long unsigned int";
8327 else if (component_type
== long_long_integer_type_node
)
8328 name
= "complex long long int";
8329 else if (component_type
== long_long_unsigned_type_node
)
8330 name
= "complex long long unsigned int";
8335 TYPE_NAME (t
) = build_decl (UNKNOWN_LOCATION
, TYPE_DECL
,
8336 get_identifier (name
), t
);
8339 return build_qualified_type (t
, TYPE_QUALS (component_type
));
8342 /* If TYPE is a real or complex floating-point type and the target
8343 does not directly support arithmetic on TYPE then return the wider
8344 type to be used for arithmetic on TYPE. Otherwise, return
8348 excess_precision_type (tree type
)
8350 if (flag_excess_precision
!= EXCESS_PRECISION_FAST
)
8352 int flt_eval_method
= TARGET_FLT_EVAL_METHOD
;
8353 switch (TREE_CODE (type
))
8356 switch (flt_eval_method
)
8359 if (TYPE_MODE (type
) == TYPE_MODE (float_type_node
))
8360 return double_type_node
;
8363 if (TYPE_MODE (type
) == TYPE_MODE (float_type_node
)
8364 || TYPE_MODE (type
) == TYPE_MODE (double_type_node
))
8365 return long_double_type_node
;
8372 if (TREE_CODE (TREE_TYPE (type
)) != REAL_TYPE
)
8374 switch (flt_eval_method
)
8377 if (TYPE_MODE (TREE_TYPE (type
)) == TYPE_MODE (float_type_node
))
8378 return complex_double_type_node
;
8381 if (TYPE_MODE (TREE_TYPE (type
)) == TYPE_MODE (float_type_node
)
8382 || (TYPE_MODE (TREE_TYPE (type
))
8383 == TYPE_MODE (double_type_node
)))
8384 return complex_long_double_type_node
;
8397 /* Return OP, stripped of any conversions to wider types as much as is safe.
8398 Converting the value back to OP's type makes a value equivalent to OP.
8400 If FOR_TYPE is nonzero, we return a value which, if converted to
8401 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
8403 OP must have integer, real or enumeral type. Pointers are not allowed!
8405 There are some cases where the obvious value we could return
8406 would regenerate to OP if converted to OP's type,
8407 but would not extend like OP to wider types.
8408 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
8409 For example, if OP is (unsigned short)(signed char)-1,
8410 we avoid returning (signed char)-1 if FOR_TYPE is int,
8411 even though extending that to an unsigned short would regenerate OP,
8412 since the result of extending (signed char)-1 to (int)
8413 is different from (int) OP. */
8416 get_unwidened (tree op
, tree for_type
)
8418 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
8419 tree type
= TREE_TYPE (op
);
8421 = TYPE_PRECISION (for_type
!= 0 ? for_type
: type
);
8423 = (for_type
!= 0 && for_type
!= type
8424 && final_prec
> TYPE_PRECISION (type
)
8425 && TYPE_UNSIGNED (type
));
8428 while (CONVERT_EXPR_P (op
))
8432 /* TYPE_PRECISION on vector types has different meaning
8433 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
8434 so avoid them here. */
8435 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op
, 0))) == VECTOR_TYPE
)
8438 bitschange
= TYPE_PRECISION (TREE_TYPE (op
))
8439 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0)));
8441 /* Truncations are many-one so cannot be removed.
8442 Unless we are later going to truncate down even farther. */
8444 && final_prec
> TYPE_PRECISION (TREE_TYPE (op
)))
8447 /* See what's inside this conversion. If we decide to strip it,
8449 op
= TREE_OPERAND (op
, 0);
8451 /* If we have not stripped any zero-extensions (uns is 0),
8452 we can strip any kind of extension.
8453 If we have previously stripped a zero-extension,
8454 only zero-extensions can safely be stripped.
8455 Any extension can be stripped if the bits it would produce
8456 are all going to be discarded later by truncating to FOR_TYPE. */
8460 if (! uns
|| final_prec
<= TYPE_PRECISION (TREE_TYPE (op
)))
8462 /* TYPE_UNSIGNED says whether this is a zero-extension.
8463 Let's avoid computing it if it does not affect WIN
8464 and if UNS will not be needed again. */
8466 || CONVERT_EXPR_P (op
))
8467 && TYPE_UNSIGNED (TREE_TYPE (op
)))
8475 /* If we finally reach a constant see if it fits in for_type and
8476 in that case convert it. */
8478 && TREE_CODE (win
) == INTEGER_CST
8479 && TREE_TYPE (win
) != for_type
8480 && int_fits_type_p (win
, for_type
))
8481 win
= fold_convert (for_type
, win
);
8486 /* Return OP or a simpler expression for a narrower value
8487 which can be sign-extended or zero-extended to give back OP.
8488 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
8489 or 0 if the value should be sign-extended. */
8492 get_narrower (tree op
, int *unsignedp_ptr
)
8497 bool integral_p
= INTEGRAL_TYPE_P (TREE_TYPE (op
));
8499 while (TREE_CODE (op
) == NOP_EXPR
)
8502 = (TYPE_PRECISION (TREE_TYPE (op
))
8503 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0))));
8505 /* Truncations are many-one so cannot be removed. */
8509 /* See what's inside this conversion. If we decide to strip it,
8514 op
= TREE_OPERAND (op
, 0);
8515 /* An extension: the outermost one can be stripped,
8516 but remember whether it is zero or sign extension. */
8518 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
8519 /* Otherwise, if a sign extension has been stripped,
8520 only sign extensions can now be stripped;
8521 if a zero extension has been stripped, only zero-extensions. */
8522 else if (uns
!= TYPE_UNSIGNED (TREE_TYPE (op
)))
8526 else /* bitschange == 0 */
8528 /* A change in nominal type can always be stripped, but we must
8529 preserve the unsignedness. */
8531 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
8533 op
= TREE_OPERAND (op
, 0);
8534 /* Keep trying to narrow, but don't assign op to win if it
8535 would turn an integral type into something else. */
8536 if (INTEGRAL_TYPE_P (TREE_TYPE (op
)) != integral_p
)
8543 if (TREE_CODE (op
) == COMPONENT_REF
8544 /* Since type_for_size always gives an integer type. */
8545 && TREE_CODE (TREE_TYPE (op
)) != REAL_TYPE
8546 && TREE_CODE (TREE_TYPE (op
)) != FIXED_POINT_TYPE
8547 /* Ensure field is laid out already. */
8548 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0
8549 && tree_fits_uhwi_p (DECL_SIZE (TREE_OPERAND (op
, 1))))
8551 unsigned HOST_WIDE_INT innerprec
8552 = tree_to_uhwi (DECL_SIZE (TREE_OPERAND (op
, 1)));
8553 int unsignedp
= (DECL_UNSIGNED (TREE_OPERAND (op
, 1))
8554 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op
, 1))));
8555 tree type
= lang_hooks
.types
.type_for_size (innerprec
, unsignedp
);
8557 /* We can get this structure field in a narrower type that fits it,
8558 but the resulting extension to its nominal type (a fullword type)
8559 must satisfy the same conditions as for other extensions.
8561 Do this only for fields that are aligned (not bit-fields),
8562 because when bit-field insns will be used there is no
8563 advantage in doing this. */
8565 if (innerprec
< TYPE_PRECISION (TREE_TYPE (op
))
8566 && ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1))
8567 && (first
|| uns
== DECL_UNSIGNED (TREE_OPERAND (op
, 1)))
8571 uns
= DECL_UNSIGNED (TREE_OPERAND (op
, 1));
8572 win
= fold_convert (type
, op
);
8576 *unsignedp_ptr
= uns
;
8580 /* Returns true if integer constant C has a value that is permissible
8581 for type TYPE (an INTEGER_TYPE). */
8584 int_fits_type_p (const_tree c
, const_tree type
)
8586 tree type_low_bound
, type_high_bound
;
8587 bool ok_for_low_bound
, ok_for_high_bound
;
8588 signop sgn_c
= TYPE_SIGN (TREE_TYPE (c
));
8591 type_low_bound
= TYPE_MIN_VALUE (type
);
8592 type_high_bound
= TYPE_MAX_VALUE (type
);
8594 /* If at least one bound of the type is a constant integer, we can check
8595 ourselves and maybe make a decision. If no such decision is possible, but
8596 this type is a subtype, try checking against that. Otherwise, use
8597 fits_to_tree_p, which checks against the precision.
8599 Compute the status for each possibly constant bound, and return if we see
8600 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
8601 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
8602 for "constant known to fit". */
8604 /* Check if c >= type_low_bound. */
8605 if (type_low_bound
&& TREE_CODE (type_low_bound
) == INTEGER_CST
)
8607 if (tree_int_cst_lt (c
, type_low_bound
))
8609 ok_for_low_bound
= true;
8612 ok_for_low_bound
= false;
8614 /* Check if c <= type_high_bound. */
8615 if (type_high_bound
&& TREE_CODE (type_high_bound
) == INTEGER_CST
)
8617 if (tree_int_cst_lt (type_high_bound
, c
))
8619 ok_for_high_bound
= true;
8622 ok_for_high_bound
= false;
8624 /* If the constant fits both bounds, the result is known. */
8625 if (ok_for_low_bound
&& ok_for_high_bound
)
8628 /* Perform some generic filtering which may allow making a decision
8629 even if the bounds are not constant. First, negative integers
8630 never fit in unsigned types, */
8631 if (TYPE_UNSIGNED (type
) && sgn_c
== SIGNED
&& wi::neg_p (c
))
8634 /* Second, narrower types always fit in wider ones. */
8635 if (TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (c
)))
8638 /* Third, unsigned integers with top bit set never fit signed types. */
8639 if (!TYPE_UNSIGNED (type
) && sgn_c
== UNSIGNED
)
8641 int prec
= GET_MODE_PRECISION (TYPE_MODE (TREE_TYPE (c
))) - 1;
8642 if (prec
< TYPE_PRECISION (TREE_TYPE (c
)))
8644 /* When a tree_cst is converted to a wide-int, the precision
8645 is taken from the type. However, if the precision of the
8646 mode underneath the type is smaller than that, it is
8647 possible that the value will not fit. The test below
8648 fails if any bit is set between the sign bit of the
8649 underlying mode and the top bit of the type. */
8650 if (wi::ne_p (wi::zext (c
, prec
- 1), c
))
8653 else if (wi::neg_p (c
))
8657 /* If we haven't been able to decide at this point, there nothing more we
8658 can check ourselves here. Look at the base type if we have one and it
8659 has the same precision. */
8660 if (TREE_CODE (type
) == INTEGER_TYPE
8661 && TREE_TYPE (type
) != 0
8662 && TYPE_PRECISION (type
) == TYPE_PRECISION (TREE_TYPE (type
)))
8664 type
= TREE_TYPE (type
);
8668 /* Or to fits_to_tree_p, if nothing else. */
8669 return wi::fits_to_tree_p (c
, type
);
8672 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
8673 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
8674 represented (assuming two's-complement arithmetic) within the bit
8675 precision of the type are returned instead. */
8678 get_type_static_bounds (const_tree type
, mpz_t min
, mpz_t max
)
8680 if (!POINTER_TYPE_P (type
) && TYPE_MIN_VALUE (type
)
8681 && TREE_CODE (TYPE_MIN_VALUE (type
)) == INTEGER_CST
)
8682 wi::to_mpz (TYPE_MIN_VALUE (type
), min
, TYPE_SIGN (type
));
8685 if (TYPE_UNSIGNED (type
))
8686 mpz_set_ui (min
, 0);
8689 wide_int mn
= wi::min_value (TYPE_PRECISION (type
), SIGNED
);
8690 wi::to_mpz (mn
, min
, SIGNED
);
8694 if (!POINTER_TYPE_P (type
) && TYPE_MAX_VALUE (type
)
8695 && TREE_CODE (TYPE_MAX_VALUE (type
)) == INTEGER_CST
)
8696 wi::to_mpz (TYPE_MAX_VALUE (type
), max
, TYPE_SIGN (type
));
8699 wide_int mn
= wi::max_value (TYPE_PRECISION (type
), TYPE_SIGN (type
));
8700 wi::to_mpz (mn
, max
, TYPE_SIGN (type
));
8704 /* Return true if VAR is an automatic variable defined in function FN. */
8707 auto_var_in_fn_p (const_tree var
, const_tree fn
)
8709 return (DECL_P (var
) && DECL_CONTEXT (var
) == fn
8710 && ((((TREE_CODE (var
) == VAR_DECL
&& ! DECL_EXTERNAL (var
))
8711 || TREE_CODE (var
) == PARM_DECL
)
8712 && ! TREE_STATIC (var
))
8713 || TREE_CODE (var
) == LABEL_DECL
8714 || TREE_CODE (var
) == RESULT_DECL
));
8717 /* Subprogram of following function. Called by walk_tree.
8719 Return *TP if it is an automatic variable or parameter of the
8720 function passed in as DATA. */
8723 find_var_from_fn (tree
*tp
, int *walk_subtrees
, void *data
)
8725 tree fn
= (tree
) data
;
8730 else if (DECL_P (*tp
)
8731 && auto_var_in_fn_p (*tp
, fn
))
8737 /* Returns true if T is, contains, or refers to a type with variable
8738 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
8739 arguments, but not the return type. If FN is nonzero, only return
8740 true if a modifier of the type or position of FN is a variable or
8741 parameter inside FN.
8743 This concept is more general than that of C99 'variably modified types':
8744 in C99, a struct type is never variably modified because a VLA may not
8745 appear as a structure member. However, in GNU C code like:
8747 struct S { int i[f()]; };
8749 is valid, and other languages may define similar constructs. */
8752 variably_modified_type_p (tree type
, tree fn
)
8756 /* Test if T is either variable (if FN is zero) or an expression containing
8757 a variable in FN. If TYPE isn't gimplified, return true also if
8758 gimplify_one_sizepos would gimplify the expression into a local
8760 #define RETURN_TRUE_IF_VAR(T) \
8761 do { tree _t = (T); \
8762 if (_t != NULL_TREE \
8763 && _t != error_mark_node \
8764 && TREE_CODE (_t) != INTEGER_CST \
8765 && TREE_CODE (_t) != PLACEHOLDER_EXPR \
8767 || (!TYPE_SIZES_GIMPLIFIED (type) \
8768 && !is_gimple_sizepos (_t)) \
8769 || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
8770 return true; } while (0)
8772 if (type
== error_mark_node
)
8775 /* If TYPE itself has variable size, it is variably modified. */
8776 RETURN_TRUE_IF_VAR (TYPE_SIZE (type
));
8777 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type
));
8779 switch (TREE_CODE (type
))
8782 case REFERENCE_TYPE
:
8784 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
8790 /* If TYPE is a function type, it is variably modified if the
8791 return type is variably modified. */
8792 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
8798 case FIXED_POINT_TYPE
:
8801 /* Scalar types are variably modified if their end points
8803 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type
));
8804 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type
));
8809 case QUAL_UNION_TYPE
:
8810 /* We can't see if any of the fields are variably-modified by the
8811 definition we normally use, since that would produce infinite
8812 recursion via pointers. */
8813 /* This is variably modified if some field's type is. */
8814 for (t
= TYPE_FIELDS (type
); t
; t
= DECL_CHAIN (t
))
8815 if (TREE_CODE (t
) == FIELD_DECL
)
8817 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t
));
8818 RETURN_TRUE_IF_VAR (DECL_SIZE (t
));
8819 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t
));
8821 if (TREE_CODE (type
) == QUAL_UNION_TYPE
)
8822 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t
));
8827 /* Do not call ourselves to avoid infinite recursion. This is
8828 variably modified if the element type is. */
8829 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type
)));
8830 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type
)));
8837 /* The current language may have other cases to check, but in general,
8838 all other types are not variably modified. */
8839 return lang_hooks
.tree_inlining
.var_mod_type_p (type
, fn
);
8841 #undef RETURN_TRUE_IF_VAR
8844 /* Given a DECL or TYPE, return the scope in which it was declared, or
8845 NULL_TREE if there is no containing scope. */
8848 get_containing_scope (const_tree t
)
8850 return (TYPE_P (t
) ? TYPE_CONTEXT (t
) : DECL_CONTEXT (t
));
8853 /* Return the innermost context enclosing DECL that is
8854 a FUNCTION_DECL, or zero if none. */
8857 decl_function_context (const_tree decl
)
8861 if (TREE_CODE (decl
) == ERROR_MARK
)
8864 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
8865 where we look up the function at runtime. Such functions always take
8866 a first argument of type 'pointer to real context'.
8868 C++ should really be fixed to use DECL_CONTEXT for the real context,
8869 and use something else for the "virtual context". */
8870 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VINDEX (decl
))
8873 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl
)))));
8875 context
= DECL_CONTEXT (decl
);
8877 while (context
&& TREE_CODE (context
) != FUNCTION_DECL
)
8879 if (TREE_CODE (context
) == BLOCK
)
8880 context
= BLOCK_SUPERCONTEXT (context
);
8882 context
= get_containing_scope (context
);
8888 /* Return the innermost context enclosing DECL that is
8889 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
8890 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
8893 decl_type_context (const_tree decl
)
8895 tree context
= DECL_CONTEXT (decl
);
8898 switch (TREE_CODE (context
))
8900 case NAMESPACE_DECL
:
8901 case TRANSLATION_UNIT_DECL
:
8906 case QUAL_UNION_TYPE
:
8911 context
= DECL_CONTEXT (context
);
8915 context
= BLOCK_SUPERCONTEXT (context
);
8925 /* CALL is a CALL_EXPR. Return the declaration for the function
8926 called, or NULL_TREE if the called function cannot be
8930 get_callee_fndecl (const_tree call
)
8934 if (call
== error_mark_node
)
8935 return error_mark_node
;
8937 /* It's invalid to call this function with anything but a
8939 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
8941 /* The first operand to the CALL is the address of the function
8943 addr
= CALL_EXPR_FN (call
);
8945 /* If there is no function, return early. */
8946 if (addr
== NULL_TREE
)
8951 /* If this is a readonly function pointer, extract its initial value. */
8952 if (DECL_P (addr
) && TREE_CODE (addr
) != FUNCTION_DECL
8953 && TREE_READONLY (addr
) && ! TREE_THIS_VOLATILE (addr
)
8954 && DECL_INITIAL (addr
))
8955 addr
= DECL_INITIAL (addr
);
8957 /* If the address is just `&f' for some function `f', then we know
8958 that `f' is being called. */
8959 if (TREE_CODE (addr
) == ADDR_EXPR
8960 && TREE_CODE (TREE_OPERAND (addr
, 0)) == FUNCTION_DECL
)
8961 return TREE_OPERAND (addr
, 0);
8963 /* We couldn't figure out what was being called. */
8967 /* Print debugging information about tree nodes generated during the compile,
8968 and any language-specific information. */
8971 dump_tree_statistics (void)
8973 if (GATHER_STATISTICS
)
8976 int total_nodes
, total_bytes
;
8977 fprintf (stderr
, "Kind Nodes Bytes\n");
8978 fprintf (stderr
, "---------------------------------------\n");
8979 total_nodes
= total_bytes
= 0;
8980 for (i
= 0; i
< (int) all_kinds
; i
++)
8982 fprintf (stderr
, "%-20s %7d %10d\n", tree_node_kind_names
[i
],
8983 tree_node_counts
[i
], tree_node_sizes
[i
]);
8984 total_nodes
+= tree_node_counts
[i
];
8985 total_bytes
+= tree_node_sizes
[i
];
8987 fprintf (stderr
, "---------------------------------------\n");
8988 fprintf (stderr
, "%-20s %7d %10d\n", "Total", total_nodes
, total_bytes
);
8989 fprintf (stderr
, "---------------------------------------\n");
8990 fprintf (stderr
, "Code Nodes\n");
8991 fprintf (stderr
, "----------------------------\n");
8992 for (i
= 0; i
< (int) MAX_TREE_CODES
; i
++)
8993 fprintf (stderr
, "%-20s %7d\n", get_tree_code_name ((enum tree_code
) i
),
8994 tree_code_counts
[i
]);
8995 fprintf (stderr
, "----------------------------\n");
8996 ssanames_print_statistics ();
8997 phinodes_print_statistics ();
9000 fprintf (stderr
, "(No per-node statistics)\n");
9002 print_type_hash_statistics ();
9003 print_debug_expr_statistics ();
9004 print_value_expr_statistics ();
9005 lang_hooks
.print_statistics ();
9008 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
9010 /* Generate a crc32 of a byte. */
9013 crc32_unsigned_bits (unsigned chksum
, unsigned value
, unsigned bits
)
9017 for (ix
= bits
; ix
--; value
<<= 1)
9021 feedback
= (value
^ chksum
) & 0x80000000 ? 0x04c11db7 : 0;
9028 /* Generate a crc32 of a 32-bit unsigned. */
9031 crc32_unsigned (unsigned chksum
, unsigned value
)
9033 return crc32_unsigned_bits (chksum
, value
, 32);
9036 /* Generate a crc32 of a byte. */
9039 crc32_byte (unsigned chksum
, char byte
)
9041 return crc32_unsigned_bits (chksum
, (unsigned) byte
<< 24, 8);
9044 /* Generate a crc32 of a string. */
9047 crc32_string (unsigned chksum
, const char *string
)
9051 chksum
= crc32_byte (chksum
, *string
);
9057 /* P is a string that will be used in a symbol. Mask out any characters
9058 that are not valid in that context. */
9061 clean_symbol_name (char *p
)
9065 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
9068 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
9075 /* Generate a name for a special-purpose function.
9076 The generated name may need to be unique across the whole link.
9077 Changes to this function may also require corresponding changes to
9078 xstrdup_mask_random.
9079 TYPE is some string to identify the purpose of this function to the
9080 linker or collect2; it must start with an uppercase letter,
9082 I - for constructors
9084 N - for C++ anonymous namespaces
9085 F - for DWARF unwind frame information. */
9088 get_file_function_name (const char *type
)
9094 /* If we already have a name we know to be unique, just use that. */
9095 if (first_global_object_name
)
9096 p
= q
= ASTRDUP (first_global_object_name
);
9097 /* If the target is handling the constructors/destructors, they
9098 will be local to this file and the name is only necessary for
9100 We also assign sub_I and sub_D sufixes to constructors called from
9101 the global static constructors. These are always local. */
9102 else if (((type
[0] == 'I' || type
[0] == 'D') && targetm
.have_ctors_dtors
)
9103 || (strncmp (type
, "sub_", 4) == 0
9104 && (type
[4] == 'I' || type
[4] == 'D')))
9106 const char *file
= main_input_filename
;
9108 file
= LOCATION_FILE (input_location
);
9109 /* Just use the file's basename, because the full pathname
9110 might be quite long. */
9111 p
= q
= ASTRDUP (lbasename (file
));
9115 /* Otherwise, the name must be unique across the entire link.
9116 We don't have anything that we know to be unique to this translation
9117 unit, so use what we do have and throw in some randomness. */
9119 const char *name
= weak_global_object_name
;
9120 const char *file
= main_input_filename
;
9125 file
= LOCATION_FILE (input_location
);
9127 len
= strlen (file
);
9128 q
= (char *) alloca (9 + 17 + len
+ 1);
9129 memcpy (q
, file
, len
+ 1);
9131 snprintf (q
+ len
, 9 + 17 + 1, "_%08X_" HOST_WIDE_INT_PRINT_HEX
,
9132 crc32_string (0, name
), get_random_seed (false));
9137 clean_symbol_name (q
);
9138 buf
= (char *) alloca (sizeof (FILE_FUNCTION_FORMAT
) + strlen (p
)
9141 /* Set up the name of the file-level functions we may need.
9142 Use a global object (which is already required to be unique over
9143 the program) rather than the file name (which imposes extra
9145 sprintf (buf
, FILE_FUNCTION_FORMAT
, type
, p
);
9147 return get_identifier (buf
);
9150 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
9152 /* Complain that the tree code of NODE does not match the expected 0
9153 terminated list of trailing codes. The trailing code list can be
9154 empty, for a more vague error message. FILE, LINE, and FUNCTION
9155 are of the caller. */
9158 tree_check_failed (const_tree node
, const char *file
,
9159 int line
, const char *function
, ...)
9163 unsigned length
= 0;
9164 enum tree_code code
;
9166 va_start (args
, function
);
9167 while ((code
= (enum tree_code
) va_arg (args
, int)))
9168 length
+= 4 + strlen (get_tree_code_name (code
));
9173 va_start (args
, function
);
9174 length
+= strlen ("expected ");
9175 buffer
= tmp
= (char *) alloca (length
);
9177 while ((code
= (enum tree_code
) va_arg (args
, int)))
9179 const char *prefix
= length
? " or " : "expected ";
9181 strcpy (tmp
+ length
, prefix
);
9182 length
+= strlen (prefix
);
9183 strcpy (tmp
+ length
, get_tree_code_name (code
));
9184 length
+= strlen (get_tree_code_name (code
));
9189 buffer
= "unexpected node";
9191 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9192 buffer
, get_tree_code_name (TREE_CODE (node
)),
9193 function
, trim_filename (file
), line
);
9196 /* Complain that the tree code of NODE does match the expected 0
9197 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
9201 tree_not_check_failed (const_tree node
, const char *file
,
9202 int line
, const char *function
, ...)
9206 unsigned length
= 0;
9207 enum tree_code code
;
9209 va_start (args
, function
);
9210 while ((code
= (enum tree_code
) va_arg (args
, int)))
9211 length
+= 4 + strlen (get_tree_code_name (code
));
9213 va_start (args
, function
);
9214 buffer
= (char *) alloca (length
);
9216 while ((code
= (enum tree_code
) va_arg (args
, int)))
9220 strcpy (buffer
+ length
, " or ");
9223 strcpy (buffer
+ length
, get_tree_code_name (code
));
9224 length
+= strlen (get_tree_code_name (code
));
9228 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
9229 buffer
, get_tree_code_name (TREE_CODE (node
)),
9230 function
, trim_filename (file
), line
);
9233 /* Similar to tree_check_failed, except that we check for a class of tree
9234 code, given in CL. */
9237 tree_class_check_failed (const_tree node
, const enum tree_code_class cl
,
9238 const char *file
, int line
, const char *function
)
9241 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
9242 TREE_CODE_CLASS_STRING (cl
),
9243 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
9244 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9247 /* Similar to tree_check_failed, except that instead of specifying a
9248 dozen codes, use the knowledge that they're all sequential. */
9251 tree_range_check_failed (const_tree node
, const char *file
, int line
,
9252 const char *function
, enum tree_code c1
,
9256 unsigned length
= 0;
9259 for (c
= c1
; c
<= c2
; ++c
)
9260 length
+= 4 + strlen (get_tree_code_name ((enum tree_code
) c
));
9262 length
+= strlen ("expected ");
9263 buffer
= (char *) alloca (length
);
9266 for (c
= c1
; c
<= c2
; ++c
)
9268 const char *prefix
= length
? " or " : "expected ";
9270 strcpy (buffer
+ length
, prefix
);
9271 length
+= strlen (prefix
);
9272 strcpy (buffer
+ length
, get_tree_code_name ((enum tree_code
) c
));
9273 length
+= strlen (get_tree_code_name ((enum tree_code
) c
));
9276 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9277 buffer
, get_tree_code_name (TREE_CODE (node
)),
9278 function
, trim_filename (file
), line
);
9282 /* Similar to tree_check_failed, except that we check that a tree does
9283 not have the specified code, given in CL. */
9286 tree_not_class_check_failed (const_tree node
, const enum tree_code_class cl
,
9287 const char *file
, int line
, const char *function
)
9290 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
9291 TREE_CODE_CLASS_STRING (cl
),
9292 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
9293 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9297 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
9300 omp_clause_check_failed (const_tree node
, const char *file
, int line
,
9301 const char *function
, enum omp_clause_code code
)
9303 internal_error ("tree check: expected omp_clause %s, have %s in %s, at %s:%d",
9304 omp_clause_code_name
[code
], get_tree_code_name (TREE_CODE (node
)),
9305 function
, trim_filename (file
), line
);
9309 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
9312 omp_clause_range_check_failed (const_tree node
, const char *file
, int line
,
9313 const char *function
, enum omp_clause_code c1
,
9314 enum omp_clause_code c2
)
9317 unsigned length
= 0;
9320 for (c
= c1
; c
<= c2
; ++c
)
9321 length
+= 4 + strlen (omp_clause_code_name
[c
]);
9323 length
+= strlen ("expected ");
9324 buffer
= (char *) alloca (length
);
9327 for (c
= c1
; c
<= c2
; ++c
)
9329 const char *prefix
= length
? " or " : "expected ";
9331 strcpy (buffer
+ length
, prefix
);
9332 length
+= strlen (prefix
);
9333 strcpy (buffer
+ length
, omp_clause_code_name
[c
]);
9334 length
+= strlen (omp_clause_code_name
[c
]);
9337 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9338 buffer
, omp_clause_code_name
[TREE_CODE (node
)],
9339 function
, trim_filename (file
), line
);
9343 #undef DEFTREESTRUCT
9344 #define DEFTREESTRUCT(VAL, NAME) NAME,
9346 static const char *ts_enum_names
[] = {
9347 #include "treestruct.def"
9349 #undef DEFTREESTRUCT
9351 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
9353 /* Similar to tree_class_check_failed, except that we check for
9354 whether CODE contains the tree structure identified by EN. */
9357 tree_contains_struct_check_failed (const_tree node
,
9358 const enum tree_node_structure_enum en
,
9359 const char *file
, int line
,
9360 const char *function
)
9363 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
9365 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9369 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9370 (dynamically sized) vector. */
9373 tree_int_cst_elt_check_failed (int idx
, int len
, const char *file
, int line
,
9374 const char *function
)
9377 ("tree check: accessed elt %d of tree_int_cst with %d elts in %s, at %s:%d",
9378 idx
+ 1, len
, function
, trim_filename (file
), line
);
9381 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9382 (dynamically sized) vector. */
9385 tree_vec_elt_check_failed (int idx
, int len
, const char *file
, int line
,
9386 const char *function
)
9389 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
9390 idx
+ 1, len
, function
, trim_filename (file
), line
);
9393 /* Similar to above, except that the check is for the bounds of the operand
9394 vector of an expression node EXP. */
9397 tree_operand_check_failed (int idx
, const_tree exp
, const char *file
,
9398 int line
, const char *function
)
9400 enum tree_code code
= TREE_CODE (exp
);
9402 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
9403 idx
+ 1, get_tree_code_name (code
), TREE_OPERAND_LENGTH (exp
),
9404 function
, trim_filename (file
), line
);
9407 /* Similar to above, except that the check is for the number of
9408 operands of an OMP_CLAUSE node. */
9411 omp_clause_operand_check_failed (int idx
, const_tree t
, const char *file
,
9412 int line
, const char *function
)
9415 ("tree check: accessed operand %d of omp_clause %s with %d operands "
9416 "in %s, at %s:%d", idx
+ 1, omp_clause_code_name
[OMP_CLAUSE_CODE (t
)],
9417 omp_clause_num_ops
[OMP_CLAUSE_CODE (t
)], function
,
9418 trim_filename (file
), line
);
9420 #endif /* ENABLE_TREE_CHECKING */
9422 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
9423 and mapped to the machine mode MODE. Initialize its fields and build
9424 the information necessary for debugging output. */
9427 make_vector_type (tree innertype
, int nunits
, machine_mode mode
)
9430 inchash::hash hstate
;
9432 t
= make_node (VECTOR_TYPE
);
9433 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (innertype
);
9434 SET_TYPE_VECTOR_SUBPARTS (t
, nunits
);
9435 SET_TYPE_MODE (t
, mode
);
9437 if (TYPE_STRUCTURAL_EQUALITY_P (innertype
))
9438 SET_TYPE_STRUCTURAL_EQUALITY (t
);
9439 else if (TYPE_CANONICAL (innertype
) != innertype
9440 || mode
!= VOIDmode
)
9442 = make_vector_type (TYPE_CANONICAL (innertype
), nunits
, VOIDmode
);
9446 hstate
.add_wide_int (VECTOR_TYPE
);
9447 hstate
.add_wide_int (nunits
);
9448 hstate
.add_wide_int (mode
);
9449 hstate
.add_object (TYPE_HASH (TREE_TYPE (t
)));
9450 t
= type_hash_canon (hstate
.end (), t
);
9452 /* We have built a main variant, based on the main variant of the
9453 inner type. Use it to build the variant we return. */
9454 if ((TYPE_ATTRIBUTES (innertype
) || TYPE_QUALS (innertype
))
9455 && TREE_TYPE (t
) != innertype
)
9456 return build_type_attribute_qual_variant (t
,
9457 TYPE_ATTRIBUTES (innertype
),
9458 TYPE_QUALS (innertype
));
9464 make_or_reuse_type (unsigned size
, int unsignedp
)
9468 if (size
== INT_TYPE_SIZE
)
9469 return unsignedp
? unsigned_type_node
: integer_type_node
;
9470 if (size
== CHAR_TYPE_SIZE
)
9471 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
9472 if (size
== SHORT_TYPE_SIZE
)
9473 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
9474 if (size
== LONG_TYPE_SIZE
)
9475 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
9476 if (size
== LONG_LONG_TYPE_SIZE
)
9477 return (unsignedp
? long_long_unsigned_type_node
9478 : long_long_integer_type_node
);
9480 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
9481 if (size
== int_n_data
[i
].bitsize
9482 && int_n_enabled_p
[i
])
9483 return (unsignedp
? int_n_trees
[i
].unsigned_type
9484 : int_n_trees
[i
].signed_type
);
9487 return make_unsigned_type (size
);
9489 return make_signed_type (size
);
9492 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
9495 make_or_reuse_fract_type (unsigned size
, int unsignedp
, int satp
)
9499 if (size
== SHORT_FRACT_TYPE_SIZE
)
9500 return unsignedp
? sat_unsigned_short_fract_type_node
9501 : sat_short_fract_type_node
;
9502 if (size
== FRACT_TYPE_SIZE
)
9503 return unsignedp
? sat_unsigned_fract_type_node
: sat_fract_type_node
;
9504 if (size
== LONG_FRACT_TYPE_SIZE
)
9505 return unsignedp
? sat_unsigned_long_fract_type_node
9506 : sat_long_fract_type_node
;
9507 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
9508 return unsignedp
? sat_unsigned_long_long_fract_type_node
9509 : sat_long_long_fract_type_node
;
9513 if (size
== SHORT_FRACT_TYPE_SIZE
)
9514 return unsignedp
? unsigned_short_fract_type_node
9515 : short_fract_type_node
;
9516 if (size
== FRACT_TYPE_SIZE
)
9517 return unsignedp
? unsigned_fract_type_node
: fract_type_node
;
9518 if (size
== LONG_FRACT_TYPE_SIZE
)
9519 return unsignedp
? unsigned_long_fract_type_node
9520 : long_fract_type_node
;
9521 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
9522 return unsignedp
? unsigned_long_long_fract_type_node
9523 : long_long_fract_type_node
;
9526 return make_fract_type (size
, unsignedp
, satp
);
9529 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
9532 make_or_reuse_accum_type (unsigned size
, int unsignedp
, int satp
)
9536 if (size
== SHORT_ACCUM_TYPE_SIZE
)
9537 return unsignedp
? sat_unsigned_short_accum_type_node
9538 : sat_short_accum_type_node
;
9539 if (size
== ACCUM_TYPE_SIZE
)
9540 return unsignedp
? sat_unsigned_accum_type_node
: sat_accum_type_node
;
9541 if (size
== LONG_ACCUM_TYPE_SIZE
)
9542 return unsignedp
? sat_unsigned_long_accum_type_node
9543 : sat_long_accum_type_node
;
9544 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
9545 return unsignedp
? sat_unsigned_long_long_accum_type_node
9546 : sat_long_long_accum_type_node
;
9550 if (size
== SHORT_ACCUM_TYPE_SIZE
)
9551 return unsignedp
? unsigned_short_accum_type_node
9552 : short_accum_type_node
;
9553 if (size
== ACCUM_TYPE_SIZE
)
9554 return unsignedp
? unsigned_accum_type_node
: accum_type_node
;
9555 if (size
== LONG_ACCUM_TYPE_SIZE
)
9556 return unsignedp
? unsigned_long_accum_type_node
9557 : long_accum_type_node
;
9558 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
9559 return unsignedp
? unsigned_long_long_accum_type_node
9560 : long_long_accum_type_node
;
9563 return make_accum_type (size
, unsignedp
, satp
);
9567 /* Create an atomic variant node for TYPE. This routine is called
9568 during initialization of data types to create the 5 basic atomic
9569 types. The generic build_variant_type function requires these to
9570 already be set up in order to function properly, so cannot be
9571 called from there. If ALIGN is non-zero, then ensure alignment is
9572 overridden to this value. */
9575 build_atomic_base (tree type
, unsigned int align
)
9579 /* Make sure its not already registered. */
9580 if ((t
= get_qualified_type (type
, TYPE_QUAL_ATOMIC
)))
9583 t
= build_variant_type_copy (type
);
9584 set_type_quals (t
, TYPE_QUAL_ATOMIC
);
9587 TYPE_ALIGN (t
) = align
;
9592 /* Create nodes for all integer types (and error_mark_node) using the sizes
9593 of C datatypes. SIGNED_CHAR specifies whether char is signed,
9594 SHORT_DOUBLE specifies whether double should be of the same precision
9598 build_common_tree_nodes (bool signed_char
, bool short_double
)
9602 error_mark_node
= make_node (ERROR_MARK
);
9603 TREE_TYPE (error_mark_node
) = error_mark_node
;
9605 initialize_sizetypes ();
9607 /* Define both `signed char' and `unsigned char'. */
9608 signed_char_type_node
= make_signed_type (CHAR_TYPE_SIZE
);
9609 TYPE_STRING_FLAG (signed_char_type_node
) = 1;
9610 unsigned_char_type_node
= make_unsigned_type (CHAR_TYPE_SIZE
);
9611 TYPE_STRING_FLAG (unsigned_char_type_node
) = 1;
9613 /* Define `char', which is like either `signed char' or `unsigned char'
9614 but not the same as either. */
9617 ? make_signed_type (CHAR_TYPE_SIZE
)
9618 : make_unsigned_type (CHAR_TYPE_SIZE
));
9619 TYPE_STRING_FLAG (char_type_node
) = 1;
9621 short_integer_type_node
= make_signed_type (SHORT_TYPE_SIZE
);
9622 short_unsigned_type_node
= make_unsigned_type (SHORT_TYPE_SIZE
);
9623 integer_type_node
= make_signed_type (INT_TYPE_SIZE
);
9624 unsigned_type_node
= make_unsigned_type (INT_TYPE_SIZE
);
9625 long_integer_type_node
= make_signed_type (LONG_TYPE_SIZE
);
9626 long_unsigned_type_node
= make_unsigned_type (LONG_TYPE_SIZE
);
9627 long_long_integer_type_node
= make_signed_type (LONG_LONG_TYPE_SIZE
);
9628 long_long_unsigned_type_node
= make_unsigned_type (LONG_LONG_TYPE_SIZE
);
9630 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
9632 int_n_trees
[i
].signed_type
= make_signed_type (int_n_data
[i
].bitsize
);
9633 int_n_trees
[i
].unsigned_type
= make_unsigned_type (int_n_data
[i
].bitsize
);
9634 TYPE_SIZE (int_n_trees
[i
].signed_type
) = bitsize_int (int_n_data
[i
].bitsize
);
9635 TYPE_SIZE (int_n_trees
[i
].unsigned_type
) = bitsize_int (int_n_data
[i
].bitsize
);
9637 if (int_n_data
[i
].bitsize
> LONG_LONG_TYPE_SIZE
9638 && int_n_enabled_p
[i
])
9640 integer_types
[itk_intN_0
+ i
* 2] = int_n_trees
[i
].signed_type
;
9641 integer_types
[itk_unsigned_intN_0
+ i
* 2] = int_n_trees
[i
].unsigned_type
;
9645 /* Define a boolean type. This type only represents boolean values but
9646 may be larger than char depending on the value of BOOL_TYPE_SIZE. */
9647 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
9648 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
9649 TYPE_PRECISION (boolean_type_node
) = 1;
9650 TYPE_MAX_VALUE (boolean_type_node
) = build_int_cst (boolean_type_node
, 1);
9652 /* Define what type to use for size_t. */
9653 if (strcmp (SIZE_TYPE
, "unsigned int") == 0)
9654 size_type_node
= unsigned_type_node
;
9655 else if (strcmp (SIZE_TYPE
, "long unsigned int") == 0)
9656 size_type_node
= long_unsigned_type_node
;
9657 else if (strcmp (SIZE_TYPE
, "long long unsigned int") == 0)
9658 size_type_node
= long_long_unsigned_type_node
;
9659 else if (strcmp (SIZE_TYPE
, "short unsigned int") == 0)
9660 size_type_node
= short_unsigned_type_node
;
9665 size_type_node
= NULL_TREE
;
9666 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
9667 if (int_n_enabled_p
[i
])
9670 sprintf (name
, "__int%d unsigned", int_n_data
[i
].bitsize
);
9672 if (strcmp (name
, SIZE_TYPE
) == 0)
9674 size_type_node
= int_n_trees
[i
].unsigned_type
;
9677 if (size_type_node
== NULL_TREE
)
9681 /* Fill in the rest of the sized types. Reuse existing type nodes
9683 intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 0);
9684 intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 0);
9685 intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 0);
9686 intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 0);
9687 intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 0);
9689 unsigned_intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 1);
9690 unsigned_intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 1);
9691 unsigned_intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 1);
9692 unsigned_intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 1);
9693 unsigned_intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 1);
9695 /* Don't call build_qualified type for atomics. That routine does
9696 special processing for atomics, and until they are initialized
9697 it's better not to make that call.
9699 Check to see if there is a target override for atomic types. */
9701 atomicQI_type_node
= build_atomic_base (unsigned_intQI_type_node
,
9702 targetm
.atomic_align_for_mode (QImode
));
9703 atomicHI_type_node
= build_atomic_base (unsigned_intHI_type_node
,
9704 targetm
.atomic_align_for_mode (HImode
));
9705 atomicSI_type_node
= build_atomic_base (unsigned_intSI_type_node
,
9706 targetm
.atomic_align_for_mode (SImode
));
9707 atomicDI_type_node
= build_atomic_base (unsigned_intDI_type_node
,
9708 targetm
.atomic_align_for_mode (DImode
));
9709 atomicTI_type_node
= build_atomic_base (unsigned_intTI_type_node
,
9710 targetm
.atomic_align_for_mode (TImode
));
9712 access_public_node
= get_identifier ("public");
9713 access_protected_node
= get_identifier ("protected");
9714 access_private_node
= get_identifier ("private");
9716 /* Define these next since types below may used them. */
9717 integer_zero_node
= build_int_cst (integer_type_node
, 0);
9718 integer_one_node
= build_int_cst (integer_type_node
, 1);
9719 integer_three_node
= build_int_cst (integer_type_node
, 3);
9720 integer_minus_one_node
= build_int_cst (integer_type_node
, -1);
9722 size_zero_node
= size_int (0);
9723 size_one_node
= size_int (1);
9724 bitsize_zero_node
= bitsize_int (0);
9725 bitsize_one_node
= bitsize_int (1);
9726 bitsize_unit_node
= bitsize_int (BITS_PER_UNIT
);
9728 boolean_false_node
= TYPE_MIN_VALUE (boolean_type_node
);
9729 boolean_true_node
= TYPE_MAX_VALUE (boolean_type_node
);
9731 void_type_node
= make_node (VOID_TYPE
);
9732 layout_type (void_type_node
);
9734 pointer_bounds_type_node
= targetm
.chkp_bound_type ();
9736 /* We are not going to have real types in C with less than byte alignment,
9737 so we might as well not have any types that claim to have it. */
9738 TYPE_ALIGN (void_type_node
) = BITS_PER_UNIT
;
9739 TYPE_USER_ALIGN (void_type_node
) = 0;
9741 void_node
= make_node (VOID_CST
);
9742 TREE_TYPE (void_node
) = void_type_node
;
9744 null_pointer_node
= build_int_cst (build_pointer_type (void_type_node
), 0);
9745 layout_type (TREE_TYPE (null_pointer_node
));
9747 ptr_type_node
= build_pointer_type (void_type_node
);
9749 = build_pointer_type (build_type_variant (void_type_node
, 1, 0));
9750 fileptr_type_node
= ptr_type_node
;
9752 pointer_sized_int_node
= build_nonstandard_integer_type (POINTER_SIZE
, 1);
9754 float_type_node
= make_node (REAL_TYPE
);
9755 TYPE_PRECISION (float_type_node
) = FLOAT_TYPE_SIZE
;
9756 layout_type (float_type_node
);
9758 double_type_node
= make_node (REAL_TYPE
);
9760 TYPE_PRECISION (double_type_node
) = FLOAT_TYPE_SIZE
;
9762 TYPE_PRECISION (double_type_node
) = DOUBLE_TYPE_SIZE
;
9763 layout_type (double_type_node
);
9765 long_double_type_node
= make_node (REAL_TYPE
);
9766 TYPE_PRECISION (long_double_type_node
) = LONG_DOUBLE_TYPE_SIZE
;
9767 layout_type (long_double_type_node
);
9769 float_ptr_type_node
= build_pointer_type (float_type_node
);
9770 double_ptr_type_node
= build_pointer_type (double_type_node
);
9771 long_double_ptr_type_node
= build_pointer_type (long_double_type_node
);
9772 integer_ptr_type_node
= build_pointer_type (integer_type_node
);
9774 /* Fixed size integer types. */
9775 uint16_type_node
= make_or_reuse_type (16, 1);
9776 uint32_type_node
= make_or_reuse_type (32, 1);
9777 uint64_type_node
= make_or_reuse_type (64, 1);
9779 /* Decimal float types. */
9780 dfloat32_type_node
= make_node (REAL_TYPE
);
9781 TYPE_PRECISION (dfloat32_type_node
) = DECIMAL32_TYPE_SIZE
;
9782 layout_type (dfloat32_type_node
);
9783 SET_TYPE_MODE (dfloat32_type_node
, SDmode
);
9784 dfloat32_ptr_type_node
= build_pointer_type (dfloat32_type_node
);
9786 dfloat64_type_node
= make_node (REAL_TYPE
);
9787 TYPE_PRECISION (dfloat64_type_node
) = DECIMAL64_TYPE_SIZE
;
9788 layout_type (dfloat64_type_node
);
9789 SET_TYPE_MODE (dfloat64_type_node
, DDmode
);
9790 dfloat64_ptr_type_node
= build_pointer_type (dfloat64_type_node
);
9792 dfloat128_type_node
= make_node (REAL_TYPE
);
9793 TYPE_PRECISION (dfloat128_type_node
) = DECIMAL128_TYPE_SIZE
;
9794 layout_type (dfloat128_type_node
);
9795 SET_TYPE_MODE (dfloat128_type_node
, TDmode
);
9796 dfloat128_ptr_type_node
= build_pointer_type (dfloat128_type_node
);
9798 complex_integer_type_node
= build_complex_type (integer_type_node
);
9799 complex_float_type_node
= build_complex_type (float_type_node
);
9800 complex_double_type_node
= build_complex_type (double_type_node
);
9801 complex_long_double_type_node
= build_complex_type (long_double_type_node
);
9803 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
9804 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
9805 sat_ ## KIND ## _type_node = \
9806 make_sat_signed_ ## KIND ## _type (SIZE); \
9807 sat_unsigned_ ## KIND ## _type_node = \
9808 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9809 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9810 unsigned_ ## KIND ## _type_node = \
9811 make_unsigned_ ## KIND ## _type (SIZE);
9813 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
9814 sat_ ## WIDTH ## KIND ## _type_node = \
9815 make_sat_signed_ ## KIND ## _type (SIZE); \
9816 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
9817 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9818 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9819 unsigned_ ## WIDTH ## KIND ## _type_node = \
9820 make_unsigned_ ## KIND ## _type (SIZE);
9822 /* Make fixed-point type nodes based on four different widths. */
9823 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
9824 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
9825 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
9826 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
9827 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
9829 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
9830 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
9831 NAME ## _type_node = \
9832 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
9833 u ## NAME ## _type_node = \
9834 make_or_reuse_unsigned_ ## KIND ## _type \
9835 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
9836 sat_ ## NAME ## _type_node = \
9837 make_or_reuse_sat_signed_ ## KIND ## _type \
9838 (GET_MODE_BITSIZE (MODE ## mode)); \
9839 sat_u ## NAME ## _type_node = \
9840 make_or_reuse_sat_unsigned_ ## KIND ## _type \
9841 (GET_MODE_BITSIZE (U ## MODE ## mode));
9843 /* Fixed-point type and mode nodes. */
9844 MAKE_FIXED_TYPE_NODE_FAMILY (fract
, FRACT
)
9845 MAKE_FIXED_TYPE_NODE_FAMILY (accum
, ACCUM
)
9846 MAKE_FIXED_MODE_NODE (fract
, qq
, QQ
)
9847 MAKE_FIXED_MODE_NODE (fract
, hq
, HQ
)
9848 MAKE_FIXED_MODE_NODE (fract
, sq
, SQ
)
9849 MAKE_FIXED_MODE_NODE (fract
, dq
, DQ
)
9850 MAKE_FIXED_MODE_NODE (fract
, tq
, TQ
)
9851 MAKE_FIXED_MODE_NODE (accum
, ha
, HA
)
9852 MAKE_FIXED_MODE_NODE (accum
, sa
, SA
)
9853 MAKE_FIXED_MODE_NODE (accum
, da
, DA
)
9854 MAKE_FIXED_MODE_NODE (accum
, ta
, TA
)
9857 tree t
= targetm
.build_builtin_va_list ();
9859 /* Many back-ends define record types without setting TYPE_NAME.
9860 If we copied the record type here, we'd keep the original
9861 record type without a name. This breaks name mangling. So,
9862 don't copy record types and let c_common_nodes_and_builtins()
9863 declare the type to be __builtin_va_list. */
9864 if (TREE_CODE (t
) != RECORD_TYPE
)
9865 t
= build_variant_type_copy (t
);
9867 va_list_type_node
= t
;
9871 /* Modify DECL for given flags.
9872 TM_PURE attribute is set only on types, so the function will modify
9873 DECL's type when ECF_TM_PURE is used. */
9876 set_call_expr_flags (tree decl
, int flags
)
9878 if (flags
& ECF_NOTHROW
)
9879 TREE_NOTHROW (decl
) = 1;
9880 if (flags
& ECF_CONST
)
9881 TREE_READONLY (decl
) = 1;
9882 if (flags
& ECF_PURE
)
9883 DECL_PURE_P (decl
) = 1;
9884 if (flags
& ECF_LOOPING_CONST_OR_PURE
)
9885 DECL_LOOPING_CONST_OR_PURE_P (decl
) = 1;
9886 if (flags
& ECF_NOVOPS
)
9887 DECL_IS_NOVOPS (decl
) = 1;
9888 if (flags
& ECF_NORETURN
)
9889 TREE_THIS_VOLATILE (decl
) = 1;
9890 if (flags
& ECF_MALLOC
)
9891 DECL_IS_MALLOC (decl
) = 1;
9892 if (flags
& ECF_RETURNS_TWICE
)
9893 DECL_IS_RETURNS_TWICE (decl
) = 1;
9894 if (flags
& ECF_LEAF
)
9895 DECL_ATTRIBUTES (decl
) = tree_cons (get_identifier ("leaf"),
9896 NULL
, DECL_ATTRIBUTES (decl
));
9897 if ((flags
& ECF_TM_PURE
) && flag_tm
)
9898 apply_tm_attr (decl
, get_identifier ("transaction_pure"));
9899 /* Looping const or pure is implied by noreturn.
9900 There is currently no way to declare looping const or looping pure alone. */
9901 gcc_assert (!(flags
& ECF_LOOPING_CONST_OR_PURE
)
9902 || ((flags
& ECF_NORETURN
) && (flags
& (ECF_CONST
| ECF_PURE
))));
9906 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
9909 local_define_builtin (const char *name
, tree type
, enum built_in_function code
,
9910 const char *library_name
, int ecf_flags
)
9914 decl
= add_builtin_function (name
, type
, code
, BUILT_IN_NORMAL
,
9915 library_name
, NULL_TREE
);
9916 set_call_expr_flags (decl
, ecf_flags
);
9918 set_builtin_decl (code
, decl
, true);
9921 /* Call this function after instantiating all builtins that the language
9922 front end cares about. This will build the rest of the builtins
9923 and internal functions that are relied upon by the tree optimizers and
9927 build_common_builtin_nodes (void)
9932 if (!builtin_decl_explicit_p (BUILT_IN_UNREACHABLE
))
9934 ftype
= build_function_type (void_type_node
, void_list_node
);
9935 local_define_builtin ("__builtin_unreachable", ftype
, BUILT_IN_UNREACHABLE
,
9936 "__builtin_unreachable",
9937 ECF_NOTHROW
| ECF_LEAF
| ECF_NORETURN
9941 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
)
9942 || !builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
9944 ftype
= build_function_type_list (ptr_type_node
,
9945 ptr_type_node
, const_ptr_type_node
,
9946 size_type_node
, NULL_TREE
);
9948 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
))
9949 local_define_builtin ("__builtin_memcpy", ftype
, BUILT_IN_MEMCPY
,
9950 "memcpy", ECF_NOTHROW
| ECF_LEAF
);
9951 if (!builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
9952 local_define_builtin ("__builtin_memmove", ftype
, BUILT_IN_MEMMOVE
,
9953 "memmove", ECF_NOTHROW
| ECF_LEAF
);
9956 if (!builtin_decl_explicit_p (BUILT_IN_MEMCMP
))
9958 ftype
= build_function_type_list (integer_type_node
, const_ptr_type_node
,
9959 const_ptr_type_node
, size_type_node
,
9961 local_define_builtin ("__builtin_memcmp", ftype
, BUILT_IN_MEMCMP
,
9962 "memcmp", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
9965 if (!builtin_decl_explicit_p (BUILT_IN_MEMSET
))
9967 ftype
= build_function_type_list (ptr_type_node
,
9968 ptr_type_node
, integer_type_node
,
9969 size_type_node
, NULL_TREE
);
9970 local_define_builtin ("__builtin_memset", ftype
, BUILT_IN_MEMSET
,
9971 "memset", ECF_NOTHROW
| ECF_LEAF
);
9974 if (!builtin_decl_explicit_p (BUILT_IN_ALLOCA
))
9976 ftype
= build_function_type_list (ptr_type_node
,
9977 size_type_node
, NULL_TREE
);
9978 local_define_builtin ("__builtin_alloca", ftype
, BUILT_IN_ALLOCA
,
9979 "alloca", ECF_MALLOC
| ECF_NOTHROW
| ECF_LEAF
);
9982 ftype
= build_function_type_list (ptr_type_node
, size_type_node
,
9983 size_type_node
, NULL_TREE
);
9984 local_define_builtin ("__builtin_alloca_with_align", ftype
,
9985 BUILT_IN_ALLOCA_WITH_ALIGN
, "alloca",
9986 ECF_MALLOC
| ECF_NOTHROW
| ECF_LEAF
);
9988 /* If we're checking the stack, `alloca' can throw. */
9989 if (flag_stack_check
)
9991 TREE_NOTHROW (builtin_decl_explicit (BUILT_IN_ALLOCA
)) = 0;
9992 TREE_NOTHROW (builtin_decl_explicit (BUILT_IN_ALLOCA_WITH_ALIGN
)) = 0;
9995 ftype
= build_function_type_list (void_type_node
,
9996 ptr_type_node
, ptr_type_node
,
9997 ptr_type_node
, NULL_TREE
);
9998 local_define_builtin ("__builtin_init_trampoline", ftype
,
9999 BUILT_IN_INIT_TRAMPOLINE
,
10000 "__builtin_init_trampoline", ECF_NOTHROW
| ECF_LEAF
);
10001 local_define_builtin ("__builtin_init_heap_trampoline", ftype
,
10002 BUILT_IN_INIT_HEAP_TRAMPOLINE
,
10003 "__builtin_init_heap_trampoline",
10004 ECF_NOTHROW
| ECF_LEAF
);
10006 ftype
= build_function_type_list (ptr_type_node
, ptr_type_node
, NULL_TREE
);
10007 local_define_builtin ("__builtin_adjust_trampoline", ftype
,
10008 BUILT_IN_ADJUST_TRAMPOLINE
,
10009 "__builtin_adjust_trampoline",
10010 ECF_CONST
| ECF_NOTHROW
);
10012 ftype
= build_function_type_list (void_type_node
,
10013 ptr_type_node
, ptr_type_node
, NULL_TREE
);
10014 local_define_builtin ("__builtin_nonlocal_goto", ftype
,
10015 BUILT_IN_NONLOCAL_GOTO
,
10016 "__builtin_nonlocal_goto",
10017 ECF_NORETURN
| ECF_NOTHROW
);
10019 ftype
= build_function_type_list (void_type_node
,
10020 ptr_type_node
, ptr_type_node
, NULL_TREE
);
10021 local_define_builtin ("__builtin_setjmp_setup", ftype
,
10022 BUILT_IN_SETJMP_SETUP
,
10023 "__builtin_setjmp_setup", ECF_NOTHROW
);
10025 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10026 local_define_builtin ("__builtin_setjmp_receiver", ftype
,
10027 BUILT_IN_SETJMP_RECEIVER
,
10028 "__builtin_setjmp_receiver", ECF_NOTHROW
| ECF_LEAF
);
10030 ftype
= build_function_type_list (ptr_type_node
, NULL_TREE
);
10031 local_define_builtin ("__builtin_stack_save", ftype
, BUILT_IN_STACK_SAVE
,
10032 "__builtin_stack_save", ECF_NOTHROW
| ECF_LEAF
);
10034 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10035 local_define_builtin ("__builtin_stack_restore", ftype
,
10036 BUILT_IN_STACK_RESTORE
,
10037 "__builtin_stack_restore", ECF_NOTHROW
| ECF_LEAF
);
10039 /* If there's a possibility that we might use the ARM EABI, build the
10040 alternate __cxa_end_cleanup node used to resume from C++ and Java. */
10041 if (targetm
.arm_eabi_unwinder
)
10043 ftype
= build_function_type_list (void_type_node
, NULL_TREE
);
10044 local_define_builtin ("__builtin_cxa_end_cleanup", ftype
,
10045 BUILT_IN_CXA_END_CLEANUP
,
10046 "__cxa_end_cleanup", ECF_NORETURN
| ECF_LEAF
);
10049 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10050 local_define_builtin ("__builtin_unwind_resume", ftype
,
10051 BUILT_IN_UNWIND_RESUME
,
10052 ((targetm_common
.except_unwind_info (&global_options
)
10054 ? "_Unwind_SjLj_Resume" : "_Unwind_Resume"),
10057 if (builtin_decl_explicit (BUILT_IN_RETURN_ADDRESS
) == NULL_TREE
)
10059 ftype
= build_function_type_list (ptr_type_node
, integer_type_node
,
10061 local_define_builtin ("__builtin_return_address", ftype
,
10062 BUILT_IN_RETURN_ADDRESS
,
10063 "__builtin_return_address",
10067 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
)
10068 || !builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
10070 ftype
= build_function_type_list (void_type_node
, ptr_type_node
,
10071 ptr_type_node
, NULL_TREE
);
10072 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
))
10073 local_define_builtin ("__cyg_profile_func_enter", ftype
,
10074 BUILT_IN_PROFILE_FUNC_ENTER
,
10075 "__cyg_profile_func_enter", 0);
10076 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
10077 local_define_builtin ("__cyg_profile_func_exit", ftype
,
10078 BUILT_IN_PROFILE_FUNC_EXIT
,
10079 "__cyg_profile_func_exit", 0);
10082 /* The exception object and filter values from the runtime. The argument
10083 must be zero before exception lowering, i.e. from the front end. After
10084 exception lowering, it will be the region number for the exception
10085 landing pad. These functions are PURE instead of CONST to prevent
10086 them from being hoisted past the exception edge that will initialize
10087 its value in the landing pad. */
10088 ftype
= build_function_type_list (ptr_type_node
,
10089 integer_type_node
, NULL_TREE
);
10090 ecf_flags
= ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
;
10091 /* Only use TM_PURE if we we have TM language support. */
10092 if (builtin_decl_explicit_p (BUILT_IN_TM_LOAD_1
))
10093 ecf_flags
|= ECF_TM_PURE
;
10094 local_define_builtin ("__builtin_eh_pointer", ftype
, BUILT_IN_EH_POINTER
,
10095 "__builtin_eh_pointer", ecf_flags
);
10097 tmp
= lang_hooks
.types
.type_for_mode (targetm
.eh_return_filter_mode (), 0);
10098 ftype
= build_function_type_list (tmp
, integer_type_node
, NULL_TREE
);
10099 local_define_builtin ("__builtin_eh_filter", ftype
, BUILT_IN_EH_FILTER
,
10100 "__builtin_eh_filter", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10102 ftype
= build_function_type_list (void_type_node
,
10103 integer_type_node
, integer_type_node
,
10105 local_define_builtin ("__builtin_eh_copy_values", ftype
,
10106 BUILT_IN_EH_COPY_VALUES
,
10107 "__builtin_eh_copy_values", ECF_NOTHROW
);
10109 /* Complex multiplication and division. These are handled as builtins
10110 rather than optabs because emit_library_call_value doesn't support
10111 complex. Further, we can do slightly better with folding these
10112 beasties if the real and complex parts of the arguments are separate. */
10116 for (mode
= MIN_MODE_COMPLEX_FLOAT
; mode
<= MAX_MODE_COMPLEX_FLOAT
; ++mode
)
10118 char mode_name_buf
[4], *q
;
10120 enum built_in_function mcode
, dcode
;
10121 tree type
, inner_type
;
10122 const char *prefix
= "__";
10124 if (targetm
.libfunc_gnu_prefix
)
10127 type
= lang_hooks
.types
.type_for_mode ((machine_mode
) mode
, 0);
10130 inner_type
= TREE_TYPE (type
);
10132 ftype
= build_function_type_list (type
, inner_type
, inner_type
,
10133 inner_type
, inner_type
, NULL_TREE
);
10135 mcode
= ((enum built_in_function
)
10136 (BUILT_IN_COMPLEX_MUL_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
10137 dcode
= ((enum built_in_function
)
10138 (BUILT_IN_COMPLEX_DIV_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
10140 for (p
= GET_MODE_NAME (mode
), q
= mode_name_buf
; *p
; p
++, q
++)
10144 built_in_names
[mcode
] = concat (prefix
, "mul", mode_name_buf
, "3",
10146 local_define_builtin (built_in_names
[mcode
], ftype
, mcode
,
10147 built_in_names
[mcode
],
10148 ECF_CONST
| ECF_NOTHROW
| ECF_LEAF
);
10150 built_in_names
[dcode
] = concat (prefix
, "div", mode_name_buf
, "3",
10152 local_define_builtin (built_in_names
[dcode
], ftype
, dcode
,
10153 built_in_names
[dcode
],
10154 ECF_CONST
| ECF_NOTHROW
| ECF_LEAF
);
10158 init_internal_fns ();
10161 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
10164 If we requested a pointer to a vector, build up the pointers that
10165 we stripped off while looking for the inner type. Similarly for
10166 return values from functions.
10168 The argument TYPE is the top of the chain, and BOTTOM is the
10169 new type which we will point to. */
10172 reconstruct_complex_type (tree type
, tree bottom
)
10176 if (TREE_CODE (type
) == POINTER_TYPE
)
10178 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10179 outer
= build_pointer_type_for_mode (inner
, TYPE_MODE (type
),
10180 TYPE_REF_CAN_ALIAS_ALL (type
));
10182 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
10184 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10185 outer
= build_reference_type_for_mode (inner
, TYPE_MODE (type
),
10186 TYPE_REF_CAN_ALIAS_ALL (type
));
10188 else if (TREE_CODE (type
) == ARRAY_TYPE
)
10190 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10191 outer
= build_array_type (inner
, TYPE_DOMAIN (type
));
10193 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10195 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10196 outer
= build_function_type (inner
, TYPE_ARG_TYPES (type
));
10198 else if (TREE_CODE (type
) == METHOD_TYPE
)
10200 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10201 /* The build_method_type_directly() routine prepends 'this' to argument list,
10202 so we must compensate by getting rid of it. */
10204 = build_method_type_directly
10205 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
))),
10207 TREE_CHAIN (TYPE_ARG_TYPES (type
)));
10209 else if (TREE_CODE (type
) == OFFSET_TYPE
)
10211 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10212 outer
= build_offset_type (TYPE_OFFSET_BASETYPE (type
), inner
);
10217 return build_type_attribute_qual_variant (outer
, TYPE_ATTRIBUTES (type
),
10218 TYPE_QUALS (type
));
10221 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
10224 build_vector_type_for_mode (tree innertype
, machine_mode mode
)
10228 switch (GET_MODE_CLASS (mode
))
10230 case MODE_VECTOR_INT
:
10231 case MODE_VECTOR_FLOAT
:
10232 case MODE_VECTOR_FRACT
:
10233 case MODE_VECTOR_UFRACT
:
10234 case MODE_VECTOR_ACCUM
:
10235 case MODE_VECTOR_UACCUM
:
10236 nunits
= GET_MODE_NUNITS (mode
);
10240 /* Check that there are no leftover bits. */
10241 gcc_assert (GET_MODE_BITSIZE (mode
)
10242 % TREE_INT_CST_LOW (TYPE_SIZE (innertype
)) == 0);
10244 nunits
= GET_MODE_BITSIZE (mode
)
10245 / TREE_INT_CST_LOW (TYPE_SIZE (innertype
));
10249 gcc_unreachable ();
10252 return make_vector_type (innertype
, nunits
, mode
);
10255 /* Similarly, but takes the inner type and number of units, which must be
10259 build_vector_type (tree innertype
, int nunits
)
10261 return make_vector_type (innertype
, nunits
, VOIDmode
);
10264 /* Similarly, but builds a variant type with TYPE_VECTOR_OPAQUE set. */
10267 build_opaque_vector_type (tree innertype
, int nunits
)
10269 tree t
= make_vector_type (innertype
, nunits
, VOIDmode
);
10271 /* We always build the non-opaque variant before the opaque one,
10272 so if it already exists, it is TYPE_NEXT_VARIANT of this one. */
10273 cand
= TYPE_NEXT_VARIANT (t
);
10275 && TYPE_VECTOR_OPAQUE (cand
)
10276 && check_qualified_type (cand
, t
, TYPE_QUALS (t
)))
10278 /* Othewise build a variant type and make sure to queue it after
10279 the non-opaque type. */
10280 cand
= build_distinct_type_copy (t
);
10281 TYPE_VECTOR_OPAQUE (cand
) = true;
10282 TYPE_CANONICAL (cand
) = TYPE_CANONICAL (t
);
10283 TYPE_NEXT_VARIANT (cand
) = TYPE_NEXT_VARIANT (t
);
10284 TYPE_NEXT_VARIANT (t
) = cand
;
10285 TYPE_MAIN_VARIANT (cand
) = TYPE_MAIN_VARIANT (t
);
10290 /* Given an initializer INIT, return TRUE if INIT is zero or some
10291 aggregate of zeros. Otherwise return FALSE. */
10293 initializer_zerop (const_tree init
)
10299 switch (TREE_CODE (init
))
10302 return integer_zerop (init
);
10305 /* ??? Note that this is not correct for C4X float formats. There,
10306 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
10307 negative exponent. */
10308 return real_zerop (init
)
10309 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init
));
10312 return fixed_zerop (init
);
10315 return integer_zerop (init
)
10316 || (real_zerop (init
)
10317 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init
)))
10318 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init
))));
10323 for (i
= 0; i
< VECTOR_CST_NELTS (init
); ++i
)
10324 if (!initializer_zerop (VECTOR_CST_ELT (init
, i
)))
10331 unsigned HOST_WIDE_INT idx
;
10333 if (TREE_CLOBBER_P (init
))
10335 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init
), idx
, elt
)
10336 if (!initializer_zerop (elt
))
10345 /* We need to loop through all elements to handle cases like
10346 "\0" and "\0foobar". */
10347 for (i
= 0; i
< TREE_STRING_LENGTH (init
); ++i
)
10348 if (TREE_STRING_POINTER (init
)[i
] != '\0')
10359 /* Check if vector VEC consists of all the equal elements and
10360 that the number of elements corresponds to the type of VEC.
10361 The function returns first element of the vector
10362 or NULL_TREE if the vector is not uniform. */
10364 uniform_vector_p (const_tree vec
)
10369 if (vec
== NULL_TREE
)
10372 gcc_assert (VECTOR_TYPE_P (TREE_TYPE (vec
)));
10374 if (TREE_CODE (vec
) == VECTOR_CST
)
10376 first
= VECTOR_CST_ELT (vec
, 0);
10377 for (i
= 1; i
< VECTOR_CST_NELTS (vec
); ++i
)
10378 if (!operand_equal_p (first
, VECTOR_CST_ELT (vec
, i
), 0))
10384 else if (TREE_CODE (vec
) == CONSTRUCTOR
)
10386 first
= error_mark_node
;
10388 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (vec
), i
, t
)
10395 if (!operand_equal_p (first
, t
, 0))
10398 if (i
!= TYPE_VECTOR_SUBPARTS (TREE_TYPE (vec
)))
10407 /* Build an empty statement at location LOC. */
10410 build_empty_stmt (location_t loc
)
10412 tree t
= build1 (NOP_EXPR
, void_type_node
, size_zero_node
);
10413 SET_EXPR_LOCATION (t
, loc
);
10418 /* Build an OpenMP clause with code CODE. LOC is the location of the
10422 build_omp_clause (location_t loc
, enum omp_clause_code code
)
10427 length
= omp_clause_num_ops
[code
];
10428 size
= (sizeof (struct tree_omp_clause
) + (length
- 1) * sizeof (tree
));
10430 record_node_allocation_statistics (OMP_CLAUSE
, size
);
10432 t
= (tree
) ggc_internal_alloc (size
);
10433 memset (t
, 0, size
);
10434 TREE_SET_CODE (t
, OMP_CLAUSE
);
10435 OMP_CLAUSE_SET_CODE (t
, code
);
10436 OMP_CLAUSE_LOCATION (t
) = loc
;
10441 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
10442 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
10443 Except for the CODE and operand count field, other storage for the
10444 object is initialized to zeros. */
10447 build_vl_exp_stat (enum tree_code code
, int len MEM_STAT_DECL
)
10450 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_exp
);
10452 gcc_assert (TREE_CODE_CLASS (code
) == tcc_vl_exp
);
10453 gcc_assert (len
>= 1);
10455 record_node_allocation_statistics (code
, length
);
10457 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
10459 TREE_SET_CODE (t
, code
);
10461 /* Can't use TREE_OPERAND to store the length because if checking is
10462 enabled, it will try to check the length before we store it. :-P */
10463 t
->exp
.operands
[0] = build_int_cst (sizetype
, len
);
10468 /* Helper function for build_call_* functions; build a CALL_EXPR with
10469 indicated RETURN_TYPE, FN, and NARGS, but do not initialize any of
10470 the argument slots. */
10473 build_call_1 (tree return_type
, tree fn
, int nargs
)
10477 t
= build_vl_exp (CALL_EXPR
, nargs
+ 3);
10478 TREE_TYPE (t
) = return_type
;
10479 CALL_EXPR_FN (t
) = fn
;
10480 CALL_EXPR_STATIC_CHAIN (t
) = NULL
;
10485 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10486 FN and a null static chain slot. NARGS is the number of call arguments
10487 which are specified as "..." arguments. */
10490 build_call_nary (tree return_type
, tree fn
, int nargs
, ...)
10494 va_start (args
, nargs
);
10495 ret
= build_call_valist (return_type
, fn
, nargs
, args
);
10500 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10501 FN and a null static chain slot. NARGS is the number of call arguments
10502 which are specified as a va_list ARGS. */
10505 build_call_valist (tree return_type
, tree fn
, int nargs
, va_list args
)
10510 t
= build_call_1 (return_type
, fn
, nargs
);
10511 for (i
= 0; i
< nargs
; i
++)
10512 CALL_EXPR_ARG (t
, i
) = va_arg (args
, tree
);
10513 process_call_operands (t
);
10517 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10518 FN and a null static chain slot. NARGS is the number of call arguments
10519 which are specified as a tree array ARGS. */
10522 build_call_array_loc (location_t loc
, tree return_type
, tree fn
,
10523 int nargs
, const tree
*args
)
10528 t
= build_call_1 (return_type
, fn
, nargs
);
10529 for (i
= 0; i
< nargs
; i
++)
10530 CALL_EXPR_ARG (t
, i
) = args
[i
];
10531 process_call_operands (t
);
10532 SET_EXPR_LOCATION (t
, loc
);
10536 /* Like build_call_array, but takes a vec. */
10539 build_call_vec (tree return_type
, tree fn
, vec
<tree
, va_gc
> *args
)
10544 ret
= build_call_1 (return_type
, fn
, vec_safe_length (args
));
10545 FOR_EACH_VEC_SAFE_ELT (args
, ix
, t
)
10546 CALL_EXPR_ARG (ret
, ix
) = t
;
10547 process_call_operands (ret
);
10551 /* Conveniently construct a function call expression. FNDECL names the
10552 function to be called and N arguments are passed in the array
10556 build_call_expr_loc_array (location_t loc
, tree fndecl
, int n
, tree
*argarray
)
10558 tree fntype
= TREE_TYPE (fndecl
);
10559 tree fn
= build1 (ADDR_EXPR
, build_pointer_type (fntype
), fndecl
);
10561 return fold_builtin_call_array (loc
, TREE_TYPE (fntype
), fn
, n
, argarray
);
10564 /* Conveniently construct a function call expression. FNDECL names the
10565 function to be called and the arguments are passed in the vector
10569 build_call_expr_loc_vec (location_t loc
, tree fndecl
, vec
<tree
, va_gc
> *vec
)
10571 return build_call_expr_loc_array (loc
, fndecl
, vec_safe_length (vec
),
10572 vec_safe_address (vec
));
10576 /* Conveniently construct a function call expression. FNDECL names the
10577 function to be called, N is the number of arguments, and the "..."
10578 parameters are the argument expressions. */
10581 build_call_expr_loc (location_t loc
, tree fndecl
, int n
, ...)
10584 tree
*argarray
= XALLOCAVEC (tree
, n
);
10588 for (i
= 0; i
< n
; i
++)
10589 argarray
[i
] = va_arg (ap
, tree
);
10591 return build_call_expr_loc_array (loc
, fndecl
, n
, argarray
);
10594 /* Like build_call_expr_loc (UNKNOWN_LOCATION, ...). Duplicated because
10595 varargs macros aren't supported by all bootstrap compilers. */
10598 build_call_expr (tree fndecl
, int n
, ...)
10601 tree
*argarray
= XALLOCAVEC (tree
, n
);
10605 for (i
= 0; i
< n
; i
++)
10606 argarray
[i
] = va_arg (ap
, tree
);
10608 return build_call_expr_loc_array (UNKNOWN_LOCATION
, fndecl
, n
, argarray
);
10611 /* Build internal call expression. This is just like CALL_EXPR, except
10612 its CALL_EXPR_FN is NULL. It will get gimplified later into ordinary
10613 internal function. */
10616 build_call_expr_internal_loc (location_t loc
, enum internal_fn ifn
,
10617 tree type
, int n
, ...)
10622 tree fn
= build_call_1 (type
, NULL_TREE
, n
);
10624 for (i
= 0; i
< n
; i
++)
10625 CALL_EXPR_ARG (fn
, i
) = va_arg (ap
, tree
);
10627 SET_EXPR_LOCATION (fn
, loc
);
10628 CALL_EXPR_IFN (fn
) = ifn
;
10632 /* Create a new constant string literal and return a char* pointer to it.
10633 The STRING_CST value is the LEN characters at STR. */
10635 build_string_literal (int len
, const char *str
)
10637 tree t
, elem
, index
, type
;
10639 t
= build_string (len
, str
);
10640 elem
= build_type_variant (char_type_node
, 1, 0);
10641 index
= build_index_type (size_int (len
- 1));
10642 type
= build_array_type (elem
, index
);
10643 TREE_TYPE (t
) = type
;
10644 TREE_CONSTANT (t
) = 1;
10645 TREE_READONLY (t
) = 1;
10646 TREE_STATIC (t
) = 1;
10648 type
= build_pointer_type (elem
);
10649 t
= build1 (ADDR_EXPR
, type
,
10650 build4 (ARRAY_REF
, elem
,
10651 t
, integer_zero_node
, NULL_TREE
, NULL_TREE
));
10657 /* Return true if T (assumed to be a DECL) must be assigned a memory
10661 needs_to_live_in_memory (const_tree t
)
10663 return (TREE_ADDRESSABLE (t
)
10664 || is_global_var (t
)
10665 || (TREE_CODE (t
) == RESULT_DECL
10666 && !DECL_BY_REFERENCE (t
)
10667 && aggregate_value_p (t
, current_function_decl
)));
10670 /* Return value of a constant X and sign-extend it. */
10673 int_cst_value (const_tree x
)
10675 unsigned bits
= TYPE_PRECISION (TREE_TYPE (x
));
10676 unsigned HOST_WIDE_INT val
= TREE_INT_CST_LOW (x
);
10678 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
10679 gcc_assert (cst_and_fits_in_hwi (x
));
10681 if (bits
< HOST_BITS_PER_WIDE_INT
)
10683 bool negative
= ((val
>> (bits
- 1)) & 1) != 0;
10685 val
|= (~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1;
10687 val
&= ~((~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1);
10693 /* If TYPE is an integral or pointer type, return an integer type with
10694 the same precision which is unsigned iff UNSIGNEDP is true, or itself
10695 if TYPE is already an integer type of signedness UNSIGNEDP. */
10698 signed_or_unsigned_type_for (int unsignedp
, tree type
)
10700 if (TREE_CODE (type
) == INTEGER_TYPE
&& TYPE_UNSIGNED (type
) == unsignedp
)
10703 if (TREE_CODE (type
) == VECTOR_TYPE
)
10705 tree inner
= TREE_TYPE (type
);
10706 tree inner2
= signed_or_unsigned_type_for (unsignedp
, inner
);
10709 if (inner
== inner2
)
10711 return build_vector_type (inner2
, TYPE_VECTOR_SUBPARTS (type
));
10714 if (!INTEGRAL_TYPE_P (type
)
10715 && !POINTER_TYPE_P (type
)
10716 && TREE_CODE (type
) != OFFSET_TYPE
)
10719 return build_nonstandard_integer_type (TYPE_PRECISION (type
), unsignedp
);
10722 /* If TYPE is an integral or pointer type, return an integer type with
10723 the same precision which is unsigned, or itself if TYPE is already an
10724 unsigned integer type. */
10727 unsigned_type_for (tree type
)
10729 return signed_or_unsigned_type_for (1, type
);
10732 /* If TYPE is an integral or pointer type, return an integer type with
10733 the same precision which is signed, or itself if TYPE is already a
10734 signed integer type. */
10737 signed_type_for (tree type
)
10739 return signed_or_unsigned_type_for (0, type
);
10742 /* If TYPE is a vector type, return a signed integer vector type with the
10743 same width and number of subparts. Otherwise return boolean_type_node. */
10746 truth_type_for (tree type
)
10748 if (TREE_CODE (type
) == VECTOR_TYPE
)
10750 tree elem
= lang_hooks
.types
.type_for_size
10751 (GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (type
))), 0);
10752 return build_opaque_vector_type (elem
, TYPE_VECTOR_SUBPARTS (type
));
10755 return boolean_type_node
;
10758 /* Returns the largest value obtainable by casting something in INNER type to
10762 upper_bound_in_type (tree outer
, tree inner
)
10764 unsigned int det
= 0;
10765 unsigned oprec
= TYPE_PRECISION (outer
);
10766 unsigned iprec
= TYPE_PRECISION (inner
);
10769 /* Compute a unique number for every combination. */
10770 det
|= (oprec
> iprec
) ? 4 : 0;
10771 det
|= TYPE_UNSIGNED (outer
) ? 2 : 0;
10772 det
|= TYPE_UNSIGNED (inner
) ? 1 : 0;
10774 /* Determine the exponent to use. */
10779 /* oprec <= iprec, outer: signed, inner: don't care. */
10784 /* oprec <= iprec, outer: unsigned, inner: don't care. */
10788 /* oprec > iprec, outer: signed, inner: signed. */
10792 /* oprec > iprec, outer: signed, inner: unsigned. */
10796 /* oprec > iprec, outer: unsigned, inner: signed. */
10800 /* oprec > iprec, outer: unsigned, inner: unsigned. */
10804 gcc_unreachable ();
10807 return wide_int_to_tree (outer
,
10808 wi::mask (prec
, false, TYPE_PRECISION (outer
)));
10811 /* Returns the smallest value obtainable by casting something in INNER type to
10815 lower_bound_in_type (tree outer
, tree inner
)
10817 unsigned oprec
= TYPE_PRECISION (outer
);
10818 unsigned iprec
= TYPE_PRECISION (inner
);
10820 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
10822 if (TYPE_UNSIGNED (outer
)
10823 /* If we are widening something of an unsigned type, OUTER type
10824 contains all values of INNER type. In particular, both INNER
10825 and OUTER types have zero in common. */
10826 || (oprec
> iprec
&& TYPE_UNSIGNED (inner
)))
10827 return build_int_cst (outer
, 0);
10830 /* If we are widening a signed type to another signed type, we
10831 want to obtain -2^^(iprec-1). If we are keeping the
10832 precision or narrowing to a signed type, we want to obtain
10834 unsigned prec
= oprec
> iprec
? iprec
: oprec
;
10835 return wide_int_to_tree (outer
,
10836 wi::mask (prec
- 1, true,
10837 TYPE_PRECISION (outer
)));
10841 /* Return nonzero if two operands that are suitable for PHI nodes are
10842 necessarily equal. Specifically, both ARG0 and ARG1 must be either
10843 SSA_NAME or invariant. Note that this is strictly an optimization.
10844 That is, callers of this function can directly call operand_equal_p
10845 and get the same result, only slower. */
10848 operand_equal_for_phi_arg_p (const_tree arg0
, const_tree arg1
)
10852 if (TREE_CODE (arg0
) == SSA_NAME
|| TREE_CODE (arg1
) == SSA_NAME
)
10854 return operand_equal_p (arg0
, arg1
, 0);
10857 /* Returns number of zeros at the end of binary representation of X. */
10860 num_ending_zeros (const_tree x
)
10862 return build_int_cst (TREE_TYPE (x
), wi::ctz (x
));
10866 #define WALK_SUBTREE(NODE) \
10869 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
10875 /* This is a subroutine of walk_tree that walks field of TYPE that are to
10876 be walked whenever a type is seen in the tree. Rest of operands and return
10877 value are as for walk_tree. */
10880 walk_type_fields (tree type
, walk_tree_fn func
, void *data
,
10881 hash_set
<tree
> *pset
, walk_tree_lh lh
)
10883 tree result
= NULL_TREE
;
10885 switch (TREE_CODE (type
))
10888 case REFERENCE_TYPE
:
10890 /* We have to worry about mutually recursive pointers. These can't
10891 be written in C. They can in Ada. It's pathological, but
10892 there's an ACATS test (c38102a) that checks it. Deal with this
10893 by checking if we're pointing to another pointer, that one
10894 points to another pointer, that one does too, and we have no htab.
10895 If so, get a hash table. We check three levels deep to avoid
10896 the cost of the hash table if we don't need one. */
10897 if (POINTER_TYPE_P (TREE_TYPE (type
))
10898 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type
)))
10899 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type
))))
10902 result
= walk_tree_without_duplicates (&TREE_TYPE (type
),
10910 /* ... fall through ... */
10913 WALK_SUBTREE (TREE_TYPE (type
));
10917 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type
));
10919 /* Fall through. */
10921 case FUNCTION_TYPE
:
10922 WALK_SUBTREE (TREE_TYPE (type
));
10926 /* We never want to walk into default arguments. */
10927 for (arg
= TYPE_ARG_TYPES (type
); arg
; arg
= TREE_CHAIN (arg
))
10928 WALK_SUBTREE (TREE_VALUE (arg
));
10933 /* Don't follow this nodes's type if a pointer for fear that
10934 we'll have infinite recursion. If we have a PSET, then we
10937 || (!POINTER_TYPE_P (TREE_TYPE (type
))
10938 && TREE_CODE (TREE_TYPE (type
)) != OFFSET_TYPE
))
10939 WALK_SUBTREE (TREE_TYPE (type
));
10940 WALK_SUBTREE (TYPE_DOMAIN (type
));
10944 WALK_SUBTREE (TREE_TYPE (type
));
10945 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type
));
10955 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
10956 called with the DATA and the address of each sub-tree. If FUNC returns a
10957 non-NULL value, the traversal is stopped, and the value returned by FUNC
10958 is returned. If PSET is non-NULL it is used to record the nodes visited,
10959 and to avoid visiting a node more than once. */
10962 walk_tree_1 (tree
*tp
, walk_tree_fn func
, void *data
,
10963 hash_set
<tree
> *pset
, walk_tree_lh lh
)
10965 enum tree_code code
;
10969 #define WALK_SUBTREE_TAIL(NODE) \
10973 goto tail_recurse; \
10978 /* Skip empty subtrees. */
10982 /* Don't walk the same tree twice, if the user has requested
10983 that we avoid doing so. */
10984 if (pset
&& pset
->add (*tp
))
10987 /* Call the function. */
10989 result
= (*func
) (tp
, &walk_subtrees
, data
);
10991 /* If we found something, return it. */
10995 code
= TREE_CODE (*tp
);
10997 /* Even if we didn't, FUNC may have decided that there was nothing
10998 interesting below this point in the tree. */
10999 if (!walk_subtrees
)
11001 /* But we still need to check our siblings. */
11002 if (code
== TREE_LIST
)
11003 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
11004 else if (code
== OMP_CLAUSE
)
11005 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11012 result
= (*lh
) (tp
, &walk_subtrees
, func
, data
, pset
);
11013 if (result
|| !walk_subtrees
)
11020 case IDENTIFIER_NODE
:
11027 case PLACEHOLDER_EXPR
:
11031 /* None of these have subtrees other than those already walked
11036 WALK_SUBTREE (TREE_VALUE (*tp
));
11037 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
11042 int len
= TREE_VEC_LENGTH (*tp
);
11047 /* Walk all elements but the first. */
11049 WALK_SUBTREE (TREE_VEC_ELT (*tp
, len
));
11051 /* Now walk the first one as a tail call. */
11052 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp
, 0));
11056 WALK_SUBTREE (TREE_REALPART (*tp
));
11057 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp
));
11061 unsigned HOST_WIDE_INT idx
;
11062 constructor_elt
*ce
;
11064 for (idx
= 0; vec_safe_iterate (CONSTRUCTOR_ELTS (*tp
), idx
, &ce
);
11066 WALK_SUBTREE (ce
->value
);
11071 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, 0));
11076 for (decl
= BIND_EXPR_VARS (*tp
); decl
; decl
= DECL_CHAIN (decl
))
11078 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
11079 into declarations that are just mentioned, rather than
11080 declared; they don't really belong to this part of the tree.
11081 And, we can see cycles: the initializer for a declaration
11082 can refer to the declaration itself. */
11083 WALK_SUBTREE (DECL_INITIAL (decl
));
11084 WALK_SUBTREE (DECL_SIZE (decl
));
11085 WALK_SUBTREE (DECL_SIZE_UNIT (decl
));
11087 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp
));
11090 case STATEMENT_LIST
:
11092 tree_stmt_iterator i
;
11093 for (i
= tsi_start (*tp
); !tsi_end_p (i
); tsi_next (&i
))
11094 WALK_SUBTREE (*tsi_stmt_ptr (i
));
11099 switch (OMP_CLAUSE_CODE (*tp
))
11101 case OMP_CLAUSE_PRIVATE
:
11102 case OMP_CLAUSE_SHARED
:
11103 case OMP_CLAUSE_FIRSTPRIVATE
:
11104 case OMP_CLAUSE_COPYIN
:
11105 case OMP_CLAUSE_COPYPRIVATE
:
11106 case OMP_CLAUSE_FINAL
:
11107 case OMP_CLAUSE_IF
:
11108 case OMP_CLAUSE_NUM_THREADS
:
11109 case OMP_CLAUSE_SCHEDULE
:
11110 case OMP_CLAUSE_UNIFORM
:
11111 case OMP_CLAUSE_DEPEND
:
11112 case OMP_CLAUSE_NUM_TEAMS
:
11113 case OMP_CLAUSE_THREAD_LIMIT
:
11114 case OMP_CLAUSE_DEVICE
:
11115 case OMP_CLAUSE_DIST_SCHEDULE
:
11116 case OMP_CLAUSE_SAFELEN
:
11117 case OMP_CLAUSE_SIMDLEN
:
11118 case OMP_CLAUSE__LOOPTEMP_
:
11119 case OMP_CLAUSE__SIMDUID_
:
11120 case OMP_CLAUSE__CILK_FOR_COUNT_
:
11121 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 0));
11124 case OMP_CLAUSE_NOWAIT
:
11125 case OMP_CLAUSE_ORDERED
:
11126 case OMP_CLAUSE_DEFAULT
:
11127 case OMP_CLAUSE_UNTIED
:
11128 case OMP_CLAUSE_MERGEABLE
:
11129 case OMP_CLAUSE_PROC_BIND
:
11130 case OMP_CLAUSE_INBRANCH
:
11131 case OMP_CLAUSE_NOTINBRANCH
:
11132 case OMP_CLAUSE_FOR
:
11133 case OMP_CLAUSE_PARALLEL
:
11134 case OMP_CLAUSE_SECTIONS
:
11135 case OMP_CLAUSE_TASKGROUP
:
11136 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11138 case OMP_CLAUSE_LASTPRIVATE
:
11139 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
11140 WALK_SUBTREE (OMP_CLAUSE_LASTPRIVATE_STMT (*tp
));
11141 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11143 case OMP_CLAUSE_COLLAPSE
:
11146 for (i
= 0; i
< 3; i
++)
11147 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
11148 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11151 case OMP_CLAUSE_LINEAR
:
11152 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
11153 WALK_SUBTREE (OMP_CLAUSE_LINEAR_STEP (*tp
));
11154 WALK_SUBTREE (OMP_CLAUSE_LINEAR_STMT (*tp
));
11155 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11157 case OMP_CLAUSE_ALIGNED
:
11158 case OMP_CLAUSE_FROM
:
11159 case OMP_CLAUSE_TO
:
11160 case OMP_CLAUSE_MAP
:
11161 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
11162 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 1));
11163 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11165 case OMP_CLAUSE_REDUCTION
:
11168 for (i
= 0; i
< 4; i
++)
11169 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
11170 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11174 gcc_unreachable ();
11182 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
11183 But, we only want to walk once. */
11184 len
= (TREE_OPERAND (*tp
, 3) == TREE_OPERAND (*tp
, 1)) ? 2 : 3;
11185 for (i
= 0; i
< len
; ++i
)
11186 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
11187 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
));
11191 /* If this is a TYPE_DECL, walk into the fields of the type that it's
11192 defining. We only want to walk into these fields of a type in this
11193 case and not in the general case of a mere reference to the type.
11195 The criterion is as follows: if the field can be an expression, it
11196 must be walked only here. This should be in keeping with the fields
11197 that are directly gimplified in gimplify_type_sizes in order for the
11198 mark/copy-if-shared/unmark machinery of the gimplifier to work with
11199 variable-sized types.
11201 Note that DECLs get walked as part of processing the BIND_EXPR. */
11202 if (TREE_CODE (DECL_EXPR_DECL (*tp
)) == TYPE_DECL
)
11204 tree
*type_p
= &TREE_TYPE (DECL_EXPR_DECL (*tp
));
11205 if (TREE_CODE (*type_p
) == ERROR_MARK
)
11208 /* Call the function for the type. See if it returns anything or
11209 doesn't want us to continue. If we are to continue, walk both
11210 the normal fields and those for the declaration case. */
11211 result
= (*func
) (type_p
, &walk_subtrees
, data
);
11212 if (result
|| !walk_subtrees
)
11215 /* But do not walk a pointed-to type since it may itself need to
11216 be walked in the declaration case if it isn't anonymous. */
11217 if (!POINTER_TYPE_P (*type_p
))
11219 result
= walk_type_fields (*type_p
, func
, data
, pset
, lh
);
11224 /* If this is a record type, also walk the fields. */
11225 if (RECORD_OR_UNION_TYPE_P (*type_p
))
11229 for (field
= TYPE_FIELDS (*type_p
); field
;
11230 field
= DECL_CHAIN (field
))
11232 /* We'd like to look at the type of the field, but we can
11233 easily get infinite recursion. So assume it's pointed
11234 to elsewhere in the tree. Also, ignore things that
11236 if (TREE_CODE (field
) != FIELD_DECL
)
11239 WALK_SUBTREE (DECL_FIELD_OFFSET (field
));
11240 WALK_SUBTREE (DECL_SIZE (field
));
11241 WALK_SUBTREE (DECL_SIZE_UNIT (field
));
11242 if (TREE_CODE (*type_p
) == QUAL_UNION_TYPE
)
11243 WALK_SUBTREE (DECL_QUALIFIER (field
));
11247 /* Same for scalar types. */
11248 else if (TREE_CODE (*type_p
) == BOOLEAN_TYPE
11249 || TREE_CODE (*type_p
) == ENUMERAL_TYPE
11250 || TREE_CODE (*type_p
) == INTEGER_TYPE
11251 || TREE_CODE (*type_p
) == FIXED_POINT_TYPE
11252 || TREE_CODE (*type_p
) == REAL_TYPE
)
11254 WALK_SUBTREE (TYPE_MIN_VALUE (*type_p
));
11255 WALK_SUBTREE (TYPE_MAX_VALUE (*type_p
));
11258 WALK_SUBTREE (TYPE_SIZE (*type_p
));
11259 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p
));
11264 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code
)))
11268 /* Walk over all the sub-trees of this operand. */
11269 len
= TREE_OPERAND_LENGTH (*tp
);
11271 /* Go through the subtrees. We need to do this in forward order so
11272 that the scope of a FOR_EXPR is handled properly. */
11275 for (i
= 0; i
< len
- 1; ++i
)
11276 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
11277 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
- 1));
11280 /* If this is a type, walk the needed fields in the type. */
11281 else if (TYPE_P (*tp
))
11282 return walk_type_fields (*tp
, func
, data
, pset
, lh
);
11286 /* We didn't find what we were looking for. */
11289 #undef WALK_SUBTREE_TAIL
11291 #undef WALK_SUBTREE
11293 /* Like walk_tree, but does not walk duplicate nodes more than once. */
11296 walk_tree_without_duplicates_1 (tree
*tp
, walk_tree_fn func
, void *data
,
11301 hash_set
<tree
> pset
;
11302 result
= walk_tree_1 (tp
, func
, data
, &pset
, lh
);
11308 tree_block (tree t
)
11310 const enum tree_code_class c
= TREE_CODE_CLASS (TREE_CODE (t
));
11312 if (IS_EXPR_CODE_CLASS (c
))
11313 return LOCATION_BLOCK (t
->exp
.locus
);
11314 gcc_unreachable ();
11319 tree_set_block (tree t
, tree b
)
11321 const enum tree_code_class c
= TREE_CODE_CLASS (TREE_CODE (t
));
11323 if (IS_EXPR_CODE_CLASS (c
))
11326 t
->exp
.locus
= COMBINE_LOCATION_DATA (line_table
, t
->exp
.locus
, b
);
11328 t
->exp
.locus
= LOCATION_LOCUS (t
->exp
.locus
);
11331 gcc_unreachable ();
11334 /* Create a nameless artificial label and put it in the current
11335 function context. The label has a location of LOC. Returns the
11336 newly created label. */
11339 create_artificial_label (location_t loc
)
11341 tree lab
= build_decl (loc
,
11342 LABEL_DECL
, NULL_TREE
, void_type_node
);
11344 DECL_ARTIFICIAL (lab
) = 1;
11345 DECL_IGNORED_P (lab
) = 1;
11346 DECL_CONTEXT (lab
) = current_function_decl
;
11350 /* Given a tree, try to return a useful variable name that we can use
11351 to prefix a temporary that is being assigned the value of the tree.
11352 I.E. given <temp> = &A, return A. */
11357 tree stripped_decl
;
11360 STRIP_NOPS (stripped_decl
);
11361 if (DECL_P (stripped_decl
) && DECL_NAME (stripped_decl
))
11362 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl
));
11363 else if (TREE_CODE (stripped_decl
) == SSA_NAME
)
11365 tree name
= SSA_NAME_IDENTIFIER (stripped_decl
);
11368 return IDENTIFIER_POINTER (name
);
11372 switch (TREE_CODE (stripped_decl
))
11375 return get_name (TREE_OPERAND (stripped_decl
, 0));
11382 /* Return true if TYPE has a variable argument list. */
11385 stdarg_p (const_tree fntype
)
11387 function_args_iterator args_iter
;
11388 tree n
= NULL_TREE
, t
;
11393 FOREACH_FUNCTION_ARGS (fntype
, t
, args_iter
)
11398 return n
!= NULL_TREE
&& n
!= void_type_node
;
11401 /* Return true if TYPE has a prototype. */
11404 prototype_p (tree fntype
)
11408 gcc_assert (fntype
!= NULL_TREE
);
11410 t
= TYPE_ARG_TYPES (fntype
);
11411 return (t
!= NULL_TREE
);
11414 /* If BLOCK is inlined from an __attribute__((__artificial__))
11415 routine, return pointer to location from where it has been
11418 block_nonartificial_location (tree block
)
11420 location_t
*ret
= NULL
;
11422 while (block
&& TREE_CODE (block
) == BLOCK
11423 && BLOCK_ABSTRACT_ORIGIN (block
))
11425 tree ao
= BLOCK_ABSTRACT_ORIGIN (block
);
11427 while (TREE_CODE (ao
) == BLOCK
11428 && BLOCK_ABSTRACT_ORIGIN (ao
)
11429 && BLOCK_ABSTRACT_ORIGIN (ao
) != ao
)
11430 ao
= BLOCK_ABSTRACT_ORIGIN (ao
);
11432 if (TREE_CODE (ao
) == FUNCTION_DECL
)
11434 /* If AO is an artificial inline, point RET to the
11435 call site locus at which it has been inlined and continue
11436 the loop, in case AO's caller is also an artificial
11438 if (DECL_DECLARED_INLINE_P (ao
)
11439 && lookup_attribute ("artificial", DECL_ATTRIBUTES (ao
)))
11440 ret
= &BLOCK_SOURCE_LOCATION (block
);
11444 else if (TREE_CODE (ao
) != BLOCK
)
11447 block
= BLOCK_SUPERCONTEXT (block
);
11453 /* If EXP is inlined from an __attribute__((__artificial__))
11454 function, return the location of the original call expression. */
11457 tree_nonartificial_location (tree exp
)
11459 location_t
*loc
= block_nonartificial_location (TREE_BLOCK (exp
));
11464 return EXPR_LOCATION (exp
);
11468 /* These are the hash table functions for the hash table of OPTIMIZATION_NODEq
11471 /* Return the hash code code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
11474 cl_option_hash_hash (const void *x
)
11476 const_tree
const t
= (const_tree
) x
;
11480 hashval_t hash
= 0;
11482 if (TREE_CODE (t
) == OPTIMIZATION_NODE
)
11484 p
= (const char *)TREE_OPTIMIZATION (t
);
11485 len
= sizeof (struct cl_optimization
);
11488 else if (TREE_CODE (t
) == TARGET_OPTION_NODE
)
11489 return cl_target_option_hash (TREE_TARGET_OPTION (t
));
11492 gcc_unreachable ();
11494 /* assume most opt flags are just 0/1, some are 2-3, and a few might be
11496 for (i
= 0; i
< len
; i
++)
11498 hash
= (hash
<< 4) ^ ((i
<< 2) | p
[i
]);
11503 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
11504 TARGET_OPTION tree node) is the same as that given by *Y, which is the
11508 cl_option_hash_eq (const void *x
, const void *y
)
11510 const_tree
const xt
= (const_tree
) x
;
11511 const_tree
const yt
= (const_tree
) y
;
11516 if (TREE_CODE (xt
) != TREE_CODE (yt
))
11519 if (TREE_CODE (xt
) == OPTIMIZATION_NODE
)
11521 xp
= (const char *)TREE_OPTIMIZATION (xt
);
11522 yp
= (const char *)TREE_OPTIMIZATION (yt
);
11523 len
= sizeof (struct cl_optimization
);
11526 else if (TREE_CODE (xt
) == TARGET_OPTION_NODE
)
11528 return cl_target_option_eq (TREE_TARGET_OPTION (xt
),
11529 TREE_TARGET_OPTION (yt
));
11533 gcc_unreachable ();
11535 return (memcmp (xp
, yp
, len
) == 0);
11538 /* Build an OPTIMIZATION_NODE based on the options in OPTS. */
11541 build_optimization_node (struct gcc_options
*opts
)
11546 /* Use the cache of optimization nodes. */
11548 cl_optimization_save (TREE_OPTIMIZATION (cl_optimization_node
),
11551 slot
= htab_find_slot (cl_option_hash_table
, cl_optimization_node
, INSERT
);
11555 /* Insert this one into the hash table. */
11556 t
= cl_optimization_node
;
11559 /* Make a new node for next time round. */
11560 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
11566 /* Build a TARGET_OPTION_NODE based on the options in OPTS. */
11569 build_target_option_node (struct gcc_options
*opts
)
11574 /* Use the cache of optimization nodes. */
11576 cl_target_option_save (TREE_TARGET_OPTION (cl_target_option_node
),
11579 slot
= htab_find_slot (cl_option_hash_table
, cl_target_option_node
, INSERT
);
11583 /* Insert this one into the hash table. */
11584 t
= cl_target_option_node
;
11587 /* Make a new node for next time round. */
11588 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
11594 /* Reset TREE_TARGET_GLOBALS cache for TARGET_OPTION_NODE.
11595 Called through htab_traverse. */
11598 prepare_target_option_node_for_pch (void **slot
, void *)
11600 tree node
= (tree
) *slot
;
11601 if (TREE_CODE (node
) == TARGET_OPTION_NODE
)
11602 TREE_TARGET_GLOBALS (node
) = NULL
;
11606 /* Clear TREE_TARGET_GLOBALS of all TARGET_OPTION_NODE trees,
11607 so that they aren't saved during PCH writing. */
11610 prepare_target_option_nodes_for_pch (void)
11612 htab_traverse (cl_option_hash_table
, prepare_target_option_node_for_pch
,
11616 /* Determine the "ultimate origin" of a block. The block may be an inlined
11617 instance of an inlined instance of a block which is local to an inline
11618 function, so we have to trace all of the way back through the origin chain
11619 to find out what sort of node actually served as the original seed for the
11623 block_ultimate_origin (const_tree block
)
11625 tree immediate_origin
= BLOCK_ABSTRACT_ORIGIN (block
);
11627 /* BLOCK_ABSTRACT_ORIGIN can point to itself; ignore that if
11628 we're trying to output the abstract instance of this function. */
11629 if (BLOCK_ABSTRACT (block
) && immediate_origin
== block
)
11632 if (immediate_origin
== NULL_TREE
)
11637 tree lookahead
= immediate_origin
;
11641 ret_val
= lookahead
;
11642 lookahead
= (TREE_CODE (ret_val
) == BLOCK
11643 ? BLOCK_ABSTRACT_ORIGIN (ret_val
) : NULL
);
11645 while (lookahead
!= NULL
&& lookahead
!= ret_val
);
11647 /* The block's abstract origin chain may not be the *ultimate* origin of
11648 the block. It could lead to a DECL that has an abstract origin set.
11649 If so, we want that DECL's abstract origin (which is what DECL_ORIGIN
11650 will give us if it has one). Note that DECL's abstract origins are
11651 supposed to be the most distant ancestor (or so decl_ultimate_origin
11652 claims), so we don't need to loop following the DECL origins. */
11653 if (DECL_P (ret_val
))
11654 return DECL_ORIGIN (ret_val
);
11660 /* Return true iff conversion from INNER_TYPE to OUTER_TYPE generates
11664 tree_nop_conversion_p (const_tree outer_type
, const_tree inner_type
)
11666 /* Use precision rather then machine mode when we can, which gives
11667 the correct answer even for submode (bit-field) types. */
11668 if ((INTEGRAL_TYPE_P (outer_type
)
11669 || POINTER_TYPE_P (outer_type
)
11670 || TREE_CODE (outer_type
) == OFFSET_TYPE
)
11671 && (INTEGRAL_TYPE_P (inner_type
)
11672 || POINTER_TYPE_P (inner_type
)
11673 || TREE_CODE (inner_type
) == OFFSET_TYPE
))
11674 return TYPE_PRECISION (outer_type
) == TYPE_PRECISION (inner_type
);
11676 /* Otherwise fall back on comparing machine modes (e.g. for
11677 aggregate types, floats). */
11678 return TYPE_MODE (outer_type
) == TYPE_MODE (inner_type
);
11681 /* Return true iff conversion in EXP generates no instruction. Mark
11682 it inline so that we fully inline into the stripping functions even
11683 though we have two uses of this function. */
11686 tree_nop_conversion (const_tree exp
)
11688 tree outer_type
, inner_type
;
11690 if (!CONVERT_EXPR_P (exp
)
11691 && TREE_CODE (exp
) != NON_LVALUE_EXPR
)
11693 if (TREE_OPERAND (exp
, 0) == error_mark_node
)
11696 outer_type
= TREE_TYPE (exp
);
11697 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
11702 return tree_nop_conversion_p (outer_type
, inner_type
);
11705 /* Return true iff conversion in EXP generates no instruction. Don't
11706 consider conversions changing the signedness. */
11709 tree_sign_nop_conversion (const_tree exp
)
11711 tree outer_type
, inner_type
;
11713 if (!tree_nop_conversion (exp
))
11716 outer_type
= TREE_TYPE (exp
);
11717 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
11719 return (TYPE_UNSIGNED (outer_type
) == TYPE_UNSIGNED (inner_type
)
11720 && POINTER_TYPE_P (outer_type
) == POINTER_TYPE_P (inner_type
));
11723 /* Strip conversions from EXP according to tree_nop_conversion and
11724 return the resulting expression. */
11727 tree_strip_nop_conversions (tree exp
)
11729 while (tree_nop_conversion (exp
))
11730 exp
= TREE_OPERAND (exp
, 0);
11734 /* Strip conversions from EXP according to tree_sign_nop_conversion
11735 and return the resulting expression. */
11738 tree_strip_sign_nop_conversions (tree exp
)
11740 while (tree_sign_nop_conversion (exp
))
11741 exp
= TREE_OPERAND (exp
, 0);
11745 /* Avoid any floating point extensions from EXP. */
11747 strip_float_extensions (tree exp
)
11749 tree sub
, expt
, subt
;
11751 /* For floating point constant look up the narrowest type that can hold
11752 it properly and handle it like (type)(narrowest_type)constant.
11753 This way we can optimize for instance a=a*2.0 where "a" is float
11754 but 2.0 is double constant. */
11755 if (TREE_CODE (exp
) == REAL_CST
&& !DECIMAL_FLOAT_TYPE_P (TREE_TYPE (exp
)))
11757 REAL_VALUE_TYPE orig
;
11760 orig
= TREE_REAL_CST (exp
);
11761 if (TYPE_PRECISION (TREE_TYPE (exp
)) > TYPE_PRECISION (float_type_node
)
11762 && exact_real_truncate (TYPE_MODE (float_type_node
), &orig
))
11763 type
= float_type_node
;
11764 else if (TYPE_PRECISION (TREE_TYPE (exp
))
11765 > TYPE_PRECISION (double_type_node
)
11766 && exact_real_truncate (TYPE_MODE (double_type_node
), &orig
))
11767 type
= double_type_node
;
11769 return build_real (type
, real_value_truncate (TYPE_MODE (type
), orig
));
11772 if (!CONVERT_EXPR_P (exp
))
11775 sub
= TREE_OPERAND (exp
, 0);
11776 subt
= TREE_TYPE (sub
);
11777 expt
= TREE_TYPE (exp
);
11779 if (!FLOAT_TYPE_P (subt
))
11782 if (DECIMAL_FLOAT_TYPE_P (expt
) != DECIMAL_FLOAT_TYPE_P (subt
))
11785 if (TYPE_PRECISION (subt
) > TYPE_PRECISION (expt
))
11788 return strip_float_extensions (sub
);
11791 /* Strip out all handled components that produce invariant
11795 strip_invariant_refs (const_tree op
)
11797 while (handled_component_p (op
))
11799 switch (TREE_CODE (op
))
11802 case ARRAY_RANGE_REF
:
11803 if (!is_gimple_constant (TREE_OPERAND (op
, 1))
11804 || TREE_OPERAND (op
, 2) != NULL_TREE
11805 || TREE_OPERAND (op
, 3) != NULL_TREE
)
11809 case COMPONENT_REF
:
11810 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
11816 op
= TREE_OPERAND (op
, 0);
11822 static GTY(()) tree gcc_eh_personality_decl
;
11824 /* Return the GCC personality function decl. */
11827 lhd_gcc_personality (void)
11829 if (!gcc_eh_personality_decl
)
11830 gcc_eh_personality_decl
= build_personality_function ("gcc");
11831 return gcc_eh_personality_decl
;
11834 /* TARGET is a call target of GIMPLE call statement
11835 (obtained by gimple_call_fn). Return true if it is
11836 OBJ_TYPE_REF representing an virtual call of C++ method.
11837 (As opposed to OBJ_TYPE_REF representing objc calls
11838 through a cast where middle-end devirtualization machinery
11842 virtual_method_call_p (tree target
)
11844 if (TREE_CODE (target
) != OBJ_TYPE_REF
)
11846 target
= TREE_TYPE (target
);
11847 gcc_checking_assert (TREE_CODE (target
) == POINTER_TYPE
);
11848 target
= TREE_TYPE (target
);
11849 if (TREE_CODE (target
) == FUNCTION_TYPE
)
11851 gcc_checking_assert (TREE_CODE (target
) == METHOD_TYPE
);
11855 /* REF is OBJ_TYPE_REF, return the class the ref corresponds to. */
11858 obj_type_ref_class (tree ref
)
11860 gcc_checking_assert (TREE_CODE (ref
) == OBJ_TYPE_REF
);
11861 ref
= TREE_TYPE (ref
);
11862 gcc_checking_assert (TREE_CODE (ref
) == POINTER_TYPE
);
11863 ref
= TREE_TYPE (ref
);
11864 /* We look for type THIS points to. ObjC also builds
11865 OBJ_TYPE_REF with non-method calls, Their first parameter
11866 ID however also corresponds to class type. */
11867 gcc_checking_assert (TREE_CODE (ref
) == METHOD_TYPE
11868 || TREE_CODE (ref
) == FUNCTION_TYPE
);
11869 ref
= TREE_VALUE (TYPE_ARG_TYPES (ref
));
11870 gcc_checking_assert (TREE_CODE (ref
) == POINTER_TYPE
);
11871 return TREE_TYPE (ref
);
11874 /* Return true if T is in anonymous namespace. */
11877 type_in_anonymous_namespace_p (const_tree t
)
11879 /* TREE_PUBLIC of TYPE_STUB_DECL may not be properly set for
11880 bulitin types; those have CONTEXT NULL. */
11881 if (!TYPE_CONTEXT (t
))
11883 return (TYPE_STUB_DECL (t
) && !TREE_PUBLIC (TYPE_STUB_DECL (t
)));
11886 /* Try to find a base info of BINFO that would have its field decl at offset
11887 OFFSET within the BINFO type and which is of EXPECTED_TYPE. If it can be
11888 found, return, otherwise return NULL_TREE. */
11891 get_binfo_at_offset (tree binfo
, HOST_WIDE_INT offset
, tree expected_type
)
11893 tree type
= BINFO_TYPE (binfo
);
11897 HOST_WIDE_INT pos
, size
;
11901 if (types_same_for_odr (type
, expected_type
))
11906 for (fld
= TYPE_FIELDS (type
); fld
; fld
= DECL_CHAIN (fld
))
11908 if (TREE_CODE (fld
) != FIELD_DECL
)
11911 pos
= int_bit_position (fld
);
11912 size
= tree_to_uhwi (DECL_SIZE (fld
));
11913 if (pos
<= offset
&& (pos
+ size
) > offset
)
11916 if (!fld
|| TREE_CODE (TREE_TYPE (fld
)) != RECORD_TYPE
)
11919 if (!DECL_ARTIFICIAL (fld
))
11921 binfo
= TYPE_BINFO (TREE_TYPE (fld
));
11925 /* Offset 0 indicates the primary base, whose vtable contents are
11926 represented in the binfo for the derived class. */
11927 else if (offset
!= 0)
11929 tree base_binfo
, binfo2
= binfo
;
11931 /* Find BINFO corresponding to FLD. This is bit harder
11932 by a fact that in virtual inheritance we may need to walk down
11933 the non-virtual inheritance chain. */
11936 tree containing_binfo
= NULL
, found_binfo
= NULL
;
11937 for (i
= 0; BINFO_BASE_ITERATE (binfo2
, i
, base_binfo
); i
++)
11938 if (types_same_for_odr (TREE_TYPE (base_binfo
), TREE_TYPE (fld
)))
11940 found_binfo
= base_binfo
;
11944 if ((tree_to_shwi (BINFO_OFFSET (base_binfo
))
11945 - tree_to_shwi (BINFO_OFFSET (binfo
)))
11946 * BITS_PER_UNIT
< pos
11947 /* Rule out types with no virtual methods or we can get confused
11948 here by zero sized bases. */
11949 && BINFO_VTABLE (TYPE_BINFO (BINFO_TYPE (base_binfo
)))
11950 && (!containing_binfo
11951 || (tree_to_shwi (BINFO_OFFSET (containing_binfo
))
11952 < tree_to_shwi (BINFO_OFFSET (base_binfo
)))))
11953 containing_binfo
= base_binfo
;
11956 binfo
= found_binfo
;
11959 if (!containing_binfo
)
11961 binfo2
= containing_binfo
;
11965 type
= TREE_TYPE (fld
);
11970 /* Returns true if X is a typedef decl. */
11973 is_typedef_decl (tree x
)
11975 return (x
&& TREE_CODE (x
) == TYPE_DECL
11976 && DECL_ORIGINAL_TYPE (x
) != NULL_TREE
);
11979 /* Returns true iff TYPE is a type variant created for a typedef. */
11982 typedef_variant_p (tree type
)
11984 return is_typedef_decl (TYPE_NAME (type
));
11987 /* Warn about a use of an identifier which was marked deprecated. */
11989 warn_deprecated_use (tree node
, tree attr
)
11993 if (node
== 0 || !warn_deprecated_decl
)
11999 attr
= DECL_ATTRIBUTES (node
);
12000 else if (TYPE_P (node
))
12002 tree decl
= TYPE_STUB_DECL (node
);
12004 attr
= lookup_attribute ("deprecated",
12005 TYPE_ATTRIBUTES (TREE_TYPE (decl
)));
12010 attr
= lookup_attribute ("deprecated", attr
);
12013 msg
= TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr
)));
12019 expanded_location xloc
= expand_location (DECL_SOURCE_LOCATION (node
));
12021 warning (OPT_Wdeprecated_declarations
,
12022 "%qD is deprecated (declared at %r%s:%d%R): %s",
12023 node
, "locus", xloc
.file
, xloc
.line
, msg
);
12025 warning (OPT_Wdeprecated_declarations
,
12026 "%qD is deprecated (declared at %r%s:%d%R)",
12027 node
, "locus", xloc
.file
, xloc
.line
);
12029 else if (TYPE_P (node
))
12031 tree what
= NULL_TREE
;
12032 tree decl
= TYPE_STUB_DECL (node
);
12034 if (TYPE_NAME (node
))
12036 if (TREE_CODE (TYPE_NAME (node
)) == IDENTIFIER_NODE
)
12037 what
= TYPE_NAME (node
);
12038 else if (TREE_CODE (TYPE_NAME (node
)) == TYPE_DECL
12039 && DECL_NAME (TYPE_NAME (node
)))
12040 what
= DECL_NAME (TYPE_NAME (node
));
12045 expanded_location xloc
12046 = expand_location (DECL_SOURCE_LOCATION (decl
));
12050 warning (OPT_Wdeprecated_declarations
,
12051 "%qE is deprecated (declared at %r%s:%d%R): %s",
12052 what
, "locus", xloc
.file
, xloc
.line
, msg
);
12054 warning (OPT_Wdeprecated_declarations
,
12055 "%qE is deprecated (declared at %r%s:%d%R)",
12056 what
, "locus", xloc
.file
, xloc
.line
);
12061 warning (OPT_Wdeprecated_declarations
,
12062 "type is deprecated (declared at %r%s:%d%R): %s",
12063 "locus", xloc
.file
, xloc
.line
, msg
);
12065 warning (OPT_Wdeprecated_declarations
,
12066 "type is deprecated (declared at %r%s:%d%R)",
12067 "locus", xloc
.file
, xloc
.line
);
12075 warning (OPT_Wdeprecated_declarations
, "%qE is deprecated: %s",
12078 warning (OPT_Wdeprecated_declarations
, "%qE is deprecated", what
);
12083 warning (OPT_Wdeprecated_declarations
, "type is deprecated: %s",
12086 warning (OPT_Wdeprecated_declarations
, "type is deprecated");
12092 /* Return true if REF has a COMPONENT_REF with a bit-field field declaration
12093 somewhere in it. */
12096 contains_bitfld_component_ref_p (const_tree ref
)
12098 while (handled_component_p (ref
))
12100 if (TREE_CODE (ref
) == COMPONENT_REF
12101 && DECL_BIT_FIELD (TREE_OPERAND (ref
, 1)))
12103 ref
= TREE_OPERAND (ref
, 0);
12109 /* Try to determine whether a TRY_CATCH expression can fall through.
12110 This is a subroutine of block_may_fallthru. */
12113 try_catch_may_fallthru (const_tree stmt
)
12115 tree_stmt_iterator i
;
12117 /* If the TRY block can fall through, the whole TRY_CATCH can
12119 if (block_may_fallthru (TREE_OPERAND (stmt
, 0)))
12122 i
= tsi_start (TREE_OPERAND (stmt
, 1));
12123 switch (TREE_CODE (tsi_stmt (i
)))
12126 /* We expect to see a sequence of CATCH_EXPR trees, each with a
12127 catch expression and a body. The whole TRY_CATCH may fall
12128 through iff any of the catch bodies falls through. */
12129 for (; !tsi_end_p (i
); tsi_next (&i
))
12131 if (block_may_fallthru (CATCH_BODY (tsi_stmt (i
))))
12136 case EH_FILTER_EXPR
:
12137 /* The exception filter expression only matters if there is an
12138 exception. If the exception does not match EH_FILTER_TYPES,
12139 we will execute EH_FILTER_FAILURE, and we will fall through
12140 if that falls through. If the exception does match
12141 EH_FILTER_TYPES, the stack unwinder will continue up the
12142 stack, so we will not fall through. We don't know whether we
12143 will throw an exception which matches EH_FILTER_TYPES or not,
12144 so we just ignore EH_FILTER_TYPES and assume that we might
12145 throw an exception which doesn't match. */
12146 return block_may_fallthru (EH_FILTER_FAILURE (tsi_stmt (i
)));
12149 /* This case represents statements to be executed when an
12150 exception occurs. Those statements are implicitly followed
12151 by a RESX statement to resume execution after the exception.
12152 So in this case the TRY_CATCH never falls through. */
12157 /* Try to determine if we can fall out of the bottom of BLOCK. This guess
12158 need not be 100% accurate; simply be conservative and return true if we
12159 don't know. This is used only to avoid stupidly generating extra code.
12160 If we're wrong, we'll just delete the extra code later. */
12163 block_may_fallthru (const_tree block
)
12165 /* This CONST_CAST is okay because expr_last returns its argument
12166 unmodified and we assign it to a const_tree. */
12167 const_tree stmt
= expr_last (CONST_CAST_TREE (block
));
12169 switch (stmt
? TREE_CODE (stmt
) : ERROR_MARK
)
12173 /* Easy cases. If the last statement of the block implies
12174 control transfer, then we can't fall through. */
12178 /* If SWITCH_LABELS is set, this is lowered, and represents a
12179 branch to a selected label and hence can not fall through.
12180 Otherwise SWITCH_BODY is set, and the switch can fall
12182 return SWITCH_LABELS (stmt
) == NULL_TREE
;
12185 if (block_may_fallthru (COND_EXPR_THEN (stmt
)))
12187 return block_may_fallthru (COND_EXPR_ELSE (stmt
));
12190 return block_may_fallthru (BIND_EXPR_BODY (stmt
));
12192 case TRY_CATCH_EXPR
:
12193 return try_catch_may_fallthru (stmt
);
12195 case TRY_FINALLY_EXPR
:
12196 /* The finally clause is always executed after the try clause,
12197 so if it does not fall through, then the try-finally will not
12198 fall through. Otherwise, if the try clause does not fall
12199 through, then when the finally clause falls through it will
12200 resume execution wherever the try clause was going. So the
12201 whole try-finally will only fall through if both the try
12202 clause and the finally clause fall through. */
12203 return (block_may_fallthru (TREE_OPERAND (stmt
, 0))
12204 && block_may_fallthru (TREE_OPERAND (stmt
, 1)));
12207 if (TREE_CODE (TREE_OPERAND (stmt
, 1)) == CALL_EXPR
)
12208 stmt
= TREE_OPERAND (stmt
, 1);
12214 /* Functions that do not return do not fall through. */
12215 return (call_expr_flags (stmt
) & ECF_NORETURN
) == 0;
12217 case CLEANUP_POINT_EXPR
:
12218 return block_may_fallthru (TREE_OPERAND (stmt
, 0));
12221 return block_may_fallthru (TREE_OPERAND (stmt
, 1));
12227 return lang_hooks
.block_may_fallthru (stmt
);
12231 /* True if we are using EH to handle cleanups. */
12232 static bool using_eh_for_cleanups_flag
= false;
12234 /* This routine is called from front ends to indicate eh should be used for
12237 using_eh_for_cleanups (void)
12239 using_eh_for_cleanups_flag
= true;
12242 /* Query whether EH is used for cleanups. */
12244 using_eh_for_cleanups_p (void)
12246 return using_eh_for_cleanups_flag
;
12249 /* Wrapper for tree_code_name to ensure that tree code is valid */
12251 get_tree_code_name (enum tree_code code
)
12253 const char *invalid
= "<invalid tree code>";
12255 if (code
>= MAX_TREE_CODES
)
12258 return tree_code_name
[code
];
12261 /* Drops the TREE_OVERFLOW flag from T. */
12264 drop_tree_overflow (tree t
)
12266 gcc_checking_assert (TREE_OVERFLOW (t
));
12268 /* For tree codes with a sharing machinery re-build the result. */
12269 if (TREE_CODE (t
) == INTEGER_CST
)
12270 return wide_int_to_tree (TREE_TYPE (t
), t
);
12272 /* Otherwise, as all tcc_constants are possibly shared, copy the node
12273 and drop the flag. */
12275 TREE_OVERFLOW (t
) = 0;
12279 /* Given a memory reference expression T, return its base address.
12280 The base address of a memory reference expression is the main
12281 object being referenced. For instance, the base address for
12282 'array[i].fld[j]' is 'array'. You can think of this as stripping
12283 away the offset part from a memory address.
12285 This function calls handled_component_p to strip away all the inner
12286 parts of the memory reference until it reaches the base object. */
12289 get_base_address (tree t
)
12291 while (handled_component_p (t
))
12292 t
= TREE_OPERAND (t
, 0);
12294 if ((TREE_CODE (t
) == MEM_REF
12295 || TREE_CODE (t
) == TARGET_MEM_REF
)
12296 && TREE_CODE (TREE_OPERAND (t
, 0)) == ADDR_EXPR
)
12297 t
= TREE_OPERAND (TREE_OPERAND (t
, 0), 0);
12299 /* ??? Either the alias oracle or all callers need to properly deal
12300 with WITH_SIZE_EXPRs before we can look through those. */
12301 if (TREE_CODE (t
) == WITH_SIZE_EXPR
)
12307 #include "gt-tree.h"