2017-09-12 Paul Thomas <pault@gcc.gnu.org>
[official-gcc.git] / gcc / tree.c
blob721330a4a499e722fd3233988bf54843b0136a6c
1 /* Language-independent node constructors for parse phase of GNU compiler.
2 Copyright (C) 1987-2017 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
9 version.
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
14 for more details.
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
25 nodes of that code.
27 It is intended to be language-independent but can occasionally
28 calls language-dependent routines. */
30 #include "config.h"
31 #include "system.h"
32 #include "coretypes.h"
33 #include "backend.h"
34 #include "target.h"
35 #include "tree.h"
36 #include "gimple.h"
37 #include "tree-pass.h"
38 #include "ssa.h"
39 #include "cgraph.h"
40 #include "diagnostic.h"
41 #include "flags.h"
42 #include "alias.h"
43 #include "fold-const.h"
44 #include "stor-layout.h"
45 #include "calls.h"
46 #include "attribs.h"
47 #include "toplev.h" /* get_random_seed */
48 #include "output.h"
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"
55 #include "gimplify.h"
56 #include "tree-dfa.h"
57 #include "params.h"
58 #include "langhooks-def.h"
59 #include "tree-diagnostic.h"
60 #include "except.h"
61 #include "builtins.h"
62 #include "print-tree.h"
63 #include "ipa-utils.h"
64 #include "selftest.h"
65 #include "stringpool.h"
66 #include "attribs.h"
67 #include "rtl.h"
68 #include "regs.h"
70 /* Tree code classes. */
72 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) TYPE,
73 #define END_OF_BASE_TREE_CODES tcc_exceptional,
75 const enum tree_code_class tree_code_type[] = {
76 #include "all-tree.def"
79 #undef DEFTREECODE
80 #undef END_OF_BASE_TREE_CODES
82 /* Table indexed by tree code giving number of expression
83 operands beyond the fixed part of the node structure.
84 Not used for types or decls. */
86 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) LENGTH,
87 #define END_OF_BASE_TREE_CODES 0,
89 const unsigned char tree_code_length[] = {
90 #include "all-tree.def"
93 #undef DEFTREECODE
94 #undef END_OF_BASE_TREE_CODES
96 /* Names of tree components.
97 Used for printing out the tree and error messages. */
98 #define DEFTREECODE(SYM, NAME, TYPE, LEN) NAME,
99 #define END_OF_BASE_TREE_CODES "@dummy",
101 static const char *const tree_code_name[] = {
102 #include "all-tree.def"
105 #undef DEFTREECODE
106 #undef END_OF_BASE_TREE_CODES
108 /* Each tree code class has an associated string representation.
109 These must correspond to the tree_code_class entries. */
111 const char *const tree_code_class_strings[] =
113 "exceptional",
114 "constant",
115 "type",
116 "declaration",
117 "reference",
118 "comparison",
119 "unary",
120 "binary",
121 "statement",
122 "vl_exp",
123 "expression"
126 /* obstack.[ch] explicitly declined to prototype this. */
127 extern int _obstack_allocated_p (struct obstack *h, void *obj);
129 /* Statistics-gathering stuff. */
131 static int tree_code_counts[MAX_TREE_CODES];
132 int tree_node_counts[(int) all_kinds];
133 int tree_node_sizes[(int) all_kinds];
135 /* Keep in sync with tree.h:enum tree_node_kind. */
136 static const char * const tree_node_kind_names[] = {
137 "decls",
138 "types",
139 "blocks",
140 "stmts",
141 "refs",
142 "exprs",
143 "constants",
144 "identifiers",
145 "vecs",
146 "binfos",
147 "ssa names",
148 "constructors",
149 "random kinds",
150 "lang_decl kinds",
151 "lang_type kinds",
152 "omp clauses",
155 /* Unique id for next decl created. */
156 static GTY(()) int next_decl_uid;
157 /* Unique id for next type created. */
158 static GTY(()) unsigned next_type_uid = 1;
159 /* Unique id for next debug decl created. Use negative numbers,
160 to catch erroneous uses. */
161 static GTY(()) int next_debug_decl_uid;
163 /* Since we cannot rehash a type after it is in the table, we have to
164 keep the hash code. */
166 struct GTY((for_user)) type_hash {
167 unsigned long hash;
168 tree type;
171 /* Initial size of the hash table (rounded to next prime). */
172 #define TYPE_HASH_INITIAL_SIZE 1000
174 struct type_cache_hasher : ggc_cache_ptr_hash<type_hash>
176 static hashval_t hash (type_hash *t) { return t->hash; }
177 static bool equal (type_hash *a, type_hash *b);
179 static int
180 keep_cache_entry (type_hash *&t)
182 return ggc_marked_p (t->type);
186 /* Now here is the hash table. When recording a type, it is added to
187 the slot whose index is the hash code. Note that the hash table is
188 used for several kinds of types (function types, array types and
189 array index range types, for now). While all these live in the
190 same table, they are completely independent, and the hash code is
191 computed differently for each of these. */
193 static GTY ((cache)) hash_table<type_cache_hasher> *type_hash_table;
195 /* Hash table and temporary node for larger integer const values. */
196 static GTY (()) tree int_cst_node;
198 struct int_cst_hasher : ggc_cache_ptr_hash<tree_node>
200 static hashval_t hash (tree t);
201 static bool equal (tree x, tree y);
204 static GTY ((cache)) hash_table<int_cst_hasher> *int_cst_hash_table;
206 /* Hash table for optimization flags and target option flags. Use the same
207 hash table for both sets of options. Nodes for building the current
208 optimization and target option nodes. The assumption is most of the time
209 the options created will already be in the hash table, so we avoid
210 allocating and freeing up a node repeatably. */
211 static GTY (()) tree cl_optimization_node;
212 static GTY (()) tree cl_target_option_node;
214 struct cl_option_hasher : ggc_cache_ptr_hash<tree_node>
216 static hashval_t hash (tree t);
217 static bool equal (tree x, tree y);
220 static GTY ((cache)) hash_table<cl_option_hasher> *cl_option_hash_table;
222 /* General tree->tree mapping structure for use in hash tables. */
225 static GTY ((cache))
226 hash_table<tree_decl_map_cache_hasher> *debug_expr_for_decl;
228 static GTY ((cache))
229 hash_table<tree_decl_map_cache_hasher> *value_expr_for_decl;
231 struct tree_vec_map_cache_hasher : ggc_cache_ptr_hash<tree_vec_map>
233 static hashval_t hash (tree_vec_map *m) { return DECL_UID (m->base.from); }
235 static bool
236 equal (tree_vec_map *a, tree_vec_map *b)
238 return a->base.from == b->base.from;
241 static int
242 keep_cache_entry (tree_vec_map *&m)
244 return ggc_marked_p (m->base.from);
248 static GTY ((cache))
249 hash_table<tree_vec_map_cache_hasher> *debug_args_for_decl;
251 static void set_type_quals (tree, int);
252 static void print_type_hash_statistics (void);
253 static void print_debug_expr_statistics (void);
254 static void print_value_expr_statistics (void);
256 tree global_trees[TI_MAX];
257 tree integer_types[itk_none];
259 bool int_n_enabled_p[NUM_INT_N_ENTS];
260 struct int_n_trees_t int_n_trees [NUM_INT_N_ENTS];
262 unsigned char tree_contains_struct[MAX_TREE_CODES][64];
264 /* Number of operands for each OpenMP clause. */
265 unsigned const char omp_clause_num_ops[] =
267 0, /* OMP_CLAUSE_ERROR */
268 1, /* OMP_CLAUSE_PRIVATE */
269 1, /* OMP_CLAUSE_SHARED */
270 1, /* OMP_CLAUSE_FIRSTPRIVATE */
271 2, /* OMP_CLAUSE_LASTPRIVATE */
272 5, /* OMP_CLAUSE_REDUCTION */
273 1, /* OMP_CLAUSE_COPYIN */
274 1, /* OMP_CLAUSE_COPYPRIVATE */
275 3, /* OMP_CLAUSE_LINEAR */
276 2, /* OMP_CLAUSE_ALIGNED */
277 1, /* OMP_CLAUSE_DEPEND */
278 1, /* OMP_CLAUSE_UNIFORM */
279 1, /* OMP_CLAUSE_TO_DECLARE */
280 1, /* OMP_CLAUSE_LINK */
281 2, /* OMP_CLAUSE_FROM */
282 2, /* OMP_CLAUSE_TO */
283 2, /* OMP_CLAUSE_MAP */
284 1, /* OMP_CLAUSE_USE_DEVICE_PTR */
285 1, /* OMP_CLAUSE_IS_DEVICE_PTR */
286 2, /* OMP_CLAUSE__CACHE_ */
287 2, /* OMP_CLAUSE_GANG */
288 1, /* OMP_CLAUSE_ASYNC */
289 1, /* OMP_CLAUSE_WAIT */
290 0, /* OMP_CLAUSE_AUTO */
291 0, /* OMP_CLAUSE_SEQ */
292 1, /* OMP_CLAUSE__LOOPTEMP_ */
293 1, /* OMP_CLAUSE_IF */
294 1, /* OMP_CLAUSE_NUM_THREADS */
295 1, /* OMP_CLAUSE_SCHEDULE */
296 0, /* OMP_CLAUSE_NOWAIT */
297 1, /* OMP_CLAUSE_ORDERED */
298 0, /* OMP_CLAUSE_DEFAULT */
299 3, /* OMP_CLAUSE_COLLAPSE */
300 0, /* OMP_CLAUSE_UNTIED */
301 1, /* OMP_CLAUSE_FINAL */
302 0, /* OMP_CLAUSE_MERGEABLE */
303 1, /* OMP_CLAUSE_DEVICE */
304 1, /* OMP_CLAUSE_DIST_SCHEDULE */
305 0, /* OMP_CLAUSE_INBRANCH */
306 0, /* OMP_CLAUSE_NOTINBRANCH */
307 1, /* OMP_CLAUSE_NUM_TEAMS */
308 1, /* OMP_CLAUSE_THREAD_LIMIT */
309 0, /* OMP_CLAUSE_PROC_BIND */
310 1, /* OMP_CLAUSE_SAFELEN */
311 1, /* OMP_CLAUSE_SIMDLEN */
312 0, /* OMP_CLAUSE_FOR */
313 0, /* OMP_CLAUSE_PARALLEL */
314 0, /* OMP_CLAUSE_SECTIONS */
315 0, /* OMP_CLAUSE_TASKGROUP */
316 1, /* OMP_CLAUSE_PRIORITY */
317 1, /* OMP_CLAUSE_GRAINSIZE */
318 1, /* OMP_CLAUSE_NUM_TASKS */
319 0, /* OMP_CLAUSE_NOGROUP */
320 0, /* OMP_CLAUSE_THREADS */
321 0, /* OMP_CLAUSE_SIMD */
322 1, /* OMP_CLAUSE_HINT */
323 0, /* OMP_CLAUSE_DEFALTMAP */
324 1, /* OMP_CLAUSE__SIMDUID_ */
325 0, /* OMP_CLAUSE__SIMT_ */
326 1, /* OMP_CLAUSE__CILK_FOR_COUNT_ */
327 0, /* OMP_CLAUSE_INDEPENDENT */
328 1, /* OMP_CLAUSE_WORKER */
329 1, /* OMP_CLAUSE_VECTOR */
330 1, /* OMP_CLAUSE_NUM_GANGS */
331 1, /* OMP_CLAUSE_NUM_WORKERS */
332 1, /* OMP_CLAUSE_VECTOR_LENGTH */
333 3, /* OMP_CLAUSE_TILE */
334 2, /* OMP_CLAUSE__GRIDDIM_ */
337 const char * const omp_clause_code_name[] =
339 "error_clause",
340 "private",
341 "shared",
342 "firstprivate",
343 "lastprivate",
344 "reduction",
345 "copyin",
346 "copyprivate",
347 "linear",
348 "aligned",
349 "depend",
350 "uniform",
351 "to",
352 "link",
353 "from",
354 "to",
355 "map",
356 "use_device_ptr",
357 "is_device_ptr",
358 "_cache_",
359 "gang",
360 "async",
361 "wait",
362 "auto",
363 "seq",
364 "_looptemp_",
365 "if",
366 "num_threads",
367 "schedule",
368 "nowait",
369 "ordered",
370 "default",
371 "collapse",
372 "untied",
373 "final",
374 "mergeable",
375 "device",
376 "dist_schedule",
377 "inbranch",
378 "notinbranch",
379 "num_teams",
380 "thread_limit",
381 "proc_bind",
382 "safelen",
383 "simdlen",
384 "for",
385 "parallel",
386 "sections",
387 "taskgroup",
388 "priority",
389 "grainsize",
390 "num_tasks",
391 "nogroup",
392 "threads",
393 "simd",
394 "hint",
395 "defaultmap",
396 "_simduid_",
397 "_simt_",
398 "_Cilk_for_count_",
399 "independent",
400 "worker",
401 "vector",
402 "num_gangs",
403 "num_workers",
404 "vector_length",
405 "tile",
406 "_griddim_"
410 /* Return the tree node structure used by tree code CODE. */
412 static inline enum tree_node_structure_enum
413 tree_node_structure_for_code (enum tree_code code)
415 switch (TREE_CODE_CLASS (code))
417 case tcc_declaration:
419 switch (code)
421 case FIELD_DECL:
422 return TS_FIELD_DECL;
423 case PARM_DECL:
424 return TS_PARM_DECL;
425 case VAR_DECL:
426 return TS_VAR_DECL;
427 case LABEL_DECL:
428 return TS_LABEL_DECL;
429 case RESULT_DECL:
430 return TS_RESULT_DECL;
431 case DEBUG_EXPR_DECL:
432 return TS_DECL_WRTL;
433 case CONST_DECL:
434 return TS_CONST_DECL;
435 case TYPE_DECL:
436 return TS_TYPE_DECL;
437 case FUNCTION_DECL:
438 return TS_FUNCTION_DECL;
439 case TRANSLATION_UNIT_DECL:
440 return TS_TRANSLATION_UNIT_DECL;
441 default:
442 return TS_DECL_NON_COMMON;
445 case tcc_type:
446 return TS_TYPE_NON_COMMON;
447 case tcc_reference:
448 case tcc_comparison:
449 case tcc_unary:
450 case tcc_binary:
451 case tcc_expression:
452 case tcc_statement:
453 case tcc_vl_exp:
454 return TS_EXP;
455 default: /* tcc_constant and tcc_exceptional */
456 break;
458 switch (code)
460 /* tcc_constant cases. */
461 case VOID_CST: return TS_TYPED;
462 case INTEGER_CST: return TS_INT_CST;
463 case REAL_CST: return TS_REAL_CST;
464 case FIXED_CST: return TS_FIXED_CST;
465 case COMPLEX_CST: return TS_COMPLEX;
466 case VECTOR_CST: return TS_VECTOR;
467 case STRING_CST: return TS_STRING;
468 /* tcc_exceptional cases. */
469 case ERROR_MARK: return TS_COMMON;
470 case IDENTIFIER_NODE: return TS_IDENTIFIER;
471 case TREE_LIST: return TS_LIST;
472 case TREE_VEC: return TS_VEC;
473 case SSA_NAME: return TS_SSA_NAME;
474 case PLACEHOLDER_EXPR: return TS_COMMON;
475 case STATEMENT_LIST: return TS_STATEMENT_LIST;
476 case BLOCK: return TS_BLOCK;
477 case CONSTRUCTOR: return TS_CONSTRUCTOR;
478 case TREE_BINFO: return TS_BINFO;
479 case OMP_CLAUSE: return TS_OMP_CLAUSE;
480 case OPTIMIZATION_NODE: return TS_OPTIMIZATION;
481 case TARGET_OPTION_NODE: return TS_TARGET_OPTION;
483 default:
484 gcc_unreachable ();
489 /* Initialize tree_contains_struct to describe the hierarchy of tree
490 nodes. */
492 static void
493 initialize_tree_contains_struct (void)
495 unsigned i;
497 for (i = ERROR_MARK; i < LAST_AND_UNUSED_TREE_CODE; i++)
499 enum tree_code code;
500 enum tree_node_structure_enum ts_code;
502 code = (enum tree_code) i;
503 ts_code = tree_node_structure_for_code (code);
505 /* Mark the TS structure itself. */
506 tree_contains_struct[code][ts_code] = 1;
508 /* Mark all the structures that TS is derived from. */
509 switch (ts_code)
511 case TS_TYPED:
512 case TS_BLOCK:
513 case TS_OPTIMIZATION:
514 case TS_TARGET_OPTION:
515 MARK_TS_BASE (code);
516 break;
518 case TS_COMMON:
519 case TS_INT_CST:
520 case TS_REAL_CST:
521 case TS_FIXED_CST:
522 case TS_VECTOR:
523 case TS_STRING:
524 case TS_COMPLEX:
525 case TS_SSA_NAME:
526 case TS_CONSTRUCTOR:
527 case TS_EXP:
528 case TS_STATEMENT_LIST:
529 MARK_TS_TYPED (code);
530 break;
532 case TS_IDENTIFIER:
533 case TS_DECL_MINIMAL:
534 case TS_TYPE_COMMON:
535 case TS_LIST:
536 case TS_VEC:
537 case TS_BINFO:
538 case TS_OMP_CLAUSE:
539 MARK_TS_COMMON (code);
540 break;
542 case TS_TYPE_WITH_LANG_SPECIFIC:
543 MARK_TS_TYPE_COMMON (code);
544 break;
546 case TS_TYPE_NON_COMMON:
547 MARK_TS_TYPE_WITH_LANG_SPECIFIC (code);
548 break;
550 case TS_DECL_COMMON:
551 MARK_TS_DECL_MINIMAL (code);
552 break;
554 case TS_DECL_WRTL:
555 case TS_CONST_DECL:
556 MARK_TS_DECL_COMMON (code);
557 break;
559 case TS_DECL_NON_COMMON:
560 MARK_TS_DECL_WITH_VIS (code);
561 break;
563 case TS_DECL_WITH_VIS:
564 case TS_PARM_DECL:
565 case TS_LABEL_DECL:
566 case TS_RESULT_DECL:
567 MARK_TS_DECL_WRTL (code);
568 break;
570 case TS_FIELD_DECL:
571 MARK_TS_DECL_COMMON (code);
572 break;
574 case TS_VAR_DECL:
575 MARK_TS_DECL_WITH_VIS (code);
576 break;
578 case TS_TYPE_DECL:
579 case TS_FUNCTION_DECL:
580 MARK_TS_DECL_NON_COMMON (code);
581 break;
583 case TS_TRANSLATION_UNIT_DECL:
584 MARK_TS_DECL_COMMON (code);
585 break;
587 default:
588 gcc_unreachable ();
592 /* Basic consistency checks for attributes used in fold. */
593 gcc_assert (tree_contains_struct[FUNCTION_DECL][TS_DECL_NON_COMMON]);
594 gcc_assert (tree_contains_struct[TYPE_DECL][TS_DECL_NON_COMMON]);
595 gcc_assert (tree_contains_struct[CONST_DECL][TS_DECL_COMMON]);
596 gcc_assert (tree_contains_struct[VAR_DECL][TS_DECL_COMMON]);
597 gcc_assert (tree_contains_struct[PARM_DECL][TS_DECL_COMMON]);
598 gcc_assert (tree_contains_struct[RESULT_DECL][TS_DECL_COMMON]);
599 gcc_assert (tree_contains_struct[FUNCTION_DECL][TS_DECL_COMMON]);
600 gcc_assert (tree_contains_struct[TYPE_DECL][TS_DECL_COMMON]);
601 gcc_assert (tree_contains_struct[TRANSLATION_UNIT_DECL][TS_DECL_COMMON]);
602 gcc_assert (tree_contains_struct[LABEL_DECL][TS_DECL_COMMON]);
603 gcc_assert (tree_contains_struct[FIELD_DECL][TS_DECL_COMMON]);
604 gcc_assert (tree_contains_struct[VAR_DECL][TS_DECL_WRTL]);
605 gcc_assert (tree_contains_struct[PARM_DECL][TS_DECL_WRTL]);
606 gcc_assert (tree_contains_struct[RESULT_DECL][TS_DECL_WRTL]);
607 gcc_assert (tree_contains_struct[FUNCTION_DECL][TS_DECL_WRTL]);
608 gcc_assert (tree_contains_struct[LABEL_DECL][TS_DECL_WRTL]);
609 gcc_assert (tree_contains_struct[CONST_DECL][TS_DECL_MINIMAL]);
610 gcc_assert (tree_contains_struct[VAR_DECL][TS_DECL_MINIMAL]);
611 gcc_assert (tree_contains_struct[PARM_DECL][TS_DECL_MINIMAL]);
612 gcc_assert (tree_contains_struct[RESULT_DECL][TS_DECL_MINIMAL]);
613 gcc_assert (tree_contains_struct[FUNCTION_DECL][TS_DECL_MINIMAL]);
614 gcc_assert (tree_contains_struct[TYPE_DECL][TS_DECL_MINIMAL]);
615 gcc_assert (tree_contains_struct[TRANSLATION_UNIT_DECL][TS_DECL_MINIMAL]);
616 gcc_assert (tree_contains_struct[LABEL_DECL][TS_DECL_MINIMAL]);
617 gcc_assert (tree_contains_struct[FIELD_DECL][TS_DECL_MINIMAL]);
618 gcc_assert (tree_contains_struct[VAR_DECL][TS_DECL_WITH_VIS]);
619 gcc_assert (tree_contains_struct[FUNCTION_DECL][TS_DECL_WITH_VIS]);
620 gcc_assert (tree_contains_struct[TYPE_DECL][TS_DECL_WITH_VIS]);
621 gcc_assert (tree_contains_struct[VAR_DECL][TS_VAR_DECL]);
622 gcc_assert (tree_contains_struct[FIELD_DECL][TS_FIELD_DECL]);
623 gcc_assert (tree_contains_struct[PARM_DECL][TS_PARM_DECL]);
624 gcc_assert (tree_contains_struct[LABEL_DECL][TS_LABEL_DECL]);
625 gcc_assert (tree_contains_struct[RESULT_DECL][TS_RESULT_DECL]);
626 gcc_assert (tree_contains_struct[CONST_DECL][TS_CONST_DECL]);
627 gcc_assert (tree_contains_struct[TYPE_DECL][TS_TYPE_DECL]);
628 gcc_assert (tree_contains_struct[FUNCTION_DECL][TS_FUNCTION_DECL]);
629 gcc_assert (tree_contains_struct[IMPORTED_DECL][TS_DECL_MINIMAL]);
630 gcc_assert (tree_contains_struct[IMPORTED_DECL][TS_DECL_COMMON]);
631 gcc_assert (tree_contains_struct[NAMELIST_DECL][TS_DECL_MINIMAL]);
632 gcc_assert (tree_contains_struct[NAMELIST_DECL][TS_DECL_COMMON]);
636 /* Init tree.c. */
638 void
639 init_ttree (void)
641 /* Initialize the hash table of types. */
642 type_hash_table
643 = hash_table<type_cache_hasher>::create_ggc (TYPE_HASH_INITIAL_SIZE);
645 debug_expr_for_decl
646 = hash_table<tree_decl_map_cache_hasher>::create_ggc (512);
648 value_expr_for_decl
649 = hash_table<tree_decl_map_cache_hasher>::create_ggc (512);
651 int_cst_hash_table = hash_table<int_cst_hasher>::create_ggc (1024);
653 int_cst_node = make_int_cst (1, 1);
655 cl_option_hash_table = hash_table<cl_option_hasher>::create_ggc (64);
657 cl_optimization_node = make_node (OPTIMIZATION_NODE);
658 cl_target_option_node = make_node (TARGET_OPTION_NODE);
660 /* Initialize the tree_contains_struct array. */
661 initialize_tree_contains_struct ();
662 lang_hooks.init_ts ();
666 /* The name of the object as the assembler will see it (but before any
667 translations made by ASM_OUTPUT_LABELREF). Often this is the same
668 as DECL_NAME. It is an IDENTIFIER_NODE. */
669 tree
670 decl_assembler_name (tree decl)
672 if (!DECL_ASSEMBLER_NAME_SET_P (decl))
673 lang_hooks.set_decl_assembler_name (decl);
674 return DECL_WITH_VIS_CHECK (decl)->decl_with_vis.assembler_name;
677 /* When the target supports COMDAT groups, this indicates which group the
678 DECL is associated with. This can be either an IDENTIFIER_NODE or a
679 decl, in which case its DECL_ASSEMBLER_NAME identifies the group. */
680 tree
681 decl_comdat_group (const_tree node)
683 struct symtab_node *snode = symtab_node::get (node);
684 if (!snode)
685 return NULL;
686 return snode->get_comdat_group ();
689 /* Likewise, but make sure it's been reduced to an IDENTIFIER_NODE. */
690 tree
691 decl_comdat_group_id (const_tree node)
693 struct symtab_node *snode = symtab_node::get (node);
694 if (!snode)
695 return NULL;
696 return snode->get_comdat_group_id ();
699 /* When the target supports named section, return its name as IDENTIFIER_NODE
700 or NULL if it is in no section. */
701 const char *
702 decl_section_name (const_tree node)
704 struct symtab_node *snode = symtab_node::get (node);
705 if (!snode)
706 return NULL;
707 return snode->get_section ();
710 /* Set section name of NODE to VALUE (that is expected to be
711 identifier node) */
712 void
713 set_decl_section_name (tree node, const char *value)
715 struct symtab_node *snode;
717 if (value == NULL)
719 snode = symtab_node::get (node);
720 if (!snode)
721 return;
723 else if (VAR_P (node))
724 snode = varpool_node::get_create (node);
725 else
726 snode = cgraph_node::get_create (node);
727 snode->set_section (value);
730 /* Return TLS model of a variable NODE. */
731 enum tls_model
732 decl_tls_model (const_tree node)
734 struct varpool_node *snode = varpool_node::get (node);
735 if (!snode)
736 return TLS_MODEL_NONE;
737 return snode->tls_model;
740 /* Set TLS model of variable NODE to MODEL. */
741 void
742 set_decl_tls_model (tree node, enum tls_model model)
744 struct varpool_node *vnode;
746 if (model == TLS_MODEL_NONE)
748 vnode = varpool_node::get (node);
749 if (!vnode)
750 return;
752 else
753 vnode = varpool_node::get_create (node);
754 vnode->tls_model = model;
757 /* Compute the number of bytes occupied by a tree with code CODE.
758 This function cannot be used for nodes that have variable sizes,
759 including TREE_VEC, INTEGER_CST, STRING_CST, and CALL_EXPR. */
760 size_t
761 tree_code_size (enum tree_code code)
763 switch (TREE_CODE_CLASS (code))
765 case tcc_declaration: /* A decl node */
767 switch (code)
769 case FIELD_DECL:
770 return sizeof (struct tree_field_decl);
771 case PARM_DECL:
772 return sizeof (struct tree_parm_decl);
773 case VAR_DECL:
774 return sizeof (struct tree_var_decl);
775 case LABEL_DECL:
776 return sizeof (struct tree_label_decl);
777 case RESULT_DECL:
778 return sizeof (struct tree_result_decl);
779 case CONST_DECL:
780 return sizeof (struct tree_const_decl);
781 case TYPE_DECL:
782 return sizeof (struct tree_type_decl);
783 case FUNCTION_DECL:
784 return sizeof (struct tree_function_decl);
785 case DEBUG_EXPR_DECL:
786 return sizeof (struct tree_decl_with_rtl);
787 case TRANSLATION_UNIT_DECL:
788 return sizeof (struct tree_translation_unit_decl);
789 case NAMESPACE_DECL:
790 case IMPORTED_DECL:
791 case NAMELIST_DECL:
792 return sizeof (struct tree_decl_non_common);
793 default:
794 return lang_hooks.tree_size (code);
798 case tcc_type: /* a type node */
799 return sizeof (struct tree_type_non_common);
801 case tcc_reference: /* a reference */
802 case tcc_expression: /* an expression */
803 case tcc_statement: /* an expression with side effects */
804 case tcc_comparison: /* a comparison expression */
805 case tcc_unary: /* a unary arithmetic expression */
806 case tcc_binary: /* a binary arithmetic expression */
807 return (sizeof (struct tree_exp)
808 + (TREE_CODE_LENGTH (code) - 1) * sizeof (tree));
810 case tcc_constant: /* a constant */
811 switch (code)
813 case VOID_CST: return sizeof (struct tree_typed);
814 case INTEGER_CST: gcc_unreachable ();
815 case REAL_CST: return sizeof (struct tree_real_cst);
816 case FIXED_CST: return sizeof (struct tree_fixed_cst);
817 case COMPLEX_CST: return sizeof (struct tree_complex);
818 case VECTOR_CST: return sizeof (struct tree_vector);
819 case STRING_CST: gcc_unreachable ();
820 default:
821 return lang_hooks.tree_size (code);
824 case tcc_exceptional: /* something random, like an identifier. */
825 switch (code)
827 case IDENTIFIER_NODE: return lang_hooks.identifier_size;
828 case TREE_LIST: return sizeof (struct tree_list);
830 case ERROR_MARK:
831 case PLACEHOLDER_EXPR: return sizeof (struct tree_common);
833 case TREE_VEC:
834 case OMP_CLAUSE: gcc_unreachable ();
836 case SSA_NAME: return sizeof (struct tree_ssa_name);
838 case STATEMENT_LIST: return sizeof (struct tree_statement_list);
839 case BLOCK: return sizeof (struct tree_block);
840 case CONSTRUCTOR: return sizeof (struct tree_constructor);
841 case OPTIMIZATION_NODE: return sizeof (struct tree_optimization_option);
842 case TARGET_OPTION_NODE: return sizeof (struct tree_target_option);
844 default:
845 return lang_hooks.tree_size (code);
848 default:
849 gcc_unreachable ();
853 /* Compute the number of bytes occupied by NODE. This routine only
854 looks at TREE_CODE, except for those nodes that have variable sizes. */
855 size_t
856 tree_size (const_tree node)
858 const enum tree_code code = TREE_CODE (node);
859 switch (code)
861 case INTEGER_CST:
862 return (sizeof (struct tree_int_cst)
863 + (TREE_INT_CST_EXT_NUNITS (node) - 1) * sizeof (HOST_WIDE_INT));
865 case TREE_BINFO:
866 return (offsetof (struct tree_binfo, base_binfos)
867 + vec<tree, va_gc>
868 ::embedded_size (BINFO_N_BASE_BINFOS (node)));
870 case TREE_VEC:
871 return (sizeof (struct tree_vec)
872 + (TREE_VEC_LENGTH (node) - 1) * sizeof (tree));
874 case VECTOR_CST:
875 return (sizeof (struct tree_vector)
876 + (TYPE_VECTOR_SUBPARTS (TREE_TYPE (node)) - 1) * sizeof (tree));
878 case STRING_CST:
879 return TREE_STRING_LENGTH (node) + offsetof (struct tree_string, str) + 1;
881 case OMP_CLAUSE:
882 return (sizeof (struct tree_omp_clause)
883 + (omp_clause_num_ops[OMP_CLAUSE_CODE (node)] - 1)
884 * sizeof (tree));
886 default:
887 if (TREE_CODE_CLASS (code) == tcc_vl_exp)
888 return (sizeof (struct tree_exp)
889 + (VL_EXP_OPERAND_LENGTH (node) - 1) * sizeof (tree));
890 else
891 return tree_code_size (code);
895 /* Record interesting allocation statistics for a tree node with CODE
896 and LENGTH. */
898 static void
899 record_node_allocation_statistics (enum tree_code code ATTRIBUTE_UNUSED,
900 size_t length ATTRIBUTE_UNUSED)
902 enum tree_code_class type = TREE_CODE_CLASS (code);
903 tree_node_kind kind;
905 if (!GATHER_STATISTICS)
906 return;
908 switch (type)
910 case tcc_declaration: /* A decl node */
911 kind = d_kind;
912 break;
914 case tcc_type: /* a type node */
915 kind = t_kind;
916 break;
918 case tcc_statement: /* an expression with side effects */
919 kind = s_kind;
920 break;
922 case tcc_reference: /* a reference */
923 kind = r_kind;
924 break;
926 case tcc_expression: /* an expression */
927 case tcc_comparison: /* a comparison expression */
928 case tcc_unary: /* a unary arithmetic expression */
929 case tcc_binary: /* a binary arithmetic expression */
930 kind = e_kind;
931 break;
933 case tcc_constant: /* a constant */
934 kind = c_kind;
935 break;
937 case tcc_exceptional: /* something random, like an identifier. */
938 switch (code)
940 case IDENTIFIER_NODE:
941 kind = id_kind;
942 break;
944 case TREE_VEC:
945 kind = vec_kind;
946 break;
948 case TREE_BINFO:
949 kind = binfo_kind;
950 break;
952 case SSA_NAME:
953 kind = ssa_name_kind;
954 break;
956 case BLOCK:
957 kind = b_kind;
958 break;
960 case CONSTRUCTOR:
961 kind = constr_kind;
962 break;
964 case OMP_CLAUSE:
965 kind = omp_clause_kind;
966 break;
968 default:
969 kind = x_kind;
970 break;
972 break;
974 case tcc_vl_exp:
975 kind = e_kind;
976 break;
978 default:
979 gcc_unreachable ();
982 tree_code_counts[(int) code]++;
983 tree_node_counts[(int) kind]++;
984 tree_node_sizes[(int) kind] += length;
987 /* Allocate and return a new UID from the DECL_UID namespace. */
990 allocate_decl_uid (void)
992 return next_decl_uid++;
995 /* Return a newly allocated node of code CODE. For decl and type
996 nodes, some other fields are initialized. The rest of the node is
997 initialized to zero. This function cannot be used for TREE_VEC,
998 INTEGER_CST or OMP_CLAUSE nodes, which is enforced by asserts in
999 tree_code_size.
1001 Achoo! I got a code in the node. */
1003 tree
1004 make_node (enum tree_code code MEM_STAT_DECL)
1006 tree t;
1007 enum tree_code_class type = TREE_CODE_CLASS (code);
1008 size_t length = tree_code_size (code);
1010 record_node_allocation_statistics (code, length);
1012 t = ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT);
1013 TREE_SET_CODE (t, code);
1015 switch (type)
1017 case tcc_statement:
1018 TREE_SIDE_EFFECTS (t) = 1;
1019 break;
1021 case tcc_declaration:
1022 if (CODE_CONTAINS_STRUCT (code, TS_DECL_COMMON))
1024 if (code == FUNCTION_DECL)
1026 SET_DECL_ALIGN (t, FUNCTION_ALIGNMENT (FUNCTION_BOUNDARY));
1027 SET_DECL_MODE (t, FUNCTION_MODE);
1029 else
1030 SET_DECL_ALIGN (t, 1);
1032 DECL_SOURCE_LOCATION (t) = input_location;
1033 if (TREE_CODE (t) == DEBUG_EXPR_DECL)
1034 DECL_UID (t) = --next_debug_decl_uid;
1035 else
1037 DECL_UID (t) = allocate_decl_uid ();
1038 SET_DECL_PT_UID (t, -1);
1040 if (TREE_CODE (t) == LABEL_DECL)
1041 LABEL_DECL_UID (t) = -1;
1043 break;
1045 case tcc_type:
1046 TYPE_UID (t) = next_type_uid++;
1047 SET_TYPE_ALIGN (t, BITS_PER_UNIT);
1048 TYPE_USER_ALIGN (t) = 0;
1049 TYPE_MAIN_VARIANT (t) = t;
1050 TYPE_CANONICAL (t) = t;
1052 /* Default to no attributes for type, but let target change that. */
1053 TYPE_ATTRIBUTES (t) = NULL_TREE;
1054 targetm.set_default_type_attributes (t);
1056 /* We have not yet computed the alias set for this type. */
1057 TYPE_ALIAS_SET (t) = -1;
1058 break;
1060 case tcc_constant:
1061 TREE_CONSTANT (t) = 1;
1062 break;
1064 case tcc_expression:
1065 switch (code)
1067 case INIT_EXPR:
1068 case MODIFY_EXPR:
1069 case VA_ARG_EXPR:
1070 case PREDECREMENT_EXPR:
1071 case PREINCREMENT_EXPR:
1072 case POSTDECREMENT_EXPR:
1073 case POSTINCREMENT_EXPR:
1074 /* All of these have side-effects, no matter what their
1075 operands are. */
1076 TREE_SIDE_EFFECTS (t) = 1;
1077 break;
1079 default:
1080 break;
1082 break;
1084 case tcc_exceptional:
1085 switch (code)
1087 case TARGET_OPTION_NODE:
1088 TREE_TARGET_OPTION(t)
1089 = ggc_cleared_alloc<struct cl_target_option> ();
1090 break;
1092 case OPTIMIZATION_NODE:
1093 TREE_OPTIMIZATION (t)
1094 = ggc_cleared_alloc<struct cl_optimization> ();
1095 break;
1097 default:
1098 break;
1100 break;
1102 default:
1103 /* Other classes need no special treatment. */
1104 break;
1107 return t;
1110 /* Free tree node. */
1112 void
1113 free_node (tree node)
1115 enum tree_code code = TREE_CODE (node);
1116 if (GATHER_STATISTICS)
1118 tree_code_counts[(int) TREE_CODE (node)]--;
1119 tree_node_counts[(int) t_kind]--;
1120 tree_node_sizes[(int) t_kind] -= tree_size (node);
1122 if (CODE_CONTAINS_STRUCT (code, TS_CONSTRUCTOR))
1123 vec_free (CONSTRUCTOR_ELTS (node));
1124 else if (code == BLOCK)
1125 vec_free (BLOCK_NONLOCALIZED_VARS (node));
1126 else if (code == TREE_BINFO)
1127 vec_free (BINFO_BASE_ACCESSES (node));
1128 ggc_free (node);
1131 /* Return a new node with the same contents as NODE except that its
1132 TREE_CHAIN, if it has one, is zero and it has a fresh uid. */
1134 tree
1135 copy_node (tree node MEM_STAT_DECL)
1137 tree t;
1138 enum tree_code code = TREE_CODE (node);
1139 size_t length;
1141 gcc_assert (code != STATEMENT_LIST);
1143 length = tree_size (node);
1144 record_node_allocation_statistics (code, length);
1145 t = ggc_alloc_tree_node_stat (length PASS_MEM_STAT);
1146 memcpy (t, node, length);
1148 if (CODE_CONTAINS_STRUCT (code, TS_COMMON))
1149 TREE_CHAIN (t) = 0;
1150 TREE_ASM_WRITTEN (t) = 0;
1151 TREE_VISITED (t) = 0;
1153 if (TREE_CODE_CLASS (code) == tcc_declaration)
1155 if (code == DEBUG_EXPR_DECL)
1156 DECL_UID (t) = --next_debug_decl_uid;
1157 else
1159 DECL_UID (t) = allocate_decl_uid ();
1160 if (DECL_PT_UID_SET_P (node))
1161 SET_DECL_PT_UID (t, DECL_PT_UID (node));
1163 if ((TREE_CODE (node) == PARM_DECL || VAR_P (node))
1164 && DECL_HAS_VALUE_EXPR_P (node))
1166 SET_DECL_VALUE_EXPR (t, DECL_VALUE_EXPR (node));
1167 DECL_HAS_VALUE_EXPR_P (t) = 1;
1169 /* DECL_DEBUG_EXPR is copied explicitely by callers. */
1170 if (VAR_P (node))
1172 DECL_HAS_DEBUG_EXPR_P (t) = 0;
1173 t->decl_with_vis.symtab_node = NULL;
1175 if (VAR_P (node) && DECL_HAS_INIT_PRIORITY_P (node))
1177 SET_DECL_INIT_PRIORITY (t, DECL_INIT_PRIORITY (node));
1178 DECL_HAS_INIT_PRIORITY_P (t) = 1;
1180 if (TREE_CODE (node) == FUNCTION_DECL)
1182 DECL_STRUCT_FUNCTION (t) = NULL;
1183 t->decl_with_vis.symtab_node = NULL;
1186 else if (TREE_CODE_CLASS (code) == tcc_type)
1188 TYPE_UID (t) = next_type_uid++;
1189 /* The following is so that the debug code for
1190 the copy is different from the original type.
1191 The two statements usually duplicate each other
1192 (because they clear fields of the same union),
1193 but the optimizer should catch that. */
1194 TYPE_SYMTAB_POINTER (t) = 0;
1195 TYPE_SYMTAB_ADDRESS (t) = 0;
1197 /* Do not copy the values cache. */
1198 if (TYPE_CACHED_VALUES_P (t))
1200 TYPE_CACHED_VALUES_P (t) = 0;
1201 TYPE_CACHED_VALUES (t) = NULL_TREE;
1204 else if (code == TARGET_OPTION_NODE)
1206 TREE_TARGET_OPTION (t) = ggc_alloc<struct cl_target_option>();
1207 memcpy (TREE_TARGET_OPTION (t), TREE_TARGET_OPTION (node),
1208 sizeof (struct cl_target_option));
1210 else if (code == OPTIMIZATION_NODE)
1212 TREE_OPTIMIZATION (t) = ggc_alloc<struct cl_optimization>();
1213 memcpy (TREE_OPTIMIZATION (t), TREE_OPTIMIZATION (node),
1214 sizeof (struct cl_optimization));
1217 return t;
1220 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
1221 For example, this can copy a list made of TREE_LIST nodes. */
1223 tree
1224 copy_list (tree list)
1226 tree head;
1227 tree prev, next;
1229 if (list == 0)
1230 return 0;
1232 head = prev = copy_node (list);
1233 next = TREE_CHAIN (list);
1234 while (next)
1236 TREE_CHAIN (prev) = copy_node (next);
1237 prev = TREE_CHAIN (prev);
1238 next = TREE_CHAIN (next);
1240 return head;
1244 /* Return the value that TREE_INT_CST_EXT_NUNITS should have for an
1245 INTEGER_CST with value CST and type TYPE. */
1247 static unsigned int
1248 get_int_cst_ext_nunits (tree type, const wide_int &cst)
1250 gcc_checking_assert (cst.get_precision () == TYPE_PRECISION (type));
1251 /* We need extra HWIs if CST is an unsigned integer with its
1252 upper bit set. */
1253 if (TYPE_UNSIGNED (type) && wi::neg_p (cst))
1254 return cst.get_precision () / HOST_BITS_PER_WIDE_INT + 1;
1255 return cst.get_len ();
1258 /* Return a new INTEGER_CST with value CST and type TYPE. */
1260 static tree
1261 build_new_int_cst (tree type, const wide_int &cst)
1263 unsigned int len = cst.get_len ();
1264 unsigned int ext_len = get_int_cst_ext_nunits (type, cst);
1265 tree nt = make_int_cst (len, ext_len);
1267 if (len < ext_len)
1269 --ext_len;
1270 TREE_INT_CST_ELT (nt, ext_len)
1271 = zext_hwi (-1, cst.get_precision () % HOST_BITS_PER_WIDE_INT);
1272 for (unsigned int i = len; i < ext_len; ++i)
1273 TREE_INT_CST_ELT (nt, i) = -1;
1275 else if (TYPE_UNSIGNED (type)
1276 && cst.get_precision () < len * HOST_BITS_PER_WIDE_INT)
1278 len--;
1279 TREE_INT_CST_ELT (nt, len)
1280 = zext_hwi (cst.elt (len),
1281 cst.get_precision () % HOST_BITS_PER_WIDE_INT);
1284 for (unsigned int i = 0; i < len; i++)
1285 TREE_INT_CST_ELT (nt, i) = cst.elt (i);
1286 TREE_TYPE (nt) = type;
1287 return nt;
1290 /* Create an INT_CST node with a LOW value sign extended to TYPE. */
1292 tree
1293 build_int_cst (tree type, HOST_WIDE_INT low)
1295 /* Support legacy code. */
1296 if (!type)
1297 type = integer_type_node;
1299 return wide_int_to_tree (type, wi::shwi (low, TYPE_PRECISION (type)));
1302 tree
1303 build_int_cstu (tree type, unsigned HOST_WIDE_INT cst)
1305 return wide_int_to_tree (type, wi::uhwi (cst, TYPE_PRECISION (type)));
1308 /* Create an INT_CST node with a LOW value sign extended to TYPE. */
1310 tree
1311 build_int_cst_type (tree type, HOST_WIDE_INT low)
1313 gcc_assert (type);
1314 return wide_int_to_tree (type, wi::shwi (low, TYPE_PRECISION (type)));
1317 /* Constructs tree in type TYPE from with value given by CST. Signedness
1318 of CST is assumed to be the same as the signedness of TYPE. */
1320 tree
1321 double_int_to_tree (tree type, double_int cst)
1323 return wide_int_to_tree (type, widest_int::from (cst, TYPE_SIGN (type)));
1326 /* We force the wide_int CST to the range of the type TYPE by sign or
1327 zero extending it. OVERFLOWABLE indicates if we are interested in
1328 overflow of the value, when >0 we are only interested in signed
1329 overflow, for <0 we are interested in any overflow. OVERFLOWED
1330 indicates whether overflow has already occurred. CONST_OVERFLOWED
1331 indicates whether constant overflow has already occurred. We force
1332 T's value to be within range of T's type (by setting to 0 or 1 all
1333 the bits outside the type's range). We set TREE_OVERFLOWED if,
1334 OVERFLOWED is nonzero,
1335 or OVERFLOWABLE is >0 and signed overflow occurs
1336 or OVERFLOWABLE is <0 and any overflow occurs
1337 We return a new tree node for the extended wide_int. The node
1338 is shared if no overflow flags are set. */
1341 tree
1342 force_fit_type (tree type, const wide_int_ref &cst,
1343 int overflowable, bool overflowed)
1345 signop sign = TYPE_SIGN (type);
1347 /* If we need to set overflow flags, return a new unshared node. */
1348 if (overflowed || !wi::fits_to_tree_p (cst, type))
1350 if (overflowed
1351 || overflowable < 0
1352 || (overflowable > 0 && sign == SIGNED))
1354 wide_int tmp = wide_int::from (cst, TYPE_PRECISION (type), sign);
1355 tree t = build_new_int_cst (type, tmp);
1356 TREE_OVERFLOW (t) = 1;
1357 return t;
1361 /* Else build a shared node. */
1362 return wide_int_to_tree (type, cst);
1365 /* These are the hash table functions for the hash table of INTEGER_CST
1366 nodes of a sizetype. */
1368 /* Return the hash code X, an INTEGER_CST. */
1370 hashval_t
1371 int_cst_hasher::hash (tree x)
1373 const_tree const t = x;
1374 hashval_t code = TYPE_UID (TREE_TYPE (t));
1375 int i;
1377 for (i = 0; i < TREE_INT_CST_NUNITS (t); i++)
1378 code = iterative_hash_host_wide_int (TREE_INT_CST_ELT(t, i), code);
1380 return code;
1383 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
1384 is the same as that given by *Y, which is the same. */
1386 bool
1387 int_cst_hasher::equal (tree x, tree y)
1389 const_tree const xt = x;
1390 const_tree const yt = y;
1392 if (TREE_TYPE (xt) != TREE_TYPE (yt)
1393 || TREE_INT_CST_NUNITS (xt) != TREE_INT_CST_NUNITS (yt)
1394 || TREE_INT_CST_EXT_NUNITS (xt) != TREE_INT_CST_EXT_NUNITS (yt))
1395 return false;
1397 for (int i = 0; i < TREE_INT_CST_NUNITS (xt); i++)
1398 if (TREE_INT_CST_ELT (xt, i) != TREE_INT_CST_ELT (yt, i))
1399 return false;
1401 return true;
1404 /* Create an INT_CST node of TYPE and value CST.
1405 The returned node is always shared. For small integers we use a
1406 per-type vector cache, for larger ones we use a single hash table.
1407 The value is extended from its precision according to the sign of
1408 the type to be a multiple of HOST_BITS_PER_WIDE_INT. This defines
1409 the upper bits and ensures that hashing and value equality based
1410 upon the underlying HOST_WIDE_INTs works without masking. */
1412 tree
1413 wide_int_to_tree (tree type, const wide_int_ref &pcst)
1415 tree t;
1416 int ix = -1;
1417 int limit = 0;
1419 gcc_assert (type);
1420 unsigned int prec = TYPE_PRECISION (type);
1421 signop sgn = TYPE_SIGN (type);
1423 /* Verify that everything is canonical. */
1424 int l = pcst.get_len ();
1425 if (l > 1)
1427 if (pcst.elt (l - 1) == 0)
1428 gcc_checking_assert (pcst.elt (l - 2) < 0);
1429 if (pcst.elt (l - 1) == HOST_WIDE_INT_M1)
1430 gcc_checking_assert (pcst.elt (l - 2) >= 0);
1433 wide_int cst = wide_int::from (pcst, prec, sgn);
1434 unsigned int ext_len = get_int_cst_ext_nunits (type, cst);
1436 if (ext_len == 1)
1438 /* We just need to store a single HOST_WIDE_INT. */
1439 HOST_WIDE_INT hwi;
1440 if (TYPE_UNSIGNED (type))
1441 hwi = cst.to_uhwi ();
1442 else
1443 hwi = cst.to_shwi ();
1445 switch (TREE_CODE (type))
1447 case NULLPTR_TYPE:
1448 gcc_assert (hwi == 0);
1449 /* Fallthru. */
1451 case POINTER_TYPE:
1452 case REFERENCE_TYPE:
1453 case POINTER_BOUNDS_TYPE:
1454 /* Cache NULL pointer and zero bounds. */
1455 if (hwi == 0)
1457 limit = 1;
1458 ix = 0;
1460 break;
1462 case BOOLEAN_TYPE:
1463 /* Cache false or true. */
1464 limit = 2;
1465 if (IN_RANGE (hwi, 0, 1))
1466 ix = hwi;
1467 break;
1469 case INTEGER_TYPE:
1470 case OFFSET_TYPE:
1471 if (TYPE_SIGN (type) == UNSIGNED)
1473 /* Cache [0, N). */
1474 limit = INTEGER_SHARE_LIMIT;
1475 if (IN_RANGE (hwi, 0, INTEGER_SHARE_LIMIT - 1))
1476 ix = hwi;
1478 else
1480 /* Cache [-1, N). */
1481 limit = INTEGER_SHARE_LIMIT + 1;
1482 if (IN_RANGE (hwi, -1, INTEGER_SHARE_LIMIT - 1))
1483 ix = hwi + 1;
1485 break;
1487 case ENUMERAL_TYPE:
1488 break;
1490 default:
1491 gcc_unreachable ();
1494 if (ix >= 0)
1496 /* Look for it in the type's vector of small shared ints. */
1497 if (!TYPE_CACHED_VALUES_P (type))
1499 TYPE_CACHED_VALUES_P (type) = 1;
1500 TYPE_CACHED_VALUES (type) = make_tree_vec (limit);
1503 t = TREE_VEC_ELT (TYPE_CACHED_VALUES (type), ix);
1504 if (t)
1505 /* Make sure no one is clobbering the shared constant. */
1506 gcc_checking_assert (TREE_TYPE (t) == type
1507 && TREE_INT_CST_NUNITS (t) == 1
1508 && TREE_INT_CST_OFFSET_NUNITS (t) == 1
1509 && TREE_INT_CST_EXT_NUNITS (t) == 1
1510 && TREE_INT_CST_ELT (t, 0) == hwi);
1511 else
1513 /* Create a new shared int. */
1514 t = build_new_int_cst (type, cst);
1515 TREE_VEC_ELT (TYPE_CACHED_VALUES (type), ix) = t;
1518 else
1520 /* Use the cache of larger shared ints, using int_cst_node as
1521 a temporary. */
1523 TREE_INT_CST_ELT (int_cst_node, 0) = hwi;
1524 TREE_TYPE (int_cst_node) = type;
1526 tree *slot = int_cst_hash_table->find_slot (int_cst_node, INSERT);
1527 t = *slot;
1528 if (!t)
1530 /* Insert this one into the hash table. */
1531 t = int_cst_node;
1532 *slot = t;
1533 /* Make a new node for next time round. */
1534 int_cst_node = make_int_cst (1, 1);
1538 else
1540 /* The value either hashes properly or we drop it on the floor
1541 for the gc to take care of. There will not be enough of them
1542 to worry about. */
1544 tree nt = build_new_int_cst (type, cst);
1545 tree *slot = int_cst_hash_table->find_slot (nt, INSERT);
1546 t = *slot;
1547 if (!t)
1549 /* Insert this one into the hash table. */
1550 t = nt;
1551 *slot = t;
1555 return t;
1558 void
1559 cache_integer_cst (tree t)
1561 tree type = TREE_TYPE (t);
1562 int ix = -1;
1563 int limit = 0;
1564 int prec = TYPE_PRECISION (type);
1566 gcc_assert (!TREE_OVERFLOW (t));
1568 switch (TREE_CODE (type))
1570 case NULLPTR_TYPE:
1571 gcc_assert (integer_zerop (t));
1572 /* Fallthru. */
1574 case POINTER_TYPE:
1575 case REFERENCE_TYPE:
1576 /* Cache NULL pointer. */
1577 if (integer_zerop (t))
1579 limit = 1;
1580 ix = 0;
1582 break;
1584 case BOOLEAN_TYPE:
1585 /* Cache false or true. */
1586 limit = 2;
1587 if (wi::ltu_p (t, 2))
1588 ix = TREE_INT_CST_ELT (t, 0);
1589 break;
1591 case INTEGER_TYPE:
1592 case OFFSET_TYPE:
1593 if (TYPE_UNSIGNED (type))
1595 /* Cache 0..N */
1596 limit = INTEGER_SHARE_LIMIT;
1598 /* This is a little hokie, but if the prec is smaller than
1599 what is necessary to hold INTEGER_SHARE_LIMIT, then the
1600 obvious test will not get the correct answer. */
1601 if (prec < HOST_BITS_PER_WIDE_INT)
1603 if (tree_to_uhwi (t) < (unsigned HOST_WIDE_INT) INTEGER_SHARE_LIMIT)
1604 ix = tree_to_uhwi (t);
1606 else if (wi::ltu_p (t, INTEGER_SHARE_LIMIT))
1607 ix = tree_to_uhwi (t);
1609 else
1611 /* Cache -1..N */
1612 limit = INTEGER_SHARE_LIMIT + 1;
1614 if (integer_minus_onep (t))
1615 ix = 0;
1616 else if (!wi::neg_p (t))
1618 if (prec < HOST_BITS_PER_WIDE_INT)
1620 if (tree_to_shwi (t) < INTEGER_SHARE_LIMIT)
1621 ix = tree_to_shwi (t) + 1;
1623 else if (wi::ltu_p (t, INTEGER_SHARE_LIMIT))
1624 ix = tree_to_shwi (t) + 1;
1627 break;
1629 case ENUMERAL_TYPE:
1630 break;
1632 default:
1633 gcc_unreachable ();
1636 if (ix >= 0)
1638 /* Look for it in the type's vector of small shared ints. */
1639 if (!TYPE_CACHED_VALUES_P (type))
1641 TYPE_CACHED_VALUES_P (type) = 1;
1642 TYPE_CACHED_VALUES (type) = make_tree_vec (limit);
1645 gcc_assert (TREE_VEC_ELT (TYPE_CACHED_VALUES (type), ix) == NULL_TREE);
1646 TREE_VEC_ELT (TYPE_CACHED_VALUES (type), ix) = t;
1648 else
1650 /* Use the cache of larger shared ints. */
1651 tree *slot = int_cst_hash_table->find_slot (t, INSERT);
1652 /* If there is already an entry for the number verify it's the
1653 same. */
1654 if (*slot)
1655 gcc_assert (wi::eq_p (tree (*slot), t));
1656 else
1657 /* Otherwise insert this one into the hash table. */
1658 *slot = t;
1663 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
1664 and the rest are zeros. */
1666 tree
1667 build_low_bits_mask (tree type, unsigned bits)
1669 gcc_assert (bits <= TYPE_PRECISION (type));
1671 return wide_int_to_tree (type, wi::mask (bits, false,
1672 TYPE_PRECISION (type)));
1675 /* Checks that X is integer constant that can be expressed in (unsigned)
1676 HOST_WIDE_INT without loss of precision. */
1678 bool
1679 cst_and_fits_in_hwi (const_tree x)
1681 return (TREE_CODE (x) == INTEGER_CST
1682 && (tree_fits_shwi_p (x) || tree_fits_uhwi_p (x)));
1685 /* Build a newly constructed VECTOR_CST node of length LEN. */
1687 tree
1688 make_vector (unsigned len MEM_STAT_DECL)
1690 tree t;
1691 unsigned length = (len - 1) * sizeof (tree) + sizeof (struct tree_vector);
1693 record_node_allocation_statistics (VECTOR_CST, length);
1695 t = ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT);
1697 TREE_SET_CODE (t, VECTOR_CST);
1698 TREE_CONSTANT (t) = 1;
1700 return t;
1703 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1704 are in a list pointed to by VALS. */
1706 tree
1707 build_vector (tree type, tree *vals MEM_STAT_DECL)
1709 int over = 0;
1710 unsigned cnt = 0;
1711 tree v = make_vector (TYPE_VECTOR_SUBPARTS (type));
1712 TREE_TYPE (v) = type;
1714 /* Iterate through elements and check for overflow. */
1715 for (cnt = 0; cnt < TYPE_VECTOR_SUBPARTS (type); ++cnt)
1717 tree value = vals[cnt];
1719 VECTOR_CST_ELT (v, cnt) = value;
1721 /* Don't crash if we get an address constant. */
1722 if (!CONSTANT_CLASS_P (value))
1723 continue;
1725 over |= TREE_OVERFLOW (value);
1728 TREE_OVERFLOW (v) = over;
1729 return v;
1732 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1733 are extracted from V, a vector of CONSTRUCTOR_ELT. */
1735 tree
1736 build_vector_from_ctor (tree type, vec<constructor_elt, va_gc> *v)
1738 tree *vec = XALLOCAVEC (tree, TYPE_VECTOR_SUBPARTS (type));
1739 unsigned HOST_WIDE_INT idx, pos = 0;
1740 tree value;
1742 FOR_EACH_CONSTRUCTOR_VALUE (v, idx, value)
1744 if (TREE_CODE (value) == VECTOR_CST)
1745 for (unsigned i = 0; i < VECTOR_CST_NELTS (value); ++i)
1746 vec[pos++] = VECTOR_CST_ELT (value, i);
1747 else
1748 vec[pos++] = value;
1750 while (pos < TYPE_VECTOR_SUBPARTS (type))
1751 vec[pos++] = build_zero_cst (TREE_TYPE (type));
1753 return build_vector (type, vec);
1756 /* Build a vector of type VECTYPE where all the elements are SCs. */
1757 tree
1758 build_vector_from_val (tree vectype, tree sc)
1760 int i, nunits = TYPE_VECTOR_SUBPARTS (vectype);
1762 if (sc == error_mark_node)
1763 return sc;
1765 /* Verify that the vector type is suitable for SC. Note that there
1766 is some inconsistency in the type-system with respect to restrict
1767 qualifications of pointers. Vector types always have a main-variant
1768 element type and the qualification is applied to the vector-type.
1769 So TREE_TYPE (vector-type) does not return a properly qualified
1770 vector element-type. */
1771 gcc_checking_assert (types_compatible_p (TYPE_MAIN_VARIANT (TREE_TYPE (sc)),
1772 TREE_TYPE (vectype)));
1774 if (CONSTANT_CLASS_P (sc))
1776 tree *v = XALLOCAVEC (tree, nunits);
1777 for (i = 0; i < nunits; ++i)
1778 v[i] = sc;
1779 return build_vector (vectype, v);
1781 else
1783 vec<constructor_elt, va_gc> *v;
1784 vec_alloc (v, nunits);
1785 for (i = 0; i < nunits; ++i)
1786 CONSTRUCTOR_APPEND_ELT (v, NULL_TREE, sc);
1787 return build_constructor (vectype, v);
1791 /* Something has messed with the elements of CONSTRUCTOR C after it was built;
1792 calculate TREE_CONSTANT and TREE_SIDE_EFFECTS. */
1794 void
1795 recompute_constructor_flags (tree c)
1797 unsigned int i;
1798 tree val;
1799 bool constant_p = true;
1800 bool side_effects_p = false;
1801 vec<constructor_elt, va_gc> *vals = CONSTRUCTOR_ELTS (c);
1803 FOR_EACH_CONSTRUCTOR_VALUE (vals, i, val)
1805 /* Mostly ctors will have elts that don't have side-effects, so
1806 the usual case is to scan all the elements. Hence a single
1807 loop for both const and side effects, rather than one loop
1808 each (with early outs). */
1809 if (!TREE_CONSTANT (val))
1810 constant_p = false;
1811 if (TREE_SIDE_EFFECTS (val))
1812 side_effects_p = true;
1815 TREE_SIDE_EFFECTS (c) = side_effects_p;
1816 TREE_CONSTANT (c) = constant_p;
1819 /* Make sure that TREE_CONSTANT and TREE_SIDE_EFFECTS are correct for
1820 CONSTRUCTOR C. */
1822 void
1823 verify_constructor_flags (tree c)
1825 unsigned int i;
1826 tree val;
1827 bool constant_p = TREE_CONSTANT (c);
1828 bool side_effects_p = TREE_SIDE_EFFECTS (c);
1829 vec<constructor_elt, va_gc> *vals = CONSTRUCTOR_ELTS (c);
1831 FOR_EACH_CONSTRUCTOR_VALUE (vals, i, val)
1833 if (constant_p && !TREE_CONSTANT (val))
1834 internal_error ("non-constant element in constant CONSTRUCTOR");
1835 if (!side_effects_p && TREE_SIDE_EFFECTS (val))
1836 internal_error ("side-effects element in no-side-effects CONSTRUCTOR");
1840 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1841 are in the vec pointed to by VALS. */
1842 tree
1843 build_constructor (tree type, vec<constructor_elt, va_gc> *vals)
1845 tree c = make_node (CONSTRUCTOR);
1847 TREE_TYPE (c) = type;
1848 CONSTRUCTOR_ELTS (c) = vals;
1850 recompute_constructor_flags (c);
1852 return c;
1855 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
1856 INDEX and VALUE. */
1857 tree
1858 build_constructor_single (tree type, tree index, tree value)
1860 vec<constructor_elt, va_gc> *v;
1861 constructor_elt elt = {index, value};
1863 vec_alloc (v, 1);
1864 v->quick_push (elt);
1866 return build_constructor (type, v);
1870 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1871 are in a list pointed to by VALS. */
1872 tree
1873 build_constructor_from_list (tree type, tree vals)
1875 tree t;
1876 vec<constructor_elt, va_gc> *v = NULL;
1878 if (vals)
1880 vec_alloc (v, list_length (vals));
1881 for (t = vals; t; t = TREE_CHAIN (t))
1882 CONSTRUCTOR_APPEND_ELT (v, TREE_PURPOSE (t), TREE_VALUE (t));
1885 return build_constructor (type, v);
1888 /* Return a new CONSTRUCTOR node whose type is TYPE. NELTS is the number
1889 of elements, provided as index/value pairs. */
1891 tree
1892 build_constructor_va (tree type, int nelts, ...)
1894 vec<constructor_elt, va_gc> *v = NULL;
1895 va_list p;
1897 va_start (p, nelts);
1898 vec_alloc (v, nelts);
1899 while (nelts--)
1901 tree index = va_arg (p, tree);
1902 tree value = va_arg (p, tree);
1903 CONSTRUCTOR_APPEND_ELT (v, index, value);
1905 va_end (p);
1906 return build_constructor (type, v);
1909 /* Return a new FIXED_CST node whose type is TYPE and value is F. */
1911 tree
1912 build_fixed (tree type, FIXED_VALUE_TYPE f)
1914 tree v;
1915 FIXED_VALUE_TYPE *fp;
1917 v = make_node (FIXED_CST);
1918 fp = ggc_alloc<fixed_value> ();
1919 memcpy (fp, &f, sizeof (FIXED_VALUE_TYPE));
1921 TREE_TYPE (v) = type;
1922 TREE_FIXED_CST_PTR (v) = fp;
1923 return v;
1926 /* Return a new REAL_CST node whose type is TYPE and value is D. */
1928 tree
1929 build_real (tree type, REAL_VALUE_TYPE d)
1931 tree v;
1932 REAL_VALUE_TYPE *dp;
1933 int overflow = 0;
1935 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
1936 Consider doing it via real_convert now. */
1938 v = make_node (REAL_CST);
1939 dp = ggc_alloc<real_value> ();
1940 memcpy (dp, &d, sizeof (REAL_VALUE_TYPE));
1942 TREE_TYPE (v) = type;
1943 TREE_REAL_CST_PTR (v) = dp;
1944 TREE_OVERFLOW (v) = overflow;
1945 return v;
1948 /* Like build_real, but first truncate D to the type. */
1950 tree
1951 build_real_truncate (tree type, REAL_VALUE_TYPE d)
1953 return build_real (type, real_value_truncate (TYPE_MODE (type), d));
1956 /* Return a new REAL_CST node whose type is TYPE
1957 and whose value is the integer value of the INTEGER_CST node I. */
1959 REAL_VALUE_TYPE
1960 real_value_from_int_cst (const_tree type, const_tree i)
1962 REAL_VALUE_TYPE d;
1964 /* Clear all bits of the real value type so that we can later do
1965 bitwise comparisons to see if two values are the same. */
1966 memset (&d, 0, sizeof d);
1968 real_from_integer (&d, type ? TYPE_MODE (type) : VOIDmode, i,
1969 TYPE_SIGN (TREE_TYPE (i)));
1970 return d;
1973 /* Given a tree representing an integer constant I, return a tree
1974 representing the same value as a floating-point constant of type TYPE. */
1976 tree
1977 build_real_from_int_cst (tree type, const_tree i)
1979 tree v;
1980 int overflow = TREE_OVERFLOW (i);
1982 v = build_real (type, real_value_from_int_cst (type, i));
1984 TREE_OVERFLOW (v) |= overflow;
1985 return v;
1988 /* Return a newly constructed STRING_CST node whose value is
1989 the LEN characters at STR.
1990 Note that for a C string literal, LEN should include the trailing NUL.
1991 The TREE_TYPE is not initialized. */
1993 tree
1994 build_string (int len, const char *str)
1996 tree s;
1997 size_t length;
1999 /* Do not waste bytes provided by padding of struct tree_string. */
2000 length = len + offsetof (struct tree_string, str) + 1;
2002 record_node_allocation_statistics (STRING_CST, length);
2004 s = (tree) ggc_internal_alloc (length);
2006 memset (s, 0, sizeof (struct tree_typed));
2007 TREE_SET_CODE (s, STRING_CST);
2008 TREE_CONSTANT (s) = 1;
2009 TREE_STRING_LENGTH (s) = len;
2010 memcpy (s->string.str, str, len);
2011 s->string.str[len] = '\0';
2013 return s;
2016 /* Return a newly constructed COMPLEX_CST node whose value is
2017 specified by the real and imaginary parts REAL and IMAG.
2018 Both REAL and IMAG should be constant nodes. TYPE, if specified,
2019 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
2021 tree
2022 build_complex (tree type, tree real, tree imag)
2024 tree t = make_node (COMPLEX_CST);
2026 TREE_REALPART (t) = real;
2027 TREE_IMAGPART (t) = imag;
2028 TREE_TYPE (t) = type ? type : build_complex_type (TREE_TYPE (real));
2029 TREE_OVERFLOW (t) = TREE_OVERFLOW (real) | TREE_OVERFLOW (imag);
2030 return t;
2033 /* Build a complex (inf +- 0i), such as for the result of cproj.
2034 TYPE is the complex tree type of the result. If NEG is true, the
2035 imaginary zero is negative. */
2037 tree
2038 build_complex_inf (tree type, bool neg)
2040 REAL_VALUE_TYPE rinf, rzero = dconst0;
2042 real_inf (&rinf);
2043 rzero.sign = neg;
2044 return build_complex (type, build_real (TREE_TYPE (type), rinf),
2045 build_real (TREE_TYPE (type), rzero));
2048 /* Return the constant 1 in type TYPE. If TYPE has several elements, each
2049 element is set to 1. In particular, this is 1 + i for complex types. */
2051 tree
2052 build_each_one_cst (tree type)
2054 if (TREE_CODE (type) == COMPLEX_TYPE)
2056 tree scalar = build_one_cst (TREE_TYPE (type));
2057 return build_complex (type, scalar, scalar);
2059 else
2060 return build_one_cst (type);
2063 /* Return a constant of arithmetic type TYPE which is the
2064 multiplicative identity of the set TYPE. */
2066 tree
2067 build_one_cst (tree type)
2069 switch (TREE_CODE (type))
2071 case INTEGER_TYPE: case ENUMERAL_TYPE: case BOOLEAN_TYPE:
2072 case POINTER_TYPE: case REFERENCE_TYPE:
2073 case OFFSET_TYPE:
2074 return build_int_cst (type, 1);
2076 case REAL_TYPE:
2077 return build_real (type, dconst1);
2079 case FIXED_POINT_TYPE:
2080 /* We can only generate 1 for accum types. */
2081 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type)));
2082 return build_fixed (type, FCONST1 (TYPE_MODE (type)));
2084 case VECTOR_TYPE:
2086 tree scalar = build_one_cst (TREE_TYPE (type));
2088 return build_vector_from_val (type, scalar);
2091 case COMPLEX_TYPE:
2092 return build_complex (type,
2093 build_one_cst (TREE_TYPE (type)),
2094 build_zero_cst (TREE_TYPE (type)));
2096 default:
2097 gcc_unreachable ();
2101 /* Return an integer of type TYPE containing all 1's in as much precision as
2102 it contains, or a complex or vector whose subparts are such integers. */
2104 tree
2105 build_all_ones_cst (tree type)
2107 if (TREE_CODE (type) == COMPLEX_TYPE)
2109 tree scalar = build_all_ones_cst (TREE_TYPE (type));
2110 return build_complex (type, scalar, scalar);
2112 else
2113 return build_minus_one_cst (type);
2116 /* Return a constant of arithmetic type TYPE which is the
2117 opposite of the multiplicative identity of the set TYPE. */
2119 tree
2120 build_minus_one_cst (tree type)
2122 switch (TREE_CODE (type))
2124 case INTEGER_TYPE: case ENUMERAL_TYPE: case BOOLEAN_TYPE:
2125 case POINTER_TYPE: case REFERENCE_TYPE:
2126 case OFFSET_TYPE:
2127 return build_int_cst (type, -1);
2129 case REAL_TYPE:
2130 return build_real (type, dconstm1);
2132 case FIXED_POINT_TYPE:
2133 /* We can only generate 1 for accum types. */
2134 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type)));
2135 return build_fixed (type,
2136 fixed_from_double_int (double_int_minus_one,
2137 SCALAR_TYPE_MODE (type)));
2139 case VECTOR_TYPE:
2141 tree scalar = build_minus_one_cst (TREE_TYPE (type));
2143 return build_vector_from_val (type, scalar);
2146 case COMPLEX_TYPE:
2147 return build_complex (type,
2148 build_minus_one_cst (TREE_TYPE (type)),
2149 build_zero_cst (TREE_TYPE (type)));
2151 default:
2152 gcc_unreachable ();
2156 /* Build 0 constant of type TYPE. This is used by constructor folding
2157 and thus the constant should be represented in memory by
2158 zero(es). */
2160 tree
2161 build_zero_cst (tree type)
2163 switch (TREE_CODE (type))
2165 case INTEGER_TYPE: case ENUMERAL_TYPE: case BOOLEAN_TYPE:
2166 case POINTER_TYPE: case REFERENCE_TYPE:
2167 case OFFSET_TYPE: case NULLPTR_TYPE:
2168 return build_int_cst (type, 0);
2170 case REAL_TYPE:
2171 return build_real (type, dconst0);
2173 case FIXED_POINT_TYPE:
2174 return build_fixed (type, FCONST0 (TYPE_MODE (type)));
2176 case VECTOR_TYPE:
2178 tree scalar = build_zero_cst (TREE_TYPE (type));
2180 return build_vector_from_val (type, scalar);
2183 case COMPLEX_TYPE:
2185 tree zero = build_zero_cst (TREE_TYPE (type));
2187 return build_complex (type, zero, zero);
2190 default:
2191 if (!AGGREGATE_TYPE_P (type))
2192 return fold_convert (type, integer_zero_node);
2193 return build_constructor (type, NULL);
2198 /* Build a BINFO with LEN language slots. */
2200 tree
2201 make_tree_binfo (unsigned base_binfos MEM_STAT_DECL)
2203 tree t;
2204 size_t length = (offsetof (struct tree_binfo, base_binfos)
2205 + vec<tree, va_gc>::embedded_size (base_binfos));
2207 record_node_allocation_statistics (TREE_BINFO, length);
2209 t = ggc_alloc_tree_node_stat (length PASS_MEM_STAT);
2211 memset (t, 0, offsetof (struct tree_binfo, base_binfos));
2213 TREE_SET_CODE (t, TREE_BINFO);
2215 BINFO_BASE_BINFOS (t)->embedded_init (base_binfos);
2217 return t;
2220 /* Create a CASE_LABEL_EXPR tree node and return it. */
2222 tree
2223 build_case_label (tree low_value, tree high_value, tree label_decl)
2225 tree t = make_node (CASE_LABEL_EXPR);
2227 TREE_TYPE (t) = void_type_node;
2228 SET_EXPR_LOCATION (t, DECL_SOURCE_LOCATION (label_decl));
2230 CASE_LOW (t) = low_value;
2231 CASE_HIGH (t) = high_value;
2232 CASE_LABEL (t) = label_decl;
2233 CASE_CHAIN (t) = NULL_TREE;
2235 return t;
2238 /* Build a newly constructed INTEGER_CST node. LEN and EXT_LEN are the
2239 values of TREE_INT_CST_NUNITS and TREE_INT_CST_EXT_NUNITS respectively.
2240 The latter determines the length of the HOST_WIDE_INT vector. */
2242 tree
2243 make_int_cst (int len, int ext_len MEM_STAT_DECL)
2245 tree t;
2246 int length = ((ext_len - 1) * sizeof (HOST_WIDE_INT)
2247 + sizeof (struct tree_int_cst));
2249 gcc_assert (len);
2250 record_node_allocation_statistics (INTEGER_CST, length);
2252 t = ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT);
2254 TREE_SET_CODE (t, INTEGER_CST);
2255 TREE_INT_CST_NUNITS (t) = len;
2256 TREE_INT_CST_EXT_NUNITS (t) = ext_len;
2257 /* to_offset can only be applied to trees that are offset_int-sized
2258 or smaller. EXT_LEN is correct if it fits, otherwise the constant
2259 must be exactly the precision of offset_int and so LEN is correct. */
2260 if (ext_len <= OFFSET_INT_ELTS)
2261 TREE_INT_CST_OFFSET_NUNITS (t) = ext_len;
2262 else
2263 TREE_INT_CST_OFFSET_NUNITS (t) = len;
2265 TREE_CONSTANT (t) = 1;
2267 return t;
2270 /* Build a newly constructed TREE_VEC node of length LEN. */
2272 tree
2273 make_tree_vec (int len MEM_STAT_DECL)
2275 tree t;
2276 size_t length = (len - 1) * sizeof (tree) + sizeof (struct tree_vec);
2278 record_node_allocation_statistics (TREE_VEC, length);
2280 t = ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT);
2282 TREE_SET_CODE (t, TREE_VEC);
2283 TREE_VEC_LENGTH (t) = len;
2285 return t;
2288 /* Grow a TREE_VEC node to new length LEN. */
2290 tree
2291 grow_tree_vec (tree v, int len MEM_STAT_DECL)
2293 gcc_assert (TREE_CODE (v) == TREE_VEC);
2295 int oldlen = TREE_VEC_LENGTH (v);
2296 gcc_assert (len > oldlen);
2298 size_t oldlength = (oldlen - 1) * sizeof (tree) + sizeof (struct tree_vec);
2299 size_t length = (len - 1) * sizeof (tree) + sizeof (struct tree_vec);
2301 record_node_allocation_statistics (TREE_VEC, length - oldlength);
2303 v = (tree) ggc_realloc (v, length PASS_MEM_STAT);
2305 TREE_VEC_LENGTH (v) = len;
2307 return v;
2310 /* Return 1 if EXPR is the constant zero, whether it is integral, float or
2311 fixed, and scalar, complex or vector. */
2314 zerop (const_tree expr)
2316 return (integer_zerop (expr)
2317 || real_zerop (expr)
2318 || fixed_zerop (expr));
2321 /* Return 1 if EXPR is the integer constant zero or a complex constant
2322 of zero. */
2325 integer_zerop (const_tree expr)
2327 switch (TREE_CODE (expr))
2329 case INTEGER_CST:
2330 return wi::eq_p (expr, 0);
2331 case COMPLEX_CST:
2332 return (integer_zerop (TREE_REALPART (expr))
2333 && integer_zerop (TREE_IMAGPART (expr)));
2334 case VECTOR_CST:
2336 unsigned i;
2337 for (i = 0; i < VECTOR_CST_NELTS (expr); ++i)
2338 if (!integer_zerop (VECTOR_CST_ELT (expr, i)))
2339 return false;
2340 return true;
2342 default:
2343 return false;
2347 /* Return 1 if EXPR is the integer constant one or the corresponding
2348 complex constant. */
2351 integer_onep (const_tree expr)
2353 switch (TREE_CODE (expr))
2355 case INTEGER_CST:
2356 return wi::eq_p (wi::to_widest (expr), 1);
2357 case COMPLEX_CST:
2358 return (integer_onep (TREE_REALPART (expr))
2359 && integer_zerop (TREE_IMAGPART (expr)));
2360 case VECTOR_CST:
2362 unsigned i;
2363 for (i = 0; i < VECTOR_CST_NELTS (expr); ++i)
2364 if (!integer_onep (VECTOR_CST_ELT (expr, i)))
2365 return false;
2366 return true;
2368 default:
2369 return false;
2373 /* Return 1 if EXPR is the integer constant one. For complex and vector,
2374 return 1 if every piece is the integer constant one. */
2377 integer_each_onep (const_tree expr)
2379 if (TREE_CODE (expr) == COMPLEX_CST)
2380 return (integer_onep (TREE_REALPART (expr))
2381 && integer_onep (TREE_IMAGPART (expr)));
2382 else
2383 return integer_onep (expr);
2386 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
2387 it contains, or a complex or vector whose subparts are such integers. */
2390 integer_all_onesp (const_tree expr)
2392 if (TREE_CODE (expr) == COMPLEX_CST
2393 && integer_all_onesp (TREE_REALPART (expr))
2394 && integer_all_onesp (TREE_IMAGPART (expr)))
2395 return 1;
2397 else if (TREE_CODE (expr) == VECTOR_CST)
2399 unsigned i;
2400 for (i = 0; i < VECTOR_CST_NELTS (expr); ++i)
2401 if (!integer_all_onesp (VECTOR_CST_ELT (expr, i)))
2402 return 0;
2403 return 1;
2406 else if (TREE_CODE (expr) != INTEGER_CST)
2407 return 0;
2409 return wi::max_value (TYPE_PRECISION (TREE_TYPE (expr)), UNSIGNED) == expr;
2412 /* Return 1 if EXPR is the integer constant minus one. */
2415 integer_minus_onep (const_tree expr)
2417 if (TREE_CODE (expr) == COMPLEX_CST)
2418 return (integer_all_onesp (TREE_REALPART (expr))
2419 && integer_zerop (TREE_IMAGPART (expr)));
2420 else
2421 return integer_all_onesp (expr);
2424 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
2425 one bit on). */
2428 integer_pow2p (const_tree expr)
2430 if (TREE_CODE (expr) == COMPLEX_CST
2431 && integer_pow2p (TREE_REALPART (expr))
2432 && integer_zerop (TREE_IMAGPART (expr)))
2433 return 1;
2435 if (TREE_CODE (expr) != INTEGER_CST)
2436 return 0;
2438 return wi::popcount (expr) == 1;
2441 /* Return 1 if EXPR is an integer constant other than zero or a
2442 complex constant other than zero. */
2445 integer_nonzerop (const_tree expr)
2447 return ((TREE_CODE (expr) == INTEGER_CST
2448 && !wi::eq_p (expr, 0))
2449 || (TREE_CODE (expr) == COMPLEX_CST
2450 && (integer_nonzerop (TREE_REALPART (expr))
2451 || integer_nonzerop (TREE_IMAGPART (expr)))));
2454 /* Return 1 if EXPR is the integer constant one. For vector,
2455 return 1 if every piece is the integer constant minus one
2456 (representing the value TRUE). */
2459 integer_truep (const_tree expr)
2461 if (TREE_CODE (expr) == VECTOR_CST)
2462 return integer_all_onesp (expr);
2463 return integer_onep (expr);
2466 /* Return 1 if EXPR is the fixed-point constant zero. */
2469 fixed_zerop (const_tree expr)
2471 return (TREE_CODE (expr) == FIXED_CST
2472 && TREE_FIXED_CST (expr).data.is_zero ());
2475 /* Return the power of two represented by a tree node known to be a
2476 power of two. */
2479 tree_log2 (const_tree expr)
2481 if (TREE_CODE (expr) == COMPLEX_CST)
2482 return tree_log2 (TREE_REALPART (expr));
2484 return wi::exact_log2 (expr);
2487 /* Similar, but return the largest integer Y such that 2 ** Y is less
2488 than or equal to EXPR. */
2491 tree_floor_log2 (const_tree expr)
2493 if (TREE_CODE (expr) == COMPLEX_CST)
2494 return tree_log2 (TREE_REALPART (expr));
2496 return wi::floor_log2 (expr);
2499 /* Return number of known trailing zero bits in EXPR, or, if the value of
2500 EXPR is known to be zero, the precision of it's type. */
2502 unsigned int
2503 tree_ctz (const_tree expr)
2505 if (!INTEGRAL_TYPE_P (TREE_TYPE (expr))
2506 && !POINTER_TYPE_P (TREE_TYPE (expr)))
2507 return 0;
2509 unsigned int ret1, ret2, prec = TYPE_PRECISION (TREE_TYPE (expr));
2510 switch (TREE_CODE (expr))
2512 case INTEGER_CST:
2513 ret1 = wi::ctz (expr);
2514 return MIN (ret1, prec);
2515 case SSA_NAME:
2516 ret1 = wi::ctz (get_nonzero_bits (expr));
2517 return MIN (ret1, prec);
2518 case PLUS_EXPR:
2519 case MINUS_EXPR:
2520 case BIT_IOR_EXPR:
2521 case BIT_XOR_EXPR:
2522 case MIN_EXPR:
2523 case MAX_EXPR:
2524 ret1 = tree_ctz (TREE_OPERAND (expr, 0));
2525 if (ret1 == 0)
2526 return ret1;
2527 ret2 = tree_ctz (TREE_OPERAND (expr, 1));
2528 return MIN (ret1, ret2);
2529 case POINTER_PLUS_EXPR:
2530 ret1 = tree_ctz (TREE_OPERAND (expr, 0));
2531 ret2 = tree_ctz (TREE_OPERAND (expr, 1));
2532 /* Second operand is sizetype, which could be in theory
2533 wider than pointer's precision. Make sure we never
2534 return more than prec. */
2535 ret2 = MIN (ret2, prec);
2536 return MIN (ret1, ret2);
2537 case BIT_AND_EXPR:
2538 ret1 = tree_ctz (TREE_OPERAND (expr, 0));
2539 ret2 = tree_ctz (TREE_OPERAND (expr, 1));
2540 return MAX (ret1, ret2);
2541 case MULT_EXPR:
2542 ret1 = tree_ctz (TREE_OPERAND (expr, 0));
2543 ret2 = tree_ctz (TREE_OPERAND (expr, 1));
2544 return MIN (ret1 + ret2, prec);
2545 case LSHIFT_EXPR:
2546 ret1 = tree_ctz (TREE_OPERAND (expr, 0));
2547 if (tree_fits_uhwi_p (TREE_OPERAND (expr, 1))
2548 && (tree_to_uhwi (TREE_OPERAND (expr, 1)) < prec))
2550 ret2 = tree_to_uhwi (TREE_OPERAND (expr, 1));
2551 return MIN (ret1 + ret2, prec);
2553 return ret1;
2554 case RSHIFT_EXPR:
2555 if (tree_fits_uhwi_p (TREE_OPERAND (expr, 1))
2556 && (tree_to_uhwi (TREE_OPERAND (expr, 1)) < prec))
2558 ret1 = tree_ctz (TREE_OPERAND (expr, 0));
2559 ret2 = tree_to_uhwi (TREE_OPERAND (expr, 1));
2560 if (ret1 > ret2)
2561 return ret1 - ret2;
2563 return 0;
2564 case TRUNC_DIV_EXPR:
2565 case CEIL_DIV_EXPR:
2566 case FLOOR_DIV_EXPR:
2567 case ROUND_DIV_EXPR:
2568 case EXACT_DIV_EXPR:
2569 if (TREE_CODE (TREE_OPERAND (expr, 1)) == INTEGER_CST
2570 && tree_int_cst_sgn (TREE_OPERAND (expr, 1)) == 1)
2572 int l = tree_log2 (TREE_OPERAND (expr, 1));
2573 if (l >= 0)
2575 ret1 = tree_ctz (TREE_OPERAND (expr, 0));
2576 ret2 = l;
2577 if (ret1 > ret2)
2578 return ret1 - ret2;
2581 return 0;
2582 CASE_CONVERT:
2583 ret1 = tree_ctz (TREE_OPERAND (expr, 0));
2584 if (ret1 && ret1 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (expr, 0))))
2585 ret1 = prec;
2586 return MIN (ret1, prec);
2587 case SAVE_EXPR:
2588 return tree_ctz (TREE_OPERAND (expr, 0));
2589 case COND_EXPR:
2590 ret1 = tree_ctz (TREE_OPERAND (expr, 1));
2591 if (ret1 == 0)
2592 return 0;
2593 ret2 = tree_ctz (TREE_OPERAND (expr, 2));
2594 return MIN (ret1, ret2);
2595 case COMPOUND_EXPR:
2596 return tree_ctz (TREE_OPERAND (expr, 1));
2597 case ADDR_EXPR:
2598 ret1 = get_pointer_alignment (CONST_CAST_TREE (expr));
2599 if (ret1 > BITS_PER_UNIT)
2601 ret1 = ctz_hwi (ret1 / BITS_PER_UNIT);
2602 return MIN (ret1, prec);
2604 return 0;
2605 default:
2606 return 0;
2610 /* Return 1 if EXPR is the real constant zero. Trailing zeroes matter for
2611 decimal float constants, so don't return 1 for them. */
2614 real_zerop (const_tree expr)
2616 switch (TREE_CODE (expr))
2618 case REAL_CST:
2619 return real_equal (&TREE_REAL_CST (expr), &dconst0)
2620 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr))));
2621 case COMPLEX_CST:
2622 return real_zerop (TREE_REALPART (expr))
2623 && real_zerop (TREE_IMAGPART (expr));
2624 case VECTOR_CST:
2626 unsigned i;
2627 for (i = 0; i < VECTOR_CST_NELTS (expr); ++i)
2628 if (!real_zerop (VECTOR_CST_ELT (expr, i)))
2629 return false;
2630 return true;
2632 default:
2633 return false;
2637 /* Return 1 if EXPR is the real constant one in real or complex form.
2638 Trailing zeroes matter for decimal float constants, so don't return
2639 1 for them. */
2642 real_onep (const_tree expr)
2644 switch (TREE_CODE (expr))
2646 case REAL_CST:
2647 return real_equal (&TREE_REAL_CST (expr), &dconst1)
2648 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr))));
2649 case COMPLEX_CST:
2650 return real_onep (TREE_REALPART (expr))
2651 && real_zerop (TREE_IMAGPART (expr));
2652 case VECTOR_CST:
2654 unsigned i;
2655 for (i = 0; i < VECTOR_CST_NELTS (expr); ++i)
2656 if (!real_onep (VECTOR_CST_ELT (expr, i)))
2657 return false;
2658 return true;
2660 default:
2661 return false;
2665 /* Return 1 if EXPR is the real constant minus one. Trailing zeroes
2666 matter for decimal float constants, so don't return 1 for them. */
2669 real_minus_onep (const_tree expr)
2671 switch (TREE_CODE (expr))
2673 case REAL_CST:
2674 return real_equal (&TREE_REAL_CST (expr), &dconstm1)
2675 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr))));
2676 case COMPLEX_CST:
2677 return real_minus_onep (TREE_REALPART (expr))
2678 && real_zerop (TREE_IMAGPART (expr));
2679 case VECTOR_CST:
2681 unsigned i;
2682 for (i = 0; i < VECTOR_CST_NELTS (expr); ++i)
2683 if (!real_minus_onep (VECTOR_CST_ELT (expr, i)))
2684 return false;
2685 return true;
2687 default:
2688 return false;
2692 /* Nonzero if EXP is a constant or a cast of a constant. */
2695 really_constant_p (const_tree exp)
2697 /* This is not quite the same as STRIP_NOPS. It does more. */
2698 while (CONVERT_EXPR_P (exp)
2699 || TREE_CODE (exp) == NON_LVALUE_EXPR)
2700 exp = TREE_OPERAND (exp, 0);
2701 return TREE_CONSTANT (exp);
2704 /* Return first list element whose TREE_VALUE is ELEM.
2705 Return 0 if ELEM is not in LIST. */
2707 tree
2708 value_member (tree elem, tree list)
2710 while (list)
2712 if (elem == TREE_VALUE (list))
2713 return list;
2714 list = TREE_CHAIN (list);
2716 return NULL_TREE;
2719 /* Return first list element whose TREE_PURPOSE is ELEM.
2720 Return 0 if ELEM is not in LIST. */
2722 tree
2723 purpose_member (const_tree elem, tree list)
2725 while (list)
2727 if (elem == TREE_PURPOSE (list))
2728 return list;
2729 list = TREE_CHAIN (list);
2731 return NULL_TREE;
2734 /* Return true if ELEM is in V. */
2736 bool
2737 vec_member (const_tree elem, vec<tree, va_gc> *v)
2739 unsigned ix;
2740 tree t;
2741 FOR_EACH_VEC_SAFE_ELT (v, ix, t)
2742 if (elem == t)
2743 return true;
2744 return false;
2747 /* Returns element number IDX (zero-origin) of chain CHAIN, or
2748 NULL_TREE. */
2750 tree
2751 chain_index (int idx, tree chain)
2753 for (; chain && idx > 0; --idx)
2754 chain = TREE_CHAIN (chain);
2755 return chain;
2758 /* Return nonzero if ELEM is part of the chain CHAIN. */
2761 chain_member (const_tree elem, const_tree chain)
2763 while (chain)
2765 if (elem == chain)
2766 return 1;
2767 chain = DECL_CHAIN (chain);
2770 return 0;
2773 /* Return the length of a chain of nodes chained through TREE_CHAIN.
2774 We expect a null pointer to mark the end of the chain.
2775 This is the Lisp primitive `length'. */
2778 list_length (const_tree t)
2780 const_tree p = t;
2781 #ifdef ENABLE_TREE_CHECKING
2782 const_tree q = t;
2783 #endif
2784 int len = 0;
2786 while (p)
2788 p = TREE_CHAIN (p);
2789 #ifdef ENABLE_TREE_CHECKING
2790 if (len % 2)
2791 q = TREE_CHAIN (q);
2792 gcc_assert (p != q);
2793 #endif
2794 len++;
2797 return len;
2800 /* Returns the first FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
2801 UNION_TYPE TYPE, or NULL_TREE if none. */
2803 tree
2804 first_field (const_tree type)
2806 tree t = TYPE_FIELDS (type);
2807 while (t && TREE_CODE (t) != FIELD_DECL)
2808 t = TREE_CHAIN (t);
2809 return t;
2812 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
2813 by modifying the last node in chain 1 to point to chain 2.
2814 This is the Lisp primitive `nconc'. */
2816 tree
2817 chainon (tree op1, tree op2)
2819 tree t1;
2821 if (!op1)
2822 return op2;
2823 if (!op2)
2824 return op1;
2826 for (t1 = op1; TREE_CHAIN (t1); t1 = TREE_CHAIN (t1))
2827 continue;
2828 TREE_CHAIN (t1) = op2;
2830 #ifdef ENABLE_TREE_CHECKING
2832 tree t2;
2833 for (t2 = op2; t2; t2 = TREE_CHAIN (t2))
2834 gcc_assert (t2 != t1);
2836 #endif
2838 return op1;
2841 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
2843 tree
2844 tree_last (tree chain)
2846 tree next;
2847 if (chain)
2848 while ((next = TREE_CHAIN (chain)))
2849 chain = next;
2850 return chain;
2853 /* Reverse the order of elements in the chain T,
2854 and return the new head of the chain (old last element). */
2856 tree
2857 nreverse (tree t)
2859 tree prev = 0, decl, next;
2860 for (decl = t; decl; decl = next)
2862 /* We shouldn't be using this function to reverse BLOCK chains; we
2863 have blocks_nreverse for that. */
2864 gcc_checking_assert (TREE_CODE (decl) != BLOCK);
2865 next = TREE_CHAIN (decl);
2866 TREE_CHAIN (decl) = prev;
2867 prev = decl;
2869 return prev;
2872 /* Return a newly created TREE_LIST node whose
2873 purpose and value fields are PARM and VALUE. */
2875 tree
2876 build_tree_list (tree parm, tree value MEM_STAT_DECL)
2878 tree t = make_node (TREE_LIST PASS_MEM_STAT);
2879 TREE_PURPOSE (t) = parm;
2880 TREE_VALUE (t) = value;
2881 return t;
2884 /* Build a chain of TREE_LIST nodes from a vector. */
2886 tree
2887 build_tree_list_vec (const vec<tree, va_gc> *vec MEM_STAT_DECL)
2889 tree ret = NULL_TREE;
2890 tree *pp = &ret;
2891 unsigned int i;
2892 tree t;
2893 FOR_EACH_VEC_SAFE_ELT (vec, i, t)
2895 *pp = build_tree_list (NULL, t PASS_MEM_STAT);
2896 pp = &TREE_CHAIN (*pp);
2898 return ret;
2901 /* Return a newly created TREE_LIST node whose
2902 purpose and value fields are PURPOSE and VALUE
2903 and whose TREE_CHAIN is CHAIN. */
2905 tree
2906 tree_cons (tree purpose, tree value, tree chain MEM_STAT_DECL)
2908 tree node;
2910 node = ggc_alloc_tree_node_stat (sizeof (struct tree_list) PASS_MEM_STAT);
2911 memset (node, 0, sizeof (struct tree_common));
2913 record_node_allocation_statistics (TREE_LIST, sizeof (struct tree_list));
2915 TREE_SET_CODE (node, TREE_LIST);
2916 TREE_CHAIN (node) = chain;
2917 TREE_PURPOSE (node) = purpose;
2918 TREE_VALUE (node) = value;
2919 return node;
2922 /* Return the values of the elements of a CONSTRUCTOR as a vector of
2923 trees. */
2925 vec<tree, va_gc> *
2926 ctor_to_vec (tree ctor)
2928 vec<tree, va_gc> *vec;
2929 vec_alloc (vec, CONSTRUCTOR_NELTS (ctor));
2930 unsigned int ix;
2931 tree val;
2933 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor), ix, val)
2934 vec->quick_push (val);
2936 return vec;
2939 /* Return the size nominally occupied by an object of type TYPE
2940 when it resides in memory. The value is measured in units of bytes,
2941 and its data type is that normally used for type sizes
2942 (which is the first type created by make_signed_type or
2943 make_unsigned_type). */
2945 tree
2946 size_in_bytes_loc (location_t loc, const_tree type)
2948 tree t;
2950 if (type == error_mark_node)
2951 return integer_zero_node;
2953 type = TYPE_MAIN_VARIANT (type);
2954 t = TYPE_SIZE_UNIT (type);
2956 if (t == 0)
2958 lang_hooks.types.incomplete_type_error (loc, NULL_TREE, type);
2959 return size_zero_node;
2962 return t;
2965 /* Return the size of TYPE (in bytes) as a wide integer
2966 or return -1 if the size can vary or is larger than an integer. */
2968 HOST_WIDE_INT
2969 int_size_in_bytes (const_tree type)
2971 tree t;
2973 if (type == error_mark_node)
2974 return 0;
2976 type = TYPE_MAIN_VARIANT (type);
2977 t = TYPE_SIZE_UNIT (type);
2979 if (t && tree_fits_uhwi_p (t))
2980 return TREE_INT_CST_LOW (t);
2981 else
2982 return -1;
2985 /* Return the maximum size of TYPE (in bytes) as a wide integer
2986 or return -1 if the size can vary or is larger than an integer. */
2988 HOST_WIDE_INT
2989 max_int_size_in_bytes (const_tree type)
2991 HOST_WIDE_INT size = -1;
2992 tree size_tree;
2994 /* If this is an array type, check for a possible MAX_SIZE attached. */
2996 if (TREE_CODE (type) == ARRAY_TYPE)
2998 size_tree = TYPE_ARRAY_MAX_SIZE (type);
3000 if (size_tree && tree_fits_uhwi_p (size_tree))
3001 size = tree_to_uhwi (size_tree);
3004 /* If we still haven't been able to get a size, see if the language
3005 can compute a maximum size. */
3007 if (size == -1)
3009 size_tree = lang_hooks.types.max_size (type);
3011 if (size_tree && tree_fits_uhwi_p (size_tree))
3012 size = tree_to_uhwi (size_tree);
3015 return size;
3018 /* Return the bit position of FIELD, in bits from the start of the record.
3019 This is a tree of type bitsizetype. */
3021 tree
3022 bit_position (const_tree field)
3024 return bit_from_pos (DECL_FIELD_OFFSET (field),
3025 DECL_FIELD_BIT_OFFSET (field));
3028 /* Return the byte position of FIELD, in bytes from the start of the record.
3029 This is a tree of type sizetype. */
3031 tree
3032 byte_position (const_tree field)
3034 return byte_from_pos (DECL_FIELD_OFFSET (field),
3035 DECL_FIELD_BIT_OFFSET (field));
3038 /* Likewise, but return as an integer. It must be representable in
3039 that way (since it could be a signed value, we don't have the
3040 option of returning -1 like int_size_in_byte can. */
3042 HOST_WIDE_INT
3043 int_byte_position (const_tree field)
3045 return tree_to_shwi (byte_position (field));
3048 /* Return the strictest alignment, in bits, that T is known to have. */
3050 unsigned int
3051 expr_align (const_tree t)
3053 unsigned int align0, align1;
3055 switch (TREE_CODE (t))
3057 CASE_CONVERT: case NON_LVALUE_EXPR:
3058 /* If we have conversions, we know that the alignment of the
3059 object must meet each of the alignments of the types. */
3060 align0 = expr_align (TREE_OPERAND (t, 0));
3061 align1 = TYPE_ALIGN (TREE_TYPE (t));
3062 return MAX (align0, align1);
3064 case SAVE_EXPR: case COMPOUND_EXPR: case MODIFY_EXPR:
3065 case INIT_EXPR: case TARGET_EXPR: case WITH_CLEANUP_EXPR:
3066 case CLEANUP_POINT_EXPR:
3067 /* These don't change the alignment of an object. */
3068 return expr_align (TREE_OPERAND (t, 0));
3070 case COND_EXPR:
3071 /* The best we can do is say that the alignment is the least aligned
3072 of the two arms. */
3073 align0 = expr_align (TREE_OPERAND (t, 1));
3074 align1 = expr_align (TREE_OPERAND (t, 2));
3075 return MIN (align0, align1);
3077 /* FIXME: LABEL_DECL and CONST_DECL never have DECL_ALIGN set
3078 meaningfully, it's always 1. */
3079 case LABEL_DECL: case CONST_DECL:
3080 case VAR_DECL: case PARM_DECL: case RESULT_DECL:
3081 case FUNCTION_DECL:
3082 gcc_assert (DECL_ALIGN (t) != 0);
3083 return DECL_ALIGN (t);
3085 default:
3086 break;
3089 /* Otherwise take the alignment from that of the type. */
3090 return TYPE_ALIGN (TREE_TYPE (t));
3093 /* Return, as a tree node, the number of elements for TYPE (which is an
3094 ARRAY_TYPE) minus one. This counts only elements of the top array. */
3096 tree
3097 array_type_nelts (const_tree type)
3099 tree index_type, min, max;
3101 /* If they did it with unspecified bounds, then we should have already
3102 given an error about it before we got here. */
3103 if (! TYPE_DOMAIN (type))
3104 return error_mark_node;
3106 index_type = TYPE_DOMAIN (type);
3107 min = TYPE_MIN_VALUE (index_type);
3108 max = TYPE_MAX_VALUE (index_type);
3110 /* TYPE_MAX_VALUE may not be set if the array has unknown length. */
3111 if (!max)
3112 return error_mark_node;
3114 return (integer_zerop (min)
3115 ? max
3116 : fold_build2 (MINUS_EXPR, TREE_TYPE (max), max, min));
3119 /* If arg is static -- a reference to an object in static storage -- then
3120 return the object. This is not the same as the C meaning of `static'.
3121 If arg isn't static, return NULL. */
3123 tree
3124 staticp (tree arg)
3126 switch (TREE_CODE (arg))
3128 case FUNCTION_DECL:
3129 /* Nested functions are static, even though taking their address will
3130 involve a trampoline as we unnest the nested function and create
3131 the trampoline on the tree level. */
3132 return arg;
3134 case VAR_DECL:
3135 return ((TREE_STATIC (arg) || DECL_EXTERNAL (arg))
3136 && ! DECL_THREAD_LOCAL_P (arg)
3137 && ! DECL_DLLIMPORT_P (arg)
3138 ? arg : NULL);
3140 case CONST_DECL:
3141 return ((TREE_STATIC (arg) || DECL_EXTERNAL (arg))
3142 ? arg : NULL);
3144 case CONSTRUCTOR:
3145 return TREE_STATIC (arg) ? arg : NULL;
3147 case LABEL_DECL:
3148 case STRING_CST:
3149 return arg;
3151 case COMPONENT_REF:
3152 /* If the thing being referenced is not a field, then it is
3153 something language specific. */
3154 gcc_assert (TREE_CODE (TREE_OPERAND (arg, 1)) == FIELD_DECL);
3156 /* If we are referencing a bitfield, we can't evaluate an
3157 ADDR_EXPR at compile time and so it isn't a constant. */
3158 if (DECL_BIT_FIELD (TREE_OPERAND (arg, 1)))
3159 return NULL;
3161 return staticp (TREE_OPERAND (arg, 0));
3163 case BIT_FIELD_REF:
3164 return NULL;
3166 case INDIRECT_REF:
3167 return TREE_CONSTANT (TREE_OPERAND (arg, 0)) ? arg : NULL;
3169 case ARRAY_REF:
3170 case ARRAY_RANGE_REF:
3171 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg))) == INTEGER_CST
3172 && TREE_CODE (TREE_OPERAND (arg, 1)) == INTEGER_CST)
3173 return staticp (TREE_OPERAND (arg, 0));
3174 else
3175 return NULL;
3177 case COMPOUND_LITERAL_EXPR:
3178 return TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (arg)) ? arg : NULL;
3180 default:
3181 return NULL;
3188 /* Return whether OP is a DECL whose address is function-invariant. */
3190 bool
3191 decl_address_invariant_p (const_tree op)
3193 /* The conditions below are slightly less strict than the one in
3194 staticp. */
3196 switch (TREE_CODE (op))
3198 case PARM_DECL:
3199 case RESULT_DECL:
3200 case LABEL_DECL:
3201 case FUNCTION_DECL:
3202 return true;
3204 case VAR_DECL:
3205 if ((TREE_STATIC (op) || DECL_EXTERNAL (op))
3206 || DECL_THREAD_LOCAL_P (op)
3207 || DECL_CONTEXT (op) == current_function_decl
3208 || decl_function_context (op) == current_function_decl)
3209 return true;
3210 break;
3212 case CONST_DECL:
3213 if ((TREE_STATIC (op) || DECL_EXTERNAL (op))
3214 || decl_function_context (op) == current_function_decl)
3215 return true;
3216 break;
3218 default:
3219 break;
3222 return false;
3225 /* Return whether OP is a DECL whose address is interprocedural-invariant. */
3227 bool
3228 decl_address_ip_invariant_p (const_tree op)
3230 /* The conditions below are slightly less strict than the one in
3231 staticp. */
3233 switch (TREE_CODE (op))
3235 case LABEL_DECL:
3236 case FUNCTION_DECL:
3237 case STRING_CST:
3238 return true;
3240 case VAR_DECL:
3241 if (((TREE_STATIC (op) || DECL_EXTERNAL (op))
3242 && !DECL_DLLIMPORT_P (op))
3243 || DECL_THREAD_LOCAL_P (op))
3244 return true;
3245 break;
3247 case CONST_DECL:
3248 if ((TREE_STATIC (op) || DECL_EXTERNAL (op)))
3249 return true;
3250 break;
3252 default:
3253 break;
3256 return false;
3260 /* Return true if T is function-invariant (internal function, does
3261 not handle arithmetic; that's handled in skip_simple_arithmetic and
3262 tree_invariant_p). */
3264 static bool
3265 tree_invariant_p_1 (tree t)
3267 tree op;
3269 if (TREE_CONSTANT (t)
3270 || (TREE_READONLY (t) && !TREE_SIDE_EFFECTS (t)))
3271 return true;
3273 switch (TREE_CODE (t))
3275 case SAVE_EXPR:
3276 return true;
3278 case ADDR_EXPR:
3279 op = TREE_OPERAND (t, 0);
3280 while (handled_component_p (op))
3282 switch (TREE_CODE (op))
3284 case ARRAY_REF:
3285 case ARRAY_RANGE_REF:
3286 if (!tree_invariant_p (TREE_OPERAND (op, 1))
3287 || TREE_OPERAND (op, 2) != NULL_TREE
3288 || TREE_OPERAND (op, 3) != NULL_TREE)
3289 return false;
3290 break;
3292 case COMPONENT_REF:
3293 if (TREE_OPERAND (op, 2) != NULL_TREE)
3294 return false;
3295 break;
3297 default:;
3299 op = TREE_OPERAND (op, 0);
3302 return CONSTANT_CLASS_P (op) || decl_address_invariant_p (op);
3304 default:
3305 break;
3308 return false;
3311 /* Return true if T is function-invariant. */
3313 bool
3314 tree_invariant_p (tree t)
3316 tree inner = skip_simple_arithmetic (t);
3317 return tree_invariant_p_1 (inner);
3320 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
3321 Do this to any expression which may be used in more than one place,
3322 but must be evaluated only once.
3324 Normally, expand_expr would reevaluate the expression each time.
3325 Calling save_expr produces something that is evaluated and recorded
3326 the first time expand_expr is called on it. Subsequent calls to
3327 expand_expr just reuse the recorded value.
3329 The call to expand_expr that generates code that actually computes
3330 the value is the first call *at compile time*. Subsequent calls
3331 *at compile time* generate code to use the saved value.
3332 This produces correct result provided that *at run time* control
3333 always flows through the insns made by the first expand_expr
3334 before reaching the other places where the save_expr was evaluated.
3335 You, the caller of save_expr, must make sure this is so.
3337 Constants, and certain read-only nodes, are returned with no
3338 SAVE_EXPR because that is safe. Expressions containing placeholders
3339 are not touched; see tree.def for an explanation of what these
3340 are used for. */
3342 tree
3343 save_expr (tree expr)
3345 tree inner;
3347 /* If the tree evaluates to a constant, then we don't want to hide that
3348 fact (i.e. this allows further folding, and direct checks for constants).
3349 However, a read-only object that has side effects cannot be bypassed.
3350 Since it is no problem to reevaluate literals, we just return the
3351 literal node. */
3352 inner = skip_simple_arithmetic (expr);
3353 if (TREE_CODE (inner) == ERROR_MARK)
3354 return inner;
3356 if (tree_invariant_p_1 (inner))
3357 return expr;
3359 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
3360 it means that the size or offset of some field of an object depends on
3361 the value within another field.
3363 Note that it must not be the case that EXPR contains both a PLACEHOLDER_EXPR
3364 and some variable since it would then need to be both evaluated once and
3365 evaluated more than once. Front-ends must assure this case cannot
3366 happen by surrounding any such subexpressions in their own SAVE_EXPR
3367 and forcing evaluation at the proper time. */
3368 if (contains_placeholder_p (inner))
3369 return expr;
3371 expr = build1_loc (EXPR_LOCATION (expr), SAVE_EXPR, TREE_TYPE (expr), expr);
3373 /* This expression might be placed ahead of a jump to ensure that the
3374 value was computed on both sides of the jump. So make sure it isn't
3375 eliminated as dead. */
3376 TREE_SIDE_EFFECTS (expr) = 1;
3377 return expr;
3380 /* Look inside EXPR into any simple arithmetic operations. Return the
3381 outermost non-arithmetic or non-invariant node. */
3383 tree
3384 skip_simple_arithmetic (tree expr)
3386 /* We don't care about whether this can be used as an lvalue in this
3387 context. */
3388 while (TREE_CODE (expr) == NON_LVALUE_EXPR)
3389 expr = TREE_OPERAND (expr, 0);
3391 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
3392 a constant, it will be more efficient to not make another SAVE_EXPR since
3393 it will allow better simplification and GCSE will be able to merge the
3394 computations if they actually occur. */
3395 while (true)
3397 if (UNARY_CLASS_P (expr))
3398 expr = TREE_OPERAND (expr, 0);
3399 else if (BINARY_CLASS_P (expr))
3401 if (tree_invariant_p (TREE_OPERAND (expr, 1)))
3402 expr = TREE_OPERAND (expr, 0);
3403 else if (tree_invariant_p (TREE_OPERAND (expr, 0)))
3404 expr = TREE_OPERAND (expr, 1);
3405 else
3406 break;
3408 else
3409 break;
3412 return expr;
3415 /* Look inside EXPR into simple arithmetic operations involving constants.
3416 Return the outermost non-arithmetic or non-constant node. */
3418 tree
3419 skip_simple_constant_arithmetic (tree expr)
3421 while (TREE_CODE (expr) == NON_LVALUE_EXPR)
3422 expr = TREE_OPERAND (expr, 0);
3424 while (true)
3426 if (UNARY_CLASS_P (expr))
3427 expr = TREE_OPERAND (expr, 0);
3428 else if (BINARY_CLASS_P (expr))
3430 if (TREE_CONSTANT (TREE_OPERAND (expr, 1)))
3431 expr = TREE_OPERAND (expr, 0);
3432 else if (TREE_CONSTANT (TREE_OPERAND (expr, 0)))
3433 expr = TREE_OPERAND (expr, 1);
3434 else
3435 break;
3437 else
3438 break;
3441 return expr;
3444 /* Return which tree structure is used by T. */
3446 enum tree_node_structure_enum
3447 tree_node_structure (const_tree t)
3449 const enum tree_code code = TREE_CODE (t);
3450 return tree_node_structure_for_code (code);
3453 /* Set various status flags when building a CALL_EXPR object T. */
3455 static void
3456 process_call_operands (tree t)
3458 bool side_effects = TREE_SIDE_EFFECTS (t);
3459 bool read_only = false;
3460 int i = call_expr_flags (t);
3462 /* Calls have side-effects, except those to const or pure functions. */
3463 if ((i & ECF_LOOPING_CONST_OR_PURE) || !(i & (ECF_CONST | ECF_PURE)))
3464 side_effects = true;
3465 /* Propagate TREE_READONLY of arguments for const functions. */
3466 if (i & ECF_CONST)
3467 read_only = true;
3469 if (!side_effects || read_only)
3470 for (i = 1; i < TREE_OPERAND_LENGTH (t); i++)
3472 tree op = TREE_OPERAND (t, i);
3473 if (op && TREE_SIDE_EFFECTS (op))
3474 side_effects = true;
3475 if (op && !TREE_READONLY (op) && !CONSTANT_CLASS_P (op))
3476 read_only = false;
3479 TREE_SIDE_EFFECTS (t) = side_effects;
3480 TREE_READONLY (t) = read_only;
3483 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
3484 size or offset that depends on a field within a record. */
3486 bool
3487 contains_placeholder_p (const_tree exp)
3489 enum tree_code code;
3491 if (!exp)
3492 return 0;
3494 code = TREE_CODE (exp);
3495 if (code == PLACEHOLDER_EXPR)
3496 return 1;
3498 switch (TREE_CODE_CLASS (code))
3500 case tcc_reference:
3501 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
3502 position computations since they will be converted into a
3503 WITH_RECORD_EXPR involving the reference, which will assume
3504 here will be valid. */
3505 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0));
3507 case tcc_exceptional:
3508 if (code == TREE_LIST)
3509 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp))
3510 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp)));
3511 break;
3513 case tcc_unary:
3514 case tcc_binary:
3515 case tcc_comparison:
3516 case tcc_expression:
3517 switch (code)
3519 case COMPOUND_EXPR:
3520 /* Ignoring the first operand isn't quite right, but works best. */
3521 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1));
3523 case COND_EXPR:
3524 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0))
3525 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1))
3526 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 2)));
3528 case SAVE_EXPR:
3529 /* The save_expr function never wraps anything containing
3530 a PLACEHOLDER_EXPR. */
3531 return 0;
3533 default:
3534 break;
3537 switch (TREE_CODE_LENGTH (code))
3539 case 1:
3540 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0));
3541 case 2:
3542 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0))
3543 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1)));
3544 default:
3545 return 0;
3548 case tcc_vl_exp:
3549 switch (code)
3551 case CALL_EXPR:
3553 const_tree arg;
3554 const_call_expr_arg_iterator iter;
3555 FOR_EACH_CONST_CALL_EXPR_ARG (arg, iter, exp)
3556 if (CONTAINS_PLACEHOLDER_P (arg))
3557 return 1;
3558 return 0;
3560 default:
3561 return 0;
3564 default:
3565 return 0;
3567 return 0;
3570 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
3571 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
3572 field positions. */
3574 static bool
3575 type_contains_placeholder_1 (const_tree type)
3577 /* If the size contains a placeholder or the parent type (component type in
3578 the case of arrays) type involves a placeholder, this type does. */
3579 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type))
3580 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type))
3581 || (!POINTER_TYPE_P (type)
3582 && TREE_TYPE (type)
3583 && type_contains_placeholder_p (TREE_TYPE (type))))
3584 return true;
3586 /* Now do type-specific checks. Note that the last part of the check above
3587 greatly limits what we have to do below. */
3588 switch (TREE_CODE (type))
3590 case VOID_TYPE:
3591 case POINTER_BOUNDS_TYPE:
3592 case COMPLEX_TYPE:
3593 case ENUMERAL_TYPE:
3594 case BOOLEAN_TYPE:
3595 case POINTER_TYPE:
3596 case OFFSET_TYPE:
3597 case REFERENCE_TYPE:
3598 case METHOD_TYPE:
3599 case FUNCTION_TYPE:
3600 case VECTOR_TYPE:
3601 case NULLPTR_TYPE:
3602 return false;
3604 case INTEGER_TYPE:
3605 case REAL_TYPE:
3606 case FIXED_POINT_TYPE:
3607 /* Here we just check the bounds. */
3608 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type))
3609 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type)));
3611 case ARRAY_TYPE:
3612 /* We have already checked the component type above, so just check
3613 the domain type. Flexible array members have a null domain. */
3614 return TYPE_DOMAIN (type) ?
3615 type_contains_placeholder_p (TYPE_DOMAIN (type)) : false;
3617 case RECORD_TYPE:
3618 case UNION_TYPE:
3619 case QUAL_UNION_TYPE:
3621 tree field;
3623 for (field = TYPE_FIELDS (type); field; field = DECL_CHAIN (field))
3624 if (TREE_CODE (field) == FIELD_DECL
3625 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field))
3626 || (TREE_CODE (type) == QUAL_UNION_TYPE
3627 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field)))
3628 || type_contains_placeholder_p (TREE_TYPE (field))))
3629 return true;
3631 return false;
3634 default:
3635 gcc_unreachable ();
3639 /* Wrapper around above function used to cache its result. */
3641 bool
3642 type_contains_placeholder_p (tree type)
3644 bool result;
3646 /* If the contains_placeholder_bits field has been initialized,
3647 then we know the answer. */
3648 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) > 0)
3649 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) - 1;
3651 /* Indicate that we've seen this type node, and the answer is false.
3652 This is what we want to return if we run into recursion via fields. */
3653 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) = 1;
3655 /* Compute the real value. */
3656 result = type_contains_placeholder_1 (type);
3658 /* Store the real value. */
3659 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) = result + 1;
3661 return result;
3664 /* Push tree EXP onto vector QUEUE if it is not already present. */
3666 static void
3667 push_without_duplicates (tree exp, vec<tree> *queue)
3669 unsigned int i;
3670 tree iter;
3672 FOR_EACH_VEC_ELT (*queue, i, iter)
3673 if (simple_cst_equal (iter, exp) == 1)
3674 break;
3676 if (!iter)
3677 queue->safe_push (exp);
3680 /* Given a tree EXP, find all occurrences of references to fields
3681 in a PLACEHOLDER_EXPR and place them in vector REFS without
3682 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
3683 we assume here that EXP contains only arithmetic expressions
3684 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
3685 argument list. */
3687 void
3688 find_placeholder_in_expr (tree exp, vec<tree> *refs)
3690 enum tree_code code = TREE_CODE (exp);
3691 tree inner;
3692 int i;
3694 /* We handle TREE_LIST and COMPONENT_REF separately. */
3695 if (code == TREE_LIST)
3697 FIND_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp), refs);
3698 FIND_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp), refs);
3700 else if (code == COMPONENT_REF)
3702 for (inner = TREE_OPERAND (exp, 0);
3703 REFERENCE_CLASS_P (inner);
3704 inner = TREE_OPERAND (inner, 0))
3707 if (TREE_CODE (inner) == PLACEHOLDER_EXPR)
3708 push_without_duplicates (exp, refs);
3709 else
3710 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), refs);
3712 else
3713 switch (TREE_CODE_CLASS (code))
3715 case tcc_constant:
3716 break;
3718 case tcc_declaration:
3719 /* Variables allocated to static storage can stay. */
3720 if (!TREE_STATIC (exp))
3721 push_without_duplicates (exp, refs);
3722 break;
3724 case tcc_expression:
3725 /* This is the pattern built in ada/make_aligning_type. */
3726 if (code == ADDR_EXPR
3727 && TREE_CODE (TREE_OPERAND (exp, 0)) == PLACEHOLDER_EXPR)
3729 push_without_duplicates (exp, refs);
3730 break;
3733 /* Fall through. */
3735 case tcc_exceptional:
3736 case tcc_unary:
3737 case tcc_binary:
3738 case tcc_comparison:
3739 case tcc_reference:
3740 for (i = 0; i < TREE_CODE_LENGTH (code); i++)
3741 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, i), refs);
3742 break;
3744 case tcc_vl_exp:
3745 for (i = 1; i < TREE_OPERAND_LENGTH (exp); i++)
3746 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, i), refs);
3747 break;
3749 default:
3750 gcc_unreachable ();
3754 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
3755 return a tree with all occurrences of references to F in a
3756 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
3757 CONST_DECLs. Note that we assume here that EXP contains only
3758 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
3759 occurring only in their argument list. */
3761 tree
3762 substitute_in_expr (tree exp, tree f, tree r)
3764 enum tree_code code = TREE_CODE (exp);
3765 tree op0, op1, op2, op3;
3766 tree new_tree;
3768 /* We handle TREE_LIST and COMPONENT_REF separately. */
3769 if (code == TREE_LIST)
3771 op0 = SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp), f, r);
3772 op1 = SUBSTITUTE_IN_EXPR (TREE_VALUE (exp), f, r);
3773 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
3774 return exp;
3776 return tree_cons (TREE_PURPOSE (exp), op1, op0);
3778 else if (code == COMPONENT_REF)
3780 tree inner;
3782 /* If this expression is getting a value from a PLACEHOLDER_EXPR
3783 and it is the right field, replace it with R. */
3784 for (inner = TREE_OPERAND (exp, 0);
3785 REFERENCE_CLASS_P (inner);
3786 inner = TREE_OPERAND (inner, 0))
3789 /* The field. */
3790 op1 = TREE_OPERAND (exp, 1);
3792 if (TREE_CODE (inner) == PLACEHOLDER_EXPR && op1 == f)
3793 return r;
3795 /* If this expression hasn't been completed let, leave it alone. */
3796 if (TREE_CODE (inner) == PLACEHOLDER_EXPR && !TREE_TYPE (inner))
3797 return exp;
3799 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
3800 if (op0 == TREE_OPERAND (exp, 0))
3801 return exp;
3803 new_tree
3804 = fold_build3 (COMPONENT_REF, TREE_TYPE (exp), op0, op1, NULL_TREE);
3806 else
3807 switch (TREE_CODE_CLASS (code))
3809 case tcc_constant:
3810 return exp;
3812 case tcc_declaration:
3813 if (exp == f)
3814 return r;
3815 else
3816 return exp;
3818 case tcc_expression:
3819 if (exp == f)
3820 return r;
3822 /* Fall through. */
3824 case tcc_exceptional:
3825 case tcc_unary:
3826 case tcc_binary:
3827 case tcc_comparison:
3828 case tcc_reference:
3829 switch (TREE_CODE_LENGTH (code))
3831 case 0:
3832 return exp;
3834 case 1:
3835 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
3836 if (op0 == TREE_OPERAND (exp, 0))
3837 return exp;
3839 new_tree = fold_build1 (code, TREE_TYPE (exp), op0);
3840 break;
3842 case 2:
3843 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
3844 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
3846 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
3847 return exp;
3849 new_tree = fold_build2 (code, TREE_TYPE (exp), op0, op1);
3850 break;
3852 case 3:
3853 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
3854 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
3855 op2 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 2), f, r);
3857 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
3858 && op2 == TREE_OPERAND (exp, 2))
3859 return exp;
3861 new_tree = fold_build3 (code, TREE_TYPE (exp), op0, op1, op2);
3862 break;
3864 case 4:
3865 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
3866 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
3867 op2 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 2), f, r);
3868 op3 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 3), f, r);
3870 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
3871 && op2 == TREE_OPERAND (exp, 2)
3872 && op3 == TREE_OPERAND (exp, 3))
3873 return exp;
3875 new_tree
3876 = fold (build4 (code, TREE_TYPE (exp), op0, op1, op2, op3));
3877 break;
3879 default:
3880 gcc_unreachable ();
3882 break;
3884 case tcc_vl_exp:
3886 int i;
3888 new_tree = NULL_TREE;
3890 /* If we are trying to replace F with a constant or with another
3891 instance of one of the arguments of the call, inline back
3892 functions which do nothing else than computing a value from
3893 the arguments they are passed. This makes it possible to
3894 fold partially or entirely the replacement expression. */
3895 if (code == CALL_EXPR)
3897 bool maybe_inline = false;
3898 if (CONSTANT_CLASS_P (r))
3899 maybe_inline = true;
3900 else
3901 for (i = 3; i < TREE_OPERAND_LENGTH (exp); i++)
3902 if (operand_equal_p (TREE_OPERAND (exp, i), r, 0))
3904 maybe_inline = true;
3905 break;
3907 if (maybe_inline)
3909 tree t = maybe_inline_call_in_expr (exp);
3910 if (t)
3911 return SUBSTITUTE_IN_EXPR (t, f, r);
3915 for (i = 1; i < TREE_OPERAND_LENGTH (exp); i++)
3917 tree op = TREE_OPERAND (exp, i);
3918 tree new_op = SUBSTITUTE_IN_EXPR (op, f, r);
3919 if (new_op != op)
3921 if (!new_tree)
3922 new_tree = copy_node (exp);
3923 TREE_OPERAND (new_tree, i) = new_op;
3927 if (new_tree)
3929 new_tree = fold (new_tree);
3930 if (TREE_CODE (new_tree) == CALL_EXPR)
3931 process_call_operands (new_tree);
3933 else
3934 return exp;
3936 break;
3938 default:
3939 gcc_unreachable ();
3942 TREE_READONLY (new_tree) |= TREE_READONLY (exp);
3944 if (code == INDIRECT_REF || code == ARRAY_REF || code == ARRAY_RANGE_REF)
3945 TREE_THIS_NOTRAP (new_tree) |= TREE_THIS_NOTRAP (exp);
3947 return new_tree;
3950 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
3951 for it within OBJ, a tree that is an object or a chain of references. */
3953 tree
3954 substitute_placeholder_in_expr (tree exp, tree obj)
3956 enum tree_code code = TREE_CODE (exp);
3957 tree op0, op1, op2, op3;
3958 tree new_tree;
3960 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
3961 in the chain of OBJ. */
3962 if (code == PLACEHOLDER_EXPR)
3964 tree need_type = TYPE_MAIN_VARIANT (TREE_TYPE (exp));
3965 tree elt;
3967 for (elt = obj; elt != 0;
3968 elt = ((TREE_CODE (elt) == COMPOUND_EXPR
3969 || TREE_CODE (elt) == COND_EXPR)
3970 ? TREE_OPERAND (elt, 1)
3971 : (REFERENCE_CLASS_P (elt)
3972 || UNARY_CLASS_P (elt)
3973 || BINARY_CLASS_P (elt)
3974 || VL_EXP_CLASS_P (elt)
3975 || EXPRESSION_CLASS_P (elt))
3976 ? TREE_OPERAND (elt, 0) : 0))
3977 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt)) == need_type)
3978 return elt;
3980 for (elt = obj; elt != 0;
3981 elt = ((TREE_CODE (elt) == COMPOUND_EXPR
3982 || TREE_CODE (elt) == COND_EXPR)
3983 ? TREE_OPERAND (elt, 1)
3984 : (REFERENCE_CLASS_P (elt)
3985 || UNARY_CLASS_P (elt)
3986 || BINARY_CLASS_P (elt)
3987 || VL_EXP_CLASS_P (elt)
3988 || EXPRESSION_CLASS_P (elt))
3989 ? TREE_OPERAND (elt, 0) : 0))
3990 if (POINTER_TYPE_P (TREE_TYPE (elt))
3991 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt)))
3992 == need_type))
3993 return fold_build1 (INDIRECT_REF, need_type, elt);
3995 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
3996 survives until RTL generation, there will be an error. */
3997 return exp;
4000 /* TREE_LIST is special because we need to look at TREE_VALUE
4001 and TREE_CHAIN, not TREE_OPERANDS. */
4002 else if (code == TREE_LIST)
4004 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp), obj);
4005 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp), obj);
4006 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
4007 return exp;
4009 return tree_cons (TREE_PURPOSE (exp), op1, op0);
4011 else
4012 switch (TREE_CODE_CLASS (code))
4014 case tcc_constant:
4015 case tcc_declaration:
4016 return exp;
4018 case tcc_exceptional:
4019 case tcc_unary:
4020 case tcc_binary:
4021 case tcc_comparison:
4022 case tcc_expression:
4023 case tcc_reference:
4024 case tcc_statement:
4025 switch (TREE_CODE_LENGTH (code))
4027 case 0:
4028 return exp;
4030 case 1:
4031 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
4032 if (op0 == TREE_OPERAND (exp, 0))
4033 return exp;
4035 new_tree = fold_build1 (code, TREE_TYPE (exp), op0);
4036 break;
4038 case 2:
4039 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
4040 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
4042 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
4043 return exp;
4045 new_tree = fold_build2 (code, TREE_TYPE (exp), op0, op1);
4046 break;
4048 case 3:
4049 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
4050 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
4051 op2 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 2), obj);
4053 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
4054 && op2 == TREE_OPERAND (exp, 2))
4055 return exp;
4057 new_tree = fold_build3 (code, TREE_TYPE (exp), op0, op1, op2);
4058 break;
4060 case 4:
4061 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
4062 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
4063 op2 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 2), obj);
4064 op3 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 3), obj);
4066 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
4067 && op2 == TREE_OPERAND (exp, 2)
4068 && op3 == TREE_OPERAND (exp, 3))
4069 return exp;
4071 new_tree
4072 = fold (build4 (code, TREE_TYPE (exp), op0, op1, op2, op3));
4073 break;
4075 default:
4076 gcc_unreachable ();
4078 break;
4080 case tcc_vl_exp:
4082 int i;
4084 new_tree = NULL_TREE;
4086 for (i = 1; i < TREE_OPERAND_LENGTH (exp); i++)
4088 tree op = TREE_OPERAND (exp, i);
4089 tree new_op = SUBSTITUTE_PLACEHOLDER_IN_EXPR (op, obj);
4090 if (new_op != op)
4092 if (!new_tree)
4093 new_tree = copy_node (exp);
4094 TREE_OPERAND (new_tree, i) = new_op;
4098 if (new_tree)
4100 new_tree = fold (new_tree);
4101 if (TREE_CODE (new_tree) == CALL_EXPR)
4102 process_call_operands (new_tree);
4104 else
4105 return exp;
4107 break;
4109 default:
4110 gcc_unreachable ();
4113 TREE_READONLY (new_tree) |= TREE_READONLY (exp);
4115 if (code == INDIRECT_REF || code == ARRAY_REF || code == ARRAY_RANGE_REF)
4116 TREE_THIS_NOTRAP (new_tree) |= TREE_THIS_NOTRAP (exp);
4118 return new_tree;
4122 /* Subroutine of stabilize_reference; this is called for subtrees of
4123 references. Any expression with side-effects must be put in a SAVE_EXPR
4124 to ensure that it is only evaluated once.
4126 We don't put SAVE_EXPR nodes around everything, because assigning very
4127 simple expressions to temporaries causes us to miss good opportunities
4128 for optimizations. Among other things, the opportunity to fold in the
4129 addition of a constant into an addressing mode often gets lost, e.g.
4130 "y[i+1] += x;". In general, we take the approach that we should not make
4131 an assignment unless we are forced into it - i.e., that any non-side effect
4132 operator should be allowed, and that cse should take care of coalescing
4133 multiple utterances of the same expression should that prove fruitful. */
4135 static tree
4136 stabilize_reference_1 (tree e)
4138 tree result;
4139 enum tree_code code = TREE_CODE (e);
4141 /* We cannot ignore const expressions because it might be a reference
4142 to a const array but whose index contains side-effects. But we can
4143 ignore things that are actual constant or that already have been
4144 handled by this function. */
4146 if (tree_invariant_p (e))
4147 return e;
4149 switch (TREE_CODE_CLASS (code))
4151 case tcc_exceptional:
4152 case tcc_type:
4153 case tcc_declaration:
4154 case tcc_comparison:
4155 case tcc_statement:
4156 case tcc_expression:
4157 case tcc_reference:
4158 case tcc_vl_exp:
4159 /* If the expression has side-effects, then encase it in a SAVE_EXPR
4160 so that it will only be evaluated once. */
4161 /* The reference (r) and comparison (<) classes could be handled as
4162 below, but it is generally faster to only evaluate them once. */
4163 if (TREE_SIDE_EFFECTS (e))
4164 return save_expr (e);
4165 return e;
4167 case tcc_constant:
4168 /* Constants need no processing. In fact, we should never reach
4169 here. */
4170 return e;
4172 case tcc_binary:
4173 /* Division is slow and tends to be compiled with jumps,
4174 especially the division by powers of 2 that is often
4175 found inside of an array reference. So do it just once. */
4176 if (code == TRUNC_DIV_EXPR || code == TRUNC_MOD_EXPR
4177 || code == FLOOR_DIV_EXPR || code == FLOOR_MOD_EXPR
4178 || code == CEIL_DIV_EXPR || code == CEIL_MOD_EXPR
4179 || code == ROUND_DIV_EXPR || code == ROUND_MOD_EXPR)
4180 return save_expr (e);
4181 /* Recursively stabilize each operand. */
4182 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)),
4183 stabilize_reference_1 (TREE_OPERAND (e, 1)));
4184 break;
4186 case tcc_unary:
4187 /* Recursively stabilize each operand. */
4188 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)));
4189 break;
4191 default:
4192 gcc_unreachable ();
4195 TREE_TYPE (result) = TREE_TYPE (e);
4196 TREE_READONLY (result) = TREE_READONLY (e);
4197 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (e);
4198 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (e);
4200 return result;
4203 /* Stabilize a reference so that we can use it any number of times
4204 without causing its operands to be evaluated more than once.
4205 Returns the stabilized reference. This works by means of save_expr,
4206 so see the caveats in the comments about save_expr.
4208 Also allows conversion expressions whose operands are references.
4209 Any other kind of expression is returned unchanged. */
4211 tree
4212 stabilize_reference (tree ref)
4214 tree result;
4215 enum tree_code code = TREE_CODE (ref);
4217 switch (code)
4219 case VAR_DECL:
4220 case PARM_DECL:
4221 case RESULT_DECL:
4222 /* No action is needed in this case. */
4223 return ref;
4225 CASE_CONVERT:
4226 case FLOAT_EXPR:
4227 case FIX_TRUNC_EXPR:
4228 result = build_nt (code, stabilize_reference (TREE_OPERAND (ref, 0)));
4229 break;
4231 case INDIRECT_REF:
4232 result = build_nt (INDIRECT_REF,
4233 stabilize_reference_1 (TREE_OPERAND (ref, 0)));
4234 break;
4236 case COMPONENT_REF:
4237 result = build_nt (COMPONENT_REF,
4238 stabilize_reference (TREE_OPERAND (ref, 0)),
4239 TREE_OPERAND (ref, 1), NULL_TREE);
4240 break;
4242 case BIT_FIELD_REF:
4243 result = build_nt (BIT_FIELD_REF,
4244 stabilize_reference (TREE_OPERAND (ref, 0)),
4245 TREE_OPERAND (ref, 1), TREE_OPERAND (ref, 2));
4246 REF_REVERSE_STORAGE_ORDER (result) = REF_REVERSE_STORAGE_ORDER (ref);
4247 break;
4249 case ARRAY_REF:
4250 result = build_nt (ARRAY_REF,
4251 stabilize_reference (TREE_OPERAND (ref, 0)),
4252 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
4253 TREE_OPERAND (ref, 2), TREE_OPERAND (ref, 3));
4254 break;
4256 case ARRAY_RANGE_REF:
4257 result = build_nt (ARRAY_RANGE_REF,
4258 stabilize_reference (TREE_OPERAND (ref, 0)),
4259 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
4260 TREE_OPERAND (ref, 2), TREE_OPERAND (ref, 3));
4261 break;
4263 case COMPOUND_EXPR:
4264 /* We cannot wrap the first expression in a SAVE_EXPR, as then
4265 it wouldn't be ignored. This matters when dealing with
4266 volatiles. */
4267 return stabilize_reference_1 (ref);
4269 /* If arg isn't a kind of lvalue we recognize, make no change.
4270 Caller should recognize the error for an invalid lvalue. */
4271 default:
4272 return ref;
4274 case ERROR_MARK:
4275 return error_mark_node;
4278 TREE_TYPE (result) = TREE_TYPE (ref);
4279 TREE_READONLY (result) = TREE_READONLY (ref);
4280 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (ref);
4281 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (ref);
4283 return result;
4286 /* Low-level constructors for expressions. */
4288 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
4289 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
4291 void
4292 recompute_tree_invariant_for_addr_expr (tree t)
4294 tree node;
4295 bool tc = true, se = false;
4297 gcc_assert (TREE_CODE (t) == ADDR_EXPR);
4299 /* We started out assuming this address is both invariant and constant, but
4300 does not have side effects. Now go down any handled components and see if
4301 any of them involve offsets that are either non-constant or non-invariant.
4302 Also check for side-effects.
4304 ??? Note that this code makes no attempt to deal with the case where
4305 taking the address of something causes a copy due to misalignment. */
4307 #define UPDATE_FLAGS(NODE) \
4308 do { tree _node = (NODE); \
4309 if (_node && !TREE_CONSTANT (_node)) tc = false; \
4310 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
4312 for (node = TREE_OPERAND (t, 0); handled_component_p (node);
4313 node = TREE_OPERAND (node, 0))
4315 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
4316 array reference (probably made temporarily by the G++ front end),
4317 so ignore all the operands. */
4318 if ((TREE_CODE (node) == ARRAY_REF
4319 || TREE_CODE (node) == ARRAY_RANGE_REF)
4320 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node, 0))) == ARRAY_TYPE)
4322 UPDATE_FLAGS (TREE_OPERAND (node, 1));
4323 if (TREE_OPERAND (node, 2))
4324 UPDATE_FLAGS (TREE_OPERAND (node, 2));
4325 if (TREE_OPERAND (node, 3))
4326 UPDATE_FLAGS (TREE_OPERAND (node, 3));
4328 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
4329 FIELD_DECL, apparently. The G++ front end can put something else
4330 there, at least temporarily. */
4331 else if (TREE_CODE (node) == COMPONENT_REF
4332 && TREE_CODE (TREE_OPERAND (node, 1)) == FIELD_DECL)
4334 if (TREE_OPERAND (node, 2))
4335 UPDATE_FLAGS (TREE_OPERAND (node, 2));
4339 node = lang_hooks.expr_to_decl (node, &tc, &se);
4341 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
4342 the address, since &(*a)->b is a form of addition. If it's a constant, the
4343 address is constant too. If it's a decl, its address is constant if the
4344 decl is static. Everything else is not constant and, furthermore,
4345 taking the address of a volatile variable is not volatile. */
4346 if (TREE_CODE (node) == INDIRECT_REF
4347 || TREE_CODE (node) == MEM_REF)
4348 UPDATE_FLAGS (TREE_OPERAND (node, 0));
4349 else if (CONSTANT_CLASS_P (node))
4351 else if (DECL_P (node))
4352 tc &= (staticp (node) != NULL_TREE);
4353 else
4355 tc = false;
4356 se |= TREE_SIDE_EFFECTS (node);
4360 TREE_CONSTANT (t) = tc;
4361 TREE_SIDE_EFFECTS (t) = se;
4362 #undef UPDATE_FLAGS
4365 /* Build an expression of code CODE, data type TYPE, and operands as
4366 specified. Expressions and reference nodes can be created this way.
4367 Constants, decls, types and misc nodes cannot be.
4369 We define 5 non-variadic functions, from 0 to 4 arguments. This is
4370 enough for all extant tree codes. */
4372 tree
4373 build0 (enum tree_code code, tree tt MEM_STAT_DECL)
4375 tree t;
4377 gcc_assert (TREE_CODE_LENGTH (code) == 0);
4379 t = make_node (code PASS_MEM_STAT);
4380 TREE_TYPE (t) = tt;
4382 return t;
4385 tree
4386 build1 (enum tree_code code, tree type, tree node MEM_STAT_DECL)
4388 int length = sizeof (struct tree_exp);
4389 tree t;
4391 record_node_allocation_statistics (code, length);
4393 gcc_assert (TREE_CODE_LENGTH (code) == 1);
4395 t = ggc_alloc_tree_node_stat (length PASS_MEM_STAT);
4397 memset (t, 0, sizeof (struct tree_common));
4399 TREE_SET_CODE (t, code);
4401 TREE_TYPE (t) = type;
4402 SET_EXPR_LOCATION (t, UNKNOWN_LOCATION);
4403 TREE_OPERAND (t, 0) = node;
4404 if (node && !TYPE_P (node))
4406 TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (node);
4407 TREE_READONLY (t) = TREE_READONLY (node);
4410 if (TREE_CODE_CLASS (code) == tcc_statement)
4411 TREE_SIDE_EFFECTS (t) = 1;
4412 else switch (code)
4414 case VA_ARG_EXPR:
4415 /* All of these have side-effects, no matter what their
4416 operands are. */
4417 TREE_SIDE_EFFECTS (t) = 1;
4418 TREE_READONLY (t) = 0;
4419 break;
4421 case INDIRECT_REF:
4422 /* Whether a dereference is readonly has nothing to do with whether
4423 its operand is readonly. */
4424 TREE_READONLY (t) = 0;
4425 break;
4427 case ADDR_EXPR:
4428 if (node)
4429 recompute_tree_invariant_for_addr_expr (t);
4430 break;
4432 default:
4433 if ((TREE_CODE_CLASS (code) == tcc_unary || code == VIEW_CONVERT_EXPR)
4434 && node && !TYPE_P (node)
4435 && TREE_CONSTANT (node))
4436 TREE_CONSTANT (t) = 1;
4437 if (TREE_CODE_CLASS (code) == tcc_reference
4438 && node && TREE_THIS_VOLATILE (node))
4439 TREE_THIS_VOLATILE (t) = 1;
4440 break;
4443 return t;
4446 #define PROCESS_ARG(N) \
4447 do { \
4448 TREE_OPERAND (t, N) = arg##N; \
4449 if (arg##N &&!TYPE_P (arg##N)) \
4451 if (TREE_SIDE_EFFECTS (arg##N)) \
4452 side_effects = 1; \
4453 if (!TREE_READONLY (arg##N) \
4454 && !CONSTANT_CLASS_P (arg##N)) \
4455 (void) (read_only = 0); \
4456 if (!TREE_CONSTANT (arg##N)) \
4457 (void) (constant = 0); \
4459 } while (0)
4461 tree
4462 build2 (enum tree_code code, tree tt, tree arg0, tree arg1 MEM_STAT_DECL)
4464 bool constant, read_only, side_effects, div_by_zero;
4465 tree t;
4467 gcc_assert (TREE_CODE_LENGTH (code) == 2);
4469 if ((code == MINUS_EXPR || code == PLUS_EXPR || code == MULT_EXPR)
4470 && arg0 && arg1 && tt && POINTER_TYPE_P (tt)
4471 /* When sizetype precision doesn't match that of pointers
4472 we need to be able to build explicit extensions or truncations
4473 of the offset argument. */
4474 && TYPE_PRECISION (sizetype) == TYPE_PRECISION (tt))
4475 gcc_assert (TREE_CODE (arg0) == INTEGER_CST
4476 && TREE_CODE (arg1) == INTEGER_CST);
4478 if (code == POINTER_PLUS_EXPR && arg0 && arg1 && tt)
4479 gcc_assert (POINTER_TYPE_P (tt) && POINTER_TYPE_P (TREE_TYPE (arg0))
4480 && ptrofftype_p (TREE_TYPE (arg1)));
4482 t = make_node (code PASS_MEM_STAT);
4483 TREE_TYPE (t) = tt;
4485 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
4486 result based on those same flags for the arguments. But if the
4487 arguments aren't really even `tree' expressions, we shouldn't be trying
4488 to do this. */
4490 /* Expressions without side effects may be constant if their
4491 arguments are as well. */
4492 constant = (TREE_CODE_CLASS (code) == tcc_comparison
4493 || TREE_CODE_CLASS (code) == tcc_binary);
4494 read_only = 1;
4495 side_effects = TREE_SIDE_EFFECTS (t);
4497 switch (code)
4499 case TRUNC_DIV_EXPR:
4500 case CEIL_DIV_EXPR:
4501 case FLOOR_DIV_EXPR:
4502 case ROUND_DIV_EXPR:
4503 case EXACT_DIV_EXPR:
4504 case CEIL_MOD_EXPR:
4505 case FLOOR_MOD_EXPR:
4506 case ROUND_MOD_EXPR:
4507 case TRUNC_MOD_EXPR:
4508 div_by_zero = integer_zerop (arg1);
4509 break;
4510 default:
4511 div_by_zero = false;
4514 PROCESS_ARG (0);
4515 PROCESS_ARG (1);
4517 TREE_SIDE_EFFECTS (t) = side_effects;
4518 if (code == MEM_REF)
4520 if (arg0 && TREE_CODE (arg0) == ADDR_EXPR)
4522 tree o = TREE_OPERAND (arg0, 0);
4523 TREE_READONLY (t) = TREE_READONLY (o);
4524 TREE_THIS_VOLATILE (t) = TREE_THIS_VOLATILE (o);
4527 else
4529 TREE_READONLY (t) = read_only;
4530 /* Don't mark X / 0 as constant. */
4531 TREE_CONSTANT (t) = constant && !div_by_zero;
4532 TREE_THIS_VOLATILE (t)
4533 = (TREE_CODE_CLASS (code) == tcc_reference
4534 && arg0 && TREE_THIS_VOLATILE (arg0));
4537 return t;
4541 tree
4542 build3 (enum tree_code code, tree tt, tree arg0, tree arg1,
4543 tree arg2 MEM_STAT_DECL)
4545 bool constant, read_only, side_effects;
4546 tree t;
4548 gcc_assert (TREE_CODE_LENGTH (code) == 3);
4549 gcc_assert (TREE_CODE_CLASS (code) != tcc_vl_exp);
4551 t = make_node (code PASS_MEM_STAT);
4552 TREE_TYPE (t) = tt;
4554 read_only = 1;
4556 /* As a special exception, if COND_EXPR has NULL branches, we
4557 assume that it is a gimple statement and always consider
4558 it to have side effects. */
4559 if (code == COND_EXPR
4560 && tt == void_type_node
4561 && arg1 == NULL_TREE
4562 && arg2 == NULL_TREE)
4563 side_effects = true;
4564 else
4565 side_effects = TREE_SIDE_EFFECTS (t);
4567 PROCESS_ARG (0);
4568 PROCESS_ARG (1);
4569 PROCESS_ARG (2);
4571 if (code == COND_EXPR)
4572 TREE_READONLY (t) = read_only;
4574 TREE_SIDE_EFFECTS (t) = side_effects;
4575 TREE_THIS_VOLATILE (t)
4576 = (TREE_CODE_CLASS (code) == tcc_reference
4577 && arg0 && TREE_THIS_VOLATILE (arg0));
4579 return t;
4582 tree
4583 build4 (enum tree_code code, tree tt, tree arg0, tree arg1,
4584 tree arg2, tree arg3 MEM_STAT_DECL)
4586 bool constant, read_only, side_effects;
4587 tree t;
4589 gcc_assert (TREE_CODE_LENGTH (code) == 4);
4591 t = make_node (code PASS_MEM_STAT);
4592 TREE_TYPE (t) = tt;
4594 side_effects = TREE_SIDE_EFFECTS (t);
4596 PROCESS_ARG (0);
4597 PROCESS_ARG (1);
4598 PROCESS_ARG (2);
4599 PROCESS_ARG (3);
4601 TREE_SIDE_EFFECTS (t) = side_effects;
4602 TREE_THIS_VOLATILE (t)
4603 = (TREE_CODE_CLASS (code) == tcc_reference
4604 && arg0 && TREE_THIS_VOLATILE (arg0));
4606 return t;
4609 tree
4610 build5 (enum tree_code code, tree tt, tree arg0, tree arg1,
4611 tree arg2, tree arg3, tree arg4 MEM_STAT_DECL)
4613 bool constant, read_only, side_effects;
4614 tree t;
4616 gcc_assert (TREE_CODE_LENGTH (code) == 5);
4618 t = make_node (code PASS_MEM_STAT);
4619 TREE_TYPE (t) = tt;
4621 side_effects = TREE_SIDE_EFFECTS (t);
4623 PROCESS_ARG (0);
4624 PROCESS_ARG (1);
4625 PROCESS_ARG (2);
4626 PROCESS_ARG (3);
4627 PROCESS_ARG (4);
4629 TREE_SIDE_EFFECTS (t) = side_effects;
4630 if (code == TARGET_MEM_REF)
4632 if (arg0 && TREE_CODE (arg0) == ADDR_EXPR)
4634 tree o = TREE_OPERAND (arg0, 0);
4635 TREE_READONLY (t) = TREE_READONLY (o);
4636 TREE_THIS_VOLATILE (t) = TREE_THIS_VOLATILE (o);
4639 else
4640 TREE_THIS_VOLATILE (t)
4641 = (TREE_CODE_CLASS (code) == tcc_reference
4642 && arg0 && TREE_THIS_VOLATILE (arg0));
4644 return t;
4647 /* Build a simple MEM_REF tree with the sematics of a plain INDIRECT_REF
4648 on the pointer PTR. */
4650 tree
4651 build_simple_mem_ref_loc (location_t loc, tree ptr)
4653 HOST_WIDE_INT offset = 0;
4654 tree ptype = TREE_TYPE (ptr);
4655 tree tem;
4656 /* For convenience allow addresses that collapse to a simple base
4657 and offset. */
4658 if (TREE_CODE (ptr) == ADDR_EXPR
4659 && (handled_component_p (TREE_OPERAND (ptr, 0))
4660 || TREE_CODE (TREE_OPERAND (ptr, 0)) == MEM_REF))
4662 ptr = get_addr_base_and_unit_offset (TREE_OPERAND (ptr, 0), &offset);
4663 gcc_assert (ptr);
4664 ptr = build_fold_addr_expr (ptr);
4665 gcc_assert (is_gimple_reg (ptr) || is_gimple_min_invariant (ptr));
4667 tem = build2 (MEM_REF, TREE_TYPE (ptype),
4668 ptr, build_int_cst (ptype, offset));
4669 SET_EXPR_LOCATION (tem, loc);
4670 return tem;
4673 /* Return the constant offset of a MEM_REF or TARGET_MEM_REF tree T. */
4675 offset_int
4676 mem_ref_offset (const_tree t)
4678 return offset_int::from (TREE_OPERAND (t, 1), SIGNED);
4681 /* Return an invariant ADDR_EXPR of type TYPE taking the address of BASE
4682 offsetted by OFFSET units. */
4684 tree
4685 build_invariant_address (tree type, tree base, HOST_WIDE_INT offset)
4687 tree ref = fold_build2 (MEM_REF, TREE_TYPE (type),
4688 build_fold_addr_expr (base),
4689 build_int_cst (ptr_type_node, offset));
4690 tree addr = build1 (ADDR_EXPR, type, ref);
4691 recompute_tree_invariant_for_addr_expr (addr);
4692 return addr;
4695 /* Similar except don't specify the TREE_TYPE
4696 and leave the TREE_SIDE_EFFECTS as 0.
4697 It is permissible for arguments to be null,
4698 or even garbage if their values do not matter. */
4700 tree
4701 build_nt (enum tree_code code, ...)
4703 tree t;
4704 int length;
4705 int i;
4706 va_list p;
4708 gcc_assert (TREE_CODE_CLASS (code) != tcc_vl_exp);
4710 va_start (p, code);
4712 t = make_node (code);
4713 length = TREE_CODE_LENGTH (code);
4715 for (i = 0; i < length; i++)
4716 TREE_OPERAND (t, i) = va_arg (p, tree);
4718 va_end (p);
4719 return t;
4722 /* Similar to build_nt, but for creating a CALL_EXPR object with a
4723 tree vec. */
4725 tree
4726 build_nt_call_vec (tree fn, vec<tree, va_gc> *args)
4728 tree ret, t;
4729 unsigned int ix;
4731 ret = build_vl_exp (CALL_EXPR, vec_safe_length (args) + 3);
4732 CALL_EXPR_FN (ret) = fn;
4733 CALL_EXPR_STATIC_CHAIN (ret) = NULL_TREE;
4734 FOR_EACH_VEC_SAFE_ELT (args, ix, t)
4735 CALL_EXPR_ARG (ret, ix) = t;
4736 return ret;
4739 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
4740 We do NOT enter this node in any sort of symbol table.
4742 LOC is the location of the decl.
4744 layout_decl is used to set up the decl's storage layout.
4745 Other slots are initialized to 0 or null pointers. */
4747 tree
4748 build_decl (location_t loc, enum tree_code code, tree name,
4749 tree type MEM_STAT_DECL)
4751 tree t;
4753 t = make_node (code PASS_MEM_STAT);
4754 DECL_SOURCE_LOCATION (t) = loc;
4756 /* if (type == error_mark_node)
4757 type = integer_type_node; */
4758 /* That is not done, deliberately, so that having error_mark_node
4759 as the type can suppress useless errors in the use of this variable. */
4761 DECL_NAME (t) = name;
4762 TREE_TYPE (t) = type;
4764 if (code == VAR_DECL || code == PARM_DECL || code == RESULT_DECL)
4765 layout_decl (t, 0);
4767 return t;
4770 /* Builds and returns function declaration with NAME and TYPE. */
4772 tree
4773 build_fn_decl (const char *name, tree type)
4775 tree id = get_identifier (name);
4776 tree decl = build_decl (input_location, FUNCTION_DECL, id, type);
4778 DECL_EXTERNAL (decl) = 1;
4779 TREE_PUBLIC (decl) = 1;
4780 DECL_ARTIFICIAL (decl) = 1;
4781 TREE_NOTHROW (decl) = 1;
4783 return decl;
4786 vec<tree, va_gc> *all_translation_units;
4788 /* Builds a new translation-unit decl with name NAME, queues it in the
4789 global list of translation-unit decls and returns it. */
4791 tree
4792 build_translation_unit_decl (tree name)
4794 tree tu = build_decl (UNKNOWN_LOCATION, TRANSLATION_UNIT_DECL,
4795 name, NULL_TREE);
4796 TRANSLATION_UNIT_LANGUAGE (tu) = lang_hooks.name;
4797 vec_safe_push (all_translation_units, tu);
4798 return tu;
4802 /* BLOCK nodes are used to represent the structure of binding contours
4803 and declarations, once those contours have been exited and their contents
4804 compiled. This information is used for outputting debugging info. */
4806 tree
4807 build_block (tree vars, tree subblocks, tree supercontext, tree chain)
4809 tree block = make_node (BLOCK);
4811 BLOCK_VARS (block) = vars;
4812 BLOCK_SUBBLOCKS (block) = subblocks;
4813 BLOCK_SUPERCONTEXT (block) = supercontext;
4814 BLOCK_CHAIN (block) = chain;
4815 return block;
4819 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
4821 LOC is the location to use in tree T. */
4823 void
4824 protected_set_expr_location (tree t, location_t loc)
4826 if (CAN_HAVE_LOCATION_P (t))
4827 SET_EXPR_LOCATION (t, loc);
4830 /* Reset the expression *EXPR_P, a size or position.
4832 ??? We could reset all non-constant sizes or positions. But it's cheap
4833 enough to not do so and refrain from adding workarounds to dwarf2out.c.
4835 We need to reset self-referential sizes or positions because they cannot
4836 be gimplified and thus can contain a CALL_EXPR after the gimplification
4837 is finished, which will run afoul of LTO streaming. And they need to be
4838 reset to something essentially dummy but not constant, so as to preserve
4839 the properties of the object they are attached to. */
4841 static inline void
4842 free_lang_data_in_one_sizepos (tree *expr_p)
4844 tree expr = *expr_p;
4845 if (CONTAINS_PLACEHOLDER_P (expr))
4846 *expr_p = build0 (PLACEHOLDER_EXPR, TREE_TYPE (expr));
4850 /* Reset all the fields in a binfo node BINFO. We only keep
4851 BINFO_VTABLE, which is used by gimple_fold_obj_type_ref. */
4853 static void
4854 free_lang_data_in_binfo (tree binfo)
4856 unsigned i;
4857 tree t;
4859 gcc_assert (TREE_CODE (binfo) == TREE_BINFO);
4861 BINFO_VIRTUALS (binfo) = NULL_TREE;
4862 BINFO_BASE_ACCESSES (binfo) = NULL;
4863 BINFO_INHERITANCE_CHAIN (binfo) = NULL_TREE;
4864 BINFO_SUBVTT_INDEX (binfo) = NULL_TREE;
4866 FOR_EACH_VEC_ELT (*BINFO_BASE_BINFOS (binfo), i, t)
4867 free_lang_data_in_binfo (t);
4871 /* Reset all language specific information still present in TYPE. */
4873 static void
4874 free_lang_data_in_type (tree type)
4876 gcc_assert (TYPE_P (type));
4878 /* Give the FE a chance to remove its own data first. */
4879 lang_hooks.free_lang_data (type);
4881 TREE_LANG_FLAG_0 (type) = 0;
4882 TREE_LANG_FLAG_1 (type) = 0;
4883 TREE_LANG_FLAG_2 (type) = 0;
4884 TREE_LANG_FLAG_3 (type) = 0;
4885 TREE_LANG_FLAG_4 (type) = 0;
4886 TREE_LANG_FLAG_5 (type) = 0;
4887 TREE_LANG_FLAG_6 (type) = 0;
4889 if (TREE_CODE (type) == FUNCTION_TYPE)
4891 /* Remove the const and volatile qualifiers from arguments. The
4892 C++ front end removes them, but the C front end does not,
4893 leading to false ODR violation errors when merging two
4894 instances of the same function signature compiled by
4895 different front ends. */
4896 for (tree p = TYPE_ARG_TYPES (type); p; p = TREE_CHAIN (p))
4898 tree arg_type = TREE_VALUE (p);
4900 if (TYPE_READONLY (arg_type) || TYPE_VOLATILE (arg_type))
4902 int quals = TYPE_QUALS (arg_type)
4903 & ~TYPE_QUAL_CONST
4904 & ~TYPE_QUAL_VOLATILE;
4905 TREE_VALUE (p) = build_qualified_type (arg_type, quals);
4906 free_lang_data_in_type (TREE_VALUE (p));
4908 /* C++ FE uses TREE_PURPOSE to store initial values. */
4909 TREE_PURPOSE (p) = NULL;
4912 else if (TREE_CODE (type) == METHOD_TYPE)
4913 for (tree p = TYPE_ARG_TYPES (type); p; p = TREE_CHAIN (p))
4914 /* C++ FE uses TREE_PURPOSE to store initial values. */
4915 TREE_PURPOSE (p) = NULL;
4916 else if (RECORD_OR_UNION_TYPE_P (type))
4918 /* Remove members that are not FIELD_DECLs (and maybe
4919 TYPE_DECLs) from the field list of an aggregate. These occur
4920 in C++. */
4921 for (tree *prev = &TYPE_FIELDS (type), member; (member = *prev);)
4922 if (TREE_CODE (member) == FIELD_DECL
4923 || (TREE_CODE (member) == TYPE_DECL
4924 && !DECL_IGNORED_P (member)
4925 && debug_info_level > DINFO_LEVEL_TERSE
4926 && !is_redundant_typedef (member)))
4927 prev = &DECL_CHAIN (member);
4928 else
4929 *prev = DECL_CHAIN (member);
4931 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
4932 and danagle the pointer from time to time. */
4933 if (TYPE_VFIELD (type) && TREE_CODE (TYPE_VFIELD (type)) != FIELD_DECL)
4934 TYPE_VFIELD (type) = NULL_TREE;
4936 if (TYPE_BINFO (type))
4938 free_lang_data_in_binfo (TYPE_BINFO (type));
4939 /* We need to preserve link to bases and virtual table for all
4940 polymorphic types to make devirtualization machinery working.
4941 Debug output cares only about bases, but output also
4942 virtual table pointers so merging of -fdevirtualize and
4943 -fno-devirtualize units is easier. */
4944 if ((!BINFO_VTABLE (TYPE_BINFO (type))
4945 || !flag_devirtualize)
4946 && ((!BINFO_N_BASE_BINFOS (TYPE_BINFO (type))
4947 && !BINFO_VTABLE (TYPE_BINFO (type)))
4948 || debug_info_level != DINFO_LEVEL_NONE))
4949 TYPE_BINFO (type) = NULL;
4952 else if (INTEGRAL_TYPE_P (type)
4953 || SCALAR_FLOAT_TYPE_P (type)
4954 || FIXED_POINT_TYPE_P (type))
4956 free_lang_data_in_one_sizepos (&TYPE_MIN_VALUE (type));
4957 free_lang_data_in_one_sizepos (&TYPE_MAX_VALUE (type));
4960 TYPE_LANG_SLOT_1 (type) = NULL_TREE;
4962 free_lang_data_in_one_sizepos (&TYPE_SIZE (type));
4963 free_lang_data_in_one_sizepos (&TYPE_SIZE_UNIT (type));
4965 if (TYPE_CONTEXT (type)
4966 && TREE_CODE (TYPE_CONTEXT (type)) == BLOCK)
4968 tree ctx = TYPE_CONTEXT (type);
4971 ctx = BLOCK_SUPERCONTEXT (ctx);
4973 while (ctx && TREE_CODE (ctx) == BLOCK);
4974 TYPE_CONTEXT (type) = ctx;
4979 /* Return true if DECL may need an assembler name to be set. */
4981 static inline bool
4982 need_assembler_name_p (tree decl)
4984 /* We use DECL_ASSEMBLER_NAME to hold mangled type names for One Definition
4985 Rule merging. This makes type_odr_p to return true on those types during
4986 LTO and by comparing the mangled name, we can say what types are intended
4987 to be equivalent across compilation unit.
4989 We do not store names of type_in_anonymous_namespace_p.
4991 Record, union and enumeration type have linkage that allows use
4992 to check type_in_anonymous_namespace_p. We do not mangle compound types
4993 that always can be compared structurally.
4995 Similarly for builtin types, we compare properties of their main variant.
4996 A special case are integer types where mangling do make differences
4997 between char/signed char/unsigned char etc. Storing name for these makes
4998 e.g. -fno-signed-char/-fsigned-char mismatches to be handled well.
4999 See cp/mangle.c:write_builtin_type for details. */
5001 if (flag_lto_odr_type_mering
5002 && TREE_CODE (decl) == TYPE_DECL
5003 && DECL_NAME (decl)
5004 && decl == TYPE_NAME (TREE_TYPE (decl))
5005 && TYPE_MAIN_VARIANT (TREE_TYPE (decl)) == TREE_TYPE (decl)
5006 && !TYPE_ARTIFICIAL (TREE_TYPE (decl))
5007 && (type_with_linkage_p (TREE_TYPE (decl))
5008 || TREE_CODE (TREE_TYPE (decl)) == INTEGER_TYPE)
5009 && !variably_modified_type_p (TREE_TYPE (decl), NULL_TREE))
5010 return !DECL_ASSEMBLER_NAME_SET_P (decl);
5011 /* Only FUNCTION_DECLs and VAR_DECLs are considered. */
5012 if (!VAR_OR_FUNCTION_DECL_P (decl))
5013 return false;
5015 /* If DECL already has its assembler name set, it does not need a
5016 new one. */
5017 if (!HAS_DECL_ASSEMBLER_NAME_P (decl)
5018 || DECL_ASSEMBLER_NAME_SET_P (decl))
5019 return false;
5021 /* Abstract decls do not need an assembler name. */
5022 if (DECL_ABSTRACT_P (decl))
5023 return false;
5025 /* For VAR_DECLs, only static, public and external symbols need an
5026 assembler name. */
5027 if (VAR_P (decl)
5028 && !TREE_STATIC (decl)
5029 && !TREE_PUBLIC (decl)
5030 && !DECL_EXTERNAL (decl))
5031 return false;
5033 if (TREE_CODE (decl) == FUNCTION_DECL)
5035 /* Do not set assembler name on builtins. Allow RTL expansion to
5036 decide whether to expand inline or via a regular call. */
5037 if (DECL_BUILT_IN (decl)
5038 && DECL_BUILT_IN_CLASS (decl) != BUILT_IN_FRONTEND)
5039 return false;
5041 /* Functions represented in the callgraph need an assembler name. */
5042 if (cgraph_node::get (decl) != NULL)
5043 return true;
5045 /* Unused and not public functions don't need an assembler name. */
5046 if (!TREE_USED (decl) && !TREE_PUBLIC (decl))
5047 return false;
5050 return true;
5054 /* Reset all language specific information still present in symbol
5055 DECL. */
5057 static void
5058 free_lang_data_in_decl (tree decl)
5060 gcc_assert (DECL_P (decl));
5062 /* Give the FE a chance to remove its own data first. */
5063 lang_hooks.free_lang_data (decl);
5065 TREE_LANG_FLAG_0 (decl) = 0;
5066 TREE_LANG_FLAG_1 (decl) = 0;
5067 TREE_LANG_FLAG_2 (decl) = 0;
5068 TREE_LANG_FLAG_3 (decl) = 0;
5069 TREE_LANG_FLAG_4 (decl) = 0;
5070 TREE_LANG_FLAG_5 (decl) = 0;
5071 TREE_LANG_FLAG_6 (decl) = 0;
5073 free_lang_data_in_one_sizepos (&DECL_SIZE (decl));
5074 free_lang_data_in_one_sizepos (&DECL_SIZE_UNIT (decl));
5075 if (TREE_CODE (decl) == FIELD_DECL)
5077 free_lang_data_in_one_sizepos (&DECL_FIELD_OFFSET (decl));
5078 if (TREE_CODE (DECL_CONTEXT (decl)) == QUAL_UNION_TYPE)
5079 DECL_QUALIFIER (decl) = NULL_TREE;
5082 if (TREE_CODE (decl) == FUNCTION_DECL)
5084 struct cgraph_node *node;
5085 if (!(node = cgraph_node::get (decl))
5086 || (!node->definition && !node->clones))
5088 if (node)
5089 node->release_body ();
5090 else
5092 release_function_body (decl);
5093 DECL_ARGUMENTS (decl) = NULL;
5094 DECL_RESULT (decl) = NULL;
5095 DECL_INITIAL (decl) = error_mark_node;
5098 if (gimple_has_body_p (decl) || (node && node->thunk.thunk_p))
5100 tree t;
5102 /* If DECL has a gimple body, then the context for its
5103 arguments must be DECL. Otherwise, it doesn't really
5104 matter, as we will not be emitting any code for DECL. In
5105 general, there may be other instances of DECL created by
5106 the front end and since PARM_DECLs are generally shared,
5107 their DECL_CONTEXT changes as the replicas of DECL are
5108 created. The only time where DECL_CONTEXT is important
5109 is for the FUNCTION_DECLs that have a gimple body (since
5110 the PARM_DECL will be used in the function's body). */
5111 for (t = DECL_ARGUMENTS (decl); t; t = TREE_CHAIN (t))
5112 DECL_CONTEXT (t) = decl;
5113 if (!DECL_FUNCTION_SPECIFIC_TARGET (decl))
5114 DECL_FUNCTION_SPECIFIC_TARGET (decl)
5115 = target_option_default_node;
5116 if (!DECL_FUNCTION_SPECIFIC_OPTIMIZATION (decl))
5117 DECL_FUNCTION_SPECIFIC_OPTIMIZATION (decl)
5118 = optimization_default_node;
5121 /* DECL_SAVED_TREE holds the GENERIC representation for DECL.
5122 At this point, it is not needed anymore. */
5123 DECL_SAVED_TREE (decl) = NULL_TREE;
5125 /* Clear the abstract origin if it refers to a method.
5126 Otherwise dwarf2out.c will ICE as we splice functions out of
5127 TYPE_FIELDS and thus the origin will not be output
5128 correctly. */
5129 if (DECL_ABSTRACT_ORIGIN (decl)
5130 && DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl))
5131 && RECORD_OR_UNION_TYPE_P
5132 (DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl))))
5133 DECL_ABSTRACT_ORIGIN (decl) = NULL_TREE;
5135 /* Sometimes the C++ frontend doesn't manage to transform a temporary
5136 DECL_VINDEX referring to itself into a vtable slot number as it
5137 should. Happens with functions that are copied and then forgotten
5138 about. Just clear it, it won't matter anymore. */
5139 if (DECL_VINDEX (decl) && !tree_fits_shwi_p (DECL_VINDEX (decl)))
5140 DECL_VINDEX (decl) = NULL_TREE;
5142 else if (VAR_P (decl))
5144 if ((DECL_EXTERNAL (decl)
5145 && (!TREE_STATIC (decl) || !TREE_READONLY (decl)))
5146 || (decl_function_context (decl) && !TREE_STATIC (decl)))
5147 DECL_INITIAL (decl) = NULL_TREE;
5149 else if (TREE_CODE (decl) == TYPE_DECL)
5151 DECL_VISIBILITY (decl) = VISIBILITY_DEFAULT;
5152 DECL_VISIBILITY_SPECIFIED (decl) = 0;
5153 DECL_INITIAL (decl) = NULL_TREE;
5155 else if (TREE_CODE (decl) == FIELD_DECL)
5156 DECL_INITIAL (decl) = NULL_TREE;
5157 else if (TREE_CODE (decl) == TRANSLATION_UNIT_DECL
5158 && DECL_INITIAL (decl)
5159 && TREE_CODE (DECL_INITIAL (decl)) == BLOCK)
5161 /* Strip builtins from the translation-unit BLOCK. We still have targets
5162 without builtin_decl_explicit support and also builtins are shared
5163 nodes and thus we can't use TREE_CHAIN in multiple lists. */
5164 tree *nextp = &BLOCK_VARS (DECL_INITIAL (decl));
5165 while (*nextp)
5167 tree var = *nextp;
5168 if (TREE_CODE (var) == FUNCTION_DECL
5169 && DECL_BUILT_IN (var))
5170 *nextp = TREE_CHAIN (var);
5171 else
5172 nextp = &TREE_CHAIN (var);
5178 /* Data used when collecting DECLs and TYPEs for language data removal. */
5180 struct free_lang_data_d
5182 free_lang_data_d () : decls (100), types (100) {}
5184 /* Worklist to avoid excessive recursion. */
5185 auto_vec<tree> worklist;
5187 /* Set of traversed objects. Used to avoid duplicate visits. */
5188 hash_set<tree> pset;
5190 /* Array of symbols to process with free_lang_data_in_decl. */
5191 auto_vec<tree> decls;
5193 /* Array of types to process with free_lang_data_in_type. */
5194 auto_vec<tree> types;
5198 /* Save all language fields needed to generate proper debug information
5199 for DECL. This saves most fields cleared out by free_lang_data_in_decl. */
5201 static void
5202 save_debug_info_for_decl (tree t)
5204 /*struct saved_debug_info_d *sdi;*/
5206 gcc_assert (debug_info_level > DINFO_LEVEL_TERSE && t && DECL_P (t));
5208 /* FIXME. Partial implementation for saving debug info removed. */
5212 /* Save all language fields needed to generate proper debug information
5213 for TYPE. This saves most fields cleared out by free_lang_data_in_type. */
5215 static void
5216 save_debug_info_for_type (tree t)
5218 /*struct saved_debug_info_d *sdi;*/
5220 gcc_assert (debug_info_level > DINFO_LEVEL_TERSE && t && TYPE_P (t));
5222 /* FIXME. Partial implementation for saving debug info removed. */
5226 /* Add type or decl T to one of the list of tree nodes that need their
5227 language data removed. The lists are held inside FLD. */
5229 static void
5230 add_tree_to_fld_list (tree t, struct free_lang_data_d *fld)
5232 if (DECL_P (t))
5234 fld->decls.safe_push (t);
5235 if (debug_info_level > DINFO_LEVEL_TERSE)
5236 save_debug_info_for_decl (t);
5238 else if (TYPE_P (t))
5240 fld->types.safe_push (t);
5241 if (debug_info_level > DINFO_LEVEL_TERSE)
5242 save_debug_info_for_type (t);
5244 else
5245 gcc_unreachable ();
5248 /* Push tree node T into FLD->WORKLIST. */
5250 static inline void
5251 fld_worklist_push (tree t, struct free_lang_data_d *fld)
5253 if (t && !is_lang_specific (t) && !fld->pset.contains (t))
5254 fld->worklist.safe_push ((t));
5258 /* Operand callback helper for free_lang_data_in_node. *TP is the
5259 subtree operand being considered. */
5261 static tree
5262 find_decls_types_r (tree *tp, int *ws, void *data)
5264 tree t = *tp;
5265 struct free_lang_data_d *fld = (struct free_lang_data_d *) data;
5267 if (TREE_CODE (t) == TREE_LIST)
5268 return NULL_TREE;
5270 /* Language specific nodes will be removed, so there is no need
5271 to gather anything under them. */
5272 if (is_lang_specific (t))
5274 *ws = 0;
5275 return NULL_TREE;
5278 if (DECL_P (t))
5280 /* Note that walk_tree does not traverse every possible field in
5281 decls, so we have to do our own traversals here. */
5282 add_tree_to_fld_list (t, fld);
5284 fld_worklist_push (DECL_NAME (t), fld);
5285 fld_worklist_push (DECL_CONTEXT (t), fld);
5286 fld_worklist_push (DECL_SIZE (t), fld);
5287 fld_worklist_push (DECL_SIZE_UNIT (t), fld);
5289 /* We are going to remove everything under DECL_INITIAL for
5290 TYPE_DECLs. No point walking them. */
5291 if (TREE_CODE (t) != TYPE_DECL)
5292 fld_worklist_push (DECL_INITIAL (t), fld);
5294 fld_worklist_push (DECL_ATTRIBUTES (t), fld);
5295 fld_worklist_push (DECL_ABSTRACT_ORIGIN (t), fld);
5297 if (TREE_CODE (t) == FUNCTION_DECL)
5299 fld_worklist_push (DECL_ARGUMENTS (t), fld);
5300 fld_worklist_push (DECL_RESULT (t), fld);
5302 else if (TREE_CODE (t) == TYPE_DECL)
5304 fld_worklist_push (DECL_ORIGINAL_TYPE (t), fld);
5306 else if (TREE_CODE (t) == FIELD_DECL)
5308 fld_worklist_push (DECL_FIELD_OFFSET (t), fld);
5309 fld_worklist_push (DECL_BIT_FIELD_TYPE (t), fld);
5310 fld_worklist_push (DECL_FIELD_BIT_OFFSET (t), fld);
5311 fld_worklist_push (DECL_FCONTEXT (t), fld);
5314 if ((VAR_P (t) || TREE_CODE (t) == PARM_DECL)
5315 && DECL_HAS_VALUE_EXPR_P (t))
5316 fld_worklist_push (DECL_VALUE_EXPR (t), fld);
5318 if (TREE_CODE (t) != FIELD_DECL
5319 && TREE_CODE (t) != TYPE_DECL)
5320 fld_worklist_push (TREE_CHAIN (t), fld);
5321 *ws = 0;
5323 else if (TYPE_P (t))
5325 /* Note that walk_tree does not traverse every possible field in
5326 types, so we have to do our own traversals here. */
5327 add_tree_to_fld_list (t, fld);
5329 if (!RECORD_OR_UNION_TYPE_P (t))
5330 fld_worklist_push (TYPE_CACHED_VALUES (t), fld);
5331 fld_worklist_push (TYPE_SIZE (t), fld);
5332 fld_worklist_push (TYPE_SIZE_UNIT (t), fld);
5333 fld_worklist_push (TYPE_ATTRIBUTES (t), fld);
5334 fld_worklist_push (TYPE_POINTER_TO (t), fld);
5335 fld_worklist_push (TYPE_REFERENCE_TO (t), fld);
5336 fld_worklist_push (TYPE_NAME (t), fld);
5337 /* Do not walk TYPE_NEXT_PTR_TO or TYPE_NEXT_REF_TO. We do not stream
5338 them and thus do not and want not to reach unused pointer types
5339 this way. */
5340 if (!POINTER_TYPE_P (t))
5341 fld_worklist_push (TYPE_MIN_VALUE_RAW (t), fld);
5342 /* TYPE_MAX_VALUE_RAW is TYPE_BINFO for record types. */
5343 if (!RECORD_OR_UNION_TYPE_P (t))
5344 fld_worklist_push (TYPE_MAX_VALUE_RAW (t), fld);
5345 fld_worklist_push (TYPE_MAIN_VARIANT (t), fld);
5346 /* Do not walk TYPE_NEXT_VARIANT. We do not stream it and thus
5347 do not and want not to reach unused variants this way. */
5348 if (TYPE_CONTEXT (t))
5350 tree ctx = TYPE_CONTEXT (t);
5351 /* We adjust BLOCK TYPE_CONTEXTs to the innermost non-BLOCK one.
5352 So push that instead. */
5353 while (ctx && TREE_CODE (ctx) == BLOCK)
5354 ctx = BLOCK_SUPERCONTEXT (ctx);
5355 fld_worklist_push (ctx, fld);
5357 /* Do not walk TYPE_CANONICAL. We do not stream it and thus do not
5358 and want not to reach unused types this way. */
5360 if (RECORD_OR_UNION_TYPE_P (t) && TYPE_BINFO (t))
5362 unsigned i;
5363 tree tem;
5364 FOR_EACH_VEC_ELT (*BINFO_BASE_BINFOS (TYPE_BINFO (t)), i, tem)
5365 fld_worklist_push (TREE_TYPE (tem), fld);
5366 fld_worklist_push (BINFO_VIRTUALS (TYPE_BINFO (t)), fld);
5368 if (RECORD_OR_UNION_TYPE_P (t))
5370 tree tem;
5371 /* Push all TYPE_FIELDS - there can be interleaving interesting
5372 and non-interesting things. */
5373 tem = TYPE_FIELDS (t);
5374 while (tem)
5376 if (TREE_CODE (tem) == FIELD_DECL
5377 || (TREE_CODE (tem) == TYPE_DECL
5378 && !DECL_IGNORED_P (tem)
5379 && debug_info_level > DINFO_LEVEL_TERSE
5380 && !is_redundant_typedef (tem)))
5381 fld_worklist_push (tem, fld);
5382 tem = TREE_CHAIN (tem);
5386 fld_worklist_push (TYPE_STUB_DECL (t), fld);
5387 *ws = 0;
5389 else if (TREE_CODE (t) == BLOCK)
5391 tree tem;
5392 for (tem = BLOCK_VARS (t); tem; tem = TREE_CHAIN (tem))
5393 fld_worklist_push (tem, fld);
5394 for (tem = BLOCK_SUBBLOCKS (t); tem; tem = BLOCK_CHAIN (tem))
5395 fld_worklist_push (tem, fld);
5396 fld_worklist_push (BLOCK_ABSTRACT_ORIGIN (t), fld);
5399 if (TREE_CODE (t) != IDENTIFIER_NODE
5400 && CODE_CONTAINS_STRUCT (TREE_CODE (t), TS_TYPED))
5401 fld_worklist_push (TREE_TYPE (t), fld);
5403 return NULL_TREE;
5407 /* Find decls and types in T. */
5409 static void
5410 find_decls_types (tree t, struct free_lang_data_d *fld)
5412 while (1)
5414 if (!fld->pset.contains (t))
5415 walk_tree (&t, find_decls_types_r, fld, &fld->pset);
5416 if (fld->worklist.is_empty ())
5417 break;
5418 t = fld->worklist.pop ();
5422 /* Translate all the types in LIST with the corresponding runtime
5423 types. */
5425 static tree
5426 get_eh_types_for_runtime (tree list)
5428 tree head, prev;
5430 if (list == NULL_TREE)
5431 return NULL_TREE;
5433 head = build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list)));
5434 prev = head;
5435 list = TREE_CHAIN (list);
5436 while (list)
5438 tree n = build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list)));
5439 TREE_CHAIN (prev) = n;
5440 prev = TREE_CHAIN (prev);
5441 list = TREE_CHAIN (list);
5444 return head;
5448 /* Find decls and types referenced in EH region R and store them in
5449 FLD->DECLS and FLD->TYPES. */
5451 static void
5452 find_decls_types_in_eh_region (eh_region r, struct free_lang_data_d *fld)
5454 switch (r->type)
5456 case ERT_CLEANUP:
5457 break;
5459 case ERT_TRY:
5461 eh_catch c;
5463 /* The types referenced in each catch must first be changed to the
5464 EH types used at runtime. This removes references to FE types
5465 in the region. */
5466 for (c = r->u.eh_try.first_catch; c ; c = c->next_catch)
5468 c->type_list = get_eh_types_for_runtime (c->type_list);
5469 walk_tree (&c->type_list, find_decls_types_r, fld, &fld->pset);
5472 break;
5474 case ERT_ALLOWED_EXCEPTIONS:
5475 r->u.allowed.type_list
5476 = get_eh_types_for_runtime (r->u.allowed.type_list);
5477 walk_tree (&r->u.allowed.type_list, find_decls_types_r, fld, &fld->pset);
5478 break;
5480 case ERT_MUST_NOT_THROW:
5481 walk_tree (&r->u.must_not_throw.failure_decl,
5482 find_decls_types_r, fld, &fld->pset);
5483 break;
5488 /* Find decls and types referenced in cgraph node N and store them in
5489 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
5490 look for *every* kind of DECL and TYPE node reachable from N,
5491 including those embedded inside types and decls (i.e,, TYPE_DECLs,
5492 NAMESPACE_DECLs, etc). */
5494 static void
5495 find_decls_types_in_node (struct cgraph_node *n, struct free_lang_data_d *fld)
5497 basic_block bb;
5498 struct function *fn;
5499 unsigned ix;
5500 tree t;
5502 find_decls_types (n->decl, fld);
5504 if (!gimple_has_body_p (n->decl))
5505 return;
5507 gcc_assert (current_function_decl == NULL_TREE && cfun == NULL);
5509 fn = DECL_STRUCT_FUNCTION (n->decl);
5511 /* Traverse locals. */
5512 FOR_EACH_LOCAL_DECL (fn, ix, t)
5513 find_decls_types (t, fld);
5515 /* Traverse EH regions in FN. */
5517 eh_region r;
5518 FOR_ALL_EH_REGION_FN (r, fn)
5519 find_decls_types_in_eh_region (r, fld);
5522 /* Traverse every statement in FN. */
5523 FOR_EACH_BB_FN (bb, fn)
5525 gphi_iterator psi;
5526 gimple_stmt_iterator si;
5527 unsigned i;
5529 for (psi = gsi_start_phis (bb); !gsi_end_p (psi); gsi_next (&psi))
5531 gphi *phi = psi.phi ();
5533 for (i = 0; i < gimple_phi_num_args (phi); i++)
5535 tree *arg_p = gimple_phi_arg_def_ptr (phi, i);
5536 find_decls_types (*arg_p, fld);
5540 for (si = gsi_start_bb (bb); !gsi_end_p (si); gsi_next (&si))
5542 gimple *stmt = gsi_stmt (si);
5544 if (is_gimple_call (stmt))
5545 find_decls_types (gimple_call_fntype (stmt), fld);
5547 for (i = 0; i < gimple_num_ops (stmt); i++)
5549 tree arg = gimple_op (stmt, i);
5550 find_decls_types (arg, fld);
5557 /* Find decls and types referenced in varpool node N and store them in
5558 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
5559 look for *every* kind of DECL and TYPE node reachable from N,
5560 including those embedded inside types and decls (i.e,, TYPE_DECLs,
5561 NAMESPACE_DECLs, etc). */
5563 static void
5564 find_decls_types_in_var (varpool_node *v, struct free_lang_data_d *fld)
5566 find_decls_types (v->decl, fld);
5569 /* If T needs an assembler name, have one created for it. */
5571 void
5572 assign_assembler_name_if_needed (tree t)
5574 if (need_assembler_name_p (t))
5576 /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit
5577 diagnostics that use input_location to show locus
5578 information. The problem here is that, at this point,
5579 input_location is generally anchored to the end of the file
5580 (since the parser is long gone), so we don't have a good
5581 position to pin it to.
5583 To alleviate this problem, this uses the location of T's
5584 declaration. Examples of this are
5585 testsuite/g++.dg/template/cond2.C and
5586 testsuite/g++.dg/template/pr35240.C. */
5587 location_t saved_location = input_location;
5588 input_location = DECL_SOURCE_LOCATION (t);
5590 decl_assembler_name (t);
5592 input_location = saved_location;
5597 /* Free language specific information for every operand and expression
5598 in every node of the call graph. This process operates in three stages:
5600 1- Every callgraph node and varpool node is traversed looking for
5601 decls and types embedded in them. This is a more exhaustive
5602 search than that done by find_referenced_vars, because it will
5603 also collect individual fields, decls embedded in types, etc.
5605 2- All the decls found are sent to free_lang_data_in_decl.
5607 3- All the types found are sent to free_lang_data_in_type.
5609 The ordering between decls and types is important because
5610 free_lang_data_in_decl sets assembler names, which includes
5611 mangling. So types cannot be freed up until assembler names have
5612 been set up. */
5614 static void
5615 free_lang_data_in_cgraph (void)
5617 struct cgraph_node *n;
5618 varpool_node *v;
5619 struct free_lang_data_d fld;
5620 tree t;
5621 unsigned i;
5622 alias_pair *p;
5624 /* Find decls and types in the body of every function in the callgraph. */
5625 FOR_EACH_FUNCTION (n)
5626 find_decls_types_in_node (n, &fld);
5628 FOR_EACH_VEC_SAFE_ELT (alias_pairs, i, p)
5629 find_decls_types (p->decl, &fld);
5631 /* Find decls and types in every varpool symbol. */
5632 FOR_EACH_VARIABLE (v)
5633 find_decls_types_in_var (v, &fld);
5635 /* Set the assembler name on every decl found. We need to do this
5636 now because free_lang_data_in_decl will invalidate data needed
5637 for mangling. This breaks mangling on interdependent decls. */
5638 FOR_EACH_VEC_ELT (fld.decls, i, t)
5639 assign_assembler_name_if_needed (t);
5641 /* Traverse every decl found freeing its language data. */
5642 FOR_EACH_VEC_ELT (fld.decls, i, t)
5643 free_lang_data_in_decl (t);
5645 /* Traverse every type found freeing its language data. */
5646 FOR_EACH_VEC_ELT (fld.types, i, t)
5647 free_lang_data_in_type (t);
5648 if (flag_checking)
5650 FOR_EACH_VEC_ELT (fld.types, i, t)
5651 verify_type (t);
5656 /* Free resources that are used by FE but are not needed once they are done. */
5658 static unsigned
5659 free_lang_data (void)
5661 unsigned i;
5663 /* If we are the LTO frontend we have freed lang-specific data already. */
5664 if (in_lto_p
5665 || (!flag_generate_lto && !flag_generate_offload))
5666 return 0;
5668 /* Provide a dummy TRANSLATION_UNIT_DECL if the FE failed to provide one. */
5669 if (vec_safe_is_empty (all_translation_units))
5670 build_translation_unit_decl (NULL_TREE);
5672 /* Allocate and assign alias sets to the standard integer types
5673 while the slots are still in the way the frontends generated them. */
5674 for (i = 0; i < itk_none; ++i)
5675 if (integer_types[i])
5676 TYPE_ALIAS_SET (integer_types[i]) = get_alias_set (integer_types[i]);
5678 /* Traverse the IL resetting language specific information for
5679 operands, expressions, etc. */
5680 free_lang_data_in_cgraph ();
5682 /* Create gimple variants for common types. */
5683 for (unsigned i = 0;
5684 i < sizeof (builtin_structptr_types) / sizeof (builtin_structptr_type);
5685 ++i)
5686 builtin_structptr_types[i].node = builtin_structptr_types[i].base;
5688 /* Reset some langhooks. Do not reset types_compatible_p, it may
5689 still be used indirectly via the get_alias_set langhook. */
5690 lang_hooks.dwarf_name = lhd_dwarf_name;
5691 lang_hooks.decl_printable_name = gimple_decl_printable_name;
5692 lang_hooks.gimplify_expr = lhd_gimplify_expr;
5694 /* We do not want the default decl_assembler_name implementation,
5695 rather if we have fixed everything we want a wrapper around it
5696 asserting that all non-local symbols already got their assembler
5697 name and only produce assembler names for local symbols. Or rather
5698 make sure we never call decl_assembler_name on local symbols and
5699 devise a separate, middle-end private scheme for it. */
5701 /* Reset diagnostic machinery. */
5702 tree_diagnostics_defaults (global_dc);
5704 return 0;
5708 namespace {
5710 const pass_data pass_data_ipa_free_lang_data =
5712 SIMPLE_IPA_PASS, /* type */
5713 "*free_lang_data", /* name */
5714 OPTGROUP_NONE, /* optinfo_flags */
5715 TV_IPA_FREE_LANG_DATA, /* tv_id */
5716 0, /* properties_required */
5717 0, /* properties_provided */
5718 0, /* properties_destroyed */
5719 0, /* todo_flags_start */
5720 0, /* todo_flags_finish */
5723 class pass_ipa_free_lang_data : public simple_ipa_opt_pass
5725 public:
5726 pass_ipa_free_lang_data (gcc::context *ctxt)
5727 : simple_ipa_opt_pass (pass_data_ipa_free_lang_data, ctxt)
5730 /* opt_pass methods: */
5731 virtual unsigned int execute (function *) { return free_lang_data (); }
5733 }; // class pass_ipa_free_lang_data
5735 } // anon namespace
5737 simple_ipa_opt_pass *
5738 make_pass_ipa_free_lang_data (gcc::context *ctxt)
5740 return new pass_ipa_free_lang_data (ctxt);
5743 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
5744 of the various TYPE_QUAL values. */
5746 static void
5747 set_type_quals (tree type, int type_quals)
5749 TYPE_READONLY (type) = (type_quals & TYPE_QUAL_CONST) != 0;
5750 TYPE_VOLATILE (type) = (type_quals & TYPE_QUAL_VOLATILE) != 0;
5751 TYPE_RESTRICT (type) = (type_quals & TYPE_QUAL_RESTRICT) != 0;
5752 TYPE_ATOMIC (type) = (type_quals & TYPE_QUAL_ATOMIC) != 0;
5753 TYPE_ADDR_SPACE (type) = DECODE_QUAL_ADDR_SPACE (type_quals);
5756 /* Returns true iff CAND and BASE have equivalent language-specific
5757 qualifiers. */
5759 bool
5760 check_lang_type (const_tree cand, const_tree base)
5762 if (lang_hooks.types.type_hash_eq == NULL)
5763 return true;
5764 /* type_hash_eq currently only applies to these types. */
5765 if (TREE_CODE (cand) != FUNCTION_TYPE
5766 && TREE_CODE (cand) != METHOD_TYPE)
5767 return true;
5768 return lang_hooks.types.type_hash_eq (cand, base);
5771 /* Returns true iff unqualified CAND and BASE are equivalent. */
5773 bool
5774 check_base_type (const_tree cand, const_tree base)
5776 return (TYPE_NAME (cand) == TYPE_NAME (base)
5777 /* Apparently this is needed for Objective-C. */
5778 && TYPE_CONTEXT (cand) == TYPE_CONTEXT (base)
5779 /* Check alignment. */
5780 && TYPE_ALIGN (cand) == TYPE_ALIGN (base)
5781 && attribute_list_equal (TYPE_ATTRIBUTES (cand),
5782 TYPE_ATTRIBUTES (base)));
5785 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
5787 bool
5788 check_qualified_type (const_tree cand, const_tree base, int type_quals)
5790 return (TYPE_QUALS (cand) == type_quals
5791 && check_base_type (cand, base)
5792 && check_lang_type (cand, base));
5795 /* Returns true iff CAND is equivalent to BASE with ALIGN. */
5797 static bool
5798 check_aligned_type (const_tree cand, const_tree base, unsigned int align)
5800 return (TYPE_QUALS (cand) == TYPE_QUALS (base)
5801 && TYPE_NAME (cand) == TYPE_NAME (base)
5802 /* Apparently this is needed for Objective-C. */
5803 && TYPE_CONTEXT (cand) == TYPE_CONTEXT (base)
5804 /* Check alignment. */
5805 && TYPE_ALIGN (cand) == align
5806 && attribute_list_equal (TYPE_ATTRIBUTES (cand),
5807 TYPE_ATTRIBUTES (base))
5808 && check_lang_type (cand, base));
5811 /* This function checks to see if TYPE matches the size one of the built-in
5812 atomic types, and returns that core atomic type. */
5814 static tree
5815 find_atomic_core_type (tree type)
5817 tree base_atomic_type;
5819 /* Only handle complete types. */
5820 if (TYPE_SIZE (type) == NULL_TREE)
5821 return NULL_TREE;
5823 HOST_WIDE_INT type_size = tree_to_uhwi (TYPE_SIZE (type));
5824 switch (type_size)
5826 case 8:
5827 base_atomic_type = atomicQI_type_node;
5828 break;
5830 case 16:
5831 base_atomic_type = atomicHI_type_node;
5832 break;
5834 case 32:
5835 base_atomic_type = atomicSI_type_node;
5836 break;
5838 case 64:
5839 base_atomic_type = atomicDI_type_node;
5840 break;
5842 case 128:
5843 base_atomic_type = atomicTI_type_node;
5844 break;
5846 default:
5847 base_atomic_type = NULL_TREE;
5850 return base_atomic_type;
5853 /* Return a version of the TYPE, qualified as indicated by the
5854 TYPE_QUALS, if one exists. If no qualified version exists yet,
5855 return NULL_TREE. */
5857 tree
5858 get_qualified_type (tree type, int type_quals)
5860 tree t;
5862 if (TYPE_QUALS (type) == type_quals)
5863 return type;
5865 /* Search the chain of variants to see if there is already one there just
5866 like the one we need to have. If so, use that existing one. We must
5867 preserve the TYPE_NAME, since there is code that depends on this. */
5868 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
5869 if (check_qualified_type (t, type, type_quals))
5870 return t;
5872 return NULL_TREE;
5875 /* Like get_qualified_type, but creates the type if it does not
5876 exist. This function never returns NULL_TREE. */
5878 tree
5879 build_qualified_type (tree type, int type_quals MEM_STAT_DECL)
5881 tree t;
5883 /* See if we already have the appropriate qualified variant. */
5884 t = get_qualified_type (type, type_quals);
5886 /* If not, build it. */
5887 if (!t)
5889 t = build_variant_type_copy (type PASS_MEM_STAT);
5890 set_type_quals (t, type_quals);
5892 if (((type_quals & TYPE_QUAL_ATOMIC) == TYPE_QUAL_ATOMIC))
5894 /* See if this object can map to a basic atomic type. */
5895 tree atomic_type = find_atomic_core_type (type);
5896 if (atomic_type)
5898 /* Ensure the alignment of this type is compatible with
5899 the required alignment of the atomic type. */
5900 if (TYPE_ALIGN (atomic_type) > TYPE_ALIGN (t))
5901 SET_TYPE_ALIGN (t, TYPE_ALIGN (atomic_type));
5905 if (TYPE_STRUCTURAL_EQUALITY_P (type))
5906 /* Propagate structural equality. */
5907 SET_TYPE_STRUCTURAL_EQUALITY (t);
5908 else if (TYPE_CANONICAL (type) != type)
5909 /* Build the underlying canonical type, since it is different
5910 from TYPE. */
5912 tree c = build_qualified_type (TYPE_CANONICAL (type), type_quals);
5913 TYPE_CANONICAL (t) = TYPE_CANONICAL (c);
5915 else
5916 /* T is its own canonical type. */
5917 TYPE_CANONICAL (t) = t;
5921 return t;
5924 /* Create a variant of type T with alignment ALIGN. */
5926 tree
5927 build_aligned_type (tree type, unsigned int align)
5929 tree t;
5931 if (TYPE_PACKED (type)
5932 || TYPE_ALIGN (type) == align)
5933 return type;
5935 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
5936 if (check_aligned_type (t, type, align))
5937 return t;
5939 t = build_variant_type_copy (type);
5940 SET_TYPE_ALIGN (t, align);
5941 TYPE_USER_ALIGN (t) = 1;
5943 return t;
5946 /* Create a new distinct copy of TYPE. The new type is made its own
5947 MAIN_VARIANT. If TYPE requires structural equality checks, the
5948 resulting type requires structural equality checks; otherwise, its
5949 TYPE_CANONICAL points to itself. */
5951 tree
5952 build_distinct_type_copy (tree type MEM_STAT_DECL)
5954 tree t = copy_node (type PASS_MEM_STAT);
5956 TYPE_POINTER_TO (t) = 0;
5957 TYPE_REFERENCE_TO (t) = 0;
5959 /* Set the canonical type either to a new equivalence class, or
5960 propagate the need for structural equality checks. */
5961 if (TYPE_STRUCTURAL_EQUALITY_P (type))
5962 SET_TYPE_STRUCTURAL_EQUALITY (t);
5963 else
5964 TYPE_CANONICAL (t) = t;
5966 /* Make it its own variant. */
5967 TYPE_MAIN_VARIANT (t) = t;
5968 TYPE_NEXT_VARIANT (t) = 0;
5970 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
5971 whose TREE_TYPE is not t. This can also happen in the Ada
5972 frontend when using subtypes. */
5974 return t;
5977 /* Create a new variant of TYPE, equivalent but distinct. This is so
5978 the caller can modify it. TYPE_CANONICAL for the return type will
5979 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
5980 are considered equal by the language itself (or that both types
5981 require structural equality checks). */
5983 tree
5984 build_variant_type_copy (tree type MEM_STAT_DECL)
5986 tree t, m = TYPE_MAIN_VARIANT (type);
5988 t = build_distinct_type_copy (type PASS_MEM_STAT);
5990 /* Since we're building a variant, assume that it is a non-semantic
5991 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
5992 TYPE_CANONICAL (t) = TYPE_CANONICAL (type);
5993 /* Type variants have no alias set defined. */
5994 TYPE_ALIAS_SET (t) = -1;
5996 /* Add the new type to the chain of variants of TYPE. */
5997 TYPE_NEXT_VARIANT (t) = TYPE_NEXT_VARIANT (m);
5998 TYPE_NEXT_VARIANT (m) = t;
5999 TYPE_MAIN_VARIANT (t) = m;
6001 return t;
6004 /* Return true if the from tree in both tree maps are equal. */
6007 tree_map_base_eq (const void *va, const void *vb)
6009 const struct tree_map_base *const a = (const struct tree_map_base *) va,
6010 *const b = (const struct tree_map_base *) vb;
6011 return (a->from == b->from);
6014 /* Hash a from tree in a tree_base_map. */
6016 unsigned int
6017 tree_map_base_hash (const void *item)
6019 return htab_hash_pointer (((const struct tree_map_base *)item)->from);
6022 /* Return true if this tree map structure is marked for garbage collection
6023 purposes. We simply return true if the from tree is marked, so that this
6024 structure goes away when the from tree goes away. */
6027 tree_map_base_marked_p (const void *p)
6029 return ggc_marked_p (((const struct tree_map_base *) p)->from);
6032 /* Hash a from tree in a tree_map. */
6034 unsigned int
6035 tree_map_hash (const void *item)
6037 return (((const struct tree_map *) item)->hash);
6040 /* Hash a from tree in a tree_decl_map. */
6042 unsigned int
6043 tree_decl_map_hash (const void *item)
6045 return DECL_UID (((const struct tree_decl_map *) item)->base.from);
6048 /* Return the initialization priority for DECL. */
6050 priority_type
6051 decl_init_priority_lookup (tree decl)
6053 symtab_node *snode = symtab_node::get (decl);
6055 if (!snode)
6056 return DEFAULT_INIT_PRIORITY;
6057 return
6058 snode->get_init_priority ();
6061 /* Return the finalization priority for DECL. */
6063 priority_type
6064 decl_fini_priority_lookup (tree decl)
6066 cgraph_node *node = cgraph_node::get (decl);
6068 if (!node)
6069 return DEFAULT_INIT_PRIORITY;
6070 return
6071 node->get_fini_priority ();
6074 /* Set the initialization priority for DECL to PRIORITY. */
6076 void
6077 decl_init_priority_insert (tree decl, priority_type priority)
6079 struct symtab_node *snode;
6081 if (priority == DEFAULT_INIT_PRIORITY)
6083 snode = symtab_node::get (decl);
6084 if (!snode)
6085 return;
6087 else if (VAR_P (decl))
6088 snode = varpool_node::get_create (decl);
6089 else
6090 snode = cgraph_node::get_create (decl);
6091 snode->set_init_priority (priority);
6094 /* Set the finalization priority for DECL to PRIORITY. */
6096 void
6097 decl_fini_priority_insert (tree decl, priority_type priority)
6099 struct cgraph_node *node;
6101 if (priority == DEFAULT_INIT_PRIORITY)
6103 node = cgraph_node::get (decl);
6104 if (!node)
6105 return;
6107 else
6108 node = cgraph_node::get_create (decl);
6109 node->set_fini_priority (priority);
6112 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
6114 static void
6115 print_debug_expr_statistics (void)
6117 fprintf (stderr, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
6118 (long) debug_expr_for_decl->size (),
6119 (long) debug_expr_for_decl->elements (),
6120 debug_expr_for_decl->collisions ());
6123 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
6125 static void
6126 print_value_expr_statistics (void)
6128 fprintf (stderr, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
6129 (long) value_expr_for_decl->size (),
6130 (long) value_expr_for_decl->elements (),
6131 value_expr_for_decl->collisions ());
6134 /* Lookup a debug expression for FROM, and return it if we find one. */
6136 tree
6137 decl_debug_expr_lookup (tree from)
6139 struct tree_decl_map *h, in;
6140 in.base.from = from;
6142 h = debug_expr_for_decl->find_with_hash (&in, DECL_UID (from));
6143 if (h)
6144 return h->to;
6145 return NULL_TREE;
6148 /* Insert a mapping FROM->TO in the debug expression hashtable. */
6150 void
6151 decl_debug_expr_insert (tree from, tree to)
6153 struct tree_decl_map *h;
6155 h = ggc_alloc<tree_decl_map> ();
6156 h->base.from = from;
6157 h->to = to;
6158 *debug_expr_for_decl->find_slot_with_hash (h, DECL_UID (from), INSERT) = h;
6161 /* Lookup a value expression for FROM, and return it if we find one. */
6163 tree
6164 decl_value_expr_lookup (tree from)
6166 struct tree_decl_map *h, in;
6167 in.base.from = from;
6169 h = value_expr_for_decl->find_with_hash (&in, DECL_UID (from));
6170 if (h)
6171 return h->to;
6172 return NULL_TREE;
6175 /* Insert a mapping FROM->TO in the value expression hashtable. */
6177 void
6178 decl_value_expr_insert (tree from, tree to)
6180 struct tree_decl_map *h;
6182 h = ggc_alloc<tree_decl_map> ();
6183 h->base.from = from;
6184 h->to = to;
6185 *value_expr_for_decl->find_slot_with_hash (h, DECL_UID (from), INSERT) = h;
6188 /* Lookup a vector of debug arguments for FROM, and return it if we
6189 find one. */
6191 vec<tree, va_gc> **
6192 decl_debug_args_lookup (tree from)
6194 struct tree_vec_map *h, in;
6196 if (!DECL_HAS_DEBUG_ARGS_P (from))
6197 return NULL;
6198 gcc_checking_assert (debug_args_for_decl != NULL);
6199 in.base.from = from;
6200 h = debug_args_for_decl->find_with_hash (&in, DECL_UID (from));
6201 if (h)
6202 return &h->to;
6203 return NULL;
6206 /* Insert a mapping FROM->empty vector of debug arguments in the value
6207 expression hashtable. */
6209 vec<tree, va_gc> **
6210 decl_debug_args_insert (tree from)
6212 struct tree_vec_map *h;
6213 tree_vec_map **loc;
6215 if (DECL_HAS_DEBUG_ARGS_P (from))
6216 return decl_debug_args_lookup (from);
6217 if (debug_args_for_decl == NULL)
6218 debug_args_for_decl = hash_table<tree_vec_map_cache_hasher>::create_ggc (64);
6219 h = ggc_alloc<tree_vec_map> ();
6220 h->base.from = from;
6221 h->to = NULL;
6222 loc = debug_args_for_decl->find_slot_with_hash (h, DECL_UID (from), INSERT);
6223 *loc = h;
6224 DECL_HAS_DEBUG_ARGS_P (from) = 1;
6225 return &h->to;
6228 /* Hashing of types so that we don't make duplicates.
6229 The entry point is `type_hash_canon'. */
6231 /* Generate the default hash code for TYPE. This is designed for
6232 speed, rather than maximum entropy. */
6234 hashval_t
6235 type_hash_canon_hash (tree type)
6237 inchash::hash hstate;
6239 hstate.add_int (TREE_CODE (type));
6241 if (TREE_TYPE (type))
6242 hstate.add_object (TYPE_HASH (TREE_TYPE (type)));
6244 for (tree t = TYPE_ATTRIBUTES (type); t; t = TREE_CHAIN (t))
6245 /* Just the identifier is adequate to distinguish. */
6246 hstate.add_object (IDENTIFIER_HASH_VALUE (get_attribute_name (t)));
6248 switch (TREE_CODE (type))
6250 case METHOD_TYPE:
6251 hstate.add_object (TYPE_HASH (TYPE_METHOD_BASETYPE (type)));
6252 /* FALLTHROUGH. */
6253 case FUNCTION_TYPE:
6254 for (tree t = TYPE_ARG_TYPES (type); t; t = TREE_CHAIN (t))
6255 if (TREE_VALUE (t) != error_mark_node)
6256 hstate.add_object (TYPE_HASH (TREE_VALUE (t)));
6257 break;
6259 case OFFSET_TYPE:
6260 hstate.add_object (TYPE_HASH (TYPE_OFFSET_BASETYPE (type)));
6261 break;
6263 case ARRAY_TYPE:
6265 if (TYPE_DOMAIN (type))
6266 hstate.add_object (TYPE_HASH (TYPE_DOMAIN (type)));
6267 if (!AGGREGATE_TYPE_P (TREE_TYPE (type)))
6269 unsigned typeless = TYPE_TYPELESS_STORAGE (type);
6270 hstate.add_object (typeless);
6273 break;
6275 case INTEGER_TYPE:
6277 tree t = TYPE_MAX_VALUE (type);
6278 if (!t)
6279 t = TYPE_MIN_VALUE (type);
6280 for (int i = 0; i < TREE_INT_CST_NUNITS (t); i++)
6281 hstate.add_object (TREE_INT_CST_ELT (t, i));
6282 break;
6285 case REAL_TYPE:
6286 case FIXED_POINT_TYPE:
6288 unsigned prec = TYPE_PRECISION (type);
6289 hstate.add_object (prec);
6290 break;
6293 case VECTOR_TYPE:
6295 unsigned nunits = TYPE_VECTOR_SUBPARTS (type);
6296 hstate.add_object (nunits);
6297 break;
6300 default:
6301 break;
6304 return hstate.end ();
6307 /* These are the Hashtable callback functions. */
6309 /* Returns true iff the types are equivalent. */
6311 bool
6312 type_cache_hasher::equal (type_hash *a, type_hash *b)
6314 /* First test the things that are the same for all types. */
6315 if (a->hash != b->hash
6316 || TREE_CODE (a->type) != TREE_CODE (b->type)
6317 || TREE_TYPE (a->type) != TREE_TYPE (b->type)
6318 || !attribute_list_equal (TYPE_ATTRIBUTES (a->type),
6319 TYPE_ATTRIBUTES (b->type))
6320 || (TREE_CODE (a->type) != COMPLEX_TYPE
6321 && TYPE_NAME (a->type) != TYPE_NAME (b->type)))
6322 return 0;
6324 /* Be careful about comparing arrays before and after the element type
6325 has been completed; don't compare TYPE_ALIGN unless both types are
6326 complete. */
6327 if (COMPLETE_TYPE_P (a->type) && COMPLETE_TYPE_P (b->type)
6328 && (TYPE_ALIGN (a->type) != TYPE_ALIGN (b->type)
6329 || TYPE_MODE (a->type) != TYPE_MODE (b->type)))
6330 return 0;
6332 switch (TREE_CODE (a->type))
6334 case VOID_TYPE:
6335 case COMPLEX_TYPE:
6336 case POINTER_TYPE:
6337 case REFERENCE_TYPE:
6338 case NULLPTR_TYPE:
6339 return 1;
6341 case VECTOR_TYPE:
6342 return TYPE_VECTOR_SUBPARTS (a->type) == TYPE_VECTOR_SUBPARTS (b->type);
6344 case ENUMERAL_TYPE:
6345 if (TYPE_VALUES (a->type) != TYPE_VALUES (b->type)
6346 && !(TYPE_VALUES (a->type)
6347 && TREE_CODE (TYPE_VALUES (a->type)) == TREE_LIST
6348 && TYPE_VALUES (b->type)
6349 && TREE_CODE (TYPE_VALUES (b->type)) == TREE_LIST
6350 && type_list_equal (TYPE_VALUES (a->type),
6351 TYPE_VALUES (b->type))))
6352 return 0;
6354 /* fall through */
6356 case INTEGER_TYPE:
6357 case REAL_TYPE:
6358 case BOOLEAN_TYPE:
6359 if (TYPE_PRECISION (a->type) != TYPE_PRECISION (b->type))
6360 return false;
6361 return ((TYPE_MAX_VALUE (a->type) == TYPE_MAX_VALUE (b->type)
6362 || tree_int_cst_equal (TYPE_MAX_VALUE (a->type),
6363 TYPE_MAX_VALUE (b->type)))
6364 && (TYPE_MIN_VALUE (a->type) == TYPE_MIN_VALUE (b->type)
6365 || tree_int_cst_equal (TYPE_MIN_VALUE (a->type),
6366 TYPE_MIN_VALUE (b->type))));
6368 case FIXED_POINT_TYPE:
6369 return TYPE_SATURATING (a->type) == TYPE_SATURATING (b->type);
6371 case OFFSET_TYPE:
6372 return TYPE_OFFSET_BASETYPE (a->type) == TYPE_OFFSET_BASETYPE (b->type);
6374 case METHOD_TYPE:
6375 if (TYPE_METHOD_BASETYPE (a->type) == TYPE_METHOD_BASETYPE (b->type)
6376 && (TYPE_ARG_TYPES (a->type) == TYPE_ARG_TYPES (b->type)
6377 || (TYPE_ARG_TYPES (a->type)
6378 && TREE_CODE (TYPE_ARG_TYPES (a->type)) == TREE_LIST
6379 && TYPE_ARG_TYPES (b->type)
6380 && TREE_CODE (TYPE_ARG_TYPES (b->type)) == TREE_LIST
6381 && type_list_equal (TYPE_ARG_TYPES (a->type),
6382 TYPE_ARG_TYPES (b->type)))))
6383 break;
6384 return 0;
6385 case ARRAY_TYPE:
6386 /* Don't compare TYPE_TYPELESS_STORAGE flag on aggregates,
6387 where the flag should be inherited from the element type
6388 and can change after ARRAY_TYPEs are created; on non-aggregates
6389 compare it and hash it, scalars will never have that flag set
6390 and we need to differentiate between arrays created by different
6391 front-ends or middle-end created arrays. */
6392 return (TYPE_DOMAIN (a->type) == TYPE_DOMAIN (b->type)
6393 && (AGGREGATE_TYPE_P (TREE_TYPE (a->type))
6394 || (TYPE_TYPELESS_STORAGE (a->type)
6395 == TYPE_TYPELESS_STORAGE (b->type))));
6397 case RECORD_TYPE:
6398 case UNION_TYPE:
6399 case QUAL_UNION_TYPE:
6400 return (TYPE_FIELDS (a->type) == TYPE_FIELDS (b->type)
6401 || (TYPE_FIELDS (a->type)
6402 && TREE_CODE (TYPE_FIELDS (a->type)) == TREE_LIST
6403 && TYPE_FIELDS (b->type)
6404 && TREE_CODE (TYPE_FIELDS (b->type)) == TREE_LIST
6405 && type_list_equal (TYPE_FIELDS (a->type),
6406 TYPE_FIELDS (b->type))));
6408 case FUNCTION_TYPE:
6409 if (TYPE_ARG_TYPES (a->type) == TYPE_ARG_TYPES (b->type)
6410 || (TYPE_ARG_TYPES (a->type)
6411 && TREE_CODE (TYPE_ARG_TYPES (a->type)) == TREE_LIST
6412 && TYPE_ARG_TYPES (b->type)
6413 && TREE_CODE (TYPE_ARG_TYPES (b->type)) == TREE_LIST
6414 && type_list_equal (TYPE_ARG_TYPES (a->type),
6415 TYPE_ARG_TYPES (b->type))))
6416 break;
6417 return 0;
6419 default:
6420 return 0;
6423 if (lang_hooks.types.type_hash_eq != NULL)
6424 return lang_hooks.types.type_hash_eq (a->type, b->type);
6426 return 1;
6429 /* Given TYPE, and HASHCODE its hash code, return the canonical
6430 object for an identical type if one already exists.
6431 Otherwise, return TYPE, and record it as the canonical object.
6433 To use this function, first create a type of the sort you want.
6434 Then compute its hash code from the fields of the type that
6435 make it different from other similar types.
6436 Then call this function and use the value. */
6438 tree
6439 type_hash_canon (unsigned int hashcode, tree type)
6441 type_hash in;
6442 type_hash **loc;
6444 /* The hash table only contains main variants, so ensure that's what we're
6445 being passed. */
6446 gcc_assert (TYPE_MAIN_VARIANT (type) == type);
6448 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
6449 must call that routine before comparing TYPE_ALIGNs. */
6450 layout_type (type);
6452 in.hash = hashcode;
6453 in.type = type;
6455 loc = type_hash_table->find_slot_with_hash (&in, hashcode, INSERT);
6456 if (*loc)
6458 tree t1 = ((type_hash *) *loc)->type;
6459 gcc_assert (TYPE_MAIN_VARIANT (t1) == t1);
6460 if (TYPE_UID (type) + 1 == next_type_uid)
6461 --next_type_uid;
6462 /* Free also min/max values and the cache for integer
6463 types. This can't be done in free_node, as LTO frees
6464 those on its own. */
6465 if (TREE_CODE (type) == INTEGER_TYPE)
6467 if (TYPE_MIN_VALUE (type)
6468 && TREE_TYPE (TYPE_MIN_VALUE (type)) == type)
6469 ggc_free (TYPE_MIN_VALUE (type));
6470 if (TYPE_MAX_VALUE (type)
6471 && TREE_TYPE (TYPE_MAX_VALUE (type)) == type)
6472 ggc_free (TYPE_MAX_VALUE (type));
6473 if (TYPE_CACHED_VALUES_P (type))
6474 ggc_free (TYPE_CACHED_VALUES (type));
6476 free_node (type);
6477 return t1;
6479 else
6481 struct type_hash *h;
6483 h = ggc_alloc<type_hash> ();
6484 h->hash = hashcode;
6485 h->type = type;
6486 *loc = h;
6488 return type;
6492 static void
6493 print_type_hash_statistics (void)
6495 fprintf (stderr, "Type hash: size %ld, %ld elements, %f collisions\n",
6496 (long) type_hash_table->size (),
6497 (long) type_hash_table->elements (),
6498 type_hash_table->collisions ());
6501 /* Given two lists of types
6502 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
6503 return 1 if the lists contain the same types in the same order.
6504 Also, the TREE_PURPOSEs must match. */
6507 type_list_equal (const_tree l1, const_tree l2)
6509 const_tree t1, t2;
6511 for (t1 = l1, t2 = l2; t1 && t2; t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2))
6512 if (TREE_VALUE (t1) != TREE_VALUE (t2)
6513 || (TREE_PURPOSE (t1) != TREE_PURPOSE (t2)
6514 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1), TREE_PURPOSE (t2))
6515 && (TREE_TYPE (TREE_PURPOSE (t1))
6516 == TREE_TYPE (TREE_PURPOSE (t2))))))
6517 return 0;
6519 return t1 == t2;
6522 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
6523 given by TYPE. If the argument list accepts variable arguments,
6524 then this function counts only the ordinary arguments. */
6527 type_num_arguments (const_tree type)
6529 int i = 0;
6530 tree t;
6532 for (t = TYPE_ARG_TYPES (type); t; t = TREE_CHAIN (t))
6533 /* If the function does not take a variable number of arguments,
6534 the last element in the list will have type `void'. */
6535 if (VOID_TYPE_P (TREE_VALUE (t)))
6536 break;
6537 else
6538 ++i;
6540 return i;
6543 /* Nonzero if integer constants T1 and T2
6544 represent the same constant value. */
6547 tree_int_cst_equal (const_tree t1, const_tree t2)
6549 if (t1 == t2)
6550 return 1;
6552 if (t1 == 0 || t2 == 0)
6553 return 0;
6555 if (TREE_CODE (t1) == INTEGER_CST
6556 && TREE_CODE (t2) == INTEGER_CST
6557 && wi::to_widest (t1) == wi::to_widest (t2))
6558 return 1;
6560 return 0;
6563 /* Return true if T is an INTEGER_CST whose numerical value (extended
6564 according to TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. */
6566 bool
6567 tree_fits_shwi_p (const_tree t)
6569 return (t != NULL_TREE
6570 && TREE_CODE (t) == INTEGER_CST
6571 && wi::fits_shwi_p (wi::to_widest (t)));
6574 /* Return true if T is an INTEGER_CST whose numerical value (extended
6575 according to TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. */
6577 bool
6578 tree_fits_uhwi_p (const_tree t)
6580 return (t != NULL_TREE
6581 && TREE_CODE (t) == INTEGER_CST
6582 && wi::fits_uhwi_p (wi::to_widest (t)));
6585 /* T is an INTEGER_CST whose numerical value (extended according to
6586 TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. Return that
6587 HOST_WIDE_INT. */
6589 HOST_WIDE_INT
6590 tree_to_shwi (const_tree t)
6592 gcc_assert (tree_fits_shwi_p (t));
6593 return TREE_INT_CST_LOW (t);
6596 /* T is an INTEGER_CST whose numerical value (extended according to
6597 TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. Return that
6598 HOST_WIDE_INT. */
6600 unsigned HOST_WIDE_INT
6601 tree_to_uhwi (const_tree t)
6603 gcc_assert (tree_fits_uhwi_p (t));
6604 return TREE_INT_CST_LOW (t);
6607 /* Return the most significant (sign) bit of T. */
6610 tree_int_cst_sign_bit (const_tree t)
6612 unsigned bitno = TYPE_PRECISION (TREE_TYPE (t)) - 1;
6614 return wi::extract_uhwi (t, bitno, 1);
6617 /* Return an indication of the sign of the integer constant T.
6618 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
6619 Note that -1 will never be returned if T's type is unsigned. */
6622 tree_int_cst_sgn (const_tree t)
6624 if (wi::eq_p (t, 0))
6625 return 0;
6626 else if (TYPE_UNSIGNED (TREE_TYPE (t)))
6627 return 1;
6628 else if (wi::neg_p (t))
6629 return -1;
6630 else
6631 return 1;
6634 /* Return the minimum number of bits needed to represent VALUE in a
6635 signed or unsigned type, UNSIGNEDP says which. */
6637 unsigned int
6638 tree_int_cst_min_precision (tree value, signop sgn)
6640 /* If the value is negative, compute its negative minus 1. The latter
6641 adjustment is because the absolute value of the largest negative value
6642 is one larger than the largest positive value. This is equivalent to
6643 a bit-wise negation, so use that operation instead. */
6645 if (tree_int_cst_sgn (value) < 0)
6646 value = fold_build1 (BIT_NOT_EXPR, TREE_TYPE (value), value);
6648 /* Return the number of bits needed, taking into account the fact
6649 that we need one more bit for a signed than unsigned type.
6650 If value is 0 or -1, the minimum precision is 1 no matter
6651 whether unsignedp is true or false. */
6653 if (integer_zerop (value))
6654 return 1;
6655 else
6656 return tree_floor_log2 (value) + 1 + (sgn == SIGNED ? 1 : 0) ;
6659 /* Return truthvalue of whether T1 is the same tree structure as T2.
6660 Return 1 if they are the same.
6661 Return 0 if they are understandably different.
6662 Return -1 if either contains tree structure not understood by
6663 this function. */
6666 simple_cst_equal (const_tree t1, const_tree t2)
6668 enum tree_code code1, code2;
6669 int cmp;
6670 int i;
6672 if (t1 == t2)
6673 return 1;
6674 if (t1 == 0 || t2 == 0)
6675 return 0;
6677 code1 = TREE_CODE (t1);
6678 code2 = TREE_CODE (t2);
6680 if (CONVERT_EXPR_CODE_P (code1) || code1 == NON_LVALUE_EXPR)
6682 if (CONVERT_EXPR_CODE_P (code2)
6683 || code2 == NON_LVALUE_EXPR)
6684 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6685 else
6686 return simple_cst_equal (TREE_OPERAND (t1, 0), t2);
6689 else if (CONVERT_EXPR_CODE_P (code2)
6690 || code2 == NON_LVALUE_EXPR)
6691 return simple_cst_equal (t1, TREE_OPERAND (t2, 0));
6693 if (code1 != code2)
6694 return 0;
6696 switch (code1)
6698 case INTEGER_CST:
6699 return wi::to_widest (t1) == wi::to_widest (t2);
6701 case REAL_CST:
6702 return real_identical (&TREE_REAL_CST (t1), &TREE_REAL_CST (t2));
6704 case FIXED_CST:
6705 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1), TREE_FIXED_CST (t2));
6707 case STRING_CST:
6708 return (TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2)
6709 && ! memcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2),
6710 TREE_STRING_LENGTH (t1)));
6712 case CONSTRUCTOR:
6714 unsigned HOST_WIDE_INT idx;
6715 vec<constructor_elt, va_gc> *v1 = CONSTRUCTOR_ELTS (t1);
6716 vec<constructor_elt, va_gc> *v2 = CONSTRUCTOR_ELTS (t2);
6718 if (vec_safe_length (v1) != vec_safe_length (v2))
6719 return false;
6721 for (idx = 0; idx < vec_safe_length (v1); ++idx)
6722 /* ??? Should we handle also fields here? */
6723 if (!simple_cst_equal ((*v1)[idx].value, (*v2)[idx].value))
6724 return false;
6725 return true;
6728 case SAVE_EXPR:
6729 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6731 case CALL_EXPR:
6732 cmp = simple_cst_equal (CALL_EXPR_FN (t1), CALL_EXPR_FN (t2));
6733 if (cmp <= 0)
6734 return cmp;
6735 if (call_expr_nargs (t1) != call_expr_nargs (t2))
6736 return 0;
6738 const_tree arg1, arg2;
6739 const_call_expr_arg_iterator iter1, iter2;
6740 for (arg1 = first_const_call_expr_arg (t1, &iter1),
6741 arg2 = first_const_call_expr_arg (t2, &iter2);
6742 arg1 && arg2;
6743 arg1 = next_const_call_expr_arg (&iter1),
6744 arg2 = next_const_call_expr_arg (&iter2))
6746 cmp = simple_cst_equal (arg1, arg2);
6747 if (cmp <= 0)
6748 return cmp;
6750 return arg1 == arg2;
6753 case TARGET_EXPR:
6754 /* Special case: if either target is an unallocated VAR_DECL,
6755 it means that it's going to be unified with whatever the
6756 TARGET_EXPR is really supposed to initialize, so treat it
6757 as being equivalent to anything. */
6758 if ((TREE_CODE (TREE_OPERAND (t1, 0)) == VAR_DECL
6759 && DECL_NAME (TREE_OPERAND (t1, 0)) == NULL_TREE
6760 && !DECL_RTL_SET_P (TREE_OPERAND (t1, 0)))
6761 || (TREE_CODE (TREE_OPERAND (t2, 0)) == VAR_DECL
6762 && DECL_NAME (TREE_OPERAND (t2, 0)) == NULL_TREE
6763 && !DECL_RTL_SET_P (TREE_OPERAND (t2, 0))))
6764 cmp = 1;
6765 else
6766 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6768 if (cmp <= 0)
6769 return cmp;
6771 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
6773 case WITH_CLEANUP_EXPR:
6774 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6775 if (cmp <= 0)
6776 return cmp;
6778 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t1, 1));
6780 case COMPONENT_REF:
6781 if (TREE_OPERAND (t1, 1) == TREE_OPERAND (t2, 1))
6782 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6784 return 0;
6786 case VAR_DECL:
6787 case PARM_DECL:
6788 case CONST_DECL:
6789 case FUNCTION_DECL:
6790 return 0;
6792 default:
6793 break;
6796 /* This general rule works for most tree codes. All exceptions should be
6797 handled above. If this is a language-specific tree code, we can't
6798 trust what might be in the operand, so say we don't know
6799 the situation. */
6800 if ((int) code1 >= (int) LAST_AND_UNUSED_TREE_CODE)
6801 return -1;
6803 switch (TREE_CODE_CLASS (code1))
6805 case tcc_unary:
6806 case tcc_binary:
6807 case tcc_comparison:
6808 case tcc_expression:
6809 case tcc_reference:
6810 case tcc_statement:
6811 cmp = 1;
6812 for (i = 0; i < TREE_CODE_LENGTH (code1); i++)
6814 cmp = simple_cst_equal (TREE_OPERAND (t1, i), TREE_OPERAND (t2, i));
6815 if (cmp <= 0)
6816 return cmp;
6819 return cmp;
6821 default:
6822 return -1;
6826 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
6827 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
6828 than U, respectively. */
6831 compare_tree_int (const_tree t, unsigned HOST_WIDE_INT u)
6833 if (tree_int_cst_sgn (t) < 0)
6834 return -1;
6835 else if (!tree_fits_uhwi_p (t))
6836 return 1;
6837 else if (TREE_INT_CST_LOW (t) == u)
6838 return 0;
6839 else if (TREE_INT_CST_LOW (t) < u)
6840 return -1;
6841 else
6842 return 1;
6845 /* Return true if SIZE represents a constant size that is in bounds of
6846 what the middle-end and the backend accepts (covering not more than
6847 half of the address-space). */
6849 bool
6850 valid_constant_size_p (const_tree size)
6852 if (! tree_fits_uhwi_p (size)
6853 || TREE_OVERFLOW (size)
6854 || tree_int_cst_sign_bit (size) != 0)
6855 return false;
6856 return true;
6859 /* Return the precision of the type, or for a complex or vector type the
6860 precision of the type of its elements. */
6862 unsigned int
6863 element_precision (const_tree type)
6865 if (!TYPE_P (type))
6866 type = TREE_TYPE (type);
6867 enum tree_code code = TREE_CODE (type);
6868 if (code == COMPLEX_TYPE || code == VECTOR_TYPE)
6869 type = TREE_TYPE (type);
6871 return TYPE_PRECISION (type);
6874 /* Return true if CODE represents an associative tree code. Otherwise
6875 return false. */
6876 bool
6877 associative_tree_code (enum tree_code code)
6879 switch (code)
6881 case BIT_IOR_EXPR:
6882 case BIT_AND_EXPR:
6883 case BIT_XOR_EXPR:
6884 case PLUS_EXPR:
6885 case MULT_EXPR:
6886 case MIN_EXPR:
6887 case MAX_EXPR:
6888 return true;
6890 default:
6891 break;
6893 return false;
6896 /* Return true if CODE represents a commutative tree code. Otherwise
6897 return false. */
6898 bool
6899 commutative_tree_code (enum tree_code code)
6901 switch (code)
6903 case PLUS_EXPR:
6904 case MULT_EXPR:
6905 case MULT_HIGHPART_EXPR:
6906 case MIN_EXPR:
6907 case MAX_EXPR:
6908 case BIT_IOR_EXPR:
6909 case BIT_XOR_EXPR:
6910 case BIT_AND_EXPR:
6911 case NE_EXPR:
6912 case EQ_EXPR:
6913 case UNORDERED_EXPR:
6914 case ORDERED_EXPR:
6915 case UNEQ_EXPR:
6916 case LTGT_EXPR:
6917 case TRUTH_AND_EXPR:
6918 case TRUTH_XOR_EXPR:
6919 case TRUTH_OR_EXPR:
6920 case WIDEN_MULT_EXPR:
6921 case VEC_WIDEN_MULT_HI_EXPR:
6922 case VEC_WIDEN_MULT_LO_EXPR:
6923 case VEC_WIDEN_MULT_EVEN_EXPR:
6924 case VEC_WIDEN_MULT_ODD_EXPR:
6925 return true;
6927 default:
6928 break;
6930 return false;
6933 /* Return true if CODE represents a ternary tree code for which the
6934 first two operands are commutative. Otherwise return false. */
6935 bool
6936 commutative_ternary_tree_code (enum tree_code code)
6938 switch (code)
6940 case WIDEN_MULT_PLUS_EXPR:
6941 case WIDEN_MULT_MINUS_EXPR:
6942 case DOT_PROD_EXPR:
6943 case FMA_EXPR:
6944 return true;
6946 default:
6947 break;
6949 return false;
6952 /* Returns true if CODE can overflow. */
6954 bool
6955 operation_can_overflow (enum tree_code code)
6957 switch (code)
6959 case PLUS_EXPR:
6960 case MINUS_EXPR:
6961 case MULT_EXPR:
6962 case LSHIFT_EXPR:
6963 /* Can overflow in various ways. */
6964 return true;
6965 case TRUNC_DIV_EXPR:
6966 case EXACT_DIV_EXPR:
6967 case FLOOR_DIV_EXPR:
6968 case CEIL_DIV_EXPR:
6969 /* For INT_MIN / -1. */
6970 return true;
6971 case NEGATE_EXPR:
6972 case ABS_EXPR:
6973 /* For -INT_MIN. */
6974 return true;
6975 default:
6976 /* These operators cannot overflow. */
6977 return false;
6981 /* Returns true if CODE operating on operands of type TYPE doesn't overflow, or
6982 ftrapv doesn't generate trapping insns for CODE. */
6984 bool
6985 operation_no_trapping_overflow (tree type, enum tree_code code)
6987 gcc_checking_assert (ANY_INTEGRAL_TYPE_P (type));
6989 /* We don't generate instructions that trap on overflow for complex or vector
6990 types. */
6991 if (!INTEGRAL_TYPE_P (type))
6992 return true;
6994 if (!TYPE_OVERFLOW_TRAPS (type))
6995 return true;
6997 switch (code)
6999 case PLUS_EXPR:
7000 case MINUS_EXPR:
7001 case MULT_EXPR:
7002 case NEGATE_EXPR:
7003 case ABS_EXPR:
7004 /* These operators can overflow, and -ftrapv generates trapping code for
7005 these. */
7006 return false;
7007 case TRUNC_DIV_EXPR:
7008 case EXACT_DIV_EXPR:
7009 case FLOOR_DIV_EXPR:
7010 case CEIL_DIV_EXPR:
7011 case LSHIFT_EXPR:
7012 /* These operators can overflow, but -ftrapv does not generate trapping
7013 code for these. */
7014 return true;
7015 default:
7016 /* These operators cannot overflow. */
7017 return true;
7021 namespace inchash
7024 /* Generate a hash value for an expression. This can be used iteratively
7025 by passing a previous result as the HSTATE argument.
7027 This function is intended to produce the same hash for expressions which
7028 would compare equal using operand_equal_p. */
7029 void
7030 add_expr (const_tree t, inchash::hash &hstate, unsigned int flags)
7032 int i;
7033 enum tree_code code;
7034 enum tree_code_class tclass;
7036 if (t == NULL_TREE || t == error_mark_node)
7038 hstate.merge_hash (0);
7039 return;
7042 if (!(flags & OEP_ADDRESS_OF))
7043 STRIP_NOPS (t);
7045 code = TREE_CODE (t);
7047 switch (code)
7049 /* Alas, constants aren't shared, so we can't rely on pointer
7050 identity. */
7051 case VOID_CST:
7052 hstate.merge_hash (0);
7053 return;
7054 case INTEGER_CST:
7055 gcc_checking_assert (!(flags & OEP_ADDRESS_OF));
7056 for (i = 0; i < TREE_INT_CST_EXT_NUNITS (t); i++)
7057 hstate.add_wide_int (TREE_INT_CST_ELT (t, i));
7058 return;
7059 case REAL_CST:
7061 unsigned int val2;
7062 if (!HONOR_SIGNED_ZEROS (t) && real_zerop (t))
7063 val2 = rvc_zero;
7064 else
7065 val2 = real_hash (TREE_REAL_CST_PTR (t));
7066 hstate.merge_hash (val2);
7067 return;
7069 case FIXED_CST:
7071 unsigned int val2 = fixed_hash (TREE_FIXED_CST_PTR (t));
7072 hstate.merge_hash (val2);
7073 return;
7075 case STRING_CST:
7076 hstate.add ((const void *) TREE_STRING_POINTER (t),
7077 TREE_STRING_LENGTH (t));
7078 return;
7079 case COMPLEX_CST:
7080 inchash::add_expr (TREE_REALPART (t), hstate, flags);
7081 inchash::add_expr (TREE_IMAGPART (t), hstate, flags);
7082 return;
7083 case VECTOR_CST:
7085 unsigned i;
7086 for (i = 0; i < VECTOR_CST_NELTS (t); ++i)
7087 inchash::add_expr (VECTOR_CST_ELT (t, i), hstate, flags);
7088 return;
7090 case SSA_NAME:
7091 /* We can just compare by pointer. */
7092 hstate.add_wide_int (SSA_NAME_VERSION (t));
7093 return;
7094 case PLACEHOLDER_EXPR:
7095 /* The node itself doesn't matter. */
7096 return;
7097 case BLOCK:
7098 case OMP_CLAUSE:
7099 /* Ignore. */
7100 return;
7101 case TREE_LIST:
7102 /* A list of expressions, for a CALL_EXPR or as the elements of a
7103 VECTOR_CST. */
7104 for (; t; t = TREE_CHAIN (t))
7105 inchash::add_expr (TREE_VALUE (t), hstate, flags);
7106 return;
7107 case CONSTRUCTOR:
7109 unsigned HOST_WIDE_INT idx;
7110 tree field, value;
7111 flags &= ~OEP_ADDRESS_OF;
7112 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t), idx, field, value)
7114 inchash::add_expr (field, hstate, flags);
7115 inchash::add_expr (value, hstate, flags);
7117 return;
7119 case STATEMENT_LIST:
7121 tree_stmt_iterator i;
7122 for (i = tsi_start (CONST_CAST_TREE (t));
7123 !tsi_end_p (i); tsi_next (&i))
7124 inchash::add_expr (tsi_stmt (i), hstate, flags);
7125 return;
7127 case TREE_VEC:
7128 for (i = 0; i < TREE_VEC_LENGTH (t); ++i)
7129 inchash::add_expr (TREE_VEC_ELT (t, i), hstate, flags);
7130 return;
7131 case FUNCTION_DECL:
7132 /* When referring to a built-in FUNCTION_DECL, use the __builtin__ form.
7133 Otherwise nodes that compare equal according to operand_equal_p might
7134 get different hash codes. However, don't do this for machine specific
7135 or front end builtins, since the function code is overloaded in those
7136 cases. */
7137 if (DECL_BUILT_IN_CLASS (t) == BUILT_IN_NORMAL
7138 && builtin_decl_explicit_p (DECL_FUNCTION_CODE (t)))
7140 t = builtin_decl_explicit (DECL_FUNCTION_CODE (t));
7141 code = TREE_CODE (t);
7143 /* FALL THROUGH */
7144 default:
7145 tclass = TREE_CODE_CLASS (code);
7147 if (tclass == tcc_declaration)
7149 /* DECL's have a unique ID */
7150 hstate.add_wide_int (DECL_UID (t));
7152 else if (tclass == tcc_comparison && !commutative_tree_code (code))
7154 /* For comparisons that can be swapped, use the lower
7155 tree code. */
7156 enum tree_code ccode = swap_tree_comparison (code);
7157 if (code < ccode)
7158 ccode = code;
7159 hstate.add_object (ccode);
7160 inchash::add_expr (TREE_OPERAND (t, ccode != code), hstate, flags);
7161 inchash::add_expr (TREE_OPERAND (t, ccode == code), hstate, flags);
7163 else if (CONVERT_EXPR_CODE_P (code))
7165 /* NOP_EXPR and CONVERT_EXPR are considered equal by
7166 operand_equal_p. */
7167 enum tree_code ccode = NOP_EXPR;
7168 hstate.add_object (ccode);
7170 /* Don't hash the type, that can lead to having nodes which
7171 compare equal according to operand_equal_p, but which
7172 have different hash codes. Make sure to include signedness
7173 in the hash computation. */
7174 hstate.add_int (TYPE_UNSIGNED (TREE_TYPE (t)));
7175 inchash::add_expr (TREE_OPERAND (t, 0), hstate, flags);
7177 /* For OEP_ADDRESS_OF, hash MEM_EXPR[&decl, 0] the same as decl. */
7178 else if (code == MEM_REF
7179 && (flags & OEP_ADDRESS_OF) != 0
7180 && TREE_CODE (TREE_OPERAND (t, 0)) == ADDR_EXPR
7181 && DECL_P (TREE_OPERAND (TREE_OPERAND (t, 0), 0))
7182 && integer_zerop (TREE_OPERAND (t, 1)))
7183 inchash::add_expr (TREE_OPERAND (TREE_OPERAND (t, 0), 0),
7184 hstate, flags);
7185 /* Don't ICE on FE specific trees, or their arguments etc.
7186 during operand_equal_p hash verification. */
7187 else if (!IS_EXPR_CODE_CLASS (tclass))
7188 gcc_assert (flags & OEP_HASH_CHECK);
7189 else
7191 unsigned int sflags = flags;
7193 hstate.add_object (code);
7195 switch (code)
7197 case ADDR_EXPR:
7198 gcc_checking_assert (!(flags & OEP_ADDRESS_OF));
7199 flags |= OEP_ADDRESS_OF;
7200 sflags = flags;
7201 break;
7203 case INDIRECT_REF:
7204 case MEM_REF:
7205 case TARGET_MEM_REF:
7206 flags &= ~OEP_ADDRESS_OF;
7207 sflags = flags;
7208 break;
7210 case ARRAY_REF:
7211 case ARRAY_RANGE_REF:
7212 case COMPONENT_REF:
7213 case BIT_FIELD_REF:
7214 sflags &= ~OEP_ADDRESS_OF;
7215 break;
7217 case COND_EXPR:
7218 flags &= ~OEP_ADDRESS_OF;
7219 break;
7221 case FMA_EXPR:
7222 case WIDEN_MULT_PLUS_EXPR:
7223 case WIDEN_MULT_MINUS_EXPR:
7225 /* The multiplication operands are commutative. */
7226 inchash::hash one, two;
7227 inchash::add_expr (TREE_OPERAND (t, 0), one, flags);
7228 inchash::add_expr (TREE_OPERAND (t, 1), two, flags);
7229 hstate.add_commutative (one, two);
7230 inchash::add_expr (TREE_OPERAND (t, 2), two, flags);
7231 return;
7234 case CALL_EXPR:
7235 if (CALL_EXPR_FN (t) == NULL_TREE)
7236 hstate.add_int (CALL_EXPR_IFN (t));
7237 break;
7239 case TARGET_EXPR:
7240 /* For TARGET_EXPR, just hash on the TARGET_EXPR_SLOT.
7241 Usually different TARGET_EXPRs just should use
7242 different temporaries in their slots. */
7243 inchash::add_expr (TARGET_EXPR_SLOT (t), hstate, flags);
7244 return;
7246 default:
7247 break;
7250 /* Don't hash the type, that can lead to having nodes which
7251 compare equal according to operand_equal_p, but which
7252 have different hash codes. */
7253 if (code == NON_LVALUE_EXPR)
7255 /* Make sure to include signness in the hash computation. */
7256 hstate.add_int (TYPE_UNSIGNED (TREE_TYPE (t)));
7257 inchash::add_expr (TREE_OPERAND (t, 0), hstate, flags);
7260 else if (commutative_tree_code (code))
7262 /* It's a commutative expression. We want to hash it the same
7263 however it appears. We do this by first hashing both operands
7264 and then rehashing based on the order of their independent
7265 hashes. */
7266 inchash::hash one, two;
7267 inchash::add_expr (TREE_OPERAND (t, 0), one, flags);
7268 inchash::add_expr (TREE_OPERAND (t, 1), two, flags);
7269 hstate.add_commutative (one, two);
7271 else
7272 for (i = TREE_OPERAND_LENGTH (t) - 1; i >= 0; --i)
7273 inchash::add_expr (TREE_OPERAND (t, i), hstate,
7274 i == 0 ? flags : sflags);
7276 return;
7282 /* Constructors for pointer, array and function types.
7283 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
7284 constructed by language-dependent code, not here.) */
7286 /* Construct, lay out and return the type of pointers to TO_TYPE with
7287 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
7288 reference all of memory. If such a type has already been
7289 constructed, reuse it. */
7291 tree
7292 build_pointer_type_for_mode (tree to_type, machine_mode mode,
7293 bool can_alias_all)
7295 tree t;
7296 bool could_alias = can_alias_all;
7298 if (to_type == error_mark_node)
7299 return error_mark_node;
7301 /* If the pointed-to type has the may_alias attribute set, force
7302 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7303 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type)))
7304 can_alias_all = true;
7306 /* In some cases, languages will have things that aren't a POINTER_TYPE
7307 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
7308 In that case, return that type without regard to the rest of our
7309 operands.
7311 ??? This is a kludge, but consistent with the way this function has
7312 always operated and there doesn't seem to be a good way to avoid this
7313 at the moment. */
7314 if (TYPE_POINTER_TO (to_type) != 0
7315 && TREE_CODE (TYPE_POINTER_TO (to_type)) != POINTER_TYPE)
7316 return TYPE_POINTER_TO (to_type);
7318 /* First, if we already have a type for pointers to TO_TYPE and it's
7319 the proper mode, use it. */
7320 for (t = TYPE_POINTER_TO (to_type); t; t = TYPE_NEXT_PTR_TO (t))
7321 if (TYPE_MODE (t) == mode && TYPE_REF_CAN_ALIAS_ALL (t) == can_alias_all)
7322 return t;
7324 t = make_node (POINTER_TYPE);
7326 TREE_TYPE (t) = to_type;
7327 SET_TYPE_MODE (t, mode);
7328 TYPE_REF_CAN_ALIAS_ALL (t) = can_alias_all;
7329 TYPE_NEXT_PTR_TO (t) = TYPE_POINTER_TO (to_type);
7330 TYPE_POINTER_TO (to_type) = t;
7332 /* During LTO we do not set TYPE_CANONICAL of pointers and references. */
7333 if (TYPE_STRUCTURAL_EQUALITY_P (to_type) || in_lto_p)
7334 SET_TYPE_STRUCTURAL_EQUALITY (t);
7335 else if (TYPE_CANONICAL (to_type) != to_type || could_alias)
7336 TYPE_CANONICAL (t)
7337 = build_pointer_type_for_mode (TYPE_CANONICAL (to_type),
7338 mode, false);
7340 /* Lay out the type. This function has many callers that are concerned
7341 with expression-construction, and this simplifies them all. */
7342 layout_type (t);
7344 return t;
7347 /* By default build pointers in ptr_mode. */
7349 tree
7350 build_pointer_type (tree to_type)
7352 addr_space_t as = to_type == error_mark_node? ADDR_SPACE_GENERIC
7353 : TYPE_ADDR_SPACE (to_type);
7354 machine_mode pointer_mode = targetm.addr_space.pointer_mode (as);
7355 return build_pointer_type_for_mode (to_type, pointer_mode, false);
7358 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
7360 tree
7361 build_reference_type_for_mode (tree to_type, machine_mode mode,
7362 bool can_alias_all)
7364 tree t;
7365 bool could_alias = can_alias_all;
7367 if (to_type == error_mark_node)
7368 return error_mark_node;
7370 /* If the pointed-to type has the may_alias attribute set, force
7371 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7372 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type)))
7373 can_alias_all = true;
7375 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
7376 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
7377 In that case, return that type without regard to the rest of our
7378 operands.
7380 ??? This is a kludge, but consistent with the way this function has
7381 always operated and there doesn't seem to be a good way to avoid this
7382 at the moment. */
7383 if (TYPE_REFERENCE_TO (to_type) != 0
7384 && TREE_CODE (TYPE_REFERENCE_TO (to_type)) != REFERENCE_TYPE)
7385 return TYPE_REFERENCE_TO (to_type);
7387 /* First, if we already have a type for pointers to TO_TYPE and it's
7388 the proper mode, use it. */
7389 for (t = TYPE_REFERENCE_TO (to_type); t; t = TYPE_NEXT_REF_TO (t))
7390 if (TYPE_MODE (t) == mode && TYPE_REF_CAN_ALIAS_ALL (t) == can_alias_all)
7391 return t;
7393 t = make_node (REFERENCE_TYPE);
7395 TREE_TYPE (t) = to_type;
7396 SET_TYPE_MODE (t, mode);
7397 TYPE_REF_CAN_ALIAS_ALL (t) = can_alias_all;
7398 TYPE_NEXT_REF_TO (t) = TYPE_REFERENCE_TO (to_type);
7399 TYPE_REFERENCE_TO (to_type) = t;
7401 /* During LTO we do not set TYPE_CANONICAL of pointers and references. */
7402 if (TYPE_STRUCTURAL_EQUALITY_P (to_type) || in_lto_p)
7403 SET_TYPE_STRUCTURAL_EQUALITY (t);
7404 else if (TYPE_CANONICAL (to_type) != to_type || could_alias)
7405 TYPE_CANONICAL (t)
7406 = build_reference_type_for_mode (TYPE_CANONICAL (to_type),
7407 mode, false);
7409 layout_type (t);
7411 return t;
7415 /* Build the node for the type of references-to-TO_TYPE by default
7416 in ptr_mode. */
7418 tree
7419 build_reference_type (tree to_type)
7421 addr_space_t as = to_type == error_mark_node? ADDR_SPACE_GENERIC
7422 : TYPE_ADDR_SPACE (to_type);
7423 machine_mode pointer_mode = targetm.addr_space.pointer_mode (as);
7424 return build_reference_type_for_mode (to_type, pointer_mode, false);
7427 #define MAX_INT_CACHED_PREC \
7428 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
7429 static GTY(()) tree nonstandard_integer_type_cache[2 * MAX_INT_CACHED_PREC + 2];
7431 /* Builds a signed or unsigned integer type of precision PRECISION.
7432 Used for C bitfields whose precision does not match that of
7433 built-in target types. */
7434 tree
7435 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision,
7436 int unsignedp)
7438 tree itype, ret;
7440 if (unsignedp)
7441 unsignedp = MAX_INT_CACHED_PREC + 1;
7443 if (precision <= MAX_INT_CACHED_PREC)
7445 itype = nonstandard_integer_type_cache[precision + unsignedp];
7446 if (itype)
7447 return itype;
7450 itype = make_node (INTEGER_TYPE);
7451 TYPE_PRECISION (itype) = precision;
7453 if (unsignedp)
7454 fixup_unsigned_type (itype);
7455 else
7456 fixup_signed_type (itype);
7458 ret = itype;
7459 if (tree_fits_uhwi_p (TYPE_MAX_VALUE (itype)))
7460 ret = type_hash_canon (tree_to_uhwi (TYPE_MAX_VALUE (itype)), itype);
7461 if (precision <= MAX_INT_CACHED_PREC)
7462 nonstandard_integer_type_cache[precision + unsignedp] = ret;
7464 return ret;
7467 #define MAX_BOOL_CACHED_PREC \
7468 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
7469 static GTY(()) tree nonstandard_boolean_type_cache[MAX_BOOL_CACHED_PREC + 1];
7471 /* Builds a boolean type of precision PRECISION.
7472 Used for boolean vectors to choose proper vector element size. */
7473 tree
7474 build_nonstandard_boolean_type (unsigned HOST_WIDE_INT precision)
7476 tree type;
7478 if (precision <= MAX_BOOL_CACHED_PREC)
7480 type = nonstandard_boolean_type_cache[precision];
7481 if (type)
7482 return type;
7485 type = make_node (BOOLEAN_TYPE);
7486 TYPE_PRECISION (type) = precision;
7487 fixup_signed_type (type);
7489 if (precision <= MAX_INT_CACHED_PREC)
7490 nonstandard_boolean_type_cache[precision] = type;
7492 return type;
7495 /* Create a range of some discrete type TYPE (an INTEGER_TYPE, ENUMERAL_TYPE
7496 or BOOLEAN_TYPE) with low bound LOWVAL and high bound HIGHVAL. If SHARED
7497 is true, reuse such a type that has already been constructed. */
7499 static tree
7500 build_range_type_1 (tree type, tree lowval, tree highval, bool shared)
7502 tree itype = make_node (INTEGER_TYPE);
7504 TREE_TYPE (itype) = type;
7506 TYPE_MIN_VALUE (itype) = fold_convert (type, lowval);
7507 TYPE_MAX_VALUE (itype) = highval ? fold_convert (type, highval) : NULL;
7509 TYPE_PRECISION (itype) = TYPE_PRECISION (type);
7510 SET_TYPE_MODE (itype, TYPE_MODE (type));
7511 TYPE_SIZE (itype) = TYPE_SIZE (type);
7512 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (type);
7513 SET_TYPE_ALIGN (itype, TYPE_ALIGN (type));
7514 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (type);
7515 SET_TYPE_WARN_IF_NOT_ALIGN (itype, TYPE_WARN_IF_NOT_ALIGN (type));
7517 if (!shared)
7518 return itype;
7520 if ((TYPE_MIN_VALUE (itype)
7521 && TREE_CODE (TYPE_MIN_VALUE (itype)) != INTEGER_CST)
7522 || (TYPE_MAX_VALUE (itype)
7523 && TREE_CODE (TYPE_MAX_VALUE (itype)) != INTEGER_CST))
7525 /* Since we cannot reliably merge this type, we need to compare it using
7526 structural equality checks. */
7527 SET_TYPE_STRUCTURAL_EQUALITY (itype);
7528 return itype;
7531 hashval_t hash = type_hash_canon_hash (itype);
7532 itype = type_hash_canon (hash, itype);
7534 return itype;
7537 /* Wrapper around build_range_type_1 with SHARED set to true. */
7539 tree
7540 build_range_type (tree type, tree lowval, tree highval)
7542 return build_range_type_1 (type, lowval, highval, true);
7545 /* Wrapper around build_range_type_1 with SHARED set to false. */
7547 tree
7548 build_nonshared_range_type (tree type, tree lowval, tree highval)
7550 return build_range_type_1 (type, lowval, highval, false);
7553 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
7554 MAXVAL should be the maximum value in the domain
7555 (one less than the length of the array).
7557 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
7558 We don't enforce this limit, that is up to caller (e.g. language front end).
7559 The limit exists because the result is a signed type and we don't handle
7560 sizes that use more than one HOST_WIDE_INT. */
7562 tree
7563 build_index_type (tree maxval)
7565 return build_range_type (sizetype, size_zero_node, maxval);
7568 /* Return true if the debug information for TYPE, a subtype, should be emitted
7569 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
7570 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
7571 debug info and doesn't reflect the source code. */
7573 bool
7574 subrange_type_for_debug_p (const_tree type, tree *lowval, tree *highval)
7576 tree base_type = TREE_TYPE (type), low, high;
7578 /* Subrange types have a base type which is an integral type. */
7579 if (!INTEGRAL_TYPE_P (base_type))
7580 return false;
7582 /* Get the real bounds of the subtype. */
7583 if (lang_hooks.types.get_subrange_bounds)
7584 lang_hooks.types.get_subrange_bounds (type, &low, &high);
7585 else
7587 low = TYPE_MIN_VALUE (type);
7588 high = TYPE_MAX_VALUE (type);
7591 /* If the type and its base type have the same representation and the same
7592 name, then the type is not a subrange but a copy of the base type. */
7593 if ((TREE_CODE (base_type) == INTEGER_TYPE
7594 || TREE_CODE (base_type) == BOOLEAN_TYPE)
7595 && int_size_in_bytes (type) == int_size_in_bytes (base_type)
7596 && tree_int_cst_equal (low, TYPE_MIN_VALUE (base_type))
7597 && tree_int_cst_equal (high, TYPE_MAX_VALUE (base_type))
7598 && TYPE_IDENTIFIER (type) == TYPE_IDENTIFIER (base_type))
7599 return false;
7601 if (lowval)
7602 *lowval = low;
7603 if (highval)
7604 *highval = high;
7605 return true;
7608 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
7609 and number of elements specified by the range of values of INDEX_TYPE.
7610 If TYPELESS_STORAGE is true, TYPE_TYPELESS_STORAGE flag is set on the type.
7611 If SHARED is true, reuse such a type that has already been constructed. */
7613 static tree
7614 build_array_type_1 (tree elt_type, tree index_type, bool typeless_storage,
7615 bool shared)
7617 tree t;
7619 if (TREE_CODE (elt_type) == FUNCTION_TYPE)
7621 error ("arrays of functions are not meaningful");
7622 elt_type = integer_type_node;
7625 t = make_node (ARRAY_TYPE);
7626 TREE_TYPE (t) = elt_type;
7627 TYPE_DOMAIN (t) = index_type;
7628 TYPE_ADDR_SPACE (t) = TYPE_ADDR_SPACE (elt_type);
7629 TYPE_TYPELESS_STORAGE (t) = typeless_storage;
7630 layout_type (t);
7632 /* If the element type is incomplete at this point we get marked for
7633 structural equality. Do not record these types in the canonical
7634 type hashtable. */
7635 if (TYPE_STRUCTURAL_EQUALITY_P (t))
7636 return t;
7638 if (shared)
7640 hashval_t hash = type_hash_canon_hash (t);
7641 t = type_hash_canon (hash, t);
7644 if (TYPE_CANONICAL (t) == t)
7646 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type)
7647 || (index_type && TYPE_STRUCTURAL_EQUALITY_P (index_type))
7648 || in_lto_p)
7649 SET_TYPE_STRUCTURAL_EQUALITY (t);
7650 else if (TYPE_CANONICAL (elt_type) != elt_type
7651 || (index_type && TYPE_CANONICAL (index_type) != index_type))
7652 TYPE_CANONICAL (t)
7653 = build_array_type_1 (TYPE_CANONICAL (elt_type),
7654 index_type
7655 ? TYPE_CANONICAL (index_type) : NULL_TREE,
7656 typeless_storage, shared);
7659 return t;
7662 /* Wrapper around build_array_type_1 with SHARED set to true. */
7664 tree
7665 build_array_type (tree elt_type, tree index_type, bool typeless_storage)
7667 return build_array_type_1 (elt_type, index_type, typeless_storage, true);
7670 /* Wrapper around build_array_type_1 with SHARED set to false. */
7672 tree
7673 build_nonshared_array_type (tree elt_type, tree index_type)
7675 return build_array_type_1 (elt_type, index_type, false, false);
7678 /* Return a representation of ELT_TYPE[NELTS], using indices of type
7679 sizetype. */
7681 tree
7682 build_array_type_nelts (tree elt_type, unsigned HOST_WIDE_INT nelts)
7684 return build_array_type (elt_type, build_index_type (size_int (nelts - 1)));
7687 /* Recursively examines the array elements of TYPE, until a non-array
7688 element type is found. */
7690 tree
7691 strip_array_types (tree type)
7693 while (TREE_CODE (type) == ARRAY_TYPE)
7694 type = TREE_TYPE (type);
7696 return type;
7699 /* Computes the canonical argument types from the argument type list
7700 ARGTYPES.
7702 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
7703 on entry to this function, or if any of the ARGTYPES are
7704 structural.
7706 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
7707 true on entry to this function, or if any of the ARGTYPES are
7708 non-canonical.
7710 Returns a canonical argument list, which may be ARGTYPES when the
7711 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
7712 true) or would not differ from ARGTYPES. */
7714 static tree
7715 maybe_canonicalize_argtypes (tree argtypes,
7716 bool *any_structural_p,
7717 bool *any_noncanonical_p)
7719 tree arg;
7720 bool any_noncanonical_argtypes_p = false;
7722 for (arg = argtypes; arg && !(*any_structural_p); arg = TREE_CHAIN (arg))
7724 if (!TREE_VALUE (arg) || TREE_VALUE (arg) == error_mark_node)
7725 /* Fail gracefully by stating that the type is structural. */
7726 *any_structural_p = true;
7727 else if (TYPE_STRUCTURAL_EQUALITY_P (TREE_VALUE (arg)))
7728 *any_structural_p = true;
7729 else if (TYPE_CANONICAL (TREE_VALUE (arg)) != TREE_VALUE (arg)
7730 || TREE_PURPOSE (arg))
7731 /* If the argument has a default argument, we consider it
7732 non-canonical even though the type itself is canonical.
7733 That way, different variants of function and method types
7734 with default arguments will all point to the variant with
7735 no defaults as their canonical type. */
7736 any_noncanonical_argtypes_p = true;
7739 if (*any_structural_p)
7740 return argtypes;
7742 if (any_noncanonical_argtypes_p)
7744 /* Build the canonical list of argument types. */
7745 tree canon_argtypes = NULL_TREE;
7746 bool is_void = false;
7748 for (arg = argtypes; arg; arg = TREE_CHAIN (arg))
7750 if (arg == void_list_node)
7751 is_void = true;
7752 else
7753 canon_argtypes = tree_cons (NULL_TREE,
7754 TYPE_CANONICAL (TREE_VALUE (arg)),
7755 canon_argtypes);
7758 canon_argtypes = nreverse (canon_argtypes);
7759 if (is_void)
7760 canon_argtypes = chainon (canon_argtypes, void_list_node);
7762 /* There is a non-canonical type. */
7763 *any_noncanonical_p = true;
7764 return canon_argtypes;
7767 /* The canonical argument types are the same as ARGTYPES. */
7768 return argtypes;
7771 /* Construct, lay out and return
7772 the type of functions returning type VALUE_TYPE
7773 given arguments of types ARG_TYPES.
7774 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
7775 are data type nodes for the arguments of the function.
7776 If such a type has already been constructed, reuse it. */
7778 tree
7779 build_function_type (tree value_type, tree arg_types)
7781 tree t;
7782 inchash::hash hstate;
7783 bool any_structural_p, any_noncanonical_p;
7784 tree canon_argtypes;
7786 if (TREE_CODE (value_type) == FUNCTION_TYPE)
7788 error ("function return type cannot be function");
7789 value_type = integer_type_node;
7792 /* Make a node of the sort we want. */
7793 t = make_node (FUNCTION_TYPE);
7794 TREE_TYPE (t) = value_type;
7795 TYPE_ARG_TYPES (t) = arg_types;
7797 /* If we already have such a type, use the old one. */
7798 hashval_t hash = type_hash_canon_hash (t);
7799 t = type_hash_canon (hash, t);
7801 /* Set up the canonical type. */
7802 any_structural_p = TYPE_STRUCTURAL_EQUALITY_P (value_type);
7803 any_noncanonical_p = TYPE_CANONICAL (value_type) != value_type;
7804 canon_argtypes = maybe_canonicalize_argtypes (arg_types,
7805 &any_structural_p,
7806 &any_noncanonical_p);
7807 if (any_structural_p)
7808 SET_TYPE_STRUCTURAL_EQUALITY (t);
7809 else if (any_noncanonical_p)
7810 TYPE_CANONICAL (t) = build_function_type (TYPE_CANONICAL (value_type),
7811 canon_argtypes);
7813 if (!COMPLETE_TYPE_P (t))
7814 layout_type (t);
7815 return t;
7818 /* Build a function type. The RETURN_TYPE is the type returned by the
7819 function. If VAARGS is set, no void_type_node is appended to the
7820 list. ARGP must be always be terminated be a NULL_TREE. */
7822 static tree
7823 build_function_type_list_1 (bool vaargs, tree return_type, va_list argp)
7825 tree t, args, last;
7827 t = va_arg (argp, tree);
7828 for (args = NULL_TREE; t != NULL_TREE; t = va_arg (argp, tree))
7829 args = tree_cons (NULL_TREE, t, args);
7831 if (vaargs)
7833 last = args;
7834 if (args != NULL_TREE)
7835 args = nreverse (args);
7836 gcc_assert (last != void_list_node);
7838 else if (args == NULL_TREE)
7839 args = void_list_node;
7840 else
7842 last = args;
7843 args = nreverse (args);
7844 TREE_CHAIN (last) = void_list_node;
7846 args = build_function_type (return_type, args);
7848 return args;
7851 /* Build a function type. The RETURN_TYPE is the type returned by the
7852 function. If additional arguments are provided, they are
7853 additional argument types. The list of argument types must always
7854 be terminated by NULL_TREE. */
7856 tree
7857 build_function_type_list (tree return_type, ...)
7859 tree args;
7860 va_list p;
7862 va_start (p, return_type);
7863 args = build_function_type_list_1 (false, return_type, p);
7864 va_end (p);
7865 return args;
7868 /* Build a variable argument function type. The RETURN_TYPE is the
7869 type returned by the function. If additional arguments are provided,
7870 they are additional argument types. The list of argument types must
7871 always be terminated by NULL_TREE. */
7873 tree
7874 build_varargs_function_type_list (tree return_type, ...)
7876 tree args;
7877 va_list p;
7879 va_start (p, return_type);
7880 args = build_function_type_list_1 (true, return_type, p);
7881 va_end (p);
7883 return args;
7886 /* Build a function type. RETURN_TYPE is the type returned by the
7887 function; VAARGS indicates whether the function takes varargs. The
7888 function takes N named arguments, the types of which are provided in
7889 ARG_TYPES. */
7891 static tree
7892 build_function_type_array_1 (bool vaargs, tree return_type, int n,
7893 tree *arg_types)
7895 int i;
7896 tree t = vaargs ? NULL_TREE : void_list_node;
7898 for (i = n - 1; i >= 0; i--)
7899 t = tree_cons (NULL_TREE, arg_types[i], t);
7901 return build_function_type (return_type, t);
7904 /* Build a function type. RETURN_TYPE is the type returned by the
7905 function. The function takes N named arguments, the types of which
7906 are provided in ARG_TYPES. */
7908 tree
7909 build_function_type_array (tree return_type, int n, tree *arg_types)
7911 return build_function_type_array_1 (false, return_type, n, arg_types);
7914 /* Build a variable argument function type. RETURN_TYPE is the type
7915 returned by the function. The function takes N named arguments, the
7916 types of which are provided in ARG_TYPES. */
7918 tree
7919 build_varargs_function_type_array (tree return_type, int n, tree *arg_types)
7921 return build_function_type_array_1 (true, return_type, n, arg_types);
7924 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
7925 and ARGTYPES (a TREE_LIST) are the return type and arguments types
7926 for the method. An implicit additional parameter (of type
7927 pointer-to-BASETYPE) is added to the ARGTYPES. */
7929 tree
7930 build_method_type_directly (tree basetype,
7931 tree rettype,
7932 tree argtypes)
7934 tree t;
7935 tree ptype;
7936 bool any_structural_p, any_noncanonical_p;
7937 tree canon_argtypes;
7939 /* Make a node of the sort we want. */
7940 t = make_node (METHOD_TYPE);
7942 TYPE_METHOD_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
7943 TREE_TYPE (t) = rettype;
7944 ptype = build_pointer_type (basetype);
7946 /* The actual arglist for this function includes a "hidden" argument
7947 which is "this". Put it into the list of argument types. */
7948 argtypes = tree_cons (NULL_TREE, ptype, argtypes);
7949 TYPE_ARG_TYPES (t) = argtypes;
7951 /* If we already have such a type, use the old one. */
7952 hashval_t hash = type_hash_canon_hash (t);
7953 t = type_hash_canon (hash, t);
7955 /* Set up the canonical type. */
7956 any_structural_p
7957 = (TYPE_STRUCTURAL_EQUALITY_P (basetype)
7958 || TYPE_STRUCTURAL_EQUALITY_P (rettype));
7959 any_noncanonical_p
7960 = (TYPE_CANONICAL (basetype) != basetype
7961 || TYPE_CANONICAL (rettype) != rettype);
7962 canon_argtypes = maybe_canonicalize_argtypes (TREE_CHAIN (argtypes),
7963 &any_structural_p,
7964 &any_noncanonical_p);
7965 if (any_structural_p)
7966 SET_TYPE_STRUCTURAL_EQUALITY (t);
7967 else if (any_noncanonical_p)
7968 TYPE_CANONICAL (t)
7969 = build_method_type_directly (TYPE_CANONICAL (basetype),
7970 TYPE_CANONICAL (rettype),
7971 canon_argtypes);
7972 if (!COMPLETE_TYPE_P (t))
7973 layout_type (t);
7975 return t;
7978 /* Construct, lay out and return the type of methods belonging to class
7979 BASETYPE and whose arguments and values are described by TYPE.
7980 If that type exists already, reuse it.
7981 TYPE must be a FUNCTION_TYPE node. */
7983 tree
7984 build_method_type (tree basetype, tree type)
7986 gcc_assert (TREE_CODE (type) == FUNCTION_TYPE);
7988 return build_method_type_directly (basetype,
7989 TREE_TYPE (type),
7990 TYPE_ARG_TYPES (type));
7993 /* Construct, lay out and return the type of offsets to a value
7994 of type TYPE, within an object of type BASETYPE.
7995 If a suitable offset type exists already, reuse it. */
7997 tree
7998 build_offset_type (tree basetype, tree type)
8000 tree t;
8002 /* Make a node of the sort we want. */
8003 t = make_node (OFFSET_TYPE);
8005 TYPE_OFFSET_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
8006 TREE_TYPE (t) = type;
8008 /* If we already have such a type, use the old one. */
8009 hashval_t hash = type_hash_canon_hash (t);
8010 t = type_hash_canon (hash, t);
8012 if (!COMPLETE_TYPE_P (t))
8013 layout_type (t);
8015 if (TYPE_CANONICAL (t) == t)
8017 if (TYPE_STRUCTURAL_EQUALITY_P (basetype)
8018 || TYPE_STRUCTURAL_EQUALITY_P (type))
8019 SET_TYPE_STRUCTURAL_EQUALITY (t);
8020 else if (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype)) != basetype
8021 || TYPE_CANONICAL (type) != type)
8022 TYPE_CANONICAL (t)
8023 = build_offset_type (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype)),
8024 TYPE_CANONICAL (type));
8027 return t;
8030 /* Create a complex type whose components are COMPONENT_TYPE.
8032 If NAMED is true, the type is given a TYPE_NAME. We do not always
8033 do so because this creates a DECL node and thus make the DECL_UIDs
8034 dependent on the type canonicalization hashtable, which is GC-ed,
8035 so the DECL_UIDs would not be stable wrt garbage collection. */
8037 tree
8038 build_complex_type (tree component_type, bool named)
8040 tree t;
8042 gcc_assert (INTEGRAL_TYPE_P (component_type)
8043 || SCALAR_FLOAT_TYPE_P (component_type)
8044 || FIXED_POINT_TYPE_P (component_type));
8046 /* Make a node of the sort we want. */
8047 t = make_node (COMPLEX_TYPE);
8049 TREE_TYPE (t) = TYPE_MAIN_VARIANT (component_type);
8051 /* If we already have such a type, use the old one. */
8052 hashval_t hash = type_hash_canon_hash (t);
8053 t = type_hash_canon (hash, t);
8055 if (!COMPLETE_TYPE_P (t))
8056 layout_type (t);
8058 if (TYPE_CANONICAL (t) == t)
8060 if (TYPE_STRUCTURAL_EQUALITY_P (component_type))
8061 SET_TYPE_STRUCTURAL_EQUALITY (t);
8062 else if (TYPE_CANONICAL (component_type) != component_type)
8063 TYPE_CANONICAL (t)
8064 = build_complex_type (TYPE_CANONICAL (component_type), named);
8067 /* We need to create a name, since complex is a fundamental type. */
8068 if (!TYPE_NAME (t) && named)
8070 const char *name;
8071 if (component_type == char_type_node)
8072 name = "complex char";
8073 else if (component_type == signed_char_type_node)
8074 name = "complex signed char";
8075 else if (component_type == unsigned_char_type_node)
8076 name = "complex unsigned char";
8077 else if (component_type == short_integer_type_node)
8078 name = "complex short int";
8079 else if (component_type == short_unsigned_type_node)
8080 name = "complex short unsigned int";
8081 else if (component_type == integer_type_node)
8082 name = "complex int";
8083 else if (component_type == unsigned_type_node)
8084 name = "complex unsigned int";
8085 else if (component_type == long_integer_type_node)
8086 name = "complex long int";
8087 else if (component_type == long_unsigned_type_node)
8088 name = "complex long unsigned int";
8089 else if (component_type == long_long_integer_type_node)
8090 name = "complex long long int";
8091 else if (component_type == long_long_unsigned_type_node)
8092 name = "complex long long unsigned int";
8093 else
8094 name = 0;
8096 if (name != 0)
8097 TYPE_NAME (t) = build_decl (UNKNOWN_LOCATION, TYPE_DECL,
8098 get_identifier (name), t);
8101 return build_qualified_type (t, TYPE_QUALS (component_type));
8104 /* If TYPE is a real or complex floating-point type and the target
8105 does not directly support arithmetic on TYPE then return the wider
8106 type to be used for arithmetic on TYPE. Otherwise, return
8107 NULL_TREE. */
8109 tree
8110 excess_precision_type (tree type)
8112 /* The target can give two different responses to the question of
8113 which excess precision mode it would like depending on whether we
8114 are in -fexcess-precision=standard or -fexcess-precision=fast. */
8116 enum excess_precision_type requested_type
8117 = (flag_excess_precision == EXCESS_PRECISION_FAST
8118 ? EXCESS_PRECISION_TYPE_FAST
8119 : EXCESS_PRECISION_TYPE_STANDARD);
8121 enum flt_eval_method target_flt_eval_method
8122 = targetm.c.excess_precision (requested_type);
8124 /* The target should not ask for unpredictable float evaluation (though
8125 it might advertise that implicitly the evaluation is unpredictable,
8126 but we don't care about that here, it will have been reported
8127 elsewhere). If it does ask for unpredictable evaluation, we have
8128 nothing to do here. */
8129 gcc_assert (target_flt_eval_method != FLT_EVAL_METHOD_UNPREDICTABLE);
8131 /* Nothing to do. The target has asked for all types we know about
8132 to be computed with their native precision and range. */
8133 if (target_flt_eval_method == FLT_EVAL_METHOD_PROMOTE_TO_FLOAT16)
8134 return NULL_TREE;
8136 /* The target will promote this type in a target-dependent way, so excess
8137 precision ought to leave it alone. */
8138 if (targetm.promoted_type (type) != NULL_TREE)
8139 return NULL_TREE;
8141 machine_mode float16_type_mode = (float16_type_node
8142 ? TYPE_MODE (float16_type_node)
8143 : VOIDmode);
8144 machine_mode float_type_mode = TYPE_MODE (float_type_node);
8145 machine_mode double_type_mode = TYPE_MODE (double_type_node);
8147 switch (TREE_CODE (type))
8149 case REAL_TYPE:
8151 machine_mode type_mode = TYPE_MODE (type);
8152 switch (target_flt_eval_method)
8154 case FLT_EVAL_METHOD_PROMOTE_TO_FLOAT:
8155 if (type_mode == float16_type_mode)
8156 return float_type_node;
8157 break;
8158 case FLT_EVAL_METHOD_PROMOTE_TO_DOUBLE:
8159 if (type_mode == float16_type_mode
8160 || type_mode == float_type_mode)
8161 return double_type_node;
8162 break;
8163 case FLT_EVAL_METHOD_PROMOTE_TO_LONG_DOUBLE:
8164 if (type_mode == float16_type_mode
8165 || type_mode == float_type_mode
8166 || type_mode == double_type_mode)
8167 return long_double_type_node;
8168 break;
8169 default:
8170 gcc_unreachable ();
8172 break;
8174 case COMPLEX_TYPE:
8176 if (TREE_CODE (TREE_TYPE (type)) != REAL_TYPE)
8177 return NULL_TREE;
8178 machine_mode type_mode = TYPE_MODE (TREE_TYPE (type));
8179 switch (target_flt_eval_method)
8181 case FLT_EVAL_METHOD_PROMOTE_TO_FLOAT:
8182 if (type_mode == float16_type_mode)
8183 return complex_float_type_node;
8184 break;
8185 case FLT_EVAL_METHOD_PROMOTE_TO_DOUBLE:
8186 if (type_mode == float16_type_mode
8187 || type_mode == float_type_mode)
8188 return complex_double_type_node;
8189 break;
8190 case FLT_EVAL_METHOD_PROMOTE_TO_LONG_DOUBLE:
8191 if (type_mode == float16_type_mode
8192 || type_mode == float_type_mode
8193 || type_mode == double_type_mode)
8194 return complex_long_double_type_node;
8195 break;
8196 default:
8197 gcc_unreachable ();
8199 break;
8201 default:
8202 break;
8205 return NULL_TREE;
8208 /* Return OP, stripped of any conversions to wider types as much as is safe.
8209 Converting the value back to OP's type makes a value equivalent to OP.
8211 If FOR_TYPE is nonzero, we return a value which, if converted to
8212 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
8214 OP must have integer, real or enumeral type. Pointers are not allowed!
8216 There are some cases where the obvious value we could return
8217 would regenerate to OP if converted to OP's type,
8218 but would not extend like OP to wider types.
8219 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
8220 For example, if OP is (unsigned short)(signed char)-1,
8221 we avoid returning (signed char)-1 if FOR_TYPE is int,
8222 even though extending that to an unsigned short would regenerate OP,
8223 since the result of extending (signed char)-1 to (int)
8224 is different from (int) OP. */
8226 tree
8227 get_unwidened (tree op, tree for_type)
8229 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
8230 tree type = TREE_TYPE (op);
8231 unsigned final_prec
8232 = TYPE_PRECISION (for_type != 0 ? for_type : type);
8233 int uns
8234 = (for_type != 0 && for_type != type
8235 && final_prec > TYPE_PRECISION (type)
8236 && TYPE_UNSIGNED (type));
8237 tree win = op;
8239 while (CONVERT_EXPR_P (op))
8241 int bitschange;
8243 /* TYPE_PRECISION on vector types has different meaning
8244 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
8245 so avoid them here. */
8246 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op, 0))) == VECTOR_TYPE)
8247 break;
8249 bitschange = TYPE_PRECISION (TREE_TYPE (op))
8250 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0)));
8252 /* Truncations are many-one so cannot be removed.
8253 Unless we are later going to truncate down even farther. */
8254 if (bitschange < 0
8255 && final_prec > TYPE_PRECISION (TREE_TYPE (op)))
8256 break;
8258 /* See what's inside this conversion. If we decide to strip it,
8259 we will set WIN. */
8260 op = TREE_OPERAND (op, 0);
8262 /* If we have not stripped any zero-extensions (uns is 0),
8263 we can strip any kind of extension.
8264 If we have previously stripped a zero-extension,
8265 only zero-extensions can safely be stripped.
8266 Any extension can be stripped if the bits it would produce
8267 are all going to be discarded later by truncating to FOR_TYPE. */
8269 if (bitschange > 0)
8271 if (! uns || final_prec <= TYPE_PRECISION (TREE_TYPE (op)))
8272 win = op;
8273 /* TYPE_UNSIGNED says whether this is a zero-extension.
8274 Let's avoid computing it if it does not affect WIN
8275 and if UNS will not be needed again. */
8276 if ((uns
8277 || CONVERT_EXPR_P (op))
8278 && TYPE_UNSIGNED (TREE_TYPE (op)))
8280 uns = 1;
8281 win = op;
8286 /* If we finally reach a constant see if it fits in sth smaller and
8287 in that case convert it. */
8288 if (TREE_CODE (win) == INTEGER_CST)
8290 tree wtype = TREE_TYPE (win);
8291 unsigned prec = wi::min_precision (win, TYPE_SIGN (wtype));
8292 if (for_type)
8293 prec = MAX (prec, final_prec);
8294 if (prec < TYPE_PRECISION (wtype))
8296 tree t = lang_hooks.types.type_for_size (prec, TYPE_UNSIGNED (wtype));
8297 if (t && TYPE_PRECISION (t) < TYPE_PRECISION (wtype))
8298 win = fold_convert (t, win);
8302 return win;
8305 /* Return OP or a simpler expression for a narrower value
8306 which can be sign-extended or zero-extended to give back OP.
8307 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
8308 or 0 if the value should be sign-extended. */
8310 tree
8311 get_narrower (tree op, int *unsignedp_ptr)
8313 int uns = 0;
8314 int first = 1;
8315 tree win = op;
8316 bool integral_p = INTEGRAL_TYPE_P (TREE_TYPE (op));
8318 while (TREE_CODE (op) == NOP_EXPR)
8320 int bitschange
8321 = (TYPE_PRECISION (TREE_TYPE (op))
8322 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0))));
8324 /* Truncations are many-one so cannot be removed. */
8325 if (bitschange < 0)
8326 break;
8328 /* See what's inside this conversion. If we decide to strip it,
8329 we will set WIN. */
8331 if (bitschange > 0)
8333 op = TREE_OPERAND (op, 0);
8334 /* An extension: the outermost one can be stripped,
8335 but remember whether it is zero or sign extension. */
8336 if (first)
8337 uns = TYPE_UNSIGNED (TREE_TYPE (op));
8338 /* Otherwise, if a sign extension has been stripped,
8339 only sign extensions can now be stripped;
8340 if a zero extension has been stripped, only zero-extensions. */
8341 else if (uns != TYPE_UNSIGNED (TREE_TYPE (op)))
8342 break;
8343 first = 0;
8345 else /* bitschange == 0 */
8347 /* A change in nominal type can always be stripped, but we must
8348 preserve the unsignedness. */
8349 if (first)
8350 uns = TYPE_UNSIGNED (TREE_TYPE (op));
8351 first = 0;
8352 op = TREE_OPERAND (op, 0);
8353 /* Keep trying to narrow, but don't assign op to win if it
8354 would turn an integral type into something else. */
8355 if (INTEGRAL_TYPE_P (TREE_TYPE (op)) != integral_p)
8356 continue;
8359 win = op;
8362 if (TREE_CODE (op) == COMPONENT_REF
8363 /* Since type_for_size always gives an integer type. */
8364 && TREE_CODE (TREE_TYPE (op)) != REAL_TYPE
8365 && TREE_CODE (TREE_TYPE (op)) != FIXED_POINT_TYPE
8366 /* Ensure field is laid out already. */
8367 && DECL_SIZE (TREE_OPERAND (op, 1)) != 0
8368 && tree_fits_uhwi_p (DECL_SIZE (TREE_OPERAND (op, 1))))
8370 unsigned HOST_WIDE_INT innerprec
8371 = tree_to_uhwi (DECL_SIZE (TREE_OPERAND (op, 1)));
8372 int unsignedp = (DECL_UNSIGNED (TREE_OPERAND (op, 1))
8373 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op, 1))));
8374 tree type = lang_hooks.types.type_for_size (innerprec, unsignedp);
8376 /* We can get this structure field in a narrower type that fits it,
8377 but the resulting extension to its nominal type (a fullword type)
8378 must satisfy the same conditions as for other extensions.
8380 Do this only for fields that are aligned (not bit-fields),
8381 because when bit-field insns will be used there is no
8382 advantage in doing this. */
8384 if (innerprec < TYPE_PRECISION (TREE_TYPE (op))
8385 && ! DECL_BIT_FIELD (TREE_OPERAND (op, 1))
8386 && (first || uns == DECL_UNSIGNED (TREE_OPERAND (op, 1)))
8387 && type != 0)
8389 if (first)
8390 uns = DECL_UNSIGNED (TREE_OPERAND (op, 1));
8391 win = fold_convert (type, op);
8395 *unsignedp_ptr = uns;
8396 return win;
8399 /* Return true if integer constant C has a value that is permissible
8400 for TYPE, an integral type. */
8402 bool
8403 int_fits_type_p (const_tree c, const_tree type)
8405 tree type_low_bound, type_high_bound;
8406 bool ok_for_low_bound, ok_for_high_bound;
8407 signop sgn_c = TYPE_SIGN (TREE_TYPE (c));
8409 /* Non-standard boolean types can have arbitrary precision but various
8410 transformations assume that they can only take values 0 and +/-1. */
8411 if (TREE_CODE (type) == BOOLEAN_TYPE)
8412 return wi::fits_to_boolean_p (c, type);
8414 retry:
8415 type_low_bound = TYPE_MIN_VALUE (type);
8416 type_high_bound = TYPE_MAX_VALUE (type);
8418 /* If at least one bound of the type is a constant integer, we can check
8419 ourselves and maybe make a decision. If no such decision is possible, but
8420 this type is a subtype, try checking against that. Otherwise, use
8421 fits_to_tree_p, which checks against the precision.
8423 Compute the status for each possibly constant bound, and return if we see
8424 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
8425 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
8426 for "constant known to fit". */
8428 /* Check if c >= type_low_bound. */
8429 if (type_low_bound && TREE_CODE (type_low_bound) == INTEGER_CST)
8431 if (tree_int_cst_lt (c, type_low_bound))
8432 return false;
8433 ok_for_low_bound = true;
8435 else
8436 ok_for_low_bound = false;
8438 /* Check if c <= type_high_bound. */
8439 if (type_high_bound && TREE_CODE (type_high_bound) == INTEGER_CST)
8441 if (tree_int_cst_lt (type_high_bound, c))
8442 return false;
8443 ok_for_high_bound = true;
8445 else
8446 ok_for_high_bound = false;
8448 /* If the constant fits both bounds, the result is known. */
8449 if (ok_for_low_bound && ok_for_high_bound)
8450 return true;
8452 /* Perform some generic filtering which may allow making a decision
8453 even if the bounds are not constant. First, negative integers
8454 never fit in unsigned types, */
8455 if (TYPE_UNSIGNED (type) && sgn_c == SIGNED && wi::neg_p (c))
8456 return false;
8458 /* Second, narrower types always fit in wider ones. */
8459 if (TYPE_PRECISION (type) > TYPE_PRECISION (TREE_TYPE (c)))
8460 return true;
8462 /* Third, unsigned integers with top bit set never fit signed types. */
8463 if (!TYPE_UNSIGNED (type) && sgn_c == UNSIGNED)
8465 int prec = GET_MODE_PRECISION (SCALAR_INT_TYPE_MODE (TREE_TYPE (c))) - 1;
8466 if (prec < TYPE_PRECISION (TREE_TYPE (c)))
8468 /* When a tree_cst is converted to a wide-int, the precision
8469 is taken from the type. However, if the precision of the
8470 mode underneath the type is smaller than that, it is
8471 possible that the value will not fit. The test below
8472 fails if any bit is set between the sign bit of the
8473 underlying mode and the top bit of the type. */
8474 if (wi::ne_p (wi::zext (c, prec - 1), c))
8475 return false;
8477 else if (wi::neg_p (c))
8478 return false;
8481 /* If we haven't been able to decide at this point, there nothing more we
8482 can check ourselves here. Look at the base type if we have one and it
8483 has the same precision. */
8484 if (TREE_CODE (type) == INTEGER_TYPE
8485 && TREE_TYPE (type) != 0
8486 && TYPE_PRECISION (type) == TYPE_PRECISION (TREE_TYPE (type)))
8488 type = TREE_TYPE (type);
8489 goto retry;
8492 /* Or to fits_to_tree_p, if nothing else. */
8493 return wi::fits_to_tree_p (c, type);
8496 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
8497 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
8498 represented (assuming two's-complement arithmetic) within the bit
8499 precision of the type are returned instead. */
8501 void
8502 get_type_static_bounds (const_tree type, mpz_t min, mpz_t max)
8504 if (!POINTER_TYPE_P (type) && TYPE_MIN_VALUE (type)
8505 && TREE_CODE (TYPE_MIN_VALUE (type)) == INTEGER_CST)
8506 wi::to_mpz (TYPE_MIN_VALUE (type), min, TYPE_SIGN (type));
8507 else
8509 if (TYPE_UNSIGNED (type))
8510 mpz_set_ui (min, 0);
8511 else
8513 wide_int mn = wi::min_value (TYPE_PRECISION (type), SIGNED);
8514 wi::to_mpz (mn, min, SIGNED);
8518 if (!POINTER_TYPE_P (type) && TYPE_MAX_VALUE (type)
8519 && TREE_CODE (TYPE_MAX_VALUE (type)) == INTEGER_CST)
8520 wi::to_mpz (TYPE_MAX_VALUE (type), max, TYPE_SIGN (type));
8521 else
8523 wide_int mn = wi::max_value (TYPE_PRECISION (type), TYPE_SIGN (type));
8524 wi::to_mpz (mn, max, TYPE_SIGN (type));
8528 /* Return true if VAR is an automatic variable defined in function FN. */
8530 bool
8531 auto_var_in_fn_p (const_tree var, const_tree fn)
8533 return (DECL_P (var) && DECL_CONTEXT (var) == fn
8534 && ((((VAR_P (var) && ! DECL_EXTERNAL (var))
8535 || TREE_CODE (var) == PARM_DECL)
8536 && ! TREE_STATIC (var))
8537 || TREE_CODE (var) == LABEL_DECL
8538 || TREE_CODE (var) == RESULT_DECL));
8541 /* Subprogram of following function. Called by walk_tree.
8543 Return *TP if it is an automatic variable or parameter of the
8544 function passed in as DATA. */
8546 static tree
8547 find_var_from_fn (tree *tp, int *walk_subtrees, void *data)
8549 tree fn = (tree) data;
8551 if (TYPE_P (*tp))
8552 *walk_subtrees = 0;
8554 else if (DECL_P (*tp)
8555 && auto_var_in_fn_p (*tp, fn))
8556 return *tp;
8558 return NULL_TREE;
8561 /* Returns true if T is, contains, or refers to a type with variable
8562 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
8563 arguments, but not the return type. If FN is nonzero, only return
8564 true if a modifier of the type or position of FN is a variable or
8565 parameter inside FN.
8567 This concept is more general than that of C99 'variably modified types':
8568 in C99, a struct type is never variably modified because a VLA may not
8569 appear as a structure member. However, in GNU C code like:
8571 struct S { int i[f()]; };
8573 is valid, and other languages may define similar constructs. */
8575 bool
8576 variably_modified_type_p (tree type, tree fn)
8578 tree t;
8580 /* Test if T is either variable (if FN is zero) or an expression containing
8581 a variable in FN. If TYPE isn't gimplified, return true also if
8582 gimplify_one_sizepos would gimplify the expression into a local
8583 variable. */
8584 #define RETURN_TRUE_IF_VAR(T) \
8585 do { tree _t = (T); \
8586 if (_t != NULL_TREE \
8587 && _t != error_mark_node \
8588 && TREE_CODE (_t) != INTEGER_CST \
8589 && TREE_CODE (_t) != PLACEHOLDER_EXPR \
8590 && (!fn \
8591 || (!TYPE_SIZES_GIMPLIFIED (type) \
8592 && !is_gimple_sizepos (_t)) \
8593 || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
8594 return true; } while (0)
8596 if (type == error_mark_node)
8597 return false;
8599 /* If TYPE itself has variable size, it is variably modified. */
8600 RETURN_TRUE_IF_VAR (TYPE_SIZE (type));
8601 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type));
8603 switch (TREE_CODE (type))
8605 case POINTER_TYPE:
8606 case REFERENCE_TYPE:
8607 case VECTOR_TYPE:
8608 /* Ada can have pointer types refering to themselves indirectly. */
8609 if (TREE_VISITED (type))
8610 return false;
8611 TREE_VISITED (type) = true;
8612 if (variably_modified_type_p (TREE_TYPE (type), fn))
8614 TREE_VISITED (type) = false;
8615 return true;
8617 TREE_VISITED (type) = false;
8618 break;
8620 case FUNCTION_TYPE:
8621 case METHOD_TYPE:
8622 /* If TYPE is a function type, it is variably modified if the
8623 return type is variably modified. */
8624 if (variably_modified_type_p (TREE_TYPE (type), fn))
8625 return true;
8626 break;
8628 case INTEGER_TYPE:
8629 case REAL_TYPE:
8630 case FIXED_POINT_TYPE:
8631 case ENUMERAL_TYPE:
8632 case BOOLEAN_TYPE:
8633 /* Scalar types are variably modified if their end points
8634 aren't constant. */
8635 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type));
8636 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type));
8637 break;
8639 case RECORD_TYPE:
8640 case UNION_TYPE:
8641 case QUAL_UNION_TYPE:
8642 /* We can't see if any of the fields are variably-modified by the
8643 definition we normally use, since that would produce infinite
8644 recursion via pointers. */
8645 /* This is variably modified if some field's type is. */
8646 for (t = TYPE_FIELDS (type); t; t = DECL_CHAIN (t))
8647 if (TREE_CODE (t) == FIELD_DECL)
8649 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t));
8650 RETURN_TRUE_IF_VAR (DECL_SIZE (t));
8651 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t));
8653 if (TREE_CODE (type) == QUAL_UNION_TYPE)
8654 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t));
8656 break;
8658 case ARRAY_TYPE:
8659 /* Do not call ourselves to avoid infinite recursion. This is
8660 variably modified if the element type is. */
8661 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type)));
8662 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type)));
8663 break;
8665 default:
8666 break;
8669 /* The current language may have other cases to check, but in general,
8670 all other types are not variably modified. */
8671 return lang_hooks.tree_inlining.var_mod_type_p (type, fn);
8673 #undef RETURN_TRUE_IF_VAR
8676 /* Given a DECL or TYPE, return the scope in which it was declared, or
8677 NULL_TREE if there is no containing scope. */
8679 tree
8680 get_containing_scope (const_tree t)
8682 return (TYPE_P (t) ? TYPE_CONTEXT (t) : DECL_CONTEXT (t));
8685 /* Return the innermost context enclosing DECL that is
8686 a FUNCTION_DECL, or zero if none. */
8688 tree
8689 decl_function_context (const_tree decl)
8691 tree context;
8693 if (TREE_CODE (decl) == ERROR_MARK)
8694 return 0;
8696 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
8697 where we look up the function at runtime. Such functions always take
8698 a first argument of type 'pointer to real context'.
8700 C++ should really be fixed to use DECL_CONTEXT for the real context,
8701 and use something else for the "virtual context". */
8702 else if (TREE_CODE (decl) == FUNCTION_DECL && DECL_VINDEX (decl))
8703 context
8704 = TYPE_MAIN_VARIANT
8705 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl)))));
8706 else
8707 context = DECL_CONTEXT (decl);
8709 while (context && TREE_CODE (context) != FUNCTION_DECL)
8711 if (TREE_CODE (context) == BLOCK)
8712 context = BLOCK_SUPERCONTEXT (context);
8713 else
8714 context = get_containing_scope (context);
8717 return context;
8720 /* Return the innermost context enclosing DECL that is
8721 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
8722 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
8724 tree
8725 decl_type_context (const_tree decl)
8727 tree context = DECL_CONTEXT (decl);
8729 while (context)
8730 switch (TREE_CODE (context))
8732 case NAMESPACE_DECL:
8733 case TRANSLATION_UNIT_DECL:
8734 return NULL_TREE;
8736 case RECORD_TYPE:
8737 case UNION_TYPE:
8738 case QUAL_UNION_TYPE:
8739 return context;
8741 case TYPE_DECL:
8742 case FUNCTION_DECL:
8743 context = DECL_CONTEXT (context);
8744 break;
8746 case BLOCK:
8747 context = BLOCK_SUPERCONTEXT (context);
8748 break;
8750 default:
8751 gcc_unreachable ();
8754 return NULL_TREE;
8757 /* CALL is a CALL_EXPR. Return the declaration for the function
8758 called, or NULL_TREE if the called function cannot be
8759 determined. */
8761 tree
8762 get_callee_fndecl (const_tree call)
8764 tree addr;
8766 if (call == error_mark_node)
8767 return error_mark_node;
8769 /* It's invalid to call this function with anything but a
8770 CALL_EXPR. */
8771 gcc_assert (TREE_CODE (call) == CALL_EXPR);
8773 /* The first operand to the CALL is the address of the function
8774 called. */
8775 addr = CALL_EXPR_FN (call);
8777 /* If there is no function, return early. */
8778 if (addr == NULL_TREE)
8779 return NULL_TREE;
8781 STRIP_NOPS (addr);
8783 /* If this is a readonly function pointer, extract its initial value. */
8784 if (DECL_P (addr) && TREE_CODE (addr) != FUNCTION_DECL
8785 && TREE_READONLY (addr) && ! TREE_THIS_VOLATILE (addr)
8786 && DECL_INITIAL (addr))
8787 addr = DECL_INITIAL (addr);
8789 /* If the address is just `&f' for some function `f', then we know
8790 that `f' is being called. */
8791 if (TREE_CODE (addr) == ADDR_EXPR
8792 && TREE_CODE (TREE_OPERAND (addr, 0)) == FUNCTION_DECL)
8793 return TREE_OPERAND (addr, 0);
8795 /* We couldn't figure out what was being called. */
8796 return NULL_TREE;
8799 /* If CALL_EXPR CALL calls a normal built-in function or an internal function,
8800 return the associated function code, otherwise return CFN_LAST. */
8802 combined_fn
8803 get_call_combined_fn (const_tree call)
8805 /* It's invalid to call this function with anything but a CALL_EXPR. */
8806 gcc_assert (TREE_CODE (call) == CALL_EXPR);
8808 if (!CALL_EXPR_FN (call))
8809 return as_combined_fn (CALL_EXPR_IFN (call));
8811 tree fndecl = get_callee_fndecl (call);
8812 if (fndecl && DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL)
8813 return as_combined_fn (DECL_FUNCTION_CODE (fndecl));
8815 return CFN_LAST;
8818 #define TREE_MEM_USAGE_SPACES 40
8820 /* Print debugging information about tree nodes generated during the compile,
8821 and any language-specific information. */
8823 void
8824 dump_tree_statistics (void)
8826 if (GATHER_STATISTICS)
8828 int i;
8829 int total_nodes, total_bytes;
8830 fprintf (stderr, "\nKind Nodes Bytes\n");
8831 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES);
8832 total_nodes = total_bytes = 0;
8833 for (i = 0; i < (int) all_kinds; i++)
8835 fprintf (stderr, "%-20s %7d %10d\n", tree_node_kind_names[i],
8836 tree_node_counts[i], tree_node_sizes[i]);
8837 total_nodes += tree_node_counts[i];
8838 total_bytes += tree_node_sizes[i];
8840 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES);
8841 fprintf (stderr, "%-20s %7d %10d\n", "Total", total_nodes, total_bytes);
8842 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES);
8843 fprintf (stderr, "Code Nodes\n");
8844 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES);
8845 for (i = 0; i < (int) MAX_TREE_CODES; i++)
8846 fprintf (stderr, "%-32s %7d\n", get_tree_code_name ((enum tree_code) i),
8847 tree_code_counts[i]);
8848 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES);
8849 fprintf (stderr, "\n");
8850 ssanames_print_statistics ();
8851 fprintf (stderr, "\n");
8852 phinodes_print_statistics ();
8853 fprintf (stderr, "\n");
8855 else
8856 fprintf (stderr, "(No per-node statistics)\n");
8858 print_type_hash_statistics ();
8859 print_debug_expr_statistics ();
8860 print_value_expr_statistics ();
8861 lang_hooks.print_statistics ();
8864 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
8866 /* Generate a crc32 of the low BYTES bytes of VALUE. */
8868 unsigned
8869 crc32_unsigned_n (unsigned chksum, unsigned value, unsigned bytes)
8871 /* This relies on the raw feedback's top 4 bits being zero. */
8872 #define FEEDBACK(X) ((X) * 0x04c11db7)
8873 #define SYNDROME(X) (FEEDBACK ((X) & 1) ^ FEEDBACK ((X) & 2) \
8874 ^ FEEDBACK ((X) & 4) ^ FEEDBACK ((X) & 8))
8875 static const unsigned syndromes[16] =
8877 SYNDROME(0x0), SYNDROME(0x1), SYNDROME(0x2), SYNDROME(0x3),
8878 SYNDROME(0x4), SYNDROME(0x5), SYNDROME(0x6), SYNDROME(0x7),
8879 SYNDROME(0x8), SYNDROME(0x9), SYNDROME(0xa), SYNDROME(0xb),
8880 SYNDROME(0xc), SYNDROME(0xd), SYNDROME(0xe), SYNDROME(0xf),
8882 #undef FEEDBACK
8883 #undef SYNDROME
8885 value <<= (32 - bytes * 8);
8886 for (unsigned ix = bytes * 2; ix--; value <<= 4)
8888 unsigned feedback = syndromes[((value ^ chksum) >> 28) & 0xf];
8890 chksum = (chksum << 4) ^ feedback;
8893 return chksum;
8896 /* Generate a crc32 of a string. */
8898 unsigned
8899 crc32_string (unsigned chksum, const char *string)
8902 chksum = crc32_byte (chksum, *string);
8903 while (*string++);
8904 return chksum;
8907 /* P is a string that will be used in a symbol. Mask out any characters
8908 that are not valid in that context. */
8910 void
8911 clean_symbol_name (char *p)
8913 for (; *p; p++)
8914 if (! (ISALNUM (*p)
8915 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
8916 || *p == '$'
8917 #endif
8918 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
8919 || *p == '.'
8920 #endif
8922 *p = '_';
8925 /* For anonymous aggregate types, we need some sort of name to
8926 hold on to. In practice, this should not appear, but it should
8927 not be harmful if it does. */
8928 bool
8929 anon_aggrname_p(const_tree id_node)
8931 #ifndef NO_DOT_IN_LABEL
8932 return (IDENTIFIER_POINTER (id_node)[0] == '.'
8933 && IDENTIFIER_POINTER (id_node)[1] == '_');
8934 #else /* NO_DOT_IN_LABEL */
8935 #ifndef NO_DOLLAR_IN_LABEL
8936 return (IDENTIFIER_POINTER (id_node)[0] == '$' \
8937 && IDENTIFIER_POINTER (id_node)[1] == '_');
8938 #else /* NO_DOLLAR_IN_LABEL */
8939 #define ANON_AGGRNAME_PREFIX "__anon_"
8940 return (!strncmp (IDENTIFIER_POINTER (id_node), ANON_AGGRNAME_PREFIX,
8941 sizeof (ANON_AGGRNAME_PREFIX) - 1));
8942 #endif /* NO_DOLLAR_IN_LABEL */
8943 #endif /* NO_DOT_IN_LABEL */
8946 /* Return a format for an anonymous aggregate name. */
8947 const char *
8948 anon_aggrname_format()
8950 #ifndef NO_DOT_IN_LABEL
8951 return "._%d";
8952 #else /* NO_DOT_IN_LABEL */
8953 #ifndef NO_DOLLAR_IN_LABEL
8954 return "$_%d";
8955 #else /* NO_DOLLAR_IN_LABEL */
8956 return "__anon_%d";
8957 #endif /* NO_DOLLAR_IN_LABEL */
8958 #endif /* NO_DOT_IN_LABEL */
8961 /* Generate a name for a special-purpose function.
8962 The generated name may need to be unique across the whole link.
8963 Changes to this function may also require corresponding changes to
8964 xstrdup_mask_random.
8965 TYPE is some string to identify the purpose of this function to the
8966 linker or collect2; it must start with an uppercase letter,
8967 one of:
8968 I - for constructors
8969 D - for destructors
8970 N - for C++ anonymous namespaces
8971 F - for DWARF unwind frame information. */
8973 tree
8974 get_file_function_name (const char *type)
8976 char *buf;
8977 const char *p;
8978 char *q;
8980 /* If we already have a name we know to be unique, just use that. */
8981 if (first_global_object_name)
8982 p = q = ASTRDUP (first_global_object_name);
8983 /* If the target is handling the constructors/destructors, they
8984 will be local to this file and the name is only necessary for
8985 debugging purposes.
8986 We also assign sub_I and sub_D sufixes to constructors called from
8987 the global static constructors. These are always local. */
8988 else if (((type[0] == 'I' || type[0] == 'D') && targetm.have_ctors_dtors)
8989 || (strncmp (type, "sub_", 4) == 0
8990 && (type[4] == 'I' || type[4] == 'D')))
8992 const char *file = main_input_filename;
8993 if (! file)
8994 file = LOCATION_FILE (input_location);
8995 /* Just use the file's basename, because the full pathname
8996 might be quite long. */
8997 p = q = ASTRDUP (lbasename (file));
8999 else
9001 /* Otherwise, the name must be unique across the entire link.
9002 We don't have anything that we know to be unique to this translation
9003 unit, so use what we do have and throw in some randomness. */
9004 unsigned len;
9005 const char *name = weak_global_object_name;
9006 const char *file = main_input_filename;
9008 if (! name)
9009 name = "";
9010 if (! file)
9011 file = LOCATION_FILE (input_location);
9013 len = strlen (file);
9014 q = (char *) alloca (9 + 19 + len + 1);
9015 memcpy (q, file, len + 1);
9017 snprintf (q + len, 9 + 19 + 1, "_%08X_" HOST_WIDE_INT_PRINT_HEX,
9018 crc32_string (0, name), get_random_seed (false));
9020 p = q;
9023 clean_symbol_name (q);
9024 buf = (char *) alloca (sizeof (FILE_FUNCTION_FORMAT) + strlen (p)
9025 + strlen (type));
9027 /* Set up the name of the file-level functions we may need.
9028 Use a global object (which is already required to be unique over
9029 the program) rather than the file name (which imposes extra
9030 constraints). */
9031 sprintf (buf, FILE_FUNCTION_FORMAT, type, p);
9033 return get_identifier (buf);
9036 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
9038 /* Complain that the tree code of NODE does not match the expected 0
9039 terminated list of trailing codes. The trailing code list can be
9040 empty, for a more vague error message. FILE, LINE, and FUNCTION
9041 are of the caller. */
9043 void
9044 tree_check_failed (const_tree node, const char *file,
9045 int line, const char *function, ...)
9047 va_list args;
9048 const char *buffer;
9049 unsigned length = 0;
9050 enum tree_code code;
9052 va_start (args, function);
9053 while ((code = (enum tree_code) va_arg (args, int)))
9054 length += 4 + strlen (get_tree_code_name (code));
9055 va_end (args);
9056 if (length)
9058 char *tmp;
9059 va_start (args, function);
9060 length += strlen ("expected ");
9061 buffer = tmp = (char *) alloca (length);
9062 length = 0;
9063 while ((code = (enum tree_code) va_arg (args, int)))
9065 const char *prefix = length ? " or " : "expected ";
9067 strcpy (tmp + length, prefix);
9068 length += strlen (prefix);
9069 strcpy (tmp + length, get_tree_code_name (code));
9070 length += strlen (get_tree_code_name (code));
9072 va_end (args);
9074 else
9075 buffer = "unexpected node";
9077 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9078 buffer, get_tree_code_name (TREE_CODE (node)),
9079 function, trim_filename (file), line);
9082 /* Complain that the tree code of NODE does match the expected 0
9083 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
9084 the caller. */
9086 void
9087 tree_not_check_failed (const_tree node, const char *file,
9088 int line, const char *function, ...)
9090 va_list args;
9091 char *buffer;
9092 unsigned length = 0;
9093 enum tree_code code;
9095 va_start (args, function);
9096 while ((code = (enum tree_code) va_arg (args, int)))
9097 length += 4 + strlen (get_tree_code_name (code));
9098 va_end (args);
9099 va_start (args, function);
9100 buffer = (char *) alloca (length);
9101 length = 0;
9102 while ((code = (enum tree_code) va_arg (args, int)))
9104 if (length)
9106 strcpy (buffer + length, " or ");
9107 length += 4;
9109 strcpy (buffer + length, get_tree_code_name (code));
9110 length += strlen (get_tree_code_name (code));
9112 va_end (args);
9114 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
9115 buffer, get_tree_code_name (TREE_CODE (node)),
9116 function, trim_filename (file), line);
9119 /* Similar to tree_check_failed, except that we check for a class of tree
9120 code, given in CL. */
9122 void
9123 tree_class_check_failed (const_tree node, const enum tree_code_class cl,
9124 const char *file, int line, const char *function)
9126 internal_error
9127 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
9128 TREE_CODE_CLASS_STRING (cl),
9129 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node))),
9130 get_tree_code_name (TREE_CODE (node)), function, trim_filename (file), line);
9133 /* Similar to tree_check_failed, except that instead of specifying a
9134 dozen codes, use the knowledge that they're all sequential. */
9136 void
9137 tree_range_check_failed (const_tree node, const char *file, int line,
9138 const char *function, enum tree_code c1,
9139 enum tree_code c2)
9141 char *buffer;
9142 unsigned length = 0;
9143 unsigned int c;
9145 for (c = c1; c <= c2; ++c)
9146 length += 4 + strlen (get_tree_code_name ((enum tree_code) c));
9148 length += strlen ("expected ");
9149 buffer = (char *) alloca (length);
9150 length = 0;
9152 for (c = c1; c <= c2; ++c)
9154 const char *prefix = length ? " or " : "expected ";
9156 strcpy (buffer + length, prefix);
9157 length += strlen (prefix);
9158 strcpy (buffer + length, get_tree_code_name ((enum tree_code) c));
9159 length += strlen (get_tree_code_name ((enum tree_code) c));
9162 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9163 buffer, get_tree_code_name (TREE_CODE (node)),
9164 function, trim_filename (file), line);
9168 /* Similar to tree_check_failed, except that we check that a tree does
9169 not have the specified code, given in CL. */
9171 void
9172 tree_not_class_check_failed (const_tree node, const enum tree_code_class cl,
9173 const char *file, int line, const char *function)
9175 internal_error
9176 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
9177 TREE_CODE_CLASS_STRING (cl),
9178 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node))),
9179 get_tree_code_name (TREE_CODE (node)), function, trim_filename (file), line);
9183 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
9185 void
9186 omp_clause_check_failed (const_tree node, const char *file, int line,
9187 const char *function, enum omp_clause_code code)
9189 internal_error ("tree check: expected omp_clause %s, have %s in %s, at %s:%d",
9190 omp_clause_code_name[code], get_tree_code_name (TREE_CODE (node)),
9191 function, trim_filename (file), line);
9195 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
9197 void
9198 omp_clause_range_check_failed (const_tree node, const char *file, int line,
9199 const char *function, enum omp_clause_code c1,
9200 enum omp_clause_code c2)
9202 char *buffer;
9203 unsigned length = 0;
9204 unsigned int c;
9206 for (c = c1; c <= c2; ++c)
9207 length += 4 + strlen (omp_clause_code_name[c]);
9209 length += strlen ("expected ");
9210 buffer = (char *) alloca (length);
9211 length = 0;
9213 for (c = c1; c <= c2; ++c)
9215 const char *prefix = length ? " or " : "expected ";
9217 strcpy (buffer + length, prefix);
9218 length += strlen (prefix);
9219 strcpy (buffer + length, omp_clause_code_name[c]);
9220 length += strlen (omp_clause_code_name[c]);
9223 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9224 buffer, omp_clause_code_name[TREE_CODE (node)],
9225 function, trim_filename (file), line);
9229 #undef DEFTREESTRUCT
9230 #define DEFTREESTRUCT(VAL, NAME) NAME,
9232 static const char *ts_enum_names[] = {
9233 #include "treestruct.def"
9235 #undef DEFTREESTRUCT
9237 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
9239 /* Similar to tree_class_check_failed, except that we check for
9240 whether CODE contains the tree structure identified by EN. */
9242 void
9243 tree_contains_struct_check_failed (const_tree node,
9244 const enum tree_node_structure_enum en,
9245 const char *file, int line,
9246 const char *function)
9248 internal_error
9249 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
9250 TS_ENUM_NAME (en),
9251 get_tree_code_name (TREE_CODE (node)), function, trim_filename (file), line);
9255 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9256 (dynamically sized) vector. */
9258 void
9259 tree_int_cst_elt_check_failed (int idx, int len, const char *file, int line,
9260 const char *function)
9262 internal_error
9263 ("tree check: accessed elt %d of tree_int_cst with %d elts in %s, at %s:%d",
9264 idx + 1, len, function, trim_filename (file), line);
9267 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9268 (dynamically sized) vector. */
9270 void
9271 tree_vec_elt_check_failed (int idx, int len, const char *file, int line,
9272 const char *function)
9274 internal_error
9275 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
9276 idx + 1, len, function, trim_filename (file), line);
9279 /* Similar to above, except that the check is for the bounds of the operand
9280 vector of an expression node EXP. */
9282 void
9283 tree_operand_check_failed (int idx, const_tree exp, const char *file,
9284 int line, const char *function)
9286 enum tree_code code = TREE_CODE (exp);
9287 internal_error
9288 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
9289 idx + 1, get_tree_code_name (code), TREE_OPERAND_LENGTH (exp),
9290 function, trim_filename (file), line);
9293 /* Similar to above, except that the check is for the number of
9294 operands of an OMP_CLAUSE node. */
9296 void
9297 omp_clause_operand_check_failed (int idx, const_tree t, const char *file,
9298 int line, const char *function)
9300 internal_error
9301 ("tree check: accessed operand %d of omp_clause %s with %d operands "
9302 "in %s, at %s:%d", idx + 1, omp_clause_code_name[OMP_CLAUSE_CODE (t)],
9303 omp_clause_num_ops [OMP_CLAUSE_CODE (t)], function,
9304 trim_filename (file), line);
9306 #endif /* ENABLE_TREE_CHECKING */
9308 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
9309 and mapped to the machine mode MODE. Initialize its fields and build
9310 the information necessary for debugging output. */
9312 static tree
9313 make_vector_type (tree innertype, int nunits, machine_mode mode)
9315 tree t;
9316 tree mv_innertype = TYPE_MAIN_VARIANT (innertype);
9318 t = make_node (VECTOR_TYPE);
9319 TREE_TYPE (t) = mv_innertype;
9320 SET_TYPE_VECTOR_SUBPARTS (t, nunits);
9321 SET_TYPE_MODE (t, mode);
9323 if (TYPE_STRUCTURAL_EQUALITY_P (mv_innertype) || in_lto_p)
9324 SET_TYPE_STRUCTURAL_EQUALITY (t);
9325 else if ((TYPE_CANONICAL (mv_innertype) != innertype
9326 || mode != VOIDmode)
9327 && !VECTOR_BOOLEAN_TYPE_P (t))
9328 TYPE_CANONICAL (t)
9329 = make_vector_type (TYPE_CANONICAL (mv_innertype), nunits, VOIDmode);
9331 layout_type (t);
9333 hashval_t hash = type_hash_canon_hash (t);
9334 t = type_hash_canon (hash, t);
9336 /* We have built a main variant, based on the main variant of the
9337 inner type. Use it to build the variant we return. */
9338 if ((TYPE_ATTRIBUTES (innertype) || TYPE_QUALS (innertype))
9339 && TREE_TYPE (t) != innertype)
9340 return build_type_attribute_qual_variant (t,
9341 TYPE_ATTRIBUTES (innertype),
9342 TYPE_QUALS (innertype));
9344 return t;
9347 static tree
9348 make_or_reuse_type (unsigned size, int unsignedp)
9350 int i;
9352 if (size == INT_TYPE_SIZE)
9353 return unsignedp ? unsigned_type_node : integer_type_node;
9354 if (size == CHAR_TYPE_SIZE)
9355 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
9356 if (size == SHORT_TYPE_SIZE)
9357 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
9358 if (size == LONG_TYPE_SIZE)
9359 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
9360 if (size == LONG_LONG_TYPE_SIZE)
9361 return (unsignedp ? long_long_unsigned_type_node
9362 : long_long_integer_type_node);
9364 for (i = 0; i < NUM_INT_N_ENTS; i ++)
9365 if (size == int_n_data[i].bitsize
9366 && int_n_enabled_p[i])
9367 return (unsignedp ? int_n_trees[i].unsigned_type
9368 : int_n_trees[i].signed_type);
9370 if (unsignedp)
9371 return make_unsigned_type (size);
9372 else
9373 return make_signed_type (size);
9376 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
9378 static tree
9379 make_or_reuse_fract_type (unsigned size, int unsignedp, int satp)
9381 if (satp)
9383 if (size == SHORT_FRACT_TYPE_SIZE)
9384 return unsignedp ? sat_unsigned_short_fract_type_node
9385 : sat_short_fract_type_node;
9386 if (size == FRACT_TYPE_SIZE)
9387 return unsignedp ? sat_unsigned_fract_type_node : sat_fract_type_node;
9388 if (size == LONG_FRACT_TYPE_SIZE)
9389 return unsignedp ? sat_unsigned_long_fract_type_node
9390 : sat_long_fract_type_node;
9391 if (size == LONG_LONG_FRACT_TYPE_SIZE)
9392 return unsignedp ? sat_unsigned_long_long_fract_type_node
9393 : sat_long_long_fract_type_node;
9395 else
9397 if (size == SHORT_FRACT_TYPE_SIZE)
9398 return unsignedp ? unsigned_short_fract_type_node
9399 : short_fract_type_node;
9400 if (size == FRACT_TYPE_SIZE)
9401 return unsignedp ? unsigned_fract_type_node : fract_type_node;
9402 if (size == LONG_FRACT_TYPE_SIZE)
9403 return unsignedp ? unsigned_long_fract_type_node
9404 : long_fract_type_node;
9405 if (size == LONG_LONG_FRACT_TYPE_SIZE)
9406 return unsignedp ? unsigned_long_long_fract_type_node
9407 : long_long_fract_type_node;
9410 return make_fract_type (size, unsignedp, satp);
9413 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
9415 static tree
9416 make_or_reuse_accum_type (unsigned size, int unsignedp, int satp)
9418 if (satp)
9420 if (size == SHORT_ACCUM_TYPE_SIZE)
9421 return unsignedp ? sat_unsigned_short_accum_type_node
9422 : sat_short_accum_type_node;
9423 if (size == ACCUM_TYPE_SIZE)
9424 return unsignedp ? sat_unsigned_accum_type_node : sat_accum_type_node;
9425 if (size == LONG_ACCUM_TYPE_SIZE)
9426 return unsignedp ? sat_unsigned_long_accum_type_node
9427 : sat_long_accum_type_node;
9428 if (size == LONG_LONG_ACCUM_TYPE_SIZE)
9429 return unsignedp ? sat_unsigned_long_long_accum_type_node
9430 : sat_long_long_accum_type_node;
9432 else
9434 if (size == SHORT_ACCUM_TYPE_SIZE)
9435 return unsignedp ? unsigned_short_accum_type_node
9436 : short_accum_type_node;
9437 if (size == ACCUM_TYPE_SIZE)
9438 return unsignedp ? unsigned_accum_type_node : accum_type_node;
9439 if (size == LONG_ACCUM_TYPE_SIZE)
9440 return unsignedp ? unsigned_long_accum_type_node
9441 : long_accum_type_node;
9442 if (size == LONG_LONG_ACCUM_TYPE_SIZE)
9443 return unsignedp ? unsigned_long_long_accum_type_node
9444 : long_long_accum_type_node;
9447 return make_accum_type (size, unsignedp, satp);
9451 /* Create an atomic variant node for TYPE. This routine is called
9452 during initialization of data types to create the 5 basic atomic
9453 types. The generic build_variant_type function requires these to
9454 already be set up in order to function properly, so cannot be
9455 called from there. If ALIGN is non-zero, then ensure alignment is
9456 overridden to this value. */
9458 static tree
9459 build_atomic_base (tree type, unsigned int align)
9461 tree t;
9463 /* Make sure its not already registered. */
9464 if ((t = get_qualified_type (type, TYPE_QUAL_ATOMIC)))
9465 return t;
9467 t = build_variant_type_copy (type);
9468 set_type_quals (t, TYPE_QUAL_ATOMIC);
9470 if (align)
9471 SET_TYPE_ALIGN (t, align);
9473 return t;
9476 /* Information about the _FloatN and _FloatNx types. This must be in
9477 the same order as the corresponding TI_* enum values. */
9478 const floatn_type_info floatn_nx_types[NUM_FLOATN_NX_TYPES] =
9480 { 16, false },
9481 { 32, false },
9482 { 64, false },
9483 { 128, false },
9484 { 32, true },
9485 { 64, true },
9486 { 128, true },
9490 /* Create nodes for all integer types (and error_mark_node) using the sizes
9491 of C datatypes. SIGNED_CHAR specifies whether char is signed. */
9493 void
9494 build_common_tree_nodes (bool signed_char)
9496 int i;
9498 error_mark_node = make_node (ERROR_MARK);
9499 TREE_TYPE (error_mark_node) = error_mark_node;
9501 initialize_sizetypes ();
9503 /* Define both `signed char' and `unsigned char'. */
9504 signed_char_type_node = make_signed_type (CHAR_TYPE_SIZE);
9505 TYPE_STRING_FLAG (signed_char_type_node) = 1;
9506 unsigned_char_type_node = make_unsigned_type (CHAR_TYPE_SIZE);
9507 TYPE_STRING_FLAG (unsigned_char_type_node) = 1;
9509 /* Define `char', which is like either `signed char' or `unsigned char'
9510 but not the same as either. */
9511 char_type_node
9512 = (signed_char
9513 ? make_signed_type (CHAR_TYPE_SIZE)
9514 : make_unsigned_type (CHAR_TYPE_SIZE));
9515 TYPE_STRING_FLAG (char_type_node) = 1;
9517 short_integer_type_node = make_signed_type (SHORT_TYPE_SIZE);
9518 short_unsigned_type_node = make_unsigned_type (SHORT_TYPE_SIZE);
9519 integer_type_node = make_signed_type (INT_TYPE_SIZE);
9520 unsigned_type_node = make_unsigned_type (INT_TYPE_SIZE);
9521 long_integer_type_node = make_signed_type (LONG_TYPE_SIZE);
9522 long_unsigned_type_node = make_unsigned_type (LONG_TYPE_SIZE);
9523 long_long_integer_type_node = make_signed_type (LONG_LONG_TYPE_SIZE);
9524 long_long_unsigned_type_node = make_unsigned_type (LONG_LONG_TYPE_SIZE);
9526 for (i = 0; i < NUM_INT_N_ENTS; i ++)
9528 int_n_trees[i].signed_type = make_signed_type (int_n_data[i].bitsize);
9529 int_n_trees[i].unsigned_type = make_unsigned_type (int_n_data[i].bitsize);
9530 TYPE_SIZE (int_n_trees[i].signed_type) = bitsize_int (int_n_data[i].bitsize);
9531 TYPE_SIZE (int_n_trees[i].unsigned_type) = bitsize_int (int_n_data[i].bitsize);
9533 if (int_n_data[i].bitsize > LONG_LONG_TYPE_SIZE
9534 && int_n_enabled_p[i])
9536 integer_types[itk_intN_0 + i * 2] = int_n_trees[i].signed_type;
9537 integer_types[itk_unsigned_intN_0 + i * 2] = int_n_trees[i].unsigned_type;
9541 /* Define a boolean type. This type only represents boolean values but
9542 may be larger than char depending on the value of BOOL_TYPE_SIZE. */
9543 boolean_type_node = make_unsigned_type (BOOL_TYPE_SIZE);
9544 TREE_SET_CODE (boolean_type_node, BOOLEAN_TYPE);
9545 TYPE_PRECISION (boolean_type_node) = 1;
9546 TYPE_MAX_VALUE (boolean_type_node) = build_int_cst (boolean_type_node, 1);
9548 /* Define what type to use for size_t. */
9549 if (strcmp (SIZE_TYPE, "unsigned int") == 0)
9550 size_type_node = unsigned_type_node;
9551 else if (strcmp (SIZE_TYPE, "long unsigned int") == 0)
9552 size_type_node = long_unsigned_type_node;
9553 else if (strcmp (SIZE_TYPE, "long long unsigned int") == 0)
9554 size_type_node = long_long_unsigned_type_node;
9555 else if (strcmp (SIZE_TYPE, "short unsigned int") == 0)
9556 size_type_node = short_unsigned_type_node;
9557 else
9559 int i;
9561 size_type_node = NULL_TREE;
9562 for (i = 0; i < NUM_INT_N_ENTS; i++)
9563 if (int_n_enabled_p[i])
9565 char name[50];
9566 sprintf (name, "__int%d unsigned", int_n_data[i].bitsize);
9568 if (strcmp (name, SIZE_TYPE) == 0)
9570 size_type_node = int_n_trees[i].unsigned_type;
9573 if (size_type_node == NULL_TREE)
9574 gcc_unreachable ();
9577 /* Define what type to use for ptrdiff_t. */
9578 if (strcmp (PTRDIFF_TYPE, "int") == 0)
9579 ptrdiff_type_node = integer_type_node;
9580 else if (strcmp (PTRDIFF_TYPE, "long int") == 0)
9581 ptrdiff_type_node = long_integer_type_node;
9582 else if (strcmp (PTRDIFF_TYPE, "long long int") == 0)
9583 ptrdiff_type_node = long_long_integer_type_node;
9584 else if (strcmp (PTRDIFF_TYPE, "short int") == 0)
9585 ptrdiff_type_node = short_integer_type_node;
9586 else
9588 ptrdiff_type_node = NULL_TREE;
9589 for (int i = 0; i < NUM_INT_N_ENTS; i++)
9590 if (int_n_enabled_p[i])
9592 char name[50];
9593 sprintf (name, "__int%d", int_n_data[i].bitsize);
9594 if (strcmp (name, PTRDIFF_TYPE) == 0)
9595 ptrdiff_type_node = int_n_trees[i].signed_type;
9597 if (ptrdiff_type_node == NULL_TREE)
9598 gcc_unreachable ();
9601 /* Fill in the rest of the sized types. Reuse existing type nodes
9602 when possible. */
9603 intQI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (QImode), 0);
9604 intHI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (HImode), 0);
9605 intSI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (SImode), 0);
9606 intDI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (DImode), 0);
9607 intTI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (TImode), 0);
9609 unsigned_intQI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (QImode), 1);
9610 unsigned_intHI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (HImode), 1);
9611 unsigned_intSI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (SImode), 1);
9612 unsigned_intDI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (DImode), 1);
9613 unsigned_intTI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (TImode), 1);
9615 /* Don't call build_qualified type for atomics. That routine does
9616 special processing for atomics, and until they are initialized
9617 it's better not to make that call.
9619 Check to see if there is a target override for atomic types. */
9621 atomicQI_type_node = build_atomic_base (unsigned_intQI_type_node,
9622 targetm.atomic_align_for_mode (QImode));
9623 atomicHI_type_node = build_atomic_base (unsigned_intHI_type_node,
9624 targetm.atomic_align_for_mode (HImode));
9625 atomicSI_type_node = build_atomic_base (unsigned_intSI_type_node,
9626 targetm.atomic_align_for_mode (SImode));
9627 atomicDI_type_node = build_atomic_base (unsigned_intDI_type_node,
9628 targetm.atomic_align_for_mode (DImode));
9629 atomicTI_type_node = build_atomic_base (unsigned_intTI_type_node,
9630 targetm.atomic_align_for_mode (TImode));
9632 access_public_node = get_identifier ("public");
9633 access_protected_node = get_identifier ("protected");
9634 access_private_node = get_identifier ("private");
9636 /* Define these next since types below may used them. */
9637 integer_zero_node = build_int_cst (integer_type_node, 0);
9638 integer_one_node = build_int_cst (integer_type_node, 1);
9639 integer_three_node = build_int_cst (integer_type_node, 3);
9640 integer_minus_one_node = build_int_cst (integer_type_node, -1);
9642 size_zero_node = size_int (0);
9643 size_one_node = size_int (1);
9644 bitsize_zero_node = bitsize_int (0);
9645 bitsize_one_node = bitsize_int (1);
9646 bitsize_unit_node = bitsize_int (BITS_PER_UNIT);
9648 boolean_false_node = TYPE_MIN_VALUE (boolean_type_node);
9649 boolean_true_node = TYPE_MAX_VALUE (boolean_type_node);
9651 void_type_node = make_node (VOID_TYPE);
9652 layout_type (void_type_node);
9654 pointer_bounds_type_node = targetm.chkp_bound_type ();
9656 /* We are not going to have real types in C with less than byte alignment,
9657 so we might as well not have any types that claim to have it. */
9658 SET_TYPE_ALIGN (void_type_node, BITS_PER_UNIT);
9659 TYPE_USER_ALIGN (void_type_node) = 0;
9661 void_node = make_node (VOID_CST);
9662 TREE_TYPE (void_node) = void_type_node;
9664 null_pointer_node = build_int_cst (build_pointer_type (void_type_node), 0);
9665 layout_type (TREE_TYPE (null_pointer_node));
9667 ptr_type_node = build_pointer_type (void_type_node);
9668 const_ptr_type_node
9669 = build_pointer_type (build_type_variant (void_type_node, 1, 0));
9670 for (unsigned i = 0;
9671 i < sizeof (builtin_structptr_types) / sizeof (builtin_structptr_type);
9672 ++i)
9673 builtin_structptr_types[i].node = builtin_structptr_types[i].base;
9675 pointer_sized_int_node = build_nonstandard_integer_type (POINTER_SIZE, 1);
9677 float_type_node = make_node (REAL_TYPE);
9678 TYPE_PRECISION (float_type_node) = FLOAT_TYPE_SIZE;
9679 layout_type (float_type_node);
9681 double_type_node = make_node (REAL_TYPE);
9682 TYPE_PRECISION (double_type_node) = DOUBLE_TYPE_SIZE;
9683 layout_type (double_type_node);
9685 long_double_type_node = make_node (REAL_TYPE);
9686 TYPE_PRECISION (long_double_type_node) = LONG_DOUBLE_TYPE_SIZE;
9687 layout_type (long_double_type_node);
9689 for (i = 0; i < NUM_FLOATN_NX_TYPES; i++)
9691 int n = floatn_nx_types[i].n;
9692 bool extended = floatn_nx_types[i].extended;
9693 scalar_float_mode mode;
9694 if (!targetm.floatn_mode (n, extended).exists (&mode))
9695 continue;
9696 int precision = GET_MODE_PRECISION (mode);
9697 /* Work around the rs6000 KFmode having precision 113 not
9698 128. */
9699 const struct real_format *fmt = REAL_MODE_FORMAT (mode);
9700 gcc_assert (fmt->b == 2 && fmt->emin + fmt->emax == 3);
9701 int min_precision = fmt->p + ceil_log2 (fmt->emax - fmt->emin);
9702 if (!extended)
9703 gcc_assert (min_precision == n);
9704 if (precision < min_precision)
9705 precision = min_precision;
9706 FLOATN_NX_TYPE_NODE (i) = make_node (REAL_TYPE);
9707 TYPE_PRECISION (FLOATN_NX_TYPE_NODE (i)) = precision;
9708 layout_type (FLOATN_NX_TYPE_NODE (i));
9709 SET_TYPE_MODE (FLOATN_NX_TYPE_NODE (i), mode);
9712 float_ptr_type_node = build_pointer_type (float_type_node);
9713 double_ptr_type_node = build_pointer_type (double_type_node);
9714 long_double_ptr_type_node = build_pointer_type (long_double_type_node);
9715 integer_ptr_type_node = build_pointer_type (integer_type_node);
9717 /* Fixed size integer types. */
9718 uint16_type_node = make_or_reuse_type (16, 1);
9719 uint32_type_node = make_or_reuse_type (32, 1);
9720 uint64_type_node = make_or_reuse_type (64, 1);
9722 /* Decimal float types. */
9723 dfloat32_type_node = make_node (REAL_TYPE);
9724 TYPE_PRECISION (dfloat32_type_node) = DECIMAL32_TYPE_SIZE;
9725 SET_TYPE_MODE (dfloat32_type_node, SDmode);
9726 layout_type (dfloat32_type_node);
9727 dfloat32_ptr_type_node = build_pointer_type (dfloat32_type_node);
9729 dfloat64_type_node = make_node (REAL_TYPE);
9730 TYPE_PRECISION (dfloat64_type_node) = DECIMAL64_TYPE_SIZE;
9731 SET_TYPE_MODE (dfloat64_type_node, DDmode);
9732 layout_type (dfloat64_type_node);
9733 dfloat64_ptr_type_node = build_pointer_type (dfloat64_type_node);
9735 dfloat128_type_node = make_node (REAL_TYPE);
9736 TYPE_PRECISION (dfloat128_type_node) = DECIMAL128_TYPE_SIZE;
9737 SET_TYPE_MODE (dfloat128_type_node, TDmode);
9738 layout_type (dfloat128_type_node);
9739 dfloat128_ptr_type_node = build_pointer_type (dfloat128_type_node);
9741 complex_integer_type_node = build_complex_type (integer_type_node, true);
9742 complex_float_type_node = build_complex_type (float_type_node, true);
9743 complex_double_type_node = build_complex_type (double_type_node, true);
9744 complex_long_double_type_node = build_complex_type (long_double_type_node,
9745 true);
9747 for (i = 0; i < NUM_FLOATN_NX_TYPES; i++)
9749 if (FLOATN_NX_TYPE_NODE (i) != NULL_TREE)
9750 COMPLEX_FLOATN_NX_TYPE_NODE (i)
9751 = build_complex_type (FLOATN_NX_TYPE_NODE (i));
9754 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
9755 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
9756 sat_ ## KIND ## _type_node = \
9757 make_sat_signed_ ## KIND ## _type (SIZE); \
9758 sat_unsigned_ ## KIND ## _type_node = \
9759 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9760 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9761 unsigned_ ## KIND ## _type_node = \
9762 make_unsigned_ ## KIND ## _type (SIZE);
9764 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
9765 sat_ ## WIDTH ## KIND ## _type_node = \
9766 make_sat_signed_ ## KIND ## _type (SIZE); \
9767 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
9768 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9769 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9770 unsigned_ ## WIDTH ## KIND ## _type_node = \
9771 make_unsigned_ ## KIND ## _type (SIZE);
9773 /* Make fixed-point type nodes based on four different widths. */
9774 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
9775 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
9776 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
9777 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
9778 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
9780 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
9781 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
9782 NAME ## _type_node = \
9783 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
9784 u ## NAME ## _type_node = \
9785 make_or_reuse_unsigned_ ## KIND ## _type \
9786 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
9787 sat_ ## NAME ## _type_node = \
9788 make_or_reuse_sat_signed_ ## KIND ## _type \
9789 (GET_MODE_BITSIZE (MODE ## mode)); \
9790 sat_u ## NAME ## _type_node = \
9791 make_or_reuse_sat_unsigned_ ## KIND ## _type \
9792 (GET_MODE_BITSIZE (U ## MODE ## mode));
9794 /* Fixed-point type and mode nodes. */
9795 MAKE_FIXED_TYPE_NODE_FAMILY (fract, FRACT)
9796 MAKE_FIXED_TYPE_NODE_FAMILY (accum, ACCUM)
9797 MAKE_FIXED_MODE_NODE (fract, qq, QQ)
9798 MAKE_FIXED_MODE_NODE (fract, hq, HQ)
9799 MAKE_FIXED_MODE_NODE (fract, sq, SQ)
9800 MAKE_FIXED_MODE_NODE (fract, dq, DQ)
9801 MAKE_FIXED_MODE_NODE (fract, tq, TQ)
9802 MAKE_FIXED_MODE_NODE (accum, ha, HA)
9803 MAKE_FIXED_MODE_NODE (accum, sa, SA)
9804 MAKE_FIXED_MODE_NODE (accum, da, DA)
9805 MAKE_FIXED_MODE_NODE (accum, ta, TA)
9808 tree t = targetm.build_builtin_va_list ();
9810 /* Many back-ends define record types without setting TYPE_NAME.
9811 If we copied the record type here, we'd keep the original
9812 record type without a name. This breaks name mangling. So,
9813 don't copy record types and let c_common_nodes_and_builtins()
9814 declare the type to be __builtin_va_list. */
9815 if (TREE_CODE (t) != RECORD_TYPE)
9816 t = build_variant_type_copy (t);
9818 va_list_type_node = t;
9822 /* Modify DECL for given flags.
9823 TM_PURE attribute is set only on types, so the function will modify
9824 DECL's type when ECF_TM_PURE is used. */
9826 void
9827 set_call_expr_flags (tree decl, int flags)
9829 if (flags & ECF_NOTHROW)
9830 TREE_NOTHROW (decl) = 1;
9831 if (flags & ECF_CONST)
9832 TREE_READONLY (decl) = 1;
9833 if (flags & ECF_PURE)
9834 DECL_PURE_P (decl) = 1;
9835 if (flags & ECF_LOOPING_CONST_OR_PURE)
9836 DECL_LOOPING_CONST_OR_PURE_P (decl) = 1;
9837 if (flags & ECF_NOVOPS)
9838 DECL_IS_NOVOPS (decl) = 1;
9839 if (flags & ECF_NORETURN)
9840 TREE_THIS_VOLATILE (decl) = 1;
9841 if (flags & ECF_MALLOC)
9842 DECL_IS_MALLOC (decl) = 1;
9843 if (flags & ECF_RETURNS_TWICE)
9844 DECL_IS_RETURNS_TWICE (decl) = 1;
9845 if (flags & ECF_LEAF)
9846 DECL_ATTRIBUTES (decl) = tree_cons (get_identifier ("leaf"),
9847 NULL, DECL_ATTRIBUTES (decl));
9848 if (flags & ECF_COLD)
9849 DECL_ATTRIBUTES (decl) = tree_cons (get_identifier ("cold"),
9850 NULL, DECL_ATTRIBUTES (decl));
9851 if (flags & ECF_RET1)
9852 DECL_ATTRIBUTES (decl)
9853 = tree_cons (get_identifier ("fn spec"),
9854 build_tree_list (NULL_TREE, build_string (1, "1")),
9855 DECL_ATTRIBUTES (decl));
9856 if ((flags & ECF_TM_PURE) && flag_tm)
9857 apply_tm_attr (decl, get_identifier ("transaction_pure"));
9858 /* Looping const or pure is implied by noreturn.
9859 There is currently no way to declare looping const or looping pure alone. */
9860 gcc_assert (!(flags & ECF_LOOPING_CONST_OR_PURE)
9861 || ((flags & ECF_NORETURN) && (flags & (ECF_CONST | ECF_PURE))));
9865 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
9867 static void
9868 local_define_builtin (const char *name, tree type, enum built_in_function code,
9869 const char *library_name, int ecf_flags)
9871 tree decl;
9873 decl = add_builtin_function (name, type, code, BUILT_IN_NORMAL,
9874 library_name, NULL_TREE);
9875 set_call_expr_flags (decl, ecf_flags);
9877 set_builtin_decl (code, decl, true);
9880 /* Call this function after instantiating all builtins that the language
9881 front end cares about. This will build the rest of the builtins
9882 and internal functions that are relied upon by the tree optimizers and
9883 the middle-end. */
9885 void
9886 build_common_builtin_nodes (void)
9888 tree tmp, ftype;
9889 int ecf_flags;
9891 if (!builtin_decl_explicit_p (BUILT_IN_UNREACHABLE)
9892 || !builtin_decl_explicit_p (BUILT_IN_ABORT))
9894 ftype = build_function_type (void_type_node, void_list_node);
9895 if (!builtin_decl_explicit_p (BUILT_IN_UNREACHABLE))
9896 local_define_builtin ("__builtin_unreachable", ftype,
9897 BUILT_IN_UNREACHABLE,
9898 "__builtin_unreachable",
9899 ECF_NOTHROW | ECF_LEAF | ECF_NORETURN
9900 | ECF_CONST | ECF_COLD);
9901 if (!builtin_decl_explicit_p (BUILT_IN_ABORT))
9902 local_define_builtin ("__builtin_abort", ftype, BUILT_IN_ABORT,
9903 "abort",
9904 ECF_LEAF | ECF_NORETURN | ECF_CONST | ECF_COLD);
9907 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY)
9908 || !builtin_decl_explicit_p (BUILT_IN_MEMMOVE))
9910 ftype = build_function_type_list (ptr_type_node,
9911 ptr_type_node, const_ptr_type_node,
9912 size_type_node, NULL_TREE);
9914 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY))
9915 local_define_builtin ("__builtin_memcpy", ftype, BUILT_IN_MEMCPY,
9916 "memcpy", ECF_NOTHROW | ECF_LEAF | ECF_RET1);
9917 if (!builtin_decl_explicit_p (BUILT_IN_MEMMOVE))
9918 local_define_builtin ("__builtin_memmove", ftype, BUILT_IN_MEMMOVE,
9919 "memmove", ECF_NOTHROW | ECF_LEAF | ECF_RET1);
9922 if (!builtin_decl_explicit_p (BUILT_IN_MEMCMP))
9924 ftype = build_function_type_list (integer_type_node, const_ptr_type_node,
9925 const_ptr_type_node, size_type_node,
9926 NULL_TREE);
9927 local_define_builtin ("__builtin_memcmp", ftype, BUILT_IN_MEMCMP,
9928 "memcmp", ECF_PURE | ECF_NOTHROW | ECF_LEAF);
9931 if (!builtin_decl_explicit_p (BUILT_IN_MEMSET))
9933 ftype = build_function_type_list (ptr_type_node,
9934 ptr_type_node, integer_type_node,
9935 size_type_node, NULL_TREE);
9936 local_define_builtin ("__builtin_memset", ftype, BUILT_IN_MEMSET,
9937 "memset", ECF_NOTHROW | ECF_LEAF | ECF_RET1);
9940 /* If we're checking the stack, `alloca' can throw. */
9941 const int alloca_flags
9942 = ECF_MALLOC | ECF_LEAF | (flag_stack_check ? 0 : ECF_NOTHROW);
9944 if (!builtin_decl_explicit_p (BUILT_IN_ALLOCA))
9946 ftype = build_function_type_list (ptr_type_node,
9947 size_type_node, NULL_TREE);
9948 local_define_builtin ("__builtin_alloca", ftype, BUILT_IN_ALLOCA,
9949 "alloca", alloca_flags);
9952 ftype = build_function_type_list (ptr_type_node, size_type_node,
9953 size_type_node, NULL_TREE);
9954 local_define_builtin ("__builtin_alloca_with_align", ftype,
9955 BUILT_IN_ALLOCA_WITH_ALIGN,
9956 "__builtin_alloca_with_align",
9957 alloca_flags);
9959 ftype = build_function_type_list (void_type_node,
9960 ptr_type_node, ptr_type_node,
9961 ptr_type_node, NULL_TREE);
9962 local_define_builtin ("__builtin_init_trampoline", ftype,
9963 BUILT_IN_INIT_TRAMPOLINE,
9964 "__builtin_init_trampoline", ECF_NOTHROW | ECF_LEAF);
9965 local_define_builtin ("__builtin_init_heap_trampoline", ftype,
9966 BUILT_IN_INIT_HEAP_TRAMPOLINE,
9967 "__builtin_init_heap_trampoline",
9968 ECF_NOTHROW | ECF_LEAF);
9969 local_define_builtin ("__builtin_init_descriptor", ftype,
9970 BUILT_IN_INIT_DESCRIPTOR,
9971 "__builtin_init_descriptor", ECF_NOTHROW | ECF_LEAF);
9973 ftype = build_function_type_list (ptr_type_node, ptr_type_node, NULL_TREE);
9974 local_define_builtin ("__builtin_adjust_trampoline", ftype,
9975 BUILT_IN_ADJUST_TRAMPOLINE,
9976 "__builtin_adjust_trampoline",
9977 ECF_CONST | ECF_NOTHROW);
9978 local_define_builtin ("__builtin_adjust_descriptor", ftype,
9979 BUILT_IN_ADJUST_DESCRIPTOR,
9980 "__builtin_adjust_descriptor",
9981 ECF_CONST | ECF_NOTHROW);
9983 ftype = build_function_type_list (void_type_node,
9984 ptr_type_node, ptr_type_node, NULL_TREE);
9985 local_define_builtin ("__builtin_nonlocal_goto", ftype,
9986 BUILT_IN_NONLOCAL_GOTO,
9987 "__builtin_nonlocal_goto",
9988 ECF_NORETURN | ECF_NOTHROW);
9990 ftype = build_function_type_list (void_type_node,
9991 ptr_type_node, ptr_type_node, NULL_TREE);
9992 local_define_builtin ("__builtin_setjmp_setup", ftype,
9993 BUILT_IN_SETJMP_SETUP,
9994 "__builtin_setjmp_setup", ECF_NOTHROW);
9996 ftype = build_function_type_list (void_type_node, ptr_type_node, NULL_TREE);
9997 local_define_builtin ("__builtin_setjmp_receiver", ftype,
9998 BUILT_IN_SETJMP_RECEIVER,
9999 "__builtin_setjmp_receiver", ECF_NOTHROW | ECF_LEAF);
10001 ftype = build_function_type_list (ptr_type_node, NULL_TREE);
10002 local_define_builtin ("__builtin_stack_save", ftype, BUILT_IN_STACK_SAVE,
10003 "__builtin_stack_save", ECF_NOTHROW | ECF_LEAF);
10005 ftype = build_function_type_list (void_type_node, ptr_type_node, NULL_TREE);
10006 local_define_builtin ("__builtin_stack_restore", ftype,
10007 BUILT_IN_STACK_RESTORE,
10008 "__builtin_stack_restore", ECF_NOTHROW | ECF_LEAF);
10010 ftype = build_function_type_list (integer_type_node, const_ptr_type_node,
10011 const_ptr_type_node, size_type_node,
10012 NULL_TREE);
10013 local_define_builtin ("__builtin_memcmp_eq", ftype, BUILT_IN_MEMCMP_EQ,
10014 "__builtin_memcmp_eq",
10015 ECF_PURE | ECF_NOTHROW | ECF_LEAF);
10017 /* If there's a possibility that we might use the ARM EABI, build the
10018 alternate __cxa_end_cleanup node used to resume from C++. */
10019 if (targetm.arm_eabi_unwinder)
10021 ftype = build_function_type_list (void_type_node, NULL_TREE);
10022 local_define_builtin ("__builtin_cxa_end_cleanup", ftype,
10023 BUILT_IN_CXA_END_CLEANUP,
10024 "__cxa_end_cleanup", ECF_NORETURN | ECF_LEAF);
10027 ftype = build_function_type_list (void_type_node, ptr_type_node, NULL_TREE);
10028 local_define_builtin ("__builtin_unwind_resume", ftype,
10029 BUILT_IN_UNWIND_RESUME,
10030 ((targetm_common.except_unwind_info (&global_options)
10031 == UI_SJLJ)
10032 ? "_Unwind_SjLj_Resume" : "_Unwind_Resume"),
10033 ECF_NORETURN);
10035 if (builtin_decl_explicit (BUILT_IN_RETURN_ADDRESS) == NULL_TREE)
10037 ftype = build_function_type_list (ptr_type_node, integer_type_node,
10038 NULL_TREE);
10039 local_define_builtin ("__builtin_return_address", ftype,
10040 BUILT_IN_RETURN_ADDRESS,
10041 "__builtin_return_address",
10042 ECF_NOTHROW);
10045 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER)
10046 || !builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT))
10048 ftype = build_function_type_list (void_type_node, ptr_type_node,
10049 ptr_type_node, NULL_TREE);
10050 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER))
10051 local_define_builtin ("__cyg_profile_func_enter", ftype,
10052 BUILT_IN_PROFILE_FUNC_ENTER,
10053 "__cyg_profile_func_enter", 0);
10054 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT))
10055 local_define_builtin ("__cyg_profile_func_exit", ftype,
10056 BUILT_IN_PROFILE_FUNC_EXIT,
10057 "__cyg_profile_func_exit", 0);
10060 /* The exception object and filter values from the runtime. The argument
10061 must be zero before exception lowering, i.e. from the front end. After
10062 exception lowering, it will be the region number for the exception
10063 landing pad. These functions are PURE instead of CONST to prevent
10064 them from being hoisted past the exception edge that will initialize
10065 its value in the landing pad. */
10066 ftype = build_function_type_list (ptr_type_node,
10067 integer_type_node, NULL_TREE);
10068 ecf_flags = ECF_PURE | ECF_NOTHROW | ECF_LEAF;
10069 /* Only use TM_PURE if we have TM language support. */
10070 if (builtin_decl_explicit_p (BUILT_IN_TM_LOAD_1))
10071 ecf_flags |= ECF_TM_PURE;
10072 local_define_builtin ("__builtin_eh_pointer", ftype, BUILT_IN_EH_POINTER,
10073 "__builtin_eh_pointer", ecf_flags);
10075 tmp = lang_hooks.types.type_for_mode (targetm.eh_return_filter_mode (), 0);
10076 ftype = build_function_type_list (tmp, integer_type_node, NULL_TREE);
10077 local_define_builtin ("__builtin_eh_filter", ftype, BUILT_IN_EH_FILTER,
10078 "__builtin_eh_filter", ECF_PURE | ECF_NOTHROW | ECF_LEAF);
10080 ftype = build_function_type_list (void_type_node,
10081 integer_type_node, integer_type_node,
10082 NULL_TREE);
10083 local_define_builtin ("__builtin_eh_copy_values", ftype,
10084 BUILT_IN_EH_COPY_VALUES,
10085 "__builtin_eh_copy_values", ECF_NOTHROW);
10087 /* Complex multiplication and division. These are handled as builtins
10088 rather than optabs because emit_library_call_value doesn't support
10089 complex. Further, we can do slightly better with folding these
10090 beasties if the real and complex parts of the arguments are separate. */
10092 int mode;
10094 for (mode = MIN_MODE_COMPLEX_FLOAT; mode <= MAX_MODE_COMPLEX_FLOAT; ++mode)
10096 char mode_name_buf[4], *q;
10097 const char *p;
10098 enum built_in_function mcode, dcode;
10099 tree type, inner_type;
10100 const char *prefix = "__";
10102 if (targetm.libfunc_gnu_prefix)
10103 prefix = "__gnu_";
10105 type = lang_hooks.types.type_for_mode ((machine_mode) mode, 0);
10106 if (type == NULL)
10107 continue;
10108 inner_type = TREE_TYPE (type);
10110 ftype = build_function_type_list (type, inner_type, inner_type,
10111 inner_type, inner_type, NULL_TREE);
10113 mcode = ((enum built_in_function)
10114 (BUILT_IN_COMPLEX_MUL_MIN + mode - MIN_MODE_COMPLEX_FLOAT));
10115 dcode = ((enum built_in_function)
10116 (BUILT_IN_COMPLEX_DIV_MIN + mode - MIN_MODE_COMPLEX_FLOAT));
10118 for (p = GET_MODE_NAME (mode), q = mode_name_buf; *p; p++, q++)
10119 *q = TOLOWER (*p);
10120 *q = '\0';
10122 built_in_names[mcode] = concat (prefix, "mul", mode_name_buf, "3",
10123 NULL);
10124 local_define_builtin (built_in_names[mcode], ftype, mcode,
10125 built_in_names[mcode],
10126 ECF_CONST | ECF_NOTHROW | ECF_LEAF);
10128 built_in_names[dcode] = concat (prefix, "div", mode_name_buf, "3",
10129 NULL);
10130 local_define_builtin (built_in_names[dcode], ftype, dcode,
10131 built_in_names[dcode],
10132 ECF_CONST | ECF_NOTHROW | ECF_LEAF);
10136 init_internal_fns ();
10139 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
10140 better way.
10142 If we requested a pointer to a vector, build up the pointers that
10143 we stripped off while looking for the inner type. Similarly for
10144 return values from functions.
10146 The argument TYPE is the top of the chain, and BOTTOM is the
10147 new type which we will point to. */
10149 tree
10150 reconstruct_complex_type (tree type, tree bottom)
10152 tree inner, outer;
10154 if (TREE_CODE (type) == POINTER_TYPE)
10156 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
10157 outer = build_pointer_type_for_mode (inner, TYPE_MODE (type),
10158 TYPE_REF_CAN_ALIAS_ALL (type));
10160 else if (TREE_CODE (type) == REFERENCE_TYPE)
10162 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
10163 outer = build_reference_type_for_mode (inner, TYPE_MODE (type),
10164 TYPE_REF_CAN_ALIAS_ALL (type));
10166 else if (TREE_CODE (type) == ARRAY_TYPE)
10168 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
10169 outer = build_array_type (inner, TYPE_DOMAIN (type));
10171 else if (TREE_CODE (type) == FUNCTION_TYPE)
10173 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
10174 outer = build_function_type (inner, TYPE_ARG_TYPES (type));
10176 else if (TREE_CODE (type) == METHOD_TYPE)
10178 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
10179 /* The build_method_type_directly() routine prepends 'this' to argument list,
10180 so we must compensate by getting rid of it. */
10181 outer
10182 = build_method_type_directly
10183 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type))),
10184 inner,
10185 TREE_CHAIN (TYPE_ARG_TYPES (type)));
10187 else if (TREE_CODE (type) == OFFSET_TYPE)
10189 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
10190 outer = build_offset_type (TYPE_OFFSET_BASETYPE (type), inner);
10192 else
10193 return bottom;
10195 return build_type_attribute_qual_variant (outer, TYPE_ATTRIBUTES (type),
10196 TYPE_QUALS (type));
10199 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
10200 the inner type. */
10201 tree
10202 build_vector_type_for_mode (tree innertype, machine_mode mode)
10204 int nunits;
10205 unsigned int bitsize;
10207 switch (GET_MODE_CLASS (mode))
10209 case MODE_VECTOR_INT:
10210 case MODE_VECTOR_FLOAT:
10211 case MODE_VECTOR_FRACT:
10212 case MODE_VECTOR_UFRACT:
10213 case MODE_VECTOR_ACCUM:
10214 case MODE_VECTOR_UACCUM:
10215 nunits = GET_MODE_NUNITS (mode);
10216 break;
10218 case MODE_INT:
10219 /* Check that there are no leftover bits. */
10220 bitsize = GET_MODE_BITSIZE (as_a <scalar_int_mode> (mode));
10221 gcc_assert (bitsize % TREE_INT_CST_LOW (TYPE_SIZE (innertype)) == 0);
10222 nunits = bitsize / TREE_INT_CST_LOW (TYPE_SIZE (innertype));
10223 break;
10225 default:
10226 gcc_unreachable ();
10229 return make_vector_type (innertype, nunits, mode);
10232 /* Similarly, but takes the inner type and number of units, which must be
10233 a power of two. */
10235 tree
10236 build_vector_type (tree innertype, int nunits)
10238 return make_vector_type (innertype, nunits, VOIDmode);
10241 /* Build truth vector with specified length and number of units. */
10243 tree
10244 build_truth_vector_type (unsigned nunits, unsigned vector_size)
10246 machine_mode mask_mode
10247 = targetm.vectorize.get_mask_mode (nunits, vector_size).else_blk ();
10249 unsigned HOST_WIDE_INT vsize;
10250 if (mask_mode == BLKmode)
10251 vsize = vector_size * BITS_PER_UNIT;
10252 else
10253 vsize = GET_MODE_BITSIZE (mask_mode);
10255 unsigned HOST_WIDE_INT esize = vsize / nunits;
10256 gcc_assert (esize * nunits == vsize);
10258 tree bool_type = build_nonstandard_boolean_type (esize);
10260 return make_vector_type (bool_type, nunits, mask_mode);
10263 /* Returns a vector type corresponding to a comparison of VECTYPE. */
10265 tree
10266 build_same_sized_truth_vector_type (tree vectype)
10268 if (VECTOR_BOOLEAN_TYPE_P (vectype))
10269 return vectype;
10271 unsigned HOST_WIDE_INT size = GET_MODE_SIZE (TYPE_MODE (vectype));
10273 if (!size)
10274 size = tree_to_uhwi (TYPE_SIZE_UNIT (vectype));
10276 return build_truth_vector_type (TYPE_VECTOR_SUBPARTS (vectype), size);
10279 /* Similarly, but builds a variant type with TYPE_VECTOR_OPAQUE set. */
10281 tree
10282 build_opaque_vector_type (tree innertype, int nunits)
10284 tree t = make_vector_type (innertype, nunits, VOIDmode);
10285 tree cand;
10286 /* We always build the non-opaque variant before the opaque one,
10287 so if it already exists, it is TYPE_NEXT_VARIANT of this one. */
10288 cand = TYPE_NEXT_VARIANT (t);
10289 if (cand
10290 && TYPE_VECTOR_OPAQUE (cand)
10291 && check_qualified_type (cand, t, TYPE_QUALS (t)))
10292 return cand;
10293 /* Othewise build a variant type and make sure to queue it after
10294 the non-opaque type. */
10295 cand = build_distinct_type_copy (t);
10296 TYPE_VECTOR_OPAQUE (cand) = true;
10297 TYPE_CANONICAL (cand) = TYPE_CANONICAL (t);
10298 TYPE_NEXT_VARIANT (cand) = TYPE_NEXT_VARIANT (t);
10299 TYPE_NEXT_VARIANT (t) = cand;
10300 TYPE_MAIN_VARIANT (cand) = TYPE_MAIN_VARIANT (t);
10301 return cand;
10305 /* Given an initializer INIT, return TRUE if INIT is zero or some
10306 aggregate of zeros. Otherwise return FALSE. */
10307 bool
10308 initializer_zerop (const_tree init)
10310 tree elt;
10312 STRIP_NOPS (init);
10314 switch (TREE_CODE (init))
10316 case INTEGER_CST:
10317 return integer_zerop (init);
10319 case REAL_CST:
10320 /* ??? Note that this is not correct for C4X float formats. There,
10321 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
10322 negative exponent. */
10323 return real_zerop (init)
10324 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init));
10326 case FIXED_CST:
10327 return fixed_zerop (init);
10329 case COMPLEX_CST:
10330 return integer_zerop (init)
10331 || (real_zerop (init)
10332 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init)))
10333 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init))));
10335 case VECTOR_CST:
10337 unsigned i;
10338 for (i = 0; i < VECTOR_CST_NELTS (init); ++i)
10339 if (!initializer_zerop (VECTOR_CST_ELT (init, i)))
10340 return false;
10341 return true;
10344 case CONSTRUCTOR:
10346 unsigned HOST_WIDE_INT idx;
10348 if (TREE_CLOBBER_P (init))
10349 return false;
10350 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init), idx, elt)
10351 if (!initializer_zerop (elt))
10352 return false;
10353 return true;
10356 case STRING_CST:
10358 int i;
10360 /* We need to loop through all elements to handle cases like
10361 "\0" and "\0foobar". */
10362 for (i = 0; i < TREE_STRING_LENGTH (init); ++i)
10363 if (TREE_STRING_POINTER (init)[i] != '\0')
10364 return false;
10366 return true;
10369 default:
10370 return false;
10374 /* Check if vector VEC consists of all the equal elements and
10375 that the number of elements corresponds to the type of VEC.
10376 The function returns first element of the vector
10377 or NULL_TREE if the vector is not uniform. */
10378 tree
10379 uniform_vector_p (const_tree vec)
10381 tree first, t;
10382 unsigned i;
10384 if (vec == NULL_TREE)
10385 return NULL_TREE;
10387 gcc_assert (VECTOR_TYPE_P (TREE_TYPE (vec)));
10389 if (TREE_CODE (vec) == VECTOR_CST)
10391 first = VECTOR_CST_ELT (vec, 0);
10392 for (i = 1; i < VECTOR_CST_NELTS (vec); ++i)
10393 if (!operand_equal_p (first, VECTOR_CST_ELT (vec, i), 0))
10394 return NULL_TREE;
10396 return first;
10399 else if (TREE_CODE (vec) == CONSTRUCTOR)
10401 first = error_mark_node;
10403 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (vec), i, t)
10405 if (i == 0)
10407 first = t;
10408 continue;
10410 if (!operand_equal_p (first, t, 0))
10411 return NULL_TREE;
10413 if (i != TYPE_VECTOR_SUBPARTS (TREE_TYPE (vec)))
10414 return NULL_TREE;
10416 return first;
10419 return NULL_TREE;
10422 /* Build an empty statement at location LOC. */
10424 tree
10425 build_empty_stmt (location_t loc)
10427 tree t = build1 (NOP_EXPR, void_type_node, size_zero_node);
10428 SET_EXPR_LOCATION (t, loc);
10429 return t;
10433 /* Build an OpenMP clause with code CODE. LOC is the location of the
10434 clause. */
10436 tree
10437 build_omp_clause (location_t loc, enum omp_clause_code code)
10439 tree t;
10440 int size, length;
10442 length = omp_clause_num_ops[code];
10443 size = (sizeof (struct tree_omp_clause) + (length - 1) * sizeof (tree));
10445 record_node_allocation_statistics (OMP_CLAUSE, size);
10447 t = (tree) ggc_internal_alloc (size);
10448 memset (t, 0, size);
10449 TREE_SET_CODE (t, OMP_CLAUSE);
10450 OMP_CLAUSE_SET_CODE (t, code);
10451 OMP_CLAUSE_LOCATION (t) = loc;
10453 return t;
10456 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
10457 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
10458 Except for the CODE and operand count field, other storage for the
10459 object is initialized to zeros. */
10461 tree
10462 build_vl_exp (enum tree_code code, int len MEM_STAT_DECL)
10464 tree t;
10465 int length = (len - 1) * sizeof (tree) + sizeof (struct tree_exp);
10467 gcc_assert (TREE_CODE_CLASS (code) == tcc_vl_exp);
10468 gcc_assert (len >= 1);
10470 record_node_allocation_statistics (code, length);
10472 t = ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT);
10474 TREE_SET_CODE (t, code);
10476 /* Can't use TREE_OPERAND to store the length because if checking is
10477 enabled, it will try to check the length before we store it. :-P */
10478 t->exp.operands[0] = build_int_cst (sizetype, len);
10480 return t;
10483 /* Helper function for build_call_* functions; build a CALL_EXPR with
10484 indicated RETURN_TYPE, FN, and NARGS, but do not initialize any of
10485 the argument slots. */
10487 static tree
10488 build_call_1 (tree return_type, tree fn, int nargs)
10490 tree t;
10492 t = build_vl_exp (CALL_EXPR, nargs + 3);
10493 TREE_TYPE (t) = return_type;
10494 CALL_EXPR_FN (t) = fn;
10495 CALL_EXPR_STATIC_CHAIN (t) = NULL;
10497 return t;
10500 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10501 FN and a null static chain slot. NARGS is the number of call arguments
10502 which are specified as "..." arguments. */
10504 tree
10505 build_call_nary (tree return_type, tree fn, int nargs, ...)
10507 tree ret;
10508 va_list args;
10509 va_start (args, nargs);
10510 ret = build_call_valist (return_type, fn, nargs, args);
10511 va_end (args);
10512 return ret;
10515 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10516 FN and a null static chain slot. NARGS is the number of call arguments
10517 which are specified as a va_list ARGS. */
10519 tree
10520 build_call_valist (tree return_type, tree fn, int nargs, va_list args)
10522 tree t;
10523 int i;
10525 t = build_call_1 (return_type, fn, nargs);
10526 for (i = 0; i < nargs; i++)
10527 CALL_EXPR_ARG (t, i) = va_arg (args, tree);
10528 process_call_operands (t);
10529 return t;
10532 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10533 FN and a null static chain slot. NARGS is the number of call arguments
10534 which are specified as a tree array ARGS. */
10536 tree
10537 build_call_array_loc (location_t loc, tree return_type, tree fn,
10538 int nargs, const tree *args)
10540 tree t;
10541 int i;
10543 t = build_call_1 (return_type, fn, nargs);
10544 for (i = 0; i < nargs; i++)
10545 CALL_EXPR_ARG (t, i) = args[i];
10546 process_call_operands (t);
10547 SET_EXPR_LOCATION (t, loc);
10548 return t;
10551 /* Like build_call_array, but takes a vec. */
10553 tree
10554 build_call_vec (tree return_type, tree fn, vec<tree, va_gc> *args)
10556 tree ret, t;
10557 unsigned int ix;
10559 ret = build_call_1 (return_type, fn, vec_safe_length (args));
10560 FOR_EACH_VEC_SAFE_ELT (args, ix, t)
10561 CALL_EXPR_ARG (ret, ix) = t;
10562 process_call_operands (ret);
10563 return ret;
10566 /* Conveniently construct a function call expression. FNDECL names the
10567 function to be called and N arguments are passed in the array
10568 ARGARRAY. */
10570 tree
10571 build_call_expr_loc_array (location_t loc, tree fndecl, int n, tree *argarray)
10573 tree fntype = TREE_TYPE (fndecl);
10574 tree fn = build1 (ADDR_EXPR, build_pointer_type (fntype), fndecl);
10576 return fold_build_call_array_loc (loc, TREE_TYPE (fntype), fn, n, argarray);
10579 /* Conveniently construct a function call expression. FNDECL names the
10580 function to be called and the arguments are passed in the vector
10581 VEC. */
10583 tree
10584 build_call_expr_loc_vec (location_t loc, tree fndecl, vec<tree, va_gc> *vec)
10586 return build_call_expr_loc_array (loc, fndecl, vec_safe_length (vec),
10587 vec_safe_address (vec));
10591 /* Conveniently construct a function call expression. FNDECL names the
10592 function to be called, N is the number of arguments, and the "..."
10593 parameters are the argument expressions. */
10595 tree
10596 build_call_expr_loc (location_t loc, tree fndecl, int n, ...)
10598 va_list ap;
10599 tree *argarray = XALLOCAVEC (tree, n);
10600 int i;
10602 va_start (ap, n);
10603 for (i = 0; i < n; i++)
10604 argarray[i] = va_arg (ap, tree);
10605 va_end (ap);
10606 return build_call_expr_loc_array (loc, fndecl, n, argarray);
10609 /* Like build_call_expr_loc (UNKNOWN_LOCATION, ...). Duplicated because
10610 varargs macros aren't supported by all bootstrap compilers. */
10612 tree
10613 build_call_expr (tree fndecl, int n, ...)
10615 va_list ap;
10616 tree *argarray = XALLOCAVEC (tree, n);
10617 int i;
10619 va_start (ap, n);
10620 for (i = 0; i < n; i++)
10621 argarray[i] = va_arg (ap, tree);
10622 va_end (ap);
10623 return build_call_expr_loc_array (UNKNOWN_LOCATION, fndecl, n, argarray);
10626 /* Build an internal call to IFN, with arguments ARGS[0:N-1] and with return
10627 type TYPE. This is just like CALL_EXPR, except its CALL_EXPR_FN is NULL.
10628 It will get gimplified later into an ordinary internal function. */
10630 tree
10631 build_call_expr_internal_loc_array (location_t loc, internal_fn ifn,
10632 tree type, int n, const tree *args)
10634 tree t = build_call_1 (type, NULL_TREE, n);
10635 for (int i = 0; i < n; ++i)
10636 CALL_EXPR_ARG (t, i) = args[i];
10637 SET_EXPR_LOCATION (t, loc);
10638 CALL_EXPR_IFN (t) = ifn;
10639 return t;
10642 /* Build internal call expression. This is just like CALL_EXPR, except
10643 its CALL_EXPR_FN is NULL. It will get gimplified later into ordinary
10644 internal function. */
10646 tree
10647 build_call_expr_internal_loc (location_t loc, enum internal_fn ifn,
10648 tree type, int n, ...)
10650 va_list ap;
10651 tree *argarray = XALLOCAVEC (tree, n);
10652 int i;
10654 va_start (ap, n);
10655 for (i = 0; i < n; i++)
10656 argarray[i] = va_arg (ap, tree);
10657 va_end (ap);
10658 return build_call_expr_internal_loc_array (loc, ifn, type, n, argarray);
10661 /* Return a function call to FN, if the target is guaranteed to support it,
10662 or null otherwise.
10664 N is the number of arguments, passed in the "...", and TYPE is the
10665 type of the return value. */
10667 tree
10668 maybe_build_call_expr_loc (location_t loc, combined_fn fn, tree type,
10669 int n, ...)
10671 va_list ap;
10672 tree *argarray = XALLOCAVEC (tree, n);
10673 int i;
10675 va_start (ap, n);
10676 for (i = 0; i < n; i++)
10677 argarray[i] = va_arg (ap, tree);
10678 va_end (ap);
10679 if (internal_fn_p (fn))
10681 internal_fn ifn = as_internal_fn (fn);
10682 if (direct_internal_fn_p (ifn))
10684 tree_pair types = direct_internal_fn_types (ifn, type, argarray);
10685 if (!direct_internal_fn_supported_p (ifn, types,
10686 OPTIMIZE_FOR_BOTH))
10687 return NULL_TREE;
10689 return build_call_expr_internal_loc_array (loc, ifn, type, n, argarray);
10691 else
10693 tree fndecl = builtin_decl_implicit (as_builtin_fn (fn));
10694 if (!fndecl)
10695 return NULL_TREE;
10696 return build_call_expr_loc_array (loc, fndecl, n, argarray);
10700 /* Create a new constant string literal and return a char* pointer to it.
10701 The STRING_CST value is the LEN characters at STR. */
10702 tree
10703 build_string_literal (int len, const char *str)
10705 tree t, elem, index, type;
10707 t = build_string (len, str);
10708 elem = build_type_variant (char_type_node, 1, 0);
10709 index = build_index_type (size_int (len - 1));
10710 type = build_array_type (elem, index);
10711 TREE_TYPE (t) = type;
10712 TREE_CONSTANT (t) = 1;
10713 TREE_READONLY (t) = 1;
10714 TREE_STATIC (t) = 1;
10716 type = build_pointer_type (elem);
10717 t = build1 (ADDR_EXPR, type,
10718 build4 (ARRAY_REF, elem,
10719 t, integer_zero_node, NULL_TREE, NULL_TREE));
10720 return t;
10725 /* Return true if T (assumed to be a DECL) must be assigned a memory
10726 location. */
10728 bool
10729 needs_to_live_in_memory (const_tree t)
10731 return (TREE_ADDRESSABLE (t)
10732 || is_global_var (t)
10733 || (TREE_CODE (t) == RESULT_DECL
10734 && !DECL_BY_REFERENCE (t)
10735 && aggregate_value_p (t, current_function_decl)));
10738 /* Return value of a constant X and sign-extend it. */
10740 HOST_WIDE_INT
10741 int_cst_value (const_tree x)
10743 unsigned bits = TYPE_PRECISION (TREE_TYPE (x));
10744 unsigned HOST_WIDE_INT val = TREE_INT_CST_LOW (x);
10746 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
10747 gcc_assert (cst_and_fits_in_hwi (x));
10749 if (bits < HOST_BITS_PER_WIDE_INT)
10751 bool negative = ((val >> (bits - 1)) & 1) != 0;
10752 if (negative)
10753 val |= HOST_WIDE_INT_M1U << (bits - 1) << 1;
10754 else
10755 val &= ~(HOST_WIDE_INT_M1U << (bits - 1) << 1);
10758 return val;
10761 /* If TYPE is an integral or pointer type, return an integer type with
10762 the same precision which is unsigned iff UNSIGNEDP is true, or itself
10763 if TYPE is already an integer type of signedness UNSIGNEDP. */
10765 tree
10766 signed_or_unsigned_type_for (int unsignedp, tree type)
10768 if (TREE_CODE (type) == INTEGER_TYPE && TYPE_UNSIGNED (type) == unsignedp)
10769 return type;
10771 if (TREE_CODE (type) == VECTOR_TYPE)
10773 tree inner = TREE_TYPE (type);
10774 tree inner2 = signed_or_unsigned_type_for (unsignedp, inner);
10775 if (!inner2)
10776 return NULL_TREE;
10777 if (inner == inner2)
10778 return type;
10779 return build_vector_type (inner2, TYPE_VECTOR_SUBPARTS (type));
10782 if (!INTEGRAL_TYPE_P (type)
10783 && !POINTER_TYPE_P (type)
10784 && TREE_CODE (type) != OFFSET_TYPE)
10785 return NULL_TREE;
10787 return build_nonstandard_integer_type (TYPE_PRECISION (type), unsignedp);
10790 /* If TYPE is an integral or pointer type, return an integer type with
10791 the same precision which is unsigned, or itself if TYPE is already an
10792 unsigned integer type. */
10794 tree
10795 unsigned_type_for (tree type)
10797 return signed_or_unsigned_type_for (1, type);
10800 /* If TYPE is an integral or pointer type, return an integer type with
10801 the same precision which is signed, or itself if TYPE is already a
10802 signed integer type. */
10804 tree
10805 signed_type_for (tree type)
10807 return signed_or_unsigned_type_for (0, type);
10810 /* If TYPE is a vector type, return a signed integer vector type with the
10811 same width and number of subparts. Otherwise return boolean_type_node. */
10813 tree
10814 truth_type_for (tree type)
10816 if (TREE_CODE (type) == VECTOR_TYPE)
10818 if (VECTOR_BOOLEAN_TYPE_P (type))
10819 return type;
10820 return build_truth_vector_type (TYPE_VECTOR_SUBPARTS (type),
10821 GET_MODE_SIZE (TYPE_MODE (type)));
10823 else
10824 return boolean_type_node;
10827 /* Returns the largest value obtainable by casting something in INNER type to
10828 OUTER type. */
10830 tree
10831 upper_bound_in_type (tree outer, tree inner)
10833 unsigned int det = 0;
10834 unsigned oprec = TYPE_PRECISION (outer);
10835 unsigned iprec = TYPE_PRECISION (inner);
10836 unsigned prec;
10838 /* Compute a unique number for every combination. */
10839 det |= (oprec > iprec) ? 4 : 0;
10840 det |= TYPE_UNSIGNED (outer) ? 2 : 0;
10841 det |= TYPE_UNSIGNED (inner) ? 1 : 0;
10843 /* Determine the exponent to use. */
10844 switch (det)
10846 case 0:
10847 case 1:
10848 /* oprec <= iprec, outer: signed, inner: don't care. */
10849 prec = oprec - 1;
10850 break;
10851 case 2:
10852 case 3:
10853 /* oprec <= iprec, outer: unsigned, inner: don't care. */
10854 prec = oprec;
10855 break;
10856 case 4:
10857 /* oprec > iprec, outer: signed, inner: signed. */
10858 prec = iprec - 1;
10859 break;
10860 case 5:
10861 /* oprec > iprec, outer: signed, inner: unsigned. */
10862 prec = iprec;
10863 break;
10864 case 6:
10865 /* oprec > iprec, outer: unsigned, inner: signed. */
10866 prec = oprec;
10867 break;
10868 case 7:
10869 /* oprec > iprec, outer: unsigned, inner: unsigned. */
10870 prec = iprec;
10871 break;
10872 default:
10873 gcc_unreachable ();
10876 return wide_int_to_tree (outer,
10877 wi::mask (prec, false, TYPE_PRECISION (outer)));
10880 /* Returns the smallest value obtainable by casting something in INNER type to
10881 OUTER type. */
10883 tree
10884 lower_bound_in_type (tree outer, tree inner)
10886 unsigned oprec = TYPE_PRECISION (outer);
10887 unsigned iprec = TYPE_PRECISION (inner);
10889 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
10890 and obtain 0. */
10891 if (TYPE_UNSIGNED (outer)
10892 /* If we are widening something of an unsigned type, OUTER type
10893 contains all values of INNER type. In particular, both INNER
10894 and OUTER types have zero in common. */
10895 || (oprec > iprec && TYPE_UNSIGNED (inner)))
10896 return build_int_cst (outer, 0);
10897 else
10899 /* If we are widening a signed type to another signed type, we
10900 want to obtain -2^^(iprec-1). If we are keeping the
10901 precision or narrowing to a signed type, we want to obtain
10902 -2^(oprec-1). */
10903 unsigned prec = oprec > iprec ? iprec : oprec;
10904 return wide_int_to_tree (outer,
10905 wi::mask (prec - 1, true,
10906 TYPE_PRECISION (outer)));
10910 /* Return nonzero if two operands that are suitable for PHI nodes are
10911 necessarily equal. Specifically, both ARG0 and ARG1 must be either
10912 SSA_NAME or invariant. Note that this is strictly an optimization.
10913 That is, callers of this function can directly call operand_equal_p
10914 and get the same result, only slower. */
10917 operand_equal_for_phi_arg_p (const_tree arg0, const_tree arg1)
10919 if (arg0 == arg1)
10920 return 1;
10921 if (TREE_CODE (arg0) == SSA_NAME || TREE_CODE (arg1) == SSA_NAME)
10922 return 0;
10923 return operand_equal_p (arg0, arg1, 0);
10926 /* Returns number of zeros at the end of binary representation of X. */
10928 tree
10929 num_ending_zeros (const_tree x)
10931 return build_int_cst (TREE_TYPE (x), wi::ctz (x));
10935 #define WALK_SUBTREE(NODE) \
10936 do \
10938 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
10939 if (result) \
10940 return result; \
10942 while (0)
10944 /* This is a subroutine of walk_tree that walks field of TYPE that are to
10945 be walked whenever a type is seen in the tree. Rest of operands and return
10946 value are as for walk_tree. */
10948 static tree
10949 walk_type_fields (tree type, walk_tree_fn func, void *data,
10950 hash_set<tree> *pset, walk_tree_lh lh)
10952 tree result = NULL_TREE;
10954 switch (TREE_CODE (type))
10956 case POINTER_TYPE:
10957 case REFERENCE_TYPE:
10958 case VECTOR_TYPE:
10959 /* We have to worry about mutually recursive pointers. These can't
10960 be written in C. They can in Ada. It's pathological, but
10961 there's an ACATS test (c38102a) that checks it. Deal with this
10962 by checking if we're pointing to another pointer, that one
10963 points to another pointer, that one does too, and we have no htab.
10964 If so, get a hash table. We check three levels deep to avoid
10965 the cost of the hash table if we don't need one. */
10966 if (POINTER_TYPE_P (TREE_TYPE (type))
10967 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type)))
10968 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type))))
10969 && !pset)
10971 result = walk_tree_without_duplicates (&TREE_TYPE (type),
10972 func, data);
10973 if (result)
10974 return result;
10976 break;
10979 /* fall through */
10981 case COMPLEX_TYPE:
10982 WALK_SUBTREE (TREE_TYPE (type));
10983 break;
10985 case METHOD_TYPE:
10986 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type));
10988 /* Fall through. */
10990 case FUNCTION_TYPE:
10991 WALK_SUBTREE (TREE_TYPE (type));
10993 tree arg;
10995 /* We never want to walk into default arguments. */
10996 for (arg = TYPE_ARG_TYPES (type); arg; arg = TREE_CHAIN (arg))
10997 WALK_SUBTREE (TREE_VALUE (arg));
10999 break;
11001 case ARRAY_TYPE:
11002 /* Don't follow this nodes's type if a pointer for fear that
11003 we'll have infinite recursion. If we have a PSET, then we
11004 need not fear. */
11005 if (pset
11006 || (!POINTER_TYPE_P (TREE_TYPE (type))
11007 && TREE_CODE (TREE_TYPE (type)) != OFFSET_TYPE))
11008 WALK_SUBTREE (TREE_TYPE (type));
11009 WALK_SUBTREE (TYPE_DOMAIN (type));
11010 break;
11012 case OFFSET_TYPE:
11013 WALK_SUBTREE (TREE_TYPE (type));
11014 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type));
11015 break;
11017 default:
11018 break;
11021 return NULL_TREE;
11024 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
11025 called with the DATA and the address of each sub-tree. If FUNC returns a
11026 non-NULL value, the traversal is stopped, and the value returned by FUNC
11027 is returned. If PSET is non-NULL it is used to record the nodes visited,
11028 and to avoid visiting a node more than once. */
11030 tree
11031 walk_tree_1 (tree *tp, walk_tree_fn func, void *data,
11032 hash_set<tree> *pset, walk_tree_lh lh)
11034 enum tree_code code;
11035 int walk_subtrees;
11036 tree result;
11038 #define WALK_SUBTREE_TAIL(NODE) \
11039 do \
11041 tp = & (NODE); \
11042 goto tail_recurse; \
11044 while (0)
11046 tail_recurse:
11047 /* Skip empty subtrees. */
11048 if (!*tp)
11049 return NULL_TREE;
11051 /* Don't walk the same tree twice, if the user has requested
11052 that we avoid doing so. */
11053 if (pset && pset->add (*tp))
11054 return NULL_TREE;
11056 /* Call the function. */
11057 walk_subtrees = 1;
11058 result = (*func) (tp, &walk_subtrees, data);
11060 /* If we found something, return it. */
11061 if (result)
11062 return result;
11064 code = TREE_CODE (*tp);
11066 /* Even if we didn't, FUNC may have decided that there was nothing
11067 interesting below this point in the tree. */
11068 if (!walk_subtrees)
11070 /* But we still need to check our siblings. */
11071 if (code == TREE_LIST)
11072 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp));
11073 else if (code == OMP_CLAUSE)
11074 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
11075 else
11076 return NULL_TREE;
11079 if (lh)
11081 result = (*lh) (tp, &walk_subtrees, func, data, pset);
11082 if (result || !walk_subtrees)
11083 return result;
11086 switch (code)
11088 case ERROR_MARK:
11089 case IDENTIFIER_NODE:
11090 case INTEGER_CST:
11091 case REAL_CST:
11092 case FIXED_CST:
11093 case VECTOR_CST:
11094 case STRING_CST:
11095 case BLOCK:
11096 case PLACEHOLDER_EXPR:
11097 case SSA_NAME:
11098 case FIELD_DECL:
11099 case RESULT_DECL:
11100 /* None of these have subtrees other than those already walked
11101 above. */
11102 break;
11104 case TREE_LIST:
11105 WALK_SUBTREE (TREE_VALUE (*tp));
11106 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp));
11107 break;
11109 case TREE_VEC:
11111 int len = TREE_VEC_LENGTH (*tp);
11113 if (len == 0)
11114 break;
11116 /* Walk all elements but the first. */
11117 while (--len)
11118 WALK_SUBTREE (TREE_VEC_ELT (*tp, len));
11120 /* Now walk the first one as a tail call. */
11121 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp, 0));
11124 case COMPLEX_CST:
11125 WALK_SUBTREE (TREE_REALPART (*tp));
11126 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp));
11128 case CONSTRUCTOR:
11130 unsigned HOST_WIDE_INT idx;
11131 constructor_elt *ce;
11133 for (idx = 0; vec_safe_iterate (CONSTRUCTOR_ELTS (*tp), idx, &ce);
11134 idx++)
11135 WALK_SUBTREE (ce->value);
11137 break;
11139 case SAVE_EXPR:
11140 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, 0));
11142 case BIND_EXPR:
11144 tree decl;
11145 for (decl = BIND_EXPR_VARS (*tp); decl; decl = DECL_CHAIN (decl))
11147 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
11148 into declarations that are just mentioned, rather than
11149 declared; they don't really belong to this part of the tree.
11150 And, we can see cycles: the initializer for a declaration
11151 can refer to the declaration itself. */
11152 WALK_SUBTREE (DECL_INITIAL (decl));
11153 WALK_SUBTREE (DECL_SIZE (decl));
11154 WALK_SUBTREE (DECL_SIZE_UNIT (decl));
11156 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp));
11159 case STATEMENT_LIST:
11161 tree_stmt_iterator i;
11162 for (i = tsi_start (*tp); !tsi_end_p (i); tsi_next (&i))
11163 WALK_SUBTREE (*tsi_stmt_ptr (i));
11165 break;
11167 case OMP_CLAUSE:
11168 switch (OMP_CLAUSE_CODE (*tp))
11170 case OMP_CLAUSE_GANG:
11171 case OMP_CLAUSE__GRIDDIM_:
11172 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, 1));
11173 /* FALLTHRU */
11175 case OMP_CLAUSE_ASYNC:
11176 case OMP_CLAUSE_WAIT:
11177 case OMP_CLAUSE_WORKER:
11178 case OMP_CLAUSE_VECTOR:
11179 case OMP_CLAUSE_NUM_GANGS:
11180 case OMP_CLAUSE_NUM_WORKERS:
11181 case OMP_CLAUSE_VECTOR_LENGTH:
11182 case OMP_CLAUSE_PRIVATE:
11183 case OMP_CLAUSE_SHARED:
11184 case OMP_CLAUSE_FIRSTPRIVATE:
11185 case OMP_CLAUSE_COPYIN:
11186 case OMP_CLAUSE_COPYPRIVATE:
11187 case OMP_CLAUSE_FINAL:
11188 case OMP_CLAUSE_IF:
11189 case OMP_CLAUSE_NUM_THREADS:
11190 case OMP_CLAUSE_SCHEDULE:
11191 case OMP_CLAUSE_UNIFORM:
11192 case OMP_CLAUSE_DEPEND:
11193 case OMP_CLAUSE_NUM_TEAMS:
11194 case OMP_CLAUSE_THREAD_LIMIT:
11195 case OMP_CLAUSE_DEVICE:
11196 case OMP_CLAUSE_DIST_SCHEDULE:
11197 case OMP_CLAUSE_SAFELEN:
11198 case OMP_CLAUSE_SIMDLEN:
11199 case OMP_CLAUSE_ORDERED:
11200 case OMP_CLAUSE_PRIORITY:
11201 case OMP_CLAUSE_GRAINSIZE:
11202 case OMP_CLAUSE_NUM_TASKS:
11203 case OMP_CLAUSE_HINT:
11204 case OMP_CLAUSE_TO_DECLARE:
11205 case OMP_CLAUSE_LINK:
11206 case OMP_CLAUSE_USE_DEVICE_PTR:
11207 case OMP_CLAUSE_IS_DEVICE_PTR:
11208 case OMP_CLAUSE__LOOPTEMP_:
11209 case OMP_CLAUSE__SIMDUID_:
11210 case OMP_CLAUSE__CILK_FOR_COUNT_:
11211 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, 0));
11212 /* FALLTHRU */
11214 case OMP_CLAUSE_INDEPENDENT:
11215 case OMP_CLAUSE_NOWAIT:
11216 case OMP_CLAUSE_DEFAULT:
11217 case OMP_CLAUSE_UNTIED:
11218 case OMP_CLAUSE_MERGEABLE:
11219 case OMP_CLAUSE_PROC_BIND:
11220 case OMP_CLAUSE_INBRANCH:
11221 case OMP_CLAUSE_NOTINBRANCH:
11222 case OMP_CLAUSE_FOR:
11223 case OMP_CLAUSE_PARALLEL:
11224 case OMP_CLAUSE_SECTIONS:
11225 case OMP_CLAUSE_TASKGROUP:
11226 case OMP_CLAUSE_NOGROUP:
11227 case OMP_CLAUSE_THREADS:
11228 case OMP_CLAUSE_SIMD:
11229 case OMP_CLAUSE_DEFAULTMAP:
11230 case OMP_CLAUSE_AUTO:
11231 case OMP_CLAUSE_SEQ:
11232 case OMP_CLAUSE_TILE:
11233 case OMP_CLAUSE__SIMT_:
11234 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
11236 case OMP_CLAUSE_LASTPRIVATE:
11237 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp));
11238 WALK_SUBTREE (OMP_CLAUSE_LASTPRIVATE_STMT (*tp));
11239 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
11241 case OMP_CLAUSE_COLLAPSE:
11243 int i;
11244 for (i = 0; i < 3; i++)
11245 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, i));
11246 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
11249 case OMP_CLAUSE_LINEAR:
11250 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp));
11251 WALK_SUBTREE (OMP_CLAUSE_LINEAR_STEP (*tp));
11252 WALK_SUBTREE (OMP_CLAUSE_LINEAR_STMT (*tp));
11253 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
11255 case OMP_CLAUSE_ALIGNED:
11256 case OMP_CLAUSE_FROM:
11257 case OMP_CLAUSE_TO:
11258 case OMP_CLAUSE_MAP:
11259 case OMP_CLAUSE__CACHE_:
11260 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp));
11261 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, 1));
11262 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
11264 case OMP_CLAUSE_REDUCTION:
11266 int i;
11267 for (i = 0; i < 5; i++)
11268 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, i));
11269 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
11272 default:
11273 gcc_unreachable ();
11275 break;
11277 case TARGET_EXPR:
11279 int i, len;
11281 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
11282 But, we only want to walk once. */
11283 len = (TREE_OPERAND (*tp, 3) == TREE_OPERAND (*tp, 1)) ? 2 : 3;
11284 for (i = 0; i < len; ++i)
11285 WALK_SUBTREE (TREE_OPERAND (*tp, i));
11286 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, len));
11289 case DECL_EXPR:
11290 /* If this is a TYPE_DECL, walk into the fields of the type that it's
11291 defining. We only want to walk into these fields of a type in this
11292 case and not in the general case of a mere reference to the type.
11294 The criterion is as follows: if the field can be an expression, it
11295 must be walked only here. This should be in keeping with the fields
11296 that are directly gimplified in gimplify_type_sizes in order for the
11297 mark/copy-if-shared/unmark machinery of the gimplifier to work with
11298 variable-sized types.
11300 Note that DECLs get walked as part of processing the BIND_EXPR. */
11301 if (TREE_CODE (DECL_EXPR_DECL (*tp)) == TYPE_DECL)
11303 tree *type_p = &TREE_TYPE (DECL_EXPR_DECL (*tp));
11304 if (TREE_CODE (*type_p) == ERROR_MARK)
11305 return NULL_TREE;
11307 /* Call the function for the type. See if it returns anything or
11308 doesn't want us to continue. If we are to continue, walk both
11309 the normal fields and those for the declaration case. */
11310 result = (*func) (type_p, &walk_subtrees, data);
11311 if (result || !walk_subtrees)
11312 return result;
11314 /* But do not walk a pointed-to type since it may itself need to
11315 be walked in the declaration case if it isn't anonymous. */
11316 if (!POINTER_TYPE_P (*type_p))
11318 result = walk_type_fields (*type_p, func, data, pset, lh);
11319 if (result)
11320 return result;
11323 /* If this is a record type, also walk the fields. */
11324 if (RECORD_OR_UNION_TYPE_P (*type_p))
11326 tree field;
11328 for (field = TYPE_FIELDS (*type_p); field;
11329 field = DECL_CHAIN (field))
11331 /* We'd like to look at the type of the field, but we can
11332 easily get infinite recursion. So assume it's pointed
11333 to elsewhere in the tree. Also, ignore things that
11334 aren't fields. */
11335 if (TREE_CODE (field) != FIELD_DECL)
11336 continue;
11338 WALK_SUBTREE (DECL_FIELD_OFFSET (field));
11339 WALK_SUBTREE (DECL_SIZE (field));
11340 WALK_SUBTREE (DECL_SIZE_UNIT (field));
11341 if (TREE_CODE (*type_p) == QUAL_UNION_TYPE)
11342 WALK_SUBTREE (DECL_QUALIFIER (field));
11346 /* Same for scalar types. */
11347 else if (TREE_CODE (*type_p) == BOOLEAN_TYPE
11348 || TREE_CODE (*type_p) == ENUMERAL_TYPE
11349 || TREE_CODE (*type_p) == INTEGER_TYPE
11350 || TREE_CODE (*type_p) == FIXED_POINT_TYPE
11351 || TREE_CODE (*type_p) == REAL_TYPE)
11353 WALK_SUBTREE (TYPE_MIN_VALUE (*type_p));
11354 WALK_SUBTREE (TYPE_MAX_VALUE (*type_p));
11357 WALK_SUBTREE (TYPE_SIZE (*type_p));
11358 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p));
11360 /* FALLTHRU */
11362 default:
11363 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code)))
11365 int i, len;
11367 /* Walk over all the sub-trees of this operand. */
11368 len = TREE_OPERAND_LENGTH (*tp);
11370 /* Go through the subtrees. We need to do this in forward order so
11371 that the scope of a FOR_EXPR is handled properly. */
11372 if (len)
11374 for (i = 0; i < len - 1; ++i)
11375 WALK_SUBTREE (TREE_OPERAND (*tp, i));
11376 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, len - 1));
11379 /* If this is a type, walk the needed fields in the type. */
11380 else if (TYPE_P (*tp))
11381 return walk_type_fields (*tp, func, data, pset, lh);
11382 break;
11385 /* We didn't find what we were looking for. */
11386 return NULL_TREE;
11388 #undef WALK_SUBTREE_TAIL
11390 #undef WALK_SUBTREE
11392 /* Like walk_tree, but does not walk duplicate nodes more than once. */
11394 tree
11395 walk_tree_without_duplicates_1 (tree *tp, walk_tree_fn func, void *data,
11396 walk_tree_lh lh)
11398 tree result;
11400 hash_set<tree> pset;
11401 result = walk_tree_1 (tp, func, data, &pset, lh);
11402 return result;
11406 tree
11407 tree_block (tree t)
11409 const enum tree_code_class c = TREE_CODE_CLASS (TREE_CODE (t));
11411 if (IS_EXPR_CODE_CLASS (c))
11412 return LOCATION_BLOCK (t->exp.locus);
11413 gcc_unreachable ();
11414 return NULL;
11417 void
11418 tree_set_block (tree t, tree b)
11420 const enum tree_code_class c = TREE_CODE_CLASS (TREE_CODE (t));
11422 if (IS_EXPR_CODE_CLASS (c))
11424 t->exp.locus = set_block (t->exp.locus, b);
11426 else
11427 gcc_unreachable ();
11430 /* Create a nameless artificial label and put it in the current
11431 function context. The label has a location of LOC. Returns the
11432 newly created label. */
11434 tree
11435 create_artificial_label (location_t loc)
11437 tree lab = build_decl (loc,
11438 LABEL_DECL, NULL_TREE, void_type_node);
11440 DECL_ARTIFICIAL (lab) = 1;
11441 DECL_IGNORED_P (lab) = 1;
11442 DECL_CONTEXT (lab) = current_function_decl;
11443 return lab;
11446 /* Given a tree, try to return a useful variable name that we can use
11447 to prefix a temporary that is being assigned the value of the tree.
11448 I.E. given <temp> = &A, return A. */
11450 const char *
11451 get_name (tree t)
11453 tree stripped_decl;
11455 stripped_decl = t;
11456 STRIP_NOPS (stripped_decl);
11457 if (DECL_P (stripped_decl) && DECL_NAME (stripped_decl))
11458 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl));
11459 else if (TREE_CODE (stripped_decl) == SSA_NAME)
11461 tree name = SSA_NAME_IDENTIFIER (stripped_decl);
11462 if (!name)
11463 return NULL;
11464 return IDENTIFIER_POINTER (name);
11466 else
11468 switch (TREE_CODE (stripped_decl))
11470 case ADDR_EXPR:
11471 return get_name (TREE_OPERAND (stripped_decl, 0));
11472 default:
11473 return NULL;
11478 /* Return true if TYPE has a variable argument list. */
11480 bool
11481 stdarg_p (const_tree fntype)
11483 function_args_iterator args_iter;
11484 tree n = NULL_TREE, t;
11486 if (!fntype)
11487 return false;
11489 FOREACH_FUNCTION_ARGS (fntype, t, args_iter)
11491 n = t;
11494 return n != NULL_TREE && n != void_type_node;
11497 /* Return true if TYPE has a prototype. */
11499 bool
11500 prototype_p (const_tree fntype)
11502 tree t;
11504 gcc_assert (fntype != NULL_TREE);
11506 t = TYPE_ARG_TYPES (fntype);
11507 return (t != NULL_TREE);
11510 /* If BLOCK is inlined from an __attribute__((__artificial__))
11511 routine, return pointer to location from where it has been
11512 called. */
11513 location_t *
11514 block_nonartificial_location (tree block)
11516 location_t *ret = NULL;
11518 while (block && TREE_CODE (block) == BLOCK
11519 && BLOCK_ABSTRACT_ORIGIN (block))
11521 tree ao = BLOCK_ABSTRACT_ORIGIN (block);
11523 while (TREE_CODE (ao) == BLOCK
11524 && BLOCK_ABSTRACT_ORIGIN (ao)
11525 && BLOCK_ABSTRACT_ORIGIN (ao) != ao)
11526 ao = BLOCK_ABSTRACT_ORIGIN (ao);
11528 if (TREE_CODE (ao) == FUNCTION_DECL)
11530 /* If AO is an artificial inline, point RET to the
11531 call site locus at which it has been inlined and continue
11532 the loop, in case AO's caller is also an artificial
11533 inline. */
11534 if (DECL_DECLARED_INLINE_P (ao)
11535 && lookup_attribute ("artificial", DECL_ATTRIBUTES (ao)))
11536 ret = &BLOCK_SOURCE_LOCATION (block);
11537 else
11538 break;
11540 else if (TREE_CODE (ao) != BLOCK)
11541 break;
11543 block = BLOCK_SUPERCONTEXT (block);
11545 return ret;
11549 /* If EXP is inlined from an __attribute__((__artificial__))
11550 function, return the location of the original call expression. */
11552 location_t
11553 tree_nonartificial_location (tree exp)
11555 location_t *loc = block_nonartificial_location (TREE_BLOCK (exp));
11557 if (loc)
11558 return *loc;
11559 else
11560 return EXPR_LOCATION (exp);
11564 /* These are the hash table functions for the hash table of OPTIMIZATION_NODEq
11565 nodes. */
11567 /* Return the hash code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
11569 hashval_t
11570 cl_option_hasher::hash (tree x)
11572 const_tree const t = x;
11573 const char *p;
11574 size_t i;
11575 size_t len = 0;
11576 hashval_t hash = 0;
11578 if (TREE_CODE (t) == OPTIMIZATION_NODE)
11580 p = (const char *)TREE_OPTIMIZATION (t);
11581 len = sizeof (struct cl_optimization);
11584 else if (TREE_CODE (t) == TARGET_OPTION_NODE)
11585 return cl_target_option_hash (TREE_TARGET_OPTION (t));
11587 else
11588 gcc_unreachable ();
11590 /* assume most opt flags are just 0/1, some are 2-3, and a few might be
11591 something else. */
11592 for (i = 0; i < len; i++)
11593 if (p[i])
11594 hash = (hash << 4) ^ ((i << 2) | p[i]);
11596 return hash;
11599 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
11600 TARGET_OPTION tree node) is the same as that given by *Y, which is the
11601 same. */
11603 bool
11604 cl_option_hasher::equal (tree x, tree y)
11606 const_tree const xt = x;
11607 const_tree const yt = y;
11608 const char *xp;
11609 const char *yp;
11610 size_t len;
11612 if (TREE_CODE (xt) != TREE_CODE (yt))
11613 return 0;
11615 if (TREE_CODE (xt) == OPTIMIZATION_NODE)
11617 xp = (const char *)TREE_OPTIMIZATION (xt);
11618 yp = (const char *)TREE_OPTIMIZATION (yt);
11619 len = sizeof (struct cl_optimization);
11622 else if (TREE_CODE (xt) == TARGET_OPTION_NODE)
11624 return cl_target_option_eq (TREE_TARGET_OPTION (xt),
11625 TREE_TARGET_OPTION (yt));
11628 else
11629 gcc_unreachable ();
11631 return (memcmp (xp, yp, len) == 0);
11634 /* Build an OPTIMIZATION_NODE based on the options in OPTS. */
11636 tree
11637 build_optimization_node (struct gcc_options *opts)
11639 tree t;
11641 /* Use the cache of optimization nodes. */
11643 cl_optimization_save (TREE_OPTIMIZATION (cl_optimization_node),
11644 opts);
11646 tree *slot = cl_option_hash_table->find_slot (cl_optimization_node, INSERT);
11647 t = *slot;
11648 if (!t)
11650 /* Insert this one into the hash table. */
11651 t = cl_optimization_node;
11652 *slot = t;
11654 /* Make a new node for next time round. */
11655 cl_optimization_node = make_node (OPTIMIZATION_NODE);
11658 return t;
11661 /* Build a TARGET_OPTION_NODE based on the options in OPTS. */
11663 tree
11664 build_target_option_node (struct gcc_options *opts)
11666 tree t;
11668 /* Use the cache of optimization nodes. */
11670 cl_target_option_save (TREE_TARGET_OPTION (cl_target_option_node),
11671 opts);
11673 tree *slot = cl_option_hash_table->find_slot (cl_target_option_node, INSERT);
11674 t = *slot;
11675 if (!t)
11677 /* Insert this one into the hash table. */
11678 t = cl_target_option_node;
11679 *slot = t;
11681 /* Make a new node for next time round. */
11682 cl_target_option_node = make_node (TARGET_OPTION_NODE);
11685 return t;
11688 /* Clear TREE_TARGET_GLOBALS of all TARGET_OPTION_NODE trees,
11689 so that they aren't saved during PCH writing. */
11691 void
11692 prepare_target_option_nodes_for_pch (void)
11694 hash_table<cl_option_hasher>::iterator iter = cl_option_hash_table->begin ();
11695 for (; iter != cl_option_hash_table->end (); ++iter)
11696 if (TREE_CODE (*iter) == TARGET_OPTION_NODE)
11697 TREE_TARGET_GLOBALS (*iter) = NULL;
11700 /* Determine the "ultimate origin" of a block. The block may be an inlined
11701 instance of an inlined instance of a block which is local to an inline
11702 function, so we have to trace all of the way back through the origin chain
11703 to find out what sort of node actually served as the original seed for the
11704 given block. */
11706 tree
11707 block_ultimate_origin (const_tree block)
11709 tree immediate_origin = BLOCK_ABSTRACT_ORIGIN (block);
11711 /* BLOCK_ABSTRACT_ORIGIN can point to itself; ignore that if
11712 we're trying to output the abstract instance of this function. */
11713 if (BLOCK_ABSTRACT (block) && immediate_origin == block)
11714 return NULL_TREE;
11716 if (immediate_origin == NULL_TREE)
11717 return NULL_TREE;
11718 else
11720 tree ret_val;
11721 tree lookahead = immediate_origin;
11725 ret_val = lookahead;
11726 lookahead = (TREE_CODE (ret_val) == BLOCK
11727 ? BLOCK_ABSTRACT_ORIGIN (ret_val) : NULL);
11729 while (lookahead != NULL && lookahead != ret_val);
11731 /* The block's abstract origin chain may not be the *ultimate* origin of
11732 the block. It could lead to a DECL that has an abstract origin set.
11733 If so, we want that DECL's abstract origin (which is what DECL_ORIGIN
11734 will give us if it has one). Note that DECL's abstract origins are
11735 supposed to be the most distant ancestor (or so decl_ultimate_origin
11736 claims), so we don't need to loop following the DECL origins. */
11737 if (DECL_P (ret_val))
11738 return DECL_ORIGIN (ret_val);
11740 return ret_val;
11744 /* Return true iff conversion from INNER_TYPE to OUTER_TYPE generates
11745 no instruction. */
11747 bool
11748 tree_nop_conversion_p (const_tree outer_type, const_tree inner_type)
11750 /* Do not strip casts into or out of differing address spaces. */
11751 if (POINTER_TYPE_P (outer_type)
11752 && TYPE_ADDR_SPACE (TREE_TYPE (outer_type)) != ADDR_SPACE_GENERIC)
11754 if (!POINTER_TYPE_P (inner_type)
11755 || (TYPE_ADDR_SPACE (TREE_TYPE (outer_type))
11756 != TYPE_ADDR_SPACE (TREE_TYPE (inner_type))))
11757 return false;
11759 else if (POINTER_TYPE_P (inner_type)
11760 && TYPE_ADDR_SPACE (TREE_TYPE (inner_type)) != ADDR_SPACE_GENERIC)
11762 /* We already know that outer_type is not a pointer with
11763 a non-generic address space. */
11764 return false;
11767 /* Use precision rather then machine mode when we can, which gives
11768 the correct answer even for submode (bit-field) types. */
11769 if ((INTEGRAL_TYPE_P (outer_type)
11770 || POINTER_TYPE_P (outer_type)
11771 || TREE_CODE (outer_type) == OFFSET_TYPE)
11772 && (INTEGRAL_TYPE_P (inner_type)
11773 || POINTER_TYPE_P (inner_type)
11774 || TREE_CODE (inner_type) == OFFSET_TYPE))
11775 return TYPE_PRECISION (outer_type) == TYPE_PRECISION (inner_type);
11777 /* Otherwise fall back on comparing machine modes (e.g. for
11778 aggregate types, floats). */
11779 return TYPE_MODE (outer_type) == TYPE_MODE (inner_type);
11782 /* Return true iff conversion in EXP generates no instruction. Mark
11783 it inline so that we fully inline into the stripping functions even
11784 though we have two uses of this function. */
11786 static inline bool
11787 tree_nop_conversion (const_tree exp)
11789 tree outer_type, inner_type;
11791 if (!CONVERT_EXPR_P (exp)
11792 && TREE_CODE (exp) != NON_LVALUE_EXPR)
11793 return false;
11794 if (TREE_OPERAND (exp, 0) == error_mark_node)
11795 return false;
11797 outer_type = TREE_TYPE (exp);
11798 inner_type = TREE_TYPE (TREE_OPERAND (exp, 0));
11800 if (!inner_type)
11801 return false;
11803 return tree_nop_conversion_p (outer_type, inner_type);
11806 /* Return true iff conversion in EXP generates no instruction. Don't
11807 consider conversions changing the signedness. */
11809 static bool
11810 tree_sign_nop_conversion (const_tree exp)
11812 tree outer_type, inner_type;
11814 if (!tree_nop_conversion (exp))
11815 return false;
11817 outer_type = TREE_TYPE (exp);
11818 inner_type = TREE_TYPE (TREE_OPERAND (exp, 0));
11820 return (TYPE_UNSIGNED (outer_type) == TYPE_UNSIGNED (inner_type)
11821 && POINTER_TYPE_P (outer_type) == POINTER_TYPE_P (inner_type));
11824 /* Strip conversions from EXP according to tree_nop_conversion and
11825 return the resulting expression. */
11827 tree
11828 tree_strip_nop_conversions (tree exp)
11830 while (tree_nop_conversion (exp))
11831 exp = TREE_OPERAND (exp, 0);
11832 return exp;
11835 /* Strip conversions from EXP according to tree_sign_nop_conversion
11836 and return the resulting expression. */
11838 tree
11839 tree_strip_sign_nop_conversions (tree exp)
11841 while (tree_sign_nop_conversion (exp))
11842 exp = TREE_OPERAND (exp, 0);
11843 return exp;
11846 /* Avoid any floating point extensions from EXP. */
11847 tree
11848 strip_float_extensions (tree exp)
11850 tree sub, expt, subt;
11852 /* For floating point constant look up the narrowest type that can hold
11853 it properly and handle it like (type)(narrowest_type)constant.
11854 This way we can optimize for instance a=a*2.0 where "a" is float
11855 but 2.0 is double constant. */
11856 if (TREE_CODE (exp) == REAL_CST && !DECIMAL_FLOAT_TYPE_P (TREE_TYPE (exp)))
11858 REAL_VALUE_TYPE orig;
11859 tree type = NULL;
11861 orig = TREE_REAL_CST (exp);
11862 if (TYPE_PRECISION (TREE_TYPE (exp)) > TYPE_PRECISION (float_type_node)
11863 && exact_real_truncate (TYPE_MODE (float_type_node), &orig))
11864 type = float_type_node;
11865 else if (TYPE_PRECISION (TREE_TYPE (exp))
11866 > TYPE_PRECISION (double_type_node)
11867 && exact_real_truncate (TYPE_MODE (double_type_node), &orig))
11868 type = double_type_node;
11869 if (type)
11870 return build_real_truncate (type, orig);
11873 if (!CONVERT_EXPR_P (exp))
11874 return exp;
11876 sub = TREE_OPERAND (exp, 0);
11877 subt = TREE_TYPE (sub);
11878 expt = TREE_TYPE (exp);
11880 if (!FLOAT_TYPE_P (subt))
11881 return exp;
11883 if (DECIMAL_FLOAT_TYPE_P (expt) != DECIMAL_FLOAT_TYPE_P (subt))
11884 return exp;
11886 if (TYPE_PRECISION (subt) > TYPE_PRECISION (expt))
11887 return exp;
11889 return strip_float_extensions (sub);
11892 /* Strip out all handled components that produce invariant
11893 offsets. */
11895 const_tree
11896 strip_invariant_refs (const_tree op)
11898 while (handled_component_p (op))
11900 switch (TREE_CODE (op))
11902 case ARRAY_REF:
11903 case ARRAY_RANGE_REF:
11904 if (!is_gimple_constant (TREE_OPERAND (op, 1))
11905 || TREE_OPERAND (op, 2) != NULL_TREE
11906 || TREE_OPERAND (op, 3) != NULL_TREE)
11907 return NULL;
11908 break;
11910 case COMPONENT_REF:
11911 if (TREE_OPERAND (op, 2) != NULL_TREE)
11912 return NULL;
11913 break;
11915 default:;
11917 op = TREE_OPERAND (op, 0);
11920 return op;
11923 static GTY(()) tree gcc_eh_personality_decl;
11925 /* Return the GCC personality function decl. */
11927 tree
11928 lhd_gcc_personality (void)
11930 if (!gcc_eh_personality_decl)
11931 gcc_eh_personality_decl = build_personality_function ("gcc");
11932 return gcc_eh_personality_decl;
11935 /* TARGET is a call target of GIMPLE call statement
11936 (obtained by gimple_call_fn). Return true if it is
11937 OBJ_TYPE_REF representing an virtual call of C++ method.
11938 (As opposed to OBJ_TYPE_REF representing objc calls
11939 through a cast where middle-end devirtualization machinery
11940 can't apply.) */
11942 bool
11943 virtual_method_call_p (const_tree target)
11945 if (TREE_CODE (target) != OBJ_TYPE_REF)
11946 return false;
11947 tree t = TREE_TYPE (target);
11948 gcc_checking_assert (TREE_CODE (t) == POINTER_TYPE);
11949 t = TREE_TYPE (t);
11950 if (TREE_CODE (t) == FUNCTION_TYPE)
11951 return false;
11952 gcc_checking_assert (TREE_CODE (t) == METHOD_TYPE);
11953 /* If we do not have BINFO associated, it means that type was built
11954 without devirtualization enabled. Do not consider this a virtual
11955 call. */
11956 if (!TYPE_BINFO (obj_type_ref_class (target)))
11957 return false;
11958 return true;
11961 /* REF is OBJ_TYPE_REF, return the class the ref corresponds to. */
11963 tree
11964 obj_type_ref_class (const_tree ref)
11966 gcc_checking_assert (TREE_CODE (ref) == OBJ_TYPE_REF);
11967 ref = TREE_TYPE (ref);
11968 gcc_checking_assert (TREE_CODE (ref) == POINTER_TYPE);
11969 ref = TREE_TYPE (ref);
11970 /* We look for type THIS points to. ObjC also builds
11971 OBJ_TYPE_REF with non-method calls, Their first parameter
11972 ID however also corresponds to class type. */
11973 gcc_checking_assert (TREE_CODE (ref) == METHOD_TYPE
11974 || TREE_CODE (ref) == FUNCTION_TYPE);
11975 ref = TREE_VALUE (TYPE_ARG_TYPES (ref));
11976 gcc_checking_assert (TREE_CODE (ref) == POINTER_TYPE);
11977 return TREE_TYPE (ref);
11980 /* Lookup sub-BINFO of BINFO of TYPE at offset POS. */
11982 static tree
11983 lookup_binfo_at_offset (tree binfo, tree type, HOST_WIDE_INT pos)
11985 unsigned int i;
11986 tree base_binfo, b;
11988 for (i = 0; BINFO_BASE_ITERATE (binfo, i, base_binfo); i++)
11989 if (pos == tree_to_shwi (BINFO_OFFSET (base_binfo))
11990 && types_same_for_odr (TREE_TYPE (base_binfo), type))
11991 return base_binfo;
11992 else if ((b = lookup_binfo_at_offset (base_binfo, type, pos)) != NULL)
11993 return b;
11994 return NULL;
11997 /* Try to find a base info of BINFO that would have its field decl at offset
11998 OFFSET within the BINFO type and which is of EXPECTED_TYPE. If it can be
11999 found, return, otherwise return NULL_TREE. */
12001 tree
12002 get_binfo_at_offset (tree binfo, HOST_WIDE_INT offset, tree expected_type)
12004 tree type = BINFO_TYPE (binfo);
12006 while (true)
12008 HOST_WIDE_INT pos, size;
12009 tree fld;
12010 int i;
12012 if (types_same_for_odr (type, expected_type))
12013 return binfo;
12014 if (offset < 0)
12015 return NULL_TREE;
12017 for (fld = TYPE_FIELDS (type); fld; fld = DECL_CHAIN (fld))
12019 if (TREE_CODE (fld) != FIELD_DECL || !DECL_ARTIFICIAL (fld))
12020 continue;
12022 pos = int_bit_position (fld);
12023 size = tree_to_uhwi (DECL_SIZE (fld));
12024 if (pos <= offset && (pos + size) > offset)
12025 break;
12027 if (!fld || TREE_CODE (TREE_TYPE (fld)) != RECORD_TYPE)
12028 return NULL_TREE;
12030 /* Offset 0 indicates the primary base, whose vtable contents are
12031 represented in the binfo for the derived class. */
12032 else if (offset != 0)
12034 tree found_binfo = NULL, base_binfo;
12035 /* Offsets in BINFO are in bytes relative to the whole structure
12036 while POS is in bits relative to the containing field. */
12037 int binfo_offset = (tree_to_shwi (BINFO_OFFSET (binfo)) + pos
12038 / BITS_PER_UNIT);
12040 for (i = 0; BINFO_BASE_ITERATE (binfo, i, base_binfo); i++)
12041 if (tree_to_shwi (BINFO_OFFSET (base_binfo)) == binfo_offset
12042 && types_same_for_odr (TREE_TYPE (base_binfo), TREE_TYPE (fld)))
12044 found_binfo = base_binfo;
12045 break;
12047 if (found_binfo)
12048 binfo = found_binfo;
12049 else
12050 binfo = lookup_binfo_at_offset (binfo, TREE_TYPE (fld),
12051 binfo_offset);
12054 type = TREE_TYPE (fld);
12055 offset -= pos;
12059 /* Returns true if X is a typedef decl. */
12061 bool
12062 is_typedef_decl (const_tree x)
12064 return (x && TREE_CODE (x) == TYPE_DECL
12065 && DECL_ORIGINAL_TYPE (x) != NULL_TREE);
12068 /* Returns true iff TYPE is a type variant created for a typedef. */
12070 bool
12071 typedef_variant_p (const_tree type)
12073 return is_typedef_decl (TYPE_NAME (type));
12076 /* Warn about a use of an identifier which was marked deprecated. */
12077 void
12078 warn_deprecated_use (tree node, tree attr)
12080 const char *msg;
12082 if (node == 0 || !warn_deprecated_decl)
12083 return;
12085 if (!attr)
12087 if (DECL_P (node))
12088 attr = DECL_ATTRIBUTES (node);
12089 else if (TYPE_P (node))
12091 tree decl = TYPE_STUB_DECL (node);
12092 if (decl)
12093 attr = lookup_attribute ("deprecated",
12094 TYPE_ATTRIBUTES (TREE_TYPE (decl)));
12098 if (attr)
12099 attr = lookup_attribute ("deprecated", attr);
12101 if (attr)
12102 msg = TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr)));
12103 else
12104 msg = NULL;
12106 bool w;
12107 if (DECL_P (node))
12109 if (msg)
12110 w = warning (OPT_Wdeprecated_declarations,
12111 "%qD is deprecated: %s", node, msg);
12112 else
12113 w = warning (OPT_Wdeprecated_declarations,
12114 "%qD is deprecated", node);
12115 if (w)
12116 inform (DECL_SOURCE_LOCATION (node), "declared here");
12118 else if (TYPE_P (node))
12120 tree what = NULL_TREE;
12121 tree decl = TYPE_STUB_DECL (node);
12123 if (TYPE_NAME (node))
12125 if (TREE_CODE (TYPE_NAME (node)) == IDENTIFIER_NODE)
12126 what = TYPE_NAME (node);
12127 else if (TREE_CODE (TYPE_NAME (node)) == TYPE_DECL
12128 && DECL_NAME (TYPE_NAME (node)))
12129 what = DECL_NAME (TYPE_NAME (node));
12132 if (decl)
12134 if (what)
12136 if (msg)
12137 w = warning (OPT_Wdeprecated_declarations,
12138 "%qE is deprecated: %s", what, msg);
12139 else
12140 w = warning (OPT_Wdeprecated_declarations,
12141 "%qE is deprecated", what);
12143 else
12145 if (msg)
12146 w = warning (OPT_Wdeprecated_declarations,
12147 "type is deprecated: %s", msg);
12148 else
12149 w = warning (OPT_Wdeprecated_declarations,
12150 "type is deprecated");
12152 if (w)
12153 inform (DECL_SOURCE_LOCATION (decl), "declared here");
12155 else
12157 if (what)
12159 if (msg)
12160 warning (OPT_Wdeprecated_declarations, "%qE is deprecated: %s",
12161 what, msg);
12162 else
12163 warning (OPT_Wdeprecated_declarations, "%qE is deprecated", what);
12165 else
12167 if (msg)
12168 warning (OPT_Wdeprecated_declarations, "type is deprecated: %s",
12169 msg);
12170 else
12171 warning (OPT_Wdeprecated_declarations, "type is deprecated");
12177 /* Return true if REF has a COMPONENT_REF with a bit-field field declaration
12178 somewhere in it. */
12180 bool
12181 contains_bitfld_component_ref_p (const_tree ref)
12183 while (handled_component_p (ref))
12185 if (TREE_CODE (ref) == COMPONENT_REF
12186 && DECL_BIT_FIELD (TREE_OPERAND (ref, 1)))
12187 return true;
12188 ref = TREE_OPERAND (ref, 0);
12191 return false;
12194 /* Try to determine whether a TRY_CATCH expression can fall through.
12195 This is a subroutine of block_may_fallthru. */
12197 static bool
12198 try_catch_may_fallthru (const_tree stmt)
12200 tree_stmt_iterator i;
12202 /* If the TRY block can fall through, the whole TRY_CATCH can
12203 fall through. */
12204 if (block_may_fallthru (TREE_OPERAND (stmt, 0)))
12205 return true;
12207 i = tsi_start (TREE_OPERAND (stmt, 1));
12208 switch (TREE_CODE (tsi_stmt (i)))
12210 case CATCH_EXPR:
12211 /* We expect to see a sequence of CATCH_EXPR trees, each with a
12212 catch expression and a body. The whole TRY_CATCH may fall
12213 through iff any of the catch bodies falls through. */
12214 for (; !tsi_end_p (i); tsi_next (&i))
12216 if (block_may_fallthru (CATCH_BODY (tsi_stmt (i))))
12217 return true;
12219 return false;
12221 case EH_FILTER_EXPR:
12222 /* The exception filter expression only matters if there is an
12223 exception. If the exception does not match EH_FILTER_TYPES,
12224 we will execute EH_FILTER_FAILURE, and we will fall through
12225 if that falls through. If the exception does match
12226 EH_FILTER_TYPES, the stack unwinder will continue up the
12227 stack, so we will not fall through. We don't know whether we
12228 will throw an exception which matches EH_FILTER_TYPES or not,
12229 so we just ignore EH_FILTER_TYPES and assume that we might
12230 throw an exception which doesn't match. */
12231 return block_may_fallthru (EH_FILTER_FAILURE (tsi_stmt (i)));
12233 default:
12234 /* This case represents statements to be executed when an
12235 exception occurs. Those statements are implicitly followed
12236 by a RESX statement to resume execution after the exception.
12237 So in this case the TRY_CATCH never falls through. */
12238 return false;
12242 /* Try to determine if we can fall out of the bottom of BLOCK. This guess
12243 need not be 100% accurate; simply be conservative and return true if we
12244 don't know. This is used only to avoid stupidly generating extra code.
12245 If we're wrong, we'll just delete the extra code later. */
12247 bool
12248 block_may_fallthru (const_tree block)
12250 /* This CONST_CAST is okay because expr_last returns its argument
12251 unmodified and we assign it to a const_tree. */
12252 const_tree stmt = expr_last (CONST_CAST_TREE (block));
12254 switch (stmt ? TREE_CODE (stmt) : ERROR_MARK)
12256 case GOTO_EXPR:
12257 case RETURN_EXPR:
12258 /* Easy cases. If the last statement of the block implies
12259 control transfer, then we can't fall through. */
12260 return false;
12262 case SWITCH_EXPR:
12263 /* If SWITCH_LABELS is set, this is lowered, and represents a
12264 branch to a selected label and hence can not fall through.
12265 Otherwise SWITCH_BODY is set, and the switch can fall
12266 through. */
12267 return SWITCH_LABELS (stmt) == NULL_TREE;
12269 case COND_EXPR:
12270 if (block_may_fallthru (COND_EXPR_THEN (stmt)))
12271 return true;
12272 return block_may_fallthru (COND_EXPR_ELSE (stmt));
12274 case BIND_EXPR:
12275 return block_may_fallthru (BIND_EXPR_BODY (stmt));
12277 case TRY_CATCH_EXPR:
12278 return try_catch_may_fallthru (stmt);
12280 case TRY_FINALLY_EXPR:
12281 /* The finally clause is always executed after the try clause,
12282 so if it does not fall through, then the try-finally will not
12283 fall through. Otherwise, if the try clause does not fall
12284 through, then when the finally clause falls through it will
12285 resume execution wherever the try clause was going. So the
12286 whole try-finally will only fall through if both the try
12287 clause and the finally clause fall through. */
12288 return (block_may_fallthru (TREE_OPERAND (stmt, 0))
12289 && block_may_fallthru (TREE_OPERAND (stmt, 1)));
12291 case MODIFY_EXPR:
12292 if (TREE_CODE (TREE_OPERAND (stmt, 1)) == CALL_EXPR)
12293 stmt = TREE_OPERAND (stmt, 1);
12294 else
12295 return true;
12296 /* FALLTHRU */
12298 case CALL_EXPR:
12299 /* Functions that do not return do not fall through. */
12300 return (call_expr_flags (stmt) & ECF_NORETURN) == 0;
12302 case CLEANUP_POINT_EXPR:
12303 return block_may_fallthru (TREE_OPERAND (stmt, 0));
12305 case TARGET_EXPR:
12306 return block_may_fallthru (TREE_OPERAND (stmt, 1));
12308 case ERROR_MARK:
12309 return true;
12311 default:
12312 return lang_hooks.block_may_fallthru (stmt);
12316 /* True if we are using EH to handle cleanups. */
12317 static bool using_eh_for_cleanups_flag = false;
12319 /* This routine is called from front ends to indicate eh should be used for
12320 cleanups. */
12321 void
12322 using_eh_for_cleanups (void)
12324 using_eh_for_cleanups_flag = true;
12327 /* Query whether EH is used for cleanups. */
12328 bool
12329 using_eh_for_cleanups_p (void)
12331 return using_eh_for_cleanups_flag;
12334 /* Wrapper for tree_code_name to ensure that tree code is valid */
12335 const char *
12336 get_tree_code_name (enum tree_code code)
12338 const char *invalid = "<invalid tree code>";
12340 if (code >= MAX_TREE_CODES)
12341 return invalid;
12343 return tree_code_name[code];
12346 /* Drops the TREE_OVERFLOW flag from T. */
12348 tree
12349 drop_tree_overflow (tree t)
12351 gcc_checking_assert (TREE_OVERFLOW (t));
12353 /* For tree codes with a sharing machinery re-build the result. */
12354 if (TREE_CODE (t) == INTEGER_CST)
12355 return wide_int_to_tree (TREE_TYPE (t), t);
12357 /* Otherwise, as all tcc_constants are possibly shared, copy the node
12358 and drop the flag. */
12359 t = copy_node (t);
12360 TREE_OVERFLOW (t) = 0;
12362 /* For constants that contain nested constants, drop the flag
12363 from those as well. */
12364 if (TREE_CODE (t) == COMPLEX_CST)
12366 if (TREE_OVERFLOW (TREE_REALPART (t)))
12367 TREE_REALPART (t) = drop_tree_overflow (TREE_REALPART (t));
12368 if (TREE_OVERFLOW (TREE_IMAGPART (t)))
12369 TREE_IMAGPART (t) = drop_tree_overflow (TREE_IMAGPART (t));
12371 if (TREE_CODE (t) == VECTOR_CST)
12373 for (unsigned i = 0; i < VECTOR_CST_NELTS (t); ++i)
12375 tree& elt = VECTOR_CST_ELT (t, i);
12376 if (TREE_OVERFLOW (elt))
12377 elt = drop_tree_overflow (elt);
12380 return t;
12383 /* Given a memory reference expression T, return its base address.
12384 The base address of a memory reference expression is the main
12385 object being referenced. For instance, the base address for
12386 'array[i].fld[j]' is 'array'. You can think of this as stripping
12387 away the offset part from a memory address.
12389 This function calls handled_component_p to strip away all the inner
12390 parts of the memory reference until it reaches the base object. */
12392 tree
12393 get_base_address (tree t)
12395 while (handled_component_p (t))
12396 t = TREE_OPERAND (t, 0);
12398 if ((TREE_CODE (t) == MEM_REF
12399 || TREE_CODE (t) == TARGET_MEM_REF)
12400 && TREE_CODE (TREE_OPERAND (t, 0)) == ADDR_EXPR)
12401 t = TREE_OPERAND (TREE_OPERAND (t, 0), 0);
12403 /* ??? Either the alias oracle or all callers need to properly deal
12404 with WITH_SIZE_EXPRs before we can look through those. */
12405 if (TREE_CODE (t) == WITH_SIZE_EXPR)
12406 return NULL_TREE;
12408 return t;
12411 /* Return a tree of sizetype representing the size, in bytes, of the element
12412 of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
12414 tree
12415 array_ref_element_size (tree exp)
12417 tree aligned_size = TREE_OPERAND (exp, 3);
12418 tree elmt_type = TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp, 0)));
12419 location_t loc = EXPR_LOCATION (exp);
12421 /* If a size was specified in the ARRAY_REF, it's the size measured
12422 in alignment units of the element type. So multiply by that value. */
12423 if (aligned_size)
12425 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
12426 sizetype from another type of the same width and signedness. */
12427 if (TREE_TYPE (aligned_size) != sizetype)
12428 aligned_size = fold_convert_loc (loc, sizetype, aligned_size);
12429 return size_binop_loc (loc, MULT_EXPR, aligned_size,
12430 size_int (TYPE_ALIGN_UNIT (elmt_type)));
12433 /* Otherwise, take the size from that of the element type. Substitute
12434 any PLACEHOLDER_EXPR that we have. */
12435 else
12436 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_SIZE_UNIT (elmt_type), exp);
12439 /* Return a tree representing the lower bound of the array mentioned in
12440 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
12442 tree
12443 array_ref_low_bound (tree exp)
12445 tree domain_type = TYPE_DOMAIN (TREE_TYPE (TREE_OPERAND (exp, 0)));
12447 /* If a lower bound is specified in EXP, use it. */
12448 if (TREE_OPERAND (exp, 2))
12449 return TREE_OPERAND (exp, 2);
12451 /* Otherwise, if there is a domain type and it has a lower bound, use it,
12452 substituting for a PLACEHOLDER_EXPR as needed. */
12453 if (domain_type && TYPE_MIN_VALUE (domain_type))
12454 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_MIN_VALUE (domain_type), exp);
12456 /* Otherwise, return a zero of the appropriate type. */
12457 return build_int_cst (TREE_TYPE (TREE_OPERAND (exp, 1)), 0);
12460 /* Return a tree representing the upper bound of the array mentioned in
12461 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
12463 tree
12464 array_ref_up_bound (tree exp)
12466 tree domain_type = TYPE_DOMAIN (TREE_TYPE (TREE_OPERAND (exp, 0)));
12468 /* If there is a domain type and it has an upper bound, use it, substituting
12469 for a PLACEHOLDER_EXPR as needed. */
12470 if (domain_type && TYPE_MAX_VALUE (domain_type))
12471 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_MAX_VALUE (domain_type), exp);
12473 /* Otherwise fail. */
12474 return NULL_TREE;
12477 /* Returns true if REF is an array reference or a component reference
12478 to an array at the end of a structure.
12479 If this is the case, the array may be allocated larger
12480 than its upper bound implies. */
12482 bool
12483 array_at_struct_end_p (tree ref)
12485 tree atype;
12487 if (TREE_CODE (ref) == ARRAY_REF
12488 || TREE_CODE (ref) == ARRAY_RANGE_REF)
12490 atype = TREE_TYPE (TREE_OPERAND (ref, 0));
12491 ref = TREE_OPERAND (ref, 0);
12493 else if (TREE_CODE (ref) == COMPONENT_REF
12494 && TREE_CODE (TREE_TYPE (TREE_OPERAND (ref, 1))) == ARRAY_TYPE)
12495 atype = TREE_TYPE (TREE_OPERAND (ref, 1));
12496 else
12497 return false;
12499 while (handled_component_p (ref))
12501 /* If the reference chain contains a component reference to a
12502 non-union type and there follows another field the reference
12503 is not at the end of a structure. */
12504 if (TREE_CODE (ref) == COMPONENT_REF)
12506 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (ref, 0))) == RECORD_TYPE)
12508 tree nextf = DECL_CHAIN (TREE_OPERAND (ref, 1));
12509 while (nextf && TREE_CODE (nextf) != FIELD_DECL)
12510 nextf = DECL_CHAIN (nextf);
12511 if (nextf)
12512 return false;
12515 /* If we have a multi-dimensional array we do not consider
12516 a non-innermost dimension as flex array if the whole
12517 multi-dimensional array is at struct end.
12518 Same for an array of aggregates with a trailing array
12519 member. */
12520 else if (TREE_CODE (ref) == ARRAY_REF)
12521 return false;
12522 else if (TREE_CODE (ref) == ARRAY_RANGE_REF)
12524 /* If we view an underlying object as sth else then what we
12525 gathered up to now is what we have to rely on. */
12526 else if (TREE_CODE (ref) == VIEW_CONVERT_EXPR)
12527 break;
12528 else
12529 gcc_unreachable ();
12531 ref = TREE_OPERAND (ref, 0);
12534 /* The array now is at struct end. Treat flexible arrays as
12535 always subject to extend, even into just padding constrained by
12536 an underlying decl. */
12537 if (! TYPE_SIZE (atype))
12538 return true;
12540 tree size = NULL;
12542 if (TREE_CODE (ref) == MEM_REF
12543 && TREE_CODE (TREE_OPERAND (ref, 0)) == ADDR_EXPR)
12545 size = TYPE_SIZE (TREE_TYPE (ref));
12546 ref = TREE_OPERAND (TREE_OPERAND (ref, 0), 0);
12549 /* If the reference is based on a declared entity, the size of the array
12550 is constrained by its given domain. (Do not trust commons PR/69368). */
12551 if (DECL_P (ref)
12552 /* Be sure the size of MEM_REF target match. For example:
12554 char buf[10];
12555 struct foo *str = (struct foo *)&buf;
12557 str->trailin_array[2] = 1;
12559 is valid because BUF allocate enough space. */
12561 && (!size || (DECL_SIZE (ref) != NULL
12562 && operand_equal_p (DECL_SIZE (ref), size, 0)))
12563 && !(flag_unconstrained_commons
12564 && VAR_P (ref) && DECL_COMMON (ref)))
12565 return false;
12567 return true;
12570 /* Return a tree representing the offset, in bytes, of the field referenced
12571 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
12573 tree
12574 component_ref_field_offset (tree exp)
12576 tree aligned_offset = TREE_OPERAND (exp, 2);
12577 tree field = TREE_OPERAND (exp, 1);
12578 location_t loc = EXPR_LOCATION (exp);
12580 /* If an offset was specified in the COMPONENT_REF, it's the offset measured
12581 in units of DECL_OFFSET_ALIGN / BITS_PER_UNIT. So multiply by that
12582 value. */
12583 if (aligned_offset)
12585 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
12586 sizetype from another type of the same width and signedness. */
12587 if (TREE_TYPE (aligned_offset) != sizetype)
12588 aligned_offset = fold_convert_loc (loc, sizetype, aligned_offset);
12589 return size_binop_loc (loc, MULT_EXPR, aligned_offset,
12590 size_int (DECL_OFFSET_ALIGN (field)
12591 / BITS_PER_UNIT));
12594 /* Otherwise, take the offset from that of the field. Substitute
12595 any PLACEHOLDER_EXPR that we have. */
12596 else
12597 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (DECL_FIELD_OFFSET (field), exp);
12600 /* Return the machine mode of T. For vectors, returns the mode of the
12601 inner type. The main use case is to feed the result to HONOR_NANS,
12602 avoiding the BLKmode that a direct TYPE_MODE (T) might return. */
12604 machine_mode
12605 element_mode (const_tree t)
12607 if (!TYPE_P (t))
12608 t = TREE_TYPE (t);
12609 if (VECTOR_TYPE_P (t) || TREE_CODE (t) == COMPLEX_TYPE)
12610 t = TREE_TYPE (t);
12611 return TYPE_MODE (t);
12614 /* Vector types need to re-check the target flags each time we report
12615 the machine mode. We need to do this because attribute target can
12616 change the result of vector_mode_supported_p and have_regs_of_mode
12617 on a per-function basis. Thus the TYPE_MODE of a VECTOR_TYPE can
12618 change on a per-function basis. */
12619 /* ??? Possibly a better solution is to run through all the types
12620 referenced by a function and re-compute the TYPE_MODE once, rather
12621 than make the TYPE_MODE macro call a function. */
12623 machine_mode
12624 vector_type_mode (const_tree t)
12626 machine_mode mode;
12628 gcc_assert (TREE_CODE (t) == VECTOR_TYPE);
12630 mode = t->type_common.mode;
12631 if (VECTOR_MODE_P (mode)
12632 && (!targetm.vector_mode_supported_p (mode)
12633 || !have_regs_of_mode[mode]))
12635 scalar_int_mode innermode;
12637 /* For integers, try mapping it to a same-sized scalar mode. */
12638 if (is_int_mode (TREE_TYPE (t)->type_common.mode, &innermode))
12640 unsigned int size = (TYPE_VECTOR_SUBPARTS (t)
12641 * GET_MODE_BITSIZE (innermode));
12642 scalar_int_mode mode;
12643 if (int_mode_for_size (size, 0).exists (&mode)
12644 && have_regs_of_mode[mode])
12645 return mode;
12648 return BLKmode;
12651 return mode;
12654 /* Verify that basic properties of T match TV and thus T can be a variant of
12655 TV. TV should be the more specified variant (i.e. the main variant). */
12657 static bool
12658 verify_type_variant (const_tree t, tree tv)
12660 /* Type variant can differ by:
12662 - TYPE_QUALS: TYPE_READONLY, TYPE_VOLATILE, TYPE_ATOMIC, TYPE_RESTRICT,
12663 ENCODE_QUAL_ADDR_SPACE.
12664 - main variant may be TYPE_COMPLETE_P and variant types !TYPE_COMPLETE_P
12665 in this case some values may not be set in the variant types
12666 (see TYPE_COMPLETE_P checks).
12667 - it is possible to have TYPE_ARTIFICIAL variant of non-artifical type
12668 - by TYPE_NAME and attributes (i.e. when variant originate by typedef)
12669 - TYPE_CANONICAL (TYPE_ALIAS_SET is the same among variants)
12670 - by the alignment: TYPE_ALIGN and TYPE_USER_ALIGN
12671 - during LTO by TYPE_CONTEXT if type is TYPE_FILE_SCOPE_P
12672 this is necessary to make it possible to merge types form different TUs
12673 - arrays, pointers and references may have TREE_TYPE that is a variant
12674 of TREE_TYPE of their main variants.
12675 - aggregates may have new TYPE_FIELDS list that list variants of
12676 the main variant TYPE_FIELDS.
12677 - vector types may differ by TYPE_VECTOR_OPAQUE
12680 /* Convenience macro for matching individual fields. */
12681 #define verify_variant_match(flag) \
12682 do { \
12683 if (flag (tv) != flag (t)) \
12685 error ("type variant differs by " #flag "."); \
12686 debug_tree (tv); \
12687 return false; \
12689 } while (false)
12691 /* tree_base checks. */
12693 verify_variant_match (TREE_CODE);
12694 /* FIXME: Ada builds non-artificial variants of artificial types. */
12695 if (TYPE_ARTIFICIAL (tv) && 0)
12696 verify_variant_match (TYPE_ARTIFICIAL);
12697 if (POINTER_TYPE_P (tv))
12698 verify_variant_match (TYPE_REF_CAN_ALIAS_ALL);
12699 /* FIXME: TYPE_SIZES_GIMPLIFIED may differs for Ada build. */
12700 verify_variant_match (TYPE_UNSIGNED);
12701 verify_variant_match (TYPE_PACKED);
12702 if (TREE_CODE (t) == REFERENCE_TYPE)
12703 verify_variant_match (TYPE_REF_IS_RVALUE);
12704 if (AGGREGATE_TYPE_P (t))
12705 verify_variant_match (TYPE_REVERSE_STORAGE_ORDER);
12706 else
12707 verify_variant_match (TYPE_SATURATING);
12708 /* FIXME: This check trigger during libstdc++ build. */
12709 if (RECORD_OR_UNION_TYPE_P (t) && COMPLETE_TYPE_P (t) && 0)
12710 verify_variant_match (TYPE_FINAL_P);
12712 /* tree_type_common checks. */
12714 if (COMPLETE_TYPE_P (t))
12716 verify_variant_match (TYPE_MODE);
12717 if (TREE_CODE (TYPE_SIZE (t)) != PLACEHOLDER_EXPR
12718 && TREE_CODE (TYPE_SIZE (tv)) != PLACEHOLDER_EXPR)
12719 verify_variant_match (TYPE_SIZE);
12720 if (TREE_CODE (TYPE_SIZE_UNIT (t)) != PLACEHOLDER_EXPR
12721 && TREE_CODE (TYPE_SIZE_UNIT (tv)) != PLACEHOLDER_EXPR
12722 && TYPE_SIZE_UNIT (t) != TYPE_SIZE_UNIT (tv))
12724 gcc_assert (!operand_equal_p (TYPE_SIZE_UNIT (t),
12725 TYPE_SIZE_UNIT (tv), 0));
12726 error ("type variant has different TYPE_SIZE_UNIT");
12727 debug_tree (tv);
12728 error ("type variant's TYPE_SIZE_UNIT");
12729 debug_tree (TYPE_SIZE_UNIT (tv));
12730 error ("type's TYPE_SIZE_UNIT");
12731 debug_tree (TYPE_SIZE_UNIT (t));
12732 return false;
12735 verify_variant_match (TYPE_PRECISION);
12736 verify_variant_match (TYPE_NEEDS_CONSTRUCTING);
12737 if (RECORD_OR_UNION_TYPE_P (t))
12738 verify_variant_match (TYPE_TRANSPARENT_AGGR);
12739 else if (TREE_CODE (t) == ARRAY_TYPE)
12740 verify_variant_match (TYPE_NONALIASED_COMPONENT);
12741 /* During LTO we merge variant lists from diferent translation units
12742 that may differ BY TYPE_CONTEXT that in turn may point
12743 to TRANSLATION_UNIT_DECL.
12744 Ada also builds variants of types with different TYPE_CONTEXT. */
12745 if ((!in_lto_p || !TYPE_FILE_SCOPE_P (t)) && 0)
12746 verify_variant_match (TYPE_CONTEXT);
12747 verify_variant_match (TYPE_STRING_FLAG);
12748 if (TYPE_ALIAS_SET_KNOWN_P (t))
12750 error ("type variant with TYPE_ALIAS_SET_KNOWN_P");
12751 debug_tree (tv);
12752 return false;
12755 /* tree_type_non_common checks. */
12757 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
12758 and dangle the pointer from time to time. */
12759 if (RECORD_OR_UNION_TYPE_P (t) && TYPE_VFIELD (t) != TYPE_VFIELD (tv)
12760 && (in_lto_p || !TYPE_VFIELD (tv)
12761 || TREE_CODE (TYPE_VFIELD (tv)) != TREE_LIST))
12763 error ("type variant has different TYPE_VFIELD");
12764 debug_tree (tv);
12765 return false;
12767 if ((TREE_CODE (t) == ENUMERAL_TYPE && COMPLETE_TYPE_P (t))
12768 || TREE_CODE (t) == INTEGER_TYPE
12769 || TREE_CODE (t) == BOOLEAN_TYPE
12770 || TREE_CODE (t) == REAL_TYPE
12771 || TREE_CODE (t) == FIXED_POINT_TYPE)
12773 verify_variant_match (TYPE_MAX_VALUE);
12774 verify_variant_match (TYPE_MIN_VALUE);
12776 if (TREE_CODE (t) == METHOD_TYPE)
12777 verify_variant_match (TYPE_METHOD_BASETYPE);
12778 if (TREE_CODE (t) == OFFSET_TYPE)
12779 verify_variant_match (TYPE_OFFSET_BASETYPE);
12780 if (TREE_CODE (t) == ARRAY_TYPE)
12781 verify_variant_match (TYPE_ARRAY_MAX_SIZE);
12782 /* FIXME: Be lax and allow TYPE_BINFO to be missing in variant types
12783 or even type's main variant. This is needed to make bootstrap pass
12784 and the bug seems new in GCC 5.
12785 C++ FE should be updated to make this consistent and we should check
12786 that TYPE_BINFO is always NULL for !COMPLETE_TYPE_P and otherwise there
12787 is a match with main variant.
12789 Also disable the check for Java for now because of parser hack that builds
12790 first an dummy BINFO and then sometimes replace it by real BINFO in some
12791 of the copies. */
12792 if (RECORD_OR_UNION_TYPE_P (t) && TYPE_BINFO (t) && TYPE_BINFO (tv)
12793 && TYPE_BINFO (t) != TYPE_BINFO (tv)
12794 /* FIXME: Java sometimes keep dump TYPE_BINFOs on variant types.
12795 Since there is no cheap way to tell C++/Java type w/o LTO, do checking
12796 at LTO time only. */
12797 && (in_lto_p && odr_type_p (t)))
12799 error ("type variant has different TYPE_BINFO");
12800 debug_tree (tv);
12801 error ("type variant's TYPE_BINFO");
12802 debug_tree (TYPE_BINFO (tv));
12803 error ("type's TYPE_BINFO");
12804 debug_tree (TYPE_BINFO (t));
12805 return false;
12808 /* Check various uses of TYPE_VALUES_RAW. */
12809 if (TREE_CODE (t) == ENUMERAL_TYPE)
12810 verify_variant_match (TYPE_VALUES);
12811 else if (TREE_CODE (t) == ARRAY_TYPE)
12812 verify_variant_match (TYPE_DOMAIN);
12813 /* Permit incomplete variants of complete type. While FEs may complete
12814 all variants, this does not happen for C++ templates in all cases. */
12815 else if (RECORD_OR_UNION_TYPE_P (t)
12816 && COMPLETE_TYPE_P (t)
12817 && TYPE_FIELDS (t) != TYPE_FIELDS (tv))
12819 tree f1, f2;
12821 /* Fortran builds qualified variants as new records with items of
12822 qualified type. Verify that they looks same. */
12823 for (f1 = TYPE_FIELDS (t), f2 = TYPE_FIELDS (tv);
12824 f1 && f2;
12825 f1 = TREE_CHAIN (f1), f2 = TREE_CHAIN (f2))
12826 if (TREE_CODE (f1) != FIELD_DECL || TREE_CODE (f2) != FIELD_DECL
12827 || (TYPE_MAIN_VARIANT (TREE_TYPE (f1))
12828 != TYPE_MAIN_VARIANT (TREE_TYPE (f2))
12829 /* FIXME: gfc_nonrestricted_type builds all types as variants
12830 with exception of pointer types. It deeply copies the type
12831 which means that we may end up with a variant type
12832 referring non-variant pointer. We may change it to
12833 produce types as variants, too, like
12834 objc_get_protocol_qualified_type does. */
12835 && !POINTER_TYPE_P (TREE_TYPE (f1)))
12836 || DECL_FIELD_OFFSET (f1) != DECL_FIELD_OFFSET (f2)
12837 || DECL_FIELD_BIT_OFFSET (f1) != DECL_FIELD_BIT_OFFSET (f2))
12838 break;
12839 if (f1 || f2)
12841 error ("type variant has different TYPE_FIELDS");
12842 debug_tree (tv);
12843 error ("first mismatch is field");
12844 debug_tree (f1);
12845 error ("and field");
12846 debug_tree (f2);
12847 return false;
12850 else if ((TREE_CODE (t) == FUNCTION_TYPE || TREE_CODE (t) == METHOD_TYPE))
12851 verify_variant_match (TYPE_ARG_TYPES);
12852 /* For C++ the qualified variant of array type is really an array type
12853 of qualified TREE_TYPE.
12854 objc builds variants of pointer where pointer to type is a variant, too
12855 in objc_get_protocol_qualified_type. */
12856 if (TREE_TYPE (t) != TREE_TYPE (tv)
12857 && ((TREE_CODE (t) != ARRAY_TYPE
12858 && !POINTER_TYPE_P (t))
12859 || TYPE_MAIN_VARIANT (TREE_TYPE (t))
12860 != TYPE_MAIN_VARIANT (TREE_TYPE (tv))))
12862 error ("type variant has different TREE_TYPE");
12863 debug_tree (tv);
12864 error ("type variant's TREE_TYPE");
12865 debug_tree (TREE_TYPE (tv));
12866 error ("type's TREE_TYPE");
12867 debug_tree (TREE_TYPE (t));
12868 return false;
12870 if (type_with_alias_set_p (t)
12871 && !gimple_canonical_types_compatible_p (t, tv, false))
12873 error ("type is not compatible with its variant");
12874 debug_tree (tv);
12875 error ("type variant's TREE_TYPE");
12876 debug_tree (TREE_TYPE (tv));
12877 error ("type's TREE_TYPE");
12878 debug_tree (TREE_TYPE (t));
12879 return false;
12881 return true;
12882 #undef verify_variant_match
12886 /* The TYPE_CANONICAL merging machinery. It should closely resemble
12887 the middle-end types_compatible_p function. It needs to avoid
12888 claiming types are different for types that should be treated
12889 the same with respect to TBAA. Canonical types are also used
12890 for IL consistency checks via the useless_type_conversion_p
12891 predicate which does not handle all type kinds itself but falls
12892 back to pointer-comparison of TYPE_CANONICAL for aggregates
12893 for example. */
12895 /* Return true if TYPE_UNSIGNED of TYPE should be ignored for canonical
12896 type calculation because we need to allow inter-operability between signed
12897 and unsigned variants. */
12899 bool
12900 type_with_interoperable_signedness (const_tree type)
12902 /* Fortran standard require C_SIGNED_CHAR to be interoperable with both
12903 signed char and unsigned char. Similarly fortran FE builds
12904 C_SIZE_T as signed type, while C defines it unsigned. */
12906 return tree_code_for_canonical_type_merging (TREE_CODE (type))
12907 == INTEGER_TYPE
12908 && (TYPE_PRECISION (type) == TYPE_PRECISION (signed_char_type_node)
12909 || TYPE_PRECISION (type) == TYPE_PRECISION (size_type_node));
12912 /* Return true iff T1 and T2 are structurally identical for what
12913 TBAA is concerned.
12914 This function is used both by lto.c canonical type merging and by the
12915 verifier. If TRUST_TYPE_CANONICAL we do not look into structure of types
12916 that have TYPE_CANONICAL defined and assume them equivalent. This is useful
12917 only for LTO because only in these cases TYPE_CANONICAL equivalence
12918 correspond to one defined by gimple_canonical_types_compatible_p. */
12920 bool
12921 gimple_canonical_types_compatible_p (const_tree t1, const_tree t2,
12922 bool trust_type_canonical)
12924 /* Type variants should be same as the main variant. When not doing sanity
12925 checking to verify this fact, go to main variants and save some work. */
12926 if (trust_type_canonical)
12928 t1 = TYPE_MAIN_VARIANT (t1);
12929 t2 = TYPE_MAIN_VARIANT (t2);
12932 /* Check first for the obvious case of pointer identity. */
12933 if (t1 == t2)
12934 return true;
12936 /* Check that we have two types to compare. */
12937 if (t1 == NULL_TREE || t2 == NULL_TREE)
12938 return false;
12940 /* We consider complete types always compatible with incomplete type.
12941 This does not make sense for canonical type calculation and thus we
12942 need to ensure that we are never called on it.
12944 FIXME: For more correctness the function probably should have three modes
12945 1) mode assuming that types are complete mathcing their structure
12946 2) mode allowing incomplete types but producing equivalence classes
12947 and thus ignoring all info from complete types
12948 3) mode allowing incomplete types to match complete but checking
12949 compatibility between complete types.
12951 1 and 2 can be used for canonical type calculation. 3 is the real
12952 definition of type compatibility that can be used i.e. for warnings during
12953 declaration merging. */
12955 gcc_assert (!trust_type_canonical
12956 || (type_with_alias_set_p (t1) && type_with_alias_set_p (t2)));
12957 /* If the types have been previously registered and found equal
12958 they still are. */
12960 if (TYPE_CANONICAL (t1) && TYPE_CANONICAL (t2)
12961 && trust_type_canonical)
12963 /* Do not use TYPE_CANONICAL of pointer types. For LTO streamed types
12964 they are always NULL, but they are set to non-NULL for types
12965 constructed by build_pointer_type and variants. In this case the
12966 TYPE_CANONICAL is more fine grained than the equivalnce we test (where
12967 all pointers are considered equal. Be sure to not return false
12968 negatives. */
12969 gcc_checking_assert (canonical_type_used_p (t1)
12970 && canonical_type_used_p (t2));
12971 return TYPE_CANONICAL (t1) == TYPE_CANONICAL (t2);
12974 /* Can't be the same type if the types don't have the same code. */
12975 enum tree_code code = tree_code_for_canonical_type_merging (TREE_CODE (t1));
12976 if (code != tree_code_for_canonical_type_merging (TREE_CODE (t2)))
12977 return false;
12979 /* Qualifiers do not matter for canonical type comparison purposes. */
12981 /* Void types and nullptr types are always the same. */
12982 if (TREE_CODE (t1) == VOID_TYPE
12983 || TREE_CODE (t1) == NULLPTR_TYPE)
12984 return true;
12986 /* Can't be the same type if they have different mode. */
12987 if (TYPE_MODE (t1) != TYPE_MODE (t2))
12988 return false;
12990 /* Non-aggregate types can be handled cheaply. */
12991 if (INTEGRAL_TYPE_P (t1)
12992 || SCALAR_FLOAT_TYPE_P (t1)
12993 || FIXED_POINT_TYPE_P (t1)
12994 || TREE_CODE (t1) == VECTOR_TYPE
12995 || TREE_CODE (t1) == COMPLEX_TYPE
12996 || TREE_CODE (t1) == OFFSET_TYPE
12997 || POINTER_TYPE_P (t1))
12999 /* Can't be the same type if they have different recision. */
13000 if (TYPE_PRECISION (t1) != TYPE_PRECISION (t2))
13001 return false;
13003 /* In some cases the signed and unsigned types are required to be
13004 inter-operable. */
13005 if (TYPE_UNSIGNED (t1) != TYPE_UNSIGNED (t2)
13006 && !type_with_interoperable_signedness (t1))
13007 return false;
13009 /* Fortran's C_SIGNED_CHAR is !TYPE_STRING_FLAG but needs to be
13010 interoperable with "signed char". Unless all frontends are revisited
13011 to agree on these types, we must ignore the flag completely. */
13013 /* Fortran standard define C_PTR type that is compatible with every
13014 C pointer. For this reason we need to glob all pointers into one.
13015 Still pointers in different address spaces are not compatible. */
13016 if (POINTER_TYPE_P (t1))
13018 if (TYPE_ADDR_SPACE (TREE_TYPE (t1))
13019 != TYPE_ADDR_SPACE (TREE_TYPE (t2)))
13020 return false;
13023 /* Tail-recurse to components. */
13024 if (TREE_CODE (t1) == VECTOR_TYPE
13025 || TREE_CODE (t1) == COMPLEX_TYPE)
13026 return gimple_canonical_types_compatible_p (TREE_TYPE (t1),
13027 TREE_TYPE (t2),
13028 trust_type_canonical);
13030 return true;
13033 /* Do type-specific comparisons. */
13034 switch (TREE_CODE (t1))
13036 case ARRAY_TYPE:
13037 /* Array types are the same if the element types are the same and
13038 the number of elements are the same. */
13039 if (!gimple_canonical_types_compatible_p (TREE_TYPE (t1), TREE_TYPE (t2),
13040 trust_type_canonical)
13041 || TYPE_STRING_FLAG (t1) != TYPE_STRING_FLAG (t2)
13042 || TYPE_REVERSE_STORAGE_ORDER (t1) != TYPE_REVERSE_STORAGE_ORDER (t2)
13043 || TYPE_NONALIASED_COMPONENT (t1) != TYPE_NONALIASED_COMPONENT (t2))
13044 return false;
13045 else
13047 tree i1 = TYPE_DOMAIN (t1);
13048 tree i2 = TYPE_DOMAIN (t2);
13050 /* For an incomplete external array, the type domain can be
13051 NULL_TREE. Check this condition also. */
13052 if (i1 == NULL_TREE && i2 == NULL_TREE)
13053 return true;
13054 else if (i1 == NULL_TREE || i2 == NULL_TREE)
13055 return false;
13056 else
13058 tree min1 = TYPE_MIN_VALUE (i1);
13059 tree min2 = TYPE_MIN_VALUE (i2);
13060 tree max1 = TYPE_MAX_VALUE (i1);
13061 tree max2 = TYPE_MAX_VALUE (i2);
13063 /* The minimum/maximum values have to be the same. */
13064 if ((min1 == min2
13065 || (min1 && min2
13066 && ((TREE_CODE (min1) == PLACEHOLDER_EXPR
13067 && TREE_CODE (min2) == PLACEHOLDER_EXPR)
13068 || operand_equal_p (min1, min2, 0))))
13069 && (max1 == max2
13070 || (max1 && max2
13071 && ((TREE_CODE (max1) == PLACEHOLDER_EXPR
13072 && TREE_CODE (max2) == PLACEHOLDER_EXPR)
13073 || operand_equal_p (max1, max2, 0)))))
13074 return true;
13075 else
13076 return false;
13080 case METHOD_TYPE:
13081 case FUNCTION_TYPE:
13082 /* Function types are the same if the return type and arguments types
13083 are the same. */
13084 if (!gimple_canonical_types_compatible_p (TREE_TYPE (t1), TREE_TYPE (t2),
13085 trust_type_canonical))
13086 return false;
13088 if (TYPE_ARG_TYPES (t1) == TYPE_ARG_TYPES (t2))
13089 return true;
13090 else
13092 tree parms1, parms2;
13094 for (parms1 = TYPE_ARG_TYPES (t1), parms2 = TYPE_ARG_TYPES (t2);
13095 parms1 && parms2;
13096 parms1 = TREE_CHAIN (parms1), parms2 = TREE_CHAIN (parms2))
13098 if (!gimple_canonical_types_compatible_p
13099 (TREE_VALUE (parms1), TREE_VALUE (parms2),
13100 trust_type_canonical))
13101 return false;
13104 if (parms1 || parms2)
13105 return false;
13107 return true;
13110 case RECORD_TYPE:
13111 case UNION_TYPE:
13112 case QUAL_UNION_TYPE:
13114 tree f1, f2;
13116 /* Don't try to compare variants of an incomplete type, before
13117 TYPE_FIELDS has been copied around. */
13118 if (!COMPLETE_TYPE_P (t1) && !COMPLETE_TYPE_P (t2))
13119 return true;
13122 if (TYPE_REVERSE_STORAGE_ORDER (t1) != TYPE_REVERSE_STORAGE_ORDER (t2))
13123 return false;
13125 /* For aggregate types, all the fields must be the same. */
13126 for (f1 = TYPE_FIELDS (t1), f2 = TYPE_FIELDS (t2);
13127 f1 || f2;
13128 f1 = TREE_CHAIN (f1), f2 = TREE_CHAIN (f2))
13130 /* Skip non-fields and zero-sized fields. */
13131 while (f1 && (TREE_CODE (f1) != FIELD_DECL
13132 || (DECL_SIZE (f1)
13133 && integer_zerop (DECL_SIZE (f1)))))
13134 f1 = TREE_CHAIN (f1);
13135 while (f2 && (TREE_CODE (f2) != FIELD_DECL
13136 || (DECL_SIZE (f2)
13137 && integer_zerop (DECL_SIZE (f2)))))
13138 f2 = TREE_CHAIN (f2);
13139 if (!f1 || !f2)
13140 break;
13141 /* The fields must have the same name, offset and type. */
13142 if (DECL_NONADDRESSABLE_P (f1) != DECL_NONADDRESSABLE_P (f2)
13143 || !gimple_compare_field_offset (f1, f2)
13144 || !gimple_canonical_types_compatible_p
13145 (TREE_TYPE (f1), TREE_TYPE (f2),
13146 trust_type_canonical))
13147 return false;
13150 /* If one aggregate has more fields than the other, they
13151 are not the same. */
13152 if (f1 || f2)
13153 return false;
13155 return true;
13158 default:
13159 /* Consider all types with language specific trees in them mutually
13160 compatible. This is executed only from verify_type and false
13161 positives can be tolerated. */
13162 gcc_assert (!in_lto_p);
13163 return true;
13167 /* Verify type T. */
13169 void
13170 verify_type (const_tree t)
13172 bool error_found = false;
13173 tree mv = TYPE_MAIN_VARIANT (t);
13174 if (!mv)
13176 error ("Main variant is not defined");
13177 error_found = true;
13179 else if (mv != TYPE_MAIN_VARIANT (mv))
13181 error ("TYPE_MAIN_VARIANT has different TYPE_MAIN_VARIANT");
13182 debug_tree (mv);
13183 error_found = true;
13185 else if (t != mv && !verify_type_variant (t, mv))
13186 error_found = true;
13188 tree ct = TYPE_CANONICAL (t);
13189 if (!ct)
13191 else if (TYPE_CANONICAL (t) != ct)
13193 error ("TYPE_CANONICAL has different TYPE_CANONICAL");
13194 debug_tree (ct);
13195 error_found = true;
13197 /* Method and function types can not be used to address memory and thus
13198 TYPE_CANONICAL really matters only for determining useless conversions.
13200 FIXME: C++ FE produce declarations of builtin functions that are not
13201 compatible with main variants. */
13202 else if (TREE_CODE (t) == FUNCTION_TYPE)
13204 else if (t != ct
13205 /* FIXME: gimple_canonical_types_compatible_p can not compare types
13206 with variably sized arrays because their sizes possibly
13207 gimplified to different variables. */
13208 && !variably_modified_type_p (ct, NULL)
13209 && !gimple_canonical_types_compatible_p (t, ct, false))
13211 error ("TYPE_CANONICAL is not compatible");
13212 debug_tree (ct);
13213 error_found = true;
13216 if (COMPLETE_TYPE_P (t) && TYPE_CANONICAL (t)
13217 && TYPE_MODE (t) != TYPE_MODE (TYPE_CANONICAL (t)))
13219 error ("TYPE_MODE of TYPE_CANONICAL is not compatible");
13220 debug_tree (ct);
13221 error_found = true;
13223 if (TYPE_MAIN_VARIANT (t) == t && ct && TYPE_MAIN_VARIANT (ct) != ct)
13225 error ("TYPE_CANONICAL of main variant is not main variant");
13226 debug_tree (ct);
13227 debug_tree (TYPE_MAIN_VARIANT (ct));
13228 error_found = true;
13232 /* Check various uses of TYPE_MIN_VALUE_RAW. */
13233 if (RECORD_OR_UNION_TYPE_P (t))
13235 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
13236 and danagle the pointer from time to time. */
13237 if (TYPE_VFIELD (t)
13238 && TREE_CODE (TYPE_VFIELD (t)) != FIELD_DECL
13239 && TREE_CODE (TYPE_VFIELD (t)) != TREE_LIST)
13241 error ("TYPE_VFIELD is not FIELD_DECL nor TREE_LIST");
13242 debug_tree (TYPE_VFIELD (t));
13243 error_found = true;
13246 else if (TREE_CODE (t) == POINTER_TYPE)
13248 if (TYPE_NEXT_PTR_TO (t)
13249 && TREE_CODE (TYPE_NEXT_PTR_TO (t)) != POINTER_TYPE)
13251 error ("TYPE_NEXT_PTR_TO is not POINTER_TYPE");
13252 debug_tree (TYPE_NEXT_PTR_TO (t));
13253 error_found = true;
13256 else if (TREE_CODE (t) == REFERENCE_TYPE)
13258 if (TYPE_NEXT_REF_TO (t)
13259 && TREE_CODE (TYPE_NEXT_REF_TO (t)) != REFERENCE_TYPE)
13261 error ("TYPE_NEXT_REF_TO is not REFERENCE_TYPE");
13262 debug_tree (TYPE_NEXT_REF_TO (t));
13263 error_found = true;
13266 else if (INTEGRAL_TYPE_P (t) || TREE_CODE (t) == REAL_TYPE
13267 || TREE_CODE (t) == FIXED_POINT_TYPE)
13269 /* FIXME: The following check should pass:
13270 useless_type_conversion_p (const_cast <tree> (t),
13271 TREE_TYPE (TYPE_MIN_VALUE (t))
13272 but does not for C sizetypes in LTO. */
13275 /* Check various uses of TYPE_MAXVAL_RAW. */
13276 if (RECORD_OR_UNION_TYPE_P (t))
13278 if (!TYPE_BINFO (t))
13280 else if (TREE_CODE (TYPE_BINFO (t)) != TREE_BINFO)
13282 error ("TYPE_BINFO is not TREE_BINFO");
13283 debug_tree (TYPE_BINFO (t));
13284 error_found = true;
13286 else if (TREE_TYPE (TYPE_BINFO (t)) != TYPE_MAIN_VARIANT (t))
13288 error ("TYPE_BINFO type is not TYPE_MAIN_VARIANT");
13289 debug_tree (TREE_TYPE (TYPE_BINFO (t)));
13290 error_found = true;
13293 else if (TREE_CODE (t) == FUNCTION_TYPE || TREE_CODE (t) == METHOD_TYPE)
13295 if (TYPE_METHOD_BASETYPE (t)
13296 && TREE_CODE (TYPE_METHOD_BASETYPE (t)) != RECORD_TYPE
13297 && TREE_CODE (TYPE_METHOD_BASETYPE (t)) != UNION_TYPE)
13299 error ("TYPE_METHOD_BASETYPE is not record nor union");
13300 debug_tree (TYPE_METHOD_BASETYPE (t));
13301 error_found = true;
13304 else if (TREE_CODE (t) == OFFSET_TYPE)
13306 if (TYPE_OFFSET_BASETYPE (t)
13307 && TREE_CODE (TYPE_OFFSET_BASETYPE (t)) != RECORD_TYPE
13308 && TREE_CODE (TYPE_OFFSET_BASETYPE (t)) != UNION_TYPE)
13310 error ("TYPE_OFFSET_BASETYPE is not record nor union");
13311 debug_tree (TYPE_OFFSET_BASETYPE (t));
13312 error_found = true;
13315 else if (INTEGRAL_TYPE_P (t) || TREE_CODE (t) == REAL_TYPE
13316 || TREE_CODE (t) == FIXED_POINT_TYPE)
13318 /* FIXME: The following check should pass:
13319 useless_type_conversion_p (const_cast <tree> (t),
13320 TREE_TYPE (TYPE_MAX_VALUE (t))
13321 but does not for C sizetypes in LTO. */
13323 else if (TREE_CODE (t) == ARRAY_TYPE)
13325 if (TYPE_ARRAY_MAX_SIZE (t)
13326 && TREE_CODE (TYPE_ARRAY_MAX_SIZE (t)) != INTEGER_CST)
13328 error ("TYPE_ARRAY_MAX_SIZE not INTEGER_CST");
13329 debug_tree (TYPE_ARRAY_MAX_SIZE (t));
13330 error_found = true;
13333 else if (TYPE_MAX_VALUE_RAW (t))
13335 error ("TYPE_MAX_VALUE_RAW non-NULL");
13336 debug_tree (TYPE_MAX_VALUE_RAW (t));
13337 error_found = true;
13340 if (TYPE_LANG_SLOT_1 (t) && in_lto_p)
13342 error ("TYPE_LANG_SLOT_1 (binfo) field is non-NULL");
13343 debug_tree (TYPE_LANG_SLOT_1 (t));
13344 error_found = true;
13347 /* Check various uses of TYPE_VALUES_RAW. */
13348 if (TREE_CODE (t) == ENUMERAL_TYPE)
13349 for (tree l = TYPE_VALUES (t); l; l = TREE_CHAIN (l))
13351 tree value = TREE_VALUE (l);
13352 tree name = TREE_PURPOSE (l);
13354 /* C FE porduce INTEGER_CST of INTEGER_TYPE, while C++ FE uses
13355 CONST_DECL of ENUMERAL TYPE. */
13356 if (TREE_CODE (value) != INTEGER_CST && TREE_CODE (value) != CONST_DECL)
13358 error ("Enum value is not CONST_DECL or INTEGER_CST");
13359 debug_tree (value);
13360 debug_tree (name);
13361 error_found = true;
13363 if (TREE_CODE (TREE_TYPE (value)) != INTEGER_TYPE
13364 && !useless_type_conversion_p (const_cast <tree> (t), TREE_TYPE (value)))
13366 error ("Enum value type is not INTEGER_TYPE nor convertible to the enum");
13367 debug_tree (value);
13368 debug_tree (name);
13369 error_found = true;
13371 if (TREE_CODE (name) != IDENTIFIER_NODE)
13373 error ("Enum value name is not IDENTIFIER_NODE");
13374 debug_tree (value);
13375 debug_tree (name);
13376 error_found = true;
13379 else if (TREE_CODE (t) == ARRAY_TYPE)
13381 if (TYPE_DOMAIN (t) && TREE_CODE (TYPE_DOMAIN (t)) != INTEGER_TYPE)
13383 error ("Array TYPE_DOMAIN is not integer type");
13384 debug_tree (TYPE_DOMAIN (t));
13385 error_found = true;
13388 else if (RECORD_OR_UNION_TYPE_P (t))
13390 if (TYPE_FIELDS (t) && !COMPLETE_TYPE_P (t) && in_lto_p)
13392 error ("TYPE_FIELDS defined in incomplete type");
13393 error_found = true;
13395 for (tree fld = TYPE_FIELDS (t); fld; fld = TREE_CHAIN (fld))
13397 /* TODO: verify properties of decls. */
13398 if (TREE_CODE (fld) == FIELD_DECL)
13400 else if (TREE_CODE (fld) == TYPE_DECL)
13402 else if (TREE_CODE (fld) == CONST_DECL)
13404 else if (VAR_P (fld))
13406 else if (TREE_CODE (fld) == TEMPLATE_DECL)
13408 else if (TREE_CODE (fld) == USING_DECL)
13410 else if (TREE_CODE (fld) == FUNCTION_DECL)
13412 else
13414 error ("Wrong tree in TYPE_FIELDS list");
13415 debug_tree (fld);
13416 error_found = true;
13420 else if (TREE_CODE (t) == INTEGER_TYPE
13421 || TREE_CODE (t) == BOOLEAN_TYPE
13422 || TREE_CODE (t) == OFFSET_TYPE
13423 || TREE_CODE (t) == REFERENCE_TYPE
13424 || TREE_CODE (t) == NULLPTR_TYPE
13425 || TREE_CODE (t) == POINTER_TYPE)
13427 if (TYPE_CACHED_VALUES_P (t) != (TYPE_CACHED_VALUES (t) != NULL))
13429 error ("TYPE_CACHED_VALUES_P is %i while TYPE_CACHED_VALUES is %p",
13430 TYPE_CACHED_VALUES_P (t), (void *)TYPE_CACHED_VALUES (t));
13431 error_found = true;
13433 else if (TYPE_CACHED_VALUES_P (t) && TREE_CODE (TYPE_CACHED_VALUES (t)) != TREE_VEC)
13435 error ("TYPE_CACHED_VALUES is not TREE_VEC");
13436 debug_tree (TYPE_CACHED_VALUES (t));
13437 error_found = true;
13439 /* Verify just enough of cache to ensure that no one copied it to new type.
13440 All copying should go by copy_node that should clear it. */
13441 else if (TYPE_CACHED_VALUES_P (t))
13443 int i;
13444 for (i = 0; i < TREE_VEC_LENGTH (TYPE_CACHED_VALUES (t)); i++)
13445 if (TREE_VEC_ELT (TYPE_CACHED_VALUES (t), i)
13446 && TREE_TYPE (TREE_VEC_ELT (TYPE_CACHED_VALUES (t), i)) != t)
13448 error ("wrong TYPE_CACHED_VALUES entry");
13449 debug_tree (TREE_VEC_ELT (TYPE_CACHED_VALUES (t), i));
13450 error_found = true;
13451 break;
13455 else if (TREE_CODE (t) == FUNCTION_TYPE || TREE_CODE (t) == METHOD_TYPE)
13456 for (tree l = TYPE_ARG_TYPES (t); l; l = TREE_CHAIN (l))
13458 /* C++ FE uses TREE_PURPOSE to store initial values. */
13459 if (TREE_PURPOSE (l) && in_lto_p)
13461 error ("TREE_PURPOSE is non-NULL in TYPE_ARG_TYPES list");
13462 debug_tree (l);
13463 error_found = true;
13465 if (!TYPE_P (TREE_VALUE (l)))
13467 error ("Wrong entry in TYPE_ARG_TYPES list");
13468 debug_tree (l);
13469 error_found = true;
13472 else if (!is_lang_specific (t) && TYPE_VALUES_RAW (t))
13474 error ("TYPE_VALUES_RAW field is non-NULL");
13475 debug_tree (TYPE_VALUES_RAW (t));
13476 error_found = true;
13478 if (TREE_CODE (t) != INTEGER_TYPE
13479 && TREE_CODE (t) != BOOLEAN_TYPE
13480 && TREE_CODE (t) != OFFSET_TYPE
13481 && TREE_CODE (t) != REFERENCE_TYPE
13482 && TREE_CODE (t) != NULLPTR_TYPE
13483 && TREE_CODE (t) != POINTER_TYPE
13484 && TYPE_CACHED_VALUES_P (t))
13486 error ("TYPE_CACHED_VALUES_P is set while it should not");
13487 error_found = true;
13489 if (TYPE_STRING_FLAG (t)
13490 && TREE_CODE (t) != ARRAY_TYPE && TREE_CODE (t) != INTEGER_TYPE)
13492 error ("TYPE_STRING_FLAG is set on wrong type code");
13493 error_found = true;
13496 /* ipa-devirt makes an assumption that TYPE_METHOD_BASETYPE is always
13497 TYPE_MAIN_VARIANT and it would be odd to add methods only to variatns
13498 of a type. */
13499 if (TREE_CODE (t) == METHOD_TYPE
13500 && TYPE_MAIN_VARIANT (TYPE_METHOD_BASETYPE (t)) != TYPE_METHOD_BASETYPE (t))
13502 error ("TYPE_METHOD_BASETYPE is not main variant");
13503 error_found = true;
13506 if (error_found)
13508 debug_tree (const_cast <tree> (t));
13509 internal_error ("verify_type failed");
13514 /* Return 1 if ARG interpreted as signed in its precision is known to be
13515 always positive or 2 if ARG is known to be always negative, or 3 if
13516 ARG may be positive or negative. */
13519 get_range_pos_neg (tree arg)
13521 if (arg == error_mark_node)
13522 return 3;
13524 int prec = TYPE_PRECISION (TREE_TYPE (arg));
13525 int cnt = 0;
13526 if (TREE_CODE (arg) == INTEGER_CST)
13528 wide_int w = wi::sext (arg, prec);
13529 if (wi::neg_p (w))
13530 return 2;
13531 else
13532 return 1;
13534 while (CONVERT_EXPR_P (arg)
13535 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (arg, 0)))
13536 && TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (arg, 0))) <= prec)
13538 arg = TREE_OPERAND (arg, 0);
13539 /* Narrower value zero extended into wider type
13540 will always result in positive values. */
13541 if (TYPE_UNSIGNED (TREE_TYPE (arg))
13542 && TYPE_PRECISION (TREE_TYPE (arg)) < prec)
13543 return 1;
13544 prec = TYPE_PRECISION (TREE_TYPE (arg));
13545 if (++cnt > 30)
13546 return 3;
13549 if (TREE_CODE (arg) != SSA_NAME)
13550 return 3;
13551 wide_int arg_min, arg_max;
13552 while (get_range_info (arg, &arg_min, &arg_max) != VR_RANGE)
13554 gimple *g = SSA_NAME_DEF_STMT (arg);
13555 if (is_gimple_assign (g)
13556 && CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (g)))
13558 tree t = gimple_assign_rhs1 (g);
13559 if (INTEGRAL_TYPE_P (TREE_TYPE (t))
13560 && TYPE_PRECISION (TREE_TYPE (t)) <= prec)
13562 if (TYPE_UNSIGNED (TREE_TYPE (t))
13563 && TYPE_PRECISION (TREE_TYPE (t)) < prec)
13564 return 1;
13565 prec = TYPE_PRECISION (TREE_TYPE (t));
13566 arg = t;
13567 if (++cnt > 30)
13568 return 3;
13569 continue;
13572 return 3;
13574 if (TYPE_UNSIGNED (TREE_TYPE (arg)))
13576 /* For unsigned values, the "positive" range comes
13577 below the "negative" range. */
13578 if (!wi::neg_p (wi::sext (arg_max, prec), SIGNED))
13579 return 1;
13580 if (wi::neg_p (wi::sext (arg_min, prec), SIGNED))
13581 return 2;
13583 else
13585 if (!wi::neg_p (wi::sext (arg_min, prec), SIGNED))
13586 return 1;
13587 if (wi::neg_p (wi::sext (arg_max, prec), SIGNED))
13588 return 2;
13590 return 3;
13596 /* Return true if ARG is marked with the nonnull attribute in the
13597 current function signature. */
13599 bool
13600 nonnull_arg_p (const_tree arg)
13602 tree t, attrs, fntype;
13603 unsigned HOST_WIDE_INT arg_num;
13605 gcc_assert (TREE_CODE (arg) == PARM_DECL
13606 && (POINTER_TYPE_P (TREE_TYPE (arg))
13607 || TREE_CODE (TREE_TYPE (arg)) == OFFSET_TYPE));
13609 /* The static chain decl is always non null. */
13610 if (arg == cfun->static_chain_decl)
13611 return true;
13613 /* THIS argument of method is always non-NULL. */
13614 if (TREE_CODE (TREE_TYPE (cfun->decl)) == METHOD_TYPE
13615 && arg == DECL_ARGUMENTS (cfun->decl)
13616 && flag_delete_null_pointer_checks)
13617 return true;
13619 /* Values passed by reference are always non-NULL. */
13620 if (TREE_CODE (TREE_TYPE (arg)) == REFERENCE_TYPE
13621 && flag_delete_null_pointer_checks)
13622 return true;
13624 fntype = TREE_TYPE (cfun->decl);
13625 for (attrs = TYPE_ATTRIBUTES (fntype); attrs; attrs = TREE_CHAIN (attrs))
13627 attrs = lookup_attribute ("nonnull", attrs);
13629 /* If "nonnull" wasn't specified, we know nothing about the argument. */
13630 if (attrs == NULL_TREE)
13631 return false;
13633 /* If "nonnull" applies to all the arguments, then ARG is non-null. */
13634 if (TREE_VALUE (attrs) == NULL_TREE)
13635 return true;
13637 /* Get the position number for ARG in the function signature. */
13638 for (arg_num = 1, t = DECL_ARGUMENTS (cfun->decl);
13640 t = DECL_CHAIN (t), arg_num++)
13642 if (t == arg)
13643 break;
13646 gcc_assert (t == arg);
13648 /* Now see if ARG_NUM is mentioned in the nonnull list. */
13649 for (t = TREE_VALUE (attrs); t; t = TREE_CHAIN (t))
13651 if (compare_tree_int (TREE_VALUE (t), arg_num) == 0)
13652 return true;
13656 return false;
13659 /* Combine LOC and BLOCK to a combined adhoc loc, retaining any range
13660 information. */
13662 location_t
13663 set_block (location_t loc, tree block)
13665 location_t pure_loc = get_pure_location (loc);
13666 source_range src_range = get_range_from_loc (line_table, loc);
13667 return COMBINE_LOCATION_DATA (line_table, pure_loc, src_range, block);
13670 location_t
13671 set_source_range (tree expr, location_t start, location_t finish)
13673 source_range src_range;
13674 src_range.m_start = start;
13675 src_range.m_finish = finish;
13676 return set_source_range (expr, src_range);
13679 location_t
13680 set_source_range (tree expr, source_range src_range)
13682 if (!EXPR_P (expr))
13683 return UNKNOWN_LOCATION;
13685 location_t pure_loc = get_pure_location (EXPR_LOCATION (expr));
13686 location_t adhoc = COMBINE_LOCATION_DATA (line_table,
13687 pure_loc,
13688 src_range,
13689 NULL);
13690 SET_EXPR_LOCATION (expr, adhoc);
13691 return adhoc;
13694 /* Return the name of combined function FN, for debugging purposes. */
13696 const char *
13697 combined_fn_name (combined_fn fn)
13699 if (builtin_fn_p (fn))
13701 tree fndecl = builtin_decl_explicit (as_builtin_fn (fn));
13702 return IDENTIFIER_POINTER (DECL_NAME (fndecl));
13704 else
13705 return internal_fn_name (as_internal_fn (fn));
13708 /* Return a bitmap with a bit set corresponding to each argument in
13709 a function call type FNTYPE declared with attribute nonnull,
13710 or null if none of the function's argument are nonnull. The caller
13711 must free the bitmap. */
13713 bitmap
13714 get_nonnull_args (const_tree fntype)
13716 if (fntype == NULL_TREE)
13717 return NULL;
13719 tree attrs = TYPE_ATTRIBUTES (fntype);
13720 if (!attrs)
13721 return NULL;
13723 bitmap argmap = NULL;
13725 /* A function declaration can specify multiple attribute nonnull,
13726 each with zero or more arguments. The loop below creates a bitmap
13727 representing a union of all the arguments. An empty (but non-null)
13728 bitmap means that all arguments have been declaraed nonnull. */
13729 for ( ; attrs; attrs = TREE_CHAIN (attrs))
13731 attrs = lookup_attribute ("nonnull", attrs);
13732 if (!attrs)
13733 break;
13735 if (!argmap)
13736 argmap = BITMAP_ALLOC (NULL);
13738 if (!TREE_VALUE (attrs))
13740 /* Clear the bitmap in case a previous attribute nonnull
13741 set it and this one overrides it for all arguments. */
13742 bitmap_clear (argmap);
13743 return argmap;
13746 /* Iterate over the indices of the format arguments declared nonnull
13747 and set a bit for each. */
13748 for (tree idx = TREE_VALUE (attrs); idx; idx = TREE_CHAIN (idx))
13750 unsigned int val = TREE_INT_CST_LOW (TREE_VALUE (idx)) - 1;
13751 bitmap_set_bit (argmap, val);
13755 return argmap;
13758 /* List of pointer types used to declare builtins before we have seen their
13759 real declaration.
13761 Keep the size up to date in tree.h ! */
13762 const builtin_structptr_type builtin_structptr_types[6] =
13764 { fileptr_type_node, ptr_type_node, "FILE" },
13765 { const_tm_ptr_type_node, const_ptr_type_node, "tm" },
13766 { fenv_t_ptr_type_node, ptr_type_node, "fenv_t" },
13767 { const_fenv_t_ptr_type_node, const_ptr_type_node, "fenv_t" },
13768 { fexcept_t_ptr_type_node, ptr_type_node, "fexcept_t" },
13769 { const_fexcept_t_ptr_type_node, const_ptr_type_node, "fexcept_t" }
13772 #if CHECKING_P
13774 namespace selftest {
13776 /* Selftests for tree. */
13778 /* Verify that integer constants are sane. */
13780 static void
13781 test_integer_constants ()
13783 ASSERT_TRUE (integer_type_node != NULL);
13784 ASSERT_TRUE (build_int_cst (integer_type_node, 0) != NULL);
13786 tree type = integer_type_node;
13788 tree zero = build_zero_cst (type);
13789 ASSERT_EQ (INTEGER_CST, TREE_CODE (zero));
13790 ASSERT_EQ (type, TREE_TYPE (zero));
13792 tree one = build_int_cst (type, 1);
13793 ASSERT_EQ (INTEGER_CST, TREE_CODE (one));
13794 ASSERT_EQ (type, TREE_TYPE (zero));
13797 /* Verify identifiers. */
13799 static void
13800 test_identifiers ()
13802 tree identifier = get_identifier ("foo");
13803 ASSERT_EQ (3, IDENTIFIER_LENGTH (identifier));
13804 ASSERT_STREQ ("foo", IDENTIFIER_POINTER (identifier));
13807 /* Verify LABEL_DECL. */
13809 static void
13810 test_labels ()
13812 tree identifier = get_identifier ("err");
13813 tree label_decl = build_decl (UNKNOWN_LOCATION, LABEL_DECL,
13814 identifier, void_type_node);
13815 ASSERT_EQ (-1, LABEL_DECL_UID (label_decl));
13816 ASSERT_FALSE (FORCED_LABEL (label_decl));
13819 /* Run all of the selftests within this file. */
13821 void
13822 tree_c_tests ()
13824 test_integer_constants ();
13825 test_identifiers ();
13826 test_labels ();
13829 } // namespace selftest
13831 #endif /* CHECKING_P */
13833 #include "gt-tree.h"