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 */
45 #include "filenames.h"
48 #include "common/common-target.h"
49 #include "langhooks.h"
50 #include "tree-inline.h"
51 #include "tree-iterator.h"
52 #include "basic-block.h"
54 #include "pointer-set.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"
80 /* Tree code classes. */
82 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) TYPE,
83 #define END_OF_BASE_TREE_CODES tcc_exceptional,
85 const enum tree_code_class tree_code_type
[] = {
86 #include "all-tree.def"
90 #undef END_OF_BASE_TREE_CODES
92 /* Table indexed by tree code giving number of expression
93 operands beyond the fixed part of the node structure.
94 Not used for types or decls. */
96 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) LENGTH,
97 #define END_OF_BASE_TREE_CODES 0,
99 const unsigned char tree_code_length
[] = {
100 #include "all-tree.def"
104 #undef END_OF_BASE_TREE_CODES
106 /* Names of tree components.
107 Used for printing out the tree and error messages. */
108 #define DEFTREECODE(SYM, NAME, TYPE, LEN) NAME,
109 #define END_OF_BASE_TREE_CODES "@dummy",
111 static const char *const tree_code_name
[] = {
112 #include "all-tree.def"
116 #undef END_OF_BASE_TREE_CODES
118 /* Each tree code class has an associated string representation.
119 These must correspond to the tree_code_class entries. */
121 const char *const tree_code_class_strings
[] =
136 /* obstack.[ch] explicitly declined to prototype this. */
137 extern int _obstack_allocated_p (struct obstack
*h
, void *obj
);
139 /* Statistics-gathering stuff. */
141 static int tree_code_counts
[MAX_TREE_CODES
];
142 int tree_node_counts
[(int) all_kinds
];
143 int tree_node_sizes
[(int) all_kinds
];
145 /* Keep in sync with tree.h:enum tree_node_kind. */
146 static const char * const tree_node_kind_names
[] = {
165 /* Unique id for next decl created. */
166 static GTY(()) int next_decl_uid
;
167 /* Unique id for next type created. */
168 static GTY(()) int next_type_uid
= 1;
169 /* Unique id for next debug decl created. Use negative numbers,
170 to catch erroneous uses. */
171 static GTY(()) int next_debug_decl_uid
;
173 /* Since we cannot rehash a type after it is in the table, we have to
174 keep the hash code. */
176 struct GTY(()) type_hash
{
181 /* Initial size of the hash table (rounded to next prime). */
182 #define TYPE_HASH_INITIAL_SIZE 1000
184 /* Now here is the hash table. When recording a type, it is added to
185 the slot whose index is the hash code. Note that the hash table is
186 used for several kinds of types (function types, array types and
187 array index range types, for now). While all these live in the
188 same table, they are completely independent, and the hash code is
189 computed differently for each of these. */
191 static GTY ((if_marked ("type_hash_marked_p"), param_is (struct type_hash
)))
192 htab_t type_hash_table
;
194 /* Hash table and temporary node for larger integer const values. */
195 static GTY (()) tree int_cst_node
;
196 static GTY ((if_marked ("ggc_marked_p"), param_is (union tree_node
)))
197 htab_t int_cst_hash_table
;
199 /* Hash table for optimization flags and target option flags. Use the same
200 hash table for both sets of options. Nodes for building the current
201 optimization and target option nodes. The assumption is most of the time
202 the options created will already be in the hash table, so we avoid
203 allocating and freeing up a node repeatably. */
204 static GTY (()) tree cl_optimization_node
;
205 static GTY (()) tree cl_target_option_node
;
206 static GTY ((if_marked ("ggc_marked_p"), param_is (union tree_node
)))
207 htab_t cl_option_hash_table
;
209 /* General tree->tree mapping structure for use in hash tables. */
212 static GTY ((if_marked ("tree_decl_map_marked_p"), param_is (struct tree_decl_map
)))
213 htab_t debug_expr_for_decl
;
215 static GTY ((if_marked ("tree_decl_map_marked_p"), param_is (struct tree_decl_map
)))
216 htab_t value_expr_for_decl
;
218 static GTY ((if_marked ("tree_vec_map_marked_p"), param_is (struct tree_vec_map
)))
219 htab_t debug_args_for_decl
;
221 static GTY ((if_marked ("tree_priority_map_marked_p"),
222 param_is (struct tree_priority_map
)))
223 htab_t init_priority_for_decl
;
225 static void set_type_quals (tree
, int);
226 static int type_hash_eq (const void *, const void *);
227 static hashval_t
type_hash_hash (const void *);
228 static hashval_t
int_cst_hash_hash (const void *);
229 static int int_cst_hash_eq (const void *, const void *);
230 static hashval_t
cl_option_hash_hash (const void *);
231 static int cl_option_hash_eq (const void *, const void *);
232 static void print_type_hash_statistics (void);
233 static void print_debug_expr_statistics (void);
234 static void print_value_expr_statistics (void);
235 static int type_hash_marked_p (const void *);
236 static unsigned int type_hash_list (const_tree
, hashval_t
);
237 static unsigned int attribute_hash_list (const_tree
, hashval_t
);
238 static bool decls_same_for_odr (tree decl1
, tree decl2
);
240 tree global_trees
[TI_MAX
];
241 tree integer_types
[itk_none
];
243 unsigned char tree_contains_struct
[MAX_TREE_CODES
][64];
245 /* Number of operands for each OpenMP clause. */
246 unsigned const char omp_clause_num_ops
[] =
248 0, /* OMP_CLAUSE_ERROR */
249 1, /* OMP_CLAUSE_PRIVATE */
250 1, /* OMP_CLAUSE_SHARED */
251 1, /* OMP_CLAUSE_FIRSTPRIVATE */
252 2, /* OMP_CLAUSE_LASTPRIVATE */
253 4, /* OMP_CLAUSE_REDUCTION */
254 1, /* OMP_CLAUSE_COPYIN */
255 1, /* OMP_CLAUSE_COPYPRIVATE */
256 3, /* OMP_CLAUSE_LINEAR */
257 2, /* OMP_CLAUSE_ALIGNED */
258 1, /* OMP_CLAUSE_DEPEND */
259 1, /* OMP_CLAUSE_UNIFORM */
260 2, /* OMP_CLAUSE_FROM */
261 2, /* OMP_CLAUSE_TO */
262 2, /* OMP_CLAUSE_MAP */
263 1, /* OMP_CLAUSE__LOOPTEMP_ */
264 1, /* OMP_CLAUSE_IF */
265 1, /* OMP_CLAUSE_NUM_THREADS */
266 1, /* OMP_CLAUSE_SCHEDULE */
267 0, /* OMP_CLAUSE_NOWAIT */
268 0, /* OMP_CLAUSE_ORDERED */
269 0, /* OMP_CLAUSE_DEFAULT */
270 3, /* OMP_CLAUSE_COLLAPSE */
271 0, /* OMP_CLAUSE_UNTIED */
272 1, /* OMP_CLAUSE_FINAL */
273 0, /* OMP_CLAUSE_MERGEABLE */
274 1, /* OMP_CLAUSE_DEVICE */
275 1, /* OMP_CLAUSE_DIST_SCHEDULE */
276 0, /* OMP_CLAUSE_INBRANCH */
277 0, /* OMP_CLAUSE_NOTINBRANCH */
278 1, /* OMP_CLAUSE_NUM_TEAMS */
279 1, /* OMP_CLAUSE_THREAD_LIMIT */
280 0, /* OMP_CLAUSE_PROC_BIND */
281 1, /* OMP_CLAUSE_SAFELEN */
282 1, /* OMP_CLAUSE_SIMDLEN */
283 0, /* OMP_CLAUSE_FOR */
284 0, /* OMP_CLAUSE_PARALLEL */
285 0, /* OMP_CLAUSE_SECTIONS */
286 0, /* OMP_CLAUSE_TASKGROUP */
287 1, /* OMP_CLAUSE__SIMDUID_ */
290 const char * const omp_clause_code_name
[] =
335 /* Return the tree node structure used by tree code CODE. */
337 static inline enum tree_node_structure_enum
338 tree_node_structure_for_code (enum tree_code code
)
340 switch (TREE_CODE_CLASS (code
))
342 case tcc_declaration
:
347 return TS_FIELD_DECL
;
353 return TS_LABEL_DECL
;
355 return TS_RESULT_DECL
;
356 case DEBUG_EXPR_DECL
:
359 return TS_CONST_DECL
;
363 return TS_FUNCTION_DECL
;
364 case TRANSLATION_UNIT_DECL
:
365 return TS_TRANSLATION_UNIT_DECL
;
367 return TS_DECL_NON_COMMON
;
371 return TS_TYPE_NON_COMMON
;
380 default: /* tcc_constant and tcc_exceptional */
385 /* tcc_constant cases. */
386 case VOID_CST
: return TS_TYPED
;
387 case INTEGER_CST
: return TS_INT_CST
;
388 case REAL_CST
: return TS_REAL_CST
;
389 case FIXED_CST
: return TS_FIXED_CST
;
390 case COMPLEX_CST
: return TS_COMPLEX
;
391 case VECTOR_CST
: return TS_VECTOR
;
392 case STRING_CST
: return TS_STRING
;
393 /* tcc_exceptional cases. */
394 case ERROR_MARK
: return TS_COMMON
;
395 case IDENTIFIER_NODE
: return TS_IDENTIFIER
;
396 case TREE_LIST
: return TS_LIST
;
397 case TREE_VEC
: return TS_VEC
;
398 case SSA_NAME
: return TS_SSA_NAME
;
399 case PLACEHOLDER_EXPR
: return TS_COMMON
;
400 case STATEMENT_LIST
: return TS_STATEMENT_LIST
;
401 case BLOCK
: return TS_BLOCK
;
402 case CONSTRUCTOR
: return TS_CONSTRUCTOR
;
403 case TREE_BINFO
: return TS_BINFO
;
404 case OMP_CLAUSE
: return TS_OMP_CLAUSE
;
405 case OPTIMIZATION_NODE
: return TS_OPTIMIZATION
;
406 case TARGET_OPTION_NODE
: return TS_TARGET_OPTION
;
414 /* Initialize tree_contains_struct to describe the hierarchy of tree
418 initialize_tree_contains_struct (void)
422 for (i
= ERROR_MARK
; i
< LAST_AND_UNUSED_TREE_CODE
; i
++)
425 enum tree_node_structure_enum ts_code
;
427 code
= (enum tree_code
) i
;
428 ts_code
= tree_node_structure_for_code (code
);
430 /* Mark the TS structure itself. */
431 tree_contains_struct
[code
][ts_code
] = 1;
433 /* Mark all the structures that TS is derived from. */
451 case TS_STATEMENT_LIST
:
452 MARK_TS_TYPED (code
);
456 case TS_DECL_MINIMAL
:
462 case TS_OPTIMIZATION
:
463 case TS_TARGET_OPTION
:
464 MARK_TS_COMMON (code
);
467 case TS_TYPE_WITH_LANG_SPECIFIC
:
468 MARK_TS_TYPE_COMMON (code
);
471 case TS_TYPE_NON_COMMON
:
472 MARK_TS_TYPE_WITH_LANG_SPECIFIC (code
);
476 MARK_TS_DECL_MINIMAL (code
);
481 MARK_TS_DECL_COMMON (code
);
484 case TS_DECL_NON_COMMON
:
485 MARK_TS_DECL_WITH_VIS (code
);
488 case TS_DECL_WITH_VIS
:
492 MARK_TS_DECL_WRTL (code
);
496 MARK_TS_DECL_COMMON (code
);
500 MARK_TS_DECL_WITH_VIS (code
);
504 case TS_FUNCTION_DECL
:
505 MARK_TS_DECL_NON_COMMON (code
);
508 case TS_TRANSLATION_UNIT_DECL
:
509 MARK_TS_DECL_COMMON (code
);
517 /* Basic consistency checks for attributes used in fold. */
518 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_NON_COMMON
]);
519 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_NON_COMMON
]);
520 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_DECL_COMMON
]);
521 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_COMMON
]);
522 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_COMMON
]);
523 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_COMMON
]);
524 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_COMMON
]);
525 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_COMMON
]);
526 gcc_assert (tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_COMMON
]);
527 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_COMMON
]);
528 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_DECL_COMMON
]);
529 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_WRTL
]);
530 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_WRTL
]);
531 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_WRTL
]);
532 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WRTL
]);
533 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_WRTL
]);
534 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_DECL_MINIMAL
]);
535 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_MINIMAL
]);
536 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_MINIMAL
]);
537 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_MINIMAL
]);
538 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_MINIMAL
]);
539 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_MINIMAL
]);
540 gcc_assert (tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_MINIMAL
]);
541 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_MINIMAL
]);
542 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_DECL_MINIMAL
]);
543 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_WITH_VIS
]);
544 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WITH_VIS
]);
545 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_WITH_VIS
]);
546 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_VAR_DECL
]);
547 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_FIELD_DECL
]);
548 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_PARM_DECL
]);
549 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_LABEL_DECL
]);
550 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_RESULT_DECL
]);
551 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_CONST_DECL
]);
552 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_TYPE_DECL
]);
553 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_FUNCTION_DECL
]);
554 gcc_assert (tree_contains_struct
[IMPORTED_DECL
][TS_DECL_MINIMAL
]);
555 gcc_assert (tree_contains_struct
[IMPORTED_DECL
][TS_DECL_COMMON
]);
556 gcc_assert (tree_contains_struct
[NAMELIST_DECL
][TS_DECL_MINIMAL
]);
557 gcc_assert (tree_contains_struct
[NAMELIST_DECL
][TS_DECL_COMMON
]);
566 /* Initialize the hash table of types. */
567 type_hash_table
= htab_create_ggc (TYPE_HASH_INITIAL_SIZE
, type_hash_hash
,
570 debug_expr_for_decl
= htab_create_ggc (512, tree_decl_map_hash
,
571 tree_decl_map_eq
, 0);
573 value_expr_for_decl
= htab_create_ggc (512, tree_decl_map_hash
,
574 tree_decl_map_eq
, 0);
575 init_priority_for_decl
= htab_create_ggc (512, tree_priority_map_hash
,
576 tree_priority_map_eq
, 0);
578 int_cst_hash_table
= htab_create_ggc (1024, int_cst_hash_hash
,
579 int_cst_hash_eq
, NULL
);
581 int_cst_node
= make_int_cst (1, 1);
583 cl_option_hash_table
= htab_create_ggc (64, cl_option_hash_hash
,
584 cl_option_hash_eq
, NULL
);
586 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
587 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
589 /* Initialize the tree_contains_struct array. */
590 initialize_tree_contains_struct ();
591 lang_hooks
.init_ts ();
595 /* The name of the object as the assembler will see it (but before any
596 translations made by ASM_OUTPUT_LABELREF). Often this is the same
597 as DECL_NAME. It is an IDENTIFIER_NODE. */
599 decl_assembler_name (tree decl
)
601 if (!DECL_ASSEMBLER_NAME_SET_P (decl
))
602 lang_hooks
.set_decl_assembler_name (decl
);
603 return DECL_WITH_VIS_CHECK (decl
)->decl_with_vis
.assembler_name
;
606 /* Return comdat group of DECL. */
608 decl_comdat_group (tree node
)
610 struct symtab_node
*snode
= symtab_get_node (node
);
613 return snode
->get_comdat_group ();
616 /* Compute the number of bytes occupied by a tree with code CODE.
617 This function cannot be used for nodes that have variable sizes,
618 including TREE_VEC, INTEGER_CST, STRING_CST, and CALL_EXPR. */
620 tree_code_size (enum tree_code code
)
622 switch (TREE_CODE_CLASS (code
))
624 case tcc_declaration
: /* A decl node */
629 return sizeof (struct tree_field_decl
);
631 return sizeof (struct tree_parm_decl
);
633 return sizeof (struct tree_var_decl
);
635 return sizeof (struct tree_label_decl
);
637 return sizeof (struct tree_result_decl
);
639 return sizeof (struct tree_const_decl
);
641 return sizeof (struct tree_type_decl
);
643 return sizeof (struct tree_function_decl
);
644 case DEBUG_EXPR_DECL
:
645 return sizeof (struct tree_decl_with_rtl
);
647 return sizeof (struct tree_decl_non_common
);
651 case tcc_type
: /* a type node */
652 return sizeof (struct tree_type_non_common
);
654 case tcc_reference
: /* a reference */
655 case tcc_expression
: /* an expression */
656 case tcc_statement
: /* an expression with side effects */
657 case tcc_comparison
: /* a comparison expression */
658 case tcc_unary
: /* a unary arithmetic expression */
659 case tcc_binary
: /* a binary arithmetic expression */
660 return (sizeof (struct tree_exp
)
661 + (TREE_CODE_LENGTH (code
) - 1) * sizeof (tree
));
663 case tcc_constant
: /* a constant */
666 case VOID_CST
: return sizeof (struct tree_typed
);
667 case INTEGER_CST
: gcc_unreachable ();
668 case REAL_CST
: return sizeof (struct tree_real_cst
);
669 case FIXED_CST
: return sizeof (struct tree_fixed_cst
);
670 case COMPLEX_CST
: return sizeof (struct tree_complex
);
671 case VECTOR_CST
: return sizeof (struct tree_vector
);
672 case STRING_CST
: gcc_unreachable ();
674 return lang_hooks
.tree_size (code
);
677 case tcc_exceptional
: /* something random, like an identifier. */
680 case IDENTIFIER_NODE
: return lang_hooks
.identifier_size
;
681 case TREE_LIST
: return sizeof (struct tree_list
);
684 case PLACEHOLDER_EXPR
: return sizeof (struct tree_common
);
687 case OMP_CLAUSE
: gcc_unreachable ();
689 case SSA_NAME
: return sizeof (struct tree_ssa_name
);
691 case STATEMENT_LIST
: return sizeof (struct tree_statement_list
);
692 case BLOCK
: return sizeof (struct tree_block
);
693 case CONSTRUCTOR
: return sizeof (struct tree_constructor
);
694 case OPTIMIZATION_NODE
: return sizeof (struct tree_optimization_option
);
695 case TARGET_OPTION_NODE
: return sizeof (struct tree_target_option
);
698 return lang_hooks
.tree_size (code
);
706 /* Compute the number of bytes occupied by NODE. This routine only
707 looks at TREE_CODE, except for those nodes that have variable sizes. */
709 tree_size (const_tree node
)
711 const enum tree_code code
= TREE_CODE (node
);
715 return (sizeof (struct tree_int_cst
)
716 + (TREE_INT_CST_EXT_NUNITS (node
) - 1) * sizeof (HOST_WIDE_INT
));
719 return (offsetof (struct tree_binfo
, base_binfos
)
721 ::embedded_size (BINFO_N_BASE_BINFOS (node
)));
724 return (sizeof (struct tree_vec
)
725 + (TREE_VEC_LENGTH (node
) - 1) * sizeof (tree
));
728 return (sizeof (struct tree_vector
)
729 + (TYPE_VECTOR_SUBPARTS (TREE_TYPE (node
)) - 1) * sizeof (tree
));
732 return TREE_STRING_LENGTH (node
) + offsetof (struct tree_string
, str
) + 1;
735 return (sizeof (struct tree_omp_clause
)
736 + (omp_clause_num_ops
[OMP_CLAUSE_CODE (node
)] - 1)
740 if (TREE_CODE_CLASS (code
) == tcc_vl_exp
)
741 return (sizeof (struct tree_exp
)
742 + (VL_EXP_OPERAND_LENGTH (node
) - 1) * sizeof (tree
));
744 return tree_code_size (code
);
748 /* Record interesting allocation statistics for a tree node with CODE
752 record_node_allocation_statistics (enum tree_code code ATTRIBUTE_UNUSED
,
753 size_t length ATTRIBUTE_UNUSED
)
755 enum tree_code_class type
= TREE_CODE_CLASS (code
);
758 if (!GATHER_STATISTICS
)
763 case tcc_declaration
: /* A decl node */
767 case tcc_type
: /* a type node */
771 case tcc_statement
: /* an expression with side effects */
775 case tcc_reference
: /* a reference */
779 case tcc_expression
: /* an expression */
780 case tcc_comparison
: /* a comparison expression */
781 case tcc_unary
: /* a unary arithmetic expression */
782 case tcc_binary
: /* a binary arithmetic expression */
786 case tcc_constant
: /* a constant */
790 case tcc_exceptional
: /* something random, like an identifier. */
793 case IDENTIFIER_NODE
:
806 kind
= ssa_name_kind
;
818 kind
= omp_clause_kind
;
835 tree_code_counts
[(int) code
]++;
836 tree_node_counts
[(int) kind
]++;
837 tree_node_sizes
[(int) kind
] += length
;
840 /* Allocate and return a new UID from the DECL_UID namespace. */
843 allocate_decl_uid (void)
845 return next_decl_uid
++;
848 /* Return a newly allocated node of code CODE. For decl and type
849 nodes, some other fields are initialized. The rest of the node is
850 initialized to zero. This function cannot be used for TREE_VEC,
851 INTEGER_CST or OMP_CLAUSE nodes, which is enforced by asserts in
854 Achoo! I got a code in the node. */
857 make_node_stat (enum tree_code code MEM_STAT_DECL
)
860 enum tree_code_class type
= TREE_CODE_CLASS (code
);
861 size_t length
= tree_code_size (code
);
863 record_node_allocation_statistics (code
, length
);
865 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
866 TREE_SET_CODE (t
, code
);
871 TREE_SIDE_EFFECTS (t
) = 1;
874 case tcc_declaration
:
875 if (CODE_CONTAINS_STRUCT (code
, TS_DECL_COMMON
))
877 if (code
== FUNCTION_DECL
)
879 DECL_ALIGN (t
) = FUNCTION_BOUNDARY
;
880 DECL_MODE (t
) = FUNCTION_MODE
;
885 DECL_SOURCE_LOCATION (t
) = input_location
;
886 if (TREE_CODE (t
) == DEBUG_EXPR_DECL
)
887 DECL_UID (t
) = --next_debug_decl_uid
;
890 DECL_UID (t
) = allocate_decl_uid ();
891 SET_DECL_PT_UID (t
, -1);
893 if (TREE_CODE (t
) == LABEL_DECL
)
894 LABEL_DECL_UID (t
) = -1;
899 TYPE_UID (t
) = next_type_uid
++;
900 TYPE_ALIGN (t
) = BITS_PER_UNIT
;
901 TYPE_USER_ALIGN (t
) = 0;
902 TYPE_MAIN_VARIANT (t
) = t
;
903 TYPE_CANONICAL (t
) = t
;
905 /* Default to no attributes for type, but let target change that. */
906 TYPE_ATTRIBUTES (t
) = NULL_TREE
;
907 targetm
.set_default_type_attributes (t
);
909 /* We have not yet computed the alias set for this type. */
910 TYPE_ALIAS_SET (t
) = -1;
914 TREE_CONSTANT (t
) = 1;
923 case PREDECREMENT_EXPR
:
924 case PREINCREMENT_EXPR
:
925 case POSTDECREMENT_EXPR
:
926 case POSTINCREMENT_EXPR
:
927 /* All of these have side-effects, no matter what their
929 TREE_SIDE_EFFECTS (t
) = 1;
938 /* Other classes need no special treatment. */
945 /* Return a new node with the same contents as NODE except that its
946 TREE_CHAIN, if it has one, is zero and it has a fresh uid. */
949 copy_node_stat (tree node MEM_STAT_DECL
)
952 enum tree_code code
= TREE_CODE (node
);
955 gcc_assert (code
!= STATEMENT_LIST
);
957 length
= tree_size (node
);
958 record_node_allocation_statistics (code
, length
);
959 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
960 memcpy (t
, node
, length
);
962 if (CODE_CONTAINS_STRUCT (code
, TS_COMMON
))
964 TREE_ASM_WRITTEN (t
) = 0;
965 TREE_VISITED (t
) = 0;
967 if (TREE_CODE_CLASS (code
) == tcc_declaration
)
969 if (code
== DEBUG_EXPR_DECL
)
970 DECL_UID (t
) = --next_debug_decl_uid
;
973 DECL_UID (t
) = allocate_decl_uid ();
974 if (DECL_PT_UID_SET_P (node
))
975 SET_DECL_PT_UID (t
, DECL_PT_UID (node
));
977 if ((TREE_CODE (node
) == PARM_DECL
|| TREE_CODE (node
) == VAR_DECL
)
978 && DECL_HAS_VALUE_EXPR_P (node
))
980 SET_DECL_VALUE_EXPR (t
, DECL_VALUE_EXPR (node
));
981 DECL_HAS_VALUE_EXPR_P (t
) = 1;
983 /* DECL_DEBUG_EXPR is copied explicitely by callers. */
984 if (TREE_CODE (node
) == VAR_DECL
)
986 DECL_HAS_DEBUG_EXPR_P (t
) = 0;
987 t
->decl_with_vis
.symtab_node
= NULL
;
989 if (TREE_CODE (node
) == VAR_DECL
&& DECL_HAS_INIT_PRIORITY_P (node
))
991 SET_DECL_INIT_PRIORITY (t
, DECL_INIT_PRIORITY (node
));
992 DECL_HAS_INIT_PRIORITY_P (t
) = 1;
994 if (TREE_CODE (node
) == FUNCTION_DECL
)
996 DECL_STRUCT_FUNCTION (t
) = NULL
;
997 t
->decl_with_vis
.symtab_node
= NULL
;
1000 else if (TREE_CODE_CLASS (code
) == tcc_type
)
1002 TYPE_UID (t
) = next_type_uid
++;
1003 /* The following is so that the debug code for
1004 the copy is different from the original type.
1005 The two statements usually duplicate each other
1006 (because they clear fields of the same union),
1007 but the optimizer should catch that. */
1008 TYPE_SYMTAB_POINTER (t
) = 0;
1009 TYPE_SYMTAB_ADDRESS (t
) = 0;
1011 /* Do not copy the values cache. */
1012 if (TYPE_CACHED_VALUES_P (t
))
1014 TYPE_CACHED_VALUES_P (t
) = 0;
1015 TYPE_CACHED_VALUES (t
) = NULL_TREE
;
1022 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
1023 For example, this can copy a list made of TREE_LIST nodes. */
1026 copy_list (tree list
)
1034 head
= prev
= copy_node (list
);
1035 next
= TREE_CHAIN (list
);
1038 TREE_CHAIN (prev
) = copy_node (next
);
1039 prev
= TREE_CHAIN (prev
);
1040 next
= TREE_CHAIN (next
);
1046 /* Return the value that TREE_INT_CST_EXT_NUNITS should have for an
1047 INTEGER_CST with value CST and type TYPE. */
1050 get_int_cst_ext_nunits (tree type
, const wide_int
&cst
)
1052 gcc_checking_assert (cst
.get_precision () == TYPE_PRECISION (type
));
1053 /* We need an extra zero HWI if CST is an unsigned integer with its
1054 upper bit set, and if CST occupies a whole number of HWIs. */
1055 if (TYPE_UNSIGNED (type
)
1057 && (cst
.get_precision () % HOST_BITS_PER_WIDE_INT
) == 0)
1058 return cst
.get_precision () / HOST_BITS_PER_WIDE_INT
+ 1;
1059 return cst
.get_len ();
1062 /* Return a new INTEGER_CST with value CST and type TYPE. */
1065 build_new_int_cst (tree type
, const wide_int
&cst
)
1067 unsigned int len
= cst
.get_len ();
1068 unsigned int ext_len
= get_int_cst_ext_nunits (type
, cst
);
1069 tree nt
= make_int_cst (len
, ext_len
);
1074 TREE_INT_CST_ELT (nt
, ext_len
) = 0;
1075 for (unsigned int i
= len
; i
< ext_len
; ++i
)
1076 TREE_INT_CST_ELT (nt
, i
) = -1;
1078 else if (TYPE_UNSIGNED (type
)
1079 && cst
.get_precision () < len
* HOST_BITS_PER_WIDE_INT
)
1082 TREE_INT_CST_ELT (nt
, len
)
1083 = zext_hwi (cst
.elt (len
),
1084 cst
.get_precision () % HOST_BITS_PER_WIDE_INT
);
1087 for (unsigned int i
= 0; i
< len
; i
++)
1088 TREE_INT_CST_ELT (nt
, i
) = cst
.elt (i
);
1089 TREE_TYPE (nt
) = type
;
1093 /* Create an INT_CST node with a LOW value sign extended to TYPE. */
1096 build_int_cst (tree type
, HOST_WIDE_INT low
)
1098 /* Support legacy code. */
1100 type
= integer_type_node
;
1102 return wide_int_to_tree (type
, wi::shwi (low
, TYPE_PRECISION (type
)));
1106 build_int_cstu (tree type
, unsigned HOST_WIDE_INT cst
)
1108 return wide_int_to_tree (type
, wi::uhwi (cst
, TYPE_PRECISION (type
)));
1111 /* Create an INT_CST node with a LOW value sign extended to TYPE. */
1114 build_int_cst_type (tree type
, HOST_WIDE_INT low
)
1117 return wide_int_to_tree (type
, wi::shwi (low
, TYPE_PRECISION (type
)));
1120 /* Constructs tree in type TYPE from with value given by CST. Signedness
1121 of CST is assumed to be the same as the signedness of TYPE. */
1124 double_int_to_tree (tree type
, double_int cst
)
1126 return wide_int_to_tree (type
, widest_int::from (cst
, TYPE_SIGN (type
)));
1129 /* We force the wide_int CST to the range of the type TYPE by sign or
1130 zero extending it. OVERFLOWABLE indicates if we are interested in
1131 overflow of the value, when >0 we are only interested in signed
1132 overflow, for <0 we are interested in any overflow. OVERFLOWED
1133 indicates whether overflow has already occurred. CONST_OVERFLOWED
1134 indicates whether constant overflow has already occurred. We force
1135 T's value to be within range of T's type (by setting to 0 or 1 all
1136 the bits outside the type's range). We set TREE_OVERFLOWED if,
1137 OVERFLOWED is nonzero,
1138 or OVERFLOWABLE is >0 and signed overflow occurs
1139 or OVERFLOWABLE is <0 and any overflow occurs
1140 We return a new tree node for the extended wide_int. The node
1141 is shared if no overflow flags are set. */
1145 force_fit_type (tree type
, const wide_int_ref
&cst
,
1146 int overflowable
, bool overflowed
)
1148 signop sign
= TYPE_SIGN (type
);
1150 /* If we need to set overflow flags, return a new unshared node. */
1151 if (overflowed
|| !wi::fits_to_tree_p (cst
, type
))
1155 || (overflowable
> 0 && sign
== SIGNED
))
1157 wide_int tmp
= wide_int::from (cst
, TYPE_PRECISION (type
), sign
);
1158 tree t
= build_new_int_cst (type
, tmp
);
1159 TREE_OVERFLOW (t
) = 1;
1164 /* Else build a shared node. */
1165 return wide_int_to_tree (type
, cst
);
1168 /* These are the hash table functions for the hash table of INTEGER_CST
1169 nodes of a sizetype. */
1171 /* Return the hash code code X, an INTEGER_CST. */
1174 int_cst_hash_hash (const void *x
)
1176 const_tree
const t
= (const_tree
) x
;
1177 hashval_t code
= htab_hash_pointer (TREE_TYPE (t
));
1180 for (i
= 0; i
< TREE_INT_CST_NUNITS (t
); i
++)
1181 code
^= TREE_INT_CST_ELT (t
, i
);
1186 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
1187 is the same as that given by *Y, which is the same. */
1190 int_cst_hash_eq (const void *x
, const void *y
)
1192 const_tree
const xt
= (const_tree
) x
;
1193 const_tree
const yt
= (const_tree
) y
;
1195 if (TREE_TYPE (xt
) != TREE_TYPE (yt
)
1196 || TREE_INT_CST_NUNITS (xt
) != TREE_INT_CST_NUNITS (yt
)
1197 || TREE_INT_CST_EXT_NUNITS (xt
) != TREE_INT_CST_EXT_NUNITS (yt
))
1200 for (int i
= 0; i
< TREE_INT_CST_NUNITS (xt
); i
++)
1201 if (TREE_INT_CST_ELT (xt
, i
) != TREE_INT_CST_ELT (yt
, i
))
1207 /* Create an INT_CST node of TYPE and value CST.
1208 The returned node is always shared. For small integers we use a
1209 per-type vector cache, for larger ones we use a single hash table.
1210 The value is extended from its precision according to the sign of
1211 the type to be a multiple of HOST_BITS_PER_WIDE_INT. This defines
1212 the upper bits and ensures that hashing and value equality based
1213 upon the underlying HOST_WIDE_INTs works without masking. */
1216 wide_int_to_tree (tree type
, const wide_int_ref
&pcst
)
1223 unsigned int prec
= TYPE_PRECISION (type
);
1224 signop sgn
= TYPE_SIGN (type
);
1226 /* Verify that everything is canonical. */
1227 int l
= pcst
.get_len ();
1230 if (pcst
.elt (l
- 1) == 0)
1231 gcc_checking_assert (pcst
.elt (l
- 2) < 0);
1232 if (pcst
.elt (l
- 1) == (HOST_WIDE_INT
) -1)
1233 gcc_checking_assert (pcst
.elt (l
- 2) >= 0);
1236 wide_int cst
= wide_int::from (pcst
, prec
, sgn
);
1237 unsigned int ext_len
= get_int_cst_ext_nunits (type
, cst
);
1241 /* We just need to store a single HOST_WIDE_INT. */
1243 if (TYPE_UNSIGNED (type
))
1244 hwi
= cst
.to_uhwi ();
1246 hwi
= cst
.to_shwi ();
1248 switch (TREE_CODE (type
))
1251 gcc_assert (hwi
== 0);
1255 case REFERENCE_TYPE
:
1256 /* Cache NULL pointer. */
1265 /* Cache false or true. */
1273 if (TYPE_SIGN (type
) == UNSIGNED
)
1276 limit
= INTEGER_SHARE_LIMIT
;
1277 if (IN_RANGE (hwi
, 0, INTEGER_SHARE_LIMIT
- 1))
1282 /* Cache [-1, N). */
1283 limit
= INTEGER_SHARE_LIMIT
+ 1;
1284 if (IN_RANGE (hwi
, -1, INTEGER_SHARE_LIMIT
- 1))
1298 /* Look for it in the type's vector of small shared ints. */
1299 if (!TYPE_CACHED_VALUES_P (type
))
1301 TYPE_CACHED_VALUES_P (type
) = 1;
1302 TYPE_CACHED_VALUES (type
) = make_tree_vec (limit
);
1305 t
= TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
);
1307 /* Make sure no one is clobbering the shared constant. */
1308 gcc_checking_assert (TREE_TYPE (t
) == type
1309 && TREE_INT_CST_NUNITS (t
) == 1
1310 && TREE_INT_CST_OFFSET_NUNITS (t
) == 1
1311 && TREE_INT_CST_EXT_NUNITS (t
) == 1
1312 && TREE_INT_CST_ELT (t
, 0) == hwi
);
1315 /* Create a new shared int. */
1316 t
= build_new_int_cst (type
, cst
);
1317 TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) = t
;
1322 /* Use the cache of larger shared ints, using int_cst_node as
1326 TREE_INT_CST_ELT (int_cst_node
, 0) = hwi
;
1327 TREE_TYPE (int_cst_node
) = type
;
1329 slot
= htab_find_slot (int_cst_hash_table
, int_cst_node
, INSERT
);
1333 /* Insert this one into the hash table. */
1336 /* Make a new node for next time round. */
1337 int_cst_node
= make_int_cst (1, 1);
1343 /* The value either hashes properly or we drop it on the floor
1344 for the gc to take care of. There will not be enough of them
1348 tree nt
= build_new_int_cst (type
, cst
);
1349 slot
= htab_find_slot (int_cst_hash_table
, nt
, INSERT
);
1353 /* Insert this one into the hash table. */
1363 cache_integer_cst (tree t
)
1365 tree type
= TREE_TYPE (t
);
1368 int prec
= TYPE_PRECISION (type
);
1370 gcc_assert (!TREE_OVERFLOW (t
));
1372 switch (TREE_CODE (type
))
1375 gcc_assert (integer_zerop (t
));
1379 case REFERENCE_TYPE
:
1380 /* Cache NULL pointer. */
1381 if (integer_zerop (t
))
1389 /* Cache false or true. */
1391 if (wi::ltu_p (t
, 2))
1392 ix
= TREE_INT_CST_ELT (t
, 0);
1397 if (TYPE_UNSIGNED (type
))
1400 limit
= INTEGER_SHARE_LIMIT
;
1402 /* This is a little hokie, but if the prec is smaller than
1403 what is necessary to hold INTEGER_SHARE_LIMIT, then the
1404 obvious test will not get the correct answer. */
1405 if (prec
< HOST_BITS_PER_WIDE_INT
)
1407 if (tree_to_uhwi (t
) < (unsigned HOST_WIDE_INT
) INTEGER_SHARE_LIMIT
)
1408 ix
= tree_to_uhwi (t
);
1410 else if (wi::ltu_p (t
, INTEGER_SHARE_LIMIT
))
1411 ix
= tree_to_uhwi (t
);
1416 limit
= INTEGER_SHARE_LIMIT
+ 1;
1418 if (integer_minus_onep (t
))
1420 else if (!wi::neg_p (t
))
1422 if (prec
< HOST_BITS_PER_WIDE_INT
)
1424 if (tree_to_shwi (t
) < INTEGER_SHARE_LIMIT
)
1425 ix
= tree_to_shwi (t
) + 1;
1427 else if (wi::ltu_p (t
, INTEGER_SHARE_LIMIT
))
1428 ix
= tree_to_shwi (t
) + 1;
1442 /* Look for it in the type's vector of small shared ints. */
1443 if (!TYPE_CACHED_VALUES_P (type
))
1445 TYPE_CACHED_VALUES_P (type
) = 1;
1446 TYPE_CACHED_VALUES (type
) = make_tree_vec (limit
);
1449 gcc_assert (TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) == NULL_TREE
);
1450 TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) = t
;
1454 /* Use the cache of larger shared ints. */
1457 slot
= htab_find_slot (int_cst_hash_table
, t
, INSERT
);
1458 /* If there is already an entry for the number verify it's the
1461 gcc_assert (wi::eq_p (tree (*slot
), t
));
1463 /* Otherwise insert this one into the hash table. */
1469 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
1470 and the rest are zeros. */
1473 build_low_bits_mask (tree type
, unsigned bits
)
1475 gcc_assert (bits
<= TYPE_PRECISION (type
));
1477 return wide_int_to_tree (type
, wi::mask (bits
, false,
1478 TYPE_PRECISION (type
)));
1481 /* Checks that X is integer constant that can be expressed in (unsigned)
1482 HOST_WIDE_INT without loss of precision. */
1485 cst_and_fits_in_hwi (const_tree x
)
1487 if (TREE_CODE (x
) != INTEGER_CST
)
1490 if (TYPE_PRECISION (TREE_TYPE (x
)) > HOST_BITS_PER_WIDE_INT
)
1493 return TREE_INT_CST_NUNITS (x
) == 1;
1496 /* Build a newly constructed TREE_VEC node of length LEN. */
1499 make_vector_stat (unsigned len MEM_STAT_DECL
)
1502 unsigned length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vector
);
1504 record_node_allocation_statistics (VECTOR_CST
, length
);
1506 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
1508 TREE_SET_CODE (t
, VECTOR_CST
);
1509 TREE_CONSTANT (t
) = 1;
1514 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1515 are in a list pointed to by VALS. */
1518 build_vector_stat (tree type
, tree
*vals MEM_STAT_DECL
)
1522 tree v
= make_vector (TYPE_VECTOR_SUBPARTS (type
));
1523 TREE_TYPE (v
) = type
;
1525 /* Iterate through elements and check for overflow. */
1526 for (cnt
= 0; cnt
< TYPE_VECTOR_SUBPARTS (type
); ++cnt
)
1528 tree value
= vals
[cnt
];
1530 VECTOR_CST_ELT (v
, cnt
) = value
;
1532 /* Don't crash if we get an address constant. */
1533 if (!CONSTANT_CLASS_P (value
))
1536 over
|= TREE_OVERFLOW (value
);
1539 TREE_OVERFLOW (v
) = over
;
1543 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1544 are extracted from V, a vector of CONSTRUCTOR_ELT. */
1547 build_vector_from_ctor (tree type
, vec
<constructor_elt
, va_gc
> *v
)
1549 tree
*vec
= XALLOCAVEC (tree
, TYPE_VECTOR_SUBPARTS (type
));
1550 unsigned HOST_WIDE_INT idx
;
1553 FOR_EACH_CONSTRUCTOR_VALUE (v
, idx
, value
)
1555 for (; idx
< TYPE_VECTOR_SUBPARTS (type
); ++idx
)
1556 vec
[idx
] = build_zero_cst (TREE_TYPE (type
));
1558 return build_vector (type
, vec
);
1561 /* Build a vector of type VECTYPE where all the elements are SCs. */
1563 build_vector_from_val (tree vectype
, tree sc
)
1565 int i
, nunits
= TYPE_VECTOR_SUBPARTS (vectype
);
1567 if (sc
== error_mark_node
)
1570 /* Verify that the vector type is suitable for SC. Note that there
1571 is some inconsistency in the type-system with respect to restrict
1572 qualifications of pointers. Vector types always have a main-variant
1573 element type and the qualification is applied to the vector-type.
1574 So TREE_TYPE (vector-type) does not return a properly qualified
1575 vector element-type. */
1576 gcc_checking_assert (types_compatible_p (TYPE_MAIN_VARIANT (TREE_TYPE (sc
)),
1577 TREE_TYPE (vectype
)));
1579 if (CONSTANT_CLASS_P (sc
))
1581 tree
*v
= XALLOCAVEC (tree
, nunits
);
1582 for (i
= 0; i
< nunits
; ++i
)
1584 return build_vector (vectype
, v
);
1588 vec
<constructor_elt
, va_gc
> *v
;
1589 vec_alloc (v
, nunits
);
1590 for (i
= 0; i
< nunits
; ++i
)
1591 CONSTRUCTOR_APPEND_ELT (v
, NULL_TREE
, sc
);
1592 return build_constructor (vectype
, v
);
1596 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1597 are in the vec pointed to by VALS. */
1599 build_constructor (tree type
, vec
<constructor_elt
, va_gc
> *vals
)
1601 tree c
= make_node (CONSTRUCTOR
);
1603 constructor_elt
*elt
;
1604 bool constant_p
= true;
1605 bool side_effects_p
= false;
1607 TREE_TYPE (c
) = type
;
1608 CONSTRUCTOR_ELTS (c
) = vals
;
1610 FOR_EACH_VEC_SAFE_ELT (vals
, i
, elt
)
1612 /* Mostly ctors will have elts that don't have side-effects, so
1613 the usual case is to scan all the elements. Hence a single
1614 loop for both const and side effects, rather than one loop
1615 each (with early outs). */
1616 if (!TREE_CONSTANT (elt
->value
))
1618 if (TREE_SIDE_EFFECTS (elt
->value
))
1619 side_effects_p
= true;
1622 TREE_SIDE_EFFECTS (c
) = side_effects_p
;
1623 TREE_CONSTANT (c
) = constant_p
;
1628 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
1631 build_constructor_single (tree type
, tree index
, tree value
)
1633 vec
<constructor_elt
, va_gc
> *v
;
1634 constructor_elt elt
= {index
, value
};
1637 v
->quick_push (elt
);
1639 return build_constructor (type
, v
);
1643 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1644 are in a list pointed to by VALS. */
1646 build_constructor_from_list (tree type
, tree vals
)
1649 vec
<constructor_elt
, va_gc
> *v
= NULL
;
1653 vec_alloc (v
, list_length (vals
));
1654 for (t
= vals
; t
; t
= TREE_CHAIN (t
))
1655 CONSTRUCTOR_APPEND_ELT (v
, TREE_PURPOSE (t
), TREE_VALUE (t
));
1658 return build_constructor (type
, v
);
1661 /* Return a new CONSTRUCTOR node whose type is TYPE. NELTS is the number
1662 of elements, provided as index/value pairs. */
1665 build_constructor_va (tree type
, int nelts
, ...)
1667 vec
<constructor_elt
, va_gc
> *v
= NULL
;
1670 va_start (p
, nelts
);
1671 vec_alloc (v
, nelts
);
1674 tree index
= va_arg (p
, tree
);
1675 tree value
= va_arg (p
, tree
);
1676 CONSTRUCTOR_APPEND_ELT (v
, index
, value
);
1679 return build_constructor (type
, v
);
1682 /* Return a new FIXED_CST node whose type is TYPE and value is F. */
1685 build_fixed (tree type
, FIXED_VALUE_TYPE f
)
1688 FIXED_VALUE_TYPE
*fp
;
1690 v
= make_node (FIXED_CST
);
1691 fp
= ggc_alloc
<fixed_value
> ();
1692 memcpy (fp
, &f
, sizeof (FIXED_VALUE_TYPE
));
1694 TREE_TYPE (v
) = type
;
1695 TREE_FIXED_CST_PTR (v
) = fp
;
1699 /* Return a new REAL_CST node whose type is TYPE and value is D. */
1702 build_real (tree type
, REAL_VALUE_TYPE d
)
1705 REAL_VALUE_TYPE
*dp
;
1708 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
1709 Consider doing it via real_convert now. */
1711 v
= make_node (REAL_CST
);
1712 dp
= ggc_alloc
<real_value
> ();
1713 memcpy (dp
, &d
, sizeof (REAL_VALUE_TYPE
));
1715 TREE_TYPE (v
) = type
;
1716 TREE_REAL_CST_PTR (v
) = dp
;
1717 TREE_OVERFLOW (v
) = overflow
;
1721 /* Return a new REAL_CST node whose type is TYPE
1722 and whose value is the integer value of the INTEGER_CST node I. */
1725 real_value_from_int_cst (const_tree type
, const_tree i
)
1729 /* Clear all bits of the real value type so that we can later do
1730 bitwise comparisons to see if two values are the same. */
1731 memset (&d
, 0, sizeof d
);
1733 real_from_integer (&d
, type
? TYPE_MODE (type
) : VOIDmode
, i
,
1734 TYPE_SIGN (TREE_TYPE (i
)));
1738 /* Given a tree representing an integer constant I, return a tree
1739 representing the same value as a floating-point constant of type TYPE. */
1742 build_real_from_int_cst (tree type
, const_tree i
)
1745 int overflow
= TREE_OVERFLOW (i
);
1747 v
= build_real (type
, real_value_from_int_cst (type
, i
));
1749 TREE_OVERFLOW (v
) |= overflow
;
1753 /* Return a newly constructed STRING_CST node whose value is
1754 the LEN characters at STR.
1755 Note that for a C string literal, LEN should include the trailing NUL.
1756 The TREE_TYPE is not initialized. */
1759 build_string (int len
, const char *str
)
1764 /* Do not waste bytes provided by padding of struct tree_string. */
1765 length
= len
+ offsetof (struct tree_string
, str
) + 1;
1767 record_node_allocation_statistics (STRING_CST
, length
);
1769 s
= (tree
) ggc_internal_alloc (length
);
1771 memset (s
, 0, sizeof (struct tree_typed
));
1772 TREE_SET_CODE (s
, STRING_CST
);
1773 TREE_CONSTANT (s
) = 1;
1774 TREE_STRING_LENGTH (s
) = len
;
1775 memcpy (s
->string
.str
, str
, len
);
1776 s
->string
.str
[len
] = '\0';
1781 /* Return a newly constructed COMPLEX_CST node whose value is
1782 specified by the real and imaginary parts REAL and IMAG.
1783 Both REAL and IMAG should be constant nodes. TYPE, if specified,
1784 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
1787 build_complex (tree type
, tree real
, tree imag
)
1789 tree t
= make_node (COMPLEX_CST
);
1791 TREE_REALPART (t
) = real
;
1792 TREE_IMAGPART (t
) = imag
;
1793 TREE_TYPE (t
) = type
? type
: build_complex_type (TREE_TYPE (real
));
1794 TREE_OVERFLOW (t
) = TREE_OVERFLOW (real
) | TREE_OVERFLOW (imag
);
1798 /* Return a constant of arithmetic type TYPE which is the
1799 multiplicative identity of the set TYPE. */
1802 build_one_cst (tree type
)
1804 switch (TREE_CODE (type
))
1806 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
1807 case POINTER_TYPE
: case REFERENCE_TYPE
:
1809 return build_int_cst (type
, 1);
1812 return build_real (type
, dconst1
);
1814 case FIXED_POINT_TYPE
:
1815 /* We can only generate 1 for accum types. */
1816 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type
)));
1817 return build_fixed (type
, FCONST1 (TYPE_MODE (type
)));
1821 tree scalar
= build_one_cst (TREE_TYPE (type
));
1823 return build_vector_from_val (type
, scalar
);
1827 return build_complex (type
,
1828 build_one_cst (TREE_TYPE (type
)),
1829 build_zero_cst (TREE_TYPE (type
)));
1836 /* Return an integer of type TYPE containing all 1's in as much precision as
1837 it contains, or a complex or vector whose subparts are such integers. */
1840 build_all_ones_cst (tree type
)
1842 if (TREE_CODE (type
) == COMPLEX_TYPE
)
1844 tree scalar
= build_all_ones_cst (TREE_TYPE (type
));
1845 return build_complex (type
, scalar
, scalar
);
1848 return build_minus_one_cst (type
);
1851 /* Return a constant of arithmetic type TYPE which is the
1852 opposite of the multiplicative identity of the set TYPE. */
1855 build_minus_one_cst (tree type
)
1857 switch (TREE_CODE (type
))
1859 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
1860 case POINTER_TYPE
: case REFERENCE_TYPE
:
1862 return build_int_cst (type
, -1);
1865 return build_real (type
, dconstm1
);
1867 case FIXED_POINT_TYPE
:
1868 /* We can only generate 1 for accum types. */
1869 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type
)));
1870 return build_fixed (type
, fixed_from_double_int (double_int_minus_one
,
1875 tree scalar
= build_minus_one_cst (TREE_TYPE (type
));
1877 return build_vector_from_val (type
, scalar
);
1881 return build_complex (type
,
1882 build_minus_one_cst (TREE_TYPE (type
)),
1883 build_zero_cst (TREE_TYPE (type
)));
1890 /* Build 0 constant of type TYPE. This is used by constructor folding
1891 and thus the constant should be represented in memory by
1895 build_zero_cst (tree type
)
1897 switch (TREE_CODE (type
))
1899 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
1900 case POINTER_TYPE
: case REFERENCE_TYPE
:
1901 case OFFSET_TYPE
: case NULLPTR_TYPE
:
1902 return build_int_cst (type
, 0);
1905 return build_real (type
, dconst0
);
1907 case FIXED_POINT_TYPE
:
1908 return build_fixed (type
, FCONST0 (TYPE_MODE (type
)));
1912 tree scalar
= build_zero_cst (TREE_TYPE (type
));
1914 return build_vector_from_val (type
, scalar
);
1919 tree zero
= build_zero_cst (TREE_TYPE (type
));
1921 return build_complex (type
, zero
, zero
);
1925 if (!AGGREGATE_TYPE_P (type
))
1926 return fold_convert (type
, integer_zero_node
);
1927 return build_constructor (type
, NULL
);
1932 /* Build a BINFO with LEN language slots. */
1935 make_tree_binfo_stat (unsigned base_binfos MEM_STAT_DECL
)
1938 size_t length
= (offsetof (struct tree_binfo
, base_binfos
)
1939 + vec
<tree
, va_gc
>::embedded_size (base_binfos
));
1941 record_node_allocation_statistics (TREE_BINFO
, length
);
1943 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
1945 memset (t
, 0, offsetof (struct tree_binfo
, base_binfos
));
1947 TREE_SET_CODE (t
, TREE_BINFO
);
1949 BINFO_BASE_BINFOS (t
)->embedded_init (base_binfos
);
1954 /* Create a CASE_LABEL_EXPR tree node and return it. */
1957 build_case_label (tree low_value
, tree high_value
, tree label_decl
)
1959 tree t
= make_node (CASE_LABEL_EXPR
);
1961 TREE_TYPE (t
) = void_type_node
;
1962 SET_EXPR_LOCATION (t
, DECL_SOURCE_LOCATION (label_decl
));
1964 CASE_LOW (t
) = low_value
;
1965 CASE_HIGH (t
) = high_value
;
1966 CASE_LABEL (t
) = label_decl
;
1967 CASE_CHAIN (t
) = NULL_TREE
;
1972 /* Build a newly constructed INTEGER_CST node. LEN and EXT_LEN are the
1973 values of TREE_INT_CST_NUNITS and TREE_INT_CST_EXT_NUNITS respectively.
1974 The latter determines the length of the HOST_WIDE_INT vector. */
1977 make_int_cst_stat (int len
, int ext_len MEM_STAT_DECL
)
1980 int length
= ((ext_len
- 1) * sizeof (HOST_WIDE_INT
)
1981 + sizeof (struct tree_int_cst
));
1984 record_node_allocation_statistics (INTEGER_CST
, length
);
1986 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
1988 TREE_SET_CODE (t
, INTEGER_CST
);
1989 TREE_INT_CST_NUNITS (t
) = len
;
1990 TREE_INT_CST_EXT_NUNITS (t
) = ext_len
;
1991 /* to_offset can only be applied to trees that are offset_int-sized
1992 or smaller. EXT_LEN is correct if it fits, otherwise the constant
1993 must be exactly the precision of offset_int and so LEN is correct. */
1994 if (ext_len
<= OFFSET_INT_ELTS
)
1995 TREE_INT_CST_OFFSET_NUNITS (t
) = ext_len
;
1997 TREE_INT_CST_OFFSET_NUNITS (t
) = len
;
1999 TREE_CONSTANT (t
) = 1;
2004 /* Build a newly constructed TREE_VEC node of length LEN. */
2007 make_tree_vec_stat (int len MEM_STAT_DECL
)
2010 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
2012 record_node_allocation_statistics (TREE_VEC
, length
);
2014 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
2016 TREE_SET_CODE (t
, TREE_VEC
);
2017 TREE_VEC_LENGTH (t
) = len
;
2022 /* Grow a TREE_VEC node to new length LEN. */
2025 grow_tree_vec_stat (tree v
, int len MEM_STAT_DECL
)
2027 gcc_assert (TREE_CODE (v
) == TREE_VEC
);
2029 int oldlen
= TREE_VEC_LENGTH (v
);
2030 gcc_assert (len
> oldlen
);
2032 int oldlength
= (oldlen
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
2033 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
2035 record_node_allocation_statistics (TREE_VEC
, length
- oldlength
);
2037 v
= (tree
) ggc_realloc (v
, length PASS_MEM_STAT
);
2039 TREE_VEC_LENGTH (v
) = len
;
2044 /* Return 1 if EXPR is the integer constant zero or a complex constant
2048 integer_zerop (const_tree expr
)
2052 switch (TREE_CODE (expr
))
2055 return wi::eq_p (expr
, 0);
2057 return (integer_zerop (TREE_REALPART (expr
))
2058 && integer_zerop (TREE_IMAGPART (expr
)));
2062 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2063 if (!integer_zerop (VECTOR_CST_ELT (expr
, i
)))
2072 /* Return 1 if EXPR is the integer constant one or the corresponding
2073 complex constant. */
2076 integer_onep (const_tree expr
)
2080 switch (TREE_CODE (expr
))
2083 return wi::eq_p (wi::to_widest (expr
), 1);
2085 return (integer_onep (TREE_REALPART (expr
))
2086 && integer_zerop (TREE_IMAGPART (expr
)));
2090 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2091 if (!integer_onep (VECTOR_CST_ELT (expr
, i
)))
2100 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
2101 it contains, or a complex or vector whose subparts are such integers. */
2104 integer_all_onesp (const_tree expr
)
2108 if (TREE_CODE (expr
) == COMPLEX_CST
2109 && integer_all_onesp (TREE_REALPART (expr
))
2110 && integer_all_onesp (TREE_IMAGPART (expr
)))
2113 else if (TREE_CODE (expr
) == VECTOR_CST
)
2116 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2117 if (!integer_all_onesp (VECTOR_CST_ELT (expr
, i
)))
2122 else if (TREE_CODE (expr
) != INTEGER_CST
)
2125 return wi::max_value (TYPE_PRECISION (TREE_TYPE (expr
)), UNSIGNED
) == expr
;
2128 /* Return 1 if EXPR is the integer constant minus one. */
2131 integer_minus_onep (const_tree expr
)
2135 if (TREE_CODE (expr
) == COMPLEX_CST
)
2136 return (integer_all_onesp (TREE_REALPART (expr
))
2137 && integer_zerop (TREE_IMAGPART (expr
)));
2139 return integer_all_onesp (expr
);
2142 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
2146 integer_pow2p (const_tree expr
)
2150 if (TREE_CODE (expr
) == COMPLEX_CST
2151 && integer_pow2p (TREE_REALPART (expr
))
2152 && integer_zerop (TREE_IMAGPART (expr
)))
2155 if (TREE_CODE (expr
) != INTEGER_CST
)
2158 return wi::popcount (expr
) == 1;
2161 /* Return 1 if EXPR is an integer constant other than zero or a
2162 complex constant other than zero. */
2165 integer_nonzerop (const_tree expr
)
2169 return ((TREE_CODE (expr
) == INTEGER_CST
2170 && !wi::eq_p (expr
, 0))
2171 || (TREE_CODE (expr
) == COMPLEX_CST
2172 && (integer_nonzerop (TREE_REALPART (expr
))
2173 || integer_nonzerop (TREE_IMAGPART (expr
)))));
2176 /* Return 1 if EXPR is the fixed-point constant zero. */
2179 fixed_zerop (const_tree expr
)
2181 return (TREE_CODE (expr
) == FIXED_CST
2182 && TREE_FIXED_CST (expr
).data
.is_zero ());
2185 /* Return the power of two represented by a tree node known to be a
2189 tree_log2 (const_tree expr
)
2193 if (TREE_CODE (expr
) == COMPLEX_CST
)
2194 return tree_log2 (TREE_REALPART (expr
));
2196 return wi::exact_log2 (expr
);
2199 /* Similar, but return the largest integer Y such that 2 ** Y is less
2200 than or equal to EXPR. */
2203 tree_floor_log2 (const_tree expr
)
2207 if (TREE_CODE (expr
) == COMPLEX_CST
)
2208 return tree_log2 (TREE_REALPART (expr
));
2210 return wi::floor_log2 (expr
);
2213 /* Return number of known trailing zero bits in EXPR, or, if the value of
2214 EXPR is known to be zero, the precision of it's type. */
2217 tree_ctz (const_tree expr
)
2219 if (!INTEGRAL_TYPE_P (TREE_TYPE (expr
))
2220 && !POINTER_TYPE_P (TREE_TYPE (expr
)))
2223 unsigned int ret1
, ret2
, prec
= TYPE_PRECISION (TREE_TYPE (expr
));
2224 switch (TREE_CODE (expr
))
2227 ret1
= wi::ctz (expr
);
2228 return MIN (ret1
, prec
);
2230 ret1
= wi::ctz (get_nonzero_bits (expr
));
2231 return MIN (ret1
, prec
);
2238 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2241 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2242 return MIN (ret1
, ret2
);
2243 case POINTER_PLUS_EXPR
:
2244 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2245 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2246 /* Second operand is sizetype, which could be in theory
2247 wider than pointer's precision. Make sure we never
2248 return more than prec. */
2249 ret2
= MIN (ret2
, prec
);
2250 return MIN (ret1
, ret2
);
2252 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2253 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2254 return MAX (ret1
, ret2
);
2256 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2257 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2258 return MIN (ret1
+ ret2
, prec
);
2260 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2261 if (tree_fits_uhwi_p (TREE_OPERAND (expr
, 1))
2262 && (tree_to_uhwi (TREE_OPERAND (expr
, 1)) < prec
))
2264 ret2
= tree_to_uhwi (TREE_OPERAND (expr
, 1));
2265 return MIN (ret1
+ ret2
, prec
);
2269 if (tree_fits_uhwi_p (TREE_OPERAND (expr
, 1))
2270 && (tree_to_uhwi (TREE_OPERAND (expr
, 1)) < prec
))
2272 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2273 ret2
= tree_to_uhwi (TREE_OPERAND (expr
, 1));
2278 case TRUNC_DIV_EXPR
:
2280 case FLOOR_DIV_EXPR
:
2281 case ROUND_DIV_EXPR
:
2282 case EXACT_DIV_EXPR
:
2283 if (TREE_CODE (TREE_OPERAND (expr
, 1)) == INTEGER_CST
2284 && tree_int_cst_sgn (TREE_OPERAND (expr
, 1)) == 1)
2286 int l
= tree_log2 (TREE_OPERAND (expr
, 1));
2289 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2297 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2298 if (ret1
&& ret1
== TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (expr
, 0))))
2300 return MIN (ret1
, prec
);
2302 return tree_ctz (TREE_OPERAND (expr
, 0));
2304 ret1
= tree_ctz (TREE_OPERAND (expr
, 1));
2307 ret2
= tree_ctz (TREE_OPERAND (expr
, 2));
2308 return MIN (ret1
, ret2
);
2310 return tree_ctz (TREE_OPERAND (expr
, 1));
2312 ret1
= get_pointer_alignment (CONST_CAST_TREE (expr
));
2313 if (ret1
> BITS_PER_UNIT
)
2315 ret1
= ctz_hwi (ret1
/ BITS_PER_UNIT
);
2316 return MIN (ret1
, prec
);
2324 /* Return 1 if EXPR is the real constant zero. Trailing zeroes matter for
2325 decimal float constants, so don't return 1 for them. */
2328 real_zerop (const_tree expr
)
2332 switch (TREE_CODE (expr
))
2335 return REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst0
)
2336 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2338 return real_zerop (TREE_REALPART (expr
))
2339 && real_zerop (TREE_IMAGPART (expr
));
2343 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2344 if (!real_zerop (VECTOR_CST_ELT (expr
, i
)))
2353 /* Return 1 if EXPR is the real constant one in real or complex form.
2354 Trailing zeroes matter for decimal float constants, so don't return
2358 real_onep (const_tree expr
)
2362 switch (TREE_CODE (expr
))
2365 return REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst1
)
2366 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2368 return real_onep (TREE_REALPART (expr
))
2369 && real_zerop (TREE_IMAGPART (expr
));
2373 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2374 if (!real_onep (VECTOR_CST_ELT (expr
, i
)))
2383 /* Return 1 if EXPR is the real constant minus one. Trailing zeroes
2384 matter for decimal float constants, so don't return 1 for them. */
2387 real_minus_onep (const_tree expr
)
2391 switch (TREE_CODE (expr
))
2394 return REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconstm1
)
2395 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2397 return real_minus_onep (TREE_REALPART (expr
))
2398 && real_zerop (TREE_IMAGPART (expr
));
2402 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2403 if (!real_minus_onep (VECTOR_CST_ELT (expr
, i
)))
2412 /* Nonzero if EXP is a constant or a cast of a constant. */
2415 really_constant_p (const_tree exp
)
2417 /* This is not quite the same as STRIP_NOPS. It does more. */
2418 while (CONVERT_EXPR_P (exp
)
2419 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
2420 exp
= TREE_OPERAND (exp
, 0);
2421 return TREE_CONSTANT (exp
);
2424 /* Return first list element whose TREE_VALUE is ELEM.
2425 Return 0 if ELEM is not in LIST. */
2428 value_member (tree elem
, tree list
)
2432 if (elem
== TREE_VALUE (list
))
2434 list
= TREE_CHAIN (list
);
2439 /* Return first list element whose TREE_PURPOSE is ELEM.
2440 Return 0 if ELEM is not in LIST. */
2443 purpose_member (const_tree elem
, tree list
)
2447 if (elem
== TREE_PURPOSE (list
))
2449 list
= TREE_CHAIN (list
);
2454 /* Return true if ELEM is in V. */
2457 vec_member (const_tree elem
, vec
<tree
, va_gc
> *v
)
2461 FOR_EACH_VEC_SAFE_ELT (v
, ix
, t
)
2467 /* Returns element number IDX (zero-origin) of chain CHAIN, or
2471 chain_index (int idx
, tree chain
)
2473 for (; chain
&& idx
> 0; --idx
)
2474 chain
= TREE_CHAIN (chain
);
2478 /* Return nonzero if ELEM is part of the chain CHAIN. */
2481 chain_member (const_tree elem
, const_tree chain
)
2487 chain
= DECL_CHAIN (chain
);
2493 /* Return the length of a chain of nodes chained through TREE_CHAIN.
2494 We expect a null pointer to mark the end of the chain.
2495 This is the Lisp primitive `length'. */
2498 list_length (const_tree t
)
2501 #ifdef ENABLE_TREE_CHECKING
2509 #ifdef ENABLE_TREE_CHECKING
2512 gcc_assert (p
!= q
);
2520 /* Returns the first FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
2521 UNION_TYPE TYPE, or NULL_TREE if none. */
2524 first_field (const_tree type
)
2526 tree t
= TYPE_FIELDS (type
);
2527 while (t
&& TREE_CODE (t
) != FIELD_DECL
)
2532 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
2533 by modifying the last node in chain 1 to point to chain 2.
2534 This is the Lisp primitive `nconc'. */
2537 chainon (tree op1
, tree op2
)
2546 for (t1
= op1
; TREE_CHAIN (t1
); t1
= TREE_CHAIN (t1
))
2548 TREE_CHAIN (t1
) = op2
;
2550 #ifdef ENABLE_TREE_CHECKING
2553 for (t2
= op2
; t2
; t2
= TREE_CHAIN (t2
))
2554 gcc_assert (t2
!= t1
);
2561 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
2564 tree_last (tree chain
)
2568 while ((next
= TREE_CHAIN (chain
)))
2573 /* Reverse the order of elements in the chain T,
2574 and return the new head of the chain (old last element). */
2579 tree prev
= 0, decl
, next
;
2580 for (decl
= t
; decl
; decl
= next
)
2582 /* We shouldn't be using this function to reverse BLOCK chains; we
2583 have blocks_nreverse for that. */
2584 gcc_checking_assert (TREE_CODE (decl
) != BLOCK
);
2585 next
= TREE_CHAIN (decl
);
2586 TREE_CHAIN (decl
) = prev
;
2592 /* Return a newly created TREE_LIST node whose
2593 purpose and value fields are PARM and VALUE. */
2596 build_tree_list_stat (tree parm
, tree value MEM_STAT_DECL
)
2598 tree t
= make_node_stat (TREE_LIST PASS_MEM_STAT
);
2599 TREE_PURPOSE (t
) = parm
;
2600 TREE_VALUE (t
) = value
;
2604 /* Build a chain of TREE_LIST nodes from a vector. */
2607 build_tree_list_vec_stat (const vec
<tree
, va_gc
> *vec MEM_STAT_DECL
)
2609 tree ret
= NULL_TREE
;
2613 FOR_EACH_VEC_SAFE_ELT (vec
, i
, t
)
2615 *pp
= build_tree_list_stat (NULL
, t PASS_MEM_STAT
);
2616 pp
= &TREE_CHAIN (*pp
);
2621 /* Return a newly created TREE_LIST node whose
2622 purpose and value fields are PURPOSE and VALUE
2623 and whose TREE_CHAIN is CHAIN. */
2626 tree_cons_stat (tree purpose
, tree value
, tree chain MEM_STAT_DECL
)
2630 node
= ggc_alloc_tree_node_stat (sizeof (struct tree_list
) PASS_MEM_STAT
);
2631 memset (node
, 0, sizeof (struct tree_common
));
2633 record_node_allocation_statistics (TREE_LIST
, sizeof (struct tree_list
));
2635 TREE_SET_CODE (node
, TREE_LIST
);
2636 TREE_CHAIN (node
) = chain
;
2637 TREE_PURPOSE (node
) = purpose
;
2638 TREE_VALUE (node
) = value
;
2642 /* Return the values of the elements of a CONSTRUCTOR as a vector of
2646 ctor_to_vec (tree ctor
)
2648 vec
<tree
, va_gc
> *vec
;
2649 vec_alloc (vec
, CONSTRUCTOR_NELTS (ctor
));
2653 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), ix
, val
)
2654 vec
->quick_push (val
);
2659 /* Return the size nominally occupied by an object of type TYPE
2660 when it resides in memory. The value is measured in units of bytes,
2661 and its data type is that normally used for type sizes
2662 (which is the first type created by make_signed_type or
2663 make_unsigned_type). */
2666 size_in_bytes (const_tree type
)
2670 if (type
== error_mark_node
)
2671 return integer_zero_node
;
2673 type
= TYPE_MAIN_VARIANT (type
);
2674 t
= TYPE_SIZE_UNIT (type
);
2678 lang_hooks
.types
.incomplete_type_error (NULL_TREE
, type
);
2679 return size_zero_node
;
2685 /* Return the size of TYPE (in bytes) as a wide integer
2686 or return -1 if the size can vary or is larger than an integer. */
2689 int_size_in_bytes (const_tree type
)
2693 if (type
== error_mark_node
)
2696 type
= TYPE_MAIN_VARIANT (type
);
2697 t
= TYPE_SIZE_UNIT (type
);
2699 if (t
&& tree_fits_uhwi_p (t
))
2700 return TREE_INT_CST_LOW (t
);
2705 /* Return the maximum size of TYPE (in bytes) as a wide integer
2706 or return -1 if the size can vary or is larger than an integer. */
2709 max_int_size_in_bytes (const_tree type
)
2711 HOST_WIDE_INT size
= -1;
2714 /* If this is an array type, check for a possible MAX_SIZE attached. */
2716 if (TREE_CODE (type
) == ARRAY_TYPE
)
2718 size_tree
= TYPE_ARRAY_MAX_SIZE (type
);
2720 if (size_tree
&& tree_fits_uhwi_p (size_tree
))
2721 size
= tree_to_uhwi (size_tree
);
2724 /* If we still haven't been able to get a size, see if the language
2725 can compute a maximum size. */
2729 size_tree
= lang_hooks
.types
.max_size (type
);
2731 if (size_tree
&& tree_fits_uhwi_p (size_tree
))
2732 size
= tree_to_uhwi (size_tree
);
2738 /* Return the bit position of FIELD, in bits from the start of the record.
2739 This is a tree of type bitsizetype. */
2742 bit_position (const_tree field
)
2744 return bit_from_pos (DECL_FIELD_OFFSET (field
),
2745 DECL_FIELD_BIT_OFFSET (field
));
2748 /* Likewise, but return as an integer. It must be representable in
2749 that way (since it could be a signed value, we don't have the
2750 option of returning -1 like int_size_in_byte can. */
2753 int_bit_position (const_tree field
)
2755 return tree_to_shwi (bit_position (field
));
2758 /* Return the byte position of FIELD, in bytes from the start of the record.
2759 This is a tree of type sizetype. */
2762 byte_position (const_tree field
)
2764 return byte_from_pos (DECL_FIELD_OFFSET (field
),
2765 DECL_FIELD_BIT_OFFSET (field
));
2768 /* Likewise, but return as an integer. It must be representable in
2769 that way (since it could be a signed value, we don't have the
2770 option of returning -1 like int_size_in_byte can. */
2773 int_byte_position (const_tree field
)
2775 return tree_to_shwi (byte_position (field
));
2778 /* Return the strictest alignment, in bits, that T is known to have. */
2781 expr_align (const_tree t
)
2783 unsigned int align0
, align1
;
2785 switch (TREE_CODE (t
))
2787 CASE_CONVERT
: case NON_LVALUE_EXPR
:
2788 /* If we have conversions, we know that the alignment of the
2789 object must meet each of the alignments of the types. */
2790 align0
= expr_align (TREE_OPERAND (t
, 0));
2791 align1
= TYPE_ALIGN (TREE_TYPE (t
));
2792 return MAX (align0
, align1
);
2794 case SAVE_EXPR
: case COMPOUND_EXPR
: case MODIFY_EXPR
:
2795 case INIT_EXPR
: case TARGET_EXPR
: case WITH_CLEANUP_EXPR
:
2796 case CLEANUP_POINT_EXPR
:
2797 /* These don't change the alignment of an object. */
2798 return expr_align (TREE_OPERAND (t
, 0));
2801 /* The best we can do is say that the alignment is the least aligned
2803 align0
= expr_align (TREE_OPERAND (t
, 1));
2804 align1
= expr_align (TREE_OPERAND (t
, 2));
2805 return MIN (align0
, align1
);
2807 /* FIXME: LABEL_DECL and CONST_DECL never have DECL_ALIGN set
2808 meaningfully, it's always 1. */
2809 case LABEL_DECL
: case CONST_DECL
:
2810 case VAR_DECL
: case PARM_DECL
: case RESULT_DECL
:
2812 gcc_assert (DECL_ALIGN (t
) != 0);
2813 return DECL_ALIGN (t
);
2819 /* Otherwise take the alignment from that of the type. */
2820 return TYPE_ALIGN (TREE_TYPE (t
));
2823 /* Return, as a tree node, the number of elements for TYPE (which is an
2824 ARRAY_TYPE) minus one. This counts only elements of the top array. */
2827 array_type_nelts (const_tree type
)
2829 tree index_type
, min
, max
;
2831 /* If they did it with unspecified bounds, then we should have already
2832 given an error about it before we got here. */
2833 if (! TYPE_DOMAIN (type
))
2834 return error_mark_node
;
2836 index_type
= TYPE_DOMAIN (type
);
2837 min
= TYPE_MIN_VALUE (index_type
);
2838 max
= TYPE_MAX_VALUE (index_type
);
2840 /* TYPE_MAX_VALUE may not be set if the array has unknown length. */
2842 return error_mark_node
;
2844 return (integer_zerop (min
)
2846 : fold_build2 (MINUS_EXPR
, TREE_TYPE (max
), max
, min
));
2849 /* If arg is static -- a reference to an object in static storage -- then
2850 return the object. This is not the same as the C meaning of `static'.
2851 If arg isn't static, return NULL. */
2856 switch (TREE_CODE (arg
))
2859 /* Nested functions are static, even though taking their address will
2860 involve a trampoline as we unnest the nested function and create
2861 the trampoline on the tree level. */
2865 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
2866 && ! DECL_THREAD_LOCAL_P (arg
)
2867 && ! DECL_DLLIMPORT_P (arg
)
2871 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
2875 return TREE_STATIC (arg
) ? arg
: NULL
;
2882 /* If the thing being referenced is not a field, then it is
2883 something language specific. */
2884 gcc_assert (TREE_CODE (TREE_OPERAND (arg
, 1)) == FIELD_DECL
);
2886 /* If we are referencing a bitfield, we can't evaluate an
2887 ADDR_EXPR at compile time and so it isn't a constant. */
2888 if (DECL_BIT_FIELD (TREE_OPERAND (arg
, 1)))
2891 return staticp (TREE_OPERAND (arg
, 0));
2897 return TREE_CONSTANT (TREE_OPERAND (arg
, 0)) ? arg
: NULL
;
2900 case ARRAY_RANGE_REF
:
2901 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg
))) == INTEGER_CST
2902 && TREE_CODE (TREE_OPERAND (arg
, 1)) == INTEGER_CST
)
2903 return staticp (TREE_OPERAND (arg
, 0));
2907 case COMPOUND_LITERAL_EXPR
:
2908 return TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (arg
)) ? arg
: NULL
;
2918 /* Return whether OP is a DECL whose address is function-invariant. */
2921 decl_address_invariant_p (const_tree op
)
2923 /* The conditions below are slightly less strict than the one in
2926 switch (TREE_CODE (op
))
2935 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
2936 || DECL_THREAD_LOCAL_P (op
)
2937 || DECL_CONTEXT (op
) == current_function_decl
2938 || decl_function_context (op
) == current_function_decl
)
2943 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
2944 || decl_function_context (op
) == current_function_decl
)
2955 /* Return whether OP is a DECL whose address is interprocedural-invariant. */
2958 decl_address_ip_invariant_p (const_tree op
)
2960 /* The conditions below are slightly less strict than the one in
2963 switch (TREE_CODE (op
))
2971 if (((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
2972 && !DECL_DLLIMPORT_P (op
))
2973 || DECL_THREAD_LOCAL_P (op
))
2978 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
)))
2990 /* Return true if T is function-invariant (internal function, does
2991 not handle arithmetic; that's handled in skip_simple_arithmetic and
2992 tree_invariant_p). */
2994 static bool tree_invariant_p (tree t
);
2997 tree_invariant_p_1 (tree t
)
3001 if (TREE_CONSTANT (t
)
3002 || (TREE_READONLY (t
) && !TREE_SIDE_EFFECTS (t
)))
3005 switch (TREE_CODE (t
))
3011 op
= TREE_OPERAND (t
, 0);
3012 while (handled_component_p (op
))
3014 switch (TREE_CODE (op
))
3017 case ARRAY_RANGE_REF
:
3018 if (!tree_invariant_p (TREE_OPERAND (op
, 1))
3019 || TREE_OPERAND (op
, 2) != NULL_TREE
3020 || TREE_OPERAND (op
, 3) != NULL_TREE
)
3025 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
3031 op
= TREE_OPERAND (op
, 0);
3034 return CONSTANT_CLASS_P (op
) || decl_address_invariant_p (op
);
3043 /* Return true if T is function-invariant. */
3046 tree_invariant_p (tree t
)
3048 tree inner
= skip_simple_arithmetic (t
);
3049 return tree_invariant_p_1 (inner
);
3052 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
3053 Do this to any expression which may be used in more than one place,
3054 but must be evaluated only once.
3056 Normally, expand_expr would reevaluate the expression each time.
3057 Calling save_expr produces something that is evaluated and recorded
3058 the first time expand_expr is called on it. Subsequent calls to
3059 expand_expr just reuse the recorded value.
3061 The call to expand_expr that generates code that actually computes
3062 the value is the first call *at compile time*. Subsequent calls
3063 *at compile time* generate code to use the saved value.
3064 This produces correct result provided that *at run time* control
3065 always flows through the insns made by the first expand_expr
3066 before reaching the other places where the save_expr was evaluated.
3067 You, the caller of save_expr, must make sure this is so.
3069 Constants, and certain read-only nodes, are returned with no
3070 SAVE_EXPR because that is safe. Expressions containing placeholders
3071 are not touched; see tree.def for an explanation of what these
3075 save_expr (tree expr
)
3077 tree t
= fold (expr
);
3080 /* If the tree evaluates to a constant, then we don't want to hide that
3081 fact (i.e. this allows further folding, and direct checks for constants).
3082 However, a read-only object that has side effects cannot be bypassed.
3083 Since it is no problem to reevaluate literals, we just return the
3085 inner
= skip_simple_arithmetic (t
);
3086 if (TREE_CODE (inner
) == ERROR_MARK
)
3089 if (tree_invariant_p_1 (inner
))
3092 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
3093 it means that the size or offset of some field of an object depends on
3094 the value within another field.
3096 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
3097 and some variable since it would then need to be both evaluated once and
3098 evaluated more than once. Front-ends must assure this case cannot
3099 happen by surrounding any such subexpressions in their own SAVE_EXPR
3100 and forcing evaluation at the proper time. */
3101 if (contains_placeholder_p (inner
))
3104 t
= build1 (SAVE_EXPR
, TREE_TYPE (expr
), t
);
3105 SET_EXPR_LOCATION (t
, EXPR_LOCATION (expr
));
3107 /* This expression might be placed ahead of a jump to ensure that the
3108 value was computed on both sides of the jump. So make sure it isn't
3109 eliminated as dead. */
3110 TREE_SIDE_EFFECTS (t
) = 1;
3114 /* Look inside EXPR into any simple arithmetic operations. Return the
3115 outermost non-arithmetic or non-invariant node. */
3118 skip_simple_arithmetic (tree expr
)
3120 /* We don't care about whether this can be used as an lvalue in this
3122 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
3123 expr
= TREE_OPERAND (expr
, 0);
3125 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
3126 a constant, it will be more efficient to not make another SAVE_EXPR since
3127 it will allow better simplification and GCSE will be able to merge the
3128 computations if they actually occur. */
3131 if (UNARY_CLASS_P (expr
))
3132 expr
= TREE_OPERAND (expr
, 0);
3133 else if (BINARY_CLASS_P (expr
))
3135 if (tree_invariant_p (TREE_OPERAND (expr
, 1)))
3136 expr
= TREE_OPERAND (expr
, 0);
3137 else if (tree_invariant_p (TREE_OPERAND (expr
, 0)))
3138 expr
= TREE_OPERAND (expr
, 1);
3149 /* Look inside EXPR into simple arithmetic operations involving constants.
3150 Return the outermost non-arithmetic or non-constant node. */
3153 skip_simple_constant_arithmetic (tree expr
)
3155 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
3156 expr
= TREE_OPERAND (expr
, 0);
3160 if (UNARY_CLASS_P (expr
))
3161 expr
= TREE_OPERAND (expr
, 0);
3162 else if (BINARY_CLASS_P (expr
))
3164 if (TREE_CONSTANT (TREE_OPERAND (expr
, 1)))
3165 expr
= TREE_OPERAND (expr
, 0);
3166 else if (TREE_CONSTANT (TREE_OPERAND (expr
, 0)))
3167 expr
= TREE_OPERAND (expr
, 1);
3178 /* Return which tree structure is used by T. */
3180 enum tree_node_structure_enum
3181 tree_node_structure (const_tree t
)
3183 const enum tree_code code
= TREE_CODE (t
);
3184 return tree_node_structure_for_code (code
);
3187 /* Set various status flags when building a CALL_EXPR object T. */
3190 process_call_operands (tree t
)
3192 bool side_effects
= TREE_SIDE_EFFECTS (t
);
3193 bool read_only
= false;
3194 int i
= call_expr_flags (t
);
3196 /* Calls have side-effects, except those to const or pure functions. */
3197 if ((i
& ECF_LOOPING_CONST_OR_PURE
) || !(i
& (ECF_CONST
| ECF_PURE
)))
3198 side_effects
= true;
3199 /* Propagate TREE_READONLY of arguments for const functions. */
3203 if (!side_effects
|| read_only
)
3204 for (i
= 1; i
< TREE_OPERAND_LENGTH (t
); i
++)
3206 tree op
= TREE_OPERAND (t
, i
);
3207 if (op
&& TREE_SIDE_EFFECTS (op
))
3208 side_effects
= true;
3209 if (op
&& !TREE_READONLY (op
) && !CONSTANT_CLASS_P (op
))
3213 TREE_SIDE_EFFECTS (t
) = side_effects
;
3214 TREE_READONLY (t
) = read_only
;
3217 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
3218 size or offset that depends on a field within a record. */
3221 contains_placeholder_p (const_tree exp
)
3223 enum tree_code code
;
3228 code
= TREE_CODE (exp
);
3229 if (code
== PLACEHOLDER_EXPR
)
3232 switch (TREE_CODE_CLASS (code
))
3235 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
3236 position computations since they will be converted into a
3237 WITH_RECORD_EXPR involving the reference, which will assume
3238 here will be valid. */
3239 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
3241 case tcc_exceptional
:
3242 if (code
== TREE_LIST
)
3243 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp
))
3244 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp
)));
3249 case tcc_comparison
:
3250 case tcc_expression
:
3254 /* Ignoring the first operand isn't quite right, but works best. */
3255 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1));
3258 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
3259 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1))
3260 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 2)));
3263 /* The save_expr function never wraps anything containing
3264 a PLACEHOLDER_EXPR. */
3271 switch (TREE_CODE_LENGTH (code
))
3274 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
3276 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
3277 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1)));
3288 const_call_expr_arg_iterator iter
;
3289 FOR_EACH_CONST_CALL_EXPR_ARG (arg
, iter
, exp
)
3290 if (CONTAINS_PLACEHOLDER_P (arg
))
3304 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
3305 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
3309 type_contains_placeholder_1 (const_tree type
)
3311 /* If the size contains a placeholder or the parent type (component type in
3312 the case of arrays) type involves a placeholder, this type does. */
3313 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type
))
3314 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type
))
3315 || (!POINTER_TYPE_P (type
)
3317 && type_contains_placeholder_p (TREE_TYPE (type
))))
3320 /* Now do type-specific checks. Note that the last part of the check above
3321 greatly limits what we have to do below. */
3322 switch (TREE_CODE (type
))
3330 case REFERENCE_TYPE
:
3339 case FIXED_POINT_TYPE
:
3340 /* Here we just check the bounds. */
3341 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type
))
3342 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type
)));
3345 /* We have already checked the component type above, so just check the
3347 return type_contains_placeholder_p (TYPE_DOMAIN (type
));
3351 case QUAL_UNION_TYPE
:
3355 for (field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
3356 if (TREE_CODE (field
) == FIELD_DECL
3357 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field
))
3358 || (TREE_CODE (type
) == QUAL_UNION_TYPE
3359 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field
)))
3360 || type_contains_placeholder_p (TREE_TYPE (field
))))
3371 /* Wrapper around above function used to cache its result. */
3374 type_contains_placeholder_p (tree type
)
3378 /* If the contains_placeholder_bits field has been initialized,
3379 then we know the answer. */
3380 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) > 0)
3381 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) - 1;
3383 /* Indicate that we've seen this type node, and the answer is false.
3384 This is what we want to return if we run into recursion via fields. */
3385 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = 1;
3387 /* Compute the real value. */
3388 result
= type_contains_placeholder_1 (type
);
3390 /* Store the real value. */
3391 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = result
+ 1;
3396 /* Push tree EXP onto vector QUEUE if it is not already present. */
3399 push_without_duplicates (tree exp
, vec
<tree
> *queue
)
3404 FOR_EACH_VEC_ELT (*queue
, i
, iter
)
3405 if (simple_cst_equal (iter
, exp
) == 1)
3409 queue
->safe_push (exp
);
3412 /* Given a tree EXP, find all occurrences of references to fields
3413 in a PLACEHOLDER_EXPR and place them in vector REFS without
3414 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
3415 we assume here that EXP contains only arithmetic expressions
3416 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
3420 find_placeholder_in_expr (tree exp
, vec
<tree
> *refs
)
3422 enum tree_code code
= TREE_CODE (exp
);
3426 /* We handle TREE_LIST and COMPONENT_REF separately. */
3427 if (code
== TREE_LIST
)
3429 FIND_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), refs
);
3430 FIND_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), refs
);
3432 else if (code
== COMPONENT_REF
)
3434 for (inner
= TREE_OPERAND (exp
, 0);
3435 REFERENCE_CLASS_P (inner
);
3436 inner
= TREE_OPERAND (inner
, 0))
3439 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
)
3440 push_without_duplicates (exp
, refs
);
3442 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), refs
);
3445 switch (TREE_CODE_CLASS (code
))
3450 case tcc_declaration
:
3451 /* Variables allocated to static storage can stay. */
3452 if (!TREE_STATIC (exp
))
3453 push_without_duplicates (exp
, refs
);
3456 case tcc_expression
:
3457 /* This is the pattern built in ada/make_aligning_type. */
3458 if (code
== ADDR_EXPR
3459 && TREE_CODE (TREE_OPERAND (exp
, 0)) == PLACEHOLDER_EXPR
)
3461 push_without_duplicates (exp
, refs
);
3465 /* Fall through... */
3467 case tcc_exceptional
:
3470 case tcc_comparison
:
3472 for (i
= 0; i
< TREE_CODE_LENGTH (code
); i
++)
3473 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
3477 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3478 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
3486 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
3487 return a tree with all occurrences of references to F in a
3488 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
3489 CONST_DECLs. Note that we assume here that EXP contains only
3490 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
3491 occurring only in their argument list. */
3494 substitute_in_expr (tree exp
, tree f
, tree r
)
3496 enum tree_code code
= TREE_CODE (exp
);
3497 tree op0
, op1
, op2
, op3
;
3500 /* We handle TREE_LIST and COMPONENT_REF separately. */
3501 if (code
== TREE_LIST
)
3503 op0
= SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp
), f
, r
);
3504 op1
= SUBSTITUTE_IN_EXPR (TREE_VALUE (exp
), f
, r
);
3505 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
3508 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
3510 else if (code
== COMPONENT_REF
)
3514 /* If this expression is getting a value from a PLACEHOLDER_EXPR
3515 and it is the right field, replace it with R. */
3516 for (inner
= TREE_OPERAND (exp
, 0);
3517 REFERENCE_CLASS_P (inner
);
3518 inner
= TREE_OPERAND (inner
, 0))
3522 op1
= TREE_OPERAND (exp
, 1);
3524 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& op1
== f
)
3527 /* If this expression hasn't been completed let, leave it alone. */
3528 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& !TREE_TYPE (inner
))
3531 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3532 if (op0
== TREE_OPERAND (exp
, 0))
3536 = fold_build3 (COMPONENT_REF
, TREE_TYPE (exp
), op0
, op1
, NULL_TREE
);
3539 switch (TREE_CODE_CLASS (code
))
3544 case tcc_declaration
:
3550 case tcc_expression
:
3554 /* Fall through... */
3556 case tcc_exceptional
:
3559 case tcc_comparison
:
3561 switch (TREE_CODE_LENGTH (code
))
3567 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3568 if (op0
== TREE_OPERAND (exp
, 0))
3571 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
3575 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3576 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3578 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
3581 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
3585 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3586 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3587 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
3589 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3590 && op2
== TREE_OPERAND (exp
, 2))
3593 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
3597 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3598 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3599 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
3600 op3
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 3), f
, r
);
3602 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3603 && op2
== TREE_OPERAND (exp
, 2)
3604 && op3
== TREE_OPERAND (exp
, 3))
3608 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
3620 new_tree
= NULL_TREE
;
3622 /* If we are trying to replace F with a constant, inline back
3623 functions which do nothing else than computing a value from
3624 the arguments they are passed. This makes it possible to
3625 fold partially or entirely the replacement expression. */
3626 if (CONSTANT_CLASS_P (r
) && code
== CALL_EXPR
)
3628 tree t
= maybe_inline_call_in_expr (exp
);
3630 return SUBSTITUTE_IN_EXPR (t
, f
, r
);
3633 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3635 tree op
= TREE_OPERAND (exp
, i
);
3636 tree new_op
= SUBSTITUTE_IN_EXPR (op
, f
, r
);
3640 new_tree
= copy_node (exp
);
3641 TREE_OPERAND (new_tree
, i
) = new_op
;
3647 new_tree
= fold (new_tree
);
3648 if (TREE_CODE (new_tree
) == CALL_EXPR
)
3649 process_call_operands (new_tree
);
3660 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
3662 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
3663 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
3668 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
3669 for it within OBJ, a tree that is an object or a chain of references. */
3672 substitute_placeholder_in_expr (tree exp
, tree obj
)
3674 enum tree_code code
= TREE_CODE (exp
);
3675 tree op0
, op1
, op2
, op3
;
3678 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
3679 in the chain of OBJ. */
3680 if (code
== PLACEHOLDER_EXPR
)
3682 tree need_type
= TYPE_MAIN_VARIANT (TREE_TYPE (exp
));
3685 for (elt
= obj
; elt
!= 0;
3686 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
3687 || TREE_CODE (elt
) == COND_EXPR
)
3688 ? TREE_OPERAND (elt
, 1)
3689 : (REFERENCE_CLASS_P (elt
)
3690 || UNARY_CLASS_P (elt
)
3691 || BINARY_CLASS_P (elt
)
3692 || VL_EXP_CLASS_P (elt
)
3693 || EXPRESSION_CLASS_P (elt
))
3694 ? TREE_OPERAND (elt
, 0) : 0))
3695 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt
)) == need_type
)
3698 for (elt
= obj
; elt
!= 0;
3699 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
3700 || TREE_CODE (elt
) == COND_EXPR
)
3701 ? TREE_OPERAND (elt
, 1)
3702 : (REFERENCE_CLASS_P (elt
)
3703 || UNARY_CLASS_P (elt
)
3704 || BINARY_CLASS_P (elt
)
3705 || VL_EXP_CLASS_P (elt
)
3706 || EXPRESSION_CLASS_P (elt
))
3707 ? TREE_OPERAND (elt
, 0) : 0))
3708 if (POINTER_TYPE_P (TREE_TYPE (elt
))
3709 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt
)))
3711 return fold_build1 (INDIRECT_REF
, need_type
, elt
);
3713 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
3714 survives until RTL generation, there will be an error. */
3718 /* TREE_LIST is special because we need to look at TREE_VALUE
3719 and TREE_CHAIN, not TREE_OPERANDS. */
3720 else if (code
== TREE_LIST
)
3722 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), obj
);
3723 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), obj
);
3724 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
3727 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
3730 switch (TREE_CODE_CLASS (code
))
3733 case tcc_declaration
:
3736 case tcc_exceptional
:
3739 case tcc_comparison
:
3740 case tcc_expression
:
3743 switch (TREE_CODE_LENGTH (code
))
3749 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3750 if (op0
== TREE_OPERAND (exp
, 0))
3753 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
3757 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3758 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
3760 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
3763 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
3767 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3768 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
3769 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
3771 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3772 && op2
== TREE_OPERAND (exp
, 2))
3775 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
3779 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3780 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
3781 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
3782 op3
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 3), obj
);
3784 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3785 && op2
== TREE_OPERAND (exp
, 2)
3786 && op3
== TREE_OPERAND (exp
, 3))
3790 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
3802 new_tree
= NULL_TREE
;
3804 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3806 tree op
= TREE_OPERAND (exp
, i
);
3807 tree new_op
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (op
, obj
);
3811 new_tree
= copy_node (exp
);
3812 TREE_OPERAND (new_tree
, i
) = new_op
;
3818 new_tree
= fold (new_tree
);
3819 if (TREE_CODE (new_tree
) == CALL_EXPR
)
3820 process_call_operands (new_tree
);
3831 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
3833 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
3834 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
3840 /* Subroutine of stabilize_reference; this is called for subtrees of
3841 references. Any expression with side-effects must be put in a SAVE_EXPR
3842 to ensure that it is only evaluated once.
3844 We don't put SAVE_EXPR nodes around everything, because assigning very
3845 simple expressions to temporaries causes us to miss good opportunities
3846 for optimizations. Among other things, the opportunity to fold in the
3847 addition of a constant into an addressing mode often gets lost, e.g.
3848 "y[i+1] += x;". In general, we take the approach that we should not make
3849 an assignment unless we are forced into it - i.e., that any non-side effect
3850 operator should be allowed, and that cse should take care of coalescing
3851 multiple utterances of the same expression should that prove fruitful. */
3854 stabilize_reference_1 (tree e
)
3857 enum tree_code code
= TREE_CODE (e
);
3859 /* We cannot ignore const expressions because it might be a reference
3860 to a const array but whose index contains side-effects. But we can
3861 ignore things that are actual constant or that already have been
3862 handled by this function. */
3864 if (tree_invariant_p (e
))
3867 switch (TREE_CODE_CLASS (code
))
3869 case tcc_exceptional
:
3871 case tcc_declaration
:
3872 case tcc_comparison
:
3874 case tcc_expression
:
3877 /* If the expression has side-effects, then encase it in a SAVE_EXPR
3878 so that it will only be evaluated once. */
3879 /* The reference (r) and comparison (<) classes could be handled as
3880 below, but it is generally faster to only evaluate them once. */
3881 if (TREE_SIDE_EFFECTS (e
))
3882 return save_expr (e
);
3886 /* Constants need no processing. In fact, we should never reach
3891 /* Division is slow and tends to be compiled with jumps,
3892 especially the division by powers of 2 that is often
3893 found inside of an array reference. So do it just once. */
3894 if (code
== TRUNC_DIV_EXPR
|| code
== TRUNC_MOD_EXPR
3895 || code
== FLOOR_DIV_EXPR
|| code
== FLOOR_MOD_EXPR
3896 || code
== CEIL_DIV_EXPR
|| code
== CEIL_MOD_EXPR
3897 || code
== ROUND_DIV_EXPR
|| code
== ROUND_MOD_EXPR
)
3898 return save_expr (e
);
3899 /* Recursively stabilize each operand. */
3900 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)),
3901 stabilize_reference_1 (TREE_OPERAND (e
, 1)));
3905 /* Recursively stabilize each operand. */
3906 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)));
3913 TREE_TYPE (result
) = TREE_TYPE (e
);
3914 TREE_READONLY (result
) = TREE_READONLY (e
);
3915 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (e
);
3916 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (e
);
3921 /* Stabilize a reference so that we can use it any number of times
3922 without causing its operands to be evaluated more than once.
3923 Returns the stabilized reference. This works by means of save_expr,
3924 so see the caveats in the comments about save_expr.
3926 Also allows conversion expressions whose operands are references.
3927 Any other kind of expression is returned unchanged. */
3930 stabilize_reference (tree ref
)
3933 enum tree_code code
= TREE_CODE (ref
);
3940 /* No action is needed in this case. */
3945 case FIX_TRUNC_EXPR
:
3946 result
= build_nt (code
, stabilize_reference (TREE_OPERAND (ref
, 0)));
3950 result
= build_nt (INDIRECT_REF
,
3951 stabilize_reference_1 (TREE_OPERAND (ref
, 0)));
3955 result
= build_nt (COMPONENT_REF
,
3956 stabilize_reference (TREE_OPERAND (ref
, 0)),
3957 TREE_OPERAND (ref
, 1), NULL_TREE
);
3961 result
= build_nt (BIT_FIELD_REF
,
3962 stabilize_reference (TREE_OPERAND (ref
, 0)),
3963 TREE_OPERAND (ref
, 1), TREE_OPERAND (ref
, 2));
3967 result
= build_nt (ARRAY_REF
,
3968 stabilize_reference (TREE_OPERAND (ref
, 0)),
3969 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
3970 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
3973 case ARRAY_RANGE_REF
:
3974 result
= build_nt (ARRAY_RANGE_REF
,
3975 stabilize_reference (TREE_OPERAND (ref
, 0)),
3976 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
3977 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
3981 /* We cannot wrap the first expression in a SAVE_EXPR, as then
3982 it wouldn't be ignored. This matters when dealing with
3984 return stabilize_reference_1 (ref
);
3986 /* If arg isn't a kind of lvalue we recognize, make no change.
3987 Caller should recognize the error for an invalid lvalue. */
3992 return error_mark_node
;
3995 TREE_TYPE (result
) = TREE_TYPE (ref
);
3996 TREE_READONLY (result
) = TREE_READONLY (ref
);
3997 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (ref
);
3998 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (ref
);
4003 /* Low-level constructors for expressions. */
4005 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
4006 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
4009 recompute_tree_invariant_for_addr_expr (tree t
)
4012 bool tc
= true, se
= false;
4014 /* We started out assuming this address is both invariant and constant, but
4015 does not have side effects. Now go down any handled components and see if
4016 any of them involve offsets that are either non-constant or non-invariant.
4017 Also check for side-effects.
4019 ??? Note that this code makes no attempt to deal with the case where
4020 taking the address of something causes a copy due to misalignment. */
4022 #define UPDATE_FLAGS(NODE) \
4023 do { tree _node = (NODE); \
4024 if (_node && !TREE_CONSTANT (_node)) tc = false; \
4025 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
4027 for (node
= TREE_OPERAND (t
, 0); handled_component_p (node
);
4028 node
= TREE_OPERAND (node
, 0))
4030 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
4031 array reference (probably made temporarily by the G++ front end),
4032 so ignore all the operands. */
4033 if ((TREE_CODE (node
) == ARRAY_REF
4034 || TREE_CODE (node
) == ARRAY_RANGE_REF
)
4035 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node
, 0))) == ARRAY_TYPE
)
4037 UPDATE_FLAGS (TREE_OPERAND (node
, 1));
4038 if (TREE_OPERAND (node
, 2))
4039 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
4040 if (TREE_OPERAND (node
, 3))
4041 UPDATE_FLAGS (TREE_OPERAND (node
, 3));
4043 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
4044 FIELD_DECL, apparently. The G++ front end can put something else
4045 there, at least temporarily. */
4046 else if (TREE_CODE (node
) == COMPONENT_REF
4047 && TREE_CODE (TREE_OPERAND (node
, 1)) == FIELD_DECL
)
4049 if (TREE_OPERAND (node
, 2))
4050 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
4054 node
= lang_hooks
.expr_to_decl (node
, &tc
, &se
);
4056 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
4057 the address, since &(*a)->b is a form of addition. If it's a constant, the
4058 address is constant too. If it's a decl, its address is constant if the
4059 decl is static. Everything else is not constant and, furthermore,
4060 taking the address of a volatile variable is not volatile. */
4061 if (TREE_CODE (node
) == INDIRECT_REF
4062 || TREE_CODE (node
) == MEM_REF
)
4063 UPDATE_FLAGS (TREE_OPERAND (node
, 0));
4064 else if (CONSTANT_CLASS_P (node
))
4066 else if (DECL_P (node
))
4067 tc
&= (staticp (node
) != NULL_TREE
);
4071 se
|= TREE_SIDE_EFFECTS (node
);
4075 TREE_CONSTANT (t
) = tc
;
4076 TREE_SIDE_EFFECTS (t
) = se
;
4080 /* Build an expression of code CODE, data type TYPE, and operands as
4081 specified. Expressions and reference nodes can be created this way.
4082 Constants, decls, types and misc nodes cannot be.
4084 We define 5 non-variadic functions, from 0 to 4 arguments. This is
4085 enough for all extant tree codes. */
4088 build0_stat (enum tree_code code
, tree tt MEM_STAT_DECL
)
4092 gcc_assert (TREE_CODE_LENGTH (code
) == 0);
4094 t
= make_node_stat (code PASS_MEM_STAT
);
4101 build1_stat (enum tree_code code
, tree type
, tree node MEM_STAT_DECL
)
4103 int length
= sizeof (struct tree_exp
);
4106 record_node_allocation_statistics (code
, length
);
4108 gcc_assert (TREE_CODE_LENGTH (code
) == 1);
4110 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
4112 memset (t
, 0, sizeof (struct tree_common
));
4114 TREE_SET_CODE (t
, code
);
4116 TREE_TYPE (t
) = type
;
4117 SET_EXPR_LOCATION (t
, UNKNOWN_LOCATION
);
4118 TREE_OPERAND (t
, 0) = node
;
4119 if (node
&& !TYPE_P (node
))
4121 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (node
);
4122 TREE_READONLY (t
) = TREE_READONLY (node
);
4125 if (TREE_CODE_CLASS (code
) == tcc_statement
)
4126 TREE_SIDE_EFFECTS (t
) = 1;
4130 /* All of these have side-effects, no matter what their
4132 TREE_SIDE_EFFECTS (t
) = 1;
4133 TREE_READONLY (t
) = 0;
4137 /* Whether a dereference is readonly has nothing to do with whether
4138 its operand is readonly. */
4139 TREE_READONLY (t
) = 0;
4144 recompute_tree_invariant_for_addr_expr (t
);
4148 if ((TREE_CODE_CLASS (code
) == tcc_unary
|| code
== VIEW_CONVERT_EXPR
)
4149 && node
&& !TYPE_P (node
)
4150 && TREE_CONSTANT (node
))
4151 TREE_CONSTANT (t
) = 1;
4152 if (TREE_CODE_CLASS (code
) == tcc_reference
4153 && node
&& TREE_THIS_VOLATILE (node
))
4154 TREE_THIS_VOLATILE (t
) = 1;
4161 #define PROCESS_ARG(N) \
4163 TREE_OPERAND (t, N) = arg##N; \
4164 if (arg##N &&!TYPE_P (arg##N)) \
4166 if (TREE_SIDE_EFFECTS (arg##N)) \
4168 if (!TREE_READONLY (arg##N) \
4169 && !CONSTANT_CLASS_P (arg##N)) \
4170 (void) (read_only = 0); \
4171 if (!TREE_CONSTANT (arg##N)) \
4172 (void) (constant = 0); \
4177 build2_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1 MEM_STAT_DECL
)
4179 bool constant
, read_only
, side_effects
;
4182 gcc_assert (TREE_CODE_LENGTH (code
) == 2);
4184 if ((code
== MINUS_EXPR
|| code
== PLUS_EXPR
|| code
== MULT_EXPR
)
4185 && arg0
&& arg1
&& tt
&& POINTER_TYPE_P (tt
)
4186 /* When sizetype precision doesn't match that of pointers
4187 we need to be able to build explicit extensions or truncations
4188 of the offset argument. */
4189 && TYPE_PRECISION (sizetype
) == TYPE_PRECISION (tt
))
4190 gcc_assert (TREE_CODE (arg0
) == INTEGER_CST
4191 && TREE_CODE (arg1
) == INTEGER_CST
);
4193 if (code
== POINTER_PLUS_EXPR
&& arg0
&& arg1
&& tt
)
4194 gcc_assert (POINTER_TYPE_P (tt
) && POINTER_TYPE_P (TREE_TYPE (arg0
))
4195 && ptrofftype_p (TREE_TYPE (arg1
)));
4197 t
= make_node_stat (code PASS_MEM_STAT
);
4200 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
4201 result based on those same flags for the arguments. But if the
4202 arguments aren't really even `tree' expressions, we shouldn't be trying
4205 /* Expressions without side effects may be constant if their
4206 arguments are as well. */
4207 constant
= (TREE_CODE_CLASS (code
) == tcc_comparison
4208 || TREE_CODE_CLASS (code
) == tcc_binary
);
4210 side_effects
= TREE_SIDE_EFFECTS (t
);
4215 TREE_READONLY (t
) = read_only
;
4216 TREE_CONSTANT (t
) = constant
;
4217 TREE_SIDE_EFFECTS (t
) = side_effects
;
4218 TREE_THIS_VOLATILE (t
)
4219 = (TREE_CODE_CLASS (code
) == tcc_reference
4220 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4227 build3_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4228 tree arg2 MEM_STAT_DECL
)
4230 bool constant
, read_only
, side_effects
;
4233 gcc_assert (TREE_CODE_LENGTH (code
) == 3);
4234 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
4236 t
= make_node_stat (code PASS_MEM_STAT
);
4241 /* As a special exception, if COND_EXPR has NULL branches, we
4242 assume that it is a gimple statement and always consider
4243 it to have side effects. */
4244 if (code
== COND_EXPR
4245 && tt
== void_type_node
4246 && arg1
== NULL_TREE
4247 && arg2
== NULL_TREE
)
4248 side_effects
= true;
4250 side_effects
= TREE_SIDE_EFFECTS (t
);
4256 if (code
== COND_EXPR
)
4257 TREE_READONLY (t
) = read_only
;
4259 TREE_SIDE_EFFECTS (t
) = side_effects
;
4260 TREE_THIS_VOLATILE (t
)
4261 = (TREE_CODE_CLASS (code
) == tcc_reference
4262 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4268 build4_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4269 tree arg2
, tree arg3 MEM_STAT_DECL
)
4271 bool constant
, read_only
, side_effects
;
4274 gcc_assert (TREE_CODE_LENGTH (code
) == 4);
4276 t
= make_node_stat (code PASS_MEM_STAT
);
4279 side_effects
= TREE_SIDE_EFFECTS (t
);
4286 TREE_SIDE_EFFECTS (t
) = side_effects
;
4287 TREE_THIS_VOLATILE (t
)
4288 = (TREE_CODE_CLASS (code
) == tcc_reference
4289 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4295 build5_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4296 tree arg2
, tree arg3
, tree arg4 MEM_STAT_DECL
)
4298 bool constant
, read_only
, side_effects
;
4301 gcc_assert (TREE_CODE_LENGTH (code
) == 5);
4303 t
= make_node_stat (code PASS_MEM_STAT
);
4306 side_effects
= TREE_SIDE_EFFECTS (t
);
4314 TREE_SIDE_EFFECTS (t
) = side_effects
;
4315 TREE_THIS_VOLATILE (t
)
4316 = (TREE_CODE_CLASS (code
) == tcc_reference
4317 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4322 /* Build a simple MEM_REF tree with the sematics of a plain INDIRECT_REF
4323 on the pointer PTR. */
4326 build_simple_mem_ref_loc (location_t loc
, tree ptr
)
4328 HOST_WIDE_INT offset
= 0;
4329 tree ptype
= TREE_TYPE (ptr
);
4331 /* For convenience allow addresses that collapse to a simple base
4333 if (TREE_CODE (ptr
) == ADDR_EXPR
4334 && (handled_component_p (TREE_OPERAND (ptr
, 0))
4335 || TREE_CODE (TREE_OPERAND (ptr
, 0)) == MEM_REF
))
4337 ptr
= get_addr_base_and_unit_offset (TREE_OPERAND (ptr
, 0), &offset
);
4339 ptr
= build_fold_addr_expr (ptr
);
4340 gcc_assert (is_gimple_reg (ptr
) || is_gimple_min_invariant (ptr
));
4342 tem
= build2 (MEM_REF
, TREE_TYPE (ptype
),
4343 ptr
, build_int_cst (ptype
, offset
));
4344 SET_EXPR_LOCATION (tem
, loc
);
4348 /* Return the constant offset of a MEM_REF or TARGET_MEM_REF tree T. */
4351 mem_ref_offset (const_tree t
)
4353 return offset_int::from (TREE_OPERAND (t
, 1), SIGNED
);
4356 /* Return an invariant ADDR_EXPR of type TYPE taking the address of BASE
4357 offsetted by OFFSET units. */
4360 build_invariant_address (tree type
, tree base
, HOST_WIDE_INT offset
)
4362 tree ref
= fold_build2 (MEM_REF
, TREE_TYPE (type
),
4363 build_fold_addr_expr (base
),
4364 build_int_cst (ptr_type_node
, offset
));
4365 tree addr
= build1 (ADDR_EXPR
, type
, ref
);
4366 recompute_tree_invariant_for_addr_expr (addr
);
4370 /* Similar except don't specify the TREE_TYPE
4371 and leave the TREE_SIDE_EFFECTS as 0.
4372 It is permissible for arguments to be null,
4373 or even garbage if their values do not matter. */
4376 build_nt (enum tree_code code
, ...)
4383 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
4387 t
= make_node (code
);
4388 length
= TREE_CODE_LENGTH (code
);
4390 for (i
= 0; i
< length
; i
++)
4391 TREE_OPERAND (t
, i
) = va_arg (p
, tree
);
4397 /* Similar to build_nt, but for creating a CALL_EXPR object with a
4401 build_nt_call_vec (tree fn
, vec
<tree
, va_gc
> *args
)
4406 ret
= build_vl_exp (CALL_EXPR
, vec_safe_length (args
) + 3);
4407 CALL_EXPR_FN (ret
) = fn
;
4408 CALL_EXPR_STATIC_CHAIN (ret
) = NULL_TREE
;
4409 FOR_EACH_VEC_SAFE_ELT (args
, ix
, t
)
4410 CALL_EXPR_ARG (ret
, ix
) = t
;
4414 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
4415 We do NOT enter this node in any sort of symbol table.
4417 LOC is the location of the decl.
4419 layout_decl is used to set up the decl's storage layout.
4420 Other slots are initialized to 0 or null pointers. */
4423 build_decl_stat (location_t loc
, enum tree_code code
, tree name
,
4424 tree type MEM_STAT_DECL
)
4428 t
= make_node_stat (code PASS_MEM_STAT
);
4429 DECL_SOURCE_LOCATION (t
) = loc
;
4431 /* if (type == error_mark_node)
4432 type = integer_type_node; */
4433 /* That is not done, deliberately, so that having error_mark_node
4434 as the type can suppress useless errors in the use of this variable. */
4436 DECL_NAME (t
) = name
;
4437 TREE_TYPE (t
) = type
;
4439 if (code
== VAR_DECL
|| code
== PARM_DECL
|| code
== RESULT_DECL
)
4445 /* Builds and returns function declaration with NAME and TYPE. */
4448 build_fn_decl (const char *name
, tree type
)
4450 tree id
= get_identifier (name
);
4451 tree decl
= build_decl (input_location
, FUNCTION_DECL
, id
, type
);
4453 DECL_EXTERNAL (decl
) = 1;
4454 TREE_PUBLIC (decl
) = 1;
4455 DECL_ARTIFICIAL (decl
) = 1;
4456 TREE_NOTHROW (decl
) = 1;
4461 vec
<tree
, va_gc
> *all_translation_units
;
4463 /* Builds a new translation-unit decl with name NAME, queues it in the
4464 global list of translation-unit decls and returns it. */
4467 build_translation_unit_decl (tree name
)
4469 tree tu
= build_decl (UNKNOWN_LOCATION
, TRANSLATION_UNIT_DECL
,
4471 TRANSLATION_UNIT_LANGUAGE (tu
) = lang_hooks
.name
;
4472 vec_safe_push (all_translation_units
, tu
);
4477 /* BLOCK nodes are used to represent the structure of binding contours
4478 and declarations, once those contours have been exited and their contents
4479 compiled. This information is used for outputting debugging info. */
4482 build_block (tree vars
, tree subblocks
, tree supercontext
, tree chain
)
4484 tree block
= make_node (BLOCK
);
4486 BLOCK_VARS (block
) = vars
;
4487 BLOCK_SUBBLOCKS (block
) = subblocks
;
4488 BLOCK_SUPERCONTEXT (block
) = supercontext
;
4489 BLOCK_CHAIN (block
) = chain
;
4494 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
4496 LOC is the location to use in tree T. */
4499 protected_set_expr_location (tree t
, location_t loc
)
4501 if (t
&& CAN_HAVE_LOCATION_P (t
))
4502 SET_EXPR_LOCATION (t
, loc
);
4505 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
4509 build_decl_attribute_variant (tree ddecl
, tree attribute
)
4511 DECL_ATTRIBUTES (ddecl
) = attribute
;
4515 /* Borrowed from hashtab.c iterative_hash implementation. */
4516 #define mix(a,b,c) \
4518 a -= b; a -= c; a ^= (c>>13); \
4519 b -= c; b -= a; b ^= (a<< 8); \
4520 c -= a; c -= b; c ^= ((b&0xffffffff)>>13); \
4521 a -= b; a -= c; a ^= ((c&0xffffffff)>>12); \
4522 b -= c; b -= a; b = (b ^ (a<<16)) & 0xffffffff; \
4523 c -= a; c -= b; c = (c ^ (b>> 5)) & 0xffffffff; \
4524 a -= b; a -= c; a = (a ^ (c>> 3)) & 0xffffffff; \
4525 b -= c; b -= a; b = (b ^ (a<<10)) & 0xffffffff; \
4526 c -= a; c -= b; c = (c ^ (b>>15)) & 0xffffffff; \
4530 /* Produce good hash value combining VAL and VAL2. */
4532 iterative_hash_hashval_t (hashval_t val
, hashval_t val2
)
4534 /* the golden ratio; an arbitrary value. */
4535 hashval_t a
= 0x9e3779b9;
4541 /* Produce good hash value combining VAL and VAL2. */
4543 iterative_hash_host_wide_int (HOST_WIDE_INT val
, hashval_t val2
)
4545 if (sizeof (HOST_WIDE_INT
) == sizeof (hashval_t
))
4546 return iterative_hash_hashval_t (val
, val2
);
4549 hashval_t a
= (hashval_t
) val
;
4550 /* Avoid warnings about shifting of more than the width of the type on
4551 hosts that won't execute this path. */
4553 hashval_t b
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 8 + zero
));
4555 if (sizeof (HOST_WIDE_INT
) > 2 * sizeof (hashval_t
))
4557 hashval_t a
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 16 + zero
));
4558 hashval_t b
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 24 + zero
));
4565 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4566 is ATTRIBUTE and its qualifiers are QUALS.
4568 Record such modified types already made so we don't make duplicates. */
4571 build_type_attribute_qual_variant (tree ttype
, tree attribute
, int quals
)
4573 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype
), attribute
))
4575 hashval_t hashcode
= 0;
4579 enum tree_code code
= TREE_CODE (ttype
);
4581 /* Building a distinct copy of a tagged type is inappropriate; it
4582 causes breakage in code that expects there to be a one-to-one
4583 relationship between a struct and its fields.
4584 build_duplicate_type is another solution (as used in
4585 handle_transparent_union_attribute), but that doesn't play well
4586 with the stronger C++ type identity model. */
4587 if (TREE_CODE (ttype
) == RECORD_TYPE
4588 || TREE_CODE (ttype
) == UNION_TYPE
4589 || TREE_CODE (ttype
) == QUAL_UNION_TYPE
4590 || TREE_CODE (ttype
) == ENUMERAL_TYPE
)
4592 warning (OPT_Wattributes
,
4593 "ignoring attributes applied to %qT after definition",
4594 TYPE_MAIN_VARIANT (ttype
));
4595 return build_qualified_type (ttype
, quals
);
4598 ttype
= build_qualified_type (ttype
, TYPE_UNQUALIFIED
);
4599 ntype
= build_distinct_type_copy (ttype
);
4601 TYPE_ATTRIBUTES (ntype
) = attribute
;
4603 hashcode
= iterative_hash_object (code
, hashcode
);
4604 if (TREE_TYPE (ntype
))
4605 hashcode
= iterative_hash_object (TYPE_HASH (TREE_TYPE (ntype
)),
4607 hashcode
= attribute_hash_list (attribute
, hashcode
);
4609 switch (TREE_CODE (ntype
))
4612 hashcode
= type_hash_list (TYPE_ARG_TYPES (ntype
), hashcode
);
4615 if (TYPE_DOMAIN (ntype
))
4616 hashcode
= iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (ntype
)),
4620 t
= TYPE_MAX_VALUE (ntype
);
4621 for (i
= 0; i
< TREE_INT_CST_NUNITS (t
); i
++)
4622 hashcode
= iterative_hash_object (TREE_INT_CST_ELT (t
, i
), hashcode
);
4625 case FIXED_POINT_TYPE
:
4627 unsigned int precision
= TYPE_PRECISION (ntype
);
4628 hashcode
= iterative_hash_object (precision
, hashcode
);
4635 ntype
= type_hash_canon (hashcode
, ntype
);
4637 /* If the target-dependent attributes make NTYPE different from
4638 its canonical type, we will need to use structural equality
4639 checks for this type. */
4640 if (TYPE_STRUCTURAL_EQUALITY_P (ttype
)
4641 || !comp_type_attributes (ntype
, ttype
))
4642 SET_TYPE_STRUCTURAL_EQUALITY (ntype
);
4643 else if (TYPE_CANONICAL (ntype
) == ntype
)
4644 TYPE_CANONICAL (ntype
) = TYPE_CANONICAL (ttype
);
4646 ttype
= build_qualified_type (ntype
, quals
);
4648 else if (TYPE_QUALS (ttype
) != quals
)
4649 ttype
= build_qualified_type (ttype
, quals
);
4654 /* Check if "omp declare simd" attribute arguments, CLAUSES1 and CLAUSES2, are
4658 omp_declare_simd_clauses_equal (tree clauses1
, tree clauses2
)
4661 for (cl1
= clauses1
, cl2
= clauses2
;
4663 cl1
= OMP_CLAUSE_CHAIN (cl1
), cl2
= OMP_CLAUSE_CHAIN (cl2
))
4665 if (OMP_CLAUSE_CODE (cl1
) != OMP_CLAUSE_CODE (cl2
))
4667 if (OMP_CLAUSE_CODE (cl1
) != OMP_CLAUSE_SIMDLEN
)
4669 if (simple_cst_equal (OMP_CLAUSE_DECL (cl1
),
4670 OMP_CLAUSE_DECL (cl2
)) != 1)
4673 switch (OMP_CLAUSE_CODE (cl1
))
4675 case OMP_CLAUSE_ALIGNED
:
4676 if (simple_cst_equal (OMP_CLAUSE_ALIGNED_ALIGNMENT (cl1
),
4677 OMP_CLAUSE_ALIGNED_ALIGNMENT (cl2
)) != 1)
4680 case OMP_CLAUSE_LINEAR
:
4681 if (simple_cst_equal (OMP_CLAUSE_LINEAR_STEP (cl1
),
4682 OMP_CLAUSE_LINEAR_STEP (cl2
)) != 1)
4685 case OMP_CLAUSE_SIMDLEN
:
4686 if (simple_cst_equal (OMP_CLAUSE_SIMDLEN_EXPR (cl1
),
4687 OMP_CLAUSE_SIMDLEN_EXPR (cl2
)) != 1)
4696 /* Compare two constructor-element-type constants. Return 1 if the lists
4697 are known to be equal; otherwise return 0. */
4700 simple_cst_list_equal (const_tree l1
, const_tree l2
)
4702 while (l1
!= NULL_TREE
&& l2
!= NULL_TREE
)
4704 if (simple_cst_equal (TREE_VALUE (l1
), TREE_VALUE (l2
)) != 1)
4707 l1
= TREE_CHAIN (l1
);
4708 l2
= TREE_CHAIN (l2
);
4714 /* Compare two attributes for their value identity. Return true if the
4715 attribute values are known to be equal; otherwise return false.
4719 attribute_value_equal (const_tree attr1
, const_tree attr2
)
4721 if (TREE_VALUE (attr1
) == TREE_VALUE (attr2
))
4724 if (TREE_VALUE (attr1
) != NULL_TREE
4725 && TREE_CODE (TREE_VALUE (attr1
)) == TREE_LIST
4726 && TREE_VALUE (attr2
) != NULL
4727 && TREE_CODE (TREE_VALUE (attr2
)) == TREE_LIST
)
4728 return (simple_cst_list_equal (TREE_VALUE (attr1
),
4729 TREE_VALUE (attr2
)) == 1);
4731 if ((flag_openmp
|| flag_openmp_simd
)
4732 && TREE_VALUE (attr1
) && TREE_VALUE (attr2
)
4733 && TREE_CODE (TREE_VALUE (attr1
)) == OMP_CLAUSE
4734 && TREE_CODE (TREE_VALUE (attr2
)) == OMP_CLAUSE
)
4735 return omp_declare_simd_clauses_equal (TREE_VALUE (attr1
),
4736 TREE_VALUE (attr2
));
4738 return (simple_cst_equal (TREE_VALUE (attr1
), TREE_VALUE (attr2
)) == 1);
4741 /* Return 0 if the attributes for two types are incompatible, 1 if they
4742 are compatible, and 2 if they are nearly compatible (which causes a
4743 warning to be generated). */
4745 comp_type_attributes (const_tree type1
, const_tree type2
)
4747 const_tree a1
= TYPE_ATTRIBUTES (type1
);
4748 const_tree a2
= TYPE_ATTRIBUTES (type2
);
4753 for (a
= a1
; a
!= NULL_TREE
; a
= TREE_CHAIN (a
))
4755 const struct attribute_spec
*as
;
4758 as
= lookup_attribute_spec (get_attribute_name (a
));
4759 if (!as
|| as
->affects_type_identity
== false)
4762 attr
= lookup_attribute (as
->name
, CONST_CAST_TREE (a2
));
4763 if (!attr
|| !attribute_value_equal (a
, attr
))
4768 for (a
= a2
; a
!= NULL_TREE
; a
= TREE_CHAIN (a
))
4770 const struct attribute_spec
*as
;
4772 as
= lookup_attribute_spec (get_attribute_name (a
));
4773 if (!as
|| as
->affects_type_identity
== false)
4776 if (!lookup_attribute (as
->name
, CONST_CAST_TREE (a1
)))
4778 /* We don't need to compare trees again, as we did this
4779 already in first loop. */
4781 /* All types - affecting identity - are equal, so
4782 there is no need to call target hook for comparison. */
4786 /* As some type combinations - like default calling-convention - might
4787 be compatible, we have to call the target hook to get the final result. */
4788 return targetm
.comp_type_attributes (type1
, type2
);
4791 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4794 Record such modified types already made so we don't make duplicates. */
4797 build_type_attribute_variant (tree ttype
, tree attribute
)
4799 return build_type_attribute_qual_variant (ttype
, attribute
,
4800 TYPE_QUALS (ttype
));
4804 /* Reset the expression *EXPR_P, a size or position.
4806 ??? We could reset all non-constant sizes or positions. But it's cheap
4807 enough to not do so and refrain from adding workarounds to dwarf2out.c.
4809 We need to reset self-referential sizes or positions because they cannot
4810 be gimplified and thus can contain a CALL_EXPR after the gimplification
4811 is finished, which will run afoul of LTO streaming. And they need to be
4812 reset to something essentially dummy but not constant, so as to preserve
4813 the properties of the object they are attached to. */
4816 free_lang_data_in_one_sizepos (tree
*expr_p
)
4818 tree expr
= *expr_p
;
4819 if (CONTAINS_PLACEHOLDER_P (expr
))
4820 *expr_p
= build0 (PLACEHOLDER_EXPR
, TREE_TYPE (expr
));
4824 /* Reset all the fields in a binfo node BINFO. We only keep
4825 BINFO_VTABLE, which is used by gimple_fold_obj_type_ref. */
4828 free_lang_data_in_binfo (tree binfo
)
4833 gcc_assert (TREE_CODE (binfo
) == TREE_BINFO
);
4835 BINFO_VIRTUALS (binfo
) = NULL_TREE
;
4836 BINFO_BASE_ACCESSES (binfo
) = NULL
;
4837 BINFO_INHERITANCE_CHAIN (binfo
) = NULL_TREE
;
4838 BINFO_SUBVTT_INDEX (binfo
) = NULL_TREE
;
4840 FOR_EACH_VEC_ELT (*BINFO_BASE_BINFOS (binfo
), i
, t
)
4841 free_lang_data_in_binfo (t
);
4845 /* Reset all language specific information still present in TYPE. */
4848 free_lang_data_in_type (tree type
)
4850 gcc_assert (TYPE_P (type
));
4852 /* Give the FE a chance to remove its own data first. */
4853 lang_hooks
.free_lang_data (type
);
4855 TREE_LANG_FLAG_0 (type
) = 0;
4856 TREE_LANG_FLAG_1 (type
) = 0;
4857 TREE_LANG_FLAG_2 (type
) = 0;
4858 TREE_LANG_FLAG_3 (type
) = 0;
4859 TREE_LANG_FLAG_4 (type
) = 0;
4860 TREE_LANG_FLAG_5 (type
) = 0;
4861 TREE_LANG_FLAG_6 (type
) = 0;
4863 if (TREE_CODE (type
) == FUNCTION_TYPE
)
4865 /* Remove the const and volatile qualifiers from arguments. The
4866 C++ front end removes them, but the C front end does not,
4867 leading to false ODR violation errors when merging two
4868 instances of the same function signature compiled by
4869 different front ends. */
4872 for (p
= TYPE_ARG_TYPES (type
); p
; p
= TREE_CHAIN (p
))
4874 tree arg_type
= TREE_VALUE (p
);
4876 if (TYPE_READONLY (arg_type
) || TYPE_VOLATILE (arg_type
))
4878 int quals
= TYPE_QUALS (arg_type
)
4880 & ~TYPE_QUAL_VOLATILE
;
4881 TREE_VALUE (p
) = build_qualified_type (arg_type
, quals
);
4882 free_lang_data_in_type (TREE_VALUE (p
));
4887 /* Remove members that are not actually FIELD_DECLs from the field
4888 list of an aggregate. These occur in C++. */
4889 if (RECORD_OR_UNION_TYPE_P (type
))
4893 /* Note that TYPE_FIELDS can be shared across distinct
4894 TREE_TYPEs. Therefore, if the first field of TYPE_FIELDS is
4895 to be removed, we cannot set its TREE_CHAIN to NULL.
4896 Otherwise, we would not be able to find all the other fields
4897 in the other instances of this TREE_TYPE.
4899 This was causing an ICE in testsuite/g++.dg/lto/20080915.C. */
4901 member
= TYPE_FIELDS (type
);
4904 if (TREE_CODE (member
) == FIELD_DECL
4905 || TREE_CODE (member
) == TYPE_DECL
)
4908 TREE_CHAIN (prev
) = member
;
4910 TYPE_FIELDS (type
) = member
;
4914 member
= TREE_CHAIN (member
);
4918 TREE_CHAIN (prev
) = NULL_TREE
;
4920 TYPE_FIELDS (type
) = NULL_TREE
;
4922 TYPE_METHODS (type
) = NULL_TREE
;
4923 if (TYPE_BINFO (type
))
4924 free_lang_data_in_binfo (TYPE_BINFO (type
));
4928 /* For non-aggregate types, clear out the language slot (which
4929 overloads TYPE_BINFO). */
4930 TYPE_LANG_SLOT_1 (type
) = NULL_TREE
;
4932 if (INTEGRAL_TYPE_P (type
)
4933 || SCALAR_FLOAT_TYPE_P (type
)
4934 || FIXED_POINT_TYPE_P (type
))
4936 free_lang_data_in_one_sizepos (&TYPE_MIN_VALUE (type
));
4937 free_lang_data_in_one_sizepos (&TYPE_MAX_VALUE (type
));
4941 free_lang_data_in_one_sizepos (&TYPE_SIZE (type
));
4942 free_lang_data_in_one_sizepos (&TYPE_SIZE_UNIT (type
));
4944 if (TYPE_CONTEXT (type
)
4945 && TREE_CODE (TYPE_CONTEXT (type
)) == BLOCK
)
4947 tree ctx
= TYPE_CONTEXT (type
);
4950 ctx
= BLOCK_SUPERCONTEXT (ctx
);
4952 while (ctx
&& TREE_CODE (ctx
) == BLOCK
);
4953 TYPE_CONTEXT (type
) = ctx
;
4958 /* Return true if DECL may need an assembler name to be set. */
4961 need_assembler_name_p (tree decl
)
4963 /* Only FUNCTION_DECLs and VAR_DECLs are considered. */
4964 if (TREE_CODE (decl
) != FUNCTION_DECL
4965 && TREE_CODE (decl
) != VAR_DECL
)
4968 /* If DECL already has its assembler name set, it does not need a
4970 if (!HAS_DECL_ASSEMBLER_NAME_P (decl
)
4971 || DECL_ASSEMBLER_NAME_SET_P (decl
))
4974 /* Abstract decls do not need an assembler name. */
4975 if (DECL_ABSTRACT (decl
))
4978 /* For VAR_DECLs, only static, public and external symbols need an
4980 if (TREE_CODE (decl
) == VAR_DECL
4981 && !TREE_STATIC (decl
)
4982 && !TREE_PUBLIC (decl
)
4983 && !DECL_EXTERNAL (decl
))
4986 if (TREE_CODE (decl
) == FUNCTION_DECL
)
4988 /* Do not set assembler name on builtins. Allow RTL expansion to
4989 decide whether to expand inline or via a regular call. */
4990 if (DECL_BUILT_IN (decl
)
4991 && DECL_BUILT_IN_CLASS (decl
) != BUILT_IN_FRONTEND
)
4994 /* Functions represented in the callgraph need an assembler name. */
4995 if (cgraph_get_node (decl
) != NULL
)
4998 /* Unused and not public functions don't need an assembler name. */
4999 if (!TREE_USED (decl
) && !TREE_PUBLIC (decl
))
5007 /* Reset all language specific information still present in symbol
5011 free_lang_data_in_decl (tree decl
)
5013 gcc_assert (DECL_P (decl
));
5015 /* Give the FE a chance to remove its own data first. */
5016 lang_hooks
.free_lang_data (decl
);
5018 TREE_LANG_FLAG_0 (decl
) = 0;
5019 TREE_LANG_FLAG_1 (decl
) = 0;
5020 TREE_LANG_FLAG_2 (decl
) = 0;
5021 TREE_LANG_FLAG_3 (decl
) = 0;
5022 TREE_LANG_FLAG_4 (decl
) = 0;
5023 TREE_LANG_FLAG_5 (decl
) = 0;
5024 TREE_LANG_FLAG_6 (decl
) = 0;
5026 free_lang_data_in_one_sizepos (&DECL_SIZE (decl
));
5027 free_lang_data_in_one_sizepos (&DECL_SIZE_UNIT (decl
));
5028 if (TREE_CODE (decl
) == FIELD_DECL
)
5030 free_lang_data_in_one_sizepos (&DECL_FIELD_OFFSET (decl
));
5031 if (TREE_CODE (DECL_CONTEXT (decl
)) == QUAL_UNION_TYPE
)
5032 DECL_QUALIFIER (decl
) = NULL_TREE
;
5035 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5037 struct cgraph_node
*node
;
5038 if (!(node
= cgraph_get_node (decl
))
5039 || (!node
->definition
&& !node
->clones
))
5042 cgraph_release_function_body (node
);
5045 release_function_body (decl
);
5046 DECL_ARGUMENTS (decl
) = NULL
;
5047 DECL_RESULT (decl
) = NULL
;
5048 DECL_INITIAL (decl
) = error_mark_node
;
5051 if (gimple_has_body_p (decl
))
5055 /* If DECL has a gimple body, then the context for its
5056 arguments must be DECL. Otherwise, it doesn't really
5057 matter, as we will not be emitting any code for DECL. In
5058 general, there may be other instances of DECL created by
5059 the front end and since PARM_DECLs are generally shared,
5060 their DECL_CONTEXT changes as the replicas of DECL are
5061 created. The only time where DECL_CONTEXT is important
5062 is for the FUNCTION_DECLs that have a gimple body (since
5063 the PARM_DECL will be used in the function's body). */
5064 for (t
= DECL_ARGUMENTS (decl
); t
; t
= TREE_CHAIN (t
))
5065 DECL_CONTEXT (t
) = decl
;
5068 /* DECL_SAVED_TREE holds the GENERIC representation for DECL.
5069 At this point, it is not needed anymore. */
5070 DECL_SAVED_TREE (decl
) = NULL_TREE
;
5072 /* Clear the abstract origin if it refers to a method. Otherwise
5073 dwarf2out.c will ICE as we clear TYPE_METHODS and thus the
5074 origin will not be output correctly. */
5075 if (DECL_ABSTRACT_ORIGIN (decl
)
5076 && DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))
5077 && RECORD_OR_UNION_TYPE_P
5078 (DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))))
5079 DECL_ABSTRACT_ORIGIN (decl
) = NULL_TREE
;
5081 /* Sometimes the C++ frontend doesn't manage to transform a temporary
5082 DECL_VINDEX referring to itself into a vtable slot number as it
5083 should. Happens with functions that are copied and then forgotten
5084 about. Just clear it, it won't matter anymore. */
5085 if (DECL_VINDEX (decl
) && !tree_fits_shwi_p (DECL_VINDEX (decl
)))
5086 DECL_VINDEX (decl
) = NULL_TREE
;
5088 else if (TREE_CODE (decl
) == VAR_DECL
)
5090 if ((DECL_EXTERNAL (decl
)
5091 && (!TREE_STATIC (decl
) || !TREE_READONLY (decl
)))
5092 || (decl_function_context (decl
) && !TREE_STATIC (decl
)))
5093 DECL_INITIAL (decl
) = NULL_TREE
;
5095 else if (TREE_CODE (decl
) == TYPE_DECL
5096 || TREE_CODE (decl
) == FIELD_DECL
)
5097 DECL_INITIAL (decl
) = NULL_TREE
;
5098 else if (TREE_CODE (decl
) == TRANSLATION_UNIT_DECL
5099 && DECL_INITIAL (decl
)
5100 && TREE_CODE (DECL_INITIAL (decl
)) == BLOCK
)
5102 /* Strip builtins from the translation-unit BLOCK. We still have targets
5103 without builtin_decl_explicit support and also builtins are shared
5104 nodes and thus we can't use TREE_CHAIN in multiple lists. */
5105 tree
*nextp
= &BLOCK_VARS (DECL_INITIAL (decl
));
5109 if (TREE_CODE (var
) == FUNCTION_DECL
5110 && DECL_BUILT_IN (var
))
5111 *nextp
= TREE_CHAIN (var
);
5113 nextp
= &TREE_CHAIN (var
);
5119 /* Data used when collecting DECLs and TYPEs for language data removal. */
5121 struct free_lang_data_d
5123 /* Worklist to avoid excessive recursion. */
5126 /* Set of traversed objects. Used to avoid duplicate visits. */
5127 struct pointer_set_t
*pset
;
5129 /* Array of symbols to process with free_lang_data_in_decl. */
5132 /* Array of types to process with free_lang_data_in_type. */
5137 /* Save all language fields needed to generate proper debug information
5138 for DECL. This saves most fields cleared out by free_lang_data_in_decl. */
5141 save_debug_info_for_decl (tree t
)
5143 /*struct saved_debug_info_d *sdi;*/
5145 gcc_assert (debug_info_level
> DINFO_LEVEL_TERSE
&& t
&& DECL_P (t
));
5147 /* FIXME. Partial implementation for saving debug info removed. */
5151 /* Save all language fields needed to generate proper debug information
5152 for TYPE. This saves most fields cleared out by free_lang_data_in_type. */
5155 save_debug_info_for_type (tree t
)
5157 /*struct saved_debug_info_d *sdi;*/
5159 gcc_assert (debug_info_level
> DINFO_LEVEL_TERSE
&& t
&& TYPE_P (t
));
5161 /* FIXME. Partial implementation for saving debug info removed. */
5165 /* Add type or decl T to one of the list of tree nodes that need their
5166 language data removed. The lists are held inside FLD. */
5169 add_tree_to_fld_list (tree t
, struct free_lang_data_d
*fld
)
5173 fld
->decls
.safe_push (t
);
5174 if (debug_info_level
> DINFO_LEVEL_TERSE
)
5175 save_debug_info_for_decl (t
);
5177 else if (TYPE_P (t
))
5179 fld
->types
.safe_push (t
);
5180 if (debug_info_level
> DINFO_LEVEL_TERSE
)
5181 save_debug_info_for_type (t
);
5187 /* Push tree node T into FLD->WORKLIST. */
5190 fld_worklist_push (tree t
, struct free_lang_data_d
*fld
)
5192 if (t
&& !is_lang_specific (t
) && !pointer_set_contains (fld
->pset
, t
))
5193 fld
->worklist
.safe_push ((t
));
5197 /* Operand callback helper for free_lang_data_in_node. *TP is the
5198 subtree operand being considered. */
5201 find_decls_types_r (tree
*tp
, int *ws
, void *data
)
5204 struct free_lang_data_d
*fld
= (struct free_lang_data_d
*) data
;
5206 if (TREE_CODE (t
) == TREE_LIST
)
5209 /* Language specific nodes will be removed, so there is no need
5210 to gather anything under them. */
5211 if (is_lang_specific (t
))
5219 /* Note that walk_tree does not traverse every possible field in
5220 decls, so we have to do our own traversals here. */
5221 add_tree_to_fld_list (t
, fld
);
5223 fld_worklist_push (DECL_NAME (t
), fld
);
5224 fld_worklist_push (DECL_CONTEXT (t
), fld
);
5225 fld_worklist_push (DECL_SIZE (t
), fld
);
5226 fld_worklist_push (DECL_SIZE_UNIT (t
), fld
);
5228 /* We are going to remove everything under DECL_INITIAL for
5229 TYPE_DECLs. No point walking them. */
5230 if (TREE_CODE (t
) != TYPE_DECL
)
5231 fld_worklist_push (DECL_INITIAL (t
), fld
);
5233 fld_worklist_push (DECL_ATTRIBUTES (t
), fld
);
5234 fld_worklist_push (DECL_ABSTRACT_ORIGIN (t
), fld
);
5236 if (TREE_CODE (t
) == FUNCTION_DECL
)
5238 fld_worklist_push (DECL_ARGUMENTS (t
), fld
);
5239 fld_worklist_push (DECL_RESULT (t
), fld
);
5241 else if (TREE_CODE (t
) == TYPE_DECL
)
5243 fld_worklist_push (DECL_ARGUMENT_FLD (t
), fld
);
5244 fld_worklist_push (DECL_VINDEX (t
), fld
);
5245 fld_worklist_push (DECL_ORIGINAL_TYPE (t
), fld
);
5247 else if (TREE_CODE (t
) == FIELD_DECL
)
5249 fld_worklist_push (DECL_FIELD_OFFSET (t
), fld
);
5250 fld_worklist_push (DECL_BIT_FIELD_TYPE (t
), fld
);
5251 fld_worklist_push (DECL_FIELD_BIT_OFFSET (t
), fld
);
5252 fld_worklist_push (DECL_FCONTEXT (t
), fld
);
5254 else if (TREE_CODE (t
) == VAR_DECL
)
5256 fld_worklist_push (DECL_SECTION_NAME (t
), fld
);
5259 if ((TREE_CODE (t
) == VAR_DECL
|| TREE_CODE (t
) == PARM_DECL
)
5260 && DECL_HAS_VALUE_EXPR_P (t
))
5261 fld_worklist_push (DECL_VALUE_EXPR (t
), fld
);
5263 if (TREE_CODE (t
) != FIELD_DECL
5264 && TREE_CODE (t
) != TYPE_DECL
)
5265 fld_worklist_push (TREE_CHAIN (t
), fld
);
5268 else if (TYPE_P (t
))
5270 /* Note that walk_tree does not traverse every possible field in
5271 types, so we have to do our own traversals here. */
5272 add_tree_to_fld_list (t
, fld
);
5274 if (!RECORD_OR_UNION_TYPE_P (t
))
5275 fld_worklist_push (TYPE_CACHED_VALUES (t
), fld
);
5276 fld_worklist_push (TYPE_SIZE (t
), fld
);
5277 fld_worklist_push (TYPE_SIZE_UNIT (t
), fld
);
5278 fld_worklist_push (TYPE_ATTRIBUTES (t
), fld
);
5279 fld_worklist_push (TYPE_POINTER_TO (t
), fld
);
5280 fld_worklist_push (TYPE_REFERENCE_TO (t
), fld
);
5281 fld_worklist_push (TYPE_NAME (t
), fld
);
5282 /* Do not walk TYPE_NEXT_PTR_TO or TYPE_NEXT_REF_TO. We do not stream
5283 them and thus do not and want not to reach unused pointer types
5285 if (!POINTER_TYPE_P (t
))
5286 fld_worklist_push (TYPE_MINVAL (t
), fld
);
5287 if (!RECORD_OR_UNION_TYPE_P (t
))
5288 fld_worklist_push (TYPE_MAXVAL (t
), fld
);
5289 fld_worklist_push (TYPE_MAIN_VARIANT (t
), fld
);
5290 /* Do not walk TYPE_NEXT_VARIANT. We do not stream it and thus
5291 do not and want not to reach unused variants this way. */
5292 if (TYPE_CONTEXT (t
))
5294 tree ctx
= TYPE_CONTEXT (t
);
5295 /* We adjust BLOCK TYPE_CONTEXTs to the innermost non-BLOCK one.
5296 So push that instead. */
5297 while (ctx
&& TREE_CODE (ctx
) == BLOCK
)
5298 ctx
= BLOCK_SUPERCONTEXT (ctx
);
5299 fld_worklist_push (ctx
, fld
);
5301 /* Do not walk TYPE_CANONICAL. We do not stream it and thus do not
5302 and want not to reach unused types this way. */
5304 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_BINFO (t
))
5308 FOR_EACH_VEC_ELT (*BINFO_BASE_BINFOS (TYPE_BINFO (t
)), i
, tem
)
5309 fld_worklist_push (TREE_TYPE (tem
), fld
);
5310 tem
= BINFO_VIRTUALS (TYPE_BINFO (t
));
5312 /* The Java FE overloads BINFO_VIRTUALS for its own purpose. */
5313 && TREE_CODE (tem
) == TREE_LIST
)
5316 fld_worklist_push (TREE_VALUE (tem
), fld
);
5317 tem
= TREE_CHAIN (tem
);
5321 if (RECORD_OR_UNION_TYPE_P (t
))
5324 /* Push all TYPE_FIELDS - there can be interleaving interesting
5325 and non-interesting things. */
5326 tem
= TYPE_FIELDS (t
);
5329 if (TREE_CODE (tem
) == FIELD_DECL
5330 || TREE_CODE (tem
) == TYPE_DECL
)
5331 fld_worklist_push (tem
, fld
);
5332 tem
= TREE_CHAIN (tem
);
5336 fld_worklist_push (TYPE_STUB_DECL (t
), fld
);
5339 else if (TREE_CODE (t
) == BLOCK
)
5342 for (tem
= BLOCK_VARS (t
); tem
; tem
= TREE_CHAIN (tem
))
5343 fld_worklist_push (tem
, fld
);
5344 for (tem
= BLOCK_SUBBLOCKS (t
); tem
; tem
= BLOCK_CHAIN (tem
))
5345 fld_worklist_push (tem
, fld
);
5346 fld_worklist_push (BLOCK_ABSTRACT_ORIGIN (t
), fld
);
5349 if (TREE_CODE (t
) != IDENTIFIER_NODE
5350 && CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_TYPED
))
5351 fld_worklist_push (TREE_TYPE (t
), fld
);
5357 /* Find decls and types in T. */
5360 find_decls_types (tree t
, struct free_lang_data_d
*fld
)
5364 if (!pointer_set_contains (fld
->pset
, t
))
5365 walk_tree (&t
, find_decls_types_r
, fld
, fld
->pset
);
5366 if (fld
->worklist
.is_empty ())
5368 t
= fld
->worklist
.pop ();
5372 /* Translate all the types in LIST with the corresponding runtime
5376 get_eh_types_for_runtime (tree list
)
5380 if (list
== NULL_TREE
)
5383 head
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
5385 list
= TREE_CHAIN (list
);
5388 tree n
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
5389 TREE_CHAIN (prev
) = n
;
5390 prev
= TREE_CHAIN (prev
);
5391 list
= TREE_CHAIN (list
);
5398 /* Find decls and types referenced in EH region R and store them in
5399 FLD->DECLS and FLD->TYPES. */
5402 find_decls_types_in_eh_region (eh_region r
, struct free_lang_data_d
*fld
)
5413 /* The types referenced in each catch must first be changed to the
5414 EH types used at runtime. This removes references to FE types
5416 for (c
= r
->u
.eh_try
.first_catch
; c
; c
= c
->next_catch
)
5418 c
->type_list
= get_eh_types_for_runtime (c
->type_list
);
5419 walk_tree (&c
->type_list
, find_decls_types_r
, fld
, fld
->pset
);
5424 case ERT_ALLOWED_EXCEPTIONS
:
5425 r
->u
.allowed
.type_list
5426 = get_eh_types_for_runtime (r
->u
.allowed
.type_list
);
5427 walk_tree (&r
->u
.allowed
.type_list
, find_decls_types_r
, fld
, fld
->pset
);
5430 case ERT_MUST_NOT_THROW
:
5431 walk_tree (&r
->u
.must_not_throw
.failure_decl
,
5432 find_decls_types_r
, fld
, fld
->pset
);
5438 /* Find decls and types referenced in cgraph node N and store them in
5439 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
5440 look for *every* kind of DECL and TYPE node reachable from N,
5441 including those embedded inside types and decls (i.e,, TYPE_DECLs,
5442 NAMESPACE_DECLs, etc). */
5445 find_decls_types_in_node (struct cgraph_node
*n
, struct free_lang_data_d
*fld
)
5448 struct function
*fn
;
5452 find_decls_types (n
->decl
, fld
);
5454 if (!gimple_has_body_p (n
->decl
))
5457 gcc_assert (current_function_decl
== NULL_TREE
&& cfun
== NULL
);
5459 fn
= DECL_STRUCT_FUNCTION (n
->decl
);
5461 /* Traverse locals. */
5462 FOR_EACH_LOCAL_DECL (fn
, ix
, t
)
5463 find_decls_types (t
, fld
);
5465 /* Traverse EH regions in FN. */
5468 FOR_ALL_EH_REGION_FN (r
, fn
)
5469 find_decls_types_in_eh_region (r
, fld
);
5472 /* Traverse every statement in FN. */
5473 FOR_EACH_BB_FN (bb
, fn
)
5475 gimple_stmt_iterator si
;
5478 for (si
= gsi_start_phis (bb
); !gsi_end_p (si
); gsi_next (&si
))
5480 gimple phi
= gsi_stmt (si
);
5482 for (i
= 0; i
< gimple_phi_num_args (phi
); i
++)
5484 tree
*arg_p
= gimple_phi_arg_def_ptr (phi
, i
);
5485 find_decls_types (*arg_p
, fld
);
5489 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
5491 gimple stmt
= gsi_stmt (si
);
5493 if (is_gimple_call (stmt
))
5494 find_decls_types (gimple_call_fntype (stmt
), fld
);
5496 for (i
= 0; i
< gimple_num_ops (stmt
); i
++)
5498 tree arg
= gimple_op (stmt
, i
);
5499 find_decls_types (arg
, fld
);
5506 /* Find decls and types referenced in varpool node N and store them in
5507 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
5508 look for *every* kind of DECL and TYPE node reachable from N,
5509 including those embedded inside types and decls (i.e,, TYPE_DECLs,
5510 NAMESPACE_DECLs, etc). */
5513 find_decls_types_in_var (varpool_node
*v
, struct free_lang_data_d
*fld
)
5515 find_decls_types (v
->decl
, fld
);
5518 /* If T needs an assembler name, have one created for it. */
5521 assign_assembler_name_if_neeeded (tree t
)
5523 if (need_assembler_name_p (t
))
5525 /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit
5526 diagnostics that use input_location to show locus
5527 information. The problem here is that, at this point,
5528 input_location is generally anchored to the end of the file
5529 (since the parser is long gone), so we don't have a good
5530 position to pin it to.
5532 To alleviate this problem, this uses the location of T's
5533 declaration. Examples of this are
5534 testsuite/g++.dg/template/cond2.C and
5535 testsuite/g++.dg/template/pr35240.C. */
5536 location_t saved_location
= input_location
;
5537 input_location
= DECL_SOURCE_LOCATION (t
);
5539 decl_assembler_name (t
);
5541 input_location
= saved_location
;
5546 /* Free language specific information for every operand and expression
5547 in every node of the call graph. This process operates in three stages:
5549 1- Every callgraph node and varpool node is traversed looking for
5550 decls and types embedded in them. This is a more exhaustive
5551 search than that done by find_referenced_vars, because it will
5552 also collect individual fields, decls embedded in types, etc.
5554 2- All the decls found are sent to free_lang_data_in_decl.
5556 3- All the types found are sent to free_lang_data_in_type.
5558 The ordering between decls and types is important because
5559 free_lang_data_in_decl sets assembler names, which includes
5560 mangling. So types cannot be freed up until assembler names have
5564 free_lang_data_in_cgraph (void)
5566 struct cgraph_node
*n
;
5568 struct free_lang_data_d fld
;
5573 /* Initialize sets and arrays to store referenced decls and types. */
5574 fld
.pset
= pointer_set_create ();
5575 fld
.worklist
.create (0);
5576 fld
.decls
.create (100);
5577 fld
.types
.create (100);
5579 /* Find decls and types in the body of every function in the callgraph. */
5580 FOR_EACH_FUNCTION (n
)
5581 find_decls_types_in_node (n
, &fld
);
5583 FOR_EACH_VEC_SAFE_ELT (alias_pairs
, i
, p
)
5584 find_decls_types (p
->decl
, &fld
);
5586 /* Find decls and types in every varpool symbol. */
5587 FOR_EACH_VARIABLE (v
)
5588 find_decls_types_in_var (v
, &fld
);
5590 /* Set the assembler name on every decl found. We need to do this
5591 now because free_lang_data_in_decl will invalidate data needed
5592 for mangling. This breaks mangling on interdependent decls. */
5593 FOR_EACH_VEC_ELT (fld
.decls
, i
, t
)
5594 assign_assembler_name_if_neeeded (t
);
5596 /* Traverse every decl found freeing its language data. */
5597 FOR_EACH_VEC_ELT (fld
.decls
, i
, t
)
5598 free_lang_data_in_decl (t
);
5600 /* Traverse every type found freeing its language data. */
5601 FOR_EACH_VEC_ELT (fld
.types
, i
, t
)
5602 free_lang_data_in_type (t
);
5604 pointer_set_destroy (fld
.pset
);
5605 fld
.worklist
.release ();
5606 fld
.decls
.release ();
5607 fld
.types
.release ();
5611 /* Free resources that are used by FE but are not needed once they are done. */
5614 free_lang_data (void)
5618 /* If we are the LTO frontend we have freed lang-specific data already. */
5620 || !flag_generate_lto
)
5623 /* Allocate and assign alias sets to the standard integer types
5624 while the slots are still in the way the frontends generated them. */
5625 for (i
= 0; i
< itk_none
; ++i
)
5626 if (integer_types
[i
])
5627 TYPE_ALIAS_SET (integer_types
[i
]) = get_alias_set (integer_types
[i
]);
5629 /* Traverse the IL resetting language specific information for
5630 operands, expressions, etc. */
5631 free_lang_data_in_cgraph ();
5633 /* Create gimple variants for common types. */
5634 ptrdiff_type_node
= integer_type_node
;
5635 fileptr_type_node
= ptr_type_node
;
5637 /* Reset some langhooks. Do not reset types_compatible_p, it may
5638 still be used indirectly via the get_alias_set langhook. */
5639 lang_hooks
.dwarf_name
= lhd_dwarf_name
;
5640 lang_hooks
.decl_printable_name
= gimple_decl_printable_name
;
5641 /* We do not want the default decl_assembler_name implementation,
5642 rather if we have fixed everything we want a wrapper around it
5643 asserting that all non-local symbols already got their assembler
5644 name and only produce assembler names for local symbols. Or rather
5645 make sure we never call decl_assembler_name on local symbols and
5646 devise a separate, middle-end private scheme for it. */
5648 /* Reset diagnostic machinery. */
5649 tree_diagnostics_defaults (global_dc
);
5657 const pass_data pass_data_ipa_free_lang_data
=
5659 SIMPLE_IPA_PASS
, /* type */
5660 "*free_lang_data", /* name */
5661 OPTGROUP_NONE
, /* optinfo_flags */
5662 true, /* has_execute */
5663 TV_IPA_FREE_LANG_DATA
, /* tv_id */
5664 0, /* properties_required */
5665 0, /* properties_provided */
5666 0, /* properties_destroyed */
5667 0, /* todo_flags_start */
5668 0, /* todo_flags_finish */
5671 class pass_ipa_free_lang_data
: public simple_ipa_opt_pass
5674 pass_ipa_free_lang_data (gcc::context
*ctxt
)
5675 : simple_ipa_opt_pass (pass_data_ipa_free_lang_data
, ctxt
)
5678 /* opt_pass methods: */
5679 virtual unsigned int execute (function
*) { return free_lang_data (); }
5681 }; // class pass_ipa_free_lang_data
5685 simple_ipa_opt_pass
*
5686 make_pass_ipa_free_lang_data (gcc::context
*ctxt
)
5688 return new pass_ipa_free_lang_data (ctxt
);
5691 /* The backbone of is_attribute_p(). ATTR_LEN is the string length of
5692 ATTR_NAME. Also used internally by remove_attribute(). */
5694 private_is_attribute_p (const char *attr_name
, size_t attr_len
, const_tree ident
)
5696 size_t ident_len
= IDENTIFIER_LENGTH (ident
);
5698 if (ident_len
== attr_len
)
5700 if (strcmp (attr_name
, IDENTIFIER_POINTER (ident
)) == 0)
5703 else if (ident_len
== attr_len
+ 4)
5705 /* There is the possibility that ATTR is 'text' and IDENT is
5707 const char *p
= IDENTIFIER_POINTER (ident
);
5708 if (p
[0] == '_' && p
[1] == '_'
5709 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
5710 && strncmp (attr_name
, p
+ 2, attr_len
) == 0)
5717 /* The backbone of lookup_attribute(). ATTR_LEN is the string length
5718 of ATTR_NAME, and LIST is not NULL_TREE. */
5720 private_lookup_attribute (const char *attr_name
, size_t attr_len
, tree list
)
5724 size_t ident_len
= IDENTIFIER_LENGTH (get_attribute_name (list
));
5726 if (ident_len
== attr_len
)
5728 if (!strcmp (attr_name
,
5729 IDENTIFIER_POINTER (get_attribute_name (list
))))
5732 /* TODO: If we made sure that attributes were stored in the
5733 canonical form without '__...__' (ie, as in 'text' as opposed
5734 to '__text__') then we could avoid the following case. */
5735 else if (ident_len
== attr_len
+ 4)
5737 const char *p
= IDENTIFIER_POINTER (get_attribute_name (list
));
5738 if (p
[0] == '_' && p
[1] == '_'
5739 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
5740 && strncmp (attr_name
, p
+ 2, attr_len
) == 0)
5743 list
= TREE_CHAIN (list
);
5749 /* A variant of lookup_attribute() that can be used with an identifier
5750 as the first argument, and where the identifier can be either
5751 'text' or '__text__'.
5753 Given an attribute ATTR_IDENTIFIER, and a list of attributes LIST,
5754 return a pointer to the attribute's list element if the attribute
5755 is part of the list, or NULL_TREE if not found. If the attribute
5756 appears more than once, this only returns the first occurrence; the
5757 TREE_CHAIN of the return value should be passed back in if further
5758 occurrences are wanted. ATTR_IDENTIFIER must be an identifier but
5759 can be in the form 'text' or '__text__'. */
5761 lookup_ident_attribute (tree attr_identifier
, tree list
)
5763 gcc_checking_assert (TREE_CODE (attr_identifier
) == IDENTIFIER_NODE
);
5767 gcc_checking_assert (TREE_CODE (get_attribute_name (list
))
5768 == IDENTIFIER_NODE
);
5770 /* Identifiers can be compared directly for equality. */
5771 if (attr_identifier
== get_attribute_name (list
))
5774 /* If they are not equal, they may still be one in the form
5775 'text' while the other one is in the form '__text__'. TODO:
5776 If we were storing attributes in normalized 'text' form, then
5777 this could all go away and we could take full advantage of
5778 the fact that we're comparing identifiers. :-) */
5780 size_t attr_len
= IDENTIFIER_LENGTH (attr_identifier
);
5781 size_t ident_len
= IDENTIFIER_LENGTH (get_attribute_name (list
));
5783 if (ident_len
== attr_len
+ 4)
5785 const char *p
= IDENTIFIER_POINTER (get_attribute_name (list
));
5786 const char *q
= IDENTIFIER_POINTER (attr_identifier
);
5787 if (p
[0] == '_' && p
[1] == '_'
5788 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
5789 && strncmp (q
, p
+ 2, attr_len
) == 0)
5792 else if (ident_len
+ 4 == attr_len
)
5794 const char *p
= IDENTIFIER_POINTER (get_attribute_name (list
));
5795 const char *q
= IDENTIFIER_POINTER (attr_identifier
);
5796 if (q
[0] == '_' && q
[1] == '_'
5797 && q
[attr_len
- 2] == '_' && q
[attr_len
- 1] == '_'
5798 && strncmp (q
+ 2, p
, ident_len
) == 0)
5802 list
= TREE_CHAIN (list
);
5808 /* Remove any instances of attribute ATTR_NAME in LIST and return the
5812 remove_attribute (const char *attr_name
, tree list
)
5815 size_t attr_len
= strlen (attr_name
);
5817 gcc_checking_assert (attr_name
[0] != '_');
5819 for (p
= &list
; *p
; )
5822 /* TODO: If we were storing attributes in normalized form, here
5823 we could use a simple strcmp(). */
5824 if (private_is_attribute_p (attr_name
, attr_len
, get_attribute_name (l
)))
5825 *p
= TREE_CHAIN (l
);
5827 p
= &TREE_CHAIN (l
);
5833 /* Return an attribute list that is the union of a1 and a2. */
5836 merge_attributes (tree a1
, tree a2
)
5840 /* Either one unset? Take the set one. */
5842 if ((attributes
= a1
) == 0)
5845 /* One that completely contains the other? Take it. */
5847 else if (a2
!= 0 && ! attribute_list_contained (a1
, a2
))
5849 if (attribute_list_contained (a2
, a1
))
5853 /* Pick the longest list, and hang on the other list. */
5855 if (list_length (a1
) < list_length (a2
))
5856 attributes
= a2
, a2
= a1
;
5858 for (; a2
!= 0; a2
= TREE_CHAIN (a2
))
5861 for (a
= lookup_ident_attribute (get_attribute_name (a2
),
5863 a
!= NULL_TREE
&& !attribute_value_equal (a
, a2
);
5864 a
= lookup_ident_attribute (get_attribute_name (a2
),
5869 a1
= copy_node (a2
);
5870 TREE_CHAIN (a1
) = attributes
;
5879 /* Given types T1 and T2, merge their attributes and return
5883 merge_type_attributes (tree t1
, tree t2
)
5885 return merge_attributes (TYPE_ATTRIBUTES (t1
),
5886 TYPE_ATTRIBUTES (t2
));
5889 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
5893 merge_decl_attributes (tree olddecl
, tree newdecl
)
5895 return merge_attributes (DECL_ATTRIBUTES (olddecl
),
5896 DECL_ATTRIBUTES (newdecl
));
5899 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
5901 /* Specialization of merge_decl_attributes for various Windows targets.
5903 This handles the following situation:
5905 __declspec (dllimport) int foo;
5908 The second instance of `foo' nullifies the dllimport. */
5911 merge_dllimport_decl_attributes (tree old
, tree new_tree
)
5914 int delete_dllimport_p
= 1;
5916 /* What we need to do here is remove from `old' dllimport if it doesn't
5917 appear in `new'. dllimport behaves like extern: if a declaration is
5918 marked dllimport and a definition appears later, then the object
5919 is not dllimport'd. We also remove a `new' dllimport if the old list
5920 contains dllexport: dllexport always overrides dllimport, regardless
5921 of the order of declaration. */
5922 if (!VAR_OR_FUNCTION_DECL_P (new_tree
))
5923 delete_dllimport_p
= 0;
5924 else if (DECL_DLLIMPORT_P (new_tree
)
5925 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (old
)))
5927 DECL_DLLIMPORT_P (new_tree
) = 0;
5928 warning (OPT_Wattributes
, "%q+D already declared with dllexport attribute: "
5929 "dllimport ignored", new_tree
);
5931 else if (DECL_DLLIMPORT_P (old
) && !DECL_DLLIMPORT_P (new_tree
))
5933 /* Warn about overriding a symbol that has already been used, e.g.:
5934 extern int __attribute__ ((dllimport)) foo;
5935 int* bar () {return &foo;}
5938 if (TREE_USED (old
))
5940 warning (0, "%q+D redeclared without dllimport attribute "
5941 "after being referenced with dll linkage", new_tree
);
5942 /* If we have used a variable's address with dllimport linkage,
5943 keep the old DECL_DLLIMPORT_P flag: the ADDR_EXPR using the
5944 decl may already have had TREE_CONSTANT computed.
5945 We still remove the attribute so that assembler code refers
5946 to '&foo rather than '_imp__foo'. */
5947 if (TREE_CODE (old
) == VAR_DECL
&& TREE_ADDRESSABLE (old
))
5948 DECL_DLLIMPORT_P (new_tree
) = 1;
5951 /* Let an inline definition silently override the external reference,
5952 but otherwise warn about attribute inconsistency. */
5953 else if (TREE_CODE (new_tree
) == VAR_DECL
5954 || !DECL_DECLARED_INLINE_P (new_tree
))
5955 warning (OPT_Wattributes
, "%q+D redeclared without dllimport attribute: "
5956 "previous dllimport ignored", new_tree
);
5959 delete_dllimport_p
= 0;
5961 a
= merge_attributes (DECL_ATTRIBUTES (old
), DECL_ATTRIBUTES (new_tree
));
5963 if (delete_dllimport_p
)
5964 a
= remove_attribute ("dllimport", a
);
5969 /* Handle a "dllimport" or "dllexport" attribute; arguments as in
5970 struct attribute_spec.handler. */
5973 handle_dll_attribute (tree
* pnode
, tree name
, tree args
, int flags
,
5979 /* These attributes may apply to structure and union types being created,
5980 but otherwise should pass to the declaration involved. */
5983 if (flags
& ((int) ATTR_FLAG_DECL_NEXT
| (int) ATTR_FLAG_FUNCTION_NEXT
5984 | (int) ATTR_FLAG_ARRAY_NEXT
))
5986 *no_add_attrs
= true;
5987 return tree_cons (name
, args
, NULL_TREE
);
5989 if (TREE_CODE (node
) == RECORD_TYPE
5990 || TREE_CODE (node
) == UNION_TYPE
)
5992 node
= TYPE_NAME (node
);
5998 warning (OPT_Wattributes
, "%qE attribute ignored",
6000 *no_add_attrs
= true;
6005 if (TREE_CODE (node
) != FUNCTION_DECL
6006 && TREE_CODE (node
) != VAR_DECL
6007 && TREE_CODE (node
) != TYPE_DECL
)
6009 *no_add_attrs
= true;
6010 warning (OPT_Wattributes
, "%qE attribute ignored",
6015 if (TREE_CODE (node
) == TYPE_DECL
6016 && TREE_CODE (TREE_TYPE (node
)) != RECORD_TYPE
6017 && TREE_CODE (TREE_TYPE (node
)) != UNION_TYPE
)
6019 *no_add_attrs
= true;
6020 warning (OPT_Wattributes
, "%qE attribute ignored",
6025 is_dllimport
= is_attribute_p ("dllimport", name
);
6027 /* Report error on dllimport ambiguities seen now before they cause
6031 /* Honor any target-specific overrides. */
6032 if (!targetm
.valid_dllimport_attribute_p (node
))
6033 *no_add_attrs
= true;
6035 else if (TREE_CODE (node
) == FUNCTION_DECL
6036 && DECL_DECLARED_INLINE_P (node
))
6038 warning (OPT_Wattributes
, "inline function %q+D declared as "
6039 " dllimport: attribute ignored", node
);
6040 *no_add_attrs
= true;
6042 /* Like MS, treat definition of dllimported variables and
6043 non-inlined functions on declaration as syntax errors. */
6044 else if (TREE_CODE (node
) == FUNCTION_DECL
&& DECL_INITIAL (node
))
6046 error ("function %q+D definition is marked dllimport", node
);
6047 *no_add_attrs
= true;
6050 else if (TREE_CODE (node
) == VAR_DECL
)
6052 if (DECL_INITIAL (node
))
6054 error ("variable %q+D definition is marked dllimport",
6056 *no_add_attrs
= true;
6059 /* `extern' needn't be specified with dllimport.
6060 Specify `extern' now and hope for the best. Sigh. */
6061 DECL_EXTERNAL (node
) = 1;
6062 /* Also, implicitly give dllimport'd variables declared within
6063 a function global scope, unless declared static. */
6064 if (current_function_decl
!= NULL_TREE
&& !TREE_STATIC (node
))
6065 TREE_PUBLIC (node
) = 1;
6068 if (*no_add_attrs
== false)
6069 DECL_DLLIMPORT_P (node
) = 1;
6071 else if (TREE_CODE (node
) == FUNCTION_DECL
6072 && DECL_DECLARED_INLINE_P (node
)
6073 && flag_keep_inline_dllexport
)
6074 /* An exported function, even if inline, must be emitted. */
6075 DECL_EXTERNAL (node
) = 0;
6077 /* Report error if symbol is not accessible at global scope. */
6078 if (!TREE_PUBLIC (node
)
6079 && (TREE_CODE (node
) == VAR_DECL
6080 || TREE_CODE (node
) == FUNCTION_DECL
))
6082 error ("external linkage required for symbol %q+D because of "
6083 "%qE attribute", node
, name
);
6084 *no_add_attrs
= true;
6087 /* A dllexport'd entity must have default visibility so that other
6088 program units (shared libraries or the main executable) can see
6089 it. A dllimport'd entity must have default visibility so that
6090 the linker knows that undefined references within this program
6091 unit can be resolved by the dynamic linker. */
6094 if (DECL_VISIBILITY_SPECIFIED (node
)
6095 && DECL_VISIBILITY (node
) != VISIBILITY_DEFAULT
)
6096 error ("%qE implies default visibility, but %qD has already "
6097 "been declared with a different visibility",
6099 DECL_VISIBILITY (node
) = VISIBILITY_DEFAULT
;
6100 DECL_VISIBILITY_SPECIFIED (node
) = 1;
6106 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
6108 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
6109 of the various TYPE_QUAL values. */
6112 set_type_quals (tree type
, int type_quals
)
6114 TYPE_READONLY (type
) = (type_quals
& TYPE_QUAL_CONST
) != 0;
6115 TYPE_VOLATILE (type
) = (type_quals
& TYPE_QUAL_VOLATILE
) != 0;
6116 TYPE_RESTRICT (type
) = (type_quals
& TYPE_QUAL_RESTRICT
) != 0;
6117 TYPE_ATOMIC (type
) = (type_quals
& TYPE_QUAL_ATOMIC
) != 0;
6118 TYPE_ADDR_SPACE (type
) = DECODE_QUAL_ADDR_SPACE (type_quals
);
6121 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
6124 check_qualified_type (const_tree cand
, const_tree base
, int type_quals
)
6126 return (TYPE_QUALS (cand
) == type_quals
6127 && TYPE_NAME (cand
) == TYPE_NAME (base
)
6128 /* Apparently this is needed for Objective-C. */
6129 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
6130 /* Check alignment. */
6131 && TYPE_ALIGN (cand
) == TYPE_ALIGN (base
)
6132 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
6133 TYPE_ATTRIBUTES (base
)));
6136 /* Returns true iff CAND is equivalent to BASE with ALIGN. */
6139 check_aligned_type (const_tree cand
, const_tree base
, unsigned int align
)
6141 return (TYPE_QUALS (cand
) == TYPE_QUALS (base
)
6142 && TYPE_NAME (cand
) == TYPE_NAME (base
)
6143 /* Apparently this is needed for Objective-C. */
6144 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
6145 /* Check alignment. */
6146 && TYPE_ALIGN (cand
) == align
6147 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
6148 TYPE_ATTRIBUTES (base
)));
6151 /* This function checks to see if TYPE matches the size one of the built-in
6152 atomic types, and returns that core atomic type. */
6155 find_atomic_core_type (tree type
)
6157 tree base_atomic_type
;
6159 /* Only handle complete types. */
6160 if (TYPE_SIZE (type
) == NULL_TREE
)
6163 HOST_WIDE_INT type_size
= tree_to_uhwi (TYPE_SIZE (type
));
6167 base_atomic_type
= atomicQI_type_node
;
6171 base_atomic_type
= atomicHI_type_node
;
6175 base_atomic_type
= atomicSI_type_node
;
6179 base_atomic_type
= atomicDI_type_node
;
6183 base_atomic_type
= atomicTI_type_node
;
6187 base_atomic_type
= NULL_TREE
;
6190 return base_atomic_type
;
6193 /* Return a version of the TYPE, qualified as indicated by the
6194 TYPE_QUALS, if one exists. If no qualified version exists yet,
6195 return NULL_TREE. */
6198 get_qualified_type (tree type
, int type_quals
)
6202 if (TYPE_QUALS (type
) == type_quals
)
6205 /* Search the chain of variants to see if there is already one there just
6206 like the one we need to have. If so, use that existing one. We must
6207 preserve the TYPE_NAME, since there is code that depends on this. */
6208 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
6209 if (check_qualified_type (t
, type
, type_quals
))
6215 /* Like get_qualified_type, but creates the type if it does not
6216 exist. This function never returns NULL_TREE. */
6219 build_qualified_type (tree type
, int type_quals
)
6223 /* See if we already have the appropriate qualified variant. */
6224 t
= get_qualified_type (type
, type_quals
);
6226 /* If not, build it. */
6229 t
= build_variant_type_copy (type
);
6230 set_type_quals (t
, type_quals
);
6232 if (((type_quals
& TYPE_QUAL_ATOMIC
) == TYPE_QUAL_ATOMIC
))
6234 /* See if this object can map to a basic atomic type. */
6235 tree atomic_type
= find_atomic_core_type (type
);
6238 /* Ensure the alignment of this type is compatible with
6239 the required alignment of the atomic type. */
6240 if (TYPE_ALIGN (atomic_type
) > TYPE_ALIGN (t
))
6241 TYPE_ALIGN (t
) = TYPE_ALIGN (atomic_type
);
6245 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
6246 /* Propagate structural equality. */
6247 SET_TYPE_STRUCTURAL_EQUALITY (t
);
6248 else if (TYPE_CANONICAL (type
) != type
)
6249 /* Build the underlying canonical type, since it is different
6251 TYPE_CANONICAL (t
) = build_qualified_type (TYPE_CANONICAL (type
),
6254 /* T is its own canonical type. */
6255 TYPE_CANONICAL (t
) = t
;
6262 /* Create a variant of type T with alignment ALIGN. */
6265 build_aligned_type (tree type
, unsigned int align
)
6269 if (TYPE_PACKED (type
)
6270 || TYPE_ALIGN (type
) == align
)
6273 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
6274 if (check_aligned_type (t
, type
, align
))
6277 t
= build_variant_type_copy (type
);
6278 TYPE_ALIGN (t
) = align
;
6283 /* Create a new distinct copy of TYPE. The new type is made its own
6284 MAIN_VARIANT. If TYPE requires structural equality checks, the
6285 resulting type requires structural equality checks; otherwise, its
6286 TYPE_CANONICAL points to itself. */
6289 build_distinct_type_copy (tree type
)
6291 tree t
= copy_node (type
);
6293 TYPE_POINTER_TO (t
) = 0;
6294 TYPE_REFERENCE_TO (t
) = 0;
6296 /* Set the canonical type either to a new equivalence class, or
6297 propagate the need for structural equality checks. */
6298 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
6299 SET_TYPE_STRUCTURAL_EQUALITY (t
);
6301 TYPE_CANONICAL (t
) = t
;
6303 /* Make it its own variant. */
6304 TYPE_MAIN_VARIANT (t
) = t
;
6305 TYPE_NEXT_VARIANT (t
) = 0;
6307 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
6308 whose TREE_TYPE is not t. This can also happen in the Ada
6309 frontend when using subtypes. */
6314 /* Create a new variant of TYPE, equivalent but distinct. This is so
6315 the caller can modify it. TYPE_CANONICAL for the return type will
6316 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
6317 are considered equal by the language itself (or that both types
6318 require structural equality checks). */
6321 build_variant_type_copy (tree type
)
6323 tree t
, m
= TYPE_MAIN_VARIANT (type
);
6325 t
= build_distinct_type_copy (type
);
6327 /* Since we're building a variant, assume that it is a non-semantic
6328 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
6329 TYPE_CANONICAL (t
) = TYPE_CANONICAL (type
);
6331 /* Add the new type to the chain of variants of TYPE. */
6332 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (m
);
6333 TYPE_NEXT_VARIANT (m
) = t
;
6334 TYPE_MAIN_VARIANT (t
) = m
;
6339 /* Return true if the from tree in both tree maps are equal. */
6342 tree_map_base_eq (const void *va
, const void *vb
)
6344 const struct tree_map_base
*const a
= (const struct tree_map_base
*) va
,
6345 *const b
= (const struct tree_map_base
*) vb
;
6346 return (a
->from
== b
->from
);
6349 /* Hash a from tree in a tree_base_map. */
6352 tree_map_base_hash (const void *item
)
6354 return htab_hash_pointer (((const struct tree_map_base
*)item
)->from
);
6357 /* Return true if this tree map structure is marked for garbage collection
6358 purposes. We simply return true if the from tree is marked, so that this
6359 structure goes away when the from tree goes away. */
6362 tree_map_base_marked_p (const void *p
)
6364 return ggc_marked_p (((const struct tree_map_base
*) p
)->from
);
6367 /* Hash a from tree in a tree_map. */
6370 tree_map_hash (const void *item
)
6372 return (((const struct tree_map
*) item
)->hash
);
6375 /* Hash a from tree in a tree_decl_map. */
6378 tree_decl_map_hash (const void *item
)
6380 return DECL_UID (((const struct tree_decl_map
*) item
)->base
.from
);
6383 /* Return the initialization priority for DECL. */
6386 decl_init_priority_lookup (tree decl
)
6388 struct tree_priority_map
*h
;
6389 struct tree_map_base in
;
6391 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl
));
6393 h
= (struct tree_priority_map
*) htab_find (init_priority_for_decl
, &in
);
6394 return h
? h
->init
: DEFAULT_INIT_PRIORITY
;
6397 /* Return the finalization priority for DECL. */
6400 decl_fini_priority_lookup (tree decl
)
6402 struct tree_priority_map
*h
;
6403 struct tree_map_base in
;
6405 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
6407 h
= (struct tree_priority_map
*) htab_find (init_priority_for_decl
, &in
);
6408 return h
? h
->fini
: DEFAULT_INIT_PRIORITY
;
6411 /* Return the initialization and finalization priority information for
6412 DECL. If there is no previous priority information, a freshly
6413 allocated structure is returned. */
6415 static struct tree_priority_map
*
6416 decl_priority_info (tree decl
)
6418 struct tree_priority_map in
;
6419 struct tree_priority_map
*h
;
6422 in
.base
.from
= decl
;
6423 loc
= htab_find_slot (init_priority_for_decl
, &in
, INSERT
);
6424 h
= (struct tree_priority_map
*) *loc
;
6427 h
= ggc_cleared_alloc
<tree_priority_map
> ();
6429 h
->base
.from
= decl
;
6430 h
->init
= DEFAULT_INIT_PRIORITY
;
6431 h
->fini
= DEFAULT_INIT_PRIORITY
;
6437 /* Set the initialization priority for DECL to PRIORITY. */
6440 decl_init_priority_insert (tree decl
, priority_type priority
)
6442 struct tree_priority_map
*h
;
6444 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl
));
6445 if (priority
== DEFAULT_INIT_PRIORITY
)
6447 h
= decl_priority_info (decl
);
6451 /* Set the finalization priority for DECL to PRIORITY. */
6454 decl_fini_priority_insert (tree decl
, priority_type priority
)
6456 struct tree_priority_map
*h
;
6458 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
6459 if (priority
== DEFAULT_INIT_PRIORITY
)
6461 h
= decl_priority_info (decl
);
6465 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
6468 print_debug_expr_statistics (void)
6470 fprintf (stderr
, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
6471 (long) htab_size (debug_expr_for_decl
),
6472 (long) htab_elements (debug_expr_for_decl
),
6473 htab_collisions (debug_expr_for_decl
));
6476 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
6479 print_value_expr_statistics (void)
6481 fprintf (stderr
, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
6482 (long) htab_size (value_expr_for_decl
),
6483 (long) htab_elements (value_expr_for_decl
),
6484 htab_collisions (value_expr_for_decl
));
6487 /* Lookup a debug expression for FROM, and return it if we find one. */
6490 decl_debug_expr_lookup (tree from
)
6492 struct tree_decl_map
*h
, in
;
6493 in
.base
.from
= from
;
6495 h
= (struct tree_decl_map
*)
6496 htab_find_with_hash (debug_expr_for_decl
, &in
, DECL_UID (from
));
6502 /* Insert a mapping FROM->TO in the debug expression hashtable. */
6505 decl_debug_expr_insert (tree from
, tree to
)
6507 struct tree_decl_map
*h
;
6510 h
= ggc_alloc
<tree_decl_map
> ();
6511 h
->base
.from
= from
;
6513 loc
= htab_find_slot_with_hash (debug_expr_for_decl
, h
, DECL_UID (from
),
6515 *(struct tree_decl_map
**) loc
= h
;
6518 /* Lookup a value expression for FROM, and return it if we find one. */
6521 decl_value_expr_lookup (tree from
)
6523 struct tree_decl_map
*h
, in
;
6524 in
.base
.from
= from
;
6526 h
= (struct tree_decl_map
*)
6527 htab_find_with_hash (value_expr_for_decl
, &in
, DECL_UID (from
));
6533 /* Insert a mapping FROM->TO in the value expression hashtable. */
6536 decl_value_expr_insert (tree from
, tree to
)
6538 struct tree_decl_map
*h
;
6541 h
= ggc_alloc
<tree_decl_map
> ();
6542 h
->base
.from
= from
;
6544 loc
= htab_find_slot_with_hash (value_expr_for_decl
, h
, DECL_UID (from
),
6546 *(struct tree_decl_map
**) loc
= h
;
6549 /* Lookup a vector of debug arguments for FROM, and return it if we
6553 decl_debug_args_lookup (tree from
)
6555 struct tree_vec_map
*h
, in
;
6557 if (!DECL_HAS_DEBUG_ARGS_P (from
))
6559 gcc_checking_assert (debug_args_for_decl
!= NULL
);
6560 in
.base
.from
= from
;
6561 h
= (struct tree_vec_map
*)
6562 htab_find_with_hash (debug_args_for_decl
, &in
, DECL_UID (from
));
6568 /* Insert a mapping FROM->empty vector of debug arguments in the value
6569 expression hashtable. */
6572 decl_debug_args_insert (tree from
)
6574 struct tree_vec_map
*h
;
6577 if (DECL_HAS_DEBUG_ARGS_P (from
))
6578 return decl_debug_args_lookup (from
);
6579 if (debug_args_for_decl
== NULL
)
6580 debug_args_for_decl
= htab_create_ggc (64, tree_vec_map_hash
,
6581 tree_vec_map_eq
, 0);
6582 h
= ggc_alloc
<tree_vec_map
> ();
6583 h
->base
.from
= from
;
6585 loc
= htab_find_slot_with_hash (debug_args_for_decl
, h
, DECL_UID (from
),
6587 *(struct tree_vec_map
**) loc
= h
;
6588 DECL_HAS_DEBUG_ARGS_P (from
) = 1;
6592 /* Hashing of types so that we don't make duplicates.
6593 The entry point is `type_hash_canon'. */
6595 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
6596 with types in the TREE_VALUE slots), by adding the hash codes
6597 of the individual types. */
6600 type_hash_list (const_tree list
, hashval_t hashcode
)
6604 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
6605 if (TREE_VALUE (tail
) != error_mark_node
)
6606 hashcode
= iterative_hash_object (TYPE_HASH (TREE_VALUE (tail
)),
6612 /* These are the Hashtable callback functions. */
6614 /* Returns true iff the types are equivalent. */
6617 type_hash_eq (const void *va
, const void *vb
)
6619 const struct type_hash
*const a
= (const struct type_hash
*) va
,
6620 *const b
= (const struct type_hash
*) vb
;
6622 /* First test the things that are the same for all types. */
6623 if (a
->hash
!= b
->hash
6624 || TREE_CODE (a
->type
) != TREE_CODE (b
->type
)
6625 || TREE_TYPE (a
->type
) != TREE_TYPE (b
->type
)
6626 || !attribute_list_equal (TYPE_ATTRIBUTES (a
->type
),
6627 TYPE_ATTRIBUTES (b
->type
))
6628 || (TREE_CODE (a
->type
) != COMPLEX_TYPE
6629 && TYPE_NAME (a
->type
) != TYPE_NAME (b
->type
)))
6632 /* Be careful about comparing arrays before and after the element type
6633 has been completed; don't compare TYPE_ALIGN unless both types are
6635 if (COMPLETE_TYPE_P (a
->type
) && COMPLETE_TYPE_P (b
->type
)
6636 && (TYPE_ALIGN (a
->type
) != TYPE_ALIGN (b
->type
)
6637 || TYPE_MODE (a
->type
) != TYPE_MODE (b
->type
)))
6640 switch (TREE_CODE (a
->type
))
6645 case REFERENCE_TYPE
:
6650 return TYPE_VECTOR_SUBPARTS (a
->type
) == TYPE_VECTOR_SUBPARTS (b
->type
);
6653 if (TYPE_VALUES (a
->type
) != TYPE_VALUES (b
->type
)
6654 && !(TYPE_VALUES (a
->type
)
6655 && TREE_CODE (TYPE_VALUES (a
->type
)) == TREE_LIST
6656 && TYPE_VALUES (b
->type
)
6657 && TREE_CODE (TYPE_VALUES (b
->type
)) == TREE_LIST
6658 && type_list_equal (TYPE_VALUES (a
->type
),
6659 TYPE_VALUES (b
->type
))))
6662 /* ... fall through ... */
6667 if (TYPE_PRECISION (a
->type
) != TYPE_PRECISION (b
->type
))
6669 return ((TYPE_MAX_VALUE (a
->type
) == TYPE_MAX_VALUE (b
->type
)
6670 || tree_int_cst_equal (TYPE_MAX_VALUE (a
->type
),
6671 TYPE_MAX_VALUE (b
->type
)))
6672 && (TYPE_MIN_VALUE (a
->type
) == TYPE_MIN_VALUE (b
->type
)
6673 || tree_int_cst_equal (TYPE_MIN_VALUE (a
->type
),
6674 TYPE_MIN_VALUE (b
->type
))));
6676 case FIXED_POINT_TYPE
:
6677 return TYPE_SATURATING (a
->type
) == TYPE_SATURATING (b
->type
);
6680 return TYPE_OFFSET_BASETYPE (a
->type
) == TYPE_OFFSET_BASETYPE (b
->type
);
6683 if (TYPE_METHOD_BASETYPE (a
->type
) == TYPE_METHOD_BASETYPE (b
->type
)
6684 && (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
6685 || (TYPE_ARG_TYPES (a
->type
)
6686 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
6687 && TYPE_ARG_TYPES (b
->type
)
6688 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
6689 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
6690 TYPE_ARG_TYPES (b
->type
)))))
6694 return TYPE_DOMAIN (a
->type
) == TYPE_DOMAIN (b
->type
);
6698 case QUAL_UNION_TYPE
:
6699 return (TYPE_FIELDS (a
->type
) == TYPE_FIELDS (b
->type
)
6700 || (TYPE_FIELDS (a
->type
)
6701 && TREE_CODE (TYPE_FIELDS (a
->type
)) == TREE_LIST
6702 && TYPE_FIELDS (b
->type
)
6703 && TREE_CODE (TYPE_FIELDS (b
->type
)) == TREE_LIST
6704 && type_list_equal (TYPE_FIELDS (a
->type
),
6705 TYPE_FIELDS (b
->type
))));
6708 if (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
6709 || (TYPE_ARG_TYPES (a
->type
)
6710 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
6711 && TYPE_ARG_TYPES (b
->type
)
6712 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
6713 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
6714 TYPE_ARG_TYPES (b
->type
))))
6722 if (lang_hooks
.types
.type_hash_eq
!= NULL
)
6723 return lang_hooks
.types
.type_hash_eq (a
->type
, b
->type
);
6728 /* Return the cached hash value. */
6731 type_hash_hash (const void *item
)
6733 return ((const struct type_hash
*) item
)->hash
;
6736 /* Look in the type hash table for a type isomorphic to TYPE.
6737 If one is found, return it. Otherwise return 0. */
6740 type_hash_lookup (hashval_t hashcode
, tree type
)
6742 struct type_hash
*h
, in
;
6744 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
6745 must call that routine before comparing TYPE_ALIGNs. */
6751 h
= (struct type_hash
*) htab_find_with_hash (type_hash_table
, &in
,
6758 /* Add an entry to the type-hash-table
6759 for a type TYPE whose hash code is HASHCODE. */
6762 type_hash_add (hashval_t hashcode
, tree type
)
6764 struct type_hash
*h
;
6767 h
= ggc_alloc
<type_hash
> ();
6770 loc
= htab_find_slot_with_hash (type_hash_table
, h
, hashcode
, INSERT
);
6774 /* Given TYPE, and HASHCODE its hash code, return the canonical
6775 object for an identical type if one already exists.
6776 Otherwise, return TYPE, and record it as the canonical object.
6778 To use this function, first create a type of the sort you want.
6779 Then compute its hash code from the fields of the type that
6780 make it different from other similar types.
6781 Then call this function and use the value. */
6784 type_hash_canon (unsigned int hashcode
, tree type
)
6788 /* The hash table only contains main variants, so ensure that's what we're
6790 gcc_assert (TYPE_MAIN_VARIANT (type
) == type
);
6792 /* See if the type is in the hash table already. If so, return it.
6793 Otherwise, add the type. */
6794 t1
= type_hash_lookup (hashcode
, type
);
6797 if (GATHER_STATISTICS
)
6799 tree_code_counts
[(int) TREE_CODE (type
)]--;
6800 tree_node_counts
[(int) t_kind
]--;
6801 tree_node_sizes
[(int) t_kind
] -= sizeof (struct tree_type_non_common
);
6807 type_hash_add (hashcode
, type
);
6812 /* See if the data pointed to by the type hash table is marked. We consider
6813 it marked if the type is marked or if a debug type number or symbol
6814 table entry has been made for the type. */
6817 type_hash_marked_p (const void *p
)
6819 const_tree
const type
= ((const struct type_hash
*) p
)->type
;
6821 return ggc_marked_p (type
);
6825 print_type_hash_statistics (void)
6827 fprintf (stderr
, "Type hash: size %ld, %ld elements, %f collisions\n",
6828 (long) htab_size (type_hash_table
),
6829 (long) htab_elements (type_hash_table
),
6830 htab_collisions (type_hash_table
));
6833 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
6834 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
6835 by adding the hash codes of the individual attributes. */
6838 attribute_hash_list (const_tree list
, hashval_t hashcode
)
6842 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
6843 /* ??? Do we want to add in TREE_VALUE too? */
6844 hashcode
= iterative_hash_object
6845 (IDENTIFIER_HASH_VALUE (get_attribute_name (tail
)), hashcode
);
6849 /* Given two lists of attributes, return true if list l2 is
6850 equivalent to l1. */
6853 attribute_list_equal (const_tree l1
, const_tree l2
)
6858 return attribute_list_contained (l1
, l2
)
6859 && attribute_list_contained (l2
, l1
);
6862 /* Given two lists of attributes, return true if list L2 is
6863 completely contained within L1. */
6864 /* ??? This would be faster if attribute names were stored in a canonicalized
6865 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
6866 must be used to show these elements are equivalent (which they are). */
6867 /* ??? It's not clear that attributes with arguments will always be handled
6871 attribute_list_contained (const_tree l1
, const_tree l2
)
6875 /* First check the obvious, maybe the lists are identical. */
6879 /* Maybe the lists are similar. */
6880 for (t1
= l1
, t2
= l2
;
6882 && get_attribute_name (t1
) == get_attribute_name (t2
)
6883 && TREE_VALUE (t1
) == TREE_VALUE (t2
);
6884 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
6887 /* Maybe the lists are equal. */
6888 if (t1
== 0 && t2
== 0)
6891 for (; t2
!= 0; t2
= TREE_CHAIN (t2
))
6894 /* This CONST_CAST is okay because lookup_attribute does not
6895 modify its argument and the return value is assigned to a
6897 for (attr
= lookup_ident_attribute (get_attribute_name (t2
),
6898 CONST_CAST_TREE (l1
));
6899 attr
!= NULL_TREE
&& !attribute_value_equal (t2
, attr
);
6900 attr
= lookup_ident_attribute (get_attribute_name (t2
),
6904 if (attr
== NULL_TREE
)
6911 /* Given two lists of types
6912 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
6913 return 1 if the lists contain the same types in the same order.
6914 Also, the TREE_PURPOSEs must match. */
6917 type_list_equal (const_tree l1
, const_tree l2
)
6921 for (t1
= l1
, t2
= l2
; t1
&& t2
; t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
6922 if (TREE_VALUE (t1
) != TREE_VALUE (t2
)
6923 || (TREE_PURPOSE (t1
) != TREE_PURPOSE (t2
)
6924 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
))
6925 && (TREE_TYPE (TREE_PURPOSE (t1
))
6926 == TREE_TYPE (TREE_PURPOSE (t2
))))))
6932 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
6933 given by TYPE. If the argument list accepts variable arguments,
6934 then this function counts only the ordinary arguments. */
6937 type_num_arguments (const_tree type
)
6942 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
6943 /* If the function does not take a variable number of arguments,
6944 the last element in the list will have type `void'. */
6945 if (VOID_TYPE_P (TREE_VALUE (t
)))
6953 /* Nonzero if integer constants T1 and T2
6954 represent the same constant value. */
6957 tree_int_cst_equal (const_tree t1
, const_tree t2
)
6962 if (t1
== 0 || t2
== 0)
6965 if (TREE_CODE (t1
) == INTEGER_CST
6966 && TREE_CODE (t2
) == INTEGER_CST
6967 && wi::to_widest (t1
) == wi::to_widest (t2
))
6973 /* Return true if T is an INTEGER_CST whose numerical value (extended
6974 according to TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. */
6977 tree_fits_shwi_p (const_tree t
)
6979 return (t
!= NULL_TREE
6980 && TREE_CODE (t
) == INTEGER_CST
6981 && wi::fits_shwi_p (wi::to_widest (t
)));
6984 /* Return true if T is an INTEGER_CST whose numerical value (extended
6985 according to TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. */
6988 tree_fits_uhwi_p (const_tree t
)
6990 return (t
!= NULL_TREE
6991 && TREE_CODE (t
) == INTEGER_CST
6992 && wi::fits_uhwi_p (wi::to_widest (t
)));
6995 /* T is an INTEGER_CST whose numerical value (extended according to
6996 TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. Return that
7000 tree_to_shwi (const_tree t
)
7002 gcc_assert (tree_fits_shwi_p (t
));
7003 return TREE_INT_CST_LOW (t
);
7006 /* T is an INTEGER_CST whose numerical value (extended according to
7007 TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. Return that
7010 unsigned HOST_WIDE_INT
7011 tree_to_uhwi (const_tree t
)
7013 gcc_assert (tree_fits_uhwi_p (t
));
7014 return TREE_INT_CST_LOW (t
);
7017 /* Return the most significant (sign) bit of T. */
7020 tree_int_cst_sign_bit (const_tree t
)
7022 unsigned bitno
= TYPE_PRECISION (TREE_TYPE (t
)) - 1;
7024 return wi::extract_uhwi (t
, bitno
, 1);
7027 /* Return an indication of the sign of the integer constant T.
7028 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
7029 Note that -1 will never be returned if T's type is unsigned. */
7032 tree_int_cst_sgn (const_tree t
)
7034 if (wi::eq_p (t
, 0))
7036 else if (TYPE_UNSIGNED (TREE_TYPE (t
)))
7038 else if (wi::neg_p (t
))
7044 /* Return the minimum number of bits needed to represent VALUE in a
7045 signed or unsigned type, UNSIGNEDP says which. */
7048 tree_int_cst_min_precision (tree value
, signop sgn
)
7050 /* If the value is negative, compute its negative minus 1. The latter
7051 adjustment is because the absolute value of the largest negative value
7052 is one larger than the largest positive value. This is equivalent to
7053 a bit-wise negation, so use that operation instead. */
7055 if (tree_int_cst_sgn (value
) < 0)
7056 value
= fold_build1 (BIT_NOT_EXPR
, TREE_TYPE (value
), value
);
7058 /* Return the number of bits needed, taking into account the fact
7059 that we need one more bit for a signed than unsigned type.
7060 If value is 0 or -1, the minimum precision is 1 no matter
7061 whether unsignedp is true or false. */
7063 if (integer_zerop (value
))
7066 return tree_floor_log2 (value
) + 1 + (sgn
== SIGNED
? 1 : 0) ;
7069 /* Return truthvalue of whether T1 is the same tree structure as T2.
7070 Return 1 if they are the same.
7071 Return 0 if they are understandably different.
7072 Return -1 if either contains tree structure not understood by
7076 simple_cst_equal (const_tree t1
, const_tree t2
)
7078 enum tree_code code1
, code2
;
7084 if (t1
== 0 || t2
== 0)
7087 code1
= TREE_CODE (t1
);
7088 code2
= TREE_CODE (t2
);
7090 if (CONVERT_EXPR_CODE_P (code1
) || code1
== NON_LVALUE_EXPR
)
7092 if (CONVERT_EXPR_CODE_P (code2
)
7093 || code2
== NON_LVALUE_EXPR
)
7094 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7096 return simple_cst_equal (TREE_OPERAND (t1
, 0), t2
);
7099 else if (CONVERT_EXPR_CODE_P (code2
)
7100 || code2
== NON_LVALUE_EXPR
)
7101 return simple_cst_equal (t1
, TREE_OPERAND (t2
, 0));
7109 return wi::to_widest (t1
) == wi::to_widest (t2
);
7112 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1
), TREE_REAL_CST (t2
));
7115 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1
), TREE_FIXED_CST (t2
));
7118 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
7119 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
7120 TREE_STRING_LENGTH (t1
)));
7124 unsigned HOST_WIDE_INT idx
;
7125 vec
<constructor_elt
, va_gc
> *v1
= CONSTRUCTOR_ELTS (t1
);
7126 vec
<constructor_elt
, va_gc
> *v2
= CONSTRUCTOR_ELTS (t2
);
7128 if (vec_safe_length (v1
) != vec_safe_length (v2
))
7131 for (idx
= 0; idx
< vec_safe_length (v1
); ++idx
)
7132 /* ??? Should we handle also fields here? */
7133 if (!simple_cst_equal ((*v1
)[idx
].value
, (*v2
)[idx
].value
))
7139 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7142 cmp
= simple_cst_equal (CALL_EXPR_FN (t1
), CALL_EXPR_FN (t2
));
7145 if (call_expr_nargs (t1
) != call_expr_nargs (t2
))
7148 const_tree arg1
, arg2
;
7149 const_call_expr_arg_iterator iter1
, iter2
;
7150 for (arg1
= first_const_call_expr_arg (t1
, &iter1
),
7151 arg2
= first_const_call_expr_arg (t2
, &iter2
);
7153 arg1
= next_const_call_expr_arg (&iter1
),
7154 arg2
= next_const_call_expr_arg (&iter2
))
7156 cmp
= simple_cst_equal (arg1
, arg2
);
7160 return arg1
== arg2
;
7164 /* Special case: if either target is an unallocated VAR_DECL,
7165 it means that it's going to be unified with whatever the
7166 TARGET_EXPR is really supposed to initialize, so treat it
7167 as being equivalent to anything. */
7168 if ((TREE_CODE (TREE_OPERAND (t1
, 0)) == VAR_DECL
7169 && DECL_NAME (TREE_OPERAND (t1
, 0)) == NULL_TREE
7170 && !DECL_RTL_SET_P (TREE_OPERAND (t1
, 0)))
7171 || (TREE_CODE (TREE_OPERAND (t2
, 0)) == VAR_DECL
7172 && DECL_NAME (TREE_OPERAND (t2
, 0)) == NULL_TREE
7173 && !DECL_RTL_SET_P (TREE_OPERAND (t2
, 0))))
7176 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7181 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
7183 case WITH_CLEANUP_EXPR
:
7184 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7188 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t1
, 1));
7191 if (TREE_OPERAND (t1
, 1) == TREE_OPERAND (t2
, 1))
7192 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7206 /* This general rule works for most tree codes. All exceptions should be
7207 handled above. If this is a language-specific tree code, we can't
7208 trust what might be in the operand, so say we don't know
7210 if ((int) code1
>= (int) LAST_AND_UNUSED_TREE_CODE
)
7213 switch (TREE_CODE_CLASS (code1
))
7217 case tcc_comparison
:
7218 case tcc_expression
:
7222 for (i
= 0; i
< TREE_CODE_LENGTH (code1
); i
++)
7224 cmp
= simple_cst_equal (TREE_OPERAND (t1
, i
), TREE_OPERAND (t2
, i
));
7236 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
7237 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
7238 than U, respectively. */
7241 compare_tree_int (const_tree t
, unsigned HOST_WIDE_INT u
)
7243 if (tree_int_cst_sgn (t
) < 0)
7245 else if (!tree_fits_uhwi_p (t
))
7247 else if (TREE_INT_CST_LOW (t
) == u
)
7249 else if (TREE_INT_CST_LOW (t
) < u
)
7255 /* Return true if SIZE represents a constant size that is in bounds of
7256 what the middle-end and the backend accepts (covering not more than
7257 half of the address-space). */
7260 valid_constant_size_p (const_tree size
)
7262 if (! tree_fits_uhwi_p (size
)
7263 || TREE_OVERFLOW (size
)
7264 || tree_int_cst_sign_bit (size
) != 0)
7269 /* Return the precision of the type, or for a complex or vector type the
7270 precision of the type of its elements. */
7273 element_precision (const_tree type
)
7275 enum tree_code code
= TREE_CODE (type
);
7276 if (code
== COMPLEX_TYPE
|| code
== VECTOR_TYPE
)
7277 type
= TREE_TYPE (type
);
7279 return TYPE_PRECISION (type
);
7282 /* Return true if CODE represents an associative tree code. Otherwise
7285 associative_tree_code (enum tree_code code
)
7304 /* Return true if CODE represents a commutative tree code. Otherwise
7307 commutative_tree_code (enum tree_code code
)
7313 case MULT_HIGHPART_EXPR
:
7321 case UNORDERED_EXPR
:
7325 case TRUTH_AND_EXPR
:
7326 case TRUTH_XOR_EXPR
:
7328 case WIDEN_MULT_EXPR
:
7329 case VEC_WIDEN_MULT_HI_EXPR
:
7330 case VEC_WIDEN_MULT_LO_EXPR
:
7331 case VEC_WIDEN_MULT_EVEN_EXPR
:
7332 case VEC_WIDEN_MULT_ODD_EXPR
:
7341 /* Return true if CODE represents a ternary tree code for which the
7342 first two operands are commutative. Otherwise return false. */
7344 commutative_ternary_tree_code (enum tree_code code
)
7348 case WIDEN_MULT_PLUS_EXPR
:
7349 case WIDEN_MULT_MINUS_EXPR
:
7358 /* Generate a hash value for an expression. This can be used iteratively
7359 by passing a previous result as the VAL argument.
7361 This function is intended to produce the same hash for expressions which
7362 would compare equal using operand_equal_p. */
7365 iterative_hash_expr (const_tree t
, hashval_t val
)
7368 enum tree_code code
;
7369 enum tree_code_class tclass
;
7372 return iterative_hash_hashval_t (0, val
);
7374 code
= TREE_CODE (t
);
7378 /* Alas, constants aren't shared, so we can't rely on pointer
7381 return iterative_hash_hashval_t (0, val
);
7383 for (i
= 0; i
< TREE_INT_CST_NUNITS (t
); i
++)
7384 val
= iterative_hash_host_wide_int (TREE_INT_CST_ELT (t
, i
), val
);
7388 unsigned int val2
= real_hash (TREE_REAL_CST_PTR (t
));
7390 return iterative_hash_hashval_t (val2
, val
);
7394 unsigned int val2
= fixed_hash (TREE_FIXED_CST_PTR (t
));
7396 return iterative_hash_hashval_t (val2
, val
);
7399 return iterative_hash (TREE_STRING_POINTER (t
),
7400 TREE_STRING_LENGTH (t
), val
);
7402 val
= iterative_hash_expr (TREE_REALPART (t
), val
);
7403 return iterative_hash_expr (TREE_IMAGPART (t
), val
);
7407 for (i
= 0; i
< VECTOR_CST_NELTS (t
); ++i
)
7408 val
= iterative_hash_expr (VECTOR_CST_ELT (t
, i
), val
);
7412 /* We can just compare by pointer. */
7413 return iterative_hash_host_wide_int (SSA_NAME_VERSION (t
), val
);
7414 case PLACEHOLDER_EXPR
:
7415 /* The node itself doesn't matter. */
7418 /* A list of expressions, for a CALL_EXPR or as the elements of a
7420 for (; t
; t
= TREE_CHAIN (t
))
7421 val
= iterative_hash_expr (TREE_VALUE (t
), val
);
7425 unsigned HOST_WIDE_INT idx
;
7427 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t
), idx
, field
, value
)
7429 val
= iterative_hash_expr (field
, val
);
7430 val
= iterative_hash_expr (value
, val
);
7435 /* When referring to a built-in FUNCTION_DECL, use the __builtin__ form.
7436 Otherwise nodes that compare equal according to operand_equal_p might
7437 get different hash codes. However, don't do this for machine specific
7438 or front end builtins, since the function code is overloaded in those
7440 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
7441 && builtin_decl_explicit_p (DECL_FUNCTION_CODE (t
)))
7443 t
= builtin_decl_explicit (DECL_FUNCTION_CODE (t
));
7444 code
= TREE_CODE (t
);
7448 tclass
= TREE_CODE_CLASS (code
);
7450 if (tclass
== tcc_declaration
)
7452 /* DECL's have a unique ID */
7453 val
= iterative_hash_host_wide_int (DECL_UID (t
), val
);
7457 gcc_assert (IS_EXPR_CODE_CLASS (tclass
));
7459 val
= iterative_hash_object (code
, val
);
7461 /* Don't hash the type, that can lead to having nodes which
7462 compare equal according to operand_equal_p, but which
7463 have different hash codes. */
7464 if (CONVERT_EXPR_CODE_P (code
)
7465 || code
== NON_LVALUE_EXPR
)
7467 /* Make sure to include signness in the hash computation. */
7468 val
+= TYPE_UNSIGNED (TREE_TYPE (t
));
7469 val
= iterative_hash_expr (TREE_OPERAND (t
, 0), val
);
7472 else if (commutative_tree_code (code
))
7474 /* It's a commutative expression. We want to hash it the same
7475 however it appears. We do this by first hashing both operands
7476 and then rehashing based on the order of their independent
7478 hashval_t one
= iterative_hash_expr (TREE_OPERAND (t
, 0), 0);
7479 hashval_t two
= iterative_hash_expr (TREE_OPERAND (t
, 1), 0);
7483 t
= one
, one
= two
, two
= t
;
7485 val
= iterative_hash_hashval_t (one
, val
);
7486 val
= iterative_hash_hashval_t (two
, val
);
7489 for (i
= TREE_OPERAND_LENGTH (t
) - 1; i
>= 0; --i
)
7490 val
= iterative_hash_expr (TREE_OPERAND (t
, i
), val
);
7496 /* Constructors for pointer, array and function types.
7497 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
7498 constructed by language-dependent code, not here.) */
7500 /* Construct, lay out and return the type of pointers to TO_TYPE with
7501 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
7502 reference all of memory. If such a type has already been
7503 constructed, reuse it. */
7506 build_pointer_type_for_mode (tree to_type
, enum machine_mode mode
,
7511 if (to_type
== error_mark_node
)
7512 return error_mark_node
;
7514 /* If the pointed-to type has the may_alias attribute set, force
7515 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7516 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
7517 can_alias_all
= true;
7519 /* In some cases, languages will have things that aren't a POINTER_TYPE
7520 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
7521 In that case, return that type without regard to the rest of our
7524 ??? This is a kludge, but consistent with the way this function has
7525 always operated and there doesn't seem to be a good way to avoid this
7527 if (TYPE_POINTER_TO (to_type
) != 0
7528 && TREE_CODE (TYPE_POINTER_TO (to_type
)) != POINTER_TYPE
)
7529 return TYPE_POINTER_TO (to_type
);
7531 /* First, if we already have a type for pointers to TO_TYPE and it's
7532 the proper mode, use it. */
7533 for (t
= TYPE_POINTER_TO (to_type
); t
; t
= TYPE_NEXT_PTR_TO (t
))
7534 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
7537 t
= make_node (POINTER_TYPE
);
7539 TREE_TYPE (t
) = to_type
;
7540 SET_TYPE_MODE (t
, mode
);
7541 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
7542 TYPE_NEXT_PTR_TO (t
) = TYPE_POINTER_TO (to_type
);
7543 TYPE_POINTER_TO (to_type
) = t
;
7545 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
))
7546 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7547 else if (TYPE_CANONICAL (to_type
) != to_type
)
7549 = build_pointer_type_for_mode (TYPE_CANONICAL (to_type
),
7550 mode
, can_alias_all
);
7552 /* Lay out the type. This function has many callers that are concerned
7553 with expression-construction, and this simplifies them all. */
7559 /* By default build pointers in ptr_mode. */
7562 build_pointer_type (tree to_type
)
7564 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
7565 : TYPE_ADDR_SPACE (to_type
);
7566 enum machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
7567 return build_pointer_type_for_mode (to_type
, pointer_mode
, false);
7570 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
7573 build_reference_type_for_mode (tree to_type
, enum machine_mode mode
,
7578 if (to_type
== error_mark_node
)
7579 return error_mark_node
;
7581 /* If the pointed-to type has the may_alias attribute set, force
7582 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7583 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
7584 can_alias_all
= true;
7586 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
7587 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
7588 In that case, return that type without regard to the rest of our
7591 ??? This is a kludge, but consistent with the way this function has
7592 always operated and there doesn't seem to be a good way to avoid this
7594 if (TYPE_REFERENCE_TO (to_type
) != 0
7595 && TREE_CODE (TYPE_REFERENCE_TO (to_type
)) != REFERENCE_TYPE
)
7596 return TYPE_REFERENCE_TO (to_type
);
7598 /* First, if we already have a type for pointers to TO_TYPE and it's
7599 the proper mode, use it. */
7600 for (t
= TYPE_REFERENCE_TO (to_type
); t
; t
= TYPE_NEXT_REF_TO (t
))
7601 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
7604 t
= make_node (REFERENCE_TYPE
);
7606 TREE_TYPE (t
) = to_type
;
7607 SET_TYPE_MODE (t
, mode
);
7608 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
7609 TYPE_NEXT_REF_TO (t
) = TYPE_REFERENCE_TO (to_type
);
7610 TYPE_REFERENCE_TO (to_type
) = t
;
7612 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
))
7613 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7614 else if (TYPE_CANONICAL (to_type
) != to_type
)
7616 = build_reference_type_for_mode (TYPE_CANONICAL (to_type
),
7617 mode
, can_alias_all
);
7625 /* Build the node for the type of references-to-TO_TYPE by default
7629 build_reference_type (tree to_type
)
7631 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
7632 : TYPE_ADDR_SPACE (to_type
);
7633 enum machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
7634 return build_reference_type_for_mode (to_type
, pointer_mode
, false);
7637 #define MAX_INT_CACHED_PREC \
7638 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
7639 static GTY(()) tree nonstandard_integer_type_cache
[2 * MAX_INT_CACHED_PREC
+ 2];
7641 /* Builds a signed or unsigned integer type of precision PRECISION.
7642 Used for C bitfields whose precision does not match that of
7643 built-in target types. */
7645 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision
,
7651 unsignedp
= MAX_INT_CACHED_PREC
+ 1;
7653 if (precision
<= MAX_INT_CACHED_PREC
)
7655 itype
= nonstandard_integer_type_cache
[precision
+ unsignedp
];
7660 itype
= make_node (INTEGER_TYPE
);
7661 TYPE_PRECISION (itype
) = precision
;
7664 fixup_unsigned_type (itype
);
7666 fixup_signed_type (itype
);
7669 if (tree_fits_uhwi_p (TYPE_MAX_VALUE (itype
)))
7670 ret
= type_hash_canon (tree_to_uhwi (TYPE_MAX_VALUE (itype
)), itype
);
7671 if (precision
<= MAX_INT_CACHED_PREC
)
7672 nonstandard_integer_type_cache
[precision
+ unsignedp
] = ret
;
7677 /* Create a range of some discrete type TYPE (an INTEGER_TYPE, ENUMERAL_TYPE
7678 or BOOLEAN_TYPE) with low bound LOWVAL and high bound HIGHVAL. If SHARED
7679 is true, reuse such a type that has already been constructed. */
7682 build_range_type_1 (tree type
, tree lowval
, tree highval
, bool shared
)
7684 tree itype
= make_node (INTEGER_TYPE
);
7685 hashval_t hashcode
= 0;
7687 TREE_TYPE (itype
) = type
;
7689 TYPE_MIN_VALUE (itype
) = fold_convert (type
, lowval
);
7690 TYPE_MAX_VALUE (itype
) = highval
? fold_convert (type
, highval
) : NULL
;
7692 TYPE_PRECISION (itype
) = TYPE_PRECISION (type
);
7693 SET_TYPE_MODE (itype
, TYPE_MODE (type
));
7694 TYPE_SIZE (itype
) = TYPE_SIZE (type
);
7695 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (type
);
7696 TYPE_ALIGN (itype
) = TYPE_ALIGN (type
);
7697 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (type
);
7702 if ((TYPE_MIN_VALUE (itype
)
7703 && TREE_CODE (TYPE_MIN_VALUE (itype
)) != INTEGER_CST
)
7704 || (TYPE_MAX_VALUE (itype
)
7705 && TREE_CODE (TYPE_MAX_VALUE (itype
)) != INTEGER_CST
))
7707 /* Since we cannot reliably merge this type, we need to compare it using
7708 structural equality checks. */
7709 SET_TYPE_STRUCTURAL_EQUALITY (itype
);
7713 hashcode
= iterative_hash_expr (TYPE_MIN_VALUE (itype
), hashcode
);
7714 hashcode
= iterative_hash_expr (TYPE_MAX_VALUE (itype
), hashcode
);
7715 hashcode
= iterative_hash_hashval_t (TYPE_HASH (type
), hashcode
);
7716 itype
= type_hash_canon (hashcode
, itype
);
7721 /* Wrapper around build_range_type_1 with SHARED set to true. */
7724 build_range_type (tree type
, tree lowval
, tree highval
)
7726 return build_range_type_1 (type
, lowval
, highval
, true);
7729 /* Wrapper around build_range_type_1 with SHARED set to false. */
7732 build_nonshared_range_type (tree type
, tree lowval
, tree highval
)
7734 return build_range_type_1 (type
, lowval
, highval
, false);
7737 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
7738 MAXVAL should be the maximum value in the domain
7739 (one less than the length of the array).
7741 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
7742 We don't enforce this limit, that is up to caller (e.g. language front end).
7743 The limit exists because the result is a signed type and we don't handle
7744 sizes that use more than one HOST_WIDE_INT. */
7747 build_index_type (tree maxval
)
7749 return build_range_type (sizetype
, size_zero_node
, maxval
);
7752 /* Return true if the debug information for TYPE, a subtype, should be emitted
7753 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
7754 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
7755 debug info and doesn't reflect the source code. */
7758 subrange_type_for_debug_p (const_tree type
, tree
*lowval
, tree
*highval
)
7760 tree base_type
= TREE_TYPE (type
), low
, high
;
7762 /* Subrange types have a base type which is an integral type. */
7763 if (!INTEGRAL_TYPE_P (base_type
))
7766 /* Get the real bounds of the subtype. */
7767 if (lang_hooks
.types
.get_subrange_bounds
)
7768 lang_hooks
.types
.get_subrange_bounds (type
, &low
, &high
);
7771 low
= TYPE_MIN_VALUE (type
);
7772 high
= TYPE_MAX_VALUE (type
);
7775 /* If the type and its base type have the same representation and the same
7776 name, then the type is not a subrange but a copy of the base type. */
7777 if ((TREE_CODE (base_type
) == INTEGER_TYPE
7778 || TREE_CODE (base_type
) == BOOLEAN_TYPE
)
7779 && int_size_in_bytes (type
) == int_size_in_bytes (base_type
)
7780 && tree_int_cst_equal (low
, TYPE_MIN_VALUE (base_type
))
7781 && tree_int_cst_equal (high
, TYPE_MAX_VALUE (base_type
))
7782 && TYPE_IDENTIFIER (type
) == TYPE_IDENTIFIER (base_type
))
7792 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
7793 and number of elements specified by the range of values of INDEX_TYPE.
7794 If SHARED is true, reuse such a type that has already been constructed. */
7797 build_array_type_1 (tree elt_type
, tree index_type
, bool shared
)
7801 if (TREE_CODE (elt_type
) == FUNCTION_TYPE
)
7803 error ("arrays of functions are not meaningful");
7804 elt_type
= integer_type_node
;
7807 t
= make_node (ARRAY_TYPE
);
7808 TREE_TYPE (t
) = elt_type
;
7809 TYPE_DOMAIN (t
) = index_type
;
7810 TYPE_ADDR_SPACE (t
) = TYPE_ADDR_SPACE (elt_type
);
7813 /* If the element type is incomplete at this point we get marked for
7814 structural equality. Do not record these types in the canonical
7816 if (TYPE_STRUCTURAL_EQUALITY_P (t
))
7821 hashval_t hashcode
= iterative_hash_object (TYPE_HASH (elt_type
), 0);
7823 hashcode
= iterative_hash_object (TYPE_HASH (index_type
), hashcode
);
7824 t
= type_hash_canon (hashcode
, t
);
7827 if (TYPE_CANONICAL (t
) == t
)
7829 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type
)
7830 || (index_type
&& TYPE_STRUCTURAL_EQUALITY_P (index_type
)))
7831 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7832 else if (TYPE_CANONICAL (elt_type
) != elt_type
7833 || (index_type
&& TYPE_CANONICAL (index_type
) != index_type
))
7835 = build_array_type_1 (TYPE_CANONICAL (elt_type
),
7837 ? TYPE_CANONICAL (index_type
) : NULL_TREE
,
7844 /* Wrapper around build_array_type_1 with SHARED set to true. */
7847 build_array_type (tree elt_type
, tree index_type
)
7849 return build_array_type_1 (elt_type
, index_type
, true);
7852 /* Wrapper around build_array_type_1 with SHARED set to false. */
7855 build_nonshared_array_type (tree elt_type
, tree index_type
)
7857 return build_array_type_1 (elt_type
, index_type
, false);
7860 /* Return a representation of ELT_TYPE[NELTS], using indices of type
7864 build_array_type_nelts (tree elt_type
, unsigned HOST_WIDE_INT nelts
)
7866 return build_array_type (elt_type
, build_index_type (size_int (nelts
- 1)));
7869 /* Recursively examines the array elements of TYPE, until a non-array
7870 element type is found. */
7873 strip_array_types (tree type
)
7875 while (TREE_CODE (type
) == ARRAY_TYPE
)
7876 type
= TREE_TYPE (type
);
7881 /* Computes the canonical argument types from the argument type list
7884 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
7885 on entry to this function, or if any of the ARGTYPES are
7888 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
7889 true on entry to this function, or if any of the ARGTYPES are
7892 Returns a canonical argument list, which may be ARGTYPES when the
7893 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
7894 true) or would not differ from ARGTYPES. */
7897 maybe_canonicalize_argtypes (tree argtypes
,
7898 bool *any_structural_p
,
7899 bool *any_noncanonical_p
)
7902 bool any_noncanonical_argtypes_p
= false;
7904 for (arg
= argtypes
; arg
&& !(*any_structural_p
); arg
= TREE_CHAIN (arg
))
7906 if (!TREE_VALUE (arg
) || TREE_VALUE (arg
) == error_mark_node
)
7907 /* Fail gracefully by stating that the type is structural. */
7908 *any_structural_p
= true;
7909 else if (TYPE_STRUCTURAL_EQUALITY_P (TREE_VALUE (arg
)))
7910 *any_structural_p
= true;
7911 else if (TYPE_CANONICAL (TREE_VALUE (arg
)) != TREE_VALUE (arg
)
7912 || TREE_PURPOSE (arg
))
7913 /* If the argument has a default argument, we consider it
7914 non-canonical even though the type itself is canonical.
7915 That way, different variants of function and method types
7916 with default arguments will all point to the variant with
7917 no defaults as their canonical type. */
7918 any_noncanonical_argtypes_p
= true;
7921 if (*any_structural_p
)
7924 if (any_noncanonical_argtypes_p
)
7926 /* Build the canonical list of argument types. */
7927 tree canon_argtypes
= NULL_TREE
;
7928 bool is_void
= false;
7930 for (arg
= argtypes
; arg
; arg
= TREE_CHAIN (arg
))
7932 if (arg
== void_list_node
)
7935 canon_argtypes
= tree_cons (NULL_TREE
,
7936 TYPE_CANONICAL (TREE_VALUE (arg
)),
7940 canon_argtypes
= nreverse (canon_argtypes
);
7942 canon_argtypes
= chainon (canon_argtypes
, void_list_node
);
7944 /* There is a non-canonical type. */
7945 *any_noncanonical_p
= true;
7946 return canon_argtypes
;
7949 /* The canonical argument types are the same as ARGTYPES. */
7953 /* Construct, lay out and return
7954 the type of functions returning type VALUE_TYPE
7955 given arguments of types ARG_TYPES.
7956 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
7957 are data type nodes for the arguments of the function.
7958 If such a type has already been constructed, reuse it. */
7961 build_function_type (tree value_type
, tree arg_types
)
7964 hashval_t hashcode
= 0;
7965 bool any_structural_p
, any_noncanonical_p
;
7966 tree canon_argtypes
;
7968 if (TREE_CODE (value_type
) == FUNCTION_TYPE
)
7970 error ("function return type cannot be function");
7971 value_type
= integer_type_node
;
7974 /* Make a node of the sort we want. */
7975 t
= make_node (FUNCTION_TYPE
);
7976 TREE_TYPE (t
) = value_type
;
7977 TYPE_ARG_TYPES (t
) = arg_types
;
7979 /* If we already have such a type, use the old one. */
7980 hashcode
= iterative_hash_object (TYPE_HASH (value_type
), hashcode
);
7981 hashcode
= type_hash_list (arg_types
, hashcode
);
7982 t
= type_hash_canon (hashcode
, t
);
7984 /* Set up the canonical type. */
7985 any_structural_p
= TYPE_STRUCTURAL_EQUALITY_P (value_type
);
7986 any_noncanonical_p
= TYPE_CANONICAL (value_type
) != value_type
;
7987 canon_argtypes
= maybe_canonicalize_argtypes (arg_types
,
7989 &any_noncanonical_p
);
7990 if (any_structural_p
)
7991 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7992 else if (any_noncanonical_p
)
7993 TYPE_CANONICAL (t
) = build_function_type (TYPE_CANONICAL (value_type
),
7996 if (!COMPLETE_TYPE_P (t
))
8001 /* Build a function type. The RETURN_TYPE is the type returned by the
8002 function. If VAARGS is set, no void_type_node is appended to the
8003 the list. ARGP must be always be terminated be a NULL_TREE. */
8006 build_function_type_list_1 (bool vaargs
, tree return_type
, va_list argp
)
8010 t
= va_arg (argp
, tree
);
8011 for (args
= NULL_TREE
; t
!= NULL_TREE
; t
= va_arg (argp
, tree
))
8012 args
= tree_cons (NULL_TREE
, t
, args
);
8017 if (args
!= NULL_TREE
)
8018 args
= nreverse (args
);
8019 gcc_assert (last
!= void_list_node
);
8021 else if (args
== NULL_TREE
)
8022 args
= void_list_node
;
8026 args
= nreverse (args
);
8027 TREE_CHAIN (last
) = void_list_node
;
8029 args
= build_function_type (return_type
, args
);
8034 /* Build a function type. The RETURN_TYPE is the type returned by the
8035 function. If additional arguments are provided, they are
8036 additional argument types. The list of argument types must always
8037 be terminated by NULL_TREE. */
8040 build_function_type_list (tree return_type
, ...)
8045 va_start (p
, return_type
);
8046 args
= build_function_type_list_1 (false, return_type
, p
);
8051 /* Build a variable argument function type. The RETURN_TYPE is the
8052 type returned by the function. If additional arguments are provided,
8053 they are additional argument types. The list of argument types must
8054 always be terminated by NULL_TREE. */
8057 build_varargs_function_type_list (tree return_type
, ...)
8062 va_start (p
, return_type
);
8063 args
= build_function_type_list_1 (true, return_type
, p
);
8069 /* Build a function type. RETURN_TYPE is the type returned by the
8070 function; VAARGS indicates whether the function takes varargs. The
8071 function takes N named arguments, the types of which are provided in
8075 build_function_type_array_1 (bool vaargs
, tree return_type
, int n
,
8079 tree t
= vaargs
? NULL_TREE
: void_list_node
;
8081 for (i
= n
- 1; i
>= 0; i
--)
8082 t
= tree_cons (NULL_TREE
, arg_types
[i
], t
);
8084 return build_function_type (return_type
, t
);
8087 /* Build a function type. RETURN_TYPE is the type returned by the
8088 function. The function takes N named arguments, the types of which
8089 are provided in ARG_TYPES. */
8092 build_function_type_array (tree return_type
, int n
, tree
*arg_types
)
8094 return build_function_type_array_1 (false, return_type
, n
, arg_types
);
8097 /* Build a variable argument function type. RETURN_TYPE is the type
8098 returned by the function. The function takes N named arguments, the
8099 types of which are provided in ARG_TYPES. */
8102 build_varargs_function_type_array (tree return_type
, int n
, tree
*arg_types
)
8104 return build_function_type_array_1 (true, return_type
, n
, arg_types
);
8107 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
8108 and ARGTYPES (a TREE_LIST) are the return type and arguments types
8109 for the method. An implicit additional parameter (of type
8110 pointer-to-BASETYPE) is added to the ARGTYPES. */
8113 build_method_type_directly (tree basetype
,
8120 bool any_structural_p
, any_noncanonical_p
;
8121 tree canon_argtypes
;
8123 /* Make a node of the sort we want. */
8124 t
= make_node (METHOD_TYPE
);
8126 TYPE_METHOD_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
8127 TREE_TYPE (t
) = rettype
;
8128 ptype
= build_pointer_type (basetype
);
8130 /* The actual arglist for this function includes a "hidden" argument
8131 which is "this". Put it into the list of argument types. */
8132 argtypes
= tree_cons (NULL_TREE
, ptype
, argtypes
);
8133 TYPE_ARG_TYPES (t
) = argtypes
;
8135 /* If we already have such a type, use the old one. */
8136 hashcode
= iterative_hash_object (TYPE_HASH (basetype
), hashcode
);
8137 hashcode
= iterative_hash_object (TYPE_HASH (rettype
), hashcode
);
8138 hashcode
= type_hash_list (argtypes
, hashcode
);
8139 t
= type_hash_canon (hashcode
, t
);
8141 /* Set up the canonical type. */
8143 = (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
8144 || TYPE_STRUCTURAL_EQUALITY_P (rettype
));
8146 = (TYPE_CANONICAL (basetype
) != basetype
8147 || TYPE_CANONICAL (rettype
) != rettype
);
8148 canon_argtypes
= maybe_canonicalize_argtypes (TREE_CHAIN (argtypes
),
8150 &any_noncanonical_p
);
8151 if (any_structural_p
)
8152 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8153 else if (any_noncanonical_p
)
8155 = build_method_type_directly (TYPE_CANONICAL (basetype
),
8156 TYPE_CANONICAL (rettype
),
8158 if (!COMPLETE_TYPE_P (t
))
8164 /* Construct, lay out and return the type of methods belonging to class
8165 BASETYPE and whose arguments and values are described by TYPE.
8166 If that type exists already, reuse it.
8167 TYPE must be a FUNCTION_TYPE node. */
8170 build_method_type (tree basetype
, tree type
)
8172 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
8174 return build_method_type_directly (basetype
,
8176 TYPE_ARG_TYPES (type
));
8179 /* Construct, lay out and return the type of offsets to a value
8180 of type TYPE, within an object of type BASETYPE.
8181 If a suitable offset type exists already, reuse it. */
8184 build_offset_type (tree basetype
, tree type
)
8187 hashval_t hashcode
= 0;
8189 /* Make a node of the sort we want. */
8190 t
= make_node (OFFSET_TYPE
);
8192 TYPE_OFFSET_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
8193 TREE_TYPE (t
) = type
;
8195 /* If we already have such a type, use the old one. */
8196 hashcode
= iterative_hash_object (TYPE_HASH (basetype
), hashcode
);
8197 hashcode
= iterative_hash_object (TYPE_HASH (type
), hashcode
);
8198 t
= type_hash_canon (hashcode
, t
);
8200 if (!COMPLETE_TYPE_P (t
))
8203 if (TYPE_CANONICAL (t
) == t
)
8205 if (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
8206 || TYPE_STRUCTURAL_EQUALITY_P (type
))
8207 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8208 else if (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)) != basetype
8209 || TYPE_CANONICAL (type
) != type
)
8211 = build_offset_type (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)),
8212 TYPE_CANONICAL (type
));
8218 /* Create a complex type whose components are COMPONENT_TYPE. */
8221 build_complex_type (tree component_type
)
8226 gcc_assert (INTEGRAL_TYPE_P (component_type
)
8227 || SCALAR_FLOAT_TYPE_P (component_type
)
8228 || FIXED_POINT_TYPE_P (component_type
));
8230 /* Make a node of the sort we want. */
8231 t
= make_node (COMPLEX_TYPE
);
8233 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (component_type
);
8235 /* If we already have such a type, use the old one. */
8236 hashcode
= iterative_hash_object (TYPE_HASH (component_type
), 0);
8237 t
= type_hash_canon (hashcode
, t
);
8239 if (!COMPLETE_TYPE_P (t
))
8242 if (TYPE_CANONICAL (t
) == t
)
8244 if (TYPE_STRUCTURAL_EQUALITY_P (component_type
))
8245 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8246 else if (TYPE_CANONICAL (component_type
) != component_type
)
8248 = build_complex_type (TYPE_CANONICAL (component_type
));
8251 /* We need to create a name, since complex is a fundamental type. */
8252 if (! TYPE_NAME (t
))
8255 if (component_type
== char_type_node
)
8256 name
= "complex char";
8257 else if (component_type
== signed_char_type_node
)
8258 name
= "complex signed char";
8259 else if (component_type
== unsigned_char_type_node
)
8260 name
= "complex unsigned char";
8261 else if (component_type
== short_integer_type_node
)
8262 name
= "complex short int";
8263 else if (component_type
== short_unsigned_type_node
)
8264 name
= "complex short unsigned int";
8265 else if (component_type
== integer_type_node
)
8266 name
= "complex int";
8267 else if (component_type
== unsigned_type_node
)
8268 name
= "complex unsigned int";
8269 else if (component_type
== long_integer_type_node
)
8270 name
= "complex long int";
8271 else if (component_type
== long_unsigned_type_node
)
8272 name
= "complex long unsigned int";
8273 else if (component_type
== long_long_integer_type_node
)
8274 name
= "complex long long int";
8275 else if (component_type
== long_long_unsigned_type_node
)
8276 name
= "complex long long unsigned int";
8281 TYPE_NAME (t
) = build_decl (UNKNOWN_LOCATION
, TYPE_DECL
,
8282 get_identifier (name
), t
);
8285 return build_qualified_type (t
, TYPE_QUALS (component_type
));
8288 /* If TYPE is a real or complex floating-point type and the target
8289 does not directly support arithmetic on TYPE then return the wider
8290 type to be used for arithmetic on TYPE. Otherwise, return
8294 excess_precision_type (tree type
)
8296 if (flag_excess_precision
!= EXCESS_PRECISION_FAST
)
8298 int flt_eval_method
= TARGET_FLT_EVAL_METHOD
;
8299 switch (TREE_CODE (type
))
8302 switch (flt_eval_method
)
8305 if (TYPE_MODE (type
) == TYPE_MODE (float_type_node
))
8306 return double_type_node
;
8309 if (TYPE_MODE (type
) == TYPE_MODE (float_type_node
)
8310 || TYPE_MODE (type
) == TYPE_MODE (double_type_node
))
8311 return long_double_type_node
;
8318 if (TREE_CODE (TREE_TYPE (type
)) != REAL_TYPE
)
8320 switch (flt_eval_method
)
8323 if (TYPE_MODE (TREE_TYPE (type
)) == TYPE_MODE (float_type_node
))
8324 return complex_double_type_node
;
8327 if (TYPE_MODE (TREE_TYPE (type
)) == TYPE_MODE (float_type_node
)
8328 || (TYPE_MODE (TREE_TYPE (type
))
8329 == TYPE_MODE (double_type_node
)))
8330 return complex_long_double_type_node
;
8343 /* Return OP, stripped of any conversions to wider types as much as is safe.
8344 Converting the value back to OP's type makes a value equivalent to OP.
8346 If FOR_TYPE is nonzero, we return a value which, if converted to
8347 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
8349 OP must have integer, real or enumeral type. Pointers are not allowed!
8351 There are some cases where the obvious value we could return
8352 would regenerate to OP if converted to OP's type,
8353 but would not extend like OP to wider types.
8354 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
8355 For example, if OP is (unsigned short)(signed char)-1,
8356 we avoid returning (signed char)-1 if FOR_TYPE is int,
8357 even though extending that to an unsigned short would regenerate OP,
8358 since the result of extending (signed char)-1 to (int)
8359 is different from (int) OP. */
8362 get_unwidened (tree op
, tree for_type
)
8364 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
8365 tree type
= TREE_TYPE (op
);
8367 = TYPE_PRECISION (for_type
!= 0 ? for_type
: type
);
8369 = (for_type
!= 0 && for_type
!= type
8370 && final_prec
> TYPE_PRECISION (type
)
8371 && TYPE_UNSIGNED (type
));
8374 while (CONVERT_EXPR_P (op
))
8378 /* TYPE_PRECISION on vector types has different meaning
8379 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
8380 so avoid them here. */
8381 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op
, 0))) == VECTOR_TYPE
)
8384 bitschange
= TYPE_PRECISION (TREE_TYPE (op
))
8385 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0)));
8387 /* Truncations are many-one so cannot be removed.
8388 Unless we are later going to truncate down even farther. */
8390 && final_prec
> TYPE_PRECISION (TREE_TYPE (op
)))
8393 /* See what's inside this conversion. If we decide to strip it,
8395 op
= TREE_OPERAND (op
, 0);
8397 /* If we have not stripped any zero-extensions (uns is 0),
8398 we can strip any kind of extension.
8399 If we have previously stripped a zero-extension,
8400 only zero-extensions can safely be stripped.
8401 Any extension can be stripped if the bits it would produce
8402 are all going to be discarded later by truncating to FOR_TYPE. */
8406 if (! uns
|| final_prec
<= TYPE_PRECISION (TREE_TYPE (op
)))
8408 /* TYPE_UNSIGNED says whether this is a zero-extension.
8409 Let's avoid computing it if it does not affect WIN
8410 and if UNS will not be needed again. */
8412 || CONVERT_EXPR_P (op
))
8413 && TYPE_UNSIGNED (TREE_TYPE (op
)))
8421 /* If we finally reach a constant see if it fits in for_type and
8422 in that case convert it. */
8424 && TREE_CODE (win
) == INTEGER_CST
8425 && TREE_TYPE (win
) != for_type
8426 && int_fits_type_p (win
, for_type
))
8427 win
= fold_convert (for_type
, win
);
8432 /* Return OP or a simpler expression for a narrower value
8433 which can be sign-extended or zero-extended to give back OP.
8434 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
8435 or 0 if the value should be sign-extended. */
8438 get_narrower (tree op
, int *unsignedp_ptr
)
8443 bool integral_p
= INTEGRAL_TYPE_P (TREE_TYPE (op
));
8445 while (TREE_CODE (op
) == NOP_EXPR
)
8448 = (TYPE_PRECISION (TREE_TYPE (op
))
8449 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0))));
8451 /* Truncations are many-one so cannot be removed. */
8455 /* See what's inside this conversion. If we decide to strip it,
8460 op
= TREE_OPERAND (op
, 0);
8461 /* An extension: the outermost one can be stripped,
8462 but remember whether it is zero or sign extension. */
8464 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
8465 /* Otherwise, if a sign extension has been stripped,
8466 only sign extensions can now be stripped;
8467 if a zero extension has been stripped, only zero-extensions. */
8468 else if (uns
!= TYPE_UNSIGNED (TREE_TYPE (op
)))
8472 else /* bitschange == 0 */
8474 /* A change in nominal type can always be stripped, but we must
8475 preserve the unsignedness. */
8477 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
8479 op
= TREE_OPERAND (op
, 0);
8480 /* Keep trying to narrow, but don't assign op to win if it
8481 would turn an integral type into something else. */
8482 if (INTEGRAL_TYPE_P (TREE_TYPE (op
)) != integral_p
)
8489 if (TREE_CODE (op
) == COMPONENT_REF
8490 /* Since type_for_size always gives an integer type. */
8491 && TREE_CODE (TREE_TYPE (op
)) != REAL_TYPE
8492 && TREE_CODE (TREE_TYPE (op
)) != FIXED_POINT_TYPE
8493 /* Ensure field is laid out already. */
8494 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0
8495 && tree_fits_uhwi_p (DECL_SIZE (TREE_OPERAND (op
, 1))))
8497 unsigned HOST_WIDE_INT innerprec
8498 = tree_to_uhwi (DECL_SIZE (TREE_OPERAND (op
, 1)));
8499 int unsignedp
= (DECL_UNSIGNED (TREE_OPERAND (op
, 1))
8500 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op
, 1))));
8501 tree type
= lang_hooks
.types
.type_for_size (innerprec
, unsignedp
);
8503 /* We can get this structure field in a narrower type that fits it,
8504 but the resulting extension to its nominal type (a fullword type)
8505 must satisfy the same conditions as for other extensions.
8507 Do this only for fields that are aligned (not bit-fields),
8508 because when bit-field insns will be used there is no
8509 advantage in doing this. */
8511 if (innerprec
< TYPE_PRECISION (TREE_TYPE (op
))
8512 && ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1))
8513 && (first
|| uns
== DECL_UNSIGNED (TREE_OPERAND (op
, 1)))
8517 uns
= DECL_UNSIGNED (TREE_OPERAND (op
, 1));
8518 win
= fold_convert (type
, op
);
8522 *unsignedp_ptr
= uns
;
8526 /* Returns true if integer constant C has a value that is permissible
8527 for type TYPE (an INTEGER_TYPE). */
8530 int_fits_type_p (const_tree c
, const_tree type
)
8532 tree type_low_bound
, type_high_bound
;
8533 bool ok_for_low_bound
, ok_for_high_bound
;
8534 signop sgn_c
= TYPE_SIGN (TREE_TYPE (c
));
8537 type_low_bound
= TYPE_MIN_VALUE (type
);
8538 type_high_bound
= TYPE_MAX_VALUE (type
);
8540 /* If at least one bound of the type is a constant integer, we can check
8541 ourselves and maybe make a decision. If no such decision is possible, but
8542 this type is a subtype, try checking against that. Otherwise, use
8543 fits_to_tree_p, which checks against the precision.
8545 Compute the status for each possibly constant bound, and return if we see
8546 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
8547 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
8548 for "constant known to fit". */
8550 /* Check if c >= type_low_bound. */
8551 if (type_low_bound
&& TREE_CODE (type_low_bound
) == INTEGER_CST
)
8553 if (tree_int_cst_lt (c
, type_low_bound
))
8555 ok_for_low_bound
= true;
8558 ok_for_low_bound
= false;
8560 /* Check if c <= type_high_bound. */
8561 if (type_high_bound
&& TREE_CODE (type_high_bound
) == INTEGER_CST
)
8563 if (tree_int_cst_lt (type_high_bound
, c
))
8565 ok_for_high_bound
= true;
8568 ok_for_high_bound
= false;
8570 /* If the constant fits both bounds, the result is known. */
8571 if (ok_for_low_bound
&& ok_for_high_bound
)
8574 /* Perform some generic filtering which may allow making a decision
8575 even if the bounds are not constant. First, negative integers
8576 never fit in unsigned types, */
8577 if (TYPE_UNSIGNED (type
) && sgn_c
== SIGNED
&& wi::neg_p (c
))
8580 /* Second, narrower types always fit in wider ones. */
8581 if (TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (c
)))
8584 /* Third, unsigned integers with top bit set never fit signed types. */
8585 if (!TYPE_UNSIGNED (type
) && sgn_c
== UNSIGNED
)
8587 int prec
= GET_MODE_PRECISION (TYPE_MODE (TREE_TYPE (c
))) - 1;
8588 if (prec
< TYPE_PRECISION (TREE_TYPE (c
)))
8590 /* When a tree_cst is converted to a wide-int, the precision
8591 is taken from the type. However, if the precision of the
8592 mode underneath the type is smaller than that, it is
8593 possible that the value will not fit. The test below
8594 fails if any bit is set between the sign bit of the
8595 underlying mode and the top bit of the type. */
8596 if (wi::ne_p (wi::zext (c
, prec
- 1), c
))
8599 else if (wi::neg_p (c
))
8603 /* If we haven't been able to decide at this point, there nothing more we
8604 can check ourselves here. Look at the base type if we have one and it
8605 has the same precision. */
8606 if (TREE_CODE (type
) == INTEGER_TYPE
8607 && TREE_TYPE (type
) != 0
8608 && TYPE_PRECISION (type
) == TYPE_PRECISION (TREE_TYPE (type
)))
8610 type
= TREE_TYPE (type
);
8614 /* Or to fits_to_tree_p, if nothing else. */
8615 return wi::fits_to_tree_p (c
, type
);
8618 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
8619 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
8620 represented (assuming two's-complement arithmetic) within the bit
8621 precision of the type are returned instead. */
8624 get_type_static_bounds (const_tree type
, mpz_t min
, mpz_t max
)
8626 if (!POINTER_TYPE_P (type
) && TYPE_MIN_VALUE (type
)
8627 && TREE_CODE (TYPE_MIN_VALUE (type
)) == INTEGER_CST
)
8628 wi::to_mpz (TYPE_MIN_VALUE (type
), min
, TYPE_SIGN (type
));
8631 if (TYPE_UNSIGNED (type
))
8632 mpz_set_ui (min
, 0);
8635 wide_int mn
= wi::min_value (TYPE_PRECISION (type
), SIGNED
);
8636 wi::to_mpz (mn
, min
, SIGNED
);
8640 if (!POINTER_TYPE_P (type
) && TYPE_MAX_VALUE (type
)
8641 && TREE_CODE (TYPE_MAX_VALUE (type
)) == INTEGER_CST
)
8642 wi::to_mpz (TYPE_MAX_VALUE (type
), max
, TYPE_SIGN (type
));
8645 wide_int mn
= wi::max_value (TYPE_PRECISION (type
), TYPE_SIGN (type
));
8646 wi::to_mpz (mn
, max
, TYPE_SIGN (type
));
8650 /* Return true if VAR is an automatic variable defined in function FN. */
8653 auto_var_in_fn_p (const_tree var
, const_tree fn
)
8655 return (DECL_P (var
) && DECL_CONTEXT (var
) == fn
8656 && ((((TREE_CODE (var
) == VAR_DECL
&& ! DECL_EXTERNAL (var
))
8657 || TREE_CODE (var
) == PARM_DECL
)
8658 && ! TREE_STATIC (var
))
8659 || TREE_CODE (var
) == LABEL_DECL
8660 || TREE_CODE (var
) == RESULT_DECL
));
8663 /* Subprogram of following function. Called by walk_tree.
8665 Return *TP if it is an automatic variable or parameter of the
8666 function passed in as DATA. */
8669 find_var_from_fn (tree
*tp
, int *walk_subtrees
, void *data
)
8671 tree fn
= (tree
) data
;
8676 else if (DECL_P (*tp
)
8677 && auto_var_in_fn_p (*tp
, fn
))
8683 /* Returns true if T is, contains, or refers to a type with variable
8684 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
8685 arguments, but not the return type. If FN is nonzero, only return
8686 true if a modifier of the type or position of FN is a variable or
8687 parameter inside FN.
8689 This concept is more general than that of C99 'variably modified types':
8690 in C99, a struct type is never variably modified because a VLA may not
8691 appear as a structure member. However, in GNU C code like:
8693 struct S { int i[f()]; };
8695 is valid, and other languages may define similar constructs. */
8698 variably_modified_type_p (tree type
, tree fn
)
8702 /* Test if T is either variable (if FN is zero) or an expression containing
8703 a variable in FN. If TYPE isn't gimplified, return true also if
8704 gimplify_one_sizepos would gimplify the expression into a local
8706 #define RETURN_TRUE_IF_VAR(T) \
8707 do { tree _t = (T); \
8708 if (_t != NULL_TREE \
8709 && _t != error_mark_node \
8710 && TREE_CODE (_t) != INTEGER_CST \
8711 && TREE_CODE (_t) != PLACEHOLDER_EXPR \
8713 || (!TYPE_SIZES_GIMPLIFIED (type) \
8714 && !is_gimple_sizepos (_t)) \
8715 || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
8716 return true; } while (0)
8718 if (type
== error_mark_node
)
8721 /* If TYPE itself has variable size, it is variably modified. */
8722 RETURN_TRUE_IF_VAR (TYPE_SIZE (type
));
8723 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type
));
8725 switch (TREE_CODE (type
))
8728 case REFERENCE_TYPE
:
8730 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
8736 /* If TYPE is a function type, it is variably modified if the
8737 return type is variably modified. */
8738 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
8744 case FIXED_POINT_TYPE
:
8747 /* Scalar types are variably modified if their end points
8749 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type
));
8750 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type
));
8755 case QUAL_UNION_TYPE
:
8756 /* We can't see if any of the fields are variably-modified by the
8757 definition we normally use, since that would produce infinite
8758 recursion via pointers. */
8759 /* This is variably modified if some field's type is. */
8760 for (t
= TYPE_FIELDS (type
); t
; t
= DECL_CHAIN (t
))
8761 if (TREE_CODE (t
) == FIELD_DECL
)
8763 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t
));
8764 RETURN_TRUE_IF_VAR (DECL_SIZE (t
));
8765 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t
));
8767 if (TREE_CODE (type
) == QUAL_UNION_TYPE
)
8768 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t
));
8773 /* Do not call ourselves to avoid infinite recursion. This is
8774 variably modified if the element type is. */
8775 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type
)));
8776 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type
)));
8783 /* The current language may have other cases to check, but in general,
8784 all other types are not variably modified. */
8785 return lang_hooks
.tree_inlining
.var_mod_type_p (type
, fn
);
8787 #undef RETURN_TRUE_IF_VAR
8790 /* Given a DECL or TYPE, return the scope in which it was declared, or
8791 NULL_TREE if there is no containing scope. */
8794 get_containing_scope (const_tree t
)
8796 return (TYPE_P (t
) ? TYPE_CONTEXT (t
) : DECL_CONTEXT (t
));
8799 /* Return the innermost context enclosing DECL that is
8800 a FUNCTION_DECL, or zero if none. */
8803 decl_function_context (const_tree decl
)
8807 if (TREE_CODE (decl
) == ERROR_MARK
)
8810 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
8811 where we look up the function at runtime. Such functions always take
8812 a first argument of type 'pointer to real context'.
8814 C++ should really be fixed to use DECL_CONTEXT for the real context,
8815 and use something else for the "virtual context". */
8816 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VINDEX (decl
))
8819 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl
)))));
8821 context
= DECL_CONTEXT (decl
);
8823 while (context
&& TREE_CODE (context
) != FUNCTION_DECL
)
8825 if (TREE_CODE (context
) == BLOCK
)
8826 context
= BLOCK_SUPERCONTEXT (context
);
8828 context
= get_containing_scope (context
);
8834 /* Return the innermost context enclosing DECL that is
8835 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
8836 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
8839 decl_type_context (const_tree decl
)
8841 tree context
= DECL_CONTEXT (decl
);
8844 switch (TREE_CODE (context
))
8846 case NAMESPACE_DECL
:
8847 case TRANSLATION_UNIT_DECL
:
8852 case QUAL_UNION_TYPE
:
8857 context
= DECL_CONTEXT (context
);
8861 context
= BLOCK_SUPERCONTEXT (context
);
8871 /* CALL is a CALL_EXPR. Return the declaration for the function
8872 called, or NULL_TREE if the called function cannot be
8876 get_callee_fndecl (const_tree call
)
8880 if (call
== error_mark_node
)
8881 return error_mark_node
;
8883 /* It's invalid to call this function with anything but a
8885 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
8887 /* The first operand to the CALL is the address of the function
8889 addr
= CALL_EXPR_FN (call
);
8893 /* If this is a readonly function pointer, extract its initial value. */
8894 if (DECL_P (addr
) && TREE_CODE (addr
) != FUNCTION_DECL
8895 && TREE_READONLY (addr
) && ! TREE_THIS_VOLATILE (addr
)
8896 && DECL_INITIAL (addr
))
8897 addr
= DECL_INITIAL (addr
);
8899 /* If the address is just `&f' for some function `f', then we know
8900 that `f' is being called. */
8901 if (TREE_CODE (addr
) == ADDR_EXPR
8902 && TREE_CODE (TREE_OPERAND (addr
, 0)) == FUNCTION_DECL
)
8903 return TREE_OPERAND (addr
, 0);
8905 /* We couldn't figure out what was being called. */
8909 /* Print debugging information about tree nodes generated during the compile,
8910 and any language-specific information. */
8913 dump_tree_statistics (void)
8915 if (GATHER_STATISTICS
)
8918 int total_nodes
, total_bytes
;
8919 fprintf (stderr
, "Kind Nodes Bytes\n");
8920 fprintf (stderr
, "---------------------------------------\n");
8921 total_nodes
= total_bytes
= 0;
8922 for (i
= 0; i
< (int) all_kinds
; i
++)
8924 fprintf (stderr
, "%-20s %7d %10d\n", tree_node_kind_names
[i
],
8925 tree_node_counts
[i
], tree_node_sizes
[i
]);
8926 total_nodes
+= tree_node_counts
[i
];
8927 total_bytes
+= tree_node_sizes
[i
];
8929 fprintf (stderr
, "---------------------------------------\n");
8930 fprintf (stderr
, "%-20s %7d %10d\n", "Total", total_nodes
, total_bytes
);
8931 fprintf (stderr
, "---------------------------------------\n");
8932 fprintf (stderr
, "Code Nodes\n");
8933 fprintf (stderr
, "----------------------------\n");
8934 for (i
= 0; i
< (int) MAX_TREE_CODES
; i
++)
8935 fprintf (stderr
, "%-20s %7d\n", get_tree_code_name ((enum tree_code
) i
),
8936 tree_code_counts
[i
]);
8937 fprintf (stderr
, "----------------------------\n");
8938 ssanames_print_statistics ();
8939 phinodes_print_statistics ();
8942 fprintf (stderr
, "(No per-node statistics)\n");
8944 print_type_hash_statistics ();
8945 print_debug_expr_statistics ();
8946 print_value_expr_statistics ();
8947 lang_hooks
.print_statistics ();
8950 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
8952 /* Generate a crc32 of a byte. */
8955 crc32_unsigned_bits (unsigned chksum
, unsigned value
, unsigned bits
)
8959 for (ix
= bits
; ix
--; value
<<= 1)
8963 feedback
= (value
^ chksum
) & 0x80000000 ? 0x04c11db7 : 0;
8970 /* Generate a crc32 of a 32-bit unsigned. */
8973 crc32_unsigned (unsigned chksum
, unsigned value
)
8975 return crc32_unsigned_bits (chksum
, value
, 32);
8978 /* Generate a crc32 of a byte. */
8981 crc32_byte (unsigned chksum
, char byte
)
8983 return crc32_unsigned_bits (chksum
, (unsigned) byte
<< 24, 8);
8986 /* Generate a crc32 of a string. */
8989 crc32_string (unsigned chksum
, const char *string
)
8993 chksum
= crc32_byte (chksum
, *string
);
8999 /* P is a string that will be used in a symbol. Mask out any characters
9000 that are not valid in that context. */
9003 clean_symbol_name (char *p
)
9007 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
9010 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
9017 /* Generate a name for a special-purpose function.
9018 The generated name may need to be unique across the whole link.
9019 Changes to this function may also require corresponding changes to
9020 xstrdup_mask_random.
9021 TYPE is some string to identify the purpose of this function to the
9022 linker or collect2; it must start with an uppercase letter,
9024 I - for constructors
9026 N - for C++ anonymous namespaces
9027 F - for DWARF unwind frame information. */
9030 get_file_function_name (const char *type
)
9036 /* If we already have a name we know to be unique, just use that. */
9037 if (first_global_object_name
)
9038 p
= q
= ASTRDUP (first_global_object_name
);
9039 /* If the target is handling the constructors/destructors, they
9040 will be local to this file and the name is only necessary for
9042 We also assign sub_I and sub_D sufixes to constructors called from
9043 the global static constructors. These are always local. */
9044 else if (((type
[0] == 'I' || type
[0] == 'D') && targetm
.have_ctors_dtors
)
9045 || (strncmp (type
, "sub_", 4) == 0
9046 && (type
[4] == 'I' || type
[4] == 'D')))
9048 const char *file
= main_input_filename
;
9050 file
= LOCATION_FILE (input_location
);
9051 /* Just use the file's basename, because the full pathname
9052 might be quite long. */
9053 p
= q
= ASTRDUP (lbasename (file
));
9057 /* Otherwise, the name must be unique across the entire link.
9058 We don't have anything that we know to be unique to this translation
9059 unit, so use what we do have and throw in some randomness. */
9061 const char *name
= weak_global_object_name
;
9062 const char *file
= main_input_filename
;
9067 file
= LOCATION_FILE (input_location
);
9069 len
= strlen (file
);
9070 q
= (char *) alloca (9 + 17 + len
+ 1);
9071 memcpy (q
, file
, len
+ 1);
9073 snprintf (q
+ len
, 9 + 17 + 1, "_%08X_" HOST_WIDE_INT_PRINT_HEX
,
9074 crc32_string (0, name
), get_random_seed (false));
9079 clean_symbol_name (q
);
9080 buf
= (char *) alloca (sizeof (FILE_FUNCTION_FORMAT
) + strlen (p
)
9083 /* Set up the name of the file-level functions we may need.
9084 Use a global object (which is already required to be unique over
9085 the program) rather than the file name (which imposes extra
9087 sprintf (buf
, FILE_FUNCTION_FORMAT
, type
, p
);
9089 return get_identifier (buf
);
9092 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
9094 /* Complain that the tree code of NODE does not match the expected 0
9095 terminated list of trailing codes. The trailing code list can be
9096 empty, for a more vague error message. FILE, LINE, and FUNCTION
9097 are of the caller. */
9100 tree_check_failed (const_tree node
, const char *file
,
9101 int line
, const char *function
, ...)
9105 unsigned length
= 0;
9106 enum tree_code code
;
9108 va_start (args
, function
);
9109 while ((code
= (enum tree_code
) va_arg (args
, int)))
9110 length
+= 4 + strlen (get_tree_code_name (code
));
9115 va_start (args
, function
);
9116 length
+= strlen ("expected ");
9117 buffer
= tmp
= (char *) alloca (length
);
9119 while ((code
= (enum tree_code
) va_arg (args
, int)))
9121 const char *prefix
= length
? " or " : "expected ";
9123 strcpy (tmp
+ length
, prefix
);
9124 length
+= strlen (prefix
);
9125 strcpy (tmp
+ length
, get_tree_code_name (code
));
9126 length
+= strlen (get_tree_code_name (code
));
9131 buffer
= "unexpected node";
9133 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9134 buffer
, get_tree_code_name (TREE_CODE (node
)),
9135 function
, trim_filename (file
), line
);
9138 /* Complain that the tree code of NODE does match the expected 0
9139 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
9143 tree_not_check_failed (const_tree node
, const char *file
,
9144 int line
, const char *function
, ...)
9148 unsigned length
= 0;
9149 enum tree_code code
;
9151 va_start (args
, function
);
9152 while ((code
= (enum tree_code
) va_arg (args
, int)))
9153 length
+= 4 + strlen (get_tree_code_name (code
));
9155 va_start (args
, function
);
9156 buffer
= (char *) alloca (length
);
9158 while ((code
= (enum tree_code
) va_arg (args
, int)))
9162 strcpy (buffer
+ length
, " or ");
9165 strcpy (buffer
+ length
, get_tree_code_name (code
));
9166 length
+= strlen (get_tree_code_name (code
));
9170 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
9171 buffer
, get_tree_code_name (TREE_CODE (node
)),
9172 function
, trim_filename (file
), line
);
9175 /* Similar to tree_check_failed, except that we check for a class of tree
9176 code, given in CL. */
9179 tree_class_check_failed (const_tree node
, const enum tree_code_class cl
,
9180 const char *file
, int line
, const char *function
)
9183 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
9184 TREE_CODE_CLASS_STRING (cl
),
9185 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
9186 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9189 /* Similar to tree_check_failed, except that instead of specifying a
9190 dozen codes, use the knowledge that they're all sequential. */
9193 tree_range_check_failed (const_tree node
, const char *file
, int line
,
9194 const char *function
, enum tree_code c1
,
9198 unsigned length
= 0;
9201 for (c
= c1
; c
<= c2
; ++c
)
9202 length
+= 4 + strlen (get_tree_code_name ((enum tree_code
) c
));
9204 length
+= strlen ("expected ");
9205 buffer
= (char *) alloca (length
);
9208 for (c
= c1
; c
<= c2
; ++c
)
9210 const char *prefix
= length
? " or " : "expected ";
9212 strcpy (buffer
+ length
, prefix
);
9213 length
+= strlen (prefix
);
9214 strcpy (buffer
+ length
, get_tree_code_name ((enum tree_code
) c
));
9215 length
+= strlen (get_tree_code_name ((enum tree_code
) c
));
9218 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9219 buffer
, get_tree_code_name (TREE_CODE (node
)),
9220 function
, trim_filename (file
), line
);
9224 /* Similar to tree_check_failed, except that we check that a tree does
9225 not have the specified code, given in CL. */
9228 tree_not_class_check_failed (const_tree node
, const enum tree_code_class cl
,
9229 const char *file
, int line
, const char *function
)
9232 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
9233 TREE_CODE_CLASS_STRING (cl
),
9234 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
9235 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9239 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
9242 omp_clause_check_failed (const_tree node
, const char *file
, int line
,
9243 const char *function
, enum omp_clause_code code
)
9245 internal_error ("tree check: expected omp_clause %s, have %s in %s, at %s:%d",
9246 omp_clause_code_name
[code
], get_tree_code_name (TREE_CODE (node
)),
9247 function
, trim_filename (file
), line
);
9251 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
9254 omp_clause_range_check_failed (const_tree node
, const char *file
, int line
,
9255 const char *function
, enum omp_clause_code c1
,
9256 enum omp_clause_code c2
)
9259 unsigned length
= 0;
9262 for (c
= c1
; c
<= c2
; ++c
)
9263 length
+= 4 + strlen (omp_clause_code_name
[c
]);
9265 length
+= strlen ("expected ");
9266 buffer
= (char *) alloca (length
);
9269 for (c
= c1
; c
<= c2
; ++c
)
9271 const char *prefix
= length
? " or " : "expected ";
9273 strcpy (buffer
+ length
, prefix
);
9274 length
+= strlen (prefix
);
9275 strcpy (buffer
+ length
, omp_clause_code_name
[c
]);
9276 length
+= strlen (omp_clause_code_name
[c
]);
9279 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9280 buffer
, omp_clause_code_name
[TREE_CODE (node
)],
9281 function
, trim_filename (file
), line
);
9285 #undef DEFTREESTRUCT
9286 #define DEFTREESTRUCT(VAL, NAME) NAME,
9288 static const char *ts_enum_names
[] = {
9289 #include "treestruct.def"
9291 #undef DEFTREESTRUCT
9293 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
9295 /* Similar to tree_class_check_failed, except that we check for
9296 whether CODE contains the tree structure identified by EN. */
9299 tree_contains_struct_check_failed (const_tree node
,
9300 const enum tree_node_structure_enum en
,
9301 const char *file
, int line
,
9302 const char *function
)
9305 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
9307 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9311 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9312 (dynamically sized) vector. */
9315 tree_int_cst_elt_check_failed (int idx
, int len
, const char *file
, int line
,
9316 const char *function
)
9319 ("tree check: accessed elt %d of tree_int_cst with %d elts in %s, at %s:%d",
9320 idx
+ 1, len
, function
, trim_filename (file
), line
);
9323 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9324 (dynamically sized) vector. */
9327 tree_vec_elt_check_failed (int idx
, int len
, const char *file
, int line
,
9328 const char *function
)
9331 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
9332 idx
+ 1, len
, function
, trim_filename (file
), line
);
9335 /* Similar to above, except that the check is for the bounds of the operand
9336 vector of an expression node EXP. */
9339 tree_operand_check_failed (int idx
, const_tree exp
, const char *file
,
9340 int line
, const char *function
)
9342 enum tree_code code
= TREE_CODE (exp
);
9344 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
9345 idx
+ 1, get_tree_code_name (code
), TREE_OPERAND_LENGTH (exp
),
9346 function
, trim_filename (file
), line
);
9349 /* Similar to above, except that the check is for the number of
9350 operands of an OMP_CLAUSE node. */
9353 omp_clause_operand_check_failed (int idx
, const_tree t
, const char *file
,
9354 int line
, const char *function
)
9357 ("tree check: accessed operand %d of omp_clause %s with %d operands "
9358 "in %s, at %s:%d", idx
+ 1, omp_clause_code_name
[OMP_CLAUSE_CODE (t
)],
9359 omp_clause_num_ops
[OMP_CLAUSE_CODE (t
)], function
,
9360 trim_filename (file
), line
);
9362 #endif /* ENABLE_TREE_CHECKING */
9364 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
9365 and mapped to the machine mode MODE. Initialize its fields and build
9366 the information necessary for debugging output. */
9369 make_vector_type (tree innertype
, int nunits
, enum machine_mode mode
)
9372 hashval_t hashcode
= 0;
9374 t
= make_node (VECTOR_TYPE
);
9375 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (innertype
);
9376 SET_TYPE_VECTOR_SUBPARTS (t
, nunits
);
9377 SET_TYPE_MODE (t
, mode
);
9379 if (TYPE_STRUCTURAL_EQUALITY_P (innertype
))
9380 SET_TYPE_STRUCTURAL_EQUALITY (t
);
9381 else if (TYPE_CANONICAL (innertype
) != innertype
9382 || mode
!= VOIDmode
)
9384 = make_vector_type (TYPE_CANONICAL (innertype
), nunits
, VOIDmode
);
9388 hashcode
= iterative_hash_host_wide_int (VECTOR_TYPE
, hashcode
);
9389 hashcode
= iterative_hash_host_wide_int (nunits
, hashcode
);
9390 hashcode
= iterative_hash_host_wide_int (mode
, hashcode
);
9391 hashcode
= iterative_hash_object (TYPE_HASH (TREE_TYPE (t
)), hashcode
);
9392 t
= type_hash_canon (hashcode
, t
);
9394 /* We have built a main variant, based on the main variant of the
9395 inner type. Use it to build the variant we return. */
9396 if ((TYPE_ATTRIBUTES (innertype
) || TYPE_QUALS (innertype
))
9397 && TREE_TYPE (t
) != innertype
)
9398 return build_type_attribute_qual_variant (t
,
9399 TYPE_ATTRIBUTES (innertype
),
9400 TYPE_QUALS (innertype
));
9406 make_or_reuse_type (unsigned size
, int unsignedp
)
9408 if (size
== INT_TYPE_SIZE
)
9409 return unsignedp
? unsigned_type_node
: integer_type_node
;
9410 if (size
== CHAR_TYPE_SIZE
)
9411 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
9412 if (size
== SHORT_TYPE_SIZE
)
9413 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
9414 if (size
== LONG_TYPE_SIZE
)
9415 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
9416 if (size
== LONG_LONG_TYPE_SIZE
)
9417 return (unsignedp
? long_long_unsigned_type_node
9418 : long_long_integer_type_node
);
9419 if (size
== 128 && int128_integer_type_node
)
9420 return (unsignedp
? int128_unsigned_type_node
9421 : int128_integer_type_node
);
9424 return make_unsigned_type (size
);
9426 return make_signed_type (size
);
9429 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
9432 make_or_reuse_fract_type (unsigned size
, int unsignedp
, int satp
)
9436 if (size
== SHORT_FRACT_TYPE_SIZE
)
9437 return unsignedp
? sat_unsigned_short_fract_type_node
9438 : sat_short_fract_type_node
;
9439 if (size
== FRACT_TYPE_SIZE
)
9440 return unsignedp
? sat_unsigned_fract_type_node
: sat_fract_type_node
;
9441 if (size
== LONG_FRACT_TYPE_SIZE
)
9442 return unsignedp
? sat_unsigned_long_fract_type_node
9443 : sat_long_fract_type_node
;
9444 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
9445 return unsignedp
? sat_unsigned_long_long_fract_type_node
9446 : sat_long_long_fract_type_node
;
9450 if (size
== SHORT_FRACT_TYPE_SIZE
)
9451 return unsignedp
? unsigned_short_fract_type_node
9452 : short_fract_type_node
;
9453 if (size
== FRACT_TYPE_SIZE
)
9454 return unsignedp
? unsigned_fract_type_node
: fract_type_node
;
9455 if (size
== LONG_FRACT_TYPE_SIZE
)
9456 return unsignedp
? unsigned_long_fract_type_node
9457 : long_fract_type_node
;
9458 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
9459 return unsignedp
? unsigned_long_long_fract_type_node
9460 : long_long_fract_type_node
;
9463 return make_fract_type (size
, unsignedp
, satp
);
9466 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
9469 make_or_reuse_accum_type (unsigned size
, int unsignedp
, int satp
)
9473 if (size
== SHORT_ACCUM_TYPE_SIZE
)
9474 return unsignedp
? sat_unsigned_short_accum_type_node
9475 : sat_short_accum_type_node
;
9476 if (size
== ACCUM_TYPE_SIZE
)
9477 return unsignedp
? sat_unsigned_accum_type_node
: sat_accum_type_node
;
9478 if (size
== LONG_ACCUM_TYPE_SIZE
)
9479 return unsignedp
? sat_unsigned_long_accum_type_node
9480 : sat_long_accum_type_node
;
9481 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
9482 return unsignedp
? sat_unsigned_long_long_accum_type_node
9483 : sat_long_long_accum_type_node
;
9487 if (size
== SHORT_ACCUM_TYPE_SIZE
)
9488 return unsignedp
? unsigned_short_accum_type_node
9489 : short_accum_type_node
;
9490 if (size
== ACCUM_TYPE_SIZE
)
9491 return unsignedp
? unsigned_accum_type_node
: accum_type_node
;
9492 if (size
== LONG_ACCUM_TYPE_SIZE
)
9493 return unsignedp
? unsigned_long_accum_type_node
9494 : long_accum_type_node
;
9495 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
9496 return unsignedp
? unsigned_long_long_accum_type_node
9497 : long_long_accum_type_node
;
9500 return make_accum_type (size
, unsignedp
, satp
);
9504 /* Create an atomic variant node for TYPE. This routine is called
9505 during initialization of data types to create the 5 basic atomic
9506 types. The generic build_variant_type function requires these to
9507 already be set up in order to function properly, so cannot be
9508 called from there. If ALIGN is non-zero, then ensure alignment is
9509 overridden to this value. */
9512 build_atomic_base (tree type
, unsigned int align
)
9516 /* Make sure its not already registered. */
9517 if ((t
= get_qualified_type (type
, TYPE_QUAL_ATOMIC
)))
9520 t
= build_variant_type_copy (type
);
9521 set_type_quals (t
, TYPE_QUAL_ATOMIC
);
9524 TYPE_ALIGN (t
) = align
;
9529 /* Create nodes for all integer types (and error_mark_node) using the sizes
9530 of C datatypes. SIGNED_CHAR specifies whether char is signed,
9531 SHORT_DOUBLE specifies whether double should be of the same precision
9535 build_common_tree_nodes (bool signed_char
, bool short_double
)
9537 error_mark_node
= make_node (ERROR_MARK
);
9538 TREE_TYPE (error_mark_node
) = error_mark_node
;
9540 initialize_sizetypes ();
9542 /* Define both `signed char' and `unsigned char'. */
9543 signed_char_type_node
= make_signed_type (CHAR_TYPE_SIZE
);
9544 TYPE_STRING_FLAG (signed_char_type_node
) = 1;
9545 unsigned_char_type_node
= make_unsigned_type (CHAR_TYPE_SIZE
);
9546 TYPE_STRING_FLAG (unsigned_char_type_node
) = 1;
9548 /* Define `char', which is like either `signed char' or `unsigned char'
9549 but not the same as either. */
9552 ? make_signed_type (CHAR_TYPE_SIZE
)
9553 : make_unsigned_type (CHAR_TYPE_SIZE
));
9554 TYPE_STRING_FLAG (char_type_node
) = 1;
9556 short_integer_type_node
= make_signed_type (SHORT_TYPE_SIZE
);
9557 short_unsigned_type_node
= make_unsigned_type (SHORT_TYPE_SIZE
);
9558 integer_type_node
= make_signed_type (INT_TYPE_SIZE
);
9559 unsigned_type_node
= make_unsigned_type (INT_TYPE_SIZE
);
9560 long_integer_type_node
= make_signed_type (LONG_TYPE_SIZE
);
9561 long_unsigned_type_node
= make_unsigned_type (LONG_TYPE_SIZE
);
9562 long_long_integer_type_node
= make_signed_type (LONG_LONG_TYPE_SIZE
);
9563 long_long_unsigned_type_node
= make_unsigned_type (LONG_LONG_TYPE_SIZE
);
9564 #if HOST_BITS_PER_WIDE_INT >= 64
9565 /* TODO: This isn't correct, but as logic depends at the moment on
9566 host's instead of target's wide-integer.
9567 If there is a target not supporting TImode, but has an 128-bit
9568 integer-scalar register, this target check needs to be adjusted. */
9569 if (targetm
.scalar_mode_supported_p (TImode
))
9571 int128_integer_type_node
= make_signed_type (128);
9572 int128_unsigned_type_node
= make_unsigned_type (128);
9576 /* Define a boolean type. This type only represents boolean values but
9577 may be larger than char depending on the value of BOOL_TYPE_SIZE. */
9578 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
9579 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
9580 TYPE_PRECISION (boolean_type_node
) = 1;
9581 TYPE_MAX_VALUE (boolean_type_node
) = build_int_cst (boolean_type_node
, 1);
9583 /* Define what type to use for size_t. */
9584 if (strcmp (SIZE_TYPE
, "unsigned int") == 0)
9585 size_type_node
= unsigned_type_node
;
9586 else if (strcmp (SIZE_TYPE
, "long unsigned int") == 0)
9587 size_type_node
= long_unsigned_type_node
;
9588 else if (strcmp (SIZE_TYPE
, "long long unsigned int") == 0)
9589 size_type_node
= long_long_unsigned_type_node
;
9590 else if (strcmp (SIZE_TYPE
, "short unsigned int") == 0)
9591 size_type_node
= short_unsigned_type_node
;
9595 /* Fill in the rest of the sized types. Reuse existing type nodes
9597 intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 0);
9598 intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 0);
9599 intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 0);
9600 intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 0);
9601 intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 0);
9603 unsigned_intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 1);
9604 unsigned_intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 1);
9605 unsigned_intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 1);
9606 unsigned_intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 1);
9607 unsigned_intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 1);
9609 /* Don't call build_qualified type for atomics. That routine does
9610 special processing for atomics, and until they are initialized
9611 it's better not to make that call.
9613 Check to see if there is a target override for atomic types. */
9615 atomicQI_type_node
= build_atomic_base (unsigned_intQI_type_node
,
9616 targetm
.atomic_align_for_mode (QImode
));
9617 atomicHI_type_node
= build_atomic_base (unsigned_intHI_type_node
,
9618 targetm
.atomic_align_for_mode (HImode
));
9619 atomicSI_type_node
= build_atomic_base (unsigned_intSI_type_node
,
9620 targetm
.atomic_align_for_mode (SImode
));
9621 atomicDI_type_node
= build_atomic_base (unsigned_intDI_type_node
,
9622 targetm
.atomic_align_for_mode (DImode
));
9623 atomicTI_type_node
= build_atomic_base (unsigned_intTI_type_node
,
9624 targetm
.atomic_align_for_mode (TImode
));
9626 access_public_node
= get_identifier ("public");
9627 access_protected_node
= get_identifier ("protected");
9628 access_private_node
= get_identifier ("private");
9630 /* Define these next since types below may used them. */
9631 integer_zero_node
= build_int_cst (integer_type_node
, 0);
9632 integer_one_node
= build_int_cst (integer_type_node
, 1);
9633 integer_three_node
= build_int_cst (integer_type_node
, 3);
9634 integer_minus_one_node
= build_int_cst (integer_type_node
, -1);
9636 size_zero_node
= size_int (0);
9637 size_one_node
= size_int (1);
9638 bitsize_zero_node
= bitsize_int (0);
9639 bitsize_one_node
= bitsize_int (1);
9640 bitsize_unit_node
= bitsize_int (BITS_PER_UNIT
);
9642 boolean_false_node
= TYPE_MIN_VALUE (boolean_type_node
);
9643 boolean_true_node
= TYPE_MAX_VALUE (boolean_type_node
);
9645 void_type_node
= make_node (VOID_TYPE
);
9646 layout_type (void_type_node
);
9648 /* We are not going to have real types in C with less than byte alignment,
9649 so we might as well not have any types that claim to have it. */
9650 TYPE_ALIGN (void_type_node
) = BITS_PER_UNIT
;
9651 TYPE_USER_ALIGN (void_type_node
) = 0;
9653 void_node
= make_node (VOID_CST
);
9654 TREE_TYPE (void_node
) = void_type_node
;
9656 null_pointer_node
= build_int_cst (build_pointer_type (void_type_node
), 0);
9657 layout_type (TREE_TYPE (null_pointer_node
));
9659 ptr_type_node
= build_pointer_type (void_type_node
);
9661 = build_pointer_type (build_type_variant (void_type_node
, 1, 0));
9662 fileptr_type_node
= ptr_type_node
;
9664 pointer_sized_int_node
= build_nonstandard_integer_type (POINTER_SIZE
, 1);
9666 float_type_node
= make_node (REAL_TYPE
);
9667 TYPE_PRECISION (float_type_node
) = FLOAT_TYPE_SIZE
;
9668 layout_type (float_type_node
);
9670 double_type_node
= make_node (REAL_TYPE
);
9672 TYPE_PRECISION (double_type_node
) = FLOAT_TYPE_SIZE
;
9674 TYPE_PRECISION (double_type_node
) = DOUBLE_TYPE_SIZE
;
9675 layout_type (double_type_node
);
9677 long_double_type_node
= make_node (REAL_TYPE
);
9678 TYPE_PRECISION (long_double_type_node
) = LONG_DOUBLE_TYPE_SIZE
;
9679 layout_type (long_double_type_node
);
9681 float_ptr_type_node
= build_pointer_type (float_type_node
);
9682 double_ptr_type_node
= build_pointer_type (double_type_node
);
9683 long_double_ptr_type_node
= build_pointer_type (long_double_type_node
);
9684 integer_ptr_type_node
= build_pointer_type (integer_type_node
);
9686 /* Fixed size integer types. */
9687 uint16_type_node
= build_nonstandard_integer_type (16, true);
9688 uint32_type_node
= build_nonstandard_integer_type (32, true);
9689 uint64_type_node
= build_nonstandard_integer_type (64, true);
9691 /* Decimal float types. */
9692 dfloat32_type_node
= make_node (REAL_TYPE
);
9693 TYPE_PRECISION (dfloat32_type_node
) = DECIMAL32_TYPE_SIZE
;
9694 layout_type (dfloat32_type_node
);
9695 SET_TYPE_MODE (dfloat32_type_node
, SDmode
);
9696 dfloat32_ptr_type_node
= build_pointer_type (dfloat32_type_node
);
9698 dfloat64_type_node
= make_node (REAL_TYPE
);
9699 TYPE_PRECISION (dfloat64_type_node
) = DECIMAL64_TYPE_SIZE
;
9700 layout_type (dfloat64_type_node
);
9701 SET_TYPE_MODE (dfloat64_type_node
, DDmode
);
9702 dfloat64_ptr_type_node
= build_pointer_type (dfloat64_type_node
);
9704 dfloat128_type_node
= make_node (REAL_TYPE
);
9705 TYPE_PRECISION (dfloat128_type_node
) = DECIMAL128_TYPE_SIZE
;
9706 layout_type (dfloat128_type_node
);
9707 SET_TYPE_MODE (dfloat128_type_node
, TDmode
);
9708 dfloat128_ptr_type_node
= build_pointer_type (dfloat128_type_node
);
9710 complex_integer_type_node
= build_complex_type (integer_type_node
);
9711 complex_float_type_node
= build_complex_type (float_type_node
);
9712 complex_double_type_node
= build_complex_type (double_type_node
);
9713 complex_long_double_type_node
= build_complex_type (long_double_type_node
);
9715 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
9716 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
9717 sat_ ## KIND ## _type_node = \
9718 make_sat_signed_ ## KIND ## _type (SIZE); \
9719 sat_unsigned_ ## KIND ## _type_node = \
9720 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9721 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9722 unsigned_ ## KIND ## _type_node = \
9723 make_unsigned_ ## KIND ## _type (SIZE);
9725 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
9726 sat_ ## WIDTH ## KIND ## _type_node = \
9727 make_sat_signed_ ## KIND ## _type (SIZE); \
9728 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
9729 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9730 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9731 unsigned_ ## WIDTH ## KIND ## _type_node = \
9732 make_unsigned_ ## KIND ## _type (SIZE);
9734 /* Make fixed-point type nodes based on four different widths. */
9735 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
9736 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
9737 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
9738 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
9739 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
9741 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
9742 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
9743 NAME ## _type_node = \
9744 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
9745 u ## NAME ## _type_node = \
9746 make_or_reuse_unsigned_ ## KIND ## _type \
9747 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
9748 sat_ ## NAME ## _type_node = \
9749 make_or_reuse_sat_signed_ ## KIND ## _type \
9750 (GET_MODE_BITSIZE (MODE ## mode)); \
9751 sat_u ## NAME ## _type_node = \
9752 make_or_reuse_sat_unsigned_ ## KIND ## _type \
9753 (GET_MODE_BITSIZE (U ## MODE ## mode));
9755 /* Fixed-point type and mode nodes. */
9756 MAKE_FIXED_TYPE_NODE_FAMILY (fract
, FRACT
)
9757 MAKE_FIXED_TYPE_NODE_FAMILY (accum
, ACCUM
)
9758 MAKE_FIXED_MODE_NODE (fract
, qq
, QQ
)
9759 MAKE_FIXED_MODE_NODE (fract
, hq
, HQ
)
9760 MAKE_FIXED_MODE_NODE (fract
, sq
, SQ
)
9761 MAKE_FIXED_MODE_NODE (fract
, dq
, DQ
)
9762 MAKE_FIXED_MODE_NODE (fract
, tq
, TQ
)
9763 MAKE_FIXED_MODE_NODE (accum
, ha
, HA
)
9764 MAKE_FIXED_MODE_NODE (accum
, sa
, SA
)
9765 MAKE_FIXED_MODE_NODE (accum
, da
, DA
)
9766 MAKE_FIXED_MODE_NODE (accum
, ta
, TA
)
9769 tree t
= targetm
.build_builtin_va_list ();
9771 /* Many back-ends define record types without setting TYPE_NAME.
9772 If we copied the record type here, we'd keep the original
9773 record type without a name. This breaks name mangling. So,
9774 don't copy record types and let c_common_nodes_and_builtins()
9775 declare the type to be __builtin_va_list. */
9776 if (TREE_CODE (t
) != RECORD_TYPE
)
9777 t
= build_variant_type_copy (t
);
9779 va_list_type_node
= t
;
9783 /* Modify DECL for given flags.
9784 TM_PURE attribute is set only on types, so the function will modify
9785 DECL's type when ECF_TM_PURE is used. */
9788 set_call_expr_flags (tree decl
, int flags
)
9790 if (flags
& ECF_NOTHROW
)
9791 TREE_NOTHROW (decl
) = 1;
9792 if (flags
& ECF_CONST
)
9793 TREE_READONLY (decl
) = 1;
9794 if (flags
& ECF_PURE
)
9795 DECL_PURE_P (decl
) = 1;
9796 if (flags
& ECF_LOOPING_CONST_OR_PURE
)
9797 DECL_LOOPING_CONST_OR_PURE_P (decl
) = 1;
9798 if (flags
& ECF_NOVOPS
)
9799 DECL_IS_NOVOPS (decl
) = 1;
9800 if (flags
& ECF_NORETURN
)
9801 TREE_THIS_VOLATILE (decl
) = 1;
9802 if (flags
& ECF_MALLOC
)
9803 DECL_IS_MALLOC (decl
) = 1;
9804 if (flags
& ECF_RETURNS_TWICE
)
9805 DECL_IS_RETURNS_TWICE (decl
) = 1;
9806 if (flags
& ECF_LEAF
)
9807 DECL_ATTRIBUTES (decl
) = tree_cons (get_identifier ("leaf"),
9808 NULL
, DECL_ATTRIBUTES (decl
));
9809 if ((flags
& ECF_TM_PURE
) && flag_tm
)
9810 apply_tm_attr (decl
, get_identifier ("transaction_pure"));
9811 /* Looping const or pure is implied by noreturn.
9812 There is currently no way to declare looping const or looping pure alone. */
9813 gcc_assert (!(flags
& ECF_LOOPING_CONST_OR_PURE
)
9814 || ((flags
& ECF_NORETURN
) && (flags
& (ECF_CONST
| ECF_PURE
))));
9818 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
9821 local_define_builtin (const char *name
, tree type
, enum built_in_function code
,
9822 const char *library_name
, int ecf_flags
)
9826 decl
= add_builtin_function (name
, type
, code
, BUILT_IN_NORMAL
,
9827 library_name
, NULL_TREE
);
9828 set_call_expr_flags (decl
, ecf_flags
);
9830 set_builtin_decl (code
, decl
, true);
9833 /* Call this function after instantiating all builtins that the language
9834 front end cares about. This will build the rest of the builtins that
9835 are relied upon by the tree optimizers and the middle-end. */
9838 build_common_builtin_nodes (void)
9843 if (!builtin_decl_explicit_p (BUILT_IN_UNREACHABLE
))
9845 ftype
= build_function_type (void_type_node
, void_list_node
);
9846 local_define_builtin ("__builtin_unreachable", ftype
, BUILT_IN_UNREACHABLE
,
9847 "__builtin_unreachable",
9848 ECF_NOTHROW
| ECF_LEAF
| ECF_NORETURN
9849 | ECF_CONST
| ECF_LEAF
);
9852 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
)
9853 || !builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
9855 ftype
= build_function_type_list (ptr_type_node
,
9856 ptr_type_node
, const_ptr_type_node
,
9857 size_type_node
, NULL_TREE
);
9859 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
))
9860 local_define_builtin ("__builtin_memcpy", ftype
, BUILT_IN_MEMCPY
,
9861 "memcpy", ECF_NOTHROW
| ECF_LEAF
);
9862 if (!builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
9863 local_define_builtin ("__builtin_memmove", ftype
, BUILT_IN_MEMMOVE
,
9864 "memmove", ECF_NOTHROW
| ECF_LEAF
);
9867 if (!builtin_decl_explicit_p (BUILT_IN_MEMCMP
))
9869 ftype
= build_function_type_list (integer_type_node
, const_ptr_type_node
,
9870 const_ptr_type_node
, size_type_node
,
9872 local_define_builtin ("__builtin_memcmp", ftype
, BUILT_IN_MEMCMP
,
9873 "memcmp", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
9876 if (!builtin_decl_explicit_p (BUILT_IN_MEMSET
))
9878 ftype
= build_function_type_list (ptr_type_node
,
9879 ptr_type_node
, integer_type_node
,
9880 size_type_node
, NULL_TREE
);
9881 local_define_builtin ("__builtin_memset", ftype
, BUILT_IN_MEMSET
,
9882 "memset", ECF_NOTHROW
| ECF_LEAF
);
9885 if (!builtin_decl_explicit_p (BUILT_IN_ALLOCA
))
9887 ftype
= build_function_type_list (ptr_type_node
,
9888 size_type_node
, NULL_TREE
);
9889 local_define_builtin ("__builtin_alloca", ftype
, BUILT_IN_ALLOCA
,
9890 "alloca", ECF_MALLOC
| ECF_NOTHROW
| ECF_LEAF
);
9893 ftype
= build_function_type_list (ptr_type_node
, size_type_node
,
9894 size_type_node
, NULL_TREE
);
9895 local_define_builtin ("__builtin_alloca_with_align", ftype
,
9896 BUILT_IN_ALLOCA_WITH_ALIGN
, "alloca",
9897 ECF_MALLOC
| ECF_NOTHROW
| ECF_LEAF
);
9899 /* If we're checking the stack, `alloca' can throw. */
9900 if (flag_stack_check
)
9902 TREE_NOTHROW (builtin_decl_explicit (BUILT_IN_ALLOCA
)) = 0;
9903 TREE_NOTHROW (builtin_decl_explicit (BUILT_IN_ALLOCA_WITH_ALIGN
)) = 0;
9906 ftype
= build_function_type_list (void_type_node
,
9907 ptr_type_node
, ptr_type_node
,
9908 ptr_type_node
, NULL_TREE
);
9909 local_define_builtin ("__builtin_init_trampoline", ftype
,
9910 BUILT_IN_INIT_TRAMPOLINE
,
9911 "__builtin_init_trampoline", ECF_NOTHROW
| ECF_LEAF
);
9912 local_define_builtin ("__builtin_init_heap_trampoline", ftype
,
9913 BUILT_IN_INIT_HEAP_TRAMPOLINE
,
9914 "__builtin_init_heap_trampoline",
9915 ECF_NOTHROW
| ECF_LEAF
);
9917 ftype
= build_function_type_list (ptr_type_node
, ptr_type_node
, NULL_TREE
);
9918 local_define_builtin ("__builtin_adjust_trampoline", ftype
,
9919 BUILT_IN_ADJUST_TRAMPOLINE
,
9920 "__builtin_adjust_trampoline",
9921 ECF_CONST
| ECF_NOTHROW
);
9923 ftype
= build_function_type_list (void_type_node
,
9924 ptr_type_node
, ptr_type_node
, NULL_TREE
);
9925 local_define_builtin ("__builtin_nonlocal_goto", ftype
,
9926 BUILT_IN_NONLOCAL_GOTO
,
9927 "__builtin_nonlocal_goto",
9928 ECF_NORETURN
| ECF_NOTHROW
);
9930 ftype
= build_function_type_list (void_type_node
,
9931 ptr_type_node
, ptr_type_node
, NULL_TREE
);
9932 local_define_builtin ("__builtin_setjmp_setup", ftype
,
9933 BUILT_IN_SETJMP_SETUP
,
9934 "__builtin_setjmp_setup", ECF_NOTHROW
);
9936 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
9937 local_define_builtin ("__builtin_setjmp_receiver", ftype
,
9938 BUILT_IN_SETJMP_RECEIVER
,
9939 "__builtin_setjmp_receiver", ECF_NOTHROW
| ECF_LEAF
);
9941 ftype
= build_function_type_list (ptr_type_node
, NULL_TREE
);
9942 local_define_builtin ("__builtin_stack_save", ftype
, BUILT_IN_STACK_SAVE
,
9943 "__builtin_stack_save", ECF_NOTHROW
| ECF_LEAF
);
9945 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
9946 local_define_builtin ("__builtin_stack_restore", ftype
,
9947 BUILT_IN_STACK_RESTORE
,
9948 "__builtin_stack_restore", ECF_NOTHROW
| ECF_LEAF
);
9950 /* If there's a possibility that we might use the ARM EABI, build the
9951 alternate __cxa_end_cleanup node used to resume from C++ and Java. */
9952 if (targetm
.arm_eabi_unwinder
)
9954 ftype
= build_function_type_list (void_type_node
, NULL_TREE
);
9955 local_define_builtin ("__builtin_cxa_end_cleanup", ftype
,
9956 BUILT_IN_CXA_END_CLEANUP
,
9957 "__cxa_end_cleanup", ECF_NORETURN
| ECF_LEAF
);
9960 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
9961 local_define_builtin ("__builtin_unwind_resume", ftype
,
9962 BUILT_IN_UNWIND_RESUME
,
9963 ((targetm_common
.except_unwind_info (&global_options
)
9965 ? "_Unwind_SjLj_Resume" : "_Unwind_Resume"),
9968 if (builtin_decl_explicit (BUILT_IN_RETURN_ADDRESS
) == NULL_TREE
)
9970 ftype
= build_function_type_list (ptr_type_node
, integer_type_node
,
9972 local_define_builtin ("__builtin_return_address", ftype
,
9973 BUILT_IN_RETURN_ADDRESS
,
9974 "__builtin_return_address",
9978 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
)
9979 || !builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
9981 ftype
= build_function_type_list (void_type_node
, ptr_type_node
,
9982 ptr_type_node
, NULL_TREE
);
9983 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
))
9984 local_define_builtin ("__cyg_profile_func_enter", ftype
,
9985 BUILT_IN_PROFILE_FUNC_ENTER
,
9986 "__cyg_profile_func_enter", 0);
9987 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
9988 local_define_builtin ("__cyg_profile_func_exit", ftype
,
9989 BUILT_IN_PROFILE_FUNC_EXIT
,
9990 "__cyg_profile_func_exit", 0);
9993 /* The exception object and filter values from the runtime. The argument
9994 must be zero before exception lowering, i.e. from the front end. After
9995 exception lowering, it will be the region number for the exception
9996 landing pad. These functions are PURE instead of CONST to prevent
9997 them from being hoisted past the exception edge that will initialize
9998 its value in the landing pad. */
9999 ftype
= build_function_type_list (ptr_type_node
,
10000 integer_type_node
, NULL_TREE
);
10001 ecf_flags
= ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
;
10002 /* Only use TM_PURE if we we have TM language support. */
10003 if (builtin_decl_explicit_p (BUILT_IN_TM_LOAD_1
))
10004 ecf_flags
|= ECF_TM_PURE
;
10005 local_define_builtin ("__builtin_eh_pointer", ftype
, BUILT_IN_EH_POINTER
,
10006 "__builtin_eh_pointer", ecf_flags
);
10008 tmp
= lang_hooks
.types
.type_for_mode (targetm
.eh_return_filter_mode (), 0);
10009 ftype
= build_function_type_list (tmp
, integer_type_node
, NULL_TREE
);
10010 local_define_builtin ("__builtin_eh_filter", ftype
, BUILT_IN_EH_FILTER
,
10011 "__builtin_eh_filter", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10013 ftype
= build_function_type_list (void_type_node
,
10014 integer_type_node
, integer_type_node
,
10016 local_define_builtin ("__builtin_eh_copy_values", ftype
,
10017 BUILT_IN_EH_COPY_VALUES
,
10018 "__builtin_eh_copy_values", ECF_NOTHROW
);
10020 /* Complex multiplication and division. These are handled as builtins
10021 rather than optabs because emit_library_call_value doesn't support
10022 complex. Further, we can do slightly better with folding these
10023 beasties if the real and complex parts of the arguments are separate. */
10027 for (mode
= MIN_MODE_COMPLEX_FLOAT
; mode
<= MAX_MODE_COMPLEX_FLOAT
; ++mode
)
10029 char mode_name_buf
[4], *q
;
10031 enum built_in_function mcode
, dcode
;
10032 tree type
, inner_type
;
10033 const char *prefix
= "__";
10035 if (targetm
.libfunc_gnu_prefix
)
10038 type
= lang_hooks
.types
.type_for_mode ((enum machine_mode
) mode
, 0);
10041 inner_type
= TREE_TYPE (type
);
10043 ftype
= build_function_type_list (type
, inner_type
, inner_type
,
10044 inner_type
, inner_type
, NULL_TREE
);
10046 mcode
= ((enum built_in_function
)
10047 (BUILT_IN_COMPLEX_MUL_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
10048 dcode
= ((enum built_in_function
)
10049 (BUILT_IN_COMPLEX_DIV_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
10051 for (p
= GET_MODE_NAME (mode
), q
= mode_name_buf
; *p
; p
++, q
++)
10055 built_in_names
[mcode
] = concat (prefix
, "mul", mode_name_buf
, "3",
10057 local_define_builtin (built_in_names
[mcode
], ftype
, mcode
,
10058 built_in_names
[mcode
],
10059 ECF_CONST
| ECF_NOTHROW
| ECF_LEAF
);
10061 built_in_names
[dcode
] = concat (prefix
, "div", mode_name_buf
, "3",
10063 local_define_builtin (built_in_names
[dcode
], ftype
, dcode
,
10064 built_in_names
[dcode
],
10065 ECF_CONST
| ECF_NOTHROW
| ECF_LEAF
);
10070 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
10073 If we requested a pointer to a vector, build up the pointers that
10074 we stripped off while looking for the inner type. Similarly for
10075 return values from functions.
10077 The argument TYPE is the top of the chain, and BOTTOM is the
10078 new type which we will point to. */
10081 reconstruct_complex_type (tree type
, tree bottom
)
10085 if (TREE_CODE (type
) == POINTER_TYPE
)
10087 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10088 outer
= build_pointer_type_for_mode (inner
, TYPE_MODE (type
),
10089 TYPE_REF_CAN_ALIAS_ALL (type
));
10091 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
10093 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10094 outer
= build_reference_type_for_mode (inner
, TYPE_MODE (type
),
10095 TYPE_REF_CAN_ALIAS_ALL (type
));
10097 else if (TREE_CODE (type
) == ARRAY_TYPE
)
10099 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10100 outer
= build_array_type (inner
, TYPE_DOMAIN (type
));
10102 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10104 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10105 outer
= build_function_type (inner
, TYPE_ARG_TYPES (type
));
10107 else if (TREE_CODE (type
) == METHOD_TYPE
)
10109 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10110 /* The build_method_type_directly() routine prepends 'this' to argument list,
10111 so we must compensate by getting rid of it. */
10113 = build_method_type_directly
10114 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
))),
10116 TREE_CHAIN (TYPE_ARG_TYPES (type
)));
10118 else if (TREE_CODE (type
) == OFFSET_TYPE
)
10120 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10121 outer
= build_offset_type (TYPE_OFFSET_BASETYPE (type
), inner
);
10126 return build_type_attribute_qual_variant (outer
, TYPE_ATTRIBUTES (type
),
10127 TYPE_QUALS (type
));
10130 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
10133 build_vector_type_for_mode (tree innertype
, enum machine_mode mode
)
10137 switch (GET_MODE_CLASS (mode
))
10139 case MODE_VECTOR_INT
:
10140 case MODE_VECTOR_FLOAT
:
10141 case MODE_VECTOR_FRACT
:
10142 case MODE_VECTOR_UFRACT
:
10143 case MODE_VECTOR_ACCUM
:
10144 case MODE_VECTOR_UACCUM
:
10145 nunits
= GET_MODE_NUNITS (mode
);
10149 /* Check that there are no leftover bits. */
10150 gcc_assert (GET_MODE_BITSIZE (mode
)
10151 % TREE_INT_CST_LOW (TYPE_SIZE (innertype
)) == 0);
10153 nunits
= GET_MODE_BITSIZE (mode
)
10154 / TREE_INT_CST_LOW (TYPE_SIZE (innertype
));
10158 gcc_unreachable ();
10161 return make_vector_type (innertype
, nunits
, mode
);
10164 /* Similarly, but takes the inner type and number of units, which must be
10168 build_vector_type (tree innertype
, int nunits
)
10170 return make_vector_type (innertype
, nunits
, VOIDmode
);
10173 /* Similarly, but builds a variant type with TYPE_VECTOR_OPAQUE set. */
10176 build_opaque_vector_type (tree innertype
, int nunits
)
10178 tree t
= make_vector_type (innertype
, nunits
, VOIDmode
);
10180 /* We always build the non-opaque variant before the opaque one,
10181 so if it already exists, it is TYPE_NEXT_VARIANT of this one. */
10182 cand
= TYPE_NEXT_VARIANT (t
);
10184 && TYPE_VECTOR_OPAQUE (cand
)
10185 && check_qualified_type (cand
, t
, TYPE_QUALS (t
)))
10187 /* Othewise build a variant type and make sure to queue it after
10188 the non-opaque type. */
10189 cand
= build_distinct_type_copy (t
);
10190 TYPE_VECTOR_OPAQUE (cand
) = true;
10191 TYPE_CANONICAL (cand
) = TYPE_CANONICAL (t
);
10192 TYPE_NEXT_VARIANT (cand
) = TYPE_NEXT_VARIANT (t
);
10193 TYPE_NEXT_VARIANT (t
) = cand
;
10194 TYPE_MAIN_VARIANT (cand
) = TYPE_MAIN_VARIANT (t
);
10199 /* Given an initializer INIT, return TRUE if INIT is zero or some
10200 aggregate of zeros. Otherwise return FALSE. */
10202 initializer_zerop (const_tree init
)
10208 switch (TREE_CODE (init
))
10211 return integer_zerop (init
);
10214 /* ??? Note that this is not correct for C4X float formats. There,
10215 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
10216 negative exponent. */
10217 return real_zerop (init
)
10218 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init
));
10221 return fixed_zerop (init
);
10224 return integer_zerop (init
)
10225 || (real_zerop (init
)
10226 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init
)))
10227 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init
))));
10232 for (i
= 0; i
< VECTOR_CST_NELTS (init
); ++i
)
10233 if (!initializer_zerop (VECTOR_CST_ELT (init
, i
)))
10240 unsigned HOST_WIDE_INT idx
;
10242 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init
), idx
, elt
)
10243 if (!initializer_zerop (elt
))
10252 /* We need to loop through all elements to handle cases like
10253 "\0" and "\0foobar". */
10254 for (i
= 0; i
< TREE_STRING_LENGTH (init
); ++i
)
10255 if (TREE_STRING_POINTER (init
)[i
] != '\0')
10266 /* Check if vector VEC consists of all the equal elements and
10267 that the number of elements corresponds to the type of VEC.
10268 The function returns first element of the vector
10269 or NULL_TREE if the vector is not uniform. */
10271 uniform_vector_p (const_tree vec
)
10276 if (vec
== NULL_TREE
)
10279 gcc_assert (VECTOR_TYPE_P (TREE_TYPE (vec
)));
10281 if (TREE_CODE (vec
) == VECTOR_CST
)
10283 first
= VECTOR_CST_ELT (vec
, 0);
10284 for (i
= 1; i
< VECTOR_CST_NELTS (vec
); ++i
)
10285 if (!operand_equal_p (first
, VECTOR_CST_ELT (vec
, i
), 0))
10291 else if (TREE_CODE (vec
) == CONSTRUCTOR
)
10293 first
= error_mark_node
;
10295 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (vec
), i
, t
)
10302 if (!operand_equal_p (first
, t
, 0))
10305 if (i
!= TYPE_VECTOR_SUBPARTS (TREE_TYPE (vec
)))
10314 /* Build an empty statement at location LOC. */
10317 build_empty_stmt (location_t loc
)
10319 tree t
= build1 (NOP_EXPR
, void_type_node
, size_zero_node
);
10320 SET_EXPR_LOCATION (t
, loc
);
10325 /* Build an OpenMP clause with code CODE. LOC is the location of the
10329 build_omp_clause (location_t loc
, enum omp_clause_code code
)
10334 length
= omp_clause_num_ops
[code
];
10335 size
= (sizeof (struct tree_omp_clause
) + (length
- 1) * sizeof (tree
));
10337 record_node_allocation_statistics (OMP_CLAUSE
, size
);
10339 t
= (tree
) ggc_internal_alloc (size
);
10340 memset (t
, 0, size
);
10341 TREE_SET_CODE (t
, OMP_CLAUSE
);
10342 OMP_CLAUSE_SET_CODE (t
, code
);
10343 OMP_CLAUSE_LOCATION (t
) = loc
;
10348 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
10349 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
10350 Except for the CODE and operand count field, other storage for the
10351 object is initialized to zeros. */
10354 build_vl_exp_stat (enum tree_code code
, int len MEM_STAT_DECL
)
10357 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_exp
);
10359 gcc_assert (TREE_CODE_CLASS (code
) == tcc_vl_exp
);
10360 gcc_assert (len
>= 1);
10362 record_node_allocation_statistics (code
, length
);
10364 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
10366 TREE_SET_CODE (t
, code
);
10368 /* Can't use TREE_OPERAND to store the length because if checking is
10369 enabled, it will try to check the length before we store it. :-P */
10370 t
->exp
.operands
[0] = build_int_cst (sizetype
, len
);
10375 /* Helper function for build_call_* functions; build a CALL_EXPR with
10376 indicated RETURN_TYPE, FN, and NARGS, but do not initialize any of
10377 the argument slots. */
10380 build_call_1 (tree return_type
, tree fn
, int nargs
)
10384 t
= build_vl_exp (CALL_EXPR
, nargs
+ 3);
10385 TREE_TYPE (t
) = return_type
;
10386 CALL_EXPR_FN (t
) = fn
;
10387 CALL_EXPR_STATIC_CHAIN (t
) = NULL
;
10392 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10393 FN and a null static chain slot. NARGS is the number of call arguments
10394 which are specified as "..." arguments. */
10397 build_call_nary (tree return_type
, tree fn
, int nargs
, ...)
10401 va_start (args
, nargs
);
10402 ret
= build_call_valist (return_type
, fn
, nargs
, args
);
10407 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10408 FN and a null static chain slot. NARGS is the number of call arguments
10409 which are specified as a va_list ARGS. */
10412 build_call_valist (tree return_type
, tree fn
, int nargs
, va_list args
)
10417 t
= build_call_1 (return_type
, fn
, nargs
);
10418 for (i
= 0; i
< nargs
; i
++)
10419 CALL_EXPR_ARG (t
, i
) = va_arg (args
, tree
);
10420 process_call_operands (t
);
10424 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10425 FN and a null static chain slot. NARGS is the number of call arguments
10426 which are specified as a tree array ARGS. */
10429 build_call_array_loc (location_t loc
, tree return_type
, tree fn
,
10430 int nargs
, const tree
*args
)
10435 t
= build_call_1 (return_type
, fn
, nargs
);
10436 for (i
= 0; i
< nargs
; i
++)
10437 CALL_EXPR_ARG (t
, i
) = args
[i
];
10438 process_call_operands (t
);
10439 SET_EXPR_LOCATION (t
, loc
);
10443 /* Like build_call_array, but takes a vec. */
10446 build_call_vec (tree return_type
, tree fn
, vec
<tree
, va_gc
> *args
)
10451 ret
= build_call_1 (return_type
, fn
, vec_safe_length (args
));
10452 FOR_EACH_VEC_SAFE_ELT (args
, ix
, t
)
10453 CALL_EXPR_ARG (ret
, ix
) = t
;
10454 process_call_operands (ret
);
10458 /* Return true if T (assumed to be a DECL) must be assigned a memory
10462 needs_to_live_in_memory (const_tree t
)
10464 return (TREE_ADDRESSABLE (t
)
10465 || is_global_var (t
)
10466 || (TREE_CODE (t
) == RESULT_DECL
10467 && !DECL_BY_REFERENCE (t
)
10468 && aggregate_value_p (t
, current_function_decl
)));
10471 /* Return value of a constant X and sign-extend it. */
10474 int_cst_value (const_tree x
)
10476 unsigned bits
= TYPE_PRECISION (TREE_TYPE (x
));
10477 unsigned HOST_WIDE_INT val
= TREE_INT_CST_LOW (x
);
10479 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
10480 gcc_assert (cst_and_fits_in_hwi (x
));
10482 if (bits
< HOST_BITS_PER_WIDE_INT
)
10484 bool negative
= ((val
>> (bits
- 1)) & 1) != 0;
10486 val
|= (~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1;
10488 val
&= ~((~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1);
10494 /* If TYPE is an integral or pointer type, return an integer type with
10495 the same precision which is unsigned iff UNSIGNEDP is true, or itself
10496 if TYPE is already an integer type of signedness UNSIGNEDP. */
10499 signed_or_unsigned_type_for (int unsignedp
, tree type
)
10501 if (TREE_CODE (type
) == INTEGER_TYPE
&& TYPE_UNSIGNED (type
) == unsignedp
)
10504 if (TREE_CODE (type
) == VECTOR_TYPE
)
10506 tree inner
= TREE_TYPE (type
);
10507 tree inner2
= signed_or_unsigned_type_for (unsignedp
, inner
);
10510 if (inner
== inner2
)
10512 return build_vector_type (inner2
, TYPE_VECTOR_SUBPARTS (type
));
10515 if (!INTEGRAL_TYPE_P (type
)
10516 && !POINTER_TYPE_P (type
)
10517 && TREE_CODE (type
) != OFFSET_TYPE
)
10520 return build_nonstandard_integer_type (TYPE_PRECISION (type
), unsignedp
);
10523 /* If TYPE is an integral or pointer type, return an integer type with
10524 the same precision which is unsigned, or itself if TYPE is already an
10525 unsigned integer type. */
10528 unsigned_type_for (tree type
)
10530 return signed_or_unsigned_type_for (1, type
);
10533 /* If TYPE is an integral or pointer type, return an integer type with
10534 the same precision which is signed, or itself if TYPE is already a
10535 signed integer type. */
10538 signed_type_for (tree type
)
10540 return signed_or_unsigned_type_for (0, type
);
10543 /* If TYPE is a vector type, return a signed integer vector type with the
10544 same width and number of subparts. Otherwise return boolean_type_node. */
10547 truth_type_for (tree type
)
10549 if (TREE_CODE (type
) == VECTOR_TYPE
)
10551 tree elem
= lang_hooks
.types
.type_for_size
10552 (GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (type
))), 0);
10553 return build_opaque_vector_type (elem
, TYPE_VECTOR_SUBPARTS (type
));
10556 return boolean_type_node
;
10559 /* Returns the largest value obtainable by casting something in INNER type to
10563 upper_bound_in_type (tree outer
, tree inner
)
10565 unsigned int det
= 0;
10566 unsigned oprec
= TYPE_PRECISION (outer
);
10567 unsigned iprec
= TYPE_PRECISION (inner
);
10570 /* Compute a unique number for every combination. */
10571 det
|= (oprec
> iprec
) ? 4 : 0;
10572 det
|= TYPE_UNSIGNED (outer
) ? 2 : 0;
10573 det
|= TYPE_UNSIGNED (inner
) ? 1 : 0;
10575 /* Determine the exponent to use. */
10580 /* oprec <= iprec, outer: signed, inner: don't care. */
10585 /* oprec <= iprec, outer: unsigned, inner: don't care. */
10589 /* oprec > iprec, outer: signed, inner: signed. */
10593 /* oprec > iprec, outer: signed, inner: unsigned. */
10597 /* oprec > iprec, outer: unsigned, inner: signed. */
10601 /* oprec > iprec, outer: unsigned, inner: unsigned. */
10605 gcc_unreachable ();
10608 return wide_int_to_tree (outer
,
10609 wi::mask (prec
, false, TYPE_PRECISION (outer
)));
10612 /* Returns the smallest value obtainable by casting something in INNER type to
10616 lower_bound_in_type (tree outer
, tree inner
)
10618 unsigned oprec
= TYPE_PRECISION (outer
);
10619 unsigned iprec
= TYPE_PRECISION (inner
);
10621 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
10623 if (TYPE_UNSIGNED (outer
)
10624 /* If we are widening something of an unsigned type, OUTER type
10625 contains all values of INNER type. In particular, both INNER
10626 and OUTER types have zero in common. */
10627 || (oprec
> iprec
&& TYPE_UNSIGNED (inner
)))
10628 return build_int_cst (outer
, 0);
10631 /* If we are widening a signed type to another signed type, we
10632 want to obtain -2^^(iprec-1). If we are keeping the
10633 precision or narrowing to a signed type, we want to obtain
10635 unsigned prec
= oprec
> iprec
? iprec
: oprec
;
10636 return wide_int_to_tree (outer
,
10637 wi::mask (prec
- 1, true,
10638 TYPE_PRECISION (outer
)));
10642 /* Return nonzero if two operands that are suitable for PHI nodes are
10643 necessarily equal. Specifically, both ARG0 and ARG1 must be either
10644 SSA_NAME or invariant. Note that this is strictly an optimization.
10645 That is, callers of this function can directly call operand_equal_p
10646 and get the same result, only slower. */
10649 operand_equal_for_phi_arg_p (const_tree arg0
, const_tree arg1
)
10653 if (TREE_CODE (arg0
) == SSA_NAME
|| TREE_CODE (arg1
) == SSA_NAME
)
10655 return operand_equal_p (arg0
, arg1
, 0);
10658 /* Returns number of zeros at the end of binary representation of X. */
10661 num_ending_zeros (const_tree x
)
10663 return build_int_cst (TREE_TYPE (x
), wi::ctz (x
));
10667 #define WALK_SUBTREE(NODE) \
10670 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
10676 /* This is a subroutine of walk_tree that walks field of TYPE that are to
10677 be walked whenever a type is seen in the tree. Rest of operands and return
10678 value are as for walk_tree. */
10681 walk_type_fields (tree type
, walk_tree_fn func
, void *data
,
10682 struct pointer_set_t
*pset
, walk_tree_lh lh
)
10684 tree result
= NULL_TREE
;
10686 switch (TREE_CODE (type
))
10689 case REFERENCE_TYPE
:
10691 /* We have to worry about mutually recursive pointers. These can't
10692 be written in C. They can in Ada. It's pathological, but
10693 there's an ACATS test (c38102a) that checks it. Deal with this
10694 by checking if we're pointing to another pointer, that one
10695 points to another pointer, that one does too, and we have no htab.
10696 If so, get a hash table. We check three levels deep to avoid
10697 the cost of the hash table if we don't need one. */
10698 if (POINTER_TYPE_P (TREE_TYPE (type
))
10699 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type
)))
10700 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type
))))
10703 result
= walk_tree_without_duplicates (&TREE_TYPE (type
),
10711 /* ... fall through ... */
10714 WALK_SUBTREE (TREE_TYPE (type
));
10718 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type
));
10720 /* Fall through. */
10722 case FUNCTION_TYPE
:
10723 WALK_SUBTREE (TREE_TYPE (type
));
10727 /* We never want to walk into default arguments. */
10728 for (arg
= TYPE_ARG_TYPES (type
); arg
; arg
= TREE_CHAIN (arg
))
10729 WALK_SUBTREE (TREE_VALUE (arg
));
10734 /* Don't follow this nodes's type if a pointer for fear that
10735 we'll have infinite recursion. If we have a PSET, then we
10738 || (!POINTER_TYPE_P (TREE_TYPE (type
))
10739 && TREE_CODE (TREE_TYPE (type
)) != OFFSET_TYPE
))
10740 WALK_SUBTREE (TREE_TYPE (type
));
10741 WALK_SUBTREE (TYPE_DOMAIN (type
));
10745 WALK_SUBTREE (TREE_TYPE (type
));
10746 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type
));
10756 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
10757 called with the DATA and the address of each sub-tree. If FUNC returns a
10758 non-NULL value, the traversal is stopped, and the value returned by FUNC
10759 is returned. If PSET is non-NULL it is used to record the nodes visited,
10760 and to avoid visiting a node more than once. */
10763 walk_tree_1 (tree
*tp
, walk_tree_fn func
, void *data
,
10764 struct pointer_set_t
*pset
, walk_tree_lh lh
)
10766 enum tree_code code
;
10770 #define WALK_SUBTREE_TAIL(NODE) \
10774 goto tail_recurse; \
10779 /* Skip empty subtrees. */
10783 /* Don't walk the same tree twice, if the user has requested
10784 that we avoid doing so. */
10785 if (pset
&& pointer_set_insert (pset
, *tp
))
10788 /* Call the function. */
10790 result
= (*func
) (tp
, &walk_subtrees
, data
);
10792 /* If we found something, return it. */
10796 code
= TREE_CODE (*tp
);
10798 /* Even if we didn't, FUNC may have decided that there was nothing
10799 interesting below this point in the tree. */
10800 if (!walk_subtrees
)
10802 /* But we still need to check our siblings. */
10803 if (code
== TREE_LIST
)
10804 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
10805 else if (code
== OMP_CLAUSE
)
10806 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10813 result
= (*lh
) (tp
, &walk_subtrees
, func
, data
, pset
);
10814 if (result
|| !walk_subtrees
)
10821 case IDENTIFIER_NODE
:
10828 case PLACEHOLDER_EXPR
:
10832 /* None of these have subtrees other than those already walked
10837 WALK_SUBTREE (TREE_VALUE (*tp
));
10838 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
10843 int len
= TREE_VEC_LENGTH (*tp
);
10848 /* Walk all elements but the first. */
10850 WALK_SUBTREE (TREE_VEC_ELT (*tp
, len
));
10852 /* Now walk the first one as a tail call. */
10853 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp
, 0));
10857 WALK_SUBTREE (TREE_REALPART (*tp
));
10858 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp
));
10862 unsigned HOST_WIDE_INT idx
;
10863 constructor_elt
*ce
;
10865 for (idx
= 0; vec_safe_iterate (CONSTRUCTOR_ELTS (*tp
), idx
, &ce
);
10867 WALK_SUBTREE (ce
->value
);
10872 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, 0));
10877 for (decl
= BIND_EXPR_VARS (*tp
); decl
; decl
= DECL_CHAIN (decl
))
10879 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
10880 into declarations that are just mentioned, rather than
10881 declared; they don't really belong to this part of the tree.
10882 And, we can see cycles: the initializer for a declaration
10883 can refer to the declaration itself. */
10884 WALK_SUBTREE (DECL_INITIAL (decl
));
10885 WALK_SUBTREE (DECL_SIZE (decl
));
10886 WALK_SUBTREE (DECL_SIZE_UNIT (decl
));
10888 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp
));
10891 case STATEMENT_LIST
:
10893 tree_stmt_iterator i
;
10894 for (i
= tsi_start (*tp
); !tsi_end_p (i
); tsi_next (&i
))
10895 WALK_SUBTREE (*tsi_stmt_ptr (i
));
10900 switch (OMP_CLAUSE_CODE (*tp
))
10902 case OMP_CLAUSE_PRIVATE
:
10903 case OMP_CLAUSE_SHARED
:
10904 case OMP_CLAUSE_FIRSTPRIVATE
:
10905 case OMP_CLAUSE_COPYIN
:
10906 case OMP_CLAUSE_COPYPRIVATE
:
10907 case OMP_CLAUSE_FINAL
:
10908 case OMP_CLAUSE_IF
:
10909 case OMP_CLAUSE_NUM_THREADS
:
10910 case OMP_CLAUSE_SCHEDULE
:
10911 case OMP_CLAUSE_UNIFORM
:
10912 case OMP_CLAUSE_DEPEND
:
10913 case OMP_CLAUSE_NUM_TEAMS
:
10914 case OMP_CLAUSE_THREAD_LIMIT
:
10915 case OMP_CLAUSE_DEVICE
:
10916 case OMP_CLAUSE_DIST_SCHEDULE
:
10917 case OMP_CLAUSE_SAFELEN
:
10918 case OMP_CLAUSE_SIMDLEN
:
10919 case OMP_CLAUSE__LOOPTEMP_
:
10920 case OMP_CLAUSE__SIMDUID_
:
10921 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 0));
10924 case OMP_CLAUSE_NOWAIT
:
10925 case OMP_CLAUSE_ORDERED
:
10926 case OMP_CLAUSE_DEFAULT
:
10927 case OMP_CLAUSE_UNTIED
:
10928 case OMP_CLAUSE_MERGEABLE
:
10929 case OMP_CLAUSE_PROC_BIND
:
10930 case OMP_CLAUSE_INBRANCH
:
10931 case OMP_CLAUSE_NOTINBRANCH
:
10932 case OMP_CLAUSE_FOR
:
10933 case OMP_CLAUSE_PARALLEL
:
10934 case OMP_CLAUSE_SECTIONS
:
10935 case OMP_CLAUSE_TASKGROUP
:
10936 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10938 case OMP_CLAUSE_LASTPRIVATE
:
10939 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
10940 WALK_SUBTREE (OMP_CLAUSE_LASTPRIVATE_STMT (*tp
));
10941 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10943 case OMP_CLAUSE_COLLAPSE
:
10946 for (i
= 0; i
< 3; i
++)
10947 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
10948 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10951 case OMP_CLAUSE_LINEAR
:
10952 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
10953 WALK_SUBTREE (OMP_CLAUSE_LINEAR_STEP (*tp
));
10954 WALK_SUBTREE (OMP_CLAUSE_LINEAR_STMT (*tp
));
10955 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10957 case OMP_CLAUSE_ALIGNED
:
10958 case OMP_CLAUSE_FROM
:
10959 case OMP_CLAUSE_TO
:
10960 case OMP_CLAUSE_MAP
:
10961 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
10962 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 1));
10963 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10965 case OMP_CLAUSE_REDUCTION
:
10968 for (i
= 0; i
< 4; i
++)
10969 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
10970 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10974 gcc_unreachable ();
10982 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
10983 But, we only want to walk once. */
10984 len
= (TREE_OPERAND (*tp
, 3) == TREE_OPERAND (*tp
, 1)) ? 2 : 3;
10985 for (i
= 0; i
< len
; ++i
)
10986 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
10987 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
));
10991 /* If this is a TYPE_DECL, walk into the fields of the type that it's
10992 defining. We only want to walk into these fields of a type in this
10993 case and not in the general case of a mere reference to the type.
10995 The criterion is as follows: if the field can be an expression, it
10996 must be walked only here. This should be in keeping with the fields
10997 that are directly gimplified in gimplify_type_sizes in order for the
10998 mark/copy-if-shared/unmark machinery of the gimplifier to work with
10999 variable-sized types.
11001 Note that DECLs get walked as part of processing the BIND_EXPR. */
11002 if (TREE_CODE (DECL_EXPR_DECL (*tp
)) == TYPE_DECL
)
11004 tree
*type_p
= &TREE_TYPE (DECL_EXPR_DECL (*tp
));
11005 if (TREE_CODE (*type_p
) == ERROR_MARK
)
11008 /* Call the function for the type. See if it returns anything or
11009 doesn't want us to continue. If we are to continue, walk both
11010 the normal fields and those for the declaration case. */
11011 result
= (*func
) (type_p
, &walk_subtrees
, data
);
11012 if (result
|| !walk_subtrees
)
11015 /* But do not walk a pointed-to type since it may itself need to
11016 be walked in the declaration case if it isn't anonymous. */
11017 if (!POINTER_TYPE_P (*type_p
))
11019 result
= walk_type_fields (*type_p
, func
, data
, pset
, lh
);
11024 /* If this is a record type, also walk the fields. */
11025 if (RECORD_OR_UNION_TYPE_P (*type_p
))
11029 for (field
= TYPE_FIELDS (*type_p
); field
;
11030 field
= DECL_CHAIN (field
))
11032 /* We'd like to look at the type of the field, but we can
11033 easily get infinite recursion. So assume it's pointed
11034 to elsewhere in the tree. Also, ignore things that
11036 if (TREE_CODE (field
) != FIELD_DECL
)
11039 WALK_SUBTREE (DECL_FIELD_OFFSET (field
));
11040 WALK_SUBTREE (DECL_SIZE (field
));
11041 WALK_SUBTREE (DECL_SIZE_UNIT (field
));
11042 if (TREE_CODE (*type_p
) == QUAL_UNION_TYPE
)
11043 WALK_SUBTREE (DECL_QUALIFIER (field
));
11047 /* Same for scalar types. */
11048 else if (TREE_CODE (*type_p
) == BOOLEAN_TYPE
11049 || TREE_CODE (*type_p
) == ENUMERAL_TYPE
11050 || TREE_CODE (*type_p
) == INTEGER_TYPE
11051 || TREE_CODE (*type_p
) == FIXED_POINT_TYPE
11052 || TREE_CODE (*type_p
) == REAL_TYPE
)
11054 WALK_SUBTREE (TYPE_MIN_VALUE (*type_p
));
11055 WALK_SUBTREE (TYPE_MAX_VALUE (*type_p
));
11058 WALK_SUBTREE (TYPE_SIZE (*type_p
));
11059 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p
));
11064 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code
)))
11068 /* Walk over all the sub-trees of this operand. */
11069 len
= TREE_OPERAND_LENGTH (*tp
);
11071 /* Go through the subtrees. We need to do this in forward order so
11072 that the scope of a FOR_EXPR is handled properly. */
11075 for (i
= 0; i
< len
- 1; ++i
)
11076 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
11077 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
- 1));
11080 /* If this is a type, walk the needed fields in the type. */
11081 else if (TYPE_P (*tp
))
11082 return walk_type_fields (*tp
, func
, data
, pset
, lh
);
11086 /* We didn't find what we were looking for. */
11089 #undef WALK_SUBTREE_TAIL
11091 #undef WALK_SUBTREE
11093 /* Like walk_tree, but does not walk duplicate nodes more than once. */
11096 walk_tree_without_duplicates_1 (tree
*tp
, walk_tree_fn func
, void *data
,
11100 struct pointer_set_t
*pset
;
11102 pset
= pointer_set_create ();
11103 result
= walk_tree_1 (tp
, func
, data
, pset
, lh
);
11104 pointer_set_destroy (pset
);
11110 tree_block (tree t
)
11112 const enum tree_code_class c
= TREE_CODE_CLASS (TREE_CODE (t
));
11114 if (IS_EXPR_CODE_CLASS (c
))
11115 return LOCATION_BLOCK (t
->exp
.locus
);
11116 gcc_unreachable ();
11121 tree_set_block (tree t
, tree b
)
11123 const enum tree_code_class c
= TREE_CODE_CLASS (TREE_CODE (t
));
11125 if (IS_EXPR_CODE_CLASS (c
))
11128 t
->exp
.locus
= COMBINE_LOCATION_DATA (line_table
, t
->exp
.locus
, b
);
11130 t
->exp
.locus
= LOCATION_LOCUS (t
->exp
.locus
);
11133 gcc_unreachable ();
11136 /* Create a nameless artificial label and put it in the current
11137 function context. The label has a location of LOC. Returns the
11138 newly created label. */
11141 create_artificial_label (location_t loc
)
11143 tree lab
= build_decl (loc
,
11144 LABEL_DECL
, NULL_TREE
, void_type_node
);
11146 DECL_ARTIFICIAL (lab
) = 1;
11147 DECL_IGNORED_P (lab
) = 1;
11148 DECL_CONTEXT (lab
) = current_function_decl
;
11152 /* Given a tree, try to return a useful variable name that we can use
11153 to prefix a temporary that is being assigned the value of the tree.
11154 I.E. given <temp> = &A, return A. */
11159 tree stripped_decl
;
11162 STRIP_NOPS (stripped_decl
);
11163 if (DECL_P (stripped_decl
) && DECL_NAME (stripped_decl
))
11164 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl
));
11165 else if (TREE_CODE (stripped_decl
) == SSA_NAME
)
11167 tree name
= SSA_NAME_IDENTIFIER (stripped_decl
);
11170 return IDENTIFIER_POINTER (name
);
11174 switch (TREE_CODE (stripped_decl
))
11177 return get_name (TREE_OPERAND (stripped_decl
, 0));
11184 /* Return true if TYPE has a variable argument list. */
11187 stdarg_p (const_tree fntype
)
11189 function_args_iterator args_iter
;
11190 tree n
= NULL_TREE
, t
;
11195 FOREACH_FUNCTION_ARGS (fntype
, t
, args_iter
)
11200 return n
!= NULL_TREE
&& n
!= void_type_node
;
11203 /* Return true if TYPE has a prototype. */
11206 prototype_p (tree fntype
)
11210 gcc_assert (fntype
!= NULL_TREE
);
11212 t
= TYPE_ARG_TYPES (fntype
);
11213 return (t
!= NULL_TREE
);
11216 /* If BLOCK is inlined from an __attribute__((__artificial__))
11217 routine, return pointer to location from where it has been
11220 block_nonartificial_location (tree block
)
11222 location_t
*ret
= NULL
;
11224 while (block
&& TREE_CODE (block
) == BLOCK
11225 && BLOCK_ABSTRACT_ORIGIN (block
))
11227 tree ao
= BLOCK_ABSTRACT_ORIGIN (block
);
11229 while (TREE_CODE (ao
) == BLOCK
11230 && BLOCK_ABSTRACT_ORIGIN (ao
)
11231 && BLOCK_ABSTRACT_ORIGIN (ao
) != ao
)
11232 ao
= BLOCK_ABSTRACT_ORIGIN (ao
);
11234 if (TREE_CODE (ao
) == FUNCTION_DECL
)
11236 /* If AO is an artificial inline, point RET to the
11237 call site locus at which it has been inlined and continue
11238 the loop, in case AO's caller is also an artificial
11240 if (DECL_DECLARED_INLINE_P (ao
)
11241 && lookup_attribute ("artificial", DECL_ATTRIBUTES (ao
)))
11242 ret
= &BLOCK_SOURCE_LOCATION (block
);
11246 else if (TREE_CODE (ao
) != BLOCK
)
11249 block
= BLOCK_SUPERCONTEXT (block
);
11255 /* If EXP is inlined from an __attribute__((__artificial__))
11256 function, return the location of the original call expression. */
11259 tree_nonartificial_location (tree exp
)
11261 location_t
*loc
= block_nonartificial_location (TREE_BLOCK (exp
));
11266 return EXPR_LOCATION (exp
);
11270 /* These are the hash table functions for the hash table of OPTIMIZATION_NODEq
11273 /* Return the hash code code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
11276 cl_option_hash_hash (const void *x
)
11278 const_tree
const t
= (const_tree
) x
;
11282 hashval_t hash
= 0;
11284 if (TREE_CODE (t
) == OPTIMIZATION_NODE
)
11286 p
= (const char *)TREE_OPTIMIZATION (t
);
11287 len
= sizeof (struct cl_optimization
);
11290 else if (TREE_CODE (t
) == TARGET_OPTION_NODE
)
11292 p
= (const char *)TREE_TARGET_OPTION (t
);
11293 len
= sizeof (struct cl_target_option
);
11297 gcc_unreachable ();
11299 /* assume most opt flags are just 0/1, some are 2-3, and a few might be
11301 for (i
= 0; i
< len
; i
++)
11303 hash
= (hash
<< 4) ^ ((i
<< 2) | p
[i
]);
11308 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
11309 TARGET_OPTION tree node) is the same as that given by *Y, which is the
11313 cl_option_hash_eq (const void *x
, const void *y
)
11315 const_tree
const xt
= (const_tree
) x
;
11316 const_tree
const yt
= (const_tree
) y
;
11321 if (TREE_CODE (xt
) != TREE_CODE (yt
))
11324 if (TREE_CODE (xt
) == OPTIMIZATION_NODE
)
11326 xp
= (const char *)TREE_OPTIMIZATION (xt
);
11327 yp
= (const char *)TREE_OPTIMIZATION (yt
);
11328 len
= sizeof (struct cl_optimization
);
11331 else if (TREE_CODE (xt
) == TARGET_OPTION_NODE
)
11333 xp
= (const char *)TREE_TARGET_OPTION (xt
);
11334 yp
= (const char *)TREE_TARGET_OPTION (yt
);
11335 len
= sizeof (struct cl_target_option
);
11339 gcc_unreachable ();
11341 return (memcmp (xp
, yp
, len
) == 0);
11344 /* Build an OPTIMIZATION_NODE based on the options in OPTS. */
11347 build_optimization_node (struct gcc_options
*opts
)
11352 /* Use the cache of optimization nodes. */
11354 cl_optimization_save (TREE_OPTIMIZATION (cl_optimization_node
),
11357 slot
= htab_find_slot (cl_option_hash_table
, cl_optimization_node
, INSERT
);
11361 /* Insert this one into the hash table. */
11362 t
= cl_optimization_node
;
11365 /* Make a new node for next time round. */
11366 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
11372 /* Build a TARGET_OPTION_NODE based on the options in OPTS. */
11375 build_target_option_node (struct gcc_options
*opts
)
11380 /* Use the cache of optimization nodes. */
11382 cl_target_option_save (TREE_TARGET_OPTION (cl_target_option_node
),
11385 slot
= htab_find_slot (cl_option_hash_table
, cl_target_option_node
, INSERT
);
11389 /* Insert this one into the hash table. */
11390 t
= cl_target_option_node
;
11393 /* Make a new node for next time round. */
11394 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
11400 /* Reset TREE_TARGET_GLOBALS cache for TARGET_OPTION_NODE.
11401 Called through htab_traverse. */
11404 prepare_target_option_node_for_pch (void **slot
, void *)
11406 tree node
= (tree
) *slot
;
11407 if (TREE_CODE (node
) == TARGET_OPTION_NODE
)
11408 TREE_TARGET_GLOBALS (node
) = NULL
;
11412 /* Clear TREE_TARGET_GLOBALS of all TARGET_OPTION_NODE trees,
11413 so that they aren't saved during PCH writing. */
11416 prepare_target_option_nodes_for_pch (void)
11418 htab_traverse (cl_option_hash_table
, prepare_target_option_node_for_pch
,
11422 /* Determine the "ultimate origin" of a block. The block may be an inlined
11423 instance of an inlined instance of a block which is local to an inline
11424 function, so we have to trace all of the way back through the origin chain
11425 to find out what sort of node actually served as the original seed for the
11429 block_ultimate_origin (const_tree block
)
11431 tree immediate_origin
= BLOCK_ABSTRACT_ORIGIN (block
);
11433 /* output_inline_function sets BLOCK_ABSTRACT_ORIGIN for all the
11434 nodes in the function to point to themselves; ignore that if
11435 we're trying to output the abstract instance of this function. */
11436 if (BLOCK_ABSTRACT (block
) && immediate_origin
== block
)
11439 if (immediate_origin
== NULL_TREE
)
11444 tree lookahead
= immediate_origin
;
11448 ret_val
= lookahead
;
11449 lookahead
= (TREE_CODE (ret_val
) == BLOCK
11450 ? BLOCK_ABSTRACT_ORIGIN (ret_val
) : NULL
);
11452 while (lookahead
!= NULL
&& lookahead
!= ret_val
);
11454 /* The block's abstract origin chain may not be the *ultimate* origin of
11455 the block. It could lead to a DECL that has an abstract origin set.
11456 If so, we want that DECL's abstract origin (which is what DECL_ORIGIN
11457 will give us if it has one). Note that DECL's abstract origins are
11458 supposed to be the most distant ancestor (or so decl_ultimate_origin
11459 claims), so we don't need to loop following the DECL origins. */
11460 if (DECL_P (ret_val
))
11461 return DECL_ORIGIN (ret_val
);
11467 /* Return true iff conversion in EXP generates no instruction. Mark
11468 it inline so that we fully inline into the stripping functions even
11469 though we have two uses of this function. */
11472 tree_nop_conversion (const_tree exp
)
11474 tree outer_type
, inner_type
;
11476 if (!CONVERT_EXPR_P (exp
)
11477 && TREE_CODE (exp
) != NON_LVALUE_EXPR
)
11479 if (TREE_OPERAND (exp
, 0) == error_mark_node
)
11482 outer_type
= TREE_TYPE (exp
);
11483 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
11488 /* Use precision rather then machine mode when we can, which gives
11489 the correct answer even for submode (bit-field) types. */
11490 if ((INTEGRAL_TYPE_P (outer_type
)
11491 || POINTER_TYPE_P (outer_type
)
11492 || TREE_CODE (outer_type
) == OFFSET_TYPE
)
11493 && (INTEGRAL_TYPE_P (inner_type
)
11494 || POINTER_TYPE_P (inner_type
)
11495 || TREE_CODE (inner_type
) == OFFSET_TYPE
))
11496 return TYPE_PRECISION (outer_type
) == TYPE_PRECISION (inner_type
);
11498 /* Otherwise fall back on comparing machine modes (e.g. for
11499 aggregate types, floats). */
11500 return TYPE_MODE (outer_type
) == TYPE_MODE (inner_type
);
11503 /* Return true iff conversion in EXP generates no instruction. Don't
11504 consider conversions changing the signedness. */
11507 tree_sign_nop_conversion (const_tree exp
)
11509 tree outer_type
, inner_type
;
11511 if (!tree_nop_conversion (exp
))
11514 outer_type
= TREE_TYPE (exp
);
11515 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
11517 return (TYPE_UNSIGNED (outer_type
) == TYPE_UNSIGNED (inner_type
)
11518 && POINTER_TYPE_P (outer_type
) == POINTER_TYPE_P (inner_type
));
11521 /* Strip conversions from EXP according to tree_nop_conversion and
11522 return the resulting expression. */
11525 tree_strip_nop_conversions (tree exp
)
11527 while (tree_nop_conversion (exp
))
11528 exp
= TREE_OPERAND (exp
, 0);
11532 /* Strip conversions from EXP according to tree_sign_nop_conversion
11533 and return the resulting expression. */
11536 tree_strip_sign_nop_conversions (tree exp
)
11538 while (tree_sign_nop_conversion (exp
))
11539 exp
= TREE_OPERAND (exp
, 0);
11543 /* Avoid any floating point extensions from EXP. */
11545 strip_float_extensions (tree exp
)
11547 tree sub
, expt
, subt
;
11549 /* For floating point constant look up the narrowest type that can hold
11550 it properly and handle it like (type)(narrowest_type)constant.
11551 This way we can optimize for instance a=a*2.0 where "a" is float
11552 but 2.0 is double constant. */
11553 if (TREE_CODE (exp
) == REAL_CST
&& !DECIMAL_FLOAT_TYPE_P (TREE_TYPE (exp
)))
11555 REAL_VALUE_TYPE orig
;
11558 orig
= TREE_REAL_CST (exp
);
11559 if (TYPE_PRECISION (TREE_TYPE (exp
)) > TYPE_PRECISION (float_type_node
)
11560 && exact_real_truncate (TYPE_MODE (float_type_node
), &orig
))
11561 type
= float_type_node
;
11562 else if (TYPE_PRECISION (TREE_TYPE (exp
))
11563 > TYPE_PRECISION (double_type_node
)
11564 && exact_real_truncate (TYPE_MODE (double_type_node
), &orig
))
11565 type
= double_type_node
;
11567 return build_real (type
, real_value_truncate (TYPE_MODE (type
), orig
));
11570 if (!CONVERT_EXPR_P (exp
))
11573 sub
= TREE_OPERAND (exp
, 0);
11574 subt
= TREE_TYPE (sub
);
11575 expt
= TREE_TYPE (exp
);
11577 if (!FLOAT_TYPE_P (subt
))
11580 if (DECIMAL_FLOAT_TYPE_P (expt
) != DECIMAL_FLOAT_TYPE_P (subt
))
11583 if (TYPE_PRECISION (subt
) > TYPE_PRECISION (expt
))
11586 return strip_float_extensions (sub
);
11589 /* Strip out all handled components that produce invariant
11593 strip_invariant_refs (const_tree op
)
11595 while (handled_component_p (op
))
11597 switch (TREE_CODE (op
))
11600 case ARRAY_RANGE_REF
:
11601 if (!is_gimple_constant (TREE_OPERAND (op
, 1))
11602 || TREE_OPERAND (op
, 2) != NULL_TREE
11603 || TREE_OPERAND (op
, 3) != NULL_TREE
)
11607 case COMPONENT_REF
:
11608 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
11614 op
= TREE_OPERAND (op
, 0);
11620 static GTY(()) tree gcc_eh_personality_decl
;
11622 /* Return the GCC personality function decl. */
11625 lhd_gcc_personality (void)
11627 if (!gcc_eh_personality_decl
)
11628 gcc_eh_personality_decl
= build_personality_function ("gcc");
11629 return gcc_eh_personality_decl
;
11632 /* For languages with One Definition Rule, work out if
11633 trees are actually the same even if the tree representation
11634 differs. This handles only decls appearing in TYPE_NAME
11635 and TYPE_CONTEXT. That is NAMESPACE_DECL, TYPE_DECL,
11636 RECORD_TYPE and IDENTIFIER_NODE. */
11639 same_for_odr (tree t1
, tree t2
)
11645 /* C and C++ FEs differ by using IDENTIFIER_NODE and TYPE_DECL. */
11646 if (TREE_CODE (t1
) == IDENTIFIER_NODE
11647 && TREE_CODE (t2
) == TYPE_DECL
11648 && DECL_FILE_SCOPE_P (t1
))
11650 t2
= DECL_NAME (t2
);
11651 gcc_assert (TREE_CODE (t2
) == IDENTIFIER_NODE
);
11653 if (TREE_CODE (t2
) == IDENTIFIER_NODE
11654 && TREE_CODE (t1
) == TYPE_DECL
11655 && DECL_FILE_SCOPE_P (t2
))
11657 t1
= DECL_NAME (t1
);
11658 gcc_assert (TREE_CODE (t1
) == IDENTIFIER_NODE
);
11660 if (TREE_CODE (t1
) != TREE_CODE (t2
))
11663 return types_same_for_odr (t1
, t2
);
11665 return decls_same_for_odr (t1
, t2
);
11669 /* For languages with One Definition Rule, work out if
11670 decls are actually the same even if the tree representation
11671 differs. This handles only decls appearing in TYPE_NAME
11672 and TYPE_CONTEXT. That is NAMESPACE_DECL, TYPE_DECL,
11673 RECORD_TYPE and IDENTIFIER_NODE. */
11676 decls_same_for_odr (tree decl1
, tree decl2
)
11678 if (decl1
&& TREE_CODE (decl1
) == TYPE_DECL
11679 && DECL_ORIGINAL_TYPE (decl1
))
11680 decl1
= DECL_ORIGINAL_TYPE (decl1
);
11681 if (decl2
&& TREE_CODE (decl2
) == TYPE_DECL
11682 && DECL_ORIGINAL_TYPE (decl2
))
11683 decl2
= DECL_ORIGINAL_TYPE (decl2
);
11684 if (decl1
== decl2
)
11686 if (!decl1
|| !decl2
)
11688 gcc_checking_assert (DECL_P (decl1
) && DECL_P (decl2
));
11689 if (TREE_CODE (decl1
) != TREE_CODE (decl2
))
11691 if (TREE_CODE (decl1
) == TRANSLATION_UNIT_DECL
)
11693 if (TREE_CODE (decl1
) != NAMESPACE_DECL
11694 && TREE_CODE (decl1
) != TYPE_DECL
)
11696 if (!DECL_NAME (decl1
))
11698 gcc_checking_assert (TREE_CODE (DECL_NAME (decl1
)) == IDENTIFIER_NODE
);
11699 gcc_checking_assert (!DECL_NAME (decl2
)
11700 || TREE_CODE (DECL_NAME (decl2
)) == IDENTIFIER_NODE
);
11701 if (DECL_NAME (decl1
) != DECL_NAME (decl2
))
11703 return same_for_odr (DECL_CONTEXT (decl1
),
11704 DECL_CONTEXT (decl2
));
11707 /* For languages with One Definition Rule, work out if
11708 types are same even if the tree representation differs.
11709 This is non-trivial for LTO where minnor differences in
11710 the type representation may have prevented type merging
11711 to merge two copies of otherwise equivalent type. */
11714 types_same_for_odr (tree type1
, tree type2
)
11716 gcc_checking_assert (TYPE_P (type1
) && TYPE_P (type2
));
11717 type1
= TYPE_MAIN_VARIANT (type1
);
11718 type2
= TYPE_MAIN_VARIANT (type2
);
11719 if (type1
== type2
)
11722 #ifndef ENABLE_CHECKING
11727 /* Check for anonymous namespaces. Those have !TREE_PUBLIC
11728 on the corresponding TYPE_STUB_DECL. */
11729 if (type_in_anonymous_namespace_p (type1
)
11730 || type_in_anonymous_namespace_p (type2
))
11732 /* When assembler name of virtual table is available, it is
11733 easy to compare types for equivalence. */
11734 if (TYPE_BINFO (type1
) && TYPE_BINFO (type2
)
11735 && BINFO_VTABLE (TYPE_BINFO (type1
))
11736 && BINFO_VTABLE (TYPE_BINFO (type2
)))
11738 tree v1
= BINFO_VTABLE (TYPE_BINFO (type1
));
11739 tree v2
= BINFO_VTABLE (TYPE_BINFO (type2
));
11741 if (TREE_CODE (v1
) == POINTER_PLUS_EXPR
)
11743 if (TREE_CODE (v2
) != POINTER_PLUS_EXPR
11744 || !operand_equal_p (TREE_OPERAND (v1
, 1),
11745 TREE_OPERAND (v2
, 1), 0))
11747 v1
= TREE_OPERAND (TREE_OPERAND (v1
, 0), 0);
11748 v2
= TREE_OPERAND (TREE_OPERAND (v2
, 0), 0);
11750 v1
= DECL_ASSEMBLER_NAME (v1
);
11751 v2
= DECL_ASSEMBLER_NAME (v2
);
11755 /* FIXME: the code comparing type names consider all instantiations of the
11756 same template to have same name. This is because we have no access
11757 to template parameters. For types with no virtual method tables
11758 we thus can return false positives. At the moment we do not need
11759 to compare types in other scenarios than devirtualization. */
11761 /* If types are not structuraly same, do not bother to contnue.
11762 Match in the remainder of code would mean ODR violation. */
11763 if (!types_compatible_p (type1
, type2
))
11765 if (!TYPE_NAME (type1
))
11767 if (!decls_same_for_odr (TYPE_NAME (type1
), TYPE_NAME (type2
)))
11769 if (!same_for_odr (TYPE_CONTEXT (type1
), TYPE_CONTEXT (type2
)))
11771 /* When not in LTO the MAIN_VARIANT check should be the same. */
11772 gcc_assert (in_lto_p
);
11777 /* TARGET is a call target of GIMPLE call statement
11778 (obtained by gimple_call_fn). Return true if it is
11779 OBJ_TYPE_REF representing an virtual call of C++ method.
11780 (As opposed to OBJ_TYPE_REF representing objc calls
11781 through a cast where middle-end devirtualization machinery
11785 virtual_method_call_p (tree target
)
11787 if (TREE_CODE (target
) != OBJ_TYPE_REF
)
11789 target
= TREE_TYPE (target
);
11790 gcc_checking_assert (TREE_CODE (target
) == POINTER_TYPE
);
11791 target
= TREE_TYPE (target
);
11792 if (TREE_CODE (target
) == FUNCTION_TYPE
)
11794 gcc_checking_assert (TREE_CODE (target
) == METHOD_TYPE
);
11798 /* REF is OBJ_TYPE_REF, return the class the ref corresponds to. */
11801 obj_type_ref_class (tree ref
)
11803 gcc_checking_assert (TREE_CODE (ref
) == OBJ_TYPE_REF
);
11804 ref
= TREE_TYPE (ref
);
11805 gcc_checking_assert (TREE_CODE (ref
) == POINTER_TYPE
);
11806 ref
= TREE_TYPE (ref
);
11807 /* We look for type THIS points to. ObjC also builds
11808 OBJ_TYPE_REF with non-method calls, Their first parameter
11809 ID however also corresponds to class type. */
11810 gcc_checking_assert (TREE_CODE (ref
) == METHOD_TYPE
11811 || TREE_CODE (ref
) == FUNCTION_TYPE
);
11812 ref
= TREE_VALUE (TYPE_ARG_TYPES (ref
));
11813 gcc_checking_assert (TREE_CODE (ref
) == POINTER_TYPE
);
11814 return TREE_TYPE (ref
);
11817 /* Return true if T is in anonymous namespace. */
11820 type_in_anonymous_namespace_p (tree t
)
11822 return (TYPE_STUB_DECL (t
) && !TREE_PUBLIC (TYPE_STUB_DECL (t
)));
11825 /* Try to find a base info of BINFO that would have its field decl at offset
11826 OFFSET within the BINFO type and which is of EXPECTED_TYPE. If it can be
11827 found, return, otherwise return NULL_TREE. */
11830 get_binfo_at_offset (tree binfo
, HOST_WIDE_INT offset
, tree expected_type
)
11832 tree type
= BINFO_TYPE (binfo
);
11836 HOST_WIDE_INT pos
, size
;
11840 if (types_same_for_odr (type
, expected_type
))
11845 for (fld
= TYPE_FIELDS (type
); fld
; fld
= DECL_CHAIN (fld
))
11847 if (TREE_CODE (fld
) != FIELD_DECL
)
11850 pos
= int_bit_position (fld
);
11851 size
= tree_to_uhwi (DECL_SIZE (fld
));
11852 if (pos
<= offset
&& (pos
+ size
) > offset
)
11855 if (!fld
|| TREE_CODE (TREE_TYPE (fld
)) != RECORD_TYPE
)
11858 if (!DECL_ARTIFICIAL (fld
))
11860 binfo
= TYPE_BINFO (TREE_TYPE (fld
));
11864 /* Offset 0 indicates the primary base, whose vtable contents are
11865 represented in the binfo for the derived class. */
11866 else if (offset
!= 0)
11868 tree base_binfo
, binfo2
= binfo
;
11870 /* Find BINFO corresponding to FLD. This is bit harder
11871 by a fact that in virtual inheritance we may need to walk down
11872 the non-virtual inheritance chain. */
11875 tree containing_binfo
= NULL
, found_binfo
= NULL
;
11876 for (i
= 0; BINFO_BASE_ITERATE (binfo2
, i
, base_binfo
); i
++)
11877 if (types_same_for_odr (TREE_TYPE (base_binfo
), TREE_TYPE (fld
)))
11879 found_binfo
= base_binfo
;
11883 if ((tree_to_shwi (BINFO_OFFSET (base_binfo
))
11884 - tree_to_shwi (BINFO_OFFSET (binfo
)))
11885 * BITS_PER_UNIT
< pos
11886 /* Rule out types with no virtual methods or we can get confused
11887 here by zero sized bases. */
11888 && BINFO_VTABLE (TYPE_BINFO (BINFO_TYPE (base_binfo
)))
11889 && (!containing_binfo
11890 || (tree_to_shwi (BINFO_OFFSET (containing_binfo
))
11891 < tree_to_shwi (BINFO_OFFSET (base_binfo
)))))
11892 containing_binfo
= base_binfo
;
11895 binfo
= found_binfo
;
11898 if (!containing_binfo
)
11900 binfo2
= containing_binfo
;
11904 type
= TREE_TYPE (fld
);
11909 /* Returns true if X is a typedef decl. */
11912 is_typedef_decl (tree x
)
11914 return (x
&& TREE_CODE (x
) == TYPE_DECL
11915 && DECL_ORIGINAL_TYPE (x
) != NULL_TREE
);
11918 /* Returns true iff TYPE is a type variant created for a typedef. */
11921 typedef_variant_p (tree type
)
11923 return is_typedef_decl (TYPE_NAME (type
));
11926 /* Warn about a use of an identifier which was marked deprecated. */
11928 warn_deprecated_use (tree node
, tree attr
)
11932 if (node
== 0 || !warn_deprecated_decl
)
11938 attr
= DECL_ATTRIBUTES (node
);
11939 else if (TYPE_P (node
))
11941 tree decl
= TYPE_STUB_DECL (node
);
11943 attr
= lookup_attribute ("deprecated",
11944 TYPE_ATTRIBUTES (TREE_TYPE (decl
)));
11949 attr
= lookup_attribute ("deprecated", attr
);
11952 msg
= TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr
)));
11958 expanded_location xloc
= expand_location (DECL_SOURCE_LOCATION (node
));
11960 warning (OPT_Wdeprecated_declarations
,
11961 "%qD is deprecated (declared at %r%s:%d%R): %s",
11962 node
, "locus", xloc
.file
, xloc
.line
, msg
);
11964 warning (OPT_Wdeprecated_declarations
,
11965 "%qD is deprecated (declared at %r%s:%d%R)",
11966 node
, "locus", xloc
.file
, xloc
.line
);
11968 else if (TYPE_P (node
))
11970 tree what
= NULL_TREE
;
11971 tree decl
= TYPE_STUB_DECL (node
);
11973 if (TYPE_NAME (node
))
11975 if (TREE_CODE (TYPE_NAME (node
)) == IDENTIFIER_NODE
)
11976 what
= TYPE_NAME (node
);
11977 else if (TREE_CODE (TYPE_NAME (node
)) == TYPE_DECL
11978 && DECL_NAME (TYPE_NAME (node
)))
11979 what
= DECL_NAME (TYPE_NAME (node
));
11984 expanded_location xloc
11985 = expand_location (DECL_SOURCE_LOCATION (decl
));
11989 warning (OPT_Wdeprecated_declarations
,
11990 "%qE is deprecated (declared at %r%s:%d%R): %s",
11991 what
, "locus", xloc
.file
, xloc
.line
, msg
);
11993 warning (OPT_Wdeprecated_declarations
,
11994 "%qE is deprecated (declared at %r%s:%d%R)",
11995 what
, "locus", xloc
.file
, xloc
.line
);
12000 warning (OPT_Wdeprecated_declarations
,
12001 "type is deprecated (declared at %r%s:%d%R): %s",
12002 "locus", xloc
.file
, xloc
.line
, msg
);
12004 warning (OPT_Wdeprecated_declarations
,
12005 "type is deprecated (declared at %r%s:%d%R)",
12006 "locus", xloc
.file
, xloc
.line
);
12014 warning (OPT_Wdeprecated_declarations
, "%qE is deprecated: %s",
12017 warning (OPT_Wdeprecated_declarations
, "%qE is deprecated", what
);
12022 warning (OPT_Wdeprecated_declarations
, "type is deprecated: %s",
12025 warning (OPT_Wdeprecated_declarations
, "type is deprecated");
12031 /* Return true if REF has a COMPONENT_REF with a bit-field field declaration
12032 somewhere in it. */
12035 contains_bitfld_component_ref_p (const_tree ref
)
12037 while (handled_component_p (ref
))
12039 if (TREE_CODE (ref
) == COMPONENT_REF
12040 && DECL_BIT_FIELD (TREE_OPERAND (ref
, 1)))
12042 ref
= TREE_OPERAND (ref
, 0);
12048 /* Try to determine whether a TRY_CATCH expression can fall through.
12049 This is a subroutine of block_may_fallthru. */
12052 try_catch_may_fallthru (const_tree stmt
)
12054 tree_stmt_iterator i
;
12056 /* If the TRY block can fall through, the whole TRY_CATCH can
12058 if (block_may_fallthru (TREE_OPERAND (stmt
, 0)))
12061 i
= tsi_start (TREE_OPERAND (stmt
, 1));
12062 switch (TREE_CODE (tsi_stmt (i
)))
12065 /* We expect to see a sequence of CATCH_EXPR trees, each with a
12066 catch expression and a body. The whole TRY_CATCH may fall
12067 through iff any of the catch bodies falls through. */
12068 for (; !tsi_end_p (i
); tsi_next (&i
))
12070 if (block_may_fallthru (CATCH_BODY (tsi_stmt (i
))))
12075 case EH_FILTER_EXPR
:
12076 /* The exception filter expression only matters if there is an
12077 exception. If the exception does not match EH_FILTER_TYPES,
12078 we will execute EH_FILTER_FAILURE, and we will fall through
12079 if that falls through. If the exception does match
12080 EH_FILTER_TYPES, the stack unwinder will continue up the
12081 stack, so we will not fall through. We don't know whether we
12082 will throw an exception which matches EH_FILTER_TYPES or not,
12083 so we just ignore EH_FILTER_TYPES and assume that we might
12084 throw an exception which doesn't match. */
12085 return block_may_fallthru (EH_FILTER_FAILURE (tsi_stmt (i
)));
12088 /* This case represents statements to be executed when an
12089 exception occurs. Those statements are implicitly followed
12090 by a RESX statement to resume execution after the exception.
12091 So in this case the TRY_CATCH never falls through. */
12096 /* Try to determine if we can fall out of the bottom of BLOCK. This guess
12097 need not be 100% accurate; simply be conservative and return true if we
12098 don't know. This is used only to avoid stupidly generating extra code.
12099 If we're wrong, we'll just delete the extra code later. */
12102 block_may_fallthru (const_tree block
)
12104 /* This CONST_CAST is okay because expr_last returns its argument
12105 unmodified and we assign it to a const_tree. */
12106 const_tree stmt
= expr_last (CONST_CAST_TREE (block
));
12108 switch (stmt
? TREE_CODE (stmt
) : ERROR_MARK
)
12112 /* Easy cases. If the last statement of the block implies
12113 control transfer, then we can't fall through. */
12117 /* If SWITCH_LABELS is set, this is lowered, and represents a
12118 branch to a selected label and hence can not fall through.
12119 Otherwise SWITCH_BODY is set, and the switch can fall
12121 return SWITCH_LABELS (stmt
) == NULL_TREE
;
12124 if (block_may_fallthru (COND_EXPR_THEN (stmt
)))
12126 return block_may_fallthru (COND_EXPR_ELSE (stmt
));
12129 return block_may_fallthru (BIND_EXPR_BODY (stmt
));
12131 case TRY_CATCH_EXPR
:
12132 return try_catch_may_fallthru (stmt
);
12134 case TRY_FINALLY_EXPR
:
12135 /* The finally clause is always executed after the try clause,
12136 so if it does not fall through, then the try-finally will not
12137 fall through. Otherwise, if the try clause does not fall
12138 through, then when the finally clause falls through it will
12139 resume execution wherever the try clause was going. So the
12140 whole try-finally will only fall through if both the try
12141 clause and the finally clause fall through. */
12142 return (block_may_fallthru (TREE_OPERAND (stmt
, 0))
12143 && block_may_fallthru (TREE_OPERAND (stmt
, 1)));
12146 if (TREE_CODE (TREE_OPERAND (stmt
, 1)) == CALL_EXPR
)
12147 stmt
= TREE_OPERAND (stmt
, 1);
12153 /* Functions that do not return do not fall through. */
12154 return (call_expr_flags (stmt
) & ECF_NORETURN
) == 0;
12156 case CLEANUP_POINT_EXPR
:
12157 return block_may_fallthru (TREE_OPERAND (stmt
, 0));
12160 return block_may_fallthru (TREE_OPERAND (stmt
, 1));
12166 return lang_hooks
.block_may_fallthru (stmt
);
12170 /* True if we are using EH to handle cleanups. */
12171 static bool using_eh_for_cleanups_flag
= false;
12173 /* This routine is called from front ends to indicate eh should be used for
12176 using_eh_for_cleanups (void)
12178 using_eh_for_cleanups_flag
= true;
12181 /* Query whether EH is used for cleanups. */
12183 using_eh_for_cleanups_p (void)
12185 return using_eh_for_cleanups_flag
;
12188 /* Wrapper for tree_code_name to ensure that tree code is valid */
12190 get_tree_code_name (enum tree_code code
)
12192 const char *invalid
= "<invalid tree code>";
12194 if (code
>= MAX_TREE_CODES
)
12197 return tree_code_name
[code
];
12200 /* Drops the TREE_OVERFLOW flag from T. */
12203 drop_tree_overflow (tree t
)
12205 gcc_checking_assert (TREE_OVERFLOW (t
));
12207 /* For tree codes with a sharing machinery re-build the result. */
12208 if (TREE_CODE (t
) == INTEGER_CST
)
12209 return wide_int_to_tree (TREE_TYPE (t
), t
);
12211 /* Otherwise, as all tcc_constants are possibly shared, copy the node
12212 and drop the flag. */
12214 TREE_OVERFLOW (t
) = 0;
12218 /* Given a memory reference expression T, return its base address.
12219 The base address of a memory reference expression is the main
12220 object being referenced. For instance, the base address for
12221 'array[i].fld[j]' is 'array'. You can think of this as stripping
12222 away the offset part from a memory address.
12224 This function calls handled_component_p to strip away all the inner
12225 parts of the memory reference until it reaches the base object. */
12228 get_base_address (tree t
)
12230 while (handled_component_p (t
))
12231 t
= TREE_OPERAND (t
, 0);
12233 if ((TREE_CODE (t
) == MEM_REF
12234 || TREE_CODE (t
) == TARGET_MEM_REF
)
12235 && TREE_CODE (TREE_OPERAND (t
, 0)) == ADDR_EXPR
)
12236 t
= TREE_OPERAND (TREE_OPERAND (t
, 0), 0);
12238 /* ??? Either the alias oracle or all callers need to properly deal
12239 with WITH_SIZE_EXPRs before we can look through those. */
12240 if (TREE_CODE (t
) == WITH_SIZE_EXPR
)
12246 #include "gt-tree.h"