1 /* Language-independent node constructors for parse phase of GNU compiler.
2 Copyright (C) 1987-2021 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 can occasionally
28 calls language-dependent routines. */
32 #include "coretypes.h"
37 #include "tree-pass.h"
40 #include "diagnostic.h"
43 #include "fold-const.h"
44 #include "stor-layout.h"
47 #include "toplev.h" /* get_random_seed */
49 #include "common/common-target.h"
50 #include "langhooks.h"
51 #include "tree-inline.h"
52 #include "tree-iterator.h"
53 #include "internal-fn.h"
54 #include "gimple-iterator.h"
57 #include "langhooks-def.h"
58 #include "tree-diagnostic.h"
61 #include "print-tree.h"
62 #include "ipa-utils.h"
64 #include "stringpool.h"
68 #include "tree-vector-builder.h"
69 #include "gimple-fold.h"
70 #include "escaped_string.h"
72 /* Tree code classes. */
74 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) TYPE,
75 #define END_OF_BASE_TREE_CODES tcc_exceptional,
77 const enum tree_code_class tree_code_type
[] = {
78 #include "all-tree.def"
82 #undef END_OF_BASE_TREE_CODES
84 /* Table indexed by tree code giving number of expression
85 operands beyond the fixed part of the node structure.
86 Not used for types or decls. */
88 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) LENGTH,
89 #define END_OF_BASE_TREE_CODES 0,
91 const unsigned char tree_code_length
[] = {
92 #include "all-tree.def"
96 #undef END_OF_BASE_TREE_CODES
98 /* Names of tree components.
99 Used for printing out the tree and error messages. */
100 #define DEFTREECODE(SYM, NAME, TYPE, LEN) NAME,
101 #define END_OF_BASE_TREE_CODES "@dummy",
103 static const char *const tree_code_name
[] = {
104 #include "all-tree.def"
108 #undef END_OF_BASE_TREE_CODES
110 /* Each tree code class has an associated string representation.
111 These must correspond to the tree_code_class entries. */
113 const char *const tree_code_class_strings
[] =
128 /* obstack.[ch] explicitly declined to prototype this. */
129 extern int _obstack_allocated_p (struct obstack
*h
, void *obj
);
131 /* Statistics-gathering stuff. */
133 static uint64_t tree_code_counts
[MAX_TREE_CODES
];
134 uint64_t tree_node_counts
[(int) all_kinds
];
135 uint64_t tree_node_sizes
[(int) all_kinds
];
137 /* Keep in sync with tree.h:enum tree_node_kind. */
138 static const char * const tree_node_kind_names
[] = {
157 /* Unique id for next decl created. */
158 static GTY(()) int next_decl_uid
;
159 /* Unique id for next type created. */
160 static GTY(()) unsigned next_type_uid
= 1;
161 /* Unique id for next debug decl created. Use negative numbers,
162 to catch erroneous uses. */
163 static GTY(()) int next_debug_decl_uid
;
165 /* Since we cannot rehash a type after it is in the table, we have to
166 keep the hash code. */
168 struct GTY((for_user
)) type_hash
{
173 /* Initial size of the hash table (rounded to next prime). */
174 #define TYPE_HASH_INITIAL_SIZE 1000
176 struct type_cache_hasher
: ggc_cache_ptr_hash
<type_hash
>
178 static hashval_t
hash (type_hash
*t
) { return t
->hash
; }
179 static bool equal (type_hash
*a
, type_hash
*b
);
182 keep_cache_entry (type_hash
*&t
)
184 return ggc_marked_p (t
->type
);
188 /* Now here is the hash table. When recording a type, it is added to
189 the slot whose index is the hash code. Note that the hash table is
190 used for several kinds of types (function types, array types and
191 array index range types, for now). While all these live in the
192 same table, they are completely independent, and the hash code is
193 computed differently for each of these. */
195 static GTY ((cache
)) hash_table
<type_cache_hasher
> *type_hash_table
;
197 /* Hash table and temporary node for larger integer const values. */
198 static GTY (()) tree int_cst_node
;
200 struct int_cst_hasher
: ggc_cache_ptr_hash
<tree_node
>
202 static hashval_t
hash (tree t
);
203 static bool equal (tree x
, tree y
);
206 static GTY ((cache
)) hash_table
<int_cst_hasher
> *int_cst_hash_table
;
208 /* Class and variable for making sure that there is a single POLY_INT_CST
209 for a given value. */
210 struct poly_int_cst_hasher
: ggc_cache_ptr_hash
<tree_node
>
212 typedef std::pair
<tree
, const poly_wide_int
*> compare_type
;
213 static hashval_t
hash (tree t
);
214 static bool equal (tree x
, const compare_type
&y
);
217 static GTY ((cache
)) hash_table
<poly_int_cst_hasher
> *poly_int_cst_hash_table
;
219 /* Hash table for optimization flags and target option flags. Use the same
220 hash table for both sets of options. Nodes for building the current
221 optimization and target option nodes. The assumption is most of the time
222 the options created will already be in the hash table, so we avoid
223 allocating and freeing up a node repeatably. */
224 static GTY (()) tree cl_optimization_node
;
225 static GTY (()) tree cl_target_option_node
;
227 struct cl_option_hasher
: ggc_cache_ptr_hash
<tree_node
>
229 static hashval_t
hash (tree t
);
230 static bool equal (tree x
, tree y
);
233 static GTY ((cache
)) hash_table
<cl_option_hasher
> *cl_option_hash_table
;
235 /* General tree->tree mapping structure for use in hash tables. */
239 hash_table
<tree_decl_map_cache_hasher
> *debug_expr_for_decl
;
242 hash_table
<tree_decl_map_cache_hasher
> *value_expr_for_decl
;
244 struct tree_vec_map_cache_hasher
: ggc_cache_ptr_hash
<tree_vec_map
>
246 static hashval_t
hash (tree_vec_map
*m
) { return DECL_UID (m
->base
.from
); }
249 equal (tree_vec_map
*a
, tree_vec_map
*b
)
251 return a
->base
.from
== b
->base
.from
;
255 keep_cache_entry (tree_vec_map
*&m
)
257 return ggc_marked_p (m
->base
.from
);
262 hash_table
<tree_vec_map_cache_hasher
> *debug_args_for_decl
;
264 static void set_type_quals (tree
, int);
265 static void print_type_hash_statistics (void);
266 static void print_debug_expr_statistics (void);
267 static void print_value_expr_statistics (void);
269 static tree
build_array_type_1 (tree
, tree
, bool, bool, bool);
271 tree global_trees
[TI_MAX
];
272 tree integer_types
[itk_none
];
274 bool int_n_enabled_p
[NUM_INT_N_ENTS
];
275 struct int_n_trees_t int_n_trees
[NUM_INT_N_ENTS
];
277 bool tree_contains_struct
[MAX_TREE_CODES
][64];
279 /* Number of operands for each OpenMP clause. */
280 unsigned const char omp_clause_num_ops
[] =
282 0, /* OMP_CLAUSE_ERROR */
283 1, /* OMP_CLAUSE_PRIVATE */
284 1, /* OMP_CLAUSE_SHARED */
285 1, /* OMP_CLAUSE_FIRSTPRIVATE */
286 2, /* OMP_CLAUSE_LASTPRIVATE */
287 5, /* OMP_CLAUSE_REDUCTION */
288 5, /* OMP_CLAUSE_TASK_REDUCTION */
289 5, /* OMP_CLAUSE_IN_REDUCTION */
290 1, /* OMP_CLAUSE_COPYIN */
291 1, /* OMP_CLAUSE_COPYPRIVATE */
292 3, /* OMP_CLAUSE_LINEAR */
293 2, /* OMP_CLAUSE_ALIGNED */
294 2, /* OMP_CLAUSE_ALLOCATE */
295 1, /* OMP_CLAUSE_DEPEND */
296 1, /* OMP_CLAUSE_NONTEMPORAL */
297 1, /* OMP_CLAUSE_UNIFORM */
298 1, /* OMP_CLAUSE_TO_DECLARE */
299 1, /* OMP_CLAUSE_LINK */
300 1, /* OMP_CLAUSE_DETACH */
301 1, /* OMP_CLAUSE_USE_DEVICE_PTR */
302 1, /* OMP_CLAUSE_USE_DEVICE_ADDR */
303 1, /* OMP_CLAUSE_IS_DEVICE_PTR */
304 1, /* OMP_CLAUSE_INCLUSIVE */
305 1, /* OMP_CLAUSE_EXCLUSIVE */
306 2, /* OMP_CLAUSE_FROM */
307 2, /* OMP_CLAUSE_TO */
308 2, /* OMP_CLAUSE_MAP */
309 2, /* OMP_CLAUSE__CACHE_ */
310 2, /* OMP_CLAUSE_GANG */
311 1, /* OMP_CLAUSE_ASYNC */
312 1, /* OMP_CLAUSE_WAIT */
313 0, /* OMP_CLAUSE_AUTO */
314 0, /* OMP_CLAUSE_SEQ */
315 1, /* OMP_CLAUSE__LOOPTEMP_ */
316 1, /* OMP_CLAUSE__REDUCTEMP_ */
317 1, /* OMP_CLAUSE__CONDTEMP_ */
318 1, /* OMP_CLAUSE__SCANTEMP_ */
319 1, /* OMP_CLAUSE_IF */
320 1, /* OMP_CLAUSE_NUM_THREADS */
321 1, /* OMP_CLAUSE_SCHEDULE */
322 0, /* OMP_CLAUSE_NOWAIT */
323 1, /* OMP_CLAUSE_ORDERED */
324 0, /* OMP_CLAUSE_DEFAULT */
325 3, /* OMP_CLAUSE_COLLAPSE */
326 0, /* OMP_CLAUSE_UNTIED */
327 1, /* OMP_CLAUSE_FINAL */
328 0, /* OMP_CLAUSE_MERGEABLE */
329 1, /* OMP_CLAUSE_DEVICE */
330 1, /* OMP_CLAUSE_DIST_SCHEDULE */
331 0, /* OMP_CLAUSE_INBRANCH */
332 0, /* OMP_CLAUSE_NOTINBRANCH */
333 1, /* OMP_CLAUSE_NUM_TEAMS */
334 1, /* OMP_CLAUSE_THREAD_LIMIT */
335 0, /* OMP_CLAUSE_PROC_BIND */
336 1, /* OMP_CLAUSE_SAFELEN */
337 1, /* OMP_CLAUSE_SIMDLEN */
338 0, /* OMP_CLAUSE_DEVICE_TYPE */
339 0, /* OMP_CLAUSE_FOR */
340 0, /* OMP_CLAUSE_PARALLEL */
341 0, /* OMP_CLAUSE_SECTIONS */
342 0, /* OMP_CLAUSE_TASKGROUP */
343 1, /* OMP_CLAUSE_PRIORITY */
344 1, /* OMP_CLAUSE_GRAINSIZE */
345 1, /* OMP_CLAUSE_NUM_TASKS */
346 0, /* OMP_CLAUSE_NOGROUP */
347 0, /* OMP_CLAUSE_THREADS */
348 0, /* OMP_CLAUSE_SIMD */
349 1, /* OMP_CLAUSE_HINT */
350 0, /* OMP_CLAUSE_DEFAULTMAP */
351 0, /* OMP_CLAUSE_ORDER */
352 0, /* OMP_CLAUSE_BIND */
353 1, /* OMP_CLAUSE__SIMDUID_ */
354 0, /* OMP_CLAUSE__SIMT_ */
355 0, /* OMP_CLAUSE_INDEPENDENT */
356 1, /* OMP_CLAUSE_WORKER */
357 1, /* OMP_CLAUSE_VECTOR */
358 1, /* OMP_CLAUSE_NUM_GANGS */
359 1, /* OMP_CLAUSE_NUM_WORKERS */
360 1, /* OMP_CLAUSE_VECTOR_LENGTH */
361 3, /* OMP_CLAUSE_TILE */
362 0, /* OMP_CLAUSE_IF_PRESENT */
363 0, /* OMP_CLAUSE_FINALIZE */
366 const char * const omp_clause_code_name
[] =
453 /* Return the tree node structure used by tree code CODE. */
455 static inline enum tree_node_structure_enum
456 tree_node_structure_for_code (enum tree_code code
)
458 switch (TREE_CODE_CLASS (code
))
460 case tcc_declaration
:
463 case CONST_DECL
: return TS_CONST_DECL
;
464 case DEBUG_EXPR_DECL
: return TS_DECL_WRTL
;
465 case FIELD_DECL
: return TS_FIELD_DECL
;
466 case FUNCTION_DECL
: return TS_FUNCTION_DECL
;
467 case LABEL_DECL
: return TS_LABEL_DECL
;
468 case PARM_DECL
: return TS_PARM_DECL
;
469 case RESULT_DECL
: return TS_RESULT_DECL
;
470 case TRANSLATION_UNIT_DECL
: return TS_TRANSLATION_UNIT_DECL
;
471 case TYPE_DECL
: return TS_TYPE_DECL
;
472 case VAR_DECL
: return TS_VAR_DECL
;
473 default: return TS_DECL_NON_COMMON
;
476 case tcc_type
: return TS_TYPE_NON_COMMON
;
484 case tcc_vl_exp
: return TS_EXP
;
486 default: /* tcc_constant and tcc_exceptional */
492 /* tcc_constant cases. */
493 case COMPLEX_CST
: return TS_COMPLEX
;
494 case FIXED_CST
: return TS_FIXED_CST
;
495 case INTEGER_CST
: return TS_INT_CST
;
496 case POLY_INT_CST
: return TS_POLY_INT_CST
;
497 case REAL_CST
: return TS_REAL_CST
;
498 case STRING_CST
: return TS_STRING
;
499 case VECTOR_CST
: return TS_VECTOR
;
500 case VOID_CST
: return TS_TYPED
;
502 /* tcc_exceptional cases. */
503 case BLOCK
: return TS_BLOCK
;
504 case CONSTRUCTOR
: return TS_CONSTRUCTOR
;
505 case ERROR_MARK
: return TS_COMMON
;
506 case IDENTIFIER_NODE
: return TS_IDENTIFIER
;
507 case OMP_CLAUSE
: return TS_OMP_CLAUSE
;
508 case OPTIMIZATION_NODE
: return TS_OPTIMIZATION
;
509 case PLACEHOLDER_EXPR
: return TS_COMMON
;
510 case SSA_NAME
: return TS_SSA_NAME
;
511 case STATEMENT_LIST
: return TS_STATEMENT_LIST
;
512 case TARGET_OPTION_NODE
: return TS_TARGET_OPTION
;
513 case TREE_BINFO
: return TS_BINFO
;
514 case TREE_LIST
: return TS_LIST
;
515 case TREE_VEC
: return TS_VEC
;
523 /* Initialize tree_contains_struct to describe the hierarchy of tree
527 initialize_tree_contains_struct (void)
531 for (i
= ERROR_MARK
; i
< LAST_AND_UNUSED_TREE_CODE
; i
++)
534 enum tree_node_structure_enum ts_code
;
536 code
= (enum tree_code
) i
;
537 ts_code
= tree_node_structure_for_code (code
);
539 /* Mark the TS structure itself. */
540 tree_contains_struct
[code
][ts_code
] = 1;
542 /* Mark all the structures that TS is derived from. */
547 case TS_OPTIMIZATION
:
548 case TS_TARGET_OPTION
:
554 case TS_POLY_INT_CST
:
563 case TS_STATEMENT_LIST
:
564 MARK_TS_TYPED (code
);
568 case TS_DECL_MINIMAL
:
574 MARK_TS_COMMON (code
);
577 case TS_TYPE_WITH_LANG_SPECIFIC
:
578 MARK_TS_TYPE_COMMON (code
);
581 case TS_TYPE_NON_COMMON
:
582 MARK_TS_TYPE_WITH_LANG_SPECIFIC (code
);
586 MARK_TS_DECL_MINIMAL (code
);
591 MARK_TS_DECL_COMMON (code
);
594 case TS_DECL_NON_COMMON
:
595 MARK_TS_DECL_WITH_VIS (code
);
598 case TS_DECL_WITH_VIS
:
602 MARK_TS_DECL_WRTL (code
);
606 MARK_TS_DECL_COMMON (code
);
610 MARK_TS_DECL_WITH_VIS (code
);
614 case TS_FUNCTION_DECL
:
615 MARK_TS_DECL_NON_COMMON (code
);
618 case TS_TRANSLATION_UNIT_DECL
:
619 MARK_TS_DECL_COMMON (code
);
627 /* Basic consistency checks for attributes used in fold. */
628 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_NON_COMMON
]);
629 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_NON_COMMON
]);
630 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_DECL_COMMON
]);
631 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_COMMON
]);
632 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_COMMON
]);
633 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_COMMON
]);
634 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_COMMON
]);
635 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_COMMON
]);
636 gcc_assert (tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_COMMON
]);
637 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_COMMON
]);
638 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_DECL_COMMON
]);
639 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_WRTL
]);
640 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_WRTL
]);
641 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_WRTL
]);
642 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WRTL
]);
643 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_WRTL
]);
644 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_DECL_MINIMAL
]);
645 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_MINIMAL
]);
646 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_MINIMAL
]);
647 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_MINIMAL
]);
648 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_MINIMAL
]);
649 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_MINIMAL
]);
650 gcc_assert (tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_MINIMAL
]);
651 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_MINIMAL
]);
652 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_DECL_MINIMAL
]);
653 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_WITH_VIS
]);
654 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WITH_VIS
]);
655 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_WITH_VIS
]);
656 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_VAR_DECL
]);
657 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_FIELD_DECL
]);
658 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_PARM_DECL
]);
659 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_LABEL_DECL
]);
660 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_RESULT_DECL
]);
661 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_CONST_DECL
]);
662 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_TYPE_DECL
]);
663 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_FUNCTION_DECL
]);
664 gcc_assert (tree_contains_struct
[IMPORTED_DECL
][TS_DECL_MINIMAL
]);
665 gcc_assert (tree_contains_struct
[IMPORTED_DECL
][TS_DECL_COMMON
]);
666 gcc_assert (tree_contains_struct
[NAMELIST_DECL
][TS_DECL_MINIMAL
]);
667 gcc_assert (tree_contains_struct
[NAMELIST_DECL
][TS_DECL_COMMON
]);
676 /* Initialize the hash table of types. */
678 = hash_table
<type_cache_hasher
>::create_ggc (TYPE_HASH_INITIAL_SIZE
);
681 = hash_table
<tree_decl_map_cache_hasher
>::create_ggc (512);
684 = hash_table
<tree_decl_map_cache_hasher
>::create_ggc (512);
686 int_cst_hash_table
= hash_table
<int_cst_hasher
>::create_ggc (1024);
688 poly_int_cst_hash_table
= hash_table
<poly_int_cst_hasher
>::create_ggc (64);
690 int_cst_node
= make_int_cst (1, 1);
692 cl_option_hash_table
= hash_table
<cl_option_hasher
>::create_ggc (64);
694 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
695 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
697 /* Initialize the tree_contains_struct array. */
698 initialize_tree_contains_struct ();
699 lang_hooks
.init_ts ();
703 /* The name of the object as the assembler will see it (but before any
704 translations made by ASM_OUTPUT_LABELREF). Often this is the same
705 as DECL_NAME. It is an IDENTIFIER_NODE. */
707 decl_assembler_name (tree decl
)
709 if (!DECL_ASSEMBLER_NAME_SET_P (decl
))
710 lang_hooks
.set_decl_assembler_name (decl
);
711 return DECL_ASSEMBLER_NAME_RAW (decl
);
714 /* The DECL_ASSEMBLER_NAME_RAW of DECL is being explicitly set to NAME
715 (either of which may be NULL). Inform the FE, if this changes the
719 overwrite_decl_assembler_name (tree decl
, tree name
)
721 if (DECL_ASSEMBLER_NAME_RAW (decl
) != name
)
722 lang_hooks
.overwrite_decl_assembler_name (decl
, name
);
725 /* When the target supports COMDAT groups, this indicates which group the
726 DECL is associated with. This can be either an IDENTIFIER_NODE or a
727 decl, in which case its DECL_ASSEMBLER_NAME identifies the group. */
729 decl_comdat_group (const_tree node
)
731 struct symtab_node
*snode
= symtab_node::get (node
);
734 return snode
->get_comdat_group ();
737 /* Likewise, but make sure it's been reduced to an IDENTIFIER_NODE. */
739 decl_comdat_group_id (const_tree node
)
741 struct symtab_node
*snode
= symtab_node::get (node
);
744 return snode
->get_comdat_group_id ();
747 /* When the target supports named section, return its name as IDENTIFIER_NODE
748 or NULL if it is in no section. */
750 decl_section_name (const_tree node
)
752 struct symtab_node
*snode
= symtab_node::get (node
);
755 return snode
->get_section ();
758 /* Set section name of NODE to VALUE (that is expected to be
761 set_decl_section_name (tree node
, const char *value
)
763 struct symtab_node
*snode
;
767 snode
= symtab_node::get (node
);
771 else if (VAR_P (node
))
772 snode
= varpool_node::get_create (node
);
774 snode
= cgraph_node::get_create (node
);
775 snode
->set_section (value
);
778 /* Set section name of NODE to match the section name of OTHER.
780 set_decl_section_name (decl, other) is equivalent to
781 set_decl_section_name (decl, DECL_SECTION_NAME (other)), but possibly more
784 set_decl_section_name (tree decl
, const_tree other
)
786 struct symtab_node
*other_node
= symtab_node::get (other
);
789 struct symtab_node
*decl_node
;
791 decl_node
= varpool_node::get_create (decl
);
793 decl_node
= cgraph_node::get_create (decl
);
794 decl_node
->set_section (*other_node
);
798 struct symtab_node
*decl_node
= symtab_node::get (decl
);
801 decl_node
->set_section (NULL
);
805 /* Return TLS model of a variable NODE. */
807 decl_tls_model (const_tree node
)
809 struct varpool_node
*snode
= varpool_node::get (node
);
811 return TLS_MODEL_NONE
;
812 return snode
->tls_model
;
815 /* Set TLS model of variable NODE to MODEL. */
817 set_decl_tls_model (tree node
, enum tls_model model
)
819 struct varpool_node
*vnode
;
821 if (model
== TLS_MODEL_NONE
)
823 vnode
= varpool_node::get (node
);
828 vnode
= varpool_node::get_create (node
);
829 vnode
->tls_model
= model
;
832 /* Compute the number of bytes occupied by a tree with code CODE.
833 This function cannot be used for nodes that have variable sizes,
834 including TREE_VEC, INTEGER_CST, STRING_CST, and CALL_EXPR. */
836 tree_code_size (enum tree_code code
)
838 switch (TREE_CODE_CLASS (code
))
840 case tcc_declaration
: /* A decl node */
843 case FIELD_DECL
: return sizeof (tree_field_decl
);
844 case PARM_DECL
: return sizeof (tree_parm_decl
);
845 case VAR_DECL
: return sizeof (tree_var_decl
);
846 case LABEL_DECL
: return sizeof (tree_label_decl
);
847 case RESULT_DECL
: return sizeof (tree_result_decl
);
848 case CONST_DECL
: return sizeof (tree_const_decl
);
849 case TYPE_DECL
: return sizeof (tree_type_decl
);
850 case FUNCTION_DECL
: return sizeof (tree_function_decl
);
851 case DEBUG_EXPR_DECL
: return sizeof (tree_decl_with_rtl
);
852 case TRANSLATION_UNIT_DECL
: return sizeof (tree_translation_unit_decl
);
855 case NAMELIST_DECL
: return sizeof (tree_decl_non_common
);
857 gcc_checking_assert (code
>= NUM_TREE_CODES
);
858 return lang_hooks
.tree_size (code
);
861 case tcc_type
: /* a type node */
873 case FIXED_POINT_TYPE
:
879 case QUAL_UNION_TYPE
:
883 case LANG_TYPE
: return sizeof (tree_type_non_common
);
885 gcc_checking_assert (code
>= NUM_TREE_CODES
);
886 return lang_hooks
.tree_size (code
);
889 case tcc_reference
: /* a reference */
890 case tcc_expression
: /* an expression */
891 case tcc_statement
: /* an expression with side effects */
892 case tcc_comparison
: /* a comparison expression */
893 case tcc_unary
: /* a unary arithmetic expression */
894 case tcc_binary
: /* a binary arithmetic expression */
895 return (sizeof (struct tree_exp
)
896 + (TREE_CODE_LENGTH (code
) - 1) * sizeof (tree
));
898 case tcc_constant
: /* a constant */
901 case VOID_CST
: return sizeof (tree_typed
);
902 case INTEGER_CST
: gcc_unreachable ();
903 case POLY_INT_CST
: return sizeof (tree_poly_int_cst
);
904 case REAL_CST
: return sizeof (tree_real_cst
);
905 case FIXED_CST
: return sizeof (tree_fixed_cst
);
906 case COMPLEX_CST
: return sizeof (tree_complex
);
907 case VECTOR_CST
: gcc_unreachable ();
908 case STRING_CST
: gcc_unreachable ();
910 gcc_checking_assert (code
>= NUM_TREE_CODES
);
911 return lang_hooks
.tree_size (code
);
914 case tcc_exceptional
: /* something random, like an identifier. */
917 case IDENTIFIER_NODE
: return lang_hooks
.identifier_size
;
918 case TREE_LIST
: return sizeof (tree_list
);
921 case PLACEHOLDER_EXPR
: return sizeof (tree_common
);
923 case TREE_VEC
: gcc_unreachable ();
924 case OMP_CLAUSE
: gcc_unreachable ();
926 case SSA_NAME
: return sizeof (tree_ssa_name
);
928 case STATEMENT_LIST
: return sizeof (tree_statement_list
);
929 case BLOCK
: return sizeof (struct tree_block
);
930 case CONSTRUCTOR
: return sizeof (tree_constructor
);
931 case OPTIMIZATION_NODE
: return sizeof (tree_optimization_option
);
932 case TARGET_OPTION_NODE
: return sizeof (tree_target_option
);
935 gcc_checking_assert (code
>= NUM_TREE_CODES
);
936 return lang_hooks
.tree_size (code
);
944 /* Compute the number of bytes occupied by NODE. This routine only
945 looks at TREE_CODE, except for those nodes that have variable sizes. */
947 tree_size (const_tree node
)
949 const enum tree_code code
= TREE_CODE (node
);
953 return (sizeof (struct tree_int_cst
)
954 + (TREE_INT_CST_EXT_NUNITS (node
) - 1) * sizeof (HOST_WIDE_INT
));
957 return (offsetof (struct tree_binfo
, base_binfos
)
959 ::embedded_size (BINFO_N_BASE_BINFOS (node
)));
962 return (sizeof (struct tree_vec
)
963 + (TREE_VEC_LENGTH (node
) - 1) * sizeof (tree
));
966 return (sizeof (struct tree_vector
)
967 + (vector_cst_encoded_nelts (node
) - 1) * sizeof (tree
));
970 return TREE_STRING_LENGTH (node
) + offsetof (struct tree_string
, str
) + 1;
973 return (sizeof (struct tree_omp_clause
)
974 + (omp_clause_num_ops
[OMP_CLAUSE_CODE (node
)] - 1)
978 if (TREE_CODE_CLASS (code
) == tcc_vl_exp
)
979 return (sizeof (struct tree_exp
)
980 + (VL_EXP_OPERAND_LENGTH (node
) - 1) * sizeof (tree
));
982 return tree_code_size (code
);
986 /* Return tree node kind based on tree CODE. */
988 static tree_node_kind
989 get_stats_node_kind (enum tree_code code
)
991 enum tree_code_class type
= TREE_CODE_CLASS (code
);
995 case tcc_declaration
: /* A decl node */
997 case tcc_type
: /* a type node */
999 case tcc_statement
: /* an expression with side effects */
1001 case tcc_reference
: /* a reference */
1003 case tcc_expression
: /* an expression */
1004 case tcc_comparison
: /* a comparison expression */
1005 case tcc_unary
: /* a unary arithmetic expression */
1006 case tcc_binary
: /* a binary arithmetic expression */
1008 case tcc_constant
: /* a constant */
1010 case tcc_exceptional
: /* something random, like an identifier. */
1013 case IDENTIFIER_NODE
:
1020 return ssa_name_kind
;
1026 return omp_clause_kind
;
1038 /* Record interesting allocation statistics for a tree node with CODE
1042 record_node_allocation_statistics (enum tree_code code
, size_t length
)
1044 if (!GATHER_STATISTICS
)
1047 tree_node_kind kind
= get_stats_node_kind (code
);
1049 tree_code_counts
[(int) code
]++;
1050 tree_node_counts
[(int) kind
]++;
1051 tree_node_sizes
[(int) kind
] += length
;
1054 /* Allocate and return a new UID from the DECL_UID namespace. */
1057 allocate_decl_uid (void)
1059 return next_decl_uid
++;
1062 /* Return a newly allocated node of code CODE. For decl and type
1063 nodes, some other fields are initialized. The rest of the node is
1064 initialized to zero. This function cannot be used for TREE_VEC,
1065 INTEGER_CST or OMP_CLAUSE nodes, which is enforced by asserts in
1068 Achoo! I got a code in the node. */
1071 make_node (enum tree_code code MEM_STAT_DECL
)
1074 enum tree_code_class type
= TREE_CODE_CLASS (code
);
1075 size_t length
= tree_code_size (code
);
1077 record_node_allocation_statistics (code
, length
);
1079 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
1080 TREE_SET_CODE (t
, code
);
1085 if (code
!= DEBUG_BEGIN_STMT
)
1086 TREE_SIDE_EFFECTS (t
) = 1;
1089 case tcc_declaration
:
1090 if (CODE_CONTAINS_STRUCT (code
, TS_DECL_COMMON
))
1092 if (code
== FUNCTION_DECL
)
1094 SET_DECL_ALIGN (t
, FUNCTION_ALIGNMENT (FUNCTION_BOUNDARY
));
1095 SET_DECL_MODE (t
, FUNCTION_MODE
);
1098 SET_DECL_ALIGN (t
, 1);
1100 DECL_SOURCE_LOCATION (t
) = input_location
;
1101 if (TREE_CODE (t
) == DEBUG_EXPR_DECL
)
1102 DECL_UID (t
) = --next_debug_decl_uid
;
1105 DECL_UID (t
) = allocate_decl_uid ();
1106 SET_DECL_PT_UID (t
, -1);
1108 if (TREE_CODE (t
) == LABEL_DECL
)
1109 LABEL_DECL_UID (t
) = -1;
1114 TYPE_UID (t
) = next_type_uid
++;
1115 SET_TYPE_ALIGN (t
, BITS_PER_UNIT
);
1116 TYPE_USER_ALIGN (t
) = 0;
1117 TYPE_MAIN_VARIANT (t
) = t
;
1118 TYPE_CANONICAL (t
) = t
;
1120 /* Default to no attributes for type, but let target change that. */
1121 TYPE_ATTRIBUTES (t
) = NULL_TREE
;
1122 targetm
.set_default_type_attributes (t
);
1124 /* We have not yet computed the alias set for this type. */
1125 TYPE_ALIAS_SET (t
) = -1;
1129 TREE_CONSTANT (t
) = 1;
1132 case tcc_expression
:
1138 case PREDECREMENT_EXPR
:
1139 case PREINCREMENT_EXPR
:
1140 case POSTDECREMENT_EXPR
:
1141 case POSTINCREMENT_EXPR
:
1142 /* All of these have side-effects, no matter what their
1144 TREE_SIDE_EFFECTS (t
) = 1;
1152 case tcc_exceptional
:
1155 case TARGET_OPTION_NODE
:
1156 TREE_TARGET_OPTION(t
)
1157 = ggc_cleared_alloc
<struct cl_target_option
> ();
1160 case OPTIMIZATION_NODE
:
1161 TREE_OPTIMIZATION (t
)
1162 = ggc_cleared_alloc
<struct cl_optimization
> ();
1171 /* Other classes need no special treatment. */
1178 /* Free tree node. */
1181 free_node (tree node
)
1183 enum tree_code code
= TREE_CODE (node
);
1184 if (GATHER_STATISTICS
)
1186 enum tree_node_kind kind
= get_stats_node_kind (code
);
1188 gcc_checking_assert (tree_code_counts
[(int) TREE_CODE (node
)] != 0);
1189 gcc_checking_assert (tree_node_counts
[(int) kind
] != 0);
1190 gcc_checking_assert (tree_node_sizes
[(int) kind
] >= tree_size (node
));
1192 tree_code_counts
[(int) TREE_CODE (node
)]--;
1193 tree_node_counts
[(int) kind
]--;
1194 tree_node_sizes
[(int) kind
] -= tree_size (node
);
1196 if (CODE_CONTAINS_STRUCT (code
, TS_CONSTRUCTOR
))
1197 vec_free (CONSTRUCTOR_ELTS (node
));
1198 else if (code
== BLOCK
)
1199 vec_free (BLOCK_NONLOCALIZED_VARS (node
));
1200 else if (code
== TREE_BINFO
)
1201 vec_free (BINFO_BASE_ACCESSES (node
));
1202 else if (code
== OPTIMIZATION_NODE
)
1203 cl_optimization_option_free (TREE_OPTIMIZATION (node
));
1204 else if (code
== TARGET_OPTION_NODE
)
1205 cl_target_option_free (TREE_TARGET_OPTION (node
));
1209 /* Return a new node with the same contents as NODE except that its
1210 TREE_CHAIN, if it has one, is zero and it has a fresh uid. */
1213 copy_node (tree node MEM_STAT_DECL
)
1216 enum tree_code code
= TREE_CODE (node
);
1219 gcc_assert (code
!= STATEMENT_LIST
);
1221 length
= tree_size (node
);
1222 record_node_allocation_statistics (code
, length
);
1223 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
1224 memcpy (t
, node
, length
);
1226 if (CODE_CONTAINS_STRUCT (code
, TS_COMMON
))
1228 TREE_ASM_WRITTEN (t
) = 0;
1229 TREE_VISITED (t
) = 0;
1231 if (TREE_CODE_CLASS (code
) == tcc_declaration
)
1233 if (code
== DEBUG_EXPR_DECL
)
1234 DECL_UID (t
) = --next_debug_decl_uid
;
1237 DECL_UID (t
) = allocate_decl_uid ();
1238 if (DECL_PT_UID_SET_P (node
))
1239 SET_DECL_PT_UID (t
, DECL_PT_UID (node
));
1241 if ((TREE_CODE (node
) == PARM_DECL
|| VAR_P (node
))
1242 && DECL_HAS_VALUE_EXPR_P (node
))
1244 SET_DECL_VALUE_EXPR (t
, DECL_VALUE_EXPR (node
));
1245 DECL_HAS_VALUE_EXPR_P (t
) = 1;
1247 /* DECL_DEBUG_EXPR is copied explicitly by callers. */
1250 DECL_HAS_DEBUG_EXPR_P (t
) = 0;
1251 t
->decl_with_vis
.symtab_node
= NULL
;
1253 if (VAR_P (node
) && DECL_HAS_INIT_PRIORITY_P (node
))
1255 SET_DECL_INIT_PRIORITY (t
, DECL_INIT_PRIORITY (node
));
1256 DECL_HAS_INIT_PRIORITY_P (t
) = 1;
1258 if (TREE_CODE (node
) == FUNCTION_DECL
)
1260 DECL_STRUCT_FUNCTION (t
) = NULL
;
1261 t
->decl_with_vis
.symtab_node
= NULL
;
1264 else if (TREE_CODE_CLASS (code
) == tcc_type
)
1266 TYPE_UID (t
) = next_type_uid
++;
1267 /* The following is so that the debug code for
1268 the copy is different from the original type.
1269 The two statements usually duplicate each other
1270 (because they clear fields of the same union),
1271 but the optimizer should catch that. */
1272 TYPE_SYMTAB_ADDRESS (t
) = 0;
1273 TYPE_SYMTAB_DIE (t
) = 0;
1275 /* Do not copy the values cache. */
1276 if (TYPE_CACHED_VALUES_P (t
))
1278 TYPE_CACHED_VALUES_P (t
) = 0;
1279 TYPE_CACHED_VALUES (t
) = NULL_TREE
;
1282 else if (code
== TARGET_OPTION_NODE
)
1284 TREE_TARGET_OPTION (t
) = ggc_alloc
<struct cl_target_option
>();
1285 memcpy (TREE_TARGET_OPTION (t
), TREE_TARGET_OPTION (node
),
1286 sizeof (struct cl_target_option
));
1288 else if (code
== OPTIMIZATION_NODE
)
1290 TREE_OPTIMIZATION (t
) = ggc_alloc
<struct cl_optimization
>();
1291 memcpy (TREE_OPTIMIZATION (t
), TREE_OPTIMIZATION (node
),
1292 sizeof (struct cl_optimization
));
1298 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
1299 For example, this can copy a list made of TREE_LIST nodes. */
1302 copy_list (tree list
)
1310 head
= prev
= copy_node (list
);
1311 next
= TREE_CHAIN (list
);
1314 TREE_CHAIN (prev
) = copy_node (next
);
1315 prev
= TREE_CHAIN (prev
);
1316 next
= TREE_CHAIN (next
);
1322 /* Return the value that TREE_INT_CST_EXT_NUNITS should have for an
1323 INTEGER_CST with value CST and type TYPE. */
1326 get_int_cst_ext_nunits (tree type
, const wide_int
&cst
)
1328 gcc_checking_assert (cst
.get_precision () == TYPE_PRECISION (type
));
1329 /* We need extra HWIs if CST is an unsigned integer with its
1331 if (TYPE_UNSIGNED (type
) && wi::neg_p (cst
))
1332 return cst
.get_precision () / HOST_BITS_PER_WIDE_INT
+ 1;
1333 return cst
.get_len ();
1336 /* Return a new INTEGER_CST with value CST and type TYPE. */
1339 build_new_int_cst (tree type
, const wide_int
&cst
)
1341 unsigned int len
= cst
.get_len ();
1342 unsigned int ext_len
= get_int_cst_ext_nunits (type
, cst
);
1343 tree nt
= make_int_cst (len
, ext_len
);
1348 TREE_INT_CST_ELT (nt
, ext_len
)
1349 = zext_hwi (-1, cst
.get_precision () % HOST_BITS_PER_WIDE_INT
);
1350 for (unsigned int i
= len
; i
< ext_len
; ++i
)
1351 TREE_INT_CST_ELT (nt
, i
) = -1;
1353 else if (TYPE_UNSIGNED (type
)
1354 && cst
.get_precision () < len
* HOST_BITS_PER_WIDE_INT
)
1357 TREE_INT_CST_ELT (nt
, len
)
1358 = zext_hwi (cst
.elt (len
),
1359 cst
.get_precision () % HOST_BITS_PER_WIDE_INT
);
1362 for (unsigned int i
= 0; i
< len
; i
++)
1363 TREE_INT_CST_ELT (nt
, i
) = cst
.elt (i
);
1364 TREE_TYPE (nt
) = type
;
1368 /* Return a new POLY_INT_CST with coefficients COEFFS and type TYPE. */
1371 build_new_poly_int_cst (tree type
, tree (&coeffs
)[NUM_POLY_INT_COEFFS
]
1374 size_t length
= sizeof (struct tree_poly_int_cst
);
1375 record_node_allocation_statistics (POLY_INT_CST
, length
);
1377 tree t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
1379 TREE_SET_CODE (t
, POLY_INT_CST
);
1380 TREE_CONSTANT (t
) = 1;
1381 TREE_TYPE (t
) = type
;
1382 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
1383 POLY_INT_CST_COEFF (t
, i
) = coeffs
[i
];
1387 /* Create a constant tree that contains CST sign-extended to TYPE. */
1390 build_int_cst (tree type
, poly_int64 cst
)
1392 /* Support legacy code. */
1394 type
= integer_type_node
;
1396 return wide_int_to_tree (type
, wi::shwi (cst
, TYPE_PRECISION (type
)));
1399 /* Create a constant tree that contains CST zero-extended to TYPE. */
1402 build_int_cstu (tree type
, poly_uint64 cst
)
1404 return wide_int_to_tree (type
, wi::uhwi (cst
, TYPE_PRECISION (type
)));
1407 /* Create a constant tree that contains CST sign-extended to TYPE. */
1410 build_int_cst_type (tree type
, poly_int64 cst
)
1413 return wide_int_to_tree (type
, wi::shwi (cst
, TYPE_PRECISION (type
)));
1416 /* Constructs tree in type TYPE from with value given by CST. Signedness
1417 of CST is assumed to be the same as the signedness of TYPE. */
1420 double_int_to_tree (tree type
, double_int cst
)
1422 return wide_int_to_tree (type
, widest_int::from (cst
, TYPE_SIGN (type
)));
1425 /* We force the wide_int CST to the range of the type TYPE by sign or
1426 zero extending it. OVERFLOWABLE indicates if we are interested in
1427 overflow of the value, when >0 we are only interested in signed
1428 overflow, for <0 we are interested in any overflow. OVERFLOWED
1429 indicates whether overflow has already occurred. CONST_OVERFLOWED
1430 indicates whether constant overflow has already occurred. We force
1431 T's value to be within range of T's type (by setting to 0 or 1 all
1432 the bits outside the type's range). We set TREE_OVERFLOWED if,
1433 OVERFLOWED is nonzero,
1434 or OVERFLOWABLE is >0 and signed overflow occurs
1435 or OVERFLOWABLE is <0 and any overflow occurs
1436 We return a new tree node for the extended wide_int. The node
1437 is shared if no overflow flags are set. */
1441 force_fit_type (tree type
, const poly_wide_int_ref
&cst
,
1442 int overflowable
, bool overflowed
)
1444 signop sign
= TYPE_SIGN (type
);
1446 /* If we need to set overflow flags, return a new unshared node. */
1447 if (overflowed
|| !wi::fits_to_tree_p (cst
, type
))
1451 || (overflowable
> 0 && sign
== SIGNED
))
1453 poly_wide_int tmp
= poly_wide_int::from (cst
, TYPE_PRECISION (type
),
1456 if (tmp
.is_constant ())
1457 t
= build_new_int_cst (type
, tmp
.coeffs
[0]);
1460 tree coeffs
[NUM_POLY_INT_COEFFS
];
1461 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
1463 coeffs
[i
] = build_new_int_cst (type
, tmp
.coeffs
[i
]);
1464 TREE_OVERFLOW (coeffs
[i
]) = 1;
1466 t
= build_new_poly_int_cst (type
, coeffs
);
1468 TREE_OVERFLOW (t
) = 1;
1473 /* Else build a shared node. */
1474 return wide_int_to_tree (type
, cst
);
1477 /* These are the hash table functions for the hash table of INTEGER_CST
1478 nodes of a sizetype. */
1480 /* Return the hash code X, an INTEGER_CST. */
1483 int_cst_hasher::hash (tree x
)
1485 const_tree
const t
= x
;
1486 hashval_t code
= TYPE_UID (TREE_TYPE (t
));
1489 for (i
= 0; i
< TREE_INT_CST_NUNITS (t
); i
++)
1490 code
= iterative_hash_host_wide_int (TREE_INT_CST_ELT(t
, i
), code
);
1495 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
1496 is the same as that given by *Y, which is the same. */
1499 int_cst_hasher::equal (tree x
, tree y
)
1501 const_tree
const xt
= x
;
1502 const_tree
const yt
= y
;
1504 if (TREE_TYPE (xt
) != TREE_TYPE (yt
)
1505 || TREE_INT_CST_NUNITS (xt
) != TREE_INT_CST_NUNITS (yt
)
1506 || TREE_INT_CST_EXT_NUNITS (xt
) != TREE_INT_CST_EXT_NUNITS (yt
))
1509 for (int i
= 0; i
< TREE_INT_CST_NUNITS (xt
); i
++)
1510 if (TREE_INT_CST_ELT (xt
, i
) != TREE_INT_CST_ELT (yt
, i
))
1516 /* Cache wide_int CST into the TYPE_CACHED_VALUES cache for TYPE.
1517 SLOT is the slot entry to store it in, and MAX_SLOTS is the maximum
1518 number of slots that can be cached for the type. */
1521 cache_wide_int_in_type_cache (tree type
, const wide_int
&cst
,
1522 int slot
, int max_slots
)
1524 gcc_checking_assert (slot
>= 0);
1525 /* Initialize cache. */
1526 if (!TYPE_CACHED_VALUES_P (type
))
1528 TYPE_CACHED_VALUES_P (type
) = 1;
1529 TYPE_CACHED_VALUES (type
) = make_tree_vec (max_slots
);
1531 tree t
= TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), slot
);
1534 /* Create a new shared int. */
1535 t
= build_new_int_cst (type
, cst
);
1536 TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), slot
) = t
;
1541 /* Create an INT_CST node of TYPE and value CST.
1542 The returned node is always shared. For small integers we use a
1543 per-type vector cache, for larger ones we use a single hash table.
1544 The value is extended from its precision according to the sign of
1545 the type to be a multiple of HOST_BITS_PER_WIDE_INT. This defines
1546 the upper bits and ensures that hashing and value equality based
1547 upon the underlying HOST_WIDE_INTs works without masking. */
1550 wide_int_to_tree_1 (tree type
, const wide_int_ref
&pcst
)
1557 unsigned int prec
= TYPE_PRECISION (type
);
1558 signop sgn
= TYPE_SIGN (type
);
1560 /* Verify that everything is canonical. */
1561 int l
= pcst
.get_len ();
1564 if (pcst
.elt (l
- 1) == 0)
1565 gcc_checking_assert (pcst
.elt (l
- 2) < 0);
1566 if (pcst
.elt (l
- 1) == HOST_WIDE_INT_M1
)
1567 gcc_checking_assert (pcst
.elt (l
- 2) >= 0);
1570 wide_int cst
= wide_int::from (pcst
, prec
, sgn
);
1571 unsigned int ext_len
= get_int_cst_ext_nunits (type
, cst
);
1573 enum tree_code code
= TREE_CODE (type
);
1574 if (code
== POINTER_TYPE
|| code
== REFERENCE_TYPE
)
1576 /* Cache NULL pointer and zero bounds. */
1579 /* Cache upper bounds of pointers. */
1580 else if (cst
== wi::max_value (prec
, sgn
))
1582 /* Cache 1 which is used for a non-zero range. */
1588 t
= cache_wide_int_in_type_cache (type
, cst
, ix
, 3);
1589 /* Make sure no one is clobbering the shared constant. */
1590 gcc_checking_assert (TREE_TYPE (t
) == type
1591 && cst
== wi::to_wide (t
));
1597 /* We just need to store a single HOST_WIDE_INT. */
1599 if (TYPE_UNSIGNED (type
))
1600 hwi
= cst
.to_uhwi ();
1602 hwi
= cst
.to_shwi ();
1607 gcc_assert (hwi
== 0);
1611 case REFERENCE_TYPE
:
1612 /* Ignore pointers, as they were already handled above. */
1616 /* Cache false or true. */
1618 if (IN_RANGE (hwi
, 0, 1))
1624 if (TYPE_SIGN (type
) == UNSIGNED
)
1627 limit
= param_integer_share_limit
;
1628 if (IN_RANGE (hwi
, 0, param_integer_share_limit
- 1))
1633 /* Cache [-1, N). */
1634 limit
= param_integer_share_limit
+ 1;
1635 if (IN_RANGE (hwi
, -1, param_integer_share_limit
- 1))
1649 t
= cache_wide_int_in_type_cache (type
, cst
, ix
, limit
);
1650 /* Make sure no one is clobbering the shared constant. */
1651 gcc_checking_assert (TREE_TYPE (t
) == type
1652 && TREE_INT_CST_NUNITS (t
) == 1
1653 && TREE_INT_CST_OFFSET_NUNITS (t
) == 1
1654 && TREE_INT_CST_EXT_NUNITS (t
) == 1
1655 && TREE_INT_CST_ELT (t
, 0) == hwi
);
1660 /* Use the cache of larger shared ints, using int_cst_node as
1663 TREE_INT_CST_ELT (int_cst_node
, 0) = hwi
;
1664 TREE_TYPE (int_cst_node
) = type
;
1666 tree
*slot
= int_cst_hash_table
->find_slot (int_cst_node
, INSERT
);
1670 /* Insert this one into the hash table. */
1673 /* Make a new node for next time round. */
1674 int_cst_node
= make_int_cst (1, 1);
1680 /* The value either hashes properly or we drop it on the floor
1681 for the gc to take care of. There will not be enough of them
1684 tree nt
= build_new_int_cst (type
, cst
);
1685 tree
*slot
= int_cst_hash_table
->find_slot (nt
, INSERT
);
1689 /* Insert this one into the hash table. */
1701 poly_int_cst_hasher::hash (tree t
)
1703 inchash::hash hstate
;
1705 hstate
.add_int (TYPE_UID (TREE_TYPE (t
)));
1706 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
1707 hstate
.add_wide_int (wi::to_wide (POLY_INT_CST_COEFF (t
, i
)));
1709 return hstate
.end ();
1713 poly_int_cst_hasher::equal (tree x
, const compare_type
&y
)
1715 if (TREE_TYPE (x
) != y
.first
)
1717 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
1718 if (wi::to_wide (POLY_INT_CST_COEFF (x
, i
)) != y
.second
->coeffs
[i
])
1723 /* Build a POLY_INT_CST node with type TYPE and with the elements in VALUES.
1724 The elements must also have type TYPE. */
1727 build_poly_int_cst (tree type
, const poly_wide_int_ref
&values
)
1729 unsigned int prec
= TYPE_PRECISION (type
);
1730 gcc_assert (prec
<= values
.coeffs
[0].get_precision ());
1731 poly_wide_int c
= poly_wide_int::from (values
, prec
, SIGNED
);
1734 h
.add_int (TYPE_UID (type
));
1735 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
1736 h
.add_wide_int (c
.coeffs
[i
]);
1737 poly_int_cst_hasher::compare_type
comp (type
, &c
);
1738 tree
*slot
= poly_int_cst_hash_table
->find_slot_with_hash (comp
, h
.end (),
1740 if (*slot
== NULL_TREE
)
1742 tree coeffs
[NUM_POLY_INT_COEFFS
];
1743 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
1744 coeffs
[i
] = wide_int_to_tree_1 (type
, c
.coeffs
[i
]);
1745 *slot
= build_new_poly_int_cst (type
, coeffs
);
1750 /* Create a constant tree with value VALUE in type TYPE. */
1753 wide_int_to_tree (tree type
, const poly_wide_int_ref
&value
)
1755 if (value
.is_constant ())
1756 return wide_int_to_tree_1 (type
, value
.coeffs
[0]);
1757 return build_poly_int_cst (type
, value
);
1760 /* Insert INTEGER_CST T into a cache of integer constants. And return
1761 the cached constant (which may or may not be T). If MIGHT_DUPLICATE
1762 is false, and T falls into the type's 'smaller values' range, there
1763 cannot be an existing entry. Otherwise, if MIGHT_DUPLICATE is true,
1764 or the value is large, should an existing entry exist, it is
1765 returned (rather than inserting T). */
1768 cache_integer_cst (tree t
, bool might_duplicate ATTRIBUTE_UNUSED
)
1770 tree type
= TREE_TYPE (t
);
1773 int prec
= TYPE_PRECISION (type
);
1775 gcc_assert (!TREE_OVERFLOW (t
));
1777 /* The caching indices here must match those in
1778 wide_int_to_type_1. */
1779 switch (TREE_CODE (type
))
1782 gcc_checking_assert (integer_zerop (t
));
1786 case REFERENCE_TYPE
:
1788 if (integer_zerop (t
))
1790 else if (integer_onep (t
))
1799 /* Cache false or true. */
1801 if (wi::ltu_p (wi::to_wide (t
), 2))
1802 ix
= TREE_INT_CST_ELT (t
, 0);
1807 if (TYPE_UNSIGNED (type
))
1810 limit
= param_integer_share_limit
;
1812 /* This is a little hokie, but if the prec is smaller than
1813 what is necessary to hold param_integer_share_limit, then the
1814 obvious test will not get the correct answer. */
1815 if (prec
< HOST_BITS_PER_WIDE_INT
)
1817 if (tree_to_uhwi (t
)
1818 < (unsigned HOST_WIDE_INT
) param_integer_share_limit
)
1819 ix
= tree_to_uhwi (t
);
1821 else if (wi::ltu_p (wi::to_wide (t
), param_integer_share_limit
))
1822 ix
= tree_to_uhwi (t
);
1827 limit
= param_integer_share_limit
+ 1;
1829 if (integer_minus_onep (t
))
1831 else if (!wi::neg_p (wi::to_wide (t
)))
1833 if (prec
< HOST_BITS_PER_WIDE_INT
)
1835 if (tree_to_shwi (t
) < param_integer_share_limit
)
1836 ix
= tree_to_shwi (t
) + 1;
1838 else if (wi::ltu_p (wi::to_wide (t
), param_integer_share_limit
))
1839 ix
= tree_to_shwi (t
) + 1;
1845 /* The slot used by TYPE_CACHED_VALUES is used for the enum
1855 /* Look for it in the type's vector of small shared ints. */
1856 if (!TYPE_CACHED_VALUES_P (type
))
1858 TYPE_CACHED_VALUES_P (type
) = 1;
1859 TYPE_CACHED_VALUES (type
) = make_tree_vec (limit
);
1862 if (tree r
= TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
))
1864 gcc_checking_assert (might_duplicate
);
1868 TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) = t
;
1872 /* Use the cache of larger shared ints. */
1873 tree
*slot
= int_cst_hash_table
->find_slot (t
, INSERT
);
1876 /* If there is already an entry for the number verify it's the
1878 gcc_checking_assert (wi::to_wide (tree (r
)) == wi::to_wide (t
));
1879 /* And return the cached value. */
1883 /* Otherwise insert this one into the hash table. */
1891 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
1892 and the rest are zeros. */
1895 build_low_bits_mask (tree type
, unsigned bits
)
1897 gcc_assert (bits
<= TYPE_PRECISION (type
));
1899 return wide_int_to_tree (type
, wi::mask (bits
, false,
1900 TYPE_PRECISION (type
)));
1903 /* Checks that X is integer constant that can be expressed in (unsigned)
1904 HOST_WIDE_INT without loss of precision. */
1907 cst_and_fits_in_hwi (const_tree x
)
1909 return (TREE_CODE (x
) == INTEGER_CST
1910 && (tree_fits_shwi_p (x
) || tree_fits_uhwi_p (x
)));
1913 /* Build a newly constructed VECTOR_CST with the given values of
1914 (VECTOR_CST_)LOG2_NPATTERNS and (VECTOR_CST_)NELTS_PER_PATTERN. */
1917 make_vector (unsigned log2_npatterns
,
1918 unsigned int nelts_per_pattern MEM_STAT_DECL
)
1920 gcc_assert (IN_RANGE (nelts_per_pattern
, 1, 3));
1922 unsigned npatterns
= 1 << log2_npatterns
;
1923 unsigned encoded_nelts
= npatterns
* nelts_per_pattern
;
1924 unsigned length
= (sizeof (struct tree_vector
)
1925 + (encoded_nelts
- 1) * sizeof (tree
));
1927 record_node_allocation_statistics (VECTOR_CST
, length
);
1929 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
1931 TREE_SET_CODE (t
, VECTOR_CST
);
1932 TREE_CONSTANT (t
) = 1;
1933 VECTOR_CST_LOG2_NPATTERNS (t
) = log2_npatterns
;
1934 VECTOR_CST_NELTS_PER_PATTERN (t
) = nelts_per_pattern
;
1939 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1940 are extracted from V, a vector of CONSTRUCTOR_ELT. */
1943 build_vector_from_ctor (tree type
, vec
<constructor_elt
, va_gc
> *v
)
1945 if (vec_safe_length (v
) == 0)
1946 return build_zero_cst (type
);
1948 unsigned HOST_WIDE_INT idx
, nelts
;
1951 /* We can't construct a VECTOR_CST for a variable number of elements. */
1952 nelts
= TYPE_VECTOR_SUBPARTS (type
).to_constant ();
1953 tree_vector_builder
vec (type
, nelts
, 1);
1954 FOR_EACH_CONSTRUCTOR_VALUE (v
, idx
, value
)
1956 if (TREE_CODE (value
) == VECTOR_CST
)
1958 /* If NELTS is constant then this must be too. */
1959 unsigned int sub_nelts
= VECTOR_CST_NELTS (value
).to_constant ();
1960 for (unsigned i
= 0; i
< sub_nelts
; ++i
)
1961 vec
.quick_push (VECTOR_CST_ELT (value
, i
));
1964 vec
.quick_push (value
);
1966 while (vec
.length () < nelts
)
1967 vec
.quick_push (build_zero_cst (TREE_TYPE (type
)));
1969 return vec
.build ();
1972 /* Build a vector of type VECTYPE where all the elements are SCs. */
1974 build_vector_from_val (tree vectype
, tree sc
)
1976 unsigned HOST_WIDE_INT i
, nunits
;
1978 if (sc
== error_mark_node
)
1981 /* Verify that the vector type is suitable for SC. Note that there
1982 is some inconsistency in the type-system with respect to restrict
1983 qualifications of pointers. Vector types always have a main-variant
1984 element type and the qualification is applied to the vector-type.
1985 So TREE_TYPE (vector-type) does not return a properly qualified
1986 vector element-type. */
1987 gcc_checking_assert (types_compatible_p (TYPE_MAIN_VARIANT (TREE_TYPE (sc
)),
1988 TREE_TYPE (vectype
)));
1990 if (CONSTANT_CLASS_P (sc
))
1992 tree_vector_builder
v (vectype
, 1, 1);
1996 else if (!TYPE_VECTOR_SUBPARTS (vectype
).is_constant (&nunits
))
1997 return fold_build1 (VEC_DUPLICATE_EXPR
, vectype
, sc
);
2000 vec
<constructor_elt
, va_gc
> *v
;
2001 vec_alloc (v
, nunits
);
2002 for (i
= 0; i
< nunits
; ++i
)
2003 CONSTRUCTOR_APPEND_ELT (v
, NULL_TREE
, sc
);
2004 return build_constructor (vectype
, v
);
2008 /* If TYPE is not a vector type, just return SC, otherwise return
2009 build_vector_from_val (TYPE, SC). */
2012 build_uniform_cst (tree type
, tree sc
)
2014 if (!VECTOR_TYPE_P (type
))
2017 return build_vector_from_val (type
, sc
);
2020 /* Build a vector series of type TYPE in which element I has the value
2021 BASE + I * STEP. The result is a constant if BASE and STEP are constant
2022 and a VEC_SERIES_EXPR otherwise. */
2025 build_vec_series (tree type
, tree base
, tree step
)
2027 if (integer_zerop (step
))
2028 return build_vector_from_val (type
, base
);
2029 if (TREE_CODE (base
) == INTEGER_CST
&& TREE_CODE (step
) == INTEGER_CST
)
2031 tree_vector_builder
builder (type
, 1, 3);
2032 tree elt1
= wide_int_to_tree (TREE_TYPE (base
),
2033 wi::to_wide (base
) + wi::to_wide (step
));
2034 tree elt2
= wide_int_to_tree (TREE_TYPE (base
),
2035 wi::to_wide (elt1
) + wi::to_wide (step
));
2036 builder
.quick_push (base
);
2037 builder
.quick_push (elt1
);
2038 builder
.quick_push (elt2
);
2039 return builder
.build ();
2041 return build2 (VEC_SERIES_EXPR
, type
, base
, step
);
2044 /* Return a vector with the same number of units and number of bits
2045 as VEC_TYPE, but in which the elements are a linear series of unsigned
2046 integers { BASE, BASE + STEP, BASE + STEP * 2, ... }. */
2049 build_index_vector (tree vec_type
, poly_uint64 base
, poly_uint64 step
)
2051 tree index_vec_type
= vec_type
;
2052 tree index_elt_type
= TREE_TYPE (vec_type
);
2053 poly_uint64 nunits
= TYPE_VECTOR_SUBPARTS (vec_type
);
2054 if (!INTEGRAL_TYPE_P (index_elt_type
) || !TYPE_UNSIGNED (index_elt_type
))
2056 index_elt_type
= build_nonstandard_integer_type
2057 (GET_MODE_BITSIZE (SCALAR_TYPE_MODE (index_elt_type
)), true);
2058 index_vec_type
= build_vector_type (index_elt_type
, nunits
);
2061 tree_vector_builder
v (index_vec_type
, 1, 3);
2062 for (unsigned int i
= 0; i
< 3; ++i
)
2063 v
.quick_push (build_int_cstu (index_elt_type
, base
+ i
* step
));
2067 /* Return a VECTOR_CST of type VEC_TYPE in which the first NUM_A
2068 elements are A and the rest are B. */
2071 build_vector_a_then_b (tree vec_type
, unsigned int num_a
, tree a
, tree b
)
2073 gcc_assert (known_le (num_a
, TYPE_VECTOR_SUBPARTS (vec_type
)));
2074 unsigned int count
= constant_lower_bound (TYPE_VECTOR_SUBPARTS (vec_type
));
2075 /* Optimize the constant case. */
2076 if ((count
& 1) == 0 && TYPE_VECTOR_SUBPARTS (vec_type
).is_constant ())
2078 tree_vector_builder
builder (vec_type
, count
, 2);
2079 for (unsigned int i
= 0; i
< count
* 2; ++i
)
2080 builder
.quick_push (i
< num_a
? a
: b
);
2081 return builder
.build ();
2084 /* Something has messed with the elements of CONSTRUCTOR C after it was built;
2085 calculate TREE_CONSTANT and TREE_SIDE_EFFECTS. */
2088 recompute_constructor_flags (tree c
)
2092 bool constant_p
= true;
2093 bool side_effects_p
= false;
2094 vec
<constructor_elt
, va_gc
> *vals
= CONSTRUCTOR_ELTS (c
);
2096 FOR_EACH_CONSTRUCTOR_VALUE (vals
, i
, val
)
2098 /* Mostly ctors will have elts that don't have side-effects, so
2099 the usual case is to scan all the elements. Hence a single
2100 loop for both const and side effects, rather than one loop
2101 each (with early outs). */
2102 if (!TREE_CONSTANT (val
))
2104 if (TREE_SIDE_EFFECTS (val
))
2105 side_effects_p
= true;
2108 TREE_SIDE_EFFECTS (c
) = side_effects_p
;
2109 TREE_CONSTANT (c
) = constant_p
;
2112 /* Make sure that TREE_CONSTANT and TREE_SIDE_EFFECTS are correct for
2116 verify_constructor_flags (tree c
)
2120 bool constant_p
= TREE_CONSTANT (c
);
2121 bool side_effects_p
= TREE_SIDE_EFFECTS (c
);
2122 vec
<constructor_elt
, va_gc
> *vals
= CONSTRUCTOR_ELTS (c
);
2124 FOR_EACH_CONSTRUCTOR_VALUE (vals
, i
, val
)
2126 if (constant_p
&& !TREE_CONSTANT (val
))
2127 internal_error ("non-constant element in constant CONSTRUCTOR");
2128 if (!side_effects_p
&& TREE_SIDE_EFFECTS (val
))
2129 internal_error ("side-effects element in no-side-effects CONSTRUCTOR");
2133 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
2134 are in the vec pointed to by VALS. */
2136 build_constructor (tree type
, vec
<constructor_elt
, va_gc
> *vals MEM_STAT_DECL
)
2138 tree c
= make_node (CONSTRUCTOR PASS_MEM_STAT
);
2140 TREE_TYPE (c
) = type
;
2141 CONSTRUCTOR_ELTS (c
) = vals
;
2143 recompute_constructor_flags (c
);
2148 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
2151 build_constructor_single (tree type
, tree index
, tree value
)
2153 vec
<constructor_elt
, va_gc
> *v
;
2154 constructor_elt elt
= {index
, value
};
2157 v
->quick_push (elt
);
2159 return build_constructor (type
, v
);
2163 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
2164 are in a list pointed to by VALS. */
2166 build_constructor_from_list (tree type
, tree vals
)
2169 vec
<constructor_elt
, va_gc
> *v
= NULL
;
2173 vec_alloc (v
, list_length (vals
));
2174 for (t
= vals
; t
; t
= TREE_CHAIN (t
))
2175 CONSTRUCTOR_APPEND_ELT (v
, TREE_PURPOSE (t
), TREE_VALUE (t
));
2178 return build_constructor (type
, v
);
2181 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
2182 are in a vector pointed to by VALS. Note that the TREE_PURPOSE
2183 fields in the constructor remain null. */
2186 build_constructor_from_vec (tree type
, const vec
<tree
, va_gc
> *vals
)
2188 vec
<constructor_elt
, va_gc
> *v
= NULL
;
2191 CONSTRUCTOR_APPEND_ELT (v
, NULL_TREE
, t
);
2193 return build_constructor (type
, v
);
2196 /* Return a new CONSTRUCTOR node whose type is TYPE. NELTS is the number
2197 of elements, provided as index/value pairs. */
2200 build_constructor_va (tree type
, int nelts
, ...)
2202 vec
<constructor_elt
, va_gc
> *v
= NULL
;
2205 va_start (p
, nelts
);
2206 vec_alloc (v
, nelts
);
2209 tree index
= va_arg (p
, tree
);
2210 tree value
= va_arg (p
, tree
);
2211 CONSTRUCTOR_APPEND_ELT (v
, index
, value
);
2214 return build_constructor (type
, v
);
2217 /* Return a node of type TYPE for which TREE_CLOBBER_P is true. */
2220 build_clobber (tree type
)
2222 tree clobber
= build_constructor (type
, NULL
);
2223 TREE_THIS_VOLATILE (clobber
) = true;
2227 /* Return a new FIXED_CST node whose type is TYPE and value is F. */
2230 build_fixed (tree type
, FIXED_VALUE_TYPE f
)
2233 FIXED_VALUE_TYPE
*fp
;
2235 v
= make_node (FIXED_CST
);
2236 fp
= ggc_alloc
<fixed_value
> ();
2237 memcpy (fp
, &f
, sizeof (FIXED_VALUE_TYPE
));
2239 TREE_TYPE (v
) = type
;
2240 TREE_FIXED_CST_PTR (v
) = fp
;
2244 /* Return a new REAL_CST node whose type is TYPE and value is D. */
2247 build_real (tree type
, REAL_VALUE_TYPE d
)
2250 REAL_VALUE_TYPE
*dp
;
2253 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
2254 Consider doing it via real_convert now. */
2256 v
= make_node (REAL_CST
);
2257 dp
= ggc_alloc
<real_value
> ();
2258 memcpy (dp
, &d
, sizeof (REAL_VALUE_TYPE
));
2260 TREE_TYPE (v
) = type
;
2261 TREE_REAL_CST_PTR (v
) = dp
;
2262 TREE_OVERFLOW (v
) = overflow
;
2266 /* Like build_real, but first truncate D to the type. */
2269 build_real_truncate (tree type
, REAL_VALUE_TYPE d
)
2271 return build_real (type
, real_value_truncate (TYPE_MODE (type
), d
));
2274 /* Return a new REAL_CST node whose type is TYPE
2275 and whose value is the integer value of the INTEGER_CST node I. */
2278 real_value_from_int_cst (const_tree type
, const_tree i
)
2282 /* Clear all bits of the real value type so that we can later do
2283 bitwise comparisons to see if two values are the same. */
2284 memset (&d
, 0, sizeof d
);
2286 real_from_integer (&d
, type
? TYPE_MODE (type
) : VOIDmode
, wi::to_wide (i
),
2287 TYPE_SIGN (TREE_TYPE (i
)));
2291 /* Given a tree representing an integer constant I, return a tree
2292 representing the same value as a floating-point constant of type TYPE. */
2295 build_real_from_int_cst (tree type
, const_tree i
)
2298 int overflow
= TREE_OVERFLOW (i
);
2300 v
= build_real (type
, real_value_from_int_cst (type
, i
));
2302 TREE_OVERFLOW (v
) |= overflow
;
2306 /* Return a new REAL_CST node whose type is TYPE
2307 and whose value is the integer value I which has sign SGN. */
2310 build_real_from_wide (tree type
, const wide_int_ref
&i
, signop sgn
)
2314 /* Clear all bits of the real value type so that we can later do
2315 bitwise comparisons to see if two values are the same. */
2316 memset (&d
, 0, sizeof d
);
2318 real_from_integer (&d
, TYPE_MODE (type
), i
, sgn
);
2319 return build_real (type
, d
);
2322 /* Return a newly constructed STRING_CST node whose value is the LEN
2323 characters at STR when STR is nonnull, or all zeros otherwise.
2324 Note that for a C string literal, LEN should include the trailing NUL.
2325 The TREE_TYPE is not initialized. */
2328 build_string (unsigned len
, const char *str
/*= NULL */)
2330 /* Do not waste bytes provided by padding of struct tree_string. */
2331 unsigned size
= len
+ offsetof (struct tree_string
, str
) + 1;
2333 record_node_allocation_statistics (STRING_CST
, size
);
2335 tree s
= (tree
) ggc_internal_alloc (size
);
2337 memset (s
, 0, sizeof (struct tree_typed
));
2338 TREE_SET_CODE (s
, STRING_CST
);
2339 TREE_CONSTANT (s
) = 1;
2340 TREE_STRING_LENGTH (s
) = len
;
2342 memcpy (s
->string
.str
, str
, len
);
2344 memset (s
->string
.str
, 0, len
);
2345 s
->string
.str
[len
] = '\0';
2350 /* Return a newly constructed COMPLEX_CST node whose value is
2351 specified by the real and imaginary parts REAL and IMAG.
2352 Both REAL and IMAG should be constant nodes. TYPE, if specified,
2353 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
2356 build_complex (tree type
, tree real
, tree imag
)
2358 gcc_assert (CONSTANT_CLASS_P (real
));
2359 gcc_assert (CONSTANT_CLASS_P (imag
));
2361 tree t
= make_node (COMPLEX_CST
);
2363 TREE_REALPART (t
) = real
;
2364 TREE_IMAGPART (t
) = imag
;
2365 TREE_TYPE (t
) = type
? type
: build_complex_type (TREE_TYPE (real
));
2366 TREE_OVERFLOW (t
) = TREE_OVERFLOW (real
) | TREE_OVERFLOW (imag
);
2370 /* Build a complex (inf +- 0i), such as for the result of cproj.
2371 TYPE is the complex tree type of the result. If NEG is true, the
2372 imaginary zero is negative. */
2375 build_complex_inf (tree type
, bool neg
)
2377 REAL_VALUE_TYPE rinf
, rzero
= dconst0
;
2381 return build_complex (type
, build_real (TREE_TYPE (type
), rinf
),
2382 build_real (TREE_TYPE (type
), rzero
));
2385 /* Return the constant 1 in type TYPE. If TYPE has several elements, each
2386 element is set to 1. In particular, this is 1 + i for complex types. */
2389 build_each_one_cst (tree type
)
2391 if (TREE_CODE (type
) == COMPLEX_TYPE
)
2393 tree scalar
= build_one_cst (TREE_TYPE (type
));
2394 return build_complex (type
, scalar
, scalar
);
2397 return build_one_cst (type
);
2400 /* Return a constant of arithmetic type TYPE which is the
2401 multiplicative identity of the set TYPE. */
2404 build_one_cst (tree type
)
2406 switch (TREE_CODE (type
))
2408 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
2409 case POINTER_TYPE
: case REFERENCE_TYPE
:
2411 return build_int_cst (type
, 1);
2414 return build_real (type
, dconst1
);
2416 case FIXED_POINT_TYPE
:
2417 /* We can only generate 1 for accum types. */
2418 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type
)));
2419 return build_fixed (type
, FCONST1 (TYPE_MODE (type
)));
2423 tree scalar
= build_one_cst (TREE_TYPE (type
));
2425 return build_vector_from_val (type
, scalar
);
2429 return build_complex (type
,
2430 build_one_cst (TREE_TYPE (type
)),
2431 build_zero_cst (TREE_TYPE (type
)));
2438 /* Return an integer of type TYPE containing all 1's in as much precision as
2439 it contains, or a complex or vector whose subparts are such integers. */
2442 build_all_ones_cst (tree type
)
2444 if (TREE_CODE (type
) == COMPLEX_TYPE
)
2446 tree scalar
= build_all_ones_cst (TREE_TYPE (type
));
2447 return build_complex (type
, scalar
, scalar
);
2450 return build_minus_one_cst (type
);
2453 /* Return a constant of arithmetic type TYPE which is the
2454 opposite of the multiplicative identity of the set TYPE. */
2457 build_minus_one_cst (tree type
)
2459 switch (TREE_CODE (type
))
2461 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
2462 case POINTER_TYPE
: case REFERENCE_TYPE
:
2464 return build_int_cst (type
, -1);
2467 return build_real (type
, dconstm1
);
2469 case FIXED_POINT_TYPE
:
2470 /* We can only generate 1 for accum types. */
2471 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type
)));
2472 return build_fixed (type
,
2473 fixed_from_double_int (double_int_minus_one
,
2474 SCALAR_TYPE_MODE (type
)));
2478 tree scalar
= build_minus_one_cst (TREE_TYPE (type
));
2480 return build_vector_from_val (type
, scalar
);
2484 return build_complex (type
,
2485 build_minus_one_cst (TREE_TYPE (type
)),
2486 build_zero_cst (TREE_TYPE (type
)));
2493 /* Build 0 constant of type TYPE. This is used by constructor folding
2494 and thus the constant should be represented in memory by
2498 build_zero_cst (tree type
)
2500 switch (TREE_CODE (type
))
2502 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
2503 case POINTER_TYPE
: case REFERENCE_TYPE
:
2504 case OFFSET_TYPE
: case NULLPTR_TYPE
:
2505 return build_int_cst (type
, 0);
2508 return build_real (type
, dconst0
);
2510 case FIXED_POINT_TYPE
:
2511 return build_fixed (type
, FCONST0 (TYPE_MODE (type
)));
2515 tree scalar
= build_zero_cst (TREE_TYPE (type
));
2517 return build_vector_from_val (type
, scalar
);
2522 tree zero
= build_zero_cst (TREE_TYPE (type
));
2524 return build_complex (type
, zero
, zero
);
2528 if (!AGGREGATE_TYPE_P (type
))
2529 return fold_convert (type
, integer_zero_node
);
2530 return build_constructor (type
, NULL
);
2535 /* Build a BINFO with LEN language slots. */
2538 make_tree_binfo (unsigned base_binfos MEM_STAT_DECL
)
2541 size_t length
= (offsetof (struct tree_binfo
, base_binfos
)
2542 + vec
<tree
, va_gc
>::embedded_size (base_binfos
));
2544 record_node_allocation_statistics (TREE_BINFO
, length
);
2546 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
2548 memset (t
, 0, offsetof (struct tree_binfo
, base_binfos
));
2550 TREE_SET_CODE (t
, TREE_BINFO
);
2552 BINFO_BASE_BINFOS (t
)->embedded_init (base_binfos
);
2557 /* Create a CASE_LABEL_EXPR tree node and return it. */
2560 build_case_label (tree low_value
, tree high_value
, tree label_decl
)
2562 tree t
= make_node (CASE_LABEL_EXPR
);
2564 TREE_TYPE (t
) = void_type_node
;
2565 SET_EXPR_LOCATION (t
, DECL_SOURCE_LOCATION (label_decl
));
2567 CASE_LOW (t
) = low_value
;
2568 CASE_HIGH (t
) = high_value
;
2569 CASE_LABEL (t
) = label_decl
;
2570 CASE_CHAIN (t
) = NULL_TREE
;
2575 /* Build a newly constructed INTEGER_CST node. LEN and EXT_LEN are the
2576 values of TREE_INT_CST_NUNITS and TREE_INT_CST_EXT_NUNITS respectively.
2577 The latter determines the length of the HOST_WIDE_INT vector. */
2580 make_int_cst (int len
, int ext_len MEM_STAT_DECL
)
2583 int length
= ((ext_len
- 1) * sizeof (HOST_WIDE_INT
)
2584 + sizeof (struct tree_int_cst
));
2587 record_node_allocation_statistics (INTEGER_CST
, length
);
2589 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
2591 TREE_SET_CODE (t
, INTEGER_CST
);
2592 TREE_INT_CST_NUNITS (t
) = len
;
2593 TREE_INT_CST_EXT_NUNITS (t
) = ext_len
;
2594 /* to_offset can only be applied to trees that are offset_int-sized
2595 or smaller. EXT_LEN is correct if it fits, otherwise the constant
2596 must be exactly the precision of offset_int and so LEN is correct. */
2597 if (ext_len
<= OFFSET_INT_ELTS
)
2598 TREE_INT_CST_OFFSET_NUNITS (t
) = ext_len
;
2600 TREE_INT_CST_OFFSET_NUNITS (t
) = len
;
2602 TREE_CONSTANT (t
) = 1;
2607 /* Build a newly constructed TREE_VEC node of length LEN. */
2610 make_tree_vec (int len MEM_STAT_DECL
)
2613 size_t length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
2615 record_node_allocation_statistics (TREE_VEC
, length
);
2617 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
2619 TREE_SET_CODE (t
, TREE_VEC
);
2620 TREE_VEC_LENGTH (t
) = len
;
2625 /* Grow a TREE_VEC node to new length LEN. */
2628 grow_tree_vec (tree v
, int len MEM_STAT_DECL
)
2630 gcc_assert (TREE_CODE (v
) == TREE_VEC
);
2632 int oldlen
= TREE_VEC_LENGTH (v
);
2633 gcc_assert (len
> oldlen
);
2635 size_t oldlength
= (oldlen
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
2636 size_t length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
2638 record_node_allocation_statistics (TREE_VEC
, length
- oldlength
);
2640 v
= (tree
) ggc_realloc (v
, length PASS_MEM_STAT
);
2642 TREE_VEC_LENGTH (v
) = len
;
2647 /* Return 1 if EXPR is the constant zero, whether it is integral, float or
2648 fixed, and scalar, complex or vector. */
2651 zerop (const_tree expr
)
2653 return (integer_zerop (expr
)
2654 || real_zerop (expr
)
2655 || fixed_zerop (expr
));
2658 /* Return 1 if EXPR is the integer constant zero or a complex constant
2659 of zero, or a location wrapper for such a constant. */
2662 integer_zerop (const_tree expr
)
2664 STRIP_ANY_LOCATION_WRAPPER (expr
);
2666 switch (TREE_CODE (expr
))
2669 return wi::to_wide (expr
) == 0;
2671 return (integer_zerop (TREE_REALPART (expr
))
2672 && integer_zerop (TREE_IMAGPART (expr
)));
2674 return (VECTOR_CST_NPATTERNS (expr
) == 1
2675 && VECTOR_CST_DUPLICATE_P (expr
)
2676 && integer_zerop (VECTOR_CST_ENCODED_ELT (expr
, 0)));
2682 /* Return 1 if EXPR is the integer constant one or the corresponding
2683 complex constant, or a location wrapper for such a constant. */
2686 integer_onep (const_tree expr
)
2688 STRIP_ANY_LOCATION_WRAPPER (expr
);
2690 switch (TREE_CODE (expr
))
2693 return wi::eq_p (wi::to_widest (expr
), 1);
2695 return (integer_onep (TREE_REALPART (expr
))
2696 && integer_zerop (TREE_IMAGPART (expr
)));
2698 return (VECTOR_CST_NPATTERNS (expr
) == 1
2699 && VECTOR_CST_DUPLICATE_P (expr
)
2700 && integer_onep (VECTOR_CST_ENCODED_ELT (expr
, 0)));
2706 /* Return 1 if EXPR is the integer constant one. For complex and vector,
2707 return 1 if every piece is the integer constant one.
2708 Also return 1 for location wrappers for such a constant. */
2711 integer_each_onep (const_tree expr
)
2713 STRIP_ANY_LOCATION_WRAPPER (expr
);
2715 if (TREE_CODE (expr
) == COMPLEX_CST
)
2716 return (integer_onep (TREE_REALPART (expr
))
2717 && integer_onep (TREE_IMAGPART (expr
)));
2719 return integer_onep (expr
);
2722 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
2723 it contains, or a complex or vector whose subparts are such integers,
2724 or a location wrapper for such a constant. */
2727 integer_all_onesp (const_tree expr
)
2729 STRIP_ANY_LOCATION_WRAPPER (expr
);
2731 if (TREE_CODE (expr
) == COMPLEX_CST
2732 && integer_all_onesp (TREE_REALPART (expr
))
2733 && integer_all_onesp (TREE_IMAGPART (expr
)))
2736 else if (TREE_CODE (expr
) == VECTOR_CST
)
2737 return (VECTOR_CST_NPATTERNS (expr
) == 1
2738 && VECTOR_CST_DUPLICATE_P (expr
)
2739 && integer_all_onesp (VECTOR_CST_ENCODED_ELT (expr
, 0)));
2741 else if (TREE_CODE (expr
) != INTEGER_CST
)
2744 return (wi::max_value (TYPE_PRECISION (TREE_TYPE (expr
)), UNSIGNED
)
2745 == wi::to_wide (expr
));
2748 /* Return 1 if EXPR is the integer constant minus one, or a location wrapper
2749 for such a constant. */
2752 integer_minus_onep (const_tree expr
)
2754 STRIP_ANY_LOCATION_WRAPPER (expr
);
2756 if (TREE_CODE (expr
) == COMPLEX_CST
)
2757 return (integer_all_onesp (TREE_REALPART (expr
))
2758 && integer_zerop (TREE_IMAGPART (expr
)));
2760 return integer_all_onesp (expr
);
2763 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
2764 one bit on), or a location wrapper for such a constant. */
2767 integer_pow2p (const_tree expr
)
2769 STRIP_ANY_LOCATION_WRAPPER (expr
);
2771 if (TREE_CODE (expr
) == COMPLEX_CST
2772 && integer_pow2p (TREE_REALPART (expr
))
2773 && integer_zerop (TREE_IMAGPART (expr
)))
2776 if (TREE_CODE (expr
) != INTEGER_CST
)
2779 return wi::popcount (wi::to_wide (expr
)) == 1;
2782 /* Return 1 if EXPR is an integer constant other than zero or a
2783 complex constant other than zero, or a location wrapper for such a
2787 integer_nonzerop (const_tree expr
)
2789 STRIP_ANY_LOCATION_WRAPPER (expr
);
2791 return ((TREE_CODE (expr
) == INTEGER_CST
2792 && wi::to_wide (expr
) != 0)
2793 || (TREE_CODE (expr
) == COMPLEX_CST
2794 && (integer_nonzerop (TREE_REALPART (expr
))
2795 || integer_nonzerop (TREE_IMAGPART (expr
)))));
2798 /* Return 1 if EXPR is the integer constant one. For vector,
2799 return 1 if every piece is the integer constant minus one
2800 (representing the value TRUE).
2801 Also return 1 for location wrappers for such a constant. */
2804 integer_truep (const_tree expr
)
2806 STRIP_ANY_LOCATION_WRAPPER (expr
);
2808 if (TREE_CODE (expr
) == VECTOR_CST
)
2809 return integer_all_onesp (expr
);
2810 return integer_onep (expr
);
2813 /* Return 1 if EXPR is the fixed-point constant zero, or a location wrapper
2814 for such a constant. */
2817 fixed_zerop (const_tree expr
)
2819 STRIP_ANY_LOCATION_WRAPPER (expr
);
2821 return (TREE_CODE (expr
) == FIXED_CST
2822 && TREE_FIXED_CST (expr
).data
.is_zero ());
2825 /* Return the power of two represented by a tree node known to be a
2829 tree_log2 (const_tree expr
)
2831 if (TREE_CODE (expr
) == COMPLEX_CST
)
2832 return tree_log2 (TREE_REALPART (expr
));
2834 return wi::exact_log2 (wi::to_wide (expr
));
2837 /* Similar, but return the largest integer Y such that 2 ** Y is less
2838 than or equal to EXPR. */
2841 tree_floor_log2 (const_tree expr
)
2843 if (TREE_CODE (expr
) == COMPLEX_CST
)
2844 return tree_log2 (TREE_REALPART (expr
));
2846 return wi::floor_log2 (wi::to_wide (expr
));
2849 /* Return number of known trailing zero bits in EXPR, or, if the value of
2850 EXPR is known to be zero, the precision of it's type. */
2853 tree_ctz (const_tree expr
)
2855 if (!INTEGRAL_TYPE_P (TREE_TYPE (expr
))
2856 && !POINTER_TYPE_P (TREE_TYPE (expr
)))
2859 unsigned int ret1
, ret2
, prec
= TYPE_PRECISION (TREE_TYPE (expr
));
2860 switch (TREE_CODE (expr
))
2863 ret1
= wi::ctz (wi::to_wide (expr
));
2864 return MIN (ret1
, prec
);
2866 ret1
= wi::ctz (get_nonzero_bits (expr
));
2867 return MIN (ret1
, prec
);
2874 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2877 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2878 return MIN (ret1
, ret2
);
2879 case POINTER_PLUS_EXPR
:
2880 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2881 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2882 /* Second operand is sizetype, which could be in theory
2883 wider than pointer's precision. Make sure we never
2884 return more than prec. */
2885 ret2
= MIN (ret2
, prec
);
2886 return MIN (ret1
, ret2
);
2888 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2889 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2890 return MAX (ret1
, ret2
);
2892 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2893 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2894 return MIN (ret1
+ ret2
, prec
);
2896 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2897 if (tree_fits_uhwi_p (TREE_OPERAND (expr
, 1))
2898 && (tree_to_uhwi (TREE_OPERAND (expr
, 1)) < prec
))
2900 ret2
= tree_to_uhwi (TREE_OPERAND (expr
, 1));
2901 return MIN (ret1
+ ret2
, prec
);
2905 if (tree_fits_uhwi_p (TREE_OPERAND (expr
, 1))
2906 && (tree_to_uhwi (TREE_OPERAND (expr
, 1)) < prec
))
2908 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2909 ret2
= tree_to_uhwi (TREE_OPERAND (expr
, 1));
2914 case TRUNC_DIV_EXPR
:
2916 case FLOOR_DIV_EXPR
:
2917 case ROUND_DIV_EXPR
:
2918 case EXACT_DIV_EXPR
:
2919 if (TREE_CODE (TREE_OPERAND (expr
, 1)) == INTEGER_CST
2920 && tree_int_cst_sgn (TREE_OPERAND (expr
, 1)) == 1)
2922 int l
= tree_log2 (TREE_OPERAND (expr
, 1));
2925 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2933 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2934 if (ret1
&& ret1
== TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (expr
, 0))))
2936 return MIN (ret1
, prec
);
2938 return tree_ctz (TREE_OPERAND (expr
, 0));
2940 ret1
= tree_ctz (TREE_OPERAND (expr
, 1));
2943 ret2
= tree_ctz (TREE_OPERAND (expr
, 2));
2944 return MIN (ret1
, ret2
);
2946 return tree_ctz (TREE_OPERAND (expr
, 1));
2948 ret1
= get_pointer_alignment (CONST_CAST_TREE (expr
));
2949 if (ret1
> BITS_PER_UNIT
)
2951 ret1
= ctz_hwi (ret1
/ BITS_PER_UNIT
);
2952 return MIN (ret1
, prec
);
2960 /* Return 1 if EXPR is the real constant zero. Trailing zeroes matter for
2961 decimal float constants, so don't return 1 for them.
2962 Also return 1 for location wrappers around such a constant. */
2965 real_zerop (const_tree expr
)
2967 STRIP_ANY_LOCATION_WRAPPER (expr
);
2969 switch (TREE_CODE (expr
))
2972 return real_equal (&TREE_REAL_CST (expr
), &dconst0
)
2973 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2975 return real_zerop (TREE_REALPART (expr
))
2976 && real_zerop (TREE_IMAGPART (expr
));
2979 /* Don't simply check for a duplicate because the predicate
2980 accepts both +0.0 and -0.0. */
2981 unsigned count
= vector_cst_encoded_nelts (expr
);
2982 for (unsigned int i
= 0; i
< count
; ++i
)
2983 if (!real_zerop (VECTOR_CST_ENCODED_ELT (expr
, i
)))
2992 /* Return 1 if EXPR is the real constant one in real or complex form.
2993 Trailing zeroes matter for decimal float constants, so don't return
2995 Also return 1 for location wrappers around such a constant. */
2998 real_onep (const_tree expr
)
3000 STRIP_ANY_LOCATION_WRAPPER (expr
);
3002 switch (TREE_CODE (expr
))
3005 return real_equal (&TREE_REAL_CST (expr
), &dconst1
)
3006 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
3008 return real_onep (TREE_REALPART (expr
))
3009 && real_zerop (TREE_IMAGPART (expr
));
3011 return (VECTOR_CST_NPATTERNS (expr
) == 1
3012 && VECTOR_CST_DUPLICATE_P (expr
)
3013 && real_onep (VECTOR_CST_ENCODED_ELT (expr
, 0)));
3019 /* Return 1 if EXPR is the real constant minus one. Trailing zeroes
3020 matter for decimal float constants, so don't return 1 for them.
3021 Also return 1 for location wrappers around such a constant. */
3024 real_minus_onep (const_tree expr
)
3026 STRIP_ANY_LOCATION_WRAPPER (expr
);
3028 switch (TREE_CODE (expr
))
3031 return real_equal (&TREE_REAL_CST (expr
), &dconstm1
)
3032 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
3034 return real_minus_onep (TREE_REALPART (expr
))
3035 && real_zerop (TREE_IMAGPART (expr
));
3037 return (VECTOR_CST_NPATTERNS (expr
) == 1
3038 && VECTOR_CST_DUPLICATE_P (expr
)
3039 && real_minus_onep (VECTOR_CST_ENCODED_ELT (expr
, 0)));
3045 /* Nonzero if EXP is a constant or a cast of a constant. */
3048 really_constant_p (const_tree exp
)
3050 /* This is not quite the same as STRIP_NOPS. It does more. */
3051 while (CONVERT_EXPR_P (exp
)
3052 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
3053 exp
= TREE_OPERAND (exp
, 0);
3054 return TREE_CONSTANT (exp
);
3057 /* Return true if T holds a polynomial pointer difference, storing it in
3058 *VALUE if so. A true return means that T's precision is no greater
3059 than 64 bits, which is the largest address space we support, so *VALUE
3060 never loses precision. However, the signedness of the result does
3061 not necessarily match the signedness of T: sometimes an unsigned type
3062 like sizetype is used to encode a value that is actually negative. */
3065 ptrdiff_tree_p (const_tree t
, poly_int64_pod
*value
)
3069 if (TREE_CODE (t
) == INTEGER_CST
)
3071 if (!cst_and_fits_in_hwi (t
))
3073 *value
= int_cst_value (t
);
3076 if (POLY_INT_CST_P (t
))
3078 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
3079 if (!cst_and_fits_in_hwi (POLY_INT_CST_COEFF (t
, i
)))
3081 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
3082 value
->coeffs
[i
] = int_cst_value (POLY_INT_CST_COEFF (t
, i
));
3089 tree_to_poly_int64 (const_tree t
)
3091 gcc_assert (tree_fits_poly_int64_p (t
));
3092 if (POLY_INT_CST_P (t
))
3093 return poly_int_cst_value (t
).force_shwi ();
3094 return TREE_INT_CST_LOW (t
);
3098 tree_to_poly_uint64 (const_tree t
)
3100 gcc_assert (tree_fits_poly_uint64_p (t
));
3101 if (POLY_INT_CST_P (t
))
3102 return poly_int_cst_value (t
).force_uhwi ();
3103 return TREE_INT_CST_LOW (t
);
3106 /* Return first list element whose TREE_VALUE is ELEM.
3107 Return 0 if ELEM is not in LIST. */
3110 value_member (tree elem
, tree list
)
3114 if (elem
== TREE_VALUE (list
))
3116 list
= TREE_CHAIN (list
);
3121 /* Return first list element whose TREE_PURPOSE is ELEM.
3122 Return 0 if ELEM is not in LIST. */
3125 purpose_member (const_tree elem
, tree list
)
3129 if (elem
== TREE_PURPOSE (list
))
3131 list
= TREE_CHAIN (list
);
3136 /* Return true if ELEM is in V. */
3139 vec_member (const_tree elem
, vec
<tree
, va_gc
> *v
)
3143 FOR_EACH_VEC_SAFE_ELT (v
, ix
, t
)
3149 /* Returns element number IDX (zero-origin) of chain CHAIN, or
3153 chain_index (int idx
, tree chain
)
3155 for (; chain
&& idx
> 0; --idx
)
3156 chain
= TREE_CHAIN (chain
);
3160 /* Return nonzero if ELEM is part of the chain CHAIN. */
3163 chain_member (const_tree elem
, const_tree chain
)
3169 chain
= DECL_CHAIN (chain
);
3175 /* Return the length of a chain of nodes chained through TREE_CHAIN.
3176 We expect a null pointer to mark the end of the chain.
3177 This is the Lisp primitive `length'. */
3180 list_length (const_tree t
)
3183 #ifdef ENABLE_TREE_CHECKING
3191 #ifdef ENABLE_TREE_CHECKING
3194 gcc_assert (p
!= q
);
3202 /* Returns the first FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
3203 UNION_TYPE TYPE, or NULL_TREE if none. */
3206 first_field (const_tree type
)
3208 tree t
= TYPE_FIELDS (type
);
3209 while (t
&& TREE_CODE (t
) != FIELD_DECL
)
3214 /* Returns the last FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
3215 UNION_TYPE TYPE, or NULL_TREE if none. */
3218 last_field (const_tree type
)
3220 tree last
= NULL_TREE
;
3222 for (tree fld
= TYPE_FIELDS (type
); fld
; fld
= TREE_CHAIN (fld
))
3224 if (TREE_CODE (fld
) != FIELD_DECL
)
3233 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
3234 by modifying the last node in chain 1 to point to chain 2.
3235 This is the Lisp primitive `nconc'. */
3238 chainon (tree op1
, tree op2
)
3247 for (t1
= op1
; TREE_CHAIN (t1
); t1
= TREE_CHAIN (t1
))
3249 TREE_CHAIN (t1
) = op2
;
3251 #ifdef ENABLE_TREE_CHECKING
3254 for (t2
= op2
; t2
; t2
= TREE_CHAIN (t2
))
3255 gcc_assert (t2
!= t1
);
3262 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
3265 tree_last (tree chain
)
3269 while ((next
= TREE_CHAIN (chain
)))
3274 /* Reverse the order of elements in the chain T,
3275 and return the new head of the chain (old last element). */
3280 tree prev
= 0, decl
, next
;
3281 for (decl
= t
; decl
; decl
= next
)
3283 /* We shouldn't be using this function to reverse BLOCK chains; we
3284 have blocks_nreverse for that. */
3285 gcc_checking_assert (TREE_CODE (decl
) != BLOCK
);
3286 next
= TREE_CHAIN (decl
);
3287 TREE_CHAIN (decl
) = prev
;
3293 /* Return a newly created TREE_LIST node whose
3294 purpose and value fields are PARM and VALUE. */
3297 build_tree_list (tree parm
, tree value MEM_STAT_DECL
)
3299 tree t
= make_node (TREE_LIST PASS_MEM_STAT
);
3300 TREE_PURPOSE (t
) = parm
;
3301 TREE_VALUE (t
) = value
;
3305 /* Build a chain of TREE_LIST nodes from a vector. */
3308 build_tree_list_vec (const vec
<tree
, va_gc
> *vec MEM_STAT_DECL
)
3310 tree ret
= NULL_TREE
;
3314 FOR_EACH_VEC_SAFE_ELT (vec
, i
, t
)
3316 *pp
= build_tree_list (NULL
, t PASS_MEM_STAT
);
3317 pp
= &TREE_CHAIN (*pp
);
3322 /* Return a newly created TREE_LIST node whose
3323 purpose and value fields are PURPOSE and VALUE
3324 and whose TREE_CHAIN is CHAIN. */
3327 tree_cons (tree purpose
, tree value
, tree chain MEM_STAT_DECL
)
3331 node
= ggc_alloc_tree_node_stat (sizeof (struct tree_list
) PASS_MEM_STAT
);
3332 memset (node
, 0, sizeof (struct tree_common
));
3334 record_node_allocation_statistics (TREE_LIST
, sizeof (struct tree_list
));
3336 TREE_SET_CODE (node
, TREE_LIST
);
3337 TREE_CHAIN (node
) = chain
;
3338 TREE_PURPOSE (node
) = purpose
;
3339 TREE_VALUE (node
) = value
;
3343 /* Return the values of the elements of a CONSTRUCTOR as a vector of
3347 ctor_to_vec (tree ctor
)
3349 vec
<tree
, va_gc
> *vec
;
3350 vec_alloc (vec
, CONSTRUCTOR_NELTS (ctor
));
3354 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), ix
, val
)
3355 vec
->quick_push (val
);
3360 /* Return the size nominally occupied by an object of type TYPE
3361 when it resides in memory. The value is measured in units of bytes,
3362 and its data type is that normally used for type sizes
3363 (which is the first type created by make_signed_type or
3364 make_unsigned_type). */
3367 size_in_bytes_loc (location_t loc
, const_tree type
)
3371 if (type
== error_mark_node
)
3372 return integer_zero_node
;
3374 type
= TYPE_MAIN_VARIANT (type
);
3375 t
= TYPE_SIZE_UNIT (type
);
3379 lang_hooks
.types
.incomplete_type_error (loc
, NULL_TREE
, type
);
3380 return size_zero_node
;
3386 /* Return the size of TYPE (in bytes) as a wide integer
3387 or return -1 if the size can vary or is larger than an integer. */
3390 int_size_in_bytes (const_tree type
)
3394 if (type
== error_mark_node
)
3397 type
= TYPE_MAIN_VARIANT (type
);
3398 t
= TYPE_SIZE_UNIT (type
);
3400 if (t
&& tree_fits_uhwi_p (t
))
3401 return TREE_INT_CST_LOW (t
);
3406 /* Return the maximum size of TYPE (in bytes) as a wide integer
3407 or return -1 if the size can vary or is larger than an integer. */
3410 max_int_size_in_bytes (const_tree type
)
3412 HOST_WIDE_INT size
= -1;
3415 /* If this is an array type, check for a possible MAX_SIZE attached. */
3417 if (TREE_CODE (type
) == ARRAY_TYPE
)
3419 size_tree
= TYPE_ARRAY_MAX_SIZE (type
);
3421 if (size_tree
&& tree_fits_uhwi_p (size_tree
))
3422 size
= tree_to_uhwi (size_tree
);
3425 /* If we still haven't been able to get a size, see if the language
3426 can compute a maximum size. */
3430 size_tree
= lang_hooks
.types
.max_size (type
);
3432 if (size_tree
&& tree_fits_uhwi_p (size_tree
))
3433 size
= tree_to_uhwi (size_tree
);
3439 /* Return the bit position of FIELD, in bits from the start of the record.
3440 This is a tree of type bitsizetype. */
3443 bit_position (const_tree field
)
3445 return bit_from_pos (DECL_FIELD_OFFSET (field
),
3446 DECL_FIELD_BIT_OFFSET (field
));
3449 /* Return the byte position of FIELD, in bytes from the start of the record.
3450 This is a tree of type sizetype. */
3453 byte_position (const_tree field
)
3455 return byte_from_pos (DECL_FIELD_OFFSET (field
),
3456 DECL_FIELD_BIT_OFFSET (field
));
3459 /* Likewise, but return as an integer. It must be representable in
3460 that way (since it could be a signed value, we don't have the
3461 option of returning -1 like int_size_in_byte can. */
3464 int_byte_position (const_tree field
)
3466 return tree_to_shwi (byte_position (field
));
3469 /* Return, as a tree node, the number of elements for TYPE (which is an
3470 ARRAY_TYPE) minus one. This counts only elements of the top array. */
3473 array_type_nelts (const_tree type
)
3475 tree index_type
, min
, max
;
3477 /* If they did it with unspecified bounds, then we should have already
3478 given an error about it before we got here. */
3479 if (! TYPE_DOMAIN (type
))
3480 return error_mark_node
;
3482 index_type
= TYPE_DOMAIN (type
);
3483 min
= TYPE_MIN_VALUE (index_type
);
3484 max
= TYPE_MAX_VALUE (index_type
);
3486 /* TYPE_MAX_VALUE may not be set if the array has unknown length. */
3489 /* zero sized arrays are represented from C FE as complete types with
3490 NULL TYPE_MAX_VALUE and zero TYPE_SIZE, while C++ FE represents
3491 them as min 0, max -1. */
3492 if (COMPLETE_TYPE_P (type
)
3493 && integer_zerop (TYPE_SIZE (type
))
3494 && integer_zerop (min
))
3495 return build_int_cst (TREE_TYPE (min
), -1);
3497 return error_mark_node
;
3500 return (integer_zerop (min
)
3502 : fold_build2 (MINUS_EXPR
, TREE_TYPE (max
), max
, min
));
3505 /* If arg is static -- a reference to an object in static storage -- then
3506 return the object. This is not the same as the C meaning of `static'.
3507 If arg isn't static, return NULL. */
3512 switch (TREE_CODE (arg
))
3515 /* Nested functions are static, even though taking their address will
3516 involve a trampoline as we unnest the nested function and create
3517 the trampoline on the tree level. */
3521 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
3522 && ! DECL_THREAD_LOCAL_P (arg
)
3523 && ! DECL_DLLIMPORT_P (arg
)
3527 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
3531 return TREE_STATIC (arg
) ? arg
: NULL
;
3538 /* If the thing being referenced is not a field, then it is
3539 something language specific. */
3540 gcc_assert (TREE_CODE (TREE_OPERAND (arg
, 1)) == FIELD_DECL
);
3542 /* If we are referencing a bitfield, we can't evaluate an
3543 ADDR_EXPR at compile time and so it isn't a constant. */
3544 if (DECL_BIT_FIELD (TREE_OPERAND (arg
, 1)))
3547 return staticp (TREE_OPERAND (arg
, 0));
3553 return TREE_CONSTANT (TREE_OPERAND (arg
, 0)) ? arg
: NULL
;
3556 case ARRAY_RANGE_REF
:
3557 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg
))) == INTEGER_CST
3558 && TREE_CODE (TREE_OPERAND (arg
, 1)) == INTEGER_CST
)
3559 return staticp (TREE_OPERAND (arg
, 0));
3563 case COMPOUND_LITERAL_EXPR
:
3564 return TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (arg
)) ? arg
: NULL
;
3574 /* Return whether OP is a DECL whose address is function-invariant. */
3577 decl_address_invariant_p (const_tree op
)
3579 /* The conditions below are slightly less strict than the one in
3582 switch (TREE_CODE (op
))
3591 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
3592 || DECL_THREAD_LOCAL_P (op
)
3593 || DECL_CONTEXT (op
) == current_function_decl
3594 || decl_function_context (op
) == current_function_decl
)
3599 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
3600 || decl_function_context (op
) == current_function_decl
)
3611 /* Return whether OP is a DECL whose address is interprocedural-invariant. */
3614 decl_address_ip_invariant_p (const_tree op
)
3616 /* The conditions below are slightly less strict than the one in
3619 switch (TREE_CODE (op
))
3627 if (((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
3628 && !DECL_DLLIMPORT_P (op
))
3629 || DECL_THREAD_LOCAL_P (op
))
3634 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
)))
3646 /* Return true if T is function-invariant (internal function, does
3647 not handle arithmetic; that's handled in skip_simple_arithmetic and
3648 tree_invariant_p). */
3651 tree_invariant_p_1 (tree t
)
3655 if (TREE_CONSTANT (t
)
3656 || (TREE_READONLY (t
) && !TREE_SIDE_EFFECTS (t
)))
3659 switch (TREE_CODE (t
))
3665 op
= TREE_OPERAND (t
, 0);
3666 while (handled_component_p (op
))
3668 switch (TREE_CODE (op
))
3671 case ARRAY_RANGE_REF
:
3672 if (!tree_invariant_p (TREE_OPERAND (op
, 1))
3673 || TREE_OPERAND (op
, 2) != NULL_TREE
3674 || TREE_OPERAND (op
, 3) != NULL_TREE
)
3679 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
3685 op
= TREE_OPERAND (op
, 0);
3688 return CONSTANT_CLASS_P (op
) || decl_address_invariant_p (op
);
3697 /* Return true if T is function-invariant. */
3700 tree_invariant_p (tree t
)
3702 tree inner
= skip_simple_arithmetic (t
);
3703 return tree_invariant_p_1 (inner
);
3706 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
3707 Do this to any expression which may be used in more than one place,
3708 but must be evaluated only once.
3710 Normally, expand_expr would reevaluate the expression each time.
3711 Calling save_expr produces something that is evaluated and recorded
3712 the first time expand_expr is called on it. Subsequent calls to
3713 expand_expr just reuse the recorded value.
3715 The call to expand_expr that generates code that actually computes
3716 the value is the first call *at compile time*. Subsequent calls
3717 *at compile time* generate code to use the saved value.
3718 This produces correct result provided that *at run time* control
3719 always flows through the insns made by the first expand_expr
3720 before reaching the other places where the save_expr was evaluated.
3721 You, the caller of save_expr, must make sure this is so.
3723 Constants, and certain read-only nodes, are returned with no
3724 SAVE_EXPR because that is safe. Expressions containing placeholders
3725 are not touched; see tree.def for an explanation of what these
3729 save_expr (tree expr
)
3733 /* If the tree evaluates to a constant, then we don't want to hide that
3734 fact (i.e. this allows further folding, and direct checks for constants).
3735 However, a read-only object that has side effects cannot be bypassed.
3736 Since it is no problem to reevaluate literals, we just return the
3738 inner
= skip_simple_arithmetic (expr
);
3739 if (TREE_CODE (inner
) == ERROR_MARK
)
3742 if (tree_invariant_p_1 (inner
))
3745 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
3746 it means that the size or offset of some field of an object depends on
3747 the value within another field.
3749 Note that it must not be the case that EXPR contains both a PLACEHOLDER_EXPR
3750 and some variable since it would then need to be both evaluated once and
3751 evaluated more than once. Front-ends must assure this case cannot
3752 happen by surrounding any such subexpressions in their own SAVE_EXPR
3753 and forcing evaluation at the proper time. */
3754 if (contains_placeholder_p (inner
))
3757 expr
= build1_loc (EXPR_LOCATION (expr
), SAVE_EXPR
, TREE_TYPE (expr
), expr
);
3759 /* This expression might be placed ahead of a jump to ensure that the
3760 value was computed on both sides of the jump. So make sure it isn't
3761 eliminated as dead. */
3762 TREE_SIDE_EFFECTS (expr
) = 1;
3766 /* Look inside EXPR into any simple arithmetic operations. Return the
3767 outermost non-arithmetic or non-invariant node. */
3770 skip_simple_arithmetic (tree expr
)
3772 /* We don't care about whether this can be used as an lvalue in this
3774 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
3775 expr
= TREE_OPERAND (expr
, 0);
3777 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
3778 a constant, it will be more efficient to not make another SAVE_EXPR since
3779 it will allow better simplification and GCSE will be able to merge the
3780 computations if they actually occur. */
3783 if (UNARY_CLASS_P (expr
))
3784 expr
= TREE_OPERAND (expr
, 0);
3785 else if (BINARY_CLASS_P (expr
))
3787 if (tree_invariant_p (TREE_OPERAND (expr
, 1)))
3788 expr
= TREE_OPERAND (expr
, 0);
3789 else if (tree_invariant_p (TREE_OPERAND (expr
, 0)))
3790 expr
= TREE_OPERAND (expr
, 1);
3801 /* Look inside EXPR into simple arithmetic operations involving constants.
3802 Return the outermost non-arithmetic or non-constant node. */
3805 skip_simple_constant_arithmetic (tree expr
)
3807 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
3808 expr
= TREE_OPERAND (expr
, 0);
3812 if (UNARY_CLASS_P (expr
))
3813 expr
= TREE_OPERAND (expr
, 0);
3814 else if (BINARY_CLASS_P (expr
))
3816 if (TREE_CONSTANT (TREE_OPERAND (expr
, 1)))
3817 expr
= TREE_OPERAND (expr
, 0);
3818 else if (TREE_CONSTANT (TREE_OPERAND (expr
, 0)))
3819 expr
= TREE_OPERAND (expr
, 1);
3830 /* Return which tree structure is used by T. */
3832 enum tree_node_structure_enum
3833 tree_node_structure (const_tree t
)
3835 const enum tree_code code
= TREE_CODE (t
);
3836 return tree_node_structure_for_code (code
);
3839 /* Set various status flags when building a CALL_EXPR object T. */
3842 process_call_operands (tree t
)
3844 bool side_effects
= TREE_SIDE_EFFECTS (t
);
3845 bool read_only
= false;
3846 int i
= call_expr_flags (t
);
3848 /* Calls have side-effects, except those to const or pure functions. */
3849 if ((i
& ECF_LOOPING_CONST_OR_PURE
) || !(i
& (ECF_CONST
| ECF_PURE
)))
3850 side_effects
= true;
3851 /* Propagate TREE_READONLY of arguments for const functions. */
3855 if (!side_effects
|| read_only
)
3856 for (i
= 1; i
< TREE_OPERAND_LENGTH (t
); i
++)
3858 tree op
= TREE_OPERAND (t
, i
);
3859 if (op
&& TREE_SIDE_EFFECTS (op
))
3860 side_effects
= true;
3861 if (op
&& !TREE_READONLY (op
) && !CONSTANT_CLASS_P (op
))
3865 TREE_SIDE_EFFECTS (t
) = side_effects
;
3866 TREE_READONLY (t
) = read_only
;
3869 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
3870 size or offset that depends on a field within a record. */
3873 contains_placeholder_p (const_tree exp
)
3875 enum tree_code code
;
3880 code
= TREE_CODE (exp
);
3881 if (code
== PLACEHOLDER_EXPR
)
3884 switch (TREE_CODE_CLASS (code
))
3887 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
3888 position computations since they will be converted into a
3889 WITH_RECORD_EXPR involving the reference, which will assume
3890 here will be valid. */
3891 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
3893 case tcc_exceptional
:
3894 if (code
== TREE_LIST
)
3895 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp
))
3896 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp
)));
3901 case tcc_comparison
:
3902 case tcc_expression
:
3906 /* Ignoring the first operand isn't quite right, but works best. */
3907 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1));
3910 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
3911 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1))
3912 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 2)));
3915 /* The save_expr function never wraps anything containing
3916 a PLACEHOLDER_EXPR. */
3923 switch (TREE_CODE_LENGTH (code
))
3926 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
3928 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
3929 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1)));
3940 const_call_expr_arg_iterator iter
;
3941 FOR_EACH_CONST_CALL_EXPR_ARG (arg
, iter
, exp
)
3942 if (CONTAINS_PLACEHOLDER_P (arg
))
3956 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
3957 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
3961 type_contains_placeholder_1 (const_tree type
)
3963 /* If the size contains a placeholder or the parent type (component type in
3964 the case of arrays) type involves a placeholder, this type does. */
3965 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type
))
3966 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type
))
3967 || (!POINTER_TYPE_P (type
)
3969 && type_contains_placeholder_p (TREE_TYPE (type
))))
3972 /* Now do type-specific checks. Note that the last part of the check above
3973 greatly limits what we have to do below. */
3974 switch (TREE_CODE (type
))
3983 case REFERENCE_TYPE
:
3992 case FIXED_POINT_TYPE
:
3993 /* Here we just check the bounds. */
3994 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type
))
3995 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type
)));
3998 /* We have already checked the component type above, so just check
3999 the domain type. Flexible array members have a null domain. */
4000 return TYPE_DOMAIN (type
) ?
4001 type_contains_placeholder_p (TYPE_DOMAIN (type
)) : false;
4005 case QUAL_UNION_TYPE
:
4009 for (field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
4010 if (TREE_CODE (field
) == FIELD_DECL
4011 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field
))
4012 || (TREE_CODE (type
) == QUAL_UNION_TYPE
4013 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field
)))
4014 || type_contains_placeholder_p (TREE_TYPE (field
))))
4025 /* Wrapper around above function used to cache its result. */
4028 type_contains_placeholder_p (tree type
)
4032 /* If the contains_placeholder_bits field has been initialized,
4033 then we know the answer. */
4034 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) > 0)
4035 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) - 1;
4037 /* Indicate that we've seen this type node, and the answer is false.
4038 This is what we want to return if we run into recursion via fields. */
4039 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = 1;
4041 /* Compute the real value. */
4042 result
= type_contains_placeholder_1 (type
);
4044 /* Store the real value. */
4045 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = result
+ 1;
4050 /* Push tree EXP onto vector QUEUE if it is not already present. */
4053 push_without_duplicates (tree exp
, vec
<tree
> *queue
)
4058 FOR_EACH_VEC_ELT (*queue
, i
, iter
)
4059 if (simple_cst_equal (iter
, exp
) == 1)
4063 queue
->safe_push (exp
);
4066 /* Given a tree EXP, find all occurrences of references to fields
4067 in a PLACEHOLDER_EXPR and place them in vector REFS without
4068 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
4069 we assume here that EXP contains only arithmetic expressions
4070 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
4074 find_placeholder_in_expr (tree exp
, vec
<tree
> *refs
)
4076 enum tree_code code
= TREE_CODE (exp
);
4080 /* We handle TREE_LIST and COMPONENT_REF separately. */
4081 if (code
== TREE_LIST
)
4083 FIND_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), refs
);
4084 FIND_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), refs
);
4086 else if (code
== COMPONENT_REF
)
4088 for (inner
= TREE_OPERAND (exp
, 0);
4089 REFERENCE_CLASS_P (inner
);
4090 inner
= TREE_OPERAND (inner
, 0))
4093 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
)
4094 push_without_duplicates (exp
, refs
);
4096 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), refs
);
4099 switch (TREE_CODE_CLASS (code
))
4104 case tcc_declaration
:
4105 /* Variables allocated to static storage can stay. */
4106 if (!TREE_STATIC (exp
))
4107 push_without_duplicates (exp
, refs
);
4110 case tcc_expression
:
4111 /* This is the pattern built in ada/make_aligning_type. */
4112 if (code
== ADDR_EXPR
4113 && TREE_CODE (TREE_OPERAND (exp
, 0)) == PLACEHOLDER_EXPR
)
4115 push_without_duplicates (exp
, refs
);
4121 case tcc_exceptional
:
4124 case tcc_comparison
:
4126 for (i
= 0; i
< TREE_CODE_LENGTH (code
); i
++)
4127 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
4131 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
4132 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
4140 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
4141 return a tree with all occurrences of references to F in a
4142 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
4143 CONST_DECLs. Note that we assume here that EXP contains only
4144 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
4145 occurring only in their argument list. */
4148 substitute_in_expr (tree exp
, tree f
, tree r
)
4150 enum tree_code code
= TREE_CODE (exp
);
4151 tree op0
, op1
, op2
, op3
;
4154 /* We handle TREE_LIST and COMPONENT_REF separately. */
4155 if (code
== TREE_LIST
)
4157 op0
= SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp
), f
, r
);
4158 op1
= SUBSTITUTE_IN_EXPR (TREE_VALUE (exp
), f
, r
);
4159 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
4162 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
4164 else if (code
== COMPONENT_REF
)
4168 /* If this expression is getting a value from a PLACEHOLDER_EXPR
4169 and it is the right field, replace it with R. */
4170 for (inner
= TREE_OPERAND (exp
, 0);
4171 REFERENCE_CLASS_P (inner
);
4172 inner
= TREE_OPERAND (inner
, 0))
4176 op1
= TREE_OPERAND (exp
, 1);
4178 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& op1
== f
)
4181 /* If this expression hasn't been completed let, leave it alone. */
4182 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& !TREE_TYPE (inner
))
4185 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
4186 if (op0
== TREE_OPERAND (exp
, 0))
4190 = fold_build3 (COMPONENT_REF
, TREE_TYPE (exp
), op0
, op1
, NULL_TREE
);
4193 switch (TREE_CODE_CLASS (code
))
4198 case tcc_declaration
:
4204 case tcc_expression
:
4210 case tcc_exceptional
:
4213 case tcc_comparison
:
4215 switch (TREE_CODE_LENGTH (code
))
4221 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
4222 if (op0
== TREE_OPERAND (exp
, 0))
4225 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
4229 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
4230 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
4232 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
4235 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
4239 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
4240 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
4241 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
4243 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
4244 && op2
== TREE_OPERAND (exp
, 2))
4247 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
4251 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
4252 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
4253 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
4254 op3
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 3), f
, r
);
4256 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
4257 && op2
== TREE_OPERAND (exp
, 2)
4258 && op3
== TREE_OPERAND (exp
, 3))
4262 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
4274 new_tree
= NULL_TREE
;
4276 /* If we are trying to replace F with a constant or with another
4277 instance of one of the arguments of the call, inline back
4278 functions which do nothing else than computing a value from
4279 the arguments they are passed. This makes it possible to
4280 fold partially or entirely the replacement expression. */
4281 if (code
== CALL_EXPR
)
4283 bool maybe_inline
= false;
4284 if (CONSTANT_CLASS_P (r
))
4285 maybe_inline
= true;
4287 for (i
= 3; i
< TREE_OPERAND_LENGTH (exp
); i
++)
4288 if (operand_equal_p (TREE_OPERAND (exp
, i
), r
, 0))
4290 maybe_inline
= true;
4295 tree t
= maybe_inline_call_in_expr (exp
);
4297 return SUBSTITUTE_IN_EXPR (t
, f
, r
);
4301 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
4303 tree op
= TREE_OPERAND (exp
, i
);
4304 tree new_op
= SUBSTITUTE_IN_EXPR (op
, f
, r
);
4308 new_tree
= copy_node (exp
);
4309 TREE_OPERAND (new_tree
, i
) = new_op
;
4315 new_tree
= fold (new_tree
);
4316 if (TREE_CODE (new_tree
) == CALL_EXPR
)
4317 process_call_operands (new_tree
);
4328 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
4330 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
4331 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
4336 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
4337 for it within OBJ, a tree that is an object or a chain of references. */
4340 substitute_placeholder_in_expr (tree exp
, tree obj
)
4342 enum tree_code code
= TREE_CODE (exp
);
4343 tree op0
, op1
, op2
, op3
;
4346 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
4347 in the chain of OBJ. */
4348 if (code
== PLACEHOLDER_EXPR
)
4350 tree need_type
= TYPE_MAIN_VARIANT (TREE_TYPE (exp
));
4353 for (elt
= obj
; elt
!= 0;
4354 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
4355 || TREE_CODE (elt
) == COND_EXPR
)
4356 ? TREE_OPERAND (elt
, 1)
4357 : (REFERENCE_CLASS_P (elt
)
4358 || UNARY_CLASS_P (elt
)
4359 || BINARY_CLASS_P (elt
)
4360 || VL_EXP_CLASS_P (elt
)
4361 || EXPRESSION_CLASS_P (elt
))
4362 ? TREE_OPERAND (elt
, 0) : 0))
4363 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt
)) == need_type
)
4366 for (elt
= obj
; elt
!= 0;
4367 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
4368 || TREE_CODE (elt
) == COND_EXPR
)
4369 ? TREE_OPERAND (elt
, 1)
4370 : (REFERENCE_CLASS_P (elt
)
4371 || UNARY_CLASS_P (elt
)
4372 || BINARY_CLASS_P (elt
)
4373 || VL_EXP_CLASS_P (elt
)
4374 || EXPRESSION_CLASS_P (elt
))
4375 ? TREE_OPERAND (elt
, 0) : 0))
4376 if (POINTER_TYPE_P (TREE_TYPE (elt
))
4377 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt
)))
4379 return fold_build1 (INDIRECT_REF
, need_type
, elt
);
4381 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
4382 survives until RTL generation, there will be an error. */
4386 /* TREE_LIST is special because we need to look at TREE_VALUE
4387 and TREE_CHAIN, not TREE_OPERANDS. */
4388 else if (code
== TREE_LIST
)
4390 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), obj
);
4391 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), obj
);
4392 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
4395 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
4398 switch (TREE_CODE_CLASS (code
))
4401 case tcc_declaration
:
4404 case tcc_exceptional
:
4407 case tcc_comparison
:
4408 case tcc_expression
:
4411 switch (TREE_CODE_LENGTH (code
))
4417 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
4418 if (op0
== TREE_OPERAND (exp
, 0))
4421 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
4425 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
4426 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
4428 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
4431 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
4435 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
4436 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
4437 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
4439 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
4440 && op2
== TREE_OPERAND (exp
, 2))
4443 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
4447 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
4448 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
4449 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
4450 op3
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 3), obj
);
4452 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
4453 && op2
== TREE_OPERAND (exp
, 2)
4454 && op3
== TREE_OPERAND (exp
, 3))
4458 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
4470 new_tree
= NULL_TREE
;
4472 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
4474 tree op
= TREE_OPERAND (exp
, i
);
4475 tree new_op
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (op
, obj
);
4479 new_tree
= copy_node (exp
);
4480 TREE_OPERAND (new_tree
, i
) = new_op
;
4486 new_tree
= fold (new_tree
);
4487 if (TREE_CODE (new_tree
) == CALL_EXPR
)
4488 process_call_operands (new_tree
);
4499 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
4501 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
4502 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
4508 /* Subroutine of stabilize_reference; this is called for subtrees of
4509 references. Any expression with side-effects must be put in a SAVE_EXPR
4510 to ensure that it is only evaluated once.
4512 We don't put SAVE_EXPR nodes around everything, because assigning very
4513 simple expressions to temporaries causes us to miss good opportunities
4514 for optimizations. Among other things, the opportunity to fold in the
4515 addition of a constant into an addressing mode often gets lost, e.g.
4516 "y[i+1] += x;". In general, we take the approach that we should not make
4517 an assignment unless we are forced into it - i.e., that any non-side effect
4518 operator should be allowed, and that cse should take care of coalescing
4519 multiple utterances of the same expression should that prove fruitful. */
4522 stabilize_reference_1 (tree e
)
4525 enum tree_code code
= TREE_CODE (e
);
4527 /* We cannot ignore const expressions because it might be a reference
4528 to a const array but whose index contains side-effects. But we can
4529 ignore things that are actual constant or that already have been
4530 handled by this function. */
4532 if (tree_invariant_p (e
))
4535 switch (TREE_CODE_CLASS (code
))
4537 case tcc_exceptional
:
4538 /* Always wrap STATEMENT_LIST into SAVE_EXPR, even if it doesn't
4539 have side-effects. */
4540 if (code
== STATEMENT_LIST
)
4541 return save_expr (e
);
4544 case tcc_declaration
:
4545 case tcc_comparison
:
4547 case tcc_expression
:
4550 /* If the expression has side-effects, then encase it in a SAVE_EXPR
4551 so that it will only be evaluated once. */
4552 /* The reference (r) and comparison (<) classes could be handled as
4553 below, but it is generally faster to only evaluate them once. */
4554 if (TREE_SIDE_EFFECTS (e
))
4555 return save_expr (e
);
4559 /* Constants need no processing. In fact, we should never reach
4564 /* Division is slow and tends to be compiled with jumps,
4565 especially the division by powers of 2 that is often
4566 found inside of an array reference. So do it just once. */
4567 if (code
== TRUNC_DIV_EXPR
|| code
== TRUNC_MOD_EXPR
4568 || code
== FLOOR_DIV_EXPR
|| code
== FLOOR_MOD_EXPR
4569 || code
== CEIL_DIV_EXPR
|| code
== CEIL_MOD_EXPR
4570 || code
== ROUND_DIV_EXPR
|| code
== ROUND_MOD_EXPR
)
4571 return save_expr (e
);
4572 /* Recursively stabilize each operand. */
4573 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)),
4574 stabilize_reference_1 (TREE_OPERAND (e
, 1)));
4578 /* Recursively stabilize each operand. */
4579 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)));
4586 TREE_TYPE (result
) = TREE_TYPE (e
);
4587 TREE_READONLY (result
) = TREE_READONLY (e
);
4588 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (e
);
4589 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (e
);
4594 /* Stabilize a reference so that we can use it any number of times
4595 without causing its operands to be evaluated more than once.
4596 Returns the stabilized reference. This works by means of save_expr,
4597 so see the caveats in the comments about save_expr.
4599 Also allows conversion expressions whose operands are references.
4600 Any other kind of expression is returned unchanged. */
4603 stabilize_reference (tree ref
)
4606 enum tree_code code
= TREE_CODE (ref
);
4613 /* No action is needed in this case. */
4618 case FIX_TRUNC_EXPR
:
4619 result
= build_nt (code
, stabilize_reference (TREE_OPERAND (ref
, 0)));
4623 result
= build_nt (INDIRECT_REF
,
4624 stabilize_reference_1 (TREE_OPERAND (ref
, 0)));
4628 result
= build_nt (COMPONENT_REF
,
4629 stabilize_reference (TREE_OPERAND (ref
, 0)),
4630 TREE_OPERAND (ref
, 1), NULL_TREE
);
4634 result
= build_nt (BIT_FIELD_REF
,
4635 stabilize_reference (TREE_OPERAND (ref
, 0)),
4636 TREE_OPERAND (ref
, 1), TREE_OPERAND (ref
, 2));
4637 REF_REVERSE_STORAGE_ORDER (result
) = REF_REVERSE_STORAGE_ORDER (ref
);
4641 result
= build_nt (ARRAY_REF
,
4642 stabilize_reference (TREE_OPERAND (ref
, 0)),
4643 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
4644 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
4647 case ARRAY_RANGE_REF
:
4648 result
= build_nt (ARRAY_RANGE_REF
,
4649 stabilize_reference (TREE_OPERAND (ref
, 0)),
4650 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
4651 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
4655 /* We cannot wrap the first expression in a SAVE_EXPR, as then
4656 it wouldn't be ignored. This matters when dealing with
4658 return stabilize_reference_1 (ref
);
4660 /* If arg isn't a kind of lvalue we recognize, make no change.
4661 Caller should recognize the error for an invalid lvalue. */
4666 return error_mark_node
;
4669 TREE_TYPE (result
) = TREE_TYPE (ref
);
4670 TREE_READONLY (result
) = TREE_READONLY (ref
);
4671 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (ref
);
4672 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (ref
);
4677 /* Low-level constructors for expressions. */
4679 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
4680 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
4683 recompute_tree_invariant_for_addr_expr (tree t
)
4686 bool tc
= true, se
= false;
4688 gcc_assert (TREE_CODE (t
) == ADDR_EXPR
);
4690 /* We started out assuming this address is both invariant and constant, but
4691 does not have side effects. Now go down any handled components and see if
4692 any of them involve offsets that are either non-constant or non-invariant.
4693 Also check for side-effects.
4695 ??? Note that this code makes no attempt to deal with the case where
4696 taking the address of something causes a copy due to misalignment. */
4698 #define UPDATE_FLAGS(NODE) \
4699 do { tree _node = (NODE); \
4700 if (_node && !TREE_CONSTANT (_node)) tc = false; \
4701 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
4703 for (node
= TREE_OPERAND (t
, 0); handled_component_p (node
);
4704 node
= TREE_OPERAND (node
, 0))
4706 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
4707 array reference (probably made temporarily by the G++ front end),
4708 so ignore all the operands. */
4709 if ((TREE_CODE (node
) == ARRAY_REF
4710 || TREE_CODE (node
) == ARRAY_RANGE_REF
)
4711 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node
, 0))) == ARRAY_TYPE
)
4713 UPDATE_FLAGS (TREE_OPERAND (node
, 1));
4714 if (TREE_OPERAND (node
, 2))
4715 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
4716 if (TREE_OPERAND (node
, 3))
4717 UPDATE_FLAGS (TREE_OPERAND (node
, 3));
4719 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
4720 FIELD_DECL, apparently. The G++ front end can put something else
4721 there, at least temporarily. */
4722 else if (TREE_CODE (node
) == COMPONENT_REF
4723 && TREE_CODE (TREE_OPERAND (node
, 1)) == FIELD_DECL
)
4725 if (TREE_OPERAND (node
, 2))
4726 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
4730 node
= lang_hooks
.expr_to_decl (node
, &tc
, &se
);
4732 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
4733 the address, since &(*a)->b is a form of addition. If it's a constant, the
4734 address is constant too. If it's a decl, its address is constant if the
4735 decl is static. Everything else is not constant and, furthermore,
4736 taking the address of a volatile variable is not volatile. */
4737 if (TREE_CODE (node
) == INDIRECT_REF
4738 || TREE_CODE (node
) == MEM_REF
)
4739 UPDATE_FLAGS (TREE_OPERAND (node
, 0));
4740 else if (CONSTANT_CLASS_P (node
))
4742 else if (DECL_P (node
))
4743 tc
&= (staticp (node
) != NULL_TREE
);
4747 se
|= TREE_SIDE_EFFECTS (node
);
4751 TREE_CONSTANT (t
) = tc
;
4752 TREE_SIDE_EFFECTS (t
) = se
;
4756 /* Build an expression of code CODE, data type TYPE, and operands as
4757 specified. Expressions and reference nodes can be created this way.
4758 Constants, decls, types and misc nodes cannot be.
4760 We define 5 non-variadic functions, from 0 to 4 arguments. This is
4761 enough for all extant tree codes. */
4764 build0 (enum tree_code code
, tree tt MEM_STAT_DECL
)
4768 gcc_assert (TREE_CODE_LENGTH (code
) == 0);
4770 t
= make_node (code PASS_MEM_STAT
);
4777 build1 (enum tree_code code
, tree type
, tree node MEM_STAT_DECL
)
4779 int length
= sizeof (struct tree_exp
);
4782 record_node_allocation_statistics (code
, length
);
4784 gcc_assert (TREE_CODE_LENGTH (code
) == 1);
4786 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
4788 memset (t
, 0, sizeof (struct tree_common
));
4790 TREE_SET_CODE (t
, code
);
4792 TREE_TYPE (t
) = type
;
4793 SET_EXPR_LOCATION (t
, UNKNOWN_LOCATION
);
4794 TREE_OPERAND (t
, 0) = node
;
4795 if (node
&& !TYPE_P (node
))
4797 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (node
);
4798 TREE_READONLY (t
) = TREE_READONLY (node
);
4801 if (TREE_CODE_CLASS (code
) == tcc_statement
)
4803 if (code
!= DEBUG_BEGIN_STMT
)
4804 TREE_SIDE_EFFECTS (t
) = 1;
4809 /* All of these have side-effects, no matter what their
4811 TREE_SIDE_EFFECTS (t
) = 1;
4812 TREE_READONLY (t
) = 0;
4816 /* Whether a dereference is readonly has nothing to do with whether
4817 its operand is readonly. */
4818 TREE_READONLY (t
) = 0;
4823 recompute_tree_invariant_for_addr_expr (t
);
4827 if ((TREE_CODE_CLASS (code
) == tcc_unary
|| code
== VIEW_CONVERT_EXPR
)
4828 && node
&& !TYPE_P (node
)
4829 && TREE_CONSTANT (node
))
4830 TREE_CONSTANT (t
) = 1;
4831 if (TREE_CODE_CLASS (code
) == tcc_reference
4832 && node
&& TREE_THIS_VOLATILE (node
))
4833 TREE_THIS_VOLATILE (t
) = 1;
4840 #define PROCESS_ARG(N) \
4842 TREE_OPERAND (t, N) = arg##N; \
4843 if (arg##N &&!TYPE_P (arg##N)) \
4845 if (TREE_SIDE_EFFECTS (arg##N)) \
4847 if (!TREE_READONLY (arg##N) \
4848 && !CONSTANT_CLASS_P (arg##N)) \
4849 (void) (read_only = 0); \
4850 if (!TREE_CONSTANT (arg##N)) \
4851 (void) (constant = 0); \
4856 build2 (enum tree_code code
, tree tt
, tree arg0
, tree arg1 MEM_STAT_DECL
)
4858 bool constant
, read_only
, side_effects
, div_by_zero
;
4861 gcc_assert (TREE_CODE_LENGTH (code
) == 2);
4863 if ((code
== MINUS_EXPR
|| code
== PLUS_EXPR
|| code
== MULT_EXPR
)
4864 && arg0
&& arg1
&& tt
&& POINTER_TYPE_P (tt
)
4865 /* When sizetype precision doesn't match that of pointers
4866 we need to be able to build explicit extensions or truncations
4867 of the offset argument. */
4868 && TYPE_PRECISION (sizetype
) == TYPE_PRECISION (tt
))
4869 gcc_assert (TREE_CODE (arg0
) == INTEGER_CST
4870 && TREE_CODE (arg1
) == INTEGER_CST
);
4872 if (code
== POINTER_PLUS_EXPR
&& arg0
&& arg1
&& tt
)
4873 gcc_assert (POINTER_TYPE_P (tt
) && POINTER_TYPE_P (TREE_TYPE (arg0
))
4874 && ptrofftype_p (TREE_TYPE (arg1
)));
4876 t
= make_node (code PASS_MEM_STAT
);
4879 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
4880 result based on those same flags for the arguments. But if the
4881 arguments aren't really even `tree' expressions, we shouldn't be trying
4884 /* Expressions without side effects may be constant if their
4885 arguments are as well. */
4886 constant
= (TREE_CODE_CLASS (code
) == tcc_comparison
4887 || TREE_CODE_CLASS (code
) == tcc_binary
);
4889 side_effects
= TREE_SIDE_EFFECTS (t
);
4893 case TRUNC_DIV_EXPR
:
4895 case FLOOR_DIV_EXPR
:
4896 case ROUND_DIV_EXPR
:
4897 case EXACT_DIV_EXPR
:
4899 case FLOOR_MOD_EXPR
:
4900 case ROUND_MOD_EXPR
:
4901 case TRUNC_MOD_EXPR
:
4902 div_by_zero
= integer_zerop (arg1
);
4905 div_by_zero
= false;
4911 TREE_SIDE_EFFECTS (t
) = side_effects
;
4912 if (code
== MEM_REF
)
4914 if (arg0
&& TREE_CODE (arg0
) == ADDR_EXPR
)
4916 tree o
= TREE_OPERAND (arg0
, 0);
4917 TREE_READONLY (t
) = TREE_READONLY (o
);
4918 TREE_THIS_VOLATILE (t
) = TREE_THIS_VOLATILE (o
);
4923 TREE_READONLY (t
) = read_only
;
4924 /* Don't mark X / 0 as constant. */
4925 TREE_CONSTANT (t
) = constant
&& !div_by_zero
;
4926 TREE_THIS_VOLATILE (t
)
4927 = (TREE_CODE_CLASS (code
) == tcc_reference
4928 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4936 build3 (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4937 tree arg2 MEM_STAT_DECL
)
4939 bool constant
, read_only
, side_effects
;
4942 gcc_assert (TREE_CODE_LENGTH (code
) == 3);
4943 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
4945 t
= make_node (code PASS_MEM_STAT
);
4950 /* As a special exception, if COND_EXPR has NULL branches, we
4951 assume that it is a gimple statement and always consider
4952 it to have side effects. */
4953 if (code
== COND_EXPR
4954 && tt
== void_type_node
4955 && arg1
== NULL_TREE
4956 && arg2
== NULL_TREE
)
4957 side_effects
= true;
4959 side_effects
= TREE_SIDE_EFFECTS (t
);
4965 if (code
== COND_EXPR
)
4966 TREE_READONLY (t
) = read_only
;
4968 TREE_SIDE_EFFECTS (t
) = side_effects
;
4969 TREE_THIS_VOLATILE (t
)
4970 = (TREE_CODE_CLASS (code
) == tcc_reference
4971 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4977 build4 (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4978 tree arg2
, tree arg3 MEM_STAT_DECL
)
4980 bool constant
, read_only
, side_effects
;
4983 gcc_assert (TREE_CODE_LENGTH (code
) == 4);
4985 t
= make_node (code PASS_MEM_STAT
);
4988 side_effects
= TREE_SIDE_EFFECTS (t
);
4995 TREE_SIDE_EFFECTS (t
) = side_effects
;
4996 TREE_THIS_VOLATILE (t
)
4997 = (TREE_CODE_CLASS (code
) == tcc_reference
4998 && arg0
&& TREE_THIS_VOLATILE (arg0
));
5004 build5 (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
5005 tree arg2
, tree arg3
, tree arg4 MEM_STAT_DECL
)
5007 bool constant
, read_only
, side_effects
;
5010 gcc_assert (TREE_CODE_LENGTH (code
) == 5);
5012 t
= make_node (code PASS_MEM_STAT
);
5015 side_effects
= TREE_SIDE_EFFECTS (t
);
5023 TREE_SIDE_EFFECTS (t
) = side_effects
;
5024 if (code
== TARGET_MEM_REF
)
5026 if (arg0
&& TREE_CODE (arg0
) == ADDR_EXPR
)
5028 tree o
= TREE_OPERAND (arg0
, 0);
5029 TREE_READONLY (t
) = TREE_READONLY (o
);
5030 TREE_THIS_VOLATILE (t
) = TREE_THIS_VOLATILE (o
);
5034 TREE_THIS_VOLATILE (t
)
5035 = (TREE_CODE_CLASS (code
) == tcc_reference
5036 && arg0
&& TREE_THIS_VOLATILE (arg0
));
5041 /* Build a simple MEM_REF tree with the sematics of a plain INDIRECT_REF
5042 on the pointer PTR. */
5045 build_simple_mem_ref_loc (location_t loc
, tree ptr
)
5047 poly_int64 offset
= 0;
5048 tree ptype
= TREE_TYPE (ptr
);
5050 /* For convenience allow addresses that collapse to a simple base
5052 if (TREE_CODE (ptr
) == ADDR_EXPR
5053 && (handled_component_p (TREE_OPERAND (ptr
, 0))
5054 || TREE_CODE (TREE_OPERAND (ptr
, 0)) == MEM_REF
))
5056 ptr
= get_addr_base_and_unit_offset (TREE_OPERAND (ptr
, 0), &offset
);
5058 if (TREE_CODE (ptr
) == MEM_REF
)
5060 offset
+= mem_ref_offset (ptr
).force_shwi ();
5061 ptr
= TREE_OPERAND (ptr
, 0);
5064 ptr
= build_fold_addr_expr (ptr
);
5065 gcc_assert (is_gimple_reg (ptr
) || is_gimple_min_invariant (ptr
));
5067 tem
= build2 (MEM_REF
, TREE_TYPE (ptype
),
5068 ptr
, build_int_cst (ptype
, offset
));
5069 SET_EXPR_LOCATION (tem
, loc
);
5073 /* Return the constant offset of a MEM_REF or TARGET_MEM_REF tree T. */
5076 mem_ref_offset (const_tree t
)
5078 return poly_offset_int::from (wi::to_poly_wide (TREE_OPERAND (t
, 1)),
5082 /* Return an invariant ADDR_EXPR of type TYPE taking the address of BASE
5083 offsetted by OFFSET units. */
5086 build_invariant_address (tree type
, tree base
, poly_int64 offset
)
5088 tree ref
= fold_build2 (MEM_REF
, TREE_TYPE (type
),
5089 build_fold_addr_expr (base
),
5090 build_int_cst (ptr_type_node
, offset
));
5091 tree addr
= build1 (ADDR_EXPR
, type
, ref
);
5092 recompute_tree_invariant_for_addr_expr (addr
);
5096 /* Similar except don't specify the TREE_TYPE
5097 and leave the TREE_SIDE_EFFECTS as 0.
5098 It is permissible for arguments to be null,
5099 or even garbage if their values do not matter. */
5102 build_nt (enum tree_code code
, ...)
5109 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
5113 t
= make_node (code
);
5114 length
= TREE_CODE_LENGTH (code
);
5116 for (i
= 0; i
< length
; i
++)
5117 TREE_OPERAND (t
, i
) = va_arg (p
, tree
);
5123 /* Similar to build_nt, but for creating a CALL_EXPR object with a
5127 build_nt_call_vec (tree fn
, vec
<tree
, va_gc
> *args
)
5132 ret
= build_vl_exp (CALL_EXPR
, vec_safe_length (args
) + 3);
5133 CALL_EXPR_FN (ret
) = fn
;
5134 CALL_EXPR_STATIC_CHAIN (ret
) = NULL_TREE
;
5135 FOR_EACH_VEC_SAFE_ELT (args
, ix
, t
)
5136 CALL_EXPR_ARG (ret
, ix
) = t
;
5140 /* Create a DECL_... node of code CODE, name NAME (if non-null)
5142 We do NOT enter this node in any sort of symbol table.
5144 LOC is the location of the decl.
5146 layout_decl is used to set up the decl's storage layout.
5147 Other slots are initialized to 0 or null pointers. */
5150 build_decl (location_t loc
, enum tree_code code
, tree name
,
5151 tree type MEM_STAT_DECL
)
5155 t
= make_node (code PASS_MEM_STAT
);
5156 DECL_SOURCE_LOCATION (t
) = loc
;
5158 /* if (type == error_mark_node)
5159 type = integer_type_node; */
5160 /* That is not done, deliberately, so that having error_mark_node
5161 as the type can suppress useless errors in the use of this variable. */
5163 DECL_NAME (t
) = name
;
5164 TREE_TYPE (t
) = type
;
5166 if (code
== VAR_DECL
|| code
== PARM_DECL
|| code
== RESULT_DECL
)
5172 /* Builds and returns function declaration with NAME and TYPE. */
5175 build_fn_decl (const char *name
, tree type
)
5177 tree id
= get_identifier (name
);
5178 tree decl
= build_decl (input_location
, FUNCTION_DECL
, id
, type
);
5180 DECL_EXTERNAL (decl
) = 1;
5181 TREE_PUBLIC (decl
) = 1;
5182 DECL_ARTIFICIAL (decl
) = 1;
5183 TREE_NOTHROW (decl
) = 1;
5188 vec
<tree
, va_gc
> *all_translation_units
;
5190 /* Builds a new translation-unit decl with name NAME, queues it in the
5191 global list of translation-unit decls and returns it. */
5194 build_translation_unit_decl (tree name
)
5196 tree tu
= build_decl (UNKNOWN_LOCATION
, TRANSLATION_UNIT_DECL
,
5198 TRANSLATION_UNIT_LANGUAGE (tu
) = lang_hooks
.name
;
5199 vec_safe_push (all_translation_units
, tu
);
5204 /* BLOCK nodes are used to represent the structure of binding contours
5205 and declarations, once those contours have been exited and their contents
5206 compiled. This information is used for outputting debugging info. */
5209 build_block (tree vars
, tree subblocks
, tree supercontext
, tree chain
)
5211 tree block
= make_node (BLOCK
);
5213 BLOCK_VARS (block
) = vars
;
5214 BLOCK_SUBBLOCKS (block
) = subblocks
;
5215 BLOCK_SUPERCONTEXT (block
) = supercontext
;
5216 BLOCK_CHAIN (block
) = chain
;
5221 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
5223 LOC is the location to use in tree T. */
5226 protected_set_expr_location (tree t
, location_t loc
)
5228 if (CAN_HAVE_LOCATION_P (t
))
5229 SET_EXPR_LOCATION (t
, loc
);
5230 else if (t
&& TREE_CODE (t
) == STATEMENT_LIST
)
5232 t
= expr_single (t
);
5233 if (t
&& CAN_HAVE_LOCATION_P (t
))
5234 SET_EXPR_LOCATION (t
, loc
);
5238 /* Like PROTECTED_SET_EXPR_LOCATION, but only do that if T has
5239 UNKNOWN_LOCATION. */
5242 protected_set_expr_location_if_unset (tree t
, location_t loc
)
5244 t
= expr_single (t
);
5245 if (t
&& !EXPR_HAS_LOCATION (t
))
5246 protected_set_expr_location (t
, loc
);
5249 /* Data used when collecting DECLs and TYPEs for language data removal. */
5251 class free_lang_data_d
5254 free_lang_data_d () : decls (100), types (100) {}
5256 /* Worklist to avoid excessive recursion. */
5257 auto_vec
<tree
> worklist
;
5259 /* Set of traversed objects. Used to avoid duplicate visits. */
5260 hash_set
<tree
> pset
;
5262 /* Array of symbols to process with free_lang_data_in_decl. */
5263 auto_vec
<tree
> decls
;
5265 /* Array of types to process with free_lang_data_in_type. */
5266 auto_vec
<tree
> types
;
5270 /* Add type or decl T to one of the list of tree nodes that need their
5271 language data removed. The lists are held inside FLD. */
5274 add_tree_to_fld_list (tree t
, class free_lang_data_d
*fld
)
5277 fld
->decls
.safe_push (t
);
5278 else if (TYPE_P (t
))
5279 fld
->types
.safe_push (t
);
5284 /* Push tree node T into FLD->WORKLIST. */
5287 fld_worklist_push (tree t
, class free_lang_data_d
*fld
)
5289 if (t
&& !is_lang_specific (t
) && !fld
->pset
.contains (t
))
5290 fld
->worklist
.safe_push ((t
));
5295 /* Return simplified TYPE_NAME of TYPE. */
5298 fld_simplified_type_name (tree type
)
5300 if (!TYPE_NAME (type
) || TREE_CODE (TYPE_NAME (type
)) != TYPE_DECL
)
5301 return TYPE_NAME (type
);
5302 /* Drop TYPE_DECLs in TYPE_NAME in favor of the identifier in the
5303 TYPE_DECL if the type doesn't have linkage.
5304 this must match fld_ */
5305 if (type
!= TYPE_MAIN_VARIANT (type
)
5306 || (!DECL_ASSEMBLER_NAME_SET_P (TYPE_NAME (type
))
5307 && (TREE_CODE (type
) != RECORD_TYPE
5308 || !TYPE_BINFO (type
)
5309 || !BINFO_VTABLE (TYPE_BINFO (type
)))))
5310 return DECL_NAME (TYPE_NAME (type
));
5311 return TYPE_NAME (type
);
5314 /* Do same comparsion as check_qualified_type skipping lang part of type
5315 and be more permissive about type names: we only care that names are
5316 same (for diagnostics) and that ODR names are the same.
5317 If INNER_TYPE is non-NULL, be sure that TREE_TYPE match it. */
5320 fld_type_variant_equal_p (tree t
, tree v
, tree inner_type
)
5322 if (TYPE_QUALS (t
) != TYPE_QUALS (v
)
5323 /* We want to match incomplete variants with complete types.
5324 In this case we need to ignore alignment. */
5325 || ((!RECORD_OR_UNION_TYPE_P (t
) || COMPLETE_TYPE_P (v
))
5326 && (TYPE_ALIGN (t
) != TYPE_ALIGN (v
)
5327 || TYPE_USER_ALIGN (t
) != TYPE_USER_ALIGN (v
)))
5328 || fld_simplified_type_name (t
) != fld_simplified_type_name (v
)
5329 || !attribute_list_equal (TYPE_ATTRIBUTES (t
),
5330 TYPE_ATTRIBUTES (v
))
5331 || (inner_type
&& TREE_TYPE (v
) != inner_type
))
5337 /* Find variant of FIRST that match T and create new one if necessary.
5338 Set TREE_TYPE to INNER_TYPE if non-NULL. */
5341 fld_type_variant (tree first
, tree t
, class free_lang_data_d
*fld
,
5342 tree inner_type
= NULL
)
5344 if (first
== TYPE_MAIN_VARIANT (t
))
5346 for (tree v
= first
; v
; v
= TYPE_NEXT_VARIANT (v
))
5347 if (fld_type_variant_equal_p (t
, v
, inner_type
))
5349 tree v
= build_variant_type_copy (first
);
5350 TYPE_READONLY (v
) = TYPE_READONLY (t
);
5351 TYPE_VOLATILE (v
) = TYPE_VOLATILE (t
);
5352 TYPE_ATOMIC (v
) = TYPE_ATOMIC (t
);
5353 TYPE_RESTRICT (v
) = TYPE_RESTRICT (t
);
5354 TYPE_ADDR_SPACE (v
) = TYPE_ADDR_SPACE (t
);
5355 TYPE_NAME (v
) = TYPE_NAME (t
);
5356 TYPE_ATTRIBUTES (v
) = TYPE_ATTRIBUTES (t
);
5357 TYPE_CANONICAL (v
) = TYPE_CANONICAL (t
);
5358 /* Variants of incomplete types should have alignment
5359 set to BITS_PER_UNIT. Do not copy the actual alignment. */
5360 if (!RECORD_OR_UNION_TYPE_P (v
) || COMPLETE_TYPE_P (v
))
5362 SET_TYPE_ALIGN (v
, TYPE_ALIGN (t
));
5363 TYPE_USER_ALIGN (v
) = TYPE_USER_ALIGN (t
);
5366 TREE_TYPE (v
) = inner_type
;
5367 gcc_checking_assert (fld_type_variant_equal_p (t
,v
, inner_type
));
5368 if (!fld
->pset
.add (v
))
5369 add_tree_to_fld_list (v
, fld
);
5373 /* Map complete types to incomplete types. */
5375 static hash_map
<tree
, tree
> *fld_incomplete_types
;
5377 /* Map types to simplified types. */
5379 static hash_map
<tree
, tree
> *fld_simplified_types
;
5381 /* Produce variant of T whose TREE_TYPE is T2. If it is main variant,
5382 use MAP to prevent duplicates. */
5385 fld_process_array_type (tree t
, tree t2
, hash_map
<tree
, tree
> *map
,
5386 class free_lang_data_d
*fld
)
5388 if (TREE_TYPE (t
) == t2
)
5391 if (TYPE_MAIN_VARIANT (t
) != t
)
5393 return fld_type_variant
5394 (fld_process_array_type (TYPE_MAIN_VARIANT (t
),
5395 TYPE_MAIN_VARIANT (t2
), map
, fld
),
5401 = map
->get_or_insert (t
, &existed
);
5405 = build_array_type_1 (t2
, TYPE_DOMAIN (t
), TYPE_TYPELESS_STORAGE (t
),
5407 TYPE_CANONICAL (array
) = TYPE_CANONICAL (t
);
5408 if (!fld
->pset
.add (array
))
5409 add_tree_to_fld_list (array
, fld
);
5414 /* Return CTX after removal of contexts that are not relevant */
5417 fld_decl_context (tree ctx
)
5419 /* Variably modified types are needed for tree_is_indexable to decide
5420 whether the type needs to go to local or global section.
5421 This code is semi-broken but for now it is easiest to keep contexts
5423 if (ctx
&& TYPE_P (ctx
)
5424 && !variably_modified_type_p (ctx
, NULL_TREE
))
5426 while (ctx
&& TYPE_P (ctx
))
5427 ctx
= TYPE_CONTEXT (ctx
);
5432 /* For T being aggregate type try to turn it into a incomplete variant.
5433 Return T if no simplification is possible. */
5436 fld_incomplete_type_of (tree t
, class free_lang_data_d
*fld
)
5440 if (POINTER_TYPE_P (t
))
5442 tree t2
= fld_incomplete_type_of (TREE_TYPE (t
), fld
);
5443 if (t2
!= TREE_TYPE (t
))
5446 if (TREE_CODE (t
) == POINTER_TYPE
)
5447 first
= build_pointer_type_for_mode (t2
, TYPE_MODE (t
),
5448 TYPE_REF_CAN_ALIAS_ALL (t
));
5450 first
= build_reference_type_for_mode (t2
, TYPE_MODE (t
),
5451 TYPE_REF_CAN_ALIAS_ALL (t
));
5452 gcc_assert (TYPE_CANONICAL (t2
) != t2
5453 && TYPE_CANONICAL (t2
) == TYPE_CANONICAL (TREE_TYPE (t
)));
5454 if (!fld
->pset
.add (first
))
5455 add_tree_to_fld_list (first
, fld
);
5456 return fld_type_variant (first
, t
, fld
);
5460 if (TREE_CODE (t
) == ARRAY_TYPE
)
5461 return fld_process_array_type (t
,
5462 fld_incomplete_type_of (TREE_TYPE (t
), fld
),
5463 fld_incomplete_types
, fld
);
5464 if ((!RECORD_OR_UNION_TYPE_P (t
) && TREE_CODE (t
) != ENUMERAL_TYPE
)
5465 || !COMPLETE_TYPE_P (t
))
5467 if (TYPE_MAIN_VARIANT (t
) == t
)
5471 = fld_incomplete_types
->get_or_insert (t
, &existed
);
5475 copy
= build_distinct_type_copy (t
);
5477 /* It is possible that type was not seen by free_lang_data yet. */
5478 if (!fld
->pset
.add (copy
))
5479 add_tree_to_fld_list (copy
, fld
);
5480 TYPE_SIZE (copy
) = NULL
;
5481 TYPE_USER_ALIGN (copy
) = 0;
5482 TYPE_SIZE_UNIT (copy
) = NULL
;
5483 TYPE_CANONICAL (copy
) = TYPE_CANONICAL (t
);
5484 TREE_ADDRESSABLE (copy
) = 0;
5485 if (AGGREGATE_TYPE_P (t
))
5487 SET_TYPE_MODE (copy
, VOIDmode
);
5488 SET_TYPE_ALIGN (copy
, BITS_PER_UNIT
);
5489 TYPE_TYPELESS_STORAGE (copy
) = 0;
5490 TYPE_FIELDS (copy
) = NULL
;
5491 TYPE_BINFO (copy
) = NULL
;
5492 TYPE_FINAL_P (copy
) = 0;
5493 TYPE_EMPTY_P (copy
) = 0;
5497 TYPE_VALUES (copy
) = NULL
;
5498 ENUM_IS_OPAQUE (copy
) = 0;
5499 ENUM_IS_SCOPED (copy
) = 0;
5502 /* Build copy of TYPE_DECL in TYPE_NAME if necessary.
5503 This is needed for ODR violation warnings to come out right (we
5504 want duplicate TYPE_DECLs whenever the type is duplicated because
5505 of ODR violation. Because lang data in the TYPE_DECL may not
5506 have been freed yet, rebuild it from scratch and copy relevant
5508 TYPE_NAME (copy
) = fld_simplified_type_name (copy
);
5509 tree name
= TYPE_NAME (copy
);
5511 if (name
&& TREE_CODE (name
) == TYPE_DECL
)
5513 gcc_checking_assert (TREE_TYPE (name
) == t
);
5514 tree name2
= build_decl (DECL_SOURCE_LOCATION (name
), TYPE_DECL
,
5515 DECL_NAME (name
), copy
);
5516 if (DECL_ASSEMBLER_NAME_SET_P (name
))
5517 SET_DECL_ASSEMBLER_NAME (name2
, DECL_ASSEMBLER_NAME (name
));
5518 SET_DECL_ALIGN (name2
, 0);
5519 DECL_CONTEXT (name2
) = fld_decl_context
5520 (DECL_CONTEXT (name
));
5521 TYPE_NAME (copy
) = name2
;
5526 return (fld_type_variant
5527 (fld_incomplete_type_of (TYPE_MAIN_VARIANT (t
), fld
), t
, fld
));
5530 /* Simplify type T for scenarios where we do not need complete pointer
5534 fld_simplified_type (tree t
, class free_lang_data_d
*fld
)
5538 if (POINTER_TYPE_P (t
))
5539 return fld_incomplete_type_of (t
, fld
);
5540 /* FIXME: This triggers verification error, see PR88140. */
5541 if (TREE_CODE (t
) == ARRAY_TYPE
&& 0)
5542 return fld_process_array_type (t
, fld_simplified_type (TREE_TYPE (t
), fld
),
5543 fld_simplified_types
, fld
);
5547 /* Reset the expression *EXPR_P, a size or position.
5549 ??? We could reset all non-constant sizes or positions. But it's cheap
5550 enough to not do so and refrain from adding workarounds to dwarf2out.c.
5552 We need to reset self-referential sizes or positions because they cannot
5553 be gimplified and thus can contain a CALL_EXPR after the gimplification
5554 is finished, which will run afoul of LTO streaming. And they need to be
5555 reset to something essentially dummy but not constant, so as to preserve
5556 the properties of the object they are attached to. */
5559 free_lang_data_in_one_sizepos (tree
*expr_p
)
5561 tree expr
= *expr_p
;
5562 if (CONTAINS_PLACEHOLDER_P (expr
))
5563 *expr_p
= build0 (PLACEHOLDER_EXPR
, TREE_TYPE (expr
));
5567 /* Reset all the fields in a binfo node BINFO. We only keep
5568 BINFO_VTABLE, which is used by gimple_fold_obj_type_ref. */
5571 free_lang_data_in_binfo (tree binfo
)
5576 gcc_assert (TREE_CODE (binfo
) == TREE_BINFO
);
5578 BINFO_VIRTUALS (binfo
) = NULL_TREE
;
5579 BINFO_BASE_ACCESSES (binfo
) = NULL
;
5580 BINFO_INHERITANCE_CHAIN (binfo
) = NULL_TREE
;
5581 BINFO_SUBVTT_INDEX (binfo
) = NULL_TREE
;
5582 BINFO_VPTR_FIELD (binfo
) = NULL_TREE
;
5583 TREE_PUBLIC (binfo
) = 0;
5585 FOR_EACH_VEC_ELT (*BINFO_BASE_BINFOS (binfo
), i
, t
)
5586 free_lang_data_in_binfo (t
);
5590 /* Reset all language specific information still present in TYPE. */
5593 free_lang_data_in_type (tree type
, class free_lang_data_d
*fld
)
5595 gcc_assert (TYPE_P (type
));
5597 /* Give the FE a chance to remove its own data first. */
5598 lang_hooks
.free_lang_data (type
);
5600 TREE_LANG_FLAG_0 (type
) = 0;
5601 TREE_LANG_FLAG_1 (type
) = 0;
5602 TREE_LANG_FLAG_2 (type
) = 0;
5603 TREE_LANG_FLAG_3 (type
) = 0;
5604 TREE_LANG_FLAG_4 (type
) = 0;
5605 TREE_LANG_FLAG_5 (type
) = 0;
5606 TREE_LANG_FLAG_6 (type
) = 0;
5608 TYPE_NEEDS_CONSTRUCTING (type
) = 0;
5610 /* Purge non-marked variants from the variants chain, so that they
5611 don't reappear in the IL after free_lang_data. */
5612 while (TYPE_NEXT_VARIANT (type
)
5613 && !fld
->pset
.contains (TYPE_NEXT_VARIANT (type
)))
5615 tree t
= TYPE_NEXT_VARIANT (type
);
5616 TYPE_NEXT_VARIANT (type
) = TYPE_NEXT_VARIANT (t
);
5617 /* Turn the removed types into distinct types. */
5618 TYPE_MAIN_VARIANT (t
) = t
;
5619 TYPE_NEXT_VARIANT (t
) = NULL_TREE
;
5622 if (TREE_CODE (type
) == FUNCTION_TYPE
)
5624 TREE_TYPE (type
) = fld_simplified_type (TREE_TYPE (type
), fld
);
5625 /* Remove the const and volatile qualifiers from arguments. The
5626 C++ front end removes them, but the C front end does not,
5627 leading to false ODR violation errors when merging two
5628 instances of the same function signature compiled by
5629 different front ends. */
5630 for (tree p
= TYPE_ARG_TYPES (type
); p
; p
= TREE_CHAIN (p
))
5632 TREE_VALUE (p
) = fld_simplified_type (TREE_VALUE (p
), fld
);
5633 tree arg_type
= TREE_VALUE (p
);
5635 if (TYPE_READONLY (arg_type
) || TYPE_VOLATILE (arg_type
))
5637 int quals
= TYPE_QUALS (arg_type
)
5639 & ~TYPE_QUAL_VOLATILE
;
5640 TREE_VALUE (p
) = build_qualified_type (arg_type
, quals
);
5641 if (!fld
->pset
.add (TREE_VALUE (p
)))
5642 free_lang_data_in_type (TREE_VALUE (p
), fld
);
5644 /* C++ FE uses TREE_PURPOSE to store initial values. */
5645 TREE_PURPOSE (p
) = NULL
;
5648 else if (TREE_CODE (type
) == METHOD_TYPE
)
5650 TREE_TYPE (type
) = fld_simplified_type (TREE_TYPE (type
), fld
);
5651 for (tree p
= TYPE_ARG_TYPES (type
); p
; p
= TREE_CHAIN (p
))
5653 /* C++ FE uses TREE_PURPOSE to store initial values. */
5654 TREE_VALUE (p
) = fld_simplified_type (TREE_VALUE (p
), fld
);
5655 TREE_PURPOSE (p
) = NULL
;
5658 else if (RECORD_OR_UNION_TYPE_P (type
))
5660 /* Remove members that are not FIELD_DECLs from the field list
5661 of an aggregate. These occur in C++. */
5662 for (tree
*prev
= &TYPE_FIELDS (type
), member
; (member
= *prev
);)
5663 if (TREE_CODE (member
) == FIELD_DECL
)
5664 prev
= &DECL_CHAIN (member
);
5666 *prev
= DECL_CHAIN (member
);
5668 TYPE_VFIELD (type
) = NULL_TREE
;
5670 if (TYPE_BINFO (type
))
5672 free_lang_data_in_binfo (TYPE_BINFO (type
));
5673 /* We need to preserve link to bases and virtual table for all
5674 polymorphic types to make devirtualization machinery working. */
5675 if (!BINFO_VTABLE (TYPE_BINFO (type
)))
5676 TYPE_BINFO (type
) = NULL
;
5679 else if (INTEGRAL_TYPE_P (type
)
5680 || SCALAR_FLOAT_TYPE_P (type
)
5681 || FIXED_POINT_TYPE_P (type
))
5683 if (TREE_CODE (type
) == ENUMERAL_TYPE
)
5685 ENUM_IS_OPAQUE (type
) = 0;
5686 ENUM_IS_SCOPED (type
) = 0;
5687 /* Type values are used only for C++ ODR checking. Drop them
5688 for all type variants and non-ODR types.
5689 For ODR types the data is freed in free_odr_warning_data. */
5690 if (!TYPE_VALUES (type
))
5692 else if (TYPE_MAIN_VARIANT (type
) != type
5693 || !type_with_linkage_p (type
)
5694 || type_in_anonymous_namespace_p (type
))
5695 TYPE_VALUES (type
) = NULL
;
5697 register_odr_enum (type
);
5699 free_lang_data_in_one_sizepos (&TYPE_MIN_VALUE (type
));
5700 free_lang_data_in_one_sizepos (&TYPE_MAX_VALUE (type
));
5703 TYPE_LANG_SLOT_1 (type
) = NULL_TREE
;
5705 free_lang_data_in_one_sizepos (&TYPE_SIZE (type
));
5706 free_lang_data_in_one_sizepos (&TYPE_SIZE_UNIT (type
));
5708 if (TYPE_CONTEXT (type
)
5709 && TREE_CODE (TYPE_CONTEXT (type
)) == BLOCK
)
5711 tree ctx
= TYPE_CONTEXT (type
);
5714 ctx
= BLOCK_SUPERCONTEXT (ctx
);
5716 while (ctx
&& TREE_CODE (ctx
) == BLOCK
);
5717 TYPE_CONTEXT (type
) = ctx
;
5720 TYPE_STUB_DECL (type
) = NULL
;
5721 TYPE_NAME (type
) = fld_simplified_type_name (type
);
5725 /* Return true if DECL may need an assembler name to be set. */
5728 need_assembler_name_p (tree decl
)
5730 /* We use DECL_ASSEMBLER_NAME to hold mangled type names for One Definition
5731 Rule merging. This makes type_odr_p to return true on those types during
5732 LTO and by comparing the mangled name, we can say what types are intended
5733 to be equivalent across compilation unit.
5735 We do not store names of type_in_anonymous_namespace_p.
5737 Record, union and enumeration type have linkage that allows use
5738 to check type_in_anonymous_namespace_p. We do not mangle compound types
5739 that always can be compared structurally.
5741 Similarly for builtin types, we compare properties of their main variant.
5742 A special case are integer types where mangling do make differences
5743 between char/signed char/unsigned char etc. Storing name for these makes
5744 e.g. -fno-signed-char/-fsigned-char mismatches to be handled well.
5745 See cp/mangle.c:write_builtin_type for details. */
5747 if (TREE_CODE (decl
) == TYPE_DECL
)
5749 if (DECL_NAME (decl
)
5750 && decl
== TYPE_NAME (TREE_TYPE (decl
))
5751 && TYPE_MAIN_VARIANT (TREE_TYPE (decl
)) == TREE_TYPE (decl
)
5752 && !TYPE_ARTIFICIAL (TREE_TYPE (decl
))
5753 && ((TREE_CODE (TREE_TYPE (decl
)) != RECORD_TYPE
5754 && TREE_CODE (TREE_TYPE (decl
)) != UNION_TYPE
)
5755 || TYPE_CXX_ODR_P (TREE_TYPE (decl
)))
5756 && (type_with_linkage_p (TREE_TYPE (decl
))
5757 || TREE_CODE (TREE_TYPE (decl
)) == INTEGER_TYPE
)
5758 && !variably_modified_type_p (TREE_TYPE (decl
), NULL_TREE
))
5759 return !DECL_ASSEMBLER_NAME_SET_P (decl
);
5762 /* Only FUNCTION_DECLs and VAR_DECLs are considered. */
5763 if (!VAR_OR_FUNCTION_DECL_P (decl
))
5766 /* If DECL already has its assembler name set, it does not need a
5768 if (!HAS_DECL_ASSEMBLER_NAME_P (decl
)
5769 || DECL_ASSEMBLER_NAME_SET_P (decl
))
5772 /* Abstract decls do not need an assembler name. */
5773 if (DECL_ABSTRACT_P (decl
))
5776 /* For VAR_DECLs, only static, public and external symbols need an
5779 && !TREE_STATIC (decl
)
5780 && !TREE_PUBLIC (decl
)
5781 && !DECL_EXTERNAL (decl
))
5784 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5786 /* Do not set assembler name on builtins. Allow RTL expansion to
5787 decide whether to expand inline or via a regular call. */
5788 if (fndecl_built_in_p (decl
)
5789 && DECL_BUILT_IN_CLASS (decl
) != BUILT_IN_FRONTEND
)
5792 /* Functions represented in the callgraph need an assembler name. */
5793 if (cgraph_node::get (decl
) != NULL
)
5796 /* Unused and not public functions don't need an assembler name. */
5797 if (!TREE_USED (decl
) && !TREE_PUBLIC (decl
))
5805 /* Reset all language specific information still present in symbol
5809 free_lang_data_in_decl (tree decl
, class free_lang_data_d
*fld
)
5811 gcc_assert (DECL_P (decl
));
5813 /* Give the FE a chance to remove its own data first. */
5814 lang_hooks
.free_lang_data (decl
);
5816 TREE_LANG_FLAG_0 (decl
) = 0;
5817 TREE_LANG_FLAG_1 (decl
) = 0;
5818 TREE_LANG_FLAG_2 (decl
) = 0;
5819 TREE_LANG_FLAG_3 (decl
) = 0;
5820 TREE_LANG_FLAG_4 (decl
) = 0;
5821 TREE_LANG_FLAG_5 (decl
) = 0;
5822 TREE_LANG_FLAG_6 (decl
) = 0;
5824 free_lang_data_in_one_sizepos (&DECL_SIZE (decl
));
5825 free_lang_data_in_one_sizepos (&DECL_SIZE_UNIT (decl
));
5826 if (TREE_CODE (decl
) == FIELD_DECL
)
5828 DECL_FCONTEXT (decl
) = NULL
;
5829 free_lang_data_in_one_sizepos (&DECL_FIELD_OFFSET (decl
));
5830 if (TREE_CODE (DECL_CONTEXT (decl
)) == QUAL_UNION_TYPE
)
5831 DECL_QUALIFIER (decl
) = NULL_TREE
;
5834 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5836 struct cgraph_node
*node
;
5837 /* Frontends do not set TREE_ADDRESSABLE on public variables even though
5838 the address may be taken in other unit, so this flag has no practical
5841 It would make more sense if frontends set TREE_ADDRESSABLE to 0 only
5842 for public objects that indeed cannot be adressed, but it is not
5843 the case. Set the flag to true so we do not get merge failures for
5844 i.e. virtual tables between units that take address of it and
5845 units that don't. */
5846 if (TREE_PUBLIC (decl
))
5847 TREE_ADDRESSABLE (decl
) = true;
5848 TREE_TYPE (decl
) = fld_simplified_type (TREE_TYPE (decl
), fld
);
5849 if (!(node
= cgraph_node::get (decl
))
5850 || (!node
->definition
&& !node
->clones
))
5853 node
->release_body ();
5856 release_function_body (decl
);
5857 DECL_ARGUMENTS (decl
) = NULL
;
5858 DECL_RESULT (decl
) = NULL
;
5859 DECL_INITIAL (decl
) = error_mark_node
;
5862 if (gimple_has_body_p (decl
) || (node
&& node
->thunk
))
5866 /* If DECL has a gimple body, then the context for its
5867 arguments must be DECL. Otherwise, it doesn't really
5868 matter, as we will not be emitting any code for DECL. In
5869 general, there may be other instances of DECL created by
5870 the front end and since PARM_DECLs are generally shared,
5871 their DECL_CONTEXT changes as the replicas of DECL are
5872 created. The only time where DECL_CONTEXT is important
5873 is for the FUNCTION_DECLs that have a gimple body (since
5874 the PARM_DECL will be used in the function's body). */
5875 for (t
= DECL_ARGUMENTS (decl
); t
; t
= TREE_CHAIN (t
))
5876 DECL_CONTEXT (t
) = decl
;
5877 if (!DECL_FUNCTION_SPECIFIC_TARGET (decl
))
5878 DECL_FUNCTION_SPECIFIC_TARGET (decl
)
5879 = target_option_default_node
;
5880 if (!DECL_FUNCTION_SPECIFIC_OPTIMIZATION (decl
))
5881 DECL_FUNCTION_SPECIFIC_OPTIMIZATION (decl
)
5882 = optimization_default_node
;
5885 /* DECL_SAVED_TREE holds the GENERIC representation for DECL.
5886 At this point, it is not needed anymore. */
5887 DECL_SAVED_TREE (decl
) = NULL_TREE
;
5889 /* Clear the abstract origin if it refers to a method.
5890 Otherwise dwarf2out.c will ICE as we splice functions out of
5891 TYPE_FIELDS and thus the origin will not be output
5893 if (DECL_ABSTRACT_ORIGIN (decl
)
5894 && DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))
5895 && RECORD_OR_UNION_TYPE_P
5896 (DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))))
5897 DECL_ABSTRACT_ORIGIN (decl
) = NULL_TREE
;
5899 DECL_VINDEX (decl
) = NULL_TREE
;
5901 else if (VAR_P (decl
))
5903 /* See comment above why we set the flag for functions. */
5904 if (TREE_PUBLIC (decl
))
5905 TREE_ADDRESSABLE (decl
) = true;
5906 if ((DECL_EXTERNAL (decl
)
5907 && (!TREE_STATIC (decl
) || !TREE_READONLY (decl
)))
5908 || (decl_function_context (decl
) && !TREE_STATIC (decl
)))
5909 DECL_INITIAL (decl
) = NULL_TREE
;
5911 else if (TREE_CODE (decl
) == TYPE_DECL
)
5913 DECL_VISIBILITY (decl
) = VISIBILITY_DEFAULT
;
5914 DECL_VISIBILITY_SPECIFIED (decl
) = 0;
5915 TREE_PUBLIC (decl
) = 0;
5916 TREE_PRIVATE (decl
) = 0;
5917 DECL_ARTIFICIAL (decl
) = 0;
5918 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 0;
5919 DECL_INITIAL (decl
) = NULL_TREE
;
5920 DECL_ORIGINAL_TYPE (decl
) = NULL_TREE
;
5921 DECL_MODE (decl
) = VOIDmode
;
5922 SET_DECL_ALIGN (decl
, 0);
5923 /* TREE_TYPE is cleared at WPA time in free_odr_warning_data. */
5925 else if (TREE_CODE (decl
) == FIELD_DECL
)
5927 TREE_TYPE (decl
) = fld_simplified_type (TREE_TYPE (decl
), fld
);
5928 DECL_INITIAL (decl
) = NULL_TREE
;
5930 else if (TREE_CODE (decl
) == TRANSLATION_UNIT_DECL
5931 && DECL_INITIAL (decl
)
5932 && TREE_CODE (DECL_INITIAL (decl
)) == BLOCK
)
5934 /* Strip builtins from the translation-unit BLOCK. We still have targets
5935 without builtin_decl_explicit support and also builtins are shared
5936 nodes and thus we can't use TREE_CHAIN in multiple lists. */
5937 tree
*nextp
= &BLOCK_VARS (DECL_INITIAL (decl
));
5941 if (TREE_CODE (var
) == FUNCTION_DECL
5942 && fndecl_built_in_p (var
))
5943 *nextp
= TREE_CHAIN (var
);
5945 nextp
= &TREE_CHAIN (var
);
5948 /* We need to keep field decls associated with their trees. Otherwise tree
5949 merging may merge some fileds and keep others disjoint wich in turn will
5950 not do well with TREE_CHAIN pointers linking them.
5952 Also do not drop containing types for virtual methods and tables because
5953 these are needed by devirtualization.
5954 C++ destructors are special because C++ frontends sometimes produces
5955 virtual destructor as an alias of non-virtual destructor. In
5956 devirutalization code we always walk through aliases and we need
5957 context to be preserved too. See PR89335 */
5958 if (TREE_CODE (decl
) != FIELD_DECL
5959 && ((TREE_CODE (decl
) != VAR_DECL
&& TREE_CODE (decl
) != FUNCTION_DECL
)
5960 || (!DECL_VIRTUAL_P (decl
)
5961 && (TREE_CODE (decl
) != FUNCTION_DECL
5962 || !DECL_CXX_DESTRUCTOR_P (decl
)))))
5963 DECL_CONTEXT (decl
) = fld_decl_context (DECL_CONTEXT (decl
));
5967 /* Operand callback helper for free_lang_data_in_node. *TP is the
5968 subtree operand being considered. */
5971 find_decls_types_r (tree
*tp
, int *ws
, void *data
)
5974 class free_lang_data_d
*fld
= (class free_lang_data_d
*) data
;
5976 if (TREE_CODE (t
) == TREE_LIST
)
5979 /* Language specific nodes will be removed, so there is no need
5980 to gather anything under them. */
5981 if (is_lang_specific (t
))
5989 /* Note that walk_tree does not traverse every possible field in
5990 decls, so we have to do our own traversals here. */
5991 add_tree_to_fld_list (t
, fld
);
5993 fld_worklist_push (DECL_NAME (t
), fld
);
5994 fld_worklist_push (DECL_CONTEXT (t
), fld
);
5995 fld_worklist_push (DECL_SIZE (t
), fld
);
5996 fld_worklist_push (DECL_SIZE_UNIT (t
), fld
);
5998 /* We are going to remove everything under DECL_INITIAL for
5999 TYPE_DECLs. No point walking them. */
6000 if (TREE_CODE (t
) != TYPE_DECL
)
6001 fld_worklist_push (DECL_INITIAL (t
), fld
);
6003 fld_worklist_push (DECL_ATTRIBUTES (t
), fld
);
6004 fld_worklist_push (DECL_ABSTRACT_ORIGIN (t
), fld
);
6006 if (TREE_CODE (t
) == FUNCTION_DECL
)
6008 fld_worklist_push (DECL_ARGUMENTS (t
), fld
);
6009 fld_worklist_push (DECL_RESULT (t
), fld
);
6011 else if (TREE_CODE (t
) == FIELD_DECL
)
6013 fld_worklist_push (DECL_FIELD_OFFSET (t
), fld
);
6014 fld_worklist_push (DECL_BIT_FIELD_TYPE (t
), fld
);
6015 fld_worklist_push (DECL_FIELD_BIT_OFFSET (t
), fld
);
6016 fld_worklist_push (DECL_FCONTEXT (t
), fld
);
6019 if ((VAR_P (t
) || TREE_CODE (t
) == PARM_DECL
)
6020 && DECL_HAS_VALUE_EXPR_P (t
))
6021 fld_worklist_push (DECL_VALUE_EXPR (t
), fld
);
6023 if (TREE_CODE (t
) != FIELD_DECL
6024 && TREE_CODE (t
) != TYPE_DECL
)
6025 fld_worklist_push (TREE_CHAIN (t
), fld
);
6028 else if (TYPE_P (t
))
6030 /* Note that walk_tree does not traverse every possible field in
6031 types, so we have to do our own traversals here. */
6032 add_tree_to_fld_list (t
, fld
);
6034 if (!RECORD_OR_UNION_TYPE_P (t
))
6035 fld_worklist_push (TYPE_CACHED_VALUES (t
), fld
);
6036 fld_worklist_push (TYPE_SIZE (t
), fld
);
6037 fld_worklist_push (TYPE_SIZE_UNIT (t
), fld
);
6038 fld_worklist_push (TYPE_ATTRIBUTES (t
), fld
);
6039 fld_worklist_push (TYPE_POINTER_TO (t
), fld
);
6040 fld_worklist_push (TYPE_REFERENCE_TO (t
), fld
);
6041 fld_worklist_push (TYPE_NAME (t
), fld
);
6042 /* While we do not stream TYPE_POINTER_TO and TYPE_REFERENCE_TO
6043 lists, we may look types up in these lists and use them while
6044 optimizing the function body. Thus we need to free lang data
6046 if (TREE_CODE (t
) == POINTER_TYPE
)
6047 fld_worklist_push (TYPE_NEXT_PTR_TO (t
), fld
);
6048 if (TREE_CODE (t
) == REFERENCE_TYPE
)
6049 fld_worklist_push (TYPE_NEXT_REF_TO (t
), fld
);
6050 if (!POINTER_TYPE_P (t
))
6051 fld_worklist_push (TYPE_MIN_VALUE_RAW (t
), fld
);
6052 /* TYPE_MAX_VALUE_RAW is TYPE_BINFO for record types. */
6053 if (!RECORD_OR_UNION_TYPE_P (t
))
6054 fld_worklist_push (TYPE_MAX_VALUE_RAW (t
), fld
);
6055 fld_worklist_push (TYPE_MAIN_VARIANT (t
), fld
);
6056 /* Do not walk TYPE_NEXT_VARIANT. We do not stream it and thus
6057 do not and want not to reach unused variants this way. */
6058 if (TYPE_CONTEXT (t
))
6060 tree ctx
= TYPE_CONTEXT (t
);
6061 /* We adjust BLOCK TYPE_CONTEXTs to the innermost non-BLOCK one.
6062 So push that instead. */
6063 while (ctx
&& TREE_CODE (ctx
) == BLOCK
)
6064 ctx
= BLOCK_SUPERCONTEXT (ctx
);
6065 fld_worklist_push (ctx
, fld
);
6067 fld_worklist_push (TYPE_CANONICAL (t
), fld
);
6069 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_BINFO (t
))
6073 FOR_EACH_VEC_ELT (*BINFO_BASE_BINFOS (TYPE_BINFO (t
)), i
, tem
)
6074 fld_worklist_push (TREE_TYPE (tem
), fld
);
6075 fld_worklist_push (BINFO_TYPE (TYPE_BINFO (t
)), fld
);
6076 fld_worklist_push (BINFO_VTABLE (TYPE_BINFO (t
)), fld
);
6078 if (RECORD_OR_UNION_TYPE_P (t
))
6081 /* Push all TYPE_FIELDS - there can be interleaving interesting
6082 and non-interesting things. */
6083 tem
= TYPE_FIELDS (t
);
6086 if (TREE_CODE (tem
) == FIELD_DECL
)
6087 fld_worklist_push (tem
, fld
);
6088 tem
= TREE_CHAIN (tem
);
6091 if (FUNC_OR_METHOD_TYPE_P (t
))
6092 fld_worklist_push (TYPE_METHOD_BASETYPE (t
), fld
);
6094 fld_worklist_push (TYPE_STUB_DECL (t
), fld
);
6097 else if (TREE_CODE (t
) == BLOCK
)
6099 for (tree
*tem
= &BLOCK_VARS (t
); *tem
; )
6101 if (TREE_CODE (*tem
) != LABEL_DECL
6102 && (TREE_CODE (*tem
) != VAR_DECL
6103 || !auto_var_in_fn_p (*tem
, DECL_CONTEXT (*tem
))))
6105 gcc_assert (TREE_CODE (*tem
) != RESULT_DECL
6106 && TREE_CODE (*tem
) != PARM_DECL
);
6107 *tem
= TREE_CHAIN (*tem
);
6111 fld_worklist_push (*tem
, fld
);
6112 tem
= &TREE_CHAIN (*tem
);
6115 for (tree tem
= BLOCK_SUBBLOCKS (t
); tem
; tem
= BLOCK_CHAIN (tem
))
6116 fld_worklist_push (tem
, fld
);
6117 fld_worklist_push (BLOCK_ABSTRACT_ORIGIN (t
), fld
);
6120 if (TREE_CODE (t
) != IDENTIFIER_NODE
6121 && CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_TYPED
))
6122 fld_worklist_push (TREE_TYPE (t
), fld
);
6128 /* Find decls and types in T. */
6131 find_decls_types (tree t
, class free_lang_data_d
*fld
)
6135 if (!fld
->pset
.contains (t
))
6136 walk_tree (&t
, find_decls_types_r
, fld
, &fld
->pset
);
6137 if (fld
->worklist
.is_empty ())
6139 t
= fld
->worklist
.pop ();
6143 /* Translate all the types in LIST with the corresponding runtime
6147 get_eh_types_for_runtime (tree list
)
6151 if (list
== NULL_TREE
)
6154 head
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
6156 list
= TREE_CHAIN (list
);
6159 tree n
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
6160 TREE_CHAIN (prev
) = n
;
6161 prev
= TREE_CHAIN (prev
);
6162 list
= TREE_CHAIN (list
);
6169 /* Find decls and types referenced in EH region R and store them in
6170 FLD->DECLS and FLD->TYPES. */
6173 find_decls_types_in_eh_region (eh_region r
, class free_lang_data_d
*fld
)
6184 /* The types referenced in each catch must first be changed to the
6185 EH types used at runtime. This removes references to FE types
6187 for (c
= r
->u
.eh_try
.first_catch
; c
; c
= c
->next_catch
)
6189 c
->type_list
= get_eh_types_for_runtime (c
->type_list
);
6190 walk_tree (&c
->type_list
, find_decls_types_r
, fld
, &fld
->pset
);
6195 case ERT_ALLOWED_EXCEPTIONS
:
6196 r
->u
.allowed
.type_list
6197 = get_eh_types_for_runtime (r
->u
.allowed
.type_list
);
6198 walk_tree (&r
->u
.allowed
.type_list
, find_decls_types_r
, fld
, &fld
->pset
);
6201 case ERT_MUST_NOT_THROW
:
6202 walk_tree (&r
->u
.must_not_throw
.failure_decl
,
6203 find_decls_types_r
, fld
, &fld
->pset
);
6209 /* Find decls and types referenced in cgraph node N and store them in
6210 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
6211 look for *every* kind of DECL and TYPE node reachable from N,
6212 including those embedded inside types and decls (i.e,, TYPE_DECLs,
6213 NAMESPACE_DECLs, etc). */
6216 find_decls_types_in_node (struct cgraph_node
*n
, class free_lang_data_d
*fld
)
6219 struct function
*fn
;
6223 find_decls_types (n
->decl
, fld
);
6225 if (!gimple_has_body_p (n
->decl
))
6228 gcc_assert (current_function_decl
== NULL_TREE
&& cfun
== NULL
);
6230 fn
= DECL_STRUCT_FUNCTION (n
->decl
);
6232 /* Traverse locals. */
6233 FOR_EACH_LOCAL_DECL (fn
, ix
, t
)
6234 find_decls_types (t
, fld
);
6236 /* Traverse EH regions in FN. */
6239 FOR_ALL_EH_REGION_FN (r
, fn
)
6240 find_decls_types_in_eh_region (r
, fld
);
6243 /* Traverse every statement in FN. */
6244 FOR_EACH_BB_FN (bb
, fn
)
6247 gimple_stmt_iterator si
;
6250 for (psi
= gsi_start_phis (bb
); !gsi_end_p (psi
); gsi_next (&psi
))
6252 gphi
*phi
= psi
.phi ();
6254 for (i
= 0; i
< gimple_phi_num_args (phi
); i
++)
6256 tree
*arg_p
= gimple_phi_arg_def_ptr (phi
, i
);
6257 find_decls_types (*arg_p
, fld
);
6261 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
6263 gimple
*stmt
= gsi_stmt (si
);
6265 if (is_gimple_call (stmt
))
6266 find_decls_types (gimple_call_fntype (stmt
), fld
);
6268 for (i
= 0; i
< gimple_num_ops (stmt
); i
++)
6270 tree arg
= gimple_op (stmt
, i
);
6271 find_decls_types (arg
, fld
);
6272 /* find_decls_types doesn't walk TREE_PURPOSE of TREE_LISTs,
6273 which we need for asm stmts. */
6275 && TREE_CODE (arg
) == TREE_LIST
6276 && TREE_PURPOSE (arg
)
6277 && gimple_code (stmt
) == GIMPLE_ASM
)
6278 find_decls_types (TREE_PURPOSE (arg
), fld
);
6285 /* Find decls and types referenced in varpool node N and store them in
6286 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
6287 look for *every* kind of DECL and TYPE node reachable from N,
6288 including those embedded inside types and decls (i.e,, TYPE_DECLs,
6289 NAMESPACE_DECLs, etc). */
6292 find_decls_types_in_var (varpool_node
*v
, class free_lang_data_d
*fld
)
6294 find_decls_types (v
->decl
, fld
);
6297 /* If T needs an assembler name, have one created for it. */
6300 assign_assembler_name_if_needed (tree t
)
6302 if (need_assembler_name_p (t
))
6304 /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit
6305 diagnostics that use input_location to show locus
6306 information. The problem here is that, at this point,
6307 input_location is generally anchored to the end of the file
6308 (since the parser is long gone), so we don't have a good
6309 position to pin it to.
6311 To alleviate this problem, this uses the location of T's
6312 declaration. Examples of this are
6313 testsuite/g++.dg/template/cond2.C and
6314 testsuite/g++.dg/template/pr35240.C. */
6315 location_t saved_location
= input_location
;
6316 input_location
= DECL_SOURCE_LOCATION (t
);
6318 decl_assembler_name (t
);
6320 input_location
= saved_location
;
6325 /* Free language specific information for every operand and expression
6326 in every node of the call graph. This process operates in three stages:
6328 1- Every callgraph node and varpool node is traversed looking for
6329 decls and types embedded in them. This is a more exhaustive
6330 search than that done by find_referenced_vars, because it will
6331 also collect individual fields, decls embedded in types, etc.
6333 2- All the decls found are sent to free_lang_data_in_decl.
6335 3- All the types found are sent to free_lang_data_in_type.
6337 The ordering between decls and types is important because
6338 free_lang_data_in_decl sets assembler names, which includes
6339 mangling. So types cannot be freed up until assembler names have
6343 free_lang_data_in_cgraph (class free_lang_data_d
*fld
)
6345 struct cgraph_node
*n
;
6351 /* Find decls and types in the body of every function in the callgraph. */
6352 FOR_EACH_FUNCTION (n
)
6353 find_decls_types_in_node (n
, fld
);
6355 FOR_EACH_VEC_SAFE_ELT (alias_pairs
, i
, p
)
6356 find_decls_types (p
->decl
, fld
);
6358 /* Find decls and types in every varpool symbol. */
6359 FOR_EACH_VARIABLE (v
)
6360 find_decls_types_in_var (v
, fld
);
6362 /* Set the assembler name on every decl found. We need to do this
6363 now because free_lang_data_in_decl will invalidate data needed
6364 for mangling. This breaks mangling on interdependent decls. */
6365 FOR_EACH_VEC_ELT (fld
->decls
, i
, t
)
6366 assign_assembler_name_if_needed (t
);
6368 /* Traverse every decl found freeing its language data. */
6369 FOR_EACH_VEC_ELT (fld
->decls
, i
, t
)
6370 free_lang_data_in_decl (t
, fld
);
6372 /* Traverse every type found freeing its language data. */
6373 FOR_EACH_VEC_ELT (fld
->types
, i
, t
)
6374 free_lang_data_in_type (t
, fld
);
6378 /* Free resources that are used by FE but are not needed once they are done. */
6381 free_lang_data (void)
6384 class free_lang_data_d fld
;
6386 /* If we are the LTO frontend we have freed lang-specific data already. */
6388 || (!flag_generate_lto
&& !flag_generate_offload
))
6390 /* Rebuild type inheritance graph even when not doing LTO to get
6391 consistent profile data. */
6392 rebuild_type_inheritance_graph ();
6396 fld_incomplete_types
= new hash_map
<tree
, tree
>;
6397 fld_simplified_types
= new hash_map
<tree
, tree
>;
6399 /* Provide a dummy TRANSLATION_UNIT_DECL if the FE failed to provide one. */
6400 if (vec_safe_is_empty (all_translation_units
))
6401 build_translation_unit_decl (NULL_TREE
);
6403 /* Allocate and assign alias sets to the standard integer types
6404 while the slots are still in the way the frontends generated them. */
6405 for (i
= 0; i
< itk_none
; ++i
)
6406 if (integer_types
[i
])
6407 TYPE_ALIAS_SET (integer_types
[i
]) = get_alias_set (integer_types
[i
]);
6409 /* Traverse the IL resetting language specific information for
6410 operands, expressions, etc. */
6411 free_lang_data_in_cgraph (&fld
);
6413 /* Create gimple variants for common types. */
6414 for (unsigned i
= 0;
6415 i
< sizeof (builtin_structptr_types
) / sizeof (builtin_structptr_type
);
6417 builtin_structptr_types
[i
].node
= builtin_structptr_types
[i
].base
;
6419 /* Reset some langhooks. Do not reset types_compatible_p, it may
6420 still be used indirectly via the get_alias_set langhook. */
6421 lang_hooks
.dwarf_name
= lhd_dwarf_name
;
6422 lang_hooks
.decl_printable_name
= gimple_decl_printable_name
;
6423 lang_hooks
.gimplify_expr
= lhd_gimplify_expr
;
6424 lang_hooks
.overwrite_decl_assembler_name
= lhd_overwrite_decl_assembler_name
;
6425 lang_hooks
.print_xnode
= lhd_print_tree_nothing
;
6426 lang_hooks
.print_decl
= lhd_print_tree_nothing
;
6427 lang_hooks
.print_type
= lhd_print_tree_nothing
;
6428 lang_hooks
.print_identifier
= lhd_print_tree_nothing
;
6430 lang_hooks
.tree_inlining
.var_mod_type_p
= hook_bool_tree_tree_false
;
6437 FOR_EACH_VEC_ELT (fld
.types
, i
, t
)
6441 /* We do not want the default decl_assembler_name implementation,
6442 rather if we have fixed everything we want a wrapper around it
6443 asserting that all non-local symbols already got their assembler
6444 name and only produce assembler names for local symbols. Or rather
6445 make sure we never call decl_assembler_name on local symbols and
6446 devise a separate, middle-end private scheme for it. */
6448 /* Reset diagnostic machinery. */
6449 tree_diagnostics_defaults (global_dc
);
6451 rebuild_type_inheritance_graph ();
6453 delete fld_incomplete_types
;
6454 delete fld_simplified_types
;
6462 const pass_data pass_data_ipa_free_lang_data
=
6464 SIMPLE_IPA_PASS
, /* type */
6465 "*free_lang_data", /* name */
6466 OPTGROUP_NONE
, /* optinfo_flags */
6467 TV_IPA_FREE_LANG_DATA
, /* tv_id */
6468 0, /* properties_required */
6469 0, /* properties_provided */
6470 0, /* properties_destroyed */
6471 0, /* todo_flags_start */
6472 0, /* todo_flags_finish */
6475 class pass_ipa_free_lang_data
: public simple_ipa_opt_pass
6478 pass_ipa_free_lang_data (gcc::context
*ctxt
)
6479 : simple_ipa_opt_pass (pass_data_ipa_free_lang_data
, ctxt
)
6482 /* opt_pass methods: */
6483 virtual unsigned int execute (function
*) { return free_lang_data (); }
6485 }; // class pass_ipa_free_lang_data
6489 simple_ipa_opt_pass
*
6490 make_pass_ipa_free_lang_data (gcc::context
*ctxt
)
6492 return new pass_ipa_free_lang_data (ctxt
);
6495 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
6496 of the various TYPE_QUAL values. */
6499 set_type_quals (tree type
, int type_quals
)
6501 TYPE_READONLY (type
) = (type_quals
& TYPE_QUAL_CONST
) != 0;
6502 TYPE_VOLATILE (type
) = (type_quals
& TYPE_QUAL_VOLATILE
) != 0;
6503 TYPE_RESTRICT (type
) = (type_quals
& TYPE_QUAL_RESTRICT
) != 0;
6504 TYPE_ATOMIC (type
) = (type_quals
& TYPE_QUAL_ATOMIC
) != 0;
6505 TYPE_ADDR_SPACE (type
) = DECODE_QUAL_ADDR_SPACE (type_quals
);
6508 /* Returns true iff CAND and BASE have equivalent language-specific
6512 check_lang_type (const_tree cand
, const_tree base
)
6514 if (lang_hooks
.types
.type_hash_eq
== NULL
)
6516 /* type_hash_eq currently only applies to these types. */
6517 if (TREE_CODE (cand
) != FUNCTION_TYPE
6518 && TREE_CODE (cand
) != METHOD_TYPE
)
6520 return lang_hooks
.types
.type_hash_eq (cand
, base
);
6523 /* This function checks to see if TYPE matches the size one of the built-in
6524 atomic types, and returns that core atomic type. */
6527 find_atomic_core_type (const_tree type
)
6529 tree base_atomic_type
;
6531 /* Only handle complete types. */
6532 if (!tree_fits_uhwi_p (TYPE_SIZE (type
)))
6535 switch (tree_to_uhwi (TYPE_SIZE (type
)))
6538 base_atomic_type
= atomicQI_type_node
;
6542 base_atomic_type
= atomicHI_type_node
;
6546 base_atomic_type
= atomicSI_type_node
;
6550 base_atomic_type
= atomicDI_type_node
;
6554 base_atomic_type
= atomicTI_type_node
;
6558 base_atomic_type
= NULL_TREE
;
6561 return base_atomic_type
;
6564 /* Returns true iff unqualified CAND and BASE are equivalent. */
6567 check_base_type (const_tree cand
, const_tree base
)
6569 if (TYPE_NAME (cand
) != TYPE_NAME (base
)
6570 /* Apparently this is needed for Objective-C. */
6571 || TYPE_CONTEXT (cand
) != TYPE_CONTEXT (base
)
6572 || !attribute_list_equal (TYPE_ATTRIBUTES (cand
),
6573 TYPE_ATTRIBUTES (base
)))
6575 /* Check alignment. */
6576 if (TYPE_ALIGN (cand
) == TYPE_ALIGN (base
))
6578 /* Atomic types increase minimal alignment. We must to do so as well
6579 or we get duplicated canonical types. See PR88686. */
6580 if ((TYPE_QUALS (cand
) & TYPE_QUAL_ATOMIC
))
6582 /* See if this object can map to a basic atomic type. */
6583 tree atomic_type
= find_atomic_core_type (cand
);
6584 if (atomic_type
&& TYPE_ALIGN (atomic_type
) == TYPE_ALIGN (cand
))
6590 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
6593 check_qualified_type (const_tree cand
, const_tree base
, int type_quals
)
6595 return (TYPE_QUALS (cand
) == type_quals
6596 && check_base_type (cand
, base
)
6597 && check_lang_type (cand
, base
));
6600 /* Returns true iff CAND is equivalent to BASE with ALIGN. */
6603 check_aligned_type (const_tree cand
, const_tree base
, unsigned int align
)
6605 return (TYPE_QUALS (cand
) == TYPE_QUALS (base
)
6606 && TYPE_NAME (cand
) == TYPE_NAME (base
)
6607 /* Apparently this is needed for Objective-C. */
6608 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
6609 /* Check alignment. */
6610 && TYPE_ALIGN (cand
) == align
6611 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
6612 TYPE_ATTRIBUTES (base
))
6613 && check_lang_type (cand
, base
));
6616 /* Return a version of the TYPE, qualified as indicated by the
6617 TYPE_QUALS, if one exists. If no qualified version exists yet,
6618 return NULL_TREE. */
6621 get_qualified_type (tree type
, int type_quals
)
6623 if (TYPE_QUALS (type
) == type_quals
)
6626 tree mv
= TYPE_MAIN_VARIANT (type
);
6627 if (check_qualified_type (mv
, type
, type_quals
))
6630 /* Search the chain of variants to see if there is already one there just
6631 like the one we need to have. If so, use that existing one. We must
6632 preserve the TYPE_NAME, since there is code that depends on this. */
6633 for (tree
*tp
= &TYPE_NEXT_VARIANT (mv
); *tp
; tp
= &TYPE_NEXT_VARIANT (*tp
))
6634 if (check_qualified_type (*tp
, type
, type_quals
))
6636 /* Put the found variant at the head of the variant list so
6637 frequently searched variants get found faster. The C++ FE
6638 benefits greatly from this. */
6640 *tp
= TYPE_NEXT_VARIANT (t
);
6641 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (mv
);
6642 TYPE_NEXT_VARIANT (mv
) = t
;
6649 /* Like get_qualified_type, but creates the type if it does not
6650 exist. This function never returns NULL_TREE. */
6653 build_qualified_type (tree type
, int type_quals MEM_STAT_DECL
)
6657 /* See if we already have the appropriate qualified variant. */
6658 t
= get_qualified_type (type
, type_quals
);
6660 /* If not, build it. */
6663 t
= build_variant_type_copy (type PASS_MEM_STAT
);
6664 set_type_quals (t
, type_quals
);
6666 if (((type_quals
& TYPE_QUAL_ATOMIC
) == TYPE_QUAL_ATOMIC
))
6668 /* See if this object can map to a basic atomic type. */
6669 tree atomic_type
= find_atomic_core_type (type
);
6672 /* Ensure the alignment of this type is compatible with
6673 the required alignment of the atomic type. */
6674 if (TYPE_ALIGN (atomic_type
) > TYPE_ALIGN (t
))
6675 SET_TYPE_ALIGN (t
, TYPE_ALIGN (atomic_type
));
6679 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
6680 /* Propagate structural equality. */
6681 SET_TYPE_STRUCTURAL_EQUALITY (t
);
6682 else if (TYPE_CANONICAL (type
) != type
)
6683 /* Build the underlying canonical type, since it is different
6686 tree c
= build_qualified_type (TYPE_CANONICAL (type
), type_quals
);
6687 TYPE_CANONICAL (t
) = TYPE_CANONICAL (c
);
6690 /* T is its own canonical type. */
6691 TYPE_CANONICAL (t
) = t
;
6698 /* Create a variant of type T with alignment ALIGN. */
6701 build_aligned_type (tree type
, unsigned int align
)
6705 if (TYPE_PACKED (type
)
6706 || TYPE_ALIGN (type
) == align
)
6709 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
6710 if (check_aligned_type (t
, type
, align
))
6713 t
= build_variant_type_copy (type
);
6714 SET_TYPE_ALIGN (t
, align
);
6715 TYPE_USER_ALIGN (t
) = 1;
6720 /* Create a new distinct copy of TYPE. The new type is made its own
6721 MAIN_VARIANT. If TYPE requires structural equality checks, the
6722 resulting type requires structural equality checks; otherwise, its
6723 TYPE_CANONICAL points to itself. */
6726 build_distinct_type_copy (tree type MEM_STAT_DECL
)
6728 tree t
= copy_node (type PASS_MEM_STAT
);
6730 TYPE_POINTER_TO (t
) = 0;
6731 TYPE_REFERENCE_TO (t
) = 0;
6733 /* Set the canonical type either to a new equivalence class, or
6734 propagate the need for structural equality checks. */
6735 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
6736 SET_TYPE_STRUCTURAL_EQUALITY (t
);
6738 TYPE_CANONICAL (t
) = t
;
6740 /* Make it its own variant. */
6741 TYPE_MAIN_VARIANT (t
) = t
;
6742 TYPE_NEXT_VARIANT (t
) = 0;
6744 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
6745 whose TREE_TYPE is not t. This can also happen in the Ada
6746 frontend when using subtypes. */
6751 /* Create a new variant of TYPE, equivalent but distinct. This is so
6752 the caller can modify it. TYPE_CANONICAL for the return type will
6753 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
6754 are considered equal by the language itself (or that both types
6755 require structural equality checks). */
6758 build_variant_type_copy (tree type MEM_STAT_DECL
)
6760 tree t
, m
= TYPE_MAIN_VARIANT (type
);
6762 t
= build_distinct_type_copy (type PASS_MEM_STAT
);
6764 /* Since we're building a variant, assume that it is a non-semantic
6765 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
6766 TYPE_CANONICAL (t
) = TYPE_CANONICAL (type
);
6767 /* Type variants have no alias set defined. */
6768 TYPE_ALIAS_SET (t
) = -1;
6770 /* Add the new type to the chain of variants of TYPE. */
6771 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (m
);
6772 TYPE_NEXT_VARIANT (m
) = t
;
6773 TYPE_MAIN_VARIANT (t
) = m
;
6778 /* Return true if the from tree in both tree maps are equal. */
6781 tree_map_base_eq (const void *va
, const void *vb
)
6783 const struct tree_map_base
*const a
= (const struct tree_map_base
*) va
,
6784 *const b
= (const struct tree_map_base
*) vb
;
6785 return (a
->from
== b
->from
);
6788 /* Hash a from tree in a tree_base_map. */
6791 tree_map_base_hash (const void *item
)
6793 return htab_hash_pointer (((const struct tree_map_base
*)item
)->from
);
6796 /* Return true if this tree map structure is marked for garbage collection
6797 purposes. We simply return true if the from tree is marked, so that this
6798 structure goes away when the from tree goes away. */
6801 tree_map_base_marked_p (const void *p
)
6803 return ggc_marked_p (((const struct tree_map_base
*) p
)->from
);
6806 /* Hash a from tree in a tree_map. */
6809 tree_map_hash (const void *item
)
6811 return (((const struct tree_map
*) item
)->hash
);
6814 /* Hash a from tree in a tree_decl_map. */
6817 tree_decl_map_hash (const void *item
)
6819 return DECL_UID (((const struct tree_decl_map
*) item
)->base
.from
);
6822 /* Return the initialization priority for DECL. */
6825 decl_init_priority_lookup (tree decl
)
6827 symtab_node
*snode
= symtab_node::get (decl
);
6830 return DEFAULT_INIT_PRIORITY
;
6832 snode
->get_init_priority ();
6835 /* Return the finalization priority for DECL. */
6838 decl_fini_priority_lookup (tree decl
)
6840 cgraph_node
*node
= cgraph_node::get (decl
);
6843 return DEFAULT_INIT_PRIORITY
;
6845 node
->get_fini_priority ();
6848 /* Set the initialization priority for DECL to PRIORITY. */
6851 decl_init_priority_insert (tree decl
, priority_type priority
)
6853 struct symtab_node
*snode
;
6855 if (priority
== DEFAULT_INIT_PRIORITY
)
6857 snode
= symtab_node::get (decl
);
6861 else if (VAR_P (decl
))
6862 snode
= varpool_node::get_create (decl
);
6864 snode
= cgraph_node::get_create (decl
);
6865 snode
->set_init_priority (priority
);
6868 /* Set the finalization priority for DECL to PRIORITY. */
6871 decl_fini_priority_insert (tree decl
, priority_type priority
)
6873 struct cgraph_node
*node
;
6875 if (priority
== DEFAULT_INIT_PRIORITY
)
6877 node
= cgraph_node::get (decl
);
6882 node
= cgraph_node::get_create (decl
);
6883 node
->set_fini_priority (priority
);
6886 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
6889 print_debug_expr_statistics (void)
6891 fprintf (stderr
, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
6892 (long) debug_expr_for_decl
->size (),
6893 (long) debug_expr_for_decl
->elements (),
6894 debug_expr_for_decl
->collisions ());
6897 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
6900 print_value_expr_statistics (void)
6902 fprintf (stderr
, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
6903 (long) value_expr_for_decl
->size (),
6904 (long) value_expr_for_decl
->elements (),
6905 value_expr_for_decl
->collisions ());
6908 /* Lookup a debug expression for FROM, and return it if we find one. */
6911 decl_debug_expr_lookup (tree from
)
6913 struct tree_decl_map
*h
, in
;
6914 in
.base
.from
= from
;
6916 h
= debug_expr_for_decl
->find_with_hash (&in
, DECL_UID (from
));
6922 /* Insert a mapping FROM->TO in the debug expression hashtable. */
6925 decl_debug_expr_insert (tree from
, tree to
)
6927 struct tree_decl_map
*h
;
6929 h
= ggc_alloc
<tree_decl_map
> ();
6930 h
->base
.from
= from
;
6932 *debug_expr_for_decl
->find_slot_with_hash (h
, DECL_UID (from
), INSERT
) = h
;
6935 /* Lookup a value expression for FROM, and return it if we find one. */
6938 decl_value_expr_lookup (tree from
)
6940 struct tree_decl_map
*h
, in
;
6941 in
.base
.from
= from
;
6943 h
= value_expr_for_decl
->find_with_hash (&in
, DECL_UID (from
));
6949 /* Insert a mapping FROM->TO in the value expression hashtable. */
6952 decl_value_expr_insert (tree from
, tree to
)
6954 struct tree_decl_map
*h
;
6956 h
= ggc_alloc
<tree_decl_map
> ();
6957 h
->base
.from
= from
;
6959 *value_expr_for_decl
->find_slot_with_hash (h
, DECL_UID (from
), INSERT
) = h
;
6962 /* Lookup a vector of debug arguments for FROM, and return it if we
6966 decl_debug_args_lookup (tree from
)
6968 struct tree_vec_map
*h
, in
;
6970 if (!DECL_HAS_DEBUG_ARGS_P (from
))
6972 gcc_checking_assert (debug_args_for_decl
!= NULL
);
6973 in
.base
.from
= from
;
6974 h
= debug_args_for_decl
->find_with_hash (&in
, DECL_UID (from
));
6980 /* Insert a mapping FROM->empty vector of debug arguments in the value
6981 expression hashtable. */
6984 decl_debug_args_insert (tree from
)
6986 struct tree_vec_map
*h
;
6989 if (DECL_HAS_DEBUG_ARGS_P (from
))
6990 return decl_debug_args_lookup (from
);
6991 if (debug_args_for_decl
== NULL
)
6992 debug_args_for_decl
= hash_table
<tree_vec_map_cache_hasher
>::create_ggc (64);
6993 h
= ggc_alloc
<tree_vec_map
> ();
6994 h
->base
.from
= from
;
6996 loc
= debug_args_for_decl
->find_slot_with_hash (h
, DECL_UID (from
), INSERT
);
6998 DECL_HAS_DEBUG_ARGS_P (from
) = 1;
7002 /* Hashing of types so that we don't make duplicates.
7003 The entry point is `type_hash_canon'. */
7005 /* Generate the default hash code for TYPE. This is designed for
7006 speed, rather than maximum entropy. */
7009 type_hash_canon_hash (tree type
)
7011 inchash::hash hstate
;
7013 hstate
.add_int (TREE_CODE (type
));
7015 if (TREE_TYPE (type
))
7016 hstate
.add_object (TYPE_HASH (TREE_TYPE (type
)));
7018 for (tree t
= TYPE_ATTRIBUTES (type
); t
; t
= TREE_CHAIN (t
))
7019 /* Just the identifier is adequate to distinguish. */
7020 hstate
.add_object (IDENTIFIER_HASH_VALUE (get_attribute_name (t
)));
7022 switch (TREE_CODE (type
))
7025 hstate
.add_object (TYPE_HASH (TYPE_METHOD_BASETYPE (type
)));
7028 for (tree t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
7029 if (TREE_VALUE (t
) != error_mark_node
)
7030 hstate
.add_object (TYPE_HASH (TREE_VALUE (t
)));
7034 hstate
.add_object (TYPE_HASH (TYPE_OFFSET_BASETYPE (type
)));
7039 if (TYPE_DOMAIN (type
))
7040 hstate
.add_object (TYPE_HASH (TYPE_DOMAIN (type
)));
7041 if (!AGGREGATE_TYPE_P (TREE_TYPE (type
)))
7043 unsigned typeless
= TYPE_TYPELESS_STORAGE (type
);
7044 hstate
.add_object (typeless
);
7051 tree t
= TYPE_MAX_VALUE (type
);
7053 t
= TYPE_MIN_VALUE (type
);
7054 for (int i
= 0; i
< TREE_INT_CST_NUNITS (t
); i
++)
7055 hstate
.add_object (TREE_INT_CST_ELT (t
, i
));
7060 case FIXED_POINT_TYPE
:
7062 unsigned prec
= TYPE_PRECISION (type
);
7063 hstate
.add_object (prec
);
7068 hstate
.add_poly_int (TYPE_VECTOR_SUBPARTS (type
));
7075 return hstate
.end ();
7078 /* These are the Hashtable callback functions. */
7080 /* Returns true iff the types are equivalent. */
7083 type_cache_hasher::equal (type_hash
*a
, type_hash
*b
)
7085 /* First test the things that are the same for all types. */
7086 if (a
->hash
!= b
->hash
7087 || TREE_CODE (a
->type
) != TREE_CODE (b
->type
)
7088 || TREE_TYPE (a
->type
) != TREE_TYPE (b
->type
)
7089 || !attribute_list_equal (TYPE_ATTRIBUTES (a
->type
),
7090 TYPE_ATTRIBUTES (b
->type
))
7091 || (TREE_CODE (a
->type
) != COMPLEX_TYPE
7092 && TYPE_NAME (a
->type
) != TYPE_NAME (b
->type
)))
7095 /* Be careful about comparing arrays before and after the element type
7096 has been completed; don't compare TYPE_ALIGN unless both types are
7098 if (COMPLETE_TYPE_P (a
->type
) && COMPLETE_TYPE_P (b
->type
)
7099 && (TYPE_ALIGN (a
->type
) != TYPE_ALIGN (b
->type
)
7100 || TYPE_MODE (a
->type
) != TYPE_MODE (b
->type
)))
7103 switch (TREE_CODE (a
->type
))
7109 case REFERENCE_TYPE
:
7114 return known_eq (TYPE_VECTOR_SUBPARTS (a
->type
),
7115 TYPE_VECTOR_SUBPARTS (b
->type
));
7118 if (TYPE_VALUES (a
->type
) != TYPE_VALUES (b
->type
)
7119 && !(TYPE_VALUES (a
->type
)
7120 && TREE_CODE (TYPE_VALUES (a
->type
)) == TREE_LIST
7121 && TYPE_VALUES (b
->type
)
7122 && TREE_CODE (TYPE_VALUES (b
->type
)) == TREE_LIST
7123 && type_list_equal (TYPE_VALUES (a
->type
),
7124 TYPE_VALUES (b
->type
))))
7132 if (TYPE_PRECISION (a
->type
) != TYPE_PRECISION (b
->type
))
7134 return ((TYPE_MAX_VALUE (a
->type
) == TYPE_MAX_VALUE (b
->type
)
7135 || tree_int_cst_equal (TYPE_MAX_VALUE (a
->type
),
7136 TYPE_MAX_VALUE (b
->type
)))
7137 && (TYPE_MIN_VALUE (a
->type
) == TYPE_MIN_VALUE (b
->type
)
7138 || tree_int_cst_equal (TYPE_MIN_VALUE (a
->type
),
7139 TYPE_MIN_VALUE (b
->type
))));
7141 case FIXED_POINT_TYPE
:
7142 return TYPE_SATURATING (a
->type
) == TYPE_SATURATING (b
->type
);
7145 return TYPE_OFFSET_BASETYPE (a
->type
) == TYPE_OFFSET_BASETYPE (b
->type
);
7148 if (TYPE_METHOD_BASETYPE (a
->type
) == TYPE_METHOD_BASETYPE (b
->type
)
7149 && (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
7150 || (TYPE_ARG_TYPES (a
->type
)
7151 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
7152 && TYPE_ARG_TYPES (b
->type
)
7153 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
7154 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
7155 TYPE_ARG_TYPES (b
->type
)))))
7159 /* Don't compare TYPE_TYPELESS_STORAGE flag on aggregates,
7160 where the flag should be inherited from the element type
7161 and can change after ARRAY_TYPEs are created; on non-aggregates
7162 compare it and hash it, scalars will never have that flag set
7163 and we need to differentiate between arrays created by different
7164 front-ends or middle-end created arrays. */
7165 return (TYPE_DOMAIN (a
->type
) == TYPE_DOMAIN (b
->type
)
7166 && (AGGREGATE_TYPE_P (TREE_TYPE (a
->type
))
7167 || (TYPE_TYPELESS_STORAGE (a
->type
)
7168 == TYPE_TYPELESS_STORAGE (b
->type
))));
7172 case QUAL_UNION_TYPE
:
7173 return (TYPE_FIELDS (a
->type
) == TYPE_FIELDS (b
->type
)
7174 || (TYPE_FIELDS (a
->type
)
7175 && TREE_CODE (TYPE_FIELDS (a
->type
)) == TREE_LIST
7176 && TYPE_FIELDS (b
->type
)
7177 && TREE_CODE (TYPE_FIELDS (b
->type
)) == TREE_LIST
7178 && type_list_equal (TYPE_FIELDS (a
->type
),
7179 TYPE_FIELDS (b
->type
))));
7182 if (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
7183 || (TYPE_ARG_TYPES (a
->type
)
7184 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
7185 && TYPE_ARG_TYPES (b
->type
)
7186 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
7187 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
7188 TYPE_ARG_TYPES (b
->type
))))
7196 if (lang_hooks
.types
.type_hash_eq
!= NULL
)
7197 return lang_hooks
.types
.type_hash_eq (a
->type
, b
->type
);
7202 /* Given TYPE, and HASHCODE its hash code, return the canonical
7203 object for an identical type if one already exists.
7204 Otherwise, return TYPE, and record it as the canonical object.
7206 To use this function, first create a type of the sort you want.
7207 Then compute its hash code from the fields of the type that
7208 make it different from other similar types.
7209 Then call this function and use the value. */
7212 type_hash_canon (unsigned int hashcode
, tree type
)
7217 /* The hash table only contains main variants, so ensure that's what we're
7219 gcc_assert (TYPE_MAIN_VARIANT (type
) == type
);
7221 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
7222 must call that routine before comparing TYPE_ALIGNs. */
7228 loc
= type_hash_table
->find_slot_with_hash (&in
, hashcode
, INSERT
);
7231 tree t1
= ((type_hash
*) *loc
)->type
;
7232 gcc_assert (TYPE_MAIN_VARIANT (t1
) == t1
7234 if (TYPE_UID (type
) + 1 == next_type_uid
)
7236 /* Free also min/max values and the cache for integer
7237 types. This can't be done in free_node, as LTO frees
7238 those on its own. */
7239 if (TREE_CODE (type
) == INTEGER_TYPE
)
7241 if (TYPE_MIN_VALUE (type
)
7242 && TREE_TYPE (TYPE_MIN_VALUE (type
)) == type
)
7244 /* Zero is always in TYPE_CACHED_VALUES. */
7245 if (! TYPE_UNSIGNED (type
))
7246 int_cst_hash_table
->remove_elt (TYPE_MIN_VALUE (type
));
7247 ggc_free (TYPE_MIN_VALUE (type
));
7249 if (TYPE_MAX_VALUE (type
)
7250 && TREE_TYPE (TYPE_MAX_VALUE (type
)) == type
)
7252 int_cst_hash_table
->remove_elt (TYPE_MAX_VALUE (type
));
7253 ggc_free (TYPE_MAX_VALUE (type
));
7255 if (TYPE_CACHED_VALUES_P (type
))
7256 ggc_free (TYPE_CACHED_VALUES (type
));
7263 struct type_hash
*h
;
7265 h
= ggc_alloc
<type_hash
> ();
7275 print_type_hash_statistics (void)
7277 fprintf (stderr
, "Type hash: size %ld, %ld elements, %f collisions\n",
7278 (long) type_hash_table
->size (),
7279 (long) type_hash_table
->elements (),
7280 type_hash_table
->collisions ());
7283 /* Given two lists of types
7284 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
7285 return 1 if the lists contain the same types in the same order.
7286 Also, the TREE_PURPOSEs must match. */
7289 type_list_equal (const_tree l1
, const_tree l2
)
7293 for (t1
= l1
, t2
= l2
; t1
&& t2
; t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
7294 if (TREE_VALUE (t1
) != TREE_VALUE (t2
)
7295 || (TREE_PURPOSE (t1
) != TREE_PURPOSE (t2
)
7296 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
))
7297 && (TREE_TYPE (TREE_PURPOSE (t1
))
7298 == TREE_TYPE (TREE_PURPOSE (t2
))))))
7304 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
7305 given by TYPE. If the argument list accepts variable arguments,
7306 then this function counts only the ordinary arguments. */
7309 type_num_arguments (const_tree fntype
)
7313 for (tree t
= TYPE_ARG_TYPES (fntype
); t
; t
= TREE_CHAIN (t
))
7314 /* If the function does not take a variable number of arguments,
7315 the last element in the list will have type `void'. */
7316 if (VOID_TYPE_P (TREE_VALUE (t
)))
7324 /* Return the type of the function TYPE's argument ARGNO if known.
7325 For vararg function's where ARGNO refers to one of the variadic
7326 arguments return null. Otherwise, return a void_type_node for
7327 out-of-bounds ARGNO. */
7330 type_argument_type (const_tree fntype
, unsigned argno
)
7332 /* Treat zero the same as an out-of-bounds argument number. */
7334 return void_type_node
;
7336 function_args_iterator iter
;
7340 FOREACH_FUNCTION_ARGS (fntype
, argtype
, iter
)
7342 /* A vararg function's argument list ends in a null. Otherwise,
7343 an ordinary function's argument list ends with void. Return
7344 null if ARGNO refers to a vararg argument, void_type_node if
7345 it's out of bounds, and the formal argument type otherwise. */
7349 if (i
== argno
|| VOID_TYPE_P (argtype
))
7358 /* Nonzero if integer constants T1 and T2
7359 represent the same constant value. */
7362 tree_int_cst_equal (const_tree t1
, const_tree t2
)
7367 if (t1
== 0 || t2
== 0)
7370 STRIP_ANY_LOCATION_WRAPPER (t1
);
7371 STRIP_ANY_LOCATION_WRAPPER (t2
);
7373 if (TREE_CODE (t1
) == INTEGER_CST
7374 && TREE_CODE (t2
) == INTEGER_CST
7375 && wi::to_widest (t1
) == wi::to_widest (t2
))
7381 /* Return true if T is an INTEGER_CST whose numerical value (extended
7382 according to TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. */
7385 tree_fits_shwi_p (const_tree t
)
7387 return (t
!= NULL_TREE
7388 && TREE_CODE (t
) == INTEGER_CST
7389 && wi::fits_shwi_p (wi::to_widest (t
)));
7392 /* Return true if T is an INTEGER_CST or POLY_INT_CST whose numerical
7393 value (extended according to TYPE_UNSIGNED) fits in a poly_int64. */
7396 tree_fits_poly_int64_p (const_tree t
)
7400 if (POLY_INT_CST_P (t
))
7402 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; i
++)
7403 if (!wi::fits_shwi_p (wi::to_wide (POLY_INT_CST_COEFF (t
, i
))))
7407 return (TREE_CODE (t
) == INTEGER_CST
7408 && wi::fits_shwi_p (wi::to_widest (t
)));
7411 /* Return true if T is an INTEGER_CST whose numerical value (extended
7412 according to TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. */
7415 tree_fits_uhwi_p (const_tree t
)
7417 return (t
!= NULL_TREE
7418 && TREE_CODE (t
) == INTEGER_CST
7419 && wi::fits_uhwi_p (wi::to_widest (t
)));
7422 /* Return true if T is an INTEGER_CST or POLY_INT_CST whose numerical
7423 value (extended according to TYPE_UNSIGNED) fits in a poly_uint64. */
7426 tree_fits_poly_uint64_p (const_tree t
)
7430 if (POLY_INT_CST_P (t
))
7432 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; i
++)
7433 if (!wi::fits_uhwi_p (wi::to_widest (POLY_INT_CST_COEFF (t
, i
))))
7437 return (TREE_CODE (t
) == INTEGER_CST
7438 && wi::fits_uhwi_p (wi::to_widest (t
)));
7441 /* T is an INTEGER_CST whose numerical value (extended according to
7442 TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. Return that
7446 tree_to_shwi (const_tree t
)
7448 gcc_assert (tree_fits_shwi_p (t
));
7449 return TREE_INT_CST_LOW (t
);
7452 /* T is an INTEGER_CST whose numerical value (extended according to
7453 TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. Return that
7456 unsigned HOST_WIDE_INT
7457 tree_to_uhwi (const_tree t
)
7459 gcc_assert (tree_fits_uhwi_p (t
));
7460 return TREE_INT_CST_LOW (t
);
7463 /* Return the most significant (sign) bit of T. */
7466 tree_int_cst_sign_bit (const_tree t
)
7468 unsigned bitno
= TYPE_PRECISION (TREE_TYPE (t
)) - 1;
7470 return wi::extract_uhwi (wi::to_wide (t
), bitno
, 1);
7473 /* Return an indication of the sign of the integer constant T.
7474 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
7475 Note that -1 will never be returned if T's type is unsigned. */
7478 tree_int_cst_sgn (const_tree t
)
7480 if (wi::to_wide (t
) == 0)
7482 else if (TYPE_UNSIGNED (TREE_TYPE (t
)))
7484 else if (wi::neg_p (wi::to_wide (t
)))
7490 /* Return the minimum number of bits needed to represent VALUE in a
7491 signed or unsigned type, UNSIGNEDP says which. */
7494 tree_int_cst_min_precision (tree value
, signop sgn
)
7496 /* If the value is negative, compute its negative minus 1. The latter
7497 adjustment is because the absolute value of the largest negative value
7498 is one larger than the largest positive value. This is equivalent to
7499 a bit-wise negation, so use that operation instead. */
7501 if (tree_int_cst_sgn (value
) < 0)
7502 value
= fold_build1 (BIT_NOT_EXPR
, TREE_TYPE (value
), value
);
7504 /* Return the number of bits needed, taking into account the fact
7505 that we need one more bit for a signed than unsigned type.
7506 If value is 0 or -1, the minimum precision is 1 no matter
7507 whether unsignedp is true or false. */
7509 if (integer_zerop (value
))
7512 return tree_floor_log2 (value
) + 1 + (sgn
== SIGNED
? 1 : 0) ;
7515 /* Return truthvalue of whether T1 is the same tree structure as T2.
7516 Return 1 if they are the same.
7517 Return 0 if they are understandably different.
7518 Return -1 if either contains tree structure not understood by
7522 simple_cst_equal (const_tree t1
, const_tree t2
)
7524 enum tree_code code1
, code2
;
7530 if (t1
== 0 || t2
== 0)
7533 /* For location wrappers to be the same, they must be at the same
7534 source location (and wrap the same thing). */
7535 if (location_wrapper_p (t1
) && location_wrapper_p (t2
))
7537 if (EXPR_LOCATION (t1
) != EXPR_LOCATION (t2
))
7539 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7542 code1
= TREE_CODE (t1
);
7543 code2
= TREE_CODE (t2
);
7545 if (CONVERT_EXPR_CODE_P (code1
) || code1
== NON_LVALUE_EXPR
)
7547 if (CONVERT_EXPR_CODE_P (code2
)
7548 || code2
== NON_LVALUE_EXPR
)
7549 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7551 return simple_cst_equal (TREE_OPERAND (t1
, 0), t2
);
7554 else if (CONVERT_EXPR_CODE_P (code2
)
7555 || code2
== NON_LVALUE_EXPR
)
7556 return simple_cst_equal (t1
, TREE_OPERAND (t2
, 0));
7564 return wi::to_widest (t1
) == wi::to_widest (t2
);
7567 return real_identical (&TREE_REAL_CST (t1
), &TREE_REAL_CST (t2
));
7570 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1
), TREE_FIXED_CST (t2
));
7573 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
7574 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
7575 TREE_STRING_LENGTH (t1
)));
7579 unsigned HOST_WIDE_INT idx
;
7580 vec
<constructor_elt
, va_gc
> *v1
= CONSTRUCTOR_ELTS (t1
);
7581 vec
<constructor_elt
, va_gc
> *v2
= CONSTRUCTOR_ELTS (t2
);
7583 if (vec_safe_length (v1
) != vec_safe_length (v2
))
7586 for (idx
= 0; idx
< vec_safe_length (v1
); ++idx
)
7587 /* ??? Should we handle also fields here? */
7588 if (!simple_cst_equal ((*v1
)[idx
].value
, (*v2
)[idx
].value
))
7594 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7597 cmp
= simple_cst_equal (CALL_EXPR_FN (t1
), CALL_EXPR_FN (t2
));
7600 if (call_expr_nargs (t1
) != call_expr_nargs (t2
))
7603 const_tree arg1
, arg2
;
7604 const_call_expr_arg_iterator iter1
, iter2
;
7605 for (arg1
= first_const_call_expr_arg (t1
, &iter1
),
7606 arg2
= first_const_call_expr_arg (t2
, &iter2
);
7608 arg1
= next_const_call_expr_arg (&iter1
),
7609 arg2
= next_const_call_expr_arg (&iter2
))
7611 cmp
= simple_cst_equal (arg1
, arg2
);
7615 return arg1
== arg2
;
7619 /* Special case: if either target is an unallocated VAR_DECL,
7620 it means that it's going to be unified with whatever the
7621 TARGET_EXPR is really supposed to initialize, so treat it
7622 as being equivalent to anything. */
7623 if ((TREE_CODE (TREE_OPERAND (t1
, 0)) == VAR_DECL
7624 && DECL_NAME (TREE_OPERAND (t1
, 0)) == NULL_TREE
7625 && !DECL_RTL_SET_P (TREE_OPERAND (t1
, 0)))
7626 || (TREE_CODE (TREE_OPERAND (t2
, 0)) == VAR_DECL
7627 && DECL_NAME (TREE_OPERAND (t2
, 0)) == NULL_TREE
7628 && !DECL_RTL_SET_P (TREE_OPERAND (t2
, 0))))
7631 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7636 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
7638 case WITH_CLEANUP_EXPR
:
7639 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7643 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t1
, 1));
7646 if (TREE_OPERAND (t1
, 1) == TREE_OPERAND (t2
, 1))
7647 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7658 if (POLY_INT_CST_P (t1
))
7659 /* A false return means maybe_ne rather than known_ne. */
7660 return known_eq (poly_widest_int::from (poly_int_cst_value (t1
),
7661 TYPE_SIGN (TREE_TYPE (t1
))),
7662 poly_widest_int::from (poly_int_cst_value (t2
),
7663 TYPE_SIGN (TREE_TYPE (t2
))));
7667 /* This general rule works for most tree codes. All exceptions should be
7668 handled above. If this is a language-specific tree code, we can't
7669 trust what might be in the operand, so say we don't know
7671 if ((int) code1
>= (int) LAST_AND_UNUSED_TREE_CODE
)
7674 switch (TREE_CODE_CLASS (code1
))
7678 case tcc_comparison
:
7679 case tcc_expression
:
7683 for (i
= 0; i
< TREE_CODE_LENGTH (code1
); i
++)
7685 cmp
= simple_cst_equal (TREE_OPERAND (t1
, i
), TREE_OPERAND (t2
, i
));
7697 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
7698 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
7699 than U, respectively. */
7702 compare_tree_int (const_tree t
, unsigned HOST_WIDE_INT u
)
7704 if (tree_int_cst_sgn (t
) < 0)
7706 else if (!tree_fits_uhwi_p (t
))
7708 else if (TREE_INT_CST_LOW (t
) == u
)
7710 else if (TREE_INT_CST_LOW (t
) < u
)
7716 /* Return true if SIZE represents a constant size that is in bounds of
7717 what the middle-end and the backend accepts (covering not more than
7718 half of the address-space).
7719 When PERR is non-null, set *PERR on failure to the description of
7720 why SIZE is not valid. */
7723 valid_constant_size_p (const_tree size
, cst_size_error
*perr
/* = NULL */)
7725 if (POLY_INT_CST_P (size
))
7727 if (TREE_OVERFLOW (size
))
7729 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
7730 if (!valid_constant_size_p (POLY_INT_CST_COEFF (size
, i
)))
7735 cst_size_error error
;
7739 if (TREE_CODE (size
) != INTEGER_CST
)
7741 *perr
= cst_size_not_constant
;
7745 if (TREE_OVERFLOW_P (size
))
7747 *perr
= cst_size_overflow
;
7751 if (tree_int_cst_sgn (size
) < 0)
7753 *perr
= cst_size_negative
;
7756 if (!tree_fits_uhwi_p (size
)
7757 || (wi::to_widest (TYPE_MAX_VALUE (sizetype
))
7758 < wi::to_widest (size
) * 2))
7760 *perr
= cst_size_too_big
;
7767 /* Return the precision of the type, or for a complex or vector type the
7768 precision of the type of its elements. */
7771 element_precision (const_tree type
)
7774 type
= TREE_TYPE (type
);
7775 enum tree_code code
= TREE_CODE (type
);
7776 if (code
== COMPLEX_TYPE
|| code
== VECTOR_TYPE
)
7777 type
= TREE_TYPE (type
);
7779 return TYPE_PRECISION (type
);
7782 /* Return true if CODE represents an associative tree code. Otherwise
7785 associative_tree_code (enum tree_code code
)
7804 /* Return true if CODE represents a commutative tree code. Otherwise
7807 commutative_tree_code (enum tree_code code
)
7813 case MULT_HIGHPART_EXPR
:
7821 case UNORDERED_EXPR
:
7825 case TRUTH_AND_EXPR
:
7826 case TRUTH_XOR_EXPR
:
7828 case WIDEN_MULT_EXPR
:
7829 case VEC_WIDEN_MULT_HI_EXPR
:
7830 case VEC_WIDEN_MULT_LO_EXPR
:
7831 case VEC_WIDEN_MULT_EVEN_EXPR
:
7832 case VEC_WIDEN_MULT_ODD_EXPR
:
7841 /* Return true if CODE represents a ternary tree code for which the
7842 first two operands are commutative. Otherwise return false. */
7844 commutative_ternary_tree_code (enum tree_code code
)
7848 case WIDEN_MULT_PLUS_EXPR
:
7849 case WIDEN_MULT_MINUS_EXPR
:
7859 /* Returns true if CODE can overflow. */
7862 operation_can_overflow (enum tree_code code
)
7870 /* Can overflow in various ways. */
7872 case TRUNC_DIV_EXPR
:
7873 case EXACT_DIV_EXPR
:
7874 case FLOOR_DIV_EXPR
:
7876 /* For INT_MIN / -1. */
7883 /* These operators cannot overflow. */
7888 /* Returns true if CODE operating on operands of type TYPE doesn't overflow, or
7889 ftrapv doesn't generate trapping insns for CODE. */
7892 operation_no_trapping_overflow (tree type
, enum tree_code code
)
7894 gcc_checking_assert (ANY_INTEGRAL_TYPE_P (type
));
7896 /* We don't generate instructions that trap on overflow for complex or vector
7898 if (!INTEGRAL_TYPE_P (type
))
7901 if (!TYPE_OVERFLOW_TRAPS (type
))
7911 /* These operators can overflow, and -ftrapv generates trapping code for
7914 case TRUNC_DIV_EXPR
:
7915 case EXACT_DIV_EXPR
:
7916 case FLOOR_DIV_EXPR
:
7919 /* These operators can overflow, but -ftrapv does not generate trapping
7923 /* These operators cannot overflow. */
7928 /* Constructors for pointer, array and function types.
7929 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
7930 constructed by language-dependent code, not here.) */
7932 /* Construct, lay out and return the type of pointers to TO_TYPE with
7933 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
7934 reference all of memory. If such a type has already been
7935 constructed, reuse it. */
7938 build_pointer_type_for_mode (tree to_type
, machine_mode mode
,
7942 bool could_alias
= can_alias_all
;
7944 if (to_type
== error_mark_node
)
7945 return error_mark_node
;
7947 /* If the pointed-to type has the may_alias attribute set, force
7948 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7949 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
7950 can_alias_all
= true;
7952 /* In some cases, languages will have things that aren't a POINTER_TYPE
7953 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
7954 In that case, return that type without regard to the rest of our
7957 ??? This is a kludge, but consistent with the way this function has
7958 always operated and there doesn't seem to be a good way to avoid this
7960 if (TYPE_POINTER_TO (to_type
) != 0
7961 && TREE_CODE (TYPE_POINTER_TO (to_type
)) != POINTER_TYPE
)
7962 return TYPE_POINTER_TO (to_type
);
7964 /* First, if we already have a type for pointers to TO_TYPE and it's
7965 the proper mode, use it. */
7966 for (t
= TYPE_POINTER_TO (to_type
); t
; t
= TYPE_NEXT_PTR_TO (t
))
7967 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
7970 t
= make_node (POINTER_TYPE
);
7972 TREE_TYPE (t
) = to_type
;
7973 SET_TYPE_MODE (t
, mode
);
7974 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
7975 TYPE_NEXT_PTR_TO (t
) = TYPE_POINTER_TO (to_type
);
7976 TYPE_POINTER_TO (to_type
) = t
;
7978 /* During LTO we do not set TYPE_CANONICAL of pointers and references. */
7979 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
) || in_lto_p
)
7980 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7981 else if (TYPE_CANONICAL (to_type
) != to_type
|| could_alias
)
7983 = build_pointer_type_for_mode (TYPE_CANONICAL (to_type
),
7986 /* Lay out the type. This function has many callers that are concerned
7987 with expression-construction, and this simplifies them all. */
7993 /* By default build pointers in ptr_mode. */
7996 build_pointer_type (tree to_type
)
7998 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
7999 : TYPE_ADDR_SPACE (to_type
);
8000 machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
8001 return build_pointer_type_for_mode (to_type
, pointer_mode
, false);
8004 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
8007 build_reference_type_for_mode (tree to_type
, machine_mode mode
,
8011 bool could_alias
= can_alias_all
;
8013 if (to_type
== error_mark_node
)
8014 return error_mark_node
;
8016 /* If the pointed-to type has the may_alias attribute set, force
8017 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
8018 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
8019 can_alias_all
= true;
8021 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
8022 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
8023 In that case, return that type without regard to the rest of our
8026 ??? This is a kludge, but consistent with the way this function has
8027 always operated and there doesn't seem to be a good way to avoid this
8029 if (TYPE_REFERENCE_TO (to_type
) != 0
8030 && TREE_CODE (TYPE_REFERENCE_TO (to_type
)) != REFERENCE_TYPE
)
8031 return TYPE_REFERENCE_TO (to_type
);
8033 /* First, if we already have a type for pointers to TO_TYPE and it's
8034 the proper mode, use it. */
8035 for (t
= TYPE_REFERENCE_TO (to_type
); t
; t
= TYPE_NEXT_REF_TO (t
))
8036 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
8039 t
= make_node (REFERENCE_TYPE
);
8041 TREE_TYPE (t
) = to_type
;
8042 SET_TYPE_MODE (t
, mode
);
8043 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
8044 TYPE_NEXT_REF_TO (t
) = TYPE_REFERENCE_TO (to_type
);
8045 TYPE_REFERENCE_TO (to_type
) = t
;
8047 /* During LTO we do not set TYPE_CANONICAL of pointers and references. */
8048 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
) || in_lto_p
)
8049 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8050 else if (TYPE_CANONICAL (to_type
) != to_type
|| could_alias
)
8052 = build_reference_type_for_mode (TYPE_CANONICAL (to_type
),
8061 /* Build the node for the type of references-to-TO_TYPE by default
8065 build_reference_type (tree to_type
)
8067 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
8068 : TYPE_ADDR_SPACE (to_type
);
8069 machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
8070 return build_reference_type_for_mode (to_type
, pointer_mode
, false);
8073 #define MAX_INT_CACHED_PREC \
8074 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
8075 static GTY(()) tree nonstandard_integer_type_cache
[2 * MAX_INT_CACHED_PREC
+ 2];
8077 /* Builds a signed or unsigned integer type of precision PRECISION.
8078 Used for C bitfields whose precision does not match that of
8079 built-in target types. */
8081 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision
,
8087 unsignedp
= MAX_INT_CACHED_PREC
+ 1;
8089 if (precision
<= MAX_INT_CACHED_PREC
)
8091 itype
= nonstandard_integer_type_cache
[precision
+ unsignedp
];
8096 itype
= make_node (INTEGER_TYPE
);
8097 TYPE_PRECISION (itype
) = precision
;
8100 fixup_unsigned_type (itype
);
8102 fixup_signed_type (itype
);
8104 inchash::hash hstate
;
8105 inchash::add_expr (TYPE_MAX_VALUE (itype
), hstate
);
8106 ret
= type_hash_canon (hstate
.end (), itype
);
8107 if (precision
<= MAX_INT_CACHED_PREC
)
8108 nonstandard_integer_type_cache
[precision
+ unsignedp
] = ret
;
8113 #define MAX_BOOL_CACHED_PREC \
8114 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
8115 static GTY(()) tree nonstandard_boolean_type_cache
[MAX_BOOL_CACHED_PREC
+ 1];
8117 /* Builds a boolean type of precision PRECISION.
8118 Used for boolean vectors to choose proper vector element size. */
8120 build_nonstandard_boolean_type (unsigned HOST_WIDE_INT precision
)
8124 if (precision
<= MAX_BOOL_CACHED_PREC
)
8126 type
= nonstandard_boolean_type_cache
[precision
];
8131 type
= make_node (BOOLEAN_TYPE
);
8132 TYPE_PRECISION (type
) = precision
;
8133 fixup_signed_type (type
);
8135 if (precision
<= MAX_INT_CACHED_PREC
)
8136 nonstandard_boolean_type_cache
[precision
] = type
;
8141 /* Create a range of some discrete type TYPE (an INTEGER_TYPE, ENUMERAL_TYPE
8142 or BOOLEAN_TYPE) with low bound LOWVAL and high bound HIGHVAL. If SHARED
8143 is true, reuse such a type that has already been constructed. */
8146 build_range_type_1 (tree type
, tree lowval
, tree highval
, bool shared
)
8148 tree itype
= make_node (INTEGER_TYPE
);
8150 TREE_TYPE (itype
) = type
;
8152 TYPE_MIN_VALUE (itype
) = fold_convert (type
, lowval
);
8153 TYPE_MAX_VALUE (itype
) = highval
? fold_convert (type
, highval
) : NULL
;
8155 TYPE_PRECISION (itype
) = TYPE_PRECISION (type
);
8156 SET_TYPE_MODE (itype
, TYPE_MODE (type
));
8157 TYPE_SIZE (itype
) = TYPE_SIZE (type
);
8158 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (type
);
8159 SET_TYPE_ALIGN (itype
, TYPE_ALIGN (type
));
8160 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (type
);
8161 SET_TYPE_WARN_IF_NOT_ALIGN (itype
, TYPE_WARN_IF_NOT_ALIGN (type
));
8166 if ((TYPE_MIN_VALUE (itype
)
8167 && TREE_CODE (TYPE_MIN_VALUE (itype
)) != INTEGER_CST
)
8168 || (TYPE_MAX_VALUE (itype
)
8169 && TREE_CODE (TYPE_MAX_VALUE (itype
)) != INTEGER_CST
))
8171 /* Since we cannot reliably merge this type, we need to compare it using
8172 structural equality checks. */
8173 SET_TYPE_STRUCTURAL_EQUALITY (itype
);
8177 hashval_t hash
= type_hash_canon_hash (itype
);
8178 itype
= type_hash_canon (hash
, itype
);
8183 /* Wrapper around build_range_type_1 with SHARED set to true. */
8186 build_range_type (tree type
, tree lowval
, tree highval
)
8188 return build_range_type_1 (type
, lowval
, highval
, true);
8191 /* Wrapper around build_range_type_1 with SHARED set to false. */
8194 build_nonshared_range_type (tree type
, tree lowval
, tree highval
)
8196 return build_range_type_1 (type
, lowval
, highval
, false);
8199 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
8200 MAXVAL should be the maximum value in the domain
8201 (one less than the length of the array).
8203 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
8204 We don't enforce this limit, that is up to caller (e.g. language front end).
8205 The limit exists because the result is a signed type and we don't handle
8206 sizes that use more than one HOST_WIDE_INT. */
8209 build_index_type (tree maxval
)
8211 return build_range_type (sizetype
, size_zero_node
, maxval
);
8214 /* Return true if the debug information for TYPE, a subtype, should be emitted
8215 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
8216 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
8217 debug info and doesn't reflect the source code. */
8220 subrange_type_for_debug_p (const_tree type
, tree
*lowval
, tree
*highval
)
8222 tree base_type
= TREE_TYPE (type
), low
, high
;
8224 /* Subrange types have a base type which is an integral type. */
8225 if (!INTEGRAL_TYPE_P (base_type
))
8228 /* Get the real bounds of the subtype. */
8229 if (lang_hooks
.types
.get_subrange_bounds
)
8230 lang_hooks
.types
.get_subrange_bounds (type
, &low
, &high
);
8233 low
= TYPE_MIN_VALUE (type
);
8234 high
= TYPE_MAX_VALUE (type
);
8237 /* If the type and its base type have the same representation and the same
8238 name, then the type is not a subrange but a copy of the base type. */
8239 if ((TREE_CODE (base_type
) == INTEGER_TYPE
8240 || TREE_CODE (base_type
) == BOOLEAN_TYPE
)
8241 && int_size_in_bytes (type
) == int_size_in_bytes (base_type
)
8242 && tree_int_cst_equal (low
, TYPE_MIN_VALUE (base_type
))
8243 && tree_int_cst_equal (high
, TYPE_MAX_VALUE (base_type
))
8244 && TYPE_IDENTIFIER (type
) == TYPE_IDENTIFIER (base_type
))
8254 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
8255 and number of elements specified by the range of values of INDEX_TYPE.
8256 If TYPELESS_STORAGE is true, TYPE_TYPELESS_STORAGE flag is set on the type.
8257 If SHARED is true, reuse such a type that has already been constructed.
8258 If SET_CANONICAL is true, compute TYPE_CANONICAL from the element type. */
8261 build_array_type_1 (tree elt_type
, tree index_type
, bool typeless_storage
,
8262 bool shared
, bool set_canonical
)
8266 if (TREE_CODE (elt_type
) == FUNCTION_TYPE
)
8268 error ("arrays of functions are not meaningful");
8269 elt_type
= integer_type_node
;
8272 t
= make_node (ARRAY_TYPE
);
8273 TREE_TYPE (t
) = elt_type
;
8274 TYPE_DOMAIN (t
) = index_type
;
8275 TYPE_ADDR_SPACE (t
) = TYPE_ADDR_SPACE (elt_type
);
8276 TYPE_TYPELESS_STORAGE (t
) = typeless_storage
;
8281 hashval_t hash
= type_hash_canon_hash (t
);
8282 t
= type_hash_canon (hash
, t
);
8285 if (TYPE_CANONICAL (t
) == t
&& set_canonical
)
8287 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type
)
8288 || (index_type
&& TYPE_STRUCTURAL_EQUALITY_P (index_type
))
8290 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8291 else if (TYPE_CANONICAL (elt_type
) != elt_type
8292 || (index_type
&& TYPE_CANONICAL (index_type
) != index_type
))
8294 = build_array_type_1 (TYPE_CANONICAL (elt_type
),
8296 ? TYPE_CANONICAL (index_type
) : NULL_TREE
,
8297 typeless_storage
, shared
, set_canonical
);
8303 /* Wrapper around build_array_type_1 with SHARED set to true. */
8306 build_array_type (tree elt_type
, tree index_type
, bool typeless_storage
)
8309 build_array_type_1 (elt_type
, index_type
, typeless_storage
, true, true);
8312 /* Wrapper around build_array_type_1 with SHARED set to false. */
8315 build_nonshared_array_type (tree elt_type
, tree index_type
)
8317 return build_array_type_1 (elt_type
, index_type
, false, false, true);
8320 /* Return a representation of ELT_TYPE[NELTS], using indices of type
8324 build_array_type_nelts (tree elt_type
, poly_uint64 nelts
)
8326 return build_array_type (elt_type
, build_index_type (size_int (nelts
- 1)));
8329 /* Recursively examines the array elements of TYPE, until a non-array
8330 element type is found. */
8333 strip_array_types (tree type
)
8335 while (TREE_CODE (type
) == ARRAY_TYPE
)
8336 type
= TREE_TYPE (type
);
8341 /* Computes the canonical argument types from the argument type list
8344 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
8345 on entry to this function, or if any of the ARGTYPES are
8348 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
8349 true on entry to this function, or if any of the ARGTYPES are
8352 Returns a canonical argument list, which may be ARGTYPES when the
8353 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
8354 true) or would not differ from ARGTYPES. */
8357 maybe_canonicalize_argtypes (tree argtypes
,
8358 bool *any_structural_p
,
8359 bool *any_noncanonical_p
)
8362 bool any_noncanonical_argtypes_p
= false;
8364 for (arg
= argtypes
; arg
&& !(*any_structural_p
); arg
= TREE_CHAIN (arg
))
8366 if (!TREE_VALUE (arg
) || TREE_VALUE (arg
) == error_mark_node
)
8367 /* Fail gracefully by stating that the type is structural. */
8368 *any_structural_p
= true;
8369 else if (TYPE_STRUCTURAL_EQUALITY_P (TREE_VALUE (arg
)))
8370 *any_structural_p
= true;
8371 else if (TYPE_CANONICAL (TREE_VALUE (arg
)) != TREE_VALUE (arg
)
8372 || TREE_PURPOSE (arg
))
8373 /* If the argument has a default argument, we consider it
8374 non-canonical even though the type itself is canonical.
8375 That way, different variants of function and method types
8376 with default arguments will all point to the variant with
8377 no defaults as their canonical type. */
8378 any_noncanonical_argtypes_p
= true;
8381 if (*any_structural_p
)
8384 if (any_noncanonical_argtypes_p
)
8386 /* Build the canonical list of argument types. */
8387 tree canon_argtypes
= NULL_TREE
;
8388 bool is_void
= false;
8390 for (arg
= argtypes
; arg
; arg
= TREE_CHAIN (arg
))
8392 if (arg
== void_list_node
)
8395 canon_argtypes
= tree_cons (NULL_TREE
,
8396 TYPE_CANONICAL (TREE_VALUE (arg
)),
8400 canon_argtypes
= nreverse (canon_argtypes
);
8402 canon_argtypes
= chainon (canon_argtypes
, void_list_node
);
8404 /* There is a non-canonical type. */
8405 *any_noncanonical_p
= true;
8406 return canon_argtypes
;
8409 /* The canonical argument types are the same as ARGTYPES. */
8413 /* Construct, lay out and return
8414 the type of functions returning type VALUE_TYPE
8415 given arguments of types ARG_TYPES.
8416 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
8417 are data type nodes for the arguments of the function.
8418 If such a type has already been constructed, reuse it. */
8421 build_function_type (tree value_type
, tree arg_types
)
8424 inchash::hash hstate
;
8425 bool any_structural_p
, any_noncanonical_p
;
8426 tree canon_argtypes
;
8428 gcc_assert (arg_types
!= error_mark_node
);
8430 if (TREE_CODE (value_type
) == FUNCTION_TYPE
)
8432 error ("function return type cannot be function");
8433 value_type
= integer_type_node
;
8436 /* Make a node of the sort we want. */
8437 t
= make_node (FUNCTION_TYPE
);
8438 TREE_TYPE (t
) = value_type
;
8439 TYPE_ARG_TYPES (t
) = arg_types
;
8441 /* If we already have such a type, use the old one. */
8442 hashval_t hash
= type_hash_canon_hash (t
);
8443 t
= type_hash_canon (hash
, t
);
8445 /* Set up the canonical type. */
8446 any_structural_p
= TYPE_STRUCTURAL_EQUALITY_P (value_type
);
8447 any_noncanonical_p
= TYPE_CANONICAL (value_type
) != value_type
;
8448 canon_argtypes
= maybe_canonicalize_argtypes (arg_types
,
8450 &any_noncanonical_p
);
8451 if (any_structural_p
)
8452 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8453 else if (any_noncanonical_p
)
8454 TYPE_CANONICAL (t
) = build_function_type (TYPE_CANONICAL (value_type
),
8457 if (!COMPLETE_TYPE_P (t
))
8462 /* Build a function type. The RETURN_TYPE is the type returned by the
8463 function. If VAARGS is set, no void_type_node is appended to the
8464 list. ARGP must be always be terminated be a NULL_TREE. */
8467 build_function_type_list_1 (bool vaargs
, tree return_type
, va_list argp
)
8471 t
= va_arg (argp
, tree
);
8472 for (args
= NULL_TREE
; t
!= NULL_TREE
; t
= va_arg (argp
, tree
))
8473 args
= tree_cons (NULL_TREE
, t
, args
);
8478 if (args
!= NULL_TREE
)
8479 args
= nreverse (args
);
8480 gcc_assert (last
!= void_list_node
);
8482 else if (args
== NULL_TREE
)
8483 args
= void_list_node
;
8487 args
= nreverse (args
);
8488 TREE_CHAIN (last
) = void_list_node
;
8490 args
= build_function_type (return_type
, args
);
8495 /* Build a function type. The RETURN_TYPE is the type returned by the
8496 function. If additional arguments are provided, they are
8497 additional argument types. The list of argument types must always
8498 be terminated by NULL_TREE. */
8501 build_function_type_list (tree return_type
, ...)
8506 va_start (p
, return_type
);
8507 args
= build_function_type_list_1 (false, return_type
, p
);
8512 /* Build a variable argument function type. The RETURN_TYPE is the
8513 type returned by the function. If additional arguments are provided,
8514 they are additional argument types. The list of argument types must
8515 always be terminated by NULL_TREE. */
8518 build_varargs_function_type_list (tree return_type
, ...)
8523 va_start (p
, return_type
);
8524 args
= build_function_type_list_1 (true, return_type
, p
);
8530 /* Build a function type. RETURN_TYPE is the type returned by the
8531 function; VAARGS indicates whether the function takes varargs. The
8532 function takes N named arguments, the types of which are provided in
8536 build_function_type_array_1 (bool vaargs
, tree return_type
, int n
,
8540 tree t
= vaargs
? NULL_TREE
: void_list_node
;
8542 for (i
= n
- 1; i
>= 0; i
--)
8543 t
= tree_cons (NULL_TREE
, arg_types
[i
], t
);
8545 return build_function_type (return_type
, t
);
8548 /* Build a function type. RETURN_TYPE is the type returned by the
8549 function. The function takes N named arguments, the types of which
8550 are provided in ARG_TYPES. */
8553 build_function_type_array (tree return_type
, int n
, tree
*arg_types
)
8555 return build_function_type_array_1 (false, return_type
, n
, arg_types
);
8558 /* Build a variable argument function type. RETURN_TYPE is the type
8559 returned by the function. The function takes N named arguments, the
8560 types of which are provided in ARG_TYPES. */
8563 build_varargs_function_type_array (tree return_type
, int n
, tree
*arg_types
)
8565 return build_function_type_array_1 (true, return_type
, n
, arg_types
);
8568 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
8569 and ARGTYPES (a TREE_LIST) are the return type and arguments types
8570 for the method. An implicit additional parameter (of type
8571 pointer-to-BASETYPE) is added to the ARGTYPES. */
8574 build_method_type_directly (tree basetype
,
8580 bool any_structural_p
, any_noncanonical_p
;
8581 tree canon_argtypes
;
8583 /* Make a node of the sort we want. */
8584 t
= make_node (METHOD_TYPE
);
8586 TYPE_METHOD_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
8587 TREE_TYPE (t
) = rettype
;
8588 ptype
= build_pointer_type (basetype
);
8590 /* The actual arglist for this function includes a "hidden" argument
8591 which is "this". Put it into the list of argument types. */
8592 argtypes
= tree_cons (NULL_TREE
, ptype
, argtypes
);
8593 TYPE_ARG_TYPES (t
) = argtypes
;
8595 /* If we already have such a type, use the old one. */
8596 hashval_t hash
= type_hash_canon_hash (t
);
8597 t
= type_hash_canon (hash
, t
);
8599 /* Set up the canonical type. */
8601 = (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
8602 || TYPE_STRUCTURAL_EQUALITY_P (rettype
));
8604 = (TYPE_CANONICAL (basetype
) != basetype
8605 || TYPE_CANONICAL (rettype
) != rettype
);
8606 canon_argtypes
= maybe_canonicalize_argtypes (TREE_CHAIN (argtypes
),
8608 &any_noncanonical_p
);
8609 if (any_structural_p
)
8610 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8611 else if (any_noncanonical_p
)
8613 = build_method_type_directly (TYPE_CANONICAL (basetype
),
8614 TYPE_CANONICAL (rettype
),
8616 if (!COMPLETE_TYPE_P (t
))
8622 /* Construct, lay out and return the type of methods belonging to class
8623 BASETYPE and whose arguments and values are described by TYPE.
8624 If that type exists already, reuse it.
8625 TYPE must be a FUNCTION_TYPE node. */
8628 build_method_type (tree basetype
, tree type
)
8630 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
8632 return build_method_type_directly (basetype
,
8634 TYPE_ARG_TYPES (type
));
8637 /* Construct, lay out and return the type of offsets to a value
8638 of type TYPE, within an object of type BASETYPE.
8639 If a suitable offset type exists already, reuse it. */
8642 build_offset_type (tree basetype
, tree type
)
8646 /* Make a node of the sort we want. */
8647 t
= make_node (OFFSET_TYPE
);
8649 TYPE_OFFSET_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
8650 TREE_TYPE (t
) = type
;
8652 /* If we already have such a type, use the old one. */
8653 hashval_t hash
= type_hash_canon_hash (t
);
8654 t
= type_hash_canon (hash
, t
);
8656 if (!COMPLETE_TYPE_P (t
))
8659 if (TYPE_CANONICAL (t
) == t
)
8661 if (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
8662 || TYPE_STRUCTURAL_EQUALITY_P (type
))
8663 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8664 else if (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)) != basetype
8665 || TYPE_CANONICAL (type
) != type
)
8667 = build_offset_type (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)),
8668 TYPE_CANONICAL (type
));
8674 /* Create a complex type whose components are COMPONENT_TYPE.
8676 If NAMED is true, the type is given a TYPE_NAME. We do not always
8677 do so because this creates a DECL node and thus make the DECL_UIDs
8678 dependent on the type canonicalization hashtable, which is GC-ed,
8679 so the DECL_UIDs would not be stable wrt garbage collection. */
8682 build_complex_type (tree component_type
, bool named
)
8684 gcc_assert (INTEGRAL_TYPE_P (component_type
)
8685 || SCALAR_FLOAT_TYPE_P (component_type
)
8686 || FIXED_POINT_TYPE_P (component_type
));
8688 /* Make a node of the sort we want. */
8689 tree probe
= make_node (COMPLEX_TYPE
);
8691 TREE_TYPE (probe
) = TYPE_MAIN_VARIANT (component_type
);
8693 /* If we already have such a type, use the old one. */
8694 hashval_t hash
= type_hash_canon_hash (probe
);
8695 tree t
= type_hash_canon (hash
, probe
);
8699 /* We created a new type. The hash insertion will have laid
8700 out the type. We need to check the canonicalization and
8701 maybe set the name. */
8702 gcc_checking_assert (COMPLETE_TYPE_P (t
)
8704 && TYPE_CANONICAL (t
) == t
);
8706 if (TYPE_STRUCTURAL_EQUALITY_P (TREE_TYPE (t
)))
8707 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8708 else if (TYPE_CANONICAL (TREE_TYPE (t
)) != TREE_TYPE (t
))
8710 = build_complex_type (TYPE_CANONICAL (TREE_TYPE (t
)), named
);
8712 /* We need to create a name, since complex is a fundamental type. */
8715 const char *name
= NULL
;
8717 if (TREE_TYPE (t
) == char_type_node
)
8718 name
= "complex char";
8719 else if (TREE_TYPE (t
) == signed_char_type_node
)
8720 name
= "complex signed char";
8721 else if (TREE_TYPE (t
) == unsigned_char_type_node
)
8722 name
= "complex unsigned char";
8723 else if (TREE_TYPE (t
) == short_integer_type_node
)
8724 name
= "complex short int";
8725 else if (TREE_TYPE (t
) == short_unsigned_type_node
)
8726 name
= "complex short unsigned int";
8727 else if (TREE_TYPE (t
) == integer_type_node
)
8728 name
= "complex int";
8729 else if (TREE_TYPE (t
) == unsigned_type_node
)
8730 name
= "complex unsigned int";
8731 else if (TREE_TYPE (t
) == long_integer_type_node
)
8732 name
= "complex long int";
8733 else if (TREE_TYPE (t
) == long_unsigned_type_node
)
8734 name
= "complex long unsigned int";
8735 else if (TREE_TYPE (t
) == long_long_integer_type_node
)
8736 name
= "complex long long int";
8737 else if (TREE_TYPE (t
) == long_long_unsigned_type_node
)
8738 name
= "complex long long unsigned int";
8741 TYPE_NAME (t
) = build_decl (UNKNOWN_LOCATION
, TYPE_DECL
,
8742 get_identifier (name
), t
);
8746 return build_qualified_type (t
, TYPE_QUALS (component_type
));
8749 /* If TYPE is a real or complex floating-point type and the target
8750 does not directly support arithmetic on TYPE then return the wider
8751 type to be used for arithmetic on TYPE. Otherwise, return
8755 excess_precision_type (tree type
)
8757 /* The target can give two different responses to the question of
8758 which excess precision mode it would like depending on whether we
8759 are in -fexcess-precision=standard or -fexcess-precision=fast. */
8761 enum excess_precision_type requested_type
8762 = (flag_excess_precision
== EXCESS_PRECISION_FAST
8763 ? EXCESS_PRECISION_TYPE_FAST
8764 : EXCESS_PRECISION_TYPE_STANDARD
);
8766 enum flt_eval_method target_flt_eval_method
8767 = targetm
.c
.excess_precision (requested_type
);
8769 /* The target should not ask for unpredictable float evaluation (though
8770 it might advertise that implicitly the evaluation is unpredictable,
8771 but we don't care about that here, it will have been reported
8772 elsewhere). If it does ask for unpredictable evaluation, we have
8773 nothing to do here. */
8774 gcc_assert (target_flt_eval_method
!= FLT_EVAL_METHOD_UNPREDICTABLE
);
8776 /* Nothing to do. The target has asked for all types we know about
8777 to be computed with their native precision and range. */
8778 if (target_flt_eval_method
== FLT_EVAL_METHOD_PROMOTE_TO_FLOAT16
)
8781 /* The target will promote this type in a target-dependent way, so excess
8782 precision ought to leave it alone. */
8783 if (targetm
.promoted_type (type
) != NULL_TREE
)
8786 machine_mode float16_type_mode
= (float16_type_node
8787 ? TYPE_MODE (float16_type_node
)
8789 machine_mode float_type_mode
= TYPE_MODE (float_type_node
);
8790 machine_mode double_type_mode
= TYPE_MODE (double_type_node
);
8792 switch (TREE_CODE (type
))
8796 machine_mode type_mode
= TYPE_MODE (type
);
8797 switch (target_flt_eval_method
)
8799 case FLT_EVAL_METHOD_PROMOTE_TO_FLOAT
:
8800 if (type_mode
== float16_type_mode
)
8801 return float_type_node
;
8803 case FLT_EVAL_METHOD_PROMOTE_TO_DOUBLE
:
8804 if (type_mode
== float16_type_mode
8805 || type_mode
== float_type_mode
)
8806 return double_type_node
;
8808 case FLT_EVAL_METHOD_PROMOTE_TO_LONG_DOUBLE
:
8809 if (type_mode
== float16_type_mode
8810 || type_mode
== float_type_mode
8811 || type_mode
== double_type_mode
)
8812 return long_double_type_node
;
8821 if (TREE_CODE (TREE_TYPE (type
)) != REAL_TYPE
)
8823 machine_mode type_mode
= TYPE_MODE (TREE_TYPE (type
));
8824 switch (target_flt_eval_method
)
8826 case FLT_EVAL_METHOD_PROMOTE_TO_FLOAT
:
8827 if (type_mode
== float16_type_mode
)
8828 return complex_float_type_node
;
8830 case FLT_EVAL_METHOD_PROMOTE_TO_DOUBLE
:
8831 if (type_mode
== float16_type_mode
8832 || type_mode
== float_type_mode
)
8833 return complex_double_type_node
;
8835 case FLT_EVAL_METHOD_PROMOTE_TO_LONG_DOUBLE
:
8836 if (type_mode
== float16_type_mode
8837 || type_mode
== float_type_mode
8838 || type_mode
== double_type_mode
)
8839 return complex_long_double_type_node
;
8853 /* Return OP, stripped of any conversions to wider types as much as is safe.
8854 Converting the value back to OP's type makes a value equivalent to OP.
8856 If FOR_TYPE is nonzero, we return a value which, if converted to
8857 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
8859 OP must have integer, real or enumeral type. Pointers are not allowed!
8861 There are some cases where the obvious value we could return
8862 would regenerate to OP if converted to OP's type,
8863 but would not extend like OP to wider types.
8864 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
8865 For example, if OP is (unsigned short)(signed char)-1,
8866 we avoid returning (signed char)-1 if FOR_TYPE is int,
8867 even though extending that to an unsigned short would regenerate OP,
8868 since the result of extending (signed char)-1 to (int)
8869 is different from (int) OP. */
8872 get_unwidened (tree op
, tree for_type
)
8874 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
8875 tree type
= TREE_TYPE (op
);
8877 = TYPE_PRECISION (for_type
!= 0 ? for_type
: type
);
8879 = (for_type
!= 0 && for_type
!= type
8880 && final_prec
> TYPE_PRECISION (type
)
8881 && TYPE_UNSIGNED (type
));
8884 while (CONVERT_EXPR_P (op
))
8888 /* TYPE_PRECISION on vector types has different meaning
8889 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
8890 so avoid them here. */
8891 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op
, 0))) == VECTOR_TYPE
)
8894 bitschange
= TYPE_PRECISION (TREE_TYPE (op
))
8895 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0)));
8897 /* Truncations are many-one so cannot be removed.
8898 Unless we are later going to truncate down even farther. */
8900 && final_prec
> TYPE_PRECISION (TREE_TYPE (op
)))
8903 /* See what's inside this conversion. If we decide to strip it,
8905 op
= TREE_OPERAND (op
, 0);
8907 /* If we have not stripped any zero-extensions (uns is 0),
8908 we can strip any kind of extension.
8909 If we have previously stripped a zero-extension,
8910 only zero-extensions can safely be stripped.
8911 Any extension can be stripped if the bits it would produce
8912 are all going to be discarded later by truncating to FOR_TYPE. */
8916 if (! uns
|| final_prec
<= TYPE_PRECISION (TREE_TYPE (op
)))
8918 /* TYPE_UNSIGNED says whether this is a zero-extension.
8919 Let's avoid computing it if it does not affect WIN
8920 and if UNS will not be needed again. */
8922 || CONVERT_EXPR_P (op
))
8923 && TYPE_UNSIGNED (TREE_TYPE (op
)))
8931 /* If we finally reach a constant see if it fits in sth smaller and
8932 in that case convert it. */
8933 if (TREE_CODE (win
) == INTEGER_CST
)
8935 tree wtype
= TREE_TYPE (win
);
8936 unsigned prec
= wi::min_precision (wi::to_wide (win
), TYPE_SIGN (wtype
));
8938 prec
= MAX (prec
, final_prec
);
8939 if (prec
< TYPE_PRECISION (wtype
))
8941 tree t
= lang_hooks
.types
.type_for_size (prec
, TYPE_UNSIGNED (wtype
));
8942 if (t
&& TYPE_PRECISION (t
) < TYPE_PRECISION (wtype
))
8943 win
= fold_convert (t
, win
);
8950 /* Return OP or a simpler expression for a narrower value
8951 which can be sign-extended or zero-extended to give back OP.
8952 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
8953 or 0 if the value should be sign-extended. */
8956 get_narrower (tree op
, int *unsignedp_ptr
)
8961 bool integral_p
= INTEGRAL_TYPE_P (TREE_TYPE (op
));
8963 if (TREE_CODE (op
) == COMPOUND_EXPR
)
8966 op
= TREE_OPERAND (op
, 1);
8967 while (TREE_CODE (op
) == COMPOUND_EXPR
);
8968 tree ret
= get_narrower (op
, unsignedp_ptr
);
8971 auto_vec
<tree
, 16> v
;
8973 for (op
= win
; TREE_CODE (op
) == COMPOUND_EXPR
;
8974 op
= TREE_OPERAND (op
, 1))
8976 FOR_EACH_VEC_ELT_REVERSE (v
, i
, op
)
8977 ret
= build2_loc (EXPR_LOCATION (op
), COMPOUND_EXPR
,
8978 TREE_TYPE (ret
), TREE_OPERAND (op
, 0),
8982 while (TREE_CODE (op
) == NOP_EXPR
)
8985 = (TYPE_PRECISION (TREE_TYPE (op
))
8986 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0))));
8988 /* Truncations are many-one so cannot be removed. */
8992 /* See what's inside this conversion. If we decide to strip it,
8997 op
= TREE_OPERAND (op
, 0);
8998 /* An extension: the outermost one can be stripped,
8999 but remember whether it is zero or sign extension. */
9001 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
9002 /* Otherwise, if a sign extension has been stripped,
9003 only sign extensions can now be stripped;
9004 if a zero extension has been stripped, only zero-extensions. */
9005 else if (uns
!= TYPE_UNSIGNED (TREE_TYPE (op
)))
9009 else /* bitschange == 0 */
9011 /* A change in nominal type can always be stripped, but we must
9012 preserve the unsignedness. */
9014 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
9016 op
= TREE_OPERAND (op
, 0);
9017 /* Keep trying to narrow, but don't assign op to win if it
9018 would turn an integral type into something else. */
9019 if (INTEGRAL_TYPE_P (TREE_TYPE (op
)) != integral_p
)
9026 if (TREE_CODE (op
) == COMPONENT_REF
9027 /* Since type_for_size always gives an integer type. */
9028 && TREE_CODE (TREE_TYPE (op
)) != REAL_TYPE
9029 && TREE_CODE (TREE_TYPE (op
)) != FIXED_POINT_TYPE
9030 /* Ensure field is laid out already. */
9031 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0
9032 && tree_fits_uhwi_p (DECL_SIZE (TREE_OPERAND (op
, 1))))
9034 unsigned HOST_WIDE_INT innerprec
9035 = tree_to_uhwi (DECL_SIZE (TREE_OPERAND (op
, 1)));
9036 int unsignedp
= (DECL_UNSIGNED (TREE_OPERAND (op
, 1))
9037 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op
, 1))));
9038 tree type
= lang_hooks
.types
.type_for_size (innerprec
, unsignedp
);
9040 /* We can get this structure field in a narrower type that fits it,
9041 but the resulting extension to its nominal type (a fullword type)
9042 must satisfy the same conditions as for other extensions.
9044 Do this only for fields that are aligned (not bit-fields),
9045 because when bit-field insns will be used there is no
9046 advantage in doing this. */
9048 if (innerprec
< TYPE_PRECISION (TREE_TYPE (op
))
9049 && ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1))
9050 && (first
|| uns
== DECL_UNSIGNED (TREE_OPERAND (op
, 1)))
9054 uns
= DECL_UNSIGNED (TREE_OPERAND (op
, 1));
9055 win
= fold_convert (type
, op
);
9059 *unsignedp_ptr
= uns
;
9063 /* Return true if integer constant C has a value that is permissible
9064 for TYPE, an integral type. */
9067 int_fits_type_p (const_tree c
, const_tree type
)
9069 tree type_low_bound
, type_high_bound
;
9070 bool ok_for_low_bound
, ok_for_high_bound
;
9071 signop sgn_c
= TYPE_SIGN (TREE_TYPE (c
));
9073 /* Non-standard boolean types can have arbitrary precision but various
9074 transformations assume that they can only take values 0 and +/-1. */
9075 if (TREE_CODE (type
) == BOOLEAN_TYPE
)
9076 return wi::fits_to_boolean_p (wi::to_wide (c
), type
);
9079 type_low_bound
= TYPE_MIN_VALUE (type
);
9080 type_high_bound
= TYPE_MAX_VALUE (type
);
9082 /* If at least one bound of the type is a constant integer, we can check
9083 ourselves and maybe make a decision. If no such decision is possible, but
9084 this type is a subtype, try checking against that. Otherwise, use
9085 fits_to_tree_p, which checks against the precision.
9087 Compute the status for each possibly constant bound, and return if we see
9088 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
9089 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
9090 for "constant known to fit". */
9092 /* Check if c >= type_low_bound. */
9093 if (type_low_bound
&& TREE_CODE (type_low_bound
) == INTEGER_CST
)
9095 if (tree_int_cst_lt (c
, type_low_bound
))
9097 ok_for_low_bound
= true;
9100 ok_for_low_bound
= false;
9102 /* Check if c <= type_high_bound. */
9103 if (type_high_bound
&& TREE_CODE (type_high_bound
) == INTEGER_CST
)
9105 if (tree_int_cst_lt (type_high_bound
, c
))
9107 ok_for_high_bound
= true;
9110 ok_for_high_bound
= false;
9112 /* If the constant fits both bounds, the result is known. */
9113 if (ok_for_low_bound
&& ok_for_high_bound
)
9116 /* Perform some generic filtering which may allow making a decision
9117 even if the bounds are not constant. First, negative integers
9118 never fit in unsigned types, */
9119 if (TYPE_UNSIGNED (type
) && sgn_c
== SIGNED
&& wi::neg_p (wi::to_wide (c
)))
9122 /* Second, narrower types always fit in wider ones. */
9123 if (TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (c
)))
9126 /* Third, unsigned integers with top bit set never fit signed types. */
9127 if (!TYPE_UNSIGNED (type
) && sgn_c
== UNSIGNED
)
9129 int prec
= GET_MODE_PRECISION (SCALAR_INT_TYPE_MODE (TREE_TYPE (c
))) - 1;
9130 if (prec
< TYPE_PRECISION (TREE_TYPE (c
)))
9132 /* When a tree_cst is converted to a wide-int, the precision
9133 is taken from the type. However, if the precision of the
9134 mode underneath the type is smaller than that, it is
9135 possible that the value will not fit. The test below
9136 fails if any bit is set between the sign bit of the
9137 underlying mode and the top bit of the type. */
9138 if (wi::zext (wi::to_wide (c
), prec
- 1) != wi::to_wide (c
))
9141 else if (wi::neg_p (wi::to_wide (c
)))
9145 /* If we haven't been able to decide at this point, there nothing more we
9146 can check ourselves here. Look at the base type if we have one and it
9147 has the same precision. */
9148 if (TREE_CODE (type
) == INTEGER_TYPE
9149 && TREE_TYPE (type
) != 0
9150 && TYPE_PRECISION (type
) == TYPE_PRECISION (TREE_TYPE (type
)))
9152 type
= TREE_TYPE (type
);
9156 /* Or to fits_to_tree_p, if nothing else. */
9157 return wi::fits_to_tree_p (wi::to_wide (c
), type
);
9160 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
9161 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
9162 represented (assuming two's-complement arithmetic) within the bit
9163 precision of the type are returned instead. */
9166 get_type_static_bounds (const_tree type
, mpz_t min
, mpz_t max
)
9168 if (!POINTER_TYPE_P (type
) && TYPE_MIN_VALUE (type
)
9169 && TREE_CODE (TYPE_MIN_VALUE (type
)) == INTEGER_CST
)
9170 wi::to_mpz (wi::to_wide (TYPE_MIN_VALUE (type
)), min
, TYPE_SIGN (type
));
9173 if (TYPE_UNSIGNED (type
))
9174 mpz_set_ui (min
, 0);
9177 wide_int mn
= wi::min_value (TYPE_PRECISION (type
), SIGNED
);
9178 wi::to_mpz (mn
, min
, SIGNED
);
9182 if (!POINTER_TYPE_P (type
) && TYPE_MAX_VALUE (type
)
9183 && TREE_CODE (TYPE_MAX_VALUE (type
)) == INTEGER_CST
)
9184 wi::to_mpz (wi::to_wide (TYPE_MAX_VALUE (type
)), max
, TYPE_SIGN (type
));
9187 wide_int mn
= wi::max_value (TYPE_PRECISION (type
), TYPE_SIGN (type
));
9188 wi::to_mpz (mn
, max
, TYPE_SIGN (type
));
9192 /* Return true if VAR is an automatic variable. */
9195 auto_var_p (const_tree var
)
9197 return ((((VAR_P (var
) && ! DECL_EXTERNAL (var
))
9198 || TREE_CODE (var
) == PARM_DECL
)
9199 && ! TREE_STATIC (var
))
9200 || TREE_CODE (var
) == RESULT_DECL
);
9203 /* Return true if VAR is an automatic variable defined in function FN. */
9206 auto_var_in_fn_p (const_tree var
, const_tree fn
)
9208 return (DECL_P (var
) && DECL_CONTEXT (var
) == fn
9209 && (auto_var_p (var
)
9210 || TREE_CODE (var
) == LABEL_DECL
));
9213 /* Subprogram of following function. Called by walk_tree.
9215 Return *TP if it is an automatic variable or parameter of the
9216 function passed in as DATA. */
9219 find_var_from_fn (tree
*tp
, int *walk_subtrees
, void *data
)
9221 tree fn
= (tree
) data
;
9226 else if (DECL_P (*tp
)
9227 && auto_var_in_fn_p (*tp
, fn
))
9233 /* Returns true if T is, contains, or refers to a type with variable
9234 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
9235 arguments, but not the return type. If FN is nonzero, only return
9236 true if a modifier of the type or position of FN is a variable or
9237 parameter inside FN.
9239 This concept is more general than that of C99 'variably modified types':
9240 in C99, a struct type is never variably modified because a VLA may not
9241 appear as a structure member. However, in GNU C code like:
9243 struct S { int i[f()]; };
9245 is valid, and other languages may define similar constructs. */
9248 variably_modified_type_p (tree type
, tree fn
)
9252 /* Test if T is either variable (if FN is zero) or an expression containing
9253 a variable in FN. If TYPE isn't gimplified, return true also if
9254 gimplify_one_sizepos would gimplify the expression into a local
9256 #define RETURN_TRUE_IF_VAR(T) \
9257 do { tree _t = (T); \
9258 if (_t != NULL_TREE \
9259 && _t != error_mark_node \
9260 && !CONSTANT_CLASS_P (_t) \
9261 && TREE_CODE (_t) != PLACEHOLDER_EXPR \
9263 || (!TYPE_SIZES_GIMPLIFIED (type) \
9264 && (TREE_CODE (_t) != VAR_DECL \
9265 && !CONTAINS_PLACEHOLDER_P (_t))) \
9266 || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
9267 return true; } while (0)
9269 if (type
== error_mark_node
)
9272 /* If TYPE itself has variable size, it is variably modified. */
9273 RETURN_TRUE_IF_VAR (TYPE_SIZE (type
));
9274 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type
));
9276 switch (TREE_CODE (type
))
9279 case REFERENCE_TYPE
:
9281 /* Ada can have pointer types refering to themselves indirectly. */
9282 if (TREE_VISITED (type
))
9284 TREE_VISITED (type
) = true;
9285 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
9287 TREE_VISITED (type
) = false;
9290 TREE_VISITED (type
) = false;
9295 /* If TYPE is a function type, it is variably modified if the
9296 return type is variably modified. */
9297 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
9303 case FIXED_POINT_TYPE
:
9306 /* Scalar types are variably modified if their end points
9308 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type
));
9309 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type
));
9314 case QUAL_UNION_TYPE
:
9315 /* We can't see if any of the fields are variably-modified by the
9316 definition we normally use, since that would produce infinite
9317 recursion via pointers. */
9318 /* This is variably modified if some field's type is. */
9319 for (t
= TYPE_FIELDS (type
); t
; t
= DECL_CHAIN (t
))
9320 if (TREE_CODE (t
) == FIELD_DECL
)
9322 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t
));
9323 RETURN_TRUE_IF_VAR (DECL_SIZE (t
));
9324 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t
));
9326 /* If the type is a qualified union, then the DECL_QUALIFIER
9327 of fields can also be an expression containing a variable. */
9328 if (TREE_CODE (type
) == QUAL_UNION_TYPE
)
9329 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t
));
9331 /* If the field is a qualified union, then it's only a container
9332 for what's inside so we look into it. That's necessary in LTO
9333 mode because the sizes of the field tested above have been set
9334 to PLACEHOLDER_EXPRs by free_lang_data. */
9335 if (TREE_CODE (TREE_TYPE (t
)) == QUAL_UNION_TYPE
9336 && variably_modified_type_p (TREE_TYPE (t
), fn
))
9342 /* Do not call ourselves to avoid infinite recursion. This is
9343 variably modified if the element type is. */
9344 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type
)));
9345 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type
)));
9352 /* The current language may have other cases to check, but in general,
9353 all other types are not variably modified. */
9354 return lang_hooks
.tree_inlining
.var_mod_type_p (type
, fn
);
9356 #undef RETURN_TRUE_IF_VAR
9359 /* Given a DECL or TYPE, return the scope in which it was declared, or
9360 NULL_TREE if there is no containing scope. */
9363 get_containing_scope (const_tree t
)
9365 return (TYPE_P (t
) ? TYPE_CONTEXT (t
) : DECL_CONTEXT (t
));
9368 /* Returns the ultimate TRANSLATION_UNIT_DECL context of DECL or NULL. */
9371 get_ultimate_context (const_tree decl
)
9373 while (decl
&& TREE_CODE (decl
) != TRANSLATION_UNIT_DECL
)
9375 if (TREE_CODE (decl
) == BLOCK
)
9376 decl
= BLOCK_SUPERCONTEXT (decl
);
9378 decl
= get_containing_scope (decl
);
9383 /* Return the innermost context enclosing DECL that is
9384 a FUNCTION_DECL, or zero if none. */
9387 decl_function_context (const_tree decl
)
9391 if (TREE_CODE (decl
) == ERROR_MARK
)
9394 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
9395 where we look up the function at runtime. Such functions always take
9396 a first argument of type 'pointer to real context'.
9398 C++ should really be fixed to use DECL_CONTEXT for the real context,
9399 and use something else for the "virtual context". */
9400 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VIRTUAL_P (decl
))
9403 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl
)))));
9405 context
= DECL_CONTEXT (decl
);
9407 while (context
&& TREE_CODE (context
) != FUNCTION_DECL
)
9409 if (TREE_CODE (context
) == BLOCK
)
9410 context
= BLOCK_SUPERCONTEXT (context
);
9412 context
= get_containing_scope (context
);
9418 /* Return the innermost context enclosing DECL that is
9419 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
9420 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
9423 decl_type_context (const_tree decl
)
9425 tree context
= DECL_CONTEXT (decl
);
9428 switch (TREE_CODE (context
))
9430 case NAMESPACE_DECL
:
9431 case TRANSLATION_UNIT_DECL
:
9436 case QUAL_UNION_TYPE
:
9441 context
= DECL_CONTEXT (context
);
9445 context
= BLOCK_SUPERCONTEXT (context
);
9455 /* CALL is a CALL_EXPR. Return the declaration for the function
9456 called, or NULL_TREE if the called function cannot be
9460 get_callee_fndecl (const_tree call
)
9464 if (call
== error_mark_node
)
9465 return error_mark_node
;
9467 /* It's invalid to call this function with anything but a
9469 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
9471 /* The first operand to the CALL is the address of the function
9473 addr
= CALL_EXPR_FN (call
);
9475 /* If there is no function, return early. */
9476 if (addr
== NULL_TREE
)
9481 /* If this is a readonly function pointer, extract its initial value. */
9482 if (DECL_P (addr
) && TREE_CODE (addr
) != FUNCTION_DECL
9483 && TREE_READONLY (addr
) && ! TREE_THIS_VOLATILE (addr
)
9484 && DECL_INITIAL (addr
))
9485 addr
= DECL_INITIAL (addr
);
9487 /* If the address is just `&f' for some function `f', then we know
9488 that `f' is being called. */
9489 if (TREE_CODE (addr
) == ADDR_EXPR
9490 && TREE_CODE (TREE_OPERAND (addr
, 0)) == FUNCTION_DECL
)
9491 return TREE_OPERAND (addr
, 0);
9493 /* We couldn't figure out what was being called. */
9497 /* If CALL_EXPR CALL calls a normal built-in function or an internal function,
9498 return the associated function code, otherwise return CFN_LAST. */
9501 get_call_combined_fn (const_tree call
)
9503 /* It's invalid to call this function with anything but a CALL_EXPR. */
9504 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
9506 if (!CALL_EXPR_FN (call
))
9507 return as_combined_fn (CALL_EXPR_IFN (call
));
9509 tree fndecl
= get_callee_fndecl (call
);
9510 if (fndecl
&& fndecl_built_in_p (fndecl
, BUILT_IN_NORMAL
))
9511 return as_combined_fn (DECL_FUNCTION_CODE (fndecl
));
9516 /* Comparator of indices based on tree_node_counts. */
9519 tree_nodes_cmp (const void *p1
, const void *p2
)
9521 const unsigned *n1
= (const unsigned *)p1
;
9522 const unsigned *n2
= (const unsigned *)p2
;
9524 return tree_node_counts
[*n1
] - tree_node_counts
[*n2
];
9527 /* Comparator of indices based on tree_code_counts. */
9530 tree_codes_cmp (const void *p1
, const void *p2
)
9532 const unsigned *n1
= (const unsigned *)p1
;
9533 const unsigned *n2
= (const unsigned *)p2
;
9535 return tree_code_counts
[*n1
] - tree_code_counts
[*n2
];
9538 #define TREE_MEM_USAGE_SPACES 40
9540 /* Print debugging information about tree nodes generated during the compile,
9541 and any language-specific information. */
9544 dump_tree_statistics (void)
9546 if (GATHER_STATISTICS
)
9548 uint64_t total_nodes
, total_bytes
;
9549 fprintf (stderr
, "\nKind Nodes Bytes\n");
9550 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9551 total_nodes
= total_bytes
= 0;
9554 auto_vec
<unsigned> indices (all_kinds
);
9555 for (unsigned i
= 0; i
< all_kinds
; i
++)
9556 indices
.quick_push (i
);
9557 indices
.qsort (tree_nodes_cmp
);
9559 for (unsigned i
= 0; i
< (int) all_kinds
; i
++)
9561 unsigned j
= indices
[i
];
9562 fprintf (stderr
, "%-20s %6" PRIu64
"%c %9" PRIu64
"%c\n",
9563 tree_node_kind_names
[j
], SIZE_AMOUNT (tree_node_counts
[j
]),
9564 SIZE_AMOUNT (tree_node_sizes
[j
]));
9565 total_nodes
+= tree_node_counts
[j
];
9566 total_bytes
+= tree_node_sizes
[j
];
9568 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9569 fprintf (stderr
, "%-20s %6" PRIu64
"%c %9" PRIu64
"%c\n", "Total",
9570 SIZE_AMOUNT (total_nodes
), SIZE_AMOUNT (total_bytes
));
9571 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9575 fprintf (stderr
, "Code Nodes\n");
9576 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9578 auto_vec
<unsigned> indices (MAX_TREE_CODES
);
9579 for (unsigned i
= 0; i
< MAX_TREE_CODES
; i
++)
9580 indices
.quick_push (i
);
9581 indices
.qsort (tree_codes_cmp
);
9583 for (unsigned i
= 0; i
< MAX_TREE_CODES
; i
++)
9585 unsigned j
= indices
[i
];
9586 fprintf (stderr
, "%-32s %6" PRIu64
"%c\n",
9587 get_tree_code_name ((enum tree_code
) j
),
9588 SIZE_AMOUNT (tree_code_counts
[j
]));
9590 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9591 fprintf (stderr
, "\n");
9592 ssanames_print_statistics ();
9593 fprintf (stderr
, "\n");
9594 phinodes_print_statistics ();
9595 fprintf (stderr
, "\n");
9599 fprintf (stderr
, "(No per-node statistics)\n");
9601 print_type_hash_statistics ();
9602 print_debug_expr_statistics ();
9603 print_value_expr_statistics ();
9604 lang_hooks
.print_statistics ();
9607 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
9609 /* Generate a crc32 of the low BYTES bytes of VALUE. */
9612 crc32_unsigned_n (unsigned chksum
, unsigned value
, unsigned bytes
)
9614 /* This relies on the raw feedback's top 4 bits being zero. */
9615 #define FEEDBACK(X) ((X) * 0x04c11db7)
9616 #define SYNDROME(X) (FEEDBACK ((X) & 1) ^ FEEDBACK ((X) & 2) \
9617 ^ FEEDBACK ((X) & 4) ^ FEEDBACK ((X) & 8))
9618 static const unsigned syndromes
[16] =
9620 SYNDROME(0x0), SYNDROME(0x1), SYNDROME(0x2), SYNDROME(0x3),
9621 SYNDROME(0x4), SYNDROME(0x5), SYNDROME(0x6), SYNDROME(0x7),
9622 SYNDROME(0x8), SYNDROME(0x9), SYNDROME(0xa), SYNDROME(0xb),
9623 SYNDROME(0xc), SYNDROME(0xd), SYNDROME(0xe), SYNDROME(0xf),
9628 value
<<= (32 - bytes
* 8);
9629 for (unsigned ix
= bytes
* 2; ix
--; value
<<= 4)
9631 unsigned feedback
= syndromes
[((value
^ chksum
) >> 28) & 0xf];
9633 chksum
= (chksum
<< 4) ^ feedback
;
9639 /* Generate a crc32 of a string. */
9642 crc32_string (unsigned chksum
, const char *string
)
9645 chksum
= crc32_byte (chksum
, *string
);
9650 /* P is a string that will be used in a symbol. Mask out any characters
9651 that are not valid in that context. */
9654 clean_symbol_name (char *p
)
9658 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
9661 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
9668 static GTY(()) unsigned anon_cnt
= 0; /* Saved for PCH. */
9670 /* Create a unique anonymous identifier. The identifier is still a
9671 valid assembly label. */
9677 #if !defined (NO_DOT_IN_LABEL)
9679 #elif !defined (NO_DOLLAR_IN_LABEL)
9687 int len
= snprintf (buf
, sizeof (buf
), fmt
, anon_cnt
++);
9688 gcc_checking_assert (len
< int (sizeof (buf
)));
9690 tree id
= get_identifier_with_length (buf
, len
);
9691 IDENTIFIER_ANON_P (id
) = true;
9696 /* Generate a name for a special-purpose function.
9697 The generated name may need to be unique across the whole link.
9698 Changes to this function may also require corresponding changes to
9699 xstrdup_mask_random.
9700 TYPE is some string to identify the purpose of this function to the
9701 linker or collect2; it must start with an uppercase letter,
9703 I - for constructors
9705 N - for C++ anonymous namespaces
9706 F - for DWARF unwind frame information. */
9709 get_file_function_name (const char *type
)
9715 /* If we already have a name we know to be unique, just use that. */
9716 if (first_global_object_name
)
9717 p
= q
= ASTRDUP (first_global_object_name
);
9718 /* If the target is handling the constructors/destructors, they
9719 will be local to this file and the name is only necessary for
9721 We also assign sub_I and sub_D sufixes to constructors called from
9722 the global static constructors. These are always local. */
9723 else if (((type
[0] == 'I' || type
[0] == 'D') && targetm
.have_ctors_dtors
)
9724 || (strncmp (type
, "sub_", 4) == 0
9725 && (type
[4] == 'I' || type
[4] == 'D')))
9727 const char *file
= main_input_filename
;
9729 file
= LOCATION_FILE (input_location
);
9730 /* Just use the file's basename, because the full pathname
9731 might be quite long. */
9732 p
= q
= ASTRDUP (lbasename (file
));
9736 /* Otherwise, the name must be unique across the entire link.
9737 We don't have anything that we know to be unique to this translation
9738 unit, so use what we do have and throw in some randomness. */
9740 const char *name
= weak_global_object_name
;
9741 const char *file
= main_input_filename
;
9746 file
= LOCATION_FILE (input_location
);
9748 len
= strlen (file
);
9749 q
= (char *) alloca (9 + 19 + len
+ 1);
9750 memcpy (q
, file
, len
+ 1);
9752 snprintf (q
+ len
, 9 + 19 + 1, "_%08X_" HOST_WIDE_INT_PRINT_HEX
,
9753 crc32_string (0, name
), get_random_seed (false));
9758 clean_symbol_name (q
);
9759 buf
= (char *) alloca (sizeof (FILE_FUNCTION_FORMAT
) + strlen (p
)
9762 /* Set up the name of the file-level functions we may need.
9763 Use a global object (which is already required to be unique over
9764 the program) rather than the file name (which imposes extra
9766 sprintf (buf
, FILE_FUNCTION_FORMAT
, type
, p
);
9768 return get_identifier (buf
);
9771 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
9773 /* Complain that the tree code of NODE does not match the expected 0
9774 terminated list of trailing codes. The trailing code list can be
9775 empty, for a more vague error message. FILE, LINE, and FUNCTION
9776 are of the caller. */
9779 tree_check_failed (const_tree node
, const char *file
,
9780 int line
, const char *function
, ...)
9784 unsigned length
= 0;
9785 enum tree_code code
;
9787 va_start (args
, function
);
9788 while ((code
= (enum tree_code
) va_arg (args
, int)))
9789 length
+= 4 + strlen (get_tree_code_name (code
));
9794 va_start (args
, function
);
9795 length
+= strlen ("expected ");
9796 buffer
= tmp
= (char *) alloca (length
);
9798 while ((code
= (enum tree_code
) va_arg (args
, int)))
9800 const char *prefix
= length
? " or " : "expected ";
9802 strcpy (tmp
+ length
, prefix
);
9803 length
+= strlen (prefix
);
9804 strcpy (tmp
+ length
, get_tree_code_name (code
));
9805 length
+= strlen (get_tree_code_name (code
));
9810 buffer
= "unexpected node";
9812 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9813 buffer
, get_tree_code_name (TREE_CODE (node
)),
9814 function
, trim_filename (file
), line
);
9817 /* Complain that the tree code of NODE does match the expected 0
9818 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
9822 tree_not_check_failed (const_tree node
, const char *file
,
9823 int line
, const char *function
, ...)
9827 unsigned length
= 0;
9828 enum tree_code code
;
9830 va_start (args
, function
);
9831 while ((code
= (enum tree_code
) va_arg (args
, int)))
9832 length
+= 4 + strlen (get_tree_code_name (code
));
9834 va_start (args
, function
);
9835 buffer
= (char *) alloca (length
);
9837 while ((code
= (enum tree_code
) va_arg (args
, int)))
9841 strcpy (buffer
+ length
, " or ");
9844 strcpy (buffer
+ length
, get_tree_code_name (code
));
9845 length
+= strlen (get_tree_code_name (code
));
9849 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
9850 buffer
, get_tree_code_name (TREE_CODE (node
)),
9851 function
, trim_filename (file
), line
);
9854 /* Similar to tree_check_failed, except that we check for a class of tree
9855 code, given in CL. */
9858 tree_class_check_failed (const_tree node
, const enum tree_code_class cl
,
9859 const char *file
, int line
, const char *function
)
9862 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
9863 TREE_CODE_CLASS_STRING (cl
),
9864 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
9865 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9868 /* Similar to tree_check_failed, except that instead of specifying a
9869 dozen codes, use the knowledge that they're all sequential. */
9872 tree_range_check_failed (const_tree node
, const char *file
, int line
,
9873 const char *function
, enum tree_code c1
,
9877 unsigned length
= 0;
9880 for (c
= c1
; c
<= c2
; ++c
)
9881 length
+= 4 + strlen (get_tree_code_name ((enum tree_code
) c
));
9883 length
+= strlen ("expected ");
9884 buffer
= (char *) alloca (length
);
9887 for (c
= c1
; c
<= c2
; ++c
)
9889 const char *prefix
= length
? " or " : "expected ";
9891 strcpy (buffer
+ length
, prefix
);
9892 length
+= strlen (prefix
);
9893 strcpy (buffer
+ length
, get_tree_code_name ((enum tree_code
) c
));
9894 length
+= strlen (get_tree_code_name ((enum tree_code
) c
));
9897 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9898 buffer
, get_tree_code_name (TREE_CODE (node
)),
9899 function
, trim_filename (file
), line
);
9903 /* Similar to tree_check_failed, except that we check that a tree does
9904 not have the specified code, given in CL. */
9907 tree_not_class_check_failed (const_tree node
, const enum tree_code_class cl
,
9908 const char *file
, int line
, const char *function
)
9911 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
9912 TREE_CODE_CLASS_STRING (cl
),
9913 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
9914 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9918 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
9921 omp_clause_check_failed (const_tree node
, const char *file
, int line
,
9922 const char *function
, enum omp_clause_code code
)
9924 internal_error ("tree check: expected %<omp_clause %s%>, have %qs "
9926 omp_clause_code_name
[code
],
9927 get_tree_code_name (TREE_CODE (node
)),
9928 function
, trim_filename (file
), line
);
9932 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
9935 omp_clause_range_check_failed (const_tree node
, const char *file
, int line
,
9936 const char *function
, enum omp_clause_code c1
,
9937 enum omp_clause_code c2
)
9940 unsigned length
= 0;
9943 for (c
= c1
; c
<= c2
; ++c
)
9944 length
+= 4 + strlen (omp_clause_code_name
[c
]);
9946 length
+= strlen ("expected ");
9947 buffer
= (char *) alloca (length
);
9950 for (c
= c1
; c
<= c2
; ++c
)
9952 const char *prefix
= length
? " or " : "expected ";
9954 strcpy (buffer
+ length
, prefix
);
9955 length
+= strlen (prefix
);
9956 strcpy (buffer
+ length
, omp_clause_code_name
[c
]);
9957 length
+= strlen (omp_clause_code_name
[c
]);
9960 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9961 buffer
, omp_clause_code_name
[TREE_CODE (node
)],
9962 function
, trim_filename (file
), line
);
9966 #undef DEFTREESTRUCT
9967 #define DEFTREESTRUCT(VAL, NAME) NAME,
9969 static const char *ts_enum_names
[] = {
9970 #include "treestruct.def"
9972 #undef DEFTREESTRUCT
9974 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
9976 /* Similar to tree_class_check_failed, except that we check for
9977 whether CODE contains the tree structure identified by EN. */
9980 tree_contains_struct_check_failed (const_tree node
,
9981 const enum tree_node_structure_enum en
,
9982 const char *file
, int line
,
9983 const char *function
)
9986 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
9988 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9992 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9993 (dynamically sized) vector. */
9996 tree_int_cst_elt_check_failed (int idx
, int len
, const char *file
, int line
,
9997 const char *function
)
10000 ("tree check: accessed elt %d of %<tree_int_cst%> with %d elts in %s, "
10002 idx
+ 1, len
, function
, trim_filename (file
), line
);
10005 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
10006 (dynamically sized) vector. */
10009 tree_vec_elt_check_failed (int idx
, int len
, const char *file
, int line
,
10010 const char *function
)
10013 ("tree check: accessed elt %d of %<tree_vec%> with %d elts in %s, at %s:%d",
10014 idx
+ 1, len
, function
, trim_filename (file
), line
);
10017 /* Similar to above, except that the check is for the bounds of the operand
10018 vector of an expression node EXP. */
10021 tree_operand_check_failed (int idx
, const_tree exp
, const char *file
,
10022 int line
, const char *function
)
10024 enum tree_code code
= TREE_CODE (exp
);
10026 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
10027 idx
+ 1, get_tree_code_name (code
), TREE_OPERAND_LENGTH (exp
),
10028 function
, trim_filename (file
), line
);
10031 /* Similar to above, except that the check is for the number of
10032 operands of an OMP_CLAUSE node. */
10035 omp_clause_operand_check_failed (int idx
, const_tree t
, const char *file
,
10036 int line
, const char *function
)
10039 ("tree check: accessed operand %d of %<omp_clause %s%> with %d operands "
10040 "in %s, at %s:%d", idx
+ 1, omp_clause_code_name
[OMP_CLAUSE_CODE (t
)],
10041 omp_clause_num_ops
[OMP_CLAUSE_CODE (t
)], function
,
10042 trim_filename (file
), line
);
10044 #endif /* ENABLE_TREE_CHECKING */
10046 /* Create a new vector type node holding NUNITS units of type INNERTYPE,
10047 and mapped to the machine mode MODE. Initialize its fields and build
10048 the information necessary for debugging output. */
10051 make_vector_type (tree innertype
, poly_int64 nunits
, machine_mode mode
)
10054 tree mv_innertype
= TYPE_MAIN_VARIANT (innertype
);
10056 t
= make_node (VECTOR_TYPE
);
10057 TREE_TYPE (t
) = mv_innertype
;
10058 SET_TYPE_VECTOR_SUBPARTS (t
, nunits
);
10059 SET_TYPE_MODE (t
, mode
);
10061 if (TYPE_STRUCTURAL_EQUALITY_P (mv_innertype
) || in_lto_p
)
10062 SET_TYPE_STRUCTURAL_EQUALITY (t
);
10063 else if ((TYPE_CANONICAL (mv_innertype
) != innertype
10064 || mode
!= VOIDmode
)
10065 && !VECTOR_BOOLEAN_TYPE_P (t
))
10067 = make_vector_type (TYPE_CANONICAL (mv_innertype
), nunits
, VOIDmode
);
10071 hashval_t hash
= type_hash_canon_hash (t
);
10072 t
= type_hash_canon (hash
, t
);
10074 /* We have built a main variant, based on the main variant of the
10075 inner type. Use it to build the variant we return. */
10076 if ((TYPE_ATTRIBUTES (innertype
) || TYPE_QUALS (innertype
))
10077 && TREE_TYPE (t
) != innertype
)
10078 return build_type_attribute_qual_variant (t
,
10079 TYPE_ATTRIBUTES (innertype
),
10080 TYPE_QUALS (innertype
));
10086 make_or_reuse_type (unsigned size
, int unsignedp
)
10090 if (size
== INT_TYPE_SIZE
)
10091 return unsignedp
? unsigned_type_node
: integer_type_node
;
10092 if (size
== CHAR_TYPE_SIZE
)
10093 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
10094 if (size
== SHORT_TYPE_SIZE
)
10095 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
10096 if (size
== LONG_TYPE_SIZE
)
10097 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
10098 if (size
== LONG_LONG_TYPE_SIZE
)
10099 return (unsignedp
? long_long_unsigned_type_node
10100 : long_long_integer_type_node
);
10102 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
10103 if (size
== int_n_data
[i
].bitsize
10104 && int_n_enabled_p
[i
])
10105 return (unsignedp
? int_n_trees
[i
].unsigned_type
10106 : int_n_trees
[i
].signed_type
);
10109 return make_unsigned_type (size
);
10111 return make_signed_type (size
);
10114 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
10117 make_or_reuse_fract_type (unsigned size
, int unsignedp
, int satp
)
10121 if (size
== SHORT_FRACT_TYPE_SIZE
)
10122 return unsignedp
? sat_unsigned_short_fract_type_node
10123 : sat_short_fract_type_node
;
10124 if (size
== FRACT_TYPE_SIZE
)
10125 return unsignedp
? sat_unsigned_fract_type_node
: sat_fract_type_node
;
10126 if (size
== LONG_FRACT_TYPE_SIZE
)
10127 return unsignedp
? sat_unsigned_long_fract_type_node
10128 : sat_long_fract_type_node
;
10129 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
10130 return unsignedp
? sat_unsigned_long_long_fract_type_node
10131 : sat_long_long_fract_type_node
;
10135 if (size
== SHORT_FRACT_TYPE_SIZE
)
10136 return unsignedp
? unsigned_short_fract_type_node
10137 : short_fract_type_node
;
10138 if (size
== FRACT_TYPE_SIZE
)
10139 return unsignedp
? unsigned_fract_type_node
: fract_type_node
;
10140 if (size
== LONG_FRACT_TYPE_SIZE
)
10141 return unsignedp
? unsigned_long_fract_type_node
10142 : long_fract_type_node
;
10143 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
10144 return unsignedp
? unsigned_long_long_fract_type_node
10145 : long_long_fract_type_node
;
10148 return make_fract_type (size
, unsignedp
, satp
);
10151 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
10154 make_or_reuse_accum_type (unsigned size
, int unsignedp
, int satp
)
10158 if (size
== SHORT_ACCUM_TYPE_SIZE
)
10159 return unsignedp
? sat_unsigned_short_accum_type_node
10160 : sat_short_accum_type_node
;
10161 if (size
== ACCUM_TYPE_SIZE
)
10162 return unsignedp
? sat_unsigned_accum_type_node
: sat_accum_type_node
;
10163 if (size
== LONG_ACCUM_TYPE_SIZE
)
10164 return unsignedp
? sat_unsigned_long_accum_type_node
10165 : sat_long_accum_type_node
;
10166 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
10167 return unsignedp
? sat_unsigned_long_long_accum_type_node
10168 : sat_long_long_accum_type_node
;
10172 if (size
== SHORT_ACCUM_TYPE_SIZE
)
10173 return unsignedp
? unsigned_short_accum_type_node
10174 : short_accum_type_node
;
10175 if (size
== ACCUM_TYPE_SIZE
)
10176 return unsignedp
? unsigned_accum_type_node
: accum_type_node
;
10177 if (size
== LONG_ACCUM_TYPE_SIZE
)
10178 return unsignedp
? unsigned_long_accum_type_node
10179 : long_accum_type_node
;
10180 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
10181 return unsignedp
? unsigned_long_long_accum_type_node
10182 : long_long_accum_type_node
;
10185 return make_accum_type (size
, unsignedp
, satp
);
10189 /* Create an atomic variant node for TYPE. This routine is called
10190 during initialization of data types to create the 5 basic atomic
10191 types. The generic build_variant_type function requires these to
10192 already be set up in order to function properly, so cannot be
10193 called from there. If ALIGN is non-zero, then ensure alignment is
10194 overridden to this value. */
10197 build_atomic_base (tree type
, unsigned int align
)
10201 /* Make sure its not already registered. */
10202 if ((t
= get_qualified_type (type
, TYPE_QUAL_ATOMIC
)))
10205 t
= build_variant_type_copy (type
);
10206 set_type_quals (t
, TYPE_QUAL_ATOMIC
);
10209 SET_TYPE_ALIGN (t
, align
);
10214 /* Information about the _FloatN and _FloatNx types. This must be in
10215 the same order as the corresponding TI_* enum values. */
10216 const floatn_type_info floatn_nx_types
[NUM_FLOATN_NX_TYPES
] =
10228 /* Create nodes for all integer types (and error_mark_node) using the sizes
10229 of C datatypes. SIGNED_CHAR specifies whether char is signed. */
10232 build_common_tree_nodes (bool signed_char
)
10236 error_mark_node
= make_node (ERROR_MARK
);
10237 TREE_TYPE (error_mark_node
) = error_mark_node
;
10239 initialize_sizetypes ();
10241 /* Define both `signed char' and `unsigned char'. */
10242 signed_char_type_node
= make_signed_type (CHAR_TYPE_SIZE
);
10243 TYPE_STRING_FLAG (signed_char_type_node
) = 1;
10244 unsigned_char_type_node
= make_unsigned_type (CHAR_TYPE_SIZE
);
10245 TYPE_STRING_FLAG (unsigned_char_type_node
) = 1;
10247 /* Define `char', which is like either `signed char' or `unsigned char'
10248 but not the same as either. */
10251 ? make_signed_type (CHAR_TYPE_SIZE
)
10252 : make_unsigned_type (CHAR_TYPE_SIZE
));
10253 TYPE_STRING_FLAG (char_type_node
) = 1;
10255 short_integer_type_node
= make_signed_type (SHORT_TYPE_SIZE
);
10256 short_unsigned_type_node
= make_unsigned_type (SHORT_TYPE_SIZE
);
10257 integer_type_node
= make_signed_type (INT_TYPE_SIZE
);
10258 unsigned_type_node
= make_unsigned_type (INT_TYPE_SIZE
);
10259 long_integer_type_node
= make_signed_type (LONG_TYPE_SIZE
);
10260 long_unsigned_type_node
= make_unsigned_type (LONG_TYPE_SIZE
);
10261 long_long_integer_type_node
= make_signed_type (LONG_LONG_TYPE_SIZE
);
10262 long_long_unsigned_type_node
= make_unsigned_type (LONG_LONG_TYPE_SIZE
);
10264 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
10266 int_n_trees
[i
].signed_type
= make_signed_type (int_n_data
[i
].bitsize
);
10267 int_n_trees
[i
].unsigned_type
= make_unsigned_type (int_n_data
[i
].bitsize
);
10269 if (int_n_enabled_p
[i
])
10271 integer_types
[itk_intN_0
+ i
* 2] = int_n_trees
[i
].signed_type
;
10272 integer_types
[itk_unsigned_intN_0
+ i
* 2] = int_n_trees
[i
].unsigned_type
;
10276 /* Define a boolean type. This type only represents boolean values but
10277 may be larger than char depending on the value of BOOL_TYPE_SIZE. */
10278 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
10279 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
10280 TYPE_PRECISION (boolean_type_node
) = 1;
10281 TYPE_MAX_VALUE (boolean_type_node
) = build_int_cst (boolean_type_node
, 1);
10283 /* Define what type to use for size_t. */
10284 if (strcmp (SIZE_TYPE
, "unsigned int") == 0)
10285 size_type_node
= unsigned_type_node
;
10286 else if (strcmp (SIZE_TYPE
, "long unsigned int") == 0)
10287 size_type_node
= long_unsigned_type_node
;
10288 else if (strcmp (SIZE_TYPE
, "long long unsigned int") == 0)
10289 size_type_node
= long_long_unsigned_type_node
;
10290 else if (strcmp (SIZE_TYPE
, "short unsigned int") == 0)
10291 size_type_node
= short_unsigned_type_node
;
10296 size_type_node
= NULL_TREE
;
10297 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
10298 if (int_n_enabled_p
[i
])
10300 char name
[50], altname
[50];
10301 sprintf (name
, "__int%d unsigned", int_n_data
[i
].bitsize
);
10302 sprintf (altname
, "__int%d__ unsigned", int_n_data
[i
].bitsize
);
10304 if (strcmp (name
, SIZE_TYPE
) == 0
10305 || strcmp (altname
, SIZE_TYPE
) == 0)
10307 size_type_node
= int_n_trees
[i
].unsigned_type
;
10310 if (size_type_node
== NULL_TREE
)
10311 gcc_unreachable ();
10314 /* Define what type to use for ptrdiff_t. */
10315 if (strcmp (PTRDIFF_TYPE
, "int") == 0)
10316 ptrdiff_type_node
= integer_type_node
;
10317 else if (strcmp (PTRDIFF_TYPE
, "long int") == 0)
10318 ptrdiff_type_node
= long_integer_type_node
;
10319 else if (strcmp (PTRDIFF_TYPE
, "long long int") == 0)
10320 ptrdiff_type_node
= long_long_integer_type_node
;
10321 else if (strcmp (PTRDIFF_TYPE
, "short int") == 0)
10322 ptrdiff_type_node
= short_integer_type_node
;
10325 ptrdiff_type_node
= NULL_TREE
;
10326 for (int i
= 0; i
< NUM_INT_N_ENTS
; i
++)
10327 if (int_n_enabled_p
[i
])
10329 char name
[50], altname
[50];
10330 sprintf (name
, "__int%d", int_n_data
[i
].bitsize
);
10331 sprintf (altname
, "__int%d__", int_n_data
[i
].bitsize
);
10333 if (strcmp (name
, PTRDIFF_TYPE
) == 0
10334 || strcmp (altname
, PTRDIFF_TYPE
) == 0)
10335 ptrdiff_type_node
= int_n_trees
[i
].signed_type
;
10337 if (ptrdiff_type_node
== NULL_TREE
)
10338 gcc_unreachable ();
10341 /* Fill in the rest of the sized types. Reuse existing type nodes
10343 intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 0);
10344 intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 0);
10345 intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 0);
10346 intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 0);
10347 intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 0);
10349 unsigned_intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 1);
10350 unsigned_intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 1);
10351 unsigned_intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 1);
10352 unsigned_intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 1);
10353 unsigned_intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 1);
10355 /* Don't call build_qualified type for atomics. That routine does
10356 special processing for atomics, and until they are initialized
10357 it's better not to make that call.
10359 Check to see if there is a target override for atomic types. */
10361 atomicQI_type_node
= build_atomic_base (unsigned_intQI_type_node
,
10362 targetm
.atomic_align_for_mode (QImode
));
10363 atomicHI_type_node
= build_atomic_base (unsigned_intHI_type_node
,
10364 targetm
.atomic_align_for_mode (HImode
));
10365 atomicSI_type_node
= build_atomic_base (unsigned_intSI_type_node
,
10366 targetm
.atomic_align_for_mode (SImode
));
10367 atomicDI_type_node
= build_atomic_base (unsigned_intDI_type_node
,
10368 targetm
.atomic_align_for_mode (DImode
));
10369 atomicTI_type_node
= build_atomic_base (unsigned_intTI_type_node
,
10370 targetm
.atomic_align_for_mode (TImode
));
10372 access_public_node
= get_identifier ("public");
10373 access_protected_node
= get_identifier ("protected");
10374 access_private_node
= get_identifier ("private");
10376 /* Define these next since types below may used them. */
10377 integer_zero_node
= build_int_cst (integer_type_node
, 0);
10378 integer_one_node
= build_int_cst (integer_type_node
, 1);
10379 integer_three_node
= build_int_cst (integer_type_node
, 3);
10380 integer_minus_one_node
= build_int_cst (integer_type_node
, -1);
10382 size_zero_node
= size_int (0);
10383 size_one_node
= size_int (1);
10384 bitsize_zero_node
= bitsize_int (0);
10385 bitsize_one_node
= bitsize_int (1);
10386 bitsize_unit_node
= bitsize_int (BITS_PER_UNIT
);
10388 boolean_false_node
= TYPE_MIN_VALUE (boolean_type_node
);
10389 boolean_true_node
= TYPE_MAX_VALUE (boolean_type_node
);
10391 void_type_node
= make_node (VOID_TYPE
);
10392 layout_type (void_type_node
);
10394 /* We are not going to have real types in C with less than byte alignment,
10395 so we might as well not have any types that claim to have it. */
10396 SET_TYPE_ALIGN (void_type_node
, BITS_PER_UNIT
);
10397 TYPE_USER_ALIGN (void_type_node
) = 0;
10399 void_node
= make_node (VOID_CST
);
10400 TREE_TYPE (void_node
) = void_type_node
;
10402 null_pointer_node
= build_int_cst (build_pointer_type (void_type_node
), 0);
10403 layout_type (TREE_TYPE (null_pointer_node
));
10405 ptr_type_node
= build_pointer_type (void_type_node
);
10406 const_ptr_type_node
10407 = build_pointer_type (build_type_variant (void_type_node
, 1, 0));
10408 for (unsigned i
= 0;
10409 i
< sizeof (builtin_structptr_types
) / sizeof (builtin_structptr_type
);
10411 builtin_structptr_types
[i
].node
= builtin_structptr_types
[i
].base
;
10413 pointer_sized_int_node
= build_nonstandard_integer_type (POINTER_SIZE
, 1);
10415 float_type_node
= make_node (REAL_TYPE
);
10416 TYPE_PRECISION (float_type_node
) = FLOAT_TYPE_SIZE
;
10417 layout_type (float_type_node
);
10419 double_type_node
= make_node (REAL_TYPE
);
10420 TYPE_PRECISION (double_type_node
) = DOUBLE_TYPE_SIZE
;
10421 layout_type (double_type_node
);
10423 long_double_type_node
= make_node (REAL_TYPE
);
10424 TYPE_PRECISION (long_double_type_node
) = LONG_DOUBLE_TYPE_SIZE
;
10425 layout_type (long_double_type_node
);
10427 for (i
= 0; i
< NUM_FLOATN_NX_TYPES
; i
++)
10429 int n
= floatn_nx_types
[i
].n
;
10430 bool extended
= floatn_nx_types
[i
].extended
;
10431 scalar_float_mode mode
;
10432 if (!targetm
.floatn_mode (n
, extended
).exists (&mode
))
10434 int precision
= GET_MODE_PRECISION (mode
);
10435 /* Work around the rs6000 KFmode having precision 113 not
10437 const struct real_format
*fmt
= REAL_MODE_FORMAT (mode
);
10438 gcc_assert (fmt
->b
== 2 && fmt
->emin
+ fmt
->emax
== 3);
10439 int min_precision
= fmt
->p
+ ceil_log2 (fmt
->emax
- fmt
->emin
);
10441 gcc_assert (min_precision
== n
);
10442 if (precision
< min_precision
)
10443 precision
= min_precision
;
10444 FLOATN_NX_TYPE_NODE (i
) = make_node (REAL_TYPE
);
10445 TYPE_PRECISION (FLOATN_NX_TYPE_NODE (i
)) = precision
;
10446 layout_type (FLOATN_NX_TYPE_NODE (i
));
10447 SET_TYPE_MODE (FLOATN_NX_TYPE_NODE (i
), mode
);
10450 float_ptr_type_node
= build_pointer_type (float_type_node
);
10451 double_ptr_type_node
= build_pointer_type (double_type_node
);
10452 long_double_ptr_type_node
= build_pointer_type (long_double_type_node
);
10453 integer_ptr_type_node
= build_pointer_type (integer_type_node
);
10455 /* Fixed size integer types. */
10456 uint16_type_node
= make_or_reuse_type (16, 1);
10457 uint32_type_node
= make_or_reuse_type (32, 1);
10458 uint64_type_node
= make_or_reuse_type (64, 1);
10459 if (targetm
.scalar_mode_supported_p (TImode
))
10460 uint128_type_node
= make_or_reuse_type (128, 1);
10462 /* Decimal float types. */
10463 if (targetm
.decimal_float_supported_p ())
10465 dfloat32_type_node
= make_node (REAL_TYPE
);
10466 TYPE_PRECISION (dfloat32_type_node
) = DECIMAL32_TYPE_SIZE
;
10467 SET_TYPE_MODE (dfloat32_type_node
, SDmode
);
10468 layout_type (dfloat32_type_node
);
10470 dfloat64_type_node
= make_node (REAL_TYPE
);
10471 TYPE_PRECISION (dfloat64_type_node
) = DECIMAL64_TYPE_SIZE
;
10472 SET_TYPE_MODE (dfloat64_type_node
, DDmode
);
10473 layout_type (dfloat64_type_node
);
10475 dfloat128_type_node
= make_node (REAL_TYPE
);
10476 TYPE_PRECISION (dfloat128_type_node
) = DECIMAL128_TYPE_SIZE
;
10477 SET_TYPE_MODE (dfloat128_type_node
, TDmode
);
10478 layout_type (dfloat128_type_node
);
10481 complex_integer_type_node
= build_complex_type (integer_type_node
, true);
10482 complex_float_type_node
= build_complex_type (float_type_node
, true);
10483 complex_double_type_node
= build_complex_type (double_type_node
, true);
10484 complex_long_double_type_node
= build_complex_type (long_double_type_node
,
10487 for (i
= 0; i
< NUM_FLOATN_NX_TYPES
; i
++)
10489 if (FLOATN_NX_TYPE_NODE (i
) != NULL_TREE
)
10490 COMPLEX_FLOATN_NX_TYPE_NODE (i
)
10491 = build_complex_type (FLOATN_NX_TYPE_NODE (i
));
10494 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
10495 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
10496 sat_ ## KIND ## _type_node = \
10497 make_sat_signed_ ## KIND ## _type (SIZE); \
10498 sat_unsigned_ ## KIND ## _type_node = \
10499 make_sat_unsigned_ ## KIND ## _type (SIZE); \
10500 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
10501 unsigned_ ## KIND ## _type_node = \
10502 make_unsigned_ ## KIND ## _type (SIZE);
10504 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
10505 sat_ ## WIDTH ## KIND ## _type_node = \
10506 make_sat_signed_ ## KIND ## _type (SIZE); \
10507 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
10508 make_sat_unsigned_ ## KIND ## _type (SIZE); \
10509 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
10510 unsigned_ ## WIDTH ## KIND ## _type_node = \
10511 make_unsigned_ ## KIND ## _type (SIZE);
10513 /* Make fixed-point type nodes based on four different widths. */
10514 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
10515 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
10516 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
10517 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
10518 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
10520 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
10521 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
10522 NAME ## _type_node = \
10523 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
10524 u ## NAME ## _type_node = \
10525 make_or_reuse_unsigned_ ## KIND ## _type \
10526 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
10527 sat_ ## NAME ## _type_node = \
10528 make_or_reuse_sat_signed_ ## KIND ## _type \
10529 (GET_MODE_BITSIZE (MODE ## mode)); \
10530 sat_u ## NAME ## _type_node = \
10531 make_or_reuse_sat_unsigned_ ## KIND ## _type \
10532 (GET_MODE_BITSIZE (U ## MODE ## mode));
10534 /* Fixed-point type and mode nodes. */
10535 MAKE_FIXED_TYPE_NODE_FAMILY (fract
, FRACT
)
10536 MAKE_FIXED_TYPE_NODE_FAMILY (accum
, ACCUM
)
10537 MAKE_FIXED_MODE_NODE (fract
, qq
, QQ
)
10538 MAKE_FIXED_MODE_NODE (fract
, hq
, HQ
)
10539 MAKE_FIXED_MODE_NODE (fract
, sq
, SQ
)
10540 MAKE_FIXED_MODE_NODE (fract
, dq
, DQ
)
10541 MAKE_FIXED_MODE_NODE (fract
, tq
, TQ
)
10542 MAKE_FIXED_MODE_NODE (accum
, ha
, HA
)
10543 MAKE_FIXED_MODE_NODE (accum
, sa
, SA
)
10544 MAKE_FIXED_MODE_NODE (accum
, da
, DA
)
10545 MAKE_FIXED_MODE_NODE (accum
, ta
, TA
)
10548 tree t
= targetm
.build_builtin_va_list ();
10550 /* Many back-ends define record types without setting TYPE_NAME.
10551 If we copied the record type here, we'd keep the original
10552 record type without a name. This breaks name mangling. So,
10553 don't copy record types and let c_common_nodes_and_builtins()
10554 declare the type to be __builtin_va_list. */
10555 if (TREE_CODE (t
) != RECORD_TYPE
)
10556 t
= build_variant_type_copy (t
);
10558 va_list_type_node
= t
;
10561 /* SCEV analyzer global shared trees. */
10562 chrec_dont_know
= make_node (SCEV_NOT_KNOWN
);
10563 TREE_TYPE (chrec_dont_know
) = void_type_node
;
10564 chrec_known
= make_node (SCEV_KNOWN
);
10565 TREE_TYPE (chrec_known
) = void_type_node
;
10568 /* Modify DECL for given flags.
10569 TM_PURE attribute is set only on types, so the function will modify
10570 DECL's type when ECF_TM_PURE is used. */
10573 set_call_expr_flags (tree decl
, int flags
)
10575 if (flags
& ECF_NOTHROW
)
10576 TREE_NOTHROW (decl
) = 1;
10577 if (flags
& ECF_CONST
)
10578 TREE_READONLY (decl
) = 1;
10579 if (flags
& ECF_PURE
)
10580 DECL_PURE_P (decl
) = 1;
10581 if (flags
& ECF_LOOPING_CONST_OR_PURE
)
10582 DECL_LOOPING_CONST_OR_PURE_P (decl
) = 1;
10583 if (flags
& ECF_NOVOPS
)
10584 DECL_IS_NOVOPS (decl
) = 1;
10585 if (flags
& ECF_NORETURN
)
10586 TREE_THIS_VOLATILE (decl
) = 1;
10587 if (flags
& ECF_MALLOC
)
10588 DECL_IS_MALLOC (decl
) = 1;
10589 if (flags
& ECF_RETURNS_TWICE
)
10590 DECL_IS_RETURNS_TWICE (decl
) = 1;
10591 if (flags
& ECF_LEAF
)
10592 DECL_ATTRIBUTES (decl
) = tree_cons (get_identifier ("leaf"),
10593 NULL
, DECL_ATTRIBUTES (decl
));
10594 if (flags
& ECF_COLD
)
10595 DECL_ATTRIBUTES (decl
) = tree_cons (get_identifier ("cold"),
10596 NULL
, DECL_ATTRIBUTES (decl
));
10597 if (flags
& ECF_RET1
)
10598 DECL_ATTRIBUTES (decl
)
10599 = tree_cons (get_identifier ("fn spec"),
10600 build_tree_list (NULL_TREE
, build_string (2, "1 ")),
10601 DECL_ATTRIBUTES (decl
));
10602 if ((flags
& ECF_TM_PURE
) && flag_tm
)
10603 apply_tm_attr (decl
, get_identifier ("transaction_pure"));
10604 /* Looping const or pure is implied by noreturn.
10605 There is currently no way to declare looping const or looping pure alone. */
10606 gcc_assert (!(flags
& ECF_LOOPING_CONST_OR_PURE
)
10607 || ((flags
& ECF_NORETURN
) && (flags
& (ECF_CONST
| ECF_PURE
))));
10611 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
10614 local_define_builtin (const char *name
, tree type
, enum built_in_function code
,
10615 const char *library_name
, int ecf_flags
)
10619 decl
= add_builtin_function (name
, type
, code
, BUILT_IN_NORMAL
,
10620 library_name
, NULL_TREE
);
10621 set_call_expr_flags (decl
, ecf_flags
);
10623 set_builtin_decl (code
, decl
, true);
10626 /* Call this function after instantiating all builtins that the language
10627 front end cares about. This will build the rest of the builtins
10628 and internal functions that are relied upon by the tree optimizers and
10632 build_common_builtin_nodes (void)
10637 if (!builtin_decl_explicit_p (BUILT_IN_UNREACHABLE
)
10638 || !builtin_decl_explicit_p (BUILT_IN_ABORT
))
10640 ftype
= build_function_type (void_type_node
, void_list_node
);
10641 if (!builtin_decl_explicit_p (BUILT_IN_UNREACHABLE
))
10642 local_define_builtin ("__builtin_unreachable", ftype
,
10643 BUILT_IN_UNREACHABLE
,
10644 "__builtin_unreachable",
10645 ECF_NOTHROW
| ECF_LEAF
| ECF_NORETURN
10646 | ECF_CONST
| ECF_COLD
);
10647 if (!builtin_decl_explicit_p (BUILT_IN_ABORT
))
10648 local_define_builtin ("__builtin_abort", ftype
, BUILT_IN_ABORT
,
10650 ECF_LEAF
| ECF_NORETURN
| ECF_CONST
| ECF_COLD
);
10653 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
)
10654 || !builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
10656 ftype
= build_function_type_list (ptr_type_node
,
10657 ptr_type_node
, const_ptr_type_node
,
10658 size_type_node
, NULL_TREE
);
10660 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
))
10661 local_define_builtin ("__builtin_memcpy", ftype
, BUILT_IN_MEMCPY
,
10662 "memcpy", ECF_NOTHROW
| ECF_LEAF
);
10663 if (!builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
10664 local_define_builtin ("__builtin_memmove", ftype
, BUILT_IN_MEMMOVE
,
10665 "memmove", ECF_NOTHROW
| ECF_LEAF
);
10668 if (!builtin_decl_explicit_p (BUILT_IN_MEMCMP
))
10670 ftype
= build_function_type_list (integer_type_node
, const_ptr_type_node
,
10671 const_ptr_type_node
, size_type_node
,
10673 local_define_builtin ("__builtin_memcmp", ftype
, BUILT_IN_MEMCMP
,
10674 "memcmp", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10677 if (!builtin_decl_explicit_p (BUILT_IN_MEMSET
))
10679 ftype
= build_function_type_list (ptr_type_node
,
10680 ptr_type_node
, integer_type_node
,
10681 size_type_node
, NULL_TREE
);
10682 local_define_builtin ("__builtin_memset", ftype
, BUILT_IN_MEMSET
,
10683 "memset", ECF_NOTHROW
| ECF_LEAF
);
10686 /* If we're checking the stack, `alloca' can throw. */
10687 const int alloca_flags
10688 = ECF_MALLOC
| ECF_LEAF
| (flag_stack_check
? 0 : ECF_NOTHROW
);
10690 if (!builtin_decl_explicit_p (BUILT_IN_ALLOCA
))
10692 ftype
= build_function_type_list (ptr_type_node
,
10693 size_type_node
, NULL_TREE
);
10694 local_define_builtin ("__builtin_alloca", ftype
, BUILT_IN_ALLOCA
,
10695 "alloca", alloca_flags
);
10698 ftype
= build_function_type_list (ptr_type_node
, size_type_node
,
10699 size_type_node
, NULL_TREE
);
10700 local_define_builtin ("__builtin_alloca_with_align", ftype
,
10701 BUILT_IN_ALLOCA_WITH_ALIGN
,
10702 "__builtin_alloca_with_align",
10705 ftype
= build_function_type_list (ptr_type_node
, size_type_node
,
10706 size_type_node
, size_type_node
, NULL_TREE
);
10707 local_define_builtin ("__builtin_alloca_with_align_and_max", ftype
,
10708 BUILT_IN_ALLOCA_WITH_ALIGN_AND_MAX
,
10709 "__builtin_alloca_with_align_and_max",
10712 ftype
= build_function_type_list (void_type_node
,
10713 ptr_type_node
, ptr_type_node
,
10714 ptr_type_node
, NULL_TREE
);
10715 local_define_builtin ("__builtin_init_trampoline", ftype
,
10716 BUILT_IN_INIT_TRAMPOLINE
,
10717 "__builtin_init_trampoline", ECF_NOTHROW
| ECF_LEAF
);
10718 local_define_builtin ("__builtin_init_heap_trampoline", ftype
,
10719 BUILT_IN_INIT_HEAP_TRAMPOLINE
,
10720 "__builtin_init_heap_trampoline",
10721 ECF_NOTHROW
| ECF_LEAF
);
10722 local_define_builtin ("__builtin_init_descriptor", ftype
,
10723 BUILT_IN_INIT_DESCRIPTOR
,
10724 "__builtin_init_descriptor", ECF_NOTHROW
| ECF_LEAF
);
10726 ftype
= build_function_type_list (ptr_type_node
, ptr_type_node
, NULL_TREE
);
10727 local_define_builtin ("__builtin_adjust_trampoline", ftype
,
10728 BUILT_IN_ADJUST_TRAMPOLINE
,
10729 "__builtin_adjust_trampoline",
10730 ECF_CONST
| ECF_NOTHROW
);
10731 local_define_builtin ("__builtin_adjust_descriptor", ftype
,
10732 BUILT_IN_ADJUST_DESCRIPTOR
,
10733 "__builtin_adjust_descriptor",
10734 ECF_CONST
| ECF_NOTHROW
);
10736 ftype
= build_function_type_list (void_type_node
,
10737 ptr_type_node
, ptr_type_node
, NULL_TREE
);
10738 if (!builtin_decl_explicit_p (BUILT_IN_CLEAR_CACHE
))
10739 local_define_builtin ("__builtin___clear_cache", ftype
,
10740 BUILT_IN_CLEAR_CACHE
,
10744 local_define_builtin ("__builtin_nonlocal_goto", ftype
,
10745 BUILT_IN_NONLOCAL_GOTO
,
10746 "__builtin_nonlocal_goto",
10747 ECF_NORETURN
| ECF_NOTHROW
);
10749 ftype
= build_function_type_list (void_type_node
,
10750 ptr_type_node
, ptr_type_node
, NULL_TREE
);
10751 local_define_builtin ("__builtin_setjmp_setup", ftype
,
10752 BUILT_IN_SETJMP_SETUP
,
10753 "__builtin_setjmp_setup", ECF_NOTHROW
);
10755 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10756 local_define_builtin ("__builtin_setjmp_receiver", ftype
,
10757 BUILT_IN_SETJMP_RECEIVER
,
10758 "__builtin_setjmp_receiver", ECF_NOTHROW
| ECF_LEAF
);
10760 ftype
= build_function_type_list (ptr_type_node
, NULL_TREE
);
10761 local_define_builtin ("__builtin_stack_save", ftype
, BUILT_IN_STACK_SAVE
,
10762 "__builtin_stack_save", ECF_NOTHROW
| ECF_LEAF
);
10764 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10765 local_define_builtin ("__builtin_stack_restore", ftype
,
10766 BUILT_IN_STACK_RESTORE
,
10767 "__builtin_stack_restore", ECF_NOTHROW
| ECF_LEAF
);
10769 ftype
= build_function_type_list (integer_type_node
, const_ptr_type_node
,
10770 const_ptr_type_node
, size_type_node
,
10772 local_define_builtin ("__builtin_memcmp_eq", ftype
, BUILT_IN_MEMCMP_EQ
,
10773 "__builtin_memcmp_eq",
10774 ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10776 local_define_builtin ("__builtin_strncmp_eq", ftype
, BUILT_IN_STRNCMP_EQ
,
10777 "__builtin_strncmp_eq",
10778 ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10780 local_define_builtin ("__builtin_strcmp_eq", ftype
, BUILT_IN_STRCMP_EQ
,
10781 "__builtin_strcmp_eq",
10782 ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10784 /* If there's a possibility that we might use the ARM EABI, build the
10785 alternate __cxa_end_cleanup node used to resume from C++. */
10786 if (targetm
.arm_eabi_unwinder
)
10788 ftype
= build_function_type_list (void_type_node
, NULL_TREE
);
10789 local_define_builtin ("__builtin_cxa_end_cleanup", ftype
,
10790 BUILT_IN_CXA_END_CLEANUP
,
10791 "__cxa_end_cleanup", ECF_NORETURN
| ECF_LEAF
);
10794 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10795 local_define_builtin ("__builtin_unwind_resume", ftype
,
10796 BUILT_IN_UNWIND_RESUME
,
10797 ((targetm_common
.except_unwind_info (&global_options
)
10799 ? "_Unwind_SjLj_Resume" : "_Unwind_Resume"),
10802 if (builtin_decl_explicit (BUILT_IN_RETURN_ADDRESS
) == NULL_TREE
)
10804 ftype
= build_function_type_list (ptr_type_node
, integer_type_node
,
10806 local_define_builtin ("__builtin_return_address", ftype
,
10807 BUILT_IN_RETURN_ADDRESS
,
10808 "__builtin_return_address",
10812 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
)
10813 || !builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
10815 ftype
= build_function_type_list (void_type_node
, ptr_type_node
,
10816 ptr_type_node
, NULL_TREE
);
10817 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
))
10818 local_define_builtin ("__cyg_profile_func_enter", ftype
,
10819 BUILT_IN_PROFILE_FUNC_ENTER
,
10820 "__cyg_profile_func_enter", 0);
10821 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
10822 local_define_builtin ("__cyg_profile_func_exit", ftype
,
10823 BUILT_IN_PROFILE_FUNC_EXIT
,
10824 "__cyg_profile_func_exit", 0);
10827 /* The exception object and filter values from the runtime. The argument
10828 must be zero before exception lowering, i.e. from the front end. After
10829 exception lowering, it will be the region number for the exception
10830 landing pad. These functions are PURE instead of CONST to prevent
10831 them from being hoisted past the exception edge that will initialize
10832 its value in the landing pad. */
10833 ftype
= build_function_type_list (ptr_type_node
,
10834 integer_type_node
, NULL_TREE
);
10835 ecf_flags
= ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
;
10836 /* Only use TM_PURE if we have TM language support. */
10837 if (builtin_decl_explicit_p (BUILT_IN_TM_LOAD_1
))
10838 ecf_flags
|= ECF_TM_PURE
;
10839 local_define_builtin ("__builtin_eh_pointer", ftype
, BUILT_IN_EH_POINTER
,
10840 "__builtin_eh_pointer", ecf_flags
);
10842 tmp
= lang_hooks
.types
.type_for_mode (targetm
.eh_return_filter_mode (), 0);
10843 ftype
= build_function_type_list (tmp
, integer_type_node
, NULL_TREE
);
10844 local_define_builtin ("__builtin_eh_filter", ftype
, BUILT_IN_EH_FILTER
,
10845 "__builtin_eh_filter", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10847 ftype
= build_function_type_list (void_type_node
,
10848 integer_type_node
, integer_type_node
,
10850 local_define_builtin ("__builtin_eh_copy_values", ftype
,
10851 BUILT_IN_EH_COPY_VALUES
,
10852 "__builtin_eh_copy_values", ECF_NOTHROW
);
10854 /* Complex multiplication and division. These are handled as builtins
10855 rather than optabs because emit_library_call_value doesn't support
10856 complex. Further, we can do slightly better with folding these
10857 beasties if the real and complex parts of the arguments are separate. */
10861 for (mode
= MIN_MODE_COMPLEX_FLOAT
; mode
<= MAX_MODE_COMPLEX_FLOAT
; ++mode
)
10863 char mode_name_buf
[4], *q
;
10865 enum built_in_function mcode
, dcode
;
10866 tree type
, inner_type
;
10867 const char *prefix
= "__";
10869 if (targetm
.libfunc_gnu_prefix
)
10872 type
= lang_hooks
.types
.type_for_mode ((machine_mode
) mode
, 0);
10875 inner_type
= TREE_TYPE (type
);
10877 ftype
= build_function_type_list (type
, inner_type
, inner_type
,
10878 inner_type
, inner_type
, NULL_TREE
);
10880 mcode
= ((enum built_in_function
)
10881 (BUILT_IN_COMPLEX_MUL_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
10882 dcode
= ((enum built_in_function
)
10883 (BUILT_IN_COMPLEX_DIV_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
10885 for (p
= GET_MODE_NAME (mode
), q
= mode_name_buf
; *p
; p
++, q
++)
10889 /* For -ftrapping-math these should throw from a former
10890 -fnon-call-exception stmt. */
10891 built_in_names
[mcode
] = concat (prefix
, "mul", mode_name_buf
, "3",
10893 local_define_builtin (built_in_names
[mcode
], ftype
, mcode
,
10894 built_in_names
[mcode
],
10895 ECF_CONST
| ECF_LEAF
);
10897 built_in_names
[dcode
] = concat (prefix
, "div", mode_name_buf
, "3",
10899 local_define_builtin (built_in_names
[dcode
], ftype
, dcode
,
10900 built_in_names
[dcode
],
10901 ECF_CONST
| ECF_LEAF
);
10905 init_internal_fns ();
10908 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
10911 If we requested a pointer to a vector, build up the pointers that
10912 we stripped off while looking for the inner type. Similarly for
10913 return values from functions.
10915 The argument TYPE is the top of the chain, and BOTTOM is the
10916 new type which we will point to. */
10919 reconstruct_complex_type (tree type
, tree bottom
)
10923 if (TREE_CODE (type
) == POINTER_TYPE
)
10925 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10926 outer
= build_pointer_type_for_mode (inner
, TYPE_MODE (type
),
10927 TYPE_REF_CAN_ALIAS_ALL (type
));
10929 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
10931 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10932 outer
= build_reference_type_for_mode (inner
, TYPE_MODE (type
),
10933 TYPE_REF_CAN_ALIAS_ALL (type
));
10935 else if (TREE_CODE (type
) == ARRAY_TYPE
)
10937 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10938 outer
= build_array_type (inner
, TYPE_DOMAIN (type
));
10940 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10942 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10943 outer
= build_function_type (inner
, TYPE_ARG_TYPES (type
));
10945 else if (TREE_CODE (type
) == METHOD_TYPE
)
10947 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10948 /* The build_method_type_directly() routine prepends 'this' to argument list,
10949 so we must compensate by getting rid of it. */
10951 = build_method_type_directly
10952 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
))),
10954 TREE_CHAIN (TYPE_ARG_TYPES (type
)));
10956 else if (TREE_CODE (type
) == OFFSET_TYPE
)
10958 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10959 outer
= build_offset_type (TYPE_OFFSET_BASETYPE (type
), inner
);
10964 return build_type_attribute_qual_variant (outer
, TYPE_ATTRIBUTES (type
),
10965 TYPE_QUALS (type
));
10968 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
10971 build_vector_type_for_mode (tree innertype
, machine_mode mode
)
10974 unsigned int bitsize
;
10976 switch (GET_MODE_CLASS (mode
))
10978 case MODE_VECTOR_BOOL
:
10979 case MODE_VECTOR_INT
:
10980 case MODE_VECTOR_FLOAT
:
10981 case MODE_VECTOR_FRACT
:
10982 case MODE_VECTOR_UFRACT
:
10983 case MODE_VECTOR_ACCUM
:
10984 case MODE_VECTOR_UACCUM
:
10985 nunits
= GET_MODE_NUNITS (mode
);
10989 /* Check that there are no leftover bits. */
10990 bitsize
= GET_MODE_BITSIZE (as_a
<scalar_int_mode
> (mode
));
10991 gcc_assert (bitsize
% TREE_INT_CST_LOW (TYPE_SIZE (innertype
)) == 0);
10992 nunits
= bitsize
/ TREE_INT_CST_LOW (TYPE_SIZE (innertype
));
10996 gcc_unreachable ();
10999 return make_vector_type (innertype
, nunits
, mode
);
11002 /* Similarly, but takes the inner type and number of units, which must be
11006 build_vector_type (tree innertype
, poly_int64 nunits
)
11008 return make_vector_type (innertype
, nunits
, VOIDmode
);
11011 /* Build a truth vector with NUNITS units, giving it mode MASK_MODE. */
11014 build_truth_vector_type_for_mode (poly_uint64 nunits
, machine_mode mask_mode
)
11016 gcc_assert (mask_mode
!= BLKmode
);
11018 unsigned HOST_WIDE_INT esize
;
11019 if (VECTOR_MODE_P (mask_mode
))
11021 poly_uint64 vsize
= GET_MODE_BITSIZE (mask_mode
);
11022 esize
= vector_element_size (vsize
, nunits
);
11027 tree bool_type
= build_nonstandard_boolean_type (esize
);
11029 return make_vector_type (bool_type
, nunits
, mask_mode
);
11032 /* Build a vector type that holds one boolean result for each element of
11033 vector type VECTYPE. The public interface for this operation is
11037 build_truth_vector_type_for (tree vectype
)
11039 machine_mode vector_mode
= TYPE_MODE (vectype
);
11040 poly_uint64 nunits
= TYPE_VECTOR_SUBPARTS (vectype
);
11042 machine_mode mask_mode
;
11043 if (VECTOR_MODE_P (vector_mode
)
11044 && targetm
.vectorize
.get_mask_mode (vector_mode
).exists (&mask_mode
))
11045 return build_truth_vector_type_for_mode (nunits
, mask_mode
);
11047 poly_uint64 vsize
= tree_to_poly_uint64 (TYPE_SIZE (vectype
));
11048 unsigned HOST_WIDE_INT esize
= vector_element_size (vsize
, nunits
);
11049 tree bool_type
= build_nonstandard_boolean_type (esize
);
11051 return make_vector_type (bool_type
, nunits
, VOIDmode
);
11054 /* Like build_vector_type, but builds a variant type with TYPE_VECTOR_OPAQUE
11058 build_opaque_vector_type (tree innertype
, poly_int64 nunits
)
11060 tree t
= make_vector_type (innertype
, nunits
, VOIDmode
);
11062 /* We always build the non-opaque variant before the opaque one,
11063 so if it already exists, it is TYPE_NEXT_VARIANT of this one. */
11064 cand
= TYPE_NEXT_VARIANT (t
);
11066 && TYPE_VECTOR_OPAQUE (cand
)
11067 && check_qualified_type (cand
, t
, TYPE_QUALS (t
)))
11069 /* Othewise build a variant type and make sure to queue it after
11070 the non-opaque type. */
11071 cand
= build_distinct_type_copy (t
);
11072 TYPE_VECTOR_OPAQUE (cand
) = true;
11073 TYPE_CANONICAL (cand
) = TYPE_CANONICAL (t
);
11074 TYPE_NEXT_VARIANT (cand
) = TYPE_NEXT_VARIANT (t
);
11075 TYPE_NEXT_VARIANT (t
) = cand
;
11076 TYPE_MAIN_VARIANT (cand
) = TYPE_MAIN_VARIANT (t
);
11080 /* Return the value of element I of VECTOR_CST T as a wide_int. */
11083 vector_cst_int_elt (const_tree t
, unsigned int i
)
11085 /* First handle elements that are directly encoded. */
11086 unsigned int encoded_nelts
= vector_cst_encoded_nelts (t
);
11087 if (i
< encoded_nelts
)
11088 return wi::to_wide (VECTOR_CST_ENCODED_ELT (t
, i
));
11090 /* Identify the pattern that contains element I and work out the index of
11091 the last encoded element for that pattern. */
11092 unsigned int npatterns
= VECTOR_CST_NPATTERNS (t
);
11093 unsigned int pattern
= i
% npatterns
;
11094 unsigned int count
= i
/ npatterns
;
11095 unsigned int final_i
= encoded_nelts
- npatterns
+ pattern
;
11097 /* If there are no steps, the final encoded value is the right one. */
11098 if (!VECTOR_CST_STEPPED_P (t
))
11099 return wi::to_wide (VECTOR_CST_ENCODED_ELT (t
, final_i
));
11101 /* Otherwise work out the value from the last two encoded elements. */
11102 tree v1
= VECTOR_CST_ENCODED_ELT (t
, final_i
- npatterns
);
11103 tree v2
= VECTOR_CST_ENCODED_ELT (t
, final_i
);
11104 wide_int diff
= wi::to_wide (v2
) - wi::to_wide (v1
);
11105 return wi::to_wide (v2
) + (count
- 2) * diff
;
11108 /* Return the value of element I of VECTOR_CST T. */
11111 vector_cst_elt (const_tree t
, unsigned int i
)
11113 /* First handle elements that are directly encoded. */
11114 unsigned int encoded_nelts
= vector_cst_encoded_nelts (t
);
11115 if (i
< encoded_nelts
)
11116 return VECTOR_CST_ENCODED_ELT (t
, i
);
11118 /* If there are no steps, the final encoded value is the right one. */
11119 if (!VECTOR_CST_STEPPED_P (t
))
11121 /* Identify the pattern that contains element I and work out the index of
11122 the last encoded element for that pattern. */
11123 unsigned int npatterns
= VECTOR_CST_NPATTERNS (t
);
11124 unsigned int pattern
= i
% npatterns
;
11125 unsigned int final_i
= encoded_nelts
- npatterns
+ pattern
;
11126 return VECTOR_CST_ENCODED_ELT (t
, final_i
);
11129 /* Otherwise work out the value from the last two encoded elements. */
11130 return wide_int_to_tree (TREE_TYPE (TREE_TYPE (t
)),
11131 vector_cst_int_elt (t
, i
));
11134 /* Given an initializer INIT, return TRUE if INIT is zero or some
11135 aggregate of zeros. Otherwise return FALSE. If NONZERO is not
11136 null, set *NONZERO if and only if INIT is known not to be all
11137 zeros. The combination of return value of false and *NONZERO
11138 false implies that INIT may but need not be all zeros. Other
11139 combinations indicate definitive answers. */
11142 initializer_zerop (const_tree init
, bool *nonzero
/* = NULL */)
11148 /* Conservatively clear NONZERO and set it only if INIT is definitely
11154 unsigned HOST_WIDE_INT off
= 0;
11156 switch (TREE_CODE (init
))
11159 if (integer_zerop (init
))
11166 /* ??? Note that this is not correct for C4X float formats. There,
11167 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
11168 negative exponent. */
11169 if (real_zerop (init
)
11170 && !REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init
)))
11177 if (fixed_zerop (init
))
11184 if (integer_zerop (init
)
11185 || (real_zerop (init
)
11186 && !REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init
)))
11187 && !REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init
)))))
11194 if (VECTOR_CST_NPATTERNS (init
) == 1
11195 && VECTOR_CST_DUPLICATE_P (init
)
11196 && initializer_zerop (VECTOR_CST_ENCODED_ELT (init
, 0)))
11204 if (TREE_CLOBBER_P (init
))
11207 unsigned HOST_WIDE_INT idx
;
11210 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init
), idx
, elt
)
11211 if (!initializer_zerop (elt
, nonzero
))
11219 tree arg
= TREE_OPERAND (init
, 0);
11220 if (TREE_CODE (arg
) != ADDR_EXPR
)
11222 tree offset
= TREE_OPERAND (init
, 1);
11223 if (TREE_CODE (offset
) != INTEGER_CST
11224 || !tree_fits_uhwi_p (offset
))
11226 off
= tree_to_uhwi (offset
);
11229 arg
= TREE_OPERAND (arg
, 0);
11230 if (TREE_CODE (arg
) != STRING_CST
)
11234 /* Fall through. */
11238 gcc_assert (off
<= INT_MAX
);
11241 int n
= TREE_STRING_LENGTH (init
);
11245 /* We need to loop through all elements to handle cases like
11246 "\0" and "\0foobar". */
11247 for (i
= 0; i
< n
; ++i
)
11248 if (TREE_STRING_POINTER (init
)[i
] != '\0')
11262 /* Return true if EXPR is an initializer expression in which every element
11263 is a constant that is numerically equal to 0 or 1. The elements do not
11264 need to be equal to each other. */
11267 initializer_each_zero_or_onep (const_tree expr
)
11269 STRIP_ANY_LOCATION_WRAPPER (expr
);
11271 switch (TREE_CODE (expr
))
11274 return integer_zerop (expr
) || integer_onep (expr
);
11277 return real_zerop (expr
) || real_onep (expr
);
11281 unsigned HOST_WIDE_INT nelts
= vector_cst_encoded_nelts (expr
);
11282 if (VECTOR_CST_STEPPED_P (expr
)
11283 && !TYPE_VECTOR_SUBPARTS (TREE_TYPE (expr
)).is_constant (&nelts
))
11286 for (unsigned int i
= 0; i
< nelts
; ++i
)
11288 tree elt
= vector_cst_elt (expr
, i
);
11289 if (!initializer_each_zero_or_onep (elt
))
11301 /* Check if vector VEC consists of all the equal elements and
11302 that the number of elements corresponds to the type of VEC.
11303 The function returns first element of the vector
11304 or NULL_TREE if the vector is not uniform. */
11306 uniform_vector_p (const_tree vec
)
11309 unsigned HOST_WIDE_INT i
, nelts
;
11311 if (vec
== NULL_TREE
)
11314 gcc_assert (VECTOR_TYPE_P (TREE_TYPE (vec
)));
11316 if (TREE_CODE (vec
) == VEC_DUPLICATE_EXPR
)
11317 return TREE_OPERAND (vec
, 0);
11319 else if (TREE_CODE (vec
) == VECTOR_CST
)
11321 if (VECTOR_CST_NPATTERNS (vec
) == 1 && VECTOR_CST_DUPLICATE_P (vec
))
11322 return VECTOR_CST_ENCODED_ELT (vec
, 0);
11326 else if (TREE_CODE (vec
) == CONSTRUCTOR
11327 && TYPE_VECTOR_SUBPARTS (TREE_TYPE (vec
)).is_constant (&nelts
))
11329 first
= error_mark_node
;
11331 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (vec
), i
, t
)
11338 if (!operand_equal_p (first
, t
, 0))
11350 /* If the argument is INTEGER_CST, return it. If the argument is vector
11351 with all elements the same INTEGER_CST, return that INTEGER_CST. Otherwise
11353 Look through location wrappers. */
11356 uniform_integer_cst_p (tree t
)
11358 STRIP_ANY_LOCATION_WRAPPER (t
);
11360 if (TREE_CODE (t
) == INTEGER_CST
)
11363 if (VECTOR_TYPE_P (TREE_TYPE (t
)))
11365 t
= uniform_vector_p (t
);
11366 if (t
&& TREE_CODE (t
) == INTEGER_CST
)
11373 /* If VECTOR_CST T has a single nonzero element, return the index of that
11374 element, otherwise return -1. */
11377 single_nonzero_element (const_tree t
)
11379 unsigned HOST_WIDE_INT nelts
;
11380 unsigned int repeat_nelts
;
11381 if (VECTOR_CST_NELTS (t
).is_constant (&nelts
))
11382 repeat_nelts
= nelts
;
11383 else if (VECTOR_CST_NELTS_PER_PATTERN (t
) == 2)
11385 nelts
= vector_cst_encoded_nelts (t
);
11386 repeat_nelts
= VECTOR_CST_NPATTERNS (t
);
11392 for (unsigned int i
= 0; i
< nelts
; ++i
)
11394 tree elt
= vector_cst_elt (t
, i
);
11395 if (!integer_zerop (elt
) && !real_zerop (elt
))
11397 if (res
>= 0 || i
>= repeat_nelts
)
11405 /* Build an empty statement at location LOC. */
11408 build_empty_stmt (location_t loc
)
11410 tree t
= build1 (NOP_EXPR
, void_type_node
, size_zero_node
);
11411 SET_EXPR_LOCATION (t
, loc
);
11416 /* Build an OpenMP clause with code CODE. LOC is the location of the
11420 build_omp_clause (location_t loc
, enum omp_clause_code code
)
11425 length
= omp_clause_num_ops
[code
];
11426 size
= (sizeof (struct tree_omp_clause
) + (length
- 1) * sizeof (tree
));
11428 record_node_allocation_statistics (OMP_CLAUSE
, size
);
11430 t
= (tree
) ggc_internal_alloc (size
);
11431 memset (t
, 0, size
);
11432 TREE_SET_CODE (t
, OMP_CLAUSE
);
11433 OMP_CLAUSE_SET_CODE (t
, code
);
11434 OMP_CLAUSE_LOCATION (t
) = loc
;
11439 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
11440 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
11441 Except for the CODE and operand count field, other storage for the
11442 object is initialized to zeros. */
11445 build_vl_exp (enum tree_code code
, int len MEM_STAT_DECL
)
11448 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_exp
);
11450 gcc_assert (TREE_CODE_CLASS (code
) == tcc_vl_exp
);
11451 gcc_assert (len
>= 1);
11453 record_node_allocation_statistics (code
, length
);
11455 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
11457 TREE_SET_CODE (t
, code
);
11459 /* Can't use TREE_OPERAND to store the length because if checking is
11460 enabled, it will try to check the length before we store it. :-P */
11461 t
->exp
.operands
[0] = build_int_cst (sizetype
, len
);
11466 /* Helper function for build_call_* functions; build a CALL_EXPR with
11467 indicated RETURN_TYPE, FN, and NARGS, but do not initialize any of
11468 the argument slots. */
11471 build_call_1 (tree return_type
, tree fn
, int nargs
)
11475 t
= build_vl_exp (CALL_EXPR
, nargs
+ 3);
11476 TREE_TYPE (t
) = return_type
;
11477 CALL_EXPR_FN (t
) = fn
;
11478 CALL_EXPR_STATIC_CHAIN (t
) = NULL
;
11483 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
11484 FN and a null static chain slot. NARGS is the number of call arguments
11485 which are specified as "..." arguments. */
11488 build_call_nary (tree return_type
, tree fn
, int nargs
, ...)
11492 va_start (args
, nargs
);
11493 ret
= build_call_valist (return_type
, fn
, nargs
, args
);
11498 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
11499 FN and a null static chain slot. NARGS is the number of call arguments
11500 which are specified as a va_list ARGS. */
11503 build_call_valist (tree return_type
, tree fn
, int nargs
, va_list args
)
11508 t
= build_call_1 (return_type
, fn
, nargs
);
11509 for (i
= 0; i
< nargs
; i
++)
11510 CALL_EXPR_ARG (t
, i
) = va_arg (args
, tree
);
11511 process_call_operands (t
);
11515 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
11516 FN and a null static chain slot. NARGS is the number of call arguments
11517 which are specified as a tree array ARGS. */
11520 build_call_array_loc (location_t loc
, tree return_type
, tree fn
,
11521 int nargs
, const tree
*args
)
11526 t
= build_call_1 (return_type
, fn
, nargs
);
11527 for (i
= 0; i
< nargs
; i
++)
11528 CALL_EXPR_ARG (t
, i
) = args
[i
];
11529 process_call_operands (t
);
11530 SET_EXPR_LOCATION (t
, loc
);
11534 /* Like build_call_array, but takes a vec. */
11537 build_call_vec (tree return_type
, tree fn
, vec
<tree
, va_gc
> *args
)
11542 ret
= build_call_1 (return_type
, fn
, vec_safe_length (args
));
11543 FOR_EACH_VEC_SAFE_ELT (args
, ix
, t
)
11544 CALL_EXPR_ARG (ret
, ix
) = t
;
11545 process_call_operands (ret
);
11549 /* Conveniently construct a function call expression. FNDECL names the
11550 function to be called and N arguments are passed in the array
11554 build_call_expr_loc_array (location_t loc
, tree fndecl
, int n
, tree
*argarray
)
11556 tree fntype
= TREE_TYPE (fndecl
);
11557 tree fn
= build1 (ADDR_EXPR
, build_pointer_type (fntype
), fndecl
);
11559 return fold_build_call_array_loc (loc
, TREE_TYPE (fntype
), fn
, n
, argarray
);
11562 /* Conveniently construct a function call expression. FNDECL names the
11563 function to be called and the arguments are passed in the vector
11567 build_call_expr_loc_vec (location_t loc
, tree fndecl
, vec
<tree
, va_gc
> *vec
)
11569 return build_call_expr_loc_array (loc
, fndecl
, vec_safe_length (vec
),
11570 vec_safe_address (vec
));
11574 /* Conveniently construct a function call expression. FNDECL names the
11575 function to be called, N is the number of arguments, and the "..."
11576 parameters are the argument expressions. */
11579 build_call_expr_loc (location_t loc
, tree fndecl
, int n
, ...)
11582 tree
*argarray
= XALLOCAVEC (tree
, n
);
11586 for (i
= 0; i
< n
; i
++)
11587 argarray
[i
] = va_arg (ap
, tree
);
11589 return build_call_expr_loc_array (loc
, fndecl
, n
, argarray
);
11592 /* Like build_call_expr_loc (UNKNOWN_LOCATION, ...). Duplicated because
11593 varargs macros aren't supported by all bootstrap compilers. */
11596 build_call_expr (tree fndecl
, int n
, ...)
11599 tree
*argarray
= XALLOCAVEC (tree
, n
);
11603 for (i
= 0; i
< n
; i
++)
11604 argarray
[i
] = va_arg (ap
, tree
);
11606 return build_call_expr_loc_array (UNKNOWN_LOCATION
, fndecl
, n
, argarray
);
11609 /* Build an internal call to IFN, with arguments ARGS[0:N-1] and with return
11610 type TYPE. This is just like CALL_EXPR, except its CALL_EXPR_FN is NULL.
11611 It will get gimplified later into an ordinary internal function. */
11614 build_call_expr_internal_loc_array (location_t loc
, internal_fn ifn
,
11615 tree type
, int n
, const tree
*args
)
11617 tree t
= build_call_1 (type
, NULL_TREE
, n
);
11618 for (int i
= 0; i
< n
; ++i
)
11619 CALL_EXPR_ARG (t
, i
) = args
[i
];
11620 SET_EXPR_LOCATION (t
, loc
);
11621 CALL_EXPR_IFN (t
) = ifn
;
11622 process_call_operands (t
);
11626 /* Build internal call expression. This is just like CALL_EXPR, except
11627 its CALL_EXPR_FN is NULL. It will get gimplified later into ordinary
11628 internal function. */
11631 build_call_expr_internal_loc (location_t loc
, enum internal_fn ifn
,
11632 tree type
, int n
, ...)
11635 tree
*argarray
= XALLOCAVEC (tree
, n
);
11639 for (i
= 0; i
< n
; i
++)
11640 argarray
[i
] = va_arg (ap
, tree
);
11642 return build_call_expr_internal_loc_array (loc
, ifn
, type
, n
, argarray
);
11645 /* Return a function call to FN, if the target is guaranteed to support it,
11648 N is the number of arguments, passed in the "...", and TYPE is the
11649 type of the return value. */
11652 maybe_build_call_expr_loc (location_t loc
, combined_fn fn
, tree type
,
11656 tree
*argarray
= XALLOCAVEC (tree
, n
);
11660 for (i
= 0; i
< n
; i
++)
11661 argarray
[i
] = va_arg (ap
, tree
);
11663 if (internal_fn_p (fn
))
11665 internal_fn ifn
= as_internal_fn (fn
);
11666 if (direct_internal_fn_p (ifn
))
11668 tree_pair types
= direct_internal_fn_types (ifn
, type
, argarray
);
11669 if (!direct_internal_fn_supported_p (ifn
, types
,
11670 OPTIMIZE_FOR_BOTH
))
11673 return build_call_expr_internal_loc_array (loc
, ifn
, type
, n
, argarray
);
11677 tree fndecl
= builtin_decl_implicit (as_builtin_fn (fn
));
11680 return build_call_expr_loc_array (loc
, fndecl
, n
, argarray
);
11684 /* Return a function call to the appropriate builtin alloca variant.
11686 SIZE is the size to be allocated. ALIGN, if non-zero, is the requested
11687 alignment of the allocated area. MAX_SIZE, if non-negative, is an upper
11688 bound for SIZE in case it is not a fixed value. */
11691 build_alloca_call_expr (tree size
, unsigned int align
, HOST_WIDE_INT max_size
)
11695 tree t
= builtin_decl_explicit (BUILT_IN_ALLOCA_WITH_ALIGN_AND_MAX
);
11697 build_call_expr (t
, 3, size
, size_int (align
), size_int (max_size
));
11699 else if (align
> 0)
11701 tree t
= builtin_decl_explicit (BUILT_IN_ALLOCA_WITH_ALIGN
);
11702 return build_call_expr (t
, 2, size
, size_int (align
));
11706 tree t
= builtin_decl_explicit (BUILT_IN_ALLOCA
);
11707 return build_call_expr (t
, 1, size
);
11711 /* Create a new constant string literal of type ELTYPE[SIZE] (or LEN
11712 if SIZE == -1) and return a tree node representing char* pointer to
11713 it as an ADDR_EXPR (ARRAY_REF (ELTYPE, ...)). When STR is nonnull
11714 the STRING_CST value is the LEN bytes at STR (the representation
11715 of the string, which may be wide). Otherwise it's all zeros. */
11718 build_string_literal (unsigned len
, const char *str
/* = NULL */,
11719 tree eltype
/* = char_type_node */,
11720 unsigned HOST_WIDE_INT size
/* = -1 */)
11722 tree t
= build_string (len
, str
);
11723 /* Set the maximum valid index based on the string length or SIZE. */
11724 unsigned HOST_WIDE_INT maxidx
11725 = (size
== HOST_WIDE_INT_M1U
? len
: size
) - 1;
11727 tree index
= build_index_type (size_int (maxidx
));
11728 eltype
= build_type_variant (eltype
, 1, 0);
11729 tree type
= build_array_type (eltype
, index
);
11730 TREE_TYPE (t
) = type
;
11731 TREE_CONSTANT (t
) = 1;
11732 TREE_READONLY (t
) = 1;
11733 TREE_STATIC (t
) = 1;
11735 type
= build_pointer_type (eltype
);
11736 t
= build1 (ADDR_EXPR
, type
,
11737 build4 (ARRAY_REF
, eltype
,
11738 t
, integer_zero_node
, NULL_TREE
, NULL_TREE
));
11744 /* Return true if T (assumed to be a DECL) must be assigned a memory
11748 needs_to_live_in_memory (const_tree t
)
11750 return (TREE_ADDRESSABLE (t
)
11751 || is_global_var (t
)
11752 || (TREE_CODE (t
) == RESULT_DECL
11753 && !DECL_BY_REFERENCE (t
)
11754 && aggregate_value_p (t
, current_function_decl
)));
11757 /* Return value of a constant X and sign-extend it. */
11760 int_cst_value (const_tree x
)
11762 unsigned bits
= TYPE_PRECISION (TREE_TYPE (x
));
11763 unsigned HOST_WIDE_INT val
= TREE_INT_CST_LOW (x
);
11765 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
11766 gcc_assert (cst_and_fits_in_hwi (x
));
11768 if (bits
< HOST_BITS_PER_WIDE_INT
)
11770 bool negative
= ((val
>> (bits
- 1)) & 1) != 0;
11772 val
|= HOST_WIDE_INT_M1U
<< (bits
- 1) << 1;
11774 val
&= ~(HOST_WIDE_INT_M1U
<< (bits
- 1) << 1);
11780 /* If TYPE is an integral or pointer type, return an integer type with
11781 the same precision which is unsigned iff UNSIGNEDP is true, or itself
11782 if TYPE is already an integer type of signedness UNSIGNEDP.
11783 If TYPE is a floating-point type, return an integer type with the same
11784 bitsize and with the signedness given by UNSIGNEDP; this is useful
11785 when doing bit-level operations on a floating-point value. */
11788 signed_or_unsigned_type_for (int unsignedp
, tree type
)
11790 if (ANY_INTEGRAL_TYPE_P (type
) && TYPE_UNSIGNED (type
) == unsignedp
)
11793 if (TREE_CODE (type
) == VECTOR_TYPE
)
11795 tree inner
= TREE_TYPE (type
);
11796 tree inner2
= signed_or_unsigned_type_for (unsignedp
, inner
);
11799 if (inner
== inner2
)
11801 return build_vector_type (inner2
, TYPE_VECTOR_SUBPARTS (type
));
11804 if (TREE_CODE (type
) == COMPLEX_TYPE
)
11806 tree inner
= TREE_TYPE (type
);
11807 tree inner2
= signed_or_unsigned_type_for (unsignedp
, inner
);
11810 if (inner
== inner2
)
11812 return build_complex_type (inner2
);
11816 if (INTEGRAL_TYPE_P (type
)
11817 || POINTER_TYPE_P (type
)
11818 || TREE_CODE (type
) == OFFSET_TYPE
)
11819 bits
= TYPE_PRECISION (type
);
11820 else if (TREE_CODE (type
) == REAL_TYPE
)
11821 bits
= GET_MODE_BITSIZE (SCALAR_TYPE_MODE (type
));
11825 return build_nonstandard_integer_type (bits
, unsignedp
);
11828 /* If TYPE is an integral or pointer type, return an integer type with
11829 the same precision which is unsigned, or itself if TYPE is already an
11830 unsigned integer type. If TYPE is a floating-point type, return an
11831 unsigned integer type with the same bitsize as TYPE. */
11834 unsigned_type_for (tree type
)
11836 return signed_or_unsigned_type_for (1, type
);
11839 /* If TYPE is an integral or pointer type, return an integer type with
11840 the same precision which is signed, or itself if TYPE is already a
11841 signed integer type. If TYPE is a floating-point type, return a
11842 signed integer type with the same bitsize as TYPE. */
11845 signed_type_for (tree type
)
11847 return signed_or_unsigned_type_for (0, type
);
11850 /* If TYPE is a vector type, return a signed integer vector type with the
11851 same width and number of subparts. Otherwise return boolean_type_node. */
11854 truth_type_for (tree type
)
11856 if (TREE_CODE (type
) == VECTOR_TYPE
)
11858 if (VECTOR_BOOLEAN_TYPE_P (type
))
11860 return build_truth_vector_type_for (type
);
11863 return boolean_type_node
;
11866 /* Returns the largest value obtainable by casting something in INNER type to
11870 upper_bound_in_type (tree outer
, tree inner
)
11872 unsigned int det
= 0;
11873 unsigned oprec
= TYPE_PRECISION (outer
);
11874 unsigned iprec
= TYPE_PRECISION (inner
);
11877 /* Compute a unique number for every combination. */
11878 det
|= (oprec
> iprec
) ? 4 : 0;
11879 det
|= TYPE_UNSIGNED (outer
) ? 2 : 0;
11880 det
|= TYPE_UNSIGNED (inner
) ? 1 : 0;
11882 /* Determine the exponent to use. */
11887 /* oprec <= iprec, outer: signed, inner: don't care. */
11892 /* oprec <= iprec, outer: unsigned, inner: don't care. */
11896 /* oprec > iprec, outer: signed, inner: signed. */
11900 /* oprec > iprec, outer: signed, inner: unsigned. */
11904 /* oprec > iprec, outer: unsigned, inner: signed. */
11908 /* oprec > iprec, outer: unsigned, inner: unsigned. */
11912 gcc_unreachable ();
11915 return wide_int_to_tree (outer
,
11916 wi::mask (prec
, false, TYPE_PRECISION (outer
)));
11919 /* Returns the smallest value obtainable by casting something in INNER type to
11923 lower_bound_in_type (tree outer
, tree inner
)
11925 unsigned oprec
= TYPE_PRECISION (outer
);
11926 unsigned iprec
= TYPE_PRECISION (inner
);
11928 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
11930 if (TYPE_UNSIGNED (outer
)
11931 /* If we are widening something of an unsigned type, OUTER type
11932 contains all values of INNER type. In particular, both INNER
11933 and OUTER types have zero in common. */
11934 || (oprec
> iprec
&& TYPE_UNSIGNED (inner
)))
11935 return build_int_cst (outer
, 0);
11938 /* If we are widening a signed type to another signed type, we
11939 want to obtain -2^^(iprec-1). If we are keeping the
11940 precision or narrowing to a signed type, we want to obtain
11942 unsigned prec
= oprec
> iprec
? iprec
: oprec
;
11943 return wide_int_to_tree (outer
,
11944 wi::mask (prec
- 1, true,
11945 TYPE_PRECISION (outer
)));
11949 /* Return nonzero if two operands that are suitable for PHI nodes are
11950 necessarily equal. Specifically, both ARG0 and ARG1 must be either
11951 SSA_NAME or invariant. Note that this is strictly an optimization.
11952 That is, callers of this function can directly call operand_equal_p
11953 and get the same result, only slower. */
11956 operand_equal_for_phi_arg_p (const_tree arg0
, const_tree arg1
)
11960 if (TREE_CODE (arg0
) == SSA_NAME
|| TREE_CODE (arg1
) == SSA_NAME
)
11962 return operand_equal_p (arg0
, arg1
, 0);
11965 /* Returns number of zeros at the end of binary representation of X. */
11968 num_ending_zeros (const_tree x
)
11970 return build_int_cst (TREE_TYPE (x
), wi::ctz (wi::to_wide (x
)));
11974 #define WALK_SUBTREE(NODE) \
11977 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
11983 /* This is a subroutine of walk_tree that walks field of TYPE that are to
11984 be walked whenever a type is seen in the tree. Rest of operands and return
11985 value are as for walk_tree. */
11988 walk_type_fields (tree type
, walk_tree_fn func
, void *data
,
11989 hash_set
<tree
> *pset
, walk_tree_lh lh
)
11991 tree result
= NULL_TREE
;
11993 switch (TREE_CODE (type
))
11996 case REFERENCE_TYPE
:
11998 /* We have to worry about mutually recursive pointers. These can't
11999 be written in C. They can in Ada. It's pathological, but
12000 there's an ACATS test (c38102a) that checks it. Deal with this
12001 by checking if we're pointing to another pointer, that one
12002 points to another pointer, that one does too, and we have no htab.
12003 If so, get a hash table. We check three levels deep to avoid
12004 the cost of the hash table if we don't need one. */
12005 if (POINTER_TYPE_P (TREE_TYPE (type
))
12006 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type
)))
12007 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type
))))
12010 result
= walk_tree_without_duplicates (&TREE_TYPE (type
),
12021 WALK_SUBTREE (TREE_TYPE (type
));
12025 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type
));
12027 /* Fall through. */
12029 case FUNCTION_TYPE
:
12030 WALK_SUBTREE (TREE_TYPE (type
));
12034 /* We never want to walk into default arguments. */
12035 for (arg
= TYPE_ARG_TYPES (type
); arg
; arg
= TREE_CHAIN (arg
))
12036 WALK_SUBTREE (TREE_VALUE (arg
));
12041 /* Don't follow this nodes's type if a pointer for fear that
12042 we'll have infinite recursion. If we have a PSET, then we
12045 || (!POINTER_TYPE_P (TREE_TYPE (type
))
12046 && TREE_CODE (TREE_TYPE (type
)) != OFFSET_TYPE
))
12047 WALK_SUBTREE (TREE_TYPE (type
));
12048 WALK_SUBTREE (TYPE_DOMAIN (type
));
12052 WALK_SUBTREE (TREE_TYPE (type
));
12053 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type
));
12063 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
12064 called with the DATA and the address of each sub-tree. If FUNC returns a
12065 non-NULL value, the traversal is stopped, and the value returned by FUNC
12066 is returned. If PSET is non-NULL it is used to record the nodes visited,
12067 and to avoid visiting a node more than once. */
12070 walk_tree_1 (tree
*tp
, walk_tree_fn func
, void *data
,
12071 hash_set
<tree
> *pset
, walk_tree_lh lh
)
12073 enum tree_code code
;
12077 #define WALK_SUBTREE_TAIL(NODE) \
12081 goto tail_recurse; \
12086 /* Skip empty subtrees. */
12090 /* Don't walk the same tree twice, if the user has requested
12091 that we avoid doing so. */
12092 if (pset
&& pset
->add (*tp
))
12095 /* Call the function. */
12097 result
= (*func
) (tp
, &walk_subtrees
, data
);
12099 /* If we found something, return it. */
12103 code
= TREE_CODE (*tp
);
12105 /* Even if we didn't, FUNC may have decided that there was nothing
12106 interesting below this point in the tree. */
12107 if (!walk_subtrees
)
12109 /* But we still need to check our siblings. */
12110 if (code
== TREE_LIST
)
12111 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
12112 else if (code
== OMP_CLAUSE
)
12113 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
12120 result
= (*lh
) (tp
, &walk_subtrees
, func
, data
, pset
);
12121 if (result
|| !walk_subtrees
)
12128 case IDENTIFIER_NODE
:
12135 case PLACEHOLDER_EXPR
:
12139 /* None of these have subtrees other than those already walked
12144 WALK_SUBTREE (TREE_VALUE (*tp
));
12145 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
12150 int len
= TREE_VEC_LENGTH (*tp
);
12155 /* Walk all elements but the first. */
12157 WALK_SUBTREE (TREE_VEC_ELT (*tp
, len
));
12159 /* Now walk the first one as a tail call. */
12160 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp
, 0));
12164 WALK_SUBTREE (TREE_REALPART (*tp
));
12165 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp
));
12169 unsigned HOST_WIDE_INT idx
;
12170 constructor_elt
*ce
;
12172 for (idx
= 0; vec_safe_iterate (CONSTRUCTOR_ELTS (*tp
), idx
, &ce
);
12174 WALK_SUBTREE (ce
->value
);
12179 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, 0));
12184 for (decl
= BIND_EXPR_VARS (*tp
); decl
; decl
= DECL_CHAIN (decl
))
12186 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
12187 into declarations that are just mentioned, rather than
12188 declared; they don't really belong to this part of the tree.
12189 And, we can see cycles: the initializer for a declaration
12190 can refer to the declaration itself. */
12191 WALK_SUBTREE (DECL_INITIAL (decl
));
12192 WALK_SUBTREE (DECL_SIZE (decl
));
12193 WALK_SUBTREE (DECL_SIZE_UNIT (decl
));
12195 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp
));
12198 case STATEMENT_LIST
:
12200 tree_stmt_iterator i
;
12201 for (i
= tsi_start (*tp
); !tsi_end_p (i
); tsi_next (&i
))
12202 WALK_SUBTREE (*tsi_stmt_ptr (i
));
12207 switch (OMP_CLAUSE_CODE (*tp
))
12209 case OMP_CLAUSE_GANG
:
12210 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 1));
12213 case OMP_CLAUSE_ASYNC
:
12214 case OMP_CLAUSE_WAIT
:
12215 case OMP_CLAUSE_WORKER
:
12216 case OMP_CLAUSE_VECTOR
:
12217 case OMP_CLAUSE_NUM_GANGS
:
12218 case OMP_CLAUSE_NUM_WORKERS
:
12219 case OMP_CLAUSE_VECTOR_LENGTH
:
12220 case OMP_CLAUSE_PRIVATE
:
12221 case OMP_CLAUSE_SHARED
:
12222 case OMP_CLAUSE_FIRSTPRIVATE
:
12223 case OMP_CLAUSE_COPYIN
:
12224 case OMP_CLAUSE_COPYPRIVATE
:
12225 case OMP_CLAUSE_FINAL
:
12226 case OMP_CLAUSE_IF
:
12227 case OMP_CLAUSE_NUM_THREADS
:
12228 case OMP_CLAUSE_SCHEDULE
:
12229 case OMP_CLAUSE_UNIFORM
:
12230 case OMP_CLAUSE_DEPEND
:
12231 case OMP_CLAUSE_NONTEMPORAL
:
12232 case OMP_CLAUSE_NUM_TEAMS
:
12233 case OMP_CLAUSE_THREAD_LIMIT
:
12234 case OMP_CLAUSE_DEVICE
:
12235 case OMP_CLAUSE_DIST_SCHEDULE
:
12236 case OMP_CLAUSE_SAFELEN
:
12237 case OMP_CLAUSE_SIMDLEN
:
12238 case OMP_CLAUSE_ORDERED
:
12239 case OMP_CLAUSE_PRIORITY
:
12240 case OMP_CLAUSE_GRAINSIZE
:
12241 case OMP_CLAUSE_NUM_TASKS
:
12242 case OMP_CLAUSE_HINT
:
12243 case OMP_CLAUSE_TO_DECLARE
:
12244 case OMP_CLAUSE_LINK
:
12245 case OMP_CLAUSE_DETACH
:
12246 case OMP_CLAUSE_USE_DEVICE_PTR
:
12247 case OMP_CLAUSE_USE_DEVICE_ADDR
:
12248 case OMP_CLAUSE_IS_DEVICE_PTR
:
12249 case OMP_CLAUSE_INCLUSIVE
:
12250 case OMP_CLAUSE_EXCLUSIVE
:
12251 case OMP_CLAUSE__LOOPTEMP_
:
12252 case OMP_CLAUSE__REDUCTEMP_
:
12253 case OMP_CLAUSE__CONDTEMP_
:
12254 case OMP_CLAUSE__SCANTEMP_
:
12255 case OMP_CLAUSE__SIMDUID_
:
12256 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 0));
12259 case OMP_CLAUSE_INDEPENDENT
:
12260 case OMP_CLAUSE_NOWAIT
:
12261 case OMP_CLAUSE_DEFAULT
:
12262 case OMP_CLAUSE_UNTIED
:
12263 case OMP_CLAUSE_MERGEABLE
:
12264 case OMP_CLAUSE_PROC_BIND
:
12265 case OMP_CLAUSE_DEVICE_TYPE
:
12266 case OMP_CLAUSE_INBRANCH
:
12267 case OMP_CLAUSE_NOTINBRANCH
:
12268 case OMP_CLAUSE_FOR
:
12269 case OMP_CLAUSE_PARALLEL
:
12270 case OMP_CLAUSE_SECTIONS
:
12271 case OMP_CLAUSE_TASKGROUP
:
12272 case OMP_CLAUSE_NOGROUP
:
12273 case OMP_CLAUSE_THREADS
:
12274 case OMP_CLAUSE_SIMD
:
12275 case OMP_CLAUSE_DEFAULTMAP
:
12276 case OMP_CLAUSE_ORDER
:
12277 case OMP_CLAUSE_BIND
:
12278 case OMP_CLAUSE_AUTO
:
12279 case OMP_CLAUSE_SEQ
:
12280 case OMP_CLAUSE_TILE
:
12281 case OMP_CLAUSE__SIMT_
:
12282 case OMP_CLAUSE_IF_PRESENT
:
12283 case OMP_CLAUSE_FINALIZE
:
12284 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
12286 case OMP_CLAUSE_LASTPRIVATE
:
12287 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
12288 WALK_SUBTREE (OMP_CLAUSE_LASTPRIVATE_STMT (*tp
));
12289 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
12291 case OMP_CLAUSE_COLLAPSE
:
12294 for (i
= 0; i
< 3; i
++)
12295 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
12296 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
12299 case OMP_CLAUSE_LINEAR
:
12300 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
12301 WALK_SUBTREE (OMP_CLAUSE_LINEAR_STEP (*tp
));
12302 WALK_SUBTREE (OMP_CLAUSE_LINEAR_STMT (*tp
));
12303 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
12305 case OMP_CLAUSE_ALIGNED
:
12306 case OMP_CLAUSE_ALLOCATE
:
12307 case OMP_CLAUSE_FROM
:
12308 case OMP_CLAUSE_TO
:
12309 case OMP_CLAUSE_MAP
:
12310 case OMP_CLAUSE__CACHE_
:
12311 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
12312 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 1));
12313 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
12315 case OMP_CLAUSE_REDUCTION
:
12316 case OMP_CLAUSE_TASK_REDUCTION
:
12317 case OMP_CLAUSE_IN_REDUCTION
:
12320 for (i
= 0; i
< 5; i
++)
12321 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
12322 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
12326 gcc_unreachable ();
12334 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
12335 But, we only want to walk once. */
12336 len
= (TREE_OPERAND (*tp
, 3) == TREE_OPERAND (*tp
, 1)) ? 2 : 3;
12337 for (i
= 0; i
< len
; ++i
)
12338 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
12339 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
));
12343 /* If this is a TYPE_DECL, walk into the fields of the type that it's
12344 defining. We only want to walk into these fields of a type in this
12345 case and not in the general case of a mere reference to the type.
12347 The criterion is as follows: if the field can be an expression, it
12348 must be walked only here. This should be in keeping with the fields
12349 that are directly gimplified in gimplify_type_sizes in order for the
12350 mark/copy-if-shared/unmark machinery of the gimplifier to work with
12351 variable-sized types.
12353 Note that DECLs get walked as part of processing the BIND_EXPR. */
12354 if (TREE_CODE (DECL_EXPR_DECL (*tp
)) == TYPE_DECL
)
12356 /* Call the function for the decl so e.g. copy_tree_body_r can
12357 replace it with the remapped one. */
12358 result
= (*func
) (&DECL_EXPR_DECL (*tp
), &walk_subtrees
, data
);
12359 if (result
|| !walk_subtrees
)
12362 tree
*type_p
= &TREE_TYPE (DECL_EXPR_DECL (*tp
));
12363 if (TREE_CODE (*type_p
) == ERROR_MARK
)
12366 /* Call the function for the type. See if it returns anything or
12367 doesn't want us to continue. If we are to continue, walk both
12368 the normal fields and those for the declaration case. */
12369 result
= (*func
) (type_p
, &walk_subtrees
, data
);
12370 if (result
|| !walk_subtrees
)
12373 /* But do not walk a pointed-to type since it may itself need to
12374 be walked in the declaration case if it isn't anonymous. */
12375 if (!POINTER_TYPE_P (*type_p
))
12377 result
= walk_type_fields (*type_p
, func
, data
, pset
, lh
);
12382 /* If this is a record type, also walk the fields. */
12383 if (RECORD_OR_UNION_TYPE_P (*type_p
))
12387 for (field
= TYPE_FIELDS (*type_p
); field
;
12388 field
= DECL_CHAIN (field
))
12390 /* We'd like to look at the type of the field, but we can
12391 easily get infinite recursion. So assume it's pointed
12392 to elsewhere in the tree. Also, ignore things that
12394 if (TREE_CODE (field
) != FIELD_DECL
)
12397 WALK_SUBTREE (DECL_FIELD_OFFSET (field
));
12398 WALK_SUBTREE (DECL_SIZE (field
));
12399 WALK_SUBTREE (DECL_SIZE_UNIT (field
));
12400 if (TREE_CODE (*type_p
) == QUAL_UNION_TYPE
)
12401 WALK_SUBTREE (DECL_QUALIFIER (field
));
12405 /* Same for scalar types. */
12406 else if (TREE_CODE (*type_p
) == BOOLEAN_TYPE
12407 || TREE_CODE (*type_p
) == ENUMERAL_TYPE
12408 || TREE_CODE (*type_p
) == INTEGER_TYPE
12409 || TREE_CODE (*type_p
) == FIXED_POINT_TYPE
12410 || TREE_CODE (*type_p
) == REAL_TYPE
)
12412 WALK_SUBTREE (TYPE_MIN_VALUE (*type_p
));
12413 WALK_SUBTREE (TYPE_MAX_VALUE (*type_p
));
12416 WALK_SUBTREE (TYPE_SIZE (*type_p
));
12417 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p
));
12422 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code
)))
12426 /* Walk over all the sub-trees of this operand. */
12427 len
= TREE_OPERAND_LENGTH (*tp
);
12429 /* Go through the subtrees. We need to do this in forward order so
12430 that the scope of a FOR_EXPR is handled properly. */
12433 for (i
= 0; i
< len
- 1; ++i
)
12434 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
12435 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
- 1));
12438 /* If this is a type, walk the needed fields in the type. */
12439 else if (TYPE_P (*tp
))
12440 return walk_type_fields (*tp
, func
, data
, pset
, lh
);
12444 /* We didn't find what we were looking for. */
12447 #undef WALK_SUBTREE_TAIL
12449 #undef WALK_SUBTREE
12451 /* Like walk_tree, but does not walk duplicate nodes more than once. */
12454 walk_tree_without_duplicates_1 (tree
*tp
, walk_tree_fn func
, void *data
,
12459 hash_set
<tree
> pset
;
12460 result
= walk_tree_1 (tp
, func
, data
, &pset
, lh
);
12466 tree_block (tree t
)
12468 const enum tree_code_class c
= TREE_CODE_CLASS (TREE_CODE (t
));
12470 if (IS_EXPR_CODE_CLASS (c
))
12471 return LOCATION_BLOCK (t
->exp
.locus
);
12472 gcc_unreachable ();
12477 tree_set_block (tree t
, tree b
)
12479 const enum tree_code_class c
= TREE_CODE_CLASS (TREE_CODE (t
));
12481 if (IS_EXPR_CODE_CLASS (c
))
12483 t
->exp
.locus
= set_block (t
->exp
.locus
, b
);
12486 gcc_unreachable ();
12489 /* Create a nameless artificial label and put it in the current
12490 function context. The label has a location of LOC. Returns the
12491 newly created label. */
12494 create_artificial_label (location_t loc
)
12496 tree lab
= build_decl (loc
,
12497 LABEL_DECL
, NULL_TREE
, void_type_node
);
12499 DECL_ARTIFICIAL (lab
) = 1;
12500 DECL_IGNORED_P (lab
) = 1;
12501 DECL_CONTEXT (lab
) = current_function_decl
;
12505 /* Given a tree, try to return a useful variable name that we can use
12506 to prefix a temporary that is being assigned the value of the tree.
12507 I.E. given <temp> = &A, return A. */
12512 tree stripped_decl
;
12515 STRIP_NOPS (stripped_decl
);
12516 if (DECL_P (stripped_decl
) && DECL_NAME (stripped_decl
))
12517 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl
));
12518 else if (TREE_CODE (stripped_decl
) == SSA_NAME
)
12520 tree name
= SSA_NAME_IDENTIFIER (stripped_decl
);
12523 return IDENTIFIER_POINTER (name
);
12527 switch (TREE_CODE (stripped_decl
))
12530 return get_name (TREE_OPERAND (stripped_decl
, 0));
12537 /* Return true if TYPE has a variable argument list. */
12540 stdarg_p (const_tree fntype
)
12542 function_args_iterator args_iter
;
12543 tree n
= NULL_TREE
, t
;
12548 FOREACH_FUNCTION_ARGS (fntype
, t
, args_iter
)
12553 return n
!= NULL_TREE
&& n
!= void_type_node
;
12556 /* Return true if TYPE has a prototype. */
12559 prototype_p (const_tree fntype
)
12563 gcc_assert (fntype
!= NULL_TREE
);
12565 t
= TYPE_ARG_TYPES (fntype
);
12566 return (t
!= NULL_TREE
);
12569 /* If BLOCK is inlined from an __attribute__((__artificial__))
12570 routine, return pointer to location from where it has been
12573 block_nonartificial_location (tree block
)
12575 location_t
*ret
= NULL
;
12577 while (block
&& TREE_CODE (block
) == BLOCK
12578 && BLOCK_ABSTRACT_ORIGIN (block
))
12580 tree ao
= BLOCK_ABSTRACT_ORIGIN (block
);
12581 if (TREE_CODE (ao
) == FUNCTION_DECL
)
12583 /* If AO is an artificial inline, point RET to the
12584 call site locus at which it has been inlined and continue
12585 the loop, in case AO's caller is also an artificial
12587 if (DECL_DECLARED_INLINE_P (ao
)
12588 && lookup_attribute ("artificial", DECL_ATTRIBUTES (ao
)))
12589 ret
= &BLOCK_SOURCE_LOCATION (block
);
12593 else if (TREE_CODE (ao
) != BLOCK
)
12596 block
= BLOCK_SUPERCONTEXT (block
);
12602 /* If EXP is inlined from an __attribute__((__artificial__))
12603 function, return the location of the original call expression. */
12606 tree_nonartificial_location (tree exp
)
12608 location_t
*loc
= block_nonartificial_location (TREE_BLOCK (exp
));
12613 return EXPR_LOCATION (exp
);
12616 /* Return the location into which EXP has been inlined. Analogous
12617 to tree_nonartificial_location() above but not limited to artificial
12618 functions declared inline. If SYSTEM_HEADER is true, return
12619 the macro expansion point of the location if it's in a system header */
12622 tree_inlined_location (tree exp
, bool system_header
/* = true */)
12624 location_t loc
= UNKNOWN_LOCATION
;
12626 tree block
= TREE_BLOCK (exp
);
12628 while (block
&& TREE_CODE (block
) == BLOCK
12629 && BLOCK_ABSTRACT_ORIGIN (block
))
12631 tree ao
= BLOCK_ABSTRACT_ORIGIN (block
);
12632 if (TREE_CODE (ao
) == FUNCTION_DECL
)
12633 loc
= BLOCK_SOURCE_LOCATION (block
);
12634 else if (TREE_CODE (ao
) != BLOCK
)
12637 block
= BLOCK_SUPERCONTEXT (block
);
12640 if (loc
== UNKNOWN_LOCATION
)
12642 loc
= EXPR_LOCATION (exp
);
12644 /* Only consider macro expansion when the block traversal failed
12645 to find a location. Otherwise it's not relevant. */
12646 return expansion_point_location_if_in_system_header (loc
);
12652 /* These are the hash table functions for the hash table of OPTIMIZATION_NODE
12655 /* Return the hash code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
12658 cl_option_hasher::hash (tree x
)
12660 const_tree
const t
= x
;
12664 hashval_t hash
= 0;
12666 if (TREE_CODE (t
) == OPTIMIZATION_NODE
)
12668 p
= (const char *)TREE_OPTIMIZATION (t
);
12669 len
= sizeof (struct cl_optimization
);
12672 else if (TREE_CODE (t
) == TARGET_OPTION_NODE
)
12673 return cl_target_option_hash (TREE_TARGET_OPTION (t
));
12676 gcc_unreachable ();
12678 /* assume most opt flags are just 0/1, some are 2-3, and a few might be
12680 for (i
= 0; i
< len
; i
++)
12682 hash
= (hash
<< 4) ^ ((i
<< 2) | p
[i
]);
12687 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
12688 TARGET_OPTION tree node) is the same as that given by *Y, which is the
12692 cl_option_hasher::equal (tree x
, tree y
)
12694 const_tree
const xt
= x
;
12695 const_tree
const yt
= y
;
12697 if (TREE_CODE (xt
) != TREE_CODE (yt
))
12700 if (TREE_CODE (xt
) == OPTIMIZATION_NODE
)
12701 return cl_optimization_option_eq (TREE_OPTIMIZATION (xt
),
12702 TREE_OPTIMIZATION (yt
));
12703 else if (TREE_CODE (xt
) == TARGET_OPTION_NODE
)
12704 return cl_target_option_eq (TREE_TARGET_OPTION (xt
),
12705 TREE_TARGET_OPTION (yt
));
12707 gcc_unreachable ();
12710 /* Build an OPTIMIZATION_NODE based on the options in OPTS and OPTS_SET. */
12713 build_optimization_node (struct gcc_options
*opts
,
12714 struct gcc_options
*opts_set
)
12718 /* Use the cache of optimization nodes. */
12720 cl_optimization_save (TREE_OPTIMIZATION (cl_optimization_node
),
12723 tree
*slot
= cl_option_hash_table
->find_slot (cl_optimization_node
, INSERT
);
12727 /* Insert this one into the hash table. */
12728 t
= cl_optimization_node
;
12731 /* Make a new node for next time round. */
12732 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
12738 /* Build a TARGET_OPTION_NODE based on the options in OPTS and OPTS_SET. */
12741 build_target_option_node (struct gcc_options
*opts
,
12742 struct gcc_options
*opts_set
)
12746 /* Use the cache of optimization nodes. */
12748 cl_target_option_save (TREE_TARGET_OPTION (cl_target_option_node
),
12751 tree
*slot
= cl_option_hash_table
->find_slot (cl_target_option_node
, INSERT
);
12755 /* Insert this one into the hash table. */
12756 t
= cl_target_option_node
;
12759 /* Make a new node for next time round. */
12760 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
12766 /* Clear TREE_TARGET_GLOBALS of all TARGET_OPTION_NODE trees,
12767 so that they aren't saved during PCH writing. */
12770 prepare_target_option_nodes_for_pch (void)
12772 hash_table
<cl_option_hasher
>::iterator iter
= cl_option_hash_table
->begin ();
12773 for (; iter
!= cl_option_hash_table
->end (); ++iter
)
12774 if (TREE_CODE (*iter
) == TARGET_OPTION_NODE
)
12775 TREE_TARGET_GLOBALS (*iter
) = NULL
;
12778 /* Determine the "ultimate origin" of a block. */
12781 block_ultimate_origin (const_tree block
)
12783 tree origin
= BLOCK_ABSTRACT_ORIGIN (block
);
12785 if (origin
== NULL_TREE
)
12789 gcc_checking_assert ((DECL_P (origin
)
12790 && DECL_ORIGIN (origin
) == origin
)
12791 || BLOCK_ORIGIN (origin
) == origin
);
12796 /* Return true iff conversion from INNER_TYPE to OUTER_TYPE generates
12800 tree_nop_conversion_p (const_tree outer_type
, const_tree inner_type
)
12802 /* Do not strip casts into or out of differing address spaces. */
12803 if (POINTER_TYPE_P (outer_type
)
12804 && TYPE_ADDR_SPACE (TREE_TYPE (outer_type
)) != ADDR_SPACE_GENERIC
)
12806 if (!POINTER_TYPE_P (inner_type
)
12807 || (TYPE_ADDR_SPACE (TREE_TYPE (outer_type
))
12808 != TYPE_ADDR_SPACE (TREE_TYPE (inner_type
))))
12811 else if (POINTER_TYPE_P (inner_type
)
12812 && TYPE_ADDR_SPACE (TREE_TYPE (inner_type
)) != ADDR_SPACE_GENERIC
)
12814 /* We already know that outer_type is not a pointer with
12815 a non-generic address space. */
12819 /* Use precision rather then machine mode when we can, which gives
12820 the correct answer even for submode (bit-field) types. */
12821 if ((INTEGRAL_TYPE_P (outer_type
)
12822 || POINTER_TYPE_P (outer_type
)
12823 || TREE_CODE (outer_type
) == OFFSET_TYPE
)
12824 && (INTEGRAL_TYPE_P (inner_type
)
12825 || POINTER_TYPE_P (inner_type
)
12826 || TREE_CODE (inner_type
) == OFFSET_TYPE
))
12827 return TYPE_PRECISION (outer_type
) == TYPE_PRECISION (inner_type
);
12829 /* Otherwise fall back on comparing machine modes (e.g. for
12830 aggregate types, floats). */
12831 return TYPE_MODE (outer_type
) == TYPE_MODE (inner_type
);
12834 /* Return true iff conversion in EXP generates no instruction. Mark
12835 it inline so that we fully inline into the stripping functions even
12836 though we have two uses of this function. */
12839 tree_nop_conversion (const_tree exp
)
12841 tree outer_type
, inner_type
;
12843 if (location_wrapper_p (exp
))
12845 if (!CONVERT_EXPR_P (exp
)
12846 && TREE_CODE (exp
) != NON_LVALUE_EXPR
)
12849 outer_type
= TREE_TYPE (exp
);
12850 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
12851 if (!inner_type
|| inner_type
== error_mark_node
)
12854 return tree_nop_conversion_p (outer_type
, inner_type
);
12857 /* Return true iff conversion in EXP generates no instruction. Don't
12858 consider conversions changing the signedness. */
12861 tree_sign_nop_conversion (const_tree exp
)
12863 tree outer_type
, inner_type
;
12865 if (!tree_nop_conversion (exp
))
12868 outer_type
= TREE_TYPE (exp
);
12869 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
12871 return (TYPE_UNSIGNED (outer_type
) == TYPE_UNSIGNED (inner_type
)
12872 && POINTER_TYPE_P (outer_type
) == POINTER_TYPE_P (inner_type
));
12875 /* Strip conversions from EXP according to tree_nop_conversion and
12876 return the resulting expression. */
12879 tree_strip_nop_conversions (tree exp
)
12881 while (tree_nop_conversion (exp
))
12882 exp
= TREE_OPERAND (exp
, 0);
12886 /* Strip conversions from EXP according to tree_sign_nop_conversion
12887 and return the resulting expression. */
12890 tree_strip_sign_nop_conversions (tree exp
)
12892 while (tree_sign_nop_conversion (exp
))
12893 exp
= TREE_OPERAND (exp
, 0);
12897 /* Avoid any floating point extensions from EXP. */
12899 strip_float_extensions (tree exp
)
12901 tree sub
, expt
, subt
;
12903 /* For floating point constant look up the narrowest type that can hold
12904 it properly and handle it like (type)(narrowest_type)constant.
12905 This way we can optimize for instance a=a*2.0 where "a" is float
12906 but 2.0 is double constant. */
12907 if (TREE_CODE (exp
) == REAL_CST
&& !DECIMAL_FLOAT_TYPE_P (TREE_TYPE (exp
)))
12909 REAL_VALUE_TYPE orig
;
12912 orig
= TREE_REAL_CST (exp
);
12913 if (TYPE_PRECISION (TREE_TYPE (exp
)) > TYPE_PRECISION (float_type_node
)
12914 && exact_real_truncate (TYPE_MODE (float_type_node
), &orig
))
12915 type
= float_type_node
;
12916 else if (TYPE_PRECISION (TREE_TYPE (exp
))
12917 > TYPE_PRECISION (double_type_node
)
12918 && exact_real_truncate (TYPE_MODE (double_type_node
), &orig
))
12919 type
= double_type_node
;
12921 return build_real_truncate (type
, orig
);
12924 if (!CONVERT_EXPR_P (exp
))
12927 sub
= TREE_OPERAND (exp
, 0);
12928 subt
= TREE_TYPE (sub
);
12929 expt
= TREE_TYPE (exp
);
12931 if (!FLOAT_TYPE_P (subt
))
12934 if (DECIMAL_FLOAT_TYPE_P (expt
) != DECIMAL_FLOAT_TYPE_P (subt
))
12937 if (TYPE_PRECISION (subt
) > TYPE_PRECISION (expt
))
12940 return strip_float_extensions (sub
);
12943 /* Strip out all handled components that produce invariant
12947 strip_invariant_refs (const_tree op
)
12949 while (handled_component_p (op
))
12951 switch (TREE_CODE (op
))
12954 case ARRAY_RANGE_REF
:
12955 if (!is_gimple_constant (TREE_OPERAND (op
, 1))
12956 || TREE_OPERAND (op
, 2) != NULL_TREE
12957 || TREE_OPERAND (op
, 3) != NULL_TREE
)
12961 case COMPONENT_REF
:
12962 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
12968 op
= TREE_OPERAND (op
, 0);
12974 static GTY(()) tree gcc_eh_personality_decl
;
12976 /* Return the GCC personality function decl. */
12979 lhd_gcc_personality (void)
12981 if (!gcc_eh_personality_decl
)
12982 gcc_eh_personality_decl
= build_personality_function ("gcc");
12983 return gcc_eh_personality_decl
;
12986 /* TARGET is a call target of GIMPLE call statement
12987 (obtained by gimple_call_fn). Return true if it is
12988 OBJ_TYPE_REF representing an virtual call of C++ method.
12989 (As opposed to OBJ_TYPE_REF representing objc calls
12990 through a cast where middle-end devirtualization machinery
12991 can't apply.) FOR_DUMP_P is true when being called from
12992 the dump routines. */
12995 virtual_method_call_p (const_tree target
, bool for_dump_p
)
12997 if (TREE_CODE (target
) != OBJ_TYPE_REF
)
12999 tree t
= TREE_TYPE (target
);
13000 gcc_checking_assert (TREE_CODE (t
) == POINTER_TYPE
);
13002 if (TREE_CODE (t
) == FUNCTION_TYPE
)
13004 gcc_checking_assert (TREE_CODE (t
) == METHOD_TYPE
);
13005 /* If we do not have BINFO associated, it means that type was built
13006 without devirtualization enabled. Do not consider this a virtual
13008 if (!TYPE_BINFO (obj_type_ref_class (target
, for_dump_p
)))
13013 /* Lookup sub-BINFO of BINFO of TYPE at offset POS. */
13016 lookup_binfo_at_offset (tree binfo
, tree type
, HOST_WIDE_INT pos
)
13019 tree base_binfo
, b
;
13021 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
13022 if (pos
== tree_to_shwi (BINFO_OFFSET (base_binfo
))
13023 && types_same_for_odr (TREE_TYPE (base_binfo
), type
))
13025 else if ((b
= lookup_binfo_at_offset (base_binfo
, type
, pos
)) != NULL
)
13030 /* Try to find a base info of BINFO that would have its field decl at offset
13031 OFFSET within the BINFO type and which is of EXPECTED_TYPE. If it can be
13032 found, return, otherwise return NULL_TREE. */
13035 get_binfo_at_offset (tree binfo
, poly_int64 offset
, tree expected_type
)
13037 tree type
= BINFO_TYPE (binfo
);
13041 HOST_WIDE_INT pos
, size
;
13045 if (types_same_for_odr (type
, expected_type
))
13047 if (maybe_lt (offset
, 0))
13050 for (fld
= TYPE_FIELDS (type
); fld
; fld
= DECL_CHAIN (fld
))
13052 if (TREE_CODE (fld
) != FIELD_DECL
|| !DECL_ARTIFICIAL (fld
))
13055 pos
= int_bit_position (fld
);
13056 size
= tree_to_uhwi (DECL_SIZE (fld
));
13057 if (known_in_range_p (offset
, pos
, size
))
13060 if (!fld
|| TREE_CODE (TREE_TYPE (fld
)) != RECORD_TYPE
)
13063 /* Offset 0 indicates the primary base, whose vtable contents are
13064 represented in the binfo for the derived class. */
13065 else if (maybe_ne (offset
, 0))
13067 tree found_binfo
= NULL
, base_binfo
;
13068 /* Offsets in BINFO are in bytes relative to the whole structure
13069 while POS is in bits relative to the containing field. */
13070 int binfo_offset
= (tree_to_shwi (BINFO_OFFSET (binfo
)) + pos
13073 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
13074 if (tree_to_shwi (BINFO_OFFSET (base_binfo
)) == binfo_offset
13075 && types_same_for_odr (TREE_TYPE (base_binfo
), TREE_TYPE (fld
)))
13077 found_binfo
= base_binfo
;
13081 binfo
= found_binfo
;
13083 binfo
= lookup_binfo_at_offset (binfo
, TREE_TYPE (fld
),
13087 type
= TREE_TYPE (fld
);
13092 /* Returns true if X is a typedef decl. */
13095 is_typedef_decl (const_tree x
)
13097 return (x
&& TREE_CODE (x
) == TYPE_DECL
13098 && DECL_ORIGINAL_TYPE (x
) != NULL_TREE
);
13101 /* Returns true iff TYPE is a type variant created for a typedef. */
13104 typedef_variant_p (const_tree type
)
13106 return is_typedef_decl (TYPE_NAME (type
));
13109 /* PR 84195: Replace control characters in "unescaped" with their
13110 escaped equivalents. Allow newlines if -fmessage-length has
13111 been set to a non-zero value. This is done here, rather than
13112 where the attribute is recorded as the message length can
13113 change between these two locations. */
13116 escaped_string::escape (const char *unescaped
)
13119 size_t i
, new_i
, len
;
13124 m_str
= const_cast<char *> (unescaped
);
13127 if (unescaped
== NULL
|| *unescaped
== 0)
13130 len
= strlen (unescaped
);
13134 for (i
= 0; i
< len
; i
++)
13136 char c
= unescaped
[i
];
13141 escaped
[new_i
++] = c
;
13145 if (c
!= '\n' || !pp_is_wrapping_line (global_dc
->printer
))
13147 if (escaped
== NULL
)
13149 /* We only allocate space for a new string if we
13150 actually encounter a control character that
13151 needs replacing. */
13152 escaped
= (char *) xmalloc (len
* 2 + 1);
13153 strncpy (escaped
, unescaped
, i
);
13157 escaped
[new_i
++] = '\\';
13161 case '\a': escaped
[new_i
++] = 'a'; break;
13162 case '\b': escaped
[new_i
++] = 'b'; break;
13163 case '\f': escaped
[new_i
++] = 'f'; break;
13164 case '\n': escaped
[new_i
++] = 'n'; break;
13165 case '\r': escaped
[new_i
++] = 'r'; break;
13166 case '\t': escaped
[new_i
++] = 't'; break;
13167 case '\v': escaped
[new_i
++] = 'v'; break;
13168 default: escaped
[new_i
++] = '?'; break;
13172 escaped
[new_i
++] = c
;
13177 escaped
[new_i
] = 0;
13183 /* Warn about a use of an identifier which was marked deprecated. Returns
13184 whether a warning was given. */
13187 warn_deprecated_use (tree node
, tree attr
)
13189 escaped_string msg
;
13191 if (node
== 0 || !warn_deprecated_decl
)
13197 attr
= DECL_ATTRIBUTES (node
);
13198 else if (TYPE_P (node
))
13200 tree decl
= TYPE_STUB_DECL (node
);
13202 attr
= lookup_attribute ("deprecated",
13203 TYPE_ATTRIBUTES (TREE_TYPE (decl
)));
13208 attr
= lookup_attribute ("deprecated", attr
);
13211 msg
.escape (TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr
))));
13216 auto_diagnostic_group d
;
13218 w
= warning (OPT_Wdeprecated_declarations
,
13219 "%qD is deprecated: %s", node
, (const char *) msg
);
13221 w
= warning (OPT_Wdeprecated_declarations
,
13222 "%qD is deprecated", node
);
13224 inform (DECL_SOURCE_LOCATION (node
), "declared here");
13226 else if (TYPE_P (node
))
13228 tree what
= NULL_TREE
;
13229 tree decl
= TYPE_STUB_DECL (node
);
13231 if (TYPE_NAME (node
))
13233 if (TREE_CODE (TYPE_NAME (node
)) == IDENTIFIER_NODE
)
13234 what
= TYPE_NAME (node
);
13235 else if (TREE_CODE (TYPE_NAME (node
)) == TYPE_DECL
13236 && DECL_NAME (TYPE_NAME (node
)))
13237 what
= DECL_NAME (TYPE_NAME (node
));
13240 auto_diagnostic_group d
;
13244 w
= warning (OPT_Wdeprecated_declarations
,
13245 "%qE is deprecated: %s", what
, (const char *) msg
);
13247 w
= warning (OPT_Wdeprecated_declarations
,
13248 "%qE is deprecated", what
);
13253 w
= warning (OPT_Wdeprecated_declarations
,
13254 "type is deprecated: %s", (const char *) msg
);
13256 w
= warning (OPT_Wdeprecated_declarations
,
13257 "type is deprecated");
13261 inform (DECL_SOURCE_LOCATION (decl
), "declared here");
13267 /* Return true if REF has a COMPONENT_REF with a bit-field field declaration
13268 somewhere in it. */
13271 contains_bitfld_component_ref_p (const_tree ref
)
13273 while (handled_component_p (ref
))
13275 if (TREE_CODE (ref
) == COMPONENT_REF
13276 && DECL_BIT_FIELD (TREE_OPERAND (ref
, 1)))
13278 ref
= TREE_OPERAND (ref
, 0);
13284 /* Try to determine whether a TRY_CATCH expression can fall through.
13285 This is a subroutine of block_may_fallthru. */
13288 try_catch_may_fallthru (const_tree stmt
)
13290 tree_stmt_iterator i
;
13292 /* If the TRY block can fall through, the whole TRY_CATCH can
13294 if (block_may_fallthru (TREE_OPERAND (stmt
, 0)))
13297 i
= tsi_start (TREE_OPERAND (stmt
, 1));
13298 switch (TREE_CODE (tsi_stmt (i
)))
13301 /* We expect to see a sequence of CATCH_EXPR trees, each with a
13302 catch expression and a body. The whole TRY_CATCH may fall
13303 through iff any of the catch bodies falls through. */
13304 for (; !tsi_end_p (i
); tsi_next (&i
))
13306 if (block_may_fallthru (CATCH_BODY (tsi_stmt (i
))))
13311 case EH_FILTER_EXPR
:
13312 /* The exception filter expression only matters if there is an
13313 exception. If the exception does not match EH_FILTER_TYPES,
13314 we will execute EH_FILTER_FAILURE, and we will fall through
13315 if that falls through. If the exception does match
13316 EH_FILTER_TYPES, the stack unwinder will continue up the
13317 stack, so we will not fall through. We don't know whether we
13318 will throw an exception which matches EH_FILTER_TYPES or not,
13319 so we just ignore EH_FILTER_TYPES and assume that we might
13320 throw an exception which doesn't match. */
13321 return block_may_fallthru (EH_FILTER_FAILURE (tsi_stmt (i
)));
13324 /* This case represents statements to be executed when an
13325 exception occurs. Those statements are implicitly followed
13326 by a RESX statement to resume execution after the exception.
13327 So in this case the TRY_CATCH never falls through. */
13332 /* Try to determine if we can fall out of the bottom of BLOCK. This guess
13333 need not be 100% accurate; simply be conservative and return true if we
13334 don't know. This is used only to avoid stupidly generating extra code.
13335 If we're wrong, we'll just delete the extra code later. */
13338 block_may_fallthru (const_tree block
)
13340 /* This CONST_CAST is okay because expr_last returns its argument
13341 unmodified and we assign it to a const_tree. */
13342 const_tree stmt
= expr_last (CONST_CAST_TREE (block
));
13344 switch (stmt
? TREE_CODE (stmt
) : ERROR_MARK
)
13348 /* Easy cases. If the last statement of the block implies
13349 control transfer, then we can't fall through. */
13353 /* If there is a default: label or case labels cover all possible
13354 SWITCH_COND values, then the SWITCH_EXPR will transfer control
13355 to some case label in all cases and all we care is whether the
13356 SWITCH_BODY falls through. */
13357 if (SWITCH_ALL_CASES_P (stmt
))
13358 return block_may_fallthru (SWITCH_BODY (stmt
));
13362 if (block_may_fallthru (COND_EXPR_THEN (stmt
)))
13364 return block_may_fallthru (COND_EXPR_ELSE (stmt
));
13367 return block_may_fallthru (BIND_EXPR_BODY (stmt
));
13369 case TRY_CATCH_EXPR
:
13370 return try_catch_may_fallthru (stmt
);
13372 case TRY_FINALLY_EXPR
:
13373 /* The finally clause is always executed after the try clause,
13374 so if it does not fall through, then the try-finally will not
13375 fall through. Otherwise, if the try clause does not fall
13376 through, then when the finally clause falls through it will
13377 resume execution wherever the try clause was going. So the
13378 whole try-finally will only fall through if both the try
13379 clause and the finally clause fall through. */
13380 return (block_may_fallthru (TREE_OPERAND (stmt
, 0))
13381 && block_may_fallthru (TREE_OPERAND (stmt
, 1)));
13384 return block_may_fallthru (TREE_OPERAND (stmt
, 0));
13387 if (TREE_CODE (TREE_OPERAND (stmt
, 1)) == CALL_EXPR
)
13388 stmt
= TREE_OPERAND (stmt
, 1);
13394 /* Functions that do not return do not fall through. */
13395 return (call_expr_flags (stmt
) & ECF_NORETURN
) == 0;
13397 case CLEANUP_POINT_EXPR
:
13398 return block_may_fallthru (TREE_OPERAND (stmt
, 0));
13401 return block_may_fallthru (TREE_OPERAND (stmt
, 1));
13407 return lang_hooks
.block_may_fallthru (stmt
);
13411 /* True if we are using EH to handle cleanups. */
13412 static bool using_eh_for_cleanups_flag
= false;
13414 /* This routine is called from front ends to indicate eh should be used for
13417 using_eh_for_cleanups (void)
13419 using_eh_for_cleanups_flag
= true;
13422 /* Query whether EH is used for cleanups. */
13424 using_eh_for_cleanups_p (void)
13426 return using_eh_for_cleanups_flag
;
13429 /* Wrapper for tree_code_name to ensure that tree code is valid */
13431 get_tree_code_name (enum tree_code code
)
13433 const char *invalid
= "<invalid tree code>";
13435 /* The tree_code enum promotes to signed, but we could be getting
13436 invalid values, so force an unsigned comparison. */
13437 if (unsigned (code
) >= MAX_TREE_CODES
)
13439 if (code
== 0xa5a5)
13440 return "ggc_freed";
13444 return tree_code_name
[code
];
13447 /* Drops the TREE_OVERFLOW flag from T. */
13450 drop_tree_overflow (tree t
)
13452 gcc_checking_assert (TREE_OVERFLOW (t
));
13454 /* For tree codes with a sharing machinery re-build the result. */
13455 if (poly_int_tree_p (t
))
13456 return wide_int_to_tree (TREE_TYPE (t
), wi::to_poly_wide (t
));
13458 /* For VECTOR_CST, remove the overflow bits from the encoded elements
13459 and canonicalize the result. */
13460 if (TREE_CODE (t
) == VECTOR_CST
)
13462 tree_vector_builder builder
;
13463 builder
.new_unary_operation (TREE_TYPE (t
), t
, true);
13464 unsigned int count
= builder
.encoded_nelts ();
13465 for (unsigned int i
= 0; i
< count
; ++i
)
13467 tree elt
= VECTOR_CST_ELT (t
, i
);
13468 if (TREE_OVERFLOW (elt
))
13469 elt
= drop_tree_overflow (elt
);
13470 builder
.quick_push (elt
);
13472 return builder
.build ();
13475 /* Otherwise, as all tcc_constants are possibly shared, copy the node
13476 and drop the flag. */
13478 TREE_OVERFLOW (t
) = 0;
13480 /* For constants that contain nested constants, drop the flag
13481 from those as well. */
13482 if (TREE_CODE (t
) == COMPLEX_CST
)
13484 if (TREE_OVERFLOW (TREE_REALPART (t
)))
13485 TREE_REALPART (t
) = drop_tree_overflow (TREE_REALPART (t
));
13486 if (TREE_OVERFLOW (TREE_IMAGPART (t
)))
13487 TREE_IMAGPART (t
) = drop_tree_overflow (TREE_IMAGPART (t
));
13493 /* Given a memory reference expression T, return its base address.
13494 The base address of a memory reference expression is the main
13495 object being referenced. For instance, the base address for
13496 'array[i].fld[j]' is 'array'. You can think of this as stripping
13497 away the offset part from a memory address.
13499 This function calls handled_component_p to strip away all the inner
13500 parts of the memory reference until it reaches the base object. */
13503 get_base_address (tree t
)
13505 while (handled_component_p (t
))
13506 t
= TREE_OPERAND (t
, 0);
13508 if ((TREE_CODE (t
) == MEM_REF
13509 || TREE_CODE (t
) == TARGET_MEM_REF
)
13510 && TREE_CODE (TREE_OPERAND (t
, 0)) == ADDR_EXPR
)
13511 t
= TREE_OPERAND (TREE_OPERAND (t
, 0), 0);
13513 /* ??? Either the alias oracle or all callers need to properly deal
13514 with WITH_SIZE_EXPRs before we can look through those. */
13515 if (TREE_CODE (t
) == WITH_SIZE_EXPR
)
13521 /* Return a tree of sizetype representing the size, in bytes, of the element
13522 of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
13525 array_ref_element_size (tree exp
)
13527 tree aligned_size
= TREE_OPERAND (exp
, 3);
13528 tree elmt_type
= TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp
, 0)));
13529 location_t loc
= EXPR_LOCATION (exp
);
13531 /* If a size was specified in the ARRAY_REF, it's the size measured
13532 in alignment units of the element type. So multiply by that value. */
13535 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
13536 sizetype from another type of the same width and signedness. */
13537 if (TREE_TYPE (aligned_size
) != sizetype
)
13538 aligned_size
= fold_convert_loc (loc
, sizetype
, aligned_size
);
13539 return size_binop_loc (loc
, MULT_EXPR
, aligned_size
,
13540 size_int (TYPE_ALIGN_UNIT (elmt_type
)));
13543 /* Otherwise, take the size from that of the element type. Substitute
13544 any PLACEHOLDER_EXPR that we have. */
13546 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_SIZE_UNIT (elmt_type
), exp
);
13549 /* Return a tree representing the lower bound of the array mentioned in
13550 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
13553 array_ref_low_bound (tree exp
)
13555 tree domain_type
= TYPE_DOMAIN (TREE_TYPE (TREE_OPERAND (exp
, 0)));
13557 /* If a lower bound is specified in EXP, use it. */
13558 if (TREE_OPERAND (exp
, 2))
13559 return TREE_OPERAND (exp
, 2);
13561 /* Otherwise, if there is a domain type and it has a lower bound, use it,
13562 substituting for a PLACEHOLDER_EXPR as needed. */
13563 if (domain_type
&& TYPE_MIN_VALUE (domain_type
))
13564 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_MIN_VALUE (domain_type
), exp
);
13566 /* Otherwise, return a zero of the appropriate type. */
13567 tree idxtype
= TREE_TYPE (TREE_OPERAND (exp
, 1));
13568 return (idxtype
== error_mark_node
13569 ? integer_zero_node
: build_int_cst (idxtype
, 0));
13572 /* Return a tree representing the upper bound of the array mentioned in
13573 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
13576 array_ref_up_bound (tree exp
)
13578 tree domain_type
= TYPE_DOMAIN (TREE_TYPE (TREE_OPERAND (exp
, 0)));
13580 /* If there is a domain type and it has an upper bound, use it, substituting
13581 for a PLACEHOLDER_EXPR as needed. */
13582 if (domain_type
&& TYPE_MAX_VALUE (domain_type
))
13583 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_MAX_VALUE (domain_type
), exp
);
13585 /* Otherwise fail. */
13589 /* Returns true if REF is an array reference, component reference,
13590 or memory reference to an array at the end of a structure.
13591 If this is the case, the array may be allocated larger
13592 than its upper bound implies. */
13595 array_at_struct_end_p (tree ref
)
13599 if (TREE_CODE (ref
) == ARRAY_REF
13600 || TREE_CODE (ref
) == ARRAY_RANGE_REF
)
13602 atype
= TREE_TYPE (TREE_OPERAND (ref
, 0));
13603 ref
= TREE_OPERAND (ref
, 0);
13605 else if (TREE_CODE (ref
) == COMPONENT_REF
13606 && TREE_CODE (TREE_TYPE (TREE_OPERAND (ref
, 1))) == ARRAY_TYPE
)
13607 atype
= TREE_TYPE (TREE_OPERAND (ref
, 1));
13608 else if (TREE_CODE (ref
) == MEM_REF
)
13610 tree arg
= TREE_OPERAND (ref
, 0);
13611 if (TREE_CODE (arg
) == ADDR_EXPR
)
13612 arg
= TREE_OPERAND (arg
, 0);
13613 tree argtype
= TREE_TYPE (arg
);
13614 if (TREE_CODE (argtype
) == RECORD_TYPE
)
13616 if (tree fld
= last_field (argtype
))
13618 atype
= TREE_TYPE (fld
);
13619 if (TREE_CODE (atype
) != ARRAY_TYPE
)
13621 if (VAR_P (arg
) && DECL_SIZE (fld
))
13633 if (TREE_CODE (ref
) == STRING_CST
)
13636 tree ref_to_array
= ref
;
13637 while (handled_component_p (ref
))
13639 /* If the reference chain contains a component reference to a
13640 non-union type and there follows another field the reference
13641 is not at the end of a structure. */
13642 if (TREE_CODE (ref
) == COMPONENT_REF
)
13644 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (ref
, 0))) == RECORD_TYPE
)
13646 tree nextf
= DECL_CHAIN (TREE_OPERAND (ref
, 1));
13647 while (nextf
&& TREE_CODE (nextf
) != FIELD_DECL
)
13648 nextf
= DECL_CHAIN (nextf
);
13653 /* If we have a multi-dimensional array we do not consider
13654 a non-innermost dimension as flex array if the whole
13655 multi-dimensional array is at struct end.
13656 Same for an array of aggregates with a trailing array
13658 else if (TREE_CODE (ref
) == ARRAY_REF
)
13660 else if (TREE_CODE (ref
) == ARRAY_RANGE_REF
)
13662 /* If we view an underlying object as sth else then what we
13663 gathered up to now is what we have to rely on. */
13664 else if (TREE_CODE (ref
) == VIEW_CONVERT_EXPR
)
13667 gcc_unreachable ();
13669 ref
= TREE_OPERAND (ref
, 0);
13672 /* The array now is at struct end. Treat flexible arrays as
13673 always subject to extend, even into just padding constrained by
13674 an underlying decl. */
13675 if (! TYPE_SIZE (atype
)
13676 || ! TYPE_DOMAIN (atype
)
13677 || ! TYPE_MAX_VALUE (TYPE_DOMAIN (atype
)))
13680 if (TREE_CODE (ref
) == MEM_REF
13681 && TREE_CODE (TREE_OPERAND (ref
, 0)) == ADDR_EXPR
)
13682 ref
= TREE_OPERAND (TREE_OPERAND (ref
, 0), 0);
13684 /* If the reference is based on a declared entity, the size of the array
13685 is constrained by its given domain. (Do not trust commons PR/69368). */
13687 && !(flag_unconstrained_commons
13688 && VAR_P (ref
) && DECL_COMMON (ref
))
13689 && DECL_SIZE_UNIT (ref
)
13690 && TREE_CODE (DECL_SIZE_UNIT (ref
)) == INTEGER_CST
)
13692 /* Check whether the array domain covers all of the available
13695 if (TREE_CODE (TYPE_SIZE_UNIT (TREE_TYPE (atype
))) != INTEGER_CST
13696 || TREE_CODE (TYPE_MAX_VALUE (TYPE_DOMAIN (atype
))) != INTEGER_CST
13697 || TREE_CODE (TYPE_MIN_VALUE (TYPE_DOMAIN (atype
))) != INTEGER_CST
)
13699 if (! get_addr_base_and_unit_offset (ref_to_array
, &offset
))
13702 /* If at least one extra element fits it is a flexarray. */
13703 if (known_le ((wi::to_offset (TYPE_MAX_VALUE (TYPE_DOMAIN (atype
)))
13704 - wi::to_offset (TYPE_MIN_VALUE (TYPE_DOMAIN (atype
)))
13706 * wi::to_offset (TYPE_SIZE_UNIT (TREE_TYPE (atype
))),
13707 wi::to_offset (DECL_SIZE_UNIT (ref
)) - offset
))
13716 /* Return a tree representing the offset, in bytes, of the field referenced
13717 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
13720 component_ref_field_offset (tree exp
)
13722 tree aligned_offset
= TREE_OPERAND (exp
, 2);
13723 tree field
= TREE_OPERAND (exp
, 1);
13724 location_t loc
= EXPR_LOCATION (exp
);
13726 /* If an offset was specified in the COMPONENT_REF, it's the offset measured
13727 in units of DECL_OFFSET_ALIGN / BITS_PER_UNIT. So multiply by that
13729 if (aligned_offset
)
13731 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
13732 sizetype from another type of the same width and signedness. */
13733 if (TREE_TYPE (aligned_offset
) != sizetype
)
13734 aligned_offset
= fold_convert_loc (loc
, sizetype
, aligned_offset
);
13735 return size_binop_loc (loc
, MULT_EXPR
, aligned_offset
,
13736 size_int (DECL_OFFSET_ALIGN (field
)
13740 /* Otherwise, take the offset from that of the field. Substitute
13741 any PLACEHOLDER_EXPR that we have. */
13743 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (DECL_FIELD_OFFSET (field
), exp
);
13746 /* Given the initializer INIT, return the initializer for the field
13747 DECL if it exists, otherwise null. Used to obtain the initializer
13748 for a flexible array member and determine its size. */
13751 get_initializer_for (tree init
, tree decl
)
13755 tree fld
, fld_init
;
13756 unsigned HOST_WIDE_INT i
;
13757 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (init
), i
, fld
, fld_init
)
13762 if (TREE_CODE (fld
) == CONSTRUCTOR
)
13764 fld_init
= get_initializer_for (fld_init
, decl
);
13773 /* Determines the size of the member referenced by the COMPONENT_REF
13774 REF, using its initializer expression if necessary in order to
13775 determine the size of an initialized flexible array member.
13776 If non-null, set *ARK when REF refers to an interior zero-length
13777 array or a trailing one-element array.
13778 Returns the size as sizetype (which might be zero for an object
13779 with an uninitialized flexible array member) or null if the size
13780 cannot be determined. */
13783 component_ref_size (tree ref
, special_array_member
*sam
/* = NULL */)
13785 gcc_assert (TREE_CODE (ref
) == COMPONENT_REF
);
13787 special_array_member sambuf
;
13790 *sam
= special_array_member::none
;
13792 /* The object/argument referenced by the COMPONENT_REF and its type. */
13793 tree arg
= TREE_OPERAND (ref
, 0);
13794 tree argtype
= TREE_TYPE (arg
);
13795 /* The referenced member. */
13796 tree member
= TREE_OPERAND (ref
, 1);
13798 tree memsize
= DECL_SIZE_UNIT (member
);
13801 tree memtype
= TREE_TYPE (member
);
13802 if (TREE_CODE (memtype
) != ARRAY_TYPE
)
13803 /* DECL_SIZE may be less than TYPE_SIZE in C++ when referring
13804 to the type of a class with a virtual base which doesn't
13805 reflect the size of the virtual's members (see pr97595).
13806 If that's the case fail for now and implement something
13807 more robust in the future. */
13808 return (tree_int_cst_equal (memsize
, TYPE_SIZE_UNIT (memtype
))
13809 ? memsize
: NULL_TREE
);
13811 bool trailing
= array_at_struct_end_p (ref
);
13812 bool zero_length
= integer_zerop (memsize
);
13813 if (!trailing
&& !zero_length
)
13814 /* MEMBER is either an interior array or is an array with
13815 more than one element. */
13821 *sam
= special_array_member::trail_0
;
13824 *sam
= special_array_member::int_0
;
13825 memsize
= NULL_TREE
;
13830 if (tree dom
= TYPE_DOMAIN (memtype
))
13831 if (tree min
= TYPE_MIN_VALUE (dom
))
13832 if (tree max
= TYPE_MAX_VALUE (dom
))
13833 if (TREE_CODE (min
) == INTEGER_CST
13834 && TREE_CODE (max
) == INTEGER_CST
)
13836 offset_int minidx
= wi::to_offset (min
);
13837 offset_int maxidx
= wi::to_offset (max
);
13838 offset_int neltsm1
= maxidx
- minidx
;
13840 /* MEMBER is an array with more than one element. */
13844 *sam
= special_array_member::trail_1
;
13847 /* For a refernce to a zero- or one-element array member of a union
13848 use the size of the union instead of the size of the member. */
13849 if (TREE_CODE (argtype
) == UNION_TYPE
)
13850 memsize
= TYPE_SIZE_UNIT (argtype
);
13853 /* MEMBER is either a bona fide flexible array member, or a zero-length
13854 array member, or an array of length one treated as such. */
13856 /* If the reference is to a declared object and the member a true
13857 flexible array, try to determine its size from its initializer. */
13858 poly_int64 baseoff
= 0;
13859 tree base
= get_addr_base_and_unit_offset (ref
, &baseoff
);
13860 if (!base
|| !VAR_P (base
))
13862 if (*sam
!= special_array_member::int_0
)
13865 if (TREE_CODE (arg
) != COMPONENT_REF
)
13869 while (TREE_CODE (base
) == COMPONENT_REF
)
13870 base
= TREE_OPERAND (base
, 0);
13871 baseoff
= tree_to_poly_int64 (byte_position (TREE_OPERAND (ref
, 1)));
13874 /* BASE is the declared object of which MEMBER is either a member
13875 or that is cast to ARGTYPE (e.g., a char buffer used to store
13876 an ARGTYPE object). */
13877 tree basetype
= TREE_TYPE (base
);
13879 /* Determine the base type of the referenced object. If it's
13880 the same as ARGTYPE and MEMBER has a known size, return it. */
13881 tree bt
= basetype
;
13882 if (*sam
!= special_array_member::int_0
)
13883 while (TREE_CODE (bt
) == ARRAY_TYPE
)
13884 bt
= TREE_TYPE (bt
);
13885 bool typematch
= useless_type_conversion_p (argtype
, bt
);
13886 if (memsize
&& typematch
)
13889 memsize
= NULL_TREE
;
13892 /* MEMBER is a true flexible array member. Compute its size from
13893 the initializer of the BASE object if it has one. */
13894 if (tree init
= DECL_P (base
) ? DECL_INITIAL (base
) : NULL_TREE
)
13895 if (init
!= error_mark_node
)
13897 init
= get_initializer_for (init
, member
);
13900 memsize
= TYPE_SIZE_UNIT (TREE_TYPE (init
));
13901 if (tree refsize
= TYPE_SIZE_UNIT (argtype
))
13903 /* Use the larger of the initializer size and the tail
13904 padding in the enclosing struct. */
13905 poly_int64 rsz
= tree_to_poly_int64 (refsize
);
13907 if (known_lt (tree_to_poly_int64 (memsize
), rsz
))
13908 memsize
= wide_int_to_tree (TREE_TYPE (memsize
), rsz
);
13920 && DECL_EXTERNAL (base
)
13922 && *sam
!= special_array_member::int_0
)
13923 /* The size of a flexible array member of an extern struct
13924 with no initializer cannot be determined (it's defined
13925 in another translation unit and can have an initializer
13926 with an arbitrary number of elements). */
13929 /* Use the size of the base struct or, for interior zero-length
13930 arrays, the size of the enclosing type. */
13931 memsize
= TYPE_SIZE_UNIT (bt
);
13933 else if (DECL_P (base
))
13934 /* Use the size of the BASE object (possibly an array of some
13935 other type such as char used to store the struct). */
13936 memsize
= DECL_SIZE_UNIT (base
);
13941 /* If the flexible array member has a known size use the greater
13942 of it and the tail padding in the enclosing struct.
13943 Otherwise, when the size of the flexible array member is unknown
13944 and the referenced object is not a struct, use the size of its
13945 type when known. This detects sizes of array buffers when cast
13946 to struct types with flexible array members. */
13949 poly_int64 memsz64
= memsize
? tree_to_poly_int64 (memsize
) : 0;
13950 if (known_lt (baseoff
, memsz64
))
13952 memsz64
-= baseoff
;
13953 return wide_int_to_tree (TREE_TYPE (memsize
), memsz64
);
13955 return size_zero_node
;
13958 /* Return "don't know" for an external non-array object since its
13959 flexible array member can be initialized to have any number of
13960 elements. Otherwise, return zero because the flexible array
13961 member has no elements. */
13962 return (DECL_P (base
)
13963 && DECL_EXTERNAL (base
)
13965 || TREE_CODE (basetype
) != ARRAY_TYPE
)
13966 ? NULL_TREE
: size_zero_node
);
13969 /* Return the machine mode of T. For vectors, returns the mode of the
13970 inner type. The main use case is to feed the result to HONOR_NANS,
13971 avoiding the BLKmode that a direct TYPE_MODE (T) might return. */
13974 element_mode (const_tree t
)
13978 if (VECTOR_TYPE_P (t
) || TREE_CODE (t
) == COMPLEX_TYPE
)
13980 return TYPE_MODE (t
);
13983 /* Vector types need to re-check the target flags each time we report
13984 the machine mode. We need to do this because attribute target can
13985 change the result of vector_mode_supported_p and have_regs_of_mode
13986 on a per-function basis. Thus the TYPE_MODE of a VECTOR_TYPE can
13987 change on a per-function basis. */
13988 /* ??? Possibly a better solution is to run through all the types
13989 referenced by a function and re-compute the TYPE_MODE once, rather
13990 than make the TYPE_MODE macro call a function. */
13993 vector_type_mode (const_tree t
)
13997 gcc_assert (TREE_CODE (t
) == VECTOR_TYPE
);
13999 mode
= t
->type_common
.mode
;
14000 if (VECTOR_MODE_P (mode
)
14001 && (!targetm
.vector_mode_supported_p (mode
)
14002 || !have_regs_of_mode
[mode
]))
14004 scalar_int_mode innermode
;
14006 /* For integers, try mapping it to a same-sized scalar mode. */
14007 if (is_int_mode (TREE_TYPE (t
)->type_common
.mode
, &innermode
))
14009 poly_int64 size
= (TYPE_VECTOR_SUBPARTS (t
)
14010 * GET_MODE_BITSIZE (innermode
));
14011 scalar_int_mode mode
;
14012 if (int_mode_for_size (size
, 0).exists (&mode
)
14013 && have_regs_of_mode
[mode
])
14023 /* Return the size in bits of each element of vector type TYPE. */
14026 vector_element_bits (const_tree type
)
14028 gcc_checking_assert (VECTOR_TYPE_P (type
));
14029 if (VECTOR_BOOLEAN_TYPE_P (type
))
14031 if (SCALAR_INT_MODE_P (TYPE_MODE (type
)))
14034 return vector_element_size (tree_to_poly_uint64 (TYPE_SIZE (type
)),
14035 TYPE_VECTOR_SUBPARTS (type
));
14037 return tree_to_uhwi (TYPE_SIZE (TREE_TYPE (type
)));
14040 /* Calculate the size in bits of each element of vector type TYPE
14041 and return the result as a tree of type bitsizetype. */
14044 vector_element_bits_tree (const_tree type
)
14046 gcc_checking_assert (VECTOR_TYPE_P (type
));
14047 if (VECTOR_BOOLEAN_TYPE_P (type
))
14048 return bitsize_int (vector_element_bits (type
));
14049 return TYPE_SIZE (TREE_TYPE (type
));
14052 /* Verify that basic properties of T match TV and thus T can be a variant of
14053 TV. TV should be the more specified variant (i.e. the main variant). */
14056 verify_type_variant (const_tree t
, tree tv
)
14058 /* Type variant can differ by:
14060 - TYPE_QUALS: TYPE_READONLY, TYPE_VOLATILE, TYPE_ATOMIC, TYPE_RESTRICT,
14061 ENCODE_QUAL_ADDR_SPACE.
14062 - main variant may be TYPE_COMPLETE_P and variant types !TYPE_COMPLETE_P
14063 in this case some values may not be set in the variant types
14064 (see TYPE_COMPLETE_P checks).
14065 - it is possible to have TYPE_ARTIFICIAL variant of non-artifical type
14066 - by TYPE_NAME and attributes (i.e. when variant originate by typedef)
14067 - TYPE_CANONICAL (TYPE_ALIAS_SET is the same among variants)
14068 - by the alignment: TYPE_ALIGN and TYPE_USER_ALIGN
14069 - during LTO by TYPE_CONTEXT if type is TYPE_FILE_SCOPE_P
14070 this is necessary to make it possible to merge types form different TUs
14071 - arrays, pointers and references may have TREE_TYPE that is a variant
14072 of TREE_TYPE of their main variants.
14073 - aggregates may have new TYPE_FIELDS list that list variants of
14074 the main variant TYPE_FIELDS.
14075 - vector types may differ by TYPE_VECTOR_OPAQUE
14078 /* Convenience macro for matching individual fields. */
14079 #define verify_variant_match(flag) \
14081 if (flag (tv) != flag (t)) \
14083 error ("type variant differs by %s", #flag); \
14089 /* tree_base checks. */
14091 verify_variant_match (TREE_CODE
);
14092 /* FIXME: Ada builds non-artificial variants of artificial types. */
14093 if (TYPE_ARTIFICIAL (tv
) && 0)
14094 verify_variant_match (TYPE_ARTIFICIAL
);
14095 if (POINTER_TYPE_P (tv
))
14096 verify_variant_match (TYPE_REF_CAN_ALIAS_ALL
);
14097 /* FIXME: TYPE_SIZES_GIMPLIFIED may differs for Ada build. */
14098 verify_variant_match (TYPE_UNSIGNED
);
14099 verify_variant_match (TYPE_PACKED
);
14100 if (TREE_CODE (t
) == REFERENCE_TYPE
)
14101 verify_variant_match (TYPE_REF_IS_RVALUE
);
14102 if (AGGREGATE_TYPE_P (t
))
14103 verify_variant_match (TYPE_REVERSE_STORAGE_ORDER
);
14105 verify_variant_match (TYPE_SATURATING
);
14106 /* FIXME: This check trigger during libstdc++ build. */
14107 if (RECORD_OR_UNION_TYPE_P (t
) && COMPLETE_TYPE_P (t
) && 0)
14108 verify_variant_match (TYPE_FINAL_P
);
14110 /* tree_type_common checks. */
14112 if (COMPLETE_TYPE_P (t
))
14114 verify_variant_match (TYPE_MODE
);
14115 if (TREE_CODE (TYPE_SIZE (t
)) != PLACEHOLDER_EXPR
14116 && TREE_CODE (TYPE_SIZE (tv
)) != PLACEHOLDER_EXPR
)
14117 verify_variant_match (TYPE_SIZE
);
14118 if (TREE_CODE (TYPE_SIZE_UNIT (t
)) != PLACEHOLDER_EXPR
14119 && TREE_CODE (TYPE_SIZE_UNIT (tv
)) != PLACEHOLDER_EXPR
14120 && TYPE_SIZE_UNIT (t
) != TYPE_SIZE_UNIT (tv
))
14122 gcc_assert (!operand_equal_p (TYPE_SIZE_UNIT (t
),
14123 TYPE_SIZE_UNIT (tv
), 0));
14124 error ("type variant has different %<TYPE_SIZE_UNIT%>");
14126 error ("type variant%'s %<TYPE_SIZE_UNIT%>");
14127 debug_tree (TYPE_SIZE_UNIT (tv
));
14128 error ("type%'s %<TYPE_SIZE_UNIT%>");
14129 debug_tree (TYPE_SIZE_UNIT (t
));
14132 verify_variant_match (TYPE_NEEDS_CONSTRUCTING
);
14134 verify_variant_match (TYPE_PRECISION
);
14135 if (RECORD_OR_UNION_TYPE_P (t
))
14136 verify_variant_match (TYPE_TRANSPARENT_AGGR
);
14137 else if (TREE_CODE (t
) == ARRAY_TYPE
)
14138 verify_variant_match (TYPE_NONALIASED_COMPONENT
);
14139 /* During LTO we merge variant lists from diferent translation units
14140 that may differ BY TYPE_CONTEXT that in turn may point
14141 to TRANSLATION_UNIT_DECL.
14142 Ada also builds variants of types with different TYPE_CONTEXT. */
14143 if ((!in_lto_p
|| !TYPE_FILE_SCOPE_P (t
)) && 0)
14144 verify_variant_match (TYPE_CONTEXT
);
14145 if (TREE_CODE (t
) == ARRAY_TYPE
|| TREE_CODE (t
) == INTEGER_TYPE
)
14146 verify_variant_match (TYPE_STRING_FLAG
);
14147 if (TREE_CODE (t
) == RECORD_TYPE
|| TREE_CODE (t
) == UNION_TYPE
)
14148 verify_variant_match (TYPE_CXX_ODR_P
);
14149 if (TYPE_ALIAS_SET_KNOWN_P (t
))
14151 error ("type variant with %<TYPE_ALIAS_SET_KNOWN_P%>");
14156 /* tree_type_non_common checks. */
14158 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
14159 and dangle the pointer from time to time. */
14160 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_VFIELD (t
) != TYPE_VFIELD (tv
)
14161 && (in_lto_p
|| !TYPE_VFIELD (tv
)
14162 || TREE_CODE (TYPE_VFIELD (tv
)) != TREE_LIST
))
14164 error ("type variant has different %<TYPE_VFIELD%>");
14168 if ((TREE_CODE (t
) == ENUMERAL_TYPE
&& COMPLETE_TYPE_P (t
))
14169 || TREE_CODE (t
) == INTEGER_TYPE
14170 || TREE_CODE (t
) == BOOLEAN_TYPE
14171 || TREE_CODE (t
) == REAL_TYPE
14172 || TREE_CODE (t
) == FIXED_POINT_TYPE
)
14174 verify_variant_match (TYPE_MAX_VALUE
);
14175 verify_variant_match (TYPE_MIN_VALUE
);
14177 if (TREE_CODE (t
) == METHOD_TYPE
)
14178 verify_variant_match (TYPE_METHOD_BASETYPE
);
14179 if (TREE_CODE (t
) == OFFSET_TYPE
)
14180 verify_variant_match (TYPE_OFFSET_BASETYPE
);
14181 if (TREE_CODE (t
) == ARRAY_TYPE
)
14182 verify_variant_match (TYPE_ARRAY_MAX_SIZE
);
14183 /* FIXME: Be lax and allow TYPE_BINFO to be missing in variant types
14184 or even type's main variant. This is needed to make bootstrap pass
14185 and the bug seems new in GCC 5.
14186 C++ FE should be updated to make this consistent and we should check
14187 that TYPE_BINFO is always NULL for !COMPLETE_TYPE_P and otherwise there
14188 is a match with main variant.
14190 Also disable the check for Java for now because of parser hack that builds
14191 first an dummy BINFO and then sometimes replace it by real BINFO in some
14193 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_BINFO (t
) && TYPE_BINFO (tv
)
14194 && TYPE_BINFO (t
) != TYPE_BINFO (tv
)
14195 /* FIXME: Java sometimes keep dump TYPE_BINFOs on variant types.
14196 Since there is no cheap way to tell C++/Java type w/o LTO, do checking
14197 at LTO time only. */
14198 && (in_lto_p
&& odr_type_p (t
)))
14200 error ("type variant has different %<TYPE_BINFO%>");
14202 error ("type variant%'s %<TYPE_BINFO%>");
14203 debug_tree (TYPE_BINFO (tv
));
14204 error ("type%'s %<TYPE_BINFO%>");
14205 debug_tree (TYPE_BINFO (t
));
14209 /* Check various uses of TYPE_VALUES_RAW. */
14210 if (TREE_CODE (t
) == ENUMERAL_TYPE
14211 && TYPE_VALUES (t
))
14212 verify_variant_match (TYPE_VALUES
);
14213 else if (TREE_CODE (t
) == ARRAY_TYPE
)
14214 verify_variant_match (TYPE_DOMAIN
);
14215 /* Permit incomplete variants of complete type. While FEs may complete
14216 all variants, this does not happen for C++ templates in all cases. */
14217 else if (RECORD_OR_UNION_TYPE_P (t
)
14218 && COMPLETE_TYPE_P (t
)
14219 && TYPE_FIELDS (t
) != TYPE_FIELDS (tv
))
14223 /* Fortran builds qualified variants as new records with items of
14224 qualified type. Verify that they looks same. */
14225 for (f1
= TYPE_FIELDS (t
), f2
= TYPE_FIELDS (tv
);
14227 f1
= TREE_CHAIN (f1
), f2
= TREE_CHAIN (f2
))
14228 if (TREE_CODE (f1
) != FIELD_DECL
|| TREE_CODE (f2
) != FIELD_DECL
14229 || (TYPE_MAIN_VARIANT (TREE_TYPE (f1
))
14230 != TYPE_MAIN_VARIANT (TREE_TYPE (f2
))
14231 /* FIXME: gfc_nonrestricted_type builds all types as variants
14232 with exception of pointer types. It deeply copies the type
14233 which means that we may end up with a variant type
14234 referring non-variant pointer. We may change it to
14235 produce types as variants, too, like
14236 objc_get_protocol_qualified_type does. */
14237 && !POINTER_TYPE_P (TREE_TYPE (f1
)))
14238 || DECL_FIELD_OFFSET (f1
) != DECL_FIELD_OFFSET (f2
)
14239 || DECL_FIELD_BIT_OFFSET (f1
) != DECL_FIELD_BIT_OFFSET (f2
))
14243 error ("type variant has different %<TYPE_FIELDS%>");
14245 error ("first mismatch is field");
14247 error ("and field");
14252 else if ((TREE_CODE (t
) == FUNCTION_TYPE
|| TREE_CODE (t
) == METHOD_TYPE
))
14253 verify_variant_match (TYPE_ARG_TYPES
);
14254 /* For C++ the qualified variant of array type is really an array type
14255 of qualified TREE_TYPE.
14256 objc builds variants of pointer where pointer to type is a variant, too
14257 in objc_get_protocol_qualified_type. */
14258 if (TREE_TYPE (t
) != TREE_TYPE (tv
)
14259 && ((TREE_CODE (t
) != ARRAY_TYPE
14260 && !POINTER_TYPE_P (t
))
14261 || TYPE_MAIN_VARIANT (TREE_TYPE (t
))
14262 != TYPE_MAIN_VARIANT (TREE_TYPE (tv
))))
14264 error ("type variant has different %<TREE_TYPE%>");
14266 error ("type variant%'s %<TREE_TYPE%>");
14267 debug_tree (TREE_TYPE (tv
));
14268 error ("type%'s %<TREE_TYPE%>");
14269 debug_tree (TREE_TYPE (t
));
14272 if (type_with_alias_set_p (t
)
14273 && !gimple_canonical_types_compatible_p (t
, tv
, false))
14275 error ("type is not compatible with its variant");
14277 error ("type variant%'s %<TREE_TYPE%>");
14278 debug_tree (TREE_TYPE (tv
));
14279 error ("type%'s %<TREE_TYPE%>");
14280 debug_tree (TREE_TYPE (t
));
14284 #undef verify_variant_match
14288 /* The TYPE_CANONICAL merging machinery. It should closely resemble
14289 the middle-end types_compatible_p function. It needs to avoid
14290 claiming types are different for types that should be treated
14291 the same with respect to TBAA. Canonical types are also used
14292 for IL consistency checks via the useless_type_conversion_p
14293 predicate which does not handle all type kinds itself but falls
14294 back to pointer-comparison of TYPE_CANONICAL for aggregates
14297 /* Return true if TYPE_UNSIGNED of TYPE should be ignored for canonical
14298 type calculation because we need to allow inter-operability between signed
14299 and unsigned variants. */
14302 type_with_interoperable_signedness (const_tree type
)
14304 /* Fortran standard require C_SIGNED_CHAR to be interoperable with both
14305 signed char and unsigned char. Similarly fortran FE builds
14306 C_SIZE_T as signed type, while C defines it unsigned. */
14308 return tree_code_for_canonical_type_merging (TREE_CODE (type
))
14310 && (TYPE_PRECISION (type
) == TYPE_PRECISION (signed_char_type_node
)
14311 || TYPE_PRECISION (type
) == TYPE_PRECISION (size_type_node
));
14314 /* Return true iff T1 and T2 are structurally identical for what
14316 This function is used both by lto.c canonical type merging and by the
14317 verifier. If TRUST_TYPE_CANONICAL we do not look into structure of types
14318 that have TYPE_CANONICAL defined and assume them equivalent. This is useful
14319 only for LTO because only in these cases TYPE_CANONICAL equivalence
14320 correspond to one defined by gimple_canonical_types_compatible_p. */
14323 gimple_canonical_types_compatible_p (const_tree t1
, const_tree t2
,
14324 bool trust_type_canonical
)
14326 /* Type variants should be same as the main variant. When not doing sanity
14327 checking to verify this fact, go to main variants and save some work. */
14328 if (trust_type_canonical
)
14330 t1
= TYPE_MAIN_VARIANT (t1
);
14331 t2
= TYPE_MAIN_VARIANT (t2
);
14334 /* Check first for the obvious case of pointer identity. */
14338 /* Check that we have two types to compare. */
14339 if (t1
== NULL_TREE
|| t2
== NULL_TREE
)
14342 /* We consider complete types always compatible with incomplete type.
14343 This does not make sense for canonical type calculation and thus we
14344 need to ensure that we are never called on it.
14346 FIXME: For more correctness the function probably should have three modes
14347 1) mode assuming that types are complete mathcing their structure
14348 2) mode allowing incomplete types but producing equivalence classes
14349 and thus ignoring all info from complete types
14350 3) mode allowing incomplete types to match complete but checking
14351 compatibility between complete types.
14353 1 and 2 can be used for canonical type calculation. 3 is the real
14354 definition of type compatibility that can be used i.e. for warnings during
14355 declaration merging. */
14357 gcc_assert (!trust_type_canonical
14358 || (type_with_alias_set_p (t1
) && type_with_alias_set_p (t2
)));
14360 /* If the types have been previously registered and found equal
14363 if (TYPE_CANONICAL (t1
) && TYPE_CANONICAL (t2
)
14364 && trust_type_canonical
)
14366 /* Do not use TYPE_CANONICAL of pointer types. For LTO streamed types
14367 they are always NULL, but they are set to non-NULL for types
14368 constructed by build_pointer_type and variants. In this case the
14369 TYPE_CANONICAL is more fine grained than the equivalnce we test (where
14370 all pointers are considered equal. Be sure to not return false
14372 gcc_checking_assert (canonical_type_used_p (t1
)
14373 && canonical_type_used_p (t2
));
14374 return TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
);
14377 /* For types where we do ODR based TBAA the canonical type is always
14378 set correctly, so we know that types are different if their
14379 canonical types does not match. */
14380 if (trust_type_canonical
14381 && (odr_type_p (t1
) && odr_based_tbaa_p (t1
))
14382 != (odr_type_p (t2
) && odr_based_tbaa_p (t2
)))
14385 /* Can't be the same type if the types don't have the same code. */
14386 enum tree_code code
= tree_code_for_canonical_type_merging (TREE_CODE (t1
));
14387 if (code
!= tree_code_for_canonical_type_merging (TREE_CODE (t2
)))
14390 /* Qualifiers do not matter for canonical type comparison purposes. */
14392 /* Void types and nullptr types are always the same. */
14393 if (TREE_CODE (t1
) == VOID_TYPE
14394 || TREE_CODE (t1
) == NULLPTR_TYPE
)
14397 /* Can't be the same type if they have different mode. */
14398 if (TYPE_MODE (t1
) != TYPE_MODE (t2
))
14401 /* Non-aggregate types can be handled cheaply. */
14402 if (INTEGRAL_TYPE_P (t1
)
14403 || SCALAR_FLOAT_TYPE_P (t1
)
14404 || FIXED_POINT_TYPE_P (t1
)
14405 || TREE_CODE (t1
) == VECTOR_TYPE
14406 || TREE_CODE (t1
) == COMPLEX_TYPE
14407 || TREE_CODE (t1
) == OFFSET_TYPE
14408 || POINTER_TYPE_P (t1
))
14410 /* Can't be the same type if they have different recision. */
14411 if (TYPE_PRECISION (t1
) != TYPE_PRECISION (t2
))
14414 /* In some cases the signed and unsigned types are required to be
14416 if (TYPE_UNSIGNED (t1
) != TYPE_UNSIGNED (t2
)
14417 && !type_with_interoperable_signedness (t1
))
14420 /* Fortran's C_SIGNED_CHAR is !TYPE_STRING_FLAG but needs to be
14421 interoperable with "signed char". Unless all frontends are revisited
14422 to agree on these types, we must ignore the flag completely. */
14424 /* Fortran standard define C_PTR type that is compatible with every
14425 C pointer. For this reason we need to glob all pointers into one.
14426 Still pointers in different address spaces are not compatible. */
14427 if (POINTER_TYPE_P (t1
))
14429 if (TYPE_ADDR_SPACE (TREE_TYPE (t1
))
14430 != TYPE_ADDR_SPACE (TREE_TYPE (t2
)))
14434 /* Tail-recurse to components. */
14435 if (TREE_CODE (t1
) == VECTOR_TYPE
14436 || TREE_CODE (t1
) == COMPLEX_TYPE
)
14437 return gimple_canonical_types_compatible_p (TREE_TYPE (t1
),
14439 trust_type_canonical
);
14444 /* Do type-specific comparisons. */
14445 switch (TREE_CODE (t1
))
14448 /* Array types are the same if the element types are the same and
14449 the number of elements are the same. */
14450 if (!gimple_canonical_types_compatible_p (TREE_TYPE (t1
), TREE_TYPE (t2
),
14451 trust_type_canonical
)
14452 || TYPE_STRING_FLAG (t1
) != TYPE_STRING_FLAG (t2
)
14453 || TYPE_REVERSE_STORAGE_ORDER (t1
) != TYPE_REVERSE_STORAGE_ORDER (t2
)
14454 || TYPE_NONALIASED_COMPONENT (t1
) != TYPE_NONALIASED_COMPONENT (t2
))
14458 tree i1
= TYPE_DOMAIN (t1
);
14459 tree i2
= TYPE_DOMAIN (t2
);
14461 /* For an incomplete external array, the type domain can be
14462 NULL_TREE. Check this condition also. */
14463 if (i1
== NULL_TREE
&& i2
== NULL_TREE
)
14465 else if (i1
== NULL_TREE
|| i2
== NULL_TREE
)
14469 tree min1
= TYPE_MIN_VALUE (i1
);
14470 tree min2
= TYPE_MIN_VALUE (i2
);
14471 tree max1
= TYPE_MAX_VALUE (i1
);
14472 tree max2
= TYPE_MAX_VALUE (i2
);
14474 /* The minimum/maximum values have to be the same. */
14477 && ((TREE_CODE (min1
) == PLACEHOLDER_EXPR
14478 && TREE_CODE (min2
) == PLACEHOLDER_EXPR
)
14479 || operand_equal_p (min1
, min2
, 0))))
14482 && ((TREE_CODE (max1
) == PLACEHOLDER_EXPR
14483 && TREE_CODE (max2
) == PLACEHOLDER_EXPR
)
14484 || operand_equal_p (max1
, max2
, 0)))))
14492 case FUNCTION_TYPE
:
14493 /* Function types are the same if the return type and arguments types
14495 if (!gimple_canonical_types_compatible_p (TREE_TYPE (t1
), TREE_TYPE (t2
),
14496 trust_type_canonical
))
14499 if (TYPE_ARG_TYPES (t1
) == TYPE_ARG_TYPES (t2
))
14503 tree parms1
, parms2
;
14505 for (parms1
= TYPE_ARG_TYPES (t1
), parms2
= TYPE_ARG_TYPES (t2
);
14507 parms1
= TREE_CHAIN (parms1
), parms2
= TREE_CHAIN (parms2
))
14509 if (!gimple_canonical_types_compatible_p
14510 (TREE_VALUE (parms1
), TREE_VALUE (parms2
),
14511 trust_type_canonical
))
14515 if (parms1
|| parms2
)
14523 case QUAL_UNION_TYPE
:
14527 /* Don't try to compare variants of an incomplete type, before
14528 TYPE_FIELDS has been copied around. */
14529 if (!COMPLETE_TYPE_P (t1
) && !COMPLETE_TYPE_P (t2
))
14533 if (TYPE_REVERSE_STORAGE_ORDER (t1
) != TYPE_REVERSE_STORAGE_ORDER (t2
))
14536 /* For aggregate types, all the fields must be the same. */
14537 for (f1
= TYPE_FIELDS (t1
), f2
= TYPE_FIELDS (t2
);
14539 f1
= TREE_CHAIN (f1
), f2
= TREE_CHAIN (f2
))
14541 /* Skip non-fields and zero-sized fields. */
14542 while (f1
&& (TREE_CODE (f1
) != FIELD_DECL
14544 && integer_zerop (DECL_SIZE (f1
)))))
14545 f1
= TREE_CHAIN (f1
);
14546 while (f2
&& (TREE_CODE (f2
) != FIELD_DECL
14548 && integer_zerop (DECL_SIZE (f2
)))))
14549 f2
= TREE_CHAIN (f2
);
14552 /* The fields must have the same name, offset and type. */
14553 if (DECL_NONADDRESSABLE_P (f1
) != DECL_NONADDRESSABLE_P (f2
)
14554 || !gimple_compare_field_offset (f1
, f2
)
14555 || !gimple_canonical_types_compatible_p
14556 (TREE_TYPE (f1
), TREE_TYPE (f2
),
14557 trust_type_canonical
))
14561 /* If one aggregate has more fields than the other, they
14562 are not the same. */
14570 /* Consider all types with language specific trees in them mutually
14571 compatible. This is executed only from verify_type and false
14572 positives can be tolerated. */
14573 gcc_assert (!in_lto_p
);
14578 /* Verify type T. */
14581 verify_type (const_tree t
)
14583 bool error_found
= false;
14584 tree mv
= TYPE_MAIN_VARIANT (t
);
14587 error ("main variant is not defined");
14588 error_found
= true;
14590 else if (mv
!= TYPE_MAIN_VARIANT (mv
))
14592 error ("%<TYPE_MAIN_VARIANT%> has different %<TYPE_MAIN_VARIANT%>");
14594 error_found
= true;
14596 else if (t
!= mv
&& !verify_type_variant (t
, mv
))
14597 error_found
= true;
14599 tree ct
= TYPE_CANONICAL (t
);
14602 else if (TYPE_CANONICAL (t
) != ct
)
14604 error ("%<TYPE_CANONICAL%> has different %<TYPE_CANONICAL%>");
14606 error_found
= true;
14608 /* Method and function types cannot be used to address memory and thus
14609 TYPE_CANONICAL really matters only for determining useless conversions.
14611 FIXME: C++ FE produce declarations of builtin functions that are not
14612 compatible with main variants. */
14613 else if (TREE_CODE (t
) == FUNCTION_TYPE
)
14616 /* FIXME: gimple_canonical_types_compatible_p cannot compare types
14617 with variably sized arrays because their sizes possibly
14618 gimplified to different variables. */
14619 && !variably_modified_type_p (ct
, NULL
)
14620 && !gimple_canonical_types_compatible_p (t
, ct
, false)
14621 && COMPLETE_TYPE_P (t
))
14623 error ("%<TYPE_CANONICAL%> is not compatible");
14625 error_found
= true;
14628 if (COMPLETE_TYPE_P (t
) && TYPE_CANONICAL (t
)
14629 && TYPE_MODE (t
) != TYPE_MODE (TYPE_CANONICAL (t
)))
14631 error ("%<TYPE_MODE%> of %<TYPE_CANONICAL%> is not compatible");
14633 error_found
= true;
14635 if (TYPE_MAIN_VARIANT (t
) == t
&& ct
&& TYPE_MAIN_VARIANT (ct
) != ct
)
14637 error ("%<TYPE_CANONICAL%> of main variant is not main variant");
14639 debug_tree (TYPE_MAIN_VARIANT (ct
));
14640 error_found
= true;
14644 /* Check various uses of TYPE_MIN_VALUE_RAW. */
14645 if (RECORD_OR_UNION_TYPE_P (t
))
14647 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
14648 and danagle the pointer from time to time. */
14649 if (TYPE_VFIELD (t
)
14650 && TREE_CODE (TYPE_VFIELD (t
)) != FIELD_DECL
14651 && TREE_CODE (TYPE_VFIELD (t
)) != TREE_LIST
)
14653 error ("%<TYPE_VFIELD%> is not %<FIELD_DECL%> nor %<TREE_LIST%>");
14654 debug_tree (TYPE_VFIELD (t
));
14655 error_found
= true;
14658 else if (TREE_CODE (t
) == POINTER_TYPE
)
14660 if (TYPE_NEXT_PTR_TO (t
)
14661 && TREE_CODE (TYPE_NEXT_PTR_TO (t
)) != POINTER_TYPE
)
14663 error ("%<TYPE_NEXT_PTR_TO%> is not %<POINTER_TYPE%>");
14664 debug_tree (TYPE_NEXT_PTR_TO (t
));
14665 error_found
= true;
14668 else if (TREE_CODE (t
) == REFERENCE_TYPE
)
14670 if (TYPE_NEXT_REF_TO (t
)
14671 && TREE_CODE (TYPE_NEXT_REF_TO (t
)) != REFERENCE_TYPE
)
14673 error ("%<TYPE_NEXT_REF_TO%> is not %<REFERENCE_TYPE%>");
14674 debug_tree (TYPE_NEXT_REF_TO (t
));
14675 error_found
= true;
14678 else if (INTEGRAL_TYPE_P (t
) || TREE_CODE (t
) == REAL_TYPE
14679 || TREE_CODE (t
) == FIXED_POINT_TYPE
)
14681 /* FIXME: The following check should pass:
14682 useless_type_conversion_p (const_cast <tree> (t),
14683 TREE_TYPE (TYPE_MIN_VALUE (t))
14684 but does not for C sizetypes in LTO. */
14687 /* Check various uses of TYPE_MAXVAL_RAW. */
14688 if (RECORD_OR_UNION_TYPE_P (t
))
14690 if (!TYPE_BINFO (t
))
14692 else if (TREE_CODE (TYPE_BINFO (t
)) != TREE_BINFO
)
14694 error ("%<TYPE_BINFO%> is not %<TREE_BINFO%>");
14695 debug_tree (TYPE_BINFO (t
));
14696 error_found
= true;
14698 else if (TREE_TYPE (TYPE_BINFO (t
)) != TYPE_MAIN_VARIANT (t
))
14700 error ("%<TYPE_BINFO%> type is not %<TYPE_MAIN_VARIANT%>");
14701 debug_tree (TREE_TYPE (TYPE_BINFO (t
)));
14702 error_found
= true;
14705 else if (TREE_CODE (t
) == FUNCTION_TYPE
|| TREE_CODE (t
) == METHOD_TYPE
)
14707 if (TYPE_METHOD_BASETYPE (t
)
14708 && TREE_CODE (TYPE_METHOD_BASETYPE (t
)) != RECORD_TYPE
14709 && TREE_CODE (TYPE_METHOD_BASETYPE (t
)) != UNION_TYPE
)
14711 error ("%<TYPE_METHOD_BASETYPE%> is not record nor union");
14712 debug_tree (TYPE_METHOD_BASETYPE (t
));
14713 error_found
= true;
14716 else if (TREE_CODE (t
) == OFFSET_TYPE
)
14718 if (TYPE_OFFSET_BASETYPE (t
)
14719 && TREE_CODE (TYPE_OFFSET_BASETYPE (t
)) != RECORD_TYPE
14720 && TREE_CODE (TYPE_OFFSET_BASETYPE (t
)) != UNION_TYPE
)
14722 error ("%<TYPE_OFFSET_BASETYPE%> is not record nor union");
14723 debug_tree (TYPE_OFFSET_BASETYPE (t
));
14724 error_found
= true;
14727 else if (INTEGRAL_TYPE_P (t
) || TREE_CODE (t
) == REAL_TYPE
14728 || TREE_CODE (t
) == FIXED_POINT_TYPE
)
14730 /* FIXME: The following check should pass:
14731 useless_type_conversion_p (const_cast <tree> (t),
14732 TREE_TYPE (TYPE_MAX_VALUE (t))
14733 but does not for C sizetypes in LTO. */
14735 else if (TREE_CODE (t
) == ARRAY_TYPE
)
14737 if (TYPE_ARRAY_MAX_SIZE (t
)
14738 && TREE_CODE (TYPE_ARRAY_MAX_SIZE (t
)) != INTEGER_CST
)
14740 error ("%<TYPE_ARRAY_MAX_SIZE%> not %<INTEGER_CST%>");
14741 debug_tree (TYPE_ARRAY_MAX_SIZE (t
));
14742 error_found
= true;
14745 else if (TYPE_MAX_VALUE_RAW (t
))
14747 error ("%<TYPE_MAX_VALUE_RAW%> non-NULL");
14748 debug_tree (TYPE_MAX_VALUE_RAW (t
));
14749 error_found
= true;
14752 if (TYPE_LANG_SLOT_1 (t
) && in_lto_p
)
14754 error ("%<TYPE_LANG_SLOT_1 (binfo)%> field is non-NULL");
14755 debug_tree (TYPE_LANG_SLOT_1 (t
));
14756 error_found
= true;
14759 /* Check various uses of TYPE_VALUES_RAW. */
14760 if (TREE_CODE (t
) == ENUMERAL_TYPE
)
14761 for (tree l
= TYPE_VALUES (t
); l
; l
= TREE_CHAIN (l
))
14763 tree value
= TREE_VALUE (l
);
14764 tree name
= TREE_PURPOSE (l
);
14766 /* C FE porduce INTEGER_CST of INTEGER_TYPE, while C++ FE uses
14767 CONST_DECL of ENUMERAL TYPE. */
14768 if (TREE_CODE (value
) != INTEGER_CST
&& TREE_CODE (value
) != CONST_DECL
)
14770 error ("enum value is not %<CONST_DECL%> or %<INTEGER_CST%>");
14771 debug_tree (value
);
14773 error_found
= true;
14775 if (TREE_CODE (TREE_TYPE (value
)) != INTEGER_TYPE
14776 && !useless_type_conversion_p (const_cast <tree
> (t
), TREE_TYPE (value
)))
14778 error ("enum value type is not %<INTEGER_TYPE%> nor convertible "
14780 debug_tree (value
);
14782 error_found
= true;
14784 if (TREE_CODE (name
) != IDENTIFIER_NODE
)
14786 error ("enum value name is not %<IDENTIFIER_NODE%>");
14787 debug_tree (value
);
14789 error_found
= true;
14792 else if (TREE_CODE (t
) == ARRAY_TYPE
)
14794 if (TYPE_DOMAIN (t
) && TREE_CODE (TYPE_DOMAIN (t
)) != INTEGER_TYPE
)
14796 error ("array %<TYPE_DOMAIN%> is not integer type");
14797 debug_tree (TYPE_DOMAIN (t
));
14798 error_found
= true;
14801 else if (RECORD_OR_UNION_TYPE_P (t
))
14803 if (TYPE_FIELDS (t
) && !COMPLETE_TYPE_P (t
) && in_lto_p
)
14805 error ("%<TYPE_FIELDS%> defined in incomplete type");
14806 error_found
= true;
14808 for (tree fld
= TYPE_FIELDS (t
); fld
; fld
= TREE_CHAIN (fld
))
14810 /* TODO: verify properties of decls. */
14811 if (TREE_CODE (fld
) == FIELD_DECL
)
14813 else if (TREE_CODE (fld
) == TYPE_DECL
)
14815 else if (TREE_CODE (fld
) == CONST_DECL
)
14817 else if (VAR_P (fld
))
14819 else if (TREE_CODE (fld
) == TEMPLATE_DECL
)
14821 else if (TREE_CODE (fld
) == USING_DECL
)
14823 else if (TREE_CODE (fld
) == FUNCTION_DECL
)
14827 error ("wrong tree in %<TYPE_FIELDS%> list");
14829 error_found
= true;
14833 else if (TREE_CODE (t
) == INTEGER_TYPE
14834 || TREE_CODE (t
) == BOOLEAN_TYPE
14835 || TREE_CODE (t
) == OFFSET_TYPE
14836 || TREE_CODE (t
) == REFERENCE_TYPE
14837 || TREE_CODE (t
) == NULLPTR_TYPE
14838 || TREE_CODE (t
) == POINTER_TYPE
)
14840 if (TYPE_CACHED_VALUES_P (t
) != (TYPE_CACHED_VALUES (t
) != NULL
))
14842 error ("%<TYPE_CACHED_VALUES_P%> is %i while %<TYPE_CACHED_VALUES%> "
14844 TYPE_CACHED_VALUES_P (t
), (void *)TYPE_CACHED_VALUES (t
));
14845 error_found
= true;
14847 else if (TYPE_CACHED_VALUES_P (t
) && TREE_CODE (TYPE_CACHED_VALUES (t
)) != TREE_VEC
)
14849 error ("%<TYPE_CACHED_VALUES%> is not %<TREE_VEC%>");
14850 debug_tree (TYPE_CACHED_VALUES (t
));
14851 error_found
= true;
14853 /* Verify just enough of cache to ensure that no one copied it to new type.
14854 All copying should go by copy_node that should clear it. */
14855 else if (TYPE_CACHED_VALUES_P (t
))
14858 for (i
= 0; i
< TREE_VEC_LENGTH (TYPE_CACHED_VALUES (t
)); i
++)
14859 if (TREE_VEC_ELT (TYPE_CACHED_VALUES (t
), i
)
14860 && TREE_TYPE (TREE_VEC_ELT (TYPE_CACHED_VALUES (t
), i
)) != t
)
14862 error ("wrong %<TYPE_CACHED_VALUES%> entry");
14863 debug_tree (TREE_VEC_ELT (TYPE_CACHED_VALUES (t
), i
));
14864 error_found
= true;
14869 else if (TREE_CODE (t
) == FUNCTION_TYPE
|| TREE_CODE (t
) == METHOD_TYPE
)
14870 for (tree l
= TYPE_ARG_TYPES (t
); l
; l
= TREE_CHAIN (l
))
14872 /* C++ FE uses TREE_PURPOSE to store initial values. */
14873 if (TREE_PURPOSE (l
) && in_lto_p
)
14875 error ("%<TREE_PURPOSE%> is non-NULL in %<TYPE_ARG_TYPES%> list");
14877 error_found
= true;
14879 if (!TYPE_P (TREE_VALUE (l
)))
14881 error ("wrong entry in %<TYPE_ARG_TYPES%> list");
14883 error_found
= true;
14886 else if (!is_lang_specific (t
) && TYPE_VALUES_RAW (t
))
14888 error ("%<TYPE_VALUES_RAW%> field is non-NULL");
14889 debug_tree (TYPE_VALUES_RAW (t
));
14890 error_found
= true;
14892 if (TREE_CODE (t
) != INTEGER_TYPE
14893 && TREE_CODE (t
) != BOOLEAN_TYPE
14894 && TREE_CODE (t
) != OFFSET_TYPE
14895 && TREE_CODE (t
) != REFERENCE_TYPE
14896 && TREE_CODE (t
) != NULLPTR_TYPE
14897 && TREE_CODE (t
) != POINTER_TYPE
14898 && TYPE_CACHED_VALUES_P (t
))
14900 error ("%<TYPE_CACHED_VALUES_P%> is set while it should not be");
14901 error_found
= true;
14904 /* ipa-devirt makes an assumption that TYPE_METHOD_BASETYPE is always
14905 TYPE_MAIN_VARIANT and it would be odd to add methods only to variatns
14907 if (TREE_CODE (t
) == METHOD_TYPE
14908 && TYPE_MAIN_VARIANT (TYPE_METHOD_BASETYPE (t
)) != TYPE_METHOD_BASETYPE (t
))
14910 error ("%<TYPE_METHOD_BASETYPE%> is not main variant");
14911 error_found
= true;
14916 debug_tree (const_cast <tree
> (t
));
14917 internal_error ("%qs failed", __func__
);
14922 /* Return 1 if ARG interpreted as signed in its precision is known to be
14923 always positive or 2 if ARG is known to be always negative, or 3 if
14924 ARG may be positive or negative. */
14927 get_range_pos_neg (tree arg
)
14929 if (arg
== error_mark_node
)
14932 int prec
= TYPE_PRECISION (TREE_TYPE (arg
));
14934 if (TREE_CODE (arg
) == INTEGER_CST
)
14936 wide_int w
= wi::sext (wi::to_wide (arg
), prec
);
14942 while (CONVERT_EXPR_P (arg
)
14943 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (arg
, 0)))
14944 && TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (arg
, 0))) <= prec
)
14946 arg
= TREE_OPERAND (arg
, 0);
14947 /* Narrower value zero extended into wider type
14948 will always result in positive values. */
14949 if (TYPE_UNSIGNED (TREE_TYPE (arg
))
14950 && TYPE_PRECISION (TREE_TYPE (arg
)) < prec
)
14952 prec
= TYPE_PRECISION (TREE_TYPE (arg
));
14957 if (TREE_CODE (arg
) != SSA_NAME
)
14959 wide_int arg_min
, arg_max
;
14960 while (get_range_info (arg
, &arg_min
, &arg_max
) != VR_RANGE
)
14962 gimple
*g
= SSA_NAME_DEF_STMT (arg
);
14963 if (is_gimple_assign (g
)
14964 && CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (g
)))
14966 tree t
= gimple_assign_rhs1 (g
);
14967 if (INTEGRAL_TYPE_P (TREE_TYPE (t
))
14968 && TYPE_PRECISION (TREE_TYPE (t
)) <= prec
)
14970 if (TYPE_UNSIGNED (TREE_TYPE (t
))
14971 && TYPE_PRECISION (TREE_TYPE (t
)) < prec
)
14973 prec
= TYPE_PRECISION (TREE_TYPE (t
));
14982 if (TYPE_UNSIGNED (TREE_TYPE (arg
)))
14984 /* For unsigned values, the "positive" range comes
14985 below the "negative" range. */
14986 if (!wi::neg_p (wi::sext (arg_max
, prec
), SIGNED
))
14988 if (wi::neg_p (wi::sext (arg_min
, prec
), SIGNED
))
14993 if (!wi::neg_p (wi::sext (arg_min
, prec
), SIGNED
))
14995 if (wi::neg_p (wi::sext (arg_max
, prec
), SIGNED
))
15004 /* Return true if ARG is marked with the nonnull attribute in the
15005 current function signature. */
15008 nonnull_arg_p (const_tree arg
)
15010 tree t
, attrs
, fntype
;
15011 unsigned HOST_WIDE_INT arg_num
;
15013 gcc_assert (TREE_CODE (arg
) == PARM_DECL
15014 && (POINTER_TYPE_P (TREE_TYPE (arg
))
15015 || TREE_CODE (TREE_TYPE (arg
)) == OFFSET_TYPE
));
15017 /* The static chain decl is always non null. */
15018 if (arg
== cfun
->static_chain_decl
)
15021 /* THIS argument of method is always non-NULL. */
15022 if (TREE_CODE (TREE_TYPE (cfun
->decl
)) == METHOD_TYPE
15023 && arg
== DECL_ARGUMENTS (cfun
->decl
)
15024 && flag_delete_null_pointer_checks
)
15027 /* Values passed by reference are always non-NULL. */
15028 if (TREE_CODE (TREE_TYPE (arg
)) == REFERENCE_TYPE
15029 && flag_delete_null_pointer_checks
)
15032 fntype
= TREE_TYPE (cfun
->decl
);
15033 for (attrs
= TYPE_ATTRIBUTES (fntype
); attrs
; attrs
= TREE_CHAIN (attrs
))
15035 attrs
= lookup_attribute ("nonnull", attrs
);
15037 /* If "nonnull" wasn't specified, we know nothing about the argument. */
15038 if (attrs
== NULL_TREE
)
15041 /* If "nonnull" applies to all the arguments, then ARG is non-null. */
15042 if (TREE_VALUE (attrs
) == NULL_TREE
)
15045 /* Get the position number for ARG in the function signature. */
15046 for (arg_num
= 1, t
= DECL_ARGUMENTS (cfun
->decl
);
15048 t
= DECL_CHAIN (t
), arg_num
++)
15054 gcc_assert (t
== arg
);
15056 /* Now see if ARG_NUM is mentioned in the nonnull list. */
15057 for (t
= TREE_VALUE (attrs
); t
; t
= TREE_CHAIN (t
))
15059 if (compare_tree_int (TREE_VALUE (t
), arg_num
) == 0)
15067 /* Combine LOC and BLOCK to a combined adhoc loc, retaining any range
15071 set_block (location_t loc
, tree block
)
15073 location_t pure_loc
= get_pure_location (loc
);
15074 source_range src_range
= get_range_from_loc (line_table
, loc
);
15075 return COMBINE_LOCATION_DATA (line_table
, pure_loc
, src_range
, block
);
15079 set_source_range (tree expr
, location_t start
, location_t finish
)
15081 source_range src_range
;
15082 src_range
.m_start
= start
;
15083 src_range
.m_finish
= finish
;
15084 return set_source_range (expr
, src_range
);
15088 set_source_range (tree expr
, source_range src_range
)
15090 if (!EXPR_P (expr
))
15091 return UNKNOWN_LOCATION
;
15093 location_t pure_loc
= get_pure_location (EXPR_LOCATION (expr
));
15094 location_t adhoc
= COMBINE_LOCATION_DATA (line_table
,
15098 SET_EXPR_LOCATION (expr
, adhoc
);
15102 /* Return EXPR, potentially wrapped with a node expression LOC,
15103 if !CAN_HAVE_LOCATION_P (expr).
15105 NON_LVALUE_EXPR is used for wrapping constants, apart from STRING_CST.
15106 VIEW_CONVERT_EXPR is used for wrapping non-constants and STRING_CST.
15108 Wrapper nodes can be identified using location_wrapper_p. */
15111 maybe_wrap_with_location (tree expr
, location_t loc
)
15115 if (loc
== UNKNOWN_LOCATION
)
15117 if (CAN_HAVE_LOCATION_P (expr
))
15119 /* We should only be adding wrappers for constants and for decls,
15120 or for some exceptional tree nodes (e.g. BASELINK in the C++ FE). */
15121 gcc_assert (CONSTANT_CLASS_P (expr
)
15123 || EXCEPTIONAL_CLASS_P (expr
));
15125 /* For now, don't add wrappers to exceptional tree nodes, to minimize
15126 any impact of the wrapper nodes. */
15127 if (EXCEPTIONAL_CLASS_P (expr
))
15130 /* Compiler-generated temporary variables don't need a wrapper. */
15131 if (DECL_P (expr
) && DECL_ARTIFICIAL (expr
) && DECL_IGNORED_P (expr
))
15134 /* If any auto_suppress_location_wrappers are active, don't create
15136 if (suppress_location_wrappers
> 0)
15140 = (((CONSTANT_CLASS_P (expr
) && TREE_CODE (expr
) != STRING_CST
)
15141 || (TREE_CODE (expr
) == CONST_DECL
&& !TREE_STATIC (expr
)))
15142 ? NON_LVALUE_EXPR
: VIEW_CONVERT_EXPR
);
15143 tree wrapper
= build1_loc (loc
, code
, TREE_TYPE (expr
), expr
);
15144 /* Mark this node as being a wrapper. */
15145 EXPR_LOCATION_WRAPPER_P (wrapper
) = 1;
15149 int suppress_location_wrappers
;
15151 /* Return the name of combined function FN, for debugging purposes. */
15154 combined_fn_name (combined_fn fn
)
15156 if (builtin_fn_p (fn
))
15158 tree fndecl
= builtin_decl_explicit (as_builtin_fn (fn
));
15159 return IDENTIFIER_POINTER (DECL_NAME (fndecl
));
15162 return internal_fn_name (as_internal_fn (fn
));
15165 /* Return a bitmap with a bit set corresponding to each argument in
15166 a function call type FNTYPE declared with attribute nonnull,
15167 or null if none of the function's argument are nonnull. The caller
15168 must free the bitmap. */
15171 get_nonnull_args (const_tree fntype
)
15173 if (fntype
== NULL_TREE
)
15176 bitmap argmap
= NULL
;
15177 if (TREE_CODE (fntype
) == METHOD_TYPE
)
15179 /* The this pointer in C++ non-static member functions is
15180 implicitly nonnull whether or not it's declared as such. */
15181 argmap
= BITMAP_ALLOC (NULL
);
15182 bitmap_set_bit (argmap
, 0);
15185 tree attrs
= TYPE_ATTRIBUTES (fntype
);
15189 /* A function declaration can specify multiple attribute nonnull,
15190 each with zero or more arguments. The loop below creates a bitmap
15191 representing a union of all the arguments. An empty (but non-null)
15192 bitmap means that all arguments have been declaraed nonnull. */
15193 for ( ; attrs
; attrs
= TREE_CHAIN (attrs
))
15195 attrs
= lookup_attribute ("nonnull", attrs
);
15200 argmap
= BITMAP_ALLOC (NULL
);
15202 if (!TREE_VALUE (attrs
))
15204 /* Clear the bitmap in case a previous attribute nonnull
15205 set it and this one overrides it for all arguments. */
15206 bitmap_clear (argmap
);
15210 /* Iterate over the indices of the format arguments declared nonnull
15211 and set a bit for each. */
15212 for (tree idx
= TREE_VALUE (attrs
); idx
; idx
= TREE_CHAIN (idx
))
15214 unsigned int val
= TREE_INT_CST_LOW (TREE_VALUE (idx
)) - 1;
15215 bitmap_set_bit (argmap
, val
);
15222 /* Returns true if TYPE is a type where it and all of its subobjects
15223 (recursively) are of structure, union, or array type. */
15226 is_empty_type (const_tree type
)
15228 if (RECORD_OR_UNION_TYPE_P (type
))
15230 for (tree field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
15231 if (TREE_CODE (field
) == FIELD_DECL
15232 && !DECL_PADDING_P (field
)
15233 && !is_empty_type (TREE_TYPE (field
)))
15237 else if (TREE_CODE (type
) == ARRAY_TYPE
)
15238 return (integer_minus_onep (array_type_nelts (type
))
15239 || TYPE_DOMAIN (type
) == NULL_TREE
15240 || is_empty_type (TREE_TYPE (type
)));
15244 /* Implement TARGET_EMPTY_RECORD_P. Return true if TYPE is an empty type
15245 that shouldn't be passed via stack. */
15248 default_is_empty_record (const_tree type
)
15250 if (!abi_version_at_least (12))
15253 if (type
== error_mark_node
)
15256 if (TREE_ADDRESSABLE (type
))
15259 return is_empty_type (TYPE_MAIN_VARIANT (type
));
15262 /* Determine whether TYPE is a structure with a flexible array member,
15263 or a union containing such a structure (possibly recursively). */
15266 flexible_array_type_p (const_tree type
)
15269 switch (TREE_CODE (type
))
15273 for (x
= TYPE_FIELDS (type
); x
!= NULL_TREE
; x
= DECL_CHAIN (x
))
15274 if (TREE_CODE (x
) == FIELD_DECL
)
15276 if (last
== NULL_TREE
)
15278 if (TREE_CODE (TREE_TYPE (last
)) == ARRAY_TYPE
15279 && TYPE_SIZE (TREE_TYPE (last
)) == NULL_TREE
15280 && TYPE_DOMAIN (TREE_TYPE (last
)) != NULL_TREE
15281 && TYPE_MAX_VALUE (TYPE_DOMAIN (TREE_TYPE (last
))) == NULL_TREE
)
15285 for (x
= TYPE_FIELDS (type
); x
!= NULL_TREE
; x
= DECL_CHAIN (x
))
15287 if (TREE_CODE (x
) == FIELD_DECL
15288 && flexible_array_type_p (TREE_TYPE (x
)))
15297 /* Like int_size_in_bytes, but handle empty records specially. */
15300 arg_int_size_in_bytes (const_tree type
)
15302 return TYPE_EMPTY_P (type
) ? 0 : int_size_in_bytes (type
);
15305 /* Like size_in_bytes, but handle empty records specially. */
15308 arg_size_in_bytes (const_tree type
)
15310 return TYPE_EMPTY_P (type
) ? size_zero_node
: size_in_bytes (type
);
15313 /* Return true if an expression with CODE has to have the same result type as
15314 its first operand. */
15317 expr_type_first_operand_type_p (tree_code code
)
15330 case TRUNC_DIV_EXPR
:
15331 case CEIL_DIV_EXPR
:
15332 case FLOOR_DIV_EXPR
:
15333 case ROUND_DIV_EXPR
:
15334 case TRUNC_MOD_EXPR
:
15335 case CEIL_MOD_EXPR
:
15336 case FLOOR_MOD_EXPR
:
15337 case ROUND_MOD_EXPR
:
15339 case EXACT_DIV_EXPR
:
15357 /* Return a typenode for the "standard" C type with a given name. */
15359 get_typenode_from_name (const char *name
)
15361 if (name
== NULL
|| *name
== '\0')
15364 if (strcmp (name
, "char") == 0)
15365 return char_type_node
;
15366 if (strcmp (name
, "unsigned char") == 0)
15367 return unsigned_char_type_node
;
15368 if (strcmp (name
, "signed char") == 0)
15369 return signed_char_type_node
;
15371 if (strcmp (name
, "short int") == 0)
15372 return short_integer_type_node
;
15373 if (strcmp (name
, "short unsigned int") == 0)
15374 return short_unsigned_type_node
;
15376 if (strcmp (name
, "int") == 0)
15377 return integer_type_node
;
15378 if (strcmp (name
, "unsigned int") == 0)
15379 return unsigned_type_node
;
15381 if (strcmp (name
, "long int") == 0)
15382 return long_integer_type_node
;
15383 if (strcmp (name
, "long unsigned int") == 0)
15384 return long_unsigned_type_node
;
15386 if (strcmp (name
, "long long int") == 0)
15387 return long_long_integer_type_node
;
15388 if (strcmp (name
, "long long unsigned int") == 0)
15389 return long_long_unsigned_type_node
;
15391 gcc_unreachable ();
15394 /* List of pointer types used to declare builtins before we have seen their
15397 Keep the size up to date in tree.h ! */
15398 const builtin_structptr_type builtin_structptr_types
[6] =
15400 { fileptr_type_node
, ptr_type_node
, "FILE" },
15401 { const_tm_ptr_type_node
, const_ptr_type_node
, "tm" },
15402 { fenv_t_ptr_type_node
, ptr_type_node
, "fenv_t" },
15403 { const_fenv_t_ptr_type_node
, const_ptr_type_node
, "fenv_t" },
15404 { fexcept_t_ptr_type_node
, ptr_type_node
, "fexcept_t" },
15405 { const_fexcept_t_ptr_type_node
, const_ptr_type_node
, "fexcept_t" }
15408 /* Return the maximum object size. */
15411 max_object_size (void)
15413 /* To do: Make this a configurable parameter. */
15414 return TYPE_MAX_VALUE (ptrdiff_type_node
);
15417 /* A wrapper around TARGET_VERIFY_TYPE_CONTEXT that makes the silent_p
15418 parameter default to false and that weeds out error_mark_node. */
15421 verify_type_context (location_t loc
, type_context_kind context
,
15422 const_tree type
, bool silent_p
)
15424 if (type
== error_mark_node
)
15427 gcc_assert (TYPE_P (type
));
15428 return (!targetm
.verify_type_context
15429 || targetm
.verify_type_context (loc
, context
, type
, silent_p
));
15432 /* Return that NEW_ASM and DELETE_ASM name a valid pair of new and
15433 delete operators. */
15436 valid_new_delete_pair_p (tree new_asm
, tree delete_asm
)
15438 const char *new_name
= IDENTIFIER_POINTER (new_asm
);
15439 const char *delete_name
= IDENTIFIER_POINTER (delete_asm
);
15440 unsigned int new_len
= IDENTIFIER_LENGTH (new_asm
);
15441 unsigned int delete_len
= IDENTIFIER_LENGTH (delete_asm
);
15443 if (new_len
< 5 || delete_len
< 6)
15445 if (new_name
[0] == '_')
15446 ++new_name
, --new_len
;
15447 if (new_name
[0] == '_')
15448 ++new_name
, --new_len
;
15449 if (delete_name
[0] == '_')
15450 ++delete_name
, --delete_len
;
15451 if (delete_name
[0] == '_')
15452 ++delete_name
, --delete_len
;
15453 if (new_len
< 4 || delete_len
< 5)
15455 /* *_len is now just the length after initial underscores. */
15456 if (new_name
[0] != 'Z' || new_name
[1] != 'n')
15458 if (delete_name
[0] != 'Z' || delete_name
[1] != 'd')
15460 /* _Znw must match _Zdl, _Zna must match _Zda. */
15461 if ((new_name
[2] != 'w' || delete_name
[2] != 'l')
15462 && (new_name
[2] != 'a' || delete_name
[2] != 'a'))
15464 /* 'j', 'm' and 'y' correspond to size_t. */
15465 if (new_name
[3] != 'j' && new_name
[3] != 'm' && new_name
[3] != 'y')
15467 if (delete_name
[3] != 'P' || delete_name
[4] != 'v')
15470 || (new_len
== 18 && !memcmp (new_name
+ 4, "RKSt9nothrow_t", 14)))
15472 /* _ZnXY or _ZnXYRKSt9nothrow_t matches
15473 _ZdXPv, _ZdXPvY and _ZdXPvRKSt9nothrow_t. */
15474 if (delete_len
== 5)
15476 if (delete_len
== 6 && delete_name
[5] == new_name
[3])
15478 if (delete_len
== 19 && !memcmp (delete_name
+ 5, "RKSt9nothrow_t", 14))
15481 else if ((new_len
== 19 && !memcmp (new_name
+ 4, "St11align_val_t", 15))
15483 && !memcmp (new_name
+ 4, "St11align_val_tRKSt9nothrow_t", 29)))
15485 /* _ZnXYSt11align_val_t or _ZnXYSt11align_val_tRKSt9nothrow_t matches
15486 _ZdXPvSt11align_val_t or _ZdXPvYSt11align_val_t or or
15487 _ZdXPvSt11align_val_tRKSt9nothrow_t. */
15488 if (delete_len
== 20 && !memcmp (delete_name
+ 5, "St11align_val_t", 15))
15490 if (delete_len
== 21
15491 && delete_name
[5] == new_name
[3]
15492 && !memcmp (delete_name
+ 6, "St11align_val_t", 15))
15494 if (delete_len
== 34
15495 && !memcmp (delete_name
+ 5, "St11align_val_tRKSt9nothrow_t", 29))
15503 namespace selftest
{
15505 /* Selftests for tree. */
15507 /* Verify that integer constants are sane. */
15510 test_integer_constants ()
15512 ASSERT_TRUE (integer_type_node
!= NULL
);
15513 ASSERT_TRUE (build_int_cst (integer_type_node
, 0) != NULL
);
15515 tree type
= integer_type_node
;
15517 tree zero
= build_zero_cst (type
);
15518 ASSERT_EQ (INTEGER_CST
, TREE_CODE (zero
));
15519 ASSERT_EQ (type
, TREE_TYPE (zero
));
15521 tree one
= build_int_cst (type
, 1);
15522 ASSERT_EQ (INTEGER_CST
, TREE_CODE (one
));
15523 ASSERT_EQ (type
, TREE_TYPE (zero
));
15526 /* Verify identifiers. */
15529 test_identifiers ()
15531 tree identifier
= get_identifier ("foo");
15532 ASSERT_EQ (3, IDENTIFIER_LENGTH (identifier
));
15533 ASSERT_STREQ ("foo", IDENTIFIER_POINTER (identifier
));
15536 /* Verify LABEL_DECL. */
15541 tree identifier
= get_identifier ("err");
15542 tree label_decl
= build_decl (UNKNOWN_LOCATION
, LABEL_DECL
,
15543 identifier
, void_type_node
);
15544 ASSERT_EQ (-1, LABEL_DECL_UID (label_decl
));
15545 ASSERT_FALSE (FORCED_LABEL (label_decl
));
15548 /* Return a new VECTOR_CST node whose type is TYPE and whose values
15549 are given by VALS. */
15552 build_vector (tree type
, vec
<tree
> vals MEM_STAT_DECL
)
15554 gcc_assert (known_eq (vals
.length (), TYPE_VECTOR_SUBPARTS (type
)));
15555 tree_vector_builder
builder (type
, vals
.length (), 1);
15556 builder
.splice (vals
);
15557 return builder
.build ();
15560 /* Check that VECTOR_CST ACTUAL contains the elements in EXPECTED. */
15563 check_vector_cst (vec
<tree
> expected
, tree actual
)
15565 ASSERT_KNOWN_EQ (expected
.length (),
15566 TYPE_VECTOR_SUBPARTS (TREE_TYPE (actual
)));
15567 for (unsigned int i
= 0; i
< expected
.length (); ++i
)
15568 ASSERT_EQ (wi::to_wide (expected
[i
]),
15569 wi::to_wide (vector_cst_elt (actual
, i
)));
15572 /* Check that VECTOR_CST ACTUAL contains NPATTERNS duplicated elements,
15573 and that its elements match EXPECTED. */
15576 check_vector_cst_duplicate (vec
<tree
> expected
, tree actual
,
15577 unsigned int npatterns
)
15579 ASSERT_EQ (npatterns
, VECTOR_CST_NPATTERNS (actual
));
15580 ASSERT_EQ (1, VECTOR_CST_NELTS_PER_PATTERN (actual
));
15581 ASSERT_EQ (npatterns
, vector_cst_encoded_nelts (actual
));
15582 ASSERT_TRUE (VECTOR_CST_DUPLICATE_P (actual
));
15583 ASSERT_FALSE (VECTOR_CST_STEPPED_P (actual
));
15584 check_vector_cst (expected
, actual
);
15587 /* Check that VECTOR_CST ACTUAL contains NPATTERNS foreground elements
15588 and NPATTERNS background elements, and that its elements match
15592 check_vector_cst_fill (vec
<tree
> expected
, tree actual
,
15593 unsigned int npatterns
)
15595 ASSERT_EQ (npatterns
, VECTOR_CST_NPATTERNS (actual
));
15596 ASSERT_EQ (2, VECTOR_CST_NELTS_PER_PATTERN (actual
));
15597 ASSERT_EQ (2 * npatterns
, vector_cst_encoded_nelts (actual
));
15598 ASSERT_FALSE (VECTOR_CST_DUPLICATE_P (actual
));
15599 ASSERT_FALSE (VECTOR_CST_STEPPED_P (actual
));
15600 check_vector_cst (expected
, actual
);
15603 /* Check that VECTOR_CST ACTUAL contains NPATTERNS stepped patterns,
15604 and that its elements match EXPECTED. */
15607 check_vector_cst_stepped (vec
<tree
> expected
, tree actual
,
15608 unsigned int npatterns
)
15610 ASSERT_EQ (npatterns
, VECTOR_CST_NPATTERNS (actual
));
15611 ASSERT_EQ (3, VECTOR_CST_NELTS_PER_PATTERN (actual
));
15612 ASSERT_EQ (3 * npatterns
, vector_cst_encoded_nelts (actual
));
15613 ASSERT_FALSE (VECTOR_CST_DUPLICATE_P (actual
));
15614 ASSERT_TRUE (VECTOR_CST_STEPPED_P (actual
));
15615 check_vector_cst (expected
, actual
);
15618 /* Test the creation of VECTOR_CSTs. */
15621 test_vector_cst_patterns (ALONE_CXX_MEM_STAT_INFO
)
15623 auto_vec
<tree
, 8> elements (8);
15624 elements
.quick_grow (8);
15625 tree element_type
= build_nonstandard_integer_type (16, true);
15626 tree vector_type
= build_vector_type (element_type
, 8);
15628 /* Test a simple linear series with a base of 0 and a step of 1:
15629 { 0, 1, 2, 3, 4, 5, 6, 7 }. */
15630 for (unsigned int i
= 0; i
< 8; ++i
)
15631 elements
[i
] = build_int_cst (element_type
, i
);
15632 tree vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
15633 check_vector_cst_stepped (elements
, vector
, 1);
15635 /* Try the same with the first element replaced by 100:
15636 { 100, 1, 2, 3, 4, 5, 6, 7 }. */
15637 elements
[0] = build_int_cst (element_type
, 100);
15638 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
15639 check_vector_cst_stepped (elements
, vector
, 1);
15641 /* Try a series that wraps around.
15642 { 100, 65531, 65532, 65533, 65534, 65535, 0, 1 }. */
15643 for (unsigned int i
= 1; i
< 8; ++i
)
15644 elements
[i
] = build_int_cst (element_type
, (65530 + i
) & 0xffff);
15645 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
15646 check_vector_cst_stepped (elements
, vector
, 1);
15648 /* Try a downward series:
15649 { 100, 79, 78, 77, 76, 75, 75, 73 }. */
15650 for (unsigned int i
= 1; i
< 8; ++i
)
15651 elements
[i
] = build_int_cst (element_type
, 80 - i
);
15652 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
15653 check_vector_cst_stepped (elements
, vector
, 1);
15655 /* Try two interleaved series with different bases and steps:
15656 { 100, 53, 66, 206, 62, 212, 58, 218 }. */
15657 elements
[1] = build_int_cst (element_type
, 53);
15658 for (unsigned int i
= 2; i
< 8; i
+= 2)
15660 elements
[i
] = build_int_cst (element_type
, 70 - i
* 2);
15661 elements
[i
+ 1] = build_int_cst (element_type
, 200 + i
* 3);
15663 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
15664 check_vector_cst_stepped (elements
, vector
, 2);
15666 /* Try a duplicated value:
15667 { 100, 100, 100, 100, 100, 100, 100, 100 }. */
15668 for (unsigned int i
= 1; i
< 8; ++i
)
15669 elements
[i
] = elements
[0];
15670 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
15671 check_vector_cst_duplicate (elements
, vector
, 1);
15673 /* Try an interleaved duplicated value:
15674 { 100, 55, 100, 55, 100, 55, 100, 55 }. */
15675 elements
[1] = build_int_cst (element_type
, 55);
15676 for (unsigned int i
= 2; i
< 8; ++i
)
15677 elements
[i
] = elements
[i
- 2];
15678 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
15679 check_vector_cst_duplicate (elements
, vector
, 2);
15681 /* Try a duplicated value with 2 exceptions
15682 { 41, 97, 100, 55, 100, 55, 100, 55 }. */
15683 elements
[0] = build_int_cst (element_type
, 41);
15684 elements
[1] = build_int_cst (element_type
, 97);
15685 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
15686 check_vector_cst_fill (elements
, vector
, 2);
15688 /* Try with and without a step
15689 { 41, 97, 100, 21, 100, 35, 100, 49 }. */
15690 for (unsigned int i
= 3; i
< 8; i
+= 2)
15691 elements
[i
] = build_int_cst (element_type
, i
* 7);
15692 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
15693 check_vector_cst_stepped (elements
, vector
, 2);
15695 /* Try a fully-general constant:
15696 { 41, 97, 100, 21, 100, 9990, 100, 49 }. */
15697 elements
[5] = build_int_cst (element_type
, 9990);
15698 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
15699 check_vector_cst_fill (elements
, vector
, 4);
15702 /* Verify that STRIP_NOPS (NODE) is EXPECTED.
15703 Helper function for test_location_wrappers, to deal with STRIP_NOPS
15704 modifying its argument in-place. */
15707 check_strip_nops (tree node
, tree expected
)
15710 ASSERT_EQ (expected
, node
);
15713 /* Verify location wrappers. */
15716 test_location_wrappers ()
15718 location_t loc
= BUILTINS_LOCATION
;
15720 ASSERT_EQ (NULL_TREE
, maybe_wrap_with_location (NULL_TREE
, loc
));
15722 /* Wrapping a constant. */
15723 tree int_cst
= build_int_cst (integer_type_node
, 42);
15724 ASSERT_FALSE (CAN_HAVE_LOCATION_P (int_cst
));
15725 ASSERT_FALSE (location_wrapper_p (int_cst
));
15727 tree wrapped_int_cst
= maybe_wrap_with_location (int_cst
, loc
);
15728 ASSERT_TRUE (location_wrapper_p (wrapped_int_cst
));
15729 ASSERT_EQ (loc
, EXPR_LOCATION (wrapped_int_cst
));
15730 ASSERT_EQ (int_cst
, tree_strip_any_location_wrapper (wrapped_int_cst
));
15732 /* We shouldn't add wrapper nodes for UNKNOWN_LOCATION. */
15733 ASSERT_EQ (int_cst
, maybe_wrap_with_location (int_cst
, UNKNOWN_LOCATION
));
15735 /* We shouldn't add wrapper nodes for nodes that CAN_HAVE_LOCATION_P. */
15736 tree cast
= build1 (NOP_EXPR
, char_type_node
, int_cst
);
15737 ASSERT_TRUE (CAN_HAVE_LOCATION_P (cast
));
15738 ASSERT_EQ (cast
, maybe_wrap_with_location (cast
, loc
));
15740 /* Wrapping a STRING_CST. */
15741 tree string_cst
= build_string (4, "foo");
15742 ASSERT_FALSE (CAN_HAVE_LOCATION_P (string_cst
));
15743 ASSERT_FALSE (location_wrapper_p (string_cst
));
15745 tree wrapped_string_cst
= maybe_wrap_with_location (string_cst
, loc
);
15746 ASSERT_TRUE (location_wrapper_p (wrapped_string_cst
));
15747 ASSERT_EQ (VIEW_CONVERT_EXPR
, TREE_CODE (wrapped_string_cst
));
15748 ASSERT_EQ (loc
, EXPR_LOCATION (wrapped_string_cst
));
15749 ASSERT_EQ (string_cst
, tree_strip_any_location_wrapper (wrapped_string_cst
));
15752 /* Wrapping a variable. */
15753 tree int_var
= build_decl (UNKNOWN_LOCATION
, VAR_DECL
,
15754 get_identifier ("some_int_var"),
15755 integer_type_node
);
15756 ASSERT_FALSE (CAN_HAVE_LOCATION_P (int_var
));
15757 ASSERT_FALSE (location_wrapper_p (int_var
));
15759 tree wrapped_int_var
= maybe_wrap_with_location (int_var
, loc
);
15760 ASSERT_TRUE (location_wrapper_p (wrapped_int_var
));
15761 ASSERT_EQ (loc
, EXPR_LOCATION (wrapped_int_var
));
15762 ASSERT_EQ (int_var
, tree_strip_any_location_wrapper (wrapped_int_var
));
15764 /* Verify that "reinterpret_cast<int>(some_int_var)" is not a location
15766 tree r_cast
= build1 (NON_LVALUE_EXPR
, integer_type_node
, int_var
);
15767 ASSERT_FALSE (location_wrapper_p (r_cast
));
15768 ASSERT_EQ (r_cast
, tree_strip_any_location_wrapper (r_cast
));
15770 /* Verify that STRIP_NOPS removes wrappers. */
15771 check_strip_nops (wrapped_int_cst
, int_cst
);
15772 check_strip_nops (wrapped_string_cst
, string_cst
);
15773 check_strip_nops (wrapped_int_var
, int_var
);
15776 /* Test various tree predicates. Verify that location wrappers don't
15777 affect the results. */
15782 /* Build various constants and wrappers around them. */
15784 location_t loc
= BUILTINS_LOCATION
;
15786 tree i_0
= build_int_cst (integer_type_node
, 0);
15787 tree wr_i_0
= maybe_wrap_with_location (i_0
, loc
);
15789 tree i_1
= build_int_cst (integer_type_node
, 1);
15790 tree wr_i_1
= maybe_wrap_with_location (i_1
, loc
);
15792 tree i_m1
= build_int_cst (integer_type_node
, -1);
15793 tree wr_i_m1
= maybe_wrap_with_location (i_m1
, loc
);
15795 tree f_0
= build_real_from_int_cst (float_type_node
, i_0
);
15796 tree wr_f_0
= maybe_wrap_with_location (f_0
, loc
);
15797 tree f_1
= build_real_from_int_cst (float_type_node
, i_1
);
15798 tree wr_f_1
= maybe_wrap_with_location (f_1
, loc
);
15799 tree f_m1
= build_real_from_int_cst (float_type_node
, i_m1
);
15800 tree wr_f_m1
= maybe_wrap_with_location (f_m1
, loc
);
15802 tree c_i_0
= build_complex (NULL_TREE
, i_0
, i_0
);
15803 tree c_i_1
= build_complex (NULL_TREE
, i_1
, i_0
);
15804 tree c_i_m1
= build_complex (NULL_TREE
, i_m1
, i_0
);
15806 tree c_f_0
= build_complex (NULL_TREE
, f_0
, f_0
);
15807 tree c_f_1
= build_complex (NULL_TREE
, f_1
, f_0
);
15808 tree c_f_m1
= build_complex (NULL_TREE
, f_m1
, f_0
);
15810 /* TODO: vector constants. */
15812 /* Test integer_onep. */
15813 ASSERT_FALSE (integer_onep (i_0
));
15814 ASSERT_FALSE (integer_onep (wr_i_0
));
15815 ASSERT_TRUE (integer_onep (i_1
));
15816 ASSERT_TRUE (integer_onep (wr_i_1
));
15817 ASSERT_FALSE (integer_onep (i_m1
));
15818 ASSERT_FALSE (integer_onep (wr_i_m1
));
15819 ASSERT_FALSE (integer_onep (f_0
));
15820 ASSERT_FALSE (integer_onep (wr_f_0
));
15821 ASSERT_FALSE (integer_onep (f_1
));
15822 ASSERT_FALSE (integer_onep (wr_f_1
));
15823 ASSERT_FALSE (integer_onep (f_m1
));
15824 ASSERT_FALSE (integer_onep (wr_f_m1
));
15825 ASSERT_FALSE (integer_onep (c_i_0
));
15826 ASSERT_TRUE (integer_onep (c_i_1
));
15827 ASSERT_FALSE (integer_onep (c_i_m1
));
15828 ASSERT_FALSE (integer_onep (c_f_0
));
15829 ASSERT_FALSE (integer_onep (c_f_1
));
15830 ASSERT_FALSE (integer_onep (c_f_m1
));
15832 /* Test integer_zerop. */
15833 ASSERT_TRUE (integer_zerop (i_0
));
15834 ASSERT_TRUE (integer_zerop (wr_i_0
));
15835 ASSERT_FALSE (integer_zerop (i_1
));
15836 ASSERT_FALSE (integer_zerop (wr_i_1
));
15837 ASSERT_FALSE (integer_zerop (i_m1
));
15838 ASSERT_FALSE (integer_zerop (wr_i_m1
));
15839 ASSERT_FALSE (integer_zerop (f_0
));
15840 ASSERT_FALSE (integer_zerop (wr_f_0
));
15841 ASSERT_FALSE (integer_zerop (f_1
));
15842 ASSERT_FALSE (integer_zerop (wr_f_1
));
15843 ASSERT_FALSE (integer_zerop (f_m1
));
15844 ASSERT_FALSE (integer_zerop (wr_f_m1
));
15845 ASSERT_TRUE (integer_zerop (c_i_0
));
15846 ASSERT_FALSE (integer_zerop (c_i_1
));
15847 ASSERT_FALSE (integer_zerop (c_i_m1
));
15848 ASSERT_FALSE (integer_zerop (c_f_0
));
15849 ASSERT_FALSE (integer_zerop (c_f_1
));
15850 ASSERT_FALSE (integer_zerop (c_f_m1
));
15852 /* Test integer_all_onesp. */
15853 ASSERT_FALSE (integer_all_onesp (i_0
));
15854 ASSERT_FALSE (integer_all_onesp (wr_i_0
));
15855 ASSERT_FALSE (integer_all_onesp (i_1
));
15856 ASSERT_FALSE (integer_all_onesp (wr_i_1
));
15857 ASSERT_TRUE (integer_all_onesp (i_m1
));
15858 ASSERT_TRUE (integer_all_onesp (wr_i_m1
));
15859 ASSERT_FALSE (integer_all_onesp (f_0
));
15860 ASSERT_FALSE (integer_all_onesp (wr_f_0
));
15861 ASSERT_FALSE (integer_all_onesp (f_1
));
15862 ASSERT_FALSE (integer_all_onesp (wr_f_1
));
15863 ASSERT_FALSE (integer_all_onesp (f_m1
));
15864 ASSERT_FALSE (integer_all_onesp (wr_f_m1
));
15865 ASSERT_FALSE (integer_all_onesp (c_i_0
));
15866 ASSERT_FALSE (integer_all_onesp (c_i_1
));
15867 ASSERT_FALSE (integer_all_onesp (c_i_m1
));
15868 ASSERT_FALSE (integer_all_onesp (c_f_0
));
15869 ASSERT_FALSE (integer_all_onesp (c_f_1
));
15870 ASSERT_FALSE (integer_all_onesp (c_f_m1
));
15872 /* Test integer_minus_onep. */
15873 ASSERT_FALSE (integer_minus_onep (i_0
));
15874 ASSERT_FALSE (integer_minus_onep (wr_i_0
));
15875 ASSERT_FALSE (integer_minus_onep (i_1
));
15876 ASSERT_FALSE (integer_minus_onep (wr_i_1
));
15877 ASSERT_TRUE (integer_minus_onep (i_m1
));
15878 ASSERT_TRUE (integer_minus_onep (wr_i_m1
));
15879 ASSERT_FALSE (integer_minus_onep (f_0
));
15880 ASSERT_FALSE (integer_minus_onep (wr_f_0
));
15881 ASSERT_FALSE (integer_minus_onep (f_1
));
15882 ASSERT_FALSE (integer_minus_onep (wr_f_1
));
15883 ASSERT_FALSE (integer_minus_onep (f_m1
));
15884 ASSERT_FALSE (integer_minus_onep (wr_f_m1
));
15885 ASSERT_FALSE (integer_minus_onep (c_i_0
));
15886 ASSERT_FALSE (integer_minus_onep (c_i_1
));
15887 ASSERT_TRUE (integer_minus_onep (c_i_m1
));
15888 ASSERT_FALSE (integer_minus_onep (c_f_0
));
15889 ASSERT_FALSE (integer_minus_onep (c_f_1
));
15890 ASSERT_FALSE (integer_minus_onep (c_f_m1
));
15892 /* Test integer_each_onep. */
15893 ASSERT_FALSE (integer_each_onep (i_0
));
15894 ASSERT_FALSE (integer_each_onep (wr_i_0
));
15895 ASSERT_TRUE (integer_each_onep (i_1
));
15896 ASSERT_TRUE (integer_each_onep (wr_i_1
));
15897 ASSERT_FALSE (integer_each_onep (i_m1
));
15898 ASSERT_FALSE (integer_each_onep (wr_i_m1
));
15899 ASSERT_FALSE (integer_each_onep (f_0
));
15900 ASSERT_FALSE (integer_each_onep (wr_f_0
));
15901 ASSERT_FALSE (integer_each_onep (f_1
));
15902 ASSERT_FALSE (integer_each_onep (wr_f_1
));
15903 ASSERT_FALSE (integer_each_onep (f_m1
));
15904 ASSERT_FALSE (integer_each_onep (wr_f_m1
));
15905 ASSERT_FALSE (integer_each_onep (c_i_0
));
15906 ASSERT_FALSE (integer_each_onep (c_i_1
));
15907 ASSERT_FALSE (integer_each_onep (c_i_m1
));
15908 ASSERT_FALSE (integer_each_onep (c_f_0
));
15909 ASSERT_FALSE (integer_each_onep (c_f_1
));
15910 ASSERT_FALSE (integer_each_onep (c_f_m1
));
15912 /* Test integer_truep. */
15913 ASSERT_FALSE (integer_truep (i_0
));
15914 ASSERT_FALSE (integer_truep (wr_i_0
));
15915 ASSERT_TRUE (integer_truep (i_1
));
15916 ASSERT_TRUE (integer_truep (wr_i_1
));
15917 ASSERT_FALSE (integer_truep (i_m1
));
15918 ASSERT_FALSE (integer_truep (wr_i_m1
));
15919 ASSERT_FALSE (integer_truep (f_0
));
15920 ASSERT_FALSE (integer_truep (wr_f_0
));
15921 ASSERT_FALSE (integer_truep (f_1
));
15922 ASSERT_FALSE (integer_truep (wr_f_1
));
15923 ASSERT_FALSE (integer_truep (f_m1
));
15924 ASSERT_FALSE (integer_truep (wr_f_m1
));
15925 ASSERT_FALSE (integer_truep (c_i_0
));
15926 ASSERT_TRUE (integer_truep (c_i_1
));
15927 ASSERT_FALSE (integer_truep (c_i_m1
));
15928 ASSERT_FALSE (integer_truep (c_f_0
));
15929 ASSERT_FALSE (integer_truep (c_f_1
));
15930 ASSERT_FALSE (integer_truep (c_f_m1
));
15932 /* Test integer_nonzerop. */
15933 ASSERT_FALSE (integer_nonzerop (i_0
));
15934 ASSERT_FALSE (integer_nonzerop (wr_i_0
));
15935 ASSERT_TRUE (integer_nonzerop (i_1
));
15936 ASSERT_TRUE (integer_nonzerop (wr_i_1
));
15937 ASSERT_TRUE (integer_nonzerop (i_m1
));
15938 ASSERT_TRUE (integer_nonzerop (wr_i_m1
));
15939 ASSERT_FALSE (integer_nonzerop (f_0
));
15940 ASSERT_FALSE (integer_nonzerop (wr_f_0
));
15941 ASSERT_FALSE (integer_nonzerop (f_1
));
15942 ASSERT_FALSE (integer_nonzerop (wr_f_1
));
15943 ASSERT_FALSE (integer_nonzerop (f_m1
));
15944 ASSERT_FALSE (integer_nonzerop (wr_f_m1
));
15945 ASSERT_FALSE (integer_nonzerop (c_i_0
));
15946 ASSERT_TRUE (integer_nonzerop (c_i_1
));
15947 ASSERT_TRUE (integer_nonzerop (c_i_m1
));
15948 ASSERT_FALSE (integer_nonzerop (c_f_0
));
15949 ASSERT_FALSE (integer_nonzerop (c_f_1
));
15950 ASSERT_FALSE (integer_nonzerop (c_f_m1
));
15952 /* Test real_zerop. */
15953 ASSERT_FALSE (real_zerop (i_0
));
15954 ASSERT_FALSE (real_zerop (wr_i_0
));
15955 ASSERT_FALSE (real_zerop (i_1
));
15956 ASSERT_FALSE (real_zerop (wr_i_1
));
15957 ASSERT_FALSE (real_zerop (i_m1
));
15958 ASSERT_FALSE (real_zerop (wr_i_m1
));
15959 ASSERT_TRUE (real_zerop (f_0
));
15960 ASSERT_TRUE (real_zerop (wr_f_0
));
15961 ASSERT_FALSE (real_zerop (f_1
));
15962 ASSERT_FALSE (real_zerop (wr_f_1
));
15963 ASSERT_FALSE (real_zerop (f_m1
));
15964 ASSERT_FALSE (real_zerop (wr_f_m1
));
15965 ASSERT_FALSE (real_zerop (c_i_0
));
15966 ASSERT_FALSE (real_zerop (c_i_1
));
15967 ASSERT_FALSE (real_zerop (c_i_m1
));
15968 ASSERT_TRUE (real_zerop (c_f_0
));
15969 ASSERT_FALSE (real_zerop (c_f_1
));
15970 ASSERT_FALSE (real_zerop (c_f_m1
));
15972 /* Test real_onep. */
15973 ASSERT_FALSE (real_onep (i_0
));
15974 ASSERT_FALSE (real_onep (wr_i_0
));
15975 ASSERT_FALSE (real_onep (i_1
));
15976 ASSERT_FALSE (real_onep (wr_i_1
));
15977 ASSERT_FALSE (real_onep (i_m1
));
15978 ASSERT_FALSE (real_onep (wr_i_m1
));
15979 ASSERT_FALSE (real_onep (f_0
));
15980 ASSERT_FALSE (real_onep (wr_f_0
));
15981 ASSERT_TRUE (real_onep (f_1
));
15982 ASSERT_TRUE (real_onep (wr_f_1
));
15983 ASSERT_FALSE (real_onep (f_m1
));
15984 ASSERT_FALSE (real_onep (wr_f_m1
));
15985 ASSERT_FALSE (real_onep (c_i_0
));
15986 ASSERT_FALSE (real_onep (c_i_1
));
15987 ASSERT_FALSE (real_onep (c_i_m1
));
15988 ASSERT_FALSE (real_onep (c_f_0
));
15989 ASSERT_TRUE (real_onep (c_f_1
));
15990 ASSERT_FALSE (real_onep (c_f_m1
));
15992 /* Test real_minus_onep. */
15993 ASSERT_FALSE (real_minus_onep (i_0
));
15994 ASSERT_FALSE (real_minus_onep (wr_i_0
));
15995 ASSERT_FALSE (real_minus_onep (i_1
));
15996 ASSERT_FALSE (real_minus_onep (wr_i_1
));
15997 ASSERT_FALSE (real_minus_onep (i_m1
));
15998 ASSERT_FALSE (real_minus_onep (wr_i_m1
));
15999 ASSERT_FALSE (real_minus_onep (f_0
));
16000 ASSERT_FALSE (real_minus_onep (wr_f_0
));
16001 ASSERT_FALSE (real_minus_onep (f_1
));
16002 ASSERT_FALSE (real_minus_onep (wr_f_1
));
16003 ASSERT_TRUE (real_minus_onep (f_m1
));
16004 ASSERT_TRUE (real_minus_onep (wr_f_m1
));
16005 ASSERT_FALSE (real_minus_onep (c_i_0
));
16006 ASSERT_FALSE (real_minus_onep (c_i_1
));
16007 ASSERT_FALSE (real_minus_onep (c_i_m1
));
16008 ASSERT_FALSE (real_minus_onep (c_f_0
));
16009 ASSERT_FALSE (real_minus_onep (c_f_1
));
16010 ASSERT_TRUE (real_minus_onep (c_f_m1
));
16013 ASSERT_TRUE (zerop (i_0
));
16014 ASSERT_TRUE (zerop (wr_i_0
));
16015 ASSERT_FALSE (zerop (i_1
));
16016 ASSERT_FALSE (zerop (wr_i_1
));
16017 ASSERT_FALSE (zerop (i_m1
));
16018 ASSERT_FALSE (zerop (wr_i_m1
));
16019 ASSERT_TRUE (zerop (f_0
));
16020 ASSERT_TRUE (zerop (wr_f_0
));
16021 ASSERT_FALSE (zerop (f_1
));
16022 ASSERT_FALSE (zerop (wr_f_1
));
16023 ASSERT_FALSE (zerop (f_m1
));
16024 ASSERT_FALSE (zerop (wr_f_m1
));
16025 ASSERT_TRUE (zerop (c_i_0
));
16026 ASSERT_FALSE (zerop (c_i_1
));
16027 ASSERT_FALSE (zerop (c_i_m1
));
16028 ASSERT_TRUE (zerop (c_f_0
));
16029 ASSERT_FALSE (zerop (c_f_1
));
16030 ASSERT_FALSE (zerop (c_f_m1
));
16032 /* Test tree_expr_nonnegative_p. */
16033 ASSERT_TRUE (tree_expr_nonnegative_p (i_0
));
16034 ASSERT_TRUE (tree_expr_nonnegative_p (wr_i_0
));
16035 ASSERT_TRUE (tree_expr_nonnegative_p (i_1
));
16036 ASSERT_TRUE (tree_expr_nonnegative_p (wr_i_1
));
16037 ASSERT_FALSE (tree_expr_nonnegative_p (i_m1
));
16038 ASSERT_FALSE (tree_expr_nonnegative_p (wr_i_m1
));
16039 ASSERT_TRUE (tree_expr_nonnegative_p (f_0
));
16040 ASSERT_TRUE (tree_expr_nonnegative_p (wr_f_0
));
16041 ASSERT_TRUE (tree_expr_nonnegative_p (f_1
));
16042 ASSERT_TRUE (tree_expr_nonnegative_p (wr_f_1
));
16043 ASSERT_FALSE (tree_expr_nonnegative_p (f_m1
));
16044 ASSERT_FALSE (tree_expr_nonnegative_p (wr_f_m1
));
16045 ASSERT_FALSE (tree_expr_nonnegative_p (c_i_0
));
16046 ASSERT_FALSE (tree_expr_nonnegative_p (c_i_1
));
16047 ASSERT_FALSE (tree_expr_nonnegative_p (c_i_m1
));
16048 ASSERT_FALSE (tree_expr_nonnegative_p (c_f_0
));
16049 ASSERT_FALSE (tree_expr_nonnegative_p (c_f_1
));
16050 ASSERT_FALSE (tree_expr_nonnegative_p (c_f_m1
));
16052 /* Test tree_expr_nonzero_p. */
16053 ASSERT_FALSE (tree_expr_nonzero_p (i_0
));
16054 ASSERT_FALSE (tree_expr_nonzero_p (wr_i_0
));
16055 ASSERT_TRUE (tree_expr_nonzero_p (i_1
));
16056 ASSERT_TRUE (tree_expr_nonzero_p (wr_i_1
));
16057 ASSERT_TRUE (tree_expr_nonzero_p (i_m1
));
16058 ASSERT_TRUE (tree_expr_nonzero_p (wr_i_m1
));
16060 /* Test integer_valued_real_p. */
16061 ASSERT_FALSE (integer_valued_real_p (i_0
));
16062 ASSERT_TRUE (integer_valued_real_p (f_0
));
16063 ASSERT_TRUE (integer_valued_real_p (wr_f_0
));
16064 ASSERT_TRUE (integer_valued_real_p (f_1
));
16065 ASSERT_TRUE (integer_valued_real_p (wr_f_1
));
16067 /* Test integer_pow2p. */
16068 ASSERT_FALSE (integer_pow2p (i_0
));
16069 ASSERT_TRUE (integer_pow2p (i_1
));
16070 ASSERT_TRUE (integer_pow2p (wr_i_1
));
16072 /* Test uniform_integer_cst_p. */
16073 ASSERT_TRUE (uniform_integer_cst_p (i_0
));
16074 ASSERT_TRUE (uniform_integer_cst_p (wr_i_0
));
16075 ASSERT_TRUE (uniform_integer_cst_p (i_1
));
16076 ASSERT_TRUE (uniform_integer_cst_p (wr_i_1
));
16077 ASSERT_TRUE (uniform_integer_cst_p (i_m1
));
16078 ASSERT_TRUE (uniform_integer_cst_p (wr_i_m1
));
16079 ASSERT_FALSE (uniform_integer_cst_p (f_0
));
16080 ASSERT_FALSE (uniform_integer_cst_p (wr_f_0
));
16081 ASSERT_FALSE (uniform_integer_cst_p (f_1
));
16082 ASSERT_FALSE (uniform_integer_cst_p (wr_f_1
));
16083 ASSERT_FALSE (uniform_integer_cst_p (f_m1
));
16084 ASSERT_FALSE (uniform_integer_cst_p (wr_f_m1
));
16085 ASSERT_FALSE (uniform_integer_cst_p (c_i_0
));
16086 ASSERT_FALSE (uniform_integer_cst_p (c_i_1
));
16087 ASSERT_FALSE (uniform_integer_cst_p (c_i_m1
));
16088 ASSERT_FALSE (uniform_integer_cst_p (c_f_0
));
16089 ASSERT_FALSE (uniform_integer_cst_p (c_f_1
));
16090 ASSERT_FALSE (uniform_integer_cst_p (c_f_m1
));
16093 /* Check that string escaping works correctly. */
16096 test_escaped_strings (void)
16099 escaped_string msg
;
16102 /* ASSERT_STREQ does not accept NULL as a valid test
16103 result, so we have to use ASSERT_EQ instead. */
16104 ASSERT_EQ (NULL
, (const char *) msg
);
16107 ASSERT_STREQ ("", (const char *) msg
);
16109 msg
.escape ("foobar");
16110 ASSERT_STREQ ("foobar", (const char *) msg
);
16112 /* Ensure that we have -fmessage-length set to 0. */
16113 saved_cutoff
= pp_line_cutoff (global_dc
->printer
);
16114 pp_line_cutoff (global_dc
->printer
) = 0;
16116 msg
.escape ("foo\nbar");
16117 ASSERT_STREQ ("foo\\nbar", (const char *) msg
);
16119 msg
.escape ("\a\b\f\n\r\t\v");
16120 ASSERT_STREQ ("\\a\\b\\f\\n\\r\\t\\v", (const char *) msg
);
16122 /* Now repeat the tests with -fmessage-length set to 5. */
16123 pp_line_cutoff (global_dc
->printer
) = 5;
16125 /* Note that the newline is not translated into an escape. */
16126 msg
.escape ("foo\nbar");
16127 ASSERT_STREQ ("foo\nbar", (const char *) msg
);
16129 msg
.escape ("\a\b\f\n\r\t\v");
16130 ASSERT_STREQ ("\\a\\b\\f\n\\r\\t\\v", (const char *) msg
);
16132 /* Restore the original message length setting. */
16133 pp_line_cutoff (global_dc
->printer
) = saved_cutoff
;
16136 /* Run all of the selftests within this file. */
16141 test_integer_constants ();
16142 test_identifiers ();
16144 test_vector_cst_patterns ();
16145 test_location_wrappers ();
16146 test_predicates ();
16147 test_escaped_strings ();
16150 } // namespace selftest
16152 #endif /* CHECKING_P */
16154 #include "gt-tree.h"