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