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
388
389
390
|
-- Iterators for elements of a netlist.
-- Copyright (C) 2017 Tristan Gingold
--
-- This file is part of GHDL.
--
-- This program 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 of the License, or
-- (at your option) any later version.
--
-- This program 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 this program; if not, write to the Free Software
-- Foundation, Inc., 51 Franklin Street - Fifth Floor, Boston,
-- MA 02110-1301, USA.
with Netlists.Utils; use Netlists.Utils;
package body Netlists.Iterators is
function Sub_Modules (M : Module) return Modules_Iterator
is
pragma Assert (Is_Valid (M));
begin
return Modules_Iterator'(M => M);
end Sub_Modules;
function Modules_First (It : Modules_Iterator) return Modules_Cursor is
begin
return Modules_Cursor'(M => Get_First_Sub_Module (It.M));
end Modules_First;
function Modules_Next (It : Modules_Iterator; Cur : Modules_Cursor)
return Modules_Cursor
is
pragma Unreferenced (It);
begin
return Modules_Cursor'(M => Get_Next_Sub_Module (Cur.M));
end Modules_Next;
function Modules_Has_Element (It : Modules_Iterator; Cur : Modules_Cursor)
return Boolean
is
pragma Unreferenced (It);
begin
return Cur.M /= No_Module;
end Modules_Has_Element;
function Modules_Element (It : Modules_Iterator; Cur : Modules_Cursor)
return Module
is
pragma Unreferenced (It);
begin
return Cur.M;
end Modules_Element;
function Ports_Desc_First (It : Ports_Desc_Iterator)
return Ports_Desc_Cursor is
begin
return Ports_Desc_Cursor'
(Idx => Get_First_Port_Desc (It.M),
Num => Get_Nbr_Inputs (It.M) + Get_Nbr_Outputs (It.M));
end Ports_Desc_First;
function Ports_Desc_Next (It : Ports_Desc_Iterator; Cur : Ports_Desc_Cursor)
return Ports_Desc_Cursor
is
pragma Unreferenced (It);
begin
return Ports_Desc_Cursor'(Idx => Cur.Idx + 1,
Num => Cur.Num - 1);
end Ports_Desc_Next;
function Ports_Desc_Has_Element
(It : Ports_Desc_Iterator; Cur : Ports_Desc_Cursor) return Boolean
is
pragma Unreferenced (It);
begin
return Cur.Num > 0;
end Ports_Desc_Has_Element;
function Ports_Desc_Element
(It : Ports_Desc_Iterator; Cur : Ports_Desc_Cursor) return Port_Desc
is
pragma Unreferenced (It);
begin
return Get_Port_Desc (Cur.Idx);
end Ports_Desc_Element;
function Ports_Desc (M : Module) return Ports_Desc_Iterator
is
pragma Assert (Is_Valid (M));
begin
return Ports_Desc_Iterator'(M => M);
end Ports_Desc;
function Params_Desc_First (It : Params_Desc_Iterator)
return Params_Desc_Cursor is
begin
return Params_Desc_Cursor'
(Idx => 0,
Num => Get_Nbr_Params (It.M));
end Params_Desc_First;
function Params_Desc_Next
(It : Params_Desc_Iterator; Cur : Params_Desc_Cursor)
return Params_Desc_Cursor
is
pragma Unreferenced (It);
begin
return Params_Desc_Cursor'(Idx => Cur.Idx + 1,
Num => Cur.Num - 1);
end Params_Desc_Next;
function Params_Desc_Has_Element
(It : Params_Desc_Iterator; Cur : Params_Desc_Cursor) return Boolean
is
pragma Unreferenced (It);
begin
return Cur.Num > 0;
end Params_Desc_Has_Element;
function Params_Desc_Element
(It : Params_Desc_Iterator; Cur : Params_Desc_Cursor) return Param_Desc is
begin
return Get_Param_Desc (It.M, Cur.Idx);
end Params_Desc_Element;
function Params_Desc (M : Module) return Params_Desc_Iterator is
begin
return Params_Desc_Iterator'(M => M);
end Params_Desc;
function Instances_First (It : Instances_Iterator)
return Instances_Cursor is
begin
return Instances_Cursor'(Inst => Get_First_Instance (It.M));
end Instances_First;
function Instances_Next (It : Instances_Iterator; Cur : Instances_Cursor)
return Instances_Cursor
is
pragma Unreferenced (It);
begin
return Instances_Cursor'(Inst => Get_Next_Instance (Cur.Inst));
end Instances_Next;
function Instances_Has_Element
(It : Instances_Iterator; Cur : Instances_Cursor) return Boolean
is
pragma Unreferenced (It);
begin
return Cur.Inst /= No_Instance;
end Instances_Has_Element;
function Instances_Element
(It : Instances_Iterator; Cur : Instances_Cursor) return Instance
is
pragma Unreferenced (It);
begin
return Cur.Inst;
end Instances_Element;
function Instances (M : Module) return Instances_Iterator is
begin
return Instances_Iterator'(M => M);
end Instances;
function Inputs_First (It : Inputs_Iterator) return Inputs_Cursor is
begin
return Inputs_Cursor'(Idx => 0,
Nbr => Get_Nbr_Inputs (It.Inst));
end Inputs_First;
function Inputs_Next (It : Inputs_Iterator; Cur : Inputs_Cursor)
return Inputs_Cursor
is
pragma Unreferenced (It);
begin
return Inputs_Cursor'(Idx => Cur.Idx + 1,
Nbr => Cur.Nbr);
end Inputs_Next;
function Inputs_Has_Element (It : Inputs_Iterator; Cur : Inputs_Cursor)
return Boolean
is
pragma Unreferenced (It);
begin
return Cur.Idx < Cur.Nbr;
end Inputs_Has_Element;
function Inputs_Element (It : Inputs_Iterator; Cur : Inputs_Cursor)
return Input is
begin
return Get_Input (It.Inst, Cur.Idx);
end Inputs_Element;
function Inputs (Inst : Instance) return Inputs_Iterator is
begin
return Inputs_Iterator'(Inst => Inst);
end Inputs;
function Outputs_First (It : Outputs_Iterator) return Outputs_Cursor is
begin
return Outputs_Cursor'(Idx => 0,
Nbr => Get_Nbr_Outputs (It.Inst));
end Outputs_First;
function Outputs_Next (It : Outputs_Iterator; Cur : Outputs_Cursor)
return Outputs_Cursor
is
pragma Unreferenced (It);
begin
return Outputs_Cursor'(Idx => Cur.Idx + 1,
Nbr => Cur.Nbr);
end Outputs_Next;
function Outputs_Has_Element (It : Outputs_Iterator; Cur : Outputs_Cursor)
return Boolean
is
pragma Unreferenced (It);
begin
return Cur.Idx < Cur.Nbr;
end Outputs_Has_Element;
function Outputs_Element (It : Outputs_Iterator; Cur : Outputs_Cursor)
return Net is
begin
return Get_Output (It.Inst, Cur.Idx);
end Outputs_Element;
function Outputs (Inst : Instance) return Outputs_Iterator is
begin
return Outputs_Iterator'(Inst => Inst);
end Outputs;
function Params_First (It : Params_Iterator) return Params_Cursor is
begin
return Params_Cursor'(Idx => 0,
Nbr => Get_Nbr_Params (It.Inst));
end Params_First;
function Params_Next (It : Params_Iterator; Cur : Params_Cursor)
return Params_Cursor
is
pragma Unreferenced (It);
begin
return Params_Cursor'(Idx => Cur.Idx + 1,
Nbr => Cur.Nbr - 1);
end Params_Next;
function Params_Has_Element (It : Params_Iterator; Cur : Params_Cursor)
return Boolean
is
pragma Unreferenced (It);
begin
return Cur.Nbr > 0;
end Params_Has_Element;
function Params (Inst : Instance) return Params_Iterator is
begin
return Params_Iterator'(Inst => Inst);
end Params;
function Get_Param_Idx (Cur : Params_Cursor) return Param_Idx is
begin
return Cur.Idx;
end Get_Param_Idx;
function Nets_First (It : Nets_Iterator) return Nets_Cursor
is
Inst : Instance;
Num : Port_Nbr;
begin
Inst := Get_Self_Instance (It.M);
loop
if Inst = No_Instance then
-- No instance.
return Nets_Cursor'(Inst => No_Instance,
N => No_Net,
Num => 0);
end if;
Num := Get_Nbr_Outputs (Inst);
if Num = 0 then
-- No output for this instance.
Inst := Get_Next_Instance (Inst);
else
return Nets_Cursor'(Inst => Inst,
N => Get_First_Output (Inst),
Num => Num);
end if;
end loop;
end Nets_First;
function Nets_Next (It : Nets_Iterator; Cur : Nets_Cursor)
return Nets_Cursor
is
pragma Unreferenced (It);
begin
if Cur.Num > 1 then
-- Next net for the instance.
return Nets_Cursor'(Inst => Cur.Inst,
N => Cur.N + 1,
Num => Cur.Num - 1);
else
-- Next instance.
declare
Inst : Instance;
Num : Port_Nbr;
begin
Inst := Cur.Inst;
loop
Inst := Get_Next_Instance (Inst);
exit when Inst = No_Instance;
Num := Get_Nbr_Outputs (Inst);
if Num /= 0 then
return Nets_Cursor'(Inst => Inst,
N => Get_First_Output (Inst),
Num => Num);
end if;
end loop;
end;
return Nets_Cursor'(Inst => No_Instance,
N => No_Net,
Num => 0);
end if;
end Nets_Next;
function Nets_Has_Element (It : Nets_Iterator; Cur : Nets_Cursor)
return Boolean
is
pragma Unreferenced (It);
begin
return Cur.Num > 0 or Cur.Inst /= No_Instance;
end Nets_Has_Element;
function Nets_Element (It : Nets_Iterator; Cur : Nets_Cursor)
return Net
is
pragma Unreferenced (It);
begin
return Cur.N;
end Nets_Element;
function Nets (M : Module) return Nets_Iterator
is
pragma Assert (Is_Valid (M));
begin
return Nets_Iterator'(M => M);
end Nets;
function Sinks_First (It : Sinks_Iterator) return Sinks_Cursor is
begin
return Sinks_Cursor'(S => Get_First_Sink (It.N));
end Sinks_First;
function Sinks_Next (It : Sinks_Iterator; Cur : Sinks_Cursor)
return Sinks_Cursor
is
pragma Unreferenced (It);
begin
return Sinks_Cursor'(S => Get_Next_Sink (Cur.S));
end Sinks_Next;
function Sinks_Has_Element (It : Sinks_Iterator; Cur : Sinks_Cursor)
return Boolean
is
pragma Unreferenced (It);
begin
return Cur.S /= No_Input;
end Sinks_Has_Element;
function Sinks_Element (It : Sinks_Iterator; Cur : Sinks_Cursor)
return Input
is
pragma Unreferenced (It);
begin
return Cur.S;
end Sinks_Element;
function Sinks (N : Net) return Sinks_Iterator is
begin
pragma Assert (Is_Valid (N));
return Sinks_Iterator'(N => N);
end Sinks;
end Netlists.Iterators;
|