1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
|
/****************************************************************************
* *
* GNAT COMPILER COMPONENTS *
* *
* A T R E E *
* *
* C Header File *
* *
* Copyright (C) 1992-2021, Free Software Foundation, Inc. *
* *
* GNAT is free software; you can redistribute it and/or modify it under *
* terms of the GNU General Public License as published by the Free Soft- *
* ware Foundation; either version 3, or (at your option) any later ver- *
* sion. GNAT is distributed in the hope that it will be useful, but WITH- *
* OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY *
* or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License *
* for more details. You should have received a copy of the GNU General *
* Public License distributed with GNAT; see file COPYING3. If not, go to *
* http://www.gnu.org/licenses for a complete copy of the license. *
* *
* GNAT was originally developed by the GNAT team at New York University. *
* Extensive contributions were provided by Ada Core Technologies Inc. *
* *
****************************************************************************/
/* This is the C header that corresponds to the Ada package specification for
Atree. It also contains the implementation of inlined functions from the
package body for Atree. It was created manually from atree.ads and
atree.adb and must be kept synchronized with changes in these files.
Note that only routines for reading the tree are included, since the tree
transformer is not supposed to modify the tree in any way. */
#ifdef __cplusplus
extern "C" {
#endif
#define Parent atree__parent
extern Node_Id Parent (Node_Id);
#define Original_Node atree__original_node
extern Node_Id Original_Node (Node_Id);
/* Type used for union of Node_Id, List_Id, Elist_Id. */
typedef Int Tree_Id;
/* These two functions can only be used for Node_Id and List_Id values and
they work in the C version because Empty = No_List = 0. */
INLINE Boolean No (Tree_Id);
INLINE Boolean Present (Tree_Id);
INLINE Boolean
No (Tree_Id N)
{
return N == Empty;
}
INLINE Boolean
Present (Tree_Id N)
{
return !No (N);
}
#define Current_Error_Node atree__current_error_node
extern Node_Id Current_Error_Node;
/* The following code corresponds to the Get_n_Bit_Field functions (for
various n) in package Atree. The low-level getters in sinfo.h call
these even-lower-level getters. */
extern Field_Offset *Node_Offsets_Ptr;
extern any_slot *Slots_Ptr;
INLINE unsigned int Get_1_Bit_Field (Node_Id, Field_Offset);
INLINE unsigned int Get_2_Bit_Field (Node_Id, Field_Offset);
INLINE unsigned int Get_4_Bit_Field (Node_Id, Field_Offset);
INLINE unsigned int Get_8_Bit_Field (Node_Id, Field_Offset);
INLINE unsigned int Get_32_Bit_Field (Node_Id, Field_Offset);
INLINE unsigned int Get_32_Bit_Field_With_Default (Node_Id, Field_Offset,
unsigned int);
INLINE unsigned int Get_Valid_32_Bit_Field (Node_Id, Field_Offset);
INLINE unsigned int
Get_1_Bit_Field (Node_Id N, Field_Offset Offset)
{
const Field_Offset L = Slot_Size / 1;
any_slot slot = *(Slots_Ptr + Node_Offsets_Ptr[N] + Offset / L);
return (slot >> (Offset % L) * (Slot_Size / L)) & 1;
}
INLINE unsigned int
Get_2_Bit_Field (Node_Id N, Field_Offset Offset)
{
const Field_Offset L = Slot_Size / 2;
any_slot slot = *(Slots_Ptr + Node_Offsets_Ptr[N] + Offset / L);
return (slot >> (Offset % L) * (Slot_Size / L)) & 3;
}
INLINE unsigned int
Get_4_Bit_Field (Node_Id N, Field_Offset Offset)
{
const Field_Offset L = Slot_Size / 4;
any_slot slot = *(Slots_Ptr + Node_Offsets_Ptr[N] + Offset / L);
return (slot >> (Offset % L) * (Slot_Size / L)) & 15;
}
INLINE unsigned int
Get_8_Bit_Field (Node_Id N, Field_Offset Offset)
{
const Field_Offset L = Slot_Size / 8;
any_slot slot = *(Slots_Ptr + Node_Offsets_Ptr[N] + Offset / L);
return (slot >> (Offset % L) * (Slot_Size / L)) & 255;
}
INLINE unsigned int
Get_32_Bit_Field (Node_Id N, Field_Offset Offset)
{
any_slot slot = *(Slots_Ptr + Node_Offsets_Ptr[N] + Offset);
return slot;
}
INLINE unsigned int
Get_32_Bit_Field_With_Default (Node_Id N, Field_Offset Offset,
unsigned int Default_Value)
{
any_slot slot = *(Slots_Ptr + Node_Offsets_Ptr[N] + Offset);
return slot == Empty ? Default_Value : slot;
}
INLINE unsigned int
Get_Valid_32_Bit_Field (Node_Id N, Field_Offset Offset)
{
any_slot slot = *(Slots_Ptr + Node_Offsets_Ptr[N] + Offset);
gcc_assert (slot != Empty);
return slot;
}
#ifdef __cplusplus
}
#endif
|
