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