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