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
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263 | ------------------------------------------------------------------------------
-- --
-- TGen --
-- --
-- Copyright (C) 2022, AdaCore --
-- --
-- TGen is free software; you can redistribute it and/or modify it under --
-- under terms of the GNU General Public License as published by the --
-- Free Software Foundation; either version 3, or (at your option) any --
-- later version. This software 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. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are --
-- granted additional permissions described in the GCC Runtime Library --
-- Exception, version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and a --
-- copy of the GCC Runtime Library Exception along with this program; see --
-- the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
------------------------------------------------------------------------------
with Ada.Containers; use Ada.Containers;
with Ada.Containers.Indefinite_Hashed_Maps;
with Ada.Strings; use Ada.Strings;
with Ada.Strings.Unbounded; use Ada.Strings.Unbounded;
with Ada.Unchecked_Deallocation;
with TGen.Types.Array_Types; use TGen.Types.Array_Types;
package body TGen.Types.Record_Types is
LF : constant String := [1 => ASCII.LF];
Pad : constant Unbounded_String := 3 * ' ';
function PP_Variant
(Var : Variant_Part_Acc; Padding : Natural := 0) return Unbounded_String;
procedure Fill_Components
(Self : Variant_Part; Constraints : Disc_Value_Map;
Res : in out Component_Maps.Map);
-- Fill Res with the list of components in Self that are present given
-- a map of discriminant constraints.
-----------
-- Image --
-----------
function Image (Self : Record_Typ) return String is
(Image_Internal (Self, 0));
--------------------
-- Image_Internal --
--------------------
function Image_Internal
(Self : Record_Typ; Padding : Natural := 0) return String
is
use Component_Maps;
Str : Unbounded_String := To_Unbounded_String (Typ (Self).Image);
Current_Component : Component_Maps.Cursor;
begin
if Self.Component_Types.Is_Empty then
Str := Str & ": null record";
else
Str := Str & ": record" & LF;
Current_Component := Self.Component_Types.First;
while Has_Element (Current_Component) loop
Str :=
Str & (Padding + 1) * Pad &
(+Key (Current_Component)) & " : ";
if Element (Current_Component).Get.Kind in Record_Typ_Range then
Str :=
Str &
String'
(As_Record_Typ (Element (Current_Component)).Image_Internal
(Padding + 1)) &
LF;
else
Str := Str & Element (Current_Component).Get.Image & LF;
end if;
Next (Current_Component);
end loop;
Str := Str & "end record";
end if;
return To_String (Str);
end Image_Internal;
---------------------
-- Get_Diagnostics --
---------------------
function Get_Diagnostics (Self : Record_Typ) return String is
use Component_Maps;
begin
for Comp_Cur in Self.Component_Types.Iterate loop
declare
Diags : constant String := Element (Comp_Cur).Get.Get_Diagnostics;
begin
if Diags'Length > 0 then
return Diags;
end if;
end;
end loop;
return "";
end Get_Diagnostics;
------------
-- Encode --
------------
function Encode
(Self : Record_Typ; Val : JSON_Value) return JSON_Value
is
use Component_Maps;
Components : constant JSON_Value := Val.Get ("components");
begin
return Res : constant JSON_Value := Create_Object do
for Cur in Self.Component_Types.Iterate loop
declare
Comp_Name : constant String := To_String (Key (Cur));
Comp_Val : constant JSON_Value := Components.Get (Comp_Name);
begin
Components.Set_Field
(Comp_Name, Element (Cur).Get.Encode (Comp_Val));
end;
end loop;
Res.Set_Field ("components", Components);
end return;
end Encode;
------------------
-- Free_Variant --
------------------
procedure Free_Variant (Var : in out Variant_Part_Acc) is
use Variant_Choice_Lists;
procedure Free is new Ada.Unchecked_Deallocation
(Variant_Part, Variant_Part_Acc);
procedure Destroy_Var_Choice (Var_Choice : in out Variant_Choice);
------------------------
-- Destroy_Var_Choice --
------------------------
procedure Destroy_Var_Choice (Var_Choice : in out Variant_Choice) is
begin
if Var_Choice.Variant /= null then
Free_Variant (Var_Choice.Variant);
end if;
end Destroy_Var_Choice;
begin
if Var /= null then
declare
Cur : Variant_Choice_Lists.Cursor := Var.Variant_Choices.First;
begin
while Has_Element (Cur) loop
Var.Variant_Choices.Update_Element
(Cur, Destroy_Var_Choice'Access);
Next (Cur);
end loop;
Free (Var);
end;
end if;
end Free_Variant;
-------------------
-- Clone_Variant --
-------------------
function Clone (Var : Variant_Part_Acc) return Variant_Part_Acc is
Res : Variant_Part_Acc;
begin
if Var = null then
return null;
end if;
Res := new Variant_Part;
Res.Discr_Name := Var.Discr_Name;
for Choice of Var.Variant_Choices loop
Res.Variant_Choices.Append
(Variant_Choice'
(Alt_Set => Choice.Alt_Set.Copy,
Components => Choice.Components.Copy,
Variant => Clone (Choice.Variant)));
end loop;
return Res;
end Clone;
---------------------------
-- Constraints_Respected --
---------------------------
function Constraints_Respected
(Self : Discriminated_Record_Typ; Discriminant_Values : Disc_Value_Map)
return Boolean
is
use Discriminant_Constraint_Maps;
use Disc_Value_Maps;
Constraint_Cur : Discriminant_Constraint_Maps.Cursor;
Value_Cur : Disc_Value_Maps.Cursor;
begin
if not Self.Constrained then
return True;
end if;
Constraint_Cur := Self.Discriminant_Constraint.First;
while Has_Element (Constraint_Cur) loop
if Element (Constraint_Cur).Kind = Static then
Value_Cur := Discriminant_Values.Find (Key (Constraint_Cur));
if Has_Element (Value_Cur)
and then Element (Value_Cur).Get
/= Element (Constraint_Cur).Int_Val
then
return False;
end if;
end if;
Next (Constraint_Cur);
end loop;
return True;
end Constraints_Respected;
----------------
-- Components --
----------------
function Components
(Self : Discriminated_Record_Typ; Discriminant_Values : Disc_Value_Map)
return Component_Maps.Map
is
Res : Component_Maps.Map := Self.Component_Types.Copy;
begin
if Self.Variant /= null then
Fill_Components (Self.Variant.all, Discriminant_Values, Res);
end if;
return Res;
end Components;
---------------------
-- Fill_Components --
---------------------
procedure Fill_Components
(Self : Variant_Part;
Constraints : Disc_Value_Map;
Res : in out Component_Maps.Map)
is
Disc_Val_Cur : constant Disc_Value_Maps.Cursor :=
Constraints.Find (Self.Discr_Name);
Discr_Val : Big_Int.Big_Integer;
begin
if Disc_Value_Maps.Has_Element (Disc_Val_Cur) then
Discr_Val := Disc_Value_Maps.Element (Disc_Val_Cur).Get;
end if;
for Choice of Self.Variant_Choices loop
declare
Choice_Matches : Boolean := False;
Comp_Cur : Component_Maps.Cursor := Choice.Components.First;
begin
for Interval_Set of Choice.Alt_Set loop
if Discr_Val >= Interval_Set.Min
and then Discr_Val <= Interval_Set.Max
then
Choice_Matches := True;
end if;
end loop;
if Choice_Matches then
while Component_Maps.Has_Element (Comp_Cur) loop
Res.Insert
(Component_Maps.Key (Comp_Cur),
Component_Maps.Element (Comp_Cur));
Component_Maps.Next (Comp_Cur);
end loop;
if Choice.Variant /= null then
Fill_Components (Choice.Variant.all, Constraints, Res);
end if;
end if;
exit when Choice_Matches;
end;
end loop;
end Fill_Components;
----------------
-- PP_Variant --
----------------
function PP_Variant
(Var : Variant_Part_Acc; Padding : Natural := 0) return Unbounded_String
is
Res : Unbounded_String := (Padding * Pad) & "case ";
Comp_Cur : Component_Maps.Cursor;
begin
Res := Res & (+Var.Discr_Name) & " is" & LF;
for Var_Choice of Var.Variant_Choices loop
Res := Res & (Padding + 2) * Pad & "when ";
for Alt of Var_Choice.Alt_Set loop
Res :=
Res & Big_Int.To_String (Alt.Min) & " .. "
& Big_Int.To_String (Alt.Max);
if Alt /= Var_Choice.Alt_Set.Last_Element then
Res := Res & " | ";
end if;
end loop;
Res := Res & " => " & LF;
Comp_Cur := Var_Choice.Components.First;
while Component_Maps.Has_Element (Comp_Cur) loop
Res :=
Res & (Padding + 3) * Pad &
(+Component_Maps.Key (Comp_Cur)) & " : ";
if Component_Maps.Element (Comp_Cur).Get.Kind in Record_Typ_Range
then
Res :=
Res &
String'
(As_Record_Typ (Component_Maps.Element (Comp_Cur))
.Image_Internal
(Padding + 3));
else
Res := Res & Component_Maps.Element (Comp_Cur).Get.Image;
end if;
Component_Maps.Next (Comp_Cur);
Res := Res & LF;
end loop;
if Var_Choice.Variant /= null then
Res := Res & PP_Variant (Var_Choice.Variant, Padding + 3);
end if;
end loop;
Res := Res & (Padding + 1) * Pad & "end case" & LF;
return Res;
end PP_Variant;
-----------
-- Image --
-----------
function Image (Self : Discriminated_Record_Typ) return String is
(Image_Internal (Self, 0));
--------------------
-- Image_Internal --
--------------------
function Image_Internal
(Self : Discriminated_Record_Typ; Padding : Natural := 0) return String
is
use Component_Maps;
Str : Unbounded_String := To_Unbounded_String (Typ (Self).Image);
Current_Component : Component_Maps.Cursor;
begin
-- First display the discriminants in line
Str :=
Str & ": " & (if Self.Mutable then "" else "non ") &
"mutable record (";
Current_Component := Self.Discriminant_Types.First;
loop
exit when not Has_Element (Current_Component);
Str :=
Str & (+Key (Current_Component)) & ": " &
Element (Current_Component).Get.Image;
Next (Current_Component);
exit when not Has_Element (Current_Component);
Str := Str & "; ";
end loop;
Str := Str & ")" & LF;
if Self.Component_Types.Is_Empty and Self.Variant = null then
Str := Str & Padding * Pad & " no components" & LF;
else
if not Self.Component_Types.Is_Empty then
Current_Component := Self.Component_Types.First;
while Has_Element (Current_Component) loop
Str :=
Str & (Padding + 1) * Pad &
(+Key (Current_Component)) & " : ";
if Element (Current_Component).Get.Kind in Record_Typ_Range then
Str :=
Str &
String'
(As_Record_Typ (Element (Current_Component))
.Image_Internal
(Padding + 1));
else
Str := Str & Element (Current_Component).Get.Image & LF;
end if;
Next (Current_Component);
end loop;
end if;
if Self.Variant /= null then
Str :=
Str & (Padding + 1) * Pad &
PP_Variant (Self.Variant, Padding + 1);
end if;
end if;
Str := Str & "end record";
return To_String (Str);
end Image_Internal;
------------
-- Encode --
------------
function Encode
(Self : Discriminated_Record_Typ; Val : JSON_Value) return JSON_Value
is
use Component_Maps;
Disc_Values : Disc_Value_Map;
Comp_Map : Component_Map;
Discriminants : constant JSON_Value := Val.Get ("discriminants");
Components : constant JSON_Value := Val.Get ("components");
Res : constant JSON_Value := Create_Object;
begin
-- Encode the discriminants
for Cur in Self.Discriminant_Types.Iterate loop
declare
Disc_Val : constant JSON_Value :=
Discriminants.Get (To_String (Key (Cur)));
begin
Disc_Values.Insert (Key (Cur), Disc_Val);
Discriminants.Set_Field
(To_String (Key (Cur)), Element (Cur).Get.Encode (Disc_Val));
end;
end loop;
Res.Set_Field ("discriminants", Discriminants);
-- Encode the components
Comp_Map := Self.Components (Disc_Values);
for Cur in Comp_Map.Iterate loop
Components.Set_Field
(To_String (Key (Cur)),
Element (Cur).Get.Encode
(Components.Get (To_String (Key (Cur)))));
end loop;
Res.Set_Field ("components", Components);
return Res;
end Encode;
---------------------
-- Get_Diagnostics --
---------------------
function Get_Diagnostics (Self : Discriminated_Record_Typ) return String is
Comp_Res : constant String := Record_Typ (Self).Get_Diagnostics;
function Inspect_Variant (Var : Variant_Part_Acc) return String;
-- Inspect the variant part for unsupported types, and return the first
-- diagnostics found, if any.
---------------------
-- Inspect_Variant --
---------------------
function Inspect_Variant (Var : Variant_Part_Acc) return String is
begin
if Var = null then
return "";
end if;
for Choice of Var.Variant_Choices loop
for Comp of Choice.Components loop
declare
Diags : constant String := Comp.Get.Get_Diagnostics;
begin
if Diags'Length > 0 then
return Diags;
end if;
end;
end loop;
declare
Subvar_Res : constant String :=
Inspect_Variant (Choice.Variant);
begin
if Subvar_Res'Length > 0 then
return Subvar_Res;
end if;
end;
end loop;
return "";
end Inspect_Variant;
begin
if Comp_Res'Length > 0 then
return Comp_Res;
end if;
return Inspect_Variant (Self.Variant);
end Get_Diagnostics;
------------------
-- Supports_Gen --
------------------
function Supports_Gen (Self : Discriminated_Record_Typ) return Boolean is
function Inspect_Variant (Var : Variant_Part_Acc) return Boolean;
-- Traverse the variant part tree to determine whether some type is not
-- supported for generation.
---------------------
-- Inspect_Variant --
---------------------
function Inspect_Variant (Var : Variant_Part_Acc) return Boolean is
Res : Boolean := True;
begin
if Var = null then
return True;
end if;
for Choice of Var.Variant_Choices loop
Res := (for all Cmp of Choice.Components => Cmp.Get.Supports_Gen);
exit when not Res;
Res := Inspect_Variant (Choice.Variant);
exit when not Res;
end loop;
return Res;
end Inspect_Variant;
begin
if not Record_Typ (Self).Supports_Gen then
return False;
end if;
return Inspect_Variant (Self.Variant);
end Supports_Gen;
------------------
-- Free_Content --
------------------
procedure Free_Content (Self : in out Discriminated_Record_Typ) is
begin
if Self.Variant /= null then
Free_Variant (Self.Variant);
end if;
end Free_Content;
function "="
(L : Strategy_Type'Class;
R : Strategy_Type'Class)
return Boolean;
function "="
(L : Strategy_Type'Class;
R : Strategy_Type'Class)
return Boolean
is
pragma Unreferenced (L);
pragma Unreferenced (R);
begin
return False;
end "=";
-- TODO: Implement this properly
-- Static generation
package Strategy_Maps is new Ada.Containers.Indefinite_Hashed_Maps
(Key_Type => Unbounded_String,
Element_Type => Strategy_Type'Class,
Hash => Ada.Strings.Unbounded.Hash,
Equivalent_Keys => "=",
"=" => "=");
subtype Strategy_Map is Strategy_Maps.Map;
type Record_Strategy_Type is new Strategy_Type with
record
T : SP.Ref;
Component_Strats : Strategy_Map;
Generate : access function
(T : Record_Typ'Class;
Component_Strats : in out Strategy_Map;
Disc_Values : Disc_Value_Map) return JSON_Value;
end record;
overriding function Generate
(S : in out Record_Strategy_Type;
Disc_Values : Disc_Value_Map) return JSON_Value;
--------------
-- Generate --
--------------
function Generate
(S : in out Record_Strategy_Type;
Disc_Values : Disc_Value_Map) return JSON_Value
is
T : constant Typ'Class := S.T.Get;
begin
return
S.Generate (Record_Typ (T), S.Component_Strats, Disc_Values);
end Generate;
------------------------
-- Get_All_Components --
------------------------
function Get_All_Components
(Self : Discriminated_Record_Typ) return Component_Map
is
Res : Component_Map := Self.Component_Types;
procedure Get_All_Components_Rec
(Variant_Part : Variant_Part_Acc);
procedure Get_All_Components_Rec
(Variant_Part : Variant_Part_Acc)
is
begin
if Variant_Part /= null then
for Choice of Variant_Part.Variant_Choices loop
for Comp_Cursor in Choice.Components.Iterate loop
declare
use Component_Maps;
Comp_Name : constant Unbounded_String :=
Key (Comp_Cursor);
Comp_Type : constant SP.Ref := Element (Comp_Cursor);
begin
Res.Insert (Comp_Name, Comp_Type);
end;
end loop;
Get_All_Components_Rec (Choice.Variant);
end loop;
end if;
end Get_All_Components_Rec;
begin
Get_All_Components_Rec (Self.Variant);
return Res;
end Get_All_Components;
function Generate_Record_Typ
(Self : Record_Typ'Class;
Comp_Strats : in out Strategy_Map;
Disc_Values : Disc_Value_Map) return JSON_Value;
-------------------------
-- Generate_Record_Typ --
-------------------------
function Generate_Record_Typ
(Self : Record_Typ'Class;
Comp_Strats : in out Strategy_Map;
Disc_Values : Disc_Value_Map) return JSON_Value
is
Res : constant JSON_Value := Create_Object;
use Component_Maps;
begin
for Comp in Self.Component_Types.Iterate loop
declare
Comp_Name : constant Unbounded_String := Key (Comp);
procedure Generate_Val
(Comp_Name : Unbounded_String;
Comp_Strat : in out Strategy_Type'Class);
procedure Generate_Val
(Comp_Name : Unbounded_String;
Comp_Strat : in out Strategy_Type'Class) is
begin
Set_Field
(Val => Res,
Field_Name => +Comp_Name,
Field => Comp_Strat.Generate (Disc_Values));
end Generate_Val;
begin
-- Generate a value
Comp_Strats.Update_Element
(Comp_Strats.Find (Comp_Name), Generate_Val'Access);
end;
end loop;
return Res;
end Generate_Record_Typ;
function Pick_Samples_For_Disc
(Variant : Variant_Part_Acc; Disc_Name : Unbounded_String)
return Alternatives_Set_Vector;
-- Returns a list of samples for the discriminant name, recurring through
-- all the variant parts and checking whether the discriminant is present
-- as a control value.
--
-- type A (I : Integer) is record with
-- case I is
-- when 0 => J : Integer;
-- when others => null;
-- end case;
-- end record;
--
-- Would return there {[0:0]}, {[Integer'First:-1], [1:Integer'Last]} if
-- we call it with Disc_Name = I.
--
-- If this record contains discriminated records whose discriminants are
-- this record discriminants, we won't try to pick sample in this
-- sub-record. TODO: we maybe should.
---------------------------
-- Pick_Samples_For_Disc --
---------------------------
function Pick_Samples_For_Disc
(Variant : Variant_Part_Acc; Disc_Name : Unbounded_String)
return Alternatives_Set_Vector
is
use Alternatives_Set_Vectors;
Res : Alternatives_Set_Vector;
begin
if Variant = null then
return Alternatives_Set_Vectors.Empty_Vector;
end if;
if Variant.all.Discr_Name = Disc_Name then
for Choice of Variant.Variant_Choices loop
Res.Append (Choice.Alt_Set);
end loop;
else
for Choice of Variant.Variant_Choices loop
Res.Append_Vector
(Pick_Samples_For_Disc (Choice.Variant, Disc_Name));
end loop;
end if;
return Res;
end Pick_Samples_For_Disc;
function Pick_Strat_For_Disc
(Self : Discriminated_Record_Typ;
Disc_Name : Unbounded_String;
Disc_Type : Discrete_Typ'Class)
return Strategy_Type'Class;
-- Return a generation strategy for the given discriminant
-------------------------
-- Pick_Strat_For_Disc --
-------------------------
function Pick_Strat_For_Disc
(Self : Discriminated_Record_Typ;
Disc_Name : Unbounded_String;
Disc_Type : Discrete_Typ'Class)
return Strategy_Type'Class
is
Default_Strategy : constant Strategy_Type'Class :=
Self.Discriminant_Types.Element (Disc_Name).Get.Default_Strategy;
Samples : Alternatives_Set_Vector;
begin
-- TODO: special strategies when discriminant also is an array index
-- constraint, as we don't want to be purely random there, otherwise
-- we would end up generating arrays that are too big.
declare
Found : Boolean;
Constraint : TGen.Types.Constraints.Index_Constraint;
begin
Self.Disc_Constrains_Array (Disc_Name, Found, Constraint);
if Found then
return Disc_Type.Generate_Array_Index_Constraint_Strategy
(Disc_Name, Constraint);
end if;
end;
Samples := Pick_Samples_For_Disc (Self.Variant, Disc_Name);
-- If non empty Sample, make a sampling strategy
if not Samples.Is_Empty then
declare
Sample_Strat : Strategy_Acc;
Dispatching_Strat : Dispatching_Strategy_Type;
begin
if Disc_Type in Discrete_Typ'Class then
Sample_Strat :=
new Strategy_Type'Class'
(Disc_Type.Generate_Sampling_Strategy (Samples));
else
raise Program_Error
with "Unsupported discriminant type";
end if;
Dispatching_Strat.Bias := 0.5;
Dispatching_Strat.S1 := Sample_Strat;
Dispatching_Strat.S2 :=
new Strategy_Type'Class'(Default_Strategy);
return Dispatching_Strat;
end;
end if;
return Default_Strategy;
end Pick_Strat_For_Disc;
-- Static strategy for record types
type Nondisc_Record_Strategy_Type is
new Record_Strategy_Type with null record;
overriding function Generate
(S : in out Nondisc_Record_Strategy_Type;
Disc_Context : Disc_Value_Map) return JSON_Value;
--------------
-- Generate --
--------------
function Generate
(S : in out Nondisc_Record_Strategy_Type;
Disc_Context : Disc_Value_Map) return JSON_Value
is
Result : constant JSON_Value := Create_Object;
begin
-- Set the component values
Set_Field
(Result, "components",
S.Generate (As_Record_Typ (S.T), S.Component_Strats, Disc_Context));
return Result;
end Generate;
----------------------
-- Default_Strategy --
----------------------
function Default_Strategy
(Self : Nondiscriminated_Record_Typ) return Strategy_Type'Class
is
use Component_Maps;
Strat : Nondisc_Record_Strategy_Type;
begin
SP.From_Element (Strat.T, Self'Unrestricted_Access);
Strat.Generate := Generate_Record_Typ'Access;
for Component in Self.Component_Types.Iterate loop
declare
Comp_Name : constant Unbounded_String := Key (Component);
begin
Strat.Component_Strats.Insert
(Comp_Name, Element (Component).Get.Default_Strategy);
end;
end loop;
return Strat;
end Default_Strategy;
-- Static strategy for discriminated record types
type Disc_Record_Strategy_Type is
new Record_Strategy_Type with
record
Disc_Strats : Strategy_Map;
end record;
overriding function Generate
(S : in out Disc_Record_Strategy_Type;
Disc_Context : Disc_Value_Map) return JSON_Value;
--------------
-- Generate --
--------------
function Generate
(S : in out Disc_Record_Strategy_Type;
Disc_Context : Disc_Value_Map) return JSON_Value
is
T : constant Typ'Class := S.T.Get;
Disc_Record : constant Discriminated_Record_Typ :=
Discriminated_Record_Typ (T);
use Disc_Value_Maps;
Current_Context : Disc_Value_Map;
-- This context holds the values for the discriminant of the record
-- being generated.
Discriminants : constant JSON_Value := Create_Object;
Result : constant JSON_Value := Create_Object;
begin
-- Start of by filling the discriminant context
if Disc_Record.Constrained then
-- If there are constraints, then we have to get their actual value
-- from the Disc_Values.
for Constraint_Cursor in Disc_Record.Discriminant_Constraint.Iterate
loop
declare
use Discriminant_Constraint_Maps;
Discriminant_Name : constant Unbounded_String :=
Key (Constraint_Cursor);
Constraint : constant Discrete_Constraint_Value :=
Element (Constraint_Cursor);
begin
pragma Assert (Constraint.Kind /= Non_Static);
case Constraint.Kind is
when Static =>
Current_Context.Insert
(Discriminant_Name,
TGen.JSON.Create (Constraint.Int_Val));
when Discriminant =>
-- Make the correspondence here
Current_Context.Insert
(Discriminant_Name,
Disc_Context.Element (Constraint.Disc_Name));
when others =>
raise Program_Error
with "unsupported non static generation";
end case;
end;
end loop;
else
for D_Strat_Cursor in S.Disc_Strats.Iterate loop
declare
use Strategy_Maps;
procedure Generate_Val
(Disc_Name : Unbounded_String;
Disc_Strat : in out Strategy_Type'Class);
procedure Generate_Val
(Disc_Name : Unbounded_String;
Disc_Strat : in out Strategy_Type'Class)
is
begin
Current_Context.Insert
(Disc_Name,
Disc_Strat.Generate (Current_Context));
end Generate_Val;
begin
S.Disc_Strats.Update_Element
(D_Strat_Cursor, Generate_Val'Access);
end;
end loop;
end if;
-- Write the generated discriminant values; they are part of the
-- generated record value.
for Disc_Cursor in Current_Context.Iterate loop
Set_Field
(Val => Discriminants,
Field_Name => +Key (Disc_Cursor),
Field => Element (Disc_Cursor));
end loop;
Set_Field (Result, "discriminants", Discriminants);
-- Now, generate values for the components
declare
Components : constant Component_Map :=
Disc_Record.Components (Current_Context);
R : constant Record_Typ :=
(Name => Disc_Record.Name,
Last_Comp_Unit_Idx => Disc_Record.Last_Comp_Unit_Idx,
Component_Types => Components,
Static_Gen => Disc_Record.Static_Gen,
Fully_Private => Disc_Record.Fully_Private);
begin
Set_Field
(Result, "components",
S.Generate (R, S.Component_Strats, Current_Context));
end;
return Result;
end Generate;
----------------------
-- Default_Strategy --
----------------------
function Default_Strategy
(Self : Discriminated_Record_Typ) return Strategy_Type'Class
is
Strat : Disc_Record_Strategy_Type;
use Component_Maps;
begin
-- Pick the strategy for each discriminant
for Disc in Self.Discriminant_Types.Iterate loop
declare
Disc_Name : constant Unbounded_String := Key (Disc);
begin
Strat.Disc_Strats.Insert
(Disc_Name,
Self.Pick_Strat_For_Disc
(Disc_Name, Discrete_Typ'Class
(Element (Disc).Unchecked_Get.all)));
end;
end loop;
-- Generate the strategies for the record components
SP.From_Element (Strat.T, Self'Unrestricted_Access);
Strat.Generate := Generate_Record_Typ'Access;
for Component in Self.Get_All_Components.Iterate loop
declare
Comp_Name : constant Unbounded_String := Key (Component);
begin
Strat.Component_Strats.Insert
(Comp_Name, Element (Component).Get.Default_Strategy);
end;
end loop;
return Strat;
end Default_Strategy;
procedure Disc_Constrains_Array
(Component_Types : Component_Map;
Variant : Variant_Part_Acc;
Disc_Name : Unbounded_String;
Disc_Correspondence : UTT_Map;
Found : out Boolean;
Constraint : out TGen.Types.Constraints.Index_Constraint);
-- Internal for the spec-declared Disc_Constrains_Array procedure.
-- Component_Types are the currently analyzed component types, Variant is
-- the currently analyzed variant, and Disc_Correspondence gives the
-- current correspondence from sub-record discriminant names to top-level
-- record discriminant names.
---------------------------
-- Disc_Constrains_Array --
---------------------------
procedure Disc_Constrains_Array
(Component_Types : Component_Map;
Variant : Variant_Part_Acc;
Disc_Name : Unbounded_String;
Disc_Correspondence : UTT_Map;
Found : out Boolean;
Constraint : out TGen.Types.Constraints.Index_Constraint)
is
T_Ref : SP.Ref;
Constraints : Constraint_Acc;
Has_Constraints : Boolean;
begin
Found := False;
Constraint := (Present => False);
-- Check the components of the record
for Component_Type of Component_Types loop
Has_Constraints := False;
T_Ref := Component_Type;
if Component_Type.Get.Kind in Anonymous_Kind then
Has_Constraints := True;
Constraints :=
As_Anonymous_Typ
(Component_Type).Subtype_Constraints;
T_Ref := As_Named_Typ (As_Anonymous_Typ (Component_Type));
end if;
if T_Ref.Get.Kind in Constrained_Array_Kind then
declare
T : constant Constrained_Array_Typ'Class :=
As_Constrained_Array_Typ (T_Ref);
begin
T.Is_Constrained_By_Variable (Disc_Name, Found, Constraint);
if Found then
-- We got the constraint, but we still must translate it
-- according to the discriminant correspondence. The
-- constraint must be expressed in the terms of the
-- top-level record.
if Constraint.Present then
declare
CLB : constant Discrete_Constraint_Value :=
Constraint.Discrete_Range.Low_Bound;
CHB : constant Discrete_Constraint_Value :=
Constraint.Discrete_Range.High_Bound;
begin
if CLB.Kind = Discriminant then
Constraint.Discrete_Range.Low_Bound.Disc_Name :=
Disc_Correspondence.Element (CLB.Disc_Name);
end if;
if CHB.Kind = Discriminant then
Constraint.Discrete_Range.High_Bound.Disc_Name :=
Disc_Correspondence.Element (CHB.Disc_Name);
end if;
end;
end if;
-- The discriminant could constrain several arrays, but
-- there is no point taking them all into account. So stop
-- as soon as we found a match.
return;
end if;
end;
end if;
if T_Ref.Get.Kind in Disc_Record_Kind then
-- If there are constraints, they are necessarily discriminant
-- constraints. Records the discriminant correspondence to have
-- an index constraint that can be applied to the top-level record
-- at the end.
if Has_Constraints then
declare
Disc_Constraints : constant Discriminant_Constraint_Map :=
Discriminant_Constraints (Constraints.all).Constraint_Map;
New_Disc_Correspondence : UTT_Map;
Sub_Record : constant Discriminated_Record_Typ'Class :=
As_Discriminated_Record_Typ (T_Ref);
Inspect_Subrecord : Boolean := False;
Correspondent_Disc_Name : Unbounded_String;
-- Whether the discriminant Disc_Name can affect the sub-
-- record, i.e. if it is propagated through a discriminant
-- constraint. If it is the case, Correspondent_Disc_Name
-- will hold the name of the discriminant that corresponds
-- to the original Disc_Name, in the nested sub-record.
begin
for Constraint_Cursor in Disc_Constraints.Iterate loop
declare
Disc_Constrained : constant Unbounded_String :=
Discriminant_Constraint_Maps.Key (Constraint_Cursor);
Constraint : constant Discrete_Constraint_Value :=
Discriminant_Constraint_Maps.Element
(Constraint_Cursor);
begin
-- If the constraint is a discriminant constraint,
-- then we have a new correspondence.
if Constraint.Kind = Discriminant then
declare
Orig_Disc : constant Unbounded_String :=
Disc_Correspondence.Element
(Constraint.Disc_Name);
begin
Inspect_Subrecord := True;
Correspondent_Disc_Name := Disc_Constrained;
New_Disc_Correspondence.Insert
(Disc_Constrained,
Orig_Disc);
end;
end if;
end;
end loop;
if Inspect_Subrecord then
Disc_Constrains_Array
(Sub_Record.Component_Types,
Sub_Record.Variant,
Correspondent_Disc_Name,
New_Disc_Correspondence,
Found,
Constraint);
end if;
end;
else
-- If we don't have any constraint, then we just drop it all,
-- as none of the discriminant in the top level record will
-- affect the types of a sub-record. Note that this is the case
-- where the sub-record is mutable (i.e. has default values for
-- discriminants), as we can't have an unconstrained value as
-- a component of a record.
null;
end if;
end if;
end loop;
-- Check the variant part
if Variant /= null then
for Variant_Choice of Variant.Variant_Choices loop
Disc_Constrains_Array
(Variant_Choice.Components,
Variant_Choice.Variant,
Disc_Name,
Disc_Correspondence,
Found,
Constraint);
if Found then
return;
end if;
end loop;
end if;
end Disc_Constrains_Array;
---------------------------
-- Disc_Constrains_Array --
---------------------------
procedure Disc_Constrains_Array
(Self : Discriminated_Record_Typ;
Disc_Name : Unbounded_String;
Found : out Boolean;
Constraint : out TGen.Types.Constraints.Index_Constraint)
is
Disc_Correspondence : UTT_Map;
begin
for Disc_Cursor in Self.Discriminant_Types.Iterate loop
declare
Disc_Name : constant Unbounded_String :=
Component_Maps.Key (Disc_Cursor);
begin
Disc_Correspondence.Insert (Disc_Name, Disc_Name);
end;
end loop;
Disc_Constrains_Array
(Self.Component_Types,
Self.Variant,
Disc_Name,
Disc_Correspondence,
Found,
Constraint);
end Disc_Constrains_Array;
----------------------
-- Default_Strategy --
----------------------
function Default_Strategy
(Self : Function_Typ) return Strategy_Type'Class
is
use Component_Maps;
Strat : Nondisc_Record_Strategy_Type;
begin
SP.From_Element (Strat.T, Self'Unrestricted_Access);
Strat.Generate := Generate_Record_Typ'Access;
for Component in Self.Component_Types.Iterate loop
declare
Comp_Name : constant Unbounded_String := Key (Component);
begin
Strat.Component_Strats.Insert
(Comp_Name, Element (Component).Get.Default_Strategy);
end;
end loop;
return Strat;
end Default_Strategy;
-----------------
-- Simple_Name --
-----------------
function Simple_Name (Self : Function_Typ) return String is
begin
return To_String (Unbounded_String
(Self.Name.Element (Self.Name.Last_Index - 1)));
end Simple_Name;
------------------------
-- JSON_Test_Filename --
------------------------
function JSON_Test_Filename (Self : Function_Typ) return String is
(To_Filename (Self.Compilation_Unit_Name) & ".json");
end TGen.Types.Record_Types;
|