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