]> gcc.gnu.org Git - gcc.git/blame - gcc/tree.h
git://gcc.gnu.org / gcc.git / blame
? search:
summary | shortlog | log | commit | commitdiff | tree
blob | blame (incremental) | history | HEAD
hashtab.h: Update GTY annotations to new syntax
[gcc.git] / gcc / tree.h
CommitLineData
8da1b058 1/* Front-end tree definitions for GNU compiler.
1574ef13 2 Copyright (C) 1989, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
66647d44 3 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009
1ea193c2 4 Free Software Foundation, Inc.
8da1b058 5
1322177d 6This file is part of GCC.
8da1b058 7
1322177d
LB		 8GCC is free software; you can redistribute it and/or modify it under
9the terms of the GNU General Public License as published by the Free
9dcd6f09 10Software Foundation; either version 3, or (at your option) any later
1322177d 11version.
8da1b058 12
1322177d
LB		 13GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14WARRANTY; without even the implied warranty of MERCHANTABILITY or
15FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
16for more details.
8da1b058
RS		 17
18You should have received a copy of the GNU General Public License
9dcd6f09
NC		 19along with GCC; see the file COPYING3. If not see
20<http://www.gnu.org/licenses/>. */
8da1b058 21
df89f8e7
GDR		 22#ifndef GCC_TREE_H
23#define GCC_TREE_H
24
9c5835d5 25#include "hashtab.h"
8da1b058 26#include "machmode.h"
6060edcb 27#include "input.h"
b9dcdee4 28#include "statistics.h"
fa743e8c 29#include "vec.h"
df582833 30#include "double-int.h"
4862826d 31#include "alias.h"
ab442df7 32#include "options.h"
8da1b058 33
d6b12657 34/* Codes of tree nodes */
8da1b058
RS		 35
36#define DEFTREECODE(SYM, STRING, TYPE, NARGS) SYM,
c0ed0531 37#define END_OF_BASE_TREE_CODES LAST_AND_UNUSED_TREE_CODE,
8da1b058
RS		 38
39enum tree_code {
c0ed0531
ILT		 40#include "all-tree.def"
41MAX_TREE_CODES
8da1b058
RS		 42};
43
44#undef DEFTREECODE
c0ed0531 45#undef END_OF_BASE_TREE_CODES
8da1b058 46
00ffc97c 47extern unsigned char tree_contains_struct[MAX_TREE_CODES][64];
820cc88f
DB		 48#define CODE_CONTAINS_STRUCT(CODE, STRUCT) (tree_contains_struct[(CODE)][(STRUCT)])
49
8d5e6e25
RK		 50/* Number of language-independent tree codes. */
51#define NUM_TREE_CODES ((int) LAST_AND_UNUSED_TREE_CODE)
8da1b058 52
6615c446
JO		 53/* Tree code classes. */
54
55/* Each tree_code has an associated code class represented by a
56 TREE_CODE_CLASS. */
57
58enum tree_code_class {
59 tcc_exceptional, /* An exceptional code (fits no category). */
60 tcc_constant, /* A constant. */
38b3627d 61 /* Order of tcc_type and tcc_declaration is important. */
6615c446
JO		 62 tcc_type, /* A type object code. */
63 tcc_declaration, /* A declaration (also serving as variable refs). */
64 tcc_reference, /* A reference to storage. */
65 tcc_comparison, /* A comparison expression. */
66 tcc_unary, /* A unary arithmetic expression. */
67 tcc_binary, /* A binary arithmetic expression. */
68 tcc_statement, /* A statement expression, which have side effects
69 but usually no interesting value. */
5039610b
SL		 70 tcc_vl_exp, /* A function call or other expression with a
71 variable-length operand vector. */
726a989a 72 tcc_expression /* Any other expression. */
6615c446
JO		 73};
74
75/* Each tree code class has an associated string representation.
76 These must correspond to the tree_code_class entries. */
77
b85e3643 78extern const char *const tree_code_class_strings[];
6615c446
JO		 79
80/* Returns the string representing CLASS. */
81
82#define TREE_CODE_CLASS_STRING(CLASS)\
83 tree_code_class_strings[(int) (CLASS)]
8da1b058 84
6615c446 85extern const enum tree_code_class tree_code_type[];
0a6969ad 86#define TREE_CODE_CLASS(CODE) tree_code_type[(int) (CODE)]
8da1b058 87
6615c446
JO		 88/* Nonzero if CODE represents an exceptional code. */
89
90#define EXCEPTIONAL_CLASS_P(CODE)\
91 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_exceptional)
92
93/* Nonzero if CODE represents a constant. */
94
95#define CONSTANT_CLASS_P(CODE)\
96 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_constant)
97
98/* Nonzero if CODE represents a type. */
99
100#define TYPE_P(CODE)\
101 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_type)
102
103/* Nonzero if CODE represents a declaration. */
104
105#define DECL_P(CODE)\
106 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_declaration)
107
820cc88f
DB		 108/* Nonzero if DECL represents a VAR_DECL or FUNCTION_DECL. */
109
110#define VAR_OR_FUNCTION_DECL_P(DECL)\
111 (TREE_CODE (DECL) == VAR_DECL || TREE_CODE (DECL) == FUNCTION_DECL)
112
38b3627d
NS		 113/* Nonzero if CODE represents a INDIRECT_REF. Keep these checks in
114 ascending code order. */
820cc88f 115
1b096a0a
DB		 116#define INDIRECT_REF_P(CODE)\
117 (TREE_CODE (CODE) == INDIRECT_REF \
38b3627d
NS		 118 || TREE_CODE (CODE) == ALIGN_INDIRECT_REF \
119 || TREE_CODE (CODE) == MISALIGNED_INDIRECT_REF)
1b096a0a 120
6615c446
JO		 121/* Nonzero if CODE represents a reference. */
122
123#define REFERENCE_CLASS_P(CODE)\
124 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_reference)
125
126/* Nonzero if CODE represents a comparison. */
127
128#define COMPARISON_CLASS_P(CODE)\
129 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_comparison)
130
131/* Nonzero if CODE represents a unary arithmetic expression. */
132
133#define UNARY_CLASS_P(CODE)\
134 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_unary)
135
136/* Nonzero if CODE represents a binary arithmetic expression. */
137
138#define BINARY_CLASS_P(CODE)\
139 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_binary)
140
141/* Nonzero if CODE represents a statement expression. */
142
143#define STATEMENT_CLASS_P(CODE)\
144 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_statement)
145
5039610b
SL		 146/* Nonzero if CODE represents a function call-like expression with a
147 variable-length operand vector. */
148
149#define VL_EXP_CLASS_P(CODE)\
150 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_vl_exp)
151
6615c446
JO		 152/* Nonzero if CODE represents any other expression. */
153
154#define EXPRESSION_CLASS_P(CODE)\
155 (TREE_CODE_CLASS (TREE_CODE (CODE)) == tcc_expression)
156
6615c446
JO		 157/* Returns nonzero iff CODE represents a type or declaration. */
158
159#define IS_TYPE_OR_DECL_P(CODE)\
160 (TYPE_P (CODE) || DECL_P (CODE))
4f976745 161
0e9e1e0a 162/* Returns nonzero iff CLASS is the tree-code class of an
4da05956
MM		 163 expression. */
164
6615c446 165#define IS_EXPR_CODE_CLASS(CLASS)\
4600cc14 166 ((CLASS) >= tcc_reference && (CLASS) <= tcc_expression)
c25d44dd
JM		 167
168/* Returns nonzero iff NODE is an expression of some kind. */
169
170#define EXPR_P(NODE) IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (NODE)))
4da05956 171
8da1b058
RS		 172/* Number of argument-words in each kind of tree-node. */
173
2f9834e8 174extern const unsigned char tree_code_length[];
8d5e6e25 175#define TREE_CODE_LENGTH(CODE) tree_code_length[(int) (CODE)]
8da1b058
RS		 176
177/* Names of tree components. */
178
2f9834e8 179extern const char *const tree_code_name[];
fa743e8c 180
d4e6fecb
NS		 181/* A vectors of trees. */
182DEF_VEC_P(tree);
183DEF_VEC_ALLOC_P(tree,gc);
184DEF_VEC_ALLOC_P(tree,heap);
fa743e8c 185
8da1b058 186\f
9df2c88c
RK		 187/* Classify which part of the compiler has defined a given builtin function.
188 Note that we assume below that this is no more than two bits. */
26db82d8
BS		 189enum built_in_class
190{
191 NOT_BUILT_IN = 0,
192 BUILT_IN_FRONTEND,
193 BUILT_IN_MD,
194 BUILT_IN_NORMAL
195};
9df2c88c
RK		 196
197/* Names for the above. */
fd05eb80 198extern const char *const built_in_class_names[4];
9df2c88c 199
8da1b058
RS		 200/* Codes that identify the various built in functions
201 so that expand_call can identify them quickly. */
202
c6a912da 203#define DEF_BUILTIN(ENUM, N, C, T, LT, B, F, NA, AT, IM, COND) ENUM,
8da1b058
RS		 204enum built_in_function
205{
cb1072f4 206#include "builtins.def"
972ded9c 207
7e7e470f
RH		 208 /* Complex division routines in libgcc. These are done via builtins
209 because emit_library_call_value can't handle complex values. */
210 BUILT_IN_COMPLEX_MUL_MIN,
211 BUILT_IN_COMPLEX_MUL_MAX
212 = BUILT_IN_COMPLEX_MUL_MIN
213 + MAX_MODE_COMPLEX_FLOAT
214 - MIN_MODE_COMPLEX_FLOAT,
215
216 BUILT_IN_COMPLEX_DIV_MIN,
217 BUILT_IN_COMPLEX_DIV_MAX
218 = BUILT_IN_COMPLEX_DIV_MIN
219 + MAX_MODE_COMPLEX_FLOAT
220 - MIN_MODE_COMPLEX_FLOAT,
221
2ba84f36 222 /* Upper bound on non-language-specific builtins. */
972ded9c 223 END_BUILTINS
8da1b058 224};
cb1072f4 225#undef DEF_BUILTIN
9df2c88c
RK		 226
227/* Names for the above. */
7e7e470f 228extern const char * built_in_names[(int) END_BUILTINS];
3ff5f682 229
82b4201f
KG		 230/* Helper macros for math builtins. */
231
232#define BUILTIN_EXP10_P(FN) \
233 ((FN) == BUILT_IN_EXP10 || (FN) == BUILT_IN_EXP10F || (FN) == BUILT_IN_EXP10L \
234 || (FN) == BUILT_IN_POW10 || (FN) == BUILT_IN_POW10F || (FN) == BUILT_IN_POW10L)
235
236#define BUILTIN_EXPONENT_P(FN) (BUILTIN_EXP10_P (FN) \
237 || (FN) == BUILT_IN_EXP || (FN) == BUILT_IN_EXPF || (FN) == BUILT_IN_EXPL \
238 || (FN) == BUILT_IN_EXP2 || (FN) == BUILT_IN_EXP2F || (FN) == BUILT_IN_EXP2L)
239
240#define BUILTIN_SQRT_P(FN) \
241 ((FN) == BUILT_IN_SQRT || (FN) == BUILT_IN_SQRTF || (FN) == BUILT_IN_SQRTL)
242
243#define BUILTIN_CBRT_P(FN) \
244 ((FN) == BUILT_IN_CBRT || (FN) == BUILT_IN_CBRTF || (FN) == BUILT_IN_CBRTL)
245
246#define BUILTIN_ROOT_P(FN) (BUILTIN_SQRT_P (FN) || BUILTIN_CBRT_P (FN))
247
ea6a6627 248#define CASE_FLT_FN(FN) case FN: case FN##F: case FN##L
752b7d38 249#define CASE_FLT_FN_REENT(FN) case FN##_R: case FN##F_R: case FN##L_R
ea6a6627
VR		 250#define CASE_INT_FN(FN) case FN: case FN##L: case FN##LL
251
3ff5f682 252/* An array of _DECL trees for the above. */
17211ab5 253extern GTY(()) tree built_in_decls[(int) END_BUILTINS];
272f51a3 254extern GTY(()) tree implicit_built_in_decls[(int) END_BUILTINS];
8da1b058 255\f
aaf46ef9
DN		 256/* In an OMP_CLAUSE node. */
257
258/* Number of operands and names for each clause. */
259extern unsigned const char omp_clause_num_ops[];
260extern const char * const omp_clause_code_name[];
261
262/* Clause codes. Do not reorder, as this is used to index into the tables
263 omp_clause_num_ops and omp_clause_code_name. */
264enum omp_clause_code
265{
266 /* Clause zero is special-cased inside the parser
267 (c_parser_omp_variable_list). */
268 OMP_CLAUSE_ERROR = 0,
269
270 /* OpenMP clause: private (variable_list). */
271 OMP_CLAUSE_PRIVATE,
272
273 /* OpenMP clause: shared (variable_list). */
274 OMP_CLAUSE_SHARED,
275
276 /* OpenMP clause: firstprivate (variable_list). */
277 OMP_CLAUSE_FIRSTPRIVATE,
278
279 /* OpenMP clause: lastprivate (variable_list). */
280 OMP_CLAUSE_LASTPRIVATE,
281
282 /* OpenMP clause: reduction (operator:variable_list).
283 OMP_CLAUSE_REDUCTION_CODE: The tree_code of the operator.
284 Operand 1: OMP_CLAUSE_REDUCTION_INIT: Stmt-list to initialize the var.
0ac11108 285 Operand 2: OMP_CLAUSE_REDUCTION_MERGE: Stmt-list to merge private var
aaf46ef9
DN		 286 into the shared one.
287 Operand 3: OMP_CLAUSE_REDUCTION_PLACEHOLDER: A dummy VAR_DECL
a68ab351 288 placeholder used in OMP_CLAUSE_REDUCTION_{INIT,MERGE}. */
aaf46ef9
DN		 289 OMP_CLAUSE_REDUCTION,
290
291 /* OpenMP clause: copyin (variable_list). */
292 OMP_CLAUSE_COPYIN,
293
294 /* OpenMP clause: copyprivate (variable_list). */
295 OMP_CLAUSE_COPYPRIVATE,
296
297 /* OpenMP clause: if (scalar-expression). */
298 OMP_CLAUSE_IF,
299
300 /* OpenMP clause: num_threads (integer-expression). */
301 OMP_CLAUSE_NUM_THREADS,
302
303 /* OpenMP clause: schedule. */
304 OMP_CLAUSE_SCHEDULE,
305
306 /* OpenMP clause: nowait. */
307 OMP_CLAUSE_NOWAIT,
308
309 /* OpenMP clause: ordered. */
310 OMP_CLAUSE_ORDERED,
311
312 /* OpenMP clause: default. */
a68ab351
JJ		 313 OMP_CLAUSE_DEFAULT,
314
315 /* OpenMP clause: collapse (constant-integer-expression). */
316 OMP_CLAUSE_COLLAPSE,
317
318 /* OpenMP clause: untied. */
319 OMP_CLAUSE_UNTIED
aaf46ef9
DN		 320};
321\f
8da1b058
RS		 322/* The definition of tree nodes fills the next several pages. */
323
324/* A tree node can represent a data type, a variable, an expression
325 or a statement. Each node has a TREE_CODE which says what kind of
326 thing it represents. Some common codes are:
327 INTEGER_TYPE -- represents a type of integers.
328 ARRAY_TYPE -- represents a type of pointer.
329 VAR_DECL -- represents a declared variable.
330 INTEGER_CST -- represents a constant integer value.
331 PLUS_EXPR -- represents a sum (an expression).
332
333 As for the contents of a tree node: there are some fields
334 that all nodes share. Each TREE_CODE has various special-purpose
335 fields as well. The fields of a node are never accessed directly,
336 always through accessor macros. */
337
8da1b058
RS		 338/* Every kind of tree node starts with this structure,
339 so all nodes have these fields.
340
76c9d226 341 See the accessor macros, defined below, for documentation of the
eebedaa5 342 fields. */
6de9cd9a 343union tree_ann_d;
8da1b058 344
d1b38208 345struct GTY(()) tree_base {
00ffc97c 346 ENUM_BITFIELD(tree_code) code : 16;
ae34ac46 347
8da1b058
RS		 348 unsigned side_effects_flag : 1;
349 unsigned constant_flag : 1;
8da1b058
RS		 350 unsigned addressable_flag : 1;
351 unsigned volatile_flag : 1;
352 unsigned readonly_flag : 1;
353 unsigned unsigned_flag : 1;
354 unsigned asm_written_flag: 1;
6de9cd9a 355 unsigned nowarning_flag : 1;
4f976745 356
6de9cd9a 357 unsigned used_flag : 1;
12a22e76 358 unsigned nothrow_flag : 1;
8da1b058
RS		 359 unsigned static_flag : 1;
360 unsigned public_flag : 1;
361 unsigned private_flag : 1;
362 unsigned protected_flag : 1;
e23bd218 363 unsigned deprecated_flag : 1;
325217ed 364 unsigned saturating_flag : 1;
0598f31b 365 unsigned default_def_flag : 1;
8da1b058
RS		 366
367 unsigned lang_flag_0 : 1;
368 unsigned lang_flag_1 : 1;
369 unsigned lang_flag_2 : 1;
370 unsigned lang_flag_3 : 1;
371 unsigned lang_flag_4 : 1;
372 unsigned lang_flag_5 : 1;
373 unsigned lang_flag_6 : 1;
6de9cd9a 374 unsigned visited : 1;
07beea0d 375
51eed280 376 unsigned spare : 23;
00ffc97c 377
07beea0d
AH		 378 union tree_ann_d *ann;
379};
380
d1b38208 381struct GTY(()) tree_common {
07beea0d
AH		 382 struct tree_base base;
383 tree chain;
384 tree type;
385};
386
a5f99f01 387/* The following table lists the uses of each of the above flags and
4cea6c02 388 for which types of nodes they are defined.
a5f99f01
RK		 389
390 addressable_flag:
391
392 TREE_ADDRESSABLE in
4cea6c02
EB		 393 VAR_DECL, FUNCTION_DECL, FIELD_DECL, LABEL_DECL
394 all types
395 CONSTRUCTOR, IDENTIFIER_NODE
396 STMT_EXPR, it means we want the result of the enclosed expression
397
398 CALL_EXPR_TAILCALL in
399 CALL_EXPR
400
401 CASE_LOW_SEEN in
402 CASE_LABEL_EXPR
a5f99f01
RK		 403
404 static_flag:
405
406 TREE_STATIC in
4cea6c02
EB		 407 VAR_DECL, FUNCTION_DECL
408 CONSTRUCTOR
409
410 TREE_NO_TRAMPOLINE in
411 ADDR_EXPR
412
604a3205 413 BINFO_VIRTUAL_P in
809e3e7f 414 TREE_BINFO
4cea6c02 415
a5f99f01
RK		 416 TREE_SYMBOL_REFERENCED in
417 IDENTIFIER_NODE
4cea6c02 418
659e5a7a 419 CLEANUP_EH_ONLY in
5a508662 420 TARGET_EXPR, WITH_CLEANUP_EXPR
4cea6c02 421
33b45227
JM		 422 TRY_CATCH_IS_CLEANUP in
423 TRY_CATCH_EXPR
4cea6c02 424
6de9cd9a
DN		 425 ASM_INPUT_P in
426 ASM_EXPR
4cea6c02
EB		 427
428 EH_FILTER_MUST_NOT_THROW in
429 EH_FILTER_EXPR
430
22421b79
RK		 431 TYPE_REF_CAN_ALIAS_ALL in
432 POINTER_TYPE, REFERENCE_TYPE
4cea6c02 433
79f5e442 434 MOVE_NONTEMPORAL in
726a989a 435 MODIFY_EXPR
4cea6c02 436
e36711f3 437 CASE_HIGH_SEEN in
4cea6c02
EB		 438 CASE_LABEL_EXPR
439
e36711f3 440 CALL_CANNOT_INLINE_P in
4cea6c02 441 CALL_EXPR
a5f99f01
RK		 442
443 public_flag:
444
445 TREE_OVERFLOW in
69ef87e2 446 INTEGER_CST, REAL_CST, COMPLEX_CST, VECTOR_CST
4cea6c02 447
a5f99f01 448 TREE_PUBLIC in
4cea6c02
EB		 449 VAR_DECL, FUNCTION_DECL
450 IDENTIFIER_NODE
451
6de9cd9a
DN		 452 ASM_VOLATILE_P in
453 ASM_EXPR
4cea6c02 454
6ef5231b 455 CALL_EXPR_VA_ARG_PACK in
4cea6c02
EB		 456 CALL_EXPR
457
89b0433e 458 TYPE_CACHED_VALUES_P in
4cea6c02
EB		 459 all types
460
7f5e6307 461 SAVE_EXPR_RESOLVED_P in
4cea6c02
EB		 462 SAVE_EXPR
463
953ff289 464 OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE in
4cea6c02
EB		 465 OMP_CLAUSE_LASTPRIVATE
466
953ff289 467 OMP_CLAUSE_PRIVATE_DEBUG in
4cea6c02 468 OMP_CLAUSE_PRIVATE
a5f99f01
RK		 469
470 private_flag:
471
a5f99f01 472 TREE_PRIVATE in
4cea6c02
EB		 473 all decls
474
fa47911c 475 CALL_EXPR_RETURN_SLOT_OPT in
4977bab6 476 CALL_EXPR
4cea6c02 477
d8472c75
JM		 478 DECL_BY_REFERENCE in
479 PARM_DECL, RESULT_DECL
4cea6c02 480
777f7f9a 481 OMP_SECTION_LAST in
4cea6c02
EB		 482 OMP_SECTION
483
761041be 484 OMP_PARALLEL_COMBINED in
4cea6c02 485 OMP_PARALLEL
a68ab351
JJ		 486 OMP_CLAUSE_PRIVATE_OUTER_REF in
487 OMP_CLAUSE_PRIVATE
a5f99f01
RK		 488
489 protected_flag:
490
a5f99f01
RK		 491 TREE_PROTECTED in
492 BLOCK
4cea6c02
EB		 493 all decls
494
dd292d0a 495 CALL_FROM_THUNK_P in
caf93cb0 496 CALL_EXPR
a5f99f01
RK		 497
498 side_effects_flag:
499
500 TREE_SIDE_EFFECTS in
501 all expressions
4cea6c02
EB		 502 all decls
503 all constants
a5f99f01 504
6de9cd9a 505 FORCED_LABEL in
4cea6c02 506 LABEL_DECL
6de9cd9a 507
a5f99f01
RK		 508 volatile_flag:
509
510 TREE_THIS_VOLATILE in
511 all expressions
4cea6c02
EB		 512 all decls
513
a5f99f01 514 TYPE_VOLATILE in
4cea6c02 515 all types
a5f99f01
RK		 516
517 readonly_flag:
518
519 TREE_READONLY in
e5e809f4 520 all expressions
4cea6c02
EB		 521 all decls
522
a5f99f01 523 TYPE_READONLY in
4cea6c02 524 all types
a5f99f01
RK		 525
526 constant_flag:
527
528 TREE_CONSTANT in
529 all expressions
4cea6c02
EB		 530 all decls
531 all constants
532
533 TYPE_SIZES_GIMPLIFIED in
534 all types
a5f99f01 535
a5f99f01
RK		 536 unsigned_flag:
537
8df83eae
RK		 538 TYPE_UNSIGNED in
539 all types
4cea6c02 540
a150de29
RK		 541 DECL_UNSIGNED in
542 all decls
a5f99f01 543
4cea6c02
EB		 544 REGISTER_DEFS_IN_THIS_STMT in
545 all expressions (tree-into-ssa.c)
546
a5f99f01
RK		 547 asm_written_flag:
548
549 TREE_ASM_WRITTEN in
4cea6c02
EB		 550 VAR_DECL, FUNCTION_DECL
551 RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE
552 BLOCK, SSA_NAME, STRING_CST
553
554 NECESSARY in
555 all expressions (tree-ssa-dce.c, tree-ssa-pre.c)
a5f99f01
RK		 556
557 used_flag:
558
559 TREE_USED in
4cea6c02
EB		 560 all expressions
561 all decls
562 IDENTIFIER_NODE
a5f99f01 563
12a22e76 564 nothrow_flag:
a5f99f01 565
12a22e76 566 TREE_NOTHROW in
4cea6c02
EB		 567 CALL_EXPR
568 FUNCTION_DECL
a5f99f01 569
1e2d4dc1 570 TYPE_ALIGN_OK in
4cea6c02 571 all types
1e2d4dc1 572
5cb2183e 573 TREE_THIS_NOTRAP in
7ccf35ed 574 (ALIGN/MISALIGNED_)INDIRECT_REF, ARRAY_REF, ARRAY_RANGE_REF
5cb2183e 575
e23bd218
IR		 576 deprecated_flag:
577
4cea6c02
EB		 578 TREE_DEPRECATED in
579 all decls
580
581 IDENTIFIER_TRANSPARENT_ALIAS in
582 IDENTIFIER_NODE
dd292d0a 583
4cea6c02
EB		 584 STMT_IN_SSA_EDGE_WORKLIST in
585 all expressions (tree-ssa-propagate.c)
a0203ca7 586
b6fc2cdb
PB		 587 TYPE_VECTOR_OPAQUE in
588 VECTOR_TYPE
589
6de9cd9a
DN		 590 visited:
591
4cea6c02
EB		 592 TREE_VISITED in
593 all trees (used liberally by many passes)
6de9cd9a 594
325217ed
CF		 595 saturating_flag:
596
597 TYPE_SATURATING in
598 all types
599
6de9cd9a
DN		 600 nowarning_flag:
601
602 TREE_NO_WARNING in
4cea6c02
EB		 603 all expressions
604 all decls
605
606 default_def_flag:
607
608 SSA_NAME_IS_DEFAULT_DEF in
609 SSA_NAME
e23bd218 610*/
4cea6c02 611
820cc88f
DB		 612#undef DEFTREESTRUCT
613#define DEFTREESTRUCT(ENUM, NAME) ENUM,
614enum tree_node_structure_enum {
615#include "treestruct.def"
616 LAST_TS_ENUM
617};
618#undef DEFTREESTRUCT
a6d7adfd 619
8da1b058
RS		 620/* Define accessors for the fields that all tree nodes have
621 (though some fields are not used for all kinds of nodes). */
622
623/* The tree-code says what kind of node it is.
624 Codes are defined in tree.def. */
07beea0d
AH		 625#define TREE_CODE(NODE) ((enum tree_code) (NODE)->base.code)
626#define TREE_SET_CODE(NODE, VALUE) ((NODE)->base.code = (VALUE))
8da1b058 627
12b195d9 628/* When checking is enabled, errors will be generated if a tree node
0e61db61 629 is accessed incorrectly. The macros die with a fatal error. */
f4524c9e 630#if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
12b195d9 631
7f42b6d7 632#define TREE_CHECK(T, CODE) __extension__ \
a57193e8 633({ __typeof (T) const __t = (T); \
7f42b6d7 634 if (TREE_CODE (__t) != (CODE)) \
086e3095
NS		 635 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
636 (CODE), 0); \
637 __t; })
638
639#define TREE_NOT_CHECK(T, CODE) __extension__ \
a57193e8 640({ __typeof (T) const __t = (T); \
086e3095
NS		 641 if (TREE_CODE (__t) == (CODE)) \
642 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
643 (CODE), 0); \
8f985ec4 644 __t; })
7f42b6d7 645
eb34af89 646#define TREE_CHECK2(T, CODE1, CODE2) __extension__ \
a57193e8 647({ __typeof (T) const __t = (T); \
eb34af89
RK		 648 if (TREE_CODE (__t) != (CODE1) \
649 && TREE_CODE (__t) != (CODE2)) \
086e3095
NS		 650 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
651 (CODE1), (CODE2), 0); \
652 __t; })
653
654#define TREE_NOT_CHECK2(T, CODE1, CODE2) __extension__ \
a57193e8 655({ __typeof (T) const __t = (T); \
086e3095
NS		 656 if (TREE_CODE (__t) == (CODE1) \
657 || TREE_CODE (__t) == (CODE2)) \
658 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
659 (CODE1), (CODE2), 0); \
eb34af89
RK		 660 __t; })
661
662#define TREE_CHECK3(T, CODE1, CODE2, CODE3) __extension__ \
a57193e8 663({ __typeof (T) const __t = (T); \
eb34af89
RK		 664 if (TREE_CODE (__t) != (CODE1) \
665 && TREE_CODE (__t) != (CODE2) \
666 && TREE_CODE (__t) != (CODE3)) \
086e3095
NS		 667 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
668 (CODE1), (CODE2), (CODE3), 0); \
669 __t; })
670
671#define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) __extension__ \
a57193e8 672({ __typeof (T) const __t = (T); \
086e3095
NS		 673 if (TREE_CODE (__t) == (CODE1) \
674 || TREE_CODE (__t) == (CODE2) \
675 || TREE_CODE (__t) == (CODE3)) \
676 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
677 (CODE1), (CODE2), (CODE3), 0); \
eb34af89
RK		 678 __t; })
679
22421b79 680#define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) __extension__ \
a57193e8 681({ __typeof (T) const __t = (T); \
22421b79
RK		 682 if (TREE_CODE (__t) != (CODE1) \
683 && TREE_CODE (__t) != (CODE2) \
684 && TREE_CODE (__t) != (CODE3) \
685 && TREE_CODE (__t) != (CODE4)) \
086e3095
NS		 686 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
687 (CODE1), (CODE2), (CODE3), (CODE4), 0); \
688 __t; })
689
690#define NON_TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) __extension__ \
a57193e8 691({ __typeof (T) const __t = (T); \
086e3095
NS		 692 if (TREE_CODE (__t) == (CODE1) \
693 || TREE_CODE (__t) == (CODE2) \
694 || TREE_CODE (__t) == (CODE3) \
695 || TREE_CODE (__t) == (CODE4)) \
696 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
697 (CODE1), (CODE2), (CODE3), (CODE4), 0); \
22421b79
RK		 698 __t; })
699
eb34af89 700#define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) __extension__ \
a57193e8 701({ __typeof (T) const __t = (T); \
eb34af89
RK		 702 if (TREE_CODE (__t) != (CODE1) \
703 && TREE_CODE (__t) != (CODE2) \
704 && TREE_CODE (__t) != (CODE3) \
705 && TREE_CODE (__t) != (CODE4) \
706 && TREE_CODE (__t) != (CODE5)) \
086e3095
NS		 707 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
708 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5), 0);\
709 __t; })
710
711#define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) __extension__ \
a57193e8 712({ __typeof (T) const __t = (T); \
086e3095
NS		 713 if (TREE_CODE (__t) == (CODE1) \
714 || TREE_CODE (__t) == (CODE2) \
715 || TREE_CODE (__t) == (CODE3) \
716 || TREE_CODE (__t) == (CODE4) \
717 || TREE_CODE (__t) == (CODE5)) \
718 tree_not_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
719 (CODE1), (CODE2), (CODE3), (CODE4), (CODE5), 0);\
eb34af89
RK		 720 __t; })
721
820cc88f 722#define CONTAINS_STRUCT_CHECK(T, STRUCT) __extension__ \
a57193e8 723({ __typeof (T) const __t = (T); \
820cc88f
DB		 724 if (tree_contains_struct[TREE_CODE(__t)][(STRUCT)] != 1) \
725 tree_contains_struct_check_failed (__t, (STRUCT), __FILE__, __LINE__, \
726 __FUNCTION__); \
727 __t; })
728
7f42b6d7 729#define TREE_CLASS_CHECK(T, CLASS) __extension__ \
a57193e8 730({ __typeof (T) const __t = (T); \
7f42b6d7
RK		 731 if (TREE_CODE_CLASS (TREE_CODE(__t)) != (CLASS)) \
732 tree_class_check_failed (__t, (CLASS), __FILE__, __LINE__, \
b9daac31 733 __FUNCTION__); \
8f985ec4
ZW		 734 __t; })
735
953ff289 736#define TREE_RANGE_CHECK(T, CODE1, CODE2) __extension__ \
a57193e8 737({ __typeof (T) const __t = (T); \
aaf46ef9 738 if (TREE_CODE (__t) < (CODE1) || TREE_CODE (__t) > (CODE2)) \
953ff289
DN		 739 tree_range_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
740 (CODE1), (CODE2)); \
741 __t; })
742
aaf46ef9 743#define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) __extension__ \
a57193e8 744({ __typeof (T) const __t = (T); \
aaf46ef9
DN		 745 if (TREE_CODE (__t) != OMP_CLAUSE) \
746 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
747 OMP_CLAUSE, 0); \
748 if (__t->omp_clause.code != (CODE)) \
749 omp_clause_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
750 (CODE)); \
751 __t; })
752
753#define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) __extension__ \
a57193e8 754({ __typeof (T) const __t = (T); \
aaf46ef9
DN		 755 if (TREE_CODE (__t) != OMP_CLAUSE) \
756 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
757 OMP_CLAUSE, 0); \
758 if ((int) __t->omp_clause.code < (int) (CODE1) \
759 || (int) __t->omp_clause.code > (int) (CODE2)) \
760 omp_clause_range_check_failed (__t, __FILE__, __LINE__, \
761 __FUNCTION__, (CODE1), (CODE2)); \
762 __t; })
763
8f985ec4 764/* These checks have to be special cased. */
7f42b6d7 765#define EXPR_CHECK(T) __extension__ \
a57193e8 766({ __typeof (T) const __t = (T); \
7f42b6d7 767 char const __c = TREE_CODE_CLASS (TREE_CODE (__t)); \
68ad9159 768 if (!IS_EXPR_CODE_CLASS (__c)) \
6615c446 769 tree_class_check_failed (__t, tcc_expression, __FILE__, __LINE__, \
4f976745
RK		 770 __FUNCTION__); \
771 __t; })
772
773/* These checks have to be special cased. */
774#define NON_TYPE_CHECK(T) __extension__ \
a57193e8 775({ __typeof (T) const __t = (T); \
3f724eb8 776 if (TYPE_P (__t)) \
dd5827cb
ILT		 777 tree_not_class_check_failed (__t, tcc_type, __FILE__, __LINE__, \
778 __FUNCTION__); \
8f985ec4
ZW		 779 __t; })
780
7f42b6d7 781#define TREE_VEC_ELT_CHECK(T, I) __extension__ \
a57193e8 782(*({__typeof (T) const __t = (T); \
7f42b6d7 783 const int __i = (I); \
fa7b533b 784 if (TREE_CODE (__t) != TREE_VEC) \
086e3095
NS		 785 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
786 TREE_VEC, 0); \
fa7b533b
ZW		 787 if (__i < 0 || __i >= __t->vec.length) \
788 tree_vec_elt_check_failed (__i, __t->vec.length, \
789 __FILE__, __LINE__, __FUNCTION__); \
790 &__t->vec.a[__i]; }))
791
a57193e8 792#define OMP_CLAUSE_ELT_CHECK(T, I) __extension__ \
becfd6e5 793(*({__typeof (T) const __t = (T); \
a57193e8 794 const int __i = (I); \
aaf46ef9
DN		 795 if (TREE_CODE (__t) != OMP_CLAUSE) \
796 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, \
797 OMP_CLAUSE, 0); \
798 if (__i < 0 || __i >= omp_clause_num_ops [__t->omp_clause.code]) \
799 omp_clause_operand_check_failed (__i, __t, __FILE__, __LINE__, \
800 __FUNCTION__); \
801 &__t->omp_clause.ops[__i]; }))
802
06790e5f 803/* Special checks for TREE_OPERANDs. */
7f42b6d7 804#define TREE_OPERAND_CHECK(T, I) __extension__ \
a57193e8 805(*({__typeof (T) const __t = EXPR_CHECK (T); \
7f42b6d7 806 const int __i = (I); \
5039610b
SL		 807 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t)) \
808 tree_operand_check_failed (__i, __t, \
06790e5f
ZW		 809 __FILE__, __LINE__, __FUNCTION__); \
810 &__t->exp.operands[__i]; }))
811
7f42b6d7 812#define TREE_OPERAND_CHECK_CODE(T, CODE, I) __extension__ \
a57193e8 813(*({__typeof (T) const __t = (T); \
7f42b6d7
RK		 814 const int __i = (I); \
815 if (TREE_CODE (__t) != CODE) \
086e3095 816 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, (CODE), 0);\
5039610b
SL		 817 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t)) \
818 tree_operand_check_failed (__i, __t, \
06790e5f
ZW		 819 __FILE__, __LINE__, __FUNCTION__); \
820 &__t->exp.operands[__i]; }))
821
7f42b6d7 822#define TREE_RTL_OPERAND_CHECK(T, CODE, I) __extension__ \
06790e5f 823(*(rtx *) \
a57193e8 824 ({__typeof (T) const __t = (T); \
7f42b6d7
RK		 825 const int __i = (I); \
826 if (TREE_CODE (__t) != (CODE)) \
086e3095 827 tree_check_failed (__t, __FILE__, __LINE__, __FUNCTION__, (CODE), 0); \
5039610b
SL		 828 if (__i < 0 || __i >= TREE_OPERAND_LENGTH (__t)) \
829 tree_operand_check_failed (__i, __t, \
06790e5f
ZW		 830 __FILE__, __LINE__, __FUNCTION__); \
831 &__t->exp.operands[__i]; }))
832
07beea0d
AH		 833/* Nodes are chained together for many purposes.
834 Types are chained together to record them for being output to the debugger
835 (see the function `chain_type').
836 Decls in the same scope are chained together to record the contents
837 of the scope.
838 Statement nodes for successive statements used to be chained together.
839 Often lists of things are represented by TREE_LIST nodes that
840 are chained together. */
841
842#define TREE_CHAIN(NODE) __extension__ \
a57193e8 843(*({__typeof (NODE) const __t = (NODE); \
07beea0d
AH		 844 &__t->common.chain; }))
845
846/* In all nodes that are expressions, this is the data type of the expression.
847 In POINTER_TYPE nodes, this is the type that the pointer points to.
848 In ARRAY_TYPE nodes, this is the type of the elements.
849 In VECTOR_TYPE nodes, this is the type of the elements. */
850#define TREE_TYPE(NODE) __extension__ \
a57193e8 851(*({__typeof (NODE) const __t = (NODE); \
07beea0d
AH		 852 &__t->common.type; }))
853
741ac903 854extern void tree_contains_struct_check_failed (const_tree,
0ac11108 855 const enum tree_node_structure_enum,
820cc88f
DB		 856 const char *, int, const char *)
857 ATTRIBUTE_NORETURN;
858
741ac903 859extern void tree_check_failed (const_tree, const char *, int, const char *,
086e3095 860 ...) ATTRIBUTE_NORETURN;
741ac903 861extern void tree_not_check_failed (const_tree, const char *, int, const char *,
086e3095 862 ...) ATTRIBUTE_NORETURN;
741ac903 863extern void tree_class_check_failed (const_tree, const enum tree_code_class,
46c5ad27 864 const char *, int, const char *)
8f985ec4 865 ATTRIBUTE_NORETURN;
741ac903 866extern void tree_range_check_failed (const_tree, const char *, int,
953ff289
DN		 867 const char *, enum tree_code,
868 enum tree_code);
741ac903 869extern void tree_not_class_check_failed (const_tree,
dd5827cb
ILT		 870 const enum tree_code_class,
871 const char *, int, const char *)
872 ATTRIBUTE_NORETURN;
46c5ad27
AJ		 873extern void tree_vec_elt_check_failed (int, int, const char *,
874 int, const char *)
fa7b533b 875 ATTRIBUTE_NORETURN;
6de9cd9a
DN		 876extern void phi_node_elt_check_failed (int, int, const char *,
877 int, const char *)
878 ATTRIBUTE_NORETURN;
741ac903 879extern void tree_operand_check_failed (int, const_tree,
46c5ad27 880 const char *, int, const char *)
06790e5f 881 ATTRIBUTE_NORETURN;
741ac903 882extern void omp_clause_check_failed (const_tree, const char *, int,
aaf46ef9
DN		 883 const char *, enum omp_clause_code)
884 ATTRIBUTE_NORETURN;
9566a759 885extern void omp_clause_operand_check_failed (int, const_tree, const char *,
aaf46ef9
DN		 886 int, const char *)
887 ATTRIBUTE_NORETURN;
741ac903 888extern void omp_clause_range_check_failed (const_tree, const char *, int,
aaf46ef9
DN		 889 const char *, enum omp_clause_code,
890 enum omp_clause_code)
891 ATTRIBUTE_NORETURN;
46c5ad27 892
f4524c9e 893#else /* not ENABLE_TREE_CHECKING, or not gcc */
12b195d9 894
820cc88f 895#define CONTAINS_STRUCT_CHECK(T, ENUM) (T)
eb34af89 896#define TREE_CHECK(T, CODE) (T)
086e3095 897#define TREE_NOT_CHECK(T, CODE) (T)
eb34af89 898#define TREE_CHECK2(T, CODE1, CODE2) (T)
086e3095 899#define TREE_NOT_CHECK2(T, CODE1, CODE2) (T)
eb34af89 900#define TREE_CHECK3(T, CODE1, CODE2, CODE3) (T)
086e3095 901#define TREE_NOT_CHECK3(T, CODE1, CODE2, CODE3) (T)
22421b79 902#define TREE_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
086e3095 903#define TREE_NOT_CHECK4(T, CODE1, CODE2, CODE3, CODE4) (T)
eb34af89 904#define TREE_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
086e3095 905#define TREE_NOT_CHECK5(T, CODE1, CODE2, CODE3, CODE4, CODE5) (T)
eb34af89 906#define TREE_CLASS_CHECK(T, CODE) (T)
953ff289 907#define TREE_RANGE_CHECK(T, CODE1, CODE2) (T)
eb34af89 908#define EXPR_CHECK(T) (T)
4f976745 909#define NON_TYPE_CHECK(T) (T)
eb34af89
RK		 910#define TREE_VEC_ELT_CHECK(T, I) ((T)->vec.a[I])
911#define TREE_OPERAND_CHECK(T, I) ((T)->exp.operands[I])
912#define TREE_OPERAND_CHECK_CODE(T, CODE, I) ((T)->exp.operands[I])
7f42b6d7 913#define TREE_RTL_OPERAND_CHECK(T, CODE, I) (*(rtx *) &((T)->exp.operands[I]))
aaf46ef9
DN		 914#define OMP_CLAUSE_ELT_CHECK(T, i) ((T)->omp_clause.ops[i])
915#define OMP_CLAUSE_RANGE_CHECK(T, CODE1, CODE2) (T)
62f3e894 916#define OMP_CLAUSE_SUBCODE_CHECK(T, CODE) (T)
8f985ec4 917
07beea0d
AH		 918#define TREE_CHAIN(NODE) ((NODE)->common.chain)
919#define TREE_TYPE(NODE) ((NODE)->common.type)
920
8f985ec4
ZW		 921#endif
922
07beea0d 923#define TREE_BLOCK(NODE) *(tree_block (NODE))
6de9cd9a 924
8f985ec4
ZW		 925#include "tree-check.h"
926
6615c446 927#define TYPE_CHECK(T) TREE_CLASS_CHECK (T, tcc_type)
820cc88f
DB		 928#define DECL_MINIMAL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_MINIMAL)
929#define DECL_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_COMMON)
930#define DECL_WRTL_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WRTL)
931#define DECL_WITH_VIS_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_WITH_VIS)
932#define DECL_NON_COMMON_CHECK(T) CONTAINS_STRUCT_CHECK (T, TS_DECL_NON_COMMON)
6615c446
JO		 933#define CST_CHECK(T) TREE_CLASS_CHECK (T, tcc_constant)
934#define STMT_CHECK(T) TREE_CLASS_CHECK (T, tcc_statement)
5039610b 935#define VL_EXP_CHECK(T) TREE_CLASS_CHECK (T, tcc_vl_exp)
eb34af89 936#define FUNC_OR_METHOD_CHECK(T) TREE_CHECK2 (T, FUNCTION_TYPE, METHOD_TYPE)
22421b79 937#define PTR_OR_REF_CHECK(T) TREE_CHECK2 (T, POINTER_TYPE, REFERENCE_TYPE)
eb34af89 938
95b4aca6 939#define RECORD_OR_UNION_CHECK(T) \
eb34af89 940 TREE_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
95b4aca6
NS		 941#define NOT_RECORD_OR_UNION_CHECK(T) \
942 TREE_NOT_CHECK3 (T, RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE)
caf93cb0 943
eb34af89 944#define NUMERICAL_TYPE_CHECK(T) \
325217ed
CF		 945 TREE_CHECK5 (T, INTEGER_TYPE, ENUMERAL_TYPE, BOOLEAN_TYPE, REAL_TYPE, \
946 FIXED_POINT_TYPE)
12b195d9 947
1c0cc57e
KG		 948/* Here is how primitive or already-canonicalized types' hash codes
949 are made. */
fd917e0d
JM		 950#define TYPE_HASH(TYPE) (TYPE_UID (TYPE))
951
952/* A simple hash function for an arbitrary tree node. This must not be
953 used in hash tables which are saved to a PCH. */
954#define TREE_HASH(NODE) ((size_t) (NODE) & 0777777)
1c0cc57e 955
726a989a 956/* Tests if CODE is a conversion expr (NOP_EXPR or CONVERT_EXPR). */
1a87cf0c 957#define CONVERT_EXPR_CODE_P(CODE) \
726a989a 958 ((CODE) == NOP_EXPR || (CODE) == CONVERT_EXPR)
1043771b 959
726a989a 960/* Similarly, but accept an expressions instead of a tree code. */
1a87cf0c 961#define CONVERT_EXPR_P(EXP) CONVERT_EXPR_CODE_P (TREE_CODE (EXP))
1043771b
TB		 962
963/* Generate case for NOP_EXPR, CONVERT_EXPR. */
964
965#define CASE_CONVERT \
966 case NOP_EXPR: \
967 case CONVERT_EXPR
968
8da1b058
RS		 969/* Given an expression as a tree, strip any NON_LVALUE_EXPRs and NOP_EXPRs
970 that don't change the machine mode. */
971
9a6bb3f7 972#define STRIP_NOPS(EXP) \
1043771b 973 while ((CONVERT_EXPR_P (EXP) \
8da1b058 974 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
9a6bb3f7 975 && TREE_OPERAND (EXP, 0) != error_mark_node \
8da1b058 976 && (TYPE_MODE (TREE_TYPE (EXP)) \
726a989a 977 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
713cc17b 978 (EXP) = TREE_OPERAND (EXP, 0)
0fafb45e 979
14a774a9
RK		 980/* Like STRIP_NOPS, but don't let the signedness change either. */
981
982#define STRIP_SIGN_NOPS(EXP) \
1043771b 983 while ((CONVERT_EXPR_P (EXP) \
14a774a9 984 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
9a6bb3f7 985 && TREE_OPERAND (EXP, 0) != error_mark_node \
14a774a9
RK		 986 && (TYPE_MODE (TREE_TYPE (EXP)) \
987 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
8df83eae 988 && (TYPE_UNSIGNED (TREE_TYPE (EXP)) \
b9e67f8b
RG		 989 == TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
990 && (POINTER_TYPE_P (TREE_TYPE (EXP)) \
991 == POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (EXP, 0))))) \
713cc17b 992 (EXP) = TREE_OPERAND (EXP, 0)
14a774a9 993
0fafb45e
RS		 994/* Like STRIP_NOPS, but don't alter the TREE_TYPE either. */
995
996#define STRIP_TYPE_NOPS(EXP) \
1043771b 997 while ((CONVERT_EXPR_P (EXP) \
0fafb45e 998 || TREE_CODE (EXP) == NON_LVALUE_EXPR) \
9a6bb3f7 999 && TREE_OPERAND (EXP, 0) != error_mark_node \
0fafb45e
RS		 1000 && (TREE_TYPE (EXP) \
1001 == TREE_TYPE (TREE_OPERAND (EXP, 0)))) \
713cc17b 1002 (EXP) = TREE_OPERAND (EXP, 0)
87291138 1003
6de9cd9a
DN		 1004/* Remove unnecessary type conversions according to
1005 tree_ssa_useless_type_conversion. */
1006
1007#define STRIP_USELESS_TYPE_CONVERSION(EXP) \
1008 while (tree_ssa_useless_type_conversion (EXP)) \
1009 EXP = TREE_OPERAND (EXP, 0)
1010
87291138 1011/* Nonzero if TYPE represents an integral type. Note that we do not
38b3627d 1012 include COMPLEX types here. Keep these checks in ascending code
6c6cfbfd 1013 order. */
87291138
RK		 1014
1015#define INTEGRAL_TYPE_P(TYPE) \
38b3627d
NS		 1016 (TREE_CODE (TYPE) == ENUMERAL_TYPE \
1017 || TREE_CODE (TYPE) == BOOLEAN_TYPE \
38b3627d 1018 || TREE_CODE (TYPE) == INTEGER_TYPE)
87291138 1019
325217ed
CF		 1020/* Nonzero if TYPE represents a non-saturating fixed-point type. */
1021
1022#define NON_SAT_FIXED_POINT_TYPE_P(TYPE) \
1023 (TREE_CODE (TYPE) == FIXED_POINT_TYPE && !TYPE_SATURATING (TYPE))
1024
1025/* Nonzero if TYPE represents a saturating fixed-point type. */
1026
1027#define SAT_FIXED_POINT_TYPE_P(TYPE) \
1028 (TREE_CODE (TYPE) == FIXED_POINT_TYPE && TYPE_SATURATING (TYPE))
1029
1030/* Nonzero if TYPE represents a fixed-point type. */
1031
1032#define FIXED_POINT_TYPE_P(TYPE) (TREE_CODE (TYPE) == FIXED_POINT_TYPE)
1033
00229de4
RS		 1034/* Nonzero if TYPE represents a scalar floating-point type. */
1035
1036#define SCALAR_FLOAT_TYPE_P(TYPE) (TREE_CODE (TYPE) == REAL_TYPE)
1037
1038/* Nonzero if TYPE represents a complex floating-point type. */
1039
1040#define COMPLEX_FLOAT_TYPE_P(TYPE) \
1041 (TREE_CODE (TYPE) == COMPLEX_TYPE \
1042 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
1043
d97c6333
JW		 1044/* Nonzero if TYPE represents a vector floating-point type. */
1045
1046#define VECTOR_FLOAT_TYPE_P(TYPE) \
1047 (TREE_CODE (TYPE) == VECTOR_TYPE \
1048 && TREE_CODE (TREE_TYPE (TYPE)) == REAL_TYPE)
1049
87291138 1050/* Nonzero if TYPE represents a floating-point type, including complex
38b3627d
NS		 1051 and vector floating-point types. The vector and complex check does
1052 not use the previous two macros to enable early folding. */
87291138 1053
38b3627d
NS		 1054#define FLOAT_TYPE_P(TYPE) \
1055 (SCALAR_FLOAT_TYPE_P (TYPE) \
1056 || ((TREE_CODE (TYPE) == COMPLEX_TYPE \
1057 || TREE_CODE (TYPE) == VECTOR_TYPE) \
1058 && SCALAR_FLOAT_TYPE_P (TREE_TYPE (TYPE))))
947765f9 1059
5fc89bfd
JJ		 1060/* Nonzero if TYPE represents a decimal floating-point type. */
1061#define DECIMAL_FLOAT_TYPE_P(TYPE) \
1062 (SCALAR_FLOAT_TYPE_P (TYPE) \
1063 && DECIMAL_FLOAT_MODE_P (TYPE_MODE (TYPE)))
1064
38b3627d
NS		 1065/* Nonzero if TYPE represents an aggregate (multi-component) type.
1066 Keep these checks in ascending code order. */
947765f9
PB		 1067
1068#define AGGREGATE_TYPE_P(TYPE) \
1069 (TREE_CODE (TYPE) == ARRAY_TYPE || TREE_CODE (TYPE) == RECORD_TYPE \
08f2586c 1070 || TREE_CODE (TYPE) == UNION_TYPE || TREE_CODE (TYPE) == QUAL_UNION_TYPE)
9e6cfc43 1071
66804d9e 1072/* Nonzero if TYPE represents a pointer or reference type.
38b3627d
NS		 1073 (It should be renamed to INDIRECT_TYPE_P.) Keep these checks in
1074 ascending code order. */
9e6cfc43
JM		 1075
1076#define POINTER_TYPE_P(TYPE) \
1077 (TREE_CODE (TYPE) == POINTER_TYPE || TREE_CODE (TYPE) == REFERENCE_TYPE)
555f90c5 1078
d0f062fb
NS		 1079/* Nonzero if this type is a complete type. */
1080#define COMPLETE_TYPE_P(NODE) (TYPE_SIZE (NODE) != NULL_TREE)
1081
71653180 1082/* Nonzero if this type is the (possibly qualified) void type. */
e7cd085f 1083#define VOID_TYPE_P(NODE) (TREE_CODE (NODE) == VOID_TYPE)
71653180 1084
d0f062fb
NS		 1085/* Nonzero if this type is complete or is cv void. */
1086#define COMPLETE_OR_VOID_TYPE_P(NODE) \
c46080ab 1087 (COMPLETE_TYPE_P (NODE) || VOID_TYPE_P (NODE))
d0f062fb
NS		 1088
1089/* Nonzero if this type is complete or is an array with unspecified bound. */
1090#define COMPLETE_OR_UNBOUND_ARRAY_TYPE_P(NODE) \
713cc17b 1091 (COMPLETE_TYPE_P (TREE_CODE (NODE) == ARRAY_TYPE ? TREE_TYPE (NODE) : (NODE)))
d0f062fb 1092
8da1b058
RS		 1093\f
1094/* Define many boolean fields that all tree nodes have. */
1095
1096/* In VAR_DECL nodes, nonzero means address of this is needed.
1097 So it cannot be in a register.
1098 In a FUNCTION_DECL, nonzero means its address is needed.
1099 So it must be compiled even if it is an inline function.
1febe16b
RK		 1100 In a FIELD_DECL node, it means that the programmer is permitted to
1101 construct the address of this field. This is used for aliasing
1102 purposes: see record_component_aliases.
8da1b058 1103 In CONSTRUCTOR nodes, it means object constructed must be in memory.
41077ce4 1104 In LABEL_DECL nodes, it means a goto for this label has been seen
8da1b058
RS		 1105 from a place outside all binding contours that restore stack levels.
1106 In ..._TYPE nodes, it means that objects of this type must
1107 be fully addressable. This means that pieces of this
1108 object cannot go into register parameters, for example.
1109 In IDENTIFIER_NODEs, this means that some extern decl for this name
1110 had its address taken. That matters for inline functions. */
07beea0d 1111#define TREE_ADDRESSABLE(NODE) ((NODE)->base.addressable_flag)
8da1b058 1112
ead553a1
SB		 1113/* Set on a CALL_EXPR if the call is in a tail position, ie. just before the
1114 exit of a function. Calls for which this is true are candidates for tail
1115 call optimizations. */
07beea0d
AH		 1116#define CALL_EXPR_TAILCALL(NODE) \
1117 (CALL_EXPR_CHECK(NODE)->base.addressable_flag)
6de9cd9a 1118
c782c2fe
RS		 1119/* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
1120 CASE_LOW operand has been processed. */
1121#define CASE_LOW_SEEN(NODE) \
07beea0d 1122 (CASE_LABEL_EXPR_CHECK (NODE)->base.addressable_flag)
c782c2fe 1123
2e28e797 1124#define PREDICT_EXPR_OUTCOME(NODE) \
bbbbb16a
ILT		 1125 ((enum prediction) (PREDICT_EXPR_CHECK(NODE)->base.addressable_flag))
1126#define SET_PREDICT_EXPR_OUTCOME(NODE, OUTCOME) \
1127 (PREDICT_EXPR_CHECK(NODE)->base.addressable_flag = (int) OUTCOME)
2e28e797
JH		 1128#define PREDICT_EXPR_PREDICTOR(NODE) \
1129 ((enum br_predictor)tree_low_cst (TREE_OPERAND (PREDICT_EXPR_CHECK (NODE), 0), 0))
1130
8da1b058 1131/* In a VAR_DECL, nonzero means allocate static storage.
9f86614b 1132 In a FUNCTION_DECL, nonzero if function has been defined.
4cea6c02 1133 In a CONSTRUCTOR, nonzero means allocate static storage. */
07beea0d 1134#define TREE_STATIC(NODE) ((NODE)->base.static_flag)
8da1b058 1135
4cea6c02
EB		 1136/* In an ADDR_EXPR, nonzero means do not use a trampoline. */
1137#define TREE_NO_TRAMPOLINE(NODE) (ADDR_EXPR_CHECK (NODE)->base.static_flag)
1138
33b45227 1139/* In a TARGET_EXPR or WITH_CLEANUP_EXPR, means that the pertinent cleanup
5a508662
RH		 1140 should only be executed if an exception is thrown, not on normal exit
1141 of its scope. */
07beea0d 1142#define CLEANUP_EH_ONLY(NODE) ((NODE)->base.static_flag)
659e5a7a 1143
33b45227
JM		 1144/* In a TRY_CATCH_EXPR, means that the handler should be considered a
1145 separate cleanup in honor_protect_cleanup_actions. */
1146#define TRY_CATCH_IS_CLEANUP(NODE) \
1147 (TRY_CATCH_EXPR_CHECK (NODE)->base.static_flag)
1148
c782c2fe
RS		 1149/* Used as a temporary field on a CASE_LABEL_EXPR to indicate that the
1150 CASE_HIGH operand has been processed. */
1151#define CASE_HIGH_SEEN(NODE) \
07beea0d 1152 (CASE_LABEL_EXPR_CHECK (NODE)->base.static_flag)
c782c2fe 1153
e36711f3 1154/* Used to mark a CALL_EXPR as not suitable for inlining. */
ba977e1a 1155#define CALL_CANNOT_INLINE_P(NODE) (CALL_EXPR_CHECK (NODE)->base.static_flag)
e36711f3 1156
6de9cd9a 1157/* In an expr node (usually a conversion) this means the node was made
73022c2a
RH		 1158 implicitly and should not lead to any sort of warning. In a decl node,
1159 warnings concerning the decl should be suppressed. This is used at
1160 least for used-before-set warnings, and it set after one warning is
1161 emitted. */
07beea0d 1162#define TREE_NO_WARNING(NODE) ((NODE)->base.nowarning_flag)
8da1b058 1163
d3568529
JM		 1164/* In an IDENTIFIER_NODE, this means that assemble_name was called with
1165 this string as an argument. */
c46080ab 1166#define TREE_SYMBOL_REFERENCED(NODE) \
07beea0d 1167 (IDENTIFIER_NODE_CHECK (NODE)->base.static_flag)
d3568529 1168
22421b79
RK		 1169/* Nonzero in a pointer or reference type means the data pointed to
1170 by this type can alias anything. */
1171#define TYPE_REF_CAN_ALIAS_ALL(NODE) \
07beea0d 1172 (PTR_OR_REF_CHECK (NODE)->base.static_flag)
22421b79 1173
79f5e442
ZD		 1174/* In a MODIFY_EXPR, means that the store in the expression is nontemporal. */
1175#define MOVE_NONTEMPORAL(NODE) \
726a989a 1176 (EXPR_CHECK (NODE)->base.static_flag)
79f5e442 1177
69ef87e2 1178/* In an INTEGER_CST, REAL_CST, COMPLEX_CST, or VECTOR_CST, this means
95fd24b6 1179 there was an overflow in folding. */
22421b79 1180
07beea0d 1181#define TREE_OVERFLOW(NODE) (CST_CHECK (NODE)->base.public_flag)
261450e8 1182
59c0753d
MLI		 1183/* TREE_OVERFLOW can only be true for EXPR of CONSTANT_CLASS_P. */
1184
1185#define TREE_OVERFLOW_P(EXPR) \
1186 (CONSTANT_CLASS_P (EXPR) && TREE_OVERFLOW (EXPR))
1187
b9e75696 1188/* In a VAR_DECL, FUNCTION_DECL, NAMESPACE_DECL or TYPE_DECL,
98b80692 1189 nonzero means name is to be accessible from outside this translation unit.
4c521bad 1190 In an IDENTIFIER_NODE, nonzero means an external declaration
98b80692 1191 accessible from outside this translation unit was previously seen
8da1b058 1192 for this name in an inner scope. */
07beea0d 1193#define TREE_PUBLIC(NODE) ((NODE)->base.public_flag)
8da1b058 1194
89b0433e
NS		 1195/* In a _TYPE, indicates whether TYPE_CACHED_VALUES contains a vector
1196 of cached values, or is something else. */
07beea0d 1197#define TYPE_CACHED_VALUES_P(NODE) (TYPE_CHECK(NODE)->base.public_flag)
7f5e6307
RH		 1198
1199/* In a SAVE_EXPR, indicates that the original expression has already
1200 been substituted with a VAR_DECL that contains the value. */
1201#define SAVE_EXPR_RESOLVED_P(NODE) \
4cea6c02 1202 (SAVE_EXPR_CHECK (NODE)->base.public_flag)
89b0433e 1203
6ef5231b
JJ		 1204/* Set on a CALL_EXPR if this stdarg call should be passed the argument
1205 pack. */
1206#define CALL_EXPR_VA_ARG_PACK(NODE) \
1207 (CALL_EXPR_CHECK(NODE)->base.public_flag)
1208
4f976745
RK		 1209/* In any expression, decl, or constant, nonzero means it has side effects or
1210 reevaluation of the whole expression could produce a different value.
1211 This is set if any subexpression is a function call, a side effect or a
1212 reference to a volatile variable. In a ..._DECL, this is set only if the
1213 declaration said `volatile'. This will never be set for a constant. */
1214#define TREE_SIDE_EFFECTS(NODE) \
07beea0d 1215 (NON_TYPE_CHECK (NODE)->base.side_effects_flag)
8da1b058 1216
6de9cd9a
DN		 1217/* In a LABEL_DECL, nonzero means this label had its address taken
1218 and therefore can never be deleted and is a jump target for
1219 computed gotos. */
4cea6c02 1220#define FORCED_LABEL(NODE) (LABEL_DECL_CHECK (NODE)->base.side_effects_flag)
6de9cd9a 1221
8da1b058
RS		 1222/* Nonzero means this expression is volatile in the C sense:
1223 its address should be of type `volatile WHATEVER *'.
1224 In other words, the declared item is volatile qualified.
1225 This is used in _DECL nodes and _REF nodes.
d29f81b6
AP		 1226 On a FUNCTION_DECL node, this means the function does not
1227 return normally. This is the same effect as setting
1228 the attribute noreturn on the function in C.
8da1b058
RS		 1229
1230 In a ..._TYPE node, means this type is volatile-qualified.
1231 But use TYPE_VOLATILE instead of this macro when the node is a type,
1232 because eventually we may make that a different bit.
1233
1234 If this bit is set in an expression, so is TREE_SIDE_EFFECTS. */
07beea0d 1235#define TREE_THIS_VOLATILE(NODE) ((NODE)->base.volatile_flag)
8da1b058 1236
5cb2183e
AH		 1237/* Nonzero means this node will not trap. In an INDIRECT_REF, means
1238 accessing the memory pointed to won't generate a trap. However,
1239 this only applies to an object when used appropriately: it doesn't
7ccf35ed
DN		 1240 mean that writing a READONLY mem won't trap. Similarly for
1241 ALIGN_INDIRECT_REF and MISALIGNED_INDIRECT_REF.
caf93cb0 1242
a7e5372d
ZD		 1243 In ARRAY_REF and ARRAY_RANGE_REF means that we know that the index
1244 (or slice of the array) always belongs to the range of the array.
1245 I.e. that the access will not trap, provided that the access to
1246 the base to the array will not trap. */
07beea0d 1247#define TREE_THIS_NOTRAP(NODE) ((NODE)->base.nothrow_flag)
5cb2183e 1248
8da1b058 1249/* In a VAR_DECL, PARM_DECL or FIELD_DECL, or any kind of ..._REF node,
becfd6e5
KZ		 1250 nonzero means it may not be the lhs of an assignment.
1251 Nonzero in a FUNCTION_DECL means this function should be treated
1252 as "const" function (can only read its arguments). */
07beea0d 1253#define TREE_READONLY(NODE) (NON_TYPE_CHECK (NODE)->base.readonly_flag)
8da1b058 1254
4f976745
RK		 1255/* Value of expression is constant. Always on in all ..._CST nodes. May
1256 also appear in an expression or decl where the value is constant. */
07beea0d 1257#define TREE_CONSTANT(NODE) (NON_TYPE_CHECK (NODE)->base.constant_flag)
8da1b058 1258
ad50bc8d 1259/* Nonzero if NODE, a type, has had its sizes gimplified. */
07beea0d
AH		 1260#define TYPE_SIZES_GIMPLIFIED(NODE) \
1261 (TYPE_CHECK (NODE)->base.constant_flag)
ad50bc8d 1262
a150de29 1263/* In a decl (most significantly a FIELD_DECL), means an unsigned field. */
07beea0d
AH		 1264#define DECL_UNSIGNED(NODE) \
1265 (DECL_COMMON_CHECK (NODE)->base.unsigned_flag)
a150de29 1266
8df83eae 1267/* In integral and pointer types, means an unsigned type. */
07beea0d 1268#define TYPE_UNSIGNED(NODE) (TYPE_CHECK (NODE)->base.unsigned_flag)
8df83eae 1269
d2f08d98 1270/* Nonzero in a VAR_DECL or STRING_CST means assembler code has been written.
8da1b058
RS		 1271 Nonzero in a FUNCTION_DECL means that the function has been compiled.
1272 This is interesting in an inline function, since it might not need
1273 to be compiled separately.
3635a54b 1274 Nonzero in a RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ENUMERAL_TYPE
9f86614b 1275 if the sdb debugging info for the type has been written.
caf93cb0 1276 In a BLOCK node, nonzero if reorder_blocks has already seen this block.
6de9cd9a
DN		 1277 In an SSA_NAME node, nonzero if the SSA_NAME occurs in an abnormal
1278 PHI node. */
07beea0d 1279#define TREE_ASM_WRITTEN(NODE) ((NODE)->base.asm_written_flag)
8da1b058
RS		 1280
1281/* Nonzero in a _DECL if the name is used in its scope.
1282 Nonzero in an expr node means inhibit warning if value is unused.
1283 In IDENTIFIER_NODEs, this means that some extern decl for this name
0ac11108 1284 was used.
9acf766f 1285 In a BLOCK, this means that the block contains variables that are used. */
07beea0d 1286#define TREE_USED(NODE) ((NODE)->base.used_flag)
8da1b058 1287
12a22e76
JM		 1288/* In a FUNCTION_DECL, nonzero means a call to the function cannot throw
1289 an exception. In a CALL_EXPR, nonzero means the call cannot throw. */
07beea0d 1290#define TREE_NOTHROW(NODE) ((NODE)->base.nothrow_flag)
c3d32120 1291
fa47911c
JM		 1292/* In a CALL_EXPR, means that it's safe to use the target of the call
1293 expansion as the return slot for a call that returns in memory. */
4cea6c02
EB		 1294#define CALL_EXPR_RETURN_SLOT_OPT(NODE) \
1295 (CALL_EXPR_CHECK (NODE)->base.private_flag)
4977bab6 1296
d8472c75
JM		 1297/* In a RESULT_DECL or PARM_DECL, means that it is passed by invisible
1298 reference (and the TREE_TYPE is a pointer to the true type). */
4cea6c02 1299#define DECL_BY_REFERENCE(NODE) (DECL_COMMON_CHECK (NODE)->base.private_flag)
d8472c75 1300
dd292d0a
MM		 1301/* In a CALL_EXPR, means that the call is the jump from a thunk to the
1302 thunked-to function. */
4cea6c02 1303#define CALL_FROM_THUNK_P(NODE) (CALL_EXPR_CHECK (NODE)->base.protected_flag)
dd292d0a 1304
c3d32120
RK		 1305/* In a type, nonzero means that all objects of the type are guaranteed by the
1306 language or front-end to be properly aligned, so we can indicate that a MEM
1307 of this type is aligned at least to the alignment of the type, even if it
1308 doesn't appear that it is. We see this, for example, in object-oriented
1309 languages where a tag field may show this is an object of a more-aligned
6de9cd9a
DN		 1310 variant of the more generic type.
1311
1312 In an SSA_NAME node, nonzero if the SSA_NAME node is on the SSA_NAME
1313 freelist. */
07beea0d 1314#define TYPE_ALIGN_OK(NODE) (TYPE_CHECK (NODE)->base.nothrow_flag)
8da1b058 1315
9f86614b 1316/* Used in classes in C++. */
07beea0d 1317#define TREE_PRIVATE(NODE) ((NODE)->base.private_flag)
cff7525f 1318/* Used in classes in C++. */
07beea0d 1319#define TREE_PROTECTED(NODE) ((NODE)->base.protected_flag)
8da1b058 1320
a0203ca7 1321/* Nonzero in a _DECL if the use of the name is defined as a
e23bd218 1322 deprecated feature by __attribute__((deprecated)). */
a0203ca7 1323#define TREE_DEPRECATED(NODE) \
07beea0d 1324 ((NODE)->base.deprecated_flag)
a0203ca7
AO		 1325
1326/* Nonzero in an IDENTIFIER_NODE if the name is a local alias, whose
1327 uses are to be substituted for uses of the TREE_CHAINed identifier. */
1328#define IDENTIFIER_TRANSPARENT_ALIAS(NODE) \
07beea0d 1329 (IDENTIFIER_NODE_CHECK (NODE)->base.deprecated_flag)
e23bd218 1330
325217ed
CF		 1331/* In fixed-point types, means a saturating type. */
1332#define TYPE_SATURATING(NODE) ((NODE)->base.saturating_flag)
1333
9f86614b 1334/* These flags are available for each language front end to use internally. */
07beea0d
AH		 1335#define TREE_LANG_FLAG_0(NODE) ((NODE)->base.lang_flag_0)
1336#define TREE_LANG_FLAG_1(NODE) ((NODE)->base.lang_flag_1)
1337#define TREE_LANG_FLAG_2(NODE) ((NODE)->base.lang_flag_2)
1338#define TREE_LANG_FLAG_3(NODE) ((NODE)->base.lang_flag_3)
1339#define TREE_LANG_FLAG_4(NODE) ((NODE)->base.lang_flag_4)
1340#define TREE_LANG_FLAG_5(NODE) ((NODE)->base.lang_flag_5)
1341#define TREE_LANG_FLAG_6(NODE) ((NODE)->base.lang_flag_6)
8da1b058
RS		 1342\f
1343/* Define additional fields and accessors for nodes representing constants. */
1344
e5d70561
RK		 1345/* In an INTEGER_CST node. These two together make a 2-word integer.
1346 If the data type is signed, the value is sign-extended to 2 words
8da1b058 1347 even though not all of them may really be in use.
e5d70561 1348 In an unsigned constant shorter than 2 words, the extra bits are 0. */
2afaa41c
GM		 1349#define TREE_INT_CST(NODE) (INTEGER_CST_CHECK (NODE)->int_cst.int_cst)
1350#define TREE_INT_CST_LOW(NODE) (TREE_INT_CST (NODE).low)
1351#define TREE_INT_CST_HIGH(NODE) (TREE_INT_CST (NODE).high)
8da1b058 1352
b9daac31
GS		 1353#define INT_CST_LT(A, B) \
1354 (TREE_INT_CST_HIGH (A) < TREE_INT_CST_HIGH (B) \
1355 || (TREE_INT_CST_HIGH (A) == TREE_INT_CST_HIGH (B) \
c46080ab 1356 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
8da1b058 1357
b9daac31
GS		 1358#define INT_CST_LT_UNSIGNED(A, B) \
1359 (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
1360 < (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
1361 || (((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (A) \
41077ce4 1362 == (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (B)) \
c46080ab 1363 && TREE_INT_CST_LOW (A) < TREE_INT_CST_LOW (B)))
46c5ad27 1364
d1b38208 1365struct GTY(()) tree_int_cst {
2bf105ab 1366 struct tree_common common;
f82783bd 1367 double_int int_cst;
8da1b058
RS		 1368};
1369
0ee6fdb5 1370/* In a REAL_CST node. struct real_value is an opaque entity, with
11ad4784
ZW		 1371 manipulators defined in real.h. We don't want tree.h depending on
1372 real.h and transitively on tm.h. */
0ee6fdb5 1373struct real_value;
c46080ab 1374
11ad4784
ZW		 1375#define TREE_REAL_CST_PTR(NODE) (REAL_CST_CHECK (NODE)->real_cst.real_cst_ptr)
1376#define TREE_REAL_CST(NODE) (*TREE_REAL_CST_PTR (NODE))
8da1b058 1377
d1b38208 1378struct GTY(()) tree_real_cst {
2bf105ab 1379 struct tree_common common;
0ee6fdb5 1380 struct real_value * real_cst_ptr;
8da1b058
RS		 1381};
1382
325217ed
CF		 1383/* In a FIXED_CST node. */
1384struct fixed_value;
1385
1386#define TREE_FIXED_CST_PTR(NODE) (FIXED_CST_CHECK (NODE)->fixed_cst.fixed_cst_ptr)
1387#define TREE_FIXED_CST(NODE) (*TREE_FIXED_CST_PTR (NODE))
1388
d1b38208 1389struct GTY(()) tree_fixed_cst {
325217ed
CF		 1390 struct tree_common common;
1391 struct fixed_value * fixed_cst_ptr;
1392};
1393
8da1b058 1394/* In a STRING_CST */
12b195d9 1395#define TREE_STRING_LENGTH(NODE) (STRING_CST_CHECK (NODE)->string.length)
7238c5ec
RM		 1396#define TREE_STRING_POINTER(NODE) \
1397 ((const char *)(STRING_CST_CHECK (NODE)->string.str))
8da1b058 1398
d1b38208 1399struct GTY(()) tree_string {
2bf105ab 1400 struct tree_common common;
8da1b058 1401 int length;
7238c5ec 1402 char str[1];
8da1b058
RS		 1403};
1404
1405/* In a COMPLEX_CST node. */
12b195d9
ML		 1406#define TREE_REALPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.real)
1407#define TREE_IMAGPART(NODE) (COMPLEX_CST_CHECK (NODE)->complex.imag)
8da1b058 1408
d1b38208 1409struct GTY(()) tree_complex {
2bf105ab 1410 struct tree_common common;
2f78c311
ZW		 1411 tree real;
1412 tree imag;
8da1b058 1413};
69ef87e2
AH		 1414
1415/* In a VECTOR_CST node. */
1416#define TREE_VECTOR_CST_ELTS(NODE) (VECTOR_CST_CHECK (NODE)->vector.elements)
1417
d1b38208 1418struct GTY(()) tree_vector {
69ef87e2 1419 struct tree_common common;
69ef87e2
AH		 1420 tree elements;
1421};
8da1b058 1422\f
4f4e53dd 1423#include "symtab.h"
2a967f3d 1424
8da1b058
RS		 1425/* Define fields and accessors for some special-purpose tree nodes. */
1426
2a967f3d 1427#define IDENTIFIER_LENGTH(NODE) \
c46080ab 1428 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.len)
2a967f3d 1429#define IDENTIFIER_POINTER(NODE) \
b9daac31 1430 ((const char *) IDENTIFIER_NODE_CHECK (NODE)->identifier.id.str)
5e0c54e5
GDR		 1431#define IDENTIFIER_HASH_VALUE(NODE) \
1432 (IDENTIFIER_NODE_CHECK (NODE)->identifier.id.hash_value)
2a967f3d
NB		 1433
1434/* Translate a hash table identifier pointer to a tree_identifier
1435 pointer, and vice versa. */
1436
1437#define HT_IDENT_TO_GCC_IDENT(NODE) \
c46080ab
RK		 1438 ((tree) ((char *) (NODE) - sizeof (struct tree_common)))
1439#define GCC_IDENT_TO_HT_IDENT(NODE) (&((struct tree_identifier *) (NODE))->id)
8da1b058 1440
d1b38208 1441struct GTY(()) tree_identifier {
2bf105ab 1442 struct tree_common common;
2a967f3d 1443 struct ht_identifier id;
8da1b058
RS		 1444};
1445
1446/* In a TREE_LIST node. */
12b195d9
ML		 1447#define TREE_PURPOSE(NODE) (TREE_LIST_CHECK (NODE)->list.purpose)
1448#define TREE_VALUE(NODE) (TREE_LIST_CHECK (NODE)->list.value)
8da1b058 1449
d1b38208 1450struct GTY(()) tree_list {
2bf105ab 1451 struct tree_common common;
2f78c311
ZW		 1452 tree purpose;
1453 tree value;
8da1b058
RS		 1454};
1455
1456/* In a TREE_VEC node. */
12b195d9 1457#define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->vec.length)
c46080ab
RK		 1458#define TREE_VEC_END(NODE) \
1459 ((void) TREE_VEC_CHECK (NODE), &((NODE)->vec.a[(NODE)->vec.length]))
8da1b058 1460
fa7b533b
ZW		 1461#define TREE_VEC_ELT(NODE,I) TREE_VEC_ELT_CHECK (NODE, I)
1462
d1b38208 1463struct GTY(()) tree_vec {
2bf105ab 1464 struct tree_common common;
8da1b058 1465 int length;
e2500fed 1466 tree GTY ((length ("TREE_VEC_LENGTH ((tree)&%h)"))) a[1];
8da1b058
RS		 1467};
1468
4038c495
GB		 1469/* In a CONSTRUCTOR node. */
1470#define CONSTRUCTOR_ELTS(NODE) (CONSTRUCTOR_CHECK (NODE)->constructor.elts)
09357846
JM		 1471#define CONSTRUCTOR_ELT(NODE,IDX) \
1472 (VEC_index (constructor_elt, CONSTRUCTOR_ELTS (NODE), IDX))
1473#define CONSTRUCTOR_NELTS(NODE) (VEC_length (constructor_elt, CONSTRUCTOR_ELTS (NODE)))
4038c495
GB		 1474
1475/* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding the
1476 value of each element (stored within VAL). IX must be a scratch variable
1477 of unsigned integer type. */
1478#define FOR_EACH_CONSTRUCTOR_VALUE(V, IX, VAL) \
1479 for (IX = 0; (IX >= VEC_length (constructor_elt, V)) \
1480 ? false \
1481 : ((VAL = VEC_index (constructor_elt, V, IX)->value), \
1482 true); \
1483 (IX)++)
1484
1485/* Iterate through the vector V of CONSTRUCTOR_ELT elements, yielding both
1486 the value of each element (stored within VAL) and its index (stored
1487 within INDEX). IX must be a scratch variable of unsigned integer type. */
1488#define FOR_EACH_CONSTRUCTOR_ELT(V, IX, INDEX, VAL) \
1489 for (IX = 0; (IX >= VEC_length (constructor_elt, V)) \
1490 ? false \
1491 : ((VAL = VEC_index (constructor_elt, V, IX)->value), \
1492 (INDEX = VEC_index (constructor_elt, V, IX)->index), \
1493 true); \
1494 (IX)++)
1495
1496/* Append a new constructor element to V, with the specified INDEX and VAL. */
1497#define CONSTRUCTOR_APPEND_ELT(V, INDEX, VALUE) \
1498 do { \
1499 constructor_elt *_ce___ = VEC_safe_push (constructor_elt, gc, V, NULL); \
1500 _ce___->index = INDEX; \
1501 _ce___->value = VALUE; \
1502 } while (0)
1503
1504/* A single element of a CONSTRUCTOR. VALUE holds the actual value of the
1505 element. INDEX can optionally design the position of VALUE: in arrays,
1506 it is the index where VALUE has to be placed; in structures, it is the
1507 FIELD_DECL of the member. */
d1b38208 1508typedef struct GTY(()) constructor_elt_d {
4038c495
GB		 1509 tree index;
1510 tree value;
1511} constructor_elt;
1512
1513DEF_VEC_O(constructor_elt);
1514DEF_VEC_ALLOC_O(constructor_elt,gc);
1515
d1b38208 1516struct GTY(()) tree_constructor {
4038c495
GB		 1517 struct tree_common common;
1518 VEC(constructor_elt,gc) *elts;
1519};
1520
8da1b058
RS		 1521/* Define fields and accessors for some nodes that represent expressions. */
1522
1ea7e6ad 1523/* Nonzero if NODE is an empty statement (NOP_EXPR <0>). */
6de9cd9a
DN		 1524#define IS_EMPTY_STMT(NODE) (TREE_CODE (NODE) == NOP_EXPR \
1525 && VOID_TYPE_P (TREE_TYPE (NODE)) \
1526 && integer_zerop (TREE_OPERAND (NODE, 0)))
1527
61131fa2 1528/* In ordinary expression nodes. */
5039610b 1529#define TREE_OPERAND_LENGTH(NODE) tree_operand_length (NODE)
06790e5f 1530#define TREE_OPERAND(NODE, I) TREE_OPERAND_CHECK (NODE, I)
61131fa2 1531
5039610b
SL		 1532/* In a tcc_vl_exp node, operand 0 is an INT_CST node holding the operand
1533 length. Its value includes the length operand itself; that is,
1534 the minimum valid length is 1.
1535 Note that we have to bypass the use of TREE_OPERAND to access
1536 that field to avoid infinite recursion in expanding the macros. */
1537#define VL_EXP_OPERAND_LENGTH(NODE) \
1538 ((int)TREE_INT_CST_LOW (VL_EXP_CHECK (NODE)->exp.operands[0]))
1539
40edd0bd 1540/* In a LOOP_EXPR node. */
06790e5f 1541#define LOOP_EXPR_BODY(NODE) TREE_OPERAND_CHECK_CODE (NODE, LOOP_EXPR, 0)
40edd0bd 1542
c1667470
PB		 1543/* The source location of this expression. Non-tree_exp nodes such as
1544 decls and constants can be shared among multiple locations, so
1545 return nothing. */
726a989a
RB		 1546#define EXPR_LOCATION(NODE) (EXPR_P ((NODE)) ? (NODE)->exp.locus : UNKNOWN_LOCATION)
1547#define SET_EXPR_LOCATION(NODE, LOCUS) EXPR_CHECK ((NODE))->exp.locus = (LOCUS)
1548#define EXPR_HAS_LOCATION(NODE) (EXPR_LOCATION (NODE) != UNKNOWN_LOCATION)
1549#define EXPR_LOCUS(NODE) (EXPR_P (NODE) \
1550 ? CONST_CAST (source_location *, &(NODE)->exp.locus) \
1551 : (source_location *) NULL)
07beea0d 1552#define SET_EXPR_LOCUS(NODE, FROM) set_expr_locus ((NODE), (FROM))
726a989a
RB		 1553#define EXPR_FILENAME(NODE) LOCATION_FILE (EXPR_CHECK ((NODE))->exp.locus)
1554#define EXPR_LINENO(NODE) LOCATION_LINE (EXPR_CHECK (NODE)->exp.locus)
07beea0d
AH		 1555
1556/* True if a tree is an expression or statement that can have a
1557 location. */
726a989a 1558#define CAN_HAVE_LOCATION_P(NODE) (EXPR_P (NODE))
bf1e5319 1559
6a3799eb
AH		 1560extern void protected_set_expr_location (tree, location_t);
1561
6f30f1f1 1562/* In a TARGET_EXPR node. */
06790e5f
ZW		 1563#define TARGET_EXPR_SLOT(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 0)
1564#define TARGET_EXPR_INITIAL(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 1)
1565#define TARGET_EXPR_CLEANUP(NODE) TREE_OPERAND_CHECK_CODE (NODE, TARGET_EXPR, 2)
6f30f1f1 1566
350fae66
RK		 1567/* DECL_EXPR accessor. This gives access to the DECL associated with
1568 the given declaration statement. */
1569#define DECL_EXPR_DECL(NODE) TREE_OPERAND (DECL_EXPR_CHECK (NODE), 0)
1570
6de9cd9a
DN		 1571#define EXIT_EXPR_COND(NODE) TREE_OPERAND (EXIT_EXPR_CHECK (NODE), 0)
1572
2ec5deb5
PB		 1573/* COMPOUND_LITERAL_EXPR accessors. */
1574#define COMPOUND_LITERAL_EXPR_DECL_EXPR(NODE) \
1575 TREE_OPERAND (COMPOUND_LITERAL_EXPR_CHECK (NODE), 0)
1576#define COMPOUND_LITERAL_EXPR_DECL(NODE) \
1577 DECL_EXPR_DECL (COMPOUND_LITERAL_EXPR_DECL_EXPR (NODE))
1578
6de9cd9a
DN		 1579/* SWITCH_EXPR accessors. These give access to the condition, body and
1580 original condition type (before any compiler conversions)
1581 of the switch statement, respectively. */
ebaae582
SB		 1582#define SWITCH_COND(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 0)
1583#define SWITCH_BODY(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 1)
1584#define SWITCH_LABELS(NODE) TREE_OPERAND (SWITCH_EXPR_CHECK (NODE), 2)
6de9cd9a 1585
8c161995 1586/* CASE_LABEL_EXPR accessors. These give access to the high and low values
6de9cd9a 1587 of a case label, respectively. */
ebaae582
SB		 1588#define CASE_LOW(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 0)
1589#define CASE_HIGH(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 1)
1590#define CASE_LABEL(NODE) TREE_OPERAND (CASE_LABEL_EXPR_CHECK (NODE), 2)
6de9cd9a 1591
ac182688
ZD		 1592/* The operands of a TARGET_MEM_REF. */
1593#define TMR_SYMBOL(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 0))
1594#define TMR_BASE(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 1))
1595#define TMR_INDEX(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 2))
1596#define TMR_STEP(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 3))
1597#define TMR_OFFSET(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 4))
1598#define TMR_ORIGINAL(NODE) (TREE_OPERAND (TARGET_MEM_REF_CHECK (NODE), 5))
ac182688 1599
6de9cd9a
DN		 1600/* The operands of a BIND_EXPR. */
1601#define BIND_EXPR_VARS(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 0))
1602#define BIND_EXPR_BODY(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 1))
1603#define BIND_EXPR_BLOCK(NODE) (TREE_OPERAND (BIND_EXPR_CHECK (NODE), 2))
1604
1605/* GOTO_EXPR accessor. This gives access to the label associated with
1606 a goto statement. */
1607#define GOTO_DESTINATION(NODE) TREE_OPERAND ((NODE), 0)
1608
e130a54b 1609/* ASM_EXPR accessors. ASM_STRING returns a STRING_CST for the
6de9cd9a
DN		 1610 instruction (e.g., "mov x, y"). ASM_OUTPUTS, ASM_INPUTS, and
1611 ASM_CLOBBERS represent the outputs, inputs, and clobbers for the
1612 statement. */
ebaae582
SB		 1613#define ASM_STRING(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 0)
1614#define ASM_OUTPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 1)
1615#define ASM_INPUTS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 2)
1616#define ASM_CLOBBERS(NODE) TREE_OPERAND (ASM_EXPR_CHECK (NODE), 3)
6de9cd9a
DN		 1617/* Nonzero if we want to create an ASM_INPUT instead of an
1618 ASM_OPERAND with no operands. */
4cea6c02
EB		 1619#define ASM_INPUT_P(NODE) (ASM_EXPR_CHECK (NODE)->base.static_flag)
1620#define ASM_VOLATILE_P(NODE) (ASM_EXPR_CHECK (NODE)->base.public_flag)
6de9cd9a
DN		 1621
1622/* COND_EXPR accessors. */
1623#define COND_EXPR_COND(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 0))
1624#define COND_EXPR_THEN(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 1))
1625#define COND_EXPR_ELSE(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 2))
1626
42fd6772
ZD		 1627/* Accessors for the chains of recurrences. */
1628#define CHREC_VAR(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 0)
1629#define CHREC_LEFT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 1)
1630#define CHREC_RIGHT(NODE) TREE_OPERAND (POLYNOMIAL_CHREC_CHECK (NODE), 2)
1631#define CHREC_VARIABLE(NODE) TREE_INT_CST_LOW (CHREC_VAR (NODE))
1632
6de9cd9a
DN		 1633/* LABEL_EXPR accessor. This gives access to the label associated with
1634 the given label expression. */
1635#define LABEL_EXPR_LABEL(NODE) TREE_OPERAND (LABEL_EXPR_CHECK (NODE), 0)
1636
1637/* VDEF_EXPR accessors are specified in tree-flow.h, along with the other
1638 accessors for SSA operands. */
caf93cb0 1639
6de9cd9a
DN		 1640/* CATCH_EXPR accessors. */
1641#define CATCH_TYPES(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 0)
1642#define CATCH_BODY(NODE) TREE_OPERAND (CATCH_EXPR_CHECK (NODE), 1)
1643
1644/* EH_FILTER_EXPR accessors. */
1645#define EH_FILTER_TYPES(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 0)
1646#define EH_FILTER_FAILURE(NODE) TREE_OPERAND (EH_FILTER_EXPR_CHECK (NODE), 1)
4cea6c02
EB		 1647#define EH_FILTER_MUST_NOT_THROW(NODE) \
1648 (EH_FILTER_EXPR_CHECK (NODE)->base.static_flag)
6de9cd9a 1649
058dcc25
ILT		 1650/* CHANGE_DYNAMIC_TYPE_EXPR accessors. */
1651#define CHANGE_DYNAMIC_TYPE_NEW_TYPE(NODE) \
1652 TREE_OPERAND (CHANGE_DYNAMIC_TYPE_EXPR_CHECK (NODE), 0)
1653#define CHANGE_DYNAMIC_TYPE_LOCATION(NODE) \
1654 TREE_OPERAND (CHANGE_DYNAMIC_TYPE_EXPR_CHECK (NODE), 1)
1655
0f59171d
RH		 1656/* OBJ_TYPE_REF accessors. */
1657#define OBJ_TYPE_REF_EXPR(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 0)
1658#define OBJ_TYPE_REF_OBJECT(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 1)
1659#define OBJ_TYPE_REF_TOKEN(NODE) TREE_OPERAND (OBJ_TYPE_REF_CHECK (NODE), 2)
1660
0bca51f0
DN		 1661/* ASSERT_EXPR accessors. */
1662#define ASSERT_EXPR_VAR(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 0)
1663#define ASSERT_EXPR_COND(NODE) TREE_OPERAND (ASSERT_EXPR_CHECK (NODE), 1)
1664
5039610b
SL		 1665/* CALL_EXPR accessors.
1666 */
1667#define CALL_EXPR_FN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 1)
1668#define CALL_EXPR_STATIC_CHAIN(NODE) TREE_OPERAND (CALL_EXPR_CHECK (NODE), 2)
1669#define CALL_EXPR_ARGS(NODE) call_expr_arglist (NODE)
1670#define CALL_EXPR_ARG(NODE, I) TREE_OPERAND (CALL_EXPR_CHECK (NODE), (I) + 3)
1671#define call_expr_nargs(NODE) (VL_EXP_OPERAND_LENGTH(NODE) - 3)
1672
1673/* CALL_EXPR_ARGP returns a pointer to the argument vector for NODE.
1674 We can't use &CALL_EXPR_ARG (NODE, 0) because that will complain if
1675 the argument count is zero when checking is enabled. Instead, do
1676 the pointer arithmetic to advance past the 3 fixed operands in a
1677 CALL_EXPR. That produces a valid pointer to just past the end of the
1678 operand array, even if it's not valid to dereference it. */
1679#define CALL_EXPR_ARGP(NODE) \
1680 (&(TREE_OPERAND (CALL_EXPR_CHECK (NODE), 0)) + 3)
1681
953ff289
DN		 1682/* OpenMP directive and clause accessors. */
1683
1684#define OMP_BODY(NODE) \
1685 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_CRITICAL), 0)
1686#define OMP_CLAUSES(NODE) \
1687 TREE_OPERAND (TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_SINGLE), 1)
1688
1689#define OMP_PARALLEL_BODY(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 0)
1690#define OMP_PARALLEL_CLAUSES(NODE) TREE_OPERAND (OMP_PARALLEL_CHECK (NODE), 1)
1691
a68ab351
JJ		 1692#define OMP_TASK_BODY(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 0)
1693#define OMP_TASK_CLAUSES(NODE) TREE_OPERAND (OMP_TASK_CHECK (NODE), 1)
a68ab351
JJ		 1694
1695#define OMP_TASKREG_CHECK(NODE) TREE_RANGE_CHECK (NODE, OMP_PARALLEL, OMP_TASK)
1696#define OMP_TASKREG_BODY(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 0)
1697#define OMP_TASKREG_CLAUSES(NODE) TREE_OPERAND (OMP_TASKREG_CHECK (NODE), 1)
a68ab351 1698
953ff289
DN		 1699#define OMP_FOR_BODY(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 0)
1700#define OMP_FOR_CLAUSES(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 1)
1701#define OMP_FOR_INIT(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 2)
1702#define OMP_FOR_COND(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 3)
1703#define OMP_FOR_INCR(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 4)
1704#define OMP_FOR_PRE_BODY(NODE) TREE_OPERAND (OMP_FOR_CHECK (NODE), 5)
1705
1706#define OMP_SECTIONS_BODY(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 0)
1707#define OMP_SECTIONS_CLAUSES(NODE) TREE_OPERAND (OMP_SECTIONS_CHECK (NODE), 1)
1708
1709#define OMP_SECTION_BODY(NODE) TREE_OPERAND (OMP_SECTION_CHECK (NODE), 0)
1710
1711#define OMP_SINGLE_BODY(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 0)
1712#define OMP_SINGLE_CLAUSES(NODE) TREE_OPERAND (OMP_SINGLE_CHECK (NODE), 1)
1713
1714#define OMP_MASTER_BODY(NODE) TREE_OPERAND (OMP_MASTER_CHECK (NODE), 0)
1715
1716#define OMP_ORDERED_BODY(NODE) TREE_OPERAND (OMP_ORDERED_CHECK (NODE), 0)
1717
1718#define OMP_CRITICAL_BODY(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 0)
1719#define OMP_CRITICAL_NAME(NODE) TREE_OPERAND (OMP_CRITICAL_CHECK (NODE), 1)
1720
aaf46ef9
DN		 1721#define OMP_CLAUSE_CHAIN(NODE) TREE_CHAIN (OMP_CLAUSE_CHECK (NODE))
1722#define OMP_CLAUSE_DECL(NODE) \
1723 OMP_CLAUSE_OPERAND (OMP_CLAUSE_RANGE_CHECK (OMP_CLAUSE_CHECK (NODE), \
1724 OMP_CLAUSE_PRIVATE, \
1725 OMP_CLAUSE_COPYPRIVATE), 0)
953ff289 1726
777f7f9a
RH		 1727/* True on an OMP_SECTION statement that was the last lexical member.
1728 This status is meaningful in the implementation of lastprivate. */
1729#define OMP_SECTION_LAST(NODE) \
4cea6c02 1730 (OMP_SECTION_CHECK (NODE)->base.private_flag)
777f7f9a 1731
761041be
JJ		 1732/* True on an OMP_PARALLEL statement if it represents an explicit
1733 combined parallel work-sharing constructs. */
1734#define OMP_PARALLEL_COMBINED(NODE) \
4cea6c02 1735 (OMP_PARALLEL_CHECK (NODE)->base.private_flag)
761041be 1736
953ff289
DN		 1737/* True on a PRIVATE clause if its decl is kept around for debugging
1738 information only and its DECL_VALUE_EXPR is supposed to point
1739 to what it has been remapped to. */
1740#define OMP_CLAUSE_PRIVATE_DEBUG(NODE) \
4cea6c02 1741 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE)->base.public_flag)
953ff289 1742
a68ab351
JJ		 1743/* True on a PRIVATE clause if ctor needs access to outer region's
1744 variable. */
1745#define OMP_CLAUSE_PRIVATE_OUTER_REF(NODE) \
1746 TREE_PRIVATE (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_PRIVATE))
1747
953ff289
DN		 1748/* True on a LASTPRIVATE clause if a FIRSTPRIVATE clause for the same
1749 decl is present in the chain. */
1750#define OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE(NODE) \
4cea6c02 1751 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_LASTPRIVATE)->base.public_flag)
a68ab351
JJ		 1752#define OMP_CLAUSE_LASTPRIVATE_STMT(NODE) \
1753 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, \
1754 OMP_CLAUSE_LASTPRIVATE),\
1755 1)
726a989a
RB		 1756#define OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ(NODE) \
1757 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
953ff289
DN		 1758
1759#define OMP_CLAUSE_IF_EXPR(NODE) \
aaf46ef9 1760 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_IF), 0)
953ff289 1761#define OMP_CLAUSE_NUM_THREADS_EXPR(NODE) \
aaf46ef9 1762 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_NUM_THREADS),0)
953ff289 1763#define OMP_CLAUSE_SCHEDULE_CHUNK_EXPR(NODE) \
aaf46ef9 1764 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE), 0)
953ff289 1765
a68ab351
JJ		 1766#define OMP_CLAUSE_COLLAPSE_EXPR(NODE) \
1767 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 0)
1768#define OMP_CLAUSE_COLLAPSE_ITERVAR(NODE) \
1769 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 1)
1770#define OMP_CLAUSE_COLLAPSE_COUNT(NODE) \
1771 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_COLLAPSE), 2)
1772
953ff289 1773#define OMP_CLAUSE_REDUCTION_CODE(NODE) \
aaf46ef9 1774 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION)->omp_clause.subcode.reduction_code)
953ff289 1775#define OMP_CLAUSE_REDUCTION_INIT(NODE) \
aaf46ef9 1776 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 1)
953ff289 1777#define OMP_CLAUSE_REDUCTION_MERGE(NODE) \
aaf46ef9 1778 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 2)
726a989a
RB		 1779#define OMP_CLAUSE_REDUCTION_GIMPLE_INIT(NODE) \
1780 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_init
1781#define OMP_CLAUSE_REDUCTION_GIMPLE_MERGE(NODE) \
1782 (OMP_CLAUSE_CHECK (NODE))->omp_clause.gimple_reduction_merge
953ff289 1783#define OMP_CLAUSE_REDUCTION_PLACEHOLDER(NODE) \
aaf46ef9 1784 OMP_CLAUSE_OPERAND (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_REDUCTION), 3)
953ff289
DN		 1785
1786enum omp_clause_schedule_kind
1787{
1788 OMP_CLAUSE_SCHEDULE_STATIC,
1789 OMP_CLAUSE_SCHEDULE_DYNAMIC,
1790 OMP_CLAUSE_SCHEDULE_GUIDED,
a68ab351 1791 OMP_CLAUSE_SCHEDULE_AUTO,
953ff289
DN		 1792 OMP_CLAUSE_SCHEDULE_RUNTIME
1793};
1794
1795#define OMP_CLAUSE_SCHEDULE_KIND(NODE) \
aaf46ef9 1796 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_SCHEDULE)->omp_clause.subcode.schedule_kind)
953ff289
DN		 1797
1798enum omp_clause_default_kind
1799{
1800 OMP_CLAUSE_DEFAULT_UNSPECIFIED,
1801 OMP_CLAUSE_DEFAULT_SHARED,
1802 OMP_CLAUSE_DEFAULT_NONE,
a68ab351
JJ		 1803 OMP_CLAUSE_DEFAULT_PRIVATE,
1804 OMP_CLAUSE_DEFAULT_FIRSTPRIVATE
953ff289
DN		 1805};
1806
1807#define OMP_CLAUSE_DEFAULT_KIND(NODE) \
aaf46ef9 1808 (OMP_CLAUSE_SUBCODE_CHECK (NODE, OMP_CLAUSE_DEFAULT)->omp_clause.subcode.default_kind)
953ff289 1809
d1b38208 1810struct GTY(()) tree_exp {
2bf105ab 1811 struct tree_common common;
2d593c86 1812 location_t locus;
6de9cd9a 1813 tree block;
46c5ad27
AJ		 1814 tree GTY ((special ("tree_exp"),
1815 desc ("TREE_CODE ((tree) &%0)")))
e2500fed 1816 operands[1];
61131fa2
RS		 1817};
1818\f
6de9cd9a
DN		 1819/* SSA_NAME accessors. */
1820
1821/* Returns the variable being referenced. Once released, this is the
1822 only field that can be relied upon. */
1823#define SSA_NAME_VAR(NODE) SSA_NAME_CHECK (NODE)->ssa_name.var
1824
726a989a
RB		 1825/* Returns the statement which defines this SSA name. */
1826#define SSA_NAME_DEF_STMT(NODE) SSA_NAME_CHECK (NODE)->ssa_name.def_stmt
6de9cd9a
DN		 1827
1828/* Returns the SSA version number of this SSA name. Note that in
1829 tree SSA, version numbers are not per variable and may be recycled. */
1830#define SSA_NAME_VERSION(NODE) SSA_NAME_CHECK (NODE)->ssa_name.version
1831
1832/* Nonzero if this SSA name occurs in an abnormal PHI. SSA_NAMES are
1833 never output, so we can safely use the ASM_WRITTEN_FLAG for this
1834 status bit. */
1835#define SSA_NAME_OCCURS_IN_ABNORMAL_PHI(NODE) \
07beea0d 1836 SSA_NAME_CHECK (NODE)->base.asm_written_flag
6de9cd9a 1837
313679b0 1838/* Nonzero if this SSA_NAME expression is currently on the free list of
6de9cd9a
DN		 1839 SSA_NAMES. Using NOTHROW_FLAG seems reasonably safe since throwing
1840 has no meaning for an SSA_NAME. */
1841#define SSA_NAME_IN_FREE_LIST(NODE) \
07beea0d 1842 SSA_NAME_CHECK (NODE)->base.nothrow_flag
6de9cd9a 1843
cfaab3a9
DN		 1844/* Nonzero if this SSA_NAME is the default definition for the
1845 underlying symbol. A default SSA name is created for symbol S if
1846 the very first reference to S in the function is a read operation.
1847 Default definitions are always created by an empty statement and
1848 belong to no basic block. */
1849#define SSA_NAME_IS_DEFAULT_DEF(NODE) \
0598f31b 1850 SSA_NAME_CHECK (NODE)->base.default_def_flag
cfaab3a9 1851
313679b0
DN		 1852/* Attributes for SSA_NAMEs for pointer-type variables. */
1853#define SSA_NAME_PTR_INFO(N) \
1854 SSA_NAME_CHECK (N)->ssa_name.ptr_info
1855
7e6eb623
DB		 1856/* Get the value of this SSA_NAME, if available. */
1857#define SSA_NAME_VALUE(N) \
1858 SSA_NAME_CHECK (N)->ssa_name.value_handle
1859
ff2ad0f7
DN		 1860#ifndef _TREE_FLOW_H
1861struct ptr_info_def;
313679b0
DN		 1862#endif
1863
f430bae8
AM		 1864
1865
f652d14b 1866/* Immediate use linking structure. This structure is used for maintaining
f430bae8 1867 a doubly linked list of uses of an SSA_NAME. */
d1b38208 1868typedef struct GTY(()) ssa_use_operand_d {
f47c96aa
AM		 1869 struct ssa_use_operand_d* GTY((skip(""))) prev;
1870 struct ssa_use_operand_d* GTY((skip(""))) next;
726a989a
RB		 1871 /* Immediate uses for a given SSA name are maintained as a cyclic
1872 list. To recognize the root of this list, the location field
1873 needs to point to the original SSA name. Since statements and
1874 SSA names are of different data types, we need this union. See
1875 the explanation in struct immediate_use_iterator_d. */
1876 union { gimple stmt; tree ssa_name; } GTY((skip(""))) loc;
f430bae8 1877 tree *GTY((skip(""))) use;
f47c96aa 1878} ssa_use_operand_t;
f430bae8
AM		 1879
1880/* Return the immediate_use information for an SSA_NAME. */
1881#define SSA_NAME_IMM_USE_NODE(NODE) SSA_NAME_CHECK (NODE)->ssa_name.imm_uses
1882
d1b38208 1883struct GTY(()) tree_ssa_name {
6de9cd9a
DN		 1884 struct tree_common common;
1885
1886 /* _DECL wrapped by this SSA name. */
1887 tree var;
1888
726a989a
RB		 1889 /* Statement that defines this SSA name. */
1890 gimple def_stmt;
1891
6de9cd9a
DN		 1892 /* SSA version number. */
1893 unsigned int version;
313679b0
DN		 1894
1895 /* Pointer attributes used for alias analysis. */
1896 struct ptr_info_def *ptr_info;
7e6eb623 1897
3aecd08b
JL		 1898 /* Value for SSA name used by various passes.
1899
1900 Right now only invariants are allowed to persist beyond a pass in
1901 this field; in the future we will allow VALUE_HANDLEs to persist
1902 as well. */
1903 tree value_handle;
5f240ec4 1904
f430bae8 1905 /* Immediate uses list for this SSA_NAME. */
f47c96aa 1906 struct ssa_use_operand_d imm_uses;
6de9cd9a
DN		 1907};
1908\f
d1b38208 1909struct GTY(()) phi_arg_d {
5dbc71f8
KH		 1910 /* imm_use MUST be the first element in struct because we do some
1911 pointer arithmetic with it. See phi_arg_index_from_use. */
f47c96aa 1912 struct ssa_use_operand_d imm_use;
6de9cd9a 1913 tree def;
6de9cd9a
DN		 1914};
1915
6de9cd9a 1916\f
aaf46ef9
DN		 1917#define OMP_CLAUSE_CODE(NODE) \
1918 (OMP_CLAUSE_CHECK (NODE))->omp_clause.code
1919
1920#define OMP_CLAUSE_SET_CODE(NODE, CODE) \
1921 ((OMP_CLAUSE_CHECK (NODE))->omp_clause.code = (CODE))
1922
1923#define OMP_CLAUSE_CODE(NODE) \
1924 (OMP_CLAUSE_CHECK (NODE))->omp_clause.code
1925
1926#define OMP_CLAUSE_OPERAND(NODE, I) \
1927 OMP_CLAUSE_ELT_CHECK (NODE, I)
1928
d1b38208 1929struct GTY(()) tree_omp_clause {
aaf46ef9
DN		 1930 struct tree_common common;
1931 enum omp_clause_code code;
1932 union omp_clause_subcode {
1933 enum omp_clause_default_kind default_kind;
1934 enum omp_clause_schedule_kind schedule_kind;
1935 enum tree_code reduction_code;
1936 } GTY ((skip)) subcode;
726a989a
RB		 1937
1938 /* The gimplification of OMP_CLAUSE_REDUCTION_{INIT,MERGE} for omp-low's
1939 usage. */
1940 gimple_seq gimple_reduction_init;
1941 gimple_seq gimple_reduction_merge;
1942
fb57dc0b 1943 tree GTY ((length ("omp_clause_num_ops[OMP_CLAUSE_CODE ((tree)&%h)]"))) ops[1];
aaf46ef9
DN		 1944};
1945\f
6de9cd9a
DN		 1946
1947struct varray_head_tag;
1948
8da1b058 1949/* In a BLOCK node. */
12b195d9 1950#define BLOCK_VARS(NODE) (BLOCK_CHECK (NODE)->block.vars)
526d73ab
JH		 1951#define BLOCK_NONLOCALIZED_VARS(NODE) (BLOCK_CHECK (NODE)->block.nonlocalized_vars)
1952#define BLOCK_NUM_NONLOCALIZED_VARS(NODE) VEC_length (tree, BLOCK_NONLOCALIZED_VARS (NODE))
1953#define BLOCK_NONLOCALIZED_VAR(NODE,N) VEC_index (tree, BLOCK_NONLOCALIZED_VARS (NODE), N)
12b195d9
ML		 1954#define BLOCK_SUBBLOCKS(NODE) (BLOCK_CHECK (NODE)->block.subblocks)
1955#define BLOCK_SUPERCONTEXT(NODE) (BLOCK_CHECK (NODE)->block.supercontext)
8da1b058
RS		 1956/* Note: when changing this, make sure to find the places
1957 that use chainon or nreverse. */
a901fa64 1958#define BLOCK_CHAIN(NODE) TREE_CHAIN (BLOCK_CHECK (NODE))
12b195d9
ML		 1959#define BLOCK_ABSTRACT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.abstract_origin)
1960#define BLOCK_ABSTRACT(NODE) (BLOCK_CHECK (NODE)->block.abstract_flag)
8da1b058 1961
18c038b9
MM		 1962/* An index number for this block. These values are not guaranteed to
1963 be unique across functions -- whether or not they are depends on
1964 the debugging output format in use. */
1965#define BLOCK_NUMBER(NODE) (BLOCK_CHECK (NODE)->block.block_num)
1966
a20612aa
RH		 1967/* If block reordering splits a lexical block into discontiguous
1968 address ranges, we'll make a copy of the original block.
1969
1970 Note that this is logically distinct from BLOCK_ABSTRACT_ORIGIN.
1971 In that case, we have one source block that has been replicated
1972 (through inlining or unrolling) into many logical blocks, and that
1973 these logical blocks have different physical variables in them.
1974
1975 In this case, we have one logical block split into several
1976 non-contiguous address ranges. Most debug formats can't actually
1977 represent this idea directly, so we fake it by creating multiple
1978 logical blocks with the same variables in them. However, for those
1979 that do support non-contiguous regions, these allow the original
1980 logical block to be reconstructed, along with the set of address
1981 ranges.
1982
1983 One of the logical block fragments is arbitrarily chosen to be
1984 the ORIGIN. The other fragments will point to the origin via
1985 BLOCK_FRAGMENT_ORIGIN; the origin itself will have this pointer
41077ce4 1986 be null. The list of fragments will be chained through
a20612aa
RH		 1987 BLOCK_FRAGMENT_CHAIN from the origin. */
1988
c46080ab
RK		 1989#define BLOCK_FRAGMENT_ORIGIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_origin)
1990#define BLOCK_FRAGMENT_CHAIN(NODE) (BLOCK_CHECK (NODE)->block.fragment_chain)
a20612aa 1991
3e2844cb
JW		 1992/* For an inlined function, this gives the location where it was called
1993 from. This is only set in the top level block, which corresponds to the
1994 inlined function scope. This is used in the debug output routines. */
1995
1996#define BLOCK_SOURCE_LOCATION(NODE) (BLOCK_CHECK (NODE)->block.locus)
1997
d1b38208 1998struct GTY(()) tree_block {
2bf105ab 1999 struct tree_common common;
61131fa2 2000
61131fa2 2001 unsigned abstract_flag : 1;
cff7525f 2002 unsigned block_num : 31;
61131fa2 2003
87caf699
RG		 2004 location_t locus;
2005
2f78c311 2006 tree vars;
526d73ab
JH		 2007 VEC(tree,gc) *nonlocalized_vars;
2008
2f78c311
ZW		 2009 tree subblocks;
2010 tree supercontext;
2011 tree abstract_origin;
2012 tree fragment_origin;
2013 tree fragment_chain;
8da1b058
RS		 2014};
2015\f
2016/* Define fields and accessors for nodes representing data types. */
2017
2018/* See tree.def for documentation of the use of these fields.
eb34af89
RK		 2019 Look at the documentation of the various ..._TYPE tree codes.
2020
d1a6adeb 2021 Note that the type.values, type.minval, and type.maxval fields are
eb34af89
RK		 2022 overloaded and used for different macros in different kinds of types.
2023 Each macro must check to ensure the tree node is of the proper kind of
2024 type. Note also that some of the front-ends also overload these fields,
2025 so they must be checked as well. */
8da1b058 2026
12b195d9
ML		 2027#define TYPE_UID(NODE) (TYPE_CHECK (NODE)->type.uid)
2028#define TYPE_SIZE(NODE) (TYPE_CHECK (NODE)->type.size)
2029#define TYPE_SIZE_UNIT(NODE) (TYPE_CHECK (NODE)->type.size_unit)
eb34af89 2030#define TYPE_VALUES(NODE) (ENUMERAL_TYPE_CHECK (NODE)->type.values)
08f2586c 2031#define TYPE_DOMAIN(NODE) (ARRAY_TYPE_CHECK (NODE)->type.values)
95b4aca6 2032#define TYPE_FIELDS(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.values)
89b0433e
NS		 2033#define TYPE_CACHED_VALUES(NODE) (TYPE_CHECK(NODE)->type.values)
2034#define TYPE_ORIG_SIZE_TYPE(NODE) \
2035 (INTEGER_TYPE_CHECK (NODE)->type.values \
2036 ? TREE_TYPE ((NODE)->type.values) : NULL_TREE)
95b4aca6
NS		 2037#define TYPE_METHODS(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.maxval)
2038#define TYPE_VFIELD(NODE) (RECORD_OR_UNION_CHECK (NODE)->type.minval)
eb34af89
RK		 2039#define TYPE_ARG_TYPES(NODE) (FUNC_OR_METHOD_CHECK (NODE)->type.values)
2040#define TYPE_METHOD_BASETYPE(NODE) (FUNC_OR_METHOD_CHECK (NODE)->type.maxval)
2041#define TYPE_OFFSET_BASETYPE(NODE) (OFFSET_TYPE_CHECK (NODE)->type.maxval)
12b195d9
ML		 2042#define TYPE_POINTER_TO(NODE) (TYPE_CHECK (NODE)->type.pointer_to)
2043#define TYPE_REFERENCE_TO(NODE) (TYPE_CHECK (NODE)->type.reference_to)
22421b79
RK		 2044#define TYPE_NEXT_PTR_TO(NODE) (POINTER_TYPE_CHECK (NODE)->type.minval)
2045#define TYPE_NEXT_REF_TO(NODE) (REFERENCE_TYPE_CHECK (NODE)->type.minval)
eb34af89
RK		 2046#define TYPE_MIN_VALUE(NODE) (NUMERICAL_TYPE_CHECK (NODE)->type.minval)
2047#define TYPE_MAX_VALUE(NODE) (NUMERICAL_TYPE_CHECK (NODE)->type.maxval)
12b195d9
ML		 2048#define TYPE_PRECISION(NODE) (TYPE_CHECK (NODE)->type.precision)
2049#define TYPE_SYMTAB_ADDRESS(NODE) (TYPE_CHECK (NODE)->type.symtab.address)
2050#define TYPE_SYMTAB_POINTER(NODE) (TYPE_CHECK (NODE)->type.symtab.pointer)
e2500fed 2051#define TYPE_SYMTAB_DIE(NODE) (TYPE_CHECK (NODE)->type.symtab.die)
12b195d9
ML		 2052#define TYPE_NAME(NODE) (TYPE_CHECK (NODE)->type.name)
2053#define TYPE_NEXT_VARIANT(NODE) (TYPE_CHECK (NODE)->type.next_variant)
2054#define TYPE_MAIN_VARIANT(NODE) (TYPE_CHECK (NODE)->type.main_variant)
12b195d9 2055#define TYPE_CONTEXT(NODE) (TYPE_CHECK (NODE)->type.context)
06d40de8 2056
179d2f74
RH		 2057/* Vector types need to check target flags to determine type. */
2058extern enum machine_mode vector_type_mode (const_tree);
2059#define TYPE_MODE(NODE) \
2060 (TREE_CODE (TYPE_CHECK (NODE)) == VECTOR_TYPE \
2061 ? vector_type_mode (NODE) : (NODE)->type.mode)
2062#define SET_TYPE_MODE(NODE, MODE) \
2063 (TYPE_CHECK (NODE)->type.mode = (MODE))
2064
06d40de8
DG		 2065/* The "canonical" type for this type node, which can be used to
2066 compare the type for equality with another type. If two types are
2067 equal (based on the semantics of the language), then they will have
2068 equivalent TYPE_CANONICAL entries.
2069
2070 As a special case, if TYPE_CANONICAL is NULL_TREE, then it cannot
2071 be used for comparison against other types. Instead, the type is
2072 said to require structural equality checks, described in
2073 TYPE_STRUCTURAL_EQUALITY_P. */
2074#define TYPE_CANONICAL(NODE) (TYPE_CHECK (NODE)->type.canonical)
2075/* Indicates that the type node requires structural equality
2076 checks. The compiler will need to look at the composition of the
2077 type to determine whether it is equal to another type, rather than
2078 just comparing canonical type pointers. For instance, we would need
2079 to look at the return and parameter types of a FUNCTION_TYPE
2080 node. */
2081#define TYPE_STRUCTURAL_EQUALITY_P(NODE) (TYPE_CANONICAL (NODE) == NULL_TREE)
2082/* Sets the TYPE_CANONICAL field to NULL_TREE, indicating that the
2083 type node requires structural equality. */
2084#define SET_TYPE_STRUCTURAL_EQUALITY(NODE) (TYPE_CANONICAL (NODE) = NULL_TREE)
12b195d9 2085#define TYPE_LANG_SPECIFIC(NODE) (TYPE_CHECK (NODE)->type.lang_specific)
325217ed
CF		 2086#define TYPE_IBIT(NODE) (GET_MODE_IBIT (TYPE_MODE (NODE)))
2087#define TYPE_FBIT(NODE) (GET_MODE_FBIT (TYPE_MODE (NODE)))
8da1b058 2088
4061f623
BS		 2089/* For a VECTOR_TYPE node, this describes a different type which is emitted
2090 in the debugging output. We use this to describe a vector as a
2091 structure containing an array. */
5c5214a9 2092#define TYPE_DEBUG_REPRESENTATION_TYPE(NODE) (VECTOR_TYPE_CHECK (NODE)->type.values)
4061f623 2093
95b4aca6 2094/* For record and union types, information about this type, as a base type
8c27b7d4 2095 for itself. */
95b4aca6
NS		 2096#define TYPE_BINFO(NODE) (RECORD_OR_UNION_CHECK(NODE)->type.binfo)
2097
2098/* For non record and union types, used in a language-dependent way. */
2099#define TYPE_LANG_SLOT_1(NODE) (NOT_RECORD_OR_UNION_CHECK(NODE)->type.binfo)
8ff0c1af 2100
41472af8
MM		 2101/* The (language-specific) typed-based alias set for this type.
2102 Objects whose TYPE_ALIAS_SETs are different cannot alias each
2103 other. If the TYPE_ALIAS_SET is -1, no alias set has yet been
2104 assigned to this type. If the TYPE_ALIAS_SET is 0, objects of this
2105 type can alias objects of any type. */
2106#define TYPE_ALIAS_SET(NODE) (TYPE_CHECK (NODE)->type.alias_set)
2107
2108/* Nonzero iff the typed-based alias set for this type has been
2109 calculated. */
c46080ab 2110#define TYPE_ALIAS_SET_KNOWN_P(NODE) (TYPE_CHECK (NODE)->type.alias_set != -1)
41472af8 2111
bad1b4ba
RK		 2112/* A TREE_LIST of IDENTIFIER nodes of the attributes that apply
2113 to this type. */
12b195d9 2114#define TYPE_ATTRIBUTES(NODE) (TYPE_CHECK (NODE)->type.attributes)
bad1b4ba 2115
869637e6
RS		 2116/* The alignment necessary for objects of this type.
2117 The value is an int, measured in bits. */
12b195d9 2118#define TYPE_ALIGN(NODE) (TYPE_CHECK (NODE)->type.align)
869637e6 2119
11cf4d18
JJ		 2120/* 1 if the alignment for this type was requested by "aligned" attribute,
2121 0 if it is the default for this type. */
2122#define TYPE_USER_ALIGN(NODE) (TYPE_CHECK (NODE)->type.user_align)
2123
834c6dff 2124/* The alignment for NODE, in bytes. */
c46080ab 2125#define TYPE_ALIGN_UNIT(NODE) (TYPE_ALIGN (NODE) / BITS_PER_UNIT)
834c6dff 2126
2b5f2501
RH		 2127/* If your language allows you to declare types, and you want debug info
2128 for them, then you need to generate corresponding TYPE_DECL nodes.
2129 These "stub" TYPE_DECL nodes have no name, and simply point at the
2130 type node. You then set the TYPE_STUB_DECL field of the type node
2131 to point back at the TYPE_DECL node. This allows the debug routines
2132 to know that the two nodes represent the same type, so that we only
2ba84f36 2133 get one debug info record for them. */
c46080ab 2134#define TYPE_STUB_DECL(NODE) TREE_CHAIN (NODE)
8da1b058 2135
3635a54b
RK		 2136/* In a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, it means the type
2137 has BLKmode only because it lacks the alignment requirement for
2138 its size. */
12b195d9 2139#define TYPE_NO_FORCE_BLK(NODE) (TYPE_CHECK (NODE)->type.no_force_blk_flag)
8da1b058 2140
e36308b0
MM		 2141/* In an INTEGER_TYPE, it means the type represents a size. We use
2142 this both for validity checking and to permit optimizations that
2143 are unsafe for other types. Note that the C `size_t' type should
2144 *not* have this flag set. The `size_t' type is simply a typedef
2145 for an ordinary integer type that happens to be the type of an
2146 expression returned by `sizeof'; `size_t' has no special
2147 properties. Expressions whose type have TYPE_IS_SIZETYPE set are
2148 always actual sizes. */
7393c642
RK		 2149#define TYPE_IS_SIZETYPE(NODE) \
2150 (INTEGER_TYPE_CHECK (NODE)->type.no_force_blk_flag)
2151
8da1b058 2152/* Nonzero in a type considered volatile as a whole. */
07beea0d 2153#define TYPE_VOLATILE(NODE) (TYPE_CHECK (NODE)->base.volatile_flag)
8da1b058
RS		 2154
2155/* Means this type is const-qualified. */
07beea0d 2156#define TYPE_READONLY(NODE) (TYPE_CHECK (NODE)->base.readonly_flag)
8da1b058 2157
3932261a
MM		 2158/* If nonzero, this type is `restrict'-qualified, in the C sense of
2159 the term. */
2160#define TYPE_RESTRICT(NODE) (TYPE_CHECK (NODE)->type.restrict_flag)
2161
2162/* There is a TYPE_QUAL value for each type qualifier. They can be
2163 combined by bitwise-or to form the complete set of qualifiers for a
2164 type. */
2165
2166#define TYPE_UNQUALIFIED 0x0
2167#define TYPE_QUAL_CONST 0x1
2168#define TYPE_QUAL_VOLATILE 0x2
2169#define TYPE_QUAL_RESTRICT 0x4
2170
2171/* The set of type qualifiers for this type. */
a6d7adfd
GM		 2172#define TYPE_QUALS(NODE) \
2173 ((TYPE_READONLY (NODE) * TYPE_QUAL_CONST) \
2174 | (TYPE_VOLATILE (NODE) * TYPE_QUAL_VOLATILE) \
66804d9e 2175 | (TYPE_RESTRICT (NODE) * TYPE_QUAL_RESTRICT))
3932261a 2176
9f86614b 2177/* These flags are available for each language front end to use internally. */
12b195d9
ML		 2178#define TYPE_LANG_FLAG_0(NODE) (TYPE_CHECK (NODE)->type.lang_flag_0)
2179#define TYPE_LANG_FLAG_1(NODE) (TYPE_CHECK (NODE)->type.lang_flag_1)
2180#define TYPE_LANG_FLAG_2(NODE) (TYPE_CHECK (NODE)->type.lang_flag_2)
2181#define TYPE_LANG_FLAG_3(NODE) (TYPE_CHECK (NODE)->type.lang_flag_3)
2182#define TYPE_LANG_FLAG_4(NODE) (TYPE_CHECK (NODE)->type.lang_flag_4)
2183#define TYPE_LANG_FLAG_5(NODE) (TYPE_CHECK (NODE)->type.lang_flag_5)
2184#define TYPE_LANG_FLAG_6(NODE) (TYPE_CHECK (NODE)->type.lang_flag_6)
8da1b058 2185
6de9cd9a
DN		 2186/* Used to keep track of visited nodes in tree traversals. This is set to
2187 0 by copy_node and make_node. */
07beea0d 2188#define TREE_VISITED(NODE) ((NODE)->base.visited)
6de9cd9a 2189
74a3fd26
PB		 2190/* If set in an ARRAY_TYPE, indicates a string type (for languages
2191 that distinguish string from array of char).
05fa7d54 2192 If set in a INTEGER_TYPE, indicates a character type. */
12b195d9 2193#define TYPE_STRING_FLAG(NODE) (TYPE_CHECK (NODE)->type.string_flag)
74a3fd26 2194
4fe9b91c 2195/* If non-NULL, this is an upper bound of the size (in bytes) of an
c46080ab
RK		 2196 object of the given ARRAY_TYPE. This allows temporaries to be
2197 allocated. */
2198#define TYPE_ARRAY_MAX_SIZE(ARRAY_TYPE) \
a6002f8d 2199 (ARRAY_TYPE_CHECK (ARRAY_TYPE)->type.maxval)
2fb2b21c 2200
0b4565c9 2201/* For a VECTOR_TYPE, this is the number of sub-parts of the vector. */
c46080ab 2202#define TYPE_VECTOR_SUBPARTS(VECTOR_TYPE) \
a4e8ea7f
SE		 2203 (((unsigned HOST_WIDE_INT) 1) \
2204 << VECTOR_TYPE_CHECK (VECTOR_TYPE)->type.precision)
2205
2206/* Set precision to n when we have 2^n sub-parts of the vector. */
2207#define SET_TYPE_VECTOR_SUBPARTS(VECTOR_TYPE, X) \
2208 (VECTOR_TYPE_CHECK (VECTOR_TYPE)->type.precision = exact_log2 (X))
0b4565c9 2209
b6fc2cdb
PB		 2210/* Nonzero in an IDENTIFIER_NODE if the name is a local alias, whose
2211 uses are to be substituted for uses of the TREE_CHAINed identifier. */
2212#define TYPE_VECTOR_OPAQUE(NODE) \
2213 (VECTOR_TYPE_CHECK (NODE)->base.deprecated_flag)
2214
cd3ce9b4 2215/* Indicates that objects of this type must be initialized by calling a
4ac3d994 2216 function when they are created. */
2bf105ab
RK		 2217#define TYPE_NEEDS_CONSTRUCTING(NODE) \
2218 (TYPE_CHECK (NODE)->type.needs_constructing_flag)
4ac3d994 2219
adb23061
RK		 2220/* Indicates that objects of this type (a UNION_TYPE), should be passed
2221 the same way that the first union alternative would be passed. */
2bf105ab
RK		 2222#define TYPE_TRANSPARENT_UNION(NODE) \
2223 (UNION_TYPE_CHECK (NODE)->type.transparent_union_flag)
2224
b5487346
EB		 2225/* For an ARRAY_TYPE, indicates that it is not permitted to take the
2226 address of a component of the type. This is the counterpart of
2227 DECL_NONADDRESSABLE_P for arrays, see the definition of this flag. */
2bf105ab
RK		 2228#define TYPE_NONALIASED_COMPONENT(NODE) \
2229 (ARRAY_TYPE_CHECK (NODE)->type.transparent_union_flag)
adb23061 2230
956d6950 2231/* Indicated that objects of this type should be laid out in as
9e357cd8 2232 compact a way as possible. */
12b195d9 2233#define TYPE_PACKED(NODE) (TYPE_CHECK (NODE)->type.packed_flag)
9e357cd8 2234
a5bfe141
RH		 2235/* Used by type_contains_placeholder_p to avoid recomputation.
2236 Values are: 0 (unknown), 1 (false), 2 (true). Never access
2237 this field directly. */
2238#define TYPE_CONTAINS_PLACEHOLDER_INTERNAL(NODE) \
2239 (TYPE_CHECK (NODE)->type.contains_placeholder_bits)
2240
e2500fed
GK		 2241struct die_struct;
2242
d1b38208 2243struct GTY(()) tree_type {
2bf105ab 2244 struct tree_common common;
2f78c311
ZW		 2245 tree values;
2246 tree size;
2247 tree size_unit;
2248 tree attributes;
b3ddc3ab 2249 unsigned int uid;
8da1b058 2250
b3ddc3ab 2251 unsigned int precision : 9;
c149cc37 2252 ENUM_BITFIELD(machine_mode) mode : 7;
bad1b4ba 2253
74a3fd26 2254 unsigned string_flag : 1;
8da1b058 2255 unsigned no_force_blk_flag : 1;
4ac3d994 2256 unsigned needs_constructing_flag : 1;
adb23061 2257 unsigned transparent_union_flag : 1;
9e357cd8 2258 unsigned packed_flag : 1;
3932261a 2259 unsigned restrict_flag : 1;
a5bfe141 2260 unsigned contains_placeholder_bits : 2;
3932261a 2261
8da1b058
RS		 2262 unsigned lang_flag_0 : 1;
2263 unsigned lang_flag_1 : 1;
2264 unsigned lang_flag_2 : 1;
2265 unsigned lang_flag_3 : 1;
2266 unsigned lang_flag_4 : 1;
2267 unsigned lang_flag_5 : 1;
2268 unsigned lang_flag_6 : 1;
11cf4d18 2269 unsigned user_align : 1;
8da1b058 2270
69b78d8d 2271 unsigned int align;
3691626c 2272 alias_set_type alias_set;
2f78c311
ZW		 2273 tree pointer_to;
2274 tree reference_to;
e2500fed 2275 union tree_type_symtab {
46c5ad27 2276 int GTY ((tag ("0"))) address;
586de218 2277 const char * GTY ((tag ("1"))) pointer;
17211ab5 2278 struct die_struct * GTY ((tag ("2"))) die;
46c5ad27 2279 } GTY ((desc ("debug_hooks == &sdb_debug_hooks ? 1 : debug_hooks == &dwarf2_debug_hooks ? 2 : 0"),
e2500fed 2280 descbits ("2"))) symtab;
2f78c311
ZW		 2281 tree name;
2282 tree minval;
2283 tree maxval;
2284 tree next_variant;
2285 tree main_variant;
2286 tree binfo;
2f78c311 2287 tree context;
06d40de8 2288 tree canonical;
8da1b058
RS		 2289 /* Points to a structure whose details depend on the language in use. */
2290 struct lang_type *lang_specific;
2291};
2292\f
2293/* Define accessor macros for information about type inheritance
2294 and basetypes.
2295
2296 A "basetype" means a particular usage of a data type for inheritance
2297 in another type. Each such basetype usage has its own "binfo"
2298 object to describe it. The binfo object is a TREE_VEC node.
2299
2300 Inheritance is represented by the binfo nodes allocated for a
2301 given type. For example, given types C and D, such that D is
2302 inherited by C, 3 binfo nodes will be allocated: one for describing
2303 the binfo properties of C, similarly one for D, and one for
2304 describing the binfo properties of D as a base type for C.
2305 Thus, given a pointer to class C, one can get a pointer to the binfo
2306 of D acting as a basetype for C by looking at C's binfo's basetypes. */
2307
809e3e7f
NS		 2308/* BINFO specific flags. */
2309
2310/* Nonzero means that the derivation chain is via a `virtual' declaration. */
07beea0d 2311#define BINFO_VIRTUAL_P(NODE) (TREE_BINFO_CHECK (NODE)->base.static_flag)
809e3e7f
NS		 2312
2313/* Flags for language dependent use. */
2314#define BINFO_MARKED(NODE) TREE_LANG_FLAG_0(TREE_BINFO_CHECK(NODE))
2315#define BINFO_FLAG_1(NODE) TREE_LANG_FLAG_1(TREE_BINFO_CHECK(NODE))
2316#define BINFO_FLAG_2(NODE) TREE_LANG_FLAG_2(TREE_BINFO_CHECK(NODE))
2317#define BINFO_FLAG_3(NODE) TREE_LANG_FLAG_3(TREE_BINFO_CHECK(NODE))
2318#define BINFO_FLAG_4(NODE) TREE_LANG_FLAG_4(TREE_BINFO_CHECK(NODE))
2319#define BINFO_FLAG_5(NODE) TREE_LANG_FLAG_5(TREE_BINFO_CHECK(NODE))
2320#define BINFO_FLAG_6(NODE) TREE_LANG_FLAG_6(TREE_BINFO_CHECK(NODE))
2321
8da1b058 2322/* The actual data type node being inherited in this basetype. */
95b4aca6 2323#define BINFO_TYPE(NODE) TREE_TYPE (TREE_BINFO_CHECK(NODE))
8da1b058
RS		 2324
2325/* The offset where this basetype appears in its containing type.
2326 BINFO_OFFSET slot holds the offset (in bytes)
2327 from the base of the complete object to the base of the part of the
2328 object that is allocated on behalf of this `type'.
2329 This is always 0 except when there is multiple inheritance. */
41077ce4 2330
95b4aca6 2331#define BINFO_OFFSET(NODE) (TREE_BINFO_CHECK(NODE)->binfo.offset)
7d02bbef 2332#define BINFO_OFFSET_ZEROP(NODE) (integer_zerop (BINFO_OFFSET (NODE)))
8da1b058
RS		 2333
2334/* The virtual function table belonging to this basetype. Virtual
2335 function tables provide a mechanism for run-time method dispatching.
2336 The entries of a virtual function table are language-dependent. */
2337
95b4aca6 2338#define BINFO_VTABLE(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtable)
8da1b058
RS		 2339
2340/* The virtual functions in the virtual function table. This is
2341 a TREE_LIST that is used as an initial approximation for building
2342 a virtual function table for this basetype. */
95b4aca6 2343#define BINFO_VIRTUALS(NODE) (TREE_BINFO_CHECK(NODE)->binfo.virtuals)
8da1b058 2344
0430641b
MM		 2345/* A vector of binfos for the direct basetypes inherited by this
2346 basetype.
8da1b058 2347
0430641b
MM		 2348 If this basetype describes type D as inherited in C, and if the
2349 basetypes of D are E and F, then this vector contains binfos for
fa743e8c
NS		 2350 inheritance of E and F by C. */
2351#define BINFO_BASE_BINFOS(NODE) (&TREE_BINFO_CHECK(NODE)->binfo.base_binfos)
8da1b058 2352
5e1677bc 2353/* The number of basetypes for NODE. */
fa743e8c 2354#define BINFO_N_BASE_BINFOS(NODE) (VEC_length (tree, BINFO_BASE_BINFOS (NODE)))
5e1677bc 2355
604a3205 2356/* Accessor macro to get to the Nth base binfo of this binfo. */
fa743e8c
NS		 2357#define BINFO_BASE_BINFO(NODE,N) \
2358 (VEC_index (tree, BINFO_BASE_BINFOS (NODE), (N)))
2359#define BINFO_BASE_ITERATE(NODE,N,B) \
2360 (VEC_iterate (tree, BINFO_BASE_BINFOS (NODE), (N), (B)))
2361#define BINFO_BASE_APPEND(NODE,T) \
2362 (VEC_quick_push (tree, BINFO_BASE_BINFOS (NODE), (T)))
7d02bbef 2363
39ac3e4f
MM		 2364/* For a BINFO record describing a virtual base class, i.e., one where
2365 TREE_VIA_VIRTUAL is set, this field assists in locating the virtual
1824b90d
NS		 2366 base. The actual contents are language-dependent. In the C++
2367 front-end this field is an INTEGER_CST giving an offset into the
2368 vtable where the offset to the virtual base can be found. */
95b4aca6 2369#define BINFO_VPTR_FIELD(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vptr_field)
2cc3ac7a 2370
dbbf88d1
NS		 2371/* Indicates the accesses this binfo has to its bases. The values are
2372 access_public_node, access_protected_node or access_private_node.
2373 If this array is not present, public access is implied. */
604a3205 2374#define BINFO_BASE_ACCESSES(NODE) (TREE_BINFO_CHECK(NODE)->binfo.base_accesses)
63d1c7b3
NS		 2375
2376#define BINFO_BASE_ACCESS(NODE,N) \
2377 VEC_index (tree, BINFO_BASE_ACCESSES (NODE), (N))
2378#define BINFO_BASE_ACCESS_APPEND(NODE,T) \
2379 VEC_quick_push (tree, BINFO_BASE_ACCESSES (NODE), (T))
dbbf88d1 2380
fa743e8c
NS		 2381/* The index in the VTT where this subobject's sub-VTT can be found.
2382 NULL_TREE if there is no sub-VTT. */
2383#define BINFO_SUBVTT_INDEX(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtt_subvtt)
dbbf88d1 2384
fa743e8c
NS		 2385/* The index in the VTT where the vptr for this subobject can be
2386 found. NULL_TREE if there is no secondary vptr in the VTT. */
2387#define BINFO_VPTR_INDEX(NODE) (TREE_BINFO_CHECK(NODE)->binfo.vtt_vptr)
2388
604a3205
NS		 2389/* The BINFO_INHERITANCE_CHAIN points at the binfo for the base
2390 inheriting this base for non-virtual bases. For virtual bases it
fc6633e0
NS		 2391 points either to the binfo for which this is a primary binfo, or to
2392 the binfo of the most derived type. */
95b4aca6
NS		 2393#define BINFO_INHERITANCE_CHAIN(NODE) \
2394 (TREE_BINFO_CHECK(NODE)->binfo.inheritance)
2395
d1b38208 2396struct GTY (()) tree_binfo {
95b4aca6
NS		 2397 struct tree_common common;
2398
2399 tree offset;
2400 tree vtable;
2401 tree virtuals;
95b4aca6 2402 tree vptr_field;
d4e6fecb 2403 VEC(tree,gc) *base_accesses;
95b4aca6
NS		 2404 tree inheritance;
2405
fa743e8c
NS		 2406 tree vtt_subvtt;
2407 tree vtt_vptr;
fa743e8c 2408
d4e6fecb 2409 VEC(tree,none) base_binfos;
95b4aca6 2410};
95b4aca6 2411
8da1b058
RS		 2412\f
2413/* Define fields and accessors for nodes representing declared names. */
2414
6de9cd9a 2415/* Nonzero if DECL represents a variable for the SSA passes. */
326eda4b
DB		 2416#define SSA_VAR_P(DECL) \
2417 (TREE_CODE (DECL) == VAR_DECL \
2418 || TREE_CODE (DECL) == PARM_DECL \
2419 || TREE_CODE (DECL) == RESULT_DECL \
326eda4b
DB		 2420 || (TREE_CODE (DECL) == SSA_NAME \
2421 && (TREE_CODE (SSA_NAME_VAR (DECL)) == VAR_DECL \
2422 || TREE_CODE (SSA_NAME_VAR (DECL)) == PARM_DECL \
5006671f 2423 || TREE_CODE (SSA_NAME_VAR (DECL)) == RESULT_DECL)))
6de9cd9a 2424
c46080ab 2425
c46080ab 2426
c46080ab 2427
820cc88f
DB		 2428/* Enumerate visibility settings. */
2429#ifndef SYMBOL_VISIBILITY_DEFINED
2430#define SYMBOL_VISIBILITY_DEFINED
2431enum symbol_visibility
2432{
2433 VISIBILITY_DEFAULT,
b9e75696 2434 VISIBILITY_PROTECTED,
820cc88f 2435 VISIBILITY_HIDDEN,
b9e75696 2436 VISIBILITY_INTERNAL
820cc88f
DB		 2437};
2438#endif
c46080ab 2439
820cc88f 2440struct function;
41077ce4 2441
92643fea 2442
820cc88f
DB		 2443/* This is the name of the object as written by the user.
2444 It is an IDENTIFIER_NODE. */
2445#define DECL_NAME(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.name)
c46080ab 2446
820cc88f
DB		 2447/* Every ..._DECL node gets a unique number. */
2448#define DECL_UID(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.uid)
92643fea 2449
820cc88f
DB		 2450/* These two fields describe where in the source code the declaration
2451 was. If the declaration appears in several places (as for a C
2452 function that is declared first and then defined later), this
2453 information should refer to the definition. */
2454#define DECL_SOURCE_LOCATION(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.locus)
2455#define DECL_SOURCE_FILE(NODE) LOCATION_FILE (DECL_SOURCE_LOCATION (NODE))
2456#define DECL_SOURCE_LINE(NODE) LOCATION_LINE (DECL_SOURCE_LOCATION (NODE))
820cc88f
DB		 2457#define DECL_IS_BUILTIN(DECL) \
2458 (DECL_SOURCE_LOCATION (DECL) <= BUILTINS_LOCATION)
c46080ab 2459
d1bd0ded
GK		 2460/* For FIELD_DECLs, this is the RECORD_TYPE, UNION_TYPE, or
2461 QUAL_UNION_TYPE node that the field is a member of. For VAR_DECL,
2462 PARM_DECL, FUNCTION_DECL, LABEL_DECL, and CONST_DECL nodes, this
2463 points to either the FUNCTION_DECL for the containing function,
2464 the RECORD_TYPE or UNION_TYPE for the containing type, or
2465 NULL_TREE or a TRANSLATION_UNIT_DECL if the given decl has "file
2466 scope". */
820cc88f
DB		 2467#define DECL_CONTEXT(NODE) (DECL_MINIMAL_CHECK (NODE)->decl_minimal.context)
2468#define DECL_FIELD_CONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->decl_minimal.context)
d1b38208 2469struct GTY(()) tree_decl_minimal {
820cc88f
DB		 2470 struct tree_common common;
2471 location_t locus;
2472 unsigned int uid;
2473 tree name;
2474 tree context;
2475};
2476
38635499 2477
820cc88f
DB		 2478/* For any sort of a ..._DECL node, this points to the original (abstract)
2479 decl node which this decl is an instance of, or else it is NULL indicating
2480 that this decl is not an instance of some other decl. For example,
2481 in a nested declaration of an inline function, this points back to the
2482 definition. */
2483#define DECL_ABSTRACT_ORIGIN(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.abstract_origin)
2484
2485/* Like DECL_ABSTRACT_ORIGIN, but returns NODE if there's no abstract
2486 origin. This is useful when setting the DECL_ABSTRACT_ORIGIN. */
2487#define DECL_ORIGIN(NODE) \
2488 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : (NODE))
2489
2490/* Nonzero for any sort of ..._DECL node means this decl node represents an
2491 inline instance of some original (abstract) decl from an inline function;
2492 suppress any warnings about shadowing some other variable. FUNCTION_DECL
2493 nodes can also have their abstract origin set to themselves. */
2494#define DECL_FROM_INLINE(NODE) (DECL_ABSTRACT_ORIGIN (NODE) != NULL_TREE \
2495 && DECL_ABSTRACT_ORIGIN (NODE) != (NODE))
2496
91d231cb 2497/* In a DECL this is the field where attributes are stored. */
820cc88f
DB		 2498#define DECL_ATTRIBUTES(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.attributes)
2499
8da1b058 2500/* For a FUNCTION_DECL, holds the tree of BINDINGs.
d1bd0ded 2501 For a TRANSLATION_UNIT_DECL, holds the namespace's BLOCK.
8da1b058 2502 For a VAR_DECL, holds the initial value.
38179091 2503 For a PARM_DECL, used for DECL_ARG_TYPE--default
8da1b058 2504 values for parameters are encoded in the type of the function,
4f976745 2505 not in the PARM_DECL slot.
820cc88f 2506 For a FIELD_DECL, this is used for enumeration values and the C
0ac11108 2507 frontend uses it for temporarily storing bitwidth of bitfields.
4f976745
RK		 2508
2509 ??? Need to figure out some way to check this isn't a PARM_DECL. */
820cc88f
DB		 2510#define DECL_INITIAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.initial)
2511
06ceef4e 2512/* Holds the size of the datum, in bits, as a tree expression.
8da1b058 2513 Need not be constant. */
820cc88f 2514#define DECL_SIZE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size)
06ceef4e 2515/* Likewise for the size in bytes. */
820cc88f 2516#define DECL_SIZE_UNIT(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.size_unit)
971774bb 2517/* Holds the alignment required for the datum, in bits. */
837edd5f 2518#define DECL_ALIGN(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.align)
971774bb
MM		 2519/* The alignment of NODE, in bytes. */
2520#define DECL_ALIGN_UNIT(NODE) (DECL_ALIGN (NODE) / BITS_PER_UNIT)
d872ada0
GK		 2521/* Set if the alignment of this DECL has been set by the user, for
2522 example with an 'aligned' attribute. */
820cc88f 2523#define DECL_USER_ALIGN(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.user_align)
17c73321
RK		 2524/* Holds the machine mode corresponding to the declaration of a variable or
2525 field. Always equal to TYPE_MODE (TREE_TYPE (decl)) except for a
2526 FIELD_DECL. */
820cc88f 2527#define DECL_MODE(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.mode)
c46080ab 2528
9c0a30c3
EB		 2529/* For FUNCTION_DECL, if it is built-in, this identifies which built-in
2530 operation it is. Note, however, that this field is overloaded, with
2531 DECL_BUILT_IN_CLASS as the discriminant, so the latter must always be
2532 checked before any access to the former. */
837edd5f
GK		 2533#define DECL_FUNCTION_CODE(NODE) \
2534 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_code)
dad2a933 2535#define DECL_DEBUG_EXPR_IS_FROM(NODE) \
820cc88f 2536 (DECL_COMMON_CHECK (NODE)->decl_common.debug_expr_is_from)
8da1b058 2537
4aa708ba 2538/* Nonzero for a given ..._DECL node means that the name of this node should
2f09ef38 2539 be ignored for symbolic debug purposes. */
820cc88f 2540#define DECL_IGNORED_P(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.ignored_flag)
8da1b058 2541
c5caa350
CH		 2542/* Nonzero for a given ..._DECL node means that this node represents an
2543 "abstract instance" of the given declaration (e.g. in the original
2544 declaration of an inline function). When generating symbolic debugging
9faa82d8 2545 information, we mustn't try to generate any address information for nodes
c5caa350
CH		 2546 marked as "abstract instances" because we don't actually generate
2547 any code or allocate any data space for such instances. */
820cc88f 2548#define DECL_ABSTRACT(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.abstract_flag)
2c0d84d6 2549
3110a56e 2550/* Language-specific decl information. */
820cc88f 2551#define DECL_LANG_SPECIFIC(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_specific)
8da1b058 2552
820cc88f 2553/* In a VAR_DECL or FUNCTION_DECL, nonzero means external reference:
9783dd38
GDR		 2554 do not allocate storage, and refer to a definition elsewhere. Note that
2555 this does not necessarily imply the entity represented by NODE
2556 has no program source-level definition in this translation unit. For
2557 example, for a FUNCTION_DECL, DECL_SAVED_TREE may be non-NULL and
2558 DECL_EXTERNAL may be true simultaneously; that can be the case for
2559 a C99 "extern inline" function. */
820cc88f 2560#define DECL_EXTERNAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.decl_flag_2)
8da1b058 2561
8da1b058
RS		 2562/* Nonzero in a ..._DECL means this variable is ref'd from a nested function.
2563 For VAR_DECL nodes, PARM_DECL nodes, and FUNCTION_DECL nodes.
2564
2565 For LABEL_DECL nodes, nonzero if nonlocal gotos to the label are permitted.
2566
2567 Also set in some languages for variables, etc., outside the normal
2568 lexical scope, such as class instance variables. */
820cc88f 2569#define DECL_NONLOCAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.nonlocal_flag)
8da1b058 2570
820cc88f
DB		 2571/* Used in VAR_DECLs to indicate that the variable is a vtable.
2572 Used in FIELD_DECLs for vtable pointers.
2573 Used in FUNCTION_DECLs to indicate that the function is virtual. */
2574#define DECL_VIRTUAL_P(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.virtual_flag)
8da1b058 2575
820cc88f
DB		 2576/* Used to indicate that this DECL represents a compiler-generated entity. */
2577#define DECL_ARTIFICIAL(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.artificial_flag)
bc522472 2578
820cc88f
DB		 2579/* Additional flags for language-specific uses. */
2580#define DECL_LANG_FLAG_0(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_0)
2581#define DECL_LANG_FLAG_1(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_1)
2582#define DECL_LANG_FLAG_2(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_2)
2583#define DECL_LANG_FLAG_3(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_3)
2584#define DECL_LANG_FLAG_4(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_4)
2585#define DECL_LANG_FLAG_5(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_5)
2586#define DECL_LANG_FLAG_6(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_6)
2587#define DECL_LANG_FLAG_7(NODE) (DECL_COMMON_CHECK (NODE)->decl_common.lang_flag_7)
48eb4e53 2588
820cc88f
DB		 2589/* Used to indicate an alias set for the memory pointed to by this
2590 particular FIELD_DECL, PARM_DECL, or VAR_DECL, which must have
2591 pointer (or reference) type. */
2592#define DECL_POINTER_ALIAS_SET(NODE) \
2593 (DECL_COMMON_CHECK (NODE)->decl_common.pointer_alias_set)
6de9cd9a 2594
820cc88f
DB		 2595/* Nonzero if an alias set has been assigned to this declaration. */
2596#define DECL_POINTER_ALIAS_SET_KNOWN_P(NODE) \
2597 (DECL_POINTER_ALIAS_SET (NODE) != - 1)
968b41a1 2598
820cc88f
DB		 2599/* Nonzero for a decl which is at file scope. */
2600#define DECL_FILE_SCOPE_P(EXP) \
2601 (! DECL_CONTEXT (EXP) \
2602 || TREE_CODE (DECL_CONTEXT (EXP)) == TRANSLATION_UNIT_DECL)
d7afec4b 2603
820cc88f
DB		 2604/* Nonzero for a decl that is decorated using attribute used.
2605 This indicates compiler tools that this decl needs to be preserved. */
2606#define DECL_PRESERVE_P(DECL) \
2607 DECL_COMMON_CHECK (DECL)->decl_common.preserve_flag
0ac11108 2608
0890b981
AP		 2609/* For function local variables of COMPLEX and VECTOR types,
2610 indicates that the variable is not aliased, and that all
2611 modifications to the variable have been adjusted so that
2612 they are killing assignments. Thus the variable may now
2613 be treated as a GIMPLE register, and use real instead of
2614 virtual ops in SSA form. */
2615#define DECL_GIMPLE_REG_P(DECL) \
820cc88f 2616 DECL_COMMON_CHECK (DECL)->decl_common.gimple_reg_flag
5daf7c0a 2617
058dcc25
ILT		 2618/* For a DECL with pointer type, this is set if Type Based Alias
2619 Analysis should not be applied to this DECL. */
2620#define DECL_NO_TBAA_P(DECL) \
2621 DECL_COMMON_CHECK (DECL)->decl_common.no_tbaa_flag
2622
d1b38208 2623struct GTY(()) tree_decl_common {
820cc88f
DB		 2624 struct tree_decl_minimal common;
2625 tree size;
c2f7fa15 2626
820cc88f 2627 ENUM_BITFIELD(machine_mode) mode : 8;
3d78f2e9 2628
820cc88f
DB		 2629 unsigned nonlocal_flag : 1;
2630 unsigned virtual_flag : 1;
2631 unsigned ignored_flag : 1;
2632 unsigned abstract_flag : 1;
2633 unsigned artificial_flag : 1;
2634 unsigned user_align : 1;
2635 unsigned preserve_flag: 1;
2636 unsigned debug_expr_is_from : 1;
2637
2638 unsigned lang_flag_0 : 1;
2639 unsigned lang_flag_1 : 1;
2640 unsigned lang_flag_2 : 1;
2641 unsigned lang_flag_3 : 1;
2642 unsigned lang_flag_4 : 1;
2643 unsigned lang_flag_5 : 1;
2644 unsigned lang_flag_6 : 1;
2645 unsigned lang_flag_7 : 1;
0ac11108 2646
820cc88f
DB		 2647 /* In LABEL_DECL, this is DECL_ERROR_ISSUED.
2648 In VAR_DECL and PARM_DECL, this is DECL_REGISTER. */
2649 unsigned decl_flag_0 : 1;
52dd234b 2650 /* In FIELD_DECL, this is DECL_PACKED. */
820cc88f
DB		 2651 unsigned decl_flag_1 : 1;
2652 /* In FIELD_DECL, this is DECL_BIT_FIELD
0ac11108
EC		 2653 In VAR_DECL and FUNCTION_DECL, this is DECL_EXTERNAL.
2654 In TYPE_DECL, this is TYPE_DECL_SUPRESS_DEBUG. */
2655 unsigned decl_flag_2 : 1;
820cc88f
DB		 2656 /* In FIELD_DECL, this is DECL_NONADDRESSABLE_P
2657 In VAR_DECL and PARM_DECL, this is DECL_HAS_VALUE_EXPR. */
0ac11108
EC		 2658 unsigned decl_flag_3 : 1;
2659 /* Logically, these two would go in a theoretical base shared by var and
fe1f8f44 2660 parm decl. */
820cc88f 2661 unsigned gimple_reg_flag : 1;
058dcc25
ILT		 2662 /* In a DECL with pointer type, set if no TBAA should be done. */
2663 unsigned no_tbaa_flag : 1;
d9223014 2664 /* Padding so that 'off_align' can be on a 32-bit boundary. */
837edd5f 2665 unsigned decl_common_unused : 2;
0ac11108 2666
837edd5f
GK		 2667 /* DECL_OFFSET_ALIGN, used only for FIELD_DECLs. */
2668 unsigned int off_align : 8;
820cc88f
DB		 2669
2670 tree size_unit;
2671 tree initial;
2672 tree attributes;
2673 tree abstract_origin;
0ac11108 2674
d9223014
L		 2675 /* DECL_ALIGN. It should have the same size as TYPE_ALIGN. */
2676 unsigned int align;
2677
4862826d 2678 alias_set_type pointer_alias_set;
820cc88f
DB		 2679 /* Points to a structure whose details depend on the language in use. */
2680 struct lang_decl *lang_specific;
2681};
588d3ade 2682
833b3afe
DB		 2683extern tree decl_value_expr_lookup (tree);
2684extern void decl_value_expr_insert (tree, tree);
2685
1a186ec5
RH		 2686/* In a VAR_DECL or PARM_DECL, the location at which the value may be found,
2687 if transformations have made this more complicated than evaluating the
2688 decl itself. This should only be used for debugging; once this field has
2689 been set, the decl itself may not legitimately appear in the function. */
833b3afe 2690#define DECL_HAS_VALUE_EXPR_P(NODE) \
820cc88f 2691 (TREE_CHECK2 (NODE, VAR_DECL, PARM_DECL)->decl_common.decl_flag_3)
1a186ec5 2692#define DECL_VALUE_EXPR(NODE) \
0ac11108 2693 (decl_value_expr_lookup (DECL_WRTL_CHECK (NODE)))
833b3afe 2694#define SET_DECL_VALUE_EXPR(NODE, VAL) \
820cc88f 2695 (decl_value_expr_insert (DECL_WRTL_CHECK (NODE), VAL))
1a186ec5 2696
820cc88f
DB		 2697/* Holds the RTL expression for the value of a variable or function.
2698 This value can be evaluated lazily for functions, variables with
2699 static storage duration, and labels. */
2700#define DECL_RTL(NODE) \
2701 (DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl \
2702 ? (NODE)->decl_with_rtl.rtl \
2703 : (make_decl_rtl (NODE), (NODE)->decl_with_rtl.rtl))
140592a0 2704
820cc88f
DB		 2705/* Set the DECL_RTL for NODE to RTL. */
2706#define SET_DECL_RTL(NODE, RTL) set_decl_rtl (NODE, RTL)
6e9a3221 2707
820cc88f
DB		 2708/* Returns nonzero if NODE is a tree node that can contain RTL. */
2709#define HAS_RTL_P(NODE) (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WRTL))
2710
2711/* Returns nonzero if the DECL_RTL for NODE has already been set. */
2712#define DECL_RTL_SET_P(NODE) (HAS_RTL_P (NODE) && DECL_WRTL_CHECK (NODE)->decl_with_rtl.rtl != NULL)
2713
2714/* Copy the RTL from NODE1 to NODE2. If the RTL was not set for
2715 NODE1, it will not be set for NODE2; this is a lazy copy. */
2716#define COPY_DECL_RTL(NODE1, NODE2) \
2717 (DECL_WRTL_CHECK (NODE2)->decl_with_rtl.rtl = DECL_WRTL_CHECK (NODE1)->decl_with_rtl.rtl)
2718
2719/* The DECL_RTL for NODE, if it is set, or NULL, if it is not set. */
2720#define DECL_RTL_IF_SET(NODE) (DECL_RTL_SET_P (NODE) ? DECL_RTL (NODE) : NULL)
2721
2722/* In VAR_DECL and PARM_DECL nodes, nonzero means declared `register'. */
2723#define DECL_REGISTER(NODE) (DECL_WRTL_CHECK (NODE)->decl_common.decl_flag_0)
2724
d1b38208 2725struct GTY(()) tree_decl_with_rtl {
820cc88f
DB		 2726 struct tree_decl_common common;
2727 rtx rtl;
2728};
2729
2730/* In a FIELD_DECL, this is the field position, counting in bytes, of the
a40776a2
SL		 2731 DECL_OFFSET_ALIGN-bit-sized word containing the bit closest to the beginning
2732 of the structure. */
820cc88f
DB		 2733#define DECL_FIELD_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.offset)
2734
2735/* In a FIELD_DECL, this is the offset, in bits, of the first bit of the
a40776a2
SL		 2736 field from DECL_FIELD_OFFSET. This field may be nonzero even for fields
2737 that are not bit fields (since DECL_OFFSET_ALIGN may be larger than the
2738 natural alignment of the field's type). */
820cc88f
DB		 2739#define DECL_FIELD_BIT_OFFSET(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.bit_offset)
2740
2741/* In a FIELD_DECL, this indicates whether the field was a bit-field and
2742 if so, the type that was originally specified for it.
2743 TREE_TYPE may have been modified (in finish_struct). */
2744#define DECL_BIT_FIELD_TYPE(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.bit_field_type)
2745
2746/* For a FIELD_DECL in a QUAL_UNION_TYPE, records the expression, which
2747 if nonzero, indicates that the field occupies the type. */
2748#define DECL_QUALIFIER(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.qualifier)
2749
2750/* For FIELD_DECLs, off_align holds the number of low-order bits of
2751 DECL_FIELD_OFFSET which are known to be always zero.
2752 DECL_OFFSET_ALIGN thus returns the alignment that DECL_FIELD_OFFSET
2753 has. */
2754#define DECL_OFFSET_ALIGN(NODE) \
837edd5f 2755 (((unsigned HOST_WIDE_INT)1) << FIELD_DECL_CHECK (NODE)->decl_common.off_align)
820cc88f
DB		 2756
2757/* Specify that DECL_ALIGN(NODE) is a multiple of X. */
2758#define SET_DECL_OFFSET_ALIGN(NODE, X) \
837edd5f 2759 (FIELD_DECL_CHECK (NODE)->decl_common.off_align = exact_log2 ((X) & -(X)))
820cc88f
DB		 2760/* 1 if the alignment for this type was requested by "aligned" attribute,
2761 0 if it is the default for this type. */
2762
2763/* For FIELD_DECLS, DECL_FCONTEXT is the *first* baseclass in
2764 which this FIELD_DECL is defined. This information is needed when
2765 writing debugging information about vfield and vbase decls for C++. */
2766#define DECL_FCONTEXT(NODE) (FIELD_DECL_CHECK (NODE)->field_decl.fcontext)
2767
2768/* In a FIELD_DECL, indicates this field should be bit-packed. */
2769#define DECL_PACKED(NODE) (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_1)
2a8f6b90 2770
8da1b058
RS		 2771/* Nonzero in a FIELD_DECL means it is a bit field, and must be accessed
2772 specially. */
820cc88f 2773#define DECL_BIT_FIELD(NODE) (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_2)
c46080ab 2774
820cc88f 2775/* Used in a FIELD_DECL to indicate that we cannot form the address of
b5487346
EB		 2776 this component. This makes it possible for Type-Based Alias Analysis
2777 to disambiguate accesses to this field with indirect accesses using
2778 the field's type:
2779
2780 struct S { int i; } s;
2781 int *p;
2782
2783 If the flag is set on 'i', TBAA computes that s.i and *p never conflict.
2784
2785 From the implementation's viewpoint, the alias set of the type of the
2786 field 'i' (int) will not be recorded as a subset of that of the type of
2787 's' (struct S) in record_component_aliases. The counterpart is that
2788 accesses to s.i must not be given the alias set of the type of 'i'
2789 (int) but instead directly that of the type of 's' (struct S). */
820cc88f
DB		 2790#define DECL_NONADDRESSABLE_P(NODE) \
2791 (FIELD_DECL_CHECK (NODE)->decl_common.decl_flag_3)
26db82d8 2792
d1b38208 2793struct GTY(()) tree_field_decl {
820cc88f
DB		 2794 struct tree_decl_common common;
2795
0ac11108
EC		 2796 tree offset;
2797 tree bit_field_type;
820cc88f
DB		 2798 tree qualifier;
2799 tree bit_offset;
2800 tree fcontext;
0ac11108 2801
820cc88f 2802};
8da1b058 2803
820cc88f
DB		 2804/* A numeric unique identifier for a LABEL_DECL. The UID allocation is
2805 dense, unique within any one function, and may be used to index arrays.
2806 If the value is -1, then no UID has been assigned. */
2807#define LABEL_DECL_UID(NODE) \
2808 (LABEL_DECL_CHECK (NODE)->decl_common.pointer_alias_set)
c46080ab 2809
820cc88f
DB		 2810/* In LABEL_DECL nodes, nonzero means that an error message about
2811 jumping into such a binding contour has been printed for this label. */
2812#define DECL_ERROR_ISSUED(NODE) (LABEL_DECL_CHECK (NODE)->decl_common.decl_flag_0)
12a22e76 2813
d1b38208 2814struct GTY(()) tree_label_decl {
820cc88f 2815 struct tree_decl_with_rtl common;
820cc88f
DB		 2816};
2817
d1b38208 2818struct GTY(()) tree_result_decl {
820cc88f
DB		 2819 struct tree_decl_with_rtl common;
2820};
2821
d1b38208 2822struct GTY(()) tree_const_decl {
820cc88f
DB		 2823 struct tree_decl_with_rtl common;
2824};
2825
2826/* For a PARM_DECL, records the data type used to pass the argument,
2827 which may be different from the type seen in the program. */
2828#define DECL_ARG_TYPE(NODE) (PARM_DECL_CHECK (NODE)->decl_common.initial)
2829
2830/* For PARM_DECL, holds an RTL for the stack slot or register
2831 where the data was actually passed. */
2832#define DECL_INCOMING_RTL(NODE) (PARM_DECL_CHECK (NODE)->parm_decl.incoming_rtl)
30801830 2833
d1b38208 2834struct GTY(()) tree_parm_decl {
820cc88f 2835 struct tree_decl_with_rtl common;
0ac11108 2836 rtx incoming_rtl;
820cc88f 2837};
770ae6cc 2838
2c5f4139 2839
820cc88f
DB		 2840/* Nonzero in a decl means that the gimplifier has seen (or placed)
2841 this variable in a BIND_EXPR. */
2842#define DECL_SEEN_IN_BIND_EXPR_P(NODE) \
2843 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.seen_in_bind_expr)
3edbc4b9 2844
820cc88f
DB		 2845/* Used to indicate that the linkage status of this DECL is not yet known,
2846 so it should not be output now. */
2847#define DECL_DEFER_OUTPUT(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.defer_output)
2848
2849/* Nonzero for a given ..._DECL node means that no warnings should be
2850 generated just because this node is unused. */
2851#define DECL_IN_SYSTEM_HEADER(NODE) \
aa14403d 2852 (in_system_header_at (DECL_SOURCE_LOCATION (NODE)))
820cc88f
DB		 2853
2854 /* Used to indicate that this DECL has weak linkage. */
2855#define DECL_WEAK(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.weak_flag)
2856
43d9ad1d
DS		 2857/* Used to indicate that the DECL is a dllimport. */
2858#define DECL_DLLIMPORT_P(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.dllimport_flag)
daefd78b 2859
0b494699
ILT		 2860/* DECL_BASED_ON_RESTRICT_P records whether a VAR_DECL is a temporary
2861 based on a variable with a restrict qualified type. If it is,
2862 DECL_RESTRICT_BASE returns the restrict qualified variable on which
2863 it is based. */
2864
2865#define DECL_BASED_ON_RESTRICT_P(NODE) \
2866 (VAR_DECL_CHECK (NODE)->decl_with_vis.based_on_restrict_p)
2867#define DECL_GET_RESTRICT_BASE(NODE) \
2868 (decl_restrict_base_lookup (VAR_DECL_CHECK (NODE)))
2869#define SET_DECL_RESTRICT_BASE(NODE, VAL) \
2870 (decl_restrict_base_insert (VAR_DECL_CHECK (NODE), (VAL)))
2871
2872extern tree decl_restrict_base_lookup (tree);
2873extern void decl_restrict_base_insert (tree, tree);
c5bd82cb 2874
59182242
MM		 2875/* Used in a DECL to indicate that, even if it TREE_PUBLIC, it need
2876 not be put out unless it is needed in this translation unit.
2877 Entities like this are shared across translation units (like weak
2878 entities), but are guaranteed to be generated by any translation
2879 unit that needs them, and therefore need not be put out anywhere
2880 where they are not needed. DECL_COMDAT is just a hint to the
2881 back-end; it is up to front-ends which set this flag to ensure
2882 that there will never be any harm, other than bloat, in putting out
2883 something which is DECL_COMDAT. */
820cc88f 2884#define DECL_COMDAT(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.comdat_flag)
59182242 2885
56fd65c7
MM		 2886/* A replaceable function is one which may be replaced at link-time
2887 with an entirely different definition, provided that the
2888 replacement has the same type. For example, functions declared
2889 with __attribute__((weak)) on most systems are replaceable.
2890
2891 COMDAT functions are not replaceable, since all definitions of the
2892 function must be equivalent. It is important that COMDAT functions
2893 not be treated as replaceable so that use of C++ template
2894 instantiations is not penalized.
2895
2896 For example, DECL_REPLACEABLE is used to determine whether or not a
2897 function (including a template instantiation) which is not
2898 explicitly declared "inline" can be inlined. If the function is
2899 DECL_REPLACEABLE then it is not safe to do the inlining, since the
2900 implementation chosen at link-time may be different. However, a
2901 function that is not DECL_REPLACEABLE can be inlined, since all
2902 versions of the function will be functionally identical. */
2903#define DECL_REPLACEABLE_P(NODE) \
2904 (!DECL_COMDAT (NODE) && !targetm.binds_local_p (NODE))
2905
820cc88f
DB		 2906/* The name of the object as the assembler will see it (but before any
2907 translations made by ASM_OUTPUT_LABELREF). Often this is the same
2908 as DECL_NAME. It is an IDENTIFIER_NODE. */
2909#define DECL_ASSEMBLER_NAME(NODE) decl_assembler_name (NODE)
07417085 2910
0ac11108 2911/* Return true if NODE is a NODE that can contain a DECL_ASSEMBLER_NAME.
820cc88f
DB		 2912 This is true of all DECL nodes except FIELD_DECL. */
2913#define HAS_DECL_ASSEMBLER_NAME_P(NODE) \
2914 (CODE_CONTAINS_STRUCT (TREE_CODE (NODE), TS_DECL_WITH_VIS))
a157febd 2915
820cc88f
DB		 2916/* Returns nonzero if the DECL_ASSEMBLER_NAME for NODE has been set. If zero,
2917 the NODE might still have a DECL_ASSEMBLER_NAME -- it just hasn't been set
2918 yet. */
2919#define DECL_ASSEMBLER_NAME_SET_P(NODE) \
2920 (HAS_DECL_ASSEMBLER_NAME_P (NODE) && DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name != NULL_TREE)
8da1b058 2921
820cc88f
DB		 2922/* Set the DECL_ASSEMBLER_NAME for NODE to NAME. */
2923#define SET_DECL_ASSEMBLER_NAME(NODE, NAME) \
2924 (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.assembler_name = (NAME))
27da1b4d 2925
820cc88f
DB		 2926/* Copy the DECL_ASSEMBLER_NAME from DECL1 to DECL2. Note that if DECL1's
2927 DECL_ASSEMBLER_NAME has not yet been set, using this macro will not cause
2928 the DECL_ASSEMBLER_NAME of either DECL to be set. In other words, the
2929 semantics of using this macro, are different than saying:
2bf105ab 2930
820cc88f 2931 SET_DECL_ASSEMBLER_NAME(DECL2, DECL_ASSEMBLER_NAME (DECL1))
3932261a 2932
820cc88f 2933 which will try to set the DECL_ASSEMBLER_NAME for DECL1. */
6de9cd9a 2934
820cc88f
DB		 2935#define COPY_DECL_ASSEMBLER_NAME(DECL1, DECL2) \
2936 (DECL_ASSEMBLER_NAME_SET_P (DECL1) \
2937 ? (void) SET_DECL_ASSEMBLER_NAME (DECL2, \
2938 DECL_ASSEMBLER_NAME (DECL1)) \
2939 : (void) 0)
6de9cd9a 2940
820cc88f
DB		 2941/* Records the section name in a section attribute. Used to pass
2942 the name from decl_attributes to make_function_rtl and make_decl_rtl. */
2943#define DECL_SECTION_NAME(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.section_name)
3932261a 2944
820cc88f
DB		 2945/* Value of the decls's visibility attribute */
2946#define DECL_VISIBILITY(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility)
2947
2948/* Nonzero means that the decl had its visibility specified rather than
2949 being inferred. */
2950#define DECL_VISIBILITY_SPECIFIED(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.visibility_specified)
2951
2952/* Used in TREE_PUBLIC decls to indicate that copies of this DECL in
2953 multiple translation units should be merged. */
2954#define DECL_ONE_ONLY(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.one_only)
2955
d1b38208 2956struct GTY(()) tree_decl_with_vis {
820cc88f
DB		 2957 struct tree_decl_with_rtl common;
2958 tree assembler_name;
2959 tree section_name;
0ac11108 2960
820cc88f
DB		 2961 /* Belong to VAR_DECL exclusively. */
2962 unsigned defer_output:1;
2963 unsigned hard_register:1;
2964 unsigned thread_local:1;
0ac11108 2965 unsigned common_flag:1;
820cc88f 2966 unsigned in_text_section : 1;
0ac11108 2967 unsigned dllimport_flag : 1;
0b494699 2968 unsigned based_on_restrict_p : 1;
820cc88f
DB		 2969 /* Used by C++. Might become a generic decl flag. */
2970 unsigned shadowed_for_var_p : 1;
0ac11108 2971
820cc88f 2972 /* Don't belong to VAR_DECL exclusively. */
820cc88f
DB		 2973 unsigned weak_flag:1;
2974 unsigned seen_in_bind_expr : 1;
2975 unsigned comdat_flag : 1;
2976 ENUM_BITFIELD(symbol_visibility) visibility : 2;
2977 unsigned visibility_specified : 1;
2978 /* Belong to FUNCTION_DECL exclusively. */
2979 unsigned one_only : 1;
2980 unsigned init_priority_p:1;
2981
2982 /* Belongs to VAR_DECL exclusively. */
2983 ENUM_BITFIELD(tls_model) tls_model : 3;
ba4d8f9d 2984 /* 13 unused bits. */
820cc88f
DB		 2985};
2986
2987/* In a VAR_DECL that's static,
2988 nonzero if the space is in the text section. */
2989#define DECL_IN_TEXT_SECTION(NODE) (VAR_DECL_CHECK (NODE)->decl_with_vis.in_text_section)
2990
2991/* Nonzero for a given ..._DECL node means that this node should be
2992 put in .common, if possible. If a DECL_INITIAL is given, and it
2993 is not error_mark_node, then the decl cannot be put in .common. */
2994#define DECL_COMMON(NODE) (DECL_WITH_VIS_CHECK (NODE)->decl_with_vis.common_flag)
2995
2996/* In a VAR_DECL, nonzero if the decl is a register variable with
2997 an explicit asm specification. */
2998#define DECL_HARD_REGISTER(NODE) (VAR_DECL_CHECK (NODE)->decl_with_vis.hard_register)
2999
3000extern tree decl_debug_expr_lookup (tree);
3001extern void decl_debug_expr_insert (tree, tree);
3002/* For VAR_DECL, this is set to either an expression that it was split
3003 from (if DECL_DEBUG_EXPR_IS_FROM is true), otherwise a tree_list of
3004 subexpressions that it was split into. */
3005#define DECL_DEBUG_EXPR(NODE) \
3006 (decl_debug_expr_lookup (VAR_DECL_CHECK (NODE)))
3007
3008#define SET_DECL_DEBUG_EXPR(NODE, VAL) \
3009 (decl_debug_expr_insert (VAR_DECL_CHECK (NODE), VAL))
3010
fa10beec 3011/* An initialization priority. */
fc8600f9 3012typedef unsigned short priority_type;
820cc88f 3013
fc8600f9
MM		 3014extern priority_type decl_init_priority_lookup (tree);
3015extern priority_type decl_fini_priority_lookup (tree);
3016extern void decl_init_priority_insert (tree, priority_type);
3017extern void decl_fini_priority_insert (tree, priority_type);
820cc88f 3018
fc8600f9
MM		 3019/* In a non-local VAR_DECL with static storage duration, true if the
3020 variable has an initialization priority. If false, the variable
3021 will be initialized at the DEFAULT_INIT_PRIORITY. */
820cc88f
DB		 3022#define DECL_HAS_INIT_PRIORITY_P(NODE) \
3023 (VAR_DECL_CHECK (NODE)->decl_with_vis.init_priority_p)
fc8600f9 3024
873c7164
MM		 3025/* For a VAR_DECL or FUNCTION_DECL the initialization priority of
3026 NODE. */
820cc88f 3027#define DECL_INIT_PRIORITY(NODE) \
fc8600f9
MM		 3028 (decl_init_priority_lookup (NODE))
3029/* Set the initialization priority for NODE to VAL. */
820cc88f 3030#define SET_DECL_INIT_PRIORITY(NODE, VAL) \
fc8600f9
MM		 3031 (decl_init_priority_insert (NODE, VAL))
3032
873c7164 3033/* For a FUNCTION_DECL the finalization priority of NODE. */
fc8600f9
MM		 3034#define DECL_FINI_PRIORITY(NODE) \
3035 (decl_fini_priority_lookup (NODE))
3036/* Set the finalization priority for NODE to VAL. */
3037#define SET_DECL_FINI_PRIORITY(NODE, VAL) \
3038 (decl_fini_priority_insert (NODE, VAL))
3039
3040/* The initialization priority for entities for which no explicit
3041 initialization priority has been specified. */
3042#define DEFAULT_INIT_PRIORITY 65535
3043
3044/* The maximum allowed initialization priority. */
3045#define MAX_INIT_PRIORITY 65535
3046
3047/* The largest priority value reserved for use by system runtime
3048 libraries. */
3049#define MAX_RESERVED_INIT_PRIORITY 100
820cc88f
DB		 3050
3051/* In a VAR_DECL, the model to use if the data should be allocated from
3052 thread-local storage. */
3053#define DECL_TLS_MODEL(NODE) (VAR_DECL_CHECK (NODE)->decl_with_vis.tls_model)
3054
3055/* In a VAR_DECL, nonzero if the data should be allocated from
3056 thread-local storage. */
3057#define DECL_THREAD_LOCAL_P(NODE) \
feb60f03 3058 (VAR_DECL_CHECK (NODE)->decl_with_vis.tls_model >= TLS_MODEL_REAL)
820cc88f 3059
d1b38208 3060struct GTY(()) tree_var_decl {
820cc88f
DB		 3061 struct tree_decl_with_vis common;
3062};
3063
3064
3065/* This field is used to reference anything in decl.result and is meant only
3066 for use by the garbage collector. */
3067#define DECL_RESULT_FLD(NODE) (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.result)
3068
3069/* The DECL_VINDEX is used for FUNCTION_DECLS in two different ways.
3070 Before the struct containing the FUNCTION_DECL is laid out,
3071 DECL_VINDEX may point to a FUNCTION_DECL in a base class which
3072 is the FUNCTION_DECL which this FUNCTION_DECL will replace as a virtual
3073 function. When the class is laid out, this pointer is changed
3074 to an INTEGER_CST node which is suitable for use as an index
0ac11108 3075 into the virtual function table.
820cc88f
DB		 3076 C++ also uses this field in namespaces, hence the DECL_NON_COMMON_CHECK. */
3077#define DECL_VINDEX(NODE) (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.vindex)
3078
d1b38208
TG		 3079struct GTY(())
3080 tree_decl_non_common {
820cc88f
DB		 3081 struct tree_decl_with_vis common;
3082 /* C++ uses this in namespaces. */
3083 tree saved_tree;
3084 /* C++ uses this in templates. */
0ac11108 3085 tree arguments;
820cc88f 3086 /* Almost all FE's use this. */
0ac11108 3087 tree result;
820cc88f
DB		 3088 /* C++ uses this in namespaces. */
3089 tree vindex;
3090};
3091
3092/* In FUNCTION_DECL, holds the decl for the return value. */
3093#define DECL_RESULT(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.result)
3094
3095/* In a FUNCTION_DECL, nonzero if the function cannot be inlined. */
3096#define DECL_UNINLINABLE(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.uninlinable)
3097
3098/* In a FUNCTION_DECL, the saved representation of the body of the
3099 entire function. */
3100#define DECL_SAVED_TREE(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.saved_tree)
3101
3102/* Nonzero in a FUNCTION_DECL means this function should be treated
3103 as if it were a malloc, meaning it returns a pointer that is
3104 not an alias. */
3105#define DECL_IS_MALLOC(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.malloc_flag)
3106
1ea193c2
ILT		 3107/* Nonzero in a FUNCTION_DECL means this function should be treated as
3108 C++ operator new, meaning that it returns a pointer for which we
3109 should not use type based aliasing. */
3110#define DECL_IS_OPERATOR_NEW(NODE) \
3111 (FUNCTION_DECL_CHECK (NODE)->function_decl.operator_new_flag)
3112
820cc88f
DB		 3113/* Nonzero in a FUNCTION_DECL means this function may return more
3114 than once. */
3115#define DECL_IS_RETURNS_TWICE(NODE) \
3116 (FUNCTION_DECL_CHECK (NODE)->function_decl.returns_twice_flag)
3117
3118/* Nonzero in a FUNCTION_DECL means this function should be treated
3119 as "pure" function (like const function, but may read global memory). */
becfd6e5
KZ		 3120#define DECL_PURE_P(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.pure_flag)
3121
3122/* Nonzero only if one of TREE_READONLY or DECL_PURE_P is nonzero AND
3123 the const or pure function may not terminate. When this is nonzero
3124 for a const or pure function, it can be dealt with by cse passes
3125 but cannot be removed by dce passes since you are not allowed to
3126 change an infinite looping program into one that terminates without
3127 error. */
3128#define DECL_LOOPING_CONST_OR_PURE_P(NODE) \
3129 (FUNCTION_DECL_CHECK (NODE)->function_decl.looping_const_or_pure_flag)
820cc88f
DB		 3130
3131/* Nonzero in a FUNCTION_DECL means this function should be treated
3132 as "novops" function (function that does not read global memory,
3133 but may have arbitrary side effects). */
3134#define DECL_IS_NOVOPS(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.novops_flag)
3135
3136/* Used in FUNCTION_DECLs to indicate that they should be run automatically
3137 at the beginning or end of execution. */
3138#define DECL_STATIC_CONSTRUCTOR(NODE) \
3139 (FUNCTION_DECL_CHECK (NODE)->function_decl.static_ctor_flag)
3140
3141#define DECL_STATIC_DESTRUCTOR(NODE) \
3142(FUNCTION_DECL_CHECK (NODE)->function_decl.static_dtor_flag)
3143
3144/* Used in FUNCTION_DECLs to indicate that function entry and exit should
3145 be instrumented with calls to support routines. */
3146#define DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT(NODE) \
3147 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_instrument_function_entry_exit)
3148
3149/* Used in FUNCTION_DECLs to indicate that limit-stack-* should be
3150 disabled in this function. */
3151#define DECL_NO_LIMIT_STACK(NODE) \
3152 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_limit_stack)
3153
3154/* In a FUNCTION_DECL with a nonzero DECL_CONTEXT, indicates that a
3155 static chain is not needed. */
3156#define DECL_NO_STATIC_CHAIN(NODE) \
3157 (FUNCTION_DECL_CHECK (NODE)->function_decl.regdecl_flag)
4b1e44be 3158
6f312d18
ZW		 3159/* Nonzero for a decl that cgraph has decided should be inlined into
3160 at least one call site. It is not meaningful to look at this
3161 directly; always use cgraph_function_possibly_inlined_p. */
3162#define DECL_POSSIBLY_INLINED(DECL) \
820cc88f 3163 FUNCTION_DECL_CHECK (DECL)->function_decl.possibly_inlined
6f312d18 3164
820cc88f
DB		 3165/* Nonzero in a FUNCTION_DECL means that this function was declared inline,
3166 such as via the `inline' keyword in C/C++. This flag controls the linkage
0494626a 3167 semantics of 'inline' */
820cc88f
DB		 3168#define DECL_DECLARED_INLINE_P(NODE) \
3169 (FUNCTION_DECL_CHECK (NODE)->function_decl.declared_inline_flag)
17ad5b5e 3170
0494626a
JH		 3171/* Nonzero in a FUNCTION_DECL means this function should not get
3172 -Winline warnings. */
3173#define DECL_NO_INLINE_WARNING_P(NODE) \
3174 (FUNCTION_DECL_CHECK (NODE)->function_decl.no_inline_warning_flag)
3175
c536a6a7
RG		 3176/* Nonzero in a FUNCTION_DECL that should be always inlined by the inliner
3177 disregarding size and cost heuristics. This is equivalent to using
3178 the always_inline attribute without the required diagnostics if the
3179 function cannot be inlined. */
3180#define DECL_DISREGARD_INLINE_LIMITS(NODE) \
3181 (FUNCTION_DECL_CHECK (NODE)->function_decl.disregard_inline_limits)
3182
820cc88f
DB		 3183/* For FUNCTION_DECL, this holds a pointer to a structure ("struct function")
3184 that describes the status of this function. */
3185#define DECL_STRUCT_FUNCTION(NODE) (FUNCTION_DECL_CHECK (NODE)->function_decl.f)
e41d82f5 3186
820cc88f
DB		 3187/* In a FUNCTION_DECL, nonzero means a built in function. */
3188#define DECL_BUILT_IN(NODE) (DECL_BUILT_IN_CLASS (NODE) != NOT_BUILT_IN)
968b41a1 3189
820cc88f
DB		 3190/* For a builtin function, identify which part of the compiler defined it. */
3191#define DECL_BUILT_IN_CLASS(NODE) \
3192 (FUNCTION_DECL_CHECK (NODE)->function_decl.built_in_class)
c2f7fa15 3193
820cc88f
DB		 3194/* In FUNCTION_DECL, a chain of ..._DECL nodes.
3195 VAR_DECL and PARM_DECL reserve the arguments slot for language-specific
3196 uses. */
3197#define DECL_ARGUMENTS(NODE) (FUNCTION_DECL_CHECK (NODE)->decl_non_common.arguments)
046a69e0 3198#define DECL_ARGUMENT_FLD(NODE) (DECL_NON_COMMON_CHECK (NODE)->decl_non_common.arguments)
8da1b058 3199
ab442df7
MM		 3200/* In FUNCTION_DECL, the function specific target options to use when compiling
3201 this function. */
3202#define DECL_FUNCTION_SPECIFIC_TARGET(NODE) \
3203 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_target)
3204
3205/* In FUNCTION_DECL, the function specific optimization options to use when
3206 compiling this function. */
3207#define DECL_FUNCTION_SPECIFIC_OPTIMIZATION(NODE) \
3208 (FUNCTION_DECL_CHECK (NODE)->function_decl.function_specific_optimization)
3209
820cc88f
DB		 3210/* FUNCTION_DECL inherits from DECL_NON_COMMON because of the use of the
3211 arguments/result/saved_tree fields by front ends. It was either inherit
3212 FUNCTION_DECL from non_common, or inherit non_common from FUNCTION_DECL,
3213 which seemed a bit strange. */
8da1b058 3214
d1b38208 3215struct GTY(()) tree_function_decl {
820cc88f 3216 struct tree_decl_non_common common;
0ac11108 3217
c536a6a7
RG		 3218 struct function *f;
3219
ab442df7
MM		 3220 /* Function specific options that are used by this function. */
3221 tree function_specific_target; /* target options */
3222 tree function_specific_optimization; /* optimization options */
3223
837edd5f 3224 /* In a FUNCTION_DECL for which DECL_BUILT_IN holds, this is
c536a6a7
RG		 3225 DECL_FUNCTION_CODE. Otherwise unused.
3226 ??? The bitfield needs to be able to hold all target function
3227 codes as well. */
bb011bbc 3228 ENUM_BITFIELD(built_in_function) function_code : 11;
c536a6a7 3229 ENUM_BITFIELD(built_in_class) built_in_class : 2;
837edd5f 3230
2c5f4139
JM		 3231 unsigned static_ctor_flag : 1;
3232 unsigned static_dtor_flag : 1;
820cc88f 3233 unsigned uninlinable : 1;
c536a6a7 3234
bb011bbc 3235 unsigned possibly_inlined : 1;
820cc88f
DB		 3236 unsigned novops_flag : 1;
3237 unsigned returns_twice_flag : 1;
9df2c88c 3238 unsigned malloc_flag : 1;
1ea193c2 3239 unsigned operator_new_flag : 1;
b3c3af2f 3240 unsigned declared_inline_flag : 1;
820cc88f 3241 unsigned regdecl_flag : 1;
c536a6a7 3242
0494626a 3243 unsigned no_inline_warning_flag : 1;
bb011bbc 3244 unsigned no_instrument_function_entry_exit : 1;
820cc88f 3245 unsigned no_limit_stack : 1;
c536a6a7 3246 unsigned disregard_inline_limits : 1;
becfd6e5
KZ		 3247 unsigned pure_flag : 1;
3248 unsigned looping_const_or_pure_flag : 1;
3249
9df2c88c 3250
becfd6e5 3251 /* 3 bits left */
820cc88f 3252};
8da1b058 3253
820cc88f
DB		 3254/* For a TYPE_DECL, holds the "original" type. (TREE_TYPE has the copy.) */
3255#define DECL_ORIGINAL_TYPE(NODE) (TYPE_DECL_CHECK (NODE)->decl_non_common.result)
c2f7fa15 3256
820cc88f
DB		 3257/* In a TYPE_DECL nonzero means the detail info about this type is not dumped
3258 into stabs. Instead it will generate cross reference ('x') of names.
3259 This uses the same flag as DECL_EXTERNAL. */
3260#define TYPE_DECL_SUPPRESS_DEBUG(NODE) \
3261 (TYPE_DECL_CHECK (NODE)->decl_common.decl_flag_2)
6de9cd9a 3262
d19c0f4b
DS		 3263/* Getter of the imported declaration associated to the
3264 IMPORTED_DECL node. */
3265#define IMPORTED_DECL_ASSOCIATED_DECL(NODE) \
3266(DECL_INITIAL (IMPORTED_DECL_CHECK (NODE)))
3267
d1b38208 3268struct GTY(()) tree_type_decl {
820cc88f 3269 struct tree_decl_non_common common;
09f532c9 3270
8da1b058 3271};
6de9cd9a
DN		 3272\f
3273/* A STATEMENT_LIST chains statements together in GENERIC and GIMPLE.
3274 To reduce overhead, the nodes containing the statements are not trees.
3275 This avoids the overhead of tree_common on all linked list elements.
3276
3277 Use the interface in tree-iterator.h to access this node. */
3278
3279#define STATEMENT_LIST_HEAD(NODE) \
3280 (STATEMENT_LIST_CHECK (NODE)->stmt_list.head)
3281#define STATEMENT_LIST_TAIL(NODE) \
3282 (STATEMENT_LIST_CHECK (NODE)->stmt_list.tail)
3283
d1b38208
TG		 3284struct GTY ((chain_next ("%h.next"), chain_prev ("%h.prev"))) tree_statement_list_node
3285 {
6de9cd9a
DN		 3286 struct tree_statement_list_node *prev;
3287 struct tree_statement_list_node *next;
3288 tree stmt;
3289};
3290
d1b38208
TG		 3291struct GTY(()) tree_statement_list
3292 {
6de9cd9a
DN		 3293 struct tree_common common;
3294 struct tree_statement_list_node *head;
3295 struct tree_statement_list_node *tail;
3296};
33c94679 3297
ab442df7
MM		 3298
3299/* Optimization options used by a function. */
3300
d1b38208 3301struct GTY(()) tree_optimization_option {
ab442df7
MM		 3302 struct tree_common common;
3303
3304 /* The optimization options used by the user. */
3305 struct cl_optimization opts;
3306};
3307
3308#define TREE_OPTIMIZATION(NODE) \
3309 (&OPTIMIZATION_NODE_CHECK (NODE)->optimization.opts)
3310
3311/* Return a tree node that encapsulates the current optimization options. */
3312extern tree build_optimization_node (void);
3313
3314/* Target options used by a function. */
3315
d1b38208 3316struct GTY(()) tree_target_option {
ab442df7
MM		 3317 struct tree_common common;
3318
3319 /* The optimization options used by the user. */
3320 struct cl_target_option opts;
3321};
3322
3323#define TREE_TARGET_OPTION(NODE) \
3324 (&TARGET_OPTION_NODE_CHECK (NODE)->target_option.opts)
3325
3326/* Return a tree node that encapsulates the current target options. */
3327extern tree build_target_option_node (void);
3328
8da1b058
RS		 3329\f
3330/* Define the overall contents of a tree node.
3331 It may be any of the structures declared above
3332 for various types of node. */
3333
d1b38208
TG		 3334union GTY ((ptr_alias (union lang_tree_node),
3335 desc ("tree_node_structure (&%h)"))) tree_node {
07beea0d 3336 struct tree_base GTY ((tag ("TS_BASE"))) base;
e2500fed
GK		 3337 struct tree_common GTY ((tag ("TS_COMMON"))) common;
3338 struct tree_int_cst GTY ((tag ("TS_INT_CST"))) int_cst;
3339 struct tree_real_cst GTY ((tag ("TS_REAL_CST"))) real_cst;
325217ed 3340 struct tree_fixed_cst GTY ((tag ("TS_FIXED_CST"))) fixed_cst;
e2500fed
GK		 3341 struct tree_vector GTY ((tag ("TS_VECTOR"))) vector;
3342 struct tree_string GTY ((tag ("TS_STRING"))) string;
3343 struct tree_complex GTY ((tag ("TS_COMPLEX"))) complex;
3344 struct tree_identifier GTY ((tag ("TS_IDENTIFIER"))) identifier;
820cc88f
DB		 3345 struct tree_decl_minimal GTY((tag ("TS_DECL_MINIMAL"))) decl_minimal;
3346 struct tree_decl_common GTY ((tag ("TS_DECL_COMMON"))) decl_common;
3347 struct tree_decl_with_rtl GTY ((tag ("TS_DECL_WRTL"))) decl_with_rtl;
3348 struct tree_decl_non_common GTY ((tag ("TS_DECL_NON_COMMON"))) decl_non_common;
3349 struct tree_parm_decl GTY ((tag ("TS_PARM_DECL"))) parm_decl;
3350 struct tree_decl_with_vis GTY ((tag ("TS_DECL_WITH_VIS"))) decl_with_vis;
3351 struct tree_var_decl GTY ((tag ("TS_VAR_DECL"))) var_decl;
3352 struct tree_field_decl GTY ((tag ("TS_FIELD_DECL"))) field_decl;
3353 struct tree_label_decl GTY ((tag ("TS_LABEL_DECL"))) label_decl;
3354 struct tree_result_decl GTY ((tag ("TS_RESULT_DECL"))) result_decl;
3355 struct tree_const_decl GTY ((tag ("TS_CONST_DECL"))) const_decl;
3356 struct tree_type_decl GTY ((tag ("TS_TYPE_DECL"))) type_decl;
3357 struct tree_function_decl GTY ((tag ("TS_FUNCTION_DECL"))) function_decl;
e2500fed
GK		 3358 struct tree_type GTY ((tag ("TS_TYPE"))) type;
3359 struct tree_list GTY ((tag ("TS_LIST"))) list;
3360 struct tree_vec GTY ((tag ("TS_VEC"))) vec;
3361 struct tree_exp GTY ((tag ("TS_EXP"))) exp;
6de9cd9a 3362 struct tree_ssa_name GTY ((tag ("TS_SSA_NAME"))) ssa_name;
e2500fed 3363 struct tree_block GTY ((tag ("TS_BLOCK"))) block;
95b4aca6 3364 struct tree_binfo GTY ((tag ("TS_BINFO"))) binfo;
6de9cd9a 3365 struct tree_statement_list GTY ((tag ("TS_STATEMENT_LIST"))) stmt_list;
4038c495 3366 struct tree_constructor GTY ((tag ("TS_CONSTRUCTOR"))) constructor;
aaf46ef9 3367 struct tree_omp_clause GTY ((tag ("TS_OMP_CLAUSE"))) omp_clause;
ab442df7
MM		 3368 struct tree_optimization_option GTY ((tag ("TS_OPTIMIZATION"))) optimization;
3369 struct tree_target_option GTY ((tag ("TS_TARGET_OPTION"))) target_option;
6de9cd9a 3370};
1d2a8985 3371\f
81b3411c
BS		 3372/* Standard named or nameless data types of the C compiler. */
3373
3374enum tree_index
3375{
3376 TI_ERROR_MARK,
3377 TI_INTQI_TYPE,
3378 TI_INTHI_TYPE,
3379 TI_INTSI_TYPE,
3380 TI_INTDI_TYPE,
3381 TI_INTTI_TYPE,
3382
3383 TI_UINTQI_TYPE,
3384 TI_UINTHI_TYPE,
3385 TI_UINTSI_TYPE,
3386 TI_UINTDI_TYPE,
3387 TI_UINTTI_TYPE,
41077ce4 3388
167fa32c
EC		 3389 TI_UINT32_TYPE,
3390 TI_UINT64_TYPE,
3391
81b3411c
BS		 3392 TI_INTEGER_ZERO,
3393 TI_INTEGER_ONE,
f2d1f0ba 3394 TI_INTEGER_MINUS_ONE,
81b3411c
BS		 3395 TI_NULL_POINTER,
3396
3397 TI_SIZE_ZERO,
3398 TI_SIZE_ONE,
770ae6cc
RK		 3399
3400 TI_BITSIZE_ZERO,
3401 TI_BITSIZE_ONE,
3402 TI_BITSIZE_UNIT,
3403
5a98fa7b
MM		 3404 TI_PUBLIC,
3405 TI_PROTECTED,
3406 TI_PRIVATE,
3407
de7df9eb
JM		 3408 TI_BOOLEAN_FALSE,
3409 TI_BOOLEAN_TRUE,
3410
81b3411c
BS		 3411 TI_COMPLEX_INTEGER_TYPE,
3412 TI_COMPLEX_FLOAT_TYPE,
3413 TI_COMPLEX_DOUBLE_TYPE,
3414 TI_COMPLEX_LONG_DOUBLE_TYPE,
3415
3416 TI_FLOAT_TYPE,
3417 TI_DOUBLE_TYPE,
3418 TI_LONG_DOUBLE_TYPE,
3419
a2a919aa
KG		 3420 TI_FLOAT_PTR_TYPE,
3421 TI_DOUBLE_PTR_TYPE,
3422 TI_LONG_DOUBLE_PTR_TYPE,
3423 TI_INTEGER_PTR_TYPE,
3424
81b3411c
BS		 3425 TI_VOID_TYPE,
3426 TI_PTR_TYPE,
3427 TI_CONST_PTR_TYPE,
c9f8536c 3428 TI_SIZE_TYPE,
d1c38823 3429 TI_PID_TYPE,
81b3411c
BS		 3430 TI_PTRDIFF_TYPE,
3431 TI_VA_LIST_TYPE,
9d30f3c1
JJ		 3432 TI_VA_LIST_GPR_COUNTER_FIELD,
3433 TI_VA_LIST_FPR_COUNTER_FIELD,
de7df9eb 3434 TI_BOOLEAN_TYPE,
498c0f27 3435 TI_FILEPTR_TYPE,
81b3411c 3436
9a8ce21f
JG		 3437 TI_DFLOAT32_TYPE,
3438 TI_DFLOAT64_TYPE,
3439 TI_DFLOAT128_TYPE,
3440 TI_DFLOAT32_PTR_TYPE,
3441 TI_DFLOAT64_PTR_TYPE,
3442 TI_DFLOAT128_PTR_TYPE,
3443
cbd5937a
MM		 3444 TI_VOID_LIST_NODE,
3445
5b47282c
GM		 3446 TI_MAIN_IDENTIFIER,
3447
325217ed
CF		 3448 TI_SAT_SFRACT_TYPE,
3449 TI_SAT_FRACT_TYPE,
3450 TI_SAT_LFRACT_TYPE,
3451 TI_SAT_LLFRACT_TYPE,
3452 TI_SAT_USFRACT_TYPE,
3453 TI_SAT_UFRACT_TYPE,
3454 TI_SAT_ULFRACT_TYPE,
3455 TI_SAT_ULLFRACT_TYPE,
3456 TI_SFRACT_TYPE,
3457 TI_FRACT_TYPE,
3458 TI_LFRACT_TYPE,
3459 TI_LLFRACT_TYPE,
3460 TI_USFRACT_TYPE,
3461 TI_UFRACT_TYPE,
3462 TI_ULFRACT_TYPE,
3463 TI_ULLFRACT_TYPE,
3464 TI_SAT_SACCUM_TYPE,
3465 TI_SAT_ACCUM_TYPE,
3466 TI_SAT_LACCUM_TYPE,
3467 TI_SAT_LLACCUM_TYPE,
3468 TI_SAT_USACCUM_TYPE,
3469 TI_SAT_UACCUM_TYPE,
3470 TI_SAT_ULACCUM_TYPE,
3471 TI_SAT_ULLACCUM_TYPE,
3472 TI_SACCUM_TYPE,
3473 TI_ACCUM_TYPE,
3474 TI_LACCUM_TYPE,
3475 TI_LLACCUM_TYPE,
3476 TI_USACCUM_TYPE,
3477 TI_UACCUM_TYPE,
3478 TI_ULACCUM_TYPE,
3479 TI_ULLACCUM_TYPE,
3480 TI_QQ_TYPE,
3481 TI_HQ_TYPE,
3482 TI_SQ_TYPE,
3483 TI_DQ_TYPE,
3484 TI_TQ_TYPE,
3485 TI_UQQ_TYPE,
3486 TI_UHQ_TYPE,
3487 TI_USQ_TYPE,
3488 TI_UDQ_TYPE,
3489 TI_UTQ_TYPE,
3490 TI_SAT_QQ_TYPE,
3491 TI_SAT_HQ_TYPE,
3492 TI_SAT_SQ_TYPE,
3493 TI_SAT_DQ_TYPE,
3494 TI_SAT_TQ_TYPE,
3495 TI_SAT_UQQ_TYPE,
3496 TI_SAT_UHQ_TYPE,
3497 TI_SAT_USQ_TYPE,
3498 TI_SAT_UDQ_TYPE,
3499 TI_SAT_UTQ_TYPE,
3500 TI_HA_TYPE,
3501 TI_SA_TYPE,
3502 TI_DA_TYPE,
3503 TI_TA_TYPE,
3504 TI_UHA_TYPE,
3505 TI_USA_TYPE,
3506 TI_UDA_TYPE,
3507 TI_UTA_TYPE,
3508 TI_SAT_HA_TYPE,
3509 TI_SAT_SA_TYPE,
3510 TI_SAT_DA_TYPE,
3511 TI_SAT_TA_TYPE,
3512 TI_SAT_UHA_TYPE,
3513 TI_SAT_USA_TYPE,
3514 TI_SAT_UDA_TYPE,
3515 TI_SAT_UTA_TYPE,
3516
ab442df7
MM		 3517 TI_OPTIMIZATION_DEFAULT,
3518 TI_OPTIMIZATION_CURRENT,
ab442df7
MM		 3519 TI_TARGET_OPTION_DEFAULT,
3520 TI_TARGET_OPTION_CURRENT,
5779e713 3521 TI_CURRENT_TARGET_PRAGMA,
ab442df7
MM		 3522 TI_CURRENT_OPTIMIZE_PRAGMA,
3523
81b3411c
BS		 3524 TI_MAX
3525};
3526
e2500fed 3527extern GTY(()) tree global_trees[TI_MAX];
81b3411c
BS		 3528
3529#define error_mark_node global_trees[TI_ERROR_MARK]
41077ce4 3530
81b3411c
BS		 3531#define intQI_type_node global_trees[TI_INTQI_TYPE]
3532#define intHI_type_node global_trees[TI_INTHI_TYPE]
3533#define intSI_type_node global_trees[TI_INTSI_TYPE]
3534#define intDI_type_node global_trees[TI_INTDI_TYPE]
3535#define intTI_type_node global_trees[TI_INTTI_TYPE]
3536
3537#define unsigned_intQI_type_node global_trees[TI_UINTQI_TYPE]
3538#define unsigned_intHI_type_node global_trees[TI_UINTHI_TYPE]
3539#define unsigned_intSI_type_node global_trees[TI_UINTSI_TYPE]
3540#define unsigned_intDI_type_node global_trees[TI_UINTDI_TYPE]
3541#define unsigned_intTI_type_node global_trees[TI_UINTTI_TYPE]
3542
167fa32c
EC		 3543#define uint32_type_node global_trees[TI_UINT32_TYPE]
3544#define uint64_type_node global_trees[TI_UINT64_TYPE]
3545
81b3411c
BS		 3546#define integer_zero_node global_trees[TI_INTEGER_ZERO]
3547#define integer_one_node global_trees[TI_INTEGER_ONE]
f2d1f0ba 3548#define integer_minus_one_node global_trees[TI_INTEGER_MINUS_ONE]
81b3411c
BS		 3549#define size_zero_node global_trees[TI_SIZE_ZERO]
3550#define size_one_node global_trees[TI_SIZE_ONE]
770ae6cc
RK		 3551#define bitsize_zero_node global_trees[TI_BITSIZE_ZERO]
3552#define bitsize_one_node global_trees[TI_BITSIZE_ONE]
3553#define bitsize_unit_node global_trees[TI_BITSIZE_UNIT]
3554
dbbf88d1 3555/* Base access nodes. */
5a98fa7b
MM		 3556#define access_public_node global_trees[TI_PUBLIC]
3557#define access_protected_node global_trees[TI_PROTECTED]
3558#define access_private_node global_trees[TI_PRIVATE]
dbbf88d1 3559
81b3411c
BS		 3560#define null_pointer_node global_trees[TI_NULL_POINTER]
3561
3562#define float_type_node global_trees[TI_FLOAT_TYPE]
3563#define double_type_node global_trees[TI_DOUBLE_TYPE]
3564#define long_double_type_node global_trees[TI_LONG_DOUBLE_TYPE]
3565
a2a919aa
KG		 3566#define float_ptr_type_node global_trees[TI_FLOAT_PTR_TYPE]
3567#define double_ptr_type_node global_trees[TI_DOUBLE_PTR_TYPE]
3568#define long_double_ptr_type_node global_trees[TI_LONG_DOUBLE_PTR_TYPE]
3569#define integer_ptr_type_node global_trees[TI_INTEGER_PTR_TYPE]
3570
81b3411c
BS		 3571#define complex_integer_type_node global_trees[TI_COMPLEX_INTEGER_TYPE]
3572#define complex_float_type_node global_trees[TI_COMPLEX_FLOAT_TYPE]
3573#define complex_double_type_node global_trees[TI_COMPLEX_DOUBLE_TYPE]
3574#define complex_long_double_type_node global_trees[TI_COMPLEX_LONG_DOUBLE_TYPE]
3575
3576#define void_type_node global_trees[TI_VOID_TYPE]
fc693822 3577/* The C type `void *'. */
81b3411c 3578#define ptr_type_node global_trees[TI_PTR_TYPE]
fc693822 3579/* The C type `const void *'. */
81b3411c 3580#define const_ptr_type_node global_trees[TI_CONST_PTR_TYPE]
c9f8536c
MM		 3581/* The C type `size_t'. */
3582#define size_type_node global_trees[TI_SIZE_TYPE]
d1c38823 3583#define pid_type_node global_trees[TI_PID_TYPE]
81b3411c
BS		 3584#define ptrdiff_type_node global_trees[TI_PTRDIFF_TYPE]
3585#define va_list_type_node global_trees[TI_VA_LIST_TYPE]
9d30f3c1
JJ		 3586#define va_list_gpr_counter_field global_trees[TI_VA_LIST_GPR_COUNTER_FIELD]
3587#define va_list_fpr_counter_field global_trees[TI_VA_LIST_FPR_COUNTER_FIELD]
498c0f27
JJ		 3588/* The C type `FILE *'. */
3589#define fileptr_type_node global_trees[TI_FILEPTR_TYPE]
7145ef21 3590
de7df9eb
JM		 3591#define boolean_type_node global_trees[TI_BOOLEAN_TYPE]
3592#define boolean_false_node global_trees[TI_BOOLEAN_FALSE]
3593#define boolean_true_node global_trees[TI_BOOLEAN_TRUE]
3594
9a8ce21f
JG		 3595/* The decimal floating point types. */
3596#define dfloat32_type_node global_trees[TI_DFLOAT32_TYPE]
3597#define dfloat64_type_node global_trees[TI_DFLOAT64_TYPE]
3598#define dfloat128_type_node global_trees[TI_DFLOAT128_TYPE]
3599#define dfloat32_ptr_type_node global_trees[TI_DFLOAT32_PTR_TYPE]
3600#define dfloat64_ptr_type_node global_trees[TI_DFLOAT64_PTR_TYPE]
3601#define dfloat128_ptr_type_node global_trees[TI_DFLOAT128_PTR_TYPE]
3602
325217ed
CF		 3603/* The fixed-point types. */
3604#define sat_short_fract_type_node global_trees[TI_SAT_SFRACT_TYPE]
3605#define sat_fract_type_node global_trees[TI_SAT_FRACT_TYPE]
3606#define sat_long_fract_type_node global_trees[TI_SAT_LFRACT_TYPE]
3607#define sat_long_long_fract_type_node global_trees[TI_SAT_LLFRACT_TYPE]
3608#define sat_unsigned_short_fract_type_node \
3609 global_trees[TI_SAT_USFRACT_TYPE]
3610#define sat_unsigned_fract_type_node global_trees[TI_SAT_UFRACT_TYPE]
3611#define sat_unsigned_long_fract_type_node \
3612 global_trees[TI_SAT_ULFRACT_TYPE]
3613#define sat_unsigned_long_long_fract_type_node \
3614 global_trees[TI_SAT_ULLFRACT_TYPE]
3615#define short_fract_type_node global_trees[TI_SFRACT_TYPE]
3616#define fract_type_node global_trees[TI_FRACT_TYPE]
3617#define long_fract_type_node global_trees[TI_LFRACT_TYPE]
3618#define long_long_fract_type_node global_trees[TI_LLFRACT_TYPE]
3619#define unsigned_short_fract_type_node global_trees[TI_USFRACT_TYPE]
3620#define unsigned_fract_type_node global_trees[TI_UFRACT_TYPE]
3621#define unsigned_long_fract_type_node global_trees[TI_ULFRACT_TYPE]
3622#define unsigned_long_long_fract_type_node \
3623 global_trees[TI_ULLFRACT_TYPE]
3624#define sat_short_accum_type_node global_trees[TI_SAT_SACCUM_TYPE]
3625#define sat_accum_type_node global_trees[TI_SAT_ACCUM_TYPE]
3626#define sat_long_accum_type_node global_trees[TI_SAT_LACCUM_TYPE]
3627#define sat_long_long_accum_type_node global_trees[TI_SAT_LLACCUM_TYPE]
3628#define sat_unsigned_short_accum_type_node \
3629 global_trees[TI_SAT_USACCUM_TYPE]
3630#define sat_unsigned_accum_type_node global_trees[TI_SAT_UACCUM_TYPE]
3631#define sat_unsigned_long_accum_type_node \
3632 global_trees[TI_SAT_ULACCUM_TYPE]
3633#define sat_unsigned_long_long_accum_type_node \
3634 global_trees[TI_SAT_ULLACCUM_TYPE]
3635#define short_accum_type_node global_trees[TI_SACCUM_TYPE]
3636#define accum_type_node global_trees[TI_ACCUM_TYPE]
3637#define long_accum_type_node global_trees[TI_LACCUM_TYPE]
3638#define long_long_accum_type_node global_trees[TI_LLACCUM_TYPE]
3639#define unsigned_short_accum_type_node global_trees[TI_USACCUM_TYPE]
3640#define unsigned_accum_type_node global_trees[TI_UACCUM_TYPE]
3641#define unsigned_long_accum_type_node global_trees[TI_ULACCUM_TYPE]
3642#define unsigned_long_long_accum_type_node \
3643 global_trees[TI_ULLACCUM_TYPE]
3644#define qq_type_node global_trees[TI_QQ_TYPE]
3645#define hq_type_node global_trees[TI_HQ_TYPE]
3646#define sq_type_node global_trees[TI_SQ_TYPE]
3647#define dq_type_node global_trees[TI_DQ_TYPE]
3648#define tq_type_node global_trees[TI_TQ_TYPE]
3649#define uqq_type_node global_trees[TI_UQQ_TYPE]
3650#define uhq_type_node global_trees[TI_UHQ_TYPE]
3651#define usq_type_node global_trees[TI_USQ_TYPE]
3652#define udq_type_node global_trees[TI_UDQ_TYPE]
3653#define utq_type_node global_trees[TI_UTQ_TYPE]
3654#define sat_qq_type_node global_trees[TI_SAT_QQ_TYPE]
3655#define sat_hq_type_node global_trees[TI_SAT_HQ_TYPE]
3656#define sat_sq_type_node global_trees[TI_SAT_SQ_TYPE]
3657#define sat_dq_type_node global_trees[TI_SAT_DQ_TYPE]
3658#define sat_tq_type_node global_trees[TI_SAT_TQ_TYPE]
3659#define sat_uqq_type_node global_trees[TI_SAT_UQQ_TYPE]
3660#define sat_uhq_type_node global_trees[TI_SAT_UHQ_TYPE]
3661#define sat_usq_type_node global_trees[TI_SAT_USQ_TYPE]
3662#define sat_udq_type_node global_trees[TI_SAT_UDQ_TYPE]
3663#define sat_utq_type_node global_trees[TI_SAT_UTQ_TYPE]
3664#define ha_type_node global_trees[TI_HA_TYPE]
3665#define sa_type_node global_trees[TI_SA_TYPE]
3666#define da_type_node global_trees[TI_DA_TYPE]
3667#define ta_type_node global_trees[TI_TA_TYPE]
3668#define uha_type_node global_trees[TI_UHA_TYPE]
3669#define usa_type_node global_trees[TI_USA_TYPE]
3670#define uda_type_node global_trees[TI_UDA_TYPE]
3671#define uta_type_node global_trees[TI_UTA_TYPE]
3672#define sat_ha_type_node global_trees[TI_SAT_HA_TYPE]
3673#define sat_sa_type_node global_trees[TI_SAT_SA_TYPE]
3674#define sat_da_type_node global_trees[TI_SAT_DA_TYPE]
3675#define sat_ta_type_node global_trees[TI_SAT_TA_TYPE]
3676#define sat_uha_type_node global_trees[TI_SAT_UHA_TYPE]
3677#define sat_usa_type_node global_trees[TI_SAT_USA_TYPE]
3678#define sat_uda_type_node global_trees[TI_SAT_UDA_TYPE]
3679#define sat_uta_type_node global_trees[TI_SAT_UTA_TYPE]
3680
cbd5937a
MM		 3681/* The node that should be placed at the end of a parameter list to
3682 indicate that the function does not take a variable number of
3683 arguments. The TREE_VALUE will be void_type_node and there will be
3684 no TREE_CHAIN. Language-independent code should not assume
3685 anything else about this node. */
3686#define void_list_node global_trees[TI_VOID_LIST_NODE]
3687
5b47282c
GM		 3688#define main_identifier_node global_trees[TI_MAIN_IDENTIFIER]
3689#define MAIN_NAME_P(NODE) (IDENTIFIER_NODE_CHECK (NODE) == main_identifier_node)
3690
5779e713
MM		 3691/* Optimization options (OPTIMIZATION_NODE) to use for default and current
3692 functions. */
ab442df7
MM		 3693#define optimization_default_node global_trees[TI_OPTIMIZATION_DEFAULT]
3694#define optimization_current_node global_trees[TI_OPTIMIZATION_CURRENT]
ab442df7
MM		 3695
3696/* Default/current target options (TARGET_OPTION_NODE). */
3697#define target_option_default_node global_trees[TI_TARGET_OPTION_DEFAULT]
3698#define target_option_current_node global_trees[TI_TARGET_OPTION_CURRENT]
3699
3700/* Default tree list option(), optimize() pragmas to be linked into the
3701 attribute list. */
5779e713 3702#define current_target_pragma global_trees[TI_CURRENT_TARGET_PRAGMA]
ab442df7
MM		 3703#define current_optimize_pragma global_trees[TI_CURRENT_OPTIMIZE_PRAGMA]
3704
7145ef21 3705/* An enumeration of the standard C integer types. These must be
ceeedfc1
NB		 3706 ordered so that shorter types appear before longer ones, and so
3707 that signed types appear before unsigned ones, for the correct
3708 functioning of interpret_integer() in c-lex.c. */
41077ce4 3709enum integer_type_kind
7145ef21
MM		 3710{
3711 itk_char,
3712 itk_signed_char,
3713 itk_unsigned_char,
3714 itk_short,
3715 itk_unsigned_short,
3716 itk_int,
3717 itk_unsigned_int,
3718 itk_long,
3719 itk_unsigned_long,
3720 itk_long_long,
3721 itk_unsigned_long_long,
3722 itk_none
3723};
3724
3725typedef enum integer_type_kind integer_type_kind;
3726
3727/* The standard C integer types. Use integer_type_kind to index into
3728 this array. */
e2500fed 3729extern GTY(()) tree integer_types[itk_none];
7145ef21
MM		 3730
3731#define char_type_node integer_types[itk_char]
3732#define signed_char_type_node integer_types[itk_signed_char]
3733#define unsigned_char_type_node integer_types[itk_unsigned_char]
3734#define short_integer_type_node integer_types[itk_short]
3735#define short_unsigned_type_node integer_types[itk_unsigned_short]
3736#define integer_type_node integer_types[itk_int]
3737#define unsigned_type_node integer_types[itk_unsigned_int]
3738#define long_integer_type_node integer_types[itk_long]
3739#define long_unsigned_type_node integer_types[itk_unsigned_long]
3740#define long_long_integer_type_node integer_types[itk_long_long]
3741#define long_long_unsigned_type_node integer_types[itk_unsigned_long_long]
dce81a1a
JJ		 3742\f
3743/* Set to the default thread-local storage (tls) model to use. */
3744
dce81a1a 3745extern enum tls_model flag_tls_default;
25fdb4dc 3746
81b3411c 3747\f
f963b5d9
RS		 3748/* A pointer-to-function member type looks like:
3749
3750 struct {
3751 __P __pfn;
3752 ptrdiff_t __delta;
3753 };
3754
3755 If __pfn is NULL, it is a NULL pointer-to-member-function.
3756
3757 (Because the vtable is always the first thing in the object, we
3758 don't need its offset.) If the function is virtual, then PFN is
3759 one plus twice the index into the vtable; otherwise, it is just a
3760 pointer to the function.
3761
3762 Unfortunately, using the lowest bit of PFN doesn't work in
3763 architectures that don't impose alignment requirements on function
3764 addresses, or that use the lowest bit to tell one ISA from another,
3765 for example. For such architectures, we use the lowest bit of
3766 DELTA instead of the lowest bit of the PFN, and DELTA will be
3767 multiplied by 2. */
3768
3769enum ptrmemfunc_vbit_where_t
3770{
3771 ptrmemfunc_vbit_in_pfn,
3772 ptrmemfunc_vbit_in_delta
3773};
3774\f
f837a861
MM		 3775#define NULL_TREE (tree) NULL
3776
46c5ad27 3777extern tree decl_assembler_name (tree);
266ad5c8
JH		 3778extern bool decl_assembler_name_equal (tree decl, const_tree asmname);
3779extern hashval_t decl_assembler_name_hash (const_tree asmname);
8da1b058 3780
c5620996
GK		 3781/* Compute the number of bytes occupied by 'node'. This routine only
3782 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
3783
9566a759 3784extern size_t tree_size (const_tree);
c5620996 3785
a38b644b 3786/* Compute the number of bytes occupied by a tree with code CODE. This
726a989a
RB		 3787 function cannot be used for TREE_VEC codes, which are of variable
3788 length. */
a38b644b
ZW		 3789extern size_t tree_code_size (enum tree_code);
3790
8da1b058
RS		 3791/* Lowest level primitive for allocating a node.
3792 The TREE_CODE is the only argument. Contents are initialized
3793 to zero except for a few of the common fields. */
3794
b9dcdee4
JH		 3795extern tree make_node_stat (enum tree_code MEM_STAT_DECL);
3796#define make_node(t) make_node_stat (t MEM_STAT_INFO)
8da1b058 3797
1b70d38a 3798/* Make a copy of a node, with all the same contents. */
8da1b058 3799
b9dcdee4
JH		 3800extern tree copy_node_stat (tree MEM_STAT_DECL);
3801#define copy_node(t) copy_node_stat (t MEM_STAT_INFO)
8da1b058
RS		 3802
3803/* Make a copy of a chain of TREE_LIST nodes. */
3804
46c5ad27 3805extern tree copy_list (tree);
8da1b058 3806
95b4aca6
NS		 3807/* Make a BINFO. */
3808extern tree make_tree_binfo_stat (unsigned MEM_STAT_DECL);
3809#define make_tree_binfo(t) make_tree_binfo_stat (t MEM_STAT_INFO)
3810
8da1b058
RS		 3811/* Make a TREE_VEC. */
3812
b9dcdee4
JH		 3813extern tree make_tree_vec_stat (int MEM_STAT_DECL);
3814#define make_tree_vec(t) make_tree_vec_stat (t MEM_STAT_INFO)
8da1b058
RS		 3815
3816/* Return the (unique) IDENTIFIER_NODE node for a given name.
3817 The name is supplied as a char *. */
3818
46c5ad27 3819extern tree get_identifier (const char *);
8da1b058 3820
7bb3fbbb
RS		 3821#if GCC_VERSION >= 3000
3822#define get_identifier(str) \
3823 (__builtin_constant_p (str) \
3824 ? get_identifier_with_length ((str), strlen (str)) \
3825 : get_identifier (str))
3826#endif
3827
3828
4bad9e39
APB		 3829/* Identical to get_identifier, except that the length is assumed
3830 known. */
3831
7bb3fbbb 3832extern tree get_identifier_with_length (const char *, size_t);
4bad9e39 3833
6b9300aa
RK		 3834/* If an identifier with the name TEXT (a null-terminated string) has
3835 previously been referred to, return that node; otherwise return
3836 NULL_TREE. */
3837
46c5ad27 3838extern tree maybe_get_identifier (const char *);
6b9300aa 3839
8da1b058
RS		 3840/* Construct various types of nodes. */
3841
46c5ad27 3842extern tree build_nt (enum tree_code, ...);
5039610b 3843extern tree build_nt_call_list (tree, tree);
46c5ad27 3844
b9dcdee4
JH		 3845extern tree build0_stat (enum tree_code, tree MEM_STAT_DECL);
3846#define build0(c,t) build0_stat (c,t MEM_STAT_INFO)
3847extern tree build1_stat (enum tree_code, tree, tree MEM_STAT_DECL);
3848#define build1(c,t1,t2) build1_stat (c,t1,t2 MEM_STAT_INFO)
3849extern tree build2_stat (enum tree_code, tree, tree, tree MEM_STAT_DECL);
3850#define build2(c,t1,t2,t3) build2_stat (c,t1,t2,t3 MEM_STAT_INFO)
3851extern tree build3_stat (enum tree_code, tree, tree, tree, tree MEM_STAT_DECL);
3852#define build3(c,t1,t2,t3,t4) build3_stat (c,t1,t2,t3,t4 MEM_STAT_INFO)
3853extern tree build4_stat (enum tree_code, tree, tree, tree, tree,
3854 tree MEM_STAT_DECL);
3855#define build4(c,t1,t2,t3,t4,t5) build4_stat (c,t1,t2,t3,t4,t5 MEM_STAT_INFO)
953ff289
DN		 3856extern tree build5_stat (enum tree_code, tree, tree, tree, tree, tree,
3857 tree MEM_STAT_DECL);
3858#define build5(c,t1,t2,t3,t4,t5,t6) build5_stat (c,t1,t2,t3,t4,t5,t6 MEM_STAT_INFO)
5006671f
RG		 3859extern tree build6_stat (enum tree_code, tree, tree, tree, tree, tree,
3860 tree, tree MEM_STAT_DECL);
3861#define build6(c,t1,t2,t3,t4,t5,t6,t7) \
3862 build6_stat (c,t1,t2,t3,t4,t5,t6,t7 MEM_STAT_INFO)
4221057e 3863
7d60be94 3864extern tree build_int_cst (tree, HOST_WIDE_INT);
8b11a64c 3865extern tree build_int_cst_type (tree, HOST_WIDE_INT);
7d60be94
NS		 3866extern tree build_int_cstu (tree, unsigned HOST_WIDE_INT);
3867extern tree build_int_cst_wide (tree, unsigned HOST_WIDE_INT, HOST_WIDE_INT);
2ac7cbb5
RG		 3868extern tree build_int_cst_wide_type (tree,
3869 unsigned HOST_WIDE_INT, HOST_WIDE_INT);
46c5ad27 3870extern tree build_vector (tree, tree);
4038c495
GB		 3871extern tree build_vector_from_ctor (tree, VEC(constructor_elt,gc) *);
3872extern tree build_constructor (tree, VEC(constructor_elt,gc) *);
3873extern tree build_constructor_single (tree, tree, tree);
3874extern tree build_constructor_from_list (tree, tree);
9566a759 3875extern tree build_real_from_int_cst (tree, const_tree);
46c5ad27 3876extern tree build_complex (tree, tree, tree);
bfabddb6 3877extern tree build_one_cst (tree);
46c5ad27 3878extern tree build_string (int, const char *);
b9dcdee4
JH		 3879extern tree build_tree_list_stat (tree, tree MEM_STAT_DECL);
3880#define build_tree_list(t,q) build_tree_list_stat(t,q MEM_STAT_INFO)
3881extern tree build_decl_stat (enum tree_code, tree, tree MEM_STAT_DECL);
0ac11108 3882extern tree build_fn_decl (const char *, tree);
b9dcdee4 3883#define build_decl(c,t,q) build_decl_stat (c,t,q MEM_STAT_INFO)
22e8617b 3884extern tree build_block (tree, tree, tree, tree);
6de9cd9a 3885extern tree build_empty_stmt (void);
aaf46ef9 3886extern tree build_omp_clause (enum omp_clause_code);
8da1b058 3887
5039610b
SL		 3888extern tree build_vl_exp_stat (enum tree_code, int MEM_STAT_DECL);
3889#define build_vl_exp(c,n) build_vl_exp_stat (c,n MEM_STAT_INFO)
3890
3891extern tree build_call_list (tree, tree, tree);
3892extern tree build_call_nary (tree, tree, int, ...);
3893extern tree build_call_valist (tree, tree, int, va_list);
3894extern tree build_call_array (tree, tree, int, tree*);
3895
8da1b058
RS		 3896/* Construct various nodes representing data types. */
3897
46c5ad27
AJ		 3898extern tree make_signed_type (int);
3899extern tree make_unsigned_type (int);
12753674 3900extern tree signed_or_unsigned_type_for (int, tree);
2f4675b4 3901extern tree signed_type_for (tree);
8b11a64c 3902extern tree unsigned_type_for (tree);
8c1d6d62 3903extern void initialize_sizetypes (bool);
46c5ad27
AJ		 3904extern void set_sizetype (tree);
3905extern void fixup_unsigned_type (tree);
22421b79 3906extern tree build_pointer_type_for_mode (tree, enum machine_mode, bool);
46c5ad27 3907extern tree build_pointer_type (tree);
22421b79 3908extern tree build_reference_type_for_mode (tree, enum machine_mode, bool);
46c5ad27 3909extern tree build_reference_type (tree);
4a5eab38
PB		 3910extern tree build_vector_type_for_mode (tree, enum machine_mode);
3911extern tree build_vector_type (tree innertype, int nunits);
b6fc2cdb 3912extern tree build_opaque_vector_type (tree innertype, int nunits);
46c5ad27
AJ		 3913extern tree build_type_no_quals (tree);
3914extern tree build_index_type (tree);
3915extern tree build_index_2_type (tree, tree);
3916extern tree build_array_type (tree, tree);
3917extern tree build_function_type (tree, tree);
3918extern tree build_function_type_list (tree, ...);
c6f7cfc1
JH		 3919extern tree build_function_type_skip_args (tree, bitmap);
3920extern tree build_function_decl_skip_args (tree, bitmap);
ff1c393b 3921extern tree build_varargs_function_type_list (tree, ...);
43dc123f 3922extern tree build_method_type_directly (tree, tree, tree);
46c5ad27
AJ		 3923extern tree build_method_type (tree, tree);
3924extern tree build_offset_type (tree, tree);
3925extern tree build_complex_type (tree);
b4660e5a 3926extern tree build_resx (int);
9566a759 3927extern tree array_type_nelts (const_tree);
a7e5372d 3928extern bool in_array_bounds_p (tree);
11fc4275 3929extern bool range_in_array_bounds_p (tree);
46c5ad27
AJ		 3930
3931extern tree value_member (tree, tree);
9566a759 3932extern tree purpose_member (const_tree, tree);
fd917e0d 3933
9678086d
KG		 3934extern int attribute_list_equal (const_tree, const_tree);
3935extern int attribute_list_contained (const_tree, const_tree);
9566a759
KG		 3936extern int tree_int_cst_equal (const_tree, const_tree);
3937extern int tree_int_cst_lt (const_tree, const_tree);
3938extern int tree_int_cst_compare (const_tree, const_tree);
3939extern int host_integerp (const_tree, int);
3940extern HOST_WIDE_INT tree_low_cst (const_tree, int);
3941extern int tree_int_cst_msb (const_tree);
3942extern int tree_int_cst_sgn (const_tree);
fa233e34 3943extern int tree_int_cst_sign_bit (const_tree);
cdd6a337 3944extern unsigned int tree_int_cst_min_precision (tree, bool);
682d0395 3945extern bool tree_expr_nonnegative_p (tree);
6ac01510 3946extern bool tree_expr_nonnegative_warnv_p (tree, bool *);
fa233e34 3947extern bool may_negate_without_overflow_p (const_tree);
dd25a747 3948extern tree strip_array_types (tree);
8ce94e44 3949extern tree excess_precision_type (tree);
12cfc830 3950
325217ed
CF		 3951/* Construct various nodes representing fract or accum data types. */
3952
3953extern tree make_fract_type (int, int, int);
3954extern tree make_accum_type (int, int, int);
3955
3956#define make_signed_fract_type(P) make_fract_type (P, 0, 0)
3957#define make_unsigned_fract_type(P) make_fract_type (P, 1, 0)
3958#define make_sat_signed_fract_type(P) make_fract_type (P, 0, 1)
3959#define make_sat_unsigned_fract_type(P) make_fract_type (P, 1, 1)
3960#define make_signed_accum_type(P) make_accum_type (P, 0, 0)
3961#define make_unsigned_accum_type(P) make_accum_type (P, 1, 0)
3962#define make_sat_signed_accum_type(P) make_accum_type (P, 0, 1)
3963#define make_sat_unsigned_accum_type(P) make_accum_type (P, 1, 1)
3964
3965#define make_or_reuse_signed_fract_type(P) \
3966 make_or_reuse_fract_type (P, 0, 0)
3967#define make_or_reuse_unsigned_fract_type(P) \
3968 make_or_reuse_fract_type (P, 1, 0)
3969#define make_or_reuse_sat_signed_fract_type(P) \
3970 make_or_reuse_fract_type (P, 0, 1)
3971#define make_or_reuse_sat_unsigned_fract_type(P) \
3972 make_or_reuse_fract_type (P, 1, 1)
3973#define make_or_reuse_signed_accum_type(P) \
3974 make_or_reuse_accum_type (P, 0, 0)
3975#define make_or_reuse_unsigned_accum_type(P) \
3976 make_or_reuse_accum_type (P, 1, 0)
3977#define make_or_reuse_sat_signed_accum_type(P) \
3978 make_or_reuse_accum_type (P, 0, 1)
3979#define make_or_reuse_sat_unsigned_accum_type(P) \
3980 make_or_reuse_accum_type (P, 1, 1)
3981
f837a861
MM		 3982/* From expmed.c. Since rtl.h is included after tree.h, we can't
3983 put the prototype here. Rtl.h does declare the prototype if
3984 tree.h had been included. */
3985
46c5ad27 3986extern tree make_tree (tree, rtx);
8da1b058 3987\f
bad1b4ba
RK		 3988/* Return a type like TTYPE except that its TYPE_ATTRIBUTES
3989 is ATTRIBUTE.
3990
3991 Such modified types already made are recorded so that duplicates
2ba84f36 3992 are not made. */
bad1b4ba 3993
46c5ad27
AJ		 3994extern tree build_type_attribute_variant (tree, tree);
3995extern tree build_decl_attribute_variant (tree, tree);
bad1b4ba 3996
91d231cb
JM		 3997/* Structure describing an attribute and a function to handle it. */
3998struct attribute_spec
3999{
4000 /* The name of the attribute (without any leading or trailing __),
4001 or NULL to mark the end of a table of attributes. */
8b60264b 4002 const char *const name;
91d231cb 4003 /* The minimum length of the list of arguments of the attribute. */
8b60264b 4004 const int min_length;
91d231cb
JM		 4005 /* The maximum length of the list of arguments of the attribute
4006 (-1 for no maximum). */
8b60264b 4007 const int max_length;
91d231cb
JM		 4008 /* Whether this attribute requires a DECL. If it does, it will be passed
4009 from types of DECLs, function return types and array element types to
4010 the DECLs, function types and array types respectively; but when
4011 applied to a type in any other circumstances, it will be ignored with
4012 a warning. (If greater control is desired for a given attribute,
4013 this should be false, and the flags argument to the handler may be
4014 used to gain greater control in that case.) */
8b60264b 4015 const bool decl_required;
91d231cb
JM		 4016 /* Whether this attribute requires a type. If it does, it will be passed
4017 from a DECL to the type of that DECL. */
8b60264b 4018 const bool type_required;
91d231cb
JM		 4019 /* Whether this attribute requires a function (or method) type. If it does,
4020 it will be passed from a function pointer type to the target type,
4021 and from a function return type (which is not itself a function
4022 pointer type) to the function type. */
8b60264b 4023 const bool function_type_required;
91d231cb
JM		 4024 /* Function to handle this attribute. NODE points to the node to which
4025 the attribute is to be applied. If a DECL, it should be modified in
4026 place; if a TYPE, a copy should be created. NAME is the name of the
4027 attribute (possibly with leading or trailing __). ARGS is the TREE_LIST
4028 of the arguments (which may be NULL). FLAGS gives further information
4029 about the context of the attribute. Afterwards, the attributes will
4030 be added to the DECL_ATTRIBUTES or TYPE_ATTRIBUTES, as appropriate,
4031 unless *NO_ADD_ATTRS is set to true (which should be done on error,
4032 as well as in any other cases when the attributes should not be added
4033 to the DECL or TYPE). Depending on FLAGS, any attributes to be
4034 applied to another type or DECL later may be returned;
4035 otherwise the return value should be NULL_TREE. This pointer may be
4036 NULL if no special handling is required beyond the checks implied
4037 by the rest of this structure. */
46c5ad27
AJ		 4038 tree (*const handler) (tree *node, tree name, tree args,
4039 int flags, bool *no_add_attrs);
91d231cb
JM		 4040};
4041
91d231cb
JM		 4042/* Flags that may be passed in the third argument of decl_attributes, and
4043 to handler functions for attributes. */
4044enum attribute_flags
4045{
4046 /* The type passed in is the type of a DECL, and any attributes that
4047 should be passed in again to be applied to the DECL rather than the
4048 type should be returned. */
4049 ATTR_FLAG_DECL_NEXT = 1,
4050 /* The type passed in is a function return type, and any attributes that
4051 should be passed in again to be applied to the function type rather
4052 than the return type should be returned. */
4053 ATTR_FLAG_FUNCTION_NEXT = 2,
4054 /* The type passed in is an array element type, and any attributes that
4055 should be passed in again to be applied to the array type rather
4056 than the element type should be returned. */
4057 ATTR_FLAG_ARRAY_NEXT = 4,
4058 /* The type passed in is a structure, union or enumeration type being
4059 created, and should be modified in place. */
6431177a
JM		 4060 ATTR_FLAG_TYPE_IN_PLACE = 8,
4061 /* The attributes are being applied by default to a library function whose
4062 name indicates known behavior, and should be silently ignored if they
4063 are not in fact compatible with the function type. */
4064 ATTR_FLAG_BUILT_IN = 16
91d231cb
JM		 4065};
4066
501990bb
NB		 4067/* Default versions of target-overridable functions. */
4068
46c5ad27
AJ		 4069extern tree merge_decl_attributes (tree, tree);
4070extern tree merge_type_attributes (tree, tree);
d9525bec 4071
0e9e1e0a 4072/* Given a tree node and a string, return nonzero if the tree node is
9c130398
DE		 4073 a valid attribute name for the string. */
4074
9566a759 4075extern int is_attribute_p (const char *, const_tree);
9c130398
DE		 4076
4077/* Given an attribute name and a list of attributes, return the list element
4078 of the attribute or NULL_TREE if not found. */
4079
46c5ad27 4080extern tree lookup_attribute (const char *, tree);
6cb3d314 4081
b70f0f48
JM		 4082/* Remove any instances of attribute ATTR_NAME in LIST and return the
4083 modified list. */
4084
4085extern tree remove_attribute (const char *, tree);
4086
6cb3d314
DE		 4087/* Given two attributes lists, return a list of their union. */
4088
46c5ad27 4089extern tree merge_attributes (tree, tree);
9c130398 4090
b2ca3702 4091#if TARGET_DLLIMPORT_DECL_ATTRIBUTES
672a6f42
NB		 4092/* Given two Windows decl attributes lists, possibly including
4093 dllimport, return a list of their union . */
46c5ad27 4094extern tree merge_dllimport_decl_attributes (tree, tree);
b2ca3702
MM		 4095
4096/* Handle a "dllimport" or "dllexport" attribute. */
4097extern tree handle_dll_attribute (tree *, tree, tree, int, bool *);
672a6f42
NB		 4098#endif
4099
896c3aa3
JM		 4100/* Check whether CAND is suitable to be returned from get_qualified_type
4101 (BASE, TYPE_QUALS). */
4102
9566a759 4103extern bool check_qualified_type (const_tree, const_tree, int);
896c3aa3 4104
5101b304
MM		 4105/* Return a version of the TYPE, qualified as indicated by the
4106 TYPE_QUALS, if one exists. If no qualified version exists yet,
4107 return NULL_TREE. */
4108
46c5ad27 4109extern tree get_qualified_type (tree, int);
5101b304
MM		 4110
4111/* Like get_qualified_type, but creates the type if it does not
4112 exist. This function never returns NULL_TREE. */
3932261a 4113
46c5ad27 4114extern tree build_qualified_type (tree, int);
3932261a
MM		 4115
4116/* Like build_qualified_type, but only deals with the `const' and
4117 `volatile' qualifiers. This interface is retained for backwards
14b493d6 4118 compatibility with the various front-ends; new code should use
3932261a 4119 build_qualified_type instead. */
8da1b058 4120
3932261a 4121#define build_type_variant(TYPE, CONST_P, VOLATILE_P) \
b9daac31 4122 build_qualified_type ((TYPE), \
3932261a
MM		 4123 ((CONST_P) ? TYPE_QUAL_CONST : 0) \
4124 | ((VOLATILE_P) ? TYPE_QUAL_VOLATILE : 0))
8da1b058 4125
43100b14
RS		 4126/* Make a copy of a type node. */
4127
8dd16ecc
NS		 4128extern tree build_distinct_type_copy (tree);
4129extern tree build_variant_type_copy (tree);
43100b14 4130
4977bab6 4131/* Finish up a builtin RECORD_TYPE. Give it a name and provide its
86df8c86 4132 fields. Optionally specify an alignment, and then lay it out. */
4977bab6 4133
46c5ad27
AJ		 4134extern void finish_builtin_struct (tree, const char *,
4135 tree, tree);
4977bab6 4136
8da1b058 4137/* Given a ..._TYPE node, calculate the TYPE_SIZE, TYPE_SIZE_UNIT,
9328904c
MM		 4138 TYPE_ALIGN and TYPE_MODE fields. If called more than once on one
4139 node, does nothing except for the first time. */
8da1b058 4140
46c5ad27 4141extern void layout_type (tree);
8da1b058 4142
9328904c
MM		 4143/* These functions allow a front-end to perform a manual layout of a
4144 RECORD_TYPE. (For instance, if the placement of subsequent fields
4145 depends on the placement of fields so far.) Begin by calling
770ae6cc 4146 start_record_layout. Then, call place_field for each of the
9328904c
MM		 4147 fields. Then, call finish_record_layout. See layout_type for the
4148 default way in which these functions are used. */
4149
defd0dea 4150typedef struct record_layout_info_s
9328904c
MM		 4151{
4152 /* The RECORD_TYPE that we are laying out. */
4153 tree t;
770ae6cc
RK		 4154 /* The offset into the record so far, in bytes, not including bits in
4155 BITPOS. */
4156 tree offset;
4157 /* The last known alignment of SIZE. */
4158 unsigned int offset_align;
4159 /* The bit position within the last OFFSET_ALIGN bits, in bits. */
4160 tree bitpos;
9328904c
MM		 4161 /* The alignment of the record so far, in bits. */
4162 unsigned int record_align;
78d55cc8
JM		 4163 /* The alignment of the record so far, ignoring #pragma pack and
4164 __attribute__ ((packed)), in bits. */
770ae6cc 4165 unsigned int unpacked_align;
f913c102
AO		 4166 /* The previous field layed out. */
4167 tree prev_field;
9328904c
MM		 4168 /* The static variables (i.e., class variables, as opposed to
4169 instance variables) encountered in T. */
4170 tree pending_statics;
e4850f36
DR		 4171 /* Bits remaining in the current alignment group */
4172 int remaining_in_alignment;
78d55cc8
JM		 4173 /* True if we've seen a packed field that didn't have normal
4174 alignment anyway. */
9328904c 4175 int packed_maybe_necessary;
770ae6cc 4176} *record_layout_info;
9328904c 4177
46c5ad27
AJ		 4178extern record_layout_info start_record_layout (tree);
4179extern tree bit_from_pos (tree, tree);
4180extern tree byte_from_pos (tree, tree);
4181extern void pos_from_bit (tree *, tree *, unsigned int, tree);
4182extern void normalize_offset (tree *, tree *, unsigned int);
4183extern tree rli_size_unit_so_far (record_layout_info);
4184extern tree rli_size_so_far (record_layout_info);
4185extern void normalize_rli (record_layout_info);
4186extern void place_field (record_layout_info, tree);
4187extern void compute_record_mode (tree);
4188extern void finish_record_layout (record_layout_info, int);
9328904c 4189
8da1b058
RS		 4190/* Given a hashcode and a ..._TYPE node (for which the hashcode was made),
4191 return a canonicalized ..._TYPE node, so that duplicates are not made.
4192 How the hash code is computed is up to the caller, as long as any two
4193 callers that could hash identical-looking type nodes agree. */
4194
46c5ad27 4195extern tree type_hash_canon (unsigned int, tree);
8da1b058
RS		 4196
4197/* Given a VAR_DECL, PARM_DECL, RESULT_DECL or FIELD_DECL node,
4198 calculates the DECL_SIZE, DECL_SIZE_UNIT, DECL_ALIGN and DECL_MODE
4199 fields. Call this only once for any given decl node.
4200
4201 Second argument is the boundary that this field can be assumed to
4202 be starting at (in bits). Zero means it can be assumed aligned
4203 on any boundary that may be needed. */
4204
46c5ad27 4205extern void layout_decl (tree, unsigned);
8da1b058 4206
d8472c75
JM		 4207/* Given a VAR_DECL, PARM_DECL or RESULT_DECL, clears the results of
4208 a previous call to layout_decl and calls it again. */
4209
4210extern void relayout_decl (tree);
4211
72c602fc
RK		 4212/* Return the mode for data of a given size SIZE and mode class CLASS.
4213 If LIMIT is nonzero, then don't use modes bigger than MAX_FIXED_MODE_SIZE.
4214 The value is BLKmode if no other mode is found. This is like
4215 mode_for_size, but is passed a tree. */
4216
fa233e34 4217extern enum machine_mode mode_for_size_tree (const_tree, enum mode_class, int);
72c602fc 4218
8da1b058
RS		 4219/* Return an expr equal to X but certainly not valid as an lvalue. */
4220
46c5ad27 4221extern tree non_lvalue (tree);
46c5ad27
AJ		 4222
4223extern tree convert (tree, tree);
9566a759 4224extern unsigned int expr_align (const_tree);
46c5ad27
AJ		 4225extern tree expr_first (tree);
4226extern tree expr_last (tree);
ac7d7749 4227extern tree size_in_bytes (const_tree);
9566a759 4228extern HOST_WIDE_INT int_size_in_bytes (const_tree);
ac7d7749 4229extern HOST_WIDE_INT max_int_size_in_bytes (const_tree);
9566a759
KG		 4230extern tree bit_position (const_tree);
4231extern HOST_WIDE_INT int_bit_position (const_tree);
4232extern tree byte_position (const_tree);
4233extern HOST_WIDE_INT int_byte_position (const_tree);
fed3cef0
RK		 4234
4235/* Define data structures, macros, and functions for handling sizes
4236 and the various types used to represent sizes. */
4237
4238enum size_type_kind
4239{
2ba84f36
KH		 4240 SIZETYPE, /* Normal representation of sizes in bytes. */
4241 SSIZETYPE, /* Signed representation of sizes in bytes. */
fed3cef0
RK		 4242 BITSIZETYPE, /* Normal representation of sizes in bits. */
4243 SBITSIZETYPE, /* Signed representation of sizes in bits. */
fed3cef0
RK		 4244 TYPE_KIND_LAST};
4245
e2500fed 4246extern GTY(()) tree sizetype_tab[(int) TYPE_KIND_LAST];
fed3cef0
RK		 4247
4248#define sizetype sizetype_tab[(int) SIZETYPE]
4249#define bitsizetype sizetype_tab[(int) BITSIZETYPE]
4250#define ssizetype sizetype_tab[(int) SSIZETYPE]
fed3cef0 4251#define sbitsizetype sizetype_tab[(int) SBITSIZETYPE]
fed3cef0 4252
ce552f75 4253extern tree size_int_kind (HOST_WIDE_INT, enum size_type_kind);
46c5ad27
AJ		 4254extern tree size_binop (enum tree_code, tree, tree);
4255extern tree size_diffop (tree, tree);
3e95a7cb
ZW		 4256
4257#define size_int(L) size_int_kind (L, SIZETYPE)
4258#define ssize_int(L) size_int_kind (L, SSIZETYPE)
4259#define bitsize_int(L) size_int_kind (L, BITSIZETYPE)
4260#define sbitsize_int(L) size_int_kind (L, SBITSIZETYPE)
f8dac6eb 4261
46c5ad27
AJ		 4262extern tree round_up (tree, int);
4263extern tree round_down (tree, int);
4264extern tree get_pending_sizes (void);
46c5ad27
AJ		 4265extern void put_pending_size (tree);
4266extern void put_pending_sizes (tree);
8da1b058
RS		 4267
4268/* Type for sizes of data-type. */
4269
f8dac6eb
R		 4270#define BITS_PER_UNIT_LOG \
4271 ((BITS_PER_UNIT > 1) + (BITS_PER_UNIT > 2) + (BITS_PER_UNIT > 4) \
4272 + (BITS_PER_UNIT > 8) + (BITS_PER_UNIT > 16) + (BITS_PER_UNIT > 32) \
4273 + (BITS_PER_UNIT > 64) + (BITS_PER_UNIT > 128) + (BITS_PER_UNIT > 256))
4274
467cecf3 4275/* If nonzero, an upper limit on alignment of structure fields, in bits, */
729a2125 4276extern unsigned int maximum_field_alignment;
8c27b7d4 4277/* and its original value in bytes, specified via -fpack-struct=<value>. */
467cecf3 4278extern unsigned int initial_max_fld_align;
8294accf 4279
8da1b058
RS		 4280/* Concatenate two lists (chains of TREE_LIST nodes) X and Y
4281 by making the last node in X point to Y.
4282 Returns X, except if X is 0 returns Y. */
4283
46c5ad27 4284extern tree chainon (tree, tree);
8da1b058
RS		 4285
4286/* Make a new TREE_LIST node from specified PURPOSE, VALUE and CHAIN. */
4287
b9dcdee4
JH		 4288extern tree tree_cons_stat (tree, tree, tree MEM_STAT_DECL);
4289#define tree_cons(t,q,w) tree_cons_stat (t,q,w MEM_STAT_INFO)
8da1b058
RS		 4290
4291/* Return the last tree node in a chain. */
4292
46c5ad27 4293extern tree tree_last (tree);
8da1b058 4294
f4d9f129
SE		 4295/* Return the node in a chain whose TREE_VALUE is x, NULL if not found. */
4296
4297extern tree tree_find_value (tree, tree);
4298
8da1b058
RS		 4299/* Reverse the order of elements in a chain, and return the new head. */
4300
46c5ad27 4301extern tree nreverse (tree);
8da1b058
RS		 4302
4303/* Returns the length of a chain of nodes
4304 (number of chain pointers to follow before reaching a null pointer). */
4305
9566a759 4306extern int list_length (const_tree);
8da1b058 4307
c3b247b4
JM		 4308/* Returns the number of FIELD_DECLs in a type. */
4309
9566a759 4310extern int fields_length (const_tree);
c3b247b4 4311
27b41650
KG		 4312/* Given an initializer INIT, return TRUE if INIT is zero or some
4313 aggregate of zeros. Otherwise return FALSE. */
4314
9566a759 4315extern bool initializer_zerop (const_tree);
27b41650 4316
09357846
JM		 4317/* Given a CONSTRUCTOR CTOR, return the elements as a TREE_LIST. */
4318
4319extern tree ctor_to_list (tree);
4320
fe24d485
OH		 4321/* Examine CTOR to discover:
4322 * how many scalar fields are set to nonzero values,
4323 and place it in *P_NZ_ELTS;
4324 * how many scalar fields in total are in CTOR,
4325 and place it in *P_ELT_COUNT.
4326 * if a type is a union, and the initializer from the constructor
4327 is not the largest element in the union, then set *p_must_clear.
4328
4329 Return whether or not CTOR is a valid static constant initializer, the same
4330 as "initializer_constant_valid_p (CTOR, TREE_TYPE (CTOR)) != 0". */
4331
fa233e34 4332extern bool categorize_ctor_elements (const_tree, HOST_WIDE_INT *, HOST_WIDE_INT *,
fe24d485
OH		 4333 bool *);
4334
fa233e34 4335extern HOST_WIDE_INT count_type_elements (const_tree, bool);
40209195 4336
ea4b7848 4337/* integer_zerop (tree x) is nonzero if X is an integer constant of value 0. */
8da1b058 4338
9566a759 4339extern int integer_zerop (const_tree);
8da1b058 4340
ea4b7848 4341/* integer_onep (tree x) is nonzero if X is an integer constant of value 1. */
8da1b058 4342
9566a759 4343extern int integer_onep (const_tree);
8da1b058
RS		 4344
4345/* integer_all_onesp (tree x) is nonzero if X is an integer constant
4346 all of whose significant bits are 1. */
4347
9566a759 4348extern int integer_all_onesp (const_tree);
8da1b058
RS		 4349
4350/* integer_pow2p (tree x) is nonzero is X is an integer constant with
4351 exactly one bit 1. */
4352
9566a759 4353extern int integer_pow2p (const_tree);
8da1b058 4354
4977bab6
ZW		 4355/* integer_nonzerop (tree x) is nonzero if X is an integer constant
4356 with a nonzero value. */
4357
9566a759 4358extern int integer_nonzerop (const_tree);
4977bab6 4359
9566a759
KG		 4360extern bool cst_and_fits_in_hwi (const_tree);
4361extern tree num_ending_zeros (const_tree);
8b11a64c 4362
325217ed
CF		 4363/* fixed_zerop (tree x) is nonzero if X is a fixed-point constant of
4364 value 0. */
4365
3eb0da77 4366extern int fixed_zerop (const_tree);
325217ed 4367
525c6bf5
RH		 4368/* staticp (tree x) is nonzero if X is a reference to data allocated
4369 at a fixed address in memory. Returns the outermost data. */
8da1b058 4370
525c6bf5 4371extern tree staticp (tree);
8da1b058 4372
8da1b058
RS		 4373/* save_expr (EXP) returns an expression equivalent to EXP
4374 but it can be used multiple times within context CTX
4375 and only evaluate EXP once. */
4376
46c5ad27 4377extern tree save_expr (tree);
8da1b058 4378
a9ecacf6
OH		 4379/* Look inside EXPR and into any simple arithmetic operations. Return
4380 the innermost non-arithmetic node. */
4381
46c5ad27 4382extern tree skip_simple_arithmetic (tree);
a9ecacf6 4383
e2500fed
GK		 4384/* Return which tree structure is used by T. */
4385
9566a759 4386enum tree_node_structure_enum tree_node_structure (const_tree);
e2500fed 4387
7380d707
RK		 4388/* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
4389 or offset that depends on a field within a record.
4390
4391 Note that we only allow such expressions within simple arithmetic
4392 or a COND_EXPR. */
4393
fa233e34 4394extern bool contains_placeholder_p (const_tree);
7a6cdb44
RK		 4395
4396/* This macro calls the above function but short-circuits the common
4397 case of a constant to save time. Also check for null. */
4398
4399#define CONTAINS_PLACEHOLDER_P(EXP) \
4400 ((EXP) != 0 && ! TREE_CONSTANT (EXP) && contains_placeholder_p (EXP))
4401
4402/* Return 1 if any part of the computation of TYPE involves a PLACEHOLDER_EXPR.
4403 This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and field
4404 positions. */
4405
46c5ad27 4406extern bool type_contains_placeholder_p (tree);
7380d707
RK		 4407
4408/* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
4409 return a tree with all occurrences of references to F in a
4410 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
4411 contains only arithmetic expressions. */
4412
46c5ad27 4413extern tree substitute_in_expr (tree, tree, tree);
7380d707 4414
6fce44af
RK		 4415/* This macro calls the above function but short-circuits the common
4416 case of a constant to save time and also checks for NULL. */
4417
4418#define SUBSTITUTE_IN_EXPR(EXP, F, R) \
4419 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) : substitute_in_expr (EXP, F, R))
4420
4421/* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
4422 for it within OBJ, a tree that is an object or a chain of references. */
4423
4424extern tree substitute_placeholder_in_expr (tree, tree);
4425
4426/* This macro calls the above function but short-circuits the common
4427 case of a constant to save time and also checks for NULL. */
4428
4429#define SUBSTITUTE_PLACEHOLDER_IN_EXPR(EXP, OBJ) \
4430 ((EXP) == 0 || TREE_CONSTANT (EXP) ? (EXP) \
4431 : substitute_placeholder_in_expr (EXP, OBJ))
4432
90ca31be
RS		 4433/* variable_size (EXP) is like save_expr (EXP) except that it
4434 is for the special case of something that is part of a
4435 variable size for a data type. It makes special arrangements
4436 to compute the value at the right time when the data type
4437 belongs to a function parameter. */
4438
46c5ad27 4439extern tree variable_size (tree);
90ca31be 4440
dcc24678 4441/* stabilize_reference (EXP) returns a reference equivalent to EXP
8da1b058
RS		 4442 but it can be used multiple times
4443 and only evaluate the subexpressions once. */
4444
46c5ad27 4445extern tree stabilize_reference (tree);
8da1b058 4446
1c8b10bb
RK		 4447/* Subroutine of stabilize_reference; this is called for subtrees of
4448 references. Any expression with side-effects must be put in a SAVE_EXPR
4449 to ensure that it is only evaluated once. */
4450
46c5ad27 4451extern tree stabilize_reference_1 (tree);
1c8b10bb 4452
8da1b058
RS		 4453/* Return EXP, stripped of any conversions to wider types
4454 in such a way that the result of converting to type FOR_TYPE
4455 is the same as if EXP were converted to FOR_TYPE.
4456 If FOR_TYPE is 0, it signifies EXP's type. */
4457
46c5ad27 4458extern tree get_unwidened (tree, tree);
8da1b058
RS		 4459
4460/* Return OP or a simpler expression for a narrower value
4461 which can be sign-extended or zero-extended to give back OP.
4462 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
4463 or 0 if the value should be sign-extended. */
4464
46c5ad27 4465extern tree get_narrower (tree, int *);
8da1b058 4466
63d195d5
RG		 4467/* Return true if T is an expression that get_inner_reference handles. */
4468
87a5b4cc
RG		 4469static inline bool
4470handled_component_p (const_tree t)
4471{
4472 switch (TREE_CODE (t))
4473 {
4474 case BIT_FIELD_REF:
4475 case COMPONENT_REF:
4476 case ARRAY_REF:
4477 case ARRAY_RANGE_REF:
4478 case VIEW_CONVERT_EXPR:
4479 case REALPART_EXPR:
4480 case IMAGPART_EXPR:
4481 return true;
4482
4483 default:
4484 return false;
4485 }
4486}
63d195d5
RG		 4487
4488/* Given an expression EXP that is a handled_component_p,
4489 look for the ultimate containing object, which is returned and specify
4490 the access position and size. */
8da1b058 4491
46c5ad27 4492extern tree get_inner_reference (tree, HOST_WIDE_INT *, HOST_WIDE_INT *,
579eab58
EB		 4493 tree *, enum machine_mode *, int *, int *,
4494 bool);
8da1b058 4495
9f7ccf69
EB		 4496/* Given an expression EXP that may be a COMPONENT_REF, an ARRAY_REF or an
4497 ARRAY_RANGE_REF, look for whether EXP or any nested component-refs within
4498 EXP is marked as PACKED. */
5b900a4c 4499
fa233e34 4500extern bool contains_packed_reference (const_tree exp);
5b900a4c 4501
44de5aeb 4502/* Return a tree of sizetype representing the size, in bytes, of the element
9f7ccf69 4503 of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
44de5aeb
RK		 4504
4505extern tree array_ref_element_size (tree);
4506
4507/* Return a tree representing the lower bound of the array mentioned in
9f7ccf69 4508 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
44de5aeb
RK		 4509
4510extern tree array_ref_low_bound (tree);
4511
a7e5372d 4512/* Return a tree representing the upper bound of the array mentioned in
9f7ccf69 4513 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
a7e5372d
ZD		 4514
4515extern tree array_ref_up_bound (tree);
4516
44de5aeb
RK		 4517/* Return a tree representing the offset, in bytes, of the field referenced
4518 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
4519
4520extern tree component_ref_field_offset (tree);
4521
140b60b4
MM		 4522/* Given a DECL or TYPE, return the scope in which it was declared, or
4523 NUL_TREE if there is no containing scope. */
4524
9566a759 4525extern tree get_containing_scope (const_tree);
140b60b4 4526
8da1b058
RS		 4527/* Return the FUNCTION_DECL which provides this _DECL with its context,
4528 or zero if none. */
9566a759 4529extern tree decl_function_context (const_tree);
8da1b058 4530
3635a54b
RK		 4531/* Return the RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE which provides
4532 this _DECL with its context, or zero if none. */
9566a759 4533extern tree decl_type_context (const_tree);
8da1b058 4534
a3c11cd3 4535/* Return 1 if EXPR is the real constant zero. */
9566a759 4536extern int real_zerop (const_tree);
8da1b058
RS		 4537\f
4538/* Declare commonly used variables for tree structure. */
4539
4812480a
JM		 4540/* Nonzero means lvalues are limited to those valid in pedantic ANSI C.
4541 Zero means allow extended lvalues. */
4542
4543extern int pedantic_lvalues;
4544
2ba84f36 4545/* Points to the FUNCTION_DECL of the function whose body we are reading. */
8da1b058 4546
e2500fed 4547extern GTY(()) tree current_function_decl;
8da1b058 4548
00262c8a 4549/* Nonzero means a FUNC_BEGIN label was emitted. */
375d2edc 4550extern GTY(()) const char * current_function_func_begin_label;
04e1d06b
MM		 4551\f
4552/* Iterator for going through the function arguments. */
4553typedef struct {
4554 tree fntype; /* function type declaration */
4555 tree next; /* TREE_LIST pointing to the next argument */
4556} function_args_iterator;
4557
4558/* Initialize the iterator I with arguments from function FNDECL */
4559
4560static inline void
4561function_args_iter_init (function_args_iterator *i, tree fntype)
4562{
4563 i->fntype = fntype;
4564 i->next = TYPE_ARG_TYPES (fntype);
4565}
4566
4567/* Return a pointer that holds the next argument if there are more arguments to
4568 handle, otherwise return NULL. */
4569
4570static inline tree *
4571function_args_iter_cond_ptr (function_args_iterator *i)
4572{
4573 return (i->next) ? &TREE_VALUE (i->next) : NULL;
4574}
4575
4576/* Return the next argument if there are more arguments to handle, otherwise
4577 return NULL. */
4578
4579static inline tree
4580function_args_iter_cond (function_args_iterator *i)
4581{
4582 return (i->next) ? TREE_VALUE (i->next) : NULL_TREE;
4583}
4584
4585/* Advance to the next argument. */
4586static inline void
4587function_args_iter_next (function_args_iterator *i)
4588{
4589 gcc_assert (i->next != NULL_TREE);
4590 i->next = TREE_CHAIN (i->next);
4591}
4592
cff7525f
JH		 4593/* We set BLOCK_SOURCE_LOCATION only to inlined function entry points. */
4594
4595static inline bool
4596inlined_function_outer_scope_p (const_tree block)
4597{
4598 return BLOCK_SOURCE_LOCATION (block) != UNKNOWN_LOCATION;
4599}
4600
04e1d06b
MM		 4601/* Loop over all function arguments of FNTYPE. In each iteration, PTR is set
4602 to point to the next tree element. ITER is an instance of
4603 function_args_iterator used to iterate the arguments. */
4604#define FOREACH_FUNCTION_ARGS_PTR(FNTYPE, PTR, ITER) \
4605 for (function_args_iter_init (&(ITER), (FNTYPE)); \
4606 (PTR = function_args_iter_cond_ptr (&(ITER))) != NULL; \
4607 function_args_iter_next (&(ITER)))
4608
4609/* Loop over all function arguments of FNTYPE. In each iteration, TREE is set
4610 to the next tree element. ITER is an instance of function_args_iterator
4611 used to iterate the arguments. */
4612#define FOREACH_FUNCTION_ARGS(FNTYPE, TREE, ITER) \
4613 for (function_args_iter_init (&(ITER), (FNTYPE)); \
4614 (TREE = function_args_iter_cond (&(ITER))) != NULL_TREE; \
4615 function_args_iter_next (&(ITER)))
4616
4617
8da1b058 4618\f
143f1945 4619/* In tree.c */
2aab7ceb 4620extern unsigned crc32_string (unsigned, const char *);
46c5ad27 4621extern void clean_symbol_name (char *);
5880f14f 4622extern tree get_file_function_name (const char *);
fa233e34 4623extern tree get_callee_fndecl (const_tree);
fccc4eb2 4624extern void change_decl_assembler_name (tree, tree);
9566a759 4625extern int type_num_arguments (const_tree);
3168cb99
JL		 4626extern bool associative_tree_code (enum tree_code);
4627extern bool commutative_tree_code (enum tree_code);
18522563
ZD		 4628extern tree upper_bound_in_type (tree, tree);
4629extern tree lower_bound_in_type (tree, tree);
fa233e34 4630extern int operand_equal_for_phi_arg_p (const_tree, const_tree);
5039610b
SL		 4631extern tree call_expr_arg (tree, int);
4632extern tree *call_expr_argp (tree, int);
4633extern tree call_expr_arglist (tree);
726a989a
RB		 4634extern tree create_artificial_label (void);
4635extern const char *get_name (tree);
04e1d06b
MM		 4636extern bool stdarg_p (tree);
4637extern bool prototype_p (tree);
58f9752a 4638extern bool auto_var_in_fn_p (const_tree, const_tree);
143f1945 4639\f
726a989a
RB		 4640/* In gimplify.c */
4641extern tree unshare_expr (tree);
4642\f
8da1b058
RS		 4643/* In stmt.c */
4644
46c5ad27 4645extern void expand_expr_stmt (tree);
fa233e34 4646extern int warn_if_unused_value (const_tree, location_t);
46c5ad27
AJ		 4647extern void expand_label (tree);
4648extern void expand_goto (tree);
46c5ad27 4649
6de9cd9a
DN		 4650extern rtx expand_stack_save (void);
4651extern void expand_stack_restore (tree);
46c5ad27 4652extern void expand_return (tree);
46c5ad27 4653
165b54c3 4654/* In tree-eh.c */
46c5ad27 4655extern void using_eh_for_cleanups (void);
8da1b058
RS		 4656
4657/* In fold-const.c */
4658
63b48197
MS		 4659/* Non-zero if we are folding constants inside an initializer; zero
4660 otherwise. */
4661extern int folding_initializer;
4662
db136335 4663/* Convert between trees and native memory representation. */
fa233e34
KG		 4664extern int native_encode_expr (const_tree, unsigned char *, int);
4665extern tree native_interpret_expr (tree, const unsigned char *, int);
db136335 4666
4b63dccb
RK		 4667/* Fold constants as much as possible in an expression.
4668 Returns the simplified expression.
4669 Acts only on the top level of the expression;
4670 if the argument itself cannot be simplified, its
4671 subexpressions are not changed. */
4672
46c5ad27 4673extern tree fold (tree);
721425b6 4674extern tree fold_unary (enum tree_code, tree, tree);
9bacafeb 4675extern tree fold_unary_ignore_overflow (enum tree_code, tree, tree);
721425b6
KH		 4676extern tree fold_binary (enum tree_code, tree, tree, tree);
4677extern tree fold_ternary (enum tree_code, tree, tree, tree, tree);
5808968e
AP		 4678extern tree fold_build1_stat (enum tree_code, tree, tree MEM_STAT_DECL);
4679#define fold_build1(c,t1,t2) fold_build1_stat (c, t1, t2 MEM_STAT_INFO)
4680extern tree fold_build2_stat (enum tree_code, tree, tree, tree MEM_STAT_DECL);
4681#define fold_build2(c,t1,t2,t3) fold_build2_stat (c, t1, t2, t3 MEM_STAT_INFO)
4682extern tree fold_build3_stat (enum tree_code, tree, tree, tree, tree MEM_STAT_DECL);
4683#define fold_build3(c,t1,t2,t3,t4) fold_build3_stat (c, t1, t2, t3, t4 MEM_STAT_INFO)
00d1b1d6
JM		 4684extern tree fold_build1_initializer (enum tree_code, tree, tree);
4685extern tree fold_build2_initializer (enum tree_code, tree, tree, tree);
4686extern tree fold_build3_initializer (enum tree_code, tree, tree, tree, tree);
94a0dd7b
SL		 4687extern tree fold_build_call_array (tree, tree, int, tree *);
4688extern tree fold_build_call_array_initializer (tree, tree, int, tree *);
fa233e34 4689extern bool fold_convertible_p (const_tree, const_tree);
e419fe91 4690extern tree fold_convert (tree, tree);
46c5ad27 4691extern tree fold_single_bit_test (enum tree_code, tree, tree, tree);
9675412f 4692extern tree fold_ignored_result (tree);
9655d83b 4693extern tree fold_abs_const (tree, tree);
095ecc24 4694extern tree fold_indirect_ref_1 (tree, tree);
6ac01510 4695extern void fold_defer_overflow_warnings (void);
726a989a 4696extern void fold_undefer_overflow_warnings (bool, const_gimple, int);
6ac01510
ILT		 4697extern void fold_undefer_and_ignore_overflow_warnings (void);
4698extern bool fold_deferring_overflow_warnings_p (void);
fe9821b8 4699extern tree maybe_fold_offset_to_reference (tree, tree, tree);
99f536cc 4700extern tree maybe_fold_offset_to_address (tree, tree, tree);
726a989a 4701extern tree maybe_fold_stmt_addition (tree, tree, tree);
46c5ad27 4702
b8fca551 4703extern tree force_fit_type_double (tree, unsigned HOST_WIDE_INT, HOST_WIDE_INT,
d95787e6 4704 int, bool);
ca7a3bd7 4705
2b60792f 4706extern int fit_double_type (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
9566a759 4707 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *, const_tree);
6b7283ac
EB		 4708extern int add_double_with_sign (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4709 unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4710 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *,
4711 bool);
4712#define add_double(l1,h1,l2,h2,lv,hv) \
4713 add_double_with_sign (l1, h1, l2, h2, lv, hv, false)
46c5ad27
AJ		 4714extern int neg_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4715 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
6b7283ac
EB		 4716extern int mul_double_with_sign (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4717 unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4718 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *,
4719 bool);
4720#define mul_double(l1,h1,l2,h2,lv,hv) \
4721 mul_double_with_sign (l1, h1, l2, h2, lv, hv, false)
46c5ad27
AJ		 4722extern void lshift_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4723 HOST_WIDE_INT, unsigned int,
4724 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *, int);
4725extern void rshift_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4726 HOST_WIDE_INT, unsigned int,
4727 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *, int);
4728extern void lrotate_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4729 HOST_WIDE_INT, unsigned int,
4730 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
4731extern void rrotate_double (unsigned HOST_WIDE_INT, HOST_WIDE_INT,
4732 HOST_WIDE_INT, unsigned int,
4733 unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
4734
4735extern int div_and_round_double (enum tree_code, int, unsigned HOST_WIDE_INT,
4736 HOST_WIDE_INT, unsigned HOST_WIDE_INT,
4737 HOST_WIDE_INT, unsigned HOST_WIDE_INT *,
4738 HOST_WIDE_INT *, unsigned HOST_WIDE_INT *,
4739 HOST_WIDE_INT *);
4740
6de9cd9a
DN		 4741enum operand_equal_flag
4742{
4743 OEP_ONLY_CONST = 1,
4744 OEP_PURE_SAME = 2
4745};
4746
fa233e34 4747extern int operand_equal_p (const_tree, const_tree, unsigned int);
ac545c64 4748extern int multiple_of_p (tree, const_tree, const_tree);
46c5ad27 4749extern tree omit_one_operand (tree, tree, tree);
08039bd8 4750extern tree omit_two_operands (tree, tree, tree, tree);
46c5ad27 4751extern tree invert_truthvalue (tree);
d817ed3b 4752extern tree fold_truth_not_expr (tree);
b52d5eaa
RS		 4753extern tree fold_unary_to_constant (enum tree_code, tree, tree);
4754extern tree fold_binary_to_constant (enum tree_code, tree, tree, tree);
6de9cd9a 4755extern tree fold_read_from_constant_string (tree);
fa233e34 4756extern tree int_const_binop (enum tree_code, const_tree, const_tree, int);
cd3ce9b4 4757extern tree build_fold_addr_expr (tree);
e3bb43c0
RS		 4758extern tree fold_build_cleanup_point_expr (tree type, tree expr);
4759extern tree fold_strip_sign_ops (tree);
cd3ce9b4
JM		 4760extern tree build_fold_addr_expr_with_type (tree, tree);
4761extern tree build_fold_indirect_ref (tree);
6a720599 4762extern tree fold_indirect_ref (tree);
e9ea8bd5 4763extern tree constant_boolean_node (int, tree);
38b0dcb8 4764extern tree build_low_bits_mask (tree, unsigned);
108f6c2f 4765extern tree div_if_zero_remainder (enum tree_code, const_tree, const_tree);
c530479e 4766
fa233e34 4767extern bool tree_swap_operands_p (const_tree, const_tree, bool);
fd660b1b
JL		 4768extern enum tree_code swap_tree_comparison (enum tree_code);
4769
2f4675b4 4770extern bool ptr_difference_const (tree, tree, HOST_WIDE_INT *);
227858d1 4771extern enum tree_code invert_tree_comparison (enum tree_code, bool);
2f4675b4 4772
4db8040c 4773extern bool tree_expr_nonzero_p (tree);
2d3cd5d5
RAE		 4774extern bool tree_unary_nonzero_warnv_p (enum tree_code, tree, tree, bool *);
4775extern bool tree_binary_nonzero_warnv_p (enum tree_code, tree, tree, tree op1,
4776 bool *);
4777extern bool tree_single_nonzero_warnv_p (tree, bool *);
4778extern bool tree_expr_nonzero_warnv_p (tree, bool *);
4779extern bool tree_unary_nonnegative_warnv_p (enum tree_code, tree, tree, bool *);
4780extern bool tree_binary_nonnegative_warnv_p (enum tree_code, tree, tree, tree,
4781 bool *);
4782extern bool tree_single_nonnegative_warnv_p (tree t, bool *strict_overflow_p);
4783extern bool tree_invalid_nonnegative_warnv_p (tree t, bool *strict_overflow_p);
726a989a 4784extern bool tree_call_nonnegative_warnv_p (tree, tree, tree, tree, bool *);
a1a6e271 4785
6ac01510 4786extern bool tree_expr_nonzero_warnv_p (tree, bool *);
4db8040c 4787
2dc0f633 4788extern bool fold_real_zero_addition_p (const_tree, const_tree, int);
a254e44d
RG		 4789extern tree combine_comparisons (enum tree_code, enum tree_code,
4790 enum tree_code, tree, tree, tree);
2dc0f633 4791
100d537d
MLI		 4792/* Return nonzero if CODE is a tree code that represents a truth value. */
4793static inline bool
4794truth_value_p (enum tree_code code)
4795{
4796 return (TREE_CODE_CLASS (code) == tcc_comparison
4797 || code == TRUTH_AND_EXPR || code == TRUTH_ANDIF_EXPR
4798 || code == TRUTH_OR_EXPR || code == TRUTH_ORIF_EXPR
4799 || code == TRUTH_XOR_EXPR || code == TRUTH_NOT_EXPR);
4800}
4801
4802
4977bab6 4803/* In builtins.c */
5039610b
SL		 4804extern tree fold_call_expr (tree, bool);
4805extern tree fold_builtin_fputs (tree, tree, bool, bool, tree);
4806extern tree fold_builtin_strcpy (tree, tree, tree, tree);
4807extern tree fold_builtin_strncpy (tree, tree, tree, tree, tree);
4808extern tree fold_builtin_memory_chk (tree, tree, tree, tree, tree, tree, bool,
10a0d495 4809 enum built_in_function);
5039610b 4810extern tree fold_builtin_stxcpy_chk (tree, tree, tree, tree, tree, bool,
10a0d495 4811 enum built_in_function);
5039610b 4812extern tree fold_builtin_strncpy_chk (tree, tree, tree, tree, tree);
10a0d495 4813extern tree fold_builtin_snprintf_chk (tree, tree, enum built_in_function);
5039610b 4814extern bool fold_builtin_next_arg (tree, bool);
fa233e34 4815extern enum built_in_function builtin_mathfn_code (const_tree);
46c5ad27 4816extern tree build_function_call_expr (tree, tree);
94a0dd7b 4817extern tree fold_builtin_call_array (tree, tree, int, tree *);
ac545c64 4818extern void debug_fold_checksum (const_tree);
5039610b 4819extern tree build_call_expr (tree, int, ...);
46c5ad27 4820extern tree mathfn_built_in (tree, enum built_in_function fn);
6de9cd9a 4821extern tree strip_float_extensions (tree);
6de9cd9a 4822extern tree c_strlen (tree, int);
726a989a 4823extern tree std_gimplify_va_arg_expr (tree, tree, gimple_seq *, gimple_seq *);
c2433d7d 4824extern tree build_va_arg_indirect_ref (tree);
34d85166 4825extern tree build_string_literal (int, const char *);
fa233e34 4826extern bool validate_arglist (const_tree, ...);
34d85166
JH		 4827extern rtx builtin_memset_read_str (void *, HOST_WIDE_INT, enum machine_mode);
4828extern int get_pointer_alignment (tree, unsigned int);
bbf7ce11 4829extern bool is_builtin_name(const char*);
df96b059 4830extern int get_object_alignment (tree, unsigned int, unsigned int);
726a989a
RB		 4831extern tree fold_call_stmt (gimple, bool);
4832extern tree gimple_fold_builtin_snprintf_chk (gimple, tree, enum built_in_function);
a3c11cd3 4833
77f9af81 4834/* In convert.c */
46c5ad27 4835extern tree strip_float_extensions (tree);
77f9af81 4836
a1d061a1 4837/* In tree.c */
9566a759 4838extern int really_constant_p (const_tree);
51eed280 4839extern bool decl_address_invariant_p (const_tree);
00fc2333 4840extern bool decl_address_ip_invariant_p (const_tree);
9566a759 4841extern int int_fits_type_p (const_tree, const_tree);
34917a10 4842#ifndef GENERATOR_FILE
22ea9ec0 4843extern void get_type_static_bounds (const_tree, mpz_t, mpz_t);
34917a10 4844#endif
5377d5ba 4845extern bool variably_modified_type_p (tree, tree);
9566a759
KG		 4846extern int tree_log2 (const_tree);
4847extern int tree_floor_log2 (const_tree);
fa233e34 4848extern int simple_cst_equal (const_tree, const_tree);
9566a759 4849extern hashval_t iterative_hash_expr (const_tree, hashval_t);
726a989a
RB		 4850extern hashval_t iterative_hash_exprs_commutative (const_tree,
4851 const_tree, hashval_t);
c9145754 4852extern hashval_t iterative_hash_hashval_t (hashval_t, hashval_t);
9566a759 4853extern int compare_tree_int (const_tree, unsigned HOST_WIDE_INT);
fa233e34 4854extern int type_list_equal (const_tree, const_tree);
9566a759 4855extern int chain_member (const_tree, const_tree);
46c5ad27
AJ		 4856extern tree type_hash_lookup (unsigned int, tree);
4857extern void type_hash_add (unsigned int, tree);
9566a759 4858extern int simple_cst_list_equal (const_tree, const_tree);
46c5ad27
AJ		 4859extern void dump_tree_statistics (void);
4860extern void expand_function_end (void);
b79c5284 4861extern void expand_function_start (tree);
7d69de61 4862extern void stack_protect_prologue (void);
b755446c 4863extern void stack_protect_epilogue (void);
127203ac 4864extern void recompute_tree_invariant_for_addr_expr (tree);
586de218 4865extern bool needs_to_live_in_memory (const_tree);
b34417a4 4866extern tree reconstruct_complex_type (tree, tree);
46c5ad27 4867
9566a759
KG		 4868extern int real_onep (const_tree);
4869extern int real_twop (const_tree);
4870extern int real_minus_onep (const_tree);
46c5ad27 4871extern void init_ttree (void);
8c1d6d62 4872extern void build_common_tree_nodes (bool, bool);
46c5ad27 4873extern void build_common_tree_nodes_2 (int);
c6a912da 4874extern void build_common_builtin_nodes (void);
bc15d0ef 4875extern tree build_nonstandard_integer_type (unsigned HOST_WIDE_INT, int);
46c5ad27 4876extern tree build_range_type (tree, tree, tree);
9566a759 4877extern HOST_WIDE_INT int_cst_value (const_tree);
bde6c65d 4878extern tree build_addr (tree, tree);
a1d061a1 4879
6ea2b70d 4880extern bool fields_compatible_p (const_tree, const_tree);
fa27426e
RH		 4881extern tree find_compatible_field (tree, tree);
4882
5ffeb913 4883extern void set_expr_locus (tree, source_location *);
5ffeb913 4884
07beea0d 4885extern tree *tree_block (tree);
d752cfdb 4886extern location_t *block_nonartificial_location (tree);
9bd9f738 4887extern location_t tree_nonartificial_location (tree);
07beea0d 4888
a1d061a1 4889/* In function.c */
46c5ad27
AJ		 4890extern void expand_main_function (void);
4891extern void init_dummy_function_start (void);
4892extern void expand_dummy_function_end (void);
c2924966 4893extern unsigned int init_function_for_compilation (void);
182e0d71 4894extern void allocate_struct_function (tree, bool);
db2960f4 4895extern void push_struct_function (tree fndecl);
46c5ad27 4896extern void init_function_start (tree);
fa233e34 4897extern bool use_register_for_decl (const_tree);
6fb5fa3c 4898extern void generate_setjmp_warnings (void);
46c5ad27 4899extern void init_temp_slots (void);
46c5ad27
AJ		 4900extern void free_temp_slots (void);
4901extern void pop_temp_slots (void);
4902extern void push_temp_slots (void);
4903extern void preserve_temp_slots (rtx);
586de218 4904extern int aggregate_value_p (const_tree, const_tree);
46c5ad27
AJ		 4905extern void push_function_context (void);
4906extern void pop_function_context (void);
726a989a 4907extern gimple_seq gimplify_parameters (void);
a1d061a1
JL		 4908
4909/* In print-rtl.c */
4910#ifdef BUFSIZ
f7d504c2 4911extern void print_rtl (FILE *, const_rtx);
a1d061a1
JL		 4912#endif
4913
4914/* In print-tree.c */
46c5ad27 4915extern void debug_tree (tree);
a1d061a1 4916#ifdef BUFSIZ
6ea2b70d 4917extern void dump_addr (FILE*, const char *, const void *);
46c5ad27 4918extern void print_node (FILE *, const char *, tree, int);
6ea2b70d 4919extern void print_node_brief (FILE *, const char *, const_tree, int);
46c5ad27 4920extern void indent_to (FILE *, int);
a1d061a1
JL		 4921#endif
4922
61a36b9b
RK		 4923/* In tree-inline.c: */
4924extern bool debug_find_tree (tree, tree);
19114537
EC		 4925/* This is in tree-inline.c since the routine uses
4926 data structures from the inliner. */
4927extern tree unsave_expr_now (tree);
52dd234b 4928extern tree build_duplicate_type (tree);
61a36b9b 4929
3a8c995b 4930/* In calls.c */
f2d33f13 4931
6e14af16
ZW		 4932/* Nonzero if this is a call to a function whose return value depends
4933 solely on its arguments, has no side effects, and does not read
becfd6e5
KZ		 4934 global memory. This corresponds to TREE_READONLY for function
4935 decls. */
4936#define ECF_CONST (1 << 0)
4937/* Nonzero if this is a call to "pure" function (like const function,
4938 but may read memory. This corresponds to DECL_PURE_P for function
4939 decls. */
4940#define ECF_PURE (1 << 1)
4941/* Nonzero if this is ECF_CONST or ECF_PURE but cannot be proven to no
4942 infinite loop. This corresponds to DECL_LOOPING_CONST_OR_PURE_P
4943 for function decls.*/
4944#define ECF_LOOPING_CONST_OR_PURE (1 << 2)
6e14af16 4945/* Nonzero if this call will never return. */
becfd6e5 4946#define ECF_NORETURN (1 << 3)
fa5b060f 4947/* Nonzero if this is a call to malloc or a related function. */
becfd6e5 4948#define ECF_MALLOC (1 << 4)
fa5b060f 4949/* Nonzero if it is plausible that this is a call to alloca. */
becfd6e5 4950#define ECF_MAY_BE_ALLOCA (1 << 5)
fa5b060f 4951/* Nonzero if this is a call to a function that won't throw an exception. */
becfd6e5 4952#define ECF_NOTHROW (1 << 6)
fa5b060f 4953/* Nonzero if this is a call to setjmp or a related function. */
becfd6e5 4954#define ECF_RETURNS_TWICE (1 << 7)
6e14af16 4955/* Nonzero if this call replaces the current stack frame. */
becfd6e5 4956#define ECF_SIBCALL (1 << 8)
dcd6de6d
ZD		 4957/* Function does not read or write memory (but may have side effects, so
4958 it does not necessarily fit ECF_CONST). */
84b8030f 4959#define ECF_NOVOPS (1 << 9)
fa5b060f 4960
6ea2b70d 4961extern int flags_from_decl_or_type (const_tree);
fa233e34 4962extern int call_expr_flags (const_tree);
fa5b060f 4963
6ea2b70d 4964extern int setjmp_call_p (const_tree);
726a989a 4965extern bool gimple_alloca_call_p (const_gimple);
6ea2b70d 4966extern bool alloca_call_p (const_tree);
586de218
KG		 4967extern bool must_pass_in_stack_var_size (enum machine_mode, const_tree);
4968extern bool must_pass_in_stack_var_size_or_pad (enum machine_mode, const_tree);
61e04322 4969extern tree block_ultimate_origin (const_tree);
3a8c995b 4970
bb9f8221 4971/* In attribs.c. */
0c96e965 4972
a7f6bc8c
JM		 4973extern const struct attribute_spec *lookup_attribute_spec (tree);
4974
0c96e965
RK		 4975/* Process the attributes listed in ATTRIBUTES and install them in *NODE,
4976 which is either a DECL (including a TYPE_DECL) or a TYPE. If a DECL,
4977 it should be modified in place; if a TYPE, a copy should be created
4978 unless ATTR_FLAG_TYPE_IN_PLACE is set in FLAGS. FLAGS gives further
4979 information, in the form of a bitwise OR of flags in enum attribute_flags
4980 from tree.h. Depending on these flags, some attributes may be
4981 returned to be applied at a later stage (for example, to apply
4982 a decl attribute to the declaration rather than to its type). */
4682ae04 4983extern tree decl_attributes (tree *, tree, int);
bb9f8221 4984
a1d061a1 4985/* In integrate.c */
46c5ad27 4986extern void set_decl_abstract_flags (tree, int);
46c5ad27 4987extern void set_decl_origin_self (tree);
a1d061a1 4988
a1d061a1 4989/* In stor-layout.c */
7b6d72fc 4990extern void set_min_and_max_values_for_integral_type (tree, int, bool);
46c5ad27
AJ		 4991extern void fixup_signed_type (tree);
4992extern void internal_reference_types (void);
6de9cd9a
DN		 4993extern unsigned int update_alignment_for_field (record_layout_info, tree,
4994 unsigned int);
a1d061a1 4995/* varasm.c */
0e6df31e 4996extern void make_decl_rtl (tree);
46c5ad27
AJ		 4997extern void make_decl_one_only (tree);
4998extern int supports_one_only (void);
46c5ad27
AJ		 4999extern void resolve_unique_section (tree, int, int);
5000extern void mark_referenced (tree);
bb9a388d 5001extern void mark_decl_referenced (tree);
810db579 5002extern void notice_global_symbol (tree);
0e6df31e 5003extern void set_user_assembler_name (tree, const char *);
857e7259 5004extern void process_pending_assemble_externals (void);
e4d5432a
RH		 5005extern void finish_aliases_1 (void);
5006extern void finish_aliases_2 (void);
8893239d 5007extern tree emutls_decl (tree);
a1d061a1 5008
a1d061a1 5009/* In stmt.c */
46c5ad27
AJ		 5010extern void expand_computed_goto (tree);
5011extern bool parse_output_constraint (const char **, int, int, int,
5012 bool *, bool *, bool *);
1456deaf
JM		 5013extern bool parse_input_constraint (const char **, int, int, int, int,
5014 const char * const *, bool *, bool *);
6de9cd9a 5015extern void expand_asm_expr (tree);
7dc8b126 5016extern tree resolve_asm_operand_names (tree, tree, tree);
7efcb746 5017extern void expand_case (tree);
46c5ad27 5018extern void expand_decl (tree);
61158923
HPN		 5019#ifdef HARD_CONST
5020/* Silly ifdef to avoid having all includers depend on hard-reg-set.h. */
91b4415a 5021extern tree tree_overlaps_hard_reg_set (tree, HARD_REG_SET *);
61158923 5022#endif
6de9cd9a 5023
af4142d5
JM		 5024\f
5025/* Interface of the DWARF2 unwind info support. */
5026
af4142d5
JM		 5027/* Generate a new label for the CFI info to refer to. */
5028
46c5ad27 5029extern char *dwarf2out_cfi_label (void);
af4142d5
JM		 5030
5031/* Entry point to update the canonical frame address (CFA). */
5032
0ab5b679 5033extern void dwarf2out_def_cfa (const char *, unsigned, HOST_WIDE_INT);
af4142d5
JM		 5034
5035/* Add the CFI for saving a register window. */
5036
46c5ad27 5037extern void dwarf2out_window_save (const char *);
af4142d5
JM		 5038
5039/* Add a CFI to update the running total of the size of arguments pushed
5040 onto the stack. */
5041
0ab5b679 5042extern void dwarf2out_args_size (const char *, HOST_WIDE_INT);
af4142d5
JM		 5043
5044/* Entry point for saving a register to the stack. */
5045
0ab5b679 5046extern void dwarf2out_reg_save (const char *, unsigned, HOST_WIDE_INT);
af4142d5
JM		 5047
5048/* Entry point for saving the return address in the stack. */
5049
0ab5b679 5050extern void dwarf2out_return_save (const char *, HOST_WIDE_INT);
af4142d5
JM		 5051
5052/* Entry point for saving the return address in a register. */
5053
46c5ad27 5054extern void dwarf2out_return_reg (const char *, unsigned);
af4142d5 5055
150cdc9e
RH		 5056/* Entry point for saving the first register into the second. */
5057
5058extern void dwarf2out_reg_save_reg (const char *, rtx, rtx);
5059
d8472c75
JM		 5060/* In tree-inline.c */
5061
0c58f841
MA		 5062/* The type of a set of already-visited pointers. Functions for creating
5063 and manipulating it are declared in pointer-set.h */
5064struct pointer_set_t;
5065
6de9cd9a 5066/* The type of a callback function for walking over tree structure. */
588d3ade 5067
46c5ad27 5068typedef tree (*walk_tree_fn) (tree *, int *, void *);
14588106
RG		 5069
5070/* The type of a callback function that represents a custom walk_tree. */
5071
5072typedef tree (*walk_tree_lh) (tree *, int *, tree (*) (tree *, int *, void *),
5073 void *, struct pointer_set_t*);
5074
5075extern tree walk_tree_1 (tree*, walk_tree_fn, void*, struct pointer_set_t*,
5076 walk_tree_lh);
5077extern tree walk_tree_without_duplicates_1 (tree*, walk_tree_fn, void*,
5078 walk_tree_lh);
5079#define walk_tree(a,b,c,d) \
5080 walk_tree_1 (a, b, c, d, NULL)
5081#define walk_tree_without_duplicates(a,b,c) \
5082 walk_tree_without_duplicates_1 (a, b, c, NULL)
588d3ade 5083
a560d4d4
JH		 5084/* Assign the RTX to declaration. */
5085
46c5ad27 5086extern void set_decl_rtl (tree, rtx);
5141868d 5087extern void set_decl_incoming_rtl (tree, rtx, bool);
9a6bb3f7 5088\f
caf93cb0 5089/* Enum and arrays used for tree allocation stats.
938d968e 5090 Keep in sync with tree.c:tree_node_kind_names. */
adc4adcd
GP		 5091typedef enum
5092{
5093 d_kind,
5094 t_kind,
5095 b_kind,
5096 s_kind,
5097 r_kind,
5098 e_kind,
5099 c_kind,
5100 id_kind,
5101 perm_list_kind,
5102 temp_list_kind,
5103 vec_kind,
95b4aca6 5104 binfo_kind,
6de9cd9a 5105 ssa_name_kind,
4038c495 5106 constr_kind,
adc4adcd
GP		 5107 x_kind,
5108 lang_decl,
5109 lang_type,
aaf46ef9 5110 omp_clause_kind,
adc4adcd
GP		 5111 all_kinds
5112} tree_node_kind;
5113
5114extern int tree_node_counts[];
5115extern int tree_node_sizes[];
6de9cd9a
DN		 5116
5117/* True if we are in gimple form and the actions of the folders need to
5118 be restricted. False if we are not in gimple form and folding is not
5119 restricted to creating gimple expressions. */
5120extern bool in_gimple_form;
caf93cb0 5121
389fdba0
RH		 5122/* In tree-gimple.c. */
5123extern tree get_base_address (tree t);
5124
c866976a
LB		 5125/* In tree-vectorizer.c. */
5126extern void vect_set_verbosity_level (const char *);
5127
0802f6a2 5128/* In tree.c. */
fc8600f9 5129
d1b38208 5130struct GTY(()) tree_map_base {
fc8600f9
MM		 5131 tree from;
5132};
5133
5134extern int tree_map_base_eq (const void *, const void *);
5135extern unsigned int tree_map_base_hash (const void *);
5136extern int tree_map_base_marked_p (const void *);
5137
5138/* Map from a tree to another tree. */
5139
d1b38208 5140struct GTY(()) tree_map {
fc8600f9 5141 struct tree_map_base base;
820cc88f 5142 unsigned int hash;
820cc88f
DB		 5143 tree to;
5144};
5145
fc8600f9 5146#define tree_map_eq tree_map_base_eq
820cc88f 5147extern unsigned int tree_map_hash (const void *);
fc8600f9
MM		 5148#define tree_map_marked_p tree_map_base_marked_p
5149
5150/* Map from a tree to an int. */
820cc88f 5151
d1b38208 5152struct GTY(()) tree_int_map {
fc8600f9 5153 struct tree_map_base base;
0802f6a2
PB		 5154 unsigned int to;
5155};
5156
fc8600f9
MM		 5157#define tree_int_map_eq tree_map_base_eq
5158#define tree_int_map_hash tree_map_base_hash
5159#define tree_int_map_marked_p tree_map_base_marked_p
5160
5161/* Map from a tree to initialization/finalization priorities. */
5162
d1b38208 5163struct GTY(()) tree_priority_map {
fc8600f9
MM		 5164 struct tree_map_base base;
5165 priority_type init;
5166 priority_type fini;
5167};
5168
5169#define tree_priority_map_eq tree_map_base_eq
5170#define tree_priority_map_hash tree_map_base_hash
5171#define tree_priority_map_marked_p tree_map_base_marked_p
0802f6a2 5172
ac182688
ZD		 5173/* In tree-ssa-address.c. */
5174extern tree tree_mem_ref_addr (tree, tree);
5175extern void copy_mem_ref_info (tree, tree);
5176
b16caf72 5177/* In tree-vrp.c */
58f9752a 5178extern bool ssa_name_nonnegative_p (const_tree);
b16caf72 5179
10a0d495
JJ		 5180/* In tree-object-size.c. */
5181extern void init_object_sizes (void);
5182extern void fini_object_sizes (void);
5183extern unsigned HOST_WIDE_INT compute_builtin_object_size (tree, int);
5184
86a07404 5185/* In expr.c. */
fa233e34 5186extern unsigned HOST_WIDE_INT highest_pow2_factor (const_tree);
86a07404 5187
7f9bc51b
ZD		 5188/* In tree-inline.c. */
5189
5190void init_inline_once (void);
5191
5039610b
SL		 5192/* Compute the number of operands in an expression node NODE. For
5193 tcc_vl_exp nodes like CALL_EXPRs, this is stored in the node itself,
5194 otherwise it is looked up from the node's code. */
5195static inline int
741ac903 5196tree_operand_length (const_tree node)
5039610b
SL		 5197{
5198 if (VL_EXP_CLASS_P (node))
5199 return VL_EXP_OPERAND_LENGTH (node);
5200 else
5201 return TREE_CODE_LENGTH (TREE_CODE (node));
5202}
5203
5204/* Abstract iterators for CALL_EXPRs. These static inline definitions
5205 have to go towards the end of tree.h so that union tree_node is fully
5206 defined by this point. */
5207
5208/* Structure containing iterator state. */
d1b38208 5209typedef struct GTY (()) call_expr_arg_iterator_d {
5039610b
SL		 5210 tree t; /* the call_expr */
5211 int n; /* argument count */
5212 int i; /* next argument index */
5213} call_expr_arg_iterator;
5214
d1b38208 5215typedef struct GTY (()) const_call_expr_arg_iterator_d {
fa233e34
KG		 5216 const_tree t; /* the call_expr */
5217 int n; /* argument count */
5218 int i; /* next argument index */
5219} const_call_expr_arg_iterator;
5220
5039610b
SL		 5221/* Initialize the abstract argument list iterator object ITER with the
5222 arguments from CALL_EXPR node EXP. */
5223static inline void
5224init_call_expr_arg_iterator (tree exp, call_expr_arg_iterator *iter)
5225{
5226 iter->t = exp;
5227 iter->n = call_expr_nargs (exp);
5228 iter->i = 0;
5229}
5230
fa233e34
KG		 5231static inline void
5232init_const_call_expr_arg_iterator (const_tree exp, const_call_expr_arg_iterator *iter)
5233{
5234 iter->t = exp;
5235 iter->n = call_expr_nargs (exp);
5236 iter->i = 0;
5237}
5238
5039610b
SL		 5239/* Return the next argument from abstract argument list iterator object ITER,
5240 and advance its state. Return NULL_TREE if there are no more arguments. */
5241static inline tree
5242next_call_expr_arg (call_expr_arg_iterator *iter)
5243{
5244 tree result;
5245 if (iter->i >= iter->n)
5246 return NULL_TREE;
5247 result = CALL_EXPR_ARG (iter->t, iter->i);
5248 iter->i++;
5249 return result;
5250}
5251
fa233e34
KG		 5252static inline const_tree
5253next_const_call_expr_arg (const_call_expr_arg_iterator *iter)
5254{
5255 const_tree result;
5256 if (iter->i >= iter->n)
5257 return NULL_TREE;
5258 result = CALL_EXPR_ARG (iter->t, iter->i);
5259 iter->i++;
5260 return result;
5261}
5262
5039610b
SL		 5263/* Initialize the abstract argument list iterator object ITER, then advance
5264 past and return the first argument. Useful in for expressions, e.g.
5265 for (arg = first_call_expr_arg (exp, &iter); arg;
5266 arg = next_call_expr_arg (&iter)) */
5267static inline tree
5268first_call_expr_arg (tree exp, call_expr_arg_iterator *iter)
5269{
5270 init_call_expr_arg_iterator (exp, iter);
5271 return next_call_expr_arg (iter);
5272}
5273
fa233e34
KG		 5274static inline const_tree
5275first_const_call_expr_arg (const_tree exp, const_call_expr_arg_iterator *iter)
5276{
5277 init_const_call_expr_arg_iterator (exp, iter);
5278 return next_const_call_expr_arg (iter);
5279}
5280
5039610b
SL		 5281/* Test whether there are more arguments in abstract argument list iterator
5282 ITER, without changing its state. */
5283static inline bool
5284more_call_expr_args_p (const call_expr_arg_iterator *iter)
5285{
5286 return (iter->i < iter->n);
5287}
5288
fa233e34
KG		 5289static inline bool
5290more_const_call_expr_args_p (const const_call_expr_arg_iterator *iter)
5291{
5292 return (iter->i < iter->n);
5293}
5039610b
SL		 5294
5295/* Iterate through each argument ARG of CALL_EXPR CALL, using variable ITER
5296 (of type call_expr_arg_iterator) to hold the iteration state. */
5297#define FOR_EACH_CALL_EXPR_ARG(arg, iter, call) \
5298 for ((arg) = first_call_expr_arg ((call), &(iter)); (arg); \
5299 (arg) = next_call_expr_arg (&(iter)))
5300
fa233e34
KG		 5301#define FOR_EACH_CONST_CALL_EXPR_ARG(arg, iter, call) \
5302 for ((arg) = first_const_call_expr_arg ((call), &(iter)); (arg); \
5303 (arg) = next_const_call_expr_arg (&(iter)))
5304
df89f8e7 5305#endif /* GCC_TREE_H */
GNU Compiler Collection
This page took 6.051455 seconds and 5 git commands to generate.