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
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370
1371
1372
1373
1374
1375
1376
1377
1378
1379
1380
1381
1382
1383
1384
1385
1386
1387
1388
1389
1390
1391
1392
1393
1394
1395
1396
1397
1398
1399
1400
1401
1402
1403
1404
1405
1406
1407
1408
1409
1410
1411
1412
1413
1414
1415
1416
1417
1418
1419
1420
1421
1422
1423
1424
1425
1426
1427
1428
1429
1430
1431
1432
1433
1434
1435
1436
1437
1438
1439
1440
1441
1442
1443
1444
1445
1446
1447
1448
1449
1450
1451
1452
1453
1454
1455
1456
1457
1458
1459
1460
1461
1462
1463
1464
1465
1466
1467
1468
1469
1470
1471
1472
1473
1474
1475
1476
1477
1478
1479
1480
1481
1482
1483
1484
1485
1486
1487
1488
1489
1490
1491
1492
1493
1494
1495
1496
1497
1498
1499
1500
1501
1502
1503
1504
1505
1506
1507
1508
1509
1510
1511
1512
1513
1514
1515
1516
1517
1518
1519
1520
1521
1522
1523
1524
1525
1526
1527
1528
1529
1530
1531
1532
1533
1534
1535
1536
1537
1538
1539
1540
1541
1542
1543
1544
1545
1546
1547
1548
1549
1550
1551
1552
1553
1554
1555
1556
1557
1558
1559
1560
1561
1562
1563
1564
1565
1566
1567
1568
1569
1570
1571
1572
1573
1574
1575
1576
1577
1578
1579
1580
1581
1582
1583
1584
1585
1586
1587
1588
1589
1590
1591
1592
1593
1594
1595
1596
1597
1598
1599
1600
1601
1602
1603
1604
1605
1606
1607
1608
1609
1610
1611
1612
1613
1614
1615
1616
1617
1618
1619
1620
1621
1622
1623
1624
1625
1626
1627
1628
1629
1630
1631
1632
1633
1634
1635
1636
1637
1638
1639
1640
1641
1642
1643
1644
1645
1646
1647
1648
1649
1650
1651
1652
1653
1654
1655
1656
1657
1658
1659
1660
1661
1662
1663
1664
1665
1666
1667
1668
1669
1670
1671
1672
1673
1674
1675
1676
1677
1678
1679
1680
1681
1682
1683
1684
1685
1686
1687
1688
1689
1690
1691
1692
1693
1694
1695
1696
1697
1698
1699
1700
1701
1702
1703
1704
1705
1706
1707
1708
1709
1710
1711
1712
1713
1714
1715
1716
1717
1718
1719
1720
1721
1722
1723
1724
1725
1726
1727
1728
1729
1730
1731
1732
1733
1734
1735
1736
1737
1738
1739
1740
1741
1742
1743
1744
1745
1746
1747
1748
1749
1750
1751
1752
1753
1754
1755
1756
1757
1758
1759
1760
1761
1762
1763
1764
1765
1766
1767
1768
1769
1770
1771
1772
1773
1774
1775
1776
1777
1778
1779
1780
1781
1782
1783
1784
1785
1786
1787
1788
1789
1790
1791
1792
1793
1794
1795
1796
1797
1798
1799
1800
1801
1802
1803
1804
1805
1806
1807
1808
1809
1810
1811
1812
1813
1814
1815
1816
1817
1818
1819
1820
1821
1822
1823
1824
1825
1826
1827
1828
1829
1830
1831
1832
1833
1834
1835
1836
1837
1838
1839
1840
1841
1842
1843
1844
1845
1846
1847
1848
1849
1850
1851
1852
1853
1854
1855
1856
1857
1858
1859
1860
1861
1862
1863
1864
1865
1866
1867
1868
1869
1870
1871
1872
1873
1874
1875
1876
1877
1878
1879
1880
1881
1882
1883
1884
1885
1886
1887
1888
1889
1890
1891
1892
1893
1894
1895
1896
1897
1898
1899
1900
1901
1902
1903
1904
1905
1906
1907
1908
1909
1910
1911
1912
1913
1914
1915
1916
1917
1918
1919
1920
1921
1922
1923
1924
1925
1926
1927
1928
1929
1930
1931
1932
1933
1934
1935
1936
1937
1938
1939
1940
1941
1942
1943
1944
1945
1946
1947
1948
1949
1950
1951
1952
1953
1954
1955
1956
1957
1958
1959
1960
1961
1962
1963
1964
1965
1966
1967
1968
1969
1970
1971
1972
1973
1974
1975
1976
1977
1978
1979
1980
1981
1982
1983
1984
1985
1986
1987
1988
1989
1990
1991
1992
1993
1994
1995
1996
1997
1998
1999
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
2025
2026
2027
2028
2029
2030
2031
2032
2033
2034
2035
2036
2037
2038
2039
2040
2041
2042
2043
2044
2045
2046
2047
2048
2049
2050
2051
2052
2053
2054
2055
2056
2057
2058
2059
2060
2061
2062
2063
2064
2065
2066
2067
2068
2069
2070
2071
2072
2073
2074
2075
2076
2077
2078
2079
2080
2081
2082
2083
2084
2085
2086
2087
2088
2089
2090
2091
2092
2093
2094
2095
2096
2097
2098
2099
2100
2101
2102
2103
2104
2105
2106
2107
2108
2109
2110
2111
2112
2113
2114
2115
2116
2117
2118
2119
2120
2121
2122
2123
2124
2125
2126
2127
2128
2129
2130
2131
2132
2133
2134
2135
2136
2137
2138
2139
2140
2141
2142
2143
2144
2145
2146
2147
2148
2149
2150
2151
2152
2153
2154
2155
2156
2157
2158
2159
2160
2161
2162
2163
2164
2165
2166
2167
2168
2169
2170
2171
2172
2173
2174
2175
2176
2177
2178
2179
2180
2181
2182
2183
2184
2185
2186
2187
2188
2189
2190
2191
2192
2193
2194
2195
2196
2197
2198
2199
2200
2201
2202
2203
2204
2205
2206
2207
2208
2209
2210
2211
2212
2213
2214
2215
2216
2217
2218
2219
2220
2221
2222
2223
2224
2225
2226
2227
2228
2229
2230
2231
2232
2233
2234
2235
2236
2237
2238
2239
2240
2241
2242
2243
2244
2245
2246
2247
2248
2249
2250
2251
2252
2253
2254
2255
2256
2257
2258
2259
2260
2261
2262
2263
2264
2265
2266
2267
2268
2269
2270
2271
2272
2273
2274
2275
2276
2277
2278
2279
2280
2281
2282
2283
2284
2285
2286
2287
2288
2289
2290
2291
2292
2293
2294
2295
2296
2297
2298
2299
2300
2301
2302
2303
2304
2305
2306
2307
2308
2309
2310
2311
2312
2313
2314
2315
2316
2317
2318
2319
2320
2321
2322
2323
2324
2325
2326
2327
2328
2329
2330
2331
2332
2333
2334
2335
2336
2337
2338
2339
2340
2341
2342
2343
2344
2345
2346
2347
2348
2349
2350
2351
2352
2353
2354
2355
2356
2357
2358
2359
2360
2361
2362
2363
2364
2365
2366
2367
2368
2369
2370
2371
2372
2373
2374
2375
2376
2377
2378
2379
2380
2381
2382
2383
2384
2385
2386
2387
2388
2389
2390
2391
2392
2393
2394
2395
2396
2397
2398
2399
2400
2401
2402
2403
2404
2405
2406
2407
2408
2409
2410
2411
2412
2413
2414
2415
2416
2417
2418
2419
2420
2421
2422
2423
2424
2425
2426
2427
2428
2429
2430
2431
2432
2433
2434
2435
2436
2437
2438
2439
2440
2441
2442
2443
2444
2445
2446
2447
2448
2449
2450
2451
2452
2453
2454
2455
2456
2457
2458
2459
2460
2461
2462
2463
2464
2465
2466
2467
2468
2469
2470
2471
2472
2473
2474
2475
2476
2477
2478
2479
2480
2481
2482
2483
2484
2485
2486
2487
2488
2489
2490
2491
2492
2493
2494
2495
2496
2497
2498
2499
2500
2501
2502
2503
2504
2505
2506
2507
2508
2509
2510
2511
2512
2513
2514
2515
2516
2517
2518
2519
2520
2521
2522
2523
2524
2525
2526
2527
2528
2529
2530
2531
2532
2533
2534
2535
2536
2537
2538
2539
2540
2541
2542
2543
2544
2545
2546
2547
2548
2549
2550
2551
2552
2553
2554
2555
2556
2557
2558
2559
2560
2561
2562
2563
2564
2565
2566
2567
2568
2569
2570
2571
2572
2573
2574
2575
2576
2577
2578
2579
2580
2581
2582
2583
2584
2585
2586
2587
2588
2589
2590
2591
2592
2593
2594
2595
2596
2597
2598
2599
2600
2601
2602
2603
2604
2605
2606
2607
2608
2609
2610
2611
2612
2613
2614
2615
2616
2617
2618
2619
2620
2621
2622
2623
2624
2625
2626
2627
2628
2629
2630
2631
2632
2633
2634
2635
2636
2637
2638
2639
2640
2641
2642
2643
2644
2645
2646
2647
2648
2649
2650
2651
2652
2653
2654
2655
2656
2657
2658
2659
2660
2661
2662
2663
2664
2665
2666
2667
2668
2669
2670
2671
2672
2673
2674
2675
2676
2677
2678
2679
2680
2681
2682
2683
2684
2685
2686
2687
2688
2689
2690
2691
2692
2693
2694
2695
2696
2697
2698
2699
2700
2701
2702
2703
2704
2705
2706
2707
2708
2709
2710
2711
2712
2713
2714
2715
2716
2717
2718
2719
2720
2721
2722
2723
2724
2725
2726
2727
2728
2729
2730
2731
2732
2733
2734
2735
2736
2737
2738
2739
2740
2741
2742
2743
2744
2745
2746
2747
2748
2749
2750
2751
2752
2753
2754
2755
2756
2757
2758
2759
2760
2761
2762
2763
2764
2765
2766
2767
2768
2769
2770
2771
2772
2773
2774
2775
2776
2777
2778
2779
2780
2781
2782
2783
2784
2785
2786
2787
2788
2789
2790
2791
2792
2793
2794
2795
2796
2797
2798
2799
2800
2801
2802
2803
2804
2805
2806
2807
2808
2809
2810
2811
2812
2813
2814
2815
2816
2817
2818
2819
2820
2821
2822
2823
2824
2825
2826
2827
2828
2829
2830
2831
2832
2833
2834
2835
2836
2837
2838
2839
2840
2841
2842
2843
2844
2845
2846
2847
2848
2849
2850
2851
2852
2853
2854
2855
2856
2857
2858
2859
2860
2861
2862
2863
2864
2865
2866
2867
2868
2869
2870
2871
2872
2873
2874
2875
2876
2877
2878
2879
2880
2881
2882
2883
2884
2885
2886
2887
2888
2889
2890
2891
2892
2893
2894
2895
2896
2897
2898
2899
2900
2901
2902
2903
2904
2905
2906
2907
2908
2909
2910
2911
2912
2913
2914
2915
2916
2917
2918
2919
2920
2921
2922
2923
2924
2925
2926
2927
2928
2929
2930
2931
2932
2933
2934
2935
2936
2937
2938
2939
2940
2941
2942
2943
2944
2945
2946
2947
2948
2949
2950
2951
2952
2953
2954
2955
2956
2957
2958
2959
2960
2961
2962
2963
2964
2965
2966
2967
2968
2969
2970
2971
2972
2973
2974
2975
2976
2977
2978
2979
2980
2981
2982
2983
2984
2985
2986
2987
2988
2989
2990
2991
2992
2993
2994
2995
2996
2997
2998
2999
3000
3001
3002
3003
3004
3005
3006
3007
3008
3009
3010
3011
3012
3013
3014
3015
3016
3017
3018
3019
3020
3021
3022
3023
3024
3025
3026
3027
3028
3029
3030
3031
3032
3033
3034
3035
3036
3037
3038
3039
3040
3041
3042
3043
3044
3045
3046
3047
3048
3049
3050
3051
3052
3053
3054
3055
3056
3057
3058
3059
3060
3061
3062
3063
3064
3065
3066
3067
3068
3069
3070
3071
3072
3073
3074
3075
3076
3077
3078
3079
3080
3081
3082
3083
3084
3085
3086
3087
3088
3089
3090
3091
3092
3093
3094
3095
3096
3097
3098
3099
3100
3101
3102
3103
3104
3105
3106
3107
3108
3109
3110
3111
3112
3113
3114
3115
3116
3117
3118
3119
3120
3121
3122
3123
3124
3125
3126
3127
3128
3129
3130
3131
3132
3133
3134
3135
3136
3137
3138
3139
3140
3141
3142
3143
3144
3145
3146
3147
3148
3149
3150
3151
3152
3153
3154
3155
3156
3157
3158
3159
3160
3161
3162
3163
3164
3165
3166
3167
3168
3169
3170
3171
3172
3173
3174
3175
3176
3177
3178
3179
3180
3181
3182
3183
3184
3185
3186
3187
3188
3189
3190
3191
3192
3193
3194
3195
3196
3197
3198
3199
3200
3201
3202
3203
3204
3205
3206
3207
3208
3209
3210
3211
3212
3213
3214
3215
3216
3217
3218
3219
3220
3221
3222
3223
3224
3225
3226
3227
3228
3229
3230
3231
3232
3233
3234
3235
3236
3237
3238
3239
3240
3241
3242
3243
3244
3245
3246
3247
3248
3249
3250
3251
3252
3253
3254
3255
3256
3257
3258
3259
3260
3261
3262
3263
3264
3265
3266
3267
3268
3269
3270
3271
3272
3273
3274
3275
3276
3277
3278
3279
3280
3281
3282
3283
3284
3285
3286
3287
3288
3289
3290
3291
3292
3293
3294
3295
3296
3297
3298
3299
3300
3301
3302
3303
3304
3305
3306
3307
3308
3309
3310
3311
3312
3313
3314
3315
3316
3317
3318
3319
3320
3321
3322
3323
3324
3325
3326
3327
3328
3329
3330
3331
3332
3333
3334
3335
3336
3337
3338
3339
3340
3341
3342
3343
3344
3345
3346
3347
3348
3349
3350
3351
3352
3353
3354
3355
3356
3357
3358
3359
3360
3361
3362
3363
3364
3365
3366
3367
3368
3369
3370
3371
3372
3373
3374
3375
3376
3377
3378
3379
3380
3381
3382
3383
3384
3385
3386
3387
3388
3389
3390
3391
3392
3393
3394
3395
3396
3397
3398
3399
3400
3401
3402
3403
3404
3405
3406
3407
3408
3409
3410
3411
3412
3413
3414
3415
3416
3417
3418
3419
3420
3421
3422
3423
3424
3425
3426
3427
3428
3429
3430
3431
3432
3433
3434
3435
3436
3437
3438
3439
3440
3441
3442
3443
3444
3445
3446
3447
3448
3449
3450
3451
3452
3453
3454
3455
3456
3457
3458
3459
3460
3461
3462
3463
3464
3465
3466
3467
3468
3469
3470
3471
3472
3473
3474
3475
3476
3477
3478
3479
3480
3481
3482
3483
3484
3485 | ------------------------------------------------------------------------------
-- Templates Parser --
-- --
-- Copyright (C) 1999 - 2003 --
-- Pascal Obry --
-- --
-- This library 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 library 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 library; if not, write to the Free Software Foundation, --
-- Inc., 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. --
------------------------------------------------------------------------------
-- $Id: templates_parser.adb,v 1.3 2004/02/24 15:49:33 Jano Exp $
with Ada.Exceptions;
with Ada.Characters.Handling;
with Ada.Calendar;
with Ada.IO_Exceptions;
with Ada.Strings.Fixed;
with Ada.Strings.Maps.Constants;
with Ada.Strings.Unbounded;
with Ada.Unchecked_Deallocation;
with GNAT.Calendar.Time_IO;
with GNAT.OS_Lib;
with GNAT.Regexp;
with Templates_Parser.Input;
with Text_io; use Text_io;
package body Templates_Parser is
use Ada;
use Ada.Exceptions;
use Ada.Strings;
Internal_Error : exception;
Blank : constant Maps.Character_Set := Maps.To_Set (' ' & ASCII.HT);
function Image (N : in Integer) return String;
pragma Inline (Image);
-- Returns N image without leading blank
function No_Quote (Str : in String) return String;
-- Removes quotes around Str. If Str (Str'First) and Str (Str'Last)
-- are quotes return Str (Str'First + 1 .. Str'Last - 1) otherwise
-- return Str as-is.
-----------
-- Image --
-----------
function Image (N : in Integer) return String is
N_Img : constant String := Integer'Image (N);
begin
if N_Img (N_Img'First) = '-' then
return N_Img;
else
return N_Img (N_Img'First + 1 .. N_Img'Last);
end if;
end Image;
--------------
-- No_Quote --
--------------
function No_Quote (Str : in String) return String is
begin
if Str (Str'First) = '"' and then Str (Str'Last) = '"' then
return Str (Str'First + 1 .. Str'Last - 1);
else
return Str;
end if;
end No_Quote;
--------------
-- Tag Info --
--------------
Begin_Tag : Unbounded_String := To_Unbounded_String (Default_Begin_Tag);
End_Tag : Unbounded_String := To_Unbounded_String (Default_End_Tag);
Table_Token : constant String := "@@TABLE@@";
Terminate_Sections_Token : constant String := "@@TERMINATE_SECTIONS@@";
Section_Token : constant String := "@@SECTION@@";
End_Table_Token : constant String := "@@END_TABLE@@";
If_Token : constant String := "@@IF@@";
Elsif_Token : constant String := "@@ELSIF@@";
Else_Token : constant String := "@@ELSE@@";
End_If_Token : constant String := "@@END_IF@@";
Include_Token : constant String := "@@INCLUDE@@";
------------
-- Filter --
------------
package Filter is
----------------------
-- Filters setting --
----------------------
-- A filter appear just before a tag variable (e.g. @_LOWER:SOME_VAR_@
-- and means that the filter LOWER should be applied to SOME_VAR before
-- replacing it in the template file.
type Mode is
(Multiply,
-- Multiply the given parameter to the string (operator "*")
Plus,
-- Add the given parameter to the string (operator "+")
Minus,
-- Substract the given parameter to the string (operator "-")
Divide,
-- Divide the given parameter to the string (operator "/")
Add,
-- Add the given parameter to the string
BR_2_LF,
-- Replaces all <BR> HTML tag by a LF character.
Capitalize,
-- Lower case except char before spaces and underscores.
Clean_Text,
-- Only letter/digits all other chars are changed to spaces.
Coma_2_Point,
-- Replaces comas by points.
Contract,
-- Replaces a suite of spaces by a single space character.
Div,
-- Divide the given parameter to the string
Exist,
-- Returns "TRUE" if var is not empty and "FALSE" otherwise.
Format_Number,
-- Returns the number with a space added between each 3 digits
-- blocks. The decimal part is not transformed. If the data is not a
-- number nothing is done. The data is trimmed before processing it.
Is_Empty,
-- Returns "TRUE" if var is empty and "FALSE" otherwise.
LF_2_BR,
-- Replaces all LF character to <BR> HTML tag.
Lower,
-- Lower case.
Match,
-- Returns "TRUE" if var match the pattern passed as argument.
Modulo,
-- Returns current value modulo N (N is the filter parameter)
Mult,
-- Multiply the given parameter to the string
No_Digit,
-- Replace all digits by spaces.
No_Letter,
-- Removes all letters by spaces.
No_Space,
-- Removes all spaces found in the value.
Oui_Non,
-- If True return Oui, If False returns Non, else do nothing.
Point_2_Coma,
-- Replaces points by comas.
Repeat,
-- Returns N copy of the original string. The number of copy is
-- passed as parameter.
Invert,
-- Reverse string.
Size,
-- Returns the number of characters in the string value.
Slice,
-- Returns a slice of the string.
Sub,
-- Substract the given parameter to the string
Trim,
-- Trim leading and trailing space.
Upper,
-- Upper case.
Web_Escape,
-- Convert characters "<>&" to HTML equivalents: <, > and &
Web_NBSP,
-- Convert spaces to HTML - non breaking spaces.
Yes_No
-- If True return Yes, If False returns No, else do nothing.
);
type Parameter_Mode is (Void, Str, Regexp, Slice);
function Parameter (Mode : in Filter.Mode) return Parameter_Mode;
-- Returns the parameter mode for the given filter.
type Parameter_Data (Mode : Parameter_Mode := Void) is record
case Mode is
when Void =>
null;
when Str =>
S : Unbounded_String;
when Regexp =>
R_Str : Unbounded_String;
Regexp : GNAT.Regexp.Regexp;
when Slice =>
First : Natural;
Last : Natural;
end case;
end record;
No_Parameter : constant Parameter_Data := Parameter_Data'(Mode => Void);
function Image (P : in Parameter_Data) return String;
-- Returns parameter string representation.
type Callback is
access function (S : in String; P : in Parameter_Data := No_Parameter)
return String;
-- P is the filter parameter, no parameter by default. Parameter are
-- untyped and will be parsed by the filter function if needed.
type Routine is record
Handle : Callback;
Parameters : Parameter_Data;
end record;
type Set is array (Positive range <>) of Routine;
type Set_Access is access Set;
type String_Access is access constant String;
type Filter_Record is record
Name : String_Access;
Handle : Callback;
end record;
-- filter functions, see above.
procedure Check_Null_Parameter (P : in Parameter_Data);
-- Raises Template_Error if P is not equal to Null_Parameter.
function BR_2_LF
(S : in String; P : in Parameter_Data := No_Parameter) return String;
function Capitalize
(S : in String; P : in Parameter_Data := No_Parameter) return String;
function Clean_Text
(S : in String; P : in Parameter_Data := No_Parameter) return String;
function Coma_2_Point
(S : in String; P : in Parameter_Data := No_Parameter) return String;
function Contract
(S : in String; P : in Parameter_Data := No_Parameter) return String;
function Exist
(S : in String; P : in Parameter_Data := No_Parameter) return String;
function Format_Number
(S : in String; P : in Parameter_Data := No_Parameter) return String;
function Is_Empty
(S : in String; P : in Parameter_Data := No_Parameter) return String;
function LF_2_BR
(S : in String; P : in Parameter_Data := No_Parameter) return String;
function Lower
(S : in String; P : in Parameter_Data := No_Parameter) return String;
function Match
(S : in String; P : in Parameter_Data := No_Parameter) return String;
function No_Digit
(S : in String; P : in Parameter_Data := No_Parameter) return String;
function No_Letter
(S : in String; P : in Parameter_Data := No_Parameter) return String;
function No_Space
(S : in String; P : in Parameter_Data := No_Parameter) return String;
function Oui_Non
(S : in String; P : in Parameter_Data := No_Parameter) return String;
function Point_2_Coma
(S : in String; P : in Parameter_Data := No_Parameter) return String;
function Repeat
(S : in String; P : in Parameter_Data := No_Parameter) return String;
function Reverse_Data
(S : in String; P : in Parameter_Data := No_Parameter) return String;
function Size
(S : in String; P : in Parameter_Data := No_Parameter) return String;
function Slice
(S : in String; P : in Parameter_Data := No_Parameter) return String;
function Trim
(S : in String; P : in Parameter_Data := No_Parameter) return String;
function Upper
(S : in String; P : in Parameter_Data := No_Parameter) return String;
function Web_Escape
(S : in String; P : in Parameter_Data := No_Parameter) return String;
function Web_NBSP
(S : in String; P : in Parameter_Data := No_Parameter) return String;
function Yes_No
(S : in String; P : in Parameter_Data := No_Parameter) return String;
function Plus
(S : in String; P : in Parameter_Data := No_Parameter) return String;
function Minus
(S : in String; P : in Parameter_Data := No_Parameter) return String;
function Divide
(S : in String; P : in Parameter_Data := No_Parameter) return String;
function Multiply
(S : in String; P : in Parameter_Data := No_Parameter) return String;
function Modulo
(S : in String; P : in Parameter_Data := No_Parameter) return String;
function Handle (Name : in String) return Callback;
-- Returns the filter function for the given filter name.
function Handle (Mode : in Filter.Mode) return Callback;
-- Returns the filter function for the given filter mode.
function Mode_Value (Name : in String) return Mode;
-- Returns the Mode for filter named Name. This is the internal
-- representation for this filter name.
function Name (Handle : in Callback) return String;
-- Returns the filter name for the given filter function.
end Filter;
--------------------
-- Tags variable --
--------------------
type Attribute is (Nil, Length, Line, Min_Column, Max_Column);
type Tag is record
Name : Unbounded_String;
Filters : Filter.Set_Access;
Attr : Attribute := Nil;
end record;
function Build (Str : in String) return Tag;
-- Create a Tag from Str. A tag is composed of a name and a set of
-- filters.
function Image (T : in Tag) return String;
-- Returns string representation for the Tag variable.
function Translate (T : in Tag; Value : in String) return String;
-- Returns the result of Value after applying all filters for tag T.
procedure Release (T : in out Tag);
-- Release all memory associated with Tag.
-----------
-- Image --
-----------
function Image (T : in Tag) return String is
use type Filter.Set_Access;
R : Unbounded_String;
begin
R := Begin_Tag;
-- Filters
if T.Filters /= null then
for K in reverse T.Filters'Range loop
Append (R, Filter.Name (T.Filters (K).Handle));
Append (R, Filter.Image (T.Filters (K).Parameters));
Append (R, ":");
end loop;
end if;
-- Tag name
Append (R, T.Name);
-- Attributes
case T.Attr is
when Nil => null;
when Length => Append (R, "'Length");
when Line => Append (R, "'Line");
when Min_Column => Append (R, "'Min_Column");
when Max_Column => Append (R, "'Max_Column");
end case;
Append (R, End_Tag);
return To_String (R);
end Image;
-----------
-- Build --
-----------
function Build (Str : in String) return Tag is
function Get_Var_Name (Tag : in String) return Unbounded_String;
-- Given a Tag name, it returns the variable name only. It removes
-- the tag separator and the filters.
function Get_Filter_Set (Tag : in String) return Filter.Set_Access;
-- Given a tag name, it retruns a set of filter to apply to this
-- variable when translated.
function Get_Attribute (Tag : in String) return Attribute;
-- Returns attribute for the given tag.
F_Sep : constant Natural
:= Strings.Fixed.Index (Str, ":", Strings.Backward);
-- Last filter separator
A_Sep : constant Natural
:= Strings.Fixed.Index (Str, "'", Strings.Backward);
-- Attribute separator
-------------------
-- Get_Attribute --
-------------------
function Get_Attribute (Tag : in String) return Attribute is
Start, Stop : Natural;
begin
if A_Sep = 0 then
return Nil;
else
Start := A_Sep + 1;
Stop := Tag'Last - Length (End_Tag);
end if;
declare
A_Name : constant String
:= Characters.Handling.To_Lower (Tag (Start .. Stop));
begin
if A_Name = "length" then
return Length;
elsif A_Name = "line" then
return Line;
elsif A_Name = "min_column" then
return Min_Column;
elsif A_Name = "max_column" then
return Max_Column;
else
Exceptions.Raise_Exception
(Template_Error'Identity,
"Unknown attribute name """ & A_Name & '"');
end if;
end;
end Get_Attribute;
--------------------
-- Get_Filter_Set --
--------------------
function Get_Filter_Set (Tag : in String) return Filter.Set_Access is
Start : Natural;
Stop : Natural := Tag'Last;
FS : Filter.Set (1 .. Strings.Fixed.Count (Tag, ":"));
K : Positive := FS'First;
function Name_Parameter (Filter : in String) return
Templates_Parser.Filter.Routine;
-- Given a Filter description, returns the filter handle and
-- parameter.
procedure Get_Slice (Slice : in String; First, Last : out Natural);
-- Returns the First and Last slice index as parsed into the Slice
-- string. Retruns First and Last set to 0 if there is not valid
-- slice definition in Slice.
---------------
-- Get_Slice --
---------------
procedure Get_Slice (Slice : in String; First, Last : out Natural) is
P1 : constant Natural := Fixed.Index (Slice, "..");
begin
First := 0;
Last := 0;
if P1 = 0 then
Exceptions.Raise_Exception
(Template_Error'Identity, "slice expected """ & Slice & '"');
else
First := Natural'Value (Slice (Slice'First .. P1 - 1));
Last := Natural'Value (Slice (P1 + 2 .. Slice'Last));
end if;
end Get_Slice;
--------------------
-- Name_Parameter --
--------------------
function Name_Parameter (Filter : in String) return
Templates_Parser.Filter.Routine is
use Strings;
package F renames Templates_Parser.Filter;
P1 : constant Natural := Fixed.Index (Filter, "(");
P2 : constant Natural := Fixed.Index (Filter, ")", Backward);
begin
if (P1 = 0 and then P2 /= 0) or else (P1 /= 0 and then P2 = 0) then
Exceptions.Raise_Exception
(Template_Error'Identity,
"unbalanced parenthesis """ & Filter & '"');
elsif P2 /= 0
and then P2 < Filter'Last
and then Filter (P2 + 1) /= ':'
then
Exceptions.Raise_Exception
(Template_Error'Identity,
"unexpected character after parenthesis """ & Filter & '"');
end if;
if P1 = 0 then
-- No parenthesis, so there is no parameter to parse
return (F.Handle (Filter),
F.Parameter_Data'(Mode => F.Void));
else
declare
Name : constant String
:= Filter (Filter'First .. P1 - 1);
Mode : constant F.Mode := F.Mode_Value (Name);
Parameter : constant String
:= No_Quote (Filter (P1 + 1 .. P2 - 1));
begin
case F.Parameter (Mode) is
when F.Regexp =>
return (F.Handle (Mode),
F.Parameter_Data'
(F.Regexp,
To_Unbounded_String (Parameter),
GNAT.Regexp.Compile (Parameter)));
when F.Slice =>
declare
First, Last : Natural;
begin
Get_Slice (Parameter, First, Last);
return (F.Handle (Mode),
F.Parameter_Data'(F.Slice, First, Last));
end;
when F.Str =>
return (F.Handle (Mode),
F.Parameter_Data'
(F.Str,
To_Unbounded_String (Parameter)));
when F.Void =>
pragma Warnings (Off);
null;
end case;
end;
end if;
end Name_Parameter;
begin
if FS'Length = 0 then
return null;
end if;
loop
Start := Tag'First;
Stop := Strings.Fixed.Index
(Tag (Start .. Stop), ":", Strings.Backward);
exit when Stop = 0;
Start := Strings.Fixed.Index
(Tag (Start .. Stop - 1), ":", Strings.Backward);
if Start = 0 then
-- Last filter found
FS (K) := Name_Parameter
(Tag (Tag'First + Length (Begin_Tag) .. Stop - 1));
else
FS (K) := Name_Parameter (Tag (Start + 1 .. Stop - 1));
end if;
K := K + 1;
Stop := Stop - 1;
end loop;
return new Filter.Set'(FS);
end Get_Filter_Set;
------------------
-- Get_Var_Name --
------------------
function Get_Var_Name (Tag : in String) return Unbounded_String is
Start, Stop : Natural;
begin
if A_Sep = 0 then
-- No attribute
Stop := Tag'Last - Length (End_Tag);
else
Stop := A_Sep - 1;
end if;
if F_Sep = 0 then
-- No filter
Start := Tag'First + Length (Begin_Tag);
else
Start := F_Sep + 1;
end if;
return To_Unbounded_String (Tag (Start .. Stop));
end Get_Var_Name;
begin
return (Get_Var_Name (Str), Get_Filter_Set (Str), Get_Attribute (Str));
end Build;
-------------
-- Release --
-------------
procedure Release (T : in out Tag) is
procedure Free is
new Ada.Unchecked_Deallocation (Filter.Set, Filter.Set_Access);
begin
Free (T.Filters);
end Release;
---------------
-- Translate --
---------------
function Translate (T : in Tag; Value : in String) return String is
use type Filter.Set_Access;
begin
if T.Filters /= null then
declare
R : Unbounded_String := To_Unbounded_String (Value);
begin
for K in T.Filters'Range loop
R := To_Unbounded_String
(T.Filters (K).Handle (To_String (R),
T.Filters (K).Parameters));
end loop;
return To_String (R);
end;
end if;
return Value;
end Translate;
----------
-- Data --
----------
package Data is
type Node;
type Tree is access Node;
type NKind is (Text, Var);
type Node (Kind : NKind) is record
Next : Tree;
case Kind is
when Text =>
Value : Unbounded_String;
when Var =>
Var : Tag;
end case;
end record;
function Parse (Line : in String) return Tree;
-- Parse text line and returns the corresponding tree representation.
procedure Print_Tree (D : in Tree);
-- Decend the text tree and print it to the standard output.
procedure Release (D : in out Tree);
-- Release all memory used by the tree.
end Data;
------------------
-- Expressions --
------------------
package Expr is
type Ops is (O_And, O_Or, O_Xor,
O_Sup, O_Inf, O_Esup, O_Einf, O_Equal, O_Diff);
function Image (O : in Ops) return String;
-- Returns Ops string representation.
function Value (O : in String) return Ops;
-- Returns Ops from its string representation. Raises Templates_Error if
-- the token is not a known operation.
type U_Ops is (O_Not);
function Image (O : in U_Ops) return String;
-- Returns U_Ops string representation.
function Value (O : in String) return U_Ops;
-- Returns U_Ops from its string representation. Raises Templates_Error
-- if the token is not a known operation.
type Node;
type Tree is access Node;
type NKind is (Value, Var, Op, U_Op);
-- The node is a value, a variable a binary operator or an unary
-- operator
type Node (Kind : NKind) is record
case Kind is
when Value =>
V : Unbounded_String;
when Var =>
Var : Tag;
when Op =>
O : Ops;
Left, Right : Tree;
when U_Op =>
U_O : U_Ops;
Next : Tree;
end case;
end record;
function Parse (Expression : in String) return Tree;
-- Parse Expression and returns the corresponding tree representation.
procedure Print_Tree (E : in Tree);
-- Decend the expression's tree and print the expression. It outputs the
-- expression with all parenthesis to show without ambiguity the way the
-- expression has been parsed.
procedure Release (E : in out Tree);
-- Release all associated memory with the tree.
end Expr;
--------------------------------
-- Template Tree definitions --
--------------------------------
type Nkind is (Info, -- first node is tree infos
C_Info, -- second node is cache tree info
Text, -- this is a text line
If_Stmt, -- an IF tag statement
Table_Stmt, -- a TABLE tag statement
Section_Stmt, -- a TABLE section
Include_Stmt); -- an INCLUDE tag statement
-- A template line is coded as a suite of Data and Var element.
-- The first node in the tree is of type Info and should never be release
-- and changed. This ensure that included tree will always be valid
-- otherwise will would have to parse all the current trees in the cache
-- to update the reference.
type Node;
type Tree is access Node;
-- Static_Tree represent a Tree immune to cache changes. Info point to the
-- first node and C_Info to the second one. C_Info could be different to
-- Info.Next in case of cache changes. This way we keep a pointer to the
-- old tree to be able to release it when not used anymore. This way it is
-- possible to use the cache in multitasking program without trouble. The
-- changes in the cache are either because more than one task is parsing
-- the same template at the same time, they will update the cache with the
-- same tree at some point, or because a newer template was found in the
-- file system.
type Static_Tree is record
Info : Tree;
C_Info : Tree;
end record;
type Node (Kind : Nkind) is record
Next : Tree;
Line : Natural;
case Kind is
when Info =>
Filename : Unbounded_String; -- Name of the file
Timestamp : GNAT.OS_Lib.OS_Time; -- Date and Time of last change
I_File : Tree; -- Included file references
-- Used for the cache system
Ref : Natural := 0; -- Number of ref in the cache
when C_Info =>
Obsolete : Boolean := False; -- True if newer version in cache
Used : Natural := 0; -- >0 if currently used
when Text =>
Text : Data.Tree;
when If_Stmt =>
Cond : Expr.Tree;
N_True : Tree;
N_False : Tree;
when Table_Stmt =>
Terminate_Sections : Boolean;
Sections : Tree;
when Section_Stmt =>
N_Section : Tree;
when Include_Stmt =>
File : Static_Tree;
end case;
end record;
procedure Release (T : in out Tree);
-- Release all memory associated with the tree.
procedure Free is new Ada.Unchecked_Deallocation (Node, Tree);
-------------------
-- Cached Files --
-------------------
-- Cached_Files keep the parsed Tree for a given file in memory. This
-- implementation is thread safe so it is possible to use the cache in a
-- multitasking program.
package Cached_Files is
protected Prot is
procedure Add
(Filename : in String;
T : in Tree;
Old : out Tree);
-- Add Filename/T to the list of cached files. If Filename is
-- already in the list, replace the current tree with T. Furthemore
-- if Filename tree is already in use, Old will be set with the
-- previous C_Info node otherwise Old will be T.Next (C_Info node
-- for current tree).
procedure Get
(Filename : in String;
Load : in Boolean;
Result : out Static_Tree);
-- Returns the Tree for Filename or null if Filename has not been
-- cached. Load must be set to True at load stage and False at Parse
-- stage.
procedure Release (T : in out Static_Tree);
-- After loading a tree and using it, it is required that it be
-- released. This will ensure that a tree marked as obsolete (a new
-- version being now in the cache) will be released from the memory.
end Prot;
end Cached_Files;
----------------
-- Vector_Tag --
----------------
procedure Field
(Vect : in Vector_Tag;
N : in Positive;
Result : out Unbounded_String;
Found : out Boolean);
-- Returns the Nth value in the vector tag. Found is set to False if
-- N > Vect_Value'Last.
---------
-- "+" --
---------
function "+" (Value : in String) return Vector_Tag is
Item : constant Vector_Tag_Node_Access
:= new Vector_Tag_Node'(To_Unbounded_String (Value), null);
begin
return Vector_Tag'
(Ada.Finalization.Controlled with
Ref_Count => new Integer'(1),
Count => 1,
Head => Item,
Last => Item,
Current => new Vector_Tag_Node_Access'(Item),
Pos => new Integer'(1));
end "+";
function "+" (Value : in Character) return Vector_Tag is
begin
return +String'(1 => Value);
end "+";
function "+" (Value : in Boolean) return Vector_Tag is
begin
return +Boolean'Image (Value);
end "+";
function "+" (Value : in Strings.Unbounded.Unbounded_String)
return Vector_Tag is
begin
return +To_String (Value);
end "+";
function "+" (Value : in Integer) return Vector_Tag is
begin
return +Image (Value);
end "+";
---------
-- "&" --
---------
function "&"
(Vect : in Vector_Tag;
Value : in String)
return Vector_Tag
is
Item : constant Vector_Tag_Node_Access
:= new Vector_Tag_Node'(To_Unbounded_String (Value), null);
begin
Vect.Ref_Count.all := Vect.Ref_Count.all + 1;
if Vect.Count = 0 then
return Vector_Tag'
(Ada.Finalization.Controlled with
Ref_Count => Vect.Ref_Count,
Count => 1,
Head => Item,
Last => Item,
Current => new Vector_Tag_Node_Access'(Item),
Pos => Vect.Pos);
else
Vect.Last.Next := Item;
return Vector_Tag'
(Ada.Finalization.Controlled with
Ref_Count => Vect.Ref_Count,
Count => Vect.Count + 1,
Head => Vect.Head,
Last => Item,
Current => Vect.Current,
Pos => Vect.Pos);
end if;
end "&";
function "&"
(Vect : in Vector_Tag;
Value : in Character)
return Vector_Tag is
begin
return Vect & String'(1 => Value);
end "&";
function "&"
(Vect : in Vector_Tag;
Value : in Boolean)
return Vector_Tag is
begin
return Vect & Boolean'Image (Value);
end "&";
function "&"
(Vect : in Vector_Tag;
Value : in Strings.Unbounded.Unbounded_String)
return Vector_Tag is
begin
return Vect & To_String (Value);
end "&";
function "&"
(Vect : in Vector_Tag;
Value : in Integer)
return Vector_Tag is
begin
return Vect & Image (Value);
end "&";
-----------
-- Clear --
-----------
procedure Clear (Vect : in out Vector_Tag) is
begin
-- Here we just separate current vector from the new one. The memory
-- used by the current one will be collected by the Finalize
-- routine. We just want a new independant Vector_Tag here.
Finalize (Vect);
Vect.Ref_Count := new Integer'(1);
Vect.Pos := new Integer'(1);
Vect.Count := 0;
Vect.Head := null;
Vect.Last := null;
Vect.Current := null;
end Clear;
------------
-- Adjust --
------------
procedure Adjust (V : in out Vector_Tag) is
begin
V.Ref_Count.all := V.Ref_Count.all + 1;
end Adjust;
----------------
-- Initialize --
----------------
procedure Initialize (V : in out Vector_Tag) is
begin
V.Ref_Count := new Integer'(1);
V.Pos := new Integer'(1);
V.Count := 0;
end Initialize;
----------
-- Item --
----------
function Item (Vect : in Vector_Tag; N : in Positive) return String is
Result : Unbounded_String;
Found : Boolean;
begin
Field (Vect, N, Result, Found);
if not Found then
raise Constraint_Error;
else
return To_String (Result);
end if;
end Item;
--------------
-- Finalize --
--------------
procedure Finalize (V : in out Vector_Tag) is
begin
V.Ref_Count.all := V.Ref_Count.all - 1;
if V.Ref_Count.all = 0 then
declare
procedure Free is new Ada.Unchecked_Deallocation
(Vector_Tag_Node, Vector_Tag_Node_Access);
procedure Free is new Ada.Unchecked_Deallocation
(Vector_Tag_Node_Access, Access_Vector_Tag_Node_Access);
procedure Free is new Ada.Unchecked_Deallocation
(Integer, Integer_Access);
P, N : Vector_Tag_Node_Access;
begin
P := V.Head;
while P /= null loop
N := P.Next;
Free (P);
P := N;
end loop;
V.Head := null;
V.Last := null;
Free (V.Ref_Count);
Free (V.Pos);
Free (V.Current);
end;
end if;
end Finalize;
----------
-- Size --
----------
function Size (Vect : in Vector_Tag) return Natural is
begin
return Vect.Count;
end Size;
----------------
-- Matrix_Tag --
----------------
procedure Field
(Matrix : in Matrix_Tag;
I, J : in Natural;
Result : out Unbounded_String;
Found : out Boolean);
-- Returns Value in Mat_Value (I, J). Found is set to False if there is
-- no such value in Mat_Value.
procedure Vector
(Matrix : in Matrix_Tag;
N : in Positive;
Vect : out Vector_Tag;
Found : out Boolean);
-- Returns Vect in Matrix (N). Found is set to False if there is no such
-- vector in Matrix.
---------
-- "+" --
---------
function "+" (Vect : in Vector_Tag) return Matrix_Tag is
Item : constant Matrix_Tag_Node_Access
:= new Matrix_Tag_Node'(Vect, null);
V_Size : constant Natural := Size (Vect);
begin
return Matrix_Tag'
(M => (Ada.Finalization.Controlled with
Ref_Count => New Integer'(1),
Count => 1,
Min => V_Size,
Max => V_Size,
Head => Item,
Last => Item,
Current => new Matrix_Tag_Node_Access'(Item),
Pos => new Integer'(1)));
end "+";
---------
-- "&" --
---------
function "&"
(Matrix : in Matrix_Tag;
Vect : in Vector_Tag)
return Matrix_Tag
is
Item : constant Matrix_Tag_Node_Access
:= new Matrix_Tag_Node'(Vect, null);
V_Size : constant Natural := Size (Vect);
begin
Matrix.M.Ref_Count.all := Matrix.M.Ref_Count.all + 1;
if Matrix.M.Head = null then
return (M => (Ada.Finalization.Controlled with
Matrix.M.Ref_Count,
Matrix.M.Count + 1,
Min => Natural'Min (Matrix.M.Min, V_Size),
Max => Natural'Max (Matrix.M.Max, V_Size),
Head => Item,
Last => Item,
Current => new Matrix_Tag_Node_Access'(Item),
Pos => Matrix.M.Pos));
else
Matrix.M.Last.Next := Item;
return (M => (Ada.Finalization.Controlled with
Matrix.M.Ref_Count,
Matrix.M.Count + 1,
Min => Natural'Min (Matrix.M.Min, V_Size),
Max => Natural'Max (Matrix.M.Max, V_Size),
Head => Matrix.M.Head,
Last => Item,
Current => Matrix.M.Current,
Pos => Matrix.M.Pos));
end if;
end "&";
----------
-- Size --
----------
function Size (Matrix : in Matrix_Tag) return Natural is
begin
return Matrix.M.Count;
end Size;
----------------
-- Initialize --
----------------
procedure Initialize (M : in out Matrix_Tag_Int) is
begin
M.Ref_Count := new Integer'(1);
M.Pos := new Integer'(1);
M.Count := 0;
M.Min := Natural'Last;
M.Max := 0;
end Initialize;
--------------
-- Finalize --
--------------
procedure Finalize (M : in out Matrix_Tag_Int) is
begin
M.Ref_Count.all := M.Ref_Count.all - 1;
if M.Ref_Count.all = 0 then
declare
procedure Free is new Ada.Unchecked_Deallocation
(Matrix_Tag_Node, Matrix_Tag_Node_Access);
procedure Free is new Ada.Unchecked_Deallocation
(Matrix_Tag_Node_Access, Access_Matrix_Tag_Node_Access);
procedure Free is new Ada.Unchecked_Deallocation
(Integer, Integer_Access);
P, N : Matrix_Tag_Node_Access;
begin
P := M.Head;
while P /= null loop
N := P.Next;
Free (P);
P := N;
end loop;
M.Head := null;
M.Last := null;
Free (M.Ref_Count);
Free (M.Pos);
Free (M.Current);
end;
end if;
end Finalize;
------------
-- Adjust --
------------
procedure Adjust (M : in out Matrix_Tag_Int) is
begin
M.Ref_Count.all := M.Ref_Count.all + 1;
end Adjust;
------------
-- Vector --
------------
procedure Vector
(Matrix : in Matrix_Tag;
N : in Positive;
Vect : out Vector_Tag;
Found : out Boolean) is
begin
Found := True;
if N = Matrix.M.Count then
Vect := Matrix.M.Last.Vect;
elsif N >= Matrix.M.Pos.all then
for K in 1 .. N - Matrix.M.Pos.all loop
Matrix.M.Pos.all := Matrix.M.Pos.all + 1;
Matrix.M.Current.all := Matrix.M.Current.all.Next;
end loop;
Vect := Matrix.M.Current.all.Vect;
elsif N > Matrix.M.Count then
Found := False;
else
declare
P : Matrix_Tag_Node_Access := Matrix.M.Head;
begin
for K in 1 .. N - 1 loop
P := P.Next;
end loop;
Matrix.M.Pos.all := N;
Matrix.M.Current.all := P;
Vect := P.Vect;
end;
end if;
end Vector;
function Vector
(Matrix : in Matrix_Tag;
N : in Positive)
return Vector_Tag
is
Result : Vector_Tag;
Found : Boolean;
begin
Vector (Matrix, N, Result, Found);
if Found then
return Result;
else
Exceptions.Raise_Exception
(Constraint_Error'Identity, "Index out of range");
end if;
end Vector;
------------------
-- Cached_Files --
------------------
package body Cached_Files is separate;
----------
-- Data --
----------
package body Data is separate;
----------
-- Expr --
----------
package body Expr is separate;
-----------
-- Field --
-----------
procedure Field
(Vect : in Vector_Tag;
N : in Positive;
Result : out Unbounded_String;
Found : out Boolean) is
begin
Found := True;
if N = Vect.Count then
Result := Vect.Last.Value;
elsif N > Vect.Count then
Result := Null_Unbounded_String;
Found := False;
elsif N >= Vect.Pos.all then
for K in 1 .. N - Vect.Pos.all loop
Vect.Pos.all := Vect.Pos.all + 1;
Vect.Current.all := Vect.Current.all.Next;
end loop;
Result := Vect.Current.all.Value;
else
declare
P : Vector_Tag_Node_Access := Vect.Head;
begin
for K in 1 .. N - 1 loop
P := P.Next;
end loop;
Vect.Pos.all := N;
Vect.Current.all := P;
Result := P.Value;
end;
end if;
end Field;
procedure Field
(Matrix : in Matrix_Tag;
I, J : in Natural;
Result : out Unbounded_String;
Found : out Boolean) is
begin
Found := True;
if I = Matrix.M.Count then
Field (Matrix.M.Last.Vect, J, Result, Found);
elsif I > Matrix.M.Count then
Result := Null_Unbounded_String;
Found := False;
elsif I >= Matrix.M.Pos.all then
for K in 1 .. I - Matrix.M.Pos.all loop
Matrix.M.Pos.all := Matrix.M.Pos.all + 1;
Matrix.M.Current.all := Matrix.M.Current.all.Next;
end loop;
Field (Matrix.M.Current.all.Vect, J, Result, Found);
else
declare
P : Matrix_Tag_Node_Access := Matrix.M.Head;
begin
for K in 1 .. I - 1 loop
P := P.Next;
end loop;
Matrix.M.Pos.all := I;
Matrix.M.Current.all := P;
Field (P.Vect, J, Result, Found);
end;
end if;
end Field;
------------
-- Filter --
------------
package body Filter is separate;
-----------
-- Assoc --
-----------
function Assoc
(Variable : in String;
Value : in String)
return Association is
begin
return Association'
(Std,
To_Unbounded_String (Variable),
To_Unbounded_String (Value));
end Assoc;
function Assoc
(Variable : in String;
Value : in Ada.Strings.Unbounded.Unbounded_String)
return Association is
begin
return Assoc (Variable, To_String (Value));
end Assoc;
function Assoc
(Variable : in String;
Value : in Integer)
return Association
is
S_Value : constant String := Integer'Image (Value);
begin
return Assoc (Variable, Image (Value));
end Assoc;
function Assoc
(Variable : in String;
Value : in Boolean)
return Association is
begin
if Value then
return Assoc (Variable, "TRUE");
else
return Assoc (Variable, "FALSE");
end if;
end Assoc;
function Assoc
(Variable : in String;
Value : in Vector_Tag;
Separator : in String := Default_Separator)
return Association is
begin
return Association'
(Vect,
To_Unbounded_String (Variable),
Value,
To_Unbounded_String (Separator));
end Assoc;
function Assoc
(Variable : in String;
Value : in Matrix_Tag;
Separator : in String := Default_Separator)
return Association is
begin
return Association'
(Matrix,
To_Unbounded_String (Variable),
Value,
To_Unbounded_String (Separator));
end Assoc;
----------
-- Load --
----------
function Load
(Filename : in String;
Cached : in Boolean := False;
Include_File : in Boolean := False)
return Static_Tree
is
File : Input.File_Type; -- file beeing parsed.
Buffer : String (1 .. 2048); -- current line content
Last : Natural; -- index of last characters read in buffer
First : Natural; -- first non blank characters in buffer
Line : Natural := 0;
I_File : Tree; -- list of includes
Error_Include_Filename : Unbounded_String;
-- This variable will be set with the name of the include file that was
-- not possible to load.
-- Line handling
procedure Fatal_Error (Message : in String);
pragma No_Return (Fatal_Error);
-- raise Template_Error exception with message.
function Get_Next_Line return Boolean;
-- Get new line in File and set Buffer, Last and First. Returns True if
-- end of file reached.
function Get_First_Parameter return Unbounded_String;
-- Get first parameter in current line (second word), words beeing
-- separated by a set of blank characters (space or horizontal
-- tabulation).
function Get_All_Parameters return String;
-- Get all parameters on the current line.
function Is_Stmt (Stmt : in String) return Boolean;
pragma Inline (Is_Stmt);
-- Returns True is Stmt is found at the begining of the current line
-- ignoring leading blank characters.
function EOF return Boolean;
pragma Inline (EOF);
-- Returns True if the end of file has been reach.
function Build_Include_Pathname
(Include_Filename : in Unbounded_String)
return String;
-- Returns the full pathname to the include file (Include_Filename). It
-- returns Include_Filename if there is a pathname specified, or the
-- pathname of the main template file as a prefix of the include
-- filename.
procedure Replace_Include_Variables
(File : in out Static_Tree;
Variables : in String);
-- Parse the include tree and replace all include variables (numeric
-- name) with the corresponding value in Variables (a set of space
-- separated words). The first word in Variables is the include file
-- name (variable 0), other words are the parameters (variable 1 .. N).
type Parse_Mode is
(Parse_Std, -- in standard line
Parse_If, -- in a if statement
Parse_Elsif, -- in elsif part of a if statement
Parse_Else, -- in else part of a if statement
Parse_Table, -- in a table statement
Parse_Section, -- in new section
Parse_Section_Content -- in section content
);
function Parse
(Mode : in Parse_Mode;
No_Read : in Boolean := False)
return Tree;
-- Get a line in File and returns the Tree.
----------------------------
-- Build_Include_Pathname --
----------------------------
function Build_Include_Pathname
(Include_Filename : in Unbounded_String)
return String
is
K : constant Natural
:= Index (Include_Filename, Maps.To_Set ("/\"),
Going => Strings.Backward);
begin
if K = 0 then
declare
K : constant Natural
:= Fixed.Index (Filename, Maps.To_Set ("/\"),
Going => Strings.Backward);
begin
if K = 0 then
return To_String (Include_Filename);
else
return Filename (Filename'First .. K)
& To_String (Include_Filename);
end if;
end;
else
return To_String (Include_Filename);
end if;
end Build_Include_Pathname;
---------
-- EOF --
---------
function EOF return Boolean is
begin
return Last = 0;
end EOF;
-----------------
-- Fatal_Error --
-----------------
procedure Fatal_Error (Message : in String) is
begin
Exceptions.Raise_Exception
(Template_Error'Identity,
"In " & Filename
& " at line" & Natural'Image (Line) & ' ' & Message & '.');
end Fatal_Error;
------------------------
-- Get_All_Parameters --
------------------------
function Get_All_Parameters return String is
Start : Natural;
begin
Start := Strings.Fixed.Index (Buffer (First .. Last), Blank);
if Start = 0 then
Fatal_Error ("missing parameter");
end if;
if Buffer (Last) = ASCII.CR then
-- Last character is a DOS CR (certainly because the template
-- file is in DOS format), ignore it as this is not part of the
-- parameter.
Last := Last - 1;
end if;
return Strings.Fixed.Trim (Buffer (Start .. Last), Strings.Both);
end Get_All_Parameters;
-------------------------
-- Get_First_Parameter --
-------------------------
function Get_First_Parameter return Unbounded_String is
Start, Stop : Natural;
begin
Start := Strings.Fixed.Index (Buffer (First .. Last), Blank);
if Start = 0 then
return Null_Unbounded_String;
end if;
Start := Strings.Fixed.Index (Buffer (Start .. Last), Blank, Outside);
if Start = 0 then
-- We have only spaces after the first word, there is no
-- parameter in this case.
return Null_Unbounded_String;
end if;
Stop := Strings.Fixed.Index (Buffer (Start .. Last), Blank);
if Stop = 0 then
Stop := Last;
else
Stop := Stop - 1;
end if;
return To_Unbounded_String (Buffer (Start .. Stop));
end Get_First_Parameter;
-------------------
-- Get_Next_Line --
-------------------
function Get_Next_Line return Boolean is
use type Maps.Character_Set;
Skip_End : constant Maps.Character_Set
:= Blank or Maps.To_Set (ASCII.CR);
begin
if Input.End_Of_File (File) then
Last := 0;
return True;
else
Line := Line + 1;
loop
Input.Get_Line (File, Buffer, Last);
exit when Buffer (Buffer'First .. Buffer'First + 3) /= "@@--";
if Input.End_Of_File (File) then
-- We have reached the end of file, exit now.
Last := 0;
return True;
end if;
end loop;
First := Strings.Fixed.Index (Buffer (1 .. Last), Blank, Outside);
if First = 0 then
-- There is only spaces on this line, this is an empty line
-- we just have to skip it.
Last := 0;
return False;
end if;
Last := Strings.Fixed.Index
(Buffer (1 .. Last), Skip_End, Outside, Strings.Backward);
return False;
end if;
end Get_Next_Line;
-------------
-- Is_Stmt --
-------------
function Is_Stmt (Stmt : in String) return Boolean is
begin
return Last /= 0
and then Buffer (First .. First + Stmt'Length - 1) = Stmt;
end Is_Stmt;
-----------
-- Parse --
-----------
function Parse
(Mode : in Parse_Mode;
No_Read : in Boolean := False)
return Tree
is
T : Tree;
begin
if not No_Read
and then (Mode /= Parse_Section and then Mode /= Parse_Elsif)
then
if Get_Next_Line then
return null;
end if;
end if;
case Mode is
when Parse_Std =>
if Is_Stmt (End_If_Token) then
Fatal_Error
("@@END_IF@@ found outside an @@IF@@ statement");
end if;
if Is_Stmt (End_Table_Token) then
Fatal_Error
("@@END_TABLE@@ found outside a @@TABLE@@ statement");
end if;
when Parse_If =>
if Is_Stmt (Else_Token)
or else Is_Stmt (Elsif_Token)
or else Is_Stmt (End_If_Token)
then
return null;
end if;
if Is_Stmt (End_Table_Token) then
Fatal_Error ("@@END_TABLE@@ found, @@END_IF@@ expected");
end if;
when Parse_Elsif =>
if Is_Stmt (Else_Token)
or else Is_Stmt (End_If_Token)
then
return null;
end if;
if Is_Stmt (End_Table_Token) then
Fatal_Error ("@@END_TABLE@@ found, @@END_IF@@ expected");
end if;
when Parse_Else =>
if Is_Stmt (End_If_Token) then
return null;
end if;
if Is_Stmt (End_Table_Token) then
Fatal_Error ("@@END_TABLE@@ found, @@END_IF@@ expected");
end if;
if Is_Stmt (Elsif_Token) then
Fatal_Error ("@@ELSIF@@ found after @@ELSE@@");
end if;
when Parse_Section =>
if Is_Stmt (End_If_Token) then
Fatal_Error ("@@END_IF@@ found, @@END_TABLE@@ expected");
end if;
T := new Node (Section_Stmt);
T.Line := Line;
T.Next := Parse (Parse_Section_Content);
if Is_Stmt (End_Table_Token) then
T.N_Section := null;
elsif EOF then
Fatal_Error ("EOF found, @@END_TABLE@@ expected");
else
T.N_Section := Parse (Parse_Section);
end if;
return T;
when Parse_Section_Content =>
if Is_Stmt (Section_Token)
or else Is_Stmt (End_Table_Token)
then
return null;
end if;
if Is_Stmt (End_If_Token) then
Fatal_Error ("@@END_IF@@ found, @@END_TABLE@@ expected");
end if;
when Parse_Table =>
if Is_Stmt (End_Table_Token) then
return null;
end if;
if Is_Stmt (End_If_Token) then
Fatal_Error ("@@END_IF@@ found, @@END_TABLE@@ expected");
end if;
end case;
if Is_Stmt (If_Token) or else Is_Stmt (Elsif_Token) then
T := new Node (If_Stmt);
T.Line := Line;
T.Cond := Expr.Parse (Get_All_Parameters);
T.N_True := Parse (Parse_If);
if Is_Stmt (End_If_Token) then
T.N_False := null;
elsif Is_Stmt (Elsif_Token) then
T.N_False := Parse (Parse_Elsif);
elsif EOF then
Fatal_Error ("EOF found, @@END_IF@@ expected");
else
T.N_False := Parse (Parse_Else);
end if;
T.Next := Parse (Mode);
return T;
elsif Is_Stmt (Table_Token) then
T := new Node (Table_Stmt);
T.Line := Line;
T.Terminate_Sections
:= Get_First_Parameter = Terminate_Sections_Token;
T.Sections := Parse (Parse_Section);
T.Next := Parse (Mode);
return T;
elsif Is_Stmt (Include_Token) then
T := new Node (Include_Stmt);
T.Line := Line;
begin
T.File
:= Load (Build_Include_Pathname (Get_First_Parameter),
Cached, True);
exception
when others =>
-- Error while parsing the include file, record this
-- error. Let the parser exit properly from the recursion
-- to be able to release properly the memory before
-- raising an exception.
Error_Include_Filename := Get_First_Parameter;
Free (T);
return null;
end;
-- Now we must replace the include parameters (if present) into
-- the included file tree.
Replace_Include_Variables (T.File, Get_All_Parameters);
I_File := new Node'(Include_Stmt, I_File, Line, T.File);
T.Next := Parse (Mode);
return T;
else
declare
Root, N : Tree;
begin
loop
N := new Node (Text);
if Root = null then
Root := N;
else
T.Next := N;
end if;
T := N;
T.Line := Line;
if Input.LF_Terminated (File)
and then (not Input.End_Of_File (File)
or else Include_File)
then
-- Add a LF is the read line with terminated by a LF. Do
-- not add this LF if we reach the end of file except for
-- included files.
T.Text := Data.Parse (Buffer (1 .. Last) & ASCII.LF);
else
T.Text := Data.Parse (Buffer (1 .. Last));
end if;
if Get_Next_Line then
-- Nothing more, returns the result now.
return Root;
end if;
-- If this is a statement just call the parsing routine
if Is_Stmt (If_Token)
or else Is_Stmt (ElsIf_Token)
or else Is_Stmt (Else_Token)
or else Is_Stmt (End_If_Token)
or else Is_Stmt (Include_Token)
or else Is_Stmt (Table_Token)
or else Is_Stmt (Section_Token)
or else Is_Stmt (End_Table_Token)
then
T.Next := Parse (Mode, No_Read => True);
return Root;
end if;
end loop;
end;
end if;
end Parse;
-------------------------------
-- Replace_Include_Variables --
-------------------------------
procedure Replace_Include_Variables
(File : in out Static_Tree;
Variables : in String)
is
procedure Replace (T : in out Tree);
-- Recursive routine to parse the tree for all Data.Tree node
procedure Replace (T : in out Data.Tree);
-- Recursive routine that replace all numeric variables by the
-- corresponding parameter in Variables.
function Get_Variable (Tag : in String) return String;
-- Returns the variable name for the include tag Tag. Tag is a
-- numeric value and represent the Nth include parameter.
function Is_Number (Name : in String) return Boolean;
-- Returns True if Name is an include tag variable ($<n>)
------------------
-- Get_Variable --
------------------
function Get_Variable (Tag : in String) return String is
T : constant Natural
:= Natural'Value (Tag (Tag'First + 1 .. Tag'Last));
S : Natural := Variables'First;
E : Natural;
K : Natural := 0;
begin
loop
if Variables (S) = '"' then
-- Search for the ending quote
E := Strings.Fixed.Index
(Variables (S + 1 .. Variables'Last), """");
if E = 0 then
Fatal_Error ("Missing quote");
else
E := E + 1;
end if;
else
-- Search for the next separator
E := Strings.Fixed.Index
(Variables (S .. Variables'Last), Blank);
end if;
if E = 0 and then K /= T then
-- Not found, return the original tag name
return To_String (Begin_Tag) & Tag & To_String (End_Tag);
elsif K = T then
-- We have found the right variable
if E = 0 then
E := Variables'Last;
else
E := E - 1;
end if;
-- Always return the variable or value unquoted
if Variables (S) = '"' then
return Variables (S + 1 .. E - 1);
else
return Variables (S .. E);
end if;
else
-- Set the new start
S := E;
S := Strings.Fixed.Index
(Variables (S .. Variables'Last), Blank, Strings.Outside);
if S = 0 then
-- No more values, return the original tag name
return To_String (Begin_Tag) & Tag & To_String (End_Tag);
end if;
end if;
K := K + 1;
end loop;
end Get_Variable;
---------------
-- Is_Number --
---------------
function Is_Number (Name : in String) return Boolean is
begin
return Name'Length > 1
and then Name (Name'First) = '$'
and then Strings.Fixed.Count
(Name, Strings.Maps.Constants.Decimal_Digit_Set)
= Name'Length - 1;
end Is_Number;
-------------
-- Replace --
-------------
procedure Replace (T : in out Data.Tree) is
use type Data.NKind;
use type Data.Tree;
use type Filter.Set_Access;
procedure Free is
new Ada.Unchecked_Deallocation (Data.Node, Data.Tree);
Old : Data.Tree := T;
begin
if T /= null then
if T.Kind = Data.Var then
if Is_Number (To_String (T.Var.Name)) then
-- Here we have an include variable name, replace it
T := Data.Parse (Get_Variable (To_String (T.Var.Name)));
T.Next := Old.Next;
case T.Kind is
when Data.Var =>
-- The new node is also a variable, inherit all the
-- filters and attribute
T.Var.Filters := Old.Var.Filters;
T.Var.Attr := Old.Var.Attr;
when Data.Text =>
-- The new node is a value, apply filters if the
-- previous node had some.
if Old.Var.Filters /= null then
T.Value := To_Unbounded_String
(Translate (Old.Var, To_String (T.Value)));
end if;
-- Free filters
Release (Old.Var);
end case;
-- Free only node
Free (Old);
end if;
end if;
Replace (T.Next);
end if;
end Replace;
-------------
-- Replace --
-------------
procedure Replace (T : in out Expr.Tree) is
use type Expr.NKind;
use type Expr.Tree;
use type Filter.Set_Access;
procedure Free is
new Ada.Unchecked_Deallocation (Expr.Node, Expr.Tree);
Old : Expr.Tree := T;
begin
if T /= null then
case T.Kind is
when Expr.Var =>
if Is_Number (To_String (T.Var.Name)) then
-- Here we have an include variable name, replace it
declare
New_Value : constant String
:= Get_Variable (To_String (T.Var.Name));
begin
if Strings.Fixed.Index (New_Value, " ") = 0 then
T := Expr.Parse (New_Value);
else
-- There is some spaces in the new value,
-- this can't be a variable so it is a value
-- with multiple word, quote it to ensure a
-- correct parsing.
T := Expr.Parse ('"' & New_Value & '"');
end if;
end;
case T.Kind is
when Expr.Var =>
-- The new node is also a variable, inherit all
-- the filters.
T.Var.Filters := Old.Var.Filters;
T.Var.Attr := Old.Var.Attr;
when Expr.Value =>
-- The new node is a value, apply filters if the
-- previous node had some.
if Old.Var.Filters /= null then
T.V := To_Unbounded_String
(Translate (Old.Var, To_String (T.V)));
end if;
-- Free filters
Release (Old.Var);
when Expr.Op | Expr.U_Op =>
-- Should never happen
Fatal_Error
("Var or Value node kind expected,"
& " Op or U_Op found ");
end case;
Free (Old);
end if;
when Expr.Op =>
Replace (T.Left);
Replace (T.Right);
when Expr.U_Op =>
Replace (T.Next);
when Expr.Value =>
null;
end case;
end if;
end Replace;
-------------
-- Replace --
-------------
procedure Replace (T : in out Tree) is
use type Tree;
begin
if T /= null then
case T.Kind is
when Text =>
Replace (T.Text);
when If_Stmt =>
Replace (T.Cond);
Replace (T.N_True);
Replace (T.N_False);
when Table_Stmt =>
Replace (T.Sections);
when Include_Stmt =>
Replace (T.File.C_Info);
when Section_Stmt =>
Replace (T.N_Section);
when Info | C_Info =>
null;
end case;
Replace (T.Next);
end if;
end Replace;
begin
Replace (File.C_Info);
end Replace_Include_Variables;
T : Static_Tree;
New_T : Tree;
Old : Tree;
begin
if Cached then
Cached_Files.Prot.Get (Filename, Load => True, Result => T);
if T.Info /= null then
pragma Assert (T.C_Info /= null);
return T;
end if;
end if;
Input.Open (File, Filename, Form => "shared=no");
New_T := Parse (Parse_Std);
Input.Close (File);
-- T is the tree file, add two nodes (Info and C_Info) in front of the
-- tree.
-- Add second node (cache info)
Old := new Node'(C_Info, New_T, 0, False, 1);
-- Add first node (info about tree)
New_T := new Node'(Info,
Old,
0,
To_Unbounded_String (Filename),
GNAT.OS_Lib.File_Time_Stamp (Filename),
I_File,
1);
if Error_Include_Filename /= Null_Unbounded_String then
-- An include filename was not found, release the memory now and
-- raise a fatal error.
Release (New_T);
Fatal_Error
(To_String (Error_Include_Filename) & " include file missing");
end if;
if Cached then
Cached_Files.Prot.Add (Filename, New_T, Old);
pragma Assert (Old /= null);
end if;
return Static_Tree'(New_T, Old);
exception
when E : Internal_Error =>
Fatal_Error (Exceptions.Exception_Message (E));
end Load;
----------------
-- Print_Tree --
----------------
procedure Print_Tree (T : in Tree; Level : in Natural := 0) is separate;
----------------
-- Print_Tree --
----------------
procedure Print_Tree (Filename : in String) is
T : Static_Tree;
begin
T := Load (Filename);
Print_Tree (T.Info);
Release (T.Info);
end Print_Tree;
-----------
-- Parse --
-----------
function Parse
(Filename : in String;
Translations : in Translate_Table := No_Translation;
Cached : in Boolean := False;
Keep_Unknown_Tags : in Boolean := False)
return String is
begin
return To_String
(Parse (Filename, Translations, Cached, Keep_Unknown_Tags));
end Parse;
-----------
-- Parse --
-----------
function Parse
(Filename : in String;
Translations : in Translate_Table := No_Translation;
Cached : in Boolean := False;
Keep_Unknown_Tags : in Boolean := False)
return Unbounded_String
is
type Table_State is record
I, J : Natural;
Max_Lines : Natural;
Max_Expand : Natural;
Table_Level : Natural;
Section_Number : Natural;
end record;
Empty_State : constant Table_State := (0, 0, 0, 0, 0, 0);
Results : Unbounded_String := Null_Unbounded_String;
Buffer : String (1 .. 4 * 1_024);
Last : Natural := 0;
-- Cache to avoid too many reallocation using Append on Results above
Now : Calendar.Time;
procedure Analyze
(T : in Tree;
State : in Table_State);
-- Parse T and build results file. State is needed for Vector_Tag and
-- Matrix_Tag expansion.
-------------
-- Analyze --
-------------
procedure Analyze
(T : in Tree;
State : in Table_State)
is
function Analyze (E : in Expr.Tree) return String;
-- Analyse the expression tree and returns the result as a boolean
-- The conditional expression must be equal to either TRUE or
-- FALSE. Note that a string is True if it is equal to string "TRUE"
-- and False otherwise.
procedure Analyze (D : in Data.Tree);
-- Analyse the data tree and replace all variables by the
-- correspinding value specified in Translations. This procedure
-- catenate the result into Results variable.
procedure Get_Max
(T : in Tree;
Max_Lines : out Natural;
Max_Expand : out Natural);
-- Returns the maximum number of lines (Max_Lines) into the
-- table. This correspond to the length of the shortest vector tag
-- into the table or the shortest number of lines in sub-table
-- matrix tag.
-- Returns also the number of time the table will be expanded
-- (Max_Expand), this is equal to Max_Lines + offset to terminate
-- the sections.
function Is_True (Str : in String) return Boolean;
-- Return True if Str is one of "TRUE", "OUI", the case beeing not
-- case sensitive.
function Translate (Var : in Tag) return String;
-- Translate Tag variable using Translation table and apply all
-- Filters and Atribute recorded for this variable.
---------------
-- Translate --
---------------
function Translate (Var : in Tag) return String is
function Vect_List (A : in Association) return String;
-- Returns the Vector_Tag for the Association as a String, each
-- value is separated by the given separator.
function Vect_Size (A : in Association) return String;
pragma Inline (Vect_Size);
-- Returns the number of items into the Vector_Tag
function Mat_List (A : in Association) return String;
-- Returns the Matrix_Tag as a string. If Matrix_Tag is not into
-- a table, each Vector_Tag is convected using Vect_List and a LF
-- is inserted between each rows. If the Matrix_Tag is into a
-- table of level 1, it returns only the Vector_Tag (converted
-- using Vect_List) for the current table line.
function Mat_Line (A : in Association) return String;
pragma Inline (Mat_Line);
-- Returns the number of line (vector) into the matrix
function Mat_Min_Column (A : in Association) return String;
pragma Inline (Mat_Line);
-- Returns the size of the smallest vector
function Mat_Max_Column (A : in Association) return String;
pragma Inline (Mat_Line);
-- Returns the size of the largest vector
---------------
-- Vect_List --
---------------
function Vect_List (A : in Association) return String is
Result : Unbounded_String;
P : Vector_Tag_Node_Access := A.Vect_Value.Head;
begin
if P = null then
return "";
else
Result := P.Value;
for K in 2 .. A.Vect_Value.Count loop
P := P.Next;
Append (Result, A.Separator & P.Value);
end loop;
return To_String (Result);
end if;
end Vect_List;
---------------
-- Vect_Size --
---------------
function Vect_Size (A : in Association) return String is
begin
return Image (A.Vect_Value.Count);
end Vect_Size;
--------------
-- Mat_List --
--------------
function Mat_List (A : in Association) return String is
Result : Unbounded_String;
P : Matrix_Tag_Node_Access := A.Mat_Value.M.Head;
procedure Add_Vector (V : in Vector_Tag);
-- Add V Vector_Tag representation into Result variable.
----------------
-- Add_Vector --
----------------
procedure Add_Vector (V : in Vector_Tag) is
P : Vector_Tag_Node_Access := V.Head;
begin
-- Check that vector is not empty
if P /= null then
Result := Result & P.Value;
for K in 2 .. V.Count loop
P := P.Next;
Append (Result, A.Column_Separator & P.Value);
end loop;
end if;
end Add_Vector;
begin
if State.Table_Level = 0 then
-- A Matrix outside a table statement.
loop
Add_Vector (P.Vect);
P := P.Next;
exit when P = null;
Append (Result, ASCII.LF);
end loop;
else
if not (State.J > A.Mat_Value.M.Count) then
Add_Vector (Vector (A.Mat_Value, State.J));
end if;
end if;
return To_String (Result);
end Mat_List;
--------------
-- Mat_Line --
--------------
function Mat_Line (A : in Association) return String is
begin
return Image (A.Mat_Value.M.Count);
end Mat_Line;
--------------------
-- Mat_Min_Column --
--------------------
function Mat_Min_Column (A : in Association) return String is
begin
return Image (A.Mat_Value.M.Min);
end Mat_Min_Column;
--------------------
-- Mat_Max_Column --
--------------------
function Mat_Max_Column (A : in Association) return String is
begin
return Image (A.Mat_Value.M.Max);
end Mat_Max_Column;
begin
for K in Translations'Range loop
if Var.Name = Translations (K).Variable then
declare
Tk : constant Association := Translations (K);
begin
case Tk.Kind is
when Std =>
if Var.Attr = Nil then
return Translate (Var, To_String (Tk.Value));
else
Exceptions.Raise_Exception
(Template_Error'Identity,
"Attribute not valid on a discrete tag");
end if;
when Vect =>
if Var.Attr = Length then
-- 'Length on a vector
return Translate (Var, Vect_Size (Tk));
elsif Var.Attr /= Nil then
Exceptions.Raise_Exception
(Template_Error'Identity,
"This attribute is not valid for a "
& "vector tag");
elsif State.Table_Level = 0 then
-- This is a vector tag (outside of a
-- table tag statement), we display it as
-- a list separated by the specified
-- separator.
return Translate (Var, Vect_List (Tk));
else
declare
Result : Unbounded_String;
Found : Boolean;
begin
Field (Tk.Vect_Value, State.J, Result, Found);
return Translate (Var, To_String (Result));
end;
end if;
when Matrix =>
if Var.Attr = Line then
-- 'Line on a matrix
return Translate (Var, Mat_Line (Tk));
elsif Var.Attr = Min_Column then
-- 'Min_Column on a matrix
return Translate (Var, Mat_Min_Column (Tk));
elsif Var.Attr = Max_Column then
-- 'Max_Column on a matrix
return Translate (Var, Mat_Max_Column (Tk));
elsif Var.Attr /= Nil then
Exceptions.Raise_Exception
(Template_Error'Identity,
"This attribute is not valid for a "
& "matrix tag");
elsif State.Table_Level in 0 .. 1 then
-- This is a matrix tag (outside of a
-- level 2 table tag statement), convert
-- it using Mat_List.
return Translate (Var, Mat_List (Tk));
else
declare
Result : Unbounded_String;
Found : Boolean;
begin
Field (Tk.Mat_Value, State.I, State.J,
Result, Found);
return Translate (Var, To_String (Result));
end;
end if;
end case;
end;
end if;
end loop;
-- Check now for an internal tag
declare
T_Name : constant String := To_String (Var.Name);
begin
if T_Name = "UP_TABLE_LINE" then
return Translate
(Var,
Fixed.Trim (Positive'Image (State.I), Strings.Left));
elsif T_Name = "TABLE_LINE" then
return Translate
(Var,
Fixed.Trim (Positive'Image (State.J), Strings.Left));
elsif T_Name = "NUMBER_LINE" then
return Translate
(Var,
Fixed.Trim (Positive'Image (State.Max_Lines),
Strings.Left));
elsif T_Name = "TABLE_LEVEL" then
return Translate
(Var,
Fixed.Trim (Positive'Image (State.Table_Level),
Strings.Left));
elsif T_Name = "YEAR" then
return Translate
(Var, GNAT.Calendar.Time_IO.Image (Now, "%Y"));
elsif T_Name = "MONTH" then
return Translate
(Var, GNAT.Calendar.Time_IO.Image (Now, "%m"));
elsif T_Name = "DAY" then
return Translate
(Var, GNAT.Calendar.Time_IO.Image (Now, "%d"));
elsif T_Name = "HOUR" then
return Translate
(Var, GNAT.Calendar.Time_IO.Image (Now, "%H"));
elsif T_Name = "MINUTE" then
return Translate
(Var, GNAT.Calendar.Time_IO.Image (Now, "%M"));
elsif T_Name = "SECOND" then
return Translate
(Var, GNAT.Calendar.Time_IO.Image (Now, "%S"));
elsif T_Name = "MONTH_NAME" then
return Translate
(Var, GNAT.Calendar.Time_IO.Image (Now, "%B"));
elsif T_Name = "DAY_NAME" then
return Translate
(Var, GNAT.Calendar.Time_IO.Image (Now, "%A"));
end if;
end;
-- The tag was not found in the Translation_Table, we either
-- returns the empty string or we keep the tag as is.
if Keep_Unknown_Tags then
return To_String (Begin_Tag & Var.Name & End_Tag);
else
return Translate (Var, "");
end if;
end Translate;
-------------
-- Analyze --
-------------
procedure Analyze (D : in Data.Tree) is
use type Data.Tree;
procedure Add (S : in String);
-- Add S into Results (using Buffer cache if possible)
---------
-- Add --
---------
procedure Add (S : in String) is
begin
if Last + S'Length > Buffer'Last then
-- Not enough cache space, flush buffer
Append (Results, Buffer (1 .. Last));
Last := 0;
end if;
if S'Length >= Buffer'Length then
Append (Results, S);
else
Buffer (Last + 1 .. Last + S'Length) := S;
Last := Last + S'Length;
end if;
end Add;
T : Data.Tree := D;
begin
while T /= null loop
case T.Kind is
when Data.Text =>
Add (To_String (T.Value));
when Data.Var =>
Add (Translate (T.Var));
end case;
T := T.Next;
end loop;
end Analyze;
-------------
-- Analyze --
-------------
function Analyze (E : in Expr.Tree) return String is
type Ops_Fct is access function (L, R : in String) return String;
function F_And (L, R : in String) return String;
function F_Or (L, R : in String) return String;
function F_Xor (L, R : in String) return String;
function F_Sup (L, R : in String) return String;
function F_Esup (L, R : in String) return String;
function F_Einf (L, R : in String) return String;
function F_Inf (L, R : in String) return String;
function F_Equ (L, R : in String) return String;
function F_Diff (L, R : in String) return String;
type U_Ops_Fct is access function (N : in String) return String;
function F_Not (N : in String) return String;
-----------
-- F_And --
-----------
function F_And (L, R : in String) return String is
begin
if Is_True (L) and Is_True (R) then
return "TRUE";
else
return "FALSE";
end if;
end F_And;
------------
-- F_Diff --
------------
function F_Diff (L, R : in String) return String is
begin
if L /= R then
return "TRUE";
else
return "FALSE";
end if;
end F_Diff;
------------
-- F_Einf --
------------
function F_Einf (L, R : in String) return String is
begin
if Integer'Value (L) <= Integer'Value (R) then
return "TRUE";
else
return "FALSE";
end if;
exception
when others =>
if L <= R then
return "TRUE";
else
return "FALSE";
end if;
end F_Einf;
-----------
-- F_Equ --
-----------
function F_Equ (L, R : in String) return String is
begin
if L = R then
return "TRUE";
else
return "FALSE";
end if;
end F_Equ;
------------
-- F_Esup --
------------
function F_Esup (L, R : in String) return String is
begin
if Integer'Value (L) >= Integer'Value (R) then
return "TRUE";
else
return "FALSE";
end if;
exception
when others =>
if L >= R then
return "TRUE";
else
return "FALSE";
end if;
end F_Esup;
-----------
-- F_Inf --
-----------
function F_Inf (L, R : in String) return String is
begin
if Integer'Value (L) < Integer'Value (R) then
return "TRUE";
else
return "FALSE";
end if;
exception
when others =>
if L < R then
return "TRUE";
else
return "FALSE";
end if;
end F_Inf;
-----------
-- F_Not --
-----------
function F_Not (N : in String) return String is
begin
if Is_True (N) then
return "FALSE";
else
return "TRUE";
end if;
end F_Not;
----------
-- F_Or --
----------
function F_Or (L, R : in String) return String is
begin
if Is_True (L) or Is_True (R) then
return "TRUE";
else
return "FALSE";
end if;
end F_Or;
-----------
-- F_Sup --
-----------
function F_Sup (L, R : in String) return String is
begin
if Integer'Value (L) > Integer'Value (R) then
return "TRUE";
else
return "FALSE";
end if;
exception
when others =>
if L > R then
return "TRUE";
else
return "FALSE";
end if;
end F_Sup;
-----------
-- F_Xor --
-----------
function F_Xor (L, R : in String) return String is
begin
if Is_True (L) xor Is_True (R) then
return "TRUE";
else
return "FALSE";
end if;
end F_Xor;
Op_Table : constant array (Expr.Ops) of Ops_Fct
:= (Expr.O_And => F_And'Access,
Expr.O_Or => F_Or'Access,
Expr.O_Xor => F_Xor'Access,
Expr.O_Sup => F_Sup'Access,
Expr.O_Inf => F_Inf'Access,
Expr.O_Esup => F_Esup'Access,
Expr.O_Einf => F_Einf'Access,
Expr.O_Equal => F_Equ'Access,
Expr.O_Diff => F_Diff'Access);
U_Op_Table : constant array (Expr.U_Ops) of U_Ops_Fct
:= (Expr.O_Not => F_Not'Access);
begin
case E.Kind is
when Expr.Value =>
return To_String (E.V);
when Expr.Var =>
return Translate (E.Var);
when Expr.Op =>
return Op_Table (E.O) (Analyze (E.Left), Analyze (E.Right));
when Expr.U_Op =>
return U_Op_Table (E.U_O) (Analyze (E.Next));
end case;
end Analyze;
-------------
-- Get_Max --
-------------
procedure Get_Max
(T : in Tree;
Max_Lines : out Natural;
Max_Expand : out Natural)
is
function Get_Max_Lines
(T : in Tree;
N : in Positive)
return Natural;
-- Recursivelly descend the tree and compute the max lines that
-- will be displayed into the table.
function Count_Section return Natural;
-- Returns the number of section into table T;
-------------------
-- Count_Section --
-------------------
function Count_Section return Natural is
C : Natural := 0;
S : Tree := T.Sections;
begin
while S /= null loop
C := C + 1;
S := S.N_Section;
end loop;
return C;
end Count_Section;
-------------------
-- Get_Max_Lines --
-------------------
function Get_Max_Lines
(T : in Tree;
N : in Positive)
return Natural
is
function Check (T : in Data.Tree) return Natural;
-- Returns the length of the largest vector tag found on the
-- subtree.
-----------
-- Check --
-----------
function Check (T : in Data.Tree) return Natural is
use type Data.Tree;
use type Data.NKind;
Iteration : Natural := Natural'First;
D : Data.Tree := T;
begin
while D /= null loop
if D.Kind = Data.Var and then D.Var.Attr = Nil then
for K in Translations'Range loop
declare
Tk : constant Association := Translations (K);
begin
if D.Var.Name = Tk.Variable then
if N = 1 then
-- First block level analysed.
if Tk.Kind = Vect then
-- This is a Vector tag into a top
-- level table statement. The number
-- of iterations for this table
-- statement correspond to the number
-- of item into the vector.
Iteration :=
Natural'Max (Iteration,
Size (Tk.Vect_Value));
elsif Tk.Kind = Matrix then
if State.Table_Level = 0 then
-- This is Matrix tag into a top
-- level table statement. The
-- number of iterations for this
-- table statement correspond to
-- the number of vector into the
-- table.
Iteration :=
Natural'Max (Iteration,
Size (Tk.Mat_Value));
else
-- This is Matrix tag into an
-- embbeded table statement (table
-- statement into a table
-- statement). The number of
-- iterations for this table
-- statement correspond to the
-- largest number of items in the
-- Matrix tag's vectors.
Iteration := Tk.Mat_Value.M.Max;
end if;
end if;
elsif N = 2 then
-- Second block level analysed.
if Tk.Kind = Matrix then
-- This is a Matrix tag into an
-- embedded table statement (table
-- statement into a table statement)
-- analysed at the second block
-- level. This is to report the number
-- of iterations for upper level table
-- statement. This number of
-- iterations correspond to the
-- smallest number of vectors into the
-- table.
Iteration :=
Natural'Max (Iteration,
Size (Tk.Mat_Value));
end if;
end if;
end if;
end;
end loop;
end if;
D := D.Next;
end loop;
return Iteration;
end Check;
begin
if T = null then
return Natural'First;
end if;
case T.Kind is
when Info | C_Info =>
return Get_Max_Lines (T.Next, N);
when Text =>
return Natural'Max (Check (T.Text),
Get_Max_Lines (T.Next, N));
when If_Stmt =>
return Natural'Max
(Natural'Max (Get_Max_Lines (T.N_True, N),
Get_Max_Lines (T.N_False, N)),
Get_Max_Lines (T.Next, N));
when Table_Stmt =>
if N = 1 then
return Natural'Max (Get_Max_Lines (T.Sections, N + 1),
Get_Max_Lines (T.Next, N));
else
return Natural'First;
end if;
when Section_Stmt =>
return Natural'Max (Get_Max_Lines (T.Next, N),
Get_Max_Lines (T.N_Section, N));
when Include_Stmt =>
return Natural'Max (Get_Max_Lines (T.File.Info, N),
Get_Max_Lines (T.Next, N));
end case;
end Get_Max_Lines;
Result : Natural := Get_Max_Lines (T.Sections, 1);
begin
pragma Assert (T.Kind = Table_Stmt);
Max_Lines := Result;
if T.Terminate_Sections then
declare
N_Section : constant Positive := Count_Section;
begin
if Result mod N_Section /= 0 then
Result := Result + N_Section - (Result mod N_Section);
end if;
end;
end if;
Max_Expand := Result;
end Get_Max;
-------------
-- Is_True --
-------------
function Is_True (Str : in String) return Boolean is
L_Str : constant String := Characters.Handling.To_Upper (Str);
begin
return L_Str = "TRUE";
end Is_True;
begin
if T = null then
return;
end if;
case T.Kind is
when Info | C_Info =>
Analyze (T.Next, State);
when Text =>
begin
Analyze (T.Text);
exception
when E : others =>
Exceptions.Raise_Exception
(Template_Error'Identity,
"In " & Filename
& " at line" & Natural'Image (T.Line) & ", "
& Exceptions.Exception_Message (E) & '.');
end;
Analyze (T.Next, State);
when If_Stmt =>
if Analyze (T.Cond) = "TRUE" then
Analyze (T.N_True, State);
else
Analyze (T.N_False, State);
end if;
Analyze (T.Next, State);
when Table_Stmt =>
declare
Max_Lines, Max_Expand : Natural;
begin
Get_Max (T, Max_Lines, Max_Expand);
Analyze (T.Sections,
Table_State'(State.I, State.J,
Max_Lines, Max_Expand,
State.Table_Level + 1,
State.Section_Number + 1));
end;
Analyze (T.Next, State);
when Section_Stmt =>
declare
First_Section : Tree := T;
Current : Tree := T;
Section : Positive := 1;
begin
for K in 1 .. State.Max_Expand loop
Analyze (Current.Next,
Table_State'(State.J,
K,
State.Max_Lines, State.Max_Expand,
State.Table_Level, Section));
Current := Current.N_Section;
Section := Section + 1;
if Current = null then
Current := First_Section;
Section := 1;
end if;
end loop;
end;
when Include_Stmt =>
Analyze (T.File.Info, State);
Analyze (T.Next, State);
end case;
end Analyze;
T : Static_Tree;
begin
T := Load (Filename, Cached);
Now := Ada.Calendar.Clock;
-- Used for the time related variable
Analyze (T.C_Info, Empty_State);
if not Cached then
Release (T.Info);
else
Cached_Files.Prot.Release (T);
end if;
-- Flush buffer and return result
Append (Results, Buffer (1 .. Last));
return Results;
end Parse;
-------------
-- Release --
-------------
procedure Release (T : in out Tree) is
begin
if T = null then
return;
end if;
case T.Kind is
when Info =>
declare
I : Tree := T.I_File;
O : Tree;
begin
while I /= null loop
O := I;
I := I.Next;
Free (O);
end loop;
end;
Release (T.Next);
Free (T);
when C_Info =>
Release (T.Next);
Free (T);
when Text =>
Data.Release (T.Text);
Release (T.Next);
Free (T);
when If_Stmt =>
Expr.Release (T.Cond);
Release (T.N_True);
Release (T.N_False);
Release (T.Next);
Free (T);
when Table_Stmt =>
Release (T.Sections);
Release (T.Next);
Free (T);
when Section_Stmt =>
Release (T.Next);
Release (T.N_Section);
Free (T);
when Include_Stmt =>
T.File.Info.Ref := T.File.Info.Ref - 1;
if T.File.Info.Ref = 0 then
-- No more reference to this include file we release it.
Release (T.File.Info);
end if;
Release (T.Next);
Free (T);
end case;
end Release;
------------------------
-- Set_Tag_Separators --
------------------------
procedure Set_Tag_Separators
(Start_With : in String := Default_Begin_Tag;
Stop_With : in String := Default_End_Tag) is
begin
Begin_Tag := To_Unbounded_String (Start_With);
End_Tag := To_Unbounded_String (Stop_With);
end Set_Tag_Separators;
---------------
-- Translate --
---------------
function Translate
(Template : in String;
Translations : in Translate_Table := No_Translation)
return String
is
T : Data.Tree := Data.Parse (Template);
P : Data.Tree := T;
Results : Unbounded_String;
function Translate (Var : in Tag) return String;
-- Returns translation for Var.
---------------
-- Translate --
---------------
function Translate (Var : in Tag) return String is
begin
for K in Translations'Range loop
if Var.Name = Translations (K).Variable then
declare
Tk : constant Association := Translations (K);
begin
case Tk.Kind is
when Std =>
return Translate (Var, To_String (Tk.Value));
when others =>
return "";
end case;
end;
end if;
end loop;
return "";
end Translate;
use type Data.Tree;
begin
while P /= null loop
case P.Kind is
when Data.Text =>
Append (Results, P.Value);
when Data.Var =>
Append (Results, Translate (P.Var));
end case;
P := P.Next;
end loop;
Data.Release (T);
return To_String (Results);
end Translate;
end Templates_Parser;
|