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