OpenCores
URL https://opencores.org/ocsvn/openrisc_me/openrisc_me/trunk

Subversion Repositories openrisc_me

[/] [openrisc/] [trunk/] [gnu-src/] [gcc-4.5.1/] [gcc/] [tree.h] - Blame information for rev 280

Details | Compare with Previous | View Log

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

powered by: WebSVN 2.1.0

© copyright 1999-2024 OpenCores.org, equivalent to Oliscience, all rights reserved. OpenCores®, registered trademark.