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 the integer constant one. For complex and vector,
2173 return 1 if every piece is the integer constant one. */
2176 integer_each_onep (const_tree expr
)
2180 if (TREE_CODE (expr
) == COMPLEX_CST
)
2181 return (integer_onep (TREE_REALPART (expr
))
2182 && integer_onep (TREE_IMAGPART (expr
)));
2184 return integer_onep (expr
);
2187 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
2188 it contains, or a complex or vector whose subparts are such integers. */
2191 integer_all_onesp (const_tree expr
)
2195 if (TREE_CODE (expr
) == COMPLEX_CST
2196 && integer_all_onesp (TREE_REALPART (expr
))
2197 && integer_all_onesp (TREE_IMAGPART (expr
)))
2200 else if (TREE_CODE (expr
) == VECTOR_CST
)
2203 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2204 if (!integer_all_onesp (VECTOR_CST_ELT (expr
, i
)))
2209 else if (TREE_CODE (expr
) != INTEGER_CST
)
2212 return wi::max_value (TYPE_PRECISION (TREE_TYPE (expr
)), UNSIGNED
) == expr
;
2215 /* Return 1 if EXPR is the integer constant minus one. */
2218 integer_minus_onep (const_tree expr
)
2222 if (TREE_CODE (expr
) == COMPLEX_CST
)
2223 return (integer_all_onesp (TREE_REALPART (expr
))
2224 && integer_zerop (TREE_IMAGPART (expr
)));
2226 return integer_all_onesp (expr
);
2229 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
2233 integer_pow2p (const_tree expr
)
2237 if (TREE_CODE (expr
) == COMPLEX_CST
2238 && integer_pow2p (TREE_REALPART (expr
))
2239 && integer_zerop (TREE_IMAGPART (expr
)))
2242 if (TREE_CODE (expr
) != INTEGER_CST
)
2245 return wi::popcount (expr
) == 1;
2248 /* Return 1 if EXPR is an integer constant other than zero or a
2249 complex constant other than zero. */
2252 integer_nonzerop (const_tree expr
)
2256 return ((TREE_CODE (expr
) == INTEGER_CST
2257 && !wi::eq_p (expr
, 0))
2258 || (TREE_CODE (expr
) == COMPLEX_CST
2259 && (integer_nonzerop (TREE_REALPART (expr
))
2260 || integer_nonzerop (TREE_IMAGPART (expr
)))));
2263 /* Return 1 if EXPR is the fixed-point constant zero. */
2266 fixed_zerop (const_tree expr
)
2268 return (TREE_CODE (expr
) == FIXED_CST
2269 && TREE_FIXED_CST (expr
).data
.is_zero ());
2272 /* Return the power of two represented by a tree node known to be a
2276 tree_log2 (const_tree expr
)
2280 if (TREE_CODE (expr
) == COMPLEX_CST
)
2281 return tree_log2 (TREE_REALPART (expr
));
2283 return wi::exact_log2 (expr
);
2286 /* Similar, but return the largest integer Y such that 2 ** Y is less
2287 than or equal to EXPR. */
2290 tree_floor_log2 (const_tree expr
)
2294 if (TREE_CODE (expr
) == COMPLEX_CST
)
2295 return tree_log2 (TREE_REALPART (expr
));
2297 return wi::floor_log2 (expr
);
2300 /* Return number of known trailing zero bits in EXPR, or, if the value of
2301 EXPR is known to be zero, the precision of it's type. */
2304 tree_ctz (const_tree expr
)
2306 if (!INTEGRAL_TYPE_P (TREE_TYPE (expr
))
2307 && !POINTER_TYPE_P (TREE_TYPE (expr
)))
2310 unsigned int ret1
, ret2
, prec
= TYPE_PRECISION (TREE_TYPE (expr
));
2311 switch (TREE_CODE (expr
))
2314 ret1
= wi::ctz (expr
);
2315 return MIN (ret1
, prec
);
2317 ret1
= wi::ctz (get_nonzero_bits (expr
));
2318 return MIN (ret1
, prec
);
2325 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2328 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2329 return MIN (ret1
, ret2
);
2330 case POINTER_PLUS_EXPR
:
2331 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2332 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2333 /* Second operand is sizetype, which could be in theory
2334 wider than pointer's precision. Make sure we never
2335 return more than prec. */
2336 ret2
= MIN (ret2
, prec
);
2337 return MIN (ret1
, ret2
);
2339 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2340 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2341 return MAX (ret1
, ret2
);
2343 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2344 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2345 return MIN (ret1
+ ret2
, prec
);
2347 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2348 if (tree_fits_uhwi_p (TREE_OPERAND (expr
, 1))
2349 && (tree_to_uhwi (TREE_OPERAND (expr
, 1)) < prec
))
2351 ret2
= tree_to_uhwi (TREE_OPERAND (expr
, 1));
2352 return MIN (ret1
+ ret2
, prec
);
2356 if (tree_fits_uhwi_p (TREE_OPERAND (expr
, 1))
2357 && (tree_to_uhwi (TREE_OPERAND (expr
, 1)) < prec
))
2359 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2360 ret2
= tree_to_uhwi (TREE_OPERAND (expr
, 1));
2365 case TRUNC_DIV_EXPR
:
2367 case FLOOR_DIV_EXPR
:
2368 case ROUND_DIV_EXPR
:
2369 case EXACT_DIV_EXPR
:
2370 if (TREE_CODE (TREE_OPERAND (expr
, 1)) == INTEGER_CST
2371 && tree_int_cst_sgn (TREE_OPERAND (expr
, 1)) == 1)
2373 int l
= tree_log2 (TREE_OPERAND (expr
, 1));
2376 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2384 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2385 if (ret1
&& ret1
== TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (expr
, 0))))
2387 return MIN (ret1
, prec
);
2389 return tree_ctz (TREE_OPERAND (expr
, 0));
2391 ret1
= tree_ctz (TREE_OPERAND (expr
, 1));
2394 ret2
= tree_ctz (TREE_OPERAND (expr
, 2));
2395 return MIN (ret1
, ret2
);
2397 return tree_ctz (TREE_OPERAND (expr
, 1));
2399 ret1
= get_pointer_alignment (CONST_CAST_TREE (expr
));
2400 if (ret1
> BITS_PER_UNIT
)
2402 ret1
= ctz_hwi (ret1
/ BITS_PER_UNIT
);
2403 return MIN (ret1
, prec
);
2411 /* Return 1 if EXPR is the real constant zero. Trailing zeroes matter for
2412 decimal float constants, so don't return 1 for them. */
2415 real_zerop (const_tree expr
)
2419 switch (TREE_CODE (expr
))
2422 return REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst0
)
2423 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2425 return real_zerop (TREE_REALPART (expr
))
2426 && real_zerop (TREE_IMAGPART (expr
));
2430 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2431 if (!real_zerop (VECTOR_CST_ELT (expr
, i
)))
2440 /* Return 1 if EXPR is the real constant one in real or complex form.
2441 Trailing zeroes matter for decimal float constants, so don't return
2445 real_onep (const_tree expr
)
2449 switch (TREE_CODE (expr
))
2452 return REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst1
)
2453 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2455 return real_onep (TREE_REALPART (expr
))
2456 && real_zerop (TREE_IMAGPART (expr
));
2460 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2461 if (!real_onep (VECTOR_CST_ELT (expr
, i
)))
2470 /* Return 1 if EXPR is the real constant minus one. Trailing zeroes
2471 matter for decimal float constants, so don't return 1 for them. */
2474 real_minus_onep (const_tree expr
)
2478 switch (TREE_CODE (expr
))
2481 return REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconstm1
)
2482 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2484 return real_minus_onep (TREE_REALPART (expr
))
2485 && real_zerop (TREE_IMAGPART (expr
));
2489 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2490 if (!real_minus_onep (VECTOR_CST_ELT (expr
, i
)))
2499 /* Nonzero if EXP is a constant or a cast of a constant. */
2502 really_constant_p (const_tree exp
)
2504 /* This is not quite the same as STRIP_NOPS. It does more. */
2505 while (CONVERT_EXPR_P (exp
)
2506 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
2507 exp
= TREE_OPERAND (exp
, 0);
2508 return TREE_CONSTANT (exp
);
2511 /* Return first list element whose TREE_VALUE is ELEM.
2512 Return 0 if ELEM is not in LIST. */
2515 value_member (tree elem
, tree list
)
2519 if (elem
== TREE_VALUE (list
))
2521 list
= TREE_CHAIN (list
);
2526 /* Return first list element whose TREE_PURPOSE is ELEM.
2527 Return 0 if ELEM is not in LIST. */
2530 purpose_member (const_tree elem
, tree list
)
2534 if (elem
== TREE_PURPOSE (list
))
2536 list
= TREE_CHAIN (list
);
2541 /* Return true if ELEM is in V. */
2544 vec_member (const_tree elem
, vec
<tree
, va_gc
> *v
)
2548 FOR_EACH_VEC_SAFE_ELT (v
, ix
, t
)
2554 /* Returns element number IDX (zero-origin) of chain CHAIN, or
2558 chain_index (int idx
, tree chain
)
2560 for (; chain
&& idx
> 0; --idx
)
2561 chain
= TREE_CHAIN (chain
);
2565 /* Return nonzero if ELEM is part of the chain CHAIN. */
2568 chain_member (const_tree elem
, const_tree chain
)
2574 chain
= DECL_CHAIN (chain
);
2580 /* Return the length of a chain of nodes chained through TREE_CHAIN.
2581 We expect a null pointer to mark the end of the chain.
2582 This is the Lisp primitive `length'. */
2585 list_length (const_tree t
)
2588 #ifdef ENABLE_TREE_CHECKING
2596 #ifdef ENABLE_TREE_CHECKING
2599 gcc_assert (p
!= q
);
2607 /* Returns the first FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
2608 UNION_TYPE TYPE, or NULL_TREE if none. */
2611 first_field (const_tree type
)
2613 tree t
= TYPE_FIELDS (type
);
2614 while (t
&& TREE_CODE (t
) != FIELD_DECL
)
2619 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
2620 by modifying the last node in chain 1 to point to chain 2.
2621 This is the Lisp primitive `nconc'. */
2624 chainon (tree op1
, tree op2
)
2633 for (t1
= op1
; TREE_CHAIN (t1
); t1
= TREE_CHAIN (t1
))
2635 TREE_CHAIN (t1
) = op2
;
2637 #ifdef ENABLE_TREE_CHECKING
2640 for (t2
= op2
; t2
; t2
= TREE_CHAIN (t2
))
2641 gcc_assert (t2
!= t1
);
2648 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
2651 tree_last (tree chain
)
2655 while ((next
= TREE_CHAIN (chain
)))
2660 /* Reverse the order of elements in the chain T,
2661 and return the new head of the chain (old last element). */
2666 tree prev
= 0, decl
, next
;
2667 for (decl
= t
; decl
; decl
= next
)
2669 /* We shouldn't be using this function to reverse BLOCK chains; we
2670 have blocks_nreverse for that. */
2671 gcc_checking_assert (TREE_CODE (decl
) != BLOCK
);
2672 next
= TREE_CHAIN (decl
);
2673 TREE_CHAIN (decl
) = prev
;
2679 /* Return a newly created TREE_LIST node whose
2680 purpose and value fields are PARM and VALUE. */
2683 build_tree_list_stat (tree parm
, tree value MEM_STAT_DECL
)
2685 tree t
= make_node_stat (TREE_LIST PASS_MEM_STAT
);
2686 TREE_PURPOSE (t
) = parm
;
2687 TREE_VALUE (t
) = value
;
2691 /* Build a chain of TREE_LIST nodes from a vector. */
2694 build_tree_list_vec_stat (const vec
<tree
, va_gc
> *vec MEM_STAT_DECL
)
2696 tree ret
= NULL_TREE
;
2700 FOR_EACH_VEC_SAFE_ELT (vec
, i
, t
)
2702 *pp
= build_tree_list_stat (NULL
, t PASS_MEM_STAT
);
2703 pp
= &TREE_CHAIN (*pp
);
2708 /* Return a newly created TREE_LIST node whose
2709 purpose and value fields are PURPOSE and VALUE
2710 and whose TREE_CHAIN is CHAIN. */
2713 tree_cons_stat (tree purpose
, tree value
, tree chain MEM_STAT_DECL
)
2717 node
= ggc_alloc_tree_node_stat (sizeof (struct tree_list
) PASS_MEM_STAT
);
2718 memset (node
, 0, sizeof (struct tree_common
));
2720 record_node_allocation_statistics (TREE_LIST
, sizeof (struct tree_list
));
2722 TREE_SET_CODE (node
, TREE_LIST
);
2723 TREE_CHAIN (node
) = chain
;
2724 TREE_PURPOSE (node
) = purpose
;
2725 TREE_VALUE (node
) = value
;
2729 /* Return the values of the elements of a CONSTRUCTOR as a vector of
2733 ctor_to_vec (tree ctor
)
2735 vec
<tree
, va_gc
> *vec
;
2736 vec_alloc (vec
, CONSTRUCTOR_NELTS (ctor
));
2740 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), ix
, val
)
2741 vec
->quick_push (val
);
2746 /* Return the size nominally occupied by an object of type TYPE
2747 when it resides in memory. The value is measured in units of bytes,
2748 and its data type is that normally used for type sizes
2749 (which is the first type created by make_signed_type or
2750 make_unsigned_type). */
2753 size_in_bytes (const_tree type
)
2757 if (type
== error_mark_node
)
2758 return integer_zero_node
;
2760 type
= TYPE_MAIN_VARIANT (type
);
2761 t
= TYPE_SIZE_UNIT (type
);
2765 lang_hooks
.types
.incomplete_type_error (NULL_TREE
, type
);
2766 return size_zero_node
;
2772 /* Return the size of TYPE (in bytes) as a wide integer
2773 or return -1 if the size can vary or is larger than an integer. */
2776 int_size_in_bytes (const_tree type
)
2780 if (type
== error_mark_node
)
2783 type
= TYPE_MAIN_VARIANT (type
);
2784 t
= TYPE_SIZE_UNIT (type
);
2786 if (t
&& tree_fits_uhwi_p (t
))
2787 return TREE_INT_CST_LOW (t
);
2792 /* Return the maximum size of TYPE (in bytes) as a wide integer
2793 or return -1 if the size can vary or is larger than an integer. */
2796 max_int_size_in_bytes (const_tree type
)
2798 HOST_WIDE_INT size
= -1;
2801 /* If this is an array type, check for a possible MAX_SIZE attached. */
2803 if (TREE_CODE (type
) == ARRAY_TYPE
)
2805 size_tree
= TYPE_ARRAY_MAX_SIZE (type
);
2807 if (size_tree
&& tree_fits_uhwi_p (size_tree
))
2808 size
= tree_to_uhwi (size_tree
);
2811 /* If we still haven't been able to get a size, see if the language
2812 can compute a maximum size. */
2816 size_tree
= lang_hooks
.types
.max_size (type
);
2818 if (size_tree
&& tree_fits_uhwi_p (size_tree
))
2819 size
= tree_to_uhwi (size_tree
);
2825 /* Return the bit position of FIELD, in bits from the start of the record.
2826 This is a tree of type bitsizetype. */
2829 bit_position (const_tree field
)
2831 return bit_from_pos (DECL_FIELD_OFFSET (field
),
2832 DECL_FIELD_BIT_OFFSET (field
));
2835 /* Likewise, but return as an integer. It must be representable in
2836 that way (since it could be a signed value, we don't have the
2837 option of returning -1 like int_size_in_byte can. */
2840 int_bit_position (const_tree field
)
2842 return tree_to_shwi (bit_position (field
));
2845 /* Return the byte position of FIELD, in bytes from the start of the record.
2846 This is a tree of type sizetype. */
2849 byte_position (const_tree field
)
2851 return byte_from_pos (DECL_FIELD_OFFSET (field
),
2852 DECL_FIELD_BIT_OFFSET (field
));
2855 /* Likewise, but return as an integer. It must be representable in
2856 that way (since it could be a signed value, we don't have the
2857 option of returning -1 like int_size_in_byte can. */
2860 int_byte_position (const_tree field
)
2862 return tree_to_shwi (byte_position (field
));
2865 /* Return the strictest alignment, in bits, that T is known to have. */
2868 expr_align (const_tree t
)
2870 unsigned int align0
, align1
;
2872 switch (TREE_CODE (t
))
2874 CASE_CONVERT
: case NON_LVALUE_EXPR
:
2875 /* If we have conversions, we know that the alignment of the
2876 object must meet each of the alignments of the types. */
2877 align0
= expr_align (TREE_OPERAND (t
, 0));
2878 align1
= TYPE_ALIGN (TREE_TYPE (t
));
2879 return MAX (align0
, align1
);
2881 case SAVE_EXPR
: case COMPOUND_EXPR
: case MODIFY_EXPR
:
2882 case INIT_EXPR
: case TARGET_EXPR
: case WITH_CLEANUP_EXPR
:
2883 case CLEANUP_POINT_EXPR
:
2884 /* These don't change the alignment of an object. */
2885 return expr_align (TREE_OPERAND (t
, 0));
2888 /* The best we can do is say that the alignment is the least aligned
2890 align0
= expr_align (TREE_OPERAND (t
, 1));
2891 align1
= expr_align (TREE_OPERAND (t
, 2));
2892 return MIN (align0
, align1
);
2894 /* FIXME: LABEL_DECL and CONST_DECL never have DECL_ALIGN set
2895 meaningfully, it's always 1. */
2896 case LABEL_DECL
: case CONST_DECL
:
2897 case VAR_DECL
: case PARM_DECL
: case RESULT_DECL
:
2899 gcc_assert (DECL_ALIGN (t
) != 0);
2900 return DECL_ALIGN (t
);
2906 /* Otherwise take the alignment from that of the type. */
2907 return TYPE_ALIGN (TREE_TYPE (t
));
2910 /* Return, as a tree node, the number of elements for TYPE (which is an
2911 ARRAY_TYPE) minus one. This counts only elements of the top array. */
2914 array_type_nelts (const_tree type
)
2916 tree index_type
, min
, max
;
2918 /* If they did it with unspecified bounds, then we should have already
2919 given an error about it before we got here. */
2920 if (! TYPE_DOMAIN (type
))
2921 return error_mark_node
;
2923 index_type
= TYPE_DOMAIN (type
);
2924 min
= TYPE_MIN_VALUE (index_type
);
2925 max
= TYPE_MAX_VALUE (index_type
);
2927 /* TYPE_MAX_VALUE may not be set if the array has unknown length. */
2929 return error_mark_node
;
2931 return (integer_zerop (min
)
2933 : fold_build2 (MINUS_EXPR
, TREE_TYPE (max
), max
, min
));
2936 /* If arg is static -- a reference to an object in static storage -- then
2937 return the object. This is not the same as the C meaning of `static'.
2938 If arg isn't static, return NULL. */
2943 switch (TREE_CODE (arg
))
2946 /* Nested functions are static, even though taking their address will
2947 involve a trampoline as we unnest the nested function and create
2948 the trampoline on the tree level. */
2952 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
2953 && ! DECL_THREAD_LOCAL_P (arg
)
2954 && ! DECL_DLLIMPORT_P (arg
)
2958 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
2962 return TREE_STATIC (arg
) ? arg
: NULL
;
2969 /* If the thing being referenced is not a field, then it is
2970 something language specific. */
2971 gcc_assert (TREE_CODE (TREE_OPERAND (arg
, 1)) == FIELD_DECL
);
2973 /* If we are referencing a bitfield, we can't evaluate an
2974 ADDR_EXPR at compile time and so it isn't a constant. */
2975 if (DECL_BIT_FIELD (TREE_OPERAND (arg
, 1)))
2978 return staticp (TREE_OPERAND (arg
, 0));
2984 return TREE_CONSTANT (TREE_OPERAND (arg
, 0)) ? arg
: NULL
;
2987 case ARRAY_RANGE_REF
:
2988 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg
))) == INTEGER_CST
2989 && TREE_CODE (TREE_OPERAND (arg
, 1)) == INTEGER_CST
)
2990 return staticp (TREE_OPERAND (arg
, 0));
2994 case COMPOUND_LITERAL_EXPR
:
2995 return TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (arg
)) ? arg
: NULL
;
3005 /* Return whether OP is a DECL whose address is function-invariant. */
3008 decl_address_invariant_p (const_tree op
)
3010 /* The conditions below are slightly less strict than the one in
3013 switch (TREE_CODE (op
))
3022 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
3023 || DECL_THREAD_LOCAL_P (op
)
3024 || DECL_CONTEXT (op
) == current_function_decl
3025 || decl_function_context (op
) == current_function_decl
)
3030 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
3031 || decl_function_context (op
) == current_function_decl
)
3042 /* Return whether OP is a DECL whose address is interprocedural-invariant. */
3045 decl_address_ip_invariant_p (const_tree op
)
3047 /* The conditions below are slightly less strict than the one in
3050 switch (TREE_CODE (op
))
3058 if (((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
3059 && !DECL_DLLIMPORT_P (op
))
3060 || DECL_THREAD_LOCAL_P (op
))
3065 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
)))
3077 /* Return true if T is function-invariant (internal function, does
3078 not handle arithmetic; that's handled in skip_simple_arithmetic and
3079 tree_invariant_p). */
3081 static bool tree_invariant_p (tree t
);
3084 tree_invariant_p_1 (tree t
)
3088 if (TREE_CONSTANT (t
)
3089 || (TREE_READONLY (t
) && !TREE_SIDE_EFFECTS (t
)))
3092 switch (TREE_CODE (t
))
3098 op
= TREE_OPERAND (t
, 0);
3099 while (handled_component_p (op
))
3101 switch (TREE_CODE (op
))
3104 case ARRAY_RANGE_REF
:
3105 if (!tree_invariant_p (TREE_OPERAND (op
, 1))
3106 || TREE_OPERAND (op
, 2) != NULL_TREE
3107 || TREE_OPERAND (op
, 3) != NULL_TREE
)
3112 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
3118 op
= TREE_OPERAND (op
, 0);
3121 return CONSTANT_CLASS_P (op
) || decl_address_invariant_p (op
);
3130 /* Return true if T is function-invariant. */
3133 tree_invariant_p (tree t
)
3135 tree inner
= skip_simple_arithmetic (t
);
3136 return tree_invariant_p_1 (inner
);
3139 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
3140 Do this to any expression which may be used in more than one place,
3141 but must be evaluated only once.
3143 Normally, expand_expr would reevaluate the expression each time.
3144 Calling save_expr produces something that is evaluated and recorded
3145 the first time expand_expr is called on it. Subsequent calls to
3146 expand_expr just reuse the recorded value.
3148 The call to expand_expr that generates code that actually computes
3149 the value is the first call *at compile time*. Subsequent calls
3150 *at compile time* generate code to use the saved value.
3151 This produces correct result provided that *at run time* control
3152 always flows through the insns made by the first expand_expr
3153 before reaching the other places where the save_expr was evaluated.
3154 You, the caller of save_expr, must make sure this is so.
3156 Constants, and certain read-only nodes, are returned with no
3157 SAVE_EXPR because that is safe. Expressions containing placeholders
3158 are not touched; see tree.def for an explanation of what these
3162 save_expr (tree expr
)
3164 tree t
= fold (expr
);
3167 /* If the tree evaluates to a constant, then we don't want to hide that
3168 fact (i.e. this allows further folding, and direct checks for constants).
3169 However, a read-only object that has side effects cannot be bypassed.
3170 Since it is no problem to reevaluate literals, we just return the
3172 inner
= skip_simple_arithmetic (t
);
3173 if (TREE_CODE (inner
) == ERROR_MARK
)
3176 if (tree_invariant_p_1 (inner
))
3179 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
3180 it means that the size or offset of some field of an object depends on
3181 the value within another field.
3183 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
3184 and some variable since it would then need to be both evaluated once and
3185 evaluated more than once. Front-ends must assure this case cannot
3186 happen by surrounding any such subexpressions in their own SAVE_EXPR
3187 and forcing evaluation at the proper time. */
3188 if (contains_placeholder_p (inner
))
3191 t
= build1 (SAVE_EXPR
, TREE_TYPE (expr
), t
);
3192 SET_EXPR_LOCATION (t
, EXPR_LOCATION (expr
));
3194 /* This expression might be placed ahead of a jump to ensure that the
3195 value was computed on both sides of the jump. So make sure it isn't
3196 eliminated as dead. */
3197 TREE_SIDE_EFFECTS (t
) = 1;
3201 /* Look inside EXPR into any simple arithmetic operations. Return the
3202 outermost non-arithmetic or non-invariant node. */
3205 skip_simple_arithmetic (tree expr
)
3207 /* We don't care about whether this can be used as an lvalue in this
3209 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
3210 expr
= TREE_OPERAND (expr
, 0);
3212 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
3213 a constant, it will be more efficient to not make another SAVE_EXPR since
3214 it will allow better simplification and GCSE will be able to merge the
3215 computations if they actually occur. */
3218 if (UNARY_CLASS_P (expr
))
3219 expr
= TREE_OPERAND (expr
, 0);
3220 else if (BINARY_CLASS_P (expr
))
3222 if (tree_invariant_p (TREE_OPERAND (expr
, 1)))
3223 expr
= TREE_OPERAND (expr
, 0);
3224 else if (tree_invariant_p (TREE_OPERAND (expr
, 0)))
3225 expr
= TREE_OPERAND (expr
, 1);
3236 /* Look inside EXPR into simple arithmetic operations involving constants.
3237 Return the outermost non-arithmetic or non-constant node. */
3240 skip_simple_constant_arithmetic (tree expr
)
3242 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
3243 expr
= TREE_OPERAND (expr
, 0);
3247 if (UNARY_CLASS_P (expr
))
3248 expr
= TREE_OPERAND (expr
, 0);
3249 else if (BINARY_CLASS_P (expr
))
3251 if (TREE_CONSTANT (TREE_OPERAND (expr
, 1)))
3252 expr
= TREE_OPERAND (expr
, 0);
3253 else if (TREE_CONSTANT (TREE_OPERAND (expr
, 0)))
3254 expr
= TREE_OPERAND (expr
, 1);
3265 /* Return which tree structure is used by T. */
3267 enum tree_node_structure_enum
3268 tree_node_structure (const_tree t
)
3270 const enum tree_code code
= TREE_CODE (t
);
3271 return tree_node_structure_for_code (code
);
3274 /* Set various status flags when building a CALL_EXPR object T. */
3277 process_call_operands (tree t
)
3279 bool side_effects
= TREE_SIDE_EFFECTS (t
);
3280 bool read_only
= false;
3281 int i
= call_expr_flags (t
);
3283 /* Calls have side-effects, except those to const or pure functions. */
3284 if ((i
& ECF_LOOPING_CONST_OR_PURE
) || !(i
& (ECF_CONST
| ECF_PURE
)))
3285 side_effects
= true;
3286 /* Propagate TREE_READONLY of arguments for const functions. */
3290 if (!side_effects
|| read_only
)
3291 for (i
= 1; i
< TREE_OPERAND_LENGTH (t
); i
++)
3293 tree op
= TREE_OPERAND (t
, i
);
3294 if (op
&& TREE_SIDE_EFFECTS (op
))
3295 side_effects
= true;
3296 if (op
&& !TREE_READONLY (op
) && !CONSTANT_CLASS_P (op
))
3300 TREE_SIDE_EFFECTS (t
) = side_effects
;
3301 TREE_READONLY (t
) = read_only
;
3304 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
3305 size or offset that depends on a field within a record. */
3308 contains_placeholder_p (const_tree exp
)
3310 enum tree_code code
;
3315 code
= TREE_CODE (exp
);
3316 if (code
== PLACEHOLDER_EXPR
)
3319 switch (TREE_CODE_CLASS (code
))
3322 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
3323 position computations since they will be converted into a
3324 WITH_RECORD_EXPR involving the reference, which will assume
3325 here will be valid. */
3326 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
3328 case tcc_exceptional
:
3329 if (code
== TREE_LIST
)
3330 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp
))
3331 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp
)));
3336 case tcc_comparison
:
3337 case tcc_expression
:
3341 /* Ignoring the first operand isn't quite right, but works best. */
3342 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1));
3345 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
3346 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1))
3347 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 2)));
3350 /* The save_expr function never wraps anything containing
3351 a PLACEHOLDER_EXPR. */
3358 switch (TREE_CODE_LENGTH (code
))
3361 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
3363 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
3364 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1)));
3375 const_call_expr_arg_iterator iter
;
3376 FOR_EACH_CONST_CALL_EXPR_ARG (arg
, iter
, exp
)
3377 if (CONTAINS_PLACEHOLDER_P (arg
))
3391 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
3392 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
3396 type_contains_placeholder_1 (const_tree type
)
3398 /* If the size contains a placeholder or the parent type (component type in
3399 the case of arrays) type involves a placeholder, this type does. */
3400 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type
))
3401 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type
))
3402 || (!POINTER_TYPE_P (type
)
3404 && type_contains_placeholder_p (TREE_TYPE (type
))))
3407 /* Now do type-specific checks. Note that the last part of the check above
3408 greatly limits what we have to do below. */
3409 switch (TREE_CODE (type
))
3417 case REFERENCE_TYPE
:
3426 case FIXED_POINT_TYPE
:
3427 /* Here we just check the bounds. */
3428 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type
))
3429 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type
)));
3432 /* We have already checked the component type above, so just check the
3434 return type_contains_placeholder_p (TYPE_DOMAIN (type
));
3438 case QUAL_UNION_TYPE
:
3442 for (field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
3443 if (TREE_CODE (field
) == FIELD_DECL
3444 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field
))
3445 || (TREE_CODE (type
) == QUAL_UNION_TYPE
3446 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field
)))
3447 || type_contains_placeholder_p (TREE_TYPE (field
))))
3458 /* Wrapper around above function used to cache its result. */
3461 type_contains_placeholder_p (tree type
)
3465 /* If the contains_placeholder_bits field has been initialized,
3466 then we know the answer. */
3467 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) > 0)
3468 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) - 1;
3470 /* Indicate that we've seen this type node, and the answer is false.
3471 This is what we want to return if we run into recursion via fields. */
3472 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = 1;
3474 /* Compute the real value. */
3475 result
= type_contains_placeholder_1 (type
);
3477 /* Store the real value. */
3478 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = result
+ 1;
3483 /* Push tree EXP onto vector QUEUE if it is not already present. */
3486 push_without_duplicates (tree exp
, vec
<tree
> *queue
)
3491 FOR_EACH_VEC_ELT (*queue
, i
, iter
)
3492 if (simple_cst_equal (iter
, exp
) == 1)
3496 queue
->safe_push (exp
);
3499 /* Given a tree EXP, find all occurrences of references to fields
3500 in a PLACEHOLDER_EXPR and place them in vector REFS without
3501 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
3502 we assume here that EXP contains only arithmetic expressions
3503 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
3507 find_placeholder_in_expr (tree exp
, vec
<tree
> *refs
)
3509 enum tree_code code
= TREE_CODE (exp
);
3513 /* We handle TREE_LIST and COMPONENT_REF separately. */
3514 if (code
== TREE_LIST
)
3516 FIND_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), refs
);
3517 FIND_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), refs
);
3519 else if (code
== COMPONENT_REF
)
3521 for (inner
= TREE_OPERAND (exp
, 0);
3522 REFERENCE_CLASS_P (inner
);
3523 inner
= TREE_OPERAND (inner
, 0))
3526 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
)
3527 push_without_duplicates (exp
, refs
);
3529 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), refs
);
3532 switch (TREE_CODE_CLASS (code
))
3537 case tcc_declaration
:
3538 /* Variables allocated to static storage can stay. */
3539 if (!TREE_STATIC (exp
))
3540 push_without_duplicates (exp
, refs
);
3543 case tcc_expression
:
3544 /* This is the pattern built in ada/make_aligning_type. */
3545 if (code
== ADDR_EXPR
3546 && TREE_CODE (TREE_OPERAND (exp
, 0)) == PLACEHOLDER_EXPR
)
3548 push_without_duplicates (exp
, refs
);
3552 /* Fall through... */
3554 case tcc_exceptional
:
3557 case tcc_comparison
:
3559 for (i
= 0; i
< TREE_CODE_LENGTH (code
); i
++)
3560 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
3564 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3565 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
3573 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
3574 return a tree with all occurrences of references to F in a
3575 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
3576 CONST_DECLs. Note that we assume here that EXP contains only
3577 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
3578 occurring only in their argument list. */
3581 substitute_in_expr (tree exp
, tree f
, tree r
)
3583 enum tree_code code
= TREE_CODE (exp
);
3584 tree op0
, op1
, op2
, op3
;
3587 /* We handle TREE_LIST and COMPONENT_REF separately. */
3588 if (code
== TREE_LIST
)
3590 op0
= SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp
), f
, r
);
3591 op1
= SUBSTITUTE_IN_EXPR (TREE_VALUE (exp
), f
, r
);
3592 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
3595 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
3597 else if (code
== COMPONENT_REF
)
3601 /* If this expression is getting a value from a PLACEHOLDER_EXPR
3602 and it is the right field, replace it with R. */
3603 for (inner
= TREE_OPERAND (exp
, 0);
3604 REFERENCE_CLASS_P (inner
);
3605 inner
= TREE_OPERAND (inner
, 0))
3609 op1
= TREE_OPERAND (exp
, 1);
3611 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& op1
== f
)
3614 /* If this expression hasn't been completed let, leave it alone. */
3615 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& !TREE_TYPE (inner
))
3618 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3619 if (op0
== TREE_OPERAND (exp
, 0))
3623 = fold_build3 (COMPONENT_REF
, TREE_TYPE (exp
), op0
, op1
, NULL_TREE
);
3626 switch (TREE_CODE_CLASS (code
))
3631 case tcc_declaration
:
3637 case tcc_expression
:
3641 /* Fall through... */
3643 case tcc_exceptional
:
3646 case tcc_comparison
:
3648 switch (TREE_CODE_LENGTH (code
))
3654 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3655 if (op0
== TREE_OPERAND (exp
, 0))
3658 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
3662 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3663 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3665 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
3668 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
3672 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3673 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3674 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
3676 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3677 && op2
== TREE_OPERAND (exp
, 2))
3680 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
3684 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3685 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3686 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
3687 op3
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 3), f
, r
);
3689 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3690 && op2
== TREE_OPERAND (exp
, 2)
3691 && op3
== TREE_OPERAND (exp
, 3))
3695 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
3707 new_tree
= NULL_TREE
;
3709 /* If we are trying to replace F with a constant, inline back
3710 functions which do nothing else than computing a value from
3711 the arguments they are passed. This makes it possible to
3712 fold partially or entirely the replacement expression. */
3713 if (CONSTANT_CLASS_P (r
) && code
== CALL_EXPR
)
3715 tree t
= maybe_inline_call_in_expr (exp
);
3717 return SUBSTITUTE_IN_EXPR (t
, f
, r
);
3720 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3722 tree op
= TREE_OPERAND (exp
, i
);
3723 tree new_op
= SUBSTITUTE_IN_EXPR (op
, f
, r
);
3727 new_tree
= copy_node (exp
);
3728 TREE_OPERAND (new_tree
, i
) = new_op
;
3734 new_tree
= fold (new_tree
);
3735 if (TREE_CODE (new_tree
) == CALL_EXPR
)
3736 process_call_operands (new_tree
);
3747 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
3749 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
3750 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
3755 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
3756 for it within OBJ, a tree that is an object or a chain of references. */
3759 substitute_placeholder_in_expr (tree exp
, tree obj
)
3761 enum tree_code code
= TREE_CODE (exp
);
3762 tree op0
, op1
, op2
, op3
;
3765 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
3766 in the chain of OBJ. */
3767 if (code
== PLACEHOLDER_EXPR
)
3769 tree need_type
= TYPE_MAIN_VARIANT (TREE_TYPE (exp
));
3772 for (elt
= obj
; elt
!= 0;
3773 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
3774 || TREE_CODE (elt
) == COND_EXPR
)
3775 ? TREE_OPERAND (elt
, 1)
3776 : (REFERENCE_CLASS_P (elt
)
3777 || UNARY_CLASS_P (elt
)
3778 || BINARY_CLASS_P (elt
)
3779 || VL_EXP_CLASS_P (elt
)
3780 || EXPRESSION_CLASS_P (elt
))
3781 ? TREE_OPERAND (elt
, 0) : 0))
3782 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt
)) == need_type
)
3785 for (elt
= obj
; elt
!= 0;
3786 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
3787 || TREE_CODE (elt
) == COND_EXPR
)
3788 ? TREE_OPERAND (elt
, 1)
3789 : (REFERENCE_CLASS_P (elt
)
3790 || UNARY_CLASS_P (elt
)
3791 || BINARY_CLASS_P (elt
)
3792 || VL_EXP_CLASS_P (elt
)
3793 || EXPRESSION_CLASS_P (elt
))
3794 ? TREE_OPERAND (elt
, 0) : 0))
3795 if (POINTER_TYPE_P (TREE_TYPE (elt
))
3796 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt
)))
3798 return fold_build1 (INDIRECT_REF
, need_type
, elt
);
3800 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
3801 survives until RTL generation, there will be an error. */
3805 /* TREE_LIST is special because we need to look at TREE_VALUE
3806 and TREE_CHAIN, not TREE_OPERANDS. */
3807 else if (code
== TREE_LIST
)
3809 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), obj
);
3810 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), obj
);
3811 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
3814 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
3817 switch (TREE_CODE_CLASS (code
))
3820 case tcc_declaration
:
3823 case tcc_exceptional
:
3826 case tcc_comparison
:
3827 case tcc_expression
:
3830 switch (TREE_CODE_LENGTH (code
))
3836 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3837 if (op0
== TREE_OPERAND (exp
, 0))
3840 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
3844 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3845 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
3847 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
3850 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
3854 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3855 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
3856 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
3858 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3859 && op2
== TREE_OPERAND (exp
, 2))
3862 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
3866 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3867 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
3868 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
3869 op3
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 3), obj
);
3871 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3872 && op2
== TREE_OPERAND (exp
, 2)
3873 && op3
== TREE_OPERAND (exp
, 3))
3877 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
3889 new_tree
= NULL_TREE
;
3891 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3893 tree op
= TREE_OPERAND (exp
, i
);
3894 tree new_op
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (op
, obj
);
3898 new_tree
= copy_node (exp
);
3899 TREE_OPERAND (new_tree
, i
) = new_op
;
3905 new_tree
= fold (new_tree
);
3906 if (TREE_CODE (new_tree
) == CALL_EXPR
)
3907 process_call_operands (new_tree
);
3918 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
3920 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
3921 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
3927 /* Subroutine of stabilize_reference; this is called for subtrees of
3928 references. Any expression with side-effects must be put in a SAVE_EXPR
3929 to ensure that it is only evaluated once.
3931 We don't put SAVE_EXPR nodes around everything, because assigning very
3932 simple expressions to temporaries causes us to miss good opportunities
3933 for optimizations. Among other things, the opportunity to fold in the
3934 addition of a constant into an addressing mode often gets lost, e.g.
3935 "y[i+1] += x;". In general, we take the approach that we should not make
3936 an assignment unless we are forced into it - i.e., that any non-side effect
3937 operator should be allowed, and that cse should take care of coalescing
3938 multiple utterances of the same expression should that prove fruitful. */
3941 stabilize_reference_1 (tree e
)
3944 enum tree_code code
= TREE_CODE (e
);
3946 /* We cannot ignore const expressions because it might be a reference
3947 to a const array but whose index contains side-effects. But we can
3948 ignore things that are actual constant or that already have been
3949 handled by this function. */
3951 if (tree_invariant_p (e
))
3954 switch (TREE_CODE_CLASS (code
))
3956 case tcc_exceptional
:
3958 case tcc_declaration
:
3959 case tcc_comparison
:
3961 case tcc_expression
:
3964 /* If the expression has side-effects, then encase it in a SAVE_EXPR
3965 so that it will only be evaluated once. */
3966 /* The reference (r) and comparison (<) classes could be handled as
3967 below, but it is generally faster to only evaluate them once. */
3968 if (TREE_SIDE_EFFECTS (e
))
3969 return save_expr (e
);
3973 /* Constants need no processing. In fact, we should never reach
3978 /* Division is slow and tends to be compiled with jumps,
3979 especially the division by powers of 2 that is often
3980 found inside of an array reference. So do it just once. */
3981 if (code
== TRUNC_DIV_EXPR
|| code
== TRUNC_MOD_EXPR
3982 || code
== FLOOR_DIV_EXPR
|| code
== FLOOR_MOD_EXPR
3983 || code
== CEIL_DIV_EXPR
|| code
== CEIL_MOD_EXPR
3984 || code
== ROUND_DIV_EXPR
|| code
== ROUND_MOD_EXPR
)
3985 return save_expr (e
);
3986 /* Recursively stabilize each operand. */
3987 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)),
3988 stabilize_reference_1 (TREE_OPERAND (e
, 1)));
3992 /* Recursively stabilize each operand. */
3993 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)));
4000 TREE_TYPE (result
) = TREE_TYPE (e
);
4001 TREE_READONLY (result
) = TREE_READONLY (e
);
4002 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (e
);
4003 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (e
);
4008 /* Stabilize a reference so that we can use it any number of times
4009 without causing its operands to be evaluated more than once.
4010 Returns the stabilized reference. This works by means of save_expr,
4011 so see the caveats in the comments about save_expr.
4013 Also allows conversion expressions whose operands are references.
4014 Any other kind of expression is returned unchanged. */
4017 stabilize_reference (tree ref
)
4020 enum tree_code code
= TREE_CODE (ref
);
4027 /* No action is needed in this case. */
4032 case FIX_TRUNC_EXPR
:
4033 result
= build_nt (code
, stabilize_reference (TREE_OPERAND (ref
, 0)));
4037 result
= build_nt (INDIRECT_REF
,
4038 stabilize_reference_1 (TREE_OPERAND (ref
, 0)));
4042 result
= build_nt (COMPONENT_REF
,
4043 stabilize_reference (TREE_OPERAND (ref
, 0)),
4044 TREE_OPERAND (ref
, 1), NULL_TREE
);
4048 result
= build_nt (BIT_FIELD_REF
,
4049 stabilize_reference (TREE_OPERAND (ref
, 0)),
4050 TREE_OPERAND (ref
, 1), TREE_OPERAND (ref
, 2));
4054 result
= build_nt (ARRAY_REF
,
4055 stabilize_reference (TREE_OPERAND (ref
, 0)),
4056 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
4057 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
4060 case ARRAY_RANGE_REF
:
4061 result
= build_nt (ARRAY_RANGE_REF
,
4062 stabilize_reference (TREE_OPERAND (ref
, 0)),
4063 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
4064 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
4068 /* We cannot wrap the first expression in a SAVE_EXPR, as then
4069 it wouldn't be ignored. This matters when dealing with
4071 return stabilize_reference_1 (ref
);
4073 /* If arg isn't a kind of lvalue we recognize, make no change.
4074 Caller should recognize the error for an invalid lvalue. */
4079 return error_mark_node
;
4082 TREE_TYPE (result
) = TREE_TYPE (ref
);
4083 TREE_READONLY (result
) = TREE_READONLY (ref
);
4084 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (ref
);
4085 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (ref
);
4090 /* Low-level constructors for expressions. */
4092 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
4093 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
4096 recompute_tree_invariant_for_addr_expr (tree t
)
4099 bool tc
= true, se
= false;
4101 /* We started out assuming this address is both invariant and constant, but
4102 does not have side effects. Now go down any handled components and see if
4103 any of them involve offsets that are either non-constant or non-invariant.
4104 Also check for side-effects.
4106 ??? Note that this code makes no attempt to deal with the case where
4107 taking the address of something causes a copy due to misalignment. */
4109 #define UPDATE_FLAGS(NODE) \
4110 do { tree _node = (NODE); \
4111 if (_node && !TREE_CONSTANT (_node)) tc = false; \
4112 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
4114 for (node
= TREE_OPERAND (t
, 0); handled_component_p (node
);
4115 node
= TREE_OPERAND (node
, 0))
4117 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
4118 array reference (probably made temporarily by the G++ front end),
4119 so ignore all the operands. */
4120 if ((TREE_CODE (node
) == ARRAY_REF
4121 || TREE_CODE (node
) == ARRAY_RANGE_REF
)
4122 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node
, 0))) == ARRAY_TYPE
)
4124 UPDATE_FLAGS (TREE_OPERAND (node
, 1));
4125 if (TREE_OPERAND (node
, 2))
4126 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
4127 if (TREE_OPERAND (node
, 3))
4128 UPDATE_FLAGS (TREE_OPERAND (node
, 3));
4130 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
4131 FIELD_DECL, apparently. The G++ front end can put something else
4132 there, at least temporarily. */
4133 else if (TREE_CODE (node
) == COMPONENT_REF
4134 && TREE_CODE (TREE_OPERAND (node
, 1)) == FIELD_DECL
)
4136 if (TREE_OPERAND (node
, 2))
4137 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
4141 node
= lang_hooks
.expr_to_decl (node
, &tc
, &se
);
4143 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
4144 the address, since &(*a)->b is a form of addition. If it's a constant, the
4145 address is constant too. If it's a decl, its address is constant if the
4146 decl is static. Everything else is not constant and, furthermore,
4147 taking the address of a volatile variable is not volatile. */
4148 if (TREE_CODE (node
) == INDIRECT_REF
4149 || TREE_CODE (node
) == MEM_REF
)
4150 UPDATE_FLAGS (TREE_OPERAND (node
, 0));
4151 else if (CONSTANT_CLASS_P (node
))
4153 else if (DECL_P (node
))
4154 tc
&= (staticp (node
) != NULL_TREE
);
4158 se
|= TREE_SIDE_EFFECTS (node
);
4162 TREE_CONSTANT (t
) = tc
;
4163 TREE_SIDE_EFFECTS (t
) = se
;
4167 /* Build an expression of code CODE, data type TYPE, and operands as
4168 specified. Expressions and reference nodes can be created this way.
4169 Constants, decls, types and misc nodes cannot be.
4171 We define 5 non-variadic functions, from 0 to 4 arguments. This is
4172 enough for all extant tree codes. */
4175 build0_stat (enum tree_code code
, tree tt MEM_STAT_DECL
)
4179 gcc_assert (TREE_CODE_LENGTH (code
) == 0);
4181 t
= make_node_stat (code PASS_MEM_STAT
);
4188 build1_stat (enum tree_code code
, tree type
, tree node MEM_STAT_DECL
)
4190 int length
= sizeof (struct tree_exp
);
4193 record_node_allocation_statistics (code
, length
);
4195 gcc_assert (TREE_CODE_LENGTH (code
) == 1);
4197 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
4199 memset (t
, 0, sizeof (struct tree_common
));
4201 TREE_SET_CODE (t
, code
);
4203 TREE_TYPE (t
) = type
;
4204 SET_EXPR_LOCATION (t
, UNKNOWN_LOCATION
);
4205 TREE_OPERAND (t
, 0) = node
;
4206 if (node
&& !TYPE_P (node
))
4208 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (node
);
4209 TREE_READONLY (t
) = TREE_READONLY (node
);
4212 if (TREE_CODE_CLASS (code
) == tcc_statement
)
4213 TREE_SIDE_EFFECTS (t
) = 1;
4217 /* All of these have side-effects, no matter what their
4219 TREE_SIDE_EFFECTS (t
) = 1;
4220 TREE_READONLY (t
) = 0;
4224 /* Whether a dereference is readonly has nothing to do with whether
4225 its operand is readonly. */
4226 TREE_READONLY (t
) = 0;
4231 recompute_tree_invariant_for_addr_expr (t
);
4235 if ((TREE_CODE_CLASS (code
) == tcc_unary
|| code
== VIEW_CONVERT_EXPR
)
4236 && node
&& !TYPE_P (node
)
4237 && TREE_CONSTANT (node
))
4238 TREE_CONSTANT (t
) = 1;
4239 if (TREE_CODE_CLASS (code
) == tcc_reference
4240 && node
&& TREE_THIS_VOLATILE (node
))
4241 TREE_THIS_VOLATILE (t
) = 1;
4248 #define PROCESS_ARG(N) \
4250 TREE_OPERAND (t, N) = arg##N; \
4251 if (arg##N &&!TYPE_P (arg##N)) \
4253 if (TREE_SIDE_EFFECTS (arg##N)) \
4255 if (!TREE_READONLY (arg##N) \
4256 && !CONSTANT_CLASS_P (arg##N)) \
4257 (void) (read_only = 0); \
4258 if (!TREE_CONSTANT (arg##N)) \
4259 (void) (constant = 0); \
4264 build2_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1 MEM_STAT_DECL
)
4266 bool constant
, read_only
, side_effects
;
4269 gcc_assert (TREE_CODE_LENGTH (code
) == 2);
4271 if ((code
== MINUS_EXPR
|| code
== PLUS_EXPR
|| code
== MULT_EXPR
)
4272 && arg0
&& arg1
&& tt
&& POINTER_TYPE_P (tt
)
4273 /* When sizetype precision doesn't match that of pointers
4274 we need to be able to build explicit extensions or truncations
4275 of the offset argument. */
4276 && TYPE_PRECISION (sizetype
) == TYPE_PRECISION (tt
))
4277 gcc_assert (TREE_CODE (arg0
) == INTEGER_CST
4278 && TREE_CODE (arg1
) == INTEGER_CST
);
4280 if (code
== POINTER_PLUS_EXPR
&& arg0
&& arg1
&& tt
)
4281 gcc_assert (POINTER_TYPE_P (tt
) && POINTER_TYPE_P (TREE_TYPE (arg0
))
4282 && ptrofftype_p (TREE_TYPE (arg1
)));
4284 t
= make_node_stat (code PASS_MEM_STAT
);
4287 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
4288 result based on those same flags for the arguments. But if the
4289 arguments aren't really even `tree' expressions, we shouldn't be trying
4292 /* Expressions without side effects may be constant if their
4293 arguments are as well. */
4294 constant
= (TREE_CODE_CLASS (code
) == tcc_comparison
4295 || TREE_CODE_CLASS (code
) == tcc_binary
);
4297 side_effects
= TREE_SIDE_EFFECTS (t
);
4302 TREE_READONLY (t
) = read_only
;
4303 TREE_CONSTANT (t
) = constant
;
4304 TREE_SIDE_EFFECTS (t
) = side_effects
;
4305 TREE_THIS_VOLATILE (t
)
4306 = (TREE_CODE_CLASS (code
) == tcc_reference
4307 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4314 build3_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4315 tree arg2 MEM_STAT_DECL
)
4317 bool constant
, read_only
, side_effects
;
4320 gcc_assert (TREE_CODE_LENGTH (code
) == 3);
4321 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
4323 t
= make_node_stat (code PASS_MEM_STAT
);
4328 /* As a special exception, if COND_EXPR has NULL branches, we
4329 assume that it is a gimple statement and always consider
4330 it to have side effects. */
4331 if (code
== COND_EXPR
4332 && tt
== void_type_node
4333 && arg1
== NULL_TREE
4334 && arg2
== NULL_TREE
)
4335 side_effects
= true;
4337 side_effects
= TREE_SIDE_EFFECTS (t
);
4343 if (code
== COND_EXPR
)
4344 TREE_READONLY (t
) = read_only
;
4346 TREE_SIDE_EFFECTS (t
) = side_effects
;
4347 TREE_THIS_VOLATILE (t
)
4348 = (TREE_CODE_CLASS (code
) == tcc_reference
4349 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4355 build4_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4356 tree arg2
, tree arg3 MEM_STAT_DECL
)
4358 bool constant
, read_only
, side_effects
;
4361 gcc_assert (TREE_CODE_LENGTH (code
) == 4);
4363 t
= make_node_stat (code PASS_MEM_STAT
);
4366 side_effects
= TREE_SIDE_EFFECTS (t
);
4373 TREE_SIDE_EFFECTS (t
) = side_effects
;
4374 TREE_THIS_VOLATILE (t
)
4375 = (TREE_CODE_CLASS (code
) == tcc_reference
4376 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4382 build5_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4383 tree arg2
, tree arg3
, tree arg4 MEM_STAT_DECL
)
4385 bool constant
, read_only
, side_effects
;
4388 gcc_assert (TREE_CODE_LENGTH (code
) == 5);
4390 t
= make_node_stat (code PASS_MEM_STAT
);
4393 side_effects
= TREE_SIDE_EFFECTS (t
);
4401 TREE_SIDE_EFFECTS (t
) = side_effects
;
4402 TREE_THIS_VOLATILE (t
)
4403 = (TREE_CODE_CLASS (code
) == tcc_reference
4404 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4409 /* Build a simple MEM_REF tree with the sematics of a plain INDIRECT_REF
4410 on the pointer PTR. */
4413 build_simple_mem_ref_loc (location_t loc
, tree ptr
)
4415 HOST_WIDE_INT offset
= 0;
4416 tree ptype
= TREE_TYPE (ptr
);
4418 /* For convenience allow addresses that collapse to a simple base
4420 if (TREE_CODE (ptr
) == ADDR_EXPR
4421 && (handled_component_p (TREE_OPERAND (ptr
, 0))
4422 || TREE_CODE (TREE_OPERAND (ptr
, 0)) == MEM_REF
))
4424 ptr
= get_addr_base_and_unit_offset (TREE_OPERAND (ptr
, 0), &offset
);
4426 ptr
= build_fold_addr_expr (ptr
);
4427 gcc_assert (is_gimple_reg (ptr
) || is_gimple_min_invariant (ptr
));
4429 tem
= build2 (MEM_REF
, TREE_TYPE (ptype
),
4430 ptr
, build_int_cst (ptype
, offset
));
4431 SET_EXPR_LOCATION (tem
, loc
);
4435 /* Return the constant offset of a MEM_REF or TARGET_MEM_REF tree T. */
4438 mem_ref_offset (const_tree t
)
4440 return offset_int::from (TREE_OPERAND (t
, 1), SIGNED
);
4443 /* Return an invariant ADDR_EXPR of type TYPE taking the address of BASE
4444 offsetted by OFFSET units. */
4447 build_invariant_address (tree type
, tree base
, HOST_WIDE_INT offset
)
4449 tree ref
= fold_build2 (MEM_REF
, TREE_TYPE (type
),
4450 build_fold_addr_expr (base
),
4451 build_int_cst (ptr_type_node
, offset
));
4452 tree addr
= build1 (ADDR_EXPR
, type
, ref
);
4453 recompute_tree_invariant_for_addr_expr (addr
);
4457 /* Similar except don't specify the TREE_TYPE
4458 and leave the TREE_SIDE_EFFECTS as 0.
4459 It is permissible for arguments to be null,
4460 or even garbage if their values do not matter. */
4463 build_nt (enum tree_code code
, ...)
4470 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
4474 t
= make_node (code
);
4475 length
= TREE_CODE_LENGTH (code
);
4477 for (i
= 0; i
< length
; i
++)
4478 TREE_OPERAND (t
, i
) = va_arg (p
, tree
);
4484 /* Similar to build_nt, but for creating a CALL_EXPR object with a
4488 build_nt_call_vec (tree fn
, vec
<tree
, va_gc
> *args
)
4493 ret
= build_vl_exp (CALL_EXPR
, vec_safe_length (args
) + 3);
4494 CALL_EXPR_FN (ret
) = fn
;
4495 CALL_EXPR_STATIC_CHAIN (ret
) = NULL_TREE
;
4496 FOR_EACH_VEC_SAFE_ELT (args
, ix
, t
)
4497 CALL_EXPR_ARG (ret
, ix
) = t
;
4501 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
4502 We do NOT enter this node in any sort of symbol table.
4504 LOC is the location of the decl.
4506 layout_decl is used to set up the decl's storage layout.
4507 Other slots are initialized to 0 or null pointers. */
4510 build_decl_stat (location_t loc
, enum tree_code code
, tree name
,
4511 tree type MEM_STAT_DECL
)
4515 t
= make_node_stat (code PASS_MEM_STAT
);
4516 DECL_SOURCE_LOCATION (t
) = loc
;
4518 /* if (type == error_mark_node)
4519 type = integer_type_node; */
4520 /* That is not done, deliberately, so that having error_mark_node
4521 as the type can suppress useless errors in the use of this variable. */
4523 DECL_NAME (t
) = name
;
4524 TREE_TYPE (t
) = type
;
4526 if (code
== VAR_DECL
|| code
== PARM_DECL
|| code
== RESULT_DECL
)
4532 /* Builds and returns function declaration with NAME and TYPE. */
4535 build_fn_decl (const char *name
, tree type
)
4537 tree id
= get_identifier (name
);
4538 tree decl
= build_decl (input_location
, FUNCTION_DECL
, id
, type
);
4540 DECL_EXTERNAL (decl
) = 1;
4541 TREE_PUBLIC (decl
) = 1;
4542 DECL_ARTIFICIAL (decl
) = 1;
4543 TREE_NOTHROW (decl
) = 1;
4548 vec
<tree
, va_gc
> *all_translation_units
;
4550 /* Builds a new translation-unit decl with name NAME, queues it in the
4551 global list of translation-unit decls and returns it. */
4554 build_translation_unit_decl (tree name
)
4556 tree tu
= build_decl (UNKNOWN_LOCATION
, TRANSLATION_UNIT_DECL
,
4558 TRANSLATION_UNIT_LANGUAGE (tu
) = lang_hooks
.name
;
4559 vec_safe_push (all_translation_units
, tu
);
4564 /* BLOCK nodes are used to represent the structure of binding contours
4565 and declarations, once those contours have been exited and their contents
4566 compiled. This information is used for outputting debugging info. */
4569 build_block (tree vars
, tree subblocks
, tree supercontext
, tree chain
)
4571 tree block
= make_node (BLOCK
);
4573 BLOCK_VARS (block
) = vars
;
4574 BLOCK_SUBBLOCKS (block
) = subblocks
;
4575 BLOCK_SUPERCONTEXT (block
) = supercontext
;
4576 BLOCK_CHAIN (block
) = chain
;
4581 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
4583 LOC is the location to use in tree T. */
4586 protected_set_expr_location (tree t
, location_t loc
)
4588 if (CAN_HAVE_LOCATION_P (t
))
4589 SET_EXPR_LOCATION (t
, loc
);
4592 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
4596 build_decl_attribute_variant (tree ddecl
, tree attribute
)
4598 DECL_ATTRIBUTES (ddecl
) = attribute
;
4602 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4603 is ATTRIBUTE and its qualifiers are QUALS.
4605 Record such modified types already made so we don't make duplicates. */
4608 build_type_attribute_qual_variant (tree ttype
, tree attribute
, int quals
)
4610 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype
), attribute
))
4612 inchash::hash hstate
;
4616 enum tree_code code
= TREE_CODE (ttype
);
4618 /* Building a distinct copy of a tagged type is inappropriate; it
4619 causes breakage in code that expects there to be a one-to-one
4620 relationship between a struct and its fields.
4621 build_duplicate_type is another solution (as used in
4622 handle_transparent_union_attribute), but that doesn't play well
4623 with the stronger C++ type identity model. */
4624 if (TREE_CODE (ttype
) == RECORD_TYPE
4625 || TREE_CODE (ttype
) == UNION_TYPE
4626 || TREE_CODE (ttype
) == QUAL_UNION_TYPE
4627 || TREE_CODE (ttype
) == ENUMERAL_TYPE
)
4629 warning (OPT_Wattributes
,
4630 "ignoring attributes applied to %qT after definition",
4631 TYPE_MAIN_VARIANT (ttype
));
4632 return build_qualified_type (ttype
, quals
);
4635 ttype
= build_qualified_type (ttype
, TYPE_UNQUALIFIED
);
4636 ntype
= build_distinct_type_copy (ttype
);
4638 TYPE_ATTRIBUTES (ntype
) = attribute
;
4640 hstate
.add_int (code
);
4641 if (TREE_TYPE (ntype
))
4642 hstate
.add_object (TYPE_HASH (TREE_TYPE (ntype
)));
4643 attribute_hash_list (attribute
, hstate
);
4645 switch (TREE_CODE (ntype
))
4648 type_hash_list (TYPE_ARG_TYPES (ntype
), hstate
);
4651 if (TYPE_DOMAIN (ntype
))
4652 hstate
.add_object (TYPE_HASH (TYPE_DOMAIN (ntype
)));
4655 t
= TYPE_MAX_VALUE (ntype
);
4656 for (i
= 0; i
< TREE_INT_CST_NUNITS (t
); i
++)
4657 hstate
.add_object (TREE_INT_CST_ELT (t
, i
));
4660 case FIXED_POINT_TYPE
:
4662 unsigned int precision
= TYPE_PRECISION (ntype
);
4663 hstate
.add_object (precision
);
4670 ntype
= type_hash_canon (hstate
.end(), ntype
);
4672 /* If the target-dependent attributes make NTYPE different from
4673 its canonical type, we will need to use structural equality
4674 checks for this type. */
4675 if (TYPE_STRUCTURAL_EQUALITY_P (ttype
)
4676 || !comp_type_attributes (ntype
, ttype
))
4677 SET_TYPE_STRUCTURAL_EQUALITY (ntype
);
4678 else if (TYPE_CANONICAL (ntype
) == ntype
)
4679 TYPE_CANONICAL (ntype
) = TYPE_CANONICAL (ttype
);
4681 ttype
= build_qualified_type (ntype
, quals
);
4683 else if (TYPE_QUALS (ttype
) != quals
)
4684 ttype
= build_qualified_type (ttype
, quals
);
4689 /* Check if "omp declare simd" attribute arguments, CLAUSES1 and CLAUSES2, are
4693 omp_declare_simd_clauses_equal (tree clauses1
, tree clauses2
)
4696 for (cl1
= clauses1
, cl2
= clauses2
;
4698 cl1
= OMP_CLAUSE_CHAIN (cl1
), cl2
= OMP_CLAUSE_CHAIN (cl2
))
4700 if (OMP_CLAUSE_CODE (cl1
) != OMP_CLAUSE_CODE (cl2
))
4702 if (OMP_CLAUSE_CODE (cl1
) != OMP_CLAUSE_SIMDLEN
)
4704 if (simple_cst_equal (OMP_CLAUSE_DECL (cl1
),
4705 OMP_CLAUSE_DECL (cl2
)) != 1)
4708 switch (OMP_CLAUSE_CODE (cl1
))
4710 case OMP_CLAUSE_ALIGNED
:
4711 if (simple_cst_equal (OMP_CLAUSE_ALIGNED_ALIGNMENT (cl1
),
4712 OMP_CLAUSE_ALIGNED_ALIGNMENT (cl2
)) != 1)
4715 case OMP_CLAUSE_LINEAR
:
4716 if (simple_cst_equal (OMP_CLAUSE_LINEAR_STEP (cl1
),
4717 OMP_CLAUSE_LINEAR_STEP (cl2
)) != 1)
4720 case OMP_CLAUSE_SIMDLEN
:
4721 if (simple_cst_equal (OMP_CLAUSE_SIMDLEN_EXPR (cl1
),
4722 OMP_CLAUSE_SIMDLEN_EXPR (cl2
)) != 1)
4731 /* Compare two constructor-element-type constants. Return 1 if the lists
4732 are known to be equal; otherwise return 0. */
4735 simple_cst_list_equal (const_tree l1
, const_tree l2
)
4737 while (l1
!= NULL_TREE
&& l2
!= NULL_TREE
)
4739 if (simple_cst_equal (TREE_VALUE (l1
), TREE_VALUE (l2
)) != 1)
4742 l1
= TREE_CHAIN (l1
);
4743 l2
= TREE_CHAIN (l2
);
4749 /* Compare two attributes for their value identity. Return true if the
4750 attribute values are known to be equal; otherwise return false.
4754 attribute_value_equal (const_tree attr1
, const_tree attr2
)
4756 if (TREE_VALUE (attr1
) == TREE_VALUE (attr2
))
4759 if (TREE_VALUE (attr1
) != NULL_TREE
4760 && TREE_CODE (TREE_VALUE (attr1
)) == TREE_LIST
4761 && TREE_VALUE (attr2
) != NULL
4762 && TREE_CODE (TREE_VALUE (attr2
)) == TREE_LIST
)
4763 return (simple_cst_list_equal (TREE_VALUE (attr1
),
4764 TREE_VALUE (attr2
)) == 1);
4766 if ((flag_openmp
|| flag_openmp_simd
)
4767 && TREE_VALUE (attr1
) && TREE_VALUE (attr2
)
4768 && TREE_CODE (TREE_VALUE (attr1
)) == OMP_CLAUSE
4769 && TREE_CODE (TREE_VALUE (attr2
)) == OMP_CLAUSE
)
4770 return omp_declare_simd_clauses_equal (TREE_VALUE (attr1
),
4771 TREE_VALUE (attr2
));
4773 return (simple_cst_equal (TREE_VALUE (attr1
), TREE_VALUE (attr2
)) == 1);
4776 /* Return 0 if the attributes for two types are incompatible, 1 if they
4777 are compatible, and 2 if they are nearly compatible (which causes a
4778 warning to be generated). */
4780 comp_type_attributes (const_tree type1
, const_tree type2
)
4782 const_tree a1
= TYPE_ATTRIBUTES (type1
);
4783 const_tree a2
= TYPE_ATTRIBUTES (type2
);
4788 for (a
= a1
; a
!= NULL_TREE
; a
= TREE_CHAIN (a
))
4790 const struct attribute_spec
*as
;
4793 as
= lookup_attribute_spec (get_attribute_name (a
));
4794 if (!as
|| as
->affects_type_identity
== false)
4797 attr
= lookup_attribute (as
->name
, CONST_CAST_TREE (a2
));
4798 if (!attr
|| !attribute_value_equal (a
, attr
))
4803 for (a
= a2
; a
!= NULL_TREE
; a
= TREE_CHAIN (a
))
4805 const struct attribute_spec
*as
;
4807 as
= lookup_attribute_spec (get_attribute_name (a
));
4808 if (!as
|| as
->affects_type_identity
== false)
4811 if (!lookup_attribute (as
->name
, CONST_CAST_TREE (a1
)))
4813 /* We don't need to compare trees again, as we did this
4814 already in first loop. */
4816 /* All types - affecting identity - are equal, so
4817 there is no need to call target hook for comparison. */
4821 /* As some type combinations - like default calling-convention - might
4822 be compatible, we have to call the target hook to get the final result. */
4823 return targetm
.comp_type_attributes (type1
, type2
);
4826 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4829 Record such modified types already made so we don't make duplicates. */
4832 build_type_attribute_variant (tree ttype
, tree attribute
)
4834 return build_type_attribute_qual_variant (ttype
, attribute
,
4835 TYPE_QUALS (ttype
));
4839 /* Reset the expression *EXPR_P, a size or position.
4841 ??? We could reset all non-constant sizes or positions. But it's cheap
4842 enough to not do so and refrain from adding workarounds to dwarf2out.c.
4844 We need to reset self-referential sizes or positions because they cannot
4845 be gimplified and thus can contain a CALL_EXPR after the gimplification
4846 is finished, which will run afoul of LTO streaming. And they need to be
4847 reset to something essentially dummy but not constant, so as to preserve
4848 the properties of the object they are attached to. */
4851 free_lang_data_in_one_sizepos (tree
*expr_p
)
4853 tree expr
= *expr_p
;
4854 if (CONTAINS_PLACEHOLDER_P (expr
))
4855 *expr_p
= build0 (PLACEHOLDER_EXPR
, TREE_TYPE (expr
));
4859 /* Reset all the fields in a binfo node BINFO. We only keep
4860 BINFO_VTABLE, which is used by gimple_fold_obj_type_ref. */
4863 free_lang_data_in_binfo (tree binfo
)
4868 gcc_assert (TREE_CODE (binfo
) == TREE_BINFO
);
4870 BINFO_VIRTUALS (binfo
) = NULL_TREE
;
4871 BINFO_BASE_ACCESSES (binfo
) = NULL
;
4872 BINFO_INHERITANCE_CHAIN (binfo
) = NULL_TREE
;
4873 BINFO_SUBVTT_INDEX (binfo
) = NULL_TREE
;
4875 FOR_EACH_VEC_ELT (*BINFO_BASE_BINFOS (binfo
), i
, t
)
4876 free_lang_data_in_binfo (t
);
4880 /* Reset all language specific information still present in TYPE. */
4883 free_lang_data_in_type (tree type
)
4885 gcc_assert (TYPE_P (type
));
4887 /* Give the FE a chance to remove its own data first. */
4888 lang_hooks
.free_lang_data (type
);
4890 TREE_LANG_FLAG_0 (type
) = 0;
4891 TREE_LANG_FLAG_1 (type
) = 0;
4892 TREE_LANG_FLAG_2 (type
) = 0;
4893 TREE_LANG_FLAG_3 (type
) = 0;
4894 TREE_LANG_FLAG_4 (type
) = 0;
4895 TREE_LANG_FLAG_5 (type
) = 0;
4896 TREE_LANG_FLAG_6 (type
) = 0;
4898 if (TREE_CODE (type
) == FUNCTION_TYPE
)
4900 /* Remove the const and volatile qualifiers from arguments. The
4901 C++ front end removes them, but the C front end does not,
4902 leading to false ODR violation errors when merging two
4903 instances of the same function signature compiled by
4904 different front ends. */
4907 for (p
= TYPE_ARG_TYPES (type
); p
; p
= TREE_CHAIN (p
))
4909 tree arg_type
= TREE_VALUE (p
);
4911 if (TYPE_READONLY (arg_type
) || TYPE_VOLATILE (arg_type
))
4913 int quals
= TYPE_QUALS (arg_type
)
4915 & ~TYPE_QUAL_VOLATILE
;
4916 TREE_VALUE (p
) = build_qualified_type (arg_type
, quals
);
4917 free_lang_data_in_type (TREE_VALUE (p
));
4922 /* Remove members that are not actually FIELD_DECLs from the field
4923 list of an aggregate. These occur in C++. */
4924 if (RECORD_OR_UNION_TYPE_P (type
))
4928 /* Note that TYPE_FIELDS can be shared across distinct
4929 TREE_TYPEs. Therefore, if the first field of TYPE_FIELDS is
4930 to be removed, we cannot set its TREE_CHAIN to NULL.
4931 Otherwise, we would not be able to find all the other fields
4932 in the other instances of this TREE_TYPE.
4934 This was causing an ICE in testsuite/g++.dg/lto/20080915.C. */
4936 member
= TYPE_FIELDS (type
);
4939 if (TREE_CODE (member
) == FIELD_DECL
4940 || TREE_CODE (member
) == TYPE_DECL
)
4943 TREE_CHAIN (prev
) = member
;
4945 TYPE_FIELDS (type
) = member
;
4949 member
= TREE_CHAIN (member
);
4953 TREE_CHAIN (prev
) = NULL_TREE
;
4955 TYPE_FIELDS (type
) = NULL_TREE
;
4957 TYPE_METHODS (type
) = NULL_TREE
;
4958 if (TYPE_BINFO (type
))
4959 free_lang_data_in_binfo (TYPE_BINFO (type
));
4963 /* For non-aggregate types, clear out the language slot (which
4964 overloads TYPE_BINFO). */
4965 TYPE_LANG_SLOT_1 (type
) = NULL_TREE
;
4967 if (INTEGRAL_TYPE_P (type
)
4968 || SCALAR_FLOAT_TYPE_P (type
)
4969 || FIXED_POINT_TYPE_P (type
))
4971 free_lang_data_in_one_sizepos (&TYPE_MIN_VALUE (type
));
4972 free_lang_data_in_one_sizepos (&TYPE_MAX_VALUE (type
));
4976 free_lang_data_in_one_sizepos (&TYPE_SIZE (type
));
4977 free_lang_data_in_one_sizepos (&TYPE_SIZE_UNIT (type
));
4979 if (TYPE_CONTEXT (type
)
4980 && TREE_CODE (TYPE_CONTEXT (type
)) == BLOCK
)
4982 tree ctx
= TYPE_CONTEXT (type
);
4985 ctx
= BLOCK_SUPERCONTEXT (ctx
);
4987 while (ctx
&& TREE_CODE (ctx
) == BLOCK
);
4988 TYPE_CONTEXT (type
) = ctx
;
4993 /* Return true if DECL may need an assembler name to be set. */
4996 need_assembler_name_p (tree decl
)
4998 /* We use DECL_ASSEMBLER_NAME to hold mangled type names for One Definition Rule
5000 if (flag_lto_odr_type_mering
5001 && TREE_CODE (decl
) == TYPE_DECL
5003 && decl
== TYPE_NAME (TREE_TYPE (decl
))
5004 && !is_lang_specific (TREE_TYPE (decl
))
5005 && !type_in_anonymous_namespace_p (TREE_TYPE (decl
)))
5006 return !DECL_ASSEMBLER_NAME_SET_P (decl
);
5007 /* Only FUNCTION_DECLs and VAR_DECLs are considered. */
5008 if (TREE_CODE (decl
) != FUNCTION_DECL
5009 && TREE_CODE (decl
) != VAR_DECL
)
5012 /* If DECL already has its assembler name set, it does not need a
5014 if (!HAS_DECL_ASSEMBLER_NAME_P (decl
)
5015 || DECL_ASSEMBLER_NAME_SET_P (decl
))
5018 /* Abstract decls do not need an assembler name. */
5019 if (DECL_ABSTRACT (decl
))
5022 /* For VAR_DECLs, only static, public and external symbols need an
5024 if (TREE_CODE (decl
) == VAR_DECL
5025 && !TREE_STATIC (decl
)
5026 && !TREE_PUBLIC (decl
)
5027 && !DECL_EXTERNAL (decl
))
5030 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5032 /* Do not set assembler name on builtins. Allow RTL expansion to
5033 decide whether to expand inline or via a regular call. */
5034 if (DECL_BUILT_IN (decl
)
5035 && DECL_BUILT_IN_CLASS (decl
) != BUILT_IN_FRONTEND
)
5038 /* Functions represented in the callgraph need an assembler name. */
5039 if (cgraph_node::get (decl
) != NULL
)
5042 /* Unused and not public functions don't need an assembler name. */
5043 if (!TREE_USED (decl
) && !TREE_PUBLIC (decl
))
5051 /* Reset all language specific information still present in symbol
5055 free_lang_data_in_decl (tree decl
)
5057 gcc_assert (DECL_P (decl
));
5059 /* Give the FE a chance to remove its own data first. */
5060 lang_hooks
.free_lang_data (decl
);
5062 TREE_LANG_FLAG_0 (decl
) = 0;
5063 TREE_LANG_FLAG_1 (decl
) = 0;
5064 TREE_LANG_FLAG_2 (decl
) = 0;
5065 TREE_LANG_FLAG_3 (decl
) = 0;
5066 TREE_LANG_FLAG_4 (decl
) = 0;
5067 TREE_LANG_FLAG_5 (decl
) = 0;
5068 TREE_LANG_FLAG_6 (decl
) = 0;
5070 free_lang_data_in_one_sizepos (&DECL_SIZE (decl
));
5071 free_lang_data_in_one_sizepos (&DECL_SIZE_UNIT (decl
));
5072 if (TREE_CODE (decl
) == FIELD_DECL
)
5074 free_lang_data_in_one_sizepos (&DECL_FIELD_OFFSET (decl
));
5075 if (TREE_CODE (DECL_CONTEXT (decl
)) == QUAL_UNION_TYPE
)
5076 DECL_QUALIFIER (decl
) = NULL_TREE
;
5079 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5081 struct cgraph_node
*node
;
5082 if (!(node
= cgraph_node::get (decl
))
5083 || (!node
->definition
&& !node
->clones
))
5086 node
->release_body ();
5089 release_function_body (decl
);
5090 DECL_ARGUMENTS (decl
) = NULL
;
5091 DECL_RESULT (decl
) = NULL
;
5092 DECL_INITIAL (decl
) = error_mark_node
;
5095 if (gimple_has_body_p (decl
))
5099 /* If DECL has a gimple body, then the context for its
5100 arguments must be DECL. Otherwise, it doesn't really
5101 matter, as we will not be emitting any code for DECL. In
5102 general, there may be other instances of DECL created by
5103 the front end and since PARM_DECLs are generally shared,
5104 their DECL_CONTEXT changes as the replicas of DECL are
5105 created. The only time where DECL_CONTEXT is important
5106 is for the FUNCTION_DECLs that have a gimple body (since
5107 the PARM_DECL will be used in the function's body). */
5108 for (t
= DECL_ARGUMENTS (decl
); t
; t
= TREE_CHAIN (t
))
5109 DECL_CONTEXT (t
) = decl
;
5112 /* DECL_SAVED_TREE holds the GENERIC representation for DECL.
5113 At this point, it is not needed anymore. */
5114 DECL_SAVED_TREE (decl
) = NULL_TREE
;
5116 /* Clear the abstract origin if it refers to a method. Otherwise
5117 dwarf2out.c will ICE as we clear TYPE_METHODS and thus the
5118 origin will not be output correctly. */
5119 if (DECL_ABSTRACT_ORIGIN (decl
)
5120 && DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))
5121 && RECORD_OR_UNION_TYPE_P
5122 (DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))))
5123 DECL_ABSTRACT_ORIGIN (decl
) = NULL_TREE
;
5125 /* Sometimes the C++ frontend doesn't manage to transform a temporary
5126 DECL_VINDEX referring to itself into a vtable slot number as it
5127 should. Happens with functions that are copied and then forgotten
5128 about. Just clear it, it won't matter anymore. */
5129 if (DECL_VINDEX (decl
) && !tree_fits_shwi_p (DECL_VINDEX (decl
)))
5130 DECL_VINDEX (decl
) = NULL_TREE
;
5132 else if (TREE_CODE (decl
) == VAR_DECL
)
5134 if ((DECL_EXTERNAL (decl
)
5135 && (!TREE_STATIC (decl
) || !TREE_READONLY (decl
)))
5136 || (decl_function_context (decl
) && !TREE_STATIC (decl
)))
5137 DECL_INITIAL (decl
) = NULL_TREE
;
5139 else if (TREE_CODE (decl
) == TYPE_DECL
5140 || TREE_CODE (decl
) == FIELD_DECL
)
5141 DECL_INITIAL (decl
) = NULL_TREE
;
5142 else if (TREE_CODE (decl
) == TRANSLATION_UNIT_DECL
5143 && DECL_INITIAL (decl
)
5144 && TREE_CODE (DECL_INITIAL (decl
)) == BLOCK
)
5146 /* Strip builtins from the translation-unit BLOCK. We still have targets
5147 without builtin_decl_explicit support and also builtins are shared
5148 nodes and thus we can't use TREE_CHAIN in multiple lists. */
5149 tree
*nextp
= &BLOCK_VARS (DECL_INITIAL (decl
));
5153 if (TREE_CODE (var
) == FUNCTION_DECL
5154 && DECL_BUILT_IN (var
))
5155 *nextp
= TREE_CHAIN (var
);
5157 nextp
= &TREE_CHAIN (var
);
5163 /* Data used when collecting DECLs and TYPEs for language data removal. */
5165 struct free_lang_data_d
5167 /* Worklist to avoid excessive recursion. */
5170 /* Set of traversed objects. Used to avoid duplicate visits. */
5171 hash_set
<tree
> *pset
;
5173 /* Array of symbols to process with free_lang_data_in_decl. */
5176 /* Array of types to process with free_lang_data_in_type. */
5181 /* Save all language fields needed to generate proper debug information
5182 for DECL. This saves most fields cleared out by free_lang_data_in_decl. */
5185 save_debug_info_for_decl (tree t
)
5187 /*struct saved_debug_info_d *sdi;*/
5189 gcc_assert (debug_info_level
> DINFO_LEVEL_TERSE
&& t
&& DECL_P (t
));
5191 /* FIXME. Partial implementation for saving debug info removed. */
5195 /* Save all language fields needed to generate proper debug information
5196 for TYPE. This saves most fields cleared out by free_lang_data_in_type. */
5199 save_debug_info_for_type (tree t
)
5201 /*struct saved_debug_info_d *sdi;*/
5203 gcc_assert (debug_info_level
> DINFO_LEVEL_TERSE
&& t
&& TYPE_P (t
));
5205 /* FIXME. Partial implementation for saving debug info removed. */
5209 /* Add type or decl T to one of the list of tree nodes that need their
5210 language data removed. The lists are held inside FLD. */
5213 add_tree_to_fld_list (tree t
, struct free_lang_data_d
*fld
)
5217 fld
->decls
.safe_push (t
);
5218 if (debug_info_level
> DINFO_LEVEL_TERSE
)
5219 save_debug_info_for_decl (t
);
5221 else if (TYPE_P (t
))
5223 fld
->types
.safe_push (t
);
5224 if (debug_info_level
> DINFO_LEVEL_TERSE
)
5225 save_debug_info_for_type (t
);
5231 /* Push tree node T into FLD->WORKLIST. */
5234 fld_worklist_push (tree t
, struct free_lang_data_d
*fld
)
5236 if (t
&& !is_lang_specific (t
) && !fld
->pset
->contains (t
))
5237 fld
->worklist
.safe_push ((t
));
5241 /* Operand callback helper for free_lang_data_in_node. *TP is the
5242 subtree operand being considered. */
5245 find_decls_types_r (tree
*tp
, int *ws
, void *data
)
5248 struct free_lang_data_d
*fld
= (struct free_lang_data_d
*) data
;
5250 if (TREE_CODE (t
) == TREE_LIST
)
5253 /* Language specific nodes will be removed, so there is no need
5254 to gather anything under them. */
5255 if (is_lang_specific (t
))
5263 /* Note that walk_tree does not traverse every possible field in
5264 decls, so we have to do our own traversals here. */
5265 add_tree_to_fld_list (t
, fld
);
5267 fld_worklist_push (DECL_NAME (t
), fld
);
5268 fld_worklist_push (DECL_CONTEXT (t
), fld
);
5269 fld_worklist_push (DECL_SIZE (t
), fld
);
5270 fld_worklist_push (DECL_SIZE_UNIT (t
), fld
);
5272 /* We are going to remove everything under DECL_INITIAL for
5273 TYPE_DECLs. No point walking them. */
5274 if (TREE_CODE (t
) != TYPE_DECL
)
5275 fld_worklist_push (DECL_INITIAL (t
), fld
);
5277 fld_worklist_push (DECL_ATTRIBUTES (t
), fld
);
5278 fld_worklist_push (DECL_ABSTRACT_ORIGIN (t
), fld
);
5280 if (TREE_CODE (t
) == FUNCTION_DECL
)
5282 fld_worklist_push (DECL_ARGUMENTS (t
), fld
);
5283 fld_worklist_push (DECL_RESULT (t
), fld
);
5285 else if (TREE_CODE (t
) == TYPE_DECL
)
5287 fld_worklist_push (DECL_ORIGINAL_TYPE (t
), fld
);
5289 else if (TREE_CODE (t
) == FIELD_DECL
)
5291 fld_worklist_push (DECL_FIELD_OFFSET (t
), fld
);
5292 fld_worklist_push (DECL_BIT_FIELD_TYPE (t
), fld
);
5293 fld_worklist_push (DECL_FIELD_BIT_OFFSET (t
), fld
);
5294 fld_worklist_push (DECL_FCONTEXT (t
), fld
);
5297 if ((TREE_CODE (t
) == VAR_DECL
|| TREE_CODE (t
) == PARM_DECL
)
5298 && DECL_HAS_VALUE_EXPR_P (t
))
5299 fld_worklist_push (DECL_VALUE_EXPR (t
), fld
);
5301 if (TREE_CODE (t
) != FIELD_DECL
5302 && TREE_CODE (t
) != TYPE_DECL
)
5303 fld_worklist_push (TREE_CHAIN (t
), fld
);
5306 else if (TYPE_P (t
))
5308 /* Note that walk_tree does not traverse every possible field in
5309 types, so we have to do our own traversals here. */
5310 add_tree_to_fld_list (t
, fld
);
5312 if (!RECORD_OR_UNION_TYPE_P (t
))
5313 fld_worklist_push (TYPE_CACHED_VALUES (t
), fld
);
5314 fld_worklist_push (TYPE_SIZE (t
), fld
);
5315 fld_worklist_push (TYPE_SIZE_UNIT (t
), fld
);
5316 fld_worklist_push (TYPE_ATTRIBUTES (t
), fld
);
5317 fld_worklist_push (TYPE_POINTER_TO (t
), fld
);
5318 fld_worklist_push (TYPE_REFERENCE_TO (t
), fld
);
5319 fld_worklist_push (TYPE_NAME (t
), fld
);
5320 /* Do not walk TYPE_NEXT_PTR_TO or TYPE_NEXT_REF_TO. We do not stream
5321 them and thus do not and want not to reach unused pointer types
5323 if (!POINTER_TYPE_P (t
))
5324 fld_worklist_push (TYPE_MINVAL (t
), fld
);
5325 if (!RECORD_OR_UNION_TYPE_P (t
))
5326 fld_worklist_push (TYPE_MAXVAL (t
), fld
);
5327 fld_worklist_push (TYPE_MAIN_VARIANT (t
), fld
);
5328 /* Do not walk TYPE_NEXT_VARIANT. We do not stream it and thus
5329 do not and want not to reach unused variants this way. */
5330 if (TYPE_CONTEXT (t
))
5332 tree ctx
= TYPE_CONTEXT (t
);
5333 /* We adjust BLOCK TYPE_CONTEXTs to the innermost non-BLOCK one.
5334 So push that instead. */
5335 while (ctx
&& TREE_CODE (ctx
) == BLOCK
)
5336 ctx
= BLOCK_SUPERCONTEXT (ctx
);
5337 fld_worklist_push (ctx
, fld
);
5339 /* Do not walk TYPE_CANONICAL. We do not stream it and thus do not
5340 and want not to reach unused types this way. */
5342 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_BINFO (t
))
5346 FOR_EACH_VEC_ELT (*BINFO_BASE_BINFOS (TYPE_BINFO (t
)), i
, tem
)
5347 fld_worklist_push (TREE_TYPE (tem
), fld
);
5348 tem
= BINFO_VIRTUALS (TYPE_BINFO (t
));
5350 /* The Java FE overloads BINFO_VIRTUALS for its own purpose. */
5351 && TREE_CODE (tem
) == TREE_LIST
)
5354 fld_worklist_push (TREE_VALUE (tem
), fld
);
5355 tem
= TREE_CHAIN (tem
);
5359 if (RECORD_OR_UNION_TYPE_P (t
))
5362 /* Push all TYPE_FIELDS - there can be interleaving interesting
5363 and non-interesting things. */
5364 tem
= TYPE_FIELDS (t
);
5367 if (TREE_CODE (tem
) == FIELD_DECL
5368 || TREE_CODE (tem
) == TYPE_DECL
)
5369 fld_worklist_push (tem
, fld
);
5370 tem
= TREE_CHAIN (tem
);
5374 fld_worklist_push (TYPE_STUB_DECL (t
), fld
);
5377 else if (TREE_CODE (t
) == BLOCK
)
5380 for (tem
= BLOCK_VARS (t
); tem
; tem
= TREE_CHAIN (tem
))
5381 fld_worklist_push (tem
, fld
);
5382 for (tem
= BLOCK_SUBBLOCKS (t
); tem
; tem
= BLOCK_CHAIN (tem
))
5383 fld_worklist_push (tem
, fld
);
5384 fld_worklist_push (BLOCK_ABSTRACT_ORIGIN (t
), fld
);
5387 if (TREE_CODE (t
) != IDENTIFIER_NODE
5388 && CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_TYPED
))
5389 fld_worklist_push (TREE_TYPE (t
), fld
);
5395 /* Find decls and types in T. */
5398 find_decls_types (tree t
, struct free_lang_data_d
*fld
)
5402 if (!fld
->pset
->contains (t
))
5403 walk_tree (&t
, find_decls_types_r
, fld
, fld
->pset
);
5404 if (fld
->worklist
.is_empty ())
5406 t
= fld
->worklist
.pop ();
5410 /* Translate all the types in LIST with the corresponding runtime
5414 get_eh_types_for_runtime (tree list
)
5418 if (list
== NULL_TREE
)
5421 head
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
5423 list
= TREE_CHAIN (list
);
5426 tree n
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
5427 TREE_CHAIN (prev
) = n
;
5428 prev
= TREE_CHAIN (prev
);
5429 list
= TREE_CHAIN (list
);
5436 /* Find decls and types referenced in EH region R and store them in
5437 FLD->DECLS and FLD->TYPES. */
5440 find_decls_types_in_eh_region (eh_region r
, struct free_lang_data_d
*fld
)
5451 /* The types referenced in each catch must first be changed to the
5452 EH types used at runtime. This removes references to FE types
5454 for (c
= r
->u
.eh_try
.first_catch
; c
; c
= c
->next_catch
)
5456 c
->type_list
= get_eh_types_for_runtime (c
->type_list
);
5457 walk_tree (&c
->type_list
, find_decls_types_r
, fld
, fld
->pset
);
5462 case ERT_ALLOWED_EXCEPTIONS
:
5463 r
->u
.allowed
.type_list
5464 = get_eh_types_for_runtime (r
->u
.allowed
.type_list
);
5465 walk_tree (&r
->u
.allowed
.type_list
, find_decls_types_r
, fld
, fld
->pset
);
5468 case ERT_MUST_NOT_THROW
:
5469 walk_tree (&r
->u
.must_not_throw
.failure_decl
,
5470 find_decls_types_r
, fld
, fld
->pset
);
5476 /* Find decls and types referenced in cgraph node N and store them in
5477 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
5478 look for *every* kind of DECL and TYPE node reachable from N,
5479 including those embedded inside types and decls (i.e,, TYPE_DECLs,
5480 NAMESPACE_DECLs, etc). */
5483 find_decls_types_in_node (struct cgraph_node
*n
, struct free_lang_data_d
*fld
)
5486 struct function
*fn
;
5490 find_decls_types (n
->decl
, fld
);
5492 if (!gimple_has_body_p (n
->decl
))
5495 gcc_assert (current_function_decl
== NULL_TREE
&& cfun
== NULL
);
5497 fn
= DECL_STRUCT_FUNCTION (n
->decl
);
5499 /* Traverse locals. */
5500 FOR_EACH_LOCAL_DECL (fn
, ix
, t
)
5501 find_decls_types (t
, fld
);
5503 /* Traverse EH regions in FN. */
5506 FOR_ALL_EH_REGION_FN (r
, fn
)
5507 find_decls_types_in_eh_region (r
, fld
);
5510 /* Traverse every statement in FN. */
5511 FOR_EACH_BB_FN (bb
, fn
)
5513 gimple_stmt_iterator si
;
5516 for (si
= gsi_start_phis (bb
); !gsi_end_p (si
); gsi_next (&si
))
5518 gimple phi
= gsi_stmt (si
);
5520 for (i
= 0; i
< gimple_phi_num_args (phi
); i
++)
5522 tree
*arg_p
= gimple_phi_arg_def_ptr (phi
, i
);
5523 find_decls_types (*arg_p
, fld
);
5527 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
5529 gimple stmt
= gsi_stmt (si
);
5531 if (is_gimple_call (stmt
))
5532 find_decls_types (gimple_call_fntype (stmt
), fld
);
5534 for (i
= 0; i
< gimple_num_ops (stmt
); i
++)
5536 tree arg
= gimple_op (stmt
, i
);
5537 find_decls_types (arg
, fld
);
5544 /* Find decls and types referenced in varpool node N and store them in
5545 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
5546 look for *every* kind of DECL and TYPE node reachable from N,
5547 including those embedded inside types and decls (i.e,, TYPE_DECLs,
5548 NAMESPACE_DECLs, etc). */
5551 find_decls_types_in_var (varpool_node
*v
, struct free_lang_data_d
*fld
)
5553 find_decls_types (v
->decl
, fld
);
5556 /* If T needs an assembler name, have one created for it. */
5559 assign_assembler_name_if_neeeded (tree t
)
5561 if (need_assembler_name_p (t
))
5563 /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit
5564 diagnostics that use input_location to show locus
5565 information. The problem here is that, at this point,
5566 input_location is generally anchored to the end of the file
5567 (since the parser is long gone), so we don't have a good
5568 position to pin it to.
5570 To alleviate this problem, this uses the location of T's
5571 declaration. Examples of this are
5572 testsuite/g++.dg/template/cond2.C and
5573 testsuite/g++.dg/template/pr35240.C. */
5574 location_t saved_location
= input_location
;
5575 input_location
= DECL_SOURCE_LOCATION (t
);
5577 decl_assembler_name (t
);
5579 input_location
= saved_location
;
5584 /* Free language specific information for every operand and expression
5585 in every node of the call graph. This process operates in three stages:
5587 1- Every callgraph node and varpool node is traversed looking for
5588 decls and types embedded in them. This is a more exhaustive
5589 search than that done by find_referenced_vars, because it will
5590 also collect individual fields, decls embedded in types, etc.
5592 2- All the decls found are sent to free_lang_data_in_decl.
5594 3- All the types found are sent to free_lang_data_in_type.
5596 The ordering between decls and types is important because
5597 free_lang_data_in_decl sets assembler names, which includes
5598 mangling. So types cannot be freed up until assembler names have
5602 free_lang_data_in_cgraph (void)
5604 struct cgraph_node
*n
;
5606 struct free_lang_data_d fld
;
5611 /* Initialize sets and arrays to store referenced decls and types. */
5612 fld
.pset
= new hash_set
<tree
>;
5613 fld
.worklist
.create (0);
5614 fld
.decls
.create (100);
5615 fld
.types
.create (100);
5617 /* Find decls and types in the body of every function in the callgraph. */
5618 FOR_EACH_FUNCTION (n
)
5619 find_decls_types_in_node (n
, &fld
);
5621 FOR_EACH_VEC_SAFE_ELT (alias_pairs
, i
, p
)
5622 find_decls_types (p
->decl
, &fld
);
5624 /* Find decls and types in every varpool symbol. */
5625 FOR_EACH_VARIABLE (v
)
5626 find_decls_types_in_var (v
, &fld
);
5628 /* Set the assembler name on every decl found. We need to do this
5629 now because free_lang_data_in_decl will invalidate data needed
5630 for mangling. This breaks mangling on interdependent decls. */
5631 FOR_EACH_VEC_ELT (fld
.decls
, i
, t
)
5632 assign_assembler_name_if_neeeded (t
);
5634 /* Traverse every decl found freeing its language data. */
5635 FOR_EACH_VEC_ELT (fld
.decls
, i
, t
)
5636 free_lang_data_in_decl (t
);
5638 /* Traverse every type found freeing its language data. */
5639 FOR_EACH_VEC_ELT (fld
.types
, i
, t
)
5640 free_lang_data_in_type (t
);
5643 fld
.worklist
.release ();
5644 fld
.decls
.release ();
5645 fld
.types
.release ();
5649 /* Free resources that are used by FE but are not needed once they are done. */
5652 free_lang_data (void)
5656 /* If we are the LTO frontend we have freed lang-specific data already. */
5658 || !flag_generate_lto
)
5661 /* Allocate and assign alias sets to the standard integer types
5662 while the slots are still in the way the frontends generated them. */
5663 for (i
= 0; i
< itk_none
; ++i
)
5664 if (integer_types
[i
])
5665 TYPE_ALIAS_SET (integer_types
[i
]) = get_alias_set (integer_types
[i
]);
5667 /* Traverse the IL resetting language specific information for
5668 operands, expressions, etc. */
5669 free_lang_data_in_cgraph ();
5671 /* Create gimple variants for common types. */
5672 ptrdiff_type_node
= integer_type_node
;
5673 fileptr_type_node
= ptr_type_node
;
5675 /* Reset some langhooks. Do not reset types_compatible_p, it may
5676 still be used indirectly via the get_alias_set langhook. */
5677 lang_hooks
.dwarf_name
= lhd_dwarf_name
;
5678 lang_hooks
.decl_printable_name
= gimple_decl_printable_name
;
5679 /* We do not want the default decl_assembler_name implementation,
5680 rather if we have fixed everything we want a wrapper around it
5681 asserting that all non-local symbols already got their assembler
5682 name and only produce assembler names for local symbols. Or rather
5683 make sure we never call decl_assembler_name on local symbols and
5684 devise a separate, middle-end private scheme for it. */
5686 /* Reset diagnostic machinery. */
5687 tree_diagnostics_defaults (global_dc
);
5695 const pass_data pass_data_ipa_free_lang_data
=
5697 SIMPLE_IPA_PASS
, /* type */
5698 "*free_lang_data", /* name */
5699 OPTGROUP_NONE
, /* optinfo_flags */
5700 TV_IPA_FREE_LANG_DATA
, /* tv_id */
5701 0, /* properties_required */
5702 0, /* properties_provided */
5703 0, /* properties_destroyed */
5704 0, /* todo_flags_start */
5705 0, /* todo_flags_finish */
5708 class pass_ipa_free_lang_data
: public simple_ipa_opt_pass
5711 pass_ipa_free_lang_data (gcc::context
*ctxt
)
5712 : simple_ipa_opt_pass (pass_data_ipa_free_lang_data
, ctxt
)
5715 /* opt_pass methods: */
5716 virtual unsigned int execute (function
*) { return free_lang_data (); }
5718 }; // class pass_ipa_free_lang_data
5722 simple_ipa_opt_pass
*
5723 make_pass_ipa_free_lang_data (gcc::context
*ctxt
)
5725 return new pass_ipa_free_lang_data (ctxt
);
5728 /* The backbone of is_attribute_p(). ATTR_LEN is the string length of
5729 ATTR_NAME. Also used internally by remove_attribute(). */
5731 private_is_attribute_p (const char *attr_name
, size_t attr_len
, const_tree ident
)
5733 size_t ident_len
= IDENTIFIER_LENGTH (ident
);
5735 if (ident_len
== attr_len
)
5737 if (strcmp (attr_name
, IDENTIFIER_POINTER (ident
)) == 0)
5740 else if (ident_len
== attr_len
+ 4)
5742 /* There is the possibility that ATTR is 'text' and IDENT is
5744 const char *p
= IDENTIFIER_POINTER (ident
);
5745 if (p
[0] == '_' && p
[1] == '_'
5746 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
5747 && strncmp (attr_name
, p
+ 2, attr_len
) == 0)
5754 /* The backbone of lookup_attribute(). ATTR_LEN is the string length
5755 of ATTR_NAME, and LIST is not NULL_TREE. */
5757 private_lookup_attribute (const char *attr_name
, size_t attr_len
, tree list
)
5761 size_t ident_len
= IDENTIFIER_LENGTH (get_attribute_name (list
));
5763 if (ident_len
== attr_len
)
5765 if (!strcmp (attr_name
,
5766 IDENTIFIER_POINTER (get_attribute_name (list
))))
5769 /* TODO: If we made sure that attributes were stored in the
5770 canonical form without '__...__' (ie, as in 'text' as opposed
5771 to '__text__') then we could avoid the following case. */
5772 else if (ident_len
== attr_len
+ 4)
5774 const char *p
= IDENTIFIER_POINTER (get_attribute_name (list
));
5775 if (p
[0] == '_' && p
[1] == '_'
5776 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
5777 && strncmp (attr_name
, p
+ 2, attr_len
) == 0)
5780 list
= TREE_CHAIN (list
);
5786 /* Given an attribute name ATTR_NAME and a list of attributes LIST,
5787 return a pointer to the attribute's list first element if the attribute
5788 starts with ATTR_NAME. ATTR_NAME must be in the form 'text' (not
5792 private_lookup_attribute_by_prefix (const char *attr_name
, size_t attr_len
,
5797 size_t ident_len
= IDENTIFIER_LENGTH (get_attribute_name (list
));
5799 if (attr_len
> ident_len
)
5801 list
= TREE_CHAIN (list
);
5805 const char *p
= IDENTIFIER_POINTER (get_attribute_name (list
));
5807 if (strncmp (attr_name
, p
, attr_len
) == 0)
5810 /* TODO: If we made sure that attributes were stored in the
5811 canonical form without '__...__' (ie, as in 'text' as opposed
5812 to '__text__') then we could avoid the following case. */
5813 if (p
[0] == '_' && p
[1] == '_' &&
5814 strncmp (attr_name
, p
+ 2, attr_len
) == 0)
5817 list
= TREE_CHAIN (list
);
5824 /* A variant of lookup_attribute() that can be used with an identifier
5825 as the first argument, and where the identifier can be either
5826 'text' or '__text__'.
5828 Given an attribute ATTR_IDENTIFIER, and a list of attributes LIST,
5829 return a pointer to the attribute's list element if the attribute
5830 is part of the list, or NULL_TREE if not found. If the attribute
5831 appears more than once, this only returns the first occurrence; the
5832 TREE_CHAIN of the return value should be passed back in if further
5833 occurrences are wanted. ATTR_IDENTIFIER must be an identifier but
5834 can be in the form 'text' or '__text__'. */
5836 lookup_ident_attribute (tree attr_identifier
, tree list
)
5838 gcc_checking_assert (TREE_CODE (attr_identifier
) == IDENTIFIER_NODE
);
5842 gcc_checking_assert (TREE_CODE (get_attribute_name (list
))
5843 == IDENTIFIER_NODE
);
5845 /* Identifiers can be compared directly for equality. */
5846 if (attr_identifier
== get_attribute_name (list
))
5849 /* If they are not equal, they may still be one in the form
5850 'text' while the other one is in the form '__text__'. TODO:
5851 If we were storing attributes in normalized 'text' form, then
5852 this could all go away and we could take full advantage of
5853 the fact that we're comparing identifiers. :-) */
5855 size_t attr_len
= IDENTIFIER_LENGTH (attr_identifier
);
5856 size_t ident_len
= IDENTIFIER_LENGTH (get_attribute_name (list
));
5858 if (ident_len
== attr_len
+ 4)
5860 const char *p
= IDENTIFIER_POINTER (get_attribute_name (list
));
5861 const char *q
= IDENTIFIER_POINTER (attr_identifier
);
5862 if (p
[0] == '_' && p
[1] == '_'
5863 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
5864 && strncmp (q
, p
+ 2, attr_len
) == 0)
5867 else if (ident_len
+ 4 == attr_len
)
5869 const char *p
= IDENTIFIER_POINTER (get_attribute_name (list
));
5870 const char *q
= IDENTIFIER_POINTER (attr_identifier
);
5871 if (q
[0] == '_' && q
[1] == '_'
5872 && q
[attr_len
- 2] == '_' && q
[attr_len
- 1] == '_'
5873 && strncmp (q
+ 2, p
, ident_len
) == 0)
5877 list
= TREE_CHAIN (list
);
5883 /* Remove any instances of attribute ATTR_NAME in LIST and return the
5887 remove_attribute (const char *attr_name
, tree list
)
5890 size_t attr_len
= strlen (attr_name
);
5892 gcc_checking_assert (attr_name
[0] != '_');
5894 for (p
= &list
; *p
; )
5897 /* TODO: If we were storing attributes in normalized form, here
5898 we could use a simple strcmp(). */
5899 if (private_is_attribute_p (attr_name
, attr_len
, get_attribute_name (l
)))
5900 *p
= TREE_CHAIN (l
);
5902 p
= &TREE_CHAIN (l
);
5908 /* Return an attribute list that is the union of a1 and a2. */
5911 merge_attributes (tree a1
, tree a2
)
5915 /* Either one unset? Take the set one. */
5917 if ((attributes
= a1
) == 0)
5920 /* One that completely contains the other? Take it. */
5922 else if (a2
!= 0 && ! attribute_list_contained (a1
, a2
))
5924 if (attribute_list_contained (a2
, a1
))
5928 /* Pick the longest list, and hang on the other list. */
5930 if (list_length (a1
) < list_length (a2
))
5931 attributes
= a2
, a2
= a1
;
5933 for (; a2
!= 0; a2
= TREE_CHAIN (a2
))
5936 for (a
= lookup_ident_attribute (get_attribute_name (a2
),
5938 a
!= NULL_TREE
&& !attribute_value_equal (a
, a2
);
5939 a
= lookup_ident_attribute (get_attribute_name (a2
),
5944 a1
= copy_node (a2
);
5945 TREE_CHAIN (a1
) = attributes
;
5954 /* Given types T1 and T2, merge their attributes and return
5958 merge_type_attributes (tree t1
, tree t2
)
5960 return merge_attributes (TYPE_ATTRIBUTES (t1
),
5961 TYPE_ATTRIBUTES (t2
));
5964 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
5968 merge_decl_attributes (tree olddecl
, tree newdecl
)
5970 return merge_attributes (DECL_ATTRIBUTES (olddecl
),
5971 DECL_ATTRIBUTES (newdecl
));
5974 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
5976 /* Specialization of merge_decl_attributes for various Windows targets.
5978 This handles the following situation:
5980 __declspec (dllimport) int foo;
5983 The second instance of `foo' nullifies the dllimport. */
5986 merge_dllimport_decl_attributes (tree old
, tree new_tree
)
5989 int delete_dllimport_p
= 1;
5991 /* What we need to do here is remove from `old' dllimport if it doesn't
5992 appear in `new'. dllimport behaves like extern: if a declaration is
5993 marked dllimport and a definition appears later, then the object
5994 is not dllimport'd. We also remove a `new' dllimport if the old list
5995 contains dllexport: dllexport always overrides dllimport, regardless
5996 of the order of declaration. */
5997 if (!VAR_OR_FUNCTION_DECL_P (new_tree
))
5998 delete_dllimport_p
= 0;
5999 else if (DECL_DLLIMPORT_P (new_tree
)
6000 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (old
)))
6002 DECL_DLLIMPORT_P (new_tree
) = 0;
6003 warning (OPT_Wattributes
, "%q+D already declared with dllexport attribute: "
6004 "dllimport ignored", new_tree
);
6006 else if (DECL_DLLIMPORT_P (old
) && !DECL_DLLIMPORT_P (new_tree
))
6008 /* Warn about overriding a symbol that has already been used, e.g.:
6009 extern int __attribute__ ((dllimport)) foo;
6010 int* bar () {return &foo;}
6013 if (TREE_USED (old
))
6015 warning (0, "%q+D redeclared without dllimport attribute "
6016 "after being referenced with dll linkage", new_tree
);
6017 /* If we have used a variable's address with dllimport linkage,
6018 keep the old DECL_DLLIMPORT_P flag: the ADDR_EXPR using the
6019 decl may already have had TREE_CONSTANT computed.
6020 We still remove the attribute so that assembler code refers
6021 to '&foo rather than '_imp__foo'. */
6022 if (TREE_CODE (old
) == VAR_DECL
&& TREE_ADDRESSABLE (old
))
6023 DECL_DLLIMPORT_P (new_tree
) = 1;
6026 /* Let an inline definition silently override the external reference,
6027 but otherwise warn about attribute inconsistency. */
6028 else if (TREE_CODE (new_tree
) == VAR_DECL
6029 || !DECL_DECLARED_INLINE_P (new_tree
))
6030 warning (OPT_Wattributes
, "%q+D redeclared without dllimport attribute: "
6031 "previous dllimport ignored", new_tree
);
6034 delete_dllimport_p
= 0;
6036 a
= merge_attributes (DECL_ATTRIBUTES (old
), DECL_ATTRIBUTES (new_tree
));
6038 if (delete_dllimport_p
)
6039 a
= remove_attribute ("dllimport", a
);
6044 /* Handle a "dllimport" or "dllexport" attribute; arguments as in
6045 struct attribute_spec.handler. */
6048 handle_dll_attribute (tree
* pnode
, tree name
, tree args
, int flags
,
6054 /* These attributes may apply to structure and union types being created,
6055 but otherwise should pass to the declaration involved. */
6058 if (flags
& ((int) ATTR_FLAG_DECL_NEXT
| (int) ATTR_FLAG_FUNCTION_NEXT
6059 | (int) ATTR_FLAG_ARRAY_NEXT
))
6061 *no_add_attrs
= true;
6062 return tree_cons (name
, args
, NULL_TREE
);
6064 if (TREE_CODE (node
) == RECORD_TYPE
6065 || TREE_CODE (node
) == UNION_TYPE
)
6067 node
= TYPE_NAME (node
);
6073 warning (OPT_Wattributes
, "%qE attribute ignored",
6075 *no_add_attrs
= true;
6080 if (TREE_CODE (node
) != FUNCTION_DECL
6081 && TREE_CODE (node
) != VAR_DECL
6082 && TREE_CODE (node
) != TYPE_DECL
)
6084 *no_add_attrs
= true;
6085 warning (OPT_Wattributes
, "%qE attribute ignored",
6090 if (TREE_CODE (node
) == TYPE_DECL
6091 && TREE_CODE (TREE_TYPE (node
)) != RECORD_TYPE
6092 && TREE_CODE (TREE_TYPE (node
)) != UNION_TYPE
)
6094 *no_add_attrs
= true;
6095 warning (OPT_Wattributes
, "%qE attribute ignored",
6100 is_dllimport
= is_attribute_p ("dllimport", name
);
6102 /* Report error on dllimport ambiguities seen now before they cause
6106 /* Honor any target-specific overrides. */
6107 if (!targetm
.valid_dllimport_attribute_p (node
))
6108 *no_add_attrs
= true;
6110 else if (TREE_CODE (node
) == FUNCTION_DECL
6111 && DECL_DECLARED_INLINE_P (node
))
6113 warning (OPT_Wattributes
, "inline function %q+D declared as "
6114 " dllimport: attribute ignored", node
);
6115 *no_add_attrs
= true;
6117 /* Like MS, treat definition of dllimported variables and
6118 non-inlined functions on declaration as syntax errors. */
6119 else if (TREE_CODE (node
) == FUNCTION_DECL
&& DECL_INITIAL (node
))
6121 error ("function %q+D definition is marked dllimport", node
);
6122 *no_add_attrs
= true;
6125 else if (TREE_CODE (node
) == VAR_DECL
)
6127 if (DECL_INITIAL (node
))
6129 error ("variable %q+D definition is marked dllimport",
6131 *no_add_attrs
= true;
6134 /* `extern' needn't be specified with dllimport.
6135 Specify `extern' now and hope for the best. Sigh. */
6136 DECL_EXTERNAL (node
) = 1;
6137 /* Also, implicitly give dllimport'd variables declared within
6138 a function global scope, unless declared static. */
6139 if (current_function_decl
!= NULL_TREE
&& !TREE_STATIC (node
))
6140 TREE_PUBLIC (node
) = 1;
6143 if (*no_add_attrs
== false)
6144 DECL_DLLIMPORT_P (node
) = 1;
6146 else if (TREE_CODE (node
) == FUNCTION_DECL
6147 && DECL_DECLARED_INLINE_P (node
)
6148 && flag_keep_inline_dllexport
)
6149 /* An exported function, even if inline, must be emitted. */
6150 DECL_EXTERNAL (node
) = 0;
6152 /* Report error if symbol is not accessible at global scope. */
6153 if (!TREE_PUBLIC (node
)
6154 && (TREE_CODE (node
) == VAR_DECL
6155 || TREE_CODE (node
) == FUNCTION_DECL
))
6157 error ("external linkage required for symbol %q+D because of "
6158 "%qE attribute", node
, name
);
6159 *no_add_attrs
= true;
6162 /* A dllexport'd entity must have default visibility so that other
6163 program units (shared libraries or the main executable) can see
6164 it. A dllimport'd entity must have default visibility so that
6165 the linker knows that undefined references within this program
6166 unit can be resolved by the dynamic linker. */
6169 if (DECL_VISIBILITY_SPECIFIED (node
)
6170 && DECL_VISIBILITY (node
) != VISIBILITY_DEFAULT
)
6171 error ("%qE implies default visibility, but %qD has already "
6172 "been declared with a different visibility",
6174 DECL_VISIBILITY (node
) = VISIBILITY_DEFAULT
;
6175 DECL_VISIBILITY_SPECIFIED (node
) = 1;
6181 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
6183 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
6184 of the various TYPE_QUAL values. */
6187 set_type_quals (tree type
, int type_quals
)
6189 TYPE_READONLY (type
) = (type_quals
& TYPE_QUAL_CONST
) != 0;
6190 TYPE_VOLATILE (type
) = (type_quals
& TYPE_QUAL_VOLATILE
) != 0;
6191 TYPE_RESTRICT (type
) = (type_quals
& TYPE_QUAL_RESTRICT
) != 0;
6192 TYPE_ATOMIC (type
) = (type_quals
& TYPE_QUAL_ATOMIC
) != 0;
6193 TYPE_ADDR_SPACE (type
) = DECODE_QUAL_ADDR_SPACE (type_quals
);
6196 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
6199 check_qualified_type (const_tree cand
, const_tree base
, int type_quals
)
6201 return (TYPE_QUALS (cand
) == type_quals
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
) == TYPE_ALIGN (base
)
6207 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
6208 TYPE_ATTRIBUTES (base
)));
6211 /* Returns true iff CAND is equivalent to BASE with ALIGN. */
6214 check_aligned_type (const_tree cand
, const_tree base
, unsigned int align
)
6216 return (TYPE_QUALS (cand
) == TYPE_QUALS (base
)
6217 && TYPE_NAME (cand
) == TYPE_NAME (base
)
6218 /* Apparently this is needed for Objective-C. */
6219 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
6220 /* Check alignment. */
6221 && TYPE_ALIGN (cand
) == align
6222 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
6223 TYPE_ATTRIBUTES (base
)));
6226 /* This function checks to see if TYPE matches the size one of the built-in
6227 atomic types, and returns that core atomic type. */
6230 find_atomic_core_type (tree type
)
6232 tree base_atomic_type
;
6234 /* Only handle complete types. */
6235 if (TYPE_SIZE (type
) == NULL_TREE
)
6238 HOST_WIDE_INT type_size
= tree_to_uhwi (TYPE_SIZE (type
));
6242 base_atomic_type
= atomicQI_type_node
;
6246 base_atomic_type
= atomicHI_type_node
;
6250 base_atomic_type
= atomicSI_type_node
;
6254 base_atomic_type
= atomicDI_type_node
;
6258 base_atomic_type
= atomicTI_type_node
;
6262 base_atomic_type
= NULL_TREE
;
6265 return base_atomic_type
;
6268 /* Return a version of the TYPE, qualified as indicated by the
6269 TYPE_QUALS, if one exists. If no qualified version exists yet,
6270 return NULL_TREE. */
6273 get_qualified_type (tree type
, int type_quals
)
6277 if (TYPE_QUALS (type
) == type_quals
)
6280 /* Search the chain of variants to see if there is already one there just
6281 like the one we need to have. If so, use that existing one. We must
6282 preserve the TYPE_NAME, since there is code that depends on this. */
6283 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
6284 if (check_qualified_type (t
, type
, type_quals
))
6290 /* Like get_qualified_type, but creates the type if it does not
6291 exist. This function never returns NULL_TREE. */
6294 build_qualified_type (tree type
, int type_quals
)
6298 /* See if we already have the appropriate qualified variant. */
6299 t
= get_qualified_type (type
, type_quals
);
6301 /* If not, build it. */
6304 t
= build_variant_type_copy (type
);
6305 set_type_quals (t
, type_quals
);
6307 if (((type_quals
& TYPE_QUAL_ATOMIC
) == TYPE_QUAL_ATOMIC
))
6309 /* See if this object can map to a basic atomic type. */
6310 tree atomic_type
= find_atomic_core_type (type
);
6313 /* Ensure the alignment of this type is compatible with
6314 the required alignment of the atomic type. */
6315 if (TYPE_ALIGN (atomic_type
) > TYPE_ALIGN (t
))
6316 TYPE_ALIGN (t
) = TYPE_ALIGN (atomic_type
);
6320 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
6321 /* Propagate structural equality. */
6322 SET_TYPE_STRUCTURAL_EQUALITY (t
);
6323 else if (TYPE_CANONICAL (type
) != type
)
6324 /* Build the underlying canonical type, since it is different
6327 tree c
= build_qualified_type (TYPE_CANONICAL (type
), type_quals
);
6328 TYPE_CANONICAL (t
) = TYPE_CANONICAL (c
);
6331 /* T is its own canonical type. */
6332 TYPE_CANONICAL (t
) = t
;
6339 /* Create a variant of type T with alignment ALIGN. */
6342 build_aligned_type (tree type
, unsigned int align
)
6346 if (TYPE_PACKED (type
)
6347 || TYPE_ALIGN (type
) == align
)
6350 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
6351 if (check_aligned_type (t
, type
, align
))
6354 t
= build_variant_type_copy (type
);
6355 TYPE_ALIGN (t
) = align
;
6360 /* Create a new distinct copy of TYPE. The new type is made its own
6361 MAIN_VARIANT. If TYPE requires structural equality checks, the
6362 resulting type requires structural equality checks; otherwise, its
6363 TYPE_CANONICAL points to itself. */
6366 build_distinct_type_copy (tree type
)
6368 tree t
= copy_node (type
);
6370 TYPE_POINTER_TO (t
) = 0;
6371 TYPE_REFERENCE_TO (t
) = 0;
6373 /* Set the canonical type either to a new equivalence class, or
6374 propagate the need for structural equality checks. */
6375 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
6376 SET_TYPE_STRUCTURAL_EQUALITY (t
);
6378 TYPE_CANONICAL (t
) = t
;
6380 /* Make it its own variant. */
6381 TYPE_MAIN_VARIANT (t
) = t
;
6382 TYPE_NEXT_VARIANT (t
) = 0;
6384 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
6385 whose TREE_TYPE is not t. This can also happen in the Ada
6386 frontend when using subtypes. */
6391 /* Create a new variant of TYPE, equivalent but distinct. This is so
6392 the caller can modify it. TYPE_CANONICAL for the return type will
6393 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
6394 are considered equal by the language itself (or that both types
6395 require structural equality checks). */
6398 build_variant_type_copy (tree type
)
6400 tree t
, m
= TYPE_MAIN_VARIANT (type
);
6402 t
= build_distinct_type_copy (type
);
6404 /* Since we're building a variant, assume that it is a non-semantic
6405 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
6406 TYPE_CANONICAL (t
) = TYPE_CANONICAL (type
);
6408 /* Add the new type to the chain of variants of TYPE. */
6409 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (m
);
6410 TYPE_NEXT_VARIANT (m
) = t
;
6411 TYPE_MAIN_VARIANT (t
) = m
;
6416 /* Return true if the from tree in both tree maps are equal. */
6419 tree_map_base_eq (const void *va
, const void *vb
)
6421 const struct tree_map_base
*const a
= (const struct tree_map_base
*) va
,
6422 *const b
= (const struct tree_map_base
*) vb
;
6423 return (a
->from
== b
->from
);
6426 /* Hash a from tree in a tree_base_map. */
6429 tree_map_base_hash (const void *item
)
6431 return htab_hash_pointer (((const struct tree_map_base
*)item
)->from
);
6434 /* Return true if this tree map structure is marked for garbage collection
6435 purposes. We simply return true if the from tree is marked, so that this
6436 structure goes away when the from tree goes away. */
6439 tree_map_base_marked_p (const void *p
)
6441 return ggc_marked_p (((const struct tree_map_base
*) p
)->from
);
6444 /* Hash a from tree in a tree_map. */
6447 tree_map_hash (const void *item
)
6449 return (((const struct tree_map
*) item
)->hash
);
6452 /* Hash a from tree in a tree_decl_map. */
6455 tree_decl_map_hash (const void *item
)
6457 return DECL_UID (((const struct tree_decl_map
*) item
)->base
.from
);
6460 /* Return the initialization priority for DECL. */
6463 decl_init_priority_lookup (tree decl
)
6465 symtab_node
*snode
= symtab_node::get (decl
);
6468 return DEFAULT_INIT_PRIORITY
;
6470 snode
->get_init_priority ();
6473 /* Return the finalization priority for DECL. */
6476 decl_fini_priority_lookup (tree decl
)
6478 cgraph_node
*node
= cgraph_node::get (decl
);
6481 return DEFAULT_INIT_PRIORITY
;
6483 node
->get_fini_priority ();
6486 /* Set the initialization priority for DECL to PRIORITY. */
6489 decl_init_priority_insert (tree decl
, priority_type priority
)
6491 struct symtab_node
*snode
;
6493 if (priority
== DEFAULT_INIT_PRIORITY
)
6495 snode
= symtab_node::get (decl
);
6499 else if (TREE_CODE (decl
) == VAR_DECL
)
6500 snode
= varpool_node::get_create (decl
);
6502 snode
= cgraph_node::get_create (decl
);
6503 snode
->set_init_priority (priority
);
6506 /* Set the finalization priority for DECL to PRIORITY. */
6509 decl_fini_priority_insert (tree decl
, priority_type priority
)
6511 struct cgraph_node
*node
;
6513 if (priority
== DEFAULT_INIT_PRIORITY
)
6515 node
= cgraph_node::get (decl
);
6520 node
= cgraph_node::get_create (decl
);
6521 node
->set_fini_priority (priority
);
6524 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
6527 print_debug_expr_statistics (void)
6529 fprintf (stderr
, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
6530 (long) htab_size (debug_expr_for_decl
),
6531 (long) htab_elements (debug_expr_for_decl
),
6532 htab_collisions (debug_expr_for_decl
));
6535 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
6538 print_value_expr_statistics (void)
6540 fprintf (stderr
, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
6541 (long) htab_size (value_expr_for_decl
),
6542 (long) htab_elements (value_expr_for_decl
),
6543 htab_collisions (value_expr_for_decl
));
6546 /* Lookup a debug expression for FROM, and return it if we find one. */
6549 decl_debug_expr_lookup (tree from
)
6551 struct tree_decl_map
*h
, in
;
6552 in
.base
.from
= from
;
6554 h
= (struct tree_decl_map
*)
6555 htab_find_with_hash (debug_expr_for_decl
, &in
, DECL_UID (from
));
6561 /* Insert a mapping FROM->TO in the debug expression hashtable. */
6564 decl_debug_expr_insert (tree from
, tree to
)
6566 struct tree_decl_map
*h
;
6569 h
= ggc_alloc
<tree_decl_map
> ();
6570 h
->base
.from
= from
;
6572 loc
= htab_find_slot_with_hash (debug_expr_for_decl
, h
, DECL_UID (from
),
6574 *(struct tree_decl_map
**) loc
= h
;
6577 /* Lookup a value expression for FROM, and return it if we find one. */
6580 decl_value_expr_lookup (tree from
)
6582 struct tree_decl_map
*h
, in
;
6583 in
.base
.from
= from
;
6585 h
= (struct tree_decl_map
*)
6586 htab_find_with_hash (value_expr_for_decl
, &in
, DECL_UID (from
));
6592 /* Insert a mapping FROM->TO in the value expression hashtable. */
6595 decl_value_expr_insert (tree from
, tree to
)
6597 struct tree_decl_map
*h
;
6600 h
= ggc_alloc
<tree_decl_map
> ();
6601 h
->base
.from
= from
;
6603 loc
= htab_find_slot_with_hash (value_expr_for_decl
, h
, DECL_UID (from
),
6605 *(struct tree_decl_map
**) loc
= h
;
6608 /* Lookup a vector of debug arguments for FROM, and return it if we
6612 decl_debug_args_lookup (tree from
)
6614 struct tree_vec_map
*h
, in
;
6616 if (!DECL_HAS_DEBUG_ARGS_P (from
))
6618 gcc_checking_assert (debug_args_for_decl
!= NULL
);
6619 in
.base
.from
= from
;
6620 h
= (struct tree_vec_map
*)
6621 htab_find_with_hash (debug_args_for_decl
, &in
, DECL_UID (from
));
6627 /* Insert a mapping FROM->empty vector of debug arguments in the value
6628 expression hashtable. */
6631 decl_debug_args_insert (tree from
)
6633 struct tree_vec_map
*h
;
6636 if (DECL_HAS_DEBUG_ARGS_P (from
))
6637 return decl_debug_args_lookup (from
);
6638 if (debug_args_for_decl
== NULL
)
6639 debug_args_for_decl
= htab_create_ggc (64, tree_vec_map_hash
,
6640 tree_vec_map_eq
, 0);
6641 h
= ggc_alloc
<tree_vec_map
> ();
6642 h
->base
.from
= from
;
6644 loc
= htab_find_slot_with_hash (debug_args_for_decl
, h
, DECL_UID (from
),
6646 *(struct tree_vec_map
**) loc
= h
;
6647 DECL_HAS_DEBUG_ARGS_P (from
) = 1;
6651 /* Hashing of types so that we don't make duplicates.
6652 The entry point is `type_hash_canon'. */
6654 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
6655 with types in the TREE_VALUE slots), by adding the hash codes
6656 of the individual types. */
6659 type_hash_list (const_tree list
, inchash::hash
&hstate
)
6663 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
6664 if (TREE_VALUE (tail
) != error_mark_node
)
6665 hstate
.add_object (TYPE_HASH (TREE_VALUE (tail
)));
6668 /* These are the Hashtable callback functions. */
6670 /* Returns true iff the types are equivalent. */
6673 type_hash_eq (const void *va
, const void *vb
)
6675 const struct type_hash
*const a
= (const struct type_hash
*) va
,
6676 *const b
= (const struct type_hash
*) vb
;
6678 /* First test the things that are the same for all types. */
6679 if (a
->hash
!= b
->hash
6680 || TREE_CODE (a
->type
) != TREE_CODE (b
->type
)
6681 || TREE_TYPE (a
->type
) != TREE_TYPE (b
->type
)
6682 || !attribute_list_equal (TYPE_ATTRIBUTES (a
->type
),
6683 TYPE_ATTRIBUTES (b
->type
))
6684 || (TREE_CODE (a
->type
) != COMPLEX_TYPE
6685 && TYPE_NAME (a
->type
) != TYPE_NAME (b
->type
)))
6688 /* Be careful about comparing arrays before and after the element type
6689 has been completed; don't compare TYPE_ALIGN unless both types are
6691 if (COMPLETE_TYPE_P (a
->type
) && COMPLETE_TYPE_P (b
->type
)
6692 && (TYPE_ALIGN (a
->type
) != TYPE_ALIGN (b
->type
)
6693 || TYPE_MODE (a
->type
) != TYPE_MODE (b
->type
)))
6696 switch (TREE_CODE (a
->type
))
6701 case REFERENCE_TYPE
:
6706 return TYPE_VECTOR_SUBPARTS (a
->type
) == TYPE_VECTOR_SUBPARTS (b
->type
);
6709 if (TYPE_VALUES (a
->type
) != TYPE_VALUES (b
->type
)
6710 && !(TYPE_VALUES (a
->type
)
6711 && TREE_CODE (TYPE_VALUES (a
->type
)) == TREE_LIST
6712 && TYPE_VALUES (b
->type
)
6713 && TREE_CODE (TYPE_VALUES (b
->type
)) == TREE_LIST
6714 && type_list_equal (TYPE_VALUES (a
->type
),
6715 TYPE_VALUES (b
->type
))))
6718 /* ... fall through ... */
6723 if (TYPE_PRECISION (a
->type
) != TYPE_PRECISION (b
->type
))
6725 return ((TYPE_MAX_VALUE (a
->type
) == TYPE_MAX_VALUE (b
->type
)
6726 || tree_int_cst_equal (TYPE_MAX_VALUE (a
->type
),
6727 TYPE_MAX_VALUE (b
->type
)))
6728 && (TYPE_MIN_VALUE (a
->type
) == TYPE_MIN_VALUE (b
->type
)
6729 || tree_int_cst_equal (TYPE_MIN_VALUE (a
->type
),
6730 TYPE_MIN_VALUE (b
->type
))));
6732 case FIXED_POINT_TYPE
:
6733 return TYPE_SATURATING (a
->type
) == TYPE_SATURATING (b
->type
);
6736 return TYPE_OFFSET_BASETYPE (a
->type
) == TYPE_OFFSET_BASETYPE (b
->type
);
6739 if (TYPE_METHOD_BASETYPE (a
->type
) == TYPE_METHOD_BASETYPE (b
->type
)
6740 && (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
6741 || (TYPE_ARG_TYPES (a
->type
)
6742 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
6743 && TYPE_ARG_TYPES (b
->type
)
6744 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
6745 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
6746 TYPE_ARG_TYPES (b
->type
)))))
6750 return TYPE_DOMAIN (a
->type
) == TYPE_DOMAIN (b
->type
);
6754 case QUAL_UNION_TYPE
:
6755 return (TYPE_FIELDS (a
->type
) == TYPE_FIELDS (b
->type
)
6756 || (TYPE_FIELDS (a
->type
)
6757 && TREE_CODE (TYPE_FIELDS (a
->type
)) == TREE_LIST
6758 && TYPE_FIELDS (b
->type
)
6759 && TREE_CODE (TYPE_FIELDS (b
->type
)) == TREE_LIST
6760 && type_list_equal (TYPE_FIELDS (a
->type
),
6761 TYPE_FIELDS (b
->type
))));
6764 if (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
6765 || (TYPE_ARG_TYPES (a
->type
)
6766 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
6767 && TYPE_ARG_TYPES (b
->type
)
6768 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
6769 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
6770 TYPE_ARG_TYPES (b
->type
))))
6778 if (lang_hooks
.types
.type_hash_eq
!= NULL
)
6779 return lang_hooks
.types
.type_hash_eq (a
->type
, b
->type
);
6784 /* Return the cached hash value. */
6787 type_hash_hash (const void *item
)
6789 return ((const struct type_hash
*) item
)->hash
;
6792 /* Given TYPE, and HASHCODE its hash code, return the canonical
6793 object for an identical type if one already exists.
6794 Otherwise, return TYPE, and record it as the canonical object.
6796 To use this function, first create a type of the sort you want.
6797 Then compute its hash code from the fields of the type that
6798 make it different from other similar types.
6799 Then call this function and use the value. */
6802 type_hash_canon (unsigned int hashcode
, tree type
)
6807 /* The hash table only contains main variants, so ensure that's what we're
6809 gcc_assert (TYPE_MAIN_VARIANT (type
) == type
);
6811 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
6812 must call that routine before comparing TYPE_ALIGNs. */
6818 loc
= htab_find_slot_with_hash (type_hash_table
, &in
, hashcode
, INSERT
);
6821 tree t1
= ((type_hash
*) *loc
)->type
;
6822 gcc_assert (TYPE_MAIN_VARIANT (t1
) == t1
);
6823 if (GATHER_STATISTICS
)
6825 tree_code_counts
[(int) TREE_CODE (type
)]--;
6826 tree_node_counts
[(int) t_kind
]--;
6827 tree_node_sizes
[(int) t_kind
] -= sizeof (struct tree_type_non_common
);
6833 struct type_hash
*h
;
6835 h
= ggc_alloc
<type_hash
> ();
6844 /* See if the data pointed to by the type hash table is marked. We consider
6845 it marked if the type is marked or if a debug type number or symbol
6846 table entry has been made for the type. */
6849 type_hash_marked_p (const void *p
)
6851 const_tree
const type
= ((const struct type_hash
*) p
)->type
;
6853 return ggc_marked_p (type
);
6857 print_type_hash_statistics (void)
6859 fprintf (stderr
, "Type hash: size %ld, %ld elements, %f collisions\n",
6860 (long) htab_size (type_hash_table
),
6861 (long) htab_elements (type_hash_table
),
6862 htab_collisions (type_hash_table
));
6865 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
6866 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
6867 by adding the hash codes of the individual attributes. */
6870 attribute_hash_list (const_tree list
, inchash::hash
&hstate
)
6874 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
6875 /* ??? Do we want to add in TREE_VALUE too? */
6876 hstate
.add_object (IDENTIFIER_HASH_VALUE (get_attribute_name (tail
)));
6879 /* Given two lists of attributes, return true if list l2 is
6880 equivalent to l1. */
6883 attribute_list_equal (const_tree l1
, const_tree l2
)
6888 return attribute_list_contained (l1
, l2
)
6889 && attribute_list_contained (l2
, l1
);
6892 /* Given two lists of attributes, return true if list L2 is
6893 completely contained within L1. */
6894 /* ??? This would be faster if attribute names were stored in a canonicalized
6895 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
6896 must be used to show these elements are equivalent (which they are). */
6897 /* ??? It's not clear that attributes with arguments will always be handled
6901 attribute_list_contained (const_tree l1
, const_tree l2
)
6905 /* First check the obvious, maybe the lists are identical. */
6909 /* Maybe the lists are similar. */
6910 for (t1
= l1
, t2
= l2
;
6912 && get_attribute_name (t1
) == get_attribute_name (t2
)
6913 && TREE_VALUE (t1
) == TREE_VALUE (t2
);
6914 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
6917 /* Maybe the lists are equal. */
6918 if (t1
== 0 && t2
== 0)
6921 for (; t2
!= 0; t2
= TREE_CHAIN (t2
))
6924 /* This CONST_CAST is okay because lookup_attribute does not
6925 modify its argument and the return value is assigned to a
6927 for (attr
= lookup_ident_attribute (get_attribute_name (t2
),
6928 CONST_CAST_TREE (l1
));
6929 attr
!= NULL_TREE
&& !attribute_value_equal (t2
, attr
);
6930 attr
= lookup_ident_attribute (get_attribute_name (t2
),
6934 if (attr
== NULL_TREE
)
6941 /* Given two lists of types
6942 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
6943 return 1 if the lists contain the same types in the same order.
6944 Also, the TREE_PURPOSEs must match. */
6947 type_list_equal (const_tree l1
, const_tree l2
)
6951 for (t1
= l1
, t2
= l2
; t1
&& t2
; t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
6952 if (TREE_VALUE (t1
) != TREE_VALUE (t2
)
6953 || (TREE_PURPOSE (t1
) != TREE_PURPOSE (t2
)
6954 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
))
6955 && (TREE_TYPE (TREE_PURPOSE (t1
))
6956 == TREE_TYPE (TREE_PURPOSE (t2
))))))
6962 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
6963 given by TYPE. If the argument list accepts variable arguments,
6964 then this function counts only the ordinary arguments. */
6967 type_num_arguments (const_tree type
)
6972 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
6973 /* If the function does not take a variable number of arguments,
6974 the last element in the list will have type `void'. */
6975 if (VOID_TYPE_P (TREE_VALUE (t
)))
6983 /* Nonzero if integer constants T1 and T2
6984 represent the same constant value. */
6987 tree_int_cst_equal (const_tree t1
, const_tree t2
)
6992 if (t1
== 0 || t2
== 0)
6995 if (TREE_CODE (t1
) == INTEGER_CST
6996 && TREE_CODE (t2
) == INTEGER_CST
6997 && wi::to_widest (t1
) == wi::to_widest (t2
))
7003 /* Return true if T is an INTEGER_CST whose numerical value (extended
7004 according to TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. */
7007 tree_fits_shwi_p (const_tree t
)
7009 return (t
!= NULL_TREE
7010 && TREE_CODE (t
) == INTEGER_CST
7011 && wi::fits_shwi_p (wi::to_widest (t
)));
7014 /* Return true if T is an INTEGER_CST whose numerical value (extended
7015 according to TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. */
7018 tree_fits_uhwi_p (const_tree t
)
7020 return (t
!= NULL_TREE
7021 && TREE_CODE (t
) == INTEGER_CST
7022 && wi::fits_uhwi_p (wi::to_widest (t
)));
7025 /* T is an INTEGER_CST whose numerical value (extended according to
7026 TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. Return that
7030 tree_to_shwi (const_tree t
)
7032 gcc_assert (tree_fits_shwi_p (t
));
7033 return TREE_INT_CST_LOW (t
);
7036 /* T is an INTEGER_CST whose numerical value (extended according to
7037 TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. Return that
7040 unsigned HOST_WIDE_INT
7041 tree_to_uhwi (const_tree t
)
7043 gcc_assert (tree_fits_uhwi_p (t
));
7044 return TREE_INT_CST_LOW (t
);
7047 /* Return the most significant (sign) bit of T. */
7050 tree_int_cst_sign_bit (const_tree t
)
7052 unsigned bitno
= TYPE_PRECISION (TREE_TYPE (t
)) - 1;
7054 return wi::extract_uhwi (t
, bitno
, 1);
7057 /* Return an indication of the sign of the integer constant T.
7058 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
7059 Note that -1 will never be returned if T's type is unsigned. */
7062 tree_int_cst_sgn (const_tree t
)
7064 if (wi::eq_p (t
, 0))
7066 else if (TYPE_UNSIGNED (TREE_TYPE (t
)))
7068 else if (wi::neg_p (t
))
7074 /* Return the minimum number of bits needed to represent VALUE in a
7075 signed or unsigned type, UNSIGNEDP says which. */
7078 tree_int_cst_min_precision (tree value
, signop sgn
)
7080 /* If the value is negative, compute its negative minus 1. The latter
7081 adjustment is because the absolute value of the largest negative value
7082 is one larger than the largest positive value. This is equivalent to
7083 a bit-wise negation, so use that operation instead. */
7085 if (tree_int_cst_sgn (value
) < 0)
7086 value
= fold_build1 (BIT_NOT_EXPR
, TREE_TYPE (value
), value
);
7088 /* Return the number of bits needed, taking into account the fact
7089 that we need one more bit for a signed than unsigned type.
7090 If value is 0 or -1, the minimum precision is 1 no matter
7091 whether unsignedp is true or false. */
7093 if (integer_zerop (value
))
7096 return tree_floor_log2 (value
) + 1 + (sgn
== SIGNED
? 1 : 0) ;
7099 /* Return truthvalue of whether T1 is the same tree structure as T2.
7100 Return 1 if they are the same.
7101 Return 0 if they are understandably different.
7102 Return -1 if either contains tree structure not understood by
7106 simple_cst_equal (const_tree t1
, const_tree t2
)
7108 enum tree_code code1
, code2
;
7114 if (t1
== 0 || t2
== 0)
7117 code1
= TREE_CODE (t1
);
7118 code2
= TREE_CODE (t2
);
7120 if (CONVERT_EXPR_CODE_P (code1
) || code1
== NON_LVALUE_EXPR
)
7122 if (CONVERT_EXPR_CODE_P (code2
)
7123 || code2
== NON_LVALUE_EXPR
)
7124 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7126 return simple_cst_equal (TREE_OPERAND (t1
, 0), t2
);
7129 else if (CONVERT_EXPR_CODE_P (code2
)
7130 || code2
== NON_LVALUE_EXPR
)
7131 return simple_cst_equal (t1
, TREE_OPERAND (t2
, 0));
7139 return wi::to_widest (t1
) == wi::to_widest (t2
);
7142 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1
), TREE_REAL_CST (t2
));
7145 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1
), TREE_FIXED_CST (t2
));
7148 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
7149 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
7150 TREE_STRING_LENGTH (t1
)));
7154 unsigned HOST_WIDE_INT idx
;
7155 vec
<constructor_elt
, va_gc
> *v1
= CONSTRUCTOR_ELTS (t1
);
7156 vec
<constructor_elt
, va_gc
> *v2
= CONSTRUCTOR_ELTS (t2
);
7158 if (vec_safe_length (v1
) != vec_safe_length (v2
))
7161 for (idx
= 0; idx
< vec_safe_length (v1
); ++idx
)
7162 /* ??? Should we handle also fields here? */
7163 if (!simple_cst_equal ((*v1
)[idx
].value
, (*v2
)[idx
].value
))
7169 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7172 cmp
= simple_cst_equal (CALL_EXPR_FN (t1
), CALL_EXPR_FN (t2
));
7175 if (call_expr_nargs (t1
) != call_expr_nargs (t2
))
7178 const_tree arg1
, arg2
;
7179 const_call_expr_arg_iterator iter1
, iter2
;
7180 for (arg1
= first_const_call_expr_arg (t1
, &iter1
),
7181 arg2
= first_const_call_expr_arg (t2
, &iter2
);
7183 arg1
= next_const_call_expr_arg (&iter1
),
7184 arg2
= next_const_call_expr_arg (&iter2
))
7186 cmp
= simple_cst_equal (arg1
, arg2
);
7190 return arg1
== arg2
;
7194 /* Special case: if either target is an unallocated VAR_DECL,
7195 it means that it's going to be unified with whatever the
7196 TARGET_EXPR is really supposed to initialize, so treat it
7197 as being equivalent to anything. */
7198 if ((TREE_CODE (TREE_OPERAND (t1
, 0)) == VAR_DECL
7199 && DECL_NAME (TREE_OPERAND (t1
, 0)) == NULL_TREE
7200 && !DECL_RTL_SET_P (TREE_OPERAND (t1
, 0)))
7201 || (TREE_CODE (TREE_OPERAND (t2
, 0)) == VAR_DECL
7202 && DECL_NAME (TREE_OPERAND (t2
, 0)) == NULL_TREE
7203 && !DECL_RTL_SET_P (TREE_OPERAND (t2
, 0))))
7206 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7211 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
7213 case WITH_CLEANUP_EXPR
:
7214 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7218 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t1
, 1));
7221 if (TREE_OPERAND (t1
, 1) == TREE_OPERAND (t2
, 1))
7222 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7236 /* This general rule works for most tree codes. All exceptions should be
7237 handled above. If this is a language-specific tree code, we can't
7238 trust what might be in the operand, so say we don't know
7240 if ((int) code1
>= (int) LAST_AND_UNUSED_TREE_CODE
)
7243 switch (TREE_CODE_CLASS (code1
))
7247 case tcc_comparison
:
7248 case tcc_expression
:
7252 for (i
= 0; i
< TREE_CODE_LENGTH (code1
); i
++)
7254 cmp
= simple_cst_equal (TREE_OPERAND (t1
, i
), TREE_OPERAND (t2
, i
));
7266 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
7267 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
7268 than U, respectively. */
7271 compare_tree_int (const_tree t
, unsigned HOST_WIDE_INT u
)
7273 if (tree_int_cst_sgn (t
) < 0)
7275 else if (!tree_fits_uhwi_p (t
))
7277 else if (TREE_INT_CST_LOW (t
) == u
)
7279 else if (TREE_INT_CST_LOW (t
) < u
)
7285 /* Return true if SIZE represents a constant size that is in bounds of
7286 what the middle-end and the backend accepts (covering not more than
7287 half of the address-space). */
7290 valid_constant_size_p (const_tree size
)
7292 if (! tree_fits_uhwi_p (size
)
7293 || TREE_OVERFLOW (size
)
7294 || tree_int_cst_sign_bit (size
) != 0)
7299 /* Return the precision of the type, or for a complex or vector type the
7300 precision of the type of its elements. */
7303 element_precision (const_tree type
)
7305 enum tree_code code
= TREE_CODE (type
);
7306 if (code
== COMPLEX_TYPE
|| code
== VECTOR_TYPE
)
7307 type
= TREE_TYPE (type
);
7309 return TYPE_PRECISION (type
);
7312 /* Return true if CODE represents an associative tree code. Otherwise
7315 associative_tree_code (enum tree_code code
)
7334 /* Return true if CODE represents a commutative tree code. Otherwise
7337 commutative_tree_code (enum tree_code code
)
7343 case MULT_HIGHPART_EXPR
:
7351 case UNORDERED_EXPR
:
7355 case TRUTH_AND_EXPR
:
7356 case TRUTH_XOR_EXPR
:
7358 case WIDEN_MULT_EXPR
:
7359 case VEC_WIDEN_MULT_HI_EXPR
:
7360 case VEC_WIDEN_MULT_LO_EXPR
:
7361 case VEC_WIDEN_MULT_EVEN_EXPR
:
7362 case VEC_WIDEN_MULT_ODD_EXPR
:
7371 /* Return true if CODE represents a ternary tree code for which the
7372 first two operands are commutative. Otherwise return false. */
7374 commutative_ternary_tree_code (enum tree_code code
)
7378 case WIDEN_MULT_PLUS_EXPR
:
7379 case WIDEN_MULT_MINUS_EXPR
:
7391 /* Generate a hash value for an expression. This can be used iteratively
7392 by passing a previous result as the HSTATE argument.
7394 This function is intended to produce the same hash for expressions which
7395 would compare equal using operand_equal_p. */
7397 add_expr (const_tree t
, inchash::hash
&hstate
)
7400 enum tree_code code
;
7401 enum tree_code_class tclass
;
7405 hstate
.merge_hash (0);
7409 code
= TREE_CODE (t
);
7413 /* Alas, constants aren't shared, so we can't rely on pointer
7416 hstate
.merge_hash (0);
7419 for (i
= 0; i
< TREE_INT_CST_NUNITS (t
); i
++)
7420 hstate
.add_wide_int (TREE_INT_CST_ELT (t
, i
));
7424 unsigned int val2
= real_hash (TREE_REAL_CST_PTR (t
));
7425 hstate
.merge_hash (val2
);
7430 unsigned int val2
= fixed_hash (TREE_FIXED_CST_PTR (t
));
7431 hstate
.merge_hash (val2
);
7435 hstate
.add ((const void *) TREE_STRING_POINTER (t
), TREE_STRING_LENGTH (t
));
7438 inchash::add_expr (TREE_REALPART (t
), hstate
);
7439 inchash::add_expr (TREE_IMAGPART (t
), hstate
);
7444 for (i
= 0; i
< VECTOR_CST_NELTS (t
); ++i
)
7445 inchash::add_expr (VECTOR_CST_ELT (t
, i
), hstate
);
7449 /* We can just compare by pointer. */
7450 hstate
.add_wide_int (SSA_NAME_VERSION (t
));
7452 case PLACEHOLDER_EXPR
:
7453 /* The node itself doesn't matter. */
7456 /* A list of expressions, for a CALL_EXPR or as the elements of a
7458 for (; t
; t
= TREE_CHAIN (t
))
7459 inchash::add_expr (TREE_VALUE (t
), hstate
);
7463 unsigned HOST_WIDE_INT idx
;
7465 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t
), idx
, field
, value
)
7467 inchash::add_expr (field
, hstate
);
7468 inchash::add_expr (value
, hstate
);
7473 /* When referring to a built-in FUNCTION_DECL, use the __builtin__ form.
7474 Otherwise nodes that compare equal according to operand_equal_p might
7475 get different hash codes. However, don't do this for machine specific
7476 or front end builtins, since the function code is overloaded in those
7478 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
7479 && builtin_decl_explicit_p (DECL_FUNCTION_CODE (t
)))
7481 t
= builtin_decl_explicit (DECL_FUNCTION_CODE (t
));
7482 code
= TREE_CODE (t
);
7486 tclass
= TREE_CODE_CLASS (code
);
7488 if (tclass
== tcc_declaration
)
7490 /* DECL's have a unique ID */
7491 hstate
.add_wide_int (DECL_UID (t
));
7495 gcc_assert (IS_EXPR_CODE_CLASS (tclass
));
7497 hstate
.add_object (code
);
7499 /* Don't hash the type, that can lead to having nodes which
7500 compare equal according to operand_equal_p, but which
7501 have different hash codes. */
7502 if (CONVERT_EXPR_CODE_P (code
)
7503 || code
== NON_LVALUE_EXPR
)
7505 /* Make sure to include signness in the hash computation. */
7506 hstate
.add_int (TYPE_UNSIGNED (TREE_TYPE (t
)));
7507 inchash::add_expr (TREE_OPERAND (t
, 0), hstate
);
7510 else if (commutative_tree_code (code
))
7512 /* It's a commutative expression. We want to hash it the same
7513 however it appears. We do this by first hashing both operands
7514 and then rehashing based on the order of their independent
7516 inchash::hash one
, two
;
7517 inchash::add_expr (TREE_OPERAND (t
, 0), one
);
7518 inchash::add_expr (TREE_OPERAND (t
, 1), two
);
7519 hstate
.add_commutative (one
, two
);
7522 for (i
= TREE_OPERAND_LENGTH (t
) - 1; i
>= 0; --i
)
7523 inchash::add_expr (TREE_OPERAND (t
, i
), hstate
);
7531 /* Constructors for pointer, array and function types.
7532 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
7533 constructed by language-dependent code, not here.) */
7535 /* Construct, lay out and return the type of pointers to TO_TYPE with
7536 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
7537 reference all of memory. If such a type has already been
7538 constructed, reuse it. */
7541 build_pointer_type_for_mode (tree to_type
, enum machine_mode mode
,
7546 if (to_type
== error_mark_node
)
7547 return error_mark_node
;
7549 /* If the pointed-to type has the may_alias attribute set, force
7550 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7551 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
7552 can_alias_all
= true;
7554 /* In some cases, languages will have things that aren't a POINTER_TYPE
7555 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
7556 In that case, return that type without regard to the rest of our
7559 ??? This is a kludge, but consistent with the way this function has
7560 always operated and there doesn't seem to be a good way to avoid this
7562 if (TYPE_POINTER_TO (to_type
) != 0
7563 && TREE_CODE (TYPE_POINTER_TO (to_type
)) != POINTER_TYPE
)
7564 return TYPE_POINTER_TO (to_type
);
7566 /* First, if we already have a type for pointers to TO_TYPE and it's
7567 the proper mode, use it. */
7568 for (t
= TYPE_POINTER_TO (to_type
); t
; t
= TYPE_NEXT_PTR_TO (t
))
7569 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
7572 t
= make_node (POINTER_TYPE
);
7574 TREE_TYPE (t
) = to_type
;
7575 SET_TYPE_MODE (t
, mode
);
7576 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
7577 TYPE_NEXT_PTR_TO (t
) = TYPE_POINTER_TO (to_type
);
7578 TYPE_POINTER_TO (to_type
) = t
;
7580 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
))
7581 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7582 else if (TYPE_CANONICAL (to_type
) != to_type
)
7584 = build_pointer_type_for_mode (TYPE_CANONICAL (to_type
),
7585 mode
, can_alias_all
);
7587 /* Lay out the type. This function has many callers that are concerned
7588 with expression-construction, and this simplifies them all. */
7594 /* By default build pointers in ptr_mode. */
7597 build_pointer_type (tree to_type
)
7599 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
7600 : TYPE_ADDR_SPACE (to_type
);
7601 enum machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
7602 return build_pointer_type_for_mode (to_type
, pointer_mode
, false);
7605 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
7608 build_reference_type_for_mode (tree to_type
, enum machine_mode mode
,
7613 if (to_type
== error_mark_node
)
7614 return error_mark_node
;
7616 /* If the pointed-to type has the may_alias attribute set, force
7617 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7618 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
7619 can_alias_all
= true;
7621 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
7622 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
7623 In that case, return that type without regard to the rest of our
7626 ??? This is a kludge, but consistent with the way this function has
7627 always operated and there doesn't seem to be a good way to avoid this
7629 if (TYPE_REFERENCE_TO (to_type
) != 0
7630 && TREE_CODE (TYPE_REFERENCE_TO (to_type
)) != REFERENCE_TYPE
)
7631 return TYPE_REFERENCE_TO (to_type
);
7633 /* First, if we already have a type for pointers to TO_TYPE and it's
7634 the proper mode, use it. */
7635 for (t
= TYPE_REFERENCE_TO (to_type
); t
; t
= TYPE_NEXT_REF_TO (t
))
7636 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
7639 t
= make_node (REFERENCE_TYPE
);
7641 TREE_TYPE (t
) = to_type
;
7642 SET_TYPE_MODE (t
, mode
);
7643 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
7644 TYPE_NEXT_REF_TO (t
) = TYPE_REFERENCE_TO (to_type
);
7645 TYPE_REFERENCE_TO (to_type
) = t
;
7647 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
))
7648 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7649 else if (TYPE_CANONICAL (to_type
) != to_type
)
7651 = build_reference_type_for_mode (TYPE_CANONICAL (to_type
),
7652 mode
, can_alias_all
);
7660 /* Build the node for the type of references-to-TO_TYPE by default
7664 build_reference_type (tree to_type
)
7666 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
7667 : TYPE_ADDR_SPACE (to_type
);
7668 enum machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
7669 return build_reference_type_for_mode (to_type
, pointer_mode
, false);
7672 #define MAX_INT_CACHED_PREC \
7673 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
7674 static GTY(()) tree nonstandard_integer_type_cache
[2 * MAX_INT_CACHED_PREC
+ 2];
7676 /* Builds a signed or unsigned integer type of precision PRECISION.
7677 Used for C bitfields whose precision does not match that of
7678 built-in target types. */
7680 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision
,
7686 unsignedp
= MAX_INT_CACHED_PREC
+ 1;
7688 if (precision
<= MAX_INT_CACHED_PREC
)
7690 itype
= nonstandard_integer_type_cache
[precision
+ unsignedp
];
7695 itype
= make_node (INTEGER_TYPE
);
7696 TYPE_PRECISION (itype
) = precision
;
7699 fixup_unsigned_type (itype
);
7701 fixup_signed_type (itype
);
7704 if (tree_fits_uhwi_p (TYPE_MAX_VALUE (itype
)))
7705 ret
= type_hash_canon (tree_to_uhwi (TYPE_MAX_VALUE (itype
)), itype
);
7706 if (precision
<= MAX_INT_CACHED_PREC
)
7707 nonstandard_integer_type_cache
[precision
+ unsignedp
] = ret
;
7712 /* Create a range of some discrete type TYPE (an INTEGER_TYPE, ENUMERAL_TYPE
7713 or BOOLEAN_TYPE) with low bound LOWVAL and high bound HIGHVAL. If SHARED
7714 is true, reuse such a type that has already been constructed. */
7717 build_range_type_1 (tree type
, tree lowval
, tree highval
, bool shared
)
7719 tree itype
= make_node (INTEGER_TYPE
);
7720 inchash::hash hstate
;
7722 TREE_TYPE (itype
) = type
;
7724 TYPE_MIN_VALUE (itype
) = fold_convert (type
, lowval
);
7725 TYPE_MAX_VALUE (itype
) = highval
? fold_convert (type
, highval
) : NULL
;
7727 TYPE_PRECISION (itype
) = TYPE_PRECISION (type
);
7728 SET_TYPE_MODE (itype
, TYPE_MODE (type
));
7729 TYPE_SIZE (itype
) = TYPE_SIZE (type
);
7730 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (type
);
7731 TYPE_ALIGN (itype
) = TYPE_ALIGN (type
);
7732 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (type
);
7737 if ((TYPE_MIN_VALUE (itype
)
7738 && TREE_CODE (TYPE_MIN_VALUE (itype
)) != INTEGER_CST
)
7739 || (TYPE_MAX_VALUE (itype
)
7740 && TREE_CODE (TYPE_MAX_VALUE (itype
)) != INTEGER_CST
))
7742 /* Since we cannot reliably merge this type, we need to compare it using
7743 structural equality checks. */
7744 SET_TYPE_STRUCTURAL_EQUALITY (itype
);
7748 inchash::add_expr (TYPE_MIN_VALUE (itype
), hstate
);
7749 inchash::add_expr (TYPE_MAX_VALUE (itype
), hstate
);
7750 hstate
.merge_hash (TYPE_HASH (type
));
7751 itype
= type_hash_canon (hstate
.end (), itype
);
7756 /* Wrapper around build_range_type_1 with SHARED set to true. */
7759 build_range_type (tree type
, tree lowval
, tree highval
)
7761 return build_range_type_1 (type
, lowval
, highval
, true);
7764 /* Wrapper around build_range_type_1 with SHARED set to false. */
7767 build_nonshared_range_type (tree type
, tree lowval
, tree highval
)
7769 return build_range_type_1 (type
, lowval
, highval
, false);
7772 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
7773 MAXVAL should be the maximum value in the domain
7774 (one less than the length of the array).
7776 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
7777 We don't enforce this limit, that is up to caller (e.g. language front end).
7778 The limit exists because the result is a signed type and we don't handle
7779 sizes that use more than one HOST_WIDE_INT. */
7782 build_index_type (tree maxval
)
7784 return build_range_type (sizetype
, size_zero_node
, maxval
);
7787 /* Return true if the debug information for TYPE, a subtype, should be emitted
7788 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
7789 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
7790 debug info and doesn't reflect the source code. */
7793 subrange_type_for_debug_p (const_tree type
, tree
*lowval
, tree
*highval
)
7795 tree base_type
= TREE_TYPE (type
), low
, high
;
7797 /* Subrange types have a base type which is an integral type. */
7798 if (!INTEGRAL_TYPE_P (base_type
))
7801 /* Get the real bounds of the subtype. */
7802 if (lang_hooks
.types
.get_subrange_bounds
)
7803 lang_hooks
.types
.get_subrange_bounds (type
, &low
, &high
);
7806 low
= TYPE_MIN_VALUE (type
);
7807 high
= TYPE_MAX_VALUE (type
);
7810 /* If the type and its base type have the same representation and the same
7811 name, then the type is not a subrange but a copy of the base type. */
7812 if ((TREE_CODE (base_type
) == INTEGER_TYPE
7813 || TREE_CODE (base_type
) == BOOLEAN_TYPE
)
7814 && int_size_in_bytes (type
) == int_size_in_bytes (base_type
)
7815 && tree_int_cst_equal (low
, TYPE_MIN_VALUE (base_type
))
7816 && tree_int_cst_equal (high
, TYPE_MAX_VALUE (base_type
))
7817 && TYPE_IDENTIFIER (type
) == TYPE_IDENTIFIER (base_type
))
7827 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
7828 and number of elements specified by the range of values of INDEX_TYPE.
7829 If SHARED is true, reuse such a type that has already been constructed. */
7832 build_array_type_1 (tree elt_type
, tree index_type
, bool shared
)
7836 if (TREE_CODE (elt_type
) == FUNCTION_TYPE
)
7838 error ("arrays of functions are not meaningful");
7839 elt_type
= integer_type_node
;
7842 t
= make_node (ARRAY_TYPE
);
7843 TREE_TYPE (t
) = elt_type
;
7844 TYPE_DOMAIN (t
) = index_type
;
7845 TYPE_ADDR_SPACE (t
) = TYPE_ADDR_SPACE (elt_type
);
7848 /* If the element type is incomplete at this point we get marked for
7849 structural equality. Do not record these types in the canonical
7851 if (TYPE_STRUCTURAL_EQUALITY_P (t
))
7856 inchash::hash hstate
;
7857 hstate
.add_object (TYPE_HASH (elt_type
));
7859 hstate
.add_object (TYPE_HASH (index_type
));
7860 t
= type_hash_canon (hstate
.end (), t
);
7863 if (TYPE_CANONICAL (t
) == t
)
7865 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type
)
7866 || (index_type
&& TYPE_STRUCTURAL_EQUALITY_P (index_type
)))
7867 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7868 else if (TYPE_CANONICAL (elt_type
) != elt_type
7869 || (index_type
&& TYPE_CANONICAL (index_type
) != index_type
))
7871 = build_array_type_1 (TYPE_CANONICAL (elt_type
),
7873 ? TYPE_CANONICAL (index_type
) : NULL_TREE
,
7880 /* Wrapper around build_array_type_1 with SHARED set to true. */
7883 build_array_type (tree elt_type
, tree index_type
)
7885 return build_array_type_1 (elt_type
, index_type
, true);
7888 /* Wrapper around build_array_type_1 with SHARED set to false. */
7891 build_nonshared_array_type (tree elt_type
, tree index_type
)
7893 return build_array_type_1 (elt_type
, index_type
, false);
7896 /* Return a representation of ELT_TYPE[NELTS], using indices of type
7900 build_array_type_nelts (tree elt_type
, unsigned HOST_WIDE_INT nelts
)
7902 return build_array_type (elt_type
, build_index_type (size_int (nelts
- 1)));
7905 /* Recursively examines the array elements of TYPE, until a non-array
7906 element type is found. */
7909 strip_array_types (tree type
)
7911 while (TREE_CODE (type
) == ARRAY_TYPE
)
7912 type
= TREE_TYPE (type
);
7917 /* Computes the canonical argument types from the argument type list
7920 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
7921 on entry to this function, or if any of the ARGTYPES are
7924 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
7925 true on entry to this function, or if any of the ARGTYPES are
7928 Returns a canonical argument list, which may be ARGTYPES when the
7929 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
7930 true) or would not differ from ARGTYPES. */
7933 maybe_canonicalize_argtypes (tree argtypes
,
7934 bool *any_structural_p
,
7935 bool *any_noncanonical_p
)
7938 bool any_noncanonical_argtypes_p
= false;
7940 for (arg
= argtypes
; arg
&& !(*any_structural_p
); arg
= TREE_CHAIN (arg
))
7942 if (!TREE_VALUE (arg
) || TREE_VALUE (arg
) == error_mark_node
)
7943 /* Fail gracefully by stating that the type is structural. */
7944 *any_structural_p
= true;
7945 else if (TYPE_STRUCTURAL_EQUALITY_P (TREE_VALUE (arg
)))
7946 *any_structural_p
= true;
7947 else if (TYPE_CANONICAL (TREE_VALUE (arg
)) != TREE_VALUE (arg
)
7948 || TREE_PURPOSE (arg
))
7949 /* If the argument has a default argument, we consider it
7950 non-canonical even though the type itself is canonical.
7951 That way, different variants of function and method types
7952 with default arguments will all point to the variant with
7953 no defaults as their canonical type. */
7954 any_noncanonical_argtypes_p
= true;
7957 if (*any_structural_p
)
7960 if (any_noncanonical_argtypes_p
)
7962 /* Build the canonical list of argument types. */
7963 tree canon_argtypes
= NULL_TREE
;
7964 bool is_void
= false;
7966 for (arg
= argtypes
; arg
; arg
= TREE_CHAIN (arg
))
7968 if (arg
== void_list_node
)
7971 canon_argtypes
= tree_cons (NULL_TREE
,
7972 TYPE_CANONICAL (TREE_VALUE (arg
)),
7976 canon_argtypes
= nreverse (canon_argtypes
);
7978 canon_argtypes
= chainon (canon_argtypes
, void_list_node
);
7980 /* There is a non-canonical type. */
7981 *any_noncanonical_p
= true;
7982 return canon_argtypes
;
7985 /* The canonical argument types are the same as ARGTYPES. */
7989 /* Construct, lay out and return
7990 the type of functions returning type VALUE_TYPE
7991 given arguments of types ARG_TYPES.
7992 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
7993 are data type nodes for the arguments of the function.
7994 If such a type has already been constructed, reuse it. */
7997 build_function_type (tree value_type
, tree arg_types
)
8000 inchash::hash hstate
;
8001 bool any_structural_p
, any_noncanonical_p
;
8002 tree canon_argtypes
;
8004 if (TREE_CODE (value_type
) == FUNCTION_TYPE
)
8006 error ("function return type cannot be function");
8007 value_type
= integer_type_node
;
8010 /* Make a node of the sort we want. */
8011 t
= make_node (FUNCTION_TYPE
);
8012 TREE_TYPE (t
) = value_type
;
8013 TYPE_ARG_TYPES (t
) = arg_types
;
8015 /* If we already have such a type, use the old one. */
8016 hstate
.add_object (TYPE_HASH (value_type
));
8017 type_hash_list (arg_types
, hstate
);
8018 t
= type_hash_canon (hstate
.end (), t
);
8020 /* Set up the canonical type. */
8021 any_structural_p
= TYPE_STRUCTURAL_EQUALITY_P (value_type
);
8022 any_noncanonical_p
= TYPE_CANONICAL (value_type
) != value_type
;
8023 canon_argtypes
= maybe_canonicalize_argtypes (arg_types
,
8025 &any_noncanonical_p
);
8026 if (any_structural_p
)
8027 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8028 else if (any_noncanonical_p
)
8029 TYPE_CANONICAL (t
) = build_function_type (TYPE_CANONICAL (value_type
),
8032 if (!COMPLETE_TYPE_P (t
))
8037 /* Build a function type. The RETURN_TYPE is the type returned by the
8038 function. If VAARGS is set, no void_type_node is appended to the
8039 the list. ARGP must be always be terminated be a NULL_TREE. */
8042 build_function_type_list_1 (bool vaargs
, tree return_type
, va_list argp
)
8046 t
= va_arg (argp
, tree
);
8047 for (args
= NULL_TREE
; t
!= NULL_TREE
; t
= va_arg (argp
, tree
))
8048 args
= tree_cons (NULL_TREE
, t
, args
);
8053 if (args
!= NULL_TREE
)
8054 args
= nreverse (args
);
8055 gcc_assert (last
!= void_list_node
);
8057 else if (args
== NULL_TREE
)
8058 args
= void_list_node
;
8062 args
= nreverse (args
);
8063 TREE_CHAIN (last
) = void_list_node
;
8065 args
= build_function_type (return_type
, args
);
8070 /* Build a function type. The RETURN_TYPE is the type returned by the
8071 function. If additional arguments are provided, they are
8072 additional argument types. The list of argument types must always
8073 be terminated by NULL_TREE. */
8076 build_function_type_list (tree return_type
, ...)
8081 va_start (p
, return_type
);
8082 args
= build_function_type_list_1 (false, return_type
, p
);
8087 /* Build a variable argument function type. The RETURN_TYPE is the
8088 type returned by the function. If additional arguments are provided,
8089 they are additional argument types. The list of argument types must
8090 always be terminated by NULL_TREE. */
8093 build_varargs_function_type_list (tree return_type
, ...)
8098 va_start (p
, return_type
);
8099 args
= build_function_type_list_1 (true, return_type
, p
);
8105 /* Build a function type. RETURN_TYPE is the type returned by the
8106 function; VAARGS indicates whether the function takes varargs. The
8107 function takes N named arguments, the types of which are provided in
8111 build_function_type_array_1 (bool vaargs
, tree return_type
, int n
,
8115 tree t
= vaargs
? NULL_TREE
: void_list_node
;
8117 for (i
= n
- 1; i
>= 0; i
--)
8118 t
= tree_cons (NULL_TREE
, arg_types
[i
], t
);
8120 return build_function_type (return_type
, t
);
8123 /* Build a function type. RETURN_TYPE is the type returned by the
8124 function. The function takes N named arguments, the types of which
8125 are provided in ARG_TYPES. */
8128 build_function_type_array (tree return_type
, int n
, tree
*arg_types
)
8130 return build_function_type_array_1 (false, return_type
, n
, arg_types
);
8133 /* Build a variable argument function type. RETURN_TYPE is the type
8134 returned by the function. The function takes N named arguments, the
8135 types of which are provided in ARG_TYPES. */
8138 build_varargs_function_type_array (tree return_type
, int n
, tree
*arg_types
)
8140 return build_function_type_array_1 (true, return_type
, n
, arg_types
);
8143 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
8144 and ARGTYPES (a TREE_LIST) are the return type and arguments types
8145 for the method. An implicit additional parameter (of type
8146 pointer-to-BASETYPE) is added to the ARGTYPES. */
8149 build_method_type_directly (tree basetype
,
8155 inchash::hash hstate
;
8156 bool any_structural_p
, any_noncanonical_p
;
8157 tree canon_argtypes
;
8159 /* Make a node of the sort we want. */
8160 t
= make_node (METHOD_TYPE
);
8162 TYPE_METHOD_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
8163 TREE_TYPE (t
) = rettype
;
8164 ptype
= build_pointer_type (basetype
);
8166 /* The actual arglist for this function includes a "hidden" argument
8167 which is "this". Put it into the list of argument types. */
8168 argtypes
= tree_cons (NULL_TREE
, ptype
, argtypes
);
8169 TYPE_ARG_TYPES (t
) = argtypes
;
8171 /* If we already have such a type, use the old one. */
8172 hstate
.add_object (TYPE_HASH (basetype
));
8173 hstate
.add_object (TYPE_HASH (rettype
));
8174 type_hash_list (argtypes
, hstate
);
8175 t
= type_hash_canon (hstate
.end (), t
);
8177 /* Set up the canonical type. */
8179 = (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
8180 || TYPE_STRUCTURAL_EQUALITY_P (rettype
));
8182 = (TYPE_CANONICAL (basetype
) != basetype
8183 || TYPE_CANONICAL (rettype
) != rettype
);
8184 canon_argtypes
= maybe_canonicalize_argtypes (TREE_CHAIN (argtypes
),
8186 &any_noncanonical_p
);
8187 if (any_structural_p
)
8188 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8189 else if (any_noncanonical_p
)
8191 = build_method_type_directly (TYPE_CANONICAL (basetype
),
8192 TYPE_CANONICAL (rettype
),
8194 if (!COMPLETE_TYPE_P (t
))
8200 /* Construct, lay out and return the type of methods belonging to class
8201 BASETYPE and whose arguments and values are described by TYPE.
8202 If that type exists already, reuse it.
8203 TYPE must be a FUNCTION_TYPE node. */
8206 build_method_type (tree basetype
, tree type
)
8208 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
8210 return build_method_type_directly (basetype
,
8212 TYPE_ARG_TYPES (type
));
8215 /* Construct, lay out and return the type of offsets to a value
8216 of type TYPE, within an object of type BASETYPE.
8217 If a suitable offset type exists already, reuse it. */
8220 build_offset_type (tree basetype
, tree type
)
8223 inchash::hash hstate
;
8225 /* Make a node of the sort we want. */
8226 t
= make_node (OFFSET_TYPE
);
8228 TYPE_OFFSET_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
8229 TREE_TYPE (t
) = type
;
8231 /* If we already have such a type, use the old one. */
8232 hstate
.add_object (TYPE_HASH (basetype
));
8233 hstate
.add_object (TYPE_HASH (type
));
8234 t
= type_hash_canon (hstate
.end (), t
);
8236 if (!COMPLETE_TYPE_P (t
))
8239 if (TYPE_CANONICAL (t
) == t
)
8241 if (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
8242 || TYPE_STRUCTURAL_EQUALITY_P (type
))
8243 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8244 else if (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)) != basetype
8245 || TYPE_CANONICAL (type
) != type
)
8247 = build_offset_type (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)),
8248 TYPE_CANONICAL (type
));
8254 /* Create a complex type whose components are COMPONENT_TYPE. */
8257 build_complex_type (tree component_type
)
8260 inchash::hash hstate
;
8262 gcc_assert (INTEGRAL_TYPE_P (component_type
)
8263 || SCALAR_FLOAT_TYPE_P (component_type
)
8264 || FIXED_POINT_TYPE_P (component_type
));
8266 /* Make a node of the sort we want. */
8267 t
= make_node (COMPLEX_TYPE
);
8269 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (component_type
);
8271 /* If we already have such a type, use the old one. */
8272 hstate
.add_object (TYPE_HASH (component_type
));
8273 t
= type_hash_canon (hstate
.end (), t
);
8275 if (!COMPLETE_TYPE_P (t
))
8278 if (TYPE_CANONICAL (t
) == t
)
8280 if (TYPE_STRUCTURAL_EQUALITY_P (component_type
))
8281 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8282 else if (TYPE_CANONICAL (component_type
) != component_type
)
8284 = build_complex_type (TYPE_CANONICAL (component_type
));
8287 /* We need to create a name, since complex is a fundamental type. */
8288 if (! TYPE_NAME (t
))
8291 if (component_type
== char_type_node
)
8292 name
= "complex char";
8293 else if (component_type
== signed_char_type_node
)
8294 name
= "complex signed char";
8295 else if (component_type
== unsigned_char_type_node
)
8296 name
= "complex unsigned char";
8297 else if (component_type
== short_integer_type_node
)
8298 name
= "complex short int";
8299 else if (component_type
== short_unsigned_type_node
)
8300 name
= "complex short unsigned int";
8301 else if (component_type
== integer_type_node
)
8302 name
= "complex int";
8303 else if (component_type
== unsigned_type_node
)
8304 name
= "complex unsigned int";
8305 else if (component_type
== long_integer_type_node
)
8306 name
= "complex long int";
8307 else if (component_type
== long_unsigned_type_node
)
8308 name
= "complex long unsigned int";
8309 else if (component_type
== long_long_integer_type_node
)
8310 name
= "complex long long int";
8311 else if (component_type
== long_long_unsigned_type_node
)
8312 name
= "complex long long unsigned int";
8317 TYPE_NAME (t
) = build_decl (UNKNOWN_LOCATION
, TYPE_DECL
,
8318 get_identifier (name
), t
);
8321 return build_qualified_type (t
, TYPE_QUALS (component_type
));
8324 /* If TYPE is a real or complex floating-point type and the target
8325 does not directly support arithmetic on TYPE then return the wider
8326 type to be used for arithmetic on TYPE. Otherwise, return
8330 excess_precision_type (tree type
)
8332 if (flag_excess_precision
!= EXCESS_PRECISION_FAST
)
8334 int flt_eval_method
= TARGET_FLT_EVAL_METHOD
;
8335 switch (TREE_CODE (type
))
8338 switch (flt_eval_method
)
8341 if (TYPE_MODE (type
) == TYPE_MODE (float_type_node
))
8342 return double_type_node
;
8345 if (TYPE_MODE (type
) == TYPE_MODE (float_type_node
)
8346 || TYPE_MODE (type
) == TYPE_MODE (double_type_node
))
8347 return long_double_type_node
;
8354 if (TREE_CODE (TREE_TYPE (type
)) != REAL_TYPE
)
8356 switch (flt_eval_method
)
8359 if (TYPE_MODE (TREE_TYPE (type
)) == TYPE_MODE (float_type_node
))
8360 return complex_double_type_node
;
8363 if (TYPE_MODE (TREE_TYPE (type
)) == TYPE_MODE (float_type_node
)
8364 || (TYPE_MODE (TREE_TYPE (type
))
8365 == TYPE_MODE (double_type_node
)))
8366 return complex_long_double_type_node
;
8379 /* Return OP, stripped of any conversions to wider types as much as is safe.
8380 Converting the value back to OP's type makes a value equivalent to OP.
8382 If FOR_TYPE is nonzero, we return a value which, if converted to
8383 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
8385 OP must have integer, real or enumeral type. Pointers are not allowed!
8387 There are some cases where the obvious value we could return
8388 would regenerate to OP if converted to OP's type,
8389 but would not extend like OP to wider types.
8390 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
8391 For example, if OP is (unsigned short)(signed char)-1,
8392 we avoid returning (signed char)-1 if FOR_TYPE is int,
8393 even though extending that to an unsigned short would regenerate OP,
8394 since the result of extending (signed char)-1 to (int)
8395 is different from (int) OP. */
8398 get_unwidened (tree op
, tree for_type
)
8400 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
8401 tree type
= TREE_TYPE (op
);
8403 = TYPE_PRECISION (for_type
!= 0 ? for_type
: type
);
8405 = (for_type
!= 0 && for_type
!= type
8406 && final_prec
> TYPE_PRECISION (type
)
8407 && TYPE_UNSIGNED (type
));
8410 while (CONVERT_EXPR_P (op
))
8414 /* TYPE_PRECISION on vector types has different meaning
8415 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
8416 so avoid them here. */
8417 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op
, 0))) == VECTOR_TYPE
)
8420 bitschange
= TYPE_PRECISION (TREE_TYPE (op
))
8421 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0)));
8423 /* Truncations are many-one so cannot be removed.
8424 Unless we are later going to truncate down even farther. */
8426 && final_prec
> TYPE_PRECISION (TREE_TYPE (op
)))
8429 /* See what's inside this conversion. If we decide to strip it,
8431 op
= TREE_OPERAND (op
, 0);
8433 /* If we have not stripped any zero-extensions (uns is 0),
8434 we can strip any kind of extension.
8435 If we have previously stripped a zero-extension,
8436 only zero-extensions can safely be stripped.
8437 Any extension can be stripped if the bits it would produce
8438 are all going to be discarded later by truncating to FOR_TYPE. */
8442 if (! uns
|| final_prec
<= TYPE_PRECISION (TREE_TYPE (op
)))
8444 /* TYPE_UNSIGNED says whether this is a zero-extension.
8445 Let's avoid computing it if it does not affect WIN
8446 and if UNS will not be needed again. */
8448 || CONVERT_EXPR_P (op
))
8449 && TYPE_UNSIGNED (TREE_TYPE (op
)))
8457 /* If we finally reach a constant see if it fits in for_type and
8458 in that case convert it. */
8460 && TREE_CODE (win
) == INTEGER_CST
8461 && TREE_TYPE (win
) != for_type
8462 && int_fits_type_p (win
, for_type
))
8463 win
= fold_convert (for_type
, win
);
8468 /* Return OP or a simpler expression for a narrower value
8469 which can be sign-extended or zero-extended to give back OP.
8470 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
8471 or 0 if the value should be sign-extended. */
8474 get_narrower (tree op
, int *unsignedp_ptr
)
8479 bool integral_p
= INTEGRAL_TYPE_P (TREE_TYPE (op
));
8481 while (TREE_CODE (op
) == NOP_EXPR
)
8484 = (TYPE_PRECISION (TREE_TYPE (op
))
8485 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0))));
8487 /* Truncations are many-one so cannot be removed. */
8491 /* See what's inside this conversion. If we decide to strip it,
8496 op
= TREE_OPERAND (op
, 0);
8497 /* An extension: the outermost one can be stripped,
8498 but remember whether it is zero or sign extension. */
8500 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
8501 /* Otherwise, if a sign extension has been stripped,
8502 only sign extensions can now be stripped;
8503 if a zero extension has been stripped, only zero-extensions. */
8504 else if (uns
!= TYPE_UNSIGNED (TREE_TYPE (op
)))
8508 else /* bitschange == 0 */
8510 /* A change in nominal type can always be stripped, but we must
8511 preserve the unsignedness. */
8513 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
8515 op
= TREE_OPERAND (op
, 0);
8516 /* Keep trying to narrow, but don't assign op to win if it
8517 would turn an integral type into something else. */
8518 if (INTEGRAL_TYPE_P (TREE_TYPE (op
)) != integral_p
)
8525 if (TREE_CODE (op
) == COMPONENT_REF
8526 /* Since type_for_size always gives an integer type. */
8527 && TREE_CODE (TREE_TYPE (op
)) != REAL_TYPE
8528 && TREE_CODE (TREE_TYPE (op
)) != FIXED_POINT_TYPE
8529 /* Ensure field is laid out already. */
8530 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0
8531 && tree_fits_uhwi_p (DECL_SIZE (TREE_OPERAND (op
, 1))))
8533 unsigned HOST_WIDE_INT innerprec
8534 = tree_to_uhwi (DECL_SIZE (TREE_OPERAND (op
, 1)));
8535 int unsignedp
= (DECL_UNSIGNED (TREE_OPERAND (op
, 1))
8536 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op
, 1))));
8537 tree type
= lang_hooks
.types
.type_for_size (innerprec
, unsignedp
);
8539 /* We can get this structure field in a narrower type that fits it,
8540 but the resulting extension to its nominal type (a fullword type)
8541 must satisfy the same conditions as for other extensions.
8543 Do this only for fields that are aligned (not bit-fields),
8544 because when bit-field insns will be used there is no
8545 advantage in doing this. */
8547 if (innerprec
< TYPE_PRECISION (TREE_TYPE (op
))
8548 && ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1))
8549 && (first
|| uns
== DECL_UNSIGNED (TREE_OPERAND (op
, 1)))
8553 uns
= DECL_UNSIGNED (TREE_OPERAND (op
, 1));
8554 win
= fold_convert (type
, op
);
8558 *unsignedp_ptr
= uns
;
8562 /* Returns true if integer constant C has a value that is permissible
8563 for type TYPE (an INTEGER_TYPE). */
8566 int_fits_type_p (const_tree c
, const_tree type
)
8568 tree type_low_bound
, type_high_bound
;
8569 bool ok_for_low_bound
, ok_for_high_bound
;
8570 signop sgn_c
= TYPE_SIGN (TREE_TYPE (c
));
8573 type_low_bound
= TYPE_MIN_VALUE (type
);
8574 type_high_bound
= TYPE_MAX_VALUE (type
);
8576 /* If at least one bound of the type is a constant integer, we can check
8577 ourselves and maybe make a decision. If no such decision is possible, but
8578 this type is a subtype, try checking against that. Otherwise, use
8579 fits_to_tree_p, which checks against the precision.
8581 Compute the status for each possibly constant bound, and return if we see
8582 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
8583 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
8584 for "constant known to fit". */
8586 /* Check if c >= type_low_bound. */
8587 if (type_low_bound
&& TREE_CODE (type_low_bound
) == INTEGER_CST
)
8589 if (tree_int_cst_lt (c
, type_low_bound
))
8591 ok_for_low_bound
= true;
8594 ok_for_low_bound
= false;
8596 /* Check if c <= type_high_bound. */
8597 if (type_high_bound
&& TREE_CODE (type_high_bound
) == INTEGER_CST
)
8599 if (tree_int_cst_lt (type_high_bound
, c
))
8601 ok_for_high_bound
= true;
8604 ok_for_high_bound
= false;
8606 /* If the constant fits both bounds, the result is known. */
8607 if (ok_for_low_bound
&& ok_for_high_bound
)
8610 /* Perform some generic filtering which may allow making a decision
8611 even if the bounds are not constant. First, negative integers
8612 never fit in unsigned types, */
8613 if (TYPE_UNSIGNED (type
) && sgn_c
== SIGNED
&& wi::neg_p (c
))
8616 /* Second, narrower types always fit in wider ones. */
8617 if (TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (c
)))
8620 /* Third, unsigned integers with top bit set never fit signed types. */
8621 if (!TYPE_UNSIGNED (type
) && sgn_c
== UNSIGNED
)
8623 int prec
= GET_MODE_PRECISION (TYPE_MODE (TREE_TYPE (c
))) - 1;
8624 if (prec
< TYPE_PRECISION (TREE_TYPE (c
)))
8626 /* When a tree_cst is converted to a wide-int, the precision
8627 is taken from the type. However, if the precision of the
8628 mode underneath the type is smaller than that, it is
8629 possible that the value will not fit. The test below
8630 fails if any bit is set between the sign bit of the
8631 underlying mode and the top bit of the type. */
8632 if (wi::ne_p (wi::zext (c
, prec
- 1), c
))
8635 else if (wi::neg_p (c
))
8639 /* If we haven't been able to decide at this point, there nothing more we
8640 can check ourselves here. Look at the base type if we have one and it
8641 has the same precision. */
8642 if (TREE_CODE (type
) == INTEGER_TYPE
8643 && TREE_TYPE (type
) != 0
8644 && TYPE_PRECISION (type
) == TYPE_PRECISION (TREE_TYPE (type
)))
8646 type
= TREE_TYPE (type
);
8650 /* Or to fits_to_tree_p, if nothing else. */
8651 return wi::fits_to_tree_p (c
, type
);
8654 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
8655 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
8656 represented (assuming two's-complement arithmetic) within the bit
8657 precision of the type are returned instead. */
8660 get_type_static_bounds (const_tree type
, mpz_t min
, mpz_t max
)
8662 if (!POINTER_TYPE_P (type
) && TYPE_MIN_VALUE (type
)
8663 && TREE_CODE (TYPE_MIN_VALUE (type
)) == INTEGER_CST
)
8664 wi::to_mpz (TYPE_MIN_VALUE (type
), min
, TYPE_SIGN (type
));
8667 if (TYPE_UNSIGNED (type
))
8668 mpz_set_ui (min
, 0);
8671 wide_int mn
= wi::min_value (TYPE_PRECISION (type
), SIGNED
);
8672 wi::to_mpz (mn
, min
, SIGNED
);
8676 if (!POINTER_TYPE_P (type
) && TYPE_MAX_VALUE (type
)
8677 && TREE_CODE (TYPE_MAX_VALUE (type
)) == INTEGER_CST
)
8678 wi::to_mpz (TYPE_MAX_VALUE (type
), max
, TYPE_SIGN (type
));
8681 wide_int mn
= wi::max_value (TYPE_PRECISION (type
), TYPE_SIGN (type
));
8682 wi::to_mpz (mn
, max
, TYPE_SIGN (type
));
8686 /* Return true if VAR is an automatic variable defined in function FN. */
8689 auto_var_in_fn_p (const_tree var
, const_tree fn
)
8691 return (DECL_P (var
) && DECL_CONTEXT (var
) == fn
8692 && ((((TREE_CODE (var
) == VAR_DECL
&& ! DECL_EXTERNAL (var
))
8693 || TREE_CODE (var
) == PARM_DECL
)
8694 && ! TREE_STATIC (var
))
8695 || TREE_CODE (var
) == LABEL_DECL
8696 || TREE_CODE (var
) == RESULT_DECL
));
8699 /* Subprogram of following function. Called by walk_tree.
8701 Return *TP if it is an automatic variable or parameter of the
8702 function passed in as DATA. */
8705 find_var_from_fn (tree
*tp
, int *walk_subtrees
, void *data
)
8707 tree fn
= (tree
) data
;
8712 else if (DECL_P (*tp
)
8713 && auto_var_in_fn_p (*tp
, fn
))
8719 /* Returns true if T is, contains, or refers to a type with variable
8720 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
8721 arguments, but not the return type. If FN is nonzero, only return
8722 true if a modifier of the type or position of FN is a variable or
8723 parameter inside FN.
8725 This concept is more general than that of C99 'variably modified types':
8726 in C99, a struct type is never variably modified because a VLA may not
8727 appear as a structure member. However, in GNU C code like:
8729 struct S { int i[f()]; };
8731 is valid, and other languages may define similar constructs. */
8734 variably_modified_type_p (tree type
, tree fn
)
8738 /* Test if T is either variable (if FN is zero) or an expression containing
8739 a variable in FN. If TYPE isn't gimplified, return true also if
8740 gimplify_one_sizepos would gimplify the expression into a local
8742 #define RETURN_TRUE_IF_VAR(T) \
8743 do { tree _t = (T); \
8744 if (_t != NULL_TREE \
8745 && _t != error_mark_node \
8746 && TREE_CODE (_t) != INTEGER_CST \
8747 && TREE_CODE (_t) != PLACEHOLDER_EXPR \
8749 || (!TYPE_SIZES_GIMPLIFIED (type) \
8750 && !is_gimple_sizepos (_t)) \
8751 || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
8752 return true; } while (0)
8754 if (type
== error_mark_node
)
8757 /* If TYPE itself has variable size, it is variably modified. */
8758 RETURN_TRUE_IF_VAR (TYPE_SIZE (type
));
8759 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type
));
8761 switch (TREE_CODE (type
))
8764 case REFERENCE_TYPE
:
8766 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
8772 /* If TYPE is a function type, it is variably modified if the
8773 return type is variably modified. */
8774 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
8780 case FIXED_POINT_TYPE
:
8783 /* Scalar types are variably modified if their end points
8785 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type
));
8786 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type
));
8791 case QUAL_UNION_TYPE
:
8792 /* We can't see if any of the fields are variably-modified by the
8793 definition we normally use, since that would produce infinite
8794 recursion via pointers. */
8795 /* This is variably modified if some field's type is. */
8796 for (t
= TYPE_FIELDS (type
); t
; t
= DECL_CHAIN (t
))
8797 if (TREE_CODE (t
) == FIELD_DECL
)
8799 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t
));
8800 RETURN_TRUE_IF_VAR (DECL_SIZE (t
));
8801 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t
));
8803 if (TREE_CODE (type
) == QUAL_UNION_TYPE
)
8804 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t
));
8809 /* Do not call ourselves to avoid infinite recursion. This is
8810 variably modified if the element type is. */
8811 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type
)));
8812 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type
)));
8819 /* The current language may have other cases to check, but in general,
8820 all other types are not variably modified. */
8821 return lang_hooks
.tree_inlining
.var_mod_type_p (type
, fn
);
8823 #undef RETURN_TRUE_IF_VAR
8826 /* Given a DECL or TYPE, return the scope in which it was declared, or
8827 NULL_TREE if there is no containing scope. */
8830 get_containing_scope (const_tree t
)
8832 return (TYPE_P (t
) ? TYPE_CONTEXT (t
) : DECL_CONTEXT (t
));
8835 /* Return the innermost context enclosing DECL that is
8836 a FUNCTION_DECL, or zero if none. */
8839 decl_function_context (const_tree decl
)
8843 if (TREE_CODE (decl
) == ERROR_MARK
)
8846 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
8847 where we look up the function at runtime. Such functions always take
8848 a first argument of type 'pointer to real context'.
8850 C++ should really be fixed to use DECL_CONTEXT for the real context,
8851 and use something else for the "virtual context". */
8852 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VINDEX (decl
))
8855 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl
)))));
8857 context
= DECL_CONTEXT (decl
);
8859 while (context
&& TREE_CODE (context
) != FUNCTION_DECL
)
8861 if (TREE_CODE (context
) == BLOCK
)
8862 context
= BLOCK_SUPERCONTEXT (context
);
8864 context
= get_containing_scope (context
);
8870 /* Return the innermost context enclosing DECL that is
8871 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
8872 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
8875 decl_type_context (const_tree decl
)
8877 tree context
= DECL_CONTEXT (decl
);
8880 switch (TREE_CODE (context
))
8882 case NAMESPACE_DECL
:
8883 case TRANSLATION_UNIT_DECL
:
8888 case QUAL_UNION_TYPE
:
8893 context
= DECL_CONTEXT (context
);
8897 context
= BLOCK_SUPERCONTEXT (context
);
8907 /* CALL is a CALL_EXPR. Return the declaration for the function
8908 called, or NULL_TREE if the called function cannot be
8912 get_callee_fndecl (const_tree call
)
8916 if (call
== error_mark_node
)
8917 return error_mark_node
;
8919 /* It's invalid to call this function with anything but a
8921 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
8923 /* The first operand to the CALL is the address of the function
8925 addr
= CALL_EXPR_FN (call
);
8927 /* If there is no function, return early. */
8928 if (addr
== NULL_TREE
)
8933 /* If this is a readonly function pointer, extract its initial value. */
8934 if (DECL_P (addr
) && TREE_CODE (addr
) != FUNCTION_DECL
8935 && TREE_READONLY (addr
) && ! TREE_THIS_VOLATILE (addr
)
8936 && DECL_INITIAL (addr
))
8937 addr
= DECL_INITIAL (addr
);
8939 /* If the address is just `&f' for some function `f', then we know
8940 that `f' is being called. */
8941 if (TREE_CODE (addr
) == ADDR_EXPR
8942 && TREE_CODE (TREE_OPERAND (addr
, 0)) == FUNCTION_DECL
)
8943 return TREE_OPERAND (addr
, 0);
8945 /* We couldn't figure out what was being called. */
8949 /* Print debugging information about tree nodes generated during the compile,
8950 and any language-specific information. */
8953 dump_tree_statistics (void)
8955 if (GATHER_STATISTICS
)
8958 int total_nodes
, total_bytes
;
8959 fprintf (stderr
, "Kind Nodes Bytes\n");
8960 fprintf (stderr
, "---------------------------------------\n");
8961 total_nodes
= total_bytes
= 0;
8962 for (i
= 0; i
< (int) all_kinds
; i
++)
8964 fprintf (stderr
, "%-20s %7d %10d\n", tree_node_kind_names
[i
],
8965 tree_node_counts
[i
], tree_node_sizes
[i
]);
8966 total_nodes
+= tree_node_counts
[i
];
8967 total_bytes
+= tree_node_sizes
[i
];
8969 fprintf (stderr
, "---------------------------------------\n");
8970 fprintf (stderr
, "%-20s %7d %10d\n", "Total", total_nodes
, total_bytes
);
8971 fprintf (stderr
, "---------------------------------------\n");
8972 fprintf (stderr
, "Code Nodes\n");
8973 fprintf (stderr
, "----------------------------\n");
8974 for (i
= 0; i
< (int) MAX_TREE_CODES
; i
++)
8975 fprintf (stderr
, "%-20s %7d\n", get_tree_code_name ((enum tree_code
) i
),
8976 tree_code_counts
[i
]);
8977 fprintf (stderr
, "----------------------------\n");
8978 ssanames_print_statistics ();
8979 phinodes_print_statistics ();
8982 fprintf (stderr
, "(No per-node statistics)\n");
8984 print_type_hash_statistics ();
8985 print_debug_expr_statistics ();
8986 print_value_expr_statistics ();
8987 lang_hooks
.print_statistics ();
8990 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
8992 /* Generate a crc32 of a byte. */
8995 crc32_unsigned_bits (unsigned chksum
, unsigned value
, unsigned bits
)
8999 for (ix
= bits
; ix
--; value
<<= 1)
9003 feedback
= (value
^ chksum
) & 0x80000000 ? 0x04c11db7 : 0;
9010 /* Generate a crc32 of a 32-bit unsigned. */
9013 crc32_unsigned (unsigned chksum
, unsigned value
)
9015 return crc32_unsigned_bits (chksum
, value
, 32);
9018 /* Generate a crc32 of a byte. */
9021 crc32_byte (unsigned chksum
, char byte
)
9023 return crc32_unsigned_bits (chksum
, (unsigned) byte
<< 24, 8);
9026 /* Generate a crc32 of a string. */
9029 crc32_string (unsigned chksum
, const char *string
)
9033 chksum
= crc32_byte (chksum
, *string
);
9039 /* P is a string that will be used in a symbol. Mask out any characters
9040 that are not valid in that context. */
9043 clean_symbol_name (char *p
)
9047 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
9050 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
9057 /* Generate a name for a special-purpose function.
9058 The generated name may need to be unique across the whole link.
9059 Changes to this function may also require corresponding changes to
9060 xstrdup_mask_random.
9061 TYPE is some string to identify the purpose of this function to the
9062 linker or collect2; it must start with an uppercase letter,
9064 I - for constructors
9066 N - for C++ anonymous namespaces
9067 F - for DWARF unwind frame information. */
9070 get_file_function_name (const char *type
)
9076 /* If we already have a name we know to be unique, just use that. */
9077 if (first_global_object_name
)
9078 p
= q
= ASTRDUP (first_global_object_name
);
9079 /* If the target is handling the constructors/destructors, they
9080 will be local to this file and the name is only necessary for
9082 We also assign sub_I and sub_D sufixes to constructors called from
9083 the global static constructors. These are always local. */
9084 else if (((type
[0] == 'I' || type
[0] == 'D') && targetm
.have_ctors_dtors
)
9085 || (strncmp (type
, "sub_", 4) == 0
9086 && (type
[4] == 'I' || type
[4] == 'D')))
9088 const char *file
= main_input_filename
;
9090 file
= LOCATION_FILE (input_location
);
9091 /* Just use the file's basename, because the full pathname
9092 might be quite long. */
9093 p
= q
= ASTRDUP (lbasename (file
));
9097 /* Otherwise, the name must be unique across the entire link.
9098 We don't have anything that we know to be unique to this translation
9099 unit, so use what we do have and throw in some randomness. */
9101 const char *name
= weak_global_object_name
;
9102 const char *file
= main_input_filename
;
9107 file
= LOCATION_FILE (input_location
);
9109 len
= strlen (file
);
9110 q
= (char *) alloca (9 + 17 + len
+ 1);
9111 memcpy (q
, file
, len
+ 1);
9113 snprintf (q
+ len
, 9 + 17 + 1, "_%08X_" HOST_WIDE_INT_PRINT_HEX
,
9114 crc32_string (0, name
), get_random_seed (false));
9119 clean_symbol_name (q
);
9120 buf
= (char *) alloca (sizeof (FILE_FUNCTION_FORMAT
) + strlen (p
)
9123 /* Set up the name of the file-level functions we may need.
9124 Use a global object (which is already required to be unique over
9125 the program) rather than the file name (which imposes extra
9127 sprintf (buf
, FILE_FUNCTION_FORMAT
, type
, p
);
9129 return get_identifier (buf
);
9132 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
9134 /* Complain that the tree code of NODE does not match the expected 0
9135 terminated list of trailing codes. The trailing code list can be
9136 empty, for a more vague error message. FILE, LINE, and FUNCTION
9137 are of the caller. */
9140 tree_check_failed (const_tree node
, const char *file
,
9141 int line
, const char *function
, ...)
9145 unsigned length
= 0;
9146 enum tree_code code
;
9148 va_start (args
, function
);
9149 while ((code
= (enum tree_code
) va_arg (args
, int)))
9150 length
+= 4 + strlen (get_tree_code_name (code
));
9155 va_start (args
, function
);
9156 length
+= strlen ("expected ");
9157 buffer
= tmp
= (char *) alloca (length
);
9159 while ((code
= (enum tree_code
) va_arg (args
, int)))
9161 const char *prefix
= length
? " or " : "expected ";
9163 strcpy (tmp
+ length
, prefix
);
9164 length
+= strlen (prefix
);
9165 strcpy (tmp
+ length
, get_tree_code_name (code
));
9166 length
+= strlen (get_tree_code_name (code
));
9171 buffer
= "unexpected node";
9173 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9174 buffer
, get_tree_code_name (TREE_CODE (node
)),
9175 function
, trim_filename (file
), line
);
9178 /* Complain that the tree code of NODE does match the expected 0
9179 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
9183 tree_not_check_failed (const_tree node
, const char *file
,
9184 int line
, const char *function
, ...)
9188 unsigned length
= 0;
9189 enum tree_code code
;
9191 va_start (args
, function
);
9192 while ((code
= (enum tree_code
) va_arg (args
, int)))
9193 length
+= 4 + strlen (get_tree_code_name (code
));
9195 va_start (args
, function
);
9196 buffer
= (char *) alloca (length
);
9198 while ((code
= (enum tree_code
) va_arg (args
, int)))
9202 strcpy (buffer
+ length
, " or ");
9205 strcpy (buffer
+ length
, get_tree_code_name (code
));
9206 length
+= strlen (get_tree_code_name (code
));
9210 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
9211 buffer
, get_tree_code_name (TREE_CODE (node
)),
9212 function
, trim_filename (file
), line
);
9215 /* Similar to tree_check_failed, except that we check for a class of tree
9216 code, given in CL. */
9219 tree_class_check_failed (const_tree node
, const enum tree_code_class cl
,
9220 const char *file
, int line
, const char *function
)
9223 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
9224 TREE_CODE_CLASS_STRING (cl
),
9225 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
9226 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9229 /* Similar to tree_check_failed, except that instead of specifying a
9230 dozen codes, use the knowledge that they're all sequential. */
9233 tree_range_check_failed (const_tree node
, const char *file
, int line
,
9234 const char *function
, enum tree_code c1
,
9238 unsigned length
= 0;
9241 for (c
= c1
; c
<= c2
; ++c
)
9242 length
+= 4 + strlen (get_tree_code_name ((enum tree_code
) c
));
9244 length
+= strlen ("expected ");
9245 buffer
= (char *) alloca (length
);
9248 for (c
= c1
; c
<= c2
; ++c
)
9250 const char *prefix
= length
? " or " : "expected ";
9252 strcpy (buffer
+ length
, prefix
);
9253 length
+= strlen (prefix
);
9254 strcpy (buffer
+ length
, get_tree_code_name ((enum tree_code
) c
));
9255 length
+= strlen (get_tree_code_name ((enum tree_code
) c
));
9258 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9259 buffer
, get_tree_code_name (TREE_CODE (node
)),
9260 function
, trim_filename (file
), line
);
9264 /* Similar to tree_check_failed, except that we check that a tree does
9265 not have the specified code, given in CL. */
9268 tree_not_class_check_failed (const_tree node
, const enum tree_code_class cl
,
9269 const char *file
, int line
, const char *function
)
9272 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
9273 TREE_CODE_CLASS_STRING (cl
),
9274 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
9275 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9279 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
9282 omp_clause_check_failed (const_tree node
, const char *file
, int line
,
9283 const char *function
, enum omp_clause_code code
)
9285 internal_error ("tree check: expected omp_clause %s, have %s in %s, at %s:%d",
9286 omp_clause_code_name
[code
], get_tree_code_name (TREE_CODE (node
)),
9287 function
, trim_filename (file
), line
);
9291 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
9294 omp_clause_range_check_failed (const_tree node
, const char *file
, int line
,
9295 const char *function
, enum omp_clause_code c1
,
9296 enum omp_clause_code c2
)
9299 unsigned length
= 0;
9302 for (c
= c1
; c
<= c2
; ++c
)
9303 length
+= 4 + strlen (omp_clause_code_name
[c
]);
9305 length
+= strlen ("expected ");
9306 buffer
= (char *) alloca (length
);
9309 for (c
= c1
; c
<= c2
; ++c
)
9311 const char *prefix
= length
? " or " : "expected ";
9313 strcpy (buffer
+ length
, prefix
);
9314 length
+= strlen (prefix
);
9315 strcpy (buffer
+ length
, omp_clause_code_name
[c
]);
9316 length
+= strlen (omp_clause_code_name
[c
]);
9319 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9320 buffer
, omp_clause_code_name
[TREE_CODE (node
)],
9321 function
, trim_filename (file
), line
);
9325 #undef DEFTREESTRUCT
9326 #define DEFTREESTRUCT(VAL, NAME) NAME,
9328 static const char *ts_enum_names
[] = {
9329 #include "treestruct.def"
9331 #undef DEFTREESTRUCT
9333 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
9335 /* Similar to tree_class_check_failed, except that we check for
9336 whether CODE contains the tree structure identified by EN. */
9339 tree_contains_struct_check_failed (const_tree node
,
9340 const enum tree_node_structure_enum en
,
9341 const char *file
, int line
,
9342 const char *function
)
9345 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
9347 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9351 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9352 (dynamically sized) vector. */
9355 tree_int_cst_elt_check_failed (int idx
, int len
, const char *file
, int line
,
9356 const char *function
)
9359 ("tree check: accessed elt %d of tree_int_cst with %d elts in %s, at %s:%d",
9360 idx
+ 1, len
, function
, trim_filename (file
), line
);
9363 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9364 (dynamically sized) vector. */
9367 tree_vec_elt_check_failed (int idx
, int len
, const char *file
, int line
,
9368 const char *function
)
9371 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
9372 idx
+ 1, len
, function
, trim_filename (file
), line
);
9375 /* Similar to above, except that the check is for the bounds of the operand
9376 vector of an expression node EXP. */
9379 tree_operand_check_failed (int idx
, const_tree exp
, const char *file
,
9380 int line
, const char *function
)
9382 enum tree_code code
= TREE_CODE (exp
);
9384 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
9385 idx
+ 1, get_tree_code_name (code
), TREE_OPERAND_LENGTH (exp
),
9386 function
, trim_filename (file
), line
);
9389 /* Similar to above, except that the check is for the number of
9390 operands of an OMP_CLAUSE node. */
9393 omp_clause_operand_check_failed (int idx
, const_tree t
, const char *file
,
9394 int line
, const char *function
)
9397 ("tree check: accessed operand %d of omp_clause %s with %d operands "
9398 "in %s, at %s:%d", idx
+ 1, omp_clause_code_name
[OMP_CLAUSE_CODE (t
)],
9399 omp_clause_num_ops
[OMP_CLAUSE_CODE (t
)], function
,
9400 trim_filename (file
), line
);
9402 #endif /* ENABLE_TREE_CHECKING */
9404 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
9405 and mapped to the machine mode MODE. Initialize its fields and build
9406 the information necessary for debugging output. */
9409 make_vector_type (tree innertype
, int nunits
, enum machine_mode mode
)
9412 inchash::hash hstate
;
9414 t
= make_node (VECTOR_TYPE
);
9415 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (innertype
);
9416 SET_TYPE_VECTOR_SUBPARTS (t
, nunits
);
9417 SET_TYPE_MODE (t
, mode
);
9419 if (TYPE_STRUCTURAL_EQUALITY_P (innertype
))
9420 SET_TYPE_STRUCTURAL_EQUALITY (t
);
9421 else if (TYPE_CANONICAL (innertype
) != innertype
9422 || mode
!= VOIDmode
)
9424 = make_vector_type (TYPE_CANONICAL (innertype
), nunits
, VOIDmode
);
9428 hstate
.add_wide_int (VECTOR_TYPE
);
9429 hstate
.add_wide_int (nunits
);
9430 hstate
.add_wide_int (mode
);
9431 hstate
.add_object (TYPE_HASH (TREE_TYPE (t
)));
9432 t
= type_hash_canon (hstate
.end (), t
);
9434 /* We have built a main variant, based on the main variant of the
9435 inner type. Use it to build the variant we return. */
9436 if ((TYPE_ATTRIBUTES (innertype
) || TYPE_QUALS (innertype
))
9437 && TREE_TYPE (t
) != innertype
)
9438 return build_type_attribute_qual_variant (t
,
9439 TYPE_ATTRIBUTES (innertype
),
9440 TYPE_QUALS (innertype
));
9446 make_or_reuse_type (unsigned size
, int unsignedp
)
9448 if (size
== INT_TYPE_SIZE
)
9449 return unsignedp
? unsigned_type_node
: integer_type_node
;
9450 if (size
== CHAR_TYPE_SIZE
)
9451 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
9452 if (size
== SHORT_TYPE_SIZE
)
9453 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
9454 if (size
== LONG_TYPE_SIZE
)
9455 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
9456 if (size
== LONG_LONG_TYPE_SIZE
)
9457 return (unsignedp
? long_long_unsigned_type_node
9458 : long_long_integer_type_node
);
9459 if (size
== 128 && int128_integer_type_node
)
9460 return (unsignedp
? int128_unsigned_type_node
9461 : int128_integer_type_node
);
9464 return make_unsigned_type (size
);
9466 return make_signed_type (size
);
9469 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
9472 make_or_reuse_fract_type (unsigned size
, int unsignedp
, int satp
)
9476 if (size
== SHORT_FRACT_TYPE_SIZE
)
9477 return unsignedp
? sat_unsigned_short_fract_type_node
9478 : sat_short_fract_type_node
;
9479 if (size
== FRACT_TYPE_SIZE
)
9480 return unsignedp
? sat_unsigned_fract_type_node
: sat_fract_type_node
;
9481 if (size
== LONG_FRACT_TYPE_SIZE
)
9482 return unsignedp
? sat_unsigned_long_fract_type_node
9483 : sat_long_fract_type_node
;
9484 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
9485 return unsignedp
? sat_unsigned_long_long_fract_type_node
9486 : sat_long_long_fract_type_node
;
9490 if (size
== SHORT_FRACT_TYPE_SIZE
)
9491 return unsignedp
? unsigned_short_fract_type_node
9492 : short_fract_type_node
;
9493 if (size
== FRACT_TYPE_SIZE
)
9494 return unsignedp
? unsigned_fract_type_node
: fract_type_node
;
9495 if (size
== LONG_FRACT_TYPE_SIZE
)
9496 return unsignedp
? unsigned_long_fract_type_node
9497 : long_fract_type_node
;
9498 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
9499 return unsignedp
? unsigned_long_long_fract_type_node
9500 : long_long_fract_type_node
;
9503 return make_fract_type (size
, unsignedp
, satp
);
9506 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
9509 make_or_reuse_accum_type (unsigned size
, int unsignedp
, int satp
)
9513 if (size
== SHORT_ACCUM_TYPE_SIZE
)
9514 return unsignedp
? sat_unsigned_short_accum_type_node
9515 : sat_short_accum_type_node
;
9516 if (size
== ACCUM_TYPE_SIZE
)
9517 return unsignedp
? sat_unsigned_accum_type_node
: sat_accum_type_node
;
9518 if (size
== LONG_ACCUM_TYPE_SIZE
)
9519 return unsignedp
? sat_unsigned_long_accum_type_node
9520 : sat_long_accum_type_node
;
9521 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
9522 return unsignedp
? sat_unsigned_long_long_accum_type_node
9523 : sat_long_long_accum_type_node
;
9527 if (size
== SHORT_ACCUM_TYPE_SIZE
)
9528 return unsignedp
? unsigned_short_accum_type_node
9529 : short_accum_type_node
;
9530 if (size
== ACCUM_TYPE_SIZE
)
9531 return unsignedp
? unsigned_accum_type_node
: accum_type_node
;
9532 if (size
== LONG_ACCUM_TYPE_SIZE
)
9533 return unsignedp
? unsigned_long_accum_type_node
9534 : long_accum_type_node
;
9535 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
9536 return unsignedp
? unsigned_long_long_accum_type_node
9537 : long_long_accum_type_node
;
9540 return make_accum_type (size
, unsignedp
, satp
);
9544 /* Create an atomic variant node for TYPE. This routine is called
9545 during initialization of data types to create the 5 basic atomic
9546 types. The generic build_variant_type function requires these to
9547 already be set up in order to function properly, so cannot be
9548 called from there. If ALIGN is non-zero, then ensure alignment is
9549 overridden to this value. */
9552 build_atomic_base (tree type
, unsigned int align
)
9556 /* Make sure its not already registered. */
9557 if ((t
= get_qualified_type (type
, TYPE_QUAL_ATOMIC
)))
9560 t
= build_variant_type_copy (type
);
9561 set_type_quals (t
, TYPE_QUAL_ATOMIC
);
9564 TYPE_ALIGN (t
) = align
;
9569 /* Create nodes for all integer types (and error_mark_node) using the sizes
9570 of C datatypes. SIGNED_CHAR specifies whether char is signed,
9571 SHORT_DOUBLE specifies whether double should be of the same precision
9575 build_common_tree_nodes (bool signed_char
, bool short_double
)
9577 error_mark_node
= make_node (ERROR_MARK
);
9578 TREE_TYPE (error_mark_node
) = error_mark_node
;
9580 initialize_sizetypes ();
9582 /* Define both `signed char' and `unsigned char'. */
9583 signed_char_type_node
= make_signed_type (CHAR_TYPE_SIZE
);
9584 TYPE_STRING_FLAG (signed_char_type_node
) = 1;
9585 unsigned_char_type_node
= make_unsigned_type (CHAR_TYPE_SIZE
);
9586 TYPE_STRING_FLAG (unsigned_char_type_node
) = 1;
9588 /* Define `char', which is like either `signed char' or `unsigned char'
9589 but not the same as either. */
9592 ? make_signed_type (CHAR_TYPE_SIZE
)
9593 : make_unsigned_type (CHAR_TYPE_SIZE
));
9594 TYPE_STRING_FLAG (char_type_node
) = 1;
9596 short_integer_type_node
= make_signed_type (SHORT_TYPE_SIZE
);
9597 short_unsigned_type_node
= make_unsigned_type (SHORT_TYPE_SIZE
);
9598 integer_type_node
= make_signed_type (INT_TYPE_SIZE
);
9599 unsigned_type_node
= make_unsigned_type (INT_TYPE_SIZE
);
9600 long_integer_type_node
= make_signed_type (LONG_TYPE_SIZE
);
9601 long_unsigned_type_node
= make_unsigned_type (LONG_TYPE_SIZE
);
9602 long_long_integer_type_node
= make_signed_type (LONG_LONG_TYPE_SIZE
);
9603 long_long_unsigned_type_node
= make_unsigned_type (LONG_LONG_TYPE_SIZE
);
9604 #if HOST_BITS_PER_WIDE_INT >= 64
9605 /* TODO: This isn't correct, but as logic depends at the moment on
9606 host's instead of target's wide-integer.
9607 If there is a target not supporting TImode, but has an 128-bit
9608 integer-scalar register, this target check needs to be adjusted. */
9609 if (targetm
.scalar_mode_supported_p (TImode
))
9611 int128_integer_type_node
= make_signed_type (128);
9612 int128_unsigned_type_node
= make_unsigned_type (128);
9616 /* Define a boolean type. This type only represents boolean values but
9617 may be larger than char depending on the value of BOOL_TYPE_SIZE. */
9618 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
9619 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
9620 TYPE_PRECISION (boolean_type_node
) = 1;
9621 TYPE_MAX_VALUE (boolean_type_node
) = build_int_cst (boolean_type_node
, 1);
9623 /* Define what type to use for size_t. */
9624 if (strcmp (SIZE_TYPE
, "unsigned int") == 0)
9625 size_type_node
= unsigned_type_node
;
9626 else if (strcmp (SIZE_TYPE
, "long unsigned int") == 0)
9627 size_type_node
= long_unsigned_type_node
;
9628 else if (strcmp (SIZE_TYPE
, "long long unsigned int") == 0)
9629 size_type_node
= long_long_unsigned_type_node
;
9630 else if (strcmp (SIZE_TYPE
, "short unsigned int") == 0)
9631 size_type_node
= short_unsigned_type_node
;
9635 /* Fill in the rest of the sized types. Reuse existing type nodes
9637 intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 0);
9638 intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 0);
9639 intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 0);
9640 intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 0);
9641 intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 0);
9643 unsigned_intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 1);
9644 unsigned_intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 1);
9645 unsigned_intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 1);
9646 unsigned_intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 1);
9647 unsigned_intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 1);
9649 /* Don't call build_qualified type for atomics. That routine does
9650 special processing for atomics, and until they are initialized
9651 it's better not to make that call.
9653 Check to see if there is a target override for atomic types. */
9655 atomicQI_type_node
= build_atomic_base (unsigned_intQI_type_node
,
9656 targetm
.atomic_align_for_mode (QImode
));
9657 atomicHI_type_node
= build_atomic_base (unsigned_intHI_type_node
,
9658 targetm
.atomic_align_for_mode (HImode
));
9659 atomicSI_type_node
= build_atomic_base (unsigned_intSI_type_node
,
9660 targetm
.atomic_align_for_mode (SImode
));
9661 atomicDI_type_node
= build_atomic_base (unsigned_intDI_type_node
,
9662 targetm
.atomic_align_for_mode (DImode
));
9663 atomicTI_type_node
= build_atomic_base (unsigned_intTI_type_node
,
9664 targetm
.atomic_align_for_mode (TImode
));
9666 access_public_node
= get_identifier ("public");
9667 access_protected_node
= get_identifier ("protected");
9668 access_private_node
= get_identifier ("private");
9670 /* Define these next since types below may used them. */
9671 integer_zero_node
= build_int_cst (integer_type_node
, 0);
9672 integer_one_node
= build_int_cst (integer_type_node
, 1);
9673 integer_three_node
= build_int_cst (integer_type_node
, 3);
9674 integer_minus_one_node
= build_int_cst (integer_type_node
, -1);
9676 size_zero_node
= size_int (0);
9677 size_one_node
= size_int (1);
9678 bitsize_zero_node
= bitsize_int (0);
9679 bitsize_one_node
= bitsize_int (1);
9680 bitsize_unit_node
= bitsize_int (BITS_PER_UNIT
);
9682 boolean_false_node
= TYPE_MIN_VALUE (boolean_type_node
);
9683 boolean_true_node
= TYPE_MAX_VALUE (boolean_type_node
);
9685 void_type_node
= make_node (VOID_TYPE
);
9686 layout_type (void_type_node
);
9688 /* We are not going to have real types in C with less than byte alignment,
9689 so we might as well not have any types that claim to have it. */
9690 TYPE_ALIGN (void_type_node
) = BITS_PER_UNIT
;
9691 TYPE_USER_ALIGN (void_type_node
) = 0;
9693 void_node
= make_node (VOID_CST
);
9694 TREE_TYPE (void_node
) = void_type_node
;
9696 null_pointer_node
= build_int_cst (build_pointer_type (void_type_node
), 0);
9697 layout_type (TREE_TYPE (null_pointer_node
));
9699 ptr_type_node
= build_pointer_type (void_type_node
);
9701 = build_pointer_type (build_type_variant (void_type_node
, 1, 0));
9702 fileptr_type_node
= ptr_type_node
;
9704 pointer_sized_int_node
= build_nonstandard_integer_type (POINTER_SIZE
, 1);
9706 float_type_node
= make_node (REAL_TYPE
);
9707 TYPE_PRECISION (float_type_node
) = FLOAT_TYPE_SIZE
;
9708 layout_type (float_type_node
);
9710 double_type_node
= make_node (REAL_TYPE
);
9712 TYPE_PRECISION (double_type_node
) = FLOAT_TYPE_SIZE
;
9714 TYPE_PRECISION (double_type_node
) = DOUBLE_TYPE_SIZE
;
9715 layout_type (double_type_node
);
9717 long_double_type_node
= make_node (REAL_TYPE
);
9718 TYPE_PRECISION (long_double_type_node
) = LONG_DOUBLE_TYPE_SIZE
;
9719 layout_type (long_double_type_node
);
9721 float_ptr_type_node
= build_pointer_type (float_type_node
);
9722 double_ptr_type_node
= build_pointer_type (double_type_node
);
9723 long_double_ptr_type_node
= build_pointer_type (long_double_type_node
);
9724 integer_ptr_type_node
= build_pointer_type (integer_type_node
);
9726 /* Fixed size integer types. */
9727 uint16_type_node
= make_or_reuse_type (16, 1);
9728 uint32_type_node
= make_or_reuse_type (32, 1);
9729 uint64_type_node
= make_or_reuse_type (64, 1);
9731 /* Decimal float types. */
9732 dfloat32_type_node
= make_node (REAL_TYPE
);
9733 TYPE_PRECISION (dfloat32_type_node
) = DECIMAL32_TYPE_SIZE
;
9734 layout_type (dfloat32_type_node
);
9735 SET_TYPE_MODE (dfloat32_type_node
, SDmode
);
9736 dfloat32_ptr_type_node
= build_pointer_type (dfloat32_type_node
);
9738 dfloat64_type_node
= make_node (REAL_TYPE
);
9739 TYPE_PRECISION (dfloat64_type_node
) = DECIMAL64_TYPE_SIZE
;
9740 layout_type (dfloat64_type_node
);
9741 SET_TYPE_MODE (dfloat64_type_node
, DDmode
);
9742 dfloat64_ptr_type_node
= build_pointer_type (dfloat64_type_node
);
9744 dfloat128_type_node
= make_node (REAL_TYPE
);
9745 TYPE_PRECISION (dfloat128_type_node
) = DECIMAL128_TYPE_SIZE
;
9746 layout_type (dfloat128_type_node
);
9747 SET_TYPE_MODE (dfloat128_type_node
, TDmode
);
9748 dfloat128_ptr_type_node
= build_pointer_type (dfloat128_type_node
);
9750 complex_integer_type_node
= build_complex_type (integer_type_node
);
9751 complex_float_type_node
= build_complex_type (float_type_node
);
9752 complex_double_type_node
= build_complex_type (double_type_node
);
9753 complex_long_double_type_node
= build_complex_type (long_double_type_node
);
9755 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
9756 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
9757 sat_ ## KIND ## _type_node = \
9758 make_sat_signed_ ## KIND ## _type (SIZE); \
9759 sat_unsigned_ ## KIND ## _type_node = \
9760 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9761 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9762 unsigned_ ## KIND ## _type_node = \
9763 make_unsigned_ ## KIND ## _type (SIZE);
9765 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
9766 sat_ ## WIDTH ## KIND ## _type_node = \
9767 make_sat_signed_ ## KIND ## _type (SIZE); \
9768 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
9769 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9770 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9771 unsigned_ ## WIDTH ## KIND ## _type_node = \
9772 make_unsigned_ ## KIND ## _type (SIZE);
9774 /* Make fixed-point type nodes based on four different widths. */
9775 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
9776 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
9777 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
9778 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
9779 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
9781 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
9782 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
9783 NAME ## _type_node = \
9784 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
9785 u ## NAME ## _type_node = \
9786 make_or_reuse_unsigned_ ## KIND ## _type \
9787 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
9788 sat_ ## NAME ## _type_node = \
9789 make_or_reuse_sat_signed_ ## KIND ## _type \
9790 (GET_MODE_BITSIZE (MODE ## mode)); \
9791 sat_u ## NAME ## _type_node = \
9792 make_or_reuse_sat_unsigned_ ## KIND ## _type \
9793 (GET_MODE_BITSIZE (U ## MODE ## mode));
9795 /* Fixed-point type and mode nodes. */
9796 MAKE_FIXED_TYPE_NODE_FAMILY (fract
, FRACT
)
9797 MAKE_FIXED_TYPE_NODE_FAMILY (accum
, ACCUM
)
9798 MAKE_FIXED_MODE_NODE (fract
, qq
, QQ
)
9799 MAKE_FIXED_MODE_NODE (fract
, hq
, HQ
)
9800 MAKE_FIXED_MODE_NODE (fract
, sq
, SQ
)
9801 MAKE_FIXED_MODE_NODE (fract
, dq
, DQ
)
9802 MAKE_FIXED_MODE_NODE (fract
, tq
, TQ
)
9803 MAKE_FIXED_MODE_NODE (accum
, ha
, HA
)
9804 MAKE_FIXED_MODE_NODE (accum
, sa
, SA
)
9805 MAKE_FIXED_MODE_NODE (accum
, da
, DA
)
9806 MAKE_FIXED_MODE_NODE (accum
, ta
, TA
)
9809 tree t
= targetm
.build_builtin_va_list ();
9811 /* Many back-ends define record types without setting TYPE_NAME.
9812 If we copied the record type here, we'd keep the original
9813 record type without a name. This breaks name mangling. So,
9814 don't copy record types and let c_common_nodes_and_builtins()
9815 declare the type to be __builtin_va_list. */
9816 if (TREE_CODE (t
) != RECORD_TYPE
)
9817 t
= build_variant_type_copy (t
);
9819 va_list_type_node
= t
;
9823 /* Modify DECL for given flags.
9824 TM_PURE attribute is set only on types, so the function will modify
9825 DECL's type when ECF_TM_PURE is used. */
9828 set_call_expr_flags (tree decl
, int flags
)
9830 if (flags
& ECF_NOTHROW
)
9831 TREE_NOTHROW (decl
) = 1;
9832 if (flags
& ECF_CONST
)
9833 TREE_READONLY (decl
) = 1;
9834 if (flags
& ECF_PURE
)
9835 DECL_PURE_P (decl
) = 1;
9836 if (flags
& ECF_LOOPING_CONST_OR_PURE
)
9837 DECL_LOOPING_CONST_OR_PURE_P (decl
) = 1;
9838 if (flags
& ECF_NOVOPS
)
9839 DECL_IS_NOVOPS (decl
) = 1;
9840 if (flags
& ECF_NORETURN
)
9841 TREE_THIS_VOLATILE (decl
) = 1;
9842 if (flags
& ECF_MALLOC
)
9843 DECL_IS_MALLOC (decl
) = 1;
9844 if (flags
& ECF_RETURNS_TWICE
)
9845 DECL_IS_RETURNS_TWICE (decl
) = 1;
9846 if (flags
& ECF_LEAF
)
9847 DECL_ATTRIBUTES (decl
) = tree_cons (get_identifier ("leaf"),
9848 NULL
, DECL_ATTRIBUTES (decl
));
9849 if ((flags
& ECF_TM_PURE
) && flag_tm
)
9850 apply_tm_attr (decl
, get_identifier ("transaction_pure"));
9851 /* Looping const or pure is implied by noreturn.
9852 There is currently no way to declare looping const or looping pure alone. */
9853 gcc_assert (!(flags
& ECF_LOOPING_CONST_OR_PURE
)
9854 || ((flags
& ECF_NORETURN
) && (flags
& (ECF_CONST
| ECF_PURE
))));
9858 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
9861 local_define_builtin (const char *name
, tree type
, enum built_in_function code
,
9862 const char *library_name
, int ecf_flags
)
9866 decl
= add_builtin_function (name
, type
, code
, BUILT_IN_NORMAL
,
9867 library_name
, NULL_TREE
);
9868 set_call_expr_flags (decl
, ecf_flags
);
9870 set_builtin_decl (code
, decl
, true);
9873 /* Call this function after instantiating all builtins that the language
9874 front end cares about. This will build the rest of the builtins
9875 and internal functions that are relied upon by the tree optimizers and
9879 build_common_builtin_nodes (void)
9884 if (!builtin_decl_explicit_p (BUILT_IN_UNREACHABLE
))
9886 ftype
= build_function_type (void_type_node
, void_list_node
);
9887 local_define_builtin ("__builtin_unreachable", ftype
, BUILT_IN_UNREACHABLE
,
9888 "__builtin_unreachable",
9889 ECF_NOTHROW
| ECF_LEAF
| ECF_NORETURN
9890 | ECF_CONST
| ECF_LEAF
);
9893 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
)
9894 || !builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
9896 ftype
= build_function_type_list (ptr_type_node
,
9897 ptr_type_node
, const_ptr_type_node
,
9898 size_type_node
, NULL_TREE
);
9900 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
))
9901 local_define_builtin ("__builtin_memcpy", ftype
, BUILT_IN_MEMCPY
,
9902 "memcpy", ECF_NOTHROW
| ECF_LEAF
);
9903 if (!builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
9904 local_define_builtin ("__builtin_memmove", ftype
, BUILT_IN_MEMMOVE
,
9905 "memmove", ECF_NOTHROW
| ECF_LEAF
);
9908 if (!builtin_decl_explicit_p (BUILT_IN_MEMCMP
))
9910 ftype
= build_function_type_list (integer_type_node
, const_ptr_type_node
,
9911 const_ptr_type_node
, size_type_node
,
9913 local_define_builtin ("__builtin_memcmp", ftype
, BUILT_IN_MEMCMP
,
9914 "memcmp", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
9917 if (!builtin_decl_explicit_p (BUILT_IN_MEMSET
))
9919 ftype
= build_function_type_list (ptr_type_node
,
9920 ptr_type_node
, integer_type_node
,
9921 size_type_node
, NULL_TREE
);
9922 local_define_builtin ("__builtin_memset", ftype
, BUILT_IN_MEMSET
,
9923 "memset", ECF_NOTHROW
| ECF_LEAF
);
9926 if (!builtin_decl_explicit_p (BUILT_IN_ALLOCA
))
9928 ftype
= build_function_type_list (ptr_type_node
,
9929 size_type_node
, NULL_TREE
);
9930 local_define_builtin ("__builtin_alloca", ftype
, BUILT_IN_ALLOCA
,
9931 "alloca", ECF_MALLOC
| ECF_NOTHROW
| ECF_LEAF
);
9934 ftype
= build_function_type_list (ptr_type_node
, size_type_node
,
9935 size_type_node
, NULL_TREE
);
9936 local_define_builtin ("__builtin_alloca_with_align", ftype
,
9937 BUILT_IN_ALLOCA_WITH_ALIGN
, "alloca",
9938 ECF_MALLOC
| ECF_NOTHROW
| ECF_LEAF
);
9940 /* If we're checking the stack, `alloca' can throw. */
9941 if (flag_stack_check
)
9943 TREE_NOTHROW (builtin_decl_explicit (BUILT_IN_ALLOCA
)) = 0;
9944 TREE_NOTHROW (builtin_decl_explicit (BUILT_IN_ALLOCA_WITH_ALIGN
)) = 0;
9947 ftype
= build_function_type_list (void_type_node
,
9948 ptr_type_node
, ptr_type_node
,
9949 ptr_type_node
, NULL_TREE
);
9950 local_define_builtin ("__builtin_init_trampoline", ftype
,
9951 BUILT_IN_INIT_TRAMPOLINE
,
9952 "__builtin_init_trampoline", ECF_NOTHROW
| ECF_LEAF
);
9953 local_define_builtin ("__builtin_init_heap_trampoline", ftype
,
9954 BUILT_IN_INIT_HEAP_TRAMPOLINE
,
9955 "__builtin_init_heap_trampoline",
9956 ECF_NOTHROW
| ECF_LEAF
);
9958 ftype
= build_function_type_list (ptr_type_node
, ptr_type_node
, NULL_TREE
);
9959 local_define_builtin ("__builtin_adjust_trampoline", ftype
,
9960 BUILT_IN_ADJUST_TRAMPOLINE
,
9961 "__builtin_adjust_trampoline",
9962 ECF_CONST
| ECF_NOTHROW
);
9964 ftype
= build_function_type_list (void_type_node
,
9965 ptr_type_node
, ptr_type_node
, NULL_TREE
);
9966 local_define_builtin ("__builtin_nonlocal_goto", ftype
,
9967 BUILT_IN_NONLOCAL_GOTO
,
9968 "__builtin_nonlocal_goto",
9969 ECF_NORETURN
| ECF_NOTHROW
);
9971 ftype
= build_function_type_list (void_type_node
,
9972 ptr_type_node
, ptr_type_node
, NULL_TREE
);
9973 local_define_builtin ("__builtin_setjmp_setup", ftype
,
9974 BUILT_IN_SETJMP_SETUP
,
9975 "__builtin_setjmp_setup", ECF_NOTHROW
);
9977 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
9978 local_define_builtin ("__builtin_setjmp_receiver", ftype
,
9979 BUILT_IN_SETJMP_RECEIVER
,
9980 "__builtin_setjmp_receiver", ECF_NOTHROW
| ECF_LEAF
);
9982 ftype
= build_function_type_list (ptr_type_node
, NULL_TREE
);
9983 local_define_builtin ("__builtin_stack_save", ftype
, BUILT_IN_STACK_SAVE
,
9984 "__builtin_stack_save", ECF_NOTHROW
| ECF_LEAF
);
9986 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
9987 local_define_builtin ("__builtin_stack_restore", ftype
,
9988 BUILT_IN_STACK_RESTORE
,
9989 "__builtin_stack_restore", ECF_NOTHROW
| ECF_LEAF
);
9991 /* If there's a possibility that we might use the ARM EABI, build the
9992 alternate __cxa_end_cleanup node used to resume from C++ and Java. */
9993 if (targetm
.arm_eabi_unwinder
)
9995 ftype
= build_function_type_list (void_type_node
, NULL_TREE
);
9996 local_define_builtin ("__builtin_cxa_end_cleanup", ftype
,
9997 BUILT_IN_CXA_END_CLEANUP
,
9998 "__cxa_end_cleanup", ECF_NORETURN
| ECF_LEAF
);
10001 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10002 local_define_builtin ("__builtin_unwind_resume", ftype
,
10003 BUILT_IN_UNWIND_RESUME
,
10004 ((targetm_common
.except_unwind_info (&global_options
)
10006 ? "_Unwind_SjLj_Resume" : "_Unwind_Resume"),
10009 if (builtin_decl_explicit (BUILT_IN_RETURN_ADDRESS
) == NULL_TREE
)
10011 ftype
= build_function_type_list (ptr_type_node
, integer_type_node
,
10013 local_define_builtin ("__builtin_return_address", ftype
,
10014 BUILT_IN_RETURN_ADDRESS
,
10015 "__builtin_return_address",
10019 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
)
10020 || !builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
10022 ftype
= build_function_type_list (void_type_node
, ptr_type_node
,
10023 ptr_type_node
, NULL_TREE
);
10024 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
))
10025 local_define_builtin ("__cyg_profile_func_enter", ftype
,
10026 BUILT_IN_PROFILE_FUNC_ENTER
,
10027 "__cyg_profile_func_enter", 0);
10028 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
10029 local_define_builtin ("__cyg_profile_func_exit", ftype
,
10030 BUILT_IN_PROFILE_FUNC_EXIT
,
10031 "__cyg_profile_func_exit", 0);
10034 /* The exception object and filter values from the runtime. The argument
10035 must be zero before exception lowering, i.e. from the front end. After
10036 exception lowering, it will be the region number for the exception
10037 landing pad. These functions are PURE instead of CONST to prevent
10038 them from being hoisted past the exception edge that will initialize
10039 its value in the landing pad. */
10040 ftype
= build_function_type_list (ptr_type_node
,
10041 integer_type_node
, NULL_TREE
);
10042 ecf_flags
= ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
;
10043 /* Only use TM_PURE if we we have TM language support. */
10044 if (builtin_decl_explicit_p (BUILT_IN_TM_LOAD_1
))
10045 ecf_flags
|= ECF_TM_PURE
;
10046 local_define_builtin ("__builtin_eh_pointer", ftype
, BUILT_IN_EH_POINTER
,
10047 "__builtin_eh_pointer", ecf_flags
);
10049 tmp
= lang_hooks
.types
.type_for_mode (targetm
.eh_return_filter_mode (), 0);
10050 ftype
= build_function_type_list (tmp
, integer_type_node
, NULL_TREE
);
10051 local_define_builtin ("__builtin_eh_filter", ftype
, BUILT_IN_EH_FILTER
,
10052 "__builtin_eh_filter", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10054 ftype
= build_function_type_list (void_type_node
,
10055 integer_type_node
, integer_type_node
,
10057 local_define_builtin ("__builtin_eh_copy_values", ftype
,
10058 BUILT_IN_EH_COPY_VALUES
,
10059 "__builtin_eh_copy_values", ECF_NOTHROW
);
10061 /* Complex multiplication and division. These are handled as builtins
10062 rather than optabs because emit_library_call_value doesn't support
10063 complex. Further, we can do slightly better with folding these
10064 beasties if the real and complex parts of the arguments are separate. */
10068 for (mode
= MIN_MODE_COMPLEX_FLOAT
; mode
<= MAX_MODE_COMPLEX_FLOAT
; ++mode
)
10070 char mode_name_buf
[4], *q
;
10072 enum built_in_function mcode
, dcode
;
10073 tree type
, inner_type
;
10074 const char *prefix
= "__";
10076 if (targetm
.libfunc_gnu_prefix
)
10079 type
= lang_hooks
.types
.type_for_mode ((enum machine_mode
) mode
, 0);
10082 inner_type
= TREE_TYPE (type
);
10084 ftype
= build_function_type_list (type
, inner_type
, inner_type
,
10085 inner_type
, inner_type
, NULL_TREE
);
10087 mcode
= ((enum built_in_function
)
10088 (BUILT_IN_COMPLEX_MUL_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
10089 dcode
= ((enum built_in_function
)
10090 (BUILT_IN_COMPLEX_DIV_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
10092 for (p
= GET_MODE_NAME (mode
), q
= mode_name_buf
; *p
; p
++, q
++)
10096 built_in_names
[mcode
] = concat (prefix
, "mul", mode_name_buf
, "3",
10098 local_define_builtin (built_in_names
[mcode
], ftype
, mcode
,
10099 built_in_names
[mcode
],
10100 ECF_CONST
| ECF_NOTHROW
| ECF_LEAF
);
10102 built_in_names
[dcode
] = concat (prefix
, "div", mode_name_buf
, "3",
10104 local_define_builtin (built_in_names
[dcode
], ftype
, dcode
,
10105 built_in_names
[dcode
],
10106 ECF_CONST
| ECF_NOTHROW
| ECF_LEAF
);
10110 init_internal_fns ();
10113 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
10116 If we requested a pointer to a vector, build up the pointers that
10117 we stripped off while looking for the inner type. Similarly for
10118 return values from functions.
10120 The argument TYPE is the top of the chain, and BOTTOM is the
10121 new type which we will point to. */
10124 reconstruct_complex_type (tree type
, tree bottom
)
10128 if (TREE_CODE (type
) == POINTER_TYPE
)
10130 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10131 outer
= build_pointer_type_for_mode (inner
, TYPE_MODE (type
),
10132 TYPE_REF_CAN_ALIAS_ALL (type
));
10134 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
10136 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10137 outer
= build_reference_type_for_mode (inner
, TYPE_MODE (type
),
10138 TYPE_REF_CAN_ALIAS_ALL (type
));
10140 else if (TREE_CODE (type
) == ARRAY_TYPE
)
10142 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10143 outer
= build_array_type (inner
, TYPE_DOMAIN (type
));
10145 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10147 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10148 outer
= build_function_type (inner
, TYPE_ARG_TYPES (type
));
10150 else if (TREE_CODE (type
) == METHOD_TYPE
)
10152 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10153 /* The build_method_type_directly() routine prepends 'this' to argument list,
10154 so we must compensate by getting rid of it. */
10156 = build_method_type_directly
10157 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
))),
10159 TREE_CHAIN (TYPE_ARG_TYPES (type
)));
10161 else if (TREE_CODE (type
) == OFFSET_TYPE
)
10163 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10164 outer
= build_offset_type (TYPE_OFFSET_BASETYPE (type
), inner
);
10169 return build_type_attribute_qual_variant (outer
, TYPE_ATTRIBUTES (type
),
10170 TYPE_QUALS (type
));
10173 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
10176 build_vector_type_for_mode (tree innertype
, enum machine_mode mode
)
10180 switch (GET_MODE_CLASS (mode
))
10182 case MODE_VECTOR_INT
:
10183 case MODE_VECTOR_FLOAT
:
10184 case MODE_VECTOR_FRACT
:
10185 case MODE_VECTOR_UFRACT
:
10186 case MODE_VECTOR_ACCUM
:
10187 case MODE_VECTOR_UACCUM
:
10188 nunits
= GET_MODE_NUNITS (mode
);
10192 /* Check that there are no leftover bits. */
10193 gcc_assert (GET_MODE_BITSIZE (mode
)
10194 % TREE_INT_CST_LOW (TYPE_SIZE (innertype
)) == 0);
10196 nunits
= GET_MODE_BITSIZE (mode
)
10197 / TREE_INT_CST_LOW (TYPE_SIZE (innertype
));
10201 gcc_unreachable ();
10204 return make_vector_type (innertype
, nunits
, mode
);
10207 /* Similarly, but takes the inner type and number of units, which must be
10211 build_vector_type (tree innertype
, int nunits
)
10213 return make_vector_type (innertype
, nunits
, VOIDmode
);
10216 /* Similarly, but builds a variant type with TYPE_VECTOR_OPAQUE set. */
10219 build_opaque_vector_type (tree innertype
, int nunits
)
10221 tree t
= make_vector_type (innertype
, nunits
, VOIDmode
);
10223 /* We always build the non-opaque variant before the opaque one,
10224 so if it already exists, it is TYPE_NEXT_VARIANT of this one. */
10225 cand
= TYPE_NEXT_VARIANT (t
);
10227 && TYPE_VECTOR_OPAQUE (cand
)
10228 && check_qualified_type (cand
, t
, TYPE_QUALS (t
)))
10230 /* Othewise build a variant type and make sure to queue it after
10231 the non-opaque type. */
10232 cand
= build_distinct_type_copy (t
);
10233 TYPE_VECTOR_OPAQUE (cand
) = true;
10234 TYPE_CANONICAL (cand
) = TYPE_CANONICAL (t
);
10235 TYPE_NEXT_VARIANT (cand
) = TYPE_NEXT_VARIANT (t
);
10236 TYPE_NEXT_VARIANT (t
) = cand
;
10237 TYPE_MAIN_VARIANT (cand
) = TYPE_MAIN_VARIANT (t
);
10242 /* Given an initializer INIT, return TRUE if INIT is zero or some
10243 aggregate of zeros. Otherwise return FALSE. */
10245 initializer_zerop (const_tree init
)
10251 switch (TREE_CODE (init
))
10254 return integer_zerop (init
);
10257 /* ??? Note that this is not correct for C4X float formats. There,
10258 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
10259 negative exponent. */
10260 return real_zerop (init
)
10261 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init
));
10264 return fixed_zerop (init
);
10267 return integer_zerop (init
)
10268 || (real_zerop (init
)
10269 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init
)))
10270 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init
))));
10275 for (i
= 0; i
< VECTOR_CST_NELTS (init
); ++i
)
10276 if (!initializer_zerop (VECTOR_CST_ELT (init
, i
)))
10283 unsigned HOST_WIDE_INT idx
;
10285 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init
), idx
, elt
)
10286 if (!initializer_zerop (elt
))
10295 /* We need to loop through all elements to handle cases like
10296 "\0" and "\0foobar". */
10297 for (i
= 0; i
< TREE_STRING_LENGTH (init
); ++i
)
10298 if (TREE_STRING_POINTER (init
)[i
] != '\0')
10309 /* Check if vector VEC consists of all the equal elements and
10310 that the number of elements corresponds to the type of VEC.
10311 The function returns first element of the vector
10312 or NULL_TREE if the vector is not uniform. */
10314 uniform_vector_p (const_tree vec
)
10319 if (vec
== NULL_TREE
)
10322 gcc_assert (VECTOR_TYPE_P (TREE_TYPE (vec
)));
10324 if (TREE_CODE (vec
) == VECTOR_CST
)
10326 first
= VECTOR_CST_ELT (vec
, 0);
10327 for (i
= 1; i
< VECTOR_CST_NELTS (vec
); ++i
)
10328 if (!operand_equal_p (first
, VECTOR_CST_ELT (vec
, i
), 0))
10334 else if (TREE_CODE (vec
) == CONSTRUCTOR
)
10336 first
= error_mark_node
;
10338 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (vec
), i
, t
)
10345 if (!operand_equal_p (first
, t
, 0))
10348 if (i
!= TYPE_VECTOR_SUBPARTS (TREE_TYPE (vec
)))
10357 /* Build an empty statement at location LOC. */
10360 build_empty_stmt (location_t loc
)
10362 tree t
= build1 (NOP_EXPR
, void_type_node
, size_zero_node
);
10363 SET_EXPR_LOCATION (t
, loc
);
10368 /* Build an OpenMP clause with code CODE. LOC is the location of the
10372 build_omp_clause (location_t loc
, enum omp_clause_code code
)
10377 length
= omp_clause_num_ops
[code
];
10378 size
= (sizeof (struct tree_omp_clause
) + (length
- 1) * sizeof (tree
));
10380 record_node_allocation_statistics (OMP_CLAUSE
, size
);
10382 t
= (tree
) ggc_internal_alloc (size
);
10383 memset (t
, 0, size
);
10384 TREE_SET_CODE (t
, OMP_CLAUSE
);
10385 OMP_CLAUSE_SET_CODE (t
, code
);
10386 OMP_CLAUSE_LOCATION (t
) = loc
;
10391 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
10392 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
10393 Except for the CODE and operand count field, other storage for the
10394 object is initialized to zeros. */
10397 build_vl_exp_stat (enum tree_code code
, int len MEM_STAT_DECL
)
10400 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_exp
);
10402 gcc_assert (TREE_CODE_CLASS (code
) == tcc_vl_exp
);
10403 gcc_assert (len
>= 1);
10405 record_node_allocation_statistics (code
, length
);
10407 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
10409 TREE_SET_CODE (t
, code
);
10411 /* Can't use TREE_OPERAND to store the length because if checking is
10412 enabled, it will try to check the length before we store it. :-P */
10413 t
->exp
.operands
[0] = build_int_cst (sizetype
, len
);
10418 /* Helper function for build_call_* functions; build a CALL_EXPR with
10419 indicated RETURN_TYPE, FN, and NARGS, but do not initialize any of
10420 the argument slots. */
10423 build_call_1 (tree return_type
, tree fn
, int nargs
)
10427 t
= build_vl_exp (CALL_EXPR
, nargs
+ 3);
10428 TREE_TYPE (t
) = return_type
;
10429 CALL_EXPR_FN (t
) = fn
;
10430 CALL_EXPR_STATIC_CHAIN (t
) = NULL
;
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 "..." arguments. */
10440 build_call_nary (tree return_type
, tree fn
, int nargs
, ...)
10444 va_start (args
, nargs
);
10445 ret
= build_call_valist (return_type
, fn
, nargs
, args
);
10450 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10451 FN and a null static chain slot. NARGS is the number of call arguments
10452 which are specified as a va_list ARGS. */
10455 build_call_valist (tree return_type
, tree fn
, int nargs
, va_list args
)
10460 t
= build_call_1 (return_type
, fn
, nargs
);
10461 for (i
= 0; i
< nargs
; i
++)
10462 CALL_EXPR_ARG (t
, i
) = va_arg (args
, tree
);
10463 process_call_operands (t
);
10467 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10468 FN and a null static chain slot. NARGS is the number of call arguments
10469 which are specified as a tree array ARGS. */
10472 build_call_array_loc (location_t loc
, tree return_type
, tree fn
,
10473 int nargs
, const tree
*args
)
10478 t
= build_call_1 (return_type
, fn
, nargs
);
10479 for (i
= 0; i
< nargs
; i
++)
10480 CALL_EXPR_ARG (t
, i
) = args
[i
];
10481 process_call_operands (t
);
10482 SET_EXPR_LOCATION (t
, loc
);
10486 /* Like build_call_array, but takes a vec. */
10489 build_call_vec (tree return_type
, tree fn
, vec
<tree
, va_gc
> *args
)
10494 ret
= build_call_1 (return_type
, fn
, vec_safe_length (args
));
10495 FOR_EACH_VEC_SAFE_ELT (args
, ix
, t
)
10496 CALL_EXPR_ARG (ret
, ix
) = t
;
10497 process_call_operands (ret
);
10501 /* Conveniently construct a function call expression. FNDECL names the
10502 function to be called and N arguments are passed in the array
10506 build_call_expr_loc_array (location_t loc
, tree fndecl
, int n
, tree
*argarray
)
10508 tree fntype
= TREE_TYPE (fndecl
);
10509 tree fn
= build1 (ADDR_EXPR
, build_pointer_type (fntype
), fndecl
);
10511 return fold_builtin_call_array (loc
, TREE_TYPE (fntype
), fn
, n
, argarray
);
10514 /* Conveniently construct a function call expression. FNDECL names the
10515 function to be called and the arguments are passed in the vector
10519 build_call_expr_loc_vec (location_t loc
, tree fndecl
, vec
<tree
, va_gc
> *vec
)
10521 return build_call_expr_loc_array (loc
, fndecl
, vec_safe_length (vec
),
10522 vec_safe_address (vec
));
10526 /* Conveniently construct a function call expression. FNDECL names the
10527 function to be called, N is the number of arguments, and the "..."
10528 parameters are the argument expressions. */
10531 build_call_expr_loc (location_t loc
, tree fndecl
, int n
, ...)
10534 tree
*argarray
= XALLOCAVEC (tree
, n
);
10538 for (i
= 0; i
< n
; i
++)
10539 argarray
[i
] = va_arg (ap
, tree
);
10541 return build_call_expr_loc_array (loc
, fndecl
, n
, argarray
);
10544 /* Like build_call_expr_loc (UNKNOWN_LOCATION, ...). Duplicated because
10545 varargs macros aren't supported by all bootstrap compilers. */
10548 build_call_expr (tree fndecl
, int n
, ...)
10551 tree
*argarray
= XALLOCAVEC (tree
, n
);
10555 for (i
= 0; i
< n
; i
++)
10556 argarray
[i
] = va_arg (ap
, tree
);
10558 return build_call_expr_loc_array (UNKNOWN_LOCATION
, fndecl
, n
, argarray
);
10561 /* Build internal call expression. This is just like CALL_EXPR, except
10562 its CALL_EXPR_FN is NULL. It will get gimplified later into ordinary
10563 internal function. */
10566 build_call_expr_internal_loc (location_t loc
, enum internal_fn ifn
,
10567 tree type
, int n
, ...)
10572 tree fn
= build_call_1 (type
, NULL_TREE
, n
);
10574 for (i
= 0; i
< n
; i
++)
10575 CALL_EXPR_ARG (fn
, i
) = va_arg (ap
, tree
);
10577 SET_EXPR_LOCATION (fn
, loc
);
10578 CALL_EXPR_IFN (fn
) = ifn
;
10582 /* Create a new constant string literal and return a char* pointer to it.
10583 The STRING_CST value is the LEN characters at STR. */
10585 build_string_literal (int len
, const char *str
)
10587 tree t
, elem
, index
, type
;
10589 t
= build_string (len
, str
);
10590 elem
= build_type_variant (char_type_node
, 1, 0);
10591 index
= build_index_type (size_int (len
- 1));
10592 type
= build_array_type (elem
, index
);
10593 TREE_TYPE (t
) = type
;
10594 TREE_CONSTANT (t
) = 1;
10595 TREE_READONLY (t
) = 1;
10596 TREE_STATIC (t
) = 1;
10598 type
= build_pointer_type (elem
);
10599 t
= build1 (ADDR_EXPR
, type
,
10600 build4 (ARRAY_REF
, elem
,
10601 t
, integer_zero_node
, NULL_TREE
, NULL_TREE
));
10607 /* Return true if T (assumed to be a DECL) must be assigned a memory
10611 needs_to_live_in_memory (const_tree t
)
10613 return (TREE_ADDRESSABLE (t
)
10614 || is_global_var (t
)
10615 || (TREE_CODE (t
) == RESULT_DECL
10616 && !DECL_BY_REFERENCE (t
)
10617 && aggregate_value_p (t
, current_function_decl
)));
10620 /* Return value of a constant X and sign-extend it. */
10623 int_cst_value (const_tree x
)
10625 unsigned bits
= TYPE_PRECISION (TREE_TYPE (x
));
10626 unsigned HOST_WIDE_INT val
= TREE_INT_CST_LOW (x
);
10628 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
10629 gcc_assert (cst_and_fits_in_hwi (x
));
10631 if (bits
< HOST_BITS_PER_WIDE_INT
)
10633 bool negative
= ((val
>> (bits
- 1)) & 1) != 0;
10635 val
|= (~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1;
10637 val
&= ~((~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1);
10643 /* If TYPE is an integral or pointer type, return an integer type with
10644 the same precision which is unsigned iff UNSIGNEDP is true, or itself
10645 if TYPE is already an integer type of signedness UNSIGNEDP. */
10648 signed_or_unsigned_type_for (int unsignedp
, tree type
)
10650 if (TREE_CODE (type
) == INTEGER_TYPE
&& TYPE_UNSIGNED (type
) == unsignedp
)
10653 if (TREE_CODE (type
) == VECTOR_TYPE
)
10655 tree inner
= TREE_TYPE (type
);
10656 tree inner2
= signed_or_unsigned_type_for (unsignedp
, inner
);
10659 if (inner
== inner2
)
10661 return build_vector_type (inner2
, TYPE_VECTOR_SUBPARTS (type
));
10664 if (!INTEGRAL_TYPE_P (type
)
10665 && !POINTER_TYPE_P (type
)
10666 && TREE_CODE (type
) != OFFSET_TYPE
)
10669 return build_nonstandard_integer_type (TYPE_PRECISION (type
), unsignedp
);
10672 /* If TYPE is an integral or pointer type, return an integer type with
10673 the same precision which is unsigned, or itself if TYPE is already an
10674 unsigned integer type. */
10677 unsigned_type_for (tree type
)
10679 return signed_or_unsigned_type_for (1, type
);
10682 /* If TYPE is an integral or pointer type, return an integer type with
10683 the same precision which is signed, or itself if TYPE is already a
10684 signed integer type. */
10687 signed_type_for (tree type
)
10689 return signed_or_unsigned_type_for (0, type
);
10692 /* If TYPE is a vector type, return a signed integer vector type with the
10693 same width and number of subparts. Otherwise return boolean_type_node. */
10696 truth_type_for (tree type
)
10698 if (TREE_CODE (type
) == VECTOR_TYPE
)
10700 tree elem
= lang_hooks
.types
.type_for_size
10701 (GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (type
))), 0);
10702 return build_opaque_vector_type (elem
, TYPE_VECTOR_SUBPARTS (type
));
10705 return boolean_type_node
;
10708 /* Returns the largest value obtainable by casting something in INNER type to
10712 upper_bound_in_type (tree outer
, tree inner
)
10714 unsigned int det
= 0;
10715 unsigned oprec
= TYPE_PRECISION (outer
);
10716 unsigned iprec
= TYPE_PRECISION (inner
);
10719 /* Compute a unique number for every combination. */
10720 det
|= (oprec
> iprec
) ? 4 : 0;
10721 det
|= TYPE_UNSIGNED (outer
) ? 2 : 0;
10722 det
|= TYPE_UNSIGNED (inner
) ? 1 : 0;
10724 /* Determine the exponent to use. */
10729 /* oprec <= iprec, outer: signed, inner: don't care. */
10734 /* oprec <= iprec, outer: unsigned, inner: don't care. */
10738 /* oprec > iprec, outer: signed, inner: signed. */
10742 /* oprec > iprec, outer: signed, inner: unsigned. */
10746 /* oprec > iprec, outer: unsigned, inner: signed. */
10750 /* oprec > iprec, outer: unsigned, inner: unsigned. */
10754 gcc_unreachable ();
10757 return wide_int_to_tree (outer
,
10758 wi::mask (prec
, false, TYPE_PRECISION (outer
)));
10761 /* Returns the smallest value obtainable by casting something in INNER type to
10765 lower_bound_in_type (tree outer
, tree inner
)
10767 unsigned oprec
= TYPE_PRECISION (outer
);
10768 unsigned iprec
= TYPE_PRECISION (inner
);
10770 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
10772 if (TYPE_UNSIGNED (outer
)
10773 /* If we are widening something of an unsigned type, OUTER type
10774 contains all values of INNER type. In particular, both INNER
10775 and OUTER types have zero in common. */
10776 || (oprec
> iprec
&& TYPE_UNSIGNED (inner
)))
10777 return build_int_cst (outer
, 0);
10780 /* If we are widening a signed type to another signed type, we
10781 want to obtain -2^^(iprec-1). If we are keeping the
10782 precision or narrowing to a signed type, we want to obtain
10784 unsigned prec
= oprec
> iprec
? iprec
: oprec
;
10785 return wide_int_to_tree (outer
,
10786 wi::mask (prec
- 1, true,
10787 TYPE_PRECISION (outer
)));
10791 /* Return nonzero if two operands that are suitable for PHI nodes are
10792 necessarily equal. Specifically, both ARG0 and ARG1 must be either
10793 SSA_NAME or invariant. Note that this is strictly an optimization.
10794 That is, callers of this function can directly call operand_equal_p
10795 and get the same result, only slower. */
10798 operand_equal_for_phi_arg_p (const_tree arg0
, const_tree arg1
)
10802 if (TREE_CODE (arg0
) == SSA_NAME
|| TREE_CODE (arg1
) == SSA_NAME
)
10804 return operand_equal_p (arg0
, arg1
, 0);
10807 /* Returns number of zeros at the end of binary representation of X. */
10810 num_ending_zeros (const_tree x
)
10812 return build_int_cst (TREE_TYPE (x
), wi::ctz (x
));
10816 #define WALK_SUBTREE(NODE) \
10819 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
10825 /* This is a subroutine of walk_tree that walks field of TYPE that are to
10826 be walked whenever a type is seen in the tree. Rest of operands and return
10827 value are as for walk_tree. */
10830 walk_type_fields (tree type
, walk_tree_fn func
, void *data
,
10831 hash_set
<tree
> *pset
, walk_tree_lh lh
)
10833 tree result
= NULL_TREE
;
10835 switch (TREE_CODE (type
))
10838 case REFERENCE_TYPE
:
10840 /* We have to worry about mutually recursive pointers. These can't
10841 be written in C. They can in Ada. It's pathological, but
10842 there's an ACATS test (c38102a) that checks it. Deal with this
10843 by checking if we're pointing to another pointer, that one
10844 points to another pointer, that one does too, and we have no htab.
10845 If so, get a hash table. We check three levels deep to avoid
10846 the cost of the hash table if we don't need one. */
10847 if (POINTER_TYPE_P (TREE_TYPE (type
))
10848 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type
)))
10849 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type
))))
10852 result
= walk_tree_without_duplicates (&TREE_TYPE (type
),
10860 /* ... fall through ... */
10863 WALK_SUBTREE (TREE_TYPE (type
));
10867 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type
));
10869 /* Fall through. */
10871 case FUNCTION_TYPE
:
10872 WALK_SUBTREE (TREE_TYPE (type
));
10876 /* We never want to walk into default arguments. */
10877 for (arg
= TYPE_ARG_TYPES (type
); arg
; arg
= TREE_CHAIN (arg
))
10878 WALK_SUBTREE (TREE_VALUE (arg
));
10883 /* Don't follow this nodes's type if a pointer for fear that
10884 we'll have infinite recursion. If we have a PSET, then we
10887 || (!POINTER_TYPE_P (TREE_TYPE (type
))
10888 && TREE_CODE (TREE_TYPE (type
)) != OFFSET_TYPE
))
10889 WALK_SUBTREE (TREE_TYPE (type
));
10890 WALK_SUBTREE (TYPE_DOMAIN (type
));
10894 WALK_SUBTREE (TREE_TYPE (type
));
10895 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type
));
10905 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
10906 called with the DATA and the address of each sub-tree. If FUNC returns a
10907 non-NULL value, the traversal is stopped, and the value returned by FUNC
10908 is returned. If PSET is non-NULL it is used to record the nodes visited,
10909 and to avoid visiting a node more than once. */
10912 walk_tree_1 (tree
*tp
, walk_tree_fn func
, void *data
,
10913 hash_set
<tree
> *pset
, walk_tree_lh lh
)
10915 enum tree_code code
;
10919 #define WALK_SUBTREE_TAIL(NODE) \
10923 goto tail_recurse; \
10928 /* Skip empty subtrees. */
10932 /* Don't walk the same tree twice, if the user has requested
10933 that we avoid doing so. */
10934 if (pset
&& pset
->add (*tp
))
10937 /* Call the function. */
10939 result
= (*func
) (tp
, &walk_subtrees
, data
);
10941 /* If we found something, return it. */
10945 code
= TREE_CODE (*tp
);
10947 /* Even if we didn't, FUNC may have decided that there was nothing
10948 interesting below this point in the tree. */
10949 if (!walk_subtrees
)
10951 /* But we still need to check our siblings. */
10952 if (code
== TREE_LIST
)
10953 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
10954 else if (code
== OMP_CLAUSE
)
10955 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10962 result
= (*lh
) (tp
, &walk_subtrees
, func
, data
, pset
);
10963 if (result
|| !walk_subtrees
)
10970 case IDENTIFIER_NODE
:
10977 case PLACEHOLDER_EXPR
:
10981 /* None of these have subtrees other than those already walked
10986 WALK_SUBTREE (TREE_VALUE (*tp
));
10987 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
10992 int len
= TREE_VEC_LENGTH (*tp
);
10997 /* Walk all elements but the first. */
10999 WALK_SUBTREE (TREE_VEC_ELT (*tp
, len
));
11001 /* Now walk the first one as a tail call. */
11002 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp
, 0));
11006 WALK_SUBTREE (TREE_REALPART (*tp
));
11007 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp
));
11011 unsigned HOST_WIDE_INT idx
;
11012 constructor_elt
*ce
;
11014 for (idx
= 0; vec_safe_iterate (CONSTRUCTOR_ELTS (*tp
), idx
, &ce
);
11016 WALK_SUBTREE (ce
->value
);
11021 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, 0));
11026 for (decl
= BIND_EXPR_VARS (*tp
); decl
; decl
= DECL_CHAIN (decl
))
11028 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
11029 into declarations that are just mentioned, rather than
11030 declared; they don't really belong to this part of the tree.
11031 And, we can see cycles: the initializer for a declaration
11032 can refer to the declaration itself. */
11033 WALK_SUBTREE (DECL_INITIAL (decl
));
11034 WALK_SUBTREE (DECL_SIZE (decl
));
11035 WALK_SUBTREE (DECL_SIZE_UNIT (decl
));
11037 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp
));
11040 case STATEMENT_LIST
:
11042 tree_stmt_iterator i
;
11043 for (i
= tsi_start (*tp
); !tsi_end_p (i
); tsi_next (&i
))
11044 WALK_SUBTREE (*tsi_stmt_ptr (i
));
11049 switch (OMP_CLAUSE_CODE (*tp
))
11051 case OMP_CLAUSE_PRIVATE
:
11052 case OMP_CLAUSE_SHARED
:
11053 case OMP_CLAUSE_FIRSTPRIVATE
:
11054 case OMP_CLAUSE_COPYIN
:
11055 case OMP_CLAUSE_COPYPRIVATE
:
11056 case OMP_CLAUSE_FINAL
:
11057 case OMP_CLAUSE_IF
:
11058 case OMP_CLAUSE_NUM_THREADS
:
11059 case OMP_CLAUSE_SCHEDULE
:
11060 case OMP_CLAUSE_UNIFORM
:
11061 case OMP_CLAUSE_DEPEND
:
11062 case OMP_CLAUSE_NUM_TEAMS
:
11063 case OMP_CLAUSE_THREAD_LIMIT
:
11064 case OMP_CLAUSE_DEVICE
:
11065 case OMP_CLAUSE_DIST_SCHEDULE
:
11066 case OMP_CLAUSE_SAFELEN
:
11067 case OMP_CLAUSE_SIMDLEN
:
11068 case OMP_CLAUSE__LOOPTEMP_
:
11069 case OMP_CLAUSE__SIMDUID_
:
11070 case OMP_CLAUSE__CILK_FOR_COUNT_
:
11071 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 0));
11074 case OMP_CLAUSE_NOWAIT
:
11075 case OMP_CLAUSE_ORDERED
:
11076 case OMP_CLAUSE_DEFAULT
:
11077 case OMP_CLAUSE_UNTIED
:
11078 case OMP_CLAUSE_MERGEABLE
:
11079 case OMP_CLAUSE_PROC_BIND
:
11080 case OMP_CLAUSE_INBRANCH
:
11081 case OMP_CLAUSE_NOTINBRANCH
:
11082 case OMP_CLAUSE_FOR
:
11083 case OMP_CLAUSE_PARALLEL
:
11084 case OMP_CLAUSE_SECTIONS
:
11085 case OMP_CLAUSE_TASKGROUP
:
11086 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11088 case OMP_CLAUSE_LASTPRIVATE
:
11089 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
11090 WALK_SUBTREE (OMP_CLAUSE_LASTPRIVATE_STMT (*tp
));
11091 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11093 case OMP_CLAUSE_COLLAPSE
:
11096 for (i
= 0; i
< 3; i
++)
11097 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
11098 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11101 case OMP_CLAUSE_LINEAR
:
11102 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
11103 WALK_SUBTREE (OMP_CLAUSE_LINEAR_STEP (*tp
));
11104 WALK_SUBTREE (OMP_CLAUSE_LINEAR_STMT (*tp
));
11105 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11107 case OMP_CLAUSE_ALIGNED
:
11108 case OMP_CLAUSE_FROM
:
11109 case OMP_CLAUSE_TO
:
11110 case OMP_CLAUSE_MAP
:
11111 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
11112 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 1));
11113 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11115 case OMP_CLAUSE_REDUCTION
:
11118 for (i
= 0; i
< 4; i
++)
11119 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
11120 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11124 gcc_unreachable ();
11132 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
11133 But, we only want to walk once. */
11134 len
= (TREE_OPERAND (*tp
, 3) == TREE_OPERAND (*tp
, 1)) ? 2 : 3;
11135 for (i
= 0; i
< len
; ++i
)
11136 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
11137 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
));
11141 /* If this is a TYPE_DECL, walk into the fields of the type that it's
11142 defining. We only want to walk into these fields of a type in this
11143 case and not in the general case of a mere reference to the type.
11145 The criterion is as follows: if the field can be an expression, it
11146 must be walked only here. This should be in keeping with the fields
11147 that are directly gimplified in gimplify_type_sizes in order for the
11148 mark/copy-if-shared/unmark machinery of the gimplifier to work with
11149 variable-sized types.
11151 Note that DECLs get walked as part of processing the BIND_EXPR. */
11152 if (TREE_CODE (DECL_EXPR_DECL (*tp
)) == TYPE_DECL
)
11154 tree
*type_p
= &TREE_TYPE (DECL_EXPR_DECL (*tp
));
11155 if (TREE_CODE (*type_p
) == ERROR_MARK
)
11158 /* Call the function for the type. See if it returns anything or
11159 doesn't want us to continue. If we are to continue, walk both
11160 the normal fields and those for the declaration case. */
11161 result
= (*func
) (type_p
, &walk_subtrees
, data
);
11162 if (result
|| !walk_subtrees
)
11165 /* But do not walk a pointed-to type since it may itself need to
11166 be walked in the declaration case if it isn't anonymous. */
11167 if (!POINTER_TYPE_P (*type_p
))
11169 result
= walk_type_fields (*type_p
, func
, data
, pset
, lh
);
11174 /* If this is a record type, also walk the fields. */
11175 if (RECORD_OR_UNION_TYPE_P (*type_p
))
11179 for (field
= TYPE_FIELDS (*type_p
); field
;
11180 field
= DECL_CHAIN (field
))
11182 /* We'd like to look at the type of the field, but we can
11183 easily get infinite recursion. So assume it's pointed
11184 to elsewhere in the tree. Also, ignore things that
11186 if (TREE_CODE (field
) != FIELD_DECL
)
11189 WALK_SUBTREE (DECL_FIELD_OFFSET (field
));
11190 WALK_SUBTREE (DECL_SIZE (field
));
11191 WALK_SUBTREE (DECL_SIZE_UNIT (field
));
11192 if (TREE_CODE (*type_p
) == QUAL_UNION_TYPE
)
11193 WALK_SUBTREE (DECL_QUALIFIER (field
));
11197 /* Same for scalar types. */
11198 else if (TREE_CODE (*type_p
) == BOOLEAN_TYPE
11199 || TREE_CODE (*type_p
) == ENUMERAL_TYPE
11200 || TREE_CODE (*type_p
) == INTEGER_TYPE
11201 || TREE_CODE (*type_p
) == FIXED_POINT_TYPE
11202 || TREE_CODE (*type_p
) == REAL_TYPE
)
11204 WALK_SUBTREE (TYPE_MIN_VALUE (*type_p
));
11205 WALK_SUBTREE (TYPE_MAX_VALUE (*type_p
));
11208 WALK_SUBTREE (TYPE_SIZE (*type_p
));
11209 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p
));
11214 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code
)))
11218 /* Walk over all the sub-trees of this operand. */
11219 len
= TREE_OPERAND_LENGTH (*tp
);
11221 /* Go through the subtrees. We need to do this in forward order so
11222 that the scope of a FOR_EXPR is handled properly. */
11225 for (i
= 0; i
< len
- 1; ++i
)
11226 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
11227 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
- 1));
11230 /* If this is a type, walk the needed fields in the type. */
11231 else if (TYPE_P (*tp
))
11232 return walk_type_fields (*tp
, func
, data
, pset
, lh
);
11236 /* We didn't find what we were looking for. */
11239 #undef WALK_SUBTREE_TAIL
11241 #undef WALK_SUBTREE
11243 /* Like walk_tree, but does not walk duplicate nodes more than once. */
11246 walk_tree_without_duplicates_1 (tree
*tp
, walk_tree_fn func
, void *data
,
11251 hash_set
<tree
> pset
;
11252 result
= walk_tree_1 (tp
, func
, data
, &pset
, lh
);
11258 tree_block (tree t
)
11260 const enum tree_code_class c
= TREE_CODE_CLASS (TREE_CODE (t
));
11262 if (IS_EXPR_CODE_CLASS (c
))
11263 return LOCATION_BLOCK (t
->exp
.locus
);
11264 gcc_unreachable ();
11269 tree_set_block (tree t
, tree b
)
11271 const enum tree_code_class c
= TREE_CODE_CLASS (TREE_CODE (t
));
11273 if (IS_EXPR_CODE_CLASS (c
))
11276 t
->exp
.locus
= COMBINE_LOCATION_DATA (line_table
, t
->exp
.locus
, b
);
11278 t
->exp
.locus
= LOCATION_LOCUS (t
->exp
.locus
);
11281 gcc_unreachable ();
11284 /* Create a nameless artificial label and put it in the current
11285 function context. The label has a location of LOC. Returns the
11286 newly created label. */
11289 create_artificial_label (location_t loc
)
11291 tree lab
= build_decl (loc
,
11292 LABEL_DECL
, NULL_TREE
, void_type_node
);
11294 DECL_ARTIFICIAL (lab
) = 1;
11295 DECL_IGNORED_P (lab
) = 1;
11296 DECL_CONTEXT (lab
) = current_function_decl
;
11300 /* Given a tree, try to return a useful variable name that we can use
11301 to prefix a temporary that is being assigned the value of the tree.
11302 I.E. given <temp> = &A, return A. */
11307 tree stripped_decl
;
11310 STRIP_NOPS (stripped_decl
);
11311 if (DECL_P (stripped_decl
) && DECL_NAME (stripped_decl
))
11312 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl
));
11313 else if (TREE_CODE (stripped_decl
) == SSA_NAME
)
11315 tree name
= SSA_NAME_IDENTIFIER (stripped_decl
);
11318 return IDENTIFIER_POINTER (name
);
11322 switch (TREE_CODE (stripped_decl
))
11325 return get_name (TREE_OPERAND (stripped_decl
, 0));
11332 /* Return true if TYPE has a variable argument list. */
11335 stdarg_p (const_tree fntype
)
11337 function_args_iterator args_iter
;
11338 tree n
= NULL_TREE
, t
;
11343 FOREACH_FUNCTION_ARGS (fntype
, t
, args_iter
)
11348 return n
!= NULL_TREE
&& n
!= void_type_node
;
11351 /* Return true if TYPE has a prototype. */
11354 prototype_p (tree fntype
)
11358 gcc_assert (fntype
!= NULL_TREE
);
11360 t
= TYPE_ARG_TYPES (fntype
);
11361 return (t
!= NULL_TREE
);
11364 /* If BLOCK is inlined from an __attribute__((__artificial__))
11365 routine, return pointer to location from where it has been
11368 block_nonartificial_location (tree block
)
11370 location_t
*ret
= NULL
;
11372 while (block
&& TREE_CODE (block
) == BLOCK
11373 && BLOCK_ABSTRACT_ORIGIN (block
))
11375 tree ao
= BLOCK_ABSTRACT_ORIGIN (block
);
11377 while (TREE_CODE (ao
) == BLOCK
11378 && BLOCK_ABSTRACT_ORIGIN (ao
)
11379 && BLOCK_ABSTRACT_ORIGIN (ao
) != ao
)
11380 ao
= BLOCK_ABSTRACT_ORIGIN (ao
);
11382 if (TREE_CODE (ao
) == FUNCTION_DECL
)
11384 /* If AO is an artificial inline, point RET to the
11385 call site locus at which it has been inlined and continue
11386 the loop, in case AO's caller is also an artificial
11388 if (DECL_DECLARED_INLINE_P (ao
)
11389 && lookup_attribute ("artificial", DECL_ATTRIBUTES (ao
)))
11390 ret
= &BLOCK_SOURCE_LOCATION (block
);
11394 else if (TREE_CODE (ao
) != BLOCK
)
11397 block
= BLOCK_SUPERCONTEXT (block
);
11403 /* If EXP is inlined from an __attribute__((__artificial__))
11404 function, return the location of the original call expression. */
11407 tree_nonartificial_location (tree exp
)
11409 location_t
*loc
= block_nonartificial_location (TREE_BLOCK (exp
));
11414 return EXPR_LOCATION (exp
);
11418 /* These are the hash table functions for the hash table of OPTIMIZATION_NODEq
11421 /* Return the hash code code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
11424 cl_option_hash_hash (const void *x
)
11426 const_tree
const t
= (const_tree
) x
;
11430 hashval_t hash
= 0;
11432 if (TREE_CODE (t
) == OPTIMIZATION_NODE
)
11434 p
= (const char *)TREE_OPTIMIZATION (t
);
11435 len
= sizeof (struct cl_optimization
);
11438 else if (TREE_CODE (t
) == TARGET_OPTION_NODE
)
11440 p
= (const char *)TREE_TARGET_OPTION (t
);
11441 len
= sizeof (struct cl_target_option
);
11445 gcc_unreachable ();
11447 /* assume most opt flags are just 0/1, some are 2-3, and a few might be
11449 for (i
= 0; i
< len
; i
++)
11451 hash
= (hash
<< 4) ^ ((i
<< 2) | p
[i
]);
11456 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
11457 TARGET_OPTION tree node) is the same as that given by *Y, which is the
11461 cl_option_hash_eq (const void *x
, const void *y
)
11463 const_tree
const xt
= (const_tree
) x
;
11464 const_tree
const yt
= (const_tree
) y
;
11469 if (TREE_CODE (xt
) != TREE_CODE (yt
))
11472 if (TREE_CODE (xt
) == OPTIMIZATION_NODE
)
11474 xp
= (const char *)TREE_OPTIMIZATION (xt
);
11475 yp
= (const char *)TREE_OPTIMIZATION (yt
);
11476 len
= sizeof (struct cl_optimization
);
11479 else if (TREE_CODE (xt
) == TARGET_OPTION_NODE
)
11481 xp
= (const char *)TREE_TARGET_OPTION (xt
);
11482 yp
= (const char *)TREE_TARGET_OPTION (yt
);
11483 len
= sizeof (struct cl_target_option
);
11487 gcc_unreachable ();
11489 return (memcmp (xp
, yp
, len
) == 0);
11492 /* Build an OPTIMIZATION_NODE based on the options in OPTS. */
11495 build_optimization_node (struct gcc_options
*opts
)
11500 /* Use the cache of optimization nodes. */
11502 cl_optimization_save (TREE_OPTIMIZATION (cl_optimization_node
),
11505 slot
= htab_find_slot (cl_option_hash_table
, cl_optimization_node
, INSERT
);
11509 /* Insert this one into the hash table. */
11510 t
= cl_optimization_node
;
11513 /* Make a new node for next time round. */
11514 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
11520 /* Build a TARGET_OPTION_NODE based on the options in OPTS. */
11523 build_target_option_node (struct gcc_options
*opts
)
11528 /* Use the cache of optimization nodes. */
11530 cl_target_option_save (TREE_TARGET_OPTION (cl_target_option_node
),
11533 slot
= htab_find_slot (cl_option_hash_table
, cl_target_option_node
, INSERT
);
11537 /* Insert this one into the hash table. */
11538 t
= cl_target_option_node
;
11541 /* Make a new node for next time round. */
11542 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
11548 /* Reset TREE_TARGET_GLOBALS cache for TARGET_OPTION_NODE.
11549 Called through htab_traverse. */
11552 prepare_target_option_node_for_pch (void **slot
, void *)
11554 tree node
= (tree
) *slot
;
11555 if (TREE_CODE (node
) == TARGET_OPTION_NODE
)
11556 TREE_TARGET_GLOBALS (node
) = NULL
;
11560 /* Clear TREE_TARGET_GLOBALS of all TARGET_OPTION_NODE trees,
11561 so that they aren't saved during PCH writing. */
11564 prepare_target_option_nodes_for_pch (void)
11566 htab_traverse (cl_option_hash_table
, prepare_target_option_node_for_pch
,
11570 /* Determine the "ultimate origin" of a block. The block may be an inlined
11571 instance of an inlined instance of a block which is local to an inline
11572 function, so we have to trace all of the way back through the origin chain
11573 to find out what sort of node actually served as the original seed for the
11577 block_ultimate_origin (const_tree block
)
11579 tree immediate_origin
= BLOCK_ABSTRACT_ORIGIN (block
);
11581 /* output_inline_function sets BLOCK_ABSTRACT_ORIGIN for all the
11582 nodes in the function to point to themselves; ignore that if
11583 we're trying to output the abstract instance of this function. */
11584 if (BLOCK_ABSTRACT (block
) && immediate_origin
== block
)
11587 if (immediate_origin
== NULL_TREE
)
11592 tree lookahead
= immediate_origin
;
11596 ret_val
= lookahead
;
11597 lookahead
= (TREE_CODE (ret_val
) == BLOCK
11598 ? BLOCK_ABSTRACT_ORIGIN (ret_val
) : NULL
);
11600 while (lookahead
!= NULL
&& lookahead
!= ret_val
);
11602 /* The block's abstract origin chain may not be the *ultimate* origin of
11603 the block. It could lead to a DECL that has an abstract origin set.
11604 If so, we want that DECL's abstract origin (which is what DECL_ORIGIN
11605 will give us if it has one). Note that DECL's abstract origins are
11606 supposed to be the most distant ancestor (or so decl_ultimate_origin
11607 claims), so we don't need to loop following the DECL origins. */
11608 if (DECL_P (ret_val
))
11609 return DECL_ORIGIN (ret_val
);
11615 /* Return true iff conversion in EXP generates no instruction. Mark
11616 it inline so that we fully inline into the stripping functions even
11617 though we have two uses of this function. */
11620 tree_nop_conversion (const_tree exp
)
11622 tree outer_type
, inner_type
;
11624 if (!CONVERT_EXPR_P (exp
)
11625 && TREE_CODE (exp
) != NON_LVALUE_EXPR
)
11627 if (TREE_OPERAND (exp
, 0) == error_mark_node
)
11630 outer_type
= TREE_TYPE (exp
);
11631 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
11636 /* Use precision rather then machine mode when we can, which gives
11637 the correct answer even for submode (bit-field) types. */
11638 if ((INTEGRAL_TYPE_P (outer_type
)
11639 || POINTER_TYPE_P (outer_type
)
11640 || TREE_CODE (outer_type
) == OFFSET_TYPE
)
11641 && (INTEGRAL_TYPE_P (inner_type
)
11642 || POINTER_TYPE_P (inner_type
)
11643 || TREE_CODE (inner_type
) == OFFSET_TYPE
))
11644 return TYPE_PRECISION (outer_type
) == TYPE_PRECISION (inner_type
);
11646 /* Otherwise fall back on comparing machine modes (e.g. for
11647 aggregate types, floats). */
11648 return TYPE_MODE (outer_type
) == TYPE_MODE (inner_type
);
11651 /* Return true iff conversion in EXP generates no instruction. Don't
11652 consider conversions changing the signedness. */
11655 tree_sign_nop_conversion (const_tree exp
)
11657 tree outer_type
, inner_type
;
11659 if (!tree_nop_conversion (exp
))
11662 outer_type
= TREE_TYPE (exp
);
11663 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
11665 return (TYPE_UNSIGNED (outer_type
) == TYPE_UNSIGNED (inner_type
)
11666 && POINTER_TYPE_P (outer_type
) == POINTER_TYPE_P (inner_type
));
11669 /* Strip conversions from EXP according to tree_nop_conversion and
11670 return the resulting expression. */
11673 tree_strip_nop_conversions (tree exp
)
11675 while (tree_nop_conversion (exp
))
11676 exp
= TREE_OPERAND (exp
, 0);
11680 /* Strip conversions from EXP according to tree_sign_nop_conversion
11681 and return the resulting expression. */
11684 tree_strip_sign_nop_conversions (tree exp
)
11686 while (tree_sign_nop_conversion (exp
))
11687 exp
= TREE_OPERAND (exp
, 0);
11691 /* Avoid any floating point extensions from EXP. */
11693 strip_float_extensions (tree exp
)
11695 tree sub
, expt
, subt
;
11697 /* For floating point constant look up the narrowest type that can hold
11698 it properly and handle it like (type)(narrowest_type)constant.
11699 This way we can optimize for instance a=a*2.0 where "a" is float
11700 but 2.0 is double constant. */
11701 if (TREE_CODE (exp
) == REAL_CST
&& !DECIMAL_FLOAT_TYPE_P (TREE_TYPE (exp
)))
11703 REAL_VALUE_TYPE orig
;
11706 orig
= TREE_REAL_CST (exp
);
11707 if (TYPE_PRECISION (TREE_TYPE (exp
)) > TYPE_PRECISION (float_type_node
)
11708 && exact_real_truncate (TYPE_MODE (float_type_node
), &orig
))
11709 type
= float_type_node
;
11710 else if (TYPE_PRECISION (TREE_TYPE (exp
))
11711 > TYPE_PRECISION (double_type_node
)
11712 && exact_real_truncate (TYPE_MODE (double_type_node
), &orig
))
11713 type
= double_type_node
;
11715 return build_real (type
, real_value_truncate (TYPE_MODE (type
), orig
));
11718 if (!CONVERT_EXPR_P (exp
))
11721 sub
= TREE_OPERAND (exp
, 0);
11722 subt
= TREE_TYPE (sub
);
11723 expt
= TREE_TYPE (exp
);
11725 if (!FLOAT_TYPE_P (subt
))
11728 if (DECIMAL_FLOAT_TYPE_P (expt
) != DECIMAL_FLOAT_TYPE_P (subt
))
11731 if (TYPE_PRECISION (subt
) > TYPE_PRECISION (expt
))
11734 return strip_float_extensions (sub
);
11737 /* Strip out all handled components that produce invariant
11741 strip_invariant_refs (const_tree op
)
11743 while (handled_component_p (op
))
11745 switch (TREE_CODE (op
))
11748 case ARRAY_RANGE_REF
:
11749 if (!is_gimple_constant (TREE_OPERAND (op
, 1))
11750 || TREE_OPERAND (op
, 2) != NULL_TREE
11751 || TREE_OPERAND (op
, 3) != NULL_TREE
)
11755 case COMPONENT_REF
:
11756 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
11762 op
= TREE_OPERAND (op
, 0);
11768 static GTY(()) tree gcc_eh_personality_decl
;
11770 /* Return the GCC personality function decl. */
11773 lhd_gcc_personality (void)
11775 if (!gcc_eh_personality_decl
)
11776 gcc_eh_personality_decl
= build_personality_function ("gcc");
11777 return gcc_eh_personality_decl
;
11780 /* TARGET is a call target of GIMPLE call statement
11781 (obtained by gimple_call_fn). Return true if it is
11782 OBJ_TYPE_REF representing an virtual call of C++ method.
11783 (As opposed to OBJ_TYPE_REF representing objc calls
11784 through a cast where middle-end devirtualization machinery
11788 virtual_method_call_p (tree target
)
11790 if (TREE_CODE (target
) != OBJ_TYPE_REF
)
11792 target
= TREE_TYPE (target
);
11793 gcc_checking_assert (TREE_CODE (target
) == POINTER_TYPE
);
11794 target
= TREE_TYPE (target
);
11795 if (TREE_CODE (target
) == FUNCTION_TYPE
)
11797 gcc_checking_assert (TREE_CODE (target
) == METHOD_TYPE
);
11801 /* REF is OBJ_TYPE_REF, return the class the ref corresponds to. */
11804 obj_type_ref_class (tree ref
)
11806 gcc_checking_assert (TREE_CODE (ref
) == OBJ_TYPE_REF
);
11807 ref
= TREE_TYPE (ref
);
11808 gcc_checking_assert (TREE_CODE (ref
) == POINTER_TYPE
);
11809 ref
= TREE_TYPE (ref
);
11810 /* We look for type THIS points to. ObjC also builds
11811 OBJ_TYPE_REF with non-method calls, Their first parameter
11812 ID however also corresponds to class type. */
11813 gcc_checking_assert (TREE_CODE (ref
) == METHOD_TYPE
11814 || TREE_CODE (ref
) == FUNCTION_TYPE
);
11815 ref
= TREE_VALUE (TYPE_ARG_TYPES (ref
));
11816 gcc_checking_assert (TREE_CODE (ref
) == POINTER_TYPE
);
11817 return TREE_TYPE (ref
);
11820 /* Return true if T is in anonymous namespace. */
11823 type_in_anonymous_namespace_p (const_tree t
)
11825 /* TREE_PUBLIC of TYPE_STUB_DECL may not be properly set for
11826 bulitin types; those have CONTEXT NULL. */
11827 if (!TYPE_CONTEXT (t
))
11829 return (TYPE_STUB_DECL (t
) && !TREE_PUBLIC (TYPE_STUB_DECL (t
)));
11832 /* Try to find a base info of BINFO that would have its field decl at offset
11833 OFFSET within the BINFO type and which is of EXPECTED_TYPE. If it can be
11834 found, return, otherwise return NULL_TREE. */
11837 get_binfo_at_offset (tree binfo
, HOST_WIDE_INT offset
, tree expected_type
)
11839 tree type
= BINFO_TYPE (binfo
);
11843 HOST_WIDE_INT pos
, size
;
11847 if (types_same_for_odr (type
, expected_type
))
11852 for (fld
= TYPE_FIELDS (type
); fld
; fld
= DECL_CHAIN (fld
))
11854 if (TREE_CODE (fld
) != FIELD_DECL
)
11857 pos
= int_bit_position (fld
);
11858 size
= tree_to_uhwi (DECL_SIZE (fld
));
11859 if (pos
<= offset
&& (pos
+ size
) > offset
)
11862 if (!fld
|| TREE_CODE (TREE_TYPE (fld
)) != RECORD_TYPE
)
11865 if (!DECL_ARTIFICIAL (fld
))
11867 binfo
= TYPE_BINFO (TREE_TYPE (fld
));
11871 /* Offset 0 indicates the primary base, whose vtable contents are
11872 represented in the binfo for the derived class. */
11873 else if (offset
!= 0)
11875 tree base_binfo
, binfo2
= binfo
;
11877 /* Find BINFO corresponding to FLD. This is bit harder
11878 by a fact that in virtual inheritance we may need to walk down
11879 the non-virtual inheritance chain. */
11882 tree containing_binfo
= NULL
, found_binfo
= NULL
;
11883 for (i
= 0; BINFO_BASE_ITERATE (binfo2
, i
, base_binfo
); i
++)
11884 if (types_same_for_odr (TREE_TYPE (base_binfo
), TREE_TYPE (fld
)))
11886 found_binfo
= base_binfo
;
11890 if ((tree_to_shwi (BINFO_OFFSET (base_binfo
))
11891 - tree_to_shwi (BINFO_OFFSET (binfo
)))
11892 * BITS_PER_UNIT
< pos
11893 /* Rule out types with no virtual methods or we can get confused
11894 here by zero sized bases. */
11895 && BINFO_VTABLE (TYPE_BINFO (BINFO_TYPE (base_binfo
)))
11896 && (!containing_binfo
11897 || (tree_to_shwi (BINFO_OFFSET (containing_binfo
))
11898 < tree_to_shwi (BINFO_OFFSET (base_binfo
)))))
11899 containing_binfo
= base_binfo
;
11902 binfo
= found_binfo
;
11905 if (!containing_binfo
)
11907 binfo2
= containing_binfo
;
11911 type
= TREE_TYPE (fld
);
11916 /* Returns true if X is a typedef decl. */
11919 is_typedef_decl (tree x
)
11921 return (x
&& TREE_CODE (x
) == TYPE_DECL
11922 && DECL_ORIGINAL_TYPE (x
) != NULL_TREE
);
11925 /* Returns true iff TYPE is a type variant created for a typedef. */
11928 typedef_variant_p (tree type
)
11930 return is_typedef_decl (TYPE_NAME (type
));
11933 /* Warn about a use of an identifier which was marked deprecated. */
11935 warn_deprecated_use (tree node
, tree attr
)
11939 if (node
== 0 || !warn_deprecated_decl
)
11945 attr
= DECL_ATTRIBUTES (node
);
11946 else if (TYPE_P (node
))
11948 tree decl
= TYPE_STUB_DECL (node
);
11950 attr
= lookup_attribute ("deprecated",
11951 TYPE_ATTRIBUTES (TREE_TYPE (decl
)));
11956 attr
= lookup_attribute ("deprecated", attr
);
11959 msg
= TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr
)));
11965 expanded_location xloc
= expand_location (DECL_SOURCE_LOCATION (node
));
11967 warning (OPT_Wdeprecated_declarations
,
11968 "%qD is deprecated (declared at %r%s:%d%R): %s",
11969 node
, "locus", xloc
.file
, xloc
.line
, msg
);
11971 warning (OPT_Wdeprecated_declarations
,
11972 "%qD is deprecated (declared at %r%s:%d%R)",
11973 node
, "locus", xloc
.file
, xloc
.line
);
11975 else if (TYPE_P (node
))
11977 tree what
= NULL_TREE
;
11978 tree decl
= TYPE_STUB_DECL (node
);
11980 if (TYPE_NAME (node
))
11982 if (TREE_CODE (TYPE_NAME (node
)) == IDENTIFIER_NODE
)
11983 what
= TYPE_NAME (node
);
11984 else if (TREE_CODE (TYPE_NAME (node
)) == TYPE_DECL
11985 && DECL_NAME (TYPE_NAME (node
)))
11986 what
= DECL_NAME (TYPE_NAME (node
));
11991 expanded_location xloc
11992 = expand_location (DECL_SOURCE_LOCATION (decl
));
11996 warning (OPT_Wdeprecated_declarations
,
11997 "%qE is deprecated (declared at %r%s:%d%R): %s",
11998 what
, "locus", xloc
.file
, xloc
.line
, msg
);
12000 warning (OPT_Wdeprecated_declarations
,
12001 "%qE is deprecated (declared at %r%s:%d%R)",
12002 what
, "locus", xloc
.file
, xloc
.line
);
12007 warning (OPT_Wdeprecated_declarations
,
12008 "type is deprecated (declared at %r%s:%d%R): %s",
12009 "locus", xloc
.file
, xloc
.line
, msg
);
12011 warning (OPT_Wdeprecated_declarations
,
12012 "type is deprecated (declared at %r%s:%d%R)",
12013 "locus", xloc
.file
, xloc
.line
);
12021 warning (OPT_Wdeprecated_declarations
, "%qE is deprecated: %s",
12024 warning (OPT_Wdeprecated_declarations
, "%qE is deprecated", what
);
12029 warning (OPT_Wdeprecated_declarations
, "type is deprecated: %s",
12032 warning (OPT_Wdeprecated_declarations
, "type is deprecated");
12038 /* Return true if REF has a COMPONENT_REF with a bit-field field declaration
12039 somewhere in it. */
12042 contains_bitfld_component_ref_p (const_tree ref
)
12044 while (handled_component_p (ref
))
12046 if (TREE_CODE (ref
) == COMPONENT_REF
12047 && DECL_BIT_FIELD (TREE_OPERAND (ref
, 1)))
12049 ref
= TREE_OPERAND (ref
, 0);
12055 /* Try to determine whether a TRY_CATCH expression can fall through.
12056 This is a subroutine of block_may_fallthru. */
12059 try_catch_may_fallthru (const_tree stmt
)
12061 tree_stmt_iterator i
;
12063 /* If the TRY block can fall through, the whole TRY_CATCH can
12065 if (block_may_fallthru (TREE_OPERAND (stmt
, 0)))
12068 i
= tsi_start (TREE_OPERAND (stmt
, 1));
12069 switch (TREE_CODE (tsi_stmt (i
)))
12072 /* We expect to see a sequence of CATCH_EXPR trees, each with a
12073 catch expression and a body. The whole TRY_CATCH may fall
12074 through iff any of the catch bodies falls through. */
12075 for (; !tsi_end_p (i
); tsi_next (&i
))
12077 if (block_may_fallthru (CATCH_BODY (tsi_stmt (i
))))
12082 case EH_FILTER_EXPR
:
12083 /* The exception filter expression only matters if there is an
12084 exception. If the exception does not match EH_FILTER_TYPES,
12085 we will execute EH_FILTER_FAILURE, and we will fall through
12086 if that falls through. If the exception does match
12087 EH_FILTER_TYPES, the stack unwinder will continue up the
12088 stack, so we will not fall through. We don't know whether we
12089 will throw an exception which matches EH_FILTER_TYPES or not,
12090 so we just ignore EH_FILTER_TYPES and assume that we might
12091 throw an exception which doesn't match. */
12092 return block_may_fallthru (EH_FILTER_FAILURE (tsi_stmt (i
)));
12095 /* This case represents statements to be executed when an
12096 exception occurs. Those statements are implicitly followed
12097 by a RESX statement to resume execution after the exception.
12098 So in this case the TRY_CATCH never falls through. */
12103 /* Try to determine if we can fall out of the bottom of BLOCK. This guess
12104 need not be 100% accurate; simply be conservative and return true if we
12105 don't know. This is used only to avoid stupidly generating extra code.
12106 If we're wrong, we'll just delete the extra code later. */
12109 block_may_fallthru (const_tree block
)
12111 /* This CONST_CAST is okay because expr_last returns its argument
12112 unmodified and we assign it to a const_tree. */
12113 const_tree stmt
= expr_last (CONST_CAST_TREE (block
));
12115 switch (stmt
? TREE_CODE (stmt
) : ERROR_MARK
)
12119 /* Easy cases. If the last statement of the block implies
12120 control transfer, then we can't fall through. */
12124 /* If SWITCH_LABELS is set, this is lowered, and represents a
12125 branch to a selected label and hence can not fall through.
12126 Otherwise SWITCH_BODY is set, and the switch can fall
12128 return SWITCH_LABELS (stmt
) == NULL_TREE
;
12131 if (block_may_fallthru (COND_EXPR_THEN (stmt
)))
12133 return block_may_fallthru (COND_EXPR_ELSE (stmt
));
12136 return block_may_fallthru (BIND_EXPR_BODY (stmt
));
12138 case TRY_CATCH_EXPR
:
12139 return try_catch_may_fallthru (stmt
);
12141 case TRY_FINALLY_EXPR
:
12142 /* The finally clause is always executed after the try clause,
12143 so if it does not fall through, then the try-finally will not
12144 fall through. Otherwise, if the try clause does not fall
12145 through, then when the finally clause falls through it will
12146 resume execution wherever the try clause was going. So the
12147 whole try-finally will only fall through if both the try
12148 clause and the finally clause fall through. */
12149 return (block_may_fallthru (TREE_OPERAND (stmt
, 0))
12150 && block_may_fallthru (TREE_OPERAND (stmt
, 1)));
12153 if (TREE_CODE (TREE_OPERAND (stmt
, 1)) == CALL_EXPR
)
12154 stmt
= TREE_OPERAND (stmt
, 1);
12160 /* Functions that do not return do not fall through. */
12161 return (call_expr_flags (stmt
) & ECF_NORETURN
) == 0;
12163 case CLEANUP_POINT_EXPR
:
12164 return block_may_fallthru (TREE_OPERAND (stmt
, 0));
12167 return block_may_fallthru (TREE_OPERAND (stmt
, 1));
12173 return lang_hooks
.block_may_fallthru (stmt
);
12177 /* True if we are using EH to handle cleanups. */
12178 static bool using_eh_for_cleanups_flag
= false;
12180 /* This routine is called from front ends to indicate eh should be used for
12183 using_eh_for_cleanups (void)
12185 using_eh_for_cleanups_flag
= true;
12188 /* Query whether EH is used for cleanups. */
12190 using_eh_for_cleanups_p (void)
12192 return using_eh_for_cleanups_flag
;
12195 /* Wrapper for tree_code_name to ensure that tree code is valid */
12197 get_tree_code_name (enum tree_code code
)
12199 const char *invalid
= "<invalid tree code>";
12201 if (code
>= MAX_TREE_CODES
)
12204 return tree_code_name
[code
];
12207 /* Drops the TREE_OVERFLOW flag from T. */
12210 drop_tree_overflow (tree t
)
12212 gcc_checking_assert (TREE_OVERFLOW (t
));
12214 /* For tree codes with a sharing machinery re-build the result. */
12215 if (TREE_CODE (t
) == INTEGER_CST
)
12216 return wide_int_to_tree (TREE_TYPE (t
), t
);
12218 /* Otherwise, as all tcc_constants are possibly shared, copy the node
12219 and drop the flag. */
12221 TREE_OVERFLOW (t
) = 0;
12225 /* Given a memory reference expression T, return its base address.
12226 The base address of a memory reference expression is the main
12227 object being referenced. For instance, the base address for
12228 'array[i].fld[j]' is 'array'. You can think of this as stripping
12229 away the offset part from a memory address.
12231 This function calls handled_component_p to strip away all the inner
12232 parts of the memory reference until it reaches the base object. */
12235 get_base_address (tree t
)
12237 while (handled_component_p (t
))
12238 t
= TREE_OPERAND (t
, 0);
12240 if ((TREE_CODE (t
) == MEM_REF
12241 || TREE_CODE (t
) == TARGET_MEM_REF
)
12242 && TREE_CODE (TREE_OPERAND (t
, 0)) == ADDR_EXPR
)
12243 t
= TREE_OPERAND (TREE_OPERAND (t
, 0), 0);
12245 /* ??? Either the alias oracle or all callers need to properly deal
12246 with WITH_SIZE_EXPRs before we can look through those. */
12247 if (TREE_CODE (t
) == WITH_SIZE_EXPR
)
12253 #include "gt-tree.h"