1 /* Language-independent node constructors for parse phase of GNU compiler.
2 Copyright (C) 1987-2024 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"
71 #include "gimple-range.h"
72 #include "gomp-constants.h"
77 /* Names of tree components.
78 Used for printing out the tree and error messages. */
79 #define DEFTREECODE(SYM, NAME, TYPE, LEN) NAME,
80 #define END_OF_BASE_TREE_CODES "@dummy",
82 static const char *const tree_code_name
[] = {
83 #include "all-tree.def"
87 #undef END_OF_BASE_TREE_CODES
89 /* Each tree code class has an associated string representation.
90 These must correspond to the tree_code_class entries. */
92 const char *const tree_code_class_strings
[] =
107 /* obstack.[ch] explicitly declined to prototype this. */
108 extern int _obstack_allocated_p (struct obstack
*h
, void *obj
);
110 /* Statistics-gathering stuff. */
112 static uint64_t tree_code_counts
[MAX_TREE_CODES
];
113 uint64_t tree_node_counts
[(int) all_kinds
];
114 uint64_t tree_node_sizes
[(int) all_kinds
];
116 /* Keep in sync with tree.h:enum tree_node_kind. */
117 static const char * const tree_node_kind_names
[] = {
136 /* Unique id for next decl created. */
137 static GTY(()) int next_decl_uid
;
138 /* Unique id for next type created. */
139 static GTY(()) unsigned next_type_uid
= 1;
140 /* Unique id for next debug decl created. Use negative numbers,
141 to catch erroneous uses. */
142 static GTY(()) int next_debug_decl_uid
;
144 /* Since we cannot rehash a type after it is in the table, we have to
145 keep the hash code. */
147 struct GTY((for_user
)) type_hash
{
152 /* Initial size of the hash table (rounded to next prime). */
153 #define TYPE_HASH_INITIAL_SIZE 1000
155 struct type_cache_hasher
: ggc_cache_ptr_hash
<type_hash
>
157 static hashval_t
hash (type_hash
*t
) { return t
->hash
; }
158 static bool equal (type_hash
*a
, type_hash
*b
);
161 keep_cache_entry (type_hash
*&t
)
163 return ggc_marked_p (t
->type
);
167 /* Now here is the hash table. When recording a type, it is added to
168 the slot whose index is the hash code. Note that the hash table is
169 used for several kinds of types (function types, array types and
170 array index range types, for now). While all these live in the
171 same table, they are completely independent, and the hash code is
172 computed differently for each of these. */
174 static GTY ((cache
)) hash_table
<type_cache_hasher
> *type_hash_table
;
176 /* Hash table and temporary node for larger integer const values. */
177 static GTY (()) tree int_cst_node
;
179 struct int_cst_hasher
: ggc_cache_ptr_hash
<tree_node
>
181 static hashval_t
hash (tree t
);
182 static bool equal (tree x
, tree y
);
185 static GTY ((cache
)) hash_table
<int_cst_hasher
> *int_cst_hash_table
;
187 /* Class and variable for making sure that there is a single POLY_INT_CST
188 for a given value. */
189 struct poly_int_cst_hasher
: ggc_cache_ptr_hash
<tree_node
>
191 typedef std::pair
<tree
, const poly_wide_int
*> compare_type
;
192 static hashval_t
hash (tree t
);
193 static bool equal (tree x
, const compare_type
&y
);
196 static GTY ((cache
)) hash_table
<poly_int_cst_hasher
> *poly_int_cst_hash_table
;
198 /* Hash table for optimization flags and target option flags. Use the same
199 hash table for both sets of options. Nodes for building the current
200 optimization and target option nodes. The assumption is most of the time
201 the options created will already be in the hash table, so we avoid
202 allocating and freeing up a node repeatably. */
203 static GTY (()) tree cl_optimization_node
;
204 static GTY (()) tree cl_target_option_node
;
206 struct cl_option_hasher
: ggc_cache_ptr_hash
<tree_node
>
208 static hashval_t
hash (tree t
);
209 static bool equal (tree x
, tree y
);
212 static GTY ((cache
)) hash_table
<cl_option_hasher
> *cl_option_hash_table
;
214 /* General tree->tree mapping structure for use in hash tables. */
218 hash_table
<tree_decl_map_cache_hasher
> *debug_expr_for_decl
;
221 hash_table
<tree_decl_map_cache_hasher
> *value_expr_for_decl
;
224 hash_table
<tree_vec_map_cache_hasher
> *debug_args_for_decl
;
226 static void set_type_quals (tree
, int);
227 static void print_type_hash_statistics (void);
228 static void print_debug_expr_statistics (void);
229 static void print_value_expr_statistics (void);
231 tree global_trees
[TI_MAX
];
232 tree integer_types
[itk_none
];
234 bool int_n_enabled_p
[NUM_INT_N_ENTS
];
235 struct int_n_trees_t int_n_trees
[NUM_INT_N_ENTS
];
237 bool tree_contains_struct
[MAX_TREE_CODES
][64];
239 /* Number of operands for each OMP clause. */
240 unsigned const char omp_clause_num_ops
[] =
242 0, /* OMP_CLAUSE_ERROR */
243 1, /* OMP_CLAUSE_PRIVATE */
244 1, /* OMP_CLAUSE_SHARED */
245 1, /* OMP_CLAUSE_FIRSTPRIVATE */
246 2, /* OMP_CLAUSE_LASTPRIVATE */
247 5, /* OMP_CLAUSE_REDUCTION */
248 5, /* OMP_CLAUSE_TASK_REDUCTION */
249 5, /* OMP_CLAUSE_IN_REDUCTION */
250 1, /* OMP_CLAUSE_COPYIN */
251 1, /* OMP_CLAUSE_COPYPRIVATE */
252 3, /* OMP_CLAUSE_LINEAR */
253 1, /* OMP_CLAUSE_AFFINITY */
254 2, /* OMP_CLAUSE_ALIGNED */
255 3, /* OMP_CLAUSE_ALLOCATE */
256 1, /* OMP_CLAUSE_DEPEND */
257 1, /* OMP_CLAUSE_NONTEMPORAL */
258 1, /* OMP_CLAUSE_UNIFORM */
259 1, /* OMP_CLAUSE_ENTER */
260 1, /* OMP_CLAUSE_LINK */
261 1, /* OMP_CLAUSE_DETACH */
262 1, /* OMP_CLAUSE_USE_DEVICE_PTR */
263 1, /* OMP_CLAUSE_USE_DEVICE_ADDR */
264 1, /* OMP_CLAUSE_IS_DEVICE_PTR */
265 1, /* OMP_CLAUSE_INCLUSIVE */
266 1, /* OMP_CLAUSE_EXCLUSIVE */
267 2, /* OMP_CLAUSE_FROM */
268 2, /* OMP_CLAUSE_TO */
269 2, /* OMP_CLAUSE_MAP */
270 1, /* OMP_CLAUSE_HAS_DEVICE_ADDR */
271 1, /* OMP_CLAUSE_DOACROSS */
272 2, /* OMP_CLAUSE__CACHE_ */
273 2, /* OMP_CLAUSE_GANG */
274 1, /* OMP_CLAUSE_ASYNC */
275 1, /* OMP_CLAUSE_WAIT */
276 0, /* OMP_CLAUSE_AUTO */
277 0, /* OMP_CLAUSE_SEQ */
278 1, /* OMP_CLAUSE__LOOPTEMP_ */
279 1, /* OMP_CLAUSE__REDUCTEMP_ */
280 1, /* OMP_CLAUSE__CONDTEMP_ */
281 1, /* OMP_CLAUSE__SCANTEMP_ */
282 1, /* OMP_CLAUSE_IF */
283 1, /* OMP_CLAUSE_SELF */
284 1, /* OMP_CLAUSE_NUM_THREADS */
285 1, /* OMP_CLAUSE_SCHEDULE */
286 0, /* OMP_CLAUSE_NOWAIT */
287 1, /* OMP_CLAUSE_ORDERED */
288 0, /* OMP_CLAUSE_DEFAULT */
289 3, /* OMP_CLAUSE_COLLAPSE */
290 0, /* OMP_CLAUSE_UNTIED */
291 1, /* OMP_CLAUSE_FINAL */
292 0, /* OMP_CLAUSE_MERGEABLE */
293 1, /* OMP_CLAUSE_DEVICE */
294 1, /* OMP_CLAUSE_DIST_SCHEDULE */
295 0, /* OMP_CLAUSE_INBRANCH */
296 0, /* OMP_CLAUSE_NOTINBRANCH */
297 2, /* OMP_CLAUSE_NUM_TEAMS */
298 1, /* OMP_CLAUSE_THREAD_LIMIT */
299 0, /* OMP_CLAUSE_PROC_BIND */
300 1, /* OMP_CLAUSE_SAFELEN */
301 1, /* OMP_CLAUSE_SIMDLEN */
302 0, /* OMP_CLAUSE_DEVICE_TYPE */
303 0, /* OMP_CLAUSE_FOR */
304 0, /* OMP_CLAUSE_PARALLEL */
305 0, /* OMP_CLAUSE_SECTIONS */
306 0, /* OMP_CLAUSE_TASKGROUP */
307 1, /* OMP_CLAUSE_PRIORITY */
308 1, /* OMP_CLAUSE_GRAINSIZE */
309 1, /* OMP_CLAUSE_NUM_TASKS */
310 0, /* OMP_CLAUSE_NOGROUP */
311 0, /* OMP_CLAUSE_THREADS */
312 0, /* OMP_CLAUSE_SIMD */
313 1, /* OMP_CLAUSE_HINT */
314 0, /* OMP_CLAUSE_DEFAULTMAP */
315 0, /* OMP_CLAUSE_ORDER */
316 0, /* OMP_CLAUSE_BIND */
317 1, /* OMP_CLAUSE_FILTER */
318 1, /* OMP_CLAUSE_INDIRECT */
319 1, /* OMP_CLAUSE__SIMDUID_ */
320 0, /* OMP_CLAUSE__SIMT_ */
321 0, /* OMP_CLAUSE_INDEPENDENT */
322 1, /* OMP_CLAUSE_WORKER */
323 1, /* OMP_CLAUSE_VECTOR */
324 1, /* OMP_CLAUSE_NUM_GANGS */
325 1, /* OMP_CLAUSE_NUM_WORKERS */
326 1, /* OMP_CLAUSE_VECTOR_LENGTH */
327 3, /* OMP_CLAUSE_TILE */
328 0, /* OMP_CLAUSE_IF_PRESENT */
329 0, /* OMP_CLAUSE_FINALIZE */
330 0, /* OMP_CLAUSE_NOHOST */
333 const char * const omp_clause_code_name
[] =
426 /* Unless specific to OpenACC, we tend to internally maintain OpenMP-centric
427 clause names, but for use in diagnostics etc. would like to use the "user"
431 user_omp_clause_code_name (tree clause
, bool oacc
)
433 /* For OpenACC, the 'OMP_CLAUSE_MAP_KIND' of an 'OMP_CLAUSE_MAP' is used to
434 distinguish clauses as seen by the user. See also where front ends do
435 'build_omp_clause' with 'OMP_CLAUSE_MAP'. */
436 if (oacc
&& OMP_CLAUSE_CODE (clause
) == OMP_CLAUSE_MAP
)
437 switch (OMP_CLAUSE_MAP_KIND (clause
))
439 case GOMP_MAP_FORCE_ALLOC
:
440 case GOMP_MAP_ALLOC
: return "create";
441 case GOMP_MAP_FORCE_TO
:
442 case GOMP_MAP_TO
: return "copyin";
443 case GOMP_MAP_FORCE_FROM
:
444 case GOMP_MAP_FROM
: return "copyout";
445 case GOMP_MAP_FORCE_TOFROM
:
446 case GOMP_MAP_TOFROM
: return "copy";
447 case GOMP_MAP_RELEASE
: return "delete";
448 case GOMP_MAP_FORCE_PRESENT
: return "present";
449 case GOMP_MAP_ATTACH
: return "attach";
450 case GOMP_MAP_FORCE_DETACH
:
451 case GOMP_MAP_DETACH
: return "detach";
452 case GOMP_MAP_DEVICE_RESIDENT
: return "device_resident";
453 case GOMP_MAP_LINK
: return "link";
454 case GOMP_MAP_FORCE_DEVICEPTR
: return "deviceptr";
458 return omp_clause_code_name
[OMP_CLAUSE_CODE (clause
)];
462 /* Return the tree node structure used by tree code CODE. */
464 static inline enum tree_node_structure_enum
465 tree_node_structure_for_code (enum tree_code code
)
467 switch (TREE_CODE_CLASS (code
))
469 case tcc_declaration
:
472 case CONST_DECL
: return TS_CONST_DECL
;
473 case DEBUG_EXPR_DECL
: return TS_DECL_WRTL
;
474 case FIELD_DECL
: return TS_FIELD_DECL
;
475 case FUNCTION_DECL
: return TS_FUNCTION_DECL
;
476 case LABEL_DECL
: return TS_LABEL_DECL
;
477 case PARM_DECL
: return TS_PARM_DECL
;
478 case RESULT_DECL
: return TS_RESULT_DECL
;
479 case TRANSLATION_UNIT_DECL
: return TS_TRANSLATION_UNIT_DECL
;
480 case TYPE_DECL
: return TS_TYPE_DECL
;
481 case VAR_DECL
: return TS_VAR_DECL
;
482 default: return TS_DECL_NON_COMMON
;
485 case tcc_type
: return TS_TYPE_NON_COMMON
;
493 case tcc_vl_exp
: return TS_EXP
;
495 default: /* tcc_constant and tcc_exceptional */
501 /* tcc_constant cases. */
502 case COMPLEX_CST
: return TS_COMPLEX
;
503 case FIXED_CST
: return TS_FIXED_CST
;
504 case INTEGER_CST
: return TS_INT_CST
;
505 case POLY_INT_CST
: return TS_POLY_INT_CST
;
506 case REAL_CST
: return TS_REAL_CST
;
507 case STRING_CST
: return TS_STRING
;
508 case VECTOR_CST
: return TS_VECTOR
;
509 case VOID_CST
: return TS_TYPED
;
511 /* tcc_exceptional cases. */
512 case BLOCK
: return TS_BLOCK
;
513 case CONSTRUCTOR
: return TS_CONSTRUCTOR
;
514 case ERROR_MARK
: return TS_COMMON
;
515 case IDENTIFIER_NODE
: return TS_IDENTIFIER
;
516 case OMP_CLAUSE
: return TS_OMP_CLAUSE
;
517 case OPTIMIZATION_NODE
: return TS_OPTIMIZATION
;
518 case PLACEHOLDER_EXPR
: return TS_COMMON
;
519 case SSA_NAME
: return TS_SSA_NAME
;
520 case STATEMENT_LIST
: return TS_STATEMENT_LIST
;
521 case TARGET_OPTION_NODE
: return TS_TARGET_OPTION
;
522 case TREE_BINFO
: return TS_BINFO
;
523 case TREE_LIST
: return TS_LIST
;
524 case TREE_VEC
: return TS_VEC
;
532 /* Initialize tree_contains_struct to describe the hierarchy of tree
536 initialize_tree_contains_struct (void)
540 for (i
= ERROR_MARK
; i
< LAST_AND_UNUSED_TREE_CODE
; i
++)
543 enum tree_node_structure_enum ts_code
;
545 code
= (enum tree_code
) i
;
546 ts_code
= tree_node_structure_for_code (code
);
548 /* Mark the TS structure itself. */
549 tree_contains_struct
[code
][ts_code
] = 1;
551 /* Mark all the structures that TS is derived from. */
556 case TS_OPTIMIZATION
:
557 case TS_TARGET_OPTION
:
563 case TS_POLY_INT_CST
:
572 case TS_STATEMENT_LIST
:
573 MARK_TS_TYPED (code
);
577 case TS_DECL_MINIMAL
:
583 MARK_TS_COMMON (code
);
586 case TS_TYPE_WITH_LANG_SPECIFIC
:
587 MARK_TS_TYPE_COMMON (code
);
590 case TS_TYPE_NON_COMMON
:
591 MARK_TS_TYPE_WITH_LANG_SPECIFIC (code
);
595 MARK_TS_DECL_MINIMAL (code
);
600 MARK_TS_DECL_COMMON (code
);
603 case TS_DECL_NON_COMMON
:
604 MARK_TS_DECL_WITH_VIS (code
);
607 case TS_DECL_WITH_VIS
:
611 MARK_TS_DECL_WRTL (code
);
615 MARK_TS_DECL_COMMON (code
);
619 MARK_TS_DECL_WITH_VIS (code
);
623 case TS_FUNCTION_DECL
:
624 MARK_TS_DECL_NON_COMMON (code
);
627 case TS_TRANSLATION_UNIT_DECL
:
628 MARK_TS_DECL_COMMON (code
);
636 /* Basic consistency checks for attributes used in fold. */
637 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_NON_COMMON
]);
638 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_NON_COMMON
]);
639 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_DECL_COMMON
]);
640 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_COMMON
]);
641 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_COMMON
]);
642 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_COMMON
]);
643 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_COMMON
]);
644 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_COMMON
]);
645 gcc_assert (tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_COMMON
]);
646 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_COMMON
]);
647 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_DECL_COMMON
]);
648 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_WRTL
]);
649 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_WRTL
]);
650 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_WRTL
]);
651 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WRTL
]);
652 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_WRTL
]);
653 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_DECL_MINIMAL
]);
654 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_MINIMAL
]);
655 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_MINIMAL
]);
656 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_MINIMAL
]);
657 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_MINIMAL
]);
658 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_MINIMAL
]);
659 gcc_assert (tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_MINIMAL
]);
660 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_MINIMAL
]);
661 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_DECL_MINIMAL
]);
662 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_WITH_VIS
]);
663 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WITH_VIS
]);
664 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_WITH_VIS
]);
665 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_VAR_DECL
]);
666 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_FIELD_DECL
]);
667 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_PARM_DECL
]);
668 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_LABEL_DECL
]);
669 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_RESULT_DECL
]);
670 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_CONST_DECL
]);
671 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_TYPE_DECL
]);
672 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_FUNCTION_DECL
]);
673 gcc_assert (tree_contains_struct
[IMPORTED_DECL
][TS_DECL_MINIMAL
]);
674 gcc_assert (tree_contains_struct
[IMPORTED_DECL
][TS_DECL_COMMON
]);
675 gcc_assert (tree_contains_struct
[NAMELIST_DECL
][TS_DECL_MINIMAL
]);
676 gcc_assert (tree_contains_struct
[NAMELIST_DECL
][TS_DECL_COMMON
]);
685 /* Initialize the hash table of types. */
687 = hash_table
<type_cache_hasher
>::create_ggc (TYPE_HASH_INITIAL_SIZE
);
690 = hash_table
<tree_decl_map_cache_hasher
>::create_ggc (512);
693 = hash_table
<tree_decl_map_cache_hasher
>::create_ggc (512);
695 int_cst_hash_table
= hash_table
<int_cst_hasher
>::create_ggc (1024);
697 poly_int_cst_hash_table
= hash_table
<poly_int_cst_hasher
>::create_ggc (64);
699 int_cst_node
= make_int_cst (1, 1);
701 cl_option_hash_table
= hash_table
<cl_option_hasher
>::create_ggc (64);
703 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
704 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
706 /* Initialize the tree_contains_struct array. */
707 initialize_tree_contains_struct ();
708 lang_hooks
.init_ts ();
712 /* The name of the object as the assembler will see it (but before any
713 translations made by ASM_OUTPUT_LABELREF). Often this is the same
714 as DECL_NAME. It is an IDENTIFIER_NODE. */
716 decl_assembler_name (tree decl
)
718 if (!DECL_ASSEMBLER_NAME_SET_P (decl
))
719 lang_hooks
.set_decl_assembler_name (decl
);
720 return DECL_ASSEMBLER_NAME_RAW (decl
);
723 /* The DECL_ASSEMBLER_NAME_RAW of DECL is being explicitly set to NAME
724 (either of which may be NULL). Inform the FE, if this changes the
728 overwrite_decl_assembler_name (tree decl
, tree name
)
730 if (DECL_ASSEMBLER_NAME_RAW (decl
) != name
)
731 lang_hooks
.overwrite_decl_assembler_name (decl
, name
);
734 /* Return true if DECL may need an assembler name to be set. */
737 need_assembler_name_p (tree decl
)
739 /* We use DECL_ASSEMBLER_NAME to hold mangled type names for One Definition
740 Rule merging. This makes type_odr_p to return true on those types during
741 LTO and by comparing the mangled name, we can say what types are intended
742 to be equivalent across compilation unit.
744 We do not store names of type_in_anonymous_namespace_p.
746 Record, union and enumeration type have linkage that allows use
747 to check type_in_anonymous_namespace_p. We do not mangle compound types
748 that always can be compared structurally.
750 Similarly for builtin types, we compare properties of their main variant.
751 A special case are integer types where mangling do make differences
752 between char/signed char/unsigned char etc. Storing name for these makes
753 e.g. -fno-signed-char/-fsigned-char mismatches to be handled well.
754 See cp/mangle.cc:write_builtin_type for details. */
756 if (TREE_CODE (decl
) == TYPE_DECL
)
759 && decl
== TYPE_NAME (TREE_TYPE (decl
))
760 && TYPE_MAIN_VARIANT (TREE_TYPE (decl
)) == TREE_TYPE (decl
)
761 && !TYPE_ARTIFICIAL (TREE_TYPE (decl
))
762 && ((TREE_CODE (TREE_TYPE (decl
)) != RECORD_TYPE
763 && TREE_CODE (TREE_TYPE (decl
)) != UNION_TYPE
)
764 || TYPE_CXX_ODR_P (TREE_TYPE (decl
)))
765 && (type_with_linkage_p (TREE_TYPE (decl
))
766 || TREE_CODE (TREE_TYPE (decl
)) == INTEGER_TYPE
)
767 && !variably_modified_type_p (TREE_TYPE (decl
), NULL_TREE
))
768 return !DECL_ASSEMBLER_NAME_SET_P (decl
);
771 /* Only FUNCTION_DECLs and VAR_DECLs are considered. */
772 if (!VAR_OR_FUNCTION_DECL_P (decl
))
775 /* If DECL already has its assembler name set, it does not need a
777 if (!HAS_DECL_ASSEMBLER_NAME_P (decl
)
778 || DECL_ASSEMBLER_NAME_SET_P (decl
))
781 /* Abstract decls do not need an assembler name. */
782 if (DECL_ABSTRACT_P (decl
))
785 /* For VAR_DECLs, only static, public and external symbols need an
788 && !TREE_STATIC (decl
)
789 && !TREE_PUBLIC (decl
)
790 && !DECL_EXTERNAL (decl
))
793 if (TREE_CODE (decl
) == FUNCTION_DECL
)
795 /* Do not set assembler name on builtins. Allow RTL expansion to
796 decide whether to expand inline or via a regular call. */
797 if (fndecl_built_in_p (decl
)
798 && DECL_BUILT_IN_CLASS (decl
) != BUILT_IN_FRONTEND
)
801 /* Functions represented in the callgraph need an assembler name. */
802 if (cgraph_node::get (decl
) != NULL
)
805 /* Unused and not public functions don't need an assembler name. */
806 if (!TREE_USED (decl
) && !TREE_PUBLIC (decl
))
813 /* If T needs an assembler name, have one created for it. */
816 assign_assembler_name_if_needed (tree t
)
818 if (need_assembler_name_p (t
))
820 /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit
821 diagnostics that use input_location to show locus
822 information. The problem here is that, at this point,
823 input_location is generally anchored to the end of the file
824 (since the parser is long gone), so we don't have a good
825 position to pin it to.
827 To alleviate this problem, this uses the location of T's
828 declaration. Examples of this are
829 testsuite/g++.dg/template/cond2.C and
830 testsuite/g++.dg/template/pr35240.C. */
831 location_t saved_location
= input_location
;
832 input_location
= DECL_SOURCE_LOCATION (t
);
834 decl_assembler_name (t
);
836 input_location
= saved_location
;
840 /* When the target supports COMDAT groups, this indicates which group the
841 DECL is associated with. This can be either an IDENTIFIER_NODE or a
842 decl, in which case its DECL_ASSEMBLER_NAME identifies the group. */
844 decl_comdat_group (const_tree node
)
846 struct symtab_node
*snode
= symtab_node::get (node
);
849 return snode
->get_comdat_group ();
852 /* Likewise, but make sure it's been reduced to an IDENTIFIER_NODE. */
854 decl_comdat_group_id (const_tree node
)
856 struct symtab_node
*snode
= symtab_node::get (node
);
859 return snode
->get_comdat_group_id ();
862 /* When the target supports named section, return its name as IDENTIFIER_NODE
863 or NULL if it is in no section. */
865 decl_section_name (const_tree node
)
867 struct symtab_node
*snode
= symtab_node::get (node
);
870 return snode
->get_section ();
873 /* Set section name of NODE to VALUE (that is expected to be
876 set_decl_section_name (tree node
, const char *value
)
878 struct symtab_node
*snode
;
882 snode
= symtab_node::get (node
);
886 else if (VAR_P (node
))
887 snode
= varpool_node::get_create (node
);
889 snode
= cgraph_node::get_create (node
);
890 snode
->set_section (value
);
893 /* Set section name of NODE to match the section name of OTHER.
895 set_decl_section_name (decl, other) is equivalent to
896 set_decl_section_name (decl, DECL_SECTION_NAME (other)), but possibly more
899 set_decl_section_name (tree decl
, const_tree other
)
901 struct symtab_node
*other_node
= symtab_node::get (other
);
904 struct symtab_node
*decl_node
;
906 decl_node
= varpool_node::get_create (decl
);
908 decl_node
= cgraph_node::get_create (decl
);
909 decl_node
->set_section (*other_node
);
913 struct symtab_node
*decl_node
= symtab_node::get (decl
);
916 decl_node
->set_section (NULL
);
920 /* Return TLS model of a variable NODE. */
922 decl_tls_model (const_tree node
)
924 struct varpool_node
*snode
= varpool_node::get (node
);
926 return TLS_MODEL_NONE
;
927 return snode
->tls_model
;
930 /* Set TLS model of variable NODE to MODEL. */
932 set_decl_tls_model (tree node
, enum tls_model model
)
934 struct varpool_node
*vnode
;
936 if (model
== TLS_MODEL_NONE
)
938 vnode
= varpool_node::get (node
);
943 vnode
= varpool_node::get_create (node
);
944 vnode
->tls_model
= model
;
947 /* Compute the number of bytes occupied by a tree with code CODE.
948 This function cannot be used for nodes that have variable sizes,
949 including TREE_VEC, INTEGER_CST, STRING_CST, and CALL_EXPR. */
951 tree_code_size (enum tree_code code
)
953 switch (TREE_CODE_CLASS (code
))
955 case tcc_declaration
: /* A decl node */
958 case FIELD_DECL
: return sizeof (tree_field_decl
);
959 case PARM_DECL
: return sizeof (tree_parm_decl
);
960 case VAR_DECL
: return sizeof (tree_var_decl
);
961 case LABEL_DECL
: return sizeof (tree_label_decl
);
962 case RESULT_DECL
: return sizeof (tree_result_decl
);
963 case CONST_DECL
: return sizeof (tree_const_decl
);
964 case TYPE_DECL
: return sizeof (tree_type_decl
);
965 case FUNCTION_DECL
: return sizeof (tree_function_decl
);
966 case DEBUG_EXPR_DECL
: return sizeof (tree_decl_with_rtl
);
967 case TRANSLATION_UNIT_DECL
: return sizeof (tree_translation_unit_decl
);
970 case NAMELIST_DECL
: return sizeof (tree_decl_non_common
);
972 gcc_checking_assert (code
>= NUM_TREE_CODES
);
973 return lang_hooks
.tree_size (code
);
976 case tcc_type
: /* a type node */
988 case FIXED_POINT_TYPE
:
994 case QUAL_UNION_TYPE
:
999 case LANG_TYPE
: return sizeof (tree_type_non_common
);
1001 gcc_checking_assert (code
>= NUM_TREE_CODES
);
1002 return lang_hooks
.tree_size (code
);
1005 case tcc_reference
: /* a reference */
1006 case tcc_expression
: /* an expression */
1007 case tcc_statement
: /* an expression with side effects */
1008 case tcc_comparison
: /* a comparison expression */
1009 case tcc_unary
: /* a unary arithmetic expression */
1010 case tcc_binary
: /* a binary arithmetic expression */
1011 return (sizeof (struct tree_exp
)
1012 + (TREE_CODE_LENGTH (code
) - 1) * sizeof (tree
));
1014 case tcc_constant
: /* a constant */
1017 case VOID_CST
: return sizeof (tree_typed
);
1018 case INTEGER_CST
: gcc_unreachable ();
1019 case POLY_INT_CST
: return sizeof (tree_poly_int_cst
);
1020 case REAL_CST
: return sizeof (tree_real_cst
);
1021 case FIXED_CST
: return sizeof (tree_fixed_cst
);
1022 case COMPLEX_CST
: return sizeof (tree_complex
);
1023 case VECTOR_CST
: gcc_unreachable ();
1024 case STRING_CST
: gcc_unreachable ();
1026 gcc_checking_assert (code
>= NUM_TREE_CODES
);
1027 return lang_hooks
.tree_size (code
);
1030 case tcc_exceptional
: /* something random, like an identifier. */
1033 case IDENTIFIER_NODE
: return lang_hooks
.identifier_size
;
1034 case TREE_LIST
: return sizeof (tree_list
);
1037 case PLACEHOLDER_EXPR
: return sizeof (tree_common
);
1039 case TREE_VEC
: gcc_unreachable ();
1040 case OMP_CLAUSE
: gcc_unreachable ();
1042 case SSA_NAME
: return sizeof (tree_ssa_name
);
1044 case STATEMENT_LIST
: return sizeof (tree_statement_list
);
1045 case BLOCK
: return sizeof (struct tree_block
);
1046 case CONSTRUCTOR
: return sizeof (tree_constructor
);
1047 case OPTIMIZATION_NODE
: return sizeof (tree_optimization_option
);
1048 case TARGET_OPTION_NODE
: return sizeof (tree_target_option
);
1051 gcc_checking_assert (code
>= NUM_TREE_CODES
);
1052 return lang_hooks
.tree_size (code
);
1060 /* Compute the number of bytes occupied by NODE. This routine only
1061 looks at TREE_CODE, except for those nodes that have variable sizes. */
1063 tree_size (const_tree node
)
1065 const enum tree_code code
= TREE_CODE (node
);
1069 return (sizeof (struct tree_int_cst
)
1070 + (TREE_INT_CST_EXT_NUNITS (node
) - 1) * sizeof (HOST_WIDE_INT
));
1073 return (offsetof (struct tree_binfo
, base_binfos
)
1075 ::embedded_size (BINFO_N_BASE_BINFOS (node
)));
1078 return (sizeof (struct tree_vec
)
1079 + (TREE_VEC_LENGTH (node
) - 1) * sizeof (tree
));
1082 return (sizeof (struct tree_vector
)
1083 + (vector_cst_encoded_nelts (node
) - 1) * sizeof (tree
));
1086 return TREE_STRING_LENGTH (node
) + offsetof (struct tree_string
, str
) + 1;
1089 return (sizeof (struct tree_omp_clause
)
1090 + (omp_clause_num_ops
[OMP_CLAUSE_CODE (node
)] - 1)
1094 if (TREE_CODE_CLASS (code
) == tcc_vl_exp
)
1095 return (sizeof (struct tree_exp
)
1096 + (VL_EXP_OPERAND_LENGTH (node
) - 1) * sizeof (tree
));
1098 return tree_code_size (code
);
1102 /* Return tree node kind based on tree CODE. */
1104 static tree_node_kind
1105 get_stats_node_kind (enum tree_code code
)
1107 enum tree_code_class type
= TREE_CODE_CLASS (code
);
1111 case tcc_declaration
: /* A decl node */
1113 case tcc_type
: /* a type node */
1115 case tcc_statement
: /* an expression with side effects */
1117 case tcc_reference
: /* a reference */
1119 case tcc_expression
: /* an expression */
1120 case tcc_comparison
: /* a comparison expression */
1121 case tcc_unary
: /* a unary arithmetic expression */
1122 case tcc_binary
: /* a binary arithmetic expression */
1124 case tcc_constant
: /* a constant */
1126 case tcc_exceptional
: /* something random, like an identifier. */
1129 case IDENTIFIER_NODE
:
1136 return ssa_name_kind
;
1142 return omp_clause_kind
;
1154 /* Record interesting allocation statistics for a tree node with CODE
1158 record_node_allocation_statistics (enum tree_code code
, size_t length
)
1160 if (!GATHER_STATISTICS
)
1163 tree_node_kind kind
= get_stats_node_kind (code
);
1165 tree_code_counts
[(int) code
]++;
1166 tree_node_counts
[(int) kind
]++;
1167 tree_node_sizes
[(int) kind
] += length
;
1170 /* Allocate and return a new UID from the DECL_UID namespace. */
1173 allocate_decl_uid (void)
1175 return next_decl_uid
++;
1178 /* Return a newly allocated node of code CODE. For decl and type
1179 nodes, some other fields are initialized. The rest of the node is
1180 initialized to zero. This function cannot be used for TREE_VEC,
1181 INTEGER_CST or OMP_CLAUSE nodes, which is enforced by asserts in
1184 Achoo! I got a code in the node. */
1187 make_node (enum tree_code code MEM_STAT_DECL
)
1190 enum tree_code_class type
= TREE_CODE_CLASS (code
);
1191 size_t length
= tree_code_size (code
);
1193 record_node_allocation_statistics (code
, length
);
1195 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
1196 TREE_SET_CODE (t
, code
);
1201 if (code
!= DEBUG_BEGIN_STMT
)
1202 TREE_SIDE_EFFECTS (t
) = 1;
1205 case tcc_declaration
:
1206 if (CODE_CONTAINS_STRUCT (code
, TS_DECL_COMMON
))
1208 if (code
== FUNCTION_DECL
)
1210 SET_DECL_ALIGN (t
, FUNCTION_ALIGNMENT (FUNCTION_BOUNDARY
));
1211 SET_DECL_MODE (t
, FUNCTION_MODE
);
1214 SET_DECL_ALIGN (t
, 1);
1216 DECL_SOURCE_LOCATION (t
) = input_location
;
1217 if (TREE_CODE (t
) == DEBUG_EXPR_DECL
)
1218 DECL_UID (t
) = --next_debug_decl_uid
;
1221 DECL_UID (t
) = allocate_decl_uid ();
1222 SET_DECL_PT_UID (t
, -1);
1224 if (TREE_CODE (t
) == LABEL_DECL
)
1225 LABEL_DECL_UID (t
) = -1;
1230 TYPE_UID (t
) = next_type_uid
++;
1231 SET_TYPE_ALIGN (t
, BITS_PER_UNIT
);
1232 TYPE_USER_ALIGN (t
) = 0;
1233 TYPE_MAIN_VARIANT (t
) = t
;
1234 TYPE_CANONICAL (t
) = t
;
1236 /* Default to no attributes for type, but let target change that. */
1237 TYPE_ATTRIBUTES (t
) = NULL_TREE
;
1238 targetm
.set_default_type_attributes (t
);
1240 /* We have not yet computed the alias set for this type. */
1241 TYPE_ALIAS_SET (t
) = -1;
1245 TREE_CONSTANT (t
) = 1;
1248 case tcc_expression
:
1254 case PREDECREMENT_EXPR
:
1255 case PREINCREMENT_EXPR
:
1256 case POSTDECREMENT_EXPR
:
1257 case POSTINCREMENT_EXPR
:
1258 /* All of these have side-effects, no matter what their
1260 TREE_SIDE_EFFECTS (t
) = 1;
1268 case tcc_exceptional
:
1271 case TARGET_OPTION_NODE
:
1272 TREE_TARGET_OPTION(t
)
1273 = ggc_cleared_alloc
<struct cl_target_option
> ();
1276 case OPTIMIZATION_NODE
:
1277 TREE_OPTIMIZATION (t
)
1278 = ggc_cleared_alloc
<struct cl_optimization
> ();
1287 /* Other classes need no special treatment. */
1294 /* Free tree node. */
1297 free_node (tree node
)
1299 enum tree_code code
= TREE_CODE (node
);
1300 if (GATHER_STATISTICS
)
1302 enum tree_node_kind kind
= get_stats_node_kind (code
);
1304 gcc_checking_assert (tree_code_counts
[(int) TREE_CODE (node
)] != 0);
1305 gcc_checking_assert (tree_node_counts
[(int) kind
] != 0);
1306 gcc_checking_assert (tree_node_sizes
[(int) kind
] >= tree_size (node
));
1308 tree_code_counts
[(int) TREE_CODE (node
)]--;
1309 tree_node_counts
[(int) kind
]--;
1310 tree_node_sizes
[(int) kind
] -= tree_size (node
);
1312 if (CODE_CONTAINS_STRUCT (code
, TS_CONSTRUCTOR
))
1313 vec_free (CONSTRUCTOR_ELTS (node
));
1314 else if (code
== BLOCK
)
1315 vec_free (BLOCK_NONLOCALIZED_VARS (node
));
1316 else if (code
== TREE_BINFO
)
1317 vec_free (BINFO_BASE_ACCESSES (node
));
1318 else if (code
== OPTIMIZATION_NODE
)
1319 cl_optimization_option_free (TREE_OPTIMIZATION (node
));
1320 else if (code
== TARGET_OPTION_NODE
)
1321 cl_target_option_free (TREE_TARGET_OPTION (node
));
1325 /* Return a new node with the same contents as NODE except that its
1326 TREE_CHAIN, if it has one, is zero and it has a fresh uid. */
1329 copy_node (tree node MEM_STAT_DECL
)
1332 enum tree_code code
= TREE_CODE (node
);
1335 gcc_assert (code
!= STATEMENT_LIST
);
1337 length
= tree_size (node
);
1338 record_node_allocation_statistics (code
, length
);
1339 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
1340 memcpy (t
, node
, length
);
1342 if (CODE_CONTAINS_STRUCT (code
, TS_COMMON
))
1344 TREE_ASM_WRITTEN (t
) = 0;
1345 TREE_VISITED (t
) = 0;
1347 if (TREE_CODE_CLASS (code
) == tcc_declaration
)
1349 if (code
== DEBUG_EXPR_DECL
)
1350 DECL_UID (t
) = --next_debug_decl_uid
;
1353 DECL_UID (t
) = allocate_decl_uid ();
1354 if (DECL_PT_UID_SET_P (node
))
1355 SET_DECL_PT_UID (t
, DECL_PT_UID (node
));
1357 if ((TREE_CODE (node
) == PARM_DECL
|| VAR_P (node
))
1358 && DECL_HAS_VALUE_EXPR_P (node
))
1360 SET_DECL_VALUE_EXPR (t
, DECL_VALUE_EXPR (node
));
1361 DECL_HAS_VALUE_EXPR_P (t
) = 1;
1363 /* DECL_DEBUG_EXPR is copied explicitly by callers. */
1366 DECL_HAS_DEBUG_EXPR_P (t
) = 0;
1367 t
->decl_with_vis
.symtab_node
= NULL
;
1369 if (VAR_P (node
) && DECL_HAS_INIT_PRIORITY_P (node
))
1371 SET_DECL_INIT_PRIORITY (t
, DECL_INIT_PRIORITY (node
));
1372 DECL_HAS_INIT_PRIORITY_P (t
) = 1;
1374 if (TREE_CODE (node
) == FUNCTION_DECL
)
1376 DECL_STRUCT_FUNCTION (t
) = NULL
;
1377 t
->decl_with_vis
.symtab_node
= NULL
;
1380 else if (TREE_CODE_CLASS (code
) == tcc_type
)
1382 TYPE_UID (t
) = next_type_uid
++;
1383 /* The following is so that the debug code for
1384 the copy is different from the original type.
1385 The two statements usually duplicate each other
1386 (because they clear fields of the same union),
1387 but the optimizer should catch that. */
1388 TYPE_SYMTAB_ADDRESS (t
) = 0;
1389 TYPE_SYMTAB_DIE (t
) = 0;
1391 /* Do not copy the values cache. */
1392 if (TYPE_CACHED_VALUES_P (t
))
1394 TYPE_CACHED_VALUES_P (t
) = 0;
1395 TYPE_CACHED_VALUES (t
) = NULL_TREE
;
1398 else if (code
== TARGET_OPTION_NODE
)
1400 TREE_TARGET_OPTION (t
) = ggc_alloc
<struct cl_target_option
>();
1401 memcpy (TREE_TARGET_OPTION (t
), TREE_TARGET_OPTION (node
),
1402 sizeof (struct cl_target_option
));
1404 else if (code
== OPTIMIZATION_NODE
)
1406 TREE_OPTIMIZATION (t
) = ggc_alloc
<struct cl_optimization
>();
1407 memcpy (TREE_OPTIMIZATION (t
), TREE_OPTIMIZATION (node
),
1408 sizeof (struct cl_optimization
));
1414 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
1415 For example, this can copy a list made of TREE_LIST nodes. */
1418 copy_list (tree list
)
1426 head
= prev
= copy_node (list
);
1427 next
= TREE_CHAIN (list
);
1430 TREE_CHAIN (prev
) = copy_node (next
);
1431 prev
= TREE_CHAIN (prev
);
1432 next
= TREE_CHAIN (next
);
1438 /* Return the value that TREE_INT_CST_EXT_NUNITS should have for an
1439 INTEGER_CST with value CST and type TYPE. */
1442 get_int_cst_ext_nunits (tree type
, const wide_int
&cst
)
1444 gcc_checking_assert (cst
.get_precision () == TYPE_PRECISION (type
));
1445 /* We need extra HWIs if CST is an unsigned integer with its
1447 if (TYPE_UNSIGNED (type
) && wi::neg_p (cst
))
1448 return cst
.get_precision () / HOST_BITS_PER_WIDE_INT
+ 1;
1449 return cst
.get_len ();
1452 /* Return a new INTEGER_CST with value CST and type TYPE. */
1455 build_new_int_cst (tree type
, const wide_int
&cst
)
1457 unsigned int len
= cst
.get_len ();
1458 unsigned int ext_len
= get_int_cst_ext_nunits (type
, cst
);
1459 tree nt
= make_int_cst (len
, ext_len
);
1464 TREE_INT_CST_ELT (nt
, ext_len
)
1465 = zext_hwi (-1, cst
.get_precision () % HOST_BITS_PER_WIDE_INT
);
1466 for (unsigned int i
= len
; i
< ext_len
; ++i
)
1467 TREE_INT_CST_ELT (nt
, i
) = -1;
1469 else if (TYPE_UNSIGNED (type
)
1470 && cst
.get_precision () < len
* HOST_BITS_PER_WIDE_INT
)
1473 TREE_INT_CST_ELT (nt
, len
)
1474 = zext_hwi (cst
.elt (len
),
1475 cst
.get_precision () % HOST_BITS_PER_WIDE_INT
);
1478 for (unsigned int i
= 0; i
< len
; i
++)
1479 TREE_INT_CST_ELT (nt
, i
) = cst
.elt (i
);
1480 TREE_TYPE (nt
) = type
;
1484 /* Return a new POLY_INT_CST with coefficients COEFFS and type TYPE. */
1487 build_new_poly_int_cst (tree type
, tree (&coeffs
)[NUM_POLY_INT_COEFFS
]
1490 size_t length
= sizeof (struct tree_poly_int_cst
);
1491 record_node_allocation_statistics (POLY_INT_CST
, length
);
1493 tree t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
1495 TREE_SET_CODE (t
, POLY_INT_CST
);
1496 TREE_CONSTANT (t
) = 1;
1497 TREE_TYPE (t
) = type
;
1498 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
1499 POLY_INT_CST_COEFF (t
, i
) = coeffs
[i
];
1503 /* Create a constant tree that contains CST sign-extended to TYPE. */
1506 build_int_cst (tree type
, poly_int64 cst
)
1508 /* Support legacy code. */
1510 type
= integer_type_node
;
1512 return wide_int_to_tree (type
, wi::shwi (cst
, TYPE_PRECISION (type
)));
1515 /* Create a constant tree that contains CST zero-extended to TYPE. */
1518 build_int_cstu (tree type
, poly_uint64 cst
)
1520 return wide_int_to_tree (type
, wi::uhwi (cst
, TYPE_PRECISION (type
)));
1523 /* Create a constant tree that contains CST sign-extended to TYPE. */
1526 build_int_cst_type (tree type
, poly_int64 cst
)
1529 return wide_int_to_tree (type
, wi::shwi (cst
, TYPE_PRECISION (type
)));
1532 /* Constructs tree in type TYPE from with value given by CST. Signedness
1533 of CST is assumed to be the same as the signedness of TYPE. */
1536 double_int_to_tree (tree type
, double_int cst
)
1538 return wide_int_to_tree (type
, widest_int::from (cst
, TYPE_SIGN (type
)));
1541 /* We force the wide_int CST to the range of the type TYPE by sign or
1542 zero extending it. OVERFLOWABLE indicates if we are interested in
1543 overflow of the value, when >0 we are only interested in signed
1544 overflow, for <0 we are interested in any overflow. OVERFLOWED
1545 indicates whether overflow has already occurred. CONST_OVERFLOWED
1546 indicates whether constant overflow has already occurred. We force
1547 T's value to be within range of T's type (by setting to 0 or 1 all
1548 the bits outside the type's range). We set TREE_OVERFLOWED if,
1549 OVERFLOWED is nonzero,
1550 or OVERFLOWABLE is >0 and signed overflow occurs
1551 or OVERFLOWABLE is <0 and any overflow occurs
1552 We return a new tree node for the extended wide_int. The node
1553 is shared if no overflow flags are set. */
1557 force_fit_type (tree type
, const poly_wide_int_ref
&cst
,
1558 int overflowable
, bool overflowed
)
1560 signop sign
= TYPE_SIGN (type
);
1562 /* If we need to set overflow flags, return a new unshared node. */
1563 if (overflowed
|| !wi::fits_to_tree_p (cst
, type
))
1567 || (overflowable
> 0 && sign
== SIGNED
))
1569 poly_wide_int tmp
= poly_wide_int::from (cst
, TYPE_PRECISION (type
),
1572 if (tmp
.is_constant ())
1573 t
= build_new_int_cst (type
, tmp
.coeffs
[0]);
1576 tree coeffs
[NUM_POLY_INT_COEFFS
];
1577 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
1579 coeffs
[i
] = build_new_int_cst (type
, tmp
.coeffs
[i
]);
1580 TREE_OVERFLOW (coeffs
[i
]) = 1;
1582 t
= build_new_poly_int_cst (type
, coeffs
);
1584 TREE_OVERFLOW (t
) = 1;
1589 /* Else build a shared node. */
1590 return wide_int_to_tree (type
, cst
);
1593 /* These are the hash table functions for the hash table of INTEGER_CST
1594 nodes of a sizetype. */
1596 /* Return the hash code X, an INTEGER_CST. */
1599 int_cst_hasher::hash (tree x
)
1601 const_tree
const t
= x
;
1602 hashval_t code
= TYPE_UID (TREE_TYPE (t
));
1605 for (i
= 0; i
< TREE_INT_CST_NUNITS (t
); i
++)
1606 code
= iterative_hash_host_wide_int (TREE_INT_CST_ELT(t
, i
), code
);
1611 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
1612 is the same as that given by *Y, which is the same. */
1615 int_cst_hasher::equal (tree x
, tree y
)
1617 const_tree
const xt
= x
;
1618 const_tree
const yt
= y
;
1620 if (TREE_TYPE (xt
) != TREE_TYPE (yt
)
1621 || TREE_INT_CST_NUNITS (xt
) != TREE_INT_CST_NUNITS (yt
)
1622 || TREE_INT_CST_EXT_NUNITS (xt
) != TREE_INT_CST_EXT_NUNITS (yt
))
1625 for (int i
= 0; i
< TREE_INT_CST_NUNITS (xt
); i
++)
1626 if (TREE_INT_CST_ELT (xt
, i
) != TREE_INT_CST_ELT (yt
, i
))
1632 /* Cache wide_int CST into the TYPE_CACHED_VALUES cache for TYPE.
1633 SLOT is the slot entry to store it in, and MAX_SLOTS is the maximum
1634 number of slots that can be cached for the type. */
1637 cache_wide_int_in_type_cache (tree type
, const wide_int
&cst
,
1638 int slot
, int max_slots
)
1640 gcc_checking_assert (slot
>= 0);
1641 /* Initialize cache. */
1642 if (!TYPE_CACHED_VALUES_P (type
))
1644 TYPE_CACHED_VALUES_P (type
) = 1;
1645 TYPE_CACHED_VALUES (type
) = make_tree_vec (max_slots
);
1647 tree t
= TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), slot
);
1650 /* Create a new shared int. */
1651 t
= build_new_int_cst (type
, cst
);
1652 TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), slot
) = t
;
1657 /* Create an INT_CST node of TYPE and value CST.
1658 The returned node is always shared. For small integers we use a
1659 per-type vector cache, for larger ones we use a single hash table.
1660 The value is extended from its precision according to the sign of
1661 the type to be a multiple of HOST_BITS_PER_WIDE_INT. This defines
1662 the upper bits and ensures that hashing and value equality based
1663 upon the underlying HOST_WIDE_INTs works without masking. */
1666 wide_int_to_tree_1 (tree type
, const wide_int_ref
&pcst
)
1673 unsigned int prec
= TYPE_PRECISION (type
);
1674 signop sgn
= TYPE_SIGN (type
);
1676 /* Verify that everything is canonical. */
1677 int l
= pcst
.get_len ();
1680 if (pcst
.elt (l
- 1) == 0)
1681 gcc_checking_assert (pcst
.elt (l
- 2) < 0);
1682 if (pcst
.elt (l
- 1) == HOST_WIDE_INT_M1
)
1683 gcc_checking_assert (pcst
.elt (l
- 2) >= 0);
1686 wide_int cst
= wide_int::from (pcst
, prec
, sgn
);
1687 unsigned int ext_len
= get_int_cst_ext_nunits (type
, cst
);
1689 enum tree_code code
= TREE_CODE (type
);
1690 if (code
== POINTER_TYPE
|| code
== REFERENCE_TYPE
)
1692 /* Cache NULL pointer and zero bounds. */
1695 /* Cache upper bounds of pointers. */
1696 else if (cst
== wi::max_value (prec
, sgn
))
1698 /* Cache 1 which is used for a non-zero range. */
1704 t
= cache_wide_int_in_type_cache (type
, cst
, ix
, 3);
1705 /* Make sure no one is clobbering the shared constant. */
1706 gcc_checking_assert (TREE_TYPE (t
) == type
1707 && cst
== wi::to_wide (t
));
1713 /* We just need to store a single HOST_WIDE_INT. */
1715 if (TYPE_UNSIGNED (type
))
1716 hwi
= cst
.to_uhwi ();
1718 hwi
= cst
.to_shwi ();
1723 gcc_assert (hwi
== 0);
1727 case REFERENCE_TYPE
:
1728 /* Ignore pointers, as they were already handled above. */
1732 /* Cache false or true. */
1734 if (IN_RANGE (hwi
, 0, 1))
1741 if (TYPE_SIGN (type
) == UNSIGNED
)
1744 limit
= param_integer_share_limit
;
1745 if (IN_RANGE (hwi
, 0, param_integer_share_limit
- 1))
1750 /* Cache [-1, N). */
1751 limit
= param_integer_share_limit
+ 1;
1752 if (IN_RANGE (hwi
, -1, param_integer_share_limit
- 1))
1766 t
= cache_wide_int_in_type_cache (type
, cst
, ix
, limit
);
1767 /* Make sure no one is clobbering the shared constant. */
1768 gcc_checking_assert (TREE_TYPE (t
) == type
1769 && TREE_INT_CST_NUNITS (t
) == 1
1770 && TREE_INT_CST_EXT_NUNITS (t
) == 1
1771 && TREE_INT_CST_ELT (t
, 0) == hwi
);
1776 /* Use the cache of larger shared ints, using int_cst_node as
1779 TREE_INT_CST_ELT (int_cst_node
, 0) = hwi
;
1780 TREE_TYPE (int_cst_node
) = type
;
1782 tree
*slot
= int_cst_hash_table
->find_slot (int_cst_node
, INSERT
);
1786 /* Insert this one into the hash table. */
1789 /* Make a new node for next time round. */
1790 int_cst_node
= make_int_cst (1, 1);
1796 /* The value either hashes properly or we drop it on the floor
1797 for the gc to take care of. There will not be enough of them
1800 tree nt
= build_new_int_cst (type
, cst
);
1801 tree
*slot
= int_cst_hash_table
->find_slot (nt
, INSERT
);
1805 /* Insert this one into the hash table. */
1817 poly_int_cst_hasher::hash (tree t
)
1819 inchash::hash hstate
;
1821 hstate
.add_int (TYPE_UID (TREE_TYPE (t
)));
1822 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
1823 hstate
.add_wide_int (wi::to_wide (POLY_INT_CST_COEFF (t
, i
)));
1825 return hstate
.end ();
1829 poly_int_cst_hasher::equal (tree x
, const compare_type
&y
)
1831 if (TREE_TYPE (x
) != y
.first
)
1833 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
1834 if (wi::to_wide (POLY_INT_CST_COEFF (x
, i
)) != y
.second
->coeffs
[i
])
1839 /* Build a POLY_INT_CST node with type TYPE and with the elements in VALUES.
1840 The elements must also have type TYPE. */
1843 build_poly_int_cst (tree type
, const poly_wide_int_ref
&values
)
1845 unsigned int prec
= TYPE_PRECISION (type
);
1846 gcc_assert (prec
<= values
.coeffs
[0].get_precision ());
1847 poly_wide_int c
= poly_wide_int::from (values
, prec
, SIGNED
);
1850 h
.add_int (TYPE_UID (type
));
1851 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
1852 h
.add_wide_int (c
.coeffs
[i
]);
1853 poly_int_cst_hasher::compare_type
comp (type
, &c
);
1854 tree
*slot
= poly_int_cst_hash_table
->find_slot_with_hash (comp
, h
.end (),
1856 if (*slot
== NULL_TREE
)
1858 tree coeffs
[NUM_POLY_INT_COEFFS
];
1859 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
1860 coeffs
[i
] = wide_int_to_tree_1 (type
, c
.coeffs
[i
]);
1861 *slot
= build_new_poly_int_cst (type
, coeffs
);
1866 /* Create a constant tree with value VALUE in type TYPE. */
1869 wide_int_to_tree (tree type
, const poly_wide_int_ref
&value
)
1871 if (value
.is_constant ())
1872 return wide_int_to_tree_1 (type
, value
.coeffs
[0]);
1873 return build_poly_int_cst (type
, value
);
1876 /* Insert INTEGER_CST T into a cache of integer constants. And return
1877 the cached constant (which may or may not be T). If MIGHT_DUPLICATE
1878 is false, and T falls into the type's 'smaller values' range, there
1879 cannot be an existing entry. Otherwise, if MIGHT_DUPLICATE is true,
1880 or the value is large, should an existing entry exist, it is
1881 returned (rather than inserting T). */
1884 cache_integer_cst (tree t
, bool might_duplicate ATTRIBUTE_UNUSED
)
1886 tree type
= TREE_TYPE (t
);
1889 int prec
= TYPE_PRECISION (type
);
1891 gcc_assert (!TREE_OVERFLOW (t
));
1893 /* The caching indices here must match those in
1894 wide_int_to_type_1. */
1895 switch (TREE_CODE (type
))
1898 gcc_checking_assert (integer_zerop (t
));
1902 case REFERENCE_TYPE
:
1904 if (integer_zerop (t
))
1906 else if (integer_onep (t
))
1915 /* Cache false or true. */
1917 if (wi::ltu_p (wi::to_wide (t
), 2))
1918 ix
= TREE_INT_CST_ELT (t
, 0);
1924 if (TYPE_UNSIGNED (type
))
1927 limit
= param_integer_share_limit
;
1929 /* This is a little hokie, but if the prec is smaller than
1930 what is necessary to hold param_integer_share_limit, then the
1931 obvious test will not get the correct answer. */
1932 if (prec
< HOST_BITS_PER_WIDE_INT
)
1934 if (tree_to_uhwi (t
)
1935 < (unsigned HOST_WIDE_INT
) param_integer_share_limit
)
1936 ix
= tree_to_uhwi (t
);
1938 else if (wi::ltu_p (wi::to_wide (t
), param_integer_share_limit
))
1939 ix
= tree_to_uhwi (t
);
1944 limit
= param_integer_share_limit
+ 1;
1946 if (integer_minus_onep (t
))
1948 else if (!wi::neg_p (wi::to_wide (t
)))
1950 if (prec
< HOST_BITS_PER_WIDE_INT
)
1952 if (tree_to_shwi (t
) < param_integer_share_limit
)
1953 ix
= tree_to_shwi (t
) + 1;
1955 else if (wi::ltu_p (wi::to_wide (t
), param_integer_share_limit
))
1956 ix
= tree_to_shwi (t
) + 1;
1962 /* The slot used by TYPE_CACHED_VALUES is used for the enum
1972 /* Look for it in the type's vector of small shared ints. */
1973 if (!TYPE_CACHED_VALUES_P (type
))
1975 TYPE_CACHED_VALUES_P (type
) = 1;
1976 TYPE_CACHED_VALUES (type
) = make_tree_vec (limit
);
1979 if (tree r
= TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
))
1981 gcc_checking_assert (might_duplicate
);
1985 TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) = t
;
1989 /* Use the cache of larger shared ints. */
1990 tree
*slot
= int_cst_hash_table
->find_slot (t
, INSERT
);
1993 /* If there is already an entry for the number verify it's the
1995 gcc_checking_assert (wi::to_wide (tree (r
)) == wi::to_wide (t
));
1996 /* And return the cached value. */
2000 /* Otherwise insert this one into the hash table. */
2008 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
2009 and the rest are zeros. */
2012 build_low_bits_mask (tree type
, unsigned bits
)
2014 gcc_assert (bits
<= TYPE_PRECISION (type
));
2016 return wide_int_to_tree (type
, wi::mask (bits
, false,
2017 TYPE_PRECISION (type
)));
2020 /* Checks that X is integer constant that can be expressed in (unsigned)
2021 HOST_WIDE_INT without loss of precision. */
2024 cst_and_fits_in_hwi (const_tree x
)
2026 return (TREE_CODE (x
) == INTEGER_CST
2027 && (tree_fits_shwi_p (x
) || tree_fits_uhwi_p (x
)));
2030 /* Build a newly constructed VECTOR_CST with the given values of
2031 (VECTOR_CST_)LOG2_NPATTERNS and (VECTOR_CST_)NELTS_PER_PATTERN. */
2034 make_vector (unsigned log2_npatterns
,
2035 unsigned int nelts_per_pattern MEM_STAT_DECL
)
2037 gcc_assert (IN_RANGE (nelts_per_pattern
, 1, 3));
2039 unsigned npatterns
= 1 << log2_npatterns
;
2040 unsigned encoded_nelts
= npatterns
* nelts_per_pattern
;
2041 unsigned length
= (sizeof (struct tree_vector
)
2042 + (encoded_nelts
- 1) * sizeof (tree
));
2044 record_node_allocation_statistics (VECTOR_CST
, length
);
2046 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
2048 TREE_SET_CODE (t
, VECTOR_CST
);
2049 TREE_CONSTANT (t
) = 1;
2050 VECTOR_CST_LOG2_NPATTERNS (t
) = log2_npatterns
;
2051 VECTOR_CST_NELTS_PER_PATTERN (t
) = nelts_per_pattern
;
2056 /* Return a new VECTOR_CST node whose type is TYPE and whose values
2057 are extracted from V, a vector of CONSTRUCTOR_ELT. */
2060 build_vector_from_ctor (tree type
, const vec
<constructor_elt
, va_gc
> *v
)
2062 if (vec_safe_length (v
) == 0)
2063 return build_zero_cst (type
);
2065 unsigned HOST_WIDE_INT idx
, nelts
;
2068 /* We can't construct a VECTOR_CST for a variable number of elements. */
2069 nelts
= TYPE_VECTOR_SUBPARTS (type
).to_constant ();
2070 tree_vector_builder
vec (type
, nelts
, 1);
2071 FOR_EACH_CONSTRUCTOR_VALUE (v
, idx
, value
)
2073 if (TREE_CODE (value
) == VECTOR_CST
)
2075 /* If NELTS is constant then this must be too. */
2076 unsigned int sub_nelts
= VECTOR_CST_NELTS (value
).to_constant ();
2077 for (unsigned i
= 0; i
< sub_nelts
; ++i
)
2078 vec
.quick_push (VECTOR_CST_ELT (value
, i
));
2081 vec
.quick_push (value
);
2083 while (vec
.length () < nelts
)
2084 vec
.quick_push (build_zero_cst (TREE_TYPE (type
)));
2086 return vec
.build ();
2089 /* Build a vector of type VECTYPE where all the elements are SCs. */
2091 build_vector_from_val (tree vectype
, tree sc
)
2093 unsigned HOST_WIDE_INT i
, nunits
;
2095 if (sc
== error_mark_node
)
2098 /* Verify that the vector type is suitable for SC. Note that there
2099 is some inconsistency in the type-system with respect to restrict
2100 qualifications of pointers. Vector types always have a main-variant
2101 element type and the qualification is applied to the vector-type.
2102 So TREE_TYPE (vector-type) does not return a properly qualified
2103 vector element-type. */
2104 gcc_checking_assert (types_compatible_p (TYPE_MAIN_VARIANT (TREE_TYPE (sc
)),
2105 TREE_TYPE (vectype
)));
2107 if (CONSTANT_CLASS_P (sc
))
2109 tree_vector_builder
v (vectype
, 1, 1);
2113 else if (!TYPE_VECTOR_SUBPARTS (vectype
).is_constant (&nunits
))
2114 return fold_build1 (VEC_DUPLICATE_EXPR
, vectype
, sc
);
2117 vec
<constructor_elt
, va_gc
> *v
;
2118 vec_alloc (v
, nunits
);
2119 for (i
= 0; i
< nunits
; ++i
)
2120 CONSTRUCTOR_APPEND_ELT (v
, NULL_TREE
, sc
);
2121 return build_constructor (vectype
, v
);
2125 /* If TYPE is not a vector type, just return SC, otherwise return
2126 build_vector_from_val (TYPE, SC). */
2129 build_uniform_cst (tree type
, tree sc
)
2131 if (!VECTOR_TYPE_P (type
))
2134 return build_vector_from_val (type
, sc
);
2137 /* Build a vector series of type TYPE in which element I has the value
2138 BASE + I * STEP. The result is a constant if BASE and STEP are constant
2139 and a VEC_SERIES_EXPR otherwise. */
2142 build_vec_series (tree type
, tree base
, tree step
)
2144 if (integer_zerop (step
))
2145 return build_vector_from_val (type
, base
);
2146 if (TREE_CODE (base
) == INTEGER_CST
&& TREE_CODE (step
) == INTEGER_CST
)
2148 tree_vector_builder
builder (type
, 1, 3);
2149 tree elt1
= wide_int_to_tree (TREE_TYPE (base
),
2150 wi::to_wide (base
) + wi::to_wide (step
));
2151 tree elt2
= wide_int_to_tree (TREE_TYPE (base
),
2152 wi::to_wide (elt1
) + wi::to_wide (step
));
2153 builder
.quick_push (base
);
2154 builder
.quick_push (elt1
);
2155 builder
.quick_push (elt2
);
2156 return builder
.build ();
2158 return build2 (VEC_SERIES_EXPR
, type
, base
, step
);
2161 /* Return a vector with the same number of units and number of bits
2162 as VEC_TYPE, but in which the elements are a linear series of unsigned
2163 integers { BASE, BASE + STEP, BASE + STEP * 2, ... }. */
2166 build_index_vector (tree vec_type
, poly_uint64 base
, poly_uint64 step
)
2168 tree index_vec_type
= vec_type
;
2169 tree index_elt_type
= TREE_TYPE (vec_type
);
2170 poly_uint64 nunits
= TYPE_VECTOR_SUBPARTS (vec_type
);
2171 if (!INTEGRAL_TYPE_P (index_elt_type
) || !TYPE_UNSIGNED (index_elt_type
))
2173 index_elt_type
= build_nonstandard_integer_type
2174 (GET_MODE_BITSIZE (SCALAR_TYPE_MODE (index_elt_type
)), true);
2175 index_vec_type
= build_vector_type (index_elt_type
, nunits
);
2178 tree_vector_builder
v (index_vec_type
, 1, 3);
2179 for (unsigned int i
= 0; i
< 3; ++i
)
2180 v
.quick_push (build_int_cstu (index_elt_type
, base
+ i
* step
));
2184 /* Return a VECTOR_CST of type VEC_TYPE in which the first NUM_A
2185 elements are A and the rest are B. */
2188 build_vector_a_then_b (tree vec_type
, unsigned int num_a
, tree a
, tree b
)
2190 gcc_assert (known_le (num_a
, TYPE_VECTOR_SUBPARTS (vec_type
)));
2191 unsigned int count
= constant_lower_bound (TYPE_VECTOR_SUBPARTS (vec_type
));
2192 /* Optimize the constant case. */
2193 if ((count
& 1) == 0 && TYPE_VECTOR_SUBPARTS (vec_type
).is_constant ())
2195 tree_vector_builder
builder (vec_type
, count
, 2);
2196 for (unsigned int i
= 0; i
< count
* 2; ++i
)
2197 builder
.quick_push (i
< num_a
? a
: b
);
2198 return builder
.build ();
2201 /* Something has messed with the elements of CONSTRUCTOR C after it was built;
2202 calculate TREE_CONSTANT and TREE_SIDE_EFFECTS. */
2205 recompute_constructor_flags (tree c
)
2209 bool constant_p
= true;
2210 bool side_effects_p
= false;
2211 vec
<constructor_elt
, va_gc
> *vals
= CONSTRUCTOR_ELTS (c
);
2213 FOR_EACH_CONSTRUCTOR_VALUE (vals
, i
, val
)
2215 /* Mostly ctors will have elts that don't have side-effects, so
2216 the usual case is to scan all the elements. Hence a single
2217 loop for both const and side effects, rather than one loop
2218 each (with early outs). */
2219 if (!TREE_CONSTANT (val
))
2221 if (TREE_SIDE_EFFECTS (val
))
2222 side_effects_p
= true;
2225 TREE_SIDE_EFFECTS (c
) = side_effects_p
;
2226 TREE_CONSTANT (c
) = constant_p
;
2229 /* Make sure that TREE_CONSTANT and TREE_SIDE_EFFECTS are correct for
2233 verify_constructor_flags (tree c
)
2237 bool constant_p
= TREE_CONSTANT (c
);
2238 bool side_effects_p
= TREE_SIDE_EFFECTS (c
);
2239 vec
<constructor_elt
, va_gc
> *vals
= CONSTRUCTOR_ELTS (c
);
2241 FOR_EACH_CONSTRUCTOR_VALUE (vals
, i
, val
)
2243 if (constant_p
&& !TREE_CONSTANT (val
))
2244 internal_error ("non-constant element in constant CONSTRUCTOR");
2245 if (!side_effects_p
&& TREE_SIDE_EFFECTS (val
))
2246 internal_error ("side-effects element in no-side-effects CONSTRUCTOR");
2250 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
2251 are in the vec pointed to by VALS. */
2253 build_constructor (tree type
, vec
<constructor_elt
, va_gc
> *vals MEM_STAT_DECL
)
2255 tree c
= make_node (CONSTRUCTOR PASS_MEM_STAT
);
2257 TREE_TYPE (c
) = type
;
2258 CONSTRUCTOR_ELTS (c
) = vals
;
2260 recompute_constructor_flags (c
);
2265 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
2268 build_constructor_single (tree type
, tree index
, tree value
)
2270 vec
<constructor_elt
, va_gc
> *v
;
2271 constructor_elt elt
= {index
, value
};
2274 v
->quick_push (elt
);
2276 return build_constructor (type
, v
);
2280 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
2281 are in a list pointed to by VALS. */
2283 build_constructor_from_list (tree type
, tree vals
)
2286 vec
<constructor_elt
, va_gc
> *v
= NULL
;
2290 vec_alloc (v
, list_length (vals
));
2291 for (t
= vals
; t
; t
= TREE_CHAIN (t
))
2292 CONSTRUCTOR_APPEND_ELT (v
, TREE_PURPOSE (t
), TREE_VALUE (t
));
2295 return build_constructor (type
, v
);
2298 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
2299 are in a vector pointed to by VALS. Note that the TREE_PURPOSE
2300 fields in the constructor remain null. */
2303 build_constructor_from_vec (tree type
, const vec
<tree
, va_gc
> *vals
)
2305 vec
<constructor_elt
, va_gc
> *v
= NULL
;
2308 CONSTRUCTOR_APPEND_ELT (v
, NULL_TREE
, t
);
2310 return build_constructor (type
, v
);
2313 /* Return a new CONSTRUCTOR node whose type is TYPE. NELTS is the number
2314 of elements, provided as index/value pairs. */
2317 build_constructor_va (tree type
, int nelts
, ...)
2319 vec
<constructor_elt
, va_gc
> *v
= NULL
;
2322 va_start (p
, nelts
);
2323 vec_alloc (v
, nelts
);
2326 tree index
= va_arg (p
, tree
);
2327 tree value
= va_arg (p
, tree
);
2328 CONSTRUCTOR_APPEND_ELT (v
, index
, value
);
2331 return build_constructor (type
, v
);
2334 /* Return a node of type TYPE for which TREE_CLOBBER_P is true. */
2337 build_clobber (tree type
, enum clobber_kind kind
)
2339 tree clobber
= build_constructor (type
, NULL
);
2340 TREE_THIS_VOLATILE (clobber
) = true;
2341 CLOBBER_KIND (clobber
) = kind
;
2345 /* Return a new FIXED_CST node whose type is TYPE and value is F. */
2348 build_fixed (tree type
, FIXED_VALUE_TYPE f
)
2351 FIXED_VALUE_TYPE
*fp
;
2353 v
= make_node (FIXED_CST
);
2354 fp
= ggc_alloc
<fixed_value
> ();
2355 memcpy (fp
, &f
, sizeof (FIXED_VALUE_TYPE
));
2357 TREE_TYPE (v
) = type
;
2358 TREE_FIXED_CST_PTR (v
) = fp
;
2362 /* Return a new REAL_CST node whose type is TYPE and value is D. */
2365 build_real (tree type
, REAL_VALUE_TYPE d
)
2370 /* dconst{0,1,2,m1,half} are used in various places in
2371 the middle-end and optimizers, allow them here
2372 even for decimal floating point types as an exception
2373 by converting them to decimal. */
2374 if (DECIMAL_FLOAT_MODE_P (TYPE_MODE (type
))
2375 && (d
.cl
== rvc_normal
|| d
.cl
== rvc_zero
)
2378 if (memcmp (&d
, &dconst1
, sizeof (d
)) == 0)
2379 decimal_real_from_string (&d
, "1");
2380 else if (memcmp (&d
, &dconst2
, sizeof (d
)) == 0)
2381 decimal_real_from_string (&d
, "2");
2382 else if (memcmp (&d
, &dconstm1
, sizeof (d
)) == 0)
2383 decimal_real_from_string (&d
, "-1");
2384 else if (memcmp (&d
, &dconsthalf
, sizeof (d
)) == 0)
2385 decimal_real_from_string (&d
, "0.5");
2386 else if (memcmp (&d
, &dconst0
, sizeof (d
)) == 0)
2388 /* Make sure to give zero the minimum quantum exponent for
2389 the type (which corresponds to all bits zero). */
2390 const struct real_format
*fmt
= REAL_MODE_FORMAT (TYPE_MODE (type
));
2392 sprintf (buf
, "0e%d", fmt
->emin
- fmt
->p
);
2393 decimal_real_from_string (&d
, buf
);
2399 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
2400 Consider doing it via real_convert now. */
2402 v
= make_node (REAL_CST
);
2403 TREE_TYPE (v
) = type
;
2404 memcpy (TREE_REAL_CST_PTR (v
), &d
, sizeof (REAL_VALUE_TYPE
));
2405 TREE_OVERFLOW (v
) = overflow
;
2409 /* Like build_real, but first truncate D to the type. */
2412 build_real_truncate (tree type
, REAL_VALUE_TYPE d
)
2414 return build_real (type
, real_value_truncate (TYPE_MODE (type
), d
));
2417 /* Return a new REAL_CST node whose type is TYPE
2418 and whose value is the integer value of the INTEGER_CST node I. */
2421 real_value_from_int_cst (const_tree type
, const_tree i
)
2425 /* Clear all bits of the real value type so that we can later do
2426 bitwise comparisons to see if two values are the same. */
2427 memset (&d
, 0, sizeof d
);
2429 real_from_integer (&d
, type
? TYPE_MODE (type
) : VOIDmode
, wi::to_wide (i
),
2430 TYPE_SIGN (TREE_TYPE (i
)));
2434 /* Given a tree representing an integer constant I, return a tree
2435 representing the same value as a floating-point constant of type TYPE. */
2438 build_real_from_int_cst (tree type
, const_tree i
)
2441 int overflow
= TREE_OVERFLOW (i
);
2443 v
= build_real (type
, real_value_from_int_cst (type
, i
));
2445 TREE_OVERFLOW (v
) |= overflow
;
2449 /* Return a new REAL_CST node whose type is TYPE
2450 and whose value is the integer value I which has sign SGN. */
2453 build_real_from_wide (tree type
, const wide_int_ref
&i
, signop sgn
)
2457 /* Clear all bits of the real value type so that we can later do
2458 bitwise comparisons to see if two values are the same. */
2459 memset (&d
, 0, sizeof d
);
2461 real_from_integer (&d
, TYPE_MODE (type
), i
, sgn
);
2462 return build_real (type
, d
);
2465 /* Return a newly constructed STRING_CST node whose value is the LEN
2466 characters at STR when STR is nonnull, or all zeros otherwise.
2467 Note that for a C string literal, LEN should include the trailing NUL.
2468 The TREE_TYPE is not initialized. */
2471 build_string (unsigned len
, const char *str
/*= NULL */)
2473 /* Do not waste bytes provided by padding of struct tree_string. */
2474 unsigned size
= len
+ offsetof (struct tree_string
, str
) + 1;
2476 record_node_allocation_statistics (STRING_CST
, size
);
2478 tree s
= (tree
) ggc_internal_alloc (size
);
2480 memset (s
, 0, sizeof (struct tree_typed
));
2481 TREE_SET_CODE (s
, STRING_CST
);
2482 TREE_CONSTANT (s
) = 1;
2483 TREE_STRING_LENGTH (s
) = len
;
2485 memcpy (s
->string
.str
, str
, len
);
2487 memset (s
->string
.str
, 0, len
);
2488 s
->string
.str
[len
] = '\0';
2493 /* Return a newly constructed COMPLEX_CST node whose value is
2494 specified by the real and imaginary parts REAL and IMAG.
2495 Both REAL and IMAG should be constant nodes. TYPE, if specified,
2496 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
2499 build_complex (tree type
, tree real
, tree imag
)
2501 gcc_assert (CONSTANT_CLASS_P (real
));
2502 gcc_assert (CONSTANT_CLASS_P (imag
));
2504 tree t
= make_node (COMPLEX_CST
);
2506 TREE_REALPART (t
) = real
;
2507 TREE_IMAGPART (t
) = imag
;
2508 TREE_TYPE (t
) = type
? type
: build_complex_type (TREE_TYPE (real
));
2509 TREE_OVERFLOW (t
) = TREE_OVERFLOW (real
) | TREE_OVERFLOW (imag
);
2513 /* Build a complex (inf +- 0i), such as for the result of cproj.
2514 TYPE is the complex tree type of the result. If NEG is true, the
2515 imaginary zero is negative. */
2518 build_complex_inf (tree type
, bool neg
)
2520 REAL_VALUE_TYPE rzero
= dconst0
;
2523 return build_complex (type
, build_real (TREE_TYPE (type
), dconstinf
),
2524 build_real (TREE_TYPE (type
), rzero
));
2527 /* Return the constant 1 in type TYPE. If TYPE has several elements, each
2528 element is set to 1. In particular, this is 1 + i for complex types. */
2531 build_each_one_cst (tree type
)
2533 if (TREE_CODE (type
) == COMPLEX_TYPE
)
2535 tree scalar
= build_one_cst (TREE_TYPE (type
));
2536 return build_complex (type
, scalar
, scalar
);
2539 return build_one_cst (type
);
2542 /* Return a constant of arithmetic type TYPE which is the
2543 multiplicative identity of the set TYPE. */
2546 build_one_cst (tree type
)
2548 switch (TREE_CODE (type
))
2550 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
2551 case POINTER_TYPE
: case REFERENCE_TYPE
:
2552 case OFFSET_TYPE
: case BITINT_TYPE
:
2553 return build_int_cst (type
, 1);
2556 return build_real (type
, dconst1
);
2558 case FIXED_POINT_TYPE
:
2559 /* We can only generate 1 for accum types. */
2560 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type
)));
2561 return build_fixed (type
, FCONST1 (TYPE_MODE (type
)));
2565 tree scalar
= build_one_cst (TREE_TYPE (type
));
2567 return build_vector_from_val (type
, scalar
);
2571 return build_complex (type
,
2572 build_one_cst (TREE_TYPE (type
)),
2573 build_zero_cst (TREE_TYPE (type
)));
2580 /* Return an integer of type TYPE containing all 1's in as much precision as
2581 it contains, or a complex or vector whose subparts are such integers. */
2584 build_all_ones_cst (tree type
)
2586 if (TREE_CODE (type
) == COMPLEX_TYPE
)
2588 tree scalar
= build_all_ones_cst (TREE_TYPE (type
));
2589 return build_complex (type
, scalar
, scalar
);
2592 return build_minus_one_cst (type
);
2595 /* Return a constant of arithmetic type TYPE which is the
2596 opposite of the multiplicative identity of the set TYPE. */
2599 build_minus_one_cst (tree type
)
2601 switch (TREE_CODE (type
))
2603 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
2604 case POINTER_TYPE
: case REFERENCE_TYPE
:
2605 case OFFSET_TYPE
: case BITINT_TYPE
:
2606 return build_int_cst (type
, -1);
2609 return build_real (type
, dconstm1
);
2611 case FIXED_POINT_TYPE
:
2612 /* We can only generate 1 for accum types. */
2613 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type
)));
2614 return build_fixed (type
,
2615 fixed_from_double_int (double_int_minus_one
,
2616 SCALAR_TYPE_MODE (type
)));
2620 tree scalar
= build_minus_one_cst (TREE_TYPE (type
));
2622 return build_vector_from_val (type
, scalar
);
2626 return build_complex (type
,
2627 build_minus_one_cst (TREE_TYPE (type
)),
2628 build_zero_cst (TREE_TYPE (type
)));
2635 /* Build 0 constant of type TYPE. This is used by constructor folding
2636 and thus the constant should be represented in memory by
2640 build_zero_cst (tree type
)
2642 switch (TREE_CODE (type
))
2644 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
2645 case POINTER_TYPE
: case REFERENCE_TYPE
:
2646 case OFFSET_TYPE
: case NULLPTR_TYPE
: case BITINT_TYPE
:
2647 return build_int_cst (type
, 0);
2650 return build_real (type
, dconst0
);
2652 case FIXED_POINT_TYPE
:
2653 return build_fixed (type
, FCONST0 (TYPE_MODE (type
)));
2657 tree scalar
= build_zero_cst (TREE_TYPE (type
));
2659 return build_vector_from_val (type
, scalar
);
2664 tree zero
= build_zero_cst (TREE_TYPE (type
));
2666 return build_complex (type
, zero
, zero
);
2670 if (!AGGREGATE_TYPE_P (type
))
2671 return fold_convert (type
, integer_zero_node
);
2672 return build_constructor (type
, NULL
);
2676 /* Build a constant of integer type TYPE, made of VALUE's bits replicated
2677 every WIDTH bits to fit TYPE's precision. */
2680 build_replicated_int_cst (tree type
, unsigned int width
, HOST_WIDE_INT value
)
2682 int n
= ((TYPE_PRECISION (type
) + HOST_BITS_PER_WIDE_INT
- 1)
2683 / HOST_BITS_PER_WIDE_INT
);
2684 unsigned HOST_WIDE_INT low
, mask
;
2685 HOST_WIDE_INT a
[WIDE_INT_MAX_INL_ELTS
];
2688 gcc_assert (n
&& n
<= WIDE_INT_MAX_INL_ELTS
);
2690 if (width
== HOST_BITS_PER_WIDE_INT
)
2694 mask
= (HOST_WIDE_INT_1U
<< width
) - 1;
2695 low
= (unsigned HOST_WIDE_INT
) ~0 / mask
* (value
& mask
);
2698 for (i
= 0; i
< n
; i
++)
2701 gcc_assert (TYPE_PRECISION (type
) <= MAX_BITSIZE_MODE_ANY_INT
);
2702 return wide_int_to_tree (type
, wide_int::from_array (a
, n
,
2703 TYPE_PRECISION (type
)));
2706 /* If floating-point type TYPE has an IEEE-style sign bit, return an
2707 unsigned constant in which only the sign bit is set. Return null
2711 sign_mask_for (tree type
)
2713 /* Avoid having to choose between a real-only sign and a pair of signs.
2714 This could be relaxed if the choice becomes obvious later. */
2715 if (TREE_CODE (type
) == COMPLEX_TYPE
)
2718 auto eltmode
= as_a
<scalar_float_mode
> (element_mode (type
));
2719 auto bits
= REAL_MODE_FORMAT (eltmode
)->ieee_bits
;
2720 if (!bits
|| !pow2p_hwi (bits
))
2723 tree inttype
= unsigned_type_for (type
);
2727 auto mask
= wi::set_bit_in_zero (bits
- 1, bits
);
2728 if (VECTOR_TYPE_P (inttype
))
2730 tree elt
= wide_int_to_tree (TREE_TYPE (inttype
), mask
);
2731 return build_vector_from_val (inttype
, elt
);
2733 return wide_int_to_tree (inttype
, mask
);
2736 /* Build a BINFO with LEN language slots. */
2739 make_tree_binfo (unsigned base_binfos MEM_STAT_DECL
)
2742 size_t length
= (offsetof (struct tree_binfo
, base_binfos
)
2743 + vec
<tree
, va_gc
>::embedded_size (base_binfos
));
2745 record_node_allocation_statistics (TREE_BINFO
, length
);
2747 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
2749 memset (t
, 0, offsetof (struct tree_binfo
, base_binfos
));
2751 TREE_SET_CODE (t
, TREE_BINFO
);
2753 BINFO_BASE_BINFOS (t
)->embedded_init (base_binfos
);
2758 /* Create a CASE_LABEL_EXPR tree node and return it. */
2761 build_case_label (tree low_value
, tree high_value
, tree label_decl
)
2763 tree t
= make_node (CASE_LABEL_EXPR
);
2765 TREE_TYPE (t
) = void_type_node
;
2766 SET_EXPR_LOCATION (t
, DECL_SOURCE_LOCATION (label_decl
));
2768 CASE_LOW (t
) = low_value
;
2769 CASE_HIGH (t
) = high_value
;
2770 CASE_LABEL (t
) = label_decl
;
2771 CASE_CHAIN (t
) = NULL_TREE
;
2776 /* Build a newly constructed INTEGER_CST node. LEN and EXT_LEN are the
2777 values of TREE_INT_CST_NUNITS and TREE_INT_CST_EXT_NUNITS respectively.
2778 The latter determines the length of the HOST_WIDE_INT vector. */
2781 make_int_cst (int len
, int ext_len MEM_STAT_DECL
)
2784 int length
= ((ext_len
- 1) * sizeof (HOST_WIDE_INT
)
2785 + sizeof (struct tree_int_cst
));
2788 record_node_allocation_statistics (INTEGER_CST
, length
);
2790 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
2792 TREE_SET_CODE (t
, INTEGER_CST
);
2793 TREE_INT_CST_NUNITS (t
) = len
;
2794 TREE_INT_CST_EXT_NUNITS (t
) = ext_len
;
2795 TREE_CONSTANT (t
) = 1;
2800 /* Build a newly constructed TREE_VEC node of length LEN. */
2803 make_tree_vec (int len MEM_STAT_DECL
)
2806 size_t length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
2808 record_node_allocation_statistics (TREE_VEC
, length
);
2810 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
2812 TREE_SET_CODE (t
, TREE_VEC
);
2813 TREE_VEC_LENGTH (t
) = len
;
2818 /* Grow a TREE_VEC node to new length LEN. */
2821 grow_tree_vec (tree v
, int len MEM_STAT_DECL
)
2823 gcc_assert (TREE_CODE (v
) == TREE_VEC
);
2825 int oldlen
= TREE_VEC_LENGTH (v
);
2826 gcc_assert (len
> oldlen
);
2828 size_t oldlength
= (oldlen
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
2829 size_t length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
2831 record_node_allocation_statistics (TREE_VEC
, length
- oldlength
);
2833 v
= (tree
) ggc_realloc (v
, length PASS_MEM_STAT
);
2835 TREE_VEC_LENGTH (v
) = len
;
2840 /* Return true if EXPR is the constant zero, whether it is integral, float or
2841 fixed, and scalar, complex or vector. */
2844 zerop (const_tree expr
)
2846 return (integer_zerop (expr
)
2847 || real_zerop (expr
)
2848 || fixed_zerop (expr
));
2851 /* Return true if EXPR is the integer constant zero or a complex constant
2852 of zero, or a location wrapper for such a constant. */
2855 integer_zerop (const_tree expr
)
2857 STRIP_ANY_LOCATION_WRAPPER (expr
);
2859 switch (TREE_CODE (expr
))
2862 return wi::to_wide (expr
) == 0;
2864 return (integer_zerop (TREE_REALPART (expr
))
2865 && integer_zerop (TREE_IMAGPART (expr
)));
2867 return (VECTOR_CST_NPATTERNS (expr
) == 1
2868 && VECTOR_CST_DUPLICATE_P (expr
)
2869 && integer_zerop (VECTOR_CST_ENCODED_ELT (expr
, 0)));
2875 /* Return true if EXPR is the integer constant one or the corresponding
2876 complex constant, or a location wrapper for such a constant. */
2879 integer_onep (const_tree expr
)
2881 STRIP_ANY_LOCATION_WRAPPER (expr
);
2883 switch (TREE_CODE (expr
))
2886 return wi::eq_p (wi::to_widest (expr
), 1);
2888 return (integer_onep (TREE_REALPART (expr
))
2889 && integer_zerop (TREE_IMAGPART (expr
)));
2891 return (VECTOR_CST_NPATTERNS (expr
) == 1
2892 && VECTOR_CST_DUPLICATE_P (expr
)
2893 && integer_onep (VECTOR_CST_ENCODED_ELT (expr
, 0)));
2899 /* Return true if EXPR is the integer constant one. For complex and vector,
2900 return true if every piece is the integer constant one.
2901 Also return true for location wrappers for such a constant. */
2904 integer_each_onep (const_tree expr
)
2906 STRIP_ANY_LOCATION_WRAPPER (expr
);
2908 if (TREE_CODE (expr
) == COMPLEX_CST
)
2909 return (integer_onep (TREE_REALPART (expr
))
2910 && integer_onep (TREE_IMAGPART (expr
)));
2912 return integer_onep (expr
);
2915 /* Return true if EXPR is an integer containing all 1's in as much precision
2916 as it contains, or a complex or vector whose subparts are such integers,
2917 or a location wrapper for such a constant. */
2920 integer_all_onesp (const_tree expr
)
2922 STRIP_ANY_LOCATION_WRAPPER (expr
);
2924 if (TREE_CODE (expr
) == COMPLEX_CST
2925 && integer_all_onesp (TREE_REALPART (expr
))
2926 && integer_all_onesp (TREE_IMAGPART (expr
)))
2929 else if (TREE_CODE (expr
) == VECTOR_CST
)
2930 return (VECTOR_CST_NPATTERNS (expr
) == 1
2931 && VECTOR_CST_DUPLICATE_P (expr
)
2932 && integer_all_onesp (VECTOR_CST_ENCODED_ELT (expr
, 0)));
2934 else if (TREE_CODE (expr
) != INTEGER_CST
)
2937 return (wi::max_value (TYPE_PRECISION (TREE_TYPE (expr
)), UNSIGNED
)
2938 == wi::to_wide (expr
));
2941 /* Return true if EXPR is the integer constant minus one, or a location
2942 wrapper for such a constant. */
2945 integer_minus_onep (const_tree expr
)
2947 STRIP_ANY_LOCATION_WRAPPER (expr
);
2949 if (TREE_CODE (expr
) == COMPLEX_CST
)
2950 return (integer_all_onesp (TREE_REALPART (expr
))
2951 && integer_zerop (TREE_IMAGPART (expr
)));
2953 return integer_all_onesp (expr
);
2956 /* Return true if EXPR is an integer constant that is a power of 2 (i.e., has
2957 only one bit on), or a location wrapper for such a constant. */
2960 integer_pow2p (const_tree expr
)
2962 STRIP_ANY_LOCATION_WRAPPER (expr
);
2964 if (TREE_CODE (expr
) == COMPLEX_CST
2965 && integer_pow2p (TREE_REALPART (expr
))
2966 && integer_zerop (TREE_IMAGPART (expr
)))
2969 if (TREE_CODE (expr
) != INTEGER_CST
)
2972 return wi::popcount (wi::to_wide (expr
)) == 1;
2975 /* Return true if EXPR is an integer constant other than zero or a
2976 complex constant other than zero, or a location wrapper for such a
2980 integer_nonzerop (const_tree expr
)
2982 STRIP_ANY_LOCATION_WRAPPER (expr
);
2984 return ((TREE_CODE (expr
) == INTEGER_CST
2985 && wi::to_wide (expr
) != 0)
2986 || (TREE_CODE (expr
) == COMPLEX_CST
2987 && (integer_nonzerop (TREE_REALPART (expr
))
2988 || integer_nonzerop (TREE_IMAGPART (expr
)))));
2991 /* Return true if EXPR is the integer constant one. For vector,
2992 return true if every piece is the integer constant minus one
2993 (representing the value TRUE).
2994 Also return true for location wrappers for such a constant. */
2997 integer_truep (const_tree expr
)
2999 STRIP_ANY_LOCATION_WRAPPER (expr
);
3001 if (TREE_CODE (expr
) == VECTOR_CST
)
3002 return integer_all_onesp (expr
);
3003 return integer_onep (expr
);
3006 /* Return true if EXPR is the fixed-point constant zero, or a location wrapper
3007 for such a constant. */
3010 fixed_zerop (const_tree expr
)
3012 STRIP_ANY_LOCATION_WRAPPER (expr
);
3014 return (TREE_CODE (expr
) == FIXED_CST
3015 && TREE_FIXED_CST (expr
).data
.is_zero ());
3018 /* Return the power of two represented by a tree node known to be a
3022 tree_log2 (const_tree expr
)
3024 if (TREE_CODE (expr
) == COMPLEX_CST
)
3025 return tree_log2 (TREE_REALPART (expr
));
3027 return wi::exact_log2 (wi::to_wide (expr
));
3030 /* Similar, but return the largest integer Y such that 2 ** Y is less
3031 than or equal to EXPR. */
3034 tree_floor_log2 (const_tree expr
)
3036 if (TREE_CODE (expr
) == COMPLEX_CST
)
3037 return tree_log2 (TREE_REALPART (expr
));
3039 return wi::floor_log2 (wi::to_wide (expr
));
3042 /* Return number of known trailing zero bits in EXPR, or, if the value of
3043 EXPR is known to be zero, the precision of it's type. */
3046 tree_ctz (const_tree expr
)
3048 if (!INTEGRAL_TYPE_P (TREE_TYPE (expr
))
3049 && !POINTER_TYPE_P (TREE_TYPE (expr
)))
3052 unsigned int ret1
, ret2
, prec
= TYPE_PRECISION (TREE_TYPE (expr
));
3053 switch (TREE_CODE (expr
))
3056 ret1
= wi::ctz (wi::to_wide (expr
));
3057 return MIN (ret1
, prec
);
3059 ret1
= wi::ctz (get_nonzero_bits (expr
));
3060 return MIN (ret1
, prec
);
3067 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
3070 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
3071 return MIN (ret1
, ret2
);
3072 case POINTER_PLUS_EXPR
:
3073 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
3074 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
3075 /* Second operand is sizetype, which could be in theory
3076 wider than pointer's precision. Make sure we never
3077 return more than prec. */
3078 ret2
= MIN (ret2
, prec
);
3079 return MIN (ret1
, ret2
);
3081 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
3082 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
3083 return MAX (ret1
, ret2
);
3085 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
3086 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
3087 return MIN (ret1
+ ret2
, prec
);
3089 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
3090 if (tree_fits_uhwi_p (TREE_OPERAND (expr
, 1))
3091 && (tree_to_uhwi (TREE_OPERAND (expr
, 1)) < prec
))
3093 ret2
= tree_to_uhwi (TREE_OPERAND (expr
, 1));
3094 return MIN (ret1
+ ret2
, prec
);
3098 if (tree_fits_uhwi_p (TREE_OPERAND (expr
, 1))
3099 && (tree_to_uhwi (TREE_OPERAND (expr
, 1)) < prec
))
3101 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
3102 ret2
= tree_to_uhwi (TREE_OPERAND (expr
, 1));
3107 case TRUNC_DIV_EXPR
:
3109 case FLOOR_DIV_EXPR
:
3110 case ROUND_DIV_EXPR
:
3111 case EXACT_DIV_EXPR
:
3112 if (TREE_CODE (TREE_OPERAND (expr
, 1)) == INTEGER_CST
3113 && tree_int_cst_sgn (TREE_OPERAND (expr
, 1)) == 1)
3115 int l
= tree_log2 (TREE_OPERAND (expr
, 1));
3118 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
3126 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
3127 if (ret1
&& ret1
== TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (expr
, 0))))
3129 return MIN (ret1
, prec
);
3131 return tree_ctz (TREE_OPERAND (expr
, 0));
3133 ret1
= tree_ctz (TREE_OPERAND (expr
, 1));
3136 ret2
= tree_ctz (TREE_OPERAND (expr
, 2));
3137 return MIN (ret1
, ret2
);
3139 return tree_ctz (TREE_OPERAND (expr
, 1));
3141 ret1
= get_pointer_alignment (CONST_CAST_TREE (expr
));
3142 if (ret1
> BITS_PER_UNIT
)
3144 ret1
= ctz_hwi (ret1
/ BITS_PER_UNIT
);
3145 return MIN (ret1
, prec
);
3153 /* Return true if EXPR is the real constant zero. Trailing zeroes matter for
3154 decimal float constants, so don't return true for them.
3155 Also return true for location wrappers around such a constant. */
3158 real_zerop (const_tree expr
)
3160 STRIP_ANY_LOCATION_WRAPPER (expr
);
3162 switch (TREE_CODE (expr
))
3165 return real_equal (&TREE_REAL_CST (expr
), &dconst0
)
3166 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
3168 return real_zerop (TREE_REALPART (expr
))
3169 && real_zerop (TREE_IMAGPART (expr
));
3172 /* Don't simply check for a duplicate because the predicate
3173 accepts both +0.0 and -0.0. */
3174 unsigned count
= vector_cst_encoded_nelts (expr
);
3175 for (unsigned int i
= 0; i
< count
; ++i
)
3176 if (!real_zerop (VECTOR_CST_ENCODED_ELT (expr
, i
)))
3185 /* Return true if EXPR is the real constant one in real or complex form.
3186 Trailing zeroes matter for decimal float constants, so don't return
3188 Also return true for location wrappers around such a constant. */
3191 real_onep (const_tree expr
)
3193 STRIP_ANY_LOCATION_WRAPPER (expr
);
3195 switch (TREE_CODE (expr
))
3198 return real_equal (&TREE_REAL_CST (expr
), &dconst1
)
3199 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
3201 return real_onep (TREE_REALPART (expr
))
3202 && real_zerop (TREE_IMAGPART (expr
));
3204 return (VECTOR_CST_NPATTERNS (expr
) == 1
3205 && VECTOR_CST_DUPLICATE_P (expr
)
3206 && real_onep (VECTOR_CST_ENCODED_ELT (expr
, 0)));
3212 /* Return true if EXPR is the real constant minus one. Trailing zeroes
3213 matter for decimal float constants, so don't return true for them.
3214 Also return true for location wrappers around such a constant. */
3217 real_minus_onep (const_tree expr
)
3219 STRIP_ANY_LOCATION_WRAPPER (expr
);
3221 switch (TREE_CODE (expr
))
3224 return real_equal (&TREE_REAL_CST (expr
), &dconstm1
)
3225 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
3227 return real_minus_onep (TREE_REALPART (expr
))
3228 && real_zerop (TREE_IMAGPART (expr
));
3230 return (VECTOR_CST_NPATTERNS (expr
) == 1
3231 && VECTOR_CST_DUPLICATE_P (expr
)
3232 && real_minus_onep (VECTOR_CST_ENCODED_ELT (expr
, 0)));
3238 /* Return true if T could be a floating point zero. */
3241 real_maybe_zerop (const_tree expr
)
3243 switch (TREE_CODE (expr
))
3246 /* Can't use real_zerop here, as it always returns false for decimal
3247 floats. And can't use TREE_REAL_CST (expr).cl == rvc_zero
3248 either, as decimal zeros are rvc_normal. */
3249 return real_equal (&TREE_REAL_CST (expr
), &dconst0
);
3251 return (real_maybe_zerop (TREE_REALPART (expr
))
3252 || real_maybe_zerop (TREE_IMAGPART (expr
)));
3255 unsigned count
= vector_cst_encoded_nelts (expr
);
3256 for (unsigned int i
= 0; i
< count
; ++i
)
3257 if (real_maybe_zerop (VECTOR_CST_ENCODED_ELT (expr
, i
)))
3262 /* Perhaps for SSA_NAMEs we could query frange. */
3267 /* True if EXP is a constant or a cast of a constant. */
3270 really_constant_p (const_tree exp
)
3272 /* This is not quite the same as STRIP_NOPS. It does more. */
3273 while (CONVERT_EXPR_P (exp
)
3274 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
3275 exp
= TREE_OPERAND (exp
, 0);
3276 return TREE_CONSTANT (exp
);
3279 /* Return true if T holds a polynomial pointer difference, storing it in
3280 *VALUE if so. A true return means that T's precision is no greater
3281 than 64 bits, which is the largest address space we support, so *VALUE
3282 never loses precision. However, the signedness of the result does
3283 not necessarily match the signedness of T: sometimes an unsigned type
3284 like sizetype is used to encode a value that is actually negative. */
3287 ptrdiff_tree_p (const_tree t
, poly_int64
*value
)
3291 if (TREE_CODE (t
) == INTEGER_CST
)
3293 if (!cst_and_fits_in_hwi (t
))
3295 *value
= int_cst_value (t
);
3298 if (POLY_INT_CST_P (t
))
3300 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
3301 if (!cst_and_fits_in_hwi (POLY_INT_CST_COEFF (t
, i
)))
3303 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
3304 value
->coeffs
[i
] = int_cst_value (POLY_INT_CST_COEFF (t
, i
));
3311 tree_to_poly_int64 (const_tree t
)
3313 gcc_assert (tree_fits_poly_int64_p (t
));
3314 if (POLY_INT_CST_P (t
))
3315 return poly_int_cst_value (t
).force_shwi ();
3316 return TREE_INT_CST_LOW (t
);
3320 tree_to_poly_uint64 (const_tree t
)
3322 gcc_assert (tree_fits_poly_uint64_p (t
));
3323 if (POLY_INT_CST_P (t
))
3324 return poly_int_cst_value (t
).force_uhwi ();
3325 return TREE_INT_CST_LOW (t
);
3328 /* Return first list element whose TREE_VALUE is ELEM.
3329 Return 0 if ELEM is not in LIST. */
3332 value_member (tree elem
, tree list
)
3336 if (elem
== TREE_VALUE (list
))
3338 list
= TREE_CHAIN (list
);
3343 /* Return first list element whose TREE_PURPOSE is ELEM.
3344 Return 0 if ELEM is not in LIST. */
3347 purpose_member (const_tree elem
, tree list
)
3351 if (elem
== TREE_PURPOSE (list
))
3353 list
= TREE_CHAIN (list
);
3358 /* Return true if ELEM is in V. */
3361 vec_member (const_tree elem
, vec
<tree
, va_gc
> *v
)
3365 FOR_EACH_VEC_SAFE_ELT (v
, ix
, t
)
3371 /* Returns element number IDX (zero-origin) of chain CHAIN, or
3375 chain_index (int idx
, tree chain
)
3377 for (; chain
&& idx
> 0; --idx
)
3378 chain
= TREE_CHAIN (chain
);
3382 /* Return true if ELEM is part of the chain CHAIN. */
3385 chain_member (const_tree elem
, const_tree chain
)
3391 chain
= DECL_CHAIN (chain
);
3397 /* Return the length of a chain of nodes chained through TREE_CHAIN.
3398 We expect a null pointer to mark the end of the chain.
3399 This is the Lisp primitive `length'. */
3402 list_length (const_tree t
)
3405 #ifdef ENABLE_TREE_CHECKING
3413 #ifdef ENABLE_TREE_CHECKING
3416 gcc_assert (p
!= q
);
3424 /* Returns the first FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
3425 UNION_TYPE TYPE, or NULL_TREE if none. */
3428 first_field (const_tree type
)
3430 tree t
= TYPE_FIELDS (type
);
3431 while (t
&& TREE_CODE (t
) != FIELD_DECL
)
3436 /* Returns the last FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
3437 UNION_TYPE TYPE, or NULL_TREE if none. */
3440 last_field (const_tree type
)
3442 tree last
= NULL_TREE
;
3444 for (tree fld
= TYPE_FIELDS (type
); fld
; fld
= TREE_CHAIN (fld
))
3446 if (TREE_CODE (fld
) != FIELD_DECL
)
3455 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
3456 by modifying the last node in chain 1 to point to chain 2.
3457 This is the Lisp primitive `nconc'. */
3460 chainon (tree op1
, tree op2
)
3469 for (t1
= op1
; TREE_CHAIN (t1
); t1
= TREE_CHAIN (t1
))
3471 TREE_CHAIN (t1
) = op2
;
3473 #ifdef ENABLE_TREE_CHECKING
3476 for (t2
= op2
; t2
; t2
= TREE_CHAIN (t2
))
3477 gcc_assert (t2
!= t1
);
3484 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
3487 tree_last (tree chain
)
3491 while ((next
= TREE_CHAIN (chain
)))
3496 /* Reverse the order of elements in the chain T,
3497 and return the new head of the chain (old last element). */
3502 tree prev
= 0, decl
, next
;
3503 for (decl
= t
; decl
; decl
= next
)
3505 /* We shouldn't be using this function to reverse BLOCK chains; we
3506 have blocks_nreverse for that. */
3507 gcc_checking_assert (TREE_CODE (decl
) != BLOCK
);
3508 next
= TREE_CHAIN (decl
);
3509 TREE_CHAIN (decl
) = prev
;
3515 /* Return a newly created TREE_LIST node whose
3516 purpose and value fields are PARM and VALUE. */
3519 build_tree_list (tree parm
, tree value MEM_STAT_DECL
)
3521 tree t
= make_node (TREE_LIST PASS_MEM_STAT
);
3522 TREE_PURPOSE (t
) = parm
;
3523 TREE_VALUE (t
) = value
;
3527 /* Build a chain of TREE_LIST nodes from a vector. */
3530 build_tree_list_vec (const vec
<tree
, va_gc
> *vec MEM_STAT_DECL
)
3532 tree ret
= NULL_TREE
;
3536 FOR_EACH_VEC_SAFE_ELT (vec
, i
, t
)
3538 *pp
= build_tree_list (NULL
, t PASS_MEM_STAT
);
3539 pp
= &TREE_CHAIN (*pp
);
3544 /* Return a newly created TREE_LIST node whose
3545 purpose and value fields are PURPOSE and VALUE
3546 and whose TREE_CHAIN is CHAIN. */
3549 tree_cons (tree purpose
, tree value
, tree chain MEM_STAT_DECL
)
3553 node
= ggc_alloc_tree_node_stat (sizeof (struct tree_list
) PASS_MEM_STAT
);
3554 memset (node
, 0, sizeof (struct tree_common
));
3556 record_node_allocation_statistics (TREE_LIST
, sizeof (struct tree_list
));
3558 TREE_SET_CODE (node
, TREE_LIST
);
3559 TREE_CHAIN (node
) = chain
;
3560 TREE_PURPOSE (node
) = purpose
;
3561 TREE_VALUE (node
) = value
;
3565 /* Return the values of the elements of a CONSTRUCTOR as a vector of
3569 ctor_to_vec (tree ctor
)
3571 vec
<tree
, va_gc
> *vec
;
3572 vec_alloc (vec
, CONSTRUCTOR_NELTS (ctor
));
3576 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), ix
, val
)
3577 vec
->quick_push (val
);
3582 /* Return the size nominally occupied by an object of type TYPE
3583 when it resides in memory. The value is measured in units of bytes,
3584 and its data type is that normally used for type sizes
3585 (which is the first type created by make_signed_type or
3586 make_unsigned_type). */
3589 size_in_bytes_loc (location_t loc
, const_tree type
)
3593 if (type
== error_mark_node
)
3594 return integer_zero_node
;
3596 type
= TYPE_MAIN_VARIANT (type
);
3597 t
= TYPE_SIZE_UNIT (type
);
3601 lang_hooks
.types
.incomplete_type_error (loc
, NULL_TREE
, type
);
3602 return size_zero_node
;
3608 /* Return the size of TYPE (in bytes) as a wide integer
3609 or return -1 if the size can vary or is larger than an integer. */
3612 int_size_in_bytes (const_tree type
)
3616 if (type
== error_mark_node
)
3619 type
= TYPE_MAIN_VARIANT (type
);
3620 t
= TYPE_SIZE_UNIT (type
);
3622 if (t
&& tree_fits_uhwi_p (t
))
3623 return TREE_INT_CST_LOW (t
);
3628 /* Return the maximum size of TYPE (in bytes) as a wide integer
3629 or return -1 if the size can vary or is larger than an integer. */
3632 max_int_size_in_bytes (const_tree type
)
3634 HOST_WIDE_INT size
= -1;
3637 /* If this is an array type, check for a possible MAX_SIZE attached. */
3639 if (TREE_CODE (type
) == ARRAY_TYPE
)
3641 size_tree
= TYPE_ARRAY_MAX_SIZE (type
);
3643 if (size_tree
&& tree_fits_uhwi_p (size_tree
))
3644 size
= tree_to_uhwi (size_tree
);
3647 /* If we still haven't been able to get a size, see if the language
3648 can compute a maximum size. */
3652 size_tree
= lang_hooks
.types
.max_size (type
);
3654 if (size_tree
&& tree_fits_uhwi_p (size_tree
))
3655 size
= tree_to_uhwi (size_tree
);
3661 /* Return the bit position of FIELD, in bits from the start of the record.
3662 This is a tree of type bitsizetype. */
3665 bit_position (const_tree field
)
3667 return bit_from_pos (DECL_FIELD_OFFSET (field
),
3668 DECL_FIELD_BIT_OFFSET (field
));
3671 /* Return the byte position of FIELD, in bytes from the start of the record.
3672 This is a tree of type sizetype. */
3675 byte_position (const_tree field
)
3677 return byte_from_pos (DECL_FIELD_OFFSET (field
),
3678 DECL_FIELD_BIT_OFFSET (field
));
3681 /* Likewise, but return as an integer. It must be representable in
3682 that way (since it could be a signed value, we don't have the
3683 option of returning -1 like int_size_in_byte can. */
3686 int_byte_position (const_tree field
)
3688 return tree_to_shwi (byte_position (field
));
3691 /* Return, as a tree node, the number of elements for TYPE (which is an
3692 ARRAY_TYPE) minus one. This counts only elements of the top array. */
3695 array_type_nelts (const_tree type
)
3697 tree index_type
, min
, max
;
3699 /* If they did it with unspecified bounds, then we should have already
3700 given an error about it before we got here. */
3701 if (! TYPE_DOMAIN (type
))
3702 return error_mark_node
;
3704 index_type
= TYPE_DOMAIN (type
);
3705 min
= TYPE_MIN_VALUE (index_type
);
3706 max
= TYPE_MAX_VALUE (index_type
);
3708 /* TYPE_MAX_VALUE may not be set if the array has unknown length. */
3711 /* zero sized arrays are represented from C FE as complete types with
3712 NULL TYPE_MAX_VALUE and zero TYPE_SIZE, while C++ FE represents
3713 them as min 0, max -1. */
3714 if (COMPLETE_TYPE_P (type
)
3715 && integer_zerop (TYPE_SIZE (type
))
3716 && integer_zerop (min
))
3717 return build_int_cst (TREE_TYPE (min
), -1);
3719 return error_mark_node
;
3722 return (integer_zerop (min
)
3724 : fold_build2 (MINUS_EXPR
, TREE_TYPE (max
), max
, min
));
3727 /* If arg is static -- a reference to an object in static storage -- then
3728 return the object. This is not the same as the C meaning of `static'.
3729 If arg isn't static, return NULL. */
3734 switch (TREE_CODE (arg
))
3737 /* Nested functions are static, even though taking their address will
3738 involve a trampoline as we unnest the nested function and create
3739 the trampoline on the tree level. */
3743 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
3744 && ! DECL_THREAD_LOCAL_P (arg
)
3745 && ! DECL_DLLIMPORT_P (arg
)
3749 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
3753 return TREE_STATIC (arg
) ? arg
: NULL
;
3760 /* If the thing being referenced is not a field, then it is
3761 something language specific. */
3762 gcc_assert (TREE_CODE (TREE_OPERAND (arg
, 1)) == FIELD_DECL
);
3764 /* If we are referencing a bitfield, we can't evaluate an
3765 ADDR_EXPR at compile time and so it isn't a constant. */
3766 if (DECL_BIT_FIELD (TREE_OPERAND (arg
, 1)))
3769 return staticp (TREE_OPERAND (arg
, 0));
3775 return TREE_CONSTANT (TREE_OPERAND (arg
, 0)) ? arg
: NULL
;
3778 case ARRAY_RANGE_REF
:
3779 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg
))) == INTEGER_CST
3780 && TREE_CODE (TREE_OPERAND (arg
, 1)) == INTEGER_CST
)
3781 return staticp (TREE_OPERAND (arg
, 0));
3785 case COMPOUND_LITERAL_EXPR
:
3786 return TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (arg
)) ? arg
: NULL
;
3796 /* Return whether OP is a DECL whose address is function-invariant. */
3799 decl_address_invariant_p (const_tree op
)
3801 /* The conditions below are slightly less strict than the one in
3804 switch (TREE_CODE (op
))
3813 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
3814 || DECL_THREAD_LOCAL_P (op
)
3815 || DECL_CONTEXT (op
) == current_function_decl
3816 || decl_function_context (op
) == current_function_decl
)
3821 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
3822 || decl_function_context (op
) == current_function_decl
)
3833 /* Return whether OP is a DECL whose address is interprocedural-invariant. */
3836 decl_address_ip_invariant_p (const_tree op
)
3838 /* The conditions below are slightly less strict than the one in
3841 switch (TREE_CODE (op
))
3849 if (((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
3850 && !DECL_DLLIMPORT_P (op
))
3851 || DECL_THREAD_LOCAL_P (op
))
3856 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
)))
3868 /* Return true if T is function-invariant (internal function, does
3869 not handle arithmetic; that's handled in skip_simple_arithmetic and
3870 tree_invariant_p). */
3873 tree_invariant_p_1 (tree t
)
3877 if (TREE_CONSTANT (t
)
3878 || (TREE_READONLY (t
) && !TREE_SIDE_EFFECTS (t
)))
3881 switch (TREE_CODE (t
))
3887 op
= TREE_OPERAND (t
, 0);
3888 while (handled_component_p (op
))
3890 switch (TREE_CODE (op
))
3893 case ARRAY_RANGE_REF
:
3894 if (!tree_invariant_p (TREE_OPERAND (op
, 1))
3895 || TREE_OPERAND (op
, 2) != NULL_TREE
3896 || TREE_OPERAND (op
, 3) != NULL_TREE
)
3901 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
3907 op
= TREE_OPERAND (op
, 0);
3910 return CONSTANT_CLASS_P (op
) || decl_address_invariant_p (op
);
3919 /* Return true if T is function-invariant. */
3922 tree_invariant_p (tree t
)
3924 tree inner
= skip_simple_arithmetic (t
);
3925 return tree_invariant_p_1 (inner
);
3928 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
3929 Do this to any expression which may be used in more than one place,
3930 but must be evaluated only once.
3932 Normally, expand_expr would reevaluate the expression each time.
3933 Calling save_expr produces something that is evaluated and recorded
3934 the first time expand_expr is called on it. Subsequent calls to
3935 expand_expr just reuse the recorded value.
3937 The call to expand_expr that generates code that actually computes
3938 the value is the first call *at compile time*. Subsequent calls
3939 *at compile time* generate code to use the saved value.
3940 This produces correct result provided that *at run time* control
3941 always flows through the insns made by the first expand_expr
3942 before reaching the other places where the save_expr was evaluated.
3943 You, the caller of save_expr, must make sure this is so.
3945 Constants, and certain read-only nodes, are returned with no
3946 SAVE_EXPR because that is safe. Expressions containing placeholders
3947 are not touched; see tree.def for an explanation of what these
3951 save_expr (tree expr
)
3955 /* If the tree evaluates to a constant, then we don't want to hide that
3956 fact (i.e. this allows further folding, and direct checks for constants).
3957 However, a read-only object that has side effects cannot be bypassed.
3958 Since it is no problem to reevaluate literals, we just return the
3960 inner
= skip_simple_arithmetic (expr
);
3961 if (TREE_CODE (inner
) == ERROR_MARK
)
3964 if (tree_invariant_p_1 (inner
))
3967 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
3968 it means that the size or offset of some field of an object depends on
3969 the value within another field.
3971 Note that it must not be the case that EXPR contains both a PLACEHOLDER_EXPR
3972 and some variable since it would then need to be both evaluated once and
3973 evaluated more than once. Front-ends must assure this case cannot
3974 happen by surrounding any such subexpressions in their own SAVE_EXPR
3975 and forcing evaluation at the proper time. */
3976 if (contains_placeholder_p (inner
))
3979 expr
= build1_loc (EXPR_LOCATION (expr
), SAVE_EXPR
, TREE_TYPE (expr
), expr
);
3981 /* This expression might be placed ahead of a jump to ensure that the
3982 value was computed on both sides of the jump. So make sure it isn't
3983 eliminated as dead. */
3984 TREE_SIDE_EFFECTS (expr
) = 1;
3988 /* Look inside EXPR into any simple arithmetic operations. Return the
3989 outermost non-arithmetic or non-invariant node. */
3992 skip_simple_arithmetic (tree expr
)
3994 /* We don't care about whether this can be used as an lvalue in this
3996 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
3997 expr
= TREE_OPERAND (expr
, 0);
3999 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
4000 a constant, it will be more efficient to not make another SAVE_EXPR since
4001 it will allow better simplification and GCSE will be able to merge the
4002 computations if they actually occur. */
4005 if (UNARY_CLASS_P (expr
))
4006 expr
= TREE_OPERAND (expr
, 0);
4007 else if (BINARY_CLASS_P (expr
))
4009 if (tree_invariant_p (TREE_OPERAND (expr
, 1)))
4010 expr
= TREE_OPERAND (expr
, 0);
4011 else if (tree_invariant_p (TREE_OPERAND (expr
, 0)))
4012 expr
= TREE_OPERAND (expr
, 1);
4023 /* Look inside EXPR into simple arithmetic operations involving constants.
4024 Return the outermost non-arithmetic or non-constant node. */
4027 skip_simple_constant_arithmetic (tree expr
)
4029 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
4030 expr
= TREE_OPERAND (expr
, 0);
4034 if (UNARY_CLASS_P (expr
))
4035 expr
= TREE_OPERAND (expr
, 0);
4036 else if (BINARY_CLASS_P (expr
))
4038 if (TREE_CONSTANT (TREE_OPERAND (expr
, 1)))
4039 expr
= TREE_OPERAND (expr
, 0);
4040 else if (TREE_CONSTANT (TREE_OPERAND (expr
, 0)))
4041 expr
= TREE_OPERAND (expr
, 1);
4052 /* Return which tree structure is used by T. */
4054 enum tree_node_structure_enum
4055 tree_node_structure (const_tree t
)
4057 const enum tree_code code
= TREE_CODE (t
);
4058 return tree_node_structure_for_code (code
);
4061 /* Set various status flags when building a CALL_EXPR object T. */
4064 process_call_operands (tree t
)
4066 bool side_effects
= TREE_SIDE_EFFECTS (t
);
4067 bool read_only
= false;
4068 int i
= call_expr_flags (t
);
4070 /* Calls have side-effects, except those to const or pure functions. */
4071 if ((i
& ECF_LOOPING_CONST_OR_PURE
) || !(i
& (ECF_CONST
| ECF_PURE
)))
4072 side_effects
= true;
4073 /* Propagate TREE_READONLY of arguments for const functions. */
4077 if (!side_effects
|| read_only
)
4078 for (i
= 1; i
< TREE_OPERAND_LENGTH (t
); i
++)
4080 tree op
= TREE_OPERAND (t
, i
);
4081 if (op
&& TREE_SIDE_EFFECTS (op
))
4082 side_effects
= true;
4083 if (op
&& !TREE_READONLY (op
) && !CONSTANT_CLASS_P (op
))
4087 TREE_SIDE_EFFECTS (t
) = side_effects
;
4088 TREE_READONLY (t
) = read_only
;
4091 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
4092 size or offset that depends on a field within a record. */
4095 contains_placeholder_p (const_tree exp
)
4097 enum tree_code code
;
4102 code
= TREE_CODE (exp
);
4103 if (code
== PLACEHOLDER_EXPR
)
4106 switch (TREE_CODE_CLASS (code
))
4109 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
4110 position computations since they will be converted into a
4111 WITH_RECORD_EXPR involving the reference, which will assume
4112 here will be valid. */
4113 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
4115 case tcc_exceptional
:
4116 if (code
== TREE_LIST
)
4117 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp
))
4118 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp
)));
4123 case tcc_comparison
:
4124 case tcc_expression
:
4128 /* Ignoring the first operand isn't quite right, but works best. */
4129 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1));
4132 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
4133 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1))
4134 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 2)));
4137 /* The save_expr function never wraps anything containing
4138 a PLACEHOLDER_EXPR. */
4145 switch (TREE_CODE_LENGTH (code
))
4148 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
4150 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
4151 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1)));
4162 const_call_expr_arg_iterator iter
;
4163 FOR_EACH_CONST_CALL_EXPR_ARG (arg
, iter
, exp
)
4164 if (CONTAINS_PLACEHOLDER_P (arg
))
4178 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
4179 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
4183 type_contains_placeholder_1 (const_tree type
)
4185 /* If the size contains a placeholder or the parent type (component type in
4186 the case of arrays) type involves a placeholder, this type does. */
4187 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type
))
4188 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type
))
4189 || (!POINTER_TYPE_P (type
)
4191 && type_contains_placeholder_p (TREE_TYPE (type
))))
4194 /* Now do type-specific checks. Note that the last part of the check above
4195 greatly limits what we have to do below. */
4196 switch (TREE_CODE (type
))
4205 case REFERENCE_TYPE
:
4215 case FIXED_POINT_TYPE
:
4216 /* Here we just check the bounds. */
4217 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type
))
4218 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type
)));
4221 /* We have already checked the component type above, so just check
4222 the domain type. Flexible array members have a null domain. */
4223 return TYPE_DOMAIN (type
) ?
4224 type_contains_placeholder_p (TYPE_DOMAIN (type
)) : false;
4228 case QUAL_UNION_TYPE
:
4232 for (field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
4233 if (TREE_CODE (field
) == FIELD_DECL
4234 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field
))
4235 || (TREE_CODE (type
) == QUAL_UNION_TYPE
4236 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field
)))
4237 || type_contains_placeholder_p (TREE_TYPE (field
))))
4248 /* Wrapper around above function used to cache its result. */
4251 type_contains_placeholder_p (tree type
)
4255 /* If the contains_placeholder_bits field has been initialized,
4256 then we know the answer. */
4257 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) > 0)
4258 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) - 1;
4260 /* Indicate that we've seen this type node, and the answer is false.
4261 This is what we want to return if we run into recursion via fields. */
4262 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = 1;
4264 /* Compute the real value. */
4265 result
= type_contains_placeholder_1 (type
);
4267 /* Store the real value. */
4268 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = result
+ 1;
4273 /* Push tree EXP onto vector QUEUE if it is not already present. */
4276 push_without_duplicates (tree exp
, vec
<tree
> *queue
)
4281 FOR_EACH_VEC_ELT (*queue
, i
, iter
)
4282 if (simple_cst_equal (iter
, exp
) == 1)
4286 queue
->safe_push (exp
);
4289 /* Given a tree EXP, find all occurrences of references to fields
4290 in a PLACEHOLDER_EXPR and place them in vector REFS without
4291 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
4292 we assume here that EXP contains only arithmetic expressions
4293 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
4297 find_placeholder_in_expr (tree exp
, vec
<tree
> *refs
)
4299 enum tree_code code
= TREE_CODE (exp
);
4303 /* We handle TREE_LIST and COMPONENT_REF separately. */
4304 if (code
== TREE_LIST
)
4306 FIND_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), refs
);
4307 FIND_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), refs
);
4309 else if (code
== COMPONENT_REF
)
4311 for (inner
= TREE_OPERAND (exp
, 0);
4312 REFERENCE_CLASS_P (inner
);
4313 inner
= TREE_OPERAND (inner
, 0))
4316 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
)
4317 push_without_duplicates (exp
, refs
);
4319 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), refs
);
4322 switch (TREE_CODE_CLASS (code
))
4327 case tcc_declaration
:
4328 /* Variables allocated to static storage can stay. */
4329 if (!TREE_STATIC (exp
))
4330 push_without_duplicates (exp
, refs
);
4333 case tcc_expression
:
4334 /* This is the pattern built in ada/make_aligning_type. */
4335 if (code
== ADDR_EXPR
4336 && TREE_CODE (TREE_OPERAND (exp
, 0)) == PLACEHOLDER_EXPR
)
4338 push_without_duplicates (exp
, refs
);
4344 case tcc_exceptional
:
4347 case tcc_comparison
:
4349 for (i
= 0; i
< TREE_CODE_LENGTH (code
); i
++)
4350 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
4354 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
4355 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
4363 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
4364 return a tree with all occurrences of references to F in a
4365 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
4366 CONST_DECLs. Note that we assume here that EXP contains only
4367 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
4368 occurring only in their argument list. */
4371 substitute_in_expr (tree exp
, tree f
, tree r
)
4373 enum tree_code code
= TREE_CODE (exp
);
4374 tree op0
, op1
, op2
, op3
;
4377 /* We handle TREE_LIST and COMPONENT_REF separately. */
4378 if (code
== TREE_LIST
)
4380 op0
= SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp
), f
, r
);
4381 op1
= SUBSTITUTE_IN_EXPR (TREE_VALUE (exp
), f
, r
);
4382 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
4385 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
4387 else if (code
== COMPONENT_REF
)
4391 /* If this expression is getting a value from a PLACEHOLDER_EXPR
4392 and it is the right field, replace it with R. */
4393 for (inner
= TREE_OPERAND (exp
, 0);
4394 REFERENCE_CLASS_P (inner
);
4395 inner
= TREE_OPERAND (inner
, 0))
4399 op1
= TREE_OPERAND (exp
, 1);
4401 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& op1
== f
)
4404 /* If this expression hasn't been completed let, leave it alone. */
4405 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& !TREE_TYPE (inner
))
4408 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
4409 if (op0
== TREE_OPERAND (exp
, 0))
4413 = fold_build3 (COMPONENT_REF
, TREE_TYPE (exp
), op0
, op1
, NULL_TREE
);
4416 switch (TREE_CODE_CLASS (code
))
4421 case tcc_declaration
:
4427 case tcc_expression
:
4433 case tcc_exceptional
:
4436 case tcc_comparison
:
4438 switch (TREE_CODE_LENGTH (code
))
4444 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
4445 if (op0
== TREE_OPERAND (exp
, 0))
4448 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
4452 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
4453 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
4455 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
4458 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
4462 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
4463 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
4464 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
4466 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
4467 && op2
== TREE_OPERAND (exp
, 2))
4470 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
4474 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
4475 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
4476 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
4477 op3
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 3), f
, r
);
4479 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
4480 && op2
== TREE_OPERAND (exp
, 2)
4481 && op3
== TREE_OPERAND (exp
, 3))
4485 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
4497 new_tree
= NULL_TREE
;
4499 /* If we are trying to replace F with a constant or with another
4500 instance of one of the arguments of the call, inline back
4501 functions which do nothing else than computing a value from
4502 the arguments they are passed. This makes it possible to
4503 fold partially or entirely the replacement expression. */
4504 if (code
== CALL_EXPR
)
4506 bool maybe_inline
= false;
4507 if (CONSTANT_CLASS_P (r
))
4508 maybe_inline
= true;
4510 for (i
= 3; i
< TREE_OPERAND_LENGTH (exp
); i
++)
4511 if (operand_equal_p (TREE_OPERAND (exp
, i
), r
, 0))
4513 maybe_inline
= true;
4518 tree t
= maybe_inline_call_in_expr (exp
);
4520 return SUBSTITUTE_IN_EXPR (t
, f
, r
);
4524 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
4526 tree op
= TREE_OPERAND (exp
, i
);
4527 tree new_op
= SUBSTITUTE_IN_EXPR (op
, f
, r
);
4531 new_tree
= copy_node (exp
);
4532 TREE_OPERAND (new_tree
, i
) = new_op
;
4538 new_tree
= fold (new_tree
);
4539 if (TREE_CODE (new_tree
) == CALL_EXPR
)
4540 process_call_operands (new_tree
);
4551 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
4553 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
4554 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
4559 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
4560 for it within OBJ, a tree that is an object or a chain of references. */
4563 substitute_placeholder_in_expr (tree exp
, tree obj
)
4565 enum tree_code code
= TREE_CODE (exp
);
4566 tree op0
, op1
, op2
, op3
;
4569 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
4570 in the chain of OBJ. */
4571 if (code
== PLACEHOLDER_EXPR
)
4573 tree need_type
= TYPE_MAIN_VARIANT (TREE_TYPE (exp
));
4576 for (elt
= obj
; elt
!= 0;
4577 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
4578 || TREE_CODE (elt
) == COND_EXPR
)
4579 ? TREE_OPERAND (elt
, 1)
4580 : (REFERENCE_CLASS_P (elt
)
4581 || UNARY_CLASS_P (elt
)
4582 || BINARY_CLASS_P (elt
)
4583 || VL_EXP_CLASS_P (elt
)
4584 || EXPRESSION_CLASS_P (elt
))
4585 ? TREE_OPERAND (elt
, 0) : 0))
4586 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt
)) == need_type
)
4589 for (elt
= obj
; elt
!= 0;
4590 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
4591 || TREE_CODE (elt
) == COND_EXPR
)
4592 ? TREE_OPERAND (elt
, 1)
4593 : (REFERENCE_CLASS_P (elt
)
4594 || UNARY_CLASS_P (elt
)
4595 || BINARY_CLASS_P (elt
)
4596 || VL_EXP_CLASS_P (elt
)
4597 || EXPRESSION_CLASS_P (elt
))
4598 ? TREE_OPERAND (elt
, 0) : 0))
4599 if (POINTER_TYPE_P (TREE_TYPE (elt
))
4600 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt
)))
4602 return fold_build1 (INDIRECT_REF
, need_type
, elt
);
4604 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
4605 survives until RTL generation, there will be an error. */
4609 /* TREE_LIST is special because we need to look at TREE_VALUE
4610 and TREE_CHAIN, not TREE_OPERANDS. */
4611 else if (code
== TREE_LIST
)
4613 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), obj
);
4614 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), obj
);
4615 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
4618 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
4621 switch (TREE_CODE_CLASS (code
))
4624 case tcc_declaration
:
4627 case tcc_exceptional
:
4630 case tcc_comparison
:
4631 case tcc_expression
:
4634 switch (TREE_CODE_LENGTH (code
))
4640 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
4641 if (op0
== TREE_OPERAND (exp
, 0))
4644 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
4648 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
4649 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
4651 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
4654 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
4658 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
4659 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
4660 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
4662 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
4663 && op2
== TREE_OPERAND (exp
, 2))
4666 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
4670 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
4671 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
4672 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
4673 op3
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 3), obj
);
4675 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
4676 && op2
== TREE_OPERAND (exp
, 2)
4677 && op3
== TREE_OPERAND (exp
, 3))
4681 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
4693 new_tree
= NULL_TREE
;
4695 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
4697 tree op
= TREE_OPERAND (exp
, i
);
4698 tree new_op
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (op
, obj
);
4702 new_tree
= copy_node (exp
);
4703 TREE_OPERAND (new_tree
, i
) = new_op
;
4709 new_tree
= fold (new_tree
);
4710 if (TREE_CODE (new_tree
) == CALL_EXPR
)
4711 process_call_operands (new_tree
);
4722 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
4724 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
4725 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
4731 /* Subroutine of stabilize_reference; this is called for subtrees of
4732 references. Any expression with side-effects must be put in a SAVE_EXPR
4733 to ensure that it is only evaluated once.
4735 We don't put SAVE_EXPR nodes around everything, because assigning very
4736 simple expressions to temporaries causes us to miss good opportunities
4737 for optimizations. Among other things, the opportunity to fold in the
4738 addition of a constant into an addressing mode often gets lost, e.g.
4739 "y[i+1] += x;". In general, we take the approach that we should not make
4740 an assignment unless we are forced into it - i.e., that any non-side effect
4741 operator should be allowed, and that cse should take care of coalescing
4742 multiple utterances of the same expression should that prove fruitful. */
4745 stabilize_reference_1 (tree e
)
4748 enum tree_code code
= TREE_CODE (e
);
4750 /* We cannot ignore const expressions because it might be a reference
4751 to a const array but whose index contains side-effects. But we can
4752 ignore things that are actual constant or that already have been
4753 handled by this function. */
4755 if (tree_invariant_p (e
))
4758 switch (TREE_CODE_CLASS (code
))
4760 case tcc_exceptional
:
4761 /* Always wrap STATEMENT_LIST into SAVE_EXPR, even if it doesn't
4762 have side-effects. */
4763 if (code
== STATEMENT_LIST
)
4764 return save_expr (e
);
4767 case tcc_declaration
:
4768 case tcc_comparison
:
4770 case tcc_expression
:
4773 /* If the expression has side-effects, then encase it in a SAVE_EXPR
4774 so that it will only be evaluated once. */
4775 /* The reference (r) and comparison (<) classes could be handled as
4776 below, but it is generally faster to only evaluate them once. */
4777 if (TREE_SIDE_EFFECTS (e
))
4778 return save_expr (e
);
4782 /* Constants need no processing. In fact, we should never reach
4787 /* Division is slow and tends to be compiled with jumps,
4788 especially the division by powers of 2 that is often
4789 found inside of an array reference. So do it just once. */
4790 if (code
== TRUNC_DIV_EXPR
|| code
== TRUNC_MOD_EXPR
4791 || code
== FLOOR_DIV_EXPR
|| code
== FLOOR_MOD_EXPR
4792 || code
== CEIL_DIV_EXPR
|| code
== CEIL_MOD_EXPR
4793 || code
== ROUND_DIV_EXPR
|| code
== ROUND_MOD_EXPR
)
4794 return save_expr (e
);
4795 /* Recursively stabilize each operand. */
4796 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)),
4797 stabilize_reference_1 (TREE_OPERAND (e
, 1)));
4801 /* Recursively stabilize each operand. */
4802 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)));
4809 TREE_TYPE (result
) = TREE_TYPE (e
);
4810 TREE_READONLY (result
) = TREE_READONLY (e
);
4811 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (e
);
4812 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (e
);
4817 /* Stabilize a reference so that we can use it any number of times
4818 without causing its operands to be evaluated more than once.
4819 Returns the stabilized reference. This works by means of save_expr,
4820 so see the caveats in the comments about save_expr.
4822 Also allows conversion expressions whose operands are references.
4823 Any other kind of expression is returned unchanged. */
4826 stabilize_reference (tree ref
)
4829 enum tree_code code
= TREE_CODE (ref
);
4836 /* No action is needed in this case. */
4841 case FIX_TRUNC_EXPR
:
4842 result
= build_nt (code
, stabilize_reference (TREE_OPERAND (ref
, 0)));
4846 result
= build_nt (INDIRECT_REF
,
4847 stabilize_reference_1 (TREE_OPERAND (ref
, 0)));
4851 result
= build_nt (COMPONENT_REF
,
4852 stabilize_reference (TREE_OPERAND (ref
, 0)),
4853 TREE_OPERAND (ref
, 1), NULL_TREE
);
4857 result
= build_nt (BIT_FIELD_REF
,
4858 stabilize_reference (TREE_OPERAND (ref
, 0)),
4859 TREE_OPERAND (ref
, 1), TREE_OPERAND (ref
, 2));
4860 REF_REVERSE_STORAGE_ORDER (result
) = REF_REVERSE_STORAGE_ORDER (ref
);
4864 result
= build_nt (ARRAY_REF
,
4865 stabilize_reference (TREE_OPERAND (ref
, 0)),
4866 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
4867 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
4870 case ARRAY_RANGE_REF
:
4871 result
= build_nt (ARRAY_RANGE_REF
,
4872 stabilize_reference (TREE_OPERAND (ref
, 0)),
4873 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
4874 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
4878 /* We cannot wrap the first expression in a SAVE_EXPR, as then
4879 it wouldn't be ignored. This matters when dealing with
4881 return stabilize_reference_1 (ref
);
4883 /* If arg isn't a kind of lvalue we recognize, make no change.
4884 Caller should recognize the error for an invalid lvalue. */
4889 return error_mark_node
;
4892 TREE_TYPE (result
) = TREE_TYPE (ref
);
4893 TREE_READONLY (result
) = TREE_READONLY (ref
);
4894 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (ref
);
4895 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (ref
);
4896 protected_set_expr_location (result
, EXPR_LOCATION (ref
));
4901 /* Low-level constructors for expressions. */
4903 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
4904 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
4907 recompute_tree_invariant_for_addr_expr (tree t
)
4910 bool tc
= true, se
= false;
4912 gcc_assert (TREE_CODE (t
) == ADDR_EXPR
);
4914 /* We started out assuming this address is both invariant and constant, but
4915 does not have side effects. Now go down any handled components and see if
4916 any of them involve offsets that are either non-constant or non-invariant.
4917 Also check for side-effects.
4919 ??? Note that this code makes no attempt to deal with the case where
4920 taking the address of something causes a copy due to misalignment. */
4922 #define UPDATE_FLAGS(NODE) \
4923 do { tree _node = (NODE); \
4924 if (_node && !TREE_CONSTANT (_node)) tc = false; \
4925 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
4927 for (node
= TREE_OPERAND (t
, 0); handled_component_p (node
);
4928 node
= TREE_OPERAND (node
, 0))
4930 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
4931 array reference (probably made temporarily by the G++ front end),
4932 so ignore all the operands. */
4933 if ((TREE_CODE (node
) == ARRAY_REF
4934 || TREE_CODE (node
) == ARRAY_RANGE_REF
)
4935 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node
, 0))) == ARRAY_TYPE
)
4937 UPDATE_FLAGS (TREE_OPERAND (node
, 1));
4938 if (TREE_OPERAND (node
, 2))
4939 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
4940 if (TREE_OPERAND (node
, 3))
4941 UPDATE_FLAGS (TREE_OPERAND (node
, 3));
4943 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
4944 FIELD_DECL, apparently. The G++ front end can put something else
4945 there, at least temporarily. */
4946 else if (TREE_CODE (node
) == COMPONENT_REF
4947 && TREE_CODE (TREE_OPERAND (node
, 1)) == FIELD_DECL
)
4949 if (TREE_OPERAND (node
, 2))
4950 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
4954 node
= lang_hooks
.expr_to_decl (node
, &tc
, &se
);
4956 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
4957 the address, since &(*a)->b is a form of addition. If it's a constant, the
4958 address is constant too. If it's a decl, its address is constant if the
4959 decl is static. Everything else is not constant and, furthermore,
4960 taking the address of a volatile variable is not volatile. */
4961 if (INDIRECT_REF_P (node
)
4962 || TREE_CODE (node
) == MEM_REF
)
4963 UPDATE_FLAGS (TREE_OPERAND (node
, 0));
4964 else if (CONSTANT_CLASS_P (node
))
4966 else if (DECL_P (node
))
4967 tc
&= (staticp (node
) != NULL_TREE
);
4971 se
|= TREE_SIDE_EFFECTS (node
);
4975 TREE_CONSTANT (t
) = tc
;
4976 TREE_SIDE_EFFECTS (t
) = se
;
4980 /* Build an expression of code CODE, data type TYPE, and operands as
4981 specified. Expressions and reference nodes can be created this way.
4982 Constants, decls, types and misc nodes cannot be.
4984 We define 5 non-variadic functions, from 0 to 4 arguments. This is
4985 enough for all extant tree codes. */
4988 build0 (enum tree_code code
, tree tt MEM_STAT_DECL
)
4992 gcc_assert (TREE_CODE_LENGTH (code
) == 0);
4994 t
= make_node (code PASS_MEM_STAT
);
5001 build1 (enum tree_code code
, tree type
, tree node MEM_STAT_DECL
)
5003 int length
= sizeof (struct tree_exp
);
5006 record_node_allocation_statistics (code
, length
);
5008 gcc_assert (TREE_CODE_LENGTH (code
) == 1);
5010 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
5012 memset (t
, 0, sizeof (struct tree_common
));
5014 TREE_SET_CODE (t
, code
);
5016 TREE_TYPE (t
) = type
;
5017 SET_EXPR_LOCATION (t
, UNKNOWN_LOCATION
);
5018 TREE_OPERAND (t
, 0) = node
;
5019 if (node
&& !TYPE_P (node
))
5021 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (node
);
5022 TREE_READONLY (t
) = TREE_READONLY (node
);
5025 if (TREE_CODE_CLASS (code
) == tcc_statement
)
5027 if (code
!= DEBUG_BEGIN_STMT
)
5028 TREE_SIDE_EFFECTS (t
) = 1;
5033 /* All of these have side-effects, no matter what their
5035 TREE_SIDE_EFFECTS (t
) = 1;
5036 TREE_READONLY (t
) = 0;
5040 /* Whether a dereference is readonly has nothing to do with whether
5041 its operand is readonly. */
5042 TREE_READONLY (t
) = 0;
5047 recompute_tree_invariant_for_addr_expr (t
);
5051 if ((TREE_CODE_CLASS (code
) == tcc_unary
|| code
== VIEW_CONVERT_EXPR
)
5052 && node
&& !TYPE_P (node
)
5053 && TREE_CONSTANT (node
))
5054 TREE_CONSTANT (t
) = 1;
5055 if (TREE_CODE_CLASS (code
) == tcc_reference
5056 && node
&& TREE_THIS_VOLATILE (node
))
5057 TREE_THIS_VOLATILE (t
) = 1;
5064 #define PROCESS_ARG(N) \
5066 TREE_OPERAND (t, N) = arg##N; \
5067 if (arg##N &&!TYPE_P (arg##N)) \
5069 if (TREE_SIDE_EFFECTS (arg##N)) \
5071 if (!TREE_READONLY (arg##N) \
5072 && !CONSTANT_CLASS_P (arg##N)) \
5073 (void) (read_only = 0); \
5074 if (!TREE_CONSTANT (arg##N)) \
5075 (void) (constant = 0); \
5080 build2 (enum tree_code code
, tree tt
, tree arg0
, tree arg1 MEM_STAT_DECL
)
5082 bool constant
, read_only
, side_effects
, div_by_zero
;
5085 gcc_assert (TREE_CODE_LENGTH (code
) == 2);
5087 if ((code
== MINUS_EXPR
|| code
== PLUS_EXPR
|| code
== MULT_EXPR
)
5088 && arg0
&& arg1
&& tt
&& POINTER_TYPE_P (tt
)
5089 /* When sizetype precision doesn't match that of pointers
5090 we need to be able to build explicit extensions or truncations
5091 of the offset argument. */
5092 && TYPE_PRECISION (sizetype
) == TYPE_PRECISION (tt
))
5093 gcc_assert (TREE_CODE (arg0
) == INTEGER_CST
5094 && TREE_CODE (arg1
) == INTEGER_CST
);
5096 if (code
== POINTER_PLUS_EXPR
&& arg0
&& arg1
&& tt
)
5097 gcc_assert (POINTER_TYPE_P (tt
) && POINTER_TYPE_P (TREE_TYPE (arg0
))
5098 && ptrofftype_p (TREE_TYPE (arg1
)));
5100 t
= make_node (code PASS_MEM_STAT
);
5103 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
5104 result based on those same flags for the arguments. But if the
5105 arguments aren't really even `tree' expressions, we shouldn't be trying
5108 /* Expressions without side effects may be constant if their
5109 arguments are as well. */
5110 constant
= (TREE_CODE_CLASS (code
) == tcc_comparison
5111 || TREE_CODE_CLASS (code
) == tcc_binary
);
5113 side_effects
= TREE_SIDE_EFFECTS (t
);
5117 case TRUNC_DIV_EXPR
:
5119 case FLOOR_DIV_EXPR
:
5120 case ROUND_DIV_EXPR
:
5121 case EXACT_DIV_EXPR
:
5123 case FLOOR_MOD_EXPR
:
5124 case ROUND_MOD_EXPR
:
5125 case TRUNC_MOD_EXPR
:
5126 div_by_zero
= integer_zerop (arg1
);
5129 div_by_zero
= false;
5135 TREE_SIDE_EFFECTS (t
) = side_effects
;
5136 if (code
== MEM_REF
)
5138 if (arg0
&& TREE_CODE (arg0
) == ADDR_EXPR
)
5140 tree o
= TREE_OPERAND (arg0
, 0);
5141 TREE_READONLY (t
) = TREE_READONLY (o
);
5142 TREE_THIS_VOLATILE (t
) = TREE_THIS_VOLATILE (o
);
5147 TREE_READONLY (t
) = read_only
;
5148 /* Don't mark X / 0 as constant. */
5149 TREE_CONSTANT (t
) = constant
&& !div_by_zero
;
5150 TREE_THIS_VOLATILE (t
)
5151 = (TREE_CODE_CLASS (code
) == tcc_reference
5152 && arg0
&& TREE_THIS_VOLATILE (arg0
));
5160 build3 (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
5161 tree arg2 MEM_STAT_DECL
)
5163 bool constant
, read_only
, side_effects
;
5166 gcc_assert (TREE_CODE_LENGTH (code
) == 3);
5167 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
5169 t
= make_node (code PASS_MEM_STAT
);
5174 /* As a special exception, if COND_EXPR has NULL branches, we
5175 assume that it is a gimple statement and always consider
5176 it to have side effects. */
5177 if (code
== COND_EXPR
5178 && tt
== void_type_node
5179 && arg1
== NULL_TREE
5180 && arg2
== NULL_TREE
)
5181 side_effects
= true;
5183 side_effects
= TREE_SIDE_EFFECTS (t
);
5189 if (code
== COND_EXPR
)
5190 TREE_READONLY (t
) = read_only
;
5192 TREE_SIDE_EFFECTS (t
) = side_effects
;
5193 TREE_THIS_VOLATILE (t
)
5194 = (TREE_CODE_CLASS (code
) == tcc_reference
5195 && arg0
&& TREE_THIS_VOLATILE (arg0
));
5201 build4 (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
5202 tree arg2
, tree arg3 MEM_STAT_DECL
)
5204 bool constant
, read_only
, side_effects
;
5207 gcc_assert (TREE_CODE_LENGTH (code
) == 4);
5209 t
= make_node (code PASS_MEM_STAT
);
5212 side_effects
= TREE_SIDE_EFFECTS (t
);
5219 TREE_SIDE_EFFECTS (t
) = side_effects
;
5220 TREE_THIS_VOLATILE (t
)
5221 = (TREE_CODE_CLASS (code
) == tcc_reference
5222 && arg0
&& TREE_THIS_VOLATILE (arg0
));
5228 build5 (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
5229 tree arg2
, tree arg3
, tree arg4 MEM_STAT_DECL
)
5231 bool constant
, read_only
, side_effects
;
5234 gcc_assert (TREE_CODE_LENGTH (code
) == 5);
5236 t
= make_node (code PASS_MEM_STAT
);
5239 side_effects
= TREE_SIDE_EFFECTS (t
);
5247 TREE_SIDE_EFFECTS (t
) = side_effects
;
5248 if (code
== TARGET_MEM_REF
)
5250 if (arg0
&& TREE_CODE (arg0
) == ADDR_EXPR
)
5252 tree o
= TREE_OPERAND (arg0
, 0);
5253 TREE_READONLY (t
) = TREE_READONLY (o
);
5254 TREE_THIS_VOLATILE (t
) = TREE_THIS_VOLATILE (o
);
5258 TREE_THIS_VOLATILE (t
)
5259 = (TREE_CODE_CLASS (code
) == tcc_reference
5260 && arg0
&& TREE_THIS_VOLATILE (arg0
));
5265 /* Build a simple MEM_REF tree with the sematics of a plain INDIRECT_REF
5266 on the pointer PTR. */
5269 build_simple_mem_ref_loc (location_t loc
, tree ptr
)
5271 poly_int64 offset
= 0;
5272 tree ptype
= TREE_TYPE (ptr
);
5274 /* For convenience allow addresses that collapse to a simple base
5276 if (TREE_CODE (ptr
) == ADDR_EXPR
5277 && (handled_component_p (TREE_OPERAND (ptr
, 0))
5278 || TREE_CODE (TREE_OPERAND (ptr
, 0)) == MEM_REF
))
5280 ptr
= get_addr_base_and_unit_offset (TREE_OPERAND (ptr
, 0), &offset
);
5282 if (TREE_CODE (ptr
) == MEM_REF
)
5284 offset
+= mem_ref_offset (ptr
).force_shwi ();
5285 ptr
= TREE_OPERAND (ptr
, 0);
5288 ptr
= build_fold_addr_expr (ptr
);
5289 gcc_assert (is_gimple_reg (ptr
) || is_gimple_min_invariant (ptr
));
5291 tem
= build2 (MEM_REF
, TREE_TYPE (ptype
),
5292 ptr
, build_int_cst (ptype
, offset
));
5293 SET_EXPR_LOCATION (tem
, loc
);
5297 /* Return the constant offset of a MEM_REF or TARGET_MEM_REF tree T. */
5300 mem_ref_offset (const_tree t
)
5302 return poly_offset_int::from (wi::to_poly_wide (TREE_OPERAND (t
, 1)),
5306 /* Return an invariant ADDR_EXPR of type TYPE taking the address of BASE
5307 offsetted by OFFSET units. */
5310 build_invariant_address (tree type
, tree base
, poly_int64 offset
)
5312 tree ref
= fold_build2 (MEM_REF
, TREE_TYPE (type
),
5313 build_fold_addr_expr (base
),
5314 build_int_cst (ptr_type_node
, offset
));
5315 tree addr
= build1 (ADDR_EXPR
, type
, ref
);
5316 recompute_tree_invariant_for_addr_expr (addr
);
5320 /* Similar except don't specify the TREE_TYPE
5321 and leave the TREE_SIDE_EFFECTS as 0.
5322 It is permissible for arguments to be null,
5323 or even garbage if their values do not matter. */
5326 build_nt (enum tree_code code
, ...)
5333 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
5337 t
= make_node (code
);
5338 length
= TREE_CODE_LENGTH (code
);
5340 for (i
= 0; i
< length
; i
++)
5341 TREE_OPERAND (t
, i
) = va_arg (p
, tree
);
5347 /* Similar to build_nt, but for creating a CALL_EXPR object with a
5351 build_nt_call_vec (tree fn
, vec
<tree
, va_gc
> *args
)
5356 ret
= build_vl_exp (CALL_EXPR
, vec_safe_length (args
) + 3);
5357 CALL_EXPR_FN (ret
) = fn
;
5358 CALL_EXPR_STATIC_CHAIN (ret
) = NULL_TREE
;
5359 FOR_EACH_VEC_SAFE_ELT (args
, ix
, t
)
5360 CALL_EXPR_ARG (ret
, ix
) = t
;
5364 /* Create a DECL_... node of code CODE, name NAME (if non-null)
5366 We do NOT enter this node in any sort of symbol table.
5368 LOC is the location of the decl.
5370 layout_decl is used to set up the decl's storage layout.
5371 Other slots are initialized to 0 or null pointers. */
5374 build_decl (location_t loc
, enum tree_code code
, tree name
,
5375 tree type MEM_STAT_DECL
)
5379 t
= make_node (code PASS_MEM_STAT
);
5380 DECL_SOURCE_LOCATION (t
) = loc
;
5382 /* if (type == error_mark_node)
5383 type = integer_type_node; */
5384 /* That is not done, deliberately, so that having error_mark_node
5385 as the type can suppress useless errors in the use of this variable. */
5387 DECL_NAME (t
) = name
;
5388 TREE_TYPE (t
) = type
;
5390 if (code
== VAR_DECL
|| code
== PARM_DECL
|| code
== RESULT_DECL
)
5396 /* Create and return a DEBUG_EXPR_DECL node of the given TYPE. */
5399 build_debug_expr_decl (tree type
)
5401 tree vexpr
= make_node (DEBUG_EXPR_DECL
);
5402 DECL_ARTIFICIAL (vexpr
) = 1;
5403 TREE_TYPE (vexpr
) = type
;
5404 SET_DECL_MODE (vexpr
, TYPE_MODE (type
));
5408 /* Builds and returns function declaration with NAME and TYPE. */
5411 build_fn_decl (const char *name
, tree type
)
5413 tree id
= get_identifier (name
);
5414 tree decl
= build_decl (input_location
, FUNCTION_DECL
, id
, type
);
5416 DECL_EXTERNAL (decl
) = 1;
5417 TREE_PUBLIC (decl
) = 1;
5418 DECL_ARTIFICIAL (decl
) = 1;
5419 TREE_NOTHROW (decl
) = 1;
5424 vec
<tree
, va_gc
> *all_translation_units
;
5426 /* Builds a new translation-unit decl with name NAME, queues it in the
5427 global list of translation-unit decls and returns it. */
5430 build_translation_unit_decl (tree name
)
5432 tree tu
= build_decl (UNKNOWN_LOCATION
, TRANSLATION_UNIT_DECL
,
5434 TRANSLATION_UNIT_LANGUAGE (tu
) = lang_hooks
.name
;
5435 vec_safe_push (all_translation_units
, tu
);
5440 /* BLOCK nodes are used to represent the structure of binding contours
5441 and declarations, once those contours have been exited and their contents
5442 compiled. This information is used for outputting debugging info. */
5445 build_block (tree vars
, tree subblocks
, tree supercontext
, tree chain
)
5447 tree block
= make_node (BLOCK
);
5449 BLOCK_VARS (block
) = vars
;
5450 BLOCK_SUBBLOCKS (block
) = subblocks
;
5451 BLOCK_SUPERCONTEXT (block
) = supercontext
;
5452 BLOCK_CHAIN (block
) = chain
;
5457 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
5459 LOC is the location to use in tree T. */
5462 protected_set_expr_location (tree t
, location_t loc
)
5464 if (CAN_HAVE_LOCATION_P (t
))
5465 SET_EXPR_LOCATION (t
, loc
);
5466 else if (t
&& TREE_CODE (t
) == STATEMENT_LIST
)
5468 t
= expr_single (t
);
5469 if (t
&& CAN_HAVE_LOCATION_P (t
))
5470 SET_EXPR_LOCATION (t
, loc
);
5474 /* Like PROTECTED_SET_EXPR_LOCATION, but only do that if T has
5475 UNKNOWN_LOCATION. */
5478 protected_set_expr_location_if_unset (tree t
, location_t loc
)
5480 t
= expr_single (t
);
5481 if (t
&& !EXPR_HAS_LOCATION (t
))
5482 protected_set_expr_location (t
, loc
);
5485 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
5486 of the various TYPE_QUAL values. */
5489 set_type_quals (tree type
, int type_quals
)
5491 TYPE_READONLY (type
) = (type_quals
& TYPE_QUAL_CONST
) != 0;
5492 TYPE_VOLATILE (type
) = (type_quals
& TYPE_QUAL_VOLATILE
) != 0;
5493 TYPE_RESTRICT (type
) = (type_quals
& TYPE_QUAL_RESTRICT
) != 0;
5494 TYPE_ATOMIC (type
) = (type_quals
& TYPE_QUAL_ATOMIC
) != 0;
5495 TYPE_ADDR_SPACE (type
) = DECODE_QUAL_ADDR_SPACE (type_quals
);
5498 /* Returns true iff CAND and BASE have equivalent language-specific
5502 check_lang_type (const_tree cand
, const_tree base
)
5504 if (lang_hooks
.types
.type_hash_eq
== NULL
)
5506 /* type_hash_eq currently only applies to these types. */
5507 if (TREE_CODE (cand
) != FUNCTION_TYPE
5508 && TREE_CODE (cand
) != METHOD_TYPE
)
5510 return lang_hooks
.types
.type_hash_eq (cand
, base
);
5513 /* This function checks to see if TYPE matches the size one of the built-in
5514 atomic types, and returns that core atomic type. */
5517 find_atomic_core_type (const_tree type
)
5519 tree base_atomic_type
;
5521 /* Only handle complete types. */
5522 if (!tree_fits_uhwi_p (TYPE_SIZE (type
)))
5525 switch (tree_to_uhwi (TYPE_SIZE (type
)))
5528 base_atomic_type
= atomicQI_type_node
;
5532 base_atomic_type
= atomicHI_type_node
;
5536 base_atomic_type
= atomicSI_type_node
;
5540 base_atomic_type
= atomicDI_type_node
;
5544 base_atomic_type
= atomicTI_type_node
;
5548 base_atomic_type
= NULL_TREE
;
5551 return base_atomic_type
;
5554 /* Returns true iff unqualified CAND and BASE are equivalent. */
5557 check_base_type (const_tree cand
, const_tree base
)
5559 if (TYPE_NAME (cand
) != TYPE_NAME (base
)
5560 /* Apparently this is needed for Objective-C. */
5561 || TYPE_CONTEXT (cand
) != TYPE_CONTEXT (base
)
5562 || !attribute_list_equal (TYPE_ATTRIBUTES (cand
),
5563 TYPE_ATTRIBUTES (base
)))
5565 /* Check alignment. */
5566 if (TYPE_ALIGN (cand
) == TYPE_ALIGN (base
)
5567 && TYPE_USER_ALIGN (cand
) == TYPE_USER_ALIGN (base
))
5569 /* Atomic types increase minimal alignment. We must to do so as well
5570 or we get duplicated canonical types. See PR88686. */
5571 if ((TYPE_QUALS (cand
) & TYPE_QUAL_ATOMIC
))
5573 /* See if this object can map to a basic atomic type. */
5574 tree atomic_type
= find_atomic_core_type (cand
);
5575 if (atomic_type
&& TYPE_ALIGN (atomic_type
) == TYPE_ALIGN (cand
))
5581 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
5584 check_qualified_type (const_tree cand
, const_tree base
, int type_quals
)
5586 return (TYPE_QUALS (cand
) == type_quals
5587 && check_base_type (cand
, base
)
5588 && check_lang_type (cand
, base
));
5591 /* Returns true iff CAND is equivalent to BASE with ALIGN. */
5594 check_aligned_type (const_tree cand
, const_tree base
, unsigned int align
)
5596 return (TYPE_QUALS (cand
) == TYPE_QUALS (base
)
5597 && TYPE_NAME (cand
) == TYPE_NAME (base
)
5598 /* Apparently this is needed for Objective-C. */
5599 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
5600 /* Check alignment. */
5601 && TYPE_ALIGN (cand
) == align
5602 /* Check this is a user-aligned type as build_aligned_type
5604 && TYPE_USER_ALIGN (cand
)
5605 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
5606 TYPE_ATTRIBUTES (base
))
5607 && check_lang_type (cand
, base
));
5610 /* Return a version of the TYPE, qualified as indicated by the
5611 TYPE_QUALS, if one exists. If no qualified version exists yet,
5612 return NULL_TREE. */
5615 get_qualified_type (tree type
, int type_quals
)
5617 if (TYPE_QUALS (type
) == type_quals
)
5620 tree mv
= TYPE_MAIN_VARIANT (type
);
5621 if (check_qualified_type (mv
, type
, type_quals
))
5624 /* Search the chain of variants to see if there is already one there just
5625 like the one we need to have. If so, use that existing one. We must
5626 preserve the TYPE_NAME, since there is code that depends on this. */
5627 for (tree
*tp
= &TYPE_NEXT_VARIANT (mv
); *tp
; tp
= &TYPE_NEXT_VARIANT (*tp
))
5628 if (check_qualified_type (*tp
, type
, type_quals
))
5630 /* Put the found variant at the head of the variant list so
5631 frequently searched variants get found faster. The C++ FE
5632 benefits greatly from this. */
5634 *tp
= TYPE_NEXT_VARIANT (t
);
5635 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (mv
);
5636 TYPE_NEXT_VARIANT (mv
) = t
;
5643 /* Like get_qualified_type, but creates the type if it does not
5644 exist. This function never returns NULL_TREE. */
5647 build_qualified_type (tree type
, int type_quals MEM_STAT_DECL
)
5651 /* See if we already have the appropriate qualified variant. */
5652 t
= get_qualified_type (type
, type_quals
);
5654 /* If not, build it. */
5657 t
= build_variant_type_copy (type PASS_MEM_STAT
);
5658 set_type_quals (t
, type_quals
);
5660 if (((type_quals
& TYPE_QUAL_ATOMIC
) == TYPE_QUAL_ATOMIC
))
5662 /* See if this object can map to a basic atomic type. */
5663 tree atomic_type
= find_atomic_core_type (type
);
5666 /* Ensure the alignment of this type is compatible with
5667 the required alignment of the atomic type. */
5668 if (TYPE_ALIGN (atomic_type
) > TYPE_ALIGN (t
))
5669 SET_TYPE_ALIGN (t
, TYPE_ALIGN (atomic_type
));
5673 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
5674 /* Propagate structural equality. */
5675 SET_TYPE_STRUCTURAL_EQUALITY (t
);
5676 else if (TYPE_CANONICAL (type
) != type
)
5677 /* Build the underlying canonical type, since it is different
5680 tree c
= build_qualified_type (TYPE_CANONICAL (type
), type_quals
);
5681 TYPE_CANONICAL (t
) = TYPE_CANONICAL (c
);
5684 /* T is its own canonical type. */
5685 TYPE_CANONICAL (t
) = t
;
5692 /* Create a variant of type T with alignment ALIGN. */
5695 build_aligned_type (tree type
, unsigned int align
)
5699 if (TYPE_PACKED (type
)
5700 || TYPE_ALIGN (type
) == align
)
5703 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
5704 if (check_aligned_type (t
, type
, align
))
5707 t
= build_variant_type_copy (type
);
5708 SET_TYPE_ALIGN (t
, align
);
5709 TYPE_USER_ALIGN (t
) = 1;
5714 /* Create a new distinct copy of TYPE. The new type is made its own
5715 MAIN_VARIANT. If TYPE requires structural equality checks, the
5716 resulting type requires structural equality checks; otherwise, its
5717 TYPE_CANONICAL points to itself. */
5720 build_distinct_type_copy (tree type MEM_STAT_DECL
)
5722 tree t
= copy_node (type PASS_MEM_STAT
);
5724 TYPE_POINTER_TO (t
) = 0;
5725 TYPE_REFERENCE_TO (t
) = 0;
5727 /* Set the canonical type either to a new equivalence class, or
5728 propagate the need for structural equality checks. */
5729 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
5730 SET_TYPE_STRUCTURAL_EQUALITY (t
);
5732 TYPE_CANONICAL (t
) = t
;
5734 /* Make it its own variant. */
5735 TYPE_MAIN_VARIANT (t
) = t
;
5736 TYPE_NEXT_VARIANT (t
) = 0;
5738 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
5739 whose TREE_TYPE is not t. This can also happen in the Ada
5740 frontend when using subtypes. */
5745 /* Create a new variant of TYPE, equivalent but distinct. This is so
5746 the caller can modify it. TYPE_CANONICAL for the return type will
5747 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
5748 are considered equal by the language itself (or that both types
5749 require structural equality checks). */
5752 build_variant_type_copy (tree type MEM_STAT_DECL
)
5754 tree t
, m
= TYPE_MAIN_VARIANT (type
);
5756 t
= build_distinct_type_copy (type PASS_MEM_STAT
);
5758 /* Since we're building a variant, assume that it is a non-semantic
5759 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
5760 TYPE_CANONICAL (t
) = TYPE_CANONICAL (type
);
5761 /* Type variants have no alias set defined. */
5762 TYPE_ALIAS_SET (t
) = -1;
5764 /* Add the new type to the chain of variants of TYPE. */
5765 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (m
);
5766 TYPE_NEXT_VARIANT (m
) = t
;
5767 TYPE_MAIN_VARIANT (t
) = m
;
5772 /* Return true if the from tree in both tree maps are equal. */
5775 tree_map_base_eq (const void *va
, const void *vb
)
5777 const struct tree_map_base
*const a
= (const struct tree_map_base
*) va
,
5778 *const b
= (const struct tree_map_base
*) vb
;
5779 return (a
->from
== b
->from
);
5782 /* Hash a from tree in a tree_base_map. */
5785 tree_map_base_hash (const void *item
)
5787 return htab_hash_pointer (((const struct tree_map_base
*)item
)->from
);
5790 /* Return true if this tree map structure is marked for garbage collection
5791 purposes. We simply return true if the from tree is marked, so that this
5792 structure goes away when the from tree goes away. */
5795 tree_map_base_marked_p (const void *p
)
5797 return ggc_marked_p (((const struct tree_map_base
*) p
)->from
);
5800 /* Hash a from tree in a tree_map. */
5803 tree_map_hash (const void *item
)
5805 return (((const struct tree_map
*) item
)->hash
);
5808 /* Hash a from tree in a tree_decl_map. */
5811 tree_decl_map_hash (const void *item
)
5813 return DECL_UID (((const struct tree_decl_map
*) item
)->base
.from
);
5816 /* Return the initialization priority for DECL. */
5819 decl_init_priority_lookup (tree decl
)
5821 symtab_node
*snode
= symtab_node::get (decl
);
5824 return DEFAULT_INIT_PRIORITY
;
5826 snode
->get_init_priority ();
5829 /* Return the finalization priority for DECL. */
5832 decl_fini_priority_lookup (tree decl
)
5834 cgraph_node
*node
= cgraph_node::get (decl
);
5837 return DEFAULT_INIT_PRIORITY
;
5839 node
->get_fini_priority ();
5842 /* Set the initialization priority for DECL to PRIORITY. */
5845 decl_init_priority_insert (tree decl
, priority_type priority
)
5847 struct symtab_node
*snode
;
5849 if (priority
== DEFAULT_INIT_PRIORITY
)
5851 snode
= symtab_node::get (decl
);
5855 else if (VAR_P (decl
))
5856 snode
= varpool_node::get_create (decl
);
5858 snode
= cgraph_node::get_create (decl
);
5859 snode
->set_init_priority (priority
);
5862 /* Set the finalization priority for DECL to PRIORITY. */
5865 decl_fini_priority_insert (tree decl
, priority_type priority
)
5867 struct cgraph_node
*node
;
5869 if (priority
== DEFAULT_INIT_PRIORITY
)
5871 node
= cgraph_node::get (decl
);
5876 node
= cgraph_node::get_create (decl
);
5877 node
->set_fini_priority (priority
);
5880 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
5883 print_debug_expr_statistics (void)
5885 fprintf (stderr
, "DECL_DEBUG_EXPR hash: size " HOST_SIZE_T_PRINT_DEC
", "
5886 HOST_SIZE_T_PRINT_DEC
" elements, %f collisions\n",
5887 (fmt_size_t
) debug_expr_for_decl
->size (),
5888 (fmt_size_t
) debug_expr_for_decl
->elements (),
5889 debug_expr_for_decl
->collisions ());
5892 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
5895 print_value_expr_statistics (void)
5897 fprintf (stderr
, "DECL_VALUE_EXPR hash: size " HOST_SIZE_T_PRINT_DEC
", "
5898 HOST_SIZE_T_PRINT_DEC
" elements, %f collisions\n",
5899 (fmt_size_t
) value_expr_for_decl
->size (),
5900 (fmt_size_t
) value_expr_for_decl
->elements (),
5901 value_expr_for_decl
->collisions ());
5904 /* Lookup a debug expression for FROM, and return it if we find one. */
5907 decl_debug_expr_lookup (tree from
)
5909 struct tree_decl_map
*h
, in
;
5910 in
.base
.from
= from
;
5912 h
= debug_expr_for_decl
->find_with_hash (&in
, DECL_UID (from
));
5918 /* Insert a mapping FROM->TO in the debug expression hashtable. */
5921 decl_debug_expr_insert (tree from
, tree to
)
5923 struct tree_decl_map
*h
;
5925 h
= ggc_alloc
<tree_decl_map
> ();
5926 h
->base
.from
= from
;
5928 *debug_expr_for_decl
->find_slot_with_hash (h
, DECL_UID (from
), INSERT
) = h
;
5931 /* Lookup a value expression for FROM, and return it if we find one. */
5934 decl_value_expr_lookup (tree from
)
5936 struct tree_decl_map
*h
, in
;
5937 in
.base
.from
= from
;
5939 h
= value_expr_for_decl
->find_with_hash (&in
, DECL_UID (from
));
5945 /* Insert a mapping FROM->TO in the value expression hashtable. */
5948 decl_value_expr_insert (tree from
, tree to
)
5950 struct tree_decl_map
*h
;
5952 /* Uses of FROM shouldn't look like they happen at the location of TO. */
5953 to
= protected_set_expr_location_unshare (to
, UNKNOWN_LOCATION
);
5955 h
= ggc_alloc
<tree_decl_map
> ();
5956 h
->base
.from
= from
;
5958 *value_expr_for_decl
->find_slot_with_hash (h
, DECL_UID (from
), INSERT
) = h
;
5961 /* Lookup a vector of debug arguments for FROM, and return it if we
5965 decl_debug_args_lookup (tree from
)
5967 struct tree_vec_map
*h
, in
;
5969 if (!DECL_HAS_DEBUG_ARGS_P (from
))
5971 gcc_checking_assert (debug_args_for_decl
!= NULL
);
5972 in
.base
.from
= from
;
5973 h
= debug_args_for_decl
->find_with_hash (&in
, DECL_UID (from
));
5979 /* Insert a mapping FROM->empty vector of debug arguments in the value
5980 expression hashtable. */
5983 decl_debug_args_insert (tree from
)
5985 struct tree_vec_map
*h
;
5988 if (DECL_HAS_DEBUG_ARGS_P (from
))
5989 return decl_debug_args_lookup (from
);
5990 if (debug_args_for_decl
== NULL
)
5991 debug_args_for_decl
= hash_table
<tree_vec_map_cache_hasher
>::create_ggc (64);
5992 h
= ggc_alloc
<tree_vec_map
> ();
5993 h
->base
.from
= from
;
5995 loc
= debug_args_for_decl
->find_slot_with_hash (h
, DECL_UID (from
), INSERT
);
5997 DECL_HAS_DEBUG_ARGS_P (from
) = 1;
6001 /* Hashing of types so that we don't make duplicates.
6002 The entry point is `type_hash_canon'. */
6004 /* Generate the default hash code for TYPE. This is designed for
6005 speed, rather than maximum entropy. */
6008 type_hash_canon_hash (tree type
)
6010 inchash::hash hstate
;
6012 hstate
.add_int (TREE_CODE (type
));
6014 if (TREE_TYPE (type
))
6015 hstate
.add_object (TYPE_HASH (TREE_TYPE (type
)));
6017 for (tree t
= TYPE_ATTRIBUTES (type
); t
; t
= TREE_CHAIN (t
))
6018 /* Just the identifier is adequate to distinguish. */
6019 hstate
.add_object (IDENTIFIER_HASH_VALUE (get_attribute_name (t
)));
6021 switch (TREE_CODE (type
))
6024 hstate
.add_object (TYPE_HASH (TYPE_METHOD_BASETYPE (type
)));
6027 for (tree t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
6028 if (TREE_VALUE (t
) != error_mark_node
)
6029 hstate
.add_object (TYPE_HASH (TREE_VALUE (t
)));
6033 hstate
.add_object (TYPE_HASH (TYPE_OFFSET_BASETYPE (type
)));
6038 if (TYPE_DOMAIN (type
))
6039 hstate
.add_object (TYPE_HASH (TYPE_DOMAIN (type
)));
6040 if (!AGGREGATE_TYPE_P (TREE_TYPE (type
)))
6042 unsigned typeless
= TYPE_TYPELESS_STORAGE (type
);
6043 hstate
.add_object (typeless
);
6050 tree t
= TYPE_MAX_VALUE (type
);
6052 t
= TYPE_MIN_VALUE (type
);
6053 for (int i
= 0; i
< TREE_INT_CST_NUNITS (t
); i
++)
6054 hstate
.add_object (TREE_INT_CST_ELT (t
, i
));
6060 unsigned prec
= TYPE_PRECISION (type
);
6061 unsigned uns
= TYPE_UNSIGNED (type
);
6062 hstate
.add_object (prec
);
6063 hstate
.add_int (uns
);
6068 case FIXED_POINT_TYPE
:
6070 unsigned prec
= TYPE_PRECISION (type
);
6071 hstate
.add_object (prec
);
6076 hstate
.add_poly_int (TYPE_VECTOR_SUBPARTS (type
));
6083 return hstate
.end ();
6086 /* These are the Hashtable callback functions. */
6088 /* Returns true iff the types are equivalent. */
6091 type_cache_hasher::equal (type_hash
*a
, type_hash
*b
)
6093 /* First test the things that are the same for all types. */
6094 if (a
->hash
!= b
->hash
6095 || TREE_CODE (a
->type
) != TREE_CODE (b
->type
)
6096 || TREE_TYPE (a
->type
) != TREE_TYPE (b
->type
)
6097 || !attribute_list_equal (TYPE_ATTRIBUTES (a
->type
),
6098 TYPE_ATTRIBUTES (b
->type
))
6099 || (TREE_CODE (a
->type
) != COMPLEX_TYPE
6100 && TYPE_NAME (a
->type
) != TYPE_NAME (b
->type
)))
6103 /* Be careful about comparing arrays before and after the element type
6104 has been completed; don't compare TYPE_ALIGN unless both types are
6106 if (COMPLETE_TYPE_P (a
->type
) && COMPLETE_TYPE_P (b
->type
)
6107 && (TYPE_ALIGN (a
->type
) != TYPE_ALIGN (b
->type
)
6108 || TYPE_MODE (a
->type
) != TYPE_MODE (b
->type
)))
6111 switch (TREE_CODE (a
->type
))
6117 case REFERENCE_TYPE
:
6122 return known_eq (TYPE_VECTOR_SUBPARTS (a
->type
),
6123 TYPE_VECTOR_SUBPARTS (b
->type
));
6126 if (TYPE_VALUES (a
->type
) != TYPE_VALUES (b
->type
)
6127 && !(TYPE_VALUES (a
->type
)
6128 && TREE_CODE (TYPE_VALUES (a
->type
)) == TREE_LIST
6129 && TYPE_VALUES (b
->type
)
6130 && TREE_CODE (TYPE_VALUES (b
->type
)) == TREE_LIST
6131 && type_list_equal (TYPE_VALUES (a
->type
),
6132 TYPE_VALUES (b
->type
))))
6140 if (TYPE_PRECISION (a
->type
) != TYPE_PRECISION (b
->type
))
6142 return ((TYPE_MAX_VALUE (a
->type
) == TYPE_MAX_VALUE (b
->type
)
6143 || tree_int_cst_equal (TYPE_MAX_VALUE (a
->type
),
6144 TYPE_MAX_VALUE (b
->type
)))
6145 && (TYPE_MIN_VALUE (a
->type
) == TYPE_MIN_VALUE (b
->type
)
6146 || tree_int_cst_equal (TYPE_MIN_VALUE (a
->type
),
6147 TYPE_MIN_VALUE (b
->type
))));
6150 if (TYPE_PRECISION (a
->type
) != TYPE_PRECISION (b
->type
))
6152 return TYPE_UNSIGNED (a
->type
) == TYPE_UNSIGNED (b
->type
);
6154 case FIXED_POINT_TYPE
:
6155 return TYPE_SATURATING (a
->type
) == TYPE_SATURATING (b
->type
);
6158 return TYPE_OFFSET_BASETYPE (a
->type
) == TYPE_OFFSET_BASETYPE (b
->type
);
6161 if (TYPE_METHOD_BASETYPE (a
->type
) == TYPE_METHOD_BASETYPE (b
->type
)
6162 && (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
6163 || (TYPE_ARG_TYPES (a
->type
)
6164 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
6165 && TYPE_ARG_TYPES (b
->type
)
6166 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
6167 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
6168 TYPE_ARG_TYPES (b
->type
)))))
6172 /* Don't compare TYPE_TYPELESS_STORAGE flag on aggregates,
6173 where the flag should be inherited from the element type
6174 and can change after ARRAY_TYPEs are created; on non-aggregates
6175 compare it and hash it, scalars will never have that flag set
6176 and we need to differentiate between arrays created by different
6177 front-ends or middle-end created arrays. */
6178 return (TYPE_DOMAIN (a
->type
) == TYPE_DOMAIN (b
->type
)
6179 && (AGGREGATE_TYPE_P (TREE_TYPE (a
->type
))
6180 || (TYPE_TYPELESS_STORAGE (a
->type
)
6181 == TYPE_TYPELESS_STORAGE (b
->type
))));
6185 case QUAL_UNION_TYPE
:
6186 return (TYPE_FIELDS (a
->type
) == TYPE_FIELDS (b
->type
)
6187 || (TYPE_FIELDS (a
->type
)
6188 && TREE_CODE (TYPE_FIELDS (a
->type
)) == TREE_LIST
6189 && TYPE_FIELDS (b
->type
)
6190 && TREE_CODE (TYPE_FIELDS (b
->type
)) == TREE_LIST
6191 && type_list_equal (TYPE_FIELDS (a
->type
),
6192 TYPE_FIELDS (b
->type
))));
6195 if ((TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
6196 && (TYPE_NO_NAMED_ARGS_STDARG_P (a
->type
)
6197 == TYPE_NO_NAMED_ARGS_STDARG_P (b
->type
)))
6198 || (TYPE_ARG_TYPES (a
->type
)
6199 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
6200 && TYPE_ARG_TYPES (b
->type
)
6201 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
6202 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
6203 TYPE_ARG_TYPES (b
->type
))))
6211 if (lang_hooks
.types
.type_hash_eq
!= NULL
)
6212 return lang_hooks
.types
.type_hash_eq (a
->type
, b
->type
);
6217 /* Given TYPE, and HASHCODE its hash code, return the canonical
6218 object for an identical type if one already exists.
6219 Otherwise, return TYPE, and record it as the canonical object.
6221 To use this function, first create a type of the sort you want.
6222 Then compute its hash code from the fields of the type that
6223 make it different from other similar types.
6224 Then call this function and use the value. */
6227 type_hash_canon (unsigned int hashcode
, tree type
)
6232 /* The hash table only contains main variants, so ensure that's what we're
6234 gcc_assert (TYPE_MAIN_VARIANT (type
) == type
);
6236 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
6237 must call that routine before comparing TYPE_ALIGNs. */
6243 loc
= type_hash_table
->find_slot_with_hash (&in
, hashcode
, INSERT
);
6246 tree t1
= ((type_hash
*) *loc
)->type
;
6247 gcc_assert (TYPE_MAIN_VARIANT (t1
) == t1
6249 if (TYPE_UID (type
) + 1 == next_type_uid
)
6251 /* Free also min/max values and the cache for integer
6252 types. This can't be done in free_node, as LTO frees
6253 those on its own. */
6254 if (TREE_CODE (type
) == INTEGER_TYPE
|| TREE_CODE (type
) == BITINT_TYPE
)
6256 if (TYPE_MIN_VALUE (type
)
6257 && TREE_TYPE (TYPE_MIN_VALUE (type
)) == type
)
6259 /* Zero is always in TYPE_CACHED_VALUES. */
6260 if (! TYPE_UNSIGNED (type
))
6261 int_cst_hash_table
->remove_elt (TYPE_MIN_VALUE (type
));
6262 ggc_free (TYPE_MIN_VALUE (type
));
6264 if (TYPE_MAX_VALUE (type
)
6265 && TREE_TYPE (TYPE_MAX_VALUE (type
)) == type
)
6267 int_cst_hash_table
->remove_elt (TYPE_MAX_VALUE (type
));
6268 ggc_free (TYPE_MAX_VALUE (type
));
6270 if (TYPE_CACHED_VALUES_P (type
))
6271 ggc_free (TYPE_CACHED_VALUES (type
));
6278 struct type_hash
*h
;
6280 h
= ggc_alloc
<type_hash
> ();
6290 print_type_hash_statistics (void)
6292 fprintf (stderr
, "Type hash: size " HOST_SIZE_T_PRINT_DEC
", "
6293 HOST_SIZE_T_PRINT_DEC
" elements, %f collisions\n",
6294 (fmt_size_t
) type_hash_table
->size (),
6295 (fmt_size_t
) type_hash_table
->elements (),
6296 type_hash_table
->collisions ());
6299 /* Given two lists of types
6300 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
6301 return 1 if the lists contain the same types in the same order.
6302 Also, the TREE_PURPOSEs must match. */
6305 type_list_equal (const_tree l1
, const_tree l2
)
6309 for (t1
= l1
, t2
= l2
; t1
&& t2
; t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
6310 if (TREE_VALUE (t1
) != TREE_VALUE (t2
)
6311 || (TREE_PURPOSE (t1
) != TREE_PURPOSE (t2
)
6312 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
))
6313 && (TREE_TYPE (TREE_PURPOSE (t1
))
6314 == TREE_TYPE (TREE_PURPOSE (t2
))))))
6320 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
6321 given by TYPE. If the argument list accepts variable arguments,
6322 then this function counts only the ordinary arguments. */
6325 type_num_arguments (const_tree fntype
)
6329 for (tree t
= TYPE_ARG_TYPES (fntype
); t
; t
= TREE_CHAIN (t
))
6330 /* If the function does not take a variable number of arguments,
6331 the last element in the list will have type `void'. */
6332 if (VOID_TYPE_P (TREE_VALUE (t
)))
6340 /* Return the type of the function TYPE's argument ARGNO if known.
6341 For vararg function's where ARGNO refers to one of the variadic
6342 arguments return null. Otherwise, return a void_type_node for
6343 out-of-bounds ARGNO. */
6346 type_argument_type (const_tree fntype
, unsigned argno
)
6348 /* Treat zero the same as an out-of-bounds argument number. */
6350 return void_type_node
;
6352 function_args_iterator iter
;
6356 FOREACH_FUNCTION_ARGS (fntype
, argtype
, iter
)
6358 /* A vararg function's argument list ends in a null. Otherwise,
6359 an ordinary function's argument list ends with void. Return
6360 null if ARGNO refers to a vararg argument, void_type_node if
6361 it's out of bounds, and the formal argument type otherwise. */
6365 if (i
== argno
|| VOID_TYPE_P (argtype
))
6374 /* True if integer constants T1 and T2
6375 represent the same constant value. */
6378 tree_int_cst_equal (const_tree t1
, const_tree t2
)
6383 if (t1
== 0 || t2
== 0)
6386 STRIP_ANY_LOCATION_WRAPPER (t1
);
6387 STRIP_ANY_LOCATION_WRAPPER (t2
);
6389 if (TREE_CODE (t1
) == INTEGER_CST
6390 && TREE_CODE (t2
) == INTEGER_CST
6391 && wi::to_widest (t1
) == wi::to_widest (t2
))
6397 /* Return true if T is an INTEGER_CST whose numerical value (extended
6398 according to TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. */
6401 tree_fits_shwi_p (const_tree t
)
6403 return (t
!= NULL_TREE
6404 && TREE_CODE (t
) == INTEGER_CST
6405 && wi::fits_shwi_p (wi::to_widest (t
)));
6408 /* Return true if T is an INTEGER_CST or POLY_INT_CST whose numerical
6409 value (extended according to TYPE_UNSIGNED) fits in a poly_int64. */
6412 tree_fits_poly_int64_p (const_tree t
)
6416 if (POLY_INT_CST_P (t
))
6418 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; i
++)
6419 if (!wi::fits_shwi_p (wi::to_wide (POLY_INT_CST_COEFF (t
, i
))))
6423 return (TREE_CODE (t
) == INTEGER_CST
6424 && wi::fits_shwi_p (wi::to_widest (t
)));
6427 /* Return true if T is an INTEGER_CST whose numerical value (extended
6428 according to TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. */
6431 tree_fits_uhwi_p (const_tree t
)
6433 return (t
!= NULL_TREE
6434 && TREE_CODE (t
) == INTEGER_CST
6435 && wi::fits_uhwi_p (wi::to_widest (t
)));
6438 /* Return true if T is an INTEGER_CST or POLY_INT_CST whose numerical
6439 value (extended according to TYPE_UNSIGNED) fits in a poly_uint64. */
6442 tree_fits_poly_uint64_p (const_tree t
)
6446 if (POLY_INT_CST_P (t
))
6448 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; i
++)
6449 if (!wi::fits_uhwi_p (wi::to_widest (POLY_INT_CST_COEFF (t
, i
))))
6453 return (TREE_CODE (t
) == INTEGER_CST
6454 && wi::fits_uhwi_p (wi::to_widest (t
)));
6457 /* T is an INTEGER_CST whose numerical value (extended according to
6458 TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. Return that
6462 tree_to_shwi (const_tree t
)
6464 gcc_assert (tree_fits_shwi_p (t
));
6465 return TREE_INT_CST_LOW (t
);
6468 /* T is an INTEGER_CST whose numerical value (extended according to
6469 TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. Return that
6472 unsigned HOST_WIDE_INT
6473 tree_to_uhwi (const_tree t
)
6475 gcc_assert (tree_fits_uhwi_p (t
));
6476 return TREE_INT_CST_LOW (t
);
6479 /* Return the most significant (sign) bit of T. */
6482 tree_int_cst_sign_bit (const_tree t
)
6484 unsigned bitno
= TYPE_PRECISION (TREE_TYPE (t
)) - 1;
6486 return wi::extract_uhwi (wi::to_wide (t
), bitno
, 1);
6489 /* Return an indication of the sign of the integer constant T.
6490 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
6491 Note that -1 will never be returned if T's type is unsigned. */
6494 tree_int_cst_sgn (const_tree t
)
6496 if (wi::to_wide (t
) == 0)
6498 else if (TYPE_UNSIGNED (TREE_TYPE (t
)))
6500 else if (wi::neg_p (wi::to_wide (t
)))
6506 /* Return the minimum number of bits needed to represent VALUE in a
6507 signed or unsigned type, UNSIGNEDP says which. */
6510 tree_int_cst_min_precision (tree value
, signop sgn
)
6512 /* If the value is negative, compute its negative minus 1. The latter
6513 adjustment is because the absolute value of the largest negative value
6514 is one larger than the largest positive value. This is equivalent to
6515 a bit-wise negation, so use that operation instead. */
6517 if (tree_int_cst_sgn (value
) < 0)
6518 value
= fold_build1 (BIT_NOT_EXPR
, TREE_TYPE (value
), value
);
6520 /* Return the number of bits needed, taking into account the fact
6521 that we need one more bit for a signed than unsigned type.
6522 If value is 0 or -1, the minimum precision is 1 no matter
6523 whether unsignedp is true or false. */
6525 if (integer_zerop (value
))
6528 return tree_floor_log2 (value
) + 1 + (sgn
== SIGNED
? 1 : 0) ;
6531 /* Return truthvalue of whether T1 is the same tree structure as T2.
6532 Return 1 if they are the same.
6533 Return 0 if they are understandably different.
6534 Return -1 if either contains tree structure not understood by
6538 simple_cst_equal (const_tree t1
, const_tree t2
)
6540 enum tree_code code1
, code2
;
6546 if (t1
== 0 || t2
== 0)
6549 /* For location wrappers to be the same, they must be at the same
6550 source location (and wrap the same thing). */
6551 if (location_wrapper_p (t1
) && location_wrapper_p (t2
))
6553 if (EXPR_LOCATION (t1
) != EXPR_LOCATION (t2
))
6555 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6558 code1
= TREE_CODE (t1
);
6559 code2
= TREE_CODE (t2
);
6561 if (CONVERT_EXPR_CODE_P (code1
) || code1
== NON_LVALUE_EXPR
)
6563 if (CONVERT_EXPR_CODE_P (code2
)
6564 || code2
== NON_LVALUE_EXPR
)
6565 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6567 return simple_cst_equal (TREE_OPERAND (t1
, 0), t2
);
6570 else if (CONVERT_EXPR_CODE_P (code2
)
6571 || code2
== NON_LVALUE_EXPR
)
6572 return simple_cst_equal (t1
, TREE_OPERAND (t2
, 0));
6580 return wi::to_widest (t1
) == wi::to_widest (t2
);
6583 return real_identical (&TREE_REAL_CST (t1
), &TREE_REAL_CST (t2
));
6586 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1
), TREE_FIXED_CST (t2
));
6589 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
6590 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
6591 TREE_STRING_LENGTH (t1
)));
6595 unsigned HOST_WIDE_INT idx
;
6596 vec
<constructor_elt
, va_gc
> *v1
= CONSTRUCTOR_ELTS (t1
);
6597 vec
<constructor_elt
, va_gc
> *v2
= CONSTRUCTOR_ELTS (t2
);
6599 if (vec_safe_length (v1
) != vec_safe_length (v2
))
6602 for (idx
= 0; idx
< vec_safe_length (v1
); ++idx
)
6603 /* ??? Should we handle also fields here? */
6604 if (!simple_cst_equal ((*v1
)[idx
].value
, (*v2
)[idx
].value
))
6610 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6613 cmp
= simple_cst_equal (CALL_EXPR_FN (t1
), CALL_EXPR_FN (t2
));
6616 if (call_expr_nargs (t1
) != call_expr_nargs (t2
))
6619 const_tree arg1
, arg2
;
6620 const_call_expr_arg_iterator iter1
, iter2
;
6621 for (arg1
= first_const_call_expr_arg (t1
, &iter1
),
6622 arg2
= first_const_call_expr_arg (t2
, &iter2
);
6624 arg1
= next_const_call_expr_arg (&iter1
),
6625 arg2
= next_const_call_expr_arg (&iter2
))
6627 cmp
= simple_cst_equal (arg1
, arg2
);
6631 return arg1
== arg2
;
6635 /* Special case: if either target is an unallocated VAR_DECL,
6636 it means that it's going to be unified with whatever the
6637 TARGET_EXPR is really supposed to initialize, so treat it
6638 as being equivalent to anything. */
6639 if ((TREE_CODE (TREE_OPERAND (t1
, 0)) == VAR_DECL
6640 && DECL_NAME (TREE_OPERAND (t1
, 0)) == NULL_TREE
6641 && !DECL_RTL_SET_P (TREE_OPERAND (t1
, 0)))
6642 || (TREE_CODE (TREE_OPERAND (t2
, 0)) == VAR_DECL
6643 && DECL_NAME (TREE_OPERAND (t2
, 0)) == NULL_TREE
6644 && !DECL_RTL_SET_P (TREE_OPERAND (t2
, 0))))
6647 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6652 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
6654 case WITH_CLEANUP_EXPR
:
6655 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6659 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t1
, 1));
6662 if (TREE_OPERAND (t1
, 1) == TREE_OPERAND (t2
, 1))
6663 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6674 if (POLY_INT_CST_P (t1
))
6675 /* A false return means maybe_ne rather than known_ne. */
6676 return known_eq (poly_widest_int::from (poly_int_cst_value (t1
),
6677 TYPE_SIGN (TREE_TYPE (t1
))),
6678 poly_widest_int::from (poly_int_cst_value (t2
),
6679 TYPE_SIGN (TREE_TYPE (t2
))));
6683 /* This general rule works for most tree codes. All exceptions should be
6684 handled above. If this is a language-specific tree code, we can't
6685 trust what might be in the operand, so say we don't know
6687 if ((int) code1
>= (int) LAST_AND_UNUSED_TREE_CODE
)
6690 switch (TREE_CODE_CLASS (code1
))
6694 case tcc_comparison
:
6695 case tcc_expression
:
6699 for (i
= 0; i
< TREE_CODE_LENGTH (code1
); i
++)
6701 cmp
= simple_cst_equal (TREE_OPERAND (t1
, i
), TREE_OPERAND (t2
, i
));
6713 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
6714 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
6715 than U, respectively. */
6718 compare_tree_int (const_tree t
, unsigned HOST_WIDE_INT u
)
6720 if (tree_int_cst_sgn (t
) < 0)
6722 else if (!tree_fits_uhwi_p (t
))
6724 else if (TREE_INT_CST_LOW (t
) == u
)
6726 else if (TREE_INT_CST_LOW (t
) < u
)
6732 /* Return true if SIZE represents a constant size that is in bounds of
6733 what the middle-end and the backend accepts (covering not more than
6734 half of the address-space).
6735 When PERR is non-null, set *PERR on failure to the description of
6736 why SIZE is not valid. */
6739 valid_constant_size_p (const_tree size
, cst_size_error
*perr
/* = NULL */)
6741 if (POLY_INT_CST_P (size
))
6743 if (TREE_OVERFLOW (size
))
6745 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
6746 if (!valid_constant_size_p (POLY_INT_CST_COEFF (size
, i
)))
6751 cst_size_error error
;
6755 if (TREE_CODE (size
) != INTEGER_CST
)
6757 *perr
= cst_size_not_constant
;
6761 if (TREE_OVERFLOW_P (size
))
6763 *perr
= cst_size_overflow
;
6767 if (tree_int_cst_sgn (size
) < 0)
6769 *perr
= cst_size_negative
;
6772 if (!tree_fits_uhwi_p (size
)
6773 || (wi::to_widest (TYPE_MAX_VALUE (sizetype
))
6774 < wi::to_widest (size
) * 2))
6776 *perr
= cst_size_too_big
;
6783 /* Return the precision of the type, or for a complex or vector type the
6784 precision of the type of its elements. */
6787 element_precision (const_tree type
)
6790 type
= TREE_TYPE (type
);
6791 enum tree_code code
= TREE_CODE (type
);
6792 if (code
== COMPLEX_TYPE
|| code
== VECTOR_TYPE
)
6793 type
= TREE_TYPE (type
);
6795 return TYPE_PRECISION (type
);
6798 /* Return true if CODE represents an associative tree code. Otherwise
6801 associative_tree_code (enum tree_code code
)
6820 /* Return true if CODE represents a commutative tree code. Otherwise
6823 commutative_tree_code (enum tree_code code
)
6829 case MULT_HIGHPART_EXPR
:
6837 case UNORDERED_EXPR
:
6841 case TRUTH_AND_EXPR
:
6842 case TRUTH_XOR_EXPR
:
6844 case WIDEN_MULT_EXPR
:
6845 case VEC_WIDEN_MULT_HI_EXPR
:
6846 case VEC_WIDEN_MULT_LO_EXPR
:
6847 case VEC_WIDEN_MULT_EVEN_EXPR
:
6848 case VEC_WIDEN_MULT_ODD_EXPR
:
6857 /* Return true if CODE represents a ternary tree code for which the
6858 first two operands are commutative. Otherwise return false. */
6860 commutative_ternary_tree_code (enum tree_code code
)
6864 case WIDEN_MULT_PLUS_EXPR
:
6865 case WIDEN_MULT_MINUS_EXPR
:
6875 /* Returns true if CODE can overflow. */
6878 operation_can_overflow (enum tree_code code
)
6886 /* Can overflow in various ways. */
6888 case TRUNC_DIV_EXPR
:
6889 case EXACT_DIV_EXPR
:
6890 case FLOOR_DIV_EXPR
:
6892 /* For INT_MIN / -1. */
6899 /* These operators cannot overflow. */
6904 /* Returns true if CODE operating on operands of type TYPE doesn't overflow, or
6905 ftrapv doesn't generate trapping insns for CODE. */
6908 operation_no_trapping_overflow (tree type
, enum tree_code code
)
6910 gcc_checking_assert (ANY_INTEGRAL_TYPE_P (type
));
6912 /* We don't generate instructions that trap on overflow for complex or vector
6914 if (!INTEGRAL_TYPE_P (type
))
6917 if (!TYPE_OVERFLOW_TRAPS (type
))
6927 /* These operators can overflow, and -ftrapv generates trapping code for
6930 case TRUNC_DIV_EXPR
:
6931 case EXACT_DIV_EXPR
:
6932 case FLOOR_DIV_EXPR
:
6935 /* These operators can overflow, but -ftrapv does not generate trapping
6939 /* These operators cannot overflow. */
6944 /* Constructors for pointer, array and function types.
6945 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
6946 constructed by language-dependent code, not here.) */
6948 /* Construct, lay out and return the type of pointers to TO_TYPE with
6949 mode MODE. If MODE is VOIDmode, a pointer mode for the address
6950 space of TO_TYPE will be picked. If CAN_ALIAS_ALL is TRUE,
6951 indicate this type can reference all of memory. If such a type has
6952 already been constructed, reuse it. */
6955 build_pointer_type_for_mode (tree to_type
, machine_mode mode
,
6959 bool could_alias
= can_alias_all
;
6961 if (to_type
== error_mark_node
)
6962 return error_mark_node
;
6964 if (mode
== VOIDmode
)
6966 addr_space_t as
= TYPE_ADDR_SPACE (to_type
);
6967 mode
= targetm
.addr_space
.pointer_mode (as
);
6970 /* If the pointed-to type has the may_alias attribute set, force
6971 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
6972 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
6973 can_alias_all
= true;
6975 /* In some cases, languages will have things that aren't a POINTER_TYPE
6976 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
6977 In that case, return that type without regard to the rest of our
6980 ??? This is a kludge, but consistent with the way this function has
6981 always operated and there doesn't seem to be a good way to avoid this
6983 if (TYPE_POINTER_TO (to_type
) != 0
6984 && TREE_CODE (TYPE_POINTER_TO (to_type
)) != POINTER_TYPE
)
6985 return TYPE_POINTER_TO (to_type
);
6987 /* First, if we already have a type for pointers to TO_TYPE and it's
6988 the proper mode, use it. */
6989 for (t
= TYPE_POINTER_TO (to_type
); t
; t
= TYPE_NEXT_PTR_TO (t
))
6990 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
6993 t
= make_node (POINTER_TYPE
);
6995 TREE_TYPE (t
) = to_type
;
6996 SET_TYPE_MODE (t
, mode
);
6997 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
6998 TYPE_NEXT_PTR_TO (t
) = TYPE_POINTER_TO (to_type
);
6999 TYPE_POINTER_TO (to_type
) = t
;
7001 /* During LTO we do not set TYPE_CANONICAL of pointers and references. */
7002 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
) || in_lto_p
)
7003 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7004 else if (TYPE_CANONICAL (to_type
) != to_type
|| could_alias
)
7006 = build_pointer_type_for_mode (TYPE_CANONICAL (to_type
),
7009 /* Lay out the type. This function has many callers that are concerned
7010 with expression-construction, and this simplifies them all. */
7016 /* By default build pointers in ptr_mode. */
7019 build_pointer_type (tree to_type
)
7021 return build_pointer_type_for_mode (to_type
, VOIDmode
, false);
7024 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
7027 build_reference_type_for_mode (tree to_type
, machine_mode mode
,
7031 bool could_alias
= can_alias_all
;
7033 if (to_type
== error_mark_node
)
7034 return error_mark_node
;
7036 if (mode
== VOIDmode
)
7038 addr_space_t as
= TYPE_ADDR_SPACE (to_type
);
7039 mode
= targetm
.addr_space
.pointer_mode (as
);
7042 /* If the pointed-to type has the may_alias attribute set, force
7043 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7044 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
7045 can_alias_all
= true;
7047 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
7048 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
7049 In that case, return that type without regard to the rest of our
7052 ??? This is a kludge, but consistent with the way this function has
7053 always operated and there doesn't seem to be a good way to avoid this
7055 if (TYPE_REFERENCE_TO (to_type
) != 0
7056 && TREE_CODE (TYPE_REFERENCE_TO (to_type
)) != REFERENCE_TYPE
)
7057 return TYPE_REFERENCE_TO (to_type
);
7059 /* First, if we already have a type for pointers to TO_TYPE and it's
7060 the proper mode, use it. */
7061 for (t
= TYPE_REFERENCE_TO (to_type
); t
; t
= TYPE_NEXT_REF_TO (t
))
7062 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
7065 t
= make_node (REFERENCE_TYPE
);
7067 TREE_TYPE (t
) = to_type
;
7068 SET_TYPE_MODE (t
, mode
);
7069 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
7070 TYPE_NEXT_REF_TO (t
) = TYPE_REFERENCE_TO (to_type
);
7071 TYPE_REFERENCE_TO (to_type
) = t
;
7073 /* During LTO we do not set TYPE_CANONICAL of pointers and references. */
7074 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
) || in_lto_p
)
7075 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7076 else if (TYPE_CANONICAL (to_type
) != to_type
|| could_alias
)
7078 = build_reference_type_for_mode (TYPE_CANONICAL (to_type
),
7087 /* Build the node for the type of references-to-TO_TYPE by default
7091 build_reference_type (tree to_type
)
7093 return build_reference_type_for_mode (to_type
, VOIDmode
, false);
7096 #define MAX_INT_CACHED_PREC \
7097 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
7098 static GTY(()) tree nonstandard_integer_type_cache
[2 * MAX_INT_CACHED_PREC
+ 2];
7101 clear_nonstandard_integer_type_cache (void)
7103 for (size_t i
= 0 ; i
< 2 * MAX_INT_CACHED_PREC
+ 2 ; i
++)
7105 nonstandard_integer_type_cache
[i
] = NULL
;
7109 /* Builds a signed or unsigned integer type of precision PRECISION.
7110 Used for C bitfields whose precision does not match that of
7111 built-in target types. */
7113 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision
,
7119 unsignedp
= MAX_INT_CACHED_PREC
+ 1;
7121 if (precision
<= MAX_INT_CACHED_PREC
)
7123 itype
= nonstandard_integer_type_cache
[precision
+ unsignedp
];
7128 itype
= make_node (INTEGER_TYPE
);
7129 TYPE_PRECISION (itype
) = precision
;
7132 fixup_unsigned_type (itype
);
7134 fixup_signed_type (itype
);
7136 inchash::hash hstate
;
7137 inchash::add_expr (TYPE_MAX_VALUE (itype
), hstate
);
7138 ret
= type_hash_canon (hstate
.end (), itype
);
7139 if (precision
<= MAX_INT_CACHED_PREC
)
7140 nonstandard_integer_type_cache
[precision
+ unsignedp
] = ret
;
7145 #define MAX_BOOL_CACHED_PREC \
7146 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
7147 static GTY(()) tree nonstandard_boolean_type_cache
[MAX_BOOL_CACHED_PREC
+ 1];
7149 /* Builds a boolean type of precision PRECISION.
7150 Used for boolean vectors to choose proper vector element size. */
7152 build_nonstandard_boolean_type (unsigned HOST_WIDE_INT precision
)
7156 if (precision
<= MAX_BOOL_CACHED_PREC
)
7158 type
= nonstandard_boolean_type_cache
[precision
];
7163 type
= make_node (BOOLEAN_TYPE
);
7164 TYPE_PRECISION (type
) = precision
;
7165 fixup_signed_type (type
);
7167 if (precision
<= MAX_INT_CACHED_PREC
)
7168 nonstandard_boolean_type_cache
[precision
] = type
;
7173 static GTY(()) vec
<tree
, va_gc
> *bitint_type_cache
;
7175 /* Builds a signed or unsigned _BitInt(PRECISION) type. */
7177 build_bitint_type (unsigned HOST_WIDE_INT precision
, int unsignedp
)
7181 gcc_checking_assert (precision
>= 1 + !unsignedp
);
7184 unsignedp
= MAX_INT_CACHED_PREC
+ 1;
7186 if (bitint_type_cache
== NULL
)
7187 vec_safe_grow_cleared (bitint_type_cache
, 2 * MAX_INT_CACHED_PREC
+ 2);
7189 if (precision
<= MAX_INT_CACHED_PREC
)
7191 itype
= (*bitint_type_cache
)[precision
+ unsignedp
];
7196 itype
= make_node (BITINT_TYPE
);
7197 TYPE_PRECISION (itype
) = precision
;
7200 fixup_unsigned_type (itype
);
7202 fixup_signed_type (itype
);
7204 inchash::hash hstate
;
7205 inchash::add_expr (TYPE_MAX_VALUE (itype
), hstate
);
7206 ret
= type_hash_canon (hstate
.end (), itype
);
7207 if (precision
<= MAX_INT_CACHED_PREC
)
7208 (*bitint_type_cache
)[precision
+ unsignedp
] = ret
;
7213 /* Create a range of some discrete type TYPE (an INTEGER_TYPE, ENUMERAL_TYPE
7214 or BOOLEAN_TYPE) with low bound LOWVAL and high bound HIGHVAL. If SHARED
7215 is true, reuse such a type that has already been constructed. */
7218 build_range_type_1 (tree type
, tree lowval
, tree highval
, bool shared
)
7220 tree itype
= make_node (INTEGER_TYPE
);
7222 TREE_TYPE (itype
) = type
;
7224 TYPE_MIN_VALUE (itype
) = fold_convert (type
, lowval
);
7225 TYPE_MAX_VALUE (itype
) = highval
? fold_convert (type
, highval
) : NULL
;
7227 TYPE_PRECISION (itype
) = TYPE_PRECISION (type
);
7228 SET_TYPE_MODE (itype
, TYPE_MODE (type
));
7229 TYPE_SIZE (itype
) = TYPE_SIZE (type
);
7230 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (type
);
7231 SET_TYPE_ALIGN (itype
, TYPE_ALIGN (type
));
7232 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (type
);
7233 SET_TYPE_WARN_IF_NOT_ALIGN (itype
, TYPE_WARN_IF_NOT_ALIGN (type
));
7238 if ((TYPE_MIN_VALUE (itype
)
7239 && TREE_CODE (TYPE_MIN_VALUE (itype
)) != INTEGER_CST
)
7240 || (TYPE_MAX_VALUE (itype
)
7241 && TREE_CODE (TYPE_MAX_VALUE (itype
)) != INTEGER_CST
))
7243 /* Since we cannot reliably merge this type, we need to compare it using
7244 structural equality checks. */
7245 SET_TYPE_STRUCTURAL_EQUALITY (itype
);
7249 hashval_t hash
= type_hash_canon_hash (itype
);
7250 itype
= type_hash_canon (hash
, itype
);
7255 /* Wrapper around build_range_type_1 with SHARED set to true. */
7258 build_range_type (tree type
, tree lowval
, tree highval
)
7260 return build_range_type_1 (type
, lowval
, highval
, true);
7263 /* Wrapper around build_range_type_1 with SHARED set to false. */
7266 build_nonshared_range_type (tree type
, tree lowval
, tree highval
)
7268 return build_range_type_1 (type
, lowval
, highval
, false);
7271 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
7272 MAXVAL should be the maximum value in the domain
7273 (one less than the length of the array).
7275 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
7276 We don't enforce this limit, that is up to caller (e.g. language front end).
7277 The limit exists because the result is a signed type and we don't handle
7278 sizes that use more than one HOST_WIDE_INT. */
7281 build_index_type (tree maxval
)
7283 return build_range_type (sizetype
, size_zero_node
, maxval
);
7286 /* Return true if the debug information for TYPE, a subtype, should be emitted
7287 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
7288 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
7289 debug info and doesn't reflect the source code. */
7292 subrange_type_for_debug_p (const_tree type
, tree
*lowval
, tree
*highval
)
7294 tree base_type
= TREE_TYPE (type
), low
, high
;
7296 /* Subrange types have a base type which is an integral type. */
7297 if (!INTEGRAL_TYPE_P (base_type
))
7300 /* Get the real bounds of the subtype. */
7301 if (lang_hooks
.types
.get_subrange_bounds
)
7302 lang_hooks
.types
.get_subrange_bounds (type
, &low
, &high
);
7305 low
= TYPE_MIN_VALUE (type
);
7306 high
= TYPE_MAX_VALUE (type
);
7309 /* If the type and its base type have the same representation and the same
7310 name, then the type is not a subrange but a copy of the base type. */
7311 if ((TREE_CODE (base_type
) == INTEGER_TYPE
7312 || TREE_CODE (base_type
) == BOOLEAN_TYPE
)
7313 && int_size_in_bytes (type
) == int_size_in_bytes (base_type
)
7314 && tree_int_cst_equal (low
, TYPE_MIN_VALUE (base_type
))
7315 && tree_int_cst_equal (high
, TYPE_MAX_VALUE (base_type
))
7316 && TYPE_IDENTIFIER (type
) == TYPE_IDENTIFIER (base_type
))
7326 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
7327 and number of elements specified by the range of values of INDEX_TYPE.
7328 If TYPELESS_STORAGE is true, TYPE_TYPELESS_STORAGE flag is set on the type.
7329 If SHARED is true, reuse such a type that has already been constructed.
7330 If SET_CANONICAL is true, compute TYPE_CANONICAL from the element type. */
7333 build_array_type_1 (tree elt_type
, tree index_type
, bool typeless_storage
,
7334 bool shared
, bool set_canonical
)
7338 if (TREE_CODE (elt_type
) == FUNCTION_TYPE
)
7340 error ("arrays of functions are not meaningful");
7341 elt_type
= integer_type_node
;
7344 t
= make_node (ARRAY_TYPE
);
7345 TREE_TYPE (t
) = elt_type
;
7346 TYPE_DOMAIN (t
) = index_type
;
7347 TYPE_ADDR_SPACE (t
) = TYPE_ADDR_SPACE (elt_type
);
7348 TYPE_TYPELESS_STORAGE (t
) = typeless_storage
;
7353 hashval_t hash
= type_hash_canon_hash (t
);
7354 t
= type_hash_canon (hash
, t
);
7357 if (TYPE_CANONICAL (t
) == t
&& set_canonical
)
7359 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type
)
7360 || (index_type
&& TYPE_STRUCTURAL_EQUALITY_P (index_type
))
7362 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7363 else if (TYPE_CANONICAL (elt_type
) != elt_type
7364 || (index_type
&& TYPE_CANONICAL (index_type
) != index_type
))
7366 = build_array_type_1 (TYPE_CANONICAL (elt_type
),
7368 ? TYPE_CANONICAL (index_type
) : NULL_TREE
,
7369 typeless_storage
, shared
, set_canonical
);
7375 /* Wrapper around build_array_type_1 with SHARED set to true. */
7378 build_array_type (tree elt_type
, tree index_type
, bool typeless_storage
)
7381 build_array_type_1 (elt_type
, index_type
, typeless_storage
, true, true);
7384 /* Wrapper around build_array_type_1 with SHARED set to false. */
7387 build_nonshared_array_type (tree elt_type
, tree index_type
)
7389 return build_array_type_1 (elt_type
, index_type
, false, false, true);
7392 /* Return a representation of ELT_TYPE[NELTS], using indices of type
7396 build_array_type_nelts (tree elt_type
, poly_uint64 nelts
)
7398 return build_array_type (elt_type
, build_index_type (size_int (nelts
- 1)));
7401 /* Computes the canonical argument types from the argument type list
7404 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
7405 on entry to this function, or if any of the ARGTYPES are
7408 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
7409 true on entry to this function, or if any of the ARGTYPES are
7412 Returns a canonical argument list, which may be ARGTYPES when the
7413 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
7414 true) or would not differ from ARGTYPES. */
7417 maybe_canonicalize_argtypes (tree argtypes
,
7418 bool *any_structural_p
,
7419 bool *any_noncanonical_p
)
7422 bool any_noncanonical_argtypes_p
= false;
7424 for (arg
= argtypes
; arg
&& !(*any_structural_p
); arg
= TREE_CHAIN (arg
))
7426 if (!TREE_VALUE (arg
) || TREE_VALUE (arg
) == error_mark_node
)
7427 /* Fail gracefully by stating that the type is structural. */
7428 *any_structural_p
= true;
7429 else if (TYPE_STRUCTURAL_EQUALITY_P (TREE_VALUE (arg
)))
7430 *any_structural_p
= true;
7431 else if (TYPE_CANONICAL (TREE_VALUE (arg
)) != TREE_VALUE (arg
)
7432 || TREE_PURPOSE (arg
))
7433 /* If the argument has a default argument, we consider it
7434 non-canonical even though the type itself is canonical.
7435 That way, different variants of function and method types
7436 with default arguments will all point to the variant with
7437 no defaults as their canonical type. */
7438 any_noncanonical_argtypes_p
= true;
7441 if (*any_structural_p
)
7444 if (any_noncanonical_argtypes_p
)
7446 /* Build the canonical list of argument types. */
7447 tree canon_argtypes
= NULL_TREE
;
7448 bool is_void
= false;
7450 for (arg
= argtypes
; arg
; arg
= TREE_CHAIN (arg
))
7452 if (arg
== void_list_node
)
7455 canon_argtypes
= tree_cons (NULL_TREE
,
7456 TYPE_CANONICAL (TREE_VALUE (arg
)),
7460 canon_argtypes
= nreverse (canon_argtypes
);
7462 canon_argtypes
= chainon (canon_argtypes
, void_list_node
);
7464 /* There is a non-canonical type. */
7465 *any_noncanonical_p
= true;
7466 return canon_argtypes
;
7469 /* The canonical argument types are the same as ARGTYPES. */
7473 /* Construct, lay out and return
7474 the type of functions returning type VALUE_TYPE
7475 given arguments of types ARG_TYPES.
7476 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
7477 are data type nodes for the arguments of the function.
7478 NO_NAMED_ARGS_STDARG_P is true if this is a prototyped
7479 variable-arguments function with (...) prototype (no named arguments).
7480 If such a type has already been constructed, reuse it. */
7483 build_function_type (tree value_type
, tree arg_types
,
7484 bool no_named_args_stdarg_p
)
7487 inchash::hash hstate
;
7488 bool any_structural_p
, any_noncanonical_p
;
7489 tree canon_argtypes
;
7491 gcc_assert (arg_types
!= error_mark_node
);
7493 if (TREE_CODE (value_type
) == FUNCTION_TYPE
)
7495 error ("function return type cannot be function");
7496 value_type
= integer_type_node
;
7499 /* Make a node of the sort we want. */
7500 t
= make_node (FUNCTION_TYPE
);
7501 TREE_TYPE (t
) = value_type
;
7502 TYPE_ARG_TYPES (t
) = arg_types
;
7503 if (no_named_args_stdarg_p
)
7505 gcc_assert (arg_types
== NULL_TREE
);
7506 TYPE_NO_NAMED_ARGS_STDARG_P (t
) = 1;
7509 /* If we already have such a type, use the old one. */
7510 hashval_t hash
= type_hash_canon_hash (t
);
7511 t
= type_hash_canon (hash
, t
);
7513 /* Set up the canonical type. */
7514 any_structural_p
= TYPE_STRUCTURAL_EQUALITY_P (value_type
);
7515 any_noncanonical_p
= TYPE_CANONICAL (value_type
) != value_type
;
7516 canon_argtypes
= maybe_canonicalize_argtypes (arg_types
,
7518 &any_noncanonical_p
);
7519 if (any_structural_p
)
7520 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7521 else if (any_noncanonical_p
)
7522 TYPE_CANONICAL (t
) = build_function_type (TYPE_CANONICAL (value_type
),
7525 if (!COMPLETE_TYPE_P (t
))
7530 /* Build a function type. The RETURN_TYPE is the type returned by the
7531 function. If VAARGS is set, no void_type_node is appended to the
7532 list. ARGP must be always be terminated be a NULL_TREE. */
7535 build_function_type_list_1 (bool vaargs
, tree return_type
, va_list argp
)
7539 t
= va_arg (argp
, tree
);
7540 for (args
= NULL_TREE
; t
!= NULL_TREE
; t
= va_arg (argp
, tree
))
7541 args
= tree_cons (NULL_TREE
, t
, args
);
7546 if (args
!= NULL_TREE
)
7547 args
= nreverse (args
);
7548 gcc_assert (last
!= void_list_node
);
7550 else if (args
== NULL_TREE
)
7551 args
= void_list_node
;
7555 args
= nreverse (args
);
7556 TREE_CHAIN (last
) = void_list_node
;
7558 args
= build_function_type (return_type
, args
, vaargs
&& args
== NULL_TREE
);
7563 /* Build a function type. The RETURN_TYPE is the type returned by the
7564 function. If additional arguments are provided, they are
7565 additional argument types. The list of argument types must always
7566 be terminated by NULL_TREE. */
7569 build_function_type_list (tree return_type
, ...)
7574 va_start (p
, return_type
);
7575 args
= build_function_type_list_1 (false, return_type
, p
);
7580 /* Build a variable argument function type. The RETURN_TYPE is the
7581 type returned by the function. If additional arguments are provided,
7582 they are additional argument types. The list of argument types must
7583 always be terminated by NULL_TREE. */
7586 build_varargs_function_type_list (tree return_type
, ...)
7591 va_start (p
, return_type
);
7592 args
= build_function_type_list_1 (true, return_type
, p
);
7598 /* Build a function type. RETURN_TYPE is the type returned by the
7599 function; VAARGS indicates whether the function takes varargs. The
7600 function takes N named arguments, the types of which are provided in
7604 build_function_type_array_1 (bool vaargs
, tree return_type
, int n
,
7608 tree t
= vaargs
? NULL_TREE
: void_list_node
;
7610 for (i
= n
- 1; i
>= 0; i
--)
7611 t
= tree_cons (NULL_TREE
, arg_types
[i
], t
);
7613 return build_function_type (return_type
, t
, vaargs
&& n
== 0);
7616 /* Build a function type. RETURN_TYPE is the type returned by the
7617 function. The function takes N named arguments, the types of which
7618 are provided in ARG_TYPES. */
7621 build_function_type_array (tree return_type
, int n
, tree
*arg_types
)
7623 return build_function_type_array_1 (false, return_type
, n
, arg_types
);
7626 /* Build a variable argument function type. RETURN_TYPE is the type
7627 returned by the function. The function takes N named arguments, the
7628 types of which are provided in ARG_TYPES. */
7631 build_varargs_function_type_array (tree return_type
, int n
, tree
*arg_types
)
7633 return build_function_type_array_1 (true, return_type
, n
, arg_types
);
7636 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
7637 and ARGTYPES (a TREE_LIST) are the return type and arguments types
7638 for the method. An implicit additional parameter (of type
7639 pointer-to-BASETYPE) is added to the ARGTYPES. */
7642 build_method_type_directly (tree basetype
,
7648 bool any_structural_p
, any_noncanonical_p
;
7649 tree canon_argtypes
;
7651 /* Make a node of the sort we want. */
7652 t
= make_node (METHOD_TYPE
);
7654 TYPE_METHOD_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
7655 TREE_TYPE (t
) = rettype
;
7656 ptype
= build_pointer_type (basetype
);
7658 /* The actual arglist for this function includes a "hidden" argument
7659 which is "this". Put it into the list of argument types. */
7660 argtypes
= tree_cons (NULL_TREE
, ptype
, argtypes
);
7661 TYPE_ARG_TYPES (t
) = argtypes
;
7663 /* If we already have such a type, use the old one. */
7664 hashval_t hash
= type_hash_canon_hash (t
);
7665 t
= type_hash_canon (hash
, t
);
7667 /* Set up the canonical type. */
7669 = (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
7670 || TYPE_STRUCTURAL_EQUALITY_P (rettype
));
7672 = (TYPE_CANONICAL (basetype
) != basetype
7673 || TYPE_CANONICAL (rettype
) != rettype
);
7674 canon_argtypes
= maybe_canonicalize_argtypes (TREE_CHAIN (argtypes
),
7676 &any_noncanonical_p
);
7677 if (any_structural_p
)
7678 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7679 else if (any_noncanonical_p
)
7681 = build_method_type_directly (TYPE_CANONICAL (basetype
),
7682 TYPE_CANONICAL (rettype
),
7684 if (!COMPLETE_TYPE_P (t
))
7690 /* Construct, lay out and return the type of methods belonging to class
7691 BASETYPE and whose arguments and values are described by TYPE.
7692 If that type exists already, reuse it.
7693 TYPE must be a FUNCTION_TYPE node. */
7696 build_method_type (tree basetype
, tree type
)
7698 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
7700 return build_method_type_directly (basetype
,
7702 TYPE_ARG_TYPES (type
));
7705 /* Construct, lay out and return the type of offsets to a value
7706 of type TYPE, within an object of type BASETYPE.
7707 If a suitable offset type exists already, reuse it. */
7710 build_offset_type (tree basetype
, tree type
)
7714 /* Make a node of the sort we want. */
7715 t
= make_node (OFFSET_TYPE
);
7717 TYPE_OFFSET_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
7718 TREE_TYPE (t
) = type
;
7720 /* If we already have such a type, use the old one. */
7721 hashval_t hash
= type_hash_canon_hash (t
);
7722 t
= type_hash_canon (hash
, t
);
7724 if (!COMPLETE_TYPE_P (t
))
7727 if (TYPE_CANONICAL (t
) == t
)
7729 if (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
7730 || TYPE_STRUCTURAL_EQUALITY_P (type
))
7731 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7732 else if (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)) != basetype
7733 || TYPE_CANONICAL (type
) != type
)
7735 = build_offset_type (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)),
7736 TYPE_CANONICAL (type
));
7742 /* Create a complex type whose components are COMPONENT_TYPE.
7744 If NAMED is true, the type is given a TYPE_NAME. We do not always
7745 do so because this creates a DECL node and thus make the DECL_UIDs
7746 dependent on the type canonicalization hashtable, which is GC-ed,
7747 so the DECL_UIDs would not be stable wrt garbage collection. */
7750 build_complex_type (tree component_type
, bool named
)
7752 gcc_assert (INTEGRAL_TYPE_P (component_type
)
7753 || SCALAR_FLOAT_TYPE_P (component_type
)
7754 || FIXED_POINT_TYPE_P (component_type
));
7756 /* Make a node of the sort we want. */
7757 tree probe
= make_node (COMPLEX_TYPE
);
7759 TREE_TYPE (probe
) = TYPE_MAIN_VARIANT (component_type
);
7761 /* If we already have such a type, use the old one. */
7762 hashval_t hash
= type_hash_canon_hash (probe
);
7763 tree t
= type_hash_canon (hash
, probe
);
7767 /* We created a new type. The hash insertion will have laid
7768 out the type. We need to check the canonicalization and
7769 maybe set the name. */
7770 gcc_checking_assert (COMPLETE_TYPE_P (t
)
7772 && TYPE_CANONICAL (t
) == t
);
7774 if (TYPE_STRUCTURAL_EQUALITY_P (TREE_TYPE (t
)))
7775 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7776 else if (TYPE_CANONICAL (TREE_TYPE (t
)) != TREE_TYPE (t
))
7778 = build_complex_type (TYPE_CANONICAL (TREE_TYPE (t
)), named
);
7780 /* We need to create a name, since complex is a fundamental type. */
7783 const char *name
= NULL
;
7785 if (TREE_TYPE (t
) == char_type_node
)
7786 name
= "complex char";
7787 else if (TREE_TYPE (t
) == signed_char_type_node
)
7788 name
= "complex signed char";
7789 else if (TREE_TYPE (t
) == unsigned_char_type_node
)
7790 name
= "complex unsigned char";
7791 else if (TREE_TYPE (t
) == short_integer_type_node
)
7792 name
= "complex short int";
7793 else if (TREE_TYPE (t
) == short_unsigned_type_node
)
7794 name
= "complex short unsigned int";
7795 else if (TREE_TYPE (t
) == integer_type_node
)
7796 name
= "complex int";
7797 else if (TREE_TYPE (t
) == unsigned_type_node
)
7798 name
= "complex unsigned int";
7799 else if (TREE_TYPE (t
) == long_integer_type_node
)
7800 name
= "complex long int";
7801 else if (TREE_TYPE (t
) == long_unsigned_type_node
)
7802 name
= "complex long unsigned int";
7803 else if (TREE_TYPE (t
) == long_long_integer_type_node
)
7804 name
= "complex long long int";
7805 else if (TREE_TYPE (t
) == long_long_unsigned_type_node
)
7806 name
= "complex long long unsigned int";
7809 TYPE_NAME (t
) = build_decl (UNKNOWN_LOCATION
, TYPE_DECL
,
7810 get_identifier (name
), t
);
7814 return build_qualified_type (t
, TYPE_QUALS (component_type
));
7817 /* If TYPE is a real or complex floating-point type and the target
7818 does not directly support arithmetic on TYPE then return the wider
7819 type to be used for arithmetic on TYPE. Otherwise, return
7823 excess_precision_type (tree type
)
7825 /* The target can give two different responses to the question of
7826 which excess precision mode it would like depending on whether we
7827 are in -fexcess-precision=standard or -fexcess-precision=fast. */
7829 enum excess_precision_type requested_type
7830 = (flag_excess_precision
== EXCESS_PRECISION_FAST
7831 ? EXCESS_PRECISION_TYPE_FAST
7832 : (flag_excess_precision
== EXCESS_PRECISION_FLOAT16
7833 ? EXCESS_PRECISION_TYPE_FLOAT16
: EXCESS_PRECISION_TYPE_STANDARD
));
7835 enum flt_eval_method target_flt_eval_method
7836 = targetm
.c
.excess_precision (requested_type
);
7838 /* The target should not ask for unpredictable float evaluation (though
7839 it might advertise that implicitly the evaluation is unpredictable,
7840 but we don't care about that here, it will have been reported
7841 elsewhere). If it does ask for unpredictable evaluation, we have
7842 nothing to do here. */
7843 gcc_assert (target_flt_eval_method
!= FLT_EVAL_METHOD_UNPREDICTABLE
);
7845 /* Nothing to do. The target has asked for all types we know about
7846 to be computed with their native precision and range. */
7847 if (target_flt_eval_method
== FLT_EVAL_METHOD_PROMOTE_TO_FLOAT16
)
7850 /* The target will promote this type in a target-dependent way, so excess
7851 precision ought to leave it alone. */
7852 if (targetm
.promoted_type (type
) != NULL_TREE
)
7855 machine_mode float16_type_mode
= (float16_type_node
7856 ? TYPE_MODE (float16_type_node
)
7858 machine_mode bfloat16_type_mode
= (bfloat16_type_node
7859 ? TYPE_MODE (bfloat16_type_node
)
7861 machine_mode float_type_mode
= TYPE_MODE (float_type_node
);
7862 machine_mode double_type_mode
= TYPE_MODE (double_type_node
);
7864 switch (TREE_CODE (type
))
7868 machine_mode type_mode
= TYPE_MODE (type
);
7869 switch (target_flt_eval_method
)
7871 case FLT_EVAL_METHOD_PROMOTE_TO_FLOAT
:
7872 if (type_mode
== float16_type_mode
7873 || type_mode
== bfloat16_type_mode
)
7874 return float_type_node
;
7876 case FLT_EVAL_METHOD_PROMOTE_TO_DOUBLE
:
7877 if (type_mode
== float16_type_mode
7878 || type_mode
== bfloat16_type_mode
7879 || type_mode
== float_type_mode
)
7880 return double_type_node
;
7882 case FLT_EVAL_METHOD_PROMOTE_TO_LONG_DOUBLE
:
7883 if (type_mode
== float16_type_mode
7884 || type_mode
== bfloat16_type_mode
7885 || type_mode
== float_type_mode
7886 || type_mode
== double_type_mode
)
7887 return long_double_type_node
;
7896 if (TREE_CODE (TREE_TYPE (type
)) != REAL_TYPE
)
7898 machine_mode type_mode
= TYPE_MODE (TREE_TYPE (type
));
7899 switch (target_flt_eval_method
)
7901 case FLT_EVAL_METHOD_PROMOTE_TO_FLOAT
:
7902 if (type_mode
== float16_type_mode
7903 || type_mode
== bfloat16_type_mode
)
7904 return complex_float_type_node
;
7906 case FLT_EVAL_METHOD_PROMOTE_TO_DOUBLE
:
7907 if (type_mode
== float16_type_mode
7908 || type_mode
== bfloat16_type_mode
7909 || type_mode
== float_type_mode
)
7910 return complex_double_type_node
;
7912 case FLT_EVAL_METHOD_PROMOTE_TO_LONG_DOUBLE
:
7913 if (type_mode
== float16_type_mode
7914 || type_mode
== bfloat16_type_mode
7915 || type_mode
== float_type_mode
7916 || type_mode
== double_type_mode
)
7917 return complex_long_double_type_node
;
7931 /* Return OP, stripped of any conversions to wider types as much as is safe.
7932 Converting the value back to OP's type makes a value equivalent to OP.
7934 If FOR_TYPE is nonzero, we return a value which, if converted to
7935 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
7937 OP must have integer, real or enumeral type. Pointers are not allowed!
7939 There are some cases where the obvious value we could return
7940 would regenerate to OP if converted to OP's type,
7941 but would not extend like OP to wider types.
7942 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
7943 For example, if OP is (unsigned short)(signed char)-1,
7944 we avoid returning (signed char)-1 if FOR_TYPE is int,
7945 even though extending that to an unsigned short would regenerate OP,
7946 since the result of extending (signed char)-1 to (int)
7947 is different from (int) OP. */
7950 get_unwidened (tree op
, tree for_type
)
7952 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
7953 tree type
= TREE_TYPE (op
);
7955 = TYPE_PRECISION (for_type
!= 0 ? for_type
: type
);
7957 = (for_type
!= 0 && for_type
!= type
7958 && final_prec
> TYPE_PRECISION (type
)
7959 && TYPE_UNSIGNED (type
));
7962 while (CONVERT_EXPR_P (op
))
7966 /* TYPE_PRECISION on vector types has different meaning
7967 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
7968 so avoid them here. */
7969 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op
, 0))) == VECTOR_TYPE
)
7972 bitschange
= TYPE_PRECISION (TREE_TYPE (op
))
7973 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0)));
7975 /* Truncations are many-one so cannot be removed.
7976 Unless we are later going to truncate down even farther. */
7978 && final_prec
> TYPE_PRECISION (TREE_TYPE (op
)))
7981 /* See what's inside this conversion. If we decide to strip it,
7983 op
= TREE_OPERAND (op
, 0);
7985 /* If we have not stripped any zero-extensions (uns is 0),
7986 we can strip any kind of extension.
7987 If we have previously stripped a zero-extension,
7988 only zero-extensions can safely be stripped.
7989 Any extension can be stripped if the bits it would produce
7990 are all going to be discarded later by truncating to FOR_TYPE. */
7994 if (! uns
|| final_prec
<= TYPE_PRECISION (TREE_TYPE (op
)))
7996 /* TYPE_UNSIGNED says whether this is a zero-extension.
7997 Let's avoid computing it if it does not affect WIN
7998 and if UNS will not be needed again. */
8000 || CONVERT_EXPR_P (op
))
8001 && TYPE_UNSIGNED (TREE_TYPE (op
)))
8009 /* If we finally reach a constant see if it fits in sth smaller and
8010 in that case convert it. */
8011 if (TREE_CODE (win
) == INTEGER_CST
)
8013 tree wtype
= TREE_TYPE (win
);
8014 unsigned prec
= wi::min_precision (wi::to_wide (win
), TYPE_SIGN (wtype
));
8016 prec
= MAX (prec
, final_prec
);
8017 if (prec
< TYPE_PRECISION (wtype
))
8019 tree t
= lang_hooks
.types
.type_for_size (prec
, TYPE_UNSIGNED (wtype
));
8020 if (t
&& TYPE_PRECISION (t
) < TYPE_PRECISION (wtype
))
8021 win
= fold_convert (t
, win
);
8028 /* Return OP or a simpler expression for a narrower value
8029 which can be sign-extended or zero-extended to give back OP.
8030 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
8031 or 0 if the value should be sign-extended. */
8034 get_narrower (tree op
, int *unsignedp_ptr
)
8039 bool integral_p
= INTEGRAL_TYPE_P (TREE_TYPE (op
));
8041 if (TREE_CODE (op
) == COMPOUND_EXPR
)
8044 op
= TREE_OPERAND (op
, 1);
8045 while (TREE_CODE (op
) == COMPOUND_EXPR
);
8046 tree ret
= get_narrower (op
, unsignedp_ptr
);
8049 auto_vec
<tree
, 16> v
;
8051 for (op
= win
; TREE_CODE (op
) == COMPOUND_EXPR
;
8052 op
= TREE_OPERAND (op
, 1))
8054 FOR_EACH_VEC_ELT_REVERSE (v
, i
, op
)
8055 ret
= build2_loc (EXPR_LOCATION (op
), COMPOUND_EXPR
,
8056 TREE_TYPE (ret
), TREE_OPERAND (op
, 0),
8060 while (TREE_CODE (op
) == NOP_EXPR
)
8063 = (TYPE_PRECISION (TREE_TYPE (op
))
8064 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0))));
8066 /* Truncations are many-one so cannot be removed. */
8070 /* See what's inside this conversion. If we decide to strip it,
8075 op
= TREE_OPERAND (op
, 0);
8076 /* An extension: the outermost one can be stripped,
8077 but remember whether it is zero or sign extension. */
8079 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
8080 /* Otherwise, if a sign extension has been stripped,
8081 only sign extensions can now be stripped;
8082 if a zero extension has been stripped, only zero-extensions. */
8083 else if (uns
!= TYPE_UNSIGNED (TREE_TYPE (op
)))
8087 else /* bitschange == 0 */
8089 /* A change in nominal type can always be stripped, but we must
8090 preserve the unsignedness. */
8092 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
8094 op
= TREE_OPERAND (op
, 0);
8095 /* Keep trying to narrow, but don't assign op to win if it
8096 would turn an integral type into something else. */
8097 if (INTEGRAL_TYPE_P (TREE_TYPE (op
)) != integral_p
)
8104 if (TREE_CODE (op
) == COMPONENT_REF
8105 /* Since type_for_size always gives an integer type. */
8106 && TREE_CODE (TREE_TYPE (op
)) != REAL_TYPE
8107 && TREE_CODE (TREE_TYPE (op
)) != FIXED_POINT_TYPE
8108 /* Ensure field is laid out already. */
8109 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0
8110 && tree_fits_uhwi_p (DECL_SIZE (TREE_OPERAND (op
, 1))))
8112 unsigned HOST_WIDE_INT innerprec
8113 = tree_to_uhwi (DECL_SIZE (TREE_OPERAND (op
, 1)));
8114 int unsignedp
= (DECL_UNSIGNED (TREE_OPERAND (op
, 1))
8115 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op
, 1))));
8116 tree type
= lang_hooks
.types
.type_for_size (innerprec
, unsignedp
);
8118 /* We can get this structure field in a narrower type that fits it,
8119 but the resulting extension to its nominal type (a fullword type)
8120 must satisfy the same conditions as for other extensions.
8122 Do this only for fields that are aligned (not bit-fields),
8123 because when bit-field insns will be used there is no
8124 advantage in doing this. */
8126 if (innerprec
< TYPE_PRECISION (TREE_TYPE (op
))
8127 && ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1))
8128 && (first
|| uns
== DECL_UNSIGNED (TREE_OPERAND (op
, 1)))
8132 uns
= DECL_UNSIGNED (TREE_OPERAND (op
, 1));
8133 win
= fold_convert (type
, op
);
8137 *unsignedp_ptr
= uns
;
8141 /* Return true if integer constant C has a value that is permissible
8142 for TYPE, an integral type. */
8145 int_fits_type_p (const_tree c
, const_tree type
)
8147 tree type_low_bound
, type_high_bound
;
8148 bool ok_for_low_bound
, ok_for_high_bound
;
8149 signop sgn_c
= TYPE_SIGN (TREE_TYPE (c
));
8151 /* Non-standard boolean types can have arbitrary precision but various
8152 transformations assume that they can only take values 0 and +/-1. */
8153 if (TREE_CODE (type
) == BOOLEAN_TYPE
)
8154 return wi::fits_to_boolean_p (wi::to_wide (c
), type
);
8157 type_low_bound
= TYPE_MIN_VALUE (type
);
8158 type_high_bound
= TYPE_MAX_VALUE (type
);
8160 /* If at least one bound of the type is a constant integer, we can check
8161 ourselves and maybe make a decision. If no such decision is possible, but
8162 this type is a subtype, try checking against that. Otherwise, use
8163 fits_to_tree_p, which checks against the precision.
8165 Compute the status for each possibly constant bound, and return if we see
8166 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
8167 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
8168 for "constant known to fit". */
8170 /* Check if c >= type_low_bound. */
8171 if (type_low_bound
&& TREE_CODE (type_low_bound
) == INTEGER_CST
)
8173 if (tree_int_cst_lt (c
, type_low_bound
))
8175 ok_for_low_bound
= true;
8178 ok_for_low_bound
= false;
8180 /* Check if c <= type_high_bound. */
8181 if (type_high_bound
&& TREE_CODE (type_high_bound
) == INTEGER_CST
)
8183 if (tree_int_cst_lt (type_high_bound
, c
))
8185 ok_for_high_bound
= true;
8188 ok_for_high_bound
= false;
8190 /* If the constant fits both bounds, the result is known. */
8191 if (ok_for_low_bound
&& ok_for_high_bound
)
8194 /* Perform some generic filtering which may allow making a decision
8195 even if the bounds are not constant. First, negative integers
8196 never fit in unsigned types, */
8197 if (TYPE_UNSIGNED (type
) && sgn_c
== SIGNED
&& wi::neg_p (wi::to_wide (c
)))
8200 /* Second, narrower types always fit in wider ones. */
8201 if (TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (c
)))
8204 /* Third, unsigned integers with top bit set never fit signed types. */
8205 if (!TYPE_UNSIGNED (type
) && sgn_c
== UNSIGNED
)
8207 int prec
= GET_MODE_PRECISION (SCALAR_INT_TYPE_MODE (TREE_TYPE (c
))) - 1;
8208 if (prec
< TYPE_PRECISION (TREE_TYPE (c
)))
8210 /* When a tree_cst is converted to a wide-int, the precision
8211 is taken from the type. However, if the precision of the
8212 mode underneath the type is smaller than that, it is
8213 possible that the value will not fit. The test below
8214 fails if any bit is set between the sign bit of the
8215 underlying mode and the top bit of the type. */
8216 if (wi::zext (wi::to_wide (c
), prec
- 1) != wi::to_wide (c
))
8219 else if (wi::neg_p (wi::to_wide (c
)))
8223 /* If we haven't been able to decide at this point, there nothing more we
8224 can check ourselves here. Look at the base type if we have one and it
8225 has the same precision. */
8226 if (TREE_CODE (type
) == INTEGER_TYPE
8227 && TREE_TYPE (type
) != 0
8228 && TYPE_PRECISION (type
) == TYPE_PRECISION (TREE_TYPE (type
)))
8230 type
= TREE_TYPE (type
);
8234 /* Or to fits_to_tree_p, if nothing else. */
8235 return wi::fits_to_tree_p (wi::to_wide (c
), type
);
8238 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
8239 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
8240 represented (assuming two's-complement arithmetic) within the bit
8241 precision of the type are returned instead. */
8244 get_type_static_bounds (const_tree type
, mpz_t min
, mpz_t max
)
8246 if (!POINTER_TYPE_P (type
) && TYPE_MIN_VALUE (type
)
8247 && TREE_CODE (TYPE_MIN_VALUE (type
)) == INTEGER_CST
)
8248 wi::to_mpz (wi::to_wide (TYPE_MIN_VALUE (type
)), min
, TYPE_SIGN (type
));
8251 if (TYPE_UNSIGNED (type
))
8252 mpz_set_ui (min
, 0);
8255 wide_int mn
= wi::min_value (TYPE_PRECISION (type
), SIGNED
);
8256 wi::to_mpz (mn
, min
, SIGNED
);
8260 if (!POINTER_TYPE_P (type
) && TYPE_MAX_VALUE (type
)
8261 && TREE_CODE (TYPE_MAX_VALUE (type
)) == INTEGER_CST
)
8262 wi::to_mpz (wi::to_wide (TYPE_MAX_VALUE (type
)), max
, TYPE_SIGN (type
));
8265 wide_int mn
= wi::max_value (TYPE_PRECISION (type
), TYPE_SIGN (type
));
8266 wi::to_mpz (mn
, max
, TYPE_SIGN (type
));
8270 /* Return true if VAR is an automatic variable. */
8273 auto_var_p (const_tree var
)
8275 return ((((VAR_P (var
) && ! DECL_EXTERNAL (var
))
8276 || TREE_CODE (var
) == PARM_DECL
)
8277 && ! TREE_STATIC (var
))
8278 || TREE_CODE (var
) == RESULT_DECL
);
8281 /* Return true if VAR is an automatic variable defined in function FN. */
8284 auto_var_in_fn_p (const_tree var
, const_tree fn
)
8286 return (DECL_P (var
) && DECL_CONTEXT (var
) == fn
8287 && (auto_var_p (var
)
8288 || TREE_CODE (var
) == LABEL_DECL
));
8291 /* Subprogram of following function. Called by walk_tree.
8293 Return *TP if it is an automatic variable or parameter of the
8294 function passed in as DATA. */
8297 find_var_from_fn (tree
*tp
, int *walk_subtrees
, void *data
)
8299 tree fn
= (tree
) data
;
8304 else if (DECL_P (*tp
)
8305 && auto_var_in_fn_p (*tp
, fn
))
8311 /* Returns true if T is, contains, or refers to a type with variable
8312 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
8313 arguments, but not the return type. If FN is nonzero, only return
8314 true if a modifier of the type or position of FN is a variable or
8315 parameter inside FN.
8317 This concept is more general than that of C99 'variably modified types':
8318 in C99, a struct type is never variably modified because a VLA may not
8319 appear as a structure member. However, in GNU C code like:
8321 struct S { int i[f()]; };
8323 is valid, and other languages may define similar constructs. */
8326 variably_modified_type_p (tree type
, tree fn
)
8330 /* Test if T is either variable (if FN is zero) or an expression containing
8331 a variable in FN. If TYPE isn't gimplified, return true also if
8332 gimplify_one_sizepos would gimplify the expression into a local
8334 #define RETURN_TRUE_IF_VAR(T) \
8335 do { tree _t = (T); \
8336 if (_t != NULL_TREE \
8337 && _t != error_mark_node \
8338 && !CONSTANT_CLASS_P (_t) \
8339 && TREE_CODE (_t) != PLACEHOLDER_EXPR \
8341 || (!TYPE_SIZES_GIMPLIFIED (type) \
8342 && (TREE_CODE (_t) != VAR_DECL \
8343 && !CONTAINS_PLACEHOLDER_P (_t))) \
8344 || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
8345 return true; } while (0)
8347 if (type
== error_mark_node
)
8350 /* If TYPE itself has variable size, it is variably modified. */
8351 RETURN_TRUE_IF_VAR (TYPE_SIZE (type
));
8352 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type
));
8354 switch (TREE_CODE (type
))
8357 case REFERENCE_TYPE
:
8359 /* Ada can have pointer types refering to themselves indirectly. */
8360 if (TREE_VISITED (type
))
8362 TREE_VISITED (type
) = true;
8363 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
8365 TREE_VISITED (type
) = false;
8368 TREE_VISITED (type
) = false;
8373 /* If TYPE is a function type, it is variably modified if the
8374 return type is variably modified. */
8375 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
8381 case FIXED_POINT_TYPE
:
8384 /* Scalar types are variably modified if their end points
8386 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type
));
8387 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type
));
8392 case QUAL_UNION_TYPE
:
8393 /* We can't see if any of the fields are variably-modified by the
8394 definition we normally use, since that would produce infinite
8395 recursion via pointers. */
8396 /* This is variably modified if some field's type is. */
8397 for (t
= TYPE_FIELDS (type
); t
; t
= DECL_CHAIN (t
))
8398 if (TREE_CODE (t
) == FIELD_DECL
)
8400 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t
));
8401 RETURN_TRUE_IF_VAR (DECL_SIZE (t
));
8402 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t
));
8404 /* If the type is a qualified union, then the DECL_QUALIFIER
8405 of fields can also be an expression containing a variable. */
8406 if (TREE_CODE (type
) == QUAL_UNION_TYPE
)
8407 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t
));
8409 /* If the field is a qualified union, then it's only a container
8410 for what's inside so we look into it. That's necessary in LTO
8411 mode because the sizes of the field tested above have been set
8412 to PLACEHOLDER_EXPRs by free_lang_data. */
8413 if (TREE_CODE (TREE_TYPE (t
)) == QUAL_UNION_TYPE
8414 && variably_modified_type_p (TREE_TYPE (t
), fn
))
8420 /* Do not call ourselves to avoid infinite recursion. This is
8421 variably modified if the element type is. */
8422 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type
)));
8423 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type
)));
8430 /* The current language may have other cases to check, but in general,
8431 all other types are not variably modified. */
8432 return lang_hooks
.tree_inlining
.var_mod_type_p (type
, fn
);
8434 #undef RETURN_TRUE_IF_VAR
8437 /* Given a DECL or TYPE, return the scope in which it was declared, or
8438 NULL_TREE if there is no containing scope. */
8441 get_containing_scope (const_tree t
)
8443 return (TYPE_P (t
) ? TYPE_CONTEXT (t
) : DECL_CONTEXT (t
));
8446 /* Returns the ultimate TRANSLATION_UNIT_DECL context of DECL or NULL. */
8449 get_ultimate_context (const_tree decl
)
8451 while (decl
&& TREE_CODE (decl
) != TRANSLATION_UNIT_DECL
)
8453 if (TREE_CODE (decl
) == BLOCK
)
8454 decl
= BLOCK_SUPERCONTEXT (decl
);
8456 decl
= get_containing_scope (decl
);
8461 /* Return the innermost context enclosing DECL that is
8462 a FUNCTION_DECL, or zero if none. */
8465 decl_function_context (const_tree decl
)
8469 if (TREE_CODE (decl
) == ERROR_MARK
)
8472 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
8473 where we look up the function at runtime. Such functions always take
8474 a first argument of type 'pointer to real context'.
8476 C++ should really be fixed to use DECL_CONTEXT for the real context,
8477 and use something else for the "virtual context". */
8478 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VIRTUAL_P (decl
))
8481 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl
)))));
8483 context
= DECL_CONTEXT (decl
);
8485 while (context
&& TREE_CODE (context
) != FUNCTION_DECL
)
8487 if (TREE_CODE (context
) == BLOCK
)
8488 context
= BLOCK_SUPERCONTEXT (context
);
8490 context
= get_containing_scope (context
);
8496 /* Return the innermost context enclosing DECL that is
8497 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
8498 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
8501 decl_type_context (const_tree decl
)
8503 tree context
= DECL_CONTEXT (decl
);
8506 switch (TREE_CODE (context
))
8508 case NAMESPACE_DECL
:
8509 case TRANSLATION_UNIT_DECL
:
8514 case QUAL_UNION_TYPE
:
8519 context
= DECL_CONTEXT (context
);
8523 context
= BLOCK_SUPERCONTEXT (context
);
8533 /* CALL is a CALL_EXPR. Return the declaration for the function
8534 called, or NULL_TREE if the called function cannot be
8538 get_callee_fndecl (const_tree call
)
8542 if (call
== error_mark_node
)
8543 return error_mark_node
;
8545 /* It's invalid to call this function with anything but a
8547 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
8549 /* The first operand to the CALL is the address of the function
8551 addr
= CALL_EXPR_FN (call
);
8553 /* If there is no function, return early. */
8554 if (addr
== NULL_TREE
)
8559 /* If this is a readonly function pointer, extract its initial value. */
8560 if (DECL_P (addr
) && TREE_CODE (addr
) != FUNCTION_DECL
8561 && TREE_READONLY (addr
) && ! TREE_THIS_VOLATILE (addr
)
8562 && DECL_INITIAL (addr
))
8563 addr
= DECL_INITIAL (addr
);
8565 /* If the address is just `&f' for some function `f', then we know
8566 that `f' is being called. */
8567 if (TREE_CODE (addr
) == ADDR_EXPR
8568 && TREE_CODE (TREE_OPERAND (addr
, 0)) == FUNCTION_DECL
)
8569 return TREE_OPERAND (addr
, 0);
8571 /* We couldn't figure out what was being called. */
8575 /* Return true when STMTs arguments and return value match those of FNDECL,
8576 a decl of a builtin function. */
8579 tree_builtin_call_types_compatible_p (const_tree call
, tree fndecl
)
8581 gcc_checking_assert (DECL_BUILT_IN_CLASS (fndecl
) != NOT_BUILT_IN
);
8583 if (DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
)
8584 if (tree decl
= builtin_decl_explicit (DECL_FUNCTION_CODE (fndecl
)))
8587 bool gimple_form
= (cfun
&& (cfun
->curr_properties
& PROP_gimple
)) != 0;
8589 ? !useless_type_conversion_p (TREE_TYPE (call
),
8590 TREE_TYPE (TREE_TYPE (fndecl
)))
8591 : (TYPE_MAIN_VARIANT (TREE_TYPE (call
))
8592 != TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (fndecl
)))))
8595 tree targs
= TYPE_ARG_TYPES (TREE_TYPE (fndecl
));
8596 unsigned nargs
= call_expr_nargs (call
);
8597 for (unsigned i
= 0; i
< nargs
; ++i
, targs
= TREE_CHAIN (targs
))
8599 /* Variadic args follow. */
8602 tree arg
= CALL_EXPR_ARG (call
, i
);
8603 tree type
= TREE_VALUE (targs
);
8605 ? !useless_type_conversion_p (type
, TREE_TYPE (arg
))
8606 : TYPE_MAIN_VARIANT (type
) != TYPE_MAIN_VARIANT (TREE_TYPE (arg
)))
8608 /* For pointer arguments be more forgiving, e.g. due to
8609 FILE * vs. fileptr_type_node, or say char * vs. const char *
8612 && POINTER_TYPE_P (type
)
8613 && POINTER_TYPE_P (TREE_TYPE (arg
))
8614 && tree_nop_conversion_p (type
, TREE_TYPE (arg
)))
8616 /* char/short integral arguments are promoted to int
8617 by several frontends if targetm.calls.promote_prototypes
8618 is true. Allow such promotion too. */
8619 if (INTEGRAL_TYPE_P (type
)
8620 && TYPE_PRECISION (type
) < TYPE_PRECISION (integer_type_node
)
8621 && INTEGRAL_TYPE_P (TREE_TYPE (arg
))
8622 && !TYPE_UNSIGNED (TREE_TYPE (arg
))
8623 && targetm
.calls
.promote_prototypes (TREE_TYPE (fndecl
))
8625 ? useless_type_conversion_p (integer_type_node
,
8627 : tree_nop_conversion_p (integer_type_node
,
8633 if (targs
&& !VOID_TYPE_P (TREE_VALUE (targs
)))
8638 /* If CALL_EXPR CALL calls a normal built-in function or an internal function,
8639 return the associated function code, otherwise return CFN_LAST. */
8642 get_call_combined_fn (const_tree call
)
8644 /* It's invalid to call this function with anything but a CALL_EXPR. */
8645 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
8647 if (!CALL_EXPR_FN (call
))
8648 return as_combined_fn (CALL_EXPR_IFN (call
));
8650 tree fndecl
= get_callee_fndecl (call
);
8652 && fndecl_built_in_p (fndecl
, BUILT_IN_NORMAL
)
8653 && tree_builtin_call_types_compatible_p (call
, fndecl
))
8654 return as_combined_fn (DECL_FUNCTION_CODE (fndecl
));
8659 /* Comparator of indices based on tree_node_counts. */
8662 tree_nodes_cmp (const void *p1
, const void *p2
)
8664 const unsigned *n1
= (const unsigned *)p1
;
8665 const unsigned *n2
= (const unsigned *)p2
;
8667 return tree_node_counts
[*n1
] - tree_node_counts
[*n2
];
8670 /* Comparator of indices based on tree_code_counts. */
8673 tree_codes_cmp (const void *p1
, const void *p2
)
8675 const unsigned *n1
= (const unsigned *)p1
;
8676 const unsigned *n2
= (const unsigned *)p2
;
8678 return tree_code_counts
[*n1
] - tree_code_counts
[*n2
];
8681 #define TREE_MEM_USAGE_SPACES 40
8683 /* Print debugging information about tree nodes generated during the compile,
8684 and any language-specific information. */
8687 dump_tree_statistics (void)
8689 if (GATHER_STATISTICS
)
8691 uint64_t total_nodes
, total_bytes
;
8692 fprintf (stderr
, "\nKind Nodes Bytes\n");
8693 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
8694 total_nodes
= total_bytes
= 0;
8697 auto_vec
<unsigned> indices (all_kinds
);
8698 for (unsigned i
= 0; i
< all_kinds
; i
++)
8699 indices
.quick_push (i
);
8700 indices
.qsort (tree_nodes_cmp
);
8702 for (unsigned i
= 0; i
< (int) all_kinds
; i
++)
8704 unsigned j
= indices
[i
];
8705 fprintf (stderr
, "%-20s %6" PRIu64
"%c %9" PRIu64
"%c\n",
8706 tree_node_kind_names
[j
], SIZE_AMOUNT (tree_node_counts
[j
]),
8707 SIZE_AMOUNT (tree_node_sizes
[j
]));
8708 total_nodes
+= tree_node_counts
[j
];
8709 total_bytes
+= tree_node_sizes
[j
];
8711 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
8712 fprintf (stderr
, "%-20s %6" PRIu64
"%c %9" PRIu64
"%c\n", "Total",
8713 SIZE_AMOUNT (total_nodes
), SIZE_AMOUNT (total_bytes
));
8714 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
8718 fprintf (stderr
, "Code Nodes\n");
8719 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
8721 auto_vec
<unsigned> indices (MAX_TREE_CODES
);
8722 for (unsigned i
= 0; i
< MAX_TREE_CODES
; i
++)
8723 indices
.quick_push (i
);
8724 indices
.qsort (tree_codes_cmp
);
8726 for (unsigned i
= 0; i
< MAX_TREE_CODES
; i
++)
8728 unsigned j
= indices
[i
];
8729 fprintf (stderr
, "%-32s %6" PRIu64
"%c\n",
8730 get_tree_code_name ((enum tree_code
) j
),
8731 SIZE_AMOUNT (tree_code_counts
[j
]));
8733 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
8734 fprintf (stderr
, "\n");
8735 ssanames_print_statistics ();
8736 fprintf (stderr
, "\n");
8737 phinodes_print_statistics ();
8738 fprintf (stderr
, "\n");
8742 fprintf (stderr
, "(No per-node statistics)\n");
8744 print_type_hash_statistics ();
8745 print_debug_expr_statistics ();
8746 print_value_expr_statistics ();
8747 lang_hooks
.print_statistics ();
8750 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
8752 /* Generate a crc32 of the low BYTES bytes of VALUE. */
8755 crc32_unsigned_n (unsigned chksum
, unsigned value
, unsigned bytes
)
8757 /* This relies on the raw feedback's top 4 bits being zero. */
8758 #define FEEDBACK(X) ((X) * 0x04c11db7)
8759 #define SYNDROME(X) (FEEDBACK ((X) & 1) ^ FEEDBACK ((X) & 2) \
8760 ^ FEEDBACK ((X) & 4) ^ FEEDBACK ((X) & 8))
8761 static const unsigned syndromes
[16] =
8763 SYNDROME(0x0), SYNDROME(0x1), SYNDROME(0x2), SYNDROME(0x3),
8764 SYNDROME(0x4), SYNDROME(0x5), SYNDROME(0x6), SYNDROME(0x7),
8765 SYNDROME(0x8), SYNDROME(0x9), SYNDROME(0xa), SYNDROME(0xb),
8766 SYNDROME(0xc), SYNDROME(0xd), SYNDROME(0xe), SYNDROME(0xf),
8771 value
<<= (32 - bytes
* 8);
8772 for (unsigned ix
= bytes
* 2; ix
--; value
<<= 4)
8774 unsigned feedback
= syndromes
[((value
^ chksum
) >> 28) & 0xf];
8776 chksum
= (chksum
<< 4) ^ feedback
;
8782 /* Generate a crc32 of a string. */
8785 crc32_string (unsigned chksum
, const char *string
)
8788 chksum
= crc32_byte (chksum
, *string
);
8793 /* P is a string that will be used in a symbol. Mask out any characters
8794 that are not valid in that context. */
8797 clean_symbol_name (char *p
)
8801 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
8804 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
8811 static GTY(()) unsigned anon_cnt
= 0; /* Saved for PCH. */
8813 /* Create a unique anonymous identifier. The identifier is still a
8814 valid assembly label. */
8820 #if !defined (NO_DOT_IN_LABEL)
8822 #elif !defined (NO_DOLLAR_IN_LABEL)
8830 int len
= snprintf (buf
, sizeof (buf
), fmt
, anon_cnt
++);
8831 gcc_checking_assert (len
< int (sizeof (buf
)));
8833 tree id
= get_identifier_with_length (buf
, len
);
8834 IDENTIFIER_ANON_P (id
) = true;
8839 /* Generate a name for a special-purpose function.
8840 The generated name may need to be unique across the whole link.
8841 Changes to this function may also require corresponding changes to
8842 xstrdup_mask_random.
8843 TYPE is some string to identify the purpose of this function to the
8844 linker or collect2; it must start with an uppercase letter,
8846 I - for constructors
8848 N - for C++ anonymous namespaces
8849 F - for DWARF unwind frame information. */
8852 get_file_function_name (const char *type
)
8858 /* If we already have a name we know to be unique, just use that. */
8859 if (first_global_object_name
)
8860 p
= q
= ASTRDUP (first_global_object_name
);
8861 /* If the target is handling the constructors/destructors, they
8862 will be local to this file and the name is only necessary for
8864 We also assign sub_I and sub_D sufixes to constructors called from
8865 the global static constructors. These are always local. */
8866 else if (((type
[0] == 'I' || type
[0] == 'D') && targetm
.have_ctors_dtors
)
8867 || (startswith (type
, "sub_")
8868 && (type
[4] == 'I' || type
[4] == 'D')))
8870 const char *file
= main_input_filename
;
8872 file
= LOCATION_FILE (input_location
);
8873 /* Just use the file's basename, because the full pathname
8874 might be quite long. */
8875 p
= q
= ASTRDUP (lbasename (file
));
8879 /* Otherwise, the name must be unique across the entire link.
8880 We don't have anything that we know to be unique to this translation
8881 unit, so use what we do have and throw in some randomness. */
8883 const char *name
= weak_global_object_name
;
8884 const char *file
= main_input_filename
;
8889 file
= LOCATION_FILE (input_location
);
8891 len
= strlen (file
);
8892 q
= (char *) alloca (9 + 19 + len
+ 1);
8893 memcpy (q
, file
, len
+ 1);
8895 snprintf (q
+ len
, 9 + 19 + 1, "_%08X_" HOST_WIDE_INT_PRINT_HEX
,
8896 crc32_string (0, name
), get_random_seed (false));
8901 clean_symbol_name (q
);
8902 buf
= (char *) alloca (sizeof (FILE_FUNCTION_FORMAT
) + strlen (p
)
8905 /* Set up the name of the file-level functions we may need.
8906 Use a global object (which is already required to be unique over
8907 the program) rather than the file name (which imposes extra
8909 sprintf (buf
, FILE_FUNCTION_FORMAT
, type
, p
);
8911 return get_identifier (buf
);
8914 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
8916 /* Complain that the tree code of NODE does not match the expected 0
8917 terminated list of trailing codes. The trailing code list can be
8918 empty, for a more vague error message. FILE, LINE, and FUNCTION
8919 are of the caller. */
8922 tree_check_failed (const_tree node
, const char *file
,
8923 int line
, const char *function
, ...)
8927 unsigned length
= 0;
8928 enum tree_code code
;
8930 va_start (args
, function
);
8931 while ((code
= (enum tree_code
) va_arg (args
, int)))
8932 length
+= 4 + strlen (get_tree_code_name (code
));
8937 va_start (args
, function
);
8938 length
+= strlen ("expected ");
8939 buffer
= tmp
= (char *) alloca (length
);
8941 while ((code
= (enum tree_code
) va_arg (args
, int)))
8943 const char *prefix
= length
? " or " : "expected ";
8945 strcpy (tmp
+ length
, prefix
);
8946 length
+= strlen (prefix
);
8947 strcpy (tmp
+ length
, get_tree_code_name (code
));
8948 length
+= strlen (get_tree_code_name (code
));
8953 buffer
= "unexpected node";
8955 internal_error ("tree check: %s, have %s in %s, at %s:%d",
8956 buffer
, get_tree_code_name (TREE_CODE (node
)),
8957 function
, trim_filename (file
), line
);
8960 /* Complain that the tree code of NODE does match the expected 0
8961 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
8965 tree_not_check_failed (const_tree node
, const char *file
,
8966 int line
, const char *function
, ...)
8970 unsigned length
= 0;
8971 enum tree_code code
;
8973 va_start (args
, function
);
8974 while ((code
= (enum tree_code
) va_arg (args
, int)))
8975 length
+= 4 + strlen (get_tree_code_name (code
));
8977 va_start (args
, function
);
8978 buffer
= (char *) alloca (length
);
8980 while ((code
= (enum tree_code
) va_arg (args
, int)))
8984 strcpy (buffer
+ length
, " or ");
8987 strcpy (buffer
+ length
, get_tree_code_name (code
));
8988 length
+= strlen (get_tree_code_name (code
));
8992 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
8993 buffer
, get_tree_code_name (TREE_CODE (node
)),
8994 function
, trim_filename (file
), line
);
8997 /* Similar to tree_check_failed, except that we check for a class of tree
8998 code, given in CL. */
9001 tree_class_check_failed (const_tree node
, const enum tree_code_class cl
,
9002 const char *file
, int line
, const char *function
)
9005 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
9006 TREE_CODE_CLASS_STRING (cl
),
9007 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
9008 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9011 /* Similar to tree_check_failed, except that instead of specifying a
9012 dozen codes, use the knowledge that they're all sequential. */
9015 tree_range_check_failed (const_tree node
, const char *file
, int line
,
9016 const char *function
, enum tree_code c1
,
9020 unsigned length
= 0;
9023 for (c
= c1
; c
<= c2
; ++c
)
9024 length
+= 4 + strlen (get_tree_code_name ((enum tree_code
) c
));
9026 length
+= strlen ("expected ");
9027 buffer
= (char *) alloca (length
);
9030 for (c
= c1
; c
<= c2
; ++c
)
9032 const char *prefix
= length
? " or " : "expected ";
9034 strcpy (buffer
+ length
, prefix
);
9035 length
+= strlen (prefix
);
9036 strcpy (buffer
+ length
, get_tree_code_name ((enum tree_code
) c
));
9037 length
+= strlen (get_tree_code_name ((enum tree_code
) c
));
9040 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9041 buffer
, get_tree_code_name (TREE_CODE (node
)),
9042 function
, trim_filename (file
), line
);
9046 /* Similar to tree_check_failed, except that we check that a tree does
9047 not have the specified code, given in CL. */
9050 tree_not_class_check_failed (const_tree node
, const enum tree_code_class cl
,
9051 const char *file
, int line
, const char *function
)
9054 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
9055 TREE_CODE_CLASS_STRING (cl
),
9056 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
9057 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9061 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
9064 omp_clause_check_failed (const_tree node
, const char *file
, int line
,
9065 const char *function
, enum omp_clause_code code
)
9067 internal_error ("tree check: expected %<omp_clause %s%>, have %qs "
9069 omp_clause_code_name
[code
],
9070 get_tree_code_name (TREE_CODE (node
)),
9071 function
, trim_filename (file
), line
);
9075 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
9078 omp_clause_range_check_failed (const_tree node
, const char *file
, int line
,
9079 const char *function
, enum omp_clause_code c1
,
9080 enum omp_clause_code c2
)
9083 unsigned length
= 0;
9086 for (c
= c1
; c
<= c2
; ++c
)
9087 length
+= 4 + strlen (omp_clause_code_name
[c
]);
9089 length
+= strlen ("expected ");
9090 buffer
= (char *) alloca (length
);
9093 for (c
= c1
; c
<= c2
; ++c
)
9095 const char *prefix
= length
? " or " : "expected ";
9097 strcpy (buffer
+ length
, prefix
);
9098 length
+= strlen (prefix
);
9099 strcpy (buffer
+ length
, omp_clause_code_name
[c
]);
9100 length
+= strlen (omp_clause_code_name
[c
]);
9103 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9104 buffer
, omp_clause_code_name
[TREE_CODE (node
)],
9105 function
, trim_filename (file
), line
);
9109 #undef DEFTREESTRUCT
9110 #define DEFTREESTRUCT(VAL, NAME) NAME,
9112 static const char *ts_enum_names
[] = {
9113 #include "treestruct.def"
9115 #undef DEFTREESTRUCT
9117 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
9119 /* Similar to tree_class_check_failed, except that we check for
9120 whether CODE contains the tree structure identified by EN. */
9123 tree_contains_struct_check_failed (const_tree node
,
9124 const enum tree_node_structure_enum en
,
9125 const char *file
, int line
,
9126 const char *function
)
9129 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
9131 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9135 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9136 (dynamically sized) vector. */
9139 tree_int_cst_elt_check_failed (int idx
, int len
, const char *file
, int line
,
9140 const char *function
)
9143 ("tree check: accessed elt %d of %<tree_int_cst%> with %d elts in %s, "
9145 idx
+ 1, len
, function
, trim_filename (file
), line
);
9148 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9149 (dynamically sized) vector. */
9152 tree_vec_elt_check_failed (int idx
, int len
, const char *file
, int line
,
9153 const char *function
)
9156 ("tree check: accessed elt %d of %<tree_vec%> with %d elts in %s, at %s:%d",
9157 idx
+ 1, len
, function
, trim_filename (file
), line
);
9160 /* Similar to above, except that the check is for the bounds of the operand
9161 vector of an expression node EXP. */
9164 tree_operand_check_failed (int idx
, const_tree exp
, const char *file
,
9165 int line
, const char *function
)
9167 enum tree_code code
= TREE_CODE (exp
);
9169 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
9170 idx
+ 1, get_tree_code_name (code
), TREE_OPERAND_LENGTH (exp
),
9171 function
, trim_filename (file
), line
);
9174 /* Similar to above, except that the check is for the number of
9175 operands of an OMP_CLAUSE node. */
9178 omp_clause_operand_check_failed (int idx
, const_tree t
, const char *file
,
9179 int line
, const char *function
)
9182 ("tree check: accessed operand %d of %<omp_clause %s%> with %d operands "
9183 "in %s, at %s:%d", idx
+ 1, omp_clause_code_name
[OMP_CLAUSE_CODE (t
)],
9184 omp_clause_num_ops
[OMP_CLAUSE_CODE (t
)], function
,
9185 trim_filename (file
), line
);
9187 #endif /* ENABLE_TREE_CHECKING */
9189 /* Create a new vector type node holding NUNITS units of type INNERTYPE,
9190 and mapped to the machine mode MODE. Initialize its fields and build
9191 the information necessary for debugging output. */
9194 make_vector_type (tree innertype
, poly_int64 nunits
, machine_mode mode
)
9197 tree mv_innertype
= TYPE_MAIN_VARIANT (innertype
);
9199 t
= make_node (VECTOR_TYPE
);
9200 TREE_TYPE (t
) = mv_innertype
;
9201 SET_TYPE_VECTOR_SUBPARTS (t
, nunits
);
9202 SET_TYPE_MODE (t
, mode
);
9204 if (TYPE_STRUCTURAL_EQUALITY_P (mv_innertype
) || in_lto_p
)
9205 SET_TYPE_STRUCTURAL_EQUALITY (t
);
9206 else if ((TYPE_CANONICAL (mv_innertype
) != innertype
9207 || mode
!= VOIDmode
)
9208 && !VECTOR_BOOLEAN_TYPE_P (t
))
9210 = make_vector_type (TYPE_CANONICAL (mv_innertype
), nunits
, VOIDmode
);
9214 hashval_t hash
= type_hash_canon_hash (t
);
9215 t
= type_hash_canon (hash
, t
);
9217 /* We have built a main variant, based on the main variant of the
9218 inner type. Use it to build the variant we return. */
9219 if ((TYPE_ATTRIBUTES (innertype
) || TYPE_QUALS (innertype
))
9220 && TREE_TYPE (t
) != innertype
)
9221 return build_type_attribute_qual_variant (t
,
9222 TYPE_ATTRIBUTES (innertype
),
9223 TYPE_QUALS (innertype
));
9229 make_or_reuse_type (unsigned size
, int unsignedp
)
9233 if (size
== INT_TYPE_SIZE
)
9234 return unsignedp
? unsigned_type_node
: integer_type_node
;
9235 if (size
== CHAR_TYPE_SIZE
)
9236 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
9237 if (size
== SHORT_TYPE_SIZE
)
9238 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
9239 if (size
== LONG_TYPE_SIZE
)
9240 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
9241 if (size
== LONG_LONG_TYPE_SIZE
)
9242 return (unsignedp
? long_long_unsigned_type_node
9243 : long_long_integer_type_node
);
9245 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
9246 if (size
== int_n_data
[i
].bitsize
9247 && int_n_enabled_p
[i
])
9248 return (unsignedp
? int_n_trees
[i
].unsigned_type
9249 : int_n_trees
[i
].signed_type
);
9252 return make_unsigned_type (size
);
9254 return make_signed_type (size
);
9257 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
9260 make_or_reuse_fract_type (unsigned size
, int unsignedp
, int satp
)
9264 if (size
== SHORT_FRACT_TYPE_SIZE
)
9265 return unsignedp
? sat_unsigned_short_fract_type_node
9266 : sat_short_fract_type_node
;
9267 if (size
== FRACT_TYPE_SIZE
)
9268 return unsignedp
? sat_unsigned_fract_type_node
: sat_fract_type_node
;
9269 if (size
== LONG_FRACT_TYPE_SIZE
)
9270 return unsignedp
? sat_unsigned_long_fract_type_node
9271 : sat_long_fract_type_node
;
9272 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
9273 return unsignedp
? sat_unsigned_long_long_fract_type_node
9274 : sat_long_long_fract_type_node
;
9278 if (size
== SHORT_FRACT_TYPE_SIZE
)
9279 return unsignedp
? unsigned_short_fract_type_node
9280 : short_fract_type_node
;
9281 if (size
== FRACT_TYPE_SIZE
)
9282 return unsignedp
? unsigned_fract_type_node
: fract_type_node
;
9283 if (size
== LONG_FRACT_TYPE_SIZE
)
9284 return unsignedp
? unsigned_long_fract_type_node
9285 : long_fract_type_node
;
9286 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
9287 return unsignedp
? unsigned_long_long_fract_type_node
9288 : long_long_fract_type_node
;
9291 return make_fract_type (size
, unsignedp
, satp
);
9294 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
9297 make_or_reuse_accum_type (unsigned size
, int unsignedp
, int satp
)
9301 if (size
== SHORT_ACCUM_TYPE_SIZE
)
9302 return unsignedp
? sat_unsigned_short_accum_type_node
9303 : sat_short_accum_type_node
;
9304 if (size
== ACCUM_TYPE_SIZE
)
9305 return unsignedp
? sat_unsigned_accum_type_node
: sat_accum_type_node
;
9306 if (size
== LONG_ACCUM_TYPE_SIZE
)
9307 return unsignedp
? sat_unsigned_long_accum_type_node
9308 : sat_long_accum_type_node
;
9309 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
9310 return unsignedp
? sat_unsigned_long_long_accum_type_node
9311 : sat_long_long_accum_type_node
;
9315 if (size
== SHORT_ACCUM_TYPE_SIZE
)
9316 return unsignedp
? unsigned_short_accum_type_node
9317 : short_accum_type_node
;
9318 if (size
== ACCUM_TYPE_SIZE
)
9319 return unsignedp
? unsigned_accum_type_node
: accum_type_node
;
9320 if (size
== LONG_ACCUM_TYPE_SIZE
)
9321 return unsignedp
? unsigned_long_accum_type_node
9322 : long_accum_type_node
;
9323 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
9324 return unsignedp
? unsigned_long_long_accum_type_node
9325 : long_long_accum_type_node
;
9328 return make_accum_type (size
, unsignedp
, satp
);
9332 /* Create an atomic variant node for TYPE. This routine is called
9333 during initialization of data types to create the 5 basic atomic
9334 types. The generic build_variant_type function requires these to
9335 already be set up in order to function properly, so cannot be
9336 called from there. If ALIGN is non-zero, then ensure alignment is
9337 overridden to this value. */
9340 build_atomic_base (tree type
, unsigned int align
)
9344 /* Make sure its not already registered. */
9345 if ((t
= get_qualified_type (type
, TYPE_QUAL_ATOMIC
)))
9348 t
= build_variant_type_copy (type
);
9349 set_type_quals (t
, TYPE_QUAL_ATOMIC
);
9352 SET_TYPE_ALIGN (t
, align
);
9357 /* Information about the _FloatN and _FloatNx types. This must be in
9358 the same order as the corresponding TI_* enum values. */
9359 const floatn_type_info floatn_nx_types
[NUM_FLOATN_NX_TYPES
] =
9371 /* Create nodes for all integer types (and error_mark_node) using the sizes
9372 of C datatypes. SIGNED_CHAR specifies whether char is signed. */
9375 build_common_tree_nodes (bool signed_char
)
9379 error_mark_node
= make_node (ERROR_MARK
);
9380 TREE_TYPE (error_mark_node
) = error_mark_node
;
9382 initialize_sizetypes ();
9384 /* Define both `signed char' and `unsigned char'. */
9385 signed_char_type_node
= make_signed_type (CHAR_TYPE_SIZE
);
9386 TYPE_STRING_FLAG (signed_char_type_node
) = 1;
9387 unsigned_char_type_node
= make_unsigned_type (CHAR_TYPE_SIZE
);
9388 TYPE_STRING_FLAG (unsigned_char_type_node
) = 1;
9390 /* Define `char', which is like either `signed char' or `unsigned char'
9391 but not the same as either. */
9394 ? make_signed_type (CHAR_TYPE_SIZE
)
9395 : make_unsigned_type (CHAR_TYPE_SIZE
));
9396 TYPE_STRING_FLAG (char_type_node
) = 1;
9398 short_integer_type_node
= make_signed_type (SHORT_TYPE_SIZE
);
9399 short_unsigned_type_node
= make_unsigned_type (SHORT_TYPE_SIZE
);
9400 integer_type_node
= make_signed_type (INT_TYPE_SIZE
);
9401 unsigned_type_node
= make_unsigned_type (INT_TYPE_SIZE
);
9402 long_integer_type_node
= make_signed_type (LONG_TYPE_SIZE
);
9403 long_unsigned_type_node
= make_unsigned_type (LONG_TYPE_SIZE
);
9404 long_long_integer_type_node
= make_signed_type (LONG_LONG_TYPE_SIZE
);
9405 long_long_unsigned_type_node
= make_unsigned_type (LONG_LONG_TYPE_SIZE
);
9407 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
9409 int_n_trees
[i
].signed_type
= make_signed_type (int_n_data
[i
].bitsize
);
9410 int_n_trees
[i
].unsigned_type
= make_unsigned_type (int_n_data
[i
].bitsize
);
9412 if (int_n_enabled_p
[i
])
9414 integer_types
[itk_intN_0
+ i
* 2] = int_n_trees
[i
].signed_type
;
9415 integer_types
[itk_unsigned_intN_0
+ i
* 2] = int_n_trees
[i
].unsigned_type
;
9419 /* Define a boolean type. This type only represents boolean values but
9420 may be larger than char depending on the value of BOOL_TYPE_SIZE. */
9421 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
9422 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
9423 TYPE_PRECISION (boolean_type_node
) = 1;
9424 TYPE_MAX_VALUE (boolean_type_node
) = build_int_cst (boolean_type_node
, 1);
9426 /* Define what type to use for size_t. */
9427 if (strcmp (SIZE_TYPE
, "unsigned int") == 0)
9428 size_type_node
= unsigned_type_node
;
9429 else if (strcmp (SIZE_TYPE
, "long unsigned int") == 0)
9430 size_type_node
= long_unsigned_type_node
;
9431 else if (strcmp (SIZE_TYPE
, "long long unsigned int") == 0)
9432 size_type_node
= long_long_unsigned_type_node
;
9433 else if (strcmp (SIZE_TYPE
, "short unsigned int") == 0)
9434 size_type_node
= short_unsigned_type_node
;
9439 size_type_node
= NULL_TREE
;
9440 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
9441 if (int_n_enabled_p
[i
])
9443 char name
[50], altname
[50];
9444 sprintf (name
, "__int%d unsigned", int_n_data
[i
].bitsize
);
9445 sprintf (altname
, "__int%d__ unsigned", int_n_data
[i
].bitsize
);
9447 if (strcmp (name
, SIZE_TYPE
) == 0
9448 || strcmp (altname
, SIZE_TYPE
) == 0)
9450 size_type_node
= int_n_trees
[i
].unsigned_type
;
9453 if (size_type_node
== NULL_TREE
)
9457 /* Define what type to use for ptrdiff_t. */
9458 if (strcmp (PTRDIFF_TYPE
, "int") == 0)
9459 ptrdiff_type_node
= integer_type_node
;
9460 else if (strcmp (PTRDIFF_TYPE
, "long int") == 0)
9461 ptrdiff_type_node
= long_integer_type_node
;
9462 else if (strcmp (PTRDIFF_TYPE
, "long long int") == 0)
9463 ptrdiff_type_node
= long_long_integer_type_node
;
9464 else if (strcmp (PTRDIFF_TYPE
, "short int") == 0)
9465 ptrdiff_type_node
= short_integer_type_node
;
9468 ptrdiff_type_node
= NULL_TREE
;
9469 for (int i
= 0; i
< NUM_INT_N_ENTS
; i
++)
9470 if (int_n_enabled_p
[i
])
9472 char name
[50], altname
[50];
9473 sprintf (name
, "__int%d", int_n_data
[i
].bitsize
);
9474 sprintf (altname
, "__int%d__", int_n_data
[i
].bitsize
);
9476 if (strcmp (name
, PTRDIFF_TYPE
) == 0
9477 || strcmp (altname
, PTRDIFF_TYPE
) == 0)
9478 ptrdiff_type_node
= int_n_trees
[i
].signed_type
;
9480 if (ptrdiff_type_node
== NULL_TREE
)
9484 /* Fill in the rest of the sized types. Reuse existing type nodes
9486 intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 0);
9487 intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 0);
9488 intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 0);
9489 intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 0);
9490 intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 0);
9492 unsigned_intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 1);
9493 unsigned_intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 1);
9494 unsigned_intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 1);
9495 unsigned_intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 1);
9496 unsigned_intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 1);
9498 /* Don't call build_qualified type for atomics. That routine does
9499 special processing for atomics, and until they are initialized
9500 it's better not to make that call.
9502 Check to see if there is a target override for atomic types. */
9504 atomicQI_type_node
= build_atomic_base (unsigned_intQI_type_node
,
9505 targetm
.atomic_align_for_mode (QImode
));
9506 atomicHI_type_node
= build_atomic_base (unsigned_intHI_type_node
,
9507 targetm
.atomic_align_for_mode (HImode
));
9508 atomicSI_type_node
= build_atomic_base (unsigned_intSI_type_node
,
9509 targetm
.atomic_align_for_mode (SImode
));
9510 atomicDI_type_node
= build_atomic_base (unsigned_intDI_type_node
,
9511 targetm
.atomic_align_for_mode (DImode
));
9512 atomicTI_type_node
= build_atomic_base (unsigned_intTI_type_node
,
9513 targetm
.atomic_align_for_mode (TImode
));
9515 access_public_node
= get_identifier ("public");
9516 access_protected_node
= get_identifier ("protected");
9517 access_private_node
= get_identifier ("private");
9519 /* Define these next since types below may used them. */
9520 integer_zero_node
= build_int_cst (integer_type_node
, 0);
9521 integer_one_node
= build_int_cst (integer_type_node
, 1);
9522 integer_three_node
= build_int_cst (integer_type_node
, 3);
9523 integer_minus_one_node
= build_int_cst (integer_type_node
, -1);
9525 size_zero_node
= size_int (0);
9526 size_one_node
= size_int (1);
9527 bitsize_zero_node
= bitsize_int (0);
9528 bitsize_one_node
= bitsize_int (1);
9529 bitsize_unit_node
= bitsize_int (BITS_PER_UNIT
);
9531 boolean_false_node
= TYPE_MIN_VALUE (boolean_type_node
);
9532 boolean_true_node
= TYPE_MAX_VALUE (boolean_type_node
);
9534 void_type_node
= make_node (VOID_TYPE
);
9535 layout_type (void_type_node
);
9537 /* We are not going to have real types in C with less than byte alignment,
9538 so we might as well not have any types that claim to have it. */
9539 SET_TYPE_ALIGN (void_type_node
, BITS_PER_UNIT
);
9540 TYPE_USER_ALIGN (void_type_node
) = 0;
9542 void_node
= make_node (VOID_CST
);
9543 TREE_TYPE (void_node
) = void_type_node
;
9545 void_list_node
= build_tree_list (NULL_TREE
, void_type_node
);
9547 null_pointer_node
= build_int_cst (build_pointer_type (void_type_node
), 0);
9548 layout_type (TREE_TYPE (null_pointer_node
));
9550 ptr_type_node
= build_pointer_type (void_type_node
);
9552 = build_pointer_type (build_type_variant (void_type_node
, 1, 0));
9553 for (unsigned i
= 0; i
< ARRAY_SIZE (builtin_structptr_types
); ++i
)
9554 builtin_structptr_types
[i
].node
= builtin_structptr_types
[i
].base
;
9556 pointer_sized_int_node
= build_nonstandard_integer_type (POINTER_SIZE
, 1);
9558 float_type_node
= make_node (REAL_TYPE
);
9559 TYPE_PRECISION (float_type_node
) = FLOAT_TYPE_SIZE
;
9560 layout_type (float_type_node
);
9562 double_type_node
= make_node (REAL_TYPE
);
9563 TYPE_PRECISION (double_type_node
) = DOUBLE_TYPE_SIZE
;
9564 layout_type (double_type_node
);
9566 long_double_type_node
= make_node (REAL_TYPE
);
9567 TYPE_PRECISION (long_double_type_node
) = LONG_DOUBLE_TYPE_SIZE
;
9568 layout_type (long_double_type_node
);
9570 for (i
= 0; i
< NUM_FLOATN_NX_TYPES
; i
++)
9572 int n
= floatn_nx_types
[i
].n
;
9573 bool extended
= floatn_nx_types
[i
].extended
;
9574 scalar_float_mode mode
;
9575 if (!targetm
.floatn_mode (n
, extended
).exists (&mode
))
9577 int precision
= GET_MODE_PRECISION (mode
);
9578 /* Work around the rs6000 KFmode having precision 113 not
9580 const struct real_format
*fmt
= REAL_MODE_FORMAT (mode
);
9581 gcc_assert (fmt
->b
== 2 && fmt
->emin
+ fmt
->emax
== 3);
9582 int min_precision
= fmt
->p
+ ceil_log2 (fmt
->emax
- fmt
->emin
);
9584 gcc_assert (min_precision
== n
);
9585 if (precision
< min_precision
)
9586 precision
= min_precision
;
9587 FLOATN_NX_TYPE_NODE (i
) = make_node (REAL_TYPE
);
9588 TYPE_PRECISION (FLOATN_NX_TYPE_NODE (i
)) = precision
;
9589 layout_type (FLOATN_NX_TYPE_NODE (i
));
9590 SET_TYPE_MODE (FLOATN_NX_TYPE_NODE (i
), mode
);
9592 float128t_type_node
= float128_type_node
;
9594 if (REAL_MODE_FORMAT (BFmode
) == &arm_bfloat_half_format
9595 && targetm
.scalar_mode_supported_p (BFmode
)
9596 && targetm
.libgcc_floating_mode_supported_p (BFmode
))
9598 bfloat16_type_node
= make_node (REAL_TYPE
);
9599 TYPE_PRECISION (bfloat16_type_node
) = GET_MODE_PRECISION (BFmode
);
9600 layout_type (bfloat16_type_node
);
9601 SET_TYPE_MODE (bfloat16_type_node
, BFmode
);
9605 float_ptr_type_node
= build_pointer_type (float_type_node
);
9606 double_ptr_type_node
= build_pointer_type (double_type_node
);
9607 long_double_ptr_type_node
= build_pointer_type (long_double_type_node
);
9608 integer_ptr_type_node
= build_pointer_type (integer_type_node
);
9610 /* Fixed size integer types. */
9611 uint16_type_node
= make_or_reuse_type (16, 1);
9612 uint32_type_node
= make_or_reuse_type (32, 1);
9613 uint64_type_node
= make_or_reuse_type (64, 1);
9614 if (targetm
.scalar_mode_supported_p (TImode
))
9615 uint128_type_node
= make_or_reuse_type (128, 1);
9617 /* Decimal float types. */
9618 if (targetm
.decimal_float_supported_p ())
9620 dfloat32_type_node
= make_node (REAL_TYPE
);
9621 TYPE_PRECISION (dfloat32_type_node
) = DECIMAL32_TYPE_SIZE
;
9622 SET_TYPE_MODE (dfloat32_type_node
, SDmode
);
9623 layout_type (dfloat32_type_node
);
9625 dfloat64_type_node
= make_node (REAL_TYPE
);
9626 TYPE_PRECISION (dfloat64_type_node
) = DECIMAL64_TYPE_SIZE
;
9627 SET_TYPE_MODE (dfloat64_type_node
, DDmode
);
9628 layout_type (dfloat64_type_node
);
9630 dfloat128_type_node
= make_node (REAL_TYPE
);
9631 TYPE_PRECISION (dfloat128_type_node
) = DECIMAL128_TYPE_SIZE
;
9632 SET_TYPE_MODE (dfloat128_type_node
, TDmode
);
9633 layout_type (dfloat128_type_node
);
9636 complex_integer_type_node
= build_complex_type (integer_type_node
, true);
9637 complex_float_type_node
= build_complex_type (float_type_node
, true);
9638 complex_double_type_node
= build_complex_type (double_type_node
, true);
9639 complex_long_double_type_node
= build_complex_type (long_double_type_node
,
9642 for (i
= 0; i
< NUM_FLOATN_NX_TYPES
; i
++)
9644 if (FLOATN_NX_TYPE_NODE (i
) != NULL_TREE
)
9645 COMPLEX_FLOATN_NX_TYPE_NODE (i
)
9646 = build_complex_type (FLOATN_NX_TYPE_NODE (i
));
9649 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
9650 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
9651 sat_ ## KIND ## _type_node = \
9652 make_sat_signed_ ## KIND ## _type (SIZE); \
9653 sat_unsigned_ ## KIND ## _type_node = \
9654 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9655 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9656 unsigned_ ## KIND ## _type_node = \
9657 make_unsigned_ ## KIND ## _type (SIZE);
9659 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
9660 sat_ ## WIDTH ## KIND ## _type_node = \
9661 make_sat_signed_ ## KIND ## _type (SIZE); \
9662 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
9663 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9664 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9665 unsigned_ ## WIDTH ## KIND ## _type_node = \
9666 make_unsigned_ ## KIND ## _type (SIZE);
9668 /* Make fixed-point type nodes based on four different widths. */
9669 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
9670 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
9671 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
9672 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
9673 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
9675 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
9676 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
9677 NAME ## _type_node = \
9678 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
9679 u ## NAME ## _type_node = \
9680 make_or_reuse_unsigned_ ## KIND ## _type \
9681 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
9682 sat_ ## NAME ## _type_node = \
9683 make_or_reuse_sat_signed_ ## KIND ## _type \
9684 (GET_MODE_BITSIZE (MODE ## mode)); \
9685 sat_u ## NAME ## _type_node = \
9686 make_or_reuse_sat_unsigned_ ## KIND ## _type \
9687 (GET_MODE_BITSIZE (U ## MODE ## mode));
9689 /* Fixed-point type and mode nodes. */
9690 MAKE_FIXED_TYPE_NODE_FAMILY (fract
, FRACT
)
9691 MAKE_FIXED_TYPE_NODE_FAMILY (accum
, ACCUM
)
9692 MAKE_FIXED_MODE_NODE (fract
, qq
, QQ
)
9693 MAKE_FIXED_MODE_NODE (fract
, hq
, HQ
)
9694 MAKE_FIXED_MODE_NODE (fract
, sq
, SQ
)
9695 MAKE_FIXED_MODE_NODE (fract
, dq
, DQ
)
9696 MAKE_FIXED_MODE_NODE (fract
, tq
, TQ
)
9697 MAKE_FIXED_MODE_NODE (accum
, ha
, HA
)
9698 MAKE_FIXED_MODE_NODE (accum
, sa
, SA
)
9699 MAKE_FIXED_MODE_NODE (accum
, da
, DA
)
9700 MAKE_FIXED_MODE_NODE (accum
, ta
, TA
)
9703 tree t
= targetm
.build_builtin_va_list ();
9705 /* Many back-ends define record types without setting TYPE_NAME.
9706 If we copied the record type here, we'd keep the original
9707 record type without a name. This breaks name mangling. So,
9708 don't copy record types and let c_common_nodes_and_builtins()
9709 declare the type to be __builtin_va_list. */
9710 if (TREE_CODE (t
) != RECORD_TYPE
)
9711 t
= build_variant_type_copy (t
);
9713 va_list_type_node
= t
;
9716 /* SCEV analyzer global shared trees. */
9717 chrec_dont_know
= make_node (SCEV_NOT_KNOWN
);
9718 TREE_TYPE (chrec_dont_know
) = void_type_node
;
9719 chrec_known
= make_node (SCEV_KNOWN
);
9720 TREE_TYPE (chrec_known
) = void_type_node
;
9723 /* Modify DECL for given flags.
9724 TM_PURE attribute is set only on types, so the function will modify
9725 DECL's type when ECF_TM_PURE is used. */
9728 set_call_expr_flags (tree decl
, int flags
)
9730 if (flags
& ECF_NOTHROW
)
9731 TREE_NOTHROW (decl
) = 1;
9732 if (flags
& ECF_CONST
)
9733 TREE_READONLY (decl
) = 1;
9734 if (flags
& ECF_PURE
)
9735 DECL_PURE_P (decl
) = 1;
9736 if (flags
& ECF_LOOPING_CONST_OR_PURE
)
9737 DECL_LOOPING_CONST_OR_PURE_P (decl
) = 1;
9738 if (flags
& ECF_NOVOPS
)
9739 DECL_IS_NOVOPS (decl
) = 1;
9740 if (flags
& ECF_NORETURN
)
9741 TREE_THIS_VOLATILE (decl
) = 1;
9742 if (flags
& ECF_MALLOC
)
9743 DECL_IS_MALLOC (decl
) = 1;
9744 if (flags
& ECF_RETURNS_TWICE
)
9745 DECL_IS_RETURNS_TWICE (decl
) = 1;
9746 if (flags
& ECF_LEAF
)
9747 DECL_ATTRIBUTES (decl
) = tree_cons (get_identifier ("leaf"),
9748 NULL
, DECL_ATTRIBUTES (decl
));
9749 if (flags
& ECF_COLD
)
9750 DECL_ATTRIBUTES (decl
) = tree_cons (get_identifier ("cold"),
9751 NULL
, DECL_ATTRIBUTES (decl
));
9752 if (flags
& ECF_RET1
)
9753 DECL_ATTRIBUTES (decl
)
9754 = tree_cons (get_identifier ("fn spec"),
9755 build_tree_list (NULL_TREE
, build_string (2, "1 ")),
9756 DECL_ATTRIBUTES (decl
));
9757 if ((flags
& ECF_TM_PURE
) && flag_tm
)
9758 apply_tm_attr (decl
, get_identifier ("transaction_pure"));
9759 if ((flags
& ECF_XTHROW
))
9760 DECL_ATTRIBUTES (decl
)
9761 = tree_cons (get_identifier ("expected_throw"),
9762 NULL
, DECL_ATTRIBUTES (decl
));
9763 /* Looping const or pure is implied by noreturn.
9764 There is currently no way to declare looping const or looping pure alone. */
9765 gcc_assert (!(flags
& ECF_LOOPING_CONST_OR_PURE
)
9766 || ((flags
& ECF_NORETURN
) && (flags
& (ECF_CONST
| ECF_PURE
))));
9770 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
9773 local_define_builtin (const char *name
, tree type
, enum built_in_function code
,
9774 const char *library_name
, int ecf_flags
)
9778 decl
= add_builtin_function (name
, type
, code
, BUILT_IN_NORMAL
,
9779 library_name
, NULL_TREE
);
9780 set_call_expr_flags (decl
, ecf_flags
);
9782 set_builtin_decl (code
, decl
, true);
9785 /* Call this function after instantiating all builtins that the language
9786 front end cares about. This will build the rest of the builtins
9787 and internal functions that are relied upon by the tree optimizers and
9791 build_common_builtin_nodes (void)
9796 if (!builtin_decl_explicit_p (BUILT_IN_CLEAR_PADDING
))
9798 ftype
= build_function_type_list (void_type_node
,
9803 local_define_builtin ("__builtin_clear_padding", ftype
,
9804 BUILT_IN_CLEAR_PADDING
,
9805 "__builtin_clear_padding",
9806 ECF_LEAF
| ECF_NOTHROW
);
9809 if (!builtin_decl_explicit_p (BUILT_IN_UNREACHABLE
)
9810 || !builtin_decl_explicit_p (BUILT_IN_TRAP
)
9811 || !builtin_decl_explicit_p (BUILT_IN_UNREACHABLE_TRAP
)
9812 || !builtin_decl_explicit_p (BUILT_IN_ABORT
))
9814 ftype
= build_function_type (void_type_node
, void_list_node
);
9815 if (!builtin_decl_explicit_p (BUILT_IN_UNREACHABLE
))
9816 local_define_builtin ("__builtin_unreachable", ftype
,
9817 BUILT_IN_UNREACHABLE
,
9818 "__builtin_unreachable",
9819 ECF_NOTHROW
| ECF_LEAF
| ECF_NORETURN
9820 | ECF_CONST
| ECF_COLD
);
9821 if (!builtin_decl_explicit_p (BUILT_IN_UNREACHABLE_TRAP
))
9822 local_define_builtin ("__builtin_unreachable trap", ftype
,
9823 BUILT_IN_UNREACHABLE_TRAP
,
9824 "__builtin_unreachable trap",
9825 ECF_NOTHROW
| ECF_LEAF
| ECF_NORETURN
9826 | ECF_CONST
| ECF_COLD
);
9827 if (!builtin_decl_explicit_p (BUILT_IN_ABORT
))
9828 local_define_builtin ("__builtin_abort", ftype
, BUILT_IN_ABORT
,
9830 ECF_LEAF
| ECF_NORETURN
| ECF_CONST
| ECF_COLD
);
9831 if (!builtin_decl_explicit_p (BUILT_IN_TRAP
))
9832 local_define_builtin ("__builtin_trap", ftype
, BUILT_IN_TRAP
,
9834 ECF_NORETURN
| ECF_NOTHROW
| ECF_LEAF
| ECF_COLD
);
9837 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
)
9838 || !builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
9840 ftype
= build_function_type_list (ptr_type_node
,
9841 ptr_type_node
, const_ptr_type_node
,
9842 size_type_node
, NULL_TREE
);
9844 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
))
9845 local_define_builtin ("__builtin_memcpy", ftype
, BUILT_IN_MEMCPY
,
9846 "memcpy", ECF_NOTHROW
| ECF_LEAF
);
9847 if (!builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
9848 local_define_builtin ("__builtin_memmove", ftype
, BUILT_IN_MEMMOVE
,
9849 "memmove", ECF_NOTHROW
| ECF_LEAF
);
9852 if (!builtin_decl_explicit_p (BUILT_IN_MEMCMP
))
9854 ftype
= build_function_type_list (integer_type_node
, const_ptr_type_node
,
9855 const_ptr_type_node
, size_type_node
,
9857 local_define_builtin ("__builtin_memcmp", ftype
, BUILT_IN_MEMCMP
,
9858 "memcmp", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
9861 if (!builtin_decl_explicit_p (BUILT_IN_MEMSET
))
9863 ftype
= build_function_type_list (ptr_type_node
,
9864 ptr_type_node
, integer_type_node
,
9865 size_type_node
, NULL_TREE
);
9866 local_define_builtin ("__builtin_memset", ftype
, BUILT_IN_MEMSET
,
9867 "memset", ECF_NOTHROW
| ECF_LEAF
);
9870 /* If we're checking the stack, `alloca' can throw. */
9871 const int alloca_flags
9872 = ECF_MALLOC
| ECF_LEAF
| (flag_stack_check
? 0 : ECF_NOTHROW
);
9874 if (!builtin_decl_explicit_p (BUILT_IN_ALLOCA
))
9876 ftype
= build_function_type_list (ptr_type_node
,
9877 size_type_node
, NULL_TREE
);
9878 local_define_builtin ("__builtin_alloca", ftype
, BUILT_IN_ALLOCA
,
9879 "alloca", alloca_flags
);
9882 ftype
= build_function_type_list (ptr_type_node
, size_type_node
,
9883 size_type_node
, NULL_TREE
);
9884 local_define_builtin ("__builtin_alloca_with_align", ftype
,
9885 BUILT_IN_ALLOCA_WITH_ALIGN
,
9886 "__builtin_alloca_with_align",
9889 ftype
= build_function_type_list (ptr_type_node
, size_type_node
,
9890 size_type_node
, size_type_node
, NULL_TREE
);
9891 local_define_builtin ("__builtin_alloca_with_align_and_max", ftype
,
9892 BUILT_IN_ALLOCA_WITH_ALIGN_AND_MAX
,
9893 "__builtin_alloca_with_align_and_max",
9896 ftype
= build_function_type_list (void_type_node
,
9897 ptr_type_node
, ptr_type_node
,
9898 ptr_type_node
, NULL_TREE
);
9899 local_define_builtin ("__builtin_init_trampoline", ftype
,
9900 BUILT_IN_INIT_TRAMPOLINE
,
9901 "__builtin_init_trampoline", ECF_NOTHROW
| ECF_LEAF
);
9902 local_define_builtin ("__builtin_init_heap_trampoline", ftype
,
9903 BUILT_IN_INIT_HEAP_TRAMPOLINE
,
9904 "__builtin_init_heap_trampoline",
9905 ECF_NOTHROW
| ECF_LEAF
);
9906 local_define_builtin ("__builtin_init_descriptor", ftype
,
9907 BUILT_IN_INIT_DESCRIPTOR
,
9908 "__builtin_init_descriptor", ECF_NOTHROW
| ECF_LEAF
);
9910 ftype
= build_function_type_list (ptr_type_node
, ptr_type_node
, NULL_TREE
);
9911 local_define_builtin ("__builtin_adjust_trampoline", ftype
,
9912 BUILT_IN_ADJUST_TRAMPOLINE
,
9913 "__builtin_adjust_trampoline",
9914 ECF_CONST
| ECF_NOTHROW
);
9915 local_define_builtin ("__builtin_adjust_descriptor", ftype
,
9916 BUILT_IN_ADJUST_DESCRIPTOR
,
9917 "__builtin_adjust_descriptor",
9918 ECF_CONST
| ECF_NOTHROW
);
9920 ftype
= build_function_type_list (void_type_node
,
9921 ptr_type_node
, ptr_type_node
, NULL_TREE
);
9922 if (!builtin_decl_explicit_p (BUILT_IN_CLEAR_CACHE
))
9923 local_define_builtin ("__builtin___clear_cache", ftype
,
9924 BUILT_IN_CLEAR_CACHE
,
9928 local_define_builtin ("__builtin_nonlocal_goto", ftype
,
9929 BUILT_IN_NONLOCAL_GOTO
,
9930 "__builtin_nonlocal_goto",
9931 ECF_NORETURN
| ECF_NOTHROW
);
9933 tree ptr_ptr_type_node
= build_pointer_type (ptr_type_node
);
9935 if (!builtin_decl_explicit_p (BUILT_IN_GCC_NESTED_PTR_CREATED
))
9937 ftype
= build_function_type_list (void_type_node
,
9938 ptr_type_node
, // void *chain
9939 ptr_type_node
, // void *func
9940 ptr_ptr_type_node
, // void **dst
9942 local_define_builtin ("__builtin___gcc_nested_func_ptr_created", ftype
,
9943 BUILT_IN_GCC_NESTED_PTR_CREATED
,
9944 "__gcc_nested_func_ptr_created", ECF_NOTHROW
);
9947 if (!builtin_decl_explicit_p (BUILT_IN_GCC_NESTED_PTR_DELETED
))
9949 ftype
= build_function_type_list (void_type_node
, NULL_TREE
);
9950 local_define_builtin ("__builtin___gcc_nested_func_ptr_deleted", ftype
,
9951 BUILT_IN_GCC_NESTED_PTR_DELETED
,
9952 "__gcc_nested_func_ptr_deleted", ECF_NOTHROW
);
9955 ftype
= build_function_type_list (void_type_node
,
9956 ptr_type_node
, ptr_type_node
, NULL_TREE
);
9957 local_define_builtin ("__builtin_setjmp_setup", ftype
,
9958 BUILT_IN_SETJMP_SETUP
,
9959 "__builtin_setjmp_setup", ECF_NOTHROW
);
9961 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
9962 local_define_builtin ("__builtin_setjmp_receiver", ftype
,
9963 BUILT_IN_SETJMP_RECEIVER
,
9964 "__builtin_setjmp_receiver", ECF_NOTHROW
| ECF_LEAF
);
9966 ftype
= build_function_type_list (ptr_type_node
, NULL_TREE
);
9967 local_define_builtin ("__builtin_stack_save", ftype
, BUILT_IN_STACK_SAVE
,
9968 "__builtin_stack_save", ECF_NOTHROW
| ECF_LEAF
);
9970 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
9971 local_define_builtin ("__builtin_stack_restore", ftype
,
9972 BUILT_IN_STACK_RESTORE
,
9973 "__builtin_stack_restore", ECF_NOTHROW
| ECF_LEAF
);
9975 ftype
= build_function_type_list (integer_type_node
, const_ptr_type_node
,
9976 const_ptr_type_node
, size_type_node
,
9978 local_define_builtin ("__builtin_memcmp_eq", ftype
, BUILT_IN_MEMCMP_EQ
,
9979 "__builtin_memcmp_eq",
9980 ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
9982 local_define_builtin ("__builtin_strncmp_eq", ftype
, BUILT_IN_STRNCMP_EQ
,
9983 "__builtin_strncmp_eq",
9984 ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
9986 local_define_builtin ("__builtin_strcmp_eq", ftype
, BUILT_IN_STRCMP_EQ
,
9987 "__builtin_strcmp_eq",
9988 ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
9990 /* If there's a possibility that we might use the ARM EABI, build the
9991 alternate __cxa_end_cleanup node used to resume from C++. */
9992 if (targetm
.arm_eabi_unwinder
)
9994 ftype
= build_function_type_list (void_type_node
, NULL_TREE
);
9995 local_define_builtin ("__builtin_cxa_end_cleanup", ftype
,
9996 BUILT_IN_CXA_END_CLEANUP
,
9997 "__cxa_end_cleanup",
9998 ECF_NORETURN
| ECF_XTHROW
| ECF_LEAF
);
10001 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10002 local_define_builtin ("__builtin_unwind_resume", ftype
,
10003 BUILT_IN_UNWIND_RESUME
,
10004 ((targetm_common
.except_unwind_info (&global_options
)
10006 ? "_Unwind_SjLj_Resume" : "_Unwind_Resume"),
10007 ECF_NORETURN
| ECF_XTHROW
);
10009 if (builtin_decl_explicit (BUILT_IN_RETURN_ADDRESS
) == NULL_TREE
)
10011 ftype
= build_function_type_list (ptr_type_node
, integer_type_node
,
10013 local_define_builtin ("__builtin_return_address", ftype
,
10014 BUILT_IN_RETURN_ADDRESS
,
10015 "__builtin_return_address",
10019 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
)
10020 || !builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
10022 ftype
= build_function_type_list (void_type_node
, ptr_type_node
,
10023 ptr_type_node
, NULL_TREE
);
10024 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
))
10025 local_define_builtin ("__cyg_profile_func_enter", ftype
,
10026 BUILT_IN_PROFILE_FUNC_ENTER
,
10027 "__cyg_profile_func_enter", 0);
10028 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
10029 local_define_builtin ("__cyg_profile_func_exit", ftype
,
10030 BUILT_IN_PROFILE_FUNC_EXIT
,
10031 "__cyg_profile_func_exit", 0);
10034 /* The exception object and filter values from the runtime. The argument
10035 must be zero before exception lowering, i.e. from the front end. After
10036 exception lowering, it will be the region number for the exception
10037 landing pad. These functions are PURE instead of CONST to prevent
10038 them from being hoisted past the exception edge that will initialize
10039 its value in the landing pad. */
10040 ftype
= build_function_type_list (ptr_type_node
,
10041 integer_type_node
, NULL_TREE
);
10042 ecf_flags
= ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
;
10043 /* Only use TM_PURE if we have TM language support. */
10044 if (builtin_decl_explicit_p (BUILT_IN_TM_LOAD_1
))
10045 ecf_flags
|= ECF_TM_PURE
;
10046 local_define_builtin ("__builtin_eh_pointer", ftype
, BUILT_IN_EH_POINTER
,
10047 "__builtin_eh_pointer", ecf_flags
);
10049 tmp
= lang_hooks
.types
.type_for_mode (targetm
.eh_return_filter_mode (), 0);
10050 ftype
= build_function_type_list (tmp
, integer_type_node
, NULL_TREE
);
10051 local_define_builtin ("__builtin_eh_filter", ftype
, BUILT_IN_EH_FILTER
,
10052 "__builtin_eh_filter", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10054 ftype
= build_function_type_list (void_type_node
,
10055 integer_type_node
, integer_type_node
,
10057 local_define_builtin ("__builtin_eh_copy_values", ftype
,
10058 BUILT_IN_EH_COPY_VALUES
,
10059 "__builtin_eh_copy_values", ECF_NOTHROW
);
10061 /* Complex multiplication and division. These are handled as builtins
10062 rather than optabs because emit_library_call_value doesn't support
10063 complex. Further, we can do slightly better with folding these
10064 beasties if the real and complex parts of the arguments are separate. */
10068 for (mode
= MIN_MODE_COMPLEX_FLOAT
; mode
<= MAX_MODE_COMPLEX_FLOAT
; ++mode
)
10070 char mode_name_buf
[4], *q
;
10072 enum built_in_function mcode
, dcode
;
10073 tree type
, inner_type
;
10074 const char *prefix
= "__";
10076 if (targetm
.libfunc_gnu_prefix
)
10079 type
= lang_hooks
.types
.type_for_mode ((machine_mode
) mode
, 0);
10082 inner_type
= TREE_TYPE (type
);
10084 ftype
= build_function_type_list (type
, inner_type
, inner_type
,
10085 inner_type
, inner_type
, NULL_TREE
);
10087 mcode
= ((enum built_in_function
)
10088 (BUILT_IN_COMPLEX_MUL_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
10089 dcode
= ((enum built_in_function
)
10090 (BUILT_IN_COMPLEX_DIV_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
10092 for (p
= GET_MODE_NAME (mode
), q
= mode_name_buf
; *p
; p
++, q
++)
10096 /* For -ftrapping-math these should throw from a former
10097 -fnon-call-exception stmt. */
10098 built_in_names
[mcode
] = concat (prefix
, "mul", mode_name_buf
, "3",
10100 local_define_builtin (built_in_names
[mcode
], ftype
, mcode
,
10101 built_in_names
[mcode
],
10102 ECF_CONST
| ECF_LEAF
);
10104 built_in_names
[dcode
] = concat (prefix
, "div", mode_name_buf
, "3",
10106 local_define_builtin (built_in_names
[dcode
], ftype
, dcode
,
10107 built_in_names
[dcode
],
10108 ECF_CONST
| ECF_LEAF
);
10112 init_internal_fns ();
10115 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
10118 If we requested a pointer to a vector, build up the pointers that
10119 we stripped off while looking for the inner type. Similarly for
10120 return values from functions.
10122 The argument TYPE is the top of the chain, and BOTTOM is the
10123 new type which we will point to. */
10126 reconstruct_complex_type (tree type
, tree bottom
)
10130 if (TREE_CODE (type
) == POINTER_TYPE
)
10132 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10133 outer
= build_pointer_type_for_mode (inner
, TYPE_MODE (type
),
10134 TYPE_REF_CAN_ALIAS_ALL (type
));
10136 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
10138 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10139 outer
= build_reference_type_for_mode (inner
, TYPE_MODE (type
),
10140 TYPE_REF_CAN_ALIAS_ALL (type
));
10142 else if (TREE_CODE (type
) == ARRAY_TYPE
)
10144 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10145 outer
= build_array_type (inner
, TYPE_DOMAIN (type
));
10147 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10149 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10150 outer
= build_function_type (inner
, TYPE_ARG_TYPES (type
),
10151 TYPE_NO_NAMED_ARGS_STDARG_P (type
));
10153 else if (TREE_CODE (type
) == METHOD_TYPE
)
10155 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10156 /* The build_method_type_directly() routine prepends 'this' to argument list,
10157 so we must compensate by getting rid of it. */
10159 = build_method_type_directly
10160 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
))),
10162 TREE_CHAIN (TYPE_ARG_TYPES (type
)));
10164 else if (TREE_CODE (type
) == OFFSET_TYPE
)
10166 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10167 outer
= build_offset_type (TYPE_OFFSET_BASETYPE (type
), inner
);
10172 return build_type_attribute_qual_variant (outer
, TYPE_ATTRIBUTES (type
),
10173 TYPE_QUALS (type
));
10176 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
10179 build_vector_type_for_mode (tree innertype
, machine_mode mode
)
10182 unsigned int bitsize
;
10184 switch (GET_MODE_CLASS (mode
))
10186 case MODE_VECTOR_BOOL
:
10187 case MODE_VECTOR_INT
:
10188 case MODE_VECTOR_FLOAT
:
10189 case MODE_VECTOR_FRACT
:
10190 case MODE_VECTOR_UFRACT
:
10191 case MODE_VECTOR_ACCUM
:
10192 case MODE_VECTOR_UACCUM
:
10193 nunits
= GET_MODE_NUNITS (mode
);
10197 /* Check that there are no leftover bits. */
10198 bitsize
= GET_MODE_BITSIZE (as_a
<scalar_int_mode
> (mode
));
10199 gcc_assert (bitsize
% TREE_INT_CST_LOW (TYPE_SIZE (innertype
)) == 0);
10200 nunits
= bitsize
/ TREE_INT_CST_LOW (TYPE_SIZE (innertype
));
10204 gcc_unreachable ();
10207 return make_vector_type (innertype
, nunits
, mode
);
10210 /* Similarly, but takes the inner type and number of units, which must be
10214 build_vector_type (tree innertype
, poly_int64 nunits
)
10216 return make_vector_type (innertype
, nunits
, VOIDmode
);
10219 /* Build a truth vector with NUNITS units, giving it mode MASK_MODE. */
10222 build_truth_vector_type_for_mode (poly_uint64 nunits
, machine_mode mask_mode
)
10224 gcc_assert (mask_mode
!= BLKmode
);
10226 unsigned HOST_WIDE_INT esize
;
10227 if (VECTOR_MODE_P (mask_mode
))
10229 poly_uint64 vsize
= GET_MODE_PRECISION (mask_mode
);
10230 esize
= vector_element_size (vsize
, nunits
);
10235 tree bool_type
= build_nonstandard_boolean_type (esize
);
10237 return make_vector_type (bool_type
, nunits
, mask_mode
);
10240 /* Build a vector type that holds one boolean result for each element of
10241 vector type VECTYPE. The public interface for this operation is
10245 build_truth_vector_type_for (tree vectype
)
10247 machine_mode vector_mode
= TYPE_MODE (vectype
);
10248 poly_uint64 nunits
= TYPE_VECTOR_SUBPARTS (vectype
);
10250 machine_mode mask_mode
;
10251 if (VECTOR_MODE_P (vector_mode
)
10252 && targetm
.vectorize
.get_mask_mode (vector_mode
).exists (&mask_mode
))
10253 return build_truth_vector_type_for_mode (nunits
, mask_mode
);
10255 poly_uint64 vsize
= tree_to_poly_uint64 (TYPE_SIZE (vectype
));
10256 unsigned HOST_WIDE_INT esize
= vector_element_size (vsize
, nunits
);
10257 tree bool_type
= build_nonstandard_boolean_type (esize
);
10259 return make_vector_type (bool_type
, nunits
, VOIDmode
);
10262 /* Like build_vector_type, but builds a variant type with TYPE_VECTOR_OPAQUE
10266 build_opaque_vector_type (tree innertype
, poly_int64 nunits
)
10268 tree t
= make_vector_type (innertype
, nunits
, VOIDmode
);
10270 /* We always build the non-opaque variant before the opaque one,
10271 so if it already exists, it is TYPE_NEXT_VARIANT of this one. */
10272 cand
= TYPE_NEXT_VARIANT (t
);
10274 && TYPE_VECTOR_OPAQUE (cand
)
10275 && check_qualified_type (cand
, t
, TYPE_QUALS (t
)))
10277 /* Othewise build a variant type and make sure to queue it after
10278 the non-opaque type. */
10279 cand
= build_distinct_type_copy (t
);
10280 TYPE_VECTOR_OPAQUE (cand
) = true;
10281 TYPE_CANONICAL (cand
) = TYPE_CANONICAL (t
);
10282 TYPE_NEXT_VARIANT (cand
) = TYPE_NEXT_VARIANT (t
);
10283 TYPE_NEXT_VARIANT (t
) = cand
;
10284 TYPE_MAIN_VARIANT (cand
) = TYPE_MAIN_VARIANT (t
);
10285 /* Type variants have no alias set defined. */
10286 TYPE_ALIAS_SET (cand
) = -1;
10290 /* Return the value of element I of VECTOR_CST T as a wide_int. */
10292 static poly_wide_int
10293 vector_cst_int_elt (const_tree t
, unsigned int i
)
10295 /* First handle elements that are directly encoded. */
10296 unsigned int encoded_nelts
= vector_cst_encoded_nelts (t
);
10297 if (i
< encoded_nelts
)
10298 return wi::to_poly_wide (VECTOR_CST_ENCODED_ELT (t
, i
));
10300 /* Identify the pattern that contains element I and work out the index of
10301 the last encoded element for that pattern. */
10302 unsigned int npatterns
= VECTOR_CST_NPATTERNS (t
);
10303 unsigned int pattern
= i
% npatterns
;
10304 unsigned int count
= i
/ npatterns
;
10305 unsigned int final_i
= encoded_nelts
- npatterns
+ pattern
;
10307 /* If there are no steps, the final encoded value is the right one. */
10308 if (!VECTOR_CST_STEPPED_P (t
))
10309 return wi::to_poly_wide (VECTOR_CST_ENCODED_ELT (t
, final_i
));
10311 /* Otherwise work out the value from the last two encoded elements. */
10312 tree v1
= VECTOR_CST_ENCODED_ELT (t
, final_i
- npatterns
);
10313 tree v2
= VECTOR_CST_ENCODED_ELT (t
, final_i
);
10314 poly_wide_int diff
= wi::to_poly_wide (v2
) - wi::to_poly_wide (v1
);
10315 return wi::to_poly_wide (v2
) + (count
- 2) * diff
;
10318 /* Return the value of element I of VECTOR_CST T. */
10321 vector_cst_elt (const_tree t
, unsigned int i
)
10323 /* First handle elements that are directly encoded. */
10324 unsigned int encoded_nelts
= vector_cst_encoded_nelts (t
);
10325 if (i
< encoded_nelts
)
10326 return VECTOR_CST_ENCODED_ELT (t
, i
);
10328 /* If there are no steps, the final encoded value is the right one. */
10329 if (!VECTOR_CST_STEPPED_P (t
))
10331 /* Identify the pattern that contains element I and work out the index of
10332 the last encoded element for that pattern. */
10333 unsigned int npatterns
= VECTOR_CST_NPATTERNS (t
);
10334 unsigned int pattern
= i
% npatterns
;
10335 unsigned int final_i
= encoded_nelts
- npatterns
+ pattern
;
10336 return VECTOR_CST_ENCODED_ELT (t
, final_i
);
10339 /* Otherwise work out the value from the last two encoded elements. */
10340 return wide_int_to_tree (TREE_TYPE (TREE_TYPE (t
)),
10341 vector_cst_int_elt (t
, i
));
10344 /* Given an initializer INIT, return TRUE if INIT is zero or some
10345 aggregate of zeros. Otherwise return FALSE. If NONZERO is not
10346 null, set *NONZERO if and only if INIT is known not to be all
10347 zeros. The combination of return value of false and *NONZERO
10348 false implies that INIT may but need not be all zeros. Other
10349 combinations indicate definitive answers. */
10352 initializer_zerop (const_tree init
, bool *nonzero
/* = NULL */)
10358 /* Conservatively clear NONZERO and set it only if INIT is definitely
10364 unsigned HOST_WIDE_INT off
= 0;
10366 switch (TREE_CODE (init
))
10369 if (integer_zerop (init
))
10376 /* ??? Note that this is not correct for C4X float formats. There,
10377 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
10378 negative exponent. */
10379 if (real_zerop (init
)
10380 && !REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init
)))
10387 if (fixed_zerop (init
))
10394 if (integer_zerop (init
)
10395 || (real_zerop (init
)
10396 && !REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init
)))
10397 && !REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init
)))))
10404 if (VECTOR_CST_NPATTERNS (init
) == 1
10405 && VECTOR_CST_DUPLICATE_P (init
)
10406 && initializer_zerop (VECTOR_CST_ENCODED_ELT (init
, 0)))
10414 if (TREE_CLOBBER_P (init
))
10417 unsigned HOST_WIDE_INT idx
;
10420 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init
), idx
, elt
)
10421 if (!initializer_zerop (elt
, nonzero
))
10429 tree arg
= TREE_OPERAND (init
, 0);
10430 if (TREE_CODE (arg
) != ADDR_EXPR
)
10432 tree offset
= TREE_OPERAND (init
, 1);
10433 if (TREE_CODE (offset
) != INTEGER_CST
10434 || !tree_fits_uhwi_p (offset
))
10436 off
= tree_to_uhwi (offset
);
10439 arg
= TREE_OPERAND (arg
, 0);
10440 if (TREE_CODE (arg
) != STRING_CST
)
10444 /* Fall through. */
10448 gcc_assert (off
<= INT_MAX
);
10451 int n
= TREE_STRING_LENGTH (init
);
10455 /* We need to loop through all elements to handle cases like
10456 "\0" and "\0foobar". */
10457 for (i
= 0; i
< n
; ++i
)
10458 if (TREE_STRING_POINTER (init
)[i
] != '\0')
10472 /* Return true if EXPR is an initializer expression in which every element
10473 is a constant that is numerically equal to 0 or 1. The elements do not
10474 need to be equal to each other. */
10477 initializer_each_zero_or_onep (const_tree expr
)
10479 STRIP_ANY_LOCATION_WRAPPER (expr
);
10481 switch (TREE_CODE (expr
))
10484 return integer_zerop (expr
) || integer_onep (expr
);
10487 return real_zerop (expr
) || real_onep (expr
);
10491 unsigned HOST_WIDE_INT nelts
= vector_cst_encoded_nelts (expr
);
10492 if (VECTOR_CST_STEPPED_P (expr
)
10493 && !TYPE_VECTOR_SUBPARTS (TREE_TYPE (expr
)).is_constant (&nelts
))
10496 for (unsigned int i
= 0; i
< nelts
; ++i
)
10498 tree elt
= vector_cst_elt (expr
, i
);
10499 if (!initializer_each_zero_or_onep (elt
))
10511 /* Check if vector VEC consists of all the equal elements and
10512 that the number of elements corresponds to the type of VEC.
10513 The function returns first element of the vector
10514 or NULL_TREE if the vector is not uniform. */
10516 uniform_vector_p (const_tree vec
)
10519 unsigned HOST_WIDE_INT i
, nelts
;
10521 if (vec
== NULL_TREE
)
10524 gcc_assert (VECTOR_TYPE_P (TREE_TYPE (vec
)));
10526 if (TREE_CODE (vec
) == VEC_DUPLICATE_EXPR
)
10527 return TREE_OPERAND (vec
, 0);
10529 else if (TREE_CODE (vec
) == VECTOR_CST
)
10531 if (VECTOR_CST_NPATTERNS (vec
) == 1 && VECTOR_CST_DUPLICATE_P (vec
))
10532 return VECTOR_CST_ENCODED_ELT (vec
, 0);
10536 else if (TREE_CODE (vec
) == CONSTRUCTOR
10537 && TYPE_VECTOR_SUBPARTS (TREE_TYPE (vec
)).is_constant (&nelts
))
10539 first
= error_mark_node
;
10541 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (vec
), i
, t
)
10548 if (!operand_equal_p (first
, t
, 0))
10554 if (TREE_CODE (first
) == CONSTRUCTOR
|| TREE_CODE (first
) == VECTOR_CST
)
10555 return uniform_vector_p (first
);
10562 /* If the argument is INTEGER_CST, return it. If the argument is vector
10563 with all elements the same INTEGER_CST, return that INTEGER_CST. Otherwise
10565 Look through location wrappers. */
10568 uniform_integer_cst_p (tree t
)
10570 STRIP_ANY_LOCATION_WRAPPER (t
);
10572 if (TREE_CODE (t
) == INTEGER_CST
)
10575 if (VECTOR_TYPE_P (TREE_TYPE (t
)))
10577 t
= uniform_vector_p (t
);
10578 if (t
&& TREE_CODE (t
) == INTEGER_CST
)
10585 /* Checks to see if T is a constant or a constant vector and if each element E
10586 adheres to ~E + 1 == pow2 then return ~E otherwise NULL_TREE. */
10589 bitmask_inv_cst_vector_p (tree t
)
10592 tree_code code
= TREE_CODE (t
);
10593 tree type
= TREE_TYPE (t
);
10595 if (!INTEGRAL_TYPE_P (type
)
10596 && !VECTOR_INTEGER_TYPE_P (type
))
10599 unsigned HOST_WIDE_INT nelts
= 1;
10601 unsigned int idx
= 0;
10602 bool uniform
= uniform_integer_cst_p (t
);
10603 tree newtype
= unsigned_type_for (type
);
10604 tree_vector_builder builder
;
10605 if (code
== INTEGER_CST
)
10609 if (!VECTOR_CST_NELTS (t
).is_constant (&nelts
))
10612 cst
= vector_cst_elt (t
, 0);
10613 builder
.new_vector (newtype
, nelts
, 1);
10616 tree ty
= unsigned_type_for (TREE_TYPE (cst
));
10621 cst
= vector_cst_elt (t
, idx
);
10622 wide_int icst
= wi::to_wide (cst
);
10623 wide_int inv
= wi::bit_not (icst
);
10624 icst
= wi::add (1, inv
);
10625 if (wi::popcount (icst
) != 1)
10628 tree newcst
= wide_int_to_tree (ty
, inv
);
10631 return build_uniform_cst (newtype
, newcst
);
10633 builder
.quick_push (newcst
);
10635 while (++idx
< nelts
);
10637 return builder
.build ();
10640 /* If VECTOR_CST T has a single nonzero element, return the index of that
10641 element, otherwise return -1. */
10644 single_nonzero_element (const_tree t
)
10646 unsigned HOST_WIDE_INT nelts
;
10647 unsigned int repeat_nelts
;
10648 if (VECTOR_CST_NELTS (t
).is_constant (&nelts
))
10649 repeat_nelts
= nelts
;
10650 else if (VECTOR_CST_NELTS_PER_PATTERN (t
) == 2)
10652 nelts
= vector_cst_encoded_nelts (t
);
10653 repeat_nelts
= VECTOR_CST_NPATTERNS (t
);
10659 for (unsigned int i
= 0; i
< nelts
; ++i
)
10661 tree elt
= vector_cst_elt (t
, i
);
10662 if (!integer_zerop (elt
) && !real_zerop (elt
))
10664 if (res
>= 0 || i
>= repeat_nelts
)
10672 /* Build an empty statement at location LOC. */
10675 build_empty_stmt (location_t loc
)
10677 tree t
= build1 (NOP_EXPR
, void_type_node
, size_zero_node
);
10678 SET_EXPR_LOCATION (t
, loc
);
10683 /* Build an OMP clause with code CODE. LOC is the location of the
10687 build_omp_clause (location_t loc
, enum omp_clause_code code
)
10692 length
= omp_clause_num_ops
[code
];
10693 size
= (sizeof (struct tree_omp_clause
) + (length
- 1) * sizeof (tree
));
10695 record_node_allocation_statistics (OMP_CLAUSE
, size
);
10697 t
= (tree
) ggc_internal_alloc (size
);
10698 memset (t
, 0, size
);
10699 TREE_SET_CODE (t
, OMP_CLAUSE
);
10700 OMP_CLAUSE_SET_CODE (t
, code
);
10701 OMP_CLAUSE_LOCATION (t
) = loc
;
10706 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
10707 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
10708 Except for the CODE and operand count field, other storage for the
10709 object is initialized to zeros. */
10712 build_vl_exp (enum tree_code code
, int len MEM_STAT_DECL
)
10715 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_exp
);
10717 gcc_assert (TREE_CODE_CLASS (code
) == tcc_vl_exp
);
10718 gcc_assert (len
>= 1);
10720 record_node_allocation_statistics (code
, length
);
10722 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
10724 TREE_SET_CODE (t
, code
);
10726 /* Can't use TREE_OPERAND to store the length because if checking is
10727 enabled, it will try to check the length before we store it. :-P */
10728 t
->exp
.operands
[0] = build_int_cst (sizetype
, len
);
10733 /* Helper function for build_call_* functions; build a CALL_EXPR with
10734 indicated RETURN_TYPE, FN, and NARGS, but do not initialize any of
10735 the argument slots. */
10738 build_call_1 (tree return_type
, tree fn
, int nargs
)
10742 t
= build_vl_exp (CALL_EXPR
, nargs
+ 3);
10743 TREE_TYPE (t
) = return_type
;
10744 CALL_EXPR_FN (t
) = fn
;
10745 CALL_EXPR_STATIC_CHAIN (t
) = NULL
;
10750 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10751 FN and a null static chain slot. NARGS is the number of call arguments
10752 which are specified as "..." arguments. */
10755 build_call_nary (tree return_type
, tree fn
, int nargs
, ...)
10759 va_start (args
, nargs
);
10760 ret
= build_call_valist (return_type
, fn
, nargs
, args
);
10765 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10766 FN and a null static chain slot. NARGS is the number of call arguments
10767 which are specified as a va_list ARGS. */
10770 build_call_valist (tree return_type
, tree fn
, int nargs
, va_list args
)
10775 t
= build_call_1 (return_type
, fn
, nargs
);
10776 for (i
= 0; i
< nargs
; i
++)
10777 CALL_EXPR_ARG (t
, i
) = va_arg (args
, tree
);
10778 process_call_operands (t
);
10782 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10783 FN and a null static chain slot. NARGS is the number of call arguments
10784 which are specified as a tree array ARGS. */
10787 build_call_array_loc (location_t loc
, tree return_type
, tree fn
,
10788 int nargs
, const tree
*args
)
10793 t
= build_call_1 (return_type
, fn
, nargs
);
10794 for (i
= 0; i
< nargs
; i
++)
10795 CALL_EXPR_ARG (t
, i
) = args
[i
];
10796 process_call_operands (t
);
10797 SET_EXPR_LOCATION (t
, loc
);
10801 /* Like build_call_array, but takes a vec. */
10804 build_call_vec (tree return_type
, tree fn
, const vec
<tree
, va_gc
> *args
)
10809 ret
= build_call_1 (return_type
, fn
, vec_safe_length (args
));
10810 FOR_EACH_VEC_SAFE_ELT (args
, ix
, t
)
10811 CALL_EXPR_ARG (ret
, ix
) = t
;
10812 process_call_operands (ret
);
10816 /* Conveniently construct a function call expression. FNDECL names the
10817 function to be called and N arguments are passed in the array
10821 build_call_expr_loc_array (location_t loc
, tree fndecl
, int n
, tree
*argarray
)
10823 tree fntype
= TREE_TYPE (fndecl
);
10824 tree fn
= build1 (ADDR_EXPR
, build_pointer_type (fntype
), fndecl
);
10826 return fold_build_call_array_loc (loc
, TREE_TYPE (fntype
), fn
, n
, argarray
);
10829 /* Conveniently construct a function call expression. FNDECL names the
10830 function to be called and the arguments are passed in the vector
10834 build_call_expr_loc_vec (location_t loc
, tree fndecl
, vec
<tree
, va_gc
> *vec
)
10836 return build_call_expr_loc_array (loc
, fndecl
, vec_safe_length (vec
),
10837 vec_safe_address (vec
));
10841 /* Conveniently construct a function call expression. FNDECL names the
10842 function to be called, N is the number of arguments, and the "..."
10843 parameters are the argument expressions. */
10846 build_call_expr_loc (location_t loc
, tree fndecl
, int n
, ...)
10849 tree
*argarray
= XALLOCAVEC (tree
, n
);
10853 for (i
= 0; i
< n
; i
++)
10854 argarray
[i
] = va_arg (ap
, tree
);
10856 return build_call_expr_loc_array (loc
, fndecl
, n
, argarray
);
10859 /* Like build_call_expr_loc (UNKNOWN_LOCATION, ...). Duplicated because
10860 varargs macros aren't supported by all bootstrap compilers. */
10863 build_call_expr (tree fndecl
, int n
, ...)
10866 tree
*argarray
= XALLOCAVEC (tree
, n
);
10870 for (i
= 0; i
< n
; i
++)
10871 argarray
[i
] = va_arg (ap
, tree
);
10873 return build_call_expr_loc_array (UNKNOWN_LOCATION
, fndecl
, n
, argarray
);
10876 /* Build an internal call to IFN, with arguments ARGS[0:N-1] and with return
10877 type TYPE. This is just like CALL_EXPR, except its CALL_EXPR_FN is NULL.
10878 It will get gimplified later into an ordinary internal function. */
10881 build_call_expr_internal_loc_array (location_t loc
, internal_fn ifn
,
10882 tree type
, int n
, const tree
*args
)
10884 tree t
= build_call_1 (type
, NULL_TREE
, n
);
10885 for (int i
= 0; i
< n
; ++i
)
10886 CALL_EXPR_ARG (t
, i
) = args
[i
];
10887 SET_EXPR_LOCATION (t
, loc
);
10888 CALL_EXPR_IFN (t
) = ifn
;
10889 process_call_operands (t
);
10893 /* Build internal call expression. This is just like CALL_EXPR, except
10894 its CALL_EXPR_FN is NULL. It will get gimplified later into ordinary
10895 internal function. */
10898 build_call_expr_internal_loc (location_t loc
, enum internal_fn ifn
,
10899 tree type
, int n
, ...)
10902 tree
*argarray
= XALLOCAVEC (tree
, n
);
10906 for (i
= 0; i
< n
; i
++)
10907 argarray
[i
] = va_arg (ap
, tree
);
10909 return build_call_expr_internal_loc_array (loc
, ifn
, type
, n
, argarray
);
10912 /* Return a function call to FN, if the target is guaranteed to support it,
10915 N is the number of arguments, passed in the "...", and TYPE is the
10916 type of the return value. */
10919 maybe_build_call_expr_loc (location_t loc
, combined_fn fn
, tree type
,
10923 tree
*argarray
= XALLOCAVEC (tree
, n
);
10927 for (i
= 0; i
< n
; i
++)
10928 argarray
[i
] = va_arg (ap
, tree
);
10930 if (internal_fn_p (fn
))
10932 internal_fn ifn
= as_internal_fn (fn
);
10933 if (direct_internal_fn_p (ifn
))
10935 tree_pair types
= direct_internal_fn_types (ifn
, type
, argarray
);
10936 if (!direct_internal_fn_supported_p (ifn
, types
,
10937 OPTIMIZE_FOR_BOTH
))
10940 return build_call_expr_internal_loc_array (loc
, ifn
, type
, n
, argarray
);
10944 tree fndecl
= builtin_decl_implicit (as_builtin_fn (fn
));
10947 return build_call_expr_loc_array (loc
, fndecl
, n
, argarray
);
10951 /* Return a function call to the appropriate builtin alloca variant.
10953 SIZE is the size to be allocated. ALIGN, if non-zero, is the requested
10954 alignment of the allocated area. MAX_SIZE, if non-negative, is an upper
10955 bound for SIZE in case it is not a fixed value. */
10958 build_alloca_call_expr (tree size
, unsigned int align
, HOST_WIDE_INT max_size
)
10962 tree t
= builtin_decl_explicit (BUILT_IN_ALLOCA_WITH_ALIGN_AND_MAX
);
10964 build_call_expr (t
, 3, size
, size_int (align
), size_int (max_size
));
10966 else if (align
> 0)
10968 tree t
= builtin_decl_explicit (BUILT_IN_ALLOCA_WITH_ALIGN
);
10969 return build_call_expr (t
, 2, size
, size_int (align
));
10973 tree t
= builtin_decl_explicit (BUILT_IN_ALLOCA
);
10974 return build_call_expr (t
, 1, size
);
10978 /* The built-in decl to use to mark code points believed to be unreachable.
10979 Typically __builtin_unreachable, but __builtin_trap if
10980 -fsanitize=unreachable -fsanitize-trap=unreachable. If only
10981 -fsanitize=unreachable, we rely on sanopt to replace calls with the
10982 appropriate ubsan function. When building a call directly, use
10983 {gimple_},build_builtin_unreachable instead. */
10986 builtin_decl_unreachable ()
10988 enum built_in_function fncode
= BUILT_IN_UNREACHABLE
;
10990 if (sanitize_flags_p (SANITIZE_UNREACHABLE
)
10991 ? (flag_sanitize_trap
& SANITIZE_UNREACHABLE
)
10992 : flag_unreachable_traps
)
10993 fncode
= BUILT_IN_UNREACHABLE_TRAP
;
10994 /* For non-trapping sanitize, we will rewrite __builtin_unreachable () later,
10995 in the sanopt pass. */
10997 return builtin_decl_explicit (fncode
);
11000 /* Build a call to __builtin_unreachable, possibly rewritten by
11001 -fsanitize=unreachable. Use this rather than the above when practical. */
11004 build_builtin_unreachable (location_t loc
)
11006 tree data
= NULL_TREE
;
11007 tree fn
= sanitize_unreachable_fn (&data
, loc
);
11008 return build_call_expr_loc (loc
, fn
, data
!= NULL_TREE
, data
);
11011 /* Create a new constant string literal of type ELTYPE[SIZE] (or LEN
11012 if SIZE == -1) and return a tree node representing char* pointer to
11013 it as an ADDR_EXPR (ARRAY_REF (ELTYPE, ...)). When STR is nonnull
11014 the STRING_CST value is the LEN bytes at STR (the representation
11015 of the string, which may be wide). Otherwise it's all zeros. */
11018 build_string_literal (unsigned len
, const char *str
/* = NULL */,
11019 tree eltype
/* = char_type_node */,
11020 unsigned HOST_WIDE_INT size
/* = -1 */)
11022 tree t
= build_string (len
, str
);
11023 /* Set the maximum valid index based on the string length or SIZE. */
11024 unsigned HOST_WIDE_INT maxidx
11025 = (size
== HOST_WIDE_INT_M1U
? len
: size
) - 1;
11027 tree index
= build_index_type (size_int (maxidx
));
11028 eltype
= build_type_variant (eltype
, 1, 0);
11029 tree type
= build_array_type (eltype
, index
);
11030 TREE_TYPE (t
) = type
;
11031 TREE_CONSTANT (t
) = 1;
11032 TREE_READONLY (t
) = 1;
11033 TREE_STATIC (t
) = 1;
11035 type
= build_pointer_type (eltype
);
11036 t
= build1 (ADDR_EXPR
, type
,
11037 build4 (ARRAY_REF
, eltype
,
11038 t
, integer_zero_node
, NULL_TREE
, NULL_TREE
));
11044 /* Return true if T (assumed to be a DECL) must be assigned a memory
11048 needs_to_live_in_memory (const_tree t
)
11050 return (TREE_ADDRESSABLE (t
)
11051 || is_global_var (t
)
11052 || (TREE_CODE (t
) == RESULT_DECL
11053 && !DECL_BY_REFERENCE (t
)
11054 && aggregate_value_p (t
, current_function_decl
)));
11057 /* Return value of a constant X and sign-extend it. */
11060 int_cst_value (const_tree x
)
11062 unsigned bits
= TYPE_PRECISION (TREE_TYPE (x
));
11063 unsigned HOST_WIDE_INT val
= TREE_INT_CST_LOW (x
);
11065 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
11066 gcc_assert (cst_and_fits_in_hwi (x
));
11068 if (bits
< HOST_BITS_PER_WIDE_INT
)
11070 bool negative
= ((val
>> (bits
- 1)) & 1) != 0;
11072 val
|= HOST_WIDE_INT_M1U
<< (bits
- 1) << 1;
11074 val
&= ~(HOST_WIDE_INT_M1U
<< (bits
- 1) << 1);
11080 /* If TYPE is an integral or pointer type, return an integer type with
11081 the same precision which is unsigned iff UNSIGNEDP is true, or itself
11082 if TYPE is already an integer type of signedness UNSIGNEDP.
11083 If TYPE is a floating-point type, return an integer type with the same
11084 bitsize and with the signedness given by UNSIGNEDP; this is useful
11085 when doing bit-level operations on a floating-point value. */
11088 signed_or_unsigned_type_for (int unsignedp
, tree type
)
11090 if (ANY_INTEGRAL_TYPE_P (type
) && TYPE_UNSIGNED (type
) == unsignedp
)
11093 if (TREE_CODE (type
) == VECTOR_TYPE
)
11095 tree inner
= TREE_TYPE (type
);
11096 tree inner2
= signed_or_unsigned_type_for (unsignedp
, inner
);
11099 if (inner
== inner2
)
11101 machine_mode new_mode
;
11102 if (VECTOR_MODE_P (TYPE_MODE (type
))
11103 && related_int_vector_mode (TYPE_MODE (type
)).exists (&new_mode
))
11104 return build_vector_type_for_mode (inner2
, new_mode
);
11105 return build_vector_type (inner2
, TYPE_VECTOR_SUBPARTS (type
));
11108 if (TREE_CODE (type
) == COMPLEX_TYPE
)
11110 tree inner
= TREE_TYPE (type
);
11111 tree inner2
= signed_or_unsigned_type_for (unsignedp
, inner
);
11114 if (inner
== inner2
)
11116 return build_complex_type (inner2
);
11120 if (INTEGRAL_TYPE_P (type
)
11121 || POINTER_TYPE_P (type
)
11122 || TREE_CODE (type
) == OFFSET_TYPE
)
11123 bits
= TYPE_PRECISION (type
);
11124 else if (TREE_CODE (type
) == REAL_TYPE
)
11125 bits
= GET_MODE_BITSIZE (SCALAR_TYPE_MODE (type
));
11129 if (TREE_CODE (type
) == BITINT_TYPE
&& (unsignedp
|| bits
> 1))
11130 return build_bitint_type (bits
, unsignedp
);
11131 return build_nonstandard_integer_type (bits
, unsignedp
);
11134 /* If TYPE is an integral or pointer type, return an integer type with
11135 the same precision which is unsigned, or itself if TYPE is already an
11136 unsigned integer type. If TYPE is a floating-point type, return an
11137 unsigned integer type with the same bitsize as TYPE. */
11140 unsigned_type_for (tree type
)
11142 return signed_or_unsigned_type_for (1, type
);
11145 /* If TYPE is an integral or pointer type, return an integer type with
11146 the same precision which is signed, or itself if TYPE is already a
11147 signed integer type. If TYPE is a floating-point type, return a
11148 signed integer type with the same bitsize as TYPE. */
11151 signed_type_for (tree type
)
11153 return signed_or_unsigned_type_for (0, type
);
11156 /* - For VECTOR_TYPEs:
11157 - The truth type must be a VECTOR_BOOLEAN_TYPE.
11158 - The number of elements must match (known_eq).
11159 - targetm.vectorize.get_mask_mode exists, and exactly
11160 the same mode as the truth type.
11161 - Otherwise, the truth type must be a BOOLEAN_TYPE
11162 or useless_type_conversion_p to BOOLEAN_TYPE. */
11164 is_truth_type_for (tree type
, tree truth_type
)
11166 machine_mode mask_mode
= TYPE_MODE (truth_type
);
11167 machine_mode vmode
= TYPE_MODE (type
);
11168 machine_mode tmask_mode
;
11170 if (TREE_CODE (type
) == VECTOR_TYPE
)
11172 if (VECTOR_BOOLEAN_TYPE_P (truth_type
)
11173 && known_eq (TYPE_VECTOR_SUBPARTS (type
),
11174 TYPE_VECTOR_SUBPARTS (truth_type
))
11175 && targetm
.vectorize
.get_mask_mode (vmode
).exists (&tmask_mode
)
11176 && tmask_mode
== mask_mode
)
11182 return useless_type_conversion_p (boolean_type_node
, truth_type
);
11185 /* If TYPE is a vector type, return a signed integer vector type with the
11186 same width and number of subparts. Otherwise return boolean_type_node. */
11189 truth_type_for (tree type
)
11191 if (TREE_CODE (type
) == VECTOR_TYPE
)
11193 if (VECTOR_BOOLEAN_TYPE_P (type
))
11195 return build_truth_vector_type_for (type
);
11198 return boolean_type_node
;
11201 /* Returns the largest value obtainable by casting something in INNER type to
11205 upper_bound_in_type (tree outer
, tree inner
)
11207 unsigned int det
= 0;
11208 unsigned oprec
= TYPE_PRECISION (outer
);
11209 unsigned iprec
= TYPE_PRECISION (inner
);
11212 /* Compute a unique number for every combination. */
11213 det
|= (oprec
> iprec
) ? 4 : 0;
11214 det
|= TYPE_UNSIGNED (outer
) ? 2 : 0;
11215 det
|= TYPE_UNSIGNED (inner
) ? 1 : 0;
11217 /* Determine the exponent to use. */
11222 /* oprec <= iprec, outer: signed, inner: don't care. */
11227 /* oprec <= iprec, outer: unsigned, inner: don't care. */
11231 /* oprec > iprec, outer: signed, inner: signed. */
11235 /* oprec > iprec, outer: signed, inner: unsigned. */
11239 /* oprec > iprec, outer: unsigned, inner: signed. */
11243 /* oprec > iprec, outer: unsigned, inner: unsigned. */
11247 gcc_unreachable ();
11250 return wide_int_to_tree (outer
,
11251 wi::mask (prec
, false, TYPE_PRECISION (outer
)));
11254 /* Returns the smallest value obtainable by casting something in INNER type to
11258 lower_bound_in_type (tree outer
, tree inner
)
11260 unsigned oprec
= TYPE_PRECISION (outer
);
11261 unsigned iprec
= TYPE_PRECISION (inner
);
11263 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
11265 if (TYPE_UNSIGNED (outer
)
11266 /* If we are widening something of an unsigned type, OUTER type
11267 contains all values of INNER type. In particular, both INNER
11268 and OUTER types have zero in common. */
11269 || (oprec
> iprec
&& TYPE_UNSIGNED (inner
)))
11270 return build_int_cst (outer
, 0);
11273 /* If we are widening a signed type to another signed type, we
11274 want to obtain -2^^(iprec-1). If we are keeping the
11275 precision or narrowing to a signed type, we want to obtain
11277 unsigned prec
= oprec
> iprec
? iprec
: oprec
;
11278 return wide_int_to_tree (outer
,
11279 wi::mask (prec
- 1, true,
11280 TYPE_PRECISION (outer
)));
11284 /* Return true if two operands that are suitable for PHI nodes are
11285 necessarily equal. Specifically, both ARG0 and ARG1 must be either
11286 SSA_NAME or invariant. Note that this is strictly an optimization.
11287 That is, callers of this function can directly call operand_equal_p
11288 and get the same result, only slower. */
11291 operand_equal_for_phi_arg_p (const_tree arg0
, const_tree arg1
)
11295 if (TREE_CODE (arg0
) == SSA_NAME
|| TREE_CODE (arg1
) == SSA_NAME
)
11297 return operand_equal_p (arg0
, arg1
, 0);
11300 /* Returns number of zeros at the end of binary representation of X. */
11303 num_ending_zeros (const_tree x
)
11305 return build_int_cst (TREE_TYPE (x
), wi::ctz (wi::to_wide (x
)));
11309 #define WALK_SUBTREE(NODE) \
11312 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
11318 /* This is a subroutine of walk_tree that walks field of TYPE that are to
11319 be walked whenever a type is seen in the tree. Rest of operands and return
11320 value are as for walk_tree. */
11323 walk_type_fields (tree type
, walk_tree_fn func
, void *data
,
11324 hash_set
<tree
> *pset
, walk_tree_lh lh
)
11326 tree result
= NULL_TREE
;
11328 switch (TREE_CODE (type
))
11331 case REFERENCE_TYPE
:
11333 /* We have to worry about mutually recursive pointers. These can't
11334 be written in C. They can in Ada. It's pathological, but
11335 there's an ACATS test (c38102a) that checks it. Deal with this
11336 by checking if we're pointing to another pointer, that one
11337 points to another pointer, that one does too, and we have no htab.
11338 If so, get a hash table. We check three levels deep to avoid
11339 the cost of the hash table if we don't need one. */
11340 if (POINTER_TYPE_P (TREE_TYPE (type
))
11341 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type
)))
11342 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type
))))
11345 result
= walk_tree_without_duplicates (&TREE_TYPE (type
),
11356 WALK_SUBTREE (TREE_TYPE (type
));
11360 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type
));
11362 /* Fall through. */
11364 case FUNCTION_TYPE
:
11365 WALK_SUBTREE (TREE_TYPE (type
));
11369 /* We never want to walk into default arguments. */
11370 for (arg
= TYPE_ARG_TYPES (type
); arg
; arg
= TREE_CHAIN (arg
))
11371 WALK_SUBTREE (TREE_VALUE (arg
));
11376 /* Don't follow this nodes's type if a pointer for fear that
11377 we'll have infinite recursion. If we have a PSET, then we
11380 || (!POINTER_TYPE_P (TREE_TYPE (type
))
11381 && TREE_CODE (TREE_TYPE (type
)) != OFFSET_TYPE
))
11382 WALK_SUBTREE (TREE_TYPE (type
));
11383 WALK_SUBTREE (TYPE_DOMAIN (type
));
11387 WALK_SUBTREE (TREE_TYPE (type
));
11388 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type
));
11398 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
11399 called with the DATA and the address of each sub-tree. If FUNC returns a
11400 non-NULL value, the traversal is stopped, and the value returned by FUNC
11401 is returned. If PSET is non-NULL it is used to record the nodes visited,
11402 and to avoid visiting a node more than once. */
11405 walk_tree_1 (tree
*tp
, walk_tree_fn func
, void *data
,
11406 hash_set
<tree
> *pset
, walk_tree_lh lh
)
11408 #define WALK_SUBTREE_TAIL(NODE) \
11412 goto tail_recurse; \
11417 /* Skip empty subtrees. */
11421 /* Don't walk the same tree twice, if the user has requested
11422 that we avoid doing so. */
11423 if (pset
&& pset
->add (*tp
))
11426 /* Call the function. */
11427 int walk_subtrees
= 1;
11428 tree result
= (*func
) (tp
, &walk_subtrees
, data
);
11430 /* If we found something, return it. */
11435 tree_code code
= TREE_CODE (t
);
11437 /* Even if we didn't, FUNC may have decided that there was nothing
11438 interesting below this point in the tree. */
11439 if (!walk_subtrees
)
11441 /* But we still need to check our siblings. */
11442 if (code
== TREE_LIST
)
11443 WALK_SUBTREE_TAIL (TREE_CHAIN (t
));
11444 else if (code
== OMP_CLAUSE
)
11445 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (t
));
11452 result
= (*lh
) (tp
, &walk_subtrees
, func
, data
, pset
);
11453 if (result
|| !walk_subtrees
)
11460 case IDENTIFIER_NODE
:
11466 case PLACEHOLDER_EXPR
:
11470 /* None of these have subtrees other than those already walked
11475 WALK_SUBTREE (TREE_VALUE (t
));
11476 WALK_SUBTREE_TAIL (TREE_CHAIN (t
));
11480 int len
= TREE_VEC_LENGTH (t
);
11485 /* Walk all elements but the last. */
11486 for (int i
= 0; i
< len
- 1; ++i
)
11487 WALK_SUBTREE (TREE_VEC_ELT (t
, i
));
11489 /* Now walk the last one as a tail call. */
11490 WALK_SUBTREE_TAIL (TREE_VEC_ELT (t
, len
- 1));
11495 unsigned len
= vector_cst_encoded_nelts (t
);
11498 /* Walk all elements but the last. */
11499 for (unsigned i
= 0; i
< len
- 1; ++i
)
11500 WALK_SUBTREE (VECTOR_CST_ENCODED_ELT (t
, i
));
11501 /* Now walk the last one as a tail call. */
11502 WALK_SUBTREE_TAIL (VECTOR_CST_ENCODED_ELT (t
, len
- 1));
11506 WALK_SUBTREE (TREE_REALPART (t
));
11507 WALK_SUBTREE_TAIL (TREE_IMAGPART (t
));
11511 unsigned HOST_WIDE_INT idx
;
11512 constructor_elt
*ce
;
11514 for (idx
= 0; vec_safe_iterate (CONSTRUCTOR_ELTS (t
), idx
, &ce
);
11516 WALK_SUBTREE (ce
->value
);
11521 WALK_SUBTREE_TAIL (TREE_OPERAND (t
, 0));
11526 for (decl
= BIND_EXPR_VARS (t
); decl
; decl
= DECL_CHAIN (decl
))
11528 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
11529 into declarations that are just mentioned, rather than
11530 declared; they don't really belong to this part of the tree.
11531 And, we can see cycles: the initializer for a declaration
11532 can refer to the declaration itself. */
11533 WALK_SUBTREE (DECL_INITIAL (decl
));
11534 WALK_SUBTREE (DECL_SIZE (decl
));
11535 WALK_SUBTREE (DECL_SIZE_UNIT (decl
));
11537 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (t
));
11540 case STATEMENT_LIST
:
11542 tree_stmt_iterator i
;
11543 for (i
= tsi_start (t
); !tsi_end_p (i
); tsi_next (&i
))
11544 WALK_SUBTREE (*tsi_stmt_ptr (i
));
11550 int len
= omp_clause_num_ops
[OMP_CLAUSE_CODE (t
)];
11551 for (int i
= 0; i
< len
; i
++)
11552 WALK_SUBTREE (OMP_CLAUSE_OPERAND (t
, i
));
11553 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (t
));
11560 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
11561 But, we only want to walk once. */
11562 len
= (TREE_OPERAND (t
, 3) == TREE_OPERAND (t
, 1)) ? 2 : 3;
11563 for (i
= 0; i
< len
; ++i
)
11564 WALK_SUBTREE (TREE_OPERAND (t
, i
));
11565 WALK_SUBTREE_TAIL (TREE_OPERAND (t
, len
));
11569 /* If this is a TYPE_DECL, walk into the fields of the type that it's
11570 defining. We only want to walk into these fields of a type in this
11571 case and not in the general case of a mere reference to the type.
11573 The criterion is as follows: if the field can be an expression, it
11574 must be walked only here. This should be in keeping with the fields
11575 that are directly gimplified in gimplify_type_sizes in order for the
11576 mark/copy-if-shared/unmark machinery of the gimplifier to work with
11577 variable-sized types.
11579 Note that DECLs get walked as part of processing the BIND_EXPR. */
11580 if (TREE_CODE (DECL_EXPR_DECL (t
)) == TYPE_DECL
)
11582 /* Call the function for the decl so e.g. copy_tree_body_r can
11583 replace it with the remapped one. */
11584 result
= (*func
) (&DECL_EXPR_DECL (t
), &walk_subtrees
, data
);
11585 if (result
|| !walk_subtrees
)
11588 tree
*type_p
= &TREE_TYPE (DECL_EXPR_DECL (t
));
11589 if (TREE_CODE (*type_p
) == ERROR_MARK
)
11592 /* Call the function for the type. See if it returns anything or
11593 doesn't want us to continue. If we are to continue, walk both
11594 the normal fields and those for the declaration case. */
11595 result
= (*func
) (type_p
, &walk_subtrees
, data
);
11596 if (result
|| !walk_subtrees
)
11599 tree type
= *type_p
;
11601 /* But do not walk a pointed-to type since it may itself need to
11602 be walked in the declaration case if it isn't anonymous. */
11603 if (!POINTER_TYPE_P (type
))
11605 result
= walk_type_fields (type
, func
, data
, pset
, lh
);
11610 /* If this is a record type, also walk the fields. */
11611 if (RECORD_OR_UNION_TYPE_P (type
))
11615 for (field
= TYPE_FIELDS (type
); field
;
11616 field
= DECL_CHAIN (field
))
11618 /* We'd like to look at the type of the field, but we can
11619 easily get infinite recursion. So assume it's pointed
11620 to elsewhere in the tree. Also, ignore things that
11622 if (TREE_CODE (field
) != FIELD_DECL
)
11625 WALK_SUBTREE (DECL_FIELD_OFFSET (field
));
11626 WALK_SUBTREE (DECL_SIZE (field
));
11627 WALK_SUBTREE (DECL_SIZE_UNIT (field
));
11628 if (TREE_CODE (type
) == QUAL_UNION_TYPE
)
11629 WALK_SUBTREE (DECL_QUALIFIER (field
));
11633 /* Same for scalar types. */
11634 else if (TREE_CODE (type
) == BOOLEAN_TYPE
11635 || TREE_CODE (type
) == ENUMERAL_TYPE
11636 || TREE_CODE (type
) == INTEGER_TYPE
11637 || TREE_CODE (type
) == FIXED_POINT_TYPE
11638 || TREE_CODE (type
) == REAL_TYPE
)
11640 WALK_SUBTREE (TYPE_MIN_VALUE (type
));
11641 WALK_SUBTREE (TYPE_MAX_VALUE (type
));
11644 WALK_SUBTREE (TYPE_SIZE (type
));
11645 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (type
));
11650 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code
)))
11654 /* Walk over all the sub-trees of this operand. */
11655 len
= TREE_OPERAND_LENGTH (t
);
11657 /* Go through the subtrees. We need to do this in forward order so
11658 that the scope of a FOR_EXPR is handled properly. */
11661 for (i
= 0; i
< len
- 1; ++i
)
11662 WALK_SUBTREE (TREE_OPERAND (t
, i
));
11663 WALK_SUBTREE_TAIL (TREE_OPERAND (t
, len
- 1));
11666 /* If this is a type, walk the needed fields in the type. */
11667 else if (TYPE_P (t
))
11668 return walk_type_fields (t
, func
, data
, pset
, lh
);
11672 /* We didn't find what we were looking for. */
11675 #undef WALK_SUBTREE_TAIL
11677 #undef WALK_SUBTREE
11679 /* Like walk_tree, but does not walk duplicate nodes more than once. */
11682 walk_tree_without_duplicates_1 (tree
*tp
, walk_tree_fn func
, void *data
,
11687 hash_set
<tree
> pset
;
11688 result
= walk_tree_1 (tp
, func
, data
, &pset
, lh
);
11694 tree_block (tree t
)
11696 const enum tree_code_class c
= TREE_CODE_CLASS (TREE_CODE (t
));
11698 if (IS_EXPR_CODE_CLASS (c
))
11699 return LOCATION_BLOCK (t
->exp
.locus
);
11700 gcc_unreachable ();
11705 tree_set_block (tree t
, tree b
)
11707 const enum tree_code_class c
= TREE_CODE_CLASS (TREE_CODE (t
));
11709 if (IS_EXPR_CODE_CLASS (c
))
11711 t
->exp
.locus
= set_block (t
->exp
.locus
, b
);
11714 gcc_unreachable ();
11717 /* Create a nameless artificial label and put it in the current
11718 function context. The label has a location of LOC. Returns the
11719 newly created label. */
11722 create_artificial_label (location_t loc
)
11724 tree lab
= build_decl (loc
,
11725 LABEL_DECL
, NULL_TREE
, void_type_node
);
11727 DECL_ARTIFICIAL (lab
) = 1;
11728 DECL_IGNORED_P (lab
) = 1;
11729 DECL_CONTEXT (lab
) = current_function_decl
;
11733 /* Given a tree, try to return a useful variable name that we can use
11734 to prefix a temporary that is being assigned the value of the tree.
11735 I.E. given <temp> = &A, return A. */
11740 tree stripped_decl
;
11743 STRIP_NOPS (stripped_decl
);
11744 if (DECL_P (stripped_decl
) && DECL_NAME (stripped_decl
))
11745 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl
));
11746 else if (TREE_CODE (stripped_decl
) == SSA_NAME
)
11748 tree name
= SSA_NAME_IDENTIFIER (stripped_decl
);
11751 return IDENTIFIER_POINTER (name
);
11755 switch (TREE_CODE (stripped_decl
))
11758 return get_name (TREE_OPERAND (stripped_decl
, 0));
11765 /* Return true if TYPE has a variable argument list. */
11768 stdarg_p (const_tree fntype
)
11770 function_args_iterator args_iter
;
11771 tree n
= NULL_TREE
, t
;
11776 if (TYPE_NO_NAMED_ARGS_STDARG_P (fntype
))
11779 FOREACH_FUNCTION_ARGS (fntype
, t
, args_iter
)
11784 return n
!= NULL_TREE
&& n
!= void_type_node
;
11787 /* Return true if TYPE has a prototype. */
11790 prototype_p (const_tree fntype
)
11794 gcc_assert (fntype
!= NULL_TREE
);
11796 if (TYPE_NO_NAMED_ARGS_STDARG_P (fntype
))
11799 t
= TYPE_ARG_TYPES (fntype
);
11800 return (t
!= NULL_TREE
);
11803 /* If BLOCK is inlined from an __attribute__((__artificial__))
11804 routine, return pointer to location from where it has been
11807 block_nonartificial_location (tree block
)
11809 location_t
*ret
= NULL
;
11811 while (block
&& TREE_CODE (block
) == BLOCK
11812 && BLOCK_ABSTRACT_ORIGIN (block
))
11814 tree ao
= BLOCK_ABSTRACT_ORIGIN (block
);
11815 if (TREE_CODE (ao
) == FUNCTION_DECL
)
11817 /* If AO is an artificial inline, point RET to the
11818 call site locus at which it has been inlined and continue
11819 the loop, in case AO's caller is also an artificial
11821 if (DECL_DECLARED_INLINE_P (ao
)
11822 && lookup_attribute ("artificial", DECL_ATTRIBUTES (ao
)))
11823 ret
= &BLOCK_SOURCE_LOCATION (block
);
11827 else if (TREE_CODE (ao
) != BLOCK
)
11830 block
= BLOCK_SUPERCONTEXT (block
);
11836 /* If EXP is inlined from an __attribute__((__artificial__))
11837 function, return the location of the original call expression. */
11840 tree_nonartificial_location (tree exp
)
11842 location_t
*loc
= block_nonartificial_location (TREE_BLOCK (exp
));
11847 return EXPR_LOCATION (exp
);
11850 /* Return the location into which EXP has been inlined. Analogous
11851 to tree_nonartificial_location() above but not limited to artificial
11852 functions declared inline. If SYSTEM_HEADER is true, return
11853 the macro expansion point of the location if it's in a system header */
11856 tree_inlined_location (tree exp
, bool system_header
/* = true */)
11858 location_t loc
= UNKNOWN_LOCATION
;
11860 tree block
= TREE_BLOCK (exp
);
11862 while (block
&& TREE_CODE (block
) == BLOCK
11863 && BLOCK_ABSTRACT_ORIGIN (block
))
11865 tree ao
= BLOCK_ABSTRACT_ORIGIN (block
);
11866 if (TREE_CODE (ao
) == FUNCTION_DECL
)
11867 loc
= BLOCK_SOURCE_LOCATION (block
);
11868 else if (TREE_CODE (ao
) != BLOCK
)
11871 block
= BLOCK_SUPERCONTEXT (block
);
11874 if (loc
== UNKNOWN_LOCATION
)
11876 loc
= EXPR_LOCATION (exp
);
11878 /* Only consider macro expansion when the block traversal failed
11879 to find a location. Otherwise it's not relevant. */
11880 return expansion_point_location_if_in_system_header (loc
);
11886 /* These are the hash table functions for the hash table of OPTIMIZATION_NODE
11889 /* Return the hash code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
11892 cl_option_hasher::hash (tree x
)
11894 const_tree
const t
= x
;
11896 if (TREE_CODE (t
) == OPTIMIZATION_NODE
)
11897 return cl_optimization_hash (TREE_OPTIMIZATION (t
));
11898 else if (TREE_CODE (t
) == TARGET_OPTION_NODE
)
11899 return cl_target_option_hash (TREE_TARGET_OPTION (t
));
11901 gcc_unreachable ();
11904 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
11905 TARGET_OPTION tree node) is the same as that given by *Y, which is the
11909 cl_option_hasher::equal (tree x
, tree y
)
11911 const_tree
const xt
= x
;
11912 const_tree
const yt
= y
;
11914 if (TREE_CODE (xt
) != TREE_CODE (yt
))
11917 if (TREE_CODE (xt
) == OPTIMIZATION_NODE
)
11918 return cl_optimization_option_eq (TREE_OPTIMIZATION (xt
),
11919 TREE_OPTIMIZATION (yt
));
11920 else if (TREE_CODE (xt
) == TARGET_OPTION_NODE
)
11921 return cl_target_option_eq (TREE_TARGET_OPTION (xt
),
11922 TREE_TARGET_OPTION (yt
));
11924 gcc_unreachable ();
11927 /* Build an OPTIMIZATION_NODE based on the options in OPTS and OPTS_SET. */
11930 build_optimization_node (struct gcc_options
*opts
,
11931 struct gcc_options
*opts_set
)
11935 /* Use the cache of optimization nodes. */
11937 cl_optimization_save (TREE_OPTIMIZATION (cl_optimization_node
),
11940 tree
*slot
= cl_option_hash_table
->find_slot (cl_optimization_node
, INSERT
);
11944 /* Insert this one into the hash table. */
11945 t
= cl_optimization_node
;
11948 /* Make a new node for next time round. */
11949 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
11955 /* Build a TARGET_OPTION_NODE based on the options in OPTS and OPTS_SET. */
11958 build_target_option_node (struct gcc_options
*opts
,
11959 struct gcc_options
*opts_set
)
11963 /* Use the cache of optimization nodes. */
11965 cl_target_option_save (TREE_TARGET_OPTION (cl_target_option_node
),
11968 tree
*slot
= cl_option_hash_table
->find_slot (cl_target_option_node
, INSERT
);
11972 /* Insert this one into the hash table. */
11973 t
= cl_target_option_node
;
11976 /* Make a new node for next time round. */
11977 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
11983 /* Clear TREE_TARGET_GLOBALS of all TARGET_OPTION_NODE trees,
11984 so that they aren't saved during PCH writing. */
11987 prepare_target_option_nodes_for_pch (void)
11989 hash_table
<cl_option_hasher
>::iterator iter
= cl_option_hash_table
->begin ();
11990 for (; iter
!= cl_option_hash_table
->end (); ++iter
)
11991 if (TREE_CODE (*iter
) == TARGET_OPTION_NODE
)
11992 TREE_TARGET_GLOBALS (*iter
) = NULL
;
11995 /* Determine the "ultimate origin" of a block. */
11998 block_ultimate_origin (const_tree block
)
12000 tree origin
= BLOCK_ABSTRACT_ORIGIN (block
);
12002 if (origin
== NULL_TREE
)
12006 gcc_checking_assert ((DECL_P (origin
)
12007 && DECL_ORIGIN (origin
) == origin
)
12008 || BLOCK_ORIGIN (origin
) == origin
);
12013 /* Return true iff conversion from INNER_TYPE to OUTER_TYPE generates
12017 tree_nop_conversion_p (const_tree outer_type
, const_tree inner_type
)
12019 /* Do not strip casts into or out of differing address spaces. */
12020 if (POINTER_TYPE_P (outer_type
)
12021 && TYPE_ADDR_SPACE (TREE_TYPE (outer_type
)) != ADDR_SPACE_GENERIC
)
12023 if (!POINTER_TYPE_P (inner_type
)
12024 || (TYPE_ADDR_SPACE (TREE_TYPE (outer_type
))
12025 != TYPE_ADDR_SPACE (TREE_TYPE (inner_type
))))
12028 else if (POINTER_TYPE_P (inner_type
)
12029 && TYPE_ADDR_SPACE (TREE_TYPE (inner_type
)) != ADDR_SPACE_GENERIC
)
12031 /* We already know that outer_type is not a pointer with
12032 a non-generic address space. */
12036 /* Use precision rather then machine mode when we can, which gives
12037 the correct answer even for submode (bit-field) types. */
12038 if ((INTEGRAL_TYPE_P (outer_type
)
12039 || POINTER_TYPE_P (outer_type
)
12040 || TREE_CODE (outer_type
) == OFFSET_TYPE
)
12041 && (INTEGRAL_TYPE_P (inner_type
)
12042 || POINTER_TYPE_P (inner_type
)
12043 || TREE_CODE (inner_type
) == OFFSET_TYPE
))
12044 return TYPE_PRECISION (outer_type
) == TYPE_PRECISION (inner_type
);
12046 /* Otherwise fall back on comparing machine modes (e.g. for
12047 aggregate types, floats). */
12048 return TYPE_MODE (outer_type
) == TYPE_MODE (inner_type
);
12051 /* Return true iff conversion in EXP generates no instruction. Mark
12052 it inline so that we fully inline into the stripping functions even
12053 though we have two uses of this function. */
12056 tree_nop_conversion (const_tree exp
)
12058 tree outer_type
, inner_type
;
12060 if (location_wrapper_p (exp
))
12062 if (!CONVERT_EXPR_P (exp
)
12063 && TREE_CODE (exp
) != NON_LVALUE_EXPR
)
12066 outer_type
= TREE_TYPE (exp
);
12067 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
12068 if (!inner_type
|| inner_type
== error_mark_node
)
12071 return tree_nop_conversion_p (outer_type
, inner_type
);
12074 /* Return true iff conversion in EXP generates no instruction. Don't
12075 consider conversions changing the signedness. */
12078 tree_sign_nop_conversion (const_tree exp
)
12080 tree outer_type
, inner_type
;
12082 if (!tree_nop_conversion (exp
))
12085 outer_type
= TREE_TYPE (exp
);
12086 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
12088 return (TYPE_UNSIGNED (outer_type
) == TYPE_UNSIGNED (inner_type
)
12089 && POINTER_TYPE_P (outer_type
) == POINTER_TYPE_P (inner_type
));
12092 /* Strip conversions from EXP according to tree_nop_conversion and
12093 return the resulting expression. */
12096 tree_strip_nop_conversions (tree exp
)
12098 while (tree_nop_conversion (exp
))
12099 exp
= TREE_OPERAND (exp
, 0);
12103 /* Strip conversions from EXP according to tree_sign_nop_conversion
12104 and return the resulting expression. */
12107 tree_strip_sign_nop_conversions (tree exp
)
12109 while (tree_sign_nop_conversion (exp
))
12110 exp
= TREE_OPERAND (exp
, 0);
12114 /* Avoid any floating point extensions from EXP. */
12116 strip_float_extensions (tree exp
)
12118 tree sub
, expt
, subt
;
12120 /* For floating point constant look up the narrowest type that can hold
12121 it properly and handle it like (type)(narrowest_type)constant.
12122 This way we can optimize for instance a=a*2.0 where "a" is float
12123 but 2.0 is double constant. */
12124 if (TREE_CODE (exp
) == REAL_CST
&& !DECIMAL_FLOAT_TYPE_P (TREE_TYPE (exp
)))
12126 REAL_VALUE_TYPE orig
;
12129 orig
= TREE_REAL_CST (exp
);
12130 if (TYPE_PRECISION (TREE_TYPE (exp
)) > TYPE_PRECISION (float_type_node
)
12131 && exact_real_truncate (TYPE_MODE (float_type_node
), &orig
))
12132 type
= float_type_node
;
12133 else if (TYPE_PRECISION (TREE_TYPE (exp
))
12134 > TYPE_PRECISION (double_type_node
)
12135 && exact_real_truncate (TYPE_MODE (double_type_node
), &orig
))
12136 type
= double_type_node
;
12138 return build_real_truncate (type
, orig
);
12141 if (!CONVERT_EXPR_P (exp
))
12144 sub
= TREE_OPERAND (exp
, 0);
12145 subt
= TREE_TYPE (sub
);
12146 expt
= TREE_TYPE (exp
);
12148 if (!FLOAT_TYPE_P (subt
))
12151 if (DECIMAL_FLOAT_TYPE_P (expt
) != DECIMAL_FLOAT_TYPE_P (subt
))
12154 if (element_precision (subt
) > element_precision (expt
))
12157 return strip_float_extensions (sub
);
12160 /* Strip out all handled components that produce invariant
12164 strip_invariant_refs (const_tree op
)
12166 while (handled_component_p (op
))
12168 switch (TREE_CODE (op
))
12171 case ARRAY_RANGE_REF
:
12172 if (!is_gimple_constant (TREE_OPERAND (op
, 1))
12173 || TREE_OPERAND (op
, 2) != NULL_TREE
12174 || TREE_OPERAND (op
, 3) != NULL_TREE
)
12178 case COMPONENT_REF
:
12179 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
12185 op
= TREE_OPERAND (op
, 0);
12191 /* Strip handled components with zero offset from OP. */
12194 strip_zero_offset_components (tree op
)
12196 while (TREE_CODE (op
) == COMPONENT_REF
12197 && integer_zerop (DECL_FIELD_OFFSET (TREE_OPERAND (op
, 1)))
12198 && integer_zerop (DECL_FIELD_BIT_OFFSET (TREE_OPERAND (op
, 1))))
12199 op
= TREE_OPERAND (op
, 0);
12203 static GTY(()) tree gcc_eh_personality_decl
;
12205 /* Return the GCC personality function decl. */
12208 lhd_gcc_personality (void)
12210 if (!gcc_eh_personality_decl
)
12211 gcc_eh_personality_decl
= build_personality_function ("gcc");
12212 return gcc_eh_personality_decl
;
12215 /* TARGET is a call target of GIMPLE call statement
12216 (obtained by gimple_call_fn). Return true if it is
12217 OBJ_TYPE_REF representing an virtual call of C++ method.
12218 (As opposed to OBJ_TYPE_REF representing objc calls
12219 through a cast where middle-end devirtualization machinery
12220 can't apply.) FOR_DUMP_P is true when being called from
12221 the dump routines. */
12224 virtual_method_call_p (const_tree target
, bool for_dump_p
)
12226 if (TREE_CODE (target
) != OBJ_TYPE_REF
)
12228 tree t
= TREE_TYPE (target
);
12229 gcc_checking_assert (TREE_CODE (t
) == POINTER_TYPE
);
12231 if (TREE_CODE (t
) == FUNCTION_TYPE
)
12233 gcc_checking_assert (TREE_CODE (t
) == METHOD_TYPE
);
12234 /* If we do not have BINFO associated, it means that type was built
12235 without devirtualization enabled. Do not consider this a virtual
12237 if (!TYPE_BINFO (obj_type_ref_class (target
, for_dump_p
)))
12242 /* Lookup sub-BINFO of BINFO of TYPE at offset POS. */
12245 lookup_binfo_at_offset (tree binfo
, tree type
, HOST_WIDE_INT pos
)
12248 tree base_binfo
, b
;
12250 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
12251 if (pos
== tree_to_shwi (BINFO_OFFSET (base_binfo
))
12252 && types_same_for_odr (TREE_TYPE (base_binfo
), type
))
12254 else if ((b
= lookup_binfo_at_offset (base_binfo
, type
, pos
)) != NULL
)
12259 /* Try to find a base info of BINFO that would have its field decl at offset
12260 OFFSET within the BINFO type and which is of EXPECTED_TYPE. If it can be
12261 found, return, otherwise return NULL_TREE. */
12264 get_binfo_at_offset (tree binfo
, poly_int64 offset
, tree expected_type
)
12266 tree type
= BINFO_TYPE (binfo
);
12270 HOST_WIDE_INT pos
, size
;
12274 if (types_same_for_odr (type
, expected_type
))
12276 if (maybe_lt (offset
, 0))
12279 for (fld
= TYPE_FIELDS (type
); fld
; fld
= DECL_CHAIN (fld
))
12281 if (TREE_CODE (fld
) != FIELD_DECL
|| !DECL_ARTIFICIAL (fld
))
12284 pos
= int_bit_position (fld
);
12285 size
= tree_to_uhwi (DECL_SIZE (fld
));
12286 if (known_in_range_p (offset
, pos
, size
))
12289 if (!fld
|| TREE_CODE (TREE_TYPE (fld
)) != RECORD_TYPE
)
12292 /* Offset 0 indicates the primary base, whose vtable contents are
12293 represented in the binfo for the derived class. */
12294 else if (maybe_ne (offset
, 0))
12296 tree found_binfo
= NULL
, base_binfo
;
12297 /* Offsets in BINFO are in bytes relative to the whole structure
12298 while POS is in bits relative to the containing field. */
12299 int binfo_offset
= (tree_to_shwi (BINFO_OFFSET (binfo
)) + pos
12302 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
12303 if (tree_to_shwi (BINFO_OFFSET (base_binfo
)) == binfo_offset
12304 && types_same_for_odr (TREE_TYPE (base_binfo
), TREE_TYPE (fld
)))
12306 found_binfo
= base_binfo
;
12310 binfo
= found_binfo
;
12312 binfo
= lookup_binfo_at_offset (binfo
, TREE_TYPE (fld
),
12316 type
= TREE_TYPE (fld
);
12321 /* PR 84195: Replace control characters in "unescaped" with their
12322 escaped equivalents. Allow newlines if -fmessage-length has
12323 been set to a non-zero value. This is done here, rather than
12324 where the attribute is recorded as the message length can
12325 change between these two locations. */
12328 escaped_string::escape (const char *unescaped
)
12331 size_t i
, new_i
, len
;
12336 m_str
= const_cast<char *> (unescaped
);
12339 if (unescaped
== NULL
|| *unescaped
== 0)
12342 len
= strlen (unescaped
);
12346 for (i
= 0; i
< len
; i
++)
12348 char c
= unescaped
[i
];
12353 escaped
[new_i
++] = c
;
12357 if (c
!= '\n' || !pp_is_wrapping_line (global_dc
->printer
))
12359 if (escaped
== NULL
)
12361 /* We only allocate space for a new string if we
12362 actually encounter a control character that
12363 needs replacing. */
12364 escaped
= (char *) xmalloc (len
* 2 + 1);
12365 strncpy (escaped
, unescaped
, i
);
12369 escaped
[new_i
++] = '\\';
12373 case '\a': escaped
[new_i
++] = 'a'; break;
12374 case '\b': escaped
[new_i
++] = 'b'; break;
12375 case '\f': escaped
[new_i
++] = 'f'; break;
12376 case '\n': escaped
[new_i
++] = 'n'; break;
12377 case '\r': escaped
[new_i
++] = 'r'; break;
12378 case '\t': escaped
[new_i
++] = 't'; break;
12379 case '\v': escaped
[new_i
++] = 'v'; break;
12380 default: escaped
[new_i
++] = '?'; break;
12384 escaped
[new_i
++] = c
;
12389 escaped
[new_i
] = 0;
12395 /* Warn about a use of an identifier which was marked deprecated. Returns
12396 whether a warning was given. */
12399 warn_deprecated_use (tree node
, tree attr
)
12401 escaped_string msg
;
12403 if (node
== 0 || !warn_deprecated_decl
)
12409 attr
= DECL_ATTRIBUTES (node
);
12410 else if (TYPE_P (node
))
12412 tree decl
= TYPE_STUB_DECL (node
);
12414 attr
= TYPE_ATTRIBUTES (TREE_TYPE (decl
));
12415 else if ((decl
= TYPE_STUB_DECL (TYPE_MAIN_VARIANT (node
)))
12418 node
= TREE_TYPE (decl
);
12419 attr
= TYPE_ATTRIBUTES (node
);
12425 attr
= lookup_attribute ("deprecated", attr
);
12428 msg
.escape (TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr
))));
12433 auto_diagnostic_group d
;
12435 w
= warning (OPT_Wdeprecated_declarations
,
12436 "%qD is deprecated: %s", node
, (const char *) msg
);
12438 w
= warning (OPT_Wdeprecated_declarations
,
12439 "%qD is deprecated", node
);
12441 inform (DECL_SOURCE_LOCATION (node
), "declared here");
12443 else if (TYPE_P (node
))
12445 tree what
= NULL_TREE
;
12446 tree decl
= TYPE_STUB_DECL (node
);
12448 if (TYPE_NAME (node
))
12450 if (TREE_CODE (TYPE_NAME (node
)) == IDENTIFIER_NODE
)
12451 what
= TYPE_NAME (node
);
12452 else if (TREE_CODE (TYPE_NAME (node
)) == TYPE_DECL
12453 && DECL_NAME (TYPE_NAME (node
)))
12454 what
= DECL_NAME (TYPE_NAME (node
));
12457 auto_diagnostic_group d
;
12461 w
= warning (OPT_Wdeprecated_declarations
,
12462 "%qE is deprecated: %s", what
, (const char *) msg
);
12464 w
= warning (OPT_Wdeprecated_declarations
,
12465 "%qE is deprecated", what
);
12470 w
= warning (OPT_Wdeprecated_declarations
,
12471 "type is deprecated: %s", (const char *) msg
);
12473 w
= warning (OPT_Wdeprecated_declarations
,
12474 "type is deprecated");
12478 inform (DECL_SOURCE_LOCATION (decl
), "declared here");
12484 /* Error out with an identifier which was marked 'unavailable'. */
12486 error_unavailable_use (tree node
, tree attr
)
12488 escaped_string msg
;
12496 attr
= DECL_ATTRIBUTES (node
);
12497 else if (TYPE_P (node
))
12499 tree decl
= TYPE_STUB_DECL (node
);
12501 attr
= lookup_attribute ("unavailable",
12502 TYPE_ATTRIBUTES (TREE_TYPE (decl
)));
12507 attr
= lookup_attribute ("unavailable", attr
);
12510 msg
.escape (TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr
))));
12514 auto_diagnostic_group d
;
12516 error ("%qD is unavailable: %s", node
, (const char *) msg
);
12518 error ("%qD is unavailable", node
);
12519 inform (DECL_SOURCE_LOCATION (node
), "declared here");
12521 else if (TYPE_P (node
))
12523 tree what
= NULL_TREE
;
12524 tree decl
= TYPE_STUB_DECL (node
);
12526 if (TYPE_NAME (node
))
12528 if (TREE_CODE (TYPE_NAME (node
)) == IDENTIFIER_NODE
)
12529 what
= TYPE_NAME (node
);
12530 else if (TREE_CODE (TYPE_NAME (node
)) == TYPE_DECL
12531 && DECL_NAME (TYPE_NAME (node
)))
12532 what
= DECL_NAME (TYPE_NAME (node
));
12535 auto_diagnostic_group d
;
12539 error ("%qE is unavailable: %s", what
, (const char *) msg
);
12541 error ("%qE is unavailable", what
);
12546 error ("type is unavailable: %s", (const char *) msg
);
12548 error ("type is unavailable");
12552 inform (DECL_SOURCE_LOCATION (decl
), "declared here");
12556 /* Return true if REF has a COMPONENT_REF with a bit-field field declaration
12557 somewhere in it. */
12560 contains_bitfld_component_ref_p (const_tree ref
)
12562 while (handled_component_p (ref
))
12564 if (TREE_CODE (ref
) == COMPONENT_REF
12565 && DECL_BIT_FIELD (TREE_OPERAND (ref
, 1)))
12567 ref
= TREE_OPERAND (ref
, 0);
12573 /* Try to determine whether a TRY_CATCH expression can fall through.
12574 This is a subroutine of block_may_fallthru. */
12577 try_catch_may_fallthru (const_tree stmt
)
12579 tree_stmt_iterator i
;
12581 /* If the TRY block can fall through, the whole TRY_CATCH can
12583 if (block_may_fallthru (TREE_OPERAND (stmt
, 0)))
12586 switch (TREE_CODE (TREE_OPERAND (stmt
, 1)))
12590 return block_may_fallthru (CATCH_BODY (TREE_OPERAND (stmt
, 1)));
12592 case EH_FILTER_EXPR
:
12594 return block_may_fallthru (EH_FILTER_FAILURE (TREE_OPERAND (stmt
, 1)));
12596 case STATEMENT_LIST
:
12604 i
= tsi_start (TREE_OPERAND (stmt
, 1));
12605 switch (TREE_CODE (tsi_stmt (i
)))
12608 /* We expect to see a sequence of CATCH_EXPR trees, each with a
12609 catch expression and a body. The whole TRY_CATCH may fall
12610 through iff any of the catch bodies falls through. */
12611 for (; !tsi_end_p (i
); tsi_next (&i
))
12613 if (block_may_fallthru (CATCH_BODY (tsi_stmt (i
))))
12618 case EH_FILTER_EXPR
:
12619 /* The exception filter expression only matters if there is an
12620 exception. If the exception does not match EH_FILTER_TYPES,
12621 we will execute EH_FILTER_FAILURE, and we will fall through
12622 if that falls through. If the exception does match
12623 EH_FILTER_TYPES, the stack unwinder will continue up the
12624 stack, so we will not fall through. We don't know whether we
12625 will throw an exception which matches EH_FILTER_TYPES or not,
12626 so we just ignore EH_FILTER_TYPES and assume that we might
12627 throw an exception which doesn't match. */
12628 return block_may_fallthru (EH_FILTER_FAILURE (tsi_stmt (i
)));
12631 /* This case represents statements to be executed when an
12632 exception occurs. Those statements are implicitly followed
12633 by a RESX statement to resume execution after the exception.
12634 So in this case the TRY_CATCH never falls through. */
12639 /* Try to determine if we can fall out of the bottom of BLOCK. This guess
12640 need not be 100% accurate; simply be conservative and return true if we
12641 don't know. This is used only to avoid stupidly generating extra code.
12642 If we're wrong, we'll just delete the extra code later. */
12645 block_may_fallthru (const_tree block
)
12647 /* This CONST_CAST is okay because expr_last returns its argument
12648 unmodified and we assign it to a const_tree. */
12649 const_tree stmt
= expr_last (CONST_CAST_TREE (block
));
12651 switch (stmt
? TREE_CODE (stmt
) : ERROR_MARK
)
12655 /* Easy cases. If the last statement of the block implies
12656 control transfer, then we can't fall through. */
12660 /* If there is a default: label or case labels cover all possible
12661 SWITCH_COND values, then the SWITCH_EXPR will transfer control
12662 to some case label in all cases and all we care is whether the
12663 SWITCH_BODY falls through. */
12664 if (SWITCH_ALL_CASES_P (stmt
))
12665 return block_may_fallthru (SWITCH_BODY (stmt
));
12669 if (block_may_fallthru (COND_EXPR_THEN (stmt
)))
12671 return block_may_fallthru (COND_EXPR_ELSE (stmt
));
12674 return block_may_fallthru (BIND_EXPR_BODY (stmt
));
12676 case TRY_CATCH_EXPR
:
12677 return try_catch_may_fallthru (stmt
);
12679 case TRY_FINALLY_EXPR
:
12680 /* The finally clause is always executed after the try clause,
12681 so if it does not fall through, then the try-finally will not
12682 fall through. Otherwise, if the try clause does not fall
12683 through, then when the finally clause falls through it will
12684 resume execution wherever the try clause was going. So the
12685 whole try-finally will only fall through if both the try
12686 clause and the finally clause fall through. */
12687 return (block_may_fallthru (TREE_OPERAND (stmt
, 0))
12688 && block_may_fallthru (TREE_OPERAND (stmt
, 1)));
12691 return block_may_fallthru (TREE_OPERAND (stmt
, 0));
12694 if (TREE_CODE (TREE_OPERAND (stmt
, 1)) == CALL_EXPR
)
12695 stmt
= TREE_OPERAND (stmt
, 1);
12701 /* Functions that do not return do not fall through. */
12702 return (call_expr_flags (stmt
) & ECF_NORETURN
) == 0;
12704 case CLEANUP_POINT_EXPR
:
12705 return block_may_fallthru (TREE_OPERAND (stmt
, 0));
12708 return block_may_fallthru (TREE_OPERAND (stmt
, 1));
12714 return lang_hooks
.block_may_fallthru (stmt
);
12718 /* True if we are using EH to handle cleanups. */
12719 static bool using_eh_for_cleanups_flag
= false;
12721 /* This routine is called from front ends to indicate eh should be used for
12724 using_eh_for_cleanups (void)
12726 using_eh_for_cleanups_flag
= true;
12729 /* Query whether EH is used for cleanups. */
12731 using_eh_for_cleanups_p (void)
12733 return using_eh_for_cleanups_flag
;
12736 /* Wrapper for tree_code_name to ensure that tree code is valid */
12738 get_tree_code_name (enum tree_code code
)
12740 const char *invalid
= "<invalid tree code>";
12742 /* The tree_code enum promotes to signed, but we could be getting
12743 invalid values, so force an unsigned comparison. */
12744 if (unsigned (code
) >= MAX_TREE_CODES
)
12746 if ((unsigned)code
== 0xa5a5)
12747 return "ggc_freed";
12751 return tree_code_name
[code
];
12754 /* Drops the TREE_OVERFLOW flag from T. */
12757 drop_tree_overflow (tree t
)
12759 gcc_checking_assert (TREE_OVERFLOW (t
));
12761 /* For tree codes with a sharing machinery re-build the result. */
12762 if (poly_int_tree_p (t
))
12763 return wide_int_to_tree (TREE_TYPE (t
), wi::to_poly_wide (t
));
12765 /* For VECTOR_CST, remove the overflow bits from the encoded elements
12766 and canonicalize the result. */
12767 if (TREE_CODE (t
) == VECTOR_CST
)
12769 tree_vector_builder builder
;
12770 builder
.new_unary_operation (TREE_TYPE (t
), t
, true);
12771 unsigned int count
= builder
.encoded_nelts ();
12772 for (unsigned int i
= 0; i
< count
; ++i
)
12774 tree elt
= VECTOR_CST_ELT (t
, i
);
12775 if (TREE_OVERFLOW (elt
))
12776 elt
= drop_tree_overflow (elt
);
12777 builder
.quick_push (elt
);
12779 return builder
.build ();
12782 /* Otherwise, as all tcc_constants are possibly shared, copy the node
12783 and drop the flag. */
12785 TREE_OVERFLOW (t
) = 0;
12787 /* For constants that contain nested constants, drop the flag
12788 from those as well. */
12789 if (TREE_CODE (t
) == COMPLEX_CST
)
12791 if (TREE_OVERFLOW (TREE_REALPART (t
)))
12792 TREE_REALPART (t
) = drop_tree_overflow (TREE_REALPART (t
));
12793 if (TREE_OVERFLOW (TREE_IMAGPART (t
)))
12794 TREE_IMAGPART (t
) = drop_tree_overflow (TREE_IMAGPART (t
));
12800 /* Given a memory reference expression T, return its base address.
12801 The base address of a memory reference expression is the main
12802 object being referenced. For instance, the base address for
12803 'array[i].fld[j]' is 'array'. You can think of this as stripping
12804 away the offset part from a memory address.
12806 This function calls handled_component_p to strip away all the inner
12807 parts of the memory reference until it reaches the base object. */
12810 get_base_address (tree t
)
12812 if (TREE_CODE (t
) == WITH_SIZE_EXPR
)
12813 t
= TREE_OPERAND (t
, 0);
12814 while (handled_component_p (t
))
12815 t
= TREE_OPERAND (t
, 0);
12817 if ((TREE_CODE (t
) == MEM_REF
12818 || TREE_CODE (t
) == TARGET_MEM_REF
)
12819 && TREE_CODE (TREE_OPERAND (t
, 0)) == ADDR_EXPR
)
12820 t
= TREE_OPERAND (TREE_OPERAND (t
, 0), 0);
12825 /* Return a tree of sizetype representing the size, in bytes, of the element
12826 of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
12829 array_ref_element_size (tree exp
)
12831 tree aligned_size
= TREE_OPERAND (exp
, 3);
12832 tree elmt_type
= TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp
, 0)));
12833 location_t loc
= EXPR_LOCATION (exp
);
12835 /* If a size was specified in the ARRAY_REF, it's the size measured
12836 in alignment units of the element type. So multiply by that value. */
12839 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
12840 sizetype from another type of the same width and signedness. */
12841 if (TREE_TYPE (aligned_size
) != sizetype
)
12842 aligned_size
= fold_convert_loc (loc
, sizetype
, aligned_size
);
12843 return size_binop_loc (loc
, MULT_EXPR
, aligned_size
,
12844 size_int (TYPE_ALIGN_UNIT (elmt_type
)));
12847 /* Otherwise, take the size from that of the element type. Substitute
12848 any PLACEHOLDER_EXPR that we have. */
12850 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_SIZE_UNIT (elmt_type
), exp
);
12853 /* Return a tree representing the lower bound of the array mentioned in
12854 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
12857 array_ref_low_bound (tree exp
)
12859 tree domain_type
= TYPE_DOMAIN (TREE_TYPE (TREE_OPERAND (exp
, 0)));
12861 /* If a lower bound is specified in EXP, use it. */
12862 if (TREE_OPERAND (exp
, 2))
12863 return TREE_OPERAND (exp
, 2);
12865 /* Otherwise, if there is a domain type and it has a lower bound, use it,
12866 substituting for a PLACEHOLDER_EXPR as needed. */
12867 if (domain_type
&& TYPE_MIN_VALUE (domain_type
))
12868 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_MIN_VALUE (domain_type
), exp
);
12870 /* Otherwise, return a zero of the appropriate type. */
12871 tree idxtype
= TREE_TYPE (TREE_OPERAND (exp
, 1));
12872 return (idxtype
== error_mark_node
12873 ? integer_zero_node
: build_int_cst (idxtype
, 0));
12876 /* Return a tree representing the upper bound of the array mentioned in
12877 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
12880 array_ref_up_bound (tree exp
)
12882 tree domain_type
= TYPE_DOMAIN (TREE_TYPE (TREE_OPERAND (exp
, 0)));
12884 /* If there is a domain type and it has an upper bound, use it, substituting
12885 for a PLACEHOLDER_EXPR as needed. */
12886 if (domain_type
&& TYPE_MAX_VALUE (domain_type
))
12887 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_MAX_VALUE (domain_type
), exp
);
12889 /* Otherwise fail. */
12893 /* Returns true if REF is an array reference, a component reference,
12894 or a memory reference to an array whose actual size might be larger
12895 than its upper bound implies, there are multiple cases:
12896 A. a ref to a flexible array member at the end of a structure;
12897 B. a ref to an array with a different type against the original decl;
12900 short a[16] = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16 };
12901 (*((char(*)[16])&a[0]))[i+8]
12903 C. a ref to an array that was passed as a parameter;
12906 int test (uint8_t *p, uint32_t t[1][1], int n) {
12907 for (int i = 0; i < 4; i++, p++)
12910 If non-null, set IS_TRAILING_ARRAY to true if the ref is the above case A.
12914 array_ref_flexible_size_p (tree ref
, bool *is_trailing_array
/* = NULL */)
12916 /* The TYPE for this array referece. */
12917 tree atype
= NULL_TREE
;
12918 /* The FIELD_DECL for the array field in the containing structure. */
12919 tree afield_decl
= NULL_TREE
;
12920 /* Whether this array is the trailing array of a structure. */
12921 bool is_trailing_array_tmp
= false;
12922 if (!is_trailing_array
)
12923 is_trailing_array
= &is_trailing_array_tmp
;
12925 if (TREE_CODE (ref
) == ARRAY_REF
12926 || TREE_CODE (ref
) == ARRAY_RANGE_REF
)
12928 atype
= TREE_TYPE (TREE_OPERAND (ref
, 0));
12929 ref
= TREE_OPERAND (ref
, 0);
12931 else if (TREE_CODE (ref
) == COMPONENT_REF
12932 && TREE_CODE (TREE_TYPE (TREE_OPERAND (ref
, 1))) == ARRAY_TYPE
)
12934 atype
= TREE_TYPE (TREE_OPERAND (ref
, 1));
12935 afield_decl
= TREE_OPERAND (ref
, 1);
12937 else if (TREE_CODE (ref
) == MEM_REF
)
12939 tree arg
= TREE_OPERAND (ref
, 0);
12940 if (TREE_CODE (arg
) == ADDR_EXPR
)
12941 arg
= TREE_OPERAND (arg
, 0);
12942 tree argtype
= TREE_TYPE (arg
);
12943 if (TREE_CODE (argtype
) == RECORD_TYPE
)
12945 if (tree fld
= last_field (argtype
))
12947 atype
= TREE_TYPE (fld
);
12949 if (TREE_CODE (atype
) != ARRAY_TYPE
)
12951 if (VAR_P (arg
) && DECL_SIZE (fld
))
12963 if (TREE_CODE (ref
) == STRING_CST
)
12966 tree ref_to_array
= ref
;
12967 while (handled_component_p (ref
))
12969 /* If the reference chain contains a component reference to a
12970 non-union type and there follows another field the reference
12971 is not at the end of a structure. */
12972 if (TREE_CODE (ref
) == COMPONENT_REF
)
12974 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (ref
, 0))) == RECORD_TYPE
)
12976 tree nextf
= DECL_CHAIN (TREE_OPERAND (ref
, 1));
12977 while (nextf
&& TREE_CODE (nextf
) != FIELD_DECL
)
12978 nextf
= DECL_CHAIN (nextf
);
12983 /* If we have a multi-dimensional array we do not consider
12984 a non-innermost dimension as flex array if the whole
12985 multi-dimensional array is at struct end.
12986 Same for an array of aggregates with a trailing array
12988 else if (TREE_CODE (ref
) == ARRAY_REF
)
12990 else if (TREE_CODE (ref
) == ARRAY_RANGE_REF
)
12992 /* If we view an underlying object as sth else then what we
12993 gathered up to now is what we have to rely on. */
12994 else if (TREE_CODE (ref
) == VIEW_CONVERT_EXPR
)
12997 gcc_unreachable ();
12999 ref
= TREE_OPERAND (ref
, 0);
13002 gcc_assert (!afield_decl
13003 || (afield_decl
&& TREE_CODE (afield_decl
) == FIELD_DECL
));
13005 /* The array now is at struct end. Treat flexible array member as
13006 always subject to extend, even into just padding constrained by
13007 an underlying decl. */
13008 if (! TYPE_SIZE (atype
)
13009 || ! TYPE_DOMAIN (atype
)
13010 || ! TYPE_MAX_VALUE (TYPE_DOMAIN (atype
)))
13012 *is_trailing_array
= afield_decl
&& TREE_CODE (afield_decl
) == FIELD_DECL
;
13013 return afield_decl
? !DECL_NOT_FLEXARRAY (afield_decl
) : true;
13016 /* If the reference is based on a declared entity, the size of the array
13017 is constrained by its given domain. (Do not trust commons PR/69368). */
13018 ref
= get_base_address (ref
);
13021 && !(flag_unconstrained_commons
13022 && VAR_P (ref
) && DECL_COMMON (ref
))
13023 && DECL_SIZE_UNIT (ref
)
13024 && TREE_CODE (DECL_SIZE_UNIT (ref
)) == INTEGER_CST
)
13026 /* If the object itself is the array it is not at struct end. */
13027 if (DECL_P (ref_to_array
))
13030 /* Check whether the array domain covers all of the available
13033 if (TREE_CODE (TYPE_SIZE_UNIT (TREE_TYPE (atype
))) != INTEGER_CST
13034 || TREE_CODE (TYPE_MAX_VALUE (TYPE_DOMAIN (atype
))) != INTEGER_CST
13035 || TREE_CODE (TYPE_MIN_VALUE (TYPE_DOMAIN (atype
))) != INTEGER_CST
)
13038 = afield_decl
&& TREE_CODE (afield_decl
) == FIELD_DECL
;
13039 return afield_decl
? !DECL_NOT_FLEXARRAY (afield_decl
) : true;
13041 if (! get_addr_base_and_unit_offset (ref_to_array
, &offset
))
13044 = afield_decl
&& TREE_CODE (afield_decl
) == FIELD_DECL
;
13045 return afield_decl
? !DECL_NOT_FLEXARRAY (afield_decl
) : true;
13048 /* If at least one extra element fits it is a flexarray. */
13049 if (known_le ((wi::to_offset (TYPE_MAX_VALUE (TYPE_DOMAIN (atype
)))
13050 - wi::to_offset (TYPE_MIN_VALUE (TYPE_DOMAIN (atype
)))
13052 * wi::to_offset (TYPE_SIZE_UNIT (TREE_TYPE (atype
))),
13053 wi::to_offset (DECL_SIZE_UNIT (ref
)) - offset
))
13056 = afield_decl
&& TREE_CODE (afield_decl
) == FIELD_DECL
;
13057 return afield_decl
? !DECL_NOT_FLEXARRAY (afield_decl
) : true;
13063 *is_trailing_array
= afield_decl
&& TREE_CODE (afield_decl
) == FIELD_DECL
;
13064 return afield_decl
? !DECL_NOT_FLEXARRAY (afield_decl
) : true;
13068 /* Return a tree representing the offset, in bytes, of the field referenced
13069 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
13072 component_ref_field_offset (tree exp
)
13074 tree aligned_offset
= TREE_OPERAND (exp
, 2);
13075 tree field
= TREE_OPERAND (exp
, 1);
13076 location_t loc
= EXPR_LOCATION (exp
);
13078 /* If an offset was specified in the COMPONENT_REF, it's the offset measured
13079 in units of DECL_OFFSET_ALIGN / BITS_PER_UNIT. So multiply by that
13081 if (aligned_offset
)
13083 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
13084 sizetype from another type of the same width and signedness. */
13085 if (TREE_TYPE (aligned_offset
) != sizetype
)
13086 aligned_offset
= fold_convert_loc (loc
, sizetype
, aligned_offset
);
13087 return size_binop_loc (loc
, MULT_EXPR
, aligned_offset
,
13088 size_int (DECL_OFFSET_ALIGN (field
)
13092 /* Otherwise, take the offset from that of the field. Substitute
13093 any PLACEHOLDER_EXPR that we have. */
13095 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (DECL_FIELD_OFFSET (field
), exp
);
13098 /* Given the initializer INIT, return the initializer for the field
13099 DECL if it exists, otherwise null. Used to obtain the initializer
13100 for a flexible array member and determine its size. */
13103 get_initializer_for (tree init
, tree decl
)
13107 tree fld
, fld_init
;
13108 unsigned HOST_WIDE_INT i
;
13109 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (init
), i
, fld
, fld_init
)
13114 if (TREE_CODE (fld
) == CONSTRUCTOR
)
13116 fld_init
= get_initializer_for (fld_init
, decl
);
13125 /* Determines the special array member type for the array reference REF. */
13126 special_array_member
13127 component_ref_sam_type (tree ref
)
13129 special_array_member sam_type
= special_array_member::none
;
13131 tree member
= TREE_OPERAND (ref
, 1);
13132 tree memsize
= DECL_SIZE_UNIT (member
);
13135 tree memtype
= TREE_TYPE (member
);
13136 if (TREE_CODE (memtype
) != ARRAY_TYPE
)
13139 bool trailing
= false;
13140 (void) array_ref_flexible_size_p (ref
, &trailing
);
13141 bool zero_elts
= integer_zerop (memsize
);
13142 if (zero_elts
&& integer_zerop (TYPE_SIZE_UNIT (TREE_TYPE (memtype
))))
13144 /* If array element has zero size, verify if it is a flexible
13145 array member or zero length array. Clear zero_elts if
13146 it has one or more members or is a VLA member. */
13147 if (tree dom
= TYPE_DOMAIN (memtype
))
13148 if (tree min
= TYPE_MIN_VALUE (dom
))
13149 if (tree max
= TYPE_MAX_VALUE (dom
))
13150 if (TREE_CODE (min
) != INTEGER_CST
13151 || TREE_CODE (max
) != INTEGER_CST
13152 || !((integer_zerop (min
) && integer_all_onesp (max
))
13153 || tree_int_cst_lt (max
, min
)))
13156 if (!trailing
&& !zero_elts
)
13157 /* MEMBER is an interior array with more than one element. */
13158 return special_array_member::int_n
;
13163 return special_array_member::trail_0
;
13165 return special_array_member::int_0
;
13169 if (tree dom
= TYPE_DOMAIN (memtype
))
13170 if (tree min
= TYPE_MIN_VALUE (dom
))
13171 if (tree max
= TYPE_MAX_VALUE (dom
))
13172 if (TREE_CODE (min
) == INTEGER_CST
13173 && TREE_CODE (max
) == INTEGER_CST
)
13175 offset_int minidx
= wi::to_offset (min
);
13176 offset_int maxidx
= wi::to_offset (max
);
13177 offset_int neltsm1
= maxidx
- minidx
;
13179 /* MEMBER is a trailing array with more than
13181 return special_array_member::trail_n
;
13184 return special_array_member::trail_1
;
13191 /* Determines the size of the member referenced by the COMPONENT_REF
13192 REF, using its initializer expression if necessary in order to
13193 determine the size of an initialized flexible array member.
13194 If non-null, set *SAM to the type of special array member.
13195 Returns the size as sizetype (which might be zero for an object
13196 with an uninitialized flexible array member) or null if the size
13197 cannot be determined. */
13200 component_ref_size (tree ref
, special_array_member
*sam
/* = NULL */)
13202 gcc_assert (TREE_CODE (ref
) == COMPONENT_REF
);
13204 special_array_member sambuf
;
13207 *sam
= component_ref_sam_type (ref
);
13209 /* The object/argument referenced by the COMPONENT_REF and its type. */
13210 tree arg
= TREE_OPERAND (ref
, 0);
13211 tree argtype
= TREE_TYPE (arg
);
13212 /* The referenced member. */
13213 tree member
= TREE_OPERAND (ref
, 1);
13215 tree memsize
= DECL_SIZE_UNIT (member
);
13218 tree memtype
= TREE_TYPE (member
);
13219 if (TREE_CODE (memtype
) != ARRAY_TYPE
)
13220 /* DECL_SIZE may be less than TYPE_SIZE in C++ when referring
13221 to the type of a class with a virtual base which doesn't
13222 reflect the size of the virtual's members (see pr97595).
13223 If that's the case fail for now and implement something
13224 more robust in the future. */
13225 return (tree_int_cst_equal (memsize
, TYPE_SIZE_UNIT (memtype
))
13226 ? memsize
: NULL_TREE
);
13228 /* 2-or-more elements arrays are treated as normal arrays by default. */
13229 if (*sam
== special_array_member::int_n
13230 || *sam
== special_array_member::trail_n
)
13233 tree afield_decl
= TREE_OPERAND (ref
, 1);
13234 gcc_assert (TREE_CODE (afield_decl
) == FIELD_DECL
);
13235 /* If the trailing array is a not a flexible array member, treat it as
13237 if (DECL_NOT_FLEXARRAY (afield_decl
)
13238 && *sam
!= special_array_member::int_0
)
13241 if (*sam
== special_array_member::int_0
)
13242 memsize
= NULL_TREE
;
13244 /* For a reference to a flexible array member of a union
13245 use the size of the union instead of the size of the member. */
13246 if (TREE_CODE (argtype
) == UNION_TYPE
)
13247 memsize
= TYPE_SIZE_UNIT (argtype
);
13250 /* MEMBER is either a bona fide flexible array member, or a zero-elements
13251 array member, or an array of length one treated as such. */
13253 /* If the reference is to a declared object and the member a true
13254 flexible array, try to determine its size from its initializer. */
13255 poly_int64 baseoff
= 0;
13256 tree base
= get_addr_base_and_unit_offset (ref
, &baseoff
);
13257 if (!base
|| !VAR_P (base
))
13259 if (*sam
!= special_array_member::int_0
)
13262 if (TREE_CODE (arg
) != COMPONENT_REF
)
13266 while (TREE_CODE (base
) == COMPONENT_REF
)
13267 base
= TREE_OPERAND (base
, 0);
13268 baseoff
= tree_to_poly_int64 (byte_position (TREE_OPERAND (ref
, 1)));
13271 /* BASE is the declared object of which MEMBER is either a member
13272 or that is cast to ARGTYPE (e.g., a char buffer used to store
13273 an ARGTYPE object). */
13274 tree basetype
= TREE_TYPE (base
);
13276 /* Determine the base type of the referenced object. If it's
13277 the same as ARGTYPE and MEMBER has a known size, return it. */
13278 tree bt
= basetype
;
13279 if (*sam
!= special_array_member::int_0
)
13280 while (TREE_CODE (bt
) == ARRAY_TYPE
)
13281 bt
= TREE_TYPE (bt
);
13282 bool typematch
= useless_type_conversion_p (argtype
, bt
);
13283 if (memsize
&& typematch
)
13286 memsize
= NULL_TREE
;
13289 /* MEMBER is a true flexible array member. Compute its size from
13290 the initializer of the BASE object if it has one. */
13291 if (tree init
= DECL_P (base
) ? DECL_INITIAL (base
) : NULL_TREE
)
13292 if (init
!= error_mark_node
)
13294 init
= get_initializer_for (init
, member
);
13297 memsize
= TYPE_SIZE_UNIT (TREE_TYPE (init
));
13298 if (tree refsize
= TYPE_SIZE_UNIT (argtype
))
13300 /* Use the larger of the initializer size and the tail
13301 padding in the enclosing struct. */
13302 poly_int64 rsz
= tree_to_poly_int64 (refsize
);
13304 if (known_lt (tree_to_poly_int64 (memsize
), rsz
))
13305 memsize
= wide_int_to_tree (TREE_TYPE (memsize
), rsz
);
13317 && DECL_EXTERNAL (base
)
13319 && *sam
!= special_array_member::int_0
)
13320 /* The size of a flexible array member of an extern struct
13321 with no initializer cannot be determined (it's defined
13322 in another translation unit and can have an initializer
13323 with an arbitrary number of elements). */
13326 /* Use the size of the base struct or, for interior zero-length
13327 arrays, the size of the enclosing type. */
13328 memsize
= TYPE_SIZE_UNIT (bt
);
13330 else if (DECL_P (base
))
13331 /* Use the size of the BASE object (possibly an array of some
13332 other type such as char used to store the struct). */
13333 memsize
= DECL_SIZE_UNIT (base
);
13338 /* If the flexible array member has a known size use the greater
13339 of it and the tail padding in the enclosing struct.
13340 Otherwise, when the size of the flexible array member is unknown
13341 and the referenced object is not a struct, use the size of its
13342 type when known. This detects sizes of array buffers when cast
13343 to struct types with flexible array members. */
13346 if (!tree_fits_poly_int64_p (memsize
))
13348 poly_int64 memsz64
= memsize
? tree_to_poly_int64 (memsize
) : 0;
13349 if (known_lt (baseoff
, memsz64
))
13351 memsz64
-= baseoff
;
13352 return wide_int_to_tree (TREE_TYPE (memsize
), memsz64
);
13354 return size_zero_node
;
13357 /* Return "don't know" for an external non-array object since its
13358 flexible array member can be initialized to have any number of
13359 elements. Otherwise, return zero because the flexible array
13360 member has no elements. */
13361 return (DECL_P (base
)
13362 && DECL_EXTERNAL (base
)
13364 || TREE_CODE (basetype
) != ARRAY_TYPE
)
13365 ? NULL_TREE
: size_zero_node
);
13368 /* Return the machine mode of T. For vectors, returns the mode of the
13369 inner type. The main use case is to feed the result to HONOR_NANS,
13370 avoiding the BLKmode that a direct TYPE_MODE (T) might return. */
13373 element_mode (const_tree t
)
13377 if (VECTOR_TYPE_P (t
) || TREE_CODE (t
) == COMPLEX_TYPE
)
13379 return TYPE_MODE (t
);
13382 /* Vector types need to re-check the target flags each time we report
13383 the machine mode. We need to do this because attribute target can
13384 change the result of vector_mode_supported_p and have_regs_of_mode
13385 on a per-function basis. Thus the TYPE_MODE of a VECTOR_TYPE can
13386 change on a per-function basis. */
13387 /* ??? Possibly a better solution is to run through all the types
13388 referenced by a function and re-compute the TYPE_MODE once, rather
13389 than make the TYPE_MODE macro call a function. */
13392 vector_type_mode (const_tree t
)
13396 gcc_assert (TREE_CODE (t
) == VECTOR_TYPE
);
13398 mode
= t
->type_common
.mode
;
13399 if (VECTOR_MODE_P (mode
)
13400 && (!targetm
.vector_mode_supported_p (mode
)
13401 || !have_regs_of_mode
[mode
]))
13403 scalar_int_mode innermode
;
13405 /* For integers, try mapping it to a same-sized scalar mode. */
13406 if (is_int_mode (TREE_TYPE (t
)->type_common
.mode
, &innermode
))
13408 poly_int64 size
= (TYPE_VECTOR_SUBPARTS (t
)
13409 * GET_MODE_BITSIZE (innermode
));
13410 scalar_int_mode mode
;
13411 if (int_mode_for_size (size
, 0).exists (&mode
)
13412 && have_regs_of_mode
[mode
])
13422 /* Return the size in bits of each element of vector type TYPE. */
13425 vector_element_bits (const_tree type
)
13427 gcc_checking_assert (VECTOR_TYPE_P (type
));
13428 if (VECTOR_BOOLEAN_TYPE_P (type
))
13429 return TYPE_PRECISION (TREE_TYPE (type
));
13430 return tree_to_uhwi (TYPE_SIZE (TREE_TYPE (type
)));
13433 /* Calculate the size in bits of each element of vector type TYPE
13434 and return the result as a tree of type bitsizetype. */
13437 vector_element_bits_tree (const_tree type
)
13439 gcc_checking_assert (VECTOR_TYPE_P (type
));
13440 if (VECTOR_BOOLEAN_TYPE_P (type
))
13441 return bitsize_int (vector_element_bits (type
));
13442 return TYPE_SIZE (TREE_TYPE (type
));
13445 /* Verify that basic properties of T match TV and thus T can be a variant of
13446 TV. TV should be the more specified variant (i.e. the main variant). */
13449 verify_type_variant (const_tree t
, tree tv
)
13451 /* Type variant can differ by:
13453 - TYPE_QUALS: TYPE_READONLY, TYPE_VOLATILE, TYPE_ATOMIC, TYPE_RESTRICT,
13454 ENCODE_QUAL_ADDR_SPACE.
13455 - main variant may be TYPE_COMPLETE_P and variant types !TYPE_COMPLETE_P
13456 in this case some values may not be set in the variant types
13457 (see TYPE_COMPLETE_P checks).
13458 - it is possible to have TYPE_ARTIFICIAL variant of non-artifical type
13459 - by TYPE_NAME and attributes (i.e. when variant originate by typedef)
13460 - TYPE_CANONICAL (TYPE_ALIAS_SET is the same among variants)
13461 - by the alignment: TYPE_ALIGN and TYPE_USER_ALIGN
13462 - during LTO by TYPE_CONTEXT if type is TYPE_FILE_SCOPE_P
13463 this is necessary to make it possible to merge types form different TUs
13464 - arrays, pointers and references may have TREE_TYPE that is a variant
13465 of TREE_TYPE of their main variants.
13466 - aggregates may have new TYPE_FIELDS list that list variants of
13467 the main variant TYPE_FIELDS.
13468 - vector types may differ by TYPE_VECTOR_OPAQUE
13471 /* Convenience macro for matching individual fields. */
13472 #define verify_variant_match(flag) \
13474 if (flag (tv) != flag (t)) \
13476 error ("type variant differs by %s", #flag); \
13482 /* tree_base checks. */
13484 verify_variant_match (TREE_CODE
);
13485 /* FIXME: Ada builds non-artificial variants of artificial types. */
13487 if (TYPE_ARTIFICIAL (tv
))
13488 verify_variant_match (TYPE_ARTIFICIAL
);
13490 if (POINTER_TYPE_P (tv
))
13491 verify_variant_match (TYPE_REF_CAN_ALIAS_ALL
);
13492 /* FIXME: TYPE_SIZES_GIMPLIFIED may differs for Ada build. */
13493 verify_variant_match (TYPE_UNSIGNED
);
13494 verify_variant_match (TYPE_PACKED
);
13495 if (TREE_CODE (t
) == REFERENCE_TYPE
)
13496 verify_variant_match (TYPE_REF_IS_RVALUE
);
13497 if (AGGREGATE_TYPE_P (t
))
13498 verify_variant_match (TYPE_REVERSE_STORAGE_ORDER
);
13500 verify_variant_match (TYPE_SATURATING
);
13501 /* FIXME: This check trigger during libstdc++ build. */
13503 if (RECORD_OR_UNION_TYPE_P (t
) && COMPLETE_TYPE_P (t
))
13504 verify_variant_match (TYPE_FINAL_P
);
13507 /* tree_type_common checks. */
13509 if (COMPLETE_TYPE_P (t
))
13511 verify_variant_match (TYPE_MODE
);
13512 if (TREE_CODE (TYPE_SIZE (t
)) != PLACEHOLDER_EXPR
13513 && TREE_CODE (TYPE_SIZE (tv
)) != PLACEHOLDER_EXPR
)
13514 verify_variant_match (TYPE_SIZE
);
13515 if (TREE_CODE (TYPE_SIZE_UNIT (t
)) != PLACEHOLDER_EXPR
13516 && TREE_CODE (TYPE_SIZE_UNIT (tv
)) != PLACEHOLDER_EXPR
13517 && TYPE_SIZE_UNIT (t
) != TYPE_SIZE_UNIT (tv
))
13519 gcc_assert (!operand_equal_p (TYPE_SIZE_UNIT (t
),
13520 TYPE_SIZE_UNIT (tv
), 0));
13521 error ("type variant has different %<TYPE_SIZE_UNIT%>");
13523 error ("type variant%'s %<TYPE_SIZE_UNIT%>");
13524 debug_tree (TYPE_SIZE_UNIT (tv
));
13525 error ("type%'s %<TYPE_SIZE_UNIT%>");
13526 debug_tree (TYPE_SIZE_UNIT (t
));
13529 verify_variant_match (TYPE_NEEDS_CONSTRUCTING
);
13531 verify_variant_match (TYPE_PRECISION_RAW
);
13532 if (RECORD_OR_UNION_TYPE_P (t
))
13533 verify_variant_match (TYPE_TRANSPARENT_AGGR
);
13534 else if (TREE_CODE (t
) == ARRAY_TYPE
)
13535 verify_variant_match (TYPE_NONALIASED_COMPONENT
);
13536 /* During LTO we merge variant lists from diferent translation units
13537 that may differ BY TYPE_CONTEXT that in turn may point
13538 to TRANSLATION_UNIT_DECL.
13539 Ada also builds variants of types with different TYPE_CONTEXT. */
13541 if (!in_lto_p
|| !TYPE_FILE_SCOPE_P (t
))
13542 verify_variant_match (TYPE_CONTEXT
);
13544 if (TREE_CODE (t
) == ARRAY_TYPE
|| TREE_CODE (t
) == INTEGER_TYPE
)
13545 verify_variant_match (TYPE_STRING_FLAG
);
13546 if (TREE_CODE (t
) == RECORD_TYPE
|| TREE_CODE (t
) == UNION_TYPE
)
13547 verify_variant_match (TYPE_CXX_ODR_P
);
13548 if (TYPE_ALIAS_SET_KNOWN_P (t
))
13550 error ("type variant with %<TYPE_ALIAS_SET_KNOWN_P%>");
13555 /* tree_type_non_common checks. */
13557 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
13558 and dangle the pointer from time to time. */
13559 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_VFIELD (t
) != TYPE_VFIELD (tv
)
13560 && (in_lto_p
|| !TYPE_VFIELD (tv
)
13561 || TREE_CODE (TYPE_VFIELD (tv
)) != TREE_LIST
))
13563 error ("type variant has different %<TYPE_VFIELD%>");
13567 if ((TREE_CODE (t
) == ENUMERAL_TYPE
&& COMPLETE_TYPE_P (t
))
13568 || TREE_CODE (t
) == INTEGER_TYPE
13569 || TREE_CODE (t
) == BOOLEAN_TYPE
13570 || TREE_CODE (t
) == BITINT_TYPE
13571 || SCALAR_FLOAT_TYPE_P (t
)
13572 || FIXED_POINT_TYPE_P (t
))
13574 verify_variant_match (TYPE_MAX_VALUE
);
13575 verify_variant_match (TYPE_MIN_VALUE
);
13577 if (TREE_CODE (t
) == METHOD_TYPE
)
13578 verify_variant_match (TYPE_METHOD_BASETYPE
);
13579 if (TREE_CODE (t
) == OFFSET_TYPE
)
13580 verify_variant_match (TYPE_OFFSET_BASETYPE
);
13581 if (TREE_CODE (t
) == ARRAY_TYPE
)
13582 verify_variant_match (TYPE_ARRAY_MAX_SIZE
);
13583 /* FIXME: Be lax and allow TYPE_BINFO to be missing in variant types
13584 or even type's main variant. This is needed to make bootstrap pass
13585 and the bug seems new in GCC 5.
13586 C++ FE should be updated to make this consistent and we should check
13587 that TYPE_BINFO is always NULL for !COMPLETE_TYPE_P and otherwise there
13588 is a match with main variant.
13590 Also disable the check for Java for now because of parser hack that builds
13591 first an dummy BINFO and then sometimes replace it by real BINFO in some
13593 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_BINFO (t
) && TYPE_BINFO (tv
)
13594 && TYPE_BINFO (t
) != TYPE_BINFO (tv
)
13595 /* FIXME: Java sometimes keep dump TYPE_BINFOs on variant types.
13596 Since there is no cheap way to tell C++/Java type w/o LTO, do checking
13597 at LTO time only. */
13598 && (in_lto_p
&& odr_type_p (t
)))
13600 error ("type variant has different %<TYPE_BINFO%>");
13602 error ("type variant%'s %<TYPE_BINFO%>");
13603 debug_tree (TYPE_BINFO (tv
));
13604 error ("type%'s %<TYPE_BINFO%>");
13605 debug_tree (TYPE_BINFO (t
));
13609 /* Check various uses of TYPE_VALUES_RAW. */
13610 if (TREE_CODE (t
) == ENUMERAL_TYPE
13611 && TYPE_VALUES (t
))
13612 verify_variant_match (TYPE_VALUES
);
13613 else if (TREE_CODE (t
) == ARRAY_TYPE
)
13614 verify_variant_match (TYPE_DOMAIN
);
13615 /* Permit incomplete variants of complete type. While FEs may complete
13616 all variants, this does not happen for C++ templates in all cases. */
13617 else if (RECORD_OR_UNION_TYPE_P (t
)
13618 && COMPLETE_TYPE_P (t
)
13619 && TYPE_FIELDS (t
) != TYPE_FIELDS (tv
))
13623 /* Fortran builds qualified variants as new records with items of
13624 qualified type. Verify that they looks same. */
13625 for (f1
= TYPE_FIELDS (t
), f2
= TYPE_FIELDS (tv
);
13627 f1
= TREE_CHAIN (f1
), f2
= TREE_CHAIN (f2
))
13628 if (TREE_CODE (f1
) != FIELD_DECL
|| TREE_CODE (f2
) != FIELD_DECL
13629 || (TYPE_MAIN_VARIANT (TREE_TYPE (f1
))
13630 != TYPE_MAIN_VARIANT (TREE_TYPE (f2
))
13631 /* FIXME: gfc_nonrestricted_type builds all types as variants
13632 with exception of pointer types. It deeply copies the type
13633 which means that we may end up with a variant type
13634 referring non-variant pointer. We may change it to
13635 produce types as variants, too, like
13636 objc_get_protocol_qualified_type does. */
13637 && !POINTER_TYPE_P (TREE_TYPE (f1
)))
13638 || DECL_FIELD_OFFSET (f1
) != DECL_FIELD_OFFSET (f2
)
13639 || DECL_FIELD_BIT_OFFSET (f1
) != DECL_FIELD_BIT_OFFSET (f2
))
13643 error ("type variant has different %<TYPE_FIELDS%>");
13645 error ("first mismatch is field");
13647 error ("and field");
13652 else if (FUNC_OR_METHOD_TYPE_P (t
))
13653 verify_variant_match (TYPE_ARG_TYPES
);
13654 /* For C++ the qualified variant of array type is really an array type
13655 of qualified TREE_TYPE.
13656 objc builds variants of pointer where pointer to type is a variant, too
13657 in objc_get_protocol_qualified_type. */
13658 if (TREE_TYPE (t
) != TREE_TYPE (tv
)
13659 && ((TREE_CODE (t
) != ARRAY_TYPE
13660 && !POINTER_TYPE_P (t
))
13661 || TYPE_MAIN_VARIANT (TREE_TYPE (t
))
13662 != TYPE_MAIN_VARIANT (TREE_TYPE (tv
))))
13664 error ("type variant has different %<TREE_TYPE%>");
13666 error ("type variant%'s %<TREE_TYPE%>");
13667 debug_tree (TREE_TYPE (tv
));
13668 error ("type%'s %<TREE_TYPE%>");
13669 debug_tree (TREE_TYPE (t
));
13672 if (type_with_alias_set_p (t
)
13673 && !gimple_canonical_types_compatible_p (t
, tv
, false))
13675 error ("type is not compatible with its variant");
13677 error ("type variant%'s %<TREE_TYPE%>");
13678 debug_tree (TREE_TYPE (tv
));
13679 error ("type%'s %<TREE_TYPE%>");
13680 debug_tree (TREE_TYPE (t
));
13684 #undef verify_variant_match
13688 /* The TYPE_CANONICAL merging machinery. It should closely resemble
13689 the middle-end types_compatible_p function. It needs to avoid
13690 claiming types are different for types that should be treated
13691 the same with respect to TBAA. Canonical types are also used
13692 for IL consistency checks via the useless_type_conversion_p
13693 predicate which does not handle all type kinds itself but falls
13694 back to pointer-comparison of TYPE_CANONICAL for aggregates
13697 /* Return true if TYPE_UNSIGNED of TYPE should be ignored for canonical
13698 type calculation because we need to allow inter-operability between signed
13699 and unsigned variants. */
13702 type_with_interoperable_signedness (const_tree type
)
13704 /* Fortran standard require C_SIGNED_CHAR to be interoperable with both
13705 signed char and unsigned char. Similarly fortran FE builds
13706 C_SIZE_T as signed type, while C defines it unsigned. */
13708 return tree_code_for_canonical_type_merging (TREE_CODE (type
))
13710 && (TYPE_PRECISION (type
) == TYPE_PRECISION (signed_char_type_node
)
13711 || TYPE_PRECISION (type
) == TYPE_PRECISION (size_type_node
));
13714 /* Return true iff T1 and T2 are structurally identical for what
13716 This function is used both by lto.cc canonical type merging and by the
13717 verifier. If TRUST_TYPE_CANONICAL we do not look into structure of types
13718 that have TYPE_CANONICAL defined and assume them equivalent. This is useful
13719 only for LTO because only in these cases TYPE_CANONICAL equivalence
13720 correspond to one defined by gimple_canonical_types_compatible_p. */
13723 gimple_canonical_types_compatible_p (const_tree t1
, const_tree t2
,
13724 bool trust_type_canonical
)
13726 /* Type variants should be same as the main variant. When not doing sanity
13727 checking to verify this fact, go to main variants and save some work. */
13728 if (trust_type_canonical
)
13730 t1
= TYPE_MAIN_VARIANT (t1
);
13731 t2
= TYPE_MAIN_VARIANT (t2
);
13734 /* Check first for the obvious case of pointer identity. */
13738 /* Check that we have two types to compare. */
13739 if (t1
== NULL_TREE
|| t2
== NULL_TREE
)
13742 /* We consider complete types always compatible with incomplete type.
13743 This does not make sense for canonical type calculation and thus we
13744 need to ensure that we are never called on it.
13746 FIXME: For more correctness the function probably should have three modes
13747 1) mode assuming that types are complete mathcing their structure
13748 2) mode allowing incomplete types but producing equivalence classes
13749 and thus ignoring all info from complete types
13750 3) mode allowing incomplete types to match complete but checking
13751 compatibility between complete types.
13753 1 and 2 can be used for canonical type calculation. 3 is the real
13754 definition of type compatibility that can be used i.e. for warnings during
13755 declaration merging. */
13757 gcc_assert (!trust_type_canonical
13758 || (type_with_alias_set_p (t1
) && type_with_alias_set_p (t2
)));
13760 /* If the types have been previously registered and found equal
13763 if (TYPE_CANONICAL (t1
) && TYPE_CANONICAL (t2
)
13764 && trust_type_canonical
)
13766 /* Do not use TYPE_CANONICAL of pointer types. For LTO streamed types
13767 they are always NULL, but they are set to non-NULL for types
13768 constructed by build_pointer_type and variants. In this case the
13769 TYPE_CANONICAL is more fine grained than the equivalnce we test (where
13770 all pointers are considered equal. Be sure to not return false
13772 gcc_checking_assert (canonical_type_used_p (t1
)
13773 && canonical_type_used_p (t2
));
13774 return TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
);
13777 /* For types where we do ODR based TBAA the canonical type is always
13778 set correctly, so we know that types are different if their
13779 canonical types does not match. */
13780 if (trust_type_canonical
13781 && (odr_type_p (t1
) && odr_based_tbaa_p (t1
))
13782 != (odr_type_p (t2
) && odr_based_tbaa_p (t2
)))
13785 /* Can't be the same type if the types don't have the same code. */
13786 enum tree_code code
= tree_code_for_canonical_type_merging (TREE_CODE (t1
));
13787 if (code
!= tree_code_for_canonical_type_merging (TREE_CODE (t2
)))
13790 /* Qualifiers do not matter for canonical type comparison purposes. */
13792 /* Void types and nullptr types are always the same. */
13793 if (VOID_TYPE_P (t1
)
13794 || TREE_CODE (t1
) == NULLPTR_TYPE
)
13797 /* Can't be the same type if they have different mode. */
13798 if (TYPE_MODE (t1
) != TYPE_MODE (t2
))
13801 /* Non-aggregate types can be handled cheaply. */
13802 if (INTEGRAL_TYPE_P (t1
)
13803 || SCALAR_FLOAT_TYPE_P (t1
)
13804 || FIXED_POINT_TYPE_P (t1
)
13805 || VECTOR_TYPE_P (t1
)
13806 || TREE_CODE (t1
) == COMPLEX_TYPE
13807 || TREE_CODE (t1
) == OFFSET_TYPE
13808 || POINTER_TYPE_P (t1
))
13810 /* Can't be the same type if they have different precision. */
13811 if (TYPE_PRECISION_RAW (t1
) != TYPE_PRECISION_RAW (t2
))
13814 /* In some cases the signed and unsigned types are required to be
13816 if (TYPE_UNSIGNED (t1
) != TYPE_UNSIGNED (t2
)
13817 && !type_with_interoperable_signedness (t1
))
13820 /* Fortran's C_SIGNED_CHAR is !TYPE_STRING_FLAG but needs to be
13821 interoperable with "signed char". Unless all frontends are revisited
13822 to agree on these types, we must ignore the flag completely. */
13824 /* Fortran standard define C_PTR type that is compatible with every
13825 C pointer. For this reason we need to glob all pointers into one.
13826 Still pointers in different address spaces are not compatible. */
13827 if (POINTER_TYPE_P (t1
))
13829 if (TYPE_ADDR_SPACE (TREE_TYPE (t1
))
13830 != TYPE_ADDR_SPACE (TREE_TYPE (t2
)))
13834 /* Tail-recurse to components. */
13835 if (VECTOR_TYPE_P (t1
)
13836 || TREE_CODE (t1
) == COMPLEX_TYPE
)
13837 return gimple_canonical_types_compatible_p (TREE_TYPE (t1
),
13839 trust_type_canonical
);
13844 /* Do type-specific comparisons. */
13845 switch (TREE_CODE (t1
))
13848 /* Array types are the same if the element types are the same and
13849 the number of elements are the same. */
13850 if (!gimple_canonical_types_compatible_p (TREE_TYPE (t1
), TREE_TYPE (t2
),
13851 trust_type_canonical
)
13852 || TYPE_STRING_FLAG (t1
) != TYPE_STRING_FLAG (t2
)
13853 || TYPE_REVERSE_STORAGE_ORDER (t1
) != TYPE_REVERSE_STORAGE_ORDER (t2
)
13854 || TYPE_NONALIASED_COMPONENT (t1
) != TYPE_NONALIASED_COMPONENT (t2
))
13858 tree i1
= TYPE_DOMAIN (t1
);
13859 tree i2
= TYPE_DOMAIN (t2
);
13861 /* For an incomplete external array, the type domain can be
13862 NULL_TREE. Check this condition also. */
13863 if (i1
== NULL_TREE
&& i2
== NULL_TREE
)
13865 else if (i1
== NULL_TREE
|| i2
== NULL_TREE
)
13869 tree min1
= TYPE_MIN_VALUE (i1
);
13870 tree min2
= TYPE_MIN_VALUE (i2
);
13871 tree max1
= TYPE_MAX_VALUE (i1
);
13872 tree max2
= TYPE_MAX_VALUE (i2
);
13874 /* The minimum/maximum values have to be the same. */
13877 && ((TREE_CODE (min1
) == PLACEHOLDER_EXPR
13878 && TREE_CODE (min2
) == PLACEHOLDER_EXPR
)
13879 || operand_equal_p (min1
, min2
, 0))))
13882 && ((TREE_CODE (max1
) == PLACEHOLDER_EXPR
13883 && TREE_CODE (max2
) == PLACEHOLDER_EXPR
)
13884 || operand_equal_p (max1
, max2
, 0)))))
13892 case FUNCTION_TYPE
:
13893 /* Function types are the same if the return type and arguments types
13895 if (!gimple_canonical_types_compatible_p (TREE_TYPE (t1
), TREE_TYPE (t2
),
13896 trust_type_canonical
))
13899 if (TYPE_ARG_TYPES (t1
) == TYPE_ARG_TYPES (t2
)
13900 && (TYPE_NO_NAMED_ARGS_STDARG_P (t1
)
13901 == TYPE_NO_NAMED_ARGS_STDARG_P (t2
)))
13905 tree parms1
, parms2
;
13907 for (parms1
= TYPE_ARG_TYPES (t1
), parms2
= TYPE_ARG_TYPES (t2
);
13909 parms1
= TREE_CHAIN (parms1
), parms2
= TREE_CHAIN (parms2
))
13911 if (!gimple_canonical_types_compatible_p
13912 (TREE_VALUE (parms1
), TREE_VALUE (parms2
),
13913 trust_type_canonical
))
13917 if (parms1
|| parms2
)
13925 case QUAL_UNION_TYPE
:
13929 /* Don't try to compare variants of an incomplete type, before
13930 TYPE_FIELDS has been copied around. */
13931 if (!COMPLETE_TYPE_P (t1
) && !COMPLETE_TYPE_P (t2
))
13935 if (TYPE_REVERSE_STORAGE_ORDER (t1
) != TYPE_REVERSE_STORAGE_ORDER (t2
))
13938 /* For aggregate types, all the fields must be the same. */
13939 for (f1
= TYPE_FIELDS (t1
), f2
= TYPE_FIELDS (t2
);
13941 f1
= TREE_CHAIN (f1
), f2
= TREE_CHAIN (f2
))
13943 /* Skip non-fields and zero-sized fields. */
13944 while (f1
&& (TREE_CODE (f1
) != FIELD_DECL
13946 && integer_zerop (DECL_SIZE (f1
)))))
13947 f1
= TREE_CHAIN (f1
);
13948 while (f2
&& (TREE_CODE (f2
) != FIELD_DECL
13950 && integer_zerop (DECL_SIZE (f2
)))))
13951 f2
= TREE_CHAIN (f2
);
13954 /* The fields must have the same name, offset and type. */
13955 if (DECL_NONADDRESSABLE_P (f1
) != DECL_NONADDRESSABLE_P (f2
)
13956 || !gimple_compare_field_offset (f1
, f2
)
13957 || !gimple_canonical_types_compatible_p
13958 (TREE_TYPE (f1
), TREE_TYPE (f2
),
13959 trust_type_canonical
))
13963 /* If one aggregate has more fields than the other, they
13964 are not the same. */
13972 /* Consider all types with language specific trees in them mutually
13973 compatible. This is executed only from verify_type and false
13974 positives can be tolerated. */
13975 gcc_assert (!in_lto_p
);
13980 /* For OPAQUE_TYPE T, it should have only size and alignment information
13981 and its mode should be of class MODE_OPAQUE. This function verifies
13982 these properties of T match TV which is the main variant of T and TC
13983 which is the canonical of T. */
13986 verify_opaque_type (const_tree t
, tree tv
, tree tc
)
13988 gcc_assert (OPAQUE_TYPE_P (t
));
13989 gcc_assert (tv
&& tv
== TYPE_MAIN_VARIANT (tv
));
13990 gcc_assert (tc
&& tc
== TYPE_CANONICAL (tc
));
13992 /* For an opaque type T1, check if some of its properties match
13993 the corresponding ones of the other opaque type T2, emit some
13994 error messages for those inconsistent ones. */
13995 auto check_properties_for_opaque_type
= [](const_tree t1
, tree t2
,
13996 const char *kind_msg
)
13998 if (!OPAQUE_TYPE_P (t2
))
14000 error ("type %s is not an opaque type", kind_msg
);
14004 if (!OPAQUE_MODE_P (TYPE_MODE (t2
)))
14006 error ("type %s is not with opaque mode", kind_msg
);
14010 if (TYPE_MODE (t1
) != TYPE_MODE (t2
))
14012 error ("type %s differs by %<TYPE_MODE%>", kind_msg
);
14016 poly_uint64 t1_size
= tree_to_poly_uint64 (TYPE_SIZE (t1
));
14017 poly_uint64 t2_size
= tree_to_poly_uint64 (TYPE_SIZE (t2
));
14018 if (maybe_ne (t1_size
, t2_size
))
14020 error ("type %s differs by %<TYPE_SIZE%>", kind_msg
);
14024 if (TYPE_ALIGN (t1
) != TYPE_ALIGN (t2
))
14026 error ("type %s differs by %<TYPE_ALIGN%>", kind_msg
);
14030 if (TYPE_USER_ALIGN (t1
) != TYPE_USER_ALIGN (t2
))
14032 error ("type %s differs by %<TYPE_USER_ALIGN%>", kind_msg
);
14039 check_properties_for_opaque_type (t
, tv
, "variant");
14042 check_properties_for_opaque_type (t
, tc
, "canonical");
14045 /* Verify type T. */
14048 verify_type (const_tree t
)
14050 bool error_found
= false;
14051 tree mv
= TYPE_MAIN_VARIANT (t
);
14052 tree ct
= TYPE_CANONICAL (t
);
14054 if (OPAQUE_TYPE_P (t
))
14056 verify_opaque_type (t
, mv
, ct
);
14062 error ("main variant is not defined");
14063 error_found
= true;
14065 else if (mv
!= TYPE_MAIN_VARIANT (mv
))
14067 error ("%<TYPE_MAIN_VARIANT%> has different %<TYPE_MAIN_VARIANT%>");
14069 error_found
= true;
14071 else if (t
!= mv
&& !verify_type_variant (t
, mv
))
14072 error_found
= true;
14076 else if (TYPE_CANONICAL (ct
) != ct
)
14078 error ("%<TYPE_CANONICAL%> has different %<TYPE_CANONICAL%>");
14080 error_found
= true;
14082 /* Method and function types cannot be used to address memory and thus
14083 TYPE_CANONICAL really matters only for determining useless conversions.
14085 FIXME: C++ FE produce declarations of builtin functions that are not
14086 compatible with main variants. */
14087 else if (TREE_CODE (t
) == FUNCTION_TYPE
)
14090 /* FIXME: gimple_canonical_types_compatible_p cannot compare types
14091 with variably sized arrays because their sizes possibly
14092 gimplified to different variables. */
14093 && !variably_modified_type_p (ct
, NULL
)
14094 && !gimple_canonical_types_compatible_p (t
, ct
, false)
14095 && COMPLETE_TYPE_P (t
))
14097 error ("%<TYPE_CANONICAL%> is not compatible");
14099 error_found
= true;
14102 if (COMPLETE_TYPE_P (t
) && TYPE_CANONICAL (t
)
14103 && TYPE_MODE (t
) != TYPE_MODE (TYPE_CANONICAL (t
)))
14105 error ("%<TYPE_MODE%> of %<TYPE_CANONICAL%> is not compatible");
14107 error_found
= true;
14109 if (TYPE_MAIN_VARIANT (t
) == t
&& ct
&& TYPE_MAIN_VARIANT (ct
) != ct
)
14111 error ("%<TYPE_CANONICAL%> of main variant is not main variant");
14113 debug_tree (TYPE_MAIN_VARIANT (ct
));
14114 error_found
= true;
14118 /* Check various uses of TYPE_MIN_VALUE_RAW. */
14119 if (RECORD_OR_UNION_TYPE_P (t
))
14121 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
14122 and danagle the pointer from time to time. */
14123 if (TYPE_VFIELD (t
)
14124 && TREE_CODE (TYPE_VFIELD (t
)) != FIELD_DECL
14125 && TREE_CODE (TYPE_VFIELD (t
)) != TREE_LIST
)
14127 error ("%<TYPE_VFIELD%> is not %<FIELD_DECL%> nor %<TREE_LIST%>");
14128 debug_tree (TYPE_VFIELD (t
));
14129 error_found
= true;
14132 else if (TREE_CODE (t
) == POINTER_TYPE
)
14134 if (TYPE_NEXT_PTR_TO (t
)
14135 && TREE_CODE (TYPE_NEXT_PTR_TO (t
)) != POINTER_TYPE
)
14137 error ("%<TYPE_NEXT_PTR_TO%> is not %<POINTER_TYPE%>");
14138 debug_tree (TYPE_NEXT_PTR_TO (t
));
14139 error_found
= true;
14142 else if (TREE_CODE (t
) == REFERENCE_TYPE
)
14144 if (TYPE_NEXT_REF_TO (t
)
14145 && TREE_CODE (TYPE_NEXT_REF_TO (t
)) != REFERENCE_TYPE
)
14147 error ("%<TYPE_NEXT_REF_TO%> is not %<REFERENCE_TYPE%>");
14148 debug_tree (TYPE_NEXT_REF_TO (t
));
14149 error_found
= true;
14152 else if (INTEGRAL_TYPE_P (t
) || SCALAR_FLOAT_TYPE_P (t
)
14153 || FIXED_POINT_TYPE_P (t
))
14155 /* FIXME: The following check should pass:
14156 useless_type_conversion_p (const_cast <tree> (t),
14157 TREE_TYPE (TYPE_MIN_VALUE (t))
14158 but does not for C sizetypes in LTO. */
14161 /* Check various uses of TYPE_MAXVAL_RAW. */
14162 if (RECORD_OR_UNION_TYPE_P (t
))
14164 if (!TYPE_BINFO (t
))
14166 else if (TREE_CODE (TYPE_BINFO (t
)) != TREE_BINFO
)
14168 error ("%<TYPE_BINFO%> is not %<TREE_BINFO%>");
14169 debug_tree (TYPE_BINFO (t
));
14170 error_found
= true;
14172 else if (TREE_TYPE (TYPE_BINFO (t
)) != TYPE_MAIN_VARIANT (t
))
14174 error ("%<TYPE_BINFO%> type is not %<TYPE_MAIN_VARIANT%>");
14175 debug_tree (TREE_TYPE (TYPE_BINFO (t
)));
14176 error_found
= true;
14179 else if (FUNC_OR_METHOD_TYPE_P (t
))
14181 if (TYPE_METHOD_BASETYPE (t
)
14182 && TREE_CODE (TYPE_METHOD_BASETYPE (t
)) != RECORD_TYPE
14183 && TREE_CODE (TYPE_METHOD_BASETYPE (t
)) != UNION_TYPE
)
14185 error ("%<TYPE_METHOD_BASETYPE%> is not record nor union");
14186 debug_tree (TYPE_METHOD_BASETYPE (t
));
14187 error_found
= true;
14190 else if (TREE_CODE (t
) == OFFSET_TYPE
)
14192 if (TYPE_OFFSET_BASETYPE (t
)
14193 && TREE_CODE (TYPE_OFFSET_BASETYPE (t
)) != RECORD_TYPE
14194 && TREE_CODE (TYPE_OFFSET_BASETYPE (t
)) != UNION_TYPE
)
14196 error ("%<TYPE_OFFSET_BASETYPE%> is not record nor union");
14197 debug_tree (TYPE_OFFSET_BASETYPE (t
));
14198 error_found
= true;
14201 else if (INTEGRAL_TYPE_P (t
) || SCALAR_FLOAT_TYPE_P (t
)
14202 || FIXED_POINT_TYPE_P (t
))
14204 /* FIXME: The following check should pass:
14205 useless_type_conversion_p (const_cast <tree> (t),
14206 TREE_TYPE (TYPE_MAX_VALUE (t))
14207 but does not for C sizetypes in LTO. */
14209 else if (TREE_CODE (t
) == ARRAY_TYPE
)
14211 if (TYPE_ARRAY_MAX_SIZE (t
)
14212 && TREE_CODE (TYPE_ARRAY_MAX_SIZE (t
)) != INTEGER_CST
)
14214 error ("%<TYPE_ARRAY_MAX_SIZE%> not %<INTEGER_CST%>");
14215 debug_tree (TYPE_ARRAY_MAX_SIZE (t
));
14216 error_found
= true;
14219 else if (TYPE_MAX_VALUE_RAW (t
))
14221 error ("%<TYPE_MAX_VALUE_RAW%> non-NULL");
14222 debug_tree (TYPE_MAX_VALUE_RAW (t
));
14223 error_found
= true;
14226 if (TYPE_LANG_SLOT_1 (t
) && in_lto_p
)
14228 error ("%<TYPE_LANG_SLOT_1 (binfo)%> field is non-NULL");
14229 debug_tree (TYPE_LANG_SLOT_1 (t
));
14230 error_found
= true;
14233 /* Check various uses of TYPE_VALUES_RAW. */
14234 if (TREE_CODE (t
) == ENUMERAL_TYPE
)
14235 for (tree l
= TYPE_VALUES (t
); l
; l
= TREE_CHAIN (l
))
14237 tree value
= TREE_VALUE (l
);
14238 tree name
= TREE_PURPOSE (l
);
14240 /* C FE porduce INTEGER_CST of INTEGER_TYPE, while C++ FE uses
14241 CONST_DECL of ENUMERAL TYPE. */
14242 if (TREE_CODE (value
) != INTEGER_CST
&& TREE_CODE (value
) != CONST_DECL
)
14244 error ("enum value is not %<CONST_DECL%> or %<INTEGER_CST%>");
14245 debug_tree (value
);
14247 error_found
= true;
14249 if (TREE_CODE (TREE_TYPE (value
)) != INTEGER_TYPE
14250 && TREE_CODE (TREE_TYPE (value
)) != BOOLEAN_TYPE
14251 && !useless_type_conversion_p (const_cast <tree
> (t
), TREE_TYPE (value
)))
14253 error ("enum value type is not %<INTEGER_TYPE%> nor convertible "
14255 debug_tree (value
);
14257 error_found
= true;
14259 if (TREE_CODE (name
) != IDENTIFIER_NODE
)
14261 error ("enum value name is not %<IDENTIFIER_NODE%>");
14262 debug_tree (value
);
14264 error_found
= true;
14267 else if (TREE_CODE (t
) == ARRAY_TYPE
)
14269 if (TYPE_DOMAIN (t
) && TREE_CODE (TYPE_DOMAIN (t
)) != INTEGER_TYPE
)
14271 error ("array %<TYPE_DOMAIN%> is not integer type");
14272 debug_tree (TYPE_DOMAIN (t
));
14273 error_found
= true;
14276 else if (RECORD_OR_UNION_TYPE_P (t
))
14278 if (TYPE_FIELDS (t
) && !COMPLETE_TYPE_P (t
) && in_lto_p
)
14280 error ("%<TYPE_FIELDS%> defined in incomplete type");
14281 error_found
= true;
14283 for (tree fld
= TYPE_FIELDS (t
); fld
; fld
= TREE_CHAIN (fld
))
14285 /* TODO: verify properties of decls. */
14286 if (TREE_CODE (fld
) == FIELD_DECL
)
14288 else if (TREE_CODE (fld
) == TYPE_DECL
)
14290 else if (TREE_CODE (fld
) == CONST_DECL
)
14292 else if (VAR_P (fld
))
14294 else if (TREE_CODE (fld
) == TEMPLATE_DECL
)
14296 else if (TREE_CODE (fld
) == USING_DECL
)
14298 else if (TREE_CODE (fld
) == FUNCTION_DECL
)
14302 error ("wrong tree in %<TYPE_FIELDS%> list");
14304 error_found
= true;
14308 else if (TREE_CODE (t
) == INTEGER_TYPE
14309 || TREE_CODE (t
) == BOOLEAN_TYPE
14310 || TREE_CODE (t
) == BITINT_TYPE
14311 || TREE_CODE (t
) == OFFSET_TYPE
14312 || TREE_CODE (t
) == REFERENCE_TYPE
14313 || TREE_CODE (t
) == NULLPTR_TYPE
14314 || TREE_CODE (t
) == POINTER_TYPE
)
14316 if (TYPE_CACHED_VALUES_P (t
) != (TYPE_CACHED_VALUES (t
) != NULL
))
14318 error ("%<TYPE_CACHED_VALUES_P%> is %i while %<TYPE_CACHED_VALUES%> "
14320 TYPE_CACHED_VALUES_P (t
), (void *)TYPE_CACHED_VALUES (t
));
14321 error_found
= true;
14323 else if (TYPE_CACHED_VALUES_P (t
) && TREE_CODE (TYPE_CACHED_VALUES (t
)) != TREE_VEC
)
14325 error ("%<TYPE_CACHED_VALUES%> is not %<TREE_VEC%>");
14326 debug_tree (TYPE_CACHED_VALUES (t
));
14327 error_found
= true;
14329 /* Verify just enough of cache to ensure that no one copied it to new type.
14330 All copying should go by copy_node that should clear it. */
14331 else if (TYPE_CACHED_VALUES_P (t
))
14334 for (i
= 0; i
< TREE_VEC_LENGTH (TYPE_CACHED_VALUES (t
)); i
++)
14335 if (TREE_VEC_ELT (TYPE_CACHED_VALUES (t
), i
)
14336 && TREE_TYPE (TREE_VEC_ELT (TYPE_CACHED_VALUES (t
), i
)) != t
)
14338 error ("wrong %<TYPE_CACHED_VALUES%> entry");
14339 debug_tree (TREE_VEC_ELT (TYPE_CACHED_VALUES (t
), i
));
14340 error_found
= true;
14345 else if (FUNC_OR_METHOD_TYPE_P (t
))
14346 for (tree l
= TYPE_ARG_TYPES (t
); l
; l
= TREE_CHAIN (l
))
14348 /* C++ FE uses TREE_PURPOSE to store initial values. */
14349 if (TREE_PURPOSE (l
) && in_lto_p
)
14351 error ("%<TREE_PURPOSE%> is non-NULL in %<TYPE_ARG_TYPES%> list");
14353 error_found
= true;
14355 if (!TYPE_P (TREE_VALUE (l
)))
14357 error ("wrong entry in %<TYPE_ARG_TYPES%> list");
14359 error_found
= true;
14362 else if (!is_lang_specific (t
) && TYPE_VALUES_RAW (t
))
14364 error ("%<TYPE_VALUES_RAW%> field is non-NULL");
14365 debug_tree (TYPE_VALUES_RAW (t
));
14366 error_found
= true;
14368 if (TREE_CODE (t
) != INTEGER_TYPE
14369 && TREE_CODE (t
) != BOOLEAN_TYPE
14370 && TREE_CODE (t
) != BITINT_TYPE
14371 && TREE_CODE (t
) != OFFSET_TYPE
14372 && TREE_CODE (t
) != REFERENCE_TYPE
14373 && TREE_CODE (t
) != NULLPTR_TYPE
14374 && TREE_CODE (t
) != POINTER_TYPE
14375 && TYPE_CACHED_VALUES_P (t
))
14377 error ("%<TYPE_CACHED_VALUES_P%> is set while it should not be");
14378 error_found
= true;
14381 /* ipa-devirt makes an assumption that TYPE_METHOD_BASETYPE is always
14382 TYPE_MAIN_VARIANT and it would be odd to add methods only to variatns
14384 if (TREE_CODE (t
) == METHOD_TYPE
14385 && TYPE_MAIN_VARIANT (TYPE_METHOD_BASETYPE (t
)) != TYPE_METHOD_BASETYPE (t
))
14387 error ("%<TYPE_METHOD_BASETYPE%> is not main variant");
14388 error_found
= true;
14393 debug_tree (const_cast <tree
> (t
));
14394 internal_error ("%qs failed", __func__
);
14399 /* Return 1 if ARG interpreted as signed in its precision is known to be
14400 always positive or 2 if ARG is known to be always negative, or 3 if
14401 ARG may be positive or negative. */
14404 get_range_pos_neg (tree arg
)
14406 if (arg
== error_mark_node
)
14409 int prec
= TYPE_PRECISION (TREE_TYPE (arg
));
14411 if (TREE_CODE (arg
) == INTEGER_CST
)
14413 wide_int w
= wi::sext (wi::to_wide (arg
), prec
);
14419 while (CONVERT_EXPR_P (arg
)
14420 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (arg
, 0)))
14421 && TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (arg
, 0))) <= prec
)
14423 arg
= TREE_OPERAND (arg
, 0);
14424 /* Narrower value zero extended into wider type
14425 will always result in positive values. */
14426 if (TYPE_UNSIGNED (TREE_TYPE (arg
))
14427 && TYPE_PRECISION (TREE_TYPE (arg
)) < prec
)
14429 prec
= TYPE_PRECISION (TREE_TYPE (arg
));
14434 if (TREE_CODE (arg
) != SSA_NAME
)
14437 while (!get_global_range_query ()->range_of_expr (r
, arg
)
14438 || r
.undefined_p () || r
.varying_p ())
14440 gimple
*g
= SSA_NAME_DEF_STMT (arg
);
14441 if (is_gimple_assign (g
)
14442 && CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (g
)))
14444 tree t
= gimple_assign_rhs1 (g
);
14445 if (INTEGRAL_TYPE_P (TREE_TYPE (t
))
14446 && TYPE_PRECISION (TREE_TYPE (t
)) <= prec
)
14448 if (TYPE_UNSIGNED (TREE_TYPE (t
))
14449 && TYPE_PRECISION (TREE_TYPE (t
)) < prec
)
14451 prec
= TYPE_PRECISION (TREE_TYPE (t
));
14460 if (TYPE_UNSIGNED (TREE_TYPE (arg
)))
14462 /* For unsigned values, the "positive" range comes
14463 below the "negative" range. */
14464 if (!wi::neg_p (wi::sext (r
.upper_bound (), prec
), SIGNED
))
14466 if (wi::neg_p (wi::sext (r
.lower_bound (), prec
), SIGNED
))
14471 if (!wi::neg_p (wi::sext (r
.lower_bound (), prec
), SIGNED
))
14473 if (wi::neg_p (wi::sext (r
.upper_bound (), prec
), SIGNED
))
14482 /* Return true if ARG is marked with the nonnull attribute in the
14483 current function signature. */
14486 nonnull_arg_p (const_tree arg
)
14488 tree t
, attrs
, fntype
;
14489 unsigned HOST_WIDE_INT arg_num
;
14491 gcc_assert (TREE_CODE (arg
) == PARM_DECL
14492 && (POINTER_TYPE_P (TREE_TYPE (arg
))
14493 || TREE_CODE (TREE_TYPE (arg
)) == OFFSET_TYPE
));
14495 /* The static chain decl is always non null. */
14496 if (arg
== cfun
->static_chain_decl
)
14499 /* THIS argument of method is always non-NULL. */
14500 if (TREE_CODE (TREE_TYPE (cfun
->decl
)) == METHOD_TYPE
14501 && arg
== DECL_ARGUMENTS (cfun
->decl
)
14502 && flag_delete_null_pointer_checks
)
14505 /* Values passed by reference are always non-NULL. */
14506 if (TREE_CODE (TREE_TYPE (arg
)) == REFERENCE_TYPE
14507 && flag_delete_null_pointer_checks
)
14510 fntype
= TREE_TYPE (cfun
->decl
);
14511 for (attrs
= TYPE_ATTRIBUTES (fntype
); attrs
; attrs
= TREE_CHAIN (attrs
))
14513 attrs
= lookup_attribute ("nonnull", attrs
);
14515 /* If "nonnull" wasn't specified, we know nothing about the argument. */
14516 if (attrs
== NULL_TREE
)
14519 /* If "nonnull" applies to all the arguments, then ARG is non-null. */
14520 if (TREE_VALUE (attrs
) == NULL_TREE
)
14523 /* Get the position number for ARG in the function signature. */
14524 for (arg_num
= 1, t
= DECL_ARGUMENTS (cfun
->decl
);
14526 t
= DECL_CHAIN (t
), arg_num
++)
14532 gcc_assert (t
== arg
);
14534 /* Now see if ARG_NUM is mentioned in the nonnull list. */
14535 for (t
= TREE_VALUE (attrs
); t
; t
= TREE_CHAIN (t
))
14537 if (compare_tree_int (TREE_VALUE (t
), arg_num
) == 0)
14545 /* Combine LOC and BLOCK to a combined adhoc loc, retaining any range
14549 set_block (location_t loc
, tree block
)
14551 location_t pure_loc
= get_pure_location (loc
);
14552 source_range src_range
= get_range_from_loc (line_table
, loc
);
14553 unsigned discriminator
= get_discriminator_from_loc (line_table
, loc
);
14554 return line_table
->get_or_create_combined_loc (pure_loc
, src_range
, block
,
14559 set_source_range (tree expr
, location_t start
, location_t finish
)
14561 source_range src_range
;
14562 src_range
.m_start
= start
;
14563 src_range
.m_finish
= finish
;
14564 return set_source_range (expr
, src_range
);
14568 set_source_range (tree expr
, source_range src_range
)
14570 if (!EXPR_P (expr
))
14571 return UNKNOWN_LOCATION
;
14573 location_t expr_location
= EXPR_LOCATION (expr
);
14574 location_t pure_loc
= get_pure_location (expr_location
);
14575 unsigned discriminator
= get_discriminator_from_loc (expr_location
);
14576 location_t adhoc
= line_table
->get_or_create_combined_loc (pure_loc
,
14580 SET_EXPR_LOCATION (expr
, adhoc
);
14584 /* Return EXPR, potentially wrapped with a node expression LOC,
14585 if !CAN_HAVE_LOCATION_P (expr).
14587 NON_LVALUE_EXPR is used for wrapping constants, apart from STRING_CST.
14588 VIEW_CONVERT_EXPR is used for wrapping non-constants and STRING_CST.
14590 Wrapper nodes can be identified using location_wrapper_p. */
14593 maybe_wrap_with_location (tree expr
, location_t loc
)
14597 if (loc
== UNKNOWN_LOCATION
)
14599 if (CAN_HAVE_LOCATION_P (expr
))
14601 /* We should only be adding wrappers for constants and for decls,
14602 or for some exceptional tree nodes (e.g. BASELINK in the C++ FE). */
14603 gcc_assert (CONSTANT_CLASS_P (expr
)
14605 || EXCEPTIONAL_CLASS_P (expr
));
14607 /* For now, don't add wrappers to exceptional tree nodes, to minimize
14608 any impact of the wrapper nodes. */
14609 if (EXCEPTIONAL_CLASS_P (expr
) || error_operand_p (expr
))
14612 /* Compiler-generated temporary variables don't need a wrapper. */
14613 if (DECL_P (expr
) && DECL_ARTIFICIAL (expr
) && DECL_IGNORED_P (expr
))
14616 /* If any auto_suppress_location_wrappers are active, don't create
14618 if (suppress_location_wrappers
> 0)
14622 = (((CONSTANT_CLASS_P (expr
) && TREE_CODE (expr
) != STRING_CST
)
14623 || (TREE_CODE (expr
) == CONST_DECL
&& !TREE_STATIC (expr
)))
14624 ? NON_LVALUE_EXPR
: VIEW_CONVERT_EXPR
);
14625 tree wrapper
= build1_loc (loc
, code
, TREE_TYPE (expr
), expr
);
14626 /* Mark this node as being a wrapper. */
14627 EXPR_LOCATION_WRAPPER_P (wrapper
) = 1;
14631 int suppress_location_wrappers
;
14633 /* Return the name of combined function FN, for debugging purposes. */
14636 combined_fn_name (combined_fn fn
)
14638 if (builtin_fn_p (fn
))
14640 tree fndecl
= builtin_decl_explicit (as_builtin_fn (fn
));
14641 return IDENTIFIER_POINTER (DECL_NAME (fndecl
));
14644 return internal_fn_name (as_internal_fn (fn
));
14647 /* Return a bitmap with a bit set corresponding to each argument in
14648 a function call type FNTYPE declared with attribute nonnull,
14649 or null if none of the function's argument are nonnull. The caller
14650 must free the bitmap. */
14653 get_nonnull_args (const_tree fntype
)
14655 if (fntype
== NULL_TREE
)
14658 bitmap argmap
= NULL
;
14659 if (TREE_CODE (fntype
) == METHOD_TYPE
)
14661 /* The this pointer in C++ non-static member functions is
14662 implicitly nonnull whether or not it's declared as such. */
14663 argmap
= BITMAP_ALLOC (NULL
);
14664 bitmap_set_bit (argmap
, 0);
14667 tree attrs
= TYPE_ATTRIBUTES (fntype
);
14671 /* A function declaration can specify multiple attribute nonnull,
14672 each with zero or more arguments. The loop below creates a bitmap
14673 representing a union of all the arguments. An empty (but non-null)
14674 bitmap means that all arguments have been declaraed nonnull. */
14675 for ( ; attrs
; attrs
= TREE_CHAIN (attrs
))
14677 attrs
= lookup_attribute ("nonnull", attrs
);
14682 argmap
= BITMAP_ALLOC (NULL
);
14684 if (!TREE_VALUE (attrs
))
14686 /* Clear the bitmap in case a previous attribute nonnull
14687 set it and this one overrides it for all arguments. */
14688 bitmap_clear (argmap
);
14692 /* Iterate over the indices of the format arguments declared nonnull
14693 and set a bit for each. */
14694 for (tree idx
= TREE_VALUE (attrs
); idx
; idx
= TREE_CHAIN (idx
))
14696 unsigned int val
= TREE_INT_CST_LOW (TREE_VALUE (idx
)) - 1;
14697 bitmap_set_bit (argmap
, val
);
14704 /* Returns true if TYPE is a type where it and all of its subobjects
14705 (recursively) are of structure, union, or array type. */
14708 is_empty_type (const_tree type
)
14710 if (RECORD_OR_UNION_TYPE_P (type
))
14712 for (tree field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
14713 if (TREE_CODE (field
) == FIELD_DECL
14714 && !DECL_PADDING_P (field
)
14715 && !is_empty_type (TREE_TYPE (field
)))
14719 else if (TREE_CODE (type
) == ARRAY_TYPE
)
14720 return (integer_minus_onep (array_type_nelts (type
))
14721 || TYPE_DOMAIN (type
) == NULL_TREE
14722 || is_empty_type (TREE_TYPE (type
)));
14726 /* Implement TARGET_EMPTY_RECORD_P. Return true if TYPE is an empty type
14727 that shouldn't be passed via stack. */
14730 default_is_empty_record (const_tree type
)
14732 if (!abi_version_at_least (12))
14735 if (type
== error_mark_node
)
14738 if (TREE_ADDRESSABLE (type
))
14741 return is_empty_type (TYPE_MAIN_VARIANT (type
));
14744 /* Determine whether TYPE is a structure with a flexible array member,
14745 or a union containing such a structure (possibly recursively). */
14748 flexible_array_type_p (const_tree type
)
14751 switch (TREE_CODE (type
))
14755 for (x
= TYPE_FIELDS (type
); x
!= NULL_TREE
; x
= DECL_CHAIN (x
))
14756 if (TREE_CODE (x
) == FIELD_DECL
)
14758 if (last
== NULL_TREE
)
14760 if (TREE_CODE (TREE_TYPE (last
)) == ARRAY_TYPE
14761 && TYPE_SIZE (TREE_TYPE (last
)) == NULL_TREE
14762 && TYPE_DOMAIN (TREE_TYPE (last
)) != NULL_TREE
14763 && TYPE_MAX_VALUE (TYPE_DOMAIN (TREE_TYPE (last
))) == NULL_TREE
)
14767 for (x
= TYPE_FIELDS (type
); x
!= NULL_TREE
; x
= DECL_CHAIN (x
))
14769 if (TREE_CODE (x
) == FIELD_DECL
14770 && flexible_array_type_p (TREE_TYPE (x
)))
14779 /* Like int_size_in_bytes, but handle empty records specially. */
14782 arg_int_size_in_bytes (const_tree type
)
14784 return TYPE_EMPTY_P (type
) ? 0 : int_size_in_bytes (type
);
14787 /* Like size_in_bytes, but handle empty records specially. */
14790 arg_size_in_bytes (const_tree type
)
14792 return TYPE_EMPTY_P (type
) ? size_zero_node
: size_in_bytes (type
);
14795 /* Return true if an expression with CODE has to have the same result type as
14796 its first operand. */
14799 expr_type_first_operand_type_p (tree_code code
)
14812 case TRUNC_DIV_EXPR
:
14813 case CEIL_DIV_EXPR
:
14814 case FLOOR_DIV_EXPR
:
14815 case ROUND_DIV_EXPR
:
14816 case TRUNC_MOD_EXPR
:
14817 case CEIL_MOD_EXPR
:
14818 case FLOOR_MOD_EXPR
:
14819 case ROUND_MOD_EXPR
:
14821 case EXACT_DIV_EXPR
:
14839 /* Return a typenode for the "standard" C type with a given name. */
14841 get_typenode_from_name (const char *name
)
14843 if (name
== NULL
|| *name
== '\0')
14846 if (strcmp (name
, "char") == 0)
14847 return char_type_node
;
14848 if (strcmp (name
, "unsigned char") == 0)
14849 return unsigned_char_type_node
;
14850 if (strcmp (name
, "signed char") == 0)
14851 return signed_char_type_node
;
14853 if (strcmp (name
, "short int") == 0)
14854 return short_integer_type_node
;
14855 if (strcmp (name
, "short unsigned int") == 0)
14856 return short_unsigned_type_node
;
14858 if (strcmp (name
, "int") == 0)
14859 return integer_type_node
;
14860 if (strcmp (name
, "unsigned int") == 0)
14861 return unsigned_type_node
;
14863 if (strcmp (name
, "long int") == 0)
14864 return long_integer_type_node
;
14865 if (strcmp (name
, "long unsigned int") == 0)
14866 return long_unsigned_type_node
;
14868 if (strcmp (name
, "long long int") == 0)
14869 return long_long_integer_type_node
;
14870 if (strcmp (name
, "long long unsigned int") == 0)
14871 return long_long_unsigned_type_node
;
14873 gcc_unreachable ();
14876 /* List of pointer types used to declare builtins before we have seen their
14879 Keep the size up to date in tree.h ! */
14880 const builtin_structptr_type builtin_structptr_types
[6] =
14882 { fileptr_type_node
, ptr_type_node
, "FILE" },
14883 { const_tm_ptr_type_node
, const_ptr_type_node
, "tm" },
14884 { fenv_t_ptr_type_node
, ptr_type_node
, "fenv_t" },
14885 { const_fenv_t_ptr_type_node
, const_ptr_type_node
, "fenv_t" },
14886 { fexcept_t_ptr_type_node
, ptr_type_node
, "fexcept_t" },
14887 { const_fexcept_t_ptr_type_node
, const_ptr_type_node
, "fexcept_t" }
14890 /* Return the maximum object size. */
14893 max_object_size (void)
14895 /* To do: Make this a configurable parameter. */
14896 return TYPE_MAX_VALUE (ptrdiff_type_node
);
14899 /* A wrapper around TARGET_VERIFY_TYPE_CONTEXT that makes the silent_p
14900 parameter default to false and that weeds out error_mark_node. */
14903 verify_type_context (location_t loc
, type_context_kind context
,
14904 const_tree type
, bool silent_p
)
14906 if (type
== error_mark_node
)
14909 gcc_assert (TYPE_P (type
));
14910 return (!targetm
.verify_type_context
14911 || targetm
.verify_type_context (loc
, context
, type
, silent_p
));
14914 /* Return true if NEW_ASM and DELETE_ASM name a valid pair of new and
14915 delete operators. Return false if they may or may not name such
14916 a pair and, when nonnull, set *PCERTAIN to true if they certainly
14920 valid_new_delete_pair_p (tree new_asm
, tree delete_asm
,
14921 bool *pcertain
/* = NULL */)
14925 pcertain
= &certain
;
14927 const char *new_name
= IDENTIFIER_POINTER (new_asm
);
14928 const char *delete_name
= IDENTIFIER_POINTER (delete_asm
);
14929 unsigned int new_len
= IDENTIFIER_LENGTH (new_asm
);
14930 unsigned int delete_len
= IDENTIFIER_LENGTH (delete_asm
);
14932 /* The following failures are due to invalid names so they're not
14933 considered certain mismatches. */
14936 if (new_len
< 5 || delete_len
< 6)
14938 if (new_name
[0] == '_')
14939 ++new_name
, --new_len
;
14940 if (new_name
[0] == '_')
14941 ++new_name
, --new_len
;
14942 if (delete_name
[0] == '_')
14943 ++delete_name
, --delete_len
;
14944 if (delete_name
[0] == '_')
14945 ++delete_name
, --delete_len
;
14946 if (new_len
< 4 || delete_len
< 5)
14949 /* The following failures are due to names of user-defined operators
14950 so they're also not considered certain mismatches. */
14952 /* *_len is now just the length after initial underscores. */
14953 if (new_name
[0] != 'Z' || new_name
[1] != 'n')
14955 if (delete_name
[0] != 'Z' || delete_name
[1] != 'd')
14958 /* The following failures are certain mismatches. */
14961 /* _Znw must match _Zdl, _Zna must match _Zda. */
14962 if ((new_name
[2] != 'w' || delete_name
[2] != 'l')
14963 && (new_name
[2] != 'a' || delete_name
[2] != 'a'))
14965 /* 'j', 'm' and 'y' correspond to size_t. */
14966 if (new_name
[3] != 'j' && new_name
[3] != 'm' && new_name
[3] != 'y')
14968 if (delete_name
[3] != 'P' || delete_name
[4] != 'v')
14971 || (new_len
== 18 && !memcmp (new_name
+ 4, "RKSt9nothrow_t", 14)))
14973 /* _ZnXY or _ZnXYRKSt9nothrow_t matches
14974 _ZdXPv, _ZdXPvY and _ZdXPvRKSt9nothrow_t. */
14975 if (delete_len
== 5)
14977 if (delete_len
== 6 && delete_name
[5] == new_name
[3])
14979 if (delete_len
== 19 && !memcmp (delete_name
+ 5, "RKSt9nothrow_t", 14))
14982 else if ((new_len
== 19 && !memcmp (new_name
+ 4, "St11align_val_t", 15))
14984 && !memcmp (new_name
+ 4, "St11align_val_tRKSt9nothrow_t", 29)))
14986 /* _ZnXYSt11align_val_t or _ZnXYSt11align_val_tRKSt9nothrow_t matches
14987 _ZdXPvSt11align_val_t or _ZdXPvYSt11align_val_t or or
14988 _ZdXPvSt11align_val_tRKSt9nothrow_t. */
14989 if (delete_len
== 20 && !memcmp (delete_name
+ 5, "St11align_val_t", 15))
14991 if (delete_len
== 21
14992 && delete_name
[5] == new_name
[3]
14993 && !memcmp (delete_name
+ 6, "St11align_val_t", 15))
14995 if (delete_len
== 34
14996 && !memcmp (delete_name
+ 5, "St11align_val_tRKSt9nothrow_t", 29))
15000 /* The negative result is conservative. */
15005 /* Return the zero-based number corresponding to the argument being
15006 deallocated if FNDECL is a deallocation function or an out-of-bounds
15007 value if it isn't. */
15010 fndecl_dealloc_argno (tree fndecl
)
15012 /* A call to operator delete isn't recognized as one to a built-in. */
15013 if (DECL_IS_OPERATOR_DELETE_P (fndecl
))
15015 if (DECL_IS_REPLACEABLE_OPERATOR (fndecl
))
15018 /* Avoid placement delete that's not been inlined. */
15019 tree fname
= DECL_ASSEMBLER_NAME (fndecl
);
15020 if (id_equal (fname
, "_ZdlPvS_") // ordinary form
15021 || id_equal (fname
, "_ZdaPvS_")) // array form
15026 /* TODO: Handle user-defined functions with attribute malloc? Handle
15027 known non-built-ins like fopen? */
15028 if (fndecl_built_in_p (fndecl
, BUILT_IN_NORMAL
))
15030 switch (DECL_FUNCTION_CODE (fndecl
))
15032 case BUILT_IN_FREE
:
15033 case BUILT_IN_REALLOC
:
15034 case BUILT_IN_GOMP_FREE
:
15035 case BUILT_IN_GOMP_REALLOC
:
15043 tree attrs
= DECL_ATTRIBUTES (fndecl
);
15047 for (tree atfree
= attrs
;
15048 (atfree
= lookup_attribute ("*dealloc", atfree
));
15049 atfree
= TREE_CHAIN (atfree
))
15051 tree alloc
= TREE_VALUE (atfree
);
15055 tree pos
= TREE_CHAIN (alloc
);
15059 pos
= TREE_VALUE (pos
);
15060 return TREE_INT_CST_LOW (pos
) - 1;
15066 /* If EXPR refers to a character array or pointer declared attribute
15067 nonstring, return a decl for that array or pointer and set *REF
15068 to the referenced enclosing object or pointer. Otherwise return
15072 get_attr_nonstring_decl (tree expr
, tree
*ref
)
15075 tree var
= NULL_TREE
;
15076 if (TREE_CODE (decl
) == SSA_NAME
)
15078 gimple
*def
= SSA_NAME_DEF_STMT (decl
);
15080 if (is_gimple_assign (def
))
15082 tree_code code
= gimple_assign_rhs_code (def
);
15083 if (code
== ADDR_EXPR
15084 || code
== COMPONENT_REF
15085 || code
== VAR_DECL
)
15086 decl
= gimple_assign_rhs1 (def
);
15089 var
= SSA_NAME_VAR (decl
);
15092 if (TREE_CODE (decl
) == ADDR_EXPR
)
15093 decl
= TREE_OPERAND (decl
, 0);
15095 /* To simplify calling code, store the referenced DECL regardless of
15096 the attribute determined below, but avoid storing the SSA_NAME_VAR
15097 obtained above (it's not useful for dataflow purposes). */
15101 /* Use the SSA_NAME_VAR that was determined above to see if it's
15102 declared nonstring. Otherwise drill down into the referenced
15106 else if (TREE_CODE (decl
) == ARRAY_REF
)
15107 decl
= TREE_OPERAND (decl
, 0);
15108 else if (TREE_CODE (decl
) == COMPONENT_REF
)
15109 decl
= TREE_OPERAND (decl
, 1);
15110 else if (TREE_CODE (decl
) == MEM_REF
)
15111 return get_attr_nonstring_decl (TREE_OPERAND (decl
, 0), ref
);
15114 && lookup_attribute ("nonstring", DECL_ATTRIBUTES (decl
)))
15120 /* Return length of attribute names string,
15121 if arglist chain > 1, -1 otherwise. */
15124 get_target_clone_attr_len (tree arglist
)
15127 int str_len_sum
= 0;
15130 for (arg
= arglist
; arg
; arg
= TREE_CHAIN (arg
))
15132 const char *str
= TREE_STRING_POINTER (TREE_VALUE (arg
));
15133 size_t len
= strlen (str
);
15134 str_len_sum
+= len
+ 1;
15135 for (const char *p
= strchr (str
, ','); p
; p
= strchr (p
+ 1, ','))
15141 return str_len_sum
;
15145 tree_cc_finalize (void)
15147 clear_nonstandard_integer_type_cache ();
15148 vec_free (bitint_type_cache
);
15153 namespace selftest
{
15155 /* Selftests for tree. */
15157 /* Verify that integer constants are sane. */
15160 test_integer_constants ()
15162 ASSERT_TRUE (integer_type_node
!= NULL
);
15163 ASSERT_TRUE (build_int_cst (integer_type_node
, 0) != NULL
);
15165 tree type
= integer_type_node
;
15167 tree zero
= build_zero_cst (type
);
15168 ASSERT_EQ (INTEGER_CST
, TREE_CODE (zero
));
15169 ASSERT_EQ (type
, TREE_TYPE (zero
));
15171 tree one
= build_int_cst (type
, 1);
15172 ASSERT_EQ (INTEGER_CST
, TREE_CODE (one
));
15173 ASSERT_EQ (type
, TREE_TYPE (zero
));
15176 /* Verify identifiers. */
15179 test_identifiers ()
15181 tree identifier
= get_identifier ("foo");
15182 ASSERT_EQ (3, IDENTIFIER_LENGTH (identifier
));
15183 ASSERT_STREQ ("foo", IDENTIFIER_POINTER (identifier
));
15186 /* Verify LABEL_DECL. */
15191 tree identifier
= get_identifier ("err");
15192 tree label_decl
= build_decl (UNKNOWN_LOCATION
, LABEL_DECL
,
15193 identifier
, void_type_node
);
15194 ASSERT_EQ (-1, LABEL_DECL_UID (label_decl
));
15195 ASSERT_FALSE (FORCED_LABEL (label_decl
));
15198 /* Return a new VECTOR_CST node whose type is TYPE and whose values
15199 are given by VALS. */
15202 build_vector (tree type
, const vec
<tree
> &vals MEM_STAT_DECL
)
15204 gcc_assert (known_eq (vals
.length (), TYPE_VECTOR_SUBPARTS (type
)));
15205 tree_vector_builder
builder (type
, vals
.length (), 1);
15206 builder
.splice (vals
);
15207 return builder
.build ();
15210 /* Check that VECTOR_CST ACTUAL contains the elements in EXPECTED. */
15213 check_vector_cst (const vec
<tree
> &expected
, tree actual
)
15215 ASSERT_KNOWN_EQ (expected
.length (),
15216 TYPE_VECTOR_SUBPARTS (TREE_TYPE (actual
)));
15217 for (unsigned int i
= 0; i
< expected
.length (); ++i
)
15218 ASSERT_EQ (wi::to_wide (expected
[i
]),
15219 wi::to_wide (vector_cst_elt (actual
, i
)));
15222 /* Check that VECTOR_CST ACTUAL contains NPATTERNS duplicated elements,
15223 and that its elements match EXPECTED. */
15226 check_vector_cst_duplicate (const vec
<tree
> &expected
, tree actual
,
15227 unsigned int npatterns
)
15229 ASSERT_EQ (npatterns
, VECTOR_CST_NPATTERNS (actual
));
15230 ASSERT_EQ (1, VECTOR_CST_NELTS_PER_PATTERN (actual
));
15231 ASSERT_EQ (npatterns
, vector_cst_encoded_nelts (actual
));
15232 ASSERT_TRUE (VECTOR_CST_DUPLICATE_P (actual
));
15233 ASSERT_FALSE (VECTOR_CST_STEPPED_P (actual
));
15234 check_vector_cst (expected
, actual
);
15237 /* Check that VECTOR_CST ACTUAL contains NPATTERNS foreground elements
15238 and NPATTERNS background elements, and that its elements match
15242 check_vector_cst_fill (const vec
<tree
> &expected
, tree actual
,
15243 unsigned int npatterns
)
15245 ASSERT_EQ (npatterns
, VECTOR_CST_NPATTERNS (actual
));
15246 ASSERT_EQ (2, VECTOR_CST_NELTS_PER_PATTERN (actual
));
15247 ASSERT_EQ (2 * npatterns
, vector_cst_encoded_nelts (actual
));
15248 ASSERT_FALSE (VECTOR_CST_DUPLICATE_P (actual
));
15249 ASSERT_FALSE (VECTOR_CST_STEPPED_P (actual
));
15250 check_vector_cst (expected
, actual
);
15253 /* Check that VECTOR_CST ACTUAL contains NPATTERNS stepped patterns,
15254 and that its elements match EXPECTED. */
15257 check_vector_cst_stepped (const vec
<tree
> &expected
, tree actual
,
15258 unsigned int npatterns
)
15260 ASSERT_EQ (npatterns
, VECTOR_CST_NPATTERNS (actual
));
15261 ASSERT_EQ (3, VECTOR_CST_NELTS_PER_PATTERN (actual
));
15262 ASSERT_EQ (3 * npatterns
, vector_cst_encoded_nelts (actual
));
15263 ASSERT_FALSE (VECTOR_CST_DUPLICATE_P (actual
));
15264 ASSERT_TRUE (VECTOR_CST_STEPPED_P (actual
));
15265 check_vector_cst (expected
, actual
);
15268 /* Test the creation of VECTOR_CSTs. */
15271 test_vector_cst_patterns (ALONE_CXX_MEM_STAT_INFO
)
15273 auto_vec
<tree
, 8> elements (8);
15274 elements
.quick_grow (8);
15275 tree element_type
= build_nonstandard_integer_type (16, true);
15276 tree vector_type
= build_vector_type (element_type
, 8);
15278 /* Test a simple linear series with a base of 0 and a step of 1:
15279 { 0, 1, 2, 3, 4, 5, 6, 7 }. */
15280 for (unsigned int i
= 0; i
< 8; ++i
)
15281 elements
[i
] = build_int_cst (element_type
, i
);
15282 tree vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
15283 check_vector_cst_stepped (elements
, vector
, 1);
15285 /* Try the same with the first element replaced by 100:
15286 { 100, 1, 2, 3, 4, 5, 6, 7 }. */
15287 elements
[0] = build_int_cst (element_type
, 100);
15288 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
15289 check_vector_cst_stepped (elements
, vector
, 1);
15291 /* Try a series that wraps around.
15292 { 100, 65531, 65532, 65533, 65534, 65535, 0, 1 }. */
15293 for (unsigned int i
= 1; i
< 8; ++i
)
15294 elements
[i
] = build_int_cst (element_type
, (65530 + i
) & 0xffff);
15295 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
15296 check_vector_cst_stepped (elements
, vector
, 1);
15298 /* Try a downward series:
15299 { 100, 79, 78, 77, 76, 75, 75, 73 }. */
15300 for (unsigned int i
= 1; i
< 8; ++i
)
15301 elements
[i
] = build_int_cst (element_type
, 80 - i
);
15302 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
15303 check_vector_cst_stepped (elements
, vector
, 1);
15305 /* Try two interleaved series with different bases and steps:
15306 { 100, 53, 66, 206, 62, 212, 58, 218 }. */
15307 elements
[1] = build_int_cst (element_type
, 53);
15308 for (unsigned int i
= 2; i
< 8; i
+= 2)
15310 elements
[i
] = build_int_cst (element_type
, 70 - i
* 2);
15311 elements
[i
+ 1] = build_int_cst (element_type
, 200 + i
* 3);
15313 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
15314 check_vector_cst_stepped (elements
, vector
, 2);
15316 /* Try a duplicated value:
15317 { 100, 100, 100, 100, 100, 100, 100, 100 }. */
15318 for (unsigned int i
= 1; i
< 8; ++i
)
15319 elements
[i
] = elements
[0];
15320 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
15321 check_vector_cst_duplicate (elements
, vector
, 1);
15323 /* Try an interleaved duplicated value:
15324 { 100, 55, 100, 55, 100, 55, 100, 55 }. */
15325 elements
[1] = build_int_cst (element_type
, 55);
15326 for (unsigned int i
= 2; i
< 8; ++i
)
15327 elements
[i
] = elements
[i
- 2];
15328 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
15329 check_vector_cst_duplicate (elements
, vector
, 2);
15331 /* Try a duplicated value with 2 exceptions
15332 { 41, 97, 100, 55, 100, 55, 100, 55 }. */
15333 elements
[0] = build_int_cst (element_type
, 41);
15334 elements
[1] = build_int_cst (element_type
, 97);
15335 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
15336 check_vector_cst_fill (elements
, vector
, 2);
15338 /* Try with and without a step
15339 { 41, 97, 100, 21, 100, 35, 100, 49 }. */
15340 for (unsigned int i
= 3; i
< 8; i
+= 2)
15341 elements
[i
] = build_int_cst (element_type
, i
* 7);
15342 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
15343 check_vector_cst_stepped (elements
, vector
, 2);
15345 /* Try a fully-general constant:
15346 { 41, 97, 100, 21, 100, 9990, 100, 49 }. */
15347 elements
[5] = build_int_cst (element_type
, 9990);
15348 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
15349 check_vector_cst_fill (elements
, vector
, 4);
15352 /* Verify that STRIP_NOPS (NODE) is EXPECTED.
15353 Helper function for test_location_wrappers, to deal with STRIP_NOPS
15354 modifying its argument in-place. */
15357 check_strip_nops (tree node
, tree expected
)
15360 ASSERT_EQ (expected
, node
);
15363 /* Verify location wrappers. */
15366 test_location_wrappers ()
15368 location_t loc
= BUILTINS_LOCATION
;
15370 ASSERT_EQ (NULL_TREE
, maybe_wrap_with_location (NULL_TREE
, loc
));
15372 /* Wrapping a constant. */
15373 tree int_cst
= build_int_cst (integer_type_node
, 42);
15374 ASSERT_FALSE (CAN_HAVE_LOCATION_P (int_cst
));
15375 ASSERT_FALSE (location_wrapper_p (int_cst
));
15377 tree wrapped_int_cst
= maybe_wrap_with_location (int_cst
, loc
);
15378 ASSERT_TRUE (location_wrapper_p (wrapped_int_cst
));
15379 ASSERT_EQ (loc
, EXPR_LOCATION (wrapped_int_cst
));
15380 ASSERT_EQ (int_cst
, tree_strip_any_location_wrapper (wrapped_int_cst
));
15382 /* We shouldn't add wrapper nodes for UNKNOWN_LOCATION. */
15383 ASSERT_EQ (int_cst
, maybe_wrap_with_location (int_cst
, UNKNOWN_LOCATION
));
15385 /* We shouldn't add wrapper nodes for nodes that CAN_HAVE_LOCATION_P. */
15386 tree cast
= build1 (NOP_EXPR
, char_type_node
, int_cst
);
15387 ASSERT_TRUE (CAN_HAVE_LOCATION_P (cast
));
15388 ASSERT_EQ (cast
, maybe_wrap_with_location (cast
, loc
));
15390 /* Wrapping a STRING_CST. */
15391 tree string_cst
= build_string (4, "foo");
15392 ASSERT_FALSE (CAN_HAVE_LOCATION_P (string_cst
));
15393 ASSERT_FALSE (location_wrapper_p (string_cst
));
15395 tree wrapped_string_cst
= maybe_wrap_with_location (string_cst
, loc
);
15396 ASSERT_TRUE (location_wrapper_p (wrapped_string_cst
));
15397 ASSERT_EQ (VIEW_CONVERT_EXPR
, TREE_CODE (wrapped_string_cst
));
15398 ASSERT_EQ (loc
, EXPR_LOCATION (wrapped_string_cst
));
15399 ASSERT_EQ (string_cst
, tree_strip_any_location_wrapper (wrapped_string_cst
));
15402 /* Wrapping a variable. */
15403 tree int_var
= build_decl (UNKNOWN_LOCATION
, VAR_DECL
,
15404 get_identifier ("some_int_var"),
15405 integer_type_node
);
15406 ASSERT_FALSE (CAN_HAVE_LOCATION_P (int_var
));
15407 ASSERT_FALSE (location_wrapper_p (int_var
));
15409 tree wrapped_int_var
= maybe_wrap_with_location (int_var
, loc
);
15410 ASSERT_TRUE (location_wrapper_p (wrapped_int_var
));
15411 ASSERT_EQ (loc
, EXPR_LOCATION (wrapped_int_var
));
15412 ASSERT_EQ (int_var
, tree_strip_any_location_wrapper (wrapped_int_var
));
15414 /* Verify that "reinterpret_cast<int>(some_int_var)" is not a location
15416 tree r_cast
= build1 (NON_LVALUE_EXPR
, integer_type_node
, int_var
);
15417 ASSERT_FALSE (location_wrapper_p (r_cast
));
15418 ASSERT_EQ (r_cast
, tree_strip_any_location_wrapper (r_cast
));
15420 /* Verify that STRIP_NOPS removes wrappers. */
15421 check_strip_nops (wrapped_int_cst
, int_cst
);
15422 check_strip_nops (wrapped_string_cst
, string_cst
);
15423 check_strip_nops (wrapped_int_var
, int_var
);
15426 /* Test various tree predicates. Verify that location wrappers don't
15427 affect the results. */
15432 /* Build various constants and wrappers around them. */
15434 location_t loc
= BUILTINS_LOCATION
;
15436 tree i_0
= build_int_cst (integer_type_node
, 0);
15437 tree wr_i_0
= maybe_wrap_with_location (i_0
, loc
);
15439 tree i_1
= build_int_cst (integer_type_node
, 1);
15440 tree wr_i_1
= maybe_wrap_with_location (i_1
, loc
);
15442 tree i_m1
= build_int_cst (integer_type_node
, -1);
15443 tree wr_i_m1
= maybe_wrap_with_location (i_m1
, loc
);
15445 tree f_0
= build_real_from_int_cst (float_type_node
, i_0
);
15446 tree wr_f_0
= maybe_wrap_with_location (f_0
, loc
);
15447 tree f_1
= build_real_from_int_cst (float_type_node
, i_1
);
15448 tree wr_f_1
= maybe_wrap_with_location (f_1
, loc
);
15449 tree f_m1
= build_real_from_int_cst (float_type_node
, i_m1
);
15450 tree wr_f_m1
= maybe_wrap_with_location (f_m1
, loc
);
15452 tree c_i_0
= build_complex (NULL_TREE
, i_0
, i_0
);
15453 tree c_i_1
= build_complex (NULL_TREE
, i_1
, i_0
);
15454 tree c_i_m1
= build_complex (NULL_TREE
, i_m1
, i_0
);
15456 tree c_f_0
= build_complex (NULL_TREE
, f_0
, f_0
);
15457 tree c_f_1
= build_complex (NULL_TREE
, f_1
, f_0
);
15458 tree c_f_m1
= build_complex (NULL_TREE
, f_m1
, f_0
);
15460 /* TODO: vector constants. */
15462 /* Test integer_onep. */
15463 ASSERT_FALSE (integer_onep (i_0
));
15464 ASSERT_FALSE (integer_onep (wr_i_0
));
15465 ASSERT_TRUE (integer_onep (i_1
));
15466 ASSERT_TRUE (integer_onep (wr_i_1
));
15467 ASSERT_FALSE (integer_onep (i_m1
));
15468 ASSERT_FALSE (integer_onep (wr_i_m1
));
15469 ASSERT_FALSE (integer_onep (f_0
));
15470 ASSERT_FALSE (integer_onep (wr_f_0
));
15471 ASSERT_FALSE (integer_onep (f_1
));
15472 ASSERT_FALSE (integer_onep (wr_f_1
));
15473 ASSERT_FALSE (integer_onep (f_m1
));
15474 ASSERT_FALSE (integer_onep (wr_f_m1
));
15475 ASSERT_FALSE (integer_onep (c_i_0
));
15476 ASSERT_TRUE (integer_onep (c_i_1
));
15477 ASSERT_FALSE (integer_onep (c_i_m1
));
15478 ASSERT_FALSE (integer_onep (c_f_0
));
15479 ASSERT_FALSE (integer_onep (c_f_1
));
15480 ASSERT_FALSE (integer_onep (c_f_m1
));
15482 /* Test integer_zerop. */
15483 ASSERT_TRUE (integer_zerop (i_0
));
15484 ASSERT_TRUE (integer_zerop (wr_i_0
));
15485 ASSERT_FALSE (integer_zerop (i_1
));
15486 ASSERT_FALSE (integer_zerop (wr_i_1
));
15487 ASSERT_FALSE (integer_zerop (i_m1
));
15488 ASSERT_FALSE (integer_zerop (wr_i_m1
));
15489 ASSERT_FALSE (integer_zerop (f_0
));
15490 ASSERT_FALSE (integer_zerop (wr_f_0
));
15491 ASSERT_FALSE (integer_zerop (f_1
));
15492 ASSERT_FALSE (integer_zerop (wr_f_1
));
15493 ASSERT_FALSE (integer_zerop (f_m1
));
15494 ASSERT_FALSE (integer_zerop (wr_f_m1
));
15495 ASSERT_TRUE (integer_zerop (c_i_0
));
15496 ASSERT_FALSE (integer_zerop (c_i_1
));
15497 ASSERT_FALSE (integer_zerop (c_i_m1
));
15498 ASSERT_FALSE (integer_zerop (c_f_0
));
15499 ASSERT_FALSE (integer_zerop (c_f_1
));
15500 ASSERT_FALSE (integer_zerop (c_f_m1
));
15502 /* Test integer_all_onesp. */
15503 ASSERT_FALSE (integer_all_onesp (i_0
));
15504 ASSERT_FALSE (integer_all_onesp (wr_i_0
));
15505 ASSERT_FALSE (integer_all_onesp (i_1
));
15506 ASSERT_FALSE (integer_all_onesp (wr_i_1
));
15507 ASSERT_TRUE (integer_all_onesp (i_m1
));
15508 ASSERT_TRUE (integer_all_onesp (wr_i_m1
));
15509 ASSERT_FALSE (integer_all_onesp (f_0
));
15510 ASSERT_FALSE (integer_all_onesp (wr_f_0
));
15511 ASSERT_FALSE (integer_all_onesp (f_1
));
15512 ASSERT_FALSE (integer_all_onesp (wr_f_1
));
15513 ASSERT_FALSE (integer_all_onesp (f_m1
));
15514 ASSERT_FALSE (integer_all_onesp (wr_f_m1
));
15515 ASSERT_FALSE (integer_all_onesp (c_i_0
));
15516 ASSERT_FALSE (integer_all_onesp (c_i_1
));
15517 ASSERT_FALSE (integer_all_onesp (c_i_m1
));
15518 ASSERT_FALSE (integer_all_onesp (c_f_0
));
15519 ASSERT_FALSE (integer_all_onesp (c_f_1
));
15520 ASSERT_FALSE (integer_all_onesp (c_f_m1
));
15522 /* Test integer_minus_onep. */
15523 ASSERT_FALSE (integer_minus_onep (i_0
));
15524 ASSERT_FALSE (integer_minus_onep (wr_i_0
));
15525 ASSERT_FALSE (integer_minus_onep (i_1
));
15526 ASSERT_FALSE (integer_minus_onep (wr_i_1
));
15527 ASSERT_TRUE (integer_minus_onep (i_m1
));
15528 ASSERT_TRUE (integer_minus_onep (wr_i_m1
));
15529 ASSERT_FALSE (integer_minus_onep (f_0
));
15530 ASSERT_FALSE (integer_minus_onep (wr_f_0
));
15531 ASSERT_FALSE (integer_minus_onep (f_1
));
15532 ASSERT_FALSE (integer_minus_onep (wr_f_1
));
15533 ASSERT_FALSE (integer_minus_onep (f_m1
));
15534 ASSERT_FALSE (integer_minus_onep (wr_f_m1
));
15535 ASSERT_FALSE (integer_minus_onep (c_i_0
));
15536 ASSERT_FALSE (integer_minus_onep (c_i_1
));
15537 ASSERT_TRUE (integer_minus_onep (c_i_m1
));
15538 ASSERT_FALSE (integer_minus_onep (c_f_0
));
15539 ASSERT_FALSE (integer_minus_onep (c_f_1
));
15540 ASSERT_FALSE (integer_minus_onep (c_f_m1
));
15542 /* Test integer_each_onep. */
15543 ASSERT_FALSE (integer_each_onep (i_0
));
15544 ASSERT_FALSE (integer_each_onep (wr_i_0
));
15545 ASSERT_TRUE (integer_each_onep (i_1
));
15546 ASSERT_TRUE (integer_each_onep (wr_i_1
));
15547 ASSERT_FALSE (integer_each_onep (i_m1
));
15548 ASSERT_FALSE (integer_each_onep (wr_i_m1
));
15549 ASSERT_FALSE (integer_each_onep (f_0
));
15550 ASSERT_FALSE (integer_each_onep (wr_f_0
));
15551 ASSERT_FALSE (integer_each_onep (f_1
));
15552 ASSERT_FALSE (integer_each_onep (wr_f_1
));
15553 ASSERT_FALSE (integer_each_onep (f_m1
));
15554 ASSERT_FALSE (integer_each_onep (wr_f_m1
));
15555 ASSERT_FALSE (integer_each_onep (c_i_0
));
15556 ASSERT_FALSE (integer_each_onep (c_i_1
));
15557 ASSERT_FALSE (integer_each_onep (c_i_m1
));
15558 ASSERT_FALSE (integer_each_onep (c_f_0
));
15559 ASSERT_FALSE (integer_each_onep (c_f_1
));
15560 ASSERT_FALSE (integer_each_onep (c_f_m1
));
15562 /* Test integer_truep. */
15563 ASSERT_FALSE (integer_truep (i_0
));
15564 ASSERT_FALSE (integer_truep (wr_i_0
));
15565 ASSERT_TRUE (integer_truep (i_1
));
15566 ASSERT_TRUE (integer_truep (wr_i_1
));
15567 ASSERT_FALSE (integer_truep (i_m1
));
15568 ASSERT_FALSE (integer_truep (wr_i_m1
));
15569 ASSERT_FALSE (integer_truep (f_0
));
15570 ASSERT_FALSE (integer_truep (wr_f_0
));
15571 ASSERT_FALSE (integer_truep (f_1
));
15572 ASSERT_FALSE (integer_truep (wr_f_1
));
15573 ASSERT_FALSE (integer_truep (f_m1
));
15574 ASSERT_FALSE (integer_truep (wr_f_m1
));
15575 ASSERT_FALSE (integer_truep (c_i_0
));
15576 ASSERT_TRUE (integer_truep (c_i_1
));
15577 ASSERT_FALSE (integer_truep (c_i_m1
));
15578 ASSERT_FALSE (integer_truep (c_f_0
));
15579 ASSERT_FALSE (integer_truep (c_f_1
));
15580 ASSERT_FALSE (integer_truep (c_f_m1
));
15582 /* Test integer_nonzerop. */
15583 ASSERT_FALSE (integer_nonzerop (i_0
));
15584 ASSERT_FALSE (integer_nonzerop (wr_i_0
));
15585 ASSERT_TRUE (integer_nonzerop (i_1
));
15586 ASSERT_TRUE (integer_nonzerop (wr_i_1
));
15587 ASSERT_TRUE (integer_nonzerop (i_m1
));
15588 ASSERT_TRUE (integer_nonzerop (wr_i_m1
));
15589 ASSERT_FALSE (integer_nonzerop (f_0
));
15590 ASSERT_FALSE (integer_nonzerop (wr_f_0
));
15591 ASSERT_FALSE (integer_nonzerop (f_1
));
15592 ASSERT_FALSE (integer_nonzerop (wr_f_1
));
15593 ASSERT_FALSE (integer_nonzerop (f_m1
));
15594 ASSERT_FALSE (integer_nonzerop (wr_f_m1
));
15595 ASSERT_FALSE (integer_nonzerop (c_i_0
));
15596 ASSERT_TRUE (integer_nonzerop (c_i_1
));
15597 ASSERT_TRUE (integer_nonzerop (c_i_m1
));
15598 ASSERT_FALSE (integer_nonzerop (c_f_0
));
15599 ASSERT_FALSE (integer_nonzerop (c_f_1
));
15600 ASSERT_FALSE (integer_nonzerop (c_f_m1
));
15602 /* Test real_zerop. */
15603 ASSERT_FALSE (real_zerop (i_0
));
15604 ASSERT_FALSE (real_zerop (wr_i_0
));
15605 ASSERT_FALSE (real_zerop (i_1
));
15606 ASSERT_FALSE (real_zerop (wr_i_1
));
15607 ASSERT_FALSE (real_zerop (i_m1
));
15608 ASSERT_FALSE (real_zerop (wr_i_m1
));
15609 ASSERT_TRUE (real_zerop (f_0
));
15610 ASSERT_TRUE (real_zerop (wr_f_0
));
15611 ASSERT_FALSE (real_zerop (f_1
));
15612 ASSERT_FALSE (real_zerop (wr_f_1
));
15613 ASSERT_FALSE (real_zerop (f_m1
));
15614 ASSERT_FALSE (real_zerop (wr_f_m1
));
15615 ASSERT_FALSE (real_zerop (c_i_0
));
15616 ASSERT_FALSE (real_zerop (c_i_1
));
15617 ASSERT_FALSE (real_zerop (c_i_m1
));
15618 ASSERT_TRUE (real_zerop (c_f_0
));
15619 ASSERT_FALSE (real_zerop (c_f_1
));
15620 ASSERT_FALSE (real_zerop (c_f_m1
));
15622 /* Test real_onep. */
15623 ASSERT_FALSE (real_onep (i_0
));
15624 ASSERT_FALSE (real_onep (wr_i_0
));
15625 ASSERT_FALSE (real_onep (i_1
));
15626 ASSERT_FALSE (real_onep (wr_i_1
));
15627 ASSERT_FALSE (real_onep (i_m1
));
15628 ASSERT_FALSE (real_onep (wr_i_m1
));
15629 ASSERT_FALSE (real_onep (f_0
));
15630 ASSERT_FALSE (real_onep (wr_f_0
));
15631 ASSERT_TRUE (real_onep (f_1
));
15632 ASSERT_TRUE (real_onep (wr_f_1
));
15633 ASSERT_FALSE (real_onep (f_m1
));
15634 ASSERT_FALSE (real_onep (wr_f_m1
));
15635 ASSERT_FALSE (real_onep (c_i_0
));
15636 ASSERT_FALSE (real_onep (c_i_1
));
15637 ASSERT_FALSE (real_onep (c_i_m1
));
15638 ASSERT_FALSE (real_onep (c_f_0
));
15639 ASSERT_TRUE (real_onep (c_f_1
));
15640 ASSERT_FALSE (real_onep (c_f_m1
));
15642 /* Test real_minus_onep. */
15643 ASSERT_FALSE (real_minus_onep (i_0
));
15644 ASSERT_FALSE (real_minus_onep (wr_i_0
));
15645 ASSERT_FALSE (real_minus_onep (i_1
));
15646 ASSERT_FALSE (real_minus_onep (wr_i_1
));
15647 ASSERT_FALSE (real_minus_onep (i_m1
));
15648 ASSERT_FALSE (real_minus_onep (wr_i_m1
));
15649 ASSERT_FALSE (real_minus_onep (f_0
));
15650 ASSERT_FALSE (real_minus_onep (wr_f_0
));
15651 ASSERT_FALSE (real_minus_onep (f_1
));
15652 ASSERT_FALSE (real_minus_onep (wr_f_1
));
15653 ASSERT_TRUE (real_minus_onep (f_m1
));
15654 ASSERT_TRUE (real_minus_onep (wr_f_m1
));
15655 ASSERT_FALSE (real_minus_onep (c_i_0
));
15656 ASSERT_FALSE (real_minus_onep (c_i_1
));
15657 ASSERT_FALSE (real_minus_onep (c_i_m1
));
15658 ASSERT_FALSE (real_minus_onep (c_f_0
));
15659 ASSERT_FALSE (real_minus_onep (c_f_1
));
15660 ASSERT_TRUE (real_minus_onep (c_f_m1
));
15663 ASSERT_TRUE (zerop (i_0
));
15664 ASSERT_TRUE (zerop (wr_i_0
));
15665 ASSERT_FALSE (zerop (i_1
));
15666 ASSERT_FALSE (zerop (wr_i_1
));
15667 ASSERT_FALSE (zerop (i_m1
));
15668 ASSERT_FALSE (zerop (wr_i_m1
));
15669 ASSERT_TRUE (zerop (f_0
));
15670 ASSERT_TRUE (zerop (wr_f_0
));
15671 ASSERT_FALSE (zerop (f_1
));
15672 ASSERT_FALSE (zerop (wr_f_1
));
15673 ASSERT_FALSE (zerop (f_m1
));
15674 ASSERT_FALSE (zerop (wr_f_m1
));
15675 ASSERT_TRUE (zerop (c_i_0
));
15676 ASSERT_FALSE (zerop (c_i_1
));
15677 ASSERT_FALSE (zerop (c_i_m1
));
15678 ASSERT_TRUE (zerop (c_f_0
));
15679 ASSERT_FALSE (zerop (c_f_1
));
15680 ASSERT_FALSE (zerop (c_f_m1
));
15682 /* Test tree_expr_nonnegative_p. */
15683 ASSERT_TRUE (tree_expr_nonnegative_p (i_0
));
15684 ASSERT_TRUE (tree_expr_nonnegative_p (wr_i_0
));
15685 ASSERT_TRUE (tree_expr_nonnegative_p (i_1
));
15686 ASSERT_TRUE (tree_expr_nonnegative_p (wr_i_1
));
15687 ASSERT_FALSE (tree_expr_nonnegative_p (i_m1
));
15688 ASSERT_FALSE (tree_expr_nonnegative_p (wr_i_m1
));
15689 ASSERT_TRUE (tree_expr_nonnegative_p (f_0
));
15690 ASSERT_TRUE (tree_expr_nonnegative_p (wr_f_0
));
15691 ASSERT_TRUE (tree_expr_nonnegative_p (f_1
));
15692 ASSERT_TRUE (tree_expr_nonnegative_p (wr_f_1
));
15693 ASSERT_FALSE (tree_expr_nonnegative_p (f_m1
));
15694 ASSERT_FALSE (tree_expr_nonnegative_p (wr_f_m1
));
15695 ASSERT_FALSE (tree_expr_nonnegative_p (c_i_0
));
15696 ASSERT_FALSE (tree_expr_nonnegative_p (c_i_1
));
15697 ASSERT_FALSE (tree_expr_nonnegative_p (c_i_m1
));
15698 ASSERT_FALSE (tree_expr_nonnegative_p (c_f_0
));
15699 ASSERT_FALSE (tree_expr_nonnegative_p (c_f_1
));
15700 ASSERT_FALSE (tree_expr_nonnegative_p (c_f_m1
));
15702 /* Test tree_expr_nonzero_p. */
15703 ASSERT_FALSE (tree_expr_nonzero_p (i_0
));
15704 ASSERT_FALSE (tree_expr_nonzero_p (wr_i_0
));
15705 ASSERT_TRUE (tree_expr_nonzero_p (i_1
));
15706 ASSERT_TRUE (tree_expr_nonzero_p (wr_i_1
));
15707 ASSERT_TRUE (tree_expr_nonzero_p (i_m1
));
15708 ASSERT_TRUE (tree_expr_nonzero_p (wr_i_m1
));
15710 /* Test integer_valued_real_p. */
15711 ASSERT_FALSE (integer_valued_real_p (i_0
));
15712 ASSERT_TRUE (integer_valued_real_p (f_0
));
15713 ASSERT_TRUE (integer_valued_real_p (wr_f_0
));
15714 ASSERT_TRUE (integer_valued_real_p (f_1
));
15715 ASSERT_TRUE (integer_valued_real_p (wr_f_1
));
15717 /* Test integer_pow2p. */
15718 ASSERT_FALSE (integer_pow2p (i_0
));
15719 ASSERT_TRUE (integer_pow2p (i_1
));
15720 ASSERT_TRUE (integer_pow2p (wr_i_1
));
15722 /* Test uniform_integer_cst_p. */
15723 ASSERT_TRUE (uniform_integer_cst_p (i_0
));
15724 ASSERT_TRUE (uniform_integer_cst_p (wr_i_0
));
15725 ASSERT_TRUE (uniform_integer_cst_p (i_1
));
15726 ASSERT_TRUE (uniform_integer_cst_p (wr_i_1
));
15727 ASSERT_TRUE (uniform_integer_cst_p (i_m1
));
15728 ASSERT_TRUE (uniform_integer_cst_p (wr_i_m1
));
15729 ASSERT_FALSE (uniform_integer_cst_p (f_0
));
15730 ASSERT_FALSE (uniform_integer_cst_p (wr_f_0
));
15731 ASSERT_FALSE (uniform_integer_cst_p (f_1
));
15732 ASSERT_FALSE (uniform_integer_cst_p (wr_f_1
));
15733 ASSERT_FALSE (uniform_integer_cst_p (f_m1
));
15734 ASSERT_FALSE (uniform_integer_cst_p (wr_f_m1
));
15735 ASSERT_FALSE (uniform_integer_cst_p (c_i_0
));
15736 ASSERT_FALSE (uniform_integer_cst_p (c_i_1
));
15737 ASSERT_FALSE (uniform_integer_cst_p (c_i_m1
));
15738 ASSERT_FALSE (uniform_integer_cst_p (c_f_0
));
15739 ASSERT_FALSE (uniform_integer_cst_p (c_f_1
));
15740 ASSERT_FALSE (uniform_integer_cst_p (c_f_m1
));
15743 /* Check that string escaping works correctly. */
15746 test_escaped_strings (void)
15749 escaped_string msg
;
15752 /* ASSERT_STREQ does not accept NULL as a valid test
15753 result, so we have to use ASSERT_EQ instead. */
15754 ASSERT_EQ (NULL
, (const char *) msg
);
15757 ASSERT_STREQ ("", (const char *) msg
);
15759 msg
.escape ("foobar");
15760 ASSERT_STREQ ("foobar", (const char *) msg
);
15762 /* Ensure that we have -fmessage-length set to 0. */
15763 saved_cutoff
= pp_line_cutoff (global_dc
->printer
);
15764 pp_line_cutoff (global_dc
->printer
) = 0;
15766 msg
.escape ("foo\nbar");
15767 ASSERT_STREQ ("foo\\nbar", (const char *) msg
);
15769 msg
.escape ("\a\b\f\n\r\t\v");
15770 ASSERT_STREQ ("\\a\\b\\f\\n\\r\\t\\v", (const char *) msg
);
15772 /* Now repeat the tests with -fmessage-length set to 5. */
15773 pp_line_cutoff (global_dc
->printer
) = 5;
15775 /* Note that the newline is not translated into an escape. */
15776 msg
.escape ("foo\nbar");
15777 ASSERT_STREQ ("foo\nbar", (const char *) msg
);
15779 msg
.escape ("\a\b\f\n\r\t\v");
15780 ASSERT_STREQ ("\\a\\b\\f\n\\r\\t\\v", (const char *) msg
);
15782 /* Restore the original message length setting. */
15783 pp_line_cutoff (global_dc
->printer
) = saved_cutoff
;
15786 /* Run all of the selftests within this file. */
15791 test_integer_constants ();
15792 test_identifiers ();
15794 test_vector_cst_patterns ();
15795 test_location_wrappers ();
15796 test_predicates ();
15797 test_escaped_strings ();
15800 } // namespace selftest
15802 #endif /* CHECKING_P */
15804 #include "gt-tree.h"