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
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
|
-- GHDL Run Time (GRT) - variable strings.
-- Copyright (C) 2002 - 2014 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 GCC; see the file COPYING. If not, write to the Free
-- Software Foundation, 59 Temple Place - Suite 330, Boston, MA
-- 02111-1307, USA.
--
-- As a special exception, if other files instantiate generics from this
-- unit, or you link this unit with other files to produce an executable,
-- this unit does not by itself cause the resulting executable to be
-- covered by the GNU General Public License. This exception does not
-- however invalidate any other reasons why the executable file might be
-- covered by the GNU Public License.
with System.Storage_Elements; -- Work around GNAT bug.
pragma Unreferenced (System.Storage_Elements);
with Grt.Errors; use Grt.Errors;
with Grt.C; use Grt.C;
package body Grt.Vstrings is
procedure Free (Fs : Fat_String_Acc);
pragma Import (C, Free);
function Malloc (Len : Natural) return Fat_String_Acc;
pragma Import (C, Malloc);
function Realloc (Ptr : Fat_String_Acc; Len : Natural)
return Fat_String_Acc;
pragma Import (C, Realloc);
procedure Free (Vstr : in out Vstring) is
begin
Free (Vstr.Str);
Vstr := (Str => null,
Max => 0,
Len => 0);
end Free;
procedure Reset (Vstr : in out Vstring) is
begin
Vstr.Len := 0;
end Reset;
procedure Grow (Vstr : in out Vstring; Sum : Natural)
is
Nlen : constant Natural := Vstr.Len + Sum;
Nmax : Natural;
begin
Vstr.Len := Nlen;
if Nlen <= Vstr.Max then
return;
end if;
if Vstr.Max = 0 then
Nmax := 32;
else
Nmax := Vstr.Max;
end if;
while Nmax < Nlen loop
Nmax := Nmax * 2;
end loop;
Vstr.Str := Realloc (Vstr.Str, Nmax);
if Vstr.Str = null then
Internal_Error ("grt.vstrings.grow: memory exhausted");
end if;
Vstr.Max := Nmax;
end Grow;
procedure Append (Vstr : in out Vstring; C : Character)
is
begin
Grow (Vstr, 1);
Vstr.Str (Vstr.Len) := C;
end Append;
procedure Append (Vstr : in out Vstring; Str : String)
is
S : constant Natural := Vstr.Len;
begin
Grow (Vstr, Str'Length);
Vstr.Str (S + 1 .. S + Str'Length) := Str;
end Append;
procedure Append (Vstr : in out Vstring; Str : Ghdl_C_String)
is
S : constant Natural := Vstr.Len;
L : constant Natural := strlen (Str);
begin
Grow (Vstr, L);
Vstr.Str (S + 1 .. S + L) := Str (1 .. L);
end Append;
function Length (Vstr : Vstring) return Natural is
begin
return Vstr.Len;
end Length;
procedure Truncate (Vstr : in out Vstring; Len : Natural) is
begin
if Len > Vstr.Len then
Internal_Error ("grt.vstrings.truncate: bad len");
end if;
Vstr.Len := Len;
end Truncate;
procedure Put (Stream : FILEs; Vstr : Vstring)
is
S : size_t;
begin
S := size_t (Vstr.Len);
if S > 0 then
S := fwrite (Vstr.Str (1)'Address, S, 1, Stream);
end if;
end Put;
function Get_C_String (Vstr : Vstring) return Ghdl_C_String is
begin
return To_Ghdl_C_String (Vstr.Str.all'Address);
end Get_C_String;
procedure Free (Rstr : in out Rstring) is
begin
Free (Rstr.Str);
Rstr := (Str => null,
Max => 0,
First => 0);
end Free;
function Length (Rstr : Rstring) return Natural is
begin
return Rstr.Max + 1 - Rstr.First;
end Length;
procedure Grow (Rstr : in out Rstring; Min : Natural)
is
Len : constant Natural := Length (Rstr);
Nlen : constant Natural := Len + Min;
Nstr : Fat_String_Acc;
Nfirst : Natural;
Nmax : Natural;
begin
if Nlen <= Rstr.Max then
return;
end if;
if Rstr.Max = 0 then
Nmax := 32;
else
Nmax := Rstr.Max;
end if;
while Nmax < Nlen loop
Nmax := Nmax * 2;
end loop;
Nstr := Malloc (Nmax);
Nfirst := Nmax + 1 - Len;
if Rstr.Str /= null then
Nstr (Nfirst .. Nmax) := Rstr.Str (Rstr.First .. Rstr.Max);
Free (Rstr.Str);
end if;
Rstr := (Str => Nstr,
Max => Nmax,
First => Nfirst);
end Grow;
procedure Prepend (Rstr : in out Rstring; C : Character)
is
begin
Grow (Rstr, 1);
Rstr.First := Rstr.First - 1;
Rstr.Str (Rstr.First) := C;
end Prepend;
procedure Prepend (Rstr : in out Rstring; Str : String)
is
begin
Grow (Rstr, Str'Length);
Rstr.First := Rstr.First - Str'Length;
Rstr.Str (Rstr.First .. Rstr.First + Str'Length - 1) := Str;
end Prepend;
procedure Prepend (Rstr : in out Rstring; Str : Ghdl_C_String)
is
L : constant Natural := strlen (Str);
begin
Grow (Rstr, L);
Rstr.First := Rstr.First - L;
Rstr.Str (Rstr.First .. Rstr.First + L - 1) := Str (1 .. L);
end Prepend;
function Get_Address (Rstr : Rstring) return Address
is
begin
return Rstr.Str (Rstr.First)'Address;
end Get_Address;
procedure Copy (Rstr : Rstring; Str : in out String; Len : out Natural)
is
begin
Len := Length (Rstr);
if Len > Str'Length then
Str := Rstr.Str (Rstr.First .. Rstr.First + Str'Length - 1);
else
Str (Str'First .. Str'First + Len - 1) :=
Rstr.Str (Rstr.First .. Rstr.First + Len - 1);
end if;
end Copy;
procedure Put (Stream : FILEs; Rstr : Rstring)
is
S : size_t;
pragma Unreferenced (S);
begin
S := fwrite (Get_Address (Rstr), size_t (Length (Rstr)), 1, Stream);
end Put;
generic
type Ntype is range <>;
--Max_Len : Natural;
procedure Gen_To_String (Str : out String; First : out Natural; N : Ntype);
procedure Gen_To_String (Str : out String; First : out Natural; N : Ntype)
is
subtype R_Type is String (1 .. Str'Length);
S : R_Type renames Str;
P : Natural := S'Last;
V : Ntype;
begin
if N > 0 then
V := -N;
else
V := N;
end if;
loop
S (P) := Character'Val (48 - (V rem 10));
V := V / 10;
exit when V = 0;
P := P - 1;
end loop;
if N < 0 then
P := P - 1;
S (P) := '-';
end if;
First := P;
end Gen_To_String;
procedure To_String_I32 is new Gen_To_String (Ntype => Ghdl_I32);
procedure To_String (Str : out String; First : out Natural; N : Ghdl_I32)
renames To_String_I32;
procedure To_String_I64 is new Gen_To_String (Ntype => Ghdl_I64);
procedure To_String (Str : out String; First : out Natural; N : Ghdl_I64)
renames To_String_I64;
procedure To_String (Str : out String; Last : out Natural; N : Ghdl_F64)
is
function Trunc (V : Ghdl_F64) return Ghdl_F64;
pragma Import (C, Trunc);
P : Natural := Str'First;
V : Ghdl_F64;
Vmax : Ghdl_F64;
Vd : Ghdl_F64;
Exp : Integer;
D : Integer;
B : Boolean;
begin
-- Handle sign.
if N < 0.0 then
Str (P) := '-';
P := P + 1;
V := -N;
else
V := N;
end if;
-- Compute the mantissa.
-- and normalize V in [0 .. 10.0[
-- FIXME: should do a dichotomy.
if V = 0.0 then
Exp := 0;
elsif V < 1.0 then
Exp := 0;
loop
exit when V >= 1.0;
Exp := Exp - 1;
V := V * 10.0;
end loop;
else
Exp := 0;
loop
exit when V < 10.0;
Exp := Exp + 1;
V := V / 10.0;
end loop;
end if;
Vmax := 10.0 ** (1 - 15);
for I in 0 .. 15 loop
-- Vd := Ghdl_F64'Truncation (V);
Vd := Trunc (V);
Str (P) := Character'Val (48 + Integer (Vd));
P := P + 1;
V := (V - Vd) * 10.0;
if I = 0 then
Str (P) := '.';
P := P + 1;
end if;
exit when I > 0 and V < Vmax;
Vmax := Vmax * 10.0;
end loop;
if Exp /= 0 then
-- LRM93 14.3
-- if the exponent is present, the `e' is written as a lower case
-- character.
Str (P) := 'e';
P := P + 1;
if Exp < 0 then
Str (P) := '-';
P := P + 1;
Exp := -Exp;
end if;
B := False;
for I in 0 .. 4 loop
D := (Exp / 10000) mod 10;
if D /= 0 or B or I = 4 then
Str (P) := Character'Val (48 + D);
P := P + 1;
B := True;
end if;
Exp := (Exp - D * 10000) * 10;
end loop;
end if;
Last := P - 1;
end To_String;
procedure To_String (Str : out String_Real_Digits;
Last : out Natural;
N : Ghdl_F64;
Nbr_Digits : Ghdl_I32)
is
procedure Snprintf_Nf (Str : in out String;
Len : Natural;
Ndigits : Ghdl_I32;
V : Ghdl_F64);
pragma Import (C, Snprintf_Nf, "__ghdl_snprintf_nf");
begin
Snprintf_Nf (Str, Str'Length, Nbr_Digits, N);
Last := strlen (To_Ghdl_C_String (Str'Address));
end To_String;
procedure To_String (Str : out String_Real_Digits;
Last : out Natural;
N : Ghdl_F64;
Format : Ghdl_C_String)
is
procedure Snprintf_Fmtf (Str : in out String;
Len : Natural;
Format : Ghdl_C_String;
V : Ghdl_F64);
pragma Import (C, Snprintf_Fmtf, "__ghdl_snprintf_fmtf");
begin
-- FIXME: check format ('%', f/g/e/a)
Snprintf_Fmtf (Str, Str'Length, Format, N);
Last := strlen (To_Ghdl_C_String (Str'Address));
end To_String;
procedure To_String (Str : out String_Time_Unit;
First : out Natural;
Value : Ghdl_I64;
Unit : Ghdl_I64)
is
V, U : Ghdl_I64;
D : Natural;
P : Natural := Str'Last;
Has_Digits : Boolean;
begin
-- Always work on negative values.
if Value > 0 then
V := -Value;
else
V := Value;
end if;
Has_Digits := False;
U := Unit;
loop
if U = 1 then
if Has_Digits then
Str (P) := '.';
P := P - 1;
else
Has_Digits := True;
end if;
end if;
D := Natural (-(V rem 10));
if D /= 0 or else Has_Digits then
Str (P) := Character'Val (48 + D);
P := P - 1;
Has_Digits := True;
end if;
U := U / 10;
V := V / 10;
exit when V = 0 and then U = 0;
end loop;
if not Has_Digits then
Str (P) := '0';
else
P := P + 1;
end if;
if Value < 0 then
P := P - 1;
Str (P) := '-';
end if;
First := P;
end To_String;
end Grt.Vstrings;
|