2014-04-15 Richard Biener <rguenther@suse.de>
[official-gcc.git] / gcc / tree.c
blobd829faaddb9f676dc9166eb7024916240f3bd0ad
1 /* Language-independent node constructors for parse phase of GNU compiler.
2 Copyright (C) 1987-2014 Free Software Foundation, Inc.
4 This file is part of GCC.
6 GCC is free software; you can redistribute it and/or modify it under
7 the terms of the GNU General Public License as published by the Free
8 Software Foundation; either version 3, or (at your option) any later
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 occasionally
28 calls language-dependent routines defined (for C) in typecheck.c. */
30 #include "config.h"
31 #include "system.h"
32 #include "coretypes.h"
33 #include "tm.h"
34 #include "flags.h"
35 #include "tree.h"
36 #include "stor-layout.h"
37 #include "calls.h"
38 #include "attribs.h"
39 #include "varasm.h"
40 #include "tm_p.h"
41 #include "function.h"
42 #include "obstack.h"
43 #include "toplev.h" /* get_random_seed */
44 #include "hashtab.h"
45 #include "filenames.h"
46 #include "output.h"
47 #include "target.h"
48 #include "common/common-target.h"
49 #include "langhooks.h"
50 #include "tree-inline.h"
51 #include "tree-iterator.h"
52 #include "basic-block.h"
53 #include "bitmap.h"
54 #include "pointer-set.h"
55 #include "tree-ssa-alias.h"
56 #include "internal-fn.h"
57 #include "gimple-expr.h"
58 #include "is-a.h"
59 #include "gimple.h"
60 #include "gimple-iterator.h"
61 #include "gimplify.h"
62 #include "gimple-ssa.h"
63 #include "cgraph.h"
64 #include "tree-phinodes.h"
65 #include "stringpool.h"
66 #include "tree-ssanames.h"
67 #include "expr.h"
68 #include "tree-dfa.h"
69 #include "params.h"
70 #include "tree-pass.h"
71 #include "langhooks-def.h"
72 #include "diagnostic.h"
73 #include "tree-diagnostic.h"
74 #include "tree-pretty-print.h"
75 #include "except.h"
76 #include "debug.h"
77 #include "intl.h"
79 /* Tree code classes. */
81 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) TYPE,
82 #define END_OF_BASE_TREE_CODES tcc_exceptional,
84 const enum tree_code_class tree_code_type[] = {
85 #include "all-tree.def"
88 #undef DEFTREECODE
89 #undef END_OF_BASE_TREE_CODES
91 /* Table indexed by tree code giving number of expression
92 operands beyond the fixed part of the node structure.
93 Not used for types or decls. */
95 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) LENGTH,
96 #define END_OF_BASE_TREE_CODES 0,
98 const unsigned char tree_code_length[] = {
99 #include "all-tree.def"
102 #undef DEFTREECODE
103 #undef END_OF_BASE_TREE_CODES
105 /* Names of tree components.
106 Used for printing out the tree and error messages. */
107 #define DEFTREECODE(SYM, NAME, TYPE, LEN) NAME,
108 #define END_OF_BASE_TREE_CODES "@dummy",
110 static const char *const tree_code_name[] = {
111 #include "all-tree.def"
114 #undef DEFTREECODE
115 #undef END_OF_BASE_TREE_CODES
117 /* Each tree code class has an associated string representation.
118 These must correspond to the tree_code_class entries. */
120 const char *const tree_code_class_strings[] =
122 "exceptional",
123 "constant",
124 "type",
125 "declaration",
126 "reference",
127 "comparison",
128 "unary",
129 "binary",
130 "statement",
131 "vl_exp",
132 "expression"
135 /* obstack.[ch] explicitly declined to prototype this. */
136 extern int _obstack_allocated_p (struct obstack *h, void *obj);
138 /* Statistics-gathering stuff. */
140 static int tree_code_counts[MAX_TREE_CODES];
141 int tree_node_counts[(int) all_kinds];
142 int tree_node_sizes[(int) all_kinds];
144 /* Keep in sync with tree.h:enum tree_node_kind. */
145 static const char * const tree_node_kind_names[] = {
146 "decls",
147 "types",
148 "blocks",
149 "stmts",
150 "refs",
151 "exprs",
152 "constants",
153 "identifiers",
154 "vecs",
155 "binfos",
156 "ssa names",
157 "constructors",
158 "random kinds",
159 "lang_decl kinds",
160 "lang_type kinds",
161 "omp clauses",
164 /* Unique id for next decl created. */
165 static GTY(()) int next_decl_uid;
166 /* Unique id for next type created. */
167 static GTY(()) int next_type_uid = 1;
168 /* Unique id for next debug decl created. Use negative numbers,
169 to catch erroneous uses. */
170 static GTY(()) int next_debug_decl_uid;
172 /* Since we cannot rehash a type after it is in the table, we have to
173 keep the hash code. */
175 struct GTY(()) type_hash {
176 unsigned long hash;
177 tree type;
180 /* Initial size of the hash table (rounded to next prime). */
181 #define TYPE_HASH_INITIAL_SIZE 1000
183 /* Now here is the hash table. When recording a type, it is added to
184 the slot whose index is the hash code. Note that the hash table is
185 used for several kinds of types (function types, array types and
186 array index range types, for now). While all these live in the
187 same table, they are completely independent, and the hash code is
188 computed differently for each of these. */
190 static GTY ((if_marked ("type_hash_marked_p"), param_is (struct type_hash)))
191 htab_t type_hash_table;
193 /* Hash table and temporary node for larger integer const values. */
194 static GTY (()) tree int_cst_node;
195 static GTY ((if_marked ("ggc_marked_p"), param_is (union tree_node)))
196 htab_t int_cst_hash_table;
198 /* Hash table for optimization flags and target option flags. Use the same
199 hash table for both sets of options. Nodes for building the current
200 optimization and target option nodes. The assumption is most of the time
201 the options created will already be in the hash table, so we avoid
202 allocating and freeing up a node repeatably. */
203 static GTY (()) tree cl_optimization_node;
204 static GTY (()) tree cl_target_option_node;
205 static GTY ((if_marked ("ggc_marked_p"), param_is (union tree_node)))
206 htab_t cl_option_hash_table;
208 /* General tree->tree mapping structure for use in hash tables. */
211 static GTY ((if_marked ("tree_decl_map_marked_p"), param_is (struct tree_decl_map)))
212 htab_t debug_expr_for_decl;
214 static GTY ((if_marked ("tree_decl_map_marked_p"), param_is (struct tree_decl_map)))
215 htab_t value_expr_for_decl;
217 static GTY ((if_marked ("tree_vec_map_marked_p"), param_is (struct tree_vec_map)))
218 htab_t debug_args_for_decl;
220 static GTY ((if_marked ("tree_priority_map_marked_p"),
221 param_is (struct tree_priority_map)))
222 htab_t init_priority_for_decl;
224 static void set_type_quals (tree, int);
225 static int type_hash_eq (const void *, const void *);
226 static hashval_t type_hash_hash (const void *);
227 static hashval_t int_cst_hash_hash (const void *);
228 static int int_cst_hash_eq (const void *, const void *);
229 static hashval_t cl_option_hash_hash (const void *);
230 static int cl_option_hash_eq (const void *, const void *);
231 static void print_type_hash_statistics (void);
232 static void print_debug_expr_statistics (void);
233 static void print_value_expr_statistics (void);
234 static int type_hash_marked_p (const void *);
235 static unsigned int type_hash_list (const_tree, hashval_t);
236 static unsigned int attribute_hash_list (const_tree, hashval_t);
237 static bool decls_same_for_odr (tree decl1, tree decl2);
239 tree global_trees[TI_MAX];
240 tree integer_types[itk_none];
242 unsigned char tree_contains_struct[MAX_TREE_CODES][64];
244 /* Number of operands for each OpenMP clause. */
245 unsigned const char omp_clause_num_ops[] =
247 0, /* OMP_CLAUSE_ERROR */
248 1, /* OMP_CLAUSE_PRIVATE */
249 1, /* OMP_CLAUSE_SHARED */
250 1, /* OMP_CLAUSE_FIRSTPRIVATE */
251 2, /* OMP_CLAUSE_LASTPRIVATE */
252 4, /* OMP_CLAUSE_REDUCTION */
253 1, /* OMP_CLAUSE_COPYIN */
254 1, /* OMP_CLAUSE_COPYPRIVATE */
255 2, /* OMP_CLAUSE_LINEAR */
256 2, /* OMP_CLAUSE_ALIGNED */
257 1, /* OMP_CLAUSE_DEPEND */
258 1, /* OMP_CLAUSE_UNIFORM */
259 2, /* OMP_CLAUSE_FROM */
260 2, /* OMP_CLAUSE_TO */
261 2, /* OMP_CLAUSE_MAP */
262 1, /* OMP_CLAUSE__LOOPTEMP_ */
263 1, /* OMP_CLAUSE_IF */
264 1, /* OMP_CLAUSE_NUM_THREADS */
265 1, /* OMP_CLAUSE_SCHEDULE */
266 0, /* OMP_CLAUSE_NOWAIT */
267 0, /* OMP_CLAUSE_ORDERED */
268 0, /* OMP_CLAUSE_DEFAULT */
269 3, /* OMP_CLAUSE_COLLAPSE */
270 0, /* OMP_CLAUSE_UNTIED */
271 1, /* OMP_CLAUSE_FINAL */
272 0, /* OMP_CLAUSE_MERGEABLE */
273 1, /* OMP_CLAUSE_DEVICE */
274 1, /* OMP_CLAUSE_DIST_SCHEDULE */
275 0, /* OMP_CLAUSE_INBRANCH */
276 0, /* OMP_CLAUSE_NOTINBRANCH */
277 1, /* OMP_CLAUSE_NUM_TEAMS */
278 1, /* OMP_CLAUSE_THREAD_LIMIT */
279 0, /* OMP_CLAUSE_PROC_BIND */
280 1, /* OMP_CLAUSE_SAFELEN */
281 1, /* OMP_CLAUSE_SIMDLEN */
282 0, /* OMP_CLAUSE_FOR */
283 0, /* OMP_CLAUSE_PARALLEL */
284 0, /* OMP_CLAUSE_SECTIONS */
285 0, /* OMP_CLAUSE_TASKGROUP */
286 1, /* OMP_CLAUSE__SIMDUID_ */
289 const char * const omp_clause_code_name[] =
291 "error_clause",
292 "private",
293 "shared",
294 "firstprivate",
295 "lastprivate",
296 "reduction",
297 "copyin",
298 "copyprivate",
299 "linear",
300 "aligned",
301 "depend",
302 "uniform",
303 "from",
304 "to",
305 "map",
306 "_looptemp_",
307 "if",
308 "num_threads",
309 "schedule",
310 "nowait",
311 "ordered",
312 "default",
313 "collapse",
314 "untied",
315 "final",
316 "mergeable",
317 "device",
318 "dist_schedule",
319 "inbranch",
320 "notinbranch",
321 "num_teams",
322 "thread_limit",
323 "proc_bind",
324 "safelen",
325 "simdlen",
326 "for",
327 "parallel",
328 "sections",
329 "taskgroup",
330 "_simduid_"
334 /* Return the tree node structure used by tree code CODE. */
336 static inline enum tree_node_structure_enum
337 tree_node_structure_for_code (enum tree_code code)
339 switch (TREE_CODE_CLASS (code))
341 case tcc_declaration:
343 switch (code)
345 case FIELD_DECL:
346 return TS_FIELD_DECL;
347 case PARM_DECL:
348 return TS_PARM_DECL;
349 case VAR_DECL:
350 return TS_VAR_DECL;
351 case LABEL_DECL:
352 return TS_LABEL_DECL;
353 case RESULT_DECL:
354 return TS_RESULT_DECL;
355 case DEBUG_EXPR_DECL:
356 return TS_DECL_WRTL;
357 case CONST_DECL:
358 return TS_CONST_DECL;
359 case TYPE_DECL:
360 return TS_TYPE_DECL;
361 case FUNCTION_DECL:
362 return TS_FUNCTION_DECL;
363 case TRANSLATION_UNIT_DECL:
364 return TS_TRANSLATION_UNIT_DECL;
365 default:
366 return TS_DECL_NON_COMMON;
369 case tcc_type:
370 return TS_TYPE_NON_COMMON;
371 case tcc_reference:
372 case tcc_comparison:
373 case tcc_unary:
374 case tcc_binary:
375 case tcc_expression:
376 case tcc_statement:
377 case tcc_vl_exp:
378 return TS_EXP;
379 default: /* tcc_constant and tcc_exceptional */
380 break;
382 switch (code)
384 /* tcc_constant cases. */
385 case INTEGER_CST: return TS_INT_CST;
386 case REAL_CST: return TS_REAL_CST;
387 case FIXED_CST: return TS_FIXED_CST;
388 case COMPLEX_CST: return TS_COMPLEX;
389 case VECTOR_CST: return TS_VECTOR;
390 case STRING_CST: return TS_STRING;
391 /* tcc_exceptional cases. */
392 case ERROR_MARK: return TS_COMMON;
393 case IDENTIFIER_NODE: return TS_IDENTIFIER;
394 case TREE_LIST: return TS_LIST;
395 case TREE_VEC: return TS_VEC;
396 case SSA_NAME: return TS_SSA_NAME;
397 case PLACEHOLDER_EXPR: return TS_COMMON;
398 case STATEMENT_LIST: return TS_STATEMENT_LIST;
399 case BLOCK: return TS_BLOCK;
400 case CONSTRUCTOR: return TS_CONSTRUCTOR;
401 case TREE_BINFO: return TS_BINFO;
402 case OMP_CLAUSE: return TS_OMP_CLAUSE;
403 case OPTIMIZATION_NODE: return TS_OPTIMIZATION;
404 case TARGET_OPTION_NODE: return TS_TARGET_OPTION;
406 default:
407 gcc_unreachable ();
412 /* Initialize tree_contains_struct to describe the hierarchy of tree
413 nodes. */
415 static void
416 initialize_tree_contains_struct (void)
418 unsigned i;
420 for (i = ERROR_MARK; i < LAST_AND_UNUSED_TREE_CODE; i++)
422 enum tree_code code;
423 enum tree_node_structure_enum ts_code;
425 code = (enum tree_code) i;
426 ts_code = tree_node_structure_for_code (code);
428 /* Mark the TS structure itself. */
429 tree_contains_struct[code][ts_code] = 1;
431 /* Mark all the structures that TS is derived from. */
432 switch (ts_code)
434 case TS_TYPED:
435 case TS_BLOCK:
436 MARK_TS_BASE (code);
437 break;
439 case TS_COMMON:
440 case TS_INT_CST:
441 case TS_REAL_CST:
442 case TS_FIXED_CST:
443 case TS_VECTOR:
444 case TS_STRING:
445 case TS_COMPLEX:
446 case TS_SSA_NAME:
447 case TS_CONSTRUCTOR:
448 case TS_EXP:
449 case TS_STATEMENT_LIST:
450 MARK_TS_TYPED (code);
451 break;
453 case TS_IDENTIFIER:
454 case TS_DECL_MINIMAL:
455 case TS_TYPE_COMMON:
456 case TS_LIST:
457 case TS_VEC:
458 case TS_BINFO:
459 case TS_OMP_CLAUSE:
460 case TS_OPTIMIZATION:
461 case TS_TARGET_OPTION:
462 MARK_TS_COMMON (code);
463 break;
465 case TS_TYPE_WITH_LANG_SPECIFIC:
466 MARK_TS_TYPE_COMMON (code);
467 break;
469 case TS_TYPE_NON_COMMON:
470 MARK_TS_TYPE_WITH_LANG_SPECIFIC (code);
471 break;
473 case TS_DECL_COMMON:
474 MARK_TS_DECL_MINIMAL (code);
475 break;
477 case TS_DECL_WRTL:
478 case TS_CONST_DECL:
479 MARK_TS_DECL_COMMON (code);
480 break;
482 case TS_DECL_NON_COMMON:
483 MARK_TS_DECL_WITH_VIS (code);
484 break;
486 case TS_DECL_WITH_VIS:
487 case TS_PARM_DECL:
488 case TS_LABEL_DECL:
489 case TS_RESULT_DECL:
490 MARK_TS_DECL_WRTL (code);
491 break;
493 case TS_FIELD_DECL:
494 MARK_TS_DECL_COMMON (code);
495 break;
497 case TS_VAR_DECL:
498 MARK_TS_DECL_WITH_VIS (code);
499 break;
501 case TS_TYPE_DECL:
502 case TS_FUNCTION_DECL:
503 MARK_TS_DECL_NON_COMMON (code);
504 break;
506 case TS_TRANSLATION_UNIT_DECL:
507 MARK_TS_DECL_COMMON (code);
508 break;
510 default:
511 gcc_unreachable ();
515 /* Basic consistency checks for attributes used in fold. */
516 gcc_assert (tree_contains_struct[FUNCTION_DECL][TS_DECL_NON_COMMON]);
517 gcc_assert (tree_contains_struct[TYPE_DECL][TS_DECL_NON_COMMON]);
518 gcc_assert (tree_contains_struct[CONST_DECL][TS_DECL_COMMON]);
519 gcc_assert (tree_contains_struct[VAR_DECL][TS_DECL_COMMON]);
520 gcc_assert (tree_contains_struct[PARM_DECL][TS_DECL_COMMON]);
521 gcc_assert (tree_contains_struct[RESULT_DECL][TS_DECL_COMMON]);
522 gcc_assert (tree_contains_struct[FUNCTION_DECL][TS_DECL_COMMON]);
523 gcc_assert (tree_contains_struct[TYPE_DECL][TS_DECL_COMMON]);
524 gcc_assert (tree_contains_struct[TRANSLATION_UNIT_DECL][TS_DECL_COMMON]);
525 gcc_assert (tree_contains_struct[LABEL_DECL][TS_DECL_COMMON]);
526 gcc_assert (tree_contains_struct[FIELD_DECL][TS_DECL_COMMON]);
527 gcc_assert (tree_contains_struct[VAR_DECL][TS_DECL_WRTL]);
528 gcc_assert (tree_contains_struct[PARM_DECL][TS_DECL_WRTL]);
529 gcc_assert (tree_contains_struct[RESULT_DECL][TS_DECL_WRTL]);
530 gcc_assert (tree_contains_struct[FUNCTION_DECL][TS_DECL_WRTL]);
531 gcc_assert (tree_contains_struct[LABEL_DECL][TS_DECL_WRTL]);
532 gcc_assert (tree_contains_struct[CONST_DECL][TS_DECL_MINIMAL]);
533 gcc_assert (tree_contains_struct[VAR_DECL][TS_DECL_MINIMAL]);
534 gcc_assert (tree_contains_struct[PARM_DECL][TS_DECL_MINIMAL]);
535 gcc_assert (tree_contains_struct[RESULT_DECL][TS_DECL_MINIMAL]);
536 gcc_assert (tree_contains_struct[FUNCTION_DECL][TS_DECL_MINIMAL]);
537 gcc_assert (tree_contains_struct[TYPE_DECL][TS_DECL_MINIMAL]);
538 gcc_assert (tree_contains_struct[TRANSLATION_UNIT_DECL][TS_DECL_MINIMAL]);
539 gcc_assert (tree_contains_struct[LABEL_DECL][TS_DECL_MINIMAL]);
540 gcc_assert (tree_contains_struct[FIELD_DECL][TS_DECL_MINIMAL]);
541 gcc_assert (tree_contains_struct[VAR_DECL][TS_DECL_WITH_VIS]);
542 gcc_assert (tree_contains_struct[FUNCTION_DECL][TS_DECL_WITH_VIS]);
543 gcc_assert (tree_contains_struct[TYPE_DECL][TS_DECL_WITH_VIS]);
544 gcc_assert (tree_contains_struct[VAR_DECL][TS_VAR_DECL]);
545 gcc_assert (tree_contains_struct[FIELD_DECL][TS_FIELD_DECL]);
546 gcc_assert (tree_contains_struct[PARM_DECL][TS_PARM_DECL]);
547 gcc_assert (tree_contains_struct[LABEL_DECL][TS_LABEL_DECL]);
548 gcc_assert (tree_contains_struct[RESULT_DECL][TS_RESULT_DECL]);
549 gcc_assert (tree_contains_struct[CONST_DECL][TS_CONST_DECL]);
550 gcc_assert (tree_contains_struct[TYPE_DECL][TS_TYPE_DECL]);
551 gcc_assert (tree_contains_struct[FUNCTION_DECL][TS_FUNCTION_DECL]);
552 gcc_assert (tree_contains_struct[IMPORTED_DECL][TS_DECL_MINIMAL]);
553 gcc_assert (tree_contains_struct[IMPORTED_DECL][TS_DECL_COMMON]);
554 gcc_assert (tree_contains_struct[NAMELIST_DECL][TS_DECL_MINIMAL]);
555 gcc_assert (tree_contains_struct[NAMELIST_DECL][TS_DECL_COMMON]);
559 /* Init tree.c. */
561 void
562 init_ttree (void)
564 /* Initialize the hash table of types. */
565 type_hash_table = htab_create_ggc (TYPE_HASH_INITIAL_SIZE, type_hash_hash,
566 type_hash_eq, 0);
568 debug_expr_for_decl = htab_create_ggc (512, tree_decl_map_hash,
569 tree_decl_map_eq, 0);
571 value_expr_for_decl = htab_create_ggc (512, tree_decl_map_hash,
572 tree_decl_map_eq, 0);
573 init_priority_for_decl = htab_create_ggc (512, tree_priority_map_hash,
574 tree_priority_map_eq, 0);
576 int_cst_hash_table = htab_create_ggc (1024, int_cst_hash_hash,
577 int_cst_hash_eq, NULL);
579 int_cst_node = make_node (INTEGER_CST);
581 cl_option_hash_table = htab_create_ggc (64, cl_option_hash_hash,
582 cl_option_hash_eq, NULL);
584 cl_optimization_node = make_node (OPTIMIZATION_NODE);
585 cl_target_option_node = make_node (TARGET_OPTION_NODE);
587 /* Initialize the tree_contains_struct array. */
588 initialize_tree_contains_struct ();
589 lang_hooks.init_ts ();
593 /* The name of the object as the assembler will see it (but before any
594 translations made by ASM_OUTPUT_LABELREF). Often this is the same
595 as DECL_NAME. It is an IDENTIFIER_NODE. */
596 tree
597 decl_assembler_name (tree decl)
599 if (!DECL_ASSEMBLER_NAME_SET_P (decl))
600 lang_hooks.set_decl_assembler_name (decl);
601 return DECL_WITH_VIS_CHECK (decl)->decl_with_vis.assembler_name;
604 /* Compute the number of bytes occupied by a tree with code CODE.
605 This function cannot be used for nodes that have variable sizes,
606 including TREE_VEC, STRING_CST, and CALL_EXPR. */
607 size_t
608 tree_code_size (enum tree_code code)
610 switch (TREE_CODE_CLASS (code))
612 case tcc_declaration: /* A decl node */
614 switch (code)
616 case FIELD_DECL:
617 return sizeof (struct tree_field_decl);
618 case PARM_DECL:
619 return sizeof (struct tree_parm_decl);
620 case VAR_DECL:
621 return sizeof (struct tree_var_decl);
622 case LABEL_DECL:
623 return sizeof (struct tree_label_decl);
624 case RESULT_DECL:
625 return sizeof (struct tree_result_decl);
626 case CONST_DECL:
627 return sizeof (struct tree_const_decl);
628 case TYPE_DECL:
629 return sizeof (struct tree_type_decl);
630 case FUNCTION_DECL:
631 return sizeof (struct tree_function_decl);
632 case DEBUG_EXPR_DECL:
633 return sizeof (struct tree_decl_with_rtl);
634 default:
635 return sizeof (struct tree_decl_non_common);
639 case tcc_type: /* a type node */
640 return sizeof (struct tree_type_non_common);
642 case tcc_reference: /* a reference */
643 case tcc_expression: /* an expression */
644 case tcc_statement: /* an expression with side effects */
645 case tcc_comparison: /* a comparison expression */
646 case tcc_unary: /* a unary arithmetic expression */
647 case tcc_binary: /* a binary arithmetic expression */
648 return (sizeof (struct tree_exp)
649 + (TREE_CODE_LENGTH (code) - 1) * sizeof (tree));
651 case tcc_constant: /* a constant */
652 switch (code)
654 case INTEGER_CST: return sizeof (struct tree_int_cst);
655 case REAL_CST: return sizeof (struct tree_real_cst);
656 case FIXED_CST: return sizeof (struct tree_fixed_cst);
657 case COMPLEX_CST: return sizeof (struct tree_complex);
658 case VECTOR_CST: return sizeof (struct tree_vector);
659 case STRING_CST: gcc_unreachable ();
660 default:
661 return lang_hooks.tree_size (code);
664 case tcc_exceptional: /* something random, like an identifier. */
665 switch (code)
667 case IDENTIFIER_NODE: return lang_hooks.identifier_size;
668 case TREE_LIST: return sizeof (struct tree_list);
670 case ERROR_MARK:
671 case PLACEHOLDER_EXPR: return sizeof (struct tree_common);
673 case TREE_VEC:
674 case OMP_CLAUSE: gcc_unreachable ();
676 case SSA_NAME: return sizeof (struct tree_ssa_name);
678 case STATEMENT_LIST: return sizeof (struct tree_statement_list);
679 case BLOCK: return sizeof (struct tree_block);
680 case CONSTRUCTOR: return sizeof (struct tree_constructor);
681 case OPTIMIZATION_NODE: return sizeof (struct tree_optimization_option);
682 case TARGET_OPTION_NODE: return sizeof (struct tree_target_option);
684 default:
685 return lang_hooks.tree_size (code);
688 default:
689 gcc_unreachable ();
693 /* Compute the number of bytes occupied by NODE. This routine only
694 looks at TREE_CODE, except for those nodes that have variable sizes. */
695 size_t
696 tree_size (const_tree node)
698 const enum tree_code code = TREE_CODE (node);
699 switch (code)
701 case TREE_BINFO:
702 return (offsetof (struct tree_binfo, base_binfos)
703 + vec<tree, va_gc>
704 ::embedded_size (BINFO_N_BASE_BINFOS (node)));
706 case TREE_VEC:
707 return (sizeof (struct tree_vec)
708 + (TREE_VEC_LENGTH (node) - 1) * sizeof (tree));
710 case VECTOR_CST:
711 return (sizeof (struct tree_vector)
712 + (TYPE_VECTOR_SUBPARTS (TREE_TYPE (node)) - 1) * sizeof (tree));
714 case STRING_CST:
715 return TREE_STRING_LENGTH (node) + offsetof (struct tree_string, str) + 1;
717 case OMP_CLAUSE:
718 return (sizeof (struct tree_omp_clause)
719 + (omp_clause_num_ops[OMP_CLAUSE_CODE (node)] - 1)
720 * sizeof (tree));
722 default:
723 if (TREE_CODE_CLASS (code) == tcc_vl_exp)
724 return (sizeof (struct tree_exp)
725 + (VL_EXP_OPERAND_LENGTH (node) - 1) * sizeof (tree));
726 else
727 return tree_code_size (code);
731 /* Record interesting allocation statistics for a tree node with CODE
732 and LENGTH. */
734 static void
735 record_node_allocation_statistics (enum tree_code code ATTRIBUTE_UNUSED,
736 size_t length ATTRIBUTE_UNUSED)
738 enum tree_code_class type = TREE_CODE_CLASS (code);
739 tree_node_kind kind;
741 if (!GATHER_STATISTICS)
742 return;
744 switch (type)
746 case tcc_declaration: /* A decl node */
747 kind = d_kind;
748 break;
750 case tcc_type: /* a type node */
751 kind = t_kind;
752 break;
754 case tcc_statement: /* an expression with side effects */
755 kind = s_kind;
756 break;
758 case tcc_reference: /* a reference */
759 kind = r_kind;
760 break;
762 case tcc_expression: /* an expression */
763 case tcc_comparison: /* a comparison expression */
764 case tcc_unary: /* a unary arithmetic expression */
765 case tcc_binary: /* a binary arithmetic expression */
766 kind = e_kind;
767 break;
769 case tcc_constant: /* a constant */
770 kind = c_kind;
771 break;
773 case tcc_exceptional: /* something random, like an identifier. */
774 switch (code)
776 case IDENTIFIER_NODE:
777 kind = id_kind;
778 break;
780 case TREE_VEC:
781 kind = vec_kind;
782 break;
784 case TREE_BINFO:
785 kind = binfo_kind;
786 break;
788 case SSA_NAME:
789 kind = ssa_name_kind;
790 break;
792 case BLOCK:
793 kind = b_kind;
794 break;
796 case CONSTRUCTOR:
797 kind = constr_kind;
798 break;
800 case OMP_CLAUSE:
801 kind = omp_clause_kind;
802 break;
804 default:
805 kind = x_kind;
806 break;
808 break;
810 case tcc_vl_exp:
811 kind = e_kind;
812 break;
814 default:
815 gcc_unreachable ();
818 tree_code_counts[(int) code]++;
819 tree_node_counts[(int) kind]++;
820 tree_node_sizes[(int) kind] += length;
823 /* Allocate and return a new UID from the DECL_UID namespace. */
826 allocate_decl_uid (void)
828 return next_decl_uid++;
831 /* Return a newly allocated node of code CODE. For decl and type
832 nodes, some other fields are initialized. The rest of the node is
833 initialized to zero. This function cannot be used for TREE_VEC or
834 OMP_CLAUSE nodes, which is enforced by asserts in tree_code_size.
836 Achoo! I got a code in the node. */
838 tree
839 make_node_stat (enum tree_code code MEM_STAT_DECL)
841 tree t;
842 enum tree_code_class type = TREE_CODE_CLASS (code);
843 size_t length = tree_code_size (code);
845 record_node_allocation_statistics (code, length);
847 t = ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT);
848 TREE_SET_CODE (t, code);
850 switch (type)
852 case tcc_statement:
853 TREE_SIDE_EFFECTS (t) = 1;
854 break;
856 case tcc_declaration:
857 if (CODE_CONTAINS_STRUCT (code, TS_DECL_COMMON))
859 if (code == FUNCTION_DECL)
861 DECL_ALIGN (t) = FUNCTION_BOUNDARY;
862 DECL_MODE (t) = FUNCTION_MODE;
864 else
865 DECL_ALIGN (t) = 1;
867 DECL_SOURCE_LOCATION (t) = input_location;
868 if (TREE_CODE (t) == DEBUG_EXPR_DECL)
869 DECL_UID (t) = --next_debug_decl_uid;
870 else
872 DECL_UID (t) = allocate_decl_uid ();
873 SET_DECL_PT_UID (t, -1);
875 if (TREE_CODE (t) == LABEL_DECL)
876 LABEL_DECL_UID (t) = -1;
878 break;
880 case tcc_type:
881 TYPE_UID (t) = next_type_uid++;
882 TYPE_ALIGN (t) = BITS_PER_UNIT;
883 TYPE_USER_ALIGN (t) = 0;
884 TYPE_MAIN_VARIANT (t) = t;
885 TYPE_CANONICAL (t) = t;
887 /* Default to no attributes for type, but let target change that. */
888 TYPE_ATTRIBUTES (t) = NULL_TREE;
889 targetm.set_default_type_attributes (t);
891 /* We have not yet computed the alias set for this type. */
892 TYPE_ALIAS_SET (t) = -1;
893 break;
895 case tcc_constant:
896 TREE_CONSTANT (t) = 1;
897 break;
899 case tcc_expression:
900 switch (code)
902 case INIT_EXPR:
903 case MODIFY_EXPR:
904 case VA_ARG_EXPR:
905 case PREDECREMENT_EXPR:
906 case PREINCREMENT_EXPR:
907 case POSTDECREMENT_EXPR:
908 case POSTINCREMENT_EXPR:
909 /* All of these have side-effects, no matter what their
910 operands are. */
911 TREE_SIDE_EFFECTS (t) = 1;
912 break;
914 default:
915 break;
917 break;
919 default:
920 /* Other classes need no special treatment. */
921 break;
924 return t;
927 /* Return a new node with the same contents as NODE except that its
928 TREE_CHAIN, if it has one, is zero and it has a fresh uid. */
930 tree
931 copy_node_stat (tree node MEM_STAT_DECL)
933 tree t;
934 enum tree_code code = TREE_CODE (node);
935 size_t length;
937 gcc_assert (code != STATEMENT_LIST);
939 length = tree_size (node);
940 record_node_allocation_statistics (code, length);
941 t = ggc_alloc_tree_node_stat (length PASS_MEM_STAT);
942 memcpy (t, node, length);
944 if (CODE_CONTAINS_STRUCT (code, TS_COMMON))
945 TREE_CHAIN (t) = 0;
946 TREE_ASM_WRITTEN (t) = 0;
947 TREE_VISITED (t) = 0;
949 if (TREE_CODE_CLASS (code) == tcc_declaration)
951 if (code == DEBUG_EXPR_DECL)
952 DECL_UID (t) = --next_debug_decl_uid;
953 else
955 DECL_UID (t) = allocate_decl_uid ();
956 if (DECL_PT_UID_SET_P (node))
957 SET_DECL_PT_UID (t, DECL_PT_UID (node));
959 if ((TREE_CODE (node) == PARM_DECL || TREE_CODE (node) == VAR_DECL)
960 && DECL_HAS_VALUE_EXPR_P (node))
962 SET_DECL_VALUE_EXPR (t, DECL_VALUE_EXPR (node));
963 DECL_HAS_VALUE_EXPR_P (t) = 1;
965 /* DECL_DEBUG_EXPR is copied explicitely by callers. */
966 if (TREE_CODE (node) == VAR_DECL)
967 DECL_HAS_DEBUG_EXPR_P (t) = 0;
968 if (TREE_CODE (node) == VAR_DECL && DECL_HAS_INIT_PRIORITY_P (node))
970 SET_DECL_INIT_PRIORITY (t, DECL_INIT_PRIORITY (node));
971 DECL_HAS_INIT_PRIORITY_P (t) = 1;
973 if (TREE_CODE (node) == FUNCTION_DECL)
974 DECL_STRUCT_FUNCTION (t) = NULL;
976 else if (TREE_CODE_CLASS (code) == tcc_type)
978 TYPE_UID (t) = next_type_uid++;
979 /* The following is so that the debug code for
980 the copy is different from the original type.
981 The two statements usually duplicate each other
982 (because they clear fields of the same union),
983 but the optimizer should catch that. */
984 TYPE_SYMTAB_POINTER (t) = 0;
985 TYPE_SYMTAB_ADDRESS (t) = 0;
987 /* Do not copy the values cache. */
988 if (TYPE_CACHED_VALUES_P (t))
990 TYPE_CACHED_VALUES_P (t) = 0;
991 TYPE_CACHED_VALUES (t) = NULL_TREE;
995 return t;
998 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
999 For example, this can copy a list made of TREE_LIST nodes. */
1001 tree
1002 copy_list (tree list)
1004 tree head;
1005 tree prev, next;
1007 if (list == 0)
1008 return 0;
1010 head = prev = copy_node (list);
1011 next = TREE_CHAIN (list);
1012 while (next)
1014 TREE_CHAIN (prev) = copy_node (next);
1015 prev = TREE_CHAIN (prev);
1016 next = TREE_CHAIN (next);
1018 return head;
1022 /* Create an INT_CST node with a LOW value sign extended to TYPE. */
1024 tree
1025 build_int_cst (tree type, HOST_WIDE_INT low)
1027 /* Support legacy code. */
1028 if (!type)
1029 type = integer_type_node;
1031 return double_int_to_tree (type, double_int::from_shwi (low));
1034 /* Create an INT_CST node with a LOW value sign extended to TYPE. */
1036 tree
1037 build_int_cst_type (tree type, HOST_WIDE_INT low)
1039 gcc_assert (type);
1041 return double_int_to_tree (type, double_int::from_shwi (low));
1044 /* Constructs tree in type TYPE from with value given by CST. Signedness
1045 of CST is assumed to be the same as the signedness of TYPE. */
1047 tree
1048 double_int_to_tree (tree type, double_int cst)
1050 bool sign_extended_type = !TYPE_UNSIGNED (type);
1052 cst = cst.ext (TYPE_PRECISION (type), !sign_extended_type);
1054 return build_int_cst_wide (type, cst.low, cst.high);
1057 /* Returns true if CST fits into range of TYPE. Signedness of CST is assumed
1058 to be the same as the signedness of TYPE. */
1060 bool
1061 double_int_fits_to_tree_p (const_tree type, double_int cst)
1063 bool sign_extended_type = !TYPE_UNSIGNED (type);
1065 double_int ext
1066 = cst.ext (TYPE_PRECISION (type), !sign_extended_type);
1068 return cst == ext;
1071 /* We force the double_int CST to the range of the type TYPE by sign or
1072 zero extending it. OVERFLOWABLE indicates if we are interested in
1073 overflow of the value, when >0 we are only interested in signed
1074 overflow, for <0 we are interested in any overflow. OVERFLOWED
1075 indicates whether overflow has already occurred. CONST_OVERFLOWED
1076 indicates whether constant overflow has already occurred. We force
1077 T's value to be within range of T's type (by setting to 0 or 1 all
1078 the bits outside the type's range). We set TREE_OVERFLOWED if,
1079 OVERFLOWED is nonzero,
1080 or OVERFLOWABLE is >0 and signed overflow occurs
1081 or OVERFLOWABLE is <0 and any overflow occurs
1082 We return a new tree node for the extended double_int. The node
1083 is shared if no overflow flags are set. */
1086 tree
1087 force_fit_type_double (tree type, double_int cst, int overflowable,
1088 bool overflowed)
1090 bool sign_extended_type = !TYPE_UNSIGNED (type);
1092 /* If we need to set overflow flags, return a new unshared node. */
1093 if (overflowed || !double_int_fits_to_tree_p (type, cst))
1095 if (overflowed
1096 || overflowable < 0
1097 || (overflowable > 0 && sign_extended_type))
1099 tree t = make_node (INTEGER_CST);
1100 TREE_INT_CST (t)
1101 = cst.ext (TYPE_PRECISION (type), !sign_extended_type);
1102 TREE_TYPE (t) = type;
1103 TREE_OVERFLOW (t) = 1;
1104 return t;
1108 /* Else build a shared node. */
1109 return double_int_to_tree (type, cst);
1112 /* These are the hash table functions for the hash table of INTEGER_CST
1113 nodes of a sizetype. */
1115 /* Return the hash code code X, an INTEGER_CST. */
1117 static hashval_t
1118 int_cst_hash_hash (const void *x)
1120 const_tree const t = (const_tree) x;
1122 return (TREE_INT_CST_HIGH (t) ^ TREE_INT_CST_LOW (t)
1123 ^ htab_hash_pointer (TREE_TYPE (t)));
1126 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
1127 is the same as that given by *Y, which is the same. */
1129 static int
1130 int_cst_hash_eq (const void *x, const void *y)
1132 const_tree const xt = (const_tree) x;
1133 const_tree const yt = (const_tree) y;
1135 return (TREE_TYPE (xt) == TREE_TYPE (yt)
1136 && TREE_INT_CST_HIGH (xt) == TREE_INT_CST_HIGH (yt)
1137 && TREE_INT_CST_LOW (xt) == TREE_INT_CST_LOW (yt));
1140 /* Create an INT_CST node of TYPE and value HI:LOW.
1141 The returned node is always shared. For small integers we use a
1142 per-type vector cache, for larger ones we use a single hash table. */
1144 tree
1145 build_int_cst_wide (tree type, unsigned HOST_WIDE_INT low, HOST_WIDE_INT hi)
1147 tree t;
1148 int ix = -1;
1149 int limit = 0;
1151 gcc_assert (type);
1153 switch (TREE_CODE (type))
1155 case NULLPTR_TYPE:
1156 gcc_assert (hi == 0 && low == 0);
1157 /* Fallthru. */
1159 case POINTER_TYPE:
1160 case REFERENCE_TYPE:
1161 /* Cache NULL pointer. */
1162 if (!hi && !low)
1164 limit = 1;
1165 ix = 0;
1167 break;
1169 case BOOLEAN_TYPE:
1170 /* Cache false or true. */
1171 limit = 2;
1172 if (!hi && low < 2)
1173 ix = low;
1174 break;
1176 case INTEGER_TYPE:
1177 case OFFSET_TYPE:
1178 if (TYPE_UNSIGNED (type))
1180 /* Cache 0..N */
1181 limit = INTEGER_SHARE_LIMIT;
1182 if (!hi && low < (unsigned HOST_WIDE_INT)INTEGER_SHARE_LIMIT)
1183 ix = low;
1185 else
1187 /* Cache -1..N */
1188 limit = INTEGER_SHARE_LIMIT + 1;
1189 if (!hi && low < (unsigned HOST_WIDE_INT)INTEGER_SHARE_LIMIT)
1190 ix = low + 1;
1191 else if (hi == -1 && low == -(unsigned HOST_WIDE_INT)1)
1192 ix = 0;
1194 break;
1196 case ENUMERAL_TYPE:
1197 break;
1199 default:
1200 gcc_unreachable ();
1203 if (ix >= 0)
1205 /* Look for it in the type's vector of small shared ints. */
1206 if (!TYPE_CACHED_VALUES_P (type))
1208 TYPE_CACHED_VALUES_P (type) = 1;
1209 TYPE_CACHED_VALUES (type) = make_tree_vec (limit);
1212 t = TREE_VEC_ELT (TYPE_CACHED_VALUES (type), ix);
1213 if (t)
1215 /* Make sure no one is clobbering the shared constant. */
1216 gcc_assert (TREE_TYPE (t) == type);
1217 gcc_assert (TREE_INT_CST_LOW (t) == low);
1218 gcc_assert (TREE_INT_CST_HIGH (t) == hi);
1220 else
1222 /* Create a new shared int. */
1223 t = make_node (INTEGER_CST);
1225 TREE_INT_CST_LOW (t) = low;
1226 TREE_INT_CST_HIGH (t) = hi;
1227 TREE_TYPE (t) = type;
1229 TREE_VEC_ELT (TYPE_CACHED_VALUES (type), ix) = t;
1232 else
1234 /* Use the cache of larger shared ints. */
1235 void **slot;
1237 TREE_INT_CST_LOW (int_cst_node) = low;
1238 TREE_INT_CST_HIGH (int_cst_node) = hi;
1239 TREE_TYPE (int_cst_node) = type;
1241 slot = htab_find_slot (int_cst_hash_table, int_cst_node, INSERT);
1242 t = (tree) *slot;
1243 if (!t)
1245 /* Insert this one into the hash table. */
1246 t = int_cst_node;
1247 *slot = t;
1248 /* Make a new node for next time round. */
1249 int_cst_node = make_node (INTEGER_CST);
1253 return t;
1256 void
1257 cache_integer_cst (tree t)
1259 tree type = TREE_TYPE (t);
1260 HOST_WIDE_INT hi = TREE_INT_CST_HIGH (t);
1261 unsigned HOST_WIDE_INT low = TREE_INT_CST_LOW (t);
1262 int ix = -1;
1263 int limit = 0;
1265 gcc_assert (!TREE_OVERFLOW (t));
1267 switch (TREE_CODE (type))
1269 case NULLPTR_TYPE:
1270 gcc_assert (hi == 0 && low == 0);
1271 /* Fallthru. */
1273 case POINTER_TYPE:
1274 case REFERENCE_TYPE:
1275 /* Cache NULL pointer. */
1276 if (!hi && !low)
1278 limit = 1;
1279 ix = 0;
1281 break;
1283 case BOOLEAN_TYPE:
1284 /* Cache false or true. */
1285 limit = 2;
1286 if (!hi && low < 2)
1287 ix = low;
1288 break;
1290 case INTEGER_TYPE:
1291 case OFFSET_TYPE:
1292 if (TYPE_UNSIGNED (type))
1294 /* Cache 0..N */
1295 limit = INTEGER_SHARE_LIMIT;
1296 if (!hi && low < (unsigned HOST_WIDE_INT)INTEGER_SHARE_LIMIT)
1297 ix = low;
1299 else
1301 /* Cache -1..N */
1302 limit = INTEGER_SHARE_LIMIT + 1;
1303 if (!hi && low < (unsigned HOST_WIDE_INT)INTEGER_SHARE_LIMIT)
1304 ix = low + 1;
1305 else if (hi == -1 && low == -(unsigned HOST_WIDE_INT)1)
1306 ix = 0;
1308 break;
1310 case ENUMERAL_TYPE:
1311 break;
1313 default:
1314 gcc_unreachable ();
1317 if (ix >= 0)
1319 /* Look for it in the type's vector of small shared ints. */
1320 if (!TYPE_CACHED_VALUES_P (type))
1322 TYPE_CACHED_VALUES_P (type) = 1;
1323 TYPE_CACHED_VALUES (type) = make_tree_vec (limit);
1326 gcc_assert (TREE_VEC_ELT (TYPE_CACHED_VALUES (type), ix) == NULL_TREE);
1327 TREE_VEC_ELT (TYPE_CACHED_VALUES (type), ix) = t;
1329 else
1331 /* Use the cache of larger shared ints. */
1332 void **slot;
1334 slot = htab_find_slot (int_cst_hash_table, t, INSERT);
1335 /* If there is already an entry for the number verify it's the
1336 same. */
1337 if (*slot)
1339 gcc_assert (TREE_INT_CST_LOW ((tree)*slot) == low
1340 && TREE_INT_CST_HIGH ((tree)*slot) == hi);
1341 return;
1343 /* Otherwise insert this one into the hash table. */
1344 *slot = t;
1349 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
1350 and the rest are zeros. */
1352 tree
1353 build_low_bits_mask (tree type, unsigned bits)
1355 double_int mask;
1357 gcc_assert (bits <= TYPE_PRECISION (type));
1359 if (bits == TYPE_PRECISION (type)
1360 && !TYPE_UNSIGNED (type))
1361 /* Sign extended all-ones mask. */
1362 mask = double_int_minus_one;
1363 else
1364 mask = double_int::mask (bits);
1366 return build_int_cst_wide (type, mask.low, mask.high);
1369 /* Checks that X is integer constant that can be expressed in (unsigned)
1370 HOST_WIDE_INT without loss of precision. */
1372 bool
1373 cst_and_fits_in_hwi (const_tree x)
1375 if (TREE_CODE (x) != INTEGER_CST)
1376 return false;
1378 if (TYPE_PRECISION (TREE_TYPE (x)) > HOST_BITS_PER_WIDE_INT)
1379 return false;
1381 return (TREE_INT_CST_HIGH (x) == 0
1382 || TREE_INT_CST_HIGH (x) == -1);
1385 /* Build a newly constructed TREE_VEC node of length LEN. */
1387 tree
1388 make_vector_stat (unsigned len MEM_STAT_DECL)
1390 tree t;
1391 unsigned length = (len - 1) * sizeof (tree) + sizeof (struct tree_vector);
1393 record_node_allocation_statistics (VECTOR_CST, length);
1395 t = ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT);
1397 TREE_SET_CODE (t, VECTOR_CST);
1398 TREE_CONSTANT (t) = 1;
1400 return t;
1403 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1404 are in a list pointed to by VALS. */
1406 tree
1407 build_vector_stat (tree type, tree *vals MEM_STAT_DECL)
1409 int over = 0;
1410 unsigned cnt = 0;
1411 tree v = make_vector (TYPE_VECTOR_SUBPARTS (type));
1412 TREE_TYPE (v) = type;
1414 /* Iterate through elements and check for overflow. */
1415 for (cnt = 0; cnt < TYPE_VECTOR_SUBPARTS (type); ++cnt)
1417 tree value = vals[cnt];
1419 VECTOR_CST_ELT (v, cnt) = value;
1421 /* Don't crash if we get an address constant. */
1422 if (!CONSTANT_CLASS_P (value))
1423 continue;
1425 over |= TREE_OVERFLOW (value);
1428 TREE_OVERFLOW (v) = over;
1429 return v;
1432 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1433 are extracted from V, a vector of CONSTRUCTOR_ELT. */
1435 tree
1436 build_vector_from_ctor (tree type, vec<constructor_elt, va_gc> *v)
1438 tree *vec = XALLOCAVEC (tree, TYPE_VECTOR_SUBPARTS (type));
1439 unsigned HOST_WIDE_INT idx;
1440 tree value;
1442 FOR_EACH_CONSTRUCTOR_VALUE (v, idx, value)
1443 vec[idx] = value;
1444 for (; idx < TYPE_VECTOR_SUBPARTS (type); ++idx)
1445 vec[idx] = build_zero_cst (TREE_TYPE (type));
1447 return build_vector (type, vec);
1450 /* Build a vector of type VECTYPE where all the elements are SCs. */
1451 tree
1452 build_vector_from_val (tree vectype, tree sc)
1454 int i, nunits = TYPE_VECTOR_SUBPARTS (vectype);
1456 if (sc == error_mark_node)
1457 return sc;
1459 /* Verify that the vector type is suitable for SC. Note that there
1460 is some inconsistency in the type-system with respect to restrict
1461 qualifications of pointers. Vector types always have a main-variant
1462 element type and the qualification is applied to the vector-type.
1463 So TREE_TYPE (vector-type) does not return a properly qualified
1464 vector element-type. */
1465 gcc_checking_assert (types_compatible_p (TYPE_MAIN_VARIANT (TREE_TYPE (sc)),
1466 TREE_TYPE (vectype)));
1468 if (CONSTANT_CLASS_P (sc))
1470 tree *v = XALLOCAVEC (tree, nunits);
1471 for (i = 0; i < nunits; ++i)
1472 v[i] = sc;
1473 return build_vector (vectype, v);
1475 else
1477 vec<constructor_elt, va_gc> *v;
1478 vec_alloc (v, nunits);
1479 for (i = 0; i < nunits; ++i)
1480 CONSTRUCTOR_APPEND_ELT (v, NULL_TREE, sc);
1481 return build_constructor (vectype, v);
1485 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1486 are in the vec pointed to by VALS. */
1487 tree
1488 build_constructor (tree type, vec<constructor_elt, va_gc> *vals)
1490 tree c = make_node (CONSTRUCTOR);
1491 unsigned int i;
1492 constructor_elt *elt;
1493 bool constant_p = true;
1494 bool side_effects_p = false;
1496 TREE_TYPE (c) = type;
1497 CONSTRUCTOR_ELTS (c) = vals;
1499 FOR_EACH_VEC_SAFE_ELT (vals, i, elt)
1501 /* Mostly ctors will have elts that don't have side-effects, so
1502 the usual case is to scan all the elements. Hence a single
1503 loop for both const and side effects, rather than one loop
1504 each (with early outs). */
1505 if (!TREE_CONSTANT (elt->value))
1506 constant_p = false;
1507 if (TREE_SIDE_EFFECTS (elt->value))
1508 side_effects_p = true;
1511 TREE_SIDE_EFFECTS (c) = side_effects_p;
1512 TREE_CONSTANT (c) = constant_p;
1514 return c;
1517 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
1518 INDEX and VALUE. */
1519 tree
1520 build_constructor_single (tree type, tree index, tree value)
1522 vec<constructor_elt, va_gc> *v;
1523 constructor_elt elt = {index, value};
1525 vec_alloc (v, 1);
1526 v->quick_push (elt);
1528 return build_constructor (type, v);
1532 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1533 are in a list pointed to by VALS. */
1534 tree
1535 build_constructor_from_list (tree type, tree vals)
1537 tree t;
1538 vec<constructor_elt, va_gc> *v = NULL;
1540 if (vals)
1542 vec_alloc (v, list_length (vals));
1543 for (t = vals; t; t = TREE_CHAIN (t))
1544 CONSTRUCTOR_APPEND_ELT (v, TREE_PURPOSE (t), TREE_VALUE (t));
1547 return build_constructor (type, v);
1550 /* Return a new CONSTRUCTOR node whose type is TYPE. NELTS is the number
1551 of elements, provided as index/value pairs. */
1553 tree
1554 build_constructor_va (tree type, int nelts, ...)
1556 vec<constructor_elt, va_gc> *v = NULL;
1557 va_list p;
1559 va_start (p, nelts);
1560 vec_alloc (v, nelts);
1561 while (nelts--)
1563 tree index = va_arg (p, tree);
1564 tree value = va_arg (p, tree);
1565 CONSTRUCTOR_APPEND_ELT (v, index, value);
1567 va_end (p);
1568 return build_constructor (type, v);
1571 /* Return a new FIXED_CST node whose type is TYPE and value is F. */
1573 tree
1574 build_fixed (tree type, FIXED_VALUE_TYPE f)
1576 tree v;
1577 FIXED_VALUE_TYPE *fp;
1579 v = make_node (FIXED_CST);
1580 fp = ggc_alloc_fixed_value ();
1581 memcpy (fp, &f, sizeof (FIXED_VALUE_TYPE));
1583 TREE_TYPE (v) = type;
1584 TREE_FIXED_CST_PTR (v) = fp;
1585 return v;
1588 /* Return a new REAL_CST node whose type is TYPE and value is D. */
1590 tree
1591 build_real (tree type, REAL_VALUE_TYPE d)
1593 tree v;
1594 REAL_VALUE_TYPE *dp;
1595 int overflow = 0;
1597 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
1598 Consider doing it via real_convert now. */
1600 v = make_node (REAL_CST);
1601 dp = ggc_alloc_real_value ();
1602 memcpy (dp, &d, sizeof (REAL_VALUE_TYPE));
1604 TREE_TYPE (v) = type;
1605 TREE_REAL_CST_PTR (v) = dp;
1606 TREE_OVERFLOW (v) = overflow;
1607 return v;
1610 /* Return a new REAL_CST node whose type is TYPE
1611 and whose value is the integer value of the INTEGER_CST node I. */
1613 REAL_VALUE_TYPE
1614 real_value_from_int_cst (const_tree type, const_tree i)
1616 REAL_VALUE_TYPE d;
1618 /* Clear all bits of the real value type so that we can later do
1619 bitwise comparisons to see if two values are the same. */
1620 memset (&d, 0, sizeof d);
1622 real_from_integer (&d, type ? TYPE_MODE (type) : VOIDmode,
1623 TREE_INT_CST_LOW (i), TREE_INT_CST_HIGH (i),
1624 TYPE_UNSIGNED (TREE_TYPE (i)));
1625 return d;
1628 /* Given a tree representing an integer constant I, return a tree
1629 representing the same value as a floating-point constant of type TYPE. */
1631 tree
1632 build_real_from_int_cst (tree type, const_tree i)
1634 tree v;
1635 int overflow = TREE_OVERFLOW (i);
1637 v = build_real (type, real_value_from_int_cst (type, i));
1639 TREE_OVERFLOW (v) |= overflow;
1640 return v;
1643 /* Return a newly constructed STRING_CST node whose value is
1644 the LEN characters at STR.
1645 Note that for a C string literal, LEN should include the trailing NUL.
1646 The TREE_TYPE is not initialized. */
1648 tree
1649 build_string (int len, const char *str)
1651 tree s;
1652 size_t length;
1654 /* Do not waste bytes provided by padding of struct tree_string. */
1655 length = len + offsetof (struct tree_string, str) + 1;
1657 record_node_allocation_statistics (STRING_CST, length);
1659 s = ggc_alloc_tree_node (length);
1661 memset (s, 0, sizeof (struct tree_typed));
1662 TREE_SET_CODE (s, STRING_CST);
1663 TREE_CONSTANT (s) = 1;
1664 TREE_STRING_LENGTH (s) = len;
1665 memcpy (s->string.str, str, len);
1666 s->string.str[len] = '\0';
1668 return s;
1671 /* Return a newly constructed COMPLEX_CST node whose value is
1672 specified by the real and imaginary parts REAL and IMAG.
1673 Both REAL and IMAG should be constant nodes. TYPE, if specified,
1674 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
1676 tree
1677 build_complex (tree type, tree real, tree imag)
1679 tree t = make_node (COMPLEX_CST);
1681 TREE_REALPART (t) = real;
1682 TREE_IMAGPART (t) = imag;
1683 TREE_TYPE (t) = type ? type : build_complex_type (TREE_TYPE (real));
1684 TREE_OVERFLOW (t) = TREE_OVERFLOW (real) | TREE_OVERFLOW (imag);
1685 return t;
1688 /* Return a constant of arithmetic type TYPE which is the
1689 multiplicative identity of the set TYPE. */
1691 tree
1692 build_one_cst (tree type)
1694 switch (TREE_CODE (type))
1696 case INTEGER_TYPE: case ENUMERAL_TYPE: case BOOLEAN_TYPE:
1697 case POINTER_TYPE: case REFERENCE_TYPE:
1698 case OFFSET_TYPE:
1699 return build_int_cst (type, 1);
1701 case REAL_TYPE:
1702 return build_real (type, dconst1);
1704 case FIXED_POINT_TYPE:
1705 /* We can only generate 1 for accum types. */
1706 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type)));
1707 return build_fixed (type, FCONST1 (TYPE_MODE (type)));
1709 case VECTOR_TYPE:
1711 tree scalar = build_one_cst (TREE_TYPE (type));
1713 return build_vector_from_val (type, scalar);
1716 case COMPLEX_TYPE:
1717 return build_complex (type,
1718 build_one_cst (TREE_TYPE (type)),
1719 build_zero_cst (TREE_TYPE (type)));
1721 default:
1722 gcc_unreachable ();
1726 /* Return an integer of type TYPE containing all 1's in as much precision as
1727 it contains, or a complex or vector whose subparts are such integers. */
1729 tree
1730 build_all_ones_cst (tree type)
1732 if (TREE_CODE (type) == COMPLEX_TYPE)
1734 tree scalar = build_all_ones_cst (TREE_TYPE (type));
1735 return build_complex (type, scalar, scalar);
1737 else
1738 return build_minus_one_cst (type);
1741 /* Return a constant of arithmetic type TYPE which is the
1742 opposite of the multiplicative identity of the set TYPE. */
1744 tree
1745 build_minus_one_cst (tree type)
1747 switch (TREE_CODE (type))
1749 case INTEGER_TYPE: case ENUMERAL_TYPE: case BOOLEAN_TYPE:
1750 case POINTER_TYPE: case REFERENCE_TYPE:
1751 case OFFSET_TYPE:
1752 return build_int_cst (type, -1);
1754 case REAL_TYPE:
1755 return build_real (type, dconstm1);
1757 case FIXED_POINT_TYPE:
1758 /* We can only generate 1 for accum types. */
1759 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type)));
1760 return build_fixed (type, fixed_from_double_int (double_int_minus_one,
1761 TYPE_MODE (type)));
1763 case VECTOR_TYPE:
1765 tree scalar = build_minus_one_cst (TREE_TYPE (type));
1767 return build_vector_from_val (type, scalar);
1770 case COMPLEX_TYPE:
1771 return build_complex (type,
1772 build_minus_one_cst (TREE_TYPE (type)),
1773 build_zero_cst (TREE_TYPE (type)));
1775 default:
1776 gcc_unreachable ();
1780 /* Build 0 constant of type TYPE. This is used by constructor folding
1781 and thus the constant should be represented in memory by
1782 zero(es). */
1784 tree
1785 build_zero_cst (tree type)
1787 switch (TREE_CODE (type))
1789 case INTEGER_TYPE: case ENUMERAL_TYPE: case BOOLEAN_TYPE:
1790 case POINTER_TYPE: case REFERENCE_TYPE:
1791 case OFFSET_TYPE: case NULLPTR_TYPE:
1792 return build_int_cst (type, 0);
1794 case REAL_TYPE:
1795 return build_real (type, dconst0);
1797 case FIXED_POINT_TYPE:
1798 return build_fixed (type, FCONST0 (TYPE_MODE (type)));
1800 case VECTOR_TYPE:
1802 tree scalar = build_zero_cst (TREE_TYPE (type));
1804 return build_vector_from_val (type, scalar);
1807 case COMPLEX_TYPE:
1809 tree zero = build_zero_cst (TREE_TYPE (type));
1811 return build_complex (type, zero, zero);
1814 default:
1815 if (!AGGREGATE_TYPE_P (type))
1816 return fold_convert (type, integer_zero_node);
1817 return build_constructor (type, NULL);
1822 /* Build a BINFO with LEN language slots. */
1824 tree
1825 make_tree_binfo_stat (unsigned base_binfos MEM_STAT_DECL)
1827 tree t;
1828 size_t length = (offsetof (struct tree_binfo, base_binfos)
1829 + vec<tree, va_gc>::embedded_size (base_binfos));
1831 record_node_allocation_statistics (TREE_BINFO, length);
1833 t = ggc_alloc_tree_node_stat (length PASS_MEM_STAT);
1835 memset (t, 0, offsetof (struct tree_binfo, base_binfos));
1837 TREE_SET_CODE (t, TREE_BINFO);
1839 BINFO_BASE_BINFOS (t)->embedded_init (base_binfos);
1841 return t;
1844 /* Create a CASE_LABEL_EXPR tree node and return it. */
1846 tree
1847 build_case_label (tree low_value, tree high_value, tree label_decl)
1849 tree t = make_node (CASE_LABEL_EXPR);
1851 TREE_TYPE (t) = void_type_node;
1852 SET_EXPR_LOCATION (t, DECL_SOURCE_LOCATION (label_decl));
1854 CASE_LOW (t) = low_value;
1855 CASE_HIGH (t) = high_value;
1856 CASE_LABEL (t) = label_decl;
1857 CASE_CHAIN (t) = NULL_TREE;
1859 return t;
1862 /* Build a newly constructed TREE_VEC node of length LEN. */
1864 tree
1865 make_tree_vec_stat (int len MEM_STAT_DECL)
1867 tree t;
1868 int length = (len - 1) * sizeof (tree) + sizeof (struct tree_vec);
1870 record_node_allocation_statistics (TREE_VEC, length);
1872 t = ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT);
1874 TREE_SET_CODE (t, TREE_VEC);
1875 TREE_VEC_LENGTH (t) = len;
1877 return t;
1880 /* Grow a TREE_VEC node to new length LEN. */
1882 tree
1883 grow_tree_vec_stat (tree v, int len MEM_STAT_DECL)
1885 gcc_assert (TREE_CODE (v) == TREE_VEC);
1887 int oldlen = TREE_VEC_LENGTH (v);
1888 gcc_assert (len > oldlen);
1890 int oldlength = (oldlen - 1) * sizeof (tree) + sizeof (struct tree_vec);
1891 int length = (len - 1) * sizeof (tree) + sizeof (struct tree_vec);
1893 record_node_allocation_statistics (TREE_VEC, length - oldlength);
1895 v = (tree) ggc_realloc_stat (v, length PASS_MEM_STAT);
1897 TREE_VEC_LENGTH (v) = len;
1899 return v;
1902 /* Return 1 if EXPR is the integer constant zero or a complex constant
1903 of zero. */
1906 integer_zerop (const_tree expr)
1908 STRIP_NOPS (expr);
1910 switch (TREE_CODE (expr))
1912 case INTEGER_CST:
1913 return (TREE_INT_CST_LOW (expr) == 0
1914 && TREE_INT_CST_HIGH (expr) == 0);
1915 case COMPLEX_CST:
1916 return (integer_zerop (TREE_REALPART (expr))
1917 && integer_zerop (TREE_IMAGPART (expr)));
1918 case VECTOR_CST:
1920 unsigned i;
1921 for (i = 0; i < VECTOR_CST_NELTS (expr); ++i)
1922 if (!integer_zerop (VECTOR_CST_ELT (expr, i)))
1923 return false;
1924 return true;
1926 default:
1927 return false;
1931 /* Return 1 if EXPR is the integer constant one or the corresponding
1932 complex constant. */
1935 integer_onep (const_tree expr)
1937 STRIP_NOPS (expr);
1939 switch (TREE_CODE (expr))
1941 case INTEGER_CST:
1942 return (TREE_INT_CST_LOW (expr) == 1
1943 && TREE_INT_CST_HIGH (expr) == 0);
1944 case COMPLEX_CST:
1945 return (integer_onep (TREE_REALPART (expr))
1946 && integer_zerop (TREE_IMAGPART (expr)));
1947 case VECTOR_CST:
1949 unsigned i;
1950 for (i = 0; i < VECTOR_CST_NELTS (expr); ++i)
1951 if (!integer_onep (VECTOR_CST_ELT (expr, i)))
1952 return false;
1953 return true;
1955 default:
1956 return false;
1960 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
1961 it contains, or a complex or vector whose subparts are such integers. */
1964 integer_all_onesp (const_tree expr)
1966 int prec;
1967 int uns;
1969 STRIP_NOPS (expr);
1971 if (TREE_CODE (expr) == COMPLEX_CST
1972 && integer_all_onesp (TREE_REALPART (expr))
1973 && integer_all_onesp (TREE_IMAGPART (expr)))
1974 return 1;
1976 else if (TREE_CODE (expr) == VECTOR_CST)
1978 unsigned i;
1979 for (i = 0; i < VECTOR_CST_NELTS (expr); ++i)
1980 if (!integer_all_onesp (VECTOR_CST_ELT (expr, i)))
1981 return 0;
1982 return 1;
1985 else if (TREE_CODE (expr) != INTEGER_CST)
1986 return 0;
1988 uns = TYPE_UNSIGNED (TREE_TYPE (expr));
1989 if (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0
1990 && TREE_INT_CST_HIGH (expr) == -1)
1991 return 1;
1992 if (!uns)
1993 return 0;
1995 prec = TYPE_PRECISION (TREE_TYPE (expr));
1996 if (prec >= HOST_BITS_PER_WIDE_INT)
1998 HOST_WIDE_INT high_value;
1999 int shift_amount;
2001 shift_amount = prec - HOST_BITS_PER_WIDE_INT;
2003 /* Can not handle precisions greater than twice the host int size. */
2004 gcc_assert (shift_amount <= HOST_BITS_PER_WIDE_INT);
2005 if (shift_amount == HOST_BITS_PER_WIDE_INT)
2006 /* Shifting by the host word size is undefined according to the ANSI
2007 standard, so we must handle this as a special case. */
2008 high_value = -1;
2009 else
2010 high_value = ((HOST_WIDE_INT) 1 << shift_amount) - 1;
2012 return (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0
2013 && TREE_INT_CST_HIGH (expr) == high_value);
2015 else
2016 return TREE_INT_CST_LOW (expr) == ((unsigned HOST_WIDE_INT) 1 << prec) - 1;
2019 /* Return 1 if EXPR is the integer constant minus one. */
2022 integer_minus_onep (const_tree expr)
2024 STRIP_NOPS (expr);
2026 if (TREE_CODE (expr) == COMPLEX_CST)
2027 return (integer_all_onesp (TREE_REALPART (expr))
2028 && integer_zerop (TREE_IMAGPART (expr)));
2029 else
2030 return integer_all_onesp (expr);
2033 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
2034 one bit on). */
2037 integer_pow2p (const_tree expr)
2039 int prec;
2040 unsigned HOST_WIDE_INT high, low;
2042 STRIP_NOPS (expr);
2044 if (TREE_CODE (expr) == COMPLEX_CST
2045 && integer_pow2p (TREE_REALPART (expr))
2046 && integer_zerop (TREE_IMAGPART (expr)))
2047 return 1;
2049 if (TREE_CODE (expr) != INTEGER_CST)
2050 return 0;
2052 prec = TYPE_PRECISION (TREE_TYPE (expr));
2053 high = TREE_INT_CST_HIGH (expr);
2054 low = TREE_INT_CST_LOW (expr);
2056 /* First clear all bits that are beyond the type's precision in case
2057 we've been sign extended. */
2059 if (prec == HOST_BITS_PER_DOUBLE_INT)
2061 else if (prec > HOST_BITS_PER_WIDE_INT)
2062 high &= ~(HOST_WIDE_INT_M1U << (prec - HOST_BITS_PER_WIDE_INT));
2063 else
2065 high = 0;
2066 if (prec < HOST_BITS_PER_WIDE_INT)
2067 low &= ~(HOST_WIDE_INT_M1U << prec);
2070 if (high == 0 && low == 0)
2071 return 0;
2073 return ((high == 0 && (low & (low - 1)) == 0)
2074 || (low == 0 && (high & (high - 1)) == 0));
2077 /* Return 1 if EXPR is an integer constant other than zero or a
2078 complex constant other than zero. */
2081 integer_nonzerop (const_tree expr)
2083 STRIP_NOPS (expr);
2085 return ((TREE_CODE (expr) == INTEGER_CST
2086 && (TREE_INT_CST_LOW (expr) != 0
2087 || TREE_INT_CST_HIGH (expr) != 0))
2088 || (TREE_CODE (expr) == COMPLEX_CST
2089 && (integer_nonzerop (TREE_REALPART (expr))
2090 || integer_nonzerop (TREE_IMAGPART (expr)))));
2093 /* Return 1 if EXPR is the fixed-point constant zero. */
2096 fixed_zerop (const_tree expr)
2098 return (TREE_CODE (expr) == FIXED_CST
2099 && TREE_FIXED_CST (expr).data.is_zero ());
2102 /* Return the power of two represented by a tree node known to be a
2103 power of two. */
2106 tree_log2 (const_tree expr)
2108 int prec;
2109 HOST_WIDE_INT high, low;
2111 STRIP_NOPS (expr);
2113 if (TREE_CODE (expr) == COMPLEX_CST)
2114 return tree_log2 (TREE_REALPART (expr));
2116 prec = TYPE_PRECISION (TREE_TYPE (expr));
2117 high = TREE_INT_CST_HIGH (expr);
2118 low = TREE_INT_CST_LOW (expr);
2120 /* First clear all bits that are beyond the type's precision in case
2121 we've been sign extended. */
2123 if (prec == HOST_BITS_PER_DOUBLE_INT)
2125 else if (prec > HOST_BITS_PER_WIDE_INT)
2126 high &= ~(HOST_WIDE_INT_M1U << (prec - HOST_BITS_PER_WIDE_INT));
2127 else
2129 high = 0;
2130 if (prec < HOST_BITS_PER_WIDE_INT)
2131 low &= ~(HOST_WIDE_INT_M1U << prec);
2134 return (high != 0 ? HOST_BITS_PER_WIDE_INT + exact_log2 (high)
2135 : exact_log2 (low));
2138 /* Similar, but return the largest integer Y such that 2 ** Y is less
2139 than or equal to EXPR. */
2142 tree_floor_log2 (const_tree expr)
2144 int prec;
2145 HOST_WIDE_INT high, low;
2147 STRIP_NOPS (expr);
2149 if (TREE_CODE (expr) == COMPLEX_CST)
2150 return tree_log2 (TREE_REALPART (expr));
2152 prec = TYPE_PRECISION (TREE_TYPE (expr));
2153 high = TREE_INT_CST_HIGH (expr);
2154 low = TREE_INT_CST_LOW (expr);
2156 /* First clear all bits that are beyond the type's precision in case
2157 we've been sign extended. Ignore if type's precision hasn't been set
2158 since what we are doing is setting it. */
2160 if (prec == HOST_BITS_PER_DOUBLE_INT || prec == 0)
2162 else if (prec > HOST_BITS_PER_WIDE_INT)
2163 high &= ~(HOST_WIDE_INT_M1U << (prec - HOST_BITS_PER_WIDE_INT));
2164 else
2166 high = 0;
2167 if (prec < HOST_BITS_PER_WIDE_INT)
2168 low &= ~(HOST_WIDE_INT_M1U << prec);
2171 return (high != 0 ? HOST_BITS_PER_WIDE_INT + floor_log2 (high)
2172 : floor_log2 (low));
2175 /* Return number of known trailing zero bits in EXPR, or, if the value of
2176 EXPR is known to be zero, the precision of it's type. */
2178 unsigned int
2179 tree_ctz (const_tree expr)
2181 if (!INTEGRAL_TYPE_P (TREE_TYPE (expr))
2182 && !POINTER_TYPE_P (TREE_TYPE (expr)))
2183 return 0;
2185 unsigned int ret1, ret2, prec = TYPE_PRECISION (TREE_TYPE (expr));
2186 switch (TREE_CODE (expr))
2188 case INTEGER_CST:
2189 ret1 = tree_to_double_int (expr).trailing_zeros ();
2190 return MIN (ret1, prec);
2191 case SSA_NAME:
2192 ret1 = get_nonzero_bits (expr).trailing_zeros ();
2193 return MIN (ret1, prec);
2194 case PLUS_EXPR:
2195 case MINUS_EXPR:
2196 case BIT_IOR_EXPR:
2197 case BIT_XOR_EXPR:
2198 case MIN_EXPR:
2199 case MAX_EXPR:
2200 ret1 = tree_ctz (TREE_OPERAND (expr, 0));
2201 if (ret1 == 0)
2202 return ret1;
2203 ret2 = tree_ctz (TREE_OPERAND (expr, 1));
2204 return MIN (ret1, ret2);
2205 case POINTER_PLUS_EXPR:
2206 ret1 = tree_ctz (TREE_OPERAND (expr, 0));
2207 ret2 = tree_ctz (TREE_OPERAND (expr, 1));
2208 /* Second operand is sizetype, which could be in theory
2209 wider than pointer's precision. Make sure we never
2210 return more than prec. */
2211 ret2 = MIN (ret2, prec);
2212 return MIN (ret1, ret2);
2213 case BIT_AND_EXPR:
2214 ret1 = tree_ctz (TREE_OPERAND (expr, 0));
2215 ret2 = tree_ctz (TREE_OPERAND (expr, 1));
2216 return MAX (ret1, ret2);
2217 case MULT_EXPR:
2218 ret1 = tree_ctz (TREE_OPERAND (expr, 0));
2219 ret2 = tree_ctz (TREE_OPERAND (expr, 1));
2220 return MIN (ret1 + ret2, prec);
2221 case LSHIFT_EXPR:
2222 ret1 = tree_ctz (TREE_OPERAND (expr, 0));
2223 if (tree_fits_uhwi_p (TREE_OPERAND (expr, 1))
2224 && (tree_to_uhwi (TREE_OPERAND (expr, 1)) < prec))
2226 ret2 = tree_to_uhwi (TREE_OPERAND (expr, 1));
2227 return MIN (ret1 + ret2, prec);
2229 return ret1;
2230 case RSHIFT_EXPR:
2231 if (tree_fits_uhwi_p (TREE_OPERAND (expr, 1))
2232 && (tree_to_uhwi (TREE_OPERAND (expr, 1)) < prec))
2234 ret1 = tree_ctz (TREE_OPERAND (expr, 0));
2235 ret2 = tree_to_uhwi (TREE_OPERAND (expr, 1));
2236 if (ret1 > ret2)
2237 return ret1 - ret2;
2239 return 0;
2240 case TRUNC_DIV_EXPR:
2241 case CEIL_DIV_EXPR:
2242 case FLOOR_DIV_EXPR:
2243 case ROUND_DIV_EXPR:
2244 case EXACT_DIV_EXPR:
2245 if (TREE_CODE (TREE_OPERAND (expr, 1)) == INTEGER_CST
2246 && tree_int_cst_sgn (TREE_OPERAND (expr, 1)) == 1)
2248 int l = tree_log2 (TREE_OPERAND (expr, 1));
2249 if (l >= 0)
2251 ret1 = tree_ctz (TREE_OPERAND (expr, 0));
2252 ret2 = l;
2253 if (ret1 > ret2)
2254 return ret1 - ret2;
2257 return 0;
2258 CASE_CONVERT:
2259 ret1 = tree_ctz (TREE_OPERAND (expr, 0));
2260 if (ret1 && ret1 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (expr, 0))))
2261 ret1 = prec;
2262 return MIN (ret1, prec);
2263 case SAVE_EXPR:
2264 return tree_ctz (TREE_OPERAND (expr, 0));
2265 case COND_EXPR:
2266 ret1 = tree_ctz (TREE_OPERAND (expr, 1));
2267 if (ret1 == 0)
2268 return 0;
2269 ret2 = tree_ctz (TREE_OPERAND (expr, 2));
2270 return MIN (ret1, ret2);
2271 case COMPOUND_EXPR:
2272 return tree_ctz (TREE_OPERAND (expr, 1));
2273 case ADDR_EXPR:
2274 ret1 = get_pointer_alignment (CONST_CAST_TREE (expr));
2275 if (ret1 > BITS_PER_UNIT)
2277 ret1 = ctz_hwi (ret1 / BITS_PER_UNIT);
2278 return MIN (ret1, prec);
2280 return 0;
2281 default:
2282 return 0;
2286 /* Return 1 if EXPR is the real constant zero. Trailing zeroes matter for
2287 decimal float constants, so don't return 1 for them. */
2290 real_zerop (const_tree expr)
2292 STRIP_NOPS (expr);
2294 switch (TREE_CODE (expr))
2296 case REAL_CST:
2297 return REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst0)
2298 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr))));
2299 case COMPLEX_CST:
2300 return real_zerop (TREE_REALPART (expr))
2301 && real_zerop (TREE_IMAGPART (expr));
2302 case VECTOR_CST:
2304 unsigned i;
2305 for (i = 0; i < VECTOR_CST_NELTS (expr); ++i)
2306 if (!real_zerop (VECTOR_CST_ELT (expr, i)))
2307 return false;
2308 return true;
2310 default:
2311 return false;
2315 /* Return 1 if EXPR is the real constant one in real or complex form.
2316 Trailing zeroes matter for decimal float constants, so don't return
2317 1 for them. */
2320 real_onep (const_tree expr)
2322 STRIP_NOPS (expr);
2324 switch (TREE_CODE (expr))
2326 case REAL_CST:
2327 return REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst1)
2328 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr))));
2329 case COMPLEX_CST:
2330 return real_onep (TREE_REALPART (expr))
2331 && real_zerop (TREE_IMAGPART (expr));
2332 case VECTOR_CST:
2334 unsigned i;
2335 for (i = 0; i < VECTOR_CST_NELTS (expr); ++i)
2336 if (!real_onep (VECTOR_CST_ELT (expr, i)))
2337 return false;
2338 return true;
2340 default:
2341 return false;
2345 /* Return 1 if EXPR is the real constant minus one. Trailing zeroes
2346 matter for decimal float constants, so don't return 1 for them. */
2349 real_minus_onep (const_tree expr)
2351 STRIP_NOPS (expr);
2353 switch (TREE_CODE (expr))
2355 case REAL_CST:
2356 return REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconstm1)
2357 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr))));
2358 case COMPLEX_CST:
2359 return real_minus_onep (TREE_REALPART (expr))
2360 && real_zerop (TREE_IMAGPART (expr));
2361 case VECTOR_CST:
2363 unsigned i;
2364 for (i = 0; i < VECTOR_CST_NELTS (expr); ++i)
2365 if (!real_minus_onep (VECTOR_CST_ELT (expr, i)))
2366 return false;
2367 return true;
2369 default:
2370 return false;
2374 /* Nonzero if EXP is a constant or a cast of a constant. */
2377 really_constant_p (const_tree exp)
2379 /* This is not quite the same as STRIP_NOPS. It does more. */
2380 while (CONVERT_EXPR_P (exp)
2381 || TREE_CODE (exp) == NON_LVALUE_EXPR)
2382 exp = TREE_OPERAND (exp, 0);
2383 return TREE_CONSTANT (exp);
2386 /* Return first list element whose TREE_VALUE is ELEM.
2387 Return 0 if ELEM is not in LIST. */
2389 tree
2390 value_member (tree elem, tree list)
2392 while (list)
2394 if (elem == TREE_VALUE (list))
2395 return list;
2396 list = TREE_CHAIN (list);
2398 return NULL_TREE;
2401 /* Return first list element whose TREE_PURPOSE is ELEM.
2402 Return 0 if ELEM is not in LIST. */
2404 tree
2405 purpose_member (const_tree elem, tree list)
2407 while (list)
2409 if (elem == TREE_PURPOSE (list))
2410 return list;
2411 list = TREE_CHAIN (list);
2413 return NULL_TREE;
2416 /* Return true if ELEM is in V. */
2418 bool
2419 vec_member (const_tree elem, vec<tree, va_gc> *v)
2421 unsigned ix;
2422 tree t;
2423 FOR_EACH_VEC_SAFE_ELT (v, ix, t)
2424 if (elem == t)
2425 return true;
2426 return false;
2429 /* Returns element number IDX (zero-origin) of chain CHAIN, or
2430 NULL_TREE. */
2432 tree
2433 chain_index (int idx, tree chain)
2435 for (; chain && idx > 0; --idx)
2436 chain = TREE_CHAIN (chain);
2437 return chain;
2440 /* Return nonzero if ELEM is part of the chain CHAIN. */
2443 chain_member (const_tree elem, const_tree chain)
2445 while (chain)
2447 if (elem == chain)
2448 return 1;
2449 chain = DECL_CHAIN (chain);
2452 return 0;
2455 /* Return the length of a chain of nodes chained through TREE_CHAIN.
2456 We expect a null pointer to mark the end of the chain.
2457 This is the Lisp primitive `length'. */
2460 list_length (const_tree t)
2462 const_tree p = t;
2463 #ifdef ENABLE_TREE_CHECKING
2464 const_tree q = t;
2465 #endif
2466 int len = 0;
2468 while (p)
2470 p = TREE_CHAIN (p);
2471 #ifdef ENABLE_TREE_CHECKING
2472 if (len % 2)
2473 q = TREE_CHAIN (q);
2474 gcc_assert (p != q);
2475 #endif
2476 len++;
2479 return len;
2482 /* Returns the first FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
2483 UNION_TYPE TYPE, or NULL_TREE if none. */
2485 tree
2486 first_field (const_tree type)
2488 tree t = TYPE_FIELDS (type);
2489 while (t && TREE_CODE (t) != FIELD_DECL)
2490 t = TREE_CHAIN (t);
2491 return t;
2494 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
2495 by modifying the last node in chain 1 to point to chain 2.
2496 This is the Lisp primitive `nconc'. */
2498 tree
2499 chainon (tree op1, tree op2)
2501 tree t1;
2503 if (!op1)
2504 return op2;
2505 if (!op2)
2506 return op1;
2508 for (t1 = op1; TREE_CHAIN (t1); t1 = TREE_CHAIN (t1))
2509 continue;
2510 TREE_CHAIN (t1) = op2;
2512 #ifdef ENABLE_TREE_CHECKING
2514 tree t2;
2515 for (t2 = op2; t2; t2 = TREE_CHAIN (t2))
2516 gcc_assert (t2 != t1);
2518 #endif
2520 return op1;
2523 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
2525 tree
2526 tree_last (tree chain)
2528 tree next;
2529 if (chain)
2530 while ((next = TREE_CHAIN (chain)))
2531 chain = next;
2532 return chain;
2535 /* Reverse the order of elements in the chain T,
2536 and return the new head of the chain (old last element). */
2538 tree
2539 nreverse (tree t)
2541 tree prev = 0, decl, next;
2542 for (decl = t; decl; decl = next)
2544 /* We shouldn't be using this function to reverse BLOCK chains; we
2545 have blocks_nreverse for that. */
2546 gcc_checking_assert (TREE_CODE (decl) != BLOCK);
2547 next = TREE_CHAIN (decl);
2548 TREE_CHAIN (decl) = prev;
2549 prev = decl;
2551 return prev;
2554 /* Return a newly created TREE_LIST node whose
2555 purpose and value fields are PARM and VALUE. */
2557 tree
2558 build_tree_list_stat (tree parm, tree value MEM_STAT_DECL)
2560 tree t = make_node_stat (TREE_LIST PASS_MEM_STAT);
2561 TREE_PURPOSE (t) = parm;
2562 TREE_VALUE (t) = value;
2563 return t;
2566 /* Build a chain of TREE_LIST nodes from a vector. */
2568 tree
2569 build_tree_list_vec_stat (const vec<tree, va_gc> *vec MEM_STAT_DECL)
2571 tree ret = NULL_TREE;
2572 tree *pp = &ret;
2573 unsigned int i;
2574 tree t;
2575 FOR_EACH_VEC_SAFE_ELT (vec, i, t)
2577 *pp = build_tree_list_stat (NULL, t PASS_MEM_STAT);
2578 pp = &TREE_CHAIN (*pp);
2580 return ret;
2583 /* Return a newly created TREE_LIST node whose
2584 purpose and value fields are PURPOSE and VALUE
2585 and whose TREE_CHAIN is CHAIN. */
2587 tree
2588 tree_cons_stat (tree purpose, tree value, tree chain MEM_STAT_DECL)
2590 tree node;
2592 node = ggc_alloc_tree_node_stat (sizeof (struct tree_list) PASS_MEM_STAT);
2593 memset (node, 0, sizeof (struct tree_common));
2595 record_node_allocation_statistics (TREE_LIST, sizeof (struct tree_list));
2597 TREE_SET_CODE (node, TREE_LIST);
2598 TREE_CHAIN (node) = chain;
2599 TREE_PURPOSE (node) = purpose;
2600 TREE_VALUE (node) = value;
2601 return node;
2604 /* Return the values of the elements of a CONSTRUCTOR as a vector of
2605 trees. */
2607 vec<tree, va_gc> *
2608 ctor_to_vec (tree ctor)
2610 vec<tree, va_gc> *vec;
2611 vec_alloc (vec, CONSTRUCTOR_NELTS (ctor));
2612 unsigned int ix;
2613 tree val;
2615 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor), ix, val)
2616 vec->quick_push (val);
2618 return vec;
2621 /* Return the size nominally occupied by an object of type TYPE
2622 when it resides in memory. The value is measured in units of bytes,
2623 and its data type is that normally used for type sizes
2624 (which is the first type created by make_signed_type or
2625 make_unsigned_type). */
2627 tree
2628 size_in_bytes (const_tree type)
2630 tree t;
2632 if (type == error_mark_node)
2633 return integer_zero_node;
2635 type = TYPE_MAIN_VARIANT (type);
2636 t = TYPE_SIZE_UNIT (type);
2638 if (t == 0)
2640 lang_hooks.types.incomplete_type_error (NULL_TREE, type);
2641 return size_zero_node;
2644 return t;
2647 /* Return the size of TYPE (in bytes) as a wide integer
2648 or return -1 if the size can vary or is larger than an integer. */
2650 HOST_WIDE_INT
2651 int_size_in_bytes (const_tree type)
2653 tree t;
2655 if (type == error_mark_node)
2656 return 0;
2658 type = TYPE_MAIN_VARIANT (type);
2659 t = TYPE_SIZE_UNIT (type);
2660 if (t == 0
2661 || TREE_CODE (t) != INTEGER_CST
2662 || TREE_INT_CST_HIGH (t) != 0
2663 /* If the result would appear negative, it's too big to represent. */
2664 || (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0)
2665 return -1;
2667 return TREE_INT_CST_LOW (t);
2670 /* Return the maximum size of TYPE (in bytes) as a wide integer
2671 or return -1 if the size can vary or is larger than an integer. */
2673 HOST_WIDE_INT
2674 max_int_size_in_bytes (const_tree type)
2676 HOST_WIDE_INT size = -1;
2677 tree size_tree;
2679 /* If this is an array type, check for a possible MAX_SIZE attached. */
2681 if (TREE_CODE (type) == ARRAY_TYPE)
2683 size_tree = TYPE_ARRAY_MAX_SIZE (type);
2685 if (size_tree && tree_fits_uhwi_p (size_tree))
2686 size = tree_to_uhwi (size_tree);
2689 /* If we still haven't been able to get a size, see if the language
2690 can compute a maximum size. */
2692 if (size == -1)
2694 size_tree = lang_hooks.types.max_size (type);
2696 if (size_tree && tree_fits_uhwi_p (size_tree))
2697 size = tree_to_uhwi (size_tree);
2700 return size;
2703 /* Return the bit position of FIELD, in bits from the start of the record.
2704 This is a tree of type bitsizetype. */
2706 tree
2707 bit_position (const_tree field)
2709 return bit_from_pos (DECL_FIELD_OFFSET (field),
2710 DECL_FIELD_BIT_OFFSET (field));
2713 /* Likewise, but return as an integer. It must be representable in
2714 that way (since it could be a signed value, we don't have the
2715 option of returning -1 like int_size_in_byte can. */
2717 HOST_WIDE_INT
2718 int_bit_position (const_tree field)
2720 return tree_to_shwi (bit_position (field));
2723 /* Return the byte position of FIELD, in bytes from the start of the record.
2724 This is a tree of type sizetype. */
2726 tree
2727 byte_position (const_tree field)
2729 return byte_from_pos (DECL_FIELD_OFFSET (field),
2730 DECL_FIELD_BIT_OFFSET (field));
2733 /* Likewise, but return as an integer. It must be representable in
2734 that way (since it could be a signed value, we don't have the
2735 option of returning -1 like int_size_in_byte can. */
2737 HOST_WIDE_INT
2738 int_byte_position (const_tree field)
2740 return tree_to_shwi (byte_position (field));
2743 /* Return the strictest alignment, in bits, that T is known to have. */
2745 unsigned int
2746 expr_align (const_tree t)
2748 unsigned int align0, align1;
2750 switch (TREE_CODE (t))
2752 CASE_CONVERT: case NON_LVALUE_EXPR:
2753 /* If we have conversions, we know that the alignment of the
2754 object must meet each of the alignments of the types. */
2755 align0 = expr_align (TREE_OPERAND (t, 0));
2756 align1 = TYPE_ALIGN (TREE_TYPE (t));
2757 return MAX (align0, align1);
2759 case SAVE_EXPR: case COMPOUND_EXPR: case MODIFY_EXPR:
2760 case INIT_EXPR: case TARGET_EXPR: case WITH_CLEANUP_EXPR:
2761 case CLEANUP_POINT_EXPR:
2762 /* These don't change the alignment of an object. */
2763 return expr_align (TREE_OPERAND (t, 0));
2765 case COND_EXPR:
2766 /* The best we can do is say that the alignment is the least aligned
2767 of the two arms. */
2768 align0 = expr_align (TREE_OPERAND (t, 1));
2769 align1 = expr_align (TREE_OPERAND (t, 2));
2770 return MIN (align0, align1);
2772 /* FIXME: LABEL_DECL and CONST_DECL never have DECL_ALIGN set
2773 meaningfully, it's always 1. */
2774 case LABEL_DECL: case CONST_DECL:
2775 case VAR_DECL: case PARM_DECL: case RESULT_DECL:
2776 case FUNCTION_DECL:
2777 gcc_assert (DECL_ALIGN (t) != 0);
2778 return DECL_ALIGN (t);
2780 default:
2781 break;
2784 /* Otherwise take the alignment from that of the type. */
2785 return TYPE_ALIGN (TREE_TYPE (t));
2788 /* Return, as a tree node, the number of elements for TYPE (which is an
2789 ARRAY_TYPE) minus one. This counts only elements of the top array. */
2791 tree
2792 array_type_nelts (const_tree type)
2794 tree index_type, min, max;
2796 /* If they did it with unspecified bounds, then we should have already
2797 given an error about it before we got here. */
2798 if (! TYPE_DOMAIN (type))
2799 return error_mark_node;
2801 index_type = TYPE_DOMAIN (type);
2802 min = TYPE_MIN_VALUE (index_type);
2803 max = TYPE_MAX_VALUE (index_type);
2805 /* TYPE_MAX_VALUE may not be set if the array has unknown length. */
2806 if (!max)
2807 return error_mark_node;
2809 return (integer_zerop (min)
2810 ? max
2811 : fold_build2 (MINUS_EXPR, TREE_TYPE (max), max, min));
2814 /* If arg is static -- a reference to an object in static storage -- then
2815 return the object. This is not the same as the C meaning of `static'.
2816 If arg isn't static, return NULL. */
2818 tree
2819 staticp (tree arg)
2821 switch (TREE_CODE (arg))
2823 case FUNCTION_DECL:
2824 /* Nested functions are static, even though taking their address will
2825 involve a trampoline as we unnest the nested function and create
2826 the trampoline on the tree level. */
2827 return arg;
2829 case VAR_DECL:
2830 return ((TREE_STATIC (arg) || DECL_EXTERNAL (arg))
2831 && ! DECL_THREAD_LOCAL_P (arg)
2832 && ! DECL_DLLIMPORT_P (arg)
2833 ? arg : NULL);
2835 case CONST_DECL:
2836 return ((TREE_STATIC (arg) || DECL_EXTERNAL (arg))
2837 ? arg : NULL);
2839 case CONSTRUCTOR:
2840 return TREE_STATIC (arg) ? arg : NULL;
2842 case LABEL_DECL:
2843 case STRING_CST:
2844 return arg;
2846 case COMPONENT_REF:
2847 /* If the thing being referenced is not a field, then it is
2848 something language specific. */
2849 gcc_assert (TREE_CODE (TREE_OPERAND (arg, 1)) == FIELD_DECL);
2851 /* If we are referencing a bitfield, we can't evaluate an
2852 ADDR_EXPR at compile time and so it isn't a constant. */
2853 if (DECL_BIT_FIELD (TREE_OPERAND (arg, 1)))
2854 return NULL;
2856 return staticp (TREE_OPERAND (arg, 0));
2858 case BIT_FIELD_REF:
2859 return NULL;
2861 case INDIRECT_REF:
2862 return TREE_CONSTANT (TREE_OPERAND (arg, 0)) ? arg : NULL;
2864 case ARRAY_REF:
2865 case ARRAY_RANGE_REF:
2866 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg))) == INTEGER_CST
2867 && TREE_CODE (TREE_OPERAND (arg, 1)) == INTEGER_CST)
2868 return staticp (TREE_OPERAND (arg, 0));
2869 else
2870 return NULL;
2872 case COMPOUND_LITERAL_EXPR:
2873 return TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (arg)) ? arg : NULL;
2875 default:
2876 return NULL;
2883 /* Return whether OP is a DECL whose address is function-invariant. */
2885 bool
2886 decl_address_invariant_p (const_tree op)
2888 /* The conditions below are slightly less strict than the one in
2889 staticp. */
2891 switch (TREE_CODE (op))
2893 case PARM_DECL:
2894 case RESULT_DECL:
2895 case LABEL_DECL:
2896 case FUNCTION_DECL:
2897 return true;
2899 case VAR_DECL:
2900 if ((TREE_STATIC (op) || DECL_EXTERNAL (op))
2901 || DECL_THREAD_LOCAL_P (op)
2902 || DECL_CONTEXT (op) == current_function_decl
2903 || decl_function_context (op) == current_function_decl)
2904 return true;
2905 break;
2907 case CONST_DECL:
2908 if ((TREE_STATIC (op) || DECL_EXTERNAL (op))
2909 || decl_function_context (op) == current_function_decl)
2910 return true;
2911 break;
2913 default:
2914 break;
2917 return false;
2920 /* Return whether OP is a DECL whose address is interprocedural-invariant. */
2922 bool
2923 decl_address_ip_invariant_p (const_tree op)
2925 /* The conditions below are slightly less strict than the one in
2926 staticp. */
2928 switch (TREE_CODE (op))
2930 case LABEL_DECL:
2931 case FUNCTION_DECL:
2932 case STRING_CST:
2933 return true;
2935 case VAR_DECL:
2936 if (((TREE_STATIC (op) || DECL_EXTERNAL (op))
2937 && !DECL_DLLIMPORT_P (op))
2938 || DECL_THREAD_LOCAL_P (op))
2939 return true;
2940 break;
2942 case CONST_DECL:
2943 if ((TREE_STATIC (op) || DECL_EXTERNAL (op)))
2944 return true;
2945 break;
2947 default:
2948 break;
2951 return false;
2955 /* Return true if T is function-invariant (internal function, does
2956 not handle arithmetic; that's handled in skip_simple_arithmetic and
2957 tree_invariant_p). */
2959 static bool tree_invariant_p (tree t);
2961 static bool
2962 tree_invariant_p_1 (tree t)
2964 tree op;
2966 if (TREE_CONSTANT (t)
2967 || (TREE_READONLY (t) && !TREE_SIDE_EFFECTS (t)))
2968 return true;
2970 switch (TREE_CODE (t))
2972 case SAVE_EXPR:
2973 return true;
2975 case ADDR_EXPR:
2976 op = TREE_OPERAND (t, 0);
2977 while (handled_component_p (op))
2979 switch (TREE_CODE (op))
2981 case ARRAY_REF:
2982 case ARRAY_RANGE_REF:
2983 if (!tree_invariant_p (TREE_OPERAND (op, 1))
2984 || TREE_OPERAND (op, 2) != NULL_TREE
2985 || TREE_OPERAND (op, 3) != NULL_TREE)
2986 return false;
2987 break;
2989 case COMPONENT_REF:
2990 if (TREE_OPERAND (op, 2) != NULL_TREE)
2991 return false;
2992 break;
2994 default:;
2996 op = TREE_OPERAND (op, 0);
2999 return CONSTANT_CLASS_P (op) || decl_address_invariant_p (op);
3001 default:
3002 break;
3005 return false;
3008 /* Return true if T is function-invariant. */
3010 static bool
3011 tree_invariant_p (tree t)
3013 tree inner = skip_simple_arithmetic (t);
3014 return tree_invariant_p_1 (inner);
3017 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
3018 Do this to any expression which may be used in more than one place,
3019 but must be evaluated only once.
3021 Normally, expand_expr would reevaluate the expression each time.
3022 Calling save_expr produces something that is evaluated and recorded
3023 the first time expand_expr is called on it. Subsequent calls to
3024 expand_expr just reuse the recorded value.
3026 The call to expand_expr that generates code that actually computes
3027 the value is the first call *at compile time*. Subsequent calls
3028 *at compile time* generate code to use the saved value.
3029 This produces correct result provided that *at run time* control
3030 always flows through the insns made by the first expand_expr
3031 before reaching the other places where the save_expr was evaluated.
3032 You, the caller of save_expr, must make sure this is so.
3034 Constants, and certain read-only nodes, are returned with no
3035 SAVE_EXPR because that is safe. Expressions containing placeholders
3036 are not touched; see tree.def for an explanation of what these
3037 are used for. */
3039 tree
3040 save_expr (tree expr)
3042 tree t = fold (expr);
3043 tree inner;
3045 /* If the tree evaluates to a constant, then we don't want to hide that
3046 fact (i.e. this allows further folding, and direct checks for constants).
3047 However, a read-only object that has side effects cannot be bypassed.
3048 Since it is no problem to reevaluate literals, we just return the
3049 literal node. */
3050 inner = skip_simple_arithmetic (t);
3051 if (TREE_CODE (inner) == ERROR_MARK)
3052 return inner;
3054 if (tree_invariant_p_1 (inner))
3055 return t;
3057 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
3058 it means that the size or offset of some field of an object depends on
3059 the value within another field.
3061 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
3062 and some variable since it would then need to be both evaluated once and
3063 evaluated more than once. Front-ends must assure this case cannot
3064 happen by surrounding any such subexpressions in their own SAVE_EXPR
3065 and forcing evaluation at the proper time. */
3066 if (contains_placeholder_p (inner))
3067 return t;
3069 t = build1 (SAVE_EXPR, TREE_TYPE (expr), t);
3070 SET_EXPR_LOCATION (t, EXPR_LOCATION (expr));
3072 /* This expression might be placed ahead of a jump to ensure that the
3073 value was computed on both sides of the jump. So make sure it isn't
3074 eliminated as dead. */
3075 TREE_SIDE_EFFECTS (t) = 1;
3076 return t;
3079 /* Look inside EXPR into any simple arithmetic operations. Return the
3080 outermost non-arithmetic or non-invariant node. */
3082 tree
3083 skip_simple_arithmetic (tree expr)
3085 /* We don't care about whether this can be used as an lvalue in this
3086 context. */
3087 while (TREE_CODE (expr) == NON_LVALUE_EXPR)
3088 expr = TREE_OPERAND (expr, 0);
3090 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
3091 a constant, it will be more efficient to not make another SAVE_EXPR since
3092 it will allow better simplification and GCSE will be able to merge the
3093 computations if they actually occur. */
3094 while (true)
3096 if (UNARY_CLASS_P (expr))
3097 expr = TREE_OPERAND (expr, 0);
3098 else if (BINARY_CLASS_P (expr))
3100 if (tree_invariant_p (TREE_OPERAND (expr, 1)))
3101 expr = TREE_OPERAND (expr, 0);
3102 else if (tree_invariant_p (TREE_OPERAND (expr, 0)))
3103 expr = TREE_OPERAND (expr, 1);
3104 else
3105 break;
3107 else
3108 break;
3111 return expr;
3114 /* Look inside EXPR into simple arithmetic operations involving constants.
3115 Return the outermost non-arithmetic or non-constant node. */
3117 tree
3118 skip_simple_constant_arithmetic (tree expr)
3120 while (TREE_CODE (expr) == NON_LVALUE_EXPR)
3121 expr = TREE_OPERAND (expr, 0);
3123 while (true)
3125 if (UNARY_CLASS_P (expr))
3126 expr = TREE_OPERAND (expr, 0);
3127 else if (BINARY_CLASS_P (expr))
3129 if (TREE_CONSTANT (TREE_OPERAND (expr, 1)))
3130 expr = TREE_OPERAND (expr, 0);
3131 else if (TREE_CONSTANT (TREE_OPERAND (expr, 0)))
3132 expr = TREE_OPERAND (expr, 1);
3133 else
3134 break;
3136 else
3137 break;
3140 return expr;
3143 /* Return which tree structure is used by T. */
3145 enum tree_node_structure_enum
3146 tree_node_structure (const_tree t)
3148 const enum tree_code code = TREE_CODE (t);
3149 return tree_node_structure_for_code (code);
3152 /* Set various status flags when building a CALL_EXPR object T. */
3154 static void
3155 process_call_operands (tree t)
3157 bool side_effects = TREE_SIDE_EFFECTS (t);
3158 bool read_only = false;
3159 int i = call_expr_flags (t);
3161 /* Calls have side-effects, except those to const or pure functions. */
3162 if ((i & ECF_LOOPING_CONST_OR_PURE) || !(i & (ECF_CONST | ECF_PURE)))
3163 side_effects = true;
3164 /* Propagate TREE_READONLY of arguments for const functions. */
3165 if (i & ECF_CONST)
3166 read_only = true;
3168 if (!side_effects || read_only)
3169 for (i = 1; i < TREE_OPERAND_LENGTH (t); i++)
3171 tree op = TREE_OPERAND (t, i);
3172 if (op && TREE_SIDE_EFFECTS (op))
3173 side_effects = true;
3174 if (op && !TREE_READONLY (op) && !CONSTANT_CLASS_P (op))
3175 read_only = false;
3178 TREE_SIDE_EFFECTS (t) = side_effects;
3179 TREE_READONLY (t) = read_only;
3182 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
3183 size or offset that depends on a field within a record. */
3185 bool
3186 contains_placeholder_p (const_tree exp)
3188 enum tree_code code;
3190 if (!exp)
3191 return 0;
3193 code = TREE_CODE (exp);
3194 if (code == PLACEHOLDER_EXPR)
3195 return 1;
3197 switch (TREE_CODE_CLASS (code))
3199 case tcc_reference:
3200 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
3201 position computations since they will be converted into a
3202 WITH_RECORD_EXPR involving the reference, which will assume
3203 here will be valid. */
3204 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0));
3206 case tcc_exceptional:
3207 if (code == TREE_LIST)
3208 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp))
3209 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp)));
3210 break;
3212 case tcc_unary:
3213 case tcc_binary:
3214 case tcc_comparison:
3215 case tcc_expression:
3216 switch (code)
3218 case COMPOUND_EXPR:
3219 /* Ignoring the first operand isn't quite right, but works best. */
3220 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1));
3222 case COND_EXPR:
3223 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0))
3224 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1))
3225 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 2)));
3227 case SAVE_EXPR:
3228 /* The save_expr function never wraps anything containing
3229 a PLACEHOLDER_EXPR. */
3230 return 0;
3232 default:
3233 break;
3236 switch (TREE_CODE_LENGTH (code))
3238 case 1:
3239 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0));
3240 case 2:
3241 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0))
3242 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1)));
3243 default:
3244 return 0;
3247 case tcc_vl_exp:
3248 switch (code)
3250 case CALL_EXPR:
3252 const_tree arg;
3253 const_call_expr_arg_iterator iter;
3254 FOR_EACH_CONST_CALL_EXPR_ARG (arg, iter, exp)
3255 if (CONTAINS_PLACEHOLDER_P (arg))
3256 return 1;
3257 return 0;
3259 default:
3260 return 0;
3263 default:
3264 return 0;
3266 return 0;
3269 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
3270 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
3271 field positions. */
3273 static bool
3274 type_contains_placeholder_1 (const_tree type)
3276 /* If the size contains a placeholder or the parent type (component type in
3277 the case of arrays) type involves a placeholder, this type does. */
3278 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type))
3279 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type))
3280 || (!POINTER_TYPE_P (type)
3281 && TREE_TYPE (type)
3282 && type_contains_placeholder_p (TREE_TYPE (type))))
3283 return true;
3285 /* Now do type-specific checks. Note that the last part of the check above
3286 greatly limits what we have to do below. */
3287 switch (TREE_CODE (type))
3289 case VOID_TYPE:
3290 case COMPLEX_TYPE:
3291 case ENUMERAL_TYPE:
3292 case BOOLEAN_TYPE:
3293 case POINTER_TYPE:
3294 case OFFSET_TYPE:
3295 case REFERENCE_TYPE:
3296 case METHOD_TYPE:
3297 case FUNCTION_TYPE:
3298 case VECTOR_TYPE:
3299 case NULLPTR_TYPE:
3300 return false;
3302 case INTEGER_TYPE:
3303 case REAL_TYPE:
3304 case FIXED_POINT_TYPE:
3305 /* Here we just check the bounds. */
3306 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type))
3307 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type)));
3309 case ARRAY_TYPE:
3310 /* We have already checked the component type above, so just check the
3311 domain type. */
3312 return type_contains_placeholder_p (TYPE_DOMAIN (type));
3314 case RECORD_TYPE:
3315 case UNION_TYPE:
3316 case QUAL_UNION_TYPE:
3318 tree field;
3320 for (field = TYPE_FIELDS (type); field; field = DECL_CHAIN (field))
3321 if (TREE_CODE (field) == FIELD_DECL
3322 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field))
3323 || (TREE_CODE (type) == QUAL_UNION_TYPE
3324 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field)))
3325 || type_contains_placeholder_p (TREE_TYPE (field))))
3326 return true;
3328 return false;
3331 default:
3332 gcc_unreachable ();
3336 /* Wrapper around above function used to cache its result. */
3338 bool
3339 type_contains_placeholder_p (tree type)
3341 bool result;
3343 /* If the contains_placeholder_bits field has been initialized,
3344 then we know the answer. */
3345 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) > 0)
3346 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) - 1;
3348 /* Indicate that we've seen this type node, and the answer is false.
3349 This is what we want to return if we run into recursion via fields. */
3350 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) = 1;
3352 /* Compute the real value. */
3353 result = type_contains_placeholder_1 (type);
3355 /* Store the real value. */
3356 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) = result + 1;
3358 return result;
3361 /* Push tree EXP onto vector QUEUE if it is not already present. */
3363 static void
3364 push_without_duplicates (tree exp, vec<tree> *queue)
3366 unsigned int i;
3367 tree iter;
3369 FOR_EACH_VEC_ELT (*queue, i, iter)
3370 if (simple_cst_equal (iter, exp) == 1)
3371 break;
3373 if (!iter)
3374 queue->safe_push (exp);
3377 /* Given a tree EXP, find all occurrences of references to fields
3378 in a PLACEHOLDER_EXPR and place them in vector REFS without
3379 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
3380 we assume here that EXP contains only arithmetic expressions
3381 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
3382 argument list. */
3384 void
3385 find_placeholder_in_expr (tree exp, vec<tree> *refs)
3387 enum tree_code code = TREE_CODE (exp);
3388 tree inner;
3389 int i;
3391 /* We handle TREE_LIST and COMPONENT_REF separately. */
3392 if (code == TREE_LIST)
3394 FIND_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp), refs);
3395 FIND_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp), refs);
3397 else if (code == COMPONENT_REF)
3399 for (inner = TREE_OPERAND (exp, 0);
3400 REFERENCE_CLASS_P (inner);
3401 inner = TREE_OPERAND (inner, 0))
3404 if (TREE_CODE (inner) == PLACEHOLDER_EXPR)
3405 push_without_duplicates (exp, refs);
3406 else
3407 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), refs);
3409 else
3410 switch (TREE_CODE_CLASS (code))
3412 case tcc_constant:
3413 break;
3415 case tcc_declaration:
3416 /* Variables allocated to static storage can stay. */
3417 if (!TREE_STATIC (exp))
3418 push_without_duplicates (exp, refs);
3419 break;
3421 case tcc_expression:
3422 /* This is the pattern built in ada/make_aligning_type. */
3423 if (code == ADDR_EXPR
3424 && TREE_CODE (TREE_OPERAND (exp, 0)) == PLACEHOLDER_EXPR)
3426 push_without_duplicates (exp, refs);
3427 break;
3430 /* Fall through... */
3432 case tcc_exceptional:
3433 case tcc_unary:
3434 case tcc_binary:
3435 case tcc_comparison:
3436 case tcc_reference:
3437 for (i = 0; i < TREE_CODE_LENGTH (code); i++)
3438 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, i), refs);
3439 break;
3441 case tcc_vl_exp:
3442 for (i = 1; i < TREE_OPERAND_LENGTH (exp); i++)
3443 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, i), refs);
3444 break;
3446 default:
3447 gcc_unreachable ();
3451 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
3452 return a tree with all occurrences of references to F in a
3453 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
3454 CONST_DECLs. Note that we assume here that EXP contains only
3455 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
3456 occurring only in their argument list. */
3458 tree
3459 substitute_in_expr (tree exp, tree f, tree r)
3461 enum tree_code code = TREE_CODE (exp);
3462 tree op0, op1, op2, op3;
3463 tree new_tree;
3465 /* We handle TREE_LIST and COMPONENT_REF separately. */
3466 if (code == TREE_LIST)
3468 op0 = SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp), f, r);
3469 op1 = SUBSTITUTE_IN_EXPR (TREE_VALUE (exp), f, r);
3470 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
3471 return exp;
3473 return tree_cons (TREE_PURPOSE (exp), op1, op0);
3475 else if (code == COMPONENT_REF)
3477 tree inner;
3479 /* If this expression is getting a value from a PLACEHOLDER_EXPR
3480 and it is the right field, replace it with R. */
3481 for (inner = TREE_OPERAND (exp, 0);
3482 REFERENCE_CLASS_P (inner);
3483 inner = TREE_OPERAND (inner, 0))
3486 /* The field. */
3487 op1 = TREE_OPERAND (exp, 1);
3489 if (TREE_CODE (inner) == PLACEHOLDER_EXPR && op1 == f)
3490 return r;
3492 /* If this expression hasn't been completed let, leave it alone. */
3493 if (TREE_CODE (inner) == PLACEHOLDER_EXPR && !TREE_TYPE (inner))
3494 return exp;
3496 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
3497 if (op0 == TREE_OPERAND (exp, 0))
3498 return exp;
3500 new_tree
3501 = fold_build3 (COMPONENT_REF, TREE_TYPE (exp), op0, op1, NULL_TREE);
3503 else
3504 switch (TREE_CODE_CLASS (code))
3506 case tcc_constant:
3507 return exp;
3509 case tcc_declaration:
3510 if (exp == f)
3511 return r;
3512 else
3513 return exp;
3515 case tcc_expression:
3516 if (exp == f)
3517 return r;
3519 /* Fall through... */
3521 case tcc_exceptional:
3522 case tcc_unary:
3523 case tcc_binary:
3524 case tcc_comparison:
3525 case tcc_reference:
3526 switch (TREE_CODE_LENGTH (code))
3528 case 0:
3529 return exp;
3531 case 1:
3532 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
3533 if (op0 == TREE_OPERAND (exp, 0))
3534 return exp;
3536 new_tree = fold_build1 (code, TREE_TYPE (exp), op0);
3537 break;
3539 case 2:
3540 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
3541 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
3543 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
3544 return exp;
3546 new_tree = fold_build2 (code, TREE_TYPE (exp), op0, op1);
3547 break;
3549 case 3:
3550 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
3551 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
3552 op2 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 2), f, r);
3554 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
3555 && op2 == TREE_OPERAND (exp, 2))
3556 return exp;
3558 new_tree = fold_build3 (code, TREE_TYPE (exp), op0, op1, op2);
3559 break;
3561 case 4:
3562 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
3563 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
3564 op2 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 2), f, r);
3565 op3 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 3), f, r);
3567 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
3568 && op2 == TREE_OPERAND (exp, 2)
3569 && op3 == TREE_OPERAND (exp, 3))
3570 return exp;
3572 new_tree
3573 = fold (build4 (code, TREE_TYPE (exp), op0, op1, op2, op3));
3574 break;
3576 default:
3577 gcc_unreachable ();
3579 break;
3581 case tcc_vl_exp:
3583 int i;
3585 new_tree = NULL_TREE;
3587 /* If we are trying to replace F with a constant, inline back
3588 functions which do nothing else than computing a value from
3589 the arguments they are passed. This makes it possible to
3590 fold partially or entirely the replacement expression. */
3591 if (CONSTANT_CLASS_P (r) && code == CALL_EXPR)
3593 tree t = maybe_inline_call_in_expr (exp);
3594 if (t)
3595 return SUBSTITUTE_IN_EXPR (t, f, r);
3598 for (i = 1; i < TREE_OPERAND_LENGTH (exp); i++)
3600 tree op = TREE_OPERAND (exp, i);
3601 tree new_op = SUBSTITUTE_IN_EXPR (op, f, r);
3602 if (new_op != op)
3604 if (!new_tree)
3605 new_tree = copy_node (exp);
3606 TREE_OPERAND (new_tree, i) = new_op;
3610 if (new_tree)
3612 new_tree = fold (new_tree);
3613 if (TREE_CODE (new_tree) == CALL_EXPR)
3614 process_call_operands (new_tree);
3616 else
3617 return exp;
3619 break;
3621 default:
3622 gcc_unreachable ();
3625 TREE_READONLY (new_tree) |= TREE_READONLY (exp);
3627 if (code == INDIRECT_REF || code == ARRAY_REF || code == ARRAY_RANGE_REF)
3628 TREE_THIS_NOTRAP (new_tree) |= TREE_THIS_NOTRAP (exp);
3630 return new_tree;
3633 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
3634 for it within OBJ, a tree that is an object or a chain of references. */
3636 tree
3637 substitute_placeholder_in_expr (tree exp, tree obj)
3639 enum tree_code code = TREE_CODE (exp);
3640 tree op0, op1, op2, op3;
3641 tree new_tree;
3643 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
3644 in the chain of OBJ. */
3645 if (code == PLACEHOLDER_EXPR)
3647 tree need_type = TYPE_MAIN_VARIANT (TREE_TYPE (exp));
3648 tree elt;
3650 for (elt = obj; elt != 0;
3651 elt = ((TREE_CODE (elt) == COMPOUND_EXPR
3652 || TREE_CODE (elt) == COND_EXPR)
3653 ? TREE_OPERAND (elt, 1)
3654 : (REFERENCE_CLASS_P (elt)
3655 || UNARY_CLASS_P (elt)
3656 || BINARY_CLASS_P (elt)
3657 || VL_EXP_CLASS_P (elt)
3658 || EXPRESSION_CLASS_P (elt))
3659 ? TREE_OPERAND (elt, 0) : 0))
3660 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt)) == need_type)
3661 return elt;
3663 for (elt = obj; elt != 0;
3664 elt = ((TREE_CODE (elt) == COMPOUND_EXPR
3665 || TREE_CODE (elt) == COND_EXPR)
3666 ? TREE_OPERAND (elt, 1)
3667 : (REFERENCE_CLASS_P (elt)
3668 || UNARY_CLASS_P (elt)
3669 || BINARY_CLASS_P (elt)
3670 || VL_EXP_CLASS_P (elt)
3671 || EXPRESSION_CLASS_P (elt))
3672 ? TREE_OPERAND (elt, 0) : 0))
3673 if (POINTER_TYPE_P (TREE_TYPE (elt))
3674 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt)))
3675 == need_type))
3676 return fold_build1 (INDIRECT_REF, need_type, elt);
3678 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
3679 survives until RTL generation, there will be an error. */
3680 return exp;
3683 /* TREE_LIST is special because we need to look at TREE_VALUE
3684 and TREE_CHAIN, not TREE_OPERANDS. */
3685 else if (code == TREE_LIST)
3687 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp), obj);
3688 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp), obj);
3689 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
3690 return exp;
3692 return tree_cons (TREE_PURPOSE (exp), op1, op0);
3694 else
3695 switch (TREE_CODE_CLASS (code))
3697 case tcc_constant:
3698 case tcc_declaration:
3699 return exp;
3701 case tcc_exceptional:
3702 case tcc_unary:
3703 case tcc_binary:
3704 case tcc_comparison:
3705 case tcc_expression:
3706 case tcc_reference:
3707 case tcc_statement:
3708 switch (TREE_CODE_LENGTH (code))
3710 case 0:
3711 return exp;
3713 case 1:
3714 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
3715 if (op0 == TREE_OPERAND (exp, 0))
3716 return exp;
3718 new_tree = fold_build1 (code, TREE_TYPE (exp), op0);
3719 break;
3721 case 2:
3722 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
3723 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
3725 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
3726 return exp;
3728 new_tree = fold_build2 (code, TREE_TYPE (exp), op0, op1);
3729 break;
3731 case 3:
3732 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
3733 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
3734 op2 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 2), obj);
3736 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
3737 && op2 == TREE_OPERAND (exp, 2))
3738 return exp;
3740 new_tree = fold_build3 (code, TREE_TYPE (exp), op0, op1, op2);
3741 break;
3743 case 4:
3744 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
3745 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
3746 op2 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 2), obj);
3747 op3 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 3), obj);
3749 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
3750 && op2 == TREE_OPERAND (exp, 2)
3751 && op3 == TREE_OPERAND (exp, 3))
3752 return exp;
3754 new_tree
3755 = fold (build4 (code, TREE_TYPE (exp), op0, op1, op2, op3));
3756 break;
3758 default:
3759 gcc_unreachable ();
3761 break;
3763 case tcc_vl_exp:
3765 int i;
3767 new_tree = NULL_TREE;
3769 for (i = 1; i < TREE_OPERAND_LENGTH (exp); i++)
3771 tree op = TREE_OPERAND (exp, i);
3772 tree new_op = SUBSTITUTE_PLACEHOLDER_IN_EXPR (op, obj);
3773 if (new_op != op)
3775 if (!new_tree)
3776 new_tree = copy_node (exp);
3777 TREE_OPERAND (new_tree, i) = new_op;
3781 if (new_tree)
3783 new_tree = fold (new_tree);
3784 if (TREE_CODE (new_tree) == CALL_EXPR)
3785 process_call_operands (new_tree);
3787 else
3788 return exp;
3790 break;
3792 default:
3793 gcc_unreachable ();
3796 TREE_READONLY (new_tree) |= TREE_READONLY (exp);
3798 if (code == INDIRECT_REF || code == ARRAY_REF || code == ARRAY_RANGE_REF)
3799 TREE_THIS_NOTRAP (new_tree) |= TREE_THIS_NOTRAP (exp);
3801 return new_tree;
3805 /* Subroutine of stabilize_reference; this is called for subtrees of
3806 references. Any expression with side-effects must be put in a SAVE_EXPR
3807 to ensure that it is only evaluated once.
3809 We don't put SAVE_EXPR nodes around everything, because assigning very
3810 simple expressions to temporaries causes us to miss good opportunities
3811 for optimizations. Among other things, the opportunity to fold in the
3812 addition of a constant into an addressing mode often gets lost, e.g.
3813 "y[i+1] += x;". In general, we take the approach that we should not make
3814 an assignment unless we are forced into it - i.e., that any non-side effect
3815 operator should be allowed, and that cse should take care of coalescing
3816 multiple utterances of the same expression should that prove fruitful. */
3818 static tree
3819 stabilize_reference_1 (tree e)
3821 tree result;
3822 enum tree_code code = TREE_CODE (e);
3824 /* We cannot ignore const expressions because it might be a reference
3825 to a const array but whose index contains side-effects. But we can
3826 ignore things that are actual constant or that already have been
3827 handled by this function. */
3829 if (tree_invariant_p (e))
3830 return e;
3832 switch (TREE_CODE_CLASS (code))
3834 case tcc_exceptional:
3835 case tcc_type:
3836 case tcc_declaration:
3837 case tcc_comparison:
3838 case tcc_statement:
3839 case tcc_expression:
3840 case tcc_reference:
3841 case tcc_vl_exp:
3842 /* If the expression has side-effects, then encase it in a SAVE_EXPR
3843 so that it will only be evaluated once. */
3844 /* The reference (r) and comparison (<) classes could be handled as
3845 below, but it is generally faster to only evaluate them once. */
3846 if (TREE_SIDE_EFFECTS (e))
3847 return save_expr (e);
3848 return e;
3850 case tcc_constant:
3851 /* Constants need no processing. In fact, we should never reach
3852 here. */
3853 return e;
3855 case tcc_binary:
3856 /* Division is slow and tends to be compiled with jumps,
3857 especially the division by powers of 2 that is often
3858 found inside of an array reference. So do it just once. */
3859 if (code == TRUNC_DIV_EXPR || code == TRUNC_MOD_EXPR
3860 || code == FLOOR_DIV_EXPR || code == FLOOR_MOD_EXPR
3861 || code == CEIL_DIV_EXPR || code == CEIL_MOD_EXPR
3862 || code == ROUND_DIV_EXPR || code == ROUND_MOD_EXPR)
3863 return save_expr (e);
3864 /* Recursively stabilize each operand. */
3865 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)),
3866 stabilize_reference_1 (TREE_OPERAND (e, 1)));
3867 break;
3869 case tcc_unary:
3870 /* Recursively stabilize each operand. */
3871 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)));
3872 break;
3874 default:
3875 gcc_unreachable ();
3878 TREE_TYPE (result) = TREE_TYPE (e);
3879 TREE_READONLY (result) = TREE_READONLY (e);
3880 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (e);
3881 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (e);
3883 return result;
3886 /* Stabilize a reference so that we can use it any number of times
3887 without causing its operands to be evaluated more than once.
3888 Returns the stabilized reference. This works by means of save_expr,
3889 so see the caveats in the comments about save_expr.
3891 Also allows conversion expressions whose operands are references.
3892 Any other kind of expression is returned unchanged. */
3894 tree
3895 stabilize_reference (tree ref)
3897 tree result;
3898 enum tree_code code = TREE_CODE (ref);
3900 switch (code)
3902 case VAR_DECL:
3903 case PARM_DECL:
3904 case RESULT_DECL:
3905 /* No action is needed in this case. */
3906 return ref;
3908 CASE_CONVERT:
3909 case FLOAT_EXPR:
3910 case FIX_TRUNC_EXPR:
3911 result = build_nt (code, stabilize_reference (TREE_OPERAND (ref, 0)));
3912 break;
3914 case INDIRECT_REF:
3915 result = build_nt (INDIRECT_REF,
3916 stabilize_reference_1 (TREE_OPERAND (ref, 0)));
3917 break;
3919 case COMPONENT_REF:
3920 result = build_nt (COMPONENT_REF,
3921 stabilize_reference (TREE_OPERAND (ref, 0)),
3922 TREE_OPERAND (ref, 1), NULL_TREE);
3923 break;
3925 case BIT_FIELD_REF:
3926 result = build_nt (BIT_FIELD_REF,
3927 stabilize_reference (TREE_OPERAND (ref, 0)),
3928 TREE_OPERAND (ref, 1), TREE_OPERAND (ref, 2));
3929 break;
3931 case ARRAY_REF:
3932 result = build_nt (ARRAY_REF,
3933 stabilize_reference (TREE_OPERAND (ref, 0)),
3934 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
3935 TREE_OPERAND (ref, 2), TREE_OPERAND (ref, 3));
3936 break;
3938 case ARRAY_RANGE_REF:
3939 result = build_nt (ARRAY_RANGE_REF,
3940 stabilize_reference (TREE_OPERAND (ref, 0)),
3941 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
3942 TREE_OPERAND (ref, 2), TREE_OPERAND (ref, 3));
3943 break;
3945 case COMPOUND_EXPR:
3946 /* We cannot wrap the first expression in a SAVE_EXPR, as then
3947 it wouldn't be ignored. This matters when dealing with
3948 volatiles. */
3949 return stabilize_reference_1 (ref);
3951 /* If arg isn't a kind of lvalue we recognize, make no change.
3952 Caller should recognize the error for an invalid lvalue. */
3953 default:
3954 return ref;
3956 case ERROR_MARK:
3957 return error_mark_node;
3960 TREE_TYPE (result) = TREE_TYPE (ref);
3961 TREE_READONLY (result) = TREE_READONLY (ref);
3962 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (ref);
3963 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (ref);
3965 return result;
3968 /* Low-level constructors for expressions. */
3970 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
3971 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
3973 void
3974 recompute_tree_invariant_for_addr_expr (tree t)
3976 tree node;
3977 bool tc = true, se = false;
3979 /* We started out assuming this address is both invariant and constant, but
3980 does not have side effects. Now go down any handled components and see if
3981 any of them involve offsets that are either non-constant or non-invariant.
3982 Also check for side-effects.
3984 ??? Note that this code makes no attempt to deal with the case where
3985 taking the address of something causes a copy due to misalignment. */
3987 #define UPDATE_FLAGS(NODE) \
3988 do { tree _node = (NODE); \
3989 if (_node && !TREE_CONSTANT (_node)) tc = false; \
3990 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
3992 for (node = TREE_OPERAND (t, 0); handled_component_p (node);
3993 node = TREE_OPERAND (node, 0))
3995 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
3996 array reference (probably made temporarily by the G++ front end),
3997 so ignore all the operands. */
3998 if ((TREE_CODE (node) == ARRAY_REF
3999 || TREE_CODE (node) == ARRAY_RANGE_REF)
4000 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node, 0))) == ARRAY_TYPE)
4002 UPDATE_FLAGS (TREE_OPERAND (node, 1));
4003 if (TREE_OPERAND (node, 2))
4004 UPDATE_FLAGS (TREE_OPERAND (node, 2));
4005 if (TREE_OPERAND (node, 3))
4006 UPDATE_FLAGS (TREE_OPERAND (node, 3));
4008 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
4009 FIELD_DECL, apparently. The G++ front end can put something else
4010 there, at least temporarily. */
4011 else if (TREE_CODE (node) == COMPONENT_REF
4012 && TREE_CODE (TREE_OPERAND (node, 1)) == FIELD_DECL)
4014 if (TREE_OPERAND (node, 2))
4015 UPDATE_FLAGS (TREE_OPERAND (node, 2));
4019 node = lang_hooks.expr_to_decl (node, &tc, &se);
4021 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
4022 the address, since &(*a)->b is a form of addition. If it's a constant, the
4023 address is constant too. If it's a decl, its address is constant if the
4024 decl is static. Everything else is not constant and, furthermore,
4025 taking the address of a volatile variable is not volatile. */
4026 if (TREE_CODE (node) == INDIRECT_REF
4027 || TREE_CODE (node) == MEM_REF)
4028 UPDATE_FLAGS (TREE_OPERAND (node, 0));
4029 else if (CONSTANT_CLASS_P (node))
4031 else if (DECL_P (node))
4032 tc &= (staticp (node) != NULL_TREE);
4033 else
4035 tc = false;
4036 se |= TREE_SIDE_EFFECTS (node);
4040 TREE_CONSTANT (t) = tc;
4041 TREE_SIDE_EFFECTS (t) = se;
4042 #undef UPDATE_FLAGS
4045 /* Build an expression of code CODE, data type TYPE, and operands as
4046 specified. Expressions and reference nodes can be created this way.
4047 Constants, decls, types and misc nodes cannot be.
4049 We define 5 non-variadic functions, from 0 to 4 arguments. This is
4050 enough for all extant tree codes. */
4052 tree
4053 build0_stat (enum tree_code code, tree tt MEM_STAT_DECL)
4055 tree t;
4057 gcc_assert (TREE_CODE_LENGTH (code) == 0);
4059 t = make_node_stat (code PASS_MEM_STAT);
4060 TREE_TYPE (t) = tt;
4062 return t;
4065 tree
4066 build1_stat (enum tree_code code, tree type, tree node MEM_STAT_DECL)
4068 int length = sizeof (struct tree_exp);
4069 tree t;
4071 record_node_allocation_statistics (code, length);
4073 gcc_assert (TREE_CODE_LENGTH (code) == 1);
4075 t = ggc_alloc_tree_node_stat (length PASS_MEM_STAT);
4077 memset (t, 0, sizeof (struct tree_common));
4079 TREE_SET_CODE (t, code);
4081 TREE_TYPE (t) = type;
4082 SET_EXPR_LOCATION (t, UNKNOWN_LOCATION);
4083 TREE_OPERAND (t, 0) = node;
4084 if (node && !TYPE_P (node))
4086 TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (node);
4087 TREE_READONLY (t) = TREE_READONLY (node);
4090 if (TREE_CODE_CLASS (code) == tcc_statement)
4091 TREE_SIDE_EFFECTS (t) = 1;
4092 else switch (code)
4094 case VA_ARG_EXPR:
4095 /* All of these have side-effects, no matter what their
4096 operands are. */
4097 TREE_SIDE_EFFECTS (t) = 1;
4098 TREE_READONLY (t) = 0;
4099 break;
4101 case INDIRECT_REF:
4102 /* Whether a dereference is readonly has nothing to do with whether
4103 its operand is readonly. */
4104 TREE_READONLY (t) = 0;
4105 break;
4107 case ADDR_EXPR:
4108 if (node)
4109 recompute_tree_invariant_for_addr_expr (t);
4110 break;
4112 default:
4113 if ((TREE_CODE_CLASS (code) == tcc_unary || code == VIEW_CONVERT_EXPR)
4114 && node && !TYPE_P (node)
4115 && TREE_CONSTANT (node))
4116 TREE_CONSTANT (t) = 1;
4117 if (TREE_CODE_CLASS (code) == tcc_reference
4118 && node && TREE_THIS_VOLATILE (node))
4119 TREE_THIS_VOLATILE (t) = 1;
4120 break;
4123 return t;
4126 #define PROCESS_ARG(N) \
4127 do { \
4128 TREE_OPERAND (t, N) = arg##N; \
4129 if (arg##N &&!TYPE_P (arg##N)) \
4131 if (TREE_SIDE_EFFECTS (arg##N)) \
4132 side_effects = 1; \
4133 if (!TREE_READONLY (arg##N) \
4134 && !CONSTANT_CLASS_P (arg##N)) \
4135 (void) (read_only = 0); \
4136 if (!TREE_CONSTANT (arg##N)) \
4137 (void) (constant = 0); \
4139 } while (0)
4141 tree
4142 build2_stat (enum tree_code code, tree tt, tree arg0, tree arg1 MEM_STAT_DECL)
4144 bool constant, read_only, side_effects;
4145 tree t;
4147 gcc_assert (TREE_CODE_LENGTH (code) == 2);
4149 if ((code == MINUS_EXPR || code == PLUS_EXPR || code == MULT_EXPR)
4150 && arg0 && arg1 && tt && POINTER_TYPE_P (tt)
4151 /* When sizetype precision doesn't match that of pointers
4152 we need to be able to build explicit extensions or truncations
4153 of the offset argument. */
4154 && TYPE_PRECISION (sizetype) == TYPE_PRECISION (tt))
4155 gcc_assert (TREE_CODE (arg0) == INTEGER_CST
4156 && TREE_CODE (arg1) == INTEGER_CST);
4158 if (code == POINTER_PLUS_EXPR && arg0 && arg1 && tt)
4159 gcc_assert (POINTER_TYPE_P (tt) && POINTER_TYPE_P (TREE_TYPE (arg0))
4160 && ptrofftype_p (TREE_TYPE (arg1)));
4162 t = make_node_stat (code PASS_MEM_STAT);
4163 TREE_TYPE (t) = tt;
4165 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
4166 result based on those same flags for the arguments. But if the
4167 arguments aren't really even `tree' expressions, we shouldn't be trying
4168 to do this. */
4170 /* Expressions without side effects may be constant if their
4171 arguments are as well. */
4172 constant = (TREE_CODE_CLASS (code) == tcc_comparison
4173 || TREE_CODE_CLASS (code) == tcc_binary);
4174 read_only = 1;
4175 side_effects = TREE_SIDE_EFFECTS (t);
4177 PROCESS_ARG (0);
4178 PROCESS_ARG (1);
4180 TREE_READONLY (t) = read_only;
4181 TREE_CONSTANT (t) = constant;
4182 TREE_SIDE_EFFECTS (t) = side_effects;
4183 TREE_THIS_VOLATILE (t)
4184 = (TREE_CODE_CLASS (code) == tcc_reference
4185 && arg0 && TREE_THIS_VOLATILE (arg0));
4187 return t;
4191 tree
4192 build3_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
4193 tree arg2 MEM_STAT_DECL)
4195 bool constant, read_only, side_effects;
4196 tree t;
4198 gcc_assert (TREE_CODE_LENGTH (code) == 3);
4199 gcc_assert (TREE_CODE_CLASS (code) != tcc_vl_exp);
4201 t = make_node_stat (code PASS_MEM_STAT);
4202 TREE_TYPE (t) = tt;
4204 read_only = 1;
4206 /* As a special exception, if COND_EXPR has NULL branches, we
4207 assume that it is a gimple statement and always consider
4208 it to have side effects. */
4209 if (code == COND_EXPR
4210 && tt == void_type_node
4211 && arg1 == NULL_TREE
4212 && arg2 == NULL_TREE)
4213 side_effects = true;
4214 else
4215 side_effects = TREE_SIDE_EFFECTS (t);
4217 PROCESS_ARG (0);
4218 PROCESS_ARG (1);
4219 PROCESS_ARG (2);
4221 if (code == COND_EXPR)
4222 TREE_READONLY (t) = read_only;
4224 TREE_SIDE_EFFECTS (t) = side_effects;
4225 TREE_THIS_VOLATILE (t)
4226 = (TREE_CODE_CLASS (code) == tcc_reference
4227 && arg0 && TREE_THIS_VOLATILE (arg0));
4229 return t;
4232 tree
4233 build4_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
4234 tree arg2, tree arg3 MEM_STAT_DECL)
4236 bool constant, read_only, side_effects;
4237 tree t;
4239 gcc_assert (TREE_CODE_LENGTH (code) == 4);
4241 t = make_node_stat (code PASS_MEM_STAT);
4242 TREE_TYPE (t) = tt;
4244 side_effects = TREE_SIDE_EFFECTS (t);
4246 PROCESS_ARG (0);
4247 PROCESS_ARG (1);
4248 PROCESS_ARG (2);
4249 PROCESS_ARG (3);
4251 TREE_SIDE_EFFECTS (t) = side_effects;
4252 TREE_THIS_VOLATILE (t)
4253 = (TREE_CODE_CLASS (code) == tcc_reference
4254 && arg0 && TREE_THIS_VOLATILE (arg0));
4256 return t;
4259 tree
4260 build5_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
4261 tree arg2, tree arg3, tree arg4 MEM_STAT_DECL)
4263 bool constant, read_only, side_effects;
4264 tree t;
4266 gcc_assert (TREE_CODE_LENGTH (code) == 5);
4268 t = make_node_stat (code PASS_MEM_STAT);
4269 TREE_TYPE (t) = tt;
4271 side_effects = TREE_SIDE_EFFECTS (t);
4273 PROCESS_ARG (0);
4274 PROCESS_ARG (1);
4275 PROCESS_ARG (2);
4276 PROCESS_ARG (3);
4277 PROCESS_ARG (4);
4279 TREE_SIDE_EFFECTS (t) = side_effects;
4280 TREE_THIS_VOLATILE (t)
4281 = (TREE_CODE_CLASS (code) == tcc_reference
4282 && arg0 && TREE_THIS_VOLATILE (arg0));
4284 return t;
4287 /* Build a simple MEM_REF tree with the sematics of a plain INDIRECT_REF
4288 on the pointer PTR. */
4290 tree
4291 build_simple_mem_ref_loc (location_t loc, tree ptr)
4293 HOST_WIDE_INT offset = 0;
4294 tree ptype = TREE_TYPE (ptr);
4295 tree tem;
4296 /* For convenience allow addresses that collapse to a simple base
4297 and offset. */
4298 if (TREE_CODE (ptr) == ADDR_EXPR
4299 && (handled_component_p (TREE_OPERAND (ptr, 0))
4300 || TREE_CODE (TREE_OPERAND (ptr, 0)) == MEM_REF))
4302 ptr = get_addr_base_and_unit_offset (TREE_OPERAND (ptr, 0), &offset);
4303 gcc_assert (ptr);
4304 ptr = build_fold_addr_expr (ptr);
4305 gcc_assert (is_gimple_reg (ptr) || is_gimple_min_invariant (ptr));
4307 tem = build2 (MEM_REF, TREE_TYPE (ptype),
4308 ptr, build_int_cst (ptype, offset));
4309 SET_EXPR_LOCATION (tem, loc);
4310 return tem;
4313 /* Return the constant offset of a MEM_REF or TARGET_MEM_REF tree T. */
4315 double_int
4316 mem_ref_offset (const_tree t)
4318 tree toff = TREE_OPERAND (t, 1);
4319 return tree_to_double_int (toff).sext (TYPE_PRECISION (TREE_TYPE (toff)));
4322 /* Return an invariant ADDR_EXPR of type TYPE taking the address of BASE
4323 offsetted by OFFSET units. */
4325 tree
4326 build_invariant_address (tree type, tree base, HOST_WIDE_INT offset)
4328 tree ref = fold_build2 (MEM_REF, TREE_TYPE (type),
4329 build_fold_addr_expr (base),
4330 build_int_cst (ptr_type_node, offset));
4331 tree addr = build1 (ADDR_EXPR, type, ref);
4332 recompute_tree_invariant_for_addr_expr (addr);
4333 return addr;
4336 /* Similar except don't specify the TREE_TYPE
4337 and leave the TREE_SIDE_EFFECTS as 0.
4338 It is permissible for arguments to be null,
4339 or even garbage if their values do not matter. */
4341 tree
4342 build_nt (enum tree_code code, ...)
4344 tree t;
4345 int length;
4346 int i;
4347 va_list p;
4349 gcc_assert (TREE_CODE_CLASS (code) != tcc_vl_exp);
4351 va_start (p, code);
4353 t = make_node (code);
4354 length = TREE_CODE_LENGTH (code);
4356 for (i = 0; i < length; i++)
4357 TREE_OPERAND (t, i) = va_arg (p, tree);
4359 va_end (p);
4360 return t;
4363 /* Similar to build_nt, but for creating a CALL_EXPR object with a
4364 tree vec. */
4366 tree
4367 build_nt_call_vec (tree fn, vec<tree, va_gc> *args)
4369 tree ret, t;
4370 unsigned int ix;
4372 ret = build_vl_exp (CALL_EXPR, vec_safe_length (args) + 3);
4373 CALL_EXPR_FN (ret) = fn;
4374 CALL_EXPR_STATIC_CHAIN (ret) = NULL_TREE;
4375 FOR_EACH_VEC_SAFE_ELT (args, ix, t)
4376 CALL_EXPR_ARG (ret, ix) = t;
4377 return ret;
4380 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
4381 We do NOT enter this node in any sort of symbol table.
4383 LOC is the location of the decl.
4385 layout_decl is used to set up the decl's storage layout.
4386 Other slots are initialized to 0 or null pointers. */
4388 tree
4389 build_decl_stat (location_t loc, enum tree_code code, tree name,
4390 tree type MEM_STAT_DECL)
4392 tree t;
4394 t = make_node_stat (code PASS_MEM_STAT);
4395 DECL_SOURCE_LOCATION (t) = loc;
4397 /* if (type == error_mark_node)
4398 type = integer_type_node; */
4399 /* That is not done, deliberately, so that having error_mark_node
4400 as the type can suppress useless errors in the use of this variable. */
4402 DECL_NAME (t) = name;
4403 TREE_TYPE (t) = type;
4405 if (code == VAR_DECL || code == PARM_DECL || code == RESULT_DECL)
4406 layout_decl (t, 0);
4408 return t;
4411 /* Builds and returns function declaration with NAME and TYPE. */
4413 tree
4414 build_fn_decl (const char *name, tree type)
4416 tree id = get_identifier (name);
4417 tree decl = build_decl (input_location, FUNCTION_DECL, id, type);
4419 DECL_EXTERNAL (decl) = 1;
4420 TREE_PUBLIC (decl) = 1;
4421 DECL_ARTIFICIAL (decl) = 1;
4422 TREE_NOTHROW (decl) = 1;
4424 return decl;
4427 vec<tree, va_gc> *all_translation_units;
4429 /* Builds a new translation-unit decl with name NAME, queues it in the
4430 global list of translation-unit decls and returns it. */
4432 tree
4433 build_translation_unit_decl (tree name)
4435 tree tu = build_decl (UNKNOWN_LOCATION, TRANSLATION_UNIT_DECL,
4436 name, NULL_TREE);
4437 TRANSLATION_UNIT_LANGUAGE (tu) = lang_hooks.name;
4438 vec_safe_push (all_translation_units, tu);
4439 return tu;
4443 /* BLOCK nodes are used to represent the structure of binding contours
4444 and declarations, once those contours have been exited and their contents
4445 compiled. This information is used for outputting debugging info. */
4447 tree
4448 build_block (tree vars, tree subblocks, tree supercontext, tree chain)
4450 tree block = make_node (BLOCK);
4452 BLOCK_VARS (block) = vars;
4453 BLOCK_SUBBLOCKS (block) = subblocks;
4454 BLOCK_SUPERCONTEXT (block) = supercontext;
4455 BLOCK_CHAIN (block) = chain;
4456 return block;
4460 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
4462 LOC is the location to use in tree T. */
4464 void
4465 protected_set_expr_location (tree t, location_t loc)
4467 if (t && CAN_HAVE_LOCATION_P (t))
4468 SET_EXPR_LOCATION (t, loc);
4471 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
4472 is ATTRIBUTE. */
4474 tree
4475 build_decl_attribute_variant (tree ddecl, tree attribute)
4477 DECL_ATTRIBUTES (ddecl) = attribute;
4478 return ddecl;
4481 /* Borrowed from hashtab.c iterative_hash implementation. */
4482 #define mix(a,b,c) \
4484 a -= b; a -= c; a ^= (c>>13); \
4485 b -= c; b -= a; b ^= (a<< 8); \
4486 c -= a; c -= b; c ^= ((b&0xffffffff)>>13); \
4487 a -= b; a -= c; a ^= ((c&0xffffffff)>>12); \
4488 b -= c; b -= a; b = (b ^ (a<<16)) & 0xffffffff; \
4489 c -= a; c -= b; c = (c ^ (b>> 5)) & 0xffffffff; \
4490 a -= b; a -= c; a = (a ^ (c>> 3)) & 0xffffffff; \
4491 b -= c; b -= a; b = (b ^ (a<<10)) & 0xffffffff; \
4492 c -= a; c -= b; c = (c ^ (b>>15)) & 0xffffffff; \
4496 /* Produce good hash value combining VAL and VAL2. */
4497 hashval_t
4498 iterative_hash_hashval_t (hashval_t val, hashval_t val2)
4500 /* the golden ratio; an arbitrary value. */
4501 hashval_t a = 0x9e3779b9;
4503 mix (a, val, val2);
4504 return val2;
4507 /* Produce good hash value combining VAL and VAL2. */
4508 hashval_t
4509 iterative_hash_host_wide_int (HOST_WIDE_INT val, hashval_t val2)
4511 if (sizeof (HOST_WIDE_INT) == sizeof (hashval_t))
4512 return iterative_hash_hashval_t (val, val2);
4513 else
4515 hashval_t a = (hashval_t) val;
4516 /* Avoid warnings about shifting of more than the width of the type on
4517 hosts that won't execute this path. */
4518 int zero = 0;
4519 hashval_t b = (hashval_t) (val >> (sizeof (hashval_t) * 8 + zero));
4520 mix (a, b, val2);
4521 if (sizeof (HOST_WIDE_INT) > 2 * sizeof (hashval_t))
4523 hashval_t a = (hashval_t) (val >> (sizeof (hashval_t) * 16 + zero));
4524 hashval_t b = (hashval_t) (val >> (sizeof (hashval_t) * 24 + zero));
4525 mix (a, b, val2);
4527 return val2;
4531 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4532 is ATTRIBUTE and its qualifiers are QUALS.
4534 Record such modified types already made so we don't make duplicates. */
4536 tree
4537 build_type_attribute_qual_variant (tree ttype, tree attribute, int quals)
4539 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype), attribute))
4541 hashval_t hashcode = 0;
4542 tree ntype;
4543 enum tree_code code = TREE_CODE (ttype);
4545 /* Building a distinct copy of a tagged type is inappropriate; it
4546 causes breakage in code that expects there to be a one-to-one
4547 relationship between a struct and its fields.
4548 build_duplicate_type is another solution (as used in
4549 handle_transparent_union_attribute), but that doesn't play well
4550 with the stronger C++ type identity model. */
4551 if (TREE_CODE (ttype) == RECORD_TYPE
4552 || TREE_CODE (ttype) == UNION_TYPE
4553 || TREE_CODE (ttype) == QUAL_UNION_TYPE
4554 || TREE_CODE (ttype) == ENUMERAL_TYPE)
4556 warning (OPT_Wattributes,
4557 "ignoring attributes applied to %qT after definition",
4558 TYPE_MAIN_VARIANT (ttype));
4559 return build_qualified_type (ttype, quals);
4562 ttype = build_qualified_type (ttype, TYPE_UNQUALIFIED);
4563 ntype = build_distinct_type_copy (ttype);
4565 TYPE_ATTRIBUTES (ntype) = attribute;
4567 hashcode = iterative_hash_object (code, hashcode);
4568 if (TREE_TYPE (ntype))
4569 hashcode = iterative_hash_object (TYPE_HASH (TREE_TYPE (ntype)),
4570 hashcode);
4571 hashcode = attribute_hash_list (attribute, hashcode);
4573 switch (TREE_CODE (ntype))
4575 case FUNCTION_TYPE:
4576 hashcode = type_hash_list (TYPE_ARG_TYPES (ntype), hashcode);
4577 break;
4578 case ARRAY_TYPE:
4579 if (TYPE_DOMAIN (ntype))
4580 hashcode = iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (ntype)),
4581 hashcode);
4582 break;
4583 case INTEGER_TYPE:
4584 hashcode = iterative_hash_object
4585 (TREE_INT_CST_LOW (TYPE_MAX_VALUE (ntype)), hashcode);
4586 hashcode = iterative_hash_object
4587 (TREE_INT_CST_HIGH (TYPE_MAX_VALUE (ntype)), hashcode);
4588 break;
4589 case REAL_TYPE:
4590 case FIXED_POINT_TYPE:
4592 unsigned int precision = TYPE_PRECISION (ntype);
4593 hashcode = iterative_hash_object (precision, hashcode);
4595 break;
4596 default:
4597 break;
4600 ntype = type_hash_canon (hashcode, ntype);
4602 /* If the target-dependent attributes make NTYPE different from
4603 its canonical type, we will need to use structural equality
4604 checks for this type. */
4605 if (TYPE_STRUCTURAL_EQUALITY_P (ttype)
4606 || !comp_type_attributes (ntype, ttype))
4607 SET_TYPE_STRUCTURAL_EQUALITY (ntype);
4608 else if (TYPE_CANONICAL (ntype) == ntype)
4609 TYPE_CANONICAL (ntype) = TYPE_CANONICAL (ttype);
4611 ttype = build_qualified_type (ntype, quals);
4613 else if (TYPE_QUALS (ttype) != quals)
4614 ttype = build_qualified_type (ttype, quals);
4616 return ttype;
4619 /* Check if "omp declare simd" attribute arguments, CLAUSES1 and CLAUSES2, are
4620 the same. */
4622 static bool
4623 omp_declare_simd_clauses_equal (tree clauses1, tree clauses2)
4625 tree cl1, cl2;
4626 for (cl1 = clauses1, cl2 = clauses2;
4627 cl1 && cl2;
4628 cl1 = OMP_CLAUSE_CHAIN (cl1), cl2 = OMP_CLAUSE_CHAIN (cl2))
4630 if (OMP_CLAUSE_CODE (cl1) != OMP_CLAUSE_CODE (cl2))
4631 return false;
4632 if (OMP_CLAUSE_CODE (cl1) != OMP_CLAUSE_SIMDLEN)
4634 if (simple_cst_equal (OMP_CLAUSE_DECL (cl1),
4635 OMP_CLAUSE_DECL (cl2)) != 1)
4636 return false;
4638 switch (OMP_CLAUSE_CODE (cl1))
4640 case OMP_CLAUSE_ALIGNED:
4641 if (simple_cst_equal (OMP_CLAUSE_ALIGNED_ALIGNMENT (cl1),
4642 OMP_CLAUSE_ALIGNED_ALIGNMENT (cl2)) != 1)
4643 return false;
4644 break;
4645 case OMP_CLAUSE_LINEAR:
4646 if (simple_cst_equal (OMP_CLAUSE_LINEAR_STEP (cl1),
4647 OMP_CLAUSE_LINEAR_STEP (cl2)) != 1)
4648 return false;
4649 break;
4650 case OMP_CLAUSE_SIMDLEN:
4651 if (simple_cst_equal (OMP_CLAUSE_SIMDLEN_EXPR (cl1),
4652 OMP_CLAUSE_SIMDLEN_EXPR (cl2)) != 1)
4653 return false;
4654 default:
4655 break;
4658 return true;
4661 /* Compare two constructor-element-type constants. Return 1 if the lists
4662 are known to be equal; otherwise return 0. */
4664 static bool
4665 simple_cst_list_equal (const_tree l1, const_tree l2)
4667 while (l1 != NULL_TREE && l2 != NULL_TREE)
4669 if (simple_cst_equal (TREE_VALUE (l1), TREE_VALUE (l2)) != 1)
4670 return false;
4672 l1 = TREE_CHAIN (l1);
4673 l2 = TREE_CHAIN (l2);
4676 return l1 == l2;
4679 /* Compare two attributes for their value identity. Return true if the
4680 attribute values are known to be equal; otherwise return false.
4683 static bool
4684 attribute_value_equal (const_tree attr1, const_tree attr2)
4686 if (TREE_VALUE (attr1) == TREE_VALUE (attr2))
4687 return true;
4689 if (TREE_VALUE (attr1) != NULL_TREE
4690 && TREE_CODE (TREE_VALUE (attr1)) == TREE_LIST
4691 && TREE_VALUE (attr2) != NULL
4692 && TREE_CODE (TREE_VALUE (attr2)) == TREE_LIST)
4693 return (simple_cst_list_equal (TREE_VALUE (attr1),
4694 TREE_VALUE (attr2)) == 1);
4696 if ((flag_openmp || flag_openmp_simd)
4697 && TREE_VALUE (attr1) && TREE_VALUE (attr2)
4698 && TREE_CODE (TREE_VALUE (attr1)) == OMP_CLAUSE
4699 && TREE_CODE (TREE_VALUE (attr2)) == OMP_CLAUSE)
4700 return omp_declare_simd_clauses_equal (TREE_VALUE (attr1),
4701 TREE_VALUE (attr2));
4703 return (simple_cst_equal (TREE_VALUE (attr1), TREE_VALUE (attr2)) == 1);
4706 /* Return 0 if the attributes for two types are incompatible, 1 if they
4707 are compatible, and 2 if they are nearly compatible (which causes a
4708 warning to be generated). */
4710 comp_type_attributes (const_tree type1, const_tree type2)
4712 const_tree a1 = TYPE_ATTRIBUTES (type1);
4713 const_tree a2 = TYPE_ATTRIBUTES (type2);
4714 const_tree a;
4716 if (a1 == a2)
4717 return 1;
4718 for (a = a1; a != NULL_TREE; a = TREE_CHAIN (a))
4720 const struct attribute_spec *as;
4721 const_tree attr;
4723 as = lookup_attribute_spec (get_attribute_name (a));
4724 if (!as || as->affects_type_identity == false)
4725 continue;
4727 attr = lookup_attribute (as->name, CONST_CAST_TREE (a2));
4728 if (!attr || !attribute_value_equal (a, attr))
4729 break;
4731 if (!a)
4733 for (a = a2; a != NULL_TREE; a = TREE_CHAIN (a))
4735 const struct attribute_spec *as;
4737 as = lookup_attribute_spec (get_attribute_name (a));
4738 if (!as || as->affects_type_identity == false)
4739 continue;
4741 if (!lookup_attribute (as->name, CONST_CAST_TREE (a1)))
4742 break;
4743 /* We don't need to compare trees again, as we did this
4744 already in first loop. */
4746 /* All types - affecting identity - are equal, so
4747 there is no need to call target hook for comparison. */
4748 if (!a)
4749 return 1;
4751 /* As some type combinations - like default calling-convention - might
4752 be compatible, we have to call the target hook to get the final result. */
4753 return targetm.comp_type_attributes (type1, type2);
4756 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4757 is ATTRIBUTE.
4759 Record such modified types already made so we don't make duplicates. */
4761 tree
4762 build_type_attribute_variant (tree ttype, tree attribute)
4764 return build_type_attribute_qual_variant (ttype, attribute,
4765 TYPE_QUALS (ttype));
4769 /* Reset the expression *EXPR_P, a size or position.
4771 ??? We could reset all non-constant sizes or positions. But it's cheap
4772 enough to not do so and refrain from adding workarounds to dwarf2out.c.
4774 We need to reset self-referential sizes or positions because they cannot
4775 be gimplified and thus can contain a CALL_EXPR after the gimplification
4776 is finished, which will run afoul of LTO streaming. And they need to be
4777 reset to something essentially dummy but not constant, so as to preserve
4778 the properties of the object they are attached to. */
4780 static inline void
4781 free_lang_data_in_one_sizepos (tree *expr_p)
4783 tree expr = *expr_p;
4784 if (CONTAINS_PLACEHOLDER_P (expr))
4785 *expr_p = build0 (PLACEHOLDER_EXPR, TREE_TYPE (expr));
4789 /* Reset all the fields in a binfo node BINFO. We only keep
4790 BINFO_VTABLE, which is used by gimple_fold_obj_type_ref. */
4792 static void
4793 free_lang_data_in_binfo (tree binfo)
4795 unsigned i;
4796 tree t;
4798 gcc_assert (TREE_CODE (binfo) == TREE_BINFO);
4800 BINFO_VIRTUALS (binfo) = NULL_TREE;
4801 BINFO_BASE_ACCESSES (binfo) = NULL;
4802 BINFO_INHERITANCE_CHAIN (binfo) = NULL_TREE;
4803 BINFO_SUBVTT_INDEX (binfo) = NULL_TREE;
4805 FOR_EACH_VEC_ELT (*BINFO_BASE_BINFOS (binfo), i, t)
4806 free_lang_data_in_binfo (t);
4810 /* Reset all language specific information still present in TYPE. */
4812 static void
4813 free_lang_data_in_type (tree type)
4815 gcc_assert (TYPE_P (type));
4817 /* Give the FE a chance to remove its own data first. */
4818 lang_hooks.free_lang_data (type);
4820 TREE_LANG_FLAG_0 (type) = 0;
4821 TREE_LANG_FLAG_1 (type) = 0;
4822 TREE_LANG_FLAG_2 (type) = 0;
4823 TREE_LANG_FLAG_3 (type) = 0;
4824 TREE_LANG_FLAG_4 (type) = 0;
4825 TREE_LANG_FLAG_5 (type) = 0;
4826 TREE_LANG_FLAG_6 (type) = 0;
4828 if (TREE_CODE (type) == FUNCTION_TYPE)
4830 /* Remove the const and volatile qualifiers from arguments. The
4831 C++ front end removes them, but the C front end does not,
4832 leading to false ODR violation errors when merging two
4833 instances of the same function signature compiled by
4834 different front ends. */
4835 tree p;
4837 for (p = TYPE_ARG_TYPES (type); p; p = TREE_CHAIN (p))
4839 tree arg_type = TREE_VALUE (p);
4841 if (TYPE_READONLY (arg_type) || TYPE_VOLATILE (arg_type))
4843 int quals = TYPE_QUALS (arg_type)
4844 & ~TYPE_QUAL_CONST
4845 & ~TYPE_QUAL_VOLATILE;
4846 TREE_VALUE (p) = build_qualified_type (arg_type, quals);
4847 free_lang_data_in_type (TREE_VALUE (p));
4852 /* Remove members that are not actually FIELD_DECLs from the field
4853 list of an aggregate. These occur in C++. */
4854 if (RECORD_OR_UNION_TYPE_P (type))
4856 tree prev, member;
4858 /* Note that TYPE_FIELDS can be shared across distinct
4859 TREE_TYPEs. Therefore, if the first field of TYPE_FIELDS is
4860 to be removed, we cannot set its TREE_CHAIN to NULL.
4861 Otherwise, we would not be able to find all the other fields
4862 in the other instances of this TREE_TYPE.
4864 This was causing an ICE in testsuite/g++.dg/lto/20080915.C. */
4865 prev = NULL_TREE;
4866 member = TYPE_FIELDS (type);
4867 while (member)
4869 if (TREE_CODE (member) == FIELD_DECL
4870 || TREE_CODE (member) == TYPE_DECL)
4872 if (prev)
4873 TREE_CHAIN (prev) = member;
4874 else
4875 TYPE_FIELDS (type) = member;
4876 prev = member;
4879 member = TREE_CHAIN (member);
4882 if (prev)
4883 TREE_CHAIN (prev) = NULL_TREE;
4884 else
4885 TYPE_FIELDS (type) = NULL_TREE;
4887 TYPE_METHODS (type) = NULL_TREE;
4888 if (TYPE_BINFO (type))
4889 free_lang_data_in_binfo (TYPE_BINFO (type));
4891 else
4893 /* For non-aggregate types, clear out the language slot (which
4894 overloads TYPE_BINFO). */
4895 TYPE_LANG_SLOT_1 (type) = NULL_TREE;
4897 if (INTEGRAL_TYPE_P (type)
4898 || SCALAR_FLOAT_TYPE_P (type)
4899 || FIXED_POINT_TYPE_P (type))
4901 free_lang_data_in_one_sizepos (&TYPE_MIN_VALUE (type));
4902 free_lang_data_in_one_sizepos (&TYPE_MAX_VALUE (type));
4906 free_lang_data_in_one_sizepos (&TYPE_SIZE (type));
4907 free_lang_data_in_one_sizepos (&TYPE_SIZE_UNIT (type));
4909 if (TYPE_CONTEXT (type)
4910 && TREE_CODE (TYPE_CONTEXT (type)) == BLOCK)
4912 tree ctx = TYPE_CONTEXT (type);
4915 ctx = BLOCK_SUPERCONTEXT (ctx);
4917 while (ctx && TREE_CODE (ctx) == BLOCK);
4918 TYPE_CONTEXT (type) = ctx;
4923 /* Return true if DECL may need an assembler name to be set. */
4925 static inline bool
4926 need_assembler_name_p (tree decl)
4928 /* Only FUNCTION_DECLs and VAR_DECLs are considered. */
4929 if (TREE_CODE (decl) != FUNCTION_DECL
4930 && TREE_CODE (decl) != VAR_DECL)
4931 return false;
4933 /* If DECL already has its assembler name set, it does not need a
4934 new one. */
4935 if (!HAS_DECL_ASSEMBLER_NAME_P (decl)
4936 || DECL_ASSEMBLER_NAME_SET_P (decl))
4937 return false;
4939 /* Abstract decls do not need an assembler name. */
4940 if (DECL_ABSTRACT (decl))
4941 return false;
4943 /* For VAR_DECLs, only static, public and external symbols need an
4944 assembler name. */
4945 if (TREE_CODE (decl) == VAR_DECL
4946 && !TREE_STATIC (decl)
4947 && !TREE_PUBLIC (decl)
4948 && !DECL_EXTERNAL (decl))
4949 return false;
4951 if (TREE_CODE (decl) == FUNCTION_DECL)
4953 /* Do not set assembler name on builtins. Allow RTL expansion to
4954 decide whether to expand inline or via a regular call. */
4955 if (DECL_BUILT_IN (decl)
4956 && DECL_BUILT_IN_CLASS (decl) != BUILT_IN_FRONTEND)
4957 return false;
4959 /* Functions represented in the callgraph need an assembler name. */
4960 if (cgraph_get_node (decl) != NULL)
4961 return true;
4963 /* Unused and not public functions don't need an assembler name. */
4964 if (!TREE_USED (decl) && !TREE_PUBLIC (decl))
4965 return false;
4968 return true;
4972 /* Reset all language specific information still present in symbol
4973 DECL. */
4975 static void
4976 free_lang_data_in_decl (tree decl)
4978 gcc_assert (DECL_P (decl));
4980 /* Give the FE a chance to remove its own data first. */
4981 lang_hooks.free_lang_data (decl);
4983 TREE_LANG_FLAG_0 (decl) = 0;
4984 TREE_LANG_FLAG_1 (decl) = 0;
4985 TREE_LANG_FLAG_2 (decl) = 0;
4986 TREE_LANG_FLAG_3 (decl) = 0;
4987 TREE_LANG_FLAG_4 (decl) = 0;
4988 TREE_LANG_FLAG_5 (decl) = 0;
4989 TREE_LANG_FLAG_6 (decl) = 0;
4991 free_lang_data_in_one_sizepos (&DECL_SIZE (decl));
4992 free_lang_data_in_one_sizepos (&DECL_SIZE_UNIT (decl));
4993 if (TREE_CODE (decl) == FIELD_DECL)
4995 free_lang_data_in_one_sizepos (&DECL_FIELD_OFFSET (decl));
4996 if (TREE_CODE (DECL_CONTEXT (decl)) == QUAL_UNION_TYPE)
4997 DECL_QUALIFIER (decl) = NULL_TREE;
5000 if (TREE_CODE (decl) == FUNCTION_DECL)
5002 struct cgraph_node *node;
5003 if (!(node = cgraph_get_node (decl))
5004 || (!node->definition && !node->clones))
5006 if (node)
5007 cgraph_release_function_body (node);
5008 else
5010 release_function_body (decl);
5011 DECL_ARGUMENTS (decl) = NULL;
5012 DECL_RESULT (decl) = NULL;
5013 DECL_INITIAL (decl) = error_mark_node;
5016 if (gimple_has_body_p (decl))
5018 tree t;
5020 /* If DECL has a gimple body, then the context for its
5021 arguments must be DECL. Otherwise, it doesn't really
5022 matter, as we will not be emitting any code for DECL. In
5023 general, there may be other instances of DECL created by
5024 the front end and since PARM_DECLs are generally shared,
5025 their DECL_CONTEXT changes as the replicas of DECL are
5026 created. The only time where DECL_CONTEXT is important
5027 is for the FUNCTION_DECLs that have a gimple body (since
5028 the PARM_DECL will be used in the function's body). */
5029 for (t = DECL_ARGUMENTS (decl); t; t = TREE_CHAIN (t))
5030 DECL_CONTEXT (t) = decl;
5033 /* DECL_SAVED_TREE holds the GENERIC representation for DECL.
5034 At this point, it is not needed anymore. */
5035 DECL_SAVED_TREE (decl) = NULL_TREE;
5037 /* Clear the abstract origin if it refers to a method. Otherwise
5038 dwarf2out.c will ICE as we clear TYPE_METHODS and thus the
5039 origin will not be output correctly. */
5040 if (DECL_ABSTRACT_ORIGIN (decl)
5041 && DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl))
5042 && RECORD_OR_UNION_TYPE_P
5043 (DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl))))
5044 DECL_ABSTRACT_ORIGIN (decl) = NULL_TREE;
5046 /* Sometimes the C++ frontend doesn't manage to transform a temporary
5047 DECL_VINDEX referring to itself into a vtable slot number as it
5048 should. Happens with functions that are copied and then forgotten
5049 about. Just clear it, it won't matter anymore. */
5050 if (DECL_VINDEX (decl) && !tree_fits_shwi_p (DECL_VINDEX (decl)))
5051 DECL_VINDEX (decl) = NULL_TREE;
5053 else if (TREE_CODE (decl) == VAR_DECL)
5055 if ((DECL_EXTERNAL (decl)
5056 && (!TREE_STATIC (decl) || !TREE_READONLY (decl)))
5057 || (decl_function_context (decl) && !TREE_STATIC (decl)))
5058 DECL_INITIAL (decl) = NULL_TREE;
5060 else if (TREE_CODE (decl) == TYPE_DECL
5061 || TREE_CODE (decl) == FIELD_DECL)
5062 DECL_INITIAL (decl) = NULL_TREE;
5063 else if (TREE_CODE (decl) == TRANSLATION_UNIT_DECL
5064 && DECL_INITIAL (decl)
5065 && TREE_CODE (DECL_INITIAL (decl)) == BLOCK)
5067 /* Strip builtins from the translation-unit BLOCK. We still have targets
5068 without builtin_decl_explicit support and also builtins are shared
5069 nodes and thus we can't use TREE_CHAIN in multiple lists. */
5070 tree *nextp = &BLOCK_VARS (DECL_INITIAL (decl));
5071 while (*nextp)
5073 tree var = *nextp;
5074 if (TREE_CODE (var) == FUNCTION_DECL
5075 && DECL_BUILT_IN (var))
5076 *nextp = TREE_CHAIN (var);
5077 else
5078 nextp = &TREE_CHAIN (var);
5084 /* Data used when collecting DECLs and TYPEs for language data removal. */
5086 struct free_lang_data_d
5088 /* Worklist to avoid excessive recursion. */
5089 vec<tree> worklist;
5091 /* Set of traversed objects. Used to avoid duplicate visits. */
5092 struct pointer_set_t *pset;
5094 /* Array of symbols to process with free_lang_data_in_decl. */
5095 vec<tree> decls;
5097 /* Array of types to process with free_lang_data_in_type. */
5098 vec<tree> types;
5102 /* Save all language fields needed to generate proper debug information
5103 for DECL. This saves most fields cleared out by free_lang_data_in_decl. */
5105 static void
5106 save_debug_info_for_decl (tree t)
5108 /*struct saved_debug_info_d *sdi;*/
5110 gcc_assert (debug_info_level > DINFO_LEVEL_TERSE && t && DECL_P (t));
5112 /* FIXME. Partial implementation for saving debug info removed. */
5116 /* Save all language fields needed to generate proper debug information
5117 for TYPE. This saves most fields cleared out by free_lang_data_in_type. */
5119 static void
5120 save_debug_info_for_type (tree t)
5122 /*struct saved_debug_info_d *sdi;*/
5124 gcc_assert (debug_info_level > DINFO_LEVEL_TERSE && t && TYPE_P (t));
5126 /* FIXME. Partial implementation for saving debug info removed. */
5130 /* Add type or decl T to one of the list of tree nodes that need their
5131 language data removed. The lists are held inside FLD. */
5133 static void
5134 add_tree_to_fld_list (tree t, struct free_lang_data_d *fld)
5136 if (DECL_P (t))
5138 fld->decls.safe_push (t);
5139 if (debug_info_level > DINFO_LEVEL_TERSE)
5140 save_debug_info_for_decl (t);
5142 else if (TYPE_P (t))
5144 fld->types.safe_push (t);
5145 if (debug_info_level > DINFO_LEVEL_TERSE)
5146 save_debug_info_for_type (t);
5148 else
5149 gcc_unreachable ();
5152 /* Push tree node T into FLD->WORKLIST. */
5154 static inline void
5155 fld_worklist_push (tree t, struct free_lang_data_d *fld)
5157 if (t && !is_lang_specific (t) && !pointer_set_contains (fld->pset, t))
5158 fld->worklist.safe_push ((t));
5162 /* Operand callback helper for free_lang_data_in_node. *TP is the
5163 subtree operand being considered. */
5165 static tree
5166 find_decls_types_r (tree *tp, int *ws, void *data)
5168 tree t = *tp;
5169 struct free_lang_data_d *fld = (struct free_lang_data_d *) data;
5171 if (TREE_CODE (t) == TREE_LIST)
5172 return NULL_TREE;
5174 /* Language specific nodes will be removed, so there is no need
5175 to gather anything under them. */
5176 if (is_lang_specific (t))
5178 *ws = 0;
5179 return NULL_TREE;
5182 if (DECL_P (t))
5184 /* Note that walk_tree does not traverse every possible field in
5185 decls, so we have to do our own traversals here. */
5186 add_tree_to_fld_list (t, fld);
5188 fld_worklist_push (DECL_NAME (t), fld);
5189 fld_worklist_push (DECL_CONTEXT (t), fld);
5190 fld_worklist_push (DECL_SIZE (t), fld);
5191 fld_worklist_push (DECL_SIZE_UNIT (t), fld);
5193 /* We are going to remove everything under DECL_INITIAL for
5194 TYPE_DECLs. No point walking them. */
5195 if (TREE_CODE (t) != TYPE_DECL)
5196 fld_worklist_push (DECL_INITIAL (t), fld);
5198 fld_worklist_push (DECL_ATTRIBUTES (t), fld);
5199 fld_worklist_push (DECL_ABSTRACT_ORIGIN (t), fld);
5201 if (TREE_CODE (t) == FUNCTION_DECL)
5203 fld_worklist_push (DECL_ARGUMENTS (t), fld);
5204 fld_worklist_push (DECL_RESULT (t), fld);
5206 else if (TREE_CODE (t) == TYPE_DECL)
5208 fld_worklist_push (DECL_ARGUMENT_FLD (t), fld);
5209 fld_worklist_push (DECL_VINDEX (t), fld);
5210 fld_worklist_push (DECL_ORIGINAL_TYPE (t), fld);
5212 else if (TREE_CODE (t) == FIELD_DECL)
5214 fld_worklist_push (DECL_FIELD_OFFSET (t), fld);
5215 fld_worklist_push (DECL_BIT_FIELD_TYPE (t), fld);
5216 fld_worklist_push (DECL_FIELD_BIT_OFFSET (t), fld);
5217 fld_worklist_push (DECL_FCONTEXT (t), fld);
5219 else if (TREE_CODE (t) == VAR_DECL)
5221 fld_worklist_push (DECL_SECTION_NAME (t), fld);
5222 fld_worklist_push (DECL_COMDAT_GROUP (t), fld);
5225 if ((TREE_CODE (t) == VAR_DECL || TREE_CODE (t) == PARM_DECL)
5226 && DECL_HAS_VALUE_EXPR_P (t))
5227 fld_worklist_push (DECL_VALUE_EXPR (t), fld);
5229 if (TREE_CODE (t) != FIELD_DECL
5230 && TREE_CODE (t) != TYPE_DECL)
5231 fld_worklist_push (TREE_CHAIN (t), fld);
5232 *ws = 0;
5234 else if (TYPE_P (t))
5236 /* Note that walk_tree does not traverse every possible field in
5237 types, so we have to do our own traversals here. */
5238 add_tree_to_fld_list (t, fld);
5240 if (!RECORD_OR_UNION_TYPE_P (t))
5241 fld_worklist_push (TYPE_CACHED_VALUES (t), fld);
5242 fld_worklist_push (TYPE_SIZE (t), fld);
5243 fld_worklist_push (TYPE_SIZE_UNIT (t), fld);
5244 fld_worklist_push (TYPE_ATTRIBUTES (t), fld);
5245 fld_worklist_push (TYPE_POINTER_TO (t), fld);
5246 fld_worklist_push (TYPE_REFERENCE_TO (t), fld);
5247 fld_worklist_push (TYPE_NAME (t), fld);
5248 /* Do not walk TYPE_NEXT_PTR_TO or TYPE_NEXT_REF_TO. We do not stream
5249 them and thus do not and want not to reach unused pointer types
5250 this way. */
5251 if (!POINTER_TYPE_P (t))
5252 fld_worklist_push (TYPE_MINVAL (t), fld);
5253 if (!RECORD_OR_UNION_TYPE_P (t))
5254 fld_worklist_push (TYPE_MAXVAL (t), fld);
5255 fld_worklist_push (TYPE_MAIN_VARIANT (t), fld);
5256 /* Do not walk TYPE_NEXT_VARIANT. We do not stream it and thus
5257 do not and want not to reach unused variants this way. */
5258 if (TYPE_CONTEXT (t))
5260 tree ctx = TYPE_CONTEXT (t);
5261 /* We adjust BLOCK TYPE_CONTEXTs to the innermost non-BLOCK one.
5262 So push that instead. */
5263 while (ctx && TREE_CODE (ctx) == BLOCK)
5264 ctx = BLOCK_SUPERCONTEXT (ctx);
5265 fld_worklist_push (ctx, fld);
5267 /* Do not walk TYPE_CANONICAL. We do not stream it and thus do not
5268 and want not to reach unused types this way. */
5270 if (RECORD_OR_UNION_TYPE_P (t) && TYPE_BINFO (t))
5272 unsigned i;
5273 tree tem;
5274 FOR_EACH_VEC_ELT (*BINFO_BASE_BINFOS (TYPE_BINFO (t)), i, tem)
5275 fld_worklist_push (TREE_TYPE (tem), fld);
5276 tem = BINFO_VIRTUALS (TYPE_BINFO (t));
5277 if (tem
5278 /* The Java FE overloads BINFO_VIRTUALS for its own purpose. */
5279 && TREE_CODE (tem) == TREE_LIST)
5282 fld_worklist_push (TREE_VALUE (tem), fld);
5283 tem = TREE_CHAIN (tem);
5285 while (tem);
5287 if (RECORD_OR_UNION_TYPE_P (t))
5289 tree tem;
5290 /* Push all TYPE_FIELDS - there can be interleaving interesting
5291 and non-interesting things. */
5292 tem = TYPE_FIELDS (t);
5293 while (tem)
5295 if (TREE_CODE (tem) == FIELD_DECL
5296 || TREE_CODE (tem) == TYPE_DECL)
5297 fld_worklist_push (tem, fld);
5298 tem = TREE_CHAIN (tem);
5302 fld_worklist_push (TYPE_STUB_DECL (t), fld);
5303 *ws = 0;
5305 else if (TREE_CODE (t) == BLOCK)
5307 tree tem;
5308 for (tem = BLOCK_VARS (t); tem; tem = TREE_CHAIN (tem))
5309 fld_worklist_push (tem, fld);
5310 for (tem = BLOCK_SUBBLOCKS (t); tem; tem = BLOCK_CHAIN (tem))
5311 fld_worklist_push (tem, fld);
5312 fld_worklist_push (BLOCK_ABSTRACT_ORIGIN (t), fld);
5315 if (TREE_CODE (t) != IDENTIFIER_NODE
5316 && CODE_CONTAINS_STRUCT (TREE_CODE (t), TS_TYPED))
5317 fld_worklist_push (TREE_TYPE (t), fld);
5319 return NULL_TREE;
5323 /* Find decls and types in T. */
5325 static void
5326 find_decls_types (tree t, struct free_lang_data_d *fld)
5328 while (1)
5330 if (!pointer_set_contains (fld->pset, t))
5331 walk_tree (&t, find_decls_types_r, fld, fld->pset);
5332 if (fld->worklist.is_empty ())
5333 break;
5334 t = fld->worklist.pop ();
5338 /* Translate all the types in LIST with the corresponding runtime
5339 types. */
5341 static tree
5342 get_eh_types_for_runtime (tree list)
5344 tree head, prev;
5346 if (list == NULL_TREE)
5347 return NULL_TREE;
5349 head = build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list)));
5350 prev = head;
5351 list = TREE_CHAIN (list);
5352 while (list)
5354 tree n = build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list)));
5355 TREE_CHAIN (prev) = n;
5356 prev = TREE_CHAIN (prev);
5357 list = TREE_CHAIN (list);
5360 return head;
5364 /* Find decls and types referenced in EH region R and store them in
5365 FLD->DECLS and FLD->TYPES. */
5367 static void
5368 find_decls_types_in_eh_region (eh_region r, struct free_lang_data_d *fld)
5370 switch (r->type)
5372 case ERT_CLEANUP:
5373 break;
5375 case ERT_TRY:
5377 eh_catch c;
5379 /* The types referenced in each catch must first be changed to the
5380 EH types used at runtime. This removes references to FE types
5381 in the region. */
5382 for (c = r->u.eh_try.first_catch; c ; c = c->next_catch)
5384 c->type_list = get_eh_types_for_runtime (c->type_list);
5385 walk_tree (&c->type_list, find_decls_types_r, fld, fld->pset);
5388 break;
5390 case ERT_ALLOWED_EXCEPTIONS:
5391 r->u.allowed.type_list
5392 = get_eh_types_for_runtime (r->u.allowed.type_list);
5393 walk_tree (&r->u.allowed.type_list, find_decls_types_r, fld, fld->pset);
5394 break;
5396 case ERT_MUST_NOT_THROW:
5397 walk_tree (&r->u.must_not_throw.failure_decl,
5398 find_decls_types_r, fld, fld->pset);
5399 break;
5404 /* Find decls and types referenced in cgraph node N and store them in
5405 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
5406 look for *every* kind of DECL and TYPE node reachable from N,
5407 including those embedded inside types and decls (i.e,, TYPE_DECLs,
5408 NAMESPACE_DECLs, etc). */
5410 static void
5411 find_decls_types_in_node (struct cgraph_node *n, struct free_lang_data_d *fld)
5413 basic_block bb;
5414 struct function *fn;
5415 unsigned ix;
5416 tree t;
5418 find_decls_types (n->decl, fld);
5420 if (!gimple_has_body_p (n->decl))
5421 return;
5423 gcc_assert (current_function_decl == NULL_TREE && cfun == NULL);
5425 fn = DECL_STRUCT_FUNCTION (n->decl);
5427 /* Traverse locals. */
5428 FOR_EACH_LOCAL_DECL (fn, ix, t)
5429 find_decls_types (t, fld);
5431 /* Traverse EH regions in FN. */
5433 eh_region r;
5434 FOR_ALL_EH_REGION_FN (r, fn)
5435 find_decls_types_in_eh_region (r, fld);
5438 /* Traverse every statement in FN. */
5439 FOR_EACH_BB_FN (bb, fn)
5441 gimple_stmt_iterator si;
5442 unsigned i;
5444 for (si = gsi_start_phis (bb); !gsi_end_p (si); gsi_next (&si))
5446 gimple phi = gsi_stmt (si);
5448 for (i = 0; i < gimple_phi_num_args (phi); i++)
5450 tree *arg_p = gimple_phi_arg_def_ptr (phi, i);
5451 find_decls_types (*arg_p, fld);
5455 for (si = gsi_start_bb (bb); !gsi_end_p (si); gsi_next (&si))
5457 gimple stmt = gsi_stmt (si);
5459 if (is_gimple_call (stmt))
5460 find_decls_types (gimple_call_fntype (stmt), fld);
5462 for (i = 0; i < gimple_num_ops (stmt); i++)
5464 tree arg = gimple_op (stmt, i);
5465 find_decls_types (arg, fld);
5472 /* Find decls and types referenced in varpool node N and store them in
5473 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
5474 look for *every* kind of DECL and TYPE node reachable from N,
5475 including those embedded inside types and decls (i.e,, TYPE_DECLs,
5476 NAMESPACE_DECLs, etc). */
5478 static void
5479 find_decls_types_in_var (varpool_node *v, struct free_lang_data_d *fld)
5481 find_decls_types (v->decl, fld);
5484 /* If T needs an assembler name, have one created for it. */
5486 void
5487 assign_assembler_name_if_neeeded (tree t)
5489 if (need_assembler_name_p (t))
5491 /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit
5492 diagnostics that use input_location to show locus
5493 information. The problem here is that, at this point,
5494 input_location is generally anchored to the end of the file
5495 (since the parser is long gone), so we don't have a good
5496 position to pin it to.
5498 To alleviate this problem, this uses the location of T's
5499 declaration. Examples of this are
5500 testsuite/g++.dg/template/cond2.C and
5501 testsuite/g++.dg/template/pr35240.C. */
5502 location_t saved_location = input_location;
5503 input_location = DECL_SOURCE_LOCATION (t);
5505 decl_assembler_name (t);
5507 input_location = saved_location;
5512 /* Free language specific information for every operand and expression
5513 in every node of the call graph. This process operates in three stages:
5515 1- Every callgraph node and varpool node is traversed looking for
5516 decls and types embedded in them. This is a more exhaustive
5517 search than that done by find_referenced_vars, because it will
5518 also collect individual fields, decls embedded in types, etc.
5520 2- All the decls found are sent to free_lang_data_in_decl.
5522 3- All the types found are sent to free_lang_data_in_type.
5524 The ordering between decls and types is important because
5525 free_lang_data_in_decl sets assembler names, which includes
5526 mangling. So types cannot be freed up until assembler names have
5527 been set up. */
5529 static void
5530 free_lang_data_in_cgraph (void)
5532 struct cgraph_node *n;
5533 varpool_node *v;
5534 struct free_lang_data_d fld;
5535 tree t;
5536 unsigned i;
5537 alias_pair *p;
5539 /* Initialize sets and arrays to store referenced decls and types. */
5540 fld.pset = pointer_set_create ();
5541 fld.worklist.create (0);
5542 fld.decls.create (100);
5543 fld.types.create (100);
5545 /* Find decls and types in the body of every function in the callgraph. */
5546 FOR_EACH_FUNCTION (n)
5547 find_decls_types_in_node (n, &fld);
5549 FOR_EACH_VEC_SAFE_ELT (alias_pairs, i, p)
5550 find_decls_types (p->decl, &fld);
5552 /* Find decls and types in every varpool symbol. */
5553 FOR_EACH_VARIABLE (v)
5554 find_decls_types_in_var (v, &fld);
5556 /* Set the assembler name on every decl found. We need to do this
5557 now because free_lang_data_in_decl will invalidate data needed
5558 for mangling. This breaks mangling on interdependent decls. */
5559 FOR_EACH_VEC_ELT (fld.decls, i, t)
5560 assign_assembler_name_if_neeeded (t);
5562 /* Traverse every decl found freeing its language data. */
5563 FOR_EACH_VEC_ELT (fld.decls, i, t)
5564 free_lang_data_in_decl (t);
5566 /* Traverse every type found freeing its language data. */
5567 FOR_EACH_VEC_ELT (fld.types, i, t)
5568 free_lang_data_in_type (t);
5570 pointer_set_destroy (fld.pset);
5571 fld.worklist.release ();
5572 fld.decls.release ();
5573 fld.types.release ();
5577 /* Free resources that are used by FE but are not needed once they are done. */
5579 static unsigned
5580 free_lang_data (void)
5582 unsigned i;
5584 /* If we are the LTO frontend we have freed lang-specific data already. */
5585 if (in_lto_p
5586 || !flag_generate_lto)
5587 return 0;
5589 /* Allocate and assign alias sets to the standard integer types
5590 while the slots are still in the way the frontends generated them. */
5591 for (i = 0; i < itk_none; ++i)
5592 if (integer_types[i])
5593 TYPE_ALIAS_SET (integer_types[i]) = get_alias_set (integer_types[i]);
5595 /* Traverse the IL resetting language specific information for
5596 operands, expressions, etc. */
5597 free_lang_data_in_cgraph ();
5599 /* Create gimple variants for common types. */
5600 ptrdiff_type_node = integer_type_node;
5601 fileptr_type_node = ptr_type_node;
5603 /* Reset some langhooks. Do not reset types_compatible_p, it may
5604 still be used indirectly via the get_alias_set langhook. */
5605 lang_hooks.dwarf_name = lhd_dwarf_name;
5606 lang_hooks.decl_printable_name = gimple_decl_printable_name;
5607 /* We do not want the default decl_assembler_name implementation,
5608 rather if we have fixed everything we want a wrapper around it
5609 asserting that all non-local symbols already got their assembler
5610 name and only produce assembler names for local symbols. Or rather
5611 make sure we never call decl_assembler_name on local symbols and
5612 devise a separate, middle-end private scheme for it. */
5614 /* Reset diagnostic machinery. */
5615 tree_diagnostics_defaults (global_dc);
5617 return 0;
5621 namespace {
5623 const pass_data pass_data_ipa_free_lang_data =
5625 SIMPLE_IPA_PASS, /* type */
5626 "*free_lang_data", /* name */
5627 OPTGROUP_NONE, /* optinfo_flags */
5628 false, /* has_gate */
5629 true, /* has_execute */
5630 TV_IPA_FREE_LANG_DATA, /* tv_id */
5631 0, /* properties_required */
5632 0, /* properties_provided */
5633 0, /* properties_destroyed */
5634 0, /* todo_flags_start */
5635 0, /* todo_flags_finish */
5638 class pass_ipa_free_lang_data : public simple_ipa_opt_pass
5640 public:
5641 pass_ipa_free_lang_data (gcc::context *ctxt)
5642 : simple_ipa_opt_pass (pass_data_ipa_free_lang_data, ctxt)
5645 /* opt_pass methods: */
5646 unsigned int execute () { return free_lang_data (); }
5648 }; // class pass_ipa_free_lang_data
5650 } // anon namespace
5652 simple_ipa_opt_pass *
5653 make_pass_ipa_free_lang_data (gcc::context *ctxt)
5655 return new pass_ipa_free_lang_data (ctxt);
5658 /* The backbone of is_attribute_p(). ATTR_LEN is the string length of
5659 ATTR_NAME. Also used internally by remove_attribute(). */
5660 bool
5661 private_is_attribute_p (const char *attr_name, size_t attr_len, const_tree ident)
5663 size_t ident_len = IDENTIFIER_LENGTH (ident);
5665 if (ident_len == attr_len)
5667 if (strcmp (attr_name, IDENTIFIER_POINTER (ident)) == 0)
5668 return true;
5670 else if (ident_len == attr_len + 4)
5672 /* There is the possibility that ATTR is 'text' and IDENT is
5673 '__text__'. */
5674 const char *p = IDENTIFIER_POINTER (ident);
5675 if (p[0] == '_' && p[1] == '_'
5676 && p[ident_len - 2] == '_' && p[ident_len - 1] == '_'
5677 && strncmp (attr_name, p + 2, attr_len) == 0)
5678 return true;
5681 return false;
5684 /* The backbone of lookup_attribute(). ATTR_LEN is the string length
5685 of ATTR_NAME, and LIST is not NULL_TREE. */
5686 tree
5687 private_lookup_attribute (const char *attr_name, size_t attr_len, tree list)
5689 while (list)
5691 size_t ident_len = IDENTIFIER_LENGTH (get_attribute_name (list));
5693 if (ident_len == attr_len)
5695 if (!strcmp (attr_name,
5696 IDENTIFIER_POINTER (get_attribute_name (list))))
5697 break;
5699 /* TODO: If we made sure that attributes were stored in the
5700 canonical form without '__...__' (ie, as in 'text' as opposed
5701 to '__text__') then we could avoid the following case. */
5702 else if (ident_len == attr_len + 4)
5704 const char *p = IDENTIFIER_POINTER (get_attribute_name (list));
5705 if (p[0] == '_' && p[1] == '_'
5706 && p[ident_len - 2] == '_' && p[ident_len - 1] == '_'
5707 && strncmp (attr_name, p + 2, attr_len) == 0)
5708 break;
5710 list = TREE_CHAIN (list);
5713 return list;
5716 /* A variant of lookup_attribute() that can be used with an identifier
5717 as the first argument, and where the identifier can be either
5718 'text' or '__text__'.
5720 Given an attribute ATTR_IDENTIFIER, and a list of attributes LIST,
5721 return a pointer to the attribute's list element if the attribute
5722 is part of the list, or NULL_TREE if not found. If the attribute
5723 appears more than once, this only returns the first occurrence; the
5724 TREE_CHAIN of the return value should be passed back in if further
5725 occurrences are wanted. ATTR_IDENTIFIER must be an identifier but
5726 can be in the form 'text' or '__text__'. */
5727 static tree
5728 lookup_ident_attribute (tree attr_identifier, tree list)
5730 gcc_checking_assert (TREE_CODE (attr_identifier) == IDENTIFIER_NODE);
5732 while (list)
5734 gcc_checking_assert (TREE_CODE (get_attribute_name (list))
5735 == IDENTIFIER_NODE);
5737 /* Identifiers can be compared directly for equality. */
5738 if (attr_identifier == get_attribute_name (list))
5739 break;
5741 /* If they are not equal, they may still be one in the form
5742 'text' while the other one is in the form '__text__'. TODO:
5743 If we were storing attributes in normalized 'text' form, then
5744 this could all go away and we could take full advantage of
5745 the fact that we're comparing identifiers. :-) */
5747 size_t attr_len = IDENTIFIER_LENGTH (attr_identifier);
5748 size_t ident_len = IDENTIFIER_LENGTH (get_attribute_name (list));
5750 if (ident_len == attr_len + 4)
5752 const char *p = IDENTIFIER_POINTER (get_attribute_name (list));
5753 const char *q = IDENTIFIER_POINTER (attr_identifier);
5754 if (p[0] == '_' && p[1] == '_'
5755 && p[ident_len - 2] == '_' && p[ident_len - 1] == '_'
5756 && strncmp (q, p + 2, attr_len) == 0)
5757 break;
5759 else if (ident_len + 4 == attr_len)
5761 const char *p = IDENTIFIER_POINTER (get_attribute_name (list));
5762 const char *q = IDENTIFIER_POINTER (attr_identifier);
5763 if (q[0] == '_' && q[1] == '_'
5764 && q[attr_len - 2] == '_' && q[attr_len - 1] == '_'
5765 && strncmp (q + 2, p, ident_len) == 0)
5766 break;
5769 list = TREE_CHAIN (list);
5772 return list;
5775 /* Remove any instances of attribute ATTR_NAME in LIST and return the
5776 modified list. */
5778 tree
5779 remove_attribute (const char *attr_name, tree list)
5781 tree *p;
5782 size_t attr_len = strlen (attr_name);
5784 gcc_checking_assert (attr_name[0] != '_');
5786 for (p = &list; *p; )
5788 tree l = *p;
5789 /* TODO: If we were storing attributes in normalized form, here
5790 we could use a simple strcmp(). */
5791 if (private_is_attribute_p (attr_name, attr_len, get_attribute_name (l)))
5792 *p = TREE_CHAIN (l);
5793 else
5794 p = &TREE_CHAIN (l);
5797 return list;
5800 /* Return an attribute list that is the union of a1 and a2. */
5802 tree
5803 merge_attributes (tree a1, tree a2)
5805 tree attributes;
5807 /* Either one unset? Take the set one. */
5809 if ((attributes = a1) == 0)
5810 attributes = a2;
5812 /* One that completely contains the other? Take it. */
5814 else if (a2 != 0 && ! attribute_list_contained (a1, a2))
5816 if (attribute_list_contained (a2, a1))
5817 attributes = a2;
5818 else
5820 /* Pick the longest list, and hang on the other list. */
5822 if (list_length (a1) < list_length (a2))
5823 attributes = a2, a2 = a1;
5825 for (; a2 != 0; a2 = TREE_CHAIN (a2))
5827 tree a;
5828 for (a = lookup_ident_attribute (get_attribute_name (a2),
5829 attributes);
5830 a != NULL_TREE && !attribute_value_equal (a, a2);
5831 a = lookup_ident_attribute (get_attribute_name (a2),
5832 TREE_CHAIN (a)))
5834 if (a == NULL_TREE)
5836 a1 = copy_node (a2);
5837 TREE_CHAIN (a1) = attributes;
5838 attributes = a1;
5843 return attributes;
5846 /* Given types T1 and T2, merge their attributes and return
5847 the result. */
5849 tree
5850 merge_type_attributes (tree t1, tree t2)
5852 return merge_attributes (TYPE_ATTRIBUTES (t1),
5853 TYPE_ATTRIBUTES (t2));
5856 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
5857 the result. */
5859 tree
5860 merge_decl_attributes (tree olddecl, tree newdecl)
5862 return merge_attributes (DECL_ATTRIBUTES (olddecl),
5863 DECL_ATTRIBUTES (newdecl));
5866 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
5868 /* Specialization of merge_decl_attributes for various Windows targets.
5870 This handles the following situation:
5872 __declspec (dllimport) int foo;
5873 int foo;
5875 The second instance of `foo' nullifies the dllimport. */
5877 tree
5878 merge_dllimport_decl_attributes (tree old, tree new_tree)
5880 tree a;
5881 int delete_dllimport_p = 1;
5883 /* What we need to do here is remove from `old' dllimport if it doesn't
5884 appear in `new'. dllimport behaves like extern: if a declaration is
5885 marked dllimport and a definition appears later, then the object
5886 is not dllimport'd. We also remove a `new' dllimport if the old list
5887 contains dllexport: dllexport always overrides dllimport, regardless
5888 of the order of declaration. */
5889 if (!VAR_OR_FUNCTION_DECL_P (new_tree))
5890 delete_dllimport_p = 0;
5891 else if (DECL_DLLIMPORT_P (new_tree)
5892 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (old)))
5894 DECL_DLLIMPORT_P (new_tree) = 0;
5895 warning (OPT_Wattributes, "%q+D already declared with dllexport attribute: "
5896 "dllimport ignored", new_tree);
5898 else if (DECL_DLLIMPORT_P (old) && !DECL_DLLIMPORT_P (new_tree))
5900 /* Warn about overriding a symbol that has already been used, e.g.:
5901 extern int __attribute__ ((dllimport)) foo;
5902 int* bar () {return &foo;}
5903 int foo;
5905 if (TREE_USED (old))
5907 warning (0, "%q+D redeclared without dllimport attribute "
5908 "after being referenced with dll linkage", new_tree);
5909 /* If we have used a variable's address with dllimport linkage,
5910 keep the old DECL_DLLIMPORT_P flag: the ADDR_EXPR using the
5911 decl may already have had TREE_CONSTANT computed.
5912 We still remove the attribute so that assembler code refers
5913 to '&foo rather than '_imp__foo'. */
5914 if (TREE_CODE (old) == VAR_DECL && TREE_ADDRESSABLE (old))
5915 DECL_DLLIMPORT_P (new_tree) = 1;
5918 /* Let an inline definition silently override the external reference,
5919 but otherwise warn about attribute inconsistency. */
5920 else if (TREE_CODE (new_tree) == VAR_DECL
5921 || !DECL_DECLARED_INLINE_P (new_tree))
5922 warning (OPT_Wattributes, "%q+D redeclared without dllimport attribute: "
5923 "previous dllimport ignored", new_tree);
5925 else
5926 delete_dllimport_p = 0;
5928 a = merge_attributes (DECL_ATTRIBUTES (old), DECL_ATTRIBUTES (new_tree));
5930 if (delete_dllimport_p)
5931 a = remove_attribute ("dllimport", a);
5933 return a;
5936 /* Handle a "dllimport" or "dllexport" attribute; arguments as in
5937 struct attribute_spec.handler. */
5939 tree
5940 handle_dll_attribute (tree * pnode, tree name, tree args, int flags,
5941 bool *no_add_attrs)
5943 tree node = *pnode;
5944 bool is_dllimport;
5946 /* These attributes may apply to structure and union types being created,
5947 but otherwise should pass to the declaration involved. */
5948 if (!DECL_P (node))
5950 if (flags & ((int) ATTR_FLAG_DECL_NEXT | (int) ATTR_FLAG_FUNCTION_NEXT
5951 | (int) ATTR_FLAG_ARRAY_NEXT))
5953 *no_add_attrs = true;
5954 return tree_cons (name, args, NULL_TREE);
5956 if (TREE_CODE (node) == RECORD_TYPE
5957 || TREE_CODE (node) == UNION_TYPE)
5959 node = TYPE_NAME (node);
5960 if (!node)
5961 return NULL_TREE;
5963 else
5965 warning (OPT_Wattributes, "%qE attribute ignored",
5966 name);
5967 *no_add_attrs = true;
5968 return NULL_TREE;
5972 if (TREE_CODE (node) != FUNCTION_DECL
5973 && TREE_CODE (node) != VAR_DECL
5974 && TREE_CODE (node) != TYPE_DECL)
5976 *no_add_attrs = true;
5977 warning (OPT_Wattributes, "%qE attribute ignored",
5978 name);
5979 return NULL_TREE;
5982 if (TREE_CODE (node) == TYPE_DECL
5983 && TREE_CODE (TREE_TYPE (node)) != RECORD_TYPE
5984 && TREE_CODE (TREE_TYPE (node)) != UNION_TYPE)
5986 *no_add_attrs = true;
5987 warning (OPT_Wattributes, "%qE attribute ignored",
5988 name);
5989 return NULL_TREE;
5992 is_dllimport = is_attribute_p ("dllimport", name);
5994 /* Report error on dllimport ambiguities seen now before they cause
5995 any damage. */
5996 if (is_dllimport)
5998 /* Honor any target-specific overrides. */
5999 if (!targetm.valid_dllimport_attribute_p (node))
6000 *no_add_attrs = true;
6002 else if (TREE_CODE (node) == FUNCTION_DECL
6003 && DECL_DECLARED_INLINE_P (node))
6005 warning (OPT_Wattributes, "inline function %q+D declared as "
6006 " dllimport: attribute ignored", node);
6007 *no_add_attrs = true;
6009 /* Like MS, treat definition of dllimported variables and
6010 non-inlined functions on declaration as syntax errors. */
6011 else if (TREE_CODE (node) == FUNCTION_DECL && DECL_INITIAL (node))
6013 error ("function %q+D definition is marked dllimport", node);
6014 *no_add_attrs = true;
6017 else if (TREE_CODE (node) == VAR_DECL)
6019 if (DECL_INITIAL (node))
6021 error ("variable %q+D definition is marked dllimport",
6022 node);
6023 *no_add_attrs = true;
6026 /* `extern' needn't be specified with dllimport.
6027 Specify `extern' now and hope for the best. Sigh. */
6028 DECL_EXTERNAL (node) = 1;
6029 /* Also, implicitly give dllimport'd variables declared within
6030 a function global scope, unless declared static. */
6031 if (current_function_decl != NULL_TREE && !TREE_STATIC (node))
6032 TREE_PUBLIC (node) = 1;
6035 if (*no_add_attrs == false)
6036 DECL_DLLIMPORT_P (node) = 1;
6038 else if (TREE_CODE (node) == FUNCTION_DECL
6039 && DECL_DECLARED_INLINE_P (node)
6040 && flag_keep_inline_dllexport)
6041 /* An exported function, even if inline, must be emitted. */
6042 DECL_EXTERNAL (node) = 0;
6044 /* Report error if symbol is not accessible at global scope. */
6045 if (!TREE_PUBLIC (node)
6046 && (TREE_CODE (node) == VAR_DECL
6047 || TREE_CODE (node) == FUNCTION_DECL))
6049 error ("external linkage required for symbol %q+D because of "
6050 "%qE attribute", node, name);
6051 *no_add_attrs = true;
6054 /* A dllexport'd entity must have default visibility so that other
6055 program units (shared libraries or the main executable) can see
6056 it. A dllimport'd entity must have default visibility so that
6057 the linker knows that undefined references within this program
6058 unit can be resolved by the dynamic linker. */
6059 if (!*no_add_attrs)
6061 if (DECL_VISIBILITY_SPECIFIED (node)
6062 && DECL_VISIBILITY (node) != VISIBILITY_DEFAULT)
6063 error ("%qE implies default visibility, but %qD has already "
6064 "been declared with a different visibility",
6065 name, node);
6066 DECL_VISIBILITY (node) = VISIBILITY_DEFAULT;
6067 DECL_VISIBILITY_SPECIFIED (node) = 1;
6070 return NULL_TREE;
6073 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
6075 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
6076 of the various TYPE_QUAL values. */
6078 static void
6079 set_type_quals (tree type, int type_quals)
6081 TYPE_READONLY (type) = (type_quals & TYPE_QUAL_CONST) != 0;
6082 TYPE_VOLATILE (type) = (type_quals & TYPE_QUAL_VOLATILE) != 0;
6083 TYPE_RESTRICT (type) = (type_quals & TYPE_QUAL_RESTRICT) != 0;
6084 TYPE_ATOMIC (type) = (type_quals & TYPE_QUAL_ATOMIC) != 0;
6085 TYPE_ADDR_SPACE (type) = DECODE_QUAL_ADDR_SPACE (type_quals);
6088 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
6090 bool
6091 check_qualified_type (const_tree cand, const_tree base, int type_quals)
6093 return (TYPE_QUALS (cand) == type_quals
6094 && TYPE_NAME (cand) == TYPE_NAME (base)
6095 /* Apparently this is needed for Objective-C. */
6096 && TYPE_CONTEXT (cand) == TYPE_CONTEXT (base)
6097 /* Check alignment. */
6098 && TYPE_ALIGN (cand) == TYPE_ALIGN (base)
6099 && attribute_list_equal (TYPE_ATTRIBUTES (cand),
6100 TYPE_ATTRIBUTES (base)));
6103 /* Returns true iff CAND is equivalent to BASE with ALIGN. */
6105 static bool
6106 check_aligned_type (const_tree cand, const_tree base, unsigned int align)
6108 return (TYPE_QUALS (cand) == TYPE_QUALS (base)
6109 && TYPE_NAME (cand) == TYPE_NAME (base)
6110 /* Apparently this is needed for Objective-C. */
6111 && TYPE_CONTEXT (cand) == TYPE_CONTEXT (base)
6112 /* Check alignment. */
6113 && TYPE_ALIGN (cand) == align
6114 && attribute_list_equal (TYPE_ATTRIBUTES (cand),
6115 TYPE_ATTRIBUTES (base)));
6118 /* This function checks to see if TYPE matches the size one of the built-in
6119 atomic types, and returns that core atomic type. */
6121 static tree
6122 find_atomic_core_type (tree type)
6124 tree base_atomic_type;
6126 /* Only handle complete types. */
6127 if (TYPE_SIZE (type) == NULL_TREE)
6128 return NULL_TREE;
6130 HOST_WIDE_INT type_size = tree_to_uhwi (TYPE_SIZE (type));
6131 switch (type_size)
6133 case 8:
6134 base_atomic_type = atomicQI_type_node;
6135 break;
6137 case 16:
6138 base_atomic_type = atomicHI_type_node;
6139 break;
6141 case 32:
6142 base_atomic_type = atomicSI_type_node;
6143 break;
6145 case 64:
6146 base_atomic_type = atomicDI_type_node;
6147 break;
6149 case 128:
6150 base_atomic_type = atomicTI_type_node;
6151 break;
6153 default:
6154 base_atomic_type = NULL_TREE;
6157 return base_atomic_type;
6160 /* Return a version of the TYPE, qualified as indicated by the
6161 TYPE_QUALS, if one exists. If no qualified version exists yet,
6162 return NULL_TREE. */
6164 tree
6165 get_qualified_type (tree type, int type_quals)
6167 tree t;
6169 if (TYPE_QUALS (type) == type_quals)
6170 return type;
6172 /* Search the chain of variants to see if there is already one there just
6173 like the one we need to have. If so, use that existing one. We must
6174 preserve the TYPE_NAME, since there is code that depends on this. */
6175 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
6176 if (check_qualified_type (t, type, type_quals))
6177 return t;
6179 return NULL_TREE;
6182 /* Like get_qualified_type, but creates the type if it does not
6183 exist. This function never returns NULL_TREE. */
6185 tree
6186 build_qualified_type (tree type, int type_quals)
6188 tree t;
6190 /* See if we already have the appropriate qualified variant. */
6191 t = get_qualified_type (type, type_quals);
6193 /* If not, build it. */
6194 if (!t)
6196 t = build_variant_type_copy (type);
6197 set_type_quals (t, type_quals);
6199 if (((type_quals & TYPE_QUAL_ATOMIC) == TYPE_QUAL_ATOMIC))
6201 /* See if this object can map to a basic atomic type. */
6202 tree atomic_type = find_atomic_core_type (type);
6203 if (atomic_type)
6205 /* Ensure the alignment of this type is compatible with
6206 the required alignment of the atomic type. */
6207 if (TYPE_ALIGN (atomic_type) > TYPE_ALIGN (t))
6208 TYPE_ALIGN (t) = TYPE_ALIGN (atomic_type);
6212 if (TYPE_STRUCTURAL_EQUALITY_P (type))
6213 /* Propagate structural equality. */
6214 SET_TYPE_STRUCTURAL_EQUALITY (t);
6215 else if (TYPE_CANONICAL (type) != type)
6216 /* Build the underlying canonical type, since it is different
6217 from TYPE. */
6218 TYPE_CANONICAL (t) = build_qualified_type (TYPE_CANONICAL (type),
6219 type_quals);
6220 else
6221 /* T is its own canonical type. */
6222 TYPE_CANONICAL (t) = t;
6226 return t;
6229 /* Create a variant of type T with alignment ALIGN. */
6231 tree
6232 build_aligned_type (tree type, unsigned int align)
6234 tree t;
6236 if (TYPE_PACKED (type)
6237 || TYPE_ALIGN (type) == align)
6238 return type;
6240 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
6241 if (check_aligned_type (t, type, align))
6242 return t;
6244 t = build_variant_type_copy (type);
6245 TYPE_ALIGN (t) = align;
6247 return t;
6250 /* Create a new distinct copy of TYPE. The new type is made its own
6251 MAIN_VARIANT. If TYPE requires structural equality checks, the
6252 resulting type requires structural equality checks; otherwise, its
6253 TYPE_CANONICAL points to itself. */
6255 tree
6256 build_distinct_type_copy (tree type)
6258 tree t = copy_node (type);
6260 TYPE_POINTER_TO (t) = 0;
6261 TYPE_REFERENCE_TO (t) = 0;
6263 /* Set the canonical type either to a new equivalence class, or
6264 propagate the need for structural equality checks. */
6265 if (TYPE_STRUCTURAL_EQUALITY_P (type))
6266 SET_TYPE_STRUCTURAL_EQUALITY (t);
6267 else
6268 TYPE_CANONICAL (t) = t;
6270 /* Make it its own variant. */
6271 TYPE_MAIN_VARIANT (t) = t;
6272 TYPE_NEXT_VARIANT (t) = 0;
6274 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
6275 whose TREE_TYPE is not t. This can also happen in the Ada
6276 frontend when using subtypes. */
6278 return t;
6281 /* Create a new variant of TYPE, equivalent but distinct. This is so
6282 the caller can modify it. TYPE_CANONICAL for the return type will
6283 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
6284 are considered equal by the language itself (or that both types
6285 require structural equality checks). */
6287 tree
6288 build_variant_type_copy (tree type)
6290 tree t, m = TYPE_MAIN_VARIANT (type);
6292 t = build_distinct_type_copy (type);
6294 /* Since we're building a variant, assume that it is a non-semantic
6295 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
6296 TYPE_CANONICAL (t) = TYPE_CANONICAL (type);
6298 /* Add the new type to the chain of variants of TYPE. */
6299 TYPE_NEXT_VARIANT (t) = TYPE_NEXT_VARIANT (m);
6300 TYPE_NEXT_VARIANT (m) = t;
6301 TYPE_MAIN_VARIANT (t) = m;
6303 return t;
6306 /* Return true if the from tree in both tree maps are equal. */
6309 tree_map_base_eq (const void *va, const void *vb)
6311 const struct tree_map_base *const a = (const struct tree_map_base *) va,
6312 *const b = (const struct tree_map_base *) vb;
6313 return (a->from == b->from);
6316 /* Hash a from tree in a tree_base_map. */
6318 unsigned int
6319 tree_map_base_hash (const void *item)
6321 return htab_hash_pointer (((const struct tree_map_base *)item)->from);
6324 /* Return true if this tree map structure is marked for garbage collection
6325 purposes. We simply return true if the from tree is marked, so that this
6326 structure goes away when the from tree goes away. */
6329 tree_map_base_marked_p (const void *p)
6331 return ggc_marked_p (((const struct tree_map_base *) p)->from);
6334 /* Hash a from tree in a tree_map. */
6336 unsigned int
6337 tree_map_hash (const void *item)
6339 return (((const struct tree_map *) item)->hash);
6342 /* Hash a from tree in a tree_decl_map. */
6344 unsigned int
6345 tree_decl_map_hash (const void *item)
6347 return DECL_UID (((const struct tree_decl_map *) item)->base.from);
6350 /* Return the initialization priority for DECL. */
6352 priority_type
6353 decl_init_priority_lookup (tree decl)
6355 struct tree_priority_map *h;
6356 struct tree_map_base in;
6358 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl));
6359 in.from = decl;
6360 h = (struct tree_priority_map *) htab_find (init_priority_for_decl, &in);
6361 return h ? h->init : DEFAULT_INIT_PRIORITY;
6364 /* Return the finalization priority for DECL. */
6366 priority_type
6367 decl_fini_priority_lookup (tree decl)
6369 struct tree_priority_map *h;
6370 struct tree_map_base in;
6372 gcc_assert (TREE_CODE (decl) == FUNCTION_DECL);
6373 in.from = decl;
6374 h = (struct tree_priority_map *) htab_find (init_priority_for_decl, &in);
6375 return h ? h->fini : DEFAULT_INIT_PRIORITY;
6378 /* Return the initialization and finalization priority information for
6379 DECL. If there is no previous priority information, a freshly
6380 allocated structure is returned. */
6382 static struct tree_priority_map *
6383 decl_priority_info (tree decl)
6385 struct tree_priority_map in;
6386 struct tree_priority_map *h;
6387 void **loc;
6389 in.base.from = decl;
6390 loc = htab_find_slot (init_priority_for_decl, &in, INSERT);
6391 h = (struct tree_priority_map *) *loc;
6392 if (!h)
6394 h = ggc_alloc_cleared_tree_priority_map ();
6395 *loc = h;
6396 h->base.from = decl;
6397 h->init = DEFAULT_INIT_PRIORITY;
6398 h->fini = DEFAULT_INIT_PRIORITY;
6401 return h;
6404 /* Set the initialization priority for DECL to PRIORITY. */
6406 void
6407 decl_init_priority_insert (tree decl, priority_type priority)
6409 struct tree_priority_map *h;
6411 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl));
6412 if (priority == DEFAULT_INIT_PRIORITY)
6413 return;
6414 h = decl_priority_info (decl);
6415 h->init = priority;
6418 /* Set the finalization priority for DECL to PRIORITY. */
6420 void
6421 decl_fini_priority_insert (tree decl, priority_type priority)
6423 struct tree_priority_map *h;
6425 gcc_assert (TREE_CODE (decl) == FUNCTION_DECL);
6426 if (priority == DEFAULT_INIT_PRIORITY)
6427 return;
6428 h = decl_priority_info (decl);
6429 h->fini = priority;
6432 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
6434 static void
6435 print_debug_expr_statistics (void)
6437 fprintf (stderr, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
6438 (long) htab_size (debug_expr_for_decl),
6439 (long) htab_elements (debug_expr_for_decl),
6440 htab_collisions (debug_expr_for_decl));
6443 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
6445 static void
6446 print_value_expr_statistics (void)
6448 fprintf (stderr, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
6449 (long) htab_size (value_expr_for_decl),
6450 (long) htab_elements (value_expr_for_decl),
6451 htab_collisions (value_expr_for_decl));
6454 /* Lookup a debug expression for FROM, and return it if we find one. */
6456 tree
6457 decl_debug_expr_lookup (tree from)
6459 struct tree_decl_map *h, in;
6460 in.base.from = from;
6462 h = (struct tree_decl_map *)
6463 htab_find_with_hash (debug_expr_for_decl, &in, DECL_UID (from));
6464 if (h)
6465 return h->to;
6466 return NULL_TREE;
6469 /* Insert a mapping FROM->TO in the debug expression hashtable. */
6471 void
6472 decl_debug_expr_insert (tree from, tree to)
6474 struct tree_decl_map *h;
6475 void **loc;
6477 h = ggc_alloc_tree_decl_map ();
6478 h->base.from = from;
6479 h->to = to;
6480 loc = htab_find_slot_with_hash (debug_expr_for_decl, h, DECL_UID (from),
6481 INSERT);
6482 *(struct tree_decl_map **) loc = h;
6485 /* Lookup a value expression for FROM, and return it if we find one. */
6487 tree
6488 decl_value_expr_lookup (tree from)
6490 struct tree_decl_map *h, in;
6491 in.base.from = from;
6493 h = (struct tree_decl_map *)
6494 htab_find_with_hash (value_expr_for_decl, &in, DECL_UID (from));
6495 if (h)
6496 return h->to;
6497 return NULL_TREE;
6500 /* Insert a mapping FROM->TO in the value expression hashtable. */
6502 void
6503 decl_value_expr_insert (tree from, tree to)
6505 struct tree_decl_map *h;
6506 void **loc;
6508 h = ggc_alloc_tree_decl_map ();
6509 h->base.from = from;
6510 h->to = to;
6511 loc = htab_find_slot_with_hash (value_expr_for_decl, h, DECL_UID (from),
6512 INSERT);
6513 *(struct tree_decl_map **) loc = h;
6516 /* Lookup a vector of debug arguments for FROM, and return it if we
6517 find one. */
6519 vec<tree, va_gc> **
6520 decl_debug_args_lookup (tree from)
6522 struct tree_vec_map *h, in;
6524 if (!DECL_HAS_DEBUG_ARGS_P (from))
6525 return NULL;
6526 gcc_checking_assert (debug_args_for_decl != NULL);
6527 in.base.from = from;
6528 h = (struct tree_vec_map *)
6529 htab_find_with_hash (debug_args_for_decl, &in, DECL_UID (from));
6530 if (h)
6531 return &h->to;
6532 return NULL;
6535 /* Insert a mapping FROM->empty vector of debug arguments in the value
6536 expression hashtable. */
6538 vec<tree, va_gc> **
6539 decl_debug_args_insert (tree from)
6541 struct tree_vec_map *h;
6542 void **loc;
6544 if (DECL_HAS_DEBUG_ARGS_P (from))
6545 return decl_debug_args_lookup (from);
6546 if (debug_args_for_decl == NULL)
6547 debug_args_for_decl = htab_create_ggc (64, tree_vec_map_hash,
6548 tree_vec_map_eq, 0);
6549 h = ggc_alloc_tree_vec_map ();
6550 h->base.from = from;
6551 h->to = NULL;
6552 loc = htab_find_slot_with_hash (debug_args_for_decl, h, DECL_UID (from),
6553 INSERT);
6554 *(struct tree_vec_map **) loc = h;
6555 DECL_HAS_DEBUG_ARGS_P (from) = 1;
6556 return &h->to;
6559 /* Hashing of types so that we don't make duplicates.
6560 The entry point is `type_hash_canon'. */
6562 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
6563 with types in the TREE_VALUE slots), by adding the hash codes
6564 of the individual types. */
6566 static unsigned int
6567 type_hash_list (const_tree list, hashval_t hashcode)
6569 const_tree tail;
6571 for (tail = list; tail; tail = TREE_CHAIN (tail))
6572 if (TREE_VALUE (tail) != error_mark_node)
6573 hashcode = iterative_hash_object (TYPE_HASH (TREE_VALUE (tail)),
6574 hashcode);
6576 return hashcode;
6579 /* These are the Hashtable callback functions. */
6581 /* Returns true iff the types are equivalent. */
6583 static int
6584 type_hash_eq (const void *va, const void *vb)
6586 const struct type_hash *const a = (const struct type_hash *) va,
6587 *const b = (const struct type_hash *) vb;
6589 /* First test the things that are the same for all types. */
6590 if (a->hash != b->hash
6591 || TREE_CODE (a->type) != TREE_CODE (b->type)
6592 || TREE_TYPE (a->type) != TREE_TYPE (b->type)
6593 || !attribute_list_equal (TYPE_ATTRIBUTES (a->type),
6594 TYPE_ATTRIBUTES (b->type))
6595 || (TREE_CODE (a->type) != COMPLEX_TYPE
6596 && TYPE_NAME (a->type) != TYPE_NAME (b->type)))
6597 return 0;
6599 /* Be careful about comparing arrays before and after the element type
6600 has been completed; don't compare TYPE_ALIGN unless both types are
6601 complete. */
6602 if (COMPLETE_TYPE_P (a->type) && COMPLETE_TYPE_P (b->type)
6603 && (TYPE_ALIGN (a->type) != TYPE_ALIGN (b->type)
6604 || TYPE_MODE (a->type) != TYPE_MODE (b->type)))
6605 return 0;
6607 switch (TREE_CODE (a->type))
6609 case VOID_TYPE:
6610 case COMPLEX_TYPE:
6611 case POINTER_TYPE:
6612 case REFERENCE_TYPE:
6613 case NULLPTR_TYPE:
6614 return 1;
6616 case VECTOR_TYPE:
6617 return TYPE_VECTOR_SUBPARTS (a->type) == TYPE_VECTOR_SUBPARTS (b->type);
6619 case ENUMERAL_TYPE:
6620 if (TYPE_VALUES (a->type) != TYPE_VALUES (b->type)
6621 && !(TYPE_VALUES (a->type)
6622 && TREE_CODE (TYPE_VALUES (a->type)) == TREE_LIST
6623 && TYPE_VALUES (b->type)
6624 && TREE_CODE (TYPE_VALUES (b->type)) == TREE_LIST
6625 && type_list_equal (TYPE_VALUES (a->type),
6626 TYPE_VALUES (b->type))))
6627 return 0;
6629 /* ... fall through ... */
6631 case INTEGER_TYPE:
6632 case REAL_TYPE:
6633 case BOOLEAN_TYPE:
6634 return ((TYPE_MAX_VALUE (a->type) == TYPE_MAX_VALUE (b->type)
6635 || tree_int_cst_equal (TYPE_MAX_VALUE (a->type),
6636 TYPE_MAX_VALUE (b->type)))
6637 && (TYPE_MIN_VALUE (a->type) == TYPE_MIN_VALUE (b->type)
6638 || tree_int_cst_equal (TYPE_MIN_VALUE (a->type),
6639 TYPE_MIN_VALUE (b->type))));
6641 case FIXED_POINT_TYPE:
6642 return TYPE_SATURATING (a->type) == TYPE_SATURATING (b->type);
6644 case OFFSET_TYPE:
6645 return TYPE_OFFSET_BASETYPE (a->type) == TYPE_OFFSET_BASETYPE (b->type);
6647 case METHOD_TYPE:
6648 if (TYPE_METHOD_BASETYPE (a->type) == TYPE_METHOD_BASETYPE (b->type)
6649 && (TYPE_ARG_TYPES (a->type) == TYPE_ARG_TYPES (b->type)
6650 || (TYPE_ARG_TYPES (a->type)
6651 && TREE_CODE (TYPE_ARG_TYPES (a->type)) == TREE_LIST
6652 && TYPE_ARG_TYPES (b->type)
6653 && TREE_CODE (TYPE_ARG_TYPES (b->type)) == TREE_LIST
6654 && type_list_equal (TYPE_ARG_TYPES (a->type),
6655 TYPE_ARG_TYPES (b->type)))))
6656 break;
6657 return 0;
6658 case ARRAY_TYPE:
6659 return TYPE_DOMAIN (a->type) == TYPE_DOMAIN (b->type);
6661 case RECORD_TYPE:
6662 case UNION_TYPE:
6663 case QUAL_UNION_TYPE:
6664 return (TYPE_FIELDS (a->type) == TYPE_FIELDS (b->type)
6665 || (TYPE_FIELDS (a->type)
6666 && TREE_CODE (TYPE_FIELDS (a->type)) == TREE_LIST
6667 && TYPE_FIELDS (b->type)
6668 && TREE_CODE (TYPE_FIELDS (b->type)) == TREE_LIST
6669 && type_list_equal (TYPE_FIELDS (a->type),
6670 TYPE_FIELDS (b->type))));
6672 case FUNCTION_TYPE:
6673 if (TYPE_ARG_TYPES (a->type) == TYPE_ARG_TYPES (b->type)
6674 || (TYPE_ARG_TYPES (a->type)
6675 && TREE_CODE (TYPE_ARG_TYPES (a->type)) == TREE_LIST
6676 && TYPE_ARG_TYPES (b->type)
6677 && TREE_CODE (TYPE_ARG_TYPES (b->type)) == TREE_LIST
6678 && type_list_equal (TYPE_ARG_TYPES (a->type),
6679 TYPE_ARG_TYPES (b->type))))
6680 break;
6681 return 0;
6683 default:
6684 return 0;
6687 if (lang_hooks.types.type_hash_eq != NULL)
6688 return lang_hooks.types.type_hash_eq (a->type, b->type);
6690 return 1;
6693 /* Return the cached hash value. */
6695 static hashval_t
6696 type_hash_hash (const void *item)
6698 return ((const struct type_hash *) item)->hash;
6701 /* Look in the type hash table for a type isomorphic to TYPE.
6702 If one is found, return it. Otherwise return 0. */
6704 static tree
6705 type_hash_lookup (hashval_t hashcode, tree type)
6707 struct type_hash *h, in;
6709 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
6710 must call that routine before comparing TYPE_ALIGNs. */
6711 layout_type (type);
6713 in.hash = hashcode;
6714 in.type = type;
6716 h = (struct type_hash *) htab_find_with_hash (type_hash_table, &in,
6717 hashcode);
6718 if (h)
6719 return h->type;
6720 return NULL_TREE;
6723 /* Add an entry to the type-hash-table
6724 for a type TYPE whose hash code is HASHCODE. */
6726 static void
6727 type_hash_add (hashval_t hashcode, tree type)
6729 struct type_hash *h;
6730 void **loc;
6732 h = ggc_alloc_type_hash ();
6733 h->hash = hashcode;
6734 h->type = type;
6735 loc = htab_find_slot_with_hash (type_hash_table, h, hashcode, INSERT);
6736 *loc = (void *)h;
6739 /* Given TYPE, and HASHCODE its hash code, return the canonical
6740 object for an identical type if one already exists.
6741 Otherwise, return TYPE, and record it as the canonical object.
6743 To use this function, first create a type of the sort you want.
6744 Then compute its hash code from the fields of the type that
6745 make it different from other similar types.
6746 Then call this function and use the value. */
6748 tree
6749 type_hash_canon (unsigned int hashcode, tree type)
6751 tree t1;
6753 /* The hash table only contains main variants, so ensure that's what we're
6754 being passed. */
6755 gcc_assert (TYPE_MAIN_VARIANT (type) == type);
6757 /* See if the type is in the hash table already. If so, return it.
6758 Otherwise, add the type. */
6759 t1 = type_hash_lookup (hashcode, type);
6760 if (t1 != 0)
6762 if (GATHER_STATISTICS)
6764 tree_code_counts[(int) TREE_CODE (type)]--;
6765 tree_node_counts[(int) t_kind]--;
6766 tree_node_sizes[(int) t_kind] -= sizeof (struct tree_type_non_common);
6768 return t1;
6770 else
6772 type_hash_add (hashcode, type);
6773 return type;
6777 /* See if the data pointed to by the type hash table is marked. We consider
6778 it marked if the type is marked or if a debug type number or symbol
6779 table entry has been made for the type. */
6781 static int
6782 type_hash_marked_p (const void *p)
6784 const_tree const type = ((const struct type_hash *) p)->type;
6786 return ggc_marked_p (type);
6789 static void
6790 print_type_hash_statistics (void)
6792 fprintf (stderr, "Type hash: size %ld, %ld elements, %f collisions\n",
6793 (long) htab_size (type_hash_table),
6794 (long) htab_elements (type_hash_table),
6795 htab_collisions (type_hash_table));
6798 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
6799 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
6800 by adding the hash codes of the individual attributes. */
6802 static unsigned int
6803 attribute_hash_list (const_tree list, hashval_t hashcode)
6805 const_tree tail;
6807 for (tail = list; tail; tail = TREE_CHAIN (tail))
6808 /* ??? Do we want to add in TREE_VALUE too? */
6809 hashcode = iterative_hash_object
6810 (IDENTIFIER_HASH_VALUE (get_attribute_name (tail)), hashcode);
6811 return hashcode;
6814 /* Given two lists of attributes, return true if list l2 is
6815 equivalent to l1. */
6818 attribute_list_equal (const_tree l1, const_tree l2)
6820 if (l1 == l2)
6821 return 1;
6823 return attribute_list_contained (l1, l2)
6824 && attribute_list_contained (l2, l1);
6827 /* Given two lists of attributes, return true if list L2 is
6828 completely contained within L1. */
6829 /* ??? This would be faster if attribute names were stored in a canonicalized
6830 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
6831 must be used to show these elements are equivalent (which they are). */
6832 /* ??? It's not clear that attributes with arguments will always be handled
6833 correctly. */
6836 attribute_list_contained (const_tree l1, const_tree l2)
6838 const_tree t1, t2;
6840 /* First check the obvious, maybe the lists are identical. */
6841 if (l1 == l2)
6842 return 1;
6844 /* Maybe the lists are similar. */
6845 for (t1 = l1, t2 = l2;
6846 t1 != 0 && t2 != 0
6847 && get_attribute_name (t1) == get_attribute_name (t2)
6848 && TREE_VALUE (t1) == TREE_VALUE (t2);
6849 t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2))
6852 /* Maybe the lists are equal. */
6853 if (t1 == 0 && t2 == 0)
6854 return 1;
6856 for (; t2 != 0; t2 = TREE_CHAIN (t2))
6858 const_tree attr;
6859 /* This CONST_CAST is okay because lookup_attribute does not
6860 modify its argument and the return value is assigned to a
6861 const_tree. */
6862 for (attr = lookup_ident_attribute (get_attribute_name (t2),
6863 CONST_CAST_TREE (l1));
6864 attr != NULL_TREE && !attribute_value_equal (t2, attr);
6865 attr = lookup_ident_attribute (get_attribute_name (t2),
6866 TREE_CHAIN (attr)))
6869 if (attr == NULL_TREE)
6870 return 0;
6873 return 1;
6876 /* Given two lists of types
6877 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
6878 return 1 if the lists contain the same types in the same order.
6879 Also, the TREE_PURPOSEs must match. */
6882 type_list_equal (const_tree l1, const_tree l2)
6884 const_tree t1, t2;
6886 for (t1 = l1, t2 = l2; t1 && t2; t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2))
6887 if (TREE_VALUE (t1) != TREE_VALUE (t2)
6888 || (TREE_PURPOSE (t1) != TREE_PURPOSE (t2)
6889 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1), TREE_PURPOSE (t2))
6890 && (TREE_TYPE (TREE_PURPOSE (t1))
6891 == TREE_TYPE (TREE_PURPOSE (t2))))))
6892 return 0;
6894 return t1 == t2;
6897 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
6898 given by TYPE. If the argument list accepts variable arguments,
6899 then this function counts only the ordinary arguments. */
6902 type_num_arguments (const_tree type)
6904 int i = 0;
6905 tree t;
6907 for (t = TYPE_ARG_TYPES (type); t; t = TREE_CHAIN (t))
6908 /* If the function does not take a variable number of arguments,
6909 the last element in the list will have type `void'. */
6910 if (VOID_TYPE_P (TREE_VALUE (t)))
6911 break;
6912 else
6913 ++i;
6915 return i;
6918 /* Nonzero if integer constants T1 and T2
6919 represent the same constant value. */
6922 tree_int_cst_equal (const_tree t1, const_tree t2)
6924 if (t1 == t2)
6925 return 1;
6927 if (t1 == 0 || t2 == 0)
6928 return 0;
6930 if (TREE_CODE (t1) == INTEGER_CST
6931 && TREE_CODE (t2) == INTEGER_CST
6932 && TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
6933 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2))
6934 return 1;
6936 return 0;
6939 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
6940 The precise way of comparison depends on their data type. */
6943 tree_int_cst_lt (const_tree t1, const_tree t2)
6945 if (t1 == t2)
6946 return 0;
6948 if (TYPE_UNSIGNED (TREE_TYPE (t1)) != TYPE_UNSIGNED (TREE_TYPE (t2)))
6950 int t1_sgn = tree_int_cst_sgn (t1);
6951 int t2_sgn = tree_int_cst_sgn (t2);
6953 if (t1_sgn < t2_sgn)
6954 return 1;
6955 else if (t1_sgn > t2_sgn)
6956 return 0;
6957 /* Otherwise, both are non-negative, so we compare them as
6958 unsigned just in case one of them would overflow a signed
6959 type. */
6961 else if (!TYPE_UNSIGNED (TREE_TYPE (t1)))
6962 return INT_CST_LT (t1, t2);
6964 return INT_CST_LT_UNSIGNED (t1, t2);
6967 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. */
6970 tree_int_cst_compare (const_tree t1, const_tree t2)
6972 if (tree_int_cst_lt (t1, t2))
6973 return -1;
6974 else if (tree_int_cst_lt (t2, t1))
6975 return 1;
6976 else
6977 return 0;
6980 /* Return true if T is an INTEGER_CST whose numerical value (extended
6981 according to TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. */
6983 bool
6984 tree_fits_shwi_p (const_tree t)
6986 return (t != NULL_TREE
6987 && TREE_CODE (t) == INTEGER_CST
6988 && ((TREE_INT_CST_HIGH (t) == 0
6989 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) >= 0)
6990 || (TREE_INT_CST_HIGH (t) == -1
6991 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0
6992 && !TYPE_UNSIGNED (TREE_TYPE (t)))));
6995 /* Return true if T is an INTEGER_CST whose numerical value (extended
6996 according to TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. */
6998 bool
6999 tree_fits_uhwi_p (const_tree t)
7001 return (t != NULL_TREE
7002 && TREE_CODE (t) == INTEGER_CST
7003 && TREE_INT_CST_HIGH (t) == 0);
7006 /* T is an INTEGER_CST whose numerical value (extended according to
7007 TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. Return that
7008 HOST_WIDE_INT. */
7010 HOST_WIDE_INT
7011 tree_to_shwi (const_tree t)
7013 gcc_assert (tree_fits_shwi_p (t));
7014 return TREE_INT_CST_LOW (t);
7017 /* T is an INTEGER_CST whose numerical value (extended according to
7018 TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. Return that
7019 HOST_WIDE_INT. */
7021 unsigned HOST_WIDE_INT
7022 tree_to_uhwi (const_tree t)
7024 gcc_assert (tree_fits_uhwi_p (t));
7025 return TREE_INT_CST_LOW (t);
7028 /* Return the most significant (sign) bit of T. */
7031 tree_int_cst_sign_bit (const_tree t)
7033 unsigned bitno = TYPE_PRECISION (TREE_TYPE (t)) - 1;
7034 unsigned HOST_WIDE_INT w;
7036 if (bitno < HOST_BITS_PER_WIDE_INT)
7037 w = TREE_INT_CST_LOW (t);
7038 else
7040 w = TREE_INT_CST_HIGH (t);
7041 bitno -= HOST_BITS_PER_WIDE_INT;
7044 return (w >> bitno) & 1;
7047 /* Return an indication of the sign of the integer constant T.
7048 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
7049 Note that -1 will never be returned if T's type is unsigned. */
7052 tree_int_cst_sgn (const_tree t)
7054 if (TREE_INT_CST_LOW (t) == 0 && TREE_INT_CST_HIGH (t) == 0)
7055 return 0;
7056 else if (TYPE_UNSIGNED (TREE_TYPE (t)))
7057 return 1;
7058 else if (TREE_INT_CST_HIGH (t) < 0)
7059 return -1;
7060 else
7061 return 1;
7064 /* Return the minimum number of bits needed to represent VALUE in a
7065 signed or unsigned type, UNSIGNEDP says which. */
7067 unsigned int
7068 tree_int_cst_min_precision (tree value, bool unsignedp)
7070 /* If the value is negative, compute its negative minus 1. The latter
7071 adjustment is because the absolute value of the largest negative value
7072 is one larger than the largest positive value. This is equivalent to
7073 a bit-wise negation, so use that operation instead. */
7075 if (tree_int_cst_sgn (value) < 0)
7076 value = fold_build1 (BIT_NOT_EXPR, TREE_TYPE (value), value);
7078 /* Return the number of bits needed, taking into account the fact
7079 that we need one more bit for a signed than unsigned type.
7080 If value is 0 or -1, the minimum precision is 1 no matter
7081 whether unsignedp is true or false. */
7083 if (integer_zerop (value))
7084 return 1;
7085 else
7086 return tree_floor_log2 (value) + 1 + !unsignedp;
7089 /* Return truthvalue of whether T1 is the same tree structure as T2.
7090 Return 1 if they are the same.
7091 Return 0 if they are understandably different.
7092 Return -1 if either contains tree structure not understood by
7093 this function. */
7096 simple_cst_equal (const_tree t1, const_tree t2)
7098 enum tree_code code1, code2;
7099 int cmp;
7100 int i;
7102 if (t1 == t2)
7103 return 1;
7104 if (t1 == 0 || t2 == 0)
7105 return 0;
7107 code1 = TREE_CODE (t1);
7108 code2 = TREE_CODE (t2);
7110 if (CONVERT_EXPR_CODE_P (code1) || code1 == NON_LVALUE_EXPR)
7112 if (CONVERT_EXPR_CODE_P (code2)
7113 || code2 == NON_LVALUE_EXPR)
7114 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
7115 else
7116 return simple_cst_equal (TREE_OPERAND (t1, 0), t2);
7119 else if (CONVERT_EXPR_CODE_P (code2)
7120 || code2 == NON_LVALUE_EXPR)
7121 return simple_cst_equal (t1, TREE_OPERAND (t2, 0));
7123 if (code1 != code2)
7124 return 0;
7126 switch (code1)
7128 case INTEGER_CST:
7129 return (TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
7130 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2));
7132 case REAL_CST:
7133 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1), TREE_REAL_CST (t2));
7135 case FIXED_CST:
7136 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1), TREE_FIXED_CST (t2));
7138 case STRING_CST:
7139 return (TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2)
7140 && ! memcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2),
7141 TREE_STRING_LENGTH (t1)));
7143 case CONSTRUCTOR:
7145 unsigned HOST_WIDE_INT idx;
7146 vec<constructor_elt, va_gc> *v1 = CONSTRUCTOR_ELTS (t1);
7147 vec<constructor_elt, va_gc> *v2 = CONSTRUCTOR_ELTS (t2);
7149 if (vec_safe_length (v1) != vec_safe_length (v2))
7150 return false;
7152 for (idx = 0; idx < vec_safe_length (v1); ++idx)
7153 /* ??? Should we handle also fields here? */
7154 if (!simple_cst_equal ((*v1)[idx].value, (*v2)[idx].value))
7155 return false;
7156 return true;
7159 case SAVE_EXPR:
7160 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
7162 case CALL_EXPR:
7163 cmp = simple_cst_equal (CALL_EXPR_FN (t1), CALL_EXPR_FN (t2));
7164 if (cmp <= 0)
7165 return cmp;
7166 if (call_expr_nargs (t1) != call_expr_nargs (t2))
7167 return 0;
7169 const_tree arg1, arg2;
7170 const_call_expr_arg_iterator iter1, iter2;
7171 for (arg1 = first_const_call_expr_arg (t1, &iter1),
7172 arg2 = first_const_call_expr_arg (t2, &iter2);
7173 arg1 && arg2;
7174 arg1 = next_const_call_expr_arg (&iter1),
7175 arg2 = next_const_call_expr_arg (&iter2))
7177 cmp = simple_cst_equal (arg1, arg2);
7178 if (cmp <= 0)
7179 return cmp;
7181 return arg1 == arg2;
7184 case TARGET_EXPR:
7185 /* Special case: if either target is an unallocated VAR_DECL,
7186 it means that it's going to be unified with whatever the
7187 TARGET_EXPR is really supposed to initialize, so treat it
7188 as being equivalent to anything. */
7189 if ((TREE_CODE (TREE_OPERAND (t1, 0)) == VAR_DECL
7190 && DECL_NAME (TREE_OPERAND (t1, 0)) == NULL_TREE
7191 && !DECL_RTL_SET_P (TREE_OPERAND (t1, 0)))
7192 || (TREE_CODE (TREE_OPERAND (t2, 0)) == VAR_DECL
7193 && DECL_NAME (TREE_OPERAND (t2, 0)) == NULL_TREE
7194 && !DECL_RTL_SET_P (TREE_OPERAND (t2, 0))))
7195 cmp = 1;
7196 else
7197 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
7199 if (cmp <= 0)
7200 return cmp;
7202 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
7204 case WITH_CLEANUP_EXPR:
7205 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
7206 if (cmp <= 0)
7207 return cmp;
7209 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t1, 1));
7211 case COMPONENT_REF:
7212 if (TREE_OPERAND (t1, 1) == TREE_OPERAND (t2, 1))
7213 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
7215 return 0;
7217 case VAR_DECL:
7218 case PARM_DECL:
7219 case CONST_DECL:
7220 case FUNCTION_DECL:
7221 return 0;
7223 default:
7224 break;
7227 /* This general rule works for most tree codes. All exceptions should be
7228 handled above. If this is a language-specific tree code, we can't
7229 trust what might be in the operand, so say we don't know
7230 the situation. */
7231 if ((int) code1 >= (int) LAST_AND_UNUSED_TREE_CODE)
7232 return -1;
7234 switch (TREE_CODE_CLASS (code1))
7236 case tcc_unary:
7237 case tcc_binary:
7238 case tcc_comparison:
7239 case tcc_expression:
7240 case tcc_reference:
7241 case tcc_statement:
7242 cmp = 1;
7243 for (i = 0; i < TREE_CODE_LENGTH (code1); i++)
7245 cmp = simple_cst_equal (TREE_OPERAND (t1, i), TREE_OPERAND (t2, i));
7246 if (cmp <= 0)
7247 return cmp;
7250 return cmp;
7252 default:
7253 return -1;
7257 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
7258 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
7259 than U, respectively. */
7262 compare_tree_int (const_tree t, unsigned HOST_WIDE_INT u)
7264 if (tree_int_cst_sgn (t) < 0)
7265 return -1;
7266 else if (TREE_INT_CST_HIGH (t) != 0)
7267 return 1;
7268 else if (TREE_INT_CST_LOW (t) == u)
7269 return 0;
7270 else if (TREE_INT_CST_LOW (t) < u)
7271 return -1;
7272 else
7273 return 1;
7276 /* Return true if SIZE represents a constant size that is in bounds of
7277 what the middle-end and the backend accepts (covering not more than
7278 half of the address-space). */
7280 bool
7281 valid_constant_size_p (const_tree size)
7283 if (! tree_fits_uhwi_p (size)
7284 || TREE_OVERFLOW (size)
7285 || tree_int_cst_sign_bit (size) != 0)
7286 return false;
7287 return true;
7290 /* Return the precision of the type, or for a complex or vector type the
7291 precision of the type of its elements. */
7293 unsigned int
7294 element_precision (const_tree type)
7296 enum tree_code code = TREE_CODE (type);
7297 if (code == COMPLEX_TYPE || code == VECTOR_TYPE)
7298 type = TREE_TYPE (type);
7300 return TYPE_PRECISION (type);
7303 /* Return true if CODE represents an associative tree code. Otherwise
7304 return false. */
7305 bool
7306 associative_tree_code (enum tree_code code)
7308 switch (code)
7310 case BIT_IOR_EXPR:
7311 case BIT_AND_EXPR:
7312 case BIT_XOR_EXPR:
7313 case PLUS_EXPR:
7314 case MULT_EXPR:
7315 case MIN_EXPR:
7316 case MAX_EXPR:
7317 return true;
7319 default:
7320 break;
7322 return false;
7325 /* Return true if CODE represents a commutative tree code. Otherwise
7326 return false. */
7327 bool
7328 commutative_tree_code (enum tree_code code)
7330 switch (code)
7332 case PLUS_EXPR:
7333 case MULT_EXPR:
7334 case MULT_HIGHPART_EXPR:
7335 case MIN_EXPR:
7336 case MAX_EXPR:
7337 case BIT_IOR_EXPR:
7338 case BIT_XOR_EXPR:
7339 case BIT_AND_EXPR:
7340 case NE_EXPR:
7341 case EQ_EXPR:
7342 case UNORDERED_EXPR:
7343 case ORDERED_EXPR:
7344 case UNEQ_EXPR:
7345 case LTGT_EXPR:
7346 case TRUTH_AND_EXPR:
7347 case TRUTH_XOR_EXPR:
7348 case TRUTH_OR_EXPR:
7349 case WIDEN_MULT_EXPR:
7350 case VEC_WIDEN_MULT_HI_EXPR:
7351 case VEC_WIDEN_MULT_LO_EXPR:
7352 case VEC_WIDEN_MULT_EVEN_EXPR:
7353 case VEC_WIDEN_MULT_ODD_EXPR:
7354 return true;
7356 default:
7357 break;
7359 return false;
7362 /* Return true if CODE represents a ternary tree code for which the
7363 first two operands are commutative. Otherwise return false. */
7364 bool
7365 commutative_ternary_tree_code (enum tree_code code)
7367 switch (code)
7369 case WIDEN_MULT_PLUS_EXPR:
7370 case WIDEN_MULT_MINUS_EXPR:
7371 return true;
7373 default:
7374 break;
7376 return false;
7379 /* Generate a hash value for an expression. This can be used iteratively
7380 by passing a previous result as the VAL argument.
7382 This function is intended to produce the same hash for expressions which
7383 would compare equal using operand_equal_p. */
7385 hashval_t
7386 iterative_hash_expr (const_tree t, hashval_t val)
7388 int i;
7389 enum tree_code code;
7390 enum tree_code_class tclass;
7392 if (t == NULL_TREE)
7393 return iterative_hash_hashval_t (0, val);
7395 code = TREE_CODE (t);
7397 switch (code)
7399 /* Alas, constants aren't shared, so we can't rely on pointer
7400 identity. */
7401 case INTEGER_CST:
7402 val = iterative_hash_host_wide_int (TREE_INT_CST_LOW (t), val);
7403 return iterative_hash_host_wide_int (TREE_INT_CST_HIGH (t), val);
7404 case REAL_CST:
7406 unsigned int val2 = real_hash (TREE_REAL_CST_PTR (t));
7408 return iterative_hash_hashval_t (val2, val);
7410 case FIXED_CST:
7412 unsigned int val2 = fixed_hash (TREE_FIXED_CST_PTR (t));
7414 return iterative_hash_hashval_t (val2, val);
7416 case STRING_CST:
7417 return iterative_hash (TREE_STRING_POINTER (t),
7418 TREE_STRING_LENGTH (t), val);
7419 case COMPLEX_CST:
7420 val = iterative_hash_expr (TREE_REALPART (t), val);
7421 return iterative_hash_expr (TREE_IMAGPART (t), val);
7422 case VECTOR_CST:
7424 unsigned i;
7425 for (i = 0; i < VECTOR_CST_NELTS (t); ++i)
7426 val = iterative_hash_expr (VECTOR_CST_ELT (t, i), val);
7427 return val;
7429 case SSA_NAME:
7430 /* We can just compare by pointer. */
7431 return iterative_hash_host_wide_int (SSA_NAME_VERSION (t), val);
7432 case PLACEHOLDER_EXPR:
7433 /* The node itself doesn't matter. */
7434 return val;
7435 case TREE_LIST:
7436 /* A list of expressions, for a CALL_EXPR or as the elements of a
7437 VECTOR_CST. */
7438 for (; t; t = TREE_CHAIN (t))
7439 val = iterative_hash_expr (TREE_VALUE (t), val);
7440 return val;
7441 case CONSTRUCTOR:
7443 unsigned HOST_WIDE_INT idx;
7444 tree field, value;
7445 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t), idx, field, value)
7447 val = iterative_hash_expr (field, val);
7448 val = iterative_hash_expr (value, val);
7450 return val;
7452 case FUNCTION_DECL:
7453 /* When referring to a built-in FUNCTION_DECL, use the __builtin__ form.
7454 Otherwise nodes that compare equal according to operand_equal_p might
7455 get different hash codes. However, don't do this for machine specific
7456 or front end builtins, since the function code is overloaded in those
7457 cases. */
7458 if (DECL_BUILT_IN_CLASS (t) == BUILT_IN_NORMAL
7459 && builtin_decl_explicit_p (DECL_FUNCTION_CODE (t)))
7461 t = builtin_decl_explicit (DECL_FUNCTION_CODE (t));
7462 code = TREE_CODE (t);
7464 /* FALL THROUGH */
7465 default:
7466 tclass = TREE_CODE_CLASS (code);
7468 if (tclass == tcc_declaration)
7470 /* DECL's have a unique ID */
7471 val = iterative_hash_host_wide_int (DECL_UID (t), val);
7473 else
7475 gcc_assert (IS_EXPR_CODE_CLASS (tclass));
7477 val = iterative_hash_object (code, val);
7479 /* Don't hash the type, that can lead to having nodes which
7480 compare equal according to operand_equal_p, but which
7481 have different hash codes. */
7482 if (CONVERT_EXPR_CODE_P (code)
7483 || code == NON_LVALUE_EXPR)
7485 /* Make sure to include signness in the hash computation. */
7486 val += TYPE_UNSIGNED (TREE_TYPE (t));
7487 val = iterative_hash_expr (TREE_OPERAND (t, 0), val);
7490 else if (commutative_tree_code (code))
7492 /* It's a commutative expression. We want to hash it the same
7493 however it appears. We do this by first hashing both operands
7494 and then rehashing based on the order of their independent
7495 hashes. */
7496 hashval_t one = iterative_hash_expr (TREE_OPERAND (t, 0), 0);
7497 hashval_t two = iterative_hash_expr (TREE_OPERAND (t, 1), 0);
7498 hashval_t t;
7500 if (one > two)
7501 t = one, one = two, two = t;
7503 val = iterative_hash_hashval_t (one, val);
7504 val = iterative_hash_hashval_t (two, val);
7506 else
7507 for (i = TREE_OPERAND_LENGTH (t) - 1; i >= 0; --i)
7508 val = iterative_hash_expr (TREE_OPERAND (t, i), val);
7510 return val;
7514 /* Constructors for pointer, array and function types.
7515 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
7516 constructed by language-dependent code, not here.) */
7518 /* Construct, lay out and return the type of pointers to TO_TYPE with
7519 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
7520 reference all of memory. If such a type has already been
7521 constructed, reuse it. */
7523 tree
7524 build_pointer_type_for_mode (tree to_type, enum machine_mode mode,
7525 bool can_alias_all)
7527 tree t;
7529 if (to_type == error_mark_node)
7530 return error_mark_node;
7532 /* If the pointed-to type has the may_alias attribute set, force
7533 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7534 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type)))
7535 can_alias_all = true;
7537 /* In some cases, languages will have things that aren't a POINTER_TYPE
7538 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
7539 In that case, return that type without regard to the rest of our
7540 operands.
7542 ??? This is a kludge, but consistent with the way this function has
7543 always operated and there doesn't seem to be a good way to avoid this
7544 at the moment. */
7545 if (TYPE_POINTER_TO (to_type) != 0
7546 && TREE_CODE (TYPE_POINTER_TO (to_type)) != POINTER_TYPE)
7547 return TYPE_POINTER_TO (to_type);
7549 /* First, if we already have a type for pointers to TO_TYPE and it's
7550 the proper mode, use it. */
7551 for (t = TYPE_POINTER_TO (to_type); t; t = TYPE_NEXT_PTR_TO (t))
7552 if (TYPE_MODE (t) == mode && TYPE_REF_CAN_ALIAS_ALL (t) == can_alias_all)
7553 return t;
7555 t = make_node (POINTER_TYPE);
7557 TREE_TYPE (t) = to_type;
7558 SET_TYPE_MODE (t, mode);
7559 TYPE_REF_CAN_ALIAS_ALL (t) = can_alias_all;
7560 TYPE_NEXT_PTR_TO (t) = TYPE_POINTER_TO (to_type);
7561 TYPE_POINTER_TO (to_type) = t;
7563 if (TYPE_STRUCTURAL_EQUALITY_P (to_type))
7564 SET_TYPE_STRUCTURAL_EQUALITY (t);
7565 else if (TYPE_CANONICAL (to_type) != to_type)
7566 TYPE_CANONICAL (t)
7567 = build_pointer_type_for_mode (TYPE_CANONICAL (to_type),
7568 mode, can_alias_all);
7570 /* Lay out the type. This function has many callers that are concerned
7571 with expression-construction, and this simplifies them all. */
7572 layout_type (t);
7574 return t;
7577 /* By default build pointers in ptr_mode. */
7579 tree
7580 build_pointer_type (tree to_type)
7582 addr_space_t as = to_type == error_mark_node? ADDR_SPACE_GENERIC
7583 : TYPE_ADDR_SPACE (to_type);
7584 enum machine_mode pointer_mode = targetm.addr_space.pointer_mode (as);
7585 return build_pointer_type_for_mode (to_type, pointer_mode, false);
7588 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
7590 tree
7591 build_reference_type_for_mode (tree to_type, enum machine_mode mode,
7592 bool can_alias_all)
7594 tree t;
7596 if (to_type == error_mark_node)
7597 return error_mark_node;
7599 /* If the pointed-to type has the may_alias attribute set, force
7600 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7601 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type)))
7602 can_alias_all = true;
7604 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
7605 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
7606 In that case, return that type without regard to the rest of our
7607 operands.
7609 ??? This is a kludge, but consistent with the way this function has
7610 always operated and there doesn't seem to be a good way to avoid this
7611 at the moment. */
7612 if (TYPE_REFERENCE_TO (to_type) != 0
7613 && TREE_CODE (TYPE_REFERENCE_TO (to_type)) != REFERENCE_TYPE)
7614 return TYPE_REFERENCE_TO (to_type);
7616 /* First, if we already have a type for pointers to TO_TYPE and it's
7617 the proper mode, use it. */
7618 for (t = TYPE_REFERENCE_TO (to_type); t; t = TYPE_NEXT_REF_TO (t))
7619 if (TYPE_MODE (t) == mode && TYPE_REF_CAN_ALIAS_ALL (t) == can_alias_all)
7620 return t;
7622 t = make_node (REFERENCE_TYPE);
7624 TREE_TYPE (t) = to_type;
7625 SET_TYPE_MODE (t, mode);
7626 TYPE_REF_CAN_ALIAS_ALL (t) = can_alias_all;
7627 TYPE_NEXT_REF_TO (t) = TYPE_REFERENCE_TO (to_type);
7628 TYPE_REFERENCE_TO (to_type) = t;
7630 if (TYPE_STRUCTURAL_EQUALITY_P (to_type))
7631 SET_TYPE_STRUCTURAL_EQUALITY (t);
7632 else if (TYPE_CANONICAL (to_type) != to_type)
7633 TYPE_CANONICAL (t)
7634 = build_reference_type_for_mode (TYPE_CANONICAL (to_type),
7635 mode, can_alias_all);
7637 layout_type (t);
7639 return t;
7643 /* Build the node for the type of references-to-TO_TYPE by default
7644 in ptr_mode. */
7646 tree
7647 build_reference_type (tree to_type)
7649 addr_space_t as = to_type == error_mark_node? ADDR_SPACE_GENERIC
7650 : TYPE_ADDR_SPACE (to_type);
7651 enum machine_mode pointer_mode = targetm.addr_space.pointer_mode (as);
7652 return build_reference_type_for_mode (to_type, pointer_mode, false);
7655 #define MAX_INT_CACHED_PREC \
7656 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
7657 static GTY(()) tree nonstandard_integer_type_cache[2 * MAX_INT_CACHED_PREC + 2];
7659 /* Builds a signed or unsigned integer type of precision PRECISION.
7660 Used for C bitfields whose precision does not match that of
7661 built-in target types. */
7662 tree
7663 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision,
7664 int unsignedp)
7666 tree itype, ret;
7668 if (unsignedp)
7669 unsignedp = MAX_INT_CACHED_PREC + 1;
7671 if (precision <= MAX_INT_CACHED_PREC)
7673 itype = nonstandard_integer_type_cache[precision + unsignedp];
7674 if (itype)
7675 return itype;
7678 itype = make_node (INTEGER_TYPE);
7679 TYPE_PRECISION (itype) = precision;
7681 if (unsignedp)
7682 fixup_unsigned_type (itype);
7683 else
7684 fixup_signed_type (itype);
7686 ret = itype;
7687 if (tree_fits_uhwi_p (TYPE_MAX_VALUE (itype)))
7688 ret = type_hash_canon (tree_to_uhwi (TYPE_MAX_VALUE (itype)), itype);
7689 if (precision <= MAX_INT_CACHED_PREC)
7690 nonstandard_integer_type_cache[precision + unsignedp] = ret;
7692 return ret;
7695 /* Create a range of some discrete type TYPE (an INTEGER_TYPE, ENUMERAL_TYPE
7696 or BOOLEAN_TYPE) with low bound LOWVAL and high bound HIGHVAL. If SHARED
7697 is true, reuse such a type that has already been constructed. */
7699 static tree
7700 build_range_type_1 (tree type, tree lowval, tree highval, bool shared)
7702 tree itype = make_node (INTEGER_TYPE);
7703 hashval_t hashcode = 0;
7705 TREE_TYPE (itype) = type;
7707 TYPE_MIN_VALUE (itype) = fold_convert (type, lowval);
7708 TYPE_MAX_VALUE (itype) = highval ? fold_convert (type, highval) : NULL;
7710 TYPE_PRECISION (itype) = TYPE_PRECISION (type);
7711 SET_TYPE_MODE (itype, TYPE_MODE (type));
7712 TYPE_SIZE (itype) = TYPE_SIZE (type);
7713 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (type);
7714 TYPE_ALIGN (itype) = TYPE_ALIGN (type);
7715 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (type);
7717 if (!shared)
7718 return itype;
7720 if ((TYPE_MIN_VALUE (itype)
7721 && TREE_CODE (TYPE_MIN_VALUE (itype)) != INTEGER_CST)
7722 || (TYPE_MAX_VALUE (itype)
7723 && TREE_CODE (TYPE_MAX_VALUE (itype)) != INTEGER_CST))
7725 /* Since we cannot reliably merge this type, we need to compare it using
7726 structural equality checks. */
7727 SET_TYPE_STRUCTURAL_EQUALITY (itype);
7728 return itype;
7731 hashcode = iterative_hash_expr (TYPE_MIN_VALUE (itype), hashcode);
7732 hashcode = iterative_hash_expr (TYPE_MAX_VALUE (itype), hashcode);
7733 hashcode = iterative_hash_hashval_t (TYPE_HASH (type), hashcode);
7734 itype = type_hash_canon (hashcode, itype);
7736 return itype;
7739 /* Wrapper around build_range_type_1 with SHARED set to true. */
7741 tree
7742 build_range_type (tree type, tree lowval, tree highval)
7744 return build_range_type_1 (type, lowval, highval, true);
7747 /* Wrapper around build_range_type_1 with SHARED set to false. */
7749 tree
7750 build_nonshared_range_type (tree type, tree lowval, tree highval)
7752 return build_range_type_1 (type, lowval, highval, false);
7755 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
7756 MAXVAL should be the maximum value in the domain
7757 (one less than the length of the array).
7759 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
7760 We don't enforce this limit, that is up to caller (e.g. language front end).
7761 The limit exists because the result is a signed type and we don't handle
7762 sizes that use more than one HOST_WIDE_INT. */
7764 tree
7765 build_index_type (tree maxval)
7767 return build_range_type (sizetype, size_zero_node, maxval);
7770 /* Return true if the debug information for TYPE, a subtype, should be emitted
7771 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
7772 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
7773 debug info and doesn't reflect the source code. */
7775 bool
7776 subrange_type_for_debug_p (const_tree type, tree *lowval, tree *highval)
7778 tree base_type = TREE_TYPE (type), low, high;
7780 /* Subrange types have a base type which is an integral type. */
7781 if (!INTEGRAL_TYPE_P (base_type))
7782 return false;
7784 /* Get the real bounds of the subtype. */
7785 if (lang_hooks.types.get_subrange_bounds)
7786 lang_hooks.types.get_subrange_bounds (type, &low, &high);
7787 else
7789 low = TYPE_MIN_VALUE (type);
7790 high = TYPE_MAX_VALUE (type);
7793 /* If the type and its base type have the same representation and the same
7794 name, then the type is not a subrange but a copy of the base type. */
7795 if ((TREE_CODE (base_type) == INTEGER_TYPE
7796 || TREE_CODE (base_type) == BOOLEAN_TYPE)
7797 && int_size_in_bytes (type) == int_size_in_bytes (base_type)
7798 && tree_int_cst_equal (low, TYPE_MIN_VALUE (base_type))
7799 && tree_int_cst_equal (high, TYPE_MAX_VALUE (base_type))
7800 && TYPE_IDENTIFIER (type) == TYPE_IDENTIFIER (base_type))
7801 return false;
7803 if (lowval)
7804 *lowval = low;
7805 if (highval)
7806 *highval = high;
7807 return true;
7810 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
7811 and number of elements specified by the range of values of INDEX_TYPE.
7812 If SHARED is true, reuse such a type that has already been constructed. */
7814 static tree
7815 build_array_type_1 (tree elt_type, tree index_type, bool shared)
7817 tree t;
7819 if (TREE_CODE (elt_type) == FUNCTION_TYPE)
7821 error ("arrays of functions are not meaningful");
7822 elt_type = integer_type_node;
7825 t = make_node (ARRAY_TYPE);
7826 TREE_TYPE (t) = elt_type;
7827 TYPE_DOMAIN (t) = index_type;
7828 TYPE_ADDR_SPACE (t) = TYPE_ADDR_SPACE (elt_type);
7829 layout_type (t);
7831 /* If the element type is incomplete at this point we get marked for
7832 structural equality. Do not record these types in the canonical
7833 type hashtable. */
7834 if (TYPE_STRUCTURAL_EQUALITY_P (t))
7835 return t;
7837 if (shared)
7839 hashval_t hashcode = iterative_hash_object (TYPE_HASH (elt_type), 0);
7840 if (index_type)
7841 hashcode = iterative_hash_object (TYPE_HASH (index_type), hashcode);
7842 t = type_hash_canon (hashcode, t);
7845 if (TYPE_CANONICAL (t) == t)
7847 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type)
7848 || (index_type && TYPE_STRUCTURAL_EQUALITY_P (index_type)))
7849 SET_TYPE_STRUCTURAL_EQUALITY (t);
7850 else if (TYPE_CANONICAL (elt_type) != elt_type
7851 || (index_type && TYPE_CANONICAL (index_type) != index_type))
7852 TYPE_CANONICAL (t)
7853 = build_array_type_1 (TYPE_CANONICAL (elt_type),
7854 index_type
7855 ? TYPE_CANONICAL (index_type) : NULL_TREE,
7856 shared);
7859 return t;
7862 /* Wrapper around build_array_type_1 with SHARED set to true. */
7864 tree
7865 build_array_type (tree elt_type, tree index_type)
7867 return build_array_type_1 (elt_type, index_type, true);
7870 /* Wrapper around build_array_type_1 with SHARED set to false. */
7872 tree
7873 build_nonshared_array_type (tree elt_type, tree index_type)
7875 return build_array_type_1 (elt_type, index_type, false);
7878 /* Return a representation of ELT_TYPE[NELTS], using indices of type
7879 sizetype. */
7881 tree
7882 build_array_type_nelts (tree elt_type, unsigned HOST_WIDE_INT nelts)
7884 return build_array_type (elt_type, build_index_type (size_int (nelts - 1)));
7887 /* Recursively examines the array elements of TYPE, until a non-array
7888 element type is found. */
7890 tree
7891 strip_array_types (tree type)
7893 while (TREE_CODE (type) == ARRAY_TYPE)
7894 type = TREE_TYPE (type);
7896 return type;
7899 /* Computes the canonical argument types from the argument type list
7900 ARGTYPES.
7902 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
7903 on entry to this function, or if any of the ARGTYPES are
7904 structural.
7906 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
7907 true on entry to this function, or if any of the ARGTYPES are
7908 non-canonical.
7910 Returns a canonical argument list, which may be ARGTYPES when the
7911 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
7912 true) or would not differ from ARGTYPES. */
7914 static tree
7915 maybe_canonicalize_argtypes (tree argtypes,
7916 bool *any_structural_p,
7917 bool *any_noncanonical_p)
7919 tree arg;
7920 bool any_noncanonical_argtypes_p = false;
7922 for (arg = argtypes; arg && !(*any_structural_p); arg = TREE_CHAIN (arg))
7924 if (!TREE_VALUE (arg) || TREE_VALUE (arg) == error_mark_node)
7925 /* Fail gracefully by stating that the type is structural. */
7926 *any_structural_p = true;
7927 else if (TYPE_STRUCTURAL_EQUALITY_P (TREE_VALUE (arg)))
7928 *any_structural_p = true;
7929 else if (TYPE_CANONICAL (TREE_VALUE (arg)) != TREE_VALUE (arg)
7930 || TREE_PURPOSE (arg))
7931 /* If the argument has a default argument, we consider it
7932 non-canonical even though the type itself is canonical.
7933 That way, different variants of function and method types
7934 with default arguments will all point to the variant with
7935 no defaults as their canonical type. */
7936 any_noncanonical_argtypes_p = true;
7939 if (*any_structural_p)
7940 return argtypes;
7942 if (any_noncanonical_argtypes_p)
7944 /* Build the canonical list of argument types. */
7945 tree canon_argtypes = NULL_TREE;
7946 bool is_void = false;
7948 for (arg = argtypes; arg; arg = TREE_CHAIN (arg))
7950 if (arg == void_list_node)
7951 is_void = true;
7952 else
7953 canon_argtypes = tree_cons (NULL_TREE,
7954 TYPE_CANONICAL (TREE_VALUE (arg)),
7955 canon_argtypes);
7958 canon_argtypes = nreverse (canon_argtypes);
7959 if (is_void)
7960 canon_argtypes = chainon (canon_argtypes, void_list_node);
7962 /* There is a non-canonical type. */
7963 *any_noncanonical_p = true;
7964 return canon_argtypes;
7967 /* The canonical argument types are the same as ARGTYPES. */
7968 return argtypes;
7971 /* Construct, lay out and return
7972 the type of functions returning type VALUE_TYPE
7973 given arguments of types ARG_TYPES.
7974 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
7975 are data type nodes for the arguments of the function.
7976 If such a type has already been constructed, reuse it. */
7978 tree
7979 build_function_type (tree value_type, tree arg_types)
7981 tree t;
7982 hashval_t hashcode = 0;
7983 bool any_structural_p, any_noncanonical_p;
7984 tree canon_argtypes;
7986 if (TREE_CODE (value_type) == FUNCTION_TYPE)
7988 error ("function return type cannot be function");
7989 value_type = integer_type_node;
7992 /* Make a node of the sort we want. */
7993 t = make_node (FUNCTION_TYPE);
7994 TREE_TYPE (t) = value_type;
7995 TYPE_ARG_TYPES (t) = arg_types;
7997 /* If we already have such a type, use the old one. */
7998 hashcode = iterative_hash_object (TYPE_HASH (value_type), hashcode);
7999 hashcode = type_hash_list (arg_types, hashcode);
8000 t = type_hash_canon (hashcode, t);
8002 /* Set up the canonical type. */
8003 any_structural_p = TYPE_STRUCTURAL_EQUALITY_P (value_type);
8004 any_noncanonical_p = TYPE_CANONICAL (value_type) != value_type;
8005 canon_argtypes = maybe_canonicalize_argtypes (arg_types,
8006 &any_structural_p,
8007 &any_noncanonical_p);
8008 if (any_structural_p)
8009 SET_TYPE_STRUCTURAL_EQUALITY (t);
8010 else if (any_noncanonical_p)
8011 TYPE_CANONICAL (t) = build_function_type (TYPE_CANONICAL (value_type),
8012 canon_argtypes);
8014 if (!COMPLETE_TYPE_P (t))
8015 layout_type (t);
8016 return t;
8019 /* Build a function type. The RETURN_TYPE is the type returned by the
8020 function. If VAARGS is set, no void_type_node is appended to the
8021 the list. ARGP must be always be terminated be a NULL_TREE. */
8023 static tree
8024 build_function_type_list_1 (bool vaargs, tree return_type, va_list argp)
8026 tree t, args, last;
8028 t = va_arg (argp, tree);
8029 for (args = NULL_TREE; t != NULL_TREE; t = va_arg (argp, tree))
8030 args = tree_cons (NULL_TREE, t, args);
8032 if (vaargs)
8034 last = args;
8035 if (args != NULL_TREE)
8036 args = nreverse (args);
8037 gcc_assert (last != void_list_node);
8039 else if (args == NULL_TREE)
8040 args = void_list_node;
8041 else
8043 last = args;
8044 args = nreverse (args);
8045 TREE_CHAIN (last) = void_list_node;
8047 args = build_function_type (return_type, args);
8049 return args;
8052 /* Build a function type. The RETURN_TYPE is the type returned by the
8053 function. If additional arguments are provided, they are
8054 additional argument types. The list of argument types must always
8055 be terminated by NULL_TREE. */
8057 tree
8058 build_function_type_list (tree return_type, ...)
8060 tree args;
8061 va_list p;
8063 va_start (p, return_type);
8064 args = build_function_type_list_1 (false, return_type, p);
8065 va_end (p);
8066 return args;
8069 /* Build a variable argument function type. The RETURN_TYPE is the
8070 type returned by the function. If additional arguments are provided,
8071 they are additional argument types. The list of argument types must
8072 always be terminated by NULL_TREE. */
8074 tree
8075 build_varargs_function_type_list (tree return_type, ...)
8077 tree args;
8078 va_list p;
8080 va_start (p, return_type);
8081 args = build_function_type_list_1 (true, return_type, p);
8082 va_end (p);
8084 return args;
8087 /* Build a function type. RETURN_TYPE is the type returned by the
8088 function; VAARGS indicates whether the function takes varargs. The
8089 function takes N named arguments, the types of which are provided in
8090 ARG_TYPES. */
8092 static tree
8093 build_function_type_array_1 (bool vaargs, tree return_type, int n,
8094 tree *arg_types)
8096 int i;
8097 tree t = vaargs ? NULL_TREE : void_list_node;
8099 for (i = n - 1; i >= 0; i--)
8100 t = tree_cons (NULL_TREE, arg_types[i], t);
8102 return build_function_type (return_type, t);
8105 /* Build a function type. RETURN_TYPE is the type returned by the
8106 function. The function takes N named arguments, the types of which
8107 are provided in ARG_TYPES. */
8109 tree
8110 build_function_type_array (tree return_type, int n, tree *arg_types)
8112 return build_function_type_array_1 (false, return_type, n, arg_types);
8115 /* Build a variable argument function type. RETURN_TYPE is the type
8116 returned by the function. The function takes N named arguments, the
8117 types of which are provided in ARG_TYPES. */
8119 tree
8120 build_varargs_function_type_array (tree return_type, int n, tree *arg_types)
8122 return build_function_type_array_1 (true, return_type, n, arg_types);
8125 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
8126 and ARGTYPES (a TREE_LIST) are the return type and arguments types
8127 for the method. An implicit additional parameter (of type
8128 pointer-to-BASETYPE) is added to the ARGTYPES. */
8130 tree
8131 build_method_type_directly (tree basetype,
8132 tree rettype,
8133 tree argtypes)
8135 tree t;
8136 tree ptype;
8137 int hashcode = 0;
8138 bool any_structural_p, any_noncanonical_p;
8139 tree canon_argtypes;
8141 /* Make a node of the sort we want. */
8142 t = make_node (METHOD_TYPE);
8144 TYPE_METHOD_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
8145 TREE_TYPE (t) = rettype;
8146 ptype = build_pointer_type (basetype);
8148 /* The actual arglist for this function includes a "hidden" argument
8149 which is "this". Put it into the list of argument types. */
8150 argtypes = tree_cons (NULL_TREE, ptype, argtypes);
8151 TYPE_ARG_TYPES (t) = argtypes;
8153 /* If we already have such a type, use the old one. */
8154 hashcode = iterative_hash_object (TYPE_HASH (basetype), hashcode);
8155 hashcode = iterative_hash_object (TYPE_HASH (rettype), hashcode);
8156 hashcode = type_hash_list (argtypes, hashcode);
8157 t = type_hash_canon (hashcode, t);
8159 /* Set up the canonical type. */
8160 any_structural_p
8161 = (TYPE_STRUCTURAL_EQUALITY_P (basetype)
8162 || TYPE_STRUCTURAL_EQUALITY_P (rettype));
8163 any_noncanonical_p
8164 = (TYPE_CANONICAL (basetype) != basetype
8165 || TYPE_CANONICAL (rettype) != rettype);
8166 canon_argtypes = maybe_canonicalize_argtypes (TREE_CHAIN (argtypes),
8167 &any_structural_p,
8168 &any_noncanonical_p);
8169 if (any_structural_p)
8170 SET_TYPE_STRUCTURAL_EQUALITY (t);
8171 else if (any_noncanonical_p)
8172 TYPE_CANONICAL (t)
8173 = build_method_type_directly (TYPE_CANONICAL (basetype),
8174 TYPE_CANONICAL (rettype),
8175 canon_argtypes);
8176 if (!COMPLETE_TYPE_P (t))
8177 layout_type (t);
8179 return t;
8182 /* Construct, lay out and return the type of methods belonging to class
8183 BASETYPE and whose arguments and values are described by TYPE.
8184 If that type exists already, reuse it.
8185 TYPE must be a FUNCTION_TYPE node. */
8187 tree
8188 build_method_type (tree basetype, tree type)
8190 gcc_assert (TREE_CODE (type) == FUNCTION_TYPE);
8192 return build_method_type_directly (basetype,
8193 TREE_TYPE (type),
8194 TYPE_ARG_TYPES (type));
8197 /* Construct, lay out and return the type of offsets to a value
8198 of type TYPE, within an object of type BASETYPE.
8199 If a suitable offset type exists already, reuse it. */
8201 tree
8202 build_offset_type (tree basetype, tree type)
8204 tree t;
8205 hashval_t hashcode = 0;
8207 /* Make a node of the sort we want. */
8208 t = make_node (OFFSET_TYPE);
8210 TYPE_OFFSET_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
8211 TREE_TYPE (t) = type;
8213 /* If we already have such a type, use the old one. */
8214 hashcode = iterative_hash_object (TYPE_HASH (basetype), hashcode);
8215 hashcode = iterative_hash_object (TYPE_HASH (type), hashcode);
8216 t = type_hash_canon (hashcode, t);
8218 if (!COMPLETE_TYPE_P (t))
8219 layout_type (t);
8221 if (TYPE_CANONICAL (t) == t)
8223 if (TYPE_STRUCTURAL_EQUALITY_P (basetype)
8224 || TYPE_STRUCTURAL_EQUALITY_P (type))
8225 SET_TYPE_STRUCTURAL_EQUALITY (t);
8226 else if (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype)) != basetype
8227 || TYPE_CANONICAL (type) != type)
8228 TYPE_CANONICAL (t)
8229 = build_offset_type (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype)),
8230 TYPE_CANONICAL (type));
8233 return t;
8236 /* Create a complex type whose components are COMPONENT_TYPE. */
8238 tree
8239 build_complex_type (tree component_type)
8241 tree t;
8242 hashval_t hashcode;
8244 gcc_assert (INTEGRAL_TYPE_P (component_type)
8245 || SCALAR_FLOAT_TYPE_P (component_type)
8246 || FIXED_POINT_TYPE_P (component_type));
8248 /* Make a node of the sort we want. */
8249 t = make_node (COMPLEX_TYPE);
8251 TREE_TYPE (t) = TYPE_MAIN_VARIANT (component_type);
8253 /* If we already have such a type, use the old one. */
8254 hashcode = iterative_hash_object (TYPE_HASH (component_type), 0);
8255 t = type_hash_canon (hashcode, t);
8257 if (!COMPLETE_TYPE_P (t))
8258 layout_type (t);
8260 if (TYPE_CANONICAL (t) == t)
8262 if (TYPE_STRUCTURAL_EQUALITY_P (component_type))
8263 SET_TYPE_STRUCTURAL_EQUALITY (t);
8264 else if (TYPE_CANONICAL (component_type) != component_type)
8265 TYPE_CANONICAL (t)
8266 = build_complex_type (TYPE_CANONICAL (component_type));
8269 /* We need to create a name, since complex is a fundamental type. */
8270 if (! TYPE_NAME (t))
8272 const char *name;
8273 if (component_type == char_type_node)
8274 name = "complex char";
8275 else if (component_type == signed_char_type_node)
8276 name = "complex signed char";
8277 else if (component_type == unsigned_char_type_node)
8278 name = "complex unsigned char";
8279 else if (component_type == short_integer_type_node)
8280 name = "complex short int";
8281 else if (component_type == short_unsigned_type_node)
8282 name = "complex short unsigned int";
8283 else if (component_type == integer_type_node)
8284 name = "complex int";
8285 else if (component_type == unsigned_type_node)
8286 name = "complex unsigned int";
8287 else if (component_type == long_integer_type_node)
8288 name = "complex long int";
8289 else if (component_type == long_unsigned_type_node)
8290 name = "complex long unsigned int";
8291 else if (component_type == long_long_integer_type_node)
8292 name = "complex long long int";
8293 else if (component_type == long_long_unsigned_type_node)
8294 name = "complex long long unsigned int";
8295 else
8296 name = 0;
8298 if (name != 0)
8299 TYPE_NAME (t) = build_decl (UNKNOWN_LOCATION, TYPE_DECL,
8300 get_identifier (name), t);
8303 return build_qualified_type (t, TYPE_QUALS (component_type));
8306 /* If TYPE is a real or complex floating-point type and the target
8307 does not directly support arithmetic on TYPE then return the wider
8308 type to be used for arithmetic on TYPE. Otherwise, return
8309 NULL_TREE. */
8311 tree
8312 excess_precision_type (tree type)
8314 if (flag_excess_precision != EXCESS_PRECISION_FAST)
8316 int flt_eval_method = TARGET_FLT_EVAL_METHOD;
8317 switch (TREE_CODE (type))
8319 case REAL_TYPE:
8320 switch (flt_eval_method)
8322 case 1:
8323 if (TYPE_MODE (type) == TYPE_MODE (float_type_node))
8324 return double_type_node;
8325 break;
8326 case 2:
8327 if (TYPE_MODE (type) == TYPE_MODE (float_type_node)
8328 || TYPE_MODE (type) == TYPE_MODE (double_type_node))
8329 return long_double_type_node;
8330 break;
8331 default:
8332 gcc_unreachable ();
8334 break;
8335 case COMPLEX_TYPE:
8336 if (TREE_CODE (TREE_TYPE (type)) != REAL_TYPE)
8337 return NULL_TREE;
8338 switch (flt_eval_method)
8340 case 1:
8341 if (TYPE_MODE (TREE_TYPE (type)) == TYPE_MODE (float_type_node))
8342 return complex_double_type_node;
8343 break;
8344 case 2:
8345 if (TYPE_MODE (TREE_TYPE (type)) == TYPE_MODE (float_type_node)
8346 || (TYPE_MODE (TREE_TYPE (type))
8347 == TYPE_MODE (double_type_node)))
8348 return complex_long_double_type_node;
8349 break;
8350 default:
8351 gcc_unreachable ();
8353 break;
8354 default:
8355 break;
8358 return NULL_TREE;
8361 /* Return OP, stripped of any conversions to wider types as much as is safe.
8362 Converting the value back to OP's type makes a value equivalent to OP.
8364 If FOR_TYPE is nonzero, we return a value which, if converted to
8365 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
8367 OP must have integer, real or enumeral type. Pointers are not allowed!
8369 There are some cases where the obvious value we could return
8370 would regenerate to OP if converted to OP's type,
8371 but would not extend like OP to wider types.
8372 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
8373 For example, if OP is (unsigned short)(signed char)-1,
8374 we avoid returning (signed char)-1 if FOR_TYPE is int,
8375 even though extending that to an unsigned short would regenerate OP,
8376 since the result of extending (signed char)-1 to (int)
8377 is different from (int) OP. */
8379 tree
8380 get_unwidened (tree op, tree for_type)
8382 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
8383 tree type = TREE_TYPE (op);
8384 unsigned final_prec
8385 = TYPE_PRECISION (for_type != 0 ? for_type : type);
8386 int uns
8387 = (for_type != 0 && for_type != type
8388 && final_prec > TYPE_PRECISION (type)
8389 && TYPE_UNSIGNED (type));
8390 tree win = op;
8392 while (CONVERT_EXPR_P (op))
8394 int bitschange;
8396 /* TYPE_PRECISION on vector types has different meaning
8397 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
8398 so avoid them here. */
8399 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op, 0))) == VECTOR_TYPE)
8400 break;
8402 bitschange = TYPE_PRECISION (TREE_TYPE (op))
8403 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0)));
8405 /* Truncations are many-one so cannot be removed.
8406 Unless we are later going to truncate down even farther. */
8407 if (bitschange < 0
8408 && final_prec > TYPE_PRECISION (TREE_TYPE (op)))
8409 break;
8411 /* See what's inside this conversion. If we decide to strip it,
8412 we will set WIN. */
8413 op = TREE_OPERAND (op, 0);
8415 /* If we have not stripped any zero-extensions (uns is 0),
8416 we can strip any kind of extension.
8417 If we have previously stripped a zero-extension,
8418 only zero-extensions can safely be stripped.
8419 Any extension can be stripped if the bits it would produce
8420 are all going to be discarded later by truncating to FOR_TYPE. */
8422 if (bitschange > 0)
8424 if (! uns || final_prec <= TYPE_PRECISION (TREE_TYPE (op)))
8425 win = op;
8426 /* TYPE_UNSIGNED says whether this is a zero-extension.
8427 Let's avoid computing it if it does not affect WIN
8428 and if UNS will not be needed again. */
8429 if ((uns
8430 || CONVERT_EXPR_P (op))
8431 && TYPE_UNSIGNED (TREE_TYPE (op)))
8433 uns = 1;
8434 win = op;
8439 /* If we finally reach a constant see if it fits in for_type and
8440 in that case convert it. */
8441 if (for_type
8442 && TREE_CODE (win) == INTEGER_CST
8443 && TREE_TYPE (win) != for_type
8444 && int_fits_type_p (win, for_type))
8445 win = fold_convert (for_type, win);
8447 return win;
8450 /* Return OP or a simpler expression for a narrower value
8451 which can be sign-extended or zero-extended to give back OP.
8452 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
8453 or 0 if the value should be sign-extended. */
8455 tree
8456 get_narrower (tree op, int *unsignedp_ptr)
8458 int uns = 0;
8459 int first = 1;
8460 tree win = op;
8461 bool integral_p = INTEGRAL_TYPE_P (TREE_TYPE (op));
8463 while (TREE_CODE (op) == NOP_EXPR)
8465 int bitschange
8466 = (TYPE_PRECISION (TREE_TYPE (op))
8467 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0))));
8469 /* Truncations are many-one so cannot be removed. */
8470 if (bitschange < 0)
8471 break;
8473 /* See what's inside this conversion. If we decide to strip it,
8474 we will set WIN. */
8476 if (bitschange > 0)
8478 op = TREE_OPERAND (op, 0);
8479 /* An extension: the outermost one can be stripped,
8480 but remember whether it is zero or sign extension. */
8481 if (first)
8482 uns = TYPE_UNSIGNED (TREE_TYPE (op));
8483 /* Otherwise, if a sign extension has been stripped,
8484 only sign extensions can now be stripped;
8485 if a zero extension has been stripped, only zero-extensions. */
8486 else if (uns != TYPE_UNSIGNED (TREE_TYPE (op)))
8487 break;
8488 first = 0;
8490 else /* bitschange == 0 */
8492 /* A change in nominal type can always be stripped, but we must
8493 preserve the unsignedness. */
8494 if (first)
8495 uns = TYPE_UNSIGNED (TREE_TYPE (op));
8496 first = 0;
8497 op = TREE_OPERAND (op, 0);
8498 /* Keep trying to narrow, but don't assign op to win if it
8499 would turn an integral type into something else. */
8500 if (INTEGRAL_TYPE_P (TREE_TYPE (op)) != integral_p)
8501 continue;
8504 win = op;
8507 if (TREE_CODE (op) == COMPONENT_REF
8508 /* Since type_for_size always gives an integer type. */
8509 && TREE_CODE (TREE_TYPE (op)) != REAL_TYPE
8510 && TREE_CODE (TREE_TYPE (op)) != FIXED_POINT_TYPE
8511 /* Ensure field is laid out already. */
8512 && DECL_SIZE (TREE_OPERAND (op, 1)) != 0
8513 && tree_fits_uhwi_p (DECL_SIZE (TREE_OPERAND (op, 1))))
8515 unsigned HOST_WIDE_INT innerprec
8516 = tree_to_uhwi (DECL_SIZE (TREE_OPERAND (op, 1)));
8517 int unsignedp = (DECL_UNSIGNED (TREE_OPERAND (op, 1))
8518 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op, 1))));
8519 tree type = lang_hooks.types.type_for_size (innerprec, unsignedp);
8521 /* We can get this structure field in a narrower type that fits it,
8522 but the resulting extension to its nominal type (a fullword type)
8523 must satisfy the same conditions as for other extensions.
8525 Do this only for fields that are aligned (not bit-fields),
8526 because when bit-field insns will be used there is no
8527 advantage in doing this. */
8529 if (innerprec < TYPE_PRECISION (TREE_TYPE (op))
8530 && ! DECL_BIT_FIELD (TREE_OPERAND (op, 1))
8531 && (first || uns == DECL_UNSIGNED (TREE_OPERAND (op, 1)))
8532 && type != 0)
8534 if (first)
8535 uns = DECL_UNSIGNED (TREE_OPERAND (op, 1));
8536 win = fold_convert (type, op);
8540 *unsignedp_ptr = uns;
8541 return win;
8544 /* Returns true if integer constant C has a value that is permissible
8545 for type TYPE (an INTEGER_TYPE). */
8547 bool
8548 int_fits_type_p (const_tree c, const_tree type)
8550 tree type_low_bound, type_high_bound;
8551 bool ok_for_low_bound, ok_for_high_bound, unsc;
8552 double_int dc, dd;
8554 dc = tree_to_double_int (c);
8555 unsc = TYPE_UNSIGNED (TREE_TYPE (c));
8557 retry:
8558 type_low_bound = TYPE_MIN_VALUE (type);
8559 type_high_bound = TYPE_MAX_VALUE (type);
8561 /* If at least one bound of the type is a constant integer, we can check
8562 ourselves and maybe make a decision. If no such decision is possible, but
8563 this type is a subtype, try checking against that. Otherwise, use
8564 double_int_fits_to_tree_p, which checks against the precision.
8566 Compute the status for each possibly constant bound, and return if we see
8567 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
8568 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
8569 for "constant known to fit". */
8571 /* Check if c >= type_low_bound. */
8572 if (type_low_bound && TREE_CODE (type_low_bound) == INTEGER_CST)
8574 dd = tree_to_double_int (type_low_bound);
8575 if (unsc != TYPE_UNSIGNED (TREE_TYPE (type_low_bound)))
8577 int c_neg = (!unsc && dc.is_negative ());
8578 int t_neg = (unsc && dd.is_negative ());
8580 if (c_neg && !t_neg)
8581 return false;
8582 if ((c_neg || !t_neg) && dc.ult (dd))
8583 return false;
8585 else if (dc.cmp (dd, unsc) < 0)
8586 return false;
8587 ok_for_low_bound = true;
8589 else
8590 ok_for_low_bound = false;
8592 /* Check if c <= type_high_bound. */
8593 if (type_high_bound && TREE_CODE (type_high_bound) == INTEGER_CST)
8595 dd = tree_to_double_int (type_high_bound);
8596 if (unsc != TYPE_UNSIGNED (TREE_TYPE (type_high_bound)))
8598 int c_neg = (!unsc && dc.is_negative ());
8599 int t_neg = (unsc && dd.is_negative ());
8601 if (t_neg && !c_neg)
8602 return false;
8603 if ((t_neg || !c_neg) && dc.ugt (dd))
8604 return false;
8606 else if (dc.cmp (dd, unsc) > 0)
8607 return false;
8608 ok_for_high_bound = true;
8610 else
8611 ok_for_high_bound = false;
8613 /* If the constant fits both bounds, the result is known. */
8614 if (ok_for_low_bound && ok_for_high_bound)
8615 return true;
8617 /* Perform some generic filtering which may allow making a decision
8618 even if the bounds are not constant. First, negative integers
8619 never fit in unsigned types, */
8620 if (TYPE_UNSIGNED (type) && !unsc && dc.is_negative ())
8621 return false;
8623 /* Second, narrower types always fit in wider ones. */
8624 if (TYPE_PRECISION (type) > TYPE_PRECISION (TREE_TYPE (c)))
8625 return true;
8627 /* Third, unsigned integers with top bit set never fit signed types. */
8628 if (! TYPE_UNSIGNED (type) && unsc)
8630 int prec = GET_MODE_PRECISION (TYPE_MODE (TREE_TYPE (c))) - 1;
8631 if (prec < HOST_BITS_PER_WIDE_INT)
8633 if (((((unsigned HOST_WIDE_INT) 1) << prec) & dc.low) != 0)
8634 return false;
8636 else if (((((unsigned HOST_WIDE_INT) 1)
8637 << (prec - HOST_BITS_PER_WIDE_INT)) & dc.high) != 0)
8638 return false;
8641 /* If we haven't been able to decide at this point, there nothing more we
8642 can check ourselves here. Look at the base type if we have one and it
8643 has the same precision. */
8644 if (TREE_CODE (type) == INTEGER_TYPE
8645 && TREE_TYPE (type) != 0
8646 && TYPE_PRECISION (type) == TYPE_PRECISION (TREE_TYPE (type)))
8648 type = TREE_TYPE (type);
8649 goto retry;
8652 /* Or to double_int_fits_to_tree_p, if nothing else. */
8653 return double_int_fits_to_tree_p (type, dc);
8656 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
8657 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
8658 represented (assuming two's-complement arithmetic) within the bit
8659 precision of the type are returned instead. */
8661 void
8662 get_type_static_bounds (const_tree type, mpz_t min, mpz_t max)
8664 if (!POINTER_TYPE_P (type) && TYPE_MIN_VALUE (type)
8665 && TREE_CODE (TYPE_MIN_VALUE (type)) == INTEGER_CST)
8666 mpz_set_double_int (min, tree_to_double_int (TYPE_MIN_VALUE (type)),
8667 TYPE_UNSIGNED (type));
8668 else
8670 if (TYPE_UNSIGNED (type))
8671 mpz_set_ui (min, 0);
8672 else
8674 double_int mn;
8675 mn = double_int::mask (TYPE_PRECISION (type) - 1);
8676 mn = (mn + double_int_one).sext (TYPE_PRECISION (type));
8677 mpz_set_double_int (min, mn, false);
8681 if (!POINTER_TYPE_P (type) && TYPE_MAX_VALUE (type)
8682 && TREE_CODE (TYPE_MAX_VALUE (type)) == INTEGER_CST)
8683 mpz_set_double_int (max, tree_to_double_int (TYPE_MAX_VALUE (type)),
8684 TYPE_UNSIGNED (type));
8685 else
8687 if (TYPE_UNSIGNED (type))
8688 mpz_set_double_int (max, double_int::mask (TYPE_PRECISION (type)),
8689 true);
8690 else
8691 mpz_set_double_int (max, double_int::mask (TYPE_PRECISION (type) - 1),
8692 true);
8696 /* Return true if VAR is an automatic variable defined in function FN. */
8698 bool
8699 auto_var_in_fn_p (const_tree var, const_tree fn)
8701 return (DECL_P (var) && DECL_CONTEXT (var) == fn
8702 && ((((TREE_CODE (var) == VAR_DECL && ! DECL_EXTERNAL (var))
8703 || TREE_CODE (var) == PARM_DECL)
8704 && ! TREE_STATIC (var))
8705 || TREE_CODE (var) == LABEL_DECL
8706 || TREE_CODE (var) == RESULT_DECL));
8709 /* Subprogram of following function. Called by walk_tree.
8711 Return *TP if it is an automatic variable or parameter of the
8712 function passed in as DATA. */
8714 static tree
8715 find_var_from_fn (tree *tp, int *walk_subtrees, void *data)
8717 tree fn = (tree) data;
8719 if (TYPE_P (*tp))
8720 *walk_subtrees = 0;
8722 else if (DECL_P (*tp)
8723 && auto_var_in_fn_p (*tp, fn))
8724 return *tp;
8726 return NULL_TREE;
8729 /* Returns true if T is, contains, or refers to a type with variable
8730 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
8731 arguments, but not the return type. If FN is nonzero, only return
8732 true if a modifier of the type or position of FN is a variable or
8733 parameter inside FN.
8735 This concept is more general than that of C99 'variably modified types':
8736 in C99, a struct type is never variably modified because a VLA may not
8737 appear as a structure member. However, in GNU C code like:
8739 struct S { int i[f()]; };
8741 is valid, and other languages may define similar constructs. */
8743 bool
8744 variably_modified_type_p (tree type, tree fn)
8746 tree t;
8748 /* Test if T is either variable (if FN is zero) or an expression containing
8749 a variable in FN. If TYPE isn't gimplified, return true also if
8750 gimplify_one_sizepos would gimplify the expression into a local
8751 variable. */
8752 #define RETURN_TRUE_IF_VAR(T) \
8753 do { tree _t = (T); \
8754 if (_t != NULL_TREE \
8755 && _t != error_mark_node \
8756 && TREE_CODE (_t) != INTEGER_CST \
8757 && TREE_CODE (_t) != PLACEHOLDER_EXPR \
8758 && (!fn \
8759 || (!TYPE_SIZES_GIMPLIFIED (type) \
8760 && !is_gimple_sizepos (_t)) \
8761 || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
8762 return true; } while (0)
8764 if (type == error_mark_node)
8765 return false;
8767 /* If TYPE itself has variable size, it is variably modified. */
8768 RETURN_TRUE_IF_VAR (TYPE_SIZE (type));
8769 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type));
8771 switch (TREE_CODE (type))
8773 case POINTER_TYPE:
8774 case REFERENCE_TYPE:
8775 case VECTOR_TYPE:
8776 if (variably_modified_type_p (TREE_TYPE (type), fn))
8777 return true;
8778 break;
8780 case FUNCTION_TYPE:
8781 case METHOD_TYPE:
8782 /* If TYPE is a function type, it is variably modified if the
8783 return type is variably modified. */
8784 if (variably_modified_type_p (TREE_TYPE (type), fn))
8785 return true;
8786 break;
8788 case INTEGER_TYPE:
8789 case REAL_TYPE:
8790 case FIXED_POINT_TYPE:
8791 case ENUMERAL_TYPE:
8792 case BOOLEAN_TYPE:
8793 /* Scalar types are variably modified if their end points
8794 aren't constant. */
8795 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type));
8796 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type));
8797 break;
8799 case RECORD_TYPE:
8800 case UNION_TYPE:
8801 case QUAL_UNION_TYPE:
8802 /* We can't see if any of the fields are variably-modified by the
8803 definition we normally use, since that would produce infinite
8804 recursion via pointers. */
8805 /* This is variably modified if some field's type is. */
8806 for (t = TYPE_FIELDS (type); t; t = DECL_CHAIN (t))
8807 if (TREE_CODE (t) == FIELD_DECL)
8809 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t));
8810 RETURN_TRUE_IF_VAR (DECL_SIZE (t));
8811 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t));
8813 if (TREE_CODE (type) == QUAL_UNION_TYPE)
8814 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t));
8816 break;
8818 case ARRAY_TYPE:
8819 /* Do not call ourselves to avoid infinite recursion. This is
8820 variably modified if the element type is. */
8821 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type)));
8822 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type)));
8823 break;
8825 default:
8826 break;
8829 /* The current language may have other cases to check, but in general,
8830 all other types are not variably modified. */
8831 return lang_hooks.tree_inlining.var_mod_type_p (type, fn);
8833 #undef RETURN_TRUE_IF_VAR
8836 /* Given a DECL or TYPE, return the scope in which it was declared, or
8837 NULL_TREE if there is no containing scope. */
8839 tree
8840 get_containing_scope (const_tree t)
8842 return (TYPE_P (t) ? TYPE_CONTEXT (t) : DECL_CONTEXT (t));
8845 /* Return the innermost context enclosing DECL that is
8846 a FUNCTION_DECL, or zero if none. */
8848 tree
8849 decl_function_context (const_tree decl)
8851 tree context;
8853 if (TREE_CODE (decl) == ERROR_MARK)
8854 return 0;
8856 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
8857 where we look up the function at runtime. Such functions always take
8858 a first argument of type 'pointer to real context'.
8860 C++ should really be fixed to use DECL_CONTEXT for the real context,
8861 and use something else for the "virtual context". */
8862 else if (TREE_CODE (decl) == FUNCTION_DECL && DECL_VINDEX (decl))
8863 context
8864 = TYPE_MAIN_VARIANT
8865 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl)))));
8866 else
8867 context = DECL_CONTEXT (decl);
8869 while (context && TREE_CODE (context) != FUNCTION_DECL)
8871 if (TREE_CODE (context) == BLOCK)
8872 context = BLOCK_SUPERCONTEXT (context);
8873 else
8874 context = get_containing_scope (context);
8877 return context;
8880 /* Return the innermost context enclosing DECL that is
8881 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
8882 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
8884 tree
8885 decl_type_context (const_tree decl)
8887 tree context = DECL_CONTEXT (decl);
8889 while (context)
8890 switch (TREE_CODE (context))
8892 case NAMESPACE_DECL:
8893 case TRANSLATION_UNIT_DECL:
8894 return NULL_TREE;
8896 case RECORD_TYPE:
8897 case UNION_TYPE:
8898 case QUAL_UNION_TYPE:
8899 return context;
8901 case TYPE_DECL:
8902 case FUNCTION_DECL:
8903 context = DECL_CONTEXT (context);
8904 break;
8906 case BLOCK:
8907 context = BLOCK_SUPERCONTEXT (context);
8908 break;
8910 default:
8911 gcc_unreachable ();
8914 return NULL_TREE;
8917 /* CALL is a CALL_EXPR. Return the declaration for the function
8918 called, or NULL_TREE if the called function cannot be
8919 determined. */
8921 tree
8922 get_callee_fndecl (const_tree call)
8924 tree addr;
8926 if (call == error_mark_node)
8927 return error_mark_node;
8929 /* It's invalid to call this function with anything but a
8930 CALL_EXPR. */
8931 gcc_assert (TREE_CODE (call) == CALL_EXPR);
8933 /* The first operand to the CALL is the address of the function
8934 called. */
8935 addr = CALL_EXPR_FN (call);
8937 STRIP_NOPS (addr);
8939 /* If this is a readonly function pointer, extract its initial value. */
8940 if (DECL_P (addr) && TREE_CODE (addr) != FUNCTION_DECL
8941 && TREE_READONLY (addr) && ! TREE_THIS_VOLATILE (addr)
8942 && DECL_INITIAL (addr))
8943 addr = DECL_INITIAL (addr);
8945 /* If the address is just `&f' for some function `f', then we know
8946 that `f' is being called. */
8947 if (TREE_CODE (addr) == ADDR_EXPR
8948 && TREE_CODE (TREE_OPERAND (addr, 0)) == FUNCTION_DECL)
8949 return TREE_OPERAND (addr, 0);
8951 /* We couldn't figure out what was being called. */
8952 return NULL_TREE;
8955 /* Print debugging information about tree nodes generated during the compile,
8956 and any language-specific information. */
8958 void
8959 dump_tree_statistics (void)
8961 if (GATHER_STATISTICS)
8963 int i;
8964 int total_nodes, total_bytes;
8965 fprintf (stderr, "Kind Nodes Bytes\n");
8966 fprintf (stderr, "---------------------------------------\n");
8967 total_nodes = total_bytes = 0;
8968 for (i = 0; i < (int) all_kinds; i++)
8970 fprintf (stderr, "%-20s %7d %10d\n", tree_node_kind_names[i],
8971 tree_node_counts[i], tree_node_sizes[i]);
8972 total_nodes += tree_node_counts[i];
8973 total_bytes += tree_node_sizes[i];
8975 fprintf (stderr, "---------------------------------------\n");
8976 fprintf (stderr, "%-20s %7d %10d\n", "Total", total_nodes, total_bytes);
8977 fprintf (stderr, "---------------------------------------\n");
8978 fprintf (stderr, "Code Nodes\n");
8979 fprintf (stderr, "----------------------------\n");
8980 for (i = 0; i < (int) MAX_TREE_CODES; i++)
8981 fprintf (stderr, "%-20s %7d\n", get_tree_code_name ((enum tree_code) i),
8982 tree_code_counts[i]);
8983 fprintf (stderr, "----------------------------\n");
8984 ssanames_print_statistics ();
8985 phinodes_print_statistics ();
8987 else
8988 fprintf (stderr, "(No per-node statistics)\n");
8990 print_type_hash_statistics ();
8991 print_debug_expr_statistics ();
8992 print_value_expr_statistics ();
8993 lang_hooks.print_statistics ();
8996 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
8998 /* Generate a crc32 of a byte. */
9000 static unsigned
9001 crc32_unsigned_bits (unsigned chksum, unsigned value, unsigned bits)
9003 unsigned ix;
9005 for (ix = bits; ix--; value <<= 1)
9007 unsigned feedback;
9009 feedback = (value ^ chksum) & 0x80000000 ? 0x04c11db7 : 0;
9010 chksum <<= 1;
9011 chksum ^= feedback;
9013 return chksum;
9016 /* Generate a crc32 of a 32-bit unsigned. */
9018 unsigned
9019 crc32_unsigned (unsigned chksum, unsigned value)
9021 return crc32_unsigned_bits (chksum, value, 32);
9024 /* Generate a crc32 of a byte. */
9026 unsigned
9027 crc32_byte (unsigned chksum, char byte)
9029 return crc32_unsigned_bits (chksum, (unsigned) byte << 24, 8);
9032 /* Generate a crc32 of a string. */
9034 unsigned
9035 crc32_string (unsigned chksum, const char *string)
9039 chksum = crc32_byte (chksum, *string);
9041 while (*string++);
9042 return chksum;
9045 /* P is a string that will be used in a symbol. Mask out any characters
9046 that are not valid in that context. */
9048 void
9049 clean_symbol_name (char *p)
9051 for (; *p; p++)
9052 if (! (ISALNUM (*p)
9053 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
9054 || *p == '$'
9055 #endif
9056 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
9057 || *p == '.'
9058 #endif
9060 *p = '_';
9063 /* Generate a name for a special-purpose function.
9064 The generated name may need to be unique across the whole link.
9065 Changes to this function may also require corresponding changes to
9066 xstrdup_mask_random.
9067 TYPE is some string to identify the purpose of this function to the
9068 linker or collect2; it must start with an uppercase letter,
9069 one of:
9070 I - for constructors
9071 D - for destructors
9072 N - for C++ anonymous namespaces
9073 F - for DWARF unwind frame information. */
9075 tree
9076 get_file_function_name (const char *type)
9078 char *buf;
9079 const char *p;
9080 char *q;
9082 /* If we already have a name we know to be unique, just use that. */
9083 if (first_global_object_name)
9084 p = q = ASTRDUP (first_global_object_name);
9085 /* If the target is handling the constructors/destructors, they
9086 will be local to this file and the name is only necessary for
9087 debugging purposes.
9088 We also assign sub_I and sub_D sufixes to constructors called from
9089 the global static constructors. These are always local. */
9090 else if (((type[0] == 'I' || type[0] == 'D') && targetm.have_ctors_dtors)
9091 || (strncmp (type, "sub_", 4) == 0
9092 && (type[4] == 'I' || type[4] == 'D')))
9094 const char *file = main_input_filename;
9095 if (! file)
9096 file = LOCATION_FILE (input_location);
9097 /* Just use the file's basename, because the full pathname
9098 might be quite long. */
9099 p = q = ASTRDUP (lbasename (file));
9101 else
9103 /* Otherwise, the name must be unique across the entire link.
9104 We don't have anything that we know to be unique to this translation
9105 unit, so use what we do have and throw in some randomness. */
9106 unsigned len;
9107 const char *name = weak_global_object_name;
9108 const char *file = main_input_filename;
9110 if (! name)
9111 name = "";
9112 if (! file)
9113 file = LOCATION_FILE (input_location);
9115 len = strlen (file);
9116 q = (char *) alloca (9 + 17 + len + 1);
9117 memcpy (q, file, len + 1);
9119 snprintf (q + len, 9 + 17 + 1, "_%08X_" HOST_WIDE_INT_PRINT_HEX,
9120 crc32_string (0, name), get_random_seed (false));
9122 p = q;
9125 clean_symbol_name (q);
9126 buf = (char *) alloca (sizeof (FILE_FUNCTION_FORMAT) + strlen (p)
9127 + strlen (type));
9129 /* Set up the name of the file-level functions we may need.
9130 Use a global object (which is already required to be unique over
9131 the program) rather than the file name (which imposes extra
9132 constraints). */
9133 sprintf (buf, FILE_FUNCTION_FORMAT, type, p);
9135 return get_identifier (buf);
9138 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
9140 /* Complain that the tree code of NODE does not match the expected 0
9141 terminated list of trailing codes. The trailing code list can be
9142 empty, for a more vague error message. FILE, LINE, and FUNCTION
9143 are of the caller. */
9145 void
9146 tree_check_failed (const_tree node, const char *file,
9147 int line, const char *function, ...)
9149 va_list args;
9150 const char *buffer;
9151 unsigned length = 0;
9152 enum tree_code code;
9154 va_start (args, function);
9155 while ((code = (enum tree_code) va_arg (args, int)))
9156 length += 4 + strlen (get_tree_code_name (code));
9157 va_end (args);
9158 if (length)
9160 char *tmp;
9161 va_start (args, function);
9162 length += strlen ("expected ");
9163 buffer = tmp = (char *) alloca (length);
9164 length = 0;
9165 while ((code = (enum tree_code) va_arg (args, int)))
9167 const char *prefix = length ? " or " : "expected ";
9169 strcpy (tmp + length, prefix);
9170 length += strlen (prefix);
9171 strcpy (tmp + length, get_tree_code_name (code));
9172 length += strlen (get_tree_code_name (code));
9174 va_end (args);
9176 else
9177 buffer = "unexpected node";
9179 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9180 buffer, get_tree_code_name (TREE_CODE (node)),
9181 function, trim_filename (file), line);
9184 /* Complain that the tree code of NODE does match the expected 0
9185 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
9186 the caller. */
9188 void
9189 tree_not_check_failed (const_tree node, const char *file,
9190 int line, const char *function, ...)
9192 va_list args;
9193 char *buffer;
9194 unsigned length = 0;
9195 enum tree_code code;
9197 va_start (args, function);
9198 while ((code = (enum tree_code) va_arg (args, int)))
9199 length += 4 + strlen (get_tree_code_name (code));
9200 va_end (args);
9201 va_start (args, function);
9202 buffer = (char *) alloca (length);
9203 length = 0;
9204 while ((code = (enum tree_code) va_arg (args, int)))
9206 if (length)
9208 strcpy (buffer + length, " or ");
9209 length += 4;
9211 strcpy (buffer + length, get_tree_code_name (code));
9212 length += strlen (get_tree_code_name (code));
9214 va_end (args);
9216 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
9217 buffer, get_tree_code_name (TREE_CODE (node)),
9218 function, trim_filename (file), line);
9221 /* Similar to tree_check_failed, except that we check for a class of tree
9222 code, given in CL. */
9224 void
9225 tree_class_check_failed (const_tree node, const enum tree_code_class cl,
9226 const char *file, int line, const char *function)
9228 internal_error
9229 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
9230 TREE_CODE_CLASS_STRING (cl),
9231 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node))),
9232 get_tree_code_name (TREE_CODE (node)), function, trim_filename (file), line);
9235 /* Similar to tree_check_failed, except that instead of specifying a
9236 dozen codes, use the knowledge that they're all sequential. */
9238 void
9239 tree_range_check_failed (const_tree node, const char *file, int line,
9240 const char *function, enum tree_code c1,
9241 enum tree_code c2)
9243 char *buffer;
9244 unsigned length = 0;
9245 unsigned int c;
9247 for (c = c1; c <= c2; ++c)
9248 length += 4 + strlen (get_tree_code_name ((enum tree_code) c));
9250 length += strlen ("expected ");
9251 buffer = (char *) alloca (length);
9252 length = 0;
9254 for (c = c1; c <= c2; ++c)
9256 const char *prefix = length ? " or " : "expected ";
9258 strcpy (buffer + length, prefix);
9259 length += strlen (prefix);
9260 strcpy (buffer + length, get_tree_code_name ((enum tree_code) c));
9261 length += strlen (get_tree_code_name ((enum tree_code) c));
9264 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9265 buffer, get_tree_code_name (TREE_CODE (node)),
9266 function, trim_filename (file), line);
9270 /* Similar to tree_check_failed, except that we check that a tree does
9271 not have the specified code, given in CL. */
9273 void
9274 tree_not_class_check_failed (const_tree node, const enum tree_code_class cl,
9275 const char *file, int line, const char *function)
9277 internal_error
9278 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
9279 TREE_CODE_CLASS_STRING (cl),
9280 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node))),
9281 get_tree_code_name (TREE_CODE (node)), function, trim_filename (file), line);
9285 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
9287 void
9288 omp_clause_check_failed (const_tree node, const char *file, int line,
9289 const char *function, enum omp_clause_code code)
9291 internal_error ("tree check: expected omp_clause %s, have %s in %s, at %s:%d",
9292 omp_clause_code_name[code], get_tree_code_name (TREE_CODE (node)),
9293 function, trim_filename (file), line);
9297 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
9299 void
9300 omp_clause_range_check_failed (const_tree node, const char *file, int line,
9301 const char *function, enum omp_clause_code c1,
9302 enum omp_clause_code c2)
9304 char *buffer;
9305 unsigned length = 0;
9306 unsigned int c;
9308 for (c = c1; c <= c2; ++c)
9309 length += 4 + strlen (omp_clause_code_name[c]);
9311 length += strlen ("expected ");
9312 buffer = (char *) alloca (length);
9313 length = 0;
9315 for (c = c1; c <= c2; ++c)
9317 const char *prefix = length ? " or " : "expected ";
9319 strcpy (buffer + length, prefix);
9320 length += strlen (prefix);
9321 strcpy (buffer + length, omp_clause_code_name[c]);
9322 length += strlen (omp_clause_code_name[c]);
9325 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9326 buffer, omp_clause_code_name[TREE_CODE (node)],
9327 function, trim_filename (file), line);
9331 #undef DEFTREESTRUCT
9332 #define DEFTREESTRUCT(VAL, NAME) NAME,
9334 static const char *ts_enum_names[] = {
9335 #include "treestruct.def"
9337 #undef DEFTREESTRUCT
9339 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
9341 /* Similar to tree_class_check_failed, except that we check for
9342 whether CODE contains the tree structure identified by EN. */
9344 void
9345 tree_contains_struct_check_failed (const_tree node,
9346 const enum tree_node_structure_enum en,
9347 const char *file, int line,
9348 const char *function)
9350 internal_error
9351 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
9352 TS_ENUM_NAME (en),
9353 get_tree_code_name (TREE_CODE (node)), function, trim_filename (file), line);
9357 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9358 (dynamically sized) vector. */
9360 void
9361 tree_vec_elt_check_failed (int idx, int len, const char *file, int line,
9362 const char *function)
9364 internal_error
9365 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
9366 idx + 1, len, function, trim_filename (file), line);
9369 /* Similar to above, except that the check is for the bounds of the operand
9370 vector of an expression node EXP. */
9372 void
9373 tree_operand_check_failed (int idx, const_tree exp, const char *file,
9374 int line, const char *function)
9376 enum tree_code code = TREE_CODE (exp);
9377 internal_error
9378 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
9379 idx + 1, get_tree_code_name (code), TREE_OPERAND_LENGTH (exp),
9380 function, trim_filename (file), line);
9383 /* Similar to above, except that the check is for the number of
9384 operands of an OMP_CLAUSE node. */
9386 void
9387 omp_clause_operand_check_failed (int idx, const_tree t, const char *file,
9388 int line, const char *function)
9390 internal_error
9391 ("tree check: accessed operand %d of omp_clause %s with %d operands "
9392 "in %s, at %s:%d", idx + 1, omp_clause_code_name[OMP_CLAUSE_CODE (t)],
9393 omp_clause_num_ops [OMP_CLAUSE_CODE (t)], function,
9394 trim_filename (file), line);
9396 #endif /* ENABLE_TREE_CHECKING */
9398 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
9399 and mapped to the machine mode MODE. Initialize its fields and build
9400 the information necessary for debugging output. */
9402 static tree
9403 make_vector_type (tree innertype, int nunits, enum machine_mode mode)
9405 tree t;
9406 hashval_t hashcode = 0;
9408 t = make_node (VECTOR_TYPE);
9409 TREE_TYPE (t) = TYPE_MAIN_VARIANT (innertype);
9410 SET_TYPE_VECTOR_SUBPARTS (t, nunits);
9411 SET_TYPE_MODE (t, mode);
9413 if (TYPE_STRUCTURAL_EQUALITY_P (innertype))
9414 SET_TYPE_STRUCTURAL_EQUALITY (t);
9415 else if (TYPE_CANONICAL (innertype) != innertype
9416 || mode != VOIDmode)
9417 TYPE_CANONICAL (t)
9418 = make_vector_type (TYPE_CANONICAL (innertype), nunits, VOIDmode);
9420 layout_type (t);
9422 hashcode = iterative_hash_host_wide_int (VECTOR_TYPE, hashcode);
9423 hashcode = iterative_hash_host_wide_int (nunits, hashcode);
9424 hashcode = iterative_hash_host_wide_int (mode, hashcode);
9425 hashcode = iterative_hash_object (TYPE_HASH (TREE_TYPE (t)), hashcode);
9426 t = type_hash_canon (hashcode, t);
9428 /* We have built a main variant, based on the main variant of the
9429 inner type. Use it to build the variant we return. */
9430 if ((TYPE_ATTRIBUTES (innertype) || TYPE_QUALS (innertype))
9431 && TREE_TYPE (t) != innertype)
9432 return build_type_attribute_qual_variant (t,
9433 TYPE_ATTRIBUTES (innertype),
9434 TYPE_QUALS (innertype));
9436 return t;
9439 static tree
9440 make_or_reuse_type (unsigned size, int unsignedp)
9442 if (size == INT_TYPE_SIZE)
9443 return unsignedp ? unsigned_type_node : integer_type_node;
9444 if (size == CHAR_TYPE_SIZE)
9445 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
9446 if (size == SHORT_TYPE_SIZE)
9447 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
9448 if (size == LONG_TYPE_SIZE)
9449 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
9450 if (size == LONG_LONG_TYPE_SIZE)
9451 return (unsignedp ? long_long_unsigned_type_node
9452 : long_long_integer_type_node);
9453 if (size == 128 && int128_integer_type_node)
9454 return (unsignedp ? int128_unsigned_type_node
9455 : int128_integer_type_node);
9457 if (unsignedp)
9458 return make_unsigned_type (size);
9459 else
9460 return make_signed_type (size);
9463 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
9465 static tree
9466 make_or_reuse_fract_type (unsigned size, int unsignedp, int satp)
9468 if (satp)
9470 if (size == SHORT_FRACT_TYPE_SIZE)
9471 return unsignedp ? sat_unsigned_short_fract_type_node
9472 : sat_short_fract_type_node;
9473 if (size == FRACT_TYPE_SIZE)
9474 return unsignedp ? sat_unsigned_fract_type_node : sat_fract_type_node;
9475 if (size == LONG_FRACT_TYPE_SIZE)
9476 return unsignedp ? sat_unsigned_long_fract_type_node
9477 : sat_long_fract_type_node;
9478 if (size == LONG_LONG_FRACT_TYPE_SIZE)
9479 return unsignedp ? sat_unsigned_long_long_fract_type_node
9480 : sat_long_long_fract_type_node;
9482 else
9484 if (size == SHORT_FRACT_TYPE_SIZE)
9485 return unsignedp ? unsigned_short_fract_type_node
9486 : short_fract_type_node;
9487 if (size == FRACT_TYPE_SIZE)
9488 return unsignedp ? unsigned_fract_type_node : fract_type_node;
9489 if (size == LONG_FRACT_TYPE_SIZE)
9490 return unsignedp ? unsigned_long_fract_type_node
9491 : long_fract_type_node;
9492 if (size == LONG_LONG_FRACT_TYPE_SIZE)
9493 return unsignedp ? unsigned_long_long_fract_type_node
9494 : long_long_fract_type_node;
9497 return make_fract_type (size, unsignedp, satp);
9500 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
9502 static tree
9503 make_or_reuse_accum_type (unsigned size, int unsignedp, int satp)
9505 if (satp)
9507 if (size == SHORT_ACCUM_TYPE_SIZE)
9508 return unsignedp ? sat_unsigned_short_accum_type_node
9509 : sat_short_accum_type_node;
9510 if (size == ACCUM_TYPE_SIZE)
9511 return unsignedp ? sat_unsigned_accum_type_node : sat_accum_type_node;
9512 if (size == LONG_ACCUM_TYPE_SIZE)
9513 return unsignedp ? sat_unsigned_long_accum_type_node
9514 : sat_long_accum_type_node;
9515 if (size == LONG_LONG_ACCUM_TYPE_SIZE)
9516 return unsignedp ? sat_unsigned_long_long_accum_type_node
9517 : sat_long_long_accum_type_node;
9519 else
9521 if (size == SHORT_ACCUM_TYPE_SIZE)
9522 return unsignedp ? unsigned_short_accum_type_node
9523 : short_accum_type_node;
9524 if (size == ACCUM_TYPE_SIZE)
9525 return unsignedp ? unsigned_accum_type_node : accum_type_node;
9526 if (size == LONG_ACCUM_TYPE_SIZE)
9527 return unsignedp ? unsigned_long_accum_type_node
9528 : long_accum_type_node;
9529 if (size == LONG_LONG_ACCUM_TYPE_SIZE)
9530 return unsignedp ? unsigned_long_long_accum_type_node
9531 : long_long_accum_type_node;
9534 return make_accum_type (size, unsignedp, satp);
9538 /* Create an atomic variant node for TYPE. This routine is called
9539 during initialization of data types to create the 5 basic atomic
9540 types. The generic build_variant_type function requires these to
9541 already be set up in order to function properly, so cannot be
9542 called from there. If ALIGN is non-zero, then ensure alignment is
9543 overridden to this value. */
9545 static tree
9546 build_atomic_base (tree type, unsigned int align)
9548 tree t;
9550 /* Make sure its not already registered. */
9551 if ((t = get_qualified_type (type, TYPE_QUAL_ATOMIC)))
9552 return t;
9554 t = build_variant_type_copy (type);
9555 set_type_quals (t, TYPE_QUAL_ATOMIC);
9557 if (align)
9558 TYPE_ALIGN (t) = align;
9560 return t;
9563 /* Create nodes for all integer types (and error_mark_node) using the sizes
9564 of C datatypes. SIGNED_CHAR specifies whether char is signed,
9565 SHORT_DOUBLE specifies whether double should be of the same precision
9566 as float. */
9568 void
9569 build_common_tree_nodes (bool signed_char, bool short_double)
9571 error_mark_node = make_node (ERROR_MARK);
9572 TREE_TYPE (error_mark_node) = error_mark_node;
9574 initialize_sizetypes ();
9576 /* Define both `signed char' and `unsigned char'. */
9577 signed_char_type_node = make_signed_type (CHAR_TYPE_SIZE);
9578 TYPE_STRING_FLAG (signed_char_type_node) = 1;
9579 unsigned_char_type_node = make_unsigned_type (CHAR_TYPE_SIZE);
9580 TYPE_STRING_FLAG (unsigned_char_type_node) = 1;
9582 /* Define `char', which is like either `signed char' or `unsigned char'
9583 but not the same as either. */
9584 char_type_node
9585 = (signed_char
9586 ? make_signed_type (CHAR_TYPE_SIZE)
9587 : make_unsigned_type (CHAR_TYPE_SIZE));
9588 TYPE_STRING_FLAG (char_type_node) = 1;
9590 short_integer_type_node = make_signed_type (SHORT_TYPE_SIZE);
9591 short_unsigned_type_node = make_unsigned_type (SHORT_TYPE_SIZE);
9592 integer_type_node = make_signed_type (INT_TYPE_SIZE);
9593 unsigned_type_node = make_unsigned_type (INT_TYPE_SIZE);
9594 long_integer_type_node = make_signed_type (LONG_TYPE_SIZE);
9595 long_unsigned_type_node = make_unsigned_type (LONG_TYPE_SIZE);
9596 long_long_integer_type_node = make_signed_type (LONG_LONG_TYPE_SIZE);
9597 long_long_unsigned_type_node = make_unsigned_type (LONG_LONG_TYPE_SIZE);
9598 #if HOST_BITS_PER_WIDE_INT >= 64
9599 /* TODO: This isn't correct, but as logic depends at the moment on
9600 host's instead of target's wide-integer.
9601 If there is a target not supporting TImode, but has an 128-bit
9602 integer-scalar register, this target check needs to be adjusted. */
9603 if (targetm.scalar_mode_supported_p (TImode))
9605 int128_integer_type_node = make_signed_type (128);
9606 int128_unsigned_type_node = make_unsigned_type (128);
9608 #endif
9610 /* Define a boolean type. This type only represents boolean values but
9611 may be larger than char depending on the value of BOOL_TYPE_SIZE.
9612 Front ends which want to override this size (i.e. Java) can redefine
9613 boolean_type_node before calling build_common_tree_nodes_2. */
9614 boolean_type_node = make_unsigned_type (BOOL_TYPE_SIZE);
9615 TREE_SET_CODE (boolean_type_node, BOOLEAN_TYPE);
9616 TYPE_MAX_VALUE (boolean_type_node) = build_int_cst (boolean_type_node, 1);
9617 TYPE_PRECISION (boolean_type_node) = 1;
9619 /* Define what type to use for size_t. */
9620 if (strcmp (SIZE_TYPE, "unsigned int") == 0)
9621 size_type_node = unsigned_type_node;
9622 else if (strcmp (SIZE_TYPE, "long unsigned int") == 0)
9623 size_type_node = long_unsigned_type_node;
9624 else if (strcmp (SIZE_TYPE, "long long unsigned int") == 0)
9625 size_type_node = long_long_unsigned_type_node;
9626 else if (strcmp (SIZE_TYPE, "short unsigned int") == 0)
9627 size_type_node = short_unsigned_type_node;
9628 else
9629 gcc_unreachable ();
9631 /* Fill in the rest of the sized types. Reuse existing type nodes
9632 when possible. */
9633 intQI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (QImode), 0);
9634 intHI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (HImode), 0);
9635 intSI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (SImode), 0);
9636 intDI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (DImode), 0);
9637 intTI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (TImode), 0);
9639 unsigned_intQI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (QImode), 1);
9640 unsigned_intHI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (HImode), 1);
9641 unsigned_intSI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (SImode), 1);
9642 unsigned_intDI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (DImode), 1);
9643 unsigned_intTI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (TImode), 1);
9645 /* Don't call build_qualified type for atomics. That routine does
9646 special processing for atomics, and until they are initialized
9647 it's better not to make that call.
9649 Check to see if there is a target override for atomic types. */
9651 atomicQI_type_node = build_atomic_base (unsigned_intQI_type_node,
9652 targetm.atomic_align_for_mode (QImode));
9653 atomicHI_type_node = build_atomic_base (unsigned_intHI_type_node,
9654 targetm.atomic_align_for_mode (HImode));
9655 atomicSI_type_node = build_atomic_base (unsigned_intSI_type_node,
9656 targetm.atomic_align_for_mode (SImode));
9657 atomicDI_type_node = build_atomic_base (unsigned_intDI_type_node,
9658 targetm.atomic_align_for_mode (DImode));
9659 atomicTI_type_node = build_atomic_base (unsigned_intTI_type_node,
9660 targetm.atomic_align_for_mode (TImode));
9662 access_public_node = get_identifier ("public");
9663 access_protected_node = get_identifier ("protected");
9664 access_private_node = get_identifier ("private");
9666 /* Define these next since types below may used them. */
9667 integer_zero_node = build_int_cst (integer_type_node, 0);
9668 integer_one_node = build_int_cst (integer_type_node, 1);
9669 integer_three_node = build_int_cst (integer_type_node, 3);
9670 integer_minus_one_node = build_int_cst (integer_type_node, -1);
9672 size_zero_node = size_int (0);
9673 size_one_node = size_int (1);
9674 bitsize_zero_node = bitsize_int (0);
9675 bitsize_one_node = bitsize_int (1);
9676 bitsize_unit_node = bitsize_int (BITS_PER_UNIT);
9678 boolean_false_node = TYPE_MIN_VALUE (boolean_type_node);
9679 boolean_true_node = TYPE_MAX_VALUE (boolean_type_node);
9681 void_type_node = make_node (VOID_TYPE);
9682 layout_type (void_type_node);
9684 /* We are not going to have real types in C with less than byte alignment,
9685 so we might as well not have any types that claim to have it. */
9686 TYPE_ALIGN (void_type_node) = BITS_PER_UNIT;
9687 TYPE_USER_ALIGN (void_type_node) = 0;
9689 null_pointer_node = build_int_cst (build_pointer_type (void_type_node), 0);
9690 layout_type (TREE_TYPE (null_pointer_node));
9692 ptr_type_node = build_pointer_type (void_type_node);
9693 const_ptr_type_node
9694 = build_pointer_type (build_type_variant (void_type_node, 1, 0));
9695 fileptr_type_node = ptr_type_node;
9697 pointer_sized_int_node = build_nonstandard_integer_type (POINTER_SIZE, 1);
9699 float_type_node = make_node (REAL_TYPE);
9700 TYPE_PRECISION (float_type_node) = FLOAT_TYPE_SIZE;
9701 layout_type (float_type_node);
9703 double_type_node = make_node (REAL_TYPE);
9704 if (short_double)
9705 TYPE_PRECISION (double_type_node) = FLOAT_TYPE_SIZE;
9706 else
9707 TYPE_PRECISION (double_type_node) = DOUBLE_TYPE_SIZE;
9708 layout_type (double_type_node);
9710 long_double_type_node = make_node (REAL_TYPE);
9711 TYPE_PRECISION (long_double_type_node) = LONG_DOUBLE_TYPE_SIZE;
9712 layout_type (long_double_type_node);
9714 float_ptr_type_node = build_pointer_type (float_type_node);
9715 double_ptr_type_node = build_pointer_type (double_type_node);
9716 long_double_ptr_type_node = build_pointer_type (long_double_type_node);
9717 integer_ptr_type_node = build_pointer_type (integer_type_node);
9719 /* Fixed size integer types. */
9720 uint16_type_node = build_nonstandard_integer_type (16, true);
9721 uint32_type_node = build_nonstandard_integer_type (32, true);
9722 uint64_type_node = build_nonstandard_integer_type (64, true);
9724 /* Decimal float types. */
9725 dfloat32_type_node = make_node (REAL_TYPE);
9726 TYPE_PRECISION (dfloat32_type_node) = DECIMAL32_TYPE_SIZE;
9727 layout_type (dfloat32_type_node);
9728 SET_TYPE_MODE (dfloat32_type_node, SDmode);
9729 dfloat32_ptr_type_node = build_pointer_type (dfloat32_type_node);
9731 dfloat64_type_node = make_node (REAL_TYPE);
9732 TYPE_PRECISION (dfloat64_type_node) = DECIMAL64_TYPE_SIZE;
9733 layout_type (dfloat64_type_node);
9734 SET_TYPE_MODE (dfloat64_type_node, DDmode);
9735 dfloat64_ptr_type_node = build_pointer_type (dfloat64_type_node);
9737 dfloat128_type_node = make_node (REAL_TYPE);
9738 TYPE_PRECISION (dfloat128_type_node) = DECIMAL128_TYPE_SIZE;
9739 layout_type (dfloat128_type_node);
9740 SET_TYPE_MODE (dfloat128_type_node, TDmode);
9741 dfloat128_ptr_type_node = build_pointer_type (dfloat128_type_node);
9743 complex_integer_type_node = build_complex_type (integer_type_node);
9744 complex_float_type_node = build_complex_type (float_type_node);
9745 complex_double_type_node = build_complex_type (double_type_node);
9746 complex_long_double_type_node = build_complex_type (long_double_type_node);
9748 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
9749 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
9750 sat_ ## KIND ## _type_node = \
9751 make_sat_signed_ ## KIND ## _type (SIZE); \
9752 sat_unsigned_ ## KIND ## _type_node = \
9753 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9754 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9755 unsigned_ ## KIND ## _type_node = \
9756 make_unsigned_ ## KIND ## _type (SIZE);
9758 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
9759 sat_ ## WIDTH ## KIND ## _type_node = \
9760 make_sat_signed_ ## KIND ## _type (SIZE); \
9761 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
9762 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9763 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9764 unsigned_ ## WIDTH ## KIND ## _type_node = \
9765 make_unsigned_ ## KIND ## _type (SIZE);
9767 /* Make fixed-point type nodes based on four different widths. */
9768 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
9769 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
9770 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
9771 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
9772 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
9774 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
9775 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
9776 NAME ## _type_node = \
9777 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
9778 u ## NAME ## _type_node = \
9779 make_or_reuse_unsigned_ ## KIND ## _type \
9780 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
9781 sat_ ## NAME ## _type_node = \
9782 make_or_reuse_sat_signed_ ## KIND ## _type \
9783 (GET_MODE_BITSIZE (MODE ## mode)); \
9784 sat_u ## NAME ## _type_node = \
9785 make_or_reuse_sat_unsigned_ ## KIND ## _type \
9786 (GET_MODE_BITSIZE (U ## MODE ## mode));
9788 /* Fixed-point type and mode nodes. */
9789 MAKE_FIXED_TYPE_NODE_FAMILY (fract, FRACT)
9790 MAKE_FIXED_TYPE_NODE_FAMILY (accum, ACCUM)
9791 MAKE_FIXED_MODE_NODE (fract, qq, QQ)
9792 MAKE_FIXED_MODE_NODE (fract, hq, HQ)
9793 MAKE_FIXED_MODE_NODE (fract, sq, SQ)
9794 MAKE_FIXED_MODE_NODE (fract, dq, DQ)
9795 MAKE_FIXED_MODE_NODE (fract, tq, TQ)
9796 MAKE_FIXED_MODE_NODE (accum, ha, HA)
9797 MAKE_FIXED_MODE_NODE (accum, sa, SA)
9798 MAKE_FIXED_MODE_NODE (accum, da, DA)
9799 MAKE_FIXED_MODE_NODE (accum, ta, TA)
9802 tree t = targetm.build_builtin_va_list ();
9804 /* Many back-ends define record types without setting TYPE_NAME.
9805 If we copied the record type here, we'd keep the original
9806 record type without a name. This breaks name mangling. So,
9807 don't copy record types and let c_common_nodes_and_builtins()
9808 declare the type to be __builtin_va_list. */
9809 if (TREE_CODE (t) != RECORD_TYPE)
9810 t = build_variant_type_copy (t);
9812 va_list_type_node = t;
9816 /* Modify DECL for given flags.
9817 TM_PURE attribute is set only on types, so the function will modify
9818 DECL's type when ECF_TM_PURE is used. */
9820 void
9821 set_call_expr_flags (tree decl, int flags)
9823 if (flags & ECF_NOTHROW)
9824 TREE_NOTHROW (decl) = 1;
9825 if (flags & ECF_CONST)
9826 TREE_READONLY (decl) = 1;
9827 if (flags & ECF_PURE)
9828 DECL_PURE_P (decl) = 1;
9829 if (flags & ECF_LOOPING_CONST_OR_PURE)
9830 DECL_LOOPING_CONST_OR_PURE_P (decl) = 1;
9831 if (flags & ECF_NOVOPS)
9832 DECL_IS_NOVOPS (decl) = 1;
9833 if (flags & ECF_NORETURN)
9834 TREE_THIS_VOLATILE (decl) = 1;
9835 if (flags & ECF_MALLOC)
9836 DECL_IS_MALLOC (decl) = 1;
9837 if (flags & ECF_RETURNS_TWICE)
9838 DECL_IS_RETURNS_TWICE (decl) = 1;
9839 if (flags & ECF_LEAF)
9840 DECL_ATTRIBUTES (decl) = tree_cons (get_identifier ("leaf"),
9841 NULL, DECL_ATTRIBUTES (decl));
9842 if ((flags & ECF_TM_PURE) && flag_tm)
9843 apply_tm_attr (decl, get_identifier ("transaction_pure"));
9844 /* Looping const or pure is implied by noreturn.
9845 There is currently no way to declare looping const or looping pure alone. */
9846 gcc_assert (!(flags & ECF_LOOPING_CONST_OR_PURE)
9847 || ((flags & ECF_NORETURN) && (flags & (ECF_CONST | ECF_PURE))));
9851 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
9853 static void
9854 local_define_builtin (const char *name, tree type, enum built_in_function code,
9855 const char *library_name, int ecf_flags)
9857 tree decl;
9859 decl = add_builtin_function (name, type, code, BUILT_IN_NORMAL,
9860 library_name, NULL_TREE);
9861 set_call_expr_flags (decl, ecf_flags);
9863 set_builtin_decl (code, decl, true);
9866 /* Call this function after instantiating all builtins that the language
9867 front end cares about. This will build the rest of the builtins that
9868 are relied upon by the tree optimizers and the middle-end. */
9870 void
9871 build_common_builtin_nodes (void)
9873 tree tmp, ftype;
9874 int ecf_flags;
9876 if (!builtin_decl_explicit_p (BUILT_IN_UNREACHABLE))
9878 ftype = build_function_type (void_type_node, void_list_node);
9879 local_define_builtin ("__builtin_unreachable", ftype, BUILT_IN_UNREACHABLE,
9880 "__builtin_unreachable",
9881 ECF_NOTHROW | ECF_LEAF | ECF_NORETURN
9882 | ECF_CONST | ECF_LEAF);
9885 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY)
9886 || !builtin_decl_explicit_p (BUILT_IN_MEMMOVE))
9888 ftype = build_function_type_list (ptr_type_node,
9889 ptr_type_node, const_ptr_type_node,
9890 size_type_node, NULL_TREE);
9892 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY))
9893 local_define_builtin ("__builtin_memcpy", ftype, BUILT_IN_MEMCPY,
9894 "memcpy", ECF_NOTHROW | ECF_LEAF);
9895 if (!builtin_decl_explicit_p (BUILT_IN_MEMMOVE))
9896 local_define_builtin ("__builtin_memmove", ftype, BUILT_IN_MEMMOVE,
9897 "memmove", ECF_NOTHROW | ECF_LEAF);
9900 if (!builtin_decl_explicit_p (BUILT_IN_MEMCMP))
9902 ftype = build_function_type_list (integer_type_node, const_ptr_type_node,
9903 const_ptr_type_node, size_type_node,
9904 NULL_TREE);
9905 local_define_builtin ("__builtin_memcmp", ftype, BUILT_IN_MEMCMP,
9906 "memcmp", ECF_PURE | ECF_NOTHROW | ECF_LEAF);
9909 if (!builtin_decl_explicit_p (BUILT_IN_MEMSET))
9911 ftype = build_function_type_list (ptr_type_node,
9912 ptr_type_node, integer_type_node,
9913 size_type_node, NULL_TREE);
9914 local_define_builtin ("__builtin_memset", ftype, BUILT_IN_MEMSET,
9915 "memset", ECF_NOTHROW | ECF_LEAF);
9918 if (!builtin_decl_explicit_p (BUILT_IN_ALLOCA))
9920 ftype = build_function_type_list (ptr_type_node,
9921 size_type_node, NULL_TREE);
9922 local_define_builtin ("__builtin_alloca", ftype, BUILT_IN_ALLOCA,
9923 "alloca", ECF_MALLOC | ECF_NOTHROW | ECF_LEAF);
9926 ftype = build_function_type_list (ptr_type_node, size_type_node,
9927 size_type_node, NULL_TREE);
9928 local_define_builtin ("__builtin_alloca_with_align", ftype,
9929 BUILT_IN_ALLOCA_WITH_ALIGN, "alloca",
9930 ECF_MALLOC | ECF_NOTHROW | ECF_LEAF);
9932 /* If we're checking the stack, `alloca' can throw. */
9933 if (flag_stack_check)
9935 TREE_NOTHROW (builtin_decl_explicit (BUILT_IN_ALLOCA)) = 0;
9936 TREE_NOTHROW (builtin_decl_explicit (BUILT_IN_ALLOCA_WITH_ALIGN)) = 0;
9939 ftype = build_function_type_list (void_type_node,
9940 ptr_type_node, ptr_type_node,
9941 ptr_type_node, NULL_TREE);
9942 local_define_builtin ("__builtin_init_trampoline", ftype,
9943 BUILT_IN_INIT_TRAMPOLINE,
9944 "__builtin_init_trampoline", ECF_NOTHROW | ECF_LEAF);
9945 local_define_builtin ("__builtin_init_heap_trampoline", ftype,
9946 BUILT_IN_INIT_HEAP_TRAMPOLINE,
9947 "__builtin_init_heap_trampoline",
9948 ECF_NOTHROW | ECF_LEAF);
9950 ftype = build_function_type_list (ptr_type_node, ptr_type_node, NULL_TREE);
9951 local_define_builtin ("__builtin_adjust_trampoline", ftype,
9952 BUILT_IN_ADJUST_TRAMPOLINE,
9953 "__builtin_adjust_trampoline",
9954 ECF_CONST | ECF_NOTHROW);
9956 ftype = build_function_type_list (void_type_node,
9957 ptr_type_node, ptr_type_node, NULL_TREE);
9958 local_define_builtin ("__builtin_nonlocal_goto", ftype,
9959 BUILT_IN_NONLOCAL_GOTO,
9960 "__builtin_nonlocal_goto",
9961 ECF_NORETURN | ECF_NOTHROW);
9963 ftype = build_function_type_list (void_type_node,
9964 ptr_type_node, ptr_type_node, NULL_TREE);
9965 local_define_builtin ("__builtin_setjmp_setup", ftype,
9966 BUILT_IN_SETJMP_SETUP,
9967 "__builtin_setjmp_setup", ECF_NOTHROW);
9969 ftype = build_function_type_list (void_type_node, ptr_type_node, NULL_TREE);
9970 local_define_builtin ("__builtin_setjmp_receiver", ftype,
9971 BUILT_IN_SETJMP_RECEIVER,
9972 "__builtin_setjmp_receiver", ECF_NOTHROW | ECF_LEAF);
9974 ftype = build_function_type_list (ptr_type_node, NULL_TREE);
9975 local_define_builtin ("__builtin_stack_save", ftype, BUILT_IN_STACK_SAVE,
9976 "__builtin_stack_save", ECF_NOTHROW | ECF_LEAF);
9978 ftype = build_function_type_list (void_type_node, ptr_type_node, NULL_TREE);
9979 local_define_builtin ("__builtin_stack_restore", ftype,
9980 BUILT_IN_STACK_RESTORE,
9981 "__builtin_stack_restore", ECF_NOTHROW | ECF_LEAF);
9983 /* If there's a possibility that we might use the ARM EABI, build the
9984 alternate __cxa_end_cleanup node used to resume from C++ and Java. */
9985 if (targetm.arm_eabi_unwinder)
9987 ftype = build_function_type_list (void_type_node, NULL_TREE);
9988 local_define_builtin ("__builtin_cxa_end_cleanup", ftype,
9989 BUILT_IN_CXA_END_CLEANUP,
9990 "__cxa_end_cleanup", ECF_NORETURN | ECF_LEAF);
9993 ftype = build_function_type_list (void_type_node, ptr_type_node, NULL_TREE);
9994 local_define_builtin ("__builtin_unwind_resume", ftype,
9995 BUILT_IN_UNWIND_RESUME,
9996 ((targetm_common.except_unwind_info (&global_options)
9997 == UI_SJLJ)
9998 ? "_Unwind_SjLj_Resume" : "_Unwind_Resume"),
9999 ECF_NORETURN);
10001 if (builtin_decl_explicit (BUILT_IN_RETURN_ADDRESS) == NULL_TREE)
10003 ftype = build_function_type_list (ptr_type_node, integer_type_node,
10004 NULL_TREE);
10005 local_define_builtin ("__builtin_return_address", ftype,
10006 BUILT_IN_RETURN_ADDRESS,
10007 "__builtin_return_address",
10008 ECF_NOTHROW);
10011 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER)
10012 || !builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT))
10014 ftype = build_function_type_list (void_type_node, ptr_type_node,
10015 ptr_type_node, NULL_TREE);
10016 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER))
10017 local_define_builtin ("__cyg_profile_func_enter", ftype,
10018 BUILT_IN_PROFILE_FUNC_ENTER,
10019 "__cyg_profile_func_enter", 0);
10020 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT))
10021 local_define_builtin ("__cyg_profile_func_exit", ftype,
10022 BUILT_IN_PROFILE_FUNC_EXIT,
10023 "__cyg_profile_func_exit", 0);
10026 /* The exception object and filter values from the runtime. The argument
10027 must be zero before exception lowering, i.e. from the front end. After
10028 exception lowering, it will be the region number for the exception
10029 landing pad. These functions are PURE instead of CONST to prevent
10030 them from being hoisted past the exception edge that will initialize
10031 its value in the landing pad. */
10032 ftype = build_function_type_list (ptr_type_node,
10033 integer_type_node, NULL_TREE);
10034 ecf_flags = ECF_PURE | ECF_NOTHROW | ECF_LEAF;
10035 /* Only use TM_PURE if we we have TM language support. */
10036 if (builtin_decl_explicit_p (BUILT_IN_TM_LOAD_1))
10037 ecf_flags |= ECF_TM_PURE;
10038 local_define_builtin ("__builtin_eh_pointer", ftype, BUILT_IN_EH_POINTER,
10039 "__builtin_eh_pointer", ecf_flags);
10041 tmp = lang_hooks.types.type_for_mode (targetm.eh_return_filter_mode (), 0);
10042 ftype = build_function_type_list (tmp, integer_type_node, NULL_TREE);
10043 local_define_builtin ("__builtin_eh_filter", ftype, BUILT_IN_EH_FILTER,
10044 "__builtin_eh_filter", ECF_PURE | ECF_NOTHROW | ECF_LEAF);
10046 ftype = build_function_type_list (void_type_node,
10047 integer_type_node, integer_type_node,
10048 NULL_TREE);
10049 local_define_builtin ("__builtin_eh_copy_values", ftype,
10050 BUILT_IN_EH_COPY_VALUES,
10051 "__builtin_eh_copy_values", ECF_NOTHROW);
10053 /* Complex multiplication and division. These are handled as builtins
10054 rather than optabs because emit_library_call_value doesn't support
10055 complex. Further, we can do slightly better with folding these
10056 beasties if the real and complex parts of the arguments are separate. */
10058 int mode;
10060 for (mode = MIN_MODE_COMPLEX_FLOAT; mode <= MAX_MODE_COMPLEX_FLOAT; ++mode)
10062 char mode_name_buf[4], *q;
10063 const char *p;
10064 enum built_in_function mcode, dcode;
10065 tree type, inner_type;
10066 const char *prefix = "__";
10068 if (targetm.libfunc_gnu_prefix)
10069 prefix = "__gnu_";
10071 type = lang_hooks.types.type_for_mode ((enum machine_mode) mode, 0);
10072 if (type == NULL)
10073 continue;
10074 inner_type = TREE_TYPE (type);
10076 ftype = build_function_type_list (type, inner_type, inner_type,
10077 inner_type, inner_type, NULL_TREE);
10079 mcode = ((enum built_in_function)
10080 (BUILT_IN_COMPLEX_MUL_MIN + mode - MIN_MODE_COMPLEX_FLOAT));
10081 dcode = ((enum built_in_function)
10082 (BUILT_IN_COMPLEX_DIV_MIN + mode - MIN_MODE_COMPLEX_FLOAT));
10084 for (p = GET_MODE_NAME (mode), q = mode_name_buf; *p; p++, q++)
10085 *q = TOLOWER (*p);
10086 *q = '\0';
10088 built_in_names[mcode] = concat (prefix, "mul", mode_name_buf, "3",
10089 NULL);
10090 local_define_builtin (built_in_names[mcode], ftype, mcode,
10091 built_in_names[mcode],
10092 ECF_CONST | ECF_NOTHROW | ECF_LEAF);
10094 built_in_names[dcode] = concat (prefix, "div", mode_name_buf, "3",
10095 NULL);
10096 local_define_builtin (built_in_names[dcode], ftype, dcode,
10097 built_in_names[dcode],
10098 ECF_CONST | ECF_NOTHROW | ECF_LEAF);
10103 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
10104 better way.
10106 If we requested a pointer to a vector, build up the pointers that
10107 we stripped off while looking for the inner type. Similarly for
10108 return values from functions.
10110 The argument TYPE is the top of the chain, and BOTTOM is the
10111 new type which we will point to. */
10113 tree
10114 reconstruct_complex_type (tree type, tree bottom)
10116 tree inner, outer;
10118 if (TREE_CODE (type) == POINTER_TYPE)
10120 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
10121 outer = build_pointer_type_for_mode (inner, TYPE_MODE (type),
10122 TYPE_REF_CAN_ALIAS_ALL (type));
10124 else if (TREE_CODE (type) == REFERENCE_TYPE)
10126 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
10127 outer = build_reference_type_for_mode (inner, TYPE_MODE (type),
10128 TYPE_REF_CAN_ALIAS_ALL (type));
10130 else if (TREE_CODE (type) == ARRAY_TYPE)
10132 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
10133 outer = build_array_type (inner, TYPE_DOMAIN (type));
10135 else if (TREE_CODE (type) == FUNCTION_TYPE)
10137 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
10138 outer = build_function_type (inner, TYPE_ARG_TYPES (type));
10140 else if (TREE_CODE (type) == METHOD_TYPE)
10142 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
10143 /* The build_method_type_directly() routine prepends 'this' to argument list,
10144 so we must compensate by getting rid of it. */
10145 outer
10146 = build_method_type_directly
10147 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type))),
10148 inner,
10149 TREE_CHAIN (TYPE_ARG_TYPES (type)));
10151 else if (TREE_CODE (type) == OFFSET_TYPE)
10153 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
10154 outer = build_offset_type (TYPE_OFFSET_BASETYPE (type), inner);
10156 else
10157 return bottom;
10159 return build_type_attribute_qual_variant (outer, TYPE_ATTRIBUTES (type),
10160 TYPE_QUALS (type));
10163 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
10164 the inner type. */
10165 tree
10166 build_vector_type_for_mode (tree innertype, enum machine_mode mode)
10168 int nunits;
10170 switch (GET_MODE_CLASS (mode))
10172 case MODE_VECTOR_INT:
10173 case MODE_VECTOR_FLOAT:
10174 case MODE_VECTOR_FRACT:
10175 case MODE_VECTOR_UFRACT:
10176 case MODE_VECTOR_ACCUM:
10177 case MODE_VECTOR_UACCUM:
10178 nunits = GET_MODE_NUNITS (mode);
10179 break;
10181 case MODE_INT:
10182 /* Check that there are no leftover bits. */
10183 gcc_assert (GET_MODE_BITSIZE (mode)
10184 % TREE_INT_CST_LOW (TYPE_SIZE (innertype)) == 0);
10186 nunits = GET_MODE_BITSIZE (mode)
10187 / TREE_INT_CST_LOW (TYPE_SIZE (innertype));
10188 break;
10190 default:
10191 gcc_unreachable ();
10194 return make_vector_type (innertype, nunits, mode);
10197 /* Similarly, but takes the inner type and number of units, which must be
10198 a power of two. */
10200 tree
10201 build_vector_type (tree innertype, int nunits)
10203 return make_vector_type (innertype, nunits, VOIDmode);
10206 /* Similarly, but builds a variant type with TYPE_VECTOR_OPAQUE set. */
10208 tree
10209 build_opaque_vector_type (tree innertype, int nunits)
10211 tree t = make_vector_type (innertype, nunits, VOIDmode);
10212 tree cand;
10213 /* We always build the non-opaque variant before the opaque one,
10214 so if it already exists, it is TYPE_NEXT_VARIANT of this one. */
10215 cand = TYPE_NEXT_VARIANT (t);
10216 if (cand
10217 && TYPE_VECTOR_OPAQUE (cand)
10218 && check_qualified_type (cand, t, TYPE_QUALS (t)))
10219 return cand;
10220 /* Othewise build a variant type and make sure to queue it after
10221 the non-opaque type. */
10222 cand = build_distinct_type_copy (t);
10223 TYPE_VECTOR_OPAQUE (cand) = true;
10224 TYPE_CANONICAL (cand) = TYPE_CANONICAL (t);
10225 TYPE_NEXT_VARIANT (cand) = TYPE_NEXT_VARIANT (t);
10226 TYPE_NEXT_VARIANT (t) = cand;
10227 TYPE_MAIN_VARIANT (cand) = TYPE_MAIN_VARIANT (t);
10228 return cand;
10232 /* Given an initializer INIT, return TRUE if INIT is zero or some
10233 aggregate of zeros. Otherwise return FALSE. */
10234 bool
10235 initializer_zerop (const_tree init)
10237 tree elt;
10239 STRIP_NOPS (init);
10241 switch (TREE_CODE (init))
10243 case INTEGER_CST:
10244 return integer_zerop (init);
10246 case REAL_CST:
10247 /* ??? Note that this is not correct for C4X float formats. There,
10248 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
10249 negative exponent. */
10250 return real_zerop (init)
10251 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init));
10253 case FIXED_CST:
10254 return fixed_zerop (init);
10256 case COMPLEX_CST:
10257 return integer_zerop (init)
10258 || (real_zerop (init)
10259 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init)))
10260 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init))));
10262 case VECTOR_CST:
10264 unsigned i;
10265 for (i = 0; i < VECTOR_CST_NELTS (init); ++i)
10266 if (!initializer_zerop (VECTOR_CST_ELT (init, i)))
10267 return false;
10268 return true;
10271 case CONSTRUCTOR:
10273 unsigned HOST_WIDE_INT idx;
10275 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init), idx, elt)
10276 if (!initializer_zerop (elt))
10277 return false;
10278 return true;
10281 case STRING_CST:
10283 int i;
10285 /* We need to loop through all elements to handle cases like
10286 "\0" and "\0foobar". */
10287 for (i = 0; i < TREE_STRING_LENGTH (init); ++i)
10288 if (TREE_STRING_POINTER (init)[i] != '\0')
10289 return false;
10291 return true;
10294 default:
10295 return false;
10299 /* Check if vector VEC consists of all the equal elements and
10300 that the number of elements corresponds to the type of VEC.
10301 The function returns first element of the vector
10302 or NULL_TREE if the vector is not uniform. */
10303 tree
10304 uniform_vector_p (const_tree vec)
10306 tree first, t;
10307 unsigned i;
10309 if (vec == NULL_TREE)
10310 return NULL_TREE;
10312 gcc_assert (VECTOR_TYPE_P (TREE_TYPE (vec)));
10314 if (TREE_CODE (vec) == VECTOR_CST)
10316 first = VECTOR_CST_ELT (vec, 0);
10317 for (i = 1; i < VECTOR_CST_NELTS (vec); ++i)
10318 if (!operand_equal_p (first, VECTOR_CST_ELT (vec, i), 0))
10319 return NULL_TREE;
10321 return first;
10324 else if (TREE_CODE (vec) == CONSTRUCTOR)
10326 first = error_mark_node;
10328 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (vec), i, t)
10330 if (i == 0)
10332 first = t;
10333 continue;
10335 if (!operand_equal_p (first, t, 0))
10336 return NULL_TREE;
10338 if (i != TYPE_VECTOR_SUBPARTS (TREE_TYPE (vec)))
10339 return NULL_TREE;
10341 return first;
10344 return NULL_TREE;
10347 /* Build an empty statement at location LOC. */
10349 tree
10350 build_empty_stmt (location_t loc)
10352 tree t = build1 (NOP_EXPR, void_type_node, size_zero_node);
10353 SET_EXPR_LOCATION (t, loc);
10354 return t;
10358 /* Build an OpenMP clause with code CODE. LOC is the location of the
10359 clause. */
10361 tree
10362 build_omp_clause (location_t loc, enum omp_clause_code code)
10364 tree t;
10365 int size, length;
10367 length = omp_clause_num_ops[code];
10368 size = (sizeof (struct tree_omp_clause) + (length - 1) * sizeof (tree));
10370 record_node_allocation_statistics (OMP_CLAUSE, size);
10372 t = ggc_alloc_tree_node (size);
10373 memset (t, 0, size);
10374 TREE_SET_CODE (t, OMP_CLAUSE);
10375 OMP_CLAUSE_SET_CODE (t, code);
10376 OMP_CLAUSE_LOCATION (t) = loc;
10378 return t;
10381 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
10382 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
10383 Except for the CODE and operand count field, other storage for the
10384 object is initialized to zeros. */
10386 tree
10387 build_vl_exp_stat (enum tree_code code, int len MEM_STAT_DECL)
10389 tree t;
10390 int length = (len - 1) * sizeof (tree) + sizeof (struct tree_exp);
10392 gcc_assert (TREE_CODE_CLASS (code) == tcc_vl_exp);
10393 gcc_assert (len >= 1);
10395 record_node_allocation_statistics (code, length);
10397 t = ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT);
10399 TREE_SET_CODE (t, code);
10401 /* Can't use TREE_OPERAND to store the length because if checking is
10402 enabled, it will try to check the length before we store it. :-P */
10403 t->exp.operands[0] = build_int_cst (sizetype, len);
10405 return t;
10408 /* Helper function for build_call_* functions; build a CALL_EXPR with
10409 indicated RETURN_TYPE, FN, and NARGS, but do not initialize any of
10410 the argument slots. */
10412 static tree
10413 build_call_1 (tree return_type, tree fn, int nargs)
10415 tree t;
10417 t = build_vl_exp (CALL_EXPR, nargs + 3);
10418 TREE_TYPE (t) = return_type;
10419 CALL_EXPR_FN (t) = fn;
10420 CALL_EXPR_STATIC_CHAIN (t) = NULL;
10422 return t;
10425 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10426 FN and a null static chain slot. NARGS is the number of call arguments
10427 which are specified as "..." arguments. */
10429 tree
10430 build_call_nary (tree return_type, tree fn, int nargs, ...)
10432 tree ret;
10433 va_list args;
10434 va_start (args, nargs);
10435 ret = build_call_valist (return_type, fn, nargs, args);
10436 va_end (args);
10437 return ret;
10440 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10441 FN and a null static chain slot. NARGS is the number of call arguments
10442 which are specified as a va_list ARGS. */
10444 tree
10445 build_call_valist (tree return_type, tree fn, int nargs, va_list args)
10447 tree t;
10448 int i;
10450 t = build_call_1 (return_type, fn, nargs);
10451 for (i = 0; i < nargs; i++)
10452 CALL_EXPR_ARG (t, i) = va_arg (args, tree);
10453 process_call_operands (t);
10454 return t;
10457 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10458 FN and a null static chain slot. NARGS is the number of call arguments
10459 which are specified as a tree array ARGS. */
10461 tree
10462 build_call_array_loc (location_t loc, tree return_type, tree fn,
10463 int nargs, const tree *args)
10465 tree t;
10466 int i;
10468 t = build_call_1 (return_type, fn, nargs);
10469 for (i = 0; i < nargs; i++)
10470 CALL_EXPR_ARG (t, i) = args[i];
10471 process_call_operands (t);
10472 SET_EXPR_LOCATION (t, loc);
10473 return t;
10476 /* Like build_call_array, but takes a vec. */
10478 tree
10479 build_call_vec (tree return_type, tree fn, vec<tree, va_gc> *args)
10481 tree ret, t;
10482 unsigned int ix;
10484 ret = build_call_1 (return_type, fn, vec_safe_length (args));
10485 FOR_EACH_VEC_SAFE_ELT (args, ix, t)
10486 CALL_EXPR_ARG (ret, ix) = t;
10487 process_call_operands (ret);
10488 return ret;
10491 /* Return true if T (assumed to be a DECL) must be assigned a memory
10492 location. */
10494 bool
10495 needs_to_live_in_memory (const_tree t)
10497 return (TREE_ADDRESSABLE (t)
10498 || is_global_var (t)
10499 || (TREE_CODE (t) == RESULT_DECL
10500 && !DECL_BY_REFERENCE (t)
10501 && aggregate_value_p (t, current_function_decl)));
10504 /* Return value of a constant X and sign-extend it. */
10506 HOST_WIDE_INT
10507 int_cst_value (const_tree x)
10509 unsigned bits = TYPE_PRECISION (TREE_TYPE (x));
10510 unsigned HOST_WIDE_INT val = TREE_INT_CST_LOW (x);
10512 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
10513 gcc_assert (TREE_INT_CST_HIGH (x) == 0
10514 || TREE_INT_CST_HIGH (x) == -1);
10516 if (bits < HOST_BITS_PER_WIDE_INT)
10518 bool negative = ((val >> (bits - 1)) & 1) != 0;
10519 if (negative)
10520 val |= (~(unsigned HOST_WIDE_INT) 0) << (bits - 1) << 1;
10521 else
10522 val &= ~((~(unsigned HOST_WIDE_INT) 0) << (bits - 1) << 1);
10525 return val;
10528 /* Return value of a constant X and sign-extend it. */
10530 HOST_WIDEST_INT
10531 widest_int_cst_value (const_tree x)
10533 unsigned bits = TYPE_PRECISION (TREE_TYPE (x));
10534 unsigned HOST_WIDEST_INT val = TREE_INT_CST_LOW (x);
10536 #if HOST_BITS_PER_WIDEST_INT > HOST_BITS_PER_WIDE_INT
10537 gcc_assert (HOST_BITS_PER_WIDEST_INT >= HOST_BITS_PER_DOUBLE_INT);
10538 val |= (((unsigned HOST_WIDEST_INT) TREE_INT_CST_HIGH (x))
10539 << HOST_BITS_PER_WIDE_INT);
10540 #else
10541 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
10542 gcc_assert (TREE_INT_CST_HIGH (x) == 0
10543 || TREE_INT_CST_HIGH (x) == -1);
10544 #endif
10546 if (bits < HOST_BITS_PER_WIDEST_INT)
10548 bool negative = ((val >> (bits - 1)) & 1) != 0;
10549 if (negative)
10550 val |= (~(unsigned HOST_WIDEST_INT) 0) << (bits - 1) << 1;
10551 else
10552 val &= ~((~(unsigned HOST_WIDEST_INT) 0) << (bits - 1) << 1);
10555 return val;
10558 /* If TYPE is an integral or pointer type, return an integer type with
10559 the same precision which is unsigned iff UNSIGNEDP is true, or itself
10560 if TYPE is already an integer type of signedness UNSIGNEDP. */
10562 tree
10563 signed_or_unsigned_type_for (int unsignedp, tree type)
10565 if (TREE_CODE (type) == INTEGER_TYPE && TYPE_UNSIGNED (type) == unsignedp)
10566 return type;
10568 if (TREE_CODE (type) == VECTOR_TYPE)
10570 tree inner = TREE_TYPE (type);
10571 tree inner2 = signed_or_unsigned_type_for (unsignedp, inner);
10572 if (!inner2)
10573 return NULL_TREE;
10574 if (inner == inner2)
10575 return type;
10576 return build_vector_type (inner2, TYPE_VECTOR_SUBPARTS (type));
10579 if (!INTEGRAL_TYPE_P (type)
10580 && !POINTER_TYPE_P (type)
10581 && TREE_CODE (type) != OFFSET_TYPE)
10582 return NULL_TREE;
10584 return build_nonstandard_integer_type (TYPE_PRECISION (type), unsignedp);
10587 /* If TYPE is an integral or pointer type, return an integer type with
10588 the same precision which is unsigned, or itself if TYPE is already an
10589 unsigned integer type. */
10591 tree
10592 unsigned_type_for (tree type)
10594 return signed_or_unsigned_type_for (1, type);
10597 /* If TYPE is an integral or pointer type, return an integer type with
10598 the same precision which is signed, or itself if TYPE is already a
10599 signed integer type. */
10601 tree
10602 signed_type_for (tree type)
10604 return signed_or_unsigned_type_for (0, type);
10607 /* If TYPE is a vector type, return a signed integer vector type with the
10608 same width and number of subparts. Otherwise return boolean_type_node. */
10610 tree
10611 truth_type_for (tree type)
10613 if (TREE_CODE (type) == VECTOR_TYPE)
10615 tree elem = lang_hooks.types.type_for_size
10616 (GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (type))), 0);
10617 return build_opaque_vector_type (elem, TYPE_VECTOR_SUBPARTS (type));
10619 else
10620 return boolean_type_node;
10623 /* Returns the largest value obtainable by casting something in INNER type to
10624 OUTER type. */
10626 tree
10627 upper_bound_in_type (tree outer, tree inner)
10629 double_int high;
10630 unsigned int det = 0;
10631 unsigned oprec = TYPE_PRECISION (outer);
10632 unsigned iprec = TYPE_PRECISION (inner);
10633 unsigned prec;
10635 /* Compute a unique number for every combination. */
10636 det |= (oprec > iprec) ? 4 : 0;
10637 det |= TYPE_UNSIGNED (outer) ? 2 : 0;
10638 det |= TYPE_UNSIGNED (inner) ? 1 : 0;
10640 /* Determine the exponent to use. */
10641 switch (det)
10643 case 0:
10644 case 1:
10645 /* oprec <= iprec, outer: signed, inner: don't care. */
10646 prec = oprec - 1;
10647 break;
10648 case 2:
10649 case 3:
10650 /* oprec <= iprec, outer: unsigned, inner: don't care. */
10651 prec = oprec;
10652 break;
10653 case 4:
10654 /* oprec > iprec, outer: signed, inner: signed. */
10655 prec = iprec - 1;
10656 break;
10657 case 5:
10658 /* oprec > iprec, outer: signed, inner: unsigned. */
10659 prec = iprec;
10660 break;
10661 case 6:
10662 /* oprec > iprec, outer: unsigned, inner: signed. */
10663 prec = oprec;
10664 break;
10665 case 7:
10666 /* oprec > iprec, outer: unsigned, inner: unsigned. */
10667 prec = iprec;
10668 break;
10669 default:
10670 gcc_unreachable ();
10673 /* Compute 2^^prec - 1. */
10674 if (prec <= HOST_BITS_PER_WIDE_INT)
10676 high.high = 0;
10677 high.low = ((~(unsigned HOST_WIDE_INT) 0)
10678 >> (HOST_BITS_PER_WIDE_INT - prec));
10680 else
10682 high.high = ((~(unsigned HOST_WIDE_INT) 0)
10683 >> (HOST_BITS_PER_DOUBLE_INT - prec));
10684 high.low = ~(unsigned HOST_WIDE_INT) 0;
10687 return double_int_to_tree (outer, high);
10690 /* Returns the smallest value obtainable by casting something in INNER type to
10691 OUTER type. */
10693 tree
10694 lower_bound_in_type (tree outer, tree inner)
10696 double_int low;
10697 unsigned oprec = TYPE_PRECISION (outer);
10698 unsigned iprec = TYPE_PRECISION (inner);
10700 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
10701 and obtain 0. */
10702 if (TYPE_UNSIGNED (outer)
10703 /* If we are widening something of an unsigned type, OUTER type
10704 contains all values of INNER type. In particular, both INNER
10705 and OUTER types have zero in common. */
10706 || (oprec > iprec && TYPE_UNSIGNED (inner)))
10707 low.low = low.high = 0;
10708 else
10710 /* If we are widening a signed type to another signed type, we
10711 want to obtain -2^^(iprec-1). If we are keeping the
10712 precision or narrowing to a signed type, we want to obtain
10713 -2^(oprec-1). */
10714 unsigned prec = oprec > iprec ? iprec : oprec;
10716 if (prec <= HOST_BITS_PER_WIDE_INT)
10718 low.high = ~(unsigned HOST_WIDE_INT) 0;
10719 low.low = (~(unsigned HOST_WIDE_INT) 0) << (prec - 1);
10721 else
10723 low.high = ((~(unsigned HOST_WIDE_INT) 0)
10724 << (prec - HOST_BITS_PER_WIDE_INT - 1));
10725 low.low = 0;
10729 return double_int_to_tree (outer, low);
10732 /* Return nonzero if two operands that are suitable for PHI nodes are
10733 necessarily equal. Specifically, both ARG0 and ARG1 must be either
10734 SSA_NAME or invariant. Note that this is strictly an optimization.
10735 That is, callers of this function can directly call operand_equal_p
10736 and get the same result, only slower. */
10739 operand_equal_for_phi_arg_p (const_tree arg0, const_tree arg1)
10741 if (arg0 == arg1)
10742 return 1;
10743 if (TREE_CODE (arg0) == SSA_NAME || TREE_CODE (arg1) == SSA_NAME)
10744 return 0;
10745 return operand_equal_p (arg0, arg1, 0);
10748 /* Returns number of zeros at the end of binary representation of X.
10750 ??? Use ffs if available? */
10752 tree
10753 num_ending_zeros (const_tree x)
10755 unsigned HOST_WIDE_INT fr, nfr;
10756 unsigned num, abits;
10757 tree type = TREE_TYPE (x);
10759 if (TREE_INT_CST_LOW (x) == 0)
10761 num = HOST_BITS_PER_WIDE_INT;
10762 fr = TREE_INT_CST_HIGH (x);
10764 else
10766 num = 0;
10767 fr = TREE_INT_CST_LOW (x);
10770 for (abits = HOST_BITS_PER_WIDE_INT / 2; abits; abits /= 2)
10772 nfr = fr >> abits;
10773 if (nfr << abits == fr)
10775 num += abits;
10776 fr = nfr;
10780 if (num > TYPE_PRECISION (type))
10781 num = TYPE_PRECISION (type);
10783 return build_int_cst_type (type, num);
10787 #define WALK_SUBTREE(NODE) \
10788 do \
10790 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
10791 if (result) \
10792 return result; \
10794 while (0)
10796 /* This is a subroutine of walk_tree that walks field of TYPE that are to
10797 be walked whenever a type is seen in the tree. Rest of operands and return
10798 value are as for walk_tree. */
10800 static tree
10801 walk_type_fields (tree type, walk_tree_fn func, void *data,
10802 struct pointer_set_t *pset, walk_tree_lh lh)
10804 tree result = NULL_TREE;
10806 switch (TREE_CODE (type))
10808 case POINTER_TYPE:
10809 case REFERENCE_TYPE:
10810 case VECTOR_TYPE:
10811 /* We have to worry about mutually recursive pointers. These can't
10812 be written in C. They can in Ada. It's pathological, but
10813 there's an ACATS test (c38102a) that checks it. Deal with this
10814 by checking if we're pointing to another pointer, that one
10815 points to another pointer, that one does too, and we have no htab.
10816 If so, get a hash table. We check three levels deep to avoid
10817 the cost of the hash table if we don't need one. */
10818 if (POINTER_TYPE_P (TREE_TYPE (type))
10819 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type)))
10820 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type))))
10821 && !pset)
10823 result = walk_tree_without_duplicates (&TREE_TYPE (type),
10824 func, data);
10825 if (result)
10826 return result;
10828 break;
10831 /* ... fall through ... */
10833 case COMPLEX_TYPE:
10834 WALK_SUBTREE (TREE_TYPE (type));
10835 break;
10837 case METHOD_TYPE:
10838 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type));
10840 /* Fall through. */
10842 case FUNCTION_TYPE:
10843 WALK_SUBTREE (TREE_TYPE (type));
10845 tree arg;
10847 /* We never want to walk into default arguments. */
10848 for (arg = TYPE_ARG_TYPES (type); arg; arg = TREE_CHAIN (arg))
10849 WALK_SUBTREE (TREE_VALUE (arg));
10851 break;
10853 case ARRAY_TYPE:
10854 /* Don't follow this nodes's type if a pointer for fear that
10855 we'll have infinite recursion. If we have a PSET, then we
10856 need not fear. */
10857 if (pset
10858 || (!POINTER_TYPE_P (TREE_TYPE (type))
10859 && TREE_CODE (TREE_TYPE (type)) != OFFSET_TYPE))
10860 WALK_SUBTREE (TREE_TYPE (type));
10861 WALK_SUBTREE (TYPE_DOMAIN (type));
10862 break;
10864 case OFFSET_TYPE:
10865 WALK_SUBTREE (TREE_TYPE (type));
10866 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type));
10867 break;
10869 default:
10870 break;
10873 return NULL_TREE;
10876 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
10877 called with the DATA and the address of each sub-tree. If FUNC returns a
10878 non-NULL value, the traversal is stopped, and the value returned by FUNC
10879 is returned. If PSET is non-NULL it is used to record the nodes visited,
10880 and to avoid visiting a node more than once. */
10882 tree
10883 walk_tree_1 (tree *tp, walk_tree_fn func, void *data,
10884 struct pointer_set_t *pset, walk_tree_lh lh)
10886 enum tree_code code;
10887 int walk_subtrees;
10888 tree result;
10890 #define WALK_SUBTREE_TAIL(NODE) \
10891 do \
10893 tp = & (NODE); \
10894 goto tail_recurse; \
10896 while (0)
10898 tail_recurse:
10899 /* Skip empty subtrees. */
10900 if (!*tp)
10901 return NULL_TREE;
10903 /* Don't walk the same tree twice, if the user has requested
10904 that we avoid doing so. */
10905 if (pset && pointer_set_insert (pset, *tp))
10906 return NULL_TREE;
10908 /* Call the function. */
10909 walk_subtrees = 1;
10910 result = (*func) (tp, &walk_subtrees, data);
10912 /* If we found something, return it. */
10913 if (result)
10914 return result;
10916 code = TREE_CODE (*tp);
10918 /* Even if we didn't, FUNC may have decided that there was nothing
10919 interesting below this point in the tree. */
10920 if (!walk_subtrees)
10922 /* But we still need to check our siblings. */
10923 if (code == TREE_LIST)
10924 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp));
10925 else if (code == OMP_CLAUSE)
10926 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
10927 else
10928 return NULL_TREE;
10931 if (lh)
10933 result = (*lh) (tp, &walk_subtrees, func, data, pset);
10934 if (result || !walk_subtrees)
10935 return result;
10938 switch (code)
10940 case ERROR_MARK:
10941 case IDENTIFIER_NODE:
10942 case INTEGER_CST:
10943 case REAL_CST:
10944 case FIXED_CST:
10945 case VECTOR_CST:
10946 case STRING_CST:
10947 case BLOCK:
10948 case PLACEHOLDER_EXPR:
10949 case SSA_NAME:
10950 case FIELD_DECL:
10951 case RESULT_DECL:
10952 /* None of these have subtrees other than those already walked
10953 above. */
10954 break;
10956 case TREE_LIST:
10957 WALK_SUBTREE (TREE_VALUE (*tp));
10958 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp));
10959 break;
10961 case TREE_VEC:
10963 int len = TREE_VEC_LENGTH (*tp);
10965 if (len == 0)
10966 break;
10968 /* Walk all elements but the first. */
10969 while (--len)
10970 WALK_SUBTREE (TREE_VEC_ELT (*tp, len));
10972 /* Now walk the first one as a tail call. */
10973 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp, 0));
10976 case COMPLEX_CST:
10977 WALK_SUBTREE (TREE_REALPART (*tp));
10978 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp));
10980 case CONSTRUCTOR:
10982 unsigned HOST_WIDE_INT idx;
10983 constructor_elt *ce;
10985 for (idx = 0; vec_safe_iterate (CONSTRUCTOR_ELTS (*tp), idx, &ce);
10986 idx++)
10987 WALK_SUBTREE (ce->value);
10989 break;
10991 case SAVE_EXPR:
10992 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, 0));
10994 case BIND_EXPR:
10996 tree decl;
10997 for (decl = BIND_EXPR_VARS (*tp); decl; decl = DECL_CHAIN (decl))
10999 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
11000 into declarations that are just mentioned, rather than
11001 declared; they don't really belong to this part of the tree.
11002 And, we can see cycles: the initializer for a declaration
11003 can refer to the declaration itself. */
11004 WALK_SUBTREE (DECL_INITIAL (decl));
11005 WALK_SUBTREE (DECL_SIZE (decl));
11006 WALK_SUBTREE (DECL_SIZE_UNIT (decl));
11008 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp));
11011 case STATEMENT_LIST:
11013 tree_stmt_iterator i;
11014 for (i = tsi_start (*tp); !tsi_end_p (i); tsi_next (&i))
11015 WALK_SUBTREE (*tsi_stmt_ptr (i));
11017 break;
11019 case OMP_CLAUSE:
11020 switch (OMP_CLAUSE_CODE (*tp))
11022 case OMP_CLAUSE_PRIVATE:
11023 case OMP_CLAUSE_SHARED:
11024 case OMP_CLAUSE_FIRSTPRIVATE:
11025 case OMP_CLAUSE_COPYIN:
11026 case OMP_CLAUSE_COPYPRIVATE:
11027 case OMP_CLAUSE_FINAL:
11028 case OMP_CLAUSE_IF:
11029 case OMP_CLAUSE_NUM_THREADS:
11030 case OMP_CLAUSE_SCHEDULE:
11031 case OMP_CLAUSE_UNIFORM:
11032 case OMP_CLAUSE_DEPEND:
11033 case OMP_CLAUSE_NUM_TEAMS:
11034 case OMP_CLAUSE_THREAD_LIMIT:
11035 case OMP_CLAUSE_DEVICE:
11036 case OMP_CLAUSE_DIST_SCHEDULE:
11037 case OMP_CLAUSE_SAFELEN:
11038 case OMP_CLAUSE_SIMDLEN:
11039 case OMP_CLAUSE__LOOPTEMP_:
11040 case OMP_CLAUSE__SIMDUID_:
11041 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, 0));
11042 /* FALLTHRU */
11044 case OMP_CLAUSE_NOWAIT:
11045 case OMP_CLAUSE_ORDERED:
11046 case OMP_CLAUSE_DEFAULT:
11047 case OMP_CLAUSE_UNTIED:
11048 case OMP_CLAUSE_MERGEABLE:
11049 case OMP_CLAUSE_PROC_BIND:
11050 case OMP_CLAUSE_INBRANCH:
11051 case OMP_CLAUSE_NOTINBRANCH:
11052 case OMP_CLAUSE_FOR:
11053 case OMP_CLAUSE_PARALLEL:
11054 case OMP_CLAUSE_SECTIONS:
11055 case OMP_CLAUSE_TASKGROUP:
11056 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
11058 case OMP_CLAUSE_LASTPRIVATE:
11059 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp));
11060 WALK_SUBTREE (OMP_CLAUSE_LASTPRIVATE_STMT (*tp));
11061 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
11063 case OMP_CLAUSE_COLLAPSE:
11065 int i;
11066 for (i = 0; i < 3; i++)
11067 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, i));
11068 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
11071 case OMP_CLAUSE_ALIGNED:
11072 case OMP_CLAUSE_LINEAR:
11073 case OMP_CLAUSE_FROM:
11074 case OMP_CLAUSE_TO:
11075 case OMP_CLAUSE_MAP:
11076 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp));
11077 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, 1));
11078 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
11080 case OMP_CLAUSE_REDUCTION:
11082 int i;
11083 for (i = 0; i < 4; i++)
11084 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, i));
11085 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
11088 default:
11089 gcc_unreachable ();
11091 break;
11093 case TARGET_EXPR:
11095 int i, len;
11097 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
11098 But, we only want to walk once. */
11099 len = (TREE_OPERAND (*tp, 3) == TREE_OPERAND (*tp, 1)) ? 2 : 3;
11100 for (i = 0; i < len; ++i)
11101 WALK_SUBTREE (TREE_OPERAND (*tp, i));
11102 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, len));
11105 case DECL_EXPR:
11106 /* If this is a TYPE_DECL, walk into the fields of the type that it's
11107 defining. We only want to walk into these fields of a type in this
11108 case and not in the general case of a mere reference to the type.
11110 The criterion is as follows: if the field can be an expression, it
11111 must be walked only here. This should be in keeping with the fields
11112 that are directly gimplified in gimplify_type_sizes in order for the
11113 mark/copy-if-shared/unmark machinery of the gimplifier to work with
11114 variable-sized types.
11116 Note that DECLs get walked as part of processing the BIND_EXPR. */
11117 if (TREE_CODE (DECL_EXPR_DECL (*tp)) == TYPE_DECL)
11119 tree *type_p = &TREE_TYPE (DECL_EXPR_DECL (*tp));
11120 if (TREE_CODE (*type_p) == ERROR_MARK)
11121 return NULL_TREE;
11123 /* Call the function for the type. See if it returns anything or
11124 doesn't want us to continue. If we are to continue, walk both
11125 the normal fields and those for the declaration case. */
11126 result = (*func) (type_p, &walk_subtrees, data);
11127 if (result || !walk_subtrees)
11128 return result;
11130 /* But do not walk a pointed-to type since it may itself need to
11131 be walked in the declaration case if it isn't anonymous. */
11132 if (!POINTER_TYPE_P (*type_p))
11134 result = walk_type_fields (*type_p, func, data, pset, lh);
11135 if (result)
11136 return result;
11139 /* If this is a record type, also walk the fields. */
11140 if (RECORD_OR_UNION_TYPE_P (*type_p))
11142 tree field;
11144 for (field = TYPE_FIELDS (*type_p); field;
11145 field = DECL_CHAIN (field))
11147 /* We'd like to look at the type of the field, but we can
11148 easily get infinite recursion. So assume it's pointed
11149 to elsewhere in the tree. Also, ignore things that
11150 aren't fields. */
11151 if (TREE_CODE (field) != FIELD_DECL)
11152 continue;
11154 WALK_SUBTREE (DECL_FIELD_OFFSET (field));
11155 WALK_SUBTREE (DECL_SIZE (field));
11156 WALK_SUBTREE (DECL_SIZE_UNIT (field));
11157 if (TREE_CODE (*type_p) == QUAL_UNION_TYPE)
11158 WALK_SUBTREE (DECL_QUALIFIER (field));
11162 /* Same for scalar types. */
11163 else if (TREE_CODE (*type_p) == BOOLEAN_TYPE
11164 || TREE_CODE (*type_p) == ENUMERAL_TYPE
11165 || TREE_CODE (*type_p) == INTEGER_TYPE
11166 || TREE_CODE (*type_p) == FIXED_POINT_TYPE
11167 || TREE_CODE (*type_p) == REAL_TYPE)
11169 WALK_SUBTREE (TYPE_MIN_VALUE (*type_p));
11170 WALK_SUBTREE (TYPE_MAX_VALUE (*type_p));
11173 WALK_SUBTREE (TYPE_SIZE (*type_p));
11174 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p));
11176 /* FALLTHRU */
11178 default:
11179 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code)))
11181 int i, len;
11183 /* Walk over all the sub-trees of this operand. */
11184 len = TREE_OPERAND_LENGTH (*tp);
11186 /* Go through the subtrees. We need to do this in forward order so
11187 that the scope of a FOR_EXPR is handled properly. */
11188 if (len)
11190 for (i = 0; i < len - 1; ++i)
11191 WALK_SUBTREE (TREE_OPERAND (*tp, i));
11192 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, len - 1));
11195 /* If this is a type, walk the needed fields in the type. */
11196 else if (TYPE_P (*tp))
11197 return walk_type_fields (*tp, func, data, pset, lh);
11198 break;
11201 /* We didn't find what we were looking for. */
11202 return NULL_TREE;
11204 #undef WALK_SUBTREE_TAIL
11206 #undef WALK_SUBTREE
11208 /* Like walk_tree, but does not walk duplicate nodes more than once. */
11210 tree
11211 walk_tree_without_duplicates_1 (tree *tp, walk_tree_fn func, void *data,
11212 walk_tree_lh lh)
11214 tree result;
11215 struct pointer_set_t *pset;
11217 pset = pointer_set_create ();
11218 result = walk_tree_1 (tp, func, data, pset, lh);
11219 pointer_set_destroy (pset);
11220 return result;
11224 tree
11225 tree_block (tree t)
11227 const enum tree_code_class c = TREE_CODE_CLASS (TREE_CODE (t));
11229 if (IS_EXPR_CODE_CLASS (c))
11230 return LOCATION_BLOCK (t->exp.locus);
11231 gcc_unreachable ();
11232 return NULL;
11235 void
11236 tree_set_block (tree t, tree b)
11238 const enum tree_code_class c = TREE_CODE_CLASS (TREE_CODE (t));
11240 if (IS_EXPR_CODE_CLASS (c))
11242 if (b)
11243 t->exp.locus = COMBINE_LOCATION_DATA (line_table, t->exp.locus, b);
11244 else
11245 t->exp.locus = LOCATION_LOCUS (t->exp.locus);
11247 else
11248 gcc_unreachable ();
11251 /* Create a nameless artificial label and put it in the current
11252 function context. The label has a location of LOC. Returns the
11253 newly created label. */
11255 tree
11256 create_artificial_label (location_t loc)
11258 tree lab = build_decl (loc,
11259 LABEL_DECL, NULL_TREE, void_type_node);
11261 DECL_ARTIFICIAL (lab) = 1;
11262 DECL_IGNORED_P (lab) = 1;
11263 DECL_CONTEXT (lab) = current_function_decl;
11264 return lab;
11267 /* Given a tree, try to return a useful variable name that we can use
11268 to prefix a temporary that is being assigned the value of the tree.
11269 I.E. given <temp> = &A, return A. */
11271 const char *
11272 get_name (tree t)
11274 tree stripped_decl;
11276 stripped_decl = t;
11277 STRIP_NOPS (stripped_decl);
11278 if (DECL_P (stripped_decl) && DECL_NAME (stripped_decl))
11279 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl));
11280 else if (TREE_CODE (stripped_decl) == SSA_NAME)
11282 tree name = SSA_NAME_IDENTIFIER (stripped_decl);
11283 if (!name)
11284 return NULL;
11285 return IDENTIFIER_POINTER (name);
11287 else
11289 switch (TREE_CODE (stripped_decl))
11291 case ADDR_EXPR:
11292 return get_name (TREE_OPERAND (stripped_decl, 0));
11293 default:
11294 return NULL;
11299 /* Return true if TYPE has a variable argument list. */
11301 bool
11302 stdarg_p (const_tree fntype)
11304 function_args_iterator args_iter;
11305 tree n = NULL_TREE, t;
11307 if (!fntype)
11308 return false;
11310 FOREACH_FUNCTION_ARGS (fntype, t, args_iter)
11312 n = t;
11315 return n != NULL_TREE && n != void_type_node;
11318 /* Return true if TYPE has a prototype. */
11320 bool
11321 prototype_p (tree fntype)
11323 tree t;
11325 gcc_assert (fntype != NULL_TREE);
11327 t = TYPE_ARG_TYPES (fntype);
11328 return (t != NULL_TREE);
11331 /* If BLOCK is inlined from an __attribute__((__artificial__))
11332 routine, return pointer to location from where it has been
11333 called. */
11334 location_t *
11335 block_nonartificial_location (tree block)
11337 location_t *ret = NULL;
11339 while (block && TREE_CODE (block) == BLOCK
11340 && BLOCK_ABSTRACT_ORIGIN (block))
11342 tree ao = BLOCK_ABSTRACT_ORIGIN (block);
11344 while (TREE_CODE (ao) == BLOCK
11345 && BLOCK_ABSTRACT_ORIGIN (ao)
11346 && BLOCK_ABSTRACT_ORIGIN (ao) != ao)
11347 ao = BLOCK_ABSTRACT_ORIGIN (ao);
11349 if (TREE_CODE (ao) == FUNCTION_DECL)
11351 /* If AO is an artificial inline, point RET to the
11352 call site locus at which it has been inlined and continue
11353 the loop, in case AO's caller is also an artificial
11354 inline. */
11355 if (DECL_DECLARED_INLINE_P (ao)
11356 && lookup_attribute ("artificial", DECL_ATTRIBUTES (ao)))
11357 ret = &BLOCK_SOURCE_LOCATION (block);
11358 else
11359 break;
11361 else if (TREE_CODE (ao) != BLOCK)
11362 break;
11364 block = BLOCK_SUPERCONTEXT (block);
11366 return ret;
11370 /* If EXP is inlined from an __attribute__((__artificial__))
11371 function, return the location of the original call expression. */
11373 location_t
11374 tree_nonartificial_location (tree exp)
11376 location_t *loc = block_nonartificial_location (TREE_BLOCK (exp));
11378 if (loc)
11379 return *loc;
11380 else
11381 return EXPR_LOCATION (exp);
11385 /* These are the hash table functions for the hash table of OPTIMIZATION_NODEq
11386 nodes. */
11388 /* Return the hash code code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
11390 static hashval_t
11391 cl_option_hash_hash (const void *x)
11393 const_tree const t = (const_tree) x;
11394 const char *p;
11395 size_t i;
11396 size_t len = 0;
11397 hashval_t hash = 0;
11399 if (TREE_CODE (t) == OPTIMIZATION_NODE)
11401 p = (const char *)TREE_OPTIMIZATION (t);
11402 len = sizeof (struct cl_optimization);
11405 else if (TREE_CODE (t) == TARGET_OPTION_NODE)
11407 p = (const char *)TREE_TARGET_OPTION (t);
11408 len = sizeof (struct cl_target_option);
11411 else
11412 gcc_unreachable ();
11414 /* assume most opt flags are just 0/1, some are 2-3, and a few might be
11415 something else. */
11416 for (i = 0; i < len; i++)
11417 if (p[i])
11418 hash = (hash << 4) ^ ((i << 2) | p[i]);
11420 return hash;
11423 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
11424 TARGET_OPTION tree node) is the same as that given by *Y, which is the
11425 same. */
11427 static int
11428 cl_option_hash_eq (const void *x, const void *y)
11430 const_tree const xt = (const_tree) x;
11431 const_tree const yt = (const_tree) y;
11432 const char *xp;
11433 const char *yp;
11434 size_t len;
11436 if (TREE_CODE (xt) != TREE_CODE (yt))
11437 return 0;
11439 if (TREE_CODE (xt) == OPTIMIZATION_NODE)
11441 xp = (const char *)TREE_OPTIMIZATION (xt);
11442 yp = (const char *)TREE_OPTIMIZATION (yt);
11443 len = sizeof (struct cl_optimization);
11446 else if (TREE_CODE (xt) == TARGET_OPTION_NODE)
11448 xp = (const char *)TREE_TARGET_OPTION (xt);
11449 yp = (const char *)TREE_TARGET_OPTION (yt);
11450 len = sizeof (struct cl_target_option);
11453 else
11454 gcc_unreachable ();
11456 return (memcmp (xp, yp, len) == 0);
11459 /* Build an OPTIMIZATION_NODE based on the options in OPTS. */
11461 tree
11462 build_optimization_node (struct gcc_options *opts)
11464 tree t;
11465 void **slot;
11467 /* Use the cache of optimization nodes. */
11469 cl_optimization_save (TREE_OPTIMIZATION (cl_optimization_node),
11470 opts);
11472 slot = htab_find_slot (cl_option_hash_table, cl_optimization_node, INSERT);
11473 t = (tree) *slot;
11474 if (!t)
11476 /* Insert this one into the hash table. */
11477 t = cl_optimization_node;
11478 *slot = t;
11480 /* Make a new node for next time round. */
11481 cl_optimization_node = make_node (OPTIMIZATION_NODE);
11484 return t;
11487 /* Build a TARGET_OPTION_NODE based on the options in OPTS. */
11489 tree
11490 build_target_option_node (struct gcc_options *opts)
11492 tree t;
11493 void **slot;
11495 /* Use the cache of optimization nodes. */
11497 cl_target_option_save (TREE_TARGET_OPTION (cl_target_option_node),
11498 opts);
11500 slot = htab_find_slot (cl_option_hash_table, cl_target_option_node, INSERT);
11501 t = (tree) *slot;
11502 if (!t)
11504 /* Insert this one into the hash table. */
11505 t = cl_target_option_node;
11506 *slot = t;
11508 /* Make a new node for next time round. */
11509 cl_target_option_node = make_node (TARGET_OPTION_NODE);
11512 return t;
11515 /* Reset TREE_TARGET_GLOBALS cache for TARGET_OPTION_NODE.
11516 Called through htab_traverse. */
11518 static int
11519 prepare_target_option_node_for_pch (void **slot, void *)
11521 tree node = (tree) *slot;
11522 if (TREE_CODE (node) == TARGET_OPTION_NODE)
11523 TREE_TARGET_GLOBALS (node) = NULL;
11524 return 1;
11527 /* Clear TREE_TARGET_GLOBALS of all TARGET_OPTION_NODE trees,
11528 so that they aren't saved during PCH writing. */
11530 void
11531 prepare_target_option_nodes_for_pch (void)
11533 htab_traverse (cl_option_hash_table, prepare_target_option_node_for_pch,
11534 NULL);
11537 /* Determine the "ultimate origin" of a block. The block may be an inlined
11538 instance of an inlined instance of a block which is local to an inline
11539 function, so we have to trace all of the way back through the origin chain
11540 to find out what sort of node actually served as the original seed for the
11541 given block. */
11543 tree
11544 block_ultimate_origin (const_tree block)
11546 tree immediate_origin = BLOCK_ABSTRACT_ORIGIN (block);
11548 /* output_inline_function sets BLOCK_ABSTRACT_ORIGIN for all the
11549 nodes in the function to point to themselves; ignore that if
11550 we're trying to output the abstract instance of this function. */
11551 if (BLOCK_ABSTRACT (block) && immediate_origin == block)
11552 return NULL_TREE;
11554 if (immediate_origin == NULL_TREE)
11555 return NULL_TREE;
11556 else
11558 tree ret_val;
11559 tree lookahead = immediate_origin;
11563 ret_val = lookahead;
11564 lookahead = (TREE_CODE (ret_val) == BLOCK
11565 ? BLOCK_ABSTRACT_ORIGIN (ret_val) : NULL);
11567 while (lookahead != NULL && lookahead != ret_val);
11569 /* The block's abstract origin chain may not be the *ultimate* origin of
11570 the block. It could lead to a DECL that has an abstract origin set.
11571 If so, we want that DECL's abstract origin (which is what DECL_ORIGIN
11572 will give us if it has one). Note that DECL's abstract origins are
11573 supposed to be the most distant ancestor (or so decl_ultimate_origin
11574 claims), so we don't need to loop following the DECL origins. */
11575 if (DECL_P (ret_val))
11576 return DECL_ORIGIN (ret_val);
11578 return ret_val;
11582 /* Return true iff conversion in EXP generates no instruction. Mark
11583 it inline so that we fully inline into the stripping functions even
11584 though we have two uses of this function. */
11586 static inline bool
11587 tree_nop_conversion (const_tree exp)
11589 tree outer_type, inner_type;
11591 if (!CONVERT_EXPR_P (exp)
11592 && TREE_CODE (exp) != NON_LVALUE_EXPR)
11593 return false;
11594 if (TREE_OPERAND (exp, 0) == error_mark_node)
11595 return false;
11597 outer_type = TREE_TYPE (exp);
11598 inner_type = TREE_TYPE (TREE_OPERAND (exp, 0));
11600 if (!inner_type)
11601 return false;
11603 /* Use precision rather then machine mode when we can, which gives
11604 the correct answer even for submode (bit-field) types. */
11605 if ((INTEGRAL_TYPE_P (outer_type)
11606 || POINTER_TYPE_P (outer_type)
11607 || TREE_CODE (outer_type) == OFFSET_TYPE)
11608 && (INTEGRAL_TYPE_P (inner_type)
11609 || POINTER_TYPE_P (inner_type)
11610 || TREE_CODE (inner_type) == OFFSET_TYPE))
11611 return TYPE_PRECISION (outer_type) == TYPE_PRECISION (inner_type);
11613 /* Otherwise fall back on comparing machine modes (e.g. for
11614 aggregate types, floats). */
11615 return TYPE_MODE (outer_type) == TYPE_MODE (inner_type);
11618 /* Return true iff conversion in EXP generates no instruction. Don't
11619 consider conversions changing the signedness. */
11621 static bool
11622 tree_sign_nop_conversion (const_tree exp)
11624 tree outer_type, inner_type;
11626 if (!tree_nop_conversion (exp))
11627 return false;
11629 outer_type = TREE_TYPE (exp);
11630 inner_type = TREE_TYPE (TREE_OPERAND (exp, 0));
11632 return (TYPE_UNSIGNED (outer_type) == TYPE_UNSIGNED (inner_type)
11633 && POINTER_TYPE_P (outer_type) == POINTER_TYPE_P (inner_type));
11636 /* Strip conversions from EXP according to tree_nop_conversion and
11637 return the resulting expression. */
11639 tree
11640 tree_strip_nop_conversions (tree exp)
11642 while (tree_nop_conversion (exp))
11643 exp = TREE_OPERAND (exp, 0);
11644 return exp;
11647 /* Strip conversions from EXP according to tree_sign_nop_conversion
11648 and return the resulting expression. */
11650 tree
11651 tree_strip_sign_nop_conversions (tree exp)
11653 while (tree_sign_nop_conversion (exp))
11654 exp = TREE_OPERAND (exp, 0);
11655 return exp;
11658 /* Avoid any floating point extensions from EXP. */
11659 tree
11660 strip_float_extensions (tree exp)
11662 tree sub, expt, subt;
11664 /* For floating point constant look up the narrowest type that can hold
11665 it properly and handle it like (type)(narrowest_type)constant.
11666 This way we can optimize for instance a=a*2.0 where "a" is float
11667 but 2.0 is double constant. */
11668 if (TREE_CODE (exp) == REAL_CST && !DECIMAL_FLOAT_TYPE_P (TREE_TYPE (exp)))
11670 REAL_VALUE_TYPE orig;
11671 tree type = NULL;
11673 orig = TREE_REAL_CST (exp);
11674 if (TYPE_PRECISION (TREE_TYPE (exp)) > TYPE_PRECISION (float_type_node)
11675 && exact_real_truncate (TYPE_MODE (float_type_node), &orig))
11676 type = float_type_node;
11677 else if (TYPE_PRECISION (TREE_TYPE (exp))
11678 > TYPE_PRECISION (double_type_node)
11679 && exact_real_truncate (TYPE_MODE (double_type_node), &orig))
11680 type = double_type_node;
11681 if (type)
11682 return build_real (type, real_value_truncate (TYPE_MODE (type), orig));
11685 if (!CONVERT_EXPR_P (exp))
11686 return exp;
11688 sub = TREE_OPERAND (exp, 0);
11689 subt = TREE_TYPE (sub);
11690 expt = TREE_TYPE (exp);
11692 if (!FLOAT_TYPE_P (subt))
11693 return exp;
11695 if (DECIMAL_FLOAT_TYPE_P (expt) != DECIMAL_FLOAT_TYPE_P (subt))
11696 return exp;
11698 if (TYPE_PRECISION (subt) > TYPE_PRECISION (expt))
11699 return exp;
11701 return strip_float_extensions (sub);
11704 /* Strip out all handled components that produce invariant
11705 offsets. */
11707 const_tree
11708 strip_invariant_refs (const_tree op)
11710 while (handled_component_p (op))
11712 switch (TREE_CODE (op))
11714 case ARRAY_REF:
11715 case ARRAY_RANGE_REF:
11716 if (!is_gimple_constant (TREE_OPERAND (op, 1))
11717 || TREE_OPERAND (op, 2) != NULL_TREE
11718 || TREE_OPERAND (op, 3) != NULL_TREE)
11719 return NULL;
11720 break;
11722 case COMPONENT_REF:
11723 if (TREE_OPERAND (op, 2) != NULL_TREE)
11724 return NULL;
11725 break;
11727 default:;
11729 op = TREE_OPERAND (op, 0);
11732 return op;
11735 static GTY(()) tree gcc_eh_personality_decl;
11737 /* Return the GCC personality function decl. */
11739 tree
11740 lhd_gcc_personality (void)
11742 if (!gcc_eh_personality_decl)
11743 gcc_eh_personality_decl = build_personality_function ("gcc");
11744 return gcc_eh_personality_decl;
11747 /* For languages with One Definition Rule, work out if
11748 trees are actually the same even if the tree representation
11749 differs. This handles only decls appearing in TYPE_NAME
11750 and TYPE_CONTEXT. That is NAMESPACE_DECL, TYPE_DECL,
11751 RECORD_TYPE and IDENTIFIER_NODE. */
11753 static bool
11754 same_for_odr (tree t1, tree t2)
11756 if (t1 == t2)
11757 return true;
11758 if (!t1 || !t2)
11759 return false;
11760 /* C and C++ FEs differ by using IDENTIFIER_NODE and TYPE_DECL. */
11761 if (TREE_CODE (t1) == IDENTIFIER_NODE
11762 && TREE_CODE (t2) == TYPE_DECL
11763 && DECL_FILE_SCOPE_P (t1))
11765 t2 = DECL_NAME (t2);
11766 gcc_assert (TREE_CODE (t2) == IDENTIFIER_NODE);
11768 if (TREE_CODE (t2) == IDENTIFIER_NODE
11769 && TREE_CODE (t1) == TYPE_DECL
11770 && DECL_FILE_SCOPE_P (t2))
11772 t1 = DECL_NAME (t1);
11773 gcc_assert (TREE_CODE (t1) == IDENTIFIER_NODE);
11775 if (TREE_CODE (t1) != TREE_CODE (t2))
11776 return false;
11777 if (TYPE_P (t1))
11778 return types_same_for_odr (t1, t2);
11779 if (DECL_P (t1))
11780 return decls_same_for_odr (t1, t2);
11781 return false;
11784 /* For languages with One Definition Rule, work out if
11785 decls are actually the same even if the tree representation
11786 differs. This handles only decls appearing in TYPE_NAME
11787 and TYPE_CONTEXT. That is NAMESPACE_DECL, TYPE_DECL,
11788 RECORD_TYPE and IDENTIFIER_NODE. */
11790 static bool
11791 decls_same_for_odr (tree decl1, tree decl2)
11793 if (decl1 && TREE_CODE (decl1) == TYPE_DECL
11794 && DECL_ORIGINAL_TYPE (decl1))
11795 decl1 = DECL_ORIGINAL_TYPE (decl1);
11796 if (decl2 && TREE_CODE (decl2) == TYPE_DECL
11797 && DECL_ORIGINAL_TYPE (decl2))
11798 decl2 = DECL_ORIGINAL_TYPE (decl2);
11799 if (decl1 == decl2)
11800 return true;
11801 if (!decl1 || !decl2)
11802 return false;
11803 gcc_checking_assert (DECL_P (decl1) && DECL_P (decl2));
11804 if (TREE_CODE (decl1) != TREE_CODE (decl2))
11805 return false;
11806 if (TREE_CODE (decl1) == TRANSLATION_UNIT_DECL)
11807 return true;
11808 if (TREE_CODE (decl1) != NAMESPACE_DECL
11809 && TREE_CODE (decl1) != TYPE_DECL)
11810 return false;
11811 if (!DECL_NAME (decl1))
11812 return false;
11813 gcc_checking_assert (TREE_CODE (DECL_NAME (decl1)) == IDENTIFIER_NODE);
11814 gcc_checking_assert (!DECL_NAME (decl2)
11815 || TREE_CODE (DECL_NAME (decl2)) == IDENTIFIER_NODE);
11816 if (DECL_NAME (decl1) != DECL_NAME (decl2))
11817 return false;
11818 return same_for_odr (DECL_CONTEXT (decl1),
11819 DECL_CONTEXT (decl2));
11822 /* For languages with One Definition Rule, work out if
11823 types are same even if the tree representation differs.
11824 This is non-trivial for LTO where minnor differences in
11825 the type representation may have prevented type merging
11826 to merge two copies of otherwise equivalent type. */
11828 bool
11829 types_same_for_odr (tree type1, tree type2)
11831 gcc_checking_assert (TYPE_P (type1) && TYPE_P (type2));
11832 type1 = TYPE_MAIN_VARIANT (type1);
11833 type2 = TYPE_MAIN_VARIANT (type2);
11834 if (type1 == type2)
11835 return true;
11837 #ifndef ENABLE_CHECKING
11838 if (!in_lto_p)
11839 return false;
11840 #endif
11842 /* Check for anonymous namespaces. Those have !TREE_PUBLIC
11843 on the corresponding TYPE_STUB_DECL. */
11844 if (type_in_anonymous_namespace_p (type1)
11845 || type_in_anonymous_namespace_p (type2))
11846 return false;
11847 /* When assembler name of virtual table is available, it is
11848 easy to compare types for equivalence. */
11849 if (TYPE_BINFO (type1) && TYPE_BINFO (type2)
11850 && BINFO_VTABLE (TYPE_BINFO (type1))
11851 && BINFO_VTABLE (TYPE_BINFO (type2)))
11853 tree v1 = BINFO_VTABLE (TYPE_BINFO (type1));
11854 tree v2 = BINFO_VTABLE (TYPE_BINFO (type2));
11856 if (TREE_CODE (v1) == POINTER_PLUS_EXPR)
11858 if (TREE_CODE (v2) != POINTER_PLUS_EXPR
11859 || !operand_equal_p (TREE_OPERAND (v1, 1),
11860 TREE_OPERAND (v2, 1), 0))
11861 return false;
11862 v1 = TREE_OPERAND (TREE_OPERAND (v1, 0), 0);
11863 v2 = TREE_OPERAND (TREE_OPERAND (v2, 0), 0);
11865 v1 = DECL_ASSEMBLER_NAME (v1);
11866 v2 = DECL_ASSEMBLER_NAME (v2);
11867 return (v1 == v2);
11870 /* FIXME: the code comparing type names consider all instantiations of the
11871 same template to have same name. This is because we have no access
11872 to template parameters. For types with no virtual method tables
11873 we thus can return false positives. At the moment we do not need
11874 to compare types in other scenarios than devirtualization. */
11876 /* If types are not structuraly same, do not bother to contnue.
11877 Match in the remainder of code would mean ODR violation. */
11878 if (!types_compatible_p (type1, type2))
11879 return false;
11880 if (!TYPE_NAME (type1))
11881 return false;
11882 if (!decls_same_for_odr (TYPE_NAME (type1), TYPE_NAME (type2)))
11883 return false;
11884 if (!same_for_odr (TYPE_CONTEXT (type1), TYPE_CONTEXT (type2)))
11885 return false;
11886 /* When not in LTO the MAIN_VARIANT check should be the same. */
11887 gcc_assert (in_lto_p);
11889 return true;
11892 /* TARGET is a call target of GIMPLE call statement
11893 (obtained by gimple_call_fn). Return true if it is
11894 OBJ_TYPE_REF representing an virtual call of C++ method.
11895 (As opposed to OBJ_TYPE_REF representing objc calls
11896 through a cast where middle-end devirtualization machinery
11897 can't apply.) */
11899 bool
11900 virtual_method_call_p (tree target)
11902 if (TREE_CODE (target) != OBJ_TYPE_REF)
11903 return false;
11904 target = TREE_TYPE (target);
11905 gcc_checking_assert (TREE_CODE (target) == POINTER_TYPE);
11906 target = TREE_TYPE (target);
11907 if (TREE_CODE (target) == FUNCTION_TYPE)
11908 return false;
11909 gcc_checking_assert (TREE_CODE (target) == METHOD_TYPE);
11910 return true;
11913 /* REF is OBJ_TYPE_REF, return the class the ref corresponds to. */
11915 tree
11916 obj_type_ref_class (tree ref)
11918 gcc_checking_assert (TREE_CODE (ref) == OBJ_TYPE_REF);
11919 ref = TREE_TYPE (ref);
11920 gcc_checking_assert (TREE_CODE (ref) == POINTER_TYPE);
11921 ref = TREE_TYPE (ref);
11922 /* We look for type THIS points to. ObjC also builds
11923 OBJ_TYPE_REF with non-method calls, Their first parameter
11924 ID however also corresponds to class type. */
11925 gcc_checking_assert (TREE_CODE (ref) == METHOD_TYPE
11926 || TREE_CODE (ref) == FUNCTION_TYPE);
11927 ref = TREE_VALUE (TYPE_ARG_TYPES (ref));
11928 gcc_checking_assert (TREE_CODE (ref) == POINTER_TYPE);
11929 return TREE_TYPE (ref);
11932 /* Return true if T is in anonymous namespace. */
11934 bool
11935 type_in_anonymous_namespace_p (tree t)
11937 return (TYPE_STUB_DECL (t) && !TREE_PUBLIC (TYPE_STUB_DECL (t)));
11940 /* Try to find a base info of BINFO that would have its field decl at offset
11941 OFFSET within the BINFO type and which is of EXPECTED_TYPE. If it can be
11942 found, return, otherwise return NULL_TREE. */
11944 tree
11945 get_binfo_at_offset (tree binfo, HOST_WIDE_INT offset, tree expected_type)
11947 tree type = BINFO_TYPE (binfo);
11949 while (true)
11951 HOST_WIDE_INT pos, size;
11952 tree fld;
11953 int i;
11955 if (types_same_for_odr (type, expected_type))
11956 return binfo;
11957 if (offset < 0)
11958 return NULL_TREE;
11960 for (fld = TYPE_FIELDS (type); fld; fld = DECL_CHAIN (fld))
11962 if (TREE_CODE (fld) != FIELD_DECL)
11963 continue;
11965 pos = int_bit_position (fld);
11966 size = tree_to_uhwi (DECL_SIZE (fld));
11967 if (pos <= offset && (pos + size) > offset)
11968 break;
11970 if (!fld || TREE_CODE (TREE_TYPE (fld)) != RECORD_TYPE)
11971 return NULL_TREE;
11973 if (!DECL_ARTIFICIAL (fld))
11975 binfo = TYPE_BINFO (TREE_TYPE (fld));
11976 if (!binfo)
11977 return NULL_TREE;
11979 /* Offset 0 indicates the primary base, whose vtable contents are
11980 represented in the binfo for the derived class. */
11981 else if (offset != 0)
11983 tree base_binfo, binfo2 = binfo;
11985 /* Find BINFO corresponding to FLD. This is bit harder
11986 by a fact that in virtual inheritance we may need to walk down
11987 the non-virtual inheritance chain. */
11988 while (true)
11990 tree containing_binfo = NULL, found_binfo = NULL;
11991 for (i = 0; BINFO_BASE_ITERATE (binfo2, i, base_binfo); i++)
11992 if (types_same_for_odr (TREE_TYPE (base_binfo), TREE_TYPE (fld)))
11994 found_binfo = base_binfo;
11995 break;
11997 else
11998 if ((tree_to_shwi (BINFO_OFFSET (base_binfo))
11999 - tree_to_shwi (BINFO_OFFSET (binfo)))
12000 * BITS_PER_UNIT < pos
12001 /* Rule out types with no virtual methods or we can get confused
12002 here by zero sized bases. */
12003 && BINFO_VTABLE (TYPE_BINFO (BINFO_TYPE (base_binfo)))
12004 && (!containing_binfo
12005 || (tree_to_shwi (BINFO_OFFSET (containing_binfo))
12006 < tree_to_shwi (BINFO_OFFSET (base_binfo)))))
12007 containing_binfo = base_binfo;
12008 if (found_binfo)
12010 binfo = found_binfo;
12011 break;
12013 if (!containing_binfo)
12014 return NULL_TREE;
12015 binfo2 = containing_binfo;
12019 type = TREE_TYPE (fld);
12020 offset -= pos;
12024 /* Returns true if X is a typedef decl. */
12026 bool
12027 is_typedef_decl (tree x)
12029 return (x && TREE_CODE (x) == TYPE_DECL
12030 && DECL_ORIGINAL_TYPE (x) != NULL_TREE);
12033 /* Returns true iff TYPE is a type variant created for a typedef. */
12035 bool
12036 typedef_variant_p (tree type)
12038 return is_typedef_decl (TYPE_NAME (type));
12041 /* Warn about a use of an identifier which was marked deprecated. */
12042 void
12043 warn_deprecated_use (tree node, tree attr)
12045 const char *msg;
12047 if (node == 0 || !warn_deprecated_decl)
12048 return;
12050 if (!attr)
12052 if (DECL_P (node))
12053 attr = DECL_ATTRIBUTES (node);
12054 else if (TYPE_P (node))
12056 tree decl = TYPE_STUB_DECL (node);
12057 if (decl)
12058 attr = lookup_attribute ("deprecated",
12059 TYPE_ATTRIBUTES (TREE_TYPE (decl)));
12063 if (attr)
12064 attr = lookup_attribute ("deprecated", attr);
12066 if (attr)
12067 msg = TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr)));
12068 else
12069 msg = NULL;
12071 if (DECL_P (node))
12073 expanded_location xloc = expand_location (DECL_SOURCE_LOCATION (node));
12074 if (msg)
12075 warning (OPT_Wdeprecated_declarations,
12076 "%qD is deprecated (declared at %r%s:%d%R): %s",
12077 node, "locus", xloc.file, xloc.line, msg);
12078 else
12079 warning (OPT_Wdeprecated_declarations,
12080 "%qD is deprecated (declared at %r%s:%d%R)",
12081 node, "locus", xloc.file, xloc.line);
12083 else if (TYPE_P (node))
12085 tree what = NULL_TREE;
12086 tree decl = TYPE_STUB_DECL (node);
12088 if (TYPE_NAME (node))
12090 if (TREE_CODE (TYPE_NAME (node)) == IDENTIFIER_NODE)
12091 what = TYPE_NAME (node);
12092 else if (TREE_CODE (TYPE_NAME (node)) == TYPE_DECL
12093 && DECL_NAME (TYPE_NAME (node)))
12094 what = DECL_NAME (TYPE_NAME (node));
12097 if (decl)
12099 expanded_location xloc
12100 = expand_location (DECL_SOURCE_LOCATION (decl));
12101 if (what)
12103 if (msg)
12104 warning (OPT_Wdeprecated_declarations,
12105 "%qE is deprecated (declared at %r%s:%d%R): %s",
12106 what, "locus", xloc.file, xloc.line, msg);
12107 else
12108 warning (OPT_Wdeprecated_declarations,
12109 "%qE is deprecated (declared at %r%s:%d%R)",
12110 what, "locus", xloc.file, xloc.line);
12112 else
12114 if (msg)
12115 warning (OPT_Wdeprecated_declarations,
12116 "type is deprecated (declared at %r%s:%d%R): %s",
12117 "locus", xloc.file, xloc.line, msg);
12118 else
12119 warning (OPT_Wdeprecated_declarations,
12120 "type is deprecated (declared at %r%s:%d%R)",
12121 "locus", xloc.file, xloc.line);
12124 else
12126 if (what)
12128 if (msg)
12129 warning (OPT_Wdeprecated_declarations, "%qE is deprecated: %s",
12130 what, msg);
12131 else
12132 warning (OPT_Wdeprecated_declarations, "%qE is deprecated", what);
12134 else
12136 if (msg)
12137 warning (OPT_Wdeprecated_declarations, "type is deprecated: %s",
12138 msg);
12139 else
12140 warning (OPT_Wdeprecated_declarations, "type is deprecated");
12146 /* Return true if REF has a COMPONENT_REF with a bit-field field declaration
12147 somewhere in it. */
12149 bool
12150 contains_bitfld_component_ref_p (const_tree ref)
12152 while (handled_component_p (ref))
12154 if (TREE_CODE (ref) == COMPONENT_REF
12155 && DECL_BIT_FIELD (TREE_OPERAND (ref, 1)))
12156 return true;
12157 ref = TREE_OPERAND (ref, 0);
12160 return false;
12163 /* Try to determine whether a TRY_CATCH expression can fall through.
12164 This is a subroutine of block_may_fallthru. */
12166 static bool
12167 try_catch_may_fallthru (const_tree stmt)
12169 tree_stmt_iterator i;
12171 /* If the TRY block can fall through, the whole TRY_CATCH can
12172 fall through. */
12173 if (block_may_fallthru (TREE_OPERAND (stmt, 0)))
12174 return true;
12176 i = tsi_start (TREE_OPERAND (stmt, 1));
12177 switch (TREE_CODE (tsi_stmt (i)))
12179 case CATCH_EXPR:
12180 /* We expect to see a sequence of CATCH_EXPR trees, each with a
12181 catch expression and a body. The whole TRY_CATCH may fall
12182 through iff any of the catch bodies falls through. */
12183 for (; !tsi_end_p (i); tsi_next (&i))
12185 if (block_may_fallthru (CATCH_BODY (tsi_stmt (i))))
12186 return true;
12188 return false;
12190 case EH_FILTER_EXPR:
12191 /* The exception filter expression only matters if there is an
12192 exception. If the exception does not match EH_FILTER_TYPES,
12193 we will execute EH_FILTER_FAILURE, and we will fall through
12194 if that falls through. If the exception does match
12195 EH_FILTER_TYPES, the stack unwinder will continue up the
12196 stack, so we will not fall through. We don't know whether we
12197 will throw an exception which matches EH_FILTER_TYPES or not,
12198 so we just ignore EH_FILTER_TYPES and assume that we might
12199 throw an exception which doesn't match. */
12200 return block_may_fallthru (EH_FILTER_FAILURE (tsi_stmt (i)));
12202 default:
12203 /* This case represents statements to be executed when an
12204 exception occurs. Those statements are implicitly followed
12205 by a RESX statement to resume execution after the exception.
12206 So in this case the TRY_CATCH never falls through. */
12207 return false;
12211 /* Try to determine if we can fall out of the bottom of BLOCK. This guess
12212 need not be 100% accurate; simply be conservative and return true if we
12213 don't know. This is used only to avoid stupidly generating extra code.
12214 If we're wrong, we'll just delete the extra code later. */
12216 bool
12217 block_may_fallthru (const_tree block)
12219 /* This CONST_CAST is okay because expr_last returns its argument
12220 unmodified and we assign it to a const_tree. */
12221 const_tree stmt = expr_last (CONST_CAST_TREE (block));
12223 switch (stmt ? TREE_CODE (stmt) : ERROR_MARK)
12225 case GOTO_EXPR:
12226 case RETURN_EXPR:
12227 /* Easy cases. If the last statement of the block implies
12228 control transfer, then we can't fall through. */
12229 return false;
12231 case SWITCH_EXPR:
12232 /* If SWITCH_LABELS is set, this is lowered, and represents a
12233 branch to a selected label and hence can not fall through.
12234 Otherwise SWITCH_BODY is set, and the switch can fall
12235 through. */
12236 return SWITCH_LABELS (stmt) == NULL_TREE;
12238 case COND_EXPR:
12239 if (block_may_fallthru (COND_EXPR_THEN (stmt)))
12240 return true;
12241 return block_may_fallthru (COND_EXPR_ELSE (stmt));
12243 case BIND_EXPR:
12244 return block_may_fallthru (BIND_EXPR_BODY (stmt));
12246 case TRY_CATCH_EXPR:
12247 return try_catch_may_fallthru (stmt);
12249 case TRY_FINALLY_EXPR:
12250 /* The finally clause is always executed after the try clause,
12251 so if it does not fall through, then the try-finally will not
12252 fall through. Otherwise, if the try clause does not fall
12253 through, then when the finally clause falls through it will
12254 resume execution wherever the try clause was going. So the
12255 whole try-finally will only fall through if both the try
12256 clause and the finally clause fall through. */
12257 return (block_may_fallthru (TREE_OPERAND (stmt, 0))
12258 && block_may_fallthru (TREE_OPERAND (stmt, 1)));
12260 case MODIFY_EXPR:
12261 if (TREE_CODE (TREE_OPERAND (stmt, 1)) == CALL_EXPR)
12262 stmt = TREE_OPERAND (stmt, 1);
12263 else
12264 return true;
12265 /* FALLTHRU */
12267 case CALL_EXPR:
12268 /* Functions that do not return do not fall through. */
12269 return (call_expr_flags (stmt) & ECF_NORETURN) == 0;
12271 case CLEANUP_POINT_EXPR:
12272 return block_may_fallthru (TREE_OPERAND (stmt, 0));
12274 case TARGET_EXPR:
12275 return block_may_fallthru (TREE_OPERAND (stmt, 1));
12277 case ERROR_MARK:
12278 return true;
12280 default:
12281 return lang_hooks.block_may_fallthru (stmt);
12285 /* True if we are using EH to handle cleanups. */
12286 static bool using_eh_for_cleanups_flag = false;
12288 /* This routine is called from front ends to indicate eh should be used for
12289 cleanups. */
12290 void
12291 using_eh_for_cleanups (void)
12293 using_eh_for_cleanups_flag = true;
12296 /* Query whether EH is used for cleanups. */
12297 bool
12298 using_eh_for_cleanups_p (void)
12300 return using_eh_for_cleanups_flag;
12303 /* Wrapper for tree_code_name to ensure that tree code is valid */
12304 const char *
12305 get_tree_code_name (enum tree_code code)
12307 const char *invalid = "<invalid tree code>";
12309 if (code >= MAX_TREE_CODES)
12310 return invalid;
12312 return tree_code_name[code];
12315 /* Drops the TREE_OVERFLOW flag from T. */
12317 tree
12318 drop_tree_overflow (tree t)
12320 gcc_checking_assert (TREE_OVERFLOW (t));
12322 /* For tree codes with a sharing machinery re-build the result. */
12323 if (TREE_CODE (t) == INTEGER_CST)
12324 return build_int_cst_wide (TREE_TYPE (t),
12325 TREE_INT_CST_LOW (t), TREE_INT_CST_HIGH (t));
12327 /* Otherwise, as all tcc_constants are possibly shared, copy the node
12328 and drop the flag. */
12329 t = copy_node (t);
12330 TREE_OVERFLOW (t) = 0;
12331 return t;
12334 /* Given a memory reference expression T, return its base address.
12335 The base address of a memory reference expression is the main
12336 object being referenced. For instance, the base address for
12337 'array[i].fld[j]' is 'array'. You can think of this as stripping
12338 away the offset part from a memory address.
12340 This function calls handled_component_p to strip away all the inner
12341 parts of the memory reference until it reaches the base object. */
12343 tree
12344 get_base_address (tree t)
12346 while (handled_component_p (t))
12347 t = TREE_OPERAND (t, 0);
12349 if ((TREE_CODE (t) == MEM_REF
12350 || TREE_CODE (t) == TARGET_MEM_REF)
12351 && TREE_CODE (TREE_OPERAND (t, 0)) == ADDR_EXPR)
12352 t = TREE_OPERAND (TREE_OPERAND (t, 0), 0);
12354 /* ??? Either the alias oracle or all callers need to properly deal
12355 with WITH_SIZE_EXPRs before we can look through those. */
12356 if (TREE_CODE (t) == WITH_SIZE_EXPR)
12357 return NULL_TREE;
12359 return t;
12362 #include "gt-tree.h"