1 /* Language-independent node constructors for parse phase of GNU compiler.
2 Copyright (C) 1987-2013 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"
39 #include "toplev.h" /* get_random_seed */
42 #include "filenames.h"
45 #include "common/common-target.h"
46 #include "langhooks.h"
47 #include "tree-inline.h"
48 #include "tree-iterator.h"
49 #include "basic-block.h"
52 #include "gimple-iterator.h"
54 #include "gimple-ssa.h"
56 #include "tree-phinodes.h"
57 #include "tree-ssanames.h"
60 #include "pointer-set.h"
61 #include "tree-pass.h"
62 #include "langhooks-def.h"
63 #include "diagnostic.h"
64 #include "tree-diagnostic.h"
65 #include "tree-pretty-print.h"
71 /* Tree code classes. */
73 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) TYPE,
74 #define END_OF_BASE_TREE_CODES tcc_exceptional,
76 const enum tree_code_class tree_code_type
[] = {
77 #include "all-tree.def"
81 #undef END_OF_BASE_TREE_CODES
83 /* Table indexed by tree code giving number of expression
84 operands beyond the fixed part of the node structure.
85 Not used for types or decls. */
87 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) LENGTH,
88 #define END_OF_BASE_TREE_CODES 0,
90 const unsigned char tree_code_length
[] = {
91 #include "all-tree.def"
95 #undef END_OF_BASE_TREE_CODES
97 /* Names of tree components.
98 Used for printing out the tree and error messages. */
99 #define DEFTREECODE(SYM, NAME, TYPE, LEN) NAME,
100 #define END_OF_BASE_TREE_CODES "@dummy",
102 static const char *const tree_code_name
[] = {
103 #include "all-tree.def"
107 #undef END_OF_BASE_TREE_CODES
109 /* Each tree code class has an associated string representation.
110 These must correspond to the tree_code_class entries. */
112 const char *const tree_code_class_strings
[] =
127 /* obstack.[ch] explicitly declined to prototype this. */
128 extern int _obstack_allocated_p (struct obstack
*h
, void *obj
);
130 /* Statistics-gathering stuff. */
132 static int tree_code_counts
[MAX_TREE_CODES
];
133 int tree_node_counts
[(int) all_kinds
];
134 int tree_node_sizes
[(int) all_kinds
];
136 /* Keep in sync with tree.h:enum tree_node_kind. */
137 static const char * const tree_node_kind_names
[] = {
156 /* Unique id for next decl created. */
157 static GTY(()) int next_decl_uid
;
158 /* Unique id for next type created. */
159 static GTY(()) int next_type_uid
= 1;
160 /* Unique id for next debug decl created. Use negative numbers,
161 to catch erroneous uses. */
162 static GTY(()) int next_debug_decl_uid
;
164 /* Since we cannot rehash a type after it is in the table, we have to
165 keep the hash code. */
167 struct GTY(()) type_hash
{
172 /* Initial size of the hash table (rounded to next prime). */
173 #define TYPE_HASH_INITIAL_SIZE 1000
175 /* Now here is the hash table. When recording a type, it is added to
176 the slot whose index is the hash code. Note that the hash table is
177 used for several kinds of types (function types, array types and
178 array index range types, for now). While all these live in the
179 same table, they are completely independent, and the hash code is
180 computed differently for each of these. */
182 static GTY ((if_marked ("type_hash_marked_p"), param_is (struct type_hash
)))
183 htab_t type_hash_table
;
185 /* Hash table and temporary node for larger integer const values. */
186 static GTY (()) tree int_cst_node
;
187 static GTY ((if_marked ("ggc_marked_p"), param_is (union tree_node
)))
188 htab_t int_cst_hash_table
;
190 /* Hash table for optimization flags and target option flags. Use the same
191 hash table for both sets of options. Nodes for building the current
192 optimization and target option nodes. The assumption is most of the time
193 the options created will already be in the hash table, so we avoid
194 allocating and freeing up a node repeatably. */
195 static GTY (()) tree cl_optimization_node
;
196 static GTY (()) tree cl_target_option_node
;
197 static GTY ((if_marked ("ggc_marked_p"), param_is (union tree_node
)))
198 htab_t cl_option_hash_table
;
200 /* General tree->tree mapping structure for use in hash tables. */
203 static GTY ((if_marked ("tree_decl_map_marked_p"), param_is (struct tree_decl_map
)))
204 htab_t debug_expr_for_decl
;
206 static GTY ((if_marked ("tree_decl_map_marked_p"), param_is (struct tree_decl_map
)))
207 htab_t value_expr_for_decl
;
209 static GTY ((if_marked ("tree_vec_map_marked_p"), param_is (struct tree_vec_map
)))
210 htab_t debug_args_for_decl
;
212 static GTY ((if_marked ("tree_priority_map_marked_p"),
213 param_is (struct tree_priority_map
)))
214 htab_t init_priority_for_decl
;
216 static void set_type_quals (tree
, int);
217 static int type_hash_eq (const void *, const void *);
218 static hashval_t
type_hash_hash (const void *);
219 static hashval_t
int_cst_hash_hash (const void *);
220 static int int_cst_hash_eq (const void *, const void *);
221 static hashval_t
cl_option_hash_hash (const void *);
222 static int cl_option_hash_eq (const void *, const void *);
223 static void print_type_hash_statistics (void);
224 static void print_debug_expr_statistics (void);
225 static void print_value_expr_statistics (void);
226 static int type_hash_marked_p (const void *);
227 static unsigned int type_hash_list (const_tree
, hashval_t
);
228 static unsigned int attribute_hash_list (const_tree
, hashval_t
);
229 static bool decls_same_for_odr (tree decl1
, tree decl2
);
231 tree global_trees
[TI_MAX
];
232 tree integer_types
[itk_none
];
234 unsigned char tree_contains_struct
[MAX_TREE_CODES
][64];
236 /* Number of operands for each OpenMP clause. */
237 unsigned const char omp_clause_num_ops
[] =
239 0, /* OMP_CLAUSE_ERROR */
240 1, /* OMP_CLAUSE_PRIVATE */
241 1, /* OMP_CLAUSE_SHARED */
242 1, /* OMP_CLAUSE_FIRSTPRIVATE */
243 2, /* OMP_CLAUSE_LASTPRIVATE */
244 4, /* OMP_CLAUSE_REDUCTION */
245 1, /* OMP_CLAUSE_COPYIN */
246 1, /* OMP_CLAUSE_COPYPRIVATE */
247 2, /* OMP_CLAUSE_LINEAR */
248 2, /* OMP_CLAUSE_ALIGNED */
249 1, /* OMP_CLAUSE_DEPEND */
250 1, /* OMP_CLAUSE_UNIFORM */
251 2, /* OMP_CLAUSE_FROM */
252 2, /* OMP_CLAUSE_TO */
253 2, /* OMP_CLAUSE_MAP */
254 1, /* OMP_CLAUSE__LOOPTEMP_ */
255 1, /* OMP_CLAUSE_IF */
256 1, /* OMP_CLAUSE_NUM_THREADS */
257 1, /* OMP_CLAUSE_SCHEDULE */
258 0, /* OMP_CLAUSE_NOWAIT */
259 0, /* OMP_CLAUSE_ORDERED */
260 0, /* OMP_CLAUSE_DEFAULT */
261 3, /* OMP_CLAUSE_COLLAPSE */
262 0, /* OMP_CLAUSE_UNTIED */
263 1, /* OMP_CLAUSE_FINAL */
264 0, /* OMP_CLAUSE_MERGEABLE */
265 1, /* OMP_CLAUSE_DEVICE */
266 1, /* OMP_CLAUSE_DIST_SCHEDULE */
267 0, /* OMP_CLAUSE_INBRANCH */
268 0, /* OMP_CLAUSE_NOTINBRANCH */
269 1, /* OMP_CLAUSE_NUM_TEAMS */
270 1, /* OMP_CLAUSE_THREAD_LIMIT */
271 0, /* OMP_CLAUSE_PROC_BIND */
272 1, /* OMP_CLAUSE_SAFELEN */
273 1, /* OMP_CLAUSE_SIMDLEN */
274 0, /* OMP_CLAUSE_FOR */
275 0, /* OMP_CLAUSE_PARALLEL */
276 0, /* OMP_CLAUSE_SECTIONS */
277 0, /* OMP_CLAUSE_TASKGROUP */
278 1, /* OMP_CLAUSE__SIMDUID_ */
281 const char * const omp_clause_code_name
[] =
326 /* Return the tree node structure used by tree code CODE. */
328 static inline enum tree_node_structure_enum
329 tree_node_structure_for_code (enum tree_code code
)
331 switch (TREE_CODE_CLASS (code
))
333 case tcc_declaration
:
338 return TS_FIELD_DECL
;
344 return TS_LABEL_DECL
;
346 return TS_RESULT_DECL
;
347 case DEBUG_EXPR_DECL
:
350 return TS_CONST_DECL
;
354 return TS_FUNCTION_DECL
;
355 case TRANSLATION_UNIT_DECL
:
356 return TS_TRANSLATION_UNIT_DECL
;
358 return TS_DECL_NON_COMMON
;
362 return TS_TYPE_NON_COMMON
;
371 default: /* tcc_constant and tcc_exceptional */
376 /* tcc_constant cases. */
377 case INTEGER_CST
: return TS_INT_CST
;
378 case REAL_CST
: return TS_REAL_CST
;
379 case FIXED_CST
: return TS_FIXED_CST
;
380 case COMPLEX_CST
: return TS_COMPLEX
;
381 case VECTOR_CST
: return TS_VECTOR
;
382 case STRING_CST
: return TS_STRING
;
383 /* tcc_exceptional cases. */
384 case ERROR_MARK
: return TS_COMMON
;
385 case IDENTIFIER_NODE
: return TS_IDENTIFIER
;
386 case TREE_LIST
: return TS_LIST
;
387 case TREE_VEC
: return TS_VEC
;
388 case SSA_NAME
: return TS_SSA_NAME
;
389 case PLACEHOLDER_EXPR
: return TS_COMMON
;
390 case STATEMENT_LIST
: return TS_STATEMENT_LIST
;
391 case BLOCK
: return TS_BLOCK
;
392 case CONSTRUCTOR
: return TS_CONSTRUCTOR
;
393 case TREE_BINFO
: return TS_BINFO
;
394 case OMP_CLAUSE
: return TS_OMP_CLAUSE
;
395 case OPTIMIZATION_NODE
: return TS_OPTIMIZATION
;
396 case TARGET_OPTION_NODE
: return TS_TARGET_OPTION
;
404 /* Initialize tree_contains_struct to describe the hierarchy of tree
408 initialize_tree_contains_struct (void)
412 for (i
= ERROR_MARK
; i
< LAST_AND_UNUSED_TREE_CODE
; i
++)
415 enum tree_node_structure_enum ts_code
;
417 code
= (enum tree_code
) i
;
418 ts_code
= tree_node_structure_for_code (code
);
420 /* Mark the TS structure itself. */
421 tree_contains_struct
[code
][ts_code
] = 1;
423 /* Mark all the structures that TS is derived from. */
441 case TS_STATEMENT_LIST
:
442 MARK_TS_TYPED (code
);
446 case TS_DECL_MINIMAL
:
452 case TS_OPTIMIZATION
:
453 case TS_TARGET_OPTION
:
454 MARK_TS_COMMON (code
);
457 case TS_TYPE_WITH_LANG_SPECIFIC
:
458 MARK_TS_TYPE_COMMON (code
);
461 case TS_TYPE_NON_COMMON
:
462 MARK_TS_TYPE_WITH_LANG_SPECIFIC (code
);
466 MARK_TS_DECL_MINIMAL (code
);
471 MARK_TS_DECL_COMMON (code
);
474 case TS_DECL_NON_COMMON
:
475 MARK_TS_DECL_WITH_VIS (code
);
478 case TS_DECL_WITH_VIS
:
482 MARK_TS_DECL_WRTL (code
);
486 MARK_TS_DECL_COMMON (code
);
490 MARK_TS_DECL_WITH_VIS (code
);
494 case TS_FUNCTION_DECL
:
495 MARK_TS_DECL_NON_COMMON (code
);
498 case TS_TRANSLATION_UNIT_DECL
:
499 MARK_TS_DECL_COMMON (code
);
507 /* Basic consistency checks for attributes used in fold. */
508 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_NON_COMMON
]);
509 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_NON_COMMON
]);
510 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_DECL_COMMON
]);
511 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_COMMON
]);
512 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_COMMON
]);
513 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_COMMON
]);
514 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_COMMON
]);
515 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_COMMON
]);
516 gcc_assert (tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_COMMON
]);
517 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_COMMON
]);
518 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_DECL_COMMON
]);
519 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_WRTL
]);
520 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_WRTL
]);
521 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_WRTL
]);
522 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WRTL
]);
523 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_WRTL
]);
524 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_DECL_MINIMAL
]);
525 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_MINIMAL
]);
526 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_MINIMAL
]);
527 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_MINIMAL
]);
528 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_MINIMAL
]);
529 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_MINIMAL
]);
530 gcc_assert (tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_MINIMAL
]);
531 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_MINIMAL
]);
532 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_DECL_MINIMAL
]);
533 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_WITH_VIS
]);
534 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WITH_VIS
]);
535 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_WITH_VIS
]);
536 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_VAR_DECL
]);
537 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_FIELD_DECL
]);
538 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_PARM_DECL
]);
539 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_LABEL_DECL
]);
540 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_RESULT_DECL
]);
541 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_CONST_DECL
]);
542 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_TYPE_DECL
]);
543 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_FUNCTION_DECL
]);
544 gcc_assert (tree_contains_struct
[IMPORTED_DECL
][TS_DECL_MINIMAL
]);
545 gcc_assert (tree_contains_struct
[IMPORTED_DECL
][TS_DECL_COMMON
]);
554 /* Initialize the hash table of types. */
555 type_hash_table
= htab_create_ggc (TYPE_HASH_INITIAL_SIZE
, type_hash_hash
,
558 debug_expr_for_decl
= htab_create_ggc (512, tree_decl_map_hash
,
559 tree_decl_map_eq
, 0);
561 value_expr_for_decl
= htab_create_ggc (512, tree_decl_map_hash
,
562 tree_decl_map_eq
, 0);
563 init_priority_for_decl
= htab_create_ggc (512, tree_priority_map_hash
,
564 tree_priority_map_eq
, 0);
566 int_cst_hash_table
= htab_create_ggc (1024, int_cst_hash_hash
,
567 int_cst_hash_eq
, NULL
);
569 int_cst_node
= make_int_cst (1, 1);
571 cl_option_hash_table
= htab_create_ggc (64, cl_option_hash_hash
,
572 cl_option_hash_eq
, NULL
);
574 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
575 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
577 /* Initialize the tree_contains_struct array. */
578 initialize_tree_contains_struct ();
579 lang_hooks
.init_ts ();
583 /* The name of the object as the assembler will see it (but before any
584 translations made by ASM_OUTPUT_LABELREF). Often this is the same
585 as DECL_NAME. It is an IDENTIFIER_NODE. */
587 decl_assembler_name (tree decl
)
589 if (!DECL_ASSEMBLER_NAME_SET_P (decl
))
590 lang_hooks
.set_decl_assembler_name (decl
);
591 return DECL_WITH_VIS_CHECK (decl
)->decl_with_vis
.assembler_name
;
594 /* Compute the number of bytes occupied by a tree with code CODE.
595 This function cannot be used for nodes that have variable sizes,
596 including TREE_VEC, INTEGER_CST, STRING_CST, and CALL_EXPR. */
598 tree_code_size (enum tree_code code
)
600 switch (TREE_CODE_CLASS (code
))
602 case tcc_declaration
: /* A decl node */
607 return sizeof (struct tree_field_decl
);
609 return sizeof (struct tree_parm_decl
);
611 return sizeof (struct tree_var_decl
);
613 return sizeof (struct tree_label_decl
);
615 return sizeof (struct tree_result_decl
);
617 return sizeof (struct tree_const_decl
);
619 return sizeof (struct tree_type_decl
);
621 return sizeof (struct tree_function_decl
);
622 case DEBUG_EXPR_DECL
:
623 return sizeof (struct tree_decl_with_rtl
);
625 return sizeof (struct tree_decl_non_common
);
629 case tcc_type
: /* a type node */
630 return sizeof (struct tree_type_non_common
);
632 case tcc_reference
: /* a reference */
633 case tcc_expression
: /* an expression */
634 case tcc_statement
: /* an expression with side effects */
635 case tcc_comparison
: /* a comparison expression */
636 case tcc_unary
: /* a unary arithmetic expression */
637 case tcc_binary
: /* a binary arithmetic expression */
638 return (sizeof (struct tree_exp
)
639 + (TREE_CODE_LENGTH (code
) - 1) * sizeof (tree
));
641 case tcc_constant
: /* a constant */
644 case INTEGER_CST
: gcc_unreachable ();
645 case REAL_CST
: return sizeof (struct tree_real_cst
);
646 case FIXED_CST
: return sizeof (struct tree_fixed_cst
);
647 case COMPLEX_CST
: return sizeof (struct tree_complex
);
648 case VECTOR_CST
: return sizeof (struct tree_vector
);
649 case STRING_CST
: gcc_unreachable ();
651 return lang_hooks
.tree_size (code
);
654 case tcc_exceptional
: /* something random, like an identifier. */
657 case IDENTIFIER_NODE
: return lang_hooks
.identifier_size
;
658 case TREE_LIST
: return sizeof (struct tree_list
);
661 case PLACEHOLDER_EXPR
: return sizeof (struct tree_common
);
664 case OMP_CLAUSE
: gcc_unreachable ();
666 case SSA_NAME
: return sizeof (struct tree_ssa_name
);
668 case STATEMENT_LIST
: return sizeof (struct tree_statement_list
);
669 case BLOCK
: return sizeof (struct tree_block
);
670 case CONSTRUCTOR
: return sizeof (struct tree_constructor
);
671 case OPTIMIZATION_NODE
: return sizeof (struct tree_optimization_option
);
672 case TARGET_OPTION_NODE
: return sizeof (struct tree_target_option
);
675 return lang_hooks
.tree_size (code
);
683 /* Compute the number of bytes occupied by NODE. This routine only
684 looks at TREE_CODE, except for those nodes that have variable sizes. */
686 tree_size (const_tree node
)
688 const enum tree_code code
= TREE_CODE (node
);
692 return (sizeof (struct tree_int_cst
)
693 + (TREE_INT_CST_EXT_NUNITS (node
) - 1) * sizeof (HOST_WIDE_INT
));
696 return (offsetof (struct tree_binfo
, base_binfos
)
698 ::embedded_size (BINFO_N_BASE_BINFOS (node
)));
701 return (sizeof (struct tree_vec
)
702 + (TREE_VEC_LENGTH (node
) - 1) * sizeof (tree
));
705 return (sizeof (struct tree_vector
)
706 + (TYPE_VECTOR_SUBPARTS (TREE_TYPE (node
)) - 1) * sizeof (tree
));
709 return TREE_STRING_LENGTH (node
) + offsetof (struct tree_string
, str
) + 1;
712 return (sizeof (struct tree_omp_clause
)
713 + (omp_clause_num_ops
[OMP_CLAUSE_CODE (node
)] - 1)
717 if (TREE_CODE_CLASS (code
) == tcc_vl_exp
)
718 return (sizeof (struct tree_exp
)
719 + (VL_EXP_OPERAND_LENGTH (node
) - 1) * sizeof (tree
));
721 return tree_code_size (code
);
725 /* Record interesting allocation statistics for a tree node with CODE
729 record_node_allocation_statistics (enum tree_code code ATTRIBUTE_UNUSED
,
730 size_t length ATTRIBUTE_UNUSED
)
732 enum tree_code_class type
= TREE_CODE_CLASS (code
);
735 if (!GATHER_STATISTICS
)
740 case tcc_declaration
: /* A decl node */
744 case tcc_type
: /* a type node */
748 case tcc_statement
: /* an expression with side effects */
752 case tcc_reference
: /* a reference */
756 case tcc_expression
: /* an expression */
757 case tcc_comparison
: /* a comparison expression */
758 case tcc_unary
: /* a unary arithmetic expression */
759 case tcc_binary
: /* a binary arithmetic expression */
763 case tcc_constant
: /* a constant */
767 case tcc_exceptional
: /* something random, like an identifier. */
770 case IDENTIFIER_NODE
:
783 kind
= ssa_name_kind
;
795 kind
= omp_clause_kind
;
812 tree_code_counts
[(int) code
]++;
813 tree_node_counts
[(int) kind
]++;
814 tree_node_sizes
[(int) kind
] += length
;
817 /* Allocate and return a new UID from the DECL_UID namespace. */
820 allocate_decl_uid (void)
822 return next_decl_uid
++;
825 /* Return a newly allocated node of code CODE. For decl and type
826 nodes, some other fields are initialized. The rest of the node is
827 initialized to zero. This function cannot be used for TREE_VEC,
828 INTEGER_CST or OMP_CLAUSE nodes, which is enforced by asserts in
831 Achoo! I got a code in the node. */
834 make_node_stat (enum tree_code code MEM_STAT_DECL
)
837 enum tree_code_class type
= TREE_CODE_CLASS (code
);
838 size_t length
= tree_code_size (code
);
840 record_node_allocation_statistics (code
, length
);
842 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
843 TREE_SET_CODE (t
, code
);
848 TREE_SIDE_EFFECTS (t
) = 1;
851 case tcc_declaration
:
852 if (CODE_CONTAINS_STRUCT (code
, TS_DECL_COMMON
))
854 if (code
== FUNCTION_DECL
)
856 DECL_ALIGN (t
) = FUNCTION_BOUNDARY
;
857 DECL_MODE (t
) = FUNCTION_MODE
;
862 DECL_SOURCE_LOCATION (t
) = input_location
;
863 if (TREE_CODE (t
) == DEBUG_EXPR_DECL
)
864 DECL_UID (t
) = --next_debug_decl_uid
;
867 DECL_UID (t
) = allocate_decl_uid ();
868 SET_DECL_PT_UID (t
, -1);
870 if (TREE_CODE (t
) == LABEL_DECL
)
871 LABEL_DECL_UID (t
) = -1;
876 TYPE_UID (t
) = next_type_uid
++;
877 TYPE_ALIGN (t
) = BITS_PER_UNIT
;
878 TYPE_USER_ALIGN (t
) = 0;
879 TYPE_MAIN_VARIANT (t
) = t
;
880 TYPE_CANONICAL (t
) = t
;
882 /* Default to no attributes for type, but let target change that. */
883 TYPE_ATTRIBUTES (t
) = NULL_TREE
;
884 targetm
.set_default_type_attributes (t
);
886 /* We have not yet computed the alias set for this type. */
887 TYPE_ALIAS_SET (t
) = -1;
891 TREE_CONSTANT (t
) = 1;
900 case PREDECREMENT_EXPR
:
901 case PREINCREMENT_EXPR
:
902 case POSTDECREMENT_EXPR
:
903 case POSTINCREMENT_EXPR
:
904 /* All of these have side-effects, no matter what their
906 TREE_SIDE_EFFECTS (t
) = 1;
915 /* Other classes need no special treatment. */
922 /* Return a new node with the same contents as NODE except that its
923 TREE_CHAIN, if it has one, is zero and it has a fresh uid. */
926 copy_node_stat (tree node MEM_STAT_DECL
)
929 enum tree_code code
= TREE_CODE (node
);
932 gcc_assert (code
!= STATEMENT_LIST
);
934 length
= tree_size (node
);
935 record_node_allocation_statistics (code
, length
);
936 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
937 memcpy (t
, node
, length
);
939 if (CODE_CONTAINS_STRUCT (code
, TS_COMMON
))
941 TREE_ASM_WRITTEN (t
) = 0;
942 TREE_VISITED (t
) = 0;
944 if (TREE_CODE_CLASS (code
) == tcc_declaration
)
946 if (code
== DEBUG_EXPR_DECL
)
947 DECL_UID (t
) = --next_debug_decl_uid
;
950 DECL_UID (t
) = allocate_decl_uid ();
951 if (DECL_PT_UID_SET_P (node
))
952 SET_DECL_PT_UID (t
, DECL_PT_UID (node
));
954 if ((TREE_CODE (node
) == PARM_DECL
|| TREE_CODE (node
) == VAR_DECL
)
955 && DECL_HAS_VALUE_EXPR_P (node
))
957 SET_DECL_VALUE_EXPR (t
, DECL_VALUE_EXPR (node
));
958 DECL_HAS_VALUE_EXPR_P (t
) = 1;
960 /* DECL_DEBUG_EXPR is copied explicitely by callers. */
961 if (TREE_CODE (node
) == VAR_DECL
)
962 DECL_HAS_DEBUG_EXPR_P (t
) = 0;
963 if (TREE_CODE (node
) == VAR_DECL
&& DECL_HAS_INIT_PRIORITY_P (node
))
965 SET_DECL_INIT_PRIORITY (t
, DECL_INIT_PRIORITY (node
));
966 DECL_HAS_INIT_PRIORITY_P (t
) = 1;
968 if (TREE_CODE (node
) == FUNCTION_DECL
)
969 DECL_STRUCT_FUNCTION (t
) = NULL
;
971 else if (TREE_CODE_CLASS (code
) == tcc_type
)
973 TYPE_UID (t
) = next_type_uid
++;
974 /* The following is so that the debug code for
975 the copy is different from the original type.
976 The two statements usually duplicate each other
977 (because they clear fields of the same union),
978 but the optimizer should catch that. */
979 TYPE_SYMTAB_POINTER (t
) = 0;
980 TYPE_SYMTAB_ADDRESS (t
) = 0;
982 /* Do not copy the values cache. */
983 if (TYPE_CACHED_VALUES_P (t
))
985 TYPE_CACHED_VALUES_P (t
) = 0;
986 TYPE_CACHED_VALUES (t
) = NULL_TREE
;
993 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
994 For example, this can copy a list made of TREE_LIST nodes. */
997 copy_list (tree list
)
1005 head
= prev
= copy_node (list
);
1006 next
= TREE_CHAIN (list
);
1009 TREE_CHAIN (prev
) = copy_node (next
);
1010 prev
= TREE_CHAIN (prev
);
1011 next
= TREE_CHAIN (next
);
1017 /* Return the value that TREE_INT_CST_EXT_NUNITS should have for an
1018 INTEGER_CST with value CST and type TYPE. */
1021 get_int_cst_ext_nunits (tree type
, const wide_int
&cst
)
1023 gcc_checking_assert (cst
.get_precision () == TYPE_PRECISION (type
));
1024 /* We need an extra zero HWI if CST is an unsigned integer with its
1025 upper bit set, and if CST occupies a whole number of HWIs. */
1026 if (TYPE_UNSIGNED (type
)
1028 && (cst
.get_precision () % HOST_BITS_PER_WIDE_INT
) == 0)
1029 return cst
.get_precision () / HOST_BITS_PER_WIDE_INT
+ 1;
1030 return cst
.get_len ();
1033 /* Return a new INTEGER_CST with value CST and type TYPE. */
1036 build_new_int_cst (tree type
, const wide_int
&cst
)
1038 unsigned int len
= cst
.get_len ();
1039 unsigned int ext_len
= get_int_cst_ext_nunits (type
, cst
);
1040 tree nt
= make_int_cst (len
, ext_len
);
1045 TREE_INT_CST_ELT (nt
, ext_len
) = 0;
1046 for (unsigned int i
= len
; i
< ext_len
; ++i
)
1047 TREE_INT_CST_ELT (nt
, i
) = -1;
1049 else if (TYPE_UNSIGNED (type
)
1050 && cst
.get_precision () < len
* HOST_BITS_PER_WIDE_INT
)
1053 TREE_INT_CST_ELT (nt
, len
)
1054 = zext_hwi (cst
.elt (len
),
1055 cst
.get_precision () % HOST_BITS_PER_WIDE_INT
);
1058 for (unsigned int i
= 0; i
< len
; i
++)
1059 TREE_INT_CST_ELT (nt
, i
) = cst
.elt (i
);
1060 TREE_TYPE (nt
) = type
;
1064 /* Create an INT_CST node with a LOW value sign extended to TYPE. */
1067 build_int_cst (tree type
, HOST_WIDE_INT low
)
1069 /* Support legacy code. */
1071 type
= integer_type_node
;
1073 return wide_int_to_tree (type
, wi::shwi (low
, TYPE_PRECISION (type
)));
1077 build_int_cstu (tree type
, unsigned HOST_WIDE_INT cst
)
1079 return wide_int_to_tree (type
, wi::uhwi (cst
, TYPE_PRECISION (type
)));
1082 /* Create an INT_CST node with a LOW value sign extended to TYPE. */
1085 build_int_cst_type (tree type
, HOST_WIDE_INT low
)
1088 return wide_int_to_tree (type
, wi::shwi (low
, TYPE_PRECISION (type
)));
1091 /* Constructs tree in type TYPE from with value given by CST. Signedness
1092 of CST is assumed to be the same as the signedness of TYPE. */
1095 double_int_to_tree (tree type
, double_int cst
)
1097 return wide_int_to_tree (type
, widest_int::from (cst
, TYPE_SIGN (type
)));
1100 /* We force the wide_int CST to the range of the type TYPE by sign or
1101 zero extending it. OVERFLOWABLE indicates if we are interested in
1102 overflow of the value, when >0 we are only interested in signed
1103 overflow, for <0 we are interested in any overflow. OVERFLOWED
1104 indicates whether overflow has already occurred. CONST_OVERFLOWED
1105 indicates whether constant overflow has already occurred. We force
1106 T's value to be within range of T's type (by setting to 0 or 1 all
1107 the bits outside the type's range). We set TREE_OVERFLOWED if,
1108 OVERFLOWED is nonzero,
1109 or OVERFLOWABLE is >0 and signed overflow occurs
1110 or OVERFLOWABLE is <0 and any overflow occurs
1111 We return a new tree node for the extended wide_int. The node
1112 is shared if no overflow flags are set. */
1116 force_fit_type (tree type
, const wide_int_ref
&cst
,
1117 int overflowable
, bool overflowed
)
1119 signop sign
= TYPE_SIGN (type
);
1121 /* If we need to set overflow flags, return a new unshared node. */
1122 if (overflowed
|| !wi::fits_to_tree_p (cst
, type
))
1126 || (overflowable
> 0 && sign
== SIGNED
))
1128 wide_int tmp
= wide_int::from (cst
, TYPE_PRECISION (type
), sign
);
1129 tree t
= build_new_int_cst (type
, tmp
);
1130 TREE_OVERFLOW (t
) = 1;
1135 /* Else build a shared node. */
1136 return wide_int_to_tree (type
, cst
);
1139 /* These are the hash table functions for the hash table of INTEGER_CST
1140 nodes of a sizetype. */
1142 /* Return the hash code code X, an INTEGER_CST. */
1145 int_cst_hash_hash (const void *x
)
1147 const_tree
const t
= (const_tree
) x
;
1148 hashval_t code
= htab_hash_pointer (TREE_TYPE (t
));
1151 for (i
= 0; i
< TREE_INT_CST_NUNITS (t
); i
++)
1152 code
^= TREE_INT_CST_ELT (t
, i
);
1157 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
1158 is the same as that given by *Y, which is the same. */
1161 int_cst_hash_eq (const void *x
, const void *y
)
1163 const_tree
const xt
= (const_tree
) x
;
1164 const_tree
const yt
= (const_tree
) y
;
1166 if (TREE_TYPE (xt
) != TREE_TYPE (yt
)
1167 || TREE_INT_CST_NUNITS (xt
) != TREE_INT_CST_NUNITS (yt
)
1168 || TREE_INT_CST_EXT_NUNITS (xt
) != TREE_INT_CST_EXT_NUNITS (yt
))
1171 for (int i
= 0; i
< TREE_INT_CST_NUNITS (xt
); i
++)
1172 if (TREE_INT_CST_ELT (xt
, i
) != TREE_INT_CST_ELT (yt
, i
))
1178 /* Create an INT_CST node of TYPE and value CST.
1179 The returned node is always shared. For small integers we use a
1180 per-type vector cache, for larger ones we use a single hash table.
1181 The value is extended from it's precision according to the sign of
1182 the type to be a multiple of HOST_BITS_PER_WIDE_INT. This defines
1183 the upper bits and ensures that hashing and value equality based
1184 upon the underlying HOST_WIDE_INTs works without masking. */
1187 wide_int_to_tree (tree type
, const wide_int_ref
&pcst
)
1194 unsigned int prec
= TYPE_PRECISION (type
);
1195 signop sgn
= TYPE_SIGN (type
);
1197 /* Verify that everything is canonical. */
1198 int l
= pcst
.get_len ();
1201 if (pcst
.elt (l
- 1) == 0)
1202 gcc_assert (pcst
.elt (l
- 2) < 0);
1203 if (pcst
.elt (l
- 1) == (HOST_WIDE_INT
) -1)
1204 gcc_assert (pcst
.elt (l
- 2) >= 0);
1207 wide_int cst
= wide_int::from (pcst
, prec
, sgn
);
1208 unsigned int ext_len
= get_int_cst_ext_nunits (type
, cst
);
1210 switch (TREE_CODE (type
))
1213 gcc_assert (cst
== 0);
1217 case REFERENCE_TYPE
:
1218 case POINTER_BOUNDS_TYPE
:
1219 /* Cache NULL pointer and zero bounds. */
1228 /* Cache false or true. */
1230 if (wi::leu_p (cst
, 1))
1231 ix
= cst
.to_uhwi ();
1236 if (TYPE_SIGN (type
) == UNSIGNED
)
1239 limit
= INTEGER_SHARE_LIMIT
;
1241 /* This is a little hokie, but if the prec is smaller than
1242 what is necessary to hold INTEGER_SHARE_LIMIT, then the
1243 obvious test will not get the correct answer. */
1244 if (prec
< HOST_BITS_PER_WIDE_INT
)
1246 if (cst
.to_uhwi () < (unsigned HOST_WIDE_INT
) INTEGER_SHARE_LIMIT
)
1247 ix
= cst
.to_uhwi ();
1249 else if (wi::ltu_p (cst
, INTEGER_SHARE_LIMIT
))
1250 ix
= cst
.to_uhwi ();
1255 limit
= INTEGER_SHARE_LIMIT
+ 1;
1259 else if (!wi::neg_p (cst
))
1261 if (prec
< HOST_BITS_PER_WIDE_INT
)
1263 if (cst
.to_shwi () < INTEGER_SHARE_LIMIT
)
1264 ix
= cst
.to_shwi () + 1;
1266 else if (wi::lts_p (cst
, INTEGER_SHARE_LIMIT
))
1267 ix
= cst
.to_shwi () + 1;
1281 /* We just need to store a single HOST_WIDE_INT. */
1283 if (TYPE_UNSIGNED (type
))
1284 hwi
= cst
.to_uhwi ();
1286 hwi
= cst
.to_shwi ();
1289 /* Look for it in the type's vector of small shared ints. */
1290 if (!TYPE_CACHED_VALUES_P (type
))
1292 TYPE_CACHED_VALUES_P (type
) = 1;
1293 TYPE_CACHED_VALUES (type
) = make_tree_vec (limit
);
1296 t
= TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
);
1298 /* Make sure no one is clobbering the shared constant. */
1299 gcc_assert (TREE_TYPE (t
) == type
1300 && TREE_INT_CST_NUNITS (t
) == 1
1301 && TREE_INT_CST_EXT_NUNITS (t
) == 1
1302 && TREE_INT_CST_ELT (t
, 0) == hwi
);
1305 /* Create a new shared int. */
1306 t
= build_new_int_cst (type
, cst
);
1307 TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) = t
;
1312 /* Use the cache of larger shared ints, using int_cst_node as
1316 TREE_INT_CST_ELT (int_cst_node
, 0) = hwi
;
1317 TREE_TYPE (int_cst_node
) = type
;
1319 slot
= htab_find_slot (int_cst_hash_table
, int_cst_node
, INSERT
);
1323 /* Insert this one into the hash table. */
1326 /* Make a new node for next time round. */
1327 int_cst_node
= make_int_cst (1, 1);
1333 /* The value either hashes properly or we drop it on the floor
1334 for the gc to take care of. There will not be enough of them
1338 tree nt
= build_new_int_cst (type
, cst
);
1339 slot
= htab_find_slot (int_cst_hash_table
, nt
, INSERT
);
1343 /* Insert this one into the hash table. */
1353 cache_integer_cst (tree t
)
1355 tree type
= TREE_TYPE (t
);
1358 int prec
= TYPE_PRECISION (type
);
1360 gcc_assert (!TREE_OVERFLOW (t
));
1362 switch (TREE_CODE (type
))
1365 gcc_assert (integer_zerop (t
));
1369 case REFERENCE_TYPE
:
1370 /* Cache NULL pointer. */
1371 if (integer_zerop (t
))
1379 /* Cache false or true. */
1381 if (wi::ltu_p (t
, 2))
1382 ix
= TREE_INT_CST_ELT (t
, 0);
1387 if (TYPE_UNSIGNED (type
))
1390 limit
= INTEGER_SHARE_LIMIT
;
1392 /* This is a little hokie, but if the prec is smaller than
1393 what is necessary to hold INTEGER_SHARE_LIMIT, then the
1394 obvious test will not get the correct answer. */
1395 if (prec
< HOST_BITS_PER_WIDE_INT
)
1397 if (tree_to_uhwi (t
) < (unsigned HOST_WIDE_INT
) INTEGER_SHARE_LIMIT
)
1398 ix
= tree_to_uhwi (t
);
1400 else if (wi::ltu_p (t
, INTEGER_SHARE_LIMIT
))
1401 ix
= tree_to_uhwi (t
);
1406 limit
= INTEGER_SHARE_LIMIT
+ 1;
1408 if (integer_minus_onep (t
))
1410 else if (!wi::neg_p (t
))
1412 if (prec
< HOST_BITS_PER_WIDE_INT
)
1414 if (tree_to_shwi (t
) < INTEGER_SHARE_LIMIT
)
1415 ix
= tree_to_shwi (t
) + 1;
1417 else if (wi::ltu_p (t
, INTEGER_SHARE_LIMIT
))
1418 ix
= tree_to_shwi (t
) + 1;
1432 /* Look for it in the type's vector of small shared ints. */
1433 if (!TYPE_CACHED_VALUES_P (type
))
1435 TYPE_CACHED_VALUES_P (type
) = 1;
1436 TYPE_CACHED_VALUES (type
) = make_tree_vec (limit
);
1439 gcc_assert (TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) == NULL_TREE
);
1440 TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) = t
;
1444 /* Use the cache of larger shared ints. */
1447 slot
= htab_find_slot (int_cst_hash_table
, t
, INSERT
);
1448 /* If there is already an entry for the number verify it's the
1451 gcc_assert (wi::eq_p (tree (*slot
), t
));
1453 /* Otherwise insert this one into the hash table. */
1459 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
1460 and the rest are zeros. */
1463 build_low_bits_mask (tree type
, unsigned bits
)
1465 gcc_assert (bits
<= TYPE_PRECISION (type
));
1467 return wide_int_to_tree (type
, wi::mask (bits
, false,
1468 TYPE_PRECISION (type
)));
1471 /* Build a newly constructed TREE_VEC node of length LEN. */
1474 make_vector_stat (unsigned len MEM_STAT_DECL
)
1477 unsigned length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vector
);
1479 record_node_allocation_statistics (VECTOR_CST
, length
);
1481 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
1483 TREE_SET_CODE (t
, VECTOR_CST
);
1484 TREE_CONSTANT (t
) = 1;
1489 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1490 are in a list pointed to by VALS. */
1493 build_vector_stat (tree type
, tree
*vals MEM_STAT_DECL
)
1497 tree v
= make_vector (TYPE_VECTOR_SUBPARTS (type
));
1498 TREE_TYPE (v
) = type
;
1500 /* Iterate through elements and check for overflow. */
1501 for (cnt
= 0; cnt
< TYPE_VECTOR_SUBPARTS (type
); ++cnt
)
1503 tree value
= vals
[cnt
];
1505 VECTOR_CST_ELT (v
, cnt
) = value
;
1507 /* Don't crash if we get an address constant. */
1508 if (!CONSTANT_CLASS_P (value
))
1511 over
|= TREE_OVERFLOW (value
);
1514 TREE_OVERFLOW (v
) = over
;
1518 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1519 are extracted from V, a vector of CONSTRUCTOR_ELT. */
1522 build_vector_from_ctor (tree type
, vec
<constructor_elt
, va_gc
> *v
)
1524 tree
*vec
= XALLOCAVEC (tree
, TYPE_VECTOR_SUBPARTS (type
));
1525 unsigned HOST_WIDE_INT idx
;
1528 FOR_EACH_CONSTRUCTOR_VALUE (v
, idx
, value
)
1530 for (; idx
< TYPE_VECTOR_SUBPARTS (type
); ++idx
)
1531 vec
[idx
] = build_zero_cst (TREE_TYPE (type
));
1533 return build_vector (type
, vec
);
1536 /* Build a vector of type VECTYPE where all the elements are SCs. */
1538 build_vector_from_val (tree vectype
, tree sc
)
1540 int i
, nunits
= TYPE_VECTOR_SUBPARTS (vectype
);
1542 if (sc
== error_mark_node
)
1545 /* Verify that the vector type is suitable for SC. Note that there
1546 is some inconsistency in the type-system with respect to restrict
1547 qualifications of pointers. Vector types always have a main-variant
1548 element type and the qualification is applied to the vector-type.
1549 So TREE_TYPE (vector-type) does not return a properly qualified
1550 vector element-type. */
1551 gcc_checking_assert (types_compatible_p (TYPE_MAIN_VARIANT (TREE_TYPE (sc
)),
1552 TREE_TYPE (vectype
)));
1554 if (CONSTANT_CLASS_P (sc
))
1556 tree
*v
= XALLOCAVEC (tree
, nunits
);
1557 for (i
= 0; i
< nunits
; ++i
)
1559 return build_vector (vectype
, v
);
1563 vec
<constructor_elt
, va_gc
> *v
;
1564 vec_alloc (v
, nunits
);
1565 for (i
= 0; i
< nunits
; ++i
)
1566 CONSTRUCTOR_APPEND_ELT (v
, NULL_TREE
, sc
);
1567 return build_constructor (vectype
, v
);
1571 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1572 are in the vec pointed to by VALS. */
1574 build_constructor (tree type
, vec
<constructor_elt
, va_gc
> *vals
)
1576 tree c
= make_node (CONSTRUCTOR
);
1578 constructor_elt
*elt
;
1579 bool constant_p
= true;
1580 bool side_effects_p
= false;
1582 TREE_TYPE (c
) = type
;
1583 CONSTRUCTOR_ELTS (c
) = vals
;
1585 FOR_EACH_VEC_SAFE_ELT (vals
, i
, elt
)
1587 /* Mostly ctors will have elts that don't have side-effects, so
1588 the usual case is to scan all the elements. Hence a single
1589 loop for both const and side effects, rather than one loop
1590 each (with early outs). */
1591 if (!TREE_CONSTANT (elt
->value
))
1593 if (TREE_SIDE_EFFECTS (elt
->value
))
1594 side_effects_p
= true;
1597 TREE_SIDE_EFFECTS (c
) = side_effects_p
;
1598 TREE_CONSTANT (c
) = constant_p
;
1603 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
1606 build_constructor_single (tree type
, tree index
, tree value
)
1608 vec
<constructor_elt
, va_gc
> *v
;
1609 constructor_elt elt
= {index
, value
};
1612 v
->quick_push (elt
);
1614 return build_constructor (type
, v
);
1618 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1619 are in a list pointed to by VALS. */
1621 build_constructor_from_list (tree type
, tree vals
)
1624 vec
<constructor_elt
, va_gc
> *v
= NULL
;
1628 vec_alloc (v
, list_length (vals
));
1629 for (t
= vals
; t
; t
= TREE_CHAIN (t
))
1630 CONSTRUCTOR_APPEND_ELT (v
, TREE_PURPOSE (t
), TREE_VALUE (t
));
1633 return build_constructor (type
, v
);
1636 /* Return a new CONSTRUCTOR node whose type is TYPE. NELTS is the number
1637 of elements, provided as index/value pairs. */
1640 build_constructor_va (tree type
, int nelts
, ...)
1642 vec
<constructor_elt
, va_gc
> *v
= NULL
;
1645 va_start (p
, nelts
);
1646 vec_alloc (v
, nelts
);
1649 tree index
= va_arg (p
, tree
);
1650 tree value
= va_arg (p
, tree
);
1651 CONSTRUCTOR_APPEND_ELT (v
, index
, value
);
1654 return build_constructor (type
, v
);
1657 /* Return a new FIXED_CST node whose type is TYPE and value is F. */
1660 build_fixed (tree type
, FIXED_VALUE_TYPE f
)
1663 FIXED_VALUE_TYPE
*fp
;
1665 v
= make_node (FIXED_CST
);
1666 fp
= ggc_alloc_fixed_value ();
1667 memcpy (fp
, &f
, sizeof (FIXED_VALUE_TYPE
));
1669 TREE_TYPE (v
) = type
;
1670 TREE_FIXED_CST_PTR (v
) = fp
;
1674 /* Return a new REAL_CST node whose type is TYPE and value is D. */
1677 build_real (tree type
, REAL_VALUE_TYPE d
)
1680 REAL_VALUE_TYPE
*dp
;
1683 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
1684 Consider doing it via real_convert now. */
1686 v
= make_node (REAL_CST
);
1687 dp
= ggc_alloc_real_value ();
1688 memcpy (dp
, &d
, sizeof (REAL_VALUE_TYPE
));
1690 TREE_TYPE (v
) = type
;
1691 TREE_REAL_CST_PTR (v
) = dp
;
1692 TREE_OVERFLOW (v
) = overflow
;
1696 /* Return a new REAL_CST node whose type is TYPE
1697 and whose value is the integer value of the INTEGER_CST node I. */
1700 real_value_from_int_cst (const_tree type
, const_tree i
)
1704 /* Clear all bits of the real value type so that we can later do
1705 bitwise comparisons to see if two values are the same. */
1706 memset (&d
, 0, sizeof d
);
1708 real_from_integer (&d
, type
? TYPE_MODE (type
) : VOIDmode
,
1709 wide_int (i
), TYPE_SIGN (TREE_TYPE (i
)));
1713 /* Given a tree representing an integer constant I, return a tree
1714 representing the same value as a floating-point constant of type TYPE. */
1717 build_real_from_int_cst (tree type
, const_tree i
)
1720 int overflow
= TREE_OVERFLOW (i
);
1722 v
= build_real (type
, real_value_from_int_cst (type
, i
));
1724 TREE_OVERFLOW (v
) |= overflow
;
1728 /* Return a newly constructed STRING_CST node whose value is
1729 the LEN characters at STR.
1730 Note that for a C string literal, LEN should include the trailing NUL.
1731 The TREE_TYPE is not initialized. */
1734 build_string (int len
, const char *str
)
1739 /* Do not waste bytes provided by padding of struct tree_string. */
1740 length
= len
+ offsetof (struct tree_string
, str
) + 1;
1742 record_node_allocation_statistics (STRING_CST
, length
);
1744 s
= ggc_alloc_tree_node (length
);
1746 memset (s
, 0, sizeof (struct tree_typed
));
1747 TREE_SET_CODE (s
, STRING_CST
);
1748 TREE_CONSTANT (s
) = 1;
1749 TREE_STRING_LENGTH (s
) = len
;
1750 memcpy (s
->string
.str
, str
, len
);
1751 s
->string
.str
[len
] = '\0';
1756 /* Return a newly constructed COMPLEX_CST node whose value is
1757 specified by the real and imaginary parts REAL and IMAG.
1758 Both REAL and IMAG should be constant nodes. TYPE, if specified,
1759 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
1762 build_complex (tree type
, tree real
, tree imag
)
1764 tree t
= make_node (COMPLEX_CST
);
1766 TREE_REALPART (t
) = real
;
1767 TREE_IMAGPART (t
) = imag
;
1768 TREE_TYPE (t
) = type
? type
: build_complex_type (TREE_TYPE (real
));
1769 TREE_OVERFLOW (t
) = TREE_OVERFLOW (real
) | TREE_OVERFLOW (imag
);
1773 /* Return a constant of arithmetic type TYPE which is the
1774 multiplicative identity of the set TYPE. */
1777 build_one_cst (tree type
)
1779 switch (TREE_CODE (type
))
1781 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
1782 case POINTER_TYPE
: case REFERENCE_TYPE
:
1784 return build_int_cst (type
, 1);
1787 return build_real (type
, dconst1
);
1789 case FIXED_POINT_TYPE
:
1790 /* We can only generate 1 for accum types. */
1791 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type
)));
1792 return build_fixed (type
, FCONST1 (TYPE_MODE (type
)));
1796 tree scalar
= build_one_cst (TREE_TYPE (type
));
1798 return build_vector_from_val (type
, scalar
);
1802 return build_complex (type
,
1803 build_one_cst (TREE_TYPE (type
)),
1804 build_zero_cst (TREE_TYPE (type
)));
1811 /* Return an integer of type TYPE containing all 1's in as much precision as
1812 it contains, or a complex or vector whose subparts are such integers. */
1815 build_all_ones_cst (tree type
)
1817 if (TREE_CODE (type
) == COMPLEX_TYPE
)
1819 tree scalar
= build_all_ones_cst (TREE_TYPE (type
));
1820 return build_complex (type
, scalar
, scalar
);
1823 return build_minus_one_cst (type
);
1826 /* Return a constant of arithmetic type TYPE which is the
1827 opposite of the multiplicative identity of the set TYPE. */
1830 build_minus_one_cst (tree type
)
1832 switch (TREE_CODE (type
))
1834 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
1835 case POINTER_TYPE
: case REFERENCE_TYPE
:
1837 return build_int_cst (type
, -1);
1840 return build_real (type
, dconstm1
);
1842 case FIXED_POINT_TYPE
:
1843 /* We can only generate 1 for accum types. */
1844 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type
)));
1845 return build_fixed (type
, fixed_from_double_int (double_int_minus_one
,
1850 tree scalar
= build_minus_one_cst (TREE_TYPE (type
));
1852 return build_vector_from_val (type
, scalar
);
1856 return build_complex (type
,
1857 build_minus_one_cst (TREE_TYPE (type
)),
1858 build_zero_cst (TREE_TYPE (type
)));
1865 /* Build 0 constant of type TYPE. This is used by constructor folding
1866 and thus the constant should be represented in memory by
1870 build_zero_cst (tree type
)
1872 switch (TREE_CODE (type
))
1874 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
1875 case POINTER_TYPE
: case REFERENCE_TYPE
:
1876 case OFFSET_TYPE
: case NULLPTR_TYPE
:
1877 return build_int_cst (type
, 0);
1880 return build_real (type
, dconst0
);
1882 case FIXED_POINT_TYPE
:
1883 return build_fixed (type
, FCONST0 (TYPE_MODE (type
)));
1887 tree scalar
= build_zero_cst (TREE_TYPE (type
));
1889 return build_vector_from_val (type
, scalar
);
1894 tree zero
= build_zero_cst (TREE_TYPE (type
));
1896 return build_complex (type
, zero
, zero
);
1900 if (!AGGREGATE_TYPE_P (type
))
1901 return fold_convert (type
, integer_zero_node
);
1902 return build_constructor (type
, NULL
);
1907 /* Build a BINFO with LEN language slots. */
1910 make_tree_binfo_stat (unsigned base_binfos MEM_STAT_DECL
)
1913 size_t length
= (offsetof (struct tree_binfo
, base_binfos
)
1914 + vec
<tree
, va_gc
>::embedded_size (base_binfos
));
1916 record_node_allocation_statistics (TREE_BINFO
, length
);
1918 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
1920 memset (t
, 0, offsetof (struct tree_binfo
, base_binfos
));
1922 TREE_SET_CODE (t
, TREE_BINFO
);
1924 BINFO_BASE_BINFOS (t
)->embedded_init (base_binfos
);
1929 /* Create a CASE_LABEL_EXPR tree node and return it. */
1932 build_case_label (tree low_value
, tree high_value
, tree label_decl
)
1934 tree t
= make_node (CASE_LABEL_EXPR
);
1936 TREE_TYPE (t
) = void_type_node
;
1937 SET_EXPR_LOCATION (t
, DECL_SOURCE_LOCATION (label_decl
));
1939 CASE_LOW (t
) = low_value
;
1940 CASE_HIGH (t
) = high_value
;
1941 CASE_LABEL (t
) = label_decl
;
1942 CASE_CHAIN (t
) = NULL_TREE
;
1947 /* Build a newly constructed INETEGER_CST node of length LEN. */
1950 make_int_cst_stat (int len
, int ext_len MEM_STAT_DECL
)
1953 int length
= (ext_len
- 1) * sizeof (tree
) + sizeof (struct tree_int_cst
);
1956 record_node_allocation_statistics (INTEGER_CST
, length
);
1958 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
1960 TREE_SET_CODE (t
, INTEGER_CST
);
1961 TREE_INT_CST_NUNITS (t
) = len
;
1962 TREE_INT_CST_EXT_NUNITS (t
) = ext_len
;
1964 TREE_CONSTANT (t
) = 1;
1969 /* Build a newly constructed TREE_VEC node of length LEN. */
1972 make_tree_vec_stat (int len MEM_STAT_DECL
)
1975 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
1977 record_node_allocation_statistics (TREE_VEC
, length
);
1979 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
1981 TREE_SET_CODE (t
, TREE_VEC
);
1982 TREE_VEC_LENGTH (t
) = len
;
1987 /* Grow a TREE_VEC node to new length LEN. */
1990 grow_tree_vec_stat (tree v
, int len MEM_STAT_DECL
)
1992 gcc_assert (TREE_CODE (v
) == TREE_VEC
);
1994 int oldlen
= TREE_VEC_LENGTH (v
);
1995 gcc_assert (len
> oldlen
);
1997 int oldlength
= (oldlen
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
1998 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
2000 record_node_allocation_statistics (TREE_VEC
, length
- oldlength
);
2002 v
= (tree
) ggc_realloc_stat (v
, length PASS_MEM_STAT
);
2004 TREE_VEC_LENGTH (v
) = len
;
2009 /* Return 1 if EXPR is the integer constant zero or a complex constant
2013 integer_zerop (const_tree expr
)
2017 switch (TREE_CODE (expr
))
2020 return wi::eq_p (expr
, 0);
2022 return (integer_zerop (TREE_REALPART (expr
))
2023 && integer_zerop (TREE_IMAGPART (expr
)));
2027 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2028 if (!integer_zerop (VECTOR_CST_ELT (expr
, i
)))
2037 /* Return 1 if EXPR is the integer constant one or the corresponding
2038 complex constant. */
2041 integer_onep (const_tree expr
)
2045 switch (TREE_CODE (expr
))
2048 return wi::eq_p (wi::to_widest (expr
), 1);
2050 return (integer_onep (TREE_REALPART (expr
))
2051 && integer_zerop (TREE_IMAGPART (expr
)));
2055 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2056 if (!integer_onep (VECTOR_CST_ELT (expr
, i
)))
2065 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
2066 it contains, or a complex or vector whose subparts are such integers. */
2069 integer_all_onesp (const_tree expr
)
2073 if (TREE_CODE (expr
) == COMPLEX_CST
2074 && integer_all_onesp (TREE_REALPART (expr
))
2075 && integer_all_onesp (TREE_IMAGPART (expr
)))
2078 else if (TREE_CODE (expr
) == VECTOR_CST
)
2081 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2082 if (!integer_all_onesp (VECTOR_CST_ELT (expr
, i
)))
2087 else if (TREE_CODE (expr
) != INTEGER_CST
)
2090 return wi::max_value (TYPE_PRECISION (TREE_TYPE (expr
)), UNSIGNED
) == expr
;
2093 /* Return 1 if EXPR is the integer constant minus one. */
2096 integer_minus_onep (const_tree expr
)
2100 if (TREE_CODE (expr
) == COMPLEX_CST
)
2101 return (integer_all_onesp (TREE_REALPART (expr
))
2102 && integer_zerop (TREE_IMAGPART (expr
)));
2104 return integer_all_onesp (expr
);
2107 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
2111 integer_pow2p (const_tree expr
)
2115 if (TREE_CODE (expr
) == COMPLEX_CST
2116 && integer_pow2p (TREE_REALPART (expr
))
2117 && integer_zerop (TREE_IMAGPART (expr
)))
2120 if (TREE_CODE (expr
) != INTEGER_CST
)
2123 return wi::popcount (expr
) == 1;
2126 /* Return 1 if EXPR is an integer constant other than zero or a
2127 complex constant other than zero. */
2130 integer_nonzerop (const_tree expr
)
2134 return ((TREE_CODE (expr
) == INTEGER_CST
2135 && !wi::eq_p (expr
, 0))
2136 || (TREE_CODE (expr
) == COMPLEX_CST
2137 && (integer_nonzerop (TREE_REALPART (expr
))
2138 || integer_nonzerop (TREE_IMAGPART (expr
)))));
2141 /* Return 1 if EXPR is the fixed-point constant zero. */
2144 fixed_zerop (const_tree expr
)
2146 return (TREE_CODE (expr
) == FIXED_CST
2147 && TREE_FIXED_CST (expr
).data
.is_zero ());
2150 /* Return the power of two represented by a tree node known to be a
2154 tree_log2 (const_tree expr
)
2158 if (TREE_CODE (expr
) == COMPLEX_CST
)
2159 return tree_log2 (TREE_REALPART (expr
));
2161 return wi::exact_log2 (expr
);
2164 /* Similar, but return the largest integer Y such that 2 ** Y is less
2165 than or equal to EXPR. */
2168 tree_floor_log2 (const_tree expr
)
2172 if (TREE_CODE (expr
) == COMPLEX_CST
)
2173 return tree_log2 (TREE_REALPART (expr
));
2175 return wi::floor_log2 (expr
);
2178 /* Return number of known trailing zero bits in EXPR, or, if the value of
2179 EXPR is known to be zero, the precision of it's type. */
2182 tree_ctz (const_tree expr
)
2184 if (!INTEGRAL_TYPE_P (TREE_TYPE (expr
))
2185 && !POINTER_TYPE_P (TREE_TYPE (expr
)))
2188 unsigned int ret1
, ret2
, prec
= TYPE_PRECISION (TREE_TYPE (expr
));
2189 switch (TREE_CODE (expr
))
2192 ret1
= wi::ctz (expr
);
2193 return MIN (ret1
, prec
);
2195 ret1
= wi::ctz (get_nonzero_bits (expr
));
2196 return MIN (ret1
, prec
);
2203 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2206 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2207 return MIN (ret1
, ret2
);
2208 case POINTER_PLUS_EXPR
:
2209 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2210 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2211 /* Second operand is sizetype, which could be in theory
2212 wider than pointer's precision. Make sure we never
2213 return more than prec. */
2214 ret2
= MIN (ret2
, prec
);
2215 return MIN (ret1
, ret2
);
2217 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2218 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2219 return MAX (ret1
, ret2
);
2221 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2222 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2223 return MIN (ret1
+ ret2
, prec
);
2225 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2226 if (tree_fits_uhwi_p (TREE_OPERAND (expr
, 1))
2227 && ((unsigned HOST_WIDE_INT
) tree_to_uhwi (TREE_OPERAND (expr
, 1))
2228 < (unsigned HOST_WIDE_INT
) prec
))
2230 ret2
= tree_to_uhwi (TREE_OPERAND (expr
, 1));
2231 return MIN (ret1
+ ret2
, prec
);
2235 if (tree_fits_uhwi_p (TREE_OPERAND (expr
, 1))
2236 && ((unsigned HOST_WIDE_INT
) tree_to_uhwi (TREE_OPERAND (expr
, 1))
2237 < (unsigned HOST_WIDE_INT
) prec
))
2239 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2240 ret2
= tree_to_uhwi (TREE_OPERAND (expr
, 1));
2245 case TRUNC_DIV_EXPR
:
2247 case FLOOR_DIV_EXPR
:
2248 case ROUND_DIV_EXPR
:
2249 case EXACT_DIV_EXPR
:
2250 if (TREE_CODE (TREE_OPERAND (expr
, 1)) == INTEGER_CST
2251 && tree_int_cst_sgn (TREE_OPERAND (expr
, 1)) == 1)
2253 int l
= tree_log2 (TREE_OPERAND (expr
, 1));
2256 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2264 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2265 if (ret1
&& ret1
== TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (expr
, 0))))
2267 return MIN (ret1
, prec
);
2269 return tree_ctz (TREE_OPERAND (expr
, 0));
2271 ret1
= tree_ctz (TREE_OPERAND (expr
, 1));
2274 ret2
= tree_ctz (TREE_OPERAND (expr
, 2));
2275 return MIN (ret1
, ret2
);
2277 return tree_ctz (TREE_OPERAND (expr
, 1));
2279 ret1
= get_pointer_alignment (CONST_CAST_TREE (expr
));
2280 if (ret1
> BITS_PER_UNIT
)
2282 ret1
= ctz_hwi (ret1
/ BITS_PER_UNIT
);
2283 return MIN (ret1
, prec
);
2291 /* Return 1 if EXPR is the real constant zero. Trailing zeroes matter for
2292 decimal float constants, so don't return 1 for them. */
2295 real_zerop (const_tree expr
)
2299 switch (TREE_CODE (expr
))
2302 return REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst0
)
2303 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2305 return real_zerop (TREE_REALPART (expr
))
2306 && real_zerop (TREE_IMAGPART (expr
));
2310 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2311 if (!real_zerop (VECTOR_CST_ELT (expr
, i
)))
2320 /* Return 1 if EXPR is the real constant one in real or complex form.
2321 Trailing zeroes matter for decimal float constants, so don't return
2325 real_onep (const_tree expr
)
2329 switch (TREE_CODE (expr
))
2332 return REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst1
)
2333 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2335 return real_onep (TREE_REALPART (expr
))
2336 && real_zerop (TREE_IMAGPART (expr
));
2340 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2341 if (!real_onep (VECTOR_CST_ELT (expr
, i
)))
2350 /* Return 1 if EXPR is the real constant minus one. Trailing zeroes
2351 matter for decimal float constants, so don't return 1 for them. */
2354 real_minus_onep (const_tree expr
)
2358 switch (TREE_CODE (expr
))
2361 return REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconstm1
)
2362 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2364 return real_minus_onep (TREE_REALPART (expr
))
2365 && real_zerop (TREE_IMAGPART (expr
));
2369 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2370 if (!real_minus_onep (VECTOR_CST_ELT (expr
, i
)))
2379 /* Nonzero if EXP is a constant or a cast of a constant. */
2382 really_constant_p (const_tree exp
)
2384 /* This is not quite the same as STRIP_NOPS. It does more. */
2385 while (CONVERT_EXPR_P (exp
)
2386 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
2387 exp
= TREE_OPERAND (exp
, 0);
2388 return TREE_CONSTANT (exp
);
2391 /* Return first list element whose TREE_VALUE is ELEM.
2392 Return 0 if ELEM is not in LIST. */
2395 value_member (tree elem
, tree list
)
2399 if (elem
== TREE_VALUE (list
))
2401 list
= TREE_CHAIN (list
);
2406 /* Return first list element whose TREE_PURPOSE is ELEM.
2407 Return 0 if ELEM is not in LIST. */
2410 purpose_member (const_tree elem
, tree list
)
2414 if (elem
== TREE_PURPOSE (list
))
2416 list
= TREE_CHAIN (list
);
2421 /* Return true if ELEM is in V. */
2424 vec_member (const_tree elem
, vec
<tree
, va_gc
> *v
)
2428 FOR_EACH_VEC_SAFE_ELT (v
, ix
, t
)
2434 /* Returns element number IDX (zero-origin) of chain CHAIN, or
2438 chain_index (int idx
, tree chain
)
2440 for (; chain
&& idx
> 0; --idx
)
2441 chain
= TREE_CHAIN (chain
);
2445 /* Return nonzero if ELEM is part of the chain CHAIN. */
2448 chain_member (const_tree elem
, const_tree chain
)
2454 chain
= DECL_CHAIN (chain
);
2460 /* Return the length of a chain of nodes chained through TREE_CHAIN.
2461 We expect a null pointer to mark the end of the chain.
2462 This is the Lisp primitive `length'. */
2465 list_length (const_tree t
)
2468 #ifdef ENABLE_TREE_CHECKING
2476 #ifdef ENABLE_TREE_CHECKING
2479 gcc_assert (p
!= q
);
2487 /* Returns the first FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
2488 UNION_TYPE TYPE, or NULL_TREE if none. */
2491 first_field (const_tree type
)
2493 tree t
= TYPE_FIELDS (type
);
2494 while (t
&& TREE_CODE (t
) != FIELD_DECL
)
2499 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
2500 by modifying the last node in chain 1 to point to chain 2.
2501 This is the Lisp primitive `nconc'. */
2504 chainon (tree op1
, tree op2
)
2513 for (t1
= op1
; TREE_CHAIN (t1
); t1
= TREE_CHAIN (t1
))
2515 TREE_CHAIN (t1
) = op2
;
2517 #ifdef ENABLE_TREE_CHECKING
2520 for (t2
= op2
; t2
; t2
= TREE_CHAIN (t2
))
2521 gcc_assert (t2
!= t1
);
2528 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
2531 tree_last (tree chain
)
2535 while ((next
= TREE_CHAIN (chain
)))
2540 /* Reverse the order of elements in the chain T,
2541 and return the new head of the chain (old last element). */
2546 tree prev
= 0, decl
, next
;
2547 for (decl
= t
; decl
; decl
= next
)
2549 /* We shouldn't be using this function to reverse BLOCK chains; we
2550 have blocks_nreverse for that. */
2551 gcc_checking_assert (TREE_CODE (decl
) != BLOCK
);
2552 next
= TREE_CHAIN (decl
);
2553 TREE_CHAIN (decl
) = prev
;
2559 /* Return a newly created TREE_LIST node whose
2560 purpose and value fields are PARM and VALUE. */
2563 build_tree_list_stat (tree parm
, tree value MEM_STAT_DECL
)
2565 tree t
= make_node_stat (TREE_LIST PASS_MEM_STAT
);
2566 TREE_PURPOSE (t
) = parm
;
2567 TREE_VALUE (t
) = value
;
2571 /* Build a chain of TREE_LIST nodes from a vector. */
2574 build_tree_list_vec_stat (const vec
<tree
, va_gc
> *vec MEM_STAT_DECL
)
2576 tree ret
= NULL_TREE
;
2580 FOR_EACH_VEC_SAFE_ELT (vec
, i
, t
)
2582 *pp
= build_tree_list_stat (NULL
, t PASS_MEM_STAT
);
2583 pp
= &TREE_CHAIN (*pp
);
2588 /* Return a newly created TREE_LIST node whose
2589 purpose and value fields are PURPOSE and VALUE
2590 and whose TREE_CHAIN is CHAIN. */
2593 tree_cons_stat (tree purpose
, tree value
, tree chain MEM_STAT_DECL
)
2597 node
= ggc_alloc_tree_node_stat (sizeof (struct tree_list
) PASS_MEM_STAT
);
2598 memset (node
, 0, sizeof (struct tree_common
));
2600 record_node_allocation_statistics (TREE_LIST
, sizeof (struct tree_list
));
2602 TREE_SET_CODE (node
, TREE_LIST
);
2603 TREE_CHAIN (node
) = chain
;
2604 TREE_PURPOSE (node
) = purpose
;
2605 TREE_VALUE (node
) = value
;
2609 /* Return the values of the elements of a CONSTRUCTOR as a vector of
2613 ctor_to_vec (tree ctor
)
2615 vec
<tree
, va_gc
> *vec
;
2616 vec_alloc (vec
, CONSTRUCTOR_NELTS (ctor
));
2620 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), ix
, val
)
2621 vec
->quick_push (val
);
2626 /* Return the size nominally occupied by an object of type TYPE
2627 when it resides in memory. The value is measured in units of bytes,
2628 and its data type is that normally used for type sizes
2629 (which is the first type created by make_signed_type or
2630 make_unsigned_type). */
2633 size_in_bytes (const_tree type
)
2637 if (type
== error_mark_node
)
2638 return integer_zero_node
;
2640 type
= TYPE_MAIN_VARIANT (type
);
2641 t
= TYPE_SIZE_UNIT (type
);
2645 lang_hooks
.types
.incomplete_type_error (NULL_TREE
, type
);
2646 return size_zero_node
;
2652 /* Return the size of TYPE (in bytes) as a wide integer
2653 or return -1 if the size can vary or is larger than an integer. */
2656 int_size_in_bytes (const_tree type
)
2660 if (type
== error_mark_node
)
2663 type
= TYPE_MAIN_VARIANT (type
);
2664 t
= TYPE_SIZE_UNIT (type
);
2666 if (t
&& cst_fits_uhwi_p (t
))
2667 return tree_to_hwi (t
);
2672 /* Return the maximum size of TYPE (in bytes) as a wide integer
2673 or return -1 if the size can vary or is larger than an integer. */
2676 max_int_size_in_bytes (const_tree type
)
2678 HOST_WIDE_INT size
= -1;
2681 /* If this is an array type, check for a possible MAX_SIZE attached. */
2683 if (TREE_CODE (type
) == ARRAY_TYPE
)
2685 size_tree
= TYPE_ARRAY_MAX_SIZE (type
);
2687 if (size_tree
&& tree_fits_uhwi_p (size_tree
))
2688 size
= tree_to_uhwi (size_tree
);
2691 /* If we still haven't been able to get a size, see if the language
2692 can compute a maximum size. */
2696 size_tree
= lang_hooks
.types
.max_size (type
);
2698 if (size_tree
&& tree_fits_uhwi_p (size_tree
))
2699 size
= tree_to_uhwi (size_tree
);
2705 /* Return the bit position of FIELD, in bits from the start of the record.
2706 This is a tree of type bitsizetype. */
2709 bit_position (const_tree field
)
2711 return bit_from_pos (DECL_FIELD_OFFSET (field
),
2712 DECL_FIELD_BIT_OFFSET (field
));
2715 /* Likewise, but return as an integer. It must be representable in
2716 that way (since it could be a signed value, we don't have the
2717 option of returning -1 like int_size_in_byte can. */
2720 int_bit_position (const_tree field
)
2722 return tree_to_shwi (bit_position (field
));
2725 /* Return the byte position of FIELD, in bytes from the start of the record.
2726 This is a tree of type sizetype. */
2729 byte_position (const_tree field
)
2731 return byte_from_pos (DECL_FIELD_OFFSET (field
),
2732 DECL_FIELD_BIT_OFFSET (field
));
2735 /* Likewise, but return as an integer. It must be representable in
2736 that way (since it could be a signed value, we don't have the
2737 option of returning -1 like int_size_in_byte can. */
2740 int_byte_position (const_tree field
)
2742 return tree_to_shwi (byte_position (field
));
2745 /* Return the strictest alignment, in bits, that T is known to have. */
2748 expr_align (const_tree t
)
2750 unsigned int align0
, align1
;
2752 switch (TREE_CODE (t
))
2754 CASE_CONVERT
: case NON_LVALUE_EXPR
:
2755 /* If we have conversions, we know that the alignment of the
2756 object must meet each of the alignments of the types. */
2757 align0
= expr_align (TREE_OPERAND (t
, 0));
2758 align1
= TYPE_ALIGN (TREE_TYPE (t
));
2759 return MAX (align0
, align1
);
2761 case SAVE_EXPR
: case COMPOUND_EXPR
: case MODIFY_EXPR
:
2762 case INIT_EXPR
: case TARGET_EXPR
: case WITH_CLEANUP_EXPR
:
2763 case CLEANUP_POINT_EXPR
:
2764 /* These don't change the alignment of an object. */
2765 return expr_align (TREE_OPERAND (t
, 0));
2768 /* The best we can do is say that the alignment is the least aligned
2770 align0
= expr_align (TREE_OPERAND (t
, 1));
2771 align1
= expr_align (TREE_OPERAND (t
, 2));
2772 return MIN (align0
, align1
);
2774 /* FIXME: LABEL_DECL and CONST_DECL never have DECL_ALIGN set
2775 meaningfully, it's always 1. */
2776 case LABEL_DECL
: case CONST_DECL
:
2777 case VAR_DECL
: case PARM_DECL
: case RESULT_DECL
:
2779 gcc_assert (DECL_ALIGN (t
) != 0);
2780 return DECL_ALIGN (t
);
2786 /* Otherwise take the alignment from that of the type. */
2787 return TYPE_ALIGN (TREE_TYPE (t
));
2790 /* Return, as a tree node, the number of elements for TYPE (which is an
2791 ARRAY_TYPE) minus one. This counts only elements of the top array. */
2794 array_type_nelts (const_tree type
)
2796 tree index_type
, min
, max
;
2798 /* If they did it with unspecified bounds, then we should have already
2799 given an error about it before we got here. */
2800 if (! TYPE_DOMAIN (type
))
2801 return error_mark_node
;
2803 index_type
= TYPE_DOMAIN (type
);
2804 min
= TYPE_MIN_VALUE (index_type
);
2805 max
= TYPE_MAX_VALUE (index_type
);
2807 /* TYPE_MAX_VALUE may not be set if the array has unknown length. */
2809 return error_mark_node
;
2811 return (integer_zerop (min
)
2813 : fold_build2 (MINUS_EXPR
, TREE_TYPE (max
), max
, min
));
2816 /* If arg is static -- a reference to an object in static storage -- then
2817 return the object. This is not the same as the C meaning of `static'.
2818 If arg isn't static, return NULL. */
2823 switch (TREE_CODE (arg
))
2826 /* Nested functions are static, even though taking their address will
2827 involve a trampoline as we unnest the nested function and create
2828 the trampoline on the tree level. */
2832 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
2833 && ! DECL_THREAD_LOCAL_P (arg
)
2834 && ! DECL_DLLIMPORT_P (arg
)
2838 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
2842 return TREE_STATIC (arg
) ? arg
: NULL
;
2849 /* If the thing being referenced is not a field, then it is
2850 something language specific. */
2851 gcc_assert (TREE_CODE (TREE_OPERAND (arg
, 1)) == FIELD_DECL
);
2853 /* If we are referencing a bitfield, we can't evaluate an
2854 ADDR_EXPR at compile time and so it isn't a constant. */
2855 if (DECL_BIT_FIELD (TREE_OPERAND (arg
, 1)))
2858 return staticp (TREE_OPERAND (arg
, 0));
2864 return TREE_CONSTANT (TREE_OPERAND (arg
, 0)) ? arg
: NULL
;
2867 case ARRAY_RANGE_REF
:
2868 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg
))) == INTEGER_CST
2869 && TREE_CODE (TREE_OPERAND (arg
, 1)) == INTEGER_CST
)
2870 return staticp (TREE_OPERAND (arg
, 0));
2874 case COMPOUND_LITERAL_EXPR
:
2875 return TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (arg
)) ? arg
: NULL
;
2885 /* Return whether OP is a DECL whose address is function-invariant. */
2888 decl_address_invariant_p (const_tree op
)
2890 /* The conditions below are slightly less strict than the one in
2893 switch (TREE_CODE (op
))
2902 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
2903 || DECL_THREAD_LOCAL_P (op
)
2904 || DECL_CONTEXT (op
) == current_function_decl
2905 || decl_function_context (op
) == current_function_decl
)
2910 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
2911 || decl_function_context (op
) == current_function_decl
)
2922 /* Return whether OP is a DECL whose address is interprocedural-invariant. */
2925 decl_address_ip_invariant_p (const_tree op
)
2927 /* The conditions below are slightly less strict than the one in
2930 switch (TREE_CODE (op
))
2938 if (((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
2939 && !DECL_DLLIMPORT_P (op
))
2940 || DECL_THREAD_LOCAL_P (op
))
2945 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
)))
2957 /* Return true if T is function-invariant (internal function, does
2958 not handle arithmetic; that's handled in skip_simple_arithmetic and
2959 tree_invariant_p). */
2961 static bool tree_invariant_p (tree t
);
2964 tree_invariant_p_1 (tree t
)
2968 if (TREE_CONSTANT (t
)
2969 || (TREE_READONLY (t
) && !TREE_SIDE_EFFECTS (t
)))
2972 switch (TREE_CODE (t
))
2978 op
= TREE_OPERAND (t
, 0);
2979 while (handled_component_p (op
))
2981 switch (TREE_CODE (op
))
2984 case ARRAY_RANGE_REF
:
2985 if (!tree_invariant_p (TREE_OPERAND (op
, 1))
2986 || TREE_OPERAND (op
, 2) != NULL_TREE
2987 || TREE_OPERAND (op
, 3) != NULL_TREE
)
2992 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
2998 op
= TREE_OPERAND (op
, 0);
3001 return CONSTANT_CLASS_P (op
) || decl_address_invariant_p (op
);
3010 /* Return true if T is function-invariant. */
3013 tree_invariant_p (tree t
)
3015 tree inner
= skip_simple_arithmetic (t
);
3016 return tree_invariant_p_1 (inner
);
3019 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
3020 Do this to any expression which may be used in more than one place,
3021 but must be evaluated only once.
3023 Normally, expand_expr would reevaluate the expression each time.
3024 Calling save_expr produces something that is evaluated and recorded
3025 the first time expand_expr is called on it. Subsequent calls to
3026 expand_expr just reuse the recorded value.
3028 The call to expand_expr that generates code that actually computes
3029 the value is the first call *at compile time*. Subsequent calls
3030 *at compile time* generate code to use the saved value.
3031 This produces correct result provided that *at run time* control
3032 always flows through the insns made by the first expand_expr
3033 before reaching the other places where the save_expr was evaluated.
3034 You, the caller of save_expr, must make sure this is so.
3036 Constants, and certain read-only nodes, are returned with no
3037 SAVE_EXPR because that is safe. Expressions containing placeholders
3038 are not touched; see tree.def for an explanation of what these
3042 save_expr (tree expr
)
3044 tree t
= fold (expr
);
3047 /* If the tree evaluates to a constant, then we don't want to hide that
3048 fact (i.e. this allows further folding, and direct checks for constants).
3049 However, a read-only object that has side effects cannot be bypassed.
3050 Since it is no problem to reevaluate literals, we just return the
3052 inner
= skip_simple_arithmetic (t
);
3053 if (TREE_CODE (inner
) == ERROR_MARK
)
3056 if (tree_invariant_p_1 (inner
))
3059 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
3060 it means that the size or offset of some field of an object depends on
3061 the value within another field.
3063 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
3064 and some variable since it would then need to be both evaluated once and
3065 evaluated more than once. Front-ends must assure this case cannot
3066 happen by surrounding any such subexpressions in their own SAVE_EXPR
3067 and forcing evaluation at the proper time. */
3068 if (contains_placeholder_p (inner
))
3071 t
= build1 (SAVE_EXPR
, TREE_TYPE (expr
), t
);
3072 SET_EXPR_LOCATION (t
, EXPR_LOCATION (expr
));
3074 /* This expression might be placed ahead of a jump to ensure that the
3075 value was computed on both sides of the jump. So make sure it isn't
3076 eliminated as dead. */
3077 TREE_SIDE_EFFECTS (t
) = 1;
3081 /* Look inside EXPR into any simple arithmetic operations. Return the
3082 outermost non-arithmetic or non-invariant node. */
3085 skip_simple_arithmetic (tree expr
)
3087 /* We don't care about whether this can be used as an lvalue in this
3089 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
3090 expr
= TREE_OPERAND (expr
, 0);
3092 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
3093 a constant, it will be more efficient to not make another SAVE_EXPR since
3094 it will allow better simplification and GCSE will be able to merge the
3095 computations if they actually occur. */
3098 if (UNARY_CLASS_P (expr
))
3099 expr
= TREE_OPERAND (expr
, 0);
3100 else if (BINARY_CLASS_P (expr
))
3102 if (tree_invariant_p (TREE_OPERAND (expr
, 1)))
3103 expr
= TREE_OPERAND (expr
, 0);
3104 else if (tree_invariant_p (TREE_OPERAND (expr
, 0)))
3105 expr
= TREE_OPERAND (expr
, 1);
3116 /* Look inside EXPR into simple arithmetic operations involving constants.
3117 Return the outermost non-arithmetic or non-constant node. */
3120 skip_simple_constant_arithmetic (tree expr
)
3122 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
3123 expr
= TREE_OPERAND (expr
, 0);
3127 if (UNARY_CLASS_P (expr
))
3128 expr
= TREE_OPERAND (expr
, 0);
3129 else if (BINARY_CLASS_P (expr
))
3131 if (TREE_CONSTANT (TREE_OPERAND (expr
, 1)))
3132 expr
= TREE_OPERAND (expr
, 0);
3133 else if (TREE_CONSTANT (TREE_OPERAND (expr
, 0)))
3134 expr
= TREE_OPERAND (expr
, 1);
3145 /* Return which tree structure is used by T. */
3147 enum tree_node_structure_enum
3148 tree_node_structure (const_tree t
)
3150 const enum tree_code code
= TREE_CODE (t
);
3151 return tree_node_structure_for_code (code
);
3154 /* Set various status flags when building a CALL_EXPR object T. */
3157 process_call_operands (tree t
)
3159 bool side_effects
= TREE_SIDE_EFFECTS (t
);
3160 bool read_only
= false;
3161 int i
= call_expr_flags (t
);
3163 /* Calls have side-effects, except those to const or pure functions. */
3164 if ((i
& ECF_LOOPING_CONST_OR_PURE
) || !(i
& (ECF_CONST
| ECF_PURE
)))
3165 side_effects
= true;
3166 /* Propagate TREE_READONLY of arguments for const functions. */
3170 if (!side_effects
|| read_only
)
3171 for (i
= 1; i
< TREE_OPERAND_LENGTH (t
); i
++)
3173 tree op
= TREE_OPERAND (t
, i
);
3174 if (op
&& TREE_SIDE_EFFECTS (op
))
3175 side_effects
= true;
3176 if (op
&& !TREE_READONLY (op
) && !CONSTANT_CLASS_P (op
))
3180 TREE_SIDE_EFFECTS (t
) = side_effects
;
3181 TREE_READONLY (t
) = read_only
;
3184 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
3185 size or offset that depends on a field within a record. */
3188 contains_placeholder_p (const_tree exp
)
3190 enum tree_code code
;
3195 code
= TREE_CODE (exp
);
3196 if (code
== PLACEHOLDER_EXPR
)
3199 switch (TREE_CODE_CLASS (code
))
3202 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
3203 position computations since they will be converted into a
3204 WITH_RECORD_EXPR involving the reference, which will assume
3205 here will be valid. */
3206 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
3208 case tcc_exceptional
:
3209 if (code
== TREE_LIST
)
3210 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp
))
3211 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp
)));
3216 case tcc_comparison
:
3217 case tcc_expression
:
3221 /* Ignoring the first operand isn't quite right, but works best. */
3222 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1));
3225 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
3226 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1))
3227 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 2)));
3230 /* The save_expr function never wraps anything containing
3231 a PLACEHOLDER_EXPR. */
3238 switch (TREE_CODE_LENGTH (code
))
3241 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
3243 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
3244 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1)));
3255 const_call_expr_arg_iterator iter
;
3256 FOR_EACH_CONST_CALL_EXPR_ARG (arg
, iter
, exp
)
3257 if (CONTAINS_PLACEHOLDER_P (arg
))
3271 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
3272 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
3276 type_contains_placeholder_1 (const_tree type
)
3278 /* If the size contains a placeholder or the parent type (component type in
3279 the case of arrays) type involves a placeholder, this type does. */
3280 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type
))
3281 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type
))
3282 || (!POINTER_TYPE_P (type
)
3284 && type_contains_placeholder_p (TREE_TYPE (type
))))
3287 /* Now do type-specific checks. Note that the last part of the check above
3288 greatly limits what we have to do below. */
3289 switch (TREE_CODE (type
))
3292 case POINTER_BOUNDS_TYPE
:
3298 case REFERENCE_TYPE
:
3307 case FIXED_POINT_TYPE
:
3308 /* Here we just check the bounds. */
3309 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type
))
3310 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type
)));
3313 /* We have already checked the component type above, so just check the
3315 return type_contains_placeholder_p (TYPE_DOMAIN (type
));
3319 case QUAL_UNION_TYPE
:
3323 for (field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
3324 if (TREE_CODE (field
) == FIELD_DECL
3325 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field
))
3326 || (TREE_CODE (type
) == QUAL_UNION_TYPE
3327 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field
)))
3328 || type_contains_placeholder_p (TREE_TYPE (field
))))
3339 /* Wrapper around above function used to cache its result. */
3342 type_contains_placeholder_p (tree type
)
3346 /* If the contains_placeholder_bits field has been initialized,
3347 then we know the answer. */
3348 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) > 0)
3349 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) - 1;
3351 /* Indicate that we've seen this type node, and the answer is false.
3352 This is what we want to return if we run into recursion via fields. */
3353 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = 1;
3355 /* Compute the real value. */
3356 result
= type_contains_placeholder_1 (type
);
3358 /* Store the real value. */
3359 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = result
+ 1;
3364 /* Push tree EXP onto vector QUEUE if it is not already present. */
3367 push_without_duplicates (tree exp
, vec
<tree
> *queue
)
3372 FOR_EACH_VEC_ELT (*queue
, i
, iter
)
3373 if (simple_cst_equal (iter
, exp
) == 1)
3377 queue
->safe_push (exp
);
3380 /* Given a tree EXP, find all occurrences of references to fields
3381 in a PLACEHOLDER_EXPR and place them in vector REFS without
3382 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
3383 we assume here that EXP contains only arithmetic expressions
3384 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
3388 find_placeholder_in_expr (tree exp
, vec
<tree
> *refs
)
3390 enum tree_code code
= TREE_CODE (exp
);
3394 /* We handle TREE_LIST and COMPONENT_REF separately. */
3395 if (code
== TREE_LIST
)
3397 FIND_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), refs
);
3398 FIND_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), refs
);
3400 else if (code
== COMPONENT_REF
)
3402 for (inner
= TREE_OPERAND (exp
, 0);
3403 REFERENCE_CLASS_P (inner
);
3404 inner
= TREE_OPERAND (inner
, 0))
3407 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
)
3408 push_without_duplicates (exp
, refs
);
3410 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), refs
);
3413 switch (TREE_CODE_CLASS (code
))
3418 case tcc_declaration
:
3419 /* Variables allocated to static storage can stay. */
3420 if (!TREE_STATIC (exp
))
3421 push_without_duplicates (exp
, refs
);
3424 case tcc_expression
:
3425 /* This is the pattern built in ada/make_aligning_type. */
3426 if (code
== ADDR_EXPR
3427 && TREE_CODE (TREE_OPERAND (exp
, 0)) == PLACEHOLDER_EXPR
)
3429 push_without_duplicates (exp
, refs
);
3433 /* Fall through... */
3435 case tcc_exceptional
:
3438 case tcc_comparison
:
3440 for (i
= 0; i
< TREE_CODE_LENGTH (code
); i
++)
3441 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
3445 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3446 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
3454 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
3455 return a tree with all occurrences of references to F in a
3456 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
3457 CONST_DECLs. Note that we assume here that EXP contains only
3458 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
3459 occurring only in their argument list. */
3462 substitute_in_expr (tree exp
, tree f
, tree r
)
3464 enum tree_code code
= TREE_CODE (exp
);
3465 tree op0
, op1
, op2
, op3
;
3468 /* We handle TREE_LIST and COMPONENT_REF separately. */
3469 if (code
== TREE_LIST
)
3471 op0
= SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp
), f
, r
);
3472 op1
= SUBSTITUTE_IN_EXPR (TREE_VALUE (exp
), f
, r
);
3473 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
3476 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
3478 else if (code
== COMPONENT_REF
)
3482 /* If this expression is getting a value from a PLACEHOLDER_EXPR
3483 and it is the right field, replace it with R. */
3484 for (inner
= TREE_OPERAND (exp
, 0);
3485 REFERENCE_CLASS_P (inner
);
3486 inner
= TREE_OPERAND (inner
, 0))
3490 op1
= TREE_OPERAND (exp
, 1);
3492 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& op1
== f
)
3495 /* If this expression hasn't been completed let, leave it alone. */
3496 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& !TREE_TYPE (inner
))
3499 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3500 if (op0
== TREE_OPERAND (exp
, 0))
3504 = fold_build3 (COMPONENT_REF
, TREE_TYPE (exp
), op0
, op1
, NULL_TREE
);
3507 switch (TREE_CODE_CLASS (code
))
3512 case tcc_declaration
:
3518 case tcc_expression
:
3522 /* Fall through... */
3524 case tcc_exceptional
:
3527 case tcc_comparison
:
3529 switch (TREE_CODE_LENGTH (code
))
3535 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3536 if (op0
== TREE_OPERAND (exp
, 0))
3539 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
3543 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3544 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3546 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
3549 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
3553 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3554 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3555 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
3557 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3558 && op2
== TREE_OPERAND (exp
, 2))
3561 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
3565 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3566 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3567 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
3568 op3
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 3), f
, r
);
3570 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3571 && op2
== TREE_OPERAND (exp
, 2)
3572 && op3
== TREE_OPERAND (exp
, 3))
3576 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
3588 new_tree
= NULL_TREE
;
3590 /* If we are trying to replace F with a constant, inline back
3591 functions which do nothing else than computing a value from
3592 the arguments they are passed. This makes it possible to
3593 fold partially or entirely the replacement expression. */
3594 if (CONSTANT_CLASS_P (r
) && code
== CALL_EXPR
)
3596 tree t
= maybe_inline_call_in_expr (exp
);
3598 return SUBSTITUTE_IN_EXPR (t
, f
, r
);
3601 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3603 tree op
= TREE_OPERAND (exp
, i
);
3604 tree new_op
= SUBSTITUTE_IN_EXPR (op
, f
, r
);
3608 new_tree
= copy_node (exp
);
3609 TREE_OPERAND (new_tree
, i
) = new_op
;
3615 new_tree
= fold (new_tree
);
3616 if (TREE_CODE (new_tree
) == CALL_EXPR
)
3617 process_call_operands (new_tree
);
3628 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
3630 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
3631 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
3636 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
3637 for it within OBJ, a tree that is an object or a chain of references. */
3640 substitute_placeholder_in_expr (tree exp
, tree obj
)
3642 enum tree_code code
= TREE_CODE (exp
);
3643 tree op0
, op1
, op2
, op3
;
3646 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
3647 in the chain of OBJ. */
3648 if (code
== PLACEHOLDER_EXPR
)
3650 tree need_type
= TYPE_MAIN_VARIANT (TREE_TYPE (exp
));
3653 for (elt
= obj
; elt
!= 0;
3654 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
3655 || TREE_CODE (elt
) == COND_EXPR
)
3656 ? TREE_OPERAND (elt
, 1)
3657 : (REFERENCE_CLASS_P (elt
)
3658 || UNARY_CLASS_P (elt
)
3659 || BINARY_CLASS_P (elt
)
3660 || VL_EXP_CLASS_P (elt
)
3661 || EXPRESSION_CLASS_P (elt
))
3662 ? TREE_OPERAND (elt
, 0) : 0))
3663 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt
)) == need_type
)
3666 for (elt
= obj
; elt
!= 0;
3667 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
3668 || TREE_CODE (elt
) == COND_EXPR
)
3669 ? TREE_OPERAND (elt
, 1)
3670 : (REFERENCE_CLASS_P (elt
)
3671 || UNARY_CLASS_P (elt
)
3672 || BINARY_CLASS_P (elt
)
3673 || VL_EXP_CLASS_P (elt
)
3674 || EXPRESSION_CLASS_P (elt
))
3675 ? TREE_OPERAND (elt
, 0) : 0))
3676 if (POINTER_TYPE_P (TREE_TYPE (elt
))
3677 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt
)))
3679 return fold_build1 (INDIRECT_REF
, need_type
, elt
);
3681 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
3682 survives until RTL generation, there will be an error. */
3686 /* TREE_LIST is special because we need to look at TREE_VALUE
3687 and TREE_CHAIN, not TREE_OPERANDS. */
3688 else if (code
== TREE_LIST
)
3690 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), obj
);
3691 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), obj
);
3692 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
3695 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
3698 switch (TREE_CODE_CLASS (code
))
3701 case tcc_declaration
:
3704 case tcc_exceptional
:
3707 case tcc_comparison
:
3708 case tcc_expression
:
3711 switch (TREE_CODE_LENGTH (code
))
3717 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3718 if (op0
== TREE_OPERAND (exp
, 0))
3721 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
3725 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3726 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
3728 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
3731 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
3735 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3736 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
3737 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
3739 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3740 && op2
== TREE_OPERAND (exp
, 2))
3743 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
3747 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3748 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
3749 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
3750 op3
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 3), obj
);
3752 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3753 && op2
== TREE_OPERAND (exp
, 2)
3754 && op3
== TREE_OPERAND (exp
, 3))
3758 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
3770 new_tree
= NULL_TREE
;
3772 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3774 tree op
= TREE_OPERAND (exp
, i
);
3775 tree new_op
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (op
, obj
);
3779 new_tree
= copy_node (exp
);
3780 TREE_OPERAND (new_tree
, i
) = new_op
;
3786 new_tree
= fold (new_tree
);
3787 if (TREE_CODE (new_tree
) == CALL_EXPR
)
3788 process_call_operands (new_tree
);
3799 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
3801 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
3802 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
3808 /* Subroutine of stabilize_reference; this is called for subtrees of
3809 references. Any expression with side-effects must be put in a SAVE_EXPR
3810 to ensure that it is only evaluated once.
3812 We don't put SAVE_EXPR nodes around everything, because assigning very
3813 simple expressions to temporaries causes us to miss good opportunities
3814 for optimizations. Among other things, the opportunity to fold in the
3815 addition of a constant into an addressing mode often gets lost, e.g.
3816 "y[i+1] += x;". In general, we take the approach that we should not make
3817 an assignment unless we are forced into it - i.e., that any non-side effect
3818 operator should be allowed, and that cse should take care of coalescing
3819 multiple utterances of the same expression should that prove fruitful. */
3822 stabilize_reference_1 (tree e
)
3825 enum tree_code code
= TREE_CODE (e
);
3827 /* We cannot ignore const expressions because it might be a reference
3828 to a const array but whose index contains side-effects. But we can
3829 ignore things that are actual constant or that already have been
3830 handled by this function. */
3832 if (tree_invariant_p (e
))
3835 switch (TREE_CODE_CLASS (code
))
3837 case tcc_exceptional
:
3839 case tcc_declaration
:
3840 case tcc_comparison
:
3842 case tcc_expression
:
3845 /* If the expression has side-effects, then encase it in a SAVE_EXPR
3846 so that it will only be evaluated once. */
3847 /* The reference (r) and comparison (<) classes could be handled as
3848 below, but it is generally faster to only evaluate them once. */
3849 if (TREE_SIDE_EFFECTS (e
))
3850 return save_expr (e
);
3854 /* Constants need no processing. In fact, we should never reach
3859 /* Division is slow and tends to be compiled with jumps,
3860 especially the division by powers of 2 that is often
3861 found inside of an array reference. So do it just once. */
3862 if (code
== TRUNC_DIV_EXPR
|| code
== TRUNC_MOD_EXPR
3863 || code
== FLOOR_DIV_EXPR
|| code
== FLOOR_MOD_EXPR
3864 || code
== CEIL_DIV_EXPR
|| code
== CEIL_MOD_EXPR
3865 || code
== ROUND_DIV_EXPR
|| code
== ROUND_MOD_EXPR
)
3866 return save_expr (e
);
3867 /* Recursively stabilize each operand. */
3868 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)),
3869 stabilize_reference_1 (TREE_OPERAND (e
, 1)));
3873 /* Recursively stabilize each operand. */
3874 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)));
3881 TREE_TYPE (result
) = TREE_TYPE (e
);
3882 TREE_READONLY (result
) = TREE_READONLY (e
);
3883 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (e
);
3884 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (e
);
3889 /* Stabilize a reference so that we can use it any number of times
3890 without causing its operands to be evaluated more than once.
3891 Returns the stabilized reference. This works by means of save_expr,
3892 so see the caveats in the comments about save_expr.
3894 Also allows conversion expressions whose operands are references.
3895 Any other kind of expression is returned unchanged. */
3898 stabilize_reference (tree ref
)
3901 enum tree_code code
= TREE_CODE (ref
);
3908 /* No action is needed in this case. */
3913 case FIX_TRUNC_EXPR
:
3914 result
= build_nt (code
, stabilize_reference (TREE_OPERAND (ref
, 0)));
3918 result
= build_nt (INDIRECT_REF
,
3919 stabilize_reference_1 (TREE_OPERAND (ref
, 0)));
3923 result
= build_nt (COMPONENT_REF
,
3924 stabilize_reference (TREE_OPERAND (ref
, 0)),
3925 TREE_OPERAND (ref
, 1), NULL_TREE
);
3929 result
= build_nt (BIT_FIELD_REF
,
3930 stabilize_reference (TREE_OPERAND (ref
, 0)),
3931 TREE_OPERAND (ref
, 1), TREE_OPERAND (ref
, 2));
3935 result
= build_nt (ARRAY_REF
,
3936 stabilize_reference (TREE_OPERAND (ref
, 0)),
3937 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
3938 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
3941 case ARRAY_RANGE_REF
:
3942 result
= build_nt (ARRAY_RANGE_REF
,
3943 stabilize_reference (TREE_OPERAND (ref
, 0)),
3944 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
3945 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
3949 /* We cannot wrap the first expression in a SAVE_EXPR, as then
3950 it wouldn't be ignored. This matters when dealing with
3952 return stabilize_reference_1 (ref
);
3954 /* If arg isn't a kind of lvalue we recognize, make no change.
3955 Caller should recognize the error for an invalid lvalue. */
3960 return error_mark_node
;
3963 TREE_TYPE (result
) = TREE_TYPE (ref
);
3964 TREE_READONLY (result
) = TREE_READONLY (ref
);
3965 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (ref
);
3966 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (ref
);
3971 /* Low-level constructors for expressions. */
3973 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
3974 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
3977 recompute_tree_invariant_for_addr_expr (tree t
)
3980 bool tc
= true, se
= false;
3982 /* We started out assuming this address is both invariant and constant, but
3983 does not have side effects. Now go down any handled components and see if
3984 any of them involve offsets that are either non-constant or non-invariant.
3985 Also check for side-effects.
3987 ??? Note that this code makes no attempt to deal with the case where
3988 taking the address of something causes a copy due to misalignment. */
3990 #define UPDATE_FLAGS(NODE) \
3991 do { tree _node = (NODE); \
3992 if (_node && !TREE_CONSTANT (_node)) tc = false; \
3993 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
3995 for (node
= TREE_OPERAND (t
, 0); handled_component_p (node
);
3996 node
= TREE_OPERAND (node
, 0))
3998 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
3999 array reference (probably made temporarily by the G++ front end),
4000 so ignore all the operands. */
4001 if ((TREE_CODE (node
) == ARRAY_REF
4002 || TREE_CODE (node
) == ARRAY_RANGE_REF
)
4003 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node
, 0))) == ARRAY_TYPE
)
4005 UPDATE_FLAGS (TREE_OPERAND (node
, 1));
4006 if (TREE_OPERAND (node
, 2))
4007 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
4008 if (TREE_OPERAND (node
, 3))
4009 UPDATE_FLAGS (TREE_OPERAND (node
, 3));
4011 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
4012 FIELD_DECL, apparently. The G++ front end can put something else
4013 there, at least temporarily. */
4014 else if (TREE_CODE (node
) == COMPONENT_REF
4015 && TREE_CODE (TREE_OPERAND (node
, 1)) == FIELD_DECL
)
4017 if (TREE_OPERAND (node
, 2))
4018 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
4022 node
= lang_hooks
.expr_to_decl (node
, &tc
, &se
);
4024 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
4025 the address, since &(*a)->b is a form of addition. If it's a constant, the
4026 address is constant too. If it's a decl, its address is constant if the
4027 decl is static. Everything else is not constant and, furthermore,
4028 taking the address of a volatile variable is not volatile. */
4029 if (TREE_CODE (node
) == INDIRECT_REF
4030 || TREE_CODE (node
) == MEM_REF
)
4031 UPDATE_FLAGS (TREE_OPERAND (node
, 0));
4032 else if (CONSTANT_CLASS_P (node
))
4034 else if (DECL_P (node
))
4035 tc
&= (staticp (node
) != NULL_TREE
);
4039 se
|= TREE_SIDE_EFFECTS (node
);
4043 TREE_CONSTANT (t
) = tc
;
4044 TREE_SIDE_EFFECTS (t
) = se
;
4048 /* Build an expression of code CODE, data type TYPE, and operands as
4049 specified. Expressions and reference nodes can be created this way.
4050 Constants, decls, types and misc nodes cannot be.
4052 We define 5 non-variadic functions, from 0 to 4 arguments. This is
4053 enough for all extant tree codes. */
4056 build0_stat (enum tree_code code
, tree tt MEM_STAT_DECL
)
4060 gcc_assert (TREE_CODE_LENGTH (code
) == 0);
4062 t
= make_node_stat (code PASS_MEM_STAT
);
4069 build1_stat (enum tree_code code
, tree type
, tree node MEM_STAT_DECL
)
4071 int length
= sizeof (struct tree_exp
);
4074 record_node_allocation_statistics (code
, length
);
4076 gcc_assert (TREE_CODE_LENGTH (code
) == 1);
4078 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
4080 memset (t
, 0, sizeof (struct tree_common
));
4082 TREE_SET_CODE (t
, code
);
4084 TREE_TYPE (t
) = type
;
4085 SET_EXPR_LOCATION (t
, UNKNOWN_LOCATION
);
4086 TREE_OPERAND (t
, 0) = node
;
4087 if (node
&& !TYPE_P (node
))
4089 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (node
);
4090 TREE_READONLY (t
) = TREE_READONLY (node
);
4093 if (TREE_CODE_CLASS (code
) == tcc_statement
)
4094 TREE_SIDE_EFFECTS (t
) = 1;
4098 /* All of these have side-effects, no matter what their
4100 TREE_SIDE_EFFECTS (t
) = 1;
4101 TREE_READONLY (t
) = 0;
4105 /* Whether a dereference is readonly has nothing to do with whether
4106 its operand is readonly. */
4107 TREE_READONLY (t
) = 0;
4112 recompute_tree_invariant_for_addr_expr (t
);
4116 if ((TREE_CODE_CLASS (code
) == tcc_unary
|| code
== VIEW_CONVERT_EXPR
)
4117 && node
&& !TYPE_P (node
)
4118 && TREE_CONSTANT (node
))
4119 TREE_CONSTANT (t
) = 1;
4120 if (TREE_CODE_CLASS (code
) == tcc_reference
4121 && node
&& TREE_THIS_VOLATILE (node
))
4122 TREE_THIS_VOLATILE (t
) = 1;
4129 #define PROCESS_ARG(N) \
4131 TREE_OPERAND (t, N) = arg##N; \
4132 if (arg##N &&!TYPE_P (arg##N)) \
4134 if (TREE_SIDE_EFFECTS (arg##N)) \
4136 if (!TREE_READONLY (arg##N) \
4137 && !CONSTANT_CLASS_P (arg##N)) \
4138 (void) (read_only = 0); \
4139 if (!TREE_CONSTANT (arg##N)) \
4140 (void) (constant = 0); \
4145 build2_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1 MEM_STAT_DECL
)
4147 bool constant
, read_only
, side_effects
;
4150 gcc_assert (TREE_CODE_LENGTH (code
) == 2);
4152 if ((code
== MINUS_EXPR
|| code
== PLUS_EXPR
|| code
== MULT_EXPR
)
4153 && arg0
&& arg1
&& tt
&& POINTER_TYPE_P (tt
)
4154 /* When sizetype precision doesn't match that of pointers
4155 we need to be able to build explicit extensions or truncations
4156 of the offset argument. */
4157 && TYPE_PRECISION (sizetype
) == TYPE_PRECISION (tt
))
4158 gcc_assert (TREE_CODE (arg0
) == INTEGER_CST
4159 && TREE_CODE (arg1
) == INTEGER_CST
);
4161 if (code
== POINTER_PLUS_EXPR
&& arg0
&& arg1
&& tt
)
4162 gcc_assert (POINTER_TYPE_P (tt
) && POINTER_TYPE_P (TREE_TYPE (arg0
))
4163 && ptrofftype_p (TREE_TYPE (arg1
)));
4165 t
= make_node_stat (code PASS_MEM_STAT
);
4168 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
4169 result based on those same flags for the arguments. But if the
4170 arguments aren't really even `tree' expressions, we shouldn't be trying
4173 /* Expressions without side effects may be constant if their
4174 arguments are as well. */
4175 constant
= (TREE_CODE_CLASS (code
) == tcc_comparison
4176 || TREE_CODE_CLASS (code
) == tcc_binary
);
4178 side_effects
= TREE_SIDE_EFFECTS (t
);
4183 TREE_READONLY (t
) = read_only
;
4184 TREE_CONSTANT (t
) = constant
;
4185 TREE_SIDE_EFFECTS (t
) = side_effects
;
4186 TREE_THIS_VOLATILE (t
)
4187 = (TREE_CODE_CLASS (code
) == tcc_reference
4188 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4195 build3_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4196 tree arg2 MEM_STAT_DECL
)
4198 bool constant
, read_only
, side_effects
;
4201 gcc_assert (TREE_CODE_LENGTH (code
) == 3);
4202 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
4204 t
= make_node_stat (code PASS_MEM_STAT
);
4209 /* As a special exception, if COND_EXPR has NULL branches, we
4210 assume that it is a gimple statement and always consider
4211 it to have side effects. */
4212 if (code
== COND_EXPR
4213 && tt
== void_type_node
4214 && arg1
== NULL_TREE
4215 && arg2
== NULL_TREE
)
4216 side_effects
= true;
4218 side_effects
= TREE_SIDE_EFFECTS (t
);
4224 if (code
== COND_EXPR
)
4225 TREE_READONLY (t
) = read_only
;
4227 TREE_SIDE_EFFECTS (t
) = side_effects
;
4228 TREE_THIS_VOLATILE (t
)
4229 = (TREE_CODE_CLASS (code
) == tcc_reference
4230 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4236 build4_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4237 tree arg2
, tree arg3 MEM_STAT_DECL
)
4239 bool constant
, read_only
, side_effects
;
4242 gcc_assert (TREE_CODE_LENGTH (code
) == 4);
4244 t
= make_node_stat (code PASS_MEM_STAT
);
4247 side_effects
= TREE_SIDE_EFFECTS (t
);
4254 TREE_SIDE_EFFECTS (t
) = side_effects
;
4255 TREE_THIS_VOLATILE (t
)
4256 = (TREE_CODE_CLASS (code
) == tcc_reference
4257 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4263 build5_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4264 tree arg2
, tree arg3
, tree arg4 MEM_STAT_DECL
)
4266 bool constant
, read_only
, side_effects
;
4269 gcc_assert (TREE_CODE_LENGTH (code
) == 5);
4271 t
= make_node_stat (code PASS_MEM_STAT
);
4274 side_effects
= TREE_SIDE_EFFECTS (t
);
4282 TREE_SIDE_EFFECTS (t
) = side_effects
;
4283 TREE_THIS_VOLATILE (t
)
4284 = (TREE_CODE_CLASS (code
) == tcc_reference
4285 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4290 /* Build a simple MEM_REF tree with the sematics of a plain INDIRECT_REF
4291 on the pointer PTR. */
4294 build_simple_mem_ref_loc (location_t loc
, tree ptr
)
4296 HOST_WIDE_INT offset
= 0;
4297 tree ptype
= TREE_TYPE (ptr
);
4299 /* For convenience allow addresses that collapse to a simple base
4301 if (TREE_CODE (ptr
) == ADDR_EXPR
4302 && (handled_component_p (TREE_OPERAND (ptr
, 0))
4303 || TREE_CODE (TREE_OPERAND (ptr
, 0)) == MEM_REF
))
4305 ptr
= get_addr_base_and_unit_offset (TREE_OPERAND (ptr
, 0), &offset
);
4307 ptr
= build_fold_addr_expr (ptr
);
4308 gcc_assert (is_gimple_reg (ptr
) || is_gimple_min_invariant (ptr
));
4310 tem
= build2 (MEM_REF
, TREE_TYPE (ptype
),
4311 ptr
, build_int_cst (ptype
, offset
));
4312 SET_EXPR_LOCATION (tem
, loc
);
4316 /* Return the constant offset of a MEM_REF or TARGET_MEM_REF tree T. */
4319 mem_ref_offset (const_tree t
)
4321 return offset_int::from (TREE_OPERAND (t
, 1), SIGNED
);
4324 /* Return an invariant ADDR_EXPR of type TYPE taking the address of BASE
4325 offsetted by OFFSET units. */
4328 build_invariant_address (tree type
, tree base
, HOST_WIDE_INT offset
)
4330 tree ref
= fold_build2 (MEM_REF
, TREE_TYPE (type
),
4331 build_fold_addr_expr (base
),
4332 build_int_cst (ptr_type_node
, offset
));
4333 tree addr
= build1 (ADDR_EXPR
, type
, ref
);
4334 recompute_tree_invariant_for_addr_expr (addr
);
4338 /* Similar except don't specify the TREE_TYPE
4339 and leave the TREE_SIDE_EFFECTS as 0.
4340 It is permissible for arguments to be null,
4341 or even garbage if their values do not matter. */
4344 build_nt (enum tree_code code
, ...)
4351 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
4355 t
= make_node (code
);
4356 length
= TREE_CODE_LENGTH (code
);
4358 for (i
= 0; i
< length
; i
++)
4359 TREE_OPERAND (t
, i
) = va_arg (p
, tree
);
4365 /* Similar to build_nt, but for creating a CALL_EXPR object with a
4369 build_nt_call_vec (tree fn
, vec
<tree
, va_gc
> *args
)
4374 ret
= build_vl_exp (CALL_EXPR
, vec_safe_length (args
) + 3);
4375 CALL_EXPR_FN (ret
) = fn
;
4376 CALL_EXPR_STATIC_CHAIN (ret
) = NULL_TREE
;
4377 FOR_EACH_VEC_SAFE_ELT (args
, ix
, t
)
4378 CALL_EXPR_ARG (ret
, ix
) = t
;
4382 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
4383 We do NOT enter this node in any sort of symbol table.
4385 LOC is the location of the decl.
4387 layout_decl is used to set up the decl's storage layout.
4388 Other slots are initialized to 0 or null pointers. */
4391 build_decl_stat (location_t loc
, enum tree_code code
, tree name
,
4392 tree type MEM_STAT_DECL
)
4396 t
= make_node_stat (code PASS_MEM_STAT
);
4397 DECL_SOURCE_LOCATION (t
) = loc
;
4399 /* if (type == error_mark_node)
4400 type = integer_type_node; */
4401 /* That is not done, deliberately, so that having error_mark_node
4402 as the type can suppress useless errors in the use of this variable. */
4404 DECL_NAME (t
) = name
;
4405 TREE_TYPE (t
) = type
;
4407 if (code
== VAR_DECL
|| code
== PARM_DECL
|| code
== RESULT_DECL
)
4413 /* Builds and returns function declaration with NAME and TYPE. */
4416 build_fn_decl (const char *name
, tree type
)
4418 tree id
= get_identifier (name
);
4419 tree decl
= build_decl (input_location
, FUNCTION_DECL
, id
, type
);
4421 DECL_EXTERNAL (decl
) = 1;
4422 TREE_PUBLIC (decl
) = 1;
4423 DECL_ARTIFICIAL (decl
) = 1;
4424 TREE_NOTHROW (decl
) = 1;
4429 vec
<tree
, va_gc
> *all_translation_units
;
4431 /* Builds a new translation-unit decl with name NAME, queues it in the
4432 global list of translation-unit decls and returns it. */
4435 build_translation_unit_decl (tree name
)
4437 tree tu
= build_decl (UNKNOWN_LOCATION
, TRANSLATION_UNIT_DECL
,
4439 TRANSLATION_UNIT_LANGUAGE (tu
) = lang_hooks
.name
;
4440 vec_safe_push (all_translation_units
, tu
);
4445 /* BLOCK nodes are used to represent the structure of binding contours
4446 and declarations, once those contours have been exited and their contents
4447 compiled. This information is used for outputting debugging info. */
4450 build_block (tree vars
, tree subblocks
, tree supercontext
, tree chain
)
4452 tree block
= make_node (BLOCK
);
4454 BLOCK_VARS (block
) = vars
;
4455 BLOCK_SUBBLOCKS (block
) = subblocks
;
4456 BLOCK_SUPERCONTEXT (block
) = supercontext
;
4457 BLOCK_CHAIN (block
) = chain
;
4462 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
4464 LOC is the location to use in tree T. */
4467 protected_set_expr_location (tree t
, location_t loc
)
4469 if (t
&& CAN_HAVE_LOCATION_P (t
))
4470 SET_EXPR_LOCATION (t
, loc
);
4473 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
4477 build_decl_attribute_variant (tree ddecl
, tree attribute
)
4479 DECL_ATTRIBUTES (ddecl
) = attribute
;
4483 /* Borrowed from hashtab.c iterative_hash implementation. */
4484 #define mix(a,b,c) \
4486 a -= b; a -= c; a ^= (c>>13); \
4487 b -= c; b -= a; b ^= (a<< 8); \
4488 c -= a; c -= b; c ^= ((b&0xffffffff)>>13); \
4489 a -= b; a -= c; a ^= ((c&0xffffffff)>>12); \
4490 b -= c; b -= a; b = (b ^ (a<<16)) & 0xffffffff; \
4491 c -= a; c -= b; c = (c ^ (b>> 5)) & 0xffffffff; \
4492 a -= b; a -= c; a = (a ^ (c>> 3)) & 0xffffffff; \
4493 b -= c; b -= a; b = (b ^ (a<<10)) & 0xffffffff; \
4494 c -= a; c -= b; c = (c ^ (b>>15)) & 0xffffffff; \
4498 /* Produce good hash value combining VAL and VAL2. */
4500 iterative_hash_hashval_t (hashval_t val
, hashval_t val2
)
4502 /* the golden ratio; an arbitrary value. */
4503 hashval_t a
= 0x9e3779b9;
4509 /* Produce good hash value combining VAL and VAL2. */
4511 iterative_hash_host_wide_int (HOST_WIDE_INT val
, hashval_t val2
)
4513 if (sizeof (HOST_WIDE_INT
) == sizeof (hashval_t
))
4514 return iterative_hash_hashval_t (val
, val2
);
4517 hashval_t a
= (hashval_t
) val
;
4518 /* Avoid warnings about shifting of more than the width of the type on
4519 hosts that won't execute this path. */
4521 hashval_t b
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 8 + zero
));
4523 if (sizeof (HOST_WIDE_INT
) > 2 * sizeof (hashval_t
))
4525 hashval_t a
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 16 + zero
));
4526 hashval_t b
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 24 + zero
));
4533 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4534 is ATTRIBUTE and its qualifiers are QUALS.
4536 Record such modified types already made so we don't make duplicates. */
4539 build_type_attribute_qual_variant (tree ttype
, tree attribute
, int quals
)
4541 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype
), attribute
))
4543 hashval_t hashcode
= 0;
4547 enum tree_code code
= TREE_CODE (ttype
);
4549 /* Building a distinct copy of a tagged type is inappropriate; it
4550 causes breakage in code that expects there to be a one-to-one
4551 relationship between a struct and its fields.
4552 build_duplicate_type is another solution (as used in
4553 handle_transparent_union_attribute), but that doesn't play well
4554 with the stronger C++ type identity model. */
4555 if (TREE_CODE (ttype
) == RECORD_TYPE
4556 || TREE_CODE (ttype
) == UNION_TYPE
4557 || TREE_CODE (ttype
) == QUAL_UNION_TYPE
4558 || TREE_CODE (ttype
) == ENUMERAL_TYPE
)
4560 warning (OPT_Wattributes
,
4561 "ignoring attributes applied to %qT after definition",
4562 TYPE_MAIN_VARIANT (ttype
));
4563 return build_qualified_type (ttype
, quals
);
4566 ttype
= build_qualified_type (ttype
, TYPE_UNQUALIFIED
);
4567 ntype
= build_distinct_type_copy (ttype
);
4569 TYPE_ATTRIBUTES (ntype
) = attribute
;
4571 hashcode
= iterative_hash_object (code
, hashcode
);
4572 if (TREE_TYPE (ntype
))
4573 hashcode
= iterative_hash_object (TYPE_HASH (TREE_TYPE (ntype
)),
4575 hashcode
= attribute_hash_list (attribute
, hashcode
);
4577 switch (TREE_CODE (ntype
))
4580 hashcode
= type_hash_list (TYPE_ARG_TYPES (ntype
), hashcode
);
4583 if (TYPE_DOMAIN (ntype
))
4584 hashcode
= iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (ntype
)),
4588 t
= TYPE_MAX_VALUE (ntype
);
4589 for (i
= 0; i
< TREE_INT_CST_NUNITS (t
); i
++)
4590 hashcode
= iterative_hash_object (TREE_INT_CST_ELT (t
, i
), hashcode
);
4593 case FIXED_POINT_TYPE
:
4595 unsigned int precision
= TYPE_PRECISION (ntype
);
4596 hashcode
= iterative_hash_object (precision
, hashcode
);
4603 ntype
= type_hash_canon (hashcode
, ntype
);
4605 /* If the target-dependent attributes make NTYPE different from
4606 its canonical type, we will need to use structural equality
4607 checks for this type. */
4608 if (TYPE_STRUCTURAL_EQUALITY_P (ttype
)
4609 || !comp_type_attributes (ntype
, ttype
))
4610 SET_TYPE_STRUCTURAL_EQUALITY (ntype
);
4611 else if (TYPE_CANONICAL (ntype
) == ntype
)
4612 TYPE_CANONICAL (ntype
) = TYPE_CANONICAL (ttype
);
4614 ttype
= build_qualified_type (ntype
, quals
);
4616 else if (TYPE_QUALS (ttype
) != quals
)
4617 ttype
= build_qualified_type (ttype
, quals
);
4622 /* Check if "omp declare simd" attribute arguments, CLAUSES1 and CLAUSES2, are
4626 omp_declare_simd_clauses_equal (tree clauses1
, tree clauses2
)
4629 for (cl1
= clauses1
, cl2
= clauses2
;
4631 cl1
= OMP_CLAUSE_CHAIN (cl1
), cl2
= OMP_CLAUSE_CHAIN (cl2
))
4633 if (OMP_CLAUSE_CODE (cl1
) != OMP_CLAUSE_CODE (cl2
))
4635 if (OMP_CLAUSE_CODE (cl1
) != OMP_CLAUSE_SIMDLEN
)
4637 if (simple_cst_equal (OMP_CLAUSE_DECL (cl1
),
4638 OMP_CLAUSE_DECL (cl2
)) != 1)
4641 switch (OMP_CLAUSE_CODE (cl1
))
4643 case OMP_CLAUSE_ALIGNED
:
4644 if (simple_cst_equal (OMP_CLAUSE_ALIGNED_ALIGNMENT (cl1
),
4645 OMP_CLAUSE_ALIGNED_ALIGNMENT (cl2
)) != 1)
4648 case OMP_CLAUSE_LINEAR
:
4649 if (simple_cst_equal (OMP_CLAUSE_LINEAR_STEP (cl1
),
4650 OMP_CLAUSE_LINEAR_STEP (cl2
)) != 1)
4653 case OMP_CLAUSE_SIMDLEN
:
4654 if (simple_cst_equal (OMP_CLAUSE_SIMDLEN_EXPR (cl1
),
4655 OMP_CLAUSE_SIMDLEN_EXPR (cl2
)) != 1)
4664 /* Compare two constructor-element-type constants. Return 1 if the lists
4665 are known to be equal; otherwise return 0. */
4668 simple_cst_list_equal (const_tree l1
, const_tree l2
)
4670 while (l1
!= NULL_TREE
&& l2
!= NULL_TREE
)
4672 if (simple_cst_equal (TREE_VALUE (l1
), TREE_VALUE (l2
)) != 1)
4675 l1
= TREE_CHAIN (l1
);
4676 l2
= TREE_CHAIN (l2
);
4682 /* Compare two attributes for their value identity. Return true if the
4683 attribute values are known to be equal; otherwise return false.
4687 attribute_value_equal (const_tree attr1
, const_tree attr2
)
4689 if (TREE_VALUE (attr1
) == TREE_VALUE (attr2
))
4692 if (TREE_VALUE (attr1
) != NULL_TREE
4693 && TREE_CODE (TREE_VALUE (attr1
)) == TREE_LIST
4694 && TREE_VALUE (attr2
) != NULL
4695 && TREE_CODE (TREE_VALUE (attr2
)) == TREE_LIST
)
4696 return (simple_cst_list_equal (TREE_VALUE (attr1
),
4697 TREE_VALUE (attr2
)) == 1);
4699 if ((flag_openmp
|| flag_openmp_simd
)
4700 && TREE_VALUE (attr1
) && TREE_VALUE (attr2
)
4701 && TREE_CODE (TREE_VALUE (attr1
)) == OMP_CLAUSE
4702 && TREE_CODE (TREE_VALUE (attr2
)) == OMP_CLAUSE
)
4703 return omp_declare_simd_clauses_equal (TREE_VALUE (attr1
),
4704 TREE_VALUE (attr2
));
4706 return (simple_cst_equal (TREE_VALUE (attr1
), TREE_VALUE (attr2
)) == 1);
4709 /* Return 0 if the attributes for two types are incompatible, 1 if they
4710 are compatible, and 2 if they are nearly compatible (which causes a
4711 warning to be generated). */
4713 comp_type_attributes (const_tree type1
, const_tree type2
)
4715 const_tree a1
= TYPE_ATTRIBUTES (type1
);
4716 const_tree a2
= TYPE_ATTRIBUTES (type2
);
4721 for (a
= a1
; a
!= NULL_TREE
; a
= TREE_CHAIN (a
))
4723 const struct attribute_spec
*as
;
4726 as
= lookup_attribute_spec (get_attribute_name (a
));
4727 if (!as
|| as
->affects_type_identity
== false)
4730 attr
= lookup_attribute (as
->name
, CONST_CAST_TREE (a2
));
4731 if (!attr
|| !attribute_value_equal (a
, attr
))
4736 for (a
= a2
; a
!= NULL_TREE
; a
= TREE_CHAIN (a
))
4738 const struct attribute_spec
*as
;
4740 as
= lookup_attribute_spec (get_attribute_name (a
));
4741 if (!as
|| as
->affects_type_identity
== false)
4744 if (!lookup_attribute (as
->name
, CONST_CAST_TREE (a1
)))
4746 /* We don't need to compare trees again, as we did this
4747 already in first loop. */
4749 /* All types - affecting identity - are equal, so
4750 there is no need to call target hook for comparison. */
4754 /* As some type combinations - like default calling-convention - might
4755 be compatible, we have to call the target hook to get the final result. */
4756 return targetm
.comp_type_attributes (type1
, type2
);
4759 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4762 Record such modified types already made so we don't make duplicates. */
4765 build_type_attribute_variant (tree ttype
, tree attribute
)
4767 return build_type_attribute_qual_variant (ttype
, attribute
,
4768 TYPE_QUALS (ttype
));
4772 /* Reset the expression *EXPR_P, a size or position.
4774 ??? We could reset all non-constant sizes or positions. But it's cheap
4775 enough to not do so and refrain from adding workarounds to dwarf2out.c.
4777 We need to reset self-referential sizes or positions because they cannot
4778 be gimplified and thus can contain a CALL_EXPR after the gimplification
4779 is finished, which will run afoul of LTO streaming. And they need to be
4780 reset to something essentially dummy but not constant, so as to preserve
4781 the properties of the object they are attached to. */
4784 free_lang_data_in_one_sizepos (tree
*expr_p
)
4786 tree expr
= *expr_p
;
4787 if (CONTAINS_PLACEHOLDER_P (expr
))
4788 *expr_p
= build0 (PLACEHOLDER_EXPR
, TREE_TYPE (expr
));
4792 /* Reset all the fields in a binfo node BINFO. We only keep
4793 BINFO_VTABLE, which is used by gimple_fold_obj_type_ref. */
4796 free_lang_data_in_binfo (tree binfo
)
4801 gcc_assert (TREE_CODE (binfo
) == TREE_BINFO
);
4803 BINFO_VIRTUALS (binfo
) = NULL_TREE
;
4804 BINFO_BASE_ACCESSES (binfo
) = NULL
;
4805 BINFO_INHERITANCE_CHAIN (binfo
) = NULL_TREE
;
4806 BINFO_SUBVTT_INDEX (binfo
) = NULL_TREE
;
4808 FOR_EACH_VEC_ELT (*BINFO_BASE_BINFOS (binfo
), i
, t
)
4809 free_lang_data_in_binfo (t
);
4813 /* Reset all language specific information still present in TYPE. */
4816 free_lang_data_in_type (tree type
)
4818 gcc_assert (TYPE_P (type
));
4820 /* Give the FE a chance to remove its own data first. */
4821 lang_hooks
.free_lang_data (type
);
4823 TREE_LANG_FLAG_0 (type
) = 0;
4824 TREE_LANG_FLAG_1 (type
) = 0;
4825 TREE_LANG_FLAG_2 (type
) = 0;
4826 TREE_LANG_FLAG_3 (type
) = 0;
4827 TREE_LANG_FLAG_4 (type
) = 0;
4828 TREE_LANG_FLAG_5 (type
) = 0;
4829 TREE_LANG_FLAG_6 (type
) = 0;
4831 if (TREE_CODE (type
) == FUNCTION_TYPE
)
4833 /* Remove the const and volatile qualifiers from arguments. The
4834 C++ front end removes them, but the C front end does not,
4835 leading to false ODR violation errors when merging two
4836 instances of the same function signature compiled by
4837 different front ends. */
4840 for (p
= TYPE_ARG_TYPES (type
); p
; p
= TREE_CHAIN (p
))
4842 tree arg_type
= TREE_VALUE (p
);
4844 if (TYPE_READONLY (arg_type
) || TYPE_VOLATILE (arg_type
))
4846 int quals
= TYPE_QUALS (arg_type
)
4848 & ~TYPE_QUAL_VOLATILE
;
4849 TREE_VALUE (p
) = build_qualified_type (arg_type
, quals
);
4850 free_lang_data_in_type (TREE_VALUE (p
));
4855 /* Remove members that are not actually FIELD_DECLs from the field
4856 list of an aggregate. These occur in C++. */
4857 if (RECORD_OR_UNION_TYPE_P (type
))
4861 /* Note that TYPE_FIELDS can be shared across distinct
4862 TREE_TYPEs. Therefore, if the first field of TYPE_FIELDS is
4863 to be removed, we cannot set its TREE_CHAIN to NULL.
4864 Otherwise, we would not be able to find all the other fields
4865 in the other instances of this TREE_TYPE.
4867 This was causing an ICE in testsuite/g++.dg/lto/20080915.C. */
4869 member
= TYPE_FIELDS (type
);
4872 if (TREE_CODE (member
) == FIELD_DECL
4873 || TREE_CODE (member
) == TYPE_DECL
)
4876 TREE_CHAIN (prev
) = member
;
4878 TYPE_FIELDS (type
) = member
;
4882 member
= TREE_CHAIN (member
);
4886 TREE_CHAIN (prev
) = NULL_TREE
;
4888 TYPE_FIELDS (type
) = NULL_TREE
;
4890 TYPE_METHODS (type
) = NULL_TREE
;
4891 if (TYPE_BINFO (type
))
4892 free_lang_data_in_binfo (TYPE_BINFO (type
));
4896 /* For non-aggregate types, clear out the language slot (which
4897 overloads TYPE_BINFO). */
4898 TYPE_LANG_SLOT_1 (type
) = NULL_TREE
;
4900 if (INTEGRAL_TYPE_P (type
)
4901 || SCALAR_FLOAT_TYPE_P (type
)
4902 || FIXED_POINT_TYPE_P (type
))
4904 free_lang_data_in_one_sizepos (&TYPE_MIN_VALUE (type
));
4905 free_lang_data_in_one_sizepos (&TYPE_MAX_VALUE (type
));
4909 free_lang_data_in_one_sizepos (&TYPE_SIZE (type
));
4910 free_lang_data_in_one_sizepos (&TYPE_SIZE_UNIT (type
));
4912 if (TYPE_CONTEXT (type
)
4913 && TREE_CODE (TYPE_CONTEXT (type
)) == BLOCK
)
4915 tree ctx
= TYPE_CONTEXT (type
);
4918 ctx
= BLOCK_SUPERCONTEXT (ctx
);
4920 while (ctx
&& TREE_CODE (ctx
) == BLOCK
);
4921 TYPE_CONTEXT (type
) = ctx
;
4926 /* Return true if DECL may need an assembler name to be set. */
4929 need_assembler_name_p (tree decl
)
4931 /* Only FUNCTION_DECLs and VAR_DECLs are considered. */
4932 if (TREE_CODE (decl
) != FUNCTION_DECL
4933 && TREE_CODE (decl
) != VAR_DECL
)
4936 /* If DECL already has its assembler name set, it does not need a
4938 if (!HAS_DECL_ASSEMBLER_NAME_P (decl
)
4939 || DECL_ASSEMBLER_NAME_SET_P (decl
))
4942 /* Abstract decls do not need an assembler name. */
4943 if (DECL_ABSTRACT (decl
))
4946 /* For VAR_DECLs, only static, public and external symbols need an
4948 if (TREE_CODE (decl
) == VAR_DECL
4949 && !TREE_STATIC (decl
)
4950 && !TREE_PUBLIC (decl
)
4951 && !DECL_EXTERNAL (decl
))
4954 if (TREE_CODE (decl
) == FUNCTION_DECL
)
4956 /* Do not set assembler name on builtins. Allow RTL expansion to
4957 decide whether to expand inline or via a regular call. */
4958 if (DECL_BUILT_IN (decl
)
4959 && DECL_BUILT_IN_CLASS (decl
) != BUILT_IN_FRONTEND
)
4962 /* Functions represented in the callgraph need an assembler name. */
4963 if (cgraph_get_node (decl
) != NULL
)
4966 /* Unused and not public functions don't need an assembler name. */
4967 if (!TREE_USED (decl
) && !TREE_PUBLIC (decl
))
4975 /* Reset all language specific information still present in symbol
4979 free_lang_data_in_decl (tree decl
)
4981 gcc_assert (DECL_P (decl
));
4983 /* Give the FE a chance to remove its own data first. */
4984 lang_hooks
.free_lang_data (decl
);
4986 TREE_LANG_FLAG_0 (decl
) = 0;
4987 TREE_LANG_FLAG_1 (decl
) = 0;
4988 TREE_LANG_FLAG_2 (decl
) = 0;
4989 TREE_LANG_FLAG_3 (decl
) = 0;
4990 TREE_LANG_FLAG_4 (decl
) = 0;
4991 TREE_LANG_FLAG_5 (decl
) = 0;
4992 TREE_LANG_FLAG_6 (decl
) = 0;
4994 free_lang_data_in_one_sizepos (&DECL_SIZE (decl
));
4995 free_lang_data_in_one_sizepos (&DECL_SIZE_UNIT (decl
));
4996 if (TREE_CODE (decl
) == FIELD_DECL
)
4998 free_lang_data_in_one_sizepos (&DECL_FIELD_OFFSET (decl
));
4999 if (TREE_CODE (DECL_CONTEXT (decl
)) == QUAL_UNION_TYPE
)
5000 DECL_QUALIFIER (decl
) = NULL_TREE
;
5003 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5005 struct cgraph_node
*node
;
5006 if (!(node
= cgraph_get_node (decl
))
5007 || (!node
->definition
&& !node
->clones
))
5010 cgraph_release_function_body (node
);
5013 release_function_body (decl
);
5014 DECL_ARGUMENTS (decl
) = NULL
;
5015 DECL_RESULT (decl
) = NULL
;
5016 DECL_INITIAL (decl
) = error_mark_node
;
5019 if (gimple_has_body_p (decl
))
5023 /* If DECL has a gimple body, then the context for its
5024 arguments must be DECL. Otherwise, it doesn't really
5025 matter, as we will not be emitting any code for DECL. In
5026 general, there may be other instances of DECL created by
5027 the front end and since PARM_DECLs are generally shared,
5028 their DECL_CONTEXT changes as the replicas of DECL are
5029 created. The only time where DECL_CONTEXT is important
5030 is for the FUNCTION_DECLs that have a gimple body (since
5031 the PARM_DECL will be used in the function's body). */
5032 for (t
= DECL_ARGUMENTS (decl
); t
; t
= TREE_CHAIN (t
))
5033 DECL_CONTEXT (t
) = decl
;
5036 /* DECL_SAVED_TREE holds the GENERIC representation for DECL.
5037 At this point, it is not needed anymore. */
5038 DECL_SAVED_TREE (decl
) = NULL_TREE
;
5040 /* Clear the abstract origin if it refers to a method. Otherwise
5041 dwarf2out.c will ICE as we clear TYPE_METHODS and thus the
5042 origin will not be output correctly. */
5043 if (DECL_ABSTRACT_ORIGIN (decl
)
5044 && DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))
5045 && RECORD_OR_UNION_TYPE_P
5046 (DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))))
5047 DECL_ABSTRACT_ORIGIN (decl
) = NULL_TREE
;
5049 /* Sometimes the C++ frontend doesn't manage to transform a temporary
5050 DECL_VINDEX referring to itself into a vtable slot number as it
5051 should. Happens with functions that are copied and then forgotten
5052 about. Just clear it, it won't matter anymore. */
5053 if (DECL_VINDEX (decl
) && !tree_fits_shwi_p (DECL_VINDEX (decl
)))
5054 DECL_VINDEX (decl
) = NULL_TREE
;
5056 else if (TREE_CODE (decl
) == VAR_DECL
)
5058 if ((DECL_EXTERNAL (decl
)
5059 && (!TREE_STATIC (decl
) || !TREE_READONLY (decl
)))
5060 || (decl_function_context (decl
) && !TREE_STATIC (decl
)))
5061 DECL_INITIAL (decl
) = NULL_TREE
;
5063 else if (TREE_CODE (decl
) == TYPE_DECL
5064 || TREE_CODE (decl
) == FIELD_DECL
)
5065 DECL_INITIAL (decl
) = NULL_TREE
;
5066 else if (TREE_CODE (decl
) == TRANSLATION_UNIT_DECL
5067 && DECL_INITIAL (decl
)
5068 && TREE_CODE (DECL_INITIAL (decl
)) == BLOCK
)
5070 /* Strip builtins from the translation-unit BLOCK. We still have targets
5071 without builtin_decl_explicit support and also builtins are shared
5072 nodes and thus we can't use TREE_CHAIN in multiple lists. */
5073 tree
*nextp
= &BLOCK_VARS (DECL_INITIAL (decl
));
5077 if (TREE_CODE (var
) == FUNCTION_DECL
5078 && DECL_BUILT_IN (var
))
5079 *nextp
= TREE_CHAIN (var
);
5081 nextp
= &TREE_CHAIN (var
);
5087 /* Data used when collecting DECLs and TYPEs for language data removal. */
5089 struct free_lang_data_d
5091 /* Worklist to avoid excessive recursion. */
5094 /* Set of traversed objects. Used to avoid duplicate visits. */
5095 struct pointer_set_t
*pset
;
5097 /* Array of symbols to process with free_lang_data_in_decl. */
5100 /* Array of types to process with free_lang_data_in_type. */
5105 /* Save all language fields needed to generate proper debug information
5106 for DECL. This saves most fields cleared out by free_lang_data_in_decl. */
5109 save_debug_info_for_decl (tree t
)
5111 /*struct saved_debug_info_d *sdi;*/
5113 gcc_assert (debug_info_level
> DINFO_LEVEL_TERSE
&& t
&& DECL_P (t
));
5115 /* FIXME. Partial implementation for saving debug info removed. */
5119 /* Save all language fields needed to generate proper debug information
5120 for TYPE. This saves most fields cleared out by free_lang_data_in_type. */
5123 save_debug_info_for_type (tree t
)
5125 /*struct saved_debug_info_d *sdi;*/
5127 gcc_assert (debug_info_level
> DINFO_LEVEL_TERSE
&& t
&& TYPE_P (t
));
5129 /* FIXME. Partial implementation for saving debug info removed. */
5133 /* Add type or decl T to one of the list of tree nodes that need their
5134 language data removed. The lists are held inside FLD. */
5137 add_tree_to_fld_list (tree t
, struct free_lang_data_d
*fld
)
5141 fld
->decls
.safe_push (t
);
5142 if (debug_info_level
> DINFO_LEVEL_TERSE
)
5143 save_debug_info_for_decl (t
);
5145 else if (TYPE_P (t
))
5147 fld
->types
.safe_push (t
);
5148 if (debug_info_level
> DINFO_LEVEL_TERSE
)
5149 save_debug_info_for_type (t
);
5155 /* Push tree node T into FLD->WORKLIST. */
5158 fld_worklist_push (tree t
, struct free_lang_data_d
*fld
)
5160 if (t
&& !is_lang_specific (t
) && !pointer_set_contains (fld
->pset
, t
))
5161 fld
->worklist
.safe_push ((t
));
5165 /* Operand callback helper for free_lang_data_in_node. *TP is the
5166 subtree operand being considered. */
5169 find_decls_types_r (tree
*tp
, int *ws
, void *data
)
5172 struct free_lang_data_d
*fld
= (struct free_lang_data_d
*) data
;
5174 if (TREE_CODE (t
) == TREE_LIST
)
5177 /* Language specific nodes will be removed, so there is no need
5178 to gather anything under them. */
5179 if (is_lang_specific (t
))
5187 /* Note that walk_tree does not traverse every possible field in
5188 decls, so we have to do our own traversals here. */
5189 add_tree_to_fld_list (t
, fld
);
5191 fld_worklist_push (DECL_NAME (t
), fld
);
5192 fld_worklist_push (DECL_CONTEXT (t
), fld
);
5193 fld_worklist_push (DECL_SIZE (t
), fld
);
5194 fld_worklist_push (DECL_SIZE_UNIT (t
), fld
);
5196 /* We are going to remove everything under DECL_INITIAL for
5197 TYPE_DECLs. No point walking them. */
5198 if (TREE_CODE (t
) != TYPE_DECL
)
5199 fld_worklist_push (DECL_INITIAL (t
), fld
);
5201 fld_worklist_push (DECL_ATTRIBUTES (t
), fld
);
5202 fld_worklist_push (DECL_ABSTRACT_ORIGIN (t
), fld
);
5204 if (TREE_CODE (t
) == FUNCTION_DECL
)
5206 fld_worklist_push (DECL_ARGUMENTS (t
), fld
);
5207 fld_worklist_push (DECL_RESULT (t
), fld
);
5209 else if (TREE_CODE (t
) == TYPE_DECL
)
5211 fld_worklist_push (DECL_ARGUMENT_FLD (t
), fld
);
5212 fld_worklist_push (DECL_VINDEX (t
), fld
);
5213 fld_worklist_push (DECL_ORIGINAL_TYPE (t
), fld
);
5215 else if (TREE_CODE (t
) == FIELD_DECL
)
5217 fld_worklist_push (DECL_FIELD_OFFSET (t
), fld
);
5218 fld_worklist_push (DECL_BIT_FIELD_TYPE (t
), fld
);
5219 fld_worklist_push (DECL_FIELD_BIT_OFFSET (t
), fld
);
5220 fld_worklist_push (DECL_FCONTEXT (t
), fld
);
5222 else if (TREE_CODE (t
) == VAR_DECL
)
5224 fld_worklist_push (DECL_SECTION_NAME (t
), fld
);
5225 fld_worklist_push (DECL_COMDAT_GROUP (t
), fld
);
5228 if ((TREE_CODE (t
) == VAR_DECL
|| TREE_CODE (t
) == PARM_DECL
)
5229 && DECL_HAS_VALUE_EXPR_P (t
))
5230 fld_worklist_push (DECL_VALUE_EXPR (t
), fld
);
5232 if (TREE_CODE (t
) != FIELD_DECL
5233 && TREE_CODE (t
) != TYPE_DECL
)
5234 fld_worklist_push (TREE_CHAIN (t
), fld
);
5237 else if (TYPE_P (t
))
5239 /* Note that walk_tree does not traverse every possible field in
5240 types, so we have to do our own traversals here. */
5241 add_tree_to_fld_list (t
, fld
);
5243 if (!RECORD_OR_UNION_TYPE_P (t
))
5244 fld_worklist_push (TYPE_CACHED_VALUES (t
), fld
);
5245 fld_worklist_push (TYPE_SIZE (t
), fld
);
5246 fld_worklist_push (TYPE_SIZE_UNIT (t
), fld
);
5247 fld_worklist_push (TYPE_ATTRIBUTES (t
), fld
);
5248 fld_worklist_push (TYPE_POINTER_TO (t
), fld
);
5249 fld_worklist_push (TYPE_REFERENCE_TO (t
), fld
);
5250 fld_worklist_push (TYPE_NAME (t
), fld
);
5251 /* Do not walk TYPE_NEXT_PTR_TO or TYPE_NEXT_REF_TO. We do not stream
5252 them and thus do not and want not to reach unused pointer types
5254 if (!POINTER_TYPE_P (t
))
5255 fld_worklist_push (TYPE_MINVAL (t
), fld
);
5256 if (!RECORD_OR_UNION_TYPE_P (t
))
5257 fld_worklist_push (TYPE_MAXVAL (t
), fld
);
5258 fld_worklist_push (TYPE_MAIN_VARIANT (t
), fld
);
5259 /* Do not walk TYPE_NEXT_VARIANT. We do not stream it and thus
5260 do not and want not to reach unused variants this way. */
5261 if (TYPE_CONTEXT (t
))
5263 tree ctx
= TYPE_CONTEXT (t
);
5264 /* We adjust BLOCK TYPE_CONTEXTs to the innermost non-BLOCK one.
5265 So push that instead. */
5266 while (ctx
&& TREE_CODE (ctx
) == BLOCK
)
5267 ctx
= BLOCK_SUPERCONTEXT (ctx
);
5268 fld_worklist_push (ctx
, fld
);
5270 /* Do not walk TYPE_CANONICAL. We do not stream it and thus do not
5271 and want not to reach unused types this way. */
5273 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_BINFO (t
))
5277 FOR_EACH_VEC_ELT (*BINFO_BASE_BINFOS (TYPE_BINFO (t
)), i
, tem
)
5278 fld_worklist_push (TREE_TYPE (tem
), fld
);
5279 tem
= BINFO_VIRTUALS (TYPE_BINFO (t
));
5281 /* The Java FE overloads BINFO_VIRTUALS for its own purpose. */
5282 && TREE_CODE (tem
) == TREE_LIST
)
5285 fld_worklist_push (TREE_VALUE (tem
), fld
);
5286 tem
= TREE_CHAIN (tem
);
5290 if (RECORD_OR_UNION_TYPE_P (t
))
5293 /* Push all TYPE_FIELDS - there can be interleaving interesting
5294 and non-interesting things. */
5295 tem
= TYPE_FIELDS (t
);
5298 if (TREE_CODE (tem
) == FIELD_DECL
5299 || TREE_CODE (tem
) == TYPE_DECL
)
5300 fld_worklist_push (tem
, fld
);
5301 tem
= TREE_CHAIN (tem
);
5305 fld_worklist_push (TYPE_STUB_DECL (t
), fld
);
5308 else if (TREE_CODE (t
) == BLOCK
)
5311 for (tem
= BLOCK_VARS (t
); tem
; tem
= TREE_CHAIN (tem
))
5312 fld_worklist_push (tem
, fld
);
5313 for (tem
= BLOCK_SUBBLOCKS (t
); tem
; tem
= BLOCK_CHAIN (tem
))
5314 fld_worklist_push (tem
, fld
);
5315 fld_worklist_push (BLOCK_ABSTRACT_ORIGIN (t
), fld
);
5318 if (TREE_CODE (t
) != IDENTIFIER_NODE
5319 && CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_TYPED
))
5320 fld_worklist_push (TREE_TYPE (t
), fld
);
5326 /* Find decls and types in T. */
5329 find_decls_types (tree t
, struct free_lang_data_d
*fld
)
5333 if (!pointer_set_contains (fld
->pset
, t
))
5334 walk_tree (&t
, find_decls_types_r
, fld
, fld
->pset
);
5335 if (fld
->worklist
.is_empty ())
5337 t
= fld
->worklist
.pop ();
5341 /* Translate all the types in LIST with the corresponding runtime
5345 get_eh_types_for_runtime (tree list
)
5349 if (list
== NULL_TREE
)
5352 head
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
5354 list
= TREE_CHAIN (list
);
5357 tree n
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
5358 TREE_CHAIN (prev
) = n
;
5359 prev
= TREE_CHAIN (prev
);
5360 list
= TREE_CHAIN (list
);
5367 /* Find decls and types referenced in EH region R and store them in
5368 FLD->DECLS and FLD->TYPES. */
5371 find_decls_types_in_eh_region (eh_region r
, struct free_lang_data_d
*fld
)
5382 /* The types referenced in each catch must first be changed to the
5383 EH types used at runtime. This removes references to FE types
5385 for (c
= r
->u
.eh_try
.first_catch
; c
; c
= c
->next_catch
)
5387 c
->type_list
= get_eh_types_for_runtime (c
->type_list
);
5388 walk_tree (&c
->type_list
, find_decls_types_r
, fld
, fld
->pset
);
5393 case ERT_ALLOWED_EXCEPTIONS
:
5394 r
->u
.allowed
.type_list
5395 = get_eh_types_for_runtime (r
->u
.allowed
.type_list
);
5396 walk_tree (&r
->u
.allowed
.type_list
, find_decls_types_r
, fld
, fld
->pset
);
5399 case ERT_MUST_NOT_THROW
:
5400 walk_tree (&r
->u
.must_not_throw
.failure_decl
,
5401 find_decls_types_r
, fld
, fld
->pset
);
5407 /* Find decls and types referenced in cgraph node N and store them in
5408 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
5409 look for *every* kind of DECL and TYPE node reachable from N,
5410 including those embedded inside types and decls (i.e,, TYPE_DECLs,
5411 NAMESPACE_DECLs, etc). */
5414 find_decls_types_in_node (struct cgraph_node
*n
, struct free_lang_data_d
*fld
)
5417 struct function
*fn
;
5421 find_decls_types (n
->decl
, fld
);
5423 if (!gimple_has_body_p (n
->decl
))
5426 gcc_assert (current_function_decl
== NULL_TREE
&& cfun
== NULL
);
5428 fn
= DECL_STRUCT_FUNCTION (n
->decl
);
5430 /* Traverse locals. */
5431 FOR_EACH_LOCAL_DECL (fn
, ix
, t
)
5432 find_decls_types (t
, fld
);
5434 /* Traverse EH regions in FN. */
5437 FOR_ALL_EH_REGION_FN (r
, fn
)
5438 find_decls_types_in_eh_region (r
, fld
);
5441 /* Traverse every statement in FN. */
5442 FOR_EACH_BB_FN (bb
, fn
)
5444 gimple_stmt_iterator si
;
5447 for (si
= gsi_start_phis (bb
); !gsi_end_p (si
); gsi_next (&si
))
5449 gimple phi
= gsi_stmt (si
);
5451 for (i
= 0; i
< gimple_phi_num_args (phi
); i
++)
5453 tree
*arg_p
= gimple_phi_arg_def_ptr (phi
, i
);
5454 find_decls_types (*arg_p
, fld
);
5458 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
5460 gimple stmt
= gsi_stmt (si
);
5462 if (is_gimple_call (stmt
))
5463 find_decls_types (gimple_call_fntype (stmt
), fld
);
5465 for (i
= 0; i
< gimple_num_ops (stmt
); i
++)
5467 tree arg
= gimple_op (stmt
, i
);
5468 find_decls_types (arg
, fld
);
5475 /* Find decls and types referenced in varpool node N and store them in
5476 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
5477 look for *every* kind of DECL and TYPE node reachable from N,
5478 including those embedded inside types and decls (i.e,, TYPE_DECLs,
5479 NAMESPACE_DECLs, etc). */
5482 find_decls_types_in_var (struct varpool_node
*v
, struct free_lang_data_d
*fld
)
5484 find_decls_types (v
->decl
, fld
);
5487 /* If T needs an assembler name, have one created for it. */
5490 assign_assembler_name_if_neeeded (tree t
)
5492 if (need_assembler_name_p (t
))
5494 /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit
5495 diagnostics that use input_location to show locus
5496 information. The problem here is that, at this point,
5497 input_location is generally anchored to the end of the file
5498 (since the parser is long gone), so we don't have a good
5499 position to pin it to.
5501 To alleviate this problem, this uses the location of T's
5502 declaration. Examples of this are
5503 testsuite/g++.dg/template/cond2.C and
5504 testsuite/g++.dg/template/pr35240.C. */
5505 location_t saved_location
= input_location
;
5506 input_location
= DECL_SOURCE_LOCATION (t
);
5508 decl_assembler_name (t
);
5510 input_location
= saved_location
;
5515 /* Free language specific information for every operand and expression
5516 in every node of the call graph. This process operates in three stages:
5518 1- Every callgraph node and varpool node is traversed looking for
5519 decls and types embedded in them. This is a more exhaustive
5520 search than that done by find_referenced_vars, because it will
5521 also collect individual fields, decls embedded in types, etc.
5523 2- All the decls found are sent to free_lang_data_in_decl.
5525 3- All the types found are sent to free_lang_data_in_type.
5527 The ordering between decls and types is important because
5528 free_lang_data_in_decl sets assembler names, which includes
5529 mangling. So types cannot be freed up until assembler names have
5533 free_lang_data_in_cgraph (void)
5535 struct cgraph_node
*n
;
5536 struct varpool_node
*v
;
5537 struct free_lang_data_d fld
;
5542 /* Initialize sets and arrays to store referenced decls and types. */
5543 fld
.pset
= pointer_set_create ();
5544 fld
.worklist
.create (0);
5545 fld
.decls
.create (100);
5546 fld
.types
.create (100);
5548 /* Find decls and types in the body of every function in the callgraph. */
5549 FOR_EACH_FUNCTION (n
)
5550 find_decls_types_in_node (n
, &fld
);
5552 FOR_EACH_VEC_SAFE_ELT (alias_pairs
, i
, p
)
5553 find_decls_types (p
->decl
, &fld
);
5555 /* Find decls and types in every varpool symbol. */
5556 FOR_EACH_VARIABLE (v
)
5557 find_decls_types_in_var (v
, &fld
);
5559 /* Set the assembler name on every decl found. We need to do this
5560 now because free_lang_data_in_decl will invalidate data needed
5561 for mangling. This breaks mangling on interdependent decls. */
5562 FOR_EACH_VEC_ELT (fld
.decls
, i
, t
)
5563 assign_assembler_name_if_neeeded (t
);
5565 /* Traverse every decl found freeing its language data. */
5566 FOR_EACH_VEC_ELT (fld
.decls
, i
, t
)
5567 free_lang_data_in_decl (t
);
5569 /* Traverse every type found freeing its language data. */
5570 FOR_EACH_VEC_ELT (fld
.types
, i
, t
)
5571 free_lang_data_in_type (t
);
5573 pointer_set_destroy (fld
.pset
);
5574 fld
.worklist
.release ();
5575 fld
.decls
.release ();
5576 fld
.types
.release ();
5580 /* Free resources that are used by FE but are not needed once they are done. */
5583 free_lang_data (void)
5587 /* If we are the LTO frontend we have freed lang-specific data already. */
5589 || !flag_generate_lto
)
5592 /* Allocate and assign alias sets to the standard integer types
5593 while the slots are still in the way the frontends generated them. */
5594 for (i
= 0; i
< itk_none
; ++i
)
5595 if (integer_types
[i
])
5596 TYPE_ALIAS_SET (integer_types
[i
]) = get_alias_set (integer_types
[i
]);
5598 /* Traverse the IL resetting language specific information for
5599 operands, expressions, etc. */
5600 free_lang_data_in_cgraph ();
5602 /* Create gimple variants for common types. */
5603 ptrdiff_type_node
= integer_type_node
;
5604 fileptr_type_node
= ptr_type_node
;
5606 /* Reset some langhooks. Do not reset types_compatible_p, it may
5607 still be used indirectly via the get_alias_set langhook. */
5608 lang_hooks
.dwarf_name
= lhd_dwarf_name
;
5609 lang_hooks
.decl_printable_name
= gimple_decl_printable_name
;
5610 /* We do not want the default decl_assembler_name implementation,
5611 rather if we have fixed everything we want a wrapper around it
5612 asserting that all non-local symbols already got their assembler
5613 name and only produce assembler names for local symbols. Or rather
5614 make sure we never call decl_assembler_name on local symbols and
5615 devise a separate, middle-end private scheme for it. */
5617 /* Reset diagnostic machinery. */
5618 tree_diagnostics_defaults (global_dc
);
5626 const pass_data pass_data_ipa_free_lang_data
=
5628 SIMPLE_IPA_PASS
, /* type */
5629 "*free_lang_data", /* name */
5630 OPTGROUP_NONE
, /* optinfo_flags */
5631 false, /* has_gate */
5632 true, /* has_execute */
5633 TV_IPA_FREE_LANG_DATA
, /* tv_id */
5634 0, /* properties_required */
5635 0, /* properties_provided */
5636 0, /* properties_destroyed */
5637 0, /* todo_flags_start */
5638 0, /* todo_flags_finish */
5641 class pass_ipa_free_lang_data
: public simple_ipa_opt_pass
5644 pass_ipa_free_lang_data (gcc::context
*ctxt
)
5645 : simple_ipa_opt_pass (pass_data_ipa_free_lang_data
, ctxt
)
5648 /* opt_pass methods: */
5649 unsigned int execute () { return free_lang_data (); }
5651 }; // class pass_ipa_free_lang_data
5655 simple_ipa_opt_pass
*
5656 make_pass_ipa_free_lang_data (gcc::context
*ctxt
)
5658 return new pass_ipa_free_lang_data (ctxt
);
5661 /* The backbone of is_attribute_p(). ATTR_LEN is the string length of
5662 ATTR_NAME. Also used internally by remove_attribute(). */
5664 private_is_attribute_p (const char *attr_name
, size_t attr_len
, const_tree ident
)
5666 size_t ident_len
= IDENTIFIER_LENGTH (ident
);
5668 if (ident_len
== attr_len
)
5670 if (strcmp (attr_name
, IDENTIFIER_POINTER (ident
)) == 0)
5673 else if (ident_len
== attr_len
+ 4)
5675 /* There is the possibility that ATTR is 'text' and IDENT is
5677 const char *p
= IDENTIFIER_POINTER (ident
);
5678 if (p
[0] == '_' && p
[1] == '_'
5679 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
5680 && strncmp (attr_name
, p
+ 2, attr_len
) == 0)
5687 /* The backbone of lookup_attribute(). ATTR_LEN is the string length
5688 of ATTR_NAME, and LIST is not NULL_TREE. */
5690 private_lookup_attribute (const char *attr_name
, size_t attr_len
, tree list
)
5694 size_t ident_len
= IDENTIFIER_LENGTH (get_attribute_name (list
));
5696 if (ident_len
== attr_len
)
5698 if (!strcmp (attr_name
,
5699 IDENTIFIER_POINTER (get_attribute_name (list
))))
5702 /* TODO: If we made sure that attributes were stored in the
5703 canonical form without '__...__' (ie, as in 'text' as opposed
5704 to '__text__') then we could avoid the following case. */
5705 else if (ident_len
== attr_len
+ 4)
5707 const char *p
= IDENTIFIER_POINTER (get_attribute_name (list
));
5708 if (p
[0] == '_' && p
[1] == '_'
5709 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
5710 && strncmp (attr_name
, p
+ 2, attr_len
) == 0)
5713 list
= TREE_CHAIN (list
);
5719 /* A variant of lookup_attribute() that can be used with an identifier
5720 as the first argument, and where the identifier can be either
5721 'text' or '__text__'.
5723 Given an attribute ATTR_IDENTIFIER, and a list of attributes LIST,
5724 return a pointer to the attribute's list element if the attribute
5725 is part of the list, or NULL_TREE if not found. If the attribute
5726 appears more than once, this only returns the first occurrence; the
5727 TREE_CHAIN of the return value should be passed back in if further
5728 occurrences are wanted. ATTR_IDENTIFIER must be an identifier but
5729 can be in the form 'text' or '__text__'. */
5731 lookup_ident_attribute (tree attr_identifier
, tree list
)
5733 gcc_checking_assert (TREE_CODE (attr_identifier
) == IDENTIFIER_NODE
);
5737 gcc_checking_assert (TREE_CODE (get_attribute_name (list
))
5738 == IDENTIFIER_NODE
);
5740 /* Identifiers can be compared directly for equality. */
5741 if (attr_identifier
== get_attribute_name (list
))
5744 /* If they are not equal, they may still be one in the form
5745 'text' while the other one is in the form '__text__'. TODO:
5746 If we were storing attributes in normalized 'text' form, then
5747 this could all go away and we could take full advantage of
5748 the fact that we're comparing identifiers. :-) */
5750 size_t attr_len
= IDENTIFIER_LENGTH (attr_identifier
);
5751 size_t ident_len
= IDENTIFIER_LENGTH (get_attribute_name (list
));
5753 if (ident_len
== attr_len
+ 4)
5755 const char *p
= IDENTIFIER_POINTER (get_attribute_name (list
));
5756 const char *q
= IDENTIFIER_POINTER (attr_identifier
);
5757 if (p
[0] == '_' && p
[1] == '_'
5758 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
5759 && strncmp (q
, p
+ 2, attr_len
) == 0)
5762 else if (ident_len
+ 4 == attr_len
)
5764 const char *p
= IDENTIFIER_POINTER (get_attribute_name (list
));
5765 const char *q
= IDENTIFIER_POINTER (attr_identifier
);
5766 if (q
[0] == '_' && q
[1] == '_'
5767 && q
[attr_len
- 2] == '_' && q
[attr_len
- 1] == '_'
5768 && strncmp (q
+ 2, p
, ident_len
) == 0)
5772 list
= TREE_CHAIN (list
);
5778 /* Remove any instances of attribute ATTR_NAME in LIST and return the
5782 remove_attribute (const char *attr_name
, tree list
)
5785 size_t attr_len
= strlen (attr_name
);
5787 gcc_checking_assert (attr_name
[0] != '_');
5789 for (p
= &list
; *p
; )
5792 /* TODO: If we were storing attributes in normalized form, here
5793 we could use a simple strcmp(). */
5794 if (private_is_attribute_p (attr_name
, attr_len
, get_attribute_name (l
)))
5795 *p
= TREE_CHAIN (l
);
5797 p
= &TREE_CHAIN (l
);
5803 /* Return an attribute list that is the union of a1 and a2. */
5806 merge_attributes (tree a1
, tree a2
)
5810 /* Either one unset? Take the set one. */
5812 if ((attributes
= a1
) == 0)
5815 /* One that completely contains the other? Take it. */
5817 else if (a2
!= 0 && ! attribute_list_contained (a1
, a2
))
5819 if (attribute_list_contained (a2
, a1
))
5823 /* Pick the longest list, and hang on the other list. */
5825 if (list_length (a1
) < list_length (a2
))
5826 attributes
= a2
, a2
= a1
;
5828 for (; a2
!= 0; a2
= TREE_CHAIN (a2
))
5831 for (a
= lookup_ident_attribute (get_attribute_name (a2
),
5833 a
!= NULL_TREE
&& !attribute_value_equal (a
, a2
);
5834 a
= lookup_ident_attribute (get_attribute_name (a2
),
5839 a1
= copy_node (a2
);
5840 TREE_CHAIN (a1
) = attributes
;
5849 /* Given types T1 and T2, merge their attributes and return
5853 merge_type_attributes (tree t1
, tree t2
)
5855 return merge_attributes (TYPE_ATTRIBUTES (t1
),
5856 TYPE_ATTRIBUTES (t2
));
5859 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
5863 merge_decl_attributes (tree olddecl
, tree newdecl
)
5865 return merge_attributes (DECL_ATTRIBUTES (olddecl
),
5866 DECL_ATTRIBUTES (newdecl
));
5869 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
5871 /* Specialization of merge_decl_attributes for various Windows targets.
5873 This handles the following situation:
5875 __declspec (dllimport) int foo;
5878 The second instance of `foo' nullifies the dllimport. */
5881 merge_dllimport_decl_attributes (tree old
, tree new_tree
)
5884 int delete_dllimport_p
= 1;
5886 /* What we need to do here is remove from `old' dllimport if it doesn't
5887 appear in `new'. dllimport behaves like extern: if a declaration is
5888 marked dllimport and a definition appears later, then the object
5889 is not dllimport'd. We also remove a `new' dllimport if the old list
5890 contains dllexport: dllexport always overrides dllimport, regardless
5891 of the order of declaration. */
5892 if (!VAR_OR_FUNCTION_DECL_P (new_tree
))
5893 delete_dllimport_p
= 0;
5894 else if (DECL_DLLIMPORT_P (new_tree
)
5895 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (old
)))
5897 DECL_DLLIMPORT_P (new_tree
) = 0;
5898 warning (OPT_Wattributes
, "%q+D already declared with dllexport attribute: "
5899 "dllimport ignored", new_tree
);
5901 else if (DECL_DLLIMPORT_P (old
) && !DECL_DLLIMPORT_P (new_tree
))
5903 /* Warn about overriding a symbol that has already been used, e.g.:
5904 extern int __attribute__ ((dllimport)) foo;
5905 int* bar () {return &foo;}
5908 if (TREE_USED (old
))
5910 warning (0, "%q+D redeclared without dllimport attribute "
5911 "after being referenced with dll linkage", new_tree
);
5912 /* If we have used a variable's address with dllimport linkage,
5913 keep the old DECL_DLLIMPORT_P flag: the ADDR_EXPR using the
5914 decl may already have had TREE_CONSTANT computed.
5915 We still remove the attribute so that assembler code refers
5916 to '&foo rather than '_imp__foo'. */
5917 if (TREE_CODE (old
) == VAR_DECL
&& TREE_ADDRESSABLE (old
))
5918 DECL_DLLIMPORT_P (new_tree
) = 1;
5921 /* Let an inline definition silently override the external reference,
5922 but otherwise warn about attribute inconsistency. */
5923 else if (TREE_CODE (new_tree
) == VAR_DECL
5924 || !DECL_DECLARED_INLINE_P (new_tree
))
5925 warning (OPT_Wattributes
, "%q+D redeclared without dllimport attribute: "
5926 "previous dllimport ignored", new_tree
);
5929 delete_dllimport_p
= 0;
5931 a
= merge_attributes (DECL_ATTRIBUTES (old
), DECL_ATTRIBUTES (new_tree
));
5933 if (delete_dllimport_p
)
5934 a
= remove_attribute ("dllimport", a
);
5939 /* Handle a "dllimport" or "dllexport" attribute; arguments as in
5940 struct attribute_spec.handler. */
5943 handle_dll_attribute (tree
* pnode
, tree name
, tree args
, int flags
,
5949 /* These attributes may apply to structure and union types being created,
5950 but otherwise should pass to the declaration involved. */
5953 if (flags
& ((int) ATTR_FLAG_DECL_NEXT
| (int) ATTR_FLAG_FUNCTION_NEXT
5954 | (int) ATTR_FLAG_ARRAY_NEXT
))
5956 *no_add_attrs
= true;
5957 return tree_cons (name
, args
, NULL_TREE
);
5959 if (TREE_CODE (node
) == RECORD_TYPE
5960 || TREE_CODE (node
) == UNION_TYPE
)
5962 node
= TYPE_NAME (node
);
5968 warning (OPT_Wattributes
, "%qE attribute ignored",
5970 *no_add_attrs
= true;
5975 if (TREE_CODE (node
) != FUNCTION_DECL
5976 && TREE_CODE (node
) != VAR_DECL
5977 && TREE_CODE (node
) != TYPE_DECL
)
5979 *no_add_attrs
= true;
5980 warning (OPT_Wattributes
, "%qE attribute ignored",
5985 if (TREE_CODE (node
) == TYPE_DECL
5986 && TREE_CODE (TREE_TYPE (node
)) != RECORD_TYPE
5987 && TREE_CODE (TREE_TYPE (node
)) != UNION_TYPE
)
5989 *no_add_attrs
= true;
5990 warning (OPT_Wattributes
, "%qE attribute ignored",
5995 is_dllimport
= is_attribute_p ("dllimport", name
);
5997 /* Report error on dllimport ambiguities seen now before they cause
6001 /* Honor any target-specific overrides. */
6002 if (!targetm
.valid_dllimport_attribute_p (node
))
6003 *no_add_attrs
= true;
6005 else if (TREE_CODE (node
) == FUNCTION_DECL
6006 && DECL_DECLARED_INLINE_P (node
))
6008 warning (OPT_Wattributes
, "inline function %q+D declared as "
6009 " dllimport: attribute ignored", node
);
6010 *no_add_attrs
= true;
6012 /* Like MS, treat definition of dllimported variables and
6013 non-inlined functions on declaration as syntax errors. */
6014 else if (TREE_CODE (node
) == FUNCTION_DECL
&& DECL_INITIAL (node
))
6016 error ("function %q+D definition is marked dllimport", node
);
6017 *no_add_attrs
= true;
6020 else if (TREE_CODE (node
) == VAR_DECL
)
6022 if (DECL_INITIAL (node
))
6024 error ("variable %q+D definition is marked dllimport",
6026 *no_add_attrs
= true;
6029 /* `extern' needn't be specified with dllimport.
6030 Specify `extern' now and hope for the best. Sigh. */
6031 DECL_EXTERNAL (node
) = 1;
6032 /* Also, implicitly give dllimport'd variables declared within
6033 a function global scope, unless declared static. */
6034 if (current_function_decl
!= NULL_TREE
&& !TREE_STATIC (node
))
6035 TREE_PUBLIC (node
) = 1;
6038 if (*no_add_attrs
== false)
6039 DECL_DLLIMPORT_P (node
) = 1;
6041 else if (TREE_CODE (node
) == FUNCTION_DECL
6042 && DECL_DECLARED_INLINE_P (node
)
6043 && flag_keep_inline_dllexport
)
6044 /* An exported function, even if inline, must be emitted. */
6045 DECL_EXTERNAL (node
) = 0;
6047 /* Report error if symbol is not accessible at global scope. */
6048 if (!TREE_PUBLIC (node
)
6049 && (TREE_CODE (node
) == VAR_DECL
6050 || TREE_CODE (node
) == FUNCTION_DECL
))
6052 error ("external linkage required for symbol %q+D because of "
6053 "%qE attribute", node
, name
);
6054 *no_add_attrs
= true;
6057 /* A dllexport'd entity must have default visibility so that other
6058 program units (shared libraries or the main executable) can see
6059 it. A dllimport'd entity must have default visibility so that
6060 the linker knows that undefined references within this program
6061 unit can be resolved by the dynamic linker. */
6064 if (DECL_VISIBILITY_SPECIFIED (node
)
6065 && DECL_VISIBILITY (node
) != VISIBILITY_DEFAULT
)
6066 error ("%qE implies default visibility, but %qD has already "
6067 "been declared with a different visibility",
6069 DECL_VISIBILITY (node
) = VISIBILITY_DEFAULT
;
6070 DECL_VISIBILITY_SPECIFIED (node
) = 1;
6076 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
6078 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
6079 of the various TYPE_QUAL values. */
6082 set_type_quals (tree type
, int type_quals
)
6084 TYPE_READONLY (type
) = (type_quals
& TYPE_QUAL_CONST
) != 0;
6085 TYPE_VOLATILE (type
) = (type_quals
& TYPE_QUAL_VOLATILE
) != 0;
6086 TYPE_RESTRICT (type
) = (type_quals
& TYPE_QUAL_RESTRICT
) != 0;
6087 TYPE_ATOMIC (type
) = (type_quals
& TYPE_QUAL_ATOMIC
) != 0;
6088 TYPE_ADDR_SPACE (type
) = DECODE_QUAL_ADDR_SPACE (type_quals
);
6091 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
6094 check_qualified_type (const_tree cand
, const_tree base
, int type_quals
)
6096 return (TYPE_QUALS (cand
) == type_quals
6097 && TYPE_NAME (cand
) == TYPE_NAME (base
)
6098 /* Apparently this is needed for Objective-C. */
6099 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
6100 /* Check alignment. */
6101 && TYPE_ALIGN (cand
) == TYPE_ALIGN (base
)
6102 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
6103 TYPE_ATTRIBUTES (base
)));
6106 /* Returns true iff CAND is equivalent to BASE with ALIGN. */
6109 check_aligned_type (const_tree cand
, const_tree base
, unsigned int align
)
6111 return (TYPE_QUALS (cand
) == TYPE_QUALS (base
)
6112 && TYPE_NAME (cand
) == TYPE_NAME (base
)
6113 /* Apparently this is needed for Objective-C. */
6114 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
6115 /* Check alignment. */
6116 && TYPE_ALIGN (cand
) == align
6117 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
6118 TYPE_ATTRIBUTES (base
)));
6121 /* This function checks to see if TYPE matches the size one of the built-in
6122 atomic types, and returns that core atomic type. */
6125 find_atomic_core_type (tree type
)
6127 tree base_atomic_type
;
6129 /* Only handle complete types. */
6130 if (TYPE_SIZE (type
) == NULL_TREE
)
6133 HOST_WIDE_INT type_size
= tree_to_uhwi (TYPE_SIZE (type
));
6137 base_atomic_type
= atomicQI_type_node
;
6141 base_atomic_type
= atomicHI_type_node
;
6145 base_atomic_type
= atomicSI_type_node
;
6149 base_atomic_type
= atomicDI_type_node
;
6153 base_atomic_type
= atomicTI_type_node
;
6157 base_atomic_type
= NULL_TREE
;
6160 return base_atomic_type
;
6163 /* Return a version of the TYPE, qualified as indicated by the
6164 TYPE_QUALS, if one exists. If no qualified version exists yet,
6165 return NULL_TREE. */
6168 get_qualified_type (tree type
, int type_quals
)
6172 if (TYPE_QUALS (type
) == type_quals
)
6175 /* Search the chain of variants to see if there is already one there just
6176 like the one we need to have. If so, use that existing one. We must
6177 preserve the TYPE_NAME, since there is code that depends on this. */
6178 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
6179 if (check_qualified_type (t
, type
, type_quals
))
6185 /* Like get_qualified_type, but creates the type if it does not
6186 exist. This function never returns NULL_TREE. */
6189 build_qualified_type (tree type
, int type_quals
)
6193 /* See if we already have the appropriate qualified variant. */
6194 t
= get_qualified_type (type
, type_quals
);
6196 /* If not, build it. */
6199 t
= build_variant_type_copy (type
);
6200 set_type_quals (t
, type_quals
);
6202 if (((type_quals
& TYPE_QUAL_ATOMIC
) == TYPE_QUAL_ATOMIC
))
6204 /* See if this object can map to a basic atomic type. */
6205 tree atomic_type
= find_atomic_core_type (type
);
6208 /* Ensure the alignment of this type is compatible with
6209 the required alignment of the atomic type. */
6210 if (TYPE_ALIGN (atomic_type
) > TYPE_ALIGN (t
))
6211 TYPE_ALIGN (t
) = TYPE_ALIGN (atomic_type
);
6215 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
6216 /* Propagate structural equality. */
6217 SET_TYPE_STRUCTURAL_EQUALITY (t
);
6218 else if (TYPE_CANONICAL (type
) != type
)
6219 /* Build the underlying canonical type, since it is different
6221 TYPE_CANONICAL (t
) = build_qualified_type (TYPE_CANONICAL (type
),
6224 /* T is its own canonical type. */
6225 TYPE_CANONICAL (t
) = t
;
6232 /* Create a variant of type T with alignment ALIGN. */
6235 build_aligned_type (tree type
, unsigned int align
)
6239 if (TYPE_PACKED (type
)
6240 || TYPE_ALIGN (type
) == align
)
6243 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
6244 if (check_aligned_type (t
, type
, align
))
6247 t
= build_variant_type_copy (type
);
6248 TYPE_ALIGN (t
) = align
;
6253 /* Create a new distinct copy of TYPE. The new type is made its own
6254 MAIN_VARIANT. If TYPE requires structural equality checks, the
6255 resulting type requires structural equality checks; otherwise, its
6256 TYPE_CANONICAL points to itself. */
6259 build_distinct_type_copy (tree type
)
6261 tree t
= copy_node (type
);
6263 TYPE_POINTER_TO (t
) = 0;
6264 TYPE_REFERENCE_TO (t
) = 0;
6266 /* Set the canonical type either to a new equivalence class, or
6267 propagate the need for structural equality checks. */
6268 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
6269 SET_TYPE_STRUCTURAL_EQUALITY (t
);
6271 TYPE_CANONICAL (t
) = t
;
6273 /* Make it its own variant. */
6274 TYPE_MAIN_VARIANT (t
) = t
;
6275 TYPE_NEXT_VARIANT (t
) = 0;
6277 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
6278 whose TREE_TYPE is not t. This can also happen in the Ada
6279 frontend when using subtypes. */
6284 /* Create a new variant of TYPE, equivalent but distinct. This is so
6285 the caller can modify it. TYPE_CANONICAL for the return type will
6286 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
6287 are considered equal by the language itself (or that both types
6288 require structural equality checks). */
6291 build_variant_type_copy (tree type
)
6293 tree t
, m
= TYPE_MAIN_VARIANT (type
);
6295 t
= build_distinct_type_copy (type
);
6297 /* Since we're building a variant, assume that it is a non-semantic
6298 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
6299 TYPE_CANONICAL (t
) = TYPE_CANONICAL (type
);
6301 /* Add the new type to the chain of variants of TYPE. */
6302 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (m
);
6303 TYPE_NEXT_VARIANT (m
) = t
;
6304 TYPE_MAIN_VARIANT (t
) = m
;
6309 /* Return true if the from tree in both tree maps are equal. */
6312 tree_map_base_eq (const void *va
, const void *vb
)
6314 const struct tree_map_base
*const a
= (const struct tree_map_base
*) va
,
6315 *const b
= (const struct tree_map_base
*) vb
;
6316 return (a
->from
== b
->from
);
6319 /* Hash a from tree in a tree_base_map. */
6322 tree_map_base_hash (const void *item
)
6324 return htab_hash_pointer (((const struct tree_map_base
*)item
)->from
);
6327 /* Return true if this tree map structure is marked for garbage collection
6328 purposes. We simply return true if the from tree is marked, so that this
6329 structure goes away when the from tree goes away. */
6332 tree_map_base_marked_p (const void *p
)
6334 return ggc_marked_p (((const struct tree_map_base
*) p
)->from
);
6337 /* Hash a from tree in a tree_map. */
6340 tree_map_hash (const void *item
)
6342 return (((const struct tree_map
*) item
)->hash
);
6345 /* Hash a from tree in a tree_decl_map. */
6348 tree_decl_map_hash (const void *item
)
6350 return DECL_UID (((const struct tree_decl_map
*) item
)->base
.from
);
6353 /* Return the initialization priority for DECL. */
6356 decl_init_priority_lookup (tree decl
)
6358 struct tree_priority_map
*h
;
6359 struct tree_map_base in
;
6361 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl
));
6363 h
= (struct tree_priority_map
*) htab_find (init_priority_for_decl
, &in
);
6364 return h
? h
->init
: DEFAULT_INIT_PRIORITY
;
6367 /* Return the finalization priority for DECL. */
6370 decl_fini_priority_lookup (tree decl
)
6372 struct tree_priority_map
*h
;
6373 struct tree_map_base in
;
6375 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
6377 h
= (struct tree_priority_map
*) htab_find (init_priority_for_decl
, &in
);
6378 return h
? h
->fini
: DEFAULT_INIT_PRIORITY
;
6381 /* Return the initialization and finalization priority information for
6382 DECL. If there is no previous priority information, a freshly
6383 allocated structure is returned. */
6385 static struct tree_priority_map
*
6386 decl_priority_info (tree decl
)
6388 struct tree_priority_map in
;
6389 struct tree_priority_map
*h
;
6392 in
.base
.from
= decl
;
6393 loc
= htab_find_slot (init_priority_for_decl
, &in
, INSERT
);
6394 h
= (struct tree_priority_map
*) *loc
;
6397 h
= ggc_alloc_cleared_tree_priority_map ();
6399 h
->base
.from
= decl
;
6400 h
->init
= DEFAULT_INIT_PRIORITY
;
6401 h
->fini
= DEFAULT_INIT_PRIORITY
;
6407 /* Set the initialization priority for DECL to PRIORITY. */
6410 decl_init_priority_insert (tree decl
, priority_type priority
)
6412 struct tree_priority_map
*h
;
6414 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl
));
6415 if (priority
== DEFAULT_INIT_PRIORITY
)
6417 h
= decl_priority_info (decl
);
6421 /* Set the finalization priority for DECL to PRIORITY. */
6424 decl_fini_priority_insert (tree decl
, priority_type priority
)
6426 struct tree_priority_map
*h
;
6428 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
6429 if (priority
== DEFAULT_INIT_PRIORITY
)
6431 h
= decl_priority_info (decl
);
6435 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
6438 print_debug_expr_statistics (void)
6440 fprintf (stderr
, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
6441 (long) htab_size (debug_expr_for_decl
),
6442 (long) htab_elements (debug_expr_for_decl
),
6443 htab_collisions (debug_expr_for_decl
));
6446 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
6449 print_value_expr_statistics (void)
6451 fprintf (stderr
, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
6452 (long) htab_size (value_expr_for_decl
),
6453 (long) htab_elements (value_expr_for_decl
),
6454 htab_collisions (value_expr_for_decl
));
6457 /* Lookup a debug expression for FROM, and return it if we find one. */
6460 decl_debug_expr_lookup (tree from
)
6462 struct tree_decl_map
*h
, in
;
6463 in
.base
.from
= from
;
6465 h
= (struct tree_decl_map
*)
6466 htab_find_with_hash (debug_expr_for_decl
, &in
, DECL_UID (from
));
6472 /* Insert a mapping FROM->TO in the debug expression hashtable. */
6475 decl_debug_expr_insert (tree from
, tree to
)
6477 struct tree_decl_map
*h
;
6480 h
= ggc_alloc_tree_decl_map ();
6481 h
->base
.from
= from
;
6483 loc
= htab_find_slot_with_hash (debug_expr_for_decl
, h
, DECL_UID (from
),
6485 *(struct tree_decl_map
**) loc
= h
;
6488 /* Lookup a value expression for FROM, and return it if we find one. */
6491 decl_value_expr_lookup (tree from
)
6493 struct tree_decl_map
*h
, in
;
6494 in
.base
.from
= from
;
6496 h
= (struct tree_decl_map
*)
6497 htab_find_with_hash (value_expr_for_decl
, &in
, DECL_UID (from
));
6503 /* Insert a mapping FROM->TO in the value expression hashtable. */
6506 decl_value_expr_insert (tree from
, tree to
)
6508 struct tree_decl_map
*h
;
6511 h
= ggc_alloc_tree_decl_map ();
6512 h
->base
.from
= from
;
6514 loc
= htab_find_slot_with_hash (value_expr_for_decl
, h
, DECL_UID (from
),
6516 *(struct tree_decl_map
**) loc
= h
;
6519 /* Lookup a vector of debug arguments for FROM, and return it if we
6523 decl_debug_args_lookup (tree from
)
6525 struct tree_vec_map
*h
, in
;
6527 if (!DECL_HAS_DEBUG_ARGS_P (from
))
6529 gcc_checking_assert (debug_args_for_decl
!= NULL
);
6530 in
.base
.from
= from
;
6531 h
= (struct tree_vec_map
*)
6532 htab_find_with_hash (debug_args_for_decl
, &in
, DECL_UID (from
));
6538 /* Insert a mapping FROM->empty vector of debug arguments in the value
6539 expression hashtable. */
6542 decl_debug_args_insert (tree from
)
6544 struct tree_vec_map
*h
;
6547 if (DECL_HAS_DEBUG_ARGS_P (from
))
6548 return decl_debug_args_lookup (from
);
6549 if (debug_args_for_decl
== NULL
)
6550 debug_args_for_decl
= htab_create_ggc (64, tree_vec_map_hash
,
6551 tree_vec_map_eq
, 0);
6552 h
= ggc_alloc_tree_vec_map ();
6553 h
->base
.from
= from
;
6555 loc
= htab_find_slot_with_hash (debug_args_for_decl
, h
, DECL_UID (from
),
6557 *(struct tree_vec_map
**) loc
= h
;
6558 DECL_HAS_DEBUG_ARGS_P (from
) = 1;
6562 /* Hashing of types so that we don't make duplicates.
6563 The entry point is `type_hash_canon'. */
6565 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
6566 with types in the TREE_VALUE slots), by adding the hash codes
6567 of the individual types. */
6570 type_hash_list (const_tree list
, hashval_t hashcode
)
6574 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
6575 if (TREE_VALUE (tail
) != error_mark_node
)
6576 hashcode
= iterative_hash_object (TYPE_HASH (TREE_VALUE (tail
)),
6582 /* These are the Hashtable callback functions. */
6584 /* Returns true iff the types are equivalent. */
6587 type_hash_eq (const void *va
, const void *vb
)
6589 const struct type_hash
*const a
= (const struct type_hash
*) va
,
6590 *const b
= (const struct type_hash
*) vb
;
6592 /* First test the things that are the same for all types. */
6593 if (a
->hash
!= b
->hash
6594 || TREE_CODE (a
->type
) != TREE_CODE (b
->type
)
6595 || TREE_TYPE (a
->type
) != TREE_TYPE (b
->type
)
6596 || !attribute_list_equal (TYPE_ATTRIBUTES (a
->type
),
6597 TYPE_ATTRIBUTES (b
->type
))
6598 || (TREE_CODE (a
->type
) != COMPLEX_TYPE
6599 && TYPE_NAME (a
->type
) != TYPE_NAME (b
->type
)))
6602 /* Be careful about comparing arrays before and after the element type
6603 has been completed; don't compare TYPE_ALIGN unless both types are
6605 if (COMPLETE_TYPE_P (a
->type
) && COMPLETE_TYPE_P (b
->type
)
6606 && (TYPE_ALIGN (a
->type
) != TYPE_ALIGN (b
->type
)
6607 || TYPE_MODE (a
->type
) != TYPE_MODE (b
->type
)))
6610 switch (TREE_CODE (a
->type
))
6615 case REFERENCE_TYPE
:
6620 return TYPE_VECTOR_SUBPARTS (a
->type
) == TYPE_VECTOR_SUBPARTS (b
->type
);
6623 if (TYPE_VALUES (a
->type
) != TYPE_VALUES (b
->type
)
6624 && !(TYPE_VALUES (a
->type
)
6625 && TREE_CODE (TYPE_VALUES (a
->type
)) == TREE_LIST
6626 && TYPE_VALUES (b
->type
)
6627 && TREE_CODE (TYPE_VALUES (b
->type
)) == TREE_LIST
6628 && type_list_equal (TYPE_VALUES (a
->type
),
6629 TYPE_VALUES (b
->type
))))
6632 /* ... fall through ... */
6637 if (TYPE_PRECISION (a
->type
) != TYPE_PRECISION (b
->type
))
6639 return ((TYPE_MAX_VALUE (a
->type
) == TYPE_MAX_VALUE (b
->type
)
6640 || tree_int_cst_equal (TYPE_MAX_VALUE (a
->type
),
6641 TYPE_MAX_VALUE (b
->type
)))
6642 && (TYPE_MIN_VALUE (a
->type
) == TYPE_MIN_VALUE (b
->type
)
6643 || tree_int_cst_equal (TYPE_MIN_VALUE (a
->type
),
6644 TYPE_MIN_VALUE (b
->type
))));
6646 case FIXED_POINT_TYPE
:
6647 return TYPE_SATURATING (a
->type
) == TYPE_SATURATING (b
->type
);
6650 return TYPE_OFFSET_BASETYPE (a
->type
) == TYPE_OFFSET_BASETYPE (b
->type
);
6653 if (TYPE_METHOD_BASETYPE (a
->type
) == TYPE_METHOD_BASETYPE (b
->type
)
6654 && (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
6655 || (TYPE_ARG_TYPES (a
->type
)
6656 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
6657 && TYPE_ARG_TYPES (b
->type
)
6658 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
6659 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
6660 TYPE_ARG_TYPES (b
->type
)))))
6664 return TYPE_DOMAIN (a
->type
) == TYPE_DOMAIN (b
->type
);
6668 case QUAL_UNION_TYPE
:
6669 return (TYPE_FIELDS (a
->type
) == TYPE_FIELDS (b
->type
)
6670 || (TYPE_FIELDS (a
->type
)
6671 && TREE_CODE (TYPE_FIELDS (a
->type
)) == TREE_LIST
6672 && TYPE_FIELDS (b
->type
)
6673 && TREE_CODE (TYPE_FIELDS (b
->type
)) == TREE_LIST
6674 && type_list_equal (TYPE_FIELDS (a
->type
),
6675 TYPE_FIELDS (b
->type
))));
6678 if (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
6679 || (TYPE_ARG_TYPES (a
->type
)
6680 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
6681 && TYPE_ARG_TYPES (b
->type
)
6682 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
6683 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
6684 TYPE_ARG_TYPES (b
->type
))))
6692 if (lang_hooks
.types
.type_hash_eq
!= NULL
)
6693 return lang_hooks
.types
.type_hash_eq (a
->type
, b
->type
);
6698 /* Return the cached hash value. */
6701 type_hash_hash (const void *item
)
6703 return ((const struct type_hash
*) item
)->hash
;
6706 /* Look in the type hash table for a type isomorphic to TYPE.
6707 If one is found, return it. Otherwise return 0. */
6710 type_hash_lookup (hashval_t hashcode
, tree type
)
6712 struct type_hash
*h
, in
;
6714 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
6715 must call that routine before comparing TYPE_ALIGNs. */
6721 h
= (struct type_hash
*) htab_find_with_hash (type_hash_table
, &in
,
6728 /* Add an entry to the type-hash-table
6729 for a type TYPE whose hash code is HASHCODE. */
6732 type_hash_add (hashval_t hashcode
, tree type
)
6734 struct type_hash
*h
;
6737 h
= ggc_alloc_type_hash ();
6740 loc
= htab_find_slot_with_hash (type_hash_table
, h
, hashcode
, INSERT
);
6744 /* Given TYPE, and HASHCODE its hash code, return the canonical
6745 object for an identical type if one already exists.
6746 Otherwise, return TYPE, and record it as the canonical object.
6748 To use this function, first create a type of the sort you want.
6749 Then compute its hash code from the fields of the type that
6750 make it different from other similar types.
6751 Then call this function and use the value. */
6754 type_hash_canon (unsigned int hashcode
, tree type
)
6758 /* The hash table only contains main variants, so ensure that's what we're
6760 gcc_assert (TYPE_MAIN_VARIANT (type
) == type
);
6762 /* See if the type is in the hash table already. If so, return it.
6763 Otherwise, add the type. */
6764 t1
= type_hash_lookup (hashcode
, type
);
6767 if (GATHER_STATISTICS
)
6769 tree_code_counts
[(int) TREE_CODE (type
)]--;
6770 tree_node_counts
[(int) t_kind
]--;
6771 tree_node_sizes
[(int) t_kind
] -= sizeof (struct tree_type_non_common
);
6777 type_hash_add (hashcode
, type
);
6782 /* See if the data pointed to by the type hash table is marked. We consider
6783 it marked if the type is marked or if a debug type number or symbol
6784 table entry has been made for the type. */
6787 type_hash_marked_p (const void *p
)
6789 const_tree
const type
= ((const struct type_hash
*) p
)->type
;
6791 return ggc_marked_p (type
);
6795 print_type_hash_statistics (void)
6797 fprintf (stderr
, "Type hash: size %ld, %ld elements, %f collisions\n",
6798 (long) htab_size (type_hash_table
),
6799 (long) htab_elements (type_hash_table
),
6800 htab_collisions (type_hash_table
));
6803 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
6804 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
6805 by adding the hash codes of the individual attributes. */
6808 attribute_hash_list (const_tree list
, hashval_t hashcode
)
6812 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
6813 /* ??? Do we want to add in TREE_VALUE too? */
6814 hashcode
= iterative_hash_object
6815 (IDENTIFIER_HASH_VALUE (get_attribute_name (tail
)), hashcode
);
6819 /* Given two lists of attributes, return true if list l2 is
6820 equivalent to l1. */
6823 attribute_list_equal (const_tree l1
, const_tree l2
)
6828 return attribute_list_contained (l1
, l2
)
6829 && attribute_list_contained (l2
, l1
);
6832 /* Given two lists of attributes, return true if list L2 is
6833 completely contained within L1. */
6834 /* ??? This would be faster if attribute names were stored in a canonicalized
6835 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
6836 must be used to show these elements are equivalent (which they are). */
6837 /* ??? It's not clear that attributes with arguments will always be handled
6841 attribute_list_contained (const_tree l1
, const_tree l2
)
6845 /* First check the obvious, maybe the lists are identical. */
6849 /* Maybe the lists are similar. */
6850 for (t1
= l1
, t2
= l2
;
6852 && get_attribute_name (t1
) == get_attribute_name (t2
)
6853 && TREE_VALUE (t1
) == TREE_VALUE (t2
);
6854 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
6857 /* Maybe the lists are equal. */
6858 if (t1
== 0 && t2
== 0)
6861 for (; t2
!= 0; t2
= TREE_CHAIN (t2
))
6864 /* This CONST_CAST is okay because lookup_attribute does not
6865 modify its argument and the return value is assigned to a
6867 for (attr
= lookup_ident_attribute (get_attribute_name (t2
),
6868 CONST_CAST_TREE (l1
));
6869 attr
!= NULL_TREE
&& !attribute_value_equal (t2
, attr
);
6870 attr
= lookup_ident_attribute (get_attribute_name (t2
),
6874 if (attr
== NULL_TREE
)
6881 /* Given two lists of types
6882 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
6883 return 1 if the lists contain the same types in the same order.
6884 Also, the TREE_PURPOSEs must match. */
6887 type_list_equal (const_tree l1
, const_tree l2
)
6891 for (t1
= l1
, t2
= l2
; t1
&& t2
; t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
6892 if (TREE_VALUE (t1
) != TREE_VALUE (t2
)
6893 || (TREE_PURPOSE (t1
) != TREE_PURPOSE (t2
)
6894 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
))
6895 && (TREE_TYPE (TREE_PURPOSE (t1
))
6896 == TREE_TYPE (TREE_PURPOSE (t2
))))))
6902 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
6903 given by TYPE. If the argument list accepts variable arguments,
6904 then this function counts only the ordinary arguments. */
6907 type_num_arguments (const_tree type
)
6912 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
6913 /* If the function does not take a variable number of arguments,
6914 the last element in the list will have type `void'. */
6915 if (VOID_TYPE_P (TREE_VALUE (t
)))
6923 /* Nonzero if integer constants T1 and T2
6924 represent the same constant value. */
6927 tree_int_cst_equal (const_tree t1
, const_tree t2
)
6932 if (t1
== 0 || t2
== 0)
6935 if (TREE_CODE (t1
) == INTEGER_CST
6936 && TREE_CODE (t2
) == INTEGER_CST
6937 && wi::to_widest (t1
) == wi::to_widest (t2
))
6943 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
6944 The precise way of comparison depends on their data type. */
6947 tree_int_cst_lt (const_tree t1
, const_tree t2
)
6949 return INT_CST_LT (t1
, t2
);
6952 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. */
6955 tree_int_cst_compare (const_tree t1
, const_tree t2
)
6957 return wi::cmps (wi::to_widest (t1
), wi::to_widest (t2
));
6960 /* Return the most significant (sign) bit of T. */
6963 tree_int_cst_sign_bit (const_tree t
)
6965 unsigned bitno
= TYPE_PRECISION (TREE_TYPE (t
)) - 1;
6967 return wi::extract_uhwi (t
, bitno
, 1);
6970 /* Return an indication of the sign of the integer constant T.
6971 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
6972 Note that -1 will never be returned if T's type is unsigned. */
6975 tree_int_cst_sgn (const_tree t
)
6977 if (wi::eq_p (t
, 0))
6979 else if (TYPE_UNSIGNED (TREE_TYPE (t
)))
6981 else if (wi::neg_p (t
))
6987 /* Return the minimum number of bits needed to represent VALUE in a
6988 signed or unsigned type, UNSIGNEDP says which. */
6991 tree_int_cst_min_precision (tree value
, signop sgn
)
6993 /* If the value is negative, compute its negative minus 1. The latter
6994 adjustment is because the absolute value of the largest negative value
6995 is one larger than the largest positive value. This is equivalent to
6996 a bit-wise negation, so use that operation instead. */
6998 if (tree_int_cst_sgn (value
) < 0)
6999 value
= fold_build1 (BIT_NOT_EXPR
, TREE_TYPE (value
), value
);
7001 /* Return the number of bits needed, taking into account the fact
7002 that we need one more bit for a signed than unsigned type.
7003 If value is 0 or -1, the minimum precision is 1 no matter
7004 whether unsignedp is true or false. */
7006 if (integer_zerop (value
))
7009 return tree_floor_log2 (value
) + 1 + (sgn
== SIGNED
? 1 : 0) ;
7012 /* Return truthvalue of whether T1 is the same tree structure as T2.
7013 Return 1 if they are the same.
7014 Return 0 if they are understandably different.
7015 Return -1 if either contains tree structure not understood by
7019 simple_cst_equal (const_tree t1
, const_tree t2
)
7021 enum tree_code code1
, code2
;
7027 if (t1
== 0 || t2
== 0)
7030 code1
= TREE_CODE (t1
);
7031 code2
= TREE_CODE (t2
);
7033 if (CONVERT_EXPR_CODE_P (code1
) || code1
== NON_LVALUE_EXPR
)
7035 if (CONVERT_EXPR_CODE_P (code2
)
7036 || code2
== NON_LVALUE_EXPR
)
7037 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7039 return simple_cst_equal (TREE_OPERAND (t1
, 0), t2
);
7042 else if (CONVERT_EXPR_CODE_P (code2
)
7043 || code2
== NON_LVALUE_EXPR
)
7044 return simple_cst_equal (t1
, TREE_OPERAND (t2
, 0));
7052 return wi::to_widest (t1
) == wi::to_widest (t2
);
7055 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1
), TREE_REAL_CST (t2
));
7058 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1
), TREE_FIXED_CST (t2
));
7061 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
7062 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
7063 TREE_STRING_LENGTH (t1
)));
7067 unsigned HOST_WIDE_INT idx
;
7068 vec
<constructor_elt
, va_gc
> *v1
= CONSTRUCTOR_ELTS (t1
);
7069 vec
<constructor_elt
, va_gc
> *v2
= CONSTRUCTOR_ELTS (t2
);
7071 if (vec_safe_length (v1
) != vec_safe_length (v2
))
7074 for (idx
= 0; idx
< vec_safe_length (v1
); ++idx
)
7075 /* ??? Should we handle also fields here? */
7076 if (!simple_cst_equal ((*v1
)[idx
].value
, (*v2
)[idx
].value
))
7082 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7085 cmp
= simple_cst_equal (CALL_EXPR_FN (t1
), CALL_EXPR_FN (t2
));
7088 if (call_expr_nargs (t1
) != call_expr_nargs (t2
))
7091 const_tree arg1
, arg2
;
7092 const_call_expr_arg_iterator iter1
, iter2
;
7093 for (arg1
= first_const_call_expr_arg (t1
, &iter1
),
7094 arg2
= first_const_call_expr_arg (t2
, &iter2
);
7096 arg1
= next_const_call_expr_arg (&iter1
),
7097 arg2
= next_const_call_expr_arg (&iter2
))
7099 cmp
= simple_cst_equal (arg1
, arg2
);
7103 return arg1
== arg2
;
7107 /* Special case: if either target is an unallocated VAR_DECL,
7108 it means that it's going to be unified with whatever the
7109 TARGET_EXPR is really supposed to initialize, so treat it
7110 as being equivalent to anything. */
7111 if ((TREE_CODE (TREE_OPERAND (t1
, 0)) == VAR_DECL
7112 && DECL_NAME (TREE_OPERAND (t1
, 0)) == NULL_TREE
7113 && !DECL_RTL_SET_P (TREE_OPERAND (t1
, 0)))
7114 || (TREE_CODE (TREE_OPERAND (t2
, 0)) == VAR_DECL
7115 && DECL_NAME (TREE_OPERAND (t2
, 0)) == NULL_TREE
7116 && !DECL_RTL_SET_P (TREE_OPERAND (t2
, 0))))
7119 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7124 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
7126 case WITH_CLEANUP_EXPR
:
7127 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7131 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t1
, 1));
7134 if (TREE_OPERAND (t1
, 1) == TREE_OPERAND (t2
, 1))
7135 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7149 /* This general rule works for most tree codes. All exceptions should be
7150 handled above. If this is a language-specific tree code, we can't
7151 trust what might be in the operand, so say we don't know
7153 if ((int) code1
>= (int) LAST_AND_UNUSED_TREE_CODE
)
7156 switch (TREE_CODE_CLASS (code1
))
7160 case tcc_comparison
:
7161 case tcc_expression
:
7165 for (i
= 0; i
< TREE_CODE_LENGTH (code1
); i
++)
7167 cmp
= simple_cst_equal (TREE_OPERAND (t1
, i
), TREE_OPERAND (t2
, i
));
7179 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
7180 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
7181 than U, respectively. */
7184 compare_tree_int (const_tree t
, unsigned HOST_WIDE_INT u
)
7186 if (tree_int_cst_sgn (t
) < 0)
7188 else if (!cst_fits_uhwi_p (t
))
7190 else if ((unsigned HOST_WIDE_INT
) tree_to_hwi (t
) == u
)
7192 else if ((unsigned HOST_WIDE_INT
) tree_to_hwi (t
) < u
)
7198 /* Return true if SIZE represents a constant size that is in bounds of
7199 what the middle-end and the backend accepts (covering not more than
7200 half of the address-space). */
7203 valid_constant_size_p (const_tree size
)
7205 if (! tree_fits_uhwi_p (size
)
7206 || TREE_OVERFLOW (size
)
7207 || tree_int_cst_sign_bit (size
) != 0)
7212 /* Return the precision of the type, or for a complex or vector type the
7213 precision of the type of its elements. */
7216 element_precision (const_tree type
)
7218 enum tree_code code
= TREE_CODE (type
);
7219 if (code
== COMPLEX_TYPE
|| code
== VECTOR_TYPE
)
7220 type
= TREE_TYPE (type
);
7222 return TYPE_PRECISION (type
);
7225 /* Return true if CODE represents an associative tree code. Otherwise
7228 associative_tree_code (enum tree_code code
)
7247 /* Return true if CODE represents a commutative tree code. Otherwise
7250 commutative_tree_code (enum tree_code code
)
7256 case MULT_HIGHPART_EXPR
:
7264 case UNORDERED_EXPR
:
7268 case TRUTH_AND_EXPR
:
7269 case TRUTH_XOR_EXPR
:
7271 case WIDEN_MULT_EXPR
:
7272 case VEC_WIDEN_MULT_HI_EXPR
:
7273 case VEC_WIDEN_MULT_LO_EXPR
:
7274 case VEC_WIDEN_MULT_EVEN_EXPR
:
7275 case VEC_WIDEN_MULT_ODD_EXPR
:
7284 /* Return true if CODE represents a ternary tree code for which the
7285 first two operands are commutative. Otherwise return false. */
7287 commutative_ternary_tree_code (enum tree_code code
)
7291 case WIDEN_MULT_PLUS_EXPR
:
7292 case WIDEN_MULT_MINUS_EXPR
:
7301 /* Generate a hash value for an expression. This can be used iteratively
7302 by passing a previous result as the VAL argument.
7304 This function is intended to produce the same hash for expressions which
7305 would compare equal using operand_equal_p. */
7308 iterative_hash_expr (const_tree t
, hashval_t val
)
7311 enum tree_code code
;
7315 return iterative_hash_hashval_t (0, val
);
7317 code
= TREE_CODE (t
);
7321 /* Alas, constants aren't shared, so we can't rely on pointer
7324 for (i
= 0; i
< TREE_INT_CST_NUNITS (t
); i
++)
7325 val
= iterative_hash_host_wide_int (TREE_INT_CST_ELT (t
, i
), val
);
7329 unsigned int val2
= real_hash (TREE_REAL_CST_PTR (t
));
7331 return iterative_hash_hashval_t (val2
, val
);
7335 unsigned int val2
= fixed_hash (TREE_FIXED_CST_PTR (t
));
7337 return iterative_hash_hashval_t (val2
, val
);
7340 return iterative_hash (TREE_STRING_POINTER (t
),
7341 TREE_STRING_LENGTH (t
), val
);
7343 val
= iterative_hash_expr (TREE_REALPART (t
), val
);
7344 return iterative_hash_expr (TREE_IMAGPART (t
), val
);
7348 for (i
= 0; i
< VECTOR_CST_NELTS (t
); ++i
)
7349 val
= iterative_hash_expr (VECTOR_CST_ELT (t
, i
), val
);
7353 /* We can just compare by pointer. */
7354 return iterative_hash_host_wide_int (SSA_NAME_VERSION (t
), val
);
7355 case PLACEHOLDER_EXPR
:
7356 /* The node itself doesn't matter. */
7359 /* A list of expressions, for a CALL_EXPR or as the elements of a
7361 for (; t
; t
= TREE_CHAIN (t
))
7362 val
= iterative_hash_expr (TREE_VALUE (t
), val
);
7366 unsigned HOST_WIDE_INT idx
;
7368 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t
), idx
, field
, value
)
7370 val
= iterative_hash_expr (field
, val
);
7371 val
= iterative_hash_expr (value
, val
);
7376 /* When referring to a built-in FUNCTION_DECL, use the __builtin__ form.
7377 Otherwise nodes that compare equal according to operand_equal_p might
7378 get different hash codes. However, don't do this for machine specific
7379 or front end builtins, since the function code is overloaded in those
7381 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
7382 && builtin_decl_explicit_p (DECL_FUNCTION_CODE (t
)))
7384 t
= builtin_decl_explicit (DECL_FUNCTION_CODE (t
));
7385 code
= TREE_CODE (t
);
7389 tclass
= TREE_CODE_CLASS (code
);
7391 if (tclass
== tcc_declaration
)
7393 /* DECL's have a unique ID */
7394 val
= iterative_hash_host_wide_int (DECL_UID (t
), val
);
7398 gcc_assert (IS_EXPR_CODE_CLASS (tclass
));
7400 val
= iterative_hash_object (code
, val
);
7402 /* Don't hash the type, that can lead to having nodes which
7403 compare equal according to operand_equal_p, but which
7404 have different hash codes. */
7405 if (CONVERT_EXPR_CODE_P (code
)
7406 || code
== NON_LVALUE_EXPR
)
7408 /* Make sure to include signness in the hash computation. */
7409 val
+= TYPE_UNSIGNED (TREE_TYPE (t
));
7410 val
= iterative_hash_expr (TREE_OPERAND (t
, 0), val
);
7413 else if (commutative_tree_code (code
))
7415 /* It's a commutative expression. We want to hash it the same
7416 however it appears. We do this by first hashing both operands
7417 and then rehashing based on the order of their independent
7419 hashval_t one
= iterative_hash_expr (TREE_OPERAND (t
, 0), 0);
7420 hashval_t two
= iterative_hash_expr (TREE_OPERAND (t
, 1), 0);
7424 t
= one
, one
= two
, two
= t
;
7426 val
= iterative_hash_hashval_t (one
, val
);
7427 val
= iterative_hash_hashval_t (two
, val
);
7430 for (i
= TREE_OPERAND_LENGTH (t
) - 1; i
>= 0; --i
)
7431 val
= iterative_hash_expr (TREE_OPERAND (t
, i
), val
);
7437 /* Constructors for pointer, array and function types.
7438 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
7439 constructed by language-dependent code, not here.) */
7441 /* Construct, lay out and return the type of pointers to TO_TYPE with
7442 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
7443 reference all of memory. If such a type has already been
7444 constructed, reuse it. */
7447 build_pointer_type_for_mode (tree to_type
, enum machine_mode mode
,
7452 if (to_type
== error_mark_node
)
7453 return error_mark_node
;
7455 /* If the pointed-to type has the may_alias attribute set, force
7456 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7457 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
7458 can_alias_all
= true;
7460 /* In some cases, languages will have things that aren't a POINTER_TYPE
7461 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
7462 In that case, return that type without regard to the rest of our
7465 ??? This is a kludge, but consistent with the way this function has
7466 always operated and there doesn't seem to be a good way to avoid this
7468 if (TYPE_POINTER_TO (to_type
) != 0
7469 && TREE_CODE (TYPE_POINTER_TO (to_type
)) != POINTER_TYPE
)
7470 return TYPE_POINTER_TO (to_type
);
7472 /* First, if we already have a type for pointers to TO_TYPE and it's
7473 the proper mode, use it. */
7474 for (t
= TYPE_POINTER_TO (to_type
); t
; t
= TYPE_NEXT_PTR_TO (t
))
7475 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
7478 t
= make_node (POINTER_TYPE
);
7480 TREE_TYPE (t
) = to_type
;
7481 SET_TYPE_MODE (t
, mode
);
7482 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
7483 TYPE_NEXT_PTR_TO (t
) = TYPE_POINTER_TO (to_type
);
7484 TYPE_POINTER_TO (to_type
) = t
;
7486 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
))
7487 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7488 else if (TYPE_CANONICAL (to_type
) != to_type
)
7490 = build_pointer_type_for_mode (TYPE_CANONICAL (to_type
),
7491 mode
, can_alias_all
);
7493 /* Lay out the type. This function has many callers that are concerned
7494 with expression-construction, and this simplifies them all. */
7500 /* By default build pointers in ptr_mode. */
7503 build_pointer_type (tree to_type
)
7505 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
7506 : TYPE_ADDR_SPACE (to_type
);
7507 enum machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
7508 return build_pointer_type_for_mode (to_type
, pointer_mode
, false);
7511 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
7514 build_reference_type_for_mode (tree to_type
, enum machine_mode mode
,
7519 if (to_type
== error_mark_node
)
7520 return error_mark_node
;
7522 /* If the pointed-to type has the may_alias attribute set, force
7523 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7524 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
7525 can_alias_all
= true;
7527 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
7528 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
7529 In that case, return that type without regard to the rest of our
7532 ??? This is a kludge, but consistent with the way this function has
7533 always operated and there doesn't seem to be a good way to avoid this
7535 if (TYPE_REFERENCE_TO (to_type
) != 0
7536 && TREE_CODE (TYPE_REFERENCE_TO (to_type
)) != REFERENCE_TYPE
)
7537 return TYPE_REFERENCE_TO (to_type
);
7539 /* First, if we already have a type for pointers to TO_TYPE and it's
7540 the proper mode, use it. */
7541 for (t
= TYPE_REFERENCE_TO (to_type
); t
; t
= TYPE_NEXT_REF_TO (t
))
7542 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
7545 t
= make_node (REFERENCE_TYPE
);
7547 TREE_TYPE (t
) = to_type
;
7548 SET_TYPE_MODE (t
, mode
);
7549 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
7550 TYPE_NEXT_REF_TO (t
) = TYPE_REFERENCE_TO (to_type
);
7551 TYPE_REFERENCE_TO (to_type
) = t
;
7553 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
))
7554 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7555 else if (TYPE_CANONICAL (to_type
) != to_type
)
7557 = build_reference_type_for_mode (TYPE_CANONICAL (to_type
),
7558 mode
, can_alias_all
);
7566 /* Build the node for the type of references-to-TO_TYPE by default
7570 build_reference_type (tree to_type
)
7572 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
7573 : TYPE_ADDR_SPACE (to_type
);
7574 enum machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
7575 return build_reference_type_for_mode (to_type
, pointer_mode
, false);
7578 #define MAX_INT_CACHED_PREC \
7579 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
7580 static GTY(()) tree nonstandard_integer_type_cache
[2 * MAX_INT_CACHED_PREC
+ 2];
7582 /* Builds a signed or unsigned integer type of precision PRECISION.
7583 Used for C bitfields whose precision does not match that of
7584 built-in target types. */
7586 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision
,
7592 unsignedp
= MAX_INT_CACHED_PREC
+ 1;
7594 if (precision
<= MAX_INT_CACHED_PREC
)
7596 itype
= nonstandard_integer_type_cache
[precision
+ unsignedp
];
7601 itype
= make_node (INTEGER_TYPE
);
7602 TYPE_PRECISION (itype
) = precision
;
7605 fixup_unsigned_type (itype
);
7607 fixup_signed_type (itype
);
7610 if (tree_fits_uhwi_p (TYPE_MAX_VALUE (itype
)))
7611 ret
= type_hash_canon (tree_to_uhwi (TYPE_MAX_VALUE (itype
)), itype
);
7612 if (precision
<= MAX_INT_CACHED_PREC
)
7613 nonstandard_integer_type_cache
[precision
+ unsignedp
] = ret
;
7618 /* Create a range of some discrete type TYPE (an INTEGER_TYPE, ENUMERAL_TYPE
7619 or BOOLEAN_TYPE) with low bound LOWVAL and high bound HIGHVAL. If SHARED
7620 is true, reuse such a type that has already been constructed. */
7623 build_range_type_1 (tree type
, tree lowval
, tree highval
, bool shared
)
7625 tree itype
= make_node (INTEGER_TYPE
);
7626 hashval_t hashcode
= 0;
7628 TREE_TYPE (itype
) = type
;
7630 TYPE_MIN_VALUE (itype
) = fold_convert (type
, lowval
);
7631 TYPE_MAX_VALUE (itype
) = highval
? fold_convert (type
, highval
) : NULL
;
7633 TYPE_PRECISION (itype
) = TYPE_PRECISION (type
);
7634 SET_TYPE_MODE (itype
, TYPE_MODE (type
));
7635 TYPE_SIZE (itype
) = TYPE_SIZE (type
);
7636 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (type
);
7637 TYPE_ALIGN (itype
) = TYPE_ALIGN (type
);
7638 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (type
);
7643 if ((TYPE_MIN_VALUE (itype
)
7644 && TREE_CODE (TYPE_MIN_VALUE (itype
)) != INTEGER_CST
)
7645 || (TYPE_MAX_VALUE (itype
)
7646 && TREE_CODE (TYPE_MAX_VALUE (itype
)) != INTEGER_CST
))
7648 /* Since we cannot reliably merge this type, we need to compare it using
7649 structural equality checks. */
7650 SET_TYPE_STRUCTURAL_EQUALITY (itype
);
7654 hashcode
= iterative_hash_expr (TYPE_MIN_VALUE (itype
), hashcode
);
7655 hashcode
= iterative_hash_expr (TYPE_MAX_VALUE (itype
), hashcode
);
7656 hashcode
= iterative_hash_hashval_t (TYPE_HASH (type
), hashcode
);
7657 itype
= type_hash_canon (hashcode
, itype
);
7662 /* Wrapper around build_range_type_1 with SHARED set to true. */
7665 build_range_type (tree type
, tree lowval
, tree highval
)
7667 return build_range_type_1 (type
, lowval
, highval
, true);
7670 /* Wrapper around build_range_type_1 with SHARED set to false. */
7673 build_nonshared_range_type (tree type
, tree lowval
, tree highval
)
7675 return build_range_type_1 (type
, lowval
, highval
, false);
7678 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
7679 MAXVAL should be the maximum value in the domain
7680 (one less than the length of the array).
7682 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
7683 We don't enforce this limit, that is up to caller (e.g. language front end).
7684 The limit exists because the result is a signed type and we don't handle
7685 sizes that use more than one HOST_WIDE_INT. */
7688 build_index_type (tree maxval
)
7690 return build_range_type (sizetype
, size_zero_node
, maxval
);
7693 /* Return true if the debug information for TYPE, a subtype, should be emitted
7694 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
7695 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
7696 debug info and doesn't reflect the source code. */
7699 subrange_type_for_debug_p (const_tree type
, tree
*lowval
, tree
*highval
)
7701 tree base_type
= TREE_TYPE (type
), low
, high
;
7703 /* Subrange types have a base type which is an integral type. */
7704 if (!INTEGRAL_TYPE_P (base_type
))
7707 /* Get the real bounds of the subtype. */
7708 if (lang_hooks
.types
.get_subrange_bounds
)
7709 lang_hooks
.types
.get_subrange_bounds (type
, &low
, &high
);
7712 low
= TYPE_MIN_VALUE (type
);
7713 high
= TYPE_MAX_VALUE (type
);
7716 /* If the type and its base type have the same representation and the same
7717 name, then the type is not a subrange but a copy of the base type. */
7718 if ((TREE_CODE (base_type
) == INTEGER_TYPE
7719 || TREE_CODE (base_type
) == BOOLEAN_TYPE
)
7720 && int_size_in_bytes (type
) == int_size_in_bytes (base_type
)
7721 && tree_int_cst_equal (low
, TYPE_MIN_VALUE (base_type
))
7722 && tree_int_cst_equal (high
, TYPE_MAX_VALUE (base_type
)))
7724 tree type_name
= TYPE_NAME (type
);
7725 tree base_type_name
= TYPE_NAME (base_type
);
7727 if (type_name
&& TREE_CODE (type_name
) == TYPE_DECL
)
7728 type_name
= DECL_NAME (type_name
);
7730 if (base_type_name
&& TREE_CODE (base_type_name
) == TYPE_DECL
)
7731 base_type_name
= DECL_NAME (base_type_name
);
7733 if (type_name
== base_type_name
)
7744 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
7745 and number of elements specified by the range of values of INDEX_TYPE.
7746 If SHARED is true, reuse such a type that has already been constructed. */
7749 build_array_type_1 (tree elt_type
, tree index_type
, bool shared
)
7753 if (TREE_CODE (elt_type
) == FUNCTION_TYPE
)
7755 error ("arrays of functions are not meaningful");
7756 elt_type
= integer_type_node
;
7759 t
= make_node (ARRAY_TYPE
);
7760 TREE_TYPE (t
) = elt_type
;
7761 TYPE_DOMAIN (t
) = index_type
;
7762 TYPE_ADDR_SPACE (t
) = TYPE_ADDR_SPACE (elt_type
);
7765 /* If the element type is incomplete at this point we get marked for
7766 structural equality. Do not record these types in the canonical
7768 if (TYPE_STRUCTURAL_EQUALITY_P (t
))
7773 hashval_t hashcode
= iterative_hash_object (TYPE_HASH (elt_type
), 0);
7775 hashcode
= iterative_hash_object (TYPE_HASH (index_type
), hashcode
);
7776 t
= type_hash_canon (hashcode
, t
);
7779 if (TYPE_CANONICAL (t
) == t
)
7781 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type
)
7782 || (index_type
&& TYPE_STRUCTURAL_EQUALITY_P (index_type
)))
7783 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7784 else if (TYPE_CANONICAL (elt_type
) != elt_type
7785 || (index_type
&& TYPE_CANONICAL (index_type
) != index_type
))
7787 = build_array_type_1 (TYPE_CANONICAL (elt_type
),
7789 ? TYPE_CANONICAL (index_type
) : NULL_TREE
,
7796 /* Wrapper around build_array_type_1 with SHARED set to true. */
7799 build_array_type (tree elt_type
, tree index_type
)
7801 return build_array_type_1 (elt_type
, index_type
, true);
7804 /* Wrapper around build_array_type_1 with SHARED set to false. */
7807 build_nonshared_array_type (tree elt_type
, tree index_type
)
7809 return build_array_type_1 (elt_type
, index_type
, false);
7812 /* Return a representation of ELT_TYPE[NELTS], using indices of type
7816 build_array_type_nelts (tree elt_type
, unsigned HOST_WIDE_INT nelts
)
7818 return build_array_type (elt_type
, build_index_type (size_int (nelts
- 1)));
7821 /* Recursively examines the array elements of TYPE, until a non-array
7822 element type is found. */
7825 strip_array_types (tree type
)
7827 while (TREE_CODE (type
) == ARRAY_TYPE
)
7828 type
= TREE_TYPE (type
);
7833 /* Computes the canonical argument types from the argument type list
7836 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
7837 on entry to this function, or if any of the ARGTYPES are
7840 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
7841 true on entry to this function, or if any of the ARGTYPES are
7844 Returns a canonical argument list, which may be ARGTYPES when the
7845 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
7846 true) or would not differ from ARGTYPES. */
7849 maybe_canonicalize_argtypes (tree argtypes
,
7850 bool *any_structural_p
,
7851 bool *any_noncanonical_p
)
7854 bool any_noncanonical_argtypes_p
= false;
7856 for (arg
= argtypes
; arg
&& !(*any_structural_p
); arg
= TREE_CHAIN (arg
))
7858 if (!TREE_VALUE (arg
) || TREE_VALUE (arg
) == error_mark_node
)
7859 /* Fail gracefully by stating that the type is structural. */
7860 *any_structural_p
= true;
7861 else if (TYPE_STRUCTURAL_EQUALITY_P (TREE_VALUE (arg
)))
7862 *any_structural_p
= true;
7863 else if (TYPE_CANONICAL (TREE_VALUE (arg
)) != TREE_VALUE (arg
)
7864 || TREE_PURPOSE (arg
))
7865 /* If the argument has a default argument, we consider it
7866 non-canonical even though the type itself is canonical.
7867 That way, different variants of function and method types
7868 with default arguments will all point to the variant with
7869 no defaults as their canonical type. */
7870 any_noncanonical_argtypes_p
= true;
7873 if (*any_structural_p
)
7876 if (any_noncanonical_argtypes_p
)
7878 /* Build the canonical list of argument types. */
7879 tree canon_argtypes
= NULL_TREE
;
7880 bool is_void
= false;
7882 for (arg
= argtypes
; arg
; arg
= TREE_CHAIN (arg
))
7884 if (arg
== void_list_node
)
7887 canon_argtypes
= tree_cons (NULL_TREE
,
7888 TYPE_CANONICAL (TREE_VALUE (arg
)),
7892 canon_argtypes
= nreverse (canon_argtypes
);
7894 canon_argtypes
= chainon (canon_argtypes
, void_list_node
);
7896 /* There is a non-canonical type. */
7897 *any_noncanonical_p
= true;
7898 return canon_argtypes
;
7901 /* The canonical argument types are the same as ARGTYPES. */
7905 /* Construct, lay out and return
7906 the type of functions returning type VALUE_TYPE
7907 given arguments of types ARG_TYPES.
7908 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
7909 are data type nodes for the arguments of the function.
7910 If such a type has already been constructed, reuse it. */
7913 build_function_type (tree value_type
, tree arg_types
)
7916 hashval_t hashcode
= 0;
7917 bool any_structural_p
, any_noncanonical_p
;
7918 tree canon_argtypes
;
7920 if (TREE_CODE (value_type
) == FUNCTION_TYPE
)
7922 error ("function return type cannot be function");
7923 value_type
= integer_type_node
;
7926 /* Make a node of the sort we want. */
7927 t
= make_node (FUNCTION_TYPE
);
7928 TREE_TYPE (t
) = value_type
;
7929 TYPE_ARG_TYPES (t
) = arg_types
;
7931 /* If we already have such a type, use the old one. */
7932 hashcode
= iterative_hash_object (TYPE_HASH (value_type
), hashcode
);
7933 hashcode
= type_hash_list (arg_types
, hashcode
);
7934 t
= type_hash_canon (hashcode
, t
);
7936 /* Set up the canonical type. */
7937 any_structural_p
= TYPE_STRUCTURAL_EQUALITY_P (value_type
);
7938 any_noncanonical_p
= TYPE_CANONICAL (value_type
) != value_type
;
7939 canon_argtypes
= maybe_canonicalize_argtypes (arg_types
,
7941 &any_noncanonical_p
);
7942 if (any_structural_p
)
7943 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7944 else if (any_noncanonical_p
)
7945 TYPE_CANONICAL (t
) = build_function_type (TYPE_CANONICAL (value_type
),
7948 if (!COMPLETE_TYPE_P (t
))
7953 /* Build a function type. The RETURN_TYPE is the type returned by the
7954 function. If VAARGS is set, no void_type_node is appended to the
7955 the list. ARGP must be always be terminated be a NULL_TREE. */
7958 build_function_type_list_1 (bool vaargs
, tree return_type
, va_list argp
)
7962 t
= va_arg (argp
, tree
);
7963 for (args
= NULL_TREE
; t
!= NULL_TREE
; t
= va_arg (argp
, tree
))
7964 args
= tree_cons (NULL_TREE
, t
, args
);
7969 if (args
!= NULL_TREE
)
7970 args
= nreverse (args
);
7971 gcc_assert (last
!= void_list_node
);
7973 else if (args
== NULL_TREE
)
7974 args
= void_list_node
;
7978 args
= nreverse (args
);
7979 TREE_CHAIN (last
) = void_list_node
;
7981 args
= build_function_type (return_type
, args
);
7986 /* Build a function type. The RETURN_TYPE is the type returned by the
7987 function. If additional arguments are provided, they are
7988 additional argument types. The list of argument types must always
7989 be terminated by NULL_TREE. */
7992 build_function_type_list (tree return_type
, ...)
7997 va_start (p
, return_type
);
7998 args
= build_function_type_list_1 (false, return_type
, p
);
8003 /* Build a variable argument function type. The RETURN_TYPE is the
8004 type returned by the function. If additional arguments are provided,
8005 they are additional argument types. The list of argument types must
8006 always be terminated by NULL_TREE. */
8009 build_varargs_function_type_list (tree return_type
, ...)
8014 va_start (p
, return_type
);
8015 args
= build_function_type_list_1 (true, return_type
, p
);
8021 /* Build a function type. RETURN_TYPE is the type returned by the
8022 function; VAARGS indicates whether the function takes varargs. The
8023 function takes N named arguments, the types of which are provided in
8027 build_function_type_array_1 (bool vaargs
, tree return_type
, int n
,
8031 tree t
= vaargs
? NULL_TREE
: void_list_node
;
8033 for (i
= n
- 1; i
>= 0; i
--)
8034 t
= tree_cons (NULL_TREE
, arg_types
[i
], t
);
8036 return build_function_type (return_type
, t
);
8039 /* Build a function type. RETURN_TYPE is the type returned by the
8040 function. The function takes N named arguments, the types of which
8041 are provided in ARG_TYPES. */
8044 build_function_type_array (tree return_type
, int n
, tree
*arg_types
)
8046 return build_function_type_array_1 (false, return_type
, n
, arg_types
);
8049 /* Build a variable argument function type. RETURN_TYPE is the type
8050 returned by the function. The function takes N named arguments, the
8051 types of which are provided in ARG_TYPES. */
8054 build_varargs_function_type_array (tree return_type
, int n
, tree
*arg_types
)
8056 return build_function_type_array_1 (true, return_type
, n
, arg_types
);
8059 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
8060 and ARGTYPES (a TREE_LIST) are the return type and arguments types
8061 for the method. An implicit additional parameter (of type
8062 pointer-to-BASETYPE) is added to the ARGTYPES. */
8065 build_method_type_directly (tree basetype
,
8072 bool any_structural_p
, any_noncanonical_p
;
8073 tree canon_argtypes
;
8075 /* Make a node of the sort we want. */
8076 t
= make_node (METHOD_TYPE
);
8078 TYPE_METHOD_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
8079 TREE_TYPE (t
) = rettype
;
8080 ptype
= build_pointer_type (basetype
);
8082 /* The actual arglist for this function includes a "hidden" argument
8083 which is "this". Put it into the list of argument types. */
8084 argtypes
= tree_cons (NULL_TREE
, ptype
, argtypes
);
8085 TYPE_ARG_TYPES (t
) = argtypes
;
8087 /* If we already have such a type, use the old one. */
8088 hashcode
= iterative_hash_object (TYPE_HASH (basetype
), hashcode
);
8089 hashcode
= iterative_hash_object (TYPE_HASH (rettype
), hashcode
);
8090 hashcode
= type_hash_list (argtypes
, hashcode
);
8091 t
= type_hash_canon (hashcode
, t
);
8093 /* Set up the canonical type. */
8095 = (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
8096 || TYPE_STRUCTURAL_EQUALITY_P (rettype
));
8098 = (TYPE_CANONICAL (basetype
) != basetype
8099 || TYPE_CANONICAL (rettype
) != rettype
);
8100 canon_argtypes
= maybe_canonicalize_argtypes (TREE_CHAIN (argtypes
),
8102 &any_noncanonical_p
);
8103 if (any_structural_p
)
8104 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8105 else if (any_noncanonical_p
)
8107 = build_method_type_directly (TYPE_CANONICAL (basetype
),
8108 TYPE_CANONICAL (rettype
),
8110 if (!COMPLETE_TYPE_P (t
))
8116 /* Construct, lay out and return the type of methods belonging to class
8117 BASETYPE and whose arguments and values are described by TYPE.
8118 If that type exists already, reuse it.
8119 TYPE must be a FUNCTION_TYPE node. */
8122 build_method_type (tree basetype
, tree type
)
8124 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
8126 return build_method_type_directly (basetype
,
8128 TYPE_ARG_TYPES (type
));
8131 /* Construct, lay out and return the type of offsets to a value
8132 of type TYPE, within an object of type BASETYPE.
8133 If a suitable offset type exists already, reuse it. */
8136 build_offset_type (tree basetype
, tree type
)
8139 hashval_t hashcode
= 0;
8141 /* Make a node of the sort we want. */
8142 t
= make_node (OFFSET_TYPE
);
8144 TYPE_OFFSET_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
8145 TREE_TYPE (t
) = type
;
8147 /* If we already have such a type, use the old one. */
8148 hashcode
= iterative_hash_object (TYPE_HASH (basetype
), hashcode
);
8149 hashcode
= iterative_hash_object (TYPE_HASH (type
), hashcode
);
8150 t
= type_hash_canon (hashcode
, t
);
8152 if (!COMPLETE_TYPE_P (t
))
8155 if (TYPE_CANONICAL (t
) == t
)
8157 if (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
8158 || TYPE_STRUCTURAL_EQUALITY_P (type
))
8159 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8160 else if (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)) != basetype
8161 || TYPE_CANONICAL (type
) != type
)
8163 = build_offset_type (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)),
8164 TYPE_CANONICAL (type
));
8170 /* Create a complex type whose components are COMPONENT_TYPE. */
8173 build_complex_type (tree component_type
)
8178 gcc_assert (INTEGRAL_TYPE_P (component_type
)
8179 || SCALAR_FLOAT_TYPE_P (component_type
)
8180 || FIXED_POINT_TYPE_P (component_type
));
8182 /* Make a node of the sort we want. */
8183 t
= make_node (COMPLEX_TYPE
);
8185 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (component_type
);
8187 /* If we already have such a type, use the old one. */
8188 hashcode
= iterative_hash_object (TYPE_HASH (component_type
), 0);
8189 t
= type_hash_canon (hashcode
, t
);
8191 if (!COMPLETE_TYPE_P (t
))
8194 if (TYPE_CANONICAL (t
) == t
)
8196 if (TYPE_STRUCTURAL_EQUALITY_P (component_type
))
8197 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8198 else if (TYPE_CANONICAL (component_type
) != component_type
)
8200 = build_complex_type (TYPE_CANONICAL (component_type
));
8203 /* We need to create a name, since complex is a fundamental type. */
8204 if (! TYPE_NAME (t
))
8207 if (component_type
== char_type_node
)
8208 name
= "complex char";
8209 else if (component_type
== signed_char_type_node
)
8210 name
= "complex signed char";
8211 else if (component_type
== unsigned_char_type_node
)
8212 name
= "complex unsigned char";
8213 else if (component_type
== short_integer_type_node
)
8214 name
= "complex short int";
8215 else if (component_type
== short_unsigned_type_node
)
8216 name
= "complex short unsigned int";
8217 else if (component_type
== integer_type_node
)
8218 name
= "complex int";
8219 else if (component_type
== unsigned_type_node
)
8220 name
= "complex unsigned int";
8221 else if (component_type
== long_integer_type_node
)
8222 name
= "complex long int";
8223 else if (component_type
== long_unsigned_type_node
)
8224 name
= "complex long unsigned int";
8225 else if (component_type
== long_long_integer_type_node
)
8226 name
= "complex long long int";
8227 else if (component_type
== long_long_unsigned_type_node
)
8228 name
= "complex long long unsigned int";
8233 TYPE_NAME (t
) = build_decl (UNKNOWN_LOCATION
, TYPE_DECL
,
8234 get_identifier (name
), t
);
8237 return build_qualified_type (t
, TYPE_QUALS (component_type
));
8240 /* If TYPE is a real or complex floating-point type and the target
8241 does not directly support arithmetic on TYPE then return the wider
8242 type to be used for arithmetic on TYPE. Otherwise, return
8246 excess_precision_type (tree type
)
8248 if (flag_excess_precision
!= EXCESS_PRECISION_FAST
)
8250 int flt_eval_method
= TARGET_FLT_EVAL_METHOD
;
8251 switch (TREE_CODE (type
))
8254 switch (flt_eval_method
)
8257 if (TYPE_MODE (type
) == TYPE_MODE (float_type_node
))
8258 return double_type_node
;
8261 if (TYPE_MODE (type
) == TYPE_MODE (float_type_node
)
8262 || TYPE_MODE (type
) == TYPE_MODE (double_type_node
))
8263 return long_double_type_node
;
8270 if (TREE_CODE (TREE_TYPE (type
)) != REAL_TYPE
)
8272 switch (flt_eval_method
)
8275 if (TYPE_MODE (TREE_TYPE (type
)) == TYPE_MODE (float_type_node
))
8276 return complex_double_type_node
;
8279 if (TYPE_MODE (TREE_TYPE (type
)) == TYPE_MODE (float_type_node
)
8280 || (TYPE_MODE (TREE_TYPE (type
))
8281 == TYPE_MODE (double_type_node
)))
8282 return complex_long_double_type_node
;
8295 /* Return OP, stripped of any conversions to wider types as much as is safe.
8296 Converting the value back to OP's type makes a value equivalent to OP.
8298 If FOR_TYPE is nonzero, we return a value which, if converted to
8299 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
8301 OP must have integer, real or enumeral type. Pointers are not allowed!
8303 There are some cases where the obvious value we could return
8304 would regenerate to OP if converted to OP's type,
8305 but would not extend like OP to wider types.
8306 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
8307 For example, if OP is (unsigned short)(signed char)-1,
8308 we avoid returning (signed char)-1 if FOR_TYPE is int,
8309 even though extending that to an unsigned short would regenerate OP,
8310 since the result of extending (signed char)-1 to (int)
8311 is different from (int) OP. */
8314 get_unwidened (tree op
, tree for_type
)
8316 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
8317 tree type
= TREE_TYPE (op
);
8319 = TYPE_PRECISION (for_type
!= 0 ? for_type
: type
);
8321 = (for_type
!= 0 && for_type
!= type
8322 && final_prec
> TYPE_PRECISION (type
)
8323 && TYPE_UNSIGNED (type
));
8326 while (CONVERT_EXPR_P (op
))
8330 /* TYPE_PRECISION on vector types has different meaning
8331 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
8332 so avoid them here. */
8333 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op
, 0))) == VECTOR_TYPE
)
8336 bitschange
= TYPE_PRECISION (TREE_TYPE (op
))
8337 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0)));
8339 /* Truncations are many-one so cannot be removed.
8340 Unless we are later going to truncate down even farther. */
8342 && final_prec
> TYPE_PRECISION (TREE_TYPE (op
)))
8345 /* See what's inside this conversion. If we decide to strip it,
8347 op
= TREE_OPERAND (op
, 0);
8349 /* If we have not stripped any zero-extensions (uns is 0),
8350 we can strip any kind of extension.
8351 If we have previously stripped a zero-extension,
8352 only zero-extensions can safely be stripped.
8353 Any extension can be stripped if the bits it would produce
8354 are all going to be discarded later by truncating to FOR_TYPE. */
8358 if (! uns
|| final_prec
<= TYPE_PRECISION (TREE_TYPE (op
)))
8360 /* TYPE_UNSIGNED says whether this is a zero-extension.
8361 Let's avoid computing it if it does not affect WIN
8362 and if UNS will not be needed again. */
8364 || CONVERT_EXPR_P (op
))
8365 && TYPE_UNSIGNED (TREE_TYPE (op
)))
8373 /* If we finally reach a constant see if it fits in for_type and
8374 in that case convert it. */
8376 && TREE_CODE (win
) == INTEGER_CST
8377 && TREE_TYPE (win
) != for_type
8378 && int_fits_type_p (win
, for_type
))
8379 win
= fold_convert (for_type
, win
);
8384 /* Return OP or a simpler expression for a narrower value
8385 which can be sign-extended or zero-extended to give back OP.
8386 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
8387 or 0 if the value should be sign-extended. */
8390 get_narrower (tree op
, int *unsignedp_ptr
)
8395 bool integral_p
= INTEGRAL_TYPE_P (TREE_TYPE (op
));
8397 while (TREE_CODE (op
) == NOP_EXPR
)
8400 = (TYPE_PRECISION (TREE_TYPE (op
))
8401 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0))));
8403 /* Truncations are many-one so cannot be removed. */
8407 /* See what's inside this conversion. If we decide to strip it,
8412 op
= TREE_OPERAND (op
, 0);
8413 /* An extension: the outermost one can be stripped,
8414 but remember whether it is zero or sign extension. */
8416 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
8417 /* Otherwise, if a sign extension has been stripped,
8418 only sign extensions can now be stripped;
8419 if a zero extension has been stripped, only zero-extensions. */
8420 else if (uns
!= TYPE_UNSIGNED (TREE_TYPE (op
)))
8424 else /* bitschange == 0 */
8426 /* A change in nominal type can always be stripped, but we must
8427 preserve the unsignedness. */
8429 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
8431 op
= TREE_OPERAND (op
, 0);
8432 /* Keep trying to narrow, but don't assign op to win if it
8433 would turn an integral type into something else. */
8434 if (INTEGRAL_TYPE_P (TREE_TYPE (op
)) != integral_p
)
8441 if (TREE_CODE (op
) == COMPONENT_REF
8442 /* Since type_for_size always gives an integer type. */
8443 && TREE_CODE (TREE_TYPE (op
)) != REAL_TYPE
8444 && TREE_CODE (TREE_TYPE (op
)) != FIXED_POINT_TYPE
8445 /* Ensure field is laid out already. */
8446 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0
8447 && tree_fits_uhwi_p (DECL_SIZE (TREE_OPERAND (op
, 1))))
8449 unsigned HOST_WIDE_INT innerprec
8450 = tree_to_uhwi (DECL_SIZE (TREE_OPERAND (op
, 1)));
8451 int unsignedp
= (DECL_UNSIGNED (TREE_OPERAND (op
, 1))
8452 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op
, 1))));
8453 tree type
= lang_hooks
.types
.type_for_size (innerprec
, unsignedp
);
8455 /* We can get this structure field in a narrower type that fits it,
8456 but the resulting extension to its nominal type (a fullword type)
8457 must satisfy the same conditions as for other extensions.
8459 Do this only for fields that are aligned (not bit-fields),
8460 because when bit-field insns will be used there is no
8461 advantage in doing this. */
8463 if (innerprec
< TYPE_PRECISION (TREE_TYPE (op
))
8464 && ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1))
8465 && (first
|| uns
== DECL_UNSIGNED (TREE_OPERAND (op
, 1)))
8469 uns
= DECL_UNSIGNED (TREE_OPERAND (op
, 1));
8470 win
= fold_convert (type
, op
);
8474 *unsignedp_ptr
= uns
;
8478 /* Returns true if integer constant C has a value that is permissible
8479 for type TYPE (an INTEGER_TYPE). */
8482 int_fits_type_p (const_tree c
, const_tree type
)
8484 tree type_low_bound
, type_high_bound
;
8485 bool ok_for_low_bound
, ok_for_high_bound
;
8486 signop sgn_c
= TYPE_SIGN (TREE_TYPE (c
));
8489 type_low_bound
= TYPE_MIN_VALUE (type
);
8490 type_high_bound
= TYPE_MAX_VALUE (type
);
8492 /* If at least one bound of the type is a constant integer, we can check
8493 ourselves and maybe make a decision. If no such decision is possible, but
8494 this type is a subtype, try checking against that. Otherwise, use
8495 fits_to_tree_p, which checks against the precision.
8497 Compute the status for each possibly constant bound, and return if we see
8498 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
8499 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
8500 for "constant known to fit". */
8502 /* Check if c >= type_low_bound. */
8503 if (type_low_bound
&& TREE_CODE (type_low_bound
) == INTEGER_CST
)
8505 if (INT_CST_LT (c
, type_low_bound
))
8507 ok_for_low_bound
= true;
8510 ok_for_low_bound
= false;
8512 /* Check if c <= type_high_bound. */
8513 if (type_high_bound
&& TREE_CODE (type_high_bound
) == INTEGER_CST
)
8515 if (INT_CST_LT (type_high_bound
, c
))
8517 ok_for_high_bound
= true;
8520 ok_for_high_bound
= false;
8522 /* If the constant fits both bounds, the result is known. */
8523 if (ok_for_low_bound
&& ok_for_high_bound
)
8526 /* Perform some generic filtering which may allow making a decision
8527 even if the bounds are not constant. First, negative integers
8528 never fit in unsigned types, */
8529 if (TYPE_UNSIGNED (type
) && sgn_c
== SIGNED
&& wi::neg_p (c
))
8532 /* Second, narrower types always fit in wider ones. */
8533 if (TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (c
)))
8536 /* Third, unsigned integers with top bit set never fit signed types. */
8537 if (!TYPE_UNSIGNED (type
) && sgn_c
== UNSIGNED
&& wi::neg_p (c
))
8540 /* If we haven't been able to decide at this point, there nothing more we
8541 can check ourselves here. Look at the base type if we have one and it
8542 has the same precision. */
8543 if (TREE_CODE (type
) == INTEGER_TYPE
8544 && TREE_TYPE (type
) != 0
8545 && TYPE_PRECISION (type
) == TYPE_PRECISION (TREE_TYPE (type
)))
8547 type
= TREE_TYPE (type
);
8551 /* Or to fits_to_tree_p, if nothing else. */
8552 return wi::fits_to_tree_p (c
, type
);
8555 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
8556 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
8557 represented (assuming two's-complement arithmetic) within the bit
8558 precision of the type are returned instead. */
8561 get_type_static_bounds (const_tree type
, mpz_t min
, mpz_t max
)
8563 if (!POINTER_TYPE_P (type
) && TYPE_MIN_VALUE (type
)
8564 && TREE_CODE (TYPE_MIN_VALUE (type
)) == INTEGER_CST
)
8565 wi::to_mpz (TYPE_MIN_VALUE (type
), min
, TYPE_SIGN (type
));
8568 if (TYPE_UNSIGNED (type
))
8569 mpz_set_ui (min
, 0);
8572 wide_int mn
= wi::min_value (TYPE_PRECISION (type
), SIGNED
);
8573 wi::to_mpz (mn
, min
, SIGNED
);
8577 if (!POINTER_TYPE_P (type
) && TYPE_MAX_VALUE (type
)
8578 && TREE_CODE (TYPE_MAX_VALUE (type
)) == INTEGER_CST
)
8579 wi::to_mpz (TYPE_MAX_VALUE (type
), max
, TYPE_SIGN (type
));
8582 wide_int mn
= wi::max_value (TYPE_PRECISION (type
), TYPE_SIGN (type
));
8583 wi::to_mpz (mn
, max
, TYPE_SIGN (type
));
8587 /* Return true if VAR is an automatic variable defined in function FN. */
8590 auto_var_in_fn_p (const_tree var
, const_tree fn
)
8592 return (DECL_P (var
) && DECL_CONTEXT (var
) == fn
8593 && ((((TREE_CODE (var
) == VAR_DECL
&& ! DECL_EXTERNAL (var
))
8594 || TREE_CODE (var
) == PARM_DECL
)
8595 && ! TREE_STATIC (var
))
8596 || TREE_CODE (var
) == LABEL_DECL
8597 || TREE_CODE (var
) == RESULT_DECL
));
8600 /* Subprogram of following function. Called by walk_tree.
8602 Return *TP if it is an automatic variable or parameter of the
8603 function passed in as DATA. */
8606 find_var_from_fn (tree
*tp
, int *walk_subtrees
, void *data
)
8608 tree fn
= (tree
) data
;
8613 else if (DECL_P (*tp
)
8614 && auto_var_in_fn_p (*tp
, fn
))
8620 /* Returns true if T is, contains, or refers to a type with variable
8621 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
8622 arguments, but not the return type. If FN is nonzero, only return
8623 true if a modifier of the type or position of FN is a variable or
8624 parameter inside FN.
8626 This concept is more general than that of C99 'variably modified types':
8627 in C99, a struct type is never variably modified because a VLA may not
8628 appear as a structure member. However, in GNU C code like:
8630 struct S { int i[f()]; };
8632 is valid, and other languages may define similar constructs. */
8635 variably_modified_type_p (tree type
, tree fn
)
8639 /* Test if T is either variable (if FN is zero) or an expression containing
8640 a variable in FN. If TYPE isn't gimplified, return true also if
8641 gimplify_one_sizepos would gimplify the expression into a local
8643 #define RETURN_TRUE_IF_VAR(T) \
8644 do { tree _t = (T); \
8645 if (_t != NULL_TREE \
8646 && _t != error_mark_node \
8647 && TREE_CODE (_t) != INTEGER_CST \
8648 && TREE_CODE (_t) != PLACEHOLDER_EXPR \
8650 || (!TYPE_SIZES_GIMPLIFIED (type) \
8651 && !is_gimple_sizepos (_t)) \
8652 || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
8653 return true; } while (0)
8655 if (type
== error_mark_node
)
8658 /* If TYPE itself has variable size, it is variably modified. */
8659 RETURN_TRUE_IF_VAR (TYPE_SIZE (type
));
8660 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type
));
8662 switch (TREE_CODE (type
))
8665 case REFERENCE_TYPE
:
8667 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
8673 /* If TYPE is a function type, it is variably modified if the
8674 return type is variably modified. */
8675 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
8681 case FIXED_POINT_TYPE
:
8684 /* Scalar types are variably modified if their end points
8686 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type
));
8687 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type
));
8692 case QUAL_UNION_TYPE
:
8693 /* We can't see if any of the fields are variably-modified by the
8694 definition we normally use, since that would produce infinite
8695 recursion via pointers. */
8696 /* This is variably modified if some field's type is. */
8697 for (t
= TYPE_FIELDS (type
); t
; t
= DECL_CHAIN (t
))
8698 if (TREE_CODE (t
) == FIELD_DECL
)
8700 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t
));
8701 RETURN_TRUE_IF_VAR (DECL_SIZE (t
));
8702 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t
));
8704 if (TREE_CODE (type
) == QUAL_UNION_TYPE
)
8705 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t
));
8710 /* Do not call ourselves to avoid infinite recursion. This is
8711 variably modified if the element type is. */
8712 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type
)));
8713 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type
)));
8720 /* The current language may have other cases to check, but in general,
8721 all other types are not variably modified. */
8722 return lang_hooks
.tree_inlining
.var_mod_type_p (type
, fn
);
8724 #undef RETURN_TRUE_IF_VAR
8727 /* Given a DECL or TYPE, return the scope in which it was declared, or
8728 NULL_TREE if there is no containing scope. */
8731 get_containing_scope (const_tree t
)
8733 return (TYPE_P (t
) ? TYPE_CONTEXT (t
) : DECL_CONTEXT (t
));
8736 /* Return the innermost context enclosing DECL that is
8737 a FUNCTION_DECL, or zero if none. */
8740 decl_function_context (const_tree decl
)
8744 if (TREE_CODE (decl
) == ERROR_MARK
)
8747 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
8748 where we look up the function at runtime. Such functions always take
8749 a first argument of type 'pointer to real context'.
8751 C++ should really be fixed to use DECL_CONTEXT for the real context,
8752 and use something else for the "virtual context". */
8753 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VINDEX (decl
))
8756 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl
)))));
8758 context
= DECL_CONTEXT (decl
);
8760 while (context
&& TREE_CODE (context
) != FUNCTION_DECL
)
8762 if (TREE_CODE (context
) == BLOCK
)
8763 context
= BLOCK_SUPERCONTEXT (context
);
8765 context
= get_containing_scope (context
);
8771 /* Return the innermost context enclosing DECL that is
8772 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
8773 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
8776 decl_type_context (const_tree decl
)
8778 tree context
= DECL_CONTEXT (decl
);
8781 switch (TREE_CODE (context
))
8783 case NAMESPACE_DECL
:
8784 case TRANSLATION_UNIT_DECL
:
8789 case QUAL_UNION_TYPE
:
8794 context
= DECL_CONTEXT (context
);
8798 context
= BLOCK_SUPERCONTEXT (context
);
8808 /* CALL is a CALL_EXPR. Return the declaration for the function
8809 called, or NULL_TREE if the called function cannot be
8813 get_callee_fndecl (const_tree call
)
8817 if (call
== error_mark_node
)
8818 return error_mark_node
;
8820 /* It's invalid to call this function with anything but a
8822 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
8824 /* The first operand to the CALL is the address of the function
8826 addr
= CALL_EXPR_FN (call
);
8830 /* If this is a readonly function pointer, extract its initial value. */
8831 if (DECL_P (addr
) && TREE_CODE (addr
) != FUNCTION_DECL
8832 && TREE_READONLY (addr
) && ! TREE_THIS_VOLATILE (addr
)
8833 && DECL_INITIAL (addr
))
8834 addr
= DECL_INITIAL (addr
);
8836 /* If the address is just `&f' for some function `f', then we know
8837 that `f' is being called. */
8838 if (TREE_CODE (addr
) == ADDR_EXPR
8839 && TREE_CODE (TREE_OPERAND (addr
, 0)) == FUNCTION_DECL
)
8840 return TREE_OPERAND (addr
, 0);
8842 /* We couldn't figure out what was being called. */
8846 /* Print debugging information about tree nodes generated during the compile,
8847 and any language-specific information. */
8850 dump_tree_statistics (void)
8852 if (GATHER_STATISTICS
)
8855 int total_nodes
, total_bytes
;
8856 fprintf (stderr
, "Kind Nodes Bytes\n");
8857 fprintf (stderr
, "---------------------------------------\n");
8858 total_nodes
= total_bytes
= 0;
8859 for (i
= 0; i
< (int) all_kinds
; i
++)
8861 fprintf (stderr
, "%-20s %7d %10d\n", tree_node_kind_names
[i
],
8862 tree_node_counts
[i
], tree_node_sizes
[i
]);
8863 total_nodes
+= tree_node_counts
[i
];
8864 total_bytes
+= tree_node_sizes
[i
];
8866 fprintf (stderr
, "---------------------------------------\n");
8867 fprintf (stderr
, "%-20s %7d %10d\n", "Total", total_nodes
, total_bytes
);
8868 fprintf (stderr
, "---------------------------------------\n");
8869 fprintf (stderr
, "Code Nodes\n");
8870 fprintf (stderr
, "----------------------------\n");
8871 for (i
= 0; i
< (int) MAX_TREE_CODES
; i
++)
8872 fprintf (stderr
, "%-20s %7d\n", get_tree_code_name ((enum tree_code
) i
),
8873 tree_code_counts
[i
]);
8874 fprintf (stderr
, "----------------------------\n");
8875 ssanames_print_statistics ();
8876 phinodes_print_statistics ();
8879 fprintf (stderr
, "(No per-node statistics)\n");
8881 print_type_hash_statistics ();
8882 print_debug_expr_statistics ();
8883 print_value_expr_statistics ();
8884 lang_hooks
.print_statistics ();
8887 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
8889 /* Generate a crc32 of a byte. */
8892 crc32_unsigned_bits (unsigned chksum
, unsigned value
, unsigned bits
)
8896 for (ix
= bits
; ix
--; value
<<= 1)
8900 feedback
= (value
^ chksum
) & 0x80000000 ? 0x04c11db7 : 0;
8907 /* Generate a crc32 of a 32-bit unsigned. */
8910 crc32_unsigned (unsigned chksum
, unsigned value
)
8912 return crc32_unsigned_bits (chksum
, value
, 32);
8915 /* Generate a crc32 of a byte. */
8918 crc32_byte (unsigned chksum
, char byte
)
8920 return crc32_unsigned_bits (chksum
, (unsigned) byte
<< 24, 8);
8923 /* Generate a crc32 of a string. */
8926 crc32_string (unsigned chksum
, const char *string
)
8930 chksum
= crc32_byte (chksum
, *string
);
8936 /* P is a string that will be used in a symbol. Mask out any characters
8937 that are not valid in that context. */
8940 clean_symbol_name (char *p
)
8944 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
8947 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
8954 /* Generate a name for a special-purpose function.
8955 The generated name may need to be unique across the whole link.
8956 Changes to this function may also require corresponding changes to
8957 xstrdup_mask_random.
8958 TYPE is some string to identify the purpose of this function to the
8959 linker or collect2; it must start with an uppercase letter,
8961 I - for constructors
8963 N - for C++ anonymous namespaces
8964 F - for DWARF unwind frame information. */
8967 get_file_function_name (const char *type
)
8973 /* If we already have a name we know to be unique, just use that. */
8974 if (first_global_object_name
)
8975 p
= q
= ASTRDUP (first_global_object_name
);
8976 /* If the target is handling the constructors/destructors, they
8977 will be local to this file and the name is only necessary for
8979 We also assign sub_I and sub_D sufixes to constructors called from
8980 the global static constructors. These are always local. */
8981 else if (((type
[0] == 'I' || type
[0] == 'D') && targetm
.have_ctors_dtors
)
8982 || (strncmp (type
, "sub_", 4) == 0
8983 && (type
[4] == 'I' || type
[4] == 'D')))
8985 const char *file
= main_input_filename
;
8987 file
= input_filename
;
8988 /* Just use the file's basename, because the full pathname
8989 might be quite long. */
8990 p
= q
= ASTRDUP (lbasename (file
));
8994 /* Otherwise, the name must be unique across the entire link.
8995 We don't have anything that we know to be unique to this translation
8996 unit, so use what we do have and throw in some randomness. */
8998 const char *name
= weak_global_object_name
;
8999 const char *file
= main_input_filename
;
9004 file
= input_filename
;
9006 len
= strlen (file
);
9007 q
= (char *) alloca (9 + 17 + len
+ 1);
9008 memcpy (q
, file
, len
+ 1);
9010 snprintf (q
+ len
, 9 + 17 + 1, "_%08X_" HOST_WIDE_INT_PRINT_HEX
,
9011 crc32_string (0, name
), get_random_seed (false));
9016 clean_symbol_name (q
);
9017 buf
= (char *) alloca (sizeof (FILE_FUNCTION_FORMAT
) + strlen (p
)
9020 /* Set up the name of the file-level functions we may need.
9021 Use a global object (which is already required to be unique over
9022 the program) rather than the file name (which imposes extra
9024 sprintf (buf
, FILE_FUNCTION_FORMAT
, type
, p
);
9026 return get_identifier (buf
);
9029 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
9031 /* Complain that the tree code of NODE does not match the expected 0
9032 terminated list of trailing codes. The trailing code list can be
9033 empty, for a more vague error message. FILE, LINE, and FUNCTION
9034 are of the caller. */
9037 tree_check_failed (const_tree node
, const char *file
,
9038 int line
, const char *function
, ...)
9042 unsigned length
= 0;
9043 enum tree_code code
;
9045 va_start (args
, function
);
9046 while ((code
= (enum tree_code
) va_arg (args
, int)))
9047 length
+= 4 + strlen (get_tree_code_name (code
));
9052 va_start (args
, function
);
9053 length
+= strlen ("expected ");
9054 buffer
= tmp
= (char *) alloca (length
);
9056 while ((code
= (enum tree_code
) va_arg (args
, int)))
9058 const char *prefix
= length
? " or " : "expected ";
9060 strcpy (tmp
+ length
, prefix
);
9061 length
+= strlen (prefix
);
9062 strcpy (tmp
+ length
, get_tree_code_name (code
));
9063 length
+= strlen (get_tree_code_name (code
));
9068 buffer
= "unexpected node";
9070 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9071 buffer
, get_tree_code_name (TREE_CODE (node
)),
9072 function
, trim_filename (file
), line
);
9075 /* Complain that the tree code of NODE does match the expected 0
9076 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
9080 tree_not_check_failed (const_tree node
, const char *file
,
9081 int line
, const char *function
, ...)
9085 unsigned length
= 0;
9086 enum tree_code code
;
9088 va_start (args
, function
);
9089 while ((code
= (enum tree_code
) va_arg (args
, int)))
9090 length
+= 4 + strlen (get_tree_code_name (code
));
9092 va_start (args
, function
);
9093 buffer
= (char *) alloca (length
);
9095 while ((code
= (enum tree_code
) va_arg (args
, int)))
9099 strcpy (buffer
+ length
, " or ");
9102 strcpy (buffer
+ length
, get_tree_code_name (code
));
9103 length
+= strlen (get_tree_code_name (code
));
9107 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
9108 buffer
, get_tree_code_name (TREE_CODE (node
)),
9109 function
, trim_filename (file
), line
);
9112 /* Similar to tree_check_failed, except that we check for a class of tree
9113 code, given in CL. */
9116 tree_class_check_failed (const_tree node
, const enum tree_code_class cl
,
9117 const char *file
, int line
, const char *function
)
9120 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
9121 TREE_CODE_CLASS_STRING (cl
),
9122 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
9123 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9126 /* Similar to tree_check_failed, except that instead of specifying a
9127 dozen codes, use the knowledge that they're all sequential. */
9130 tree_range_check_failed (const_tree node
, const char *file
, int line
,
9131 const char *function
, enum tree_code c1
,
9135 unsigned length
= 0;
9138 for (c
= c1
; c
<= c2
; ++c
)
9139 length
+= 4 + strlen (get_tree_code_name ((enum tree_code
) c
));
9141 length
+= strlen ("expected ");
9142 buffer
= (char *) alloca (length
);
9145 for (c
= c1
; c
<= c2
; ++c
)
9147 const char *prefix
= length
? " or " : "expected ";
9149 strcpy (buffer
+ length
, prefix
);
9150 length
+= strlen (prefix
);
9151 strcpy (buffer
+ length
, get_tree_code_name ((enum tree_code
) c
));
9152 length
+= strlen (get_tree_code_name ((enum tree_code
) c
));
9155 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9156 buffer
, get_tree_code_name (TREE_CODE (node
)),
9157 function
, trim_filename (file
), line
);
9161 /* Similar to tree_check_failed, except that we check that a tree does
9162 not have the specified code, given in CL. */
9165 tree_not_class_check_failed (const_tree node
, const enum tree_code_class cl
,
9166 const char *file
, int line
, const char *function
)
9169 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
9170 TREE_CODE_CLASS_STRING (cl
),
9171 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
9172 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9176 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
9179 omp_clause_check_failed (const_tree node
, const char *file
, int line
,
9180 const char *function
, enum omp_clause_code code
)
9182 internal_error ("tree check: expected omp_clause %s, have %s in %s, at %s:%d",
9183 omp_clause_code_name
[code
], get_tree_code_name (TREE_CODE (node
)),
9184 function
, trim_filename (file
), line
);
9188 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
9191 omp_clause_range_check_failed (const_tree node
, const char *file
, int line
,
9192 const char *function
, enum omp_clause_code c1
,
9193 enum omp_clause_code c2
)
9196 unsigned length
= 0;
9199 for (c
= c1
; c
<= c2
; ++c
)
9200 length
+= 4 + strlen (omp_clause_code_name
[c
]);
9202 length
+= strlen ("expected ");
9203 buffer
= (char *) alloca (length
);
9206 for (c
= c1
; c
<= c2
; ++c
)
9208 const char *prefix
= length
? " or " : "expected ";
9210 strcpy (buffer
+ length
, prefix
);
9211 length
+= strlen (prefix
);
9212 strcpy (buffer
+ length
, omp_clause_code_name
[c
]);
9213 length
+= strlen (omp_clause_code_name
[c
]);
9216 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9217 buffer
, omp_clause_code_name
[TREE_CODE (node
)],
9218 function
, trim_filename (file
), line
);
9222 #undef DEFTREESTRUCT
9223 #define DEFTREESTRUCT(VAL, NAME) NAME,
9225 static const char *ts_enum_names
[] = {
9226 #include "treestruct.def"
9228 #undef DEFTREESTRUCT
9230 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
9232 /* Similar to tree_class_check_failed, except that we check for
9233 whether CODE contains the tree structure identified by EN. */
9236 tree_contains_struct_check_failed (const_tree node
,
9237 const enum tree_node_structure_enum en
,
9238 const char *file
, int line
,
9239 const char *function
)
9242 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
9244 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9248 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9249 (dynamically sized) vector. */
9252 tree_int_cst_elt_check_failed (int idx
, int len
, const char *file
, int line
,
9253 const char *function
)
9256 ("tree check: accessed elt %d of tree_int_cst with %d elts in %s, at %s:%d",
9257 idx
+ 1, len
, function
, trim_filename (file
), line
);
9260 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9261 (dynamically sized) vector. */
9264 tree_vec_elt_check_failed (int idx
, int len
, const char *file
, int line
,
9265 const char *function
)
9268 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
9269 idx
+ 1, len
, function
, trim_filename (file
), line
);
9272 /* Similar to above, except that the check is for the bounds of the operand
9273 vector of an expression node EXP. */
9276 tree_operand_check_failed (int idx
, const_tree exp
, const char *file
,
9277 int line
, const char *function
)
9279 enum tree_code code
= TREE_CODE (exp
);
9281 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
9282 idx
+ 1, get_tree_code_name (code
), TREE_OPERAND_LENGTH (exp
),
9283 function
, trim_filename (file
), line
);
9286 /* Similar to above, except that the check is for the number of
9287 operands of an OMP_CLAUSE node. */
9290 omp_clause_operand_check_failed (int idx
, const_tree t
, const char *file
,
9291 int line
, const char *function
)
9294 ("tree check: accessed operand %d of omp_clause %s with %d operands "
9295 "in %s, at %s:%d", idx
+ 1, omp_clause_code_name
[OMP_CLAUSE_CODE (t
)],
9296 omp_clause_num_ops
[OMP_CLAUSE_CODE (t
)], function
,
9297 trim_filename (file
), line
);
9299 #endif /* ENABLE_TREE_CHECKING */
9301 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
9302 and mapped to the machine mode MODE. Initialize its fields and build
9303 the information necessary for debugging output. */
9306 make_vector_type (tree innertype
, int nunits
, enum machine_mode mode
)
9309 hashval_t hashcode
= 0;
9311 t
= make_node (VECTOR_TYPE
);
9312 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (innertype
);
9313 SET_TYPE_VECTOR_SUBPARTS (t
, nunits
);
9314 SET_TYPE_MODE (t
, mode
);
9316 if (TYPE_STRUCTURAL_EQUALITY_P (innertype
))
9317 SET_TYPE_STRUCTURAL_EQUALITY (t
);
9318 else if (TYPE_CANONICAL (innertype
) != innertype
9319 || mode
!= VOIDmode
)
9321 = make_vector_type (TYPE_CANONICAL (innertype
), nunits
, VOIDmode
);
9325 hashcode
= iterative_hash_host_wide_int (VECTOR_TYPE
, hashcode
);
9326 hashcode
= iterative_hash_host_wide_int (nunits
, hashcode
);
9327 hashcode
= iterative_hash_host_wide_int (mode
, hashcode
);
9328 hashcode
= iterative_hash_object (TYPE_HASH (TREE_TYPE (t
)), hashcode
);
9329 t
= type_hash_canon (hashcode
, t
);
9331 /* We have built a main variant, based on the main variant of the
9332 inner type. Use it to build the variant we return. */
9333 if ((TYPE_ATTRIBUTES (innertype
) || TYPE_QUALS (innertype
))
9334 && TREE_TYPE (t
) != innertype
)
9335 return build_type_attribute_qual_variant (t
,
9336 TYPE_ATTRIBUTES (innertype
),
9337 TYPE_QUALS (innertype
));
9343 make_or_reuse_type (unsigned size
, int unsignedp
)
9345 if (size
== INT_TYPE_SIZE
)
9346 return unsignedp
? unsigned_type_node
: integer_type_node
;
9347 if (size
== CHAR_TYPE_SIZE
)
9348 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
9349 if (size
== SHORT_TYPE_SIZE
)
9350 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
9351 if (size
== LONG_TYPE_SIZE
)
9352 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
9353 if (size
== LONG_LONG_TYPE_SIZE
)
9354 return (unsignedp
? long_long_unsigned_type_node
9355 : long_long_integer_type_node
);
9356 if (size
== 128 && int128_integer_type_node
)
9357 return (unsignedp
? int128_unsigned_type_node
9358 : int128_integer_type_node
);
9361 return make_unsigned_type (size
);
9363 return make_signed_type (size
);
9366 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
9369 make_or_reuse_fract_type (unsigned size
, int unsignedp
, int satp
)
9373 if (size
== SHORT_FRACT_TYPE_SIZE
)
9374 return unsignedp
? sat_unsigned_short_fract_type_node
9375 : sat_short_fract_type_node
;
9376 if (size
== FRACT_TYPE_SIZE
)
9377 return unsignedp
? sat_unsigned_fract_type_node
: sat_fract_type_node
;
9378 if (size
== LONG_FRACT_TYPE_SIZE
)
9379 return unsignedp
? sat_unsigned_long_fract_type_node
9380 : sat_long_fract_type_node
;
9381 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
9382 return unsignedp
? sat_unsigned_long_long_fract_type_node
9383 : sat_long_long_fract_type_node
;
9387 if (size
== SHORT_FRACT_TYPE_SIZE
)
9388 return unsignedp
? unsigned_short_fract_type_node
9389 : short_fract_type_node
;
9390 if (size
== FRACT_TYPE_SIZE
)
9391 return unsignedp
? unsigned_fract_type_node
: fract_type_node
;
9392 if (size
== LONG_FRACT_TYPE_SIZE
)
9393 return unsignedp
? unsigned_long_fract_type_node
9394 : long_fract_type_node
;
9395 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
9396 return unsignedp
? unsigned_long_long_fract_type_node
9397 : long_long_fract_type_node
;
9400 return make_fract_type (size
, unsignedp
, satp
);
9403 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
9406 make_or_reuse_accum_type (unsigned size
, int unsignedp
, int satp
)
9410 if (size
== SHORT_ACCUM_TYPE_SIZE
)
9411 return unsignedp
? sat_unsigned_short_accum_type_node
9412 : sat_short_accum_type_node
;
9413 if (size
== ACCUM_TYPE_SIZE
)
9414 return unsignedp
? sat_unsigned_accum_type_node
: sat_accum_type_node
;
9415 if (size
== LONG_ACCUM_TYPE_SIZE
)
9416 return unsignedp
? sat_unsigned_long_accum_type_node
9417 : sat_long_accum_type_node
;
9418 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
9419 return unsignedp
? sat_unsigned_long_long_accum_type_node
9420 : sat_long_long_accum_type_node
;
9424 if (size
== SHORT_ACCUM_TYPE_SIZE
)
9425 return unsignedp
? unsigned_short_accum_type_node
9426 : short_accum_type_node
;
9427 if (size
== ACCUM_TYPE_SIZE
)
9428 return unsignedp
? unsigned_accum_type_node
: accum_type_node
;
9429 if (size
== LONG_ACCUM_TYPE_SIZE
)
9430 return unsignedp
? unsigned_long_accum_type_node
9431 : long_accum_type_node
;
9432 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
9433 return unsignedp
? unsigned_long_long_accum_type_node
9434 : long_long_accum_type_node
;
9437 return make_accum_type (size
, unsignedp
, satp
);
9441 /* Create an atomic variant node for TYPE. This routine is called
9442 during initialization of data types to create the 5 basic atomic
9443 types. The generic build_variant_type function requires these to
9444 already be set up in order to function properly, so cannot be
9445 called from there. */
9448 build_atomic_base (tree type
)
9452 /* Make sure its not already registered. */
9453 if ((t
= get_qualified_type (type
, TYPE_QUAL_ATOMIC
)))
9456 t
= build_variant_type_copy (type
);
9457 set_type_quals (t
, TYPE_QUAL_ATOMIC
);
9462 /* Create nodes for all integer types (and error_mark_node) using the sizes
9463 of C datatypes. SIGNED_CHAR specifies whether char is signed,
9464 SHORT_DOUBLE specifies whether double should be of the same precision
9468 build_common_tree_nodes (bool signed_char
, bool short_double
)
9470 error_mark_node
= make_node (ERROR_MARK
);
9471 TREE_TYPE (error_mark_node
) = error_mark_node
;
9473 initialize_sizetypes ();
9475 /* Define both `signed char' and `unsigned char'. */
9476 signed_char_type_node
= make_signed_type (CHAR_TYPE_SIZE
);
9477 TYPE_STRING_FLAG (signed_char_type_node
) = 1;
9478 unsigned_char_type_node
= make_unsigned_type (CHAR_TYPE_SIZE
);
9479 TYPE_STRING_FLAG (unsigned_char_type_node
) = 1;
9481 /* Define `char', which is like either `signed char' or `unsigned char'
9482 but not the same as either. */
9485 ? make_signed_type (CHAR_TYPE_SIZE
)
9486 : make_unsigned_type (CHAR_TYPE_SIZE
));
9487 TYPE_STRING_FLAG (char_type_node
) = 1;
9489 short_integer_type_node
= make_signed_type (SHORT_TYPE_SIZE
);
9490 short_unsigned_type_node
= make_unsigned_type (SHORT_TYPE_SIZE
);
9491 integer_type_node
= make_signed_type (INT_TYPE_SIZE
);
9492 unsigned_type_node
= make_unsigned_type (INT_TYPE_SIZE
);
9493 long_integer_type_node
= make_signed_type (LONG_TYPE_SIZE
);
9494 long_unsigned_type_node
= make_unsigned_type (LONG_TYPE_SIZE
);
9495 long_long_integer_type_node
= make_signed_type (LONG_LONG_TYPE_SIZE
);
9496 long_long_unsigned_type_node
= make_unsigned_type (LONG_LONG_TYPE_SIZE
);
9497 #if HOST_BITS_PER_WIDE_INT >= 64
9498 /* TODO: This isn't correct, but as logic depends at the moment on
9499 host's instead of target's wide-integer.
9500 If there is a target not supporting TImode, but has an 128-bit
9501 integer-scalar register, this target check needs to be adjusted. */
9502 if (targetm
.scalar_mode_supported_p (TImode
))
9504 int128_integer_type_node
= make_signed_type (128);
9505 int128_unsigned_type_node
= make_unsigned_type (128);
9509 /* Define a boolean type. This type only represents boolean values but
9510 may be larger than char depending on the value of BOOL_TYPE_SIZE. */
9511 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
9512 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
9513 TYPE_PRECISION (boolean_type_node
) = 1;
9514 TYPE_MAX_VALUE (boolean_type_node
) = build_int_cst (boolean_type_node
, 1);
9516 /* Define what type to use for size_t. */
9517 if (strcmp (SIZE_TYPE
, "unsigned int") == 0)
9518 size_type_node
= unsigned_type_node
;
9519 else if (strcmp (SIZE_TYPE
, "long unsigned int") == 0)
9520 size_type_node
= long_unsigned_type_node
;
9521 else if (strcmp (SIZE_TYPE
, "long long unsigned int") == 0)
9522 size_type_node
= long_long_unsigned_type_node
;
9523 else if (strcmp (SIZE_TYPE
, "short unsigned int") == 0)
9524 size_type_node
= short_unsigned_type_node
;
9528 /* Fill in the rest of the sized types. Reuse existing type nodes
9530 intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 0);
9531 intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 0);
9532 intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 0);
9533 intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 0);
9534 intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 0);
9536 unsigned_intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 1);
9537 unsigned_intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 1);
9538 unsigned_intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 1);
9539 unsigned_intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 1);
9540 unsigned_intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 1);
9542 /* Don't call build_qualified type for atomics. That routine does
9543 special processing for atomics, and until they are initialized
9544 it's better not to make that call. */
9546 atomicQI_type_node
= build_atomic_base (unsigned_intQI_type_node
);
9547 atomicHI_type_node
= build_atomic_base (unsigned_intHI_type_node
);
9548 atomicSI_type_node
= build_atomic_base (unsigned_intSI_type_node
);
9549 atomicDI_type_node
= build_atomic_base (unsigned_intDI_type_node
);
9550 atomicTI_type_node
= build_atomic_base (unsigned_intTI_type_node
);
9552 access_public_node
= get_identifier ("public");
9553 access_protected_node
= get_identifier ("protected");
9554 access_private_node
= get_identifier ("private");
9556 /* Define these next since types below may used them. */
9557 integer_zero_node
= build_int_cst (integer_type_node
, 0);
9558 integer_one_node
= build_int_cst (integer_type_node
, 1);
9559 integer_three_node
= build_int_cst (integer_type_node
, 3);
9560 integer_minus_one_node
= build_int_cst (integer_type_node
, -1);
9562 size_zero_node
= size_int (0);
9563 size_one_node
= size_int (1);
9564 bitsize_zero_node
= bitsize_int (0);
9565 bitsize_one_node
= bitsize_int (1);
9566 bitsize_unit_node
= bitsize_int (BITS_PER_UNIT
);
9568 boolean_false_node
= TYPE_MIN_VALUE (boolean_type_node
);
9569 boolean_true_node
= TYPE_MAX_VALUE (boolean_type_node
);
9571 void_type_node
= make_node (VOID_TYPE
);
9572 layout_type (void_type_node
);
9574 pointer_bounds_type_node
= targetm
.chkp_bound_type ();
9576 /* We are not going to have real types in C with less than byte alignment,
9577 so we might as well not have any types that claim to have it. */
9578 TYPE_ALIGN (void_type_node
) = BITS_PER_UNIT
;
9579 TYPE_USER_ALIGN (void_type_node
) = 0;
9581 null_pointer_node
= build_int_cst (build_pointer_type (void_type_node
), 0);
9582 layout_type (TREE_TYPE (null_pointer_node
));
9584 ptr_type_node
= build_pointer_type (void_type_node
);
9586 = build_pointer_type (build_type_variant (void_type_node
, 1, 0));
9587 fileptr_type_node
= ptr_type_node
;
9589 pointer_sized_int_node
= build_nonstandard_integer_type (POINTER_SIZE
, 1);
9591 float_type_node
= make_node (REAL_TYPE
);
9592 TYPE_PRECISION (float_type_node
) = FLOAT_TYPE_SIZE
;
9593 layout_type (float_type_node
);
9595 double_type_node
= make_node (REAL_TYPE
);
9597 TYPE_PRECISION (double_type_node
) = FLOAT_TYPE_SIZE
;
9599 TYPE_PRECISION (double_type_node
) = DOUBLE_TYPE_SIZE
;
9600 layout_type (double_type_node
);
9602 long_double_type_node
= make_node (REAL_TYPE
);
9603 TYPE_PRECISION (long_double_type_node
) = LONG_DOUBLE_TYPE_SIZE
;
9604 layout_type (long_double_type_node
);
9606 float_ptr_type_node
= build_pointer_type (float_type_node
);
9607 double_ptr_type_node
= build_pointer_type (double_type_node
);
9608 long_double_ptr_type_node
= build_pointer_type (long_double_type_node
);
9609 integer_ptr_type_node
= build_pointer_type (integer_type_node
);
9611 /* Fixed size integer types. */
9612 uint16_type_node
= build_nonstandard_integer_type (16, true);
9613 uint32_type_node
= build_nonstandard_integer_type (32, true);
9614 uint64_type_node
= build_nonstandard_integer_type (64, true);
9616 /* Decimal float types. */
9617 dfloat32_type_node
= make_node (REAL_TYPE
);
9618 TYPE_PRECISION (dfloat32_type_node
) = DECIMAL32_TYPE_SIZE
;
9619 layout_type (dfloat32_type_node
);
9620 SET_TYPE_MODE (dfloat32_type_node
, SDmode
);
9621 dfloat32_ptr_type_node
= build_pointer_type (dfloat32_type_node
);
9623 dfloat64_type_node
= make_node (REAL_TYPE
);
9624 TYPE_PRECISION (dfloat64_type_node
) = DECIMAL64_TYPE_SIZE
;
9625 layout_type (dfloat64_type_node
);
9626 SET_TYPE_MODE (dfloat64_type_node
, DDmode
);
9627 dfloat64_ptr_type_node
= build_pointer_type (dfloat64_type_node
);
9629 dfloat128_type_node
= make_node (REAL_TYPE
);
9630 TYPE_PRECISION (dfloat128_type_node
) = DECIMAL128_TYPE_SIZE
;
9631 layout_type (dfloat128_type_node
);
9632 SET_TYPE_MODE (dfloat128_type_node
, TDmode
);
9633 dfloat128_ptr_type_node
= build_pointer_type (dfloat128_type_node
);
9635 complex_integer_type_node
= build_complex_type (integer_type_node
);
9636 complex_float_type_node
= build_complex_type (float_type_node
);
9637 complex_double_type_node
= build_complex_type (double_type_node
);
9638 complex_long_double_type_node
= build_complex_type (long_double_type_node
);
9640 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
9641 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
9642 sat_ ## KIND ## _type_node = \
9643 make_sat_signed_ ## KIND ## _type (SIZE); \
9644 sat_unsigned_ ## KIND ## _type_node = \
9645 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9646 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9647 unsigned_ ## KIND ## _type_node = \
9648 make_unsigned_ ## KIND ## _type (SIZE);
9650 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
9651 sat_ ## WIDTH ## KIND ## _type_node = \
9652 make_sat_signed_ ## KIND ## _type (SIZE); \
9653 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
9654 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9655 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9656 unsigned_ ## WIDTH ## KIND ## _type_node = \
9657 make_unsigned_ ## KIND ## _type (SIZE);
9659 /* Make fixed-point type nodes based on four different widths. */
9660 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
9661 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
9662 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
9663 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
9664 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
9666 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
9667 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
9668 NAME ## _type_node = \
9669 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
9670 u ## NAME ## _type_node = \
9671 make_or_reuse_unsigned_ ## KIND ## _type \
9672 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
9673 sat_ ## NAME ## _type_node = \
9674 make_or_reuse_sat_signed_ ## KIND ## _type \
9675 (GET_MODE_BITSIZE (MODE ## mode)); \
9676 sat_u ## NAME ## _type_node = \
9677 make_or_reuse_sat_unsigned_ ## KIND ## _type \
9678 (GET_MODE_BITSIZE (U ## MODE ## mode));
9680 /* Fixed-point type and mode nodes. */
9681 MAKE_FIXED_TYPE_NODE_FAMILY (fract
, FRACT
)
9682 MAKE_FIXED_TYPE_NODE_FAMILY (accum
, ACCUM
)
9683 MAKE_FIXED_MODE_NODE (fract
, qq
, QQ
)
9684 MAKE_FIXED_MODE_NODE (fract
, hq
, HQ
)
9685 MAKE_FIXED_MODE_NODE (fract
, sq
, SQ
)
9686 MAKE_FIXED_MODE_NODE (fract
, dq
, DQ
)
9687 MAKE_FIXED_MODE_NODE (fract
, tq
, TQ
)
9688 MAKE_FIXED_MODE_NODE (accum
, ha
, HA
)
9689 MAKE_FIXED_MODE_NODE (accum
, sa
, SA
)
9690 MAKE_FIXED_MODE_NODE (accum
, da
, DA
)
9691 MAKE_FIXED_MODE_NODE (accum
, ta
, TA
)
9694 tree t
= targetm
.build_builtin_va_list ();
9696 /* Many back-ends define record types without setting TYPE_NAME.
9697 If we copied the record type here, we'd keep the original
9698 record type without a name. This breaks name mangling. So,
9699 don't copy record types and let c_common_nodes_and_builtins()
9700 declare the type to be __builtin_va_list. */
9701 if (TREE_CODE (t
) != RECORD_TYPE
)
9702 t
= build_variant_type_copy (t
);
9704 va_list_type_node
= t
;
9708 /* Modify DECL for given flags.
9709 TM_PURE attribute is set only on types, so the function will modify
9710 DECL's type when ECF_TM_PURE is used. */
9713 set_call_expr_flags (tree decl
, int flags
)
9715 if (flags
& ECF_NOTHROW
)
9716 TREE_NOTHROW (decl
) = 1;
9717 if (flags
& ECF_CONST
)
9718 TREE_READONLY (decl
) = 1;
9719 if (flags
& ECF_PURE
)
9720 DECL_PURE_P (decl
) = 1;
9721 if (flags
& ECF_LOOPING_CONST_OR_PURE
)
9722 DECL_LOOPING_CONST_OR_PURE_P (decl
) = 1;
9723 if (flags
& ECF_NOVOPS
)
9724 DECL_IS_NOVOPS (decl
) = 1;
9725 if (flags
& ECF_NORETURN
)
9726 TREE_THIS_VOLATILE (decl
) = 1;
9727 if (flags
& ECF_MALLOC
)
9728 DECL_IS_MALLOC (decl
) = 1;
9729 if (flags
& ECF_RETURNS_TWICE
)
9730 DECL_IS_RETURNS_TWICE (decl
) = 1;
9731 if (flags
& ECF_LEAF
)
9732 DECL_ATTRIBUTES (decl
) = tree_cons (get_identifier ("leaf"),
9733 NULL
, DECL_ATTRIBUTES (decl
));
9734 if ((flags
& ECF_TM_PURE
) && flag_tm
)
9735 apply_tm_attr (decl
, get_identifier ("transaction_pure"));
9736 /* Looping const or pure is implied by noreturn.
9737 There is currently no way to declare looping const or looping pure alone. */
9738 gcc_assert (!(flags
& ECF_LOOPING_CONST_OR_PURE
)
9739 || ((flags
& ECF_NORETURN
) && (flags
& (ECF_CONST
| ECF_PURE
))));
9743 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
9746 local_define_builtin (const char *name
, tree type
, enum built_in_function code
,
9747 const char *library_name
, int ecf_flags
)
9751 decl
= add_builtin_function (name
, type
, code
, BUILT_IN_NORMAL
,
9752 library_name
, NULL_TREE
);
9753 set_call_expr_flags (decl
, ecf_flags
);
9755 set_builtin_decl (code
, decl
, true);
9758 /* Call this function after instantiating all builtins that the language
9759 front end cares about. This will build the rest of the builtins that
9760 are relied upon by the tree optimizers and the middle-end. */
9763 build_common_builtin_nodes (void)
9768 if (!builtin_decl_explicit_p (BUILT_IN_UNREACHABLE
))
9770 ftype
= build_function_type (void_type_node
, void_list_node
);
9771 local_define_builtin ("__builtin_unreachable", ftype
, BUILT_IN_UNREACHABLE
,
9772 "__builtin_unreachable",
9773 ECF_NOTHROW
| ECF_LEAF
| ECF_NORETURN
9774 | ECF_CONST
| ECF_LEAF
);
9777 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
)
9778 || !builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
9780 ftype
= build_function_type_list (ptr_type_node
,
9781 ptr_type_node
, const_ptr_type_node
,
9782 size_type_node
, NULL_TREE
);
9784 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
))
9785 local_define_builtin ("__builtin_memcpy", ftype
, BUILT_IN_MEMCPY
,
9786 "memcpy", ECF_NOTHROW
| ECF_LEAF
);
9787 if (!builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
9788 local_define_builtin ("__builtin_memmove", ftype
, BUILT_IN_MEMMOVE
,
9789 "memmove", ECF_NOTHROW
| ECF_LEAF
);
9792 if (!builtin_decl_explicit_p (BUILT_IN_MEMCMP
))
9794 ftype
= build_function_type_list (integer_type_node
, const_ptr_type_node
,
9795 const_ptr_type_node
, size_type_node
,
9797 local_define_builtin ("__builtin_memcmp", ftype
, BUILT_IN_MEMCMP
,
9798 "memcmp", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
9801 if (!builtin_decl_explicit_p (BUILT_IN_MEMSET
))
9803 ftype
= build_function_type_list (ptr_type_node
,
9804 ptr_type_node
, integer_type_node
,
9805 size_type_node
, NULL_TREE
);
9806 local_define_builtin ("__builtin_memset", ftype
, BUILT_IN_MEMSET
,
9807 "memset", ECF_NOTHROW
| ECF_LEAF
);
9810 if (!builtin_decl_explicit_p (BUILT_IN_ALLOCA
))
9812 ftype
= build_function_type_list (ptr_type_node
,
9813 size_type_node
, NULL_TREE
);
9814 local_define_builtin ("__builtin_alloca", ftype
, BUILT_IN_ALLOCA
,
9815 "alloca", ECF_MALLOC
| ECF_NOTHROW
| ECF_LEAF
);
9818 ftype
= build_function_type_list (ptr_type_node
, size_type_node
,
9819 size_type_node
, NULL_TREE
);
9820 local_define_builtin ("__builtin_alloca_with_align", ftype
,
9821 BUILT_IN_ALLOCA_WITH_ALIGN
, "alloca",
9822 ECF_MALLOC
| ECF_NOTHROW
| ECF_LEAF
);
9824 /* If we're checking the stack, `alloca' can throw. */
9825 if (flag_stack_check
)
9827 TREE_NOTHROW (builtin_decl_explicit (BUILT_IN_ALLOCA
)) = 0;
9828 TREE_NOTHROW (builtin_decl_explicit (BUILT_IN_ALLOCA_WITH_ALIGN
)) = 0;
9831 ftype
= build_function_type_list (void_type_node
,
9832 ptr_type_node
, ptr_type_node
,
9833 ptr_type_node
, NULL_TREE
);
9834 local_define_builtin ("__builtin_init_trampoline", ftype
,
9835 BUILT_IN_INIT_TRAMPOLINE
,
9836 "__builtin_init_trampoline", ECF_NOTHROW
| ECF_LEAF
);
9837 local_define_builtin ("__builtin_init_heap_trampoline", ftype
,
9838 BUILT_IN_INIT_HEAP_TRAMPOLINE
,
9839 "__builtin_init_heap_trampoline",
9840 ECF_NOTHROW
| ECF_LEAF
);
9842 ftype
= build_function_type_list (ptr_type_node
, ptr_type_node
, NULL_TREE
);
9843 local_define_builtin ("__builtin_adjust_trampoline", ftype
,
9844 BUILT_IN_ADJUST_TRAMPOLINE
,
9845 "__builtin_adjust_trampoline",
9846 ECF_CONST
| ECF_NOTHROW
);
9848 ftype
= build_function_type_list (void_type_node
,
9849 ptr_type_node
, ptr_type_node
, NULL_TREE
);
9850 local_define_builtin ("__builtin_nonlocal_goto", ftype
,
9851 BUILT_IN_NONLOCAL_GOTO
,
9852 "__builtin_nonlocal_goto",
9853 ECF_NORETURN
| ECF_NOTHROW
);
9855 ftype
= build_function_type_list (void_type_node
,
9856 ptr_type_node
, ptr_type_node
, NULL_TREE
);
9857 local_define_builtin ("__builtin_setjmp_setup", ftype
,
9858 BUILT_IN_SETJMP_SETUP
,
9859 "__builtin_setjmp_setup", ECF_NOTHROW
);
9861 ftype
= build_function_type_list (ptr_type_node
, ptr_type_node
, NULL_TREE
);
9862 local_define_builtin ("__builtin_setjmp_dispatcher", ftype
,
9863 BUILT_IN_SETJMP_DISPATCHER
,
9864 "__builtin_setjmp_dispatcher",
9865 ECF_PURE
| ECF_NOTHROW
);
9867 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
9868 local_define_builtin ("__builtin_setjmp_receiver", ftype
,
9869 BUILT_IN_SETJMP_RECEIVER
,
9870 "__builtin_setjmp_receiver", ECF_NOTHROW
);
9872 ftype
= build_function_type_list (ptr_type_node
, NULL_TREE
);
9873 local_define_builtin ("__builtin_stack_save", ftype
, BUILT_IN_STACK_SAVE
,
9874 "__builtin_stack_save", ECF_NOTHROW
| ECF_LEAF
);
9876 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
9877 local_define_builtin ("__builtin_stack_restore", ftype
,
9878 BUILT_IN_STACK_RESTORE
,
9879 "__builtin_stack_restore", ECF_NOTHROW
| ECF_LEAF
);
9881 /* If there's a possibility that we might use the ARM EABI, build the
9882 alternate __cxa_end_cleanup node used to resume from C++ and Java. */
9883 if (targetm
.arm_eabi_unwinder
)
9885 ftype
= build_function_type_list (void_type_node
, NULL_TREE
);
9886 local_define_builtin ("__builtin_cxa_end_cleanup", ftype
,
9887 BUILT_IN_CXA_END_CLEANUP
,
9888 "__cxa_end_cleanup", ECF_NORETURN
| ECF_LEAF
);
9891 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
9892 local_define_builtin ("__builtin_unwind_resume", ftype
,
9893 BUILT_IN_UNWIND_RESUME
,
9894 ((targetm_common
.except_unwind_info (&global_options
)
9896 ? "_Unwind_SjLj_Resume" : "_Unwind_Resume"),
9899 if (builtin_decl_explicit (BUILT_IN_RETURN_ADDRESS
) == NULL_TREE
)
9901 ftype
= build_function_type_list (ptr_type_node
, integer_type_node
,
9903 local_define_builtin ("__builtin_return_address", ftype
,
9904 BUILT_IN_RETURN_ADDRESS
,
9905 "__builtin_return_address",
9909 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
)
9910 || !builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
9912 ftype
= build_function_type_list (void_type_node
, ptr_type_node
,
9913 ptr_type_node
, NULL_TREE
);
9914 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
))
9915 local_define_builtin ("__cyg_profile_func_enter", ftype
,
9916 BUILT_IN_PROFILE_FUNC_ENTER
,
9917 "__cyg_profile_func_enter", 0);
9918 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
9919 local_define_builtin ("__cyg_profile_func_exit", ftype
,
9920 BUILT_IN_PROFILE_FUNC_EXIT
,
9921 "__cyg_profile_func_exit", 0);
9924 /* The exception object and filter values from the runtime. The argument
9925 must be zero before exception lowering, i.e. from the front end. After
9926 exception lowering, it will be the region number for the exception
9927 landing pad. These functions are PURE instead of CONST to prevent
9928 them from being hoisted past the exception edge that will initialize
9929 its value in the landing pad. */
9930 ftype
= build_function_type_list (ptr_type_node
,
9931 integer_type_node
, NULL_TREE
);
9932 ecf_flags
= ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
;
9933 /* Only use TM_PURE if we we have TM language support. */
9934 if (builtin_decl_explicit_p (BUILT_IN_TM_LOAD_1
))
9935 ecf_flags
|= ECF_TM_PURE
;
9936 local_define_builtin ("__builtin_eh_pointer", ftype
, BUILT_IN_EH_POINTER
,
9937 "__builtin_eh_pointer", ecf_flags
);
9939 tmp
= lang_hooks
.types
.type_for_mode (targetm
.eh_return_filter_mode (), 0);
9940 ftype
= build_function_type_list (tmp
, integer_type_node
, NULL_TREE
);
9941 local_define_builtin ("__builtin_eh_filter", ftype
, BUILT_IN_EH_FILTER
,
9942 "__builtin_eh_filter", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
9944 ftype
= build_function_type_list (void_type_node
,
9945 integer_type_node
, integer_type_node
,
9947 local_define_builtin ("__builtin_eh_copy_values", ftype
,
9948 BUILT_IN_EH_COPY_VALUES
,
9949 "__builtin_eh_copy_values", ECF_NOTHROW
);
9951 /* Complex multiplication and division. These are handled as builtins
9952 rather than optabs because emit_library_call_value doesn't support
9953 complex. Further, we can do slightly better with folding these
9954 beasties if the real and complex parts of the arguments are separate. */
9958 for (mode
= MIN_MODE_COMPLEX_FLOAT
; mode
<= MAX_MODE_COMPLEX_FLOAT
; ++mode
)
9960 char mode_name_buf
[4], *q
;
9962 enum built_in_function mcode
, dcode
;
9963 tree type
, inner_type
;
9964 const char *prefix
= "__";
9966 if (targetm
.libfunc_gnu_prefix
)
9969 type
= lang_hooks
.types
.type_for_mode ((enum machine_mode
) mode
, 0);
9972 inner_type
= TREE_TYPE (type
);
9974 ftype
= build_function_type_list (type
, inner_type
, inner_type
,
9975 inner_type
, inner_type
, NULL_TREE
);
9977 mcode
= ((enum built_in_function
)
9978 (BUILT_IN_COMPLEX_MUL_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
9979 dcode
= ((enum built_in_function
)
9980 (BUILT_IN_COMPLEX_DIV_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
9982 for (p
= GET_MODE_NAME (mode
), q
= mode_name_buf
; *p
; p
++, q
++)
9986 built_in_names
[mcode
] = concat (prefix
, "mul", mode_name_buf
, "3",
9988 local_define_builtin (built_in_names
[mcode
], ftype
, mcode
,
9989 built_in_names
[mcode
],
9990 ECF_CONST
| ECF_NOTHROW
| ECF_LEAF
);
9992 built_in_names
[dcode
] = concat (prefix
, "div", mode_name_buf
, "3",
9994 local_define_builtin (built_in_names
[dcode
], ftype
, dcode
,
9995 built_in_names
[dcode
],
9996 ECF_CONST
| ECF_NOTHROW
| ECF_LEAF
);
10001 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
10004 If we requested a pointer to a vector, build up the pointers that
10005 we stripped off while looking for the inner type. Similarly for
10006 return values from functions.
10008 The argument TYPE is the top of the chain, and BOTTOM is the
10009 new type which we will point to. */
10012 reconstruct_complex_type (tree type
, tree bottom
)
10016 if (TREE_CODE (type
) == POINTER_TYPE
)
10018 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10019 outer
= build_pointer_type_for_mode (inner
, TYPE_MODE (type
),
10020 TYPE_REF_CAN_ALIAS_ALL (type
));
10022 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
10024 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10025 outer
= build_reference_type_for_mode (inner
, TYPE_MODE (type
),
10026 TYPE_REF_CAN_ALIAS_ALL (type
));
10028 else if (TREE_CODE (type
) == ARRAY_TYPE
)
10030 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10031 outer
= build_array_type (inner
, TYPE_DOMAIN (type
));
10033 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10035 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10036 outer
= build_function_type (inner
, TYPE_ARG_TYPES (type
));
10038 else if (TREE_CODE (type
) == METHOD_TYPE
)
10040 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10041 /* The build_method_type_directly() routine prepends 'this' to argument list,
10042 so we must compensate by getting rid of it. */
10044 = build_method_type_directly
10045 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
))),
10047 TREE_CHAIN (TYPE_ARG_TYPES (type
)));
10049 else if (TREE_CODE (type
) == OFFSET_TYPE
)
10051 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10052 outer
= build_offset_type (TYPE_OFFSET_BASETYPE (type
), inner
);
10057 return build_type_attribute_qual_variant (outer
, TYPE_ATTRIBUTES (type
),
10058 TYPE_QUALS (type
));
10061 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
10064 build_vector_type_for_mode (tree innertype
, enum machine_mode mode
)
10068 switch (GET_MODE_CLASS (mode
))
10070 case MODE_VECTOR_INT
:
10071 case MODE_VECTOR_FLOAT
:
10072 case MODE_VECTOR_FRACT
:
10073 case MODE_VECTOR_UFRACT
:
10074 case MODE_VECTOR_ACCUM
:
10075 case MODE_VECTOR_UACCUM
:
10076 nunits
= GET_MODE_NUNITS (mode
);
10080 /* Check that there are no leftover bits. */
10081 gcc_assert (GET_MODE_BITSIZE (mode
)
10082 % tree_to_hwi (TYPE_SIZE (innertype
)) == 0);
10084 nunits
= GET_MODE_BITSIZE (mode
)
10085 / tree_to_hwi (TYPE_SIZE (innertype
));
10089 gcc_unreachable ();
10092 return make_vector_type (innertype
, nunits
, mode
);
10095 /* Similarly, but takes the inner type and number of units, which must be
10099 build_vector_type (tree innertype
, int nunits
)
10101 return make_vector_type (innertype
, nunits
, VOIDmode
);
10104 /* Similarly, but builds a variant type with TYPE_VECTOR_OPAQUE set. */
10107 build_opaque_vector_type (tree innertype
, int nunits
)
10109 tree t
= make_vector_type (innertype
, nunits
, VOIDmode
);
10111 /* We always build the non-opaque variant before the opaque one,
10112 so if it already exists, it is TYPE_NEXT_VARIANT of this one. */
10113 cand
= TYPE_NEXT_VARIANT (t
);
10115 && TYPE_VECTOR_OPAQUE (cand
)
10116 && check_qualified_type (cand
, t
, TYPE_QUALS (t
)))
10118 /* Othewise build a variant type and make sure to queue it after
10119 the non-opaque type. */
10120 cand
= build_distinct_type_copy (t
);
10121 TYPE_VECTOR_OPAQUE (cand
) = true;
10122 TYPE_CANONICAL (cand
) = TYPE_CANONICAL (t
);
10123 TYPE_NEXT_VARIANT (cand
) = TYPE_NEXT_VARIANT (t
);
10124 TYPE_NEXT_VARIANT (t
) = cand
;
10125 TYPE_MAIN_VARIANT (cand
) = TYPE_MAIN_VARIANT (t
);
10130 /* Given an initializer INIT, return TRUE if INIT is zero or some
10131 aggregate of zeros. Otherwise return FALSE. */
10133 initializer_zerop (const_tree init
)
10139 switch (TREE_CODE (init
))
10142 return integer_zerop (init
);
10145 /* ??? Note that this is not correct for C4X float formats. There,
10146 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
10147 negative exponent. */
10148 return real_zerop (init
)
10149 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init
));
10152 return fixed_zerop (init
);
10155 return integer_zerop (init
)
10156 || (real_zerop (init
)
10157 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init
)))
10158 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init
))));
10163 for (i
= 0; i
< VECTOR_CST_NELTS (init
); ++i
)
10164 if (!initializer_zerop (VECTOR_CST_ELT (init
, i
)))
10171 unsigned HOST_WIDE_INT idx
;
10173 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init
), idx
, elt
)
10174 if (!initializer_zerop (elt
))
10183 /* We need to loop through all elements to handle cases like
10184 "\0" and "\0foobar". */
10185 for (i
= 0; i
< TREE_STRING_LENGTH (init
); ++i
)
10186 if (TREE_STRING_POINTER (init
)[i
] != '\0')
10197 /* Check if vector VEC consists of all the equal elements and
10198 that the number of elements corresponds to the type of VEC.
10199 The function returns first element of the vector
10200 or NULL_TREE if the vector is not uniform. */
10202 uniform_vector_p (const_tree vec
)
10207 if (vec
== NULL_TREE
)
10210 gcc_assert (VECTOR_TYPE_P (TREE_TYPE (vec
)));
10212 if (TREE_CODE (vec
) == VECTOR_CST
)
10214 first
= VECTOR_CST_ELT (vec
, 0);
10215 for (i
= 1; i
< VECTOR_CST_NELTS (vec
); ++i
)
10216 if (!operand_equal_p (first
, VECTOR_CST_ELT (vec
, i
), 0))
10222 else if (TREE_CODE (vec
) == CONSTRUCTOR
)
10224 first
= error_mark_node
;
10226 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (vec
), i
, t
)
10233 if (!operand_equal_p (first
, t
, 0))
10236 if (i
!= TYPE_VECTOR_SUBPARTS (TREE_TYPE (vec
)))
10245 /* Build an empty statement at location LOC. */
10248 build_empty_stmt (location_t loc
)
10250 tree t
= build1 (NOP_EXPR
, void_type_node
, size_zero_node
);
10251 SET_EXPR_LOCATION (t
, loc
);
10256 /* Build an OpenMP clause with code CODE. LOC is the location of the
10260 build_omp_clause (location_t loc
, enum omp_clause_code code
)
10265 length
= omp_clause_num_ops
[code
];
10266 size
= (sizeof (struct tree_omp_clause
) + (length
- 1) * sizeof (tree
));
10268 record_node_allocation_statistics (OMP_CLAUSE
, size
);
10270 t
= ggc_alloc_tree_node (size
);
10271 memset (t
, 0, size
);
10272 TREE_SET_CODE (t
, OMP_CLAUSE
);
10273 OMP_CLAUSE_SET_CODE (t
, code
);
10274 OMP_CLAUSE_LOCATION (t
) = loc
;
10279 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
10280 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
10281 Except for the CODE and operand count field, other storage for the
10282 object is initialized to zeros. */
10285 build_vl_exp_stat (enum tree_code code
, int len MEM_STAT_DECL
)
10288 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_exp
);
10290 gcc_assert (TREE_CODE_CLASS (code
) == tcc_vl_exp
);
10291 gcc_assert (len
>= 1);
10293 record_node_allocation_statistics (code
, length
);
10295 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
10297 TREE_SET_CODE (t
, code
);
10299 /* Can't use TREE_OPERAND to store the length because if checking is
10300 enabled, it will try to check the length before we store it. :-P */
10301 t
->exp
.operands
[0] = build_int_cst (sizetype
, len
);
10306 /* Helper function for build_call_* functions; build a CALL_EXPR with
10307 indicated RETURN_TYPE, FN, and NARGS, but do not initialize any of
10308 the argument slots. */
10311 build_call_1 (tree return_type
, tree fn
, int nargs
)
10315 t
= build_vl_exp (CALL_EXPR
, nargs
+ 3);
10316 TREE_TYPE (t
) = return_type
;
10317 CALL_EXPR_FN (t
) = fn
;
10318 CALL_EXPR_STATIC_CHAIN (t
) = NULL
;
10323 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10324 FN and a null static chain slot. NARGS is the number of call arguments
10325 which are specified as "..." arguments. */
10328 build_call_nary (tree return_type
, tree fn
, int nargs
, ...)
10332 va_start (args
, nargs
);
10333 ret
= build_call_valist (return_type
, fn
, nargs
, args
);
10338 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10339 FN and a null static chain slot. NARGS is the number of call arguments
10340 which are specified as a va_list ARGS. */
10343 build_call_valist (tree return_type
, tree fn
, int nargs
, va_list args
)
10348 t
= build_call_1 (return_type
, fn
, nargs
);
10349 for (i
= 0; i
< nargs
; i
++)
10350 CALL_EXPR_ARG (t
, i
) = va_arg (args
, tree
);
10351 process_call_operands (t
);
10355 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10356 FN and a null static chain slot. NARGS is the number of call arguments
10357 which are specified as a tree array ARGS. */
10360 build_call_array_loc (location_t loc
, tree return_type
, tree fn
,
10361 int nargs
, const tree
*args
)
10366 t
= build_call_1 (return_type
, fn
, nargs
);
10367 for (i
= 0; i
< nargs
; i
++)
10368 CALL_EXPR_ARG (t
, i
) = args
[i
];
10369 process_call_operands (t
);
10370 SET_EXPR_LOCATION (t
, loc
);
10374 /* Like build_call_array, but takes a vec. */
10377 build_call_vec (tree return_type
, tree fn
, vec
<tree
, va_gc
> *args
)
10382 ret
= build_call_1 (return_type
, fn
, vec_safe_length (args
));
10383 FOR_EACH_VEC_SAFE_ELT (args
, ix
, t
)
10384 CALL_EXPR_ARG (ret
, ix
) = t
;
10385 process_call_operands (ret
);
10389 /* Return true if T (assumed to be a DECL) must be assigned a memory
10393 needs_to_live_in_memory (const_tree t
)
10395 return (TREE_ADDRESSABLE (t
)
10396 || is_global_var (t
)
10397 || (TREE_CODE (t
) == RESULT_DECL
10398 && !DECL_BY_REFERENCE (t
)
10399 && aggregate_value_p (t
, current_function_decl
)));
10402 /* Return value of a constant X and sign-extend it. */
10405 int_cst_value (const_tree x
)
10407 unsigned bits
= TYPE_PRECISION (TREE_TYPE (x
));
10408 unsigned HOST_WIDE_INT val
= tree_to_hwi (x
);
10410 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
10411 gcc_assert (cst_fits_shwi_p (x
));
10413 if (bits
< HOST_BITS_PER_WIDE_INT
)
10415 bool negative
= ((val
>> (bits
- 1)) & 1) != 0;
10417 val
|= (~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1;
10419 val
&= ~((~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1);
10425 /* Return value of a constant X and sign-extend it. */
10428 widest_int_cst_value (const_tree x
)
10430 unsigned bits
= TYPE_PRECISION (TREE_TYPE (x
));
10431 unsigned HOST_WIDEST_INT val
= tree_to_hwi (x
);
10433 #if HOST_BITS_PER_WIDEST_INT > HOST_BITS_PER_WIDE_INT
10434 gcc_assert (HOST_BITS_PER_WIDEST_INT
>= HOST_BITS_PER_DOUBLE_INT
);
10435 gcc_assert (TREE_INT_CST_NUNITS (x
) == 2);
10437 if (TREE_INT_CST_NUNITS (x
) == 1)
10438 val
= HOST_WIDE_INT (val
);
10440 val
|= (((unsigned HOST_WIDEST_INT
) TREE_INT_CST_ELT (x
, 1))
10441 << HOST_BITS_PER_WIDE_INT
);
10443 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
10444 gcc_assert (TREE_INT_CST_NUNITS (x
) == 1);
10447 if (bits
< HOST_BITS_PER_WIDEST_INT
)
10449 bool negative
= ((val
>> (bits
- 1)) & 1) != 0;
10451 val
|= (~(unsigned HOST_WIDEST_INT
) 0) << (bits
- 1) << 1;
10453 val
&= ~((~(unsigned HOST_WIDEST_INT
) 0) << (bits
- 1) << 1);
10459 /* If TYPE is an integral or pointer type, return an integer type with
10460 the same precision which is unsigned iff UNSIGNEDP is true, or itself
10461 if TYPE is already an integer type of signedness UNSIGNEDP. */
10464 signed_or_unsigned_type_for (int unsignedp
, tree type
)
10466 if (TREE_CODE (type
) == INTEGER_TYPE
&& TYPE_UNSIGNED (type
) == unsignedp
)
10469 if (TREE_CODE (type
) == VECTOR_TYPE
)
10471 tree inner
= TREE_TYPE (type
);
10472 tree inner2
= signed_or_unsigned_type_for (unsignedp
, inner
);
10475 if (inner
== inner2
)
10477 return build_vector_type (inner2
, TYPE_VECTOR_SUBPARTS (type
));
10480 if (!INTEGRAL_TYPE_P (type
)
10481 && !POINTER_TYPE_P (type
))
10484 return build_nonstandard_integer_type (TYPE_PRECISION (type
), unsignedp
);
10487 /* If TYPE is an integral or pointer type, return an integer type with
10488 the same precision which is unsigned, or itself if TYPE is already an
10489 unsigned integer type. */
10492 unsigned_type_for (tree type
)
10494 return signed_or_unsigned_type_for (1, type
);
10497 /* If TYPE is an integral or pointer type, return an integer type with
10498 the same precision which is signed, or itself if TYPE is already a
10499 signed integer type. */
10502 signed_type_for (tree type
)
10504 return signed_or_unsigned_type_for (0, type
);
10507 /* If TYPE is a vector type, return a signed integer vector type with the
10508 same width and number of subparts. Otherwise return boolean_type_node. */
10511 truth_type_for (tree type
)
10513 if (TREE_CODE (type
) == VECTOR_TYPE
)
10515 tree elem
= lang_hooks
.types
.type_for_size
10516 (GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (type
))), 0);
10517 return build_opaque_vector_type (elem
, TYPE_VECTOR_SUBPARTS (type
));
10520 return boolean_type_node
;
10523 /* Returns the largest value obtainable by casting something in INNER type to
10527 upper_bound_in_type (tree outer
, tree inner
)
10529 unsigned int det
= 0;
10530 unsigned oprec
= TYPE_PRECISION (outer
);
10531 unsigned iprec
= TYPE_PRECISION (inner
);
10534 /* Compute a unique number for every combination. */
10535 det
|= (oprec
> iprec
) ? 4 : 0;
10536 det
|= TYPE_UNSIGNED (outer
) ? 2 : 0;
10537 det
|= TYPE_UNSIGNED (inner
) ? 1 : 0;
10539 /* Determine the exponent to use. */
10544 /* oprec <= iprec, outer: signed, inner: don't care. */
10549 /* oprec <= iprec, outer: unsigned, inner: don't care. */
10553 /* oprec > iprec, outer: signed, inner: signed. */
10557 /* oprec > iprec, outer: signed, inner: unsigned. */
10561 /* oprec > iprec, outer: unsigned, inner: signed. */
10565 /* oprec > iprec, outer: unsigned, inner: unsigned. */
10569 gcc_unreachable ();
10572 return wide_int_to_tree (outer
,
10573 wi::mask (prec
, false, TYPE_PRECISION (outer
)));
10576 /* Returns the smallest value obtainable by casting something in INNER type to
10580 lower_bound_in_type (tree outer
, tree inner
)
10582 unsigned oprec
= TYPE_PRECISION (outer
);
10583 unsigned iprec
= TYPE_PRECISION (inner
);
10585 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
10587 if (TYPE_UNSIGNED (outer
)
10588 /* If we are widening something of an unsigned type, OUTER type
10589 contains all values of INNER type. In particular, both INNER
10590 and OUTER types have zero in common. */
10591 || (oprec
> iprec
&& TYPE_UNSIGNED (inner
)))
10592 return build_int_cst (outer
, 0);
10595 /* If we are widening a signed type to another signed type, we
10596 want to obtain -2^^(iprec-1). If we are keeping the
10597 precision or narrowing to a signed type, we want to obtain
10599 unsigned prec
= oprec
> iprec
? iprec
: oprec
;
10600 return wide_int_to_tree (outer
,
10601 wi::mask (prec
- 1, true,
10602 TYPE_PRECISION (outer
)));
10606 /* Return nonzero if two operands that are suitable for PHI nodes are
10607 necessarily equal. Specifically, both ARG0 and ARG1 must be either
10608 SSA_NAME or invariant. Note that this is strictly an optimization.
10609 That is, callers of this function can directly call operand_equal_p
10610 and get the same result, only slower. */
10613 operand_equal_for_phi_arg_p (const_tree arg0
, const_tree arg1
)
10617 if (TREE_CODE (arg0
) == SSA_NAME
|| TREE_CODE (arg1
) == SSA_NAME
)
10619 return operand_equal_p (arg0
, arg1
, 0);
10622 /* Returns number of zeros at the end of binary representation of X. */
10625 num_ending_zeros (const_tree x
)
10627 return build_int_cst (TREE_TYPE (x
), wi::ctz (x
));
10631 #define WALK_SUBTREE(NODE) \
10634 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
10640 /* This is a subroutine of walk_tree that walks field of TYPE that are to
10641 be walked whenever a type is seen in the tree. Rest of operands and return
10642 value are as for walk_tree. */
10645 walk_type_fields (tree type
, walk_tree_fn func
, void *data
,
10646 struct pointer_set_t
*pset
, walk_tree_lh lh
)
10648 tree result
= NULL_TREE
;
10650 switch (TREE_CODE (type
))
10653 case REFERENCE_TYPE
:
10654 /* We have to worry about mutually recursive pointers. These can't
10655 be written in C. They can in Ada. It's pathological, but
10656 there's an ACATS test (c38102a) that checks it. Deal with this
10657 by checking if we're pointing to another pointer, that one
10658 points to another pointer, that one does too, and we have no htab.
10659 If so, get a hash table. We check three levels deep to avoid
10660 the cost of the hash table if we don't need one. */
10661 if (POINTER_TYPE_P (TREE_TYPE (type
))
10662 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type
)))
10663 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type
))))
10666 result
= walk_tree_without_duplicates (&TREE_TYPE (type
),
10674 /* ... fall through ... */
10677 WALK_SUBTREE (TREE_TYPE (type
));
10681 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type
));
10683 /* Fall through. */
10685 case FUNCTION_TYPE
:
10686 WALK_SUBTREE (TREE_TYPE (type
));
10690 /* We never want to walk into default arguments. */
10691 for (arg
= TYPE_ARG_TYPES (type
); arg
; arg
= TREE_CHAIN (arg
))
10692 WALK_SUBTREE (TREE_VALUE (arg
));
10697 /* Don't follow this nodes's type if a pointer for fear that
10698 we'll have infinite recursion. If we have a PSET, then we
10701 || (!POINTER_TYPE_P (TREE_TYPE (type
))
10702 && TREE_CODE (TREE_TYPE (type
)) != OFFSET_TYPE
))
10703 WALK_SUBTREE (TREE_TYPE (type
));
10704 WALK_SUBTREE (TYPE_DOMAIN (type
));
10708 WALK_SUBTREE (TREE_TYPE (type
));
10709 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type
));
10719 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
10720 called with the DATA and the address of each sub-tree. If FUNC returns a
10721 non-NULL value, the traversal is stopped, and the value returned by FUNC
10722 is returned. If PSET is non-NULL it is used to record the nodes visited,
10723 and to avoid visiting a node more than once. */
10726 walk_tree_1 (tree
*tp
, walk_tree_fn func
, void *data
,
10727 struct pointer_set_t
*pset
, walk_tree_lh lh
)
10729 enum tree_code code
;
10733 #define WALK_SUBTREE_TAIL(NODE) \
10737 goto tail_recurse; \
10742 /* Skip empty subtrees. */
10746 /* Don't walk the same tree twice, if the user has requested
10747 that we avoid doing so. */
10748 if (pset
&& pointer_set_insert (pset
, *tp
))
10751 /* Call the function. */
10753 result
= (*func
) (tp
, &walk_subtrees
, data
);
10755 /* If we found something, return it. */
10759 code
= TREE_CODE (*tp
);
10761 /* Even if we didn't, FUNC may have decided that there was nothing
10762 interesting below this point in the tree. */
10763 if (!walk_subtrees
)
10765 /* But we still need to check our siblings. */
10766 if (code
== TREE_LIST
)
10767 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
10768 else if (code
== OMP_CLAUSE
)
10769 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10776 result
= (*lh
) (tp
, &walk_subtrees
, func
, data
, pset
);
10777 if (result
|| !walk_subtrees
)
10784 case IDENTIFIER_NODE
:
10791 case PLACEHOLDER_EXPR
:
10795 /* None of these have subtrees other than those already walked
10800 WALK_SUBTREE (TREE_VALUE (*tp
));
10801 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
10806 int len
= TREE_VEC_LENGTH (*tp
);
10811 /* Walk all elements but the first. */
10813 WALK_SUBTREE (TREE_VEC_ELT (*tp
, len
));
10815 /* Now walk the first one as a tail call. */
10816 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp
, 0));
10820 WALK_SUBTREE (TREE_REALPART (*tp
));
10821 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp
));
10825 unsigned HOST_WIDE_INT idx
;
10826 constructor_elt
*ce
;
10828 for (idx
= 0; vec_safe_iterate (CONSTRUCTOR_ELTS (*tp
), idx
, &ce
);
10830 WALK_SUBTREE (ce
->value
);
10835 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, 0));
10840 for (decl
= BIND_EXPR_VARS (*tp
); decl
; decl
= DECL_CHAIN (decl
))
10842 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
10843 into declarations that are just mentioned, rather than
10844 declared; they don't really belong to this part of the tree.
10845 And, we can see cycles: the initializer for a declaration
10846 can refer to the declaration itself. */
10847 WALK_SUBTREE (DECL_INITIAL (decl
));
10848 WALK_SUBTREE (DECL_SIZE (decl
));
10849 WALK_SUBTREE (DECL_SIZE_UNIT (decl
));
10851 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp
));
10854 case STATEMENT_LIST
:
10856 tree_stmt_iterator i
;
10857 for (i
= tsi_start (*tp
); !tsi_end_p (i
); tsi_next (&i
))
10858 WALK_SUBTREE (*tsi_stmt_ptr (i
));
10863 switch (OMP_CLAUSE_CODE (*tp
))
10865 case OMP_CLAUSE_PRIVATE
:
10866 case OMP_CLAUSE_SHARED
:
10867 case OMP_CLAUSE_FIRSTPRIVATE
:
10868 case OMP_CLAUSE_COPYIN
:
10869 case OMP_CLAUSE_COPYPRIVATE
:
10870 case OMP_CLAUSE_FINAL
:
10871 case OMP_CLAUSE_IF
:
10872 case OMP_CLAUSE_NUM_THREADS
:
10873 case OMP_CLAUSE_SCHEDULE
:
10874 case OMP_CLAUSE_UNIFORM
:
10875 case OMP_CLAUSE_DEPEND
:
10876 case OMP_CLAUSE_NUM_TEAMS
:
10877 case OMP_CLAUSE_THREAD_LIMIT
:
10878 case OMP_CLAUSE_DEVICE
:
10879 case OMP_CLAUSE_DIST_SCHEDULE
:
10880 case OMP_CLAUSE_SAFELEN
:
10881 case OMP_CLAUSE_SIMDLEN
:
10882 case OMP_CLAUSE__LOOPTEMP_
:
10883 case OMP_CLAUSE__SIMDUID_
:
10884 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 0));
10887 case OMP_CLAUSE_NOWAIT
:
10888 case OMP_CLAUSE_ORDERED
:
10889 case OMP_CLAUSE_DEFAULT
:
10890 case OMP_CLAUSE_UNTIED
:
10891 case OMP_CLAUSE_MERGEABLE
:
10892 case OMP_CLAUSE_PROC_BIND
:
10893 case OMP_CLAUSE_INBRANCH
:
10894 case OMP_CLAUSE_NOTINBRANCH
:
10895 case OMP_CLAUSE_FOR
:
10896 case OMP_CLAUSE_PARALLEL
:
10897 case OMP_CLAUSE_SECTIONS
:
10898 case OMP_CLAUSE_TASKGROUP
:
10899 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10901 case OMP_CLAUSE_LASTPRIVATE
:
10902 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
10903 WALK_SUBTREE (OMP_CLAUSE_LASTPRIVATE_STMT (*tp
));
10904 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10906 case OMP_CLAUSE_COLLAPSE
:
10909 for (i
= 0; i
< 3; i
++)
10910 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
10911 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10914 case OMP_CLAUSE_ALIGNED
:
10915 case OMP_CLAUSE_LINEAR
:
10916 case OMP_CLAUSE_FROM
:
10917 case OMP_CLAUSE_TO
:
10918 case OMP_CLAUSE_MAP
:
10919 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
10920 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 1));
10921 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10923 case OMP_CLAUSE_REDUCTION
:
10926 for (i
= 0; i
< 4; i
++)
10927 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
10928 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10932 gcc_unreachable ();
10940 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
10941 But, we only want to walk once. */
10942 len
= (TREE_OPERAND (*tp
, 3) == TREE_OPERAND (*tp
, 1)) ? 2 : 3;
10943 for (i
= 0; i
< len
; ++i
)
10944 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
10945 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
));
10949 /* If this is a TYPE_DECL, walk into the fields of the type that it's
10950 defining. We only want to walk into these fields of a type in this
10951 case and not in the general case of a mere reference to the type.
10953 The criterion is as follows: if the field can be an expression, it
10954 must be walked only here. This should be in keeping with the fields
10955 that are directly gimplified in gimplify_type_sizes in order for the
10956 mark/copy-if-shared/unmark machinery of the gimplifier to work with
10957 variable-sized types.
10959 Note that DECLs get walked as part of processing the BIND_EXPR. */
10960 if (TREE_CODE (DECL_EXPR_DECL (*tp
)) == TYPE_DECL
)
10962 tree
*type_p
= &TREE_TYPE (DECL_EXPR_DECL (*tp
));
10963 if (TREE_CODE (*type_p
) == ERROR_MARK
)
10966 /* Call the function for the type. See if it returns anything or
10967 doesn't want us to continue. If we are to continue, walk both
10968 the normal fields and those for the declaration case. */
10969 result
= (*func
) (type_p
, &walk_subtrees
, data
);
10970 if (result
|| !walk_subtrees
)
10973 /* But do not walk a pointed-to type since it may itself need to
10974 be walked in the declaration case if it isn't anonymous. */
10975 if (!POINTER_TYPE_P (*type_p
))
10977 result
= walk_type_fields (*type_p
, func
, data
, pset
, lh
);
10982 /* If this is a record type, also walk the fields. */
10983 if (RECORD_OR_UNION_TYPE_P (*type_p
))
10987 for (field
= TYPE_FIELDS (*type_p
); field
;
10988 field
= DECL_CHAIN (field
))
10990 /* We'd like to look at the type of the field, but we can
10991 easily get infinite recursion. So assume it's pointed
10992 to elsewhere in the tree. Also, ignore things that
10994 if (TREE_CODE (field
) != FIELD_DECL
)
10997 WALK_SUBTREE (DECL_FIELD_OFFSET (field
));
10998 WALK_SUBTREE (DECL_SIZE (field
));
10999 WALK_SUBTREE (DECL_SIZE_UNIT (field
));
11000 if (TREE_CODE (*type_p
) == QUAL_UNION_TYPE
)
11001 WALK_SUBTREE (DECL_QUALIFIER (field
));
11005 /* Same for scalar types. */
11006 else if (TREE_CODE (*type_p
) == BOOLEAN_TYPE
11007 || TREE_CODE (*type_p
) == ENUMERAL_TYPE
11008 || TREE_CODE (*type_p
) == INTEGER_TYPE
11009 || TREE_CODE (*type_p
) == FIXED_POINT_TYPE
11010 || TREE_CODE (*type_p
) == REAL_TYPE
)
11012 WALK_SUBTREE (TYPE_MIN_VALUE (*type_p
));
11013 WALK_SUBTREE (TYPE_MAX_VALUE (*type_p
));
11016 WALK_SUBTREE (TYPE_SIZE (*type_p
));
11017 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p
));
11022 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code
)))
11026 /* Walk over all the sub-trees of this operand. */
11027 len
= TREE_OPERAND_LENGTH (*tp
);
11029 /* Go through the subtrees. We need to do this in forward order so
11030 that the scope of a FOR_EXPR is handled properly. */
11033 for (i
= 0; i
< len
- 1; ++i
)
11034 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
11035 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
- 1));
11038 /* If this is a type, walk the needed fields in the type. */
11039 else if (TYPE_P (*tp
))
11040 return walk_type_fields (*tp
, func
, data
, pset
, lh
);
11044 /* We didn't find what we were looking for. */
11047 #undef WALK_SUBTREE_TAIL
11049 #undef WALK_SUBTREE
11051 /* Like walk_tree, but does not walk duplicate nodes more than once. */
11054 walk_tree_without_duplicates_1 (tree
*tp
, walk_tree_fn func
, void *data
,
11058 struct pointer_set_t
*pset
;
11060 pset
= pointer_set_create ();
11061 result
= walk_tree_1 (tp
, func
, data
, pset
, lh
);
11062 pointer_set_destroy (pset
);
11068 tree_block (tree t
)
11070 char const c
= TREE_CODE_CLASS (TREE_CODE (t
));
11072 if (IS_EXPR_CODE_CLASS (c
))
11073 return LOCATION_BLOCK (t
->exp
.locus
);
11074 gcc_unreachable ();
11079 tree_set_block (tree t
, tree b
)
11081 char const c
= TREE_CODE_CLASS (TREE_CODE (t
));
11083 if (IS_EXPR_CODE_CLASS (c
))
11086 t
->exp
.locus
= COMBINE_LOCATION_DATA (line_table
, t
->exp
.locus
, b
);
11088 t
->exp
.locus
= LOCATION_LOCUS (t
->exp
.locus
);
11091 gcc_unreachable ();
11094 /* Create a nameless artificial label and put it in the current
11095 function context. The label has a location of LOC. Returns the
11096 newly created label. */
11099 create_artificial_label (location_t loc
)
11101 tree lab
= build_decl (loc
,
11102 LABEL_DECL
, NULL_TREE
, void_type_node
);
11104 DECL_ARTIFICIAL (lab
) = 1;
11105 DECL_IGNORED_P (lab
) = 1;
11106 DECL_CONTEXT (lab
) = current_function_decl
;
11110 /* Given a tree, try to return a useful variable name that we can use
11111 to prefix a temporary that is being assigned the value of the tree.
11112 I.E. given <temp> = &A, return A. */
11117 tree stripped_decl
;
11120 STRIP_NOPS (stripped_decl
);
11121 if (DECL_P (stripped_decl
) && DECL_NAME (stripped_decl
))
11122 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl
));
11123 else if (TREE_CODE (stripped_decl
) == SSA_NAME
)
11125 tree name
= SSA_NAME_IDENTIFIER (stripped_decl
);
11128 return IDENTIFIER_POINTER (name
);
11132 switch (TREE_CODE (stripped_decl
))
11135 return get_name (TREE_OPERAND (stripped_decl
, 0));
11142 /* Return true if TYPE has a variable argument list. */
11145 stdarg_p (const_tree fntype
)
11147 function_args_iterator args_iter
;
11148 tree n
= NULL_TREE
, t
;
11153 FOREACH_FUNCTION_ARGS (fntype
, t
, args_iter
)
11158 return n
!= NULL_TREE
&& n
!= void_type_node
;
11161 /* Return true if TYPE has a prototype. */
11164 prototype_p (tree fntype
)
11168 gcc_assert (fntype
!= NULL_TREE
);
11170 t
= TYPE_ARG_TYPES (fntype
);
11171 return (t
!= NULL_TREE
);
11174 /* If BLOCK is inlined from an __attribute__((__artificial__))
11175 routine, return pointer to location from where it has been
11178 block_nonartificial_location (tree block
)
11180 location_t
*ret
= NULL
;
11182 while (block
&& TREE_CODE (block
) == BLOCK
11183 && BLOCK_ABSTRACT_ORIGIN (block
))
11185 tree ao
= BLOCK_ABSTRACT_ORIGIN (block
);
11187 while (TREE_CODE (ao
) == BLOCK
11188 && BLOCK_ABSTRACT_ORIGIN (ao
)
11189 && BLOCK_ABSTRACT_ORIGIN (ao
) != ao
)
11190 ao
= BLOCK_ABSTRACT_ORIGIN (ao
);
11192 if (TREE_CODE (ao
) == FUNCTION_DECL
)
11194 /* If AO is an artificial inline, point RET to the
11195 call site locus at which it has been inlined and continue
11196 the loop, in case AO's caller is also an artificial
11198 if (DECL_DECLARED_INLINE_P (ao
)
11199 && lookup_attribute ("artificial", DECL_ATTRIBUTES (ao
)))
11200 ret
= &BLOCK_SOURCE_LOCATION (block
);
11204 else if (TREE_CODE (ao
) != BLOCK
)
11207 block
= BLOCK_SUPERCONTEXT (block
);
11213 /* If EXP is inlined from an __attribute__((__artificial__))
11214 function, return the location of the original call expression. */
11217 tree_nonartificial_location (tree exp
)
11219 location_t
*loc
= block_nonartificial_location (TREE_BLOCK (exp
));
11224 return EXPR_LOCATION (exp
);
11228 /* These are the hash table functions for the hash table of OPTIMIZATION_NODEq
11231 /* Return the hash code code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
11234 cl_option_hash_hash (const void *x
)
11236 const_tree
const t
= (const_tree
) x
;
11240 hashval_t hash
= 0;
11242 if (TREE_CODE (t
) == OPTIMIZATION_NODE
)
11244 p
= (const char *)TREE_OPTIMIZATION (t
);
11245 len
= sizeof (struct cl_optimization
);
11248 else if (TREE_CODE (t
) == TARGET_OPTION_NODE
)
11250 p
= (const char *)TREE_TARGET_OPTION (t
);
11251 len
= sizeof (struct cl_target_option
);
11255 gcc_unreachable ();
11257 /* assume most opt flags are just 0/1, some are 2-3, and a few might be
11259 for (i
= 0; i
< len
; i
++)
11261 hash
= (hash
<< 4) ^ ((i
<< 2) | p
[i
]);
11266 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
11267 TARGET_OPTION tree node) is the same as that given by *Y, which is the
11271 cl_option_hash_eq (const void *x
, const void *y
)
11273 const_tree
const xt
= (const_tree
) x
;
11274 const_tree
const yt
= (const_tree
) y
;
11279 if (TREE_CODE (xt
) != TREE_CODE (yt
))
11282 if (TREE_CODE (xt
) == OPTIMIZATION_NODE
)
11284 xp
= (const char *)TREE_OPTIMIZATION (xt
);
11285 yp
= (const char *)TREE_OPTIMIZATION (yt
);
11286 len
= sizeof (struct cl_optimization
);
11289 else if (TREE_CODE (xt
) == TARGET_OPTION_NODE
)
11291 xp
= (const char *)TREE_TARGET_OPTION (xt
);
11292 yp
= (const char *)TREE_TARGET_OPTION (yt
);
11293 len
= sizeof (struct cl_target_option
);
11297 gcc_unreachable ();
11299 return (memcmp (xp
, yp
, len
) == 0);
11302 /* Build an OPTIMIZATION_NODE based on the options in OPTS. */
11305 build_optimization_node (struct gcc_options
*opts
)
11310 /* Use the cache of optimization nodes. */
11312 cl_optimization_save (TREE_OPTIMIZATION (cl_optimization_node
),
11315 slot
= htab_find_slot (cl_option_hash_table
, cl_optimization_node
, INSERT
);
11319 /* Insert this one into the hash table. */
11320 t
= cl_optimization_node
;
11323 /* Make a new node for next time round. */
11324 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
11330 /* Build a TARGET_OPTION_NODE based on the options in OPTS. */
11333 build_target_option_node (struct gcc_options
*opts
)
11338 /* Use the cache of optimization nodes. */
11340 cl_target_option_save (TREE_TARGET_OPTION (cl_target_option_node
),
11343 slot
= htab_find_slot (cl_option_hash_table
, cl_target_option_node
, INSERT
);
11347 /* Insert this one into the hash table. */
11348 t
= cl_target_option_node
;
11351 /* Make a new node for next time round. */
11352 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
11358 /* Determine the "ultimate origin" of a block. The block may be an inlined
11359 instance of an inlined instance of a block which is local to an inline
11360 function, so we have to trace all of the way back through the origin chain
11361 to find out what sort of node actually served as the original seed for the
11365 block_ultimate_origin (const_tree block
)
11367 tree immediate_origin
= BLOCK_ABSTRACT_ORIGIN (block
);
11369 /* output_inline_function sets BLOCK_ABSTRACT_ORIGIN for all the
11370 nodes in the function to point to themselves; ignore that if
11371 we're trying to output the abstract instance of this function. */
11372 if (BLOCK_ABSTRACT (block
) && immediate_origin
== block
)
11375 if (immediate_origin
== NULL_TREE
)
11380 tree lookahead
= immediate_origin
;
11384 ret_val
= lookahead
;
11385 lookahead
= (TREE_CODE (ret_val
) == BLOCK
11386 ? BLOCK_ABSTRACT_ORIGIN (ret_val
) : NULL
);
11388 while (lookahead
!= NULL
&& lookahead
!= ret_val
);
11390 /* The block's abstract origin chain may not be the *ultimate* origin of
11391 the block. It could lead to a DECL that has an abstract origin set.
11392 If so, we want that DECL's abstract origin (which is what DECL_ORIGIN
11393 will give us if it has one). Note that DECL's abstract origins are
11394 supposed to be the most distant ancestor (or so decl_ultimate_origin
11395 claims), so we don't need to loop following the DECL origins. */
11396 if (DECL_P (ret_val
))
11397 return DECL_ORIGIN (ret_val
);
11403 /* Return true iff conversion in EXP generates no instruction. Mark
11404 it inline so that we fully inline into the stripping functions even
11405 though we have two uses of this function. */
11408 tree_nop_conversion (const_tree exp
)
11410 tree outer_type
, inner_type
;
11412 if (!CONVERT_EXPR_P (exp
)
11413 && TREE_CODE (exp
) != NON_LVALUE_EXPR
)
11415 if (TREE_OPERAND (exp
, 0) == error_mark_node
)
11418 outer_type
= TREE_TYPE (exp
);
11419 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
11424 /* Use precision rather then machine mode when we can, which gives
11425 the correct answer even for submode (bit-field) types. */
11426 if ((INTEGRAL_TYPE_P (outer_type
)
11427 || POINTER_TYPE_P (outer_type
)
11428 || TREE_CODE (outer_type
) == OFFSET_TYPE
)
11429 && (INTEGRAL_TYPE_P (inner_type
)
11430 || POINTER_TYPE_P (inner_type
)
11431 || TREE_CODE (inner_type
) == OFFSET_TYPE
))
11432 return TYPE_PRECISION (outer_type
) == TYPE_PRECISION (inner_type
);
11434 /* Otherwise fall back on comparing machine modes (e.g. for
11435 aggregate types, floats). */
11436 return TYPE_MODE (outer_type
) == TYPE_MODE (inner_type
);
11439 /* Return true iff conversion in EXP generates no instruction. Don't
11440 consider conversions changing the signedness. */
11443 tree_sign_nop_conversion (const_tree exp
)
11445 tree outer_type
, inner_type
;
11447 if (!tree_nop_conversion (exp
))
11450 outer_type
= TREE_TYPE (exp
);
11451 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
11453 return (TYPE_UNSIGNED (outer_type
) == TYPE_UNSIGNED (inner_type
)
11454 && POINTER_TYPE_P (outer_type
) == POINTER_TYPE_P (inner_type
));
11457 /* Strip conversions from EXP according to tree_nop_conversion and
11458 return the resulting expression. */
11461 tree_strip_nop_conversions (tree exp
)
11463 while (tree_nop_conversion (exp
))
11464 exp
= TREE_OPERAND (exp
, 0);
11468 /* Strip conversions from EXP according to tree_sign_nop_conversion
11469 and return the resulting expression. */
11472 tree_strip_sign_nop_conversions (tree exp
)
11474 while (tree_sign_nop_conversion (exp
))
11475 exp
= TREE_OPERAND (exp
, 0);
11479 /* Avoid any floating point extensions from EXP. */
11481 strip_float_extensions (tree exp
)
11483 tree sub
, expt
, subt
;
11485 /* For floating point constant look up the narrowest type that can hold
11486 it properly and handle it like (type)(narrowest_type)constant.
11487 This way we can optimize for instance a=a*2.0 where "a" is float
11488 but 2.0 is double constant. */
11489 if (TREE_CODE (exp
) == REAL_CST
&& !DECIMAL_FLOAT_TYPE_P (TREE_TYPE (exp
)))
11491 REAL_VALUE_TYPE orig
;
11494 orig
= TREE_REAL_CST (exp
);
11495 if (TYPE_PRECISION (TREE_TYPE (exp
)) > TYPE_PRECISION (float_type_node
)
11496 && exact_real_truncate (TYPE_MODE (float_type_node
), &orig
))
11497 type
= float_type_node
;
11498 else if (TYPE_PRECISION (TREE_TYPE (exp
))
11499 > TYPE_PRECISION (double_type_node
)
11500 && exact_real_truncate (TYPE_MODE (double_type_node
), &orig
))
11501 type
= double_type_node
;
11503 return build_real (type
, real_value_truncate (TYPE_MODE (type
), orig
));
11506 if (!CONVERT_EXPR_P (exp
))
11509 sub
= TREE_OPERAND (exp
, 0);
11510 subt
= TREE_TYPE (sub
);
11511 expt
= TREE_TYPE (exp
);
11513 if (!FLOAT_TYPE_P (subt
))
11516 if (DECIMAL_FLOAT_TYPE_P (expt
) != DECIMAL_FLOAT_TYPE_P (subt
))
11519 if (TYPE_PRECISION (subt
) > TYPE_PRECISION (expt
))
11522 return strip_float_extensions (sub
);
11525 /* Strip out all handled components that produce invariant
11529 strip_invariant_refs (const_tree op
)
11531 while (handled_component_p (op
))
11533 switch (TREE_CODE (op
))
11536 case ARRAY_RANGE_REF
:
11537 if (!is_gimple_constant (TREE_OPERAND (op
, 1))
11538 || TREE_OPERAND (op
, 2) != NULL_TREE
11539 || TREE_OPERAND (op
, 3) != NULL_TREE
)
11543 case COMPONENT_REF
:
11544 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
11550 op
= TREE_OPERAND (op
, 0);
11556 static GTY(()) tree gcc_eh_personality_decl
;
11558 /* Return the GCC personality function decl. */
11561 lhd_gcc_personality (void)
11563 if (!gcc_eh_personality_decl
)
11564 gcc_eh_personality_decl
= build_personality_function ("gcc");
11565 return gcc_eh_personality_decl
;
11568 /* For languages with One Definition Rule, work out if
11569 trees are actually the same even if the tree representation
11570 differs. This handles only decls appearing in TYPE_NAME
11571 and TYPE_CONTEXT. That is NAMESPACE_DECL, TYPE_DECL,
11572 RECORD_TYPE and IDENTIFIER_NODE. */
11575 same_for_odr (tree t1
, tree t2
)
11581 /* C and C++ FEs differ by using IDENTIFIER_NODE and TYPE_DECL. */
11582 if (TREE_CODE (t1
) == IDENTIFIER_NODE
11583 && TREE_CODE (t2
) == TYPE_DECL
11584 && DECL_FILE_SCOPE_P (t1
))
11586 t2
= DECL_NAME (t2
);
11587 gcc_assert (TREE_CODE (t2
) == IDENTIFIER_NODE
);
11589 if (TREE_CODE (t2
) == IDENTIFIER_NODE
11590 && TREE_CODE (t1
) == TYPE_DECL
11591 && DECL_FILE_SCOPE_P (t2
))
11593 t1
= DECL_NAME (t1
);
11594 gcc_assert (TREE_CODE (t1
) == IDENTIFIER_NODE
);
11596 if (TREE_CODE (t1
) != TREE_CODE (t2
))
11599 return types_same_for_odr (t1
, t2
);
11601 return decls_same_for_odr (t1
, t2
);
11605 /* For languages with One Definition Rule, work out if
11606 decls are actually the same even if the tree representation
11607 differs. This handles only decls appearing in TYPE_NAME
11608 and TYPE_CONTEXT. That is NAMESPACE_DECL, TYPE_DECL,
11609 RECORD_TYPE and IDENTIFIER_NODE. */
11612 decls_same_for_odr (tree decl1
, tree decl2
)
11614 if (decl1
&& TREE_CODE (decl1
) == TYPE_DECL
11615 && DECL_ORIGINAL_TYPE (decl1
))
11616 decl1
= DECL_ORIGINAL_TYPE (decl1
);
11617 if (decl2
&& TREE_CODE (decl2
) == TYPE_DECL
11618 && DECL_ORIGINAL_TYPE (decl2
))
11619 decl2
= DECL_ORIGINAL_TYPE (decl2
);
11620 if (decl1
== decl2
)
11622 if (!decl1
|| !decl2
)
11624 gcc_checking_assert (DECL_P (decl1
) && DECL_P (decl2
));
11625 if (TREE_CODE (decl1
) != TREE_CODE (decl2
))
11627 if (TREE_CODE (decl1
) == TRANSLATION_UNIT_DECL
)
11629 if (TREE_CODE (decl1
) != NAMESPACE_DECL
11630 && TREE_CODE (decl1
) != TYPE_DECL
)
11632 if (!DECL_NAME (decl1
))
11634 gcc_checking_assert (TREE_CODE (DECL_NAME (decl1
)) == IDENTIFIER_NODE
);
11635 gcc_checking_assert (!DECL_NAME (decl2
)
11636 || TREE_CODE (DECL_NAME (decl2
)) == IDENTIFIER_NODE
);
11637 if (DECL_NAME (decl1
) != DECL_NAME (decl2
))
11639 return same_for_odr (DECL_CONTEXT (decl1
),
11640 DECL_CONTEXT (decl2
));
11643 /* For languages with One Definition Rule, work out if
11644 types are same even if the tree representation differs.
11645 This is non-trivial for LTO where minnor differences in
11646 the type representation may have prevented type merging
11647 to merge two copies of otherwise equivalent type. */
11650 types_same_for_odr (tree type1
, tree type2
)
11652 gcc_checking_assert (TYPE_P (type1
) && TYPE_P (type2
));
11653 type1
= TYPE_MAIN_VARIANT (type1
);
11654 type2
= TYPE_MAIN_VARIANT (type2
);
11655 if (type1
== type2
)
11658 #ifndef ENABLE_CHECKING
11663 /* Check for anonymous namespaces. Those have !TREE_PUBLIC
11664 on the corresponding TYPE_STUB_DECL. */
11665 if (type_in_anonymous_namespace_p (type1
)
11666 || type_in_anonymous_namespace_p (type2
))
11668 /* When assembler name of virtual table is available, it is
11669 easy to compare types for equivalence. */
11670 if (TYPE_BINFO (type1
) && TYPE_BINFO (type2
)
11671 && BINFO_VTABLE (TYPE_BINFO (type1
))
11672 && BINFO_VTABLE (TYPE_BINFO (type2
)))
11674 tree v1
= BINFO_VTABLE (TYPE_BINFO (type1
));
11675 tree v2
= BINFO_VTABLE (TYPE_BINFO (type2
));
11677 if (TREE_CODE (v1
) == POINTER_PLUS_EXPR
)
11679 if (TREE_CODE (v2
) != POINTER_PLUS_EXPR
11680 || !operand_equal_p (TREE_OPERAND (v1
, 1),
11681 TREE_OPERAND (v2
, 1), 0))
11683 v1
= TREE_OPERAND (TREE_OPERAND (v1
, 0), 0);
11684 v2
= TREE_OPERAND (TREE_OPERAND (v2
, 0), 0);
11686 v1
= DECL_ASSEMBLER_NAME (v1
);
11687 v2
= DECL_ASSEMBLER_NAME (v2
);
11691 /* FIXME: the code comparing type names consider all instantiations of the
11692 same template to have same name. This is because we have no access
11693 to template parameters. For types with no virtual method tables
11694 we thus can return false positives. At the moment we do not need
11695 to compare types in other scenarios than devirtualization. */
11697 /* If types are not structuraly same, do not bother to contnue.
11698 Match in the remainder of code would mean ODR violation. */
11699 if (!types_compatible_p (type1
, type2
))
11701 if (!TYPE_NAME (type1
))
11703 if (!decls_same_for_odr (TYPE_NAME (type1
), TYPE_NAME (type2
)))
11705 if (!same_for_odr (TYPE_CONTEXT (type1
), TYPE_CONTEXT (type2
)))
11707 /* When not in LTO the MAIN_VARIANT check should be the same. */
11708 gcc_assert (in_lto_p
);
11713 /* TARGET is a call target of GIMPLE call statement
11714 (obtained by gimple_call_fn). Return true if it is
11715 OBJ_TYPE_REF representing an virtual call of C++ method.
11716 (As opposed to OBJ_TYPE_REF representing objc calls
11717 through a cast where middle-end devirtualization machinery
11721 virtual_method_call_p (tree target
)
11723 if (TREE_CODE (target
) != OBJ_TYPE_REF
)
11725 target
= TREE_TYPE (target
);
11726 gcc_checking_assert (TREE_CODE (target
) == POINTER_TYPE
);
11727 target
= TREE_TYPE (target
);
11728 if (TREE_CODE (target
) == FUNCTION_TYPE
)
11730 gcc_checking_assert (TREE_CODE (target
) == METHOD_TYPE
);
11734 /* REF is OBJ_TYPE_REF, return the class the ref corresponds to. */
11737 obj_type_ref_class (tree ref
)
11739 gcc_checking_assert (TREE_CODE (ref
) == OBJ_TYPE_REF
);
11740 ref
= TREE_TYPE (ref
);
11741 gcc_checking_assert (TREE_CODE (ref
) == POINTER_TYPE
);
11742 ref
= TREE_TYPE (ref
);
11743 /* We look for type THIS points to. ObjC also builds
11744 OBJ_TYPE_REF with non-method calls, Their first parameter
11745 ID however also corresponds to class type. */
11746 gcc_checking_assert (TREE_CODE (ref
) == METHOD_TYPE
11747 || TREE_CODE (ref
) == FUNCTION_TYPE
);
11748 ref
= TREE_VALUE (TYPE_ARG_TYPES (ref
));
11749 gcc_checking_assert (TREE_CODE (ref
) == POINTER_TYPE
);
11750 return TREE_TYPE (ref
);
11753 /* Return true if T is in anonymous namespace. */
11756 type_in_anonymous_namespace_p (tree t
)
11758 return (TYPE_STUB_DECL (t
) && !TREE_PUBLIC (TYPE_STUB_DECL (t
)));
11761 /* Try to find a base info of BINFO that would have its field decl at offset
11762 OFFSET within the BINFO type and which is of EXPECTED_TYPE. If it can be
11763 found, return, otherwise return NULL_TREE. */
11766 get_binfo_at_offset (tree binfo
, HOST_WIDE_INT offset
, tree expected_type
)
11768 tree type
= BINFO_TYPE (binfo
);
11772 HOST_WIDE_INT pos
, size
;
11776 if (types_same_for_odr (type
, expected_type
))
11781 for (fld
= TYPE_FIELDS (type
); fld
; fld
= DECL_CHAIN (fld
))
11783 if (TREE_CODE (fld
) != FIELD_DECL
)
11786 pos
= int_bit_position (fld
);
11787 size
= tree_to_uhwi (DECL_SIZE (fld
));
11788 if (pos
<= offset
&& (pos
+ size
) > offset
)
11791 if (!fld
|| TREE_CODE (TREE_TYPE (fld
)) != RECORD_TYPE
)
11794 if (!DECL_ARTIFICIAL (fld
))
11796 binfo
= TYPE_BINFO (TREE_TYPE (fld
));
11800 /* Offset 0 indicates the primary base, whose vtable contents are
11801 represented in the binfo for the derived class. */
11802 else if (offset
!= 0)
11804 tree base_binfo
, found_binfo
= NULL_TREE
;
11805 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
11806 if (types_same_for_odr (TREE_TYPE (base_binfo
), TREE_TYPE (fld
)))
11808 found_binfo
= base_binfo
;
11813 binfo
= found_binfo
;
11816 type
= TREE_TYPE (fld
);
11821 /* Returns true if X is a typedef decl. */
11824 is_typedef_decl (tree x
)
11826 return (x
&& TREE_CODE (x
) == TYPE_DECL
11827 && DECL_ORIGINAL_TYPE (x
) != NULL_TREE
);
11830 /* Returns true iff TYPE is a type variant created for a typedef. */
11833 typedef_variant_p (tree type
)
11835 return is_typedef_decl (TYPE_NAME (type
));
11838 /* Warn about a use of an identifier which was marked deprecated. */
11840 warn_deprecated_use (tree node
, tree attr
)
11844 if (node
== 0 || !warn_deprecated_decl
)
11850 attr
= DECL_ATTRIBUTES (node
);
11851 else if (TYPE_P (node
))
11853 tree decl
= TYPE_STUB_DECL (node
);
11855 attr
= lookup_attribute ("deprecated",
11856 TYPE_ATTRIBUTES (TREE_TYPE (decl
)));
11861 attr
= lookup_attribute ("deprecated", attr
);
11864 msg
= TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr
)));
11870 expanded_location xloc
= expand_location (DECL_SOURCE_LOCATION (node
));
11872 warning (OPT_Wdeprecated_declarations
,
11873 "%qD is deprecated (declared at %r%s:%d%R): %s",
11874 node
, "locus", xloc
.file
, xloc
.line
, msg
);
11876 warning (OPT_Wdeprecated_declarations
,
11877 "%qD is deprecated (declared at %r%s:%d%R)",
11878 node
, "locus", xloc
.file
, xloc
.line
);
11880 else if (TYPE_P (node
))
11882 tree what
= NULL_TREE
;
11883 tree decl
= TYPE_STUB_DECL (node
);
11885 if (TYPE_NAME (node
))
11887 if (TREE_CODE (TYPE_NAME (node
)) == IDENTIFIER_NODE
)
11888 what
= TYPE_NAME (node
);
11889 else if (TREE_CODE (TYPE_NAME (node
)) == TYPE_DECL
11890 && DECL_NAME (TYPE_NAME (node
)))
11891 what
= DECL_NAME (TYPE_NAME (node
));
11896 expanded_location xloc
11897 = expand_location (DECL_SOURCE_LOCATION (decl
));
11901 warning (OPT_Wdeprecated_declarations
,
11902 "%qE is deprecated (declared at %r%s:%d%R): %s",
11903 what
, "locus", xloc
.file
, xloc
.line
, msg
);
11905 warning (OPT_Wdeprecated_declarations
,
11906 "%qE is deprecated (declared at %r%s:%d%R)",
11907 what
, "locus", xloc
.file
, xloc
.line
);
11912 warning (OPT_Wdeprecated_declarations
,
11913 "type is deprecated (declared at %r%s:%d%R): %s",
11914 "locus", xloc
.file
, xloc
.line
, msg
);
11916 warning (OPT_Wdeprecated_declarations
,
11917 "type is deprecated (declared at %r%s:%d%R)",
11918 "locus", xloc
.file
, xloc
.line
);
11926 warning (OPT_Wdeprecated_declarations
, "%qE is deprecated: %s",
11929 warning (OPT_Wdeprecated_declarations
, "%qE is deprecated", what
);
11934 warning (OPT_Wdeprecated_declarations
, "type is deprecated: %s",
11937 warning (OPT_Wdeprecated_declarations
, "type is deprecated");
11943 /* Return true if REF has a COMPONENT_REF with a bit-field field declaration
11944 somewhere in it. */
11947 contains_bitfld_component_ref_p (const_tree ref
)
11949 while (handled_component_p (ref
))
11951 if (TREE_CODE (ref
) == COMPONENT_REF
11952 && DECL_BIT_FIELD (TREE_OPERAND (ref
, 1)))
11954 ref
= TREE_OPERAND (ref
, 0);
11960 /* Try to determine whether a TRY_CATCH expression can fall through.
11961 This is a subroutine of block_may_fallthru. */
11964 try_catch_may_fallthru (const_tree stmt
)
11966 tree_stmt_iterator i
;
11968 /* If the TRY block can fall through, the whole TRY_CATCH can
11970 if (block_may_fallthru (TREE_OPERAND (stmt
, 0)))
11973 i
= tsi_start (TREE_OPERAND (stmt
, 1));
11974 switch (TREE_CODE (tsi_stmt (i
)))
11977 /* We expect to see a sequence of CATCH_EXPR trees, each with a
11978 catch expression and a body. The whole TRY_CATCH may fall
11979 through iff any of the catch bodies falls through. */
11980 for (; !tsi_end_p (i
); tsi_next (&i
))
11982 if (block_may_fallthru (CATCH_BODY (tsi_stmt (i
))))
11987 case EH_FILTER_EXPR
:
11988 /* The exception filter expression only matters if there is an
11989 exception. If the exception does not match EH_FILTER_TYPES,
11990 we will execute EH_FILTER_FAILURE, and we will fall through
11991 if that falls through. If the exception does match
11992 EH_FILTER_TYPES, the stack unwinder will continue up the
11993 stack, so we will not fall through. We don't know whether we
11994 will throw an exception which matches EH_FILTER_TYPES or not,
11995 so we just ignore EH_FILTER_TYPES and assume that we might
11996 throw an exception which doesn't match. */
11997 return block_may_fallthru (EH_FILTER_FAILURE (tsi_stmt (i
)));
12000 /* This case represents statements to be executed when an
12001 exception occurs. Those statements are implicitly followed
12002 by a RESX statement to resume execution after the exception.
12003 So in this case the TRY_CATCH never falls through. */
12008 /* Try to determine if we can fall out of the bottom of BLOCK. This guess
12009 need not be 100% accurate; simply be conservative and return true if we
12010 don't know. This is used only to avoid stupidly generating extra code.
12011 If we're wrong, we'll just delete the extra code later. */
12014 block_may_fallthru (const_tree block
)
12016 /* This CONST_CAST is okay because expr_last returns its argument
12017 unmodified and we assign it to a const_tree. */
12018 const_tree stmt
= expr_last (CONST_CAST_TREE (block
));
12020 switch (stmt
? TREE_CODE (stmt
) : ERROR_MARK
)
12024 /* Easy cases. If the last statement of the block implies
12025 control transfer, then we can't fall through. */
12029 /* If SWITCH_LABELS is set, this is lowered, and represents a
12030 branch to a selected label and hence can not fall through.
12031 Otherwise SWITCH_BODY is set, and the switch can fall
12033 return SWITCH_LABELS (stmt
) == NULL_TREE
;
12036 if (block_may_fallthru (COND_EXPR_THEN (stmt
)))
12038 return block_may_fallthru (COND_EXPR_ELSE (stmt
));
12041 return block_may_fallthru (BIND_EXPR_BODY (stmt
));
12043 case TRY_CATCH_EXPR
:
12044 return try_catch_may_fallthru (stmt
);
12046 case TRY_FINALLY_EXPR
:
12047 /* The finally clause is always executed after the try clause,
12048 so if it does not fall through, then the try-finally will not
12049 fall through. Otherwise, if the try clause does not fall
12050 through, then when the finally clause falls through it will
12051 resume execution wherever the try clause was going. So the
12052 whole try-finally will only fall through if both the try
12053 clause and the finally clause fall through. */
12054 return (block_may_fallthru (TREE_OPERAND (stmt
, 0))
12055 && block_may_fallthru (TREE_OPERAND (stmt
, 1)));
12058 if (TREE_CODE (TREE_OPERAND (stmt
, 1)) == CALL_EXPR
)
12059 stmt
= TREE_OPERAND (stmt
, 1);
12065 /* Functions that do not return do not fall through. */
12066 return (call_expr_flags (stmt
) & ECF_NORETURN
) == 0;
12068 case CLEANUP_POINT_EXPR
:
12069 return block_may_fallthru (TREE_OPERAND (stmt
, 0));
12072 return block_may_fallthru (TREE_OPERAND (stmt
, 1));
12078 return lang_hooks
.block_may_fallthru (stmt
);
12082 /* True if we are using EH to handle cleanups. */
12083 static bool using_eh_for_cleanups_flag
= false;
12085 /* This routine is called from front ends to indicate eh should be used for
12088 using_eh_for_cleanups (void)
12090 using_eh_for_cleanups_flag
= true;
12093 /* Query whether EH is used for cleanups. */
12095 using_eh_for_cleanups_p (void)
12097 return using_eh_for_cleanups_flag
;
12100 /* Wrapper for tree_code_name to ensure that tree code is valid */
12102 get_tree_code_name (enum tree_code code
)
12104 const char *invalid
= "<invalid tree code>";
12106 if (code
>= MAX_TREE_CODES
)
12109 return tree_code_name
[code
];
12112 /* Drops the TREE_OVERFLOW flag from T. */
12115 drop_tree_overflow (tree t
)
12117 gcc_checking_assert (TREE_OVERFLOW (t
));
12119 /* For tree codes with a sharing machinery re-build the result. */
12120 if (TREE_CODE (t
) == INTEGER_CST
)
12121 return wide_int_to_tree (TREE_TYPE (t
), t
);
12123 /* Otherwise, as all tcc_constants are possibly shared, copy the node
12124 and drop the flag. */
12126 TREE_OVERFLOW (t
) = 0;
12130 #include "gt-tree.h"