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"
43 #include "toplev.h" /* get_random_seed */
46 #include "filenames.h"
49 #include "common/common-target.h"
50 #include "langhooks.h"
51 #include "tree-inline.h"
52 #include "tree-iterator.h"
53 #include "basic-block.h"
55 #include "tree-ssa-alias.h"
56 #include "internal-fn.h"
57 #include "gimple-expr.h"
60 #include "gimple-iterator.h"
62 #include "gimple-ssa.h"
64 #include "tree-phinodes.h"
65 #include "stringpool.h"
66 #include "tree-ssanames.h"
70 #include "tree-pass.h"
71 #include "langhooks-def.h"
72 #include "diagnostic.h"
73 #include "tree-diagnostic.h"
74 #include "tree-pretty-print.h"
81 /* Tree code classes. */
83 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) TYPE,
84 #define END_OF_BASE_TREE_CODES tcc_exceptional,
86 const enum tree_code_class tree_code_type
[] = {
87 #include "all-tree.def"
91 #undef END_OF_BASE_TREE_CODES
93 /* Table indexed by tree code giving number of expression
94 operands beyond the fixed part of the node structure.
95 Not used for types or decls. */
97 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) LENGTH,
98 #define END_OF_BASE_TREE_CODES 0,
100 const unsigned char tree_code_length
[] = {
101 #include "all-tree.def"
105 #undef END_OF_BASE_TREE_CODES
107 /* Names of tree components.
108 Used for printing out the tree and error messages. */
109 #define DEFTREECODE(SYM, NAME, TYPE, LEN) NAME,
110 #define END_OF_BASE_TREE_CODES "@dummy",
112 static const char *const tree_code_name
[] = {
113 #include "all-tree.def"
117 #undef END_OF_BASE_TREE_CODES
119 /* Each tree code class has an associated string representation.
120 These must correspond to the tree_code_class entries. */
122 const char *const tree_code_class_strings
[] =
137 /* obstack.[ch] explicitly declined to prototype this. */
138 extern int _obstack_allocated_p (struct obstack
*h
, void *obj
);
140 /* Statistics-gathering stuff. */
142 static int tree_code_counts
[MAX_TREE_CODES
];
143 int tree_node_counts
[(int) all_kinds
];
144 int tree_node_sizes
[(int) all_kinds
];
146 /* Keep in sync with tree.h:enum tree_node_kind. */
147 static const char * const tree_node_kind_names
[] = {
166 /* Unique id for next decl created. */
167 static GTY(()) int next_decl_uid
;
168 /* Unique id for next type created. */
169 static GTY(()) int next_type_uid
= 1;
170 /* Unique id for next debug decl created. Use negative numbers,
171 to catch erroneous uses. */
172 static GTY(()) int next_debug_decl_uid
;
174 /* Since we cannot rehash a type after it is in the table, we have to
175 keep the hash code. */
177 struct GTY(()) type_hash
{
182 /* Initial size of the hash table (rounded to next prime). */
183 #define TYPE_HASH_INITIAL_SIZE 1000
185 /* Now here is the hash table. When recording a type, it is added to
186 the slot whose index is the hash code. Note that the hash table is
187 used for several kinds of types (function types, array types and
188 array index range types, for now). While all these live in the
189 same table, they are completely independent, and the hash code is
190 computed differently for each of these. */
192 static GTY ((if_marked ("type_hash_marked_p"), param_is (struct type_hash
)))
193 htab_t type_hash_table
;
195 /* Hash table and temporary node for larger integer const values. */
196 static GTY (()) tree int_cst_node
;
197 static GTY ((if_marked ("ggc_marked_p"), param_is (union tree_node
)))
198 htab_t int_cst_hash_table
;
200 /* Hash table for optimization flags and target option flags. Use the same
201 hash table for both sets of options. Nodes for building the current
202 optimization and target option nodes. The assumption is most of the time
203 the options created will already be in the hash table, so we avoid
204 allocating and freeing up a node repeatably. */
205 static GTY (()) tree cl_optimization_node
;
206 static GTY (()) tree cl_target_option_node
;
207 static GTY ((if_marked ("ggc_marked_p"), param_is (union tree_node
)))
208 htab_t cl_option_hash_table
;
210 /* General tree->tree mapping structure for use in hash tables. */
213 static GTY ((if_marked ("tree_decl_map_marked_p"), param_is (struct tree_decl_map
)))
214 htab_t debug_expr_for_decl
;
216 static GTY ((if_marked ("tree_decl_map_marked_p"), param_is (struct tree_decl_map
)))
217 htab_t value_expr_for_decl
;
219 static GTY ((if_marked ("tree_vec_map_marked_p"), param_is (struct tree_vec_map
)))
220 htab_t debug_args_for_decl
;
222 static void set_type_quals (tree
, int);
223 static int type_hash_eq (const void *, const void *);
224 static hashval_t
type_hash_hash (const void *);
225 static hashval_t
int_cst_hash_hash (const void *);
226 static int int_cst_hash_eq (const void *, const void *);
227 static hashval_t
cl_option_hash_hash (const void *);
228 static int cl_option_hash_eq (const void *, const void *);
229 static void print_type_hash_statistics (void);
230 static void print_debug_expr_statistics (void);
231 static void print_value_expr_statistics (void);
232 static int type_hash_marked_p (const void *);
233 static void type_hash_list (const_tree
, inchash::hash
&);
234 static void attribute_hash_list (const_tree
, inchash::hash
&);
236 tree global_trees
[TI_MAX
];
237 tree integer_types
[itk_none
];
239 unsigned char tree_contains_struct
[MAX_TREE_CODES
][64];
241 /* Number of operands for each OpenMP clause. */
242 unsigned const char omp_clause_num_ops
[] =
244 0, /* OMP_CLAUSE_ERROR */
245 1, /* OMP_CLAUSE_PRIVATE */
246 1, /* OMP_CLAUSE_SHARED */
247 1, /* OMP_CLAUSE_FIRSTPRIVATE */
248 2, /* OMP_CLAUSE_LASTPRIVATE */
249 4, /* OMP_CLAUSE_REDUCTION */
250 1, /* OMP_CLAUSE_COPYIN */
251 1, /* OMP_CLAUSE_COPYPRIVATE */
252 3, /* OMP_CLAUSE_LINEAR */
253 2, /* OMP_CLAUSE_ALIGNED */
254 1, /* OMP_CLAUSE_DEPEND */
255 1, /* OMP_CLAUSE_UNIFORM */
256 2, /* OMP_CLAUSE_FROM */
257 2, /* OMP_CLAUSE_TO */
258 2, /* OMP_CLAUSE_MAP */
259 1, /* OMP_CLAUSE__LOOPTEMP_ */
260 1, /* OMP_CLAUSE_IF */
261 1, /* OMP_CLAUSE_NUM_THREADS */
262 1, /* OMP_CLAUSE_SCHEDULE */
263 0, /* OMP_CLAUSE_NOWAIT */
264 0, /* OMP_CLAUSE_ORDERED */
265 0, /* OMP_CLAUSE_DEFAULT */
266 3, /* OMP_CLAUSE_COLLAPSE */
267 0, /* OMP_CLAUSE_UNTIED */
268 1, /* OMP_CLAUSE_FINAL */
269 0, /* OMP_CLAUSE_MERGEABLE */
270 1, /* OMP_CLAUSE_DEVICE */
271 1, /* OMP_CLAUSE_DIST_SCHEDULE */
272 0, /* OMP_CLAUSE_INBRANCH */
273 0, /* OMP_CLAUSE_NOTINBRANCH */
274 1, /* OMP_CLAUSE_NUM_TEAMS */
275 1, /* OMP_CLAUSE_THREAD_LIMIT */
276 0, /* OMP_CLAUSE_PROC_BIND */
277 1, /* OMP_CLAUSE_SAFELEN */
278 1, /* OMP_CLAUSE_SIMDLEN */
279 0, /* OMP_CLAUSE_FOR */
280 0, /* OMP_CLAUSE_PARALLEL */
281 0, /* OMP_CLAUSE_SECTIONS */
282 0, /* OMP_CLAUSE_TASKGROUP */
283 1, /* OMP_CLAUSE__SIMDUID_ */
284 1, /* OMP_CLAUSE__CILK_FOR_COUNT_ */
287 const char * const omp_clause_code_name
[] =
333 /* Return the tree node structure used by tree code CODE. */
335 static inline enum tree_node_structure_enum
336 tree_node_structure_for_code (enum tree_code code
)
338 switch (TREE_CODE_CLASS (code
))
340 case tcc_declaration
:
345 return TS_FIELD_DECL
;
351 return TS_LABEL_DECL
;
353 return TS_RESULT_DECL
;
354 case DEBUG_EXPR_DECL
:
357 return TS_CONST_DECL
;
361 return TS_FUNCTION_DECL
;
362 case TRANSLATION_UNIT_DECL
:
363 return TS_TRANSLATION_UNIT_DECL
;
365 return TS_DECL_NON_COMMON
;
369 return TS_TYPE_NON_COMMON
;
378 default: /* tcc_constant and tcc_exceptional */
383 /* tcc_constant cases. */
384 case VOID_CST
: return TS_TYPED
;
385 case INTEGER_CST
: return TS_INT_CST
;
386 case REAL_CST
: return TS_REAL_CST
;
387 case FIXED_CST
: return TS_FIXED_CST
;
388 case COMPLEX_CST
: return TS_COMPLEX
;
389 case VECTOR_CST
: return TS_VECTOR
;
390 case STRING_CST
: return TS_STRING
;
391 /* tcc_exceptional cases. */
392 case ERROR_MARK
: return TS_COMMON
;
393 case IDENTIFIER_NODE
: return TS_IDENTIFIER
;
394 case TREE_LIST
: return TS_LIST
;
395 case TREE_VEC
: return TS_VEC
;
396 case SSA_NAME
: return TS_SSA_NAME
;
397 case PLACEHOLDER_EXPR
: return TS_COMMON
;
398 case STATEMENT_LIST
: return TS_STATEMENT_LIST
;
399 case BLOCK
: return TS_BLOCK
;
400 case CONSTRUCTOR
: return TS_CONSTRUCTOR
;
401 case TREE_BINFO
: return TS_BINFO
;
402 case OMP_CLAUSE
: return TS_OMP_CLAUSE
;
403 case OPTIMIZATION_NODE
: return TS_OPTIMIZATION
;
404 case TARGET_OPTION_NODE
: return TS_TARGET_OPTION
;
412 /* Initialize tree_contains_struct to describe the hierarchy of tree
416 initialize_tree_contains_struct (void)
420 for (i
= ERROR_MARK
; i
< LAST_AND_UNUSED_TREE_CODE
; i
++)
423 enum tree_node_structure_enum ts_code
;
425 code
= (enum tree_code
) i
;
426 ts_code
= tree_node_structure_for_code (code
);
428 /* Mark the TS structure itself. */
429 tree_contains_struct
[code
][ts_code
] = 1;
431 /* Mark all the structures that TS is derived from. */
449 case TS_STATEMENT_LIST
:
450 MARK_TS_TYPED (code
);
454 case TS_DECL_MINIMAL
:
460 case TS_OPTIMIZATION
:
461 case TS_TARGET_OPTION
:
462 MARK_TS_COMMON (code
);
465 case TS_TYPE_WITH_LANG_SPECIFIC
:
466 MARK_TS_TYPE_COMMON (code
);
469 case TS_TYPE_NON_COMMON
:
470 MARK_TS_TYPE_WITH_LANG_SPECIFIC (code
);
474 MARK_TS_DECL_MINIMAL (code
);
479 MARK_TS_DECL_COMMON (code
);
482 case TS_DECL_NON_COMMON
:
483 MARK_TS_DECL_WITH_VIS (code
);
486 case TS_DECL_WITH_VIS
:
490 MARK_TS_DECL_WRTL (code
);
494 MARK_TS_DECL_COMMON (code
);
498 MARK_TS_DECL_WITH_VIS (code
);
502 case TS_FUNCTION_DECL
:
503 MARK_TS_DECL_NON_COMMON (code
);
506 case TS_TRANSLATION_UNIT_DECL
:
507 MARK_TS_DECL_COMMON (code
);
515 /* Basic consistency checks for attributes used in fold. */
516 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_NON_COMMON
]);
517 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_NON_COMMON
]);
518 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_DECL_COMMON
]);
519 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_COMMON
]);
520 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_COMMON
]);
521 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_COMMON
]);
522 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_COMMON
]);
523 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_COMMON
]);
524 gcc_assert (tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_COMMON
]);
525 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_COMMON
]);
526 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_DECL_COMMON
]);
527 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_WRTL
]);
528 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_WRTL
]);
529 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_WRTL
]);
530 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WRTL
]);
531 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_WRTL
]);
532 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_DECL_MINIMAL
]);
533 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_MINIMAL
]);
534 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_MINIMAL
]);
535 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_MINIMAL
]);
536 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_MINIMAL
]);
537 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_MINIMAL
]);
538 gcc_assert (tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_MINIMAL
]);
539 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_MINIMAL
]);
540 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_DECL_MINIMAL
]);
541 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_WITH_VIS
]);
542 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WITH_VIS
]);
543 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_WITH_VIS
]);
544 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_VAR_DECL
]);
545 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_FIELD_DECL
]);
546 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_PARM_DECL
]);
547 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_LABEL_DECL
]);
548 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_RESULT_DECL
]);
549 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_CONST_DECL
]);
550 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_TYPE_DECL
]);
551 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_FUNCTION_DECL
]);
552 gcc_assert (tree_contains_struct
[IMPORTED_DECL
][TS_DECL_MINIMAL
]);
553 gcc_assert (tree_contains_struct
[IMPORTED_DECL
][TS_DECL_COMMON
]);
554 gcc_assert (tree_contains_struct
[NAMELIST_DECL
][TS_DECL_MINIMAL
]);
555 gcc_assert (tree_contains_struct
[NAMELIST_DECL
][TS_DECL_COMMON
]);
564 /* Initialize the hash table of types. */
565 type_hash_table
= htab_create_ggc (TYPE_HASH_INITIAL_SIZE
, type_hash_hash
,
568 debug_expr_for_decl
= htab_create_ggc (512, tree_decl_map_hash
,
569 tree_decl_map_eq
, 0);
571 value_expr_for_decl
= htab_create_ggc (512, tree_decl_map_hash
,
572 tree_decl_map_eq
, 0);
574 int_cst_hash_table
= htab_create_ggc (1024, int_cst_hash_hash
,
575 int_cst_hash_eq
, NULL
);
577 int_cst_node
= make_int_cst (1, 1);
579 cl_option_hash_table
= htab_create_ggc (64, cl_option_hash_hash
,
580 cl_option_hash_eq
, NULL
);
582 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
583 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
585 /* Initialize the tree_contains_struct array. */
586 initialize_tree_contains_struct ();
587 lang_hooks
.init_ts ();
591 /* The name of the object as the assembler will see it (but before any
592 translations made by ASM_OUTPUT_LABELREF). Often this is the same
593 as DECL_NAME. It is an IDENTIFIER_NODE. */
595 decl_assembler_name (tree decl
)
597 if (!DECL_ASSEMBLER_NAME_SET_P (decl
))
598 lang_hooks
.set_decl_assembler_name (decl
);
599 return DECL_WITH_VIS_CHECK (decl
)->decl_with_vis
.assembler_name
;
602 /* When the target supports COMDAT groups, this indicates which group the
603 DECL is associated with. This can be either an IDENTIFIER_NODE or a
604 decl, in which case its DECL_ASSEMBLER_NAME identifies the group. */
606 decl_comdat_group (const_tree node
)
608 struct symtab_node
*snode
= symtab_node::get (node
);
611 return snode
->get_comdat_group ();
614 /* Likewise, but make sure it's been reduced to an IDENTIFIER_NODE. */
616 decl_comdat_group_id (const_tree node
)
618 struct symtab_node
*snode
= symtab_node::get (node
);
621 return snode
->get_comdat_group_id ();
624 /* When the target supports named section, return its name as IDENTIFIER_NODE
625 or NULL if it is in no section. */
627 decl_section_name (const_tree node
)
629 struct symtab_node
*snode
= symtab_node::get (node
);
632 return snode
->get_section ();
635 /* Set section section name of NODE to VALUE (that is expected to
636 be identifier node) */
638 set_decl_section_name (tree node
, const char *value
)
640 struct symtab_node
*snode
;
644 snode
= symtab_node::get (node
);
648 else if (TREE_CODE (node
) == VAR_DECL
)
649 snode
= varpool_node::get_create (node
);
651 snode
= cgraph_node::get_create (node
);
652 snode
->set_section (value
);
655 /* Return TLS model of a variable NODE. */
657 decl_tls_model (const_tree node
)
659 struct varpool_node
*snode
= varpool_node::get (node
);
661 return TLS_MODEL_NONE
;
662 return snode
->tls_model
;
665 /* Set TLS model of variable NODE to MODEL. */
667 set_decl_tls_model (tree node
, enum tls_model model
)
669 struct varpool_node
*vnode
;
671 if (model
== TLS_MODEL_NONE
)
673 vnode
= varpool_node::get (node
);
678 vnode
= varpool_node::get_create (node
);
679 vnode
->tls_model
= model
;
682 /* Compute the number of bytes occupied by a tree with code CODE.
683 This function cannot be used for nodes that have variable sizes,
684 including TREE_VEC, INTEGER_CST, STRING_CST, and CALL_EXPR. */
686 tree_code_size (enum tree_code code
)
688 switch (TREE_CODE_CLASS (code
))
690 case tcc_declaration
: /* A decl node */
695 return sizeof (struct tree_field_decl
);
697 return sizeof (struct tree_parm_decl
);
699 return sizeof (struct tree_var_decl
);
701 return sizeof (struct tree_label_decl
);
703 return sizeof (struct tree_result_decl
);
705 return sizeof (struct tree_const_decl
);
707 return sizeof (struct tree_type_decl
);
709 return sizeof (struct tree_function_decl
);
710 case DEBUG_EXPR_DECL
:
711 return sizeof (struct tree_decl_with_rtl
);
712 case TRANSLATION_UNIT_DECL
:
713 return sizeof (struct tree_translation_unit_decl
);
717 return sizeof (struct tree_decl_non_common
);
719 return lang_hooks
.tree_size (code
);
723 case tcc_type
: /* a type node */
724 return sizeof (struct tree_type_non_common
);
726 case tcc_reference
: /* a reference */
727 case tcc_expression
: /* an expression */
728 case tcc_statement
: /* an expression with side effects */
729 case tcc_comparison
: /* a comparison expression */
730 case tcc_unary
: /* a unary arithmetic expression */
731 case tcc_binary
: /* a binary arithmetic expression */
732 return (sizeof (struct tree_exp
)
733 + (TREE_CODE_LENGTH (code
) - 1) * sizeof (tree
));
735 case tcc_constant
: /* a constant */
738 case VOID_CST
: return sizeof (struct tree_typed
);
739 case INTEGER_CST
: gcc_unreachable ();
740 case REAL_CST
: return sizeof (struct tree_real_cst
);
741 case FIXED_CST
: return sizeof (struct tree_fixed_cst
);
742 case COMPLEX_CST
: return sizeof (struct tree_complex
);
743 case VECTOR_CST
: return sizeof (struct tree_vector
);
744 case STRING_CST
: gcc_unreachable ();
746 return lang_hooks
.tree_size (code
);
749 case tcc_exceptional
: /* something random, like an identifier. */
752 case IDENTIFIER_NODE
: return lang_hooks
.identifier_size
;
753 case TREE_LIST
: return sizeof (struct tree_list
);
756 case PLACEHOLDER_EXPR
: return sizeof (struct tree_common
);
759 case OMP_CLAUSE
: gcc_unreachable ();
761 case SSA_NAME
: return sizeof (struct tree_ssa_name
);
763 case STATEMENT_LIST
: return sizeof (struct tree_statement_list
);
764 case BLOCK
: return sizeof (struct tree_block
);
765 case CONSTRUCTOR
: return sizeof (struct tree_constructor
);
766 case OPTIMIZATION_NODE
: return sizeof (struct tree_optimization_option
);
767 case TARGET_OPTION_NODE
: return sizeof (struct tree_target_option
);
770 return lang_hooks
.tree_size (code
);
778 /* Compute the number of bytes occupied by NODE. This routine only
779 looks at TREE_CODE, except for those nodes that have variable sizes. */
781 tree_size (const_tree node
)
783 const enum tree_code code
= TREE_CODE (node
);
787 return (sizeof (struct tree_int_cst
)
788 + (TREE_INT_CST_EXT_NUNITS (node
) - 1) * sizeof (HOST_WIDE_INT
));
791 return (offsetof (struct tree_binfo
, base_binfos
)
793 ::embedded_size (BINFO_N_BASE_BINFOS (node
)));
796 return (sizeof (struct tree_vec
)
797 + (TREE_VEC_LENGTH (node
) - 1) * sizeof (tree
));
800 return (sizeof (struct tree_vector
)
801 + (TYPE_VECTOR_SUBPARTS (TREE_TYPE (node
)) - 1) * sizeof (tree
));
804 return TREE_STRING_LENGTH (node
) + offsetof (struct tree_string
, str
) + 1;
807 return (sizeof (struct tree_omp_clause
)
808 + (omp_clause_num_ops
[OMP_CLAUSE_CODE (node
)] - 1)
812 if (TREE_CODE_CLASS (code
) == tcc_vl_exp
)
813 return (sizeof (struct tree_exp
)
814 + (VL_EXP_OPERAND_LENGTH (node
) - 1) * sizeof (tree
));
816 return tree_code_size (code
);
820 /* Record interesting allocation statistics for a tree node with CODE
824 record_node_allocation_statistics (enum tree_code code ATTRIBUTE_UNUSED
,
825 size_t length ATTRIBUTE_UNUSED
)
827 enum tree_code_class type
= TREE_CODE_CLASS (code
);
830 if (!GATHER_STATISTICS
)
835 case tcc_declaration
: /* A decl node */
839 case tcc_type
: /* a type node */
843 case tcc_statement
: /* an expression with side effects */
847 case tcc_reference
: /* a reference */
851 case tcc_expression
: /* an expression */
852 case tcc_comparison
: /* a comparison expression */
853 case tcc_unary
: /* a unary arithmetic expression */
854 case tcc_binary
: /* a binary arithmetic expression */
858 case tcc_constant
: /* a constant */
862 case tcc_exceptional
: /* something random, like an identifier. */
865 case IDENTIFIER_NODE
:
878 kind
= ssa_name_kind
;
890 kind
= omp_clause_kind
;
907 tree_code_counts
[(int) code
]++;
908 tree_node_counts
[(int) kind
]++;
909 tree_node_sizes
[(int) kind
] += length
;
912 /* Allocate and return a new UID from the DECL_UID namespace. */
915 allocate_decl_uid (void)
917 return next_decl_uid
++;
920 /* Return a newly allocated node of code CODE. For decl and type
921 nodes, some other fields are initialized. The rest of the node is
922 initialized to zero. This function cannot be used for TREE_VEC,
923 INTEGER_CST or OMP_CLAUSE nodes, which is enforced by asserts in
926 Achoo! I got a code in the node. */
929 make_node_stat (enum tree_code code MEM_STAT_DECL
)
932 enum tree_code_class type
= TREE_CODE_CLASS (code
);
933 size_t length
= tree_code_size (code
);
935 record_node_allocation_statistics (code
, length
);
937 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
938 TREE_SET_CODE (t
, code
);
943 TREE_SIDE_EFFECTS (t
) = 1;
946 case tcc_declaration
:
947 if (CODE_CONTAINS_STRUCT (code
, TS_DECL_COMMON
))
949 if (code
== FUNCTION_DECL
)
951 DECL_ALIGN (t
) = FUNCTION_BOUNDARY
;
952 DECL_MODE (t
) = FUNCTION_MODE
;
957 DECL_SOURCE_LOCATION (t
) = input_location
;
958 if (TREE_CODE (t
) == DEBUG_EXPR_DECL
)
959 DECL_UID (t
) = --next_debug_decl_uid
;
962 DECL_UID (t
) = allocate_decl_uid ();
963 SET_DECL_PT_UID (t
, -1);
965 if (TREE_CODE (t
) == LABEL_DECL
)
966 LABEL_DECL_UID (t
) = -1;
971 TYPE_UID (t
) = next_type_uid
++;
972 TYPE_ALIGN (t
) = BITS_PER_UNIT
;
973 TYPE_USER_ALIGN (t
) = 0;
974 TYPE_MAIN_VARIANT (t
) = t
;
975 TYPE_CANONICAL (t
) = t
;
977 /* Default to no attributes for type, but let target change that. */
978 TYPE_ATTRIBUTES (t
) = NULL_TREE
;
979 targetm
.set_default_type_attributes (t
);
981 /* We have not yet computed the alias set for this type. */
982 TYPE_ALIAS_SET (t
) = -1;
986 TREE_CONSTANT (t
) = 1;
995 case PREDECREMENT_EXPR
:
996 case PREINCREMENT_EXPR
:
997 case POSTDECREMENT_EXPR
:
998 case POSTINCREMENT_EXPR
:
999 /* All of these have side-effects, no matter what their
1001 TREE_SIDE_EFFECTS (t
) = 1;
1010 /* Other classes need no special treatment. */
1017 /* Return a new node with the same contents as NODE except that its
1018 TREE_CHAIN, if it has one, is zero and it has a fresh uid. */
1021 copy_node_stat (tree node MEM_STAT_DECL
)
1024 enum tree_code code
= TREE_CODE (node
);
1027 gcc_assert (code
!= STATEMENT_LIST
);
1029 length
= tree_size (node
);
1030 record_node_allocation_statistics (code
, length
);
1031 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
1032 memcpy (t
, node
, length
);
1034 if (CODE_CONTAINS_STRUCT (code
, TS_COMMON
))
1036 TREE_ASM_WRITTEN (t
) = 0;
1037 TREE_VISITED (t
) = 0;
1039 if (TREE_CODE_CLASS (code
) == tcc_declaration
)
1041 if (code
== DEBUG_EXPR_DECL
)
1042 DECL_UID (t
) = --next_debug_decl_uid
;
1045 DECL_UID (t
) = allocate_decl_uid ();
1046 if (DECL_PT_UID_SET_P (node
))
1047 SET_DECL_PT_UID (t
, DECL_PT_UID (node
));
1049 if ((TREE_CODE (node
) == PARM_DECL
|| TREE_CODE (node
) == VAR_DECL
)
1050 && DECL_HAS_VALUE_EXPR_P (node
))
1052 SET_DECL_VALUE_EXPR (t
, DECL_VALUE_EXPR (node
));
1053 DECL_HAS_VALUE_EXPR_P (t
) = 1;
1055 /* DECL_DEBUG_EXPR is copied explicitely by callers. */
1056 if (TREE_CODE (node
) == VAR_DECL
)
1058 DECL_HAS_DEBUG_EXPR_P (t
) = 0;
1059 t
->decl_with_vis
.symtab_node
= NULL
;
1061 if (TREE_CODE (node
) == VAR_DECL
&& DECL_HAS_INIT_PRIORITY_P (node
))
1063 SET_DECL_INIT_PRIORITY (t
, DECL_INIT_PRIORITY (node
));
1064 DECL_HAS_INIT_PRIORITY_P (t
) = 1;
1066 if (TREE_CODE (node
) == FUNCTION_DECL
)
1068 DECL_STRUCT_FUNCTION (t
) = NULL
;
1069 t
->decl_with_vis
.symtab_node
= NULL
;
1072 else if (TREE_CODE_CLASS (code
) == tcc_type
)
1074 TYPE_UID (t
) = next_type_uid
++;
1075 /* The following is so that the debug code for
1076 the copy is different from the original type.
1077 The two statements usually duplicate each other
1078 (because they clear fields of the same union),
1079 but the optimizer should catch that. */
1080 TYPE_SYMTAB_POINTER (t
) = 0;
1081 TYPE_SYMTAB_ADDRESS (t
) = 0;
1083 /* Do not copy the values cache. */
1084 if (TYPE_CACHED_VALUES_P (t
))
1086 TYPE_CACHED_VALUES_P (t
) = 0;
1087 TYPE_CACHED_VALUES (t
) = NULL_TREE
;
1094 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
1095 For example, this can copy a list made of TREE_LIST nodes. */
1098 copy_list (tree list
)
1106 head
= prev
= copy_node (list
);
1107 next
= TREE_CHAIN (list
);
1110 TREE_CHAIN (prev
) = copy_node (next
);
1111 prev
= TREE_CHAIN (prev
);
1112 next
= TREE_CHAIN (next
);
1118 /* Return the value that TREE_INT_CST_EXT_NUNITS should have for an
1119 INTEGER_CST with value CST and type TYPE. */
1122 get_int_cst_ext_nunits (tree type
, const wide_int
&cst
)
1124 gcc_checking_assert (cst
.get_precision () == TYPE_PRECISION (type
));
1125 /* We need an extra zero HWI if CST is an unsigned integer with its
1126 upper bit set, and if CST occupies a whole number of HWIs. */
1127 if (TYPE_UNSIGNED (type
)
1129 && (cst
.get_precision () % HOST_BITS_PER_WIDE_INT
) == 0)
1130 return cst
.get_precision () / HOST_BITS_PER_WIDE_INT
+ 1;
1131 return cst
.get_len ();
1134 /* Return a new INTEGER_CST with value CST and type TYPE. */
1137 build_new_int_cst (tree type
, const wide_int
&cst
)
1139 unsigned int len
= cst
.get_len ();
1140 unsigned int ext_len
= get_int_cst_ext_nunits (type
, cst
);
1141 tree nt
= make_int_cst (len
, ext_len
);
1146 TREE_INT_CST_ELT (nt
, ext_len
) = 0;
1147 for (unsigned int i
= len
; i
< ext_len
; ++i
)
1148 TREE_INT_CST_ELT (nt
, i
) = -1;
1150 else if (TYPE_UNSIGNED (type
)
1151 && cst
.get_precision () < len
* HOST_BITS_PER_WIDE_INT
)
1154 TREE_INT_CST_ELT (nt
, len
)
1155 = zext_hwi (cst
.elt (len
),
1156 cst
.get_precision () % HOST_BITS_PER_WIDE_INT
);
1159 for (unsigned int i
= 0; i
< len
; i
++)
1160 TREE_INT_CST_ELT (nt
, i
) = cst
.elt (i
);
1161 TREE_TYPE (nt
) = type
;
1165 /* Create an INT_CST node with a LOW value sign extended to TYPE. */
1168 build_int_cst (tree type
, HOST_WIDE_INT low
)
1170 /* Support legacy code. */
1172 type
= integer_type_node
;
1174 return wide_int_to_tree (type
, wi::shwi (low
, TYPE_PRECISION (type
)));
1178 build_int_cstu (tree type
, unsigned HOST_WIDE_INT cst
)
1180 return wide_int_to_tree (type
, wi::uhwi (cst
, TYPE_PRECISION (type
)));
1183 /* Create an INT_CST node with a LOW value sign extended to TYPE. */
1186 build_int_cst_type (tree type
, HOST_WIDE_INT low
)
1189 return wide_int_to_tree (type
, wi::shwi (low
, TYPE_PRECISION (type
)));
1192 /* Constructs tree in type TYPE from with value given by CST. Signedness
1193 of CST is assumed to be the same as the signedness of TYPE. */
1196 double_int_to_tree (tree type
, double_int cst
)
1198 return wide_int_to_tree (type
, widest_int::from (cst
, TYPE_SIGN (type
)));
1201 /* We force the wide_int CST to the range of the type TYPE by sign or
1202 zero extending it. OVERFLOWABLE indicates if we are interested in
1203 overflow of the value, when >0 we are only interested in signed
1204 overflow, for <0 we are interested in any overflow. OVERFLOWED
1205 indicates whether overflow has already occurred. CONST_OVERFLOWED
1206 indicates whether constant overflow has already occurred. We force
1207 T's value to be within range of T's type (by setting to 0 or 1 all
1208 the bits outside the type's range). We set TREE_OVERFLOWED if,
1209 OVERFLOWED is nonzero,
1210 or OVERFLOWABLE is >0 and signed overflow occurs
1211 or OVERFLOWABLE is <0 and any overflow occurs
1212 We return a new tree node for the extended wide_int. The node
1213 is shared if no overflow flags are set. */
1217 force_fit_type (tree type
, const wide_int_ref
&cst
,
1218 int overflowable
, bool overflowed
)
1220 signop sign
= TYPE_SIGN (type
);
1222 /* If we need to set overflow flags, return a new unshared node. */
1223 if (overflowed
|| !wi::fits_to_tree_p (cst
, type
))
1227 || (overflowable
> 0 && sign
== SIGNED
))
1229 wide_int tmp
= wide_int::from (cst
, TYPE_PRECISION (type
), sign
);
1230 tree t
= build_new_int_cst (type
, tmp
);
1231 TREE_OVERFLOW (t
) = 1;
1236 /* Else build a shared node. */
1237 return wide_int_to_tree (type
, cst
);
1240 /* These are the hash table functions for the hash table of INTEGER_CST
1241 nodes of a sizetype. */
1243 /* Return the hash code code X, an INTEGER_CST. */
1246 int_cst_hash_hash (const void *x
)
1248 const_tree
const t
= (const_tree
) x
;
1249 hashval_t code
= htab_hash_pointer (TREE_TYPE (t
));
1252 for (i
= 0; i
< TREE_INT_CST_NUNITS (t
); i
++)
1253 code
^= TREE_INT_CST_ELT (t
, i
);
1258 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
1259 is the same as that given by *Y, which is the same. */
1262 int_cst_hash_eq (const void *x
, const void *y
)
1264 const_tree
const xt
= (const_tree
) x
;
1265 const_tree
const yt
= (const_tree
) y
;
1267 if (TREE_TYPE (xt
) != TREE_TYPE (yt
)
1268 || TREE_INT_CST_NUNITS (xt
) != TREE_INT_CST_NUNITS (yt
)
1269 || TREE_INT_CST_EXT_NUNITS (xt
) != TREE_INT_CST_EXT_NUNITS (yt
))
1272 for (int i
= 0; i
< TREE_INT_CST_NUNITS (xt
); i
++)
1273 if (TREE_INT_CST_ELT (xt
, i
) != TREE_INT_CST_ELT (yt
, i
))
1279 /* Create an INT_CST node of TYPE and value CST.
1280 The returned node is always shared. For small integers we use a
1281 per-type vector cache, for larger ones we use a single hash table.
1282 The value is extended from its precision according to the sign of
1283 the type to be a multiple of HOST_BITS_PER_WIDE_INT. This defines
1284 the upper bits and ensures that hashing and value equality based
1285 upon the underlying HOST_WIDE_INTs works without masking. */
1288 wide_int_to_tree (tree type
, const wide_int_ref
&pcst
)
1295 unsigned int prec
= TYPE_PRECISION (type
);
1296 signop sgn
= TYPE_SIGN (type
);
1298 /* Verify that everything is canonical. */
1299 int l
= pcst
.get_len ();
1302 if (pcst
.elt (l
- 1) == 0)
1303 gcc_checking_assert (pcst
.elt (l
- 2) < 0);
1304 if (pcst
.elt (l
- 1) == (HOST_WIDE_INT
) -1)
1305 gcc_checking_assert (pcst
.elt (l
- 2) >= 0);
1308 wide_int cst
= wide_int::from (pcst
, prec
, sgn
);
1309 unsigned int ext_len
= get_int_cst_ext_nunits (type
, cst
);
1313 /* We just need to store a single HOST_WIDE_INT. */
1315 if (TYPE_UNSIGNED (type
))
1316 hwi
= cst
.to_uhwi ();
1318 hwi
= cst
.to_shwi ();
1320 switch (TREE_CODE (type
))
1323 gcc_assert (hwi
== 0);
1327 case REFERENCE_TYPE
:
1328 /* Cache NULL pointer. */
1337 /* Cache false or true. */
1345 if (TYPE_SIGN (type
) == UNSIGNED
)
1348 limit
= INTEGER_SHARE_LIMIT
;
1349 if (IN_RANGE (hwi
, 0, INTEGER_SHARE_LIMIT
- 1))
1354 /* Cache [-1, N). */
1355 limit
= INTEGER_SHARE_LIMIT
+ 1;
1356 if (IN_RANGE (hwi
, -1, INTEGER_SHARE_LIMIT
- 1))
1370 /* Look for it in the type's vector of small shared ints. */
1371 if (!TYPE_CACHED_VALUES_P (type
))
1373 TYPE_CACHED_VALUES_P (type
) = 1;
1374 TYPE_CACHED_VALUES (type
) = make_tree_vec (limit
);
1377 t
= TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
);
1379 /* Make sure no one is clobbering the shared constant. */
1380 gcc_checking_assert (TREE_TYPE (t
) == type
1381 && TREE_INT_CST_NUNITS (t
) == 1
1382 && TREE_INT_CST_OFFSET_NUNITS (t
) == 1
1383 && TREE_INT_CST_EXT_NUNITS (t
) == 1
1384 && TREE_INT_CST_ELT (t
, 0) == hwi
);
1387 /* Create a new shared int. */
1388 t
= build_new_int_cst (type
, cst
);
1389 TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) = t
;
1394 /* Use the cache of larger shared ints, using int_cst_node as
1398 TREE_INT_CST_ELT (int_cst_node
, 0) = hwi
;
1399 TREE_TYPE (int_cst_node
) = type
;
1401 slot
= htab_find_slot (int_cst_hash_table
, int_cst_node
, INSERT
);
1405 /* Insert this one into the hash table. */
1408 /* Make a new node for next time round. */
1409 int_cst_node
= make_int_cst (1, 1);
1415 /* The value either hashes properly or we drop it on the floor
1416 for the gc to take care of. There will not be enough of them
1420 tree nt
= build_new_int_cst (type
, cst
);
1421 slot
= htab_find_slot (int_cst_hash_table
, nt
, INSERT
);
1425 /* Insert this one into the hash table. */
1435 cache_integer_cst (tree t
)
1437 tree type
= TREE_TYPE (t
);
1440 int prec
= TYPE_PRECISION (type
);
1442 gcc_assert (!TREE_OVERFLOW (t
));
1444 switch (TREE_CODE (type
))
1447 gcc_assert (integer_zerop (t
));
1451 case REFERENCE_TYPE
:
1452 /* Cache NULL pointer. */
1453 if (integer_zerop (t
))
1461 /* Cache false or true. */
1463 if (wi::ltu_p (t
, 2))
1464 ix
= TREE_INT_CST_ELT (t
, 0);
1469 if (TYPE_UNSIGNED (type
))
1472 limit
= INTEGER_SHARE_LIMIT
;
1474 /* This is a little hokie, but if the prec is smaller than
1475 what is necessary to hold INTEGER_SHARE_LIMIT, then the
1476 obvious test will not get the correct answer. */
1477 if (prec
< HOST_BITS_PER_WIDE_INT
)
1479 if (tree_to_uhwi (t
) < (unsigned HOST_WIDE_INT
) INTEGER_SHARE_LIMIT
)
1480 ix
= tree_to_uhwi (t
);
1482 else if (wi::ltu_p (t
, INTEGER_SHARE_LIMIT
))
1483 ix
= tree_to_uhwi (t
);
1488 limit
= INTEGER_SHARE_LIMIT
+ 1;
1490 if (integer_minus_onep (t
))
1492 else if (!wi::neg_p (t
))
1494 if (prec
< HOST_BITS_PER_WIDE_INT
)
1496 if (tree_to_shwi (t
) < INTEGER_SHARE_LIMIT
)
1497 ix
= tree_to_shwi (t
) + 1;
1499 else if (wi::ltu_p (t
, INTEGER_SHARE_LIMIT
))
1500 ix
= tree_to_shwi (t
) + 1;
1514 /* Look for it in the type's vector of small shared ints. */
1515 if (!TYPE_CACHED_VALUES_P (type
))
1517 TYPE_CACHED_VALUES_P (type
) = 1;
1518 TYPE_CACHED_VALUES (type
) = make_tree_vec (limit
);
1521 gcc_assert (TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) == NULL_TREE
);
1522 TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) = t
;
1526 /* Use the cache of larger shared ints. */
1529 slot
= htab_find_slot (int_cst_hash_table
, t
, INSERT
);
1530 /* If there is already an entry for the number verify it's the
1533 gcc_assert (wi::eq_p (tree (*slot
), t
));
1535 /* Otherwise insert this one into the hash table. */
1541 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
1542 and the rest are zeros. */
1545 build_low_bits_mask (tree type
, unsigned bits
)
1547 gcc_assert (bits
<= TYPE_PRECISION (type
));
1549 return wide_int_to_tree (type
, wi::mask (bits
, false,
1550 TYPE_PRECISION (type
)));
1553 /* Checks that X is integer constant that can be expressed in (unsigned)
1554 HOST_WIDE_INT without loss of precision. */
1557 cst_and_fits_in_hwi (const_tree x
)
1559 if (TREE_CODE (x
) != INTEGER_CST
)
1562 if (TYPE_PRECISION (TREE_TYPE (x
)) > HOST_BITS_PER_WIDE_INT
)
1565 return TREE_INT_CST_NUNITS (x
) == 1;
1568 /* Build a newly constructed TREE_VEC node of length LEN. */
1571 make_vector_stat (unsigned len MEM_STAT_DECL
)
1574 unsigned length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vector
);
1576 record_node_allocation_statistics (VECTOR_CST
, length
);
1578 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
1580 TREE_SET_CODE (t
, VECTOR_CST
);
1581 TREE_CONSTANT (t
) = 1;
1586 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1587 are in a list pointed to by VALS. */
1590 build_vector_stat (tree type
, tree
*vals MEM_STAT_DECL
)
1594 tree v
= make_vector (TYPE_VECTOR_SUBPARTS (type
));
1595 TREE_TYPE (v
) = type
;
1597 /* Iterate through elements and check for overflow. */
1598 for (cnt
= 0; cnt
< TYPE_VECTOR_SUBPARTS (type
); ++cnt
)
1600 tree value
= vals
[cnt
];
1602 VECTOR_CST_ELT (v
, cnt
) = value
;
1604 /* Don't crash if we get an address constant. */
1605 if (!CONSTANT_CLASS_P (value
))
1608 over
|= TREE_OVERFLOW (value
);
1611 TREE_OVERFLOW (v
) = over
;
1615 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1616 are extracted from V, a vector of CONSTRUCTOR_ELT. */
1619 build_vector_from_ctor (tree type
, vec
<constructor_elt
, va_gc
> *v
)
1621 tree
*vec
= XALLOCAVEC (tree
, TYPE_VECTOR_SUBPARTS (type
));
1622 unsigned HOST_WIDE_INT idx
;
1625 FOR_EACH_CONSTRUCTOR_VALUE (v
, idx
, value
)
1627 for (; idx
< TYPE_VECTOR_SUBPARTS (type
); ++idx
)
1628 vec
[idx
] = build_zero_cst (TREE_TYPE (type
));
1630 return build_vector (type
, vec
);
1633 /* Build a vector of type VECTYPE where all the elements are SCs. */
1635 build_vector_from_val (tree vectype
, tree sc
)
1637 int i
, nunits
= TYPE_VECTOR_SUBPARTS (vectype
);
1639 if (sc
== error_mark_node
)
1642 /* Verify that the vector type is suitable for SC. Note that there
1643 is some inconsistency in the type-system with respect to restrict
1644 qualifications of pointers. Vector types always have a main-variant
1645 element type and the qualification is applied to the vector-type.
1646 So TREE_TYPE (vector-type) does not return a properly qualified
1647 vector element-type. */
1648 gcc_checking_assert (types_compatible_p (TYPE_MAIN_VARIANT (TREE_TYPE (sc
)),
1649 TREE_TYPE (vectype
)));
1651 if (CONSTANT_CLASS_P (sc
))
1653 tree
*v
= XALLOCAVEC (tree
, nunits
);
1654 for (i
= 0; i
< nunits
; ++i
)
1656 return build_vector (vectype
, v
);
1660 vec
<constructor_elt
, va_gc
> *v
;
1661 vec_alloc (v
, nunits
);
1662 for (i
= 0; i
< nunits
; ++i
)
1663 CONSTRUCTOR_APPEND_ELT (v
, NULL_TREE
, sc
);
1664 return build_constructor (vectype
, v
);
1668 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1669 are in the vec pointed to by VALS. */
1671 build_constructor (tree type
, vec
<constructor_elt
, va_gc
> *vals
)
1673 tree c
= make_node (CONSTRUCTOR
);
1675 constructor_elt
*elt
;
1676 bool constant_p
= true;
1677 bool side_effects_p
= false;
1679 TREE_TYPE (c
) = type
;
1680 CONSTRUCTOR_ELTS (c
) = vals
;
1682 FOR_EACH_VEC_SAFE_ELT (vals
, i
, elt
)
1684 /* Mostly ctors will have elts that don't have side-effects, so
1685 the usual case is to scan all the elements. Hence a single
1686 loop for both const and side effects, rather than one loop
1687 each (with early outs). */
1688 if (!TREE_CONSTANT (elt
->value
))
1690 if (TREE_SIDE_EFFECTS (elt
->value
))
1691 side_effects_p
= true;
1694 TREE_SIDE_EFFECTS (c
) = side_effects_p
;
1695 TREE_CONSTANT (c
) = constant_p
;
1700 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
1703 build_constructor_single (tree type
, tree index
, tree value
)
1705 vec
<constructor_elt
, va_gc
> *v
;
1706 constructor_elt elt
= {index
, value
};
1709 v
->quick_push (elt
);
1711 return build_constructor (type
, v
);
1715 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1716 are in a list pointed to by VALS. */
1718 build_constructor_from_list (tree type
, tree vals
)
1721 vec
<constructor_elt
, va_gc
> *v
= NULL
;
1725 vec_alloc (v
, list_length (vals
));
1726 for (t
= vals
; t
; t
= TREE_CHAIN (t
))
1727 CONSTRUCTOR_APPEND_ELT (v
, TREE_PURPOSE (t
), TREE_VALUE (t
));
1730 return build_constructor (type
, v
);
1733 /* Return a new CONSTRUCTOR node whose type is TYPE. NELTS is the number
1734 of elements, provided as index/value pairs. */
1737 build_constructor_va (tree type
, int nelts
, ...)
1739 vec
<constructor_elt
, va_gc
> *v
= NULL
;
1742 va_start (p
, nelts
);
1743 vec_alloc (v
, nelts
);
1746 tree index
= va_arg (p
, tree
);
1747 tree value
= va_arg (p
, tree
);
1748 CONSTRUCTOR_APPEND_ELT (v
, index
, value
);
1751 return build_constructor (type
, v
);
1754 /* Return a new FIXED_CST node whose type is TYPE and value is F. */
1757 build_fixed (tree type
, FIXED_VALUE_TYPE f
)
1760 FIXED_VALUE_TYPE
*fp
;
1762 v
= make_node (FIXED_CST
);
1763 fp
= ggc_alloc
<fixed_value
> ();
1764 memcpy (fp
, &f
, sizeof (FIXED_VALUE_TYPE
));
1766 TREE_TYPE (v
) = type
;
1767 TREE_FIXED_CST_PTR (v
) = fp
;
1771 /* Return a new REAL_CST node whose type is TYPE and value is D. */
1774 build_real (tree type
, REAL_VALUE_TYPE d
)
1777 REAL_VALUE_TYPE
*dp
;
1780 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
1781 Consider doing it via real_convert now. */
1783 v
= make_node (REAL_CST
);
1784 dp
= ggc_alloc
<real_value
> ();
1785 memcpy (dp
, &d
, sizeof (REAL_VALUE_TYPE
));
1787 TREE_TYPE (v
) = type
;
1788 TREE_REAL_CST_PTR (v
) = dp
;
1789 TREE_OVERFLOW (v
) = overflow
;
1793 /* Return a new REAL_CST node whose type is TYPE
1794 and whose value is the integer value of the INTEGER_CST node I. */
1797 real_value_from_int_cst (const_tree type
, const_tree i
)
1801 /* Clear all bits of the real value type so that we can later do
1802 bitwise comparisons to see if two values are the same. */
1803 memset (&d
, 0, sizeof d
);
1805 real_from_integer (&d
, type
? TYPE_MODE (type
) : VOIDmode
, i
,
1806 TYPE_SIGN (TREE_TYPE (i
)));
1810 /* Given a tree representing an integer constant I, return a tree
1811 representing the same value as a floating-point constant of type TYPE. */
1814 build_real_from_int_cst (tree type
, const_tree i
)
1817 int overflow
= TREE_OVERFLOW (i
);
1819 v
= build_real (type
, real_value_from_int_cst (type
, i
));
1821 TREE_OVERFLOW (v
) |= overflow
;
1825 /* Return a newly constructed STRING_CST node whose value is
1826 the LEN characters at STR.
1827 Note that for a C string literal, LEN should include the trailing NUL.
1828 The TREE_TYPE is not initialized. */
1831 build_string (int len
, const char *str
)
1836 /* Do not waste bytes provided by padding of struct tree_string. */
1837 length
= len
+ offsetof (struct tree_string
, str
) + 1;
1839 record_node_allocation_statistics (STRING_CST
, length
);
1841 s
= (tree
) ggc_internal_alloc (length
);
1843 memset (s
, 0, sizeof (struct tree_typed
));
1844 TREE_SET_CODE (s
, STRING_CST
);
1845 TREE_CONSTANT (s
) = 1;
1846 TREE_STRING_LENGTH (s
) = len
;
1847 memcpy (s
->string
.str
, str
, len
);
1848 s
->string
.str
[len
] = '\0';
1853 /* Return a newly constructed COMPLEX_CST node whose value is
1854 specified by the real and imaginary parts REAL and IMAG.
1855 Both REAL and IMAG should be constant nodes. TYPE, if specified,
1856 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
1859 build_complex (tree type
, tree real
, tree imag
)
1861 tree t
= make_node (COMPLEX_CST
);
1863 TREE_REALPART (t
) = real
;
1864 TREE_IMAGPART (t
) = imag
;
1865 TREE_TYPE (t
) = type
? type
: build_complex_type (TREE_TYPE (real
));
1866 TREE_OVERFLOW (t
) = TREE_OVERFLOW (real
) | TREE_OVERFLOW (imag
);
1870 /* Return a constant of arithmetic type TYPE which is the
1871 multiplicative identity of the set TYPE. */
1874 build_one_cst (tree type
)
1876 switch (TREE_CODE (type
))
1878 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
1879 case POINTER_TYPE
: case REFERENCE_TYPE
:
1881 return build_int_cst (type
, 1);
1884 return build_real (type
, dconst1
);
1886 case FIXED_POINT_TYPE
:
1887 /* We can only generate 1 for accum types. */
1888 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type
)));
1889 return build_fixed (type
, FCONST1 (TYPE_MODE (type
)));
1893 tree scalar
= build_one_cst (TREE_TYPE (type
));
1895 return build_vector_from_val (type
, scalar
);
1899 return build_complex (type
,
1900 build_one_cst (TREE_TYPE (type
)),
1901 build_zero_cst (TREE_TYPE (type
)));
1908 /* Return an integer of type TYPE containing all 1's in as much precision as
1909 it contains, or a complex or vector whose subparts are such integers. */
1912 build_all_ones_cst (tree type
)
1914 if (TREE_CODE (type
) == COMPLEX_TYPE
)
1916 tree scalar
= build_all_ones_cst (TREE_TYPE (type
));
1917 return build_complex (type
, scalar
, scalar
);
1920 return build_minus_one_cst (type
);
1923 /* Return a constant of arithmetic type TYPE which is the
1924 opposite of the multiplicative identity of the set TYPE. */
1927 build_minus_one_cst (tree type
)
1929 switch (TREE_CODE (type
))
1931 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
1932 case POINTER_TYPE
: case REFERENCE_TYPE
:
1934 return build_int_cst (type
, -1);
1937 return build_real (type
, dconstm1
);
1939 case FIXED_POINT_TYPE
:
1940 /* We can only generate 1 for accum types. */
1941 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type
)));
1942 return build_fixed (type
, fixed_from_double_int (double_int_minus_one
,
1947 tree scalar
= build_minus_one_cst (TREE_TYPE (type
));
1949 return build_vector_from_val (type
, scalar
);
1953 return build_complex (type
,
1954 build_minus_one_cst (TREE_TYPE (type
)),
1955 build_zero_cst (TREE_TYPE (type
)));
1962 /* Build 0 constant of type TYPE. This is used by constructor folding
1963 and thus the constant should be represented in memory by
1967 build_zero_cst (tree type
)
1969 switch (TREE_CODE (type
))
1971 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
1972 case POINTER_TYPE
: case REFERENCE_TYPE
:
1973 case OFFSET_TYPE
: case NULLPTR_TYPE
:
1974 return build_int_cst (type
, 0);
1977 return build_real (type
, dconst0
);
1979 case FIXED_POINT_TYPE
:
1980 return build_fixed (type
, FCONST0 (TYPE_MODE (type
)));
1984 tree scalar
= build_zero_cst (TREE_TYPE (type
));
1986 return build_vector_from_val (type
, scalar
);
1991 tree zero
= build_zero_cst (TREE_TYPE (type
));
1993 return build_complex (type
, zero
, zero
);
1997 if (!AGGREGATE_TYPE_P (type
))
1998 return fold_convert (type
, integer_zero_node
);
1999 return build_constructor (type
, NULL
);
2004 /* Build a BINFO with LEN language slots. */
2007 make_tree_binfo_stat (unsigned base_binfos MEM_STAT_DECL
)
2010 size_t length
= (offsetof (struct tree_binfo
, base_binfos
)
2011 + vec
<tree
, va_gc
>::embedded_size (base_binfos
));
2013 record_node_allocation_statistics (TREE_BINFO
, length
);
2015 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
2017 memset (t
, 0, offsetof (struct tree_binfo
, base_binfos
));
2019 TREE_SET_CODE (t
, TREE_BINFO
);
2021 BINFO_BASE_BINFOS (t
)->embedded_init (base_binfos
);
2026 /* Create a CASE_LABEL_EXPR tree node and return it. */
2029 build_case_label (tree low_value
, tree high_value
, tree label_decl
)
2031 tree t
= make_node (CASE_LABEL_EXPR
);
2033 TREE_TYPE (t
) = void_type_node
;
2034 SET_EXPR_LOCATION (t
, DECL_SOURCE_LOCATION (label_decl
));
2036 CASE_LOW (t
) = low_value
;
2037 CASE_HIGH (t
) = high_value
;
2038 CASE_LABEL (t
) = label_decl
;
2039 CASE_CHAIN (t
) = NULL_TREE
;
2044 /* Build a newly constructed INTEGER_CST node. LEN and EXT_LEN are the
2045 values of TREE_INT_CST_NUNITS and TREE_INT_CST_EXT_NUNITS respectively.
2046 The latter determines the length of the HOST_WIDE_INT vector. */
2049 make_int_cst_stat (int len
, int ext_len MEM_STAT_DECL
)
2052 int length
= ((ext_len
- 1) * sizeof (HOST_WIDE_INT
)
2053 + sizeof (struct tree_int_cst
));
2056 record_node_allocation_statistics (INTEGER_CST
, length
);
2058 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
2060 TREE_SET_CODE (t
, INTEGER_CST
);
2061 TREE_INT_CST_NUNITS (t
) = len
;
2062 TREE_INT_CST_EXT_NUNITS (t
) = ext_len
;
2063 /* to_offset can only be applied to trees that are offset_int-sized
2064 or smaller. EXT_LEN is correct if it fits, otherwise the constant
2065 must be exactly the precision of offset_int and so LEN is correct. */
2066 if (ext_len
<= OFFSET_INT_ELTS
)
2067 TREE_INT_CST_OFFSET_NUNITS (t
) = ext_len
;
2069 TREE_INT_CST_OFFSET_NUNITS (t
) = len
;
2071 TREE_CONSTANT (t
) = 1;
2076 /* Build a newly constructed TREE_VEC node of length LEN. */
2079 make_tree_vec_stat (int len MEM_STAT_DECL
)
2082 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
2084 record_node_allocation_statistics (TREE_VEC
, length
);
2086 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
2088 TREE_SET_CODE (t
, TREE_VEC
);
2089 TREE_VEC_LENGTH (t
) = len
;
2094 /* Grow a TREE_VEC node to new length LEN. */
2097 grow_tree_vec_stat (tree v
, int len MEM_STAT_DECL
)
2099 gcc_assert (TREE_CODE (v
) == TREE_VEC
);
2101 int oldlen
= TREE_VEC_LENGTH (v
);
2102 gcc_assert (len
> oldlen
);
2104 int oldlength
= (oldlen
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
2105 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
2107 record_node_allocation_statistics (TREE_VEC
, length
- oldlength
);
2109 v
= (tree
) ggc_realloc (v
, length PASS_MEM_STAT
);
2111 TREE_VEC_LENGTH (v
) = len
;
2116 /* Return 1 if EXPR is the integer constant zero or a complex constant
2120 integer_zerop (const_tree expr
)
2124 switch (TREE_CODE (expr
))
2127 return wi::eq_p (expr
, 0);
2129 return (integer_zerop (TREE_REALPART (expr
))
2130 && integer_zerop (TREE_IMAGPART (expr
)));
2134 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2135 if (!integer_zerop (VECTOR_CST_ELT (expr
, i
)))
2144 /* Return 1 if EXPR is the integer constant one or the corresponding
2145 complex constant. */
2148 integer_onep (const_tree expr
)
2152 switch (TREE_CODE (expr
))
2155 return wi::eq_p (wi::to_widest (expr
), 1);
2157 return (integer_onep (TREE_REALPART (expr
))
2158 && integer_zerop (TREE_IMAGPART (expr
)));
2162 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2163 if (!integer_onep (VECTOR_CST_ELT (expr
, i
)))
2172 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
2173 it contains, or a complex or vector whose subparts are such integers. */
2176 integer_all_onesp (const_tree expr
)
2180 if (TREE_CODE (expr
) == COMPLEX_CST
2181 && integer_all_onesp (TREE_REALPART (expr
))
2182 && integer_all_onesp (TREE_IMAGPART (expr
)))
2185 else if (TREE_CODE (expr
) == VECTOR_CST
)
2188 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2189 if (!integer_all_onesp (VECTOR_CST_ELT (expr
, i
)))
2194 else if (TREE_CODE (expr
) != INTEGER_CST
)
2197 return wi::max_value (TYPE_PRECISION (TREE_TYPE (expr
)), UNSIGNED
) == expr
;
2200 /* Return 1 if EXPR is the integer constant minus one. */
2203 integer_minus_onep (const_tree expr
)
2207 if (TREE_CODE (expr
) == COMPLEX_CST
)
2208 return (integer_all_onesp (TREE_REALPART (expr
))
2209 && integer_zerop (TREE_IMAGPART (expr
)));
2211 return integer_all_onesp (expr
);
2214 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
2218 integer_pow2p (const_tree expr
)
2222 if (TREE_CODE (expr
) == COMPLEX_CST
2223 && integer_pow2p (TREE_REALPART (expr
))
2224 && integer_zerop (TREE_IMAGPART (expr
)))
2227 if (TREE_CODE (expr
) != INTEGER_CST
)
2230 return wi::popcount (expr
) == 1;
2233 /* Return 1 if EXPR is an integer constant other than zero or a
2234 complex constant other than zero. */
2237 integer_nonzerop (const_tree expr
)
2241 return ((TREE_CODE (expr
) == INTEGER_CST
2242 && !wi::eq_p (expr
, 0))
2243 || (TREE_CODE (expr
) == COMPLEX_CST
2244 && (integer_nonzerop (TREE_REALPART (expr
))
2245 || integer_nonzerop (TREE_IMAGPART (expr
)))));
2248 /* Return 1 if EXPR is the fixed-point constant zero. */
2251 fixed_zerop (const_tree expr
)
2253 return (TREE_CODE (expr
) == FIXED_CST
2254 && TREE_FIXED_CST (expr
).data
.is_zero ());
2257 /* Return the power of two represented by a tree node known to be a
2261 tree_log2 (const_tree expr
)
2265 if (TREE_CODE (expr
) == COMPLEX_CST
)
2266 return tree_log2 (TREE_REALPART (expr
));
2268 return wi::exact_log2 (expr
);
2271 /* Similar, but return the largest integer Y such that 2 ** Y is less
2272 than or equal to EXPR. */
2275 tree_floor_log2 (const_tree expr
)
2279 if (TREE_CODE (expr
) == COMPLEX_CST
)
2280 return tree_log2 (TREE_REALPART (expr
));
2282 return wi::floor_log2 (expr
);
2285 /* Return number of known trailing zero bits in EXPR, or, if the value of
2286 EXPR is known to be zero, the precision of it's type. */
2289 tree_ctz (const_tree expr
)
2291 if (!INTEGRAL_TYPE_P (TREE_TYPE (expr
))
2292 && !POINTER_TYPE_P (TREE_TYPE (expr
)))
2295 unsigned int ret1
, ret2
, prec
= TYPE_PRECISION (TREE_TYPE (expr
));
2296 switch (TREE_CODE (expr
))
2299 ret1
= wi::ctz (expr
);
2300 return MIN (ret1
, prec
);
2302 ret1
= wi::ctz (get_nonzero_bits (expr
));
2303 return MIN (ret1
, prec
);
2310 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2313 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2314 return MIN (ret1
, ret2
);
2315 case POINTER_PLUS_EXPR
:
2316 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2317 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2318 /* Second operand is sizetype, which could be in theory
2319 wider than pointer's precision. Make sure we never
2320 return more than prec. */
2321 ret2
= MIN (ret2
, prec
);
2322 return MIN (ret1
, ret2
);
2324 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2325 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2326 return MAX (ret1
, ret2
);
2328 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2329 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2330 return MIN (ret1
+ ret2
, prec
);
2332 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2333 if (tree_fits_uhwi_p (TREE_OPERAND (expr
, 1))
2334 && (tree_to_uhwi (TREE_OPERAND (expr
, 1)) < prec
))
2336 ret2
= tree_to_uhwi (TREE_OPERAND (expr
, 1));
2337 return MIN (ret1
+ ret2
, prec
);
2341 if (tree_fits_uhwi_p (TREE_OPERAND (expr
, 1))
2342 && (tree_to_uhwi (TREE_OPERAND (expr
, 1)) < prec
))
2344 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2345 ret2
= tree_to_uhwi (TREE_OPERAND (expr
, 1));
2350 case TRUNC_DIV_EXPR
:
2352 case FLOOR_DIV_EXPR
:
2353 case ROUND_DIV_EXPR
:
2354 case EXACT_DIV_EXPR
:
2355 if (TREE_CODE (TREE_OPERAND (expr
, 1)) == INTEGER_CST
2356 && tree_int_cst_sgn (TREE_OPERAND (expr
, 1)) == 1)
2358 int l
= tree_log2 (TREE_OPERAND (expr
, 1));
2361 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2369 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2370 if (ret1
&& ret1
== TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (expr
, 0))))
2372 return MIN (ret1
, prec
);
2374 return tree_ctz (TREE_OPERAND (expr
, 0));
2376 ret1
= tree_ctz (TREE_OPERAND (expr
, 1));
2379 ret2
= tree_ctz (TREE_OPERAND (expr
, 2));
2380 return MIN (ret1
, ret2
);
2382 return tree_ctz (TREE_OPERAND (expr
, 1));
2384 ret1
= get_pointer_alignment (CONST_CAST_TREE (expr
));
2385 if (ret1
> BITS_PER_UNIT
)
2387 ret1
= ctz_hwi (ret1
/ BITS_PER_UNIT
);
2388 return MIN (ret1
, prec
);
2396 /* Return 1 if EXPR is the real constant zero. Trailing zeroes matter for
2397 decimal float constants, so don't return 1 for them. */
2400 real_zerop (const_tree expr
)
2404 switch (TREE_CODE (expr
))
2407 return REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst0
)
2408 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2410 return real_zerop (TREE_REALPART (expr
))
2411 && real_zerop (TREE_IMAGPART (expr
));
2415 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2416 if (!real_zerop (VECTOR_CST_ELT (expr
, i
)))
2425 /* Return 1 if EXPR is the real constant one in real or complex form.
2426 Trailing zeroes matter for decimal float constants, so don't return
2430 real_onep (const_tree expr
)
2434 switch (TREE_CODE (expr
))
2437 return REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst1
)
2438 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2440 return real_onep (TREE_REALPART (expr
))
2441 && real_zerop (TREE_IMAGPART (expr
));
2445 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2446 if (!real_onep (VECTOR_CST_ELT (expr
, i
)))
2455 /* Return 1 if EXPR is the real constant minus one. Trailing zeroes
2456 matter for decimal float constants, so don't return 1 for them. */
2459 real_minus_onep (const_tree expr
)
2463 switch (TREE_CODE (expr
))
2466 return REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconstm1
)
2467 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2469 return real_minus_onep (TREE_REALPART (expr
))
2470 && real_zerop (TREE_IMAGPART (expr
));
2474 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2475 if (!real_minus_onep (VECTOR_CST_ELT (expr
, i
)))
2484 /* Nonzero if EXP is a constant or a cast of a constant. */
2487 really_constant_p (const_tree exp
)
2489 /* This is not quite the same as STRIP_NOPS. It does more. */
2490 while (CONVERT_EXPR_P (exp
)
2491 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
2492 exp
= TREE_OPERAND (exp
, 0);
2493 return TREE_CONSTANT (exp
);
2496 /* Return first list element whose TREE_VALUE is ELEM.
2497 Return 0 if ELEM is not in LIST. */
2500 value_member (tree elem
, tree list
)
2504 if (elem
== TREE_VALUE (list
))
2506 list
= TREE_CHAIN (list
);
2511 /* Return first list element whose TREE_PURPOSE is ELEM.
2512 Return 0 if ELEM is not in LIST. */
2515 purpose_member (const_tree elem
, tree list
)
2519 if (elem
== TREE_PURPOSE (list
))
2521 list
= TREE_CHAIN (list
);
2526 /* Return true if ELEM is in V. */
2529 vec_member (const_tree elem
, vec
<tree
, va_gc
> *v
)
2533 FOR_EACH_VEC_SAFE_ELT (v
, ix
, t
)
2539 /* Returns element number IDX (zero-origin) of chain CHAIN, or
2543 chain_index (int idx
, tree chain
)
2545 for (; chain
&& idx
> 0; --idx
)
2546 chain
= TREE_CHAIN (chain
);
2550 /* Return nonzero if ELEM is part of the chain CHAIN. */
2553 chain_member (const_tree elem
, const_tree chain
)
2559 chain
= DECL_CHAIN (chain
);
2565 /* Return the length of a chain of nodes chained through TREE_CHAIN.
2566 We expect a null pointer to mark the end of the chain.
2567 This is the Lisp primitive `length'. */
2570 list_length (const_tree t
)
2573 #ifdef ENABLE_TREE_CHECKING
2581 #ifdef ENABLE_TREE_CHECKING
2584 gcc_assert (p
!= q
);
2592 /* Returns the first FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
2593 UNION_TYPE TYPE, or NULL_TREE if none. */
2596 first_field (const_tree type
)
2598 tree t
= TYPE_FIELDS (type
);
2599 while (t
&& TREE_CODE (t
) != FIELD_DECL
)
2604 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
2605 by modifying the last node in chain 1 to point to chain 2.
2606 This is the Lisp primitive `nconc'. */
2609 chainon (tree op1
, tree op2
)
2618 for (t1
= op1
; TREE_CHAIN (t1
); t1
= TREE_CHAIN (t1
))
2620 TREE_CHAIN (t1
) = op2
;
2622 #ifdef ENABLE_TREE_CHECKING
2625 for (t2
= op2
; t2
; t2
= TREE_CHAIN (t2
))
2626 gcc_assert (t2
!= t1
);
2633 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
2636 tree_last (tree chain
)
2640 while ((next
= TREE_CHAIN (chain
)))
2645 /* Reverse the order of elements in the chain T,
2646 and return the new head of the chain (old last element). */
2651 tree prev
= 0, decl
, next
;
2652 for (decl
= t
; decl
; decl
= next
)
2654 /* We shouldn't be using this function to reverse BLOCK chains; we
2655 have blocks_nreverse for that. */
2656 gcc_checking_assert (TREE_CODE (decl
) != BLOCK
);
2657 next
= TREE_CHAIN (decl
);
2658 TREE_CHAIN (decl
) = prev
;
2664 /* Return a newly created TREE_LIST node whose
2665 purpose and value fields are PARM and VALUE. */
2668 build_tree_list_stat (tree parm
, tree value MEM_STAT_DECL
)
2670 tree t
= make_node_stat (TREE_LIST PASS_MEM_STAT
);
2671 TREE_PURPOSE (t
) = parm
;
2672 TREE_VALUE (t
) = value
;
2676 /* Build a chain of TREE_LIST nodes from a vector. */
2679 build_tree_list_vec_stat (const vec
<tree
, va_gc
> *vec MEM_STAT_DECL
)
2681 tree ret
= NULL_TREE
;
2685 FOR_EACH_VEC_SAFE_ELT (vec
, i
, t
)
2687 *pp
= build_tree_list_stat (NULL
, t PASS_MEM_STAT
);
2688 pp
= &TREE_CHAIN (*pp
);
2693 /* Return a newly created TREE_LIST node whose
2694 purpose and value fields are PURPOSE and VALUE
2695 and whose TREE_CHAIN is CHAIN. */
2698 tree_cons_stat (tree purpose
, tree value
, tree chain MEM_STAT_DECL
)
2702 node
= ggc_alloc_tree_node_stat (sizeof (struct tree_list
) PASS_MEM_STAT
);
2703 memset (node
, 0, sizeof (struct tree_common
));
2705 record_node_allocation_statistics (TREE_LIST
, sizeof (struct tree_list
));
2707 TREE_SET_CODE (node
, TREE_LIST
);
2708 TREE_CHAIN (node
) = chain
;
2709 TREE_PURPOSE (node
) = purpose
;
2710 TREE_VALUE (node
) = value
;
2714 /* Return the values of the elements of a CONSTRUCTOR as a vector of
2718 ctor_to_vec (tree ctor
)
2720 vec
<tree
, va_gc
> *vec
;
2721 vec_alloc (vec
, CONSTRUCTOR_NELTS (ctor
));
2725 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), ix
, val
)
2726 vec
->quick_push (val
);
2731 /* Return the size nominally occupied by an object of type TYPE
2732 when it resides in memory. The value is measured in units of bytes,
2733 and its data type is that normally used for type sizes
2734 (which is the first type created by make_signed_type or
2735 make_unsigned_type). */
2738 size_in_bytes (const_tree type
)
2742 if (type
== error_mark_node
)
2743 return integer_zero_node
;
2745 type
= TYPE_MAIN_VARIANT (type
);
2746 t
= TYPE_SIZE_UNIT (type
);
2750 lang_hooks
.types
.incomplete_type_error (NULL_TREE
, type
);
2751 return size_zero_node
;
2757 /* Return the size of TYPE (in bytes) as a wide integer
2758 or return -1 if the size can vary or is larger than an integer. */
2761 int_size_in_bytes (const_tree type
)
2765 if (type
== error_mark_node
)
2768 type
= TYPE_MAIN_VARIANT (type
);
2769 t
= TYPE_SIZE_UNIT (type
);
2771 if (t
&& tree_fits_uhwi_p (t
))
2772 return TREE_INT_CST_LOW (t
);
2777 /* Return the maximum size of TYPE (in bytes) as a wide integer
2778 or return -1 if the size can vary or is larger than an integer. */
2781 max_int_size_in_bytes (const_tree type
)
2783 HOST_WIDE_INT size
= -1;
2786 /* If this is an array type, check for a possible MAX_SIZE attached. */
2788 if (TREE_CODE (type
) == ARRAY_TYPE
)
2790 size_tree
= TYPE_ARRAY_MAX_SIZE (type
);
2792 if (size_tree
&& tree_fits_uhwi_p (size_tree
))
2793 size
= tree_to_uhwi (size_tree
);
2796 /* If we still haven't been able to get a size, see if the language
2797 can compute a maximum size. */
2801 size_tree
= lang_hooks
.types
.max_size (type
);
2803 if (size_tree
&& tree_fits_uhwi_p (size_tree
))
2804 size
= tree_to_uhwi (size_tree
);
2810 /* Return the bit position of FIELD, in bits from the start of the record.
2811 This is a tree of type bitsizetype. */
2814 bit_position (const_tree field
)
2816 return bit_from_pos (DECL_FIELD_OFFSET (field
),
2817 DECL_FIELD_BIT_OFFSET (field
));
2820 /* Likewise, but return as an integer. It must be representable in
2821 that way (since it could be a signed value, we don't have the
2822 option of returning -1 like int_size_in_byte can. */
2825 int_bit_position (const_tree field
)
2827 return tree_to_shwi (bit_position (field
));
2830 /* Return the byte position of FIELD, in bytes from the start of the record.
2831 This is a tree of type sizetype. */
2834 byte_position (const_tree field
)
2836 return byte_from_pos (DECL_FIELD_OFFSET (field
),
2837 DECL_FIELD_BIT_OFFSET (field
));
2840 /* Likewise, but return as an integer. It must be representable in
2841 that way (since it could be a signed value, we don't have the
2842 option of returning -1 like int_size_in_byte can. */
2845 int_byte_position (const_tree field
)
2847 return tree_to_shwi (byte_position (field
));
2850 /* Return the strictest alignment, in bits, that T is known to have. */
2853 expr_align (const_tree t
)
2855 unsigned int align0
, align1
;
2857 switch (TREE_CODE (t
))
2859 CASE_CONVERT
: case NON_LVALUE_EXPR
:
2860 /* If we have conversions, we know that the alignment of the
2861 object must meet each of the alignments of the types. */
2862 align0
= expr_align (TREE_OPERAND (t
, 0));
2863 align1
= TYPE_ALIGN (TREE_TYPE (t
));
2864 return MAX (align0
, align1
);
2866 case SAVE_EXPR
: case COMPOUND_EXPR
: case MODIFY_EXPR
:
2867 case INIT_EXPR
: case TARGET_EXPR
: case WITH_CLEANUP_EXPR
:
2868 case CLEANUP_POINT_EXPR
:
2869 /* These don't change the alignment of an object. */
2870 return expr_align (TREE_OPERAND (t
, 0));
2873 /* The best we can do is say that the alignment is the least aligned
2875 align0
= expr_align (TREE_OPERAND (t
, 1));
2876 align1
= expr_align (TREE_OPERAND (t
, 2));
2877 return MIN (align0
, align1
);
2879 /* FIXME: LABEL_DECL and CONST_DECL never have DECL_ALIGN set
2880 meaningfully, it's always 1. */
2881 case LABEL_DECL
: case CONST_DECL
:
2882 case VAR_DECL
: case PARM_DECL
: case RESULT_DECL
:
2884 gcc_assert (DECL_ALIGN (t
) != 0);
2885 return DECL_ALIGN (t
);
2891 /* Otherwise take the alignment from that of the type. */
2892 return TYPE_ALIGN (TREE_TYPE (t
));
2895 /* Return, as a tree node, the number of elements for TYPE (which is an
2896 ARRAY_TYPE) minus one. This counts only elements of the top array. */
2899 array_type_nelts (const_tree type
)
2901 tree index_type
, min
, max
;
2903 /* If they did it with unspecified bounds, then we should have already
2904 given an error about it before we got here. */
2905 if (! TYPE_DOMAIN (type
))
2906 return error_mark_node
;
2908 index_type
= TYPE_DOMAIN (type
);
2909 min
= TYPE_MIN_VALUE (index_type
);
2910 max
= TYPE_MAX_VALUE (index_type
);
2912 /* TYPE_MAX_VALUE may not be set if the array has unknown length. */
2914 return error_mark_node
;
2916 return (integer_zerop (min
)
2918 : fold_build2 (MINUS_EXPR
, TREE_TYPE (max
), max
, min
));
2921 /* If arg is static -- a reference to an object in static storage -- then
2922 return the object. This is not the same as the C meaning of `static'.
2923 If arg isn't static, return NULL. */
2928 switch (TREE_CODE (arg
))
2931 /* Nested functions are static, even though taking their address will
2932 involve a trampoline as we unnest the nested function and create
2933 the trampoline on the tree level. */
2937 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
2938 && ! DECL_THREAD_LOCAL_P (arg
)
2939 && ! DECL_DLLIMPORT_P (arg
)
2943 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
2947 return TREE_STATIC (arg
) ? arg
: NULL
;
2954 /* If the thing being referenced is not a field, then it is
2955 something language specific. */
2956 gcc_assert (TREE_CODE (TREE_OPERAND (arg
, 1)) == FIELD_DECL
);
2958 /* If we are referencing a bitfield, we can't evaluate an
2959 ADDR_EXPR at compile time and so it isn't a constant. */
2960 if (DECL_BIT_FIELD (TREE_OPERAND (arg
, 1)))
2963 return staticp (TREE_OPERAND (arg
, 0));
2969 return TREE_CONSTANT (TREE_OPERAND (arg
, 0)) ? arg
: NULL
;
2972 case ARRAY_RANGE_REF
:
2973 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg
))) == INTEGER_CST
2974 && TREE_CODE (TREE_OPERAND (arg
, 1)) == INTEGER_CST
)
2975 return staticp (TREE_OPERAND (arg
, 0));
2979 case COMPOUND_LITERAL_EXPR
:
2980 return TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (arg
)) ? arg
: NULL
;
2990 /* Return whether OP is a DECL whose address is function-invariant. */
2993 decl_address_invariant_p (const_tree op
)
2995 /* The conditions below are slightly less strict than the one in
2998 switch (TREE_CODE (op
))
3007 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
3008 || DECL_THREAD_LOCAL_P (op
)
3009 || DECL_CONTEXT (op
) == current_function_decl
3010 || decl_function_context (op
) == current_function_decl
)
3015 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
3016 || decl_function_context (op
) == current_function_decl
)
3027 /* Return whether OP is a DECL whose address is interprocedural-invariant. */
3030 decl_address_ip_invariant_p (const_tree op
)
3032 /* The conditions below are slightly less strict than the one in
3035 switch (TREE_CODE (op
))
3043 if (((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
3044 && !DECL_DLLIMPORT_P (op
))
3045 || DECL_THREAD_LOCAL_P (op
))
3050 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
)))
3062 /* Return true if T is function-invariant (internal function, does
3063 not handle arithmetic; that's handled in skip_simple_arithmetic and
3064 tree_invariant_p). */
3066 static bool tree_invariant_p (tree t
);
3069 tree_invariant_p_1 (tree t
)
3073 if (TREE_CONSTANT (t
)
3074 || (TREE_READONLY (t
) && !TREE_SIDE_EFFECTS (t
)))
3077 switch (TREE_CODE (t
))
3083 op
= TREE_OPERAND (t
, 0);
3084 while (handled_component_p (op
))
3086 switch (TREE_CODE (op
))
3089 case ARRAY_RANGE_REF
:
3090 if (!tree_invariant_p (TREE_OPERAND (op
, 1))
3091 || TREE_OPERAND (op
, 2) != NULL_TREE
3092 || TREE_OPERAND (op
, 3) != NULL_TREE
)
3097 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
3103 op
= TREE_OPERAND (op
, 0);
3106 return CONSTANT_CLASS_P (op
) || decl_address_invariant_p (op
);
3115 /* Return true if T is function-invariant. */
3118 tree_invariant_p (tree t
)
3120 tree inner
= skip_simple_arithmetic (t
);
3121 return tree_invariant_p_1 (inner
);
3124 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
3125 Do this to any expression which may be used in more than one place,
3126 but must be evaluated only once.
3128 Normally, expand_expr would reevaluate the expression each time.
3129 Calling save_expr produces something that is evaluated and recorded
3130 the first time expand_expr is called on it. Subsequent calls to
3131 expand_expr just reuse the recorded value.
3133 The call to expand_expr that generates code that actually computes
3134 the value is the first call *at compile time*. Subsequent calls
3135 *at compile time* generate code to use the saved value.
3136 This produces correct result provided that *at run time* control
3137 always flows through the insns made by the first expand_expr
3138 before reaching the other places where the save_expr was evaluated.
3139 You, the caller of save_expr, must make sure this is so.
3141 Constants, and certain read-only nodes, are returned with no
3142 SAVE_EXPR because that is safe. Expressions containing placeholders
3143 are not touched; see tree.def for an explanation of what these
3147 save_expr (tree expr
)
3149 tree t
= fold (expr
);
3152 /* If the tree evaluates to a constant, then we don't want to hide that
3153 fact (i.e. this allows further folding, and direct checks for constants).
3154 However, a read-only object that has side effects cannot be bypassed.
3155 Since it is no problem to reevaluate literals, we just return the
3157 inner
= skip_simple_arithmetic (t
);
3158 if (TREE_CODE (inner
) == ERROR_MARK
)
3161 if (tree_invariant_p_1 (inner
))
3164 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
3165 it means that the size or offset of some field of an object depends on
3166 the value within another field.
3168 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
3169 and some variable since it would then need to be both evaluated once and
3170 evaluated more than once. Front-ends must assure this case cannot
3171 happen by surrounding any such subexpressions in their own SAVE_EXPR
3172 and forcing evaluation at the proper time. */
3173 if (contains_placeholder_p (inner
))
3176 t
= build1 (SAVE_EXPR
, TREE_TYPE (expr
), t
);
3177 SET_EXPR_LOCATION (t
, EXPR_LOCATION (expr
));
3179 /* This expression might be placed ahead of a jump to ensure that the
3180 value was computed on both sides of the jump. So make sure it isn't
3181 eliminated as dead. */
3182 TREE_SIDE_EFFECTS (t
) = 1;
3186 /* Look inside EXPR into any simple arithmetic operations. Return the
3187 outermost non-arithmetic or non-invariant node. */
3190 skip_simple_arithmetic (tree expr
)
3192 /* We don't care about whether this can be used as an lvalue in this
3194 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
3195 expr
= TREE_OPERAND (expr
, 0);
3197 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
3198 a constant, it will be more efficient to not make another SAVE_EXPR since
3199 it will allow better simplification and GCSE will be able to merge the
3200 computations if they actually occur. */
3203 if (UNARY_CLASS_P (expr
))
3204 expr
= TREE_OPERAND (expr
, 0);
3205 else if (BINARY_CLASS_P (expr
))
3207 if (tree_invariant_p (TREE_OPERAND (expr
, 1)))
3208 expr
= TREE_OPERAND (expr
, 0);
3209 else if (tree_invariant_p (TREE_OPERAND (expr
, 0)))
3210 expr
= TREE_OPERAND (expr
, 1);
3221 /* Look inside EXPR into simple arithmetic operations involving constants.
3222 Return the outermost non-arithmetic or non-constant node. */
3225 skip_simple_constant_arithmetic (tree expr
)
3227 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
3228 expr
= TREE_OPERAND (expr
, 0);
3232 if (UNARY_CLASS_P (expr
))
3233 expr
= TREE_OPERAND (expr
, 0);
3234 else if (BINARY_CLASS_P (expr
))
3236 if (TREE_CONSTANT (TREE_OPERAND (expr
, 1)))
3237 expr
= TREE_OPERAND (expr
, 0);
3238 else if (TREE_CONSTANT (TREE_OPERAND (expr
, 0)))
3239 expr
= TREE_OPERAND (expr
, 1);
3250 /* Return which tree structure is used by T. */
3252 enum tree_node_structure_enum
3253 tree_node_structure (const_tree t
)
3255 const enum tree_code code
= TREE_CODE (t
);
3256 return tree_node_structure_for_code (code
);
3259 /* Set various status flags when building a CALL_EXPR object T. */
3262 process_call_operands (tree t
)
3264 bool side_effects
= TREE_SIDE_EFFECTS (t
);
3265 bool read_only
= false;
3266 int i
= call_expr_flags (t
);
3268 /* Calls have side-effects, except those to const or pure functions. */
3269 if ((i
& ECF_LOOPING_CONST_OR_PURE
) || !(i
& (ECF_CONST
| ECF_PURE
)))
3270 side_effects
= true;
3271 /* Propagate TREE_READONLY of arguments for const functions. */
3275 if (!side_effects
|| read_only
)
3276 for (i
= 1; i
< TREE_OPERAND_LENGTH (t
); i
++)
3278 tree op
= TREE_OPERAND (t
, i
);
3279 if (op
&& TREE_SIDE_EFFECTS (op
))
3280 side_effects
= true;
3281 if (op
&& !TREE_READONLY (op
) && !CONSTANT_CLASS_P (op
))
3285 TREE_SIDE_EFFECTS (t
) = side_effects
;
3286 TREE_READONLY (t
) = read_only
;
3289 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
3290 size or offset that depends on a field within a record. */
3293 contains_placeholder_p (const_tree exp
)
3295 enum tree_code code
;
3300 code
= TREE_CODE (exp
);
3301 if (code
== PLACEHOLDER_EXPR
)
3304 switch (TREE_CODE_CLASS (code
))
3307 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
3308 position computations since they will be converted into a
3309 WITH_RECORD_EXPR involving the reference, which will assume
3310 here will be valid. */
3311 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
3313 case tcc_exceptional
:
3314 if (code
== TREE_LIST
)
3315 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp
))
3316 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp
)));
3321 case tcc_comparison
:
3322 case tcc_expression
:
3326 /* Ignoring the first operand isn't quite right, but works best. */
3327 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1));
3330 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
3331 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1))
3332 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 2)));
3335 /* The save_expr function never wraps anything containing
3336 a PLACEHOLDER_EXPR. */
3343 switch (TREE_CODE_LENGTH (code
))
3346 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
3348 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
3349 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1)));
3360 const_call_expr_arg_iterator iter
;
3361 FOR_EACH_CONST_CALL_EXPR_ARG (arg
, iter
, exp
)
3362 if (CONTAINS_PLACEHOLDER_P (arg
))
3376 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
3377 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
3381 type_contains_placeholder_1 (const_tree type
)
3383 /* If the size contains a placeholder or the parent type (component type in
3384 the case of arrays) type involves a placeholder, this type does. */
3385 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type
))
3386 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type
))
3387 || (!POINTER_TYPE_P (type
)
3389 && type_contains_placeholder_p (TREE_TYPE (type
))))
3392 /* Now do type-specific checks. Note that the last part of the check above
3393 greatly limits what we have to do below. */
3394 switch (TREE_CODE (type
))
3402 case REFERENCE_TYPE
:
3411 case FIXED_POINT_TYPE
:
3412 /* Here we just check the bounds. */
3413 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type
))
3414 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type
)));
3417 /* We have already checked the component type above, so just check the
3419 return type_contains_placeholder_p (TYPE_DOMAIN (type
));
3423 case QUAL_UNION_TYPE
:
3427 for (field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
3428 if (TREE_CODE (field
) == FIELD_DECL
3429 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field
))
3430 || (TREE_CODE (type
) == QUAL_UNION_TYPE
3431 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field
)))
3432 || type_contains_placeholder_p (TREE_TYPE (field
))))
3443 /* Wrapper around above function used to cache its result. */
3446 type_contains_placeholder_p (tree type
)
3450 /* If the contains_placeholder_bits field has been initialized,
3451 then we know the answer. */
3452 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) > 0)
3453 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) - 1;
3455 /* Indicate that we've seen this type node, and the answer is false.
3456 This is what we want to return if we run into recursion via fields. */
3457 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = 1;
3459 /* Compute the real value. */
3460 result
= type_contains_placeholder_1 (type
);
3462 /* Store the real value. */
3463 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = result
+ 1;
3468 /* Push tree EXP onto vector QUEUE if it is not already present. */
3471 push_without_duplicates (tree exp
, vec
<tree
> *queue
)
3476 FOR_EACH_VEC_ELT (*queue
, i
, iter
)
3477 if (simple_cst_equal (iter
, exp
) == 1)
3481 queue
->safe_push (exp
);
3484 /* Given a tree EXP, find all occurrences of references to fields
3485 in a PLACEHOLDER_EXPR and place them in vector REFS without
3486 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
3487 we assume here that EXP contains only arithmetic expressions
3488 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
3492 find_placeholder_in_expr (tree exp
, vec
<tree
> *refs
)
3494 enum tree_code code
= TREE_CODE (exp
);
3498 /* We handle TREE_LIST and COMPONENT_REF separately. */
3499 if (code
== TREE_LIST
)
3501 FIND_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), refs
);
3502 FIND_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), refs
);
3504 else if (code
== COMPONENT_REF
)
3506 for (inner
= TREE_OPERAND (exp
, 0);
3507 REFERENCE_CLASS_P (inner
);
3508 inner
= TREE_OPERAND (inner
, 0))
3511 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
)
3512 push_without_duplicates (exp
, refs
);
3514 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), refs
);
3517 switch (TREE_CODE_CLASS (code
))
3522 case tcc_declaration
:
3523 /* Variables allocated to static storage can stay. */
3524 if (!TREE_STATIC (exp
))
3525 push_without_duplicates (exp
, refs
);
3528 case tcc_expression
:
3529 /* This is the pattern built in ada/make_aligning_type. */
3530 if (code
== ADDR_EXPR
3531 && TREE_CODE (TREE_OPERAND (exp
, 0)) == PLACEHOLDER_EXPR
)
3533 push_without_duplicates (exp
, refs
);
3537 /* Fall through... */
3539 case tcc_exceptional
:
3542 case tcc_comparison
:
3544 for (i
= 0; i
< TREE_CODE_LENGTH (code
); i
++)
3545 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
3549 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3550 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
3558 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
3559 return a tree with all occurrences of references to F in a
3560 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
3561 CONST_DECLs. Note that we assume here that EXP contains only
3562 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
3563 occurring only in their argument list. */
3566 substitute_in_expr (tree exp
, tree f
, tree r
)
3568 enum tree_code code
= TREE_CODE (exp
);
3569 tree op0
, op1
, op2
, op3
;
3572 /* We handle TREE_LIST and COMPONENT_REF separately. */
3573 if (code
== TREE_LIST
)
3575 op0
= SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp
), f
, r
);
3576 op1
= SUBSTITUTE_IN_EXPR (TREE_VALUE (exp
), f
, r
);
3577 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
3580 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
3582 else if (code
== COMPONENT_REF
)
3586 /* If this expression is getting a value from a PLACEHOLDER_EXPR
3587 and it is the right field, replace it with R. */
3588 for (inner
= TREE_OPERAND (exp
, 0);
3589 REFERENCE_CLASS_P (inner
);
3590 inner
= TREE_OPERAND (inner
, 0))
3594 op1
= TREE_OPERAND (exp
, 1);
3596 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& op1
== f
)
3599 /* If this expression hasn't been completed let, leave it alone. */
3600 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& !TREE_TYPE (inner
))
3603 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3604 if (op0
== TREE_OPERAND (exp
, 0))
3608 = fold_build3 (COMPONENT_REF
, TREE_TYPE (exp
), op0
, op1
, NULL_TREE
);
3611 switch (TREE_CODE_CLASS (code
))
3616 case tcc_declaration
:
3622 case tcc_expression
:
3626 /* Fall through... */
3628 case tcc_exceptional
:
3631 case tcc_comparison
:
3633 switch (TREE_CODE_LENGTH (code
))
3639 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3640 if (op0
== TREE_OPERAND (exp
, 0))
3643 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
3647 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3648 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3650 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
3653 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
3657 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3658 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3659 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
3661 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3662 && op2
== TREE_OPERAND (exp
, 2))
3665 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
3669 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3670 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3671 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
3672 op3
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 3), f
, r
);
3674 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3675 && op2
== TREE_OPERAND (exp
, 2)
3676 && op3
== TREE_OPERAND (exp
, 3))
3680 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
3692 new_tree
= NULL_TREE
;
3694 /* If we are trying to replace F with a constant, inline back
3695 functions which do nothing else than computing a value from
3696 the arguments they are passed. This makes it possible to
3697 fold partially or entirely the replacement expression. */
3698 if (CONSTANT_CLASS_P (r
) && code
== CALL_EXPR
)
3700 tree t
= maybe_inline_call_in_expr (exp
);
3702 return SUBSTITUTE_IN_EXPR (t
, f
, r
);
3705 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3707 tree op
= TREE_OPERAND (exp
, i
);
3708 tree new_op
= SUBSTITUTE_IN_EXPR (op
, f
, r
);
3712 new_tree
= copy_node (exp
);
3713 TREE_OPERAND (new_tree
, i
) = new_op
;
3719 new_tree
= fold (new_tree
);
3720 if (TREE_CODE (new_tree
) == CALL_EXPR
)
3721 process_call_operands (new_tree
);
3732 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
3734 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
3735 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
3740 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
3741 for it within OBJ, a tree that is an object or a chain of references. */
3744 substitute_placeholder_in_expr (tree exp
, tree obj
)
3746 enum tree_code code
= TREE_CODE (exp
);
3747 tree op0
, op1
, op2
, op3
;
3750 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
3751 in the chain of OBJ. */
3752 if (code
== PLACEHOLDER_EXPR
)
3754 tree need_type
= TYPE_MAIN_VARIANT (TREE_TYPE (exp
));
3757 for (elt
= obj
; elt
!= 0;
3758 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
3759 || TREE_CODE (elt
) == COND_EXPR
)
3760 ? TREE_OPERAND (elt
, 1)
3761 : (REFERENCE_CLASS_P (elt
)
3762 || UNARY_CLASS_P (elt
)
3763 || BINARY_CLASS_P (elt
)
3764 || VL_EXP_CLASS_P (elt
)
3765 || EXPRESSION_CLASS_P (elt
))
3766 ? TREE_OPERAND (elt
, 0) : 0))
3767 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt
)) == need_type
)
3770 for (elt
= obj
; elt
!= 0;
3771 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
3772 || TREE_CODE (elt
) == COND_EXPR
)
3773 ? TREE_OPERAND (elt
, 1)
3774 : (REFERENCE_CLASS_P (elt
)
3775 || UNARY_CLASS_P (elt
)
3776 || BINARY_CLASS_P (elt
)
3777 || VL_EXP_CLASS_P (elt
)
3778 || EXPRESSION_CLASS_P (elt
))
3779 ? TREE_OPERAND (elt
, 0) : 0))
3780 if (POINTER_TYPE_P (TREE_TYPE (elt
))
3781 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt
)))
3783 return fold_build1 (INDIRECT_REF
, need_type
, elt
);
3785 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
3786 survives until RTL generation, there will be an error. */
3790 /* TREE_LIST is special because we need to look at TREE_VALUE
3791 and TREE_CHAIN, not TREE_OPERANDS. */
3792 else if (code
== TREE_LIST
)
3794 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), obj
);
3795 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), obj
);
3796 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
3799 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
3802 switch (TREE_CODE_CLASS (code
))
3805 case tcc_declaration
:
3808 case tcc_exceptional
:
3811 case tcc_comparison
:
3812 case tcc_expression
:
3815 switch (TREE_CODE_LENGTH (code
))
3821 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3822 if (op0
== TREE_OPERAND (exp
, 0))
3825 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
3829 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3830 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
3832 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
3835 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
3839 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3840 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
3841 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
3843 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3844 && op2
== TREE_OPERAND (exp
, 2))
3847 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
3851 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3852 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
3853 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
3854 op3
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 3), obj
);
3856 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3857 && op2
== TREE_OPERAND (exp
, 2)
3858 && op3
== TREE_OPERAND (exp
, 3))
3862 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
3874 new_tree
= NULL_TREE
;
3876 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3878 tree op
= TREE_OPERAND (exp
, i
);
3879 tree new_op
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (op
, obj
);
3883 new_tree
= copy_node (exp
);
3884 TREE_OPERAND (new_tree
, i
) = new_op
;
3890 new_tree
= fold (new_tree
);
3891 if (TREE_CODE (new_tree
) == CALL_EXPR
)
3892 process_call_operands (new_tree
);
3903 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
3905 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
3906 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
3912 /* Subroutine of stabilize_reference; this is called for subtrees of
3913 references. Any expression with side-effects must be put in a SAVE_EXPR
3914 to ensure that it is only evaluated once.
3916 We don't put SAVE_EXPR nodes around everything, because assigning very
3917 simple expressions to temporaries causes us to miss good opportunities
3918 for optimizations. Among other things, the opportunity to fold in the
3919 addition of a constant into an addressing mode often gets lost, e.g.
3920 "y[i+1] += x;". In general, we take the approach that we should not make
3921 an assignment unless we are forced into it - i.e., that any non-side effect
3922 operator should be allowed, and that cse should take care of coalescing
3923 multiple utterances of the same expression should that prove fruitful. */
3926 stabilize_reference_1 (tree e
)
3929 enum tree_code code
= TREE_CODE (e
);
3931 /* We cannot ignore const expressions because it might be a reference
3932 to a const array but whose index contains side-effects. But we can
3933 ignore things that are actual constant or that already have been
3934 handled by this function. */
3936 if (tree_invariant_p (e
))
3939 switch (TREE_CODE_CLASS (code
))
3941 case tcc_exceptional
:
3943 case tcc_declaration
:
3944 case tcc_comparison
:
3946 case tcc_expression
:
3949 /* If the expression has side-effects, then encase it in a SAVE_EXPR
3950 so that it will only be evaluated once. */
3951 /* The reference (r) and comparison (<) classes could be handled as
3952 below, but it is generally faster to only evaluate them once. */
3953 if (TREE_SIDE_EFFECTS (e
))
3954 return save_expr (e
);
3958 /* Constants need no processing. In fact, we should never reach
3963 /* Division is slow and tends to be compiled with jumps,
3964 especially the division by powers of 2 that is often
3965 found inside of an array reference. So do it just once. */
3966 if (code
== TRUNC_DIV_EXPR
|| code
== TRUNC_MOD_EXPR
3967 || code
== FLOOR_DIV_EXPR
|| code
== FLOOR_MOD_EXPR
3968 || code
== CEIL_DIV_EXPR
|| code
== CEIL_MOD_EXPR
3969 || code
== ROUND_DIV_EXPR
|| code
== ROUND_MOD_EXPR
)
3970 return save_expr (e
);
3971 /* Recursively stabilize each operand. */
3972 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)),
3973 stabilize_reference_1 (TREE_OPERAND (e
, 1)));
3977 /* Recursively stabilize each operand. */
3978 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)));
3985 TREE_TYPE (result
) = TREE_TYPE (e
);
3986 TREE_READONLY (result
) = TREE_READONLY (e
);
3987 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (e
);
3988 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (e
);
3993 /* Stabilize a reference so that we can use it any number of times
3994 without causing its operands to be evaluated more than once.
3995 Returns the stabilized reference. This works by means of save_expr,
3996 so see the caveats in the comments about save_expr.
3998 Also allows conversion expressions whose operands are references.
3999 Any other kind of expression is returned unchanged. */
4002 stabilize_reference (tree ref
)
4005 enum tree_code code
= TREE_CODE (ref
);
4012 /* No action is needed in this case. */
4017 case FIX_TRUNC_EXPR
:
4018 result
= build_nt (code
, stabilize_reference (TREE_OPERAND (ref
, 0)));
4022 result
= build_nt (INDIRECT_REF
,
4023 stabilize_reference_1 (TREE_OPERAND (ref
, 0)));
4027 result
= build_nt (COMPONENT_REF
,
4028 stabilize_reference (TREE_OPERAND (ref
, 0)),
4029 TREE_OPERAND (ref
, 1), NULL_TREE
);
4033 result
= build_nt (BIT_FIELD_REF
,
4034 stabilize_reference (TREE_OPERAND (ref
, 0)),
4035 TREE_OPERAND (ref
, 1), TREE_OPERAND (ref
, 2));
4039 result
= build_nt (ARRAY_REF
,
4040 stabilize_reference (TREE_OPERAND (ref
, 0)),
4041 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
4042 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
4045 case ARRAY_RANGE_REF
:
4046 result
= build_nt (ARRAY_RANGE_REF
,
4047 stabilize_reference (TREE_OPERAND (ref
, 0)),
4048 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
4049 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
4053 /* We cannot wrap the first expression in a SAVE_EXPR, as then
4054 it wouldn't be ignored. This matters when dealing with
4056 return stabilize_reference_1 (ref
);
4058 /* If arg isn't a kind of lvalue we recognize, make no change.
4059 Caller should recognize the error for an invalid lvalue. */
4064 return error_mark_node
;
4067 TREE_TYPE (result
) = TREE_TYPE (ref
);
4068 TREE_READONLY (result
) = TREE_READONLY (ref
);
4069 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (ref
);
4070 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (ref
);
4075 /* Low-level constructors for expressions. */
4077 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
4078 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
4081 recompute_tree_invariant_for_addr_expr (tree t
)
4084 bool tc
= true, se
= false;
4086 /* We started out assuming this address is both invariant and constant, but
4087 does not have side effects. Now go down any handled components and see if
4088 any of them involve offsets that are either non-constant or non-invariant.
4089 Also check for side-effects.
4091 ??? Note that this code makes no attempt to deal with the case where
4092 taking the address of something causes a copy due to misalignment. */
4094 #define UPDATE_FLAGS(NODE) \
4095 do { tree _node = (NODE); \
4096 if (_node && !TREE_CONSTANT (_node)) tc = false; \
4097 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
4099 for (node
= TREE_OPERAND (t
, 0); handled_component_p (node
);
4100 node
= TREE_OPERAND (node
, 0))
4102 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
4103 array reference (probably made temporarily by the G++ front end),
4104 so ignore all the operands. */
4105 if ((TREE_CODE (node
) == ARRAY_REF
4106 || TREE_CODE (node
) == ARRAY_RANGE_REF
)
4107 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node
, 0))) == ARRAY_TYPE
)
4109 UPDATE_FLAGS (TREE_OPERAND (node
, 1));
4110 if (TREE_OPERAND (node
, 2))
4111 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
4112 if (TREE_OPERAND (node
, 3))
4113 UPDATE_FLAGS (TREE_OPERAND (node
, 3));
4115 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
4116 FIELD_DECL, apparently. The G++ front end can put something else
4117 there, at least temporarily. */
4118 else if (TREE_CODE (node
) == COMPONENT_REF
4119 && TREE_CODE (TREE_OPERAND (node
, 1)) == FIELD_DECL
)
4121 if (TREE_OPERAND (node
, 2))
4122 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
4126 node
= lang_hooks
.expr_to_decl (node
, &tc
, &se
);
4128 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
4129 the address, since &(*a)->b is a form of addition. If it's a constant, the
4130 address is constant too. If it's a decl, its address is constant if the
4131 decl is static. Everything else is not constant and, furthermore,
4132 taking the address of a volatile variable is not volatile. */
4133 if (TREE_CODE (node
) == INDIRECT_REF
4134 || TREE_CODE (node
) == MEM_REF
)
4135 UPDATE_FLAGS (TREE_OPERAND (node
, 0));
4136 else if (CONSTANT_CLASS_P (node
))
4138 else if (DECL_P (node
))
4139 tc
&= (staticp (node
) != NULL_TREE
);
4143 se
|= TREE_SIDE_EFFECTS (node
);
4147 TREE_CONSTANT (t
) = tc
;
4148 TREE_SIDE_EFFECTS (t
) = se
;
4152 /* Build an expression of code CODE, data type TYPE, and operands as
4153 specified. Expressions and reference nodes can be created this way.
4154 Constants, decls, types and misc nodes cannot be.
4156 We define 5 non-variadic functions, from 0 to 4 arguments. This is
4157 enough for all extant tree codes. */
4160 build0_stat (enum tree_code code
, tree tt MEM_STAT_DECL
)
4164 gcc_assert (TREE_CODE_LENGTH (code
) == 0);
4166 t
= make_node_stat (code PASS_MEM_STAT
);
4173 build1_stat (enum tree_code code
, tree type
, tree node MEM_STAT_DECL
)
4175 int length
= sizeof (struct tree_exp
);
4178 record_node_allocation_statistics (code
, length
);
4180 gcc_assert (TREE_CODE_LENGTH (code
) == 1);
4182 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
4184 memset (t
, 0, sizeof (struct tree_common
));
4186 TREE_SET_CODE (t
, code
);
4188 TREE_TYPE (t
) = type
;
4189 SET_EXPR_LOCATION (t
, UNKNOWN_LOCATION
);
4190 TREE_OPERAND (t
, 0) = node
;
4191 if (node
&& !TYPE_P (node
))
4193 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (node
);
4194 TREE_READONLY (t
) = TREE_READONLY (node
);
4197 if (TREE_CODE_CLASS (code
) == tcc_statement
)
4198 TREE_SIDE_EFFECTS (t
) = 1;
4202 /* All of these have side-effects, no matter what their
4204 TREE_SIDE_EFFECTS (t
) = 1;
4205 TREE_READONLY (t
) = 0;
4209 /* Whether a dereference is readonly has nothing to do with whether
4210 its operand is readonly. */
4211 TREE_READONLY (t
) = 0;
4216 recompute_tree_invariant_for_addr_expr (t
);
4220 if ((TREE_CODE_CLASS (code
) == tcc_unary
|| code
== VIEW_CONVERT_EXPR
)
4221 && node
&& !TYPE_P (node
)
4222 && TREE_CONSTANT (node
))
4223 TREE_CONSTANT (t
) = 1;
4224 if (TREE_CODE_CLASS (code
) == tcc_reference
4225 && node
&& TREE_THIS_VOLATILE (node
))
4226 TREE_THIS_VOLATILE (t
) = 1;
4233 #define PROCESS_ARG(N) \
4235 TREE_OPERAND (t, N) = arg##N; \
4236 if (arg##N &&!TYPE_P (arg##N)) \
4238 if (TREE_SIDE_EFFECTS (arg##N)) \
4240 if (!TREE_READONLY (arg##N) \
4241 && !CONSTANT_CLASS_P (arg##N)) \
4242 (void) (read_only = 0); \
4243 if (!TREE_CONSTANT (arg##N)) \
4244 (void) (constant = 0); \
4249 build2_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1 MEM_STAT_DECL
)
4251 bool constant
, read_only
, side_effects
;
4254 gcc_assert (TREE_CODE_LENGTH (code
) == 2);
4256 if ((code
== MINUS_EXPR
|| code
== PLUS_EXPR
|| code
== MULT_EXPR
)
4257 && arg0
&& arg1
&& tt
&& POINTER_TYPE_P (tt
)
4258 /* When sizetype precision doesn't match that of pointers
4259 we need to be able to build explicit extensions or truncations
4260 of the offset argument. */
4261 && TYPE_PRECISION (sizetype
) == TYPE_PRECISION (tt
))
4262 gcc_assert (TREE_CODE (arg0
) == INTEGER_CST
4263 && TREE_CODE (arg1
) == INTEGER_CST
);
4265 if (code
== POINTER_PLUS_EXPR
&& arg0
&& arg1
&& tt
)
4266 gcc_assert (POINTER_TYPE_P (tt
) && POINTER_TYPE_P (TREE_TYPE (arg0
))
4267 && ptrofftype_p (TREE_TYPE (arg1
)));
4269 t
= make_node_stat (code PASS_MEM_STAT
);
4272 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
4273 result based on those same flags for the arguments. But if the
4274 arguments aren't really even `tree' expressions, we shouldn't be trying
4277 /* Expressions without side effects may be constant if their
4278 arguments are as well. */
4279 constant
= (TREE_CODE_CLASS (code
) == tcc_comparison
4280 || TREE_CODE_CLASS (code
) == tcc_binary
);
4282 side_effects
= TREE_SIDE_EFFECTS (t
);
4287 TREE_READONLY (t
) = read_only
;
4288 TREE_CONSTANT (t
) = constant
;
4289 TREE_SIDE_EFFECTS (t
) = side_effects
;
4290 TREE_THIS_VOLATILE (t
)
4291 = (TREE_CODE_CLASS (code
) == tcc_reference
4292 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4299 build3_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4300 tree arg2 MEM_STAT_DECL
)
4302 bool constant
, read_only
, side_effects
;
4305 gcc_assert (TREE_CODE_LENGTH (code
) == 3);
4306 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
4308 t
= make_node_stat (code PASS_MEM_STAT
);
4313 /* As a special exception, if COND_EXPR has NULL branches, we
4314 assume that it is a gimple statement and always consider
4315 it to have side effects. */
4316 if (code
== COND_EXPR
4317 && tt
== void_type_node
4318 && arg1
== NULL_TREE
4319 && arg2
== NULL_TREE
)
4320 side_effects
= true;
4322 side_effects
= TREE_SIDE_EFFECTS (t
);
4328 if (code
== COND_EXPR
)
4329 TREE_READONLY (t
) = read_only
;
4331 TREE_SIDE_EFFECTS (t
) = side_effects
;
4332 TREE_THIS_VOLATILE (t
)
4333 = (TREE_CODE_CLASS (code
) == tcc_reference
4334 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4340 build4_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4341 tree arg2
, tree arg3 MEM_STAT_DECL
)
4343 bool constant
, read_only
, side_effects
;
4346 gcc_assert (TREE_CODE_LENGTH (code
) == 4);
4348 t
= make_node_stat (code PASS_MEM_STAT
);
4351 side_effects
= TREE_SIDE_EFFECTS (t
);
4358 TREE_SIDE_EFFECTS (t
) = side_effects
;
4359 TREE_THIS_VOLATILE (t
)
4360 = (TREE_CODE_CLASS (code
) == tcc_reference
4361 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4367 build5_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4368 tree arg2
, tree arg3
, tree arg4 MEM_STAT_DECL
)
4370 bool constant
, read_only
, side_effects
;
4373 gcc_assert (TREE_CODE_LENGTH (code
) == 5);
4375 t
= make_node_stat (code PASS_MEM_STAT
);
4378 side_effects
= TREE_SIDE_EFFECTS (t
);
4386 TREE_SIDE_EFFECTS (t
) = side_effects
;
4387 TREE_THIS_VOLATILE (t
)
4388 = (TREE_CODE_CLASS (code
) == tcc_reference
4389 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4394 /* Build a simple MEM_REF tree with the sematics of a plain INDIRECT_REF
4395 on the pointer PTR. */
4398 build_simple_mem_ref_loc (location_t loc
, tree ptr
)
4400 HOST_WIDE_INT offset
= 0;
4401 tree ptype
= TREE_TYPE (ptr
);
4403 /* For convenience allow addresses that collapse to a simple base
4405 if (TREE_CODE (ptr
) == ADDR_EXPR
4406 && (handled_component_p (TREE_OPERAND (ptr
, 0))
4407 || TREE_CODE (TREE_OPERAND (ptr
, 0)) == MEM_REF
))
4409 ptr
= get_addr_base_and_unit_offset (TREE_OPERAND (ptr
, 0), &offset
);
4411 ptr
= build_fold_addr_expr (ptr
);
4412 gcc_assert (is_gimple_reg (ptr
) || is_gimple_min_invariant (ptr
));
4414 tem
= build2 (MEM_REF
, TREE_TYPE (ptype
),
4415 ptr
, build_int_cst (ptype
, offset
));
4416 SET_EXPR_LOCATION (tem
, loc
);
4420 /* Return the constant offset of a MEM_REF or TARGET_MEM_REF tree T. */
4423 mem_ref_offset (const_tree t
)
4425 return offset_int::from (TREE_OPERAND (t
, 1), SIGNED
);
4428 /* Return an invariant ADDR_EXPR of type TYPE taking the address of BASE
4429 offsetted by OFFSET units. */
4432 build_invariant_address (tree type
, tree base
, HOST_WIDE_INT offset
)
4434 tree ref
= fold_build2 (MEM_REF
, TREE_TYPE (type
),
4435 build_fold_addr_expr (base
),
4436 build_int_cst (ptr_type_node
, offset
));
4437 tree addr
= build1 (ADDR_EXPR
, type
, ref
);
4438 recompute_tree_invariant_for_addr_expr (addr
);
4442 /* Similar except don't specify the TREE_TYPE
4443 and leave the TREE_SIDE_EFFECTS as 0.
4444 It is permissible for arguments to be null,
4445 or even garbage if their values do not matter. */
4448 build_nt (enum tree_code code
, ...)
4455 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
4459 t
= make_node (code
);
4460 length
= TREE_CODE_LENGTH (code
);
4462 for (i
= 0; i
< length
; i
++)
4463 TREE_OPERAND (t
, i
) = va_arg (p
, tree
);
4469 /* Similar to build_nt, but for creating a CALL_EXPR object with a
4473 build_nt_call_vec (tree fn
, vec
<tree
, va_gc
> *args
)
4478 ret
= build_vl_exp (CALL_EXPR
, vec_safe_length (args
) + 3);
4479 CALL_EXPR_FN (ret
) = fn
;
4480 CALL_EXPR_STATIC_CHAIN (ret
) = NULL_TREE
;
4481 FOR_EACH_VEC_SAFE_ELT (args
, ix
, t
)
4482 CALL_EXPR_ARG (ret
, ix
) = t
;
4486 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
4487 We do NOT enter this node in any sort of symbol table.
4489 LOC is the location of the decl.
4491 layout_decl is used to set up the decl's storage layout.
4492 Other slots are initialized to 0 or null pointers. */
4495 build_decl_stat (location_t loc
, enum tree_code code
, tree name
,
4496 tree type MEM_STAT_DECL
)
4500 t
= make_node_stat (code PASS_MEM_STAT
);
4501 DECL_SOURCE_LOCATION (t
) = loc
;
4503 /* if (type == error_mark_node)
4504 type = integer_type_node; */
4505 /* That is not done, deliberately, so that having error_mark_node
4506 as the type can suppress useless errors in the use of this variable. */
4508 DECL_NAME (t
) = name
;
4509 TREE_TYPE (t
) = type
;
4511 if (code
== VAR_DECL
|| code
== PARM_DECL
|| code
== RESULT_DECL
)
4517 /* Builds and returns function declaration with NAME and TYPE. */
4520 build_fn_decl (const char *name
, tree type
)
4522 tree id
= get_identifier (name
);
4523 tree decl
= build_decl (input_location
, FUNCTION_DECL
, id
, type
);
4525 DECL_EXTERNAL (decl
) = 1;
4526 TREE_PUBLIC (decl
) = 1;
4527 DECL_ARTIFICIAL (decl
) = 1;
4528 TREE_NOTHROW (decl
) = 1;
4533 vec
<tree
, va_gc
> *all_translation_units
;
4535 /* Builds a new translation-unit decl with name NAME, queues it in the
4536 global list of translation-unit decls and returns it. */
4539 build_translation_unit_decl (tree name
)
4541 tree tu
= build_decl (UNKNOWN_LOCATION
, TRANSLATION_UNIT_DECL
,
4543 TRANSLATION_UNIT_LANGUAGE (tu
) = lang_hooks
.name
;
4544 vec_safe_push (all_translation_units
, tu
);
4549 /* BLOCK nodes are used to represent the structure of binding contours
4550 and declarations, once those contours have been exited and their contents
4551 compiled. This information is used for outputting debugging info. */
4554 build_block (tree vars
, tree subblocks
, tree supercontext
, tree chain
)
4556 tree block
= make_node (BLOCK
);
4558 BLOCK_VARS (block
) = vars
;
4559 BLOCK_SUBBLOCKS (block
) = subblocks
;
4560 BLOCK_SUPERCONTEXT (block
) = supercontext
;
4561 BLOCK_CHAIN (block
) = chain
;
4566 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
4568 LOC is the location to use in tree T. */
4571 protected_set_expr_location (tree t
, location_t loc
)
4573 if (t
&& CAN_HAVE_LOCATION_P (t
))
4574 SET_EXPR_LOCATION (t
, loc
);
4577 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
4581 build_decl_attribute_variant (tree ddecl
, tree attribute
)
4583 DECL_ATTRIBUTES (ddecl
) = attribute
;
4587 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4588 is ATTRIBUTE and its qualifiers are QUALS.
4590 Record such modified types already made so we don't make duplicates. */
4593 build_type_attribute_qual_variant (tree ttype
, tree attribute
, int quals
)
4595 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype
), attribute
))
4597 inchash::hash hstate
;
4601 enum tree_code code
= TREE_CODE (ttype
);
4603 /* Building a distinct copy of a tagged type is inappropriate; it
4604 causes breakage in code that expects there to be a one-to-one
4605 relationship between a struct and its fields.
4606 build_duplicate_type is another solution (as used in
4607 handle_transparent_union_attribute), but that doesn't play well
4608 with the stronger C++ type identity model. */
4609 if (TREE_CODE (ttype
) == RECORD_TYPE
4610 || TREE_CODE (ttype
) == UNION_TYPE
4611 || TREE_CODE (ttype
) == QUAL_UNION_TYPE
4612 || TREE_CODE (ttype
) == ENUMERAL_TYPE
)
4614 warning (OPT_Wattributes
,
4615 "ignoring attributes applied to %qT after definition",
4616 TYPE_MAIN_VARIANT (ttype
));
4617 return build_qualified_type (ttype
, quals
);
4620 ttype
= build_qualified_type (ttype
, TYPE_UNQUALIFIED
);
4621 ntype
= build_distinct_type_copy (ttype
);
4623 TYPE_ATTRIBUTES (ntype
) = attribute
;
4625 hstate
.add_int (code
);
4626 if (TREE_TYPE (ntype
))
4627 hstate
.add_object (TYPE_HASH (TREE_TYPE (ntype
)));
4628 attribute_hash_list (attribute
, hstate
);
4630 switch (TREE_CODE (ntype
))
4633 type_hash_list (TYPE_ARG_TYPES (ntype
), hstate
);
4636 if (TYPE_DOMAIN (ntype
))
4637 hstate
.add_object (TYPE_HASH (TYPE_DOMAIN (ntype
)));
4640 t
= TYPE_MAX_VALUE (ntype
);
4641 for (i
= 0; i
< TREE_INT_CST_NUNITS (t
); i
++)
4642 hstate
.add_object (TREE_INT_CST_ELT (t
, i
));
4645 case FIXED_POINT_TYPE
:
4647 unsigned int precision
= TYPE_PRECISION (ntype
);
4648 hstate
.add_object (precision
);
4655 ntype
= type_hash_canon (hstate
.end(), ntype
);
4657 /* If the target-dependent attributes make NTYPE different from
4658 its canonical type, we will need to use structural equality
4659 checks for this type. */
4660 if (TYPE_STRUCTURAL_EQUALITY_P (ttype
)
4661 || !comp_type_attributes (ntype
, ttype
))
4662 SET_TYPE_STRUCTURAL_EQUALITY (ntype
);
4663 else if (TYPE_CANONICAL (ntype
) == ntype
)
4664 TYPE_CANONICAL (ntype
) = TYPE_CANONICAL (ttype
);
4666 ttype
= build_qualified_type (ntype
, quals
);
4668 else if (TYPE_QUALS (ttype
) != quals
)
4669 ttype
= build_qualified_type (ttype
, quals
);
4674 /* Check if "omp declare simd" attribute arguments, CLAUSES1 and CLAUSES2, are
4678 omp_declare_simd_clauses_equal (tree clauses1
, tree clauses2
)
4681 for (cl1
= clauses1
, cl2
= clauses2
;
4683 cl1
= OMP_CLAUSE_CHAIN (cl1
), cl2
= OMP_CLAUSE_CHAIN (cl2
))
4685 if (OMP_CLAUSE_CODE (cl1
) != OMP_CLAUSE_CODE (cl2
))
4687 if (OMP_CLAUSE_CODE (cl1
) != OMP_CLAUSE_SIMDLEN
)
4689 if (simple_cst_equal (OMP_CLAUSE_DECL (cl1
),
4690 OMP_CLAUSE_DECL (cl2
)) != 1)
4693 switch (OMP_CLAUSE_CODE (cl1
))
4695 case OMP_CLAUSE_ALIGNED
:
4696 if (simple_cst_equal (OMP_CLAUSE_ALIGNED_ALIGNMENT (cl1
),
4697 OMP_CLAUSE_ALIGNED_ALIGNMENT (cl2
)) != 1)
4700 case OMP_CLAUSE_LINEAR
:
4701 if (simple_cst_equal (OMP_CLAUSE_LINEAR_STEP (cl1
),
4702 OMP_CLAUSE_LINEAR_STEP (cl2
)) != 1)
4705 case OMP_CLAUSE_SIMDLEN
:
4706 if (simple_cst_equal (OMP_CLAUSE_SIMDLEN_EXPR (cl1
),
4707 OMP_CLAUSE_SIMDLEN_EXPR (cl2
)) != 1)
4716 /* Compare two constructor-element-type constants. Return 1 if the lists
4717 are known to be equal; otherwise return 0. */
4720 simple_cst_list_equal (const_tree l1
, const_tree l2
)
4722 while (l1
!= NULL_TREE
&& l2
!= NULL_TREE
)
4724 if (simple_cst_equal (TREE_VALUE (l1
), TREE_VALUE (l2
)) != 1)
4727 l1
= TREE_CHAIN (l1
);
4728 l2
= TREE_CHAIN (l2
);
4734 /* Compare two attributes for their value identity. Return true if the
4735 attribute values are known to be equal; otherwise return false.
4739 attribute_value_equal (const_tree attr1
, const_tree attr2
)
4741 if (TREE_VALUE (attr1
) == TREE_VALUE (attr2
))
4744 if (TREE_VALUE (attr1
) != NULL_TREE
4745 && TREE_CODE (TREE_VALUE (attr1
)) == TREE_LIST
4746 && TREE_VALUE (attr2
) != NULL
4747 && TREE_CODE (TREE_VALUE (attr2
)) == TREE_LIST
)
4748 return (simple_cst_list_equal (TREE_VALUE (attr1
),
4749 TREE_VALUE (attr2
)) == 1);
4751 if ((flag_openmp
|| flag_openmp_simd
)
4752 && TREE_VALUE (attr1
) && TREE_VALUE (attr2
)
4753 && TREE_CODE (TREE_VALUE (attr1
)) == OMP_CLAUSE
4754 && TREE_CODE (TREE_VALUE (attr2
)) == OMP_CLAUSE
)
4755 return omp_declare_simd_clauses_equal (TREE_VALUE (attr1
),
4756 TREE_VALUE (attr2
));
4758 return (simple_cst_equal (TREE_VALUE (attr1
), TREE_VALUE (attr2
)) == 1);
4761 /* Return 0 if the attributes for two types are incompatible, 1 if they
4762 are compatible, and 2 if they are nearly compatible (which causes a
4763 warning to be generated). */
4765 comp_type_attributes (const_tree type1
, const_tree type2
)
4767 const_tree a1
= TYPE_ATTRIBUTES (type1
);
4768 const_tree a2
= TYPE_ATTRIBUTES (type2
);
4773 for (a
= a1
; a
!= NULL_TREE
; a
= TREE_CHAIN (a
))
4775 const struct attribute_spec
*as
;
4778 as
= lookup_attribute_spec (get_attribute_name (a
));
4779 if (!as
|| as
->affects_type_identity
== false)
4782 attr
= lookup_attribute (as
->name
, CONST_CAST_TREE (a2
));
4783 if (!attr
|| !attribute_value_equal (a
, attr
))
4788 for (a
= a2
; a
!= NULL_TREE
; a
= TREE_CHAIN (a
))
4790 const struct attribute_spec
*as
;
4792 as
= lookup_attribute_spec (get_attribute_name (a
));
4793 if (!as
|| as
->affects_type_identity
== false)
4796 if (!lookup_attribute (as
->name
, CONST_CAST_TREE (a1
)))
4798 /* We don't need to compare trees again, as we did this
4799 already in first loop. */
4801 /* All types - affecting identity - are equal, so
4802 there is no need to call target hook for comparison. */
4806 /* As some type combinations - like default calling-convention - might
4807 be compatible, we have to call the target hook to get the final result. */
4808 return targetm
.comp_type_attributes (type1
, type2
);
4811 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4814 Record such modified types already made so we don't make duplicates. */
4817 build_type_attribute_variant (tree ttype
, tree attribute
)
4819 return build_type_attribute_qual_variant (ttype
, attribute
,
4820 TYPE_QUALS (ttype
));
4824 /* Reset the expression *EXPR_P, a size or position.
4826 ??? We could reset all non-constant sizes or positions. But it's cheap
4827 enough to not do so and refrain from adding workarounds to dwarf2out.c.
4829 We need to reset self-referential sizes or positions because they cannot
4830 be gimplified and thus can contain a CALL_EXPR after the gimplification
4831 is finished, which will run afoul of LTO streaming. And they need to be
4832 reset to something essentially dummy but not constant, so as to preserve
4833 the properties of the object they are attached to. */
4836 free_lang_data_in_one_sizepos (tree
*expr_p
)
4838 tree expr
= *expr_p
;
4839 if (CONTAINS_PLACEHOLDER_P (expr
))
4840 *expr_p
= build0 (PLACEHOLDER_EXPR
, TREE_TYPE (expr
));
4844 /* Reset all the fields in a binfo node BINFO. We only keep
4845 BINFO_VTABLE, which is used by gimple_fold_obj_type_ref. */
4848 free_lang_data_in_binfo (tree binfo
)
4853 gcc_assert (TREE_CODE (binfo
) == TREE_BINFO
);
4855 BINFO_VIRTUALS (binfo
) = NULL_TREE
;
4856 BINFO_BASE_ACCESSES (binfo
) = NULL
;
4857 BINFO_INHERITANCE_CHAIN (binfo
) = NULL_TREE
;
4858 BINFO_SUBVTT_INDEX (binfo
) = NULL_TREE
;
4860 FOR_EACH_VEC_ELT (*BINFO_BASE_BINFOS (binfo
), i
, t
)
4861 free_lang_data_in_binfo (t
);
4865 /* Reset all language specific information still present in TYPE. */
4868 free_lang_data_in_type (tree type
)
4870 gcc_assert (TYPE_P (type
));
4872 /* Give the FE a chance to remove its own data first. */
4873 lang_hooks
.free_lang_data (type
);
4875 TREE_LANG_FLAG_0 (type
) = 0;
4876 TREE_LANG_FLAG_1 (type
) = 0;
4877 TREE_LANG_FLAG_2 (type
) = 0;
4878 TREE_LANG_FLAG_3 (type
) = 0;
4879 TREE_LANG_FLAG_4 (type
) = 0;
4880 TREE_LANG_FLAG_5 (type
) = 0;
4881 TREE_LANG_FLAG_6 (type
) = 0;
4883 if (TREE_CODE (type
) == FUNCTION_TYPE
)
4885 /* Remove the const and volatile qualifiers from arguments. The
4886 C++ front end removes them, but the C front end does not,
4887 leading to false ODR violation errors when merging two
4888 instances of the same function signature compiled by
4889 different front ends. */
4892 for (p
= TYPE_ARG_TYPES (type
); p
; p
= TREE_CHAIN (p
))
4894 tree arg_type
= TREE_VALUE (p
);
4896 if (TYPE_READONLY (arg_type
) || TYPE_VOLATILE (arg_type
))
4898 int quals
= TYPE_QUALS (arg_type
)
4900 & ~TYPE_QUAL_VOLATILE
;
4901 TREE_VALUE (p
) = build_qualified_type (arg_type
, quals
);
4902 free_lang_data_in_type (TREE_VALUE (p
));
4907 /* Remove members that are not actually FIELD_DECLs from the field
4908 list of an aggregate. These occur in C++. */
4909 if (RECORD_OR_UNION_TYPE_P (type
))
4913 /* Note that TYPE_FIELDS can be shared across distinct
4914 TREE_TYPEs. Therefore, if the first field of TYPE_FIELDS is
4915 to be removed, we cannot set its TREE_CHAIN to NULL.
4916 Otherwise, we would not be able to find all the other fields
4917 in the other instances of this TREE_TYPE.
4919 This was causing an ICE in testsuite/g++.dg/lto/20080915.C. */
4921 member
= TYPE_FIELDS (type
);
4924 if (TREE_CODE (member
) == FIELD_DECL
4925 || TREE_CODE (member
) == TYPE_DECL
)
4928 TREE_CHAIN (prev
) = member
;
4930 TYPE_FIELDS (type
) = member
;
4934 member
= TREE_CHAIN (member
);
4938 TREE_CHAIN (prev
) = NULL_TREE
;
4940 TYPE_FIELDS (type
) = NULL_TREE
;
4942 TYPE_METHODS (type
) = NULL_TREE
;
4943 if (TYPE_BINFO (type
))
4944 free_lang_data_in_binfo (TYPE_BINFO (type
));
4948 /* For non-aggregate types, clear out the language slot (which
4949 overloads TYPE_BINFO). */
4950 TYPE_LANG_SLOT_1 (type
) = NULL_TREE
;
4952 if (INTEGRAL_TYPE_P (type
)
4953 || SCALAR_FLOAT_TYPE_P (type
)
4954 || FIXED_POINT_TYPE_P (type
))
4956 free_lang_data_in_one_sizepos (&TYPE_MIN_VALUE (type
));
4957 free_lang_data_in_one_sizepos (&TYPE_MAX_VALUE (type
));
4961 free_lang_data_in_one_sizepos (&TYPE_SIZE (type
));
4962 free_lang_data_in_one_sizepos (&TYPE_SIZE_UNIT (type
));
4964 if (TYPE_CONTEXT (type
)
4965 && TREE_CODE (TYPE_CONTEXT (type
)) == BLOCK
)
4967 tree ctx
= TYPE_CONTEXT (type
);
4970 ctx
= BLOCK_SUPERCONTEXT (ctx
);
4972 while (ctx
&& TREE_CODE (ctx
) == BLOCK
);
4973 TYPE_CONTEXT (type
) = ctx
;
4978 /* Return true if DECL may need an assembler name to be set. */
4981 need_assembler_name_p (tree decl
)
4983 /* We use DECL_ASSEMBLER_NAME to hold mangled type names for One Definition Rule
4985 if (flag_lto_odr_type_mering
4986 && TREE_CODE (decl
) == TYPE_DECL
4988 && decl
== TYPE_NAME (TREE_TYPE (decl
))
4989 && !is_lang_specific (TREE_TYPE (decl
))
4990 && !type_in_anonymous_namespace_p (TREE_TYPE (decl
)))
4991 return !DECL_ASSEMBLER_NAME_SET_P (decl
);
4992 /* Only FUNCTION_DECLs and VAR_DECLs are considered. */
4993 if (TREE_CODE (decl
) != FUNCTION_DECL
4994 && TREE_CODE (decl
) != VAR_DECL
)
4997 /* If DECL already has its assembler name set, it does not need a
4999 if (!HAS_DECL_ASSEMBLER_NAME_P (decl
)
5000 || DECL_ASSEMBLER_NAME_SET_P (decl
))
5003 /* Abstract decls do not need an assembler name. */
5004 if (DECL_ABSTRACT (decl
))
5007 /* For VAR_DECLs, only static, public and external symbols need an
5009 if (TREE_CODE (decl
) == VAR_DECL
5010 && !TREE_STATIC (decl
)
5011 && !TREE_PUBLIC (decl
)
5012 && !DECL_EXTERNAL (decl
))
5015 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5017 /* Do not set assembler name on builtins. Allow RTL expansion to
5018 decide whether to expand inline or via a regular call. */
5019 if (DECL_BUILT_IN (decl
)
5020 && DECL_BUILT_IN_CLASS (decl
) != BUILT_IN_FRONTEND
)
5023 /* Functions represented in the callgraph need an assembler name. */
5024 if (cgraph_node::get (decl
) != NULL
)
5027 /* Unused and not public functions don't need an assembler name. */
5028 if (!TREE_USED (decl
) && !TREE_PUBLIC (decl
))
5036 /* Reset all language specific information still present in symbol
5040 free_lang_data_in_decl (tree decl
)
5042 gcc_assert (DECL_P (decl
));
5044 /* Give the FE a chance to remove its own data first. */
5045 lang_hooks
.free_lang_data (decl
);
5047 TREE_LANG_FLAG_0 (decl
) = 0;
5048 TREE_LANG_FLAG_1 (decl
) = 0;
5049 TREE_LANG_FLAG_2 (decl
) = 0;
5050 TREE_LANG_FLAG_3 (decl
) = 0;
5051 TREE_LANG_FLAG_4 (decl
) = 0;
5052 TREE_LANG_FLAG_5 (decl
) = 0;
5053 TREE_LANG_FLAG_6 (decl
) = 0;
5055 free_lang_data_in_one_sizepos (&DECL_SIZE (decl
));
5056 free_lang_data_in_one_sizepos (&DECL_SIZE_UNIT (decl
));
5057 if (TREE_CODE (decl
) == FIELD_DECL
)
5059 free_lang_data_in_one_sizepos (&DECL_FIELD_OFFSET (decl
));
5060 if (TREE_CODE (DECL_CONTEXT (decl
)) == QUAL_UNION_TYPE
)
5061 DECL_QUALIFIER (decl
) = NULL_TREE
;
5064 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5066 struct cgraph_node
*node
;
5067 if (!(node
= cgraph_node::get (decl
))
5068 || (!node
->definition
&& !node
->clones
))
5071 node
->release_body ();
5074 release_function_body (decl
);
5075 DECL_ARGUMENTS (decl
) = NULL
;
5076 DECL_RESULT (decl
) = NULL
;
5077 DECL_INITIAL (decl
) = error_mark_node
;
5080 if (gimple_has_body_p (decl
))
5084 /* If DECL has a gimple body, then the context for its
5085 arguments must be DECL. Otherwise, it doesn't really
5086 matter, as we will not be emitting any code for DECL. In
5087 general, there may be other instances of DECL created by
5088 the front end and since PARM_DECLs are generally shared,
5089 their DECL_CONTEXT changes as the replicas of DECL are
5090 created. The only time where DECL_CONTEXT is important
5091 is for the FUNCTION_DECLs that have a gimple body (since
5092 the PARM_DECL will be used in the function's body). */
5093 for (t
= DECL_ARGUMENTS (decl
); t
; t
= TREE_CHAIN (t
))
5094 DECL_CONTEXT (t
) = decl
;
5097 /* DECL_SAVED_TREE holds the GENERIC representation for DECL.
5098 At this point, it is not needed anymore. */
5099 DECL_SAVED_TREE (decl
) = NULL_TREE
;
5101 /* Clear the abstract origin if it refers to a method. Otherwise
5102 dwarf2out.c will ICE as we clear TYPE_METHODS and thus the
5103 origin will not be output correctly. */
5104 if (DECL_ABSTRACT_ORIGIN (decl
)
5105 && DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))
5106 && RECORD_OR_UNION_TYPE_P
5107 (DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))))
5108 DECL_ABSTRACT_ORIGIN (decl
) = NULL_TREE
;
5110 /* Sometimes the C++ frontend doesn't manage to transform a temporary
5111 DECL_VINDEX referring to itself into a vtable slot number as it
5112 should. Happens with functions that are copied and then forgotten
5113 about. Just clear it, it won't matter anymore. */
5114 if (DECL_VINDEX (decl
) && !tree_fits_shwi_p (DECL_VINDEX (decl
)))
5115 DECL_VINDEX (decl
) = NULL_TREE
;
5117 else if (TREE_CODE (decl
) == VAR_DECL
)
5119 if ((DECL_EXTERNAL (decl
)
5120 && (!TREE_STATIC (decl
) || !TREE_READONLY (decl
)))
5121 || (decl_function_context (decl
) && !TREE_STATIC (decl
)))
5122 DECL_INITIAL (decl
) = NULL_TREE
;
5124 else if (TREE_CODE (decl
) == TYPE_DECL
5125 || TREE_CODE (decl
) == FIELD_DECL
)
5126 DECL_INITIAL (decl
) = NULL_TREE
;
5127 else if (TREE_CODE (decl
) == TRANSLATION_UNIT_DECL
5128 && DECL_INITIAL (decl
)
5129 && TREE_CODE (DECL_INITIAL (decl
)) == BLOCK
)
5131 /* Strip builtins from the translation-unit BLOCK. We still have targets
5132 without builtin_decl_explicit support and also builtins are shared
5133 nodes and thus we can't use TREE_CHAIN in multiple lists. */
5134 tree
*nextp
= &BLOCK_VARS (DECL_INITIAL (decl
));
5138 if (TREE_CODE (var
) == FUNCTION_DECL
5139 && DECL_BUILT_IN (var
))
5140 *nextp
= TREE_CHAIN (var
);
5142 nextp
= &TREE_CHAIN (var
);
5148 /* Data used when collecting DECLs and TYPEs for language data removal. */
5150 struct free_lang_data_d
5152 /* Worklist to avoid excessive recursion. */
5155 /* Set of traversed objects. Used to avoid duplicate visits. */
5156 hash_set
<tree
> *pset
;
5158 /* Array of symbols to process with free_lang_data_in_decl. */
5161 /* Array of types to process with free_lang_data_in_type. */
5166 /* Save all language fields needed to generate proper debug information
5167 for DECL. This saves most fields cleared out by free_lang_data_in_decl. */
5170 save_debug_info_for_decl (tree t
)
5172 /*struct saved_debug_info_d *sdi;*/
5174 gcc_assert (debug_info_level
> DINFO_LEVEL_TERSE
&& t
&& DECL_P (t
));
5176 /* FIXME. Partial implementation for saving debug info removed. */
5180 /* Save all language fields needed to generate proper debug information
5181 for TYPE. This saves most fields cleared out by free_lang_data_in_type. */
5184 save_debug_info_for_type (tree t
)
5186 /*struct saved_debug_info_d *sdi;*/
5188 gcc_assert (debug_info_level
> DINFO_LEVEL_TERSE
&& t
&& TYPE_P (t
));
5190 /* FIXME. Partial implementation for saving debug info removed. */
5194 /* Add type or decl T to one of the list of tree nodes that need their
5195 language data removed. The lists are held inside FLD. */
5198 add_tree_to_fld_list (tree t
, struct free_lang_data_d
*fld
)
5202 fld
->decls
.safe_push (t
);
5203 if (debug_info_level
> DINFO_LEVEL_TERSE
)
5204 save_debug_info_for_decl (t
);
5206 else if (TYPE_P (t
))
5208 fld
->types
.safe_push (t
);
5209 if (debug_info_level
> DINFO_LEVEL_TERSE
)
5210 save_debug_info_for_type (t
);
5216 /* Push tree node T into FLD->WORKLIST. */
5219 fld_worklist_push (tree t
, struct free_lang_data_d
*fld
)
5221 if (t
&& !is_lang_specific (t
) && !fld
->pset
->contains (t
))
5222 fld
->worklist
.safe_push ((t
));
5226 /* Operand callback helper for free_lang_data_in_node. *TP is the
5227 subtree operand being considered. */
5230 find_decls_types_r (tree
*tp
, int *ws
, void *data
)
5233 struct free_lang_data_d
*fld
= (struct free_lang_data_d
*) data
;
5235 if (TREE_CODE (t
) == TREE_LIST
)
5238 /* Language specific nodes will be removed, so there is no need
5239 to gather anything under them. */
5240 if (is_lang_specific (t
))
5248 /* Note that walk_tree does not traverse every possible field in
5249 decls, so we have to do our own traversals here. */
5250 add_tree_to_fld_list (t
, fld
);
5252 fld_worklist_push (DECL_NAME (t
), fld
);
5253 fld_worklist_push (DECL_CONTEXT (t
), fld
);
5254 fld_worklist_push (DECL_SIZE (t
), fld
);
5255 fld_worklist_push (DECL_SIZE_UNIT (t
), fld
);
5257 /* We are going to remove everything under DECL_INITIAL for
5258 TYPE_DECLs. No point walking them. */
5259 if (TREE_CODE (t
) != TYPE_DECL
)
5260 fld_worklist_push (DECL_INITIAL (t
), fld
);
5262 fld_worklist_push (DECL_ATTRIBUTES (t
), fld
);
5263 fld_worklist_push (DECL_ABSTRACT_ORIGIN (t
), fld
);
5265 if (TREE_CODE (t
) == FUNCTION_DECL
)
5267 fld_worklist_push (DECL_ARGUMENTS (t
), fld
);
5268 fld_worklist_push (DECL_RESULT (t
), fld
);
5270 else if (TREE_CODE (t
) == TYPE_DECL
)
5272 fld_worklist_push (DECL_ORIGINAL_TYPE (t
), fld
);
5274 else if (TREE_CODE (t
) == FIELD_DECL
)
5276 fld_worklist_push (DECL_FIELD_OFFSET (t
), fld
);
5277 fld_worklist_push (DECL_BIT_FIELD_TYPE (t
), fld
);
5278 fld_worklist_push (DECL_FIELD_BIT_OFFSET (t
), fld
);
5279 fld_worklist_push (DECL_FCONTEXT (t
), fld
);
5282 if ((TREE_CODE (t
) == VAR_DECL
|| TREE_CODE (t
) == PARM_DECL
)
5283 && DECL_HAS_VALUE_EXPR_P (t
))
5284 fld_worklist_push (DECL_VALUE_EXPR (t
), fld
);
5286 if (TREE_CODE (t
) != FIELD_DECL
5287 && TREE_CODE (t
) != TYPE_DECL
)
5288 fld_worklist_push (TREE_CHAIN (t
), fld
);
5291 else if (TYPE_P (t
))
5293 /* Note that walk_tree does not traverse every possible field in
5294 types, so we have to do our own traversals here. */
5295 add_tree_to_fld_list (t
, fld
);
5297 if (!RECORD_OR_UNION_TYPE_P (t
))
5298 fld_worklist_push (TYPE_CACHED_VALUES (t
), fld
);
5299 fld_worklist_push (TYPE_SIZE (t
), fld
);
5300 fld_worklist_push (TYPE_SIZE_UNIT (t
), fld
);
5301 fld_worklist_push (TYPE_ATTRIBUTES (t
), fld
);
5302 fld_worklist_push (TYPE_POINTER_TO (t
), fld
);
5303 fld_worklist_push (TYPE_REFERENCE_TO (t
), fld
);
5304 fld_worklist_push (TYPE_NAME (t
), fld
);
5305 /* Do not walk TYPE_NEXT_PTR_TO or TYPE_NEXT_REF_TO. We do not stream
5306 them and thus do not and want not to reach unused pointer types
5308 if (!POINTER_TYPE_P (t
))
5309 fld_worklist_push (TYPE_MINVAL (t
), fld
);
5310 if (!RECORD_OR_UNION_TYPE_P (t
))
5311 fld_worklist_push (TYPE_MAXVAL (t
), fld
);
5312 fld_worklist_push (TYPE_MAIN_VARIANT (t
), fld
);
5313 /* Do not walk TYPE_NEXT_VARIANT. We do not stream it and thus
5314 do not and want not to reach unused variants this way. */
5315 if (TYPE_CONTEXT (t
))
5317 tree ctx
= TYPE_CONTEXT (t
);
5318 /* We adjust BLOCK TYPE_CONTEXTs to the innermost non-BLOCK one.
5319 So push that instead. */
5320 while (ctx
&& TREE_CODE (ctx
) == BLOCK
)
5321 ctx
= BLOCK_SUPERCONTEXT (ctx
);
5322 fld_worklist_push (ctx
, fld
);
5324 /* Do not walk TYPE_CANONICAL. We do not stream it and thus do not
5325 and want not to reach unused types this way. */
5327 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_BINFO (t
))
5331 FOR_EACH_VEC_ELT (*BINFO_BASE_BINFOS (TYPE_BINFO (t
)), i
, tem
)
5332 fld_worklist_push (TREE_TYPE (tem
), fld
);
5333 tem
= BINFO_VIRTUALS (TYPE_BINFO (t
));
5335 /* The Java FE overloads BINFO_VIRTUALS for its own purpose. */
5336 && TREE_CODE (tem
) == TREE_LIST
)
5339 fld_worklist_push (TREE_VALUE (tem
), fld
);
5340 tem
= TREE_CHAIN (tem
);
5344 if (RECORD_OR_UNION_TYPE_P (t
))
5347 /* Push all TYPE_FIELDS - there can be interleaving interesting
5348 and non-interesting things. */
5349 tem
= TYPE_FIELDS (t
);
5352 if (TREE_CODE (tem
) == FIELD_DECL
5353 || TREE_CODE (tem
) == TYPE_DECL
)
5354 fld_worklist_push (tem
, fld
);
5355 tem
= TREE_CHAIN (tem
);
5359 fld_worklist_push (TYPE_STUB_DECL (t
), fld
);
5362 else if (TREE_CODE (t
) == BLOCK
)
5365 for (tem
= BLOCK_VARS (t
); tem
; tem
= TREE_CHAIN (tem
))
5366 fld_worklist_push (tem
, fld
);
5367 for (tem
= BLOCK_SUBBLOCKS (t
); tem
; tem
= BLOCK_CHAIN (tem
))
5368 fld_worklist_push (tem
, fld
);
5369 fld_worklist_push (BLOCK_ABSTRACT_ORIGIN (t
), fld
);
5372 if (TREE_CODE (t
) != IDENTIFIER_NODE
5373 && CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_TYPED
))
5374 fld_worklist_push (TREE_TYPE (t
), fld
);
5380 /* Find decls and types in T. */
5383 find_decls_types (tree t
, struct free_lang_data_d
*fld
)
5387 if (!fld
->pset
->contains (t
))
5388 walk_tree (&t
, find_decls_types_r
, fld
, fld
->pset
);
5389 if (fld
->worklist
.is_empty ())
5391 t
= fld
->worklist
.pop ();
5395 /* Translate all the types in LIST with the corresponding runtime
5399 get_eh_types_for_runtime (tree list
)
5403 if (list
== NULL_TREE
)
5406 head
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
5408 list
= TREE_CHAIN (list
);
5411 tree n
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
5412 TREE_CHAIN (prev
) = n
;
5413 prev
= TREE_CHAIN (prev
);
5414 list
= TREE_CHAIN (list
);
5421 /* Find decls and types referenced in EH region R and store them in
5422 FLD->DECLS and FLD->TYPES. */
5425 find_decls_types_in_eh_region (eh_region r
, struct free_lang_data_d
*fld
)
5436 /* The types referenced in each catch must first be changed to the
5437 EH types used at runtime. This removes references to FE types
5439 for (c
= r
->u
.eh_try
.first_catch
; c
; c
= c
->next_catch
)
5441 c
->type_list
= get_eh_types_for_runtime (c
->type_list
);
5442 walk_tree (&c
->type_list
, find_decls_types_r
, fld
, fld
->pset
);
5447 case ERT_ALLOWED_EXCEPTIONS
:
5448 r
->u
.allowed
.type_list
5449 = get_eh_types_for_runtime (r
->u
.allowed
.type_list
);
5450 walk_tree (&r
->u
.allowed
.type_list
, find_decls_types_r
, fld
, fld
->pset
);
5453 case ERT_MUST_NOT_THROW
:
5454 walk_tree (&r
->u
.must_not_throw
.failure_decl
,
5455 find_decls_types_r
, fld
, fld
->pset
);
5461 /* Find decls and types referenced in cgraph node N and store them in
5462 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
5463 look for *every* kind of DECL and TYPE node reachable from N,
5464 including those embedded inside types and decls (i.e,, TYPE_DECLs,
5465 NAMESPACE_DECLs, etc). */
5468 find_decls_types_in_node (struct cgraph_node
*n
, struct free_lang_data_d
*fld
)
5471 struct function
*fn
;
5475 find_decls_types (n
->decl
, fld
);
5477 if (!gimple_has_body_p (n
->decl
))
5480 gcc_assert (current_function_decl
== NULL_TREE
&& cfun
== NULL
);
5482 fn
= DECL_STRUCT_FUNCTION (n
->decl
);
5484 /* Traverse locals. */
5485 FOR_EACH_LOCAL_DECL (fn
, ix
, t
)
5486 find_decls_types (t
, fld
);
5488 /* Traverse EH regions in FN. */
5491 FOR_ALL_EH_REGION_FN (r
, fn
)
5492 find_decls_types_in_eh_region (r
, fld
);
5495 /* Traverse every statement in FN. */
5496 FOR_EACH_BB_FN (bb
, fn
)
5498 gimple_stmt_iterator si
;
5501 for (si
= gsi_start_phis (bb
); !gsi_end_p (si
); gsi_next (&si
))
5503 gimple phi
= gsi_stmt (si
);
5505 for (i
= 0; i
< gimple_phi_num_args (phi
); i
++)
5507 tree
*arg_p
= gimple_phi_arg_def_ptr (phi
, i
);
5508 find_decls_types (*arg_p
, fld
);
5512 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
5514 gimple stmt
= gsi_stmt (si
);
5516 if (is_gimple_call (stmt
))
5517 find_decls_types (gimple_call_fntype (stmt
), fld
);
5519 for (i
= 0; i
< gimple_num_ops (stmt
); i
++)
5521 tree arg
= gimple_op (stmt
, i
);
5522 find_decls_types (arg
, fld
);
5529 /* Find decls and types referenced in varpool node N and store them in
5530 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
5531 look for *every* kind of DECL and TYPE node reachable from N,
5532 including those embedded inside types and decls (i.e,, TYPE_DECLs,
5533 NAMESPACE_DECLs, etc). */
5536 find_decls_types_in_var (varpool_node
*v
, struct free_lang_data_d
*fld
)
5538 find_decls_types (v
->decl
, fld
);
5541 /* If T needs an assembler name, have one created for it. */
5544 assign_assembler_name_if_neeeded (tree t
)
5546 if (need_assembler_name_p (t
))
5548 /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit
5549 diagnostics that use input_location to show locus
5550 information. The problem here is that, at this point,
5551 input_location is generally anchored to the end of the file
5552 (since the parser is long gone), so we don't have a good
5553 position to pin it to.
5555 To alleviate this problem, this uses the location of T's
5556 declaration. Examples of this are
5557 testsuite/g++.dg/template/cond2.C and
5558 testsuite/g++.dg/template/pr35240.C. */
5559 location_t saved_location
= input_location
;
5560 input_location
= DECL_SOURCE_LOCATION (t
);
5562 decl_assembler_name (t
);
5564 input_location
= saved_location
;
5569 /* Free language specific information for every operand and expression
5570 in every node of the call graph. This process operates in three stages:
5572 1- Every callgraph node and varpool node is traversed looking for
5573 decls and types embedded in them. This is a more exhaustive
5574 search than that done by find_referenced_vars, because it will
5575 also collect individual fields, decls embedded in types, etc.
5577 2- All the decls found are sent to free_lang_data_in_decl.
5579 3- All the types found are sent to free_lang_data_in_type.
5581 The ordering between decls and types is important because
5582 free_lang_data_in_decl sets assembler names, which includes
5583 mangling. So types cannot be freed up until assembler names have
5587 free_lang_data_in_cgraph (void)
5589 struct cgraph_node
*n
;
5591 struct free_lang_data_d fld
;
5596 /* Initialize sets and arrays to store referenced decls and types. */
5597 fld
.pset
= new hash_set
<tree
>;
5598 fld
.worklist
.create (0);
5599 fld
.decls
.create (100);
5600 fld
.types
.create (100);
5602 /* Find decls and types in the body of every function in the callgraph. */
5603 FOR_EACH_FUNCTION (n
)
5604 find_decls_types_in_node (n
, &fld
);
5606 FOR_EACH_VEC_SAFE_ELT (alias_pairs
, i
, p
)
5607 find_decls_types (p
->decl
, &fld
);
5609 /* Find decls and types in every varpool symbol. */
5610 FOR_EACH_VARIABLE (v
)
5611 find_decls_types_in_var (v
, &fld
);
5613 /* Set the assembler name on every decl found. We need to do this
5614 now because free_lang_data_in_decl will invalidate data needed
5615 for mangling. This breaks mangling on interdependent decls. */
5616 FOR_EACH_VEC_ELT (fld
.decls
, i
, t
)
5617 assign_assembler_name_if_neeeded (t
);
5619 /* Traverse every decl found freeing its language data. */
5620 FOR_EACH_VEC_ELT (fld
.decls
, i
, t
)
5621 free_lang_data_in_decl (t
);
5623 /* Traverse every type found freeing its language data. */
5624 FOR_EACH_VEC_ELT (fld
.types
, i
, t
)
5625 free_lang_data_in_type (t
);
5628 fld
.worklist
.release ();
5629 fld
.decls
.release ();
5630 fld
.types
.release ();
5634 /* Free resources that are used by FE but are not needed once they are done. */
5637 free_lang_data (void)
5641 /* If we are the LTO frontend we have freed lang-specific data already. */
5643 || !flag_generate_lto
)
5646 /* Allocate and assign alias sets to the standard integer types
5647 while the slots are still in the way the frontends generated them. */
5648 for (i
= 0; i
< itk_none
; ++i
)
5649 if (integer_types
[i
])
5650 TYPE_ALIAS_SET (integer_types
[i
]) = get_alias_set (integer_types
[i
]);
5652 /* Traverse the IL resetting language specific information for
5653 operands, expressions, etc. */
5654 free_lang_data_in_cgraph ();
5656 /* Create gimple variants for common types. */
5657 ptrdiff_type_node
= integer_type_node
;
5658 fileptr_type_node
= ptr_type_node
;
5660 /* Reset some langhooks. Do not reset types_compatible_p, it may
5661 still be used indirectly via the get_alias_set langhook. */
5662 lang_hooks
.dwarf_name
= lhd_dwarf_name
;
5663 lang_hooks
.decl_printable_name
= gimple_decl_printable_name
;
5664 /* We do not want the default decl_assembler_name implementation,
5665 rather if we have fixed everything we want a wrapper around it
5666 asserting that all non-local symbols already got their assembler
5667 name and only produce assembler names for local symbols. Or rather
5668 make sure we never call decl_assembler_name on local symbols and
5669 devise a separate, middle-end private scheme for it. */
5671 /* Reset diagnostic machinery. */
5672 tree_diagnostics_defaults (global_dc
);
5680 const pass_data pass_data_ipa_free_lang_data
=
5682 SIMPLE_IPA_PASS
, /* type */
5683 "*free_lang_data", /* name */
5684 OPTGROUP_NONE
, /* optinfo_flags */
5685 TV_IPA_FREE_LANG_DATA
, /* tv_id */
5686 0, /* properties_required */
5687 0, /* properties_provided */
5688 0, /* properties_destroyed */
5689 0, /* todo_flags_start */
5690 0, /* todo_flags_finish */
5693 class pass_ipa_free_lang_data
: public simple_ipa_opt_pass
5696 pass_ipa_free_lang_data (gcc::context
*ctxt
)
5697 : simple_ipa_opt_pass (pass_data_ipa_free_lang_data
, ctxt
)
5700 /* opt_pass methods: */
5701 virtual unsigned int execute (function
*) { return free_lang_data (); }
5703 }; // class pass_ipa_free_lang_data
5707 simple_ipa_opt_pass
*
5708 make_pass_ipa_free_lang_data (gcc::context
*ctxt
)
5710 return new pass_ipa_free_lang_data (ctxt
);
5713 /* The backbone of is_attribute_p(). ATTR_LEN is the string length of
5714 ATTR_NAME. Also used internally by remove_attribute(). */
5716 private_is_attribute_p (const char *attr_name
, size_t attr_len
, const_tree ident
)
5718 size_t ident_len
= IDENTIFIER_LENGTH (ident
);
5720 if (ident_len
== attr_len
)
5722 if (strcmp (attr_name
, IDENTIFIER_POINTER (ident
)) == 0)
5725 else if (ident_len
== attr_len
+ 4)
5727 /* There is the possibility that ATTR is 'text' and IDENT is
5729 const char *p
= IDENTIFIER_POINTER (ident
);
5730 if (p
[0] == '_' && p
[1] == '_'
5731 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
5732 && strncmp (attr_name
, p
+ 2, attr_len
) == 0)
5739 /* The backbone of lookup_attribute(). ATTR_LEN is the string length
5740 of ATTR_NAME, and LIST is not NULL_TREE. */
5742 private_lookup_attribute (const char *attr_name
, size_t attr_len
, tree list
)
5746 size_t ident_len
= IDENTIFIER_LENGTH (get_attribute_name (list
));
5748 if (ident_len
== attr_len
)
5750 if (!strcmp (attr_name
,
5751 IDENTIFIER_POINTER (get_attribute_name (list
))))
5754 /* TODO: If we made sure that attributes were stored in the
5755 canonical form without '__...__' (ie, as in 'text' as opposed
5756 to '__text__') then we could avoid the following case. */
5757 else if (ident_len
== attr_len
+ 4)
5759 const char *p
= IDENTIFIER_POINTER (get_attribute_name (list
));
5760 if (p
[0] == '_' && p
[1] == '_'
5761 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
5762 && strncmp (attr_name
, p
+ 2, attr_len
) == 0)
5765 list
= TREE_CHAIN (list
);
5771 /* Given an attribute name ATTR_NAME and a list of attributes LIST,
5772 return a pointer to the attribute's list first element if the attribute
5773 starts with ATTR_NAME. ATTR_NAME must be in the form 'text' (not
5777 private_lookup_attribute_by_prefix (const char *attr_name
, size_t attr_len
,
5782 size_t ident_len
= IDENTIFIER_LENGTH (get_attribute_name (list
));
5784 if (attr_len
> ident_len
)
5786 list
= TREE_CHAIN (list
);
5790 const char *p
= IDENTIFIER_POINTER (get_attribute_name (list
));
5792 if (strncmp (attr_name
, p
, attr_len
) == 0)
5795 /* TODO: If we made sure that attributes were stored in the
5796 canonical form without '__...__' (ie, as in 'text' as opposed
5797 to '__text__') then we could avoid the following case. */
5798 if (p
[0] == '_' && p
[1] == '_' &&
5799 strncmp (attr_name
, p
+ 2, attr_len
) == 0)
5802 list
= TREE_CHAIN (list
);
5809 /* A variant of lookup_attribute() that can be used with an identifier
5810 as the first argument, and where the identifier can be either
5811 'text' or '__text__'.
5813 Given an attribute ATTR_IDENTIFIER, and a list of attributes LIST,
5814 return a pointer to the attribute's list element if the attribute
5815 is part of the list, or NULL_TREE if not found. If the attribute
5816 appears more than once, this only returns the first occurrence; the
5817 TREE_CHAIN of the return value should be passed back in if further
5818 occurrences are wanted. ATTR_IDENTIFIER must be an identifier but
5819 can be in the form 'text' or '__text__'. */
5821 lookup_ident_attribute (tree attr_identifier
, tree list
)
5823 gcc_checking_assert (TREE_CODE (attr_identifier
) == IDENTIFIER_NODE
);
5827 gcc_checking_assert (TREE_CODE (get_attribute_name (list
))
5828 == IDENTIFIER_NODE
);
5830 /* Identifiers can be compared directly for equality. */
5831 if (attr_identifier
== get_attribute_name (list
))
5834 /* If they are not equal, they may still be one in the form
5835 'text' while the other one is in the form '__text__'. TODO:
5836 If we were storing attributes in normalized 'text' form, then
5837 this could all go away and we could take full advantage of
5838 the fact that we're comparing identifiers. :-) */
5840 size_t attr_len
= IDENTIFIER_LENGTH (attr_identifier
);
5841 size_t ident_len
= IDENTIFIER_LENGTH (get_attribute_name (list
));
5843 if (ident_len
== attr_len
+ 4)
5845 const char *p
= IDENTIFIER_POINTER (get_attribute_name (list
));
5846 const char *q
= IDENTIFIER_POINTER (attr_identifier
);
5847 if (p
[0] == '_' && p
[1] == '_'
5848 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
5849 && strncmp (q
, p
+ 2, attr_len
) == 0)
5852 else if (ident_len
+ 4 == attr_len
)
5854 const char *p
= IDENTIFIER_POINTER (get_attribute_name (list
));
5855 const char *q
= IDENTIFIER_POINTER (attr_identifier
);
5856 if (q
[0] == '_' && q
[1] == '_'
5857 && q
[attr_len
- 2] == '_' && q
[attr_len
- 1] == '_'
5858 && strncmp (q
+ 2, p
, ident_len
) == 0)
5862 list
= TREE_CHAIN (list
);
5868 /* Remove any instances of attribute ATTR_NAME in LIST and return the
5872 remove_attribute (const char *attr_name
, tree list
)
5875 size_t attr_len
= strlen (attr_name
);
5877 gcc_checking_assert (attr_name
[0] != '_');
5879 for (p
= &list
; *p
; )
5882 /* TODO: If we were storing attributes in normalized form, here
5883 we could use a simple strcmp(). */
5884 if (private_is_attribute_p (attr_name
, attr_len
, get_attribute_name (l
)))
5885 *p
= TREE_CHAIN (l
);
5887 p
= &TREE_CHAIN (l
);
5893 /* Return an attribute list that is the union of a1 and a2. */
5896 merge_attributes (tree a1
, tree a2
)
5900 /* Either one unset? Take the set one. */
5902 if ((attributes
= a1
) == 0)
5905 /* One that completely contains the other? Take it. */
5907 else if (a2
!= 0 && ! attribute_list_contained (a1
, a2
))
5909 if (attribute_list_contained (a2
, a1
))
5913 /* Pick the longest list, and hang on the other list. */
5915 if (list_length (a1
) < list_length (a2
))
5916 attributes
= a2
, a2
= a1
;
5918 for (; a2
!= 0; a2
= TREE_CHAIN (a2
))
5921 for (a
= lookup_ident_attribute (get_attribute_name (a2
),
5923 a
!= NULL_TREE
&& !attribute_value_equal (a
, a2
);
5924 a
= lookup_ident_attribute (get_attribute_name (a2
),
5929 a1
= copy_node (a2
);
5930 TREE_CHAIN (a1
) = attributes
;
5939 /* Given types T1 and T2, merge their attributes and return
5943 merge_type_attributes (tree t1
, tree t2
)
5945 return merge_attributes (TYPE_ATTRIBUTES (t1
),
5946 TYPE_ATTRIBUTES (t2
));
5949 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
5953 merge_decl_attributes (tree olddecl
, tree newdecl
)
5955 return merge_attributes (DECL_ATTRIBUTES (olddecl
),
5956 DECL_ATTRIBUTES (newdecl
));
5959 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
5961 /* Specialization of merge_decl_attributes for various Windows targets.
5963 This handles the following situation:
5965 __declspec (dllimport) int foo;
5968 The second instance of `foo' nullifies the dllimport. */
5971 merge_dllimport_decl_attributes (tree old
, tree new_tree
)
5974 int delete_dllimport_p
= 1;
5976 /* What we need to do here is remove from `old' dllimport if it doesn't
5977 appear in `new'. dllimport behaves like extern: if a declaration is
5978 marked dllimport and a definition appears later, then the object
5979 is not dllimport'd. We also remove a `new' dllimport if the old list
5980 contains dllexport: dllexport always overrides dllimport, regardless
5981 of the order of declaration. */
5982 if (!VAR_OR_FUNCTION_DECL_P (new_tree
))
5983 delete_dllimport_p
= 0;
5984 else if (DECL_DLLIMPORT_P (new_tree
)
5985 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (old
)))
5987 DECL_DLLIMPORT_P (new_tree
) = 0;
5988 warning (OPT_Wattributes
, "%q+D already declared with dllexport attribute: "
5989 "dllimport ignored", new_tree
);
5991 else if (DECL_DLLIMPORT_P (old
) && !DECL_DLLIMPORT_P (new_tree
))
5993 /* Warn about overriding a symbol that has already been used, e.g.:
5994 extern int __attribute__ ((dllimport)) foo;
5995 int* bar () {return &foo;}
5998 if (TREE_USED (old
))
6000 warning (0, "%q+D redeclared without dllimport attribute "
6001 "after being referenced with dll linkage", new_tree
);
6002 /* If we have used a variable's address with dllimport linkage,
6003 keep the old DECL_DLLIMPORT_P flag: the ADDR_EXPR using the
6004 decl may already have had TREE_CONSTANT computed.
6005 We still remove the attribute so that assembler code refers
6006 to '&foo rather than '_imp__foo'. */
6007 if (TREE_CODE (old
) == VAR_DECL
&& TREE_ADDRESSABLE (old
))
6008 DECL_DLLIMPORT_P (new_tree
) = 1;
6011 /* Let an inline definition silently override the external reference,
6012 but otherwise warn about attribute inconsistency. */
6013 else if (TREE_CODE (new_tree
) == VAR_DECL
6014 || !DECL_DECLARED_INLINE_P (new_tree
))
6015 warning (OPT_Wattributes
, "%q+D redeclared without dllimport attribute: "
6016 "previous dllimport ignored", new_tree
);
6019 delete_dllimport_p
= 0;
6021 a
= merge_attributes (DECL_ATTRIBUTES (old
), DECL_ATTRIBUTES (new_tree
));
6023 if (delete_dllimport_p
)
6024 a
= remove_attribute ("dllimport", a
);
6029 /* Handle a "dllimport" or "dllexport" attribute; arguments as in
6030 struct attribute_spec.handler. */
6033 handle_dll_attribute (tree
* pnode
, tree name
, tree args
, int flags
,
6039 /* These attributes may apply to structure and union types being created,
6040 but otherwise should pass to the declaration involved. */
6043 if (flags
& ((int) ATTR_FLAG_DECL_NEXT
| (int) ATTR_FLAG_FUNCTION_NEXT
6044 | (int) ATTR_FLAG_ARRAY_NEXT
))
6046 *no_add_attrs
= true;
6047 return tree_cons (name
, args
, NULL_TREE
);
6049 if (TREE_CODE (node
) == RECORD_TYPE
6050 || TREE_CODE (node
) == UNION_TYPE
)
6052 node
= TYPE_NAME (node
);
6058 warning (OPT_Wattributes
, "%qE attribute ignored",
6060 *no_add_attrs
= true;
6065 if (TREE_CODE (node
) != FUNCTION_DECL
6066 && TREE_CODE (node
) != VAR_DECL
6067 && TREE_CODE (node
) != TYPE_DECL
)
6069 *no_add_attrs
= true;
6070 warning (OPT_Wattributes
, "%qE attribute ignored",
6075 if (TREE_CODE (node
) == TYPE_DECL
6076 && TREE_CODE (TREE_TYPE (node
)) != RECORD_TYPE
6077 && TREE_CODE (TREE_TYPE (node
)) != UNION_TYPE
)
6079 *no_add_attrs
= true;
6080 warning (OPT_Wattributes
, "%qE attribute ignored",
6085 is_dllimport
= is_attribute_p ("dllimport", name
);
6087 /* Report error on dllimport ambiguities seen now before they cause
6091 /* Honor any target-specific overrides. */
6092 if (!targetm
.valid_dllimport_attribute_p (node
))
6093 *no_add_attrs
= true;
6095 else if (TREE_CODE (node
) == FUNCTION_DECL
6096 && DECL_DECLARED_INLINE_P (node
))
6098 warning (OPT_Wattributes
, "inline function %q+D declared as "
6099 " dllimport: attribute ignored", node
);
6100 *no_add_attrs
= true;
6102 /* Like MS, treat definition of dllimported variables and
6103 non-inlined functions on declaration as syntax errors. */
6104 else if (TREE_CODE (node
) == FUNCTION_DECL
&& DECL_INITIAL (node
))
6106 error ("function %q+D definition is marked dllimport", node
);
6107 *no_add_attrs
= true;
6110 else if (TREE_CODE (node
) == VAR_DECL
)
6112 if (DECL_INITIAL (node
))
6114 error ("variable %q+D definition is marked dllimport",
6116 *no_add_attrs
= true;
6119 /* `extern' needn't be specified with dllimport.
6120 Specify `extern' now and hope for the best. Sigh. */
6121 DECL_EXTERNAL (node
) = 1;
6122 /* Also, implicitly give dllimport'd variables declared within
6123 a function global scope, unless declared static. */
6124 if (current_function_decl
!= NULL_TREE
&& !TREE_STATIC (node
))
6125 TREE_PUBLIC (node
) = 1;
6128 if (*no_add_attrs
== false)
6129 DECL_DLLIMPORT_P (node
) = 1;
6131 else if (TREE_CODE (node
) == FUNCTION_DECL
6132 && DECL_DECLARED_INLINE_P (node
)
6133 && flag_keep_inline_dllexport
)
6134 /* An exported function, even if inline, must be emitted. */
6135 DECL_EXTERNAL (node
) = 0;
6137 /* Report error if symbol is not accessible at global scope. */
6138 if (!TREE_PUBLIC (node
)
6139 && (TREE_CODE (node
) == VAR_DECL
6140 || TREE_CODE (node
) == FUNCTION_DECL
))
6142 error ("external linkage required for symbol %q+D because of "
6143 "%qE attribute", node
, name
);
6144 *no_add_attrs
= true;
6147 /* A dllexport'd entity must have default visibility so that other
6148 program units (shared libraries or the main executable) can see
6149 it. A dllimport'd entity must have default visibility so that
6150 the linker knows that undefined references within this program
6151 unit can be resolved by the dynamic linker. */
6154 if (DECL_VISIBILITY_SPECIFIED (node
)
6155 && DECL_VISIBILITY (node
) != VISIBILITY_DEFAULT
)
6156 error ("%qE implies default visibility, but %qD has already "
6157 "been declared with a different visibility",
6159 DECL_VISIBILITY (node
) = VISIBILITY_DEFAULT
;
6160 DECL_VISIBILITY_SPECIFIED (node
) = 1;
6166 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
6168 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
6169 of the various TYPE_QUAL values. */
6172 set_type_quals (tree type
, int type_quals
)
6174 TYPE_READONLY (type
) = (type_quals
& TYPE_QUAL_CONST
) != 0;
6175 TYPE_VOLATILE (type
) = (type_quals
& TYPE_QUAL_VOLATILE
) != 0;
6176 TYPE_RESTRICT (type
) = (type_quals
& TYPE_QUAL_RESTRICT
) != 0;
6177 TYPE_ATOMIC (type
) = (type_quals
& TYPE_QUAL_ATOMIC
) != 0;
6178 TYPE_ADDR_SPACE (type
) = DECODE_QUAL_ADDR_SPACE (type_quals
);
6181 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
6184 check_qualified_type (const_tree cand
, const_tree base
, int type_quals
)
6186 return (TYPE_QUALS (cand
) == type_quals
6187 && TYPE_NAME (cand
) == TYPE_NAME (base
)
6188 /* Apparently this is needed for Objective-C. */
6189 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
6190 /* Check alignment. */
6191 && TYPE_ALIGN (cand
) == TYPE_ALIGN (base
)
6192 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
6193 TYPE_ATTRIBUTES (base
)));
6196 /* Returns true iff CAND is equivalent to BASE with ALIGN. */
6199 check_aligned_type (const_tree cand
, const_tree base
, unsigned int align
)
6201 return (TYPE_QUALS (cand
) == TYPE_QUALS (base
)
6202 && TYPE_NAME (cand
) == TYPE_NAME (base
)
6203 /* Apparently this is needed for Objective-C. */
6204 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
6205 /* Check alignment. */
6206 && TYPE_ALIGN (cand
) == align
6207 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
6208 TYPE_ATTRIBUTES (base
)));
6211 /* This function checks to see if TYPE matches the size one of the built-in
6212 atomic types, and returns that core atomic type. */
6215 find_atomic_core_type (tree type
)
6217 tree base_atomic_type
;
6219 /* Only handle complete types. */
6220 if (TYPE_SIZE (type
) == NULL_TREE
)
6223 HOST_WIDE_INT type_size
= tree_to_uhwi (TYPE_SIZE (type
));
6227 base_atomic_type
= atomicQI_type_node
;
6231 base_atomic_type
= atomicHI_type_node
;
6235 base_atomic_type
= atomicSI_type_node
;
6239 base_atomic_type
= atomicDI_type_node
;
6243 base_atomic_type
= atomicTI_type_node
;
6247 base_atomic_type
= NULL_TREE
;
6250 return base_atomic_type
;
6253 /* Return a version of the TYPE, qualified as indicated by the
6254 TYPE_QUALS, if one exists. If no qualified version exists yet,
6255 return NULL_TREE. */
6258 get_qualified_type (tree type
, int type_quals
)
6262 if (TYPE_QUALS (type
) == type_quals
)
6265 /* Search the chain of variants to see if there is already one there just
6266 like the one we need to have. If so, use that existing one. We must
6267 preserve the TYPE_NAME, since there is code that depends on this. */
6268 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
6269 if (check_qualified_type (t
, type
, type_quals
))
6275 /* Like get_qualified_type, but creates the type if it does not
6276 exist. This function never returns NULL_TREE. */
6279 build_qualified_type (tree type
, int type_quals
)
6283 /* See if we already have the appropriate qualified variant. */
6284 t
= get_qualified_type (type
, type_quals
);
6286 /* If not, build it. */
6289 t
= build_variant_type_copy (type
);
6290 set_type_quals (t
, type_quals
);
6292 if (((type_quals
& TYPE_QUAL_ATOMIC
) == TYPE_QUAL_ATOMIC
))
6294 /* See if this object can map to a basic atomic type. */
6295 tree atomic_type
= find_atomic_core_type (type
);
6298 /* Ensure the alignment of this type is compatible with
6299 the required alignment of the atomic type. */
6300 if (TYPE_ALIGN (atomic_type
) > TYPE_ALIGN (t
))
6301 TYPE_ALIGN (t
) = TYPE_ALIGN (atomic_type
);
6305 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
6306 /* Propagate structural equality. */
6307 SET_TYPE_STRUCTURAL_EQUALITY (t
);
6308 else if (TYPE_CANONICAL (type
) != type
)
6309 /* Build the underlying canonical type, since it is different
6312 tree c
= build_qualified_type (TYPE_CANONICAL (type
), type_quals
);
6313 TYPE_CANONICAL (t
) = TYPE_CANONICAL (c
);
6316 /* T is its own canonical type. */
6317 TYPE_CANONICAL (t
) = t
;
6324 /* Create a variant of type T with alignment ALIGN. */
6327 build_aligned_type (tree type
, unsigned int align
)
6331 if (TYPE_PACKED (type
)
6332 || TYPE_ALIGN (type
) == align
)
6335 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
6336 if (check_aligned_type (t
, type
, align
))
6339 t
= build_variant_type_copy (type
);
6340 TYPE_ALIGN (t
) = align
;
6345 /* Create a new distinct copy of TYPE. The new type is made its own
6346 MAIN_VARIANT. If TYPE requires structural equality checks, the
6347 resulting type requires structural equality checks; otherwise, its
6348 TYPE_CANONICAL points to itself. */
6351 build_distinct_type_copy (tree type
)
6353 tree t
= copy_node (type
);
6355 TYPE_POINTER_TO (t
) = 0;
6356 TYPE_REFERENCE_TO (t
) = 0;
6358 /* Set the canonical type either to a new equivalence class, or
6359 propagate the need for structural equality checks. */
6360 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
6361 SET_TYPE_STRUCTURAL_EQUALITY (t
);
6363 TYPE_CANONICAL (t
) = t
;
6365 /* Make it its own variant. */
6366 TYPE_MAIN_VARIANT (t
) = t
;
6367 TYPE_NEXT_VARIANT (t
) = 0;
6369 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
6370 whose TREE_TYPE is not t. This can also happen in the Ada
6371 frontend when using subtypes. */
6376 /* Create a new variant of TYPE, equivalent but distinct. This is so
6377 the caller can modify it. TYPE_CANONICAL for the return type will
6378 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
6379 are considered equal by the language itself (or that both types
6380 require structural equality checks). */
6383 build_variant_type_copy (tree type
)
6385 tree t
, m
= TYPE_MAIN_VARIANT (type
);
6387 t
= build_distinct_type_copy (type
);
6389 /* Since we're building a variant, assume that it is a non-semantic
6390 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
6391 TYPE_CANONICAL (t
) = TYPE_CANONICAL (type
);
6393 /* Add the new type to the chain of variants of TYPE. */
6394 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (m
);
6395 TYPE_NEXT_VARIANT (m
) = t
;
6396 TYPE_MAIN_VARIANT (t
) = m
;
6401 /* Return true if the from tree in both tree maps are equal. */
6404 tree_map_base_eq (const void *va
, const void *vb
)
6406 const struct tree_map_base
*const a
= (const struct tree_map_base
*) va
,
6407 *const b
= (const struct tree_map_base
*) vb
;
6408 return (a
->from
== b
->from
);
6411 /* Hash a from tree in a tree_base_map. */
6414 tree_map_base_hash (const void *item
)
6416 return htab_hash_pointer (((const struct tree_map_base
*)item
)->from
);
6419 /* Return true if this tree map structure is marked for garbage collection
6420 purposes. We simply return true if the from tree is marked, so that this
6421 structure goes away when the from tree goes away. */
6424 tree_map_base_marked_p (const void *p
)
6426 return ggc_marked_p (((const struct tree_map_base
*) p
)->from
);
6429 /* Hash a from tree in a tree_map. */
6432 tree_map_hash (const void *item
)
6434 return (((const struct tree_map
*) item
)->hash
);
6437 /* Hash a from tree in a tree_decl_map. */
6440 tree_decl_map_hash (const void *item
)
6442 return DECL_UID (((const struct tree_decl_map
*) item
)->base
.from
);
6445 /* Return the initialization priority for DECL. */
6448 decl_init_priority_lookup (tree decl
)
6450 symtab_node
*snode
= symtab_node::get (decl
);
6453 return DEFAULT_INIT_PRIORITY
;
6455 snode
->get_init_priority ();
6458 /* Return the finalization priority for DECL. */
6461 decl_fini_priority_lookup (tree decl
)
6463 cgraph_node
*node
= cgraph_node::get (decl
);
6466 return DEFAULT_INIT_PRIORITY
;
6468 node
->get_fini_priority ();
6471 /* Set the initialization priority for DECL to PRIORITY. */
6474 decl_init_priority_insert (tree decl
, priority_type priority
)
6476 struct symtab_node
*snode
;
6478 if (priority
== DEFAULT_INIT_PRIORITY
)
6480 snode
= symtab_node::get (decl
);
6484 else if (TREE_CODE (decl
) == VAR_DECL
)
6485 snode
= varpool_node::get_create (decl
);
6487 snode
= cgraph_node::get_create (decl
);
6488 snode
->set_init_priority (priority
);
6491 /* Set the finalization priority for DECL to PRIORITY. */
6494 decl_fini_priority_insert (tree decl
, priority_type priority
)
6496 struct cgraph_node
*node
;
6498 if (priority
== DEFAULT_INIT_PRIORITY
)
6500 node
= cgraph_node::get (decl
);
6505 node
= cgraph_node::get_create (decl
);
6506 node
->set_fini_priority (priority
);
6509 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
6512 print_debug_expr_statistics (void)
6514 fprintf (stderr
, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
6515 (long) htab_size (debug_expr_for_decl
),
6516 (long) htab_elements (debug_expr_for_decl
),
6517 htab_collisions (debug_expr_for_decl
));
6520 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
6523 print_value_expr_statistics (void)
6525 fprintf (stderr
, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
6526 (long) htab_size (value_expr_for_decl
),
6527 (long) htab_elements (value_expr_for_decl
),
6528 htab_collisions (value_expr_for_decl
));
6531 /* Lookup a debug expression for FROM, and return it if we find one. */
6534 decl_debug_expr_lookup (tree from
)
6536 struct tree_decl_map
*h
, in
;
6537 in
.base
.from
= from
;
6539 h
= (struct tree_decl_map
*)
6540 htab_find_with_hash (debug_expr_for_decl
, &in
, DECL_UID (from
));
6546 /* Insert a mapping FROM->TO in the debug expression hashtable. */
6549 decl_debug_expr_insert (tree from
, tree to
)
6551 struct tree_decl_map
*h
;
6554 h
= ggc_alloc
<tree_decl_map
> ();
6555 h
->base
.from
= from
;
6557 loc
= htab_find_slot_with_hash (debug_expr_for_decl
, h
, DECL_UID (from
),
6559 *(struct tree_decl_map
**) loc
= h
;
6562 /* Lookup a value expression for FROM, and return it if we find one. */
6565 decl_value_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 (value_expr_for_decl
, &in
, DECL_UID (from
));
6577 /* Insert a mapping FROM->TO in the value expression hashtable. */
6580 decl_value_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 (value_expr_for_decl
, h
, DECL_UID (from
),
6590 *(struct tree_decl_map
**) loc
= h
;
6593 /* Lookup a vector of debug arguments for FROM, and return it if we
6597 decl_debug_args_lookup (tree from
)
6599 struct tree_vec_map
*h
, in
;
6601 if (!DECL_HAS_DEBUG_ARGS_P (from
))
6603 gcc_checking_assert (debug_args_for_decl
!= NULL
);
6604 in
.base
.from
= from
;
6605 h
= (struct tree_vec_map
*)
6606 htab_find_with_hash (debug_args_for_decl
, &in
, DECL_UID (from
));
6612 /* Insert a mapping FROM->empty vector of debug arguments in the value
6613 expression hashtable. */
6616 decl_debug_args_insert (tree from
)
6618 struct tree_vec_map
*h
;
6621 if (DECL_HAS_DEBUG_ARGS_P (from
))
6622 return decl_debug_args_lookup (from
);
6623 if (debug_args_for_decl
== NULL
)
6624 debug_args_for_decl
= htab_create_ggc (64, tree_vec_map_hash
,
6625 tree_vec_map_eq
, 0);
6626 h
= ggc_alloc
<tree_vec_map
> ();
6627 h
->base
.from
= from
;
6629 loc
= htab_find_slot_with_hash (debug_args_for_decl
, h
, DECL_UID (from
),
6631 *(struct tree_vec_map
**) loc
= h
;
6632 DECL_HAS_DEBUG_ARGS_P (from
) = 1;
6636 /* Hashing of types so that we don't make duplicates.
6637 The entry point is `type_hash_canon'. */
6639 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
6640 with types in the TREE_VALUE slots), by adding the hash codes
6641 of the individual types. */
6644 type_hash_list (const_tree list
, inchash::hash
&hstate
)
6648 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
6649 if (TREE_VALUE (tail
) != error_mark_node
)
6650 hstate
.add_object (TYPE_HASH (TREE_VALUE (tail
)));
6653 /* These are the Hashtable callback functions. */
6655 /* Returns true iff the types are equivalent. */
6658 type_hash_eq (const void *va
, const void *vb
)
6660 const struct type_hash
*const a
= (const struct type_hash
*) va
,
6661 *const b
= (const struct type_hash
*) vb
;
6663 /* First test the things that are the same for all types. */
6664 if (a
->hash
!= b
->hash
6665 || TREE_CODE (a
->type
) != TREE_CODE (b
->type
)
6666 || TREE_TYPE (a
->type
) != TREE_TYPE (b
->type
)
6667 || !attribute_list_equal (TYPE_ATTRIBUTES (a
->type
),
6668 TYPE_ATTRIBUTES (b
->type
))
6669 || (TREE_CODE (a
->type
) != COMPLEX_TYPE
6670 && TYPE_NAME (a
->type
) != TYPE_NAME (b
->type
)))
6673 /* Be careful about comparing arrays before and after the element type
6674 has been completed; don't compare TYPE_ALIGN unless both types are
6676 if (COMPLETE_TYPE_P (a
->type
) && COMPLETE_TYPE_P (b
->type
)
6677 && (TYPE_ALIGN (a
->type
) != TYPE_ALIGN (b
->type
)
6678 || TYPE_MODE (a
->type
) != TYPE_MODE (b
->type
)))
6681 switch (TREE_CODE (a
->type
))
6686 case REFERENCE_TYPE
:
6691 return TYPE_VECTOR_SUBPARTS (a
->type
) == TYPE_VECTOR_SUBPARTS (b
->type
);
6694 if (TYPE_VALUES (a
->type
) != TYPE_VALUES (b
->type
)
6695 && !(TYPE_VALUES (a
->type
)
6696 && TREE_CODE (TYPE_VALUES (a
->type
)) == TREE_LIST
6697 && TYPE_VALUES (b
->type
)
6698 && TREE_CODE (TYPE_VALUES (b
->type
)) == TREE_LIST
6699 && type_list_equal (TYPE_VALUES (a
->type
),
6700 TYPE_VALUES (b
->type
))))
6703 /* ... fall through ... */
6708 if (TYPE_PRECISION (a
->type
) != TYPE_PRECISION (b
->type
))
6710 return ((TYPE_MAX_VALUE (a
->type
) == TYPE_MAX_VALUE (b
->type
)
6711 || tree_int_cst_equal (TYPE_MAX_VALUE (a
->type
),
6712 TYPE_MAX_VALUE (b
->type
)))
6713 && (TYPE_MIN_VALUE (a
->type
) == TYPE_MIN_VALUE (b
->type
)
6714 || tree_int_cst_equal (TYPE_MIN_VALUE (a
->type
),
6715 TYPE_MIN_VALUE (b
->type
))));
6717 case FIXED_POINT_TYPE
:
6718 return TYPE_SATURATING (a
->type
) == TYPE_SATURATING (b
->type
);
6721 return TYPE_OFFSET_BASETYPE (a
->type
) == TYPE_OFFSET_BASETYPE (b
->type
);
6724 if (TYPE_METHOD_BASETYPE (a
->type
) == TYPE_METHOD_BASETYPE (b
->type
)
6725 && (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
6726 || (TYPE_ARG_TYPES (a
->type
)
6727 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
6728 && TYPE_ARG_TYPES (b
->type
)
6729 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
6730 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
6731 TYPE_ARG_TYPES (b
->type
)))))
6735 return TYPE_DOMAIN (a
->type
) == TYPE_DOMAIN (b
->type
);
6739 case QUAL_UNION_TYPE
:
6740 return (TYPE_FIELDS (a
->type
) == TYPE_FIELDS (b
->type
)
6741 || (TYPE_FIELDS (a
->type
)
6742 && TREE_CODE (TYPE_FIELDS (a
->type
)) == TREE_LIST
6743 && TYPE_FIELDS (b
->type
)
6744 && TREE_CODE (TYPE_FIELDS (b
->type
)) == TREE_LIST
6745 && type_list_equal (TYPE_FIELDS (a
->type
),
6746 TYPE_FIELDS (b
->type
))));
6749 if (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
6750 || (TYPE_ARG_TYPES (a
->type
)
6751 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
6752 && TYPE_ARG_TYPES (b
->type
)
6753 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
6754 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
6755 TYPE_ARG_TYPES (b
->type
))))
6763 if (lang_hooks
.types
.type_hash_eq
!= NULL
)
6764 return lang_hooks
.types
.type_hash_eq (a
->type
, b
->type
);
6769 /* Return the cached hash value. */
6772 type_hash_hash (const void *item
)
6774 return ((const struct type_hash
*) item
)->hash
;
6777 /* Given TYPE, and HASHCODE its hash code, return the canonical
6778 object for an identical type if one already exists.
6779 Otherwise, return TYPE, and record it as the canonical object.
6781 To use this function, first create a type of the sort you want.
6782 Then compute its hash code from the fields of the type that
6783 make it different from other similar types.
6784 Then call this function and use the value. */
6787 type_hash_canon (unsigned int hashcode
, tree type
)
6792 /* The hash table only contains main variants, so ensure that's what we're
6794 gcc_assert (TYPE_MAIN_VARIANT (type
) == type
);
6796 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
6797 must call that routine before comparing TYPE_ALIGNs. */
6803 loc
= htab_find_slot_with_hash (type_hash_table
, &in
, hashcode
, INSERT
);
6806 tree t1
= ((type_hash
*) *loc
)->type
;
6807 gcc_assert (TYPE_MAIN_VARIANT (t1
) == t1
);
6808 if (GATHER_STATISTICS
)
6810 tree_code_counts
[(int) TREE_CODE (type
)]--;
6811 tree_node_counts
[(int) t_kind
]--;
6812 tree_node_sizes
[(int) t_kind
] -= sizeof (struct tree_type_non_common
);
6818 struct type_hash
*h
;
6820 h
= ggc_alloc
<type_hash
> ();
6829 /* See if the data pointed to by the type hash table is marked. We consider
6830 it marked if the type is marked or if a debug type number or symbol
6831 table entry has been made for the type. */
6834 type_hash_marked_p (const void *p
)
6836 const_tree
const type
= ((const struct type_hash
*) p
)->type
;
6838 return ggc_marked_p (type
);
6842 print_type_hash_statistics (void)
6844 fprintf (stderr
, "Type hash: size %ld, %ld elements, %f collisions\n",
6845 (long) htab_size (type_hash_table
),
6846 (long) htab_elements (type_hash_table
),
6847 htab_collisions (type_hash_table
));
6850 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
6851 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
6852 by adding the hash codes of the individual attributes. */
6855 attribute_hash_list (const_tree list
, inchash::hash
&hstate
)
6859 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
6860 /* ??? Do we want to add in TREE_VALUE too? */
6861 hstate
.add_object (IDENTIFIER_HASH_VALUE (get_attribute_name (tail
)));
6864 /* Given two lists of attributes, return true if list l2 is
6865 equivalent to l1. */
6868 attribute_list_equal (const_tree l1
, const_tree l2
)
6873 return attribute_list_contained (l1
, l2
)
6874 && attribute_list_contained (l2
, l1
);
6877 /* Given two lists of attributes, return true if list L2 is
6878 completely contained within L1. */
6879 /* ??? This would be faster if attribute names were stored in a canonicalized
6880 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
6881 must be used to show these elements are equivalent (which they are). */
6882 /* ??? It's not clear that attributes with arguments will always be handled
6886 attribute_list_contained (const_tree l1
, const_tree l2
)
6890 /* First check the obvious, maybe the lists are identical. */
6894 /* Maybe the lists are similar. */
6895 for (t1
= l1
, t2
= l2
;
6897 && get_attribute_name (t1
) == get_attribute_name (t2
)
6898 && TREE_VALUE (t1
) == TREE_VALUE (t2
);
6899 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
6902 /* Maybe the lists are equal. */
6903 if (t1
== 0 && t2
== 0)
6906 for (; t2
!= 0; t2
= TREE_CHAIN (t2
))
6909 /* This CONST_CAST is okay because lookup_attribute does not
6910 modify its argument and the return value is assigned to a
6912 for (attr
= lookup_ident_attribute (get_attribute_name (t2
),
6913 CONST_CAST_TREE (l1
));
6914 attr
!= NULL_TREE
&& !attribute_value_equal (t2
, attr
);
6915 attr
= lookup_ident_attribute (get_attribute_name (t2
),
6919 if (attr
== NULL_TREE
)
6926 /* Given two lists of types
6927 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
6928 return 1 if the lists contain the same types in the same order.
6929 Also, the TREE_PURPOSEs must match. */
6932 type_list_equal (const_tree l1
, const_tree l2
)
6936 for (t1
= l1
, t2
= l2
; t1
&& t2
; t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
6937 if (TREE_VALUE (t1
) != TREE_VALUE (t2
)
6938 || (TREE_PURPOSE (t1
) != TREE_PURPOSE (t2
)
6939 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
))
6940 && (TREE_TYPE (TREE_PURPOSE (t1
))
6941 == TREE_TYPE (TREE_PURPOSE (t2
))))))
6947 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
6948 given by TYPE. If the argument list accepts variable arguments,
6949 then this function counts only the ordinary arguments. */
6952 type_num_arguments (const_tree type
)
6957 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
6958 /* If the function does not take a variable number of arguments,
6959 the last element in the list will have type `void'. */
6960 if (VOID_TYPE_P (TREE_VALUE (t
)))
6968 /* Nonzero if integer constants T1 and T2
6969 represent the same constant value. */
6972 tree_int_cst_equal (const_tree t1
, const_tree t2
)
6977 if (t1
== 0 || t2
== 0)
6980 if (TREE_CODE (t1
) == INTEGER_CST
6981 && TREE_CODE (t2
) == INTEGER_CST
6982 && wi::to_widest (t1
) == wi::to_widest (t2
))
6988 /* Return true if T is an INTEGER_CST whose numerical value (extended
6989 according to TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. */
6992 tree_fits_shwi_p (const_tree t
)
6994 return (t
!= NULL_TREE
6995 && TREE_CODE (t
) == INTEGER_CST
6996 && wi::fits_shwi_p (wi::to_widest (t
)));
6999 /* Return true if T is an INTEGER_CST whose numerical value (extended
7000 according to TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. */
7003 tree_fits_uhwi_p (const_tree t
)
7005 return (t
!= NULL_TREE
7006 && TREE_CODE (t
) == INTEGER_CST
7007 && wi::fits_uhwi_p (wi::to_widest (t
)));
7010 /* T is an INTEGER_CST whose numerical value (extended according to
7011 TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. Return that
7015 tree_to_shwi (const_tree t
)
7017 gcc_assert (tree_fits_shwi_p (t
));
7018 return TREE_INT_CST_LOW (t
);
7021 /* T is an INTEGER_CST whose numerical value (extended according to
7022 TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. Return that
7025 unsigned HOST_WIDE_INT
7026 tree_to_uhwi (const_tree t
)
7028 gcc_assert (tree_fits_uhwi_p (t
));
7029 return TREE_INT_CST_LOW (t
);
7032 /* Return the most significant (sign) bit of T. */
7035 tree_int_cst_sign_bit (const_tree t
)
7037 unsigned bitno
= TYPE_PRECISION (TREE_TYPE (t
)) - 1;
7039 return wi::extract_uhwi (t
, bitno
, 1);
7042 /* Return an indication of the sign of the integer constant T.
7043 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
7044 Note that -1 will never be returned if T's type is unsigned. */
7047 tree_int_cst_sgn (const_tree t
)
7049 if (wi::eq_p (t
, 0))
7051 else if (TYPE_UNSIGNED (TREE_TYPE (t
)))
7053 else if (wi::neg_p (t
))
7059 /* Return the minimum number of bits needed to represent VALUE in a
7060 signed or unsigned type, UNSIGNEDP says which. */
7063 tree_int_cst_min_precision (tree value
, signop sgn
)
7065 /* If the value is negative, compute its negative minus 1. The latter
7066 adjustment is because the absolute value of the largest negative value
7067 is one larger than the largest positive value. This is equivalent to
7068 a bit-wise negation, so use that operation instead. */
7070 if (tree_int_cst_sgn (value
) < 0)
7071 value
= fold_build1 (BIT_NOT_EXPR
, TREE_TYPE (value
), value
);
7073 /* Return the number of bits needed, taking into account the fact
7074 that we need one more bit for a signed than unsigned type.
7075 If value is 0 or -1, the minimum precision is 1 no matter
7076 whether unsignedp is true or false. */
7078 if (integer_zerop (value
))
7081 return tree_floor_log2 (value
) + 1 + (sgn
== SIGNED
? 1 : 0) ;
7084 /* Return truthvalue of whether T1 is the same tree structure as T2.
7085 Return 1 if they are the same.
7086 Return 0 if they are understandably different.
7087 Return -1 if either contains tree structure not understood by
7091 simple_cst_equal (const_tree t1
, const_tree t2
)
7093 enum tree_code code1
, code2
;
7099 if (t1
== 0 || t2
== 0)
7102 code1
= TREE_CODE (t1
);
7103 code2
= TREE_CODE (t2
);
7105 if (CONVERT_EXPR_CODE_P (code1
) || code1
== NON_LVALUE_EXPR
)
7107 if (CONVERT_EXPR_CODE_P (code2
)
7108 || code2
== NON_LVALUE_EXPR
)
7109 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7111 return simple_cst_equal (TREE_OPERAND (t1
, 0), t2
);
7114 else if (CONVERT_EXPR_CODE_P (code2
)
7115 || code2
== NON_LVALUE_EXPR
)
7116 return simple_cst_equal (t1
, TREE_OPERAND (t2
, 0));
7124 return wi::to_widest (t1
) == wi::to_widest (t2
);
7127 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1
), TREE_REAL_CST (t2
));
7130 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1
), TREE_FIXED_CST (t2
));
7133 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
7134 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
7135 TREE_STRING_LENGTH (t1
)));
7139 unsigned HOST_WIDE_INT idx
;
7140 vec
<constructor_elt
, va_gc
> *v1
= CONSTRUCTOR_ELTS (t1
);
7141 vec
<constructor_elt
, va_gc
> *v2
= CONSTRUCTOR_ELTS (t2
);
7143 if (vec_safe_length (v1
) != vec_safe_length (v2
))
7146 for (idx
= 0; idx
< vec_safe_length (v1
); ++idx
)
7147 /* ??? Should we handle also fields here? */
7148 if (!simple_cst_equal ((*v1
)[idx
].value
, (*v2
)[idx
].value
))
7154 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7157 cmp
= simple_cst_equal (CALL_EXPR_FN (t1
), CALL_EXPR_FN (t2
));
7160 if (call_expr_nargs (t1
) != call_expr_nargs (t2
))
7163 const_tree arg1
, arg2
;
7164 const_call_expr_arg_iterator iter1
, iter2
;
7165 for (arg1
= first_const_call_expr_arg (t1
, &iter1
),
7166 arg2
= first_const_call_expr_arg (t2
, &iter2
);
7168 arg1
= next_const_call_expr_arg (&iter1
),
7169 arg2
= next_const_call_expr_arg (&iter2
))
7171 cmp
= simple_cst_equal (arg1
, arg2
);
7175 return arg1
== arg2
;
7179 /* Special case: if either target is an unallocated VAR_DECL,
7180 it means that it's going to be unified with whatever the
7181 TARGET_EXPR is really supposed to initialize, so treat it
7182 as being equivalent to anything. */
7183 if ((TREE_CODE (TREE_OPERAND (t1
, 0)) == VAR_DECL
7184 && DECL_NAME (TREE_OPERAND (t1
, 0)) == NULL_TREE
7185 && !DECL_RTL_SET_P (TREE_OPERAND (t1
, 0)))
7186 || (TREE_CODE (TREE_OPERAND (t2
, 0)) == VAR_DECL
7187 && DECL_NAME (TREE_OPERAND (t2
, 0)) == NULL_TREE
7188 && !DECL_RTL_SET_P (TREE_OPERAND (t2
, 0))))
7191 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7196 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
7198 case WITH_CLEANUP_EXPR
:
7199 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7203 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t1
, 1));
7206 if (TREE_OPERAND (t1
, 1) == TREE_OPERAND (t2
, 1))
7207 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7221 /* This general rule works for most tree codes. All exceptions should be
7222 handled above. If this is a language-specific tree code, we can't
7223 trust what might be in the operand, so say we don't know
7225 if ((int) code1
>= (int) LAST_AND_UNUSED_TREE_CODE
)
7228 switch (TREE_CODE_CLASS (code1
))
7232 case tcc_comparison
:
7233 case tcc_expression
:
7237 for (i
= 0; i
< TREE_CODE_LENGTH (code1
); i
++)
7239 cmp
= simple_cst_equal (TREE_OPERAND (t1
, i
), TREE_OPERAND (t2
, i
));
7251 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
7252 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
7253 than U, respectively. */
7256 compare_tree_int (const_tree t
, unsigned HOST_WIDE_INT u
)
7258 if (tree_int_cst_sgn (t
) < 0)
7260 else if (!tree_fits_uhwi_p (t
))
7262 else if (TREE_INT_CST_LOW (t
) == u
)
7264 else if (TREE_INT_CST_LOW (t
) < u
)
7270 /* Return true if SIZE represents a constant size that is in bounds of
7271 what the middle-end and the backend accepts (covering not more than
7272 half of the address-space). */
7275 valid_constant_size_p (const_tree size
)
7277 if (! tree_fits_uhwi_p (size
)
7278 || TREE_OVERFLOW (size
)
7279 || tree_int_cst_sign_bit (size
) != 0)
7284 /* Return the precision of the type, or for a complex or vector type the
7285 precision of the type of its elements. */
7288 element_precision (const_tree type
)
7290 enum tree_code code
= TREE_CODE (type
);
7291 if (code
== COMPLEX_TYPE
|| code
== VECTOR_TYPE
)
7292 type
= TREE_TYPE (type
);
7294 return TYPE_PRECISION (type
);
7297 /* Return true if CODE represents an associative tree code. Otherwise
7300 associative_tree_code (enum tree_code code
)
7319 /* Return true if CODE represents a commutative tree code. Otherwise
7322 commutative_tree_code (enum tree_code code
)
7328 case MULT_HIGHPART_EXPR
:
7336 case UNORDERED_EXPR
:
7340 case TRUTH_AND_EXPR
:
7341 case TRUTH_XOR_EXPR
:
7343 case WIDEN_MULT_EXPR
:
7344 case VEC_WIDEN_MULT_HI_EXPR
:
7345 case VEC_WIDEN_MULT_LO_EXPR
:
7346 case VEC_WIDEN_MULT_EVEN_EXPR
:
7347 case VEC_WIDEN_MULT_ODD_EXPR
:
7356 /* Return true if CODE represents a ternary tree code for which the
7357 first two operands are commutative. Otherwise return false. */
7359 commutative_ternary_tree_code (enum tree_code code
)
7363 case WIDEN_MULT_PLUS_EXPR
:
7364 case WIDEN_MULT_MINUS_EXPR
:
7376 /* Generate a hash value for an expression. This can be used iteratively
7377 by passing a previous result as the HSTATE argument.
7379 This function is intended to produce the same hash for expressions which
7380 would compare equal using operand_equal_p. */
7382 add_expr (const_tree t
, inchash::hash
&hstate
)
7385 enum tree_code code
;
7386 enum tree_code_class tclass
;
7390 hstate
.merge_hash (0);
7394 code
= TREE_CODE (t
);
7398 /* Alas, constants aren't shared, so we can't rely on pointer
7401 hstate
.merge_hash (0);
7404 for (i
= 0; i
< TREE_INT_CST_NUNITS (t
); i
++)
7405 hstate
.add_wide_int (TREE_INT_CST_ELT (t
, i
));
7409 unsigned int val2
= real_hash (TREE_REAL_CST_PTR (t
));
7410 hstate
.merge_hash (val2
);
7415 unsigned int val2
= fixed_hash (TREE_FIXED_CST_PTR (t
));
7416 hstate
.merge_hash (val2
);
7420 hstate
.add ((const void *) TREE_STRING_POINTER (t
), TREE_STRING_LENGTH (t
));
7423 inchash::add_expr (TREE_REALPART (t
), hstate
);
7424 inchash::add_expr (TREE_IMAGPART (t
), hstate
);
7429 for (i
= 0; i
< VECTOR_CST_NELTS (t
); ++i
)
7430 inchash::add_expr (VECTOR_CST_ELT (t
, i
), hstate
);
7434 /* We can just compare by pointer. */
7435 hstate
.add_wide_int (SSA_NAME_VERSION (t
));
7437 case PLACEHOLDER_EXPR
:
7438 /* The node itself doesn't matter. */
7441 /* A list of expressions, for a CALL_EXPR or as the elements of a
7443 for (; t
; t
= TREE_CHAIN (t
))
7444 inchash::add_expr (TREE_VALUE (t
), hstate
);
7448 unsigned HOST_WIDE_INT idx
;
7450 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t
), idx
, field
, value
)
7452 inchash::add_expr (field
, hstate
);
7453 inchash::add_expr (value
, hstate
);
7458 /* When referring to a built-in FUNCTION_DECL, use the __builtin__ form.
7459 Otherwise nodes that compare equal according to operand_equal_p might
7460 get different hash codes. However, don't do this for machine specific
7461 or front end builtins, since the function code is overloaded in those
7463 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
7464 && builtin_decl_explicit_p (DECL_FUNCTION_CODE (t
)))
7466 t
= builtin_decl_explicit (DECL_FUNCTION_CODE (t
));
7467 code
= TREE_CODE (t
);
7471 tclass
= TREE_CODE_CLASS (code
);
7473 if (tclass
== tcc_declaration
)
7475 /* DECL's have a unique ID */
7476 hstate
.add_wide_int (DECL_UID (t
));
7480 gcc_assert (IS_EXPR_CODE_CLASS (tclass
));
7482 hstate
.add_object (code
);
7484 /* Don't hash the type, that can lead to having nodes which
7485 compare equal according to operand_equal_p, but which
7486 have different hash codes. */
7487 if (CONVERT_EXPR_CODE_P (code
)
7488 || code
== NON_LVALUE_EXPR
)
7490 /* Make sure to include signness in the hash computation. */
7491 hstate
.add_int (TYPE_UNSIGNED (TREE_TYPE (t
)));
7492 inchash::add_expr (TREE_OPERAND (t
, 0), hstate
);
7495 else if (commutative_tree_code (code
))
7497 /* It's a commutative expression. We want to hash it the same
7498 however it appears. We do this by first hashing both operands
7499 and then rehashing based on the order of their independent
7501 inchash::hash one
, two
;
7502 inchash::add_expr (TREE_OPERAND (t
, 0), one
);
7503 inchash::add_expr (TREE_OPERAND (t
, 1), two
);
7504 hstate
.add_commutative (one
, two
);
7507 for (i
= TREE_OPERAND_LENGTH (t
) - 1; i
>= 0; --i
)
7508 inchash::add_expr (TREE_OPERAND (t
, i
), hstate
);
7516 /* Constructors for pointer, array and function types.
7517 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
7518 constructed by language-dependent code, not here.) */
7520 /* Construct, lay out and return the type of pointers to TO_TYPE with
7521 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
7522 reference all of memory. If such a type has already been
7523 constructed, reuse it. */
7526 build_pointer_type_for_mode (tree to_type
, enum machine_mode mode
,
7531 if (to_type
== error_mark_node
)
7532 return error_mark_node
;
7534 /* If the pointed-to type has the may_alias attribute set, force
7535 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7536 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
7537 can_alias_all
= true;
7539 /* In some cases, languages will have things that aren't a POINTER_TYPE
7540 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
7541 In that case, return that type without regard to the rest of our
7544 ??? This is a kludge, but consistent with the way this function has
7545 always operated and there doesn't seem to be a good way to avoid this
7547 if (TYPE_POINTER_TO (to_type
) != 0
7548 && TREE_CODE (TYPE_POINTER_TO (to_type
)) != POINTER_TYPE
)
7549 return TYPE_POINTER_TO (to_type
);
7551 /* First, if we already have a type for pointers to TO_TYPE and it's
7552 the proper mode, use it. */
7553 for (t
= TYPE_POINTER_TO (to_type
); t
; t
= TYPE_NEXT_PTR_TO (t
))
7554 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
7557 t
= make_node (POINTER_TYPE
);
7559 TREE_TYPE (t
) = to_type
;
7560 SET_TYPE_MODE (t
, mode
);
7561 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
7562 TYPE_NEXT_PTR_TO (t
) = TYPE_POINTER_TO (to_type
);
7563 TYPE_POINTER_TO (to_type
) = t
;
7565 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
))
7566 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7567 else if (TYPE_CANONICAL (to_type
) != to_type
)
7569 = build_pointer_type_for_mode (TYPE_CANONICAL (to_type
),
7570 mode
, can_alias_all
);
7572 /* Lay out the type. This function has many callers that are concerned
7573 with expression-construction, and this simplifies them all. */
7579 /* By default build pointers in ptr_mode. */
7582 build_pointer_type (tree to_type
)
7584 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
7585 : TYPE_ADDR_SPACE (to_type
);
7586 enum machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
7587 return build_pointer_type_for_mode (to_type
, pointer_mode
, false);
7590 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
7593 build_reference_type_for_mode (tree to_type
, enum machine_mode mode
,
7598 if (to_type
== error_mark_node
)
7599 return error_mark_node
;
7601 /* If the pointed-to type has the may_alias attribute set, force
7602 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7603 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
7604 can_alias_all
= true;
7606 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
7607 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
7608 In that case, return that type without regard to the rest of our
7611 ??? This is a kludge, but consistent with the way this function has
7612 always operated and there doesn't seem to be a good way to avoid this
7614 if (TYPE_REFERENCE_TO (to_type
) != 0
7615 && TREE_CODE (TYPE_REFERENCE_TO (to_type
)) != REFERENCE_TYPE
)
7616 return TYPE_REFERENCE_TO (to_type
);
7618 /* First, if we already have a type for pointers to TO_TYPE and it's
7619 the proper mode, use it. */
7620 for (t
= TYPE_REFERENCE_TO (to_type
); t
; t
= TYPE_NEXT_REF_TO (t
))
7621 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
7624 t
= make_node (REFERENCE_TYPE
);
7626 TREE_TYPE (t
) = to_type
;
7627 SET_TYPE_MODE (t
, mode
);
7628 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
7629 TYPE_NEXT_REF_TO (t
) = TYPE_REFERENCE_TO (to_type
);
7630 TYPE_REFERENCE_TO (to_type
) = t
;
7632 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
))
7633 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7634 else if (TYPE_CANONICAL (to_type
) != to_type
)
7636 = build_reference_type_for_mode (TYPE_CANONICAL (to_type
),
7637 mode
, can_alias_all
);
7645 /* Build the node for the type of references-to-TO_TYPE by default
7649 build_reference_type (tree to_type
)
7651 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
7652 : TYPE_ADDR_SPACE (to_type
);
7653 enum machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
7654 return build_reference_type_for_mode (to_type
, pointer_mode
, false);
7657 #define MAX_INT_CACHED_PREC \
7658 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
7659 static GTY(()) tree nonstandard_integer_type_cache
[2 * MAX_INT_CACHED_PREC
+ 2];
7661 /* Builds a signed or unsigned integer type of precision PRECISION.
7662 Used for C bitfields whose precision does not match that of
7663 built-in target types. */
7665 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision
,
7671 unsignedp
= MAX_INT_CACHED_PREC
+ 1;
7673 if (precision
<= MAX_INT_CACHED_PREC
)
7675 itype
= nonstandard_integer_type_cache
[precision
+ unsignedp
];
7680 itype
= make_node (INTEGER_TYPE
);
7681 TYPE_PRECISION (itype
) = precision
;
7684 fixup_unsigned_type (itype
);
7686 fixup_signed_type (itype
);
7689 if (tree_fits_uhwi_p (TYPE_MAX_VALUE (itype
)))
7690 ret
= type_hash_canon (tree_to_uhwi (TYPE_MAX_VALUE (itype
)), itype
);
7691 if (precision
<= MAX_INT_CACHED_PREC
)
7692 nonstandard_integer_type_cache
[precision
+ unsignedp
] = ret
;
7697 /* Create a range of some discrete type TYPE (an INTEGER_TYPE, ENUMERAL_TYPE
7698 or BOOLEAN_TYPE) with low bound LOWVAL and high bound HIGHVAL. If SHARED
7699 is true, reuse such a type that has already been constructed. */
7702 build_range_type_1 (tree type
, tree lowval
, tree highval
, bool shared
)
7704 tree itype
= make_node (INTEGER_TYPE
);
7705 inchash::hash hstate
;
7707 TREE_TYPE (itype
) = type
;
7709 TYPE_MIN_VALUE (itype
) = fold_convert (type
, lowval
);
7710 TYPE_MAX_VALUE (itype
) = highval
? fold_convert (type
, highval
) : NULL
;
7712 TYPE_PRECISION (itype
) = TYPE_PRECISION (type
);
7713 SET_TYPE_MODE (itype
, TYPE_MODE (type
));
7714 TYPE_SIZE (itype
) = TYPE_SIZE (type
);
7715 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (type
);
7716 TYPE_ALIGN (itype
) = TYPE_ALIGN (type
);
7717 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (type
);
7722 if ((TYPE_MIN_VALUE (itype
)
7723 && TREE_CODE (TYPE_MIN_VALUE (itype
)) != INTEGER_CST
)
7724 || (TYPE_MAX_VALUE (itype
)
7725 && TREE_CODE (TYPE_MAX_VALUE (itype
)) != INTEGER_CST
))
7727 /* Since we cannot reliably merge this type, we need to compare it using
7728 structural equality checks. */
7729 SET_TYPE_STRUCTURAL_EQUALITY (itype
);
7733 inchash::add_expr (TYPE_MIN_VALUE (itype
), hstate
);
7734 inchash::add_expr (TYPE_MAX_VALUE (itype
), hstate
);
7735 hstate
.merge_hash (TYPE_HASH (type
));
7736 itype
= type_hash_canon (hstate
.end (), itype
);
7741 /* Wrapper around build_range_type_1 with SHARED set to true. */
7744 build_range_type (tree type
, tree lowval
, tree highval
)
7746 return build_range_type_1 (type
, lowval
, highval
, true);
7749 /* Wrapper around build_range_type_1 with SHARED set to false. */
7752 build_nonshared_range_type (tree type
, tree lowval
, tree highval
)
7754 return build_range_type_1 (type
, lowval
, highval
, false);
7757 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
7758 MAXVAL should be the maximum value in the domain
7759 (one less than the length of the array).
7761 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
7762 We don't enforce this limit, that is up to caller (e.g. language front end).
7763 The limit exists because the result is a signed type and we don't handle
7764 sizes that use more than one HOST_WIDE_INT. */
7767 build_index_type (tree maxval
)
7769 return build_range_type (sizetype
, size_zero_node
, maxval
);
7772 /* Return true if the debug information for TYPE, a subtype, should be emitted
7773 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
7774 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
7775 debug info and doesn't reflect the source code. */
7778 subrange_type_for_debug_p (const_tree type
, tree
*lowval
, tree
*highval
)
7780 tree base_type
= TREE_TYPE (type
), low
, high
;
7782 /* Subrange types have a base type which is an integral type. */
7783 if (!INTEGRAL_TYPE_P (base_type
))
7786 /* Get the real bounds of the subtype. */
7787 if (lang_hooks
.types
.get_subrange_bounds
)
7788 lang_hooks
.types
.get_subrange_bounds (type
, &low
, &high
);
7791 low
= TYPE_MIN_VALUE (type
);
7792 high
= TYPE_MAX_VALUE (type
);
7795 /* If the type and its base type have the same representation and the same
7796 name, then the type is not a subrange but a copy of the base type. */
7797 if ((TREE_CODE (base_type
) == INTEGER_TYPE
7798 || TREE_CODE (base_type
) == BOOLEAN_TYPE
)
7799 && int_size_in_bytes (type
) == int_size_in_bytes (base_type
)
7800 && tree_int_cst_equal (low
, TYPE_MIN_VALUE (base_type
))
7801 && tree_int_cst_equal (high
, TYPE_MAX_VALUE (base_type
))
7802 && TYPE_IDENTIFIER (type
) == TYPE_IDENTIFIER (base_type
))
7812 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
7813 and number of elements specified by the range of values of INDEX_TYPE.
7814 If SHARED is true, reuse such a type that has already been constructed. */
7817 build_array_type_1 (tree elt_type
, tree index_type
, bool shared
)
7821 if (TREE_CODE (elt_type
) == FUNCTION_TYPE
)
7823 error ("arrays of functions are not meaningful");
7824 elt_type
= integer_type_node
;
7827 t
= make_node (ARRAY_TYPE
);
7828 TREE_TYPE (t
) = elt_type
;
7829 TYPE_DOMAIN (t
) = index_type
;
7830 TYPE_ADDR_SPACE (t
) = TYPE_ADDR_SPACE (elt_type
);
7833 /* If the element type is incomplete at this point we get marked for
7834 structural equality. Do not record these types in the canonical
7836 if (TYPE_STRUCTURAL_EQUALITY_P (t
))
7841 inchash::hash hstate
;
7842 hstate
.add_object (TYPE_HASH (elt_type
));
7844 hstate
.add_object (TYPE_HASH (index_type
));
7845 t
= type_hash_canon (hstate
.end (), t
);
7848 if (TYPE_CANONICAL (t
) == t
)
7850 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type
)
7851 || (index_type
&& TYPE_STRUCTURAL_EQUALITY_P (index_type
)))
7852 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7853 else if (TYPE_CANONICAL (elt_type
) != elt_type
7854 || (index_type
&& TYPE_CANONICAL (index_type
) != index_type
))
7856 = build_array_type_1 (TYPE_CANONICAL (elt_type
),
7858 ? TYPE_CANONICAL (index_type
) : NULL_TREE
,
7865 /* Wrapper around build_array_type_1 with SHARED set to true. */
7868 build_array_type (tree elt_type
, tree index_type
)
7870 return build_array_type_1 (elt_type
, index_type
, true);
7873 /* Wrapper around build_array_type_1 with SHARED set to false. */
7876 build_nonshared_array_type (tree elt_type
, tree index_type
)
7878 return build_array_type_1 (elt_type
, index_type
, false);
7881 /* Return a representation of ELT_TYPE[NELTS], using indices of type
7885 build_array_type_nelts (tree elt_type
, unsigned HOST_WIDE_INT nelts
)
7887 return build_array_type (elt_type
, build_index_type (size_int (nelts
- 1)));
7890 /* Recursively examines the array elements of TYPE, until a non-array
7891 element type is found. */
7894 strip_array_types (tree type
)
7896 while (TREE_CODE (type
) == ARRAY_TYPE
)
7897 type
= TREE_TYPE (type
);
7902 /* Computes the canonical argument types from the argument type list
7905 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
7906 on entry to this function, or if any of the ARGTYPES are
7909 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
7910 true on entry to this function, or if any of the ARGTYPES are
7913 Returns a canonical argument list, which may be ARGTYPES when the
7914 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
7915 true) or would not differ from ARGTYPES. */
7918 maybe_canonicalize_argtypes (tree argtypes
,
7919 bool *any_structural_p
,
7920 bool *any_noncanonical_p
)
7923 bool any_noncanonical_argtypes_p
= false;
7925 for (arg
= argtypes
; arg
&& !(*any_structural_p
); arg
= TREE_CHAIN (arg
))
7927 if (!TREE_VALUE (arg
) || TREE_VALUE (arg
) == error_mark_node
)
7928 /* Fail gracefully by stating that the type is structural. */
7929 *any_structural_p
= true;
7930 else if (TYPE_STRUCTURAL_EQUALITY_P (TREE_VALUE (arg
)))
7931 *any_structural_p
= true;
7932 else if (TYPE_CANONICAL (TREE_VALUE (arg
)) != TREE_VALUE (arg
)
7933 || TREE_PURPOSE (arg
))
7934 /* If the argument has a default argument, we consider it
7935 non-canonical even though the type itself is canonical.
7936 That way, different variants of function and method types
7937 with default arguments will all point to the variant with
7938 no defaults as their canonical type. */
7939 any_noncanonical_argtypes_p
= true;
7942 if (*any_structural_p
)
7945 if (any_noncanonical_argtypes_p
)
7947 /* Build the canonical list of argument types. */
7948 tree canon_argtypes
= NULL_TREE
;
7949 bool is_void
= false;
7951 for (arg
= argtypes
; arg
; arg
= TREE_CHAIN (arg
))
7953 if (arg
== void_list_node
)
7956 canon_argtypes
= tree_cons (NULL_TREE
,
7957 TYPE_CANONICAL (TREE_VALUE (arg
)),
7961 canon_argtypes
= nreverse (canon_argtypes
);
7963 canon_argtypes
= chainon (canon_argtypes
, void_list_node
);
7965 /* There is a non-canonical type. */
7966 *any_noncanonical_p
= true;
7967 return canon_argtypes
;
7970 /* The canonical argument types are the same as ARGTYPES. */
7974 /* Construct, lay out and return
7975 the type of functions returning type VALUE_TYPE
7976 given arguments of types ARG_TYPES.
7977 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
7978 are data type nodes for the arguments of the function.
7979 If such a type has already been constructed, reuse it. */
7982 build_function_type (tree value_type
, tree arg_types
)
7985 inchash::hash hstate
;
7986 bool any_structural_p
, any_noncanonical_p
;
7987 tree canon_argtypes
;
7989 if (TREE_CODE (value_type
) == FUNCTION_TYPE
)
7991 error ("function return type cannot be function");
7992 value_type
= integer_type_node
;
7995 /* Make a node of the sort we want. */
7996 t
= make_node (FUNCTION_TYPE
);
7997 TREE_TYPE (t
) = value_type
;
7998 TYPE_ARG_TYPES (t
) = arg_types
;
8000 /* If we already have such a type, use the old one. */
8001 hstate
.add_object (TYPE_HASH (value_type
));
8002 type_hash_list (arg_types
, hstate
);
8003 t
= type_hash_canon (hstate
.end (), t
);
8005 /* Set up the canonical type. */
8006 any_structural_p
= TYPE_STRUCTURAL_EQUALITY_P (value_type
);
8007 any_noncanonical_p
= TYPE_CANONICAL (value_type
) != value_type
;
8008 canon_argtypes
= maybe_canonicalize_argtypes (arg_types
,
8010 &any_noncanonical_p
);
8011 if (any_structural_p
)
8012 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8013 else if (any_noncanonical_p
)
8014 TYPE_CANONICAL (t
) = build_function_type (TYPE_CANONICAL (value_type
),
8017 if (!COMPLETE_TYPE_P (t
))
8022 /* Build a function type. The RETURN_TYPE is the type returned by the
8023 function. If VAARGS is set, no void_type_node is appended to the
8024 the list. ARGP must be always be terminated be a NULL_TREE. */
8027 build_function_type_list_1 (bool vaargs
, tree return_type
, va_list argp
)
8031 t
= va_arg (argp
, tree
);
8032 for (args
= NULL_TREE
; t
!= NULL_TREE
; t
= va_arg (argp
, tree
))
8033 args
= tree_cons (NULL_TREE
, t
, args
);
8038 if (args
!= NULL_TREE
)
8039 args
= nreverse (args
);
8040 gcc_assert (last
!= void_list_node
);
8042 else if (args
== NULL_TREE
)
8043 args
= void_list_node
;
8047 args
= nreverse (args
);
8048 TREE_CHAIN (last
) = void_list_node
;
8050 args
= build_function_type (return_type
, args
);
8055 /* Build a function type. The RETURN_TYPE is the type returned by the
8056 function. If additional arguments are provided, they are
8057 additional argument types. The list of argument types must always
8058 be terminated by NULL_TREE. */
8061 build_function_type_list (tree return_type
, ...)
8066 va_start (p
, return_type
);
8067 args
= build_function_type_list_1 (false, return_type
, p
);
8072 /* Build a variable argument function type. The RETURN_TYPE is the
8073 type returned by the function. If additional arguments are provided,
8074 they are additional argument types. The list of argument types must
8075 always be terminated by NULL_TREE. */
8078 build_varargs_function_type_list (tree return_type
, ...)
8083 va_start (p
, return_type
);
8084 args
= build_function_type_list_1 (true, return_type
, p
);
8090 /* Build a function type. RETURN_TYPE is the type returned by the
8091 function; VAARGS indicates whether the function takes varargs. The
8092 function takes N named arguments, the types of which are provided in
8096 build_function_type_array_1 (bool vaargs
, tree return_type
, int n
,
8100 tree t
= vaargs
? NULL_TREE
: void_list_node
;
8102 for (i
= n
- 1; i
>= 0; i
--)
8103 t
= tree_cons (NULL_TREE
, arg_types
[i
], t
);
8105 return build_function_type (return_type
, t
);
8108 /* Build a function type. RETURN_TYPE is the type returned by the
8109 function. The function takes N named arguments, the types of which
8110 are provided in ARG_TYPES. */
8113 build_function_type_array (tree return_type
, int n
, tree
*arg_types
)
8115 return build_function_type_array_1 (false, return_type
, n
, arg_types
);
8118 /* Build a variable argument function type. RETURN_TYPE is the type
8119 returned by the function. The function takes N named arguments, the
8120 types of which are provided in ARG_TYPES. */
8123 build_varargs_function_type_array (tree return_type
, int n
, tree
*arg_types
)
8125 return build_function_type_array_1 (true, return_type
, n
, arg_types
);
8128 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
8129 and ARGTYPES (a TREE_LIST) are the return type and arguments types
8130 for the method. An implicit additional parameter (of type
8131 pointer-to-BASETYPE) is added to the ARGTYPES. */
8134 build_method_type_directly (tree basetype
,
8140 inchash::hash hstate
;
8141 bool any_structural_p
, any_noncanonical_p
;
8142 tree canon_argtypes
;
8144 /* Make a node of the sort we want. */
8145 t
= make_node (METHOD_TYPE
);
8147 TYPE_METHOD_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
8148 TREE_TYPE (t
) = rettype
;
8149 ptype
= build_pointer_type (basetype
);
8151 /* The actual arglist for this function includes a "hidden" argument
8152 which is "this". Put it into the list of argument types. */
8153 argtypes
= tree_cons (NULL_TREE
, ptype
, argtypes
);
8154 TYPE_ARG_TYPES (t
) = argtypes
;
8156 /* If we already have such a type, use the old one. */
8157 hstate
.add_object (TYPE_HASH (basetype
));
8158 hstate
.add_object (TYPE_HASH (rettype
));
8159 type_hash_list (argtypes
, hstate
);
8160 t
= type_hash_canon (hstate
.end (), t
);
8162 /* Set up the canonical type. */
8164 = (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
8165 || TYPE_STRUCTURAL_EQUALITY_P (rettype
));
8167 = (TYPE_CANONICAL (basetype
) != basetype
8168 || TYPE_CANONICAL (rettype
) != rettype
);
8169 canon_argtypes
= maybe_canonicalize_argtypes (TREE_CHAIN (argtypes
),
8171 &any_noncanonical_p
);
8172 if (any_structural_p
)
8173 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8174 else if (any_noncanonical_p
)
8176 = build_method_type_directly (TYPE_CANONICAL (basetype
),
8177 TYPE_CANONICAL (rettype
),
8179 if (!COMPLETE_TYPE_P (t
))
8185 /* Construct, lay out and return the type of methods belonging to class
8186 BASETYPE and whose arguments and values are described by TYPE.
8187 If that type exists already, reuse it.
8188 TYPE must be a FUNCTION_TYPE node. */
8191 build_method_type (tree basetype
, tree type
)
8193 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
8195 return build_method_type_directly (basetype
,
8197 TYPE_ARG_TYPES (type
));
8200 /* Construct, lay out and return the type of offsets to a value
8201 of type TYPE, within an object of type BASETYPE.
8202 If a suitable offset type exists already, reuse it. */
8205 build_offset_type (tree basetype
, tree type
)
8208 inchash::hash hstate
;
8210 /* Make a node of the sort we want. */
8211 t
= make_node (OFFSET_TYPE
);
8213 TYPE_OFFSET_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
8214 TREE_TYPE (t
) = type
;
8216 /* If we already have such a type, use the old one. */
8217 hstate
.add_object (TYPE_HASH (basetype
));
8218 hstate
.add_object (TYPE_HASH (type
));
8219 t
= type_hash_canon (hstate
.end (), t
);
8221 if (!COMPLETE_TYPE_P (t
))
8224 if (TYPE_CANONICAL (t
) == t
)
8226 if (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
8227 || TYPE_STRUCTURAL_EQUALITY_P (type
))
8228 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8229 else if (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)) != basetype
8230 || TYPE_CANONICAL (type
) != type
)
8232 = build_offset_type (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)),
8233 TYPE_CANONICAL (type
));
8239 /* Create a complex type whose components are COMPONENT_TYPE. */
8242 build_complex_type (tree component_type
)
8245 inchash::hash hstate
;
8247 gcc_assert (INTEGRAL_TYPE_P (component_type
)
8248 || SCALAR_FLOAT_TYPE_P (component_type
)
8249 || FIXED_POINT_TYPE_P (component_type
));
8251 /* Make a node of the sort we want. */
8252 t
= make_node (COMPLEX_TYPE
);
8254 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (component_type
);
8256 /* If we already have such a type, use the old one. */
8257 hstate
.add_object (TYPE_HASH (component_type
));
8258 t
= type_hash_canon (hstate
.end (), t
);
8260 if (!COMPLETE_TYPE_P (t
))
8263 if (TYPE_CANONICAL (t
) == t
)
8265 if (TYPE_STRUCTURAL_EQUALITY_P (component_type
))
8266 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8267 else if (TYPE_CANONICAL (component_type
) != component_type
)
8269 = build_complex_type (TYPE_CANONICAL (component_type
));
8272 /* We need to create a name, since complex is a fundamental type. */
8273 if (! TYPE_NAME (t
))
8276 if (component_type
== char_type_node
)
8277 name
= "complex char";
8278 else if (component_type
== signed_char_type_node
)
8279 name
= "complex signed char";
8280 else if (component_type
== unsigned_char_type_node
)
8281 name
= "complex unsigned char";
8282 else if (component_type
== short_integer_type_node
)
8283 name
= "complex short int";
8284 else if (component_type
== short_unsigned_type_node
)
8285 name
= "complex short unsigned int";
8286 else if (component_type
== integer_type_node
)
8287 name
= "complex int";
8288 else if (component_type
== unsigned_type_node
)
8289 name
= "complex unsigned int";
8290 else if (component_type
== long_integer_type_node
)
8291 name
= "complex long int";
8292 else if (component_type
== long_unsigned_type_node
)
8293 name
= "complex long unsigned int";
8294 else if (component_type
== long_long_integer_type_node
)
8295 name
= "complex long long int";
8296 else if (component_type
== long_long_unsigned_type_node
)
8297 name
= "complex long long unsigned int";
8302 TYPE_NAME (t
) = build_decl (UNKNOWN_LOCATION
, TYPE_DECL
,
8303 get_identifier (name
), t
);
8306 return build_qualified_type (t
, TYPE_QUALS (component_type
));
8309 /* If TYPE is a real or complex floating-point type and the target
8310 does not directly support arithmetic on TYPE then return the wider
8311 type to be used for arithmetic on TYPE. Otherwise, return
8315 excess_precision_type (tree type
)
8317 if (flag_excess_precision
!= EXCESS_PRECISION_FAST
)
8319 int flt_eval_method
= TARGET_FLT_EVAL_METHOD
;
8320 switch (TREE_CODE (type
))
8323 switch (flt_eval_method
)
8326 if (TYPE_MODE (type
) == TYPE_MODE (float_type_node
))
8327 return double_type_node
;
8330 if (TYPE_MODE (type
) == TYPE_MODE (float_type_node
)
8331 || TYPE_MODE (type
) == TYPE_MODE (double_type_node
))
8332 return long_double_type_node
;
8339 if (TREE_CODE (TREE_TYPE (type
)) != REAL_TYPE
)
8341 switch (flt_eval_method
)
8344 if (TYPE_MODE (TREE_TYPE (type
)) == TYPE_MODE (float_type_node
))
8345 return complex_double_type_node
;
8348 if (TYPE_MODE (TREE_TYPE (type
)) == TYPE_MODE (float_type_node
)
8349 || (TYPE_MODE (TREE_TYPE (type
))
8350 == TYPE_MODE (double_type_node
)))
8351 return complex_long_double_type_node
;
8364 /* Return OP, stripped of any conversions to wider types as much as is safe.
8365 Converting the value back to OP's type makes a value equivalent to OP.
8367 If FOR_TYPE is nonzero, we return a value which, if converted to
8368 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
8370 OP must have integer, real or enumeral type. Pointers are not allowed!
8372 There are some cases where the obvious value we could return
8373 would regenerate to OP if converted to OP's type,
8374 but would not extend like OP to wider types.
8375 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
8376 For example, if OP is (unsigned short)(signed char)-1,
8377 we avoid returning (signed char)-1 if FOR_TYPE is int,
8378 even though extending that to an unsigned short would regenerate OP,
8379 since the result of extending (signed char)-1 to (int)
8380 is different from (int) OP. */
8383 get_unwidened (tree op
, tree for_type
)
8385 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
8386 tree type
= TREE_TYPE (op
);
8388 = TYPE_PRECISION (for_type
!= 0 ? for_type
: type
);
8390 = (for_type
!= 0 && for_type
!= type
8391 && final_prec
> TYPE_PRECISION (type
)
8392 && TYPE_UNSIGNED (type
));
8395 while (CONVERT_EXPR_P (op
))
8399 /* TYPE_PRECISION on vector types has different meaning
8400 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
8401 so avoid them here. */
8402 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op
, 0))) == VECTOR_TYPE
)
8405 bitschange
= TYPE_PRECISION (TREE_TYPE (op
))
8406 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0)));
8408 /* Truncations are many-one so cannot be removed.
8409 Unless we are later going to truncate down even farther. */
8411 && final_prec
> TYPE_PRECISION (TREE_TYPE (op
)))
8414 /* See what's inside this conversion. If we decide to strip it,
8416 op
= TREE_OPERAND (op
, 0);
8418 /* If we have not stripped any zero-extensions (uns is 0),
8419 we can strip any kind of extension.
8420 If we have previously stripped a zero-extension,
8421 only zero-extensions can safely be stripped.
8422 Any extension can be stripped if the bits it would produce
8423 are all going to be discarded later by truncating to FOR_TYPE. */
8427 if (! uns
|| final_prec
<= TYPE_PRECISION (TREE_TYPE (op
)))
8429 /* TYPE_UNSIGNED says whether this is a zero-extension.
8430 Let's avoid computing it if it does not affect WIN
8431 and if UNS will not be needed again. */
8433 || CONVERT_EXPR_P (op
))
8434 && TYPE_UNSIGNED (TREE_TYPE (op
)))
8442 /* If we finally reach a constant see if it fits in for_type and
8443 in that case convert it. */
8445 && TREE_CODE (win
) == INTEGER_CST
8446 && TREE_TYPE (win
) != for_type
8447 && int_fits_type_p (win
, for_type
))
8448 win
= fold_convert (for_type
, win
);
8453 /* Return OP or a simpler expression for a narrower value
8454 which can be sign-extended or zero-extended to give back OP.
8455 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
8456 or 0 if the value should be sign-extended. */
8459 get_narrower (tree op
, int *unsignedp_ptr
)
8464 bool integral_p
= INTEGRAL_TYPE_P (TREE_TYPE (op
));
8466 while (TREE_CODE (op
) == NOP_EXPR
)
8469 = (TYPE_PRECISION (TREE_TYPE (op
))
8470 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0))));
8472 /* Truncations are many-one so cannot be removed. */
8476 /* See what's inside this conversion. If we decide to strip it,
8481 op
= TREE_OPERAND (op
, 0);
8482 /* An extension: the outermost one can be stripped,
8483 but remember whether it is zero or sign extension. */
8485 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
8486 /* Otherwise, if a sign extension has been stripped,
8487 only sign extensions can now be stripped;
8488 if a zero extension has been stripped, only zero-extensions. */
8489 else if (uns
!= TYPE_UNSIGNED (TREE_TYPE (op
)))
8493 else /* bitschange == 0 */
8495 /* A change in nominal type can always be stripped, but we must
8496 preserve the unsignedness. */
8498 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
8500 op
= TREE_OPERAND (op
, 0);
8501 /* Keep trying to narrow, but don't assign op to win if it
8502 would turn an integral type into something else. */
8503 if (INTEGRAL_TYPE_P (TREE_TYPE (op
)) != integral_p
)
8510 if (TREE_CODE (op
) == COMPONENT_REF
8511 /* Since type_for_size always gives an integer type. */
8512 && TREE_CODE (TREE_TYPE (op
)) != REAL_TYPE
8513 && TREE_CODE (TREE_TYPE (op
)) != FIXED_POINT_TYPE
8514 /* Ensure field is laid out already. */
8515 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0
8516 && tree_fits_uhwi_p (DECL_SIZE (TREE_OPERAND (op
, 1))))
8518 unsigned HOST_WIDE_INT innerprec
8519 = tree_to_uhwi (DECL_SIZE (TREE_OPERAND (op
, 1)));
8520 int unsignedp
= (DECL_UNSIGNED (TREE_OPERAND (op
, 1))
8521 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op
, 1))));
8522 tree type
= lang_hooks
.types
.type_for_size (innerprec
, unsignedp
);
8524 /* We can get this structure field in a narrower type that fits it,
8525 but the resulting extension to its nominal type (a fullword type)
8526 must satisfy the same conditions as for other extensions.
8528 Do this only for fields that are aligned (not bit-fields),
8529 because when bit-field insns will be used there is no
8530 advantage in doing this. */
8532 if (innerprec
< TYPE_PRECISION (TREE_TYPE (op
))
8533 && ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1))
8534 && (first
|| uns
== DECL_UNSIGNED (TREE_OPERAND (op
, 1)))
8538 uns
= DECL_UNSIGNED (TREE_OPERAND (op
, 1));
8539 win
= fold_convert (type
, op
);
8543 *unsignedp_ptr
= uns
;
8547 /* Returns true if integer constant C has a value that is permissible
8548 for type TYPE (an INTEGER_TYPE). */
8551 int_fits_type_p (const_tree c
, const_tree type
)
8553 tree type_low_bound
, type_high_bound
;
8554 bool ok_for_low_bound
, ok_for_high_bound
;
8555 signop sgn_c
= TYPE_SIGN (TREE_TYPE (c
));
8558 type_low_bound
= TYPE_MIN_VALUE (type
);
8559 type_high_bound
= TYPE_MAX_VALUE (type
);
8561 /* If at least one bound of the type is a constant integer, we can check
8562 ourselves and maybe make a decision. If no such decision is possible, but
8563 this type is a subtype, try checking against that. Otherwise, use
8564 fits_to_tree_p, which checks against the precision.
8566 Compute the status for each possibly constant bound, and return if we see
8567 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
8568 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
8569 for "constant known to fit". */
8571 /* Check if c >= type_low_bound. */
8572 if (type_low_bound
&& TREE_CODE (type_low_bound
) == INTEGER_CST
)
8574 if (tree_int_cst_lt (c
, type_low_bound
))
8576 ok_for_low_bound
= true;
8579 ok_for_low_bound
= false;
8581 /* Check if c <= type_high_bound. */
8582 if (type_high_bound
&& TREE_CODE (type_high_bound
) == INTEGER_CST
)
8584 if (tree_int_cst_lt (type_high_bound
, c
))
8586 ok_for_high_bound
= true;
8589 ok_for_high_bound
= false;
8591 /* If the constant fits both bounds, the result is known. */
8592 if (ok_for_low_bound
&& ok_for_high_bound
)
8595 /* Perform some generic filtering which may allow making a decision
8596 even if the bounds are not constant. First, negative integers
8597 never fit in unsigned types, */
8598 if (TYPE_UNSIGNED (type
) && sgn_c
== SIGNED
&& wi::neg_p (c
))
8601 /* Second, narrower types always fit in wider ones. */
8602 if (TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (c
)))
8605 /* Third, unsigned integers with top bit set never fit signed types. */
8606 if (!TYPE_UNSIGNED (type
) && sgn_c
== UNSIGNED
)
8608 int prec
= GET_MODE_PRECISION (TYPE_MODE (TREE_TYPE (c
))) - 1;
8609 if (prec
< TYPE_PRECISION (TREE_TYPE (c
)))
8611 /* When a tree_cst is converted to a wide-int, the precision
8612 is taken from the type. However, if the precision of the
8613 mode underneath the type is smaller than that, it is
8614 possible that the value will not fit. The test below
8615 fails if any bit is set between the sign bit of the
8616 underlying mode and the top bit of the type. */
8617 if (wi::ne_p (wi::zext (c
, prec
- 1), c
))
8620 else if (wi::neg_p (c
))
8624 /* If we haven't been able to decide at this point, there nothing more we
8625 can check ourselves here. Look at the base type if we have one and it
8626 has the same precision. */
8627 if (TREE_CODE (type
) == INTEGER_TYPE
8628 && TREE_TYPE (type
) != 0
8629 && TYPE_PRECISION (type
) == TYPE_PRECISION (TREE_TYPE (type
)))
8631 type
= TREE_TYPE (type
);
8635 /* Or to fits_to_tree_p, if nothing else. */
8636 return wi::fits_to_tree_p (c
, type
);
8639 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
8640 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
8641 represented (assuming two's-complement arithmetic) within the bit
8642 precision of the type are returned instead. */
8645 get_type_static_bounds (const_tree type
, mpz_t min
, mpz_t max
)
8647 if (!POINTER_TYPE_P (type
) && TYPE_MIN_VALUE (type
)
8648 && TREE_CODE (TYPE_MIN_VALUE (type
)) == INTEGER_CST
)
8649 wi::to_mpz (TYPE_MIN_VALUE (type
), min
, TYPE_SIGN (type
));
8652 if (TYPE_UNSIGNED (type
))
8653 mpz_set_ui (min
, 0);
8656 wide_int mn
= wi::min_value (TYPE_PRECISION (type
), SIGNED
);
8657 wi::to_mpz (mn
, min
, SIGNED
);
8661 if (!POINTER_TYPE_P (type
) && TYPE_MAX_VALUE (type
)
8662 && TREE_CODE (TYPE_MAX_VALUE (type
)) == INTEGER_CST
)
8663 wi::to_mpz (TYPE_MAX_VALUE (type
), max
, TYPE_SIGN (type
));
8666 wide_int mn
= wi::max_value (TYPE_PRECISION (type
), TYPE_SIGN (type
));
8667 wi::to_mpz (mn
, max
, TYPE_SIGN (type
));
8671 /* Return true if VAR is an automatic variable defined in function FN. */
8674 auto_var_in_fn_p (const_tree var
, const_tree fn
)
8676 return (DECL_P (var
) && DECL_CONTEXT (var
) == fn
8677 && ((((TREE_CODE (var
) == VAR_DECL
&& ! DECL_EXTERNAL (var
))
8678 || TREE_CODE (var
) == PARM_DECL
)
8679 && ! TREE_STATIC (var
))
8680 || TREE_CODE (var
) == LABEL_DECL
8681 || TREE_CODE (var
) == RESULT_DECL
));
8684 /* Subprogram of following function. Called by walk_tree.
8686 Return *TP if it is an automatic variable or parameter of the
8687 function passed in as DATA. */
8690 find_var_from_fn (tree
*tp
, int *walk_subtrees
, void *data
)
8692 tree fn
= (tree
) data
;
8697 else if (DECL_P (*tp
)
8698 && auto_var_in_fn_p (*tp
, fn
))
8704 /* Returns true if T is, contains, or refers to a type with variable
8705 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
8706 arguments, but not the return type. If FN is nonzero, only return
8707 true if a modifier of the type or position of FN is a variable or
8708 parameter inside FN.
8710 This concept is more general than that of C99 'variably modified types':
8711 in C99, a struct type is never variably modified because a VLA may not
8712 appear as a structure member. However, in GNU C code like:
8714 struct S { int i[f()]; };
8716 is valid, and other languages may define similar constructs. */
8719 variably_modified_type_p (tree type
, tree fn
)
8723 /* Test if T is either variable (if FN is zero) or an expression containing
8724 a variable in FN. If TYPE isn't gimplified, return true also if
8725 gimplify_one_sizepos would gimplify the expression into a local
8727 #define RETURN_TRUE_IF_VAR(T) \
8728 do { tree _t = (T); \
8729 if (_t != NULL_TREE \
8730 && _t != error_mark_node \
8731 && TREE_CODE (_t) != INTEGER_CST \
8732 && TREE_CODE (_t) != PLACEHOLDER_EXPR \
8734 || (!TYPE_SIZES_GIMPLIFIED (type) \
8735 && !is_gimple_sizepos (_t)) \
8736 || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
8737 return true; } while (0)
8739 if (type
== error_mark_node
)
8742 /* If TYPE itself has variable size, it is variably modified. */
8743 RETURN_TRUE_IF_VAR (TYPE_SIZE (type
));
8744 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type
));
8746 switch (TREE_CODE (type
))
8749 case REFERENCE_TYPE
:
8751 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
8757 /* If TYPE is a function type, it is variably modified if the
8758 return type is variably modified. */
8759 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
8765 case FIXED_POINT_TYPE
:
8768 /* Scalar types are variably modified if their end points
8770 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type
));
8771 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type
));
8776 case QUAL_UNION_TYPE
:
8777 /* We can't see if any of the fields are variably-modified by the
8778 definition we normally use, since that would produce infinite
8779 recursion via pointers. */
8780 /* This is variably modified if some field's type is. */
8781 for (t
= TYPE_FIELDS (type
); t
; t
= DECL_CHAIN (t
))
8782 if (TREE_CODE (t
) == FIELD_DECL
)
8784 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t
));
8785 RETURN_TRUE_IF_VAR (DECL_SIZE (t
));
8786 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t
));
8788 if (TREE_CODE (type
) == QUAL_UNION_TYPE
)
8789 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t
));
8794 /* Do not call ourselves to avoid infinite recursion. This is
8795 variably modified if the element type is. */
8796 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type
)));
8797 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type
)));
8804 /* The current language may have other cases to check, but in general,
8805 all other types are not variably modified. */
8806 return lang_hooks
.tree_inlining
.var_mod_type_p (type
, fn
);
8808 #undef RETURN_TRUE_IF_VAR
8811 /* Given a DECL or TYPE, return the scope in which it was declared, or
8812 NULL_TREE if there is no containing scope. */
8815 get_containing_scope (const_tree t
)
8817 return (TYPE_P (t
) ? TYPE_CONTEXT (t
) : DECL_CONTEXT (t
));
8820 /* Return the innermost context enclosing DECL that is
8821 a FUNCTION_DECL, or zero if none. */
8824 decl_function_context (const_tree decl
)
8828 if (TREE_CODE (decl
) == ERROR_MARK
)
8831 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
8832 where we look up the function at runtime. Such functions always take
8833 a first argument of type 'pointer to real context'.
8835 C++ should really be fixed to use DECL_CONTEXT for the real context,
8836 and use something else for the "virtual context". */
8837 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VINDEX (decl
))
8840 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl
)))));
8842 context
= DECL_CONTEXT (decl
);
8844 while (context
&& TREE_CODE (context
) != FUNCTION_DECL
)
8846 if (TREE_CODE (context
) == BLOCK
)
8847 context
= BLOCK_SUPERCONTEXT (context
);
8849 context
= get_containing_scope (context
);
8855 /* Return the innermost context enclosing DECL that is
8856 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
8857 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
8860 decl_type_context (const_tree decl
)
8862 tree context
= DECL_CONTEXT (decl
);
8865 switch (TREE_CODE (context
))
8867 case NAMESPACE_DECL
:
8868 case TRANSLATION_UNIT_DECL
:
8873 case QUAL_UNION_TYPE
:
8878 context
= DECL_CONTEXT (context
);
8882 context
= BLOCK_SUPERCONTEXT (context
);
8892 /* CALL is a CALL_EXPR. Return the declaration for the function
8893 called, or NULL_TREE if the called function cannot be
8897 get_callee_fndecl (const_tree call
)
8901 if (call
== error_mark_node
)
8902 return error_mark_node
;
8904 /* It's invalid to call this function with anything but a
8906 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
8908 /* The first operand to the CALL is the address of the function
8910 addr
= CALL_EXPR_FN (call
);
8912 /* If there is no function, return early. */
8913 if (addr
== NULL_TREE
)
8918 /* If this is a readonly function pointer, extract its initial value. */
8919 if (DECL_P (addr
) && TREE_CODE (addr
) != FUNCTION_DECL
8920 && TREE_READONLY (addr
) && ! TREE_THIS_VOLATILE (addr
)
8921 && DECL_INITIAL (addr
))
8922 addr
= DECL_INITIAL (addr
);
8924 /* If the address is just `&f' for some function `f', then we know
8925 that `f' is being called. */
8926 if (TREE_CODE (addr
) == ADDR_EXPR
8927 && TREE_CODE (TREE_OPERAND (addr
, 0)) == FUNCTION_DECL
)
8928 return TREE_OPERAND (addr
, 0);
8930 /* We couldn't figure out what was being called. */
8934 /* Print debugging information about tree nodes generated during the compile,
8935 and any language-specific information. */
8938 dump_tree_statistics (void)
8940 if (GATHER_STATISTICS
)
8943 int total_nodes
, total_bytes
;
8944 fprintf (stderr
, "Kind Nodes Bytes\n");
8945 fprintf (stderr
, "---------------------------------------\n");
8946 total_nodes
= total_bytes
= 0;
8947 for (i
= 0; i
< (int) all_kinds
; i
++)
8949 fprintf (stderr
, "%-20s %7d %10d\n", tree_node_kind_names
[i
],
8950 tree_node_counts
[i
], tree_node_sizes
[i
]);
8951 total_nodes
+= tree_node_counts
[i
];
8952 total_bytes
+= tree_node_sizes
[i
];
8954 fprintf (stderr
, "---------------------------------------\n");
8955 fprintf (stderr
, "%-20s %7d %10d\n", "Total", total_nodes
, total_bytes
);
8956 fprintf (stderr
, "---------------------------------------\n");
8957 fprintf (stderr
, "Code Nodes\n");
8958 fprintf (stderr
, "----------------------------\n");
8959 for (i
= 0; i
< (int) MAX_TREE_CODES
; i
++)
8960 fprintf (stderr
, "%-20s %7d\n", get_tree_code_name ((enum tree_code
) i
),
8961 tree_code_counts
[i
]);
8962 fprintf (stderr
, "----------------------------\n");
8963 ssanames_print_statistics ();
8964 phinodes_print_statistics ();
8967 fprintf (stderr
, "(No per-node statistics)\n");
8969 print_type_hash_statistics ();
8970 print_debug_expr_statistics ();
8971 print_value_expr_statistics ();
8972 lang_hooks
.print_statistics ();
8975 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
8977 /* Generate a crc32 of a byte. */
8980 crc32_unsigned_bits (unsigned chksum
, unsigned value
, unsigned bits
)
8984 for (ix
= bits
; ix
--; value
<<= 1)
8988 feedback
= (value
^ chksum
) & 0x80000000 ? 0x04c11db7 : 0;
8995 /* Generate a crc32 of a 32-bit unsigned. */
8998 crc32_unsigned (unsigned chksum
, unsigned value
)
9000 return crc32_unsigned_bits (chksum
, value
, 32);
9003 /* Generate a crc32 of a byte. */
9006 crc32_byte (unsigned chksum
, char byte
)
9008 return crc32_unsigned_bits (chksum
, (unsigned) byte
<< 24, 8);
9011 /* Generate a crc32 of a string. */
9014 crc32_string (unsigned chksum
, const char *string
)
9018 chksum
= crc32_byte (chksum
, *string
);
9024 /* P is a string that will be used in a symbol. Mask out any characters
9025 that are not valid in that context. */
9028 clean_symbol_name (char *p
)
9032 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
9035 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
9042 /* Generate a name for a special-purpose function.
9043 The generated name may need to be unique across the whole link.
9044 Changes to this function may also require corresponding changes to
9045 xstrdup_mask_random.
9046 TYPE is some string to identify the purpose of this function to the
9047 linker or collect2; it must start with an uppercase letter,
9049 I - for constructors
9051 N - for C++ anonymous namespaces
9052 F - for DWARF unwind frame information. */
9055 get_file_function_name (const char *type
)
9061 /* If we already have a name we know to be unique, just use that. */
9062 if (first_global_object_name
)
9063 p
= q
= ASTRDUP (first_global_object_name
);
9064 /* If the target is handling the constructors/destructors, they
9065 will be local to this file and the name is only necessary for
9067 We also assign sub_I and sub_D sufixes to constructors called from
9068 the global static constructors. These are always local. */
9069 else if (((type
[0] == 'I' || type
[0] == 'D') && targetm
.have_ctors_dtors
)
9070 || (strncmp (type
, "sub_", 4) == 0
9071 && (type
[4] == 'I' || type
[4] == 'D')))
9073 const char *file
= main_input_filename
;
9075 file
= LOCATION_FILE (input_location
);
9076 /* Just use the file's basename, because the full pathname
9077 might be quite long. */
9078 p
= q
= ASTRDUP (lbasename (file
));
9082 /* Otherwise, the name must be unique across the entire link.
9083 We don't have anything that we know to be unique to this translation
9084 unit, so use what we do have and throw in some randomness. */
9086 const char *name
= weak_global_object_name
;
9087 const char *file
= main_input_filename
;
9092 file
= LOCATION_FILE (input_location
);
9094 len
= strlen (file
);
9095 q
= (char *) alloca (9 + 17 + len
+ 1);
9096 memcpy (q
, file
, len
+ 1);
9098 snprintf (q
+ len
, 9 + 17 + 1, "_%08X_" HOST_WIDE_INT_PRINT_HEX
,
9099 crc32_string (0, name
), get_random_seed (false));
9104 clean_symbol_name (q
);
9105 buf
= (char *) alloca (sizeof (FILE_FUNCTION_FORMAT
) + strlen (p
)
9108 /* Set up the name of the file-level functions we may need.
9109 Use a global object (which is already required to be unique over
9110 the program) rather than the file name (which imposes extra
9112 sprintf (buf
, FILE_FUNCTION_FORMAT
, type
, p
);
9114 return get_identifier (buf
);
9117 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
9119 /* Complain that the tree code of NODE does not match the expected 0
9120 terminated list of trailing codes. The trailing code list can be
9121 empty, for a more vague error message. FILE, LINE, and FUNCTION
9122 are of the caller. */
9125 tree_check_failed (const_tree node
, const char *file
,
9126 int line
, const char *function
, ...)
9130 unsigned length
= 0;
9131 enum tree_code code
;
9133 va_start (args
, function
);
9134 while ((code
= (enum tree_code
) va_arg (args
, int)))
9135 length
+= 4 + strlen (get_tree_code_name (code
));
9140 va_start (args
, function
);
9141 length
+= strlen ("expected ");
9142 buffer
= tmp
= (char *) alloca (length
);
9144 while ((code
= (enum tree_code
) va_arg (args
, int)))
9146 const char *prefix
= length
? " or " : "expected ";
9148 strcpy (tmp
+ length
, prefix
);
9149 length
+= strlen (prefix
);
9150 strcpy (tmp
+ length
, get_tree_code_name (code
));
9151 length
+= strlen (get_tree_code_name (code
));
9156 buffer
= "unexpected node";
9158 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9159 buffer
, get_tree_code_name (TREE_CODE (node
)),
9160 function
, trim_filename (file
), line
);
9163 /* Complain that the tree code of NODE does match the expected 0
9164 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
9168 tree_not_check_failed (const_tree node
, const char *file
,
9169 int line
, const char *function
, ...)
9173 unsigned length
= 0;
9174 enum tree_code code
;
9176 va_start (args
, function
);
9177 while ((code
= (enum tree_code
) va_arg (args
, int)))
9178 length
+= 4 + strlen (get_tree_code_name (code
));
9180 va_start (args
, function
);
9181 buffer
= (char *) alloca (length
);
9183 while ((code
= (enum tree_code
) va_arg (args
, int)))
9187 strcpy (buffer
+ length
, " or ");
9190 strcpy (buffer
+ length
, get_tree_code_name (code
));
9191 length
+= strlen (get_tree_code_name (code
));
9195 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
9196 buffer
, get_tree_code_name (TREE_CODE (node
)),
9197 function
, trim_filename (file
), line
);
9200 /* Similar to tree_check_failed, except that we check for a class of tree
9201 code, given in CL. */
9204 tree_class_check_failed (const_tree node
, const enum tree_code_class cl
,
9205 const char *file
, int line
, const char *function
)
9208 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
9209 TREE_CODE_CLASS_STRING (cl
),
9210 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
9211 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9214 /* Similar to tree_check_failed, except that instead of specifying a
9215 dozen codes, use the knowledge that they're all sequential. */
9218 tree_range_check_failed (const_tree node
, const char *file
, int line
,
9219 const char *function
, enum tree_code c1
,
9223 unsigned length
= 0;
9226 for (c
= c1
; c
<= c2
; ++c
)
9227 length
+= 4 + strlen (get_tree_code_name ((enum tree_code
) c
));
9229 length
+= strlen ("expected ");
9230 buffer
= (char *) alloca (length
);
9233 for (c
= c1
; c
<= c2
; ++c
)
9235 const char *prefix
= length
? " or " : "expected ";
9237 strcpy (buffer
+ length
, prefix
);
9238 length
+= strlen (prefix
);
9239 strcpy (buffer
+ length
, get_tree_code_name ((enum tree_code
) c
));
9240 length
+= strlen (get_tree_code_name ((enum tree_code
) c
));
9243 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9244 buffer
, get_tree_code_name (TREE_CODE (node
)),
9245 function
, trim_filename (file
), line
);
9249 /* Similar to tree_check_failed, except that we check that a tree does
9250 not have the specified code, given in CL. */
9253 tree_not_class_check_failed (const_tree node
, const enum tree_code_class cl
,
9254 const char *file
, int line
, const char *function
)
9257 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
9258 TREE_CODE_CLASS_STRING (cl
),
9259 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
9260 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9264 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
9267 omp_clause_check_failed (const_tree node
, const char *file
, int line
,
9268 const char *function
, enum omp_clause_code code
)
9270 internal_error ("tree check: expected omp_clause %s, have %s in %s, at %s:%d",
9271 omp_clause_code_name
[code
], get_tree_code_name (TREE_CODE (node
)),
9272 function
, trim_filename (file
), line
);
9276 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
9279 omp_clause_range_check_failed (const_tree node
, const char *file
, int line
,
9280 const char *function
, enum omp_clause_code c1
,
9281 enum omp_clause_code c2
)
9284 unsigned length
= 0;
9287 for (c
= c1
; c
<= c2
; ++c
)
9288 length
+= 4 + strlen (omp_clause_code_name
[c
]);
9290 length
+= strlen ("expected ");
9291 buffer
= (char *) alloca (length
);
9294 for (c
= c1
; c
<= c2
; ++c
)
9296 const char *prefix
= length
? " or " : "expected ";
9298 strcpy (buffer
+ length
, prefix
);
9299 length
+= strlen (prefix
);
9300 strcpy (buffer
+ length
, omp_clause_code_name
[c
]);
9301 length
+= strlen (omp_clause_code_name
[c
]);
9304 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9305 buffer
, omp_clause_code_name
[TREE_CODE (node
)],
9306 function
, trim_filename (file
), line
);
9310 #undef DEFTREESTRUCT
9311 #define DEFTREESTRUCT(VAL, NAME) NAME,
9313 static const char *ts_enum_names
[] = {
9314 #include "treestruct.def"
9316 #undef DEFTREESTRUCT
9318 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
9320 /* Similar to tree_class_check_failed, except that we check for
9321 whether CODE contains the tree structure identified by EN. */
9324 tree_contains_struct_check_failed (const_tree node
,
9325 const enum tree_node_structure_enum en
,
9326 const char *file
, int line
,
9327 const char *function
)
9330 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
9332 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9336 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9337 (dynamically sized) vector. */
9340 tree_int_cst_elt_check_failed (int idx
, int len
, const char *file
, int line
,
9341 const char *function
)
9344 ("tree check: accessed elt %d of tree_int_cst with %d elts in %s, at %s:%d",
9345 idx
+ 1, len
, function
, trim_filename (file
), line
);
9348 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9349 (dynamically sized) vector. */
9352 tree_vec_elt_check_failed (int idx
, int len
, const char *file
, int line
,
9353 const char *function
)
9356 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
9357 idx
+ 1, len
, function
, trim_filename (file
), line
);
9360 /* Similar to above, except that the check is for the bounds of the operand
9361 vector of an expression node EXP. */
9364 tree_operand_check_failed (int idx
, const_tree exp
, const char *file
,
9365 int line
, const char *function
)
9367 enum tree_code code
= TREE_CODE (exp
);
9369 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
9370 idx
+ 1, get_tree_code_name (code
), TREE_OPERAND_LENGTH (exp
),
9371 function
, trim_filename (file
), line
);
9374 /* Similar to above, except that the check is for the number of
9375 operands of an OMP_CLAUSE node. */
9378 omp_clause_operand_check_failed (int idx
, const_tree t
, const char *file
,
9379 int line
, const char *function
)
9382 ("tree check: accessed operand %d of omp_clause %s with %d operands "
9383 "in %s, at %s:%d", idx
+ 1, omp_clause_code_name
[OMP_CLAUSE_CODE (t
)],
9384 omp_clause_num_ops
[OMP_CLAUSE_CODE (t
)], function
,
9385 trim_filename (file
), line
);
9387 #endif /* ENABLE_TREE_CHECKING */
9389 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
9390 and mapped to the machine mode MODE. Initialize its fields and build
9391 the information necessary for debugging output. */
9394 make_vector_type (tree innertype
, int nunits
, enum machine_mode mode
)
9397 inchash::hash hstate
;
9399 t
= make_node (VECTOR_TYPE
);
9400 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (innertype
);
9401 SET_TYPE_VECTOR_SUBPARTS (t
, nunits
);
9402 SET_TYPE_MODE (t
, mode
);
9404 if (TYPE_STRUCTURAL_EQUALITY_P (innertype
))
9405 SET_TYPE_STRUCTURAL_EQUALITY (t
);
9406 else if (TYPE_CANONICAL (innertype
) != innertype
9407 || mode
!= VOIDmode
)
9409 = make_vector_type (TYPE_CANONICAL (innertype
), nunits
, VOIDmode
);
9413 hstate
.add_wide_int (VECTOR_TYPE
);
9414 hstate
.add_wide_int (nunits
);
9415 hstate
.add_wide_int (mode
);
9416 hstate
.add_object (TYPE_HASH (TREE_TYPE (t
)));
9417 t
= type_hash_canon (hstate
.end (), t
);
9419 /* We have built a main variant, based on the main variant of the
9420 inner type. Use it to build the variant we return. */
9421 if ((TYPE_ATTRIBUTES (innertype
) || TYPE_QUALS (innertype
))
9422 && TREE_TYPE (t
) != innertype
)
9423 return build_type_attribute_qual_variant (t
,
9424 TYPE_ATTRIBUTES (innertype
),
9425 TYPE_QUALS (innertype
));
9431 make_or_reuse_type (unsigned size
, int unsignedp
)
9433 if (size
== INT_TYPE_SIZE
)
9434 return unsignedp
? unsigned_type_node
: integer_type_node
;
9435 if (size
== CHAR_TYPE_SIZE
)
9436 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
9437 if (size
== SHORT_TYPE_SIZE
)
9438 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
9439 if (size
== LONG_TYPE_SIZE
)
9440 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
9441 if (size
== LONG_LONG_TYPE_SIZE
)
9442 return (unsignedp
? long_long_unsigned_type_node
9443 : long_long_integer_type_node
);
9444 if (size
== 128 && int128_integer_type_node
)
9445 return (unsignedp
? int128_unsigned_type_node
9446 : int128_integer_type_node
);
9449 return make_unsigned_type (size
);
9451 return make_signed_type (size
);
9454 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
9457 make_or_reuse_fract_type (unsigned size
, int unsignedp
, int satp
)
9461 if (size
== SHORT_FRACT_TYPE_SIZE
)
9462 return unsignedp
? sat_unsigned_short_fract_type_node
9463 : sat_short_fract_type_node
;
9464 if (size
== FRACT_TYPE_SIZE
)
9465 return unsignedp
? sat_unsigned_fract_type_node
: sat_fract_type_node
;
9466 if (size
== LONG_FRACT_TYPE_SIZE
)
9467 return unsignedp
? sat_unsigned_long_fract_type_node
9468 : sat_long_fract_type_node
;
9469 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
9470 return unsignedp
? sat_unsigned_long_long_fract_type_node
9471 : sat_long_long_fract_type_node
;
9475 if (size
== SHORT_FRACT_TYPE_SIZE
)
9476 return unsignedp
? unsigned_short_fract_type_node
9477 : short_fract_type_node
;
9478 if (size
== FRACT_TYPE_SIZE
)
9479 return unsignedp
? unsigned_fract_type_node
: fract_type_node
;
9480 if (size
== LONG_FRACT_TYPE_SIZE
)
9481 return unsignedp
? unsigned_long_fract_type_node
9482 : long_fract_type_node
;
9483 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
9484 return unsignedp
? unsigned_long_long_fract_type_node
9485 : long_long_fract_type_node
;
9488 return make_fract_type (size
, unsignedp
, satp
);
9491 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
9494 make_or_reuse_accum_type (unsigned size
, int unsignedp
, int satp
)
9498 if (size
== SHORT_ACCUM_TYPE_SIZE
)
9499 return unsignedp
? sat_unsigned_short_accum_type_node
9500 : sat_short_accum_type_node
;
9501 if (size
== ACCUM_TYPE_SIZE
)
9502 return unsignedp
? sat_unsigned_accum_type_node
: sat_accum_type_node
;
9503 if (size
== LONG_ACCUM_TYPE_SIZE
)
9504 return unsignedp
? sat_unsigned_long_accum_type_node
9505 : sat_long_accum_type_node
;
9506 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
9507 return unsignedp
? sat_unsigned_long_long_accum_type_node
9508 : sat_long_long_accum_type_node
;
9512 if (size
== SHORT_ACCUM_TYPE_SIZE
)
9513 return unsignedp
? unsigned_short_accum_type_node
9514 : short_accum_type_node
;
9515 if (size
== ACCUM_TYPE_SIZE
)
9516 return unsignedp
? unsigned_accum_type_node
: accum_type_node
;
9517 if (size
== LONG_ACCUM_TYPE_SIZE
)
9518 return unsignedp
? unsigned_long_accum_type_node
9519 : long_accum_type_node
;
9520 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
9521 return unsignedp
? unsigned_long_long_accum_type_node
9522 : long_long_accum_type_node
;
9525 return make_accum_type (size
, unsignedp
, satp
);
9529 /* Create an atomic variant node for TYPE. This routine is called
9530 during initialization of data types to create the 5 basic atomic
9531 types. The generic build_variant_type function requires these to
9532 already be set up in order to function properly, so cannot be
9533 called from there. If ALIGN is non-zero, then ensure alignment is
9534 overridden to this value. */
9537 build_atomic_base (tree type
, unsigned int align
)
9541 /* Make sure its not already registered. */
9542 if ((t
= get_qualified_type (type
, TYPE_QUAL_ATOMIC
)))
9545 t
= build_variant_type_copy (type
);
9546 set_type_quals (t
, TYPE_QUAL_ATOMIC
);
9549 TYPE_ALIGN (t
) = align
;
9554 /* Create nodes for all integer types (and error_mark_node) using the sizes
9555 of C datatypes. SIGNED_CHAR specifies whether char is signed,
9556 SHORT_DOUBLE specifies whether double should be of the same precision
9560 build_common_tree_nodes (bool signed_char
, bool short_double
)
9562 error_mark_node
= make_node (ERROR_MARK
);
9563 TREE_TYPE (error_mark_node
) = error_mark_node
;
9565 initialize_sizetypes ();
9567 /* Define both `signed char' and `unsigned char'. */
9568 signed_char_type_node
= make_signed_type (CHAR_TYPE_SIZE
);
9569 TYPE_STRING_FLAG (signed_char_type_node
) = 1;
9570 unsigned_char_type_node
= make_unsigned_type (CHAR_TYPE_SIZE
);
9571 TYPE_STRING_FLAG (unsigned_char_type_node
) = 1;
9573 /* Define `char', which is like either `signed char' or `unsigned char'
9574 but not the same as either. */
9577 ? make_signed_type (CHAR_TYPE_SIZE
)
9578 : make_unsigned_type (CHAR_TYPE_SIZE
));
9579 TYPE_STRING_FLAG (char_type_node
) = 1;
9581 short_integer_type_node
= make_signed_type (SHORT_TYPE_SIZE
);
9582 short_unsigned_type_node
= make_unsigned_type (SHORT_TYPE_SIZE
);
9583 integer_type_node
= make_signed_type (INT_TYPE_SIZE
);
9584 unsigned_type_node
= make_unsigned_type (INT_TYPE_SIZE
);
9585 long_integer_type_node
= make_signed_type (LONG_TYPE_SIZE
);
9586 long_unsigned_type_node
= make_unsigned_type (LONG_TYPE_SIZE
);
9587 long_long_integer_type_node
= make_signed_type (LONG_LONG_TYPE_SIZE
);
9588 long_long_unsigned_type_node
= make_unsigned_type (LONG_LONG_TYPE_SIZE
);
9589 #if HOST_BITS_PER_WIDE_INT >= 64
9590 /* TODO: This isn't correct, but as logic depends at the moment on
9591 host's instead of target's wide-integer.
9592 If there is a target not supporting TImode, but has an 128-bit
9593 integer-scalar register, this target check needs to be adjusted. */
9594 if (targetm
.scalar_mode_supported_p (TImode
))
9596 int128_integer_type_node
= make_signed_type (128);
9597 int128_unsigned_type_node
= make_unsigned_type (128);
9601 /* Define a boolean type. This type only represents boolean values but
9602 may be larger than char depending on the value of BOOL_TYPE_SIZE. */
9603 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
9604 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
9605 TYPE_PRECISION (boolean_type_node
) = 1;
9606 TYPE_MAX_VALUE (boolean_type_node
) = build_int_cst (boolean_type_node
, 1);
9608 /* Define what type to use for size_t. */
9609 if (strcmp (SIZE_TYPE
, "unsigned int") == 0)
9610 size_type_node
= unsigned_type_node
;
9611 else if (strcmp (SIZE_TYPE
, "long unsigned int") == 0)
9612 size_type_node
= long_unsigned_type_node
;
9613 else if (strcmp (SIZE_TYPE
, "long long unsigned int") == 0)
9614 size_type_node
= long_long_unsigned_type_node
;
9615 else if (strcmp (SIZE_TYPE
, "short unsigned int") == 0)
9616 size_type_node
= short_unsigned_type_node
;
9620 /* Fill in the rest of the sized types. Reuse existing type nodes
9622 intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 0);
9623 intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 0);
9624 intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 0);
9625 intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 0);
9626 intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 0);
9628 unsigned_intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 1);
9629 unsigned_intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 1);
9630 unsigned_intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 1);
9631 unsigned_intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 1);
9632 unsigned_intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 1);
9634 /* Don't call build_qualified type for atomics. That routine does
9635 special processing for atomics, and until they are initialized
9636 it's better not to make that call.
9638 Check to see if there is a target override for atomic types. */
9640 atomicQI_type_node
= build_atomic_base (unsigned_intQI_type_node
,
9641 targetm
.atomic_align_for_mode (QImode
));
9642 atomicHI_type_node
= build_atomic_base (unsigned_intHI_type_node
,
9643 targetm
.atomic_align_for_mode (HImode
));
9644 atomicSI_type_node
= build_atomic_base (unsigned_intSI_type_node
,
9645 targetm
.atomic_align_for_mode (SImode
));
9646 atomicDI_type_node
= build_atomic_base (unsigned_intDI_type_node
,
9647 targetm
.atomic_align_for_mode (DImode
));
9648 atomicTI_type_node
= build_atomic_base (unsigned_intTI_type_node
,
9649 targetm
.atomic_align_for_mode (TImode
));
9651 access_public_node
= get_identifier ("public");
9652 access_protected_node
= get_identifier ("protected");
9653 access_private_node
= get_identifier ("private");
9655 /* Define these next since types below may used them. */
9656 integer_zero_node
= build_int_cst (integer_type_node
, 0);
9657 integer_one_node
= build_int_cst (integer_type_node
, 1);
9658 integer_three_node
= build_int_cst (integer_type_node
, 3);
9659 integer_minus_one_node
= build_int_cst (integer_type_node
, -1);
9661 size_zero_node
= size_int (0);
9662 size_one_node
= size_int (1);
9663 bitsize_zero_node
= bitsize_int (0);
9664 bitsize_one_node
= bitsize_int (1);
9665 bitsize_unit_node
= bitsize_int (BITS_PER_UNIT
);
9667 boolean_false_node
= TYPE_MIN_VALUE (boolean_type_node
);
9668 boolean_true_node
= TYPE_MAX_VALUE (boolean_type_node
);
9670 void_type_node
= make_node (VOID_TYPE
);
9671 layout_type (void_type_node
);
9673 /* We are not going to have real types in C with less than byte alignment,
9674 so we might as well not have any types that claim to have it. */
9675 TYPE_ALIGN (void_type_node
) = BITS_PER_UNIT
;
9676 TYPE_USER_ALIGN (void_type_node
) = 0;
9678 void_node
= make_node (VOID_CST
);
9679 TREE_TYPE (void_node
) = void_type_node
;
9681 null_pointer_node
= build_int_cst (build_pointer_type (void_type_node
), 0);
9682 layout_type (TREE_TYPE (null_pointer_node
));
9684 ptr_type_node
= build_pointer_type (void_type_node
);
9686 = build_pointer_type (build_type_variant (void_type_node
, 1, 0));
9687 fileptr_type_node
= ptr_type_node
;
9689 pointer_sized_int_node
= build_nonstandard_integer_type (POINTER_SIZE
, 1);
9691 float_type_node
= make_node (REAL_TYPE
);
9692 TYPE_PRECISION (float_type_node
) = FLOAT_TYPE_SIZE
;
9693 layout_type (float_type_node
);
9695 double_type_node
= make_node (REAL_TYPE
);
9697 TYPE_PRECISION (double_type_node
) = FLOAT_TYPE_SIZE
;
9699 TYPE_PRECISION (double_type_node
) = DOUBLE_TYPE_SIZE
;
9700 layout_type (double_type_node
);
9702 long_double_type_node
= make_node (REAL_TYPE
);
9703 TYPE_PRECISION (long_double_type_node
) = LONG_DOUBLE_TYPE_SIZE
;
9704 layout_type (long_double_type_node
);
9706 float_ptr_type_node
= build_pointer_type (float_type_node
);
9707 double_ptr_type_node
= build_pointer_type (double_type_node
);
9708 long_double_ptr_type_node
= build_pointer_type (long_double_type_node
);
9709 integer_ptr_type_node
= build_pointer_type (integer_type_node
);
9711 /* Fixed size integer types. */
9712 uint16_type_node
= make_or_reuse_type (16, 1);
9713 uint32_type_node
= make_or_reuse_type (32, 1);
9714 uint64_type_node
= make_or_reuse_type (64, 1);
9716 /* Decimal float types. */
9717 dfloat32_type_node
= make_node (REAL_TYPE
);
9718 TYPE_PRECISION (dfloat32_type_node
) = DECIMAL32_TYPE_SIZE
;
9719 layout_type (dfloat32_type_node
);
9720 SET_TYPE_MODE (dfloat32_type_node
, SDmode
);
9721 dfloat32_ptr_type_node
= build_pointer_type (dfloat32_type_node
);
9723 dfloat64_type_node
= make_node (REAL_TYPE
);
9724 TYPE_PRECISION (dfloat64_type_node
) = DECIMAL64_TYPE_SIZE
;
9725 layout_type (dfloat64_type_node
);
9726 SET_TYPE_MODE (dfloat64_type_node
, DDmode
);
9727 dfloat64_ptr_type_node
= build_pointer_type (dfloat64_type_node
);
9729 dfloat128_type_node
= make_node (REAL_TYPE
);
9730 TYPE_PRECISION (dfloat128_type_node
) = DECIMAL128_TYPE_SIZE
;
9731 layout_type (dfloat128_type_node
);
9732 SET_TYPE_MODE (dfloat128_type_node
, TDmode
);
9733 dfloat128_ptr_type_node
= build_pointer_type (dfloat128_type_node
);
9735 complex_integer_type_node
= build_complex_type (integer_type_node
);
9736 complex_float_type_node
= build_complex_type (float_type_node
);
9737 complex_double_type_node
= build_complex_type (double_type_node
);
9738 complex_long_double_type_node
= build_complex_type (long_double_type_node
);
9740 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
9741 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
9742 sat_ ## KIND ## _type_node = \
9743 make_sat_signed_ ## KIND ## _type (SIZE); \
9744 sat_unsigned_ ## KIND ## _type_node = \
9745 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9746 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9747 unsigned_ ## KIND ## _type_node = \
9748 make_unsigned_ ## KIND ## _type (SIZE);
9750 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
9751 sat_ ## WIDTH ## KIND ## _type_node = \
9752 make_sat_signed_ ## KIND ## _type (SIZE); \
9753 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
9754 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9755 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9756 unsigned_ ## WIDTH ## KIND ## _type_node = \
9757 make_unsigned_ ## KIND ## _type (SIZE);
9759 /* Make fixed-point type nodes based on four different widths. */
9760 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
9761 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
9762 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
9763 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
9764 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
9766 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
9767 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
9768 NAME ## _type_node = \
9769 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
9770 u ## NAME ## _type_node = \
9771 make_or_reuse_unsigned_ ## KIND ## _type \
9772 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
9773 sat_ ## NAME ## _type_node = \
9774 make_or_reuse_sat_signed_ ## KIND ## _type \
9775 (GET_MODE_BITSIZE (MODE ## mode)); \
9776 sat_u ## NAME ## _type_node = \
9777 make_or_reuse_sat_unsigned_ ## KIND ## _type \
9778 (GET_MODE_BITSIZE (U ## MODE ## mode));
9780 /* Fixed-point type and mode nodes. */
9781 MAKE_FIXED_TYPE_NODE_FAMILY (fract
, FRACT
)
9782 MAKE_FIXED_TYPE_NODE_FAMILY (accum
, ACCUM
)
9783 MAKE_FIXED_MODE_NODE (fract
, qq
, QQ
)
9784 MAKE_FIXED_MODE_NODE (fract
, hq
, HQ
)
9785 MAKE_FIXED_MODE_NODE (fract
, sq
, SQ
)
9786 MAKE_FIXED_MODE_NODE (fract
, dq
, DQ
)
9787 MAKE_FIXED_MODE_NODE (fract
, tq
, TQ
)
9788 MAKE_FIXED_MODE_NODE (accum
, ha
, HA
)
9789 MAKE_FIXED_MODE_NODE (accum
, sa
, SA
)
9790 MAKE_FIXED_MODE_NODE (accum
, da
, DA
)
9791 MAKE_FIXED_MODE_NODE (accum
, ta
, TA
)
9794 tree t
= targetm
.build_builtin_va_list ();
9796 /* Many back-ends define record types without setting TYPE_NAME.
9797 If we copied the record type here, we'd keep the original
9798 record type without a name. This breaks name mangling. So,
9799 don't copy record types and let c_common_nodes_and_builtins()
9800 declare the type to be __builtin_va_list. */
9801 if (TREE_CODE (t
) != RECORD_TYPE
)
9802 t
= build_variant_type_copy (t
);
9804 va_list_type_node
= t
;
9808 /* Modify DECL for given flags.
9809 TM_PURE attribute is set only on types, so the function will modify
9810 DECL's type when ECF_TM_PURE is used. */
9813 set_call_expr_flags (tree decl
, int flags
)
9815 if (flags
& ECF_NOTHROW
)
9816 TREE_NOTHROW (decl
) = 1;
9817 if (flags
& ECF_CONST
)
9818 TREE_READONLY (decl
) = 1;
9819 if (flags
& ECF_PURE
)
9820 DECL_PURE_P (decl
) = 1;
9821 if (flags
& ECF_LOOPING_CONST_OR_PURE
)
9822 DECL_LOOPING_CONST_OR_PURE_P (decl
) = 1;
9823 if (flags
& ECF_NOVOPS
)
9824 DECL_IS_NOVOPS (decl
) = 1;
9825 if (flags
& ECF_NORETURN
)
9826 TREE_THIS_VOLATILE (decl
) = 1;
9827 if (flags
& ECF_MALLOC
)
9828 DECL_IS_MALLOC (decl
) = 1;
9829 if (flags
& ECF_RETURNS_TWICE
)
9830 DECL_IS_RETURNS_TWICE (decl
) = 1;
9831 if (flags
& ECF_LEAF
)
9832 DECL_ATTRIBUTES (decl
) = tree_cons (get_identifier ("leaf"),
9833 NULL
, DECL_ATTRIBUTES (decl
));
9834 if ((flags
& ECF_TM_PURE
) && flag_tm
)
9835 apply_tm_attr (decl
, get_identifier ("transaction_pure"));
9836 /* Looping const or pure is implied by noreturn.
9837 There is currently no way to declare looping const or looping pure alone. */
9838 gcc_assert (!(flags
& ECF_LOOPING_CONST_OR_PURE
)
9839 || ((flags
& ECF_NORETURN
) && (flags
& (ECF_CONST
| ECF_PURE
))));
9843 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
9846 local_define_builtin (const char *name
, tree type
, enum built_in_function code
,
9847 const char *library_name
, int ecf_flags
)
9851 decl
= add_builtin_function (name
, type
, code
, BUILT_IN_NORMAL
,
9852 library_name
, NULL_TREE
);
9853 set_call_expr_flags (decl
, ecf_flags
);
9855 set_builtin_decl (code
, decl
, true);
9858 /* Call this function after instantiating all builtins that the language
9859 front end cares about. This will build the rest of the builtins
9860 and internal functions that are relied upon by the tree optimizers and
9864 build_common_builtin_nodes (void)
9869 if (!builtin_decl_explicit_p (BUILT_IN_UNREACHABLE
))
9871 ftype
= build_function_type (void_type_node
, void_list_node
);
9872 local_define_builtin ("__builtin_unreachable", ftype
, BUILT_IN_UNREACHABLE
,
9873 "__builtin_unreachable",
9874 ECF_NOTHROW
| ECF_LEAF
| ECF_NORETURN
9875 | ECF_CONST
| ECF_LEAF
);
9878 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
)
9879 || !builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
9881 ftype
= build_function_type_list (ptr_type_node
,
9882 ptr_type_node
, const_ptr_type_node
,
9883 size_type_node
, NULL_TREE
);
9885 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
))
9886 local_define_builtin ("__builtin_memcpy", ftype
, BUILT_IN_MEMCPY
,
9887 "memcpy", ECF_NOTHROW
| ECF_LEAF
);
9888 if (!builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
9889 local_define_builtin ("__builtin_memmove", ftype
, BUILT_IN_MEMMOVE
,
9890 "memmove", ECF_NOTHROW
| ECF_LEAF
);
9893 if (!builtin_decl_explicit_p (BUILT_IN_MEMCMP
))
9895 ftype
= build_function_type_list (integer_type_node
, const_ptr_type_node
,
9896 const_ptr_type_node
, size_type_node
,
9898 local_define_builtin ("__builtin_memcmp", ftype
, BUILT_IN_MEMCMP
,
9899 "memcmp", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
9902 if (!builtin_decl_explicit_p (BUILT_IN_MEMSET
))
9904 ftype
= build_function_type_list (ptr_type_node
,
9905 ptr_type_node
, integer_type_node
,
9906 size_type_node
, NULL_TREE
);
9907 local_define_builtin ("__builtin_memset", ftype
, BUILT_IN_MEMSET
,
9908 "memset", ECF_NOTHROW
| ECF_LEAF
);
9911 if (!builtin_decl_explicit_p (BUILT_IN_ALLOCA
))
9913 ftype
= build_function_type_list (ptr_type_node
,
9914 size_type_node
, NULL_TREE
);
9915 local_define_builtin ("__builtin_alloca", ftype
, BUILT_IN_ALLOCA
,
9916 "alloca", ECF_MALLOC
| ECF_NOTHROW
| ECF_LEAF
);
9919 ftype
= build_function_type_list (ptr_type_node
, size_type_node
,
9920 size_type_node
, NULL_TREE
);
9921 local_define_builtin ("__builtin_alloca_with_align", ftype
,
9922 BUILT_IN_ALLOCA_WITH_ALIGN
, "alloca",
9923 ECF_MALLOC
| ECF_NOTHROW
| ECF_LEAF
);
9925 /* If we're checking the stack, `alloca' can throw. */
9926 if (flag_stack_check
)
9928 TREE_NOTHROW (builtin_decl_explicit (BUILT_IN_ALLOCA
)) = 0;
9929 TREE_NOTHROW (builtin_decl_explicit (BUILT_IN_ALLOCA_WITH_ALIGN
)) = 0;
9932 ftype
= build_function_type_list (void_type_node
,
9933 ptr_type_node
, ptr_type_node
,
9934 ptr_type_node
, NULL_TREE
);
9935 local_define_builtin ("__builtin_init_trampoline", ftype
,
9936 BUILT_IN_INIT_TRAMPOLINE
,
9937 "__builtin_init_trampoline", ECF_NOTHROW
| ECF_LEAF
);
9938 local_define_builtin ("__builtin_init_heap_trampoline", ftype
,
9939 BUILT_IN_INIT_HEAP_TRAMPOLINE
,
9940 "__builtin_init_heap_trampoline",
9941 ECF_NOTHROW
| ECF_LEAF
);
9943 ftype
= build_function_type_list (ptr_type_node
, ptr_type_node
, NULL_TREE
);
9944 local_define_builtin ("__builtin_adjust_trampoline", ftype
,
9945 BUILT_IN_ADJUST_TRAMPOLINE
,
9946 "__builtin_adjust_trampoline",
9947 ECF_CONST
| ECF_NOTHROW
);
9949 ftype
= build_function_type_list (void_type_node
,
9950 ptr_type_node
, ptr_type_node
, NULL_TREE
);
9951 local_define_builtin ("__builtin_nonlocal_goto", ftype
,
9952 BUILT_IN_NONLOCAL_GOTO
,
9953 "__builtin_nonlocal_goto",
9954 ECF_NORETURN
| ECF_NOTHROW
);
9956 ftype
= build_function_type_list (void_type_node
,
9957 ptr_type_node
, ptr_type_node
, NULL_TREE
);
9958 local_define_builtin ("__builtin_setjmp_setup", ftype
,
9959 BUILT_IN_SETJMP_SETUP
,
9960 "__builtin_setjmp_setup", ECF_NOTHROW
);
9962 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
9963 local_define_builtin ("__builtin_setjmp_receiver", ftype
,
9964 BUILT_IN_SETJMP_RECEIVER
,
9965 "__builtin_setjmp_receiver", ECF_NOTHROW
| ECF_LEAF
);
9967 ftype
= build_function_type_list (ptr_type_node
, NULL_TREE
);
9968 local_define_builtin ("__builtin_stack_save", ftype
, BUILT_IN_STACK_SAVE
,
9969 "__builtin_stack_save", ECF_NOTHROW
| ECF_LEAF
);
9971 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
9972 local_define_builtin ("__builtin_stack_restore", ftype
,
9973 BUILT_IN_STACK_RESTORE
,
9974 "__builtin_stack_restore", ECF_NOTHROW
| ECF_LEAF
);
9976 /* If there's a possibility that we might use the ARM EABI, build the
9977 alternate __cxa_end_cleanup node used to resume from C++ and Java. */
9978 if (targetm
.arm_eabi_unwinder
)
9980 ftype
= build_function_type_list (void_type_node
, NULL_TREE
);
9981 local_define_builtin ("__builtin_cxa_end_cleanup", ftype
,
9982 BUILT_IN_CXA_END_CLEANUP
,
9983 "__cxa_end_cleanup", ECF_NORETURN
| ECF_LEAF
);
9986 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
9987 local_define_builtin ("__builtin_unwind_resume", ftype
,
9988 BUILT_IN_UNWIND_RESUME
,
9989 ((targetm_common
.except_unwind_info (&global_options
)
9991 ? "_Unwind_SjLj_Resume" : "_Unwind_Resume"),
9994 if (builtin_decl_explicit (BUILT_IN_RETURN_ADDRESS
) == NULL_TREE
)
9996 ftype
= build_function_type_list (ptr_type_node
, integer_type_node
,
9998 local_define_builtin ("__builtin_return_address", ftype
,
9999 BUILT_IN_RETURN_ADDRESS
,
10000 "__builtin_return_address",
10004 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
)
10005 || !builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
10007 ftype
= build_function_type_list (void_type_node
, ptr_type_node
,
10008 ptr_type_node
, NULL_TREE
);
10009 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
))
10010 local_define_builtin ("__cyg_profile_func_enter", ftype
,
10011 BUILT_IN_PROFILE_FUNC_ENTER
,
10012 "__cyg_profile_func_enter", 0);
10013 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
10014 local_define_builtin ("__cyg_profile_func_exit", ftype
,
10015 BUILT_IN_PROFILE_FUNC_EXIT
,
10016 "__cyg_profile_func_exit", 0);
10019 /* The exception object and filter values from the runtime. The argument
10020 must be zero before exception lowering, i.e. from the front end. After
10021 exception lowering, it will be the region number for the exception
10022 landing pad. These functions are PURE instead of CONST to prevent
10023 them from being hoisted past the exception edge that will initialize
10024 its value in the landing pad. */
10025 ftype
= build_function_type_list (ptr_type_node
,
10026 integer_type_node
, NULL_TREE
);
10027 ecf_flags
= ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
;
10028 /* Only use TM_PURE if we we have TM language support. */
10029 if (builtin_decl_explicit_p (BUILT_IN_TM_LOAD_1
))
10030 ecf_flags
|= ECF_TM_PURE
;
10031 local_define_builtin ("__builtin_eh_pointer", ftype
, BUILT_IN_EH_POINTER
,
10032 "__builtin_eh_pointer", ecf_flags
);
10034 tmp
= lang_hooks
.types
.type_for_mode (targetm
.eh_return_filter_mode (), 0);
10035 ftype
= build_function_type_list (tmp
, integer_type_node
, NULL_TREE
);
10036 local_define_builtin ("__builtin_eh_filter", ftype
, BUILT_IN_EH_FILTER
,
10037 "__builtin_eh_filter", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10039 ftype
= build_function_type_list (void_type_node
,
10040 integer_type_node
, integer_type_node
,
10042 local_define_builtin ("__builtin_eh_copy_values", ftype
,
10043 BUILT_IN_EH_COPY_VALUES
,
10044 "__builtin_eh_copy_values", ECF_NOTHROW
);
10046 /* Complex multiplication and division. These are handled as builtins
10047 rather than optabs because emit_library_call_value doesn't support
10048 complex. Further, we can do slightly better with folding these
10049 beasties if the real and complex parts of the arguments are separate. */
10053 for (mode
= MIN_MODE_COMPLEX_FLOAT
; mode
<= MAX_MODE_COMPLEX_FLOAT
; ++mode
)
10055 char mode_name_buf
[4], *q
;
10057 enum built_in_function mcode
, dcode
;
10058 tree type
, inner_type
;
10059 const char *prefix
= "__";
10061 if (targetm
.libfunc_gnu_prefix
)
10064 type
= lang_hooks
.types
.type_for_mode ((enum machine_mode
) mode
, 0);
10067 inner_type
= TREE_TYPE (type
);
10069 ftype
= build_function_type_list (type
, inner_type
, inner_type
,
10070 inner_type
, inner_type
, NULL_TREE
);
10072 mcode
= ((enum built_in_function
)
10073 (BUILT_IN_COMPLEX_MUL_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
10074 dcode
= ((enum built_in_function
)
10075 (BUILT_IN_COMPLEX_DIV_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
10077 for (p
= GET_MODE_NAME (mode
), q
= mode_name_buf
; *p
; p
++, q
++)
10081 built_in_names
[mcode
] = concat (prefix
, "mul", mode_name_buf
, "3",
10083 local_define_builtin (built_in_names
[mcode
], ftype
, mcode
,
10084 built_in_names
[mcode
],
10085 ECF_CONST
| ECF_NOTHROW
| ECF_LEAF
);
10087 built_in_names
[dcode
] = concat (prefix
, "div", mode_name_buf
, "3",
10089 local_define_builtin (built_in_names
[dcode
], ftype
, dcode
,
10090 built_in_names
[dcode
],
10091 ECF_CONST
| ECF_NOTHROW
| ECF_LEAF
);
10095 init_internal_fns ();
10098 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
10101 If we requested a pointer to a vector, build up the pointers that
10102 we stripped off while looking for the inner type. Similarly for
10103 return values from functions.
10105 The argument TYPE is the top of the chain, and BOTTOM is the
10106 new type which we will point to. */
10109 reconstruct_complex_type (tree type
, tree bottom
)
10113 if (TREE_CODE (type
) == POINTER_TYPE
)
10115 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10116 outer
= build_pointer_type_for_mode (inner
, TYPE_MODE (type
),
10117 TYPE_REF_CAN_ALIAS_ALL (type
));
10119 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
10121 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10122 outer
= build_reference_type_for_mode (inner
, TYPE_MODE (type
),
10123 TYPE_REF_CAN_ALIAS_ALL (type
));
10125 else if (TREE_CODE (type
) == ARRAY_TYPE
)
10127 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10128 outer
= build_array_type (inner
, TYPE_DOMAIN (type
));
10130 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10132 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10133 outer
= build_function_type (inner
, TYPE_ARG_TYPES (type
));
10135 else if (TREE_CODE (type
) == METHOD_TYPE
)
10137 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10138 /* The build_method_type_directly() routine prepends 'this' to argument list,
10139 so we must compensate by getting rid of it. */
10141 = build_method_type_directly
10142 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
))),
10144 TREE_CHAIN (TYPE_ARG_TYPES (type
)));
10146 else if (TREE_CODE (type
) == OFFSET_TYPE
)
10148 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10149 outer
= build_offset_type (TYPE_OFFSET_BASETYPE (type
), inner
);
10154 return build_type_attribute_qual_variant (outer
, TYPE_ATTRIBUTES (type
),
10155 TYPE_QUALS (type
));
10158 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
10161 build_vector_type_for_mode (tree innertype
, enum machine_mode mode
)
10165 switch (GET_MODE_CLASS (mode
))
10167 case MODE_VECTOR_INT
:
10168 case MODE_VECTOR_FLOAT
:
10169 case MODE_VECTOR_FRACT
:
10170 case MODE_VECTOR_UFRACT
:
10171 case MODE_VECTOR_ACCUM
:
10172 case MODE_VECTOR_UACCUM
:
10173 nunits
= GET_MODE_NUNITS (mode
);
10177 /* Check that there are no leftover bits. */
10178 gcc_assert (GET_MODE_BITSIZE (mode
)
10179 % TREE_INT_CST_LOW (TYPE_SIZE (innertype
)) == 0);
10181 nunits
= GET_MODE_BITSIZE (mode
)
10182 / TREE_INT_CST_LOW (TYPE_SIZE (innertype
));
10186 gcc_unreachable ();
10189 return make_vector_type (innertype
, nunits
, mode
);
10192 /* Similarly, but takes the inner type and number of units, which must be
10196 build_vector_type (tree innertype
, int nunits
)
10198 return make_vector_type (innertype
, nunits
, VOIDmode
);
10201 /* Similarly, but builds a variant type with TYPE_VECTOR_OPAQUE set. */
10204 build_opaque_vector_type (tree innertype
, int nunits
)
10206 tree t
= make_vector_type (innertype
, nunits
, VOIDmode
);
10208 /* We always build the non-opaque variant before the opaque one,
10209 so if it already exists, it is TYPE_NEXT_VARIANT of this one. */
10210 cand
= TYPE_NEXT_VARIANT (t
);
10212 && TYPE_VECTOR_OPAQUE (cand
)
10213 && check_qualified_type (cand
, t
, TYPE_QUALS (t
)))
10215 /* Othewise build a variant type and make sure to queue it after
10216 the non-opaque type. */
10217 cand
= build_distinct_type_copy (t
);
10218 TYPE_VECTOR_OPAQUE (cand
) = true;
10219 TYPE_CANONICAL (cand
) = TYPE_CANONICAL (t
);
10220 TYPE_NEXT_VARIANT (cand
) = TYPE_NEXT_VARIANT (t
);
10221 TYPE_NEXT_VARIANT (t
) = cand
;
10222 TYPE_MAIN_VARIANT (cand
) = TYPE_MAIN_VARIANT (t
);
10227 /* Given an initializer INIT, return TRUE if INIT is zero or some
10228 aggregate of zeros. Otherwise return FALSE. */
10230 initializer_zerop (const_tree init
)
10236 switch (TREE_CODE (init
))
10239 return integer_zerop (init
);
10242 /* ??? Note that this is not correct for C4X float formats. There,
10243 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
10244 negative exponent. */
10245 return real_zerop (init
)
10246 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init
));
10249 return fixed_zerop (init
);
10252 return integer_zerop (init
)
10253 || (real_zerop (init
)
10254 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init
)))
10255 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init
))));
10260 for (i
= 0; i
< VECTOR_CST_NELTS (init
); ++i
)
10261 if (!initializer_zerop (VECTOR_CST_ELT (init
, i
)))
10268 unsigned HOST_WIDE_INT idx
;
10270 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init
), idx
, elt
)
10271 if (!initializer_zerop (elt
))
10280 /* We need to loop through all elements to handle cases like
10281 "\0" and "\0foobar". */
10282 for (i
= 0; i
< TREE_STRING_LENGTH (init
); ++i
)
10283 if (TREE_STRING_POINTER (init
)[i
] != '\0')
10294 /* Check if vector VEC consists of all the equal elements and
10295 that the number of elements corresponds to the type of VEC.
10296 The function returns first element of the vector
10297 or NULL_TREE if the vector is not uniform. */
10299 uniform_vector_p (const_tree vec
)
10304 if (vec
== NULL_TREE
)
10307 gcc_assert (VECTOR_TYPE_P (TREE_TYPE (vec
)));
10309 if (TREE_CODE (vec
) == VECTOR_CST
)
10311 first
= VECTOR_CST_ELT (vec
, 0);
10312 for (i
= 1; i
< VECTOR_CST_NELTS (vec
); ++i
)
10313 if (!operand_equal_p (first
, VECTOR_CST_ELT (vec
, i
), 0))
10319 else if (TREE_CODE (vec
) == CONSTRUCTOR
)
10321 first
= error_mark_node
;
10323 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (vec
), i
, t
)
10330 if (!operand_equal_p (first
, t
, 0))
10333 if (i
!= TYPE_VECTOR_SUBPARTS (TREE_TYPE (vec
)))
10342 /* Build an empty statement at location LOC. */
10345 build_empty_stmt (location_t loc
)
10347 tree t
= build1 (NOP_EXPR
, void_type_node
, size_zero_node
);
10348 SET_EXPR_LOCATION (t
, loc
);
10353 /* Build an OpenMP clause with code CODE. LOC is the location of the
10357 build_omp_clause (location_t loc
, enum omp_clause_code code
)
10362 length
= omp_clause_num_ops
[code
];
10363 size
= (sizeof (struct tree_omp_clause
) + (length
- 1) * sizeof (tree
));
10365 record_node_allocation_statistics (OMP_CLAUSE
, size
);
10367 t
= (tree
) ggc_internal_alloc (size
);
10368 memset (t
, 0, size
);
10369 TREE_SET_CODE (t
, OMP_CLAUSE
);
10370 OMP_CLAUSE_SET_CODE (t
, code
);
10371 OMP_CLAUSE_LOCATION (t
) = loc
;
10376 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
10377 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
10378 Except for the CODE and operand count field, other storage for the
10379 object is initialized to zeros. */
10382 build_vl_exp_stat (enum tree_code code
, int len MEM_STAT_DECL
)
10385 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_exp
);
10387 gcc_assert (TREE_CODE_CLASS (code
) == tcc_vl_exp
);
10388 gcc_assert (len
>= 1);
10390 record_node_allocation_statistics (code
, length
);
10392 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
10394 TREE_SET_CODE (t
, code
);
10396 /* Can't use TREE_OPERAND to store the length because if checking is
10397 enabled, it will try to check the length before we store it. :-P */
10398 t
->exp
.operands
[0] = build_int_cst (sizetype
, len
);
10403 /* Helper function for build_call_* functions; build a CALL_EXPR with
10404 indicated RETURN_TYPE, FN, and NARGS, but do not initialize any of
10405 the argument slots. */
10408 build_call_1 (tree return_type
, tree fn
, int nargs
)
10412 t
= build_vl_exp (CALL_EXPR
, nargs
+ 3);
10413 TREE_TYPE (t
) = return_type
;
10414 CALL_EXPR_FN (t
) = fn
;
10415 CALL_EXPR_STATIC_CHAIN (t
) = NULL
;
10420 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10421 FN and a null static chain slot. NARGS is the number of call arguments
10422 which are specified as "..." arguments. */
10425 build_call_nary (tree return_type
, tree fn
, int nargs
, ...)
10429 va_start (args
, nargs
);
10430 ret
= build_call_valist (return_type
, fn
, nargs
, args
);
10435 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10436 FN and a null static chain slot. NARGS is the number of call arguments
10437 which are specified as a va_list ARGS. */
10440 build_call_valist (tree return_type
, tree fn
, int nargs
, va_list args
)
10445 t
= build_call_1 (return_type
, fn
, nargs
);
10446 for (i
= 0; i
< nargs
; i
++)
10447 CALL_EXPR_ARG (t
, i
) = va_arg (args
, tree
);
10448 process_call_operands (t
);
10452 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10453 FN and a null static chain slot. NARGS is the number of call arguments
10454 which are specified as a tree array ARGS. */
10457 build_call_array_loc (location_t loc
, tree return_type
, tree fn
,
10458 int nargs
, const tree
*args
)
10463 t
= build_call_1 (return_type
, fn
, nargs
);
10464 for (i
= 0; i
< nargs
; i
++)
10465 CALL_EXPR_ARG (t
, i
) = args
[i
];
10466 process_call_operands (t
);
10467 SET_EXPR_LOCATION (t
, loc
);
10471 /* Like build_call_array, but takes a vec. */
10474 build_call_vec (tree return_type
, tree fn
, vec
<tree
, va_gc
> *args
)
10479 ret
= build_call_1 (return_type
, fn
, vec_safe_length (args
));
10480 FOR_EACH_VEC_SAFE_ELT (args
, ix
, t
)
10481 CALL_EXPR_ARG (ret
, ix
) = t
;
10482 process_call_operands (ret
);
10486 /* Conveniently construct a function call expression. FNDECL names the
10487 function to be called and N arguments are passed in the array
10491 build_call_expr_loc_array (location_t loc
, tree fndecl
, int n
, tree
*argarray
)
10493 tree fntype
= TREE_TYPE (fndecl
);
10494 tree fn
= build1 (ADDR_EXPR
, build_pointer_type (fntype
), fndecl
);
10496 return fold_builtin_call_array (loc
, TREE_TYPE (fntype
), fn
, n
, argarray
);
10499 /* Conveniently construct a function call expression. FNDECL names the
10500 function to be called and the arguments are passed in the vector
10504 build_call_expr_loc_vec (location_t loc
, tree fndecl
, vec
<tree
, va_gc
> *vec
)
10506 return build_call_expr_loc_array (loc
, fndecl
, vec_safe_length (vec
),
10507 vec_safe_address (vec
));
10511 /* Conveniently construct a function call expression. FNDECL names the
10512 function to be called, N is the number of arguments, and the "..."
10513 parameters are the argument expressions. */
10516 build_call_expr_loc (location_t loc
, tree fndecl
, int n
, ...)
10519 tree
*argarray
= XALLOCAVEC (tree
, n
);
10523 for (i
= 0; i
< n
; i
++)
10524 argarray
[i
] = va_arg (ap
, tree
);
10526 return build_call_expr_loc_array (loc
, fndecl
, n
, argarray
);
10529 /* Like build_call_expr_loc (UNKNOWN_LOCATION, ...). Duplicated because
10530 varargs macros aren't supported by all bootstrap compilers. */
10533 build_call_expr (tree fndecl
, int n
, ...)
10536 tree
*argarray
= XALLOCAVEC (tree
, n
);
10540 for (i
= 0; i
< n
; i
++)
10541 argarray
[i
] = va_arg (ap
, tree
);
10543 return build_call_expr_loc_array (UNKNOWN_LOCATION
, fndecl
, n
, argarray
);
10546 /* Build internal call expression. This is just like CALL_EXPR, except
10547 its CALL_EXPR_FN is NULL. It will get gimplified later into ordinary
10548 internal function. */
10551 build_call_expr_internal_loc (location_t loc
, enum internal_fn ifn
,
10552 tree type
, int n
, ...)
10557 tree fn
= build_call_1 (type
, NULL_TREE
, n
);
10559 for (i
= 0; i
< n
; i
++)
10560 CALL_EXPR_ARG (fn
, i
) = va_arg (ap
, tree
);
10562 SET_EXPR_LOCATION (fn
, loc
);
10563 CALL_EXPR_IFN (fn
) = ifn
;
10567 /* Create a new constant string literal and return a char* pointer to it.
10568 The STRING_CST value is the LEN characters at STR. */
10570 build_string_literal (int len
, const char *str
)
10572 tree t
, elem
, index
, type
;
10574 t
= build_string (len
, str
);
10575 elem
= build_type_variant (char_type_node
, 1, 0);
10576 index
= build_index_type (size_int (len
- 1));
10577 type
= build_array_type (elem
, index
);
10578 TREE_TYPE (t
) = type
;
10579 TREE_CONSTANT (t
) = 1;
10580 TREE_READONLY (t
) = 1;
10581 TREE_STATIC (t
) = 1;
10583 type
= build_pointer_type (elem
);
10584 t
= build1 (ADDR_EXPR
, type
,
10585 build4 (ARRAY_REF
, elem
,
10586 t
, integer_zero_node
, NULL_TREE
, NULL_TREE
));
10592 /* Return true if T (assumed to be a DECL) must be assigned a memory
10596 needs_to_live_in_memory (const_tree t
)
10598 return (TREE_ADDRESSABLE (t
)
10599 || is_global_var (t
)
10600 || (TREE_CODE (t
) == RESULT_DECL
10601 && !DECL_BY_REFERENCE (t
)
10602 && aggregate_value_p (t
, current_function_decl
)));
10605 /* Return value of a constant X and sign-extend it. */
10608 int_cst_value (const_tree x
)
10610 unsigned bits
= TYPE_PRECISION (TREE_TYPE (x
));
10611 unsigned HOST_WIDE_INT val
= TREE_INT_CST_LOW (x
);
10613 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
10614 gcc_assert (cst_and_fits_in_hwi (x
));
10616 if (bits
< HOST_BITS_PER_WIDE_INT
)
10618 bool negative
= ((val
>> (bits
- 1)) & 1) != 0;
10620 val
|= (~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1;
10622 val
&= ~((~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1);
10628 /* If TYPE is an integral or pointer type, return an integer type with
10629 the same precision which is unsigned iff UNSIGNEDP is true, or itself
10630 if TYPE is already an integer type of signedness UNSIGNEDP. */
10633 signed_or_unsigned_type_for (int unsignedp
, tree type
)
10635 if (TREE_CODE (type
) == INTEGER_TYPE
&& TYPE_UNSIGNED (type
) == unsignedp
)
10638 if (TREE_CODE (type
) == VECTOR_TYPE
)
10640 tree inner
= TREE_TYPE (type
);
10641 tree inner2
= signed_or_unsigned_type_for (unsignedp
, inner
);
10644 if (inner
== inner2
)
10646 return build_vector_type (inner2
, TYPE_VECTOR_SUBPARTS (type
));
10649 if (!INTEGRAL_TYPE_P (type
)
10650 && !POINTER_TYPE_P (type
)
10651 && TREE_CODE (type
) != OFFSET_TYPE
)
10654 return build_nonstandard_integer_type (TYPE_PRECISION (type
), unsignedp
);
10657 /* If TYPE is an integral or pointer type, return an integer type with
10658 the same precision which is unsigned, or itself if TYPE is already an
10659 unsigned integer type. */
10662 unsigned_type_for (tree type
)
10664 return signed_or_unsigned_type_for (1, type
);
10667 /* If TYPE is an integral or pointer type, return an integer type with
10668 the same precision which is signed, or itself if TYPE is already a
10669 signed integer type. */
10672 signed_type_for (tree type
)
10674 return signed_or_unsigned_type_for (0, type
);
10677 /* If TYPE is a vector type, return a signed integer vector type with the
10678 same width and number of subparts. Otherwise return boolean_type_node. */
10681 truth_type_for (tree type
)
10683 if (TREE_CODE (type
) == VECTOR_TYPE
)
10685 tree elem
= lang_hooks
.types
.type_for_size
10686 (GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (type
))), 0);
10687 return build_opaque_vector_type (elem
, TYPE_VECTOR_SUBPARTS (type
));
10690 return boolean_type_node
;
10693 /* Returns the largest value obtainable by casting something in INNER type to
10697 upper_bound_in_type (tree outer
, tree inner
)
10699 unsigned int det
= 0;
10700 unsigned oprec
= TYPE_PRECISION (outer
);
10701 unsigned iprec
= TYPE_PRECISION (inner
);
10704 /* Compute a unique number for every combination. */
10705 det
|= (oprec
> iprec
) ? 4 : 0;
10706 det
|= TYPE_UNSIGNED (outer
) ? 2 : 0;
10707 det
|= TYPE_UNSIGNED (inner
) ? 1 : 0;
10709 /* Determine the exponent to use. */
10714 /* oprec <= iprec, outer: signed, inner: don't care. */
10719 /* oprec <= iprec, outer: unsigned, inner: don't care. */
10723 /* oprec > iprec, outer: signed, inner: signed. */
10727 /* oprec > iprec, outer: signed, inner: unsigned. */
10731 /* oprec > iprec, outer: unsigned, inner: signed. */
10735 /* oprec > iprec, outer: unsigned, inner: unsigned. */
10739 gcc_unreachable ();
10742 return wide_int_to_tree (outer
,
10743 wi::mask (prec
, false, TYPE_PRECISION (outer
)));
10746 /* Returns the smallest value obtainable by casting something in INNER type to
10750 lower_bound_in_type (tree outer
, tree inner
)
10752 unsigned oprec
= TYPE_PRECISION (outer
);
10753 unsigned iprec
= TYPE_PRECISION (inner
);
10755 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
10757 if (TYPE_UNSIGNED (outer
)
10758 /* If we are widening something of an unsigned type, OUTER type
10759 contains all values of INNER type. In particular, both INNER
10760 and OUTER types have zero in common. */
10761 || (oprec
> iprec
&& TYPE_UNSIGNED (inner
)))
10762 return build_int_cst (outer
, 0);
10765 /* If we are widening a signed type to another signed type, we
10766 want to obtain -2^^(iprec-1). If we are keeping the
10767 precision or narrowing to a signed type, we want to obtain
10769 unsigned prec
= oprec
> iprec
? iprec
: oprec
;
10770 return wide_int_to_tree (outer
,
10771 wi::mask (prec
- 1, true,
10772 TYPE_PRECISION (outer
)));
10776 /* Return nonzero if two operands that are suitable for PHI nodes are
10777 necessarily equal. Specifically, both ARG0 and ARG1 must be either
10778 SSA_NAME or invariant. Note that this is strictly an optimization.
10779 That is, callers of this function can directly call operand_equal_p
10780 and get the same result, only slower. */
10783 operand_equal_for_phi_arg_p (const_tree arg0
, const_tree arg1
)
10787 if (TREE_CODE (arg0
) == SSA_NAME
|| TREE_CODE (arg1
) == SSA_NAME
)
10789 return operand_equal_p (arg0
, arg1
, 0);
10792 /* Returns number of zeros at the end of binary representation of X. */
10795 num_ending_zeros (const_tree x
)
10797 return build_int_cst (TREE_TYPE (x
), wi::ctz (x
));
10801 #define WALK_SUBTREE(NODE) \
10804 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
10810 /* This is a subroutine of walk_tree that walks field of TYPE that are to
10811 be walked whenever a type is seen in the tree. Rest of operands and return
10812 value are as for walk_tree. */
10815 walk_type_fields (tree type
, walk_tree_fn func
, void *data
,
10816 hash_set
<tree
> *pset
, walk_tree_lh lh
)
10818 tree result
= NULL_TREE
;
10820 switch (TREE_CODE (type
))
10823 case REFERENCE_TYPE
:
10825 /* We have to worry about mutually recursive pointers. These can't
10826 be written in C. They can in Ada. It's pathological, but
10827 there's an ACATS test (c38102a) that checks it. Deal with this
10828 by checking if we're pointing to another pointer, that one
10829 points to another pointer, that one does too, and we have no htab.
10830 If so, get a hash table. We check three levels deep to avoid
10831 the cost of the hash table if we don't need one. */
10832 if (POINTER_TYPE_P (TREE_TYPE (type
))
10833 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type
)))
10834 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type
))))
10837 result
= walk_tree_without_duplicates (&TREE_TYPE (type
),
10845 /* ... fall through ... */
10848 WALK_SUBTREE (TREE_TYPE (type
));
10852 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type
));
10854 /* Fall through. */
10856 case FUNCTION_TYPE
:
10857 WALK_SUBTREE (TREE_TYPE (type
));
10861 /* We never want to walk into default arguments. */
10862 for (arg
= TYPE_ARG_TYPES (type
); arg
; arg
= TREE_CHAIN (arg
))
10863 WALK_SUBTREE (TREE_VALUE (arg
));
10868 /* Don't follow this nodes's type if a pointer for fear that
10869 we'll have infinite recursion. If we have a PSET, then we
10872 || (!POINTER_TYPE_P (TREE_TYPE (type
))
10873 && TREE_CODE (TREE_TYPE (type
)) != OFFSET_TYPE
))
10874 WALK_SUBTREE (TREE_TYPE (type
));
10875 WALK_SUBTREE (TYPE_DOMAIN (type
));
10879 WALK_SUBTREE (TREE_TYPE (type
));
10880 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type
));
10890 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
10891 called with the DATA and the address of each sub-tree. If FUNC returns a
10892 non-NULL value, the traversal is stopped, and the value returned by FUNC
10893 is returned. If PSET is non-NULL it is used to record the nodes visited,
10894 and to avoid visiting a node more than once. */
10897 walk_tree_1 (tree
*tp
, walk_tree_fn func
, void *data
,
10898 hash_set
<tree
> *pset
, walk_tree_lh lh
)
10900 enum tree_code code
;
10904 #define WALK_SUBTREE_TAIL(NODE) \
10908 goto tail_recurse; \
10913 /* Skip empty subtrees. */
10917 /* Don't walk the same tree twice, if the user has requested
10918 that we avoid doing so. */
10919 if (pset
&& pset
->add (*tp
))
10922 /* Call the function. */
10924 result
= (*func
) (tp
, &walk_subtrees
, data
);
10926 /* If we found something, return it. */
10930 code
= TREE_CODE (*tp
);
10932 /* Even if we didn't, FUNC may have decided that there was nothing
10933 interesting below this point in the tree. */
10934 if (!walk_subtrees
)
10936 /* But we still need to check our siblings. */
10937 if (code
== TREE_LIST
)
10938 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
10939 else if (code
== OMP_CLAUSE
)
10940 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10947 result
= (*lh
) (tp
, &walk_subtrees
, func
, data
, pset
);
10948 if (result
|| !walk_subtrees
)
10955 case IDENTIFIER_NODE
:
10962 case PLACEHOLDER_EXPR
:
10966 /* None of these have subtrees other than those already walked
10971 WALK_SUBTREE (TREE_VALUE (*tp
));
10972 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
10977 int len
= TREE_VEC_LENGTH (*tp
);
10982 /* Walk all elements but the first. */
10984 WALK_SUBTREE (TREE_VEC_ELT (*tp
, len
));
10986 /* Now walk the first one as a tail call. */
10987 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp
, 0));
10991 WALK_SUBTREE (TREE_REALPART (*tp
));
10992 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp
));
10996 unsigned HOST_WIDE_INT idx
;
10997 constructor_elt
*ce
;
10999 for (idx
= 0; vec_safe_iterate (CONSTRUCTOR_ELTS (*tp
), idx
, &ce
);
11001 WALK_SUBTREE (ce
->value
);
11006 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, 0));
11011 for (decl
= BIND_EXPR_VARS (*tp
); decl
; decl
= DECL_CHAIN (decl
))
11013 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
11014 into declarations that are just mentioned, rather than
11015 declared; they don't really belong to this part of the tree.
11016 And, we can see cycles: the initializer for a declaration
11017 can refer to the declaration itself. */
11018 WALK_SUBTREE (DECL_INITIAL (decl
));
11019 WALK_SUBTREE (DECL_SIZE (decl
));
11020 WALK_SUBTREE (DECL_SIZE_UNIT (decl
));
11022 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp
));
11025 case STATEMENT_LIST
:
11027 tree_stmt_iterator i
;
11028 for (i
= tsi_start (*tp
); !tsi_end_p (i
); tsi_next (&i
))
11029 WALK_SUBTREE (*tsi_stmt_ptr (i
));
11034 switch (OMP_CLAUSE_CODE (*tp
))
11036 case OMP_CLAUSE_PRIVATE
:
11037 case OMP_CLAUSE_SHARED
:
11038 case OMP_CLAUSE_FIRSTPRIVATE
:
11039 case OMP_CLAUSE_COPYIN
:
11040 case OMP_CLAUSE_COPYPRIVATE
:
11041 case OMP_CLAUSE_FINAL
:
11042 case OMP_CLAUSE_IF
:
11043 case OMP_CLAUSE_NUM_THREADS
:
11044 case OMP_CLAUSE_SCHEDULE
:
11045 case OMP_CLAUSE_UNIFORM
:
11046 case OMP_CLAUSE_DEPEND
:
11047 case OMP_CLAUSE_NUM_TEAMS
:
11048 case OMP_CLAUSE_THREAD_LIMIT
:
11049 case OMP_CLAUSE_DEVICE
:
11050 case OMP_CLAUSE_DIST_SCHEDULE
:
11051 case OMP_CLAUSE_SAFELEN
:
11052 case OMP_CLAUSE_SIMDLEN
:
11053 case OMP_CLAUSE__LOOPTEMP_
:
11054 case OMP_CLAUSE__SIMDUID_
:
11055 case OMP_CLAUSE__CILK_FOR_COUNT_
:
11056 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 0));
11059 case OMP_CLAUSE_NOWAIT
:
11060 case OMP_CLAUSE_ORDERED
:
11061 case OMP_CLAUSE_DEFAULT
:
11062 case OMP_CLAUSE_UNTIED
:
11063 case OMP_CLAUSE_MERGEABLE
:
11064 case OMP_CLAUSE_PROC_BIND
:
11065 case OMP_CLAUSE_INBRANCH
:
11066 case OMP_CLAUSE_NOTINBRANCH
:
11067 case OMP_CLAUSE_FOR
:
11068 case OMP_CLAUSE_PARALLEL
:
11069 case OMP_CLAUSE_SECTIONS
:
11070 case OMP_CLAUSE_TASKGROUP
:
11071 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11073 case OMP_CLAUSE_LASTPRIVATE
:
11074 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
11075 WALK_SUBTREE (OMP_CLAUSE_LASTPRIVATE_STMT (*tp
));
11076 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11078 case OMP_CLAUSE_COLLAPSE
:
11081 for (i
= 0; i
< 3; i
++)
11082 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
11083 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11086 case OMP_CLAUSE_LINEAR
:
11087 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
11088 WALK_SUBTREE (OMP_CLAUSE_LINEAR_STEP (*tp
));
11089 WALK_SUBTREE (OMP_CLAUSE_LINEAR_STMT (*tp
));
11090 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11092 case OMP_CLAUSE_ALIGNED
:
11093 case OMP_CLAUSE_FROM
:
11094 case OMP_CLAUSE_TO
:
11095 case OMP_CLAUSE_MAP
:
11096 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
11097 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 1));
11098 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11100 case OMP_CLAUSE_REDUCTION
:
11103 for (i
= 0; i
< 4; i
++)
11104 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
11105 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11109 gcc_unreachable ();
11117 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
11118 But, we only want to walk once. */
11119 len
= (TREE_OPERAND (*tp
, 3) == TREE_OPERAND (*tp
, 1)) ? 2 : 3;
11120 for (i
= 0; i
< len
; ++i
)
11121 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
11122 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
));
11126 /* If this is a TYPE_DECL, walk into the fields of the type that it's
11127 defining. We only want to walk into these fields of a type in this
11128 case and not in the general case of a mere reference to the type.
11130 The criterion is as follows: if the field can be an expression, it
11131 must be walked only here. This should be in keeping with the fields
11132 that are directly gimplified in gimplify_type_sizes in order for the
11133 mark/copy-if-shared/unmark machinery of the gimplifier to work with
11134 variable-sized types.
11136 Note that DECLs get walked as part of processing the BIND_EXPR. */
11137 if (TREE_CODE (DECL_EXPR_DECL (*tp
)) == TYPE_DECL
)
11139 tree
*type_p
= &TREE_TYPE (DECL_EXPR_DECL (*tp
));
11140 if (TREE_CODE (*type_p
) == ERROR_MARK
)
11143 /* Call the function for the type. See if it returns anything or
11144 doesn't want us to continue. If we are to continue, walk both
11145 the normal fields and those for the declaration case. */
11146 result
= (*func
) (type_p
, &walk_subtrees
, data
);
11147 if (result
|| !walk_subtrees
)
11150 /* But do not walk a pointed-to type since it may itself need to
11151 be walked in the declaration case if it isn't anonymous. */
11152 if (!POINTER_TYPE_P (*type_p
))
11154 result
= walk_type_fields (*type_p
, func
, data
, pset
, lh
);
11159 /* If this is a record type, also walk the fields. */
11160 if (RECORD_OR_UNION_TYPE_P (*type_p
))
11164 for (field
= TYPE_FIELDS (*type_p
); field
;
11165 field
= DECL_CHAIN (field
))
11167 /* We'd like to look at the type of the field, but we can
11168 easily get infinite recursion. So assume it's pointed
11169 to elsewhere in the tree. Also, ignore things that
11171 if (TREE_CODE (field
) != FIELD_DECL
)
11174 WALK_SUBTREE (DECL_FIELD_OFFSET (field
));
11175 WALK_SUBTREE (DECL_SIZE (field
));
11176 WALK_SUBTREE (DECL_SIZE_UNIT (field
));
11177 if (TREE_CODE (*type_p
) == QUAL_UNION_TYPE
)
11178 WALK_SUBTREE (DECL_QUALIFIER (field
));
11182 /* Same for scalar types. */
11183 else if (TREE_CODE (*type_p
) == BOOLEAN_TYPE
11184 || TREE_CODE (*type_p
) == ENUMERAL_TYPE
11185 || TREE_CODE (*type_p
) == INTEGER_TYPE
11186 || TREE_CODE (*type_p
) == FIXED_POINT_TYPE
11187 || TREE_CODE (*type_p
) == REAL_TYPE
)
11189 WALK_SUBTREE (TYPE_MIN_VALUE (*type_p
));
11190 WALK_SUBTREE (TYPE_MAX_VALUE (*type_p
));
11193 WALK_SUBTREE (TYPE_SIZE (*type_p
));
11194 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p
));
11199 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code
)))
11203 /* Walk over all the sub-trees of this operand. */
11204 len
= TREE_OPERAND_LENGTH (*tp
);
11206 /* Go through the subtrees. We need to do this in forward order so
11207 that the scope of a FOR_EXPR is handled properly. */
11210 for (i
= 0; i
< len
- 1; ++i
)
11211 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
11212 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
- 1));
11215 /* If this is a type, walk the needed fields in the type. */
11216 else if (TYPE_P (*tp
))
11217 return walk_type_fields (*tp
, func
, data
, pset
, lh
);
11221 /* We didn't find what we were looking for. */
11224 #undef WALK_SUBTREE_TAIL
11226 #undef WALK_SUBTREE
11228 /* Like walk_tree, but does not walk duplicate nodes more than once. */
11231 walk_tree_without_duplicates_1 (tree
*tp
, walk_tree_fn func
, void *data
,
11236 hash_set
<tree
> pset
;
11237 result
= walk_tree_1 (tp
, func
, data
, &pset
, lh
);
11243 tree_block (tree t
)
11245 const enum tree_code_class c
= TREE_CODE_CLASS (TREE_CODE (t
));
11247 if (IS_EXPR_CODE_CLASS (c
))
11248 return LOCATION_BLOCK (t
->exp
.locus
);
11249 gcc_unreachable ();
11254 tree_set_block (tree t
, tree b
)
11256 const enum tree_code_class c
= TREE_CODE_CLASS (TREE_CODE (t
));
11258 if (IS_EXPR_CODE_CLASS (c
))
11261 t
->exp
.locus
= COMBINE_LOCATION_DATA (line_table
, t
->exp
.locus
, b
);
11263 t
->exp
.locus
= LOCATION_LOCUS (t
->exp
.locus
);
11266 gcc_unreachable ();
11269 /* Create a nameless artificial label and put it in the current
11270 function context. The label has a location of LOC. Returns the
11271 newly created label. */
11274 create_artificial_label (location_t loc
)
11276 tree lab
= build_decl (loc
,
11277 LABEL_DECL
, NULL_TREE
, void_type_node
);
11279 DECL_ARTIFICIAL (lab
) = 1;
11280 DECL_IGNORED_P (lab
) = 1;
11281 DECL_CONTEXT (lab
) = current_function_decl
;
11285 /* Given a tree, try to return a useful variable name that we can use
11286 to prefix a temporary that is being assigned the value of the tree.
11287 I.E. given <temp> = &A, return A. */
11292 tree stripped_decl
;
11295 STRIP_NOPS (stripped_decl
);
11296 if (DECL_P (stripped_decl
) && DECL_NAME (stripped_decl
))
11297 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl
));
11298 else if (TREE_CODE (stripped_decl
) == SSA_NAME
)
11300 tree name
= SSA_NAME_IDENTIFIER (stripped_decl
);
11303 return IDENTIFIER_POINTER (name
);
11307 switch (TREE_CODE (stripped_decl
))
11310 return get_name (TREE_OPERAND (stripped_decl
, 0));
11317 /* Return true if TYPE has a variable argument list. */
11320 stdarg_p (const_tree fntype
)
11322 function_args_iterator args_iter
;
11323 tree n
= NULL_TREE
, t
;
11328 FOREACH_FUNCTION_ARGS (fntype
, t
, args_iter
)
11333 return n
!= NULL_TREE
&& n
!= void_type_node
;
11336 /* Return true if TYPE has a prototype. */
11339 prototype_p (tree fntype
)
11343 gcc_assert (fntype
!= NULL_TREE
);
11345 t
= TYPE_ARG_TYPES (fntype
);
11346 return (t
!= NULL_TREE
);
11349 /* If BLOCK is inlined from an __attribute__((__artificial__))
11350 routine, return pointer to location from where it has been
11353 block_nonartificial_location (tree block
)
11355 location_t
*ret
= NULL
;
11357 while (block
&& TREE_CODE (block
) == BLOCK
11358 && BLOCK_ABSTRACT_ORIGIN (block
))
11360 tree ao
= BLOCK_ABSTRACT_ORIGIN (block
);
11362 while (TREE_CODE (ao
) == BLOCK
11363 && BLOCK_ABSTRACT_ORIGIN (ao
)
11364 && BLOCK_ABSTRACT_ORIGIN (ao
) != ao
)
11365 ao
= BLOCK_ABSTRACT_ORIGIN (ao
);
11367 if (TREE_CODE (ao
) == FUNCTION_DECL
)
11369 /* If AO is an artificial inline, point RET to the
11370 call site locus at which it has been inlined and continue
11371 the loop, in case AO's caller is also an artificial
11373 if (DECL_DECLARED_INLINE_P (ao
)
11374 && lookup_attribute ("artificial", DECL_ATTRIBUTES (ao
)))
11375 ret
= &BLOCK_SOURCE_LOCATION (block
);
11379 else if (TREE_CODE (ao
) != BLOCK
)
11382 block
= BLOCK_SUPERCONTEXT (block
);
11388 /* If EXP is inlined from an __attribute__((__artificial__))
11389 function, return the location of the original call expression. */
11392 tree_nonartificial_location (tree exp
)
11394 location_t
*loc
= block_nonartificial_location (TREE_BLOCK (exp
));
11399 return EXPR_LOCATION (exp
);
11403 /* These are the hash table functions for the hash table of OPTIMIZATION_NODEq
11406 /* Return the hash code code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
11409 cl_option_hash_hash (const void *x
)
11411 const_tree
const t
= (const_tree
) x
;
11415 hashval_t hash
= 0;
11417 if (TREE_CODE (t
) == OPTIMIZATION_NODE
)
11419 p
= (const char *)TREE_OPTIMIZATION (t
);
11420 len
= sizeof (struct cl_optimization
);
11423 else if (TREE_CODE (t
) == TARGET_OPTION_NODE
)
11425 p
= (const char *)TREE_TARGET_OPTION (t
);
11426 len
= sizeof (struct cl_target_option
);
11430 gcc_unreachable ();
11432 /* assume most opt flags are just 0/1, some are 2-3, and a few might be
11434 for (i
= 0; i
< len
; i
++)
11436 hash
= (hash
<< 4) ^ ((i
<< 2) | p
[i
]);
11441 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
11442 TARGET_OPTION tree node) is the same as that given by *Y, which is the
11446 cl_option_hash_eq (const void *x
, const void *y
)
11448 const_tree
const xt
= (const_tree
) x
;
11449 const_tree
const yt
= (const_tree
) y
;
11454 if (TREE_CODE (xt
) != TREE_CODE (yt
))
11457 if (TREE_CODE (xt
) == OPTIMIZATION_NODE
)
11459 xp
= (const char *)TREE_OPTIMIZATION (xt
);
11460 yp
= (const char *)TREE_OPTIMIZATION (yt
);
11461 len
= sizeof (struct cl_optimization
);
11464 else if (TREE_CODE (xt
) == TARGET_OPTION_NODE
)
11466 xp
= (const char *)TREE_TARGET_OPTION (xt
);
11467 yp
= (const char *)TREE_TARGET_OPTION (yt
);
11468 len
= sizeof (struct cl_target_option
);
11472 gcc_unreachable ();
11474 return (memcmp (xp
, yp
, len
) == 0);
11477 /* Build an OPTIMIZATION_NODE based on the options in OPTS. */
11480 build_optimization_node (struct gcc_options
*opts
)
11485 /* Use the cache of optimization nodes. */
11487 cl_optimization_save (TREE_OPTIMIZATION (cl_optimization_node
),
11490 slot
= htab_find_slot (cl_option_hash_table
, cl_optimization_node
, INSERT
);
11494 /* Insert this one into the hash table. */
11495 t
= cl_optimization_node
;
11498 /* Make a new node for next time round. */
11499 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
11505 /* Build a TARGET_OPTION_NODE based on the options in OPTS. */
11508 build_target_option_node (struct gcc_options
*opts
)
11513 /* Use the cache of optimization nodes. */
11515 cl_target_option_save (TREE_TARGET_OPTION (cl_target_option_node
),
11518 slot
= htab_find_slot (cl_option_hash_table
, cl_target_option_node
, INSERT
);
11522 /* Insert this one into the hash table. */
11523 t
= cl_target_option_node
;
11526 /* Make a new node for next time round. */
11527 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
11533 /* Reset TREE_TARGET_GLOBALS cache for TARGET_OPTION_NODE.
11534 Called through htab_traverse. */
11537 prepare_target_option_node_for_pch (void **slot
, void *)
11539 tree node
= (tree
) *slot
;
11540 if (TREE_CODE (node
) == TARGET_OPTION_NODE
)
11541 TREE_TARGET_GLOBALS (node
) = NULL
;
11545 /* Clear TREE_TARGET_GLOBALS of all TARGET_OPTION_NODE trees,
11546 so that they aren't saved during PCH writing. */
11549 prepare_target_option_nodes_for_pch (void)
11551 htab_traverse (cl_option_hash_table
, prepare_target_option_node_for_pch
,
11555 /* Determine the "ultimate origin" of a block. The block may be an inlined
11556 instance of an inlined instance of a block which is local to an inline
11557 function, so we have to trace all of the way back through the origin chain
11558 to find out what sort of node actually served as the original seed for the
11562 block_ultimate_origin (const_tree block
)
11564 tree immediate_origin
= BLOCK_ABSTRACT_ORIGIN (block
);
11566 /* output_inline_function sets BLOCK_ABSTRACT_ORIGIN for all the
11567 nodes in the function to point to themselves; ignore that if
11568 we're trying to output the abstract instance of this function. */
11569 if (BLOCK_ABSTRACT (block
) && immediate_origin
== block
)
11572 if (immediate_origin
== NULL_TREE
)
11577 tree lookahead
= immediate_origin
;
11581 ret_val
= lookahead
;
11582 lookahead
= (TREE_CODE (ret_val
) == BLOCK
11583 ? BLOCK_ABSTRACT_ORIGIN (ret_val
) : NULL
);
11585 while (lookahead
!= NULL
&& lookahead
!= ret_val
);
11587 /* The block's abstract origin chain may not be the *ultimate* origin of
11588 the block. It could lead to a DECL that has an abstract origin set.
11589 If so, we want that DECL's abstract origin (which is what DECL_ORIGIN
11590 will give us if it has one). Note that DECL's abstract origins are
11591 supposed to be the most distant ancestor (or so decl_ultimate_origin
11592 claims), so we don't need to loop following the DECL origins. */
11593 if (DECL_P (ret_val
))
11594 return DECL_ORIGIN (ret_val
);
11600 /* Return true iff conversion in EXP generates no instruction. Mark
11601 it inline so that we fully inline into the stripping functions even
11602 though we have two uses of this function. */
11605 tree_nop_conversion (const_tree exp
)
11607 tree outer_type
, inner_type
;
11609 if (!CONVERT_EXPR_P (exp
)
11610 && TREE_CODE (exp
) != NON_LVALUE_EXPR
)
11612 if (TREE_OPERAND (exp
, 0) == error_mark_node
)
11615 outer_type
= TREE_TYPE (exp
);
11616 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
11621 /* Use precision rather then machine mode when we can, which gives
11622 the correct answer even for submode (bit-field) types. */
11623 if ((INTEGRAL_TYPE_P (outer_type
)
11624 || POINTER_TYPE_P (outer_type
)
11625 || TREE_CODE (outer_type
) == OFFSET_TYPE
)
11626 && (INTEGRAL_TYPE_P (inner_type
)
11627 || POINTER_TYPE_P (inner_type
)
11628 || TREE_CODE (inner_type
) == OFFSET_TYPE
))
11629 return TYPE_PRECISION (outer_type
) == TYPE_PRECISION (inner_type
);
11631 /* Otherwise fall back on comparing machine modes (e.g. for
11632 aggregate types, floats). */
11633 return TYPE_MODE (outer_type
) == TYPE_MODE (inner_type
);
11636 /* Return true iff conversion in EXP generates no instruction. Don't
11637 consider conversions changing the signedness. */
11640 tree_sign_nop_conversion (const_tree exp
)
11642 tree outer_type
, inner_type
;
11644 if (!tree_nop_conversion (exp
))
11647 outer_type
= TREE_TYPE (exp
);
11648 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
11650 return (TYPE_UNSIGNED (outer_type
) == TYPE_UNSIGNED (inner_type
)
11651 && POINTER_TYPE_P (outer_type
) == POINTER_TYPE_P (inner_type
));
11654 /* Strip conversions from EXP according to tree_nop_conversion and
11655 return the resulting expression. */
11658 tree_strip_nop_conversions (tree exp
)
11660 while (tree_nop_conversion (exp
))
11661 exp
= TREE_OPERAND (exp
, 0);
11665 /* Strip conversions from EXP according to tree_sign_nop_conversion
11666 and return the resulting expression. */
11669 tree_strip_sign_nop_conversions (tree exp
)
11671 while (tree_sign_nop_conversion (exp
))
11672 exp
= TREE_OPERAND (exp
, 0);
11676 /* Avoid any floating point extensions from EXP. */
11678 strip_float_extensions (tree exp
)
11680 tree sub
, expt
, subt
;
11682 /* For floating point constant look up the narrowest type that can hold
11683 it properly and handle it like (type)(narrowest_type)constant.
11684 This way we can optimize for instance a=a*2.0 where "a" is float
11685 but 2.0 is double constant. */
11686 if (TREE_CODE (exp
) == REAL_CST
&& !DECIMAL_FLOAT_TYPE_P (TREE_TYPE (exp
)))
11688 REAL_VALUE_TYPE orig
;
11691 orig
= TREE_REAL_CST (exp
);
11692 if (TYPE_PRECISION (TREE_TYPE (exp
)) > TYPE_PRECISION (float_type_node
)
11693 && exact_real_truncate (TYPE_MODE (float_type_node
), &orig
))
11694 type
= float_type_node
;
11695 else if (TYPE_PRECISION (TREE_TYPE (exp
))
11696 > TYPE_PRECISION (double_type_node
)
11697 && exact_real_truncate (TYPE_MODE (double_type_node
), &orig
))
11698 type
= double_type_node
;
11700 return build_real (type
, real_value_truncate (TYPE_MODE (type
), orig
));
11703 if (!CONVERT_EXPR_P (exp
))
11706 sub
= TREE_OPERAND (exp
, 0);
11707 subt
= TREE_TYPE (sub
);
11708 expt
= TREE_TYPE (exp
);
11710 if (!FLOAT_TYPE_P (subt
))
11713 if (DECIMAL_FLOAT_TYPE_P (expt
) != DECIMAL_FLOAT_TYPE_P (subt
))
11716 if (TYPE_PRECISION (subt
) > TYPE_PRECISION (expt
))
11719 return strip_float_extensions (sub
);
11722 /* Strip out all handled components that produce invariant
11726 strip_invariant_refs (const_tree op
)
11728 while (handled_component_p (op
))
11730 switch (TREE_CODE (op
))
11733 case ARRAY_RANGE_REF
:
11734 if (!is_gimple_constant (TREE_OPERAND (op
, 1))
11735 || TREE_OPERAND (op
, 2) != NULL_TREE
11736 || TREE_OPERAND (op
, 3) != NULL_TREE
)
11740 case COMPONENT_REF
:
11741 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
11747 op
= TREE_OPERAND (op
, 0);
11753 static GTY(()) tree gcc_eh_personality_decl
;
11755 /* Return the GCC personality function decl. */
11758 lhd_gcc_personality (void)
11760 if (!gcc_eh_personality_decl
)
11761 gcc_eh_personality_decl
= build_personality_function ("gcc");
11762 return gcc_eh_personality_decl
;
11765 /* TARGET is a call target of GIMPLE call statement
11766 (obtained by gimple_call_fn). Return true if it is
11767 OBJ_TYPE_REF representing an virtual call of C++ method.
11768 (As opposed to OBJ_TYPE_REF representing objc calls
11769 through a cast where middle-end devirtualization machinery
11773 virtual_method_call_p (tree target
)
11775 if (TREE_CODE (target
) != OBJ_TYPE_REF
)
11777 target
= TREE_TYPE (target
);
11778 gcc_checking_assert (TREE_CODE (target
) == POINTER_TYPE
);
11779 target
= TREE_TYPE (target
);
11780 if (TREE_CODE (target
) == FUNCTION_TYPE
)
11782 gcc_checking_assert (TREE_CODE (target
) == METHOD_TYPE
);
11786 /* REF is OBJ_TYPE_REF, return the class the ref corresponds to. */
11789 obj_type_ref_class (tree ref
)
11791 gcc_checking_assert (TREE_CODE (ref
) == OBJ_TYPE_REF
);
11792 ref
= TREE_TYPE (ref
);
11793 gcc_checking_assert (TREE_CODE (ref
) == POINTER_TYPE
);
11794 ref
= TREE_TYPE (ref
);
11795 /* We look for type THIS points to. ObjC also builds
11796 OBJ_TYPE_REF with non-method calls, Their first parameter
11797 ID however also corresponds to class type. */
11798 gcc_checking_assert (TREE_CODE (ref
) == METHOD_TYPE
11799 || TREE_CODE (ref
) == FUNCTION_TYPE
);
11800 ref
= TREE_VALUE (TYPE_ARG_TYPES (ref
));
11801 gcc_checking_assert (TREE_CODE (ref
) == POINTER_TYPE
);
11802 return TREE_TYPE (ref
);
11805 /* Return true if T is in anonymous namespace. */
11808 type_in_anonymous_namespace_p (const_tree t
)
11810 /* TREE_PUBLIC of TYPE_STUB_DECL may not be properly set for
11811 bulitin types; those have CONTEXT NULL. */
11812 if (!TYPE_CONTEXT (t
))
11814 return (TYPE_STUB_DECL (t
) && !TREE_PUBLIC (TYPE_STUB_DECL (t
)));
11817 /* Try to find a base info of BINFO that would have its field decl at offset
11818 OFFSET within the BINFO type and which is of EXPECTED_TYPE. If it can be
11819 found, return, otherwise return NULL_TREE. */
11822 get_binfo_at_offset (tree binfo
, HOST_WIDE_INT offset
, tree expected_type
)
11824 tree type
= BINFO_TYPE (binfo
);
11828 HOST_WIDE_INT pos
, size
;
11832 if (types_same_for_odr (type
, expected_type
))
11837 for (fld
= TYPE_FIELDS (type
); fld
; fld
= DECL_CHAIN (fld
))
11839 if (TREE_CODE (fld
) != FIELD_DECL
)
11842 pos
= int_bit_position (fld
);
11843 size
= tree_to_uhwi (DECL_SIZE (fld
));
11844 if (pos
<= offset
&& (pos
+ size
) > offset
)
11847 if (!fld
|| TREE_CODE (TREE_TYPE (fld
)) != RECORD_TYPE
)
11850 if (!DECL_ARTIFICIAL (fld
))
11852 binfo
= TYPE_BINFO (TREE_TYPE (fld
));
11856 /* Offset 0 indicates the primary base, whose vtable contents are
11857 represented in the binfo for the derived class. */
11858 else if (offset
!= 0)
11860 tree base_binfo
, binfo2
= binfo
;
11862 /* Find BINFO corresponding to FLD. This is bit harder
11863 by a fact that in virtual inheritance we may need to walk down
11864 the non-virtual inheritance chain. */
11867 tree containing_binfo
= NULL
, found_binfo
= NULL
;
11868 for (i
= 0; BINFO_BASE_ITERATE (binfo2
, i
, base_binfo
); i
++)
11869 if (types_same_for_odr (TREE_TYPE (base_binfo
), TREE_TYPE (fld
)))
11871 found_binfo
= base_binfo
;
11875 if ((tree_to_shwi (BINFO_OFFSET (base_binfo
))
11876 - tree_to_shwi (BINFO_OFFSET (binfo
)))
11877 * BITS_PER_UNIT
< pos
11878 /* Rule out types with no virtual methods or we can get confused
11879 here by zero sized bases. */
11880 && BINFO_VTABLE (TYPE_BINFO (BINFO_TYPE (base_binfo
)))
11881 && (!containing_binfo
11882 || (tree_to_shwi (BINFO_OFFSET (containing_binfo
))
11883 < tree_to_shwi (BINFO_OFFSET (base_binfo
)))))
11884 containing_binfo
= base_binfo
;
11887 binfo
= found_binfo
;
11890 if (!containing_binfo
)
11892 binfo2
= containing_binfo
;
11896 type
= TREE_TYPE (fld
);
11901 /* Returns true if X is a typedef decl. */
11904 is_typedef_decl (tree x
)
11906 return (x
&& TREE_CODE (x
) == TYPE_DECL
11907 && DECL_ORIGINAL_TYPE (x
) != NULL_TREE
);
11910 /* Returns true iff TYPE is a type variant created for a typedef. */
11913 typedef_variant_p (tree type
)
11915 return is_typedef_decl (TYPE_NAME (type
));
11918 /* Warn about a use of an identifier which was marked deprecated. */
11920 warn_deprecated_use (tree node
, tree attr
)
11924 if (node
== 0 || !warn_deprecated_decl
)
11930 attr
= DECL_ATTRIBUTES (node
);
11931 else if (TYPE_P (node
))
11933 tree decl
= TYPE_STUB_DECL (node
);
11935 attr
= lookup_attribute ("deprecated",
11936 TYPE_ATTRIBUTES (TREE_TYPE (decl
)));
11941 attr
= lookup_attribute ("deprecated", attr
);
11944 msg
= TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr
)));
11950 expanded_location xloc
= expand_location (DECL_SOURCE_LOCATION (node
));
11952 warning (OPT_Wdeprecated_declarations
,
11953 "%qD is deprecated (declared at %r%s:%d%R): %s",
11954 node
, "locus", xloc
.file
, xloc
.line
, msg
);
11956 warning (OPT_Wdeprecated_declarations
,
11957 "%qD is deprecated (declared at %r%s:%d%R)",
11958 node
, "locus", xloc
.file
, xloc
.line
);
11960 else if (TYPE_P (node
))
11962 tree what
= NULL_TREE
;
11963 tree decl
= TYPE_STUB_DECL (node
);
11965 if (TYPE_NAME (node
))
11967 if (TREE_CODE (TYPE_NAME (node
)) == IDENTIFIER_NODE
)
11968 what
= TYPE_NAME (node
);
11969 else if (TREE_CODE (TYPE_NAME (node
)) == TYPE_DECL
11970 && DECL_NAME (TYPE_NAME (node
)))
11971 what
= DECL_NAME (TYPE_NAME (node
));
11976 expanded_location xloc
11977 = expand_location (DECL_SOURCE_LOCATION (decl
));
11981 warning (OPT_Wdeprecated_declarations
,
11982 "%qE is deprecated (declared at %r%s:%d%R): %s",
11983 what
, "locus", xloc
.file
, xloc
.line
, msg
);
11985 warning (OPT_Wdeprecated_declarations
,
11986 "%qE is deprecated (declared at %r%s:%d%R)",
11987 what
, "locus", xloc
.file
, xloc
.line
);
11992 warning (OPT_Wdeprecated_declarations
,
11993 "type is deprecated (declared at %r%s:%d%R): %s",
11994 "locus", xloc
.file
, xloc
.line
, msg
);
11996 warning (OPT_Wdeprecated_declarations
,
11997 "type is deprecated (declared at %r%s:%d%R)",
11998 "locus", xloc
.file
, xloc
.line
);
12006 warning (OPT_Wdeprecated_declarations
, "%qE is deprecated: %s",
12009 warning (OPT_Wdeprecated_declarations
, "%qE is deprecated", what
);
12014 warning (OPT_Wdeprecated_declarations
, "type is deprecated: %s",
12017 warning (OPT_Wdeprecated_declarations
, "type is deprecated");
12023 /* Return true if REF has a COMPONENT_REF with a bit-field field declaration
12024 somewhere in it. */
12027 contains_bitfld_component_ref_p (const_tree ref
)
12029 while (handled_component_p (ref
))
12031 if (TREE_CODE (ref
) == COMPONENT_REF
12032 && DECL_BIT_FIELD (TREE_OPERAND (ref
, 1)))
12034 ref
= TREE_OPERAND (ref
, 0);
12040 /* Try to determine whether a TRY_CATCH expression can fall through.
12041 This is a subroutine of block_may_fallthru. */
12044 try_catch_may_fallthru (const_tree stmt
)
12046 tree_stmt_iterator i
;
12048 /* If the TRY block can fall through, the whole TRY_CATCH can
12050 if (block_may_fallthru (TREE_OPERAND (stmt
, 0)))
12053 i
= tsi_start (TREE_OPERAND (stmt
, 1));
12054 switch (TREE_CODE (tsi_stmt (i
)))
12057 /* We expect to see a sequence of CATCH_EXPR trees, each with a
12058 catch expression and a body. The whole TRY_CATCH may fall
12059 through iff any of the catch bodies falls through. */
12060 for (; !tsi_end_p (i
); tsi_next (&i
))
12062 if (block_may_fallthru (CATCH_BODY (tsi_stmt (i
))))
12067 case EH_FILTER_EXPR
:
12068 /* The exception filter expression only matters if there is an
12069 exception. If the exception does not match EH_FILTER_TYPES,
12070 we will execute EH_FILTER_FAILURE, and we will fall through
12071 if that falls through. If the exception does match
12072 EH_FILTER_TYPES, the stack unwinder will continue up the
12073 stack, so we will not fall through. We don't know whether we
12074 will throw an exception which matches EH_FILTER_TYPES or not,
12075 so we just ignore EH_FILTER_TYPES and assume that we might
12076 throw an exception which doesn't match. */
12077 return block_may_fallthru (EH_FILTER_FAILURE (tsi_stmt (i
)));
12080 /* This case represents statements to be executed when an
12081 exception occurs. Those statements are implicitly followed
12082 by a RESX statement to resume execution after the exception.
12083 So in this case the TRY_CATCH never falls through. */
12088 /* Try to determine if we can fall out of the bottom of BLOCK. This guess
12089 need not be 100% accurate; simply be conservative and return true if we
12090 don't know. This is used only to avoid stupidly generating extra code.
12091 If we're wrong, we'll just delete the extra code later. */
12094 block_may_fallthru (const_tree block
)
12096 /* This CONST_CAST is okay because expr_last returns its argument
12097 unmodified and we assign it to a const_tree. */
12098 const_tree stmt
= expr_last (CONST_CAST_TREE (block
));
12100 switch (stmt
? TREE_CODE (stmt
) : ERROR_MARK
)
12104 /* Easy cases. If the last statement of the block implies
12105 control transfer, then we can't fall through. */
12109 /* If SWITCH_LABELS is set, this is lowered, and represents a
12110 branch to a selected label and hence can not fall through.
12111 Otherwise SWITCH_BODY is set, and the switch can fall
12113 return SWITCH_LABELS (stmt
) == NULL_TREE
;
12116 if (block_may_fallthru (COND_EXPR_THEN (stmt
)))
12118 return block_may_fallthru (COND_EXPR_ELSE (stmt
));
12121 return block_may_fallthru (BIND_EXPR_BODY (stmt
));
12123 case TRY_CATCH_EXPR
:
12124 return try_catch_may_fallthru (stmt
);
12126 case TRY_FINALLY_EXPR
:
12127 /* The finally clause is always executed after the try clause,
12128 so if it does not fall through, then the try-finally will not
12129 fall through. Otherwise, if the try clause does not fall
12130 through, then when the finally clause falls through it will
12131 resume execution wherever the try clause was going. So the
12132 whole try-finally will only fall through if both the try
12133 clause and the finally clause fall through. */
12134 return (block_may_fallthru (TREE_OPERAND (stmt
, 0))
12135 && block_may_fallthru (TREE_OPERAND (stmt
, 1)));
12138 if (TREE_CODE (TREE_OPERAND (stmt
, 1)) == CALL_EXPR
)
12139 stmt
= TREE_OPERAND (stmt
, 1);
12145 /* Functions that do not return do not fall through. */
12146 return (call_expr_flags (stmt
) & ECF_NORETURN
) == 0;
12148 case CLEANUP_POINT_EXPR
:
12149 return block_may_fallthru (TREE_OPERAND (stmt
, 0));
12152 return block_may_fallthru (TREE_OPERAND (stmt
, 1));
12158 return lang_hooks
.block_may_fallthru (stmt
);
12162 /* True if we are using EH to handle cleanups. */
12163 static bool using_eh_for_cleanups_flag
= false;
12165 /* This routine is called from front ends to indicate eh should be used for
12168 using_eh_for_cleanups (void)
12170 using_eh_for_cleanups_flag
= true;
12173 /* Query whether EH is used for cleanups. */
12175 using_eh_for_cleanups_p (void)
12177 return using_eh_for_cleanups_flag
;
12180 /* Wrapper for tree_code_name to ensure that tree code is valid */
12182 get_tree_code_name (enum tree_code code
)
12184 const char *invalid
= "<invalid tree code>";
12186 if (code
>= MAX_TREE_CODES
)
12189 return tree_code_name
[code
];
12192 /* Drops the TREE_OVERFLOW flag from T. */
12195 drop_tree_overflow (tree t
)
12197 gcc_checking_assert (TREE_OVERFLOW (t
));
12199 /* For tree codes with a sharing machinery re-build the result. */
12200 if (TREE_CODE (t
) == INTEGER_CST
)
12201 return wide_int_to_tree (TREE_TYPE (t
), t
);
12203 /* Otherwise, as all tcc_constants are possibly shared, copy the node
12204 and drop the flag. */
12206 TREE_OVERFLOW (t
) = 0;
12210 /* Given a memory reference expression T, return its base address.
12211 The base address of a memory reference expression is the main
12212 object being referenced. For instance, the base address for
12213 'array[i].fld[j]' is 'array'. You can think of this as stripping
12214 away the offset part from a memory address.
12216 This function calls handled_component_p to strip away all the inner
12217 parts of the memory reference until it reaches the base object. */
12220 get_base_address (tree t
)
12222 while (handled_component_p (t
))
12223 t
= TREE_OPERAND (t
, 0);
12225 if ((TREE_CODE (t
) == MEM_REF
12226 || TREE_CODE (t
) == TARGET_MEM_REF
)
12227 && TREE_CODE (TREE_OPERAND (t
, 0)) == ADDR_EXPR
)
12228 t
= TREE_OPERAND (TREE_OPERAND (t
, 0), 0);
12230 /* ??? Either the alias oracle or all callers need to properly deal
12231 with WITH_SIZE_EXPRs before we can look through those. */
12232 if (TREE_CODE (t
) == WITH_SIZE_EXPR
)
12238 #include "gt-tree.h"