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
|
-- PSL - Disp nodes
-- Copyright (C) 2002-2016 Tristan Gingold
--
-- GHDL is free software; you can redistribute it and/or modify it under
-- the terms of the GNU General Public License as published by the Free
-- Software Foundation; either version 2, or (at your option) any later
-- version.
--
-- GHDL 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. See the GNU General Public License
-- for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with GHDL; see the file COPYING. If not, write to the Free
-- Software Foundation, 59 Temple Place - Suite 330, Boston, MA
-- 02111-1307, USA.
with Ada.Text_IO; use Ada.Text_IO;
with Types; use Types;
with Name_Table;
with PSL.Errors;
with PSL.Nodes_Meta;
package body PSL.Dump_Tree is
procedure Put_Indent (Indent : Natural) is
begin
Put (String'(1 .. 2 * Indent => ' '));
end Put_Indent;
Hex_Digits : constant array (Integer range 0 .. 15) of Character
:= "0123456789abcdef";
procedure Disp_Uns32 (Val : Uns32)
is
Res : String (1 .. 8);
V : Uns32 := Val;
begin
for I in reverse Res'Range loop
Res (I) := Hex_Digits (Integer (V mod 16));
V := V / 16;
end loop;
Put (Res);
end Disp_Uns32;
procedure Disp_Int32 (Val : Int32)
is
Res : String (1 .. 8);
V : Int32 := Val;
begin
for I in reverse Res'Range loop
Res (I) := Hex_Digits (Integer (V mod 16));
V := V / 16;
end loop;
Put (Res);
end Disp_Int32;
function Image_Boolean (Bool : Boolean) return String is
begin
if Bool then
return "true";
else
return "false";
end if;
end Image_Boolean;
procedure Disp_HDL_Node (Val : HDL_Node)
is
begin
if Dump_Hdl_Node /= null then
Dump_Hdl_Node.all (Val);
else
Disp_Int32 (Val);
end if;
end Disp_HDL_Node;
procedure Disp_Node_Number (N : Node) is
begin
Put ('[');
Disp_Int32 (Int32 (N));
Put (']');
end Disp_Node_Number;
procedure Disp_NFA (Val : NFA) is
begin
Disp_Int32 (Int32 (Val));
end Disp_NFA;
procedure Disp_Header (Msg : String; Indent : Natural) is
begin
Put_Indent (Indent);
Put (Msg);
Put (": ");
end Disp_Header;
function Image_PSL_Presence_Kind (Pres : PSL_Presence_Kind) return String
is
begin
case Pres is
when Present_Pos =>
return "+";
when Present_Neg =>
return "-";
when Present_Unknown =>
return "?";
end case;
end Image_PSL_Presence_Kind;
procedure Disp_Location (Loc : Location_Type) is
begin
Put (PSL.Errors.Image (Loc));
end Disp_Location;
-- procedure Disp_String_Id (N : Node) is
-- begin
-- Put ('"');
-- Put (Str_Table.Image (Get_String_Id (N)));
-- Put ('"');
-- New_Line;
-- end Disp_String_Id;
procedure Disp_Header (N : Node)
is
use Nodes_Meta;
K : Nkind;
begin
if N = Null_Node then
Put_Line ("*null*");
return;
end if;
K := Get_Kind (N);
Put (Get_Nkind_Image (K));
if Has_Identifier (K) then
Put (' ');
Put (Name_Table.Image (Get_Identifier (N)));
end if;
Put (' ');
Disp_Node_Number (N);
New_Line;
end Disp_Header;
procedure Disp_Tree (N : Node; Indent : Natural; Depth : Natural);
procedure Disp_Chain (Tree_Chain: Node; Indent: Natural; Depth : Natural)
is
El: Node;
begin
New_Line;
El := Tree_Chain;
while El /= Null_Node loop
Put_Indent (Indent);
Disp_Tree (El, Indent + 1, Depth);
El := Get_Chain (El);
end loop;
end Disp_Chain;
procedure Disp_Tree (N : Node; Indent : Natural; Depth : Natural) is
begin
Disp_Header (N);
if Depth <= 1 or else N = Null_Node then
return;
end if;
Disp_Header ("location", Indent);
Disp_Location (Get_Location (N));
New_Line;
declare
use Nodes_Meta;
Sub_Indent : constant Natural := Indent + 1;
Fields : constant Fields_Array := Get_Fields (Get_Kind (N));
F : Fields_Enum;
begin
for I in Fields'Range loop
F := Fields (I);
Disp_Header (Get_Field_Image (F), Indent);
case Get_Field_Type (F) is
when Type_Node =>
case Get_Field_Attribute (F) is
when Attr_None =>
Disp_Tree (Get_Node (N, F), Sub_Indent, Depth - 1);
when Attr_Ref =>
Disp_Tree (Get_Node (N, F), Sub_Indent, 0);
when Attr_Chain =>
Disp_Chain (Get_Node (N, F), Sub_Indent, Depth - 1);
when Attr_Chain_Next =>
Disp_Node_Number (Get_Node (N, F));
New_Line;
when Attr_Maybe_Ref | Attr_Of_Ref =>
raise Internal_Error;
end case;
when Type_Boolean =>
Put_Line (Image_Boolean (Get_Boolean (N, F)));
when Type_Int32 =>
Disp_Int32 (Get_Int32 (N, F));
New_Line;
when Type_Uns32 =>
Disp_Uns32 (Get_Uns32 (N, F));
New_Line;
when Type_Name_Id =>
Put_Line (Name_Table.Image (Get_Name_Id (N, F)));
when Type_HDL_Node =>
Disp_HDL_Node (Get_HDL_Node (N, F));
New_Line;
when Type_NFA =>
Disp_NFA (Get_NFA (N, F));
New_Line;
when Type_PSL_Presence_Kind =>
Put (Image_PSL_Presence_Kind (Get_PSL_Presence_Kind (N, F)));
New_Line;
end case;
end loop;
end;
end Disp_Tree;
procedure Dump_Tree (N : Node; Full : Boolean := False) is
begin
if Full then
Disp_Tree (N, 0, 20);
else
Disp_Tree (N, 0, 0);
end if;
end Dump_Tree;
end PSL.Dump_Tree;
|
