1 /* Language-independent node constructors for parse phase of GNU compiler.
2 Copyright (C) 1987-2014 Free Software Foundation, Inc.
4 This file is part of GCC.
6 GCC is free software; you can redistribute it and/or modify it under
7 the terms of the GNU General Public License as published by the Free
8 Software Foundation; either version 3, or (at your option) any later
11 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
12 WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
16 You should have received a copy of the GNU General Public License
17 along with GCC; see the file COPYING3. If not see
18 <http://www.gnu.org/licenses/>. */
20 /* This file contains the low level primitives for operating on tree nodes,
21 including allocation, list operations, interning of identifiers,
22 construction of data type nodes and statement nodes,
23 and construction of type conversion nodes. It also contains
24 tables index by tree code that describe how to take apart
27 It is intended to be language-independent, but occasionally
28 calls language-dependent routines defined (for C) in typecheck.c. */
32 #include "coretypes.h"
36 #include "stor-layout.h"
45 #include "hard-reg-set.h"
49 #include "toplev.h" /* get_random_seed */
51 #include "filenames.h"
54 #include "common/common-target.h"
55 #include "langhooks.h"
56 #include "tree-inline.h"
57 #include "tree-iterator.h"
59 #include "dominance.h"
61 #include "basic-block.h"
63 #include "tree-ssa-alias.h"
64 #include "internal-fn.h"
65 #include "gimple-expr.h"
68 #include "gimple-iterator.h"
70 #include "gimple-ssa.h"
72 #include "plugin-api.h"
75 #include "tree-phinodes.h"
76 #include "stringpool.h"
77 #include "tree-ssanames.h"
81 #include "tree-pass.h"
82 #include "langhooks-def.h"
83 #include "diagnostic.h"
84 #include "tree-diagnostic.h"
85 #include "tree-pretty-print.h"
92 /* Tree code classes. */
94 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) TYPE,
95 #define END_OF_BASE_TREE_CODES tcc_exceptional,
97 const enum tree_code_class tree_code_type
[] = {
98 #include "all-tree.def"
102 #undef END_OF_BASE_TREE_CODES
104 /* Table indexed by tree code giving number of expression
105 operands beyond the fixed part of the node structure.
106 Not used for types or decls. */
108 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) LENGTH,
109 #define END_OF_BASE_TREE_CODES 0,
111 const unsigned char tree_code_length
[] = {
112 #include "all-tree.def"
116 #undef END_OF_BASE_TREE_CODES
118 /* Names of tree components.
119 Used for printing out the tree and error messages. */
120 #define DEFTREECODE(SYM, NAME, TYPE, LEN) NAME,
121 #define END_OF_BASE_TREE_CODES "@dummy",
123 static const char *const tree_code_name
[] = {
124 #include "all-tree.def"
128 #undef END_OF_BASE_TREE_CODES
130 /* Each tree code class has an associated string representation.
131 These must correspond to the tree_code_class entries. */
133 const char *const tree_code_class_strings
[] =
148 /* obstack.[ch] explicitly declined to prototype this. */
149 extern int _obstack_allocated_p (struct obstack
*h
, void *obj
);
151 /* Statistics-gathering stuff. */
153 static int tree_code_counts
[MAX_TREE_CODES
];
154 int tree_node_counts
[(int) all_kinds
];
155 int tree_node_sizes
[(int) all_kinds
];
157 /* Keep in sync with tree.h:enum tree_node_kind. */
158 static const char * const tree_node_kind_names
[] = {
177 /* Unique id for next decl created. */
178 static GTY(()) int next_decl_uid
;
179 /* Unique id for next type created. */
180 static GTY(()) int next_type_uid
= 1;
181 /* Unique id for next debug decl created. Use negative numbers,
182 to catch erroneous uses. */
183 static GTY(()) int next_debug_decl_uid
;
185 /* Since we cannot rehash a type after it is in the table, we have to
186 keep the hash code. */
188 struct GTY(()) type_hash
{
193 /* Initial size of the hash table (rounded to next prime). */
194 #define TYPE_HASH_INITIAL_SIZE 1000
196 /* Now here is the hash table. When recording a type, it is added to
197 the slot whose index is the hash code. Note that the hash table is
198 used for several kinds of types (function types, array types and
199 array index range types, for now). While all these live in the
200 same table, they are completely independent, and the hash code is
201 computed differently for each of these. */
203 static GTY ((if_marked ("type_hash_marked_p"), param_is (struct type_hash
)))
204 htab_t type_hash_table
;
206 /* Hash table and temporary node for larger integer const values. */
207 static GTY (()) tree int_cst_node
;
208 static GTY ((if_marked ("ggc_marked_p"), param_is (union tree_node
)))
209 htab_t int_cst_hash_table
;
211 /* Hash table for optimization flags and target option flags. Use the same
212 hash table for both sets of options. Nodes for building the current
213 optimization and target option nodes. The assumption is most of the time
214 the options created will already be in the hash table, so we avoid
215 allocating and freeing up a node repeatably. */
216 static GTY (()) tree cl_optimization_node
;
217 static GTY (()) tree cl_target_option_node
;
218 static GTY ((if_marked ("ggc_marked_p"), param_is (union tree_node
)))
219 htab_t cl_option_hash_table
;
221 /* General tree->tree mapping structure for use in hash tables. */
224 static GTY ((if_marked ("tree_decl_map_marked_p"), param_is (struct tree_decl_map
)))
225 htab_t debug_expr_for_decl
;
227 static GTY ((if_marked ("tree_decl_map_marked_p"), param_is (struct tree_decl_map
)))
228 htab_t value_expr_for_decl
;
230 static GTY ((if_marked ("tree_vec_map_marked_p"), param_is (struct tree_vec_map
)))
231 htab_t debug_args_for_decl
;
233 static void set_type_quals (tree
, int);
234 static int type_hash_eq (const void *, const void *);
235 static hashval_t
type_hash_hash (const void *);
236 static hashval_t
int_cst_hash_hash (const void *);
237 static int int_cst_hash_eq (const void *, const void *);
238 static hashval_t
cl_option_hash_hash (const void *);
239 static int cl_option_hash_eq (const void *, const void *);
240 static void print_type_hash_statistics (void);
241 static void print_debug_expr_statistics (void);
242 static void print_value_expr_statistics (void);
243 static int type_hash_marked_p (const void *);
244 static void type_hash_list (const_tree
, inchash::hash
&);
245 static void attribute_hash_list (const_tree
, inchash::hash
&);
247 tree global_trees
[TI_MAX
];
248 tree integer_types
[itk_none
];
250 bool int_n_enabled_p
[NUM_INT_N_ENTS
];
251 struct int_n_trees_t int_n_trees
[NUM_INT_N_ENTS
];
253 unsigned char tree_contains_struct
[MAX_TREE_CODES
][64];
255 /* Number of operands for each OpenMP clause. */
256 unsigned const char omp_clause_num_ops
[] =
258 0, /* OMP_CLAUSE_ERROR */
259 1, /* OMP_CLAUSE_PRIVATE */
260 1, /* OMP_CLAUSE_SHARED */
261 1, /* OMP_CLAUSE_FIRSTPRIVATE */
262 2, /* OMP_CLAUSE_LASTPRIVATE */
263 4, /* OMP_CLAUSE_REDUCTION */
264 1, /* OMP_CLAUSE_COPYIN */
265 1, /* OMP_CLAUSE_COPYPRIVATE */
266 3, /* OMP_CLAUSE_LINEAR */
267 2, /* OMP_CLAUSE_ALIGNED */
268 1, /* OMP_CLAUSE_DEPEND */
269 1, /* OMP_CLAUSE_UNIFORM */
270 2, /* OMP_CLAUSE_FROM */
271 2, /* OMP_CLAUSE_TO */
272 2, /* OMP_CLAUSE_MAP */
273 2, /* OMP_CLAUSE__CACHE_ */
274 1, /* OMP_CLAUSE_HOST */
275 1, /* OMP_CLAUSE_OACC_DEVICE */
276 1, /* OMP_CLAUSE_DEVICE_RESIDENT */
277 1, /* OMP_CLAUSE_USE_DEVICE */
278 1, /* OMP_CLAUSE_GANG */
279 1, /* OMP_CLAUSE_ASYNC */
280 1, /* OMP_CLAUSE_WAIT */
281 1, /* OMP_CLAUSE__LOOPTEMP_ */
282 1, /* OMP_CLAUSE_IF */
283 1, /* OMP_CLAUSE_NUM_THREADS */
284 1, /* OMP_CLAUSE_SCHEDULE */
285 0, /* OMP_CLAUSE_NOWAIT */
286 0, /* OMP_CLAUSE_ORDERED */
287 0, /* OMP_CLAUSE_DEFAULT */
288 3, /* OMP_CLAUSE_COLLAPSE */
289 0, /* OMP_CLAUSE_UNTIED */
290 1, /* OMP_CLAUSE_FINAL */
291 0, /* OMP_CLAUSE_MERGEABLE */
292 1, /* OMP_CLAUSE_DEVICE */
293 1, /* OMP_CLAUSE_DIST_SCHEDULE */
294 0, /* OMP_CLAUSE_INBRANCH */
295 0, /* OMP_CLAUSE_NOTINBRANCH */
296 1, /* OMP_CLAUSE_NUM_TEAMS */
297 1, /* OMP_CLAUSE_THREAD_LIMIT */
298 0, /* OMP_CLAUSE_PROC_BIND */
299 1, /* OMP_CLAUSE_SAFELEN */
300 1, /* OMP_CLAUSE_SIMDLEN */
301 0, /* OMP_CLAUSE_FOR */
302 0, /* OMP_CLAUSE_PARALLEL */
303 0, /* OMP_CLAUSE_SECTIONS */
304 0, /* OMP_CLAUSE_TASKGROUP */
305 1, /* OMP_CLAUSE__SIMDUID_ */
306 1, /* OMP_CLAUSE__CILK_FOR_COUNT_ */
307 0, /* OMP_CLAUSE_INDEPENDENT */
308 1, /* OMP_CLAUSE_WORKER */
309 1, /* OMP_CLAUSE_VECTOR */
310 1, /* OMP_CLAUSE_NUM_GANGS */
311 1, /* OMP_CLAUSE_NUM_WORKERS */
312 1, /* OMP_CLAUSE_VECTOR_LENGTH */
315 const char * const omp_clause_code_name
[] =
375 /* Return the tree node structure used by tree code CODE. */
377 static inline enum tree_node_structure_enum
378 tree_node_structure_for_code (enum tree_code code
)
380 switch (TREE_CODE_CLASS (code
))
382 case tcc_declaration
:
387 return TS_FIELD_DECL
;
393 return TS_LABEL_DECL
;
395 return TS_RESULT_DECL
;
396 case DEBUG_EXPR_DECL
:
399 return TS_CONST_DECL
;
403 return TS_FUNCTION_DECL
;
404 case TRANSLATION_UNIT_DECL
:
405 return TS_TRANSLATION_UNIT_DECL
;
407 return TS_DECL_NON_COMMON
;
411 return TS_TYPE_NON_COMMON
;
420 default: /* tcc_constant and tcc_exceptional */
425 /* tcc_constant cases. */
426 case VOID_CST
: return TS_TYPED
;
427 case INTEGER_CST
: return TS_INT_CST
;
428 case REAL_CST
: return TS_REAL_CST
;
429 case FIXED_CST
: return TS_FIXED_CST
;
430 case COMPLEX_CST
: return TS_COMPLEX
;
431 case VECTOR_CST
: return TS_VECTOR
;
432 case STRING_CST
: return TS_STRING
;
433 /* tcc_exceptional cases. */
434 case ERROR_MARK
: return TS_COMMON
;
435 case IDENTIFIER_NODE
: return TS_IDENTIFIER
;
436 case TREE_LIST
: return TS_LIST
;
437 case TREE_VEC
: return TS_VEC
;
438 case SSA_NAME
: return TS_SSA_NAME
;
439 case PLACEHOLDER_EXPR
: return TS_COMMON
;
440 case STATEMENT_LIST
: return TS_STATEMENT_LIST
;
441 case BLOCK
: return TS_BLOCK
;
442 case CONSTRUCTOR
: return TS_CONSTRUCTOR
;
443 case TREE_BINFO
: return TS_BINFO
;
444 case OMP_CLAUSE
: return TS_OMP_CLAUSE
;
445 case OPTIMIZATION_NODE
: return TS_OPTIMIZATION
;
446 case TARGET_OPTION_NODE
: return TS_TARGET_OPTION
;
454 /* Initialize tree_contains_struct to describe the hierarchy of tree
458 initialize_tree_contains_struct (void)
462 for (i
= ERROR_MARK
; i
< LAST_AND_UNUSED_TREE_CODE
; i
++)
465 enum tree_node_structure_enum ts_code
;
467 code
= (enum tree_code
) i
;
468 ts_code
= tree_node_structure_for_code (code
);
470 /* Mark the TS structure itself. */
471 tree_contains_struct
[code
][ts_code
] = 1;
473 /* Mark all the structures that TS is derived from. */
491 case TS_STATEMENT_LIST
:
492 MARK_TS_TYPED (code
);
496 case TS_DECL_MINIMAL
:
502 case TS_OPTIMIZATION
:
503 case TS_TARGET_OPTION
:
504 MARK_TS_COMMON (code
);
507 case TS_TYPE_WITH_LANG_SPECIFIC
:
508 MARK_TS_TYPE_COMMON (code
);
511 case TS_TYPE_NON_COMMON
:
512 MARK_TS_TYPE_WITH_LANG_SPECIFIC (code
);
516 MARK_TS_DECL_MINIMAL (code
);
521 MARK_TS_DECL_COMMON (code
);
524 case TS_DECL_NON_COMMON
:
525 MARK_TS_DECL_WITH_VIS (code
);
528 case TS_DECL_WITH_VIS
:
532 MARK_TS_DECL_WRTL (code
);
536 MARK_TS_DECL_COMMON (code
);
540 MARK_TS_DECL_WITH_VIS (code
);
544 case TS_FUNCTION_DECL
:
545 MARK_TS_DECL_NON_COMMON (code
);
548 case TS_TRANSLATION_UNIT_DECL
:
549 MARK_TS_DECL_COMMON (code
);
557 /* Basic consistency checks for attributes used in fold. */
558 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_NON_COMMON
]);
559 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_NON_COMMON
]);
560 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_DECL_COMMON
]);
561 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_COMMON
]);
562 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_COMMON
]);
563 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_COMMON
]);
564 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_COMMON
]);
565 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_COMMON
]);
566 gcc_assert (tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_COMMON
]);
567 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_COMMON
]);
568 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_DECL_COMMON
]);
569 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_WRTL
]);
570 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_WRTL
]);
571 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_WRTL
]);
572 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WRTL
]);
573 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_WRTL
]);
574 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_DECL_MINIMAL
]);
575 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_MINIMAL
]);
576 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_MINIMAL
]);
577 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_MINIMAL
]);
578 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_MINIMAL
]);
579 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_MINIMAL
]);
580 gcc_assert (tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_MINIMAL
]);
581 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_MINIMAL
]);
582 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_DECL_MINIMAL
]);
583 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_WITH_VIS
]);
584 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WITH_VIS
]);
585 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_WITH_VIS
]);
586 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_VAR_DECL
]);
587 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_FIELD_DECL
]);
588 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_PARM_DECL
]);
589 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_LABEL_DECL
]);
590 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_RESULT_DECL
]);
591 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_CONST_DECL
]);
592 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_TYPE_DECL
]);
593 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_FUNCTION_DECL
]);
594 gcc_assert (tree_contains_struct
[IMPORTED_DECL
][TS_DECL_MINIMAL
]);
595 gcc_assert (tree_contains_struct
[IMPORTED_DECL
][TS_DECL_COMMON
]);
596 gcc_assert (tree_contains_struct
[NAMELIST_DECL
][TS_DECL_MINIMAL
]);
597 gcc_assert (tree_contains_struct
[NAMELIST_DECL
][TS_DECL_COMMON
]);
606 /* Initialize the hash table of types. */
607 type_hash_table
= htab_create_ggc (TYPE_HASH_INITIAL_SIZE
, type_hash_hash
,
610 debug_expr_for_decl
= htab_create_ggc (512, tree_decl_map_hash
,
611 tree_decl_map_eq
, 0);
613 value_expr_for_decl
= htab_create_ggc (512, tree_decl_map_hash
,
614 tree_decl_map_eq
, 0);
616 int_cst_hash_table
= htab_create_ggc (1024, int_cst_hash_hash
,
617 int_cst_hash_eq
, NULL
);
619 int_cst_node
= make_int_cst (1, 1);
621 cl_option_hash_table
= htab_create_ggc (64, cl_option_hash_hash
,
622 cl_option_hash_eq
, NULL
);
624 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
625 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
627 /* Initialize the tree_contains_struct array. */
628 initialize_tree_contains_struct ();
629 lang_hooks
.init_ts ();
633 /* The name of the object as the assembler will see it (but before any
634 translations made by ASM_OUTPUT_LABELREF). Often this is the same
635 as DECL_NAME. It is an IDENTIFIER_NODE. */
637 decl_assembler_name (tree decl
)
639 if (!DECL_ASSEMBLER_NAME_SET_P (decl
))
640 lang_hooks
.set_decl_assembler_name (decl
);
641 return DECL_WITH_VIS_CHECK (decl
)->decl_with_vis
.assembler_name
;
644 /* When the target supports COMDAT groups, this indicates which group the
645 DECL is associated with. This can be either an IDENTIFIER_NODE or a
646 decl, in which case its DECL_ASSEMBLER_NAME identifies the group. */
648 decl_comdat_group (const_tree node
)
650 struct symtab_node
*snode
= symtab_node::get (node
);
653 return snode
->get_comdat_group ();
656 /* Likewise, but make sure it's been reduced to an IDENTIFIER_NODE. */
658 decl_comdat_group_id (const_tree node
)
660 struct symtab_node
*snode
= symtab_node::get (node
);
663 return snode
->get_comdat_group_id ();
666 /* When the target supports named section, return its name as IDENTIFIER_NODE
667 or NULL if it is in no section. */
669 decl_section_name (const_tree node
)
671 struct symtab_node
*snode
= symtab_node::get (node
);
674 return snode
->get_section ();
677 /* Set section section name of NODE to VALUE (that is expected to
678 be identifier node) */
680 set_decl_section_name (tree node
, const char *value
)
682 struct symtab_node
*snode
;
686 snode
= symtab_node::get (node
);
690 else if (TREE_CODE (node
) == VAR_DECL
)
691 snode
= varpool_node::get_create (node
);
693 snode
= cgraph_node::get_create (node
);
694 snode
->set_section (value
);
697 /* Return TLS model of a variable NODE. */
699 decl_tls_model (const_tree node
)
701 struct varpool_node
*snode
= varpool_node::get (node
);
703 return TLS_MODEL_NONE
;
704 return snode
->tls_model
;
707 /* Set TLS model of variable NODE to MODEL. */
709 set_decl_tls_model (tree node
, enum tls_model model
)
711 struct varpool_node
*vnode
;
713 if (model
== TLS_MODEL_NONE
)
715 vnode
= varpool_node::get (node
);
720 vnode
= varpool_node::get_create (node
);
721 vnode
->tls_model
= model
;
724 /* Compute the number of bytes occupied by a tree with code CODE.
725 This function cannot be used for nodes that have variable sizes,
726 including TREE_VEC, INTEGER_CST, STRING_CST, and CALL_EXPR. */
728 tree_code_size (enum tree_code code
)
730 switch (TREE_CODE_CLASS (code
))
732 case tcc_declaration
: /* A decl node */
737 return sizeof (struct tree_field_decl
);
739 return sizeof (struct tree_parm_decl
);
741 return sizeof (struct tree_var_decl
);
743 return sizeof (struct tree_label_decl
);
745 return sizeof (struct tree_result_decl
);
747 return sizeof (struct tree_const_decl
);
749 return sizeof (struct tree_type_decl
);
751 return sizeof (struct tree_function_decl
);
752 case DEBUG_EXPR_DECL
:
753 return sizeof (struct tree_decl_with_rtl
);
754 case TRANSLATION_UNIT_DECL
:
755 return sizeof (struct tree_translation_unit_decl
);
759 return sizeof (struct tree_decl_non_common
);
761 return lang_hooks
.tree_size (code
);
765 case tcc_type
: /* a type node */
766 return sizeof (struct tree_type_non_common
);
768 case tcc_reference
: /* a reference */
769 case tcc_expression
: /* an expression */
770 case tcc_statement
: /* an expression with side effects */
771 case tcc_comparison
: /* a comparison expression */
772 case tcc_unary
: /* a unary arithmetic expression */
773 case tcc_binary
: /* a binary arithmetic expression */
774 return (sizeof (struct tree_exp
)
775 + (TREE_CODE_LENGTH (code
) - 1) * sizeof (tree
));
777 case tcc_constant
: /* a constant */
780 case VOID_CST
: return sizeof (struct tree_typed
);
781 case INTEGER_CST
: gcc_unreachable ();
782 case REAL_CST
: return sizeof (struct tree_real_cst
);
783 case FIXED_CST
: return sizeof (struct tree_fixed_cst
);
784 case COMPLEX_CST
: return sizeof (struct tree_complex
);
785 case VECTOR_CST
: return sizeof (struct tree_vector
);
786 case STRING_CST
: gcc_unreachable ();
788 return lang_hooks
.tree_size (code
);
791 case tcc_exceptional
: /* something random, like an identifier. */
794 case IDENTIFIER_NODE
: return lang_hooks
.identifier_size
;
795 case TREE_LIST
: return sizeof (struct tree_list
);
798 case PLACEHOLDER_EXPR
: return sizeof (struct tree_common
);
801 case OMP_CLAUSE
: gcc_unreachable ();
803 case SSA_NAME
: return sizeof (struct tree_ssa_name
);
805 case STATEMENT_LIST
: return sizeof (struct tree_statement_list
);
806 case BLOCK
: return sizeof (struct tree_block
);
807 case CONSTRUCTOR
: return sizeof (struct tree_constructor
);
808 case OPTIMIZATION_NODE
: return sizeof (struct tree_optimization_option
);
809 case TARGET_OPTION_NODE
: return sizeof (struct tree_target_option
);
812 return lang_hooks
.tree_size (code
);
820 /* Compute the number of bytes occupied by NODE. This routine only
821 looks at TREE_CODE, except for those nodes that have variable sizes. */
823 tree_size (const_tree node
)
825 const enum tree_code code
= TREE_CODE (node
);
829 return (sizeof (struct tree_int_cst
)
830 + (TREE_INT_CST_EXT_NUNITS (node
) - 1) * sizeof (HOST_WIDE_INT
));
833 return (offsetof (struct tree_binfo
, base_binfos
)
835 ::embedded_size (BINFO_N_BASE_BINFOS (node
)));
838 return (sizeof (struct tree_vec
)
839 + (TREE_VEC_LENGTH (node
) - 1) * sizeof (tree
));
842 return (sizeof (struct tree_vector
)
843 + (TYPE_VECTOR_SUBPARTS (TREE_TYPE (node
)) - 1) * sizeof (tree
));
846 return TREE_STRING_LENGTH (node
) + offsetof (struct tree_string
, str
) + 1;
849 return (sizeof (struct tree_omp_clause
)
850 + (omp_clause_num_ops
[OMP_CLAUSE_CODE (node
)] - 1)
854 if (TREE_CODE_CLASS (code
) == tcc_vl_exp
)
855 return (sizeof (struct tree_exp
)
856 + (VL_EXP_OPERAND_LENGTH (node
) - 1) * sizeof (tree
));
858 return tree_code_size (code
);
862 /* Record interesting allocation statistics for a tree node with CODE
866 record_node_allocation_statistics (enum tree_code code ATTRIBUTE_UNUSED
,
867 size_t length ATTRIBUTE_UNUSED
)
869 enum tree_code_class type
= TREE_CODE_CLASS (code
);
872 if (!GATHER_STATISTICS
)
877 case tcc_declaration
: /* A decl node */
881 case tcc_type
: /* a type node */
885 case tcc_statement
: /* an expression with side effects */
889 case tcc_reference
: /* a reference */
893 case tcc_expression
: /* an expression */
894 case tcc_comparison
: /* a comparison expression */
895 case tcc_unary
: /* a unary arithmetic expression */
896 case tcc_binary
: /* a binary arithmetic expression */
900 case tcc_constant
: /* a constant */
904 case tcc_exceptional
: /* something random, like an identifier. */
907 case IDENTIFIER_NODE
:
920 kind
= ssa_name_kind
;
932 kind
= omp_clause_kind
;
949 tree_code_counts
[(int) code
]++;
950 tree_node_counts
[(int) kind
]++;
951 tree_node_sizes
[(int) kind
] += length
;
954 /* Allocate and return a new UID from the DECL_UID namespace. */
957 allocate_decl_uid (void)
959 return next_decl_uid
++;
962 /* Return a newly allocated node of code CODE. For decl and type
963 nodes, some other fields are initialized. The rest of the node is
964 initialized to zero. This function cannot be used for TREE_VEC,
965 INTEGER_CST or OMP_CLAUSE nodes, which is enforced by asserts in
968 Achoo! I got a code in the node. */
971 make_node_stat (enum tree_code code MEM_STAT_DECL
)
974 enum tree_code_class type
= TREE_CODE_CLASS (code
);
975 size_t length
= tree_code_size (code
);
977 record_node_allocation_statistics (code
, length
);
979 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
980 TREE_SET_CODE (t
, code
);
985 TREE_SIDE_EFFECTS (t
) = 1;
988 case tcc_declaration
:
989 if (CODE_CONTAINS_STRUCT (code
, TS_DECL_COMMON
))
991 if (code
== FUNCTION_DECL
)
993 DECL_ALIGN (t
) = FUNCTION_BOUNDARY
;
994 DECL_MODE (t
) = FUNCTION_MODE
;
999 DECL_SOURCE_LOCATION (t
) = input_location
;
1000 if (TREE_CODE (t
) == DEBUG_EXPR_DECL
)
1001 DECL_UID (t
) = --next_debug_decl_uid
;
1004 DECL_UID (t
) = allocate_decl_uid ();
1005 SET_DECL_PT_UID (t
, -1);
1007 if (TREE_CODE (t
) == LABEL_DECL
)
1008 LABEL_DECL_UID (t
) = -1;
1013 TYPE_UID (t
) = next_type_uid
++;
1014 TYPE_ALIGN (t
) = BITS_PER_UNIT
;
1015 TYPE_USER_ALIGN (t
) = 0;
1016 TYPE_MAIN_VARIANT (t
) = t
;
1017 TYPE_CANONICAL (t
) = t
;
1019 /* Default to no attributes for type, but let target change that. */
1020 TYPE_ATTRIBUTES (t
) = NULL_TREE
;
1021 targetm
.set_default_type_attributes (t
);
1023 /* We have not yet computed the alias set for this type. */
1024 TYPE_ALIAS_SET (t
) = -1;
1028 TREE_CONSTANT (t
) = 1;
1031 case tcc_expression
:
1037 case PREDECREMENT_EXPR
:
1038 case PREINCREMENT_EXPR
:
1039 case POSTDECREMENT_EXPR
:
1040 case POSTINCREMENT_EXPR
:
1041 /* All of these have side-effects, no matter what their
1043 TREE_SIDE_EFFECTS (t
) = 1;
1052 /* Other classes need no special treatment. */
1059 /* Return a new node with the same contents as NODE except that its
1060 TREE_CHAIN, if it has one, is zero and it has a fresh uid. */
1063 copy_node_stat (tree node MEM_STAT_DECL
)
1066 enum tree_code code
= TREE_CODE (node
);
1069 gcc_assert (code
!= STATEMENT_LIST
);
1071 length
= tree_size (node
);
1072 record_node_allocation_statistics (code
, length
);
1073 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
1074 memcpy (t
, node
, length
);
1076 if (CODE_CONTAINS_STRUCT (code
, TS_COMMON
))
1078 TREE_ASM_WRITTEN (t
) = 0;
1079 TREE_VISITED (t
) = 0;
1081 if (TREE_CODE_CLASS (code
) == tcc_declaration
)
1083 if (code
== DEBUG_EXPR_DECL
)
1084 DECL_UID (t
) = --next_debug_decl_uid
;
1087 DECL_UID (t
) = allocate_decl_uid ();
1088 if (DECL_PT_UID_SET_P (node
))
1089 SET_DECL_PT_UID (t
, DECL_PT_UID (node
));
1091 if ((TREE_CODE (node
) == PARM_DECL
|| TREE_CODE (node
) == VAR_DECL
)
1092 && DECL_HAS_VALUE_EXPR_P (node
))
1094 SET_DECL_VALUE_EXPR (t
, DECL_VALUE_EXPR (node
));
1095 DECL_HAS_VALUE_EXPR_P (t
) = 1;
1097 /* DECL_DEBUG_EXPR is copied explicitely by callers. */
1098 if (TREE_CODE (node
) == VAR_DECL
)
1100 DECL_HAS_DEBUG_EXPR_P (t
) = 0;
1101 t
->decl_with_vis
.symtab_node
= NULL
;
1103 if (TREE_CODE (node
) == VAR_DECL
&& DECL_HAS_INIT_PRIORITY_P (node
))
1105 SET_DECL_INIT_PRIORITY (t
, DECL_INIT_PRIORITY (node
));
1106 DECL_HAS_INIT_PRIORITY_P (t
) = 1;
1108 if (TREE_CODE (node
) == FUNCTION_DECL
)
1110 DECL_STRUCT_FUNCTION (t
) = NULL
;
1111 t
->decl_with_vis
.symtab_node
= NULL
;
1114 else if (TREE_CODE_CLASS (code
) == tcc_type
)
1116 TYPE_UID (t
) = next_type_uid
++;
1117 /* The following is so that the debug code for
1118 the copy is different from the original type.
1119 The two statements usually duplicate each other
1120 (because they clear fields of the same union),
1121 but the optimizer should catch that. */
1122 TYPE_SYMTAB_POINTER (t
) = 0;
1123 TYPE_SYMTAB_ADDRESS (t
) = 0;
1125 /* Do not copy the values cache. */
1126 if (TYPE_CACHED_VALUES_P (t
))
1128 TYPE_CACHED_VALUES_P (t
) = 0;
1129 TYPE_CACHED_VALUES (t
) = NULL_TREE
;
1136 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
1137 For example, this can copy a list made of TREE_LIST nodes. */
1140 copy_list (tree list
)
1148 head
= prev
= copy_node (list
);
1149 next
= TREE_CHAIN (list
);
1152 TREE_CHAIN (prev
) = copy_node (next
);
1153 prev
= TREE_CHAIN (prev
);
1154 next
= TREE_CHAIN (next
);
1160 /* Return the value that TREE_INT_CST_EXT_NUNITS should have for an
1161 INTEGER_CST with value CST and type TYPE. */
1164 get_int_cst_ext_nunits (tree type
, const wide_int
&cst
)
1166 gcc_checking_assert (cst
.get_precision () == TYPE_PRECISION (type
));
1167 /* We need an extra zero HWI if CST is an unsigned integer with its
1168 upper bit set, and if CST occupies a whole number of HWIs. */
1169 if (TYPE_UNSIGNED (type
)
1171 && (cst
.get_precision () % HOST_BITS_PER_WIDE_INT
) == 0)
1172 return cst
.get_precision () / HOST_BITS_PER_WIDE_INT
+ 1;
1173 return cst
.get_len ();
1176 /* Return a new INTEGER_CST with value CST and type TYPE. */
1179 build_new_int_cst (tree type
, const wide_int
&cst
)
1181 unsigned int len
= cst
.get_len ();
1182 unsigned int ext_len
= get_int_cst_ext_nunits (type
, cst
);
1183 tree nt
= make_int_cst (len
, ext_len
);
1188 TREE_INT_CST_ELT (nt
, ext_len
) = 0;
1189 for (unsigned int i
= len
; i
< ext_len
; ++i
)
1190 TREE_INT_CST_ELT (nt
, i
) = -1;
1192 else if (TYPE_UNSIGNED (type
)
1193 && cst
.get_precision () < len
* HOST_BITS_PER_WIDE_INT
)
1196 TREE_INT_CST_ELT (nt
, len
)
1197 = zext_hwi (cst
.elt (len
),
1198 cst
.get_precision () % HOST_BITS_PER_WIDE_INT
);
1201 for (unsigned int i
= 0; i
< len
; i
++)
1202 TREE_INT_CST_ELT (nt
, i
) = cst
.elt (i
);
1203 TREE_TYPE (nt
) = type
;
1207 /* Create an INT_CST node with a LOW value sign extended to TYPE. */
1210 build_int_cst (tree type
, HOST_WIDE_INT low
)
1212 /* Support legacy code. */
1214 type
= integer_type_node
;
1216 return wide_int_to_tree (type
, wi::shwi (low
, TYPE_PRECISION (type
)));
1220 build_int_cstu (tree type
, unsigned HOST_WIDE_INT cst
)
1222 return wide_int_to_tree (type
, wi::uhwi (cst
, TYPE_PRECISION (type
)));
1225 /* Create an INT_CST node with a LOW value sign extended to TYPE. */
1228 build_int_cst_type (tree type
, HOST_WIDE_INT low
)
1231 return wide_int_to_tree (type
, wi::shwi (low
, TYPE_PRECISION (type
)));
1234 /* Constructs tree in type TYPE from with value given by CST. Signedness
1235 of CST is assumed to be the same as the signedness of TYPE. */
1238 double_int_to_tree (tree type
, double_int cst
)
1240 return wide_int_to_tree (type
, widest_int::from (cst
, TYPE_SIGN (type
)));
1243 /* We force the wide_int CST to the range of the type TYPE by sign or
1244 zero extending it. OVERFLOWABLE indicates if we are interested in
1245 overflow of the value, when >0 we are only interested in signed
1246 overflow, for <0 we are interested in any overflow. OVERFLOWED
1247 indicates whether overflow has already occurred. CONST_OVERFLOWED
1248 indicates whether constant overflow has already occurred. We force
1249 T's value to be within range of T's type (by setting to 0 or 1 all
1250 the bits outside the type's range). We set TREE_OVERFLOWED if,
1251 OVERFLOWED is nonzero,
1252 or OVERFLOWABLE is >0 and signed overflow occurs
1253 or OVERFLOWABLE is <0 and any overflow occurs
1254 We return a new tree node for the extended wide_int. The node
1255 is shared if no overflow flags are set. */
1259 force_fit_type (tree type
, const wide_int_ref
&cst
,
1260 int overflowable
, bool overflowed
)
1262 signop sign
= TYPE_SIGN (type
);
1264 /* If we need to set overflow flags, return a new unshared node. */
1265 if (overflowed
|| !wi::fits_to_tree_p (cst
, type
))
1269 || (overflowable
> 0 && sign
== SIGNED
))
1271 wide_int tmp
= wide_int::from (cst
, TYPE_PRECISION (type
), sign
);
1272 tree t
= build_new_int_cst (type
, tmp
);
1273 TREE_OVERFLOW (t
) = 1;
1278 /* Else build a shared node. */
1279 return wide_int_to_tree (type
, cst
);
1282 /* These are the hash table functions for the hash table of INTEGER_CST
1283 nodes of a sizetype. */
1285 /* Return the hash code code X, an INTEGER_CST. */
1288 int_cst_hash_hash (const void *x
)
1290 const_tree
const t
= (const_tree
) x
;
1291 hashval_t code
= htab_hash_pointer (TREE_TYPE (t
));
1294 for (i
= 0; i
< TREE_INT_CST_NUNITS (t
); i
++)
1295 code
^= TREE_INT_CST_ELT (t
, i
);
1300 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
1301 is the same as that given by *Y, which is the same. */
1304 int_cst_hash_eq (const void *x
, const void *y
)
1306 const_tree
const xt
= (const_tree
) x
;
1307 const_tree
const yt
= (const_tree
) y
;
1309 if (TREE_TYPE (xt
) != TREE_TYPE (yt
)
1310 || TREE_INT_CST_NUNITS (xt
) != TREE_INT_CST_NUNITS (yt
)
1311 || TREE_INT_CST_EXT_NUNITS (xt
) != TREE_INT_CST_EXT_NUNITS (yt
))
1314 for (int i
= 0; i
< TREE_INT_CST_NUNITS (xt
); i
++)
1315 if (TREE_INT_CST_ELT (xt
, i
) != TREE_INT_CST_ELT (yt
, i
))
1321 /* Create an INT_CST node of TYPE and value CST.
1322 The returned node is always shared. For small integers we use a
1323 per-type vector cache, for larger ones we use a single hash table.
1324 The value is extended from its precision according to the sign of
1325 the type to be a multiple of HOST_BITS_PER_WIDE_INT. This defines
1326 the upper bits and ensures that hashing and value equality based
1327 upon the underlying HOST_WIDE_INTs works without masking. */
1330 wide_int_to_tree (tree type
, const wide_int_ref
&pcst
)
1337 unsigned int prec
= TYPE_PRECISION (type
);
1338 signop sgn
= TYPE_SIGN (type
);
1340 /* Verify that everything is canonical. */
1341 int l
= pcst
.get_len ();
1344 if (pcst
.elt (l
- 1) == 0)
1345 gcc_checking_assert (pcst
.elt (l
- 2) < 0);
1346 if (pcst
.elt (l
- 1) == (HOST_WIDE_INT
) -1)
1347 gcc_checking_assert (pcst
.elt (l
- 2) >= 0);
1350 wide_int cst
= wide_int::from (pcst
, prec
, sgn
);
1351 unsigned int ext_len
= get_int_cst_ext_nunits (type
, cst
);
1355 /* We just need to store a single HOST_WIDE_INT. */
1357 if (TYPE_UNSIGNED (type
))
1358 hwi
= cst
.to_uhwi ();
1360 hwi
= cst
.to_shwi ();
1362 switch (TREE_CODE (type
))
1365 gcc_assert (hwi
== 0);
1369 case REFERENCE_TYPE
:
1370 /* Cache NULL pointer. */
1379 /* Cache false or true. */
1387 if (TYPE_SIGN (type
) == UNSIGNED
)
1390 limit
= INTEGER_SHARE_LIMIT
;
1391 if (IN_RANGE (hwi
, 0, INTEGER_SHARE_LIMIT
- 1))
1396 /* Cache [-1, N). */
1397 limit
= INTEGER_SHARE_LIMIT
+ 1;
1398 if (IN_RANGE (hwi
, -1, INTEGER_SHARE_LIMIT
- 1))
1412 /* Look for it in the type's vector of small shared ints. */
1413 if (!TYPE_CACHED_VALUES_P (type
))
1415 TYPE_CACHED_VALUES_P (type
) = 1;
1416 TYPE_CACHED_VALUES (type
) = make_tree_vec (limit
);
1419 t
= TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
);
1421 /* Make sure no one is clobbering the shared constant. */
1422 gcc_checking_assert (TREE_TYPE (t
) == type
1423 && TREE_INT_CST_NUNITS (t
) == 1
1424 && TREE_INT_CST_OFFSET_NUNITS (t
) == 1
1425 && TREE_INT_CST_EXT_NUNITS (t
) == 1
1426 && TREE_INT_CST_ELT (t
, 0) == hwi
);
1429 /* Create a new shared int. */
1430 t
= build_new_int_cst (type
, cst
);
1431 TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) = t
;
1436 /* Use the cache of larger shared ints, using int_cst_node as
1440 TREE_INT_CST_ELT (int_cst_node
, 0) = hwi
;
1441 TREE_TYPE (int_cst_node
) = type
;
1443 slot
= htab_find_slot (int_cst_hash_table
, int_cst_node
, INSERT
);
1447 /* Insert this one into the hash table. */
1450 /* Make a new node for next time round. */
1451 int_cst_node
= make_int_cst (1, 1);
1457 /* The value either hashes properly or we drop it on the floor
1458 for the gc to take care of. There will not be enough of them
1462 tree nt
= build_new_int_cst (type
, cst
);
1463 slot
= htab_find_slot (int_cst_hash_table
, nt
, INSERT
);
1467 /* Insert this one into the hash table. */
1477 cache_integer_cst (tree t
)
1479 tree type
= TREE_TYPE (t
);
1482 int prec
= TYPE_PRECISION (type
);
1484 gcc_assert (!TREE_OVERFLOW (t
));
1486 switch (TREE_CODE (type
))
1489 gcc_assert (integer_zerop (t
));
1493 case REFERENCE_TYPE
:
1494 /* Cache NULL pointer. */
1495 if (integer_zerop (t
))
1503 /* Cache false or true. */
1505 if (wi::ltu_p (t
, 2))
1506 ix
= TREE_INT_CST_ELT (t
, 0);
1511 if (TYPE_UNSIGNED (type
))
1514 limit
= INTEGER_SHARE_LIMIT
;
1516 /* This is a little hokie, but if the prec is smaller than
1517 what is necessary to hold INTEGER_SHARE_LIMIT, then the
1518 obvious test will not get the correct answer. */
1519 if (prec
< HOST_BITS_PER_WIDE_INT
)
1521 if (tree_to_uhwi (t
) < (unsigned HOST_WIDE_INT
) INTEGER_SHARE_LIMIT
)
1522 ix
= tree_to_uhwi (t
);
1524 else if (wi::ltu_p (t
, INTEGER_SHARE_LIMIT
))
1525 ix
= tree_to_uhwi (t
);
1530 limit
= INTEGER_SHARE_LIMIT
+ 1;
1532 if (integer_minus_onep (t
))
1534 else if (!wi::neg_p (t
))
1536 if (prec
< HOST_BITS_PER_WIDE_INT
)
1538 if (tree_to_shwi (t
) < INTEGER_SHARE_LIMIT
)
1539 ix
= tree_to_shwi (t
) + 1;
1541 else if (wi::ltu_p (t
, INTEGER_SHARE_LIMIT
))
1542 ix
= tree_to_shwi (t
) + 1;
1556 /* Look for it in the type's vector of small shared ints. */
1557 if (!TYPE_CACHED_VALUES_P (type
))
1559 TYPE_CACHED_VALUES_P (type
) = 1;
1560 TYPE_CACHED_VALUES (type
) = make_tree_vec (limit
);
1563 gcc_assert (TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) == NULL_TREE
);
1564 TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) = t
;
1568 /* Use the cache of larger shared ints. */
1571 slot
= htab_find_slot (int_cst_hash_table
, t
, INSERT
);
1572 /* If there is already an entry for the number verify it's the
1575 gcc_assert (wi::eq_p (tree (*slot
), t
));
1577 /* Otherwise insert this one into the hash table. */
1583 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
1584 and the rest are zeros. */
1587 build_low_bits_mask (tree type
, unsigned bits
)
1589 gcc_assert (bits
<= TYPE_PRECISION (type
));
1591 return wide_int_to_tree (type
, wi::mask (bits
, false,
1592 TYPE_PRECISION (type
)));
1595 /* Checks that X is integer constant that can be expressed in (unsigned)
1596 HOST_WIDE_INT without loss of precision. */
1599 cst_and_fits_in_hwi (const_tree x
)
1601 if (TREE_CODE (x
) != INTEGER_CST
)
1604 if (TYPE_PRECISION (TREE_TYPE (x
)) > HOST_BITS_PER_WIDE_INT
)
1607 return TREE_INT_CST_NUNITS (x
) == 1;
1610 /* Build a newly constructed TREE_VEC node of length LEN. */
1613 make_vector_stat (unsigned len MEM_STAT_DECL
)
1616 unsigned length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vector
);
1618 record_node_allocation_statistics (VECTOR_CST
, length
);
1620 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
1622 TREE_SET_CODE (t
, VECTOR_CST
);
1623 TREE_CONSTANT (t
) = 1;
1628 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1629 are in a list pointed to by VALS. */
1632 build_vector_stat (tree type
, tree
*vals MEM_STAT_DECL
)
1636 tree v
= make_vector (TYPE_VECTOR_SUBPARTS (type
));
1637 TREE_TYPE (v
) = type
;
1639 /* Iterate through elements and check for overflow. */
1640 for (cnt
= 0; cnt
< TYPE_VECTOR_SUBPARTS (type
); ++cnt
)
1642 tree value
= vals
[cnt
];
1644 VECTOR_CST_ELT (v
, cnt
) = value
;
1646 /* Don't crash if we get an address constant. */
1647 if (!CONSTANT_CLASS_P (value
))
1650 over
|= TREE_OVERFLOW (value
);
1653 TREE_OVERFLOW (v
) = over
;
1657 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1658 are extracted from V, a vector of CONSTRUCTOR_ELT. */
1661 build_vector_from_ctor (tree type
, vec
<constructor_elt
, va_gc
> *v
)
1663 tree
*vec
= XALLOCAVEC (tree
, TYPE_VECTOR_SUBPARTS (type
));
1664 unsigned HOST_WIDE_INT idx
;
1667 FOR_EACH_CONSTRUCTOR_VALUE (v
, idx
, value
)
1669 for (; idx
< TYPE_VECTOR_SUBPARTS (type
); ++idx
)
1670 vec
[idx
] = build_zero_cst (TREE_TYPE (type
));
1672 return build_vector (type
, vec
);
1675 /* Build a vector of type VECTYPE where all the elements are SCs. */
1677 build_vector_from_val (tree vectype
, tree sc
)
1679 int i
, nunits
= TYPE_VECTOR_SUBPARTS (vectype
);
1681 if (sc
== error_mark_node
)
1684 /* Verify that the vector type is suitable for SC. Note that there
1685 is some inconsistency in the type-system with respect to restrict
1686 qualifications of pointers. Vector types always have a main-variant
1687 element type and the qualification is applied to the vector-type.
1688 So TREE_TYPE (vector-type) does not return a properly qualified
1689 vector element-type. */
1690 gcc_checking_assert (types_compatible_p (TYPE_MAIN_VARIANT (TREE_TYPE (sc
)),
1691 TREE_TYPE (vectype
)));
1693 if (CONSTANT_CLASS_P (sc
))
1695 tree
*v
= XALLOCAVEC (tree
, nunits
);
1696 for (i
= 0; i
< nunits
; ++i
)
1698 return build_vector (vectype
, v
);
1702 vec
<constructor_elt
, va_gc
> *v
;
1703 vec_alloc (v
, nunits
);
1704 for (i
= 0; i
< nunits
; ++i
)
1705 CONSTRUCTOR_APPEND_ELT (v
, NULL_TREE
, sc
);
1706 return build_constructor (vectype
, v
);
1710 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1711 are in the vec pointed to by VALS. */
1713 build_constructor (tree type
, vec
<constructor_elt
, va_gc
> *vals
)
1715 tree c
= make_node (CONSTRUCTOR
);
1717 constructor_elt
*elt
;
1718 bool constant_p
= true;
1719 bool side_effects_p
= false;
1721 TREE_TYPE (c
) = type
;
1722 CONSTRUCTOR_ELTS (c
) = vals
;
1724 FOR_EACH_VEC_SAFE_ELT (vals
, i
, elt
)
1726 /* Mostly ctors will have elts that don't have side-effects, so
1727 the usual case is to scan all the elements. Hence a single
1728 loop for both const and side effects, rather than one loop
1729 each (with early outs). */
1730 if (!TREE_CONSTANT (elt
->value
))
1732 if (TREE_SIDE_EFFECTS (elt
->value
))
1733 side_effects_p
= true;
1736 TREE_SIDE_EFFECTS (c
) = side_effects_p
;
1737 TREE_CONSTANT (c
) = constant_p
;
1742 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
1745 build_constructor_single (tree type
, tree index
, tree value
)
1747 vec
<constructor_elt
, va_gc
> *v
;
1748 constructor_elt elt
= {index
, value
};
1751 v
->quick_push (elt
);
1753 return build_constructor (type
, v
);
1757 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1758 are in a list pointed to by VALS. */
1760 build_constructor_from_list (tree type
, tree vals
)
1763 vec
<constructor_elt
, va_gc
> *v
= NULL
;
1767 vec_alloc (v
, list_length (vals
));
1768 for (t
= vals
; t
; t
= TREE_CHAIN (t
))
1769 CONSTRUCTOR_APPEND_ELT (v
, TREE_PURPOSE (t
), TREE_VALUE (t
));
1772 return build_constructor (type
, v
);
1775 /* Return a new CONSTRUCTOR node whose type is TYPE. NELTS is the number
1776 of elements, provided as index/value pairs. */
1779 build_constructor_va (tree type
, int nelts
, ...)
1781 vec
<constructor_elt
, va_gc
> *v
= NULL
;
1784 va_start (p
, nelts
);
1785 vec_alloc (v
, nelts
);
1788 tree index
= va_arg (p
, tree
);
1789 tree value
= va_arg (p
, tree
);
1790 CONSTRUCTOR_APPEND_ELT (v
, index
, value
);
1793 return build_constructor (type
, v
);
1796 /* Return a new FIXED_CST node whose type is TYPE and value is F. */
1799 build_fixed (tree type
, FIXED_VALUE_TYPE f
)
1802 FIXED_VALUE_TYPE
*fp
;
1804 v
= make_node (FIXED_CST
);
1805 fp
= ggc_alloc
<fixed_value
> ();
1806 memcpy (fp
, &f
, sizeof (FIXED_VALUE_TYPE
));
1808 TREE_TYPE (v
) = type
;
1809 TREE_FIXED_CST_PTR (v
) = fp
;
1813 /* Return a new REAL_CST node whose type is TYPE and value is D. */
1816 build_real (tree type
, REAL_VALUE_TYPE d
)
1819 REAL_VALUE_TYPE
*dp
;
1822 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
1823 Consider doing it via real_convert now. */
1825 v
= make_node (REAL_CST
);
1826 dp
= ggc_alloc
<real_value
> ();
1827 memcpy (dp
, &d
, sizeof (REAL_VALUE_TYPE
));
1829 TREE_TYPE (v
) = type
;
1830 TREE_REAL_CST_PTR (v
) = dp
;
1831 TREE_OVERFLOW (v
) = overflow
;
1835 /* Return a new REAL_CST node whose type is TYPE
1836 and whose value is the integer value of the INTEGER_CST node I. */
1839 real_value_from_int_cst (const_tree type
, const_tree i
)
1843 /* Clear all bits of the real value type so that we can later do
1844 bitwise comparisons to see if two values are the same. */
1845 memset (&d
, 0, sizeof d
);
1847 real_from_integer (&d
, type
? TYPE_MODE (type
) : VOIDmode
, i
,
1848 TYPE_SIGN (TREE_TYPE (i
)));
1852 /* Given a tree representing an integer constant I, return a tree
1853 representing the same value as a floating-point constant of type TYPE. */
1856 build_real_from_int_cst (tree type
, const_tree i
)
1859 int overflow
= TREE_OVERFLOW (i
);
1861 v
= build_real (type
, real_value_from_int_cst (type
, i
));
1863 TREE_OVERFLOW (v
) |= overflow
;
1867 /* Return a newly constructed STRING_CST node whose value is
1868 the LEN characters at STR.
1869 Note that for a C string literal, LEN should include the trailing NUL.
1870 The TREE_TYPE is not initialized. */
1873 build_string (int len
, const char *str
)
1878 /* Do not waste bytes provided by padding of struct tree_string. */
1879 length
= len
+ offsetof (struct tree_string
, str
) + 1;
1881 record_node_allocation_statistics (STRING_CST
, length
);
1883 s
= (tree
) ggc_internal_alloc (length
);
1885 memset (s
, 0, sizeof (struct tree_typed
));
1886 TREE_SET_CODE (s
, STRING_CST
);
1887 TREE_CONSTANT (s
) = 1;
1888 TREE_STRING_LENGTH (s
) = len
;
1889 memcpy (s
->string
.str
, str
, len
);
1890 s
->string
.str
[len
] = '\0';
1895 /* Return a newly constructed COMPLEX_CST node whose value is
1896 specified by the real and imaginary parts REAL and IMAG.
1897 Both REAL and IMAG should be constant nodes. TYPE, if specified,
1898 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
1901 build_complex (tree type
, tree real
, tree imag
)
1903 tree t
= make_node (COMPLEX_CST
);
1905 TREE_REALPART (t
) = real
;
1906 TREE_IMAGPART (t
) = imag
;
1907 TREE_TYPE (t
) = type
? type
: build_complex_type (TREE_TYPE (real
));
1908 TREE_OVERFLOW (t
) = TREE_OVERFLOW (real
) | TREE_OVERFLOW (imag
);
1912 /* Return a constant of arithmetic type TYPE which is the
1913 multiplicative identity of the set TYPE. */
1916 build_one_cst (tree type
)
1918 switch (TREE_CODE (type
))
1920 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
1921 case POINTER_TYPE
: case REFERENCE_TYPE
:
1923 return build_int_cst (type
, 1);
1926 return build_real (type
, dconst1
);
1928 case FIXED_POINT_TYPE
:
1929 /* We can only generate 1 for accum types. */
1930 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type
)));
1931 return build_fixed (type
, FCONST1 (TYPE_MODE (type
)));
1935 tree scalar
= build_one_cst (TREE_TYPE (type
));
1937 return build_vector_from_val (type
, scalar
);
1941 return build_complex (type
,
1942 build_one_cst (TREE_TYPE (type
)),
1943 build_zero_cst (TREE_TYPE (type
)));
1950 /* Return an integer of type TYPE containing all 1's in as much precision as
1951 it contains, or a complex or vector whose subparts are such integers. */
1954 build_all_ones_cst (tree type
)
1956 if (TREE_CODE (type
) == COMPLEX_TYPE
)
1958 tree scalar
= build_all_ones_cst (TREE_TYPE (type
));
1959 return build_complex (type
, scalar
, scalar
);
1962 return build_minus_one_cst (type
);
1965 /* Return a constant of arithmetic type TYPE which is the
1966 opposite of the multiplicative identity of the set TYPE. */
1969 build_minus_one_cst (tree type
)
1971 switch (TREE_CODE (type
))
1973 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
1974 case POINTER_TYPE
: case REFERENCE_TYPE
:
1976 return build_int_cst (type
, -1);
1979 return build_real (type
, dconstm1
);
1981 case FIXED_POINT_TYPE
:
1982 /* We can only generate 1 for accum types. */
1983 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type
)));
1984 return build_fixed (type
, fixed_from_double_int (double_int_minus_one
,
1989 tree scalar
= build_minus_one_cst (TREE_TYPE (type
));
1991 return build_vector_from_val (type
, scalar
);
1995 return build_complex (type
,
1996 build_minus_one_cst (TREE_TYPE (type
)),
1997 build_zero_cst (TREE_TYPE (type
)));
2004 /* Build 0 constant of type TYPE. This is used by constructor folding
2005 and thus the constant should be represented in memory by
2009 build_zero_cst (tree type
)
2011 switch (TREE_CODE (type
))
2013 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
2014 case POINTER_TYPE
: case REFERENCE_TYPE
:
2015 case OFFSET_TYPE
: case NULLPTR_TYPE
:
2016 return build_int_cst (type
, 0);
2019 return build_real (type
, dconst0
);
2021 case FIXED_POINT_TYPE
:
2022 return build_fixed (type
, FCONST0 (TYPE_MODE (type
)));
2026 tree scalar
= build_zero_cst (TREE_TYPE (type
));
2028 return build_vector_from_val (type
, scalar
);
2033 tree zero
= build_zero_cst (TREE_TYPE (type
));
2035 return build_complex (type
, zero
, zero
);
2039 if (!AGGREGATE_TYPE_P (type
))
2040 return fold_convert (type
, integer_zero_node
);
2041 return build_constructor (type
, NULL
);
2046 /* Build a BINFO with LEN language slots. */
2049 make_tree_binfo_stat (unsigned base_binfos MEM_STAT_DECL
)
2052 size_t length
= (offsetof (struct tree_binfo
, base_binfos
)
2053 + vec
<tree
, va_gc
>::embedded_size (base_binfos
));
2055 record_node_allocation_statistics (TREE_BINFO
, length
);
2057 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
2059 memset (t
, 0, offsetof (struct tree_binfo
, base_binfos
));
2061 TREE_SET_CODE (t
, TREE_BINFO
);
2063 BINFO_BASE_BINFOS (t
)->embedded_init (base_binfos
);
2068 /* Create a CASE_LABEL_EXPR tree node and return it. */
2071 build_case_label (tree low_value
, tree high_value
, tree label_decl
)
2073 tree t
= make_node (CASE_LABEL_EXPR
);
2075 TREE_TYPE (t
) = void_type_node
;
2076 SET_EXPR_LOCATION (t
, DECL_SOURCE_LOCATION (label_decl
));
2078 CASE_LOW (t
) = low_value
;
2079 CASE_HIGH (t
) = high_value
;
2080 CASE_LABEL (t
) = label_decl
;
2081 CASE_CHAIN (t
) = NULL_TREE
;
2086 /* Build a newly constructed INTEGER_CST node. LEN and EXT_LEN are the
2087 values of TREE_INT_CST_NUNITS and TREE_INT_CST_EXT_NUNITS respectively.
2088 The latter determines the length of the HOST_WIDE_INT vector. */
2091 make_int_cst_stat (int len
, int ext_len MEM_STAT_DECL
)
2094 int length
= ((ext_len
- 1) * sizeof (HOST_WIDE_INT
)
2095 + sizeof (struct tree_int_cst
));
2098 record_node_allocation_statistics (INTEGER_CST
, length
);
2100 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
2102 TREE_SET_CODE (t
, INTEGER_CST
);
2103 TREE_INT_CST_NUNITS (t
) = len
;
2104 TREE_INT_CST_EXT_NUNITS (t
) = ext_len
;
2105 /* to_offset can only be applied to trees that are offset_int-sized
2106 or smaller. EXT_LEN is correct if it fits, otherwise the constant
2107 must be exactly the precision of offset_int and so LEN is correct. */
2108 if (ext_len
<= OFFSET_INT_ELTS
)
2109 TREE_INT_CST_OFFSET_NUNITS (t
) = ext_len
;
2111 TREE_INT_CST_OFFSET_NUNITS (t
) = len
;
2113 TREE_CONSTANT (t
) = 1;
2118 /* Build a newly constructed TREE_VEC node of length LEN. */
2121 make_tree_vec_stat (int len MEM_STAT_DECL
)
2124 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
2126 record_node_allocation_statistics (TREE_VEC
, length
);
2128 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
2130 TREE_SET_CODE (t
, TREE_VEC
);
2131 TREE_VEC_LENGTH (t
) = len
;
2136 /* Grow a TREE_VEC node to new length LEN. */
2139 grow_tree_vec_stat (tree v
, int len MEM_STAT_DECL
)
2141 gcc_assert (TREE_CODE (v
) == TREE_VEC
);
2143 int oldlen
= TREE_VEC_LENGTH (v
);
2144 gcc_assert (len
> oldlen
);
2146 int oldlength
= (oldlen
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
2147 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
2149 record_node_allocation_statistics (TREE_VEC
, length
- oldlength
);
2151 v
= (tree
) ggc_realloc (v
, length PASS_MEM_STAT
);
2153 TREE_VEC_LENGTH (v
) = len
;
2158 /* Return 1 if EXPR is the integer constant zero or a complex constant
2162 integer_zerop (const_tree expr
)
2166 switch (TREE_CODE (expr
))
2169 return wi::eq_p (expr
, 0);
2171 return (integer_zerop (TREE_REALPART (expr
))
2172 && integer_zerop (TREE_IMAGPART (expr
)));
2176 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2177 if (!integer_zerop (VECTOR_CST_ELT (expr
, i
)))
2186 /* Return 1 if EXPR is the integer constant one or the corresponding
2187 complex constant. */
2190 integer_onep (const_tree expr
)
2194 switch (TREE_CODE (expr
))
2197 return wi::eq_p (wi::to_widest (expr
), 1);
2199 return (integer_onep (TREE_REALPART (expr
))
2200 && integer_zerop (TREE_IMAGPART (expr
)));
2204 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2205 if (!integer_onep (VECTOR_CST_ELT (expr
, i
)))
2214 /* Return 1 if EXPR is the integer constant one. For complex and vector,
2215 return 1 if every piece is the integer constant one. */
2218 integer_each_onep (const_tree expr
)
2222 if (TREE_CODE (expr
) == COMPLEX_CST
)
2223 return (integer_onep (TREE_REALPART (expr
))
2224 && integer_onep (TREE_IMAGPART (expr
)));
2226 return integer_onep (expr
);
2229 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
2230 it contains, or a complex or vector whose subparts are such integers. */
2233 integer_all_onesp (const_tree expr
)
2237 if (TREE_CODE (expr
) == COMPLEX_CST
2238 && integer_all_onesp (TREE_REALPART (expr
))
2239 && integer_all_onesp (TREE_IMAGPART (expr
)))
2242 else if (TREE_CODE (expr
) == VECTOR_CST
)
2245 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2246 if (!integer_all_onesp (VECTOR_CST_ELT (expr
, i
)))
2251 else if (TREE_CODE (expr
) != INTEGER_CST
)
2254 return wi::max_value (TYPE_PRECISION (TREE_TYPE (expr
)), UNSIGNED
) == expr
;
2257 /* Return 1 if EXPR is the integer constant minus one. */
2260 integer_minus_onep (const_tree expr
)
2264 if (TREE_CODE (expr
) == COMPLEX_CST
)
2265 return (integer_all_onesp (TREE_REALPART (expr
))
2266 && integer_zerop (TREE_IMAGPART (expr
)));
2268 return integer_all_onesp (expr
);
2271 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
2275 integer_pow2p (const_tree expr
)
2279 if (TREE_CODE (expr
) == COMPLEX_CST
2280 && integer_pow2p (TREE_REALPART (expr
))
2281 && integer_zerop (TREE_IMAGPART (expr
)))
2284 if (TREE_CODE (expr
) != INTEGER_CST
)
2287 return wi::popcount (expr
) == 1;
2290 /* Return 1 if EXPR is an integer constant other than zero or a
2291 complex constant other than zero. */
2294 integer_nonzerop (const_tree expr
)
2298 return ((TREE_CODE (expr
) == INTEGER_CST
2299 && !wi::eq_p (expr
, 0))
2300 || (TREE_CODE (expr
) == COMPLEX_CST
2301 && (integer_nonzerop (TREE_REALPART (expr
))
2302 || integer_nonzerop (TREE_IMAGPART (expr
)))));
2305 /* Return 1 if EXPR is the fixed-point constant zero. */
2308 fixed_zerop (const_tree expr
)
2310 return (TREE_CODE (expr
) == FIXED_CST
2311 && TREE_FIXED_CST (expr
).data
.is_zero ());
2314 /* Return the power of two represented by a tree node known to be a
2318 tree_log2 (const_tree expr
)
2322 if (TREE_CODE (expr
) == COMPLEX_CST
)
2323 return tree_log2 (TREE_REALPART (expr
));
2325 return wi::exact_log2 (expr
);
2328 /* Similar, but return the largest integer Y such that 2 ** Y is less
2329 than or equal to EXPR. */
2332 tree_floor_log2 (const_tree expr
)
2336 if (TREE_CODE (expr
) == COMPLEX_CST
)
2337 return tree_log2 (TREE_REALPART (expr
));
2339 return wi::floor_log2 (expr
);
2342 /* Return number of known trailing zero bits in EXPR, or, if the value of
2343 EXPR is known to be zero, the precision of it's type. */
2346 tree_ctz (const_tree expr
)
2348 if (!INTEGRAL_TYPE_P (TREE_TYPE (expr
))
2349 && !POINTER_TYPE_P (TREE_TYPE (expr
)))
2352 unsigned int ret1
, ret2
, prec
= TYPE_PRECISION (TREE_TYPE (expr
));
2353 switch (TREE_CODE (expr
))
2356 ret1
= wi::ctz (expr
);
2357 return MIN (ret1
, prec
);
2359 ret1
= wi::ctz (get_nonzero_bits (expr
));
2360 return MIN (ret1
, prec
);
2367 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2370 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2371 return MIN (ret1
, ret2
);
2372 case POINTER_PLUS_EXPR
:
2373 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2374 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2375 /* Second operand is sizetype, which could be in theory
2376 wider than pointer's precision. Make sure we never
2377 return more than prec. */
2378 ret2
= MIN (ret2
, prec
);
2379 return MIN (ret1
, ret2
);
2381 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2382 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2383 return MAX (ret1
, ret2
);
2385 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2386 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2387 return MIN (ret1
+ ret2
, prec
);
2389 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2390 if (tree_fits_uhwi_p (TREE_OPERAND (expr
, 1))
2391 && (tree_to_uhwi (TREE_OPERAND (expr
, 1)) < prec
))
2393 ret2
= tree_to_uhwi (TREE_OPERAND (expr
, 1));
2394 return MIN (ret1
+ ret2
, prec
);
2398 if (tree_fits_uhwi_p (TREE_OPERAND (expr
, 1))
2399 && (tree_to_uhwi (TREE_OPERAND (expr
, 1)) < prec
))
2401 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2402 ret2
= tree_to_uhwi (TREE_OPERAND (expr
, 1));
2407 case TRUNC_DIV_EXPR
:
2409 case FLOOR_DIV_EXPR
:
2410 case ROUND_DIV_EXPR
:
2411 case EXACT_DIV_EXPR
:
2412 if (TREE_CODE (TREE_OPERAND (expr
, 1)) == INTEGER_CST
2413 && tree_int_cst_sgn (TREE_OPERAND (expr
, 1)) == 1)
2415 int l
= tree_log2 (TREE_OPERAND (expr
, 1));
2418 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2426 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2427 if (ret1
&& ret1
== TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (expr
, 0))))
2429 return MIN (ret1
, prec
);
2431 return tree_ctz (TREE_OPERAND (expr
, 0));
2433 ret1
= tree_ctz (TREE_OPERAND (expr
, 1));
2436 ret2
= tree_ctz (TREE_OPERAND (expr
, 2));
2437 return MIN (ret1
, ret2
);
2439 return tree_ctz (TREE_OPERAND (expr
, 1));
2441 ret1
= get_pointer_alignment (CONST_CAST_TREE (expr
));
2442 if (ret1
> BITS_PER_UNIT
)
2444 ret1
= ctz_hwi (ret1
/ BITS_PER_UNIT
);
2445 return MIN (ret1
, prec
);
2453 /* Return 1 if EXPR is the real constant zero. Trailing zeroes matter for
2454 decimal float constants, so don't return 1 for them. */
2457 real_zerop (const_tree expr
)
2461 switch (TREE_CODE (expr
))
2464 return REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst0
)
2465 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2467 return real_zerop (TREE_REALPART (expr
))
2468 && real_zerop (TREE_IMAGPART (expr
));
2472 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2473 if (!real_zerop (VECTOR_CST_ELT (expr
, i
)))
2482 /* Return 1 if EXPR is the real constant one in real or complex form.
2483 Trailing zeroes matter for decimal float constants, so don't return
2487 real_onep (const_tree expr
)
2491 switch (TREE_CODE (expr
))
2494 return REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst1
)
2495 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2497 return real_onep (TREE_REALPART (expr
))
2498 && real_zerop (TREE_IMAGPART (expr
));
2502 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2503 if (!real_onep (VECTOR_CST_ELT (expr
, i
)))
2512 /* Return 1 if EXPR is the real constant minus one. Trailing zeroes
2513 matter for decimal float constants, so don't return 1 for them. */
2516 real_minus_onep (const_tree expr
)
2520 switch (TREE_CODE (expr
))
2523 return REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconstm1
)
2524 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2526 return real_minus_onep (TREE_REALPART (expr
))
2527 && real_zerop (TREE_IMAGPART (expr
));
2531 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2532 if (!real_minus_onep (VECTOR_CST_ELT (expr
, i
)))
2541 /* Nonzero if EXP is a constant or a cast of a constant. */
2544 really_constant_p (const_tree exp
)
2546 /* This is not quite the same as STRIP_NOPS. It does more. */
2547 while (CONVERT_EXPR_P (exp
)
2548 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
2549 exp
= TREE_OPERAND (exp
, 0);
2550 return TREE_CONSTANT (exp
);
2553 /* Return first list element whose TREE_VALUE is ELEM.
2554 Return 0 if ELEM is not in LIST. */
2557 value_member (tree elem
, tree list
)
2561 if (elem
== TREE_VALUE (list
))
2563 list
= TREE_CHAIN (list
);
2568 /* Return first list element whose TREE_PURPOSE is ELEM.
2569 Return 0 if ELEM is not in LIST. */
2572 purpose_member (const_tree elem
, tree list
)
2576 if (elem
== TREE_PURPOSE (list
))
2578 list
= TREE_CHAIN (list
);
2583 /* Return true if ELEM is in V. */
2586 vec_member (const_tree elem
, vec
<tree
, va_gc
> *v
)
2590 FOR_EACH_VEC_SAFE_ELT (v
, ix
, t
)
2596 /* Returns element number IDX (zero-origin) of chain CHAIN, or
2600 chain_index (int idx
, tree chain
)
2602 for (; chain
&& idx
> 0; --idx
)
2603 chain
= TREE_CHAIN (chain
);
2607 /* Return nonzero if ELEM is part of the chain CHAIN. */
2610 chain_member (const_tree elem
, const_tree chain
)
2616 chain
= DECL_CHAIN (chain
);
2622 /* Return the length of a chain of nodes chained through TREE_CHAIN.
2623 We expect a null pointer to mark the end of the chain.
2624 This is the Lisp primitive `length'. */
2627 list_length (const_tree t
)
2630 #ifdef ENABLE_TREE_CHECKING
2638 #ifdef ENABLE_TREE_CHECKING
2641 gcc_assert (p
!= q
);
2649 /* Returns the first FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
2650 UNION_TYPE TYPE, or NULL_TREE if none. */
2653 first_field (const_tree type
)
2655 tree t
= TYPE_FIELDS (type
);
2656 while (t
&& TREE_CODE (t
) != FIELD_DECL
)
2661 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
2662 by modifying the last node in chain 1 to point to chain 2.
2663 This is the Lisp primitive `nconc'. */
2666 chainon (tree op1
, tree op2
)
2675 for (t1
= op1
; TREE_CHAIN (t1
); t1
= TREE_CHAIN (t1
))
2677 TREE_CHAIN (t1
) = op2
;
2679 #ifdef ENABLE_TREE_CHECKING
2682 for (t2
= op2
; t2
; t2
= TREE_CHAIN (t2
))
2683 gcc_assert (t2
!= t1
);
2690 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
2693 tree_last (tree chain
)
2697 while ((next
= TREE_CHAIN (chain
)))
2702 /* Reverse the order of elements in the chain T,
2703 and return the new head of the chain (old last element). */
2708 tree prev
= 0, decl
, next
;
2709 for (decl
= t
; decl
; decl
= next
)
2711 /* We shouldn't be using this function to reverse BLOCK chains; we
2712 have blocks_nreverse for that. */
2713 gcc_checking_assert (TREE_CODE (decl
) != BLOCK
);
2714 next
= TREE_CHAIN (decl
);
2715 TREE_CHAIN (decl
) = prev
;
2721 /* Return a newly created TREE_LIST node whose
2722 purpose and value fields are PARM and VALUE. */
2725 build_tree_list_stat (tree parm
, tree value MEM_STAT_DECL
)
2727 tree t
= make_node_stat (TREE_LIST PASS_MEM_STAT
);
2728 TREE_PURPOSE (t
) = parm
;
2729 TREE_VALUE (t
) = value
;
2733 /* Build a chain of TREE_LIST nodes from a vector. */
2736 build_tree_list_vec_stat (const vec
<tree
, va_gc
> *vec MEM_STAT_DECL
)
2738 tree ret
= NULL_TREE
;
2742 FOR_EACH_VEC_SAFE_ELT (vec
, i
, t
)
2744 *pp
= build_tree_list_stat (NULL
, t PASS_MEM_STAT
);
2745 pp
= &TREE_CHAIN (*pp
);
2750 /* Return a newly created TREE_LIST node whose
2751 purpose and value fields are PURPOSE and VALUE
2752 and whose TREE_CHAIN is CHAIN. */
2755 tree_cons_stat (tree purpose
, tree value
, tree chain MEM_STAT_DECL
)
2759 node
= ggc_alloc_tree_node_stat (sizeof (struct tree_list
) PASS_MEM_STAT
);
2760 memset (node
, 0, sizeof (struct tree_common
));
2762 record_node_allocation_statistics (TREE_LIST
, sizeof (struct tree_list
));
2764 TREE_SET_CODE (node
, TREE_LIST
);
2765 TREE_CHAIN (node
) = chain
;
2766 TREE_PURPOSE (node
) = purpose
;
2767 TREE_VALUE (node
) = value
;
2771 /* Return the values of the elements of a CONSTRUCTOR as a vector of
2775 ctor_to_vec (tree ctor
)
2777 vec
<tree
, va_gc
> *vec
;
2778 vec_alloc (vec
, CONSTRUCTOR_NELTS (ctor
));
2782 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), ix
, val
)
2783 vec
->quick_push (val
);
2788 /* Return the size nominally occupied by an object of type TYPE
2789 when it resides in memory. The value is measured in units of bytes,
2790 and its data type is that normally used for type sizes
2791 (which is the first type created by make_signed_type or
2792 make_unsigned_type). */
2795 size_in_bytes (const_tree type
)
2799 if (type
== error_mark_node
)
2800 return integer_zero_node
;
2802 type
= TYPE_MAIN_VARIANT (type
);
2803 t
= TYPE_SIZE_UNIT (type
);
2807 lang_hooks
.types
.incomplete_type_error (NULL_TREE
, type
);
2808 return size_zero_node
;
2814 /* Return the size of TYPE (in bytes) as a wide integer
2815 or return -1 if the size can vary or is larger than an integer. */
2818 int_size_in_bytes (const_tree type
)
2822 if (type
== error_mark_node
)
2825 type
= TYPE_MAIN_VARIANT (type
);
2826 t
= TYPE_SIZE_UNIT (type
);
2828 if (t
&& tree_fits_uhwi_p (t
))
2829 return TREE_INT_CST_LOW (t
);
2834 /* Return the maximum size of TYPE (in bytes) as a wide integer
2835 or return -1 if the size can vary or is larger than an integer. */
2838 max_int_size_in_bytes (const_tree type
)
2840 HOST_WIDE_INT size
= -1;
2843 /* If this is an array type, check for a possible MAX_SIZE attached. */
2845 if (TREE_CODE (type
) == ARRAY_TYPE
)
2847 size_tree
= TYPE_ARRAY_MAX_SIZE (type
);
2849 if (size_tree
&& tree_fits_uhwi_p (size_tree
))
2850 size
= tree_to_uhwi (size_tree
);
2853 /* If we still haven't been able to get a size, see if the language
2854 can compute a maximum size. */
2858 size_tree
= lang_hooks
.types
.max_size (type
);
2860 if (size_tree
&& tree_fits_uhwi_p (size_tree
))
2861 size
= tree_to_uhwi (size_tree
);
2867 /* Return the bit position of FIELD, in bits from the start of the record.
2868 This is a tree of type bitsizetype. */
2871 bit_position (const_tree field
)
2873 return bit_from_pos (DECL_FIELD_OFFSET (field
),
2874 DECL_FIELD_BIT_OFFSET (field
));
2877 /* Return the byte position of FIELD, in bytes from the start of the record.
2878 This is a tree of type sizetype. */
2881 byte_position (const_tree field
)
2883 return byte_from_pos (DECL_FIELD_OFFSET (field
),
2884 DECL_FIELD_BIT_OFFSET (field
));
2887 /* Likewise, but return as an integer. It must be representable in
2888 that way (since it could be a signed value, we don't have the
2889 option of returning -1 like int_size_in_byte can. */
2892 int_byte_position (const_tree field
)
2894 return tree_to_shwi (byte_position (field
));
2897 /* Return the strictest alignment, in bits, that T is known to have. */
2900 expr_align (const_tree t
)
2902 unsigned int align0
, align1
;
2904 switch (TREE_CODE (t
))
2906 CASE_CONVERT
: case NON_LVALUE_EXPR
:
2907 /* If we have conversions, we know that the alignment of the
2908 object must meet each of the alignments of the types. */
2909 align0
= expr_align (TREE_OPERAND (t
, 0));
2910 align1
= TYPE_ALIGN (TREE_TYPE (t
));
2911 return MAX (align0
, align1
);
2913 case SAVE_EXPR
: case COMPOUND_EXPR
: case MODIFY_EXPR
:
2914 case INIT_EXPR
: case TARGET_EXPR
: case WITH_CLEANUP_EXPR
:
2915 case CLEANUP_POINT_EXPR
:
2916 /* These don't change the alignment of an object. */
2917 return expr_align (TREE_OPERAND (t
, 0));
2920 /* The best we can do is say that the alignment is the least aligned
2922 align0
= expr_align (TREE_OPERAND (t
, 1));
2923 align1
= expr_align (TREE_OPERAND (t
, 2));
2924 return MIN (align0
, align1
);
2926 /* FIXME: LABEL_DECL and CONST_DECL never have DECL_ALIGN set
2927 meaningfully, it's always 1. */
2928 case LABEL_DECL
: case CONST_DECL
:
2929 case VAR_DECL
: case PARM_DECL
: case RESULT_DECL
:
2931 gcc_assert (DECL_ALIGN (t
) != 0);
2932 return DECL_ALIGN (t
);
2938 /* Otherwise take the alignment from that of the type. */
2939 return TYPE_ALIGN (TREE_TYPE (t
));
2942 /* Return, as a tree node, the number of elements for TYPE (which is an
2943 ARRAY_TYPE) minus one. This counts only elements of the top array. */
2946 array_type_nelts (const_tree type
)
2948 tree index_type
, min
, max
;
2950 /* If they did it with unspecified bounds, then we should have already
2951 given an error about it before we got here. */
2952 if (! TYPE_DOMAIN (type
))
2953 return error_mark_node
;
2955 index_type
= TYPE_DOMAIN (type
);
2956 min
= TYPE_MIN_VALUE (index_type
);
2957 max
= TYPE_MAX_VALUE (index_type
);
2959 /* TYPE_MAX_VALUE may not be set if the array has unknown length. */
2961 return error_mark_node
;
2963 return (integer_zerop (min
)
2965 : fold_build2 (MINUS_EXPR
, TREE_TYPE (max
), max
, min
));
2968 /* If arg is static -- a reference to an object in static storage -- then
2969 return the object. This is not the same as the C meaning of `static'.
2970 If arg isn't static, return NULL. */
2975 switch (TREE_CODE (arg
))
2978 /* Nested functions are static, even though taking their address will
2979 involve a trampoline as we unnest the nested function and create
2980 the trampoline on the tree level. */
2984 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
2985 && ! DECL_THREAD_LOCAL_P (arg
)
2986 && ! DECL_DLLIMPORT_P (arg
)
2990 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
2994 return TREE_STATIC (arg
) ? arg
: NULL
;
3001 /* If the thing being referenced is not a field, then it is
3002 something language specific. */
3003 gcc_assert (TREE_CODE (TREE_OPERAND (arg
, 1)) == FIELD_DECL
);
3005 /* If we are referencing a bitfield, we can't evaluate an
3006 ADDR_EXPR at compile time and so it isn't a constant. */
3007 if (DECL_BIT_FIELD (TREE_OPERAND (arg
, 1)))
3010 return staticp (TREE_OPERAND (arg
, 0));
3016 return TREE_CONSTANT (TREE_OPERAND (arg
, 0)) ? arg
: NULL
;
3019 case ARRAY_RANGE_REF
:
3020 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg
))) == INTEGER_CST
3021 && TREE_CODE (TREE_OPERAND (arg
, 1)) == INTEGER_CST
)
3022 return staticp (TREE_OPERAND (arg
, 0));
3026 case COMPOUND_LITERAL_EXPR
:
3027 return TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (arg
)) ? arg
: NULL
;
3037 /* Return whether OP is a DECL whose address is function-invariant. */
3040 decl_address_invariant_p (const_tree op
)
3042 /* The conditions below are slightly less strict than the one in
3045 switch (TREE_CODE (op
))
3054 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
3055 || DECL_THREAD_LOCAL_P (op
)
3056 || DECL_CONTEXT (op
) == current_function_decl
3057 || decl_function_context (op
) == current_function_decl
)
3062 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
3063 || decl_function_context (op
) == current_function_decl
)
3074 /* Return whether OP is a DECL whose address is interprocedural-invariant. */
3077 decl_address_ip_invariant_p (const_tree op
)
3079 /* The conditions below are slightly less strict than the one in
3082 switch (TREE_CODE (op
))
3090 if (((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
3091 && !DECL_DLLIMPORT_P (op
))
3092 || DECL_THREAD_LOCAL_P (op
))
3097 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
)))
3109 /* Return true if T is function-invariant (internal function, does
3110 not handle arithmetic; that's handled in skip_simple_arithmetic and
3111 tree_invariant_p). */
3113 static bool tree_invariant_p (tree t
);
3116 tree_invariant_p_1 (tree t
)
3120 if (TREE_CONSTANT (t
)
3121 || (TREE_READONLY (t
) && !TREE_SIDE_EFFECTS (t
)))
3124 switch (TREE_CODE (t
))
3130 op
= TREE_OPERAND (t
, 0);
3131 while (handled_component_p (op
))
3133 switch (TREE_CODE (op
))
3136 case ARRAY_RANGE_REF
:
3137 if (!tree_invariant_p (TREE_OPERAND (op
, 1))
3138 || TREE_OPERAND (op
, 2) != NULL_TREE
3139 || TREE_OPERAND (op
, 3) != NULL_TREE
)
3144 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
3150 op
= TREE_OPERAND (op
, 0);
3153 return CONSTANT_CLASS_P (op
) || decl_address_invariant_p (op
);
3162 /* Return true if T is function-invariant. */
3165 tree_invariant_p (tree t
)
3167 tree inner
= skip_simple_arithmetic (t
);
3168 return tree_invariant_p_1 (inner
);
3171 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
3172 Do this to any expression which may be used in more than one place,
3173 but must be evaluated only once.
3175 Normally, expand_expr would reevaluate the expression each time.
3176 Calling save_expr produces something that is evaluated and recorded
3177 the first time expand_expr is called on it. Subsequent calls to
3178 expand_expr just reuse the recorded value.
3180 The call to expand_expr that generates code that actually computes
3181 the value is the first call *at compile time*. Subsequent calls
3182 *at compile time* generate code to use the saved value.
3183 This produces correct result provided that *at run time* control
3184 always flows through the insns made by the first expand_expr
3185 before reaching the other places where the save_expr was evaluated.
3186 You, the caller of save_expr, must make sure this is so.
3188 Constants, and certain read-only nodes, are returned with no
3189 SAVE_EXPR because that is safe. Expressions containing placeholders
3190 are not touched; see tree.def for an explanation of what these
3194 save_expr (tree expr
)
3196 tree t
= fold (expr
);
3199 /* If the tree evaluates to a constant, then we don't want to hide that
3200 fact (i.e. this allows further folding, and direct checks for constants).
3201 However, a read-only object that has side effects cannot be bypassed.
3202 Since it is no problem to reevaluate literals, we just return the
3204 inner
= skip_simple_arithmetic (t
);
3205 if (TREE_CODE (inner
) == ERROR_MARK
)
3208 if (tree_invariant_p_1 (inner
))
3211 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
3212 it means that the size or offset of some field of an object depends on
3213 the value within another field.
3215 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
3216 and some variable since it would then need to be both evaluated once and
3217 evaluated more than once. Front-ends must assure this case cannot
3218 happen by surrounding any such subexpressions in their own SAVE_EXPR
3219 and forcing evaluation at the proper time. */
3220 if (contains_placeholder_p (inner
))
3223 t
= build1 (SAVE_EXPR
, TREE_TYPE (expr
), t
);
3224 SET_EXPR_LOCATION (t
, EXPR_LOCATION (expr
));
3226 /* This expression might be placed ahead of a jump to ensure that the
3227 value was computed on both sides of the jump. So make sure it isn't
3228 eliminated as dead. */
3229 TREE_SIDE_EFFECTS (t
) = 1;
3233 /* Look inside EXPR into any simple arithmetic operations. Return the
3234 outermost non-arithmetic or non-invariant node. */
3237 skip_simple_arithmetic (tree expr
)
3239 /* We don't care about whether this can be used as an lvalue in this
3241 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
3242 expr
= TREE_OPERAND (expr
, 0);
3244 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
3245 a constant, it will be more efficient to not make another SAVE_EXPR since
3246 it will allow better simplification and GCSE will be able to merge the
3247 computations if they actually occur. */
3250 if (UNARY_CLASS_P (expr
))
3251 expr
= TREE_OPERAND (expr
, 0);
3252 else if (BINARY_CLASS_P (expr
))
3254 if (tree_invariant_p (TREE_OPERAND (expr
, 1)))
3255 expr
= TREE_OPERAND (expr
, 0);
3256 else if (tree_invariant_p (TREE_OPERAND (expr
, 0)))
3257 expr
= TREE_OPERAND (expr
, 1);
3268 /* Look inside EXPR into simple arithmetic operations involving constants.
3269 Return the outermost non-arithmetic or non-constant node. */
3272 skip_simple_constant_arithmetic (tree expr
)
3274 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
3275 expr
= TREE_OPERAND (expr
, 0);
3279 if (UNARY_CLASS_P (expr
))
3280 expr
= TREE_OPERAND (expr
, 0);
3281 else if (BINARY_CLASS_P (expr
))
3283 if (TREE_CONSTANT (TREE_OPERAND (expr
, 1)))
3284 expr
= TREE_OPERAND (expr
, 0);
3285 else if (TREE_CONSTANT (TREE_OPERAND (expr
, 0)))
3286 expr
= TREE_OPERAND (expr
, 1);
3297 /* Return which tree structure is used by T. */
3299 enum tree_node_structure_enum
3300 tree_node_structure (const_tree t
)
3302 const enum tree_code code
= TREE_CODE (t
);
3303 return tree_node_structure_for_code (code
);
3306 /* Set various status flags when building a CALL_EXPR object T. */
3309 process_call_operands (tree t
)
3311 bool side_effects
= TREE_SIDE_EFFECTS (t
);
3312 bool read_only
= false;
3313 int i
= call_expr_flags (t
);
3315 /* Calls have side-effects, except those to const or pure functions. */
3316 if ((i
& ECF_LOOPING_CONST_OR_PURE
) || !(i
& (ECF_CONST
| ECF_PURE
)))
3317 side_effects
= true;
3318 /* Propagate TREE_READONLY of arguments for const functions. */
3322 if (!side_effects
|| read_only
)
3323 for (i
= 1; i
< TREE_OPERAND_LENGTH (t
); i
++)
3325 tree op
= TREE_OPERAND (t
, i
);
3326 if (op
&& TREE_SIDE_EFFECTS (op
))
3327 side_effects
= true;
3328 if (op
&& !TREE_READONLY (op
) && !CONSTANT_CLASS_P (op
))
3332 TREE_SIDE_EFFECTS (t
) = side_effects
;
3333 TREE_READONLY (t
) = read_only
;
3336 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
3337 size or offset that depends on a field within a record. */
3340 contains_placeholder_p (const_tree exp
)
3342 enum tree_code code
;
3347 code
= TREE_CODE (exp
);
3348 if (code
== PLACEHOLDER_EXPR
)
3351 switch (TREE_CODE_CLASS (code
))
3354 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
3355 position computations since they will be converted into a
3356 WITH_RECORD_EXPR involving the reference, which will assume
3357 here will be valid. */
3358 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
3360 case tcc_exceptional
:
3361 if (code
== TREE_LIST
)
3362 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp
))
3363 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp
)));
3368 case tcc_comparison
:
3369 case tcc_expression
:
3373 /* Ignoring the first operand isn't quite right, but works best. */
3374 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1));
3377 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
3378 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1))
3379 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 2)));
3382 /* The save_expr function never wraps anything containing
3383 a PLACEHOLDER_EXPR. */
3390 switch (TREE_CODE_LENGTH (code
))
3393 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
3395 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
3396 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1)));
3407 const_call_expr_arg_iterator iter
;
3408 FOR_EACH_CONST_CALL_EXPR_ARG (arg
, iter
, exp
)
3409 if (CONTAINS_PLACEHOLDER_P (arg
))
3423 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
3424 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
3428 type_contains_placeholder_1 (const_tree type
)
3430 /* If the size contains a placeholder or the parent type (component type in
3431 the case of arrays) type involves a placeholder, this type does. */
3432 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type
))
3433 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type
))
3434 || (!POINTER_TYPE_P (type
)
3436 && type_contains_placeholder_p (TREE_TYPE (type
))))
3439 /* Now do type-specific checks. Note that the last part of the check above
3440 greatly limits what we have to do below. */
3441 switch (TREE_CODE (type
))
3449 case REFERENCE_TYPE
:
3458 case FIXED_POINT_TYPE
:
3459 /* Here we just check the bounds. */
3460 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type
))
3461 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type
)));
3464 /* We have already checked the component type above, so just check the
3466 return type_contains_placeholder_p (TYPE_DOMAIN (type
));
3470 case QUAL_UNION_TYPE
:
3474 for (field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
3475 if (TREE_CODE (field
) == FIELD_DECL
3476 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field
))
3477 || (TREE_CODE (type
) == QUAL_UNION_TYPE
3478 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field
)))
3479 || type_contains_placeholder_p (TREE_TYPE (field
))))
3490 /* Wrapper around above function used to cache its result. */
3493 type_contains_placeholder_p (tree type
)
3497 /* If the contains_placeholder_bits field has been initialized,
3498 then we know the answer. */
3499 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) > 0)
3500 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) - 1;
3502 /* Indicate that we've seen this type node, and the answer is false.
3503 This is what we want to return if we run into recursion via fields. */
3504 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = 1;
3506 /* Compute the real value. */
3507 result
= type_contains_placeholder_1 (type
);
3509 /* Store the real value. */
3510 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = result
+ 1;
3515 /* Push tree EXP onto vector QUEUE if it is not already present. */
3518 push_without_duplicates (tree exp
, vec
<tree
> *queue
)
3523 FOR_EACH_VEC_ELT (*queue
, i
, iter
)
3524 if (simple_cst_equal (iter
, exp
) == 1)
3528 queue
->safe_push (exp
);
3531 /* Given a tree EXP, find all occurrences of references to fields
3532 in a PLACEHOLDER_EXPR and place them in vector REFS without
3533 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
3534 we assume here that EXP contains only arithmetic expressions
3535 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
3539 find_placeholder_in_expr (tree exp
, vec
<tree
> *refs
)
3541 enum tree_code code
= TREE_CODE (exp
);
3545 /* We handle TREE_LIST and COMPONENT_REF separately. */
3546 if (code
== TREE_LIST
)
3548 FIND_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), refs
);
3549 FIND_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), refs
);
3551 else if (code
== COMPONENT_REF
)
3553 for (inner
= TREE_OPERAND (exp
, 0);
3554 REFERENCE_CLASS_P (inner
);
3555 inner
= TREE_OPERAND (inner
, 0))
3558 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
)
3559 push_without_duplicates (exp
, refs
);
3561 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), refs
);
3564 switch (TREE_CODE_CLASS (code
))
3569 case tcc_declaration
:
3570 /* Variables allocated to static storage can stay. */
3571 if (!TREE_STATIC (exp
))
3572 push_without_duplicates (exp
, refs
);
3575 case tcc_expression
:
3576 /* This is the pattern built in ada/make_aligning_type. */
3577 if (code
== ADDR_EXPR
3578 && TREE_CODE (TREE_OPERAND (exp
, 0)) == PLACEHOLDER_EXPR
)
3580 push_without_duplicates (exp
, refs
);
3584 /* Fall through... */
3586 case tcc_exceptional
:
3589 case tcc_comparison
:
3591 for (i
= 0; i
< TREE_CODE_LENGTH (code
); i
++)
3592 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
3596 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3597 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
3605 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
3606 return a tree with all occurrences of references to F in a
3607 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
3608 CONST_DECLs. Note that we assume here that EXP contains only
3609 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
3610 occurring only in their argument list. */
3613 substitute_in_expr (tree exp
, tree f
, tree r
)
3615 enum tree_code code
= TREE_CODE (exp
);
3616 tree op0
, op1
, op2
, op3
;
3619 /* We handle TREE_LIST and COMPONENT_REF separately. */
3620 if (code
== TREE_LIST
)
3622 op0
= SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp
), f
, r
);
3623 op1
= SUBSTITUTE_IN_EXPR (TREE_VALUE (exp
), f
, r
);
3624 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
3627 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
3629 else if (code
== COMPONENT_REF
)
3633 /* If this expression is getting a value from a PLACEHOLDER_EXPR
3634 and it is the right field, replace it with R. */
3635 for (inner
= TREE_OPERAND (exp
, 0);
3636 REFERENCE_CLASS_P (inner
);
3637 inner
= TREE_OPERAND (inner
, 0))
3641 op1
= TREE_OPERAND (exp
, 1);
3643 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& op1
== f
)
3646 /* If this expression hasn't been completed let, leave it alone. */
3647 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& !TREE_TYPE (inner
))
3650 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3651 if (op0
== TREE_OPERAND (exp
, 0))
3655 = fold_build3 (COMPONENT_REF
, TREE_TYPE (exp
), op0
, op1
, NULL_TREE
);
3658 switch (TREE_CODE_CLASS (code
))
3663 case tcc_declaration
:
3669 case tcc_expression
:
3673 /* Fall through... */
3675 case tcc_exceptional
:
3678 case tcc_comparison
:
3680 switch (TREE_CODE_LENGTH (code
))
3686 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3687 if (op0
== TREE_OPERAND (exp
, 0))
3690 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
3694 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3695 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3697 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
3700 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
3704 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3705 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3706 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
3708 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3709 && op2
== TREE_OPERAND (exp
, 2))
3712 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
3716 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3717 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3718 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
3719 op3
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 3), f
, r
);
3721 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3722 && op2
== TREE_OPERAND (exp
, 2)
3723 && op3
== TREE_OPERAND (exp
, 3))
3727 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
3739 new_tree
= NULL_TREE
;
3741 /* If we are trying to replace F with a constant, inline back
3742 functions which do nothing else than computing a value from
3743 the arguments they are passed. This makes it possible to
3744 fold partially or entirely the replacement expression. */
3745 if (CONSTANT_CLASS_P (r
) && code
== CALL_EXPR
)
3747 tree t
= maybe_inline_call_in_expr (exp
);
3749 return SUBSTITUTE_IN_EXPR (t
, f
, r
);
3752 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3754 tree op
= TREE_OPERAND (exp
, i
);
3755 tree new_op
= SUBSTITUTE_IN_EXPR (op
, f
, r
);
3759 new_tree
= copy_node (exp
);
3760 TREE_OPERAND (new_tree
, i
) = new_op
;
3766 new_tree
= fold (new_tree
);
3767 if (TREE_CODE (new_tree
) == CALL_EXPR
)
3768 process_call_operands (new_tree
);
3779 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
3781 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
3782 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
3787 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
3788 for it within OBJ, a tree that is an object or a chain of references. */
3791 substitute_placeholder_in_expr (tree exp
, tree obj
)
3793 enum tree_code code
= TREE_CODE (exp
);
3794 tree op0
, op1
, op2
, op3
;
3797 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
3798 in the chain of OBJ. */
3799 if (code
== PLACEHOLDER_EXPR
)
3801 tree need_type
= TYPE_MAIN_VARIANT (TREE_TYPE (exp
));
3804 for (elt
= obj
; elt
!= 0;
3805 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
3806 || TREE_CODE (elt
) == COND_EXPR
)
3807 ? TREE_OPERAND (elt
, 1)
3808 : (REFERENCE_CLASS_P (elt
)
3809 || UNARY_CLASS_P (elt
)
3810 || BINARY_CLASS_P (elt
)
3811 || VL_EXP_CLASS_P (elt
)
3812 || EXPRESSION_CLASS_P (elt
))
3813 ? TREE_OPERAND (elt
, 0) : 0))
3814 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt
)) == need_type
)
3817 for (elt
= obj
; elt
!= 0;
3818 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
3819 || TREE_CODE (elt
) == COND_EXPR
)
3820 ? TREE_OPERAND (elt
, 1)
3821 : (REFERENCE_CLASS_P (elt
)
3822 || UNARY_CLASS_P (elt
)
3823 || BINARY_CLASS_P (elt
)
3824 || VL_EXP_CLASS_P (elt
)
3825 || EXPRESSION_CLASS_P (elt
))
3826 ? TREE_OPERAND (elt
, 0) : 0))
3827 if (POINTER_TYPE_P (TREE_TYPE (elt
))
3828 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt
)))
3830 return fold_build1 (INDIRECT_REF
, need_type
, elt
);
3832 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
3833 survives until RTL generation, there will be an error. */
3837 /* TREE_LIST is special because we need to look at TREE_VALUE
3838 and TREE_CHAIN, not TREE_OPERANDS. */
3839 else if (code
== TREE_LIST
)
3841 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), obj
);
3842 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), obj
);
3843 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
3846 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
3849 switch (TREE_CODE_CLASS (code
))
3852 case tcc_declaration
:
3855 case tcc_exceptional
:
3858 case tcc_comparison
:
3859 case tcc_expression
:
3862 switch (TREE_CODE_LENGTH (code
))
3868 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3869 if (op0
== TREE_OPERAND (exp
, 0))
3872 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
3876 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3877 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
3879 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
3882 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
3886 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3887 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
3888 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
3890 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3891 && op2
== TREE_OPERAND (exp
, 2))
3894 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
3898 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3899 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
3900 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
3901 op3
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 3), obj
);
3903 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3904 && op2
== TREE_OPERAND (exp
, 2)
3905 && op3
== TREE_OPERAND (exp
, 3))
3909 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
3921 new_tree
= NULL_TREE
;
3923 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3925 tree op
= TREE_OPERAND (exp
, i
);
3926 tree new_op
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (op
, obj
);
3930 new_tree
= copy_node (exp
);
3931 TREE_OPERAND (new_tree
, i
) = new_op
;
3937 new_tree
= fold (new_tree
);
3938 if (TREE_CODE (new_tree
) == CALL_EXPR
)
3939 process_call_operands (new_tree
);
3950 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
3952 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
3953 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
3959 /* Subroutine of stabilize_reference; this is called for subtrees of
3960 references. Any expression with side-effects must be put in a SAVE_EXPR
3961 to ensure that it is only evaluated once.
3963 We don't put SAVE_EXPR nodes around everything, because assigning very
3964 simple expressions to temporaries causes us to miss good opportunities
3965 for optimizations. Among other things, the opportunity to fold in the
3966 addition of a constant into an addressing mode often gets lost, e.g.
3967 "y[i+1] += x;". In general, we take the approach that we should not make
3968 an assignment unless we are forced into it - i.e., that any non-side effect
3969 operator should be allowed, and that cse should take care of coalescing
3970 multiple utterances of the same expression should that prove fruitful. */
3973 stabilize_reference_1 (tree e
)
3976 enum tree_code code
= TREE_CODE (e
);
3978 /* We cannot ignore const expressions because it might be a reference
3979 to a const array but whose index contains side-effects. But we can
3980 ignore things that are actual constant or that already have been
3981 handled by this function. */
3983 if (tree_invariant_p (e
))
3986 switch (TREE_CODE_CLASS (code
))
3988 case tcc_exceptional
:
3990 case tcc_declaration
:
3991 case tcc_comparison
:
3993 case tcc_expression
:
3996 /* If the expression has side-effects, then encase it in a SAVE_EXPR
3997 so that it will only be evaluated once. */
3998 /* The reference (r) and comparison (<) classes could be handled as
3999 below, but it is generally faster to only evaluate them once. */
4000 if (TREE_SIDE_EFFECTS (e
))
4001 return save_expr (e
);
4005 /* Constants need no processing. In fact, we should never reach
4010 /* Division is slow and tends to be compiled with jumps,
4011 especially the division by powers of 2 that is often
4012 found inside of an array reference. So do it just once. */
4013 if (code
== TRUNC_DIV_EXPR
|| code
== TRUNC_MOD_EXPR
4014 || code
== FLOOR_DIV_EXPR
|| code
== FLOOR_MOD_EXPR
4015 || code
== CEIL_DIV_EXPR
|| code
== CEIL_MOD_EXPR
4016 || code
== ROUND_DIV_EXPR
|| code
== ROUND_MOD_EXPR
)
4017 return save_expr (e
);
4018 /* Recursively stabilize each operand. */
4019 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)),
4020 stabilize_reference_1 (TREE_OPERAND (e
, 1)));
4024 /* Recursively stabilize each operand. */
4025 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)));
4032 TREE_TYPE (result
) = TREE_TYPE (e
);
4033 TREE_READONLY (result
) = TREE_READONLY (e
);
4034 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (e
);
4035 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (e
);
4040 /* Stabilize a reference so that we can use it any number of times
4041 without causing its operands to be evaluated more than once.
4042 Returns the stabilized reference. This works by means of save_expr,
4043 so see the caveats in the comments about save_expr.
4045 Also allows conversion expressions whose operands are references.
4046 Any other kind of expression is returned unchanged. */
4049 stabilize_reference (tree ref
)
4052 enum tree_code code
= TREE_CODE (ref
);
4059 /* No action is needed in this case. */
4064 case FIX_TRUNC_EXPR
:
4065 result
= build_nt (code
, stabilize_reference (TREE_OPERAND (ref
, 0)));
4069 result
= build_nt (INDIRECT_REF
,
4070 stabilize_reference_1 (TREE_OPERAND (ref
, 0)));
4074 result
= build_nt (COMPONENT_REF
,
4075 stabilize_reference (TREE_OPERAND (ref
, 0)),
4076 TREE_OPERAND (ref
, 1), NULL_TREE
);
4080 result
= build_nt (BIT_FIELD_REF
,
4081 stabilize_reference (TREE_OPERAND (ref
, 0)),
4082 TREE_OPERAND (ref
, 1), TREE_OPERAND (ref
, 2));
4086 result
= build_nt (ARRAY_REF
,
4087 stabilize_reference (TREE_OPERAND (ref
, 0)),
4088 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
4089 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
4092 case ARRAY_RANGE_REF
:
4093 result
= build_nt (ARRAY_RANGE_REF
,
4094 stabilize_reference (TREE_OPERAND (ref
, 0)),
4095 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
4096 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
4100 /* We cannot wrap the first expression in a SAVE_EXPR, as then
4101 it wouldn't be ignored. This matters when dealing with
4103 return stabilize_reference_1 (ref
);
4105 /* If arg isn't a kind of lvalue we recognize, make no change.
4106 Caller should recognize the error for an invalid lvalue. */
4111 return error_mark_node
;
4114 TREE_TYPE (result
) = TREE_TYPE (ref
);
4115 TREE_READONLY (result
) = TREE_READONLY (ref
);
4116 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (ref
);
4117 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (ref
);
4122 /* Low-level constructors for expressions. */
4124 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
4125 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
4128 recompute_tree_invariant_for_addr_expr (tree t
)
4131 bool tc
= true, se
= false;
4133 /* We started out assuming this address is both invariant and constant, but
4134 does not have side effects. Now go down any handled components and see if
4135 any of them involve offsets that are either non-constant or non-invariant.
4136 Also check for side-effects.
4138 ??? Note that this code makes no attempt to deal with the case where
4139 taking the address of something causes a copy due to misalignment. */
4141 #define UPDATE_FLAGS(NODE) \
4142 do { tree _node = (NODE); \
4143 if (_node && !TREE_CONSTANT (_node)) tc = false; \
4144 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
4146 for (node
= TREE_OPERAND (t
, 0); handled_component_p (node
);
4147 node
= TREE_OPERAND (node
, 0))
4149 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
4150 array reference (probably made temporarily by the G++ front end),
4151 so ignore all the operands. */
4152 if ((TREE_CODE (node
) == ARRAY_REF
4153 || TREE_CODE (node
) == ARRAY_RANGE_REF
)
4154 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node
, 0))) == ARRAY_TYPE
)
4156 UPDATE_FLAGS (TREE_OPERAND (node
, 1));
4157 if (TREE_OPERAND (node
, 2))
4158 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
4159 if (TREE_OPERAND (node
, 3))
4160 UPDATE_FLAGS (TREE_OPERAND (node
, 3));
4162 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
4163 FIELD_DECL, apparently. The G++ front end can put something else
4164 there, at least temporarily. */
4165 else if (TREE_CODE (node
) == COMPONENT_REF
4166 && TREE_CODE (TREE_OPERAND (node
, 1)) == FIELD_DECL
)
4168 if (TREE_OPERAND (node
, 2))
4169 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
4173 node
= lang_hooks
.expr_to_decl (node
, &tc
, &se
);
4175 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
4176 the address, since &(*a)->b is a form of addition. If it's a constant, the
4177 address is constant too. If it's a decl, its address is constant if the
4178 decl is static. Everything else is not constant and, furthermore,
4179 taking the address of a volatile variable is not volatile. */
4180 if (TREE_CODE (node
) == INDIRECT_REF
4181 || TREE_CODE (node
) == MEM_REF
)
4182 UPDATE_FLAGS (TREE_OPERAND (node
, 0));
4183 else if (CONSTANT_CLASS_P (node
))
4185 else if (DECL_P (node
))
4186 tc
&= (staticp (node
) != NULL_TREE
);
4190 se
|= TREE_SIDE_EFFECTS (node
);
4194 TREE_CONSTANT (t
) = tc
;
4195 TREE_SIDE_EFFECTS (t
) = se
;
4199 /* Build an expression of code CODE, data type TYPE, and operands as
4200 specified. Expressions and reference nodes can be created this way.
4201 Constants, decls, types and misc nodes cannot be.
4203 We define 5 non-variadic functions, from 0 to 4 arguments. This is
4204 enough for all extant tree codes. */
4207 build0_stat (enum tree_code code
, tree tt MEM_STAT_DECL
)
4211 gcc_assert (TREE_CODE_LENGTH (code
) == 0);
4213 t
= make_node_stat (code PASS_MEM_STAT
);
4220 build1_stat (enum tree_code code
, tree type
, tree node MEM_STAT_DECL
)
4222 int length
= sizeof (struct tree_exp
);
4225 record_node_allocation_statistics (code
, length
);
4227 gcc_assert (TREE_CODE_LENGTH (code
) == 1);
4229 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
4231 memset (t
, 0, sizeof (struct tree_common
));
4233 TREE_SET_CODE (t
, code
);
4235 TREE_TYPE (t
) = type
;
4236 SET_EXPR_LOCATION (t
, UNKNOWN_LOCATION
);
4237 TREE_OPERAND (t
, 0) = node
;
4238 if (node
&& !TYPE_P (node
))
4240 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (node
);
4241 TREE_READONLY (t
) = TREE_READONLY (node
);
4244 if (TREE_CODE_CLASS (code
) == tcc_statement
)
4245 TREE_SIDE_EFFECTS (t
) = 1;
4249 /* All of these have side-effects, no matter what their
4251 TREE_SIDE_EFFECTS (t
) = 1;
4252 TREE_READONLY (t
) = 0;
4256 /* Whether a dereference is readonly has nothing to do with whether
4257 its operand is readonly. */
4258 TREE_READONLY (t
) = 0;
4263 recompute_tree_invariant_for_addr_expr (t
);
4267 if ((TREE_CODE_CLASS (code
) == tcc_unary
|| code
== VIEW_CONVERT_EXPR
)
4268 && node
&& !TYPE_P (node
)
4269 && TREE_CONSTANT (node
))
4270 TREE_CONSTANT (t
) = 1;
4271 if (TREE_CODE_CLASS (code
) == tcc_reference
4272 && node
&& TREE_THIS_VOLATILE (node
))
4273 TREE_THIS_VOLATILE (t
) = 1;
4280 #define PROCESS_ARG(N) \
4282 TREE_OPERAND (t, N) = arg##N; \
4283 if (arg##N &&!TYPE_P (arg##N)) \
4285 if (TREE_SIDE_EFFECTS (arg##N)) \
4287 if (!TREE_READONLY (arg##N) \
4288 && !CONSTANT_CLASS_P (arg##N)) \
4289 (void) (read_only = 0); \
4290 if (!TREE_CONSTANT (arg##N)) \
4291 (void) (constant = 0); \
4296 build2_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1 MEM_STAT_DECL
)
4298 bool constant
, read_only
, side_effects
;
4301 gcc_assert (TREE_CODE_LENGTH (code
) == 2);
4303 if ((code
== MINUS_EXPR
|| code
== PLUS_EXPR
|| code
== MULT_EXPR
)
4304 && arg0
&& arg1
&& tt
&& POINTER_TYPE_P (tt
)
4305 /* When sizetype precision doesn't match that of pointers
4306 we need to be able to build explicit extensions or truncations
4307 of the offset argument. */
4308 && TYPE_PRECISION (sizetype
) == TYPE_PRECISION (tt
))
4309 gcc_assert (TREE_CODE (arg0
) == INTEGER_CST
4310 && TREE_CODE (arg1
) == INTEGER_CST
);
4312 if (code
== POINTER_PLUS_EXPR
&& arg0
&& arg1
&& tt
)
4313 gcc_assert (POINTER_TYPE_P (tt
) && POINTER_TYPE_P (TREE_TYPE (arg0
))
4314 && ptrofftype_p (TREE_TYPE (arg1
)));
4316 t
= make_node_stat (code PASS_MEM_STAT
);
4319 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
4320 result based on those same flags for the arguments. But if the
4321 arguments aren't really even `tree' expressions, we shouldn't be trying
4324 /* Expressions without side effects may be constant if their
4325 arguments are as well. */
4326 constant
= (TREE_CODE_CLASS (code
) == tcc_comparison
4327 || TREE_CODE_CLASS (code
) == tcc_binary
);
4329 side_effects
= TREE_SIDE_EFFECTS (t
);
4334 TREE_READONLY (t
) = read_only
;
4335 TREE_CONSTANT (t
) = constant
;
4336 TREE_SIDE_EFFECTS (t
) = side_effects
;
4337 TREE_THIS_VOLATILE (t
)
4338 = (TREE_CODE_CLASS (code
) == tcc_reference
4339 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4346 build3_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4347 tree arg2 MEM_STAT_DECL
)
4349 bool constant
, read_only
, side_effects
;
4352 gcc_assert (TREE_CODE_LENGTH (code
) == 3);
4353 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
4355 t
= make_node_stat (code PASS_MEM_STAT
);
4360 /* As a special exception, if COND_EXPR has NULL branches, we
4361 assume that it is a gimple statement and always consider
4362 it to have side effects. */
4363 if (code
== COND_EXPR
4364 && tt
== void_type_node
4365 && arg1
== NULL_TREE
4366 && arg2
== NULL_TREE
)
4367 side_effects
= true;
4369 side_effects
= TREE_SIDE_EFFECTS (t
);
4375 if (code
== COND_EXPR
)
4376 TREE_READONLY (t
) = read_only
;
4378 TREE_SIDE_EFFECTS (t
) = side_effects
;
4379 TREE_THIS_VOLATILE (t
)
4380 = (TREE_CODE_CLASS (code
) == tcc_reference
4381 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4387 build4_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4388 tree arg2
, tree arg3 MEM_STAT_DECL
)
4390 bool constant
, read_only
, side_effects
;
4393 gcc_assert (TREE_CODE_LENGTH (code
) == 4);
4395 t
= make_node_stat (code PASS_MEM_STAT
);
4398 side_effects
= TREE_SIDE_EFFECTS (t
);
4405 TREE_SIDE_EFFECTS (t
) = side_effects
;
4406 TREE_THIS_VOLATILE (t
)
4407 = (TREE_CODE_CLASS (code
) == tcc_reference
4408 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4414 build5_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4415 tree arg2
, tree arg3
, tree arg4 MEM_STAT_DECL
)
4417 bool constant
, read_only
, side_effects
;
4420 gcc_assert (TREE_CODE_LENGTH (code
) == 5);
4422 t
= make_node_stat (code PASS_MEM_STAT
);
4425 side_effects
= TREE_SIDE_EFFECTS (t
);
4433 TREE_SIDE_EFFECTS (t
) = side_effects
;
4434 TREE_THIS_VOLATILE (t
)
4435 = (TREE_CODE_CLASS (code
) == tcc_reference
4436 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4441 /* Build a simple MEM_REF tree with the sematics of a plain INDIRECT_REF
4442 on the pointer PTR. */
4445 build_simple_mem_ref_loc (location_t loc
, tree ptr
)
4447 HOST_WIDE_INT offset
= 0;
4448 tree ptype
= TREE_TYPE (ptr
);
4450 /* For convenience allow addresses that collapse to a simple base
4452 if (TREE_CODE (ptr
) == ADDR_EXPR
4453 && (handled_component_p (TREE_OPERAND (ptr
, 0))
4454 || TREE_CODE (TREE_OPERAND (ptr
, 0)) == MEM_REF
))
4456 ptr
= get_addr_base_and_unit_offset (TREE_OPERAND (ptr
, 0), &offset
);
4458 ptr
= build_fold_addr_expr (ptr
);
4459 gcc_assert (is_gimple_reg (ptr
) || is_gimple_min_invariant (ptr
));
4461 tem
= build2 (MEM_REF
, TREE_TYPE (ptype
),
4462 ptr
, build_int_cst (ptype
, offset
));
4463 SET_EXPR_LOCATION (tem
, loc
);
4467 /* Return the constant offset of a MEM_REF or TARGET_MEM_REF tree T. */
4470 mem_ref_offset (const_tree t
)
4472 return offset_int::from (TREE_OPERAND (t
, 1), SIGNED
);
4475 /* Return an invariant ADDR_EXPR of type TYPE taking the address of BASE
4476 offsetted by OFFSET units. */
4479 build_invariant_address (tree type
, tree base
, HOST_WIDE_INT offset
)
4481 tree ref
= fold_build2 (MEM_REF
, TREE_TYPE (type
),
4482 build_fold_addr_expr (base
),
4483 build_int_cst (ptr_type_node
, offset
));
4484 tree addr
= build1 (ADDR_EXPR
, type
, ref
);
4485 recompute_tree_invariant_for_addr_expr (addr
);
4489 /* Similar except don't specify the TREE_TYPE
4490 and leave the TREE_SIDE_EFFECTS as 0.
4491 It is permissible for arguments to be null,
4492 or even garbage if their values do not matter. */
4495 build_nt (enum tree_code code
, ...)
4502 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
4506 t
= make_node (code
);
4507 length
= TREE_CODE_LENGTH (code
);
4509 for (i
= 0; i
< length
; i
++)
4510 TREE_OPERAND (t
, i
) = va_arg (p
, tree
);
4516 /* Similar to build_nt, but for creating a CALL_EXPR object with a
4520 build_nt_call_vec (tree fn
, vec
<tree
, va_gc
> *args
)
4525 ret
= build_vl_exp (CALL_EXPR
, vec_safe_length (args
) + 3);
4526 CALL_EXPR_FN (ret
) = fn
;
4527 CALL_EXPR_STATIC_CHAIN (ret
) = NULL_TREE
;
4528 FOR_EACH_VEC_SAFE_ELT (args
, ix
, t
)
4529 CALL_EXPR_ARG (ret
, ix
) = t
;
4533 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
4534 We do NOT enter this node in any sort of symbol table.
4536 LOC is the location of the decl.
4538 layout_decl is used to set up the decl's storage layout.
4539 Other slots are initialized to 0 or null pointers. */
4542 build_decl_stat (location_t loc
, enum tree_code code
, tree name
,
4543 tree type MEM_STAT_DECL
)
4547 t
= make_node_stat (code PASS_MEM_STAT
);
4548 DECL_SOURCE_LOCATION (t
) = loc
;
4550 /* if (type == error_mark_node)
4551 type = integer_type_node; */
4552 /* That is not done, deliberately, so that having error_mark_node
4553 as the type can suppress useless errors in the use of this variable. */
4555 DECL_NAME (t
) = name
;
4556 TREE_TYPE (t
) = type
;
4558 if (code
== VAR_DECL
|| code
== PARM_DECL
|| code
== RESULT_DECL
)
4564 /* Builds and returns function declaration with NAME and TYPE. */
4567 build_fn_decl (const char *name
, tree type
)
4569 tree id
= get_identifier (name
);
4570 tree decl
= build_decl (input_location
, FUNCTION_DECL
, id
, type
);
4572 DECL_EXTERNAL (decl
) = 1;
4573 TREE_PUBLIC (decl
) = 1;
4574 DECL_ARTIFICIAL (decl
) = 1;
4575 TREE_NOTHROW (decl
) = 1;
4580 vec
<tree
, va_gc
> *all_translation_units
;
4582 /* Builds a new translation-unit decl with name NAME, queues it in the
4583 global list of translation-unit decls and returns it. */
4586 build_translation_unit_decl (tree name
)
4588 tree tu
= build_decl (UNKNOWN_LOCATION
, TRANSLATION_UNIT_DECL
,
4590 TRANSLATION_UNIT_LANGUAGE (tu
) = lang_hooks
.name
;
4591 vec_safe_push (all_translation_units
, tu
);
4596 /* BLOCK nodes are used to represent the structure of binding contours
4597 and declarations, once those contours have been exited and their contents
4598 compiled. This information is used for outputting debugging info. */
4601 build_block (tree vars
, tree subblocks
, tree supercontext
, tree chain
)
4603 tree block
= make_node (BLOCK
);
4605 BLOCK_VARS (block
) = vars
;
4606 BLOCK_SUBBLOCKS (block
) = subblocks
;
4607 BLOCK_SUPERCONTEXT (block
) = supercontext
;
4608 BLOCK_CHAIN (block
) = chain
;
4613 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
4615 LOC is the location to use in tree T. */
4618 protected_set_expr_location (tree t
, location_t loc
)
4620 if (CAN_HAVE_LOCATION_P (t
))
4621 SET_EXPR_LOCATION (t
, loc
);
4624 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
4628 build_decl_attribute_variant (tree ddecl
, tree attribute
)
4630 DECL_ATTRIBUTES (ddecl
) = attribute
;
4634 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4635 is ATTRIBUTE and its qualifiers are QUALS.
4637 Record such modified types already made so we don't make duplicates. */
4640 build_type_attribute_qual_variant (tree ttype
, tree attribute
, int quals
)
4642 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype
), attribute
))
4644 inchash::hash hstate
;
4648 enum tree_code code
= TREE_CODE (ttype
);
4650 /* Building a distinct copy of a tagged type is inappropriate; it
4651 causes breakage in code that expects there to be a one-to-one
4652 relationship between a struct and its fields.
4653 build_duplicate_type is another solution (as used in
4654 handle_transparent_union_attribute), but that doesn't play well
4655 with the stronger C++ type identity model. */
4656 if (TREE_CODE (ttype
) == RECORD_TYPE
4657 || TREE_CODE (ttype
) == UNION_TYPE
4658 || TREE_CODE (ttype
) == QUAL_UNION_TYPE
4659 || TREE_CODE (ttype
) == ENUMERAL_TYPE
)
4661 warning (OPT_Wattributes
,
4662 "ignoring attributes applied to %qT after definition",
4663 TYPE_MAIN_VARIANT (ttype
));
4664 return build_qualified_type (ttype
, quals
);
4667 ttype
= build_qualified_type (ttype
, TYPE_UNQUALIFIED
);
4668 ntype
= build_distinct_type_copy (ttype
);
4670 TYPE_ATTRIBUTES (ntype
) = attribute
;
4672 hstate
.add_int (code
);
4673 if (TREE_TYPE (ntype
))
4674 hstate
.add_object (TYPE_HASH (TREE_TYPE (ntype
)));
4675 attribute_hash_list (attribute
, hstate
);
4677 switch (TREE_CODE (ntype
))
4680 type_hash_list (TYPE_ARG_TYPES (ntype
), hstate
);
4683 if (TYPE_DOMAIN (ntype
))
4684 hstate
.add_object (TYPE_HASH (TYPE_DOMAIN (ntype
)));
4687 t
= TYPE_MAX_VALUE (ntype
);
4688 for (i
= 0; i
< TREE_INT_CST_NUNITS (t
); i
++)
4689 hstate
.add_object (TREE_INT_CST_ELT (t
, i
));
4692 case FIXED_POINT_TYPE
:
4694 unsigned int precision
= TYPE_PRECISION (ntype
);
4695 hstate
.add_object (precision
);
4702 ntype
= type_hash_canon (hstate
.end(), ntype
);
4704 /* If the target-dependent attributes make NTYPE different from
4705 its canonical type, we will need to use structural equality
4706 checks for this type. */
4707 if (TYPE_STRUCTURAL_EQUALITY_P (ttype
)
4708 || !comp_type_attributes (ntype
, ttype
))
4709 SET_TYPE_STRUCTURAL_EQUALITY (ntype
);
4710 else if (TYPE_CANONICAL (ntype
) == ntype
)
4711 TYPE_CANONICAL (ntype
) = TYPE_CANONICAL (ttype
);
4713 ttype
= build_qualified_type (ntype
, quals
);
4715 else if (TYPE_QUALS (ttype
) != quals
)
4716 ttype
= build_qualified_type (ttype
, quals
);
4721 /* Check if "omp declare simd" attribute arguments, CLAUSES1 and CLAUSES2, are
4725 omp_declare_simd_clauses_equal (tree clauses1
, tree clauses2
)
4728 for (cl1
= clauses1
, cl2
= clauses2
;
4730 cl1
= OMP_CLAUSE_CHAIN (cl1
), cl2
= OMP_CLAUSE_CHAIN (cl2
))
4732 if (OMP_CLAUSE_CODE (cl1
) != OMP_CLAUSE_CODE (cl2
))
4734 if (OMP_CLAUSE_CODE (cl1
) != OMP_CLAUSE_SIMDLEN
)
4736 if (simple_cst_equal (OMP_CLAUSE_DECL (cl1
),
4737 OMP_CLAUSE_DECL (cl2
)) != 1)
4740 switch (OMP_CLAUSE_CODE (cl1
))
4742 case OMP_CLAUSE_ALIGNED
:
4743 if (simple_cst_equal (OMP_CLAUSE_ALIGNED_ALIGNMENT (cl1
),
4744 OMP_CLAUSE_ALIGNED_ALIGNMENT (cl2
)) != 1)
4747 case OMP_CLAUSE_LINEAR
:
4748 if (simple_cst_equal (OMP_CLAUSE_LINEAR_STEP (cl1
),
4749 OMP_CLAUSE_LINEAR_STEP (cl2
)) != 1)
4752 case OMP_CLAUSE_SIMDLEN
:
4753 if (simple_cst_equal (OMP_CLAUSE_SIMDLEN_EXPR (cl1
),
4754 OMP_CLAUSE_SIMDLEN_EXPR (cl2
)) != 1)
4763 /* Compare two constructor-element-type constants. Return 1 if the lists
4764 are known to be equal; otherwise return 0. */
4767 simple_cst_list_equal (const_tree l1
, const_tree l2
)
4769 while (l1
!= NULL_TREE
&& l2
!= NULL_TREE
)
4771 if (simple_cst_equal (TREE_VALUE (l1
), TREE_VALUE (l2
)) != 1)
4774 l1
= TREE_CHAIN (l1
);
4775 l2
= TREE_CHAIN (l2
);
4781 /* Compare two attributes for their value identity. Return true if the
4782 attribute values are known to be equal; otherwise return false.
4786 attribute_value_equal (const_tree attr1
, const_tree attr2
)
4788 if (TREE_VALUE (attr1
) == TREE_VALUE (attr2
))
4791 if (TREE_VALUE (attr1
) != NULL_TREE
4792 && TREE_CODE (TREE_VALUE (attr1
)) == TREE_LIST
4793 && TREE_VALUE (attr2
) != NULL
4794 && TREE_CODE (TREE_VALUE (attr2
)) == TREE_LIST
)
4795 return (simple_cst_list_equal (TREE_VALUE (attr1
),
4796 TREE_VALUE (attr2
)) == 1);
4798 if ((flag_openmp
|| flag_openmp_simd
)
4799 && TREE_VALUE (attr1
) && TREE_VALUE (attr2
)
4800 && TREE_CODE (TREE_VALUE (attr1
)) == OMP_CLAUSE
4801 && TREE_CODE (TREE_VALUE (attr2
)) == OMP_CLAUSE
)
4802 return omp_declare_simd_clauses_equal (TREE_VALUE (attr1
),
4803 TREE_VALUE (attr2
));
4805 return (simple_cst_equal (TREE_VALUE (attr1
), TREE_VALUE (attr2
)) == 1);
4808 /* Return 0 if the attributes for two types are incompatible, 1 if they
4809 are compatible, and 2 if they are nearly compatible (which causes a
4810 warning to be generated). */
4812 comp_type_attributes (const_tree type1
, const_tree type2
)
4814 const_tree a1
= TYPE_ATTRIBUTES (type1
);
4815 const_tree a2
= TYPE_ATTRIBUTES (type2
);
4820 for (a
= a1
; a
!= NULL_TREE
; a
= TREE_CHAIN (a
))
4822 const struct attribute_spec
*as
;
4825 as
= lookup_attribute_spec (get_attribute_name (a
));
4826 if (!as
|| as
->affects_type_identity
== false)
4829 attr
= lookup_attribute (as
->name
, CONST_CAST_TREE (a2
));
4830 if (!attr
|| !attribute_value_equal (a
, attr
))
4835 for (a
= a2
; a
!= NULL_TREE
; a
= TREE_CHAIN (a
))
4837 const struct attribute_spec
*as
;
4839 as
= lookup_attribute_spec (get_attribute_name (a
));
4840 if (!as
|| as
->affects_type_identity
== false)
4843 if (!lookup_attribute (as
->name
, CONST_CAST_TREE (a1
)))
4845 /* We don't need to compare trees again, as we did this
4846 already in first loop. */
4848 /* All types - affecting identity - are equal, so
4849 there is no need to call target hook for comparison. */
4853 /* As some type combinations - like default calling-convention - might
4854 be compatible, we have to call the target hook to get the final result. */
4855 return targetm
.comp_type_attributes (type1
, type2
);
4858 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4861 Record such modified types already made so we don't make duplicates. */
4864 build_type_attribute_variant (tree ttype
, tree attribute
)
4866 return build_type_attribute_qual_variant (ttype
, attribute
,
4867 TYPE_QUALS (ttype
));
4871 /* Reset the expression *EXPR_P, a size or position.
4873 ??? We could reset all non-constant sizes or positions. But it's cheap
4874 enough to not do so and refrain from adding workarounds to dwarf2out.c.
4876 We need to reset self-referential sizes or positions because they cannot
4877 be gimplified and thus can contain a CALL_EXPR after the gimplification
4878 is finished, which will run afoul of LTO streaming. And they need to be
4879 reset to something essentially dummy but not constant, so as to preserve
4880 the properties of the object they are attached to. */
4883 free_lang_data_in_one_sizepos (tree
*expr_p
)
4885 tree expr
= *expr_p
;
4886 if (CONTAINS_PLACEHOLDER_P (expr
))
4887 *expr_p
= build0 (PLACEHOLDER_EXPR
, TREE_TYPE (expr
));
4891 /* Reset all the fields in a binfo node BINFO. We only keep
4892 BINFO_VTABLE, which is used by gimple_fold_obj_type_ref. */
4895 free_lang_data_in_binfo (tree binfo
)
4900 gcc_assert (TREE_CODE (binfo
) == TREE_BINFO
);
4902 BINFO_VIRTUALS (binfo
) = NULL_TREE
;
4903 BINFO_BASE_ACCESSES (binfo
) = NULL
;
4904 BINFO_INHERITANCE_CHAIN (binfo
) = NULL_TREE
;
4905 BINFO_SUBVTT_INDEX (binfo
) = NULL_TREE
;
4907 FOR_EACH_VEC_ELT (*BINFO_BASE_BINFOS (binfo
), i
, t
)
4908 free_lang_data_in_binfo (t
);
4912 /* Reset all language specific information still present in TYPE. */
4915 free_lang_data_in_type (tree type
)
4917 gcc_assert (TYPE_P (type
));
4919 /* Give the FE a chance to remove its own data first. */
4920 lang_hooks
.free_lang_data (type
);
4922 TREE_LANG_FLAG_0 (type
) = 0;
4923 TREE_LANG_FLAG_1 (type
) = 0;
4924 TREE_LANG_FLAG_2 (type
) = 0;
4925 TREE_LANG_FLAG_3 (type
) = 0;
4926 TREE_LANG_FLAG_4 (type
) = 0;
4927 TREE_LANG_FLAG_5 (type
) = 0;
4928 TREE_LANG_FLAG_6 (type
) = 0;
4930 if (TREE_CODE (type
) == FUNCTION_TYPE
)
4932 /* Remove the const and volatile qualifiers from arguments. The
4933 C++ front end removes them, but the C front end does not,
4934 leading to false ODR violation errors when merging two
4935 instances of the same function signature compiled by
4936 different front ends. */
4939 for (p
= TYPE_ARG_TYPES (type
); p
; p
= TREE_CHAIN (p
))
4941 tree arg_type
= TREE_VALUE (p
);
4943 if (TYPE_READONLY (arg_type
) || TYPE_VOLATILE (arg_type
))
4945 int quals
= TYPE_QUALS (arg_type
)
4947 & ~TYPE_QUAL_VOLATILE
;
4948 TREE_VALUE (p
) = build_qualified_type (arg_type
, quals
);
4949 free_lang_data_in_type (TREE_VALUE (p
));
4954 /* Remove members that are not actually FIELD_DECLs from the field
4955 list of an aggregate. These occur in C++. */
4956 if (RECORD_OR_UNION_TYPE_P (type
))
4960 /* Note that TYPE_FIELDS can be shared across distinct
4961 TREE_TYPEs. Therefore, if the first field of TYPE_FIELDS is
4962 to be removed, we cannot set its TREE_CHAIN to NULL.
4963 Otherwise, we would not be able to find all the other fields
4964 in the other instances of this TREE_TYPE.
4966 This was causing an ICE in testsuite/g++.dg/lto/20080915.C. */
4968 member
= TYPE_FIELDS (type
);
4971 if (TREE_CODE (member
) == FIELD_DECL
4972 || TREE_CODE (member
) == TYPE_DECL
)
4975 TREE_CHAIN (prev
) = member
;
4977 TYPE_FIELDS (type
) = member
;
4981 member
= TREE_CHAIN (member
);
4985 TREE_CHAIN (prev
) = NULL_TREE
;
4987 TYPE_FIELDS (type
) = NULL_TREE
;
4989 TYPE_METHODS (type
) = NULL_TREE
;
4990 if (TYPE_BINFO (type
))
4991 free_lang_data_in_binfo (TYPE_BINFO (type
));
4995 /* For non-aggregate types, clear out the language slot (which
4996 overloads TYPE_BINFO). */
4997 TYPE_LANG_SLOT_1 (type
) = NULL_TREE
;
4999 if (INTEGRAL_TYPE_P (type
)
5000 || SCALAR_FLOAT_TYPE_P (type
)
5001 || FIXED_POINT_TYPE_P (type
))
5003 free_lang_data_in_one_sizepos (&TYPE_MIN_VALUE (type
));
5004 free_lang_data_in_one_sizepos (&TYPE_MAX_VALUE (type
));
5008 free_lang_data_in_one_sizepos (&TYPE_SIZE (type
));
5009 free_lang_data_in_one_sizepos (&TYPE_SIZE_UNIT (type
));
5011 if (TYPE_CONTEXT (type
)
5012 && TREE_CODE (TYPE_CONTEXT (type
)) == BLOCK
)
5014 tree ctx
= TYPE_CONTEXT (type
);
5017 ctx
= BLOCK_SUPERCONTEXT (ctx
);
5019 while (ctx
&& TREE_CODE (ctx
) == BLOCK
);
5020 TYPE_CONTEXT (type
) = ctx
;
5025 /* Return true if DECL may need an assembler name to be set. */
5028 need_assembler_name_p (tree decl
)
5030 /* We use DECL_ASSEMBLER_NAME to hold mangled type names for One Definition Rule
5032 if (flag_lto_odr_type_mering
5033 && TREE_CODE (decl
) == TYPE_DECL
5035 && decl
== TYPE_NAME (TREE_TYPE (decl
))
5036 && !is_lang_specific (TREE_TYPE (decl
))
5037 && AGGREGATE_TYPE_P (TREE_TYPE (decl
))
5038 && !variably_modified_type_p (TREE_TYPE (decl
), NULL_TREE
)
5039 && !type_in_anonymous_namespace_p (TREE_TYPE (decl
)))
5040 return !DECL_ASSEMBLER_NAME_SET_P (decl
);
5041 /* Only FUNCTION_DECLs and VAR_DECLs are considered. */
5042 if (TREE_CODE (decl
) != FUNCTION_DECL
5043 && TREE_CODE (decl
) != VAR_DECL
)
5046 /* If DECL already has its assembler name set, it does not need a
5048 if (!HAS_DECL_ASSEMBLER_NAME_P (decl
)
5049 || DECL_ASSEMBLER_NAME_SET_P (decl
))
5052 /* Abstract decls do not need an assembler name. */
5053 if (DECL_ABSTRACT_P (decl
))
5056 /* For VAR_DECLs, only static, public and external symbols need an
5058 if (TREE_CODE (decl
) == VAR_DECL
5059 && !TREE_STATIC (decl
)
5060 && !TREE_PUBLIC (decl
)
5061 && !DECL_EXTERNAL (decl
))
5064 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5066 /* Do not set assembler name on builtins. Allow RTL expansion to
5067 decide whether to expand inline or via a regular call. */
5068 if (DECL_BUILT_IN (decl
)
5069 && DECL_BUILT_IN_CLASS (decl
) != BUILT_IN_FRONTEND
)
5072 /* Functions represented in the callgraph need an assembler name. */
5073 if (cgraph_node::get (decl
) != NULL
)
5076 /* Unused and not public functions don't need an assembler name. */
5077 if (!TREE_USED (decl
) && !TREE_PUBLIC (decl
))
5085 /* Reset all language specific information still present in symbol
5089 free_lang_data_in_decl (tree decl
)
5091 gcc_assert (DECL_P (decl
));
5093 /* Give the FE a chance to remove its own data first. */
5094 lang_hooks
.free_lang_data (decl
);
5096 TREE_LANG_FLAG_0 (decl
) = 0;
5097 TREE_LANG_FLAG_1 (decl
) = 0;
5098 TREE_LANG_FLAG_2 (decl
) = 0;
5099 TREE_LANG_FLAG_3 (decl
) = 0;
5100 TREE_LANG_FLAG_4 (decl
) = 0;
5101 TREE_LANG_FLAG_5 (decl
) = 0;
5102 TREE_LANG_FLAG_6 (decl
) = 0;
5104 free_lang_data_in_one_sizepos (&DECL_SIZE (decl
));
5105 free_lang_data_in_one_sizepos (&DECL_SIZE_UNIT (decl
));
5106 if (TREE_CODE (decl
) == FIELD_DECL
)
5108 free_lang_data_in_one_sizepos (&DECL_FIELD_OFFSET (decl
));
5109 if (TREE_CODE (DECL_CONTEXT (decl
)) == QUAL_UNION_TYPE
)
5110 DECL_QUALIFIER (decl
) = NULL_TREE
;
5113 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5115 struct cgraph_node
*node
;
5116 if (!(node
= cgraph_node::get (decl
))
5117 || (!node
->definition
&& !node
->clones
))
5120 node
->release_body ();
5123 release_function_body (decl
);
5124 DECL_ARGUMENTS (decl
) = NULL
;
5125 DECL_RESULT (decl
) = NULL
;
5126 DECL_INITIAL (decl
) = error_mark_node
;
5129 if (gimple_has_body_p (decl
))
5133 /* If DECL has a gimple body, then the context for its
5134 arguments must be DECL. Otherwise, it doesn't really
5135 matter, as we will not be emitting any code for DECL. In
5136 general, there may be other instances of DECL created by
5137 the front end and since PARM_DECLs are generally shared,
5138 their DECL_CONTEXT changes as the replicas of DECL are
5139 created. The only time where DECL_CONTEXT is important
5140 is for the FUNCTION_DECLs that have a gimple body (since
5141 the PARM_DECL will be used in the function's body). */
5142 for (t
= DECL_ARGUMENTS (decl
); t
; t
= TREE_CHAIN (t
))
5143 DECL_CONTEXT (t
) = decl
;
5146 /* DECL_SAVED_TREE holds the GENERIC representation for DECL.
5147 At this point, it is not needed anymore. */
5148 DECL_SAVED_TREE (decl
) = NULL_TREE
;
5150 /* Clear the abstract origin if it refers to a method. Otherwise
5151 dwarf2out.c will ICE as we clear TYPE_METHODS and thus the
5152 origin will not be output correctly. */
5153 if (DECL_ABSTRACT_ORIGIN (decl
)
5154 && DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))
5155 && RECORD_OR_UNION_TYPE_P
5156 (DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))))
5157 DECL_ABSTRACT_ORIGIN (decl
) = NULL_TREE
;
5159 /* Sometimes the C++ frontend doesn't manage to transform a temporary
5160 DECL_VINDEX referring to itself into a vtable slot number as it
5161 should. Happens with functions that are copied and then forgotten
5162 about. Just clear it, it won't matter anymore. */
5163 if (DECL_VINDEX (decl
) && !tree_fits_shwi_p (DECL_VINDEX (decl
)))
5164 DECL_VINDEX (decl
) = NULL_TREE
;
5166 else if (TREE_CODE (decl
) == VAR_DECL
)
5168 if ((DECL_EXTERNAL (decl
)
5169 && (!TREE_STATIC (decl
) || !TREE_READONLY (decl
)))
5170 || (decl_function_context (decl
) && !TREE_STATIC (decl
)))
5171 DECL_INITIAL (decl
) = NULL_TREE
;
5173 else if (TREE_CODE (decl
) == TYPE_DECL
5174 || TREE_CODE (decl
) == FIELD_DECL
)
5175 DECL_INITIAL (decl
) = NULL_TREE
;
5176 else if (TREE_CODE (decl
) == TRANSLATION_UNIT_DECL
5177 && DECL_INITIAL (decl
)
5178 && TREE_CODE (DECL_INITIAL (decl
)) == BLOCK
)
5180 /* Strip builtins from the translation-unit BLOCK. We still have targets
5181 without builtin_decl_explicit support and also builtins are shared
5182 nodes and thus we can't use TREE_CHAIN in multiple lists. */
5183 tree
*nextp
= &BLOCK_VARS (DECL_INITIAL (decl
));
5187 if (TREE_CODE (var
) == FUNCTION_DECL
5188 && DECL_BUILT_IN (var
))
5189 *nextp
= TREE_CHAIN (var
);
5191 nextp
= &TREE_CHAIN (var
);
5197 /* Data used when collecting DECLs and TYPEs for language data removal. */
5199 struct free_lang_data_d
5201 /* Worklist to avoid excessive recursion. */
5204 /* Set of traversed objects. Used to avoid duplicate visits. */
5205 hash_set
<tree
> *pset
;
5207 /* Array of symbols to process with free_lang_data_in_decl. */
5210 /* Array of types to process with free_lang_data_in_type. */
5215 /* Save all language fields needed to generate proper debug information
5216 for DECL. This saves most fields cleared out by free_lang_data_in_decl. */
5219 save_debug_info_for_decl (tree t
)
5221 /*struct saved_debug_info_d *sdi;*/
5223 gcc_assert (debug_info_level
> DINFO_LEVEL_TERSE
&& t
&& DECL_P (t
));
5225 /* FIXME. Partial implementation for saving debug info removed. */
5229 /* Save all language fields needed to generate proper debug information
5230 for TYPE. This saves most fields cleared out by free_lang_data_in_type. */
5233 save_debug_info_for_type (tree t
)
5235 /*struct saved_debug_info_d *sdi;*/
5237 gcc_assert (debug_info_level
> DINFO_LEVEL_TERSE
&& t
&& TYPE_P (t
));
5239 /* FIXME. Partial implementation for saving debug info removed. */
5243 /* Add type or decl T to one of the list of tree nodes that need their
5244 language data removed. The lists are held inside FLD. */
5247 add_tree_to_fld_list (tree t
, struct free_lang_data_d
*fld
)
5251 fld
->decls
.safe_push (t
);
5252 if (debug_info_level
> DINFO_LEVEL_TERSE
)
5253 save_debug_info_for_decl (t
);
5255 else if (TYPE_P (t
))
5257 fld
->types
.safe_push (t
);
5258 if (debug_info_level
> DINFO_LEVEL_TERSE
)
5259 save_debug_info_for_type (t
);
5265 /* Push tree node T into FLD->WORKLIST. */
5268 fld_worklist_push (tree t
, struct free_lang_data_d
*fld
)
5270 if (t
&& !is_lang_specific (t
) && !fld
->pset
->contains (t
))
5271 fld
->worklist
.safe_push ((t
));
5275 /* Operand callback helper for free_lang_data_in_node. *TP is the
5276 subtree operand being considered. */
5279 find_decls_types_r (tree
*tp
, int *ws
, void *data
)
5282 struct free_lang_data_d
*fld
= (struct free_lang_data_d
*) data
;
5284 if (TREE_CODE (t
) == TREE_LIST
)
5287 /* Language specific nodes will be removed, so there is no need
5288 to gather anything under them. */
5289 if (is_lang_specific (t
))
5297 /* Note that walk_tree does not traverse every possible field in
5298 decls, so we have to do our own traversals here. */
5299 add_tree_to_fld_list (t
, fld
);
5301 fld_worklist_push (DECL_NAME (t
), fld
);
5302 fld_worklist_push (DECL_CONTEXT (t
), fld
);
5303 fld_worklist_push (DECL_SIZE (t
), fld
);
5304 fld_worklist_push (DECL_SIZE_UNIT (t
), fld
);
5306 /* We are going to remove everything under DECL_INITIAL for
5307 TYPE_DECLs. No point walking them. */
5308 if (TREE_CODE (t
) != TYPE_DECL
)
5309 fld_worklist_push (DECL_INITIAL (t
), fld
);
5311 fld_worklist_push (DECL_ATTRIBUTES (t
), fld
);
5312 fld_worklist_push (DECL_ABSTRACT_ORIGIN (t
), fld
);
5314 if (TREE_CODE (t
) == FUNCTION_DECL
)
5316 fld_worklist_push (DECL_ARGUMENTS (t
), fld
);
5317 fld_worklist_push (DECL_RESULT (t
), fld
);
5319 else if (TREE_CODE (t
) == TYPE_DECL
)
5321 fld_worklist_push (DECL_ORIGINAL_TYPE (t
), fld
);
5323 else if (TREE_CODE (t
) == FIELD_DECL
)
5325 fld_worklist_push (DECL_FIELD_OFFSET (t
), fld
);
5326 fld_worklist_push (DECL_BIT_FIELD_TYPE (t
), fld
);
5327 fld_worklist_push (DECL_FIELD_BIT_OFFSET (t
), fld
);
5328 fld_worklist_push (DECL_FCONTEXT (t
), fld
);
5331 if ((TREE_CODE (t
) == VAR_DECL
|| TREE_CODE (t
) == PARM_DECL
)
5332 && DECL_HAS_VALUE_EXPR_P (t
))
5333 fld_worklist_push (DECL_VALUE_EXPR (t
), fld
);
5335 if (TREE_CODE (t
) != FIELD_DECL
5336 && TREE_CODE (t
) != TYPE_DECL
)
5337 fld_worklist_push (TREE_CHAIN (t
), fld
);
5340 else if (TYPE_P (t
))
5342 /* Note that walk_tree does not traverse every possible field in
5343 types, so we have to do our own traversals here. */
5344 add_tree_to_fld_list (t
, fld
);
5346 if (!RECORD_OR_UNION_TYPE_P (t
))
5347 fld_worklist_push (TYPE_CACHED_VALUES (t
), fld
);
5348 fld_worklist_push (TYPE_SIZE (t
), fld
);
5349 fld_worklist_push (TYPE_SIZE_UNIT (t
), fld
);
5350 fld_worklist_push (TYPE_ATTRIBUTES (t
), fld
);
5351 fld_worklist_push (TYPE_POINTER_TO (t
), fld
);
5352 fld_worklist_push (TYPE_REFERENCE_TO (t
), fld
);
5353 fld_worklist_push (TYPE_NAME (t
), fld
);
5354 /* Do not walk TYPE_NEXT_PTR_TO or TYPE_NEXT_REF_TO. We do not stream
5355 them and thus do not and want not to reach unused pointer types
5357 if (!POINTER_TYPE_P (t
))
5358 fld_worklist_push (TYPE_MINVAL (t
), fld
);
5359 if (!RECORD_OR_UNION_TYPE_P (t
))
5360 fld_worklist_push (TYPE_MAXVAL (t
), fld
);
5361 fld_worklist_push (TYPE_MAIN_VARIANT (t
), fld
);
5362 /* Do not walk TYPE_NEXT_VARIANT. We do not stream it and thus
5363 do not and want not to reach unused variants this way. */
5364 if (TYPE_CONTEXT (t
))
5366 tree ctx
= TYPE_CONTEXT (t
);
5367 /* We adjust BLOCK TYPE_CONTEXTs to the innermost non-BLOCK one.
5368 So push that instead. */
5369 while (ctx
&& TREE_CODE (ctx
) == BLOCK
)
5370 ctx
= BLOCK_SUPERCONTEXT (ctx
);
5371 fld_worklist_push (ctx
, fld
);
5373 /* Do not walk TYPE_CANONICAL. We do not stream it and thus do not
5374 and want not to reach unused types this way. */
5376 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_BINFO (t
))
5380 FOR_EACH_VEC_ELT (*BINFO_BASE_BINFOS (TYPE_BINFO (t
)), i
, tem
)
5381 fld_worklist_push (TREE_TYPE (tem
), fld
);
5382 tem
= BINFO_VIRTUALS (TYPE_BINFO (t
));
5384 /* The Java FE overloads BINFO_VIRTUALS for its own purpose. */
5385 && TREE_CODE (tem
) == TREE_LIST
)
5388 fld_worklist_push (TREE_VALUE (tem
), fld
);
5389 tem
= TREE_CHAIN (tem
);
5393 if (RECORD_OR_UNION_TYPE_P (t
))
5396 /* Push all TYPE_FIELDS - there can be interleaving interesting
5397 and non-interesting things. */
5398 tem
= TYPE_FIELDS (t
);
5401 if (TREE_CODE (tem
) == FIELD_DECL
5402 || TREE_CODE (tem
) == TYPE_DECL
)
5403 fld_worklist_push (tem
, fld
);
5404 tem
= TREE_CHAIN (tem
);
5408 fld_worklist_push (TYPE_STUB_DECL (t
), fld
);
5411 else if (TREE_CODE (t
) == BLOCK
)
5414 for (tem
= BLOCK_VARS (t
); tem
; tem
= TREE_CHAIN (tem
))
5415 fld_worklist_push (tem
, fld
);
5416 for (tem
= BLOCK_SUBBLOCKS (t
); tem
; tem
= BLOCK_CHAIN (tem
))
5417 fld_worklist_push (tem
, fld
);
5418 fld_worklist_push (BLOCK_ABSTRACT_ORIGIN (t
), fld
);
5421 if (TREE_CODE (t
) != IDENTIFIER_NODE
5422 && CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_TYPED
))
5423 fld_worklist_push (TREE_TYPE (t
), fld
);
5429 /* Find decls and types in T. */
5432 find_decls_types (tree t
, struct free_lang_data_d
*fld
)
5436 if (!fld
->pset
->contains (t
))
5437 walk_tree (&t
, find_decls_types_r
, fld
, fld
->pset
);
5438 if (fld
->worklist
.is_empty ())
5440 t
= fld
->worklist
.pop ();
5444 /* Translate all the types in LIST with the corresponding runtime
5448 get_eh_types_for_runtime (tree list
)
5452 if (list
== NULL_TREE
)
5455 head
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
5457 list
= TREE_CHAIN (list
);
5460 tree n
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
5461 TREE_CHAIN (prev
) = n
;
5462 prev
= TREE_CHAIN (prev
);
5463 list
= TREE_CHAIN (list
);
5470 /* Find decls and types referenced in EH region R and store them in
5471 FLD->DECLS and FLD->TYPES. */
5474 find_decls_types_in_eh_region (eh_region r
, struct free_lang_data_d
*fld
)
5485 /* The types referenced in each catch must first be changed to the
5486 EH types used at runtime. This removes references to FE types
5488 for (c
= r
->u
.eh_try
.first_catch
; c
; c
= c
->next_catch
)
5490 c
->type_list
= get_eh_types_for_runtime (c
->type_list
);
5491 walk_tree (&c
->type_list
, find_decls_types_r
, fld
, fld
->pset
);
5496 case ERT_ALLOWED_EXCEPTIONS
:
5497 r
->u
.allowed
.type_list
5498 = get_eh_types_for_runtime (r
->u
.allowed
.type_list
);
5499 walk_tree (&r
->u
.allowed
.type_list
, find_decls_types_r
, fld
, fld
->pset
);
5502 case ERT_MUST_NOT_THROW
:
5503 walk_tree (&r
->u
.must_not_throw
.failure_decl
,
5504 find_decls_types_r
, fld
, fld
->pset
);
5510 /* Find decls and types referenced in cgraph node N and store them in
5511 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
5512 look for *every* kind of DECL and TYPE node reachable from N,
5513 including those embedded inside types and decls (i.e,, TYPE_DECLs,
5514 NAMESPACE_DECLs, etc). */
5517 find_decls_types_in_node (struct cgraph_node
*n
, struct free_lang_data_d
*fld
)
5520 struct function
*fn
;
5524 find_decls_types (n
->decl
, fld
);
5526 if (!gimple_has_body_p (n
->decl
))
5529 gcc_assert (current_function_decl
== NULL_TREE
&& cfun
== NULL
);
5531 fn
= DECL_STRUCT_FUNCTION (n
->decl
);
5533 /* Traverse locals. */
5534 FOR_EACH_LOCAL_DECL (fn
, ix
, t
)
5535 find_decls_types (t
, fld
);
5537 /* Traverse EH regions in FN. */
5540 FOR_ALL_EH_REGION_FN (r
, fn
)
5541 find_decls_types_in_eh_region (r
, fld
);
5544 /* Traverse every statement in FN. */
5545 FOR_EACH_BB_FN (bb
, fn
)
5547 gimple_stmt_iterator si
;
5550 for (si
= gsi_start_phis (bb
); !gsi_end_p (si
); gsi_next (&si
))
5552 gimple phi
= gsi_stmt (si
);
5554 for (i
= 0; i
< gimple_phi_num_args (phi
); i
++)
5556 tree
*arg_p
= gimple_phi_arg_def_ptr (phi
, i
);
5557 find_decls_types (*arg_p
, fld
);
5561 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
5563 gimple stmt
= gsi_stmt (si
);
5565 if (is_gimple_call (stmt
))
5566 find_decls_types (gimple_call_fntype (stmt
), fld
);
5568 for (i
= 0; i
< gimple_num_ops (stmt
); i
++)
5570 tree arg
= gimple_op (stmt
, i
);
5571 find_decls_types (arg
, fld
);
5578 /* Find decls and types referenced in varpool node N and store them in
5579 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
5580 look for *every* kind of DECL and TYPE node reachable from N,
5581 including those embedded inside types and decls (i.e,, TYPE_DECLs,
5582 NAMESPACE_DECLs, etc). */
5585 find_decls_types_in_var (varpool_node
*v
, struct free_lang_data_d
*fld
)
5587 find_decls_types (v
->decl
, fld
);
5590 /* If T needs an assembler name, have one created for it. */
5593 assign_assembler_name_if_neeeded (tree t
)
5595 if (need_assembler_name_p (t
))
5597 /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit
5598 diagnostics that use input_location to show locus
5599 information. The problem here is that, at this point,
5600 input_location is generally anchored to the end of the file
5601 (since the parser is long gone), so we don't have a good
5602 position to pin it to.
5604 To alleviate this problem, this uses the location of T's
5605 declaration. Examples of this are
5606 testsuite/g++.dg/template/cond2.C and
5607 testsuite/g++.dg/template/pr35240.C. */
5608 location_t saved_location
= input_location
;
5609 input_location
= DECL_SOURCE_LOCATION (t
);
5611 decl_assembler_name (t
);
5613 input_location
= saved_location
;
5618 /* Free language specific information for every operand and expression
5619 in every node of the call graph. This process operates in three stages:
5621 1- Every callgraph node and varpool node is traversed looking for
5622 decls and types embedded in them. This is a more exhaustive
5623 search than that done by find_referenced_vars, because it will
5624 also collect individual fields, decls embedded in types, etc.
5626 2- All the decls found are sent to free_lang_data_in_decl.
5628 3- All the types found are sent to free_lang_data_in_type.
5630 The ordering between decls and types is important because
5631 free_lang_data_in_decl sets assembler names, which includes
5632 mangling. So types cannot be freed up until assembler names have
5636 free_lang_data_in_cgraph (void)
5638 struct cgraph_node
*n
;
5640 struct free_lang_data_d fld
;
5645 /* Initialize sets and arrays to store referenced decls and types. */
5646 fld
.pset
= new hash_set
<tree
>;
5647 fld
.worklist
.create (0);
5648 fld
.decls
.create (100);
5649 fld
.types
.create (100);
5651 /* Find decls and types in the body of every function in the callgraph. */
5652 FOR_EACH_FUNCTION (n
)
5653 find_decls_types_in_node (n
, &fld
);
5655 FOR_EACH_VEC_SAFE_ELT (alias_pairs
, i
, p
)
5656 find_decls_types (p
->decl
, &fld
);
5658 /* Find decls and types in every varpool symbol. */
5659 FOR_EACH_VARIABLE (v
)
5660 find_decls_types_in_var (v
, &fld
);
5662 /* Set the assembler name on every decl found. We need to do this
5663 now because free_lang_data_in_decl will invalidate data needed
5664 for mangling. This breaks mangling on interdependent decls. */
5665 FOR_EACH_VEC_ELT (fld
.decls
, i
, t
)
5666 assign_assembler_name_if_neeeded (t
);
5668 /* Traverse every decl found freeing its language data. */
5669 FOR_EACH_VEC_ELT (fld
.decls
, i
, t
)
5670 free_lang_data_in_decl (t
);
5672 /* Traverse every type found freeing its language data. */
5673 FOR_EACH_VEC_ELT (fld
.types
, i
, t
)
5674 free_lang_data_in_type (t
);
5677 fld
.worklist
.release ();
5678 fld
.decls
.release ();
5679 fld
.types
.release ();
5683 /* Free resources that are used by FE but are not needed once they are done. */
5686 free_lang_data (void)
5690 /* If we are the LTO frontend we have freed lang-specific data already. */
5692 || !flag_generate_lto
)
5695 /* Allocate and assign alias sets to the standard integer types
5696 while the slots are still in the way the frontends generated them. */
5697 for (i
= 0; i
< itk_none
; ++i
)
5698 if (integer_types
[i
])
5699 TYPE_ALIAS_SET (integer_types
[i
]) = get_alias_set (integer_types
[i
]);
5701 /* Traverse the IL resetting language specific information for
5702 operands, expressions, etc. */
5703 free_lang_data_in_cgraph ();
5705 /* Create gimple variants for common types. */
5706 ptrdiff_type_node
= integer_type_node
;
5707 fileptr_type_node
= ptr_type_node
;
5709 /* Reset some langhooks. Do not reset types_compatible_p, it may
5710 still be used indirectly via the get_alias_set langhook. */
5711 lang_hooks
.dwarf_name
= lhd_dwarf_name
;
5712 lang_hooks
.decl_printable_name
= gimple_decl_printable_name
;
5713 /* We do not want the default decl_assembler_name implementation,
5714 rather if we have fixed everything we want a wrapper around it
5715 asserting that all non-local symbols already got their assembler
5716 name and only produce assembler names for local symbols. Or rather
5717 make sure we never call decl_assembler_name on local symbols and
5718 devise a separate, middle-end private scheme for it. */
5720 /* Reset diagnostic machinery. */
5721 tree_diagnostics_defaults (global_dc
);
5729 const pass_data pass_data_ipa_free_lang_data
=
5731 SIMPLE_IPA_PASS
, /* type */
5732 "*free_lang_data", /* name */
5733 OPTGROUP_NONE
, /* optinfo_flags */
5734 TV_IPA_FREE_LANG_DATA
, /* tv_id */
5735 0, /* properties_required */
5736 0, /* properties_provided */
5737 0, /* properties_destroyed */
5738 0, /* todo_flags_start */
5739 0, /* todo_flags_finish */
5742 class pass_ipa_free_lang_data
: public simple_ipa_opt_pass
5745 pass_ipa_free_lang_data (gcc::context
*ctxt
)
5746 : simple_ipa_opt_pass (pass_data_ipa_free_lang_data
, ctxt
)
5749 /* opt_pass methods: */
5750 virtual unsigned int execute (function
*) { return free_lang_data (); }
5752 }; // class pass_ipa_free_lang_data
5756 simple_ipa_opt_pass
*
5757 make_pass_ipa_free_lang_data (gcc::context
*ctxt
)
5759 return new pass_ipa_free_lang_data (ctxt
);
5762 /* The backbone of is_attribute_p(). ATTR_LEN is the string length of
5763 ATTR_NAME. Also used internally by remove_attribute(). */
5765 private_is_attribute_p (const char *attr_name
, size_t attr_len
, const_tree ident
)
5767 size_t ident_len
= IDENTIFIER_LENGTH (ident
);
5769 if (ident_len
== attr_len
)
5771 if (strcmp (attr_name
, IDENTIFIER_POINTER (ident
)) == 0)
5774 else if (ident_len
== attr_len
+ 4)
5776 /* There is the possibility that ATTR is 'text' and IDENT is
5778 const char *p
= IDENTIFIER_POINTER (ident
);
5779 if (p
[0] == '_' && p
[1] == '_'
5780 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
5781 && strncmp (attr_name
, p
+ 2, attr_len
) == 0)
5788 /* The backbone of lookup_attribute(). ATTR_LEN is the string length
5789 of ATTR_NAME, and LIST is not NULL_TREE. */
5791 private_lookup_attribute (const char *attr_name
, size_t attr_len
, tree list
)
5795 size_t ident_len
= IDENTIFIER_LENGTH (get_attribute_name (list
));
5797 if (ident_len
== attr_len
)
5799 if (!strcmp (attr_name
,
5800 IDENTIFIER_POINTER (get_attribute_name (list
))))
5803 /* TODO: If we made sure that attributes were stored in the
5804 canonical form without '__...__' (ie, as in 'text' as opposed
5805 to '__text__') then we could avoid the following case. */
5806 else if (ident_len
== attr_len
+ 4)
5808 const char *p
= IDENTIFIER_POINTER (get_attribute_name (list
));
5809 if (p
[0] == '_' && p
[1] == '_'
5810 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
5811 && strncmp (attr_name
, p
+ 2, attr_len
) == 0)
5814 list
= TREE_CHAIN (list
);
5820 /* Given an attribute name ATTR_NAME and a list of attributes LIST,
5821 return a pointer to the attribute's list first element if the attribute
5822 starts with ATTR_NAME. ATTR_NAME must be in the form 'text' (not
5826 private_lookup_attribute_by_prefix (const char *attr_name
, size_t attr_len
,
5831 size_t ident_len
= IDENTIFIER_LENGTH (get_attribute_name (list
));
5833 if (attr_len
> ident_len
)
5835 list
= TREE_CHAIN (list
);
5839 const char *p
= IDENTIFIER_POINTER (get_attribute_name (list
));
5841 if (strncmp (attr_name
, p
, attr_len
) == 0)
5844 /* TODO: If we made sure that attributes were stored in the
5845 canonical form without '__...__' (ie, as in 'text' as opposed
5846 to '__text__') then we could avoid the following case. */
5847 if (p
[0] == '_' && p
[1] == '_' &&
5848 strncmp (attr_name
, p
+ 2, attr_len
) == 0)
5851 list
= TREE_CHAIN (list
);
5858 /* A variant of lookup_attribute() that can be used with an identifier
5859 as the first argument, and where the identifier can be either
5860 'text' or '__text__'.
5862 Given an attribute ATTR_IDENTIFIER, and a list of attributes LIST,
5863 return a pointer to the attribute's list element if the attribute
5864 is part of the list, or NULL_TREE if not found. If the attribute
5865 appears more than once, this only returns the first occurrence; the
5866 TREE_CHAIN of the return value should be passed back in if further
5867 occurrences are wanted. ATTR_IDENTIFIER must be an identifier but
5868 can be in the form 'text' or '__text__'. */
5870 lookup_ident_attribute (tree attr_identifier
, tree list
)
5872 gcc_checking_assert (TREE_CODE (attr_identifier
) == IDENTIFIER_NODE
);
5876 gcc_checking_assert (TREE_CODE (get_attribute_name (list
))
5877 == IDENTIFIER_NODE
);
5879 /* Identifiers can be compared directly for equality. */
5880 if (attr_identifier
== get_attribute_name (list
))
5883 /* If they are not equal, they may still be one in the form
5884 'text' while the other one is in the form '__text__'. TODO:
5885 If we were storing attributes in normalized 'text' form, then
5886 this could all go away and we could take full advantage of
5887 the fact that we're comparing identifiers. :-) */
5889 size_t attr_len
= IDENTIFIER_LENGTH (attr_identifier
);
5890 size_t ident_len
= IDENTIFIER_LENGTH (get_attribute_name (list
));
5892 if (ident_len
== attr_len
+ 4)
5894 const char *p
= IDENTIFIER_POINTER (get_attribute_name (list
));
5895 const char *q
= IDENTIFIER_POINTER (attr_identifier
);
5896 if (p
[0] == '_' && p
[1] == '_'
5897 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
5898 && strncmp (q
, p
+ 2, attr_len
) == 0)
5901 else if (ident_len
+ 4 == attr_len
)
5903 const char *p
= IDENTIFIER_POINTER (get_attribute_name (list
));
5904 const char *q
= IDENTIFIER_POINTER (attr_identifier
);
5905 if (q
[0] == '_' && q
[1] == '_'
5906 && q
[attr_len
- 2] == '_' && q
[attr_len
- 1] == '_'
5907 && strncmp (q
+ 2, p
, ident_len
) == 0)
5911 list
= TREE_CHAIN (list
);
5917 /* Remove any instances of attribute ATTR_NAME in LIST and return the
5921 remove_attribute (const char *attr_name
, tree list
)
5924 size_t attr_len
= strlen (attr_name
);
5926 gcc_checking_assert (attr_name
[0] != '_');
5928 for (p
= &list
; *p
; )
5931 /* TODO: If we were storing attributes in normalized form, here
5932 we could use a simple strcmp(). */
5933 if (private_is_attribute_p (attr_name
, attr_len
, get_attribute_name (l
)))
5934 *p
= TREE_CHAIN (l
);
5936 p
= &TREE_CHAIN (l
);
5942 /* Return an attribute list that is the union of a1 and a2. */
5945 merge_attributes (tree a1
, tree a2
)
5949 /* Either one unset? Take the set one. */
5951 if ((attributes
= a1
) == 0)
5954 /* One that completely contains the other? Take it. */
5956 else if (a2
!= 0 && ! attribute_list_contained (a1
, a2
))
5958 if (attribute_list_contained (a2
, a1
))
5962 /* Pick the longest list, and hang on the other list. */
5964 if (list_length (a1
) < list_length (a2
))
5965 attributes
= a2
, a2
= a1
;
5967 for (; a2
!= 0; a2
= TREE_CHAIN (a2
))
5970 for (a
= lookup_ident_attribute (get_attribute_name (a2
),
5972 a
!= NULL_TREE
&& !attribute_value_equal (a
, a2
);
5973 a
= lookup_ident_attribute (get_attribute_name (a2
),
5978 a1
= copy_node (a2
);
5979 TREE_CHAIN (a1
) = attributes
;
5988 /* Given types T1 and T2, merge their attributes and return
5992 merge_type_attributes (tree t1
, tree t2
)
5994 return merge_attributes (TYPE_ATTRIBUTES (t1
),
5995 TYPE_ATTRIBUTES (t2
));
5998 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
6002 merge_decl_attributes (tree olddecl
, tree newdecl
)
6004 return merge_attributes (DECL_ATTRIBUTES (olddecl
),
6005 DECL_ATTRIBUTES (newdecl
));
6008 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
6010 /* Specialization of merge_decl_attributes for various Windows targets.
6012 This handles the following situation:
6014 __declspec (dllimport) int foo;
6017 The second instance of `foo' nullifies the dllimport. */
6020 merge_dllimport_decl_attributes (tree old
, tree new_tree
)
6023 int delete_dllimport_p
= 1;
6025 /* What we need to do here is remove from `old' dllimport if it doesn't
6026 appear in `new'. dllimport behaves like extern: if a declaration is
6027 marked dllimport and a definition appears later, then the object
6028 is not dllimport'd. We also remove a `new' dllimport if the old list
6029 contains dllexport: dllexport always overrides dllimport, regardless
6030 of the order of declaration. */
6031 if (!VAR_OR_FUNCTION_DECL_P (new_tree
))
6032 delete_dllimport_p
= 0;
6033 else if (DECL_DLLIMPORT_P (new_tree
)
6034 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (old
)))
6036 DECL_DLLIMPORT_P (new_tree
) = 0;
6037 warning (OPT_Wattributes
, "%q+D already declared with dllexport attribute: "
6038 "dllimport ignored", new_tree
);
6040 else if (DECL_DLLIMPORT_P (old
) && !DECL_DLLIMPORT_P (new_tree
))
6042 /* Warn about overriding a symbol that has already been used, e.g.:
6043 extern int __attribute__ ((dllimport)) foo;
6044 int* bar () {return &foo;}
6047 if (TREE_USED (old
))
6049 warning (0, "%q+D redeclared without dllimport attribute "
6050 "after being referenced with dll linkage", new_tree
);
6051 /* If we have used a variable's address with dllimport linkage,
6052 keep the old DECL_DLLIMPORT_P flag: the ADDR_EXPR using the
6053 decl may already have had TREE_CONSTANT computed.
6054 We still remove the attribute so that assembler code refers
6055 to '&foo rather than '_imp__foo'. */
6056 if (TREE_CODE (old
) == VAR_DECL
&& TREE_ADDRESSABLE (old
))
6057 DECL_DLLIMPORT_P (new_tree
) = 1;
6060 /* Let an inline definition silently override the external reference,
6061 but otherwise warn about attribute inconsistency. */
6062 else if (TREE_CODE (new_tree
) == VAR_DECL
6063 || !DECL_DECLARED_INLINE_P (new_tree
))
6064 warning (OPT_Wattributes
, "%q+D redeclared without dllimport attribute: "
6065 "previous dllimport ignored", new_tree
);
6068 delete_dllimport_p
= 0;
6070 a
= merge_attributes (DECL_ATTRIBUTES (old
), DECL_ATTRIBUTES (new_tree
));
6072 if (delete_dllimport_p
)
6073 a
= remove_attribute ("dllimport", a
);
6078 /* Handle a "dllimport" or "dllexport" attribute; arguments as in
6079 struct attribute_spec.handler. */
6082 handle_dll_attribute (tree
* pnode
, tree name
, tree args
, int flags
,
6088 /* These attributes may apply to structure and union types being created,
6089 but otherwise should pass to the declaration involved. */
6092 if (flags
& ((int) ATTR_FLAG_DECL_NEXT
| (int) ATTR_FLAG_FUNCTION_NEXT
6093 | (int) ATTR_FLAG_ARRAY_NEXT
))
6095 *no_add_attrs
= true;
6096 return tree_cons (name
, args
, NULL_TREE
);
6098 if (TREE_CODE (node
) == RECORD_TYPE
6099 || TREE_CODE (node
) == UNION_TYPE
)
6101 node
= TYPE_NAME (node
);
6107 warning (OPT_Wattributes
, "%qE attribute ignored",
6109 *no_add_attrs
= true;
6114 if (TREE_CODE (node
) != FUNCTION_DECL
6115 && TREE_CODE (node
) != VAR_DECL
6116 && TREE_CODE (node
) != TYPE_DECL
)
6118 *no_add_attrs
= true;
6119 warning (OPT_Wattributes
, "%qE attribute ignored",
6124 if (TREE_CODE (node
) == TYPE_DECL
6125 && TREE_CODE (TREE_TYPE (node
)) != RECORD_TYPE
6126 && TREE_CODE (TREE_TYPE (node
)) != UNION_TYPE
)
6128 *no_add_attrs
= true;
6129 warning (OPT_Wattributes
, "%qE attribute ignored",
6134 is_dllimport
= is_attribute_p ("dllimport", name
);
6136 /* Report error on dllimport ambiguities seen now before they cause
6140 /* Honor any target-specific overrides. */
6141 if (!targetm
.valid_dllimport_attribute_p (node
))
6142 *no_add_attrs
= true;
6144 else if (TREE_CODE (node
) == FUNCTION_DECL
6145 && DECL_DECLARED_INLINE_P (node
))
6147 warning (OPT_Wattributes
, "inline function %q+D declared as "
6148 " dllimport: attribute ignored", node
);
6149 *no_add_attrs
= true;
6151 /* Like MS, treat definition of dllimported variables and
6152 non-inlined functions on declaration as syntax errors. */
6153 else if (TREE_CODE (node
) == FUNCTION_DECL
&& DECL_INITIAL (node
))
6155 error ("function %q+D definition is marked dllimport", node
);
6156 *no_add_attrs
= true;
6159 else if (TREE_CODE (node
) == VAR_DECL
)
6161 if (DECL_INITIAL (node
))
6163 error ("variable %q+D definition is marked dllimport",
6165 *no_add_attrs
= true;
6168 /* `extern' needn't be specified with dllimport.
6169 Specify `extern' now and hope for the best. Sigh. */
6170 DECL_EXTERNAL (node
) = 1;
6171 /* Also, implicitly give dllimport'd variables declared within
6172 a function global scope, unless declared static. */
6173 if (current_function_decl
!= NULL_TREE
&& !TREE_STATIC (node
))
6174 TREE_PUBLIC (node
) = 1;
6177 if (*no_add_attrs
== false)
6178 DECL_DLLIMPORT_P (node
) = 1;
6180 else if (TREE_CODE (node
) == FUNCTION_DECL
6181 && DECL_DECLARED_INLINE_P (node
)
6182 && flag_keep_inline_dllexport
)
6183 /* An exported function, even if inline, must be emitted. */
6184 DECL_EXTERNAL (node
) = 0;
6186 /* Report error if symbol is not accessible at global scope. */
6187 if (!TREE_PUBLIC (node
)
6188 && (TREE_CODE (node
) == VAR_DECL
6189 || TREE_CODE (node
) == FUNCTION_DECL
))
6191 error ("external linkage required for symbol %q+D because of "
6192 "%qE attribute", node
, name
);
6193 *no_add_attrs
= true;
6196 /* A dllexport'd entity must have default visibility so that other
6197 program units (shared libraries or the main executable) can see
6198 it. A dllimport'd entity must have default visibility so that
6199 the linker knows that undefined references within this program
6200 unit can be resolved by the dynamic linker. */
6203 if (DECL_VISIBILITY_SPECIFIED (node
)
6204 && DECL_VISIBILITY (node
) != VISIBILITY_DEFAULT
)
6205 error ("%qE implies default visibility, but %qD has already "
6206 "been declared with a different visibility",
6208 DECL_VISIBILITY (node
) = VISIBILITY_DEFAULT
;
6209 DECL_VISIBILITY_SPECIFIED (node
) = 1;
6215 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
6217 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
6218 of the various TYPE_QUAL values. */
6221 set_type_quals (tree type
, int type_quals
)
6223 TYPE_READONLY (type
) = (type_quals
& TYPE_QUAL_CONST
) != 0;
6224 TYPE_VOLATILE (type
) = (type_quals
& TYPE_QUAL_VOLATILE
) != 0;
6225 TYPE_RESTRICT (type
) = (type_quals
& TYPE_QUAL_RESTRICT
) != 0;
6226 TYPE_ATOMIC (type
) = (type_quals
& TYPE_QUAL_ATOMIC
) != 0;
6227 TYPE_ADDR_SPACE (type
) = DECODE_QUAL_ADDR_SPACE (type_quals
);
6230 /* Returns true iff unqualified CAND and BASE are equivalent. */
6233 check_base_type (const_tree cand
, const_tree base
)
6235 return (TYPE_NAME (cand
) == TYPE_NAME (base
)
6236 /* Apparently this is needed for Objective-C. */
6237 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
6238 /* Check alignment. */
6239 && TYPE_ALIGN (cand
) == TYPE_ALIGN (base
)
6240 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
6241 TYPE_ATTRIBUTES (base
)));
6244 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
6247 check_qualified_type (const_tree cand
, const_tree base
, int type_quals
)
6249 return (TYPE_QUALS (cand
) == type_quals
6250 && check_base_type (cand
, base
));
6253 /* Returns true iff CAND is equivalent to BASE with ALIGN. */
6256 check_aligned_type (const_tree cand
, const_tree base
, unsigned int align
)
6258 return (TYPE_QUALS (cand
) == TYPE_QUALS (base
)
6259 && TYPE_NAME (cand
) == TYPE_NAME (base
)
6260 /* Apparently this is needed for Objective-C. */
6261 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
6262 /* Check alignment. */
6263 && TYPE_ALIGN (cand
) == align
6264 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
6265 TYPE_ATTRIBUTES (base
)));
6268 /* This function checks to see if TYPE matches the size one of the built-in
6269 atomic types, and returns that core atomic type. */
6272 find_atomic_core_type (tree type
)
6274 tree base_atomic_type
;
6276 /* Only handle complete types. */
6277 if (TYPE_SIZE (type
) == NULL_TREE
)
6280 HOST_WIDE_INT type_size
= tree_to_uhwi (TYPE_SIZE (type
));
6284 base_atomic_type
= atomicQI_type_node
;
6288 base_atomic_type
= atomicHI_type_node
;
6292 base_atomic_type
= atomicSI_type_node
;
6296 base_atomic_type
= atomicDI_type_node
;
6300 base_atomic_type
= atomicTI_type_node
;
6304 base_atomic_type
= NULL_TREE
;
6307 return base_atomic_type
;
6310 /* Return a version of the TYPE, qualified as indicated by the
6311 TYPE_QUALS, if one exists. If no qualified version exists yet,
6312 return NULL_TREE. */
6315 get_qualified_type (tree type
, int type_quals
)
6319 if (TYPE_QUALS (type
) == type_quals
)
6322 /* Search the chain of variants to see if there is already one there just
6323 like the one we need to have. If so, use that existing one. We must
6324 preserve the TYPE_NAME, since there is code that depends on this. */
6325 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
6326 if (check_qualified_type (t
, type
, type_quals
))
6332 /* Like get_qualified_type, but creates the type if it does not
6333 exist. This function never returns NULL_TREE. */
6336 build_qualified_type (tree type
, int type_quals
)
6340 /* See if we already have the appropriate qualified variant. */
6341 t
= get_qualified_type (type
, type_quals
);
6343 /* If not, build it. */
6346 t
= build_variant_type_copy (type
);
6347 set_type_quals (t
, type_quals
);
6349 if (((type_quals
& TYPE_QUAL_ATOMIC
) == TYPE_QUAL_ATOMIC
))
6351 /* See if this object can map to a basic atomic type. */
6352 tree atomic_type
= find_atomic_core_type (type
);
6355 /* Ensure the alignment of this type is compatible with
6356 the required alignment of the atomic type. */
6357 if (TYPE_ALIGN (atomic_type
) > TYPE_ALIGN (t
))
6358 TYPE_ALIGN (t
) = TYPE_ALIGN (atomic_type
);
6362 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
6363 /* Propagate structural equality. */
6364 SET_TYPE_STRUCTURAL_EQUALITY (t
);
6365 else if (TYPE_CANONICAL (type
) != type
)
6366 /* Build the underlying canonical type, since it is different
6369 tree c
= build_qualified_type (TYPE_CANONICAL (type
), type_quals
);
6370 TYPE_CANONICAL (t
) = TYPE_CANONICAL (c
);
6373 /* T is its own canonical type. */
6374 TYPE_CANONICAL (t
) = t
;
6381 /* Create a variant of type T with alignment ALIGN. */
6384 build_aligned_type (tree type
, unsigned int align
)
6388 if (TYPE_PACKED (type
)
6389 || TYPE_ALIGN (type
) == align
)
6392 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
6393 if (check_aligned_type (t
, type
, align
))
6396 t
= build_variant_type_copy (type
);
6397 TYPE_ALIGN (t
) = align
;
6402 /* Create a new distinct copy of TYPE. The new type is made its own
6403 MAIN_VARIANT. If TYPE requires structural equality checks, the
6404 resulting type requires structural equality checks; otherwise, its
6405 TYPE_CANONICAL points to itself. */
6408 build_distinct_type_copy (tree type
)
6410 tree t
= copy_node (type
);
6412 TYPE_POINTER_TO (t
) = 0;
6413 TYPE_REFERENCE_TO (t
) = 0;
6415 /* Set the canonical type either to a new equivalence class, or
6416 propagate the need for structural equality checks. */
6417 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
6418 SET_TYPE_STRUCTURAL_EQUALITY (t
);
6420 TYPE_CANONICAL (t
) = t
;
6422 /* Make it its own variant. */
6423 TYPE_MAIN_VARIANT (t
) = t
;
6424 TYPE_NEXT_VARIANT (t
) = 0;
6426 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
6427 whose TREE_TYPE is not t. This can also happen in the Ada
6428 frontend when using subtypes. */
6433 /* Create a new variant of TYPE, equivalent but distinct. This is so
6434 the caller can modify it. TYPE_CANONICAL for the return type will
6435 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
6436 are considered equal by the language itself (or that both types
6437 require structural equality checks). */
6440 build_variant_type_copy (tree type
)
6442 tree t
, m
= TYPE_MAIN_VARIANT (type
);
6444 t
= build_distinct_type_copy (type
);
6446 /* Since we're building a variant, assume that it is a non-semantic
6447 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
6448 TYPE_CANONICAL (t
) = TYPE_CANONICAL (type
);
6450 /* Add the new type to the chain of variants of TYPE. */
6451 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (m
);
6452 TYPE_NEXT_VARIANT (m
) = t
;
6453 TYPE_MAIN_VARIANT (t
) = m
;
6458 /* Return true if the from tree in both tree maps are equal. */
6461 tree_map_base_eq (const void *va
, const void *vb
)
6463 const struct tree_map_base
*const a
= (const struct tree_map_base
*) va
,
6464 *const b
= (const struct tree_map_base
*) vb
;
6465 return (a
->from
== b
->from
);
6468 /* Hash a from tree in a tree_base_map. */
6471 tree_map_base_hash (const void *item
)
6473 return htab_hash_pointer (((const struct tree_map_base
*)item
)->from
);
6476 /* Return true if this tree map structure is marked for garbage collection
6477 purposes. We simply return true if the from tree is marked, so that this
6478 structure goes away when the from tree goes away. */
6481 tree_map_base_marked_p (const void *p
)
6483 return ggc_marked_p (((const struct tree_map_base
*) p
)->from
);
6486 /* Hash a from tree in a tree_map. */
6489 tree_map_hash (const void *item
)
6491 return (((const struct tree_map
*) item
)->hash
);
6494 /* Hash a from tree in a tree_decl_map. */
6497 tree_decl_map_hash (const void *item
)
6499 return DECL_UID (((const struct tree_decl_map
*) item
)->base
.from
);
6502 /* Return the initialization priority for DECL. */
6505 decl_init_priority_lookup (tree decl
)
6507 symtab_node
*snode
= symtab_node::get (decl
);
6510 return DEFAULT_INIT_PRIORITY
;
6512 snode
->get_init_priority ();
6515 /* Return the finalization priority for DECL. */
6518 decl_fini_priority_lookup (tree decl
)
6520 cgraph_node
*node
= cgraph_node::get (decl
);
6523 return DEFAULT_INIT_PRIORITY
;
6525 node
->get_fini_priority ();
6528 /* Set the initialization priority for DECL to PRIORITY. */
6531 decl_init_priority_insert (tree decl
, priority_type priority
)
6533 struct symtab_node
*snode
;
6535 if (priority
== DEFAULT_INIT_PRIORITY
)
6537 snode
= symtab_node::get (decl
);
6541 else if (TREE_CODE (decl
) == VAR_DECL
)
6542 snode
= varpool_node::get_create (decl
);
6544 snode
= cgraph_node::get_create (decl
);
6545 snode
->set_init_priority (priority
);
6548 /* Set the finalization priority for DECL to PRIORITY. */
6551 decl_fini_priority_insert (tree decl
, priority_type priority
)
6553 struct cgraph_node
*node
;
6555 if (priority
== DEFAULT_INIT_PRIORITY
)
6557 node
= cgraph_node::get (decl
);
6562 node
= cgraph_node::get_create (decl
);
6563 node
->set_fini_priority (priority
);
6566 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
6569 print_debug_expr_statistics (void)
6571 fprintf (stderr
, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
6572 (long) htab_size (debug_expr_for_decl
),
6573 (long) htab_elements (debug_expr_for_decl
),
6574 htab_collisions (debug_expr_for_decl
));
6577 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
6580 print_value_expr_statistics (void)
6582 fprintf (stderr
, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
6583 (long) htab_size (value_expr_for_decl
),
6584 (long) htab_elements (value_expr_for_decl
),
6585 htab_collisions (value_expr_for_decl
));
6588 /* Lookup a debug expression for FROM, and return it if we find one. */
6591 decl_debug_expr_lookup (tree from
)
6593 struct tree_decl_map
*h
, in
;
6594 in
.base
.from
= from
;
6596 h
= (struct tree_decl_map
*)
6597 htab_find_with_hash (debug_expr_for_decl
, &in
, DECL_UID (from
));
6603 /* Insert a mapping FROM->TO in the debug expression hashtable. */
6606 decl_debug_expr_insert (tree from
, tree to
)
6608 struct tree_decl_map
*h
;
6611 h
= ggc_alloc
<tree_decl_map
> ();
6612 h
->base
.from
= from
;
6614 loc
= htab_find_slot_with_hash (debug_expr_for_decl
, h
, DECL_UID (from
),
6616 *(struct tree_decl_map
**) loc
= h
;
6619 /* Lookup a value expression for FROM, and return it if we find one. */
6622 decl_value_expr_lookup (tree from
)
6624 struct tree_decl_map
*h
, in
;
6625 in
.base
.from
= from
;
6627 h
= (struct tree_decl_map
*)
6628 htab_find_with_hash (value_expr_for_decl
, &in
, DECL_UID (from
));
6634 /* Insert a mapping FROM->TO in the value expression hashtable. */
6637 decl_value_expr_insert (tree from
, tree to
)
6639 struct tree_decl_map
*h
;
6642 h
= ggc_alloc
<tree_decl_map
> ();
6643 h
->base
.from
= from
;
6645 loc
= htab_find_slot_with_hash (value_expr_for_decl
, h
, DECL_UID (from
),
6647 *(struct tree_decl_map
**) loc
= h
;
6650 /* Lookup a vector of debug arguments for FROM, and return it if we
6654 decl_debug_args_lookup (tree from
)
6656 struct tree_vec_map
*h
, in
;
6658 if (!DECL_HAS_DEBUG_ARGS_P (from
))
6660 gcc_checking_assert (debug_args_for_decl
!= NULL
);
6661 in
.base
.from
= from
;
6662 h
= (struct tree_vec_map
*)
6663 htab_find_with_hash (debug_args_for_decl
, &in
, DECL_UID (from
));
6669 /* Insert a mapping FROM->empty vector of debug arguments in the value
6670 expression hashtable. */
6673 decl_debug_args_insert (tree from
)
6675 struct tree_vec_map
*h
;
6678 if (DECL_HAS_DEBUG_ARGS_P (from
))
6679 return decl_debug_args_lookup (from
);
6680 if (debug_args_for_decl
== NULL
)
6681 debug_args_for_decl
= htab_create_ggc (64, tree_vec_map_hash
,
6682 tree_vec_map_eq
, 0);
6683 h
= ggc_alloc
<tree_vec_map
> ();
6684 h
->base
.from
= from
;
6686 loc
= htab_find_slot_with_hash (debug_args_for_decl
, h
, DECL_UID (from
),
6688 *(struct tree_vec_map
**) loc
= h
;
6689 DECL_HAS_DEBUG_ARGS_P (from
) = 1;
6693 /* Hashing of types so that we don't make duplicates.
6694 The entry point is `type_hash_canon'. */
6696 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
6697 with types in the TREE_VALUE slots), by adding the hash codes
6698 of the individual types. */
6701 type_hash_list (const_tree list
, inchash::hash
&hstate
)
6705 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
6706 if (TREE_VALUE (tail
) != error_mark_node
)
6707 hstate
.add_object (TYPE_HASH (TREE_VALUE (tail
)));
6710 /* These are the Hashtable callback functions. */
6712 /* Returns true iff the types are equivalent. */
6715 type_hash_eq (const void *va
, const void *vb
)
6717 const struct type_hash
*const a
= (const struct type_hash
*) va
,
6718 *const b
= (const struct type_hash
*) vb
;
6720 /* First test the things that are the same for all types. */
6721 if (a
->hash
!= b
->hash
6722 || TREE_CODE (a
->type
) != TREE_CODE (b
->type
)
6723 || TREE_TYPE (a
->type
) != TREE_TYPE (b
->type
)
6724 || !attribute_list_equal (TYPE_ATTRIBUTES (a
->type
),
6725 TYPE_ATTRIBUTES (b
->type
))
6726 || (TREE_CODE (a
->type
) != COMPLEX_TYPE
6727 && TYPE_NAME (a
->type
) != TYPE_NAME (b
->type
)))
6730 /* Be careful about comparing arrays before and after the element type
6731 has been completed; don't compare TYPE_ALIGN unless both types are
6733 if (COMPLETE_TYPE_P (a
->type
) && COMPLETE_TYPE_P (b
->type
)
6734 && (TYPE_ALIGN (a
->type
) != TYPE_ALIGN (b
->type
)
6735 || TYPE_MODE (a
->type
) != TYPE_MODE (b
->type
)))
6738 switch (TREE_CODE (a
->type
))
6743 case REFERENCE_TYPE
:
6748 return TYPE_VECTOR_SUBPARTS (a
->type
) == TYPE_VECTOR_SUBPARTS (b
->type
);
6751 if (TYPE_VALUES (a
->type
) != TYPE_VALUES (b
->type
)
6752 && !(TYPE_VALUES (a
->type
)
6753 && TREE_CODE (TYPE_VALUES (a
->type
)) == TREE_LIST
6754 && TYPE_VALUES (b
->type
)
6755 && TREE_CODE (TYPE_VALUES (b
->type
)) == TREE_LIST
6756 && type_list_equal (TYPE_VALUES (a
->type
),
6757 TYPE_VALUES (b
->type
))))
6760 /* ... fall through ... */
6765 if (TYPE_PRECISION (a
->type
) != TYPE_PRECISION (b
->type
))
6767 return ((TYPE_MAX_VALUE (a
->type
) == TYPE_MAX_VALUE (b
->type
)
6768 || tree_int_cst_equal (TYPE_MAX_VALUE (a
->type
),
6769 TYPE_MAX_VALUE (b
->type
)))
6770 && (TYPE_MIN_VALUE (a
->type
) == TYPE_MIN_VALUE (b
->type
)
6771 || tree_int_cst_equal (TYPE_MIN_VALUE (a
->type
),
6772 TYPE_MIN_VALUE (b
->type
))));
6774 case FIXED_POINT_TYPE
:
6775 return TYPE_SATURATING (a
->type
) == TYPE_SATURATING (b
->type
);
6778 return TYPE_OFFSET_BASETYPE (a
->type
) == TYPE_OFFSET_BASETYPE (b
->type
);
6781 if (TYPE_METHOD_BASETYPE (a
->type
) == TYPE_METHOD_BASETYPE (b
->type
)
6782 && (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
6783 || (TYPE_ARG_TYPES (a
->type
)
6784 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
6785 && TYPE_ARG_TYPES (b
->type
)
6786 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
6787 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
6788 TYPE_ARG_TYPES (b
->type
)))))
6792 return TYPE_DOMAIN (a
->type
) == TYPE_DOMAIN (b
->type
);
6796 case QUAL_UNION_TYPE
:
6797 return (TYPE_FIELDS (a
->type
) == TYPE_FIELDS (b
->type
)
6798 || (TYPE_FIELDS (a
->type
)
6799 && TREE_CODE (TYPE_FIELDS (a
->type
)) == TREE_LIST
6800 && TYPE_FIELDS (b
->type
)
6801 && TREE_CODE (TYPE_FIELDS (b
->type
)) == TREE_LIST
6802 && type_list_equal (TYPE_FIELDS (a
->type
),
6803 TYPE_FIELDS (b
->type
))));
6806 if (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
6807 || (TYPE_ARG_TYPES (a
->type
)
6808 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
6809 && TYPE_ARG_TYPES (b
->type
)
6810 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
6811 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
6812 TYPE_ARG_TYPES (b
->type
))))
6820 if (lang_hooks
.types
.type_hash_eq
!= NULL
)
6821 return lang_hooks
.types
.type_hash_eq (a
->type
, b
->type
);
6826 /* Return the cached hash value. */
6829 type_hash_hash (const void *item
)
6831 return ((const struct type_hash
*) item
)->hash
;
6834 /* Given TYPE, and HASHCODE its hash code, return the canonical
6835 object for an identical type if one already exists.
6836 Otherwise, return TYPE, and record it as the canonical object.
6838 To use this function, first create a type of the sort you want.
6839 Then compute its hash code from the fields of the type that
6840 make it different from other similar types.
6841 Then call this function and use the value. */
6844 type_hash_canon (unsigned int hashcode
, tree type
)
6849 /* The hash table only contains main variants, so ensure that's what we're
6851 gcc_assert (TYPE_MAIN_VARIANT (type
) == type
);
6853 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
6854 must call that routine before comparing TYPE_ALIGNs. */
6860 loc
= htab_find_slot_with_hash (type_hash_table
, &in
, hashcode
, INSERT
);
6863 tree t1
= ((type_hash
*) *loc
)->type
;
6864 gcc_assert (TYPE_MAIN_VARIANT (t1
) == t1
);
6865 if (GATHER_STATISTICS
)
6867 tree_code_counts
[(int) TREE_CODE (type
)]--;
6868 tree_node_counts
[(int) t_kind
]--;
6869 tree_node_sizes
[(int) t_kind
] -= sizeof (struct tree_type_non_common
);
6875 struct type_hash
*h
;
6877 h
= ggc_alloc
<type_hash
> ();
6886 /* See if the data pointed to by the type hash table is marked. We consider
6887 it marked if the type is marked or if a debug type number or symbol
6888 table entry has been made for the type. */
6891 type_hash_marked_p (const void *p
)
6893 const_tree
const type
= ((const struct type_hash
*) p
)->type
;
6895 return ggc_marked_p (type
);
6899 print_type_hash_statistics (void)
6901 fprintf (stderr
, "Type hash: size %ld, %ld elements, %f collisions\n",
6902 (long) htab_size (type_hash_table
),
6903 (long) htab_elements (type_hash_table
),
6904 htab_collisions (type_hash_table
));
6907 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
6908 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
6909 by adding the hash codes of the individual attributes. */
6912 attribute_hash_list (const_tree list
, inchash::hash
&hstate
)
6916 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
6917 /* ??? Do we want to add in TREE_VALUE too? */
6918 hstate
.add_object (IDENTIFIER_HASH_VALUE (get_attribute_name (tail
)));
6921 /* Given two lists of attributes, return true if list l2 is
6922 equivalent to l1. */
6925 attribute_list_equal (const_tree l1
, const_tree l2
)
6930 return attribute_list_contained (l1
, l2
)
6931 && attribute_list_contained (l2
, l1
);
6934 /* Given two lists of attributes, return true if list L2 is
6935 completely contained within L1. */
6936 /* ??? This would be faster if attribute names were stored in a canonicalized
6937 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
6938 must be used to show these elements are equivalent (which they are). */
6939 /* ??? It's not clear that attributes with arguments will always be handled
6943 attribute_list_contained (const_tree l1
, const_tree l2
)
6947 /* First check the obvious, maybe the lists are identical. */
6951 /* Maybe the lists are similar. */
6952 for (t1
= l1
, t2
= l2
;
6954 && get_attribute_name (t1
) == get_attribute_name (t2
)
6955 && TREE_VALUE (t1
) == TREE_VALUE (t2
);
6956 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
6959 /* Maybe the lists are equal. */
6960 if (t1
== 0 && t2
== 0)
6963 for (; t2
!= 0; t2
= TREE_CHAIN (t2
))
6966 /* This CONST_CAST is okay because lookup_attribute does not
6967 modify its argument and the return value is assigned to a
6969 for (attr
= lookup_ident_attribute (get_attribute_name (t2
),
6970 CONST_CAST_TREE (l1
));
6971 attr
!= NULL_TREE
&& !attribute_value_equal (t2
, attr
);
6972 attr
= lookup_ident_attribute (get_attribute_name (t2
),
6976 if (attr
== NULL_TREE
)
6983 /* Given two lists of types
6984 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
6985 return 1 if the lists contain the same types in the same order.
6986 Also, the TREE_PURPOSEs must match. */
6989 type_list_equal (const_tree l1
, const_tree l2
)
6993 for (t1
= l1
, t2
= l2
; t1
&& t2
; t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
6994 if (TREE_VALUE (t1
) != TREE_VALUE (t2
)
6995 || (TREE_PURPOSE (t1
) != TREE_PURPOSE (t2
)
6996 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
))
6997 && (TREE_TYPE (TREE_PURPOSE (t1
))
6998 == TREE_TYPE (TREE_PURPOSE (t2
))))))
7004 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
7005 given by TYPE. If the argument list accepts variable arguments,
7006 then this function counts only the ordinary arguments. */
7009 type_num_arguments (const_tree type
)
7014 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
7015 /* If the function does not take a variable number of arguments,
7016 the last element in the list will have type `void'. */
7017 if (VOID_TYPE_P (TREE_VALUE (t
)))
7025 /* Nonzero if integer constants T1 and T2
7026 represent the same constant value. */
7029 tree_int_cst_equal (const_tree t1
, const_tree t2
)
7034 if (t1
== 0 || t2
== 0)
7037 if (TREE_CODE (t1
) == INTEGER_CST
7038 && TREE_CODE (t2
) == INTEGER_CST
7039 && wi::to_widest (t1
) == wi::to_widest (t2
))
7045 /* Return true if T is an INTEGER_CST whose numerical value (extended
7046 according to TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. */
7049 tree_fits_shwi_p (const_tree t
)
7051 return (t
!= NULL_TREE
7052 && TREE_CODE (t
) == INTEGER_CST
7053 && wi::fits_shwi_p (wi::to_widest (t
)));
7056 /* Return true if T is an INTEGER_CST whose numerical value (extended
7057 according to TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. */
7060 tree_fits_uhwi_p (const_tree t
)
7062 return (t
!= NULL_TREE
7063 && TREE_CODE (t
) == INTEGER_CST
7064 && wi::fits_uhwi_p (wi::to_widest (t
)));
7067 /* T is an INTEGER_CST whose numerical value (extended according to
7068 TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. Return that
7072 tree_to_shwi (const_tree t
)
7074 gcc_assert (tree_fits_shwi_p (t
));
7075 return TREE_INT_CST_LOW (t
);
7078 /* T is an INTEGER_CST whose numerical value (extended according to
7079 TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. Return that
7082 unsigned HOST_WIDE_INT
7083 tree_to_uhwi (const_tree t
)
7085 gcc_assert (tree_fits_uhwi_p (t
));
7086 return TREE_INT_CST_LOW (t
);
7089 /* Return the most significant (sign) bit of T. */
7092 tree_int_cst_sign_bit (const_tree t
)
7094 unsigned bitno
= TYPE_PRECISION (TREE_TYPE (t
)) - 1;
7096 return wi::extract_uhwi (t
, bitno
, 1);
7099 /* Return an indication of the sign of the integer constant T.
7100 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
7101 Note that -1 will never be returned if T's type is unsigned. */
7104 tree_int_cst_sgn (const_tree t
)
7106 if (wi::eq_p (t
, 0))
7108 else if (TYPE_UNSIGNED (TREE_TYPE (t
)))
7110 else if (wi::neg_p (t
))
7116 /* Return the minimum number of bits needed to represent VALUE in a
7117 signed or unsigned type, UNSIGNEDP says which. */
7120 tree_int_cst_min_precision (tree value
, signop sgn
)
7122 /* If the value is negative, compute its negative minus 1. The latter
7123 adjustment is because the absolute value of the largest negative value
7124 is one larger than the largest positive value. This is equivalent to
7125 a bit-wise negation, so use that operation instead. */
7127 if (tree_int_cst_sgn (value
) < 0)
7128 value
= fold_build1 (BIT_NOT_EXPR
, TREE_TYPE (value
), value
);
7130 /* Return the number of bits needed, taking into account the fact
7131 that we need one more bit for a signed than unsigned type.
7132 If value is 0 or -1, the minimum precision is 1 no matter
7133 whether unsignedp is true or false. */
7135 if (integer_zerop (value
))
7138 return tree_floor_log2 (value
) + 1 + (sgn
== SIGNED
? 1 : 0) ;
7141 /* Return truthvalue of whether T1 is the same tree structure as T2.
7142 Return 1 if they are the same.
7143 Return 0 if they are understandably different.
7144 Return -1 if either contains tree structure not understood by
7148 simple_cst_equal (const_tree t1
, const_tree t2
)
7150 enum tree_code code1
, code2
;
7156 if (t1
== 0 || t2
== 0)
7159 code1
= TREE_CODE (t1
);
7160 code2
= TREE_CODE (t2
);
7162 if (CONVERT_EXPR_CODE_P (code1
) || code1
== NON_LVALUE_EXPR
)
7164 if (CONVERT_EXPR_CODE_P (code2
)
7165 || code2
== NON_LVALUE_EXPR
)
7166 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7168 return simple_cst_equal (TREE_OPERAND (t1
, 0), t2
);
7171 else if (CONVERT_EXPR_CODE_P (code2
)
7172 || code2
== NON_LVALUE_EXPR
)
7173 return simple_cst_equal (t1
, TREE_OPERAND (t2
, 0));
7181 return wi::to_widest (t1
) == wi::to_widest (t2
);
7184 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1
), TREE_REAL_CST (t2
));
7187 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1
), TREE_FIXED_CST (t2
));
7190 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
7191 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
7192 TREE_STRING_LENGTH (t1
)));
7196 unsigned HOST_WIDE_INT idx
;
7197 vec
<constructor_elt
, va_gc
> *v1
= CONSTRUCTOR_ELTS (t1
);
7198 vec
<constructor_elt
, va_gc
> *v2
= CONSTRUCTOR_ELTS (t2
);
7200 if (vec_safe_length (v1
) != vec_safe_length (v2
))
7203 for (idx
= 0; idx
< vec_safe_length (v1
); ++idx
)
7204 /* ??? Should we handle also fields here? */
7205 if (!simple_cst_equal ((*v1
)[idx
].value
, (*v2
)[idx
].value
))
7211 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7214 cmp
= simple_cst_equal (CALL_EXPR_FN (t1
), CALL_EXPR_FN (t2
));
7217 if (call_expr_nargs (t1
) != call_expr_nargs (t2
))
7220 const_tree arg1
, arg2
;
7221 const_call_expr_arg_iterator iter1
, iter2
;
7222 for (arg1
= first_const_call_expr_arg (t1
, &iter1
),
7223 arg2
= first_const_call_expr_arg (t2
, &iter2
);
7225 arg1
= next_const_call_expr_arg (&iter1
),
7226 arg2
= next_const_call_expr_arg (&iter2
))
7228 cmp
= simple_cst_equal (arg1
, arg2
);
7232 return arg1
== arg2
;
7236 /* Special case: if either target is an unallocated VAR_DECL,
7237 it means that it's going to be unified with whatever the
7238 TARGET_EXPR is really supposed to initialize, so treat it
7239 as being equivalent to anything. */
7240 if ((TREE_CODE (TREE_OPERAND (t1
, 0)) == VAR_DECL
7241 && DECL_NAME (TREE_OPERAND (t1
, 0)) == NULL_TREE
7242 && !DECL_RTL_SET_P (TREE_OPERAND (t1
, 0)))
7243 || (TREE_CODE (TREE_OPERAND (t2
, 0)) == VAR_DECL
7244 && DECL_NAME (TREE_OPERAND (t2
, 0)) == NULL_TREE
7245 && !DECL_RTL_SET_P (TREE_OPERAND (t2
, 0))))
7248 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7253 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
7255 case WITH_CLEANUP_EXPR
:
7256 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7260 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t1
, 1));
7263 if (TREE_OPERAND (t1
, 1) == TREE_OPERAND (t2
, 1))
7264 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7278 /* This general rule works for most tree codes. All exceptions should be
7279 handled above. If this is a language-specific tree code, we can't
7280 trust what might be in the operand, so say we don't know
7282 if ((int) code1
>= (int) LAST_AND_UNUSED_TREE_CODE
)
7285 switch (TREE_CODE_CLASS (code1
))
7289 case tcc_comparison
:
7290 case tcc_expression
:
7294 for (i
= 0; i
< TREE_CODE_LENGTH (code1
); i
++)
7296 cmp
= simple_cst_equal (TREE_OPERAND (t1
, i
), TREE_OPERAND (t2
, i
));
7308 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
7309 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
7310 than U, respectively. */
7313 compare_tree_int (const_tree t
, unsigned HOST_WIDE_INT u
)
7315 if (tree_int_cst_sgn (t
) < 0)
7317 else if (!tree_fits_uhwi_p (t
))
7319 else if (TREE_INT_CST_LOW (t
) == u
)
7321 else if (TREE_INT_CST_LOW (t
) < u
)
7327 /* Return true if SIZE represents a constant size that is in bounds of
7328 what the middle-end and the backend accepts (covering not more than
7329 half of the address-space). */
7332 valid_constant_size_p (const_tree size
)
7334 if (! tree_fits_uhwi_p (size
)
7335 || TREE_OVERFLOW (size
)
7336 || tree_int_cst_sign_bit (size
) != 0)
7341 /* Return the precision of the type, or for a complex or vector type the
7342 precision of the type of its elements. */
7345 element_precision (const_tree type
)
7347 enum tree_code code
= TREE_CODE (type
);
7348 if (code
== COMPLEX_TYPE
|| code
== VECTOR_TYPE
)
7349 type
= TREE_TYPE (type
);
7351 return TYPE_PRECISION (type
);
7354 /* Return true if CODE represents an associative tree code. Otherwise
7357 associative_tree_code (enum tree_code code
)
7376 /* Return true if CODE represents a commutative tree code. Otherwise
7379 commutative_tree_code (enum tree_code code
)
7385 case MULT_HIGHPART_EXPR
:
7393 case UNORDERED_EXPR
:
7397 case TRUTH_AND_EXPR
:
7398 case TRUTH_XOR_EXPR
:
7400 case WIDEN_MULT_EXPR
:
7401 case VEC_WIDEN_MULT_HI_EXPR
:
7402 case VEC_WIDEN_MULT_LO_EXPR
:
7403 case VEC_WIDEN_MULT_EVEN_EXPR
:
7404 case VEC_WIDEN_MULT_ODD_EXPR
:
7413 /* Return true if CODE represents a ternary tree code for which the
7414 first two operands are commutative. Otherwise return false. */
7416 commutative_ternary_tree_code (enum tree_code code
)
7420 case WIDEN_MULT_PLUS_EXPR
:
7421 case WIDEN_MULT_MINUS_EXPR
:
7435 /* Generate a hash value for an expression. This can be used iteratively
7436 by passing a previous result as the HSTATE argument.
7438 This function is intended to produce the same hash for expressions which
7439 would compare equal using operand_equal_p. */
7441 add_expr (const_tree t
, inchash::hash
&hstate
)
7444 enum tree_code code
;
7445 enum tree_code_class tclass
;
7449 hstate
.merge_hash (0);
7453 code
= TREE_CODE (t
);
7457 /* Alas, constants aren't shared, so we can't rely on pointer
7460 hstate
.merge_hash (0);
7463 for (i
= 0; i
< TREE_INT_CST_NUNITS (t
); i
++)
7464 hstate
.add_wide_int (TREE_INT_CST_ELT (t
, i
));
7468 unsigned int val2
= real_hash (TREE_REAL_CST_PTR (t
));
7469 hstate
.merge_hash (val2
);
7474 unsigned int val2
= fixed_hash (TREE_FIXED_CST_PTR (t
));
7475 hstate
.merge_hash (val2
);
7479 hstate
.add ((const void *) TREE_STRING_POINTER (t
), TREE_STRING_LENGTH (t
));
7482 inchash::add_expr (TREE_REALPART (t
), hstate
);
7483 inchash::add_expr (TREE_IMAGPART (t
), hstate
);
7488 for (i
= 0; i
< VECTOR_CST_NELTS (t
); ++i
)
7489 inchash::add_expr (VECTOR_CST_ELT (t
, i
), hstate
);
7493 /* We can just compare by pointer. */
7494 hstate
.add_wide_int (SSA_NAME_VERSION (t
));
7496 case PLACEHOLDER_EXPR
:
7497 /* The node itself doesn't matter. */
7500 /* A list of expressions, for a CALL_EXPR or as the elements of a
7502 for (; t
; t
= TREE_CHAIN (t
))
7503 inchash::add_expr (TREE_VALUE (t
), hstate
);
7507 unsigned HOST_WIDE_INT idx
;
7509 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t
), idx
, field
, value
)
7511 inchash::add_expr (field
, hstate
);
7512 inchash::add_expr (value
, hstate
);
7517 /* When referring to a built-in FUNCTION_DECL, use the __builtin__ form.
7518 Otherwise nodes that compare equal according to operand_equal_p might
7519 get different hash codes. However, don't do this for machine specific
7520 or front end builtins, since the function code is overloaded in those
7522 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
7523 && builtin_decl_explicit_p (DECL_FUNCTION_CODE (t
)))
7525 t
= builtin_decl_explicit (DECL_FUNCTION_CODE (t
));
7526 code
= TREE_CODE (t
);
7530 tclass
= TREE_CODE_CLASS (code
);
7532 if (tclass
== tcc_declaration
)
7534 /* DECL's have a unique ID */
7535 hstate
.add_wide_int (DECL_UID (t
));
7539 gcc_assert (IS_EXPR_CODE_CLASS (tclass
));
7541 hstate
.add_object (code
);
7543 /* Don't hash the type, that can lead to having nodes which
7544 compare equal according to operand_equal_p, but which
7545 have different hash codes. */
7546 if (CONVERT_EXPR_CODE_P (code
)
7547 || code
== NON_LVALUE_EXPR
)
7549 /* Make sure to include signness in the hash computation. */
7550 hstate
.add_int (TYPE_UNSIGNED (TREE_TYPE (t
)));
7551 inchash::add_expr (TREE_OPERAND (t
, 0), hstate
);
7554 else if (commutative_tree_code (code
))
7556 /* It's a commutative expression. We want to hash it the same
7557 however it appears. We do this by first hashing both operands
7558 and then rehashing based on the order of their independent
7560 inchash::hash one
, two
;
7561 inchash::add_expr (TREE_OPERAND (t
, 0), one
);
7562 inchash::add_expr (TREE_OPERAND (t
, 1), two
);
7563 hstate
.add_commutative (one
, two
);
7566 for (i
= TREE_OPERAND_LENGTH (t
) - 1; i
>= 0; --i
)
7567 inchash::add_expr (TREE_OPERAND (t
, i
), hstate
);
7575 /* Constructors for pointer, array and function types.
7576 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
7577 constructed by language-dependent code, not here.) */
7579 /* Construct, lay out and return the type of pointers to TO_TYPE with
7580 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
7581 reference all of memory. If such a type has already been
7582 constructed, reuse it. */
7585 build_pointer_type_for_mode (tree to_type
, machine_mode mode
,
7590 if (to_type
== error_mark_node
)
7591 return error_mark_node
;
7593 /* If the pointed-to type has the may_alias attribute set, force
7594 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7595 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
7596 can_alias_all
= true;
7598 /* In some cases, languages will have things that aren't a POINTER_TYPE
7599 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
7600 In that case, return that type without regard to the rest of our
7603 ??? This is a kludge, but consistent with the way this function has
7604 always operated and there doesn't seem to be a good way to avoid this
7606 if (TYPE_POINTER_TO (to_type
) != 0
7607 && TREE_CODE (TYPE_POINTER_TO (to_type
)) != POINTER_TYPE
)
7608 return TYPE_POINTER_TO (to_type
);
7610 /* First, if we already have a type for pointers to TO_TYPE and it's
7611 the proper mode, use it. */
7612 for (t
= TYPE_POINTER_TO (to_type
); t
; t
= TYPE_NEXT_PTR_TO (t
))
7613 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
7616 t
= make_node (POINTER_TYPE
);
7618 TREE_TYPE (t
) = to_type
;
7619 SET_TYPE_MODE (t
, mode
);
7620 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
7621 TYPE_NEXT_PTR_TO (t
) = TYPE_POINTER_TO (to_type
);
7622 TYPE_POINTER_TO (to_type
) = t
;
7624 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
))
7625 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7626 else if (TYPE_CANONICAL (to_type
) != to_type
)
7628 = build_pointer_type_for_mode (TYPE_CANONICAL (to_type
),
7629 mode
, can_alias_all
);
7631 /* Lay out the type. This function has many callers that are concerned
7632 with expression-construction, and this simplifies them all. */
7638 /* By default build pointers in ptr_mode. */
7641 build_pointer_type (tree to_type
)
7643 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
7644 : TYPE_ADDR_SPACE (to_type
);
7645 machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
7646 return build_pointer_type_for_mode (to_type
, pointer_mode
, false);
7649 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
7652 build_reference_type_for_mode (tree to_type
, machine_mode mode
,
7657 if (to_type
== error_mark_node
)
7658 return error_mark_node
;
7660 /* If the pointed-to type has the may_alias attribute set, force
7661 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7662 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
7663 can_alias_all
= true;
7665 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
7666 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
7667 In that case, return that type without regard to the rest of our
7670 ??? This is a kludge, but consistent with the way this function has
7671 always operated and there doesn't seem to be a good way to avoid this
7673 if (TYPE_REFERENCE_TO (to_type
) != 0
7674 && TREE_CODE (TYPE_REFERENCE_TO (to_type
)) != REFERENCE_TYPE
)
7675 return TYPE_REFERENCE_TO (to_type
);
7677 /* First, if we already have a type for pointers to TO_TYPE and it's
7678 the proper mode, use it. */
7679 for (t
= TYPE_REFERENCE_TO (to_type
); t
; t
= TYPE_NEXT_REF_TO (t
))
7680 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
7683 t
= make_node (REFERENCE_TYPE
);
7685 TREE_TYPE (t
) = to_type
;
7686 SET_TYPE_MODE (t
, mode
);
7687 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
7688 TYPE_NEXT_REF_TO (t
) = TYPE_REFERENCE_TO (to_type
);
7689 TYPE_REFERENCE_TO (to_type
) = t
;
7691 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
))
7692 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7693 else if (TYPE_CANONICAL (to_type
) != to_type
)
7695 = build_reference_type_for_mode (TYPE_CANONICAL (to_type
),
7696 mode
, can_alias_all
);
7704 /* Build the node for the type of references-to-TO_TYPE by default
7708 build_reference_type (tree to_type
)
7710 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
7711 : TYPE_ADDR_SPACE (to_type
);
7712 machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
7713 return build_reference_type_for_mode (to_type
, pointer_mode
, false);
7716 #define MAX_INT_CACHED_PREC \
7717 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
7718 static GTY(()) tree nonstandard_integer_type_cache
[2 * MAX_INT_CACHED_PREC
+ 2];
7720 /* Builds a signed or unsigned integer type of precision PRECISION.
7721 Used for C bitfields whose precision does not match that of
7722 built-in target types. */
7724 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision
,
7730 unsignedp
= MAX_INT_CACHED_PREC
+ 1;
7732 if (precision
<= MAX_INT_CACHED_PREC
)
7734 itype
= nonstandard_integer_type_cache
[precision
+ unsignedp
];
7739 itype
= make_node (INTEGER_TYPE
);
7740 TYPE_PRECISION (itype
) = precision
;
7743 fixup_unsigned_type (itype
);
7745 fixup_signed_type (itype
);
7748 if (tree_fits_uhwi_p (TYPE_MAX_VALUE (itype
)))
7749 ret
= type_hash_canon (tree_to_uhwi (TYPE_MAX_VALUE (itype
)), itype
);
7750 if (precision
<= MAX_INT_CACHED_PREC
)
7751 nonstandard_integer_type_cache
[precision
+ unsignedp
] = ret
;
7756 /* Create a range of some discrete type TYPE (an INTEGER_TYPE, ENUMERAL_TYPE
7757 or BOOLEAN_TYPE) with low bound LOWVAL and high bound HIGHVAL. If SHARED
7758 is true, reuse such a type that has already been constructed. */
7761 build_range_type_1 (tree type
, tree lowval
, tree highval
, bool shared
)
7763 tree itype
= make_node (INTEGER_TYPE
);
7764 inchash::hash hstate
;
7766 TREE_TYPE (itype
) = type
;
7768 TYPE_MIN_VALUE (itype
) = fold_convert (type
, lowval
);
7769 TYPE_MAX_VALUE (itype
) = highval
? fold_convert (type
, highval
) : NULL
;
7771 TYPE_PRECISION (itype
) = TYPE_PRECISION (type
);
7772 SET_TYPE_MODE (itype
, TYPE_MODE (type
));
7773 TYPE_SIZE (itype
) = TYPE_SIZE (type
);
7774 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (type
);
7775 TYPE_ALIGN (itype
) = TYPE_ALIGN (type
);
7776 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (type
);
7781 if ((TYPE_MIN_VALUE (itype
)
7782 && TREE_CODE (TYPE_MIN_VALUE (itype
)) != INTEGER_CST
)
7783 || (TYPE_MAX_VALUE (itype
)
7784 && TREE_CODE (TYPE_MAX_VALUE (itype
)) != INTEGER_CST
))
7786 /* Since we cannot reliably merge this type, we need to compare it using
7787 structural equality checks. */
7788 SET_TYPE_STRUCTURAL_EQUALITY (itype
);
7792 inchash::add_expr (TYPE_MIN_VALUE (itype
), hstate
);
7793 inchash::add_expr (TYPE_MAX_VALUE (itype
), hstate
);
7794 hstate
.merge_hash (TYPE_HASH (type
));
7795 itype
= type_hash_canon (hstate
.end (), itype
);
7800 /* Wrapper around build_range_type_1 with SHARED set to true. */
7803 build_range_type (tree type
, tree lowval
, tree highval
)
7805 return build_range_type_1 (type
, lowval
, highval
, true);
7808 /* Wrapper around build_range_type_1 with SHARED set to false. */
7811 build_nonshared_range_type (tree type
, tree lowval
, tree highval
)
7813 return build_range_type_1 (type
, lowval
, highval
, false);
7816 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
7817 MAXVAL should be the maximum value in the domain
7818 (one less than the length of the array).
7820 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
7821 We don't enforce this limit, that is up to caller (e.g. language front end).
7822 The limit exists because the result is a signed type and we don't handle
7823 sizes that use more than one HOST_WIDE_INT. */
7826 build_index_type (tree maxval
)
7828 return build_range_type (sizetype
, size_zero_node
, maxval
);
7831 /* Return true if the debug information for TYPE, a subtype, should be emitted
7832 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
7833 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
7834 debug info and doesn't reflect the source code. */
7837 subrange_type_for_debug_p (const_tree type
, tree
*lowval
, tree
*highval
)
7839 tree base_type
= TREE_TYPE (type
), low
, high
;
7841 /* Subrange types have a base type which is an integral type. */
7842 if (!INTEGRAL_TYPE_P (base_type
))
7845 /* Get the real bounds of the subtype. */
7846 if (lang_hooks
.types
.get_subrange_bounds
)
7847 lang_hooks
.types
.get_subrange_bounds (type
, &low
, &high
);
7850 low
= TYPE_MIN_VALUE (type
);
7851 high
= TYPE_MAX_VALUE (type
);
7854 /* If the type and its base type have the same representation and the same
7855 name, then the type is not a subrange but a copy of the base type. */
7856 if ((TREE_CODE (base_type
) == INTEGER_TYPE
7857 || TREE_CODE (base_type
) == BOOLEAN_TYPE
)
7858 && int_size_in_bytes (type
) == int_size_in_bytes (base_type
)
7859 && tree_int_cst_equal (low
, TYPE_MIN_VALUE (base_type
))
7860 && tree_int_cst_equal (high
, TYPE_MAX_VALUE (base_type
))
7861 && TYPE_IDENTIFIER (type
) == TYPE_IDENTIFIER (base_type
))
7871 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
7872 and number of elements specified by the range of values of INDEX_TYPE.
7873 If SHARED is true, reuse such a type that has already been constructed. */
7876 build_array_type_1 (tree elt_type
, tree index_type
, bool shared
)
7880 if (TREE_CODE (elt_type
) == FUNCTION_TYPE
)
7882 error ("arrays of functions are not meaningful");
7883 elt_type
= integer_type_node
;
7886 t
= make_node (ARRAY_TYPE
);
7887 TREE_TYPE (t
) = elt_type
;
7888 TYPE_DOMAIN (t
) = index_type
;
7889 TYPE_ADDR_SPACE (t
) = TYPE_ADDR_SPACE (elt_type
);
7892 /* If the element type is incomplete at this point we get marked for
7893 structural equality. Do not record these types in the canonical
7895 if (TYPE_STRUCTURAL_EQUALITY_P (t
))
7900 inchash::hash hstate
;
7901 hstate
.add_object (TYPE_HASH (elt_type
));
7903 hstate
.add_object (TYPE_HASH (index_type
));
7904 t
= type_hash_canon (hstate
.end (), t
);
7907 if (TYPE_CANONICAL (t
) == t
)
7909 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type
)
7910 || (index_type
&& TYPE_STRUCTURAL_EQUALITY_P (index_type
)))
7911 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7912 else if (TYPE_CANONICAL (elt_type
) != elt_type
7913 || (index_type
&& TYPE_CANONICAL (index_type
) != index_type
))
7915 = build_array_type_1 (TYPE_CANONICAL (elt_type
),
7917 ? TYPE_CANONICAL (index_type
) : NULL_TREE
,
7924 /* Wrapper around build_array_type_1 with SHARED set to true. */
7927 build_array_type (tree elt_type
, tree index_type
)
7929 return build_array_type_1 (elt_type
, index_type
, true);
7932 /* Wrapper around build_array_type_1 with SHARED set to false. */
7935 build_nonshared_array_type (tree elt_type
, tree index_type
)
7937 return build_array_type_1 (elt_type
, index_type
, false);
7940 /* Return a representation of ELT_TYPE[NELTS], using indices of type
7944 build_array_type_nelts (tree elt_type
, unsigned HOST_WIDE_INT nelts
)
7946 return build_array_type (elt_type
, build_index_type (size_int (nelts
- 1)));
7949 /* Recursively examines the array elements of TYPE, until a non-array
7950 element type is found. */
7953 strip_array_types (tree type
)
7955 while (TREE_CODE (type
) == ARRAY_TYPE
)
7956 type
= TREE_TYPE (type
);
7961 /* Computes the canonical argument types from the argument type list
7964 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
7965 on entry to this function, or if any of the ARGTYPES are
7968 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
7969 true on entry to this function, or if any of the ARGTYPES are
7972 Returns a canonical argument list, which may be ARGTYPES when the
7973 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
7974 true) or would not differ from ARGTYPES. */
7977 maybe_canonicalize_argtypes (tree argtypes
,
7978 bool *any_structural_p
,
7979 bool *any_noncanonical_p
)
7982 bool any_noncanonical_argtypes_p
= false;
7984 for (arg
= argtypes
; arg
&& !(*any_structural_p
); arg
= TREE_CHAIN (arg
))
7986 if (!TREE_VALUE (arg
) || TREE_VALUE (arg
) == error_mark_node
)
7987 /* Fail gracefully by stating that the type is structural. */
7988 *any_structural_p
= true;
7989 else if (TYPE_STRUCTURAL_EQUALITY_P (TREE_VALUE (arg
)))
7990 *any_structural_p
= true;
7991 else if (TYPE_CANONICAL (TREE_VALUE (arg
)) != TREE_VALUE (arg
)
7992 || TREE_PURPOSE (arg
))
7993 /* If the argument has a default argument, we consider it
7994 non-canonical even though the type itself is canonical.
7995 That way, different variants of function and method types
7996 with default arguments will all point to the variant with
7997 no defaults as their canonical type. */
7998 any_noncanonical_argtypes_p
= true;
8001 if (*any_structural_p
)
8004 if (any_noncanonical_argtypes_p
)
8006 /* Build the canonical list of argument types. */
8007 tree canon_argtypes
= NULL_TREE
;
8008 bool is_void
= false;
8010 for (arg
= argtypes
; arg
; arg
= TREE_CHAIN (arg
))
8012 if (arg
== void_list_node
)
8015 canon_argtypes
= tree_cons (NULL_TREE
,
8016 TYPE_CANONICAL (TREE_VALUE (arg
)),
8020 canon_argtypes
= nreverse (canon_argtypes
);
8022 canon_argtypes
= chainon (canon_argtypes
, void_list_node
);
8024 /* There is a non-canonical type. */
8025 *any_noncanonical_p
= true;
8026 return canon_argtypes
;
8029 /* The canonical argument types are the same as ARGTYPES. */
8033 /* Construct, lay out and return
8034 the type of functions returning type VALUE_TYPE
8035 given arguments of types ARG_TYPES.
8036 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
8037 are data type nodes for the arguments of the function.
8038 If such a type has already been constructed, reuse it. */
8041 build_function_type (tree value_type
, tree arg_types
)
8044 inchash::hash hstate
;
8045 bool any_structural_p
, any_noncanonical_p
;
8046 tree canon_argtypes
;
8048 if (TREE_CODE (value_type
) == FUNCTION_TYPE
)
8050 error ("function return type cannot be function");
8051 value_type
= integer_type_node
;
8054 /* Make a node of the sort we want. */
8055 t
= make_node (FUNCTION_TYPE
);
8056 TREE_TYPE (t
) = value_type
;
8057 TYPE_ARG_TYPES (t
) = arg_types
;
8059 /* If we already have such a type, use the old one. */
8060 hstate
.add_object (TYPE_HASH (value_type
));
8061 type_hash_list (arg_types
, hstate
);
8062 t
= type_hash_canon (hstate
.end (), t
);
8064 /* Set up the canonical type. */
8065 any_structural_p
= TYPE_STRUCTURAL_EQUALITY_P (value_type
);
8066 any_noncanonical_p
= TYPE_CANONICAL (value_type
) != value_type
;
8067 canon_argtypes
= maybe_canonicalize_argtypes (arg_types
,
8069 &any_noncanonical_p
);
8070 if (any_structural_p
)
8071 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8072 else if (any_noncanonical_p
)
8073 TYPE_CANONICAL (t
) = build_function_type (TYPE_CANONICAL (value_type
),
8076 if (!COMPLETE_TYPE_P (t
))
8081 /* Build a function type. The RETURN_TYPE is the type returned by the
8082 function. If VAARGS is set, no void_type_node is appended to the
8083 the list. ARGP must be always be terminated be a NULL_TREE. */
8086 build_function_type_list_1 (bool vaargs
, tree return_type
, va_list argp
)
8090 t
= va_arg (argp
, tree
);
8091 for (args
= NULL_TREE
; t
!= NULL_TREE
; t
= va_arg (argp
, tree
))
8092 args
= tree_cons (NULL_TREE
, t
, args
);
8097 if (args
!= NULL_TREE
)
8098 args
= nreverse (args
);
8099 gcc_assert (last
!= void_list_node
);
8101 else if (args
== NULL_TREE
)
8102 args
= void_list_node
;
8106 args
= nreverse (args
);
8107 TREE_CHAIN (last
) = void_list_node
;
8109 args
= build_function_type (return_type
, args
);
8114 /* Build a function type. The RETURN_TYPE is the type returned by the
8115 function. If additional arguments are provided, they are
8116 additional argument types. The list of argument types must always
8117 be terminated by NULL_TREE. */
8120 build_function_type_list (tree return_type
, ...)
8125 va_start (p
, return_type
);
8126 args
= build_function_type_list_1 (false, return_type
, p
);
8131 /* Build a variable argument function type. The RETURN_TYPE is the
8132 type returned by the function. If additional arguments are provided,
8133 they are additional argument types. The list of argument types must
8134 always be terminated by NULL_TREE. */
8137 build_varargs_function_type_list (tree return_type
, ...)
8142 va_start (p
, return_type
);
8143 args
= build_function_type_list_1 (true, return_type
, p
);
8149 /* Build a function type. RETURN_TYPE is the type returned by the
8150 function; VAARGS indicates whether the function takes varargs. The
8151 function takes N named arguments, the types of which are provided in
8155 build_function_type_array_1 (bool vaargs
, tree return_type
, int n
,
8159 tree t
= vaargs
? NULL_TREE
: void_list_node
;
8161 for (i
= n
- 1; i
>= 0; i
--)
8162 t
= tree_cons (NULL_TREE
, arg_types
[i
], t
);
8164 return build_function_type (return_type
, t
);
8167 /* Build a function type. RETURN_TYPE is the type returned by the
8168 function. The function takes N named arguments, the types of which
8169 are provided in ARG_TYPES. */
8172 build_function_type_array (tree return_type
, int n
, tree
*arg_types
)
8174 return build_function_type_array_1 (false, return_type
, n
, arg_types
);
8177 /* Build a variable argument function type. RETURN_TYPE is the type
8178 returned by the function. The function takes N named arguments, the
8179 types of which are provided in ARG_TYPES. */
8182 build_varargs_function_type_array (tree return_type
, int n
, tree
*arg_types
)
8184 return build_function_type_array_1 (true, return_type
, n
, arg_types
);
8187 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
8188 and ARGTYPES (a TREE_LIST) are the return type and arguments types
8189 for the method. An implicit additional parameter (of type
8190 pointer-to-BASETYPE) is added to the ARGTYPES. */
8193 build_method_type_directly (tree basetype
,
8199 inchash::hash hstate
;
8200 bool any_structural_p
, any_noncanonical_p
;
8201 tree canon_argtypes
;
8203 /* Make a node of the sort we want. */
8204 t
= make_node (METHOD_TYPE
);
8206 TYPE_METHOD_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
8207 TREE_TYPE (t
) = rettype
;
8208 ptype
= build_pointer_type (basetype
);
8210 /* The actual arglist for this function includes a "hidden" argument
8211 which is "this". Put it into the list of argument types. */
8212 argtypes
= tree_cons (NULL_TREE
, ptype
, argtypes
);
8213 TYPE_ARG_TYPES (t
) = argtypes
;
8215 /* If we already have such a type, use the old one. */
8216 hstate
.add_object (TYPE_HASH (basetype
));
8217 hstate
.add_object (TYPE_HASH (rettype
));
8218 type_hash_list (argtypes
, hstate
);
8219 t
= type_hash_canon (hstate
.end (), t
);
8221 /* Set up the canonical type. */
8223 = (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
8224 || TYPE_STRUCTURAL_EQUALITY_P (rettype
));
8226 = (TYPE_CANONICAL (basetype
) != basetype
8227 || TYPE_CANONICAL (rettype
) != rettype
);
8228 canon_argtypes
= maybe_canonicalize_argtypes (TREE_CHAIN (argtypes
),
8230 &any_noncanonical_p
);
8231 if (any_structural_p
)
8232 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8233 else if (any_noncanonical_p
)
8235 = build_method_type_directly (TYPE_CANONICAL (basetype
),
8236 TYPE_CANONICAL (rettype
),
8238 if (!COMPLETE_TYPE_P (t
))
8244 /* Construct, lay out and return the type of methods belonging to class
8245 BASETYPE and whose arguments and values are described by TYPE.
8246 If that type exists already, reuse it.
8247 TYPE must be a FUNCTION_TYPE node. */
8250 build_method_type (tree basetype
, tree type
)
8252 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
8254 return build_method_type_directly (basetype
,
8256 TYPE_ARG_TYPES (type
));
8259 /* Construct, lay out and return the type of offsets to a value
8260 of type TYPE, within an object of type BASETYPE.
8261 If a suitable offset type exists already, reuse it. */
8264 build_offset_type (tree basetype
, tree type
)
8267 inchash::hash hstate
;
8269 /* Make a node of the sort we want. */
8270 t
= make_node (OFFSET_TYPE
);
8272 TYPE_OFFSET_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
8273 TREE_TYPE (t
) = type
;
8275 /* If we already have such a type, use the old one. */
8276 hstate
.add_object (TYPE_HASH (basetype
));
8277 hstate
.add_object (TYPE_HASH (type
));
8278 t
= type_hash_canon (hstate
.end (), t
);
8280 if (!COMPLETE_TYPE_P (t
))
8283 if (TYPE_CANONICAL (t
) == t
)
8285 if (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
8286 || TYPE_STRUCTURAL_EQUALITY_P (type
))
8287 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8288 else if (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)) != basetype
8289 || TYPE_CANONICAL (type
) != type
)
8291 = build_offset_type (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)),
8292 TYPE_CANONICAL (type
));
8298 /* Create a complex type whose components are COMPONENT_TYPE. */
8301 build_complex_type (tree component_type
)
8304 inchash::hash hstate
;
8306 gcc_assert (INTEGRAL_TYPE_P (component_type
)
8307 || SCALAR_FLOAT_TYPE_P (component_type
)
8308 || FIXED_POINT_TYPE_P (component_type
));
8310 /* Make a node of the sort we want. */
8311 t
= make_node (COMPLEX_TYPE
);
8313 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (component_type
);
8315 /* If we already have such a type, use the old one. */
8316 hstate
.add_object (TYPE_HASH (component_type
));
8317 t
= type_hash_canon (hstate
.end (), t
);
8319 if (!COMPLETE_TYPE_P (t
))
8322 if (TYPE_CANONICAL (t
) == t
)
8324 if (TYPE_STRUCTURAL_EQUALITY_P (component_type
))
8325 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8326 else if (TYPE_CANONICAL (component_type
) != component_type
)
8328 = build_complex_type (TYPE_CANONICAL (component_type
));
8331 /* We need to create a name, since complex is a fundamental type. */
8332 if (! TYPE_NAME (t
))
8335 if (component_type
== char_type_node
)
8336 name
= "complex char";
8337 else if (component_type
== signed_char_type_node
)
8338 name
= "complex signed char";
8339 else if (component_type
== unsigned_char_type_node
)
8340 name
= "complex unsigned char";
8341 else if (component_type
== short_integer_type_node
)
8342 name
= "complex short int";
8343 else if (component_type
== short_unsigned_type_node
)
8344 name
= "complex short unsigned int";
8345 else if (component_type
== integer_type_node
)
8346 name
= "complex int";
8347 else if (component_type
== unsigned_type_node
)
8348 name
= "complex unsigned int";
8349 else if (component_type
== long_integer_type_node
)
8350 name
= "complex long int";
8351 else if (component_type
== long_unsigned_type_node
)
8352 name
= "complex long unsigned int";
8353 else if (component_type
== long_long_integer_type_node
)
8354 name
= "complex long long int";
8355 else if (component_type
== long_long_unsigned_type_node
)
8356 name
= "complex long long unsigned int";
8361 TYPE_NAME (t
) = build_decl (UNKNOWN_LOCATION
, TYPE_DECL
,
8362 get_identifier (name
), t
);
8365 return build_qualified_type (t
, TYPE_QUALS (component_type
));
8368 /* If TYPE is a real or complex floating-point type and the target
8369 does not directly support arithmetic on TYPE then return the wider
8370 type to be used for arithmetic on TYPE. Otherwise, return
8374 excess_precision_type (tree type
)
8376 if (flag_excess_precision
!= EXCESS_PRECISION_FAST
)
8378 int flt_eval_method
= TARGET_FLT_EVAL_METHOD
;
8379 switch (TREE_CODE (type
))
8382 switch (flt_eval_method
)
8385 if (TYPE_MODE (type
) == TYPE_MODE (float_type_node
))
8386 return double_type_node
;
8389 if (TYPE_MODE (type
) == TYPE_MODE (float_type_node
)
8390 || TYPE_MODE (type
) == TYPE_MODE (double_type_node
))
8391 return long_double_type_node
;
8398 if (TREE_CODE (TREE_TYPE (type
)) != REAL_TYPE
)
8400 switch (flt_eval_method
)
8403 if (TYPE_MODE (TREE_TYPE (type
)) == TYPE_MODE (float_type_node
))
8404 return complex_double_type_node
;
8407 if (TYPE_MODE (TREE_TYPE (type
)) == TYPE_MODE (float_type_node
)
8408 || (TYPE_MODE (TREE_TYPE (type
))
8409 == TYPE_MODE (double_type_node
)))
8410 return complex_long_double_type_node
;
8423 /* Return OP, stripped of any conversions to wider types as much as is safe.
8424 Converting the value back to OP's type makes a value equivalent to OP.
8426 If FOR_TYPE is nonzero, we return a value which, if converted to
8427 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
8429 OP must have integer, real or enumeral type. Pointers are not allowed!
8431 There are some cases where the obvious value we could return
8432 would regenerate to OP if converted to OP's type,
8433 but would not extend like OP to wider types.
8434 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
8435 For example, if OP is (unsigned short)(signed char)-1,
8436 we avoid returning (signed char)-1 if FOR_TYPE is int,
8437 even though extending that to an unsigned short would regenerate OP,
8438 since the result of extending (signed char)-1 to (int)
8439 is different from (int) OP. */
8442 get_unwidened (tree op
, tree for_type
)
8444 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
8445 tree type
= TREE_TYPE (op
);
8447 = TYPE_PRECISION (for_type
!= 0 ? for_type
: type
);
8449 = (for_type
!= 0 && for_type
!= type
8450 && final_prec
> TYPE_PRECISION (type
)
8451 && TYPE_UNSIGNED (type
));
8454 while (CONVERT_EXPR_P (op
))
8458 /* TYPE_PRECISION on vector types has different meaning
8459 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
8460 so avoid them here. */
8461 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op
, 0))) == VECTOR_TYPE
)
8464 bitschange
= TYPE_PRECISION (TREE_TYPE (op
))
8465 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0)));
8467 /* Truncations are many-one so cannot be removed.
8468 Unless we are later going to truncate down even farther. */
8470 && final_prec
> TYPE_PRECISION (TREE_TYPE (op
)))
8473 /* See what's inside this conversion. If we decide to strip it,
8475 op
= TREE_OPERAND (op
, 0);
8477 /* If we have not stripped any zero-extensions (uns is 0),
8478 we can strip any kind of extension.
8479 If we have previously stripped a zero-extension,
8480 only zero-extensions can safely be stripped.
8481 Any extension can be stripped if the bits it would produce
8482 are all going to be discarded later by truncating to FOR_TYPE. */
8486 if (! uns
|| final_prec
<= TYPE_PRECISION (TREE_TYPE (op
)))
8488 /* TYPE_UNSIGNED says whether this is a zero-extension.
8489 Let's avoid computing it if it does not affect WIN
8490 and if UNS will not be needed again. */
8492 || CONVERT_EXPR_P (op
))
8493 && TYPE_UNSIGNED (TREE_TYPE (op
)))
8501 /* If we finally reach a constant see if it fits in for_type and
8502 in that case convert it. */
8504 && TREE_CODE (win
) == INTEGER_CST
8505 && TREE_TYPE (win
) != for_type
8506 && int_fits_type_p (win
, for_type
))
8507 win
= fold_convert (for_type
, win
);
8512 /* Return OP or a simpler expression for a narrower value
8513 which can be sign-extended or zero-extended to give back OP.
8514 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
8515 or 0 if the value should be sign-extended. */
8518 get_narrower (tree op
, int *unsignedp_ptr
)
8523 bool integral_p
= INTEGRAL_TYPE_P (TREE_TYPE (op
));
8525 while (TREE_CODE (op
) == NOP_EXPR
)
8528 = (TYPE_PRECISION (TREE_TYPE (op
))
8529 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0))));
8531 /* Truncations are many-one so cannot be removed. */
8535 /* See what's inside this conversion. If we decide to strip it,
8540 op
= TREE_OPERAND (op
, 0);
8541 /* An extension: the outermost one can be stripped,
8542 but remember whether it is zero or sign extension. */
8544 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
8545 /* Otherwise, if a sign extension has been stripped,
8546 only sign extensions can now be stripped;
8547 if a zero extension has been stripped, only zero-extensions. */
8548 else if (uns
!= TYPE_UNSIGNED (TREE_TYPE (op
)))
8552 else /* bitschange == 0 */
8554 /* A change in nominal type can always be stripped, but we must
8555 preserve the unsignedness. */
8557 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
8559 op
= TREE_OPERAND (op
, 0);
8560 /* Keep trying to narrow, but don't assign op to win if it
8561 would turn an integral type into something else. */
8562 if (INTEGRAL_TYPE_P (TREE_TYPE (op
)) != integral_p
)
8569 if (TREE_CODE (op
) == COMPONENT_REF
8570 /* Since type_for_size always gives an integer type. */
8571 && TREE_CODE (TREE_TYPE (op
)) != REAL_TYPE
8572 && TREE_CODE (TREE_TYPE (op
)) != FIXED_POINT_TYPE
8573 /* Ensure field is laid out already. */
8574 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0
8575 && tree_fits_uhwi_p (DECL_SIZE (TREE_OPERAND (op
, 1))))
8577 unsigned HOST_WIDE_INT innerprec
8578 = tree_to_uhwi (DECL_SIZE (TREE_OPERAND (op
, 1)));
8579 int unsignedp
= (DECL_UNSIGNED (TREE_OPERAND (op
, 1))
8580 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op
, 1))));
8581 tree type
= lang_hooks
.types
.type_for_size (innerprec
, unsignedp
);
8583 /* We can get this structure field in a narrower type that fits it,
8584 but the resulting extension to its nominal type (a fullword type)
8585 must satisfy the same conditions as for other extensions.
8587 Do this only for fields that are aligned (not bit-fields),
8588 because when bit-field insns will be used there is no
8589 advantage in doing this. */
8591 if (innerprec
< TYPE_PRECISION (TREE_TYPE (op
))
8592 && ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1))
8593 && (first
|| uns
== DECL_UNSIGNED (TREE_OPERAND (op
, 1)))
8597 uns
= DECL_UNSIGNED (TREE_OPERAND (op
, 1));
8598 win
= fold_convert (type
, op
);
8602 *unsignedp_ptr
= uns
;
8606 /* Returns true if integer constant C has a value that is permissible
8607 for type TYPE (an INTEGER_TYPE). */
8610 int_fits_type_p (const_tree c
, const_tree type
)
8612 tree type_low_bound
, type_high_bound
;
8613 bool ok_for_low_bound
, ok_for_high_bound
;
8614 signop sgn_c
= TYPE_SIGN (TREE_TYPE (c
));
8617 type_low_bound
= TYPE_MIN_VALUE (type
);
8618 type_high_bound
= TYPE_MAX_VALUE (type
);
8620 /* If at least one bound of the type is a constant integer, we can check
8621 ourselves and maybe make a decision. If no such decision is possible, but
8622 this type is a subtype, try checking against that. Otherwise, use
8623 fits_to_tree_p, which checks against the precision.
8625 Compute the status for each possibly constant bound, and return if we see
8626 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
8627 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
8628 for "constant known to fit". */
8630 /* Check if c >= type_low_bound. */
8631 if (type_low_bound
&& TREE_CODE (type_low_bound
) == INTEGER_CST
)
8633 if (tree_int_cst_lt (c
, type_low_bound
))
8635 ok_for_low_bound
= true;
8638 ok_for_low_bound
= false;
8640 /* Check if c <= type_high_bound. */
8641 if (type_high_bound
&& TREE_CODE (type_high_bound
) == INTEGER_CST
)
8643 if (tree_int_cst_lt (type_high_bound
, c
))
8645 ok_for_high_bound
= true;
8648 ok_for_high_bound
= false;
8650 /* If the constant fits both bounds, the result is known. */
8651 if (ok_for_low_bound
&& ok_for_high_bound
)
8654 /* Perform some generic filtering which may allow making a decision
8655 even if the bounds are not constant. First, negative integers
8656 never fit in unsigned types, */
8657 if (TYPE_UNSIGNED (type
) && sgn_c
== SIGNED
&& wi::neg_p (c
))
8660 /* Second, narrower types always fit in wider ones. */
8661 if (TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (c
)))
8664 /* Third, unsigned integers with top bit set never fit signed types. */
8665 if (!TYPE_UNSIGNED (type
) && sgn_c
== UNSIGNED
)
8667 int prec
= GET_MODE_PRECISION (TYPE_MODE (TREE_TYPE (c
))) - 1;
8668 if (prec
< TYPE_PRECISION (TREE_TYPE (c
)))
8670 /* When a tree_cst is converted to a wide-int, the precision
8671 is taken from the type. However, if the precision of the
8672 mode underneath the type is smaller than that, it is
8673 possible that the value will not fit. The test below
8674 fails if any bit is set between the sign bit of the
8675 underlying mode and the top bit of the type. */
8676 if (wi::ne_p (wi::zext (c
, prec
- 1), c
))
8679 else if (wi::neg_p (c
))
8683 /* If we haven't been able to decide at this point, there nothing more we
8684 can check ourselves here. Look at the base type if we have one and it
8685 has the same precision. */
8686 if (TREE_CODE (type
) == INTEGER_TYPE
8687 && TREE_TYPE (type
) != 0
8688 && TYPE_PRECISION (type
) == TYPE_PRECISION (TREE_TYPE (type
)))
8690 type
= TREE_TYPE (type
);
8694 /* Or to fits_to_tree_p, if nothing else. */
8695 return wi::fits_to_tree_p (c
, type
);
8698 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
8699 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
8700 represented (assuming two's-complement arithmetic) within the bit
8701 precision of the type are returned instead. */
8704 get_type_static_bounds (const_tree type
, mpz_t min
, mpz_t max
)
8706 if (!POINTER_TYPE_P (type
) && TYPE_MIN_VALUE (type
)
8707 && TREE_CODE (TYPE_MIN_VALUE (type
)) == INTEGER_CST
)
8708 wi::to_mpz (TYPE_MIN_VALUE (type
), min
, TYPE_SIGN (type
));
8711 if (TYPE_UNSIGNED (type
))
8712 mpz_set_ui (min
, 0);
8715 wide_int mn
= wi::min_value (TYPE_PRECISION (type
), SIGNED
);
8716 wi::to_mpz (mn
, min
, SIGNED
);
8720 if (!POINTER_TYPE_P (type
) && TYPE_MAX_VALUE (type
)
8721 && TREE_CODE (TYPE_MAX_VALUE (type
)) == INTEGER_CST
)
8722 wi::to_mpz (TYPE_MAX_VALUE (type
), max
, TYPE_SIGN (type
));
8725 wide_int mn
= wi::max_value (TYPE_PRECISION (type
), TYPE_SIGN (type
));
8726 wi::to_mpz (mn
, max
, TYPE_SIGN (type
));
8730 /* Return true if VAR is an automatic variable defined in function FN. */
8733 auto_var_in_fn_p (const_tree var
, const_tree fn
)
8735 return (DECL_P (var
) && DECL_CONTEXT (var
) == fn
8736 && ((((TREE_CODE (var
) == VAR_DECL
&& ! DECL_EXTERNAL (var
))
8737 || TREE_CODE (var
) == PARM_DECL
)
8738 && ! TREE_STATIC (var
))
8739 || TREE_CODE (var
) == LABEL_DECL
8740 || TREE_CODE (var
) == RESULT_DECL
));
8743 /* Subprogram of following function. Called by walk_tree.
8745 Return *TP if it is an automatic variable or parameter of the
8746 function passed in as DATA. */
8749 find_var_from_fn (tree
*tp
, int *walk_subtrees
, void *data
)
8751 tree fn
= (tree
) data
;
8756 else if (DECL_P (*tp
)
8757 && auto_var_in_fn_p (*tp
, fn
))
8763 /* Returns true if T is, contains, or refers to a type with variable
8764 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
8765 arguments, but not the return type. If FN is nonzero, only return
8766 true if a modifier of the type or position of FN is a variable or
8767 parameter inside FN.
8769 This concept is more general than that of C99 'variably modified types':
8770 in C99, a struct type is never variably modified because a VLA may not
8771 appear as a structure member. However, in GNU C code like:
8773 struct S { int i[f()]; };
8775 is valid, and other languages may define similar constructs. */
8778 variably_modified_type_p (tree type
, tree fn
)
8782 /* Test if T is either variable (if FN is zero) or an expression containing
8783 a variable in FN. If TYPE isn't gimplified, return true also if
8784 gimplify_one_sizepos would gimplify the expression into a local
8786 #define RETURN_TRUE_IF_VAR(T) \
8787 do { tree _t = (T); \
8788 if (_t != NULL_TREE \
8789 && _t != error_mark_node \
8790 && TREE_CODE (_t) != INTEGER_CST \
8791 && TREE_CODE (_t) != PLACEHOLDER_EXPR \
8793 || (!TYPE_SIZES_GIMPLIFIED (type) \
8794 && !is_gimple_sizepos (_t)) \
8795 || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
8796 return true; } while (0)
8798 if (type
== error_mark_node
)
8801 /* If TYPE itself has variable size, it is variably modified. */
8802 RETURN_TRUE_IF_VAR (TYPE_SIZE (type
));
8803 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type
));
8805 switch (TREE_CODE (type
))
8808 case REFERENCE_TYPE
:
8810 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
8816 /* If TYPE is a function type, it is variably modified if the
8817 return type is variably modified. */
8818 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
8824 case FIXED_POINT_TYPE
:
8827 /* Scalar types are variably modified if their end points
8829 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type
));
8830 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type
));
8835 case QUAL_UNION_TYPE
:
8836 /* We can't see if any of the fields are variably-modified by the
8837 definition we normally use, since that would produce infinite
8838 recursion via pointers. */
8839 /* This is variably modified if some field's type is. */
8840 for (t
= TYPE_FIELDS (type
); t
; t
= DECL_CHAIN (t
))
8841 if (TREE_CODE (t
) == FIELD_DECL
)
8843 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t
));
8844 RETURN_TRUE_IF_VAR (DECL_SIZE (t
));
8845 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t
));
8847 if (TREE_CODE (type
) == QUAL_UNION_TYPE
)
8848 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t
));
8853 /* Do not call ourselves to avoid infinite recursion. This is
8854 variably modified if the element type is. */
8855 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type
)));
8856 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type
)));
8863 /* The current language may have other cases to check, but in general,
8864 all other types are not variably modified. */
8865 return lang_hooks
.tree_inlining
.var_mod_type_p (type
, fn
);
8867 #undef RETURN_TRUE_IF_VAR
8870 /* Given a DECL or TYPE, return the scope in which it was declared, or
8871 NULL_TREE if there is no containing scope. */
8874 get_containing_scope (const_tree t
)
8876 return (TYPE_P (t
) ? TYPE_CONTEXT (t
) : DECL_CONTEXT (t
));
8879 /* Return the innermost context enclosing DECL that is
8880 a FUNCTION_DECL, or zero if none. */
8883 decl_function_context (const_tree decl
)
8887 if (TREE_CODE (decl
) == ERROR_MARK
)
8890 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
8891 where we look up the function at runtime. Such functions always take
8892 a first argument of type 'pointer to real context'.
8894 C++ should really be fixed to use DECL_CONTEXT for the real context,
8895 and use something else for the "virtual context". */
8896 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VINDEX (decl
))
8899 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl
)))));
8901 context
= DECL_CONTEXT (decl
);
8903 while (context
&& TREE_CODE (context
) != FUNCTION_DECL
)
8905 if (TREE_CODE (context
) == BLOCK
)
8906 context
= BLOCK_SUPERCONTEXT (context
);
8908 context
= get_containing_scope (context
);
8914 /* Return the innermost context enclosing DECL that is
8915 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
8916 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
8919 decl_type_context (const_tree decl
)
8921 tree context
= DECL_CONTEXT (decl
);
8924 switch (TREE_CODE (context
))
8926 case NAMESPACE_DECL
:
8927 case TRANSLATION_UNIT_DECL
:
8932 case QUAL_UNION_TYPE
:
8937 context
= DECL_CONTEXT (context
);
8941 context
= BLOCK_SUPERCONTEXT (context
);
8951 /* CALL is a CALL_EXPR. Return the declaration for the function
8952 called, or NULL_TREE if the called function cannot be
8956 get_callee_fndecl (const_tree call
)
8960 if (call
== error_mark_node
)
8961 return error_mark_node
;
8963 /* It's invalid to call this function with anything but a
8965 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
8967 /* The first operand to the CALL is the address of the function
8969 addr
= CALL_EXPR_FN (call
);
8971 /* If there is no function, return early. */
8972 if (addr
== NULL_TREE
)
8977 /* If this is a readonly function pointer, extract its initial value. */
8978 if (DECL_P (addr
) && TREE_CODE (addr
) != FUNCTION_DECL
8979 && TREE_READONLY (addr
) && ! TREE_THIS_VOLATILE (addr
)
8980 && DECL_INITIAL (addr
))
8981 addr
= DECL_INITIAL (addr
);
8983 /* If the address is just `&f' for some function `f', then we know
8984 that `f' is being called. */
8985 if (TREE_CODE (addr
) == ADDR_EXPR
8986 && TREE_CODE (TREE_OPERAND (addr
, 0)) == FUNCTION_DECL
)
8987 return TREE_OPERAND (addr
, 0);
8989 /* We couldn't figure out what was being called. */
8993 /* Print debugging information about tree nodes generated during the compile,
8994 and any language-specific information. */
8997 dump_tree_statistics (void)
8999 if (GATHER_STATISTICS
)
9002 int total_nodes
, total_bytes
;
9003 fprintf (stderr
, "Kind Nodes Bytes\n");
9004 fprintf (stderr
, "---------------------------------------\n");
9005 total_nodes
= total_bytes
= 0;
9006 for (i
= 0; i
< (int) all_kinds
; i
++)
9008 fprintf (stderr
, "%-20s %7d %10d\n", tree_node_kind_names
[i
],
9009 tree_node_counts
[i
], tree_node_sizes
[i
]);
9010 total_nodes
+= tree_node_counts
[i
];
9011 total_bytes
+= tree_node_sizes
[i
];
9013 fprintf (stderr
, "---------------------------------------\n");
9014 fprintf (stderr
, "%-20s %7d %10d\n", "Total", total_nodes
, total_bytes
);
9015 fprintf (stderr
, "---------------------------------------\n");
9016 fprintf (stderr
, "Code Nodes\n");
9017 fprintf (stderr
, "----------------------------\n");
9018 for (i
= 0; i
< (int) MAX_TREE_CODES
; i
++)
9019 fprintf (stderr
, "%-20s %7d\n", get_tree_code_name ((enum tree_code
) i
),
9020 tree_code_counts
[i
]);
9021 fprintf (stderr
, "----------------------------\n");
9022 ssanames_print_statistics ();
9023 phinodes_print_statistics ();
9026 fprintf (stderr
, "(No per-node statistics)\n");
9028 print_type_hash_statistics ();
9029 print_debug_expr_statistics ();
9030 print_value_expr_statistics ();
9031 lang_hooks
.print_statistics ();
9034 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
9036 /* Generate a crc32 of a byte. */
9039 crc32_unsigned_bits (unsigned chksum
, unsigned value
, unsigned bits
)
9043 for (ix
= bits
; ix
--; value
<<= 1)
9047 feedback
= (value
^ chksum
) & 0x80000000 ? 0x04c11db7 : 0;
9054 /* Generate a crc32 of a 32-bit unsigned. */
9057 crc32_unsigned (unsigned chksum
, unsigned value
)
9059 return crc32_unsigned_bits (chksum
, value
, 32);
9062 /* Generate a crc32 of a byte. */
9065 crc32_byte (unsigned chksum
, char byte
)
9067 return crc32_unsigned_bits (chksum
, (unsigned) byte
<< 24, 8);
9070 /* Generate a crc32 of a string. */
9073 crc32_string (unsigned chksum
, const char *string
)
9077 chksum
= crc32_byte (chksum
, *string
);
9083 /* P is a string that will be used in a symbol. Mask out any characters
9084 that are not valid in that context. */
9087 clean_symbol_name (char *p
)
9091 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
9094 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
9101 /* Generate a name for a special-purpose function.
9102 The generated name may need to be unique across the whole link.
9103 Changes to this function may also require corresponding changes to
9104 xstrdup_mask_random.
9105 TYPE is some string to identify the purpose of this function to the
9106 linker or collect2; it must start with an uppercase letter,
9108 I - for constructors
9110 N - for C++ anonymous namespaces
9111 F - for DWARF unwind frame information. */
9114 get_file_function_name (const char *type
)
9120 /* If we already have a name we know to be unique, just use that. */
9121 if (first_global_object_name
)
9122 p
= q
= ASTRDUP (first_global_object_name
);
9123 /* If the target is handling the constructors/destructors, they
9124 will be local to this file and the name is only necessary for
9126 We also assign sub_I and sub_D sufixes to constructors called from
9127 the global static constructors. These are always local. */
9128 else if (((type
[0] == 'I' || type
[0] == 'D') && targetm
.have_ctors_dtors
)
9129 || (strncmp (type
, "sub_", 4) == 0
9130 && (type
[4] == 'I' || type
[4] == 'D')))
9132 const char *file
= main_input_filename
;
9134 file
= LOCATION_FILE (input_location
);
9135 /* Just use the file's basename, because the full pathname
9136 might be quite long. */
9137 p
= q
= ASTRDUP (lbasename (file
));
9141 /* Otherwise, the name must be unique across the entire link.
9142 We don't have anything that we know to be unique to this translation
9143 unit, so use what we do have and throw in some randomness. */
9145 const char *name
= weak_global_object_name
;
9146 const char *file
= main_input_filename
;
9151 file
= LOCATION_FILE (input_location
);
9153 len
= strlen (file
);
9154 q
= (char *) alloca (9 + 17 + len
+ 1);
9155 memcpy (q
, file
, len
+ 1);
9157 snprintf (q
+ len
, 9 + 17 + 1, "_%08X_" HOST_WIDE_INT_PRINT_HEX
,
9158 crc32_string (0, name
), get_random_seed (false));
9163 clean_symbol_name (q
);
9164 buf
= (char *) alloca (sizeof (FILE_FUNCTION_FORMAT
) + strlen (p
)
9167 /* Set up the name of the file-level functions we may need.
9168 Use a global object (which is already required to be unique over
9169 the program) rather than the file name (which imposes extra
9171 sprintf (buf
, FILE_FUNCTION_FORMAT
, type
, p
);
9173 return get_identifier (buf
);
9176 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
9178 /* Complain that the tree code of NODE does not match the expected 0
9179 terminated list of trailing codes. The trailing code list can be
9180 empty, for a more vague error message. FILE, LINE, and FUNCTION
9181 are of the caller. */
9184 tree_check_failed (const_tree node
, const char *file
,
9185 int line
, const char *function
, ...)
9189 unsigned length
= 0;
9190 enum tree_code code
;
9192 va_start (args
, function
);
9193 while ((code
= (enum tree_code
) va_arg (args
, int)))
9194 length
+= 4 + strlen (get_tree_code_name (code
));
9199 va_start (args
, function
);
9200 length
+= strlen ("expected ");
9201 buffer
= tmp
= (char *) alloca (length
);
9203 while ((code
= (enum tree_code
) va_arg (args
, int)))
9205 const char *prefix
= length
? " or " : "expected ";
9207 strcpy (tmp
+ length
, prefix
);
9208 length
+= strlen (prefix
);
9209 strcpy (tmp
+ length
, get_tree_code_name (code
));
9210 length
+= strlen (get_tree_code_name (code
));
9215 buffer
= "unexpected node";
9217 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9218 buffer
, get_tree_code_name (TREE_CODE (node
)),
9219 function
, trim_filename (file
), line
);
9222 /* Complain that the tree code of NODE does match the expected 0
9223 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
9227 tree_not_check_failed (const_tree node
, const char *file
,
9228 int line
, const char *function
, ...)
9232 unsigned length
= 0;
9233 enum tree_code code
;
9235 va_start (args
, function
);
9236 while ((code
= (enum tree_code
) va_arg (args
, int)))
9237 length
+= 4 + strlen (get_tree_code_name (code
));
9239 va_start (args
, function
);
9240 buffer
= (char *) alloca (length
);
9242 while ((code
= (enum tree_code
) va_arg (args
, int)))
9246 strcpy (buffer
+ length
, " or ");
9249 strcpy (buffer
+ length
, get_tree_code_name (code
));
9250 length
+= strlen (get_tree_code_name (code
));
9254 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
9255 buffer
, get_tree_code_name (TREE_CODE (node
)),
9256 function
, trim_filename (file
), line
);
9259 /* Similar to tree_check_failed, except that we check for a class of tree
9260 code, given in CL. */
9263 tree_class_check_failed (const_tree node
, const enum tree_code_class cl
,
9264 const char *file
, int line
, const char *function
)
9267 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
9268 TREE_CODE_CLASS_STRING (cl
),
9269 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
9270 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9273 /* Similar to tree_check_failed, except that instead of specifying a
9274 dozen codes, use the knowledge that they're all sequential. */
9277 tree_range_check_failed (const_tree node
, const char *file
, int line
,
9278 const char *function
, enum tree_code c1
,
9282 unsigned length
= 0;
9285 for (c
= c1
; c
<= c2
; ++c
)
9286 length
+= 4 + strlen (get_tree_code_name ((enum tree_code
) c
));
9288 length
+= strlen ("expected ");
9289 buffer
= (char *) alloca (length
);
9292 for (c
= c1
; c
<= c2
; ++c
)
9294 const char *prefix
= length
? " or " : "expected ";
9296 strcpy (buffer
+ length
, prefix
);
9297 length
+= strlen (prefix
);
9298 strcpy (buffer
+ length
, get_tree_code_name ((enum tree_code
) c
));
9299 length
+= strlen (get_tree_code_name ((enum tree_code
) c
));
9302 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9303 buffer
, get_tree_code_name (TREE_CODE (node
)),
9304 function
, trim_filename (file
), line
);
9308 /* Similar to tree_check_failed, except that we check that a tree does
9309 not have the specified code, given in CL. */
9312 tree_not_class_check_failed (const_tree node
, const enum tree_code_class cl
,
9313 const char *file
, int line
, const char *function
)
9316 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
9317 TREE_CODE_CLASS_STRING (cl
),
9318 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
9319 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9323 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
9326 omp_clause_check_failed (const_tree node
, const char *file
, int line
,
9327 const char *function
, enum omp_clause_code code
)
9329 internal_error ("tree check: expected omp_clause %s, have %s in %s, at %s:%d",
9330 omp_clause_code_name
[code
], get_tree_code_name (TREE_CODE (node
)),
9331 function
, trim_filename (file
), line
);
9335 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
9338 omp_clause_range_check_failed (const_tree node
, const char *file
, int line
,
9339 const char *function
, enum omp_clause_code c1
,
9340 enum omp_clause_code c2
)
9343 unsigned length
= 0;
9346 for (c
= c1
; c
<= c2
; ++c
)
9347 length
+= 4 + strlen (omp_clause_code_name
[c
]);
9349 length
+= strlen ("expected ");
9350 buffer
= (char *) alloca (length
);
9353 for (c
= c1
; c
<= c2
; ++c
)
9355 const char *prefix
= length
? " or " : "expected ";
9357 strcpy (buffer
+ length
, prefix
);
9358 length
+= strlen (prefix
);
9359 strcpy (buffer
+ length
, omp_clause_code_name
[c
]);
9360 length
+= strlen (omp_clause_code_name
[c
]);
9363 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9364 buffer
, omp_clause_code_name
[TREE_CODE (node
)],
9365 function
, trim_filename (file
), line
);
9369 #undef DEFTREESTRUCT
9370 #define DEFTREESTRUCT(VAL, NAME) NAME,
9372 static const char *ts_enum_names
[] = {
9373 #include "treestruct.def"
9375 #undef DEFTREESTRUCT
9377 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
9379 /* Similar to tree_class_check_failed, except that we check for
9380 whether CODE contains the tree structure identified by EN. */
9383 tree_contains_struct_check_failed (const_tree node
,
9384 const enum tree_node_structure_enum en
,
9385 const char *file
, int line
,
9386 const char *function
)
9389 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
9391 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9395 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9396 (dynamically sized) vector. */
9399 tree_int_cst_elt_check_failed (int idx
, int len
, const char *file
, int line
,
9400 const char *function
)
9403 ("tree check: accessed elt %d of tree_int_cst with %d elts in %s, at %s:%d",
9404 idx
+ 1, len
, function
, trim_filename (file
), line
);
9407 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9408 (dynamically sized) vector. */
9411 tree_vec_elt_check_failed (int idx
, int len
, const char *file
, int line
,
9412 const char *function
)
9415 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
9416 idx
+ 1, len
, function
, trim_filename (file
), line
);
9419 /* Similar to above, except that the check is for the bounds of the operand
9420 vector of an expression node EXP. */
9423 tree_operand_check_failed (int idx
, const_tree exp
, const char *file
,
9424 int line
, const char *function
)
9426 enum tree_code code
= TREE_CODE (exp
);
9428 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
9429 idx
+ 1, get_tree_code_name (code
), TREE_OPERAND_LENGTH (exp
),
9430 function
, trim_filename (file
), line
);
9433 /* Similar to above, except that the check is for the number of
9434 operands of an OMP_CLAUSE node. */
9437 omp_clause_operand_check_failed (int idx
, const_tree t
, const char *file
,
9438 int line
, const char *function
)
9441 ("tree check: accessed operand %d of omp_clause %s with %d operands "
9442 "in %s, at %s:%d", idx
+ 1, omp_clause_code_name
[OMP_CLAUSE_CODE (t
)],
9443 omp_clause_num_ops
[OMP_CLAUSE_CODE (t
)], function
,
9444 trim_filename (file
), line
);
9446 #endif /* ENABLE_TREE_CHECKING */
9448 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
9449 and mapped to the machine mode MODE. Initialize its fields and build
9450 the information necessary for debugging output. */
9453 make_vector_type (tree innertype
, int nunits
, machine_mode mode
)
9456 inchash::hash hstate
;
9458 t
= make_node (VECTOR_TYPE
);
9459 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (innertype
);
9460 SET_TYPE_VECTOR_SUBPARTS (t
, nunits
);
9461 SET_TYPE_MODE (t
, mode
);
9463 if (TYPE_STRUCTURAL_EQUALITY_P (innertype
))
9464 SET_TYPE_STRUCTURAL_EQUALITY (t
);
9465 else if (TYPE_CANONICAL (innertype
) != innertype
9466 || mode
!= VOIDmode
)
9468 = make_vector_type (TYPE_CANONICAL (innertype
), nunits
, VOIDmode
);
9472 hstate
.add_wide_int (VECTOR_TYPE
);
9473 hstate
.add_wide_int (nunits
);
9474 hstate
.add_wide_int (mode
);
9475 hstate
.add_object (TYPE_HASH (TREE_TYPE (t
)));
9476 t
= type_hash_canon (hstate
.end (), t
);
9478 /* We have built a main variant, based on the main variant of the
9479 inner type. Use it to build the variant we return. */
9480 if ((TYPE_ATTRIBUTES (innertype
) || TYPE_QUALS (innertype
))
9481 && TREE_TYPE (t
) != innertype
)
9482 return build_type_attribute_qual_variant (t
,
9483 TYPE_ATTRIBUTES (innertype
),
9484 TYPE_QUALS (innertype
));
9490 make_or_reuse_type (unsigned size
, int unsignedp
)
9494 if (size
== INT_TYPE_SIZE
)
9495 return unsignedp
? unsigned_type_node
: integer_type_node
;
9496 if (size
== CHAR_TYPE_SIZE
)
9497 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
9498 if (size
== SHORT_TYPE_SIZE
)
9499 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
9500 if (size
== LONG_TYPE_SIZE
)
9501 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
9502 if (size
== LONG_LONG_TYPE_SIZE
)
9503 return (unsignedp
? long_long_unsigned_type_node
9504 : long_long_integer_type_node
);
9506 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
9507 if (size
== int_n_data
[i
].bitsize
9508 && int_n_enabled_p
[i
])
9509 return (unsignedp
? int_n_trees
[i
].unsigned_type
9510 : int_n_trees
[i
].signed_type
);
9513 return make_unsigned_type (size
);
9515 return make_signed_type (size
);
9518 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
9521 make_or_reuse_fract_type (unsigned size
, int unsignedp
, int satp
)
9525 if (size
== SHORT_FRACT_TYPE_SIZE
)
9526 return unsignedp
? sat_unsigned_short_fract_type_node
9527 : sat_short_fract_type_node
;
9528 if (size
== FRACT_TYPE_SIZE
)
9529 return unsignedp
? sat_unsigned_fract_type_node
: sat_fract_type_node
;
9530 if (size
== LONG_FRACT_TYPE_SIZE
)
9531 return unsignedp
? sat_unsigned_long_fract_type_node
9532 : sat_long_fract_type_node
;
9533 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
9534 return unsignedp
? sat_unsigned_long_long_fract_type_node
9535 : sat_long_long_fract_type_node
;
9539 if (size
== SHORT_FRACT_TYPE_SIZE
)
9540 return unsignedp
? unsigned_short_fract_type_node
9541 : short_fract_type_node
;
9542 if (size
== FRACT_TYPE_SIZE
)
9543 return unsignedp
? unsigned_fract_type_node
: fract_type_node
;
9544 if (size
== LONG_FRACT_TYPE_SIZE
)
9545 return unsignedp
? unsigned_long_fract_type_node
9546 : long_fract_type_node
;
9547 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
9548 return unsignedp
? unsigned_long_long_fract_type_node
9549 : long_long_fract_type_node
;
9552 return make_fract_type (size
, unsignedp
, satp
);
9555 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
9558 make_or_reuse_accum_type (unsigned size
, int unsignedp
, int satp
)
9562 if (size
== SHORT_ACCUM_TYPE_SIZE
)
9563 return unsignedp
? sat_unsigned_short_accum_type_node
9564 : sat_short_accum_type_node
;
9565 if (size
== ACCUM_TYPE_SIZE
)
9566 return unsignedp
? sat_unsigned_accum_type_node
: sat_accum_type_node
;
9567 if (size
== LONG_ACCUM_TYPE_SIZE
)
9568 return unsignedp
? sat_unsigned_long_accum_type_node
9569 : sat_long_accum_type_node
;
9570 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
9571 return unsignedp
? sat_unsigned_long_long_accum_type_node
9572 : sat_long_long_accum_type_node
;
9576 if (size
== SHORT_ACCUM_TYPE_SIZE
)
9577 return unsignedp
? unsigned_short_accum_type_node
9578 : short_accum_type_node
;
9579 if (size
== ACCUM_TYPE_SIZE
)
9580 return unsignedp
? unsigned_accum_type_node
: accum_type_node
;
9581 if (size
== LONG_ACCUM_TYPE_SIZE
)
9582 return unsignedp
? unsigned_long_accum_type_node
9583 : long_accum_type_node
;
9584 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
9585 return unsignedp
? unsigned_long_long_accum_type_node
9586 : long_long_accum_type_node
;
9589 return make_accum_type (size
, unsignedp
, satp
);
9593 /* Create an atomic variant node for TYPE. This routine is called
9594 during initialization of data types to create the 5 basic atomic
9595 types. The generic build_variant_type function requires these to
9596 already be set up in order to function properly, so cannot be
9597 called from there. If ALIGN is non-zero, then ensure alignment is
9598 overridden to this value. */
9601 build_atomic_base (tree type
, unsigned int align
)
9605 /* Make sure its not already registered. */
9606 if ((t
= get_qualified_type (type
, TYPE_QUAL_ATOMIC
)))
9609 t
= build_variant_type_copy (type
);
9610 set_type_quals (t
, TYPE_QUAL_ATOMIC
);
9613 TYPE_ALIGN (t
) = align
;
9618 /* Create nodes for all integer types (and error_mark_node) using the sizes
9619 of C datatypes. SIGNED_CHAR specifies whether char is signed,
9620 SHORT_DOUBLE specifies whether double should be of the same precision
9624 build_common_tree_nodes (bool signed_char
, bool short_double
)
9628 error_mark_node
= make_node (ERROR_MARK
);
9629 TREE_TYPE (error_mark_node
) = error_mark_node
;
9631 initialize_sizetypes ();
9633 /* Define both `signed char' and `unsigned char'. */
9634 signed_char_type_node
= make_signed_type (CHAR_TYPE_SIZE
);
9635 TYPE_STRING_FLAG (signed_char_type_node
) = 1;
9636 unsigned_char_type_node
= make_unsigned_type (CHAR_TYPE_SIZE
);
9637 TYPE_STRING_FLAG (unsigned_char_type_node
) = 1;
9639 /* Define `char', which is like either `signed char' or `unsigned char'
9640 but not the same as either. */
9643 ? make_signed_type (CHAR_TYPE_SIZE
)
9644 : make_unsigned_type (CHAR_TYPE_SIZE
));
9645 TYPE_STRING_FLAG (char_type_node
) = 1;
9647 short_integer_type_node
= make_signed_type (SHORT_TYPE_SIZE
);
9648 short_unsigned_type_node
= make_unsigned_type (SHORT_TYPE_SIZE
);
9649 integer_type_node
= make_signed_type (INT_TYPE_SIZE
);
9650 unsigned_type_node
= make_unsigned_type (INT_TYPE_SIZE
);
9651 long_integer_type_node
= make_signed_type (LONG_TYPE_SIZE
);
9652 long_unsigned_type_node
= make_unsigned_type (LONG_TYPE_SIZE
);
9653 long_long_integer_type_node
= make_signed_type (LONG_LONG_TYPE_SIZE
);
9654 long_long_unsigned_type_node
= make_unsigned_type (LONG_LONG_TYPE_SIZE
);
9656 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
9658 int_n_trees
[i
].signed_type
= make_signed_type (int_n_data
[i
].bitsize
);
9659 int_n_trees
[i
].unsigned_type
= make_unsigned_type (int_n_data
[i
].bitsize
);
9660 TYPE_SIZE (int_n_trees
[i
].signed_type
) = bitsize_int (int_n_data
[i
].bitsize
);
9661 TYPE_SIZE (int_n_trees
[i
].unsigned_type
) = bitsize_int (int_n_data
[i
].bitsize
);
9663 if (int_n_data
[i
].bitsize
> LONG_LONG_TYPE_SIZE
9664 && int_n_enabled_p
[i
])
9666 integer_types
[itk_intN_0
+ i
* 2] = int_n_trees
[i
].signed_type
;
9667 integer_types
[itk_unsigned_intN_0
+ i
* 2] = int_n_trees
[i
].unsigned_type
;
9671 /* Define a boolean type. This type only represents boolean values but
9672 may be larger than char depending on the value of BOOL_TYPE_SIZE. */
9673 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
9674 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
9675 TYPE_PRECISION (boolean_type_node
) = 1;
9676 TYPE_MAX_VALUE (boolean_type_node
) = build_int_cst (boolean_type_node
, 1);
9678 /* Define what type to use for size_t. */
9679 if (strcmp (SIZE_TYPE
, "unsigned int") == 0)
9680 size_type_node
= unsigned_type_node
;
9681 else if (strcmp (SIZE_TYPE
, "long unsigned int") == 0)
9682 size_type_node
= long_unsigned_type_node
;
9683 else if (strcmp (SIZE_TYPE
, "long long unsigned int") == 0)
9684 size_type_node
= long_long_unsigned_type_node
;
9685 else if (strcmp (SIZE_TYPE
, "short unsigned int") == 0)
9686 size_type_node
= short_unsigned_type_node
;
9691 size_type_node
= NULL_TREE
;
9692 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
9693 if (int_n_enabled_p
[i
])
9696 sprintf (name
, "__int%d unsigned", int_n_data
[i
].bitsize
);
9698 if (strcmp (name
, SIZE_TYPE
) == 0)
9700 size_type_node
= int_n_trees
[i
].unsigned_type
;
9703 if (size_type_node
== NULL_TREE
)
9707 /* Fill in the rest of the sized types. Reuse existing type nodes
9709 intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 0);
9710 intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 0);
9711 intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 0);
9712 intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 0);
9713 intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 0);
9715 unsigned_intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 1);
9716 unsigned_intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 1);
9717 unsigned_intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 1);
9718 unsigned_intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 1);
9719 unsigned_intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 1);
9721 /* Don't call build_qualified type for atomics. That routine does
9722 special processing for atomics, and until they are initialized
9723 it's better not to make that call.
9725 Check to see if there is a target override for atomic types. */
9727 atomicQI_type_node
= build_atomic_base (unsigned_intQI_type_node
,
9728 targetm
.atomic_align_for_mode (QImode
));
9729 atomicHI_type_node
= build_atomic_base (unsigned_intHI_type_node
,
9730 targetm
.atomic_align_for_mode (HImode
));
9731 atomicSI_type_node
= build_atomic_base (unsigned_intSI_type_node
,
9732 targetm
.atomic_align_for_mode (SImode
));
9733 atomicDI_type_node
= build_atomic_base (unsigned_intDI_type_node
,
9734 targetm
.atomic_align_for_mode (DImode
));
9735 atomicTI_type_node
= build_atomic_base (unsigned_intTI_type_node
,
9736 targetm
.atomic_align_for_mode (TImode
));
9738 access_public_node
= get_identifier ("public");
9739 access_protected_node
= get_identifier ("protected");
9740 access_private_node
= get_identifier ("private");
9742 /* Define these next since types below may used them. */
9743 integer_zero_node
= build_int_cst (integer_type_node
, 0);
9744 integer_one_node
= build_int_cst (integer_type_node
, 1);
9745 integer_three_node
= build_int_cst (integer_type_node
, 3);
9746 integer_minus_one_node
= build_int_cst (integer_type_node
, -1);
9748 size_zero_node
= size_int (0);
9749 size_one_node
= size_int (1);
9750 bitsize_zero_node
= bitsize_int (0);
9751 bitsize_one_node
= bitsize_int (1);
9752 bitsize_unit_node
= bitsize_int (BITS_PER_UNIT
);
9754 boolean_false_node
= TYPE_MIN_VALUE (boolean_type_node
);
9755 boolean_true_node
= TYPE_MAX_VALUE (boolean_type_node
);
9757 void_type_node
= make_node (VOID_TYPE
);
9758 layout_type (void_type_node
);
9760 /* We are not going to have real types in C with less than byte alignment,
9761 so we might as well not have any types that claim to have it. */
9762 TYPE_ALIGN (void_type_node
) = BITS_PER_UNIT
;
9763 TYPE_USER_ALIGN (void_type_node
) = 0;
9765 void_node
= make_node (VOID_CST
);
9766 TREE_TYPE (void_node
) = void_type_node
;
9768 null_pointer_node
= build_int_cst (build_pointer_type (void_type_node
), 0);
9769 layout_type (TREE_TYPE (null_pointer_node
));
9771 ptr_type_node
= build_pointer_type (void_type_node
);
9773 = build_pointer_type (build_type_variant (void_type_node
, 1, 0));
9774 fileptr_type_node
= ptr_type_node
;
9776 pointer_sized_int_node
= build_nonstandard_integer_type (POINTER_SIZE
, 1);
9778 float_type_node
= make_node (REAL_TYPE
);
9779 TYPE_PRECISION (float_type_node
) = FLOAT_TYPE_SIZE
;
9780 layout_type (float_type_node
);
9782 double_type_node
= make_node (REAL_TYPE
);
9784 TYPE_PRECISION (double_type_node
) = FLOAT_TYPE_SIZE
;
9786 TYPE_PRECISION (double_type_node
) = DOUBLE_TYPE_SIZE
;
9787 layout_type (double_type_node
);
9789 long_double_type_node
= make_node (REAL_TYPE
);
9790 TYPE_PRECISION (long_double_type_node
) = LONG_DOUBLE_TYPE_SIZE
;
9791 layout_type (long_double_type_node
);
9793 float_ptr_type_node
= build_pointer_type (float_type_node
);
9794 double_ptr_type_node
= build_pointer_type (double_type_node
);
9795 long_double_ptr_type_node
= build_pointer_type (long_double_type_node
);
9796 integer_ptr_type_node
= build_pointer_type (integer_type_node
);
9798 /* Fixed size integer types. */
9799 uint16_type_node
= make_or_reuse_type (16, 1);
9800 uint32_type_node
= make_or_reuse_type (32, 1);
9801 uint64_type_node
= make_or_reuse_type (64, 1);
9803 /* Decimal float types. */
9804 dfloat32_type_node
= make_node (REAL_TYPE
);
9805 TYPE_PRECISION (dfloat32_type_node
) = DECIMAL32_TYPE_SIZE
;
9806 layout_type (dfloat32_type_node
);
9807 SET_TYPE_MODE (dfloat32_type_node
, SDmode
);
9808 dfloat32_ptr_type_node
= build_pointer_type (dfloat32_type_node
);
9810 dfloat64_type_node
= make_node (REAL_TYPE
);
9811 TYPE_PRECISION (dfloat64_type_node
) = DECIMAL64_TYPE_SIZE
;
9812 layout_type (dfloat64_type_node
);
9813 SET_TYPE_MODE (dfloat64_type_node
, DDmode
);
9814 dfloat64_ptr_type_node
= build_pointer_type (dfloat64_type_node
);
9816 dfloat128_type_node
= make_node (REAL_TYPE
);
9817 TYPE_PRECISION (dfloat128_type_node
) = DECIMAL128_TYPE_SIZE
;
9818 layout_type (dfloat128_type_node
);
9819 SET_TYPE_MODE (dfloat128_type_node
, TDmode
);
9820 dfloat128_ptr_type_node
= build_pointer_type (dfloat128_type_node
);
9822 complex_integer_type_node
= build_complex_type (integer_type_node
);
9823 complex_float_type_node
= build_complex_type (float_type_node
);
9824 complex_double_type_node
= build_complex_type (double_type_node
);
9825 complex_long_double_type_node
= build_complex_type (long_double_type_node
);
9827 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
9828 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
9829 sat_ ## KIND ## _type_node = \
9830 make_sat_signed_ ## KIND ## _type (SIZE); \
9831 sat_unsigned_ ## KIND ## _type_node = \
9832 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9833 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9834 unsigned_ ## KIND ## _type_node = \
9835 make_unsigned_ ## KIND ## _type (SIZE);
9837 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
9838 sat_ ## WIDTH ## KIND ## _type_node = \
9839 make_sat_signed_ ## KIND ## _type (SIZE); \
9840 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
9841 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9842 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9843 unsigned_ ## WIDTH ## KIND ## _type_node = \
9844 make_unsigned_ ## KIND ## _type (SIZE);
9846 /* Make fixed-point type nodes based on four different widths. */
9847 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
9848 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
9849 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
9850 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
9851 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
9853 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
9854 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
9855 NAME ## _type_node = \
9856 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
9857 u ## NAME ## _type_node = \
9858 make_or_reuse_unsigned_ ## KIND ## _type \
9859 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
9860 sat_ ## NAME ## _type_node = \
9861 make_or_reuse_sat_signed_ ## KIND ## _type \
9862 (GET_MODE_BITSIZE (MODE ## mode)); \
9863 sat_u ## NAME ## _type_node = \
9864 make_or_reuse_sat_unsigned_ ## KIND ## _type \
9865 (GET_MODE_BITSIZE (U ## MODE ## mode));
9867 /* Fixed-point type and mode nodes. */
9868 MAKE_FIXED_TYPE_NODE_FAMILY (fract
, FRACT
)
9869 MAKE_FIXED_TYPE_NODE_FAMILY (accum
, ACCUM
)
9870 MAKE_FIXED_MODE_NODE (fract
, qq
, QQ
)
9871 MAKE_FIXED_MODE_NODE (fract
, hq
, HQ
)
9872 MAKE_FIXED_MODE_NODE (fract
, sq
, SQ
)
9873 MAKE_FIXED_MODE_NODE (fract
, dq
, DQ
)
9874 MAKE_FIXED_MODE_NODE (fract
, tq
, TQ
)
9875 MAKE_FIXED_MODE_NODE (accum
, ha
, HA
)
9876 MAKE_FIXED_MODE_NODE (accum
, sa
, SA
)
9877 MAKE_FIXED_MODE_NODE (accum
, da
, DA
)
9878 MAKE_FIXED_MODE_NODE (accum
, ta
, TA
)
9881 tree t
= targetm
.build_builtin_va_list ();
9883 /* Many back-ends define record types without setting TYPE_NAME.
9884 If we copied the record type here, we'd keep the original
9885 record type without a name. This breaks name mangling. So,
9886 don't copy record types and let c_common_nodes_and_builtins()
9887 declare the type to be __builtin_va_list. */
9888 if (TREE_CODE (t
) != RECORD_TYPE
)
9889 t
= build_variant_type_copy (t
);
9891 va_list_type_node
= t
;
9895 /* Modify DECL for given flags.
9896 TM_PURE attribute is set only on types, so the function will modify
9897 DECL's type when ECF_TM_PURE is used. */
9900 set_call_expr_flags (tree decl
, int flags
)
9902 if (flags
& ECF_NOTHROW
)
9903 TREE_NOTHROW (decl
) = 1;
9904 if (flags
& ECF_CONST
)
9905 TREE_READONLY (decl
) = 1;
9906 if (flags
& ECF_PURE
)
9907 DECL_PURE_P (decl
) = 1;
9908 if (flags
& ECF_LOOPING_CONST_OR_PURE
)
9909 DECL_LOOPING_CONST_OR_PURE_P (decl
) = 1;
9910 if (flags
& ECF_NOVOPS
)
9911 DECL_IS_NOVOPS (decl
) = 1;
9912 if (flags
& ECF_NORETURN
)
9913 TREE_THIS_VOLATILE (decl
) = 1;
9914 if (flags
& ECF_MALLOC
)
9915 DECL_IS_MALLOC (decl
) = 1;
9916 if (flags
& ECF_RETURNS_TWICE
)
9917 DECL_IS_RETURNS_TWICE (decl
) = 1;
9918 if (flags
& ECF_LEAF
)
9919 DECL_ATTRIBUTES (decl
) = tree_cons (get_identifier ("leaf"),
9920 NULL
, DECL_ATTRIBUTES (decl
));
9921 if ((flags
& ECF_TM_PURE
) && flag_tm
)
9922 apply_tm_attr (decl
, get_identifier ("transaction_pure"));
9923 /* Looping const or pure is implied by noreturn.
9924 There is currently no way to declare looping const or looping pure alone. */
9925 gcc_assert (!(flags
& ECF_LOOPING_CONST_OR_PURE
)
9926 || ((flags
& ECF_NORETURN
) && (flags
& (ECF_CONST
| ECF_PURE
))));
9930 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
9933 local_define_builtin (const char *name
, tree type
, enum built_in_function code
,
9934 const char *library_name
, int ecf_flags
)
9938 decl
= add_builtin_function (name
, type
, code
, BUILT_IN_NORMAL
,
9939 library_name
, NULL_TREE
);
9940 set_call_expr_flags (decl
, ecf_flags
);
9942 set_builtin_decl (code
, decl
, true);
9945 /* Call this function after instantiating all builtins that the language
9946 front end cares about. This will build the rest of the builtins
9947 and internal functions that are relied upon by the tree optimizers and
9951 build_common_builtin_nodes (void)
9956 if (!builtin_decl_explicit_p (BUILT_IN_UNREACHABLE
))
9958 ftype
= build_function_type (void_type_node
, void_list_node
);
9959 local_define_builtin ("__builtin_unreachable", ftype
, BUILT_IN_UNREACHABLE
,
9960 "__builtin_unreachable",
9961 ECF_NOTHROW
| ECF_LEAF
| ECF_NORETURN
9962 | ECF_CONST
| ECF_LEAF
);
9965 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
)
9966 || !builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
9968 ftype
= build_function_type_list (ptr_type_node
,
9969 ptr_type_node
, const_ptr_type_node
,
9970 size_type_node
, NULL_TREE
);
9972 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
))
9973 local_define_builtin ("__builtin_memcpy", ftype
, BUILT_IN_MEMCPY
,
9974 "memcpy", ECF_NOTHROW
| ECF_LEAF
);
9975 if (!builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
9976 local_define_builtin ("__builtin_memmove", ftype
, BUILT_IN_MEMMOVE
,
9977 "memmove", ECF_NOTHROW
| ECF_LEAF
);
9980 if (!builtin_decl_explicit_p (BUILT_IN_MEMCMP
))
9982 ftype
= build_function_type_list (integer_type_node
, const_ptr_type_node
,
9983 const_ptr_type_node
, size_type_node
,
9985 local_define_builtin ("__builtin_memcmp", ftype
, BUILT_IN_MEMCMP
,
9986 "memcmp", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
9989 if (!builtin_decl_explicit_p (BUILT_IN_MEMSET
))
9991 ftype
= build_function_type_list (ptr_type_node
,
9992 ptr_type_node
, integer_type_node
,
9993 size_type_node
, NULL_TREE
);
9994 local_define_builtin ("__builtin_memset", ftype
, BUILT_IN_MEMSET
,
9995 "memset", ECF_NOTHROW
| ECF_LEAF
);
9998 if (!builtin_decl_explicit_p (BUILT_IN_ALLOCA
))
10000 ftype
= build_function_type_list (ptr_type_node
,
10001 size_type_node
, NULL_TREE
);
10002 local_define_builtin ("__builtin_alloca", ftype
, BUILT_IN_ALLOCA
,
10003 "alloca", ECF_MALLOC
| ECF_NOTHROW
| ECF_LEAF
);
10006 ftype
= build_function_type_list (ptr_type_node
, size_type_node
,
10007 size_type_node
, NULL_TREE
);
10008 local_define_builtin ("__builtin_alloca_with_align", ftype
,
10009 BUILT_IN_ALLOCA_WITH_ALIGN
, "alloca",
10010 ECF_MALLOC
| ECF_NOTHROW
| ECF_LEAF
);
10012 /* If we're checking the stack, `alloca' can throw. */
10013 if (flag_stack_check
)
10015 TREE_NOTHROW (builtin_decl_explicit (BUILT_IN_ALLOCA
)) = 0;
10016 TREE_NOTHROW (builtin_decl_explicit (BUILT_IN_ALLOCA_WITH_ALIGN
)) = 0;
10019 ftype
= build_function_type_list (void_type_node
,
10020 ptr_type_node
, ptr_type_node
,
10021 ptr_type_node
, NULL_TREE
);
10022 local_define_builtin ("__builtin_init_trampoline", ftype
,
10023 BUILT_IN_INIT_TRAMPOLINE
,
10024 "__builtin_init_trampoline", ECF_NOTHROW
| ECF_LEAF
);
10025 local_define_builtin ("__builtin_init_heap_trampoline", ftype
,
10026 BUILT_IN_INIT_HEAP_TRAMPOLINE
,
10027 "__builtin_init_heap_trampoline",
10028 ECF_NOTHROW
| ECF_LEAF
);
10030 ftype
= build_function_type_list (ptr_type_node
, ptr_type_node
, NULL_TREE
);
10031 local_define_builtin ("__builtin_adjust_trampoline", ftype
,
10032 BUILT_IN_ADJUST_TRAMPOLINE
,
10033 "__builtin_adjust_trampoline",
10034 ECF_CONST
| ECF_NOTHROW
);
10036 ftype
= build_function_type_list (void_type_node
,
10037 ptr_type_node
, ptr_type_node
, NULL_TREE
);
10038 local_define_builtin ("__builtin_nonlocal_goto", ftype
,
10039 BUILT_IN_NONLOCAL_GOTO
,
10040 "__builtin_nonlocal_goto",
10041 ECF_NORETURN
| ECF_NOTHROW
);
10043 ftype
= build_function_type_list (void_type_node
,
10044 ptr_type_node
, ptr_type_node
, NULL_TREE
);
10045 local_define_builtin ("__builtin_setjmp_setup", ftype
,
10046 BUILT_IN_SETJMP_SETUP
,
10047 "__builtin_setjmp_setup", ECF_NOTHROW
);
10049 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10050 local_define_builtin ("__builtin_setjmp_receiver", ftype
,
10051 BUILT_IN_SETJMP_RECEIVER
,
10052 "__builtin_setjmp_receiver", ECF_NOTHROW
| ECF_LEAF
);
10054 ftype
= build_function_type_list (ptr_type_node
, NULL_TREE
);
10055 local_define_builtin ("__builtin_stack_save", ftype
, BUILT_IN_STACK_SAVE
,
10056 "__builtin_stack_save", ECF_NOTHROW
| ECF_LEAF
);
10058 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10059 local_define_builtin ("__builtin_stack_restore", ftype
,
10060 BUILT_IN_STACK_RESTORE
,
10061 "__builtin_stack_restore", ECF_NOTHROW
| ECF_LEAF
);
10063 /* If there's a possibility that we might use the ARM EABI, build the
10064 alternate __cxa_end_cleanup node used to resume from C++ and Java. */
10065 if (targetm
.arm_eabi_unwinder
)
10067 ftype
= build_function_type_list (void_type_node
, NULL_TREE
);
10068 local_define_builtin ("__builtin_cxa_end_cleanup", ftype
,
10069 BUILT_IN_CXA_END_CLEANUP
,
10070 "__cxa_end_cleanup", ECF_NORETURN
| ECF_LEAF
);
10073 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10074 local_define_builtin ("__builtin_unwind_resume", ftype
,
10075 BUILT_IN_UNWIND_RESUME
,
10076 ((targetm_common
.except_unwind_info (&global_options
)
10078 ? "_Unwind_SjLj_Resume" : "_Unwind_Resume"),
10081 if (builtin_decl_explicit (BUILT_IN_RETURN_ADDRESS
) == NULL_TREE
)
10083 ftype
= build_function_type_list (ptr_type_node
, integer_type_node
,
10085 local_define_builtin ("__builtin_return_address", ftype
,
10086 BUILT_IN_RETURN_ADDRESS
,
10087 "__builtin_return_address",
10091 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
)
10092 || !builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
10094 ftype
= build_function_type_list (void_type_node
, ptr_type_node
,
10095 ptr_type_node
, NULL_TREE
);
10096 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
))
10097 local_define_builtin ("__cyg_profile_func_enter", ftype
,
10098 BUILT_IN_PROFILE_FUNC_ENTER
,
10099 "__cyg_profile_func_enter", 0);
10100 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
10101 local_define_builtin ("__cyg_profile_func_exit", ftype
,
10102 BUILT_IN_PROFILE_FUNC_EXIT
,
10103 "__cyg_profile_func_exit", 0);
10106 /* The exception object and filter values from the runtime. The argument
10107 must be zero before exception lowering, i.e. from the front end. After
10108 exception lowering, it will be the region number for the exception
10109 landing pad. These functions are PURE instead of CONST to prevent
10110 them from being hoisted past the exception edge that will initialize
10111 its value in the landing pad. */
10112 ftype
= build_function_type_list (ptr_type_node
,
10113 integer_type_node
, NULL_TREE
);
10114 ecf_flags
= ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
;
10115 /* Only use TM_PURE if we we have TM language support. */
10116 if (builtin_decl_explicit_p (BUILT_IN_TM_LOAD_1
))
10117 ecf_flags
|= ECF_TM_PURE
;
10118 local_define_builtin ("__builtin_eh_pointer", ftype
, BUILT_IN_EH_POINTER
,
10119 "__builtin_eh_pointer", ecf_flags
);
10121 tmp
= lang_hooks
.types
.type_for_mode (targetm
.eh_return_filter_mode (), 0);
10122 ftype
= build_function_type_list (tmp
, integer_type_node
, NULL_TREE
);
10123 local_define_builtin ("__builtin_eh_filter", ftype
, BUILT_IN_EH_FILTER
,
10124 "__builtin_eh_filter", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10126 ftype
= build_function_type_list (void_type_node
,
10127 integer_type_node
, integer_type_node
,
10129 local_define_builtin ("__builtin_eh_copy_values", ftype
,
10130 BUILT_IN_EH_COPY_VALUES
,
10131 "__builtin_eh_copy_values", ECF_NOTHROW
);
10133 /* Complex multiplication and division. These are handled as builtins
10134 rather than optabs because emit_library_call_value doesn't support
10135 complex. Further, we can do slightly better with folding these
10136 beasties if the real and complex parts of the arguments are separate. */
10140 for (mode
= MIN_MODE_COMPLEX_FLOAT
; mode
<= MAX_MODE_COMPLEX_FLOAT
; ++mode
)
10142 char mode_name_buf
[4], *q
;
10144 enum built_in_function mcode
, dcode
;
10145 tree type
, inner_type
;
10146 const char *prefix
= "__";
10148 if (targetm
.libfunc_gnu_prefix
)
10151 type
= lang_hooks
.types
.type_for_mode ((machine_mode
) mode
, 0);
10154 inner_type
= TREE_TYPE (type
);
10156 ftype
= build_function_type_list (type
, inner_type
, inner_type
,
10157 inner_type
, inner_type
, NULL_TREE
);
10159 mcode
= ((enum built_in_function
)
10160 (BUILT_IN_COMPLEX_MUL_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
10161 dcode
= ((enum built_in_function
)
10162 (BUILT_IN_COMPLEX_DIV_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
10164 for (p
= GET_MODE_NAME (mode
), q
= mode_name_buf
; *p
; p
++, q
++)
10168 built_in_names
[mcode
] = concat (prefix
, "mul", mode_name_buf
, "3",
10170 local_define_builtin (built_in_names
[mcode
], ftype
, mcode
,
10171 built_in_names
[mcode
],
10172 ECF_CONST
| ECF_NOTHROW
| ECF_LEAF
);
10174 built_in_names
[dcode
] = concat (prefix
, "div", mode_name_buf
, "3",
10176 local_define_builtin (built_in_names
[dcode
], ftype
, dcode
,
10177 built_in_names
[dcode
],
10178 ECF_CONST
| ECF_NOTHROW
| ECF_LEAF
);
10182 init_internal_fns ();
10185 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
10188 If we requested a pointer to a vector, build up the pointers that
10189 we stripped off while looking for the inner type. Similarly for
10190 return values from functions.
10192 The argument TYPE is the top of the chain, and BOTTOM is the
10193 new type which we will point to. */
10196 reconstruct_complex_type (tree type
, tree bottom
)
10200 if (TREE_CODE (type
) == POINTER_TYPE
)
10202 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10203 outer
= build_pointer_type_for_mode (inner
, TYPE_MODE (type
),
10204 TYPE_REF_CAN_ALIAS_ALL (type
));
10206 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
10208 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10209 outer
= build_reference_type_for_mode (inner
, TYPE_MODE (type
),
10210 TYPE_REF_CAN_ALIAS_ALL (type
));
10212 else if (TREE_CODE (type
) == ARRAY_TYPE
)
10214 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10215 outer
= build_array_type (inner
, TYPE_DOMAIN (type
));
10217 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10219 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10220 outer
= build_function_type (inner
, TYPE_ARG_TYPES (type
));
10222 else if (TREE_CODE (type
) == METHOD_TYPE
)
10224 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10225 /* The build_method_type_directly() routine prepends 'this' to argument list,
10226 so we must compensate by getting rid of it. */
10228 = build_method_type_directly
10229 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
))),
10231 TREE_CHAIN (TYPE_ARG_TYPES (type
)));
10233 else if (TREE_CODE (type
) == OFFSET_TYPE
)
10235 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10236 outer
= build_offset_type (TYPE_OFFSET_BASETYPE (type
), inner
);
10241 return build_type_attribute_qual_variant (outer
, TYPE_ATTRIBUTES (type
),
10242 TYPE_QUALS (type
));
10245 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
10248 build_vector_type_for_mode (tree innertype
, machine_mode mode
)
10252 switch (GET_MODE_CLASS (mode
))
10254 case MODE_VECTOR_INT
:
10255 case MODE_VECTOR_FLOAT
:
10256 case MODE_VECTOR_FRACT
:
10257 case MODE_VECTOR_UFRACT
:
10258 case MODE_VECTOR_ACCUM
:
10259 case MODE_VECTOR_UACCUM
:
10260 nunits
= GET_MODE_NUNITS (mode
);
10264 /* Check that there are no leftover bits. */
10265 gcc_assert (GET_MODE_BITSIZE (mode
)
10266 % TREE_INT_CST_LOW (TYPE_SIZE (innertype
)) == 0);
10268 nunits
= GET_MODE_BITSIZE (mode
)
10269 / TREE_INT_CST_LOW (TYPE_SIZE (innertype
));
10273 gcc_unreachable ();
10276 return make_vector_type (innertype
, nunits
, mode
);
10279 /* Similarly, but takes the inner type and number of units, which must be
10283 build_vector_type (tree innertype
, int nunits
)
10285 return make_vector_type (innertype
, nunits
, VOIDmode
);
10288 /* Similarly, but builds a variant type with TYPE_VECTOR_OPAQUE set. */
10291 build_opaque_vector_type (tree innertype
, int nunits
)
10293 tree t
= make_vector_type (innertype
, nunits
, VOIDmode
);
10295 /* We always build the non-opaque variant before the opaque one,
10296 so if it already exists, it is TYPE_NEXT_VARIANT of this one. */
10297 cand
= TYPE_NEXT_VARIANT (t
);
10299 && TYPE_VECTOR_OPAQUE (cand
)
10300 && check_qualified_type (cand
, t
, TYPE_QUALS (t
)))
10302 /* Othewise build a variant type and make sure to queue it after
10303 the non-opaque type. */
10304 cand
= build_distinct_type_copy (t
);
10305 TYPE_VECTOR_OPAQUE (cand
) = true;
10306 TYPE_CANONICAL (cand
) = TYPE_CANONICAL (t
);
10307 TYPE_NEXT_VARIANT (cand
) = TYPE_NEXT_VARIANT (t
);
10308 TYPE_NEXT_VARIANT (t
) = cand
;
10309 TYPE_MAIN_VARIANT (cand
) = TYPE_MAIN_VARIANT (t
);
10314 /* Given an initializer INIT, return TRUE if INIT is zero or some
10315 aggregate of zeros. Otherwise return FALSE. */
10317 initializer_zerop (const_tree init
)
10323 switch (TREE_CODE (init
))
10326 return integer_zerop (init
);
10329 /* ??? Note that this is not correct for C4X float formats. There,
10330 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
10331 negative exponent. */
10332 return real_zerop (init
)
10333 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init
));
10336 return fixed_zerop (init
);
10339 return integer_zerop (init
)
10340 || (real_zerop (init
)
10341 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init
)))
10342 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init
))));
10347 for (i
= 0; i
< VECTOR_CST_NELTS (init
); ++i
)
10348 if (!initializer_zerop (VECTOR_CST_ELT (init
, i
)))
10355 unsigned HOST_WIDE_INT idx
;
10357 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init
), idx
, elt
)
10358 if (!initializer_zerop (elt
))
10367 /* We need to loop through all elements to handle cases like
10368 "\0" and "\0foobar". */
10369 for (i
= 0; i
< TREE_STRING_LENGTH (init
); ++i
)
10370 if (TREE_STRING_POINTER (init
)[i
] != '\0')
10381 /* Check if vector VEC consists of all the equal elements and
10382 that the number of elements corresponds to the type of VEC.
10383 The function returns first element of the vector
10384 or NULL_TREE if the vector is not uniform. */
10386 uniform_vector_p (const_tree vec
)
10391 if (vec
== NULL_TREE
)
10394 gcc_assert (VECTOR_TYPE_P (TREE_TYPE (vec
)));
10396 if (TREE_CODE (vec
) == VECTOR_CST
)
10398 first
= VECTOR_CST_ELT (vec
, 0);
10399 for (i
= 1; i
< VECTOR_CST_NELTS (vec
); ++i
)
10400 if (!operand_equal_p (first
, VECTOR_CST_ELT (vec
, i
), 0))
10406 else if (TREE_CODE (vec
) == CONSTRUCTOR
)
10408 first
= error_mark_node
;
10410 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (vec
), i
, t
)
10417 if (!operand_equal_p (first
, t
, 0))
10420 if (i
!= TYPE_VECTOR_SUBPARTS (TREE_TYPE (vec
)))
10429 /* Build an empty statement at location LOC. */
10432 build_empty_stmt (location_t loc
)
10434 tree t
= build1 (NOP_EXPR
, void_type_node
, size_zero_node
);
10435 SET_EXPR_LOCATION (t
, loc
);
10440 /* Build an OpenMP clause with code CODE. LOC is the location of the
10444 build_omp_clause (location_t loc
, enum omp_clause_code code
)
10449 length
= omp_clause_num_ops
[code
];
10450 size
= (sizeof (struct tree_omp_clause
) + (length
- 1) * sizeof (tree
));
10452 record_node_allocation_statistics (OMP_CLAUSE
, size
);
10454 t
= (tree
) ggc_internal_alloc (size
);
10455 memset (t
, 0, size
);
10456 TREE_SET_CODE (t
, OMP_CLAUSE
);
10457 OMP_CLAUSE_SET_CODE (t
, code
);
10458 OMP_CLAUSE_LOCATION (t
) = loc
;
10463 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
10464 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
10465 Except for the CODE and operand count field, other storage for the
10466 object is initialized to zeros. */
10469 build_vl_exp_stat (enum tree_code code
, int len MEM_STAT_DECL
)
10472 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_exp
);
10474 gcc_assert (TREE_CODE_CLASS (code
) == tcc_vl_exp
);
10475 gcc_assert (len
>= 1);
10477 record_node_allocation_statistics (code
, length
);
10479 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
10481 TREE_SET_CODE (t
, code
);
10483 /* Can't use TREE_OPERAND to store the length because if checking is
10484 enabled, it will try to check the length before we store it. :-P */
10485 t
->exp
.operands
[0] = build_int_cst (sizetype
, len
);
10490 /* Helper function for build_call_* functions; build a CALL_EXPR with
10491 indicated RETURN_TYPE, FN, and NARGS, but do not initialize any of
10492 the argument slots. */
10495 build_call_1 (tree return_type
, tree fn
, int nargs
)
10499 t
= build_vl_exp (CALL_EXPR
, nargs
+ 3);
10500 TREE_TYPE (t
) = return_type
;
10501 CALL_EXPR_FN (t
) = fn
;
10502 CALL_EXPR_STATIC_CHAIN (t
) = NULL
;
10507 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10508 FN and a null static chain slot. NARGS is the number of call arguments
10509 which are specified as "..." arguments. */
10512 build_call_nary (tree return_type
, tree fn
, int nargs
, ...)
10516 va_start (args
, nargs
);
10517 ret
= build_call_valist (return_type
, fn
, nargs
, args
);
10522 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10523 FN and a null static chain slot. NARGS is the number of call arguments
10524 which are specified as a va_list ARGS. */
10527 build_call_valist (tree return_type
, tree fn
, int nargs
, va_list args
)
10532 t
= build_call_1 (return_type
, fn
, nargs
);
10533 for (i
= 0; i
< nargs
; i
++)
10534 CALL_EXPR_ARG (t
, i
) = va_arg (args
, tree
);
10535 process_call_operands (t
);
10539 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10540 FN and a null static chain slot. NARGS is the number of call arguments
10541 which are specified as a tree array ARGS. */
10544 build_call_array_loc (location_t loc
, tree return_type
, tree fn
,
10545 int nargs
, const tree
*args
)
10550 t
= build_call_1 (return_type
, fn
, nargs
);
10551 for (i
= 0; i
< nargs
; i
++)
10552 CALL_EXPR_ARG (t
, i
) = args
[i
];
10553 process_call_operands (t
);
10554 SET_EXPR_LOCATION (t
, loc
);
10558 /* Like build_call_array, but takes a vec. */
10561 build_call_vec (tree return_type
, tree fn
, vec
<tree
, va_gc
> *args
)
10566 ret
= build_call_1 (return_type
, fn
, vec_safe_length (args
));
10567 FOR_EACH_VEC_SAFE_ELT (args
, ix
, t
)
10568 CALL_EXPR_ARG (ret
, ix
) = t
;
10569 process_call_operands (ret
);
10573 /* Conveniently construct a function call expression. FNDECL names the
10574 function to be called and N arguments are passed in the array
10578 build_call_expr_loc_array (location_t loc
, tree fndecl
, int n
, tree
*argarray
)
10580 tree fntype
= TREE_TYPE (fndecl
);
10581 tree fn
= build1 (ADDR_EXPR
, build_pointer_type (fntype
), fndecl
);
10583 return fold_builtin_call_array (loc
, TREE_TYPE (fntype
), fn
, n
, argarray
);
10586 /* Conveniently construct a function call expression. FNDECL names the
10587 function to be called and the arguments are passed in the vector
10591 build_call_expr_loc_vec (location_t loc
, tree fndecl
, vec
<tree
, va_gc
> *vec
)
10593 return build_call_expr_loc_array (loc
, fndecl
, vec_safe_length (vec
),
10594 vec_safe_address (vec
));
10598 /* Conveniently construct a function call expression. FNDECL names the
10599 function to be called, N is the number of arguments, and the "..."
10600 parameters are the argument expressions. */
10603 build_call_expr_loc (location_t loc
, tree fndecl
, int n
, ...)
10606 tree
*argarray
= XALLOCAVEC (tree
, n
);
10610 for (i
= 0; i
< n
; i
++)
10611 argarray
[i
] = va_arg (ap
, tree
);
10613 return build_call_expr_loc_array (loc
, fndecl
, n
, argarray
);
10616 /* Like build_call_expr_loc (UNKNOWN_LOCATION, ...). Duplicated because
10617 varargs macros aren't supported by all bootstrap compilers. */
10620 build_call_expr (tree fndecl
, int n
, ...)
10623 tree
*argarray
= XALLOCAVEC (tree
, n
);
10627 for (i
= 0; i
< n
; i
++)
10628 argarray
[i
] = va_arg (ap
, tree
);
10630 return build_call_expr_loc_array (UNKNOWN_LOCATION
, fndecl
, n
, argarray
);
10633 /* Build internal call expression. This is just like CALL_EXPR, except
10634 its CALL_EXPR_FN is NULL. It will get gimplified later into ordinary
10635 internal function. */
10638 build_call_expr_internal_loc (location_t loc
, enum internal_fn ifn
,
10639 tree type
, int n
, ...)
10644 tree fn
= build_call_1 (type
, NULL_TREE
, n
);
10646 for (i
= 0; i
< n
; i
++)
10647 CALL_EXPR_ARG (fn
, i
) = va_arg (ap
, tree
);
10649 SET_EXPR_LOCATION (fn
, loc
);
10650 CALL_EXPR_IFN (fn
) = ifn
;
10654 /* Create a new constant string literal and return a char* pointer to it.
10655 The STRING_CST value is the LEN characters at STR. */
10657 build_string_literal (int len
, const char *str
)
10659 tree t
, elem
, index
, type
;
10661 t
= build_string (len
, str
);
10662 elem
= build_type_variant (char_type_node
, 1, 0);
10663 index
= build_index_type (size_int (len
- 1));
10664 type
= build_array_type (elem
, index
);
10665 TREE_TYPE (t
) = type
;
10666 TREE_CONSTANT (t
) = 1;
10667 TREE_READONLY (t
) = 1;
10668 TREE_STATIC (t
) = 1;
10670 type
= build_pointer_type (elem
);
10671 t
= build1 (ADDR_EXPR
, type
,
10672 build4 (ARRAY_REF
, elem
,
10673 t
, integer_zero_node
, NULL_TREE
, NULL_TREE
));
10679 /* Return true if T (assumed to be a DECL) must be assigned a memory
10683 needs_to_live_in_memory (const_tree t
)
10685 return (TREE_ADDRESSABLE (t
)
10686 || is_global_var (t
)
10687 || (TREE_CODE (t
) == RESULT_DECL
10688 && !DECL_BY_REFERENCE (t
)
10689 && aggregate_value_p (t
, current_function_decl
)));
10692 /* Return value of a constant X and sign-extend it. */
10695 int_cst_value (const_tree x
)
10697 unsigned bits
= TYPE_PRECISION (TREE_TYPE (x
));
10698 unsigned HOST_WIDE_INT val
= TREE_INT_CST_LOW (x
);
10700 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
10701 gcc_assert (cst_and_fits_in_hwi (x
));
10703 if (bits
< HOST_BITS_PER_WIDE_INT
)
10705 bool negative
= ((val
>> (bits
- 1)) & 1) != 0;
10707 val
|= (~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1;
10709 val
&= ~((~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1);
10715 /* If TYPE is an integral or pointer type, return an integer type with
10716 the same precision which is unsigned iff UNSIGNEDP is true, or itself
10717 if TYPE is already an integer type of signedness UNSIGNEDP. */
10720 signed_or_unsigned_type_for (int unsignedp
, tree type
)
10722 if (TREE_CODE (type
) == INTEGER_TYPE
&& TYPE_UNSIGNED (type
) == unsignedp
)
10725 if (TREE_CODE (type
) == VECTOR_TYPE
)
10727 tree inner
= TREE_TYPE (type
);
10728 tree inner2
= signed_or_unsigned_type_for (unsignedp
, inner
);
10731 if (inner
== inner2
)
10733 return build_vector_type (inner2
, TYPE_VECTOR_SUBPARTS (type
));
10736 if (!INTEGRAL_TYPE_P (type
)
10737 && !POINTER_TYPE_P (type
)
10738 && TREE_CODE (type
) != OFFSET_TYPE
)
10741 return build_nonstandard_integer_type (TYPE_PRECISION (type
), unsignedp
);
10744 /* If TYPE is an integral or pointer type, return an integer type with
10745 the same precision which is unsigned, or itself if TYPE is already an
10746 unsigned integer type. */
10749 unsigned_type_for (tree type
)
10751 return signed_or_unsigned_type_for (1, type
);
10754 /* If TYPE is an integral or pointer type, return an integer type with
10755 the same precision which is signed, or itself if TYPE is already a
10756 signed integer type. */
10759 signed_type_for (tree type
)
10761 return signed_or_unsigned_type_for (0, type
);
10764 /* If TYPE is a vector type, return a signed integer vector type with the
10765 same width and number of subparts. Otherwise return boolean_type_node. */
10768 truth_type_for (tree type
)
10770 if (TREE_CODE (type
) == VECTOR_TYPE
)
10772 tree elem
= lang_hooks
.types
.type_for_size
10773 (GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (type
))), 0);
10774 return build_opaque_vector_type (elem
, TYPE_VECTOR_SUBPARTS (type
));
10777 return boolean_type_node
;
10780 /* Returns the largest value obtainable by casting something in INNER type to
10784 upper_bound_in_type (tree outer
, tree inner
)
10786 unsigned int det
= 0;
10787 unsigned oprec
= TYPE_PRECISION (outer
);
10788 unsigned iprec
= TYPE_PRECISION (inner
);
10791 /* Compute a unique number for every combination. */
10792 det
|= (oprec
> iprec
) ? 4 : 0;
10793 det
|= TYPE_UNSIGNED (outer
) ? 2 : 0;
10794 det
|= TYPE_UNSIGNED (inner
) ? 1 : 0;
10796 /* Determine the exponent to use. */
10801 /* oprec <= iprec, outer: signed, inner: don't care. */
10806 /* oprec <= iprec, outer: unsigned, inner: don't care. */
10810 /* oprec > iprec, outer: signed, inner: signed. */
10814 /* oprec > iprec, outer: signed, inner: unsigned. */
10818 /* oprec > iprec, outer: unsigned, inner: signed. */
10822 /* oprec > iprec, outer: unsigned, inner: unsigned. */
10826 gcc_unreachable ();
10829 return wide_int_to_tree (outer
,
10830 wi::mask (prec
, false, TYPE_PRECISION (outer
)));
10833 /* Returns the smallest value obtainable by casting something in INNER type to
10837 lower_bound_in_type (tree outer
, tree inner
)
10839 unsigned oprec
= TYPE_PRECISION (outer
);
10840 unsigned iprec
= TYPE_PRECISION (inner
);
10842 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
10844 if (TYPE_UNSIGNED (outer
)
10845 /* If we are widening something of an unsigned type, OUTER type
10846 contains all values of INNER type. In particular, both INNER
10847 and OUTER types have zero in common. */
10848 || (oprec
> iprec
&& TYPE_UNSIGNED (inner
)))
10849 return build_int_cst (outer
, 0);
10852 /* If we are widening a signed type to another signed type, we
10853 want to obtain -2^^(iprec-1). If we are keeping the
10854 precision or narrowing to a signed type, we want to obtain
10856 unsigned prec
= oprec
> iprec
? iprec
: oprec
;
10857 return wide_int_to_tree (outer
,
10858 wi::mask (prec
- 1, true,
10859 TYPE_PRECISION (outer
)));
10863 /* Return nonzero if two operands that are suitable for PHI nodes are
10864 necessarily equal. Specifically, both ARG0 and ARG1 must be either
10865 SSA_NAME or invariant. Note that this is strictly an optimization.
10866 That is, callers of this function can directly call operand_equal_p
10867 and get the same result, only slower. */
10870 operand_equal_for_phi_arg_p (const_tree arg0
, const_tree arg1
)
10874 if (TREE_CODE (arg0
) == SSA_NAME
|| TREE_CODE (arg1
) == SSA_NAME
)
10876 return operand_equal_p (arg0
, arg1
, 0);
10879 /* Returns number of zeros at the end of binary representation of X. */
10882 num_ending_zeros (const_tree x
)
10884 return build_int_cst (TREE_TYPE (x
), wi::ctz (x
));
10888 #define WALK_SUBTREE(NODE) \
10891 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
10897 /* This is a subroutine of walk_tree that walks field of TYPE that are to
10898 be walked whenever a type is seen in the tree. Rest of operands and return
10899 value are as for walk_tree. */
10902 walk_type_fields (tree type
, walk_tree_fn func
, void *data
,
10903 hash_set
<tree
> *pset
, walk_tree_lh lh
)
10905 tree result
= NULL_TREE
;
10907 switch (TREE_CODE (type
))
10910 case REFERENCE_TYPE
:
10912 /* We have to worry about mutually recursive pointers. These can't
10913 be written in C. They can in Ada. It's pathological, but
10914 there's an ACATS test (c38102a) that checks it. Deal with this
10915 by checking if we're pointing to another pointer, that one
10916 points to another pointer, that one does too, and we have no htab.
10917 If so, get a hash table. We check three levels deep to avoid
10918 the cost of the hash table if we don't need one. */
10919 if (POINTER_TYPE_P (TREE_TYPE (type
))
10920 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type
)))
10921 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type
))))
10924 result
= walk_tree_without_duplicates (&TREE_TYPE (type
),
10932 /* ... fall through ... */
10935 WALK_SUBTREE (TREE_TYPE (type
));
10939 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type
));
10941 /* Fall through. */
10943 case FUNCTION_TYPE
:
10944 WALK_SUBTREE (TREE_TYPE (type
));
10948 /* We never want to walk into default arguments. */
10949 for (arg
= TYPE_ARG_TYPES (type
); arg
; arg
= TREE_CHAIN (arg
))
10950 WALK_SUBTREE (TREE_VALUE (arg
));
10955 /* Don't follow this nodes's type if a pointer for fear that
10956 we'll have infinite recursion. If we have a PSET, then we
10959 || (!POINTER_TYPE_P (TREE_TYPE (type
))
10960 && TREE_CODE (TREE_TYPE (type
)) != OFFSET_TYPE
))
10961 WALK_SUBTREE (TREE_TYPE (type
));
10962 WALK_SUBTREE (TYPE_DOMAIN (type
));
10966 WALK_SUBTREE (TREE_TYPE (type
));
10967 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type
));
10977 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
10978 called with the DATA and the address of each sub-tree. If FUNC returns a
10979 non-NULL value, the traversal is stopped, and the value returned by FUNC
10980 is returned. If PSET is non-NULL it is used to record the nodes visited,
10981 and to avoid visiting a node more than once. */
10984 walk_tree_1 (tree
*tp
, walk_tree_fn func
, void *data
,
10985 hash_set
<tree
> *pset
, walk_tree_lh lh
)
10987 enum tree_code code
;
10991 #define WALK_SUBTREE_TAIL(NODE) \
10995 goto tail_recurse; \
11000 /* Skip empty subtrees. */
11004 /* Don't walk the same tree twice, if the user has requested
11005 that we avoid doing so. */
11006 if (pset
&& pset
->add (*tp
))
11009 /* Call the function. */
11011 result
= (*func
) (tp
, &walk_subtrees
, data
);
11013 /* If we found something, return it. */
11017 code
= TREE_CODE (*tp
);
11019 /* Even if we didn't, FUNC may have decided that there was nothing
11020 interesting below this point in the tree. */
11021 if (!walk_subtrees
)
11023 /* But we still need to check our siblings. */
11024 if (code
== TREE_LIST
)
11025 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
11026 else if (code
== OMP_CLAUSE
)
11027 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11034 result
= (*lh
) (tp
, &walk_subtrees
, func
, data
, pset
);
11035 if (result
|| !walk_subtrees
)
11042 case IDENTIFIER_NODE
:
11049 case PLACEHOLDER_EXPR
:
11053 /* None of these have subtrees other than those already walked
11058 WALK_SUBTREE (TREE_VALUE (*tp
));
11059 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
11064 int len
= TREE_VEC_LENGTH (*tp
);
11069 /* Walk all elements but the first. */
11071 WALK_SUBTREE (TREE_VEC_ELT (*tp
, len
));
11073 /* Now walk the first one as a tail call. */
11074 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp
, 0));
11078 WALK_SUBTREE (TREE_REALPART (*tp
));
11079 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp
));
11083 unsigned HOST_WIDE_INT idx
;
11084 constructor_elt
*ce
;
11086 for (idx
= 0; vec_safe_iterate (CONSTRUCTOR_ELTS (*tp
), idx
, &ce
);
11088 WALK_SUBTREE (ce
->value
);
11093 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, 0));
11098 for (decl
= BIND_EXPR_VARS (*tp
); decl
; decl
= DECL_CHAIN (decl
))
11100 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
11101 into declarations that are just mentioned, rather than
11102 declared; they don't really belong to this part of the tree.
11103 And, we can see cycles: the initializer for a declaration
11104 can refer to the declaration itself. */
11105 WALK_SUBTREE (DECL_INITIAL (decl
));
11106 WALK_SUBTREE (DECL_SIZE (decl
));
11107 WALK_SUBTREE (DECL_SIZE_UNIT (decl
));
11109 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp
));
11112 case STATEMENT_LIST
:
11114 tree_stmt_iterator i
;
11115 for (i
= tsi_start (*tp
); !tsi_end_p (i
); tsi_next (&i
))
11116 WALK_SUBTREE (*tsi_stmt_ptr (i
));
11121 switch (OMP_CLAUSE_CODE (*tp
))
11123 case OMP_CLAUSE_HOST
:
11124 case OMP_CLAUSE_OACC_DEVICE
:
11125 case OMP_CLAUSE_DEVICE_RESIDENT
:
11126 case OMP_CLAUSE_USE_DEVICE
:
11127 case OMP_CLAUSE_GANG
:
11128 case OMP_CLAUSE_ASYNC
:
11129 case OMP_CLAUSE_WAIT
:
11130 case OMP_CLAUSE_WORKER
:
11131 case OMP_CLAUSE_VECTOR
:
11132 case OMP_CLAUSE_NUM_GANGS
:
11133 case OMP_CLAUSE_NUM_WORKERS
:
11134 case OMP_CLAUSE_VECTOR_LENGTH
:
11135 case OMP_CLAUSE_PRIVATE
:
11136 case OMP_CLAUSE_SHARED
:
11137 case OMP_CLAUSE_FIRSTPRIVATE
:
11138 case OMP_CLAUSE_COPYIN
:
11139 case OMP_CLAUSE_COPYPRIVATE
:
11140 case OMP_CLAUSE_FINAL
:
11141 case OMP_CLAUSE_IF
:
11142 case OMP_CLAUSE_NUM_THREADS
:
11143 case OMP_CLAUSE_SCHEDULE
:
11144 case OMP_CLAUSE_UNIFORM
:
11145 case OMP_CLAUSE_DEPEND
:
11146 case OMP_CLAUSE_NUM_TEAMS
:
11147 case OMP_CLAUSE_THREAD_LIMIT
:
11148 case OMP_CLAUSE_DEVICE
:
11149 case OMP_CLAUSE_DIST_SCHEDULE
:
11150 case OMP_CLAUSE_SAFELEN
:
11151 case OMP_CLAUSE_SIMDLEN
:
11152 case OMP_CLAUSE__LOOPTEMP_
:
11153 case OMP_CLAUSE__SIMDUID_
:
11154 case OMP_CLAUSE__CILK_FOR_COUNT_
:
11155 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 0));
11158 case OMP_CLAUSE_INDEPENDENT
:
11159 case OMP_CLAUSE_NOWAIT
:
11160 case OMP_CLAUSE_ORDERED
:
11161 case OMP_CLAUSE_DEFAULT
:
11162 case OMP_CLAUSE_UNTIED
:
11163 case OMP_CLAUSE_MERGEABLE
:
11164 case OMP_CLAUSE_PROC_BIND
:
11165 case OMP_CLAUSE_INBRANCH
:
11166 case OMP_CLAUSE_NOTINBRANCH
:
11167 case OMP_CLAUSE_FOR
:
11168 case OMP_CLAUSE_PARALLEL
:
11169 case OMP_CLAUSE_SECTIONS
:
11170 case OMP_CLAUSE_TASKGROUP
:
11171 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11173 case OMP_CLAUSE_LASTPRIVATE
:
11174 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
11175 WALK_SUBTREE (OMP_CLAUSE_LASTPRIVATE_STMT (*tp
));
11176 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11178 case OMP_CLAUSE_COLLAPSE
:
11181 for (i
= 0; i
< 3; i
++)
11182 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
11183 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11186 case OMP_CLAUSE_LINEAR
:
11187 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
11188 WALK_SUBTREE (OMP_CLAUSE_LINEAR_STEP (*tp
));
11189 WALK_SUBTREE (OMP_CLAUSE_LINEAR_STMT (*tp
));
11190 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11192 case OMP_CLAUSE_ALIGNED
:
11193 case OMP_CLAUSE_FROM
:
11194 case OMP_CLAUSE_TO
:
11195 case OMP_CLAUSE_MAP
:
11196 case OMP_CLAUSE__CACHE_
:
11197 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
11198 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 1));
11199 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11201 case OMP_CLAUSE_REDUCTION
:
11204 for (i
= 0; i
< 4; i
++)
11205 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
11206 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11210 gcc_unreachable ();
11218 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
11219 But, we only want to walk once. */
11220 len
= (TREE_OPERAND (*tp
, 3) == TREE_OPERAND (*tp
, 1)) ? 2 : 3;
11221 for (i
= 0; i
< len
; ++i
)
11222 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
11223 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
));
11227 /* If this is a TYPE_DECL, walk into the fields of the type that it's
11228 defining. We only want to walk into these fields of a type in this
11229 case and not in the general case of a mere reference to the type.
11231 The criterion is as follows: if the field can be an expression, it
11232 must be walked only here. This should be in keeping with the fields
11233 that are directly gimplified in gimplify_type_sizes in order for the
11234 mark/copy-if-shared/unmark machinery of the gimplifier to work with
11235 variable-sized types.
11237 Note that DECLs get walked as part of processing the BIND_EXPR. */
11238 if (TREE_CODE (DECL_EXPR_DECL (*tp
)) == TYPE_DECL
)
11240 tree
*type_p
= &TREE_TYPE (DECL_EXPR_DECL (*tp
));
11241 if (TREE_CODE (*type_p
) == ERROR_MARK
)
11244 /* Call the function for the type. See if it returns anything or
11245 doesn't want us to continue. If we are to continue, walk both
11246 the normal fields and those for the declaration case. */
11247 result
= (*func
) (type_p
, &walk_subtrees
, data
);
11248 if (result
|| !walk_subtrees
)
11251 /* But do not walk a pointed-to type since it may itself need to
11252 be walked in the declaration case if it isn't anonymous. */
11253 if (!POINTER_TYPE_P (*type_p
))
11255 result
= walk_type_fields (*type_p
, func
, data
, pset
, lh
);
11260 /* If this is a record type, also walk the fields. */
11261 if (RECORD_OR_UNION_TYPE_P (*type_p
))
11265 for (field
= TYPE_FIELDS (*type_p
); field
;
11266 field
= DECL_CHAIN (field
))
11268 /* We'd like to look at the type of the field, but we can
11269 easily get infinite recursion. So assume it's pointed
11270 to elsewhere in the tree. Also, ignore things that
11272 if (TREE_CODE (field
) != FIELD_DECL
)
11275 WALK_SUBTREE (DECL_FIELD_OFFSET (field
));
11276 WALK_SUBTREE (DECL_SIZE (field
));
11277 WALK_SUBTREE (DECL_SIZE_UNIT (field
));
11278 if (TREE_CODE (*type_p
) == QUAL_UNION_TYPE
)
11279 WALK_SUBTREE (DECL_QUALIFIER (field
));
11283 /* Same for scalar types. */
11284 else if (TREE_CODE (*type_p
) == BOOLEAN_TYPE
11285 || TREE_CODE (*type_p
) == ENUMERAL_TYPE
11286 || TREE_CODE (*type_p
) == INTEGER_TYPE
11287 || TREE_CODE (*type_p
) == FIXED_POINT_TYPE
11288 || TREE_CODE (*type_p
) == REAL_TYPE
)
11290 WALK_SUBTREE (TYPE_MIN_VALUE (*type_p
));
11291 WALK_SUBTREE (TYPE_MAX_VALUE (*type_p
));
11294 WALK_SUBTREE (TYPE_SIZE (*type_p
));
11295 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p
));
11300 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code
)))
11304 /* Walk over all the sub-trees of this operand. */
11305 len
= TREE_OPERAND_LENGTH (*tp
);
11307 /* Go through the subtrees. We need to do this in forward order so
11308 that the scope of a FOR_EXPR is handled properly. */
11311 for (i
= 0; i
< len
- 1; ++i
)
11312 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
11313 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
- 1));
11316 /* If this is a type, walk the needed fields in the type. */
11317 else if (TYPE_P (*tp
))
11318 return walk_type_fields (*tp
, func
, data
, pset
, lh
);
11322 /* We didn't find what we were looking for. */
11325 #undef WALK_SUBTREE_TAIL
11327 #undef WALK_SUBTREE
11329 /* Like walk_tree, but does not walk duplicate nodes more than once. */
11332 walk_tree_without_duplicates_1 (tree
*tp
, walk_tree_fn func
, void *data
,
11337 hash_set
<tree
> pset
;
11338 result
= walk_tree_1 (tp
, func
, data
, &pset
, lh
);
11344 tree_block (tree t
)
11346 const enum tree_code_class c
= TREE_CODE_CLASS (TREE_CODE (t
));
11348 if (IS_EXPR_CODE_CLASS (c
))
11349 return LOCATION_BLOCK (t
->exp
.locus
);
11350 gcc_unreachable ();
11355 tree_set_block (tree t
, tree b
)
11357 const enum tree_code_class c
= TREE_CODE_CLASS (TREE_CODE (t
));
11359 if (IS_EXPR_CODE_CLASS (c
))
11362 t
->exp
.locus
= COMBINE_LOCATION_DATA (line_table
, t
->exp
.locus
, b
);
11364 t
->exp
.locus
= LOCATION_LOCUS (t
->exp
.locus
);
11367 gcc_unreachable ();
11370 /* Create a nameless artificial label and put it in the current
11371 function context. The label has a location of LOC. Returns the
11372 newly created label. */
11375 create_artificial_label (location_t loc
)
11377 tree lab
= build_decl (loc
,
11378 LABEL_DECL
, NULL_TREE
, void_type_node
);
11380 DECL_ARTIFICIAL (lab
) = 1;
11381 DECL_IGNORED_P (lab
) = 1;
11382 DECL_CONTEXT (lab
) = current_function_decl
;
11386 /* Given a tree, try to return a useful variable name that we can use
11387 to prefix a temporary that is being assigned the value of the tree.
11388 I.E. given <temp> = &A, return A. */
11393 tree stripped_decl
;
11396 STRIP_NOPS (stripped_decl
);
11397 if (DECL_P (stripped_decl
) && DECL_NAME (stripped_decl
))
11398 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl
));
11399 else if (TREE_CODE (stripped_decl
) == SSA_NAME
)
11401 tree name
= SSA_NAME_IDENTIFIER (stripped_decl
);
11404 return IDENTIFIER_POINTER (name
);
11408 switch (TREE_CODE (stripped_decl
))
11411 return get_name (TREE_OPERAND (stripped_decl
, 0));
11418 /* Return true if TYPE has a variable argument list. */
11421 stdarg_p (const_tree fntype
)
11423 function_args_iterator args_iter
;
11424 tree n
= NULL_TREE
, t
;
11429 FOREACH_FUNCTION_ARGS (fntype
, t
, args_iter
)
11434 return n
!= NULL_TREE
&& n
!= void_type_node
;
11437 /* Return true if TYPE has a prototype. */
11440 prototype_p (tree fntype
)
11444 gcc_assert (fntype
!= NULL_TREE
);
11446 t
= TYPE_ARG_TYPES (fntype
);
11447 return (t
!= NULL_TREE
);
11450 /* If BLOCK is inlined from an __attribute__((__artificial__))
11451 routine, return pointer to location from where it has been
11454 block_nonartificial_location (tree block
)
11456 location_t
*ret
= NULL
;
11458 while (block
&& TREE_CODE (block
) == BLOCK
11459 && BLOCK_ABSTRACT_ORIGIN (block
))
11461 tree ao
= BLOCK_ABSTRACT_ORIGIN (block
);
11463 while (TREE_CODE (ao
) == BLOCK
11464 && BLOCK_ABSTRACT_ORIGIN (ao
)
11465 && BLOCK_ABSTRACT_ORIGIN (ao
) != ao
)
11466 ao
= BLOCK_ABSTRACT_ORIGIN (ao
);
11468 if (TREE_CODE (ao
) == FUNCTION_DECL
)
11470 /* If AO is an artificial inline, point RET to the
11471 call site locus at which it has been inlined and continue
11472 the loop, in case AO's caller is also an artificial
11474 if (DECL_DECLARED_INLINE_P (ao
)
11475 && lookup_attribute ("artificial", DECL_ATTRIBUTES (ao
)))
11476 ret
= &BLOCK_SOURCE_LOCATION (block
);
11480 else if (TREE_CODE (ao
) != BLOCK
)
11483 block
= BLOCK_SUPERCONTEXT (block
);
11489 /* If EXP is inlined from an __attribute__((__artificial__))
11490 function, return the location of the original call expression. */
11493 tree_nonartificial_location (tree exp
)
11495 location_t
*loc
= block_nonartificial_location (TREE_BLOCK (exp
));
11500 return EXPR_LOCATION (exp
);
11504 /* These are the hash table functions for the hash table of OPTIMIZATION_NODEq
11507 /* Return the hash code code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
11510 cl_option_hash_hash (const void *x
)
11512 const_tree
const t
= (const_tree
) x
;
11516 hashval_t hash
= 0;
11518 if (TREE_CODE (t
) == OPTIMIZATION_NODE
)
11520 p
= (const char *)TREE_OPTIMIZATION (t
);
11521 len
= sizeof (struct cl_optimization
);
11524 else if (TREE_CODE (t
) == TARGET_OPTION_NODE
)
11526 p
= (const char *)TREE_TARGET_OPTION (t
);
11527 len
= sizeof (struct cl_target_option
);
11531 gcc_unreachable ();
11533 /* assume most opt flags are just 0/1, some are 2-3, and a few might be
11535 for (i
= 0; i
< len
; i
++)
11537 hash
= (hash
<< 4) ^ ((i
<< 2) | p
[i
]);
11542 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
11543 TARGET_OPTION tree node) is the same as that given by *Y, which is the
11547 cl_option_hash_eq (const void *x
, const void *y
)
11549 const_tree
const xt
= (const_tree
) x
;
11550 const_tree
const yt
= (const_tree
) y
;
11555 if (TREE_CODE (xt
) != TREE_CODE (yt
))
11558 if (TREE_CODE (xt
) == OPTIMIZATION_NODE
)
11560 xp
= (const char *)TREE_OPTIMIZATION (xt
);
11561 yp
= (const char *)TREE_OPTIMIZATION (yt
);
11562 len
= sizeof (struct cl_optimization
);
11565 else if (TREE_CODE (xt
) == TARGET_OPTION_NODE
)
11567 xp
= (const char *)TREE_TARGET_OPTION (xt
);
11568 yp
= (const char *)TREE_TARGET_OPTION (yt
);
11569 len
= sizeof (struct cl_target_option
);
11573 gcc_unreachable ();
11575 return (memcmp (xp
, yp
, len
) == 0);
11578 /* Build an OPTIMIZATION_NODE based on the options in OPTS. */
11581 build_optimization_node (struct gcc_options
*opts
)
11586 /* Use the cache of optimization nodes. */
11588 cl_optimization_save (TREE_OPTIMIZATION (cl_optimization_node
),
11591 slot
= htab_find_slot (cl_option_hash_table
, cl_optimization_node
, INSERT
);
11595 /* Insert this one into the hash table. */
11596 t
= cl_optimization_node
;
11599 /* Make a new node for next time round. */
11600 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
11606 /* Build a TARGET_OPTION_NODE based on the options in OPTS. */
11609 build_target_option_node (struct gcc_options
*opts
)
11614 /* Use the cache of optimization nodes. */
11616 cl_target_option_save (TREE_TARGET_OPTION (cl_target_option_node
),
11619 slot
= htab_find_slot (cl_option_hash_table
, cl_target_option_node
, INSERT
);
11623 /* Insert this one into the hash table. */
11624 t
= cl_target_option_node
;
11627 /* Make a new node for next time round. */
11628 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
11634 /* Reset TREE_TARGET_GLOBALS cache for TARGET_OPTION_NODE.
11635 Called through htab_traverse. */
11638 prepare_target_option_node_for_pch (void **slot
, void *)
11640 tree node
= (tree
) *slot
;
11641 if (TREE_CODE (node
) == TARGET_OPTION_NODE
)
11642 TREE_TARGET_GLOBALS (node
) = NULL
;
11646 /* Clear TREE_TARGET_GLOBALS of all TARGET_OPTION_NODE trees,
11647 so that they aren't saved during PCH writing. */
11650 prepare_target_option_nodes_for_pch (void)
11652 htab_traverse (cl_option_hash_table
, prepare_target_option_node_for_pch
,
11656 /* Determine the "ultimate origin" of a block. The block may be an inlined
11657 instance of an inlined instance of a block which is local to an inline
11658 function, so we have to trace all of the way back through the origin chain
11659 to find out what sort of node actually served as the original seed for the
11663 block_ultimate_origin (const_tree block
)
11665 tree immediate_origin
= BLOCK_ABSTRACT_ORIGIN (block
);
11667 /* BLOCK_ABSTRACT_ORIGIN can point to itself; ignore that if
11668 we're trying to output the abstract instance of this function. */
11669 if (BLOCK_ABSTRACT (block
) && immediate_origin
== block
)
11672 if (immediate_origin
== NULL_TREE
)
11677 tree lookahead
= immediate_origin
;
11681 ret_val
= lookahead
;
11682 lookahead
= (TREE_CODE (ret_val
) == BLOCK
11683 ? BLOCK_ABSTRACT_ORIGIN (ret_val
) : NULL
);
11685 while (lookahead
!= NULL
&& lookahead
!= ret_val
);
11687 /* The block's abstract origin chain may not be the *ultimate* origin of
11688 the block. It could lead to a DECL that has an abstract origin set.
11689 If so, we want that DECL's abstract origin (which is what DECL_ORIGIN
11690 will give us if it has one). Note that DECL's abstract origins are
11691 supposed to be the most distant ancestor (or so decl_ultimate_origin
11692 claims), so we don't need to loop following the DECL origins. */
11693 if (DECL_P (ret_val
))
11694 return DECL_ORIGIN (ret_val
);
11700 /* Return true iff conversion in EXP generates no instruction. Mark
11701 it inline so that we fully inline into the stripping functions even
11702 though we have two uses of this function. */
11705 tree_nop_conversion (const_tree exp
)
11707 tree outer_type
, inner_type
;
11709 if (!CONVERT_EXPR_P (exp
)
11710 && TREE_CODE (exp
) != NON_LVALUE_EXPR
)
11712 if (TREE_OPERAND (exp
, 0) == error_mark_node
)
11715 outer_type
= TREE_TYPE (exp
);
11716 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
11721 /* Use precision rather then machine mode when we can, which gives
11722 the correct answer even for submode (bit-field) types. */
11723 if ((INTEGRAL_TYPE_P (outer_type
)
11724 || POINTER_TYPE_P (outer_type
)
11725 || TREE_CODE (outer_type
) == OFFSET_TYPE
)
11726 && (INTEGRAL_TYPE_P (inner_type
)
11727 || POINTER_TYPE_P (inner_type
)
11728 || TREE_CODE (inner_type
) == OFFSET_TYPE
))
11729 return TYPE_PRECISION (outer_type
) == TYPE_PRECISION (inner_type
);
11731 /* Otherwise fall back on comparing machine modes (e.g. for
11732 aggregate types, floats). */
11733 return TYPE_MODE (outer_type
) == TYPE_MODE (inner_type
);
11736 /* Return true iff conversion in EXP generates no instruction. Don't
11737 consider conversions changing the signedness. */
11740 tree_sign_nop_conversion (const_tree exp
)
11742 tree outer_type
, inner_type
;
11744 if (!tree_nop_conversion (exp
))
11747 outer_type
= TREE_TYPE (exp
);
11748 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
11750 return (TYPE_UNSIGNED (outer_type
) == TYPE_UNSIGNED (inner_type
)
11751 && POINTER_TYPE_P (outer_type
) == POINTER_TYPE_P (inner_type
));
11754 /* Strip conversions from EXP according to tree_nop_conversion and
11755 return the resulting expression. */
11758 tree_strip_nop_conversions (tree exp
)
11760 while (tree_nop_conversion (exp
))
11761 exp
= TREE_OPERAND (exp
, 0);
11765 /* Strip conversions from EXP according to tree_sign_nop_conversion
11766 and return the resulting expression. */
11769 tree_strip_sign_nop_conversions (tree exp
)
11771 while (tree_sign_nop_conversion (exp
))
11772 exp
= TREE_OPERAND (exp
, 0);
11776 /* Avoid any floating point extensions from EXP. */
11778 strip_float_extensions (tree exp
)
11780 tree sub
, expt
, subt
;
11782 /* For floating point constant look up the narrowest type that can hold
11783 it properly and handle it like (type)(narrowest_type)constant.
11784 This way we can optimize for instance a=a*2.0 where "a" is float
11785 but 2.0 is double constant. */
11786 if (TREE_CODE (exp
) == REAL_CST
&& !DECIMAL_FLOAT_TYPE_P (TREE_TYPE (exp
)))
11788 REAL_VALUE_TYPE orig
;
11791 orig
= TREE_REAL_CST (exp
);
11792 if (TYPE_PRECISION (TREE_TYPE (exp
)) > TYPE_PRECISION (float_type_node
)
11793 && exact_real_truncate (TYPE_MODE (float_type_node
), &orig
))
11794 type
= float_type_node
;
11795 else if (TYPE_PRECISION (TREE_TYPE (exp
))
11796 > TYPE_PRECISION (double_type_node
)
11797 && exact_real_truncate (TYPE_MODE (double_type_node
), &orig
))
11798 type
= double_type_node
;
11800 return build_real (type
, real_value_truncate (TYPE_MODE (type
), orig
));
11803 if (!CONVERT_EXPR_P (exp
))
11806 sub
= TREE_OPERAND (exp
, 0);
11807 subt
= TREE_TYPE (sub
);
11808 expt
= TREE_TYPE (exp
);
11810 if (!FLOAT_TYPE_P (subt
))
11813 if (DECIMAL_FLOAT_TYPE_P (expt
) != DECIMAL_FLOAT_TYPE_P (subt
))
11816 if (TYPE_PRECISION (subt
) > TYPE_PRECISION (expt
))
11819 return strip_float_extensions (sub
);
11822 /* Strip out all handled components that produce invariant
11826 strip_invariant_refs (const_tree op
)
11828 while (handled_component_p (op
))
11830 switch (TREE_CODE (op
))
11833 case ARRAY_RANGE_REF
:
11834 if (!is_gimple_constant (TREE_OPERAND (op
, 1))
11835 || TREE_OPERAND (op
, 2) != NULL_TREE
11836 || TREE_OPERAND (op
, 3) != NULL_TREE
)
11840 case COMPONENT_REF
:
11841 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
11847 op
= TREE_OPERAND (op
, 0);
11853 static GTY(()) tree gcc_eh_personality_decl
;
11855 /* Return the GCC personality function decl. */
11858 lhd_gcc_personality (void)
11860 if (!gcc_eh_personality_decl
)
11861 gcc_eh_personality_decl
= build_personality_function ("gcc");
11862 return gcc_eh_personality_decl
;
11865 /* TARGET is a call target of GIMPLE call statement
11866 (obtained by gimple_call_fn). Return true if it is
11867 OBJ_TYPE_REF representing an virtual call of C++ method.
11868 (As opposed to OBJ_TYPE_REF representing objc calls
11869 through a cast where middle-end devirtualization machinery
11873 virtual_method_call_p (tree target
)
11875 if (TREE_CODE (target
) != OBJ_TYPE_REF
)
11877 target
= TREE_TYPE (target
);
11878 gcc_checking_assert (TREE_CODE (target
) == POINTER_TYPE
);
11879 target
= TREE_TYPE (target
);
11880 if (TREE_CODE (target
) == FUNCTION_TYPE
)
11882 gcc_checking_assert (TREE_CODE (target
) == METHOD_TYPE
);
11886 /* REF is OBJ_TYPE_REF, return the class the ref corresponds to. */
11889 obj_type_ref_class (tree ref
)
11891 gcc_checking_assert (TREE_CODE (ref
) == OBJ_TYPE_REF
);
11892 ref
= TREE_TYPE (ref
);
11893 gcc_checking_assert (TREE_CODE (ref
) == POINTER_TYPE
);
11894 ref
= TREE_TYPE (ref
);
11895 /* We look for type THIS points to. ObjC also builds
11896 OBJ_TYPE_REF with non-method calls, Their first parameter
11897 ID however also corresponds to class type. */
11898 gcc_checking_assert (TREE_CODE (ref
) == METHOD_TYPE
11899 || TREE_CODE (ref
) == FUNCTION_TYPE
);
11900 ref
= TREE_VALUE (TYPE_ARG_TYPES (ref
));
11901 gcc_checking_assert (TREE_CODE (ref
) == POINTER_TYPE
);
11902 return TREE_TYPE (ref
);
11905 /* Return true if T is in anonymous namespace. */
11908 type_in_anonymous_namespace_p (const_tree t
)
11910 /* TREE_PUBLIC of TYPE_STUB_DECL may not be properly set for
11911 bulitin types; those have CONTEXT NULL. */
11912 if (!TYPE_CONTEXT (t
))
11914 return (TYPE_STUB_DECL (t
) && !TREE_PUBLIC (TYPE_STUB_DECL (t
)));
11917 /* Try to find a base info of BINFO that would have its field decl at offset
11918 OFFSET within the BINFO type and which is of EXPECTED_TYPE. If it can be
11919 found, return, otherwise return NULL_TREE. */
11922 get_binfo_at_offset (tree binfo
, HOST_WIDE_INT offset
, tree expected_type
)
11924 tree type
= BINFO_TYPE (binfo
);
11928 HOST_WIDE_INT pos
, size
;
11932 if (types_same_for_odr (type
, expected_type
))
11937 for (fld
= TYPE_FIELDS (type
); fld
; fld
= DECL_CHAIN (fld
))
11939 if (TREE_CODE (fld
) != FIELD_DECL
)
11942 pos
= int_bit_position (fld
);
11943 size
= tree_to_uhwi (DECL_SIZE (fld
));
11944 if (pos
<= offset
&& (pos
+ size
) > offset
)
11947 if (!fld
|| TREE_CODE (TREE_TYPE (fld
)) != RECORD_TYPE
)
11950 if (!DECL_ARTIFICIAL (fld
))
11952 binfo
= TYPE_BINFO (TREE_TYPE (fld
));
11956 /* Offset 0 indicates the primary base, whose vtable contents are
11957 represented in the binfo for the derived class. */
11958 else if (offset
!= 0)
11960 tree base_binfo
, binfo2
= binfo
;
11962 /* Find BINFO corresponding to FLD. This is bit harder
11963 by a fact that in virtual inheritance we may need to walk down
11964 the non-virtual inheritance chain. */
11967 tree containing_binfo
= NULL
, found_binfo
= NULL
;
11968 for (i
= 0; BINFO_BASE_ITERATE (binfo2
, i
, base_binfo
); i
++)
11969 if (types_same_for_odr (TREE_TYPE (base_binfo
), TREE_TYPE (fld
)))
11971 found_binfo
= base_binfo
;
11975 if ((tree_to_shwi (BINFO_OFFSET (base_binfo
))
11976 - tree_to_shwi (BINFO_OFFSET (binfo
)))
11977 * BITS_PER_UNIT
< pos
11978 /* Rule out types with no virtual methods or we can get confused
11979 here by zero sized bases. */
11980 && BINFO_VTABLE (TYPE_BINFO (BINFO_TYPE (base_binfo
)))
11981 && (!containing_binfo
11982 || (tree_to_shwi (BINFO_OFFSET (containing_binfo
))
11983 < tree_to_shwi (BINFO_OFFSET (base_binfo
)))))
11984 containing_binfo
= base_binfo
;
11987 binfo
= found_binfo
;
11990 if (!containing_binfo
)
11992 binfo2
= containing_binfo
;
11996 type
= TREE_TYPE (fld
);
12001 /* Returns true if X is a typedef decl. */
12004 is_typedef_decl (tree x
)
12006 return (x
&& TREE_CODE (x
) == TYPE_DECL
12007 && DECL_ORIGINAL_TYPE (x
) != NULL_TREE
);
12010 /* Returns true iff TYPE is a type variant created for a typedef. */
12013 typedef_variant_p (tree type
)
12015 return is_typedef_decl (TYPE_NAME (type
));
12018 /* Warn about a use of an identifier which was marked deprecated. */
12020 warn_deprecated_use (tree node
, tree attr
)
12024 if (node
== 0 || !warn_deprecated_decl
)
12030 attr
= DECL_ATTRIBUTES (node
);
12031 else if (TYPE_P (node
))
12033 tree decl
= TYPE_STUB_DECL (node
);
12035 attr
= lookup_attribute ("deprecated",
12036 TYPE_ATTRIBUTES (TREE_TYPE (decl
)));
12041 attr
= lookup_attribute ("deprecated", attr
);
12044 msg
= TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr
)));
12050 expanded_location xloc
= expand_location (DECL_SOURCE_LOCATION (node
));
12052 warning (OPT_Wdeprecated_declarations
,
12053 "%qD is deprecated (declared at %r%s:%d%R): %s",
12054 node
, "locus", xloc
.file
, xloc
.line
, msg
);
12056 warning (OPT_Wdeprecated_declarations
,
12057 "%qD is deprecated (declared at %r%s:%d%R)",
12058 node
, "locus", xloc
.file
, xloc
.line
);
12060 else if (TYPE_P (node
))
12062 tree what
= NULL_TREE
;
12063 tree decl
= TYPE_STUB_DECL (node
);
12065 if (TYPE_NAME (node
))
12067 if (TREE_CODE (TYPE_NAME (node
)) == IDENTIFIER_NODE
)
12068 what
= TYPE_NAME (node
);
12069 else if (TREE_CODE (TYPE_NAME (node
)) == TYPE_DECL
12070 && DECL_NAME (TYPE_NAME (node
)))
12071 what
= DECL_NAME (TYPE_NAME (node
));
12076 expanded_location xloc
12077 = expand_location (DECL_SOURCE_LOCATION (decl
));
12081 warning (OPT_Wdeprecated_declarations
,
12082 "%qE is deprecated (declared at %r%s:%d%R): %s",
12083 what
, "locus", xloc
.file
, xloc
.line
, msg
);
12085 warning (OPT_Wdeprecated_declarations
,
12086 "%qE is deprecated (declared at %r%s:%d%R)",
12087 what
, "locus", xloc
.file
, xloc
.line
);
12092 warning (OPT_Wdeprecated_declarations
,
12093 "type is deprecated (declared at %r%s:%d%R): %s",
12094 "locus", xloc
.file
, xloc
.line
, msg
);
12096 warning (OPT_Wdeprecated_declarations
,
12097 "type is deprecated (declared at %r%s:%d%R)",
12098 "locus", xloc
.file
, xloc
.line
);
12106 warning (OPT_Wdeprecated_declarations
, "%qE is deprecated: %s",
12109 warning (OPT_Wdeprecated_declarations
, "%qE is deprecated", what
);
12114 warning (OPT_Wdeprecated_declarations
, "type is deprecated: %s",
12117 warning (OPT_Wdeprecated_declarations
, "type is deprecated");
12123 /* Return true if REF has a COMPONENT_REF with a bit-field field declaration
12124 somewhere in it. */
12127 contains_bitfld_component_ref_p (const_tree ref
)
12129 while (handled_component_p (ref
))
12131 if (TREE_CODE (ref
) == COMPONENT_REF
12132 && DECL_BIT_FIELD (TREE_OPERAND (ref
, 1)))
12134 ref
= TREE_OPERAND (ref
, 0);
12140 /* Try to determine whether a TRY_CATCH expression can fall through.
12141 This is a subroutine of block_may_fallthru. */
12144 try_catch_may_fallthru (const_tree stmt
)
12146 tree_stmt_iterator i
;
12148 /* If the TRY block can fall through, the whole TRY_CATCH can
12150 if (block_may_fallthru (TREE_OPERAND (stmt
, 0)))
12153 i
= tsi_start (TREE_OPERAND (stmt
, 1));
12154 switch (TREE_CODE (tsi_stmt (i
)))
12157 /* We expect to see a sequence of CATCH_EXPR trees, each with a
12158 catch expression and a body. The whole TRY_CATCH may fall
12159 through iff any of the catch bodies falls through. */
12160 for (; !tsi_end_p (i
); tsi_next (&i
))
12162 if (block_may_fallthru (CATCH_BODY (tsi_stmt (i
))))
12167 case EH_FILTER_EXPR
:
12168 /* The exception filter expression only matters if there is an
12169 exception. If the exception does not match EH_FILTER_TYPES,
12170 we will execute EH_FILTER_FAILURE, and we will fall through
12171 if that falls through. If the exception does match
12172 EH_FILTER_TYPES, the stack unwinder will continue up the
12173 stack, so we will not fall through. We don't know whether we
12174 will throw an exception which matches EH_FILTER_TYPES or not,
12175 so we just ignore EH_FILTER_TYPES and assume that we might
12176 throw an exception which doesn't match. */
12177 return block_may_fallthru (EH_FILTER_FAILURE (tsi_stmt (i
)));
12180 /* This case represents statements to be executed when an
12181 exception occurs. Those statements are implicitly followed
12182 by a RESX statement to resume execution after the exception.
12183 So in this case the TRY_CATCH never falls through. */
12188 /* Try to determine if we can fall out of the bottom of BLOCK. This guess
12189 need not be 100% accurate; simply be conservative and return true if we
12190 don't know. This is used only to avoid stupidly generating extra code.
12191 If we're wrong, we'll just delete the extra code later. */
12194 block_may_fallthru (const_tree block
)
12196 /* This CONST_CAST is okay because expr_last returns its argument
12197 unmodified and we assign it to a const_tree. */
12198 const_tree stmt
= expr_last (CONST_CAST_TREE (block
));
12200 switch (stmt
? TREE_CODE (stmt
) : ERROR_MARK
)
12204 /* Easy cases. If the last statement of the block implies
12205 control transfer, then we can't fall through. */
12209 /* If SWITCH_LABELS is set, this is lowered, and represents a
12210 branch to a selected label and hence can not fall through.
12211 Otherwise SWITCH_BODY is set, and the switch can fall
12213 return SWITCH_LABELS (stmt
) == NULL_TREE
;
12216 if (block_may_fallthru (COND_EXPR_THEN (stmt
)))
12218 return block_may_fallthru (COND_EXPR_ELSE (stmt
));
12221 return block_may_fallthru (BIND_EXPR_BODY (stmt
));
12223 case TRY_CATCH_EXPR
:
12224 return try_catch_may_fallthru (stmt
);
12226 case TRY_FINALLY_EXPR
:
12227 /* The finally clause is always executed after the try clause,
12228 so if it does not fall through, then the try-finally will not
12229 fall through. Otherwise, if the try clause does not fall
12230 through, then when the finally clause falls through it will
12231 resume execution wherever the try clause was going. So the
12232 whole try-finally will only fall through if both the try
12233 clause and the finally clause fall through. */
12234 return (block_may_fallthru (TREE_OPERAND (stmt
, 0))
12235 && block_may_fallthru (TREE_OPERAND (stmt
, 1)));
12238 if (TREE_CODE (TREE_OPERAND (stmt
, 1)) == CALL_EXPR
)
12239 stmt
= TREE_OPERAND (stmt
, 1);
12245 /* Functions that do not return do not fall through. */
12246 return (call_expr_flags (stmt
) & ECF_NORETURN
) == 0;
12248 case CLEANUP_POINT_EXPR
:
12249 return block_may_fallthru (TREE_OPERAND (stmt
, 0));
12252 return block_may_fallthru (TREE_OPERAND (stmt
, 1));
12258 return lang_hooks
.block_may_fallthru (stmt
);
12262 /* True if we are using EH to handle cleanups. */
12263 static bool using_eh_for_cleanups_flag
= false;
12265 /* This routine is called from front ends to indicate eh should be used for
12268 using_eh_for_cleanups (void)
12270 using_eh_for_cleanups_flag
= true;
12273 /* Query whether EH is used for cleanups. */
12275 using_eh_for_cleanups_p (void)
12277 return using_eh_for_cleanups_flag
;
12280 /* Wrapper for tree_code_name to ensure that tree code is valid */
12282 get_tree_code_name (enum tree_code code
)
12284 const char *invalid
= "<invalid tree code>";
12286 if (code
>= MAX_TREE_CODES
)
12289 return tree_code_name
[code
];
12292 /* Drops the TREE_OVERFLOW flag from T. */
12295 drop_tree_overflow (tree t
)
12297 gcc_checking_assert (TREE_OVERFLOW (t
));
12299 /* For tree codes with a sharing machinery re-build the result. */
12300 if (TREE_CODE (t
) == INTEGER_CST
)
12301 return wide_int_to_tree (TREE_TYPE (t
), t
);
12303 /* Otherwise, as all tcc_constants are possibly shared, copy the node
12304 and drop the flag. */
12306 TREE_OVERFLOW (t
) = 0;
12310 /* Given a memory reference expression T, return its base address.
12311 The base address of a memory reference expression is the main
12312 object being referenced. For instance, the base address for
12313 'array[i].fld[j]' is 'array'. You can think of this as stripping
12314 away the offset part from a memory address.
12316 This function calls handled_component_p to strip away all the inner
12317 parts of the memory reference until it reaches the base object. */
12320 get_base_address (tree t
)
12322 while (handled_component_p (t
))
12323 t
= TREE_OPERAND (t
, 0);
12325 if ((TREE_CODE (t
) == MEM_REF
12326 || TREE_CODE (t
) == TARGET_MEM_REF
)
12327 && TREE_CODE (TREE_OPERAND (t
, 0)) == ADDR_EXPR
)
12328 t
= TREE_OPERAND (TREE_OPERAND (t
, 0), 0);
12330 /* ??? Either the alias oracle or all callers need to properly deal
12331 with WITH_SIZE_EXPRs before we can look through those. */
12332 if (TREE_CODE (t
) == WITH_SIZE_EXPR
)
12338 #include "gt-tree.h"