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
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387 | ------------------------------------------------------------------------------
-- --
-- Libadalang Tools --
-- --
-- Copyright (C) 2021, AdaCore --
-- --
-- Libadalang Tools is free software; you can redistribute it and/or modi- --
-- fy it under terms of the GNU General Public License as published by --
-- the Free Software Foundation; either version 3, or (at your option) any --
-- later version. This software is distributed in the hope that it will be --
-- useful but WITHOUT ANY WARRANTY; without even the implied warranty of --
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are --
-- granted additional permissions described in the GCC Runtime Library --
-- Exception, version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and a --
-- copy of the GCC Runtime Library Exception along with this program; see --
-- the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
------------------------------------------------------------------------------
with Ada.Characters.Conversions; use Ada;
with Ada.Wide_Characters.Handling;
package body LAL_Extensions is
use Ada_Node_Vectors;
function Childx
(Node : Ada_Node'Class;
Index : Positive) return Ada_Node
is
begin
return Child (Ada_Node (Node), Index);
end Childx;
function Contains_Kind
(Node : Ada_Node'Class; Kind : Ada_Node_Kind_Type) return Boolean
is
function Visit (Node : Ada_Node'Class) return Visit_Status is
(if Node.Kind = Kind then Stop else Into);
begin
return Traverse (Node, Visit'Access) = Stop;
end Contains_Kind;
procedure Find_Iter
(Node : Ada_Node'Class;
Predicate : not null access function
(Node : Ada_Node'Class) return Boolean;
Visit : not null access procedure
(Node : Ada_Node'Class))
is
function Visit_If_Predicate
(Node : Ada_Node'Class) return Visit_Status;
function Visit_If_Predicate
(Node : Ada_Node'Class) return Visit_Status is
begin
if Predicate (Node) then
Visit (Node);
end if;
return Into;
end Visit_If_Predicate;
begin
Traverse (Node, Visit_If_Predicate'Access);
end Find_Iter;
procedure Find_Iter
(Node : Ada_Node'Class;
Node_Kind : Ada_Node_Kind_Type;
Visit : not null access procedure
(Node : Ada_Node'Class))
is
function Kind_Equal
(Node : Ada_Node'Class) return Boolean is
(Kind (Node) = Node_Kind);
begin
Find_Iter (Node, Kind_Equal'Access, Visit);
end Find_Iter;
function Find_All
(Node : Ada_Node'Class;
Predicate : not null access function
(Node : Ada_Node'Class) return Boolean)
return Ada_Node_Array
is
Result_Vector : Ada_Node_Vector;
procedure Append (Node : Ada_Node'Class);
procedure Append (Node : Ada_Node'Class) is
begin
Append (Result_Vector, Node.As_Ada_Node);
end Append;
begin
Find_Iter (Node, Predicate, Append'Access);
return To_Array (Result_Vector);
end Find_All;
function Find_All
(Node : Ada_Node'Class;
Node_Kind : Ada_Node_Kind_Type) return Ada_Node_Array
is
Result_Vector : Ada_Node_Vector;
procedure Append (Node : Ada_Node'Class);
procedure Append (Node : Ada_Node'Class) is
begin
Append (Result_Vector, Node.As_Ada_Node);
end Append;
begin
Find_Iter (Node, Node_Kind, Append'Access);
return To_Array (Result_Vector);
end Find_All;
function Token_Text (Tok : Token_Reference) return W_Str is
begin
return Text_To_W_Str (Text (Tok));
end Token_Text;
function L_Token_Text (Tok : Token_Reference) return W_Str is
use Ada.Wide_Characters.Handling;
begin
return To_Lower (Token_Text (Tok));
end L_Token_Text;
function Id_Name
(Nm : Ada_Node'Class)
return W_Str
is
begin
if Nm.Kind = Ada_Defining_Name then
return Id_Name (Nm.As_Defining_Name.F_Name);
else
return Text_To_W_Str (Text (Nm.As_Single_Tok_Node));
end if;
end Id_Name;
function L_Name
(Nm : Ada_Node'Class)
return W_Str
is
use Ada.Wide_Characters.Handling;
begin
return To_Lower (Id_Name (Nm));
end L_Name;
function Label_Name
(L : Ada_Node'Class)
return W_Str
is
begin
return Text_To_W_Str (Text (F_Name (F_Decl (L.As_Label))));
end Label_Name;
function Full_Name (Nm : Name) return W_Str is
begin
case Kind (Nm) is
when Ada_Dotted_Name =>
return Full_Name (Nm.As_Dotted_Name.F_Prefix) &
"." & Full_Name (Nm.As_Dotted_Name.F_Suffix.As_Name);
when Ada_Identifier | Ada_String_Literal =>
return Id_Name (Nm);
when Ada_Defining_Name =>
return Full_Name (Nm.As_Defining_Name.F_Name);
when others =>
raise Program_Error with
"Full_Name of " & Nm.Image;
end case;
end Full_Name;
function L_Full_Name (Nm : Name) return W_Str is
use Ada.Wide_Characters.Handling;
begin
return To_Lower (Full_Name (Nm));
end L_Full_Name;
function Get_Def_Name (Decl : Ada_Node'Class) return Defining_Name is
begin
case Kind (Decl) is
when Ada_Compilation_Unit =>
return Get_Def_Name (Decl.As_Compilation_Unit.F_Body);
when Ada_Library_Item =>
return Get_Def_Name (Decl.As_Library_Item.F_Item);
when Ada_Subunit =>
return Get_Def_Name (Decl.As_Subunit.F_Body);
when Ada_Basic_Decl =>
declare
D : constant Defining_Name_Array :=
Decl.As_Basic_Decl.P_Defining_Names;
begin
pragma Assert (D'Length = 1);
return D (1);
end;
when others =>
raise Program_Error with
"Get_Def_Name of " & Decl.Image;
end case;
end Get_Def_Name;
function Get_Aspects (Decl : Basic_Decl) return Aspect_Spec is
begin
return Decl.F_Aspects;
end Get_Aspects;
function G_Formal_Part
(Node : Ada_Node'Class) return Generic_Formal_Part is
begin
case Kind (Node) is
when Ada_Generic_Package_Decl =>
return Node.As_Generic_Package_Decl.F_Formal_Part;
when Ada_Generic_Subp_Decl =>
return Node.As_Generic_Subp_Decl.F_Formal_Part;
when others => raise Program_Error;
end case;
end G_Formal_Part;
function Vis_Part
(Node : Ada_Node'Class) return Public_Part
is
-- I'm confused about Base_Package_Decl
begin
case Kind (Node) is
when Ada_Package_Decl =>
return Node.As_Base_Package_Decl.F_Public_Part;
when Ada_Generic_Package_Decl =>
return
Node.As_Generic_Package_Decl.F_Package_Decl.F_Public_Part;
when Ada_Task_Def =>
return Node.As_Task_Def.F_Public_Part;
when Ada_Protected_Def =>
return Node.As_Protected_Def.F_Public_Part;
when Ada_Single_Task_Decl => -- This will recurse 2 levels!
return Vis_Part (Node.As_Single_Task_Decl.F_Task_Type);
when Ada_Task_Type_Decl =>
return Vis_Part (Node.As_Task_Type_Decl.F_Definition);
when Ada_Single_Protected_Decl => -- This will recurse 2 levels!
return Vis_Part (Node.As_Single_Protected_Decl.F_Definition);
-- Why doesn't this parallel tasks???
when Ada_Protected_Type_Decl =>
return Vis_Part (Node.As_Protected_Type_Decl.F_Definition);
when others => raise Program_Error;
end case;
end Vis_Part;
function Priv_Part
(Node : Ada_Node'Class) return Private_Part is
begin
case Kind (Node) is
when Ada_Package_Decl =>
return Node.As_Base_Package_Decl.F_Private_Part;
when Ada_Generic_Package_Decl =>
return
Node.As_Generic_Package_Decl.F_Package_Decl.F_Private_Part;
when Ada_Task_Def =>
return Node.As_Task_Def.F_Private_Part;
when Ada_Protected_Def =>
return Node.As_Protected_Def.F_Private_Part;
when Ada_Single_Task_Decl => -- This will recurse 2 levels!
return Priv_Part (Node.As_Single_Task_Decl.F_Task_Type);
when Ada_Task_Type_Decl =>
return Priv_Part (Node.As_Task_Type_Decl.F_Definition);
when Ada_Single_Protected_Decl => -- This will recurse 2 levels!
return Priv_Part (Node.As_Single_Protected_Decl.F_Definition);
-- Why doesn't this parallel tasks???
when Ada_Protected_Type_Decl =>
return Priv_Part (Node.As_Protected_Type_Decl.F_Definition);
when others => raise Program_Error;
end case;
end Priv_Part;
function Body_Decls
(Node : Ada_Node'Class) return Declarative_Part is
begin
case Kind (Node) is
when Ada_Entry_Body => return Node.As_Entry_Body.F_Decls;
when Ada_Package_Body => return Node.As_Package_Body.F_Decls;
when Ada_Protected_Body => return Node.As_Protected_Body.F_Decls;
when Ada_Subp_Body => return Node.As_Subp_Body.F_Decls;
when Ada_Task_Body => return Node.As_Task_Body.F_Decls;
when others => raise Program_Error;
end case;
end Body_Decls;
function Is_Program_Unit (Node : Ada_Node) return Boolean is
begin
case Kind (Node) is
when Ada_Entry_Decl =>
return Kind (Parent (Parent (Parent (Node)))) = Ada_Protected_Def;
when Ada_Task_Type_Decl |
Ada_Protected_Type_Decl |
Ada_Single_Task_Decl |
Ada_Single_Protected_Decl |
Ada_Subp_Decl |
Ada_Abstract_Subp_Decl |
-- But not Ada_Null_Subp_Decl
Ada_Subp_Body |
Ada_Package_Decl |
Ada_Package_Body |
Ada_Task_Body |
Ada_Protected_Body |
Ada_Entry_Body |
Ada_Subp_Body_Stub |
Ada_Package_Body_Stub |
Ada_Task_Body_Stub |
Ada_Protected_Body_Stub |
Ada_Generic_Subp_Decl |
Ada_Generic_Package_Decl =>
return True;
when others => return False;
end case;
end Is_Program_Unit;
function Get_Subp_Spec (Node : Ada_Node'Class) return Subp_Spec is
begin
case Kind (Node) is
when Ada_Classic_Subp_Decl =>
return Node.As_Classic_Subp_Decl.F_Subp_Spec;
when Ada_Generic_Subp_Decl =>
return Node.As_Generic_Subp_Decl.F_Subp_Decl.F_Subp_Spec;
when Ada_Subp_Body_Stub =>
return Node.As_Subp_Body_Stub.F_Subp_Spec;
when Ada_Base_Subp_Body =>
return Node.As_Base_Subp_Body.F_Subp_Spec;
when Ada_Access_To_Subp_Def =>
return Node.As_Access_To_Subp_Def.F_Subp_Spec;
when others => raise Program_Error;
end case;
end Get_Subp_Spec;
function Xref (Node : Ada_Node'Class) return Defining_Name is
begin
case Node.Kind is
when Ada_Identifier =>
return Node.As_Identifier.P_Referenced_Defining_Name;
when Ada_Dotted_Name => return Xref (Node.As_Dotted_Name.F_Suffix);
when others => raise Program_Error;
end case;
end Xref;
function Adds_New_Nesting_Level (Node : Ada_Node) return Boolean is
begin
case Kind (Node) is
when Ada_Subp_Body |
Ada_Package_Decl |
Ada_Package_Body |
Ada_Task_Body |
Ada_Protected_Body |
Ada_Entry_Body |
Ada_Generic_Package_Decl |
Ada_Begin_Block |
Ada_Decl_Block |
Ada_Case_Stmt |
Ada_Select_Stmt |
Ada_For_Loop_Stmt |
Ada_Loop_Stmt |
Ada_While_Loop_Stmt |
Ada_Accept_Stmt |
Ada_Accept_Stmt_With_Stmts |
Ada_If_Stmt =>
return True;
when others => return False;
end case;
end Adds_New_Nesting_Level;
function Text_To_W_Str (X : Text_Type) return W_Str is
begin
pragma Assert (Characters.Conversions.Is_Wide_String (X));
return Characters.Conversions.To_Wide_String (X);
end Text_To_W_Str;
end LAL_Extensions;
|