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 /* Compute the number of bytes occupied by a tree with code CODE.
607 This function cannot be used for nodes that have variable sizes,
608 including TREE_VEC, INTEGER_CST, STRING_CST, and CALL_EXPR. */
610 tree_code_size (enum tree_code code
)
612 switch (TREE_CODE_CLASS (code
))
614 case tcc_declaration
: /* A decl node */
619 return sizeof (struct tree_field_decl
);
621 return sizeof (struct tree_parm_decl
);
623 return sizeof (struct tree_var_decl
);
625 return sizeof (struct tree_label_decl
);
627 return sizeof (struct tree_result_decl
);
629 return sizeof (struct tree_const_decl
);
631 return sizeof (struct tree_type_decl
);
633 return sizeof (struct tree_function_decl
);
634 case DEBUG_EXPR_DECL
:
635 return sizeof (struct tree_decl_with_rtl
);
637 return sizeof (struct tree_decl_non_common
);
641 case tcc_type
: /* a type node */
642 return sizeof (struct tree_type_non_common
);
644 case tcc_reference
: /* a reference */
645 case tcc_expression
: /* an expression */
646 case tcc_statement
: /* an expression with side effects */
647 case tcc_comparison
: /* a comparison expression */
648 case tcc_unary
: /* a unary arithmetic expression */
649 case tcc_binary
: /* a binary arithmetic expression */
650 return (sizeof (struct tree_exp
)
651 + (TREE_CODE_LENGTH (code
) - 1) * sizeof (tree
));
653 case tcc_constant
: /* a constant */
656 case VOID_CST
: return sizeof (struct tree_typed
);
657 case INTEGER_CST
: gcc_unreachable ();
658 case REAL_CST
: return sizeof (struct tree_real_cst
);
659 case FIXED_CST
: return sizeof (struct tree_fixed_cst
);
660 case COMPLEX_CST
: return sizeof (struct tree_complex
);
661 case VECTOR_CST
: return sizeof (struct tree_vector
);
662 case STRING_CST
: gcc_unreachable ();
664 return lang_hooks
.tree_size (code
);
667 case tcc_exceptional
: /* something random, like an identifier. */
670 case IDENTIFIER_NODE
: return lang_hooks
.identifier_size
;
671 case TREE_LIST
: return sizeof (struct tree_list
);
674 case PLACEHOLDER_EXPR
: return sizeof (struct tree_common
);
677 case OMP_CLAUSE
: gcc_unreachable ();
679 case SSA_NAME
: return sizeof (struct tree_ssa_name
);
681 case STATEMENT_LIST
: return sizeof (struct tree_statement_list
);
682 case BLOCK
: return sizeof (struct tree_block
);
683 case CONSTRUCTOR
: return sizeof (struct tree_constructor
);
684 case OPTIMIZATION_NODE
: return sizeof (struct tree_optimization_option
);
685 case TARGET_OPTION_NODE
: return sizeof (struct tree_target_option
);
688 return lang_hooks
.tree_size (code
);
696 /* Compute the number of bytes occupied by NODE. This routine only
697 looks at TREE_CODE, except for those nodes that have variable sizes. */
699 tree_size (const_tree node
)
701 const enum tree_code code
= TREE_CODE (node
);
705 return (sizeof (struct tree_int_cst
)
706 + (TREE_INT_CST_EXT_NUNITS (node
) - 1) * sizeof (HOST_WIDE_INT
));
709 return (offsetof (struct tree_binfo
, base_binfos
)
711 ::embedded_size (BINFO_N_BASE_BINFOS (node
)));
714 return (sizeof (struct tree_vec
)
715 + (TREE_VEC_LENGTH (node
) - 1) * sizeof (tree
));
718 return (sizeof (struct tree_vector
)
719 + (TYPE_VECTOR_SUBPARTS (TREE_TYPE (node
)) - 1) * sizeof (tree
));
722 return TREE_STRING_LENGTH (node
) + offsetof (struct tree_string
, str
) + 1;
725 return (sizeof (struct tree_omp_clause
)
726 + (omp_clause_num_ops
[OMP_CLAUSE_CODE (node
)] - 1)
730 if (TREE_CODE_CLASS (code
) == tcc_vl_exp
)
731 return (sizeof (struct tree_exp
)
732 + (VL_EXP_OPERAND_LENGTH (node
) - 1) * sizeof (tree
));
734 return tree_code_size (code
);
738 /* Record interesting allocation statistics for a tree node with CODE
742 record_node_allocation_statistics (enum tree_code code ATTRIBUTE_UNUSED
,
743 size_t length ATTRIBUTE_UNUSED
)
745 enum tree_code_class type
= TREE_CODE_CLASS (code
);
748 if (!GATHER_STATISTICS
)
753 case tcc_declaration
: /* A decl node */
757 case tcc_type
: /* a type node */
761 case tcc_statement
: /* an expression with side effects */
765 case tcc_reference
: /* a reference */
769 case tcc_expression
: /* an expression */
770 case tcc_comparison
: /* a comparison expression */
771 case tcc_unary
: /* a unary arithmetic expression */
772 case tcc_binary
: /* a binary arithmetic expression */
776 case tcc_constant
: /* a constant */
780 case tcc_exceptional
: /* something random, like an identifier. */
783 case IDENTIFIER_NODE
:
796 kind
= ssa_name_kind
;
808 kind
= omp_clause_kind
;
825 tree_code_counts
[(int) code
]++;
826 tree_node_counts
[(int) kind
]++;
827 tree_node_sizes
[(int) kind
] += length
;
830 /* Allocate and return a new UID from the DECL_UID namespace. */
833 allocate_decl_uid (void)
835 return next_decl_uid
++;
838 /* Return a newly allocated node of code CODE. For decl and type
839 nodes, some other fields are initialized. The rest of the node is
840 initialized to zero. This function cannot be used for TREE_VEC,
841 INTEGER_CST or OMP_CLAUSE nodes, which is enforced by asserts in
844 Achoo! I got a code in the node. */
847 make_node_stat (enum tree_code code MEM_STAT_DECL
)
850 enum tree_code_class type
= TREE_CODE_CLASS (code
);
851 size_t length
= tree_code_size (code
);
853 record_node_allocation_statistics (code
, length
);
855 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
856 TREE_SET_CODE (t
, code
);
861 TREE_SIDE_EFFECTS (t
) = 1;
864 case tcc_declaration
:
865 if (CODE_CONTAINS_STRUCT (code
, TS_DECL_COMMON
))
867 if (code
== FUNCTION_DECL
)
869 DECL_ALIGN (t
) = FUNCTION_BOUNDARY
;
870 DECL_MODE (t
) = FUNCTION_MODE
;
875 DECL_SOURCE_LOCATION (t
) = input_location
;
876 if (TREE_CODE (t
) == DEBUG_EXPR_DECL
)
877 DECL_UID (t
) = --next_debug_decl_uid
;
880 DECL_UID (t
) = allocate_decl_uid ();
881 SET_DECL_PT_UID (t
, -1);
883 if (TREE_CODE (t
) == LABEL_DECL
)
884 LABEL_DECL_UID (t
) = -1;
889 TYPE_UID (t
) = next_type_uid
++;
890 TYPE_ALIGN (t
) = BITS_PER_UNIT
;
891 TYPE_USER_ALIGN (t
) = 0;
892 TYPE_MAIN_VARIANT (t
) = t
;
893 TYPE_CANONICAL (t
) = t
;
895 /* Default to no attributes for type, but let target change that. */
896 TYPE_ATTRIBUTES (t
) = NULL_TREE
;
897 targetm
.set_default_type_attributes (t
);
899 /* We have not yet computed the alias set for this type. */
900 TYPE_ALIAS_SET (t
) = -1;
904 TREE_CONSTANT (t
) = 1;
913 case PREDECREMENT_EXPR
:
914 case PREINCREMENT_EXPR
:
915 case POSTDECREMENT_EXPR
:
916 case POSTINCREMENT_EXPR
:
917 /* All of these have side-effects, no matter what their
919 TREE_SIDE_EFFECTS (t
) = 1;
928 /* Other classes need no special treatment. */
935 /* Return a new node with the same contents as NODE except that its
936 TREE_CHAIN, if it has one, is zero and it has a fresh uid. */
939 copy_node_stat (tree node MEM_STAT_DECL
)
942 enum tree_code code
= TREE_CODE (node
);
945 gcc_assert (code
!= STATEMENT_LIST
);
947 length
= tree_size (node
);
948 record_node_allocation_statistics (code
, length
);
949 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
950 memcpy (t
, node
, length
);
952 if (CODE_CONTAINS_STRUCT (code
, TS_COMMON
))
954 TREE_ASM_WRITTEN (t
) = 0;
955 TREE_VISITED (t
) = 0;
957 if (TREE_CODE_CLASS (code
) == tcc_declaration
)
959 if (code
== DEBUG_EXPR_DECL
)
960 DECL_UID (t
) = --next_debug_decl_uid
;
963 DECL_UID (t
) = allocate_decl_uid ();
964 if (DECL_PT_UID_SET_P (node
))
965 SET_DECL_PT_UID (t
, DECL_PT_UID (node
));
967 if ((TREE_CODE (node
) == PARM_DECL
|| TREE_CODE (node
) == VAR_DECL
)
968 && DECL_HAS_VALUE_EXPR_P (node
))
970 SET_DECL_VALUE_EXPR (t
, DECL_VALUE_EXPR (node
));
971 DECL_HAS_VALUE_EXPR_P (t
) = 1;
973 /* DECL_DEBUG_EXPR is copied explicitely by callers. */
974 if (TREE_CODE (node
) == VAR_DECL
)
976 DECL_HAS_DEBUG_EXPR_P (t
) = 0;
977 t
->decl_with_vis
.symtab_node
= NULL
;
979 if (TREE_CODE (node
) == VAR_DECL
&& DECL_HAS_INIT_PRIORITY_P (node
))
981 SET_DECL_INIT_PRIORITY (t
, DECL_INIT_PRIORITY (node
));
982 DECL_HAS_INIT_PRIORITY_P (t
) = 1;
984 if (TREE_CODE (node
) == FUNCTION_DECL
)
986 DECL_STRUCT_FUNCTION (t
) = NULL
;
987 t
->decl_with_vis
.symtab_node
= NULL
;
990 else if (TREE_CODE_CLASS (code
) == tcc_type
)
992 TYPE_UID (t
) = next_type_uid
++;
993 /* The following is so that the debug code for
994 the copy is different from the original type.
995 The two statements usually duplicate each other
996 (because they clear fields of the same union),
997 but the optimizer should catch that. */
998 TYPE_SYMTAB_POINTER (t
) = 0;
999 TYPE_SYMTAB_ADDRESS (t
) = 0;
1001 /* Do not copy the values cache. */
1002 if (TYPE_CACHED_VALUES_P (t
))
1004 TYPE_CACHED_VALUES_P (t
) = 0;
1005 TYPE_CACHED_VALUES (t
) = NULL_TREE
;
1012 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
1013 For example, this can copy a list made of TREE_LIST nodes. */
1016 copy_list (tree list
)
1024 head
= prev
= copy_node (list
);
1025 next
= TREE_CHAIN (list
);
1028 TREE_CHAIN (prev
) = copy_node (next
);
1029 prev
= TREE_CHAIN (prev
);
1030 next
= TREE_CHAIN (next
);
1036 /* Return the value that TREE_INT_CST_EXT_NUNITS should have for an
1037 INTEGER_CST with value CST and type TYPE. */
1040 get_int_cst_ext_nunits (tree type
, const wide_int
&cst
)
1042 gcc_checking_assert (cst
.get_precision () == TYPE_PRECISION (type
));
1043 /* We need an extra zero HWI if CST is an unsigned integer with its
1044 upper bit set, and if CST occupies a whole number of HWIs. */
1045 if (TYPE_UNSIGNED (type
)
1047 && (cst
.get_precision () % HOST_BITS_PER_WIDE_INT
) == 0)
1048 return cst
.get_precision () / HOST_BITS_PER_WIDE_INT
+ 1;
1049 return cst
.get_len ();
1052 /* Return a new INTEGER_CST with value CST and type TYPE. */
1055 build_new_int_cst (tree type
, const wide_int
&cst
)
1057 unsigned int len
= cst
.get_len ();
1058 unsigned int ext_len
= get_int_cst_ext_nunits (type
, cst
);
1059 tree nt
= make_int_cst (len
, ext_len
);
1064 TREE_INT_CST_ELT (nt
, ext_len
) = 0;
1065 for (unsigned int i
= len
; i
< ext_len
; ++i
)
1066 TREE_INT_CST_ELT (nt
, i
) = -1;
1068 else if (TYPE_UNSIGNED (type
)
1069 && cst
.get_precision () < len
* HOST_BITS_PER_WIDE_INT
)
1072 TREE_INT_CST_ELT (nt
, len
)
1073 = zext_hwi (cst
.elt (len
),
1074 cst
.get_precision () % HOST_BITS_PER_WIDE_INT
);
1077 for (unsigned int i
= 0; i
< len
; i
++)
1078 TREE_INT_CST_ELT (nt
, i
) = cst
.elt (i
);
1079 TREE_TYPE (nt
) = type
;
1083 /* Create an INT_CST node with a LOW value sign extended to TYPE. */
1086 build_int_cst (tree type
, HOST_WIDE_INT low
)
1088 /* Support legacy code. */
1090 type
= integer_type_node
;
1092 return wide_int_to_tree (type
, wi::shwi (low
, TYPE_PRECISION (type
)));
1096 build_int_cstu (tree type
, unsigned HOST_WIDE_INT cst
)
1098 return wide_int_to_tree (type
, wi::uhwi (cst
, TYPE_PRECISION (type
)));
1101 /* Create an INT_CST node with a LOW value sign extended to TYPE. */
1104 build_int_cst_type (tree type
, HOST_WIDE_INT low
)
1107 return wide_int_to_tree (type
, wi::shwi (low
, TYPE_PRECISION (type
)));
1110 /* Constructs tree in type TYPE from with value given by CST. Signedness
1111 of CST is assumed to be the same as the signedness of TYPE. */
1114 double_int_to_tree (tree type
, double_int cst
)
1116 return wide_int_to_tree (type
, widest_int::from (cst
, TYPE_SIGN (type
)));
1119 /* We force the wide_int CST to the range of the type TYPE by sign or
1120 zero extending it. OVERFLOWABLE indicates if we are interested in
1121 overflow of the value, when >0 we are only interested in signed
1122 overflow, for <0 we are interested in any overflow. OVERFLOWED
1123 indicates whether overflow has already occurred. CONST_OVERFLOWED
1124 indicates whether constant overflow has already occurred. We force
1125 T's value to be within range of T's type (by setting to 0 or 1 all
1126 the bits outside the type's range). We set TREE_OVERFLOWED if,
1127 OVERFLOWED is nonzero,
1128 or OVERFLOWABLE is >0 and signed overflow occurs
1129 or OVERFLOWABLE is <0 and any overflow occurs
1130 We return a new tree node for the extended wide_int. The node
1131 is shared if no overflow flags are set. */
1135 force_fit_type (tree type
, const wide_int_ref
&cst
,
1136 int overflowable
, bool overflowed
)
1138 signop sign
= TYPE_SIGN (type
);
1140 /* If we need to set overflow flags, return a new unshared node. */
1141 if (overflowed
|| !wi::fits_to_tree_p (cst
, type
))
1145 || (overflowable
> 0 && sign
== SIGNED
))
1147 wide_int tmp
= wide_int::from (cst
, TYPE_PRECISION (type
), sign
);
1148 tree t
= build_new_int_cst (type
, tmp
);
1149 TREE_OVERFLOW (t
) = 1;
1154 /* Else build a shared node. */
1155 return wide_int_to_tree (type
, cst
);
1158 /* These are the hash table functions for the hash table of INTEGER_CST
1159 nodes of a sizetype. */
1161 /* Return the hash code code X, an INTEGER_CST. */
1164 int_cst_hash_hash (const void *x
)
1166 const_tree
const t
= (const_tree
) x
;
1167 hashval_t code
= htab_hash_pointer (TREE_TYPE (t
));
1170 for (i
= 0; i
< TREE_INT_CST_NUNITS (t
); i
++)
1171 code
^= TREE_INT_CST_ELT (t
, i
);
1176 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
1177 is the same as that given by *Y, which is the same. */
1180 int_cst_hash_eq (const void *x
, const void *y
)
1182 const_tree
const xt
= (const_tree
) x
;
1183 const_tree
const yt
= (const_tree
) y
;
1185 if (TREE_TYPE (xt
) != TREE_TYPE (yt
)
1186 || TREE_INT_CST_NUNITS (xt
) != TREE_INT_CST_NUNITS (yt
)
1187 || TREE_INT_CST_EXT_NUNITS (xt
) != TREE_INT_CST_EXT_NUNITS (yt
))
1190 for (int i
= 0; i
< TREE_INT_CST_NUNITS (xt
); i
++)
1191 if (TREE_INT_CST_ELT (xt
, i
) != TREE_INT_CST_ELT (yt
, i
))
1197 /* Create an INT_CST node of TYPE and value CST.
1198 The returned node is always shared. For small integers we use a
1199 per-type vector cache, for larger ones we use a single hash table.
1200 The value is extended from its precision according to the sign of
1201 the type to be a multiple of HOST_BITS_PER_WIDE_INT. This defines
1202 the upper bits and ensures that hashing and value equality based
1203 upon the underlying HOST_WIDE_INTs works without masking. */
1206 wide_int_to_tree (tree type
, const wide_int_ref
&pcst
)
1213 unsigned int prec
= TYPE_PRECISION (type
);
1214 signop sgn
= TYPE_SIGN (type
);
1216 /* Verify that everything is canonical. */
1217 int l
= pcst
.get_len ();
1220 if (pcst
.elt (l
- 1) == 0)
1221 gcc_checking_assert (pcst
.elt (l
- 2) < 0);
1222 if (pcst
.elt (l
- 1) == (HOST_WIDE_INT
) -1)
1223 gcc_checking_assert (pcst
.elt (l
- 2) >= 0);
1226 wide_int cst
= wide_int::from (pcst
, prec
, sgn
);
1227 unsigned int ext_len
= get_int_cst_ext_nunits (type
, cst
);
1231 /* We just need to store a single HOST_WIDE_INT. */
1233 if (TYPE_UNSIGNED (type
))
1234 hwi
= cst
.to_uhwi ();
1236 hwi
= cst
.to_shwi ();
1238 switch (TREE_CODE (type
))
1241 gcc_assert (hwi
== 0);
1245 case REFERENCE_TYPE
:
1246 /* Cache NULL pointer. */
1255 /* Cache false or true. */
1263 if (TYPE_SIGN (type
) == UNSIGNED
)
1266 limit
= INTEGER_SHARE_LIMIT
;
1267 if (IN_RANGE (hwi
, 0, INTEGER_SHARE_LIMIT
- 1))
1272 /* Cache [-1, N). */
1273 limit
= INTEGER_SHARE_LIMIT
+ 1;
1274 if (IN_RANGE (hwi
, -1, INTEGER_SHARE_LIMIT
- 1))
1288 /* Look for it in the type's vector of small shared ints. */
1289 if (!TYPE_CACHED_VALUES_P (type
))
1291 TYPE_CACHED_VALUES_P (type
) = 1;
1292 TYPE_CACHED_VALUES (type
) = make_tree_vec (limit
);
1295 t
= TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
);
1297 /* Make sure no one is clobbering the shared constant. */
1298 gcc_checking_assert (TREE_TYPE (t
) == type
1299 && TREE_INT_CST_NUNITS (t
) == 1
1300 && TREE_INT_CST_OFFSET_NUNITS (t
) == 1
1301 && TREE_INT_CST_EXT_NUNITS (t
) == 1
1302 && TREE_INT_CST_ELT (t
, 0) == hwi
);
1305 /* Create a new shared int. */
1306 t
= build_new_int_cst (type
, cst
);
1307 TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) = t
;
1312 /* Use the cache of larger shared ints, using int_cst_node as
1316 TREE_INT_CST_ELT (int_cst_node
, 0) = hwi
;
1317 TREE_TYPE (int_cst_node
) = type
;
1319 slot
= htab_find_slot (int_cst_hash_table
, int_cst_node
, INSERT
);
1323 /* Insert this one into the hash table. */
1326 /* Make a new node for next time round. */
1327 int_cst_node
= make_int_cst (1, 1);
1333 /* The value either hashes properly or we drop it on the floor
1334 for the gc to take care of. There will not be enough of them
1338 tree nt
= build_new_int_cst (type
, cst
);
1339 slot
= htab_find_slot (int_cst_hash_table
, nt
, INSERT
);
1343 /* Insert this one into the hash table. */
1353 cache_integer_cst (tree t
)
1355 tree type
= TREE_TYPE (t
);
1358 int prec
= TYPE_PRECISION (type
);
1360 gcc_assert (!TREE_OVERFLOW (t
));
1362 switch (TREE_CODE (type
))
1365 gcc_assert (integer_zerop (t
));
1369 case REFERENCE_TYPE
:
1370 /* Cache NULL pointer. */
1371 if (integer_zerop (t
))
1379 /* Cache false or true. */
1381 if (wi::ltu_p (t
, 2))
1382 ix
= TREE_INT_CST_ELT (t
, 0);
1387 if (TYPE_UNSIGNED (type
))
1390 limit
= INTEGER_SHARE_LIMIT
;
1392 /* This is a little hokie, but if the prec is smaller than
1393 what is necessary to hold INTEGER_SHARE_LIMIT, then the
1394 obvious test will not get the correct answer. */
1395 if (prec
< HOST_BITS_PER_WIDE_INT
)
1397 if (tree_to_uhwi (t
) < (unsigned HOST_WIDE_INT
) INTEGER_SHARE_LIMIT
)
1398 ix
= tree_to_uhwi (t
);
1400 else if (wi::ltu_p (t
, INTEGER_SHARE_LIMIT
))
1401 ix
= tree_to_uhwi (t
);
1406 limit
= INTEGER_SHARE_LIMIT
+ 1;
1408 if (integer_minus_onep (t
))
1410 else if (!wi::neg_p (t
))
1412 if (prec
< HOST_BITS_PER_WIDE_INT
)
1414 if (tree_to_shwi (t
) < INTEGER_SHARE_LIMIT
)
1415 ix
= tree_to_shwi (t
) + 1;
1417 else if (wi::ltu_p (t
, INTEGER_SHARE_LIMIT
))
1418 ix
= tree_to_shwi (t
) + 1;
1432 /* Look for it in the type's vector of small shared ints. */
1433 if (!TYPE_CACHED_VALUES_P (type
))
1435 TYPE_CACHED_VALUES_P (type
) = 1;
1436 TYPE_CACHED_VALUES (type
) = make_tree_vec (limit
);
1439 gcc_assert (TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) == NULL_TREE
);
1440 TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) = t
;
1444 /* Use the cache of larger shared ints. */
1447 slot
= htab_find_slot (int_cst_hash_table
, t
, INSERT
);
1448 /* If there is already an entry for the number verify it's the
1451 gcc_assert (wi::eq_p (tree (*slot
), t
));
1453 /* Otherwise insert this one into the hash table. */
1459 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
1460 and the rest are zeros. */
1463 build_low_bits_mask (tree type
, unsigned bits
)
1465 gcc_assert (bits
<= TYPE_PRECISION (type
));
1467 return wide_int_to_tree (type
, wi::mask (bits
, false,
1468 TYPE_PRECISION (type
)));
1471 /* Checks that X is integer constant that can be expressed in (unsigned)
1472 HOST_WIDE_INT without loss of precision. */
1475 cst_and_fits_in_hwi (const_tree x
)
1477 if (TREE_CODE (x
) != INTEGER_CST
)
1480 if (TYPE_PRECISION (TREE_TYPE (x
)) > HOST_BITS_PER_WIDE_INT
)
1483 return TREE_INT_CST_NUNITS (x
) == 1;
1486 /* Build a newly constructed TREE_VEC node of length LEN. */
1489 make_vector_stat (unsigned len MEM_STAT_DECL
)
1492 unsigned length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vector
);
1494 record_node_allocation_statistics (VECTOR_CST
, length
);
1496 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
1498 TREE_SET_CODE (t
, VECTOR_CST
);
1499 TREE_CONSTANT (t
) = 1;
1504 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1505 are in a list pointed to by VALS. */
1508 build_vector_stat (tree type
, tree
*vals MEM_STAT_DECL
)
1512 tree v
= make_vector (TYPE_VECTOR_SUBPARTS (type
));
1513 TREE_TYPE (v
) = type
;
1515 /* Iterate through elements and check for overflow. */
1516 for (cnt
= 0; cnt
< TYPE_VECTOR_SUBPARTS (type
); ++cnt
)
1518 tree value
= vals
[cnt
];
1520 VECTOR_CST_ELT (v
, cnt
) = value
;
1522 /* Don't crash if we get an address constant. */
1523 if (!CONSTANT_CLASS_P (value
))
1526 over
|= TREE_OVERFLOW (value
);
1529 TREE_OVERFLOW (v
) = over
;
1533 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1534 are extracted from V, a vector of CONSTRUCTOR_ELT. */
1537 build_vector_from_ctor (tree type
, vec
<constructor_elt
, va_gc
> *v
)
1539 tree
*vec
= XALLOCAVEC (tree
, TYPE_VECTOR_SUBPARTS (type
));
1540 unsigned HOST_WIDE_INT idx
;
1543 FOR_EACH_CONSTRUCTOR_VALUE (v
, idx
, value
)
1545 for (; idx
< TYPE_VECTOR_SUBPARTS (type
); ++idx
)
1546 vec
[idx
] = build_zero_cst (TREE_TYPE (type
));
1548 return build_vector (type
, vec
);
1551 /* Build a vector of type VECTYPE where all the elements are SCs. */
1553 build_vector_from_val (tree vectype
, tree sc
)
1555 int i
, nunits
= TYPE_VECTOR_SUBPARTS (vectype
);
1557 if (sc
== error_mark_node
)
1560 /* Verify that the vector type is suitable for SC. Note that there
1561 is some inconsistency in the type-system with respect to restrict
1562 qualifications of pointers. Vector types always have a main-variant
1563 element type and the qualification is applied to the vector-type.
1564 So TREE_TYPE (vector-type) does not return a properly qualified
1565 vector element-type. */
1566 gcc_checking_assert (types_compatible_p (TYPE_MAIN_VARIANT (TREE_TYPE (sc
)),
1567 TREE_TYPE (vectype
)));
1569 if (CONSTANT_CLASS_P (sc
))
1571 tree
*v
= XALLOCAVEC (tree
, nunits
);
1572 for (i
= 0; i
< nunits
; ++i
)
1574 return build_vector (vectype
, v
);
1578 vec
<constructor_elt
, va_gc
> *v
;
1579 vec_alloc (v
, nunits
);
1580 for (i
= 0; i
< nunits
; ++i
)
1581 CONSTRUCTOR_APPEND_ELT (v
, NULL_TREE
, sc
);
1582 return build_constructor (vectype
, v
);
1586 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1587 are in the vec pointed to by VALS. */
1589 build_constructor (tree type
, vec
<constructor_elt
, va_gc
> *vals
)
1591 tree c
= make_node (CONSTRUCTOR
);
1593 constructor_elt
*elt
;
1594 bool constant_p
= true;
1595 bool side_effects_p
= false;
1597 TREE_TYPE (c
) = type
;
1598 CONSTRUCTOR_ELTS (c
) = vals
;
1600 FOR_EACH_VEC_SAFE_ELT (vals
, i
, elt
)
1602 /* Mostly ctors will have elts that don't have side-effects, so
1603 the usual case is to scan all the elements. Hence a single
1604 loop for both const and side effects, rather than one loop
1605 each (with early outs). */
1606 if (!TREE_CONSTANT (elt
->value
))
1608 if (TREE_SIDE_EFFECTS (elt
->value
))
1609 side_effects_p
= true;
1612 TREE_SIDE_EFFECTS (c
) = side_effects_p
;
1613 TREE_CONSTANT (c
) = constant_p
;
1618 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
1621 build_constructor_single (tree type
, tree index
, tree value
)
1623 vec
<constructor_elt
, va_gc
> *v
;
1624 constructor_elt elt
= {index
, value
};
1627 v
->quick_push (elt
);
1629 return build_constructor (type
, v
);
1633 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1634 are in a list pointed to by VALS. */
1636 build_constructor_from_list (tree type
, tree vals
)
1639 vec
<constructor_elt
, va_gc
> *v
= NULL
;
1643 vec_alloc (v
, list_length (vals
));
1644 for (t
= vals
; t
; t
= TREE_CHAIN (t
))
1645 CONSTRUCTOR_APPEND_ELT (v
, TREE_PURPOSE (t
), TREE_VALUE (t
));
1648 return build_constructor (type
, v
);
1651 /* Return a new CONSTRUCTOR node whose type is TYPE. NELTS is the number
1652 of elements, provided as index/value pairs. */
1655 build_constructor_va (tree type
, int nelts
, ...)
1657 vec
<constructor_elt
, va_gc
> *v
= NULL
;
1660 va_start (p
, nelts
);
1661 vec_alloc (v
, nelts
);
1664 tree index
= va_arg (p
, tree
);
1665 tree value
= va_arg (p
, tree
);
1666 CONSTRUCTOR_APPEND_ELT (v
, index
, value
);
1669 return build_constructor (type
, v
);
1672 /* Return a new FIXED_CST node whose type is TYPE and value is F. */
1675 build_fixed (tree type
, FIXED_VALUE_TYPE f
)
1678 FIXED_VALUE_TYPE
*fp
;
1680 v
= make_node (FIXED_CST
);
1681 fp
= ggc_alloc
<fixed_value
> ();
1682 memcpy (fp
, &f
, sizeof (FIXED_VALUE_TYPE
));
1684 TREE_TYPE (v
) = type
;
1685 TREE_FIXED_CST_PTR (v
) = fp
;
1689 /* Return a new REAL_CST node whose type is TYPE and value is D. */
1692 build_real (tree type
, REAL_VALUE_TYPE d
)
1695 REAL_VALUE_TYPE
*dp
;
1698 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
1699 Consider doing it via real_convert now. */
1701 v
= make_node (REAL_CST
);
1702 dp
= ggc_alloc
<real_value
> ();
1703 memcpy (dp
, &d
, sizeof (REAL_VALUE_TYPE
));
1705 TREE_TYPE (v
) = type
;
1706 TREE_REAL_CST_PTR (v
) = dp
;
1707 TREE_OVERFLOW (v
) = overflow
;
1711 /* Return a new REAL_CST node whose type is TYPE
1712 and whose value is the integer value of the INTEGER_CST node I. */
1715 real_value_from_int_cst (const_tree type
, const_tree i
)
1719 /* Clear all bits of the real value type so that we can later do
1720 bitwise comparisons to see if two values are the same. */
1721 memset (&d
, 0, sizeof d
);
1723 real_from_integer (&d
, type
? TYPE_MODE (type
) : VOIDmode
, i
,
1724 TYPE_SIGN (TREE_TYPE (i
)));
1728 /* Given a tree representing an integer constant I, return a tree
1729 representing the same value as a floating-point constant of type TYPE. */
1732 build_real_from_int_cst (tree type
, const_tree i
)
1735 int overflow
= TREE_OVERFLOW (i
);
1737 v
= build_real (type
, real_value_from_int_cst (type
, i
));
1739 TREE_OVERFLOW (v
) |= overflow
;
1743 /* Return a newly constructed STRING_CST node whose value is
1744 the LEN characters at STR.
1745 Note that for a C string literal, LEN should include the trailing NUL.
1746 The TREE_TYPE is not initialized. */
1749 build_string (int len
, const char *str
)
1754 /* Do not waste bytes provided by padding of struct tree_string. */
1755 length
= len
+ offsetof (struct tree_string
, str
) + 1;
1757 record_node_allocation_statistics (STRING_CST
, length
);
1759 s
= (tree
) ggc_internal_alloc (length
);
1761 memset (s
, 0, sizeof (struct tree_typed
));
1762 TREE_SET_CODE (s
, STRING_CST
);
1763 TREE_CONSTANT (s
) = 1;
1764 TREE_STRING_LENGTH (s
) = len
;
1765 memcpy (s
->string
.str
, str
, len
);
1766 s
->string
.str
[len
] = '\0';
1771 /* Return a newly constructed COMPLEX_CST node whose value is
1772 specified by the real and imaginary parts REAL and IMAG.
1773 Both REAL and IMAG should be constant nodes. TYPE, if specified,
1774 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
1777 build_complex (tree type
, tree real
, tree imag
)
1779 tree t
= make_node (COMPLEX_CST
);
1781 TREE_REALPART (t
) = real
;
1782 TREE_IMAGPART (t
) = imag
;
1783 TREE_TYPE (t
) = type
? type
: build_complex_type (TREE_TYPE (real
));
1784 TREE_OVERFLOW (t
) = TREE_OVERFLOW (real
) | TREE_OVERFLOW (imag
);
1788 /* Return a constant of arithmetic type TYPE which is the
1789 multiplicative identity of the set TYPE. */
1792 build_one_cst (tree type
)
1794 switch (TREE_CODE (type
))
1796 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
1797 case POINTER_TYPE
: case REFERENCE_TYPE
:
1799 return build_int_cst (type
, 1);
1802 return build_real (type
, dconst1
);
1804 case FIXED_POINT_TYPE
:
1805 /* We can only generate 1 for accum types. */
1806 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type
)));
1807 return build_fixed (type
, FCONST1 (TYPE_MODE (type
)));
1811 tree scalar
= build_one_cst (TREE_TYPE (type
));
1813 return build_vector_from_val (type
, scalar
);
1817 return build_complex (type
,
1818 build_one_cst (TREE_TYPE (type
)),
1819 build_zero_cst (TREE_TYPE (type
)));
1826 /* Return an integer of type TYPE containing all 1's in as much precision as
1827 it contains, or a complex or vector whose subparts are such integers. */
1830 build_all_ones_cst (tree type
)
1832 if (TREE_CODE (type
) == COMPLEX_TYPE
)
1834 tree scalar
= build_all_ones_cst (TREE_TYPE (type
));
1835 return build_complex (type
, scalar
, scalar
);
1838 return build_minus_one_cst (type
);
1841 /* Return a constant of arithmetic type TYPE which is the
1842 opposite of the multiplicative identity of the set TYPE. */
1845 build_minus_one_cst (tree type
)
1847 switch (TREE_CODE (type
))
1849 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
1850 case POINTER_TYPE
: case REFERENCE_TYPE
:
1852 return build_int_cst (type
, -1);
1855 return build_real (type
, dconstm1
);
1857 case FIXED_POINT_TYPE
:
1858 /* We can only generate 1 for accum types. */
1859 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type
)));
1860 return build_fixed (type
, fixed_from_double_int (double_int_minus_one
,
1865 tree scalar
= build_minus_one_cst (TREE_TYPE (type
));
1867 return build_vector_from_val (type
, scalar
);
1871 return build_complex (type
,
1872 build_minus_one_cst (TREE_TYPE (type
)),
1873 build_zero_cst (TREE_TYPE (type
)));
1880 /* Build 0 constant of type TYPE. This is used by constructor folding
1881 and thus the constant should be represented in memory by
1885 build_zero_cst (tree type
)
1887 switch (TREE_CODE (type
))
1889 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
1890 case POINTER_TYPE
: case REFERENCE_TYPE
:
1891 case OFFSET_TYPE
: case NULLPTR_TYPE
:
1892 return build_int_cst (type
, 0);
1895 return build_real (type
, dconst0
);
1897 case FIXED_POINT_TYPE
:
1898 return build_fixed (type
, FCONST0 (TYPE_MODE (type
)));
1902 tree scalar
= build_zero_cst (TREE_TYPE (type
));
1904 return build_vector_from_val (type
, scalar
);
1909 tree zero
= build_zero_cst (TREE_TYPE (type
));
1911 return build_complex (type
, zero
, zero
);
1915 if (!AGGREGATE_TYPE_P (type
))
1916 return fold_convert (type
, integer_zero_node
);
1917 return build_constructor (type
, NULL
);
1922 /* Build a BINFO with LEN language slots. */
1925 make_tree_binfo_stat (unsigned base_binfos MEM_STAT_DECL
)
1928 size_t length
= (offsetof (struct tree_binfo
, base_binfos
)
1929 + vec
<tree
, va_gc
>::embedded_size (base_binfos
));
1931 record_node_allocation_statistics (TREE_BINFO
, length
);
1933 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
1935 memset (t
, 0, offsetof (struct tree_binfo
, base_binfos
));
1937 TREE_SET_CODE (t
, TREE_BINFO
);
1939 BINFO_BASE_BINFOS (t
)->embedded_init (base_binfos
);
1944 /* Create a CASE_LABEL_EXPR tree node and return it. */
1947 build_case_label (tree low_value
, tree high_value
, tree label_decl
)
1949 tree t
= make_node (CASE_LABEL_EXPR
);
1951 TREE_TYPE (t
) = void_type_node
;
1952 SET_EXPR_LOCATION (t
, DECL_SOURCE_LOCATION (label_decl
));
1954 CASE_LOW (t
) = low_value
;
1955 CASE_HIGH (t
) = high_value
;
1956 CASE_LABEL (t
) = label_decl
;
1957 CASE_CHAIN (t
) = NULL_TREE
;
1962 /* Build a newly constructed INTEGER_CST node. LEN and EXT_LEN are the
1963 values of TREE_INT_CST_NUNITS and TREE_INT_CST_EXT_NUNITS respectively.
1964 The latter determines the length of the HOST_WIDE_INT vector. */
1967 make_int_cst_stat (int len
, int ext_len MEM_STAT_DECL
)
1970 int length
= ((ext_len
- 1) * sizeof (HOST_WIDE_INT
)
1971 + sizeof (struct tree_int_cst
));
1974 record_node_allocation_statistics (INTEGER_CST
, length
);
1976 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
1978 TREE_SET_CODE (t
, INTEGER_CST
);
1979 TREE_INT_CST_NUNITS (t
) = len
;
1980 TREE_INT_CST_EXT_NUNITS (t
) = ext_len
;
1981 /* to_offset can only be applied to trees that are offset_int-sized
1982 or smaller. EXT_LEN is correct if it fits, otherwise the constant
1983 must be exactly the precision of offset_int and so LEN is correct. */
1984 if (ext_len
<= OFFSET_INT_ELTS
)
1985 TREE_INT_CST_OFFSET_NUNITS (t
) = ext_len
;
1987 TREE_INT_CST_OFFSET_NUNITS (t
) = len
;
1989 TREE_CONSTANT (t
) = 1;
1994 /* Build a newly constructed TREE_VEC node of length LEN. */
1997 make_tree_vec_stat (int len MEM_STAT_DECL
)
2000 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
2002 record_node_allocation_statistics (TREE_VEC
, length
);
2004 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
2006 TREE_SET_CODE (t
, TREE_VEC
);
2007 TREE_VEC_LENGTH (t
) = len
;
2012 /* Grow a TREE_VEC node to new length LEN. */
2015 grow_tree_vec_stat (tree v
, int len MEM_STAT_DECL
)
2017 gcc_assert (TREE_CODE (v
) == TREE_VEC
);
2019 int oldlen
= TREE_VEC_LENGTH (v
);
2020 gcc_assert (len
> oldlen
);
2022 int oldlength
= (oldlen
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
2023 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
2025 record_node_allocation_statistics (TREE_VEC
, length
- oldlength
);
2027 v
= (tree
) ggc_realloc (v
, length PASS_MEM_STAT
);
2029 TREE_VEC_LENGTH (v
) = len
;
2034 /* Return 1 if EXPR is the integer constant zero or a complex constant
2038 integer_zerop (const_tree expr
)
2042 switch (TREE_CODE (expr
))
2045 return wi::eq_p (expr
, 0);
2047 return (integer_zerop (TREE_REALPART (expr
))
2048 && integer_zerop (TREE_IMAGPART (expr
)));
2052 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2053 if (!integer_zerop (VECTOR_CST_ELT (expr
, i
)))
2062 /* Return 1 if EXPR is the integer constant one or the corresponding
2063 complex constant. */
2066 integer_onep (const_tree expr
)
2070 switch (TREE_CODE (expr
))
2073 return wi::eq_p (wi::to_widest (expr
), 1);
2075 return (integer_onep (TREE_REALPART (expr
))
2076 && integer_zerop (TREE_IMAGPART (expr
)));
2080 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2081 if (!integer_onep (VECTOR_CST_ELT (expr
, i
)))
2090 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
2091 it contains, or a complex or vector whose subparts are such integers. */
2094 integer_all_onesp (const_tree expr
)
2098 if (TREE_CODE (expr
) == COMPLEX_CST
2099 && integer_all_onesp (TREE_REALPART (expr
))
2100 && integer_all_onesp (TREE_IMAGPART (expr
)))
2103 else if (TREE_CODE (expr
) == VECTOR_CST
)
2106 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2107 if (!integer_all_onesp (VECTOR_CST_ELT (expr
, i
)))
2112 else if (TREE_CODE (expr
) != INTEGER_CST
)
2115 return wi::max_value (TYPE_PRECISION (TREE_TYPE (expr
)), UNSIGNED
) == expr
;
2118 /* Return 1 if EXPR is the integer constant minus one. */
2121 integer_minus_onep (const_tree expr
)
2125 if (TREE_CODE (expr
) == COMPLEX_CST
)
2126 return (integer_all_onesp (TREE_REALPART (expr
))
2127 && integer_zerop (TREE_IMAGPART (expr
)));
2129 return integer_all_onesp (expr
);
2132 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
2136 integer_pow2p (const_tree expr
)
2140 if (TREE_CODE (expr
) == COMPLEX_CST
2141 && integer_pow2p (TREE_REALPART (expr
))
2142 && integer_zerop (TREE_IMAGPART (expr
)))
2145 if (TREE_CODE (expr
) != INTEGER_CST
)
2148 return wi::popcount (expr
) == 1;
2151 /* Return 1 if EXPR is an integer constant other than zero or a
2152 complex constant other than zero. */
2155 integer_nonzerop (const_tree expr
)
2159 return ((TREE_CODE (expr
) == INTEGER_CST
2160 && !wi::eq_p (expr
, 0))
2161 || (TREE_CODE (expr
) == COMPLEX_CST
2162 && (integer_nonzerop (TREE_REALPART (expr
))
2163 || integer_nonzerop (TREE_IMAGPART (expr
)))));
2166 /* Return 1 if EXPR is the fixed-point constant zero. */
2169 fixed_zerop (const_tree expr
)
2171 return (TREE_CODE (expr
) == FIXED_CST
2172 && TREE_FIXED_CST (expr
).data
.is_zero ());
2175 /* Return the power of two represented by a tree node known to be a
2179 tree_log2 (const_tree expr
)
2183 if (TREE_CODE (expr
) == COMPLEX_CST
)
2184 return tree_log2 (TREE_REALPART (expr
));
2186 return wi::exact_log2 (expr
);
2189 /* Similar, but return the largest integer Y such that 2 ** Y is less
2190 than or equal to EXPR. */
2193 tree_floor_log2 (const_tree expr
)
2197 if (TREE_CODE (expr
) == COMPLEX_CST
)
2198 return tree_log2 (TREE_REALPART (expr
));
2200 return wi::floor_log2 (expr
);
2203 /* Return number of known trailing zero bits in EXPR, or, if the value of
2204 EXPR is known to be zero, the precision of it's type. */
2207 tree_ctz (const_tree expr
)
2209 if (!INTEGRAL_TYPE_P (TREE_TYPE (expr
))
2210 && !POINTER_TYPE_P (TREE_TYPE (expr
)))
2213 unsigned int ret1
, ret2
, prec
= TYPE_PRECISION (TREE_TYPE (expr
));
2214 switch (TREE_CODE (expr
))
2217 ret1
= wi::ctz (expr
);
2218 return MIN (ret1
, prec
);
2220 ret1
= wi::ctz (get_nonzero_bits (expr
));
2221 return MIN (ret1
, prec
);
2228 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2231 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2232 return MIN (ret1
, ret2
);
2233 case POINTER_PLUS_EXPR
:
2234 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2235 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2236 /* Second operand is sizetype, which could be in theory
2237 wider than pointer's precision. Make sure we never
2238 return more than prec. */
2239 ret2
= MIN (ret2
, prec
);
2240 return MIN (ret1
, ret2
);
2242 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2243 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2244 return MAX (ret1
, ret2
);
2246 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2247 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2248 return MIN (ret1
+ ret2
, prec
);
2250 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2251 if (tree_fits_uhwi_p (TREE_OPERAND (expr
, 1))
2252 && (tree_to_uhwi (TREE_OPERAND (expr
, 1)) < prec
))
2254 ret2
= tree_to_uhwi (TREE_OPERAND (expr
, 1));
2255 return MIN (ret1
+ ret2
, prec
);
2259 if (tree_fits_uhwi_p (TREE_OPERAND (expr
, 1))
2260 && (tree_to_uhwi (TREE_OPERAND (expr
, 1)) < prec
))
2262 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2263 ret2
= tree_to_uhwi (TREE_OPERAND (expr
, 1));
2268 case TRUNC_DIV_EXPR
:
2270 case FLOOR_DIV_EXPR
:
2271 case ROUND_DIV_EXPR
:
2272 case EXACT_DIV_EXPR
:
2273 if (TREE_CODE (TREE_OPERAND (expr
, 1)) == INTEGER_CST
2274 && tree_int_cst_sgn (TREE_OPERAND (expr
, 1)) == 1)
2276 int l
= tree_log2 (TREE_OPERAND (expr
, 1));
2279 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2287 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2288 if (ret1
&& ret1
== TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (expr
, 0))))
2290 return MIN (ret1
, prec
);
2292 return tree_ctz (TREE_OPERAND (expr
, 0));
2294 ret1
= tree_ctz (TREE_OPERAND (expr
, 1));
2297 ret2
= tree_ctz (TREE_OPERAND (expr
, 2));
2298 return MIN (ret1
, ret2
);
2300 return tree_ctz (TREE_OPERAND (expr
, 1));
2302 ret1
= get_pointer_alignment (CONST_CAST_TREE (expr
));
2303 if (ret1
> BITS_PER_UNIT
)
2305 ret1
= ctz_hwi (ret1
/ BITS_PER_UNIT
);
2306 return MIN (ret1
, prec
);
2314 /* Return 1 if EXPR is the real constant zero. Trailing zeroes matter for
2315 decimal float constants, so don't return 1 for them. */
2318 real_zerop (const_tree expr
)
2322 switch (TREE_CODE (expr
))
2325 return REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst0
)
2326 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2328 return real_zerop (TREE_REALPART (expr
))
2329 && real_zerop (TREE_IMAGPART (expr
));
2333 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2334 if (!real_zerop (VECTOR_CST_ELT (expr
, i
)))
2343 /* Return 1 if EXPR is the real constant one in real or complex form.
2344 Trailing zeroes matter for decimal float constants, so don't return
2348 real_onep (const_tree expr
)
2352 switch (TREE_CODE (expr
))
2355 return REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst1
)
2356 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2358 return real_onep (TREE_REALPART (expr
))
2359 && real_zerop (TREE_IMAGPART (expr
));
2363 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2364 if (!real_onep (VECTOR_CST_ELT (expr
, i
)))
2373 /* Return 1 if EXPR is the real constant minus one. Trailing zeroes
2374 matter for decimal float constants, so don't return 1 for them. */
2377 real_minus_onep (const_tree expr
)
2381 switch (TREE_CODE (expr
))
2384 return REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconstm1
)
2385 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2387 return real_minus_onep (TREE_REALPART (expr
))
2388 && real_zerop (TREE_IMAGPART (expr
));
2392 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2393 if (!real_minus_onep (VECTOR_CST_ELT (expr
, i
)))
2402 /* Nonzero if EXP is a constant or a cast of a constant. */
2405 really_constant_p (const_tree exp
)
2407 /* This is not quite the same as STRIP_NOPS. It does more. */
2408 while (CONVERT_EXPR_P (exp
)
2409 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
2410 exp
= TREE_OPERAND (exp
, 0);
2411 return TREE_CONSTANT (exp
);
2414 /* Return first list element whose TREE_VALUE is ELEM.
2415 Return 0 if ELEM is not in LIST. */
2418 value_member (tree elem
, tree list
)
2422 if (elem
== TREE_VALUE (list
))
2424 list
= TREE_CHAIN (list
);
2429 /* Return first list element whose TREE_PURPOSE is ELEM.
2430 Return 0 if ELEM is not in LIST. */
2433 purpose_member (const_tree elem
, tree list
)
2437 if (elem
== TREE_PURPOSE (list
))
2439 list
= TREE_CHAIN (list
);
2444 /* Return true if ELEM is in V. */
2447 vec_member (const_tree elem
, vec
<tree
, va_gc
> *v
)
2451 FOR_EACH_VEC_SAFE_ELT (v
, ix
, t
)
2457 /* Returns element number IDX (zero-origin) of chain CHAIN, or
2461 chain_index (int idx
, tree chain
)
2463 for (; chain
&& idx
> 0; --idx
)
2464 chain
= TREE_CHAIN (chain
);
2468 /* Return nonzero if ELEM is part of the chain CHAIN. */
2471 chain_member (const_tree elem
, const_tree chain
)
2477 chain
= DECL_CHAIN (chain
);
2483 /* Return the length of a chain of nodes chained through TREE_CHAIN.
2484 We expect a null pointer to mark the end of the chain.
2485 This is the Lisp primitive `length'. */
2488 list_length (const_tree t
)
2491 #ifdef ENABLE_TREE_CHECKING
2499 #ifdef ENABLE_TREE_CHECKING
2502 gcc_assert (p
!= q
);
2510 /* Returns the first FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
2511 UNION_TYPE TYPE, or NULL_TREE if none. */
2514 first_field (const_tree type
)
2516 tree t
= TYPE_FIELDS (type
);
2517 while (t
&& TREE_CODE (t
) != FIELD_DECL
)
2522 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
2523 by modifying the last node in chain 1 to point to chain 2.
2524 This is the Lisp primitive `nconc'. */
2527 chainon (tree op1
, tree op2
)
2536 for (t1
= op1
; TREE_CHAIN (t1
); t1
= TREE_CHAIN (t1
))
2538 TREE_CHAIN (t1
) = op2
;
2540 #ifdef ENABLE_TREE_CHECKING
2543 for (t2
= op2
; t2
; t2
= TREE_CHAIN (t2
))
2544 gcc_assert (t2
!= t1
);
2551 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
2554 tree_last (tree chain
)
2558 while ((next
= TREE_CHAIN (chain
)))
2563 /* Reverse the order of elements in the chain T,
2564 and return the new head of the chain (old last element). */
2569 tree prev
= 0, decl
, next
;
2570 for (decl
= t
; decl
; decl
= next
)
2572 /* We shouldn't be using this function to reverse BLOCK chains; we
2573 have blocks_nreverse for that. */
2574 gcc_checking_assert (TREE_CODE (decl
) != BLOCK
);
2575 next
= TREE_CHAIN (decl
);
2576 TREE_CHAIN (decl
) = prev
;
2582 /* Return a newly created TREE_LIST node whose
2583 purpose and value fields are PARM and VALUE. */
2586 build_tree_list_stat (tree parm
, tree value MEM_STAT_DECL
)
2588 tree t
= make_node_stat (TREE_LIST PASS_MEM_STAT
);
2589 TREE_PURPOSE (t
) = parm
;
2590 TREE_VALUE (t
) = value
;
2594 /* Build a chain of TREE_LIST nodes from a vector. */
2597 build_tree_list_vec_stat (const vec
<tree
, va_gc
> *vec MEM_STAT_DECL
)
2599 tree ret
= NULL_TREE
;
2603 FOR_EACH_VEC_SAFE_ELT (vec
, i
, t
)
2605 *pp
= build_tree_list_stat (NULL
, t PASS_MEM_STAT
);
2606 pp
= &TREE_CHAIN (*pp
);
2611 /* Return a newly created TREE_LIST node whose
2612 purpose and value fields are PURPOSE and VALUE
2613 and whose TREE_CHAIN is CHAIN. */
2616 tree_cons_stat (tree purpose
, tree value
, tree chain MEM_STAT_DECL
)
2620 node
= ggc_alloc_tree_node_stat (sizeof (struct tree_list
) PASS_MEM_STAT
);
2621 memset (node
, 0, sizeof (struct tree_common
));
2623 record_node_allocation_statistics (TREE_LIST
, sizeof (struct tree_list
));
2625 TREE_SET_CODE (node
, TREE_LIST
);
2626 TREE_CHAIN (node
) = chain
;
2627 TREE_PURPOSE (node
) = purpose
;
2628 TREE_VALUE (node
) = value
;
2632 /* Return the values of the elements of a CONSTRUCTOR as a vector of
2636 ctor_to_vec (tree ctor
)
2638 vec
<tree
, va_gc
> *vec
;
2639 vec_alloc (vec
, CONSTRUCTOR_NELTS (ctor
));
2643 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), ix
, val
)
2644 vec
->quick_push (val
);
2649 /* Return the size nominally occupied by an object of type TYPE
2650 when it resides in memory. The value is measured in units of bytes,
2651 and its data type is that normally used for type sizes
2652 (which is the first type created by make_signed_type or
2653 make_unsigned_type). */
2656 size_in_bytes (const_tree type
)
2660 if (type
== error_mark_node
)
2661 return integer_zero_node
;
2663 type
= TYPE_MAIN_VARIANT (type
);
2664 t
= TYPE_SIZE_UNIT (type
);
2668 lang_hooks
.types
.incomplete_type_error (NULL_TREE
, type
);
2669 return size_zero_node
;
2675 /* Return the size of TYPE (in bytes) as a wide integer
2676 or return -1 if the size can vary or is larger than an integer. */
2679 int_size_in_bytes (const_tree type
)
2683 if (type
== error_mark_node
)
2686 type
= TYPE_MAIN_VARIANT (type
);
2687 t
= TYPE_SIZE_UNIT (type
);
2689 if (t
&& tree_fits_uhwi_p (t
))
2690 return TREE_INT_CST_LOW (t
);
2695 /* Return the maximum size of TYPE (in bytes) as a wide integer
2696 or return -1 if the size can vary or is larger than an integer. */
2699 max_int_size_in_bytes (const_tree type
)
2701 HOST_WIDE_INT size
= -1;
2704 /* If this is an array type, check for a possible MAX_SIZE attached. */
2706 if (TREE_CODE (type
) == ARRAY_TYPE
)
2708 size_tree
= TYPE_ARRAY_MAX_SIZE (type
);
2710 if (size_tree
&& tree_fits_uhwi_p (size_tree
))
2711 size
= tree_to_uhwi (size_tree
);
2714 /* If we still haven't been able to get a size, see if the language
2715 can compute a maximum size. */
2719 size_tree
= lang_hooks
.types
.max_size (type
);
2721 if (size_tree
&& tree_fits_uhwi_p (size_tree
))
2722 size
= tree_to_uhwi (size_tree
);
2728 /* Return the bit position of FIELD, in bits from the start of the record.
2729 This is a tree of type bitsizetype. */
2732 bit_position (const_tree field
)
2734 return bit_from_pos (DECL_FIELD_OFFSET (field
),
2735 DECL_FIELD_BIT_OFFSET (field
));
2738 /* Likewise, but return as an integer. It must be representable in
2739 that way (since it could be a signed value, we don't have the
2740 option of returning -1 like int_size_in_byte can. */
2743 int_bit_position (const_tree field
)
2745 return tree_to_shwi (bit_position (field
));
2748 /* Return the byte position of FIELD, in bytes from the start of the record.
2749 This is a tree of type sizetype. */
2752 byte_position (const_tree field
)
2754 return byte_from_pos (DECL_FIELD_OFFSET (field
),
2755 DECL_FIELD_BIT_OFFSET (field
));
2758 /* Likewise, but return as an integer. It must be representable in
2759 that way (since it could be a signed value, we don't have the
2760 option of returning -1 like int_size_in_byte can. */
2763 int_byte_position (const_tree field
)
2765 return tree_to_shwi (byte_position (field
));
2768 /* Return the strictest alignment, in bits, that T is known to have. */
2771 expr_align (const_tree t
)
2773 unsigned int align0
, align1
;
2775 switch (TREE_CODE (t
))
2777 CASE_CONVERT
: case NON_LVALUE_EXPR
:
2778 /* If we have conversions, we know that the alignment of the
2779 object must meet each of the alignments of the types. */
2780 align0
= expr_align (TREE_OPERAND (t
, 0));
2781 align1
= TYPE_ALIGN (TREE_TYPE (t
));
2782 return MAX (align0
, align1
);
2784 case SAVE_EXPR
: case COMPOUND_EXPR
: case MODIFY_EXPR
:
2785 case INIT_EXPR
: case TARGET_EXPR
: case WITH_CLEANUP_EXPR
:
2786 case CLEANUP_POINT_EXPR
:
2787 /* These don't change the alignment of an object. */
2788 return expr_align (TREE_OPERAND (t
, 0));
2791 /* The best we can do is say that the alignment is the least aligned
2793 align0
= expr_align (TREE_OPERAND (t
, 1));
2794 align1
= expr_align (TREE_OPERAND (t
, 2));
2795 return MIN (align0
, align1
);
2797 /* FIXME: LABEL_DECL and CONST_DECL never have DECL_ALIGN set
2798 meaningfully, it's always 1. */
2799 case LABEL_DECL
: case CONST_DECL
:
2800 case VAR_DECL
: case PARM_DECL
: case RESULT_DECL
:
2802 gcc_assert (DECL_ALIGN (t
) != 0);
2803 return DECL_ALIGN (t
);
2809 /* Otherwise take the alignment from that of the type. */
2810 return TYPE_ALIGN (TREE_TYPE (t
));
2813 /* Return, as a tree node, the number of elements for TYPE (which is an
2814 ARRAY_TYPE) minus one. This counts only elements of the top array. */
2817 array_type_nelts (const_tree type
)
2819 tree index_type
, min
, max
;
2821 /* If they did it with unspecified bounds, then we should have already
2822 given an error about it before we got here. */
2823 if (! TYPE_DOMAIN (type
))
2824 return error_mark_node
;
2826 index_type
= TYPE_DOMAIN (type
);
2827 min
= TYPE_MIN_VALUE (index_type
);
2828 max
= TYPE_MAX_VALUE (index_type
);
2830 /* TYPE_MAX_VALUE may not be set if the array has unknown length. */
2832 return error_mark_node
;
2834 return (integer_zerop (min
)
2836 : fold_build2 (MINUS_EXPR
, TREE_TYPE (max
), max
, min
));
2839 /* If arg is static -- a reference to an object in static storage -- then
2840 return the object. This is not the same as the C meaning of `static'.
2841 If arg isn't static, return NULL. */
2846 switch (TREE_CODE (arg
))
2849 /* Nested functions are static, even though taking their address will
2850 involve a trampoline as we unnest the nested function and create
2851 the trampoline on the tree level. */
2855 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
2856 && ! DECL_THREAD_LOCAL_P (arg
)
2857 && ! DECL_DLLIMPORT_P (arg
)
2861 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
2865 return TREE_STATIC (arg
) ? arg
: NULL
;
2872 /* If the thing being referenced is not a field, then it is
2873 something language specific. */
2874 gcc_assert (TREE_CODE (TREE_OPERAND (arg
, 1)) == FIELD_DECL
);
2876 /* If we are referencing a bitfield, we can't evaluate an
2877 ADDR_EXPR at compile time and so it isn't a constant. */
2878 if (DECL_BIT_FIELD (TREE_OPERAND (arg
, 1)))
2881 return staticp (TREE_OPERAND (arg
, 0));
2887 return TREE_CONSTANT (TREE_OPERAND (arg
, 0)) ? arg
: NULL
;
2890 case ARRAY_RANGE_REF
:
2891 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg
))) == INTEGER_CST
2892 && TREE_CODE (TREE_OPERAND (arg
, 1)) == INTEGER_CST
)
2893 return staticp (TREE_OPERAND (arg
, 0));
2897 case COMPOUND_LITERAL_EXPR
:
2898 return TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (arg
)) ? arg
: NULL
;
2908 /* Return whether OP is a DECL whose address is function-invariant. */
2911 decl_address_invariant_p (const_tree op
)
2913 /* The conditions below are slightly less strict than the one in
2916 switch (TREE_CODE (op
))
2925 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
2926 || DECL_THREAD_LOCAL_P (op
)
2927 || DECL_CONTEXT (op
) == current_function_decl
2928 || decl_function_context (op
) == current_function_decl
)
2933 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
2934 || decl_function_context (op
) == current_function_decl
)
2945 /* Return whether OP is a DECL whose address is interprocedural-invariant. */
2948 decl_address_ip_invariant_p (const_tree op
)
2950 /* The conditions below are slightly less strict than the one in
2953 switch (TREE_CODE (op
))
2961 if (((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
2962 && !DECL_DLLIMPORT_P (op
))
2963 || DECL_THREAD_LOCAL_P (op
))
2968 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
)))
2980 /* Return true if T is function-invariant (internal function, does
2981 not handle arithmetic; that's handled in skip_simple_arithmetic and
2982 tree_invariant_p). */
2984 static bool tree_invariant_p (tree t
);
2987 tree_invariant_p_1 (tree t
)
2991 if (TREE_CONSTANT (t
)
2992 || (TREE_READONLY (t
) && !TREE_SIDE_EFFECTS (t
)))
2995 switch (TREE_CODE (t
))
3001 op
= TREE_OPERAND (t
, 0);
3002 while (handled_component_p (op
))
3004 switch (TREE_CODE (op
))
3007 case ARRAY_RANGE_REF
:
3008 if (!tree_invariant_p (TREE_OPERAND (op
, 1))
3009 || TREE_OPERAND (op
, 2) != NULL_TREE
3010 || TREE_OPERAND (op
, 3) != NULL_TREE
)
3015 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
3021 op
= TREE_OPERAND (op
, 0);
3024 return CONSTANT_CLASS_P (op
) || decl_address_invariant_p (op
);
3033 /* Return true if T is function-invariant. */
3036 tree_invariant_p (tree t
)
3038 tree inner
= skip_simple_arithmetic (t
);
3039 return tree_invariant_p_1 (inner
);
3042 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
3043 Do this to any expression which may be used in more than one place,
3044 but must be evaluated only once.
3046 Normally, expand_expr would reevaluate the expression each time.
3047 Calling save_expr produces something that is evaluated and recorded
3048 the first time expand_expr is called on it. Subsequent calls to
3049 expand_expr just reuse the recorded value.
3051 The call to expand_expr that generates code that actually computes
3052 the value is the first call *at compile time*. Subsequent calls
3053 *at compile time* generate code to use the saved value.
3054 This produces correct result provided that *at run time* control
3055 always flows through the insns made by the first expand_expr
3056 before reaching the other places where the save_expr was evaluated.
3057 You, the caller of save_expr, must make sure this is so.
3059 Constants, and certain read-only nodes, are returned with no
3060 SAVE_EXPR because that is safe. Expressions containing placeholders
3061 are not touched; see tree.def for an explanation of what these
3065 save_expr (tree expr
)
3067 tree t
= fold (expr
);
3070 /* If the tree evaluates to a constant, then we don't want to hide that
3071 fact (i.e. this allows further folding, and direct checks for constants).
3072 However, a read-only object that has side effects cannot be bypassed.
3073 Since it is no problem to reevaluate literals, we just return the
3075 inner
= skip_simple_arithmetic (t
);
3076 if (TREE_CODE (inner
) == ERROR_MARK
)
3079 if (tree_invariant_p_1 (inner
))
3082 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
3083 it means that the size or offset of some field of an object depends on
3084 the value within another field.
3086 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
3087 and some variable since it would then need to be both evaluated once and
3088 evaluated more than once. Front-ends must assure this case cannot
3089 happen by surrounding any such subexpressions in their own SAVE_EXPR
3090 and forcing evaluation at the proper time. */
3091 if (contains_placeholder_p (inner
))
3094 t
= build1 (SAVE_EXPR
, TREE_TYPE (expr
), t
);
3095 SET_EXPR_LOCATION (t
, EXPR_LOCATION (expr
));
3097 /* This expression might be placed ahead of a jump to ensure that the
3098 value was computed on both sides of the jump. So make sure it isn't
3099 eliminated as dead. */
3100 TREE_SIDE_EFFECTS (t
) = 1;
3104 /* Look inside EXPR into any simple arithmetic operations. Return the
3105 outermost non-arithmetic or non-invariant node. */
3108 skip_simple_arithmetic (tree expr
)
3110 /* We don't care about whether this can be used as an lvalue in this
3112 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
3113 expr
= TREE_OPERAND (expr
, 0);
3115 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
3116 a constant, it will be more efficient to not make another SAVE_EXPR since
3117 it will allow better simplification and GCSE will be able to merge the
3118 computations if they actually occur. */
3121 if (UNARY_CLASS_P (expr
))
3122 expr
= TREE_OPERAND (expr
, 0);
3123 else if (BINARY_CLASS_P (expr
))
3125 if (tree_invariant_p (TREE_OPERAND (expr
, 1)))
3126 expr
= TREE_OPERAND (expr
, 0);
3127 else if (tree_invariant_p (TREE_OPERAND (expr
, 0)))
3128 expr
= TREE_OPERAND (expr
, 1);
3139 /* Look inside EXPR into simple arithmetic operations involving constants.
3140 Return the outermost non-arithmetic or non-constant node. */
3143 skip_simple_constant_arithmetic (tree expr
)
3145 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
3146 expr
= TREE_OPERAND (expr
, 0);
3150 if (UNARY_CLASS_P (expr
))
3151 expr
= TREE_OPERAND (expr
, 0);
3152 else if (BINARY_CLASS_P (expr
))
3154 if (TREE_CONSTANT (TREE_OPERAND (expr
, 1)))
3155 expr
= TREE_OPERAND (expr
, 0);
3156 else if (TREE_CONSTANT (TREE_OPERAND (expr
, 0)))
3157 expr
= TREE_OPERAND (expr
, 1);
3168 /* Return which tree structure is used by T. */
3170 enum tree_node_structure_enum
3171 tree_node_structure (const_tree t
)
3173 const enum tree_code code
= TREE_CODE (t
);
3174 return tree_node_structure_for_code (code
);
3177 /* Set various status flags when building a CALL_EXPR object T. */
3180 process_call_operands (tree t
)
3182 bool side_effects
= TREE_SIDE_EFFECTS (t
);
3183 bool read_only
= false;
3184 int i
= call_expr_flags (t
);
3186 /* Calls have side-effects, except those to const or pure functions. */
3187 if ((i
& ECF_LOOPING_CONST_OR_PURE
) || !(i
& (ECF_CONST
| ECF_PURE
)))
3188 side_effects
= true;
3189 /* Propagate TREE_READONLY of arguments for const functions. */
3193 if (!side_effects
|| read_only
)
3194 for (i
= 1; i
< TREE_OPERAND_LENGTH (t
); i
++)
3196 tree op
= TREE_OPERAND (t
, i
);
3197 if (op
&& TREE_SIDE_EFFECTS (op
))
3198 side_effects
= true;
3199 if (op
&& !TREE_READONLY (op
) && !CONSTANT_CLASS_P (op
))
3203 TREE_SIDE_EFFECTS (t
) = side_effects
;
3204 TREE_READONLY (t
) = read_only
;
3207 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
3208 size or offset that depends on a field within a record. */
3211 contains_placeholder_p (const_tree exp
)
3213 enum tree_code code
;
3218 code
= TREE_CODE (exp
);
3219 if (code
== PLACEHOLDER_EXPR
)
3222 switch (TREE_CODE_CLASS (code
))
3225 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
3226 position computations since they will be converted into a
3227 WITH_RECORD_EXPR involving the reference, which will assume
3228 here will be valid. */
3229 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
3231 case tcc_exceptional
:
3232 if (code
== TREE_LIST
)
3233 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp
))
3234 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp
)));
3239 case tcc_comparison
:
3240 case tcc_expression
:
3244 /* Ignoring the first operand isn't quite right, but works best. */
3245 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1));
3248 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
3249 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1))
3250 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 2)));
3253 /* The save_expr function never wraps anything containing
3254 a PLACEHOLDER_EXPR. */
3261 switch (TREE_CODE_LENGTH (code
))
3264 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
3266 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
3267 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1)));
3278 const_call_expr_arg_iterator iter
;
3279 FOR_EACH_CONST_CALL_EXPR_ARG (arg
, iter
, exp
)
3280 if (CONTAINS_PLACEHOLDER_P (arg
))
3294 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
3295 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
3299 type_contains_placeholder_1 (const_tree type
)
3301 /* If the size contains a placeholder or the parent type (component type in
3302 the case of arrays) type involves a placeholder, this type does. */
3303 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type
))
3304 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type
))
3305 || (!POINTER_TYPE_P (type
)
3307 && type_contains_placeholder_p (TREE_TYPE (type
))))
3310 /* Now do type-specific checks. Note that the last part of the check above
3311 greatly limits what we have to do below. */
3312 switch (TREE_CODE (type
))
3320 case REFERENCE_TYPE
:
3329 case FIXED_POINT_TYPE
:
3330 /* Here we just check the bounds. */
3331 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type
))
3332 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type
)));
3335 /* We have already checked the component type above, so just check the
3337 return type_contains_placeholder_p (TYPE_DOMAIN (type
));
3341 case QUAL_UNION_TYPE
:
3345 for (field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
3346 if (TREE_CODE (field
) == FIELD_DECL
3347 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field
))
3348 || (TREE_CODE (type
) == QUAL_UNION_TYPE
3349 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field
)))
3350 || type_contains_placeholder_p (TREE_TYPE (field
))))
3361 /* Wrapper around above function used to cache its result. */
3364 type_contains_placeholder_p (tree type
)
3368 /* If the contains_placeholder_bits field has been initialized,
3369 then we know the answer. */
3370 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) > 0)
3371 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) - 1;
3373 /* Indicate that we've seen this type node, and the answer is false.
3374 This is what we want to return if we run into recursion via fields. */
3375 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = 1;
3377 /* Compute the real value. */
3378 result
= type_contains_placeholder_1 (type
);
3380 /* Store the real value. */
3381 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = result
+ 1;
3386 /* Push tree EXP onto vector QUEUE if it is not already present. */
3389 push_without_duplicates (tree exp
, vec
<tree
> *queue
)
3394 FOR_EACH_VEC_ELT (*queue
, i
, iter
)
3395 if (simple_cst_equal (iter
, exp
) == 1)
3399 queue
->safe_push (exp
);
3402 /* Given a tree EXP, find all occurrences of references to fields
3403 in a PLACEHOLDER_EXPR and place them in vector REFS without
3404 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
3405 we assume here that EXP contains only arithmetic expressions
3406 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
3410 find_placeholder_in_expr (tree exp
, vec
<tree
> *refs
)
3412 enum tree_code code
= TREE_CODE (exp
);
3416 /* We handle TREE_LIST and COMPONENT_REF separately. */
3417 if (code
== TREE_LIST
)
3419 FIND_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), refs
);
3420 FIND_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), refs
);
3422 else if (code
== COMPONENT_REF
)
3424 for (inner
= TREE_OPERAND (exp
, 0);
3425 REFERENCE_CLASS_P (inner
);
3426 inner
= TREE_OPERAND (inner
, 0))
3429 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
)
3430 push_without_duplicates (exp
, refs
);
3432 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), refs
);
3435 switch (TREE_CODE_CLASS (code
))
3440 case tcc_declaration
:
3441 /* Variables allocated to static storage can stay. */
3442 if (!TREE_STATIC (exp
))
3443 push_without_duplicates (exp
, refs
);
3446 case tcc_expression
:
3447 /* This is the pattern built in ada/make_aligning_type. */
3448 if (code
== ADDR_EXPR
3449 && TREE_CODE (TREE_OPERAND (exp
, 0)) == PLACEHOLDER_EXPR
)
3451 push_without_duplicates (exp
, refs
);
3455 /* Fall through... */
3457 case tcc_exceptional
:
3460 case tcc_comparison
:
3462 for (i
= 0; i
< TREE_CODE_LENGTH (code
); i
++)
3463 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
3467 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3468 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
3476 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
3477 return a tree with all occurrences of references to F in a
3478 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
3479 CONST_DECLs. Note that we assume here that EXP contains only
3480 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
3481 occurring only in their argument list. */
3484 substitute_in_expr (tree exp
, tree f
, tree r
)
3486 enum tree_code code
= TREE_CODE (exp
);
3487 tree op0
, op1
, op2
, op3
;
3490 /* We handle TREE_LIST and COMPONENT_REF separately. */
3491 if (code
== TREE_LIST
)
3493 op0
= SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp
), f
, r
);
3494 op1
= SUBSTITUTE_IN_EXPR (TREE_VALUE (exp
), f
, r
);
3495 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
3498 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
3500 else if (code
== COMPONENT_REF
)
3504 /* If this expression is getting a value from a PLACEHOLDER_EXPR
3505 and it is the right field, replace it with R. */
3506 for (inner
= TREE_OPERAND (exp
, 0);
3507 REFERENCE_CLASS_P (inner
);
3508 inner
= TREE_OPERAND (inner
, 0))
3512 op1
= TREE_OPERAND (exp
, 1);
3514 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& op1
== f
)
3517 /* If this expression hasn't been completed let, leave it alone. */
3518 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& !TREE_TYPE (inner
))
3521 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3522 if (op0
== TREE_OPERAND (exp
, 0))
3526 = fold_build3 (COMPONENT_REF
, TREE_TYPE (exp
), op0
, op1
, NULL_TREE
);
3529 switch (TREE_CODE_CLASS (code
))
3534 case tcc_declaration
:
3540 case tcc_expression
:
3544 /* Fall through... */
3546 case tcc_exceptional
:
3549 case tcc_comparison
:
3551 switch (TREE_CODE_LENGTH (code
))
3557 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3558 if (op0
== TREE_OPERAND (exp
, 0))
3561 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
3565 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3566 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3568 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
3571 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
3575 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3576 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3577 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
3579 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3580 && op2
== TREE_OPERAND (exp
, 2))
3583 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
3587 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3588 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3589 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
3590 op3
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 3), f
, r
);
3592 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3593 && op2
== TREE_OPERAND (exp
, 2)
3594 && op3
== TREE_OPERAND (exp
, 3))
3598 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
3610 new_tree
= NULL_TREE
;
3612 /* If we are trying to replace F with a constant, inline back
3613 functions which do nothing else than computing a value from
3614 the arguments they are passed. This makes it possible to
3615 fold partially or entirely the replacement expression. */
3616 if (CONSTANT_CLASS_P (r
) && code
== CALL_EXPR
)
3618 tree t
= maybe_inline_call_in_expr (exp
);
3620 return SUBSTITUTE_IN_EXPR (t
, f
, r
);
3623 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3625 tree op
= TREE_OPERAND (exp
, i
);
3626 tree new_op
= SUBSTITUTE_IN_EXPR (op
, f
, r
);
3630 new_tree
= copy_node (exp
);
3631 TREE_OPERAND (new_tree
, i
) = new_op
;
3637 new_tree
= fold (new_tree
);
3638 if (TREE_CODE (new_tree
) == CALL_EXPR
)
3639 process_call_operands (new_tree
);
3650 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
3652 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
3653 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
3658 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
3659 for it within OBJ, a tree that is an object or a chain of references. */
3662 substitute_placeholder_in_expr (tree exp
, tree obj
)
3664 enum tree_code code
= TREE_CODE (exp
);
3665 tree op0
, op1
, op2
, op3
;
3668 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
3669 in the chain of OBJ. */
3670 if (code
== PLACEHOLDER_EXPR
)
3672 tree need_type
= TYPE_MAIN_VARIANT (TREE_TYPE (exp
));
3675 for (elt
= obj
; elt
!= 0;
3676 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
3677 || TREE_CODE (elt
) == COND_EXPR
)
3678 ? TREE_OPERAND (elt
, 1)
3679 : (REFERENCE_CLASS_P (elt
)
3680 || UNARY_CLASS_P (elt
)
3681 || BINARY_CLASS_P (elt
)
3682 || VL_EXP_CLASS_P (elt
)
3683 || EXPRESSION_CLASS_P (elt
))
3684 ? TREE_OPERAND (elt
, 0) : 0))
3685 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt
)) == need_type
)
3688 for (elt
= obj
; elt
!= 0;
3689 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
3690 || TREE_CODE (elt
) == COND_EXPR
)
3691 ? TREE_OPERAND (elt
, 1)
3692 : (REFERENCE_CLASS_P (elt
)
3693 || UNARY_CLASS_P (elt
)
3694 || BINARY_CLASS_P (elt
)
3695 || VL_EXP_CLASS_P (elt
)
3696 || EXPRESSION_CLASS_P (elt
))
3697 ? TREE_OPERAND (elt
, 0) : 0))
3698 if (POINTER_TYPE_P (TREE_TYPE (elt
))
3699 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt
)))
3701 return fold_build1 (INDIRECT_REF
, need_type
, elt
);
3703 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
3704 survives until RTL generation, there will be an error. */
3708 /* TREE_LIST is special because we need to look at TREE_VALUE
3709 and TREE_CHAIN, not TREE_OPERANDS. */
3710 else if (code
== TREE_LIST
)
3712 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), obj
);
3713 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), obj
);
3714 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
3717 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
3720 switch (TREE_CODE_CLASS (code
))
3723 case tcc_declaration
:
3726 case tcc_exceptional
:
3729 case tcc_comparison
:
3730 case tcc_expression
:
3733 switch (TREE_CODE_LENGTH (code
))
3739 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3740 if (op0
== TREE_OPERAND (exp
, 0))
3743 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
3747 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3748 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
3750 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
3753 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
3757 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3758 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
3759 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
3761 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3762 && op2
== TREE_OPERAND (exp
, 2))
3765 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
3769 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3770 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
3771 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
3772 op3
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 3), obj
);
3774 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3775 && op2
== TREE_OPERAND (exp
, 2)
3776 && op3
== TREE_OPERAND (exp
, 3))
3780 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
3792 new_tree
= NULL_TREE
;
3794 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3796 tree op
= TREE_OPERAND (exp
, i
);
3797 tree new_op
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (op
, obj
);
3801 new_tree
= copy_node (exp
);
3802 TREE_OPERAND (new_tree
, i
) = new_op
;
3808 new_tree
= fold (new_tree
);
3809 if (TREE_CODE (new_tree
) == CALL_EXPR
)
3810 process_call_operands (new_tree
);
3821 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
3823 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
3824 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
3830 /* Subroutine of stabilize_reference; this is called for subtrees of
3831 references. Any expression with side-effects must be put in a SAVE_EXPR
3832 to ensure that it is only evaluated once.
3834 We don't put SAVE_EXPR nodes around everything, because assigning very
3835 simple expressions to temporaries causes us to miss good opportunities
3836 for optimizations. Among other things, the opportunity to fold in the
3837 addition of a constant into an addressing mode often gets lost, e.g.
3838 "y[i+1] += x;". In general, we take the approach that we should not make
3839 an assignment unless we are forced into it - i.e., that any non-side effect
3840 operator should be allowed, and that cse should take care of coalescing
3841 multiple utterances of the same expression should that prove fruitful. */
3844 stabilize_reference_1 (tree e
)
3847 enum tree_code code
= TREE_CODE (e
);
3849 /* We cannot ignore const expressions because it might be a reference
3850 to a const array but whose index contains side-effects. But we can
3851 ignore things that are actual constant or that already have been
3852 handled by this function. */
3854 if (tree_invariant_p (e
))
3857 switch (TREE_CODE_CLASS (code
))
3859 case tcc_exceptional
:
3861 case tcc_declaration
:
3862 case tcc_comparison
:
3864 case tcc_expression
:
3867 /* If the expression has side-effects, then encase it in a SAVE_EXPR
3868 so that it will only be evaluated once. */
3869 /* The reference (r) and comparison (<) classes could be handled as
3870 below, but it is generally faster to only evaluate them once. */
3871 if (TREE_SIDE_EFFECTS (e
))
3872 return save_expr (e
);
3876 /* Constants need no processing. In fact, we should never reach
3881 /* Division is slow and tends to be compiled with jumps,
3882 especially the division by powers of 2 that is often
3883 found inside of an array reference. So do it just once. */
3884 if (code
== TRUNC_DIV_EXPR
|| code
== TRUNC_MOD_EXPR
3885 || code
== FLOOR_DIV_EXPR
|| code
== FLOOR_MOD_EXPR
3886 || code
== CEIL_DIV_EXPR
|| code
== CEIL_MOD_EXPR
3887 || code
== ROUND_DIV_EXPR
|| code
== ROUND_MOD_EXPR
)
3888 return save_expr (e
);
3889 /* Recursively stabilize each operand. */
3890 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)),
3891 stabilize_reference_1 (TREE_OPERAND (e
, 1)));
3895 /* Recursively stabilize each operand. */
3896 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)));
3903 TREE_TYPE (result
) = TREE_TYPE (e
);
3904 TREE_READONLY (result
) = TREE_READONLY (e
);
3905 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (e
);
3906 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (e
);
3911 /* Stabilize a reference so that we can use it any number of times
3912 without causing its operands to be evaluated more than once.
3913 Returns the stabilized reference. This works by means of save_expr,
3914 so see the caveats in the comments about save_expr.
3916 Also allows conversion expressions whose operands are references.
3917 Any other kind of expression is returned unchanged. */
3920 stabilize_reference (tree ref
)
3923 enum tree_code code
= TREE_CODE (ref
);
3930 /* No action is needed in this case. */
3935 case FIX_TRUNC_EXPR
:
3936 result
= build_nt (code
, stabilize_reference (TREE_OPERAND (ref
, 0)));
3940 result
= build_nt (INDIRECT_REF
,
3941 stabilize_reference_1 (TREE_OPERAND (ref
, 0)));
3945 result
= build_nt (COMPONENT_REF
,
3946 stabilize_reference (TREE_OPERAND (ref
, 0)),
3947 TREE_OPERAND (ref
, 1), NULL_TREE
);
3951 result
= build_nt (BIT_FIELD_REF
,
3952 stabilize_reference (TREE_OPERAND (ref
, 0)),
3953 TREE_OPERAND (ref
, 1), TREE_OPERAND (ref
, 2));
3957 result
= build_nt (ARRAY_REF
,
3958 stabilize_reference (TREE_OPERAND (ref
, 0)),
3959 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
3960 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
3963 case ARRAY_RANGE_REF
:
3964 result
= build_nt (ARRAY_RANGE_REF
,
3965 stabilize_reference (TREE_OPERAND (ref
, 0)),
3966 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
3967 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
3971 /* We cannot wrap the first expression in a SAVE_EXPR, as then
3972 it wouldn't be ignored. This matters when dealing with
3974 return stabilize_reference_1 (ref
);
3976 /* If arg isn't a kind of lvalue we recognize, make no change.
3977 Caller should recognize the error for an invalid lvalue. */
3982 return error_mark_node
;
3985 TREE_TYPE (result
) = TREE_TYPE (ref
);
3986 TREE_READONLY (result
) = TREE_READONLY (ref
);
3987 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (ref
);
3988 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (ref
);
3993 /* Low-level constructors for expressions. */
3995 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
3996 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
3999 recompute_tree_invariant_for_addr_expr (tree t
)
4002 bool tc
= true, se
= false;
4004 /* We started out assuming this address is both invariant and constant, but
4005 does not have side effects. Now go down any handled components and see if
4006 any of them involve offsets that are either non-constant or non-invariant.
4007 Also check for side-effects.
4009 ??? Note that this code makes no attempt to deal with the case where
4010 taking the address of something causes a copy due to misalignment. */
4012 #define UPDATE_FLAGS(NODE) \
4013 do { tree _node = (NODE); \
4014 if (_node && !TREE_CONSTANT (_node)) tc = false; \
4015 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
4017 for (node
= TREE_OPERAND (t
, 0); handled_component_p (node
);
4018 node
= TREE_OPERAND (node
, 0))
4020 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
4021 array reference (probably made temporarily by the G++ front end),
4022 so ignore all the operands. */
4023 if ((TREE_CODE (node
) == ARRAY_REF
4024 || TREE_CODE (node
) == ARRAY_RANGE_REF
)
4025 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node
, 0))) == ARRAY_TYPE
)
4027 UPDATE_FLAGS (TREE_OPERAND (node
, 1));
4028 if (TREE_OPERAND (node
, 2))
4029 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
4030 if (TREE_OPERAND (node
, 3))
4031 UPDATE_FLAGS (TREE_OPERAND (node
, 3));
4033 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
4034 FIELD_DECL, apparently. The G++ front end can put something else
4035 there, at least temporarily. */
4036 else if (TREE_CODE (node
) == COMPONENT_REF
4037 && TREE_CODE (TREE_OPERAND (node
, 1)) == FIELD_DECL
)
4039 if (TREE_OPERAND (node
, 2))
4040 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
4044 node
= lang_hooks
.expr_to_decl (node
, &tc
, &se
);
4046 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
4047 the address, since &(*a)->b is a form of addition. If it's a constant, the
4048 address is constant too. If it's a decl, its address is constant if the
4049 decl is static. Everything else is not constant and, furthermore,
4050 taking the address of a volatile variable is not volatile. */
4051 if (TREE_CODE (node
) == INDIRECT_REF
4052 || TREE_CODE (node
) == MEM_REF
)
4053 UPDATE_FLAGS (TREE_OPERAND (node
, 0));
4054 else if (CONSTANT_CLASS_P (node
))
4056 else if (DECL_P (node
))
4057 tc
&= (staticp (node
) != NULL_TREE
);
4061 se
|= TREE_SIDE_EFFECTS (node
);
4065 TREE_CONSTANT (t
) = tc
;
4066 TREE_SIDE_EFFECTS (t
) = se
;
4070 /* Build an expression of code CODE, data type TYPE, and operands as
4071 specified. Expressions and reference nodes can be created this way.
4072 Constants, decls, types and misc nodes cannot be.
4074 We define 5 non-variadic functions, from 0 to 4 arguments. This is
4075 enough for all extant tree codes. */
4078 build0_stat (enum tree_code code
, tree tt MEM_STAT_DECL
)
4082 gcc_assert (TREE_CODE_LENGTH (code
) == 0);
4084 t
= make_node_stat (code PASS_MEM_STAT
);
4091 build1_stat (enum tree_code code
, tree type
, tree node MEM_STAT_DECL
)
4093 int length
= sizeof (struct tree_exp
);
4096 record_node_allocation_statistics (code
, length
);
4098 gcc_assert (TREE_CODE_LENGTH (code
) == 1);
4100 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
4102 memset (t
, 0, sizeof (struct tree_common
));
4104 TREE_SET_CODE (t
, code
);
4106 TREE_TYPE (t
) = type
;
4107 SET_EXPR_LOCATION (t
, UNKNOWN_LOCATION
);
4108 TREE_OPERAND (t
, 0) = node
;
4109 if (node
&& !TYPE_P (node
))
4111 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (node
);
4112 TREE_READONLY (t
) = TREE_READONLY (node
);
4115 if (TREE_CODE_CLASS (code
) == tcc_statement
)
4116 TREE_SIDE_EFFECTS (t
) = 1;
4120 /* All of these have side-effects, no matter what their
4122 TREE_SIDE_EFFECTS (t
) = 1;
4123 TREE_READONLY (t
) = 0;
4127 /* Whether a dereference is readonly has nothing to do with whether
4128 its operand is readonly. */
4129 TREE_READONLY (t
) = 0;
4134 recompute_tree_invariant_for_addr_expr (t
);
4138 if ((TREE_CODE_CLASS (code
) == tcc_unary
|| code
== VIEW_CONVERT_EXPR
)
4139 && node
&& !TYPE_P (node
)
4140 && TREE_CONSTANT (node
))
4141 TREE_CONSTANT (t
) = 1;
4142 if (TREE_CODE_CLASS (code
) == tcc_reference
4143 && node
&& TREE_THIS_VOLATILE (node
))
4144 TREE_THIS_VOLATILE (t
) = 1;
4151 #define PROCESS_ARG(N) \
4153 TREE_OPERAND (t, N) = arg##N; \
4154 if (arg##N &&!TYPE_P (arg##N)) \
4156 if (TREE_SIDE_EFFECTS (arg##N)) \
4158 if (!TREE_READONLY (arg##N) \
4159 && !CONSTANT_CLASS_P (arg##N)) \
4160 (void) (read_only = 0); \
4161 if (!TREE_CONSTANT (arg##N)) \
4162 (void) (constant = 0); \
4167 build2_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1 MEM_STAT_DECL
)
4169 bool constant
, read_only
, side_effects
;
4172 gcc_assert (TREE_CODE_LENGTH (code
) == 2);
4174 if ((code
== MINUS_EXPR
|| code
== PLUS_EXPR
|| code
== MULT_EXPR
)
4175 && arg0
&& arg1
&& tt
&& POINTER_TYPE_P (tt
)
4176 /* When sizetype precision doesn't match that of pointers
4177 we need to be able to build explicit extensions or truncations
4178 of the offset argument. */
4179 && TYPE_PRECISION (sizetype
) == TYPE_PRECISION (tt
))
4180 gcc_assert (TREE_CODE (arg0
) == INTEGER_CST
4181 && TREE_CODE (arg1
) == INTEGER_CST
);
4183 if (code
== POINTER_PLUS_EXPR
&& arg0
&& arg1
&& tt
)
4184 gcc_assert (POINTER_TYPE_P (tt
) && POINTER_TYPE_P (TREE_TYPE (arg0
))
4185 && ptrofftype_p (TREE_TYPE (arg1
)));
4187 t
= make_node_stat (code PASS_MEM_STAT
);
4190 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
4191 result based on those same flags for the arguments. But if the
4192 arguments aren't really even `tree' expressions, we shouldn't be trying
4195 /* Expressions without side effects may be constant if their
4196 arguments are as well. */
4197 constant
= (TREE_CODE_CLASS (code
) == tcc_comparison
4198 || TREE_CODE_CLASS (code
) == tcc_binary
);
4200 side_effects
= TREE_SIDE_EFFECTS (t
);
4205 TREE_READONLY (t
) = read_only
;
4206 TREE_CONSTANT (t
) = constant
;
4207 TREE_SIDE_EFFECTS (t
) = side_effects
;
4208 TREE_THIS_VOLATILE (t
)
4209 = (TREE_CODE_CLASS (code
) == tcc_reference
4210 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4217 build3_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4218 tree arg2 MEM_STAT_DECL
)
4220 bool constant
, read_only
, side_effects
;
4223 gcc_assert (TREE_CODE_LENGTH (code
) == 3);
4224 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
4226 t
= make_node_stat (code PASS_MEM_STAT
);
4231 /* As a special exception, if COND_EXPR has NULL branches, we
4232 assume that it is a gimple statement and always consider
4233 it to have side effects. */
4234 if (code
== COND_EXPR
4235 && tt
== void_type_node
4236 && arg1
== NULL_TREE
4237 && arg2
== NULL_TREE
)
4238 side_effects
= true;
4240 side_effects
= TREE_SIDE_EFFECTS (t
);
4246 if (code
== COND_EXPR
)
4247 TREE_READONLY (t
) = read_only
;
4249 TREE_SIDE_EFFECTS (t
) = side_effects
;
4250 TREE_THIS_VOLATILE (t
)
4251 = (TREE_CODE_CLASS (code
) == tcc_reference
4252 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4258 build4_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4259 tree arg2
, tree arg3 MEM_STAT_DECL
)
4261 bool constant
, read_only
, side_effects
;
4264 gcc_assert (TREE_CODE_LENGTH (code
) == 4);
4266 t
= make_node_stat (code PASS_MEM_STAT
);
4269 side_effects
= TREE_SIDE_EFFECTS (t
);
4276 TREE_SIDE_EFFECTS (t
) = side_effects
;
4277 TREE_THIS_VOLATILE (t
)
4278 = (TREE_CODE_CLASS (code
) == tcc_reference
4279 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4285 build5_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4286 tree arg2
, tree arg3
, tree arg4 MEM_STAT_DECL
)
4288 bool constant
, read_only
, side_effects
;
4291 gcc_assert (TREE_CODE_LENGTH (code
) == 5);
4293 t
= make_node_stat (code PASS_MEM_STAT
);
4296 side_effects
= TREE_SIDE_EFFECTS (t
);
4304 TREE_SIDE_EFFECTS (t
) = side_effects
;
4305 TREE_THIS_VOLATILE (t
)
4306 = (TREE_CODE_CLASS (code
) == tcc_reference
4307 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4312 /* Build a simple MEM_REF tree with the sematics of a plain INDIRECT_REF
4313 on the pointer PTR. */
4316 build_simple_mem_ref_loc (location_t loc
, tree ptr
)
4318 HOST_WIDE_INT offset
= 0;
4319 tree ptype
= TREE_TYPE (ptr
);
4321 /* For convenience allow addresses that collapse to a simple base
4323 if (TREE_CODE (ptr
) == ADDR_EXPR
4324 && (handled_component_p (TREE_OPERAND (ptr
, 0))
4325 || TREE_CODE (TREE_OPERAND (ptr
, 0)) == MEM_REF
))
4327 ptr
= get_addr_base_and_unit_offset (TREE_OPERAND (ptr
, 0), &offset
);
4329 ptr
= build_fold_addr_expr (ptr
);
4330 gcc_assert (is_gimple_reg (ptr
) || is_gimple_min_invariant (ptr
));
4332 tem
= build2 (MEM_REF
, TREE_TYPE (ptype
),
4333 ptr
, build_int_cst (ptype
, offset
));
4334 SET_EXPR_LOCATION (tem
, loc
);
4338 /* Return the constant offset of a MEM_REF or TARGET_MEM_REF tree T. */
4341 mem_ref_offset (const_tree t
)
4343 return offset_int::from (TREE_OPERAND (t
, 1), SIGNED
);
4346 /* Return an invariant ADDR_EXPR of type TYPE taking the address of BASE
4347 offsetted by OFFSET units. */
4350 build_invariant_address (tree type
, tree base
, HOST_WIDE_INT offset
)
4352 tree ref
= fold_build2 (MEM_REF
, TREE_TYPE (type
),
4353 build_fold_addr_expr (base
),
4354 build_int_cst (ptr_type_node
, offset
));
4355 tree addr
= build1 (ADDR_EXPR
, type
, ref
);
4356 recompute_tree_invariant_for_addr_expr (addr
);
4360 /* Similar except don't specify the TREE_TYPE
4361 and leave the TREE_SIDE_EFFECTS as 0.
4362 It is permissible for arguments to be null,
4363 or even garbage if their values do not matter. */
4366 build_nt (enum tree_code code
, ...)
4373 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
4377 t
= make_node (code
);
4378 length
= TREE_CODE_LENGTH (code
);
4380 for (i
= 0; i
< length
; i
++)
4381 TREE_OPERAND (t
, i
) = va_arg (p
, tree
);
4387 /* Similar to build_nt, but for creating a CALL_EXPR object with a
4391 build_nt_call_vec (tree fn
, vec
<tree
, va_gc
> *args
)
4396 ret
= build_vl_exp (CALL_EXPR
, vec_safe_length (args
) + 3);
4397 CALL_EXPR_FN (ret
) = fn
;
4398 CALL_EXPR_STATIC_CHAIN (ret
) = NULL_TREE
;
4399 FOR_EACH_VEC_SAFE_ELT (args
, ix
, t
)
4400 CALL_EXPR_ARG (ret
, ix
) = t
;
4404 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
4405 We do NOT enter this node in any sort of symbol table.
4407 LOC is the location of the decl.
4409 layout_decl is used to set up the decl's storage layout.
4410 Other slots are initialized to 0 or null pointers. */
4413 build_decl_stat (location_t loc
, enum tree_code code
, tree name
,
4414 tree type MEM_STAT_DECL
)
4418 t
= make_node_stat (code PASS_MEM_STAT
);
4419 DECL_SOURCE_LOCATION (t
) = loc
;
4421 /* if (type == error_mark_node)
4422 type = integer_type_node; */
4423 /* That is not done, deliberately, so that having error_mark_node
4424 as the type can suppress useless errors in the use of this variable. */
4426 DECL_NAME (t
) = name
;
4427 TREE_TYPE (t
) = type
;
4429 if (code
== VAR_DECL
|| code
== PARM_DECL
|| code
== RESULT_DECL
)
4435 /* Builds and returns function declaration with NAME and TYPE. */
4438 build_fn_decl (const char *name
, tree type
)
4440 tree id
= get_identifier (name
);
4441 tree decl
= build_decl (input_location
, FUNCTION_DECL
, id
, type
);
4443 DECL_EXTERNAL (decl
) = 1;
4444 TREE_PUBLIC (decl
) = 1;
4445 DECL_ARTIFICIAL (decl
) = 1;
4446 TREE_NOTHROW (decl
) = 1;
4451 vec
<tree
, va_gc
> *all_translation_units
;
4453 /* Builds a new translation-unit decl with name NAME, queues it in the
4454 global list of translation-unit decls and returns it. */
4457 build_translation_unit_decl (tree name
)
4459 tree tu
= build_decl (UNKNOWN_LOCATION
, TRANSLATION_UNIT_DECL
,
4461 TRANSLATION_UNIT_LANGUAGE (tu
) = lang_hooks
.name
;
4462 vec_safe_push (all_translation_units
, tu
);
4467 /* BLOCK nodes are used to represent the structure of binding contours
4468 and declarations, once those contours have been exited and their contents
4469 compiled. This information is used for outputting debugging info. */
4472 build_block (tree vars
, tree subblocks
, tree supercontext
, tree chain
)
4474 tree block
= make_node (BLOCK
);
4476 BLOCK_VARS (block
) = vars
;
4477 BLOCK_SUBBLOCKS (block
) = subblocks
;
4478 BLOCK_SUPERCONTEXT (block
) = supercontext
;
4479 BLOCK_CHAIN (block
) = chain
;
4484 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
4486 LOC is the location to use in tree T. */
4489 protected_set_expr_location (tree t
, location_t loc
)
4491 if (t
&& CAN_HAVE_LOCATION_P (t
))
4492 SET_EXPR_LOCATION (t
, loc
);
4495 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
4499 build_decl_attribute_variant (tree ddecl
, tree attribute
)
4501 DECL_ATTRIBUTES (ddecl
) = attribute
;
4505 /* Borrowed from hashtab.c iterative_hash implementation. */
4506 #define mix(a,b,c) \
4508 a -= b; a -= c; a ^= (c>>13); \
4509 b -= c; b -= a; b ^= (a<< 8); \
4510 c -= a; c -= b; c ^= ((b&0xffffffff)>>13); \
4511 a -= b; a -= c; a ^= ((c&0xffffffff)>>12); \
4512 b -= c; b -= a; b = (b ^ (a<<16)) & 0xffffffff; \
4513 c -= a; c -= b; c = (c ^ (b>> 5)) & 0xffffffff; \
4514 a -= b; a -= c; a = (a ^ (c>> 3)) & 0xffffffff; \
4515 b -= c; b -= a; b = (b ^ (a<<10)) & 0xffffffff; \
4516 c -= a; c -= b; c = (c ^ (b>>15)) & 0xffffffff; \
4520 /* Produce good hash value combining VAL and VAL2. */
4522 iterative_hash_hashval_t (hashval_t val
, hashval_t val2
)
4524 /* the golden ratio; an arbitrary value. */
4525 hashval_t a
= 0x9e3779b9;
4531 /* Produce good hash value combining VAL and VAL2. */
4533 iterative_hash_host_wide_int (HOST_WIDE_INT val
, hashval_t val2
)
4535 if (sizeof (HOST_WIDE_INT
) == sizeof (hashval_t
))
4536 return iterative_hash_hashval_t (val
, val2
);
4539 hashval_t a
= (hashval_t
) val
;
4540 /* Avoid warnings about shifting of more than the width of the type on
4541 hosts that won't execute this path. */
4543 hashval_t b
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 8 + zero
));
4545 if (sizeof (HOST_WIDE_INT
) > 2 * sizeof (hashval_t
))
4547 hashval_t a
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 16 + zero
));
4548 hashval_t b
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 24 + zero
));
4555 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4556 is ATTRIBUTE and its qualifiers are QUALS.
4558 Record such modified types already made so we don't make duplicates. */
4561 build_type_attribute_qual_variant (tree ttype
, tree attribute
, int quals
)
4563 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype
), attribute
))
4565 hashval_t hashcode
= 0;
4569 enum tree_code code
= TREE_CODE (ttype
);
4571 /* Building a distinct copy of a tagged type is inappropriate; it
4572 causes breakage in code that expects there to be a one-to-one
4573 relationship between a struct and its fields.
4574 build_duplicate_type is another solution (as used in
4575 handle_transparent_union_attribute), but that doesn't play well
4576 with the stronger C++ type identity model. */
4577 if (TREE_CODE (ttype
) == RECORD_TYPE
4578 || TREE_CODE (ttype
) == UNION_TYPE
4579 || TREE_CODE (ttype
) == QUAL_UNION_TYPE
4580 || TREE_CODE (ttype
) == ENUMERAL_TYPE
)
4582 warning (OPT_Wattributes
,
4583 "ignoring attributes applied to %qT after definition",
4584 TYPE_MAIN_VARIANT (ttype
));
4585 return build_qualified_type (ttype
, quals
);
4588 ttype
= build_qualified_type (ttype
, TYPE_UNQUALIFIED
);
4589 ntype
= build_distinct_type_copy (ttype
);
4591 TYPE_ATTRIBUTES (ntype
) = attribute
;
4593 hashcode
= iterative_hash_object (code
, hashcode
);
4594 if (TREE_TYPE (ntype
))
4595 hashcode
= iterative_hash_object (TYPE_HASH (TREE_TYPE (ntype
)),
4597 hashcode
= attribute_hash_list (attribute
, hashcode
);
4599 switch (TREE_CODE (ntype
))
4602 hashcode
= type_hash_list (TYPE_ARG_TYPES (ntype
), hashcode
);
4605 if (TYPE_DOMAIN (ntype
))
4606 hashcode
= iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (ntype
)),
4610 t
= TYPE_MAX_VALUE (ntype
);
4611 for (i
= 0; i
< TREE_INT_CST_NUNITS (t
); i
++)
4612 hashcode
= iterative_hash_object (TREE_INT_CST_ELT (t
, i
), hashcode
);
4615 case FIXED_POINT_TYPE
:
4617 unsigned int precision
= TYPE_PRECISION (ntype
);
4618 hashcode
= iterative_hash_object (precision
, hashcode
);
4625 ntype
= type_hash_canon (hashcode
, ntype
);
4627 /* If the target-dependent attributes make NTYPE different from
4628 its canonical type, we will need to use structural equality
4629 checks for this type. */
4630 if (TYPE_STRUCTURAL_EQUALITY_P (ttype
)
4631 || !comp_type_attributes (ntype
, ttype
))
4632 SET_TYPE_STRUCTURAL_EQUALITY (ntype
);
4633 else if (TYPE_CANONICAL (ntype
) == ntype
)
4634 TYPE_CANONICAL (ntype
) = TYPE_CANONICAL (ttype
);
4636 ttype
= build_qualified_type (ntype
, quals
);
4638 else if (TYPE_QUALS (ttype
) != quals
)
4639 ttype
= build_qualified_type (ttype
, quals
);
4644 /* Check if "omp declare simd" attribute arguments, CLAUSES1 and CLAUSES2, are
4648 omp_declare_simd_clauses_equal (tree clauses1
, tree clauses2
)
4651 for (cl1
= clauses1
, cl2
= clauses2
;
4653 cl1
= OMP_CLAUSE_CHAIN (cl1
), cl2
= OMP_CLAUSE_CHAIN (cl2
))
4655 if (OMP_CLAUSE_CODE (cl1
) != OMP_CLAUSE_CODE (cl2
))
4657 if (OMP_CLAUSE_CODE (cl1
) != OMP_CLAUSE_SIMDLEN
)
4659 if (simple_cst_equal (OMP_CLAUSE_DECL (cl1
),
4660 OMP_CLAUSE_DECL (cl2
)) != 1)
4663 switch (OMP_CLAUSE_CODE (cl1
))
4665 case OMP_CLAUSE_ALIGNED
:
4666 if (simple_cst_equal (OMP_CLAUSE_ALIGNED_ALIGNMENT (cl1
),
4667 OMP_CLAUSE_ALIGNED_ALIGNMENT (cl2
)) != 1)
4670 case OMP_CLAUSE_LINEAR
:
4671 if (simple_cst_equal (OMP_CLAUSE_LINEAR_STEP (cl1
),
4672 OMP_CLAUSE_LINEAR_STEP (cl2
)) != 1)
4675 case OMP_CLAUSE_SIMDLEN
:
4676 if (simple_cst_equal (OMP_CLAUSE_SIMDLEN_EXPR (cl1
),
4677 OMP_CLAUSE_SIMDLEN_EXPR (cl2
)) != 1)
4686 /* Compare two constructor-element-type constants. Return 1 if the lists
4687 are known to be equal; otherwise return 0. */
4690 simple_cst_list_equal (const_tree l1
, const_tree l2
)
4692 while (l1
!= NULL_TREE
&& l2
!= NULL_TREE
)
4694 if (simple_cst_equal (TREE_VALUE (l1
), TREE_VALUE (l2
)) != 1)
4697 l1
= TREE_CHAIN (l1
);
4698 l2
= TREE_CHAIN (l2
);
4704 /* Compare two attributes for their value identity. Return true if the
4705 attribute values are known to be equal; otherwise return false.
4709 attribute_value_equal (const_tree attr1
, const_tree attr2
)
4711 if (TREE_VALUE (attr1
) == TREE_VALUE (attr2
))
4714 if (TREE_VALUE (attr1
) != NULL_TREE
4715 && TREE_CODE (TREE_VALUE (attr1
)) == TREE_LIST
4716 && TREE_VALUE (attr2
) != NULL
4717 && TREE_CODE (TREE_VALUE (attr2
)) == TREE_LIST
)
4718 return (simple_cst_list_equal (TREE_VALUE (attr1
),
4719 TREE_VALUE (attr2
)) == 1);
4721 if ((flag_openmp
|| flag_openmp_simd
)
4722 && TREE_VALUE (attr1
) && TREE_VALUE (attr2
)
4723 && TREE_CODE (TREE_VALUE (attr1
)) == OMP_CLAUSE
4724 && TREE_CODE (TREE_VALUE (attr2
)) == OMP_CLAUSE
)
4725 return omp_declare_simd_clauses_equal (TREE_VALUE (attr1
),
4726 TREE_VALUE (attr2
));
4728 return (simple_cst_equal (TREE_VALUE (attr1
), TREE_VALUE (attr2
)) == 1);
4731 /* Return 0 if the attributes for two types are incompatible, 1 if they
4732 are compatible, and 2 if they are nearly compatible (which causes a
4733 warning to be generated). */
4735 comp_type_attributes (const_tree type1
, const_tree type2
)
4737 const_tree a1
= TYPE_ATTRIBUTES (type1
);
4738 const_tree a2
= TYPE_ATTRIBUTES (type2
);
4743 for (a
= a1
; a
!= NULL_TREE
; a
= TREE_CHAIN (a
))
4745 const struct attribute_spec
*as
;
4748 as
= lookup_attribute_spec (get_attribute_name (a
));
4749 if (!as
|| as
->affects_type_identity
== false)
4752 attr
= lookup_attribute (as
->name
, CONST_CAST_TREE (a2
));
4753 if (!attr
|| !attribute_value_equal (a
, attr
))
4758 for (a
= a2
; a
!= NULL_TREE
; a
= TREE_CHAIN (a
))
4760 const struct attribute_spec
*as
;
4762 as
= lookup_attribute_spec (get_attribute_name (a
));
4763 if (!as
|| as
->affects_type_identity
== false)
4766 if (!lookup_attribute (as
->name
, CONST_CAST_TREE (a1
)))
4768 /* We don't need to compare trees again, as we did this
4769 already in first loop. */
4771 /* All types - affecting identity - are equal, so
4772 there is no need to call target hook for comparison. */
4776 /* As some type combinations - like default calling-convention - might
4777 be compatible, we have to call the target hook to get the final result. */
4778 return targetm
.comp_type_attributes (type1
, type2
);
4781 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4784 Record such modified types already made so we don't make duplicates. */
4787 build_type_attribute_variant (tree ttype
, tree attribute
)
4789 return build_type_attribute_qual_variant (ttype
, attribute
,
4790 TYPE_QUALS (ttype
));
4794 /* Reset the expression *EXPR_P, a size or position.
4796 ??? We could reset all non-constant sizes or positions. But it's cheap
4797 enough to not do so and refrain from adding workarounds to dwarf2out.c.
4799 We need to reset self-referential sizes or positions because they cannot
4800 be gimplified and thus can contain a CALL_EXPR after the gimplification
4801 is finished, which will run afoul of LTO streaming. And they need to be
4802 reset to something essentially dummy but not constant, so as to preserve
4803 the properties of the object they are attached to. */
4806 free_lang_data_in_one_sizepos (tree
*expr_p
)
4808 tree expr
= *expr_p
;
4809 if (CONTAINS_PLACEHOLDER_P (expr
))
4810 *expr_p
= build0 (PLACEHOLDER_EXPR
, TREE_TYPE (expr
));
4814 /* Reset all the fields in a binfo node BINFO. We only keep
4815 BINFO_VTABLE, which is used by gimple_fold_obj_type_ref. */
4818 free_lang_data_in_binfo (tree binfo
)
4823 gcc_assert (TREE_CODE (binfo
) == TREE_BINFO
);
4825 BINFO_VIRTUALS (binfo
) = NULL_TREE
;
4826 BINFO_BASE_ACCESSES (binfo
) = NULL
;
4827 BINFO_INHERITANCE_CHAIN (binfo
) = NULL_TREE
;
4828 BINFO_SUBVTT_INDEX (binfo
) = NULL_TREE
;
4830 FOR_EACH_VEC_ELT (*BINFO_BASE_BINFOS (binfo
), i
, t
)
4831 free_lang_data_in_binfo (t
);
4835 /* Reset all language specific information still present in TYPE. */
4838 free_lang_data_in_type (tree type
)
4840 gcc_assert (TYPE_P (type
));
4842 /* Give the FE a chance to remove its own data first. */
4843 lang_hooks
.free_lang_data (type
);
4845 TREE_LANG_FLAG_0 (type
) = 0;
4846 TREE_LANG_FLAG_1 (type
) = 0;
4847 TREE_LANG_FLAG_2 (type
) = 0;
4848 TREE_LANG_FLAG_3 (type
) = 0;
4849 TREE_LANG_FLAG_4 (type
) = 0;
4850 TREE_LANG_FLAG_5 (type
) = 0;
4851 TREE_LANG_FLAG_6 (type
) = 0;
4853 if (TREE_CODE (type
) == FUNCTION_TYPE
)
4855 /* Remove the const and volatile qualifiers from arguments. The
4856 C++ front end removes them, but the C front end does not,
4857 leading to false ODR violation errors when merging two
4858 instances of the same function signature compiled by
4859 different front ends. */
4862 for (p
= TYPE_ARG_TYPES (type
); p
; p
= TREE_CHAIN (p
))
4864 tree arg_type
= TREE_VALUE (p
);
4866 if (TYPE_READONLY (arg_type
) || TYPE_VOLATILE (arg_type
))
4868 int quals
= TYPE_QUALS (arg_type
)
4870 & ~TYPE_QUAL_VOLATILE
;
4871 TREE_VALUE (p
) = build_qualified_type (arg_type
, quals
);
4872 free_lang_data_in_type (TREE_VALUE (p
));
4877 /* Remove members that are not actually FIELD_DECLs from the field
4878 list of an aggregate. These occur in C++. */
4879 if (RECORD_OR_UNION_TYPE_P (type
))
4883 /* Note that TYPE_FIELDS can be shared across distinct
4884 TREE_TYPEs. Therefore, if the first field of TYPE_FIELDS is
4885 to be removed, we cannot set its TREE_CHAIN to NULL.
4886 Otherwise, we would not be able to find all the other fields
4887 in the other instances of this TREE_TYPE.
4889 This was causing an ICE in testsuite/g++.dg/lto/20080915.C. */
4891 member
= TYPE_FIELDS (type
);
4894 if (TREE_CODE (member
) == FIELD_DECL
4895 || TREE_CODE (member
) == TYPE_DECL
)
4898 TREE_CHAIN (prev
) = member
;
4900 TYPE_FIELDS (type
) = member
;
4904 member
= TREE_CHAIN (member
);
4908 TREE_CHAIN (prev
) = NULL_TREE
;
4910 TYPE_FIELDS (type
) = NULL_TREE
;
4912 TYPE_METHODS (type
) = NULL_TREE
;
4913 if (TYPE_BINFO (type
))
4914 free_lang_data_in_binfo (TYPE_BINFO (type
));
4918 /* For non-aggregate types, clear out the language slot (which
4919 overloads TYPE_BINFO). */
4920 TYPE_LANG_SLOT_1 (type
) = NULL_TREE
;
4922 if (INTEGRAL_TYPE_P (type
)
4923 || SCALAR_FLOAT_TYPE_P (type
)
4924 || FIXED_POINT_TYPE_P (type
))
4926 free_lang_data_in_one_sizepos (&TYPE_MIN_VALUE (type
));
4927 free_lang_data_in_one_sizepos (&TYPE_MAX_VALUE (type
));
4931 free_lang_data_in_one_sizepos (&TYPE_SIZE (type
));
4932 free_lang_data_in_one_sizepos (&TYPE_SIZE_UNIT (type
));
4934 if (TYPE_CONTEXT (type
)
4935 && TREE_CODE (TYPE_CONTEXT (type
)) == BLOCK
)
4937 tree ctx
= TYPE_CONTEXT (type
);
4940 ctx
= BLOCK_SUPERCONTEXT (ctx
);
4942 while (ctx
&& TREE_CODE (ctx
) == BLOCK
);
4943 TYPE_CONTEXT (type
) = ctx
;
4948 /* Return true if DECL may need an assembler name to be set. */
4951 need_assembler_name_p (tree decl
)
4953 /* Only FUNCTION_DECLs and VAR_DECLs are considered. */
4954 if (TREE_CODE (decl
) != FUNCTION_DECL
4955 && TREE_CODE (decl
) != VAR_DECL
)
4958 /* If DECL already has its assembler name set, it does not need a
4960 if (!HAS_DECL_ASSEMBLER_NAME_P (decl
)
4961 || DECL_ASSEMBLER_NAME_SET_P (decl
))
4964 /* Abstract decls do not need an assembler name. */
4965 if (DECL_ABSTRACT (decl
))
4968 /* For VAR_DECLs, only static, public and external symbols need an
4970 if (TREE_CODE (decl
) == VAR_DECL
4971 && !TREE_STATIC (decl
)
4972 && !TREE_PUBLIC (decl
)
4973 && !DECL_EXTERNAL (decl
))
4976 if (TREE_CODE (decl
) == FUNCTION_DECL
)
4978 /* Do not set assembler name on builtins. Allow RTL expansion to
4979 decide whether to expand inline or via a regular call. */
4980 if (DECL_BUILT_IN (decl
)
4981 && DECL_BUILT_IN_CLASS (decl
) != BUILT_IN_FRONTEND
)
4984 /* Functions represented in the callgraph need an assembler name. */
4985 if (cgraph_get_node (decl
) != NULL
)
4988 /* Unused and not public functions don't need an assembler name. */
4989 if (!TREE_USED (decl
) && !TREE_PUBLIC (decl
))
4997 /* Reset all language specific information still present in symbol
5001 free_lang_data_in_decl (tree decl
)
5003 gcc_assert (DECL_P (decl
));
5005 /* Give the FE a chance to remove its own data first. */
5006 lang_hooks
.free_lang_data (decl
);
5008 TREE_LANG_FLAG_0 (decl
) = 0;
5009 TREE_LANG_FLAG_1 (decl
) = 0;
5010 TREE_LANG_FLAG_2 (decl
) = 0;
5011 TREE_LANG_FLAG_3 (decl
) = 0;
5012 TREE_LANG_FLAG_4 (decl
) = 0;
5013 TREE_LANG_FLAG_5 (decl
) = 0;
5014 TREE_LANG_FLAG_6 (decl
) = 0;
5016 free_lang_data_in_one_sizepos (&DECL_SIZE (decl
));
5017 free_lang_data_in_one_sizepos (&DECL_SIZE_UNIT (decl
));
5018 if (TREE_CODE (decl
) == FIELD_DECL
)
5020 free_lang_data_in_one_sizepos (&DECL_FIELD_OFFSET (decl
));
5021 if (TREE_CODE (DECL_CONTEXT (decl
)) == QUAL_UNION_TYPE
)
5022 DECL_QUALIFIER (decl
) = NULL_TREE
;
5025 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5027 struct cgraph_node
*node
;
5028 if (!(node
= cgraph_get_node (decl
))
5029 || (!node
->definition
&& !node
->clones
))
5032 cgraph_release_function_body (node
);
5035 release_function_body (decl
);
5036 DECL_ARGUMENTS (decl
) = NULL
;
5037 DECL_RESULT (decl
) = NULL
;
5038 DECL_INITIAL (decl
) = error_mark_node
;
5041 if (gimple_has_body_p (decl
))
5045 /* If DECL has a gimple body, then the context for its
5046 arguments must be DECL. Otherwise, it doesn't really
5047 matter, as we will not be emitting any code for DECL. In
5048 general, there may be other instances of DECL created by
5049 the front end and since PARM_DECLs are generally shared,
5050 their DECL_CONTEXT changes as the replicas of DECL are
5051 created. The only time where DECL_CONTEXT is important
5052 is for the FUNCTION_DECLs that have a gimple body (since
5053 the PARM_DECL will be used in the function's body). */
5054 for (t
= DECL_ARGUMENTS (decl
); t
; t
= TREE_CHAIN (t
))
5055 DECL_CONTEXT (t
) = decl
;
5058 /* DECL_SAVED_TREE holds the GENERIC representation for DECL.
5059 At this point, it is not needed anymore. */
5060 DECL_SAVED_TREE (decl
) = NULL_TREE
;
5062 /* Clear the abstract origin if it refers to a method. Otherwise
5063 dwarf2out.c will ICE as we clear TYPE_METHODS and thus the
5064 origin will not be output correctly. */
5065 if (DECL_ABSTRACT_ORIGIN (decl
)
5066 && DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))
5067 && RECORD_OR_UNION_TYPE_P
5068 (DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))))
5069 DECL_ABSTRACT_ORIGIN (decl
) = NULL_TREE
;
5071 /* Sometimes the C++ frontend doesn't manage to transform a temporary
5072 DECL_VINDEX referring to itself into a vtable slot number as it
5073 should. Happens with functions that are copied and then forgotten
5074 about. Just clear it, it won't matter anymore. */
5075 if (DECL_VINDEX (decl
) && !tree_fits_shwi_p (DECL_VINDEX (decl
)))
5076 DECL_VINDEX (decl
) = NULL_TREE
;
5078 else if (TREE_CODE (decl
) == VAR_DECL
)
5080 if ((DECL_EXTERNAL (decl
)
5081 && (!TREE_STATIC (decl
) || !TREE_READONLY (decl
)))
5082 || (decl_function_context (decl
) && !TREE_STATIC (decl
)))
5083 DECL_INITIAL (decl
) = NULL_TREE
;
5085 else if (TREE_CODE (decl
) == TYPE_DECL
5086 || TREE_CODE (decl
) == FIELD_DECL
)
5087 DECL_INITIAL (decl
) = NULL_TREE
;
5088 else if (TREE_CODE (decl
) == TRANSLATION_UNIT_DECL
5089 && DECL_INITIAL (decl
)
5090 && TREE_CODE (DECL_INITIAL (decl
)) == BLOCK
)
5092 /* Strip builtins from the translation-unit BLOCK. We still have targets
5093 without builtin_decl_explicit support and also builtins are shared
5094 nodes and thus we can't use TREE_CHAIN in multiple lists. */
5095 tree
*nextp
= &BLOCK_VARS (DECL_INITIAL (decl
));
5099 if (TREE_CODE (var
) == FUNCTION_DECL
5100 && DECL_BUILT_IN (var
))
5101 *nextp
= TREE_CHAIN (var
);
5103 nextp
= &TREE_CHAIN (var
);
5109 /* Data used when collecting DECLs and TYPEs for language data removal. */
5111 struct free_lang_data_d
5113 /* Worklist to avoid excessive recursion. */
5116 /* Set of traversed objects. Used to avoid duplicate visits. */
5117 struct pointer_set_t
*pset
;
5119 /* Array of symbols to process with free_lang_data_in_decl. */
5122 /* Array of types to process with free_lang_data_in_type. */
5127 /* Save all language fields needed to generate proper debug information
5128 for DECL. This saves most fields cleared out by free_lang_data_in_decl. */
5131 save_debug_info_for_decl (tree t
)
5133 /*struct saved_debug_info_d *sdi;*/
5135 gcc_assert (debug_info_level
> DINFO_LEVEL_TERSE
&& t
&& DECL_P (t
));
5137 /* FIXME. Partial implementation for saving debug info removed. */
5141 /* Save all language fields needed to generate proper debug information
5142 for TYPE. This saves most fields cleared out by free_lang_data_in_type. */
5145 save_debug_info_for_type (tree t
)
5147 /*struct saved_debug_info_d *sdi;*/
5149 gcc_assert (debug_info_level
> DINFO_LEVEL_TERSE
&& t
&& TYPE_P (t
));
5151 /* FIXME. Partial implementation for saving debug info removed. */
5155 /* Add type or decl T to one of the list of tree nodes that need their
5156 language data removed. The lists are held inside FLD. */
5159 add_tree_to_fld_list (tree t
, struct free_lang_data_d
*fld
)
5163 fld
->decls
.safe_push (t
);
5164 if (debug_info_level
> DINFO_LEVEL_TERSE
)
5165 save_debug_info_for_decl (t
);
5167 else if (TYPE_P (t
))
5169 fld
->types
.safe_push (t
);
5170 if (debug_info_level
> DINFO_LEVEL_TERSE
)
5171 save_debug_info_for_type (t
);
5177 /* Push tree node T into FLD->WORKLIST. */
5180 fld_worklist_push (tree t
, struct free_lang_data_d
*fld
)
5182 if (t
&& !is_lang_specific (t
) && !pointer_set_contains (fld
->pset
, t
))
5183 fld
->worklist
.safe_push ((t
));
5187 /* Operand callback helper for free_lang_data_in_node. *TP is the
5188 subtree operand being considered. */
5191 find_decls_types_r (tree
*tp
, int *ws
, void *data
)
5194 struct free_lang_data_d
*fld
= (struct free_lang_data_d
*) data
;
5196 if (TREE_CODE (t
) == TREE_LIST
)
5199 /* Language specific nodes will be removed, so there is no need
5200 to gather anything under them. */
5201 if (is_lang_specific (t
))
5209 /* Note that walk_tree does not traverse every possible field in
5210 decls, so we have to do our own traversals here. */
5211 add_tree_to_fld_list (t
, fld
);
5213 fld_worklist_push (DECL_NAME (t
), fld
);
5214 fld_worklist_push (DECL_CONTEXT (t
), fld
);
5215 fld_worklist_push (DECL_SIZE (t
), fld
);
5216 fld_worklist_push (DECL_SIZE_UNIT (t
), fld
);
5218 /* We are going to remove everything under DECL_INITIAL for
5219 TYPE_DECLs. No point walking them. */
5220 if (TREE_CODE (t
) != TYPE_DECL
)
5221 fld_worklist_push (DECL_INITIAL (t
), fld
);
5223 fld_worklist_push (DECL_ATTRIBUTES (t
), fld
);
5224 fld_worklist_push (DECL_ABSTRACT_ORIGIN (t
), fld
);
5226 if (TREE_CODE (t
) == FUNCTION_DECL
)
5228 fld_worklist_push (DECL_ARGUMENTS (t
), fld
);
5229 fld_worklist_push (DECL_RESULT (t
), fld
);
5231 else if (TREE_CODE (t
) == TYPE_DECL
)
5233 fld_worklist_push (DECL_ARGUMENT_FLD (t
), fld
);
5234 fld_worklist_push (DECL_VINDEX (t
), fld
);
5235 fld_worklist_push (DECL_ORIGINAL_TYPE (t
), fld
);
5237 else if (TREE_CODE (t
) == FIELD_DECL
)
5239 fld_worklist_push (DECL_FIELD_OFFSET (t
), fld
);
5240 fld_worklist_push (DECL_BIT_FIELD_TYPE (t
), fld
);
5241 fld_worklist_push (DECL_FIELD_BIT_OFFSET (t
), fld
);
5242 fld_worklist_push (DECL_FCONTEXT (t
), fld
);
5244 else if (TREE_CODE (t
) == VAR_DECL
)
5246 fld_worklist_push (DECL_SECTION_NAME (t
), fld
);
5249 if ((TREE_CODE (t
) == VAR_DECL
|| TREE_CODE (t
) == PARM_DECL
)
5250 && DECL_HAS_VALUE_EXPR_P (t
))
5251 fld_worklist_push (DECL_VALUE_EXPR (t
), fld
);
5253 if (TREE_CODE (t
) != FIELD_DECL
5254 && TREE_CODE (t
) != TYPE_DECL
)
5255 fld_worklist_push (TREE_CHAIN (t
), fld
);
5258 else if (TYPE_P (t
))
5260 /* Note that walk_tree does not traverse every possible field in
5261 types, so we have to do our own traversals here. */
5262 add_tree_to_fld_list (t
, fld
);
5264 if (!RECORD_OR_UNION_TYPE_P (t
))
5265 fld_worklist_push (TYPE_CACHED_VALUES (t
), fld
);
5266 fld_worklist_push (TYPE_SIZE (t
), fld
);
5267 fld_worklist_push (TYPE_SIZE_UNIT (t
), fld
);
5268 fld_worklist_push (TYPE_ATTRIBUTES (t
), fld
);
5269 fld_worklist_push (TYPE_POINTER_TO (t
), fld
);
5270 fld_worklist_push (TYPE_REFERENCE_TO (t
), fld
);
5271 fld_worklist_push (TYPE_NAME (t
), fld
);
5272 /* Do not walk TYPE_NEXT_PTR_TO or TYPE_NEXT_REF_TO. We do not stream
5273 them and thus do not and want not to reach unused pointer types
5275 if (!POINTER_TYPE_P (t
))
5276 fld_worklist_push (TYPE_MINVAL (t
), fld
);
5277 if (!RECORD_OR_UNION_TYPE_P (t
))
5278 fld_worklist_push (TYPE_MAXVAL (t
), fld
);
5279 fld_worklist_push (TYPE_MAIN_VARIANT (t
), fld
);
5280 /* Do not walk TYPE_NEXT_VARIANT. We do not stream it and thus
5281 do not and want not to reach unused variants this way. */
5282 if (TYPE_CONTEXT (t
))
5284 tree ctx
= TYPE_CONTEXT (t
);
5285 /* We adjust BLOCK TYPE_CONTEXTs to the innermost non-BLOCK one.
5286 So push that instead. */
5287 while (ctx
&& TREE_CODE (ctx
) == BLOCK
)
5288 ctx
= BLOCK_SUPERCONTEXT (ctx
);
5289 fld_worklist_push (ctx
, fld
);
5291 /* Do not walk TYPE_CANONICAL. We do not stream it and thus do not
5292 and want not to reach unused types this way. */
5294 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_BINFO (t
))
5298 FOR_EACH_VEC_ELT (*BINFO_BASE_BINFOS (TYPE_BINFO (t
)), i
, tem
)
5299 fld_worklist_push (TREE_TYPE (tem
), fld
);
5300 tem
= BINFO_VIRTUALS (TYPE_BINFO (t
));
5302 /* The Java FE overloads BINFO_VIRTUALS for its own purpose. */
5303 && TREE_CODE (tem
) == TREE_LIST
)
5306 fld_worklist_push (TREE_VALUE (tem
), fld
);
5307 tem
= TREE_CHAIN (tem
);
5311 if (RECORD_OR_UNION_TYPE_P (t
))
5314 /* Push all TYPE_FIELDS - there can be interleaving interesting
5315 and non-interesting things. */
5316 tem
= TYPE_FIELDS (t
);
5319 if (TREE_CODE (tem
) == FIELD_DECL
5320 || TREE_CODE (tem
) == TYPE_DECL
)
5321 fld_worklist_push (tem
, fld
);
5322 tem
= TREE_CHAIN (tem
);
5326 fld_worklist_push (TYPE_STUB_DECL (t
), fld
);
5329 else if (TREE_CODE (t
) == BLOCK
)
5332 for (tem
= BLOCK_VARS (t
); tem
; tem
= TREE_CHAIN (tem
))
5333 fld_worklist_push (tem
, fld
);
5334 for (tem
= BLOCK_SUBBLOCKS (t
); tem
; tem
= BLOCK_CHAIN (tem
))
5335 fld_worklist_push (tem
, fld
);
5336 fld_worklist_push (BLOCK_ABSTRACT_ORIGIN (t
), fld
);
5339 if (TREE_CODE (t
) != IDENTIFIER_NODE
5340 && CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_TYPED
))
5341 fld_worklist_push (TREE_TYPE (t
), fld
);
5347 /* Find decls and types in T. */
5350 find_decls_types (tree t
, struct free_lang_data_d
*fld
)
5354 if (!pointer_set_contains (fld
->pset
, t
))
5355 walk_tree (&t
, find_decls_types_r
, fld
, fld
->pset
);
5356 if (fld
->worklist
.is_empty ())
5358 t
= fld
->worklist
.pop ();
5362 /* Translate all the types in LIST with the corresponding runtime
5366 get_eh_types_for_runtime (tree list
)
5370 if (list
== NULL_TREE
)
5373 head
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
5375 list
= TREE_CHAIN (list
);
5378 tree n
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
5379 TREE_CHAIN (prev
) = n
;
5380 prev
= TREE_CHAIN (prev
);
5381 list
= TREE_CHAIN (list
);
5388 /* Find decls and types referenced in EH region R and store them in
5389 FLD->DECLS and FLD->TYPES. */
5392 find_decls_types_in_eh_region (eh_region r
, struct free_lang_data_d
*fld
)
5403 /* The types referenced in each catch must first be changed to the
5404 EH types used at runtime. This removes references to FE types
5406 for (c
= r
->u
.eh_try
.first_catch
; c
; c
= c
->next_catch
)
5408 c
->type_list
= get_eh_types_for_runtime (c
->type_list
);
5409 walk_tree (&c
->type_list
, find_decls_types_r
, fld
, fld
->pset
);
5414 case ERT_ALLOWED_EXCEPTIONS
:
5415 r
->u
.allowed
.type_list
5416 = get_eh_types_for_runtime (r
->u
.allowed
.type_list
);
5417 walk_tree (&r
->u
.allowed
.type_list
, find_decls_types_r
, fld
, fld
->pset
);
5420 case ERT_MUST_NOT_THROW
:
5421 walk_tree (&r
->u
.must_not_throw
.failure_decl
,
5422 find_decls_types_r
, fld
, fld
->pset
);
5428 /* Find decls and types referenced in cgraph node N and store them in
5429 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
5430 look for *every* kind of DECL and TYPE node reachable from N,
5431 including those embedded inside types and decls (i.e,, TYPE_DECLs,
5432 NAMESPACE_DECLs, etc). */
5435 find_decls_types_in_node (struct cgraph_node
*n
, struct free_lang_data_d
*fld
)
5438 struct function
*fn
;
5442 find_decls_types (n
->decl
, fld
);
5444 if (!gimple_has_body_p (n
->decl
))
5447 gcc_assert (current_function_decl
== NULL_TREE
&& cfun
== NULL
);
5449 fn
= DECL_STRUCT_FUNCTION (n
->decl
);
5451 /* Traverse locals. */
5452 FOR_EACH_LOCAL_DECL (fn
, ix
, t
)
5453 find_decls_types (t
, fld
);
5455 /* Traverse EH regions in FN. */
5458 FOR_ALL_EH_REGION_FN (r
, fn
)
5459 find_decls_types_in_eh_region (r
, fld
);
5462 /* Traverse every statement in FN. */
5463 FOR_EACH_BB_FN (bb
, fn
)
5465 gimple_stmt_iterator si
;
5468 for (si
= gsi_start_phis (bb
); !gsi_end_p (si
); gsi_next (&si
))
5470 gimple phi
= gsi_stmt (si
);
5472 for (i
= 0; i
< gimple_phi_num_args (phi
); i
++)
5474 tree
*arg_p
= gimple_phi_arg_def_ptr (phi
, i
);
5475 find_decls_types (*arg_p
, fld
);
5479 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
5481 gimple stmt
= gsi_stmt (si
);
5483 if (is_gimple_call (stmt
))
5484 find_decls_types (gimple_call_fntype (stmt
), fld
);
5486 for (i
= 0; i
< gimple_num_ops (stmt
); i
++)
5488 tree arg
= gimple_op (stmt
, i
);
5489 find_decls_types (arg
, fld
);
5496 /* Find decls and types referenced in varpool node N and store them in
5497 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
5498 look for *every* kind of DECL and TYPE node reachable from N,
5499 including those embedded inside types and decls (i.e,, TYPE_DECLs,
5500 NAMESPACE_DECLs, etc). */
5503 find_decls_types_in_var (varpool_node
*v
, struct free_lang_data_d
*fld
)
5505 find_decls_types (v
->decl
, fld
);
5508 /* If T needs an assembler name, have one created for it. */
5511 assign_assembler_name_if_neeeded (tree t
)
5513 if (need_assembler_name_p (t
))
5515 /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit
5516 diagnostics that use input_location to show locus
5517 information. The problem here is that, at this point,
5518 input_location is generally anchored to the end of the file
5519 (since the parser is long gone), so we don't have a good
5520 position to pin it to.
5522 To alleviate this problem, this uses the location of T's
5523 declaration. Examples of this are
5524 testsuite/g++.dg/template/cond2.C and
5525 testsuite/g++.dg/template/pr35240.C. */
5526 location_t saved_location
= input_location
;
5527 input_location
= DECL_SOURCE_LOCATION (t
);
5529 decl_assembler_name (t
);
5531 input_location
= saved_location
;
5536 /* Free language specific information for every operand and expression
5537 in every node of the call graph. This process operates in three stages:
5539 1- Every callgraph node and varpool node is traversed looking for
5540 decls and types embedded in them. This is a more exhaustive
5541 search than that done by find_referenced_vars, because it will
5542 also collect individual fields, decls embedded in types, etc.
5544 2- All the decls found are sent to free_lang_data_in_decl.
5546 3- All the types found are sent to free_lang_data_in_type.
5548 The ordering between decls and types is important because
5549 free_lang_data_in_decl sets assembler names, which includes
5550 mangling. So types cannot be freed up until assembler names have
5554 free_lang_data_in_cgraph (void)
5556 struct cgraph_node
*n
;
5558 struct free_lang_data_d fld
;
5563 /* Initialize sets and arrays to store referenced decls and types. */
5564 fld
.pset
= pointer_set_create ();
5565 fld
.worklist
.create (0);
5566 fld
.decls
.create (100);
5567 fld
.types
.create (100);
5569 /* Find decls and types in the body of every function in the callgraph. */
5570 FOR_EACH_FUNCTION (n
)
5571 find_decls_types_in_node (n
, &fld
);
5573 FOR_EACH_VEC_SAFE_ELT (alias_pairs
, i
, p
)
5574 find_decls_types (p
->decl
, &fld
);
5576 /* Find decls and types in every varpool symbol. */
5577 FOR_EACH_VARIABLE (v
)
5578 find_decls_types_in_var (v
, &fld
);
5580 /* Set the assembler name on every decl found. We need to do this
5581 now because free_lang_data_in_decl will invalidate data needed
5582 for mangling. This breaks mangling on interdependent decls. */
5583 FOR_EACH_VEC_ELT (fld
.decls
, i
, t
)
5584 assign_assembler_name_if_neeeded (t
);
5586 /* Traverse every decl found freeing its language data. */
5587 FOR_EACH_VEC_ELT (fld
.decls
, i
, t
)
5588 free_lang_data_in_decl (t
);
5590 /* Traverse every type found freeing its language data. */
5591 FOR_EACH_VEC_ELT (fld
.types
, i
, t
)
5592 free_lang_data_in_type (t
);
5594 pointer_set_destroy (fld
.pset
);
5595 fld
.worklist
.release ();
5596 fld
.decls
.release ();
5597 fld
.types
.release ();
5601 /* Free resources that are used by FE but are not needed once they are done. */
5604 free_lang_data (void)
5608 /* If we are the LTO frontend we have freed lang-specific data already. */
5610 || !flag_generate_lto
)
5613 /* Allocate and assign alias sets to the standard integer types
5614 while the slots are still in the way the frontends generated them. */
5615 for (i
= 0; i
< itk_none
; ++i
)
5616 if (integer_types
[i
])
5617 TYPE_ALIAS_SET (integer_types
[i
]) = get_alias_set (integer_types
[i
]);
5619 /* Traverse the IL resetting language specific information for
5620 operands, expressions, etc. */
5621 free_lang_data_in_cgraph ();
5623 /* Create gimple variants for common types. */
5624 ptrdiff_type_node
= integer_type_node
;
5625 fileptr_type_node
= ptr_type_node
;
5627 /* Reset some langhooks. Do not reset types_compatible_p, it may
5628 still be used indirectly via the get_alias_set langhook. */
5629 lang_hooks
.dwarf_name
= lhd_dwarf_name
;
5630 lang_hooks
.decl_printable_name
= gimple_decl_printable_name
;
5631 /* We do not want the default decl_assembler_name implementation,
5632 rather if we have fixed everything we want a wrapper around it
5633 asserting that all non-local symbols already got their assembler
5634 name and only produce assembler names for local symbols. Or rather
5635 make sure we never call decl_assembler_name on local symbols and
5636 devise a separate, middle-end private scheme for it. */
5638 /* Reset diagnostic machinery. */
5639 tree_diagnostics_defaults (global_dc
);
5647 const pass_data pass_data_ipa_free_lang_data
=
5649 SIMPLE_IPA_PASS
, /* type */
5650 "*free_lang_data", /* name */
5651 OPTGROUP_NONE
, /* optinfo_flags */
5652 true, /* has_execute */
5653 TV_IPA_FREE_LANG_DATA
, /* tv_id */
5654 0, /* properties_required */
5655 0, /* properties_provided */
5656 0, /* properties_destroyed */
5657 0, /* todo_flags_start */
5658 0, /* todo_flags_finish */
5661 class pass_ipa_free_lang_data
: public simple_ipa_opt_pass
5664 pass_ipa_free_lang_data (gcc::context
*ctxt
)
5665 : simple_ipa_opt_pass (pass_data_ipa_free_lang_data
, ctxt
)
5668 /* opt_pass methods: */
5669 virtual unsigned int execute (function
*) { return free_lang_data (); }
5671 }; // class pass_ipa_free_lang_data
5675 simple_ipa_opt_pass
*
5676 make_pass_ipa_free_lang_data (gcc::context
*ctxt
)
5678 return new pass_ipa_free_lang_data (ctxt
);
5681 /* The backbone of is_attribute_p(). ATTR_LEN is the string length of
5682 ATTR_NAME. Also used internally by remove_attribute(). */
5684 private_is_attribute_p (const char *attr_name
, size_t attr_len
, const_tree ident
)
5686 size_t ident_len
= IDENTIFIER_LENGTH (ident
);
5688 if (ident_len
== attr_len
)
5690 if (strcmp (attr_name
, IDENTIFIER_POINTER (ident
)) == 0)
5693 else if (ident_len
== attr_len
+ 4)
5695 /* There is the possibility that ATTR is 'text' and IDENT is
5697 const char *p
= IDENTIFIER_POINTER (ident
);
5698 if (p
[0] == '_' && p
[1] == '_'
5699 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
5700 && strncmp (attr_name
, p
+ 2, attr_len
) == 0)
5707 /* The backbone of lookup_attribute(). ATTR_LEN is the string length
5708 of ATTR_NAME, and LIST is not NULL_TREE. */
5710 private_lookup_attribute (const char *attr_name
, size_t attr_len
, tree list
)
5714 size_t ident_len
= IDENTIFIER_LENGTH (get_attribute_name (list
));
5716 if (ident_len
== attr_len
)
5718 if (!strcmp (attr_name
,
5719 IDENTIFIER_POINTER (get_attribute_name (list
))))
5722 /* TODO: If we made sure that attributes were stored in the
5723 canonical form without '__...__' (ie, as in 'text' as opposed
5724 to '__text__') then we could avoid the following case. */
5725 else if (ident_len
== attr_len
+ 4)
5727 const char *p
= IDENTIFIER_POINTER (get_attribute_name (list
));
5728 if (p
[0] == '_' && p
[1] == '_'
5729 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
5730 && strncmp (attr_name
, p
+ 2, attr_len
) == 0)
5733 list
= TREE_CHAIN (list
);
5739 /* A variant of lookup_attribute() that can be used with an identifier
5740 as the first argument, and where the identifier can be either
5741 'text' or '__text__'.
5743 Given an attribute ATTR_IDENTIFIER, and a list of attributes LIST,
5744 return a pointer to the attribute's list element if the attribute
5745 is part of the list, or NULL_TREE if not found. If the attribute
5746 appears more than once, this only returns the first occurrence; the
5747 TREE_CHAIN of the return value should be passed back in if further
5748 occurrences are wanted. ATTR_IDENTIFIER must be an identifier but
5749 can be in the form 'text' or '__text__'. */
5751 lookup_ident_attribute (tree attr_identifier
, tree list
)
5753 gcc_checking_assert (TREE_CODE (attr_identifier
) == IDENTIFIER_NODE
);
5757 gcc_checking_assert (TREE_CODE (get_attribute_name (list
))
5758 == IDENTIFIER_NODE
);
5760 /* Identifiers can be compared directly for equality. */
5761 if (attr_identifier
== get_attribute_name (list
))
5764 /* If they are not equal, they may still be one in the form
5765 'text' while the other one is in the form '__text__'. TODO:
5766 If we were storing attributes in normalized 'text' form, then
5767 this could all go away and we could take full advantage of
5768 the fact that we're comparing identifiers. :-) */
5770 size_t attr_len
= IDENTIFIER_LENGTH (attr_identifier
);
5771 size_t ident_len
= IDENTIFIER_LENGTH (get_attribute_name (list
));
5773 if (ident_len
== attr_len
+ 4)
5775 const char *p
= IDENTIFIER_POINTER (get_attribute_name (list
));
5776 const char *q
= IDENTIFIER_POINTER (attr_identifier
);
5777 if (p
[0] == '_' && p
[1] == '_'
5778 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
5779 && strncmp (q
, p
+ 2, attr_len
) == 0)
5782 else if (ident_len
+ 4 == attr_len
)
5784 const char *p
= IDENTIFIER_POINTER (get_attribute_name (list
));
5785 const char *q
= IDENTIFIER_POINTER (attr_identifier
);
5786 if (q
[0] == '_' && q
[1] == '_'
5787 && q
[attr_len
- 2] == '_' && q
[attr_len
- 1] == '_'
5788 && strncmp (q
+ 2, p
, ident_len
) == 0)
5792 list
= TREE_CHAIN (list
);
5798 /* Remove any instances of attribute ATTR_NAME in LIST and return the
5802 remove_attribute (const char *attr_name
, tree list
)
5805 size_t attr_len
= strlen (attr_name
);
5807 gcc_checking_assert (attr_name
[0] != '_');
5809 for (p
= &list
; *p
; )
5812 /* TODO: If we were storing attributes in normalized form, here
5813 we could use a simple strcmp(). */
5814 if (private_is_attribute_p (attr_name
, attr_len
, get_attribute_name (l
)))
5815 *p
= TREE_CHAIN (l
);
5817 p
= &TREE_CHAIN (l
);
5823 /* Return an attribute list that is the union of a1 and a2. */
5826 merge_attributes (tree a1
, tree a2
)
5830 /* Either one unset? Take the set one. */
5832 if ((attributes
= a1
) == 0)
5835 /* One that completely contains the other? Take it. */
5837 else if (a2
!= 0 && ! attribute_list_contained (a1
, a2
))
5839 if (attribute_list_contained (a2
, a1
))
5843 /* Pick the longest list, and hang on the other list. */
5845 if (list_length (a1
) < list_length (a2
))
5846 attributes
= a2
, a2
= a1
;
5848 for (; a2
!= 0; a2
= TREE_CHAIN (a2
))
5851 for (a
= lookup_ident_attribute (get_attribute_name (a2
),
5853 a
!= NULL_TREE
&& !attribute_value_equal (a
, a2
);
5854 a
= lookup_ident_attribute (get_attribute_name (a2
),
5859 a1
= copy_node (a2
);
5860 TREE_CHAIN (a1
) = attributes
;
5869 /* Given types T1 and T2, merge their attributes and return
5873 merge_type_attributes (tree t1
, tree t2
)
5875 return merge_attributes (TYPE_ATTRIBUTES (t1
),
5876 TYPE_ATTRIBUTES (t2
));
5879 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
5883 merge_decl_attributes (tree olddecl
, tree newdecl
)
5885 return merge_attributes (DECL_ATTRIBUTES (olddecl
),
5886 DECL_ATTRIBUTES (newdecl
));
5889 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
5891 /* Specialization of merge_decl_attributes for various Windows targets.
5893 This handles the following situation:
5895 __declspec (dllimport) int foo;
5898 The second instance of `foo' nullifies the dllimport. */
5901 merge_dllimport_decl_attributes (tree old
, tree new_tree
)
5904 int delete_dllimport_p
= 1;
5906 /* What we need to do here is remove from `old' dllimport if it doesn't
5907 appear in `new'. dllimport behaves like extern: if a declaration is
5908 marked dllimport and a definition appears later, then the object
5909 is not dllimport'd. We also remove a `new' dllimport if the old list
5910 contains dllexport: dllexport always overrides dllimport, regardless
5911 of the order of declaration. */
5912 if (!VAR_OR_FUNCTION_DECL_P (new_tree
))
5913 delete_dllimport_p
= 0;
5914 else if (DECL_DLLIMPORT_P (new_tree
)
5915 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (old
)))
5917 DECL_DLLIMPORT_P (new_tree
) = 0;
5918 warning (OPT_Wattributes
, "%q+D already declared with dllexport attribute: "
5919 "dllimport ignored", new_tree
);
5921 else if (DECL_DLLIMPORT_P (old
) && !DECL_DLLIMPORT_P (new_tree
))
5923 /* Warn about overriding a symbol that has already been used, e.g.:
5924 extern int __attribute__ ((dllimport)) foo;
5925 int* bar () {return &foo;}
5928 if (TREE_USED (old
))
5930 warning (0, "%q+D redeclared without dllimport attribute "
5931 "after being referenced with dll linkage", new_tree
);
5932 /* If we have used a variable's address with dllimport linkage,
5933 keep the old DECL_DLLIMPORT_P flag: the ADDR_EXPR using the
5934 decl may already have had TREE_CONSTANT computed.
5935 We still remove the attribute so that assembler code refers
5936 to '&foo rather than '_imp__foo'. */
5937 if (TREE_CODE (old
) == VAR_DECL
&& TREE_ADDRESSABLE (old
))
5938 DECL_DLLIMPORT_P (new_tree
) = 1;
5941 /* Let an inline definition silently override the external reference,
5942 but otherwise warn about attribute inconsistency. */
5943 else if (TREE_CODE (new_tree
) == VAR_DECL
5944 || !DECL_DECLARED_INLINE_P (new_tree
))
5945 warning (OPT_Wattributes
, "%q+D redeclared without dllimport attribute: "
5946 "previous dllimport ignored", new_tree
);
5949 delete_dllimport_p
= 0;
5951 a
= merge_attributes (DECL_ATTRIBUTES (old
), DECL_ATTRIBUTES (new_tree
));
5953 if (delete_dllimport_p
)
5954 a
= remove_attribute ("dllimport", a
);
5959 /* Handle a "dllimport" or "dllexport" attribute; arguments as in
5960 struct attribute_spec.handler. */
5963 handle_dll_attribute (tree
* pnode
, tree name
, tree args
, int flags
,
5969 /* These attributes may apply to structure and union types being created,
5970 but otherwise should pass to the declaration involved. */
5973 if (flags
& ((int) ATTR_FLAG_DECL_NEXT
| (int) ATTR_FLAG_FUNCTION_NEXT
5974 | (int) ATTR_FLAG_ARRAY_NEXT
))
5976 *no_add_attrs
= true;
5977 return tree_cons (name
, args
, NULL_TREE
);
5979 if (TREE_CODE (node
) == RECORD_TYPE
5980 || TREE_CODE (node
) == UNION_TYPE
)
5982 node
= TYPE_NAME (node
);
5988 warning (OPT_Wattributes
, "%qE attribute ignored",
5990 *no_add_attrs
= true;
5995 if (TREE_CODE (node
) != FUNCTION_DECL
5996 && TREE_CODE (node
) != VAR_DECL
5997 && TREE_CODE (node
) != TYPE_DECL
)
5999 *no_add_attrs
= true;
6000 warning (OPT_Wattributes
, "%qE attribute ignored",
6005 if (TREE_CODE (node
) == TYPE_DECL
6006 && TREE_CODE (TREE_TYPE (node
)) != RECORD_TYPE
6007 && TREE_CODE (TREE_TYPE (node
)) != UNION_TYPE
)
6009 *no_add_attrs
= true;
6010 warning (OPT_Wattributes
, "%qE attribute ignored",
6015 is_dllimport
= is_attribute_p ("dllimport", name
);
6017 /* Report error on dllimport ambiguities seen now before they cause
6021 /* Honor any target-specific overrides. */
6022 if (!targetm
.valid_dllimport_attribute_p (node
))
6023 *no_add_attrs
= true;
6025 else if (TREE_CODE (node
) == FUNCTION_DECL
6026 && DECL_DECLARED_INLINE_P (node
))
6028 warning (OPT_Wattributes
, "inline function %q+D declared as "
6029 " dllimport: attribute ignored", node
);
6030 *no_add_attrs
= true;
6032 /* Like MS, treat definition of dllimported variables and
6033 non-inlined functions on declaration as syntax errors. */
6034 else if (TREE_CODE (node
) == FUNCTION_DECL
&& DECL_INITIAL (node
))
6036 error ("function %q+D definition is marked dllimport", node
);
6037 *no_add_attrs
= true;
6040 else if (TREE_CODE (node
) == VAR_DECL
)
6042 if (DECL_INITIAL (node
))
6044 error ("variable %q+D definition is marked dllimport",
6046 *no_add_attrs
= true;
6049 /* `extern' needn't be specified with dllimport.
6050 Specify `extern' now and hope for the best. Sigh. */
6051 DECL_EXTERNAL (node
) = 1;
6052 /* Also, implicitly give dllimport'd variables declared within
6053 a function global scope, unless declared static. */
6054 if (current_function_decl
!= NULL_TREE
&& !TREE_STATIC (node
))
6055 TREE_PUBLIC (node
) = 1;
6058 if (*no_add_attrs
== false)
6059 DECL_DLLIMPORT_P (node
) = 1;
6061 else if (TREE_CODE (node
) == FUNCTION_DECL
6062 && DECL_DECLARED_INLINE_P (node
)
6063 && flag_keep_inline_dllexport
)
6064 /* An exported function, even if inline, must be emitted. */
6065 DECL_EXTERNAL (node
) = 0;
6067 /* Report error if symbol is not accessible at global scope. */
6068 if (!TREE_PUBLIC (node
)
6069 && (TREE_CODE (node
) == VAR_DECL
6070 || TREE_CODE (node
) == FUNCTION_DECL
))
6072 error ("external linkage required for symbol %q+D because of "
6073 "%qE attribute", node
, name
);
6074 *no_add_attrs
= true;
6077 /* A dllexport'd entity must have default visibility so that other
6078 program units (shared libraries or the main executable) can see
6079 it. A dllimport'd entity must have default visibility so that
6080 the linker knows that undefined references within this program
6081 unit can be resolved by the dynamic linker. */
6084 if (DECL_VISIBILITY_SPECIFIED (node
)
6085 && DECL_VISIBILITY (node
) != VISIBILITY_DEFAULT
)
6086 error ("%qE implies default visibility, but %qD has already "
6087 "been declared with a different visibility",
6089 DECL_VISIBILITY (node
) = VISIBILITY_DEFAULT
;
6090 DECL_VISIBILITY_SPECIFIED (node
) = 1;
6096 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
6098 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
6099 of the various TYPE_QUAL values. */
6102 set_type_quals (tree type
, int type_quals
)
6104 TYPE_READONLY (type
) = (type_quals
& TYPE_QUAL_CONST
) != 0;
6105 TYPE_VOLATILE (type
) = (type_quals
& TYPE_QUAL_VOLATILE
) != 0;
6106 TYPE_RESTRICT (type
) = (type_quals
& TYPE_QUAL_RESTRICT
) != 0;
6107 TYPE_ATOMIC (type
) = (type_quals
& TYPE_QUAL_ATOMIC
) != 0;
6108 TYPE_ADDR_SPACE (type
) = DECODE_QUAL_ADDR_SPACE (type_quals
);
6111 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
6114 check_qualified_type (const_tree cand
, const_tree base
, int type_quals
)
6116 return (TYPE_QUALS (cand
) == type_quals
6117 && TYPE_NAME (cand
) == TYPE_NAME (base
)
6118 /* Apparently this is needed for Objective-C. */
6119 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
6120 /* Check alignment. */
6121 && TYPE_ALIGN (cand
) == TYPE_ALIGN (base
)
6122 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
6123 TYPE_ATTRIBUTES (base
)));
6126 /* Returns true iff CAND is equivalent to BASE with ALIGN. */
6129 check_aligned_type (const_tree cand
, const_tree base
, unsigned int align
)
6131 return (TYPE_QUALS (cand
) == TYPE_QUALS (base
)
6132 && TYPE_NAME (cand
) == TYPE_NAME (base
)
6133 /* Apparently this is needed for Objective-C. */
6134 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
6135 /* Check alignment. */
6136 && TYPE_ALIGN (cand
) == align
6137 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
6138 TYPE_ATTRIBUTES (base
)));
6141 /* This function checks to see if TYPE matches the size one of the built-in
6142 atomic types, and returns that core atomic type. */
6145 find_atomic_core_type (tree type
)
6147 tree base_atomic_type
;
6149 /* Only handle complete types. */
6150 if (TYPE_SIZE (type
) == NULL_TREE
)
6153 HOST_WIDE_INT type_size
= tree_to_uhwi (TYPE_SIZE (type
));
6157 base_atomic_type
= atomicQI_type_node
;
6161 base_atomic_type
= atomicHI_type_node
;
6165 base_atomic_type
= atomicSI_type_node
;
6169 base_atomic_type
= atomicDI_type_node
;
6173 base_atomic_type
= atomicTI_type_node
;
6177 base_atomic_type
= NULL_TREE
;
6180 return base_atomic_type
;
6183 /* Return a version of the TYPE, qualified as indicated by the
6184 TYPE_QUALS, if one exists. If no qualified version exists yet,
6185 return NULL_TREE. */
6188 get_qualified_type (tree type
, int type_quals
)
6192 if (TYPE_QUALS (type
) == type_quals
)
6195 /* Search the chain of variants to see if there is already one there just
6196 like the one we need to have. If so, use that existing one. We must
6197 preserve the TYPE_NAME, since there is code that depends on this. */
6198 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
6199 if (check_qualified_type (t
, type
, type_quals
))
6205 /* Like get_qualified_type, but creates the type if it does not
6206 exist. This function never returns NULL_TREE. */
6209 build_qualified_type (tree type
, int type_quals
)
6213 /* See if we already have the appropriate qualified variant. */
6214 t
= get_qualified_type (type
, type_quals
);
6216 /* If not, build it. */
6219 t
= build_variant_type_copy (type
);
6220 set_type_quals (t
, type_quals
);
6222 if (((type_quals
& TYPE_QUAL_ATOMIC
) == TYPE_QUAL_ATOMIC
))
6224 /* See if this object can map to a basic atomic type. */
6225 tree atomic_type
= find_atomic_core_type (type
);
6228 /* Ensure the alignment of this type is compatible with
6229 the required alignment of the atomic type. */
6230 if (TYPE_ALIGN (atomic_type
) > TYPE_ALIGN (t
))
6231 TYPE_ALIGN (t
) = TYPE_ALIGN (atomic_type
);
6235 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
6236 /* Propagate structural equality. */
6237 SET_TYPE_STRUCTURAL_EQUALITY (t
);
6238 else if (TYPE_CANONICAL (type
) != type
)
6239 /* Build the underlying canonical type, since it is different
6241 TYPE_CANONICAL (t
) = build_qualified_type (TYPE_CANONICAL (type
),
6244 /* T is its own canonical type. */
6245 TYPE_CANONICAL (t
) = t
;
6252 /* Create a variant of type T with alignment ALIGN. */
6255 build_aligned_type (tree type
, unsigned int align
)
6259 if (TYPE_PACKED (type
)
6260 || TYPE_ALIGN (type
) == align
)
6263 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
6264 if (check_aligned_type (t
, type
, align
))
6267 t
= build_variant_type_copy (type
);
6268 TYPE_ALIGN (t
) = align
;
6273 /* Create a new distinct copy of TYPE. The new type is made its own
6274 MAIN_VARIANT. If TYPE requires structural equality checks, the
6275 resulting type requires structural equality checks; otherwise, its
6276 TYPE_CANONICAL points to itself. */
6279 build_distinct_type_copy (tree type
)
6281 tree t
= copy_node (type
);
6283 TYPE_POINTER_TO (t
) = 0;
6284 TYPE_REFERENCE_TO (t
) = 0;
6286 /* Set the canonical type either to a new equivalence class, or
6287 propagate the need for structural equality checks. */
6288 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
6289 SET_TYPE_STRUCTURAL_EQUALITY (t
);
6291 TYPE_CANONICAL (t
) = t
;
6293 /* Make it its own variant. */
6294 TYPE_MAIN_VARIANT (t
) = t
;
6295 TYPE_NEXT_VARIANT (t
) = 0;
6297 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
6298 whose TREE_TYPE is not t. This can also happen in the Ada
6299 frontend when using subtypes. */
6304 /* Create a new variant of TYPE, equivalent but distinct. This is so
6305 the caller can modify it. TYPE_CANONICAL for the return type will
6306 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
6307 are considered equal by the language itself (or that both types
6308 require structural equality checks). */
6311 build_variant_type_copy (tree type
)
6313 tree t
, m
= TYPE_MAIN_VARIANT (type
);
6315 t
= build_distinct_type_copy (type
);
6317 /* Since we're building a variant, assume that it is a non-semantic
6318 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
6319 TYPE_CANONICAL (t
) = TYPE_CANONICAL (type
);
6321 /* Add the new type to the chain of variants of TYPE. */
6322 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (m
);
6323 TYPE_NEXT_VARIANT (m
) = t
;
6324 TYPE_MAIN_VARIANT (t
) = m
;
6329 /* Return true if the from tree in both tree maps are equal. */
6332 tree_map_base_eq (const void *va
, const void *vb
)
6334 const struct tree_map_base
*const a
= (const struct tree_map_base
*) va
,
6335 *const b
= (const struct tree_map_base
*) vb
;
6336 return (a
->from
== b
->from
);
6339 /* Hash a from tree in a tree_base_map. */
6342 tree_map_base_hash (const void *item
)
6344 return htab_hash_pointer (((const struct tree_map_base
*)item
)->from
);
6347 /* Return true if this tree map structure is marked for garbage collection
6348 purposes. We simply return true if the from tree is marked, so that this
6349 structure goes away when the from tree goes away. */
6352 tree_map_base_marked_p (const void *p
)
6354 return ggc_marked_p (((const struct tree_map_base
*) p
)->from
);
6357 /* Hash a from tree in a tree_map. */
6360 tree_map_hash (const void *item
)
6362 return (((const struct tree_map
*) item
)->hash
);
6365 /* Hash a from tree in a tree_decl_map. */
6368 tree_decl_map_hash (const void *item
)
6370 return DECL_UID (((const struct tree_decl_map
*) item
)->base
.from
);
6373 /* Return the initialization priority for DECL. */
6376 decl_init_priority_lookup (tree decl
)
6378 struct tree_priority_map
*h
;
6379 struct tree_map_base in
;
6381 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl
));
6383 h
= (struct tree_priority_map
*) htab_find (init_priority_for_decl
, &in
);
6384 return h
? h
->init
: DEFAULT_INIT_PRIORITY
;
6387 /* Return the finalization priority for DECL. */
6390 decl_fini_priority_lookup (tree decl
)
6392 struct tree_priority_map
*h
;
6393 struct tree_map_base in
;
6395 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
6397 h
= (struct tree_priority_map
*) htab_find (init_priority_for_decl
, &in
);
6398 return h
? h
->fini
: DEFAULT_INIT_PRIORITY
;
6401 /* Return the initialization and finalization priority information for
6402 DECL. If there is no previous priority information, a freshly
6403 allocated structure is returned. */
6405 static struct tree_priority_map
*
6406 decl_priority_info (tree decl
)
6408 struct tree_priority_map in
;
6409 struct tree_priority_map
*h
;
6412 in
.base
.from
= decl
;
6413 loc
= htab_find_slot (init_priority_for_decl
, &in
, INSERT
);
6414 h
= (struct tree_priority_map
*) *loc
;
6417 h
= ggc_cleared_alloc
<tree_priority_map
> ();
6419 h
->base
.from
= decl
;
6420 h
->init
= DEFAULT_INIT_PRIORITY
;
6421 h
->fini
= DEFAULT_INIT_PRIORITY
;
6427 /* Set the initialization priority for DECL to PRIORITY. */
6430 decl_init_priority_insert (tree decl
, priority_type priority
)
6432 struct tree_priority_map
*h
;
6434 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl
));
6435 if (priority
== DEFAULT_INIT_PRIORITY
)
6437 h
= decl_priority_info (decl
);
6441 /* Set the finalization priority for DECL to PRIORITY. */
6444 decl_fini_priority_insert (tree decl
, priority_type priority
)
6446 struct tree_priority_map
*h
;
6448 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
6449 if (priority
== DEFAULT_INIT_PRIORITY
)
6451 h
= decl_priority_info (decl
);
6455 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
6458 print_debug_expr_statistics (void)
6460 fprintf (stderr
, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
6461 (long) htab_size (debug_expr_for_decl
),
6462 (long) htab_elements (debug_expr_for_decl
),
6463 htab_collisions (debug_expr_for_decl
));
6466 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
6469 print_value_expr_statistics (void)
6471 fprintf (stderr
, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
6472 (long) htab_size (value_expr_for_decl
),
6473 (long) htab_elements (value_expr_for_decl
),
6474 htab_collisions (value_expr_for_decl
));
6477 /* Lookup a debug expression for FROM, and return it if we find one. */
6480 decl_debug_expr_lookup (tree from
)
6482 struct tree_decl_map
*h
, in
;
6483 in
.base
.from
= from
;
6485 h
= (struct tree_decl_map
*)
6486 htab_find_with_hash (debug_expr_for_decl
, &in
, DECL_UID (from
));
6492 /* Insert a mapping FROM->TO in the debug expression hashtable. */
6495 decl_debug_expr_insert (tree from
, tree to
)
6497 struct tree_decl_map
*h
;
6500 h
= ggc_alloc
<tree_decl_map
> ();
6501 h
->base
.from
= from
;
6503 loc
= htab_find_slot_with_hash (debug_expr_for_decl
, h
, DECL_UID (from
),
6505 *(struct tree_decl_map
**) loc
= h
;
6508 /* Lookup a value expression for FROM, and return it if we find one. */
6511 decl_value_expr_lookup (tree from
)
6513 struct tree_decl_map
*h
, in
;
6514 in
.base
.from
= from
;
6516 h
= (struct tree_decl_map
*)
6517 htab_find_with_hash (value_expr_for_decl
, &in
, DECL_UID (from
));
6523 /* Insert a mapping FROM->TO in the value expression hashtable. */
6526 decl_value_expr_insert (tree from
, tree to
)
6528 struct tree_decl_map
*h
;
6531 h
= ggc_alloc
<tree_decl_map
> ();
6532 h
->base
.from
= from
;
6534 loc
= htab_find_slot_with_hash (value_expr_for_decl
, h
, DECL_UID (from
),
6536 *(struct tree_decl_map
**) loc
= h
;
6539 /* Lookup a vector of debug arguments for FROM, and return it if we
6543 decl_debug_args_lookup (tree from
)
6545 struct tree_vec_map
*h
, in
;
6547 if (!DECL_HAS_DEBUG_ARGS_P (from
))
6549 gcc_checking_assert (debug_args_for_decl
!= NULL
);
6550 in
.base
.from
= from
;
6551 h
= (struct tree_vec_map
*)
6552 htab_find_with_hash (debug_args_for_decl
, &in
, DECL_UID (from
));
6558 /* Insert a mapping FROM->empty vector of debug arguments in the value
6559 expression hashtable. */
6562 decl_debug_args_insert (tree from
)
6564 struct tree_vec_map
*h
;
6567 if (DECL_HAS_DEBUG_ARGS_P (from
))
6568 return decl_debug_args_lookup (from
);
6569 if (debug_args_for_decl
== NULL
)
6570 debug_args_for_decl
= htab_create_ggc (64, tree_vec_map_hash
,
6571 tree_vec_map_eq
, 0);
6572 h
= ggc_alloc
<tree_vec_map
> ();
6573 h
->base
.from
= from
;
6575 loc
= htab_find_slot_with_hash (debug_args_for_decl
, h
, DECL_UID (from
),
6577 *(struct tree_vec_map
**) loc
= h
;
6578 DECL_HAS_DEBUG_ARGS_P (from
) = 1;
6582 /* Hashing of types so that we don't make duplicates.
6583 The entry point is `type_hash_canon'. */
6585 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
6586 with types in the TREE_VALUE slots), by adding the hash codes
6587 of the individual types. */
6590 type_hash_list (const_tree list
, hashval_t hashcode
)
6594 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
6595 if (TREE_VALUE (tail
) != error_mark_node
)
6596 hashcode
= iterative_hash_object (TYPE_HASH (TREE_VALUE (tail
)),
6602 /* These are the Hashtable callback functions. */
6604 /* Returns true iff the types are equivalent. */
6607 type_hash_eq (const void *va
, const void *vb
)
6609 const struct type_hash
*const a
= (const struct type_hash
*) va
,
6610 *const b
= (const struct type_hash
*) vb
;
6612 /* First test the things that are the same for all types. */
6613 if (a
->hash
!= b
->hash
6614 || TREE_CODE (a
->type
) != TREE_CODE (b
->type
)
6615 || TREE_TYPE (a
->type
) != TREE_TYPE (b
->type
)
6616 || !attribute_list_equal (TYPE_ATTRIBUTES (a
->type
),
6617 TYPE_ATTRIBUTES (b
->type
))
6618 || (TREE_CODE (a
->type
) != COMPLEX_TYPE
6619 && TYPE_NAME (a
->type
) != TYPE_NAME (b
->type
)))
6622 /* Be careful about comparing arrays before and after the element type
6623 has been completed; don't compare TYPE_ALIGN unless both types are
6625 if (COMPLETE_TYPE_P (a
->type
) && COMPLETE_TYPE_P (b
->type
)
6626 && (TYPE_ALIGN (a
->type
) != TYPE_ALIGN (b
->type
)
6627 || TYPE_MODE (a
->type
) != TYPE_MODE (b
->type
)))
6630 switch (TREE_CODE (a
->type
))
6635 case REFERENCE_TYPE
:
6640 return TYPE_VECTOR_SUBPARTS (a
->type
) == TYPE_VECTOR_SUBPARTS (b
->type
);
6643 if (TYPE_VALUES (a
->type
) != TYPE_VALUES (b
->type
)
6644 && !(TYPE_VALUES (a
->type
)
6645 && TREE_CODE (TYPE_VALUES (a
->type
)) == TREE_LIST
6646 && TYPE_VALUES (b
->type
)
6647 && TREE_CODE (TYPE_VALUES (b
->type
)) == TREE_LIST
6648 && type_list_equal (TYPE_VALUES (a
->type
),
6649 TYPE_VALUES (b
->type
))))
6652 /* ... fall through ... */
6657 if (TYPE_PRECISION (a
->type
) != TYPE_PRECISION (b
->type
))
6659 return ((TYPE_MAX_VALUE (a
->type
) == TYPE_MAX_VALUE (b
->type
)
6660 || tree_int_cst_equal (TYPE_MAX_VALUE (a
->type
),
6661 TYPE_MAX_VALUE (b
->type
)))
6662 && (TYPE_MIN_VALUE (a
->type
) == TYPE_MIN_VALUE (b
->type
)
6663 || tree_int_cst_equal (TYPE_MIN_VALUE (a
->type
),
6664 TYPE_MIN_VALUE (b
->type
))));
6666 case FIXED_POINT_TYPE
:
6667 return TYPE_SATURATING (a
->type
) == TYPE_SATURATING (b
->type
);
6670 return TYPE_OFFSET_BASETYPE (a
->type
) == TYPE_OFFSET_BASETYPE (b
->type
);
6673 if (TYPE_METHOD_BASETYPE (a
->type
) == TYPE_METHOD_BASETYPE (b
->type
)
6674 && (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
6675 || (TYPE_ARG_TYPES (a
->type
)
6676 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
6677 && TYPE_ARG_TYPES (b
->type
)
6678 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
6679 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
6680 TYPE_ARG_TYPES (b
->type
)))))
6684 return TYPE_DOMAIN (a
->type
) == TYPE_DOMAIN (b
->type
);
6688 case QUAL_UNION_TYPE
:
6689 return (TYPE_FIELDS (a
->type
) == TYPE_FIELDS (b
->type
)
6690 || (TYPE_FIELDS (a
->type
)
6691 && TREE_CODE (TYPE_FIELDS (a
->type
)) == TREE_LIST
6692 && TYPE_FIELDS (b
->type
)
6693 && TREE_CODE (TYPE_FIELDS (b
->type
)) == TREE_LIST
6694 && type_list_equal (TYPE_FIELDS (a
->type
),
6695 TYPE_FIELDS (b
->type
))));
6698 if (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
6699 || (TYPE_ARG_TYPES (a
->type
)
6700 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
6701 && TYPE_ARG_TYPES (b
->type
)
6702 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
6703 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
6704 TYPE_ARG_TYPES (b
->type
))))
6712 if (lang_hooks
.types
.type_hash_eq
!= NULL
)
6713 return lang_hooks
.types
.type_hash_eq (a
->type
, b
->type
);
6718 /* Return the cached hash value. */
6721 type_hash_hash (const void *item
)
6723 return ((const struct type_hash
*) item
)->hash
;
6726 /* Look in the type hash table for a type isomorphic to TYPE.
6727 If one is found, return it. Otherwise return 0. */
6730 type_hash_lookup (hashval_t hashcode
, tree type
)
6732 struct type_hash
*h
, in
;
6734 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
6735 must call that routine before comparing TYPE_ALIGNs. */
6741 h
= (struct type_hash
*) htab_find_with_hash (type_hash_table
, &in
,
6748 /* Add an entry to the type-hash-table
6749 for a type TYPE whose hash code is HASHCODE. */
6752 type_hash_add (hashval_t hashcode
, tree type
)
6754 struct type_hash
*h
;
6757 h
= ggc_alloc
<type_hash
> ();
6760 loc
= htab_find_slot_with_hash (type_hash_table
, h
, hashcode
, INSERT
);
6764 /* Given TYPE, and HASHCODE its hash code, return the canonical
6765 object for an identical type if one already exists.
6766 Otherwise, return TYPE, and record it as the canonical object.
6768 To use this function, first create a type of the sort you want.
6769 Then compute its hash code from the fields of the type that
6770 make it different from other similar types.
6771 Then call this function and use the value. */
6774 type_hash_canon (unsigned int hashcode
, tree type
)
6778 /* The hash table only contains main variants, so ensure that's what we're
6780 gcc_assert (TYPE_MAIN_VARIANT (type
) == type
);
6782 /* See if the type is in the hash table already. If so, return it.
6783 Otherwise, add the type. */
6784 t1
= type_hash_lookup (hashcode
, type
);
6787 if (GATHER_STATISTICS
)
6789 tree_code_counts
[(int) TREE_CODE (type
)]--;
6790 tree_node_counts
[(int) t_kind
]--;
6791 tree_node_sizes
[(int) t_kind
] -= sizeof (struct tree_type_non_common
);
6797 type_hash_add (hashcode
, type
);
6802 /* See if the data pointed to by the type hash table is marked. We consider
6803 it marked if the type is marked or if a debug type number or symbol
6804 table entry has been made for the type. */
6807 type_hash_marked_p (const void *p
)
6809 const_tree
const type
= ((const struct type_hash
*) p
)->type
;
6811 return ggc_marked_p (type
);
6815 print_type_hash_statistics (void)
6817 fprintf (stderr
, "Type hash: size %ld, %ld elements, %f collisions\n",
6818 (long) htab_size (type_hash_table
),
6819 (long) htab_elements (type_hash_table
),
6820 htab_collisions (type_hash_table
));
6823 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
6824 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
6825 by adding the hash codes of the individual attributes. */
6828 attribute_hash_list (const_tree list
, hashval_t hashcode
)
6832 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
6833 /* ??? Do we want to add in TREE_VALUE too? */
6834 hashcode
= iterative_hash_object
6835 (IDENTIFIER_HASH_VALUE (get_attribute_name (tail
)), hashcode
);
6839 /* Given two lists of attributes, return true if list l2 is
6840 equivalent to l1. */
6843 attribute_list_equal (const_tree l1
, const_tree l2
)
6848 return attribute_list_contained (l1
, l2
)
6849 && attribute_list_contained (l2
, l1
);
6852 /* Given two lists of attributes, return true if list L2 is
6853 completely contained within L1. */
6854 /* ??? This would be faster if attribute names were stored in a canonicalized
6855 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
6856 must be used to show these elements are equivalent (which they are). */
6857 /* ??? It's not clear that attributes with arguments will always be handled
6861 attribute_list_contained (const_tree l1
, const_tree l2
)
6865 /* First check the obvious, maybe the lists are identical. */
6869 /* Maybe the lists are similar. */
6870 for (t1
= l1
, t2
= l2
;
6872 && get_attribute_name (t1
) == get_attribute_name (t2
)
6873 && TREE_VALUE (t1
) == TREE_VALUE (t2
);
6874 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
6877 /* Maybe the lists are equal. */
6878 if (t1
== 0 && t2
== 0)
6881 for (; t2
!= 0; t2
= TREE_CHAIN (t2
))
6884 /* This CONST_CAST is okay because lookup_attribute does not
6885 modify its argument and the return value is assigned to a
6887 for (attr
= lookup_ident_attribute (get_attribute_name (t2
),
6888 CONST_CAST_TREE (l1
));
6889 attr
!= NULL_TREE
&& !attribute_value_equal (t2
, attr
);
6890 attr
= lookup_ident_attribute (get_attribute_name (t2
),
6894 if (attr
== NULL_TREE
)
6901 /* Given two lists of types
6902 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
6903 return 1 if the lists contain the same types in the same order.
6904 Also, the TREE_PURPOSEs must match. */
6907 type_list_equal (const_tree l1
, const_tree l2
)
6911 for (t1
= l1
, t2
= l2
; t1
&& t2
; t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
6912 if (TREE_VALUE (t1
) != TREE_VALUE (t2
)
6913 || (TREE_PURPOSE (t1
) != TREE_PURPOSE (t2
)
6914 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
))
6915 && (TREE_TYPE (TREE_PURPOSE (t1
))
6916 == TREE_TYPE (TREE_PURPOSE (t2
))))))
6922 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
6923 given by TYPE. If the argument list accepts variable arguments,
6924 then this function counts only the ordinary arguments. */
6927 type_num_arguments (const_tree type
)
6932 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
6933 /* If the function does not take a variable number of arguments,
6934 the last element in the list will have type `void'. */
6935 if (VOID_TYPE_P (TREE_VALUE (t
)))
6943 /* Nonzero if integer constants T1 and T2
6944 represent the same constant value. */
6947 tree_int_cst_equal (const_tree t1
, const_tree t2
)
6952 if (t1
== 0 || t2
== 0)
6955 if (TREE_CODE (t1
) == INTEGER_CST
6956 && TREE_CODE (t2
) == INTEGER_CST
6957 && wi::to_widest (t1
) == wi::to_widest (t2
))
6963 /* Return true if T is an INTEGER_CST whose numerical value (extended
6964 according to TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. */
6967 tree_fits_shwi_p (const_tree t
)
6969 return (t
!= NULL_TREE
6970 && TREE_CODE (t
) == INTEGER_CST
6971 && wi::fits_shwi_p (wi::to_widest (t
)));
6974 /* Return true if T is an INTEGER_CST whose numerical value (extended
6975 according to TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. */
6978 tree_fits_uhwi_p (const_tree t
)
6980 return (t
!= NULL_TREE
6981 && TREE_CODE (t
) == INTEGER_CST
6982 && wi::fits_uhwi_p (wi::to_widest (t
)));
6985 /* T is an INTEGER_CST whose numerical value (extended according to
6986 TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. Return that
6990 tree_to_shwi (const_tree t
)
6992 gcc_assert (tree_fits_shwi_p (t
));
6993 return TREE_INT_CST_LOW (t
);
6996 /* T is an INTEGER_CST whose numerical value (extended according to
6997 TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. Return that
7000 unsigned HOST_WIDE_INT
7001 tree_to_uhwi (const_tree t
)
7003 gcc_assert (tree_fits_uhwi_p (t
));
7004 return TREE_INT_CST_LOW (t
);
7007 /* Return the most significant (sign) bit of T. */
7010 tree_int_cst_sign_bit (const_tree t
)
7012 unsigned bitno
= TYPE_PRECISION (TREE_TYPE (t
)) - 1;
7014 return wi::extract_uhwi (t
, bitno
, 1);
7017 /* Return an indication of the sign of the integer constant T.
7018 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
7019 Note that -1 will never be returned if T's type is unsigned. */
7022 tree_int_cst_sgn (const_tree t
)
7024 if (wi::eq_p (t
, 0))
7026 else if (TYPE_UNSIGNED (TREE_TYPE (t
)))
7028 else if (wi::neg_p (t
))
7034 /* Return the minimum number of bits needed to represent VALUE in a
7035 signed or unsigned type, UNSIGNEDP says which. */
7038 tree_int_cst_min_precision (tree value
, signop sgn
)
7040 /* If the value is negative, compute its negative minus 1. The latter
7041 adjustment is because the absolute value of the largest negative value
7042 is one larger than the largest positive value. This is equivalent to
7043 a bit-wise negation, so use that operation instead. */
7045 if (tree_int_cst_sgn (value
) < 0)
7046 value
= fold_build1 (BIT_NOT_EXPR
, TREE_TYPE (value
), value
);
7048 /* Return the number of bits needed, taking into account the fact
7049 that we need one more bit for a signed than unsigned type.
7050 If value is 0 or -1, the minimum precision is 1 no matter
7051 whether unsignedp is true or false. */
7053 if (integer_zerop (value
))
7056 return tree_floor_log2 (value
) + 1 + (sgn
== SIGNED
? 1 : 0) ;
7059 /* Return truthvalue of whether T1 is the same tree structure as T2.
7060 Return 1 if they are the same.
7061 Return 0 if they are understandably different.
7062 Return -1 if either contains tree structure not understood by
7066 simple_cst_equal (const_tree t1
, const_tree t2
)
7068 enum tree_code code1
, code2
;
7074 if (t1
== 0 || t2
== 0)
7077 code1
= TREE_CODE (t1
);
7078 code2
= TREE_CODE (t2
);
7080 if (CONVERT_EXPR_CODE_P (code1
) || code1
== NON_LVALUE_EXPR
)
7082 if (CONVERT_EXPR_CODE_P (code2
)
7083 || code2
== NON_LVALUE_EXPR
)
7084 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7086 return simple_cst_equal (TREE_OPERAND (t1
, 0), t2
);
7089 else if (CONVERT_EXPR_CODE_P (code2
)
7090 || code2
== NON_LVALUE_EXPR
)
7091 return simple_cst_equal (t1
, TREE_OPERAND (t2
, 0));
7099 return wi::to_widest (t1
) == wi::to_widest (t2
);
7102 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1
), TREE_REAL_CST (t2
));
7105 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1
), TREE_FIXED_CST (t2
));
7108 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
7109 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
7110 TREE_STRING_LENGTH (t1
)));
7114 unsigned HOST_WIDE_INT idx
;
7115 vec
<constructor_elt
, va_gc
> *v1
= CONSTRUCTOR_ELTS (t1
);
7116 vec
<constructor_elt
, va_gc
> *v2
= CONSTRUCTOR_ELTS (t2
);
7118 if (vec_safe_length (v1
) != vec_safe_length (v2
))
7121 for (idx
= 0; idx
< vec_safe_length (v1
); ++idx
)
7122 /* ??? Should we handle also fields here? */
7123 if (!simple_cst_equal ((*v1
)[idx
].value
, (*v2
)[idx
].value
))
7129 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7132 cmp
= simple_cst_equal (CALL_EXPR_FN (t1
), CALL_EXPR_FN (t2
));
7135 if (call_expr_nargs (t1
) != call_expr_nargs (t2
))
7138 const_tree arg1
, arg2
;
7139 const_call_expr_arg_iterator iter1
, iter2
;
7140 for (arg1
= first_const_call_expr_arg (t1
, &iter1
),
7141 arg2
= first_const_call_expr_arg (t2
, &iter2
);
7143 arg1
= next_const_call_expr_arg (&iter1
),
7144 arg2
= next_const_call_expr_arg (&iter2
))
7146 cmp
= simple_cst_equal (arg1
, arg2
);
7150 return arg1
== arg2
;
7154 /* Special case: if either target is an unallocated VAR_DECL,
7155 it means that it's going to be unified with whatever the
7156 TARGET_EXPR is really supposed to initialize, so treat it
7157 as being equivalent to anything. */
7158 if ((TREE_CODE (TREE_OPERAND (t1
, 0)) == VAR_DECL
7159 && DECL_NAME (TREE_OPERAND (t1
, 0)) == NULL_TREE
7160 && !DECL_RTL_SET_P (TREE_OPERAND (t1
, 0)))
7161 || (TREE_CODE (TREE_OPERAND (t2
, 0)) == VAR_DECL
7162 && DECL_NAME (TREE_OPERAND (t2
, 0)) == NULL_TREE
7163 && !DECL_RTL_SET_P (TREE_OPERAND (t2
, 0))))
7166 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7171 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
7173 case WITH_CLEANUP_EXPR
:
7174 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7178 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t1
, 1));
7181 if (TREE_OPERAND (t1
, 1) == TREE_OPERAND (t2
, 1))
7182 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7196 /* This general rule works for most tree codes. All exceptions should be
7197 handled above. If this is a language-specific tree code, we can't
7198 trust what might be in the operand, so say we don't know
7200 if ((int) code1
>= (int) LAST_AND_UNUSED_TREE_CODE
)
7203 switch (TREE_CODE_CLASS (code1
))
7207 case tcc_comparison
:
7208 case tcc_expression
:
7212 for (i
= 0; i
< TREE_CODE_LENGTH (code1
); i
++)
7214 cmp
= simple_cst_equal (TREE_OPERAND (t1
, i
), TREE_OPERAND (t2
, i
));
7226 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
7227 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
7228 than U, respectively. */
7231 compare_tree_int (const_tree t
, unsigned HOST_WIDE_INT u
)
7233 if (tree_int_cst_sgn (t
) < 0)
7235 else if (!tree_fits_uhwi_p (t
))
7237 else if (TREE_INT_CST_LOW (t
) == u
)
7239 else if (TREE_INT_CST_LOW (t
) < u
)
7245 /* Return true if SIZE represents a constant size that is in bounds of
7246 what the middle-end and the backend accepts (covering not more than
7247 half of the address-space). */
7250 valid_constant_size_p (const_tree size
)
7252 if (! tree_fits_uhwi_p (size
)
7253 || TREE_OVERFLOW (size
)
7254 || tree_int_cst_sign_bit (size
) != 0)
7259 /* Return the precision of the type, or for a complex or vector type the
7260 precision of the type of its elements. */
7263 element_precision (const_tree type
)
7265 enum tree_code code
= TREE_CODE (type
);
7266 if (code
== COMPLEX_TYPE
|| code
== VECTOR_TYPE
)
7267 type
= TREE_TYPE (type
);
7269 return TYPE_PRECISION (type
);
7272 /* Return true if CODE represents an associative tree code. Otherwise
7275 associative_tree_code (enum tree_code code
)
7294 /* Return true if CODE represents a commutative tree code. Otherwise
7297 commutative_tree_code (enum tree_code code
)
7303 case MULT_HIGHPART_EXPR
:
7311 case UNORDERED_EXPR
:
7315 case TRUTH_AND_EXPR
:
7316 case TRUTH_XOR_EXPR
:
7318 case WIDEN_MULT_EXPR
:
7319 case VEC_WIDEN_MULT_HI_EXPR
:
7320 case VEC_WIDEN_MULT_LO_EXPR
:
7321 case VEC_WIDEN_MULT_EVEN_EXPR
:
7322 case VEC_WIDEN_MULT_ODD_EXPR
:
7331 /* Return true if CODE represents a ternary tree code for which the
7332 first two operands are commutative. Otherwise return false. */
7334 commutative_ternary_tree_code (enum tree_code code
)
7338 case WIDEN_MULT_PLUS_EXPR
:
7339 case WIDEN_MULT_MINUS_EXPR
:
7348 /* Generate a hash value for an expression. This can be used iteratively
7349 by passing a previous result as the VAL argument.
7351 This function is intended to produce the same hash for expressions which
7352 would compare equal using operand_equal_p. */
7355 iterative_hash_expr (const_tree t
, hashval_t val
)
7358 enum tree_code code
;
7359 enum tree_code_class tclass
;
7362 return iterative_hash_hashval_t (0, val
);
7364 code
= TREE_CODE (t
);
7368 /* Alas, constants aren't shared, so we can't rely on pointer
7371 return iterative_hash_hashval_t (0, val
);
7373 for (i
= 0; i
< TREE_INT_CST_NUNITS (t
); i
++)
7374 val
= iterative_hash_host_wide_int (TREE_INT_CST_ELT (t
, i
), val
);
7378 unsigned int val2
= real_hash (TREE_REAL_CST_PTR (t
));
7380 return iterative_hash_hashval_t (val2
, val
);
7384 unsigned int val2
= fixed_hash (TREE_FIXED_CST_PTR (t
));
7386 return iterative_hash_hashval_t (val2
, val
);
7389 return iterative_hash (TREE_STRING_POINTER (t
),
7390 TREE_STRING_LENGTH (t
), val
);
7392 val
= iterative_hash_expr (TREE_REALPART (t
), val
);
7393 return iterative_hash_expr (TREE_IMAGPART (t
), val
);
7397 for (i
= 0; i
< VECTOR_CST_NELTS (t
); ++i
)
7398 val
= iterative_hash_expr (VECTOR_CST_ELT (t
, i
), val
);
7402 /* We can just compare by pointer. */
7403 return iterative_hash_host_wide_int (SSA_NAME_VERSION (t
), val
);
7404 case PLACEHOLDER_EXPR
:
7405 /* The node itself doesn't matter. */
7408 /* A list of expressions, for a CALL_EXPR or as the elements of a
7410 for (; t
; t
= TREE_CHAIN (t
))
7411 val
= iterative_hash_expr (TREE_VALUE (t
), val
);
7415 unsigned HOST_WIDE_INT idx
;
7417 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t
), idx
, field
, value
)
7419 val
= iterative_hash_expr (field
, val
);
7420 val
= iterative_hash_expr (value
, val
);
7425 /* When referring to a built-in FUNCTION_DECL, use the __builtin__ form.
7426 Otherwise nodes that compare equal according to operand_equal_p might
7427 get different hash codes. However, don't do this for machine specific
7428 or front end builtins, since the function code is overloaded in those
7430 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
7431 && builtin_decl_explicit_p (DECL_FUNCTION_CODE (t
)))
7433 t
= builtin_decl_explicit (DECL_FUNCTION_CODE (t
));
7434 code
= TREE_CODE (t
);
7438 tclass
= TREE_CODE_CLASS (code
);
7440 if (tclass
== tcc_declaration
)
7442 /* DECL's have a unique ID */
7443 val
= iterative_hash_host_wide_int (DECL_UID (t
), val
);
7447 gcc_assert (IS_EXPR_CODE_CLASS (tclass
));
7449 val
= iterative_hash_object (code
, val
);
7451 /* Don't hash the type, that can lead to having nodes which
7452 compare equal according to operand_equal_p, but which
7453 have different hash codes. */
7454 if (CONVERT_EXPR_CODE_P (code
)
7455 || code
== NON_LVALUE_EXPR
)
7457 /* Make sure to include signness in the hash computation. */
7458 val
+= TYPE_UNSIGNED (TREE_TYPE (t
));
7459 val
= iterative_hash_expr (TREE_OPERAND (t
, 0), val
);
7462 else if (commutative_tree_code (code
))
7464 /* It's a commutative expression. We want to hash it the same
7465 however it appears. We do this by first hashing both operands
7466 and then rehashing based on the order of their independent
7468 hashval_t one
= iterative_hash_expr (TREE_OPERAND (t
, 0), 0);
7469 hashval_t two
= iterative_hash_expr (TREE_OPERAND (t
, 1), 0);
7473 t
= one
, one
= two
, two
= t
;
7475 val
= iterative_hash_hashval_t (one
, val
);
7476 val
= iterative_hash_hashval_t (two
, val
);
7479 for (i
= TREE_OPERAND_LENGTH (t
) - 1; i
>= 0; --i
)
7480 val
= iterative_hash_expr (TREE_OPERAND (t
, i
), val
);
7486 /* Constructors for pointer, array and function types.
7487 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
7488 constructed by language-dependent code, not here.) */
7490 /* Construct, lay out and return the type of pointers to TO_TYPE with
7491 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
7492 reference all of memory. If such a type has already been
7493 constructed, reuse it. */
7496 build_pointer_type_for_mode (tree to_type
, enum machine_mode mode
,
7501 if (to_type
== error_mark_node
)
7502 return error_mark_node
;
7504 /* If the pointed-to type has the may_alias attribute set, force
7505 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7506 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
7507 can_alias_all
= true;
7509 /* In some cases, languages will have things that aren't a POINTER_TYPE
7510 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
7511 In that case, return that type without regard to the rest of our
7514 ??? This is a kludge, but consistent with the way this function has
7515 always operated and there doesn't seem to be a good way to avoid this
7517 if (TYPE_POINTER_TO (to_type
) != 0
7518 && TREE_CODE (TYPE_POINTER_TO (to_type
)) != POINTER_TYPE
)
7519 return TYPE_POINTER_TO (to_type
);
7521 /* First, if we already have a type for pointers to TO_TYPE and it's
7522 the proper mode, use it. */
7523 for (t
= TYPE_POINTER_TO (to_type
); t
; t
= TYPE_NEXT_PTR_TO (t
))
7524 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
7527 t
= make_node (POINTER_TYPE
);
7529 TREE_TYPE (t
) = to_type
;
7530 SET_TYPE_MODE (t
, mode
);
7531 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
7532 TYPE_NEXT_PTR_TO (t
) = TYPE_POINTER_TO (to_type
);
7533 TYPE_POINTER_TO (to_type
) = t
;
7535 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
))
7536 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7537 else if (TYPE_CANONICAL (to_type
) != to_type
)
7539 = build_pointer_type_for_mode (TYPE_CANONICAL (to_type
),
7540 mode
, can_alias_all
);
7542 /* Lay out the type. This function has many callers that are concerned
7543 with expression-construction, and this simplifies them all. */
7549 /* By default build pointers in ptr_mode. */
7552 build_pointer_type (tree to_type
)
7554 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
7555 : TYPE_ADDR_SPACE (to_type
);
7556 enum machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
7557 return build_pointer_type_for_mode (to_type
, pointer_mode
, false);
7560 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
7563 build_reference_type_for_mode (tree to_type
, enum machine_mode mode
,
7568 if (to_type
== error_mark_node
)
7569 return error_mark_node
;
7571 /* If the pointed-to type has the may_alias attribute set, force
7572 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7573 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
7574 can_alias_all
= true;
7576 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
7577 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
7578 In that case, return that type without regard to the rest of our
7581 ??? This is a kludge, but consistent with the way this function has
7582 always operated and there doesn't seem to be a good way to avoid this
7584 if (TYPE_REFERENCE_TO (to_type
) != 0
7585 && TREE_CODE (TYPE_REFERENCE_TO (to_type
)) != REFERENCE_TYPE
)
7586 return TYPE_REFERENCE_TO (to_type
);
7588 /* First, if we already have a type for pointers to TO_TYPE and it's
7589 the proper mode, use it. */
7590 for (t
= TYPE_REFERENCE_TO (to_type
); t
; t
= TYPE_NEXT_REF_TO (t
))
7591 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
7594 t
= make_node (REFERENCE_TYPE
);
7596 TREE_TYPE (t
) = to_type
;
7597 SET_TYPE_MODE (t
, mode
);
7598 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
7599 TYPE_NEXT_REF_TO (t
) = TYPE_REFERENCE_TO (to_type
);
7600 TYPE_REFERENCE_TO (to_type
) = t
;
7602 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
))
7603 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7604 else if (TYPE_CANONICAL (to_type
) != to_type
)
7606 = build_reference_type_for_mode (TYPE_CANONICAL (to_type
),
7607 mode
, can_alias_all
);
7615 /* Build the node for the type of references-to-TO_TYPE by default
7619 build_reference_type (tree to_type
)
7621 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
7622 : TYPE_ADDR_SPACE (to_type
);
7623 enum machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
7624 return build_reference_type_for_mode (to_type
, pointer_mode
, false);
7627 #define MAX_INT_CACHED_PREC \
7628 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
7629 static GTY(()) tree nonstandard_integer_type_cache
[2 * MAX_INT_CACHED_PREC
+ 2];
7631 /* Builds a signed or unsigned integer type of precision PRECISION.
7632 Used for C bitfields whose precision does not match that of
7633 built-in target types. */
7635 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision
,
7641 unsignedp
= MAX_INT_CACHED_PREC
+ 1;
7643 if (precision
<= MAX_INT_CACHED_PREC
)
7645 itype
= nonstandard_integer_type_cache
[precision
+ unsignedp
];
7650 itype
= make_node (INTEGER_TYPE
);
7651 TYPE_PRECISION (itype
) = precision
;
7654 fixup_unsigned_type (itype
);
7656 fixup_signed_type (itype
);
7659 if (tree_fits_uhwi_p (TYPE_MAX_VALUE (itype
)))
7660 ret
= type_hash_canon (tree_to_uhwi (TYPE_MAX_VALUE (itype
)), itype
);
7661 if (precision
<= MAX_INT_CACHED_PREC
)
7662 nonstandard_integer_type_cache
[precision
+ unsignedp
] = ret
;
7667 /* Create a range of some discrete type TYPE (an INTEGER_TYPE, ENUMERAL_TYPE
7668 or BOOLEAN_TYPE) with low bound LOWVAL and high bound HIGHVAL. If SHARED
7669 is true, reuse such a type that has already been constructed. */
7672 build_range_type_1 (tree type
, tree lowval
, tree highval
, bool shared
)
7674 tree itype
= make_node (INTEGER_TYPE
);
7675 hashval_t hashcode
= 0;
7677 TREE_TYPE (itype
) = type
;
7679 TYPE_MIN_VALUE (itype
) = fold_convert (type
, lowval
);
7680 TYPE_MAX_VALUE (itype
) = highval
? fold_convert (type
, highval
) : NULL
;
7682 TYPE_PRECISION (itype
) = TYPE_PRECISION (type
);
7683 SET_TYPE_MODE (itype
, TYPE_MODE (type
));
7684 TYPE_SIZE (itype
) = TYPE_SIZE (type
);
7685 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (type
);
7686 TYPE_ALIGN (itype
) = TYPE_ALIGN (type
);
7687 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (type
);
7692 if ((TYPE_MIN_VALUE (itype
)
7693 && TREE_CODE (TYPE_MIN_VALUE (itype
)) != INTEGER_CST
)
7694 || (TYPE_MAX_VALUE (itype
)
7695 && TREE_CODE (TYPE_MAX_VALUE (itype
)) != INTEGER_CST
))
7697 /* Since we cannot reliably merge this type, we need to compare it using
7698 structural equality checks. */
7699 SET_TYPE_STRUCTURAL_EQUALITY (itype
);
7703 hashcode
= iterative_hash_expr (TYPE_MIN_VALUE (itype
), hashcode
);
7704 hashcode
= iterative_hash_expr (TYPE_MAX_VALUE (itype
), hashcode
);
7705 hashcode
= iterative_hash_hashval_t (TYPE_HASH (type
), hashcode
);
7706 itype
= type_hash_canon (hashcode
, itype
);
7711 /* Wrapper around build_range_type_1 with SHARED set to true. */
7714 build_range_type (tree type
, tree lowval
, tree highval
)
7716 return build_range_type_1 (type
, lowval
, highval
, true);
7719 /* Wrapper around build_range_type_1 with SHARED set to false. */
7722 build_nonshared_range_type (tree type
, tree lowval
, tree highval
)
7724 return build_range_type_1 (type
, lowval
, highval
, false);
7727 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
7728 MAXVAL should be the maximum value in the domain
7729 (one less than the length of the array).
7731 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
7732 We don't enforce this limit, that is up to caller (e.g. language front end).
7733 The limit exists because the result is a signed type and we don't handle
7734 sizes that use more than one HOST_WIDE_INT. */
7737 build_index_type (tree maxval
)
7739 return build_range_type (sizetype
, size_zero_node
, maxval
);
7742 /* Return true if the debug information for TYPE, a subtype, should be emitted
7743 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
7744 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
7745 debug info and doesn't reflect the source code. */
7748 subrange_type_for_debug_p (const_tree type
, tree
*lowval
, tree
*highval
)
7750 tree base_type
= TREE_TYPE (type
), low
, high
;
7752 /* Subrange types have a base type which is an integral type. */
7753 if (!INTEGRAL_TYPE_P (base_type
))
7756 /* Get the real bounds of the subtype. */
7757 if (lang_hooks
.types
.get_subrange_bounds
)
7758 lang_hooks
.types
.get_subrange_bounds (type
, &low
, &high
);
7761 low
= TYPE_MIN_VALUE (type
);
7762 high
= TYPE_MAX_VALUE (type
);
7765 /* If the type and its base type have the same representation and the same
7766 name, then the type is not a subrange but a copy of the base type. */
7767 if ((TREE_CODE (base_type
) == INTEGER_TYPE
7768 || TREE_CODE (base_type
) == BOOLEAN_TYPE
)
7769 && int_size_in_bytes (type
) == int_size_in_bytes (base_type
)
7770 && tree_int_cst_equal (low
, TYPE_MIN_VALUE (base_type
))
7771 && tree_int_cst_equal (high
, TYPE_MAX_VALUE (base_type
))
7772 && TYPE_IDENTIFIER (type
) == TYPE_IDENTIFIER (base_type
))
7782 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
7783 and number of elements specified by the range of values of INDEX_TYPE.
7784 If SHARED is true, reuse such a type that has already been constructed. */
7787 build_array_type_1 (tree elt_type
, tree index_type
, bool shared
)
7791 if (TREE_CODE (elt_type
) == FUNCTION_TYPE
)
7793 error ("arrays of functions are not meaningful");
7794 elt_type
= integer_type_node
;
7797 t
= make_node (ARRAY_TYPE
);
7798 TREE_TYPE (t
) = elt_type
;
7799 TYPE_DOMAIN (t
) = index_type
;
7800 TYPE_ADDR_SPACE (t
) = TYPE_ADDR_SPACE (elt_type
);
7803 /* If the element type is incomplete at this point we get marked for
7804 structural equality. Do not record these types in the canonical
7806 if (TYPE_STRUCTURAL_EQUALITY_P (t
))
7811 hashval_t hashcode
= iterative_hash_object (TYPE_HASH (elt_type
), 0);
7813 hashcode
= iterative_hash_object (TYPE_HASH (index_type
), hashcode
);
7814 t
= type_hash_canon (hashcode
, t
);
7817 if (TYPE_CANONICAL (t
) == t
)
7819 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type
)
7820 || (index_type
&& TYPE_STRUCTURAL_EQUALITY_P (index_type
)))
7821 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7822 else if (TYPE_CANONICAL (elt_type
) != elt_type
7823 || (index_type
&& TYPE_CANONICAL (index_type
) != index_type
))
7825 = build_array_type_1 (TYPE_CANONICAL (elt_type
),
7827 ? TYPE_CANONICAL (index_type
) : NULL_TREE
,
7834 /* Wrapper around build_array_type_1 with SHARED set to true. */
7837 build_array_type (tree elt_type
, tree index_type
)
7839 return build_array_type_1 (elt_type
, index_type
, true);
7842 /* Wrapper around build_array_type_1 with SHARED set to false. */
7845 build_nonshared_array_type (tree elt_type
, tree index_type
)
7847 return build_array_type_1 (elt_type
, index_type
, false);
7850 /* Return a representation of ELT_TYPE[NELTS], using indices of type
7854 build_array_type_nelts (tree elt_type
, unsigned HOST_WIDE_INT nelts
)
7856 return build_array_type (elt_type
, build_index_type (size_int (nelts
- 1)));
7859 /* Recursively examines the array elements of TYPE, until a non-array
7860 element type is found. */
7863 strip_array_types (tree type
)
7865 while (TREE_CODE (type
) == ARRAY_TYPE
)
7866 type
= TREE_TYPE (type
);
7871 /* Computes the canonical argument types from the argument type list
7874 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
7875 on entry to this function, or if any of the ARGTYPES are
7878 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
7879 true on entry to this function, or if any of the ARGTYPES are
7882 Returns a canonical argument list, which may be ARGTYPES when the
7883 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
7884 true) or would not differ from ARGTYPES. */
7887 maybe_canonicalize_argtypes (tree argtypes
,
7888 bool *any_structural_p
,
7889 bool *any_noncanonical_p
)
7892 bool any_noncanonical_argtypes_p
= false;
7894 for (arg
= argtypes
; arg
&& !(*any_structural_p
); arg
= TREE_CHAIN (arg
))
7896 if (!TREE_VALUE (arg
) || TREE_VALUE (arg
) == error_mark_node
)
7897 /* Fail gracefully by stating that the type is structural. */
7898 *any_structural_p
= true;
7899 else if (TYPE_STRUCTURAL_EQUALITY_P (TREE_VALUE (arg
)))
7900 *any_structural_p
= true;
7901 else if (TYPE_CANONICAL (TREE_VALUE (arg
)) != TREE_VALUE (arg
)
7902 || TREE_PURPOSE (arg
))
7903 /* If the argument has a default argument, we consider it
7904 non-canonical even though the type itself is canonical.
7905 That way, different variants of function and method types
7906 with default arguments will all point to the variant with
7907 no defaults as their canonical type. */
7908 any_noncanonical_argtypes_p
= true;
7911 if (*any_structural_p
)
7914 if (any_noncanonical_argtypes_p
)
7916 /* Build the canonical list of argument types. */
7917 tree canon_argtypes
= NULL_TREE
;
7918 bool is_void
= false;
7920 for (arg
= argtypes
; arg
; arg
= TREE_CHAIN (arg
))
7922 if (arg
== void_list_node
)
7925 canon_argtypes
= tree_cons (NULL_TREE
,
7926 TYPE_CANONICAL (TREE_VALUE (arg
)),
7930 canon_argtypes
= nreverse (canon_argtypes
);
7932 canon_argtypes
= chainon (canon_argtypes
, void_list_node
);
7934 /* There is a non-canonical type. */
7935 *any_noncanonical_p
= true;
7936 return canon_argtypes
;
7939 /* The canonical argument types are the same as ARGTYPES. */
7943 /* Construct, lay out and return
7944 the type of functions returning type VALUE_TYPE
7945 given arguments of types ARG_TYPES.
7946 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
7947 are data type nodes for the arguments of the function.
7948 If such a type has already been constructed, reuse it. */
7951 build_function_type (tree value_type
, tree arg_types
)
7954 hashval_t hashcode
= 0;
7955 bool any_structural_p
, any_noncanonical_p
;
7956 tree canon_argtypes
;
7958 if (TREE_CODE (value_type
) == FUNCTION_TYPE
)
7960 error ("function return type cannot be function");
7961 value_type
= integer_type_node
;
7964 /* Make a node of the sort we want. */
7965 t
= make_node (FUNCTION_TYPE
);
7966 TREE_TYPE (t
) = value_type
;
7967 TYPE_ARG_TYPES (t
) = arg_types
;
7969 /* If we already have such a type, use the old one. */
7970 hashcode
= iterative_hash_object (TYPE_HASH (value_type
), hashcode
);
7971 hashcode
= type_hash_list (arg_types
, hashcode
);
7972 t
= type_hash_canon (hashcode
, t
);
7974 /* Set up the canonical type. */
7975 any_structural_p
= TYPE_STRUCTURAL_EQUALITY_P (value_type
);
7976 any_noncanonical_p
= TYPE_CANONICAL (value_type
) != value_type
;
7977 canon_argtypes
= maybe_canonicalize_argtypes (arg_types
,
7979 &any_noncanonical_p
);
7980 if (any_structural_p
)
7981 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7982 else if (any_noncanonical_p
)
7983 TYPE_CANONICAL (t
) = build_function_type (TYPE_CANONICAL (value_type
),
7986 if (!COMPLETE_TYPE_P (t
))
7991 /* Build a function type. The RETURN_TYPE is the type returned by the
7992 function. If VAARGS is set, no void_type_node is appended to the
7993 the list. ARGP must be always be terminated be a NULL_TREE. */
7996 build_function_type_list_1 (bool vaargs
, tree return_type
, va_list argp
)
8000 t
= va_arg (argp
, tree
);
8001 for (args
= NULL_TREE
; t
!= NULL_TREE
; t
= va_arg (argp
, tree
))
8002 args
= tree_cons (NULL_TREE
, t
, args
);
8007 if (args
!= NULL_TREE
)
8008 args
= nreverse (args
);
8009 gcc_assert (last
!= void_list_node
);
8011 else if (args
== NULL_TREE
)
8012 args
= void_list_node
;
8016 args
= nreverse (args
);
8017 TREE_CHAIN (last
) = void_list_node
;
8019 args
= build_function_type (return_type
, args
);
8024 /* Build a function type. The RETURN_TYPE is the type returned by the
8025 function. If additional arguments are provided, they are
8026 additional argument types. The list of argument types must always
8027 be terminated by NULL_TREE. */
8030 build_function_type_list (tree return_type
, ...)
8035 va_start (p
, return_type
);
8036 args
= build_function_type_list_1 (false, return_type
, p
);
8041 /* Build a variable argument function type. The RETURN_TYPE is the
8042 type returned by the function. If additional arguments are provided,
8043 they are additional argument types. The list of argument types must
8044 always be terminated by NULL_TREE. */
8047 build_varargs_function_type_list (tree return_type
, ...)
8052 va_start (p
, return_type
);
8053 args
= build_function_type_list_1 (true, return_type
, p
);
8059 /* Build a function type. RETURN_TYPE is the type returned by the
8060 function; VAARGS indicates whether the function takes varargs. The
8061 function takes N named arguments, the types of which are provided in
8065 build_function_type_array_1 (bool vaargs
, tree return_type
, int n
,
8069 tree t
= vaargs
? NULL_TREE
: void_list_node
;
8071 for (i
= n
- 1; i
>= 0; i
--)
8072 t
= tree_cons (NULL_TREE
, arg_types
[i
], t
);
8074 return build_function_type (return_type
, t
);
8077 /* Build a function type. RETURN_TYPE is the type returned by the
8078 function. The function takes N named arguments, the types of which
8079 are provided in ARG_TYPES. */
8082 build_function_type_array (tree return_type
, int n
, tree
*arg_types
)
8084 return build_function_type_array_1 (false, return_type
, n
, arg_types
);
8087 /* Build a variable argument function type. RETURN_TYPE is the type
8088 returned by the function. The function takes N named arguments, the
8089 types of which are provided in ARG_TYPES. */
8092 build_varargs_function_type_array (tree return_type
, int n
, tree
*arg_types
)
8094 return build_function_type_array_1 (true, return_type
, n
, arg_types
);
8097 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
8098 and ARGTYPES (a TREE_LIST) are the return type and arguments types
8099 for the method. An implicit additional parameter (of type
8100 pointer-to-BASETYPE) is added to the ARGTYPES. */
8103 build_method_type_directly (tree basetype
,
8110 bool any_structural_p
, any_noncanonical_p
;
8111 tree canon_argtypes
;
8113 /* Make a node of the sort we want. */
8114 t
= make_node (METHOD_TYPE
);
8116 TYPE_METHOD_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
8117 TREE_TYPE (t
) = rettype
;
8118 ptype
= build_pointer_type (basetype
);
8120 /* The actual arglist for this function includes a "hidden" argument
8121 which is "this". Put it into the list of argument types. */
8122 argtypes
= tree_cons (NULL_TREE
, ptype
, argtypes
);
8123 TYPE_ARG_TYPES (t
) = argtypes
;
8125 /* If we already have such a type, use the old one. */
8126 hashcode
= iterative_hash_object (TYPE_HASH (basetype
), hashcode
);
8127 hashcode
= iterative_hash_object (TYPE_HASH (rettype
), hashcode
);
8128 hashcode
= type_hash_list (argtypes
, hashcode
);
8129 t
= type_hash_canon (hashcode
, t
);
8131 /* Set up the canonical type. */
8133 = (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
8134 || TYPE_STRUCTURAL_EQUALITY_P (rettype
));
8136 = (TYPE_CANONICAL (basetype
) != basetype
8137 || TYPE_CANONICAL (rettype
) != rettype
);
8138 canon_argtypes
= maybe_canonicalize_argtypes (TREE_CHAIN (argtypes
),
8140 &any_noncanonical_p
);
8141 if (any_structural_p
)
8142 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8143 else if (any_noncanonical_p
)
8145 = build_method_type_directly (TYPE_CANONICAL (basetype
),
8146 TYPE_CANONICAL (rettype
),
8148 if (!COMPLETE_TYPE_P (t
))
8154 /* Construct, lay out and return the type of methods belonging to class
8155 BASETYPE and whose arguments and values are described by TYPE.
8156 If that type exists already, reuse it.
8157 TYPE must be a FUNCTION_TYPE node. */
8160 build_method_type (tree basetype
, tree type
)
8162 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
8164 return build_method_type_directly (basetype
,
8166 TYPE_ARG_TYPES (type
));
8169 /* Construct, lay out and return the type of offsets to a value
8170 of type TYPE, within an object of type BASETYPE.
8171 If a suitable offset type exists already, reuse it. */
8174 build_offset_type (tree basetype
, tree type
)
8177 hashval_t hashcode
= 0;
8179 /* Make a node of the sort we want. */
8180 t
= make_node (OFFSET_TYPE
);
8182 TYPE_OFFSET_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
8183 TREE_TYPE (t
) = type
;
8185 /* If we already have such a type, use the old one. */
8186 hashcode
= iterative_hash_object (TYPE_HASH (basetype
), hashcode
);
8187 hashcode
= iterative_hash_object (TYPE_HASH (type
), hashcode
);
8188 t
= type_hash_canon (hashcode
, t
);
8190 if (!COMPLETE_TYPE_P (t
))
8193 if (TYPE_CANONICAL (t
) == t
)
8195 if (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
8196 || TYPE_STRUCTURAL_EQUALITY_P (type
))
8197 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8198 else if (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)) != basetype
8199 || TYPE_CANONICAL (type
) != type
)
8201 = build_offset_type (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)),
8202 TYPE_CANONICAL (type
));
8208 /* Create a complex type whose components are COMPONENT_TYPE. */
8211 build_complex_type (tree component_type
)
8216 gcc_assert (INTEGRAL_TYPE_P (component_type
)
8217 || SCALAR_FLOAT_TYPE_P (component_type
)
8218 || FIXED_POINT_TYPE_P (component_type
));
8220 /* Make a node of the sort we want. */
8221 t
= make_node (COMPLEX_TYPE
);
8223 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (component_type
);
8225 /* If we already have such a type, use the old one. */
8226 hashcode
= iterative_hash_object (TYPE_HASH (component_type
), 0);
8227 t
= type_hash_canon (hashcode
, t
);
8229 if (!COMPLETE_TYPE_P (t
))
8232 if (TYPE_CANONICAL (t
) == t
)
8234 if (TYPE_STRUCTURAL_EQUALITY_P (component_type
))
8235 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8236 else if (TYPE_CANONICAL (component_type
) != component_type
)
8238 = build_complex_type (TYPE_CANONICAL (component_type
));
8241 /* We need to create a name, since complex is a fundamental type. */
8242 if (! TYPE_NAME (t
))
8245 if (component_type
== char_type_node
)
8246 name
= "complex char";
8247 else if (component_type
== signed_char_type_node
)
8248 name
= "complex signed char";
8249 else if (component_type
== unsigned_char_type_node
)
8250 name
= "complex unsigned char";
8251 else if (component_type
== short_integer_type_node
)
8252 name
= "complex short int";
8253 else if (component_type
== short_unsigned_type_node
)
8254 name
= "complex short unsigned int";
8255 else if (component_type
== integer_type_node
)
8256 name
= "complex int";
8257 else if (component_type
== unsigned_type_node
)
8258 name
= "complex unsigned int";
8259 else if (component_type
== long_integer_type_node
)
8260 name
= "complex long int";
8261 else if (component_type
== long_unsigned_type_node
)
8262 name
= "complex long unsigned int";
8263 else if (component_type
== long_long_integer_type_node
)
8264 name
= "complex long long int";
8265 else if (component_type
== long_long_unsigned_type_node
)
8266 name
= "complex long long unsigned int";
8271 TYPE_NAME (t
) = build_decl (UNKNOWN_LOCATION
, TYPE_DECL
,
8272 get_identifier (name
), t
);
8275 return build_qualified_type (t
, TYPE_QUALS (component_type
));
8278 /* If TYPE is a real or complex floating-point type and the target
8279 does not directly support arithmetic on TYPE then return the wider
8280 type to be used for arithmetic on TYPE. Otherwise, return
8284 excess_precision_type (tree type
)
8286 if (flag_excess_precision
!= EXCESS_PRECISION_FAST
)
8288 int flt_eval_method
= TARGET_FLT_EVAL_METHOD
;
8289 switch (TREE_CODE (type
))
8292 switch (flt_eval_method
)
8295 if (TYPE_MODE (type
) == TYPE_MODE (float_type_node
))
8296 return double_type_node
;
8299 if (TYPE_MODE (type
) == TYPE_MODE (float_type_node
)
8300 || TYPE_MODE (type
) == TYPE_MODE (double_type_node
))
8301 return long_double_type_node
;
8308 if (TREE_CODE (TREE_TYPE (type
)) != REAL_TYPE
)
8310 switch (flt_eval_method
)
8313 if (TYPE_MODE (TREE_TYPE (type
)) == TYPE_MODE (float_type_node
))
8314 return complex_double_type_node
;
8317 if (TYPE_MODE (TREE_TYPE (type
)) == TYPE_MODE (float_type_node
)
8318 || (TYPE_MODE (TREE_TYPE (type
))
8319 == TYPE_MODE (double_type_node
)))
8320 return complex_long_double_type_node
;
8333 /* Return OP, stripped of any conversions to wider types as much as is safe.
8334 Converting the value back to OP's type makes a value equivalent to OP.
8336 If FOR_TYPE is nonzero, we return a value which, if converted to
8337 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
8339 OP must have integer, real or enumeral type. Pointers are not allowed!
8341 There are some cases where the obvious value we could return
8342 would regenerate to OP if converted to OP's type,
8343 but would not extend like OP to wider types.
8344 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
8345 For example, if OP is (unsigned short)(signed char)-1,
8346 we avoid returning (signed char)-1 if FOR_TYPE is int,
8347 even though extending that to an unsigned short would regenerate OP,
8348 since the result of extending (signed char)-1 to (int)
8349 is different from (int) OP. */
8352 get_unwidened (tree op
, tree for_type
)
8354 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
8355 tree type
= TREE_TYPE (op
);
8357 = TYPE_PRECISION (for_type
!= 0 ? for_type
: type
);
8359 = (for_type
!= 0 && for_type
!= type
8360 && final_prec
> TYPE_PRECISION (type
)
8361 && TYPE_UNSIGNED (type
));
8364 while (CONVERT_EXPR_P (op
))
8368 /* TYPE_PRECISION on vector types has different meaning
8369 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
8370 so avoid them here. */
8371 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op
, 0))) == VECTOR_TYPE
)
8374 bitschange
= TYPE_PRECISION (TREE_TYPE (op
))
8375 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0)));
8377 /* Truncations are many-one so cannot be removed.
8378 Unless we are later going to truncate down even farther. */
8380 && final_prec
> TYPE_PRECISION (TREE_TYPE (op
)))
8383 /* See what's inside this conversion. If we decide to strip it,
8385 op
= TREE_OPERAND (op
, 0);
8387 /* If we have not stripped any zero-extensions (uns is 0),
8388 we can strip any kind of extension.
8389 If we have previously stripped a zero-extension,
8390 only zero-extensions can safely be stripped.
8391 Any extension can be stripped if the bits it would produce
8392 are all going to be discarded later by truncating to FOR_TYPE. */
8396 if (! uns
|| final_prec
<= TYPE_PRECISION (TREE_TYPE (op
)))
8398 /* TYPE_UNSIGNED says whether this is a zero-extension.
8399 Let's avoid computing it if it does not affect WIN
8400 and if UNS will not be needed again. */
8402 || CONVERT_EXPR_P (op
))
8403 && TYPE_UNSIGNED (TREE_TYPE (op
)))
8411 /* If we finally reach a constant see if it fits in for_type and
8412 in that case convert it. */
8414 && TREE_CODE (win
) == INTEGER_CST
8415 && TREE_TYPE (win
) != for_type
8416 && int_fits_type_p (win
, for_type
))
8417 win
= fold_convert (for_type
, win
);
8422 /* Return OP or a simpler expression for a narrower value
8423 which can be sign-extended or zero-extended to give back OP.
8424 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
8425 or 0 if the value should be sign-extended. */
8428 get_narrower (tree op
, int *unsignedp_ptr
)
8433 bool integral_p
= INTEGRAL_TYPE_P (TREE_TYPE (op
));
8435 while (TREE_CODE (op
) == NOP_EXPR
)
8438 = (TYPE_PRECISION (TREE_TYPE (op
))
8439 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0))));
8441 /* Truncations are many-one so cannot be removed. */
8445 /* See what's inside this conversion. If we decide to strip it,
8450 op
= TREE_OPERAND (op
, 0);
8451 /* An extension: the outermost one can be stripped,
8452 but remember whether it is zero or sign extension. */
8454 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
8455 /* Otherwise, if a sign extension has been stripped,
8456 only sign extensions can now be stripped;
8457 if a zero extension has been stripped, only zero-extensions. */
8458 else if (uns
!= TYPE_UNSIGNED (TREE_TYPE (op
)))
8462 else /* bitschange == 0 */
8464 /* A change in nominal type can always be stripped, but we must
8465 preserve the unsignedness. */
8467 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
8469 op
= TREE_OPERAND (op
, 0);
8470 /* Keep trying to narrow, but don't assign op to win if it
8471 would turn an integral type into something else. */
8472 if (INTEGRAL_TYPE_P (TREE_TYPE (op
)) != integral_p
)
8479 if (TREE_CODE (op
) == COMPONENT_REF
8480 /* Since type_for_size always gives an integer type. */
8481 && TREE_CODE (TREE_TYPE (op
)) != REAL_TYPE
8482 && TREE_CODE (TREE_TYPE (op
)) != FIXED_POINT_TYPE
8483 /* Ensure field is laid out already. */
8484 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0
8485 && tree_fits_uhwi_p (DECL_SIZE (TREE_OPERAND (op
, 1))))
8487 unsigned HOST_WIDE_INT innerprec
8488 = tree_to_uhwi (DECL_SIZE (TREE_OPERAND (op
, 1)));
8489 int unsignedp
= (DECL_UNSIGNED (TREE_OPERAND (op
, 1))
8490 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op
, 1))));
8491 tree type
= lang_hooks
.types
.type_for_size (innerprec
, unsignedp
);
8493 /* We can get this structure field in a narrower type that fits it,
8494 but the resulting extension to its nominal type (a fullword type)
8495 must satisfy the same conditions as for other extensions.
8497 Do this only for fields that are aligned (not bit-fields),
8498 because when bit-field insns will be used there is no
8499 advantage in doing this. */
8501 if (innerprec
< TYPE_PRECISION (TREE_TYPE (op
))
8502 && ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1))
8503 && (first
|| uns
== DECL_UNSIGNED (TREE_OPERAND (op
, 1)))
8507 uns
= DECL_UNSIGNED (TREE_OPERAND (op
, 1));
8508 win
= fold_convert (type
, op
);
8512 *unsignedp_ptr
= uns
;
8516 /* Returns true if integer constant C has a value that is permissible
8517 for type TYPE (an INTEGER_TYPE). */
8520 int_fits_type_p (const_tree c
, const_tree type
)
8522 tree type_low_bound
, type_high_bound
;
8523 bool ok_for_low_bound
, ok_for_high_bound
;
8524 signop sgn_c
= TYPE_SIGN (TREE_TYPE (c
));
8527 type_low_bound
= TYPE_MIN_VALUE (type
);
8528 type_high_bound
= TYPE_MAX_VALUE (type
);
8530 /* If at least one bound of the type is a constant integer, we can check
8531 ourselves and maybe make a decision. If no such decision is possible, but
8532 this type is a subtype, try checking against that. Otherwise, use
8533 fits_to_tree_p, which checks against the precision.
8535 Compute the status for each possibly constant bound, and return if we see
8536 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
8537 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
8538 for "constant known to fit". */
8540 /* Check if c >= type_low_bound. */
8541 if (type_low_bound
&& TREE_CODE (type_low_bound
) == INTEGER_CST
)
8543 if (tree_int_cst_lt (c
, type_low_bound
))
8545 ok_for_low_bound
= true;
8548 ok_for_low_bound
= false;
8550 /* Check if c <= type_high_bound. */
8551 if (type_high_bound
&& TREE_CODE (type_high_bound
) == INTEGER_CST
)
8553 if (tree_int_cst_lt (type_high_bound
, c
))
8555 ok_for_high_bound
= true;
8558 ok_for_high_bound
= false;
8560 /* If the constant fits both bounds, the result is known. */
8561 if (ok_for_low_bound
&& ok_for_high_bound
)
8564 /* Perform some generic filtering which may allow making a decision
8565 even if the bounds are not constant. First, negative integers
8566 never fit in unsigned types, */
8567 if (TYPE_UNSIGNED (type
) && sgn_c
== SIGNED
&& wi::neg_p (c
))
8570 /* Second, narrower types always fit in wider ones. */
8571 if (TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (c
)))
8574 /* Third, unsigned integers with top bit set never fit signed types. */
8575 if (!TYPE_UNSIGNED (type
) && sgn_c
== UNSIGNED
)
8577 int prec
= GET_MODE_PRECISION (TYPE_MODE (TREE_TYPE (c
))) - 1;
8578 if (prec
< TYPE_PRECISION (TREE_TYPE (c
)))
8580 /* When a tree_cst is converted to a wide-int, the precision
8581 is taken from the type. However, if the precision of the
8582 mode underneath the type is smaller than that, it is
8583 possible that the value will not fit. The test below
8584 fails if any bit is set between the sign bit of the
8585 underlying mode and the top bit of the type. */
8586 if (wi::ne_p (wi::zext (c
, prec
- 1), c
))
8589 else if (wi::neg_p (c
))
8593 /* If we haven't been able to decide at this point, there nothing more we
8594 can check ourselves here. Look at the base type if we have one and it
8595 has the same precision. */
8596 if (TREE_CODE (type
) == INTEGER_TYPE
8597 && TREE_TYPE (type
) != 0
8598 && TYPE_PRECISION (type
) == TYPE_PRECISION (TREE_TYPE (type
)))
8600 type
= TREE_TYPE (type
);
8604 /* Or to fits_to_tree_p, if nothing else. */
8605 return wi::fits_to_tree_p (c
, type
);
8608 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
8609 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
8610 represented (assuming two's-complement arithmetic) within the bit
8611 precision of the type are returned instead. */
8614 get_type_static_bounds (const_tree type
, mpz_t min
, mpz_t max
)
8616 if (!POINTER_TYPE_P (type
) && TYPE_MIN_VALUE (type
)
8617 && TREE_CODE (TYPE_MIN_VALUE (type
)) == INTEGER_CST
)
8618 wi::to_mpz (TYPE_MIN_VALUE (type
), min
, TYPE_SIGN (type
));
8621 if (TYPE_UNSIGNED (type
))
8622 mpz_set_ui (min
, 0);
8625 wide_int mn
= wi::min_value (TYPE_PRECISION (type
), SIGNED
);
8626 wi::to_mpz (mn
, min
, SIGNED
);
8630 if (!POINTER_TYPE_P (type
) && TYPE_MAX_VALUE (type
)
8631 && TREE_CODE (TYPE_MAX_VALUE (type
)) == INTEGER_CST
)
8632 wi::to_mpz (TYPE_MAX_VALUE (type
), max
, TYPE_SIGN (type
));
8635 wide_int mn
= wi::max_value (TYPE_PRECISION (type
), TYPE_SIGN (type
));
8636 wi::to_mpz (mn
, max
, TYPE_SIGN (type
));
8640 /* Return true if VAR is an automatic variable defined in function FN. */
8643 auto_var_in_fn_p (const_tree var
, const_tree fn
)
8645 return (DECL_P (var
) && DECL_CONTEXT (var
) == fn
8646 && ((((TREE_CODE (var
) == VAR_DECL
&& ! DECL_EXTERNAL (var
))
8647 || TREE_CODE (var
) == PARM_DECL
)
8648 && ! TREE_STATIC (var
))
8649 || TREE_CODE (var
) == LABEL_DECL
8650 || TREE_CODE (var
) == RESULT_DECL
));
8653 /* Subprogram of following function. Called by walk_tree.
8655 Return *TP if it is an automatic variable or parameter of the
8656 function passed in as DATA. */
8659 find_var_from_fn (tree
*tp
, int *walk_subtrees
, void *data
)
8661 tree fn
= (tree
) data
;
8666 else if (DECL_P (*tp
)
8667 && auto_var_in_fn_p (*tp
, fn
))
8673 /* Returns true if T is, contains, or refers to a type with variable
8674 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
8675 arguments, but not the return type. If FN is nonzero, only return
8676 true if a modifier of the type or position of FN is a variable or
8677 parameter inside FN.
8679 This concept is more general than that of C99 'variably modified types':
8680 in C99, a struct type is never variably modified because a VLA may not
8681 appear as a structure member. However, in GNU C code like:
8683 struct S { int i[f()]; };
8685 is valid, and other languages may define similar constructs. */
8688 variably_modified_type_p (tree type
, tree fn
)
8692 /* Test if T is either variable (if FN is zero) or an expression containing
8693 a variable in FN. If TYPE isn't gimplified, return true also if
8694 gimplify_one_sizepos would gimplify the expression into a local
8696 #define RETURN_TRUE_IF_VAR(T) \
8697 do { tree _t = (T); \
8698 if (_t != NULL_TREE \
8699 && _t != error_mark_node \
8700 && TREE_CODE (_t) != INTEGER_CST \
8701 && TREE_CODE (_t) != PLACEHOLDER_EXPR \
8703 || (!TYPE_SIZES_GIMPLIFIED (type) \
8704 && !is_gimple_sizepos (_t)) \
8705 || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
8706 return true; } while (0)
8708 if (type
== error_mark_node
)
8711 /* If TYPE itself has variable size, it is variably modified. */
8712 RETURN_TRUE_IF_VAR (TYPE_SIZE (type
));
8713 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type
));
8715 switch (TREE_CODE (type
))
8718 case REFERENCE_TYPE
:
8720 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
8726 /* If TYPE is a function type, it is variably modified if the
8727 return type is variably modified. */
8728 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
8734 case FIXED_POINT_TYPE
:
8737 /* Scalar types are variably modified if their end points
8739 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type
));
8740 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type
));
8745 case QUAL_UNION_TYPE
:
8746 /* We can't see if any of the fields are variably-modified by the
8747 definition we normally use, since that would produce infinite
8748 recursion via pointers. */
8749 /* This is variably modified if some field's type is. */
8750 for (t
= TYPE_FIELDS (type
); t
; t
= DECL_CHAIN (t
))
8751 if (TREE_CODE (t
) == FIELD_DECL
)
8753 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t
));
8754 RETURN_TRUE_IF_VAR (DECL_SIZE (t
));
8755 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t
));
8757 if (TREE_CODE (type
) == QUAL_UNION_TYPE
)
8758 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t
));
8763 /* Do not call ourselves to avoid infinite recursion. This is
8764 variably modified if the element type is. */
8765 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type
)));
8766 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type
)));
8773 /* The current language may have other cases to check, but in general,
8774 all other types are not variably modified. */
8775 return lang_hooks
.tree_inlining
.var_mod_type_p (type
, fn
);
8777 #undef RETURN_TRUE_IF_VAR
8780 /* Given a DECL or TYPE, return the scope in which it was declared, or
8781 NULL_TREE if there is no containing scope. */
8784 get_containing_scope (const_tree t
)
8786 return (TYPE_P (t
) ? TYPE_CONTEXT (t
) : DECL_CONTEXT (t
));
8789 /* Return the innermost context enclosing DECL that is
8790 a FUNCTION_DECL, or zero if none. */
8793 decl_function_context (const_tree decl
)
8797 if (TREE_CODE (decl
) == ERROR_MARK
)
8800 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
8801 where we look up the function at runtime. Such functions always take
8802 a first argument of type 'pointer to real context'.
8804 C++ should really be fixed to use DECL_CONTEXT for the real context,
8805 and use something else for the "virtual context". */
8806 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VINDEX (decl
))
8809 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl
)))));
8811 context
= DECL_CONTEXT (decl
);
8813 while (context
&& TREE_CODE (context
) != FUNCTION_DECL
)
8815 if (TREE_CODE (context
) == BLOCK
)
8816 context
= BLOCK_SUPERCONTEXT (context
);
8818 context
= get_containing_scope (context
);
8824 /* Return the innermost context enclosing DECL that is
8825 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
8826 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
8829 decl_type_context (const_tree decl
)
8831 tree context
= DECL_CONTEXT (decl
);
8834 switch (TREE_CODE (context
))
8836 case NAMESPACE_DECL
:
8837 case TRANSLATION_UNIT_DECL
:
8842 case QUAL_UNION_TYPE
:
8847 context
= DECL_CONTEXT (context
);
8851 context
= BLOCK_SUPERCONTEXT (context
);
8861 /* CALL is a CALL_EXPR. Return the declaration for the function
8862 called, or NULL_TREE if the called function cannot be
8866 get_callee_fndecl (const_tree call
)
8870 if (call
== error_mark_node
)
8871 return error_mark_node
;
8873 /* It's invalid to call this function with anything but a
8875 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
8877 /* The first operand to the CALL is the address of the function
8879 addr
= CALL_EXPR_FN (call
);
8883 /* If this is a readonly function pointer, extract its initial value. */
8884 if (DECL_P (addr
) && TREE_CODE (addr
) != FUNCTION_DECL
8885 && TREE_READONLY (addr
) && ! TREE_THIS_VOLATILE (addr
)
8886 && DECL_INITIAL (addr
))
8887 addr
= DECL_INITIAL (addr
);
8889 /* If the address is just `&f' for some function `f', then we know
8890 that `f' is being called. */
8891 if (TREE_CODE (addr
) == ADDR_EXPR
8892 && TREE_CODE (TREE_OPERAND (addr
, 0)) == FUNCTION_DECL
)
8893 return TREE_OPERAND (addr
, 0);
8895 /* We couldn't figure out what was being called. */
8899 /* Print debugging information about tree nodes generated during the compile,
8900 and any language-specific information. */
8903 dump_tree_statistics (void)
8905 if (GATHER_STATISTICS
)
8908 int total_nodes
, total_bytes
;
8909 fprintf (stderr
, "Kind Nodes Bytes\n");
8910 fprintf (stderr
, "---------------------------------------\n");
8911 total_nodes
= total_bytes
= 0;
8912 for (i
= 0; i
< (int) all_kinds
; i
++)
8914 fprintf (stderr
, "%-20s %7d %10d\n", tree_node_kind_names
[i
],
8915 tree_node_counts
[i
], tree_node_sizes
[i
]);
8916 total_nodes
+= tree_node_counts
[i
];
8917 total_bytes
+= tree_node_sizes
[i
];
8919 fprintf (stderr
, "---------------------------------------\n");
8920 fprintf (stderr
, "%-20s %7d %10d\n", "Total", total_nodes
, total_bytes
);
8921 fprintf (stderr
, "---------------------------------------\n");
8922 fprintf (stderr
, "Code Nodes\n");
8923 fprintf (stderr
, "----------------------------\n");
8924 for (i
= 0; i
< (int) MAX_TREE_CODES
; i
++)
8925 fprintf (stderr
, "%-20s %7d\n", get_tree_code_name ((enum tree_code
) i
),
8926 tree_code_counts
[i
]);
8927 fprintf (stderr
, "----------------------------\n");
8928 ssanames_print_statistics ();
8929 phinodes_print_statistics ();
8932 fprintf (stderr
, "(No per-node statistics)\n");
8934 print_type_hash_statistics ();
8935 print_debug_expr_statistics ();
8936 print_value_expr_statistics ();
8937 lang_hooks
.print_statistics ();
8940 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
8942 /* Generate a crc32 of a byte. */
8945 crc32_unsigned_bits (unsigned chksum
, unsigned value
, unsigned bits
)
8949 for (ix
= bits
; ix
--; value
<<= 1)
8953 feedback
= (value
^ chksum
) & 0x80000000 ? 0x04c11db7 : 0;
8960 /* Generate a crc32 of a 32-bit unsigned. */
8963 crc32_unsigned (unsigned chksum
, unsigned value
)
8965 return crc32_unsigned_bits (chksum
, value
, 32);
8968 /* Generate a crc32 of a byte. */
8971 crc32_byte (unsigned chksum
, char byte
)
8973 return crc32_unsigned_bits (chksum
, (unsigned) byte
<< 24, 8);
8976 /* Generate a crc32 of a string. */
8979 crc32_string (unsigned chksum
, const char *string
)
8983 chksum
= crc32_byte (chksum
, *string
);
8989 /* P is a string that will be used in a symbol. Mask out any characters
8990 that are not valid in that context. */
8993 clean_symbol_name (char *p
)
8997 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
9000 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
9007 /* Generate a name for a special-purpose function.
9008 The generated name may need to be unique across the whole link.
9009 Changes to this function may also require corresponding changes to
9010 xstrdup_mask_random.
9011 TYPE is some string to identify the purpose of this function to the
9012 linker or collect2; it must start with an uppercase letter,
9014 I - for constructors
9016 N - for C++ anonymous namespaces
9017 F - for DWARF unwind frame information. */
9020 get_file_function_name (const char *type
)
9026 /* If we already have a name we know to be unique, just use that. */
9027 if (first_global_object_name
)
9028 p
= q
= ASTRDUP (first_global_object_name
);
9029 /* If the target is handling the constructors/destructors, they
9030 will be local to this file and the name is only necessary for
9032 We also assign sub_I and sub_D sufixes to constructors called from
9033 the global static constructors. These are always local. */
9034 else if (((type
[0] == 'I' || type
[0] == 'D') && targetm
.have_ctors_dtors
)
9035 || (strncmp (type
, "sub_", 4) == 0
9036 && (type
[4] == 'I' || type
[4] == 'D')))
9038 const char *file
= main_input_filename
;
9040 file
= LOCATION_FILE (input_location
);
9041 /* Just use the file's basename, because the full pathname
9042 might be quite long. */
9043 p
= q
= ASTRDUP (lbasename (file
));
9047 /* Otherwise, the name must be unique across the entire link.
9048 We don't have anything that we know to be unique to this translation
9049 unit, so use what we do have and throw in some randomness. */
9051 const char *name
= weak_global_object_name
;
9052 const char *file
= main_input_filename
;
9057 file
= LOCATION_FILE (input_location
);
9059 len
= strlen (file
);
9060 q
= (char *) alloca (9 + 17 + len
+ 1);
9061 memcpy (q
, file
, len
+ 1);
9063 snprintf (q
+ len
, 9 + 17 + 1, "_%08X_" HOST_WIDE_INT_PRINT_HEX
,
9064 crc32_string (0, name
), get_random_seed (false));
9069 clean_symbol_name (q
);
9070 buf
= (char *) alloca (sizeof (FILE_FUNCTION_FORMAT
) + strlen (p
)
9073 /* Set up the name of the file-level functions we may need.
9074 Use a global object (which is already required to be unique over
9075 the program) rather than the file name (which imposes extra
9077 sprintf (buf
, FILE_FUNCTION_FORMAT
, type
, p
);
9079 return get_identifier (buf
);
9082 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
9084 /* Complain that the tree code of NODE does not match the expected 0
9085 terminated list of trailing codes. The trailing code list can be
9086 empty, for a more vague error message. FILE, LINE, and FUNCTION
9087 are of the caller. */
9090 tree_check_failed (const_tree node
, const char *file
,
9091 int line
, const char *function
, ...)
9095 unsigned length
= 0;
9096 enum tree_code code
;
9098 va_start (args
, function
);
9099 while ((code
= (enum tree_code
) va_arg (args
, int)))
9100 length
+= 4 + strlen (get_tree_code_name (code
));
9105 va_start (args
, function
);
9106 length
+= strlen ("expected ");
9107 buffer
= tmp
= (char *) alloca (length
);
9109 while ((code
= (enum tree_code
) va_arg (args
, int)))
9111 const char *prefix
= length
? " or " : "expected ";
9113 strcpy (tmp
+ length
, prefix
);
9114 length
+= strlen (prefix
);
9115 strcpy (tmp
+ length
, get_tree_code_name (code
));
9116 length
+= strlen (get_tree_code_name (code
));
9121 buffer
= "unexpected node";
9123 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9124 buffer
, get_tree_code_name (TREE_CODE (node
)),
9125 function
, trim_filename (file
), line
);
9128 /* Complain that the tree code of NODE does match the expected 0
9129 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
9133 tree_not_check_failed (const_tree node
, const char *file
,
9134 int line
, const char *function
, ...)
9138 unsigned length
= 0;
9139 enum tree_code code
;
9141 va_start (args
, function
);
9142 while ((code
= (enum tree_code
) va_arg (args
, int)))
9143 length
+= 4 + strlen (get_tree_code_name (code
));
9145 va_start (args
, function
);
9146 buffer
= (char *) alloca (length
);
9148 while ((code
= (enum tree_code
) va_arg (args
, int)))
9152 strcpy (buffer
+ length
, " or ");
9155 strcpy (buffer
+ length
, get_tree_code_name (code
));
9156 length
+= strlen (get_tree_code_name (code
));
9160 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
9161 buffer
, get_tree_code_name (TREE_CODE (node
)),
9162 function
, trim_filename (file
), line
);
9165 /* Similar to tree_check_failed, except that we check for a class of tree
9166 code, given in CL. */
9169 tree_class_check_failed (const_tree node
, const enum tree_code_class cl
,
9170 const char *file
, int line
, const char *function
)
9173 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
9174 TREE_CODE_CLASS_STRING (cl
),
9175 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
9176 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9179 /* Similar to tree_check_failed, except that instead of specifying a
9180 dozen codes, use the knowledge that they're all sequential. */
9183 tree_range_check_failed (const_tree node
, const char *file
, int line
,
9184 const char *function
, enum tree_code c1
,
9188 unsigned length
= 0;
9191 for (c
= c1
; c
<= c2
; ++c
)
9192 length
+= 4 + strlen (get_tree_code_name ((enum tree_code
) c
));
9194 length
+= strlen ("expected ");
9195 buffer
= (char *) alloca (length
);
9198 for (c
= c1
; c
<= c2
; ++c
)
9200 const char *prefix
= length
? " or " : "expected ";
9202 strcpy (buffer
+ length
, prefix
);
9203 length
+= strlen (prefix
);
9204 strcpy (buffer
+ length
, get_tree_code_name ((enum tree_code
) c
));
9205 length
+= strlen (get_tree_code_name ((enum tree_code
) c
));
9208 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9209 buffer
, get_tree_code_name (TREE_CODE (node
)),
9210 function
, trim_filename (file
), line
);
9214 /* Similar to tree_check_failed, except that we check that a tree does
9215 not have the specified code, given in CL. */
9218 tree_not_class_check_failed (const_tree node
, const enum tree_code_class cl
,
9219 const char *file
, int line
, const char *function
)
9222 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
9223 TREE_CODE_CLASS_STRING (cl
),
9224 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
9225 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9229 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
9232 omp_clause_check_failed (const_tree node
, const char *file
, int line
,
9233 const char *function
, enum omp_clause_code code
)
9235 internal_error ("tree check: expected omp_clause %s, have %s in %s, at %s:%d",
9236 omp_clause_code_name
[code
], get_tree_code_name (TREE_CODE (node
)),
9237 function
, trim_filename (file
), line
);
9241 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
9244 omp_clause_range_check_failed (const_tree node
, const char *file
, int line
,
9245 const char *function
, enum omp_clause_code c1
,
9246 enum omp_clause_code c2
)
9249 unsigned length
= 0;
9252 for (c
= c1
; c
<= c2
; ++c
)
9253 length
+= 4 + strlen (omp_clause_code_name
[c
]);
9255 length
+= strlen ("expected ");
9256 buffer
= (char *) alloca (length
);
9259 for (c
= c1
; c
<= c2
; ++c
)
9261 const char *prefix
= length
? " or " : "expected ";
9263 strcpy (buffer
+ length
, prefix
);
9264 length
+= strlen (prefix
);
9265 strcpy (buffer
+ length
, omp_clause_code_name
[c
]);
9266 length
+= strlen (omp_clause_code_name
[c
]);
9269 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9270 buffer
, omp_clause_code_name
[TREE_CODE (node
)],
9271 function
, trim_filename (file
), line
);
9275 #undef DEFTREESTRUCT
9276 #define DEFTREESTRUCT(VAL, NAME) NAME,
9278 static const char *ts_enum_names
[] = {
9279 #include "treestruct.def"
9281 #undef DEFTREESTRUCT
9283 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
9285 /* Similar to tree_class_check_failed, except that we check for
9286 whether CODE contains the tree structure identified by EN. */
9289 tree_contains_struct_check_failed (const_tree node
,
9290 const enum tree_node_structure_enum en
,
9291 const char *file
, int line
,
9292 const char *function
)
9295 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
9297 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9301 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9302 (dynamically sized) vector. */
9305 tree_int_cst_elt_check_failed (int idx
, int len
, const char *file
, int line
,
9306 const char *function
)
9309 ("tree check: accessed elt %d of tree_int_cst with %d elts in %s, at %s:%d",
9310 idx
+ 1, len
, function
, trim_filename (file
), line
);
9313 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9314 (dynamically sized) vector. */
9317 tree_vec_elt_check_failed (int idx
, int len
, const char *file
, int line
,
9318 const char *function
)
9321 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
9322 idx
+ 1, len
, function
, trim_filename (file
), line
);
9325 /* Similar to above, except that the check is for the bounds of the operand
9326 vector of an expression node EXP. */
9329 tree_operand_check_failed (int idx
, const_tree exp
, const char *file
,
9330 int line
, const char *function
)
9332 enum tree_code code
= TREE_CODE (exp
);
9334 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
9335 idx
+ 1, get_tree_code_name (code
), TREE_OPERAND_LENGTH (exp
),
9336 function
, trim_filename (file
), line
);
9339 /* Similar to above, except that the check is for the number of
9340 operands of an OMP_CLAUSE node. */
9343 omp_clause_operand_check_failed (int idx
, const_tree t
, const char *file
,
9344 int line
, const char *function
)
9347 ("tree check: accessed operand %d of omp_clause %s with %d operands "
9348 "in %s, at %s:%d", idx
+ 1, omp_clause_code_name
[OMP_CLAUSE_CODE (t
)],
9349 omp_clause_num_ops
[OMP_CLAUSE_CODE (t
)], function
,
9350 trim_filename (file
), line
);
9352 #endif /* ENABLE_TREE_CHECKING */
9354 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
9355 and mapped to the machine mode MODE. Initialize its fields and build
9356 the information necessary for debugging output. */
9359 make_vector_type (tree innertype
, int nunits
, enum machine_mode mode
)
9362 hashval_t hashcode
= 0;
9364 t
= make_node (VECTOR_TYPE
);
9365 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (innertype
);
9366 SET_TYPE_VECTOR_SUBPARTS (t
, nunits
);
9367 SET_TYPE_MODE (t
, mode
);
9369 if (TYPE_STRUCTURAL_EQUALITY_P (innertype
))
9370 SET_TYPE_STRUCTURAL_EQUALITY (t
);
9371 else if (TYPE_CANONICAL (innertype
) != innertype
9372 || mode
!= VOIDmode
)
9374 = make_vector_type (TYPE_CANONICAL (innertype
), nunits
, VOIDmode
);
9378 hashcode
= iterative_hash_host_wide_int (VECTOR_TYPE
, hashcode
);
9379 hashcode
= iterative_hash_host_wide_int (nunits
, hashcode
);
9380 hashcode
= iterative_hash_host_wide_int (mode
, hashcode
);
9381 hashcode
= iterative_hash_object (TYPE_HASH (TREE_TYPE (t
)), hashcode
);
9382 t
= type_hash_canon (hashcode
, t
);
9384 /* We have built a main variant, based on the main variant of the
9385 inner type. Use it to build the variant we return. */
9386 if ((TYPE_ATTRIBUTES (innertype
) || TYPE_QUALS (innertype
))
9387 && TREE_TYPE (t
) != innertype
)
9388 return build_type_attribute_qual_variant (t
,
9389 TYPE_ATTRIBUTES (innertype
),
9390 TYPE_QUALS (innertype
));
9396 make_or_reuse_type (unsigned size
, int unsignedp
)
9398 if (size
== INT_TYPE_SIZE
)
9399 return unsignedp
? unsigned_type_node
: integer_type_node
;
9400 if (size
== CHAR_TYPE_SIZE
)
9401 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
9402 if (size
== SHORT_TYPE_SIZE
)
9403 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
9404 if (size
== LONG_TYPE_SIZE
)
9405 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
9406 if (size
== LONG_LONG_TYPE_SIZE
)
9407 return (unsignedp
? long_long_unsigned_type_node
9408 : long_long_integer_type_node
);
9409 if (size
== 128 && int128_integer_type_node
)
9410 return (unsignedp
? int128_unsigned_type_node
9411 : int128_integer_type_node
);
9414 return make_unsigned_type (size
);
9416 return make_signed_type (size
);
9419 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
9422 make_or_reuse_fract_type (unsigned size
, int unsignedp
, int satp
)
9426 if (size
== SHORT_FRACT_TYPE_SIZE
)
9427 return unsignedp
? sat_unsigned_short_fract_type_node
9428 : sat_short_fract_type_node
;
9429 if (size
== FRACT_TYPE_SIZE
)
9430 return unsignedp
? sat_unsigned_fract_type_node
: sat_fract_type_node
;
9431 if (size
== LONG_FRACT_TYPE_SIZE
)
9432 return unsignedp
? sat_unsigned_long_fract_type_node
9433 : sat_long_fract_type_node
;
9434 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
9435 return unsignedp
? sat_unsigned_long_long_fract_type_node
9436 : sat_long_long_fract_type_node
;
9440 if (size
== SHORT_FRACT_TYPE_SIZE
)
9441 return unsignedp
? unsigned_short_fract_type_node
9442 : short_fract_type_node
;
9443 if (size
== FRACT_TYPE_SIZE
)
9444 return unsignedp
? unsigned_fract_type_node
: fract_type_node
;
9445 if (size
== LONG_FRACT_TYPE_SIZE
)
9446 return unsignedp
? unsigned_long_fract_type_node
9447 : long_fract_type_node
;
9448 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
9449 return unsignedp
? unsigned_long_long_fract_type_node
9450 : long_long_fract_type_node
;
9453 return make_fract_type (size
, unsignedp
, satp
);
9456 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
9459 make_or_reuse_accum_type (unsigned size
, int unsignedp
, int satp
)
9463 if (size
== SHORT_ACCUM_TYPE_SIZE
)
9464 return unsignedp
? sat_unsigned_short_accum_type_node
9465 : sat_short_accum_type_node
;
9466 if (size
== ACCUM_TYPE_SIZE
)
9467 return unsignedp
? sat_unsigned_accum_type_node
: sat_accum_type_node
;
9468 if (size
== LONG_ACCUM_TYPE_SIZE
)
9469 return unsignedp
? sat_unsigned_long_accum_type_node
9470 : sat_long_accum_type_node
;
9471 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
9472 return unsignedp
? sat_unsigned_long_long_accum_type_node
9473 : sat_long_long_accum_type_node
;
9477 if (size
== SHORT_ACCUM_TYPE_SIZE
)
9478 return unsignedp
? unsigned_short_accum_type_node
9479 : short_accum_type_node
;
9480 if (size
== ACCUM_TYPE_SIZE
)
9481 return unsignedp
? unsigned_accum_type_node
: accum_type_node
;
9482 if (size
== LONG_ACCUM_TYPE_SIZE
)
9483 return unsignedp
? unsigned_long_accum_type_node
9484 : long_accum_type_node
;
9485 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
9486 return unsignedp
? unsigned_long_long_accum_type_node
9487 : long_long_accum_type_node
;
9490 return make_accum_type (size
, unsignedp
, satp
);
9494 /* Create an atomic variant node for TYPE. This routine is called
9495 during initialization of data types to create the 5 basic atomic
9496 types. The generic build_variant_type function requires these to
9497 already be set up in order to function properly, so cannot be
9498 called from there. If ALIGN is non-zero, then ensure alignment is
9499 overridden to this value. */
9502 build_atomic_base (tree type
, unsigned int align
)
9506 /* Make sure its not already registered. */
9507 if ((t
= get_qualified_type (type
, TYPE_QUAL_ATOMIC
)))
9510 t
= build_variant_type_copy (type
);
9511 set_type_quals (t
, TYPE_QUAL_ATOMIC
);
9514 TYPE_ALIGN (t
) = align
;
9519 /* Create nodes for all integer types (and error_mark_node) using the sizes
9520 of C datatypes. SIGNED_CHAR specifies whether char is signed,
9521 SHORT_DOUBLE specifies whether double should be of the same precision
9525 build_common_tree_nodes (bool signed_char
, bool short_double
)
9527 error_mark_node
= make_node (ERROR_MARK
);
9528 TREE_TYPE (error_mark_node
) = error_mark_node
;
9530 initialize_sizetypes ();
9532 /* Define both `signed char' and `unsigned char'. */
9533 signed_char_type_node
= make_signed_type (CHAR_TYPE_SIZE
);
9534 TYPE_STRING_FLAG (signed_char_type_node
) = 1;
9535 unsigned_char_type_node
= make_unsigned_type (CHAR_TYPE_SIZE
);
9536 TYPE_STRING_FLAG (unsigned_char_type_node
) = 1;
9538 /* Define `char', which is like either `signed char' or `unsigned char'
9539 but not the same as either. */
9542 ? make_signed_type (CHAR_TYPE_SIZE
)
9543 : make_unsigned_type (CHAR_TYPE_SIZE
));
9544 TYPE_STRING_FLAG (char_type_node
) = 1;
9546 short_integer_type_node
= make_signed_type (SHORT_TYPE_SIZE
);
9547 short_unsigned_type_node
= make_unsigned_type (SHORT_TYPE_SIZE
);
9548 integer_type_node
= make_signed_type (INT_TYPE_SIZE
);
9549 unsigned_type_node
= make_unsigned_type (INT_TYPE_SIZE
);
9550 long_integer_type_node
= make_signed_type (LONG_TYPE_SIZE
);
9551 long_unsigned_type_node
= make_unsigned_type (LONG_TYPE_SIZE
);
9552 long_long_integer_type_node
= make_signed_type (LONG_LONG_TYPE_SIZE
);
9553 long_long_unsigned_type_node
= make_unsigned_type (LONG_LONG_TYPE_SIZE
);
9554 #if HOST_BITS_PER_WIDE_INT >= 64
9555 /* TODO: This isn't correct, but as logic depends at the moment on
9556 host's instead of target's wide-integer.
9557 If there is a target not supporting TImode, but has an 128-bit
9558 integer-scalar register, this target check needs to be adjusted. */
9559 if (targetm
.scalar_mode_supported_p (TImode
))
9561 int128_integer_type_node
= make_signed_type (128);
9562 int128_unsigned_type_node
= make_unsigned_type (128);
9566 /* Define a boolean type. This type only represents boolean values but
9567 may be larger than char depending on the value of BOOL_TYPE_SIZE. */
9568 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
9569 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
9570 TYPE_PRECISION (boolean_type_node
) = 1;
9571 TYPE_MAX_VALUE (boolean_type_node
) = build_int_cst (boolean_type_node
, 1);
9573 /* Define what type to use for size_t. */
9574 if (strcmp (SIZE_TYPE
, "unsigned int") == 0)
9575 size_type_node
= unsigned_type_node
;
9576 else if (strcmp (SIZE_TYPE
, "long unsigned int") == 0)
9577 size_type_node
= long_unsigned_type_node
;
9578 else if (strcmp (SIZE_TYPE
, "long long unsigned int") == 0)
9579 size_type_node
= long_long_unsigned_type_node
;
9580 else if (strcmp (SIZE_TYPE
, "short unsigned int") == 0)
9581 size_type_node
= short_unsigned_type_node
;
9585 /* Fill in the rest of the sized types. Reuse existing type nodes
9587 intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 0);
9588 intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 0);
9589 intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 0);
9590 intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 0);
9591 intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 0);
9593 unsigned_intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 1);
9594 unsigned_intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 1);
9595 unsigned_intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 1);
9596 unsigned_intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 1);
9597 unsigned_intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 1);
9599 /* Don't call build_qualified type for atomics. That routine does
9600 special processing for atomics, and until they are initialized
9601 it's better not to make that call.
9603 Check to see if there is a target override for atomic types. */
9605 atomicQI_type_node
= build_atomic_base (unsigned_intQI_type_node
,
9606 targetm
.atomic_align_for_mode (QImode
));
9607 atomicHI_type_node
= build_atomic_base (unsigned_intHI_type_node
,
9608 targetm
.atomic_align_for_mode (HImode
));
9609 atomicSI_type_node
= build_atomic_base (unsigned_intSI_type_node
,
9610 targetm
.atomic_align_for_mode (SImode
));
9611 atomicDI_type_node
= build_atomic_base (unsigned_intDI_type_node
,
9612 targetm
.atomic_align_for_mode (DImode
));
9613 atomicTI_type_node
= build_atomic_base (unsigned_intTI_type_node
,
9614 targetm
.atomic_align_for_mode (TImode
));
9616 access_public_node
= get_identifier ("public");
9617 access_protected_node
= get_identifier ("protected");
9618 access_private_node
= get_identifier ("private");
9620 /* Define these next since types below may used them. */
9621 integer_zero_node
= build_int_cst (integer_type_node
, 0);
9622 integer_one_node
= build_int_cst (integer_type_node
, 1);
9623 integer_three_node
= build_int_cst (integer_type_node
, 3);
9624 integer_minus_one_node
= build_int_cst (integer_type_node
, -1);
9626 size_zero_node
= size_int (0);
9627 size_one_node
= size_int (1);
9628 bitsize_zero_node
= bitsize_int (0);
9629 bitsize_one_node
= bitsize_int (1);
9630 bitsize_unit_node
= bitsize_int (BITS_PER_UNIT
);
9632 boolean_false_node
= TYPE_MIN_VALUE (boolean_type_node
);
9633 boolean_true_node
= TYPE_MAX_VALUE (boolean_type_node
);
9635 void_type_node
= make_node (VOID_TYPE
);
9636 layout_type (void_type_node
);
9638 /* We are not going to have real types in C with less than byte alignment,
9639 so we might as well not have any types that claim to have it. */
9640 TYPE_ALIGN (void_type_node
) = BITS_PER_UNIT
;
9641 TYPE_USER_ALIGN (void_type_node
) = 0;
9643 void_node
= make_node (VOID_CST
);
9644 TREE_TYPE (void_node
) = void_type_node
;
9646 null_pointer_node
= build_int_cst (build_pointer_type (void_type_node
), 0);
9647 layout_type (TREE_TYPE (null_pointer_node
));
9649 ptr_type_node
= build_pointer_type (void_type_node
);
9651 = build_pointer_type (build_type_variant (void_type_node
, 1, 0));
9652 fileptr_type_node
= ptr_type_node
;
9654 pointer_sized_int_node
= build_nonstandard_integer_type (POINTER_SIZE
, 1);
9656 float_type_node
= make_node (REAL_TYPE
);
9657 TYPE_PRECISION (float_type_node
) = FLOAT_TYPE_SIZE
;
9658 layout_type (float_type_node
);
9660 double_type_node
= make_node (REAL_TYPE
);
9662 TYPE_PRECISION (double_type_node
) = FLOAT_TYPE_SIZE
;
9664 TYPE_PRECISION (double_type_node
) = DOUBLE_TYPE_SIZE
;
9665 layout_type (double_type_node
);
9667 long_double_type_node
= make_node (REAL_TYPE
);
9668 TYPE_PRECISION (long_double_type_node
) = LONG_DOUBLE_TYPE_SIZE
;
9669 layout_type (long_double_type_node
);
9671 float_ptr_type_node
= build_pointer_type (float_type_node
);
9672 double_ptr_type_node
= build_pointer_type (double_type_node
);
9673 long_double_ptr_type_node
= build_pointer_type (long_double_type_node
);
9674 integer_ptr_type_node
= build_pointer_type (integer_type_node
);
9676 /* Fixed size integer types. */
9677 uint16_type_node
= build_nonstandard_integer_type (16, true);
9678 uint32_type_node
= build_nonstandard_integer_type (32, true);
9679 uint64_type_node
= build_nonstandard_integer_type (64, true);
9681 /* Decimal float types. */
9682 dfloat32_type_node
= make_node (REAL_TYPE
);
9683 TYPE_PRECISION (dfloat32_type_node
) = DECIMAL32_TYPE_SIZE
;
9684 layout_type (dfloat32_type_node
);
9685 SET_TYPE_MODE (dfloat32_type_node
, SDmode
);
9686 dfloat32_ptr_type_node
= build_pointer_type (dfloat32_type_node
);
9688 dfloat64_type_node
= make_node (REAL_TYPE
);
9689 TYPE_PRECISION (dfloat64_type_node
) = DECIMAL64_TYPE_SIZE
;
9690 layout_type (dfloat64_type_node
);
9691 SET_TYPE_MODE (dfloat64_type_node
, DDmode
);
9692 dfloat64_ptr_type_node
= build_pointer_type (dfloat64_type_node
);
9694 dfloat128_type_node
= make_node (REAL_TYPE
);
9695 TYPE_PRECISION (dfloat128_type_node
) = DECIMAL128_TYPE_SIZE
;
9696 layout_type (dfloat128_type_node
);
9697 SET_TYPE_MODE (dfloat128_type_node
, TDmode
);
9698 dfloat128_ptr_type_node
= build_pointer_type (dfloat128_type_node
);
9700 complex_integer_type_node
= build_complex_type (integer_type_node
);
9701 complex_float_type_node
= build_complex_type (float_type_node
);
9702 complex_double_type_node
= build_complex_type (double_type_node
);
9703 complex_long_double_type_node
= build_complex_type (long_double_type_node
);
9705 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
9706 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
9707 sat_ ## KIND ## _type_node = \
9708 make_sat_signed_ ## KIND ## _type (SIZE); \
9709 sat_unsigned_ ## KIND ## _type_node = \
9710 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9711 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9712 unsigned_ ## KIND ## _type_node = \
9713 make_unsigned_ ## KIND ## _type (SIZE);
9715 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
9716 sat_ ## WIDTH ## KIND ## _type_node = \
9717 make_sat_signed_ ## KIND ## _type (SIZE); \
9718 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
9719 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9720 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9721 unsigned_ ## WIDTH ## KIND ## _type_node = \
9722 make_unsigned_ ## KIND ## _type (SIZE);
9724 /* Make fixed-point type nodes based on four different widths. */
9725 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
9726 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
9727 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
9728 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
9729 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
9731 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
9732 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
9733 NAME ## _type_node = \
9734 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
9735 u ## NAME ## _type_node = \
9736 make_or_reuse_unsigned_ ## KIND ## _type \
9737 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
9738 sat_ ## NAME ## _type_node = \
9739 make_or_reuse_sat_signed_ ## KIND ## _type \
9740 (GET_MODE_BITSIZE (MODE ## mode)); \
9741 sat_u ## NAME ## _type_node = \
9742 make_or_reuse_sat_unsigned_ ## KIND ## _type \
9743 (GET_MODE_BITSIZE (U ## MODE ## mode));
9745 /* Fixed-point type and mode nodes. */
9746 MAKE_FIXED_TYPE_NODE_FAMILY (fract
, FRACT
)
9747 MAKE_FIXED_TYPE_NODE_FAMILY (accum
, ACCUM
)
9748 MAKE_FIXED_MODE_NODE (fract
, qq
, QQ
)
9749 MAKE_FIXED_MODE_NODE (fract
, hq
, HQ
)
9750 MAKE_FIXED_MODE_NODE (fract
, sq
, SQ
)
9751 MAKE_FIXED_MODE_NODE (fract
, dq
, DQ
)
9752 MAKE_FIXED_MODE_NODE (fract
, tq
, TQ
)
9753 MAKE_FIXED_MODE_NODE (accum
, ha
, HA
)
9754 MAKE_FIXED_MODE_NODE (accum
, sa
, SA
)
9755 MAKE_FIXED_MODE_NODE (accum
, da
, DA
)
9756 MAKE_FIXED_MODE_NODE (accum
, ta
, TA
)
9759 tree t
= targetm
.build_builtin_va_list ();
9761 /* Many back-ends define record types without setting TYPE_NAME.
9762 If we copied the record type here, we'd keep the original
9763 record type without a name. This breaks name mangling. So,
9764 don't copy record types and let c_common_nodes_and_builtins()
9765 declare the type to be __builtin_va_list. */
9766 if (TREE_CODE (t
) != RECORD_TYPE
)
9767 t
= build_variant_type_copy (t
);
9769 va_list_type_node
= t
;
9773 /* Modify DECL for given flags.
9774 TM_PURE attribute is set only on types, so the function will modify
9775 DECL's type when ECF_TM_PURE is used. */
9778 set_call_expr_flags (tree decl
, int flags
)
9780 if (flags
& ECF_NOTHROW
)
9781 TREE_NOTHROW (decl
) = 1;
9782 if (flags
& ECF_CONST
)
9783 TREE_READONLY (decl
) = 1;
9784 if (flags
& ECF_PURE
)
9785 DECL_PURE_P (decl
) = 1;
9786 if (flags
& ECF_LOOPING_CONST_OR_PURE
)
9787 DECL_LOOPING_CONST_OR_PURE_P (decl
) = 1;
9788 if (flags
& ECF_NOVOPS
)
9789 DECL_IS_NOVOPS (decl
) = 1;
9790 if (flags
& ECF_NORETURN
)
9791 TREE_THIS_VOLATILE (decl
) = 1;
9792 if (flags
& ECF_MALLOC
)
9793 DECL_IS_MALLOC (decl
) = 1;
9794 if (flags
& ECF_RETURNS_TWICE
)
9795 DECL_IS_RETURNS_TWICE (decl
) = 1;
9796 if (flags
& ECF_LEAF
)
9797 DECL_ATTRIBUTES (decl
) = tree_cons (get_identifier ("leaf"),
9798 NULL
, DECL_ATTRIBUTES (decl
));
9799 if ((flags
& ECF_TM_PURE
) && flag_tm
)
9800 apply_tm_attr (decl
, get_identifier ("transaction_pure"));
9801 /* Looping const or pure is implied by noreturn.
9802 There is currently no way to declare looping const or looping pure alone. */
9803 gcc_assert (!(flags
& ECF_LOOPING_CONST_OR_PURE
)
9804 || ((flags
& ECF_NORETURN
) && (flags
& (ECF_CONST
| ECF_PURE
))));
9808 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
9811 local_define_builtin (const char *name
, tree type
, enum built_in_function code
,
9812 const char *library_name
, int ecf_flags
)
9816 decl
= add_builtin_function (name
, type
, code
, BUILT_IN_NORMAL
,
9817 library_name
, NULL_TREE
);
9818 set_call_expr_flags (decl
, ecf_flags
);
9820 set_builtin_decl (code
, decl
, true);
9823 /* Call this function after instantiating all builtins that the language
9824 front end cares about. This will build the rest of the builtins that
9825 are relied upon by the tree optimizers and the middle-end. */
9828 build_common_builtin_nodes (void)
9833 if (!builtin_decl_explicit_p (BUILT_IN_UNREACHABLE
))
9835 ftype
= build_function_type (void_type_node
, void_list_node
);
9836 local_define_builtin ("__builtin_unreachable", ftype
, BUILT_IN_UNREACHABLE
,
9837 "__builtin_unreachable",
9838 ECF_NOTHROW
| ECF_LEAF
| ECF_NORETURN
9839 | ECF_CONST
| ECF_LEAF
);
9842 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
)
9843 || !builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
9845 ftype
= build_function_type_list (ptr_type_node
,
9846 ptr_type_node
, const_ptr_type_node
,
9847 size_type_node
, NULL_TREE
);
9849 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
))
9850 local_define_builtin ("__builtin_memcpy", ftype
, BUILT_IN_MEMCPY
,
9851 "memcpy", ECF_NOTHROW
| ECF_LEAF
);
9852 if (!builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
9853 local_define_builtin ("__builtin_memmove", ftype
, BUILT_IN_MEMMOVE
,
9854 "memmove", ECF_NOTHROW
| ECF_LEAF
);
9857 if (!builtin_decl_explicit_p (BUILT_IN_MEMCMP
))
9859 ftype
= build_function_type_list (integer_type_node
, const_ptr_type_node
,
9860 const_ptr_type_node
, size_type_node
,
9862 local_define_builtin ("__builtin_memcmp", ftype
, BUILT_IN_MEMCMP
,
9863 "memcmp", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
9866 if (!builtin_decl_explicit_p (BUILT_IN_MEMSET
))
9868 ftype
= build_function_type_list (ptr_type_node
,
9869 ptr_type_node
, integer_type_node
,
9870 size_type_node
, NULL_TREE
);
9871 local_define_builtin ("__builtin_memset", ftype
, BUILT_IN_MEMSET
,
9872 "memset", ECF_NOTHROW
| ECF_LEAF
);
9875 if (!builtin_decl_explicit_p (BUILT_IN_ALLOCA
))
9877 ftype
= build_function_type_list (ptr_type_node
,
9878 size_type_node
, NULL_TREE
);
9879 local_define_builtin ("__builtin_alloca", ftype
, BUILT_IN_ALLOCA
,
9880 "alloca", ECF_MALLOC
| ECF_NOTHROW
| ECF_LEAF
);
9883 ftype
= build_function_type_list (ptr_type_node
, size_type_node
,
9884 size_type_node
, NULL_TREE
);
9885 local_define_builtin ("__builtin_alloca_with_align", ftype
,
9886 BUILT_IN_ALLOCA_WITH_ALIGN
, "alloca",
9887 ECF_MALLOC
| ECF_NOTHROW
| ECF_LEAF
);
9889 /* If we're checking the stack, `alloca' can throw. */
9890 if (flag_stack_check
)
9892 TREE_NOTHROW (builtin_decl_explicit (BUILT_IN_ALLOCA
)) = 0;
9893 TREE_NOTHROW (builtin_decl_explicit (BUILT_IN_ALLOCA_WITH_ALIGN
)) = 0;
9896 ftype
= build_function_type_list (void_type_node
,
9897 ptr_type_node
, ptr_type_node
,
9898 ptr_type_node
, NULL_TREE
);
9899 local_define_builtin ("__builtin_init_trampoline", ftype
,
9900 BUILT_IN_INIT_TRAMPOLINE
,
9901 "__builtin_init_trampoline", ECF_NOTHROW
| ECF_LEAF
);
9902 local_define_builtin ("__builtin_init_heap_trampoline", ftype
,
9903 BUILT_IN_INIT_HEAP_TRAMPOLINE
,
9904 "__builtin_init_heap_trampoline",
9905 ECF_NOTHROW
| ECF_LEAF
);
9907 ftype
= build_function_type_list (ptr_type_node
, ptr_type_node
, NULL_TREE
);
9908 local_define_builtin ("__builtin_adjust_trampoline", ftype
,
9909 BUILT_IN_ADJUST_TRAMPOLINE
,
9910 "__builtin_adjust_trampoline",
9911 ECF_CONST
| ECF_NOTHROW
);
9913 ftype
= build_function_type_list (void_type_node
,
9914 ptr_type_node
, ptr_type_node
, NULL_TREE
);
9915 local_define_builtin ("__builtin_nonlocal_goto", ftype
,
9916 BUILT_IN_NONLOCAL_GOTO
,
9917 "__builtin_nonlocal_goto",
9918 ECF_NORETURN
| ECF_NOTHROW
);
9920 ftype
= build_function_type_list (void_type_node
,
9921 ptr_type_node
, ptr_type_node
, NULL_TREE
);
9922 local_define_builtin ("__builtin_setjmp_setup", ftype
,
9923 BUILT_IN_SETJMP_SETUP
,
9924 "__builtin_setjmp_setup", ECF_NOTHROW
);
9926 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
9927 local_define_builtin ("__builtin_setjmp_receiver", ftype
,
9928 BUILT_IN_SETJMP_RECEIVER
,
9929 "__builtin_setjmp_receiver", ECF_NOTHROW
| ECF_LEAF
);
9931 ftype
= build_function_type_list (ptr_type_node
, NULL_TREE
);
9932 local_define_builtin ("__builtin_stack_save", ftype
, BUILT_IN_STACK_SAVE
,
9933 "__builtin_stack_save", ECF_NOTHROW
| ECF_LEAF
);
9935 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
9936 local_define_builtin ("__builtin_stack_restore", ftype
,
9937 BUILT_IN_STACK_RESTORE
,
9938 "__builtin_stack_restore", ECF_NOTHROW
| ECF_LEAF
);
9940 /* If there's a possibility that we might use the ARM EABI, build the
9941 alternate __cxa_end_cleanup node used to resume from C++ and Java. */
9942 if (targetm
.arm_eabi_unwinder
)
9944 ftype
= build_function_type_list (void_type_node
, NULL_TREE
);
9945 local_define_builtin ("__builtin_cxa_end_cleanup", ftype
,
9946 BUILT_IN_CXA_END_CLEANUP
,
9947 "__cxa_end_cleanup", ECF_NORETURN
| ECF_LEAF
);
9950 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
9951 local_define_builtin ("__builtin_unwind_resume", ftype
,
9952 BUILT_IN_UNWIND_RESUME
,
9953 ((targetm_common
.except_unwind_info (&global_options
)
9955 ? "_Unwind_SjLj_Resume" : "_Unwind_Resume"),
9958 if (builtin_decl_explicit (BUILT_IN_RETURN_ADDRESS
) == NULL_TREE
)
9960 ftype
= build_function_type_list (ptr_type_node
, integer_type_node
,
9962 local_define_builtin ("__builtin_return_address", ftype
,
9963 BUILT_IN_RETURN_ADDRESS
,
9964 "__builtin_return_address",
9968 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
)
9969 || !builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
9971 ftype
= build_function_type_list (void_type_node
, ptr_type_node
,
9972 ptr_type_node
, NULL_TREE
);
9973 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
))
9974 local_define_builtin ("__cyg_profile_func_enter", ftype
,
9975 BUILT_IN_PROFILE_FUNC_ENTER
,
9976 "__cyg_profile_func_enter", 0);
9977 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
9978 local_define_builtin ("__cyg_profile_func_exit", ftype
,
9979 BUILT_IN_PROFILE_FUNC_EXIT
,
9980 "__cyg_profile_func_exit", 0);
9983 /* The exception object and filter values from the runtime. The argument
9984 must be zero before exception lowering, i.e. from the front end. After
9985 exception lowering, it will be the region number for the exception
9986 landing pad. These functions are PURE instead of CONST to prevent
9987 them from being hoisted past the exception edge that will initialize
9988 its value in the landing pad. */
9989 ftype
= build_function_type_list (ptr_type_node
,
9990 integer_type_node
, NULL_TREE
);
9991 ecf_flags
= ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
;
9992 /* Only use TM_PURE if we we have TM language support. */
9993 if (builtin_decl_explicit_p (BUILT_IN_TM_LOAD_1
))
9994 ecf_flags
|= ECF_TM_PURE
;
9995 local_define_builtin ("__builtin_eh_pointer", ftype
, BUILT_IN_EH_POINTER
,
9996 "__builtin_eh_pointer", ecf_flags
);
9998 tmp
= lang_hooks
.types
.type_for_mode (targetm
.eh_return_filter_mode (), 0);
9999 ftype
= build_function_type_list (tmp
, integer_type_node
, NULL_TREE
);
10000 local_define_builtin ("__builtin_eh_filter", ftype
, BUILT_IN_EH_FILTER
,
10001 "__builtin_eh_filter", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10003 ftype
= build_function_type_list (void_type_node
,
10004 integer_type_node
, integer_type_node
,
10006 local_define_builtin ("__builtin_eh_copy_values", ftype
,
10007 BUILT_IN_EH_COPY_VALUES
,
10008 "__builtin_eh_copy_values", ECF_NOTHROW
);
10010 /* Complex multiplication and division. These are handled as builtins
10011 rather than optabs because emit_library_call_value doesn't support
10012 complex. Further, we can do slightly better with folding these
10013 beasties if the real and complex parts of the arguments are separate. */
10017 for (mode
= MIN_MODE_COMPLEX_FLOAT
; mode
<= MAX_MODE_COMPLEX_FLOAT
; ++mode
)
10019 char mode_name_buf
[4], *q
;
10021 enum built_in_function mcode
, dcode
;
10022 tree type
, inner_type
;
10023 const char *prefix
= "__";
10025 if (targetm
.libfunc_gnu_prefix
)
10028 type
= lang_hooks
.types
.type_for_mode ((enum machine_mode
) mode
, 0);
10031 inner_type
= TREE_TYPE (type
);
10033 ftype
= build_function_type_list (type
, inner_type
, inner_type
,
10034 inner_type
, inner_type
, NULL_TREE
);
10036 mcode
= ((enum built_in_function
)
10037 (BUILT_IN_COMPLEX_MUL_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
10038 dcode
= ((enum built_in_function
)
10039 (BUILT_IN_COMPLEX_DIV_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
10041 for (p
= GET_MODE_NAME (mode
), q
= mode_name_buf
; *p
; p
++, q
++)
10045 built_in_names
[mcode
] = concat (prefix
, "mul", mode_name_buf
, "3",
10047 local_define_builtin (built_in_names
[mcode
], ftype
, mcode
,
10048 built_in_names
[mcode
],
10049 ECF_CONST
| ECF_NOTHROW
| ECF_LEAF
);
10051 built_in_names
[dcode
] = concat (prefix
, "div", mode_name_buf
, "3",
10053 local_define_builtin (built_in_names
[dcode
], ftype
, dcode
,
10054 built_in_names
[dcode
],
10055 ECF_CONST
| ECF_NOTHROW
| ECF_LEAF
);
10060 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
10063 If we requested a pointer to a vector, build up the pointers that
10064 we stripped off while looking for the inner type. Similarly for
10065 return values from functions.
10067 The argument TYPE is the top of the chain, and BOTTOM is the
10068 new type which we will point to. */
10071 reconstruct_complex_type (tree type
, tree bottom
)
10075 if (TREE_CODE (type
) == POINTER_TYPE
)
10077 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10078 outer
= build_pointer_type_for_mode (inner
, TYPE_MODE (type
),
10079 TYPE_REF_CAN_ALIAS_ALL (type
));
10081 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
10083 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10084 outer
= build_reference_type_for_mode (inner
, TYPE_MODE (type
),
10085 TYPE_REF_CAN_ALIAS_ALL (type
));
10087 else if (TREE_CODE (type
) == ARRAY_TYPE
)
10089 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10090 outer
= build_array_type (inner
, TYPE_DOMAIN (type
));
10092 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10094 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10095 outer
= build_function_type (inner
, TYPE_ARG_TYPES (type
));
10097 else if (TREE_CODE (type
) == METHOD_TYPE
)
10099 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10100 /* The build_method_type_directly() routine prepends 'this' to argument list,
10101 so we must compensate by getting rid of it. */
10103 = build_method_type_directly
10104 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
))),
10106 TREE_CHAIN (TYPE_ARG_TYPES (type
)));
10108 else if (TREE_CODE (type
) == OFFSET_TYPE
)
10110 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10111 outer
= build_offset_type (TYPE_OFFSET_BASETYPE (type
), inner
);
10116 return build_type_attribute_qual_variant (outer
, TYPE_ATTRIBUTES (type
),
10117 TYPE_QUALS (type
));
10120 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
10123 build_vector_type_for_mode (tree innertype
, enum machine_mode mode
)
10127 switch (GET_MODE_CLASS (mode
))
10129 case MODE_VECTOR_INT
:
10130 case MODE_VECTOR_FLOAT
:
10131 case MODE_VECTOR_FRACT
:
10132 case MODE_VECTOR_UFRACT
:
10133 case MODE_VECTOR_ACCUM
:
10134 case MODE_VECTOR_UACCUM
:
10135 nunits
= GET_MODE_NUNITS (mode
);
10139 /* Check that there are no leftover bits. */
10140 gcc_assert (GET_MODE_BITSIZE (mode
)
10141 % TREE_INT_CST_LOW (TYPE_SIZE (innertype
)) == 0);
10143 nunits
= GET_MODE_BITSIZE (mode
)
10144 / TREE_INT_CST_LOW (TYPE_SIZE (innertype
));
10148 gcc_unreachable ();
10151 return make_vector_type (innertype
, nunits
, mode
);
10154 /* Similarly, but takes the inner type and number of units, which must be
10158 build_vector_type (tree innertype
, int nunits
)
10160 return make_vector_type (innertype
, nunits
, VOIDmode
);
10163 /* Similarly, but builds a variant type with TYPE_VECTOR_OPAQUE set. */
10166 build_opaque_vector_type (tree innertype
, int nunits
)
10168 tree t
= make_vector_type (innertype
, nunits
, VOIDmode
);
10170 /* We always build the non-opaque variant before the opaque one,
10171 so if it already exists, it is TYPE_NEXT_VARIANT of this one. */
10172 cand
= TYPE_NEXT_VARIANT (t
);
10174 && TYPE_VECTOR_OPAQUE (cand
)
10175 && check_qualified_type (cand
, t
, TYPE_QUALS (t
)))
10177 /* Othewise build a variant type and make sure to queue it after
10178 the non-opaque type. */
10179 cand
= build_distinct_type_copy (t
);
10180 TYPE_VECTOR_OPAQUE (cand
) = true;
10181 TYPE_CANONICAL (cand
) = TYPE_CANONICAL (t
);
10182 TYPE_NEXT_VARIANT (cand
) = TYPE_NEXT_VARIANT (t
);
10183 TYPE_NEXT_VARIANT (t
) = cand
;
10184 TYPE_MAIN_VARIANT (cand
) = TYPE_MAIN_VARIANT (t
);
10189 /* Given an initializer INIT, return TRUE if INIT is zero or some
10190 aggregate of zeros. Otherwise return FALSE. */
10192 initializer_zerop (const_tree init
)
10198 switch (TREE_CODE (init
))
10201 return integer_zerop (init
);
10204 /* ??? Note that this is not correct for C4X float formats. There,
10205 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
10206 negative exponent. */
10207 return real_zerop (init
)
10208 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init
));
10211 return fixed_zerop (init
);
10214 return integer_zerop (init
)
10215 || (real_zerop (init
)
10216 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init
)))
10217 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init
))));
10222 for (i
= 0; i
< VECTOR_CST_NELTS (init
); ++i
)
10223 if (!initializer_zerop (VECTOR_CST_ELT (init
, i
)))
10230 unsigned HOST_WIDE_INT idx
;
10232 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init
), idx
, elt
)
10233 if (!initializer_zerop (elt
))
10242 /* We need to loop through all elements to handle cases like
10243 "\0" and "\0foobar". */
10244 for (i
= 0; i
< TREE_STRING_LENGTH (init
); ++i
)
10245 if (TREE_STRING_POINTER (init
)[i
] != '\0')
10256 /* Check if vector VEC consists of all the equal elements and
10257 that the number of elements corresponds to the type of VEC.
10258 The function returns first element of the vector
10259 or NULL_TREE if the vector is not uniform. */
10261 uniform_vector_p (const_tree vec
)
10266 if (vec
== NULL_TREE
)
10269 gcc_assert (VECTOR_TYPE_P (TREE_TYPE (vec
)));
10271 if (TREE_CODE (vec
) == VECTOR_CST
)
10273 first
= VECTOR_CST_ELT (vec
, 0);
10274 for (i
= 1; i
< VECTOR_CST_NELTS (vec
); ++i
)
10275 if (!operand_equal_p (first
, VECTOR_CST_ELT (vec
, i
), 0))
10281 else if (TREE_CODE (vec
) == CONSTRUCTOR
)
10283 first
= error_mark_node
;
10285 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (vec
), i
, t
)
10292 if (!operand_equal_p (first
, t
, 0))
10295 if (i
!= TYPE_VECTOR_SUBPARTS (TREE_TYPE (vec
)))
10304 /* Build an empty statement at location LOC. */
10307 build_empty_stmt (location_t loc
)
10309 tree t
= build1 (NOP_EXPR
, void_type_node
, size_zero_node
);
10310 SET_EXPR_LOCATION (t
, loc
);
10315 /* Build an OpenMP clause with code CODE. LOC is the location of the
10319 build_omp_clause (location_t loc
, enum omp_clause_code code
)
10324 length
= omp_clause_num_ops
[code
];
10325 size
= (sizeof (struct tree_omp_clause
) + (length
- 1) * sizeof (tree
));
10327 record_node_allocation_statistics (OMP_CLAUSE
, size
);
10329 t
= (tree
) ggc_internal_alloc (size
);
10330 memset (t
, 0, size
);
10331 TREE_SET_CODE (t
, OMP_CLAUSE
);
10332 OMP_CLAUSE_SET_CODE (t
, code
);
10333 OMP_CLAUSE_LOCATION (t
) = loc
;
10338 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
10339 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
10340 Except for the CODE and operand count field, other storage for the
10341 object is initialized to zeros. */
10344 build_vl_exp_stat (enum tree_code code
, int len MEM_STAT_DECL
)
10347 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_exp
);
10349 gcc_assert (TREE_CODE_CLASS (code
) == tcc_vl_exp
);
10350 gcc_assert (len
>= 1);
10352 record_node_allocation_statistics (code
, length
);
10354 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
10356 TREE_SET_CODE (t
, code
);
10358 /* Can't use TREE_OPERAND to store the length because if checking is
10359 enabled, it will try to check the length before we store it. :-P */
10360 t
->exp
.operands
[0] = build_int_cst (sizetype
, len
);
10365 /* Helper function for build_call_* functions; build a CALL_EXPR with
10366 indicated RETURN_TYPE, FN, and NARGS, but do not initialize any of
10367 the argument slots. */
10370 build_call_1 (tree return_type
, tree fn
, int nargs
)
10374 t
= build_vl_exp (CALL_EXPR
, nargs
+ 3);
10375 TREE_TYPE (t
) = return_type
;
10376 CALL_EXPR_FN (t
) = fn
;
10377 CALL_EXPR_STATIC_CHAIN (t
) = NULL
;
10382 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10383 FN and a null static chain slot. NARGS is the number of call arguments
10384 which are specified as "..." arguments. */
10387 build_call_nary (tree return_type
, tree fn
, int nargs
, ...)
10391 va_start (args
, nargs
);
10392 ret
= build_call_valist (return_type
, fn
, nargs
, args
);
10397 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10398 FN and a null static chain slot. NARGS is the number of call arguments
10399 which are specified as a va_list ARGS. */
10402 build_call_valist (tree return_type
, tree fn
, int nargs
, va_list args
)
10407 t
= build_call_1 (return_type
, fn
, nargs
);
10408 for (i
= 0; i
< nargs
; i
++)
10409 CALL_EXPR_ARG (t
, i
) = va_arg (args
, tree
);
10410 process_call_operands (t
);
10414 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10415 FN and a null static chain slot. NARGS is the number of call arguments
10416 which are specified as a tree array ARGS. */
10419 build_call_array_loc (location_t loc
, tree return_type
, tree fn
,
10420 int nargs
, const tree
*args
)
10425 t
= build_call_1 (return_type
, fn
, nargs
);
10426 for (i
= 0; i
< nargs
; i
++)
10427 CALL_EXPR_ARG (t
, i
) = args
[i
];
10428 process_call_operands (t
);
10429 SET_EXPR_LOCATION (t
, loc
);
10433 /* Like build_call_array, but takes a vec. */
10436 build_call_vec (tree return_type
, tree fn
, vec
<tree
, va_gc
> *args
)
10441 ret
= build_call_1 (return_type
, fn
, vec_safe_length (args
));
10442 FOR_EACH_VEC_SAFE_ELT (args
, ix
, t
)
10443 CALL_EXPR_ARG (ret
, ix
) = t
;
10444 process_call_operands (ret
);
10448 /* Return true if T (assumed to be a DECL) must be assigned a memory
10452 needs_to_live_in_memory (const_tree t
)
10454 return (TREE_ADDRESSABLE (t
)
10455 || is_global_var (t
)
10456 || (TREE_CODE (t
) == RESULT_DECL
10457 && !DECL_BY_REFERENCE (t
)
10458 && aggregate_value_p (t
, current_function_decl
)));
10461 /* Return value of a constant X and sign-extend it. */
10464 int_cst_value (const_tree x
)
10466 unsigned bits
= TYPE_PRECISION (TREE_TYPE (x
));
10467 unsigned HOST_WIDE_INT val
= TREE_INT_CST_LOW (x
);
10469 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
10470 gcc_assert (cst_and_fits_in_hwi (x
));
10472 if (bits
< HOST_BITS_PER_WIDE_INT
)
10474 bool negative
= ((val
>> (bits
- 1)) & 1) != 0;
10476 val
|= (~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1;
10478 val
&= ~((~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1);
10484 /* If TYPE is an integral or pointer type, return an integer type with
10485 the same precision which is unsigned iff UNSIGNEDP is true, or itself
10486 if TYPE is already an integer type of signedness UNSIGNEDP. */
10489 signed_or_unsigned_type_for (int unsignedp
, tree type
)
10491 if (TREE_CODE (type
) == INTEGER_TYPE
&& TYPE_UNSIGNED (type
) == unsignedp
)
10494 if (TREE_CODE (type
) == VECTOR_TYPE
)
10496 tree inner
= TREE_TYPE (type
);
10497 tree inner2
= signed_or_unsigned_type_for (unsignedp
, inner
);
10500 if (inner
== inner2
)
10502 return build_vector_type (inner2
, TYPE_VECTOR_SUBPARTS (type
));
10505 if (!INTEGRAL_TYPE_P (type
)
10506 && !POINTER_TYPE_P (type
)
10507 && TREE_CODE (type
) != OFFSET_TYPE
)
10510 return build_nonstandard_integer_type (TYPE_PRECISION (type
), unsignedp
);
10513 /* If TYPE is an integral or pointer type, return an integer type with
10514 the same precision which is unsigned, or itself if TYPE is already an
10515 unsigned integer type. */
10518 unsigned_type_for (tree type
)
10520 return signed_or_unsigned_type_for (1, type
);
10523 /* If TYPE is an integral or pointer type, return an integer type with
10524 the same precision which is signed, or itself if TYPE is already a
10525 signed integer type. */
10528 signed_type_for (tree type
)
10530 return signed_or_unsigned_type_for (0, type
);
10533 /* If TYPE is a vector type, return a signed integer vector type with the
10534 same width and number of subparts. Otherwise return boolean_type_node. */
10537 truth_type_for (tree type
)
10539 if (TREE_CODE (type
) == VECTOR_TYPE
)
10541 tree elem
= lang_hooks
.types
.type_for_size
10542 (GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (type
))), 0);
10543 return build_opaque_vector_type (elem
, TYPE_VECTOR_SUBPARTS (type
));
10546 return boolean_type_node
;
10549 /* Returns the largest value obtainable by casting something in INNER type to
10553 upper_bound_in_type (tree outer
, tree inner
)
10555 unsigned int det
= 0;
10556 unsigned oprec
= TYPE_PRECISION (outer
);
10557 unsigned iprec
= TYPE_PRECISION (inner
);
10560 /* Compute a unique number for every combination. */
10561 det
|= (oprec
> iprec
) ? 4 : 0;
10562 det
|= TYPE_UNSIGNED (outer
) ? 2 : 0;
10563 det
|= TYPE_UNSIGNED (inner
) ? 1 : 0;
10565 /* Determine the exponent to use. */
10570 /* oprec <= iprec, outer: signed, inner: don't care. */
10575 /* oprec <= iprec, outer: unsigned, inner: don't care. */
10579 /* oprec > iprec, outer: signed, inner: signed. */
10583 /* oprec > iprec, outer: signed, inner: unsigned. */
10587 /* oprec > iprec, outer: unsigned, inner: signed. */
10591 /* oprec > iprec, outer: unsigned, inner: unsigned. */
10595 gcc_unreachable ();
10598 return wide_int_to_tree (outer
,
10599 wi::mask (prec
, false, TYPE_PRECISION (outer
)));
10602 /* Returns the smallest value obtainable by casting something in INNER type to
10606 lower_bound_in_type (tree outer
, tree inner
)
10608 unsigned oprec
= TYPE_PRECISION (outer
);
10609 unsigned iprec
= TYPE_PRECISION (inner
);
10611 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
10613 if (TYPE_UNSIGNED (outer
)
10614 /* If we are widening something of an unsigned type, OUTER type
10615 contains all values of INNER type. In particular, both INNER
10616 and OUTER types have zero in common. */
10617 || (oprec
> iprec
&& TYPE_UNSIGNED (inner
)))
10618 return build_int_cst (outer
, 0);
10621 /* If we are widening a signed type to another signed type, we
10622 want to obtain -2^^(iprec-1). If we are keeping the
10623 precision or narrowing to a signed type, we want to obtain
10625 unsigned prec
= oprec
> iprec
? iprec
: oprec
;
10626 return wide_int_to_tree (outer
,
10627 wi::mask (prec
- 1, true,
10628 TYPE_PRECISION (outer
)));
10632 /* Return nonzero if two operands that are suitable for PHI nodes are
10633 necessarily equal. Specifically, both ARG0 and ARG1 must be either
10634 SSA_NAME or invariant. Note that this is strictly an optimization.
10635 That is, callers of this function can directly call operand_equal_p
10636 and get the same result, only slower. */
10639 operand_equal_for_phi_arg_p (const_tree arg0
, const_tree arg1
)
10643 if (TREE_CODE (arg0
) == SSA_NAME
|| TREE_CODE (arg1
) == SSA_NAME
)
10645 return operand_equal_p (arg0
, arg1
, 0);
10648 /* Returns number of zeros at the end of binary representation of X. */
10651 num_ending_zeros (const_tree x
)
10653 return build_int_cst (TREE_TYPE (x
), wi::ctz (x
));
10657 #define WALK_SUBTREE(NODE) \
10660 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
10666 /* This is a subroutine of walk_tree that walks field of TYPE that are to
10667 be walked whenever a type is seen in the tree. Rest of operands and return
10668 value are as for walk_tree. */
10671 walk_type_fields (tree type
, walk_tree_fn func
, void *data
,
10672 struct pointer_set_t
*pset
, walk_tree_lh lh
)
10674 tree result
= NULL_TREE
;
10676 switch (TREE_CODE (type
))
10679 case REFERENCE_TYPE
:
10681 /* We have to worry about mutually recursive pointers. These can't
10682 be written in C. They can in Ada. It's pathological, but
10683 there's an ACATS test (c38102a) that checks it. Deal with this
10684 by checking if we're pointing to another pointer, that one
10685 points to another pointer, that one does too, and we have no htab.
10686 If so, get a hash table. We check three levels deep to avoid
10687 the cost of the hash table if we don't need one. */
10688 if (POINTER_TYPE_P (TREE_TYPE (type
))
10689 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type
)))
10690 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type
))))
10693 result
= walk_tree_without_duplicates (&TREE_TYPE (type
),
10701 /* ... fall through ... */
10704 WALK_SUBTREE (TREE_TYPE (type
));
10708 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type
));
10710 /* Fall through. */
10712 case FUNCTION_TYPE
:
10713 WALK_SUBTREE (TREE_TYPE (type
));
10717 /* We never want to walk into default arguments. */
10718 for (arg
= TYPE_ARG_TYPES (type
); arg
; arg
= TREE_CHAIN (arg
))
10719 WALK_SUBTREE (TREE_VALUE (arg
));
10724 /* Don't follow this nodes's type if a pointer for fear that
10725 we'll have infinite recursion. If we have a PSET, then we
10728 || (!POINTER_TYPE_P (TREE_TYPE (type
))
10729 && TREE_CODE (TREE_TYPE (type
)) != OFFSET_TYPE
))
10730 WALK_SUBTREE (TREE_TYPE (type
));
10731 WALK_SUBTREE (TYPE_DOMAIN (type
));
10735 WALK_SUBTREE (TREE_TYPE (type
));
10736 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type
));
10746 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
10747 called with the DATA and the address of each sub-tree. If FUNC returns a
10748 non-NULL value, the traversal is stopped, and the value returned by FUNC
10749 is returned. If PSET is non-NULL it is used to record the nodes visited,
10750 and to avoid visiting a node more than once. */
10753 walk_tree_1 (tree
*tp
, walk_tree_fn func
, void *data
,
10754 struct pointer_set_t
*pset
, walk_tree_lh lh
)
10756 enum tree_code code
;
10760 #define WALK_SUBTREE_TAIL(NODE) \
10764 goto tail_recurse; \
10769 /* Skip empty subtrees. */
10773 /* Don't walk the same tree twice, if the user has requested
10774 that we avoid doing so. */
10775 if (pset
&& pointer_set_insert (pset
, *tp
))
10778 /* Call the function. */
10780 result
= (*func
) (tp
, &walk_subtrees
, data
);
10782 /* If we found something, return it. */
10786 code
= TREE_CODE (*tp
);
10788 /* Even if we didn't, FUNC may have decided that there was nothing
10789 interesting below this point in the tree. */
10790 if (!walk_subtrees
)
10792 /* But we still need to check our siblings. */
10793 if (code
== TREE_LIST
)
10794 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
10795 else if (code
== OMP_CLAUSE
)
10796 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10803 result
= (*lh
) (tp
, &walk_subtrees
, func
, data
, pset
);
10804 if (result
|| !walk_subtrees
)
10811 case IDENTIFIER_NODE
:
10818 case PLACEHOLDER_EXPR
:
10822 /* None of these have subtrees other than those already walked
10827 WALK_SUBTREE (TREE_VALUE (*tp
));
10828 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
10833 int len
= TREE_VEC_LENGTH (*tp
);
10838 /* Walk all elements but the first. */
10840 WALK_SUBTREE (TREE_VEC_ELT (*tp
, len
));
10842 /* Now walk the first one as a tail call. */
10843 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp
, 0));
10847 WALK_SUBTREE (TREE_REALPART (*tp
));
10848 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp
));
10852 unsigned HOST_WIDE_INT idx
;
10853 constructor_elt
*ce
;
10855 for (idx
= 0; vec_safe_iterate (CONSTRUCTOR_ELTS (*tp
), idx
, &ce
);
10857 WALK_SUBTREE (ce
->value
);
10862 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, 0));
10867 for (decl
= BIND_EXPR_VARS (*tp
); decl
; decl
= DECL_CHAIN (decl
))
10869 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
10870 into declarations that are just mentioned, rather than
10871 declared; they don't really belong to this part of the tree.
10872 And, we can see cycles: the initializer for a declaration
10873 can refer to the declaration itself. */
10874 WALK_SUBTREE (DECL_INITIAL (decl
));
10875 WALK_SUBTREE (DECL_SIZE (decl
));
10876 WALK_SUBTREE (DECL_SIZE_UNIT (decl
));
10878 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp
));
10881 case STATEMENT_LIST
:
10883 tree_stmt_iterator i
;
10884 for (i
= tsi_start (*tp
); !tsi_end_p (i
); tsi_next (&i
))
10885 WALK_SUBTREE (*tsi_stmt_ptr (i
));
10890 switch (OMP_CLAUSE_CODE (*tp
))
10892 case OMP_CLAUSE_PRIVATE
:
10893 case OMP_CLAUSE_SHARED
:
10894 case OMP_CLAUSE_FIRSTPRIVATE
:
10895 case OMP_CLAUSE_COPYIN
:
10896 case OMP_CLAUSE_COPYPRIVATE
:
10897 case OMP_CLAUSE_FINAL
:
10898 case OMP_CLAUSE_IF
:
10899 case OMP_CLAUSE_NUM_THREADS
:
10900 case OMP_CLAUSE_SCHEDULE
:
10901 case OMP_CLAUSE_UNIFORM
:
10902 case OMP_CLAUSE_DEPEND
:
10903 case OMP_CLAUSE_NUM_TEAMS
:
10904 case OMP_CLAUSE_THREAD_LIMIT
:
10905 case OMP_CLAUSE_DEVICE
:
10906 case OMP_CLAUSE_DIST_SCHEDULE
:
10907 case OMP_CLAUSE_SAFELEN
:
10908 case OMP_CLAUSE_SIMDLEN
:
10909 case OMP_CLAUSE__LOOPTEMP_
:
10910 case OMP_CLAUSE__SIMDUID_
:
10911 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 0));
10914 case OMP_CLAUSE_NOWAIT
:
10915 case OMP_CLAUSE_ORDERED
:
10916 case OMP_CLAUSE_DEFAULT
:
10917 case OMP_CLAUSE_UNTIED
:
10918 case OMP_CLAUSE_MERGEABLE
:
10919 case OMP_CLAUSE_PROC_BIND
:
10920 case OMP_CLAUSE_INBRANCH
:
10921 case OMP_CLAUSE_NOTINBRANCH
:
10922 case OMP_CLAUSE_FOR
:
10923 case OMP_CLAUSE_PARALLEL
:
10924 case OMP_CLAUSE_SECTIONS
:
10925 case OMP_CLAUSE_TASKGROUP
:
10926 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10928 case OMP_CLAUSE_LASTPRIVATE
:
10929 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
10930 WALK_SUBTREE (OMP_CLAUSE_LASTPRIVATE_STMT (*tp
));
10931 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10933 case OMP_CLAUSE_COLLAPSE
:
10936 for (i
= 0; i
< 3; i
++)
10937 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
10938 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10941 case OMP_CLAUSE_LINEAR
:
10942 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
10943 WALK_SUBTREE (OMP_CLAUSE_LINEAR_STEP (*tp
));
10944 WALK_SUBTREE (OMP_CLAUSE_LINEAR_STMT (*tp
));
10945 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10947 case OMP_CLAUSE_ALIGNED
:
10948 case OMP_CLAUSE_FROM
:
10949 case OMP_CLAUSE_TO
:
10950 case OMP_CLAUSE_MAP
:
10951 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
10952 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 1));
10953 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10955 case OMP_CLAUSE_REDUCTION
:
10958 for (i
= 0; i
< 4; i
++)
10959 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
10960 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10964 gcc_unreachable ();
10972 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
10973 But, we only want to walk once. */
10974 len
= (TREE_OPERAND (*tp
, 3) == TREE_OPERAND (*tp
, 1)) ? 2 : 3;
10975 for (i
= 0; i
< len
; ++i
)
10976 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
10977 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
));
10981 /* If this is a TYPE_DECL, walk into the fields of the type that it's
10982 defining. We only want to walk into these fields of a type in this
10983 case and not in the general case of a mere reference to the type.
10985 The criterion is as follows: if the field can be an expression, it
10986 must be walked only here. This should be in keeping with the fields
10987 that are directly gimplified in gimplify_type_sizes in order for the
10988 mark/copy-if-shared/unmark machinery of the gimplifier to work with
10989 variable-sized types.
10991 Note that DECLs get walked as part of processing the BIND_EXPR. */
10992 if (TREE_CODE (DECL_EXPR_DECL (*tp
)) == TYPE_DECL
)
10994 tree
*type_p
= &TREE_TYPE (DECL_EXPR_DECL (*tp
));
10995 if (TREE_CODE (*type_p
) == ERROR_MARK
)
10998 /* Call the function for the type. See if it returns anything or
10999 doesn't want us to continue. If we are to continue, walk both
11000 the normal fields and those for the declaration case. */
11001 result
= (*func
) (type_p
, &walk_subtrees
, data
);
11002 if (result
|| !walk_subtrees
)
11005 /* But do not walk a pointed-to type since it may itself need to
11006 be walked in the declaration case if it isn't anonymous. */
11007 if (!POINTER_TYPE_P (*type_p
))
11009 result
= walk_type_fields (*type_p
, func
, data
, pset
, lh
);
11014 /* If this is a record type, also walk the fields. */
11015 if (RECORD_OR_UNION_TYPE_P (*type_p
))
11019 for (field
= TYPE_FIELDS (*type_p
); field
;
11020 field
= DECL_CHAIN (field
))
11022 /* We'd like to look at the type of the field, but we can
11023 easily get infinite recursion. So assume it's pointed
11024 to elsewhere in the tree. Also, ignore things that
11026 if (TREE_CODE (field
) != FIELD_DECL
)
11029 WALK_SUBTREE (DECL_FIELD_OFFSET (field
));
11030 WALK_SUBTREE (DECL_SIZE (field
));
11031 WALK_SUBTREE (DECL_SIZE_UNIT (field
));
11032 if (TREE_CODE (*type_p
) == QUAL_UNION_TYPE
)
11033 WALK_SUBTREE (DECL_QUALIFIER (field
));
11037 /* Same for scalar types. */
11038 else if (TREE_CODE (*type_p
) == BOOLEAN_TYPE
11039 || TREE_CODE (*type_p
) == ENUMERAL_TYPE
11040 || TREE_CODE (*type_p
) == INTEGER_TYPE
11041 || TREE_CODE (*type_p
) == FIXED_POINT_TYPE
11042 || TREE_CODE (*type_p
) == REAL_TYPE
)
11044 WALK_SUBTREE (TYPE_MIN_VALUE (*type_p
));
11045 WALK_SUBTREE (TYPE_MAX_VALUE (*type_p
));
11048 WALK_SUBTREE (TYPE_SIZE (*type_p
));
11049 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p
));
11054 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code
)))
11058 /* Walk over all the sub-trees of this operand. */
11059 len
= TREE_OPERAND_LENGTH (*tp
);
11061 /* Go through the subtrees. We need to do this in forward order so
11062 that the scope of a FOR_EXPR is handled properly. */
11065 for (i
= 0; i
< len
- 1; ++i
)
11066 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
11067 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
- 1));
11070 /* If this is a type, walk the needed fields in the type. */
11071 else if (TYPE_P (*tp
))
11072 return walk_type_fields (*tp
, func
, data
, pset
, lh
);
11076 /* We didn't find what we were looking for. */
11079 #undef WALK_SUBTREE_TAIL
11081 #undef WALK_SUBTREE
11083 /* Like walk_tree, but does not walk duplicate nodes more than once. */
11086 walk_tree_without_duplicates_1 (tree
*tp
, walk_tree_fn func
, void *data
,
11090 struct pointer_set_t
*pset
;
11092 pset
= pointer_set_create ();
11093 result
= walk_tree_1 (tp
, func
, data
, pset
, lh
);
11094 pointer_set_destroy (pset
);
11100 tree_block (tree t
)
11102 const enum tree_code_class c
= TREE_CODE_CLASS (TREE_CODE (t
));
11104 if (IS_EXPR_CODE_CLASS (c
))
11105 return LOCATION_BLOCK (t
->exp
.locus
);
11106 gcc_unreachable ();
11111 tree_set_block (tree t
, tree b
)
11113 const enum tree_code_class c
= TREE_CODE_CLASS (TREE_CODE (t
));
11115 if (IS_EXPR_CODE_CLASS (c
))
11118 t
->exp
.locus
= COMBINE_LOCATION_DATA (line_table
, t
->exp
.locus
, b
);
11120 t
->exp
.locus
= LOCATION_LOCUS (t
->exp
.locus
);
11123 gcc_unreachable ();
11126 /* Create a nameless artificial label and put it in the current
11127 function context. The label has a location of LOC. Returns the
11128 newly created label. */
11131 create_artificial_label (location_t loc
)
11133 tree lab
= build_decl (loc
,
11134 LABEL_DECL
, NULL_TREE
, void_type_node
);
11136 DECL_ARTIFICIAL (lab
) = 1;
11137 DECL_IGNORED_P (lab
) = 1;
11138 DECL_CONTEXT (lab
) = current_function_decl
;
11142 /* Given a tree, try to return a useful variable name that we can use
11143 to prefix a temporary that is being assigned the value of the tree.
11144 I.E. given <temp> = &A, return A. */
11149 tree stripped_decl
;
11152 STRIP_NOPS (stripped_decl
);
11153 if (DECL_P (stripped_decl
) && DECL_NAME (stripped_decl
))
11154 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl
));
11155 else if (TREE_CODE (stripped_decl
) == SSA_NAME
)
11157 tree name
= SSA_NAME_IDENTIFIER (stripped_decl
);
11160 return IDENTIFIER_POINTER (name
);
11164 switch (TREE_CODE (stripped_decl
))
11167 return get_name (TREE_OPERAND (stripped_decl
, 0));
11174 /* Return true if TYPE has a variable argument list. */
11177 stdarg_p (const_tree fntype
)
11179 function_args_iterator args_iter
;
11180 tree n
= NULL_TREE
, t
;
11185 FOREACH_FUNCTION_ARGS (fntype
, t
, args_iter
)
11190 return n
!= NULL_TREE
&& n
!= void_type_node
;
11193 /* Return true if TYPE has a prototype. */
11196 prototype_p (tree fntype
)
11200 gcc_assert (fntype
!= NULL_TREE
);
11202 t
= TYPE_ARG_TYPES (fntype
);
11203 return (t
!= NULL_TREE
);
11206 /* If BLOCK is inlined from an __attribute__((__artificial__))
11207 routine, return pointer to location from where it has been
11210 block_nonartificial_location (tree block
)
11212 location_t
*ret
= NULL
;
11214 while (block
&& TREE_CODE (block
) == BLOCK
11215 && BLOCK_ABSTRACT_ORIGIN (block
))
11217 tree ao
= BLOCK_ABSTRACT_ORIGIN (block
);
11219 while (TREE_CODE (ao
) == BLOCK
11220 && BLOCK_ABSTRACT_ORIGIN (ao
)
11221 && BLOCK_ABSTRACT_ORIGIN (ao
) != ao
)
11222 ao
= BLOCK_ABSTRACT_ORIGIN (ao
);
11224 if (TREE_CODE (ao
) == FUNCTION_DECL
)
11226 /* If AO is an artificial inline, point RET to the
11227 call site locus at which it has been inlined and continue
11228 the loop, in case AO's caller is also an artificial
11230 if (DECL_DECLARED_INLINE_P (ao
)
11231 && lookup_attribute ("artificial", DECL_ATTRIBUTES (ao
)))
11232 ret
= &BLOCK_SOURCE_LOCATION (block
);
11236 else if (TREE_CODE (ao
) != BLOCK
)
11239 block
= BLOCK_SUPERCONTEXT (block
);
11245 /* If EXP is inlined from an __attribute__((__artificial__))
11246 function, return the location of the original call expression. */
11249 tree_nonartificial_location (tree exp
)
11251 location_t
*loc
= block_nonartificial_location (TREE_BLOCK (exp
));
11256 return EXPR_LOCATION (exp
);
11260 /* These are the hash table functions for the hash table of OPTIMIZATION_NODEq
11263 /* Return the hash code code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
11266 cl_option_hash_hash (const void *x
)
11268 const_tree
const t
= (const_tree
) x
;
11272 hashval_t hash
= 0;
11274 if (TREE_CODE (t
) == OPTIMIZATION_NODE
)
11276 p
= (const char *)TREE_OPTIMIZATION (t
);
11277 len
= sizeof (struct cl_optimization
);
11280 else if (TREE_CODE (t
) == TARGET_OPTION_NODE
)
11282 p
= (const char *)TREE_TARGET_OPTION (t
);
11283 len
= sizeof (struct cl_target_option
);
11287 gcc_unreachable ();
11289 /* assume most opt flags are just 0/1, some are 2-3, and a few might be
11291 for (i
= 0; i
< len
; i
++)
11293 hash
= (hash
<< 4) ^ ((i
<< 2) | p
[i
]);
11298 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
11299 TARGET_OPTION tree node) is the same as that given by *Y, which is the
11303 cl_option_hash_eq (const void *x
, const void *y
)
11305 const_tree
const xt
= (const_tree
) x
;
11306 const_tree
const yt
= (const_tree
) y
;
11311 if (TREE_CODE (xt
) != TREE_CODE (yt
))
11314 if (TREE_CODE (xt
) == OPTIMIZATION_NODE
)
11316 xp
= (const char *)TREE_OPTIMIZATION (xt
);
11317 yp
= (const char *)TREE_OPTIMIZATION (yt
);
11318 len
= sizeof (struct cl_optimization
);
11321 else if (TREE_CODE (xt
) == TARGET_OPTION_NODE
)
11323 xp
= (const char *)TREE_TARGET_OPTION (xt
);
11324 yp
= (const char *)TREE_TARGET_OPTION (yt
);
11325 len
= sizeof (struct cl_target_option
);
11329 gcc_unreachable ();
11331 return (memcmp (xp
, yp
, len
) == 0);
11334 /* Build an OPTIMIZATION_NODE based on the options in OPTS. */
11337 build_optimization_node (struct gcc_options
*opts
)
11342 /* Use the cache of optimization nodes. */
11344 cl_optimization_save (TREE_OPTIMIZATION (cl_optimization_node
),
11347 slot
= htab_find_slot (cl_option_hash_table
, cl_optimization_node
, INSERT
);
11351 /* Insert this one into the hash table. */
11352 t
= cl_optimization_node
;
11355 /* Make a new node for next time round. */
11356 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
11362 /* Build a TARGET_OPTION_NODE based on the options in OPTS. */
11365 build_target_option_node (struct gcc_options
*opts
)
11370 /* Use the cache of optimization nodes. */
11372 cl_target_option_save (TREE_TARGET_OPTION (cl_target_option_node
),
11375 slot
= htab_find_slot (cl_option_hash_table
, cl_target_option_node
, INSERT
);
11379 /* Insert this one into the hash table. */
11380 t
= cl_target_option_node
;
11383 /* Make a new node for next time round. */
11384 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
11390 /* Reset TREE_TARGET_GLOBALS cache for TARGET_OPTION_NODE.
11391 Called through htab_traverse. */
11394 prepare_target_option_node_for_pch (void **slot
, void *)
11396 tree node
= (tree
) *slot
;
11397 if (TREE_CODE (node
) == TARGET_OPTION_NODE
)
11398 TREE_TARGET_GLOBALS (node
) = NULL
;
11402 /* Clear TREE_TARGET_GLOBALS of all TARGET_OPTION_NODE trees,
11403 so that they aren't saved during PCH writing. */
11406 prepare_target_option_nodes_for_pch (void)
11408 htab_traverse (cl_option_hash_table
, prepare_target_option_node_for_pch
,
11412 /* Determine the "ultimate origin" of a block. The block may be an inlined
11413 instance of an inlined instance of a block which is local to an inline
11414 function, so we have to trace all of the way back through the origin chain
11415 to find out what sort of node actually served as the original seed for the
11419 block_ultimate_origin (const_tree block
)
11421 tree immediate_origin
= BLOCK_ABSTRACT_ORIGIN (block
);
11423 /* output_inline_function sets BLOCK_ABSTRACT_ORIGIN for all the
11424 nodes in the function to point to themselves; ignore that if
11425 we're trying to output the abstract instance of this function. */
11426 if (BLOCK_ABSTRACT (block
) && immediate_origin
== block
)
11429 if (immediate_origin
== NULL_TREE
)
11434 tree lookahead
= immediate_origin
;
11438 ret_val
= lookahead
;
11439 lookahead
= (TREE_CODE (ret_val
) == BLOCK
11440 ? BLOCK_ABSTRACT_ORIGIN (ret_val
) : NULL
);
11442 while (lookahead
!= NULL
&& lookahead
!= ret_val
);
11444 /* The block's abstract origin chain may not be the *ultimate* origin of
11445 the block. It could lead to a DECL that has an abstract origin set.
11446 If so, we want that DECL's abstract origin (which is what DECL_ORIGIN
11447 will give us if it has one). Note that DECL's abstract origins are
11448 supposed to be the most distant ancestor (or so decl_ultimate_origin
11449 claims), so we don't need to loop following the DECL origins. */
11450 if (DECL_P (ret_val
))
11451 return DECL_ORIGIN (ret_val
);
11457 /* Return true iff conversion in EXP generates no instruction. Mark
11458 it inline so that we fully inline into the stripping functions even
11459 though we have two uses of this function. */
11462 tree_nop_conversion (const_tree exp
)
11464 tree outer_type
, inner_type
;
11466 if (!CONVERT_EXPR_P (exp
)
11467 && TREE_CODE (exp
) != NON_LVALUE_EXPR
)
11469 if (TREE_OPERAND (exp
, 0) == error_mark_node
)
11472 outer_type
= TREE_TYPE (exp
);
11473 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
11478 /* Use precision rather then machine mode when we can, which gives
11479 the correct answer even for submode (bit-field) types. */
11480 if ((INTEGRAL_TYPE_P (outer_type
)
11481 || POINTER_TYPE_P (outer_type
)
11482 || TREE_CODE (outer_type
) == OFFSET_TYPE
)
11483 && (INTEGRAL_TYPE_P (inner_type
)
11484 || POINTER_TYPE_P (inner_type
)
11485 || TREE_CODE (inner_type
) == OFFSET_TYPE
))
11486 return TYPE_PRECISION (outer_type
) == TYPE_PRECISION (inner_type
);
11488 /* Otherwise fall back on comparing machine modes (e.g. for
11489 aggregate types, floats). */
11490 return TYPE_MODE (outer_type
) == TYPE_MODE (inner_type
);
11493 /* Return true iff conversion in EXP generates no instruction. Don't
11494 consider conversions changing the signedness. */
11497 tree_sign_nop_conversion (const_tree exp
)
11499 tree outer_type
, inner_type
;
11501 if (!tree_nop_conversion (exp
))
11504 outer_type
= TREE_TYPE (exp
);
11505 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
11507 return (TYPE_UNSIGNED (outer_type
) == TYPE_UNSIGNED (inner_type
)
11508 && POINTER_TYPE_P (outer_type
) == POINTER_TYPE_P (inner_type
));
11511 /* Strip conversions from EXP according to tree_nop_conversion and
11512 return the resulting expression. */
11515 tree_strip_nop_conversions (tree exp
)
11517 while (tree_nop_conversion (exp
))
11518 exp
= TREE_OPERAND (exp
, 0);
11522 /* Strip conversions from EXP according to tree_sign_nop_conversion
11523 and return the resulting expression. */
11526 tree_strip_sign_nop_conversions (tree exp
)
11528 while (tree_sign_nop_conversion (exp
))
11529 exp
= TREE_OPERAND (exp
, 0);
11533 /* Avoid any floating point extensions from EXP. */
11535 strip_float_extensions (tree exp
)
11537 tree sub
, expt
, subt
;
11539 /* For floating point constant look up the narrowest type that can hold
11540 it properly and handle it like (type)(narrowest_type)constant.
11541 This way we can optimize for instance a=a*2.0 where "a" is float
11542 but 2.0 is double constant. */
11543 if (TREE_CODE (exp
) == REAL_CST
&& !DECIMAL_FLOAT_TYPE_P (TREE_TYPE (exp
)))
11545 REAL_VALUE_TYPE orig
;
11548 orig
= TREE_REAL_CST (exp
);
11549 if (TYPE_PRECISION (TREE_TYPE (exp
)) > TYPE_PRECISION (float_type_node
)
11550 && exact_real_truncate (TYPE_MODE (float_type_node
), &orig
))
11551 type
= float_type_node
;
11552 else if (TYPE_PRECISION (TREE_TYPE (exp
))
11553 > TYPE_PRECISION (double_type_node
)
11554 && exact_real_truncate (TYPE_MODE (double_type_node
), &orig
))
11555 type
= double_type_node
;
11557 return build_real (type
, real_value_truncate (TYPE_MODE (type
), orig
));
11560 if (!CONVERT_EXPR_P (exp
))
11563 sub
= TREE_OPERAND (exp
, 0);
11564 subt
= TREE_TYPE (sub
);
11565 expt
= TREE_TYPE (exp
);
11567 if (!FLOAT_TYPE_P (subt
))
11570 if (DECIMAL_FLOAT_TYPE_P (expt
) != DECIMAL_FLOAT_TYPE_P (subt
))
11573 if (TYPE_PRECISION (subt
) > TYPE_PRECISION (expt
))
11576 return strip_float_extensions (sub
);
11579 /* Strip out all handled components that produce invariant
11583 strip_invariant_refs (const_tree op
)
11585 while (handled_component_p (op
))
11587 switch (TREE_CODE (op
))
11590 case ARRAY_RANGE_REF
:
11591 if (!is_gimple_constant (TREE_OPERAND (op
, 1))
11592 || TREE_OPERAND (op
, 2) != NULL_TREE
11593 || TREE_OPERAND (op
, 3) != NULL_TREE
)
11597 case COMPONENT_REF
:
11598 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
11604 op
= TREE_OPERAND (op
, 0);
11610 static GTY(()) tree gcc_eh_personality_decl
;
11612 /* Return the GCC personality function decl. */
11615 lhd_gcc_personality (void)
11617 if (!gcc_eh_personality_decl
)
11618 gcc_eh_personality_decl
= build_personality_function ("gcc");
11619 return gcc_eh_personality_decl
;
11622 /* For languages with One Definition Rule, work out if
11623 trees are actually the same even if the tree representation
11624 differs. This handles only decls appearing in TYPE_NAME
11625 and TYPE_CONTEXT. That is NAMESPACE_DECL, TYPE_DECL,
11626 RECORD_TYPE and IDENTIFIER_NODE. */
11629 same_for_odr (tree t1
, tree t2
)
11635 /* C and C++ FEs differ by using IDENTIFIER_NODE and TYPE_DECL. */
11636 if (TREE_CODE (t1
) == IDENTIFIER_NODE
11637 && TREE_CODE (t2
) == TYPE_DECL
11638 && DECL_FILE_SCOPE_P (t1
))
11640 t2
= DECL_NAME (t2
);
11641 gcc_assert (TREE_CODE (t2
) == IDENTIFIER_NODE
);
11643 if (TREE_CODE (t2
) == IDENTIFIER_NODE
11644 && TREE_CODE (t1
) == TYPE_DECL
11645 && DECL_FILE_SCOPE_P (t2
))
11647 t1
= DECL_NAME (t1
);
11648 gcc_assert (TREE_CODE (t1
) == IDENTIFIER_NODE
);
11650 if (TREE_CODE (t1
) != TREE_CODE (t2
))
11653 return types_same_for_odr (t1
, t2
);
11655 return decls_same_for_odr (t1
, t2
);
11659 /* For languages with One Definition Rule, work out if
11660 decls are actually the same even if the tree representation
11661 differs. This handles only decls appearing in TYPE_NAME
11662 and TYPE_CONTEXT. That is NAMESPACE_DECL, TYPE_DECL,
11663 RECORD_TYPE and IDENTIFIER_NODE. */
11666 decls_same_for_odr (tree decl1
, tree decl2
)
11668 if (decl1
&& TREE_CODE (decl1
) == TYPE_DECL
11669 && DECL_ORIGINAL_TYPE (decl1
))
11670 decl1
= DECL_ORIGINAL_TYPE (decl1
);
11671 if (decl2
&& TREE_CODE (decl2
) == TYPE_DECL
11672 && DECL_ORIGINAL_TYPE (decl2
))
11673 decl2
= DECL_ORIGINAL_TYPE (decl2
);
11674 if (decl1
== decl2
)
11676 if (!decl1
|| !decl2
)
11678 gcc_checking_assert (DECL_P (decl1
) && DECL_P (decl2
));
11679 if (TREE_CODE (decl1
) != TREE_CODE (decl2
))
11681 if (TREE_CODE (decl1
) == TRANSLATION_UNIT_DECL
)
11683 if (TREE_CODE (decl1
) != NAMESPACE_DECL
11684 && TREE_CODE (decl1
) != TYPE_DECL
)
11686 if (!DECL_NAME (decl1
))
11688 gcc_checking_assert (TREE_CODE (DECL_NAME (decl1
)) == IDENTIFIER_NODE
);
11689 gcc_checking_assert (!DECL_NAME (decl2
)
11690 || TREE_CODE (DECL_NAME (decl2
)) == IDENTIFIER_NODE
);
11691 if (DECL_NAME (decl1
) != DECL_NAME (decl2
))
11693 return same_for_odr (DECL_CONTEXT (decl1
),
11694 DECL_CONTEXT (decl2
));
11697 /* For languages with One Definition Rule, work out if
11698 types are same even if the tree representation differs.
11699 This is non-trivial for LTO where minnor differences in
11700 the type representation may have prevented type merging
11701 to merge two copies of otherwise equivalent type. */
11704 types_same_for_odr (tree type1
, tree type2
)
11706 gcc_checking_assert (TYPE_P (type1
) && TYPE_P (type2
));
11707 type1
= TYPE_MAIN_VARIANT (type1
);
11708 type2
= TYPE_MAIN_VARIANT (type2
);
11709 if (type1
== type2
)
11712 #ifndef ENABLE_CHECKING
11717 /* Check for anonymous namespaces. Those have !TREE_PUBLIC
11718 on the corresponding TYPE_STUB_DECL. */
11719 if (type_in_anonymous_namespace_p (type1
)
11720 || type_in_anonymous_namespace_p (type2
))
11722 /* When assembler name of virtual table is available, it is
11723 easy to compare types for equivalence. */
11724 if (TYPE_BINFO (type1
) && TYPE_BINFO (type2
)
11725 && BINFO_VTABLE (TYPE_BINFO (type1
))
11726 && BINFO_VTABLE (TYPE_BINFO (type2
)))
11728 tree v1
= BINFO_VTABLE (TYPE_BINFO (type1
));
11729 tree v2
= BINFO_VTABLE (TYPE_BINFO (type2
));
11731 if (TREE_CODE (v1
) == POINTER_PLUS_EXPR
)
11733 if (TREE_CODE (v2
) != POINTER_PLUS_EXPR
11734 || !operand_equal_p (TREE_OPERAND (v1
, 1),
11735 TREE_OPERAND (v2
, 1), 0))
11737 v1
= TREE_OPERAND (TREE_OPERAND (v1
, 0), 0);
11738 v2
= TREE_OPERAND (TREE_OPERAND (v2
, 0), 0);
11740 v1
= DECL_ASSEMBLER_NAME (v1
);
11741 v2
= DECL_ASSEMBLER_NAME (v2
);
11745 /* FIXME: the code comparing type names consider all instantiations of the
11746 same template to have same name. This is because we have no access
11747 to template parameters. For types with no virtual method tables
11748 we thus can return false positives. At the moment we do not need
11749 to compare types in other scenarios than devirtualization. */
11751 /* If types are not structuraly same, do not bother to contnue.
11752 Match in the remainder of code would mean ODR violation. */
11753 if (!types_compatible_p (type1
, type2
))
11755 if (!TYPE_NAME (type1
))
11757 if (!decls_same_for_odr (TYPE_NAME (type1
), TYPE_NAME (type2
)))
11759 if (!same_for_odr (TYPE_CONTEXT (type1
), TYPE_CONTEXT (type2
)))
11761 /* When not in LTO the MAIN_VARIANT check should be the same. */
11762 gcc_assert (in_lto_p
);
11767 /* TARGET is a call target of GIMPLE call statement
11768 (obtained by gimple_call_fn). Return true if it is
11769 OBJ_TYPE_REF representing an virtual call of C++ method.
11770 (As opposed to OBJ_TYPE_REF representing objc calls
11771 through a cast where middle-end devirtualization machinery
11775 virtual_method_call_p (tree target
)
11777 if (TREE_CODE (target
) != OBJ_TYPE_REF
)
11779 target
= TREE_TYPE (target
);
11780 gcc_checking_assert (TREE_CODE (target
) == POINTER_TYPE
);
11781 target
= TREE_TYPE (target
);
11782 if (TREE_CODE (target
) == FUNCTION_TYPE
)
11784 gcc_checking_assert (TREE_CODE (target
) == METHOD_TYPE
);
11788 /* REF is OBJ_TYPE_REF, return the class the ref corresponds to. */
11791 obj_type_ref_class (tree ref
)
11793 gcc_checking_assert (TREE_CODE (ref
) == OBJ_TYPE_REF
);
11794 ref
= TREE_TYPE (ref
);
11795 gcc_checking_assert (TREE_CODE (ref
) == POINTER_TYPE
);
11796 ref
= TREE_TYPE (ref
);
11797 /* We look for type THIS points to. ObjC also builds
11798 OBJ_TYPE_REF with non-method calls, Their first parameter
11799 ID however also corresponds to class type. */
11800 gcc_checking_assert (TREE_CODE (ref
) == METHOD_TYPE
11801 || TREE_CODE (ref
) == FUNCTION_TYPE
);
11802 ref
= TREE_VALUE (TYPE_ARG_TYPES (ref
));
11803 gcc_checking_assert (TREE_CODE (ref
) == POINTER_TYPE
);
11804 return TREE_TYPE (ref
);
11807 /* Return true if T is in anonymous namespace. */
11810 type_in_anonymous_namespace_p (tree t
)
11812 return (TYPE_STUB_DECL (t
) && !TREE_PUBLIC (TYPE_STUB_DECL (t
)));
11815 /* Try to find a base info of BINFO that would have its field decl at offset
11816 OFFSET within the BINFO type and which is of EXPECTED_TYPE. If it can be
11817 found, return, otherwise return NULL_TREE. */
11820 get_binfo_at_offset (tree binfo
, HOST_WIDE_INT offset
, tree expected_type
)
11822 tree type
= BINFO_TYPE (binfo
);
11826 HOST_WIDE_INT pos
, size
;
11830 if (types_same_for_odr (type
, expected_type
))
11835 for (fld
= TYPE_FIELDS (type
); fld
; fld
= DECL_CHAIN (fld
))
11837 if (TREE_CODE (fld
) != FIELD_DECL
)
11840 pos
= int_bit_position (fld
);
11841 size
= tree_to_uhwi (DECL_SIZE (fld
));
11842 if (pos
<= offset
&& (pos
+ size
) > offset
)
11845 if (!fld
|| TREE_CODE (TREE_TYPE (fld
)) != RECORD_TYPE
)
11848 if (!DECL_ARTIFICIAL (fld
))
11850 binfo
= TYPE_BINFO (TREE_TYPE (fld
));
11854 /* Offset 0 indicates the primary base, whose vtable contents are
11855 represented in the binfo for the derived class. */
11856 else if (offset
!= 0)
11858 tree base_binfo
, binfo2
= binfo
;
11860 /* Find BINFO corresponding to FLD. This is bit harder
11861 by a fact that in virtual inheritance we may need to walk down
11862 the non-virtual inheritance chain. */
11865 tree containing_binfo
= NULL
, found_binfo
= NULL
;
11866 for (i
= 0; BINFO_BASE_ITERATE (binfo2
, i
, base_binfo
); i
++)
11867 if (types_same_for_odr (TREE_TYPE (base_binfo
), TREE_TYPE (fld
)))
11869 found_binfo
= base_binfo
;
11873 if ((tree_to_shwi (BINFO_OFFSET (base_binfo
))
11874 - tree_to_shwi (BINFO_OFFSET (binfo
)))
11875 * BITS_PER_UNIT
< pos
11876 /* Rule out types with no virtual methods or we can get confused
11877 here by zero sized bases. */
11878 && BINFO_VTABLE (TYPE_BINFO (BINFO_TYPE (base_binfo
)))
11879 && (!containing_binfo
11880 || (tree_to_shwi (BINFO_OFFSET (containing_binfo
))
11881 < tree_to_shwi (BINFO_OFFSET (base_binfo
)))))
11882 containing_binfo
= base_binfo
;
11885 binfo
= found_binfo
;
11888 if (!containing_binfo
)
11890 binfo2
= containing_binfo
;
11894 type
= TREE_TYPE (fld
);
11899 /* Returns true if X is a typedef decl. */
11902 is_typedef_decl (tree x
)
11904 return (x
&& TREE_CODE (x
) == TYPE_DECL
11905 && DECL_ORIGINAL_TYPE (x
) != NULL_TREE
);
11908 /* Returns true iff TYPE is a type variant created for a typedef. */
11911 typedef_variant_p (tree type
)
11913 return is_typedef_decl (TYPE_NAME (type
));
11916 /* Warn about a use of an identifier which was marked deprecated. */
11918 warn_deprecated_use (tree node
, tree attr
)
11922 if (node
== 0 || !warn_deprecated_decl
)
11928 attr
= DECL_ATTRIBUTES (node
);
11929 else if (TYPE_P (node
))
11931 tree decl
= TYPE_STUB_DECL (node
);
11933 attr
= lookup_attribute ("deprecated",
11934 TYPE_ATTRIBUTES (TREE_TYPE (decl
)));
11939 attr
= lookup_attribute ("deprecated", attr
);
11942 msg
= TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr
)));
11948 expanded_location xloc
= expand_location (DECL_SOURCE_LOCATION (node
));
11950 warning (OPT_Wdeprecated_declarations
,
11951 "%qD is deprecated (declared at %r%s:%d%R): %s",
11952 node
, "locus", xloc
.file
, xloc
.line
, msg
);
11954 warning (OPT_Wdeprecated_declarations
,
11955 "%qD is deprecated (declared at %r%s:%d%R)",
11956 node
, "locus", xloc
.file
, xloc
.line
);
11958 else if (TYPE_P (node
))
11960 tree what
= NULL_TREE
;
11961 tree decl
= TYPE_STUB_DECL (node
);
11963 if (TYPE_NAME (node
))
11965 if (TREE_CODE (TYPE_NAME (node
)) == IDENTIFIER_NODE
)
11966 what
= TYPE_NAME (node
);
11967 else if (TREE_CODE (TYPE_NAME (node
)) == TYPE_DECL
11968 && DECL_NAME (TYPE_NAME (node
)))
11969 what
= DECL_NAME (TYPE_NAME (node
));
11974 expanded_location xloc
11975 = expand_location (DECL_SOURCE_LOCATION (decl
));
11979 warning (OPT_Wdeprecated_declarations
,
11980 "%qE is deprecated (declared at %r%s:%d%R): %s",
11981 what
, "locus", xloc
.file
, xloc
.line
, msg
);
11983 warning (OPT_Wdeprecated_declarations
,
11984 "%qE is deprecated (declared at %r%s:%d%R)",
11985 what
, "locus", xloc
.file
, xloc
.line
);
11990 warning (OPT_Wdeprecated_declarations
,
11991 "type is deprecated (declared at %r%s:%d%R): %s",
11992 "locus", xloc
.file
, xloc
.line
, msg
);
11994 warning (OPT_Wdeprecated_declarations
,
11995 "type is deprecated (declared at %r%s:%d%R)",
11996 "locus", xloc
.file
, xloc
.line
);
12004 warning (OPT_Wdeprecated_declarations
, "%qE is deprecated: %s",
12007 warning (OPT_Wdeprecated_declarations
, "%qE is deprecated", what
);
12012 warning (OPT_Wdeprecated_declarations
, "type is deprecated: %s",
12015 warning (OPT_Wdeprecated_declarations
, "type is deprecated");
12021 /* Return true if REF has a COMPONENT_REF with a bit-field field declaration
12022 somewhere in it. */
12025 contains_bitfld_component_ref_p (const_tree ref
)
12027 while (handled_component_p (ref
))
12029 if (TREE_CODE (ref
) == COMPONENT_REF
12030 && DECL_BIT_FIELD (TREE_OPERAND (ref
, 1)))
12032 ref
= TREE_OPERAND (ref
, 0);
12038 /* Try to determine whether a TRY_CATCH expression can fall through.
12039 This is a subroutine of block_may_fallthru. */
12042 try_catch_may_fallthru (const_tree stmt
)
12044 tree_stmt_iterator i
;
12046 /* If the TRY block can fall through, the whole TRY_CATCH can
12048 if (block_may_fallthru (TREE_OPERAND (stmt
, 0)))
12051 i
= tsi_start (TREE_OPERAND (stmt
, 1));
12052 switch (TREE_CODE (tsi_stmt (i
)))
12055 /* We expect to see a sequence of CATCH_EXPR trees, each with a
12056 catch expression and a body. The whole TRY_CATCH may fall
12057 through iff any of the catch bodies falls through. */
12058 for (; !tsi_end_p (i
); tsi_next (&i
))
12060 if (block_may_fallthru (CATCH_BODY (tsi_stmt (i
))))
12065 case EH_FILTER_EXPR
:
12066 /* The exception filter expression only matters if there is an
12067 exception. If the exception does not match EH_FILTER_TYPES,
12068 we will execute EH_FILTER_FAILURE, and we will fall through
12069 if that falls through. If the exception does match
12070 EH_FILTER_TYPES, the stack unwinder will continue up the
12071 stack, so we will not fall through. We don't know whether we
12072 will throw an exception which matches EH_FILTER_TYPES or not,
12073 so we just ignore EH_FILTER_TYPES and assume that we might
12074 throw an exception which doesn't match. */
12075 return block_may_fallthru (EH_FILTER_FAILURE (tsi_stmt (i
)));
12078 /* This case represents statements to be executed when an
12079 exception occurs. Those statements are implicitly followed
12080 by a RESX statement to resume execution after the exception.
12081 So in this case the TRY_CATCH never falls through. */
12086 /* Try to determine if we can fall out of the bottom of BLOCK. This guess
12087 need not be 100% accurate; simply be conservative and return true if we
12088 don't know. This is used only to avoid stupidly generating extra code.
12089 If we're wrong, we'll just delete the extra code later. */
12092 block_may_fallthru (const_tree block
)
12094 /* This CONST_CAST is okay because expr_last returns its argument
12095 unmodified and we assign it to a const_tree. */
12096 const_tree stmt
= expr_last (CONST_CAST_TREE (block
));
12098 switch (stmt
? TREE_CODE (stmt
) : ERROR_MARK
)
12102 /* Easy cases. If the last statement of the block implies
12103 control transfer, then we can't fall through. */
12107 /* If SWITCH_LABELS is set, this is lowered, and represents a
12108 branch to a selected label and hence can not fall through.
12109 Otherwise SWITCH_BODY is set, and the switch can fall
12111 return SWITCH_LABELS (stmt
) == NULL_TREE
;
12114 if (block_may_fallthru (COND_EXPR_THEN (stmt
)))
12116 return block_may_fallthru (COND_EXPR_ELSE (stmt
));
12119 return block_may_fallthru (BIND_EXPR_BODY (stmt
));
12121 case TRY_CATCH_EXPR
:
12122 return try_catch_may_fallthru (stmt
);
12124 case TRY_FINALLY_EXPR
:
12125 /* The finally clause is always executed after the try clause,
12126 so if it does not fall through, then the try-finally will not
12127 fall through. Otherwise, if the try clause does not fall
12128 through, then when the finally clause falls through it will
12129 resume execution wherever the try clause was going. So the
12130 whole try-finally will only fall through if both the try
12131 clause and the finally clause fall through. */
12132 return (block_may_fallthru (TREE_OPERAND (stmt
, 0))
12133 && block_may_fallthru (TREE_OPERAND (stmt
, 1)));
12136 if (TREE_CODE (TREE_OPERAND (stmt
, 1)) == CALL_EXPR
)
12137 stmt
= TREE_OPERAND (stmt
, 1);
12143 /* Functions that do not return do not fall through. */
12144 return (call_expr_flags (stmt
) & ECF_NORETURN
) == 0;
12146 case CLEANUP_POINT_EXPR
:
12147 return block_may_fallthru (TREE_OPERAND (stmt
, 0));
12150 return block_may_fallthru (TREE_OPERAND (stmt
, 1));
12156 return lang_hooks
.block_may_fallthru (stmt
);
12160 /* True if we are using EH to handle cleanups. */
12161 static bool using_eh_for_cleanups_flag
= false;
12163 /* This routine is called from front ends to indicate eh should be used for
12166 using_eh_for_cleanups (void)
12168 using_eh_for_cleanups_flag
= true;
12171 /* Query whether EH is used for cleanups. */
12173 using_eh_for_cleanups_p (void)
12175 return using_eh_for_cleanups_flag
;
12178 /* Wrapper for tree_code_name to ensure that tree code is valid */
12180 get_tree_code_name (enum tree_code code
)
12182 const char *invalid
= "<invalid tree code>";
12184 if (code
>= MAX_TREE_CODES
)
12187 return tree_code_name
[code
];
12190 /* Drops the TREE_OVERFLOW flag from T. */
12193 drop_tree_overflow (tree t
)
12195 gcc_checking_assert (TREE_OVERFLOW (t
));
12197 /* For tree codes with a sharing machinery re-build the result. */
12198 if (TREE_CODE (t
) == INTEGER_CST
)
12199 return wide_int_to_tree (TREE_TYPE (t
), t
);
12201 /* Otherwise, as all tcc_constants are possibly shared, copy the node
12202 and drop the flag. */
12204 TREE_OVERFLOW (t
) = 0;
12208 /* Given a memory reference expression T, return its base address.
12209 The base address of a memory reference expression is the main
12210 object being referenced. For instance, the base address for
12211 'array[i].fld[j]' is 'array'. You can think of this as stripping
12212 away the offset part from a memory address.
12214 This function calls handled_component_p to strip away all the inner
12215 parts of the memory reference until it reaches the base object. */
12218 get_base_address (tree t
)
12220 while (handled_component_p (t
))
12221 t
= TREE_OPERAND (t
, 0);
12223 if ((TREE_CODE (t
) == MEM_REF
12224 || TREE_CODE (t
) == TARGET_MEM_REF
)
12225 && TREE_CODE (TREE_OPERAND (t
, 0)) == ADDR_EXPR
)
12226 t
= TREE_OPERAND (TREE_OPERAND (t
, 0), 0);
12228 /* ??? Either the alias oracle or all callers need to properly deal
12229 with WITH_SIZE_EXPRs before we can look through those. */
12230 if (TREE_CODE (t
) == WITH_SIZE_EXPR
)
12236 #include "gt-tree.h"