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 2, /* 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 INTEGER_CST
: return TS_INT_CST
;
387 case REAL_CST
: return TS_REAL_CST
;
388 case FIXED_CST
: return TS_FIXED_CST
;
389 case COMPLEX_CST
: return TS_COMPLEX
;
390 case VECTOR_CST
: return TS_VECTOR
;
391 case STRING_CST
: return TS_STRING
;
392 /* tcc_exceptional cases. */
393 case ERROR_MARK
: return TS_COMMON
;
394 case IDENTIFIER_NODE
: return TS_IDENTIFIER
;
395 case TREE_LIST
: return TS_LIST
;
396 case TREE_VEC
: return TS_VEC
;
397 case SSA_NAME
: return TS_SSA_NAME
;
398 case PLACEHOLDER_EXPR
: return TS_COMMON
;
399 case STATEMENT_LIST
: return TS_STATEMENT_LIST
;
400 case BLOCK
: return TS_BLOCK
;
401 case CONSTRUCTOR
: return TS_CONSTRUCTOR
;
402 case TREE_BINFO
: return TS_BINFO
;
403 case OMP_CLAUSE
: return TS_OMP_CLAUSE
;
404 case OPTIMIZATION_NODE
: return TS_OPTIMIZATION
;
405 case TARGET_OPTION_NODE
: return TS_TARGET_OPTION
;
413 /* Initialize tree_contains_struct to describe the hierarchy of tree
417 initialize_tree_contains_struct (void)
421 for (i
= ERROR_MARK
; i
< LAST_AND_UNUSED_TREE_CODE
; i
++)
424 enum tree_node_structure_enum ts_code
;
426 code
= (enum tree_code
) i
;
427 ts_code
= tree_node_structure_for_code (code
);
429 /* Mark the TS structure itself. */
430 tree_contains_struct
[code
][ts_code
] = 1;
432 /* Mark all the structures that TS is derived from. */
450 case TS_STATEMENT_LIST
:
451 MARK_TS_TYPED (code
);
455 case TS_DECL_MINIMAL
:
461 case TS_OPTIMIZATION
:
462 case TS_TARGET_OPTION
:
463 MARK_TS_COMMON (code
);
466 case TS_TYPE_WITH_LANG_SPECIFIC
:
467 MARK_TS_TYPE_COMMON (code
);
470 case TS_TYPE_NON_COMMON
:
471 MARK_TS_TYPE_WITH_LANG_SPECIFIC (code
);
475 MARK_TS_DECL_MINIMAL (code
);
480 MARK_TS_DECL_COMMON (code
);
483 case TS_DECL_NON_COMMON
:
484 MARK_TS_DECL_WITH_VIS (code
);
487 case TS_DECL_WITH_VIS
:
491 MARK_TS_DECL_WRTL (code
);
495 MARK_TS_DECL_COMMON (code
);
499 MARK_TS_DECL_WITH_VIS (code
);
503 case TS_FUNCTION_DECL
:
504 MARK_TS_DECL_NON_COMMON (code
);
507 case TS_TRANSLATION_UNIT_DECL
:
508 MARK_TS_DECL_COMMON (code
);
516 /* Basic consistency checks for attributes used in fold. */
517 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_NON_COMMON
]);
518 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_NON_COMMON
]);
519 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_DECL_COMMON
]);
520 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_COMMON
]);
521 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_COMMON
]);
522 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_COMMON
]);
523 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_COMMON
]);
524 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_COMMON
]);
525 gcc_assert (tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_COMMON
]);
526 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_COMMON
]);
527 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_DECL_COMMON
]);
528 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_WRTL
]);
529 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_WRTL
]);
530 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_WRTL
]);
531 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WRTL
]);
532 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_WRTL
]);
533 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_DECL_MINIMAL
]);
534 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_MINIMAL
]);
535 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_MINIMAL
]);
536 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_MINIMAL
]);
537 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_MINIMAL
]);
538 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_MINIMAL
]);
539 gcc_assert (tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_MINIMAL
]);
540 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_MINIMAL
]);
541 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_DECL_MINIMAL
]);
542 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_WITH_VIS
]);
543 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WITH_VIS
]);
544 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_WITH_VIS
]);
545 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_VAR_DECL
]);
546 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_FIELD_DECL
]);
547 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_PARM_DECL
]);
548 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_LABEL_DECL
]);
549 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_RESULT_DECL
]);
550 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_CONST_DECL
]);
551 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_TYPE_DECL
]);
552 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_FUNCTION_DECL
]);
553 gcc_assert (tree_contains_struct
[IMPORTED_DECL
][TS_DECL_MINIMAL
]);
554 gcc_assert (tree_contains_struct
[IMPORTED_DECL
][TS_DECL_COMMON
]);
555 gcc_assert (tree_contains_struct
[NAMELIST_DECL
][TS_DECL_MINIMAL
]);
556 gcc_assert (tree_contains_struct
[NAMELIST_DECL
][TS_DECL_COMMON
]);
565 /* Initialize the hash table of types. */
566 type_hash_table
= htab_create_ggc (TYPE_HASH_INITIAL_SIZE
, type_hash_hash
,
569 debug_expr_for_decl
= htab_create_ggc (512, tree_decl_map_hash
,
570 tree_decl_map_eq
, 0);
572 value_expr_for_decl
= htab_create_ggc (512, tree_decl_map_hash
,
573 tree_decl_map_eq
, 0);
574 init_priority_for_decl
= htab_create_ggc (512, tree_priority_map_hash
,
575 tree_priority_map_eq
, 0);
577 int_cst_hash_table
= htab_create_ggc (1024, int_cst_hash_hash
,
578 int_cst_hash_eq
, NULL
);
580 int_cst_node
= make_int_cst (1, 1);
582 cl_option_hash_table
= htab_create_ggc (64, cl_option_hash_hash
,
583 cl_option_hash_eq
, NULL
);
585 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
586 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
588 /* Initialize the tree_contains_struct array. */
589 initialize_tree_contains_struct ();
590 lang_hooks
.init_ts ();
594 /* The name of the object as the assembler will see it (but before any
595 translations made by ASM_OUTPUT_LABELREF). Often this is the same
596 as DECL_NAME. It is an IDENTIFIER_NODE. */
598 decl_assembler_name (tree decl
)
600 if (!DECL_ASSEMBLER_NAME_SET_P (decl
))
601 lang_hooks
.set_decl_assembler_name (decl
);
602 return DECL_WITH_VIS_CHECK (decl
)->decl_with_vis
.assembler_name
;
605 /* Compute the number of bytes occupied by a tree with code CODE.
606 This function cannot be used for nodes that have variable sizes,
607 including TREE_VEC, INTEGER_CST, STRING_CST, and CALL_EXPR. */
609 tree_code_size (enum tree_code code
)
611 switch (TREE_CODE_CLASS (code
))
613 case tcc_declaration
: /* A decl node */
618 return sizeof (struct tree_field_decl
);
620 return sizeof (struct tree_parm_decl
);
622 return sizeof (struct tree_var_decl
);
624 return sizeof (struct tree_label_decl
);
626 return sizeof (struct tree_result_decl
);
628 return sizeof (struct tree_const_decl
);
630 return sizeof (struct tree_type_decl
);
632 return sizeof (struct tree_function_decl
);
633 case DEBUG_EXPR_DECL
:
634 return sizeof (struct tree_decl_with_rtl
);
636 return sizeof (struct tree_decl_non_common
);
640 case tcc_type
: /* a type node */
641 return sizeof (struct tree_type_non_common
);
643 case tcc_reference
: /* a reference */
644 case tcc_expression
: /* an expression */
645 case tcc_statement
: /* an expression with side effects */
646 case tcc_comparison
: /* a comparison expression */
647 case tcc_unary
: /* a unary arithmetic expression */
648 case tcc_binary
: /* a binary arithmetic expression */
649 return (sizeof (struct tree_exp
)
650 + (TREE_CODE_LENGTH (code
) - 1) * sizeof (tree
));
652 case tcc_constant
: /* a constant */
655 case INTEGER_CST
: gcc_unreachable ();
656 case REAL_CST
: return sizeof (struct tree_real_cst
);
657 case FIXED_CST
: return sizeof (struct tree_fixed_cst
);
658 case COMPLEX_CST
: return sizeof (struct tree_complex
);
659 case VECTOR_CST
: return sizeof (struct tree_vector
);
660 case STRING_CST
: gcc_unreachable ();
662 return lang_hooks
.tree_size (code
);
665 case tcc_exceptional
: /* something random, like an identifier. */
668 case IDENTIFIER_NODE
: return lang_hooks
.identifier_size
;
669 case TREE_LIST
: return sizeof (struct tree_list
);
672 case PLACEHOLDER_EXPR
: return sizeof (struct tree_common
);
675 case OMP_CLAUSE
: gcc_unreachable ();
677 case SSA_NAME
: return sizeof (struct tree_ssa_name
);
679 case STATEMENT_LIST
: return sizeof (struct tree_statement_list
);
680 case BLOCK
: return sizeof (struct tree_block
);
681 case CONSTRUCTOR
: return sizeof (struct tree_constructor
);
682 case OPTIMIZATION_NODE
: return sizeof (struct tree_optimization_option
);
683 case TARGET_OPTION_NODE
: return sizeof (struct tree_target_option
);
686 return lang_hooks
.tree_size (code
);
694 /* Compute the number of bytes occupied by NODE. This routine only
695 looks at TREE_CODE, except for those nodes that have variable sizes. */
697 tree_size (const_tree node
)
699 const enum tree_code code
= TREE_CODE (node
);
703 return (sizeof (struct tree_int_cst
)
704 + (TREE_INT_CST_EXT_NUNITS (node
) - 1) * sizeof (HOST_WIDE_INT
));
707 return (offsetof (struct tree_binfo
, base_binfos
)
709 ::embedded_size (BINFO_N_BASE_BINFOS (node
)));
712 return (sizeof (struct tree_vec
)
713 + (TREE_VEC_LENGTH (node
) - 1) * sizeof (tree
));
716 return (sizeof (struct tree_vector
)
717 + (TYPE_VECTOR_SUBPARTS (TREE_TYPE (node
)) - 1) * sizeof (tree
));
720 return TREE_STRING_LENGTH (node
) + offsetof (struct tree_string
, str
) + 1;
723 return (sizeof (struct tree_omp_clause
)
724 + (omp_clause_num_ops
[OMP_CLAUSE_CODE (node
)] - 1)
728 if (TREE_CODE_CLASS (code
) == tcc_vl_exp
)
729 return (sizeof (struct tree_exp
)
730 + (VL_EXP_OPERAND_LENGTH (node
) - 1) * sizeof (tree
));
732 return tree_code_size (code
);
736 /* Record interesting allocation statistics for a tree node with CODE
740 record_node_allocation_statistics (enum tree_code code ATTRIBUTE_UNUSED
,
741 size_t length ATTRIBUTE_UNUSED
)
743 enum tree_code_class type
= TREE_CODE_CLASS (code
);
746 if (!GATHER_STATISTICS
)
751 case tcc_declaration
: /* A decl node */
755 case tcc_type
: /* a type node */
759 case tcc_statement
: /* an expression with side effects */
763 case tcc_reference
: /* a reference */
767 case tcc_expression
: /* an expression */
768 case tcc_comparison
: /* a comparison expression */
769 case tcc_unary
: /* a unary arithmetic expression */
770 case tcc_binary
: /* a binary arithmetic expression */
774 case tcc_constant
: /* a constant */
778 case tcc_exceptional
: /* something random, like an identifier. */
781 case IDENTIFIER_NODE
:
794 kind
= ssa_name_kind
;
806 kind
= omp_clause_kind
;
823 tree_code_counts
[(int) code
]++;
824 tree_node_counts
[(int) kind
]++;
825 tree_node_sizes
[(int) kind
] += length
;
828 /* Allocate and return a new UID from the DECL_UID namespace. */
831 allocate_decl_uid (void)
833 return next_decl_uid
++;
836 /* Return a newly allocated node of code CODE. For decl and type
837 nodes, some other fields are initialized. The rest of the node is
838 initialized to zero. This function cannot be used for TREE_VEC,
839 INTEGER_CST or OMP_CLAUSE nodes, which is enforced by asserts in
842 Achoo! I got a code in the node. */
845 make_node_stat (enum tree_code code MEM_STAT_DECL
)
848 enum tree_code_class type
= TREE_CODE_CLASS (code
);
849 size_t length
= tree_code_size (code
);
851 record_node_allocation_statistics (code
, length
);
853 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
854 TREE_SET_CODE (t
, code
);
859 TREE_SIDE_EFFECTS (t
) = 1;
862 case tcc_declaration
:
863 if (CODE_CONTAINS_STRUCT (code
, TS_DECL_COMMON
))
865 if (code
== FUNCTION_DECL
)
867 DECL_ALIGN (t
) = FUNCTION_BOUNDARY
;
868 DECL_MODE (t
) = FUNCTION_MODE
;
873 DECL_SOURCE_LOCATION (t
) = input_location
;
874 if (TREE_CODE (t
) == DEBUG_EXPR_DECL
)
875 DECL_UID (t
) = --next_debug_decl_uid
;
878 DECL_UID (t
) = allocate_decl_uid ();
879 SET_DECL_PT_UID (t
, -1);
881 if (TREE_CODE (t
) == LABEL_DECL
)
882 LABEL_DECL_UID (t
) = -1;
887 TYPE_UID (t
) = next_type_uid
++;
888 TYPE_ALIGN (t
) = BITS_PER_UNIT
;
889 TYPE_USER_ALIGN (t
) = 0;
890 TYPE_MAIN_VARIANT (t
) = t
;
891 TYPE_CANONICAL (t
) = t
;
893 /* Default to no attributes for type, but let target change that. */
894 TYPE_ATTRIBUTES (t
) = NULL_TREE
;
895 targetm
.set_default_type_attributes (t
);
897 /* We have not yet computed the alias set for this type. */
898 TYPE_ALIAS_SET (t
) = -1;
902 TREE_CONSTANT (t
) = 1;
911 case PREDECREMENT_EXPR
:
912 case PREINCREMENT_EXPR
:
913 case POSTDECREMENT_EXPR
:
914 case POSTINCREMENT_EXPR
:
915 /* All of these have side-effects, no matter what their
917 TREE_SIDE_EFFECTS (t
) = 1;
926 /* Other classes need no special treatment. */
933 /* Return a new node with the same contents as NODE except that its
934 TREE_CHAIN, if it has one, is zero and it has a fresh uid. */
937 copy_node_stat (tree node MEM_STAT_DECL
)
940 enum tree_code code
= TREE_CODE (node
);
943 gcc_assert (code
!= STATEMENT_LIST
);
945 length
= tree_size (node
);
946 record_node_allocation_statistics (code
, length
);
947 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
948 memcpy (t
, node
, length
);
950 if (CODE_CONTAINS_STRUCT (code
, TS_COMMON
))
952 TREE_ASM_WRITTEN (t
) = 0;
953 TREE_VISITED (t
) = 0;
955 if (TREE_CODE_CLASS (code
) == tcc_declaration
)
957 if (code
== DEBUG_EXPR_DECL
)
958 DECL_UID (t
) = --next_debug_decl_uid
;
961 DECL_UID (t
) = allocate_decl_uid ();
962 if (DECL_PT_UID_SET_P (node
))
963 SET_DECL_PT_UID (t
, DECL_PT_UID (node
));
965 if ((TREE_CODE (node
) == PARM_DECL
|| TREE_CODE (node
) == VAR_DECL
)
966 && DECL_HAS_VALUE_EXPR_P (node
))
968 SET_DECL_VALUE_EXPR (t
, DECL_VALUE_EXPR (node
));
969 DECL_HAS_VALUE_EXPR_P (t
) = 1;
971 /* DECL_DEBUG_EXPR is copied explicitely by callers. */
972 if (TREE_CODE (node
) == VAR_DECL
)
973 DECL_HAS_DEBUG_EXPR_P (t
) = 0;
974 if (TREE_CODE (node
) == VAR_DECL
&& DECL_HAS_INIT_PRIORITY_P (node
))
976 SET_DECL_INIT_PRIORITY (t
, DECL_INIT_PRIORITY (node
));
977 DECL_HAS_INIT_PRIORITY_P (t
) = 1;
979 if (TREE_CODE (node
) == FUNCTION_DECL
)
980 DECL_STRUCT_FUNCTION (t
) = NULL
;
982 else if (TREE_CODE_CLASS (code
) == tcc_type
)
984 TYPE_UID (t
) = next_type_uid
++;
985 /* The following is so that the debug code for
986 the copy is different from the original type.
987 The two statements usually duplicate each other
988 (because they clear fields of the same union),
989 but the optimizer should catch that. */
990 TYPE_SYMTAB_POINTER (t
) = 0;
991 TYPE_SYMTAB_ADDRESS (t
) = 0;
993 /* Do not copy the values cache. */
994 if (TYPE_CACHED_VALUES_P (t
))
996 TYPE_CACHED_VALUES_P (t
) = 0;
997 TYPE_CACHED_VALUES (t
) = NULL_TREE
;
1004 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
1005 For example, this can copy a list made of TREE_LIST nodes. */
1008 copy_list (tree list
)
1016 head
= prev
= copy_node (list
);
1017 next
= TREE_CHAIN (list
);
1020 TREE_CHAIN (prev
) = copy_node (next
);
1021 prev
= TREE_CHAIN (prev
);
1022 next
= TREE_CHAIN (next
);
1028 /* Return the value that TREE_INT_CST_EXT_NUNITS should have for an
1029 INTEGER_CST with value CST and type TYPE. */
1032 get_int_cst_ext_nunits (tree type
, const wide_int
&cst
)
1034 gcc_checking_assert (cst
.get_precision () == TYPE_PRECISION (type
));
1035 /* We need an extra zero HWI if CST is an unsigned integer with its
1036 upper bit set, and if CST occupies a whole number of HWIs. */
1037 if (TYPE_UNSIGNED (type
)
1039 && (cst
.get_precision () % HOST_BITS_PER_WIDE_INT
) == 0)
1040 return cst
.get_precision () / HOST_BITS_PER_WIDE_INT
+ 1;
1041 return cst
.get_len ();
1044 /* Return a new INTEGER_CST with value CST and type TYPE. */
1047 build_new_int_cst (tree type
, const wide_int
&cst
)
1049 unsigned int len
= cst
.get_len ();
1050 unsigned int ext_len
= get_int_cst_ext_nunits (type
, cst
);
1051 tree nt
= make_int_cst (len
, ext_len
);
1056 TREE_INT_CST_ELT (nt
, ext_len
) = 0;
1057 for (unsigned int i
= len
; i
< ext_len
; ++i
)
1058 TREE_INT_CST_ELT (nt
, i
) = -1;
1060 else if (TYPE_UNSIGNED (type
)
1061 && cst
.get_precision () < len
* HOST_BITS_PER_WIDE_INT
)
1064 TREE_INT_CST_ELT (nt
, len
)
1065 = zext_hwi (cst
.elt (len
),
1066 cst
.get_precision () % HOST_BITS_PER_WIDE_INT
);
1069 for (unsigned int i
= 0; i
< len
; i
++)
1070 TREE_INT_CST_ELT (nt
, i
) = cst
.elt (i
);
1071 TREE_TYPE (nt
) = type
;
1075 /* Create an INT_CST node with a LOW value sign extended to TYPE. */
1078 build_int_cst (tree type
, HOST_WIDE_INT low
)
1080 /* Support legacy code. */
1082 type
= integer_type_node
;
1084 return wide_int_to_tree (type
, wi::shwi (low
, TYPE_PRECISION (type
)));
1088 build_int_cstu (tree type
, unsigned HOST_WIDE_INT cst
)
1090 return wide_int_to_tree (type
, wi::uhwi (cst
, TYPE_PRECISION (type
)));
1093 /* Create an INT_CST node with a LOW value sign extended to TYPE. */
1096 build_int_cst_type (tree type
, HOST_WIDE_INT low
)
1099 return wide_int_to_tree (type
, wi::shwi (low
, TYPE_PRECISION (type
)));
1102 /* Constructs tree in type TYPE from with value given by CST. Signedness
1103 of CST is assumed to be the same as the signedness of TYPE. */
1106 double_int_to_tree (tree type
, double_int cst
)
1108 return wide_int_to_tree (type
, widest_int::from (cst
, TYPE_SIGN (type
)));
1111 /* We force the wide_int CST to the range of the type TYPE by sign or
1112 zero extending it. OVERFLOWABLE indicates if we are interested in
1113 overflow of the value, when >0 we are only interested in signed
1114 overflow, for <0 we are interested in any overflow. OVERFLOWED
1115 indicates whether overflow has already occurred. CONST_OVERFLOWED
1116 indicates whether constant overflow has already occurred. We force
1117 T's value to be within range of T's type (by setting to 0 or 1 all
1118 the bits outside the type's range). We set TREE_OVERFLOWED if,
1119 OVERFLOWED is nonzero,
1120 or OVERFLOWABLE is >0 and signed overflow occurs
1121 or OVERFLOWABLE is <0 and any overflow occurs
1122 We return a new tree node for the extended wide_int. The node
1123 is shared if no overflow flags are set. */
1127 force_fit_type (tree type
, const wide_int_ref
&cst
,
1128 int overflowable
, bool overflowed
)
1130 signop sign
= TYPE_SIGN (type
);
1132 /* If we need to set overflow flags, return a new unshared node. */
1133 if (overflowed
|| !wi::fits_to_tree_p (cst
, type
))
1137 || (overflowable
> 0 && sign
== SIGNED
))
1139 wide_int tmp
= wide_int::from (cst
, TYPE_PRECISION (type
), sign
);
1140 tree t
= build_new_int_cst (type
, tmp
);
1141 TREE_OVERFLOW (t
) = 1;
1146 /* Else build a shared node. */
1147 return wide_int_to_tree (type
, cst
);
1150 /* These are the hash table functions for the hash table of INTEGER_CST
1151 nodes of a sizetype. */
1153 /* Return the hash code code X, an INTEGER_CST. */
1156 int_cst_hash_hash (const void *x
)
1158 const_tree
const t
= (const_tree
) x
;
1159 hashval_t code
= htab_hash_pointer (TREE_TYPE (t
));
1162 for (i
= 0; i
< TREE_INT_CST_NUNITS (t
); i
++)
1163 code
^= TREE_INT_CST_ELT (t
, i
);
1168 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
1169 is the same as that given by *Y, which is the same. */
1172 int_cst_hash_eq (const void *x
, const void *y
)
1174 const_tree
const xt
= (const_tree
) x
;
1175 const_tree
const yt
= (const_tree
) y
;
1177 if (TREE_TYPE (xt
) != TREE_TYPE (yt
)
1178 || TREE_INT_CST_NUNITS (xt
) != TREE_INT_CST_NUNITS (yt
)
1179 || TREE_INT_CST_EXT_NUNITS (xt
) != TREE_INT_CST_EXT_NUNITS (yt
))
1182 for (int i
= 0; i
< TREE_INT_CST_NUNITS (xt
); i
++)
1183 if (TREE_INT_CST_ELT (xt
, i
) != TREE_INT_CST_ELT (yt
, i
))
1189 /* Create an INT_CST node of TYPE and value CST.
1190 The returned node is always shared. For small integers we use a
1191 per-type vector cache, for larger ones we use a single hash table.
1192 The value is extended from its precision according to the sign of
1193 the type to be a multiple of HOST_BITS_PER_WIDE_INT. This defines
1194 the upper bits and ensures that hashing and value equality based
1195 upon the underlying HOST_WIDE_INTs works without masking. */
1198 wide_int_to_tree (tree type
, const wide_int_ref
&pcst
)
1205 unsigned int prec
= TYPE_PRECISION (type
);
1206 signop sgn
= TYPE_SIGN (type
);
1208 /* Verify that everything is canonical. */
1209 int l
= pcst
.get_len ();
1212 if (pcst
.elt (l
- 1) == 0)
1213 gcc_checking_assert (pcst
.elt (l
- 2) < 0);
1214 if (pcst
.elt (l
- 1) == (HOST_WIDE_INT
) -1)
1215 gcc_checking_assert (pcst
.elt (l
- 2) >= 0);
1218 wide_int cst
= wide_int::from (pcst
, prec
, sgn
);
1219 unsigned int ext_len
= get_int_cst_ext_nunits (type
, cst
);
1223 /* We just need to store a single HOST_WIDE_INT. */
1225 if (TYPE_UNSIGNED (type
))
1226 hwi
= cst
.to_uhwi ();
1228 hwi
= cst
.to_shwi ();
1230 switch (TREE_CODE (type
))
1233 gcc_assert (hwi
== 0);
1237 case REFERENCE_TYPE
:
1238 /* Cache NULL pointer. */
1247 /* Cache false or true. */
1255 if (TYPE_SIGN (type
) == UNSIGNED
)
1258 limit
= INTEGER_SHARE_LIMIT
;
1259 if (IN_RANGE (hwi
, 0, INTEGER_SHARE_LIMIT
- 1))
1264 /* Cache [-1, N). */
1265 limit
= INTEGER_SHARE_LIMIT
+ 1;
1266 if (IN_RANGE (hwi
, -1, INTEGER_SHARE_LIMIT
- 1))
1280 /* Look for it in the type's vector of small shared ints. */
1281 if (!TYPE_CACHED_VALUES_P (type
))
1283 TYPE_CACHED_VALUES_P (type
) = 1;
1284 TYPE_CACHED_VALUES (type
) = make_tree_vec (limit
);
1287 t
= TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
);
1289 /* Make sure no one is clobbering the shared constant. */
1290 gcc_checking_assert (TREE_TYPE (t
) == type
1291 && TREE_INT_CST_NUNITS (t
) == 1
1292 && TREE_INT_CST_OFFSET_NUNITS (t
) == 1
1293 && TREE_INT_CST_EXT_NUNITS (t
) == 1
1294 && TREE_INT_CST_ELT (t
, 0) == hwi
);
1297 /* Create a new shared int. */
1298 t
= build_new_int_cst (type
, cst
);
1299 TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) = t
;
1304 /* Use the cache of larger shared ints, using int_cst_node as
1308 TREE_INT_CST_ELT (int_cst_node
, 0) = hwi
;
1309 TREE_TYPE (int_cst_node
) = type
;
1311 slot
= htab_find_slot (int_cst_hash_table
, int_cst_node
, INSERT
);
1315 /* Insert this one into the hash table. */
1318 /* Make a new node for next time round. */
1319 int_cst_node
= make_int_cst (1, 1);
1325 /* The value either hashes properly or we drop it on the floor
1326 for the gc to take care of. There will not be enough of them
1330 tree nt
= build_new_int_cst (type
, cst
);
1331 slot
= htab_find_slot (int_cst_hash_table
, nt
, INSERT
);
1335 /* Insert this one into the hash table. */
1345 cache_integer_cst (tree t
)
1347 tree type
= TREE_TYPE (t
);
1350 int prec
= TYPE_PRECISION (type
);
1352 gcc_assert (!TREE_OVERFLOW (t
));
1354 switch (TREE_CODE (type
))
1357 gcc_assert (integer_zerop (t
));
1361 case REFERENCE_TYPE
:
1362 /* Cache NULL pointer. */
1363 if (integer_zerop (t
))
1371 /* Cache false or true. */
1373 if (wi::ltu_p (t
, 2))
1374 ix
= TREE_INT_CST_ELT (t
, 0);
1379 if (TYPE_UNSIGNED (type
))
1382 limit
= INTEGER_SHARE_LIMIT
;
1384 /* This is a little hokie, but if the prec is smaller than
1385 what is necessary to hold INTEGER_SHARE_LIMIT, then the
1386 obvious test will not get the correct answer. */
1387 if (prec
< HOST_BITS_PER_WIDE_INT
)
1389 if (tree_to_uhwi (t
) < (unsigned HOST_WIDE_INT
) INTEGER_SHARE_LIMIT
)
1390 ix
= tree_to_uhwi (t
);
1392 else if (wi::ltu_p (t
, INTEGER_SHARE_LIMIT
))
1393 ix
= tree_to_uhwi (t
);
1398 limit
= INTEGER_SHARE_LIMIT
+ 1;
1400 if (integer_minus_onep (t
))
1402 else if (!wi::neg_p (t
))
1404 if (prec
< HOST_BITS_PER_WIDE_INT
)
1406 if (tree_to_shwi (t
) < INTEGER_SHARE_LIMIT
)
1407 ix
= tree_to_shwi (t
) + 1;
1409 else if (wi::ltu_p (t
, INTEGER_SHARE_LIMIT
))
1410 ix
= tree_to_shwi (t
) + 1;
1424 /* Look for it in the type's vector of small shared ints. */
1425 if (!TYPE_CACHED_VALUES_P (type
))
1427 TYPE_CACHED_VALUES_P (type
) = 1;
1428 TYPE_CACHED_VALUES (type
) = make_tree_vec (limit
);
1431 gcc_assert (TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) == NULL_TREE
);
1432 TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) = t
;
1436 /* Use the cache of larger shared ints. */
1439 slot
= htab_find_slot (int_cst_hash_table
, t
, INSERT
);
1440 /* If there is already an entry for the number verify it's the
1443 gcc_assert (wi::eq_p (tree (*slot
), t
));
1445 /* Otherwise insert this one into the hash table. */
1451 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
1452 and the rest are zeros. */
1455 build_low_bits_mask (tree type
, unsigned bits
)
1457 gcc_assert (bits
<= TYPE_PRECISION (type
));
1459 return wide_int_to_tree (type
, wi::mask (bits
, false,
1460 TYPE_PRECISION (type
)));
1463 /* Checks that X is integer constant that can be expressed in (unsigned)
1464 HOST_WIDE_INT without loss of precision. */
1467 cst_and_fits_in_hwi (const_tree x
)
1469 if (TREE_CODE (x
) != INTEGER_CST
)
1472 if (TYPE_PRECISION (TREE_TYPE (x
)) > HOST_BITS_PER_WIDE_INT
)
1475 return TREE_INT_CST_NUNITS (x
) == 1;
1478 /* Build a newly constructed TREE_VEC node of length LEN. */
1481 make_vector_stat (unsigned len MEM_STAT_DECL
)
1484 unsigned length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vector
);
1486 record_node_allocation_statistics (VECTOR_CST
, length
);
1488 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
1490 TREE_SET_CODE (t
, VECTOR_CST
);
1491 TREE_CONSTANT (t
) = 1;
1496 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1497 are in a list pointed to by VALS. */
1500 build_vector_stat (tree type
, tree
*vals MEM_STAT_DECL
)
1504 tree v
= make_vector (TYPE_VECTOR_SUBPARTS (type
));
1505 TREE_TYPE (v
) = type
;
1507 /* Iterate through elements and check for overflow. */
1508 for (cnt
= 0; cnt
< TYPE_VECTOR_SUBPARTS (type
); ++cnt
)
1510 tree value
= vals
[cnt
];
1512 VECTOR_CST_ELT (v
, cnt
) = value
;
1514 /* Don't crash if we get an address constant. */
1515 if (!CONSTANT_CLASS_P (value
))
1518 over
|= TREE_OVERFLOW (value
);
1521 TREE_OVERFLOW (v
) = over
;
1525 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1526 are extracted from V, a vector of CONSTRUCTOR_ELT. */
1529 build_vector_from_ctor (tree type
, vec
<constructor_elt
, va_gc
> *v
)
1531 tree
*vec
= XALLOCAVEC (tree
, TYPE_VECTOR_SUBPARTS (type
));
1532 unsigned HOST_WIDE_INT idx
;
1535 FOR_EACH_CONSTRUCTOR_VALUE (v
, idx
, value
)
1537 for (; idx
< TYPE_VECTOR_SUBPARTS (type
); ++idx
)
1538 vec
[idx
] = build_zero_cst (TREE_TYPE (type
));
1540 return build_vector (type
, vec
);
1543 /* Build a vector of type VECTYPE where all the elements are SCs. */
1545 build_vector_from_val (tree vectype
, tree sc
)
1547 int i
, nunits
= TYPE_VECTOR_SUBPARTS (vectype
);
1549 if (sc
== error_mark_node
)
1552 /* Verify that the vector type is suitable for SC. Note that there
1553 is some inconsistency in the type-system with respect to restrict
1554 qualifications of pointers. Vector types always have a main-variant
1555 element type and the qualification is applied to the vector-type.
1556 So TREE_TYPE (vector-type) does not return a properly qualified
1557 vector element-type. */
1558 gcc_checking_assert (types_compatible_p (TYPE_MAIN_VARIANT (TREE_TYPE (sc
)),
1559 TREE_TYPE (vectype
)));
1561 if (CONSTANT_CLASS_P (sc
))
1563 tree
*v
= XALLOCAVEC (tree
, nunits
);
1564 for (i
= 0; i
< nunits
; ++i
)
1566 return build_vector (vectype
, v
);
1570 vec
<constructor_elt
, va_gc
> *v
;
1571 vec_alloc (v
, nunits
);
1572 for (i
= 0; i
< nunits
; ++i
)
1573 CONSTRUCTOR_APPEND_ELT (v
, NULL_TREE
, sc
);
1574 return build_constructor (vectype
, v
);
1578 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1579 are in the vec pointed to by VALS. */
1581 build_constructor (tree type
, vec
<constructor_elt
, va_gc
> *vals
)
1583 tree c
= make_node (CONSTRUCTOR
);
1585 constructor_elt
*elt
;
1586 bool constant_p
= true;
1587 bool side_effects_p
= false;
1589 TREE_TYPE (c
) = type
;
1590 CONSTRUCTOR_ELTS (c
) = vals
;
1592 FOR_EACH_VEC_SAFE_ELT (vals
, i
, elt
)
1594 /* Mostly ctors will have elts that don't have side-effects, so
1595 the usual case is to scan all the elements. Hence a single
1596 loop for both const and side effects, rather than one loop
1597 each (with early outs). */
1598 if (!TREE_CONSTANT (elt
->value
))
1600 if (TREE_SIDE_EFFECTS (elt
->value
))
1601 side_effects_p
= true;
1604 TREE_SIDE_EFFECTS (c
) = side_effects_p
;
1605 TREE_CONSTANT (c
) = constant_p
;
1610 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
1613 build_constructor_single (tree type
, tree index
, tree value
)
1615 vec
<constructor_elt
, va_gc
> *v
;
1616 constructor_elt elt
= {index
, value
};
1619 v
->quick_push (elt
);
1621 return build_constructor (type
, v
);
1625 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1626 are in a list pointed to by VALS. */
1628 build_constructor_from_list (tree type
, tree vals
)
1631 vec
<constructor_elt
, va_gc
> *v
= NULL
;
1635 vec_alloc (v
, list_length (vals
));
1636 for (t
= vals
; t
; t
= TREE_CHAIN (t
))
1637 CONSTRUCTOR_APPEND_ELT (v
, TREE_PURPOSE (t
), TREE_VALUE (t
));
1640 return build_constructor (type
, v
);
1643 /* Return a new CONSTRUCTOR node whose type is TYPE. NELTS is the number
1644 of elements, provided as index/value pairs. */
1647 build_constructor_va (tree type
, int nelts
, ...)
1649 vec
<constructor_elt
, va_gc
> *v
= NULL
;
1652 va_start (p
, nelts
);
1653 vec_alloc (v
, nelts
);
1656 tree index
= va_arg (p
, tree
);
1657 tree value
= va_arg (p
, tree
);
1658 CONSTRUCTOR_APPEND_ELT (v
, index
, value
);
1661 return build_constructor (type
, v
);
1664 /* Return a new FIXED_CST node whose type is TYPE and value is F. */
1667 build_fixed (tree type
, FIXED_VALUE_TYPE f
)
1670 FIXED_VALUE_TYPE
*fp
;
1672 v
= make_node (FIXED_CST
);
1673 fp
= ggc_alloc_fixed_value ();
1674 memcpy (fp
, &f
, sizeof (FIXED_VALUE_TYPE
));
1676 TREE_TYPE (v
) = type
;
1677 TREE_FIXED_CST_PTR (v
) = fp
;
1681 /* Return a new REAL_CST node whose type is TYPE and value is D. */
1684 build_real (tree type
, REAL_VALUE_TYPE d
)
1687 REAL_VALUE_TYPE
*dp
;
1690 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
1691 Consider doing it via real_convert now. */
1693 v
= make_node (REAL_CST
);
1694 dp
= ggc_alloc_real_value ();
1695 memcpy (dp
, &d
, sizeof (REAL_VALUE_TYPE
));
1697 TREE_TYPE (v
) = type
;
1698 TREE_REAL_CST_PTR (v
) = dp
;
1699 TREE_OVERFLOW (v
) = overflow
;
1703 /* Return a new REAL_CST node whose type is TYPE
1704 and whose value is the integer value of the INTEGER_CST node I. */
1707 real_value_from_int_cst (const_tree type
, const_tree i
)
1711 /* Clear all bits of the real value type so that we can later do
1712 bitwise comparisons to see if two values are the same. */
1713 memset (&d
, 0, sizeof d
);
1715 real_from_integer (&d
, type
? TYPE_MODE (type
) : VOIDmode
, i
,
1716 TYPE_SIGN (TREE_TYPE (i
)));
1720 /* Given a tree representing an integer constant I, return a tree
1721 representing the same value as a floating-point constant of type TYPE. */
1724 build_real_from_int_cst (tree type
, const_tree i
)
1727 int overflow
= TREE_OVERFLOW (i
);
1729 v
= build_real (type
, real_value_from_int_cst (type
, i
));
1731 TREE_OVERFLOW (v
) |= overflow
;
1735 /* Return a newly constructed STRING_CST node whose value is
1736 the LEN characters at STR.
1737 Note that for a C string literal, LEN should include the trailing NUL.
1738 The TREE_TYPE is not initialized. */
1741 build_string (int len
, const char *str
)
1746 /* Do not waste bytes provided by padding of struct tree_string. */
1747 length
= len
+ offsetof (struct tree_string
, str
) + 1;
1749 record_node_allocation_statistics (STRING_CST
, length
);
1751 s
= ggc_alloc_tree_node (length
);
1753 memset (s
, 0, sizeof (struct tree_typed
));
1754 TREE_SET_CODE (s
, STRING_CST
);
1755 TREE_CONSTANT (s
) = 1;
1756 TREE_STRING_LENGTH (s
) = len
;
1757 memcpy (s
->string
.str
, str
, len
);
1758 s
->string
.str
[len
] = '\0';
1763 /* Return a newly constructed COMPLEX_CST node whose value is
1764 specified by the real and imaginary parts REAL and IMAG.
1765 Both REAL and IMAG should be constant nodes. TYPE, if specified,
1766 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
1769 build_complex (tree type
, tree real
, tree imag
)
1771 tree t
= make_node (COMPLEX_CST
);
1773 TREE_REALPART (t
) = real
;
1774 TREE_IMAGPART (t
) = imag
;
1775 TREE_TYPE (t
) = type
? type
: build_complex_type (TREE_TYPE (real
));
1776 TREE_OVERFLOW (t
) = TREE_OVERFLOW (real
) | TREE_OVERFLOW (imag
);
1780 /* Return a constant of arithmetic type TYPE which is the
1781 multiplicative identity of the set TYPE. */
1784 build_one_cst (tree type
)
1786 switch (TREE_CODE (type
))
1788 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
1789 case POINTER_TYPE
: case REFERENCE_TYPE
:
1791 return build_int_cst (type
, 1);
1794 return build_real (type
, dconst1
);
1796 case FIXED_POINT_TYPE
:
1797 /* We can only generate 1 for accum types. */
1798 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type
)));
1799 return build_fixed (type
, FCONST1 (TYPE_MODE (type
)));
1803 tree scalar
= build_one_cst (TREE_TYPE (type
));
1805 return build_vector_from_val (type
, scalar
);
1809 return build_complex (type
,
1810 build_one_cst (TREE_TYPE (type
)),
1811 build_zero_cst (TREE_TYPE (type
)));
1818 /* Return an integer of type TYPE containing all 1's in as much precision as
1819 it contains, or a complex or vector whose subparts are such integers. */
1822 build_all_ones_cst (tree type
)
1824 if (TREE_CODE (type
) == COMPLEX_TYPE
)
1826 tree scalar
= build_all_ones_cst (TREE_TYPE (type
));
1827 return build_complex (type
, scalar
, scalar
);
1830 return build_minus_one_cst (type
);
1833 /* Return a constant of arithmetic type TYPE which is the
1834 opposite of the multiplicative identity of the set TYPE. */
1837 build_minus_one_cst (tree type
)
1839 switch (TREE_CODE (type
))
1841 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
1842 case POINTER_TYPE
: case REFERENCE_TYPE
:
1844 return build_int_cst (type
, -1);
1847 return build_real (type
, dconstm1
);
1849 case FIXED_POINT_TYPE
:
1850 /* We can only generate 1 for accum types. */
1851 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type
)));
1852 return build_fixed (type
, fixed_from_double_int (double_int_minus_one
,
1857 tree scalar
= build_minus_one_cst (TREE_TYPE (type
));
1859 return build_vector_from_val (type
, scalar
);
1863 return build_complex (type
,
1864 build_minus_one_cst (TREE_TYPE (type
)),
1865 build_zero_cst (TREE_TYPE (type
)));
1872 /* Build 0 constant of type TYPE. This is used by constructor folding
1873 and thus the constant should be represented in memory by
1877 build_zero_cst (tree type
)
1879 switch (TREE_CODE (type
))
1881 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
1882 case POINTER_TYPE
: case REFERENCE_TYPE
:
1883 case OFFSET_TYPE
: case NULLPTR_TYPE
:
1884 return build_int_cst (type
, 0);
1887 return build_real (type
, dconst0
);
1889 case FIXED_POINT_TYPE
:
1890 return build_fixed (type
, FCONST0 (TYPE_MODE (type
)));
1894 tree scalar
= build_zero_cst (TREE_TYPE (type
));
1896 return build_vector_from_val (type
, scalar
);
1901 tree zero
= build_zero_cst (TREE_TYPE (type
));
1903 return build_complex (type
, zero
, zero
);
1907 if (!AGGREGATE_TYPE_P (type
))
1908 return fold_convert (type
, integer_zero_node
);
1909 return build_constructor (type
, NULL
);
1914 /* Build a BINFO with LEN language slots. */
1917 make_tree_binfo_stat (unsigned base_binfos MEM_STAT_DECL
)
1920 size_t length
= (offsetof (struct tree_binfo
, base_binfos
)
1921 + vec
<tree
, va_gc
>::embedded_size (base_binfos
));
1923 record_node_allocation_statistics (TREE_BINFO
, length
);
1925 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
1927 memset (t
, 0, offsetof (struct tree_binfo
, base_binfos
));
1929 TREE_SET_CODE (t
, TREE_BINFO
);
1931 BINFO_BASE_BINFOS (t
)->embedded_init (base_binfos
);
1936 /* Create a CASE_LABEL_EXPR tree node and return it. */
1939 build_case_label (tree low_value
, tree high_value
, tree label_decl
)
1941 tree t
= make_node (CASE_LABEL_EXPR
);
1943 TREE_TYPE (t
) = void_type_node
;
1944 SET_EXPR_LOCATION (t
, DECL_SOURCE_LOCATION (label_decl
));
1946 CASE_LOW (t
) = low_value
;
1947 CASE_HIGH (t
) = high_value
;
1948 CASE_LABEL (t
) = label_decl
;
1949 CASE_CHAIN (t
) = NULL_TREE
;
1954 /* Build a newly constructed INTEGER_CST node. LEN and EXT_LEN are the
1955 values of TREE_INT_CST_NUNITS and TREE_INT_CST_EXT_NUNITS respectively.
1956 The latter determines the length of the HOST_WIDE_INT vector. */
1959 make_int_cst_stat (int len
, int ext_len MEM_STAT_DECL
)
1962 int length
= ((ext_len
- 1) * sizeof (HOST_WIDE_INT
)
1963 + sizeof (struct tree_int_cst
));
1966 record_node_allocation_statistics (INTEGER_CST
, length
);
1968 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
1970 TREE_SET_CODE (t
, INTEGER_CST
);
1971 TREE_INT_CST_NUNITS (t
) = len
;
1972 TREE_INT_CST_EXT_NUNITS (t
) = ext_len
;
1973 /* to_offset can only be applied to trees that are offset_int-sized
1974 or smaller. EXT_LEN is correct if it fits, otherwise the constant
1975 must be exactly the precision of offset_int and so LEN is correct. */
1976 if (ext_len
<= OFFSET_INT_ELTS
)
1977 TREE_INT_CST_OFFSET_NUNITS (t
) = ext_len
;
1979 TREE_INT_CST_OFFSET_NUNITS (t
) = len
;
1981 TREE_CONSTANT (t
) = 1;
1986 /* Build a newly constructed TREE_VEC node of length LEN. */
1989 make_tree_vec_stat (int len MEM_STAT_DECL
)
1992 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
1994 record_node_allocation_statistics (TREE_VEC
, length
);
1996 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
1998 TREE_SET_CODE (t
, TREE_VEC
);
1999 TREE_VEC_LENGTH (t
) = len
;
2004 /* Grow a TREE_VEC node to new length LEN. */
2007 grow_tree_vec_stat (tree v
, int len MEM_STAT_DECL
)
2009 gcc_assert (TREE_CODE (v
) == TREE_VEC
);
2011 int oldlen
= TREE_VEC_LENGTH (v
);
2012 gcc_assert (len
> oldlen
);
2014 int oldlength
= (oldlen
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
2015 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
2017 record_node_allocation_statistics (TREE_VEC
, length
- oldlength
);
2019 v
= (tree
) ggc_realloc_stat (v
, length PASS_MEM_STAT
);
2021 TREE_VEC_LENGTH (v
) = len
;
2026 /* Return 1 if EXPR is the integer constant zero or a complex constant
2030 integer_zerop (const_tree expr
)
2034 switch (TREE_CODE (expr
))
2037 return wi::eq_p (expr
, 0);
2039 return (integer_zerop (TREE_REALPART (expr
))
2040 && integer_zerop (TREE_IMAGPART (expr
)));
2044 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2045 if (!integer_zerop (VECTOR_CST_ELT (expr
, i
)))
2054 /* Return 1 if EXPR is the integer constant one or the corresponding
2055 complex constant. */
2058 integer_onep (const_tree expr
)
2062 switch (TREE_CODE (expr
))
2065 return wi::eq_p (wi::to_widest (expr
), 1);
2067 return (integer_onep (TREE_REALPART (expr
))
2068 && integer_zerop (TREE_IMAGPART (expr
)));
2072 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2073 if (!integer_onep (VECTOR_CST_ELT (expr
, i
)))
2082 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
2083 it contains, or a complex or vector whose subparts are such integers. */
2086 integer_all_onesp (const_tree expr
)
2090 if (TREE_CODE (expr
) == COMPLEX_CST
2091 && integer_all_onesp (TREE_REALPART (expr
))
2092 && integer_all_onesp (TREE_IMAGPART (expr
)))
2095 else if (TREE_CODE (expr
) == VECTOR_CST
)
2098 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2099 if (!integer_all_onesp (VECTOR_CST_ELT (expr
, i
)))
2104 else if (TREE_CODE (expr
) != INTEGER_CST
)
2107 return wi::max_value (TYPE_PRECISION (TREE_TYPE (expr
)), UNSIGNED
) == expr
;
2110 /* Return 1 if EXPR is the integer constant minus one. */
2113 integer_minus_onep (const_tree expr
)
2117 if (TREE_CODE (expr
) == COMPLEX_CST
)
2118 return (integer_all_onesp (TREE_REALPART (expr
))
2119 && integer_zerop (TREE_IMAGPART (expr
)));
2121 return integer_all_onesp (expr
);
2124 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
2128 integer_pow2p (const_tree expr
)
2132 if (TREE_CODE (expr
) == COMPLEX_CST
2133 && integer_pow2p (TREE_REALPART (expr
))
2134 && integer_zerop (TREE_IMAGPART (expr
)))
2137 if (TREE_CODE (expr
) != INTEGER_CST
)
2140 return wi::popcount (expr
) == 1;
2143 /* Return 1 if EXPR is an integer constant other than zero or a
2144 complex constant other than zero. */
2147 integer_nonzerop (const_tree expr
)
2151 return ((TREE_CODE (expr
) == INTEGER_CST
2152 && !wi::eq_p (expr
, 0))
2153 || (TREE_CODE (expr
) == COMPLEX_CST
2154 && (integer_nonzerop (TREE_REALPART (expr
))
2155 || integer_nonzerop (TREE_IMAGPART (expr
)))));
2158 /* Return 1 if EXPR is the fixed-point constant zero. */
2161 fixed_zerop (const_tree expr
)
2163 return (TREE_CODE (expr
) == FIXED_CST
2164 && TREE_FIXED_CST (expr
).data
.is_zero ());
2167 /* Return the power of two represented by a tree node known to be a
2171 tree_log2 (const_tree expr
)
2175 if (TREE_CODE (expr
) == COMPLEX_CST
)
2176 return tree_log2 (TREE_REALPART (expr
));
2178 return wi::exact_log2 (expr
);
2181 /* Similar, but return the largest integer Y such that 2 ** Y is less
2182 than or equal to EXPR. */
2185 tree_floor_log2 (const_tree expr
)
2189 if (TREE_CODE (expr
) == COMPLEX_CST
)
2190 return tree_log2 (TREE_REALPART (expr
));
2192 return wi::floor_log2 (expr
);
2195 /* Return number of known trailing zero bits in EXPR, or, if the value of
2196 EXPR is known to be zero, the precision of it's type. */
2199 tree_ctz (const_tree expr
)
2201 if (!INTEGRAL_TYPE_P (TREE_TYPE (expr
))
2202 && !POINTER_TYPE_P (TREE_TYPE (expr
)))
2205 unsigned int ret1
, ret2
, prec
= TYPE_PRECISION (TREE_TYPE (expr
));
2206 switch (TREE_CODE (expr
))
2209 ret1
= wi::ctz (expr
);
2210 return MIN (ret1
, prec
);
2212 ret1
= wi::ctz (get_nonzero_bits (expr
));
2213 return MIN (ret1
, prec
);
2220 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2223 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2224 return MIN (ret1
, ret2
);
2225 case POINTER_PLUS_EXPR
:
2226 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2227 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2228 /* Second operand is sizetype, which could be in theory
2229 wider than pointer's precision. Make sure we never
2230 return more than prec. */
2231 ret2
= MIN (ret2
, prec
);
2232 return MIN (ret1
, ret2
);
2234 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2235 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2236 return MAX (ret1
, ret2
);
2238 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2239 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2240 return MIN (ret1
+ ret2
, prec
);
2242 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2243 if (tree_fits_uhwi_p (TREE_OPERAND (expr
, 1))
2244 && (tree_to_uhwi (TREE_OPERAND (expr
, 1)) < prec
))
2246 ret2
= tree_to_uhwi (TREE_OPERAND (expr
, 1));
2247 return MIN (ret1
+ ret2
, prec
);
2251 if (tree_fits_uhwi_p (TREE_OPERAND (expr
, 1))
2252 && (tree_to_uhwi (TREE_OPERAND (expr
, 1)) < prec
))
2254 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2255 ret2
= tree_to_uhwi (TREE_OPERAND (expr
, 1));
2260 case TRUNC_DIV_EXPR
:
2262 case FLOOR_DIV_EXPR
:
2263 case ROUND_DIV_EXPR
:
2264 case EXACT_DIV_EXPR
:
2265 if (TREE_CODE (TREE_OPERAND (expr
, 1)) == INTEGER_CST
2266 && tree_int_cst_sgn (TREE_OPERAND (expr
, 1)) == 1)
2268 int l
= tree_log2 (TREE_OPERAND (expr
, 1));
2271 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2279 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2280 if (ret1
&& ret1
== TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (expr
, 0))))
2282 return MIN (ret1
, prec
);
2284 return tree_ctz (TREE_OPERAND (expr
, 0));
2286 ret1
= tree_ctz (TREE_OPERAND (expr
, 1));
2289 ret2
= tree_ctz (TREE_OPERAND (expr
, 2));
2290 return MIN (ret1
, ret2
);
2292 return tree_ctz (TREE_OPERAND (expr
, 1));
2294 ret1
= get_pointer_alignment (CONST_CAST_TREE (expr
));
2295 if (ret1
> BITS_PER_UNIT
)
2297 ret1
= ctz_hwi (ret1
/ BITS_PER_UNIT
);
2298 return MIN (ret1
, prec
);
2306 /* Return 1 if EXPR is the real constant zero. Trailing zeroes matter for
2307 decimal float constants, so don't return 1 for them. */
2310 real_zerop (const_tree expr
)
2314 switch (TREE_CODE (expr
))
2317 return REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst0
)
2318 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2320 return real_zerop (TREE_REALPART (expr
))
2321 && real_zerop (TREE_IMAGPART (expr
));
2325 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2326 if (!real_zerop (VECTOR_CST_ELT (expr
, i
)))
2335 /* Return 1 if EXPR is the real constant one in real or complex form.
2336 Trailing zeroes matter for decimal float constants, so don't return
2340 real_onep (const_tree expr
)
2344 switch (TREE_CODE (expr
))
2347 return REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst1
)
2348 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2350 return real_onep (TREE_REALPART (expr
))
2351 && real_zerop (TREE_IMAGPART (expr
));
2355 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2356 if (!real_onep (VECTOR_CST_ELT (expr
, i
)))
2365 /* Return 1 if EXPR is the real constant minus one. Trailing zeroes
2366 matter for decimal float constants, so don't return 1 for them. */
2369 real_minus_onep (const_tree expr
)
2373 switch (TREE_CODE (expr
))
2376 return REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconstm1
)
2377 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2379 return real_minus_onep (TREE_REALPART (expr
))
2380 && real_zerop (TREE_IMAGPART (expr
));
2384 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2385 if (!real_minus_onep (VECTOR_CST_ELT (expr
, i
)))
2394 /* Nonzero if EXP is a constant or a cast of a constant. */
2397 really_constant_p (const_tree exp
)
2399 /* This is not quite the same as STRIP_NOPS. It does more. */
2400 while (CONVERT_EXPR_P (exp
)
2401 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
2402 exp
= TREE_OPERAND (exp
, 0);
2403 return TREE_CONSTANT (exp
);
2406 /* Return first list element whose TREE_VALUE is ELEM.
2407 Return 0 if ELEM is not in LIST. */
2410 value_member (tree elem
, tree list
)
2414 if (elem
== TREE_VALUE (list
))
2416 list
= TREE_CHAIN (list
);
2421 /* Return first list element whose TREE_PURPOSE is ELEM.
2422 Return 0 if ELEM is not in LIST. */
2425 purpose_member (const_tree elem
, tree list
)
2429 if (elem
== TREE_PURPOSE (list
))
2431 list
= TREE_CHAIN (list
);
2436 /* Return true if ELEM is in V. */
2439 vec_member (const_tree elem
, vec
<tree
, va_gc
> *v
)
2443 FOR_EACH_VEC_SAFE_ELT (v
, ix
, t
)
2449 /* Returns element number IDX (zero-origin) of chain CHAIN, or
2453 chain_index (int idx
, tree chain
)
2455 for (; chain
&& idx
> 0; --idx
)
2456 chain
= TREE_CHAIN (chain
);
2460 /* Return nonzero if ELEM is part of the chain CHAIN. */
2463 chain_member (const_tree elem
, const_tree chain
)
2469 chain
= DECL_CHAIN (chain
);
2475 /* Return the length of a chain of nodes chained through TREE_CHAIN.
2476 We expect a null pointer to mark the end of the chain.
2477 This is the Lisp primitive `length'. */
2480 list_length (const_tree t
)
2483 #ifdef ENABLE_TREE_CHECKING
2491 #ifdef ENABLE_TREE_CHECKING
2494 gcc_assert (p
!= q
);
2502 /* Returns the first FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
2503 UNION_TYPE TYPE, or NULL_TREE if none. */
2506 first_field (const_tree type
)
2508 tree t
= TYPE_FIELDS (type
);
2509 while (t
&& TREE_CODE (t
) != FIELD_DECL
)
2514 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
2515 by modifying the last node in chain 1 to point to chain 2.
2516 This is the Lisp primitive `nconc'. */
2519 chainon (tree op1
, tree op2
)
2528 for (t1
= op1
; TREE_CHAIN (t1
); t1
= TREE_CHAIN (t1
))
2530 TREE_CHAIN (t1
) = op2
;
2532 #ifdef ENABLE_TREE_CHECKING
2535 for (t2
= op2
; t2
; t2
= TREE_CHAIN (t2
))
2536 gcc_assert (t2
!= t1
);
2543 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
2546 tree_last (tree chain
)
2550 while ((next
= TREE_CHAIN (chain
)))
2555 /* Reverse the order of elements in the chain T,
2556 and return the new head of the chain (old last element). */
2561 tree prev
= 0, decl
, next
;
2562 for (decl
= t
; decl
; decl
= next
)
2564 /* We shouldn't be using this function to reverse BLOCK chains; we
2565 have blocks_nreverse for that. */
2566 gcc_checking_assert (TREE_CODE (decl
) != BLOCK
);
2567 next
= TREE_CHAIN (decl
);
2568 TREE_CHAIN (decl
) = prev
;
2574 /* Return a newly created TREE_LIST node whose
2575 purpose and value fields are PARM and VALUE. */
2578 build_tree_list_stat (tree parm
, tree value MEM_STAT_DECL
)
2580 tree t
= make_node_stat (TREE_LIST PASS_MEM_STAT
);
2581 TREE_PURPOSE (t
) = parm
;
2582 TREE_VALUE (t
) = value
;
2586 /* Build a chain of TREE_LIST nodes from a vector. */
2589 build_tree_list_vec_stat (const vec
<tree
, va_gc
> *vec MEM_STAT_DECL
)
2591 tree ret
= NULL_TREE
;
2595 FOR_EACH_VEC_SAFE_ELT (vec
, i
, t
)
2597 *pp
= build_tree_list_stat (NULL
, t PASS_MEM_STAT
);
2598 pp
= &TREE_CHAIN (*pp
);
2603 /* Return a newly created TREE_LIST node whose
2604 purpose and value fields are PURPOSE and VALUE
2605 and whose TREE_CHAIN is CHAIN. */
2608 tree_cons_stat (tree purpose
, tree value
, tree chain MEM_STAT_DECL
)
2612 node
= ggc_alloc_tree_node_stat (sizeof (struct tree_list
) PASS_MEM_STAT
);
2613 memset (node
, 0, sizeof (struct tree_common
));
2615 record_node_allocation_statistics (TREE_LIST
, sizeof (struct tree_list
));
2617 TREE_SET_CODE (node
, TREE_LIST
);
2618 TREE_CHAIN (node
) = chain
;
2619 TREE_PURPOSE (node
) = purpose
;
2620 TREE_VALUE (node
) = value
;
2624 /* Return the values of the elements of a CONSTRUCTOR as a vector of
2628 ctor_to_vec (tree ctor
)
2630 vec
<tree
, va_gc
> *vec
;
2631 vec_alloc (vec
, CONSTRUCTOR_NELTS (ctor
));
2635 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), ix
, val
)
2636 vec
->quick_push (val
);
2641 /* Return the size nominally occupied by an object of type TYPE
2642 when it resides in memory. The value is measured in units of bytes,
2643 and its data type is that normally used for type sizes
2644 (which is the first type created by make_signed_type or
2645 make_unsigned_type). */
2648 size_in_bytes (const_tree type
)
2652 if (type
== error_mark_node
)
2653 return integer_zero_node
;
2655 type
= TYPE_MAIN_VARIANT (type
);
2656 t
= TYPE_SIZE_UNIT (type
);
2660 lang_hooks
.types
.incomplete_type_error (NULL_TREE
, type
);
2661 return size_zero_node
;
2667 /* Return the size of TYPE (in bytes) as a wide integer
2668 or return -1 if the size can vary or is larger than an integer. */
2671 int_size_in_bytes (const_tree type
)
2675 if (type
== error_mark_node
)
2678 type
= TYPE_MAIN_VARIANT (type
);
2679 t
= TYPE_SIZE_UNIT (type
);
2681 if (t
&& tree_fits_uhwi_p (t
))
2682 return TREE_INT_CST_LOW (t
);
2687 /* Return the maximum size of TYPE (in bytes) as a wide integer
2688 or return -1 if the size can vary or is larger than an integer. */
2691 max_int_size_in_bytes (const_tree type
)
2693 HOST_WIDE_INT size
= -1;
2696 /* If this is an array type, check for a possible MAX_SIZE attached. */
2698 if (TREE_CODE (type
) == ARRAY_TYPE
)
2700 size_tree
= TYPE_ARRAY_MAX_SIZE (type
);
2702 if (size_tree
&& tree_fits_uhwi_p (size_tree
))
2703 size
= tree_to_uhwi (size_tree
);
2706 /* If we still haven't been able to get a size, see if the language
2707 can compute a maximum size. */
2711 size_tree
= lang_hooks
.types
.max_size (type
);
2713 if (size_tree
&& tree_fits_uhwi_p (size_tree
))
2714 size
= tree_to_uhwi (size_tree
);
2720 /* Return the bit position of FIELD, in bits from the start of the record.
2721 This is a tree of type bitsizetype. */
2724 bit_position (const_tree field
)
2726 return bit_from_pos (DECL_FIELD_OFFSET (field
),
2727 DECL_FIELD_BIT_OFFSET (field
));
2730 /* Likewise, but return as an integer. It must be representable in
2731 that way (since it could be a signed value, we don't have the
2732 option of returning -1 like int_size_in_byte can. */
2735 int_bit_position (const_tree field
)
2737 return tree_to_shwi (bit_position (field
));
2740 /* Return the byte position of FIELD, in bytes from the start of the record.
2741 This is a tree of type sizetype. */
2744 byte_position (const_tree field
)
2746 return byte_from_pos (DECL_FIELD_OFFSET (field
),
2747 DECL_FIELD_BIT_OFFSET (field
));
2750 /* Likewise, but return as an integer. It must be representable in
2751 that way (since it could be a signed value, we don't have the
2752 option of returning -1 like int_size_in_byte can. */
2755 int_byte_position (const_tree field
)
2757 return tree_to_shwi (byte_position (field
));
2760 /* Return the strictest alignment, in bits, that T is known to have. */
2763 expr_align (const_tree t
)
2765 unsigned int align0
, align1
;
2767 switch (TREE_CODE (t
))
2769 CASE_CONVERT
: case NON_LVALUE_EXPR
:
2770 /* If we have conversions, we know that the alignment of the
2771 object must meet each of the alignments of the types. */
2772 align0
= expr_align (TREE_OPERAND (t
, 0));
2773 align1
= TYPE_ALIGN (TREE_TYPE (t
));
2774 return MAX (align0
, align1
);
2776 case SAVE_EXPR
: case COMPOUND_EXPR
: case MODIFY_EXPR
:
2777 case INIT_EXPR
: case TARGET_EXPR
: case WITH_CLEANUP_EXPR
:
2778 case CLEANUP_POINT_EXPR
:
2779 /* These don't change the alignment of an object. */
2780 return expr_align (TREE_OPERAND (t
, 0));
2783 /* The best we can do is say that the alignment is the least aligned
2785 align0
= expr_align (TREE_OPERAND (t
, 1));
2786 align1
= expr_align (TREE_OPERAND (t
, 2));
2787 return MIN (align0
, align1
);
2789 /* FIXME: LABEL_DECL and CONST_DECL never have DECL_ALIGN set
2790 meaningfully, it's always 1. */
2791 case LABEL_DECL
: case CONST_DECL
:
2792 case VAR_DECL
: case PARM_DECL
: case RESULT_DECL
:
2794 gcc_assert (DECL_ALIGN (t
) != 0);
2795 return DECL_ALIGN (t
);
2801 /* Otherwise take the alignment from that of the type. */
2802 return TYPE_ALIGN (TREE_TYPE (t
));
2805 /* Return, as a tree node, the number of elements for TYPE (which is an
2806 ARRAY_TYPE) minus one. This counts only elements of the top array. */
2809 array_type_nelts (const_tree type
)
2811 tree index_type
, min
, max
;
2813 /* If they did it with unspecified bounds, then we should have already
2814 given an error about it before we got here. */
2815 if (! TYPE_DOMAIN (type
))
2816 return error_mark_node
;
2818 index_type
= TYPE_DOMAIN (type
);
2819 min
= TYPE_MIN_VALUE (index_type
);
2820 max
= TYPE_MAX_VALUE (index_type
);
2822 /* TYPE_MAX_VALUE may not be set if the array has unknown length. */
2824 return error_mark_node
;
2826 return (integer_zerop (min
)
2828 : fold_build2 (MINUS_EXPR
, TREE_TYPE (max
), max
, min
));
2831 /* If arg is static -- a reference to an object in static storage -- then
2832 return the object. This is not the same as the C meaning of `static'.
2833 If arg isn't static, return NULL. */
2838 switch (TREE_CODE (arg
))
2841 /* Nested functions are static, even though taking their address will
2842 involve a trampoline as we unnest the nested function and create
2843 the trampoline on the tree level. */
2847 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
2848 && ! DECL_THREAD_LOCAL_P (arg
)
2849 && ! DECL_DLLIMPORT_P (arg
)
2853 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
2857 return TREE_STATIC (arg
) ? arg
: NULL
;
2864 /* If the thing being referenced is not a field, then it is
2865 something language specific. */
2866 gcc_assert (TREE_CODE (TREE_OPERAND (arg
, 1)) == FIELD_DECL
);
2868 /* If we are referencing a bitfield, we can't evaluate an
2869 ADDR_EXPR at compile time and so it isn't a constant. */
2870 if (DECL_BIT_FIELD (TREE_OPERAND (arg
, 1)))
2873 return staticp (TREE_OPERAND (arg
, 0));
2879 return TREE_CONSTANT (TREE_OPERAND (arg
, 0)) ? arg
: NULL
;
2882 case ARRAY_RANGE_REF
:
2883 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg
))) == INTEGER_CST
2884 && TREE_CODE (TREE_OPERAND (arg
, 1)) == INTEGER_CST
)
2885 return staticp (TREE_OPERAND (arg
, 0));
2889 case COMPOUND_LITERAL_EXPR
:
2890 return TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (arg
)) ? arg
: NULL
;
2900 /* Return whether OP is a DECL whose address is function-invariant. */
2903 decl_address_invariant_p (const_tree op
)
2905 /* The conditions below are slightly less strict than the one in
2908 switch (TREE_CODE (op
))
2917 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
2918 || DECL_THREAD_LOCAL_P (op
)
2919 || DECL_CONTEXT (op
) == current_function_decl
2920 || decl_function_context (op
) == current_function_decl
)
2925 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
2926 || decl_function_context (op
) == current_function_decl
)
2937 /* Return whether OP is a DECL whose address is interprocedural-invariant. */
2940 decl_address_ip_invariant_p (const_tree op
)
2942 /* The conditions below are slightly less strict than the one in
2945 switch (TREE_CODE (op
))
2953 if (((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
2954 && !DECL_DLLIMPORT_P (op
))
2955 || DECL_THREAD_LOCAL_P (op
))
2960 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
)))
2972 /* Return true if T is function-invariant (internal function, does
2973 not handle arithmetic; that's handled in skip_simple_arithmetic and
2974 tree_invariant_p). */
2976 static bool tree_invariant_p (tree t
);
2979 tree_invariant_p_1 (tree t
)
2983 if (TREE_CONSTANT (t
)
2984 || (TREE_READONLY (t
) && !TREE_SIDE_EFFECTS (t
)))
2987 switch (TREE_CODE (t
))
2993 op
= TREE_OPERAND (t
, 0);
2994 while (handled_component_p (op
))
2996 switch (TREE_CODE (op
))
2999 case ARRAY_RANGE_REF
:
3000 if (!tree_invariant_p (TREE_OPERAND (op
, 1))
3001 || TREE_OPERAND (op
, 2) != NULL_TREE
3002 || TREE_OPERAND (op
, 3) != NULL_TREE
)
3007 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
3013 op
= TREE_OPERAND (op
, 0);
3016 return CONSTANT_CLASS_P (op
) || decl_address_invariant_p (op
);
3025 /* Return true if T is function-invariant. */
3028 tree_invariant_p (tree t
)
3030 tree inner
= skip_simple_arithmetic (t
);
3031 return tree_invariant_p_1 (inner
);
3034 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
3035 Do this to any expression which may be used in more than one place,
3036 but must be evaluated only once.
3038 Normally, expand_expr would reevaluate the expression each time.
3039 Calling save_expr produces something that is evaluated and recorded
3040 the first time expand_expr is called on it. Subsequent calls to
3041 expand_expr just reuse the recorded value.
3043 The call to expand_expr that generates code that actually computes
3044 the value is the first call *at compile time*. Subsequent calls
3045 *at compile time* generate code to use the saved value.
3046 This produces correct result provided that *at run time* control
3047 always flows through the insns made by the first expand_expr
3048 before reaching the other places where the save_expr was evaluated.
3049 You, the caller of save_expr, must make sure this is so.
3051 Constants, and certain read-only nodes, are returned with no
3052 SAVE_EXPR because that is safe. Expressions containing placeholders
3053 are not touched; see tree.def for an explanation of what these
3057 save_expr (tree expr
)
3059 tree t
= fold (expr
);
3062 /* If the tree evaluates to a constant, then we don't want to hide that
3063 fact (i.e. this allows further folding, and direct checks for constants).
3064 However, a read-only object that has side effects cannot be bypassed.
3065 Since it is no problem to reevaluate literals, we just return the
3067 inner
= skip_simple_arithmetic (t
);
3068 if (TREE_CODE (inner
) == ERROR_MARK
)
3071 if (tree_invariant_p_1 (inner
))
3074 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
3075 it means that the size or offset of some field of an object depends on
3076 the value within another field.
3078 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
3079 and some variable since it would then need to be both evaluated once and
3080 evaluated more than once. Front-ends must assure this case cannot
3081 happen by surrounding any such subexpressions in their own SAVE_EXPR
3082 and forcing evaluation at the proper time. */
3083 if (contains_placeholder_p (inner
))
3086 t
= build1 (SAVE_EXPR
, TREE_TYPE (expr
), t
);
3087 SET_EXPR_LOCATION (t
, EXPR_LOCATION (expr
));
3089 /* This expression might be placed ahead of a jump to ensure that the
3090 value was computed on both sides of the jump. So make sure it isn't
3091 eliminated as dead. */
3092 TREE_SIDE_EFFECTS (t
) = 1;
3096 /* Look inside EXPR into any simple arithmetic operations. Return the
3097 outermost non-arithmetic or non-invariant node. */
3100 skip_simple_arithmetic (tree expr
)
3102 /* We don't care about whether this can be used as an lvalue in this
3104 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
3105 expr
= TREE_OPERAND (expr
, 0);
3107 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
3108 a constant, it will be more efficient to not make another SAVE_EXPR since
3109 it will allow better simplification and GCSE will be able to merge the
3110 computations if they actually occur. */
3113 if (UNARY_CLASS_P (expr
))
3114 expr
= TREE_OPERAND (expr
, 0);
3115 else if (BINARY_CLASS_P (expr
))
3117 if (tree_invariant_p (TREE_OPERAND (expr
, 1)))
3118 expr
= TREE_OPERAND (expr
, 0);
3119 else if (tree_invariant_p (TREE_OPERAND (expr
, 0)))
3120 expr
= TREE_OPERAND (expr
, 1);
3131 /* Look inside EXPR into simple arithmetic operations involving constants.
3132 Return the outermost non-arithmetic or non-constant node. */
3135 skip_simple_constant_arithmetic (tree expr
)
3137 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
3138 expr
= TREE_OPERAND (expr
, 0);
3142 if (UNARY_CLASS_P (expr
))
3143 expr
= TREE_OPERAND (expr
, 0);
3144 else if (BINARY_CLASS_P (expr
))
3146 if (TREE_CONSTANT (TREE_OPERAND (expr
, 1)))
3147 expr
= TREE_OPERAND (expr
, 0);
3148 else if (TREE_CONSTANT (TREE_OPERAND (expr
, 0)))
3149 expr
= TREE_OPERAND (expr
, 1);
3160 /* Return which tree structure is used by T. */
3162 enum tree_node_structure_enum
3163 tree_node_structure (const_tree t
)
3165 const enum tree_code code
= TREE_CODE (t
);
3166 return tree_node_structure_for_code (code
);
3169 /* Set various status flags when building a CALL_EXPR object T. */
3172 process_call_operands (tree t
)
3174 bool side_effects
= TREE_SIDE_EFFECTS (t
);
3175 bool read_only
= false;
3176 int i
= call_expr_flags (t
);
3178 /* Calls have side-effects, except those to const or pure functions. */
3179 if ((i
& ECF_LOOPING_CONST_OR_PURE
) || !(i
& (ECF_CONST
| ECF_PURE
)))
3180 side_effects
= true;
3181 /* Propagate TREE_READONLY of arguments for const functions. */
3185 if (!side_effects
|| read_only
)
3186 for (i
= 1; i
< TREE_OPERAND_LENGTH (t
); i
++)
3188 tree op
= TREE_OPERAND (t
, i
);
3189 if (op
&& TREE_SIDE_EFFECTS (op
))
3190 side_effects
= true;
3191 if (op
&& !TREE_READONLY (op
) && !CONSTANT_CLASS_P (op
))
3195 TREE_SIDE_EFFECTS (t
) = side_effects
;
3196 TREE_READONLY (t
) = read_only
;
3199 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
3200 size or offset that depends on a field within a record. */
3203 contains_placeholder_p (const_tree exp
)
3205 enum tree_code code
;
3210 code
= TREE_CODE (exp
);
3211 if (code
== PLACEHOLDER_EXPR
)
3214 switch (TREE_CODE_CLASS (code
))
3217 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
3218 position computations since they will be converted into a
3219 WITH_RECORD_EXPR involving the reference, which will assume
3220 here will be valid. */
3221 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
3223 case tcc_exceptional
:
3224 if (code
== TREE_LIST
)
3225 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp
))
3226 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp
)));
3231 case tcc_comparison
:
3232 case tcc_expression
:
3236 /* Ignoring the first operand isn't quite right, but works best. */
3237 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1));
3240 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
3241 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1))
3242 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 2)));
3245 /* The save_expr function never wraps anything containing
3246 a PLACEHOLDER_EXPR. */
3253 switch (TREE_CODE_LENGTH (code
))
3256 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
3258 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
3259 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1)));
3270 const_call_expr_arg_iterator iter
;
3271 FOR_EACH_CONST_CALL_EXPR_ARG (arg
, iter
, exp
)
3272 if (CONTAINS_PLACEHOLDER_P (arg
))
3286 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
3287 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
3291 type_contains_placeholder_1 (const_tree type
)
3293 /* If the size contains a placeholder or the parent type (component type in
3294 the case of arrays) type involves a placeholder, this type does. */
3295 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type
))
3296 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type
))
3297 || (!POINTER_TYPE_P (type
)
3299 && type_contains_placeholder_p (TREE_TYPE (type
))))
3302 /* Now do type-specific checks. Note that the last part of the check above
3303 greatly limits what we have to do below. */
3304 switch (TREE_CODE (type
))
3312 case REFERENCE_TYPE
:
3321 case FIXED_POINT_TYPE
:
3322 /* Here we just check the bounds. */
3323 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type
))
3324 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type
)));
3327 /* We have already checked the component type above, so just check the
3329 return type_contains_placeholder_p (TYPE_DOMAIN (type
));
3333 case QUAL_UNION_TYPE
:
3337 for (field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
3338 if (TREE_CODE (field
) == FIELD_DECL
3339 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field
))
3340 || (TREE_CODE (type
) == QUAL_UNION_TYPE
3341 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field
)))
3342 || type_contains_placeholder_p (TREE_TYPE (field
))))
3353 /* Wrapper around above function used to cache its result. */
3356 type_contains_placeholder_p (tree type
)
3360 /* If the contains_placeholder_bits field has been initialized,
3361 then we know the answer. */
3362 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) > 0)
3363 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) - 1;
3365 /* Indicate that we've seen this type node, and the answer is false.
3366 This is what we want to return if we run into recursion via fields. */
3367 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = 1;
3369 /* Compute the real value. */
3370 result
= type_contains_placeholder_1 (type
);
3372 /* Store the real value. */
3373 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = result
+ 1;
3378 /* Push tree EXP onto vector QUEUE if it is not already present. */
3381 push_without_duplicates (tree exp
, vec
<tree
> *queue
)
3386 FOR_EACH_VEC_ELT (*queue
, i
, iter
)
3387 if (simple_cst_equal (iter
, exp
) == 1)
3391 queue
->safe_push (exp
);
3394 /* Given a tree EXP, find all occurrences of references to fields
3395 in a PLACEHOLDER_EXPR and place them in vector REFS without
3396 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
3397 we assume here that EXP contains only arithmetic expressions
3398 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
3402 find_placeholder_in_expr (tree exp
, vec
<tree
> *refs
)
3404 enum tree_code code
= TREE_CODE (exp
);
3408 /* We handle TREE_LIST and COMPONENT_REF separately. */
3409 if (code
== TREE_LIST
)
3411 FIND_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), refs
);
3412 FIND_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), refs
);
3414 else if (code
== COMPONENT_REF
)
3416 for (inner
= TREE_OPERAND (exp
, 0);
3417 REFERENCE_CLASS_P (inner
);
3418 inner
= TREE_OPERAND (inner
, 0))
3421 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
)
3422 push_without_duplicates (exp
, refs
);
3424 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), refs
);
3427 switch (TREE_CODE_CLASS (code
))
3432 case tcc_declaration
:
3433 /* Variables allocated to static storage can stay. */
3434 if (!TREE_STATIC (exp
))
3435 push_without_duplicates (exp
, refs
);
3438 case tcc_expression
:
3439 /* This is the pattern built in ada/make_aligning_type. */
3440 if (code
== ADDR_EXPR
3441 && TREE_CODE (TREE_OPERAND (exp
, 0)) == PLACEHOLDER_EXPR
)
3443 push_without_duplicates (exp
, refs
);
3447 /* Fall through... */
3449 case tcc_exceptional
:
3452 case tcc_comparison
:
3454 for (i
= 0; i
< TREE_CODE_LENGTH (code
); i
++)
3455 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
3459 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3460 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
3468 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
3469 return a tree with all occurrences of references to F in a
3470 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
3471 CONST_DECLs. Note that we assume here that EXP contains only
3472 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
3473 occurring only in their argument list. */
3476 substitute_in_expr (tree exp
, tree f
, tree r
)
3478 enum tree_code code
= TREE_CODE (exp
);
3479 tree op0
, op1
, op2
, op3
;
3482 /* We handle TREE_LIST and COMPONENT_REF separately. */
3483 if (code
== TREE_LIST
)
3485 op0
= SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp
), f
, r
);
3486 op1
= SUBSTITUTE_IN_EXPR (TREE_VALUE (exp
), f
, r
);
3487 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
3490 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
3492 else if (code
== COMPONENT_REF
)
3496 /* If this expression is getting a value from a PLACEHOLDER_EXPR
3497 and it is the right field, replace it with R. */
3498 for (inner
= TREE_OPERAND (exp
, 0);
3499 REFERENCE_CLASS_P (inner
);
3500 inner
= TREE_OPERAND (inner
, 0))
3504 op1
= TREE_OPERAND (exp
, 1);
3506 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& op1
== f
)
3509 /* If this expression hasn't been completed let, leave it alone. */
3510 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& !TREE_TYPE (inner
))
3513 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3514 if (op0
== TREE_OPERAND (exp
, 0))
3518 = fold_build3 (COMPONENT_REF
, TREE_TYPE (exp
), op0
, op1
, NULL_TREE
);
3521 switch (TREE_CODE_CLASS (code
))
3526 case tcc_declaration
:
3532 case tcc_expression
:
3536 /* Fall through... */
3538 case tcc_exceptional
:
3541 case tcc_comparison
:
3543 switch (TREE_CODE_LENGTH (code
))
3549 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3550 if (op0
== TREE_OPERAND (exp
, 0))
3553 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
3557 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3558 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3560 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
3563 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
3567 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3568 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3569 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
3571 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3572 && op2
== TREE_OPERAND (exp
, 2))
3575 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
3579 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3580 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3581 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
3582 op3
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 3), f
, r
);
3584 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3585 && op2
== TREE_OPERAND (exp
, 2)
3586 && op3
== TREE_OPERAND (exp
, 3))
3590 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
3602 new_tree
= NULL_TREE
;
3604 /* If we are trying to replace F with a constant, inline back
3605 functions which do nothing else than computing a value from
3606 the arguments they are passed. This makes it possible to
3607 fold partially or entirely the replacement expression. */
3608 if (CONSTANT_CLASS_P (r
) && code
== CALL_EXPR
)
3610 tree t
= maybe_inline_call_in_expr (exp
);
3612 return SUBSTITUTE_IN_EXPR (t
, f
, r
);
3615 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3617 tree op
= TREE_OPERAND (exp
, i
);
3618 tree new_op
= SUBSTITUTE_IN_EXPR (op
, f
, r
);
3622 new_tree
= copy_node (exp
);
3623 TREE_OPERAND (new_tree
, i
) = new_op
;
3629 new_tree
= fold (new_tree
);
3630 if (TREE_CODE (new_tree
) == CALL_EXPR
)
3631 process_call_operands (new_tree
);
3642 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
3644 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
3645 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
3650 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
3651 for it within OBJ, a tree that is an object or a chain of references. */
3654 substitute_placeholder_in_expr (tree exp
, tree obj
)
3656 enum tree_code code
= TREE_CODE (exp
);
3657 tree op0
, op1
, op2
, op3
;
3660 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
3661 in the chain of OBJ. */
3662 if (code
== PLACEHOLDER_EXPR
)
3664 tree need_type
= TYPE_MAIN_VARIANT (TREE_TYPE (exp
));
3667 for (elt
= obj
; elt
!= 0;
3668 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
3669 || TREE_CODE (elt
) == COND_EXPR
)
3670 ? TREE_OPERAND (elt
, 1)
3671 : (REFERENCE_CLASS_P (elt
)
3672 || UNARY_CLASS_P (elt
)
3673 || BINARY_CLASS_P (elt
)
3674 || VL_EXP_CLASS_P (elt
)
3675 || EXPRESSION_CLASS_P (elt
))
3676 ? TREE_OPERAND (elt
, 0) : 0))
3677 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt
)) == need_type
)
3680 for (elt
= obj
; elt
!= 0;
3681 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
3682 || TREE_CODE (elt
) == COND_EXPR
)
3683 ? TREE_OPERAND (elt
, 1)
3684 : (REFERENCE_CLASS_P (elt
)
3685 || UNARY_CLASS_P (elt
)
3686 || BINARY_CLASS_P (elt
)
3687 || VL_EXP_CLASS_P (elt
)
3688 || EXPRESSION_CLASS_P (elt
))
3689 ? TREE_OPERAND (elt
, 0) : 0))
3690 if (POINTER_TYPE_P (TREE_TYPE (elt
))
3691 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt
)))
3693 return fold_build1 (INDIRECT_REF
, need_type
, elt
);
3695 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
3696 survives until RTL generation, there will be an error. */
3700 /* TREE_LIST is special because we need to look at TREE_VALUE
3701 and TREE_CHAIN, not TREE_OPERANDS. */
3702 else if (code
== TREE_LIST
)
3704 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), obj
);
3705 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), obj
);
3706 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
3709 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
3712 switch (TREE_CODE_CLASS (code
))
3715 case tcc_declaration
:
3718 case tcc_exceptional
:
3721 case tcc_comparison
:
3722 case tcc_expression
:
3725 switch (TREE_CODE_LENGTH (code
))
3731 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3732 if (op0
== TREE_OPERAND (exp
, 0))
3735 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
3739 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3740 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
3742 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
3745 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
3749 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3750 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
3751 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
3753 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3754 && op2
== TREE_OPERAND (exp
, 2))
3757 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
3761 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3762 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
3763 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
3764 op3
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 3), obj
);
3766 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3767 && op2
== TREE_OPERAND (exp
, 2)
3768 && op3
== TREE_OPERAND (exp
, 3))
3772 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
3784 new_tree
= NULL_TREE
;
3786 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3788 tree op
= TREE_OPERAND (exp
, i
);
3789 tree new_op
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (op
, obj
);
3793 new_tree
= copy_node (exp
);
3794 TREE_OPERAND (new_tree
, i
) = new_op
;
3800 new_tree
= fold (new_tree
);
3801 if (TREE_CODE (new_tree
) == CALL_EXPR
)
3802 process_call_operands (new_tree
);
3813 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
3815 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
3816 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
3822 /* Subroutine of stabilize_reference; this is called for subtrees of
3823 references. Any expression with side-effects must be put in a SAVE_EXPR
3824 to ensure that it is only evaluated once.
3826 We don't put SAVE_EXPR nodes around everything, because assigning very
3827 simple expressions to temporaries causes us to miss good opportunities
3828 for optimizations. Among other things, the opportunity to fold in the
3829 addition of a constant into an addressing mode often gets lost, e.g.
3830 "y[i+1] += x;". In general, we take the approach that we should not make
3831 an assignment unless we are forced into it - i.e., that any non-side effect
3832 operator should be allowed, and that cse should take care of coalescing
3833 multiple utterances of the same expression should that prove fruitful. */
3836 stabilize_reference_1 (tree e
)
3839 enum tree_code code
= TREE_CODE (e
);
3841 /* We cannot ignore const expressions because it might be a reference
3842 to a const array but whose index contains side-effects. But we can
3843 ignore things that are actual constant or that already have been
3844 handled by this function. */
3846 if (tree_invariant_p (e
))
3849 switch (TREE_CODE_CLASS (code
))
3851 case tcc_exceptional
:
3853 case tcc_declaration
:
3854 case tcc_comparison
:
3856 case tcc_expression
:
3859 /* If the expression has side-effects, then encase it in a SAVE_EXPR
3860 so that it will only be evaluated once. */
3861 /* The reference (r) and comparison (<) classes could be handled as
3862 below, but it is generally faster to only evaluate them once. */
3863 if (TREE_SIDE_EFFECTS (e
))
3864 return save_expr (e
);
3868 /* Constants need no processing. In fact, we should never reach
3873 /* Division is slow and tends to be compiled with jumps,
3874 especially the division by powers of 2 that is often
3875 found inside of an array reference. So do it just once. */
3876 if (code
== TRUNC_DIV_EXPR
|| code
== TRUNC_MOD_EXPR
3877 || code
== FLOOR_DIV_EXPR
|| code
== FLOOR_MOD_EXPR
3878 || code
== CEIL_DIV_EXPR
|| code
== CEIL_MOD_EXPR
3879 || code
== ROUND_DIV_EXPR
|| code
== ROUND_MOD_EXPR
)
3880 return save_expr (e
);
3881 /* Recursively stabilize each operand. */
3882 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)),
3883 stabilize_reference_1 (TREE_OPERAND (e
, 1)));
3887 /* Recursively stabilize each operand. */
3888 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)));
3895 TREE_TYPE (result
) = TREE_TYPE (e
);
3896 TREE_READONLY (result
) = TREE_READONLY (e
);
3897 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (e
);
3898 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (e
);
3903 /* Stabilize a reference so that we can use it any number of times
3904 without causing its operands to be evaluated more than once.
3905 Returns the stabilized reference. This works by means of save_expr,
3906 so see the caveats in the comments about save_expr.
3908 Also allows conversion expressions whose operands are references.
3909 Any other kind of expression is returned unchanged. */
3912 stabilize_reference (tree ref
)
3915 enum tree_code code
= TREE_CODE (ref
);
3922 /* No action is needed in this case. */
3927 case FIX_TRUNC_EXPR
:
3928 result
= build_nt (code
, stabilize_reference (TREE_OPERAND (ref
, 0)));
3932 result
= build_nt (INDIRECT_REF
,
3933 stabilize_reference_1 (TREE_OPERAND (ref
, 0)));
3937 result
= build_nt (COMPONENT_REF
,
3938 stabilize_reference (TREE_OPERAND (ref
, 0)),
3939 TREE_OPERAND (ref
, 1), NULL_TREE
);
3943 result
= build_nt (BIT_FIELD_REF
,
3944 stabilize_reference (TREE_OPERAND (ref
, 0)),
3945 TREE_OPERAND (ref
, 1), TREE_OPERAND (ref
, 2));
3949 result
= build_nt (ARRAY_REF
,
3950 stabilize_reference (TREE_OPERAND (ref
, 0)),
3951 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
3952 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
3955 case ARRAY_RANGE_REF
:
3956 result
= build_nt (ARRAY_RANGE_REF
,
3957 stabilize_reference (TREE_OPERAND (ref
, 0)),
3958 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
3959 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
3963 /* We cannot wrap the first expression in a SAVE_EXPR, as then
3964 it wouldn't be ignored. This matters when dealing with
3966 return stabilize_reference_1 (ref
);
3968 /* If arg isn't a kind of lvalue we recognize, make no change.
3969 Caller should recognize the error for an invalid lvalue. */
3974 return error_mark_node
;
3977 TREE_TYPE (result
) = TREE_TYPE (ref
);
3978 TREE_READONLY (result
) = TREE_READONLY (ref
);
3979 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (ref
);
3980 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (ref
);
3985 /* Low-level constructors for expressions. */
3987 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
3988 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
3991 recompute_tree_invariant_for_addr_expr (tree t
)
3994 bool tc
= true, se
= false;
3996 /* We started out assuming this address is both invariant and constant, but
3997 does not have side effects. Now go down any handled components and see if
3998 any of them involve offsets that are either non-constant or non-invariant.
3999 Also check for side-effects.
4001 ??? Note that this code makes no attempt to deal with the case where
4002 taking the address of something causes a copy due to misalignment. */
4004 #define UPDATE_FLAGS(NODE) \
4005 do { tree _node = (NODE); \
4006 if (_node && !TREE_CONSTANT (_node)) tc = false; \
4007 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
4009 for (node
= TREE_OPERAND (t
, 0); handled_component_p (node
);
4010 node
= TREE_OPERAND (node
, 0))
4012 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
4013 array reference (probably made temporarily by the G++ front end),
4014 so ignore all the operands. */
4015 if ((TREE_CODE (node
) == ARRAY_REF
4016 || TREE_CODE (node
) == ARRAY_RANGE_REF
)
4017 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node
, 0))) == ARRAY_TYPE
)
4019 UPDATE_FLAGS (TREE_OPERAND (node
, 1));
4020 if (TREE_OPERAND (node
, 2))
4021 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
4022 if (TREE_OPERAND (node
, 3))
4023 UPDATE_FLAGS (TREE_OPERAND (node
, 3));
4025 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
4026 FIELD_DECL, apparently. The G++ front end can put something else
4027 there, at least temporarily. */
4028 else if (TREE_CODE (node
) == COMPONENT_REF
4029 && TREE_CODE (TREE_OPERAND (node
, 1)) == FIELD_DECL
)
4031 if (TREE_OPERAND (node
, 2))
4032 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
4036 node
= lang_hooks
.expr_to_decl (node
, &tc
, &se
);
4038 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
4039 the address, since &(*a)->b is a form of addition. If it's a constant, the
4040 address is constant too. If it's a decl, its address is constant if the
4041 decl is static. Everything else is not constant and, furthermore,
4042 taking the address of a volatile variable is not volatile. */
4043 if (TREE_CODE (node
) == INDIRECT_REF
4044 || TREE_CODE (node
) == MEM_REF
)
4045 UPDATE_FLAGS (TREE_OPERAND (node
, 0));
4046 else if (CONSTANT_CLASS_P (node
))
4048 else if (DECL_P (node
))
4049 tc
&= (staticp (node
) != NULL_TREE
);
4053 se
|= TREE_SIDE_EFFECTS (node
);
4057 TREE_CONSTANT (t
) = tc
;
4058 TREE_SIDE_EFFECTS (t
) = se
;
4062 /* Build an expression of code CODE, data type TYPE, and operands as
4063 specified. Expressions and reference nodes can be created this way.
4064 Constants, decls, types and misc nodes cannot be.
4066 We define 5 non-variadic functions, from 0 to 4 arguments. This is
4067 enough for all extant tree codes. */
4070 build0_stat (enum tree_code code
, tree tt MEM_STAT_DECL
)
4074 gcc_assert (TREE_CODE_LENGTH (code
) == 0);
4076 t
= make_node_stat (code PASS_MEM_STAT
);
4083 build1_stat (enum tree_code code
, tree type
, tree node MEM_STAT_DECL
)
4085 int length
= sizeof (struct tree_exp
);
4088 record_node_allocation_statistics (code
, length
);
4090 gcc_assert (TREE_CODE_LENGTH (code
) == 1);
4092 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
4094 memset (t
, 0, sizeof (struct tree_common
));
4096 TREE_SET_CODE (t
, code
);
4098 TREE_TYPE (t
) = type
;
4099 SET_EXPR_LOCATION (t
, UNKNOWN_LOCATION
);
4100 TREE_OPERAND (t
, 0) = node
;
4101 if (node
&& !TYPE_P (node
))
4103 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (node
);
4104 TREE_READONLY (t
) = TREE_READONLY (node
);
4107 if (TREE_CODE_CLASS (code
) == tcc_statement
)
4108 TREE_SIDE_EFFECTS (t
) = 1;
4112 /* All of these have side-effects, no matter what their
4114 TREE_SIDE_EFFECTS (t
) = 1;
4115 TREE_READONLY (t
) = 0;
4119 /* Whether a dereference is readonly has nothing to do with whether
4120 its operand is readonly. */
4121 TREE_READONLY (t
) = 0;
4126 recompute_tree_invariant_for_addr_expr (t
);
4130 if ((TREE_CODE_CLASS (code
) == tcc_unary
|| code
== VIEW_CONVERT_EXPR
)
4131 && node
&& !TYPE_P (node
)
4132 && TREE_CONSTANT (node
))
4133 TREE_CONSTANT (t
) = 1;
4134 if (TREE_CODE_CLASS (code
) == tcc_reference
4135 && node
&& TREE_THIS_VOLATILE (node
))
4136 TREE_THIS_VOLATILE (t
) = 1;
4143 #define PROCESS_ARG(N) \
4145 TREE_OPERAND (t, N) = arg##N; \
4146 if (arg##N &&!TYPE_P (arg##N)) \
4148 if (TREE_SIDE_EFFECTS (arg##N)) \
4150 if (!TREE_READONLY (arg##N) \
4151 && !CONSTANT_CLASS_P (arg##N)) \
4152 (void) (read_only = 0); \
4153 if (!TREE_CONSTANT (arg##N)) \
4154 (void) (constant = 0); \
4159 build2_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1 MEM_STAT_DECL
)
4161 bool constant
, read_only
, side_effects
;
4164 gcc_assert (TREE_CODE_LENGTH (code
) == 2);
4166 if ((code
== MINUS_EXPR
|| code
== PLUS_EXPR
|| code
== MULT_EXPR
)
4167 && arg0
&& arg1
&& tt
&& POINTER_TYPE_P (tt
)
4168 /* When sizetype precision doesn't match that of pointers
4169 we need to be able to build explicit extensions or truncations
4170 of the offset argument. */
4171 && TYPE_PRECISION (sizetype
) == TYPE_PRECISION (tt
))
4172 gcc_assert (TREE_CODE (arg0
) == INTEGER_CST
4173 && TREE_CODE (arg1
) == INTEGER_CST
);
4175 if (code
== POINTER_PLUS_EXPR
&& arg0
&& arg1
&& tt
)
4176 gcc_assert (POINTER_TYPE_P (tt
) && POINTER_TYPE_P (TREE_TYPE (arg0
))
4177 && ptrofftype_p (TREE_TYPE (arg1
)));
4179 t
= make_node_stat (code PASS_MEM_STAT
);
4182 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
4183 result based on those same flags for the arguments. But if the
4184 arguments aren't really even `tree' expressions, we shouldn't be trying
4187 /* Expressions without side effects may be constant if their
4188 arguments are as well. */
4189 constant
= (TREE_CODE_CLASS (code
) == tcc_comparison
4190 || TREE_CODE_CLASS (code
) == tcc_binary
);
4192 side_effects
= TREE_SIDE_EFFECTS (t
);
4197 TREE_READONLY (t
) = read_only
;
4198 TREE_CONSTANT (t
) = constant
;
4199 TREE_SIDE_EFFECTS (t
) = side_effects
;
4200 TREE_THIS_VOLATILE (t
)
4201 = (TREE_CODE_CLASS (code
) == tcc_reference
4202 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4209 build3_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4210 tree arg2 MEM_STAT_DECL
)
4212 bool constant
, read_only
, side_effects
;
4215 gcc_assert (TREE_CODE_LENGTH (code
) == 3);
4216 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
4218 t
= make_node_stat (code PASS_MEM_STAT
);
4223 /* As a special exception, if COND_EXPR has NULL branches, we
4224 assume that it is a gimple statement and always consider
4225 it to have side effects. */
4226 if (code
== COND_EXPR
4227 && tt
== void_type_node
4228 && arg1
== NULL_TREE
4229 && arg2
== NULL_TREE
)
4230 side_effects
= true;
4232 side_effects
= TREE_SIDE_EFFECTS (t
);
4238 if (code
== COND_EXPR
)
4239 TREE_READONLY (t
) = read_only
;
4241 TREE_SIDE_EFFECTS (t
) = side_effects
;
4242 TREE_THIS_VOLATILE (t
)
4243 = (TREE_CODE_CLASS (code
) == tcc_reference
4244 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4250 build4_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4251 tree arg2
, tree arg3 MEM_STAT_DECL
)
4253 bool constant
, read_only
, side_effects
;
4256 gcc_assert (TREE_CODE_LENGTH (code
) == 4);
4258 t
= make_node_stat (code PASS_MEM_STAT
);
4261 side_effects
= TREE_SIDE_EFFECTS (t
);
4268 TREE_SIDE_EFFECTS (t
) = side_effects
;
4269 TREE_THIS_VOLATILE (t
)
4270 = (TREE_CODE_CLASS (code
) == tcc_reference
4271 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4277 build5_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4278 tree arg2
, tree arg3
, tree arg4 MEM_STAT_DECL
)
4280 bool constant
, read_only
, side_effects
;
4283 gcc_assert (TREE_CODE_LENGTH (code
) == 5);
4285 t
= make_node_stat (code PASS_MEM_STAT
);
4288 side_effects
= TREE_SIDE_EFFECTS (t
);
4296 TREE_SIDE_EFFECTS (t
) = side_effects
;
4297 TREE_THIS_VOLATILE (t
)
4298 = (TREE_CODE_CLASS (code
) == tcc_reference
4299 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4304 /* Build a simple MEM_REF tree with the sematics of a plain INDIRECT_REF
4305 on the pointer PTR. */
4308 build_simple_mem_ref_loc (location_t loc
, tree ptr
)
4310 HOST_WIDE_INT offset
= 0;
4311 tree ptype
= TREE_TYPE (ptr
);
4313 /* For convenience allow addresses that collapse to a simple base
4315 if (TREE_CODE (ptr
) == ADDR_EXPR
4316 && (handled_component_p (TREE_OPERAND (ptr
, 0))
4317 || TREE_CODE (TREE_OPERAND (ptr
, 0)) == MEM_REF
))
4319 ptr
= get_addr_base_and_unit_offset (TREE_OPERAND (ptr
, 0), &offset
);
4321 ptr
= build_fold_addr_expr (ptr
);
4322 gcc_assert (is_gimple_reg (ptr
) || is_gimple_min_invariant (ptr
));
4324 tem
= build2 (MEM_REF
, TREE_TYPE (ptype
),
4325 ptr
, build_int_cst (ptype
, offset
));
4326 SET_EXPR_LOCATION (tem
, loc
);
4330 /* Return the constant offset of a MEM_REF or TARGET_MEM_REF tree T. */
4333 mem_ref_offset (const_tree t
)
4335 return offset_int::from (TREE_OPERAND (t
, 1), SIGNED
);
4338 /* Return an invariant ADDR_EXPR of type TYPE taking the address of BASE
4339 offsetted by OFFSET units. */
4342 build_invariant_address (tree type
, tree base
, HOST_WIDE_INT offset
)
4344 tree ref
= fold_build2 (MEM_REF
, TREE_TYPE (type
),
4345 build_fold_addr_expr (base
),
4346 build_int_cst (ptr_type_node
, offset
));
4347 tree addr
= build1 (ADDR_EXPR
, type
, ref
);
4348 recompute_tree_invariant_for_addr_expr (addr
);
4352 /* Similar except don't specify the TREE_TYPE
4353 and leave the TREE_SIDE_EFFECTS as 0.
4354 It is permissible for arguments to be null,
4355 or even garbage if their values do not matter. */
4358 build_nt (enum tree_code code
, ...)
4365 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
4369 t
= make_node (code
);
4370 length
= TREE_CODE_LENGTH (code
);
4372 for (i
= 0; i
< length
; i
++)
4373 TREE_OPERAND (t
, i
) = va_arg (p
, tree
);
4379 /* Similar to build_nt, but for creating a CALL_EXPR object with a
4383 build_nt_call_vec (tree fn
, vec
<tree
, va_gc
> *args
)
4388 ret
= build_vl_exp (CALL_EXPR
, vec_safe_length (args
) + 3);
4389 CALL_EXPR_FN (ret
) = fn
;
4390 CALL_EXPR_STATIC_CHAIN (ret
) = NULL_TREE
;
4391 FOR_EACH_VEC_SAFE_ELT (args
, ix
, t
)
4392 CALL_EXPR_ARG (ret
, ix
) = t
;
4396 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
4397 We do NOT enter this node in any sort of symbol table.
4399 LOC is the location of the decl.
4401 layout_decl is used to set up the decl's storage layout.
4402 Other slots are initialized to 0 or null pointers. */
4405 build_decl_stat (location_t loc
, enum tree_code code
, tree name
,
4406 tree type MEM_STAT_DECL
)
4410 t
= make_node_stat (code PASS_MEM_STAT
);
4411 DECL_SOURCE_LOCATION (t
) = loc
;
4413 /* if (type == error_mark_node)
4414 type = integer_type_node; */
4415 /* That is not done, deliberately, so that having error_mark_node
4416 as the type can suppress useless errors in the use of this variable. */
4418 DECL_NAME (t
) = name
;
4419 TREE_TYPE (t
) = type
;
4421 if (code
== VAR_DECL
|| code
== PARM_DECL
|| code
== RESULT_DECL
)
4427 /* Builds and returns function declaration with NAME and TYPE. */
4430 build_fn_decl (const char *name
, tree type
)
4432 tree id
= get_identifier (name
);
4433 tree decl
= build_decl (input_location
, FUNCTION_DECL
, id
, type
);
4435 DECL_EXTERNAL (decl
) = 1;
4436 TREE_PUBLIC (decl
) = 1;
4437 DECL_ARTIFICIAL (decl
) = 1;
4438 TREE_NOTHROW (decl
) = 1;
4443 vec
<tree
, va_gc
> *all_translation_units
;
4445 /* Builds a new translation-unit decl with name NAME, queues it in the
4446 global list of translation-unit decls and returns it. */
4449 build_translation_unit_decl (tree name
)
4451 tree tu
= build_decl (UNKNOWN_LOCATION
, TRANSLATION_UNIT_DECL
,
4453 TRANSLATION_UNIT_LANGUAGE (tu
) = lang_hooks
.name
;
4454 vec_safe_push (all_translation_units
, tu
);
4459 /* BLOCK nodes are used to represent the structure of binding contours
4460 and declarations, once those contours have been exited and their contents
4461 compiled. This information is used for outputting debugging info. */
4464 build_block (tree vars
, tree subblocks
, tree supercontext
, tree chain
)
4466 tree block
= make_node (BLOCK
);
4468 BLOCK_VARS (block
) = vars
;
4469 BLOCK_SUBBLOCKS (block
) = subblocks
;
4470 BLOCK_SUPERCONTEXT (block
) = supercontext
;
4471 BLOCK_CHAIN (block
) = chain
;
4476 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
4478 LOC is the location to use in tree T. */
4481 protected_set_expr_location (tree t
, location_t loc
)
4483 if (t
&& CAN_HAVE_LOCATION_P (t
))
4484 SET_EXPR_LOCATION (t
, loc
);
4487 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
4491 build_decl_attribute_variant (tree ddecl
, tree attribute
)
4493 DECL_ATTRIBUTES (ddecl
) = attribute
;
4497 /* Borrowed from hashtab.c iterative_hash implementation. */
4498 #define mix(a,b,c) \
4500 a -= b; a -= c; a ^= (c>>13); \
4501 b -= c; b -= a; b ^= (a<< 8); \
4502 c -= a; c -= b; c ^= ((b&0xffffffff)>>13); \
4503 a -= b; a -= c; a ^= ((c&0xffffffff)>>12); \
4504 b -= c; b -= a; b = (b ^ (a<<16)) & 0xffffffff; \
4505 c -= a; c -= b; c = (c ^ (b>> 5)) & 0xffffffff; \
4506 a -= b; a -= c; a = (a ^ (c>> 3)) & 0xffffffff; \
4507 b -= c; b -= a; b = (b ^ (a<<10)) & 0xffffffff; \
4508 c -= a; c -= b; c = (c ^ (b>>15)) & 0xffffffff; \
4512 /* Produce good hash value combining VAL and VAL2. */
4514 iterative_hash_hashval_t (hashval_t val
, hashval_t val2
)
4516 /* the golden ratio; an arbitrary value. */
4517 hashval_t a
= 0x9e3779b9;
4523 /* Produce good hash value combining VAL and VAL2. */
4525 iterative_hash_host_wide_int (HOST_WIDE_INT val
, hashval_t val2
)
4527 if (sizeof (HOST_WIDE_INT
) == sizeof (hashval_t
))
4528 return iterative_hash_hashval_t (val
, val2
);
4531 hashval_t a
= (hashval_t
) val
;
4532 /* Avoid warnings about shifting of more than the width of the type on
4533 hosts that won't execute this path. */
4535 hashval_t b
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 8 + zero
));
4537 if (sizeof (HOST_WIDE_INT
) > 2 * sizeof (hashval_t
))
4539 hashval_t a
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 16 + zero
));
4540 hashval_t b
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 24 + zero
));
4547 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4548 is ATTRIBUTE and its qualifiers are QUALS.
4550 Record such modified types already made so we don't make duplicates. */
4553 build_type_attribute_qual_variant (tree ttype
, tree attribute
, int quals
)
4555 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype
), attribute
))
4557 hashval_t hashcode
= 0;
4561 enum tree_code code
= TREE_CODE (ttype
);
4563 /* Building a distinct copy of a tagged type is inappropriate; it
4564 causes breakage in code that expects there to be a one-to-one
4565 relationship between a struct and its fields.
4566 build_duplicate_type is another solution (as used in
4567 handle_transparent_union_attribute), but that doesn't play well
4568 with the stronger C++ type identity model. */
4569 if (TREE_CODE (ttype
) == RECORD_TYPE
4570 || TREE_CODE (ttype
) == UNION_TYPE
4571 || TREE_CODE (ttype
) == QUAL_UNION_TYPE
4572 || TREE_CODE (ttype
) == ENUMERAL_TYPE
)
4574 warning (OPT_Wattributes
,
4575 "ignoring attributes applied to %qT after definition",
4576 TYPE_MAIN_VARIANT (ttype
));
4577 return build_qualified_type (ttype
, quals
);
4580 ttype
= build_qualified_type (ttype
, TYPE_UNQUALIFIED
);
4581 ntype
= build_distinct_type_copy (ttype
);
4583 TYPE_ATTRIBUTES (ntype
) = attribute
;
4585 hashcode
= iterative_hash_object (code
, hashcode
);
4586 if (TREE_TYPE (ntype
))
4587 hashcode
= iterative_hash_object (TYPE_HASH (TREE_TYPE (ntype
)),
4589 hashcode
= attribute_hash_list (attribute
, hashcode
);
4591 switch (TREE_CODE (ntype
))
4594 hashcode
= type_hash_list (TYPE_ARG_TYPES (ntype
), hashcode
);
4597 if (TYPE_DOMAIN (ntype
))
4598 hashcode
= iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (ntype
)),
4602 t
= TYPE_MAX_VALUE (ntype
);
4603 for (i
= 0; i
< TREE_INT_CST_NUNITS (t
); i
++)
4604 hashcode
= iterative_hash_object (TREE_INT_CST_ELT (t
, i
), hashcode
);
4607 case FIXED_POINT_TYPE
:
4609 unsigned int precision
= TYPE_PRECISION (ntype
);
4610 hashcode
= iterative_hash_object (precision
, hashcode
);
4617 ntype
= type_hash_canon (hashcode
, ntype
);
4619 /* If the target-dependent attributes make NTYPE different from
4620 its canonical type, we will need to use structural equality
4621 checks for this type. */
4622 if (TYPE_STRUCTURAL_EQUALITY_P (ttype
)
4623 || !comp_type_attributes (ntype
, ttype
))
4624 SET_TYPE_STRUCTURAL_EQUALITY (ntype
);
4625 else if (TYPE_CANONICAL (ntype
) == ntype
)
4626 TYPE_CANONICAL (ntype
) = TYPE_CANONICAL (ttype
);
4628 ttype
= build_qualified_type (ntype
, quals
);
4630 else if (TYPE_QUALS (ttype
) != quals
)
4631 ttype
= build_qualified_type (ttype
, quals
);
4636 /* Check if "omp declare simd" attribute arguments, CLAUSES1 and CLAUSES2, are
4640 omp_declare_simd_clauses_equal (tree clauses1
, tree clauses2
)
4643 for (cl1
= clauses1
, cl2
= clauses2
;
4645 cl1
= OMP_CLAUSE_CHAIN (cl1
), cl2
= OMP_CLAUSE_CHAIN (cl2
))
4647 if (OMP_CLAUSE_CODE (cl1
) != OMP_CLAUSE_CODE (cl2
))
4649 if (OMP_CLAUSE_CODE (cl1
) != OMP_CLAUSE_SIMDLEN
)
4651 if (simple_cst_equal (OMP_CLAUSE_DECL (cl1
),
4652 OMP_CLAUSE_DECL (cl2
)) != 1)
4655 switch (OMP_CLAUSE_CODE (cl1
))
4657 case OMP_CLAUSE_ALIGNED
:
4658 if (simple_cst_equal (OMP_CLAUSE_ALIGNED_ALIGNMENT (cl1
),
4659 OMP_CLAUSE_ALIGNED_ALIGNMENT (cl2
)) != 1)
4662 case OMP_CLAUSE_LINEAR
:
4663 if (simple_cst_equal (OMP_CLAUSE_LINEAR_STEP (cl1
),
4664 OMP_CLAUSE_LINEAR_STEP (cl2
)) != 1)
4667 case OMP_CLAUSE_SIMDLEN
:
4668 if (simple_cst_equal (OMP_CLAUSE_SIMDLEN_EXPR (cl1
),
4669 OMP_CLAUSE_SIMDLEN_EXPR (cl2
)) != 1)
4678 /* Compare two constructor-element-type constants. Return 1 if the lists
4679 are known to be equal; otherwise return 0. */
4682 simple_cst_list_equal (const_tree l1
, const_tree l2
)
4684 while (l1
!= NULL_TREE
&& l2
!= NULL_TREE
)
4686 if (simple_cst_equal (TREE_VALUE (l1
), TREE_VALUE (l2
)) != 1)
4689 l1
= TREE_CHAIN (l1
);
4690 l2
= TREE_CHAIN (l2
);
4696 /* Compare two attributes for their value identity. Return true if the
4697 attribute values are known to be equal; otherwise return false.
4701 attribute_value_equal (const_tree attr1
, const_tree attr2
)
4703 if (TREE_VALUE (attr1
) == TREE_VALUE (attr2
))
4706 if (TREE_VALUE (attr1
) != NULL_TREE
4707 && TREE_CODE (TREE_VALUE (attr1
)) == TREE_LIST
4708 && TREE_VALUE (attr2
) != NULL
4709 && TREE_CODE (TREE_VALUE (attr2
)) == TREE_LIST
)
4710 return (simple_cst_list_equal (TREE_VALUE (attr1
),
4711 TREE_VALUE (attr2
)) == 1);
4713 if ((flag_openmp
|| flag_openmp_simd
)
4714 && TREE_VALUE (attr1
) && TREE_VALUE (attr2
)
4715 && TREE_CODE (TREE_VALUE (attr1
)) == OMP_CLAUSE
4716 && TREE_CODE (TREE_VALUE (attr2
)) == OMP_CLAUSE
)
4717 return omp_declare_simd_clauses_equal (TREE_VALUE (attr1
),
4718 TREE_VALUE (attr2
));
4720 return (simple_cst_equal (TREE_VALUE (attr1
), TREE_VALUE (attr2
)) == 1);
4723 /* Return 0 if the attributes for two types are incompatible, 1 if they
4724 are compatible, and 2 if they are nearly compatible (which causes a
4725 warning to be generated). */
4727 comp_type_attributes (const_tree type1
, const_tree type2
)
4729 const_tree a1
= TYPE_ATTRIBUTES (type1
);
4730 const_tree a2
= TYPE_ATTRIBUTES (type2
);
4735 for (a
= a1
; a
!= NULL_TREE
; a
= TREE_CHAIN (a
))
4737 const struct attribute_spec
*as
;
4740 as
= lookup_attribute_spec (get_attribute_name (a
));
4741 if (!as
|| as
->affects_type_identity
== false)
4744 attr
= lookup_attribute (as
->name
, CONST_CAST_TREE (a2
));
4745 if (!attr
|| !attribute_value_equal (a
, attr
))
4750 for (a
= a2
; a
!= NULL_TREE
; a
= TREE_CHAIN (a
))
4752 const struct attribute_spec
*as
;
4754 as
= lookup_attribute_spec (get_attribute_name (a
));
4755 if (!as
|| as
->affects_type_identity
== false)
4758 if (!lookup_attribute (as
->name
, CONST_CAST_TREE (a1
)))
4760 /* We don't need to compare trees again, as we did this
4761 already in first loop. */
4763 /* All types - affecting identity - are equal, so
4764 there is no need to call target hook for comparison. */
4768 /* As some type combinations - like default calling-convention - might
4769 be compatible, we have to call the target hook to get the final result. */
4770 return targetm
.comp_type_attributes (type1
, type2
);
4773 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4776 Record such modified types already made so we don't make duplicates. */
4779 build_type_attribute_variant (tree ttype
, tree attribute
)
4781 return build_type_attribute_qual_variant (ttype
, attribute
,
4782 TYPE_QUALS (ttype
));
4786 /* Reset the expression *EXPR_P, a size or position.
4788 ??? We could reset all non-constant sizes or positions. But it's cheap
4789 enough to not do so and refrain from adding workarounds to dwarf2out.c.
4791 We need to reset self-referential sizes or positions because they cannot
4792 be gimplified and thus can contain a CALL_EXPR after the gimplification
4793 is finished, which will run afoul of LTO streaming. And they need to be
4794 reset to something essentially dummy but not constant, so as to preserve
4795 the properties of the object they are attached to. */
4798 free_lang_data_in_one_sizepos (tree
*expr_p
)
4800 tree expr
= *expr_p
;
4801 if (CONTAINS_PLACEHOLDER_P (expr
))
4802 *expr_p
= build0 (PLACEHOLDER_EXPR
, TREE_TYPE (expr
));
4806 /* Reset all the fields in a binfo node BINFO. We only keep
4807 BINFO_VTABLE, which is used by gimple_fold_obj_type_ref. */
4810 free_lang_data_in_binfo (tree binfo
)
4815 gcc_assert (TREE_CODE (binfo
) == TREE_BINFO
);
4817 BINFO_VIRTUALS (binfo
) = NULL_TREE
;
4818 BINFO_BASE_ACCESSES (binfo
) = NULL
;
4819 BINFO_INHERITANCE_CHAIN (binfo
) = NULL_TREE
;
4820 BINFO_SUBVTT_INDEX (binfo
) = NULL_TREE
;
4822 FOR_EACH_VEC_ELT (*BINFO_BASE_BINFOS (binfo
), i
, t
)
4823 free_lang_data_in_binfo (t
);
4827 /* Reset all language specific information still present in TYPE. */
4830 free_lang_data_in_type (tree type
)
4832 gcc_assert (TYPE_P (type
));
4834 /* Give the FE a chance to remove its own data first. */
4835 lang_hooks
.free_lang_data (type
);
4837 TREE_LANG_FLAG_0 (type
) = 0;
4838 TREE_LANG_FLAG_1 (type
) = 0;
4839 TREE_LANG_FLAG_2 (type
) = 0;
4840 TREE_LANG_FLAG_3 (type
) = 0;
4841 TREE_LANG_FLAG_4 (type
) = 0;
4842 TREE_LANG_FLAG_5 (type
) = 0;
4843 TREE_LANG_FLAG_6 (type
) = 0;
4845 if (TREE_CODE (type
) == FUNCTION_TYPE
)
4847 /* Remove the const and volatile qualifiers from arguments. The
4848 C++ front end removes them, but the C front end does not,
4849 leading to false ODR violation errors when merging two
4850 instances of the same function signature compiled by
4851 different front ends. */
4854 for (p
= TYPE_ARG_TYPES (type
); p
; p
= TREE_CHAIN (p
))
4856 tree arg_type
= TREE_VALUE (p
);
4858 if (TYPE_READONLY (arg_type
) || TYPE_VOLATILE (arg_type
))
4860 int quals
= TYPE_QUALS (arg_type
)
4862 & ~TYPE_QUAL_VOLATILE
;
4863 TREE_VALUE (p
) = build_qualified_type (arg_type
, quals
);
4864 free_lang_data_in_type (TREE_VALUE (p
));
4869 /* Remove members that are not actually FIELD_DECLs from the field
4870 list of an aggregate. These occur in C++. */
4871 if (RECORD_OR_UNION_TYPE_P (type
))
4875 /* Note that TYPE_FIELDS can be shared across distinct
4876 TREE_TYPEs. Therefore, if the first field of TYPE_FIELDS is
4877 to be removed, we cannot set its TREE_CHAIN to NULL.
4878 Otherwise, we would not be able to find all the other fields
4879 in the other instances of this TREE_TYPE.
4881 This was causing an ICE in testsuite/g++.dg/lto/20080915.C. */
4883 member
= TYPE_FIELDS (type
);
4886 if (TREE_CODE (member
) == FIELD_DECL
4887 || TREE_CODE (member
) == TYPE_DECL
)
4890 TREE_CHAIN (prev
) = member
;
4892 TYPE_FIELDS (type
) = member
;
4896 member
= TREE_CHAIN (member
);
4900 TREE_CHAIN (prev
) = NULL_TREE
;
4902 TYPE_FIELDS (type
) = NULL_TREE
;
4904 TYPE_METHODS (type
) = NULL_TREE
;
4905 if (TYPE_BINFO (type
))
4906 free_lang_data_in_binfo (TYPE_BINFO (type
));
4910 /* For non-aggregate types, clear out the language slot (which
4911 overloads TYPE_BINFO). */
4912 TYPE_LANG_SLOT_1 (type
) = NULL_TREE
;
4914 if (INTEGRAL_TYPE_P (type
)
4915 || SCALAR_FLOAT_TYPE_P (type
)
4916 || FIXED_POINT_TYPE_P (type
))
4918 free_lang_data_in_one_sizepos (&TYPE_MIN_VALUE (type
));
4919 free_lang_data_in_one_sizepos (&TYPE_MAX_VALUE (type
));
4923 free_lang_data_in_one_sizepos (&TYPE_SIZE (type
));
4924 free_lang_data_in_one_sizepos (&TYPE_SIZE_UNIT (type
));
4926 if (TYPE_CONTEXT (type
)
4927 && TREE_CODE (TYPE_CONTEXT (type
)) == BLOCK
)
4929 tree ctx
= TYPE_CONTEXT (type
);
4932 ctx
= BLOCK_SUPERCONTEXT (ctx
);
4934 while (ctx
&& TREE_CODE (ctx
) == BLOCK
);
4935 TYPE_CONTEXT (type
) = ctx
;
4940 /* Return true if DECL may need an assembler name to be set. */
4943 need_assembler_name_p (tree decl
)
4945 /* Only FUNCTION_DECLs and VAR_DECLs are considered. */
4946 if (TREE_CODE (decl
) != FUNCTION_DECL
4947 && TREE_CODE (decl
) != VAR_DECL
)
4950 /* If DECL already has its assembler name set, it does not need a
4952 if (!HAS_DECL_ASSEMBLER_NAME_P (decl
)
4953 || DECL_ASSEMBLER_NAME_SET_P (decl
))
4956 /* Abstract decls do not need an assembler name. */
4957 if (DECL_ABSTRACT (decl
))
4960 /* For VAR_DECLs, only static, public and external symbols need an
4962 if (TREE_CODE (decl
) == VAR_DECL
4963 && !TREE_STATIC (decl
)
4964 && !TREE_PUBLIC (decl
)
4965 && !DECL_EXTERNAL (decl
))
4968 if (TREE_CODE (decl
) == FUNCTION_DECL
)
4970 /* Do not set assembler name on builtins. Allow RTL expansion to
4971 decide whether to expand inline or via a regular call. */
4972 if (DECL_BUILT_IN (decl
)
4973 && DECL_BUILT_IN_CLASS (decl
) != BUILT_IN_FRONTEND
)
4976 /* Functions represented in the callgraph need an assembler name. */
4977 if (cgraph_get_node (decl
) != NULL
)
4980 /* Unused and not public functions don't need an assembler name. */
4981 if (!TREE_USED (decl
) && !TREE_PUBLIC (decl
))
4989 /* Reset all language specific information still present in symbol
4993 free_lang_data_in_decl (tree decl
)
4995 gcc_assert (DECL_P (decl
));
4997 /* Give the FE a chance to remove its own data first. */
4998 lang_hooks
.free_lang_data (decl
);
5000 TREE_LANG_FLAG_0 (decl
) = 0;
5001 TREE_LANG_FLAG_1 (decl
) = 0;
5002 TREE_LANG_FLAG_2 (decl
) = 0;
5003 TREE_LANG_FLAG_3 (decl
) = 0;
5004 TREE_LANG_FLAG_4 (decl
) = 0;
5005 TREE_LANG_FLAG_5 (decl
) = 0;
5006 TREE_LANG_FLAG_6 (decl
) = 0;
5008 free_lang_data_in_one_sizepos (&DECL_SIZE (decl
));
5009 free_lang_data_in_one_sizepos (&DECL_SIZE_UNIT (decl
));
5010 if (TREE_CODE (decl
) == FIELD_DECL
)
5012 free_lang_data_in_one_sizepos (&DECL_FIELD_OFFSET (decl
));
5013 if (TREE_CODE (DECL_CONTEXT (decl
)) == QUAL_UNION_TYPE
)
5014 DECL_QUALIFIER (decl
) = NULL_TREE
;
5017 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5019 struct cgraph_node
*node
;
5020 if (!(node
= cgraph_get_node (decl
))
5021 || (!node
->definition
&& !node
->clones
))
5024 cgraph_release_function_body (node
);
5027 release_function_body (decl
);
5028 DECL_ARGUMENTS (decl
) = NULL
;
5029 DECL_RESULT (decl
) = NULL
;
5030 DECL_INITIAL (decl
) = error_mark_node
;
5033 if (gimple_has_body_p (decl
))
5037 /* If DECL has a gimple body, then the context for its
5038 arguments must be DECL. Otherwise, it doesn't really
5039 matter, as we will not be emitting any code for DECL. In
5040 general, there may be other instances of DECL created by
5041 the front end and since PARM_DECLs are generally shared,
5042 their DECL_CONTEXT changes as the replicas of DECL are
5043 created. The only time where DECL_CONTEXT is important
5044 is for the FUNCTION_DECLs that have a gimple body (since
5045 the PARM_DECL will be used in the function's body). */
5046 for (t
= DECL_ARGUMENTS (decl
); t
; t
= TREE_CHAIN (t
))
5047 DECL_CONTEXT (t
) = decl
;
5050 /* DECL_SAVED_TREE holds the GENERIC representation for DECL.
5051 At this point, it is not needed anymore. */
5052 DECL_SAVED_TREE (decl
) = NULL_TREE
;
5054 /* Clear the abstract origin if it refers to a method. Otherwise
5055 dwarf2out.c will ICE as we clear TYPE_METHODS and thus the
5056 origin will not be output correctly. */
5057 if (DECL_ABSTRACT_ORIGIN (decl
)
5058 && DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))
5059 && RECORD_OR_UNION_TYPE_P
5060 (DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))))
5061 DECL_ABSTRACT_ORIGIN (decl
) = NULL_TREE
;
5063 /* Sometimes the C++ frontend doesn't manage to transform a temporary
5064 DECL_VINDEX referring to itself into a vtable slot number as it
5065 should. Happens with functions that are copied and then forgotten
5066 about. Just clear it, it won't matter anymore. */
5067 if (DECL_VINDEX (decl
) && !tree_fits_shwi_p (DECL_VINDEX (decl
)))
5068 DECL_VINDEX (decl
) = NULL_TREE
;
5070 else if (TREE_CODE (decl
) == VAR_DECL
)
5072 if ((DECL_EXTERNAL (decl
)
5073 && (!TREE_STATIC (decl
) || !TREE_READONLY (decl
)))
5074 || (decl_function_context (decl
) && !TREE_STATIC (decl
)))
5075 DECL_INITIAL (decl
) = NULL_TREE
;
5077 else if (TREE_CODE (decl
) == TYPE_DECL
5078 || TREE_CODE (decl
) == FIELD_DECL
)
5079 DECL_INITIAL (decl
) = NULL_TREE
;
5080 else if (TREE_CODE (decl
) == TRANSLATION_UNIT_DECL
5081 && DECL_INITIAL (decl
)
5082 && TREE_CODE (DECL_INITIAL (decl
)) == BLOCK
)
5084 /* Strip builtins from the translation-unit BLOCK. We still have targets
5085 without builtin_decl_explicit support and also builtins are shared
5086 nodes and thus we can't use TREE_CHAIN in multiple lists. */
5087 tree
*nextp
= &BLOCK_VARS (DECL_INITIAL (decl
));
5091 if (TREE_CODE (var
) == FUNCTION_DECL
5092 && DECL_BUILT_IN (var
))
5093 *nextp
= TREE_CHAIN (var
);
5095 nextp
= &TREE_CHAIN (var
);
5101 /* Data used when collecting DECLs and TYPEs for language data removal. */
5103 struct free_lang_data_d
5105 /* Worklist to avoid excessive recursion. */
5108 /* Set of traversed objects. Used to avoid duplicate visits. */
5109 struct pointer_set_t
*pset
;
5111 /* Array of symbols to process with free_lang_data_in_decl. */
5114 /* Array of types to process with free_lang_data_in_type. */
5119 /* Save all language fields needed to generate proper debug information
5120 for DECL. This saves most fields cleared out by free_lang_data_in_decl. */
5123 save_debug_info_for_decl (tree t
)
5125 /*struct saved_debug_info_d *sdi;*/
5127 gcc_assert (debug_info_level
> DINFO_LEVEL_TERSE
&& t
&& DECL_P (t
));
5129 /* FIXME. Partial implementation for saving debug info removed. */
5133 /* Save all language fields needed to generate proper debug information
5134 for TYPE. This saves most fields cleared out by free_lang_data_in_type. */
5137 save_debug_info_for_type (tree t
)
5139 /*struct saved_debug_info_d *sdi;*/
5141 gcc_assert (debug_info_level
> DINFO_LEVEL_TERSE
&& t
&& TYPE_P (t
));
5143 /* FIXME. Partial implementation for saving debug info removed. */
5147 /* Add type or decl T to one of the list of tree nodes that need their
5148 language data removed. The lists are held inside FLD. */
5151 add_tree_to_fld_list (tree t
, struct free_lang_data_d
*fld
)
5155 fld
->decls
.safe_push (t
);
5156 if (debug_info_level
> DINFO_LEVEL_TERSE
)
5157 save_debug_info_for_decl (t
);
5159 else if (TYPE_P (t
))
5161 fld
->types
.safe_push (t
);
5162 if (debug_info_level
> DINFO_LEVEL_TERSE
)
5163 save_debug_info_for_type (t
);
5169 /* Push tree node T into FLD->WORKLIST. */
5172 fld_worklist_push (tree t
, struct free_lang_data_d
*fld
)
5174 if (t
&& !is_lang_specific (t
) && !pointer_set_contains (fld
->pset
, t
))
5175 fld
->worklist
.safe_push ((t
));
5179 /* Operand callback helper for free_lang_data_in_node. *TP is the
5180 subtree operand being considered. */
5183 find_decls_types_r (tree
*tp
, int *ws
, void *data
)
5186 struct free_lang_data_d
*fld
= (struct free_lang_data_d
*) data
;
5188 if (TREE_CODE (t
) == TREE_LIST
)
5191 /* Language specific nodes will be removed, so there is no need
5192 to gather anything under them. */
5193 if (is_lang_specific (t
))
5201 /* Note that walk_tree does not traverse every possible field in
5202 decls, so we have to do our own traversals here. */
5203 add_tree_to_fld_list (t
, fld
);
5205 fld_worklist_push (DECL_NAME (t
), fld
);
5206 fld_worklist_push (DECL_CONTEXT (t
), fld
);
5207 fld_worklist_push (DECL_SIZE (t
), fld
);
5208 fld_worklist_push (DECL_SIZE_UNIT (t
), fld
);
5210 /* We are going to remove everything under DECL_INITIAL for
5211 TYPE_DECLs. No point walking them. */
5212 if (TREE_CODE (t
) != TYPE_DECL
)
5213 fld_worklist_push (DECL_INITIAL (t
), fld
);
5215 fld_worklist_push (DECL_ATTRIBUTES (t
), fld
);
5216 fld_worklist_push (DECL_ABSTRACT_ORIGIN (t
), fld
);
5218 if (TREE_CODE (t
) == FUNCTION_DECL
)
5220 fld_worklist_push (DECL_ARGUMENTS (t
), fld
);
5221 fld_worklist_push (DECL_RESULT (t
), fld
);
5223 else if (TREE_CODE (t
) == TYPE_DECL
)
5225 fld_worklist_push (DECL_ARGUMENT_FLD (t
), fld
);
5226 fld_worklist_push (DECL_VINDEX (t
), fld
);
5227 fld_worklist_push (DECL_ORIGINAL_TYPE (t
), fld
);
5229 else if (TREE_CODE (t
) == FIELD_DECL
)
5231 fld_worklist_push (DECL_FIELD_OFFSET (t
), fld
);
5232 fld_worklist_push (DECL_BIT_FIELD_TYPE (t
), fld
);
5233 fld_worklist_push (DECL_FIELD_BIT_OFFSET (t
), fld
);
5234 fld_worklist_push (DECL_FCONTEXT (t
), fld
);
5236 else if (TREE_CODE (t
) == VAR_DECL
)
5238 fld_worklist_push (DECL_SECTION_NAME (t
), fld
);
5239 fld_worklist_push (DECL_COMDAT_GROUP (t
), fld
);
5242 if ((TREE_CODE (t
) == VAR_DECL
|| TREE_CODE (t
) == PARM_DECL
)
5243 && DECL_HAS_VALUE_EXPR_P (t
))
5244 fld_worklist_push (DECL_VALUE_EXPR (t
), fld
);
5246 if (TREE_CODE (t
) != FIELD_DECL
5247 && TREE_CODE (t
) != TYPE_DECL
)
5248 fld_worklist_push (TREE_CHAIN (t
), fld
);
5251 else if (TYPE_P (t
))
5253 /* Note that walk_tree does not traverse every possible field in
5254 types, so we have to do our own traversals here. */
5255 add_tree_to_fld_list (t
, fld
);
5257 if (!RECORD_OR_UNION_TYPE_P (t
))
5258 fld_worklist_push (TYPE_CACHED_VALUES (t
), fld
);
5259 fld_worklist_push (TYPE_SIZE (t
), fld
);
5260 fld_worklist_push (TYPE_SIZE_UNIT (t
), fld
);
5261 fld_worklist_push (TYPE_ATTRIBUTES (t
), fld
);
5262 fld_worklist_push (TYPE_POINTER_TO (t
), fld
);
5263 fld_worklist_push (TYPE_REFERENCE_TO (t
), fld
);
5264 fld_worklist_push (TYPE_NAME (t
), fld
);
5265 /* Do not walk TYPE_NEXT_PTR_TO or TYPE_NEXT_REF_TO. We do not stream
5266 them and thus do not and want not to reach unused pointer types
5268 if (!POINTER_TYPE_P (t
))
5269 fld_worklist_push (TYPE_MINVAL (t
), fld
);
5270 if (!RECORD_OR_UNION_TYPE_P (t
))
5271 fld_worklist_push (TYPE_MAXVAL (t
), fld
);
5272 fld_worklist_push (TYPE_MAIN_VARIANT (t
), fld
);
5273 /* Do not walk TYPE_NEXT_VARIANT. We do not stream it and thus
5274 do not and want not to reach unused variants this way. */
5275 if (TYPE_CONTEXT (t
))
5277 tree ctx
= TYPE_CONTEXT (t
);
5278 /* We adjust BLOCK TYPE_CONTEXTs to the innermost non-BLOCK one.
5279 So push that instead. */
5280 while (ctx
&& TREE_CODE (ctx
) == BLOCK
)
5281 ctx
= BLOCK_SUPERCONTEXT (ctx
);
5282 fld_worklist_push (ctx
, fld
);
5284 /* Do not walk TYPE_CANONICAL. We do not stream it and thus do not
5285 and want not to reach unused types this way. */
5287 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_BINFO (t
))
5291 FOR_EACH_VEC_ELT (*BINFO_BASE_BINFOS (TYPE_BINFO (t
)), i
, tem
)
5292 fld_worklist_push (TREE_TYPE (tem
), fld
);
5293 tem
= BINFO_VIRTUALS (TYPE_BINFO (t
));
5295 /* The Java FE overloads BINFO_VIRTUALS for its own purpose. */
5296 && TREE_CODE (tem
) == TREE_LIST
)
5299 fld_worklist_push (TREE_VALUE (tem
), fld
);
5300 tem
= TREE_CHAIN (tem
);
5304 if (RECORD_OR_UNION_TYPE_P (t
))
5307 /* Push all TYPE_FIELDS - there can be interleaving interesting
5308 and non-interesting things. */
5309 tem
= TYPE_FIELDS (t
);
5312 if (TREE_CODE (tem
) == FIELD_DECL
5313 || TREE_CODE (tem
) == TYPE_DECL
)
5314 fld_worklist_push (tem
, fld
);
5315 tem
= TREE_CHAIN (tem
);
5319 fld_worklist_push (TYPE_STUB_DECL (t
), fld
);
5322 else if (TREE_CODE (t
) == BLOCK
)
5325 for (tem
= BLOCK_VARS (t
); tem
; tem
= TREE_CHAIN (tem
))
5326 fld_worklist_push (tem
, fld
);
5327 for (tem
= BLOCK_SUBBLOCKS (t
); tem
; tem
= BLOCK_CHAIN (tem
))
5328 fld_worklist_push (tem
, fld
);
5329 fld_worklist_push (BLOCK_ABSTRACT_ORIGIN (t
), fld
);
5332 if (TREE_CODE (t
) != IDENTIFIER_NODE
5333 && CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_TYPED
))
5334 fld_worklist_push (TREE_TYPE (t
), fld
);
5340 /* Find decls and types in T. */
5343 find_decls_types (tree t
, struct free_lang_data_d
*fld
)
5347 if (!pointer_set_contains (fld
->pset
, t
))
5348 walk_tree (&t
, find_decls_types_r
, fld
, fld
->pset
);
5349 if (fld
->worklist
.is_empty ())
5351 t
= fld
->worklist
.pop ();
5355 /* Translate all the types in LIST with the corresponding runtime
5359 get_eh_types_for_runtime (tree list
)
5363 if (list
== NULL_TREE
)
5366 head
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
5368 list
= TREE_CHAIN (list
);
5371 tree n
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
5372 TREE_CHAIN (prev
) = n
;
5373 prev
= TREE_CHAIN (prev
);
5374 list
= TREE_CHAIN (list
);
5381 /* Find decls and types referenced in EH region R and store them in
5382 FLD->DECLS and FLD->TYPES. */
5385 find_decls_types_in_eh_region (eh_region r
, struct free_lang_data_d
*fld
)
5396 /* The types referenced in each catch must first be changed to the
5397 EH types used at runtime. This removes references to FE types
5399 for (c
= r
->u
.eh_try
.first_catch
; c
; c
= c
->next_catch
)
5401 c
->type_list
= get_eh_types_for_runtime (c
->type_list
);
5402 walk_tree (&c
->type_list
, find_decls_types_r
, fld
, fld
->pset
);
5407 case ERT_ALLOWED_EXCEPTIONS
:
5408 r
->u
.allowed
.type_list
5409 = get_eh_types_for_runtime (r
->u
.allowed
.type_list
);
5410 walk_tree (&r
->u
.allowed
.type_list
, find_decls_types_r
, fld
, fld
->pset
);
5413 case ERT_MUST_NOT_THROW
:
5414 walk_tree (&r
->u
.must_not_throw
.failure_decl
,
5415 find_decls_types_r
, fld
, fld
->pset
);
5421 /* Find decls and types referenced in cgraph node N and store them in
5422 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
5423 look for *every* kind of DECL and TYPE node reachable from N,
5424 including those embedded inside types and decls (i.e,, TYPE_DECLs,
5425 NAMESPACE_DECLs, etc). */
5428 find_decls_types_in_node (struct cgraph_node
*n
, struct free_lang_data_d
*fld
)
5431 struct function
*fn
;
5435 find_decls_types (n
->decl
, fld
);
5437 if (!gimple_has_body_p (n
->decl
))
5440 gcc_assert (current_function_decl
== NULL_TREE
&& cfun
== NULL
);
5442 fn
= DECL_STRUCT_FUNCTION (n
->decl
);
5444 /* Traverse locals. */
5445 FOR_EACH_LOCAL_DECL (fn
, ix
, t
)
5446 find_decls_types (t
, fld
);
5448 /* Traverse EH regions in FN. */
5451 FOR_ALL_EH_REGION_FN (r
, fn
)
5452 find_decls_types_in_eh_region (r
, fld
);
5455 /* Traverse every statement in FN. */
5456 FOR_EACH_BB_FN (bb
, fn
)
5458 gimple_stmt_iterator si
;
5461 for (si
= gsi_start_phis (bb
); !gsi_end_p (si
); gsi_next (&si
))
5463 gimple phi
= gsi_stmt (si
);
5465 for (i
= 0; i
< gimple_phi_num_args (phi
); i
++)
5467 tree
*arg_p
= gimple_phi_arg_def_ptr (phi
, i
);
5468 find_decls_types (*arg_p
, fld
);
5472 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
5474 gimple stmt
= gsi_stmt (si
);
5476 if (is_gimple_call (stmt
))
5477 find_decls_types (gimple_call_fntype (stmt
), fld
);
5479 for (i
= 0; i
< gimple_num_ops (stmt
); i
++)
5481 tree arg
= gimple_op (stmt
, i
);
5482 find_decls_types (arg
, fld
);
5489 /* Find decls and types referenced in varpool node N and store them in
5490 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
5491 look for *every* kind of DECL and TYPE node reachable from N,
5492 including those embedded inside types and decls (i.e,, TYPE_DECLs,
5493 NAMESPACE_DECLs, etc). */
5496 find_decls_types_in_var (varpool_node
*v
, struct free_lang_data_d
*fld
)
5498 find_decls_types (v
->decl
, fld
);
5501 /* If T needs an assembler name, have one created for it. */
5504 assign_assembler_name_if_neeeded (tree t
)
5506 if (need_assembler_name_p (t
))
5508 /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit
5509 diagnostics that use input_location to show locus
5510 information. The problem here is that, at this point,
5511 input_location is generally anchored to the end of the file
5512 (since the parser is long gone), so we don't have a good
5513 position to pin it to.
5515 To alleviate this problem, this uses the location of T's
5516 declaration. Examples of this are
5517 testsuite/g++.dg/template/cond2.C and
5518 testsuite/g++.dg/template/pr35240.C. */
5519 location_t saved_location
= input_location
;
5520 input_location
= DECL_SOURCE_LOCATION (t
);
5522 decl_assembler_name (t
);
5524 input_location
= saved_location
;
5529 /* Free language specific information for every operand and expression
5530 in every node of the call graph. This process operates in three stages:
5532 1- Every callgraph node and varpool node is traversed looking for
5533 decls and types embedded in them. This is a more exhaustive
5534 search than that done by find_referenced_vars, because it will
5535 also collect individual fields, decls embedded in types, etc.
5537 2- All the decls found are sent to free_lang_data_in_decl.
5539 3- All the types found are sent to free_lang_data_in_type.
5541 The ordering between decls and types is important because
5542 free_lang_data_in_decl sets assembler names, which includes
5543 mangling. So types cannot be freed up until assembler names have
5547 free_lang_data_in_cgraph (void)
5549 struct cgraph_node
*n
;
5551 struct free_lang_data_d fld
;
5556 /* Initialize sets and arrays to store referenced decls and types. */
5557 fld
.pset
= pointer_set_create ();
5558 fld
.worklist
.create (0);
5559 fld
.decls
.create (100);
5560 fld
.types
.create (100);
5562 /* Find decls and types in the body of every function in the callgraph. */
5563 FOR_EACH_FUNCTION (n
)
5564 find_decls_types_in_node (n
, &fld
);
5566 FOR_EACH_VEC_SAFE_ELT (alias_pairs
, i
, p
)
5567 find_decls_types (p
->decl
, &fld
);
5569 /* Find decls and types in every varpool symbol. */
5570 FOR_EACH_VARIABLE (v
)
5571 find_decls_types_in_var (v
, &fld
);
5573 /* Set the assembler name on every decl found. We need to do this
5574 now because free_lang_data_in_decl will invalidate data needed
5575 for mangling. This breaks mangling on interdependent decls. */
5576 FOR_EACH_VEC_ELT (fld
.decls
, i
, t
)
5577 assign_assembler_name_if_neeeded (t
);
5579 /* Traverse every decl found freeing its language data. */
5580 FOR_EACH_VEC_ELT (fld
.decls
, i
, t
)
5581 free_lang_data_in_decl (t
);
5583 /* Traverse every type found freeing its language data. */
5584 FOR_EACH_VEC_ELT (fld
.types
, i
, t
)
5585 free_lang_data_in_type (t
);
5587 pointer_set_destroy (fld
.pset
);
5588 fld
.worklist
.release ();
5589 fld
.decls
.release ();
5590 fld
.types
.release ();
5594 /* Free resources that are used by FE but are not needed once they are done. */
5597 free_lang_data (void)
5601 /* If we are the LTO frontend we have freed lang-specific data already. */
5603 || !flag_generate_lto
)
5606 /* Allocate and assign alias sets to the standard integer types
5607 while the slots are still in the way the frontends generated them. */
5608 for (i
= 0; i
< itk_none
; ++i
)
5609 if (integer_types
[i
])
5610 TYPE_ALIAS_SET (integer_types
[i
]) = get_alias_set (integer_types
[i
]);
5612 /* Traverse the IL resetting language specific information for
5613 operands, expressions, etc. */
5614 free_lang_data_in_cgraph ();
5616 /* Create gimple variants for common types. */
5617 ptrdiff_type_node
= integer_type_node
;
5618 fileptr_type_node
= ptr_type_node
;
5620 /* Reset some langhooks. Do not reset types_compatible_p, it may
5621 still be used indirectly via the get_alias_set langhook. */
5622 lang_hooks
.dwarf_name
= lhd_dwarf_name
;
5623 lang_hooks
.decl_printable_name
= gimple_decl_printable_name
;
5624 /* We do not want the default decl_assembler_name implementation,
5625 rather if we have fixed everything we want a wrapper around it
5626 asserting that all non-local symbols already got their assembler
5627 name and only produce assembler names for local symbols. Or rather
5628 make sure we never call decl_assembler_name on local symbols and
5629 devise a separate, middle-end private scheme for it. */
5631 /* Reset diagnostic machinery. */
5632 tree_diagnostics_defaults (global_dc
);
5640 const pass_data pass_data_ipa_free_lang_data
=
5642 SIMPLE_IPA_PASS
, /* type */
5643 "*free_lang_data", /* name */
5644 OPTGROUP_NONE
, /* optinfo_flags */
5645 true, /* has_execute */
5646 TV_IPA_FREE_LANG_DATA
, /* tv_id */
5647 0, /* properties_required */
5648 0, /* properties_provided */
5649 0, /* properties_destroyed */
5650 0, /* todo_flags_start */
5651 0, /* todo_flags_finish */
5654 class pass_ipa_free_lang_data
: public simple_ipa_opt_pass
5657 pass_ipa_free_lang_data (gcc::context
*ctxt
)
5658 : simple_ipa_opt_pass (pass_data_ipa_free_lang_data
, ctxt
)
5661 /* opt_pass methods: */
5662 virtual unsigned int execute (function
*) { return free_lang_data (); }
5664 }; // class pass_ipa_free_lang_data
5668 simple_ipa_opt_pass
*
5669 make_pass_ipa_free_lang_data (gcc::context
*ctxt
)
5671 return new pass_ipa_free_lang_data (ctxt
);
5674 /* The backbone of is_attribute_p(). ATTR_LEN is the string length of
5675 ATTR_NAME. Also used internally by remove_attribute(). */
5677 private_is_attribute_p (const char *attr_name
, size_t attr_len
, const_tree ident
)
5679 size_t ident_len
= IDENTIFIER_LENGTH (ident
);
5681 if (ident_len
== attr_len
)
5683 if (strcmp (attr_name
, IDENTIFIER_POINTER (ident
)) == 0)
5686 else if (ident_len
== attr_len
+ 4)
5688 /* There is the possibility that ATTR is 'text' and IDENT is
5690 const char *p
= IDENTIFIER_POINTER (ident
);
5691 if (p
[0] == '_' && p
[1] == '_'
5692 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
5693 && strncmp (attr_name
, p
+ 2, attr_len
) == 0)
5700 /* The backbone of lookup_attribute(). ATTR_LEN is the string length
5701 of ATTR_NAME, and LIST is not NULL_TREE. */
5703 private_lookup_attribute (const char *attr_name
, size_t attr_len
, tree list
)
5707 size_t ident_len
= IDENTIFIER_LENGTH (get_attribute_name (list
));
5709 if (ident_len
== attr_len
)
5711 if (!strcmp (attr_name
,
5712 IDENTIFIER_POINTER (get_attribute_name (list
))))
5715 /* TODO: If we made sure that attributes were stored in the
5716 canonical form without '__...__' (ie, as in 'text' as opposed
5717 to '__text__') then we could avoid the following case. */
5718 else if (ident_len
== attr_len
+ 4)
5720 const char *p
= IDENTIFIER_POINTER (get_attribute_name (list
));
5721 if (p
[0] == '_' && p
[1] == '_'
5722 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
5723 && strncmp (attr_name
, p
+ 2, attr_len
) == 0)
5726 list
= TREE_CHAIN (list
);
5732 /* A variant of lookup_attribute() that can be used with an identifier
5733 as the first argument, and where the identifier can be either
5734 'text' or '__text__'.
5736 Given an attribute ATTR_IDENTIFIER, and a list of attributes LIST,
5737 return a pointer to the attribute's list element if the attribute
5738 is part of the list, or NULL_TREE if not found. If the attribute
5739 appears more than once, this only returns the first occurrence; the
5740 TREE_CHAIN of the return value should be passed back in if further
5741 occurrences are wanted. ATTR_IDENTIFIER must be an identifier but
5742 can be in the form 'text' or '__text__'. */
5744 lookup_ident_attribute (tree attr_identifier
, tree list
)
5746 gcc_checking_assert (TREE_CODE (attr_identifier
) == IDENTIFIER_NODE
);
5750 gcc_checking_assert (TREE_CODE (get_attribute_name (list
))
5751 == IDENTIFIER_NODE
);
5753 /* Identifiers can be compared directly for equality. */
5754 if (attr_identifier
== get_attribute_name (list
))
5757 /* If they are not equal, they may still be one in the form
5758 'text' while the other one is in the form '__text__'. TODO:
5759 If we were storing attributes in normalized 'text' form, then
5760 this could all go away and we could take full advantage of
5761 the fact that we're comparing identifiers. :-) */
5763 size_t attr_len
= IDENTIFIER_LENGTH (attr_identifier
);
5764 size_t ident_len
= IDENTIFIER_LENGTH (get_attribute_name (list
));
5766 if (ident_len
== attr_len
+ 4)
5768 const char *p
= IDENTIFIER_POINTER (get_attribute_name (list
));
5769 const char *q
= IDENTIFIER_POINTER (attr_identifier
);
5770 if (p
[0] == '_' && p
[1] == '_'
5771 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
5772 && strncmp (q
, p
+ 2, attr_len
) == 0)
5775 else if (ident_len
+ 4 == attr_len
)
5777 const char *p
= IDENTIFIER_POINTER (get_attribute_name (list
));
5778 const char *q
= IDENTIFIER_POINTER (attr_identifier
);
5779 if (q
[0] == '_' && q
[1] == '_'
5780 && q
[attr_len
- 2] == '_' && q
[attr_len
- 1] == '_'
5781 && strncmp (q
+ 2, p
, ident_len
) == 0)
5785 list
= TREE_CHAIN (list
);
5791 /* Remove any instances of attribute ATTR_NAME in LIST and return the
5795 remove_attribute (const char *attr_name
, tree list
)
5798 size_t attr_len
= strlen (attr_name
);
5800 gcc_checking_assert (attr_name
[0] != '_');
5802 for (p
= &list
; *p
; )
5805 /* TODO: If we were storing attributes in normalized form, here
5806 we could use a simple strcmp(). */
5807 if (private_is_attribute_p (attr_name
, attr_len
, get_attribute_name (l
)))
5808 *p
= TREE_CHAIN (l
);
5810 p
= &TREE_CHAIN (l
);
5816 /* Return an attribute list that is the union of a1 and a2. */
5819 merge_attributes (tree a1
, tree a2
)
5823 /* Either one unset? Take the set one. */
5825 if ((attributes
= a1
) == 0)
5828 /* One that completely contains the other? Take it. */
5830 else if (a2
!= 0 && ! attribute_list_contained (a1
, a2
))
5832 if (attribute_list_contained (a2
, a1
))
5836 /* Pick the longest list, and hang on the other list. */
5838 if (list_length (a1
) < list_length (a2
))
5839 attributes
= a2
, a2
= a1
;
5841 for (; a2
!= 0; a2
= TREE_CHAIN (a2
))
5844 for (a
= lookup_ident_attribute (get_attribute_name (a2
),
5846 a
!= NULL_TREE
&& !attribute_value_equal (a
, a2
);
5847 a
= lookup_ident_attribute (get_attribute_name (a2
),
5852 a1
= copy_node (a2
);
5853 TREE_CHAIN (a1
) = attributes
;
5862 /* Given types T1 and T2, merge their attributes and return
5866 merge_type_attributes (tree t1
, tree t2
)
5868 return merge_attributes (TYPE_ATTRIBUTES (t1
),
5869 TYPE_ATTRIBUTES (t2
));
5872 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
5876 merge_decl_attributes (tree olddecl
, tree newdecl
)
5878 return merge_attributes (DECL_ATTRIBUTES (olddecl
),
5879 DECL_ATTRIBUTES (newdecl
));
5882 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
5884 /* Specialization of merge_decl_attributes for various Windows targets.
5886 This handles the following situation:
5888 __declspec (dllimport) int foo;
5891 The second instance of `foo' nullifies the dllimport. */
5894 merge_dllimport_decl_attributes (tree old
, tree new_tree
)
5897 int delete_dllimport_p
= 1;
5899 /* What we need to do here is remove from `old' dllimport if it doesn't
5900 appear in `new'. dllimport behaves like extern: if a declaration is
5901 marked dllimport and a definition appears later, then the object
5902 is not dllimport'd. We also remove a `new' dllimport if the old list
5903 contains dllexport: dllexport always overrides dllimport, regardless
5904 of the order of declaration. */
5905 if (!VAR_OR_FUNCTION_DECL_P (new_tree
))
5906 delete_dllimport_p
= 0;
5907 else if (DECL_DLLIMPORT_P (new_tree
)
5908 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (old
)))
5910 DECL_DLLIMPORT_P (new_tree
) = 0;
5911 warning (OPT_Wattributes
, "%q+D already declared with dllexport attribute: "
5912 "dllimport ignored", new_tree
);
5914 else if (DECL_DLLIMPORT_P (old
) && !DECL_DLLIMPORT_P (new_tree
))
5916 /* Warn about overriding a symbol that has already been used, e.g.:
5917 extern int __attribute__ ((dllimport)) foo;
5918 int* bar () {return &foo;}
5921 if (TREE_USED (old
))
5923 warning (0, "%q+D redeclared without dllimport attribute "
5924 "after being referenced with dll linkage", new_tree
);
5925 /* If we have used a variable's address with dllimport linkage,
5926 keep the old DECL_DLLIMPORT_P flag: the ADDR_EXPR using the
5927 decl may already have had TREE_CONSTANT computed.
5928 We still remove the attribute so that assembler code refers
5929 to '&foo rather than '_imp__foo'. */
5930 if (TREE_CODE (old
) == VAR_DECL
&& TREE_ADDRESSABLE (old
))
5931 DECL_DLLIMPORT_P (new_tree
) = 1;
5934 /* Let an inline definition silently override the external reference,
5935 but otherwise warn about attribute inconsistency. */
5936 else if (TREE_CODE (new_tree
) == VAR_DECL
5937 || !DECL_DECLARED_INLINE_P (new_tree
))
5938 warning (OPT_Wattributes
, "%q+D redeclared without dllimport attribute: "
5939 "previous dllimport ignored", new_tree
);
5942 delete_dllimport_p
= 0;
5944 a
= merge_attributes (DECL_ATTRIBUTES (old
), DECL_ATTRIBUTES (new_tree
));
5946 if (delete_dllimport_p
)
5947 a
= remove_attribute ("dllimport", a
);
5952 /* Handle a "dllimport" or "dllexport" attribute; arguments as in
5953 struct attribute_spec.handler. */
5956 handle_dll_attribute (tree
* pnode
, tree name
, tree args
, int flags
,
5962 /* These attributes may apply to structure and union types being created,
5963 but otherwise should pass to the declaration involved. */
5966 if (flags
& ((int) ATTR_FLAG_DECL_NEXT
| (int) ATTR_FLAG_FUNCTION_NEXT
5967 | (int) ATTR_FLAG_ARRAY_NEXT
))
5969 *no_add_attrs
= true;
5970 return tree_cons (name
, args
, NULL_TREE
);
5972 if (TREE_CODE (node
) == RECORD_TYPE
5973 || TREE_CODE (node
) == UNION_TYPE
)
5975 node
= TYPE_NAME (node
);
5981 warning (OPT_Wattributes
, "%qE attribute ignored",
5983 *no_add_attrs
= true;
5988 if (TREE_CODE (node
) != FUNCTION_DECL
5989 && TREE_CODE (node
) != VAR_DECL
5990 && TREE_CODE (node
) != TYPE_DECL
)
5992 *no_add_attrs
= true;
5993 warning (OPT_Wattributes
, "%qE attribute ignored",
5998 if (TREE_CODE (node
) == TYPE_DECL
5999 && TREE_CODE (TREE_TYPE (node
)) != RECORD_TYPE
6000 && TREE_CODE (TREE_TYPE (node
)) != UNION_TYPE
)
6002 *no_add_attrs
= true;
6003 warning (OPT_Wattributes
, "%qE attribute ignored",
6008 is_dllimport
= is_attribute_p ("dllimport", name
);
6010 /* Report error on dllimport ambiguities seen now before they cause
6014 /* Honor any target-specific overrides. */
6015 if (!targetm
.valid_dllimport_attribute_p (node
))
6016 *no_add_attrs
= true;
6018 else if (TREE_CODE (node
) == FUNCTION_DECL
6019 && DECL_DECLARED_INLINE_P (node
))
6021 warning (OPT_Wattributes
, "inline function %q+D declared as "
6022 " dllimport: attribute ignored", node
);
6023 *no_add_attrs
= true;
6025 /* Like MS, treat definition of dllimported variables and
6026 non-inlined functions on declaration as syntax errors. */
6027 else if (TREE_CODE (node
) == FUNCTION_DECL
&& DECL_INITIAL (node
))
6029 error ("function %q+D definition is marked dllimport", node
);
6030 *no_add_attrs
= true;
6033 else if (TREE_CODE (node
) == VAR_DECL
)
6035 if (DECL_INITIAL (node
))
6037 error ("variable %q+D definition is marked dllimport",
6039 *no_add_attrs
= true;
6042 /* `extern' needn't be specified with dllimport.
6043 Specify `extern' now and hope for the best. Sigh. */
6044 DECL_EXTERNAL (node
) = 1;
6045 /* Also, implicitly give dllimport'd variables declared within
6046 a function global scope, unless declared static. */
6047 if (current_function_decl
!= NULL_TREE
&& !TREE_STATIC (node
))
6048 TREE_PUBLIC (node
) = 1;
6051 if (*no_add_attrs
== false)
6052 DECL_DLLIMPORT_P (node
) = 1;
6054 else if (TREE_CODE (node
) == FUNCTION_DECL
6055 && DECL_DECLARED_INLINE_P (node
)
6056 && flag_keep_inline_dllexport
)
6057 /* An exported function, even if inline, must be emitted. */
6058 DECL_EXTERNAL (node
) = 0;
6060 /* Report error if symbol is not accessible at global scope. */
6061 if (!TREE_PUBLIC (node
)
6062 && (TREE_CODE (node
) == VAR_DECL
6063 || TREE_CODE (node
) == FUNCTION_DECL
))
6065 error ("external linkage required for symbol %q+D because of "
6066 "%qE attribute", node
, name
);
6067 *no_add_attrs
= true;
6070 /* A dllexport'd entity must have default visibility so that other
6071 program units (shared libraries or the main executable) can see
6072 it. A dllimport'd entity must have default visibility so that
6073 the linker knows that undefined references within this program
6074 unit can be resolved by the dynamic linker. */
6077 if (DECL_VISIBILITY_SPECIFIED (node
)
6078 && DECL_VISIBILITY (node
) != VISIBILITY_DEFAULT
)
6079 error ("%qE implies default visibility, but %qD has already "
6080 "been declared with a different visibility",
6082 DECL_VISIBILITY (node
) = VISIBILITY_DEFAULT
;
6083 DECL_VISIBILITY_SPECIFIED (node
) = 1;
6089 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
6091 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
6092 of the various TYPE_QUAL values. */
6095 set_type_quals (tree type
, int type_quals
)
6097 TYPE_READONLY (type
) = (type_quals
& TYPE_QUAL_CONST
) != 0;
6098 TYPE_VOLATILE (type
) = (type_quals
& TYPE_QUAL_VOLATILE
) != 0;
6099 TYPE_RESTRICT (type
) = (type_quals
& TYPE_QUAL_RESTRICT
) != 0;
6100 TYPE_ATOMIC (type
) = (type_quals
& TYPE_QUAL_ATOMIC
) != 0;
6101 TYPE_ADDR_SPACE (type
) = DECODE_QUAL_ADDR_SPACE (type_quals
);
6104 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
6107 check_qualified_type (const_tree cand
, const_tree base
, int type_quals
)
6109 return (TYPE_QUALS (cand
) == type_quals
6110 && TYPE_NAME (cand
) == TYPE_NAME (base
)
6111 /* Apparently this is needed for Objective-C. */
6112 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
6113 /* Check alignment. */
6114 && TYPE_ALIGN (cand
) == TYPE_ALIGN (base
)
6115 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
6116 TYPE_ATTRIBUTES (base
)));
6119 /* Returns true iff CAND is equivalent to BASE with ALIGN. */
6122 check_aligned_type (const_tree cand
, const_tree base
, unsigned int align
)
6124 return (TYPE_QUALS (cand
) == TYPE_QUALS (base
)
6125 && TYPE_NAME (cand
) == TYPE_NAME (base
)
6126 /* Apparently this is needed for Objective-C. */
6127 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
6128 /* Check alignment. */
6129 && TYPE_ALIGN (cand
) == align
6130 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
6131 TYPE_ATTRIBUTES (base
)));
6134 /* This function checks to see if TYPE matches the size one of the built-in
6135 atomic types, and returns that core atomic type. */
6138 find_atomic_core_type (tree type
)
6140 tree base_atomic_type
;
6142 /* Only handle complete types. */
6143 if (TYPE_SIZE (type
) == NULL_TREE
)
6146 HOST_WIDE_INT type_size
= tree_to_uhwi (TYPE_SIZE (type
));
6150 base_atomic_type
= atomicQI_type_node
;
6154 base_atomic_type
= atomicHI_type_node
;
6158 base_atomic_type
= atomicSI_type_node
;
6162 base_atomic_type
= atomicDI_type_node
;
6166 base_atomic_type
= atomicTI_type_node
;
6170 base_atomic_type
= NULL_TREE
;
6173 return base_atomic_type
;
6176 /* Return a version of the TYPE, qualified as indicated by the
6177 TYPE_QUALS, if one exists. If no qualified version exists yet,
6178 return NULL_TREE. */
6181 get_qualified_type (tree type
, int type_quals
)
6185 if (TYPE_QUALS (type
) == type_quals
)
6188 /* Search the chain of variants to see if there is already one there just
6189 like the one we need to have. If so, use that existing one. We must
6190 preserve the TYPE_NAME, since there is code that depends on this. */
6191 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
6192 if (check_qualified_type (t
, type
, type_quals
))
6198 /* Like get_qualified_type, but creates the type if it does not
6199 exist. This function never returns NULL_TREE. */
6202 build_qualified_type (tree type
, int type_quals
)
6206 /* See if we already have the appropriate qualified variant. */
6207 t
= get_qualified_type (type
, type_quals
);
6209 /* If not, build it. */
6212 t
= build_variant_type_copy (type
);
6213 set_type_quals (t
, type_quals
);
6215 if (((type_quals
& TYPE_QUAL_ATOMIC
) == TYPE_QUAL_ATOMIC
))
6217 /* See if this object can map to a basic atomic type. */
6218 tree atomic_type
= find_atomic_core_type (type
);
6221 /* Ensure the alignment of this type is compatible with
6222 the required alignment of the atomic type. */
6223 if (TYPE_ALIGN (atomic_type
) > TYPE_ALIGN (t
))
6224 TYPE_ALIGN (t
) = TYPE_ALIGN (atomic_type
);
6228 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
6229 /* Propagate structural equality. */
6230 SET_TYPE_STRUCTURAL_EQUALITY (t
);
6231 else if (TYPE_CANONICAL (type
) != type
)
6232 /* Build the underlying canonical type, since it is different
6234 TYPE_CANONICAL (t
) = build_qualified_type (TYPE_CANONICAL (type
),
6237 /* T is its own canonical type. */
6238 TYPE_CANONICAL (t
) = t
;
6245 /* Create a variant of type T with alignment ALIGN. */
6248 build_aligned_type (tree type
, unsigned int align
)
6252 if (TYPE_PACKED (type
)
6253 || TYPE_ALIGN (type
) == align
)
6256 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
6257 if (check_aligned_type (t
, type
, align
))
6260 t
= build_variant_type_copy (type
);
6261 TYPE_ALIGN (t
) = align
;
6266 /* Create a new distinct copy of TYPE. The new type is made its own
6267 MAIN_VARIANT. If TYPE requires structural equality checks, the
6268 resulting type requires structural equality checks; otherwise, its
6269 TYPE_CANONICAL points to itself. */
6272 build_distinct_type_copy (tree type
)
6274 tree t
= copy_node (type
);
6276 TYPE_POINTER_TO (t
) = 0;
6277 TYPE_REFERENCE_TO (t
) = 0;
6279 /* Set the canonical type either to a new equivalence class, or
6280 propagate the need for structural equality checks. */
6281 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
6282 SET_TYPE_STRUCTURAL_EQUALITY (t
);
6284 TYPE_CANONICAL (t
) = t
;
6286 /* Make it its own variant. */
6287 TYPE_MAIN_VARIANT (t
) = t
;
6288 TYPE_NEXT_VARIANT (t
) = 0;
6290 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
6291 whose TREE_TYPE is not t. This can also happen in the Ada
6292 frontend when using subtypes. */
6297 /* Create a new variant of TYPE, equivalent but distinct. This is so
6298 the caller can modify it. TYPE_CANONICAL for the return type will
6299 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
6300 are considered equal by the language itself (or that both types
6301 require structural equality checks). */
6304 build_variant_type_copy (tree type
)
6306 tree t
, m
= TYPE_MAIN_VARIANT (type
);
6308 t
= build_distinct_type_copy (type
);
6310 /* Since we're building a variant, assume that it is a non-semantic
6311 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
6312 TYPE_CANONICAL (t
) = TYPE_CANONICAL (type
);
6314 /* Add the new type to the chain of variants of TYPE. */
6315 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (m
);
6316 TYPE_NEXT_VARIANT (m
) = t
;
6317 TYPE_MAIN_VARIANT (t
) = m
;
6322 /* Return true if the from tree in both tree maps are equal. */
6325 tree_map_base_eq (const void *va
, const void *vb
)
6327 const struct tree_map_base
*const a
= (const struct tree_map_base
*) va
,
6328 *const b
= (const struct tree_map_base
*) vb
;
6329 return (a
->from
== b
->from
);
6332 /* Hash a from tree in a tree_base_map. */
6335 tree_map_base_hash (const void *item
)
6337 return htab_hash_pointer (((const struct tree_map_base
*)item
)->from
);
6340 /* Return true if this tree map structure is marked for garbage collection
6341 purposes. We simply return true if the from tree is marked, so that this
6342 structure goes away when the from tree goes away. */
6345 tree_map_base_marked_p (const void *p
)
6347 return ggc_marked_p (((const struct tree_map_base
*) p
)->from
);
6350 /* Hash a from tree in a tree_map. */
6353 tree_map_hash (const void *item
)
6355 return (((const struct tree_map
*) item
)->hash
);
6358 /* Hash a from tree in a tree_decl_map. */
6361 tree_decl_map_hash (const void *item
)
6363 return DECL_UID (((const struct tree_decl_map
*) item
)->base
.from
);
6366 /* Return the initialization priority for DECL. */
6369 decl_init_priority_lookup (tree decl
)
6371 struct tree_priority_map
*h
;
6372 struct tree_map_base in
;
6374 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl
));
6376 h
= (struct tree_priority_map
*) htab_find (init_priority_for_decl
, &in
);
6377 return h
? h
->init
: DEFAULT_INIT_PRIORITY
;
6380 /* Return the finalization priority for DECL. */
6383 decl_fini_priority_lookup (tree decl
)
6385 struct tree_priority_map
*h
;
6386 struct tree_map_base in
;
6388 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
6390 h
= (struct tree_priority_map
*) htab_find (init_priority_for_decl
, &in
);
6391 return h
? h
->fini
: DEFAULT_INIT_PRIORITY
;
6394 /* Return the initialization and finalization priority information for
6395 DECL. If there is no previous priority information, a freshly
6396 allocated structure is returned. */
6398 static struct tree_priority_map
*
6399 decl_priority_info (tree decl
)
6401 struct tree_priority_map in
;
6402 struct tree_priority_map
*h
;
6405 in
.base
.from
= decl
;
6406 loc
= htab_find_slot (init_priority_for_decl
, &in
, INSERT
);
6407 h
= (struct tree_priority_map
*) *loc
;
6410 h
= ggc_alloc_cleared_tree_priority_map ();
6412 h
->base
.from
= decl
;
6413 h
->init
= DEFAULT_INIT_PRIORITY
;
6414 h
->fini
= DEFAULT_INIT_PRIORITY
;
6420 /* Set the initialization priority for DECL to PRIORITY. */
6423 decl_init_priority_insert (tree decl
, priority_type priority
)
6425 struct tree_priority_map
*h
;
6427 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl
));
6428 if (priority
== DEFAULT_INIT_PRIORITY
)
6430 h
= decl_priority_info (decl
);
6434 /* Set the finalization priority for DECL to PRIORITY. */
6437 decl_fini_priority_insert (tree decl
, priority_type priority
)
6439 struct tree_priority_map
*h
;
6441 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
6442 if (priority
== DEFAULT_INIT_PRIORITY
)
6444 h
= decl_priority_info (decl
);
6448 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
6451 print_debug_expr_statistics (void)
6453 fprintf (stderr
, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
6454 (long) htab_size (debug_expr_for_decl
),
6455 (long) htab_elements (debug_expr_for_decl
),
6456 htab_collisions (debug_expr_for_decl
));
6459 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
6462 print_value_expr_statistics (void)
6464 fprintf (stderr
, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
6465 (long) htab_size (value_expr_for_decl
),
6466 (long) htab_elements (value_expr_for_decl
),
6467 htab_collisions (value_expr_for_decl
));
6470 /* Lookup a debug expression for FROM, and return it if we find one. */
6473 decl_debug_expr_lookup (tree from
)
6475 struct tree_decl_map
*h
, in
;
6476 in
.base
.from
= from
;
6478 h
= (struct tree_decl_map
*)
6479 htab_find_with_hash (debug_expr_for_decl
, &in
, DECL_UID (from
));
6485 /* Insert a mapping FROM->TO in the debug expression hashtable. */
6488 decl_debug_expr_insert (tree from
, tree to
)
6490 struct tree_decl_map
*h
;
6493 h
= ggc_alloc_tree_decl_map ();
6494 h
->base
.from
= from
;
6496 loc
= htab_find_slot_with_hash (debug_expr_for_decl
, h
, DECL_UID (from
),
6498 *(struct tree_decl_map
**) loc
= h
;
6501 /* Lookup a value expression for FROM, and return it if we find one. */
6504 decl_value_expr_lookup (tree from
)
6506 struct tree_decl_map
*h
, in
;
6507 in
.base
.from
= from
;
6509 h
= (struct tree_decl_map
*)
6510 htab_find_with_hash (value_expr_for_decl
, &in
, DECL_UID (from
));
6516 /* Insert a mapping FROM->TO in the value expression hashtable. */
6519 decl_value_expr_insert (tree from
, tree to
)
6521 struct tree_decl_map
*h
;
6524 h
= ggc_alloc_tree_decl_map ();
6525 h
->base
.from
= from
;
6527 loc
= htab_find_slot_with_hash (value_expr_for_decl
, h
, DECL_UID (from
),
6529 *(struct tree_decl_map
**) loc
= h
;
6532 /* Lookup a vector of debug arguments for FROM, and return it if we
6536 decl_debug_args_lookup (tree from
)
6538 struct tree_vec_map
*h
, in
;
6540 if (!DECL_HAS_DEBUG_ARGS_P (from
))
6542 gcc_checking_assert (debug_args_for_decl
!= NULL
);
6543 in
.base
.from
= from
;
6544 h
= (struct tree_vec_map
*)
6545 htab_find_with_hash (debug_args_for_decl
, &in
, DECL_UID (from
));
6551 /* Insert a mapping FROM->empty vector of debug arguments in the value
6552 expression hashtable. */
6555 decl_debug_args_insert (tree from
)
6557 struct tree_vec_map
*h
;
6560 if (DECL_HAS_DEBUG_ARGS_P (from
))
6561 return decl_debug_args_lookup (from
);
6562 if (debug_args_for_decl
== NULL
)
6563 debug_args_for_decl
= htab_create_ggc (64, tree_vec_map_hash
,
6564 tree_vec_map_eq
, 0);
6565 h
= ggc_alloc_tree_vec_map ();
6566 h
->base
.from
= from
;
6568 loc
= htab_find_slot_with_hash (debug_args_for_decl
, h
, DECL_UID (from
),
6570 *(struct tree_vec_map
**) loc
= h
;
6571 DECL_HAS_DEBUG_ARGS_P (from
) = 1;
6575 /* Hashing of types so that we don't make duplicates.
6576 The entry point is `type_hash_canon'. */
6578 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
6579 with types in the TREE_VALUE slots), by adding the hash codes
6580 of the individual types. */
6583 type_hash_list (const_tree list
, hashval_t hashcode
)
6587 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
6588 if (TREE_VALUE (tail
) != error_mark_node
)
6589 hashcode
= iterative_hash_object (TYPE_HASH (TREE_VALUE (tail
)),
6595 /* These are the Hashtable callback functions. */
6597 /* Returns true iff the types are equivalent. */
6600 type_hash_eq (const void *va
, const void *vb
)
6602 const struct type_hash
*const a
= (const struct type_hash
*) va
,
6603 *const b
= (const struct type_hash
*) vb
;
6605 /* First test the things that are the same for all types. */
6606 if (a
->hash
!= b
->hash
6607 || TREE_CODE (a
->type
) != TREE_CODE (b
->type
)
6608 || TREE_TYPE (a
->type
) != TREE_TYPE (b
->type
)
6609 || !attribute_list_equal (TYPE_ATTRIBUTES (a
->type
),
6610 TYPE_ATTRIBUTES (b
->type
))
6611 || (TREE_CODE (a
->type
) != COMPLEX_TYPE
6612 && TYPE_NAME (a
->type
) != TYPE_NAME (b
->type
)))
6615 /* Be careful about comparing arrays before and after the element type
6616 has been completed; don't compare TYPE_ALIGN unless both types are
6618 if (COMPLETE_TYPE_P (a
->type
) && COMPLETE_TYPE_P (b
->type
)
6619 && (TYPE_ALIGN (a
->type
) != TYPE_ALIGN (b
->type
)
6620 || TYPE_MODE (a
->type
) != TYPE_MODE (b
->type
)))
6623 switch (TREE_CODE (a
->type
))
6628 case REFERENCE_TYPE
:
6633 return TYPE_VECTOR_SUBPARTS (a
->type
) == TYPE_VECTOR_SUBPARTS (b
->type
);
6636 if (TYPE_VALUES (a
->type
) != TYPE_VALUES (b
->type
)
6637 && !(TYPE_VALUES (a
->type
)
6638 && TREE_CODE (TYPE_VALUES (a
->type
)) == TREE_LIST
6639 && TYPE_VALUES (b
->type
)
6640 && TREE_CODE (TYPE_VALUES (b
->type
)) == TREE_LIST
6641 && type_list_equal (TYPE_VALUES (a
->type
),
6642 TYPE_VALUES (b
->type
))))
6645 /* ... fall through ... */
6650 if (TYPE_PRECISION (a
->type
) != TYPE_PRECISION (b
->type
))
6652 return ((TYPE_MAX_VALUE (a
->type
) == TYPE_MAX_VALUE (b
->type
)
6653 || tree_int_cst_equal (TYPE_MAX_VALUE (a
->type
),
6654 TYPE_MAX_VALUE (b
->type
)))
6655 && (TYPE_MIN_VALUE (a
->type
) == TYPE_MIN_VALUE (b
->type
)
6656 || tree_int_cst_equal (TYPE_MIN_VALUE (a
->type
),
6657 TYPE_MIN_VALUE (b
->type
))));
6659 case FIXED_POINT_TYPE
:
6660 return TYPE_SATURATING (a
->type
) == TYPE_SATURATING (b
->type
);
6663 return TYPE_OFFSET_BASETYPE (a
->type
) == TYPE_OFFSET_BASETYPE (b
->type
);
6666 if (TYPE_METHOD_BASETYPE (a
->type
) == TYPE_METHOD_BASETYPE (b
->type
)
6667 && (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
6668 || (TYPE_ARG_TYPES (a
->type
)
6669 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
6670 && TYPE_ARG_TYPES (b
->type
)
6671 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
6672 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
6673 TYPE_ARG_TYPES (b
->type
)))))
6677 return TYPE_DOMAIN (a
->type
) == TYPE_DOMAIN (b
->type
);
6681 case QUAL_UNION_TYPE
:
6682 return (TYPE_FIELDS (a
->type
) == TYPE_FIELDS (b
->type
)
6683 || (TYPE_FIELDS (a
->type
)
6684 && TREE_CODE (TYPE_FIELDS (a
->type
)) == TREE_LIST
6685 && TYPE_FIELDS (b
->type
)
6686 && TREE_CODE (TYPE_FIELDS (b
->type
)) == TREE_LIST
6687 && type_list_equal (TYPE_FIELDS (a
->type
),
6688 TYPE_FIELDS (b
->type
))));
6691 if (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
6692 || (TYPE_ARG_TYPES (a
->type
)
6693 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
6694 && TYPE_ARG_TYPES (b
->type
)
6695 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
6696 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
6697 TYPE_ARG_TYPES (b
->type
))))
6705 if (lang_hooks
.types
.type_hash_eq
!= NULL
)
6706 return lang_hooks
.types
.type_hash_eq (a
->type
, b
->type
);
6711 /* Return the cached hash value. */
6714 type_hash_hash (const void *item
)
6716 return ((const struct type_hash
*) item
)->hash
;
6719 /* Look in the type hash table for a type isomorphic to TYPE.
6720 If one is found, return it. Otherwise return 0. */
6723 type_hash_lookup (hashval_t hashcode
, tree type
)
6725 struct type_hash
*h
, in
;
6727 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
6728 must call that routine before comparing TYPE_ALIGNs. */
6734 h
= (struct type_hash
*) htab_find_with_hash (type_hash_table
, &in
,
6741 /* Add an entry to the type-hash-table
6742 for a type TYPE whose hash code is HASHCODE. */
6745 type_hash_add (hashval_t hashcode
, tree type
)
6747 struct type_hash
*h
;
6750 h
= ggc_alloc_type_hash ();
6753 loc
= htab_find_slot_with_hash (type_hash_table
, h
, hashcode
, INSERT
);
6757 /* Given TYPE, and HASHCODE its hash code, return the canonical
6758 object for an identical type if one already exists.
6759 Otherwise, return TYPE, and record it as the canonical object.
6761 To use this function, first create a type of the sort you want.
6762 Then compute its hash code from the fields of the type that
6763 make it different from other similar types.
6764 Then call this function and use the value. */
6767 type_hash_canon (unsigned int hashcode
, tree type
)
6771 /* The hash table only contains main variants, so ensure that's what we're
6773 gcc_assert (TYPE_MAIN_VARIANT (type
) == type
);
6775 /* See if the type is in the hash table already. If so, return it.
6776 Otherwise, add the type. */
6777 t1
= type_hash_lookup (hashcode
, type
);
6780 if (GATHER_STATISTICS
)
6782 tree_code_counts
[(int) TREE_CODE (type
)]--;
6783 tree_node_counts
[(int) t_kind
]--;
6784 tree_node_sizes
[(int) t_kind
] -= sizeof (struct tree_type_non_common
);
6790 type_hash_add (hashcode
, type
);
6795 /* See if the data pointed to by the type hash table is marked. We consider
6796 it marked if the type is marked or if a debug type number or symbol
6797 table entry has been made for the type. */
6800 type_hash_marked_p (const void *p
)
6802 const_tree
const type
= ((const struct type_hash
*) p
)->type
;
6804 return ggc_marked_p (type
);
6808 print_type_hash_statistics (void)
6810 fprintf (stderr
, "Type hash: size %ld, %ld elements, %f collisions\n",
6811 (long) htab_size (type_hash_table
),
6812 (long) htab_elements (type_hash_table
),
6813 htab_collisions (type_hash_table
));
6816 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
6817 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
6818 by adding the hash codes of the individual attributes. */
6821 attribute_hash_list (const_tree list
, hashval_t hashcode
)
6825 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
6826 /* ??? Do we want to add in TREE_VALUE too? */
6827 hashcode
= iterative_hash_object
6828 (IDENTIFIER_HASH_VALUE (get_attribute_name (tail
)), hashcode
);
6832 /* Given two lists of attributes, return true if list l2 is
6833 equivalent to l1. */
6836 attribute_list_equal (const_tree l1
, const_tree l2
)
6841 return attribute_list_contained (l1
, l2
)
6842 && attribute_list_contained (l2
, l1
);
6845 /* Given two lists of attributes, return true if list L2 is
6846 completely contained within L1. */
6847 /* ??? This would be faster if attribute names were stored in a canonicalized
6848 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
6849 must be used to show these elements are equivalent (which they are). */
6850 /* ??? It's not clear that attributes with arguments will always be handled
6854 attribute_list_contained (const_tree l1
, const_tree l2
)
6858 /* First check the obvious, maybe the lists are identical. */
6862 /* Maybe the lists are similar. */
6863 for (t1
= l1
, t2
= l2
;
6865 && get_attribute_name (t1
) == get_attribute_name (t2
)
6866 && TREE_VALUE (t1
) == TREE_VALUE (t2
);
6867 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
6870 /* Maybe the lists are equal. */
6871 if (t1
== 0 && t2
== 0)
6874 for (; t2
!= 0; t2
= TREE_CHAIN (t2
))
6877 /* This CONST_CAST is okay because lookup_attribute does not
6878 modify its argument and the return value is assigned to a
6880 for (attr
= lookup_ident_attribute (get_attribute_name (t2
),
6881 CONST_CAST_TREE (l1
));
6882 attr
!= NULL_TREE
&& !attribute_value_equal (t2
, attr
);
6883 attr
= lookup_ident_attribute (get_attribute_name (t2
),
6887 if (attr
== NULL_TREE
)
6894 /* Given two lists of types
6895 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
6896 return 1 if the lists contain the same types in the same order.
6897 Also, the TREE_PURPOSEs must match. */
6900 type_list_equal (const_tree l1
, const_tree l2
)
6904 for (t1
= l1
, t2
= l2
; t1
&& t2
; t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
6905 if (TREE_VALUE (t1
) != TREE_VALUE (t2
)
6906 || (TREE_PURPOSE (t1
) != TREE_PURPOSE (t2
)
6907 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
))
6908 && (TREE_TYPE (TREE_PURPOSE (t1
))
6909 == TREE_TYPE (TREE_PURPOSE (t2
))))))
6915 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
6916 given by TYPE. If the argument list accepts variable arguments,
6917 then this function counts only the ordinary arguments. */
6920 type_num_arguments (const_tree type
)
6925 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
6926 /* If the function does not take a variable number of arguments,
6927 the last element in the list will have type `void'. */
6928 if (VOID_TYPE_P (TREE_VALUE (t
)))
6936 /* Nonzero if integer constants T1 and T2
6937 represent the same constant value. */
6940 tree_int_cst_equal (const_tree t1
, const_tree t2
)
6945 if (t1
== 0 || t2
== 0)
6948 if (TREE_CODE (t1
) == INTEGER_CST
6949 && TREE_CODE (t2
) == INTEGER_CST
6950 && wi::to_widest (t1
) == wi::to_widest (t2
))
6956 /* Return true if T is an INTEGER_CST whose numerical value (extended
6957 according to TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. */
6960 tree_fits_shwi_p (const_tree t
)
6962 return (t
!= NULL_TREE
6963 && TREE_CODE (t
) == INTEGER_CST
6964 && wi::fits_shwi_p (wi::to_widest (t
)));
6967 /* Return true if T is an INTEGER_CST whose numerical value (extended
6968 according to TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. */
6971 tree_fits_uhwi_p (const_tree t
)
6973 return (t
!= NULL_TREE
6974 && TREE_CODE (t
) == INTEGER_CST
6975 && wi::fits_uhwi_p (wi::to_widest (t
)));
6978 /* T is an INTEGER_CST whose numerical value (extended according to
6979 TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. Return that
6983 tree_to_shwi (const_tree t
)
6985 gcc_assert (tree_fits_shwi_p (t
));
6986 return TREE_INT_CST_LOW (t
);
6989 /* T is an INTEGER_CST whose numerical value (extended according to
6990 TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. Return that
6993 unsigned HOST_WIDE_INT
6994 tree_to_uhwi (const_tree t
)
6996 gcc_assert (tree_fits_uhwi_p (t
));
6997 return TREE_INT_CST_LOW (t
);
7000 /* Return the most significant (sign) bit of T. */
7003 tree_int_cst_sign_bit (const_tree t
)
7005 unsigned bitno
= TYPE_PRECISION (TREE_TYPE (t
)) - 1;
7007 return wi::extract_uhwi (t
, bitno
, 1);
7010 /* Return an indication of the sign of the integer constant T.
7011 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
7012 Note that -1 will never be returned if T's type is unsigned. */
7015 tree_int_cst_sgn (const_tree t
)
7017 if (wi::eq_p (t
, 0))
7019 else if (TYPE_UNSIGNED (TREE_TYPE (t
)))
7021 else if (wi::neg_p (t
))
7027 /* Return the minimum number of bits needed to represent VALUE in a
7028 signed or unsigned type, UNSIGNEDP says which. */
7031 tree_int_cst_min_precision (tree value
, signop sgn
)
7033 /* If the value is negative, compute its negative minus 1. The latter
7034 adjustment is because the absolute value of the largest negative value
7035 is one larger than the largest positive value. This is equivalent to
7036 a bit-wise negation, so use that operation instead. */
7038 if (tree_int_cst_sgn (value
) < 0)
7039 value
= fold_build1 (BIT_NOT_EXPR
, TREE_TYPE (value
), value
);
7041 /* Return the number of bits needed, taking into account the fact
7042 that we need one more bit for a signed than unsigned type.
7043 If value is 0 or -1, the minimum precision is 1 no matter
7044 whether unsignedp is true or false. */
7046 if (integer_zerop (value
))
7049 return tree_floor_log2 (value
) + 1 + (sgn
== SIGNED
? 1 : 0) ;
7052 /* Return truthvalue of whether T1 is the same tree structure as T2.
7053 Return 1 if they are the same.
7054 Return 0 if they are understandably different.
7055 Return -1 if either contains tree structure not understood by
7059 simple_cst_equal (const_tree t1
, const_tree t2
)
7061 enum tree_code code1
, code2
;
7067 if (t1
== 0 || t2
== 0)
7070 code1
= TREE_CODE (t1
);
7071 code2
= TREE_CODE (t2
);
7073 if (CONVERT_EXPR_CODE_P (code1
) || code1
== NON_LVALUE_EXPR
)
7075 if (CONVERT_EXPR_CODE_P (code2
)
7076 || code2
== NON_LVALUE_EXPR
)
7077 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7079 return simple_cst_equal (TREE_OPERAND (t1
, 0), t2
);
7082 else if (CONVERT_EXPR_CODE_P (code2
)
7083 || code2
== NON_LVALUE_EXPR
)
7084 return simple_cst_equal (t1
, TREE_OPERAND (t2
, 0));
7092 return wi::to_widest (t1
) == wi::to_widest (t2
);
7095 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1
), TREE_REAL_CST (t2
));
7098 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1
), TREE_FIXED_CST (t2
));
7101 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
7102 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
7103 TREE_STRING_LENGTH (t1
)));
7107 unsigned HOST_WIDE_INT idx
;
7108 vec
<constructor_elt
, va_gc
> *v1
= CONSTRUCTOR_ELTS (t1
);
7109 vec
<constructor_elt
, va_gc
> *v2
= CONSTRUCTOR_ELTS (t2
);
7111 if (vec_safe_length (v1
) != vec_safe_length (v2
))
7114 for (idx
= 0; idx
< vec_safe_length (v1
); ++idx
)
7115 /* ??? Should we handle also fields here? */
7116 if (!simple_cst_equal ((*v1
)[idx
].value
, (*v2
)[idx
].value
))
7122 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7125 cmp
= simple_cst_equal (CALL_EXPR_FN (t1
), CALL_EXPR_FN (t2
));
7128 if (call_expr_nargs (t1
) != call_expr_nargs (t2
))
7131 const_tree arg1
, arg2
;
7132 const_call_expr_arg_iterator iter1
, iter2
;
7133 for (arg1
= first_const_call_expr_arg (t1
, &iter1
),
7134 arg2
= first_const_call_expr_arg (t2
, &iter2
);
7136 arg1
= next_const_call_expr_arg (&iter1
),
7137 arg2
= next_const_call_expr_arg (&iter2
))
7139 cmp
= simple_cst_equal (arg1
, arg2
);
7143 return arg1
== arg2
;
7147 /* Special case: if either target is an unallocated VAR_DECL,
7148 it means that it's going to be unified with whatever the
7149 TARGET_EXPR is really supposed to initialize, so treat it
7150 as being equivalent to anything. */
7151 if ((TREE_CODE (TREE_OPERAND (t1
, 0)) == VAR_DECL
7152 && DECL_NAME (TREE_OPERAND (t1
, 0)) == NULL_TREE
7153 && !DECL_RTL_SET_P (TREE_OPERAND (t1
, 0)))
7154 || (TREE_CODE (TREE_OPERAND (t2
, 0)) == VAR_DECL
7155 && DECL_NAME (TREE_OPERAND (t2
, 0)) == NULL_TREE
7156 && !DECL_RTL_SET_P (TREE_OPERAND (t2
, 0))))
7159 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7164 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
7166 case WITH_CLEANUP_EXPR
:
7167 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7171 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t1
, 1));
7174 if (TREE_OPERAND (t1
, 1) == TREE_OPERAND (t2
, 1))
7175 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7189 /* This general rule works for most tree codes. All exceptions should be
7190 handled above. If this is a language-specific tree code, we can't
7191 trust what might be in the operand, so say we don't know
7193 if ((int) code1
>= (int) LAST_AND_UNUSED_TREE_CODE
)
7196 switch (TREE_CODE_CLASS (code1
))
7200 case tcc_comparison
:
7201 case tcc_expression
:
7205 for (i
= 0; i
< TREE_CODE_LENGTH (code1
); i
++)
7207 cmp
= simple_cst_equal (TREE_OPERAND (t1
, i
), TREE_OPERAND (t2
, i
));
7219 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
7220 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
7221 than U, respectively. */
7224 compare_tree_int (const_tree t
, unsigned HOST_WIDE_INT u
)
7226 if (tree_int_cst_sgn (t
) < 0)
7228 else if (!tree_fits_uhwi_p (t
))
7230 else if (TREE_INT_CST_LOW (t
) == u
)
7232 else if (TREE_INT_CST_LOW (t
) < u
)
7238 /* Return true if SIZE represents a constant size that is in bounds of
7239 what the middle-end and the backend accepts (covering not more than
7240 half of the address-space). */
7243 valid_constant_size_p (const_tree size
)
7245 if (! tree_fits_uhwi_p (size
)
7246 || TREE_OVERFLOW (size
)
7247 || tree_int_cst_sign_bit (size
) != 0)
7252 /* Return the precision of the type, or for a complex or vector type the
7253 precision of the type of its elements. */
7256 element_precision (const_tree type
)
7258 enum tree_code code
= TREE_CODE (type
);
7259 if (code
== COMPLEX_TYPE
|| code
== VECTOR_TYPE
)
7260 type
= TREE_TYPE (type
);
7262 return TYPE_PRECISION (type
);
7265 /* Return true if CODE represents an associative tree code. Otherwise
7268 associative_tree_code (enum tree_code code
)
7287 /* Return true if CODE represents a commutative tree code. Otherwise
7290 commutative_tree_code (enum tree_code code
)
7296 case MULT_HIGHPART_EXPR
:
7304 case UNORDERED_EXPR
:
7308 case TRUTH_AND_EXPR
:
7309 case TRUTH_XOR_EXPR
:
7311 case WIDEN_MULT_EXPR
:
7312 case VEC_WIDEN_MULT_HI_EXPR
:
7313 case VEC_WIDEN_MULT_LO_EXPR
:
7314 case VEC_WIDEN_MULT_EVEN_EXPR
:
7315 case VEC_WIDEN_MULT_ODD_EXPR
:
7324 /* Return true if CODE represents a ternary tree code for which the
7325 first two operands are commutative. Otherwise return false. */
7327 commutative_ternary_tree_code (enum tree_code code
)
7331 case WIDEN_MULT_PLUS_EXPR
:
7332 case WIDEN_MULT_MINUS_EXPR
:
7341 /* Generate a hash value for an expression. This can be used iteratively
7342 by passing a previous result as the VAL argument.
7344 This function is intended to produce the same hash for expressions which
7345 would compare equal using operand_equal_p. */
7348 iterative_hash_expr (const_tree t
, hashval_t val
)
7351 enum tree_code code
;
7352 enum tree_code_class tclass
;
7355 return iterative_hash_hashval_t (0, val
);
7357 code
= TREE_CODE (t
);
7361 /* Alas, constants aren't shared, so we can't rely on pointer
7364 for (i
= 0; i
< TREE_INT_CST_NUNITS (t
); i
++)
7365 val
= iterative_hash_host_wide_int (TREE_INT_CST_ELT (t
, i
), val
);
7369 unsigned int val2
= real_hash (TREE_REAL_CST_PTR (t
));
7371 return iterative_hash_hashval_t (val2
, val
);
7375 unsigned int val2
= fixed_hash (TREE_FIXED_CST_PTR (t
));
7377 return iterative_hash_hashval_t (val2
, val
);
7380 return iterative_hash (TREE_STRING_POINTER (t
),
7381 TREE_STRING_LENGTH (t
), val
);
7383 val
= iterative_hash_expr (TREE_REALPART (t
), val
);
7384 return iterative_hash_expr (TREE_IMAGPART (t
), val
);
7388 for (i
= 0; i
< VECTOR_CST_NELTS (t
); ++i
)
7389 val
= iterative_hash_expr (VECTOR_CST_ELT (t
, i
), val
);
7393 /* We can just compare by pointer. */
7394 return iterative_hash_host_wide_int (SSA_NAME_VERSION (t
), val
);
7395 case PLACEHOLDER_EXPR
:
7396 /* The node itself doesn't matter. */
7399 /* A list of expressions, for a CALL_EXPR or as the elements of a
7401 for (; t
; t
= TREE_CHAIN (t
))
7402 val
= iterative_hash_expr (TREE_VALUE (t
), val
);
7406 unsigned HOST_WIDE_INT idx
;
7408 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t
), idx
, field
, value
)
7410 val
= iterative_hash_expr (field
, val
);
7411 val
= iterative_hash_expr (value
, val
);
7416 /* When referring to a built-in FUNCTION_DECL, use the __builtin__ form.
7417 Otherwise nodes that compare equal according to operand_equal_p might
7418 get different hash codes. However, don't do this for machine specific
7419 or front end builtins, since the function code is overloaded in those
7421 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
7422 && builtin_decl_explicit_p (DECL_FUNCTION_CODE (t
)))
7424 t
= builtin_decl_explicit (DECL_FUNCTION_CODE (t
));
7425 code
= TREE_CODE (t
);
7429 tclass
= TREE_CODE_CLASS (code
);
7431 if (tclass
== tcc_declaration
)
7433 /* DECL's have a unique ID */
7434 val
= iterative_hash_host_wide_int (DECL_UID (t
), val
);
7438 gcc_assert (IS_EXPR_CODE_CLASS (tclass
));
7440 val
= iterative_hash_object (code
, val
);
7442 /* Don't hash the type, that can lead to having nodes which
7443 compare equal according to operand_equal_p, but which
7444 have different hash codes. */
7445 if (CONVERT_EXPR_CODE_P (code
)
7446 || code
== NON_LVALUE_EXPR
)
7448 /* Make sure to include signness in the hash computation. */
7449 val
+= TYPE_UNSIGNED (TREE_TYPE (t
));
7450 val
= iterative_hash_expr (TREE_OPERAND (t
, 0), val
);
7453 else if (commutative_tree_code (code
))
7455 /* It's a commutative expression. We want to hash it the same
7456 however it appears. We do this by first hashing both operands
7457 and then rehashing based on the order of their independent
7459 hashval_t one
= iterative_hash_expr (TREE_OPERAND (t
, 0), 0);
7460 hashval_t two
= iterative_hash_expr (TREE_OPERAND (t
, 1), 0);
7464 t
= one
, one
= two
, two
= t
;
7466 val
= iterative_hash_hashval_t (one
, val
);
7467 val
= iterative_hash_hashval_t (two
, val
);
7470 for (i
= TREE_OPERAND_LENGTH (t
) - 1; i
>= 0; --i
)
7471 val
= iterative_hash_expr (TREE_OPERAND (t
, i
), val
);
7477 /* Constructors for pointer, array and function types.
7478 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
7479 constructed by language-dependent code, not here.) */
7481 /* Construct, lay out and return the type of pointers to TO_TYPE with
7482 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
7483 reference all of memory. If such a type has already been
7484 constructed, reuse it. */
7487 build_pointer_type_for_mode (tree to_type
, enum machine_mode mode
,
7492 if (to_type
== error_mark_node
)
7493 return error_mark_node
;
7495 /* If the pointed-to type has the may_alias attribute set, force
7496 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7497 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
7498 can_alias_all
= true;
7500 /* In some cases, languages will have things that aren't a POINTER_TYPE
7501 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
7502 In that case, return that type without regard to the rest of our
7505 ??? This is a kludge, but consistent with the way this function has
7506 always operated and there doesn't seem to be a good way to avoid this
7508 if (TYPE_POINTER_TO (to_type
) != 0
7509 && TREE_CODE (TYPE_POINTER_TO (to_type
)) != POINTER_TYPE
)
7510 return TYPE_POINTER_TO (to_type
);
7512 /* First, if we already have a type for pointers to TO_TYPE and it's
7513 the proper mode, use it. */
7514 for (t
= TYPE_POINTER_TO (to_type
); t
; t
= TYPE_NEXT_PTR_TO (t
))
7515 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
7518 t
= make_node (POINTER_TYPE
);
7520 TREE_TYPE (t
) = to_type
;
7521 SET_TYPE_MODE (t
, mode
);
7522 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
7523 TYPE_NEXT_PTR_TO (t
) = TYPE_POINTER_TO (to_type
);
7524 TYPE_POINTER_TO (to_type
) = t
;
7526 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
))
7527 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7528 else if (TYPE_CANONICAL (to_type
) != to_type
)
7530 = build_pointer_type_for_mode (TYPE_CANONICAL (to_type
),
7531 mode
, can_alias_all
);
7533 /* Lay out the type. This function has many callers that are concerned
7534 with expression-construction, and this simplifies them all. */
7540 /* By default build pointers in ptr_mode. */
7543 build_pointer_type (tree to_type
)
7545 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
7546 : TYPE_ADDR_SPACE (to_type
);
7547 enum machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
7548 return build_pointer_type_for_mode (to_type
, pointer_mode
, false);
7551 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
7554 build_reference_type_for_mode (tree to_type
, enum machine_mode mode
,
7559 if (to_type
== error_mark_node
)
7560 return error_mark_node
;
7562 /* If the pointed-to type has the may_alias attribute set, force
7563 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7564 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
7565 can_alias_all
= true;
7567 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
7568 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
7569 In that case, return that type without regard to the rest of our
7572 ??? This is a kludge, but consistent with the way this function has
7573 always operated and there doesn't seem to be a good way to avoid this
7575 if (TYPE_REFERENCE_TO (to_type
) != 0
7576 && TREE_CODE (TYPE_REFERENCE_TO (to_type
)) != REFERENCE_TYPE
)
7577 return TYPE_REFERENCE_TO (to_type
);
7579 /* First, if we already have a type for pointers to TO_TYPE and it's
7580 the proper mode, use it. */
7581 for (t
= TYPE_REFERENCE_TO (to_type
); t
; t
= TYPE_NEXT_REF_TO (t
))
7582 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
7585 t
= make_node (REFERENCE_TYPE
);
7587 TREE_TYPE (t
) = to_type
;
7588 SET_TYPE_MODE (t
, mode
);
7589 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
7590 TYPE_NEXT_REF_TO (t
) = TYPE_REFERENCE_TO (to_type
);
7591 TYPE_REFERENCE_TO (to_type
) = t
;
7593 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
))
7594 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7595 else if (TYPE_CANONICAL (to_type
) != to_type
)
7597 = build_reference_type_for_mode (TYPE_CANONICAL (to_type
),
7598 mode
, can_alias_all
);
7606 /* Build the node for the type of references-to-TO_TYPE by default
7610 build_reference_type (tree to_type
)
7612 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
7613 : TYPE_ADDR_SPACE (to_type
);
7614 enum machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
7615 return build_reference_type_for_mode (to_type
, pointer_mode
, false);
7618 #define MAX_INT_CACHED_PREC \
7619 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
7620 static GTY(()) tree nonstandard_integer_type_cache
[2 * MAX_INT_CACHED_PREC
+ 2];
7622 /* Builds a signed or unsigned integer type of precision PRECISION.
7623 Used for C bitfields whose precision does not match that of
7624 built-in target types. */
7626 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision
,
7632 unsignedp
= MAX_INT_CACHED_PREC
+ 1;
7634 if (precision
<= MAX_INT_CACHED_PREC
)
7636 itype
= nonstandard_integer_type_cache
[precision
+ unsignedp
];
7641 itype
= make_node (INTEGER_TYPE
);
7642 TYPE_PRECISION (itype
) = precision
;
7645 fixup_unsigned_type (itype
);
7647 fixup_signed_type (itype
);
7650 if (tree_fits_uhwi_p (TYPE_MAX_VALUE (itype
)))
7651 ret
= type_hash_canon (tree_to_uhwi (TYPE_MAX_VALUE (itype
)), itype
);
7652 if (precision
<= MAX_INT_CACHED_PREC
)
7653 nonstandard_integer_type_cache
[precision
+ unsignedp
] = ret
;
7658 /* Create a range of some discrete type TYPE (an INTEGER_TYPE, ENUMERAL_TYPE
7659 or BOOLEAN_TYPE) with low bound LOWVAL and high bound HIGHVAL. If SHARED
7660 is true, reuse such a type that has already been constructed. */
7663 build_range_type_1 (tree type
, tree lowval
, tree highval
, bool shared
)
7665 tree itype
= make_node (INTEGER_TYPE
);
7666 hashval_t hashcode
= 0;
7668 TREE_TYPE (itype
) = type
;
7670 TYPE_MIN_VALUE (itype
) = fold_convert (type
, lowval
);
7671 TYPE_MAX_VALUE (itype
) = highval
? fold_convert (type
, highval
) : NULL
;
7673 TYPE_PRECISION (itype
) = TYPE_PRECISION (type
);
7674 SET_TYPE_MODE (itype
, TYPE_MODE (type
));
7675 TYPE_SIZE (itype
) = TYPE_SIZE (type
);
7676 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (type
);
7677 TYPE_ALIGN (itype
) = TYPE_ALIGN (type
);
7678 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (type
);
7683 if ((TYPE_MIN_VALUE (itype
)
7684 && TREE_CODE (TYPE_MIN_VALUE (itype
)) != INTEGER_CST
)
7685 || (TYPE_MAX_VALUE (itype
)
7686 && TREE_CODE (TYPE_MAX_VALUE (itype
)) != INTEGER_CST
))
7688 /* Since we cannot reliably merge this type, we need to compare it using
7689 structural equality checks. */
7690 SET_TYPE_STRUCTURAL_EQUALITY (itype
);
7694 hashcode
= iterative_hash_expr (TYPE_MIN_VALUE (itype
), hashcode
);
7695 hashcode
= iterative_hash_expr (TYPE_MAX_VALUE (itype
), hashcode
);
7696 hashcode
= iterative_hash_hashval_t (TYPE_HASH (type
), hashcode
);
7697 itype
= type_hash_canon (hashcode
, itype
);
7702 /* Wrapper around build_range_type_1 with SHARED set to true. */
7705 build_range_type (tree type
, tree lowval
, tree highval
)
7707 return build_range_type_1 (type
, lowval
, highval
, true);
7710 /* Wrapper around build_range_type_1 with SHARED set to false. */
7713 build_nonshared_range_type (tree type
, tree lowval
, tree highval
)
7715 return build_range_type_1 (type
, lowval
, highval
, false);
7718 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
7719 MAXVAL should be the maximum value in the domain
7720 (one less than the length of the array).
7722 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
7723 We don't enforce this limit, that is up to caller (e.g. language front end).
7724 The limit exists because the result is a signed type and we don't handle
7725 sizes that use more than one HOST_WIDE_INT. */
7728 build_index_type (tree maxval
)
7730 return build_range_type (sizetype
, size_zero_node
, maxval
);
7733 /* Return true if the debug information for TYPE, a subtype, should be emitted
7734 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
7735 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
7736 debug info and doesn't reflect the source code. */
7739 subrange_type_for_debug_p (const_tree type
, tree
*lowval
, tree
*highval
)
7741 tree base_type
= TREE_TYPE (type
), low
, high
;
7743 /* Subrange types have a base type which is an integral type. */
7744 if (!INTEGRAL_TYPE_P (base_type
))
7747 /* Get the real bounds of the subtype. */
7748 if (lang_hooks
.types
.get_subrange_bounds
)
7749 lang_hooks
.types
.get_subrange_bounds (type
, &low
, &high
);
7752 low
= TYPE_MIN_VALUE (type
);
7753 high
= TYPE_MAX_VALUE (type
);
7756 /* If the type and its base type have the same representation and the same
7757 name, then the type is not a subrange but a copy of the base type. */
7758 if ((TREE_CODE (base_type
) == INTEGER_TYPE
7759 || TREE_CODE (base_type
) == BOOLEAN_TYPE
)
7760 && int_size_in_bytes (type
) == int_size_in_bytes (base_type
)
7761 && tree_int_cst_equal (low
, TYPE_MIN_VALUE (base_type
))
7762 && tree_int_cst_equal (high
, TYPE_MAX_VALUE (base_type
))
7763 && TYPE_IDENTIFIER (type
) == TYPE_IDENTIFIER (base_type
))
7773 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
7774 and number of elements specified by the range of values of INDEX_TYPE.
7775 If SHARED is true, reuse such a type that has already been constructed. */
7778 build_array_type_1 (tree elt_type
, tree index_type
, bool shared
)
7782 if (TREE_CODE (elt_type
) == FUNCTION_TYPE
)
7784 error ("arrays of functions are not meaningful");
7785 elt_type
= integer_type_node
;
7788 t
= make_node (ARRAY_TYPE
);
7789 TREE_TYPE (t
) = elt_type
;
7790 TYPE_DOMAIN (t
) = index_type
;
7791 TYPE_ADDR_SPACE (t
) = TYPE_ADDR_SPACE (elt_type
);
7794 /* If the element type is incomplete at this point we get marked for
7795 structural equality. Do not record these types in the canonical
7797 if (TYPE_STRUCTURAL_EQUALITY_P (t
))
7802 hashval_t hashcode
= iterative_hash_object (TYPE_HASH (elt_type
), 0);
7804 hashcode
= iterative_hash_object (TYPE_HASH (index_type
), hashcode
);
7805 t
= type_hash_canon (hashcode
, t
);
7808 if (TYPE_CANONICAL (t
) == t
)
7810 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type
)
7811 || (index_type
&& TYPE_STRUCTURAL_EQUALITY_P (index_type
)))
7812 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7813 else if (TYPE_CANONICAL (elt_type
) != elt_type
7814 || (index_type
&& TYPE_CANONICAL (index_type
) != index_type
))
7816 = build_array_type_1 (TYPE_CANONICAL (elt_type
),
7818 ? TYPE_CANONICAL (index_type
) : NULL_TREE
,
7825 /* Wrapper around build_array_type_1 with SHARED set to true. */
7828 build_array_type (tree elt_type
, tree index_type
)
7830 return build_array_type_1 (elt_type
, index_type
, true);
7833 /* Wrapper around build_array_type_1 with SHARED set to false. */
7836 build_nonshared_array_type (tree elt_type
, tree index_type
)
7838 return build_array_type_1 (elt_type
, index_type
, false);
7841 /* Return a representation of ELT_TYPE[NELTS], using indices of type
7845 build_array_type_nelts (tree elt_type
, unsigned HOST_WIDE_INT nelts
)
7847 return build_array_type (elt_type
, build_index_type (size_int (nelts
- 1)));
7850 /* Recursively examines the array elements of TYPE, until a non-array
7851 element type is found. */
7854 strip_array_types (tree type
)
7856 while (TREE_CODE (type
) == ARRAY_TYPE
)
7857 type
= TREE_TYPE (type
);
7862 /* Computes the canonical argument types from the argument type list
7865 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
7866 on entry to this function, or if any of the ARGTYPES are
7869 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
7870 true on entry to this function, or if any of the ARGTYPES are
7873 Returns a canonical argument list, which may be ARGTYPES when the
7874 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
7875 true) or would not differ from ARGTYPES. */
7878 maybe_canonicalize_argtypes (tree argtypes
,
7879 bool *any_structural_p
,
7880 bool *any_noncanonical_p
)
7883 bool any_noncanonical_argtypes_p
= false;
7885 for (arg
= argtypes
; arg
&& !(*any_structural_p
); arg
= TREE_CHAIN (arg
))
7887 if (!TREE_VALUE (arg
) || TREE_VALUE (arg
) == error_mark_node
)
7888 /* Fail gracefully by stating that the type is structural. */
7889 *any_structural_p
= true;
7890 else if (TYPE_STRUCTURAL_EQUALITY_P (TREE_VALUE (arg
)))
7891 *any_structural_p
= true;
7892 else if (TYPE_CANONICAL (TREE_VALUE (arg
)) != TREE_VALUE (arg
)
7893 || TREE_PURPOSE (arg
))
7894 /* If the argument has a default argument, we consider it
7895 non-canonical even though the type itself is canonical.
7896 That way, different variants of function and method types
7897 with default arguments will all point to the variant with
7898 no defaults as their canonical type. */
7899 any_noncanonical_argtypes_p
= true;
7902 if (*any_structural_p
)
7905 if (any_noncanonical_argtypes_p
)
7907 /* Build the canonical list of argument types. */
7908 tree canon_argtypes
= NULL_TREE
;
7909 bool is_void
= false;
7911 for (arg
= argtypes
; arg
; arg
= TREE_CHAIN (arg
))
7913 if (arg
== void_list_node
)
7916 canon_argtypes
= tree_cons (NULL_TREE
,
7917 TYPE_CANONICAL (TREE_VALUE (arg
)),
7921 canon_argtypes
= nreverse (canon_argtypes
);
7923 canon_argtypes
= chainon (canon_argtypes
, void_list_node
);
7925 /* There is a non-canonical type. */
7926 *any_noncanonical_p
= true;
7927 return canon_argtypes
;
7930 /* The canonical argument types are the same as ARGTYPES. */
7934 /* Construct, lay out and return
7935 the type of functions returning type VALUE_TYPE
7936 given arguments of types ARG_TYPES.
7937 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
7938 are data type nodes for the arguments of the function.
7939 If such a type has already been constructed, reuse it. */
7942 build_function_type (tree value_type
, tree arg_types
)
7945 hashval_t hashcode
= 0;
7946 bool any_structural_p
, any_noncanonical_p
;
7947 tree canon_argtypes
;
7949 if (TREE_CODE (value_type
) == FUNCTION_TYPE
)
7951 error ("function return type cannot be function");
7952 value_type
= integer_type_node
;
7955 /* Make a node of the sort we want. */
7956 t
= make_node (FUNCTION_TYPE
);
7957 TREE_TYPE (t
) = value_type
;
7958 TYPE_ARG_TYPES (t
) = arg_types
;
7960 /* If we already have such a type, use the old one. */
7961 hashcode
= iterative_hash_object (TYPE_HASH (value_type
), hashcode
);
7962 hashcode
= type_hash_list (arg_types
, hashcode
);
7963 t
= type_hash_canon (hashcode
, t
);
7965 /* Set up the canonical type. */
7966 any_structural_p
= TYPE_STRUCTURAL_EQUALITY_P (value_type
);
7967 any_noncanonical_p
= TYPE_CANONICAL (value_type
) != value_type
;
7968 canon_argtypes
= maybe_canonicalize_argtypes (arg_types
,
7970 &any_noncanonical_p
);
7971 if (any_structural_p
)
7972 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7973 else if (any_noncanonical_p
)
7974 TYPE_CANONICAL (t
) = build_function_type (TYPE_CANONICAL (value_type
),
7977 if (!COMPLETE_TYPE_P (t
))
7982 /* Build a function type. The RETURN_TYPE is the type returned by the
7983 function. If VAARGS is set, no void_type_node is appended to the
7984 the list. ARGP must be always be terminated be a NULL_TREE. */
7987 build_function_type_list_1 (bool vaargs
, tree return_type
, va_list argp
)
7991 t
= va_arg (argp
, tree
);
7992 for (args
= NULL_TREE
; t
!= NULL_TREE
; t
= va_arg (argp
, tree
))
7993 args
= tree_cons (NULL_TREE
, t
, args
);
7998 if (args
!= NULL_TREE
)
7999 args
= nreverse (args
);
8000 gcc_assert (last
!= void_list_node
);
8002 else if (args
== NULL_TREE
)
8003 args
= void_list_node
;
8007 args
= nreverse (args
);
8008 TREE_CHAIN (last
) = void_list_node
;
8010 args
= build_function_type (return_type
, args
);
8015 /* Build a function type. The RETURN_TYPE is the type returned by the
8016 function. If additional arguments are provided, they are
8017 additional argument types. The list of argument types must always
8018 be terminated by NULL_TREE. */
8021 build_function_type_list (tree return_type
, ...)
8026 va_start (p
, return_type
);
8027 args
= build_function_type_list_1 (false, return_type
, p
);
8032 /* Build a variable argument function type. The RETURN_TYPE is the
8033 type returned by the function. If additional arguments are provided,
8034 they are additional argument types. The list of argument types must
8035 always be terminated by NULL_TREE. */
8038 build_varargs_function_type_list (tree return_type
, ...)
8043 va_start (p
, return_type
);
8044 args
= build_function_type_list_1 (true, return_type
, p
);
8050 /* Build a function type. RETURN_TYPE is the type returned by the
8051 function; VAARGS indicates whether the function takes varargs. The
8052 function takes N named arguments, the types of which are provided in
8056 build_function_type_array_1 (bool vaargs
, tree return_type
, int n
,
8060 tree t
= vaargs
? NULL_TREE
: void_list_node
;
8062 for (i
= n
- 1; i
>= 0; i
--)
8063 t
= tree_cons (NULL_TREE
, arg_types
[i
], t
);
8065 return build_function_type (return_type
, t
);
8068 /* Build a function type. RETURN_TYPE is the type returned by the
8069 function. The function takes N named arguments, the types of which
8070 are provided in ARG_TYPES. */
8073 build_function_type_array (tree return_type
, int n
, tree
*arg_types
)
8075 return build_function_type_array_1 (false, return_type
, n
, arg_types
);
8078 /* Build a variable argument function type. RETURN_TYPE is the type
8079 returned by the function. The function takes N named arguments, the
8080 types of which are provided in ARG_TYPES. */
8083 build_varargs_function_type_array (tree return_type
, int n
, tree
*arg_types
)
8085 return build_function_type_array_1 (true, return_type
, n
, arg_types
);
8088 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
8089 and ARGTYPES (a TREE_LIST) are the return type and arguments types
8090 for the method. An implicit additional parameter (of type
8091 pointer-to-BASETYPE) is added to the ARGTYPES. */
8094 build_method_type_directly (tree basetype
,
8101 bool any_structural_p
, any_noncanonical_p
;
8102 tree canon_argtypes
;
8104 /* Make a node of the sort we want. */
8105 t
= make_node (METHOD_TYPE
);
8107 TYPE_METHOD_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
8108 TREE_TYPE (t
) = rettype
;
8109 ptype
= build_pointer_type (basetype
);
8111 /* The actual arglist for this function includes a "hidden" argument
8112 which is "this". Put it into the list of argument types. */
8113 argtypes
= tree_cons (NULL_TREE
, ptype
, argtypes
);
8114 TYPE_ARG_TYPES (t
) = argtypes
;
8116 /* If we already have such a type, use the old one. */
8117 hashcode
= iterative_hash_object (TYPE_HASH (basetype
), hashcode
);
8118 hashcode
= iterative_hash_object (TYPE_HASH (rettype
), hashcode
);
8119 hashcode
= type_hash_list (argtypes
, hashcode
);
8120 t
= type_hash_canon (hashcode
, t
);
8122 /* Set up the canonical type. */
8124 = (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
8125 || TYPE_STRUCTURAL_EQUALITY_P (rettype
));
8127 = (TYPE_CANONICAL (basetype
) != basetype
8128 || TYPE_CANONICAL (rettype
) != rettype
);
8129 canon_argtypes
= maybe_canonicalize_argtypes (TREE_CHAIN (argtypes
),
8131 &any_noncanonical_p
);
8132 if (any_structural_p
)
8133 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8134 else if (any_noncanonical_p
)
8136 = build_method_type_directly (TYPE_CANONICAL (basetype
),
8137 TYPE_CANONICAL (rettype
),
8139 if (!COMPLETE_TYPE_P (t
))
8145 /* Construct, lay out and return the type of methods belonging to class
8146 BASETYPE and whose arguments and values are described by TYPE.
8147 If that type exists already, reuse it.
8148 TYPE must be a FUNCTION_TYPE node. */
8151 build_method_type (tree basetype
, tree type
)
8153 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
8155 return build_method_type_directly (basetype
,
8157 TYPE_ARG_TYPES (type
));
8160 /* Construct, lay out and return the type of offsets to a value
8161 of type TYPE, within an object of type BASETYPE.
8162 If a suitable offset type exists already, reuse it. */
8165 build_offset_type (tree basetype
, tree type
)
8168 hashval_t hashcode
= 0;
8170 /* Make a node of the sort we want. */
8171 t
= make_node (OFFSET_TYPE
);
8173 TYPE_OFFSET_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
8174 TREE_TYPE (t
) = type
;
8176 /* If we already have such a type, use the old one. */
8177 hashcode
= iterative_hash_object (TYPE_HASH (basetype
), hashcode
);
8178 hashcode
= iterative_hash_object (TYPE_HASH (type
), hashcode
);
8179 t
= type_hash_canon (hashcode
, t
);
8181 if (!COMPLETE_TYPE_P (t
))
8184 if (TYPE_CANONICAL (t
) == t
)
8186 if (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
8187 || TYPE_STRUCTURAL_EQUALITY_P (type
))
8188 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8189 else if (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)) != basetype
8190 || TYPE_CANONICAL (type
) != type
)
8192 = build_offset_type (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)),
8193 TYPE_CANONICAL (type
));
8199 /* Create a complex type whose components are COMPONENT_TYPE. */
8202 build_complex_type (tree component_type
)
8207 gcc_assert (INTEGRAL_TYPE_P (component_type
)
8208 || SCALAR_FLOAT_TYPE_P (component_type
)
8209 || FIXED_POINT_TYPE_P (component_type
));
8211 /* Make a node of the sort we want. */
8212 t
= make_node (COMPLEX_TYPE
);
8214 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (component_type
);
8216 /* If we already have such a type, use the old one. */
8217 hashcode
= iterative_hash_object (TYPE_HASH (component_type
), 0);
8218 t
= type_hash_canon (hashcode
, t
);
8220 if (!COMPLETE_TYPE_P (t
))
8223 if (TYPE_CANONICAL (t
) == t
)
8225 if (TYPE_STRUCTURAL_EQUALITY_P (component_type
))
8226 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8227 else if (TYPE_CANONICAL (component_type
) != component_type
)
8229 = build_complex_type (TYPE_CANONICAL (component_type
));
8232 /* We need to create a name, since complex is a fundamental type. */
8233 if (! TYPE_NAME (t
))
8236 if (component_type
== char_type_node
)
8237 name
= "complex char";
8238 else if (component_type
== signed_char_type_node
)
8239 name
= "complex signed char";
8240 else if (component_type
== unsigned_char_type_node
)
8241 name
= "complex unsigned char";
8242 else if (component_type
== short_integer_type_node
)
8243 name
= "complex short int";
8244 else if (component_type
== short_unsigned_type_node
)
8245 name
= "complex short unsigned int";
8246 else if (component_type
== integer_type_node
)
8247 name
= "complex int";
8248 else if (component_type
== unsigned_type_node
)
8249 name
= "complex unsigned int";
8250 else if (component_type
== long_integer_type_node
)
8251 name
= "complex long int";
8252 else if (component_type
== long_unsigned_type_node
)
8253 name
= "complex long unsigned int";
8254 else if (component_type
== long_long_integer_type_node
)
8255 name
= "complex long long int";
8256 else if (component_type
== long_long_unsigned_type_node
)
8257 name
= "complex long long unsigned int";
8262 TYPE_NAME (t
) = build_decl (UNKNOWN_LOCATION
, TYPE_DECL
,
8263 get_identifier (name
), t
);
8266 return build_qualified_type (t
, TYPE_QUALS (component_type
));
8269 /* If TYPE is a real or complex floating-point type and the target
8270 does not directly support arithmetic on TYPE then return the wider
8271 type to be used for arithmetic on TYPE. Otherwise, return
8275 excess_precision_type (tree type
)
8277 if (flag_excess_precision
!= EXCESS_PRECISION_FAST
)
8279 int flt_eval_method
= TARGET_FLT_EVAL_METHOD
;
8280 switch (TREE_CODE (type
))
8283 switch (flt_eval_method
)
8286 if (TYPE_MODE (type
) == TYPE_MODE (float_type_node
))
8287 return double_type_node
;
8290 if (TYPE_MODE (type
) == TYPE_MODE (float_type_node
)
8291 || TYPE_MODE (type
) == TYPE_MODE (double_type_node
))
8292 return long_double_type_node
;
8299 if (TREE_CODE (TREE_TYPE (type
)) != REAL_TYPE
)
8301 switch (flt_eval_method
)
8304 if (TYPE_MODE (TREE_TYPE (type
)) == TYPE_MODE (float_type_node
))
8305 return complex_double_type_node
;
8308 if (TYPE_MODE (TREE_TYPE (type
)) == TYPE_MODE (float_type_node
)
8309 || (TYPE_MODE (TREE_TYPE (type
))
8310 == TYPE_MODE (double_type_node
)))
8311 return complex_long_double_type_node
;
8324 /* Return OP, stripped of any conversions to wider types as much as is safe.
8325 Converting the value back to OP's type makes a value equivalent to OP.
8327 If FOR_TYPE is nonzero, we return a value which, if converted to
8328 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
8330 OP must have integer, real or enumeral type. Pointers are not allowed!
8332 There are some cases where the obvious value we could return
8333 would regenerate to OP if converted to OP's type,
8334 but would not extend like OP to wider types.
8335 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
8336 For example, if OP is (unsigned short)(signed char)-1,
8337 we avoid returning (signed char)-1 if FOR_TYPE is int,
8338 even though extending that to an unsigned short would regenerate OP,
8339 since the result of extending (signed char)-1 to (int)
8340 is different from (int) OP. */
8343 get_unwidened (tree op
, tree for_type
)
8345 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
8346 tree type
= TREE_TYPE (op
);
8348 = TYPE_PRECISION (for_type
!= 0 ? for_type
: type
);
8350 = (for_type
!= 0 && for_type
!= type
8351 && final_prec
> TYPE_PRECISION (type
)
8352 && TYPE_UNSIGNED (type
));
8355 while (CONVERT_EXPR_P (op
))
8359 /* TYPE_PRECISION on vector types has different meaning
8360 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
8361 so avoid them here. */
8362 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op
, 0))) == VECTOR_TYPE
)
8365 bitschange
= TYPE_PRECISION (TREE_TYPE (op
))
8366 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0)));
8368 /* Truncations are many-one so cannot be removed.
8369 Unless we are later going to truncate down even farther. */
8371 && final_prec
> TYPE_PRECISION (TREE_TYPE (op
)))
8374 /* See what's inside this conversion. If we decide to strip it,
8376 op
= TREE_OPERAND (op
, 0);
8378 /* If we have not stripped any zero-extensions (uns is 0),
8379 we can strip any kind of extension.
8380 If we have previously stripped a zero-extension,
8381 only zero-extensions can safely be stripped.
8382 Any extension can be stripped if the bits it would produce
8383 are all going to be discarded later by truncating to FOR_TYPE. */
8387 if (! uns
|| final_prec
<= TYPE_PRECISION (TREE_TYPE (op
)))
8389 /* TYPE_UNSIGNED says whether this is a zero-extension.
8390 Let's avoid computing it if it does not affect WIN
8391 and if UNS will not be needed again. */
8393 || CONVERT_EXPR_P (op
))
8394 && TYPE_UNSIGNED (TREE_TYPE (op
)))
8402 /* If we finally reach a constant see if it fits in for_type and
8403 in that case convert it. */
8405 && TREE_CODE (win
) == INTEGER_CST
8406 && TREE_TYPE (win
) != for_type
8407 && int_fits_type_p (win
, for_type
))
8408 win
= fold_convert (for_type
, win
);
8413 /* Return OP or a simpler expression for a narrower value
8414 which can be sign-extended or zero-extended to give back OP.
8415 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
8416 or 0 if the value should be sign-extended. */
8419 get_narrower (tree op
, int *unsignedp_ptr
)
8424 bool integral_p
= INTEGRAL_TYPE_P (TREE_TYPE (op
));
8426 while (TREE_CODE (op
) == NOP_EXPR
)
8429 = (TYPE_PRECISION (TREE_TYPE (op
))
8430 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0))));
8432 /* Truncations are many-one so cannot be removed. */
8436 /* See what's inside this conversion. If we decide to strip it,
8441 op
= TREE_OPERAND (op
, 0);
8442 /* An extension: the outermost one can be stripped,
8443 but remember whether it is zero or sign extension. */
8445 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
8446 /* Otherwise, if a sign extension has been stripped,
8447 only sign extensions can now be stripped;
8448 if a zero extension has been stripped, only zero-extensions. */
8449 else if (uns
!= TYPE_UNSIGNED (TREE_TYPE (op
)))
8453 else /* bitschange == 0 */
8455 /* A change in nominal type can always be stripped, but we must
8456 preserve the unsignedness. */
8458 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
8460 op
= TREE_OPERAND (op
, 0);
8461 /* Keep trying to narrow, but don't assign op to win if it
8462 would turn an integral type into something else. */
8463 if (INTEGRAL_TYPE_P (TREE_TYPE (op
)) != integral_p
)
8470 if (TREE_CODE (op
) == COMPONENT_REF
8471 /* Since type_for_size always gives an integer type. */
8472 && TREE_CODE (TREE_TYPE (op
)) != REAL_TYPE
8473 && TREE_CODE (TREE_TYPE (op
)) != FIXED_POINT_TYPE
8474 /* Ensure field is laid out already. */
8475 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0
8476 && tree_fits_uhwi_p (DECL_SIZE (TREE_OPERAND (op
, 1))))
8478 unsigned HOST_WIDE_INT innerprec
8479 = tree_to_uhwi (DECL_SIZE (TREE_OPERAND (op
, 1)));
8480 int unsignedp
= (DECL_UNSIGNED (TREE_OPERAND (op
, 1))
8481 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op
, 1))));
8482 tree type
= lang_hooks
.types
.type_for_size (innerprec
, unsignedp
);
8484 /* We can get this structure field in a narrower type that fits it,
8485 but the resulting extension to its nominal type (a fullword type)
8486 must satisfy the same conditions as for other extensions.
8488 Do this only for fields that are aligned (not bit-fields),
8489 because when bit-field insns will be used there is no
8490 advantage in doing this. */
8492 if (innerprec
< TYPE_PRECISION (TREE_TYPE (op
))
8493 && ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1))
8494 && (first
|| uns
== DECL_UNSIGNED (TREE_OPERAND (op
, 1)))
8498 uns
= DECL_UNSIGNED (TREE_OPERAND (op
, 1));
8499 win
= fold_convert (type
, op
);
8503 *unsignedp_ptr
= uns
;
8507 /* Returns true if integer constant C has a value that is permissible
8508 for type TYPE (an INTEGER_TYPE). */
8511 int_fits_type_p (const_tree c
, const_tree type
)
8513 tree type_low_bound
, type_high_bound
;
8514 bool ok_for_low_bound
, ok_for_high_bound
;
8515 signop sgn_c
= TYPE_SIGN (TREE_TYPE (c
));
8518 type_low_bound
= TYPE_MIN_VALUE (type
);
8519 type_high_bound
= TYPE_MAX_VALUE (type
);
8521 /* If at least one bound of the type is a constant integer, we can check
8522 ourselves and maybe make a decision. If no such decision is possible, but
8523 this type is a subtype, try checking against that. Otherwise, use
8524 fits_to_tree_p, which checks against the precision.
8526 Compute the status for each possibly constant bound, and return if we see
8527 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
8528 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
8529 for "constant known to fit". */
8531 /* Check if c >= type_low_bound. */
8532 if (type_low_bound
&& TREE_CODE (type_low_bound
) == INTEGER_CST
)
8534 if (tree_int_cst_lt (c
, type_low_bound
))
8536 ok_for_low_bound
= true;
8539 ok_for_low_bound
= false;
8541 /* Check if c <= type_high_bound. */
8542 if (type_high_bound
&& TREE_CODE (type_high_bound
) == INTEGER_CST
)
8544 if (tree_int_cst_lt (type_high_bound
, c
))
8546 ok_for_high_bound
= true;
8549 ok_for_high_bound
= false;
8551 /* If the constant fits both bounds, the result is known. */
8552 if (ok_for_low_bound
&& ok_for_high_bound
)
8555 /* Perform some generic filtering which may allow making a decision
8556 even if the bounds are not constant. First, negative integers
8557 never fit in unsigned types, */
8558 if (TYPE_UNSIGNED (type
) && sgn_c
== SIGNED
&& wi::neg_p (c
))
8561 /* Second, narrower types always fit in wider ones. */
8562 if (TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (c
)))
8565 /* Third, unsigned integers with top bit set never fit signed types. */
8566 if (!TYPE_UNSIGNED (type
) && sgn_c
== UNSIGNED
)
8568 int prec
= GET_MODE_PRECISION (TYPE_MODE (TREE_TYPE (c
))) - 1;
8569 if (prec
< TYPE_PRECISION (TREE_TYPE (c
)))
8571 /* When a tree_cst is converted to a wide-int, the precision
8572 is taken from the type. However, if the precision of the
8573 mode underneath the type is smaller than that, it is
8574 possible that the value will not fit. The test below
8575 fails if any bit is set between the sign bit of the
8576 underlying mode and the top bit of the type. */
8577 if (wi::ne_p (wi::zext (c
, prec
- 1), c
))
8580 else if (wi::neg_p (c
))
8584 /* If we haven't been able to decide at this point, there nothing more we
8585 can check ourselves here. Look at the base type if we have one and it
8586 has the same precision. */
8587 if (TREE_CODE (type
) == INTEGER_TYPE
8588 && TREE_TYPE (type
) != 0
8589 && TYPE_PRECISION (type
) == TYPE_PRECISION (TREE_TYPE (type
)))
8591 type
= TREE_TYPE (type
);
8595 /* Or to fits_to_tree_p, if nothing else. */
8596 return wi::fits_to_tree_p (c
, type
);
8599 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
8600 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
8601 represented (assuming two's-complement arithmetic) within the bit
8602 precision of the type are returned instead. */
8605 get_type_static_bounds (const_tree type
, mpz_t min
, mpz_t max
)
8607 if (!POINTER_TYPE_P (type
) && TYPE_MIN_VALUE (type
)
8608 && TREE_CODE (TYPE_MIN_VALUE (type
)) == INTEGER_CST
)
8609 wi::to_mpz (TYPE_MIN_VALUE (type
), min
, TYPE_SIGN (type
));
8612 if (TYPE_UNSIGNED (type
))
8613 mpz_set_ui (min
, 0);
8616 wide_int mn
= wi::min_value (TYPE_PRECISION (type
), SIGNED
);
8617 wi::to_mpz (mn
, min
, SIGNED
);
8621 if (!POINTER_TYPE_P (type
) && TYPE_MAX_VALUE (type
)
8622 && TREE_CODE (TYPE_MAX_VALUE (type
)) == INTEGER_CST
)
8623 wi::to_mpz (TYPE_MAX_VALUE (type
), max
, TYPE_SIGN (type
));
8626 wide_int mn
= wi::max_value (TYPE_PRECISION (type
), TYPE_SIGN (type
));
8627 wi::to_mpz (mn
, max
, TYPE_SIGN (type
));
8631 /* Return true if VAR is an automatic variable defined in function FN. */
8634 auto_var_in_fn_p (const_tree var
, const_tree fn
)
8636 return (DECL_P (var
) && DECL_CONTEXT (var
) == fn
8637 && ((((TREE_CODE (var
) == VAR_DECL
&& ! DECL_EXTERNAL (var
))
8638 || TREE_CODE (var
) == PARM_DECL
)
8639 && ! TREE_STATIC (var
))
8640 || TREE_CODE (var
) == LABEL_DECL
8641 || TREE_CODE (var
) == RESULT_DECL
));
8644 /* Subprogram of following function. Called by walk_tree.
8646 Return *TP if it is an automatic variable or parameter of the
8647 function passed in as DATA. */
8650 find_var_from_fn (tree
*tp
, int *walk_subtrees
, void *data
)
8652 tree fn
= (tree
) data
;
8657 else if (DECL_P (*tp
)
8658 && auto_var_in_fn_p (*tp
, fn
))
8664 /* Returns true if T is, contains, or refers to a type with variable
8665 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
8666 arguments, but not the return type. If FN is nonzero, only return
8667 true if a modifier of the type or position of FN is a variable or
8668 parameter inside FN.
8670 This concept is more general than that of C99 'variably modified types':
8671 in C99, a struct type is never variably modified because a VLA may not
8672 appear as a structure member. However, in GNU C code like:
8674 struct S { int i[f()]; };
8676 is valid, and other languages may define similar constructs. */
8679 variably_modified_type_p (tree type
, tree fn
)
8683 /* Test if T is either variable (if FN is zero) or an expression containing
8684 a variable in FN. If TYPE isn't gimplified, return true also if
8685 gimplify_one_sizepos would gimplify the expression into a local
8687 #define RETURN_TRUE_IF_VAR(T) \
8688 do { tree _t = (T); \
8689 if (_t != NULL_TREE \
8690 && _t != error_mark_node \
8691 && TREE_CODE (_t) != INTEGER_CST \
8692 && TREE_CODE (_t) != PLACEHOLDER_EXPR \
8694 || (!TYPE_SIZES_GIMPLIFIED (type) \
8695 && !is_gimple_sizepos (_t)) \
8696 || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
8697 return true; } while (0)
8699 if (type
== error_mark_node
)
8702 /* If TYPE itself has variable size, it is variably modified. */
8703 RETURN_TRUE_IF_VAR (TYPE_SIZE (type
));
8704 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type
));
8706 switch (TREE_CODE (type
))
8709 case REFERENCE_TYPE
:
8711 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
8717 /* If TYPE is a function type, it is variably modified if the
8718 return type is variably modified. */
8719 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
8725 case FIXED_POINT_TYPE
:
8728 /* Scalar types are variably modified if their end points
8730 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type
));
8731 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type
));
8736 case QUAL_UNION_TYPE
:
8737 /* We can't see if any of the fields are variably-modified by the
8738 definition we normally use, since that would produce infinite
8739 recursion via pointers. */
8740 /* This is variably modified if some field's type is. */
8741 for (t
= TYPE_FIELDS (type
); t
; t
= DECL_CHAIN (t
))
8742 if (TREE_CODE (t
) == FIELD_DECL
)
8744 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t
));
8745 RETURN_TRUE_IF_VAR (DECL_SIZE (t
));
8746 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t
));
8748 if (TREE_CODE (type
) == QUAL_UNION_TYPE
)
8749 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t
));
8754 /* Do not call ourselves to avoid infinite recursion. This is
8755 variably modified if the element type is. */
8756 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type
)));
8757 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type
)));
8764 /* The current language may have other cases to check, but in general,
8765 all other types are not variably modified. */
8766 return lang_hooks
.tree_inlining
.var_mod_type_p (type
, fn
);
8768 #undef RETURN_TRUE_IF_VAR
8771 /* Given a DECL or TYPE, return the scope in which it was declared, or
8772 NULL_TREE if there is no containing scope. */
8775 get_containing_scope (const_tree t
)
8777 return (TYPE_P (t
) ? TYPE_CONTEXT (t
) : DECL_CONTEXT (t
));
8780 /* Return the innermost context enclosing DECL that is
8781 a FUNCTION_DECL, or zero if none. */
8784 decl_function_context (const_tree decl
)
8788 if (TREE_CODE (decl
) == ERROR_MARK
)
8791 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
8792 where we look up the function at runtime. Such functions always take
8793 a first argument of type 'pointer to real context'.
8795 C++ should really be fixed to use DECL_CONTEXT for the real context,
8796 and use something else for the "virtual context". */
8797 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VINDEX (decl
))
8800 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl
)))));
8802 context
= DECL_CONTEXT (decl
);
8804 while (context
&& TREE_CODE (context
) != FUNCTION_DECL
)
8806 if (TREE_CODE (context
) == BLOCK
)
8807 context
= BLOCK_SUPERCONTEXT (context
);
8809 context
= get_containing_scope (context
);
8815 /* Return the innermost context enclosing DECL that is
8816 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
8817 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
8820 decl_type_context (const_tree decl
)
8822 tree context
= DECL_CONTEXT (decl
);
8825 switch (TREE_CODE (context
))
8827 case NAMESPACE_DECL
:
8828 case TRANSLATION_UNIT_DECL
:
8833 case QUAL_UNION_TYPE
:
8838 context
= DECL_CONTEXT (context
);
8842 context
= BLOCK_SUPERCONTEXT (context
);
8852 /* CALL is a CALL_EXPR. Return the declaration for the function
8853 called, or NULL_TREE if the called function cannot be
8857 get_callee_fndecl (const_tree call
)
8861 if (call
== error_mark_node
)
8862 return error_mark_node
;
8864 /* It's invalid to call this function with anything but a
8866 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
8868 /* The first operand to the CALL is the address of the function
8870 addr
= CALL_EXPR_FN (call
);
8874 /* If this is a readonly function pointer, extract its initial value. */
8875 if (DECL_P (addr
) && TREE_CODE (addr
) != FUNCTION_DECL
8876 && TREE_READONLY (addr
) && ! TREE_THIS_VOLATILE (addr
)
8877 && DECL_INITIAL (addr
))
8878 addr
= DECL_INITIAL (addr
);
8880 /* If the address is just `&f' for some function `f', then we know
8881 that `f' is being called. */
8882 if (TREE_CODE (addr
) == ADDR_EXPR
8883 && TREE_CODE (TREE_OPERAND (addr
, 0)) == FUNCTION_DECL
)
8884 return TREE_OPERAND (addr
, 0);
8886 /* We couldn't figure out what was being called. */
8890 /* Print debugging information about tree nodes generated during the compile,
8891 and any language-specific information. */
8894 dump_tree_statistics (void)
8896 if (GATHER_STATISTICS
)
8899 int total_nodes
, total_bytes
;
8900 fprintf (stderr
, "Kind Nodes Bytes\n");
8901 fprintf (stderr
, "---------------------------------------\n");
8902 total_nodes
= total_bytes
= 0;
8903 for (i
= 0; i
< (int) all_kinds
; i
++)
8905 fprintf (stderr
, "%-20s %7d %10d\n", tree_node_kind_names
[i
],
8906 tree_node_counts
[i
], tree_node_sizes
[i
]);
8907 total_nodes
+= tree_node_counts
[i
];
8908 total_bytes
+= tree_node_sizes
[i
];
8910 fprintf (stderr
, "---------------------------------------\n");
8911 fprintf (stderr
, "%-20s %7d %10d\n", "Total", total_nodes
, total_bytes
);
8912 fprintf (stderr
, "---------------------------------------\n");
8913 fprintf (stderr
, "Code Nodes\n");
8914 fprintf (stderr
, "----------------------------\n");
8915 for (i
= 0; i
< (int) MAX_TREE_CODES
; i
++)
8916 fprintf (stderr
, "%-20s %7d\n", get_tree_code_name ((enum tree_code
) i
),
8917 tree_code_counts
[i
]);
8918 fprintf (stderr
, "----------------------------\n");
8919 ssanames_print_statistics ();
8920 phinodes_print_statistics ();
8923 fprintf (stderr
, "(No per-node statistics)\n");
8925 print_type_hash_statistics ();
8926 print_debug_expr_statistics ();
8927 print_value_expr_statistics ();
8928 lang_hooks
.print_statistics ();
8931 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
8933 /* Generate a crc32 of a byte. */
8936 crc32_unsigned_bits (unsigned chksum
, unsigned value
, unsigned bits
)
8940 for (ix
= bits
; ix
--; value
<<= 1)
8944 feedback
= (value
^ chksum
) & 0x80000000 ? 0x04c11db7 : 0;
8951 /* Generate a crc32 of a 32-bit unsigned. */
8954 crc32_unsigned (unsigned chksum
, unsigned value
)
8956 return crc32_unsigned_bits (chksum
, value
, 32);
8959 /* Generate a crc32 of a byte. */
8962 crc32_byte (unsigned chksum
, char byte
)
8964 return crc32_unsigned_bits (chksum
, (unsigned) byte
<< 24, 8);
8967 /* Generate a crc32 of a string. */
8970 crc32_string (unsigned chksum
, const char *string
)
8974 chksum
= crc32_byte (chksum
, *string
);
8980 /* P is a string that will be used in a symbol. Mask out any characters
8981 that are not valid in that context. */
8984 clean_symbol_name (char *p
)
8988 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
8991 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
8998 /* Generate a name for a special-purpose function.
8999 The generated name may need to be unique across the whole link.
9000 Changes to this function may also require corresponding changes to
9001 xstrdup_mask_random.
9002 TYPE is some string to identify the purpose of this function to the
9003 linker or collect2; it must start with an uppercase letter,
9005 I - for constructors
9007 N - for C++ anonymous namespaces
9008 F - for DWARF unwind frame information. */
9011 get_file_function_name (const char *type
)
9017 /* If we already have a name we know to be unique, just use that. */
9018 if (first_global_object_name
)
9019 p
= q
= ASTRDUP (first_global_object_name
);
9020 /* If the target is handling the constructors/destructors, they
9021 will be local to this file and the name is only necessary for
9023 We also assign sub_I and sub_D sufixes to constructors called from
9024 the global static constructors. These are always local. */
9025 else if (((type
[0] == 'I' || type
[0] == 'D') && targetm
.have_ctors_dtors
)
9026 || (strncmp (type
, "sub_", 4) == 0
9027 && (type
[4] == 'I' || type
[4] == 'D')))
9029 const char *file
= main_input_filename
;
9031 file
= LOCATION_FILE (input_location
);
9032 /* Just use the file's basename, because the full pathname
9033 might be quite long. */
9034 p
= q
= ASTRDUP (lbasename (file
));
9038 /* Otherwise, the name must be unique across the entire link.
9039 We don't have anything that we know to be unique to this translation
9040 unit, so use what we do have and throw in some randomness. */
9042 const char *name
= weak_global_object_name
;
9043 const char *file
= main_input_filename
;
9048 file
= LOCATION_FILE (input_location
);
9050 len
= strlen (file
);
9051 q
= (char *) alloca (9 + 17 + len
+ 1);
9052 memcpy (q
, file
, len
+ 1);
9054 snprintf (q
+ len
, 9 + 17 + 1, "_%08X_" HOST_WIDE_INT_PRINT_HEX
,
9055 crc32_string (0, name
), get_random_seed (false));
9060 clean_symbol_name (q
);
9061 buf
= (char *) alloca (sizeof (FILE_FUNCTION_FORMAT
) + strlen (p
)
9064 /* Set up the name of the file-level functions we may need.
9065 Use a global object (which is already required to be unique over
9066 the program) rather than the file name (which imposes extra
9068 sprintf (buf
, FILE_FUNCTION_FORMAT
, type
, p
);
9070 return get_identifier (buf
);
9073 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
9075 /* Complain that the tree code of NODE does not match the expected 0
9076 terminated list of trailing codes. The trailing code list can be
9077 empty, for a more vague error message. FILE, LINE, and FUNCTION
9078 are of the caller. */
9081 tree_check_failed (const_tree node
, const char *file
,
9082 int line
, const char *function
, ...)
9086 unsigned length
= 0;
9087 enum tree_code code
;
9089 va_start (args
, function
);
9090 while ((code
= (enum tree_code
) va_arg (args
, int)))
9091 length
+= 4 + strlen (get_tree_code_name (code
));
9096 va_start (args
, function
);
9097 length
+= strlen ("expected ");
9098 buffer
= tmp
= (char *) alloca (length
);
9100 while ((code
= (enum tree_code
) va_arg (args
, int)))
9102 const char *prefix
= length
? " or " : "expected ";
9104 strcpy (tmp
+ length
, prefix
);
9105 length
+= strlen (prefix
);
9106 strcpy (tmp
+ length
, get_tree_code_name (code
));
9107 length
+= strlen (get_tree_code_name (code
));
9112 buffer
= "unexpected node";
9114 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9115 buffer
, get_tree_code_name (TREE_CODE (node
)),
9116 function
, trim_filename (file
), line
);
9119 /* Complain that the tree code of NODE does match the expected 0
9120 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
9124 tree_not_check_failed (const_tree node
, const char *file
,
9125 int line
, const char *function
, ...)
9129 unsigned length
= 0;
9130 enum tree_code code
;
9132 va_start (args
, function
);
9133 while ((code
= (enum tree_code
) va_arg (args
, int)))
9134 length
+= 4 + strlen (get_tree_code_name (code
));
9136 va_start (args
, function
);
9137 buffer
= (char *) alloca (length
);
9139 while ((code
= (enum tree_code
) va_arg (args
, int)))
9143 strcpy (buffer
+ length
, " or ");
9146 strcpy (buffer
+ length
, get_tree_code_name (code
));
9147 length
+= strlen (get_tree_code_name (code
));
9151 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
9152 buffer
, get_tree_code_name (TREE_CODE (node
)),
9153 function
, trim_filename (file
), line
);
9156 /* Similar to tree_check_failed, except that we check for a class of tree
9157 code, given in CL. */
9160 tree_class_check_failed (const_tree node
, const enum tree_code_class cl
,
9161 const char *file
, int line
, const char *function
)
9164 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
9165 TREE_CODE_CLASS_STRING (cl
),
9166 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
9167 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9170 /* Similar to tree_check_failed, except that instead of specifying a
9171 dozen codes, use the knowledge that they're all sequential. */
9174 tree_range_check_failed (const_tree node
, const char *file
, int line
,
9175 const char *function
, enum tree_code c1
,
9179 unsigned length
= 0;
9182 for (c
= c1
; c
<= c2
; ++c
)
9183 length
+= 4 + strlen (get_tree_code_name ((enum tree_code
) c
));
9185 length
+= strlen ("expected ");
9186 buffer
= (char *) alloca (length
);
9189 for (c
= c1
; c
<= c2
; ++c
)
9191 const char *prefix
= length
? " or " : "expected ";
9193 strcpy (buffer
+ length
, prefix
);
9194 length
+= strlen (prefix
);
9195 strcpy (buffer
+ length
, get_tree_code_name ((enum tree_code
) c
));
9196 length
+= strlen (get_tree_code_name ((enum tree_code
) c
));
9199 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9200 buffer
, get_tree_code_name (TREE_CODE (node
)),
9201 function
, trim_filename (file
), line
);
9205 /* Similar to tree_check_failed, except that we check that a tree does
9206 not have the specified code, given in CL. */
9209 tree_not_class_check_failed (const_tree node
, const enum tree_code_class cl
,
9210 const char *file
, int line
, const char *function
)
9213 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
9214 TREE_CODE_CLASS_STRING (cl
),
9215 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
9216 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9220 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
9223 omp_clause_check_failed (const_tree node
, const char *file
, int line
,
9224 const char *function
, enum omp_clause_code code
)
9226 internal_error ("tree check: expected omp_clause %s, have %s in %s, at %s:%d",
9227 omp_clause_code_name
[code
], get_tree_code_name (TREE_CODE (node
)),
9228 function
, trim_filename (file
), line
);
9232 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
9235 omp_clause_range_check_failed (const_tree node
, const char *file
, int line
,
9236 const char *function
, enum omp_clause_code c1
,
9237 enum omp_clause_code c2
)
9240 unsigned length
= 0;
9243 for (c
= c1
; c
<= c2
; ++c
)
9244 length
+= 4 + strlen (omp_clause_code_name
[c
]);
9246 length
+= strlen ("expected ");
9247 buffer
= (char *) alloca (length
);
9250 for (c
= c1
; c
<= c2
; ++c
)
9252 const char *prefix
= length
? " or " : "expected ";
9254 strcpy (buffer
+ length
, prefix
);
9255 length
+= strlen (prefix
);
9256 strcpy (buffer
+ length
, omp_clause_code_name
[c
]);
9257 length
+= strlen (omp_clause_code_name
[c
]);
9260 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9261 buffer
, omp_clause_code_name
[TREE_CODE (node
)],
9262 function
, trim_filename (file
), line
);
9266 #undef DEFTREESTRUCT
9267 #define DEFTREESTRUCT(VAL, NAME) NAME,
9269 static const char *ts_enum_names
[] = {
9270 #include "treestruct.def"
9272 #undef DEFTREESTRUCT
9274 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
9276 /* Similar to tree_class_check_failed, except that we check for
9277 whether CODE contains the tree structure identified by EN. */
9280 tree_contains_struct_check_failed (const_tree node
,
9281 const enum tree_node_structure_enum en
,
9282 const char *file
, int line
,
9283 const char *function
)
9286 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
9288 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9292 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9293 (dynamically sized) vector. */
9296 tree_int_cst_elt_check_failed (int idx
, int len
, const char *file
, int line
,
9297 const char *function
)
9300 ("tree check: accessed elt %d of tree_int_cst with %d elts in %s, at %s:%d",
9301 idx
+ 1, len
, function
, trim_filename (file
), line
);
9304 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9305 (dynamically sized) vector. */
9308 tree_vec_elt_check_failed (int idx
, int len
, const char *file
, int line
,
9309 const char *function
)
9312 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
9313 idx
+ 1, len
, function
, trim_filename (file
), line
);
9316 /* Similar to above, except that the check is for the bounds of the operand
9317 vector of an expression node EXP. */
9320 tree_operand_check_failed (int idx
, const_tree exp
, const char *file
,
9321 int line
, const char *function
)
9323 enum tree_code code
= TREE_CODE (exp
);
9325 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
9326 idx
+ 1, get_tree_code_name (code
), TREE_OPERAND_LENGTH (exp
),
9327 function
, trim_filename (file
), line
);
9330 /* Similar to above, except that the check is for the number of
9331 operands of an OMP_CLAUSE node. */
9334 omp_clause_operand_check_failed (int idx
, const_tree t
, const char *file
,
9335 int line
, const char *function
)
9338 ("tree check: accessed operand %d of omp_clause %s with %d operands "
9339 "in %s, at %s:%d", idx
+ 1, omp_clause_code_name
[OMP_CLAUSE_CODE (t
)],
9340 omp_clause_num_ops
[OMP_CLAUSE_CODE (t
)], function
,
9341 trim_filename (file
), line
);
9343 #endif /* ENABLE_TREE_CHECKING */
9345 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
9346 and mapped to the machine mode MODE. Initialize its fields and build
9347 the information necessary for debugging output. */
9350 make_vector_type (tree innertype
, int nunits
, enum machine_mode mode
)
9353 hashval_t hashcode
= 0;
9355 t
= make_node (VECTOR_TYPE
);
9356 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (innertype
);
9357 SET_TYPE_VECTOR_SUBPARTS (t
, nunits
);
9358 SET_TYPE_MODE (t
, mode
);
9360 if (TYPE_STRUCTURAL_EQUALITY_P (innertype
))
9361 SET_TYPE_STRUCTURAL_EQUALITY (t
);
9362 else if (TYPE_CANONICAL (innertype
) != innertype
9363 || mode
!= VOIDmode
)
9365 = make_vector_type (TYPE_CANONICAL (innertype
), nunits
, VOIDmode
);
9369 hashcode
= iterative_hash_host_wide_int (VECTOR_TYPE
, hashcode
);
9370 hashcode
= iterative_hash_host_wide_int (nunits
, hashcode
);
9371 hashcode
= iterative_hash_host_wide_int (mode
, hashcode
);
9372 hashcode
= iterative_hash_object (TYPE_HASH (TREE_TYPE (t
)), hashcode
);
9373 t
= type_hash_canon (hashcode
, t
);
9375 /* We have built a main variant, based on the main variant of the
9376 inner type. Use it to build the variant we return. */
9377 if ((TYPE_ATTRIBUTES (innertype
) || TYPE_QUALS (innertype
))
9378 && TREE_TYPE (t
) != innertype
)
9379 return build_type_attribute_qual_variant (t
,
9380 TYPE_ATTRIBUTES (innertype
),
9381 TYPE_QUALS (innertype
));
9387 make_or_reuse_type (unsigned size
, int unsignedp
)
9389 if (size
== INT_TYPE_SIZE
)
9390 return unsignedp
? unsigned_type_node
: integer_type_node
;
9391 if (size
== CHAR_TYPE_SIZE
)
9392 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
9393 if (size
== SHORT_TYPE_SIZE
)
9394 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
9395 if (size
== LONG_TYPE_SIZE
)
9396 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
9397 if (size
== LONG_LONG_TYPE_SIZE
)
9398 return (unsignedp
? long_long_unsigned_type_node
9399 : long_long_integer_type_node
);
9400 if (size
== 128 && int128_integer_type_node
)
9401 return (unsignedp
? int128_unsigned_type_node
9402 : int128_integer_type_node
);
9405 return make_unsigned_type (size
);
9407 return make_signed_type (size
);
9410 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
9413 make_or_reuse_fract_type (unsigned size
, int unsignedp
, int satp
)
9417 if (size
== SHORT_FRACT_TYPE_SIZE
)
9418 return unsignedp
? sat_unsigned_short_fract_type_node
9419 : sat_short_fract_type_node
;
9420 if (size
== FRACT_TYPE_SIZE
)
9421 return unsignedp
? sat_unsigned_fract_type_node
: sat_fract_type_node
;
9422 if (size
== LONG_FRACT_TYPE_SIZE
)
9423 return unsignedp
? sat_unsigned_long_fract_type_node
9424 : sat_long_fract_type_node
;
9425 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
9426 return unsignedp
? sat_unsigned_long_long_fract_type_node
9427 : sat_long_long_fract_type_node
;
9431 if (size
== SHORT_FRACT_TYPE_SIZE
)
9432 return unsignedp
? unsigned_short_fract_type_node
9433 : short_fract_type_node
;
9434 if (size
== FRACT_TYPE_SIZE
)
9435 return unsignedp
? unsigned_fract_type_node
: fract_type_node
;
9436 if (size
== LONG_FRACT_TYPE_SIZE
)
9437 return unsignedp
? unsigned_long_fract_type_node
9438 : long_fract_type_node
;
9439 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
9440 return unsignedp
? unsigned_long_long_fract_type_node
9441 : long_long_fract_type_node
;
9444 return make_fract_type (size
, unsignedp
, satp
);
9447 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
9450 make_or_reuse_accum_type (unsigned size
, int unsignedp
, int satp
)
9454 if (size
== SHORT_ACCUM_TYPE_SIZE
)
9455 return unsignedp
? sat_unsigned_short_accum_type_node
9456 : sat_short_accum_type_node
;
9457 if (size
== ACCUM_TYPE_SIZE
)
9458 return unsignedp
? sat_unsigned_accum_type_node
: sat_accum_type_node
;
9459 if (size
== LONG_ACCUM_TYPE_SIZE
)
9460 return unsignedp
? sat_unsigned_long_accum_type_node
9461 : sat_long_accum_type_node
;
9462 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
9463 return unsignedp
? sat_unsigned_long_long_accum_type_node
9464 : sat_long_long_accum_type_node
;
9468 if (size
== SHORT_ACCUM_TYPE_SIZE
)
9469 return unsignedp
? unsigned_short_accum_type_node
9470 : short_accum_type_node
;
9471 if (size
== ACCUM_TYPE_SIZE
)
9472 return unsignedp
? unsigned_accum_type_node
: accum_type_node
;
9473 if (size
== LONG_ACCUM_TYPE_SIZE
)
9474 return unsignedp
? unsigned_long_accum_type_node
9475 : long_accum_type_node
;
9476 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
9477 return unsignedp
? unsigned_long_long_accum_type_node
9478 : long_long_accum_type_node
;
9481 return make_accum_type (size
, unsignedp
, satp
);
9485 /* Create an atomic variant node for TYPE. This routine is called
9486 during initialization of data types to create the 5 basic atomic
9487 types. The generic build_variant_type function requires these to
9488 already be set up in order to function properly, so cannot be
9489 called from there. If ALIGN is non-zero, then ensure alignment is
9490 overridden to this value. */
9493 build_atomic_base (tree type
, unsigned int align
)
9497 /* Make sure its not already registered. */
9498 if ((t
= get_qualified_type (type
, TYPE_QUAL_ATOMIC
)))
9501 t
= build_variant_type_copy (type
);
9502 set_type_quals (t
, TYPE_QUAL_ATOMIC
);
9505 TYPE_ALIGN (t
) = align
;
9510 /* Create nodes for all integer types (and error_mark_node) using the sizes
9511 of C datatypes. SIGNED_CHAR specifies whether char is signed,
9512 SHORT_DOUBLE specifies whether double should be of the same precision
9516 build_common_tree_nodes (bool signed_char
, bool short_double
)
9518 error_mark_node
= make_node (ERROR_MARK
);
9519 TREE_TYPE (error_mark_node
) = error_mark_node
;
9521 initialize_sizetypes ();
9523 /* Define both `signed char' and `unsigned char'. */
9524 signed_char_type_node
= make_signed_type (CHAR_TYPE_SIZE
);
9525 TYPE_STRING_FLAG (signed_char_type_node
) = 1;
9526 unsigned_char_type_node
= make_unsigned_type (CHAR_TYPE_SIZE
);
9527 TYPE_STRING_FLAG (unsigned_char_type_node
) = 1;
9529 /* Define `char', which is like either `signed char' or `unsigned char'
9530 but not the same as either. */
9533 ? make_signed_type (CHAR_TYPE_SIZE
)
9534 : make_unsigned_type (CHAR_TYPE_SIZE
));
9535 TYPE_STRING_FLAG (char_type_node
) = 1;
9537 short_integer_type_node
= make_signed_type (SHORT_TYPE_SIZE
);
9538 short_unsigned_type_node
= make_unsigned_type (SHORT_TYPE_SIZE
);
9539 integer_type_node
= make_signed_type (INT_TYPE_SIZE
);
9540 unsigned_type_node
= make_unsigned_type (INT_TYPE_SIZE
);
9541 long_integer_type_node
= make_signed_type (LONG_TYPE_SIZE
);
9542 long_unsigned_type_node
= make_unsigned_type (LONG_TYPE_SIZE
);
9543 long_long_integer_type_node
= make_signed_type (LONG_LONG_TYPE_SIZE
);
9544 long_long_unsigned_type_node
= make_unsigned_type (LONG_LONG_TYPE_SIZE
);
9545 #if HOST_BITS_PER_WIDE_INT >= 64
9546 /* TODO: This isn't correct, but as logic depends at the moment on
9547 host's instead of target's wide-integer.
9548 If there is a target not supporting TImode, but has an 128-bit
9549 integer-scalar register, this target check needs to be adjusted. */
9550 if (targetm
.scalar_mode_supported_p (TImode
))
9552 int128_integer_type_node
= make_signed_type (128);
9553 int128_unsigned_type_node
= make_unsigned_type (128);
9557 /* Define a boolean type. This type only represents boolean values but
9558 may be larger than char depending on the value of BOOL_TYPE_SIZE. */
9559 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
9560 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
9561 TYPE_PRECISION (boolean_type_node
) = 1;
9562 TYPE_MAX_VALUE (boolean_type_node
) = build_int_cst (boolean_type_node
, 1);
9564 /* Define what type to use for size_t. */
9565 if (strcmp (SIZE_TYPE
, "unsigned int") == 0)
9566 size_type_node
= unsigned_type_node
;
9567 else if (strcmp (SIZE_TYPE
, "long unsigned int") == 0)
9568 size_type_node
= long_unsigned_type_node
;
9569 else if (strcmp (SIZE_TYPE
, "long long unsigned int") == 0)
9570 size_type_node
= long_long_unsigned_type_node
;
9571 else if (strcmp (SIZE_TYPE
, "short unsigned int") == 0)
9572 size_type_node
= short_unsigned_type_node
;
9576 /* Fill in the rest of the sized types. Reuse existing type nodes
9578 intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 0);
9579 intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 0);
9580 intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 0);
9581 intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 0);
9582 intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 0);
9584 unsigned_intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 1);
9585 unsigned_intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 1);
9586 unsigned_intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 1);
9587 unsigned_intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 1);
9588 unsigned_intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 1);
9590 /* Don't call build_qualified type for atomics. That routine does
9591 special processing for atomics, and until they are initialized
9592 it's better not to make that call.
9594 Check to see if there is a target override for atomic types. */
9596 atomicQI_type_node
= build_atomic_base (unsigned_intQI_type_node
,
9597 targetm
.atomic_align_for_mode (QImode
));
9598 atomicHI_type_node
= build_atomic_base (unsigned_intHI_type_node
,
9599 targetm
.atomic_align_for_mode (HImode
));
9600 atomicSI_type_node
= build_atomic_base (unsigned_intSI_type_node
,
9601 targetm
.atomic_align_for_mode (SImode
));
9602 atomicDI_type_node
= build_atomic_base (unsigned_intDI_type_node
,
9603 targetm
.atomic_align_for_mode (DImode
));
9604 atomicTI_type_node
= build_atomic_base (unsigned_intTI_type_node
,
9605 targetm
.atomic_align_for_mode (TImode
));
9607 access_public_node
= get_identifier ("public");
9608 access_protected_node
= get_identifier ("protected");
9609 access_private_node
= get_identifier ("private");
9611 /* Define these next since types below may used them. */
9612 integer_zero_node
= build_int_cst (integer_type_node
, 0);
9613 integer_one_node
= build_int_cst (integer_type_node
, 1);
9614 integer_three_node
= build_int_cst (integer_type_node
, 3);
9615 integer_minus_one_node
= build_int_cst (integer_type_node
, -1);
9617 size_zero_node
= size_int (0);
9618 size_one_node
= size_int (1);
9619 bitsize_zero_node
= bitsize_int (0);
9620 bitsize_one_node
= bitsize_int (1);
9621 bitsize_unit_node
= bitsize_int (BITS_PER_UNIT
);
9623 boolean_false_node
= TYPE_MIN_VALUE (boolean_type_node
);
9624 boolean_true_node
= TYPE_MAX_VALUE (boolean_type_node
);
9626 void_type_node
= make_node (VOID_TYPE
);
9627 layout_type (void_type_node
);
9629 /* We are not going to have real types in C with less than byte alignment,
9630 so we might as well not have any types that claim to have it. */
9631 TYPE_ALIGN (void_type_node
) = BITS_PER_UNIT
;
9632 TYPE_USER_ALIGN (void_type_node
) = 0;
9634 null_pointer_node
= build_int_cst (build_pointer_type (void_type_node
), 0);
9635 layout_type (TREE_TYPE (null_pointer_node
));
9637 ptr_type_node
= build_pointer_type (void_type_node
);
9639 = build_pointer_type (build_type_variant (void_type_node
, 1, 0));
9640 fileptr_type_node
= ptr_type_node
;
9642 pointer_sized_int_node
= build_nonstandard_integer_type (POINTER_SIZE
, 1);
9644 float_type_node
= make_node (REAL_TYPE
);
9645 TYPE_PRECISION (float_type_node
) = FLOAT_TYPE_SIZE
;
9646 layout_type (float_type_node
);
9648 double_type_node
= make_node (REAL_TYPE
);
9650 TYPE_PRECISION (double_type_node
) = FLOAT_TYPE_SIZE
;
9652 TYPE_PRECISION (double_type_node
) = DOUBLE_TYPE_SIZE
;
9653 layout_type (double_type_node
);
9655 long_double_type_node
= make_node (REAL_TYPE
);
9656 TYPE_PRECISION (long_double_type_node
) = LONG_DOUBLE_TYPE_SIZE
;
9657 layout_type (long_double_type_node
);
9659 float_ptr_type_node
= build_pointer_type (float_type_node
);
9660 double_ptr_type_node
= build_pointer_type (double_type_node
);
9661 long_double_ptr_type_node
= build_pointer_type (long_double_type_node
);
9662 integer_ptr_type_node
= build_pointer_type (integer_type_node
);
9664 /* Fixed size integer types. */
9665 uint16_type_node
= build_nonstandard_integer_type (16, true);
9666 uint32_type_node
= build_nonstandard_integer_type (32, true);
9667 uint64_type_node
= build_nonstandard_integer_type (64, true);
9669 /* Decimal float types. */
9670 dfloat32_type_node
= make_node (REAL_TYPE
);
9671 TYPE_PRECISION (dfloat32_type_node
) = DECIMAL32_TYPE_SIZE
;
9672 layout_type (dfloat32_type_node
);
9673 SET_TYPE_MODE (dfloat32_type_node
, SDmode
);
9674 dfloat32_ptr_type_node
= build_pointer_type (dfloat32_type_node
);
9676 dfloat64_type_node
= make_node (REAL_TYPE
);
9677 TYPE_PRECISION (dfloat64_type_node
) = DECIMAL64_TYPE_SIZE
;
9678 layout_type (dfloat64_type_node
);
9679 SET_TYPE_MODE (dfloat64_type_node
, DDmode
);
9680 dfloat64_ptr_type_node
= build_pointer_type (dfloat64_type_node
);
9682 dfloat128_type_node
= make_node (REAL_TYPE
);
9683 TYPE_PRECISION (dfloat128_type_node
) = DECIMAL128_TYPE_SIZE
;
9684 layout_type (dfloat128_type_node
);
9685 SET_TYPE_MODE (dfloat128_type_node
, TDmode
);
9686 dfloat128_ptr_type_node
= build_pointer_type (dfloat128_type_node
);
9688 complex_integer_type_node
= build_complex_type (integer_type_node
);
9689 complex_float_type_node
= build_complex_type (float_type_node
);
9690 complex_double_type_node
= build_complex_type (double_type_node
);
9691 complex_long_double_type_node
= build_complex_type (long_double_type_node
);
9693 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
9694 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
9695 sat_ ## KIND ## _type_node = \
9696 make_sat_signed_ ## KIND ## _type (SIZE); \
9697 sat_unsigned_ ## KIND ## _type_node = \
9698 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9699 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9700 unsigned_ ## KIND ## _type_node = \
9701 make_unsigned_ ## KIND ## _type (SIZE);
9703 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
9704 sat_ ## WIDTH ## KIND ## _type_node = \
9705 make_sat_signed_ ## KIND ## _type (SIZE); \
9706 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
9707 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9708 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9709 unsigned_ ## WIDTH ## KIND ## _type_node = \
9710 make_unsigned_ ## KIND ## _type (SIZE);
9712 /* Make fixed-point type nodes based on four different widths. */
9713 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
9714 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
9715 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
9716 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
9717 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
9719 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
9720 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
9721 NAME ## _type_node = \
9722 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
9723 u ## NAME ## _type_node = \
9724 make_or_reuse_unsigned_ ## KIND ## _type \
9725 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
9726 sat_ ## NAME ## _type_node = \
9727 make_or_reuse_sat_signed_ ## KIND ## _type \
9728 (GET_MODE_BITSIZE (MODE ## mode)); \
9729 sat_u ## NAME ## _type_node = \
9730 make_or_reuse_sat_unsigned_ ## KIND ## _type \
9731 (GET_MODE_BITSIZE (U ## MODE ## mode));
9733 /* Fixed-point type and mode nodes. */
9734 MAKE_FIXED_TYPE_NODE_FAMILY (fract
, FRACT
)
9735 MAKE_FIXED_TYPE_NODE_FAMILY (accum
, ACCUM
)
9736 MAKE_FIXED_MODE_NODE (fract
, qq
, QQ
)
9737 MAKE_FIXED_MODE_NODE (fract
, hq
, HQ
)
9738 MAKE_FIXED_MODE_NODE (fract
, sq
, SQ
)
9739 MAKE_FIXED_MODE_NODE (fract
, dq
, DQ
)
9740 MAKE_FIXED_MODE_NODE (fract
, tq
, TQ
)
9741 MAKE_FIXED_MODE_NODE (accum
, ha
, HA
)
9742 MAKE_FIXED_MODE_NODE (accum
, sa
, SA
)
9743 MAKE_FIXED_MODE_NODE (accum
, da
, DA
)
9744 MAKE_FIXED_MODE_NODE (accum
, ta
, TA
)
9747 tree t
= targetm
.build_builtin_va_list ();
9749 /* Many back-ends define record types without setting TYPE_NAME.
9750 If we copied the record type here, we'd keep the original
9751 record type without a name. This breaks name mangling. So,
9752 don't copy record types and let c_common_nodes_and_builtins()
9753 declare the type to be __builtin_va_list. */
9754 if (TREE_CODE (t
) != RECORD_TYPE
)
9755 t
= build_variant_type_copy (t
);
9757 va_list_type_node
= t
;
9761 /* Modify DECL for given flags.
9762 TM_PURE attribute is set only on types, so the function will modify
9763 DECL's type when ECF_TM_PURE is used. */
9766 set_call_expr_flags (tree decl
, int flags
)
9768 if (flags
& ECF_NOTHROW
)
9769 TREE_NOTHROW (decl
) = 1;
9770 if (flags
& ECF_CONST
)
9771 TREE_READONLY (decl
) = 1;
9772 if (flags
& ECF_PURE
)
9773 DECL_PURE_P (decl
) = 1;
9774 if (flags
& ECF_LOOPING_CONST_OR_PURE
)
9775 DECL_LOOPING_CONST_OR_PURE_P (decl
) = 1;
9776 if (flags
& ECF_NOVOPS
)
9777 DECL_IS_NOVOPS (decl
) = 1;
9778 if (flags
& ECF_NORETURN
)
9779 TREE_THIS_VOLATILE (decl
) = 1;
9780 if (flags
& ECF_MALLOC
)
9781 DECL_IS_MALLOC (decl
) = 1;
9782 if (flags
& ECF_RETURNS_TWICE
)
9783 DECL_IS_RETURNS_TWICE (decl
) = 1;
9784 if (flags
& ECF_LEAF
)
9785 DECL_ATTRIBUTES (decl
) = tree_cons (get_identifier ("leaf"),
9786 NULL
, DECL_ATTRIBUTES (decl
));
9787 if ((flags
& ECF_TM_PURE
) && flag_tm
)
9788 apply_tm_attr (decl
, get_identifier ("transaction_pure"));
9789 /* Looping const or pure is implied by noreturn.
9790 There is currently no way to declare looping const or looping pure alone. */
9791 gcc_assert (!(flags
& ECF_LOOPING_CONST_OR_PURE
)
9792 || ((flags
& ECF_NORETURN
) && (flags
& (ECF_CONST
| ECF_PURE
))));
9796 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
9799 local_define_builtin (const char *name
, tree type
, enum built_in_function code
,
9800 const char *library_name
, int ecf_flags
)
9804 decl
= add_builtin_function (name
, type
, code
, BUILT_IN_NORMAL
,
9805 library_name
, NULL_TREE
);
9806 set_call_expr_flags (decl
, ecf_flags
);
9808 set_builtin_decl (code
, decl
, true);
9811 /* Call this function after instantiating all builtins that the language
9812 front end cares about. This will build the rest of the builtins that
9813 are relied upon by the tree optimizers and the middle-end. */
9816 build_common_builtin_nodes (void)
9821 if (!builtin_decl_explicit_p (BUILT_IN_UNREACHABLE
))
9823 ftype
= build_function_type (void_type_node
, void_list_node
);
9824 local_define_builtin ("__builtin_unreachable", ftype
, BUILT_IN_UNREACHABLE
,
9825 "__builtin_unreachable",
9826 ECF_NOTHROW
| ECF_LEAF
| ECF_NORETURN
9827 | ECF_CONST
| ECF_LEAF
);
9830 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
)
9831 || !builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
9833 ftype
= build_function_type_list (ptr_type_node
,
9834 ptr_type_node
, const_ptr_type_node
,
9835 size_type_node
, NULL_TREE
);
9837 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
))
9838 local_define_builtin ("__builtin_memcpy", ftype
, BUILT_IN_MEMCPY
,
9839 "memcpy", ECF_NOTHROW
| ECF_LEAF
);
9840 if (!builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
9841 local_define_builtin ("__builtin_memmove", ftype
, BUILT_IN_MEMMOVE
,
9842 "memmove", ECF_NOTHROW
| ECF_LEAF
);
9845 if (!builtin_decl_explicit_p (BUILT_IN_MEMCMP
))
9847 ftype
= build_function_type_list (integer_type_node
, const_ptr_type_node
,
9848 const_ptr_type_node
, size_type_node
,
9850 local_define_builtin ("__builtin_memcmp", ftype
, BUILT_IN_MEMCMP
,
9851 "memcmp", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
9854 if (!builtin_decl_explicit_p (BUILT_IN_MEMSET
))
9856 ftype
= build_function_type_list (ptr_type_node
,
9857 ptr_type_node
, integer_type_node
,
9858 size_type_node
, NULL_TREE
);
9859 local_define_builtin ("__builtin_memset", ftype
, BUILT_IN_MEMSET
,
9860 "memset", ECF_NOTHROW
| ECF_LEAF
);
9863 if (!builtin_decl_explicit_p (BUILT_IN_ALLOCA
))
9865 ftype
= build_function_type_list (ptr_type_node
,
9866 size_type_node
, NULL_TREE
);
9867 local_define_builtin ("__builtin_alloca", ftype
, BUILT_IN_ALLOCA
,
9868 "alloca", ECF_MALLOC
| ECF_NOTHROW
| ECF_LEAF
);
9871 ftype
= build_function_type_list (ptr_type_node
, size_type_node
,
9872 size_type_node
, NULL_TREE
);
9873 local_define_builtin ("__builtin_alloca_with_align", ftype
,
9874 BUILT_IN_ALLOCA_WITH_ALIGN
, "alloca",
9875 ECF_MALLOC
| ECF_NOTHROW
| ECF_LEAF
);
9877 /* If we're checking the stack, `alloca' can throw. */
9878 if (flag_stack_check
)
9880 TREE_NOTHROW (builtin_decl_explicit (BUILT_IN_ALLOCA
)) = 0;
9881 TREE_NOTHROW (builtin_decl_explicit (BUILT_IN_ALLOCA_WITH_ALIGN
)) = 0;
9884 ftype
= build_function_type_list (void_type_node
,
9885 ptr_type_node
, ptr_type_node
,
9886 ptr_type_node
, NULL_TREE
);
9887 local_define_builtin ("__builtin_init_trampoline", ftype
,
9888 BUILT_IN_INIT_TRAMPOLINE
,
9889 "__builtin_init_trampoline", ECF_NOTHROW
| ECF_LEAF
);
9890 local_define_builtin ("__builtin_init_heap_trampoline", ftype
,
9891 BUILT_IN_INIT_HEAP_TRAMPOLINE
,
9892 "__builtin_init_heap_trampoline",
9893 ECF_NOTHROW
| ECF_LEAF
);
9895 ftype
= build_function_type_list (ptr_type_node
, ptr_type_node
, NULL_TREE
);
9896 local_define_builtin ("__builtin_adjust_trampoline", ftype
,
9897 BUILT_IN_ADJUST_TRAMPOLINE
,
9898 "__builtin_adjust_trampoline",
9899 ECF_CONST
| ECF_NOTHROW
);
9901 ftype
= build_function_type_list (void_type_node
,
9902 ptr_type_node
, ptr_type_node
, NULL_TREE
);
9903 local_define_builtin ("__builtin_nonlocal_goto", ftype
,
9904 BUILT_IN_NONLOCAL_GOTO
,
9905 "__builtin_nonlocal_goto",
9906 ECF_NORETURN
| ECF_NOTHROW
);
9908 ftype
= build_function_type_list (void_type_node
,
9909 ptr_type_node
, ptr_type_node
, NULL_TREE
);
9910 local_define_builtin ("__builtin_setjmp_setup", ftype
,
9911 BUILT_IN_SETJMP_SETUP
,
9912 "__builtin_setjmp_setup", ECF_NOTHROW
);
9914 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
9915 local_define_builtin ("__builtin_setjmp_receiver", ftype
,
9916 BUILT_IN_SETJMP_RECEIVER
,
9917 "__builtin_setjmp_receiver", ECF_NOTHROW
| ECF_LEAF
);
9919 ftype
= build_function_type_list (ptr_type_node
, NULL_TREE
);
9920 local_define_builtin ("__builtin_stack_save", ftype
, BUILT_IN_STACK_SAVE
,
9921 "__builtin_stack_save", ECF_NOTHROW
| ECF_LEAF
);
9923 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
9924 local_define_builtin ("__builtin_stack_restore", ftype
,
9925 BUILT_IN_STACK_RESTORE
,
9926 "__builtin_stack_restore", ECF_NOTHROW
| ECF_LEAF
);
9928 /* If there's a possibility that we might use the ARM EABI, build the
9929 alternate __cxa_end_cleanup node used to resume from C++ and Java. */
9930 if (targetm
.arm_eabi_unwinder
)
9932 ftype
= build_function_type_list (void_type_node
, NULL_TREE
);
9933 local_define_builtin ("__builtin_cxa_end_cleanup", ftype
,
9934 BUILT_IN_CXA_END_CLEANUP
,
9935 "__cxa_end_cleanup", ECF_NORETURN
| ECF_LEAF
);
9938 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
9939 local_define_builtin ("__builtin_unwind_resume", ftype
,
9940 BUILT_IN_UNWIND_RESUME
,
9941 ((targetm_common
.except_unwind_info (&global_options
)
9943 ? "_Unwind_SjLj_Resume" : "_Unwind_Resume"),
9946 if (builtin_decl_explicit (BUILT_IN_RETURN_ADDRESS
) == NULL_TREE
)
9948 ftype
= build_function_type_list (ptr_type_node
, integer_type_node
,
9950 local_define_builtin ("__builtin_return_address", ftype
,
9951 BUILT_IN_RETURN_ADDRESS
,
9952 "__builtin_return_address",
9956 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
)
9957 || !builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
9959 ftype
= build_function_type_list (void_type_node
, ptr_type_node
,
9960 ptr_type_node
, NULL_TREE
);
9961 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
))
9962 local_define_builtin ("__cyg_profile_func_enter", ftype
,
9963 BUILT_IN_PROFILE_FUNC_ENTER
,
9964 "__cyg_profile_func_enter", 0);
9965 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
9966 local_define_builtin ("__cyg_profile_func_exit", ftype
,
9967 BUILT_IN_PROFILE_FUNC_EXIT
,
9968 "__cyg_profile_func_exit", 0);
9971 /* The exception object and filter values from the runtime. The argument
9972 must be zero before exception lowering, i.e. from the front end. After
9973 exception lowering, it will be the region number for the exception
9974 landing pad. These functions are PURE instead of CONST to prevent
9975 them from being hoisted past the exception edge that will initialize
9976 its value in the landing pad. */
9977 ftype
= build_function_type_list (ptr_type_node
,
9978 integer_type_node
, NULL_TREE
);
9979 ecf_flags
= ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
;
9980 /* Only use TM_PURE if we we have TM language support. */
9981 if (builtin_decl_explicit_p (BUILT_IN_TM_LOAD_1
))
9982 ecf_flags
|= ECF_TM_PURE
;
9983 local_define_builtin ("__builtin_eh_pointer", ftype
, BUILT_IN_EH_POINTER
,
9984 "__builtin_eh_pointer", ecf_flags
);
9986 tmp
= lang_hooks
.types
.type_for_mode (targetm
.eh_return_filter_mode (), 0);
9987 ftype
= build_function_type_list (tmp
, integer_type_node
, NULL_TREE
);
9988 local_define_builtin ("__builtin_eh_filter", ftype
, BUILT_IN_EH_FILTER
,
9989 "__builtin_eh_filter", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
9991 ftype
= build_function_type_list (void_type_node
,
9992 integer_type_node
, integer_type_node
,
9994 local_define_builtin ("__builtin_eh_copy_values", ftype
,
9995 BUILT_IN_EH_COPY_VALUES
,
9996 "__builtin_eh_copy_values", ECF_NOTHROW
);
9998 /* Complex multiplication and division. These are handled as builtins
9999 rather than optabs because emit_library_call_value doesn't support
10000 complex. Further, we can do slightly better with folding these
10001 beasties if the real and complex parts of the arguments are separate. */
10005 for (mode
= MIN_MODE_COMPLEX_FLOAT
; mode
<= MAX_MODE_COMPLEX_FLOAT
; ++mode
)
10007 char mode_name_buf
[4], *q
;
10009 enum built_in_function mcode
, dcode
;
10010 tree type
, inner_type
;
10011 const char *prefix
= "__";
10013 if (targetm
.libfunc_gnu_prefix
)
10016 type
= lang_hooks
.types
.type_for_mode ((enum machine_mode
) mode
, 0);
10019 inner_type
= TREE_TYPE (type
);
10021 ftype
= build_function_type_list (type
, inner_type
, inner_type
,
10022 inner_type
, inner_type
, NULL_TREE
);
10024 mcode
= ((enum built_in_function
)
10025 (BUILT_IN_COMPLEX_MUL_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
10026 dcode
= ((enum built_in_function
)
10027 (BUILT_IN_COMPLEX_DIV_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
10029 for (p
= GET_MODE_NAME (mode
), q
= mode_name_buf
; *p
; p
++, q
++)
10033 built_in_names
[mcode
] = concat (prefix
, "mul", mode_name_buf
, "3",
10035 local_define_builtin (built_in_names
[mcode
], ftype
, mcode
,
10036 built_in_names
[mcode
],
10037 ECF_CONST
| ECF_NOTHROW
| ECF_LEAF
);
10039 built_in_names
[dcode
] = concat (prefix
, "div", mode_name_buf
, "3",
10041 local_define_builtin (built_in_names
[dcode
], ftype
, dcode
,
10042 built_in_names
[dcode
],
10043 ECF_CONST
| ECF_NOTHROW
| ECF_LEAF
);
10048 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
10051 If we requested a pointer to a vector, build up the pointers that
10052 we stripped off while looking for the inner type. Similarly for
10053 return values from functions.
10055 The argument TYPE is the top of the chain, and BOTTOM is the
10056 new type which we will point to. */
10059 reconstruct_complex_type (tree type
, tree bottom
)
10063 if (TREE_CODE (type
) == POINTER_TYPE
)
10065 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10066 outer
= build_pointer_type_for_mode (inner
, TYPE_MODE (type
),
10067 TYPE_REF_CAN_ALIAS_ALL (type
));
10069 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
10071 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10072 outer
= build_reference_type_for_mode (inner
, TYPE_MODE (type
),
10073 TYPE_REF_CAN_ALIAS_ALL (type
));
10075 else if (TREE_CODE (type
) == ARRAY_TYPE
)
10077 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10078 outer
= build_array_type (inner
, TYPE_DOMAIN (type
));
10080 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10082 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10083 outer
= build_function_type (inner
, TYPE_ARG_TYPES (type
));
10085 else if (TREE_CODE (type
) == METHOD_TYPE
)
10087 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10088 /* The build_method_type_directly() routine prepends 'this' to argument list,
10089 so we must compensate by getting rid of it. */
10091 = build_method_type_directly
10092 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
))),
10094 TREE_CHAIN (TYPE_ARG_TYPES (type
)));
10096 else if (TREE_CODE (type
) == OFFSET_TYPE
)
10098 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10099 outer
= build_offset_type (TYPE_OFFSET_BASETYPE (type
), inner
);
10104 return build_type_attribute_qual_variant (outer
, TYPE_ATTRIBUTES (type
),
10105 TYPE_QUALS (type
));
10108 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
10111 build_vector_type_for_mode (tree innertype
, enum machine_mode mode
)
10115 switch (GET_MODE_CLASS (mode
))
10117 case MODE_VECTOR_INT
:
10118 case MODE_VECTOR_FLOAT
:
10119 case MODE_VECTOR_FRACT
:
10120 case MODE_VECTOR_UFRACT
:
10121 case MODE_VECTOR_ACCUM
:
10122 case MODE_VECTOR_UACCUM
:
10123 nunits
= GET_MODE_NUNITS (mode
);
10127 /* Check that there are no leftover bits. */
10128 gcc_assert (GET_MODE_BITSIZE (mode
)
10129 % TREE_INT_CST_LOW (TYPE_SIZE (innertype
)) == 0);
10131 nunits
= GET_MODE_BITSIZE (mode
)
10132 / TREE_INT_CST_LOW (TYPE_SIZE (innertype
));
10136 gcc_unreachable ();
10139 return make_vector_type (innertype
, nunits
, mode
);
10142 /* Similarly, but takes the inner type and number of units, which must be
10146 build_vector_type (tree innertype
, int nunits
)
10148 return make_vector_type (innertype
, nunits
, VOIDmode
);
10151 /* Similarly, but builds a variant type with TYPE_VECTOR_OPAQUE set. */
10154 build_opaque_vector_type (tree innertype
, int nunits
)
10156 tree t
= make_vector_type (innertype
, nunits
, VOIDmode
);
10158 /* We always build the non-opaque variant before the opaque one,
10159 so if it already exists, it is TYPE_NEXT_VARIANT of this one. */
10160 cand
= TYPE_NEXT_VARIANT (t
);
10162 && TYPE_VECTOR_OPAQUE (cand
)
10163 && check_qualified_type (cand
, t
, TYPE_QUALS (t
)))
10165 /* Othewise build a variant type and make sure to queue it after
10166 the non-opaque type. */
10167 cand
= build_distinct_type_copy (t
);
10168 TYPE_VECTOR_OPAQUE (cand
) = true;
10169 TYPE_CANONICAL (cand
) = TYPE_CANONICAL (t
);
10170 TYPE_NEXT_VARIANT (cand
) = TYPE_NEXT_VARIANT (t
);
10171 TYPE_NEXT_VARIANT (t
) = cand
;
10172 TYPE_MAIN_VARIANT (cand
) = TYPE_MAIN_VARIANT (t
);
10177 /* Given an initializer INIT, return TRUE if INIT is zero or some
10178 aggregate of zeros. Otherwise return FALSE. */
10180 initializer_zerop (const_tree init
)
10186 switch (TREE_CODE (init
))
10189 return integer_zerop (init
);
10192 /* ??? Note that this is not correct for C4X float formats. There,
10193 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
10194 negative exponent. */
10195 return real_zerop (init
)
10196 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init
));
10199 return fixed_zerop (init
);
10202 return integer_zerop (init
)
10203 || (real_zerop (init
)
10204 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init
)))
10205 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init
))));
10210 for (i
= 0; i
< VECTOR_CST_NELTS (init
); ++i
)
10211 if (!initializer_zerop (VECTOR_CST_ELT (init
, i
)))
10218 unsigned HOST_WIDE_INT idx
;
10220 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init
), idx
, elt
)
10221 if (!initializer_zerop (elt
))
10230 /* We need to loop through all elements to handle cases like
10231 "\0" and "\0foobar". */
10232 for (i
= 0; i
< TREE_STRING_LENGTH (init
); ++i
)
10233 if (TREE_STRING_POINTER (init
)[i
] != '\0')
10244 /* Check if vector VEC consists of all the equal elements and
10245 that the number of elements corresponds to the type of VEC.
10246 The function returns first element of the vector
10247 or NULL_TREE if the vector is not uniform. */
10249 uniform_vector_p (const_tree vec
)
10254 if (vec
== NULL_TREE
)
10257 gcc_assert (VECTOR_TYPE_P (TREE_TYPE (vec
)));
10259 if (TREE_CODE (vec
) == VECTOR_CST
)
10261 first
= VECTOR_CST_ELT (vec
, 0);
10262 for (i
= 1; i
< VECTOR_CST_NELTS (vec
); ++i
)
10263 if (!operand_equal_p (first
, VECTOR_CST_ELT (vec
, i
), 0))
10269 else if (TREE_CODE (vec
) == CONSTRUCTOR
)
10271 first
= error_mark_node
;
10273 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (vec
), i
, t
)
10280 if (!operand_equal_p (first
, t
, 0))
10283 if (i
!= TYPE_VECTOR_SUBPARTS (TREE_TYPE (vec
)))
10292 /* Build an empty statement at location LOC. */
10295 build_empty_stmt (location_t loc
)
10297 tree t
= build1 (NOP_EXPR
, void_type_node
, size_zero_node
);
10298 SET_EXPR_LOCATION (t
, loc
);
10303 /* Build an OpenMP clause with code CODE. LOC is the location of the
10307 build_omp_clause (location_t loc
, enum omp_clause_code code
)
10312 length
= omp_clause_num_ops
[code
];
10313 size
= (sizeof (struct tree_omp_clause
) + (length
- 1) * sizeof (tree
));
10315 record_node_allocation_statistics (OMP_CLAUSE
, size
);
10317 t
= ggc_alloc_tree_node (size
);
10318 memset (t
, 0, size
);
10319 TREE_SET_CODE (t
, OMP_CLAUSE
);
10320 OMP_CLAUSE_SET_CODE (t
, code
);
10321 OMP_CLAUSE_LOCATION (t
) = loc
;
10326 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
10327 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
10328 Except for the CODE and operand count field, other storage for the
10329 object is initialized to zeros. */
10332 build_vl_exp_stat (enum tree_code code
, int len MEM_STAT_DECL
)
10335 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_exp
);
10337 gcc_assert (TREE_CODE_CLASS (code
) == tcc_vl_exp
);
10338 gcc_assert (len
>= 1);
10340 record_node_allocation_statistics (code
, length
);
10342 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
10344 TREE_SET_CODE (t
, code
);
10346 /* Can't use TREE_OPERAND to store the length because if checking is
10347 enabled, it will try to check the length before we store it. :-P */
10348 t
->exp
.operands
[0] = build_int_cst (sizetype
, len
);
10353 /* Helper function for build_call_* functions; build a CALL_EXPR with
10354 indicated RETURN_TYPE, FN, and NARGS, but do not initialize any of
10355 the argument slots. */
10358 build_call_1 (tree return_type
, tree fn
, int nargs
)
10362 t
= build_vl_exp (CALL_EXPR
, nargs
+ 3);
10363 TREE_TYPE (t
) = return_type
;
10364 CALL_EXPR_FN (t
) = fn
;
10365 CALL_EXPR_STATIC_CHAIN (t
) = NULL
;
10370 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10371 FN and a null static chain slot. NARGS is the number of call arguments
10372 which are specified as "..." arguments. */
10375 build_call_nary (tree return_type
, tree fn
, int nargs
, ...)
10379 va_start (args
, nargs
);
10380 ret
= build_call_valist (return_type
, fn
, nargs
, args
);
10385 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10386 FN and a null static chain slot. NARGS is the number of call arguments
10387 which are specified as a va_list ARGS. */
10390 build_call_valist (tree return_type
, tree fn
, int nargs
, va_list args
)
10395 t
= build_call_1 (return_type
, fn
, nargs
);
10396 for (i
= 0; i
< nargs
; i
++)
10397 CALL_EXPR_ARG (t
, i
) = va_arg (args
, tree
);
10398 process_call_operands (t
);
10402 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10403 FN and a null static chain slot. NARGS is the number of call arguments
10404 which are specified as a tree array ARGS. */
10407 build_call_array_loc (location_t loc
, tree return_type
, tree fn
,
10408 int nargs
, const tree
*args
)
10413 t
= build_call_1 (return_type
, fn
, nargs
);
10414 for (i
= 0; i
< nargs
; i
++)
10415 CALL_EXPR_ARG (t
, i
) = args
[i
];
10416 process_call_operands (t
);
10417 SET_EXPR_LOCATION (t
, loc
);
10421 /* Like build_call_array, but takes a vec. */
10424 build_call_vec (tree return_type
, tree fn
, vec
<tree
, va_gc
> *args
)
10429 ret
= build_call_1 (return_type
, fn
, vec_safe_length (args
));
10430 FOR_EACH_VEC_SAFE_ELT (args
, ix
, t
)
10431 CALL_EXPR_ARG (ret
, ix
) = t
;
10432 process_call_operands (ret
);
10436 /* Return true if T (assumed to be a DECL) must be assigned a memory
10440 needs_to_live_in_memory (const_tree t
)
10442 return (TREE_ADDRESSABLE (t
)
10443 || is_global_var (t
)
10444 || (TREE_CODE (t
) == RESULT_DECL
10445 && !DECL_BY_REFERENCE (t
)
10446 && aggregate_value_p (t
, current_function_decl
)));
10449 /* Return value of a constant X and sign-extend it. */
10452 int_cst_value (const_tree x
)
10454 unsigned bits
= TYPE_PRECISION (TREE_TYPE (x
));
10455 unsigned HOST_WIDE_INT val
= TREE_INT_CST_LOW (x
);
10457 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
10458 gcc_assert (cst_and_fits_in_hwi (x
));
10460 if (bits
< HOST_BITS_PER_WIDE_INT
)
10462 bool negative
= ((val
>> (bits
- 1)) & 1) != 0;
10464 val
|= (~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1;
10466 val
&= ~((~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1);
10472 /* Return value of a constant X and sign-extend it. */
10475 widest_int_cst_value (const_tree x
)
10477 unsigned bits
= TYPE_PRECISION (TREE_TYPE (x
));
10478 unsigned HOST_WIDEST_INT val
= TREE_INT_CST_LOW (x
);
10480 #if HOST_BITS_PER_WIDEST_INT > HOST_BITS_PER_WIDE_INT
10481 gcc_assert (HOST_BITS_PER_WIDEST_INT
>= HOST_BITS_PER_DOUBLE_INT
);
10482 gcc_assert (TREE_INT_CST_NUNITS (x
) == 2);
10484 if (TREE_INT_CST_NUNITS (x
) == 1)
10485 val
= HOST_WIDE_INT (val
);
10487 val
|= (((unsigned HOST_WIDEST_INT
) TREE_INT_CST_ELT (x
, 1))
10488 << HOST_BITS_PER_WIDE_INT
);
10490 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
10491 gcc_assert (TREE_INT_CST_NUNITS (x
) == 1);
10494 if (bits
< HOST_BITS_PER_WIDEST_INT
)
10496 bool negative
= ((val
>> (bits
- 1)) & 1) != 0;
10498 val
|= (~(unsigned HOST_WIDEST_INT
) 0) << (bits
- 1) << 1;
10500 val
&= ~((~(unsigned HOST_WIDEST_INT
) 0) << (bits
- 1) << 1);
10506 /* If TYPE is an integral or pointer type, return an integer type with
10507 the same precision which is unsigned iff UNSIGNEDP is true, or itself
10508 if TYPE is already an integer type of signedness UNSIGNEDP. */
10511 signed_or_unsigned_type_for (int unsignedp
, tree type
)
10513 if (TREE_CODE (type
) == INTEGER_TYPE
&& TYPE_UNSIGNED (type
) == unsignedp
)
10516 if (TREE_CODE (type
) == VECTOR_TYPE
)
10518 tree inner
= TREE_TYPE (type
);
10519 tree inner2
= signed_or_unsigned_type_for (unsignedp
, inner
);
10522 if (inner
== inner2
)
10524 return build_vector_type (inner2
, TYPE_VECTOR_SUBPARTS (type
));
10527 if (!INTEGRAL_TYPE_P (type
)
10528 && !POINTER_TYPE_P (type
)
10529 && TREE_CODE (type
) != OFFSET_TYPE
)
10532 return build_nonstandard_integer_type (TYPE_PRECISION (type
), unsignedp
);
10535 /* If TYPE is an integral or pointer type, return an integer type with
10536 the same precision which is unsigned, or itself if TYPE is already an
10537 unsigned integer type. */
10540 unsigned_type_for (tree type
)
10542 return signed_or_unsigned_type_for (1, type
);
10545 /* If TYPE is an integral or pointer type, return an integer type with
10546 the same precision which is signed, or itself if TYPE is already a
10547 signed integer type. */
10550 signed_type_for (tree type
)
10552 return signed_or_unsigned_type_for (0, type
);
10555 /* If TYPE is a vector type, return a signed integer vector type with the
10556 same width and number of subparts. Otherwise return boolean_type_node. */
10559 truth_type_for (tree type
)
10561 if (TREE_CODE (type
) == VECTOR_TYPE
)
10563 tree elem
= lang_hooks
.types
.type_for_size
10564 (GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (type
))), 0);
10565 return build_opaque_vector_type (elem
, TYPE_VECTOR_SUBPARTS (type
));
10568 return boolean_type_node
;
10571 /* Returns the largest value obtainable by casting something in INNER type to
10575 upper_bound_in_type (tree outer
, tree inner
)
10577 unsigned int det
= 0;
10578 unsigned oprec
= TYPE_PRECISION (outer
);
10579 unsigned iprec
= TYPE_PRECISION (inner
);
10582 /* Compute a unique number for every combination. */
10583 det
|= (oprec
> iprec
) ? 4 : 0;
10584 det
|= TYPE_UNSIGNED (outer
) ? 2 : 0;
10585 det
|= TYPE_UNSIGNED (inner
) ? 1 : 0;
10587 /* Determine the exponent to use. */
10592 /* oprec <= iprec, outer: signed, inner: don't care. */
10597 /* oprec <= iprec, outer: unsigned, inner: don't care. */
10601 /* oprec > iprec, outer: signed, inner: signed. */
10605 /* oprec > iprec, outer: signed, inner: unsigned. */
10609 /* oprec > iprec, outer: unsigned, inner: signed. */
10613 /* oprec > iprec, outer: unsigned, inner: unsigned. */
10617 gcc_unreachable ();
10620 return wide_int_to_tree (outer
,
10621 wi::mask (prec
, false, TYPE_PRECISION (outer
)));
10624 /* Returns the smallest value obtainable by casting something in INNER type to
10628 lower_bound_in_type (tree outer
, tree inner
)
10630 unsigned oprec
= TYPE_PRECISION (outer
);
10631 unsigned iprec
= TYPE_PRECISION (inner
);
10633 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
10635 if (TYPE_UNSIGNED (outer
)
10636 /* If we are widening something of an unsigned type, OUTER type
10637 contains all values of INNER type. In particular, both INNER
10638 and OUTER types have zero in common. */
10639 || (oprec
> iprec
&& TYPE_UNSIGNED (inner
)))
10640 return build_int_cst (outer
, 0);
10643 /* If we are widening a signed type to another signed type, we
10644 want to obtain -2^^(iprec-1). If we are keeping the
10645 precision or narrowing to a signed type, we want to obtain
10647 unsigned prec
= oprec
> iprec
? iprec
: oprec
;
10648 return wide_int_to_tree (outer
,
10649 wi::mask (prec
- 1, true,
10650 TYPE_PRECISION (outer
)));
10654 /* Return nonzero if two operands that are suitable for PHI nodes are
10655 necessarily equal. Specifically, both ARG0 and ARG1 must be either
10656 SSA_NAME or invariant. Note that this is strictly an optimization.
10657 That is, callers of this function can directly call operand_equal_p
10658 and get the same result, only slower. */
10661 operand_equal_for_phi_arg_p (const_tree arg0
, const_tree arg1
)
10665 if (TREE_CODE (arg0
) == SSA_NAME
|| TREE_CODE (arg1
) == SSA_NAME
)
10667 return operand_equal_p (arg0
, arg1
, 0);
10670 /* Returns number of zeros at the end of binary representation of X. */
10673 num_ending_zeros (const_tree x
)
10675 return build_int_cst (TREE_TYPE (x
), wi::ctz (x
));
10679 #define WALK_SUBTREE(NODE) \
10682 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
10688 /* This is a subroutine of walk_tree that walks field of TYPE that are to
10689 be walked whenever a type is seen in the tree. Rest of operands and return
10690 value are as for walk_tree. */
10693 walk_type_fields (tree type
, walk_tree_fn func
, void *data
,
10694 struct pointer_set_t
*pset
, walk_tree_lh lh
)
10696 tree result
= NULL_TREE
;
10698 switch (TREE_CODE (type
))
10701 case REFERENCE_TYPE
:
10703 /* We have to worry about mutually recursive pointers. These can't
10704 be written in C. They can in Ada. It's pathological, but
10705 there's an ACATS test (c38102a) that checks it. Deal with this
10706 by checking if we're pointing to another pointer, that one
10707 points to another pointer, that one does too, and we have no htab.
10708 If so, get a hash table. We check three levels deep to avoid
10709 the cost of the hash table if we don't need one. */
10710 if (POINTER_TYPE_P (TREE_TYPE (type
))
10711 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type
)))
10712 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type
))))
10715 result
= walk_tree_without_duplicates (&TREE_TYPE (type
),
10723 /* ... fall through ... */
10726 WALK_SUBTREE (TREE_TYPE (type
));
10730 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type
));
10732 /* Fall through. */
10734 case FUNCTION_TYPE
:
10735 WALK_SUBTREE (TREE_TYPE (type
));
10739 /* We never want to walk into default arguments. */
10740 for (arg
= TYPE_ARG_TYPES (type
); arg
; arg
= TREE_CHAIN (arg
))
10741 WALK_SUBTREE (TREE_VALUE (arg
));
10746 /* Don't follow this nodes's type if a pointer for fear that
10747 we'll have infinite recursion. If we have a PSET, then we
10750 || (!POINTER_TYPE_P (TREE_TYPE (type
))
10751 && TREE_CODE (TREE_TYPE (type
)) != OFFSET_TYPE
))
10752 WALK_SUBTREE (TREE_TYPE (type
));
10753 WALK_SUBTREE (TYPE_DOMAIN (type
));
10757 WALK_SUBTREE (TREE_TYPE (type
));
10758 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type
));
10768 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
10769 called with the DATA and the address of each sub-tree. If FUNC returns a
10770 non-NULL value, the traversal is stopped, and the value returned by FUNC
10771 is returned. If PSET is non-NULL it is used to record the nodes visited,
10772 and to avoid visiting a node more than once. */
10775 walk_tree_1 (tree
*tp
, walk_tree_fn func
, void *data
,
10776 struct pointer_set_t
*pset
, walk_tree_lh lh
)
10778 enum tree_code code
;
10782 #define WALK_SUBTREE_TAIL(NODE) \
10786 goto tail_recurse; \
10791 /* Skip empty subtrees. */
10795 /* Don't walk the same tree twice, if the user has requested
10796 that we avoid doing so. */
10797 if (pset
&& pointer_set_insert (pset
, *tp
))
10800 /* Call the function. */
10802 result
= (*func
) (tp
, &walk_subtrees
, data
);
10804 /* If we found something, return it. */
10808 code
= TREE_CODE (*tp
);
10810 /* Even if we didn't, FUNC may have decided that there was nothing
10811 interesting below this point in the tree. */
10812 if (!walk_subtrees
)
10814 /* But we still need to check our siblings. */
10815 if (code
== TREE_LIST
)
10816 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
10817 else if (code
== OMP_CLAUSE
)
10818 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10825 result
= (*lh
) (tp
, &walk_subtrees
, func
, data
, pset
);
10826 if (result
|| !walk_subtrees
)
10833 case IDENTIFIER_NODE
:
10840 case PLACEHOLDER_EXPR
:
10844 /* None of these have subtrees other than those already walked
10849 WALK_SUBTREE (TREE_VALUE (*tp
));
10850 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
10855 int len
= TREE_VEC_LENGTH (*tp
);
10860 /* Walk all elements but the first. */
10862 WALK_SUBTREE (TREE_VEC_ELT (*tp
, len
));
10864 /* Now walk the first one as a tail call. */
10865 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp
, 0));
10869 WALK_SUBTREE (TREE_REALPART (*tp
));
10870 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp
));
10874 unsigned HOST_WIDE_INT idx
;
10875 constructor_elt
*ce
;
10877 for (idx
= 0; vec_safe_iterate (CONSTRUCTOR_ELTS (*tp
), idx
, &ce
);
10879 WALK_SUBTREE (ce
->value
);
10884 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, 0));
10889 for (decl
= BIND_EXPR_VARS (*tp
); decl
; decl
= DECL_CHAIN (decl
))
10891 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
10892 into declarations that are just mentioned, rather than
10893 declared; they don't really belong to this part of the tree.
10894 And, we can see cycles: the initializer for a declaration
10895 can refer to the declaration itself. */
10896 WALK_SUBTREE (DECL_INITIAL (decl
));
10897 WALK_SUBTREE (DECL_SIZE (decl
));
10898 WALK_SUBTREE (DECL_SIZE_UNIT (decl
));
10900 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp
));
10903 case STATEMENT_LIST
:
10905 tree_stmt_iterator i
;
10906 for (i
= tsi_start (*tp
); !tsi_end_p (i
); tsi_next (&i
))
10907 WALK_SUBTREE (*tsi_stmt_ptr (i
));
10912 switch (OMP_CLAUSE_CODE (*tp
))
10914 case OMP_CLAUSE_PRIVATE
:
10915 case OMP_CLAUSE_SHARED
:
10916 case OMP_CLAUSE_FIRSTPRIVATE
:
10917 case OMP_CLAUSE_COPYIN
:
10918 case OMP_CLAUSE_COPYPRIVATE
:
10919 case OMP_CLAUSE_FINAL
:
10920 case OMP_CLAUSE_IF
:
10921 case OMP_CLAUSE_NUM_THREADS
:
10922 case OMP_CLAUSE_SCHEDULE
:
10923 case OMP_CLAUSE_UNIFORM
:
10924 case OMP_CLAUSE_DEPEND
:
10925 case OMP_CLAUSE_NUM_TEAMS
:
10926 case OMP_CLAUSE_THREAD_LIMIT
:
10927 case OMP_CLAUSE_DEVICE
:
10928 case OMP_CLAUSE_DIST_SCHEDULE
:
10929 case OMP_CLAUSE_SAFELEN
:
10930 case OMP_CLAUSE_SIMDLEN
:
10931 case OMP_CLAUSE__LOOPTEMP_
:
10932 case OMP_CLAUSE__SIMDUID_
:
10933 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 0));
10936 case OMP_CLAUSE_NOWAIT
:
10937 case OMP_CLAUSE_ORDERED
:
10938 case OMP_CLAUSE_DEFAULT
:
10939 case OMP_CLAUSE_UNTIED
:
10940 case OMP_CLAUSE_MERGEABLE
:
10941 case OMP_CLAUSE_PROC_BIND
:
10942 case OMP_CLAUSE_INBRANCH
:
10943 case OMP_CLAUSE_NOTINBRANCH
:
10944 case OMP_CLAUSE_FOR
:
10945 case OMP_CLAUSE_PARALLEL
:
10946 case OMP_CLAUSE_SECTIONS
:
10947 case OMP_CLAUSE_TASKGROUP
:
10948 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10950 case OMP_CLAUSE_LASTPRIVATE
:
10951 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
10952 WALK_SUBTREE (OMP_CLAUSE_LASTPRIVATE_STMT (*tp
));
10953 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10955 case OMP_CLAUSE_COLLAPSE
:
10958 for (i
= 0; i
< 3; i
++)
10959 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
10960 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10963 case OMP_CLAUSE_ALIGNED
:
10964 case OMP_CLAUSE_LINEAR
:
10965 case OMP_CLAUSE_FROM
:
10966 case OMP_CLAUSE_TO
:
10967 case OMP_CLAUSE_MAP
:
10968 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
10969 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 1));
10970 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10972 case OMP_CLAUSE_REDUCTION
:
10975 for (i
= 0; i
< 4; i
++)
10976 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
10977 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10981 gcc_unreachable ();
10989 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
10990 But, we only want to walk once. */
10991 len
= (TREE_OPERAND (*tp
, 3) == TREE_OPERAND (*tp
, 1)) ? 2 : 3;
10992 for (i
= 0; i
< len
; ++i
)
10993 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
10994 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
));
10998 /* If this is a TYPE_DECL, walk into the fields of the type that it's
10999 defining. We only want to walk into these fields of a type in this
11000 case and not in the general case of a mere reference to the type.
11002 The criterion is as follows: if the field can be an expression, it
11003 must be walked only here. This should be in keeping with the fields
11004 that are directly gimplified in gimplify_type_sizes in order for the
11005 mark/copy-if-shared/unmark machinery of the gimplifier to work with
11006 variable-sized types.
11008 Note that DECLs get walked as part of processing the BIND_EXPR. */
11009 if (TREE_CODE (DECL_EXPR_DECL (*tp
)) == TYPE_DECL
)
11011 tree
*type_p
= &TREE_TYPE (DECL_EXPR_DECL (*tp
));
11012 if (TREE_CODE (*type_p
) == ERROR_MARK
)
11015 /* Call the function for the type. See if it returns anything or
11016 doesn't want us to continue. If we are to continue, walk both
11017 the normal fields and those for the declaration case. */
11018 result
= (*func
) (type_p
, &walk_subtrees
, data
);
11019 if (result
|| !walk_subtrees
)
11022 /* But do not walk a pointed-to type since it may itself need to
11023 be walked in the declaration case if it isn't anonymous. */
11024 if (!POINTER_TYPE_P (*type_p
))
11026 result
= walk_type_fields (*type_p
, func
, data
, pset
, lh
);
11031 /* If this is a record type, also walk the fields. */
11032 if (RECORD_OR_UNION_TYPE_P (*type_p
))
11036 for (field
= TYPE_FIELDS (*type_p
); field
;
11037 field
= DECL_CHAIN (field
))
11039 /* We'd like to look at the type of the field, but we can
11040 easily get infinite recursion. So assume it's pointed
11041 to elsewhere in the tree. Also, ignore things that
11043 if (TREE_CODE (field
) != FIELD_DECL
)
11046 WALK_SUBTREE (DECL_FIELD_OFFSET (field
));
11047 WALK_SUBTREE (DECL_SIZE (field
));
11048 WALK_SUBTREE (DECL_SIZE_UNIT (field
));
11049 if (TREE_CODE (*type_p
) == QUAL_UNION_TYPE
)
11050 WALK_SUBTREE (DECL_QUALIFIER (field
));
11054 /* Same for scalar types. */
11055 else if (TREE_CODE (*type_p
) == BOOLEAN_TYPE
11056 || TREE_CODE (*type_p
) == ENUMERAL_TYPE
11057 || TREE_CODE (*type_p
) == INTEGER_TYPE
11058 || TREE_CODE (*type_p
) == FIXED_POINT_TYPE
11059 || TREE_CODE (*type_p
) == REAL_TYPE
)
11061 WALK_SUBTREE (TYPE_MIN_VALUE (*type_p
));
11062 WALK_SUBTREE (TYPE_MAX_VALUE (*type_p
));
11065 WALK_SUBTREE (TYPE_SIZE (*type_p
));
11066 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p
));
11071 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code
)))
11075 /* Walk over all the sub-trees of this operand. */
11076 len
= TREE_OPERAND_LENGTH (*tp
);
11078 /* Go through the subtrees. We need to do this in forward order so
11079 that the scope of a FOR_EXPR is handled properly. */
11082 for (i
= 0; i
< len
- 1; ++i
)
11083 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
11084 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
- 1));
11087 /* If this is a type, walk the needed fields in the type. */
11088 else if (TYPE_P (*tp
))
11089 return walk_type_fields (*tp
, func
, data
, pset
, lh
);
11093 /* We didn't find what we were looking for. */
11096 #undef WALK_SUBTREE_TAIL
11098 #undef WALK_SUBTREE
11100 /* Like walk_tree, but does not walk duplicate nodes more than once. */
11103 walk_tree_without_duplicates_1 (tree
*tp
, walk_tree_fn func
, void *data
,
11107 struct pointer_set_t
*pset
;
11109 pset
= pointer_set_create ();
11110 result
= walk_tree_1 (tp
, func
, data
, pset
, lh
);
11111 pointer_set_destroy (pset
);
11117 tree_block (tree t
)
11119 const enum tree_code_class c
= TREE_CODE_CLASS (TREE_CODE (t
));
11121 if (IS_EXPR_CODE_CLASS (c
))
11122 return LOCATION_BLOCK (t
->exp
.locus
);
11123 gcc_unreachable ();
11128 tree_set_block (tree t
, tree b
)
11130 const enum tree_code_class c
= TREE_CODE_CLASS (TREE_CODE (t
));
11132 if (IS_EXPR_CODE_CLASS (c
))
11135 t
->exp
.locus
= COMBINE_LOCATION_DATA (line_table
, t
->exp
.locus
, b
);
11137 t
->exp
.locus
= LOCATION_LOCUS (t
->exp
.locus
);
11140 gcc_unreachable ();
11143 /* Create a nameless artificial label and put it in the current
11144 function context. The label has a location of LOC. Returns the
11145 newly created label. */
11148 create_artificial_label (location_t loc
)
11150 tree lab
= build_decl (loc
,
11151 LABEL_DECL
, NULL_TREE
, void_type_node
);
11153 DECL_ARTIFICIAL (lab
) = 1;
11154 DECL_IGNORED_P (lab
) = 1;
11155 DECL_CONTEXT (lab
) = current_function_decl
;
11159 /* Given a tree, try to return a useful variable name that we can use
11160 to prefix a temporary that is being assigned the value of the tree.
11161 I.E. given <temp> = &A, return A. */
11166 tree stripped_decl
;
11169 STRIP_NOPS (stripped_decl
);
11170 if (DECL_P (stripped_decl
) && DECL_NAME (stripped_decl
))
11171 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl
));
11172 else if (TREE_CODE (stripped_decl
) == SSA_NAME
)
11174 tree name
= SSA_NAME_IDENTIFIER (stripped_decl
);
11177 return IDENTIFIER_POINTER (name
);
11181 switch (TREE_CODE (stripped_decl
))
11184 return get_name (TREE_OPERAND (stripped_decl
, 0));
11191 /* Return true if TYPE has a variable argument list. */
11194 stdarg_p (const_tree fntype
)
11196 function_args_iterator args_iter
;
11197 tree n
= NULL_TREE
, t
;
11202 FOREACH_FUNCTION_ARGS (fntype
, t
, args_iter
)
11207 return n
!= NULL_TREE
&& n
!= void_type_node
;
11210 /* Return true if TYPE has a prototype. */
11213 prototype_p (tree fntype
)
11217 gcc_assert (fntype
!= NULL_TREE
);
11219 t
= TYPE_ARG_TYPES (fntype
);
11220 return (t
!= NULL_TREE
);
11223 /* If BLOCK is inlined from an __attribute__((__artificial__))
11224 routine, return pointer to location from where it has been
11227 block_nonartificial_location (tree block
)
11229 location_t
*ret
= NULL
;
11231 while (block
&& TREE_CODE (block
) == BLOCK
11232 && BLOCK_ABSTRACT_ORIGIN (block
))
11234 tree ao
= BLOCK_ABSTRACT_ORIGIN (block
);
11236 while (TREE_CODE (ao
) == BLOCK
11237 && BLOCK_ABSTRACT_ORIGIN (ao
)
11238 && BLOCK_ABSTRACT_ORIGIN (ao
) != ao
)
11239 ao
= BLOCK_ABSTRACT_ORIGIN (ao
);
11241 if (TREE_CODE (ao
) == FUNCTION_DECL
)
11243 /* If AO is an artificial inline, point RET to the
11244 call site locus at which it has been inlined and continue
11245 the loop, in case AO's caller is also an artificial
11247 if (DECL_DECLARED_INLINE_P (ao
)
11248 && lookup_attribute ("artificial", DECL_ATTRIBUTES (ao
)))
11249 ret
= &BLOCK_SOURCE_LOCATION (block
);
11253 else if (TREE_CODE (ao
) != BLOCK
)
11256 block
= BLOCK_SUPERCONTEXT (block
);
11262 /* If EXP is inlined from an __attribute__((__artificial__))
11263 function, return the location of the original call expression. */
11266 tree_nonartificial_location (tree exp
)
11268 location_t
*loc
= block_nonartificial_location (TREE_BLOCK (exp
));
11273 return EXPR_LOCATION (exp
);
11277 /* These are the hash table functions for the hash table of OPTIMIZATION_NODEq
11280 /* Return the hash code code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
11283 cl_option_hash_hash (const void *x
)
11285 const_tree
const t
= (const_tree
) x
;
11289 hashval_t hash
= 0;
11291 if (TREE_CODE (t
) == OPTIMIZATION_NODE
)
11293 p
= (const char *)TREE_OPTIMIZATION (t
);
11294 len
= sizeof (struct cl_optimization
);
11297 else if (TREE_CODE (t
) == TARGET_OPTION_NODE
)
11299 p
= (const char *)TREE_TARGET_OPTION (t
);
11300 len
= sizeof (struct cl_target_option
);
11304 gcc_unreachable ();
11306 /* assume most opt flags are just 0/1, some are 2-3, and a few might be
11308 for (i
= 0; i
< len
; i
++)
11310 hash
= (hash
<< 4) ^ ((i
<< 2) | p
[i
]);
11315 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
11316 TARGET_OPTION tree node) is the same as that given by *Y, which is the
11320 cl_option_hash_eq (const void *x
, const void *y
)
11322 const_tree
const xt
= (const_tree
) x
;
11323 const_tree
const yt
= (const_tree
) y
;
11328 if (TREE_CODE (xt
) != TREE_CODE (yt
))
11331 if (TREE_CODE (xt
) == OPTIMIZATION_NODE
)
11333 xp
= (const char *)TREE_OPTIMIZATION (xt
);
11334 yp
= (const char *)TREE_OPTIMIZATION (yt
);
11335 len
= sizeof (struct cl_optimization
);
11338 else if (TREE_CODE (xt
) == TARGET_OPTION_NODE
)
11340 xp
= (const char *)TREE_TARGET_OPTION (xt
);
11341 yp
= (const char *)TREE_TARGET_OPTION (yt
);
11342 len
= sizeof (struct cl_target_option
);
11346 gcc_unreachable ();
11348 return (memcmp (xp
, yp
, len
) == 0);
11351 /* Build an OPTIMIZATION_NODE based on the options in OPTS. */
11354 build_optimization_node (struct gcc_options
*opts
)
11359 /* Use the cache of optimization nodes. */
11361 cl_optimization_save (TREE_OPTIMIZATION (cl_optimization_node
),
11364 slot
= htab_find_slot (cl_option_hash_table
, cl_optimization_node
, INSERT
);
11368 /* Insert this one into the hash table. */
11369 t
= cl_optimization_node
;
11372 /* Make a new node for next time round. */
11373 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
11379 /* Build a TARGET_OPTION_NODE based on the options in OPTS. */
11382 build_target_option_node (struct gcc_options
*opts
)
11387 /* Use the cache of optimization nodes. */
11389 cl_target_option_save (TREE_TARGET_OPTION (cl_target_option_node
),
11392 slot
= htab_find_slot (cl_option_hash_table
, cl_target_option_node
, INSERT
);
11396 /* Insert this one into the hash table. */
11397 t
= cl_target_option_node
;
11400 /* Make a new node for next time round. */
11401 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
11407 /* Reset TREE_TARGET_GLOBALS cache for TARGET_OPTION_NODE.
11408 Called through htab_traverse. */
11411 prepare_target_option_node_for_pch (void **slot
, void *)
11413 tree node
= (tree
) *slot
;
11414 if (TREE_CODE (node
) == TARGET_OPTION_NODE
)
11415 TREE_TARGET_GLOBALS (node
) = NULL
;
11419 /* Clear TREE_TARGET_GLOBALS of all TARGET_OPTION_NODE trees,
11420 so that they aren't saved during PCH writing. */
11423 prepare_target_option_nodes_for_pch (void)
11425 htab_traverse (cl_option_hash_table
, prepare_target_option_node_for_pch
,
11429 /* Determine the "ultimate origin" of a block. The block may be an inlined
11430 instance of an inlined instance of a block which is local to an inline
11431 function, so we have to trace all of the way back through the origin chain
11432 to find out what sort of node actually served as the original seed for the
11436 block_ultimate_origin (const_tree block
)
11438 tree immediate_origin
= BLOCK_ABSTRACT_ORIGIN (block
);
11440 /* output_inline_function sets BLOCK_ABSTRACT_ORIGIN for all the
11441 nodes in the function to point to themselves; ignore that if
11442 we're trying to output the abstract instance of this function. */
11443 if (BLOCK_ABSTRACT (block
) && immediate_origin
== block
)
11446 if (immediate_origin
== NULL_TREE
)
11451 tree lookahead
= immediate_origin
;
11455 ret_val
= lookahead
;
11456 lookahead
= (TREE_CODE (ret_val
) == BLOCK
11457 ? BLOCK_ABSTRACT_ORIGIN (ret_val
) : NULL
);
11459 while (lookahead
!= NULL
&& lookahead
!= ret_val
);
11461 /* The block's abstract origin chain may not be the *ultimate* origin of
11462 the block. It could lead to a DECL that has an abstract origin set.
11463 If so, we want that DECL's abstract origin (which is what DECL_ORIGIN
11464 will give us if it has one). Note that DECL's abstract origins are
11465 supposed to be the most distant ancestor (or so decl_ultimate_origin
11466 claims), so we don't need to loop following the DECL origins. */
11467 if (DECL_P (ret_val
))
11468 return DECL_ORIGIN (ret_val
);
11474 /* Return true iff conversion in EXP generates no instruction. Mark
11475 it inline so that we fully inline into the stripping functions even
11476 though we have two uses of this function. */
11479 tree_nop_conversion (const_tree exp
)
11481 tree outer_type
, inner_type
;
11483 if (!CONVERT_EXPR_P (exp
)
11484 && TREE_CODE (exp
) != NON_LVALUE_EXPR
)
11486 if (TREE_OPERAND (exp
, 0) == error_mark_node
)
11489 outer_type
= TREE_TYPE (exp
);
11490 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
11495 /* Use precision rather then machine mode when we can, which gives
11496 the correct answer even for submode (bit-field) types. */
11497 if ((INTEGRAL_TYPE_P (outer_type
)
11498 || POINTER_TYPE_P (outer_type
)
11499 || TREE_CODE (outer_type
) == OFFSET_TYPE
)
11500 && (INTEGRAL_TYPE_P (inner_type
)
11501 || POINTER_TYPE_P (inner_type
)
11502 || TREE_CODE (inner_type
) == OFFSET_TYPE
))
11503 return TYPE_PRECISION (outer_type
) == TYPE_PRECISION (inner_type
);
11505 /* Otherwise fall back on comparing machine modes (e.g. for
11506 aggregate types, floats). */
11507 return TYPE_MODE (outer_type
) == TYPE_MODE (inner_type
);
11510 /* Return true iff conversion in EXP generates no instruction. Don't
11511 consider conversions changing the signedness. */
11514 tree_sign_nop_conversion (const_tree exp
)
11516 tree outer_type
, inner_type
;
11518 if (!tree_nop_conversion (exp
))
11521 outer_type
= TREE_TYPE (exp
);
11522 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
11524 return (TYPE_UNSIGNED (outer_type
) == TYPE_UNSIGNED (inner_type
)
11525 && POINTER_TYPE_P (outer_type
) == POINTER_TYPE_P (inner_type
));
11528 /* Strip conversions from EXP according to tree_nop_conversion and
11529 return the resulting expression. */
11532 tree_strip_nop_conversions (tree exp
)
11534 while (tree_nop_conversion (exp
))
11535 exp
= TREE_OPERAND (exp
, 0);
11539 /* Strip conversions from EXP according to tree_sign_nop_conversion
11540 and return the resulting expression. */
11543 tree_strip_sign_nop_conversions (tree exp
)
11545 while (tree_sign_nop_conversion (exp
))
11546 exp
= TREE_OPERAND (exp
, 0);
11550 /* Avoid any floating point extensions from EXP. */
11552 strip_float_extensions (tree exp
)
11554 tree sub
, expt
, subt
;
11556 /* For floating point constant look up the narrowest type that can hold
11557 it properly and handle it like (type)(narrowest_type)constant.
11558 This way we can optimize for instance a=a*2.0 where "a" is float
11559 but 2.0 is double constant. */
11560 if (TREE_CODE (exp
) == REAL_CST
&& !DECIMAL_FLOAT_TYPE_P (TREE_TYPE (exp
)))
11562 REAL_VALUE_TYPE orig
;
11565 orig
= TREE_REAL_CST (exp
);
11566 if (TYPE_PRECISION (TREE_TYPE (exp
)) > TYPE_PRECISION (float_type_node
)
11567 && exact_real_truncate (TYPE_MODE (float_type_node
), &orig
))
11568 type
= float_type_node
;
11569 else if (TYPE_PRECISION (TREE_TYPE (exp
))
11570 > TYPE_PRECISION (double_type_node
)
11571 && exact_real_truncate (TYPE_MODE (double_type_node
), &orig
))
11572 type
= double_type_node
;
11574 return build_real (type
, real_value_truncate (TYPE_MODE (type
), orig
));
11577 if (!CONVERT_EXPR_P (exp
))
11580 sub
= TREE_OPERAND (exp
, 0);
11581 subt
= TREE_TYPE (sub
);
11582 expt
= TREE_TYPE (exp
);
11584 if (!FLOAT_TYPE_P (subt
))
11587 if (DECIMAL_FLOAT_TYPE_P (expt
) != DECIMAL_FLOAT_TYPE_P (subt
))
11590 if (TYPE_PRECISION (subt
) > TYPE_PRECISION (expt
))
11593 return strip_float_extensions (sub
);
11596 /* Strip out all handled components that produce invariant
11600 strip_invariant_refs (const_tree op
)
11602 while (handled_component_p (op
))
11604 switch (TREE_CODE (op
))
11607 case ARRAY_RANGE_REF
:
11608 if (!is_gimple_constant (TREE_OPERAND (op
, 1))
11609 || TREE_OPERAND (op
, 2) != NULL_TREE
11610 || TREE_OPERAND (op
, 3) != NULL_TREE
)
11614 case COMPONENT_REF
:
11615 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
11621 op
= TREE_OPERAND (op
, 0);
11627 static GTY(()) tree gcc_eh_personality_decl
;
11629 /* Return the GCC personality function decl. */
11632 lhd_gcc_personality (void)
11634 if (!gcc_eh_personality_decl
)
11635 gcc_eh_personality_decl
= build_personality_function ("gcc");
11636 return gcc_eh_personality_decl
;
11639 /* For languages with One Definition Rule, work out if
11640 trees are actually the same even if the tree representation
11641 differs. This handles only decls appearing in TYPE_NAME
11642 and TYPE_CONTEXT. That is NAMESPACE_DECL, TYPE_DECL,
11643 RECORD_TYPE and IDENTIFIER_NODE. */
11646 same_for_odr (tree t1
, tree t2
)
11652 /* C and C++ FEs differ by using IDENTIFIER_NODE and TYPE_DECL. */
11653 if (TREE_CODE (t1
) == IDENTIFIER_NODE
11654 && TREE_CODE (t2
) == TYPE_DECL
11655 && DECL_FILE_SCOPE_P (t1
))
11657 t2
= DECL_NAME (t2
);
11658 gcc_assert (TREE_CODE (t2
) == IDENTIFIER_NODE
);
11660 if (TREE_CODE (t2
) == IDENTIFIER_NODE
11661 && TREE_CODE (t1
) == TYPE_DECL
11662 && DECL_FILE_SCOPE_P (t2
))
11664 t1
= DECL_NAME (t1
);
11665 gcc_assert (TREE_CODE (t1
) == IDENTIFIER_NODE
);
11667 if (TREE_CODE (t1
) != TREE_CODE (t2
))
11670 return types_same_for_odr (t1
, t2
);
11672 return decls_same_for_odr (t1
, t2
);
11676 /* For languages with One Definition Rule, work out if
11677 decls are actually the same even if the tree representation
11678 differs. This handles only decls appearing in TYPE_NAME
11679 and TYPE_CONTEXT. That is NAMESPACE_DECL, TYPE_DECL,
11680 RECORD_TYPE and IDENTIFIER_NODE. */
11683 decls_same_for_odr (tree decl1
, tree decl2
)
11685 if (decl1
&& TREE_CODE (decl1
) == TYPE_DECL
11686 && DECL_ORIGINAL_TYPE (decl1
))
11687 decl1
= DECL_ORIGINAL_TYPE (decl1
);
11688 if (decl2
&& TREE_CODE (decl2
) == TYPE_DECL
11689 && DECL_ORIGINAL_TYPE (decl2
))
11690 decl2
= DECL_ORIGINAL_TYPE (decl2
);
11691 if (decl1
== decl2
)
11693 if (!decl1
|| !decl2
)
11695 gcc_checking_assert (DECL_P (decl1
) && DECL_P (decl2
));
11696 if (TREE_CODE (decl1
) != TREE_CODE (decl2
))
11698 if (TREE_CODE (decl1
) == TRANSLATION_UNIT_DECL
)
11700 if (TREE_CODE (decl1
) != NAMESPACE_DECL
11701 && TREE_CODE (decl1
) != TYPE_DECL
)
11703 if (!DECL_NAME (decl1
))
11705 gcc_checking_assert (TREE_CODE (DECL_NAME (decl1
)) == IDENTIFIER_NODE
);
11706 gcc_checking_assert (!DECL_NAME (decl2
)
11707 || TREE_CODE (DECL_NAME (decl2
)) == IDENTIFIER_NODE
);
11708 if (DECL_NAME (decl1
) != DECL_NAME (decl2
))
11710 return same_for_odr (DECL_CONTEXT (decl1
),
11711 DECL_CONTEXT (decl2
));
11714 /* For languages with One Definition Rule, work out if
11715 types are same even if the tree representation differs.
11716 This is non-trivial for LTO where minnor differences in
11717 the type representation may have prevented type merging
11718 to merge two copies of otherwise equivalent type. */
11721 types_same_for_odr (tree type1
, tree type2
)
11723 gcc_checking_assert (TYPE_P (type1
) && TYPE_P (type2
));
11724 type1
= TYPE_MAIN_VARIANT (type1
);
11725 type2
= TYPE_MAIN_VARIANT (type2
);
11726 if (type1
== type2
)
11729 #ifndef ENABLE_CHECKING
11734 /* Check for anonymous namespaces. Those have !TREE_PUBLIC
11735 on the corresponding TYPE_STUB_DECL. */
11736 if (type_in_anonymous_namespace_p (type1
)
11737 || type_in_anonymous_namespace_p (type2
))
11739 /* When assembler name of virtual table is available, it is
11740 easy to compare types for equivalence. */
11741 if (TYPE_BINFO (type1
) && TYPE_BINFO (type2
)
11742 && BINFO_VTABLE (TYPE_BINFO (type1
))
11743 && BINFO_VTABLE (TYPE_BINFO (type2
)))
11745 tree v1
= BINFO_VTABLE (TYPE_BINFO (type1
));
11746 tree v2
= BINFO_VTABLE (TYPE_BINFO (type2
));
11748 if (TREE_CODE (v1
) == POINTER_PLUS_EXPR
)
11750 if (TREE_CODE (v2
) != POINTER_PLUS_EXPR
11751 || !operand_equal_p (TREE_OPERAND (v1
, 1),
11752 TREE_OPERAND (v2
, 1), 0))
11754 v1
= TREE_OPERAND (TREE_OPERAND (v1
, 0), 0);
11755 v2
= TREE_OPERAND (TREE_OPERAND (v2
, 0), 0);
11757 v1
= DECL_ASSEMBLER_NAME (v1
);
11758 v2
= DECL_ASSEMBLER_NAME (v2
);
11762 /* FIXME: the code comparing type names consider all instantiations of the
11763 same template to have same name. This is because we have no access
11764 to template parameters. For types with no virtual method tables
11765 we thus can return false positives. At the moment we do not need
11766 to compare types in other scenarios than devirtualization. */
11768 /* If types are not structuraly same, do not bother to contnue.
11769 Match in the remainder of code would mean ODR violation. */
11770 if (!types_compatible_p (type1
, type2
))
11772 if (!TYPE_NAME (type1
))
11774 if (!decls_same_for_odr (TYPE_NAME (type1
), TYPE_NAME (type2
)))
11776 if (!same_for_odr (TYPE_CONTEXT (type1
), TYPE_CONTEXT (type2
)))
11778 /* When not in LTO the MAIN_VARIANT check should be the same. */
11779 gcc_assert (in_lto_p
);
11784 /* TARGET is a call target of GIMPLE call statement
11785 (obtained by gimple_call_fn). Return true if it is
11786 OBJ_TYPE_REF representing an virtual call of C++ method.
11787 (As opposed to OBJ_TYPE_REF representing objc calls
11788 through a cast where middle-end devirtualization machinery
11792 virtual_method_call_p (tree target
)
11794 if (TREE_CODE (target
) != OBJ_TYPE_REF
)
11796 target
= TREE_TYPE (target
);
11797 gcc_checking_assert (TREE_CODE (target
) == POINTER_TYPE
);
11798 target
= TREE_TYPE (target
);
11799 if (TREE_CODE (target
) == FUNCTION_TYPE
)
11801 gcc_checking_assert (TREE_CODE (target
) == METHOD_TYPE
);
11805 /* REF is OBJ_TYPE_REF, return the class the ref corresponds to. */
11808 obj_type_ref_class (tree ref
)
11810 gcc_checking_assert (TREE_CODE (ref
) == OBJ_TYPE_REF
);
11811 ref
= TREE_TYPE (ref
);
11812 gcc_checking_assert (TREE_CODE (ref
) == POINTER_TYPE
);
11813 ref
= TREE_TYPE (ref
);
11814 /* We look for type THIS points to. ObjC also builds
11815 OBJ_TYPE_REF with non-method calls, Their first parameter
11816 ID however also corresponds to class type. */
11817 gcc_checking_assert (TREE_CODE (ref
) == METHOD_TYPE
11818 || TREE_CODE (ref
) == FUNCTION_TYPE
);
11819 ref
= TREE_VALUE (TYPE_ARG_TYPES (ref
));
11820 gcc_checking_assert (TREE_CODE (ref
) == POINTER_TYPE
);
11821 return TREE_TYPE (ref
);
11824 /* Return true if T is in anonymous namespace. */
11827 type_in_anonymous_namespace_p (tree t
)
11829 return (TYPE_STUB_DECL (t
) && !TREE_PUBLIC (TYPE_STUB_DECL (t
)));
11832 /* Try to find a base info of BINFO that would have its field decl at offset
11833 OFFSET within the BINFO type and which is of EXPECTED_TYPE. If it can be
11834 found, return, otherwise return NULL_TREE. */
11837 get_binfo_at_offset (tree binfo
, HOST_WIDE_INT offset
, tree expected_type
)
11839 tree type
= BINFO_TYPE (binfo
);
11843 HOST_WIDE_INT pos
, size
;
11847 if (types_same_for_odr (type
, expected_type
))
11852 for (fld
= TYPE_FIELDS (type
); fld
; fld
= DECL_CHAIN (fld
))
11854 if (TREE_CODE (fld
) != FIELD_DECL
)
11857 pos
= int_bit_position (fld
);
11858 size
= tree_to_uhwi (DECL_SIZE (fld
));
11859 if (pos
<= offset
&& (pos
+ size
) > offset
)
11862 if (!fld
|| TREE_CODE (TREE_TYPE (fld
)) != RECORD_TYPE
)
11865 if (!DECL_ARTIFICIAL (fld
))
11867 binfo
= TYPE_BINFO (TREE_TYPE (fld
));
11871 /* Offset 0 indicates the primary base, whose vtable contents are
11872 represented in the binfo for the derived class. */
11873 else if (offset
!= 0)
11875 tree base_binfo
, binfo2
= binfo
;
11877 /* Find BINFO corresponding to FLD. This is bit harder
11878 by a fact that in virtual inheritance we may need to walk down
11879 the non-virtual inheritance chain. */
11882 tree containing_binfo
= NULL
, found_binfo
= NULL
;
11883 for (i
= 0; BINFO_BASE_ITERATE (binfo2
, i
, base_binfo
); i
++)
11884 if (types_same_for_odr (TREE_TYPE (base_binfo
), TREE_TYPE (fld
)))
11886 found_binfo
= base_binfo
;
11890 if ((tree_to_shwi (BINFO_OFFSET (base_binfo
))
11891 - tree_to_shwi (BINFO_OFFSET (binfo
)))
11892 * BITS_PER_UNIT
< pos
11893 /* Rule out types with no virtual methods or we can get confused
11894 here by zero sized bases. */
11895 && BINFO_VTABLE (TYPE_BINFO (BINFO_TYPE (base_binfo
)))
11896 && (!containing_binfo
11897 || (tree_to_shwi (BINFO_OFFSET (containing_binfo
))
11898 < tree_to_shwi (BINFO_OFFSET (base_binfo
)))))
11899 containing_binfo
= base_binfo
;
11902 binfo
= found_binfo
;
11905 if (!containing_binfo
)
11907 binfo2
= containing_binfo
;
11911 type
= TREE_TYPE (fld
);
11916 /* Returns true if X is a typedef decl. */
11919 is_typedef_decl (tree x
)
11921 return (x
&& TREE_CODE (x
) == TYPE_DECL
11922 && DECL_ORIGINAL_TYPE (x
) != NULL_TREE
);
11925 /* Returns true iff TYPE is a type variant created for a typedef. */
11928 typedef_variant_p (tree type
)
11930 return is_typedef_decl (TYPE_NAME (type
));
11933 /* Warn about a use of an identifier which was marked deprecated. */
11935 warn_deprecated_use (tree node
, tree attr
)
11939 if (node
== 0 || !warn_deprecated_decl
)
11945 attr
= DECL_ATTRIBUTES (node
);
11946 else if (TYPE_P (node
))
11948 tree decl
= TYPE_STUB_DECL (node
);
11950 attr
= lookup_attribute ("deprecated",
11951 TYPE_ATTRIBUTES (TREE_TYPE (decl
)));
11956 attr
= lookup_attribute ("deprecated", attr
);
11959 msg
= TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr
)));
11965 expanded_location xloc
= expand_location (DECL_SOURCE_LOCATION (node
));
11967 warning (OPT_Wdeprecated_declarations
,
11968 "%qD is deprecated (declared at %r%s:%d%R): %s",
11969 node
, "locus", xloc
.file
, xloc
.line
, msg
);
11971 warning (OPT_Wdeprecated_declarations
,
11972 "%qD is deprecated (declared at %r%s:%d%R)",
11973 node
, "locus", xloc
.file
, xloc
.line
);
11975 else if (TYPE_P (node
))
11977 tree what
= NULL_TREE
;
11978 tree decl
= TYPE_STUB_DECL (node
);
11980 if (TYPE_NAME (node
))
11982 if (TREE_CODE (TYPE_NAME (node
)) == IDENTIFIER_NODE
)
11983 what
= TYPE_NAME (node
);
11984 else if (TREE_CODE (TYPE_NAME (node
)) == TYPE_DECL
11985 && DECL_NAME (TYPE_NAME (node
)))
11986 what
= DECL_NAME (TYPE_NAME (node
));
11991 expanded_location xloc
11992 = expand_location (DECL_SOURCE_LOCATION (decl
));
11996 warning (OPT_Wdeprecated_declarations
,
11997 "%qE is deprecated (declared at %r%s:%d%R): %s",
11998 what
, "locus", xloc
.file
, xloc
.line
, msg
);
12000 warning (OPT_Wdeprecated_declarations
,
12001 "%qE is deprecated (declared at %r%s:%d%R)",
12002 what
, "locus", xloc
.file
, xloc
.line
);
12007 warning (OPT_Wdeprecated_declarations
,
12008 "type is deprecated (declared at %r%s:%d%R): %s",
12009 "locus", xloc
.file
, xloc
.line
, msg
);
12011 warning (OPT_Wdeprecated_declarations
,
12012 "type is deprecated (declared at %r%s:%d%R)",
12013 "locus", xloc
.file
, xloc
.line
);
12021 warning (OPT_Wdeprecated_declarations
, "%qE is deprecated: %s",
12024 warning (OPT_Wdeprecated_declarations
, "%qE is deprecated", what
);
12029 warning (OPT_Wdeprecated_declarations
, "type is deprecated: %s",
12032 warning (OPT_Wdeprecated_declarations
, "type is deprecated");
12038 /* Return true if REF has a COMPONENT_REF with a bit-field field declaration
12039 somewhere in it. */
12042 contains_bitfld_component_ref_p (const_tree ref
)
12044 while (handled_component_p (ref
))
12046 if (TREE_CODE (ref
) == COMPONENT_REF
12047 && DECL_BIT_FIELD (TREE_OPERAND (ref
, 1)))
12049 ref
= TREE_OPERAND (ref
, 0);
12055 /* Try to determine whether a TRY_CATCH expression can fall through.
12056 This is a subroutine of block_may_fallthru. */
12059 try_catch_may_fallthru (const_tree stmt
)
12061 tree_stmt_iterator i
;
12063 /* If the TRY block can fall through, the whole TRY_CATCH can
12065 if (block_may_fallthru (TREE_OPERAND (stmt
, 0)))
12068 i
= tsi_start (TREE_OPERAND (stmt
, 1));
12069 switch (TREE_CODE (tsi_stmt (i
)))
12072 /* We expect to see a sequence of CATCH_EXPR trees, each with a
12073 catch expression and a body. The whole TRY_CATCH may fall
12074 through iff any of the catch bodies falls through. */
12075 for (; !tsi_end_p (i
); tsi_next (&i
))
12077 if (block_may_fallthru (CATCH_BODY (tsi_stmt (i
))))
12082 case EH_FILTER_EXPR
:
12083 /* The exception filter expression only matters if there is an
12084 exception. If the exception does not match EH_FILTER_TYPES,
12085 we will execute EH_FILTER_FAILURE, and we will fall through
12086 if that falls through. If the exception does match
12087 EH_FILTER_TYPES, the stack unwinder will continue up the
12088 stack, so we will not fall through. We don't know whether we
12089 will throw an exception which matches EH_FILTER_TYPES or not,
12090 so we just ignore EH_FILTER_TYPES and assume that we might
12091 throw an exception which doesn't match. */
12092 return block_may_fallthru (EH_FILTER_FAILURE (tsi_stmt (i
)));
12095 /* This case represents statements to be executed when an
12096 exception occurs. Those statements are implicitly followed
12097 by a RESX statement to resume execution after the exception.
12098 So in this case the TRY_CATCH never falls through. */
12103 /* Try to determine if we can fall out of the bottom of BLOCK. This guess
12104 need not be 100% accurate; simply be conservative and return true if we
12105 don't know. This is used only to avoid stupidly generating extra code.
12106 If we're wrong, we'll just delete the extra code later. */
12109 block_may_fallthru (const_tree block
)
12111 /* This CONST_CAST is okay because expr_last returns its argument
12112 unmodified and we assign it to a const_tree. */
12113 const_tree stmt
= expr_last (CONST_CAST_TREE (block
));
12115 switch (stmt
? TREE_CODE (stmt
) : ERROR_MARK
)
12119 /* Easy cases. If the last statement of the block implies
12120 control transfer, then we can't fall through. */
12124 /* If SWITCH_LABELS is set, this is lowered, and represents a
12125 branch to a selected label and hence can not fall through.
12126 Otherwise SWITCH_BODY is set, and the switch can fall
12128 return SWITCH_LABELS (stmt
) == NULL_TREE
;
12131 if (block_may_fallthru (COND_EXPR_THEN (stmt
)))
12133 return block_may_fallthru (COND_EXPR_ELSE (stmt
));
12136 return block_may_fallthru (BIND_EXPR_BODY (stmt
));
12138 case TRY_CATCH_EXPR
:
12139 return try_catch_may_fallthru (stmt
);
12141 case TRY_FINALLY_EXPR
:
12142 /* The finally clause is always executed after the try clause,
12143 so if it does not fall through, then the try-finally will not
12144 fall through. Otherwise, if the try clause does not fall
12145 through, then when the finally clause falls through it will
12146 resume execution wherever the try clause was going. So the
12147 whole try-finally will only fall through if both the try
12148 clause and the finally clause fall through. */
12149 return (block_may_fallthru (TREE_OPERAND (stmt
, 0))
12150 && block_may_fallthru (TREE_OPERAND (stmt
, 1)));
12153 if (TREE_CODE (TREE_OPERAND (stmt
, 1)) == CALL_EXPR
)
12154 stmt
= TREE_OPERAND (stmt
, 1);
12160 /* Functions that do not return do not fall through. */
12161 return (call_expr_flags (stmt
) & ECF_NORETURN
) == 0;
12163 case CLEANUP_POINT_EXPR
:
12164 return block_may_fallthru (TREE_OPERAND (stmt
, 0));
12167 return block_may_fallthru (TREE_OPERAND (stmt
, 1));
12173 return lang_hooks
.block_may_fallthru (stmt
);
12177 /* True if we are using EH to handle cleanups. */
12178 static bool using_eh_for_cleanups_flag
= false;
12180 /* This routine is called from front ends to indicate eh should be used for
12183 using_eh_for_cleanups (void)
12185 using_eh_for_cleanups_flag
= true;
12188 /* Query whether EH is used for cleanups. */
12190 using_eh_for_cleanups_p (void)
12192 return using_eh_for_cleanups_flag
;
12195 /* Wrapper for tree_code_name to ensure that tree code is valid */
12197 get_tree_code_name (enum tree_code code
)
12199 const char *invalid
= "<invalid tree code>";
12201 if (code
>= MAX_TREE_CODES
)
12204 return tree_code_name
[code
];
12207 /* Drops the TREE_OVERFLOW flag from T. */
12210 drop_tree_overflow (tree t
)
12212 gcc_checking_assert (TREE_OVERFLOW (t
));
12214 /* For tree codes with a sharing machinery re-build the result. */
12215 if (TREE_CODE (t
) == INTEGER_CST
)
12216 return wide_int_to_tree (TREE_TYPE (t
), t
);
12218 /* Otherwise, as all tcc_constants are possibly shared, copy the node
12219 and drop the flag. */
12221 TREE_OVERFLOW (t
) = 0;
12225 /* Given a memory reference expression T, return its base address.
12226 The base address of a memory reference expression is the main
12227 object being referenced. For instance, the base address for
12228 'array[i].fld[j]' is 'array'. You can think of this as stripping
12229 away the offset part from a memory address.
12231 This function calls handled_component_p to strip away all the inner
12232 parts of the memory reference until it reaches the base object. */
12235 get_base_address (tree t
)
12237 while (handled_component_p (t
))
12238 t
= TREE_OPERAND (t
, 0);
12240 if ((TREE_CODE (t
) == MEM_REF
12241 || TREE_CODE (t
) == TARGET_MEM_REF
)
12242 && TREE_CODE (TREE_OPERAND (t
, 0)) == ADDR_EXPR
)
12243 t
= TREE_OPERAND (TREE_OPERAND (t
, 0), 0);
12245 /* ??? Either the alias oracle or all callers need to properly deal
12246 with WITH_SIZE_EXPRs before we can look through those. */
12247 if (TREE_CODE (t
) == WITH_SIZE_EXPR
)
12253 #include "gt-tree.h"