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
|
-- EMACS settings: -*- tab-width: 2;indent-tabs-mode: t -*-
-- vim: tabstop=2:shiftwidth=2:noexpandtab
-- kate: tab-width 2;replace-tabs off;indent-width 2;
-- =============================================================================
-- Authors: Patrick Lehmann
--
-- Package: Protected type implementations.
--
-- Description:
-- -------------------------------------
-- .. TODO:: No documentation available.
--
-- License:
-- =============================================================================
-- Copyright 2007-2016 Technische Universitaet Dresden - Germany,
-- Chair for VLSI-Design, Diagnostics and Architecture
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-- =============================================================================
package corelib_List is
generic (
type ELEMENT_TYPE;
InitialMasterListSize : POSITIVE := 4;
InitialChunkListSize : POSITIVE := 8;
MasterListResize : POSITIVE := 8;
ChunkListResize : POSITIVE := 8
);
type ELEMENT_ARRAY is array(NATURAL range <>) of ELEMENT_TYPE;
-- protected list implementation
type PT_LIST is protected
procedure Init;
-- procedure Clear;
procedure Append(Value : ELEMENT_TYPE);
impure function Append(Value : ELEMENT_TYPE) return NATURAL;
procedure Append(Values : ELEMENT_ARRAY);
impure function Append(Values : ELEMENT_ARRAY) return NATURAL;
-- procedure Prepend(Value : ELEMENT_TYPE);
-- impure function Prepend(Value : ELEMENT_TYPE) return NATURAL;
-- procedure Prepend(Values : ELEMENT_ARRAY);
-- impure function Prepend(Values : ELEMENT_ARRAY) return NATURAL;
-- procedure Insert(Index : NATURAL; Value : ELEMENT_TYPE);
-- procedure Insert(Index : NATURAL; Values : ELEMENT_ARRAY);
impure function IndexOf(Value : ELEMENT_TYPE) return INTEGER;
procedure Set(Index : NATURAL; Value : ELEMENT_TYPE);
impure function Set(Index : NATURAL; Value : ELEMENT_TYPE) return ELEMENT_TYPE;
impure function Get(Index : NATURAL) return ELEMENT_TYPE;
procedure RemoveAt(Index : NATURAL);
impure function RemoveAt(Index : NATURAL) return ELEMENT_TYPE;
procedure Remove(Value : ELEMENT_TYPE);
impure function Remove(Value : ELEMENT_TYPE) return NATURAL;
-- procedure Remove(Values : ELEMENT_ARRAY);
impure function ToArray(Start : INTEGER := 0; Stop : INTEGER := -1; COUNT : NATURAL := 0) return ELEMENT_ARRAY;
impure function Count return natural;
impure function Size return positive;
-- procedure Resize(Size : positive);
end protected;
end package;
package body corelib_List is
-- protected list implementation
type PT_LIST is protected body
subtype T_Chunk is ELEMENT_ARRAY;
type P_Chunk is access T_Chunk;
type T_MasterListItem is record
Count : NATURAL;
Pointer : P_Chunk;
end record;
type T_MasterList is array(NATURAL range <>) of T_MasterListItem;
type P_MasterList is access T_MasterList;
type T_AddressTuple is record
MasterIndex : INTEGER;
ChunkIndex : INTEGER;
ListIndex : INTEGER;
end record;
variable I_Count : NATURAL := 0;
variable I_MasterList_Size : POSITIVE := InitialMasterListSize;
variable I_MasterList_Count : NATURAL := 0;
variable I_MasterList_Last : NATURAL := 0;
variable I_MasterList : P_MasterList := null;
procedure Init is
begin
I_Count := 0;
I_MasterList_Size := InitialMasterListSize;
I_MasterList_Count := 1;
I_MasterList_Last := 0;
I_MasterList := new T_MasterList(0 to InitialMasterListSize - 1);
I_MasterList(0).Count := 0;
I_MasterList(0).Pointer := new T_Chunk(0 to InitialChunkListSize - 1);
end procedure;
procedure CheckResize(Size : positive) is
variable i : NATURAL;
variable j : NATURAL;
variable Remaining : INTEGER;
variable New_Chunks : NATURAL;
variable New_MasterList_Size : NATURAL;
variable New_MasterList : P_MasterList;
begin
Remaining := Size;
i := I_MasterList_Last;
Remaining := Remaining - (InitialChunkListSize - I_MasterList(i).Count);
New_Chunks := (Remaining + ChunkListResize - 1) / ChunkListResize;
if ((I_MasterList_Size - I_MasterList_Count) < New_Chunks) then
New_MasterList_Size := I_MasterList_Size + ((New_Chunks + MasterListResize - 1) / MasterListResize) * MasterListResize;
New_MasterList := new T_MasterList(0 to New_MasterList_Size - 1);
for j in 0 to I_MasterList_Count - 1 loop
New_MasterList(j).Count := I_MasterList(j).Count;
New_MasterList(j).Pointer := I_MasterList(j).Pointer;
end loop;
deallocate(I_MasterList);
I_MasterList := New_MasterList;
I_MasterList_Size := New_MasterList_Size;
end if;
for j in I_MasterList_Count to I_MasterList_Count + New_Chunks - 1 loop
I_MasterList(j).Count := 0;
I_MasterList(j).Pointer := new T_Chunk(0 to InitialChunkListSize - 1);
end loop;
I_MasterList_Count := I_MasterList_Count + New_Chunks;
end procedure;
-- procedure Clear is
-- begin
-- end procedure;
procedure Append(Value : ELEMENT_TYPE) is
variable i : NATURAL;
variable j : NATURAL;
begin
CheckResize(1);
i := I_MasterList_Last;
if (I_MasterList(i).Count >= InitialChunkListSize) then
i := i + 1;
I_MasterList_Last := i;
end if;
j := I_MasterList(i).Count;
I_MasterList(i).Pointer(j) := Value;
I_MasterList(i).Count := j + 1;
I_Count := I_Count + 1;
end procedure;
impure function Append(Value : ELEMENT_TYPE) return NATURAL is
begin
Append(Value);
return I_Count - 1;
end function;
procedure Append(Values : ELEMENT_ARRAY) is
begin
end procedure;
impure function Append(Values : ELEMENT_ARRAY) return NATURAL is
begin
Append(Values);
return I_Count - Values'length;
end function;
-- procedure Prepend(Value : ELEMENT_TYPE) is
-- begin
-- end procedure;
-- impure function Prepend(Value : ELEMENT_TYPE) return NATURAL is
-- begin
-- end function;
-- procedure Prepend(Values : ELEMENT_ARRAY) is
-- begin
-- end procedure;
-- impure function Prepend(Values : ELEMENT_ARRAY) return NATURAL is
-- begin
-- end function;
-- procedure Insert(Index : NATURAL; Value : ELEMENT_TYPE) is
-- begin
-- end procedure;
-- procedure Insert(Index : NATURAL; Values : ELEMENT_ARRAY) is
-- begin
-- end procedure;
impure function AddressOf(Value : ELEMENT_TYPE) return T_AddressTuple is
variable k : NATURAL;
begin
k := 0;
for i in 0 to I_MasterList_Count - 1 loop
for j in 0 to I_MasterList(i).Count - 1 loop
if (I_MasterList(i).Pointer(j) = Value) then
return (i, j, k);
end if;
k := k + 1;
end loop;
end loop;
return (-1, -1, -1);
end function;
impure function AddressOf(Index : NATURAL) return T_AddressTuple is
variable j : NATURAL;
variable k : NATURAL;
begin
if (Index >= I_Count) then
report "Index is out of range." severity ERROR;
return (-1, -1, -1);
end if;
k := Index;
for i in 0 to I_MasterList_Count - 1 loop
j := I_MasterList(i).Count;
if (k < j) then
return (i, k, Index);
else
k := k - j;
end if;
end loop;
return (-1, -1, -1);
end function;
impure function IndexOf(Value : ELEMENT_TYPE) return INTEGER is
constant idx : T_AddressTuple := AddressOf(Value);
begin
return idx.ListIndex;
end function;
procedure Set(Index : NATURAL; Value : ELEMENT_TYPE) is
constant idx : T_AddressTuple := AddressOf(Index);
begin
if (idx.ListIndex /= -1) then
I_MasterList(idx.MasterIndex).Pointer(idx.ChunkIndex) := Value;
end if;
end procedure;
impure function Set(Index : NATURAL; Value : ELEMENT_TYPE) return ELEMENT_TYPE is
constant idx : T_AddressTuple := AddressOf(Index);
variable old : ELEMENT_TYPE;
begin
if (idx.ListIndex /= -1) then
old := I_MasterList(idx.MasterIndex).Pointer(idx.ChunkIndex);
I_MasterList(idx.MasterIndex).Pointer(idx.ChunkIndex) := Value;
end if;
return old;
end function;
impure function Get(Index : NATURAL) return ELEMENT_TYPE is
constant idx : T_AddressTuple := AddressOf(Index);
variable Empty : ELEMENT_TYPE;
begin
if (idx.ListIndex /= -1) then
return I_MasterList(idx.MasterIndex).Pointer(idx.ChunkIndex);
end if;
return Empty;
end function;
procedure RemoveChunk(ChunkIndex : NATURAL) is
begin
deallocate(I_MasterList(ChunkIndex).Pointer);
for i in ChunkIndex to I_MasterList_Count - 2 loop
I_MasterList(i).Count := I_MasterList(i + 1).Count;
I_MasterList(i).Pointer := I_MasterList(i + 1).Pointer;
end loop;
I_MasterList_Count := I_MasterList_Count - 1;
end procedure;
procedure Remove(Idx : T_AddressTuple) is
constant i : INTEGER := idx.MasterIndex;
begin
if ((Idx.ChunkIndex = 0) and (I_MasterList(i).Count = 1)) then
RemoveChunk(i);
else
for j in Idx.ChunkIndex to InitialChunkListSize - 2 loop
I_MasterList(i).Pointer(j) := I_MasterList(i).Pointer(j + 1);
end loop;
I_MasterList(i).Count := I_MasterList(i).Count - 1;
end if;
I_Count := I_Count - 1;
end procedure;
procedure RemoveAt(Index : NATURAL) is
begin
Remove(AddressOf(Index));
end procedure;
impure function RemoveAt(Index : NATURAL) return ELEMENT_TYPE is
constant idx : T_AddressTuple := AddressOf(Index);
constant i : INTEGER := idx.MasterIndex;
constant j : INTEGER := idx.ChunkIndex;
constant Value : ELEMENT_TYPE := I_MasterList(i).Pointer(j);
begin
Remove(idx);
return Value;
end function;
procedure Remove(Value : ELEMENT_TYPE) is
begin
Remove(AddressOf(Value));
end procedure;
impure function Remove(Value : ELEMENT_TYPE) return NATURAL is
constant idx : T_AddressTuple := AddressOf(Value);
begin
Remove(idx);
return idx.ListIndex;
end function;
-- procedure Remove(Values : ELEMENT_ARRAY) is
-- begin
-- end procedure;
impure function ToArray(Start : INTEGER := 0; Stop : INTEGER := -1; COUNT : NATURAL := 0) return ELEMENT_ARRAY is
variable Result : ELEMENT_ARRAY(0 to I_Count - 1);
variable k : NATURAL;
begin
k := 0;
for i in 0 to I_MasterList_Count - 1 loop
for j in 0 to I_MasterList(i).Count - 1 loop
Result(k) := I_MasterList(i).Pointer(j);
k := k + 1;
end loop;
end loop;
return Result;
end function;
impure function Count return natural is
begin
return I_Count;
end function;
impure function Size return positive is
begin
return I_MasterList_Size * InitialChunkListSize;
end function;
-- procedure Resize(Size : positive) is
-- begin
-- end procedure;
end protected body;
end package body;
|
