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
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
|
-- Aggregates synthesis.
-- Copyright (C) 2020 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, see <gnu.org/licenses>.
with Types; use Types;
with Str_Table;
with Netlists; use Netlists;
with Netlists.Utils; use Netlists.Utils;
with Netlists.Builders; use Netlists.Builders;
with Vhdl.Utils; use Vhdl.Utils;
with Elab.Memtype; use Elab.Memtype;
with Elab.Vhdl_Types; use Elab.Vhdl_Types;
with Synth.Errors; use Synth.Errors;
with Synth.Vhdl_Expr; use Synth.Vhdl_Expr;
with Synth.Vhdl_Context; use Synth.Vhdl_Context;
package body Synth.Vhdl_Aggr is
type Stride_Array is array (Dim_Type range <>) of Nat32;
procedure Get_Index_Offset (Syn_Inst : Synth_Instance_Acc;
Index : Int64;
Bounds : Bound_Type;
Expr : Iir;
Off : out Uns32;
Err_P : out Boolean)
is
Left : constant Int64 := Int64 (Bounds.Left);
Right : constant Int64 := Int64 (Bounds.Right);
begin
case Bounds.Dir is
when Dir_To =>
if Index >= Left and then Index <= Right then
-- to
Off := Uns32 (Index - Left);
Err_P := False;
return;
end if;
when Dir_Downto =>
if Index <= Left and then Index >= Right then
-- downto
Off := Uns32 (Left - Index);
Err_P := False;
return;
end if;
end case;
Error_Msg_Synth (Syn_Inst, Expr, "index out of bounds");
Off := 0;
Err_P := True;
end Get_Index_Offset;
procedure Get_Index_Offset (Syn_Inst : Synth_Instance_Acc;
Index : Valtyp;
Bounds : Bound_Type;
Expr : Iir;
Off : out Uns32;
Err_P : out Boolean) is
begin
Get_Index_Offset
(Syn_Inst, Read_Discrete (Index), Bounds, Expr, Off, Err_P);
end Get_Index_Offset;
function Fill_Stride (Typ : Type_Acc) return Stride_Array is
begin
case Typ.Kind is
when Type_Vector =>
return (1 => 1);
when Type_Array
| Type_Array_Unbounded =>
declare
T : Type_Acc;
Ndim : Dim_Type;
Res : Stride_Array (1 .. 16);
type Type_Acc_Array is array (Dim_Type range <>) of Type_Acc;
Arr_Typ : Type_Acc_Array (1 .. 16);
Stride : Nat32;
begin
T := Typ;
-- Compute number of dimensions.
Ndim := 1;
Arr_Typ (Ndim) := T;
while not T.Alast loop
Ndim := Ndim + 1;
T := T.Arr_El;
Arr_Typ (Ndim) := T;
end loop;
Stride := 1;
for I in reverse 2 .. Ndim loop
Res (I) := Stride;
Stride := Stride * Nat32 (Arr_Typ (I).Abound.Len);
end loop;
Res (1) := Stride;
return Res (1 .. Ndim);
end;
when others =>
raise Internal_Error;
end case;
end Fill_Stride;
procedure Fill_Array_Aggregate (Syn_Inst : Synth_Instance_Acc;
Aggr : Node;
Res : Valtyp_Array_Acc;
Typ : Type_Acc;
First_Pos : Nat32;
Strides : Stride_Array;
Dim : Dim_Type;
Const_P : out Boolean;
Err_P : out boolean)
is
Bound : constant Bound_Type := Get_Array_Bound (Typ);
El_Typ : constant Type_Acc := Get_Array_Element (Typ);
Stride : constant Nat32 := Strides (Dim);
Value : Node;
Assoc : Node;
Nbr_Els : Nat32;
Sub_Err : Boolean;
function Synth_Single_Value return Valtyp
is
Val : Valtyp;
begin
Val := Synth_Expression_With_Type (Syn_Inst, Value, El_Typ);
Val := Synth_Subtype_Conversion
(Syn_Inst, Val, El_Typ, False, Value);
if Val = No_Valtyp then
Err_P := True;
else
if Const_P and then not Is_Static (Val.Val) then
Const_P := False;
end if;
end if;
return Val;
end Synth_Single_Value;
procedure Set_Elem (Pos : Nat32)
is
Sub_Const : Boolean;
Sub_Err : Boolean;
Val : Valtyp;
begin
Nbr_Els := Nbr_Els + 1;
if Typ.Alast then
pragma Assert (Dim = Strides'Last);
Val := Synth_Single_Value;
pragma Assert (Res (Pos) = No_Valtyp);
Res (Pos) := Val;
else
Fill_Array_Aggregate
(Syn_Inst, Value, Res, El_Typ, Pos, Strides, Dim + 1,
Sub_Const, Sub_Err);
Const_P := Const_P and Sub_Const;
Err_P := Err_P or Sub_Err;
end if;
end Set_Elem;
procedure Set_Vector (Pos : Nat32; Len : Nat32; Val : Valtyp) is
begin
pragma Assert (Dim = Strides'Last);
if Len = 0 then
return;
end if;
pragma Assert (Res (Pos) = No_Valtyp);
Res (Pos) := Val;
-- Mark following slots as busy so that 'others => x' won't fill
-- them.
for I in 2 .. Len loop
Res (Pos + I - 1).Typ := Val.Typ;
end loop;
Nbr_Els := Nbr_Els + Len;
if Const_P and then not Is_Static (Val.Val) then
Const_P := False;
end if;
end Set_Vector;
Pos : Nat32;
begin
Pos := First_Pos;
Nbr_Els := 0;
Const_P := True;
Err_P := False;
if Get_Kind (Aggr) = Iir_Kind_String_Literal8 then
declare
Str_Id : constant String8_Id := Get_String8_Id (Aggr);
Str_Len : constant Int32 := Get_String_Length (Aggr);
E : Valtyp;
V : Nat8;
begin
pragma Assert (Stride = 1);
if Bound.Len /= Width (Str_Len) then
Error_Msg_Synth
(Syn_Inst, Aggr, "string length doesn't match bound length");
Err_P := True;
end if;
for I in 1 .. Pos32'Min (Pos32 (Str_Len), Pos32 (Bound.Len)) loop
E := Create_Value_Memory (El_Typ, Current_Pool);
V := Str_Table.Element_String8 (Str_Id, I);
Write_U8 (E.Val.Mem, Nat8'Pos (V));
Res (Pos) := E;
Pos := Pos + 1;
end loop;
return;
end;
end if;
Assoc := Get_Association_Choices_Chain (Aggr);
while Is_Valid (Assoc) loop
Value := Get_Associated_Expr (Assoc);
loop
case Get_Kind (Assoc) is
when Iir_Kind_Choice_By_None =>
if Get_Element_Type_Flag (Assoc) then
if Pos >= First_Pos + Stride * Nat32 (Bound.Len) then
Error_Msg_Synth
(Syn_Inst, Assoc, "element out of array bound");
else
Set_Elem (Pos);
Pos := Pos + Stride;
end if;
else
declare
Val : Valtyp;
Val_Len : Uns32;
begin
Val := Synth_Expression_With_Basetype
(Syn_Inst, Value);
Val_Len := Get_Bound_Length (Val.Typ);
pragma Assert (Stride = 1);
if Pos - First_Pos > Nat32 (Bound.Len - Val_Len) then
Error_Msg_Synth
(Syn_Inst, Assoc, "element out of array bound");
else
Set_Vector (Pos, Nat32 (Val_Len), Val);
Pos := Pos + Nat32 (Val_Len);
end if;
end;
end if;
when Iir_Kind_Choice_By_Others =>
pragma Assert (Get_Element_Type_Flag (Assoc));
declare
Last_Pos : constant Nat32 :=
First_Pos + Nat32 (Bound.Len) * Stride;
Is_Static : constant Boolean := Typ.Alast
and then Get_Expr_Staticness (Value) >= Globally;
Val : Valtyp;
begin
if Is_Static then
Val := Synth_Single_Value;
end if;
while Pos < Last_Pos loop
if Res (Pos) = No_Valtyp then
-- FIXME: the check is not correct if there is
-- an array.
if Is_Static then
Nbr_Els := Nbr_Els + 1;
Res (Pos) := Val;
else
Set_Elem (Pos);
end if;
end if;
Pos := Pos + Stride;
end loop;
end;
when Iir_Kind_Choice_By_Expression =>
pragma Assert (Get_Element_Type_Flag (Assoc));
declare
Ch : constant Node := Get_Choice_Expression (Assoc);
Idx : Valtyp;
Off : Uns32;
begin
Idx := Synth_Expression (Syn_Inst, Ch);
if not Is_Static (Idx.Val) then
Error_Msg_Synth (Syn_Inst, Ch, "choice is not static");
else
Get_Index_Offset
(Syn_Inst, Idx, Bound, Ch, Off, Sub_Err);
Err_P := Err_P or Sub_Err;
exit when Err_P;
Set_Elem (First_Pos + Nat32 (Off) * Stride);
end if;
end;
when Iir_Kind_Choice_By_Range =>
declare
Ch : constant Node := Get_Choice_Range (Assoc);
Rng : Discrete_Range_Type;
Val : Valtyp;
Valid : Boolean;
Rng_Len : Width;
Off : Uns32;
begin
Synth_Discrete_Range (Syn_Inst, Ch, Rng);
if Get_Element_Type_Flag (Assoc) then
Val := Create_Value_Discrete
(Rng.Left,
Get_Subtype_Object (Syn_Inst,
Get_Base_Type (Get_Type (Ch))));
while In_Range (Rng, Read_Discrete (Val)) loop
Get_Index_Offset
(Syn_Inst, Val, Bound, Ch, Off, Sub_Err);
Err_P := Err_P or Sub_Err;
exit when Err_P;
Set_Elem (First_Pos + Nat32 (Off) * Stride);
exit when Err_P;
Update_Index (Rng, Valid, Val);
exit when not Valid;
end loop;
else
-- The direction must be the same.
if Rng.Dir /= Bound.Dir then
Error_Msg_Synth
(Syn_Inst, Assoc,
"direction of range does not match "
& "direction of array");
end if;
-- FIXME: can the expression be unbounded ?
Val := Synth_Expression_With_Basetype
(Syn_Inst, Value);
-- The length must match the range.
Rng_Len := Get_Range_Length (Rng);
if Get_Bound_Length (Val.Typ) /= Rng_Len then
Error_Msg_Synth
(Syn_Inst, Value, "length doesn't match range");
end if;
pragma Assert (Stride = 1);
Get_Index_Offset
(Syn_Inst, Rng.Left, Bound, Ch, Off, Sub_Err);
Err_P := Err_P or Sub_Err;
exit when Err_P;
Set_Vector
(First_Pos + Nat32 (Off), Nat32 (Rng_Len), Val);
end if;
end;
when others =>
Error_Msg_Synth
(Syn_Inst, Assoc, "unhandled association form");
end case;
Assoc := Get_Chain (Assoc);
exit when Is_Null (Assoc);
exit when not Get_Same_Alternative_Flag (Assoc);
exit when Err_P;
end loop;
end loop;
if not Err_P and then Nbr_Els /= Nat32 (Bound.Len) then
Error_Msg_Synth
(Syn_Inst, Aggr, "aggregate length doesn't match its bound");
Err_P := True;
end if;
end Fill_Array_Aggregate;
procedure Fill_Record_Aggregate (Syn_Inst : Synth_Instance_Acc;
Aggr : Node;
Aggr_Typ : Type_Acc;
Rec : Valtyp_Array_Acc;
Err_P : out Boolean;
Const_P : out Boolean)
is
Value : Node;
Assoc : Node;
Pos : Nat32;
-- POS is the element position, from 0 to nbr el - 1.
procedure Set_Elem (Pos : Nat32)
is
Val : Valtyp;
El_Type : Type_Acc;
begin
El_Type := Aggr_Typ.Rec.E (Iir_Index32 (Pos + 1)).Typ;
Val := Synth_Expression_With_Type (Syn_Inst, Value, El_Type);
if Const_P and not Is_Static (Val.Val) then
Const_P := False;
end if;
Val := Synth_Subtype_Conversion
(Syn_Inst, Val, El_Type, False, Value);
if Val = No_Valtyp then
Err_P := True;
return;
end if;
-- Put in reverse order. The first record element (at position 0)
-- will be the LSB, so the last element of REC.
Rec (Nat32 (Rec'Last - Pos)) := Val;
end Set_Elem;
begin
Assoc := Get_Association_Choices_Chain (Aggr);
Pos := 0;
Const_P := True;
Err_P := False;
while Is_Valid (Assoc) loop
Value := Get_Associated_Expr (Assoc);
loop
case Get_Kind (Assoc) is
when Iir_Kind_Choice_By_None =>
Set_Elem (Pos);
Pos := Pos + 1;
when Iir_Kind_Choice_By_Others =>
for I in Rec'Range loop
if Rec (I) = No_Valtyp then
Set_Elem (Rec'Last - I);
end if;
end loop;
when Iir_Kind_Choice_By_Name =>
Pos := Nat32 (Get_Element_Position
(Get_Named_Entity
(Get_Choice_Name (Assoc))));
Set_Elem (Pos);
when others =>
Error_Msg_Synth
(Syn_Inst, Assoc, "unhandled association form");
end case;
Assoc := Get_Chain (Assoc);
exit when Is_Null (Assoc);
exit when not Get_Same_Alternative_Flag (Assoc);
end loop;
end loop;
end Fill_Record_Aggregate;
function Valtyp_Array_To_Net (Ctxt : Context_Acc; Tab : Valtyp_Array)
return Net
is
Res : Net;
Arr : Net_Array_Acc;
Idx : Nat32;
begin
Arr := new Net_Array (1 .. Tab'Length);
Idx := 0;
for I in Arr'Range loop
if Tab (I).Val /= null then
Idx := Idx + 1;
Arr (Idx) := Get_Net (Ctxt, Tab (I));
end if;
end loop;
Concat_Array (Ctxt, Arr (1 .. Idx), Res);
Free_Net_Array (Arr);
return Res;
end Valtyp_Array_To_Net;
function Synth_Aggregate_Array (Syn_Inst : Synth_Instance_Acc;
Aggr : Node;
Aggr_Typ : Type_Acc) return Valtyp
is
Ctxt : constant Context_Acc := Get_Build (Syn_Inst);
Strides : constant Stride_Array := Fill_Stride (Aggr_Typ);
Flen : constant Iir_Index32 := Get_Array_Flat_Length (Aggr_Typ);
Tab_Res : Valtyp_Array_Acc;
Const_P : Boolean;
Err_P : Boolean;
Res_Typ : Type_Acc;
Res : Valtyp;
begin
Tab_Res := new Valtyp_Array(1 .. Nat32 (Flen));
Tab_Res.all := (others => No_Valtyp);
Fill_Array_Aggregate (Syn_Inst, Aggr, Tab_Res,
Aggr_Typ, 1, Strides, 1, Const_P, Err_P);
if Err_P then
return No_Valtyp;
end if;
case Type_Vectors_Arrays (Aggr_Typ.Kind) is
when Type_Array
| Type_Vector =>
Res_Typ := Aggr_Typ;
when Type_Array_Unbounded =>
-- TODO: check all element types have the same bounds ?
Res_Typ := Create_Array_From_Array_Unbounded
(Aggr_Typ, Tab_Res (1).Typ);
when Type_Unbounded_Vector
| Type_Unbounded_Array =>
raise Internal_Error;
end case;
if Const_P then
declare
Off : Size_Type;
begin
Res := Create_Value_Memory (Res_Typ, Current_Pool);
Off := 0;
for I in Tab_Res'Range loop
if Tab_Res (I).Val /= null then
-- There can be holes due to sub-arrays.
Write_Value (Res.Val.Mem + Off, Tab_Res (I));
Off := Off + Tab_Res (I).Typ.Sz;
end if;
end loop;
pragma Assert (Off = Res_Typ.Sz);
end;
else
Res := Create_Value_Net
(Valtyp_Array_To_Net (Ctxt, Tab_Res.all), Res_Typ);
end if;
Free_Valtyp_Array (Tab_Res);
return Res;
end Synth_Aggregate_Array;
function Synth_Aggregate_Record (Syn_Inst : Synth_Instance_Acc;
Aggr : Node;
Aggr_Type : Type_Acc) return Valtyp
is
Ctxt : constant Context_Acc := Get_Build (Syn_Inst);
Tab_Res : Valtyp_Array_Acc;
Res_Typ : Type_Acc;
Res : Valtyp;
Err_P : Boolean;
Const_P : Boolean;
begin
-- Allocate the result.
Tab_Res :=
new Valtyp_Array'(1 .. Nat32 (Aggr_Type.Rec.Len) => No_Valtyp);
Fill_Record_Aggregate
(Syn_Inst, Aggr, Aggr_Type, Tab_Res, Err_P, Const_P);
if Err_P then
Res := No_Valtyp;
else
case Type_Records (Aggr_Type.Kind) is
when Type_Unbounded_Record =>
declare
Els_Typ : Rec_El_Array_Acc;
begin
Els_Typ := Create_Rec_El_Array (Aggr_Type.Rec.Len);
for I in Els_Typ.E'Range loop
-- Note: elements are put in reverse order in Tab_Res,
-- so reverse again...
Els_Typ.E (I).Typ :=
Tab_Res (Tab_Res'Last - Nat32 (I) + 1).Typ;
end loop;
Res_Typ := Create_Record_Type (Els_Typ);
end;
when Type_Record =>
Res_Typ := Aggr_Type;
end case;
if Const_P then
Res := Create_Value_Memory (Res_Typ, Current_Pool);
for I in Aggr_Type.Rec.E'Range loop
-- Note: elements are put in reverse order in Tab_Res,
-- so reverse again...
Write_Value (Res.Val.Mem + Res_Typ.Rec.E (I).Offs.Mem_Off,
Tab_Res (Tab_Res'Last - Nat32 (I) + 1));
end loop;
else
Res := Create_Value_Net
(Valtyp_Array_To_Net (Ctxt, Tab_Res.all), Res_Typ);
end if;
end if;
Free_Valtyp_Array (Tab_Res);
return Res;
end Synth_Aggregate_Record;
-- Aggr_Type is the type from the context.
function Synth_Aggregate (Syn_Inst : Synth_Instance_Acc;
Aggr : Node;
Aggr_Type : Type_Acc) return Valtyp is
begin
case Aggr_Type.Kind is
when Type_Unbounded_Array
| Type_Unbounded_Vector =>
declare
Res_Type : Type_Acc;
begin
Res_Type := Synth_Subtype_Indication
(Syn_Inst, Get_Type (Aggr));
case Res_Type.Kind is
when Type_Array
| Type_Array_Unbounded
| Type_Vector =>
return Synth_Aggregate_Array (Syn_Inst, Aggr, Res_Type);
when Type_Unbounded_Vector
| Type_Unbounded_Array =>
-- The only possibility is vector elements.
pragma Assert (Res_Type.Ulast);
raise Internal_Error;
when others =>
raise Internal_Error;
end case;
end;
when Type_Vector
| Type_Array =>
return Synth_Aggregate_Array (Syn_Inst, Aggr, Aggr_Type);
when Type_Record
| Type_Unbounded_Record =>
return Synth_Aggregate_Record (Syn_Inst, Aggr, Aggr_Type);
when others =>
raise Internal_Error;
end case;
end Synth_Aggregate;
end Synth.Vhdl_Aggr;
|