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
3486
3487
3488
3489
3490
3491
3492
3493
3494
3495
3496
3497
3498
3499
3500
3501
3502
3503
3504
3505
3506
3507
3508
3509
3510
3511
3512
3513
3514
3515
3516
3517
3518
3519
3520
3521
3522
3523
3524
3525
3526
3527
3528
3529
3530
3531
3532
3533
3534
3535
3536
3537
3538
3539
3540
3541
3542
3543
3544
3545
3546
3547
3548
3549
3550
3551
3552
3553
3554
3555
3556
3557
3558
3559
3560
3561
3562
3563
3564
3565
3566
3567
3568
3569
3570
3571
3572
3573
3574
3575
3576
3577
3578
3579
3580
3581
3582
3583
3584
3585
3586
3587
3588
3589
3590
3591
3592
3593
3594
3595
3596
3597
3598
3599
3600
3601
3602
3603
3604
3605
3606
3607
3608
3609
3610
3611
3612
3613
3614
3615
3616
3617
3618
3619
3620
3621
3622
3623
3624
3625
3626
3627
3628
3629
3630
3631
3632
3633
3634
3635
3636
3637
3638
3639
3640
3641
3642
3643
3644
3645
3646
3647
3648
3649
3650
3651
3652
3653
3654
3655
3656
3657
3658
3659
3660
3661
3662
3663
3664
3665
3666
3667
3668
3669
3670
3671
3672
3673
3674
3675
3676
3677
3678
3679
3680
3681
3682
3683
3684
3685
3686
3687
3688
3689
3690
3691
3692
3693
3694
3695
3696
3697
3698
3699
3700
3701
3702
3703
3704
3705
3706
3707
3708
3709
3710
3711
3712
3713
3714
3715
3716
3717
3718
3719
3720
3721
3722
3723
3724
3725
3726
3727
3728
3729
3730
3731
3732
3733
3734
3735
3736
3737
3738
3739
3740
3741
3742
3743
3744
3745
3746
3747
3748
3749
3750
3751
3752
3753
3754
3755
3756
3757
3758
3759
3760
3761
3762
3763
3764
3765
3766
3767
3768
3769
3770
3771
3772
3773
3774
3775
3776
3777
3778
3779
3780
3781
3782
3783
3784
3785
3786
3787
3788
3789
3790
3791
3792
3793
3794
3795
3796
3797
3798
3799
3800
3801
3802
3803
3804
3805
3806
3807
3808
3809
3810
3811
3812
3813
3814
3815
3816
3817
3818
3819
3820
3821
3822
3823
3824
3825
3826
3827
3828
3829
3830
3831
3832
3833
3834
3835
3836
3837
3838
3839
3840
3841
3842
3843
3844
3845
3846
3847
3848
3849
3850
3851
3852
3853
3854
3855
3856
3857
3858
3859
3860
3861
3862
3863
3864
3865
3866
3867
3868
3869
3870
3871
3872
3873
3874
3875
3876
3877
3878
3879
3880
3881
3882
3883
3884
3885
3886
3887
3888
3889
3890
3891
3892
3893
3894
3895
3896
3897
3898
3899
3900
3901
3902
3903
3904
3905
3906
3907
3908
3909
3910
3911
3912
3913
3914
3915
3916
3917
3918
3919
3920
3921
3922
3923
3924
3925
3926
3927
3928
3929
3930
3931
3932
3933
3934
3935
3936
3937
3938
3939
3940
3941
3942
3943
3944
3945
3946
3947
3948
3949
3950
3951
3952
3953
3954
3955
3956
3957
3958
3959
3960
3961
3962
3963
3964
3965
3966
3967
3968
3969
3970
3971
3972
3973
3974
3975
3976
3977
3978
3979
3980
3981
3982
3983
3984
3985
3986
3987
3988
3989
3990
3991
3992
3993
3994
3995
3996
3997
3998
3999
4000
4001
4002
4003
4004
4005
4006
4007
4008
4009
4010
4011
4012
4013
4014
4015
4016
4017
4018
4019
4020
4021
4022
4023
4024
4025
4026
4027
4028
4029
4030
4031
4032
4033
4034
4035
4036
4037
4038
4039
4040
4041
4042
4043
4044
4045
4046
4047
4048
4049
4050
4051
4052
4053
4054
4055
4056
4057
4058
4059
4060
4061
4062
4063
4064
4065
4066
4067
4068
4069
4070
4071
4072
4073
4074
4075
4076
4077
4078
4079
4080
4081
4082
4083
4084
4085
4086
4087
4088
4089
4090
4091
4092
4093
4094
4095
4096
4097
4098
4099
4100
4101
4102
4103
4104
4105
4106
4107
4108
4109
4110
4111
4112
4113
4114
4115
4116
4117
4118
4119
4120
4121
4122
4123
4124
4125
4126
4127
4128
4129
4130
4131
4132
4133
4134
4135
4136
4137
4138
4139
4140
4141
4142
4143
4144
4145
4146
4147
4148
4149
4150
4151
4152
4153
4154
4155
4156
4157
4158
4159
4160
4161
4162
4163 | ------------------------------------------------------------------------------
-- --
-- GNATPP COMPONENTS --
-- --
-- Pp --
-- --
-- S p e c --
-- --
-- Copyright (C) 2001-2017, AdaCore --
-- --
-- GNATPP is free software; you can redistribute it and/or modify it 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. GNATCHECK 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 distributed with GNAT; see file COPYING3. If --
-- not, go to http://www.gnu.org/licenses for a complete copy of the --
-- license. --
-- --
-- GNATPP is maintained by AdaCore (http://www.adacore.com) --
-- --
------------------------------------------------------------------------------
with Ada.Strings.Unbounded;
with Ada.Wide_Text_IO;
with Ada.Finalization;
with GNATCOLL.Paragraph_Filling;
with Utils.Generic_Formatted_Output;
with Utils.Formatted_Output;
with Utils.Symbols; use Utils.Symbols;
with Text_IO;
with Langkit_Support.Slocs; use Langkit_Support;
with Pp.Command_Lines; use Pp.Command_Lines;
with Pp.Error_Slocs; use Pp.Error_Slocs;
with Pp.Scanner.Lines;
package body Pp.Formatting is
use Utils.Command_Lines;
-- use Common_Flag_Switches, Common_String_Switches,
-- Common_String_Seq_Switches, Common_Nat_Switches;
pragma Warnings (Off);
use Pp_Flag_Switches, Pp_Boolean_Switches, Attribute_Casing_Switches,
Keyword_Casing_Switches, Name_Casing_Switches, Enum_Casing_Switches,
Type_Casing_Switches, Number_Casing_Switches, Pragma_Casing_Switches,
Pp_String_Switches, Pp_Nat_Switches, Pp_String_Seq_Switches;
pragma Warnings (On);
function Next_Enabled
(Lines_Data : Lines_Data_Rec; F : Line_Break_Index_Index)
return Line_Break_Index_Index;
-- Next currently-enabled line break after F. Thus, F..Next_Enabled(F) is a
-- line.
function Good_Column
(PP_Indentation : Positive; Indentation : Natural) return Natural is
((Indentation / PP_Indentation) * PP_Indentation);
-- Make sure indentation is a multiple of PP_Indentation; otherwise style
-- checking complains "(style) bad column".
procedure Tokns_To_Buffer
(Buf : in out Buffer; Tokns : Scanner.Tokn_Vec;
Cmd : Utils.Command_Lines.Command_Line);
-- Turns a sequence of tokens back into text. Overwrites Buf, and leaves
-- 'point' at the beginning. Whole_Line_Comment takes their indentation
-- from the previous Spaces token, if any.
-- The following Next_ss/Prev_ss are the same as Scanner.Next/Prev, except
-- they skip the Spaces token, if present. The "ss" stands for "skip
-- spaces".
function Next_ss (Cur : Scanner.Tokn_Cursor) return Scanner.Tokn_Cursor;
procedure Next_ss (Cur : in out Scanner.Tokn_Cursor);
function Prev_ss (Cur : Scanner.Tokn_Cursor) return Scanner.Tokn_Cursor;
procedure Prev_ss (Cur : in out Scanner.Tokn_Cursor);
procedure Next_ss (Cur : in out Scanner.Tokn_Cursor) is
use Scanner;
begin
Next (Cur);
if Kind (Cur) = Spaces then
Next (Cur);
pragma Assert
(Kind (Cur) not in Enabled_LB_Token | EOL_Token | Spaces);
end if;
end Next_ss;
function Next_ss (Cur : Scanner.Tokn_Cursor) return Scanner.Tokn_Cursor is
begin
return Result : Scanner.Tokn_Cursor := Cur do
Next_ss (Result);
end return;
end Next_ss;
procedure Prev_ss (Cur : in out Scanner.Tokn_Cursor) is
use Scanner;
begin
Prev (Cur);
if Kind (Cur) = Spaces then
Prev (Cur);
pragma Assert (Kind (Cur) /= Spaces);
end if;
end Prev_ss;
function Prev_ss (Cur : Scanner.Tokn_Cursor) return Scanner.Tokn_Cursor is
begin
return Result : Scanner.Tokn_Cursor := Cur do
Prev_ss (Result);
end return;
end Prev_ss;
subtype Symbol is Syms.Symbol;
function "=" (X, Y : Symbol) return Boolean renames Syms."=";
subtype Ada_Node is Libadalang.Analysis.Ada_Node;
use type Ada_Node;
function Is_Null (Tree : Ada_Node) return Boolean is (Tree.Is_Null);
function T_Img (Tree : Ada_Node) return String is
(Libadalang.Analysis.Short_Image (Tree));
Op_Sym_Table : constant array (Positive range <>) of Symbol :=
(Name_Q_And, Name_Q_Or, Name_Q_Xor, Name_Q_Mod, Name_Q_Rem, Name_Q_Abs,
Name_Q_Not);
function Is_Op_Sym_With_Letters (N : Symbol) return Boolean is
(for some Op of Op_Sym_Table => Case_Insensitive_Equal (N, Op));
-- True if N looks like a string literal that can be used as an operator
-- symbol containing letters, so case might matter. N should be in all
-- lower case.
function Sname_83 (Tok : Scanner.Tokn_Cursor) return Boolean;
-- True if Tok can be a simple_name (in Ada 83).
-- This includes reserved words that were added to the language
-- after Ada 83. Needed because we don't necessarily know
-- which language version is being used.
function Sname_83 (Tok : Scanner.Tokn_Cursor) return Boolean is
use Scanner;
begin
return Kind (Tok) in Ident | String_Lit
or else
(Kind (Tok) in Reserved_Word_2012
and then Kind (Tok) not in Reserved_Word_83);
end Sname_83;
procedure Insert_Comment_Text
(Lines_Data_P : Lines_Data_Ptr; Cmd : Utils.Command_Lines.Command_Line;
Comment_Tok : Scanner.Tokn_Cursor);
-- Insert the text of the comment into Out_Buf, including the initial
-- "--" and leading blanks.
-- This will eventually be replaced by Comment_Tokn_To_Buf.
procedure Append_Temp_Line_Break
(Lines_Data_P : Lines_Data_Ptr; Org : String;
Internal_To_Comment : Boolean := False);
function Equal_Ignoring_CR (Src_S, Out_S : Symbol) return Boolean;
-- Used in Match functions below, where the source and output tokens
-- should be identical, except that source line endings can contain
-- CR (the Windows convention).
-----------------------
-- Equal_Ignoring_CR --
-----------------------
function Equal_Ignoring_CR (Src_S, Out_S : Symbol) return Boolean is
begin
if Src_S = Out_S then
return True;
end if;
return Replace_String
(Str (Src_S).S, From => (1 => ASCII.CR), To => "") =
Str (Out_S).S;
end Equal_Ignoring_CR;
----------------
function Next_Enabled
(Lines_Data : Lines_Data_Rec; F : Line_Break_Index_Index)
return Line_Break_Index_Index
is
All_LB : Line_Break_Vector renames Lines_Data.All_LB;
All_LBI : Line_Break_Index_Vector renames Lines_Data.All_LBI;
First : Line_Break renames All_LB (All_LBI (F));
pragma Assert (First.Enabled);
Result : Line_Break_Index_Index := F + 1;
Last : Line_Break := All_LB (All_LBI (Result));
begin
while not Last.Enabled loop
Result := Result + 1;
Last := All_LB (All_LBI (Result));
end loop;
--??? pragma Assert (First.Level = Last.Level);
return Result;
end Next_Enabled;
----------------
procedure Raise_Token_Mismatch
(Message : String; Lines_Data : Lines_Data_Rec; Src_Buf : Buffer;
Src_Tok, Out_Tok : Scanner.Tokn_Cursor);
-- Called when either Insert_Comments_And_Blank_Lines or Final_Check finds
-- a mismatch. Prints debugging information and raises Token_Mismatch.
procedure Final_Check_Helper
(Lines_Data_P : Lines_Data_Ptr; Src_Buf : in out Buffer;
Cmd : Utils.Command_Lines.Command_Line);
procedure Final_Check
(Lines_Data_P : Lines_Data_Ptr; Src_Buf : in out Buffer;
Cmd : Utils.Command_Lines.Command_Line);
-- Final pass: check that we have not damaged the input source text.
-- Parameters and Out_Buf are as for Insert_Comments_And_Blank_Lines,
-- except that comments are now included in Out_[Tokens|Buf], and this
-- checks that they match the ones in Src_Tokns. Final_Check simply
-- calls Final_Check_Helper, plus asserts that Out_Buf wasn't modified.
-- The code in Final_Check[_Helper] is parallel to the code in
-- Insert_Comments_And_Blank_Lines, so there's a bit of code duplication.
-- It is worth it to keep Final_Check[_Helper] as simple as possible. If
-- you make changes to one, consider making similar changes to the other.
function Num_Lits_Match
(Src_Tok, Out_Tok : Scanner.Tokn_Cursor;
Cmd : Utils.Command_Lines.Command_Line) return Boolean;
-- Called by the Match functions for Numeric_Literal
function Num_Lits_Match
(Src_Tok, Out_Tok : Scanner.Tokn_Cursor;
Cmd : Utils.Command_Lines.Command_Line) return Boolean
is
use Scanner;
begin
return R : Boolean do
if Text (Src_Tok) = Text (Out_Tok) then
R := True;
else
declare
Src_Tok_Text : constant W_Str := To_W_Str (Text (Src_Tok));
Out_Tok_Text : constant W_Str := To_W_Str (Text (Out_Tok));
begin
-- If we're not inserting underscores, then the tokens must be
-- identical to match. Note that if the source token already
-- contains underscores, we don't modify it.
if
(Arg (Cmd, Decimal_Grouping) = 0
and then Arg (Cmd, Based_Grouping) = 0)
or else Find (Src_Tok_Text, "_") /= 0
then
R := False;
else
R := Src_Tok_Text = Replace_All (Out_Tok_Text, "_", "");
end if;
end;
end if;
end return;
end Num_Lits_Match;
procedure Assert_No_Trailing_Blanks (Buf : Buffer) is
begin
for X in 2 .. Last_Position (Buf) loop
declare
C : constant W_Char := Char_At (Buf, X);
begin
pragma Assert (if C /= ' ' then not Is_Space (C));
if C = NL then
pragma Assert (Char_At (Buf, X - 1) /= ' ');
end if;
end;
end loop;
pragma Assert (Char_At (Buf, Last_Position (Buf)) = NL);
end Assert_No_Trailing_Blanks;
procedure Append_Temp_Line_Break
(Lines_Data_P : Lines_Data_Ptr; Org : String;
Internal_To_Comment : Boolean := False)
is
pragma Assert (not Internal_To_Comment); -- ????????????????Not used.
Lines_Data : Lines_Data_Rec renames Lines_Data_P.all;
New_Tokns : Scanner.Tokn_Vec renames Lines_Data.New_Tokns;
Cur_Indentation : Natural renames Lines_Data.Cur_Indentation;
Next_Line_Break_Unique_Id : Modular renames
Lines_Data.Next_Line_Break_Unique_Id;
All_LB : Line_Break_Vector renames Lines_Data.All_LB;
Temp_LBI : Line_Break_Index_Vector renames Lines_Data.Temp_LBI;
begin
Append
(All_LB,
Line_Break'
(Tok | Tokn_Val => <>, -- Initial value not used
Hard => True, Affects_Comments => False,
Enabled => True, Source_Line_Breaks_Kludge => False, Level => 1,
Indentation => Cur_Indentation, Length => <>,
-- Kind => Not_An_Element,
Internal_To_Comment => Internal_To_Comment,
UID => Next_Line_Break_Unique_Id));
Next_Line_Break_Unique_Id := Next_Line_Break_Unique_Id + 1;
Append (Temp_LBI, Last_Index (All_LB));
if not Internal_To_Comment then
Scanner.Lines.Append_Line_Break_Tokn
(New_Tokns, Enabled => True, Index => Last_Index (All_LB),
Org => Org);
end if;
end Append_Temp_Line_Break;
procedure Insert_Comment_Text
(Lines_Data_P : Lines_Data_Ptr; Cmd : Utils.Command_Lines.Command_Line;
Comment_Tok : Scanner.Tokn_Cursor)
is
Lines_Data : Lines_Data_Rec renames Lines_Data_P.all;
Cur_Indentation : Natural renames Lines_Data.Cur_Indentation;
New_Tokns : Scanner.Tokn_Vec renames Lines_Data.New_Tokns;
use Scanner;
function Filled_Text
(Comment_Tok : Tokn_Cursor; Leading_Blanks : Natural) return W_Str;
-- Returns the text of the comment after filling (see
-- GNATCOLL.Paragraph_Filling).
function Filled_Text
(Comment_Tok : Tokn_Cursor; Leading_Blanks : Natural) return W_Str
is
use GNATCOLL.Paragraph_Filling, Ada.Strings.Unbounded;
S1 : constant String := Str (Text (Comment_Tok)).S;
S2 : constant String :=
To_String
(Pretty_Fill
(S1,
Max_Line_Length =>
Arg (Cmd, Max_Line_Length) -
(Cur_Indentation + String'("--")'Length + Leading_Blanks)));
begin
return From_UTF8 (S2);
end Filled_Text;
-- Comments_Gnat_Beginning causes the comment to start with at least 2
-- blanks.
Leading_Blanks : constant Natural :=
(if
Arg (Cmd, Comments_Gnat_Beginning) and
Kind (Comment_Tok) = Fillable_Comment
then Natural'Max (Scanner.Leading_Blanks (Comment_Tok), 2)
else Scanner.Leading_Blanks (Comment_Tok));
-- In Comments_Only mode, we need to indent "by hand" here. In normal
-- mode, Cur_Indentation will be heeded by the line breaks.
Do_Filling : constant Boolean :=
Comment_Filling_Enabled (Cmd)
and then Kind (Comment_Tok) = Fillable_Comment;
Text : constant W_Str :=
(if Do_Filling then Filled_Text (Comment_Tok, Leading_Blanks)
else To_W_Str (Scanner.Text (Comment_Tok)));
-- Start of processing for Insert_Comment_Text
begin
Append_Comment_Text
(New_Tokns, Comment_Tok, Text, Recompute_Length => True,
Comments_Only => Arg (Cmd, Comments_Only),
Comments_Gnat_Beginning => Arg (Cmd, Comments_Gnat_Beginning),
Org => "Insert_Comment_Text");
-- It would be good to avoid dealing with text here, and avoid
-- recomputing the length all the time.
end Insert_Comment_Text;
procedure Comment_Tokn_To_Buf
(Buf : in out Buffer; Comment_Tok : Scanner.Tokn_Cursor;
Cmd : Utils.Command_Lines.Command_Line);
-- Called by Tokns_To_Buffer in the comment case, which is the most
-- complicated.
procedure Comment_Tokn_To_Buf
(Buf : in out Buffer; Comment_Tok : Scanner.Tokn_Cursor;
Cmd : Utils.Command_Lines.Command_Line)
is
use Scanner;
function Filled_Text (Comment_Tok : Tokn_Cursor) return W_Str;
-- Returns the text of the comment after filling (see
-- GNATCOLL.Paragraph_Filling).
-- Comments_Gnat_Beginning causes the comment to start with at least 2
-- blanks.
pragma Assert
(if
Arg (Cmd, Comments_Gnat_Beginning) and
Kind (Comment_Tok) = Fillable_Comment
then Scanner.Leading_Blanks (Comment_Tok) >= 2);
Prev_Tok : constant Tokn_Cursor := Prev (Comment_Tok);
pragma Assert
(if Kind (Comment_Tok) in Whole_Line_Comment then
Kind (Prev_Tok) in Spaces | EOL_Token | Line_Break_Token);
Indentation : constant W_Str :=
(if Kind (Comment_Tok) in Whole_Line_Comment then
(if Kind (Prev_Tok) = Spaces then To_W_Str (Text (Prev_Tok))
else "")
else "");
pragma Assert
(if Kind (Comment_Tok) in Whole_Line_Comment then
Indentation'Length = Sloc_Col (Comment_Tok) - 1);
First_Line_Prelude : constant W_Str :=
"--" & (1 .. Scanner.Leading_Blanks (Comment_Tok) => ' ');
-- String that precedes the comment Text (first line)
Subsequent_Prelude : constant W_Str := Indentation & First_Line_Prelude;
-- String that precedes subsequent line of the comment Text
function Filled_Text (Comment_Tok : Tokn_Cursor) return W_Str is
use GNATCOLL.Paragraph_Filling, Ada.Strings.Unbounded;
S1 : String renames Str (Text (Comment_Tok)).S;
S2 : constant String :=
To_String
(Pretty_Fill
(S1,
Max_Line_Length =>
Arg (Cmd, Max_Line_Length) - Subsequent_Prelude'Length));
begin
return From_UTF8 (S2);
end Filled_Text;
Do_Filling : constant Boolean :=
Arg (Cmd, Comments_Only) and then Comment_Filling_Enabled (Cmd)
and then Kind (Comment_Tok) = Fillable_Comment;
Text_NL : constant W_Str :=
(if Do_Filling then Filled_Text (Comment_Tok)
else To_W_Str (Scanner.Text (Comment_Tok)));
pragma Assert (Text_NL (Text_NL'Last) = NL);
Text : W_Str renames Text_NL (Text_NL'First .. Text_NL'Last - 1);
-- Skip last NL
-- Start of processing for Comment_Tokn_To_Buf
begin
Insert (Buf, First_Line_Prelude);
for X in Text'Range loop
if Text (X) = NL then
Insert_NL (Buf);
Insert (Buf, Subsequent_Prelude);
else
Insert (Buf, Text (X));
end if;
end loop;
end Comment_Tokn_To_Buf;
procedure Tokns_To_Buffer
(Buf : in out Buffer; Tokns : Scanner.Tokn_Vec;
Cmd : Utils.Command_Lines.Command_Line)
is
use Scanner;
begin
Clear (Buf);
if not Is_Empty (Tokns) then
declare
Cur : Tokn_Cursor := Next (First (Tokns'Unrestricted_Access));
begin
while not After_Last (Cur) loop
if Kind (Cur) in Comment_Kind then
Comment_Tokn_To_Buf (Buf, Cur, Cmd);
else
Insert_Any (Buf, To_W_Str (Text (Cur)));
end if;
Next (Cur);
end loop;
Reset (Buf);
end;
end if;
end Tokns_To_Buffer;
procedure Do_Comments_Only
(Lines_Data_P : Lines_Data_Ptr; Src_Buf : in out Buffer;
Cmd : Utils.Command_Lines.Command_Line)
is
use Scanner;
Lines_Data : Lines_Data_Rec renames Lines_Data_P.all;
Cur_Indentation : Natural renames Lines_Data.Cur_Indentation;
Src_Toks : aliased Tokn_Vec;
pragma Assert (Is_Empty (Src_Toks));
Ignored : Boolean := Get_Tokns (Src_Buf, Src_Toks, Utils.Ada_Version);
Cur_Tok : Tokn_Cursor :=
Next (First (Src_Toks'Unchecked_Access)); -- skip sentinel
Saved_New_Tokns : Scanner.Tokn_Vec renames Lines_Data.Saved_New_Tokns;
New_Tokns : Scanner.Tokn_Vec renames Lines_Data.New_Tokns;
Ignore : Boolean :=
Move_Tokns (Target => Saved_New_Tokns, Source => New_Tokns);
procedure Reset_Indentation;
-- Set the indentation to it's initial value (usually 0, but can be set
-- by the --initial-indentation switch.
procedure Reset_Indentation is
begin
Cur_Indentation := Arg (Cmd, Initial_Indentation);
end Reset_Indentation;
-- Start of processing for Do_Comments_Only
begin
Append_Tokn (New_Tokns, Start_Of_Input);
Append_Tokn (New_Tokns, True_End_Of_Line);
while Kind (Cur_Tok) /= End_Of_Input loop
if Kind (Cur_Tok) in Comment_Kind then
-- Set Cur_Indentation to the number of spaces to be inserted
-- before "--". For whole-line comments, that's one less than the
-- starting column. For end-of-line comments, it's the number of
-- blanks between the last character of the previous token to the
-- first character of this (comment) token.
case Comment_Kind'(Kind (Cur_Tok)) is
when Whole_Line_Comment =>
Cur_Indentation := Sloc (Cur_Tok).Col - 1;
when End_Of_Line_Comment =>
Cur_Indentation :=
Sloc (Cur_Tok).First - Sloc (Prev_ss (Cur_Tok)).Last - 1;
end case;
Insert_Comment_Text (Lines_Data_P, Cmd, Cur_Tok);
Reset_Indentation;
else
Append_Tokn (New_Tokns, Cur_Tok, Org => "only, other");
end if;
Next (Cur_Tok);
end loop;
Append_Tokn (New_Tokns, End_Of_Input);
Clear (Saved_New_Tokns);
Tokns_To_Buffer (Lines_Data.Out_Buf, New_Tokns, Cmd);
Final_Check (Lines_Data_P, Src_Buf, Cmd);
end Do_Comments_Only;
Post_Tree_Phases_Done : exception;
procedure Keyword_Casing
(Lines_Data_P : Lines_Data_Ptr; Cmd : Command_Line);
-- Convert reserved words to lower/upper case based on command-line
-- options.
procedure Insert_Form_Feeds
(Lines_Data_P : Lines_Data_Ptr; Cmd : Command_Line);
-- Insert FF after "pragma Page;" if --ff-after-pragma-page switch was
-- given. It might seem silly to have a whole extra pass for this little
-- feature, but it's a rarely used feature, so we don't care if it's a
-- little slower, and this seems cleanest. We could have put this
-- processing in some other unrelated pass. Note that it would not be
-- easy to do this in Convert_Tree_To_Ada, because the FF goes after the
-- ";", and the ";" is not printed as part of the pragma -- it goes
-- BETWEEN the pragma and whatever comes next. Furthermore, we want to
-- do this last so the FF doesn't get turned back into NL.
procedure Copy_Pp_Off_Regions
(Src_Buf : in out Buffer; Lines_Data_P : Lines_Data_Ptr;
Pp_Off_Present : Boolean);
-- Out_Buf is fully formatted at this point, including regions where
-- pretty printing is supposed to be turned off. This replaces those
-- regions of Out_Buf with the corresponding regions of Src_Buf. Note
-- that this destroys any markers that might be pointing to Out_Buf.
procedure Keyword_Casing (Lines_Data_P : Lines_Data_Ptr; Cmd : Command_Line)
is
begin
-- The usual case is Lower_Case, in which case there's nothing to do,
-- because all of the Ada_Templates have reserved words in lower case.
-- If it's Upper_Case, we loop through the tokens, converting reserved
-- words to upper case.
case PP_Keyword_Casing (Cmd) is
when Lower_Case =>
null;
when Upper_Case =>
declare
use Scanner;
Lines_Data : Lines_Data_Rec renames Lines_Data_P.all;
Out_Buf : Buffer renames Lines_Data.Out_Buf;
Out_Tokns : Scanner.Tokn_Vec renames Lines_Data.Out_Tokns;
Ignored : Boolean :=
Get_Tokns (Out_Buf, Out_Tokns, Utils.Ada_Version);
Out_Tok : Tokn_Cursor := First (Out_Tokns'Access);
begin
Outer_Loop :
while not After_Last (Out_Tok) loop
Next_ss (Out_Tok);
Error_Sloc := To_Langkit (Sloc (Out_Tok));
loop
if Kind (Out_Tok) in Reserved_Word then
Replace_Cur (Out_Buf, To_Upper (Cur (Out_Buf)));
end if;
Move_Forward (Out_Buf);
exit Outer_Loop when At_End (Out_Buf);
-- If there are extra blank lines at the end of file,
-- then we need the At_End test.
exit when At_Point (Out_Buf, Next_Sloc_First (Out_Tok));
end loop;
end loop Outer_Loop;
Reset (Out_Buf);
Clear (Out_Tokns);
end;
end case;
end Keyword_Casing;
procedure Insert_Form_Feeds_Helper (Lines_Data_P : Lines_Data_Ptr);
procedure Insert_Form_Feeds
(Lines_Data_P : Lines_Data_Ptr; Cmd : Command_Line)
is
begin
-- Ignore this switch for now. It's not clear that anyone uses it, and
-- we have much bigger issues that need fixing.
if False and then Arg (Cmd, Ff_After_Pragma_Page) then
Insert_Form_Feeds_Helper (Lines_Data_P);
end if;
end Insert_Form_Feeds;
procedure Insert_Form_Feeds_Helper (Lines_Data_P : Lines_Data_Ptr) is
Lines_Data : Lines_Data_Rec renames Lines_Data_P.all;
Out_Buf : Buffer renames Lines_Data.Out_Buf;
Out_Tokns : Scanner.Tokn_Vec renames Lines_Data.Out_Tokns;
use Scanner;
Ignored : Boolean := Get_Tokns (Out_Buf, Out_Tokns, Utils.Ada_Version);
Prev_Prev_Tok : Tokn_Cursor := Next_ss (First (Out_Tokns'Access));
Prev_Tok : Tokn_Cursor := Next_ss (Prev_Prev_Tok);
Out_Tok : Tokn_Cursor := Next_ss (Prev_Tok);
-- Out_Tok skips sentinel and first 3 tokens
begin
while not At_Last (Out_Tok) loop
Error_Sloc := To_Langkit (Sloc (Out_Tok));
loop
Move_Forward (Out_Buf);
exit when At_Point (Out_Buf, Next_Sloc_First (Out_Tok));
end loop;
if Kind (Out_Tok) = ';' and then Kind (Prev_Tok) = Ident
and then Case_Insensitive_Equal (Text (Prev_Tok), Name_Page)
and then Kind (Prev_Prev_Tok) = Res_Pragma
then
Insert_Any (Out_Buf, W_FF);
end if;
Prev_Prev_Tok := Prev_Tok;
Prev_Tok := Out_Tok;
Next_ss (Out_Tok);
end loop;
Reset (Out_Buf);
Clear (Out_Tokns);
end Insert_Form_Feeds_Helper;
procedure Copy_Pp_Off_Regions_Helper
(Src_Buf : in out Buffer; Lines_Data_P : Lines_Data_Ptr);
procedure Copy_Pp_Off_Regions
(Src_Buf : in out Buffer; Lines_Data_P : Lines_Data_Ptr;
Pp_Off_Present : Boolean)
is
begin
-- Optimize by skipping this phase if there are no Pp_Off_Comments
if Pp_Off_Present then
Copy_Pp_Off_Regions_Helper (Src_Buf, Lines_Data_P);
end if;
end Copy_Pp_Off_Regions;
procedure Copy_Pp_Off_Regions_Helper
(Src_Buf : in out Buffer; Lines_Data_P : Lines_Data_Ptr)
is
Lines_Data : Lines_Data_Rec renames Lines_Data_P.all;
Out_Buf : Buffer renames Lines_Data.Out_Buf;
Src_Tokns : Scanner.Tokn_Vec renames Lines_Data.Src_Tokns;
Out_Tokns : Scanner.Tokn_Vec renames Lines_Data.Out_Tokns;
-- The Src_Buf contains a sequence of zero or more OFF and ON
-- commands. The first must be OFF, then ON, then OFF and so on,
-- alternating. If that weren't true, we would have gotten an error in
-- Insert_Comments_And_Blank_Lines, in which case we don't get here.
-- The final End_Of_Input acts as an ON or OFF as appropriate.
-- The Out_Buf contains a corresponding sequence with the same
-- number of OFF's and ON's.
-- Pretty printing is ON between the beginning and the first OFF, then
-- OFF until the next ON, and so on.
use Scanner;
New_Buf : Buffer;
-- Buffers don't support deletion, so we need to build up a whole new
-- Buffer. This will be moved into Out_Buf when we are done.
procedure Get_Next_Off_On
(Tok : in out Tokn_Cursor; Expect : Pp_Off_On_Comment);
-- Get the next OFF or ON (or End_Of_Input). The token itself is
-- returned in Tok. Expect is purely for assertions; it alternates
-- between OFF and ON; Tok must be as expected (or End_Of_Input).
procedure Copy (Buf : in out Buffer; Up_To : Positive);
-- Copy from Buf to New_Buf, up to the given position
procedure Skip (Buf : in out Buffer; Up_To : Positive);
-- Move forward in Buf, up to the given position, ignoring the
-- characters.
procedure Get_Next_Off_On
(Tok : in out Tokn_Cursor; Expect : Pp_Off_On_Comment)
is
begin
loop
Next (Tok);
Error_Sloc := To_Langkit (Scanner.Sloc (Tok));
exit when Kind (Tok) in Pp_Off_On_Comment | End_Of_Input;
end loop;
pragma Assert (Kind (Tok) in Expect | End_Of_Input);
pragma Assert (Kind (Prev_ss (Tok)) in Start_Of_Input | EOL_Token);
end Get_Next_Off_On;
procedure Copy (Buf : in out Buffer; Up_To : Positive) is
begin
while not At_Point (Buf, Up_To) loop
Insert_Any (New_Buf, Cur (Buf));
Move_Forward (Buf);
end loop;
end Copy;
procedure Skip (Buf : in out Buffer; Up_To : Positive) is
begin
while not At_Point (Buf, Up_To) loop
Move_Forward (Buf);
end loop;
end Skip;
Ignored : Boolean := Get_Tokns (Out_Buf, Out_Tokns, Utils.Ada_Version);
Src_Tok : Tokn_Cursor := First (Src_Tokns'Access);
Out_Tok : Tokn_Cursor := First (Out_Tokns'Access);
-- Start of processing for Copy_Pp_Off_Regions_Helper
begin
-- When we see an OFF, we want to copy/ignore starting at the
-- beginning of the line on which the OFF appears, which is the
-- Prev. For an ON, we ignore the Prev.
if Debug_Mode then
Dbg_Out.Put ("Copy_Pp_Off_Regions: Src_Tokns:\n");
Put_Tokens (Src_Tokns);
Dbg_Out.Put ("end Src_Tokns:\n");
Dbg_Out.Put ("Copy_Pp_Off_Regions: Out_Tokns:\n");
Put_Tokens (Out_Tokns);
Dbg_Out.Put ("end Out_Tokns:\n");
end if;
-- The following loop repeatedly copies an ON region from Out_Buf to
-- New_Buf (ignoring the corresponding region of Src_Buf), then copies
-- an OFF region from Src_Buf to New_Buf (ignoring the corresponding
-- region of Out_Buf).
loop
Get_Next_Off_On (Out_Tok, Expect => Pp_Off_Comment);
Copy (Out_Buf, Up_To => Next_Sloc_First (Prev (Out_Tok)));
Get_Next_Off_On (Src_Tok, Expect => Pp_Off_Comment);
Skip (Src_Buf, Up_To => Next_Sloc_First (Prev (Src_Tok)));
pragma Assert
((Kind (Out_Tok) = End_Of_Input) = (Kind (Src_Tok) = End_Of_Input));
exit when Kind (Out_Tok) = End_Of_Input;
Get_Next_Off_On (Src_Tok, Expect => Pp_On_Comment);
Copy (Src_Buf, Up_To => Next_Sloc_First (Src_Tok));
Get_Next_Off_On (Out_Tok, Expect => Pp_On_Comment);
Skip (Out_Buf, Up_To => Next_Sloc_First (Out_Tok));
pragma Assert
((Kind (Out_Tok) = End_Of_Input) = (Kind (Src_Tok) = End_Of_Input));
exit when Kind (Out_Tok) = End_Of_Input;
end loop;
Reset (Src_Buf);
Reset (Out_Buf);
Reset (New_Buf);
Clear (Out_Tokns);
Move (Target => Out_Buf, Source => New_Buf);
end Copy_Pp_Off_Regions_Helper;
package Tok_Phases is
-- ???The plan is to implement the new phases here, and get rid of
-- Tok_Phases once it's all working.
procedure Split_Lines
(Lines_Data_P : Lines_Data_Ptr; Cmd : Command_Line;
First_Time : Boolean);
-- Enable soft line breaks as necessary to prevent too-long lines.
-- First_Time is for debugging.
procedure Enable_Line_Breaks_For_EOL_Comments
(Src_Buf : in out Buffer; Lines_Data_P : Lines_Data_Ptr;
Cmd : Command_Line);
-- For all end-of-line comments that occur at a soft line break, enable
-- the line break. Note that this does not modify the Out_Buf.
-- Search Out_Buf.????????????????
procedure Insert_Comments_And_Blank_Lines
(Src_Buf : in out Buffer; Messages : out Scanner.Source_Message_Vector;
Lines_Data_P : Lines_Data_Ptr; Cmd : Command_Line;
Pp_Off_Present : in out Boolean);
-- New_Tokns doesn't contain any comments; they are inserted into the
-- output from Src_Tokns. Blank lines are also copied from Src_Tokns to
-- New_Tokns. The output is also patched up in miscellaneous other ways,
-- such as insert preprocessor directives (see comments in the body for
-- details).
--
-- This procedure also does some work in preparation for
-- Copy_Pp_Off_Regions. In particular, it checks that OFF/ON commands
-- are in the proper sequence, and it sets the Pp_Off_Present flag.
--
-- True if there is at least one Pp_Off_Comment. We don't care about
-- Pp_On_Comments, because it's an error to have a Pp_On_Comment without
-- a preceding Pp_Off_Comment. Set True if appropriate by
-- Insert_Comments_And_Blank_Lines. This allows us to skip the
-- Copy_Pp_Off_Regions pass as an optimization.
procedure Insert_Indentation (Lines_Data_P : Lines_Data_Ptr);
procedure Insert_Alignment
(Lines_Data_P : Lines_Data_Ptr; Cmd : Command_Line);
-- Expand tabs as necessary to align things
end Tok_Phases;
procedure Post_Tree_Phases
(Lines_Data_P : Lines_Data_Ptr;
Messages : out Scanner.Source_Message_Vector; Src_Buf : in out Buffer;
Cmd : Command_Line; Partial : Boolean)
is
Lines_Data : Lines_Data_Rec renames Lines_Data_P.all;
All_LB : Line_Break_Vector renames Lines_Data.All_LB;
All_LBI : Line_Break_Index_Vector renames Lines_Data.All_LBI;
Pp_Off_Present : Boolean := False;
begin
-- ????We probably want to do more, but this is for gnatstub
-- for now.
if Partial then
Clear (All_LB);
Clear (All_LBI);
Clear (Lines_Data.Tabs);
Tokns_To_Buffer (Lines_Data.Out_Buf, Lines_Data.New_Tokns, Cmd);
return;
end if;
Put_All_Tokens ("Post_Tree_Phases", Lines_Data); -- ????????????????
Tok_Phases.Split_Lines (Lines_Data_P, Cmd, First_Time => True);
Put_All_Tokens ("Split_Lines", Lines_Data);
Tok_Phases.Enable_Line_Breaks_For_EOL_Comments
(Src_Buf, Lines_Data_P, Cmd);
Put_All_Tokens ("Enable_Line_Breaks_For_EOL_Comments", Lines_Data);
Tok_Phases.Insert_Comments_And_Blank_Lines
(Src_Buf, Messages, Lines_Data_P, Cmd, Pp_Off_Present);
Put_All_Tokens ("Insert_Comments_And_Blank_Lines", Lines_Data);
Tok_Phases.Split_Lines (Lines_Data_P, Cmd, First_Time => False);
Put_All_Tokens ("Split_Lines", Lines_Data);
Tok_Phases.Insert_Indentation (Lines_Data_P);
Put_All_Tokens ("Insert_Indentation", Lines_Data);
Tok_Phases.Insert_Alignment (Lines_Data_P, Cmd);
Put_All_Tokens ("Insert_Alignment", Lines_Data);
Tokns_To_Buffer (Lines_Data.Out_Buf, Lines_Data.New_Tokns, Cmd);
Put_All_Tokens ("Tokns_To_Buffer", Lines_Data);
Keyword_Casing (Lines_Data_P, Cmd);
Put_All_Tokens ("Keyword_Casing", Lines_Data);
Insert_Form_Feeds (Lines_Data_P, Cmd);
Put_All_Tokens ("Insert_Form_Feeds", Lines_Data);
Copy_Pp_Off_Regions (Src_Buf, Lines_Data_P, Pp_Off_Present);
Put_All_Tokens ("Copy_Pp_Off_Regions", Lines_Data);
-- The following pass doesn't modify anything; it just checks that the
-- sequence of tokens we have constructed matches the original source
-- code (with some allowed exceptions).
Final_Check (Lines_Data_P, Src_Buf, Cmd);
exception
when Post_Tree_Phases_Done =>
null;
end Post_Tree_Phases;
procedure Raise_Token_Mismatch
(Message : String; Lines_Data : Lines_Data_Rec; Src_Buf : Buffer;
Src_Tok, Out_Tok : Scanner.Tokn_Cursor)
is
Out_Buf : Buffer renames Lines_Data.Out_Buf;
begin
Error_Sloc := To_Langkit (Scanner.Sloc (Src_Tok));
if Enable_Token_Mismatch then
declare
use Scanner;
Num_Toks : constant Tokn_Index := 8;
-- Number of tokens before and after the mismatch to print
First_Src_Tok : constant Tokn_Cursor := Pred (Src_Tok, Num_Toks);
Last_Src_Tok : constant Tokn_Cursor := Succ (Src_Tok, Num_Toks);
First_Out_Tok : constant Tokn_Cursor := Pred (Out_Tok, Num_Toks);
Last_Out_Tok : constant Tokn_Cursor := Succ (Out_Tok, Num_Toks);
begin
Utils.Dbg_Out.Output_Enabled := True;
Text_IO.Put_Line ("Src_Buf:");
Dump_Buf (Src_Buf);
Text_IO.Put_Line ("Out_Buf:");
Dump_Buf (Out_Buf);
Text_IO.Put_Line
(Text_IO.Standard_Output,
Message & ": Token mismatch: " & Str (Text (Src_Tok)).S &
" --> " & Str (Text (Out_Tok)).S);
Text_IO.Put_Line (Text_IO.Standard_Output, "Src tokens:");
Put_Tokens (Highlight => Src_Tok);
Text_IO.Put_Line
(Text_IO.Standard_Output,
"========================================");
Text_IO.Put_Line (Text_IO.Standard_Output, "Out tokens:");
Put_Tokens (Highlight => Out_Tok);
Text_IO.Put_Line (Text_IO.Standard_Output, "Src text:");
Wide_Text_IO.Put
(Wide_Text_IO.Standard_Output,
Slice
(Src_Buf, Sloc (First_Src_Tok).First,
Sloc (Last_Src_Tok).Last, Lines => True));
Text_IO.Put_Line (Text_IO.Standard_Output, "Out text:");
Wide_Text_IO.Put
(Wide_Text_IO.Standard_Output,
Slice
(Out_Buf, Sloc (First_Out_Tok).First,
Sloc (Last_Out_Tok).Last, Lines => True));
end;
end if;
raise Token_Mismatch;
end Raise_Token_Mismatch;
procedure Final_Check_Helper
(Lines_Data_P : Lines_Data_Ptr; Src_Buf : in out Buffer;
Cmd : Utils.Command_Lines.Command_Line)
is
Lines_Data : Lines_Data_Rec renames Lines_Data_P.all;
Out_Buf : Buffer renames Lines_Data.Out_Buf;
Src_Tokns : Scanner.Tokn_Vec renames Lines_Data.Src_Tokns;
Out_Tokns : Scanner.Tokn_Vec renames Lines_Data.Out_Tokns;
use Scanner;
function Count_Lines (Buf : Buffer) return Natural;
-- Number of line terminators in Buf
-- ????????????????Moved to Format_Vector?
function Match (Src_Tok, Out_Tok : Tokn_Cursor) return Boolean;
-- Similar to Match in Insert_Comments_And_Blank_Lines, but here we need
-- to deal with comments.
procedure Move_Past_Char;
procedure Move_Past_Out_Tok;
-- These are similar to the procedures in
-- Insert_Comments_And_Blank_Lines, but here we don't need to keep
-- track of line breaks.
generic
Tok : in out Tokn_Cursor;
Result : in out WChar_Vector;
Is_Out : Boolean;
procedure Collect_Comments;
-- Collect up all the text of a sequence of Whole_Line_Comments,
-- ignoring changes made by paragraph filling. Paragraph_Filling might
-- have changed blank to NL and vice versa, and it turns a series of
-- blanks into a single one. Similarly needed if Comments_Gnat_Beginning
-- is True.
--
-- The reason this is generic is that when Is_Out is True, it calls
-- Move_Past_Out_Tok, so we are evilly depending on the fact that
-- Out_Tok and Tok are the same object.
function Count_Lines (Buf : Buffer) return Natural is
S : W_Str renames Elements (Buf) (1 .. Last_Position (Buf));
begin
return R : Natural := 0 do
for X of S loop
if Is_Line_Terminator (X) then
R := R + 1;
end if;
end loop;
end return;
end Count_Lines;
function Match (Src_Tok, Out_Tok : Tokn_Cursor) return Boolean is
begin
return R : Boolean do
if Kind (Src_Tok) = Kind (Out_Tok) then
case Kind (Src_Tok) is
when EOL_Token | Spaces | Line_Break_Token =>
raise Program_Error;
when Start_Of_Input | End_Of_Input | Tab_Token |
Other_Lexeme =>
pragma Assert
(Equal_Ignoring_CR (Text (Src_Tok), Text (Out_Tok)));
R := True;
when Reserved_Word =>
pragma Assert
(Case_Insensitive_Equal
(Text (Src_Tok), Text (Out_Tok)));
R := True;
when Ident =>
R :=
Case_Insensitive_Equal (Text (Src_Tok), Text (Out_Tok));
when Numeric_Literal =>
R := Num_Lits_Match (Src_Tok, Out_Tok, Cmd);
when Character_Literal =>
R := Text (Src_Tok) = Text (Out_Tok);
when String_Lit =>
if Is_Op_Sym_With_Letters (Text (Src_Tok)) then
R :=
Case_Insensitive_Equal
(Text (Src_Tok), Text (Out_Tok));
else
R := Text (Src_Tok) = Text (Out_Tok);
end if;
when Preprocessor_Directive =>
R := Text (Src_Tok) = Text (Out_Tok);
when Comment_Kind =>
R :=
(Arg (Cmd, Comments_Gnat_Beginning)
or else Leading_Blanks (Src_Tok) =
Leading_Blanks (Out_Tok))
and then Text (Src_Tok) = Text (Out_Tok);
end case;
elsif Kind (Src_Tok) = End_Of_Line_Comment
and then Kind (Out_Tok) in Whole_Line_Comment
then
R :=
Text (Src_Tok) = Text (Out_Tok)
and then
(if not Arg (Cmd, Comments_Gnat_Beginning) then
Leading_Blanks (Src_Tok) = Leading_Blanks (Out_Tok));
-- ???This case will be needed if/when we turn end-of-line
-- comments that don't fit into whole-line comments. That
-- transformation seems questionable, because it would
-- damage idempotency: first run of gnatpp turns an
-- end-of-line comment into a whole-line-comment, and then a
-- second run considers it part of a comment paragraph and
-- fills it.
else
R := False;
end if;
end return;
end Match;
Ignored : Boolean := Get_Tokns (Out_Buf, Out_Tokns, Utils.Ada_Version);
Src_Tok : Tokn_Cursor := Next_ss (First (Src_Tokns'Access));
Out_Tok : Tokn_Cursor := Next_ss (First (Out_Tokns'Access));
-- Cursors into Src_Tokns and Out_Tokns, respectively. Skip the
-- first Start_Of_Input token, which is just a sentinel.
procedure Move_Past_Char is
begin
-- Step past character
Move_Forward (Out_Buf);
end Move_Past_Char;
procedure Move_Past_Out_Tok is
begin
-- ???Make sure we're not moving past multiple tokens here. Move past
-- whitespace, then assert we're at token start, then move to end. Or
-- something like that.
loop
Move_Past_Char;
exit when At_Point (Out_Buf, Next_Sloc_First (Out_Tok));
end loop;
end Move_Past_Out_Tok;
procedure Collect_Comments is
begin
while Kind (Tok) in Whole_Line_Comment loop
declare
Text : constant W_Str := To_W_Str (Scanner.Text (Tok));
function White (X : Positive) return Boolean is
(X <= Text'Last
and then
(Is_Space (Text (X)) or else Is_Line_Terminator (Text (X))));
-- True if X points to a space or NL character
pragma Assert
(Text'First = 1 and then Text'Last >= 1
and then (if Text'Last > 1 then not White (1))
and then White (Text'Last));
X : Positive := 1;
begin
while X <= Text'Last loop
if White (X) then
Append (Result, ' ');
while White (X) loop
X := X + 1;
end loop;
else
Append (Result, Text (X));
X := X + 1;
end if;
end loop;
end;
loop
if Is_Out then
Move_Past_Out_Tok;
-- Here is where we depend on the fact that if Is_Out, then
-- Tok and Out_Tok are the same object.
end if;
Next_ss (Tok);
exit when Kind (Tok) not in EOL_Token;
-- ???Should we skip Spaces? exit when Kind (Tok) not in EOL_Token | Spaces;
end loop;
end loop;
end Collect_Comments;
-- Start of processing for Final_Check_Helper
begin
pragma Assert (Cur (Out_Buf) = NL);
Move_Forward (Out_Buf); -- skip sentinel
-- Skip initial EOL_Token token
pragma Assert (Kind (Out_Tok) in EOL_Token);
Next_ss (Out_Tok);
-- This loop is similar to the one in
-- Insert_Comments_And_Blank_Lines; see that for commentary.
loop
Error_Sloc := To_Langkit (Scanner.Sloc (Src_Tok));
if Simulate_Token_Mismatch and then Get_Tokn_Index (Src_Tok) > 6 then
-- Simulate a token mismatch, for testing
Raise_Token_Mismatch
("Final_Check 0", Lines_Data, Src_Buf, Src_Tok, Out_Tok);
end if;
if Kind (Src_Tok) not in EOL_Token
and then
(Match (Src_Tok, Out_Tok)
or else (Kind (Src_Tok) = '!' and then Kind (Out_Tok) = '|'))
then
exit when Kind (Src_Tok) = End_Of_Input;
-- i.e. exit when both Src and Out are at end of input
Move_Past_Out_Tok;
Next_ss (Src_Tok);
Next_ss (Out_Tok);
else
-- If we're filling comments, then the comments might not match
-- up. For example, a line break could be added such that the
-- first line is too short to be considered part of a fillable
-- comment paragraph, thus turning one comment into two. So
-- we collect them all together and check that their text
-- more-or-less matches.
--
-- Similarly, we do this if Comments_Gnat_Beginning. For example,
-- if one comment starts with a single blank and the next starts
-- with two, then they will not look like a single paragraph
-- during Insert_Comments_And_Blank_Lines, but here they will,
-- because an extra blank has been added to the first.
--
-- Actually, we need to do this in any case: if two comments in
-- the input are not indented the same, they will be indented the
-- same in the output, and thus appear to be a fillable paragraph.
if Kind (Src_Tok) in Whole_Line_Comment
and then Kind (Out_Tok) in Whole_Line_Comment
then
declare
Src_Comments : WChar_Vector;
Out_Comments : WChar_Vector;
procedure Collect_Comments_Src is new Collect_Comments
(Src_Tok, Src_Comments, Is_Out => False);
procedure Collect_Comments_Out is new Collect_Comments
(Out_Tok, Out_Comments, Is_Out => True);
begin
Collect_Comments_Src;
Collect_Comments_Out;
if Src_Comments /= Out_Comments then
if Enable_Token_Mismatch then
Text_IO.Put_Line
(Text_IO.Standard_Output, -- why not stderr??????????
To_UTF8 (To_Array (Src_Comments)) & " --> " &
To_UTF8 (To_Array (Out_Comments)));
end if;
Raise_Token_Mismatch
("Final_Check 1", Lines_Data, Src_Buf, Src_Tok,
Out_Tok);
end if;
end;
-- Check for "end;" --> "end Some_Name;" case
elsif Kind (Src_Tok) = ';'
and then Kind (Prev_Lexeme (Src_Tok)) = Res_End
and then Sname_83 (Out_Tok)
then
loop -- could be "end A.B.C;"
Move_Past_Out_Tok;
Next_ss (Out_Tok);
exit when Kind (Out_Tok) /= '.';
Move_Past_Out_Tok;
Next_ss (Out_Tok);
if not Sname_83 (Out_Tok) then
Raise_Token_Mismatch
("Final_Check 2", Lines_Data, Src_Buf, Src_Tok,
Out_Tok);
end if;
end loop;
if Kind (Src_Tok) /= ';' then
Raise_Token_Mismatch
("Final_Check 3", Lines_Data, Src_Buf, Src_Tok, Out_Tok);
end if;
elsif Kind (Src_Tok) in EOL_Token then
Next_ss (Src_Tok);
elsif Kind (Out_Tok) in EOL_Token then
Move_Past_Out_Tok;
Next_ss (Out_Tok);
-- Else print out debugging information and crash. This avoids
-- damaging the source code in case of bugs.
else
Raise_Token_Mismatch
("Final_Check 4", Lines_Data, Src_Buf, Src_Tok, Out_Tok);
end if;
end if;
end loop;
while not At_End (Out_Buf) loop
if not Is_Line_Terminator (Cur (Out_Buf)) then
Raise_Token_Mismatch
("Final_Check 5", Lines_Data, Src_Buf, Src_Tok, Out_Tok);
end if;
Move_Forward (Out_Buf);
end loop;
Reset (Out_Buf);
if False and then Arg (Cmd, Source_Line_Breaks) then -- ????????????????
declare
Src_Lines : constant Natural := Count_Lines (Src_Buf);
Out_Lines : constant Natural := Count_Lines (Out_Buf);
begin
if Src_Lines /= Out_Lines - 1 then
-- There is an extra sentinel newline in Out_Buf, so subtract
-- that off.
Text_IO.Put_Line
(Text_IO.Standard_Output,
Src_Lines'Image & " =? " & Natural'(Out_Lines - 1)'Image);
if False then -- ????????????????
raise Program_Error;
end if;
end if;
end;
end if;
if not At_Last (Src_Tok) or else not At_Last (Out_Tok) then
Raise_Token_Mismatch
("Final_Check 6", Lines_Data, Src_Buf, Src_Tok, Out_Tok);
end if;
Clear (Out_Tokns);
end Final_Check_Helper;
procedure Final_Check
(Lines_Data_P : Lines_Data_Ptr; Src_Buf : in out Buffer;
Cmd : Utils.Command_Lines.Command_Line)
is
Lines_Data : Lines_Data_Rec renames Lines_Data_P.all;
Out_Buf : Buffer renames Lines_Data.Out_Buf;
begin
if Disable_Final_Check then
return;
end if;
if Enable_Token_Mismatch then
declare
Old_Out_Buf : constant WChar_Vector := To_Vector (Out_Buf);
begin
Final_Check_Helper (Lines_Data_P, Src_Buf, Cmd);
pragma Assert (To_Vector (Out_Buf) = Old_Out_Buf);
pragma Debug (Assert_No_Trailing_Blanks (Out_Buf));
end;
else
Final_Check_Helper (Lines_Data_P, Src_Buf, Cmd);
end if;
end Final_Check;
----------------
-- Debugging:
package Enable_Dbg_Out is
-- ????????????????Commentary
use Ada.Finalization;
type Enable_Dbg_Out is new Limited_Controlled with record
Old : Boolean;
end record;
procedure Initialize (X : in out Enable_Dbg_Out);
procedure Finalize (X : in out Enable_Dbg_Out);
end Enable_Dbg_Out;
package body Enable_Dbg_Out is
procedure Initialize (X : in out Enable_Dbg_Out) is
begin
X.Old := Utils.Dbg_Out.Output_Enabled;
Utils.Dbg_Out.Output_Enabled := True;
end Initialize;
procedure Finalize (X : in out Enable_Dbg_Out) is
begin
Utils.Dbg_Out.Output_Enabled := X.Old;
end Finalize;
end Enable_Dbg_Out;
procedure Put_All_Tokens (Message : String; Lines_Data : Lines_Data_Rec) is
use Scanner, Dbg_Out;
Dummy : Enable_Dbg_Out.Enable_Dbg_Out;
begin
if Debug_Flag_4 then -- ????????????????
Dbg_Out.Output_Enabled := True;
Put ("\n\1\n", Message);
Put ("Src_Tokns:\n");
Put_Tokens (Lines_Data.Src_Tokns);
Put ("New_Tokns:\n");
Put_Tokens (Lines_Data.New_Tokns);
-- Put ("Out_Tokns:\n");
-- Put_Tokens (Lines_Data.Out_Tokns);
-- Put ("Saved_New_Tokns:\n");
-- Put_Tokens (Lines_Data.Saved_New_Tokns);
Dbg_Out.Output_Enabled := False;
end if;
pragma Assert (Is_Empty (Lines_Data.Out_Tokns));
pragma Assert (Is_Empty (Lines_Data.Saved_New_Tokns));
end Put_All_Tokens;
function Line_Text
(Lines_Data : Lines_Data_Rec; F, L : Line_Break_Index_Index) return W_Str
is
Out_Buf : Buffer renames Lines_Data.Out_Buf;
All_LB : Line_Break_Vector renames Lines_Data.All_LB;
All_LBI : Line_Break_Index_Vector renames Lines_Data.All_LBI;
First : constant Line_Break := All_LB (All_LBI (F));
Last : constant Line_Break := All_LB (All_LBI (L));
use Scanner;
Result : constant W_Str :=
Slice (Out_Buf, Sloc_First (First.Tok), Sloc_First (Last.Tok));
begin
return Result (Result'First + 1 .. Result'Last);
end Line_Text;
function Tab_Image (Tabs : Tab_Vector; X : Tab_Index) return String is
Tab : constant Tab_Rec := Tabs (X);
begin
return "Tabs(" & Image (Integer (X)) & ") = ^" &
Image (Integer (Tab.Index_In_Line)) & Str (Tab.Token).S & ASCII.HT &
" at " &
(if Tab.Col = Positive'Last then "" else " Col = " & Image (Tab.Col)) &
(if Tab.Num_Blanks = 0 then ""
else " Blanks = " & Image (Tab.Num_Blanks)) &
(if Tab.Is_Fake then " FAKE" else "") &
(if Is_Null (Tab.Tree) then ""
else "(Tr = " & T_Img (Tab.Tree) & ")") &
(if Is_Null (Tab.Parent) then ""
else "(Pa = " & T_Img (Tab.Parent) & ")");
end Tab_Image;
procedure Put_Line_Break (Break : Line_Break) is
Dummy : Enable_Dbg_Out.Enable_Dbg_Out;
use Dbg_Out;
begin
Put
("\1, \2, \3", String'(1 .. Break.Indentation => '_'),
(if Break.Hard then "hard" else "soft"),
(if Break.Enabled then "enabled" else "disabled"));
Scanner.Put_Token (Break.Tok);
end Put_Line_Break;
procedure Put_LBs (LB_Vec : Line_Break_Vector) is
Dummy : Enable_Dbg_Out.Enable_Dbg_Out;
use Dbg_Out;
begin
if Is_Empty (LB_Vec) then
Put ("empty Line_Break_Vector\n");
end if;
for LBI in 1 .. Last_Index (LB_Vec) loop
Put ("\1 => ", Image (Integer (LBI)));
Put_Line_Break (LB_Vec (LBI));
end loop;
end Put_LBs;
procedure Put_LBIs (LBI_Vec : Line_Break_Index_Vector) is
Dummy : Enable_Dbg_Out.Enable_Dbg_Out;
use Dbg_Out;
begin
if Is_Empty (LBI_Vec) then
Put ("empty Line_Break_Index_Vector\n");
end if;
for LBII in 1 .. Last_Index (LBI_Vec) loop
declare
LBI : constant Line_Break_Index := LBI_Vec (LBII);
begin
Put ("\1 => \2\n", Image (Integer (LBII)), Image (Integer (LBI)));
end;
end loop;
end Put_LBIs;
procedure Put_Line_Breaks (Lines_Data : Lines_Data_Rec) is
Dummy : Enable_Dbg_Out.Enable_Dbg_Out;
All_LB : Line_Break_Vector renames Lines_Data.All_LB;
All_LBI : Line_Break_Index_Vector renames Lines_Data.All_LBI;
L : Line_Break_Index_Index;
Line_Num : Natural := 0; -- only counts enabled lines
use Dbg_Out;
begin
Put
("Last_Index (All_LBI) = \1\n",
Image (Integer (Last_Index (All_LBI))));
for Cur_Line in 1 .. Last_Index (All_LBI) loop
if All_LB (All_LBI (Cur_Line)).Enabled then
Line_Num := Line_Num + 1;
end if;
Put
("\1:\t\2\3", Image (Line_Num),
String'(1 .. All_LB (All_LBI (Cur_Line)).Indentation => '_'),
(if All_LB (All_LBI (Cur_Line)).Enabled then "" else "?"));
Put (" lev=\1", Image (Integer (All_LB (All_LBI (Cur_Line)).Level)));
-- if False then
-- Put ("\t\1", Image (All_LB (All_LBI (Cur_Line)).Kind));
-- end if;
if All_LB (All_LBI (Cur_Line)).Enabled
and then Cur_Line /= Last_Index (All_LBI)
then
L := Next_Enabled (Lines_Data, Cur_Line);
Put
("\t\1..\2 len=\3", Image (Integer (Cur_Line)),
Image (Integer (L)),
Image (All_LB (All_LBI (Cur_Line)).Length));
Put ("\t<<\1>>", To_UTF8 (Line_Text (Lines_Data, Cur_Line, L)));
end if;
Put ("#\1", Image (All_LB (All_LBI (Cur_Line)).UID));
Put ("\n");
end loop;
for Cur_Line in 1 .. Last_Index (All_LBI) loop
Put_Line_Break (All_LB (All_LBI (Cur_Line)));
end loop;
end Put_Line_Breaks;
procedure Format_Debug_Output
(Lines_Data : Lines_Data_Rec; Message : String)
is
Out_Buf : Buffer renames Lines_Data.Out_Buf;
Tabs : Tab_Vector renames Lines_Data.Tabs;
use Dbg_Out;
begin
if not Dbg_Out.Output_Enabled then
return;
end if;
Text_IO.Flush (Text_IO.Standard_Output);
Text_IO.Flush (Text_IO.Standard_Error);
Put ("\n\nFormat_Debug_Output: \1:\n", Message);
Dump_Buf (Out_Buf);
Put_Line_Breaks (Lines_Data);
for X in 1 .. Last_Index (Tabs) loop
Put ("\1\n", Tab_Image (Tabs, X));
end loop;
Text_IO.Flush (Text_IO.Standard_Error);
Text_IO.Flush (Text_IO.Standard_Output);
end Format_Debug_Output;
procedure Assert_No_LB (Lines_Data : Lines_Data_Rec) is
begin
pragma Assert (Is_Empty (Lines_Data.All_LB));
pragma Assert (Is_Empty (Lines_Data.All_LBI));
pragma Assert (Is_Empty (Lines_Data.Temp_LBI));
pragma Assert (Is_Empty (Lines_Data.Enabled_LBI));
pragma Assert (Is_Empty (Lines_Data.Syntax_LBI));
end Assert_No_LB;
procedure Put_Char_Vector (Container : Char_Vector) is
procedure Put_Between is null;
begin
Utils.Char_Vectors.Char_Vectors.Put
(Container, Utils.Formatted_Output.Put_Char'Access,
Put_Between'Access);
end Put_Char_Vector;
package Wide_Formatted_Output is new Utils.Generic_Formatted_Output
(Char_Type => W_Char, Str_Type => W_Str,
Basic_Put_Char => Wide_Text_IO_Put_Char);
procedure Put_WChar_Vector (Container : WChar_Vector) is
procedure Put_Between is null;
use Wide_Formatted_Output;
begin
Put (Container, Put_Char'Access, Put_Between'Access);
end Put_WChar_Vector;
function LB_Tok (LB : Line_Break) return Scanner.Tokn_Cursor is
use Scanner;
begin
pragma Assert (Kind (LB.Tok) in Line_Break_Token);
pragma Assert (Token_At_Cursor (LB.Tok) = LB.Tokn_Val);
return LB.Tok;
end LB_Tok;
package body Tok_Phases is
pragma Style_Checks ("M82"); -- because these will eventually be unnested
use Scanner, Scanner.Lines;
function Line_Len
(All_LB : Line_Break_Vector; F, L : Line_Break_Index) return Natural;
-- F and L are the first and last index forming a line; returns the
-- length of the line, not counting new-lines. F must be enabled.
function Forms_Blank_Line
(All_LB : Line_Break_Vector; F, L : Line_Break_Index) return Boolean;
-- True if F..L forms an empty line (or would, if both were enabled).
procedure Collect_Line_Breaks
(Lines_Data_P : Lines_Data_Ptr; Tokns : in out Scanner.Tokn_Vec;
Do_All, Do_Enabled, Do_Syntax, First_Time : Boolean);
-- Collect line breaks from New_Tokns, ignoring soft line breaks that
-- would form blank lines. These ignored ones are also removed from
-- New_Tokns. Set the Tok of each line break to point to the
-- corresponding line break token in Tokns. Note that these will become
-- invalid as soon as Tokns is modified. Set All_LBI, Enabled_LBI, and
-- Syntax_LBI, as appropriate.
procedure Erase_LB_Toks (All_LB : in out Line_Break_Vector);
-- Set the Tok of each line break to Nil
function Forms_Blank_Line
(All_LB : Line_Break_Vector; F, L : Line_Break_Index) return Boolean
is
First : Line_Break renames All_LB (F);
Last : Line_Break renames All_LB (L);
FP : Positive := Sloc_First (LB_Tok (First));
LP : constant Positive := Sloc_First (LB_Tok (Last));
begin
-- Take into account the fact that a hard line break occupies one
-- character (the NL), whereas a soft line break does not, and the fact
-- that a soft line break can be preceded or followed by a single blank
-- (but not both).
if First.Hard then
FP := FP + 1;
end if;
if FP < LP and then Kind (Next (LB_Tok (First))) = Spaces then
pragma Assert (Text (Next (LB_Tok (First))) = Name_Space);
FP := FP + 1;
end if;
pragma Assert (FP <= LP);
return FP = LP;
end Forms_Blank_Line;
procedure Collect_Line_Breaks
(Lines_Data_P : Lines_Data_Ptr; Tokns : in out Scanner.Tokn_Vec;
Do_All, Do_Enabled, Do_Syntax, First_Time : Boolean)
is
Lines_Data : Lines_Data_Rec renames Lines_Data_P.all;
All_LB : Line_Break_Vector renames Lines_Data.All_LB;
All_LBI : Line_Break_Index_Vector renames Lines_Data.All_LBI;
Enabled_LBI : Line_Break_Index_Vector renames Lines_Data.Enabled_LBI;
Syntax_LBI : Line_Break_Index_Vector renames Lines_Data.Syntax_LBI;
Saved_New_Tokns : aliased Scanner.Tokn_Vec;
Ignore : Boolean :=
Move_Tokns (Target => Saved_New_Tokns, Source => Tokns);
pragma Assert (not Is_Empty (Saved_New_Tokns));
P : Tokn_Cursor := First (Saved_New_Tokns'Unchecked_Access);
-- token preceding Tok
pragma Assert (Kind (P) = Start_Of_Input);
Tok : Tokn_Cursor := Next (P);
begin
Clear (All_LBI);
pragma Assert (Is_Empty (Lines_Data.Temp_LBI));
Clear (Enabled_LBI);
Clear (Syntax_LBI);
while not After_Last (Tok) loop
if Kind (P) in Line_Break_Token then
pragma Assert
(not
(Kind (Prev (Tok)) = Spaces and then Kind (Tok) = Spaces));
declare
LBI : constant Line_Break_Index :=
Line_Break_Token_Index (P);
LB : Line_Break renames All_LB (LBI);
begin
Append_Tokn (Tokns, P);
LB.Tok := Last (Tokns'Unrestricted_Access);
LB.Tokn_Val := Token_At_Cursor (LB.Tok);
-- We don't want soft line breaks to form blank lines, so
-- we discard them if they would. The first line break is
-- enabled, so we're not calling Last_Element on an empty
-- All_LBI.
if LB.Enabled or else not First_Time
or else not Forms_Blank_Line
(All_LB, Last_Element (All_LBI), LBI)
then
if Do_All then
Append (All_LBI, LBI);
end if;
if LB.Enabled then
if All_LB (LBI).Hard
and then
(All_LB (LBI).Length /= 0
or else LBI = Last_Index (All_LB))
then
if Do_Syntax then
Append (Syntax_LBI, LBI);
end if;
end if;
if Do_Enabled then
Append (Enabled_LBI, LBI);
end if;
end if;
else
Delete_Last (Tokns);
-- It was appended above
end if;
end;
else
Append_Tokn (Tokns, P);
end if;
P := Tok;
Next (Tok);
end loop;
pragma Assert (Kind (P) = End_Of_Input);
Append_Tokn (Tokns, P);
pragma Debug
(Check_Same_Tokens
(Tokns, Saved_New_Tokns, "Collect_Line_Breaks", "Tokns",
"Saved_New_Tokns"));
end Collect_Line_Breaks;
procedure Erase_LB_Toks (All_LB : in out Line_Break_Vector) is
begin
if not Assert_Enabled then
return;
end if;
for LB of All_LB loop
LB.Tok := Nil_Tokn_Cursor;
end loop;
end Erase_LB_Toks;
function Line_Len
(All_LB : Line_Break_Vector; F, L : Line_Break_Index) return Natural
is
pragma Assert (All_LB (F).Enabled);
First : Line_Break renames All_LB (F);
Last : Line_Break renames All_LB (L);
F_Pos : constant Natural := Sloc_First (Next (LB_Tok (First)));
L_Pos : constant Natural := Sloc_First (LB_Tok (Last));
Leading_Blank : constant Natural :=
(if
not First.Hard and then L_Pos > F_Pos + 1
and then Kind (Next (LB_Tok (First))) = Spaces
then 1
else 0);
-- The test for First.Hard above is needed in the annoying
-- Extra_Blank_On_Return case, among others.
Trailing_Blank : constant Natural :=
(if L_Pos > F_Pos + 2 and then Kind (Prev (LB_Tok (Last))) = Spaces
then 1
else 0);
Without_Indent : constant Natural :=
L_Pos - F_Pos - Leading_Blank - Trailing_Blank;
-- The length without the indentation is just the difference between
-- the positions, except that if the first or last character is ' '
-- adjacent to a soft line break, it doesn't count.
begin
-- If the line is blank, we ignore the indentation; we won't be
-- putting blanks in the output. Otherwise, the length is the
-- indentation plus the length without the indentation as
-- calculated above.
return
(if Without_Indent = 0 then 0
else First.Indentation + Without_Indent);
end Line_Len;
procedure Split_Lines
(Lines_Data_P : Lines_Data_Ptr; Cmd : Command_Line;
First_Time : Boolean)
is
Lines_Data : Lines_Data_Rec renames Lines_Data_P.all;
All_LB : Line_Break_Vector renames Lines_Data.All_LB;
All_LBI : Line_Break_Index_Vector renames Lines_Data.All_LBI;
New_Tokns : Scanner.Tokn_Vec renames Lines_Data.New_Tokns;
function Worthwhile_Line_Break
(F, X : Line_Break_Index) return Boolean;
-- Called for X = the first so-far-disabled line break on a line.
-- Returning False means don't bother enabling it. F is the previous
-- one.
procedure Assertions;
-- Assert that the line Length has been set if and only if the line
-- break is enabled.
procedure Assertions is
begin
for X in 1 .. Last_Index (All_LBI) loop
declare
Break : Line_Break renames All_LB (All_LBI (X));
begin
if X = Last_Index (All_LBI) then
pragma Assert (Break.Enabled and then Break.Length = 0);
elsif Break.Enabled then
pragma Assert
(Break.Length =
Line_Len
(All_LB, All_LBI (X),
All_LBI (Next_Enabled (Lines_Data, X))));
else
pragma Assert (Break.Length = Natural'Last);
end if;
end;
end loop;
end Assertions;
function Worthwhile_Line_Break
(F, X : Line_Break_Index) return Boolean
is
This : constant Positive := Sloc_First (LB_Tok (All_LB (X)));
Prev : Positive := Sloc_First (LB_Tok (All_LB (F)));
Threshold : constant Positive := PP_Indent_Continuation (Cmd);
begin
if All_LB (F).Hard then
Prev := Prev + 1; -- skip NL
end if;
-- If we have something like:
-- P (...
-- there's no point in turning it into:
-- P
-- (...
-- assuming PP_Cont_Line_Indentation = 2, because it doesn't shorten
-- any lines. If the procedure name is slightly longer than "P":
-- Proc (...
-- there's _probably_ no point in turning it into:
-- Proc
-- (...
-- because it only saves 3 characters, so we will probably have
-- to split up the "..." parameters anyway.
if This - Prev <= Threshold then
return False;
end if;
return True;
end Worthwhile_Line_Break;
F : Line_Break_Index_Index := 1;
L : Line_Break_Index_Index;
Len : Natural;
Level : Nesting_Level;
More_Levels : Boolean;
Again : constant String :=
(if First_Time then "first time" else "again");
LB : Line_Break_Index_Vector;
-- All line breaks for a given line that are at the same level,
-- plus an extra one at the end that is already enabled.
Greedy : constant Boolean := True;
-- True if we are using the "greedy" algorithm, which packs as many
-- subtrees on the same line as possible. This seems to look much
-- better, but we're using this flag in case people complain, so we
-- can add a switch to go back to the old algorithm. The old
-- algorithm was: if we enable a soft line break at a certain level,
-- we enable all soft line breaks at the same level (within a line we
-- are splitting).
-- Start of processing for Split_Lines
begin
if Arg (Cmd, Source_Line_Breaks) then
return;
end if;
pragma Debug
(Format_Debug_Output (Lines_Data, "before Split_Lines " & Again));
Collect_Line_Breaks
(Lines_Data_P, New_Tokns, Do_All => True, Do_Enabled => False,
Do_Syntax => False, First_Time => First_Time);
if False then
-- ???For debugging, always split at optional newlines
for Line_Index in 1 .. Last_Index (All_LBI) loop
All_LB (All_LBI (Line_Index)).Enabled := True;
end loop;
return;
end if;
while F /= Last_Index (All_LBI) loop -- through line breaks
Level := 1;
More_Levels := True;
loop -- through levels
L := Next_Enabled (Lines_Data, F);
Len := Line_Len (All_LB, All_LBI (F), All_LBI (L));
exit when Len <= Arg (Cmd, Max_Line_Length); -- short enough
exit when not More_Levels; -- no more line breaks to enable
More_Levels := False;
Clear (LB);
-- Collect line breaks at current level into LB, along with an
-- additional one so we can always do LB (X + 1) below.
for X in F + 1 .. L - 1 loop
if All_LB (All_LBI (X)).Level > Level then
More_Levels := True;
elsif All_LB (All_LBI (X)).Level = Level then
Append (LB, All_LBI (X));
end if;
end loop;
Append (LB, All_LBI (L));
declare
FF : Line_Break_Index := All_LBI (F);
LL : Line_Break_Index;
begin
-- Loop through line breaks at current level
for X in 1 .. Last_Index (LB) - 1 loop
LL := LB (X);
pragma Assert (All_LB (LL).Level = Level);
-- Don't enable the first one, unless it's "worthwhile"
-- according to the heuristic.
if LL = All_LBI (F + 1)
and then not Worthwhile_Line_Break (All_LBI (F), LL)
then
null;
else
if not Greedy
or else Line_Len (All_LB, FF, LB (X + 1)) >
Arg (Cmd, Max_Line_Length)
then
pragma Assert (not All_LB (LL).Enabled);
All_LB (LL).Enabled := True;
FF := LL;
end if;
end if;
end loop; -- through line breaks at current level
end;
Level := Level + 1;
end loop; -- through levels
All_LB (All_LBI (F)).Length := Len;
pragma Assert
(All_LB (All_LBI (F)).Length =
Line_Len
(All_LB, All_LBI (F),
All_LBI (Next_Enabled (Lines_Data, F))));
F := L;
end loop; -- through line breaks
All_LB (All_LBI (F)).Length := 0; -- last line
pragma Debug
(Format_Debug_Output (Lines_Data, "after Split_Lines " & Again));
pragma Debug (Assertions);
end Split_Lines;
procedure Enable_Line_Breaks_For_EOL_Comments
(Src_Buf : in out Buffer; Lines_Data_P : Lines_Data_Ptr;
Cmd : Command_Line)
is
Lines_Data : Lines_Data_Rec renames Lines_Data_P.all;
All_LB : Line_Break_Vector renames Lines_Data.All_LB;
All_LBI : Line_Break_Index_Vector renames Lines_Data.All_LBI;
Src_Tokns : Scanner.Tokn_Vec renames Lines_Data.Src_Tokns;
New_Tokns : Scanner.Tokn_Vec renames Lines_Data.New_Tokns;
function Match (Src_Tok, Out_Tok : Tokn_Cursor) return Boolean;
-- True if the tokens have the same kind and same text, except that the
-- matching is case insensitive for identifiers, reserved words, and
-- string literals that could be operator symbols. The source locations
-- are ignored.
function Looking_At_Paren_Or_Comma
(Break : Line_Break) return Boolean;
-- True if we're look at '(' or ',', skipping any Disabled_LB_Tokens
-- and Spaces tokens.
procedure Do_End_Of_Line_Comment;
-- Found an End_Of_Line_Comment; enable line breaks as appropriate.
procedure Move_Past_Out_Tok;
function Match (Src_Tok, Out_Tok : Tokn_Cursor) return Boolean is
begin
if Debug_Mode then
Dbg_Out.Output_Enabled := True;
Dbg_Out.Put
("match ""\1"", ""\2"" ? ", Str (Text (Src_Tok)).S,
Str (Text (Out_Tok)).S);
end if;
return R : Boolean do
if Kind (Src_Tok) = Kind (Out_Tok) then
case Kind (Src_Tok) is
when Line_Break_Token | Tab_Token | EOL_Token | Spaces |
Comment_Kind | Preprocessor_Directive =>
raise Program_Error;
when Start_Of_Input | End_Of_Input | Other_Lexeme =>
pragma Assert
(Equal_Ignoring_CR (Text (Src_Tok), Text (Out_Tok)));
R := True;
when Reserved_Word =>
pragma Assert
(Case_Insensitive_Equal
(Text (Src_Tok), Text (Out_Tok)));
R := True;
when Ident =>
R :=
Case_Insensitive_Equal
(Text (Src_Tok), Text (Out_Tok));
when Numeric_Literal =>
R := Num_Lits_Match (Src_Tok, Out_Tok, Cmd);
when Character_Literal =>
R := Text (Src_Tok) = Text (Out_Tok);
when String_Lit =>
if Is_Op_Sym_With_Letters (Text (Src_Tok)) then
R :=
Case_Insensitive_Equal
(Text (Src_Tok), Text (Out_Tok));
else
R := Text (Src_Tok) = Text (Out_Tok);
end if;
end case;
else
R := False;
end if;
if Debug_Mode then
Dbg_Out.Put ("\1\n", (if R then "yes" else "No!"));
end if;
end return;
end Match;
Src_Tok : Tokn_Cursor := Next_ss (First (Src_Tokns'Access));
New_Tok : Tokn_Cursor := Next_ss (First (New_Tokns'Access));
-- Cursors into Src_Tokns and New_Tokns, respectively. Skip the
-- first Start_Of_Input token, which is just a sentinel.
Last_LB : Tokn_Cursor := First (New_Tokns'Access);
-- Last encountered line-break token
New_Cur_Line : Line_Break_Index_Index := 1;
procedure Move_Past_Out_Tok is
begin
while Kind (New_Tok) in Tab_Token loop
Next (New_Tok);
end loop;
Next (New_Tok);
while Kind (New_Tok) in Disabled_LB_Token | Tab_Token | Spaces loop
if Kind (New_Tok) = Disabled_LB_Token then
Last_LB := New_Tok;
New_Cur_Line := New_Cur_Line + 1;
pragma Assert
(Insert_Blank_Lines (Cmd)
or else LB_Tok (All_LB (All_LBI (New_Cur_Line))) =
New_Tok);
end if;
Next (New_Tok);
end loop;
if Kind (New_Tok) = Enabled_LB_Token then
Last_LB := New_Tok;
New_Cur_Line := New_Cur_Line + 1;
pragma Assert
(Insert_Blank_Lines (Cmd)
or else LB_Tok (All_LB (All_LBI (New_Cur_Line))) = New_Tok);
end if;
end Move_Past_Out_Tok;
function Looking_At_Paren_Or_Comma (Break : Line_Break) return Boolean
is
T : Tokn_Cursor := LB_Tok (Break);
begin
while Kind (T) in Disabled_LB_Token | Spaces loop
Next (T);
end loop;
return Kind (T) in '(' | ',';
end Looking_At_Paren_Or_Comma;
procedure Do_End_Of_Line_Comment is
LB : Line_Break renames All_LB (All_LBI (New_Cur_Line));
begin
-- If an end-of-line comment appears at a place where there is a
-- soft line break, we enable that line break. We also enable
-- previous line breaks that are at the same level, or that belong
-- to '('. We stop when we see a hard line break.
pragma Assert
(if Kind (Last_LB) /= Start_Of_Input then
(Sloc_First (LB_Tok (LB)) = Sloc_First (Last_LB)) =
(LB_Tok (LB) = Last_LB));
if LB_Tok (LB) = Last_LB then
for Break in reverse 1 .. New_Cur_Line loop
exit when All_LB (All_LBI (Break)).Hard;
declare
Prev_LB : Line_Break renames All_LB (All_LBI (Break));
begin
if Prev_LB.Level = LB.Level
or else
(Prev_LB.Level < LB.Level
and then Looking_At_Paren_Or_Comma (Prev_LB))
then
Prev_LB.Enabled := True;
end if;
end;
end loop;
end if;
Next_ss (Src_Tok);
end Do_End_Of_Line_Comment;
Qual_Nesting : Natural := 0;
-- Count the nesting level of qualified expressions containing aggregates
-- with extra parentheses.
-- Start of processing for Enable_Line_Breaks_For_EOL_Comments
begin
if Arg (Cmd, Source_Line_Breaks) then
return;
end if;
pragma Debug
(Format_Debug_Output
(Lines_Data, "before Enable_Line_Breaks_For_EOL_Comments"));
-- Skip initial EOL_Token token
pragma Assert (Kind (New_Tok) = Enabled_LB_Token);
Next_ss (New_Tok);
-- This loop is similar to the one in
-- Insert_Comments_And_Blank_Lines; see that for commentary.
loop
Error_Sloc := To_Langkit (Scanner.Sloc (Src_Tok));
if Kind (Src_Tok) not in EOL_Token
and then
(Match (Src_Tok, New_Tok)
or else (Kind (Src_Tok) = '!' and then Kind (New_Tok) = '|'))
then
exit when Kind (Src_Tok) = End_Of_Input;
-- i.e. exit when both Src and Out are at end of input
Move_Past_Out_Tok;
Next_ss (Src_Tok);
else
-- Check for "end;" --> "end Some_Name;" case
if Kind (Src_Tok) = ';'
and then Kind (Prev_Lexeme (Src_Tok)) = Res_End
and then Sname_83 (New_Tok)
then
loop -- could be "end A.B.C;"
Move_Past_Out_Tok;
exit when Kind (New_Tok) /= '.';
Move_Past_Out_Tok;
pragma Assert (Sname_83 (New_Tok));
end loop;
pragma Assert
(Disable_Final_Check or else Kind (Src_Tok) = ';');
-- Check for "end Some_Name;" --> "end;" case. This only happens
-- when the --no-end-id switch was given. Here, the name was
-- present in the source, so we insert it.
elsif not Arg (Cmd, End_Id) and then Kind (New_Tok) = ';'
and then Kind (Prev_Lexeme (New_Tok)) = Res_End
and then Kind (Src_Tok) in Ident | String_Lit
then
loop -- could be "end A.B.C;"
Next_ss (Src_Tok);
exit when Kind (Src_Tok) /= '.';
Next_ss (Src_Tok);
pragma Assert (Kind (Src_Tok) in Ident | String_Lit);
end loop;
pragma Assert
(Disable_Final_Check or else Kind (Src_Tok) = ';');
-- Check for "private end" --> "end" case, with a possible
-- comment between "private" and "end".
elsif Kind (Src_Tok) = Res_Private
and then Kind (New_Tok) = Res_End
then
pragma Assert
(Disable_Final_Check
or else Kind (Next_Lexeme (Src_Tok)) = Res_End);
Next_ss (Src_Tok);
-- Check for "T'((X, Y, Z))" --> "T'(X, Y, Z)" case
elsif Kind (Src_Tok) = '('
and then Kind (Prev_Lexeme (Src_Tok)) = '('
--???Also check that the one before that is a tick!
then
Qual_Nesting := Qual_Nesting + 1;
Next_ss (Src_Tok);
elsif Qual_Nesting > 0 and then Kind (Src_Tok) = ')'
and then Kind (Prev_Lexeme (Src_Tok)) = ')'
then
Qual_Nesting := Qual_Nesting - 1;
Next_ss (Src_Tok);
elsif Kind (Src_Tok) = End_Of_Line_Comment then
Do_End_Of_Line_Comment;
elsif Kind (Src_Tok) in EOL_Token then
Next_ss (Src_Tok);
elsif Kind (Src_Tok) in Whole_Line_Comment then
Next_ss (Src_Tok);
elsif Kind (New_Tok) in Line_Break_Token then
Move_Past_Out_Tok;
elsif Kind (Src_Tok) = Preprocessor_Directive then
Next (Src_Tok);
elsif Disable_Final_Check then
Next_ss (Src_Tok);
if At_Last (Src_Tok) then
goto Done;
end if;
else
Raise_Token_Mismatch
("eol_comments", Lines_Data, Src_Buf, Src_Tok, New_Tok);
end if;
end if;
end loop;
pragma Assert (At_Last (Src_Tok));
pragma Assert (At_Last (New_Tok));
<<Done>>
null;
pragma Assert (Disable_Final_Check or else Qual_Nesting = 0);
pragma Assert (At_Beginning (Src_Buf));
end Enable_Line_Breaks_For_EOL_Comments;
procedure Insert_Comments_And_Blank_Lines
(Src_Buf : in out Buffer; Messages : out Scanner.Source_Message_Vector;
Lines_Data_P : Lines_Data_Ptr; Cmd : Command_Line;
Pp_Off_Present : in out Boolean)
is
pragma Assert (not Pp_Off_Present); -- initialized by caller
Lines_Data : Lines_Data_Rec renames Lines_Data_P.all;
Cur_Indentation : Natural renames Lines_Data.Cur_Indentation;
All_LB : Line_Break_Vector renames Lines_Data.All_LB;
Temp_LBI : Line_Break_Index_Vector renames Lines_Data.Temp_LBI;
Enabled_LBI : Line_Break_Index_Vector renames Lines_Data.Enabled_LBI;
Syntax_LBI : Line_Break_Index_Vector renames Lines_Data.Syntax_LBI;
Src_Tokns : Scanner.Tokn_Vec renames Lines_Data.Src_Tokns;
Saved_New_Tokns : Scanner.Tokn_Vec renames Lines_Data.Saved_New_Tokns;
procedure Reset_Indentation;
-- Set the indentation to it's initial value (usually 0, but can be set
-- by the --initial-indentation switch.
function Match (Src_Tok, Out_Tok : Tokn_Cursor) return Boolean;
-- True if the tokens have the same kind and same text, except that the
-- matching is case insensitive for identifiers, reserved words, and
-- string literals that could be operator symbols. The source locations
-- are ignored.
procedure New_To_Newer (Expect : Opt_Token_Kind := Nil);
-- Copy New_Tok to New_Tokns, and move New_Tok one forward in
-- Saved_New_Tokns. If Expect is not Nil, then New_Tok should be of that
-- kind.????????????????Maybe wrong comment, wrong proc name.
procedure Insert_End_Of_Line_Comment;
-- Found an End_Of_Line_Comment comment; copy it to the buffer. If it
-- is too long to fit on the line, turn it into a Whole_Line_Comment,
-- taking care to indent.
-- Note that the Subtree_To_Ada pass already inserted indentation, so we
-- mostly keep the indentation level at zero. The exception is comments,
-- which Subtree_To_Ada didn't see. For comments, we temporarily set the
-- indentation to that of the surrounding code.
procedure Insert_Whole_Line_Comment;
-- Found a Whole_Line_Comment; copy it to the output, taking care to
-- indent, except that if the comment starts in column 1, we assume
-- the user wants to keep it that way.
procedure Insert_Preprocessor_Directive;
-- Found a Preprocessor_Directive; copy it to the output, preserving
-- its indentation.
procedure Insert_Private;
-- If a private part has no declarations, the earlier passes don't
-- insert "private", whether or not it was in the source code. If
-- there is a comment, this re-inserts "private" before the comment,
-- to avoid messing up the formatting.
procedure Reset_Indentation is
begin
Cur_Indentation := Arg (Cmd, Initial_Indentation);
end Reset_Indentation;
function Match (Src_Tok, Out_Tok : Tokn_Cursor) return Boolean is
begin
if Debug_Mode then
Dbg_Out.Output_Enabled := True;
Dbg_Out.Put
("match ""\1"", ""\2"" ? ", Str (Text (Src_Tok)).S,
Str (Text (Out_Tok)).S);
end if;
return R : Boolean do
if Kind (Src_Tok) = Kind (Out_Tok) then
case Kind (Src_Tok) is
when EOL_Token | Spaces | Comment_Kind |
Preprocessor_Directive | Line_Break_Token =>
raise Program_Error;
when Start_Of_Input | End_Of_Input | Tab_Token |
Other_Lexeme =>
pragma Assert
(Equal_Ignoring_CR (Text (Src_Tok), Text (Out_Tok)));
R := True;
when Reserved_Word =>
pragma Assert
(Case_Insensitive_Equal
(Text (Src_Tok), Text (Out_Tok)));
R := True;
when Ident =>
R :=
Case_Insensitive_Equal
(Text (Src_Tok), Text (Out_Tok));
when Numeric_Literal =>
R := Num_Lits_Match (Src_Tok, Out_Tok, Cmd);
when Character_Literal =>
R := Text (Src_Tok) = Text (Out_Tok);
when String_Lit =>
if Is_Op_Sym_With_Letters (Text (Src_Tok)) then
R :=
Case_Insensitive_Equal
(Text (Src_Tok), Text (Out_Tok));
else
R := Text (Src_Tok) = Text (Out_Tok);
end if;
end case;
else
R := False;
end if;
if Debug_Mode then
Dbg_Out.Put ("\1\n", (if R then "yes" else "No!"));
end if;
end return;
end Match;
New_Tokns : Scanner.Tokn_Vec renames Lines_Data.New_Tokns;
Ignore : Boolean :=
Move_Tokns (Target => Saved_New_Tokns, Source => New_Tokns);
-- After Collect_Line_Breaks below, the Tok field of each line break
-- will point into Saved_New_Tokns.
Src_Tok : Tokn_Cursor := Next_ss (First (Src_Tokns'Access));
New_Tok : Tokn_Cursor := Next_ss (First (Saved_New_Tokns'Access));
-- Cursors into Src_Tokns and Out_Tokns, respectively. Skip the
-- first Start_Of_Input token, which is just a sentinel.
Start_Line_Src_Tok : Tokn_Cursor := First (Src_Tokns'Access);
-- Token at the beginning of the previous line, but never a comment
function L_Paren_Indentation_For_Preserve return Natural;
-- In --preserve-line-breaks mode, this is the amount of additional
-- indentation needed to make lines start just after a "(" on the
-- previous line. For example, if the input is:
-- X := Foo (Y,
-- Z);
-- we would normally put that all on one line. In
-- --preserve-line-breaks mode, we want a line break between
-- "," and "Z", and we want Z to line up after "(".
procedure Manage_Paren_Stack;
-- Paren_Stack (below) is a stack containing one entry for each left
-- parenthesis that has not yet been closed by a right parenthesis.
-- Indent is the additional amount to indent to get to one past just
-- under the "(".
--
-- ???This is currently used only for --preserve-line-breaks mode.
-- We could Consider using it also for the "extra" indent by 1
-- character mentioned in PP.Actions (see type Ada_Template), and
-- also for Qual_Nesting.
New_Line_Start_Out : Tokn_Cursor :=
Next (First (Saved_New_Tokns'Access));
-- Used only in --preserve-line-breaks mode. The first token on the
-- current line in Out_Tokns. Since Split_Lines has not yet been run,
-- there is no indentation present in Out_Buf.
type Paren_Stack_Index is new Positive;
type Paren_Stack_Element is record
Indent : Natural;
end record;
type Paren_Stack_Element_Array is
array (Paren_Stack_Index range <>) of Paren_Stack_Element;
package Paren_Vectors is new Utils.Vectors (Paren_Stack_Index,
Paren_Stack_Element, Paren_Stack_Element_Array);
Paren_Stack : Paren_Vectors.Vector;
use Paren_Vectors;
-- Enabled_LBI are the line breaks used for indenting end-of-line
-- comments. Syntax_LBI are the ones used for indenting whole-line
-- comments. Enabled_Cur_Line and Syntax_Cur_Line index into those,
-- respectively.
Enabled_Cur_Line : Line_Break_Index_Index := 1;
Syntax_Cur_Line : Line_Break_Index_Index := 1;
Prev_New_Tok : Tokn_Cursor := First (Saved_New_Tokns'Access);
-- Used by Manage_Paren_Stack to avoid pushing/popping the same paren
-- twice.
Extra_Indent_For_Preserved_Line : Boolean := True;
-- True if a "preserved" line break should get extra indentation as a
-- line continuation, in addition to any "("-related indentation.
-- For example, we want extra here:
-- Foo
-- (X,
-- Y);
-- but not here:
-- Foo (X,
-- Y);
procedure Manage_Paren_Stack is
begin
if New_Tok = Prev_New_Tok then
return;
end if;
Prev_New_Tok := New_Tok;
-- We push the stack for "(" and pop for ")".
-- Normally, Extra_Indent_For_Preserved_Line is True, but we set
-- it False when we're inside an unclosed "(..." that is on the
-- same line as the previous Enabled line break. We're talking
-- about line breaks from previous phases, not "preserved" ones
-- added in this phase.
if Kind (New_Tok) = '(' then
if Is_Empty (Paren_Stack) then
declare
LB : Line_Break renames
All_LB (Enabled_LBI (Enabled_Cur_Line - 1));
New_Enabled_Line_Start : constant Positive :=
Sloc_First (LB_Tok (LB)) + 1;
New_This_Line_Start : constant Positive :=
Sloc_First (New_Line_Start_Out);
begin
if New_Enabled_Line_Start = New_This_Line_Start then
Extra_Indent_For_Preserved_Line := False;
end if;
end;
end if;
Push
(Paren_Stack,
(Indent =>
Sloc (New_Tok).First - Sloc (New_Line_Start_Out).First +
1));
elsif Kind (New_Tok) = ')' then
Pop (Paren_Stack);
if Is_Empty (Paren_Stack) then
Extra_Indent_For_Preserved_Line := True;
end if;
end if;
end Manage_Paren_Stack;
function L_Paren_Indentation_For_Preserve return Natural is
begin
if Is_Empty (Paren_Stack) then
return 0;
else
return Last_Element (Paren_Stack).Indent;
end if;
end L_Paren_Indentation_For_Preserve;
Pending_Tokns : aliased Tokn_Vec;
-- Disabled_LB_Token, Tab_Token, and Spaces tokens are saved here, so
-- they can be output later. Spaces need to be deferred, because we
-- might need to insert tokens before them. Disabled_LB_Token and
-- Tab_Token need to be deferred because they might be adjacent to
-- Spaces, and we don't want them to get out of order.
procedure New_To_Newer (Expect : Opt_Token_Kind := Nil) is
begin
pragma Assert (if Expect /= Nil then Kind (New_Tok) = Expect);
declare
Pending : Tokn_Cursor :=
Next (First (Pending_Tokns'Unchecked_Access));
begin
while not After_Last (Pending) loop
Append_Tokn (New_Tokns, Pending, Org => "Pending");
Next (Pending);
end loop;
Clear (Pending_Tokns);
Append_Tokn (Pending_Tokns, Start_Of_Input);
end;
pragma Assert (Kind (New_Tok) not in EOL_Token);
if Kind (New_Tok) in Line_Break_Token
and then All_LB (Line_Break_Token_Index (New_Tok)).Enabled
then
-- Step past Syntax_LBI at the current position
while Syntax_Cur_Line <= Last_Index (Syntax_LBI)
and then Sloc_First (New_Tok) >=
Sloc_First (LB_Tok (All_LB (Syntax_LBI (Syntax_Cur_Line))))
loop
Syntax_Cur_Line := Syntax_Cur_Line + 1;
end loop;
-- Step past Enabled_LBI at the current position
-- Even if it's Disabled????????????????
-- Was <= below.
while Enabled_Cur_Line < Last_Index (Enabled_LBI)
and then Sloc_First (New_Tok) >=
Sloc_First
(LB_Tok (All_LB (Enabled_LBI (Enabled_Cur_Line))))
loop
Enabled_Cur_Line := Enabled_Cur_Line + 1;
end loop;
if Arg (Cmd, Source_Line_Breaks)
and then not All_LB (Line_Break_Token_Index (New_Tok))
.Source_Line_Breaks_Kludge
then
if Tokens_Require_Space
(Last (New_Tokns'Access), Next (New_Tok))
then
-- ????????????????Need to skip Tabs and whatnot above.
-- Can Prev/Next_Lexeme be changed to do that?
Append_Spaces (New_Tokns, Count => 1);
end if;
null; -- ????????????????
elsif Kind (Last (New_Tokns'Access)) in Line_Break_Token
and then All_LB
(Line_Break_Token_Index (Last (New_Tokns'Access)))
.Enabled
then
pragma Assert
(if Kind (Last (New_Tokns'Access)) in Disabled_LB_Token
then Arg (Cmd, Source_Line_Breaks));
pragma Assert
(Kind (Last (New_Tokns'Access)) not in Disabled_LB_Token);
-- ????????????????Above asserts are wrong.
if Kind (Prev (Last (New_Tokns'Access))) in Comment_Kind then
null; -- Append_Temp_Line_Break already put one
-- ????????????????But not if Arg (Cmd, Source_Line_Breaks)!
else
if not Is_Blank_Line (Last (New_Tokns'Access))
or else Preserve_Blank_Lines (Cmd)
or else Arg (Cmd, Source_Line_Breaks)
then
Append_Tokn
(New_Tokns, New_Tok, Org => "New_To_Newer 1");
end if;
end if;
else
Append_Tokn (New_Tokns, New_Tok, Org => "New_To_Newer 2");
end if;
else
Append_Tokn (New_Tokns, New_Tok, Org => "New_To_Newer 3");
end if;
Next (New_Tok);
while Kind (New_Tok) in Disabled_LB_Token | Tab_Token | Spaces loop
Append_Tokn (Pending_Tokns, New_Tok);
Next (New_Tok);
end loop;
end New_To_Newer;
procedure Insert_End_Of_Line_Comment is
pragma Assert (Enabled_Cur_Line > 1);
Prev_LB : Line_Break renames
All_LB (Enabled_LBI (Enabled_Cur_Line - 1));
LB : Line_Break renames All_LB (Enabled_LBI (Enabled_Cur_Line));
Indentation : constant Natural := Prev_LB.Indentation;
New_Prev_Src_Tok : constant Tokn_Cursor := Prev (Src_Tok);
New_Preceding_Blanks : Natural :=
(if Kind (New_Prev_Src_Tok) = Spaces then
Tokn_Length (Prev (Src_Tok))
else 0);
-- Number of blanks between the previous token and this comment.
-- Note that tab characters have been expanded into spaces in
-- Src_Buf.
Pending_Space, At_LB : Boolean := False;
New_Space_NL : Boolean := False;
begin
if Get_Num_Tokens (Pending_Tokns) >= 3 then
pragma Assert
(Kind (Last (Pending_Tokns'Unchecked_Access)) =
Kind (Prev (New_Tok)));
pragma Assert
(Kind (Prev (Last (Pending_Tokns'Unchecked_Access))) =
Kind (Prev (Prev (New_Tok))));
Pending_Space := Kind (Prev (Prev (New_Tok))) = Spaces;
At_LB :=
Kind (Prev (New_Tok)) = Disabled_LB_Token
or else Kind (Prev (New_Tok)) = Tab_Token;
New_Space_NL := Pending_Space and At_LB;
end if;
-- If we're just before a blank followed by NL, move past the blank,
-- so we won't add a new NL below.
if New_Space_NL then
pragma Assert (New_Preceding_Blanks > 0);
New_Preceding_Blanks := New_Preceding_Blanks - 1;
-- Remove the Spaces token (which must exist) from
-- Pending_Tokns.
declare
New_Pending_Tokns : Tokn_Vec;
Pending : Tokn_Cursor :=
First (Pending_Tokns'Unchecked_Access);
Spaces_Found : Boolean := False;
begin
while not After_Last (Pending) loop
if Kind (Pending) = Spaces then
pragma Assert (Tokn_Length (Pending) = 1);
Spaces_Found := True;
else
Append_Tokn
(New_Pending_Tokns, Pending,
Org => "Pending for comment");
end if;
Next (Pending);
end loop;
pragma Assert (Spaces_Found);
Pending_Tokns := New_Pending_Tokns;
end;
Append_Spaces (New_Tokns, Count => 1);
end if;
Append_Spaces
(New_Tokns, Count => New_Preceding_Blanks, Existing_OK => True);
Insert_Comment_Text (Lines_Data_P, Cmd, Src_Tok);
-- In the usual case, the end-of-line comment is at a natural
-- (hard) line break, like this:
-- X := X + 1; -- Increment X
-- so we don't need another one. But if the original was:
-- X := -- Increment X
-- X + 1;
-- we need to add a line break after the comment.
declare
At_Tok : Boolean := False;
begin
if Get_Num_Tokens (Pending_Tokns) >= 3 then
At_Tok :=
Kind (Prev (Prev (New_Tok))) = Disabled_LB_Token
and then Kind (Prev (New_Tok)) = Spaces
and then LB_Tok (LB) = Prev (Prev (New_Tok));
end if;
if LB_Tok (LB) = Prev (New_Tok) or else LB_Tok (LB) = New_Tok
then
At_Tok := True;
end if;
if not At_Tok then
if Kind (New_Tok) = Enabled_LB_Token then
declare
This_LB : Line_Break renames
All_LB (Line_Break_Token_Index (New_Tok));
begin
Append_Spaces
(New_Tokns, Count => This_LB.Indentation);
end;
else
Cur_Indentation := Indentation;
if False or else not Arg (Cmd, Source_Line_Breaks) then
Append_Temp_Line_Break -- ????????????????
(Lines_Data_P,
Org =>
"Append_Temp_ in Insert_End_Of_Line_Comment");
end if;
Reset_Indentation;
end if;
else
Append_Tokn (New_Tokns, False_End_Of_Line, "eol extra");
-- This is needed because every comment in New_Tokns must be
-- followed by EOL_Token.
end if;
end;
Next_ss (Src_Tok);
end Insert_End_Of_Line_Comment;
Pp_On : Boolean := True;
-- True initially, and if the most recently encountered Pp_Off_Comment
-- or Pp_On_Comment was Pp_On_Comment.
Last_Pp_Off_On : Tokn_Cursor := First (Src_Tokns'Access);
-- If > First, this points to the most recently encountered
-- Pp_Off_Comment or Pp_On_Comment in Src_Tokns. Used to check for
-- errors; they must alternate, OFF, ON, OFF, ....
function Before_Indentation return Natural;
-- Same as "All_LB (Syntax_LBI (Cur_Line - 1)).Indentation", except
-- we skip Syntax_LBI with Affects_Comments = False. In other
-- words, this is the previous line-breaks indentation which should
-- affect comments.
function After_Indentation return Natural;
-- Same as "All_LB (Syntax_LBI (Cur_Line)).Indentation", except we
-- skip Syntax_LBI with Affects_Comments = False. In other words,
-- this is the current/next line-breaks indentation which should
-- affect comments.
function Before_Indentation return Natural is
X : Line_Break_Index_Index := Syntax_Cur_Line - 1;
begin
while X > 1 and then not All_LB (Syntax_LBI (X)).Affects_Comments
loop
X := X - 1;
end loop;
return All_LB (Syntax_LBI (X)).Indentation;
end Before_Indentation;
function After_Indentation return Natural is
X : Line_Break_Index_Index := Syntax_Cur_Line;
begin
while X < Last_Index (Syntax_LBI)
and then not All_LB (Syntax_LBI (X)).Affects_Comments
loop
X := X + 1;
end loop;
if X <= Last_Index (Syntax_LBI) then
return All_LB (Syntax_LBI (X)).Indentation;
else
pragma Assert (Arg (Cmd, Source_Line_Breaks));
return 0;
end if;
end After_Indentation;
procedure Insert_Whole_Line_Comment is
function Look_Before return Boolean;
-- True if we should look before the current location to determine
-- indentation level for the comment. If the next lexeme is "begin",
-- for example, we want to indent to the level of "begin", even
-- though there is probably previous code more deeply indented.
procedure Set_Cur_Indent;
-- Set Cur_Indentation as appropriate
function Look_Before return Boolean is
begin
if Kind (New_Tok) = End_Of_Input then
return True;
end if;
-- If we have a comment lined up with the preceding line, with
-- no blank lines in between, then we try to keep it lined up,
-- even if "begin" (etc) follows.
pragma Assert
(Sloc (Start_Line_Src_Tok).Line < Sloc (Src_Tok).Line);
if Sloc (Start_Line_Src_Tok).Line = Sloc (Src_Tok).Line - 1
and then Sloc (Start_Line_Src_Tok).Col = Sloc (Src_Tok).Col
then
return True;
end if;
-- Should the following list include "exception"???
return Kind (New_Tok) not in Res_Begin | Res_Else | Res_Elsif |
Res_When;
end Look_Before;
Indentation : Natural;
procedure Set_Cur_Indent is
begin
if Sloc (Src_Tok).Col = 1
or else Kind (Src_Tok) = Special_Comment
or else Arg (Cmd, Comments_Unchanged)
then
Cur_Indentation :=
Sloc (Src_Tok).Col - 1; -- Keep as in input
else
Cur_Indentation := Indentation;
-- Try to make comment fit on line. If we're filling it, then
-- rely on that to make it fit. If Cur_Indentation pushes
-- it past Max_Line_Length, and the comment would fit if
-- not indented, then reduce the indentation.
declare
W : constant Positive := Width (Src_Tok);
begin
if
(not Comment_Filling_Enabled (Cmd)
or else Kind (Src_Tok) /= Fillable_Comment)
and then Cur_Indentation + W >
Arg (Cmd, Max_Line_Length)
and then W <= Arg (Cmd, Max_Line_Length)
then
Cur_Indentation :=
Good_Column
(PP_Indentation (Cmd),
Arg (Cmd, Max_Line_Length) - W);
pragma Assert
((Cur_Indentation mod PP_Indentation (Cmd)) = 0);
end if;
end;
end if;
end Set_Cur_Indent;
use Source_Message_Vectors;
Other_Sloc : constant String := Sloc_Image (Sloc (Last_Pp_Off_On));
Message : Source_Message := (Sloc (Src_Tok), others => <>);
-- Start of processing for Insert_Whole_Line_Comment
begin
-- Processing in preparation for Copy_Pp_Off_Regions. That depends on
-- an alternating sequence: OFF, ON, OFF, ON, .... So we check that
-- here, and abort processing if it's not true.
case Whole_Line_Comment'(Kind (Src_Tok)) is
when Pp_Off_Comment =>
if Pp_On then
Pp_On := False;
Last_Pp_Off_On := Src_Tok;
pragma Assert
(Last_Pp_Off_On /= First (Src_Tokns'Access));
else
Utils.Char_Vectors.Char_Vectors.Append
(Message.Text,
"pretty printing already disabled at " & Other_Sloc);
Append (Messages, Message);
raise Post_Tree_Phases_Done;
end if;
when Pp_On_Comment =>
if Pp_On then
Utils.Char_Vectors.Char_Vectors.Append
(Message.Text,
"pretty printing already enabled at " & Other_Sloc);
Append (Messages, Message);
raise Post_Tree_Phases_Done;
else
Pp_On := True;
Last_Pp_Off_On := Src_Tok;
pragma Assert
(Last_Pp_Off_On /= First (Src_Tokns'Access));
end if;
when Other_Whole_Line_Comment | Special_Comment |
Fillable_Comment =>
null;
end case;
-- Comments at the beginning are not indented. The "2" is to skip the
-- initial sentinel NL.
if Kind (Prev (Prev (New_Tok))) = Start_Of_Input then
Indentation := 0;
-- Otherwise, we indent as for the max of the preceding and following
-- line breaks, except when Look_Before is False (as it is for this
-- comment, which is followed by "else").
else
Indentation := After_Indentation;
if Look_Before then
Indentation := Natural'Max (Indentation, Before_Indentation);
end if;
-- ????????????????Replace above. Sort of.
if False and then Arg (Cmd, Source_Line_Breaks) then
declare
P : Tokn_Cursor := Prev_ss (New_Tok);
begin
-- pragma Assert (Kind (P) in Line_Break_Token);
if not Is_Blank_Line (P) then
loop
P := Prev_ss (P);
exit when Kind (P) = Enabled_LB_Token;
end loop;
Indentation :=
All_LB (Line_Break_Token_Index (P)).Indentation;
end if;
end;
end if;
end if;
-- Make sure Indentation is a multiple of PP_Indentation; otherwise
-- style checking complains "(style) bad column".
Indentation := -- ????????????????Good_Column
(Indentation / PP_Indentation (Cmd)) * PP_Indentation (Cmd);
pragma Assert ((Indentation mod PP_Indentation (Cmd)) = 0);
-- If we're inside something parenthesized, add an extra level
if Kind (New_Tok) = ')' then
Indentation := Indentation + PP_Indentation (Cmd);
end if;
Set_Cur_Indent;
if Is_Blank_Line (Prev_ss (Src_Tok))
or else Kind (Last (New_Tokns'Access)) /= Enabled_LB_Token
then
if Arg (Cmd, Source_Line_Breaks) then
declare
P : Tokn_Cursor := Last (New_Tokns'Access);
begin
while Kind (P) in Line_Break_Token | End_Of_Line_Comment |
Spaces
loop
Prev (P);
end loop;
if Kind (P) not in Whole_Line_Comment | ',' then
Append_Temp_Line_Break -- ????????????????
(Lines_Data_P,
Org => "Append_Temp_ in Insert_Whole_Line_Comment");
end if;
end;
else
Append_Temp_Line_Break -- ????????????????
(Lines_Data_P,
Org => "Append_Temp_ in Insert_Whole_Line_Comment");
end if;
else -- ????????????????perhaps only if source-line-breaks
if False and then Arg (Cmd, Source_Line_Breaks) then
All_LB (Line_Break_Token_Index (Last (New_Tokns'Access)))
.Indentation :=
Cur_Indentation;
end if;
end if;
loop
-- ???Handle blank lines here, too?
Insert_Comment_Text (Lines_Data_P, Cmd, Src_Tok);
Next_ss (Src_Tok);
pragma Assert (Kind (Src_Tok) in EOL_Token);
Next_ss (Src_Tok);
exit when Kind (Src_Tok) not in Special_Comment |
Fillable_Comment | Other_Whole_Line_Comment;
Set_Cur_Indent;
if True or else not Arg (Cmd, Source_Line_Breaks) then
Append_Temp_Line_Break -- ????????????????
(Lines_Data_P,
Org => "Append_Temp_ in Insert_Whole_Line_Comment 2");
end if;
end loop;
-- A line break is needed after the comment. If one is not already
-- there, add one.
if Kind (New_Tok) = Enabled_LB_Token then
while All_LB (Enabled_LBI (Enabled_Cur_Line)).Tok /= New_Tok
loop
Enabled_Cur_Line := Enabled_Cur_Line + 1;
end loop;
end if;
declare
LB : Line_Break renames All_LB (Enabled_LBI (Enabled_Cur_Line));
pragma Assert
(if Kind (New_Tok) = Enabled_LB_Token then LB.Tok = New_Tok);
pragma Assert
(if LB_Tok (LB) = New_Tok then
Kind (New_Tok) = Enabled_LB_Token);
-- pragma Assert????????????????
-- (if LB_Tok (LB) = Prev (New_Tok) then
-- Kind (Prev (New_Tok)) = Disabled_LB_Token);
begin
if LB.Tok = New_Tok then
Append_Tokn
(New_Tokns, False_End_Of_Line, "whole line extra");
-- This is needed because every comment in New_Tokns must
-- be followed by EOL_Token.
else
Cur_Indentation := Indentation;
if True or else not Arg (Cmd, Source_Line_Breaks) then
Append_Temp_Line_Break -- ????????????????
(Lines_Data_P,
Org => "Append_Temp_ in Insert_Whole_Line_Comment 3");
end if;
end if;
end;
Reset_Indentation;
end Insert_Whole_Line_Comment;
procedure Insert_Preprocessor_Directive is
begin
-- The libadalang parser simply ignores preprocessor directives,
-- so it will produce a more-or-less reasonable tree if the input
-- text is syntactically legal after deleting the directives. The
-- Convert_Tree_To_Ada phase will format based on that tree, so
-- something like:
--
-- package P is
-- #IF SOMETHING
-- X : constant Integer := 123;
-- #ELSE
-- X : constant Integer := 456;
-- #END IF;
-- end P;
--
-- will be formatted as if it were:
--
-- package P is
-- X : constant Integer := 123;
-- X : constant Integer := 456;
-- end P;
--
-- Then this procedure reinserts the directives.
--
-- So there is a limitation: if deleting the directives does not
-- produce text that libadalang can parse, then pretty printing
-- will fail.
Cur_Indentation := Sloc (Src_Tok).Col - 1; -- Keep as in input
Append_Temp_Line_Break
(Lines_Data_P, Org => "Append_Temp_ Preprocessor_Directive");
Append_Tokn (New_Tokns, Src_Tok);
Next (Src_Tok);
Reset_Indentation;
end Insert_Preprocessor_Directive;
procedure Insert_Private is
begin
-- The previous line break is just before "end";
-- that's the indentation we want for "private".
Cur_Indentation :=
All_LB (Syntax_LBI (Syntax_Cur_Line - 1)).Indentation;
if not Arg (Cmd, Source_Line_Breaks) then
Append_Temp_Line_Break
(Lines_Data_P, Org => "Append_Temp_ private 1");
end if;
Append_Tokn (New_Tokns, Res_Private);
if Arg (Cmd, Source_Line_Breaks) then
-- if Tokens_Require_Space
-- (Last (New_Tokns'Access), Next (New_Tok))
-- then
-- ????????????????Need to skip Tabs and whatnot above.
-- Can Prev/Next_Lexeme be changed to do that?
Append_Spaces (New_Tokns, Count => 1);
-- end if;
else
Append_Temp_Line_Break
(Lines_Data_P, Org => "Append_Temp_ private 2");
end if;
Reset_Indentation;
Next_ss (Src_Tok);
end Insert_Private;
Qual_Nesting : Natural := 0;
-- Count the nesting level of qualified expressions containing aggregates
-- with extra parentheses.
-- Start of processing for Insert_Comments_And_Blank_Lines
begin
pragma Debug
(Format_Debug_Output
(Lines_Data, "before Insert_Comments_And_Blank_Lines"));
-- ???At this point, we might need another pass to insert hard line
-- breaks after end-of-line comments, so they will be indented properly.
-- Or better yet, insert the EOL comments, with tabs and soft line break
-- before, hard line break after.
Collect_Line_Breaks
(Lines_Data_P, Saved_New_Tokns, Do_All => True, Do_Enabled => True,
Do_Syntax => True, First_Time => False);
Append_Tokn (Pending_Tokns, Start_Of_Input);
pragma Assert (Is_Empty (New_Tokns));
Scanner.Clear (New_Tokns);
Append_Tokn (New_Tokns, Start_Of_Input);
-- Skip initial EOL_Token token
pragma Assert (Kind (New_Tok) = Enabled_LB_Token);
All_LB (Line_Break_Token_Index (New_Tok)).Source_Line_Breaks_Kludge :=
True; -- ????????????????
New_To_Newer;
New_Line_Start_Out := New_Tok;
pragma Assert (Is_Empty (Temp_LBI));
-- The two sequences Src_Tokns and Out_Tokns should be identical,
-- with some exceptions where mismatches are possible. The code below
-- to insert comments depends on this fact. We step through the two
-- sequences, copying text into Buffer, and detect any token mismatch.
-- The allowed mismatches are:
--
-- The Out sequence has no comments, so when we detect a mismatch and
-- the source one is a comment, that's where we insert the comment.
--
-- The sequences may have blank lines in different places.
--
-- We normalize "end;" to "end Some_Name;"
--
-- We normalize by removing "declare" from a block statement with no
-- declarative items. We put the "declare" back in here.
-- ????????????????True?
--
-- We normalize by removing "private" from a package (etc) when there
-- is nothing in the private part. We put the "private" back in here.
--
-- We normalize a qualified expression with unnecessary parentheses
-- containing an aggregate. That is "T'((X, Y, Z))" is normalized to
-- "T'(X, Y, Z)", where "(X, Y, Z)" is an aggregate. We pretty-much
-- have to do that, because ASIS provides no way to distinguish these
-- two forms.
--
-- There is a mode in which we insert underscores in numeric
-- literals, as in 12_345_678.
--
-- Allowed Replacements of Characters (see RM-J.2). We normalize "!"
-- to "|" when used as a delimiter. The other allowed replacements
-- (: for # and % for ") are not normalized.
--
-- Any other mismatch is considered to be a bug.
loop
pragma Assert (Kind (New_Tok) not in Comment_Kind);
Manage_Paren_Stack;
-- The order of the if/elsif's below is important in some
-- cases. Blank lines must be handled late, even if they match.
-- End_Of_Line_Comments must be handled before blank lines,
-- because they need to appear at the end of the preceding line.
-- Whole_Line_Comments must be handled after blank lines, because
-- the blank line should precede the comment.
if Kind (Src_Tok) not in EOL_Token
and then
(Match (Src_Tok, New_Tok)
or else (Kind (Src_Tok) = '!' and then Kind (New_Tok) = '|'))
then
exit when Kind (Src_Tok) = End_Of_Input;
-- i.e. exit when both Src and Out are at end of input
pragma Assert (Kind (New_Tok) /= Enabled_LB_Token);
-- No need to set New_Line_Start_Out
Next_ss (Src_Tok);
New_To_Newer;
else
-- Check for "end;" --> "end Some_Name;" case
if Kind (Src_Tok) = ';'
and then Kind (Prev_Lexeme (Src_Tok)) = Res_End
and then Sname_83 (New_Tok)
then
loop -- could be "end A.B.C;"
New_To_Newer;
exit when Kind (New_Tok) /= '.';
New_To_Newer ('.');
pragma Assert (Sname_83 (New_Tok));
end loop;
pragma Assert
(Disable_Final_Check or else Kind (Src_Tok) = ';');
-- Check for "end Some_Name;" --> "end;" case. This only happens
-- when the --no-end-id switch was given. Here, the name was
-- present in the source, so we insert it.
elsif not Arg (Cmd, End_Id) and then Kind (New_Tok) = ';'
and then Kind (Prev_Lexeme (New_Tok)) = Res_End
and then Kind (Src_Tok) in Ident | String_Lit
then
Append_Tokn (New_Tokns, Spaces, Name_Space);
loop -- could be "end A.B.C;"
Append_Tokn (New_Tokns, Src_Tok);
Next_ss (Src_Tok);
exit when Kind (Src_Tok) /= '.';
Append_Tokn (New_Tokns, Src_Tok);
Next_ss (Src_Tok);
pragma Assert (Kind (Src_Tok) in Ident | String_Lit);
end loop;
pragma Assert
(Disable_Final_Check or else Kind (Src_Tok) = ';');
-- Check for "private end" --> "end" case, with a possible
-- comment between "private" and "end".
elsif Kind (Src_Tok) = Res_Private
and then Kind (New_Tok) = Res_End
then
pragma Assert
(Disable_Final_Check
or else Kind (Next_Lexeme (Src_Tok)) = Res_End);
Insert_Private;
-- Check for "T'((X, Y, Z))" --> "T'(X, Y, Z)" case
elsif Kind (Src_Tok) = '('
and then Kind (Prev_Lexeme (Src_Tok)) = '('
--???Also check that the one before that is a tick!
then
Qual_Nesting := Qual_Nesting + 1;
Append_Tokn (New_Tokns, Src_Tok);
Next_ss (Src_Tok);
elsif Qual_Nesting > 0 and then Kind (Src_Tok) = ')'
and then Kind (Prev_Lexeme (Src_Tok)) = ')'
then
Qual_Nesting := Qual_Nesting - 1;
Append_Tokn (New_Tokns, Src_Tok);
Next_ss (Src_Tok);
elsif Kind (Src_Tok) = End_Of_Line_Comment then
Insert_End_Of_Line_Comment;
-- If the source has a blank line at this point, send it to the
-- output (unless Insert_Blank_Lines is True, in which case we
-- want to ignore blank lines in the input, since a previous
-- phase inserted them in the "right" place). But avoid
-- multiple blank lines (unless either Preserve_Line_Breaks or
-- Preserve_Blank_Lines is True) and blank lines just before
-- End_Of_Input.
-- Suppress blank lines in new mode????????????????
elsif Is_Blank_Line (Src_Tok)
and then not Arg (Cmd, Source_Line_Breaks)
then
-- Src_Tok is the second in a series of two or more
-- EOL_Tokens.
declare
pragma Assert (Kind (Prev_ss (Src_Tok)) in EOL_Token);
Prev_Prev_Tok_Kind : constant Token_Kind :=
Kind (Prev_ss (Prev_ss (Src_Tok)));
begin
loop
Next_ss (Src_Tok);
exit when Kind (Src_Tok) not in EOL_Token
-- ????????????????or else Arg (Cmd, Source_Line_Breaks)
or else Preserve_Blank_Lines (Cmd);
end loop;
declare
Next_Tok_Kind : constant Opt_Token_Kind :=
(if At_Last (Src_Tok) then Nil
else Kind (Next_ss (Src_Tok)));
begin
if Preserve_Blank_Lines (Cmd)
-- ????????????????or else Arg (Cmd, Source_Line_Breaks)
or else
(not Insert_Blank_Lines (Cmd)
and then Kind (Src_Tok) /= End_Of_Input)
or else Prev_Prev_Tok_Kind in Comment_Kind
or else Next_Tok_Kind in Comment_Kind
then
Append_Temp_Line_Break
(Lines_Data_P, Org => "Append_Temp_ blank line");
end if;
end;
end;
-- Normally, we simply ignore EOL_Token in the input. But
-- for --preserve-line-breaks mode, if we see a line break in
-- the input that is not yet in the output, we copy it
-- over. We set the indentation to take into account
-- surrounding indentation, plus line continuation if
-- appropriate, plus "("-related indentation. If the next
-- character in the output is already ' ', we subtract one
-- from the indentation to make up for that. (There can never
-- be two in a row.)????????????????
elsif Kind (Src_Tok) in EOL_Token then
pragma Assert
(not Is_Blank_Line (Src_Tok)
or else Arg (Cmd, Source_Line_Breaks));
Next_ss (Src_Tok);
if Arg (Cmd, Preserve_Line_Breaks) then
declare
Indentation : Natural := Before_Indentation;
begin
if Extra_Indent_For_Preserved_Line then
-- See Manage_Paren_Stack
Indentation :=
Indentation + PP_Indent_Continuation (Cmd);
end if;
if Kind (Prev (New_Tok)) = Spaces
and then Indentation /= 0
then
Indentation := Indentation - 1;
end if;
if Kind (New_Tok) /= Enabled_LB_Token then
Indentation :=
Indentation + L_Paren_Indentation_For_Preserve;
Cur_Indentation := Indentation;
Append_Temp_Line_Break
(Lines_Data_P,
Org => "Append_Temp_ Preserve_Line_Breaks");
Reset_Indentation;
New_Line_Start_Out := New_Tok;
end if;
end;
elsif Arg (Cmd, Source_Line_Breaks) then
-- ????????????????Can we make Preserve_Line_Breaks more
-- similar to this?
if Kind (New_Tok) in Line_Break_Token then
declare
LB : Line_Break renames
All_LB (Line_Break_Token_Index (New_Tok));
begin
-- If we have a line break with
-- Source_Line_Breaks_Kludge already True, it means
-- we already did New_To_Newer in the 'else' below
-- for a previous EOL_Token, so create a new one
-- with the same indentation.
if LB.Source_Line_Breaks_Kludge then
Cur_Indentation := LB.Indentation;
Append_Temp_Line_Break
(Lines_Data_P,
Org => "Append_Temp_ Source_Line_Breaks 1");
Reset_Indentation;
New_Line_Start_Out := New_Tok; -- DRY????????????
-- Source_Line_Breaks_Kludge is False, so tell
-- New_To_Newer to use it this line break.
else
LB.Enabled := True;
LB.Source_Line_Breaks_Kludge := True;
if Kind (Src_Tok) in Whole_Line_Comment then
-- ????????????????
New_To_Newer;
New_Line_Start_Out := New_Tok;
end if;
end if;
end;
-- There is no line break in New_Tokns corresponding to
-- the EOL_Token in the source, so create a new one using
-- Append_Temp_Line_Break.
else
declare
-- Indentation : Natural := Before_Indentation;
Indentation : Natural := 0;
P : Tokn_Cursor := New_Tok;
begin
case Kind (New_Tok) is
when Res_Is | Comment_Kind =>
Indentation := Before_Indentation;
when others =>
while Kind (P) not in Line_Break_Token loop
P := Prev (P);
end loop;
declare
LB : Line_Break renames
All_LB (Line_Break_Token_Index (P));
begin
Indentation := LB.Indentation;
end;
end case;
-- if Extra_Indent_For_Preserved_Line then
-- -- See Manage_Paren_Stack
--
-- -- We don't want this if there's an enabled one
-- -- below????????????????
-- Indentation :=
-- Indentation + PP_Indent_Continuation (Cmd);
-- end if;
--
-- if Kind (Prev (New_Tok)) = Spaces
-- and then Indentation /= 0
-- then
-- Indentation := Indentation - 1;
-- end if;
--
-- Indentation :=????????????????
-- Indentation + L_Paren_Indentation_For_Preserve;
Cur_Indentation := Indentation;
Append_Temp_Line_Break
(Lines_Data_P,
Org => "Append_Temp_ Source_Line_Breaks 2");
Reset_Indentation;
New_Line_Start_Out := New_Tok;
end;
end if;
end if;
elsif Kind (Src_Tok) in Whole_Line_Comment then
Insert_Whole_Line_Comment;
elsif Kind (Src_Tok) = Preprocessor_Directive then
Insert_Preprocessor_Directive;
elsif Kind (New_Tok) = Enabled_LB_Token then
New_To_Newer;
New_Line_Start_Out := New_Tok;
-- Else print out debugging information and crash. This
-- avoids damaging the source code in case of bugs. However,
-- if the Disable_Final_Check debug flag is set, try to
-- continue by skipping one source token, or one output
-- token.
elsif Disable_Final_Check then
Next_ss (Src_Tok);
if At_Last (Src_Tok) then
goto Done;
end if;
else
Raise_Token_Mismatch
("Inserting", Lines_Data, Src_Buf, Src_Tok, New_Tok);
end if;
end if;
if Kind (Src_Tok) not in Comment_Kind
and then Sloc (Src_Tok).Line /= Sloc (Start_Line_Src_Tok).Line
then
Start_Line_Src_Tok := Src_Tok;
end if;
end loop;
if Last_Pp_Off_On /= First (Src_Tokns'Access) then
Pp_Off_Present := True;
end if;
pragma Assert (Is_Empty (Paren_Stack));
pragma Assert (Cur_Indentation = Arg (Cmd, Initial_Indentation));
pragma Assert (At_Last (Src_Tok));
Append_Tokn (New_Tokns, End_Of_Input);
Erase_LB_Toks (All_LB);
Clear (Saved_New_Tokns);
pragma Assert (Syntax_Cur_Line = Last_Index (Syntax_LBI) + 1);
-- pragma Assert (Enabled_Cur_Line = Last_Index (Enabled_LBI) + 1);
-- ????????????????
<<Done>>
null;
Clear (Temp_LBI);
pragma Assert (Disable_Final_Check or else Qual_Nesting = 0);
pragma Assert (At_Beginning (Src_Buf));
Clear (Lines_Data.All_LBI);
Clear (Enabled_LBI);
Clear (Syntax_LBI);
end Insert_Comments_And_Blank_Lines;
procedure Insert_Indentation (Lines_Data_P : Lines_Data_Ptr) is
Lines_Data : Lines_Data_Rec renames Lines_Data_P.all;
All_LB : Line_Break_Vector renames Lines_Data.All_LB;
Saved_New_Tokns : Scanner.Tokn_Vec renames Lines_Data.Saved_New_Tokns;
New_Tokns : Scanner.Tokn_Vec renames Lines_Data.New_Tokns;
Ignore : Boolean :=
Scanner.Move_Tokns (Target => Saved_New_Tokns, Source => New_Tokns);
New_Tok : Tokn_Cursor := First (Saved_New_Tokns'Access);
begin
pragma Assert (Is_Empty (New_Tokns));
-- Remove all disabled line break tokens, and change
-- Disabled_LB_Token to Enabled_LB_Token if enabled.
-- We remove False_End_Of_Lines here as well.
while not After_Last (New_Tok) loop
case Kind (New_Tok) is
when Line_Break_Token =>
declare
Index : constant Line_Break_Index :=
Line_Break_Token_Index (New_Tok);
LB : Line_Break renames All_LB (Index);
begin
if LB.Enabled then
Append_Line_Break_Tokn
(New_Tokns, Enabled => True, Index => Index);
-- ????????????????Wasn't it already Niled?
LB.Tok := Nil_Tokn_Cursor;
-- Tok is no longer needed
end if;
end;
when False_End_Of_Line =>
null;
when True_End_Of_Line =>
pragma Assert (False);
when others =>
Append_Tokn (New_Tokns, New_Tok);
end case;
Next (New_Tok);
end loop;
Scanner.Move_Tokns (Target => Saved_New_Tokns, Source => New_Tokns);
New_Tok := First (Saved_New_Tokns'Access);
-- Remove Spaces at start or end of line
while not After_Last (New_Tok) loop
case Kind (New_Tok) is
when Spaces =>
if Kind (Prev (New_Tok)) in Line_Break_Token
or else Kind (Next (New_Tok)) in Line_Break_Token
then
goto Skip;
end if;
when EOL_Token =>
pragma Assert (False);
when others =>
null;
end case;
Append_Tokn (New_Tokns, New_Tok);
<<Skip>>
Next (New_Tok);
end loop;
Scanner.Move_Tokns (Target => Saved_New_Tokns, Source => New_Tokns);
New_Tok := First (Saved_New_Tokns'Access);
-- Insert indentation after each line break that is not immediately
-- followed by another line break (i.e. at the beginning of each
-- nonblank line).
while not After_Last (New_Tok) loop
Append_Tokn (New_Tokns, New_Tok);
if Kind (New_Tok) in Line_Break_Token then
declare
LB : Line_Break renames
All_LB (Line_Break_Token_Index (New_Tok));
pragma Assert (LB.Enabled);
pragma Assert (Kind (Next (New_Tok)) /= Spaces);
begin
if Kind (Next (New_Tok)) not in Line_Break_Token then
Append_Spaces (New_Tokns, LB.Indentation);
end if;
end;
end if;
Next (New_Tok);
end loop;
if Assert_Enabled then
for LB of All_LB loop
LB := (others => <>);
end loop;
end if;
Clear (All_LB);
Clear (Lines_Data.All_LBI);
Assert_No_LB (Lines_Data);
Clear (Saved_New_Tokns);
end Insert_Indentation;
procedure Insert_Alignment_Helper
(Lines_Data_P : Lines_Data_Ptr; Cmd : Command_Line);
procedure Insert_Alignment
(Lines_Data_P : Lines_Data_Ptr; Cmd : Command_Line)
is
begin
if Alignment_Enabled (Cmd) then
Insert_Alignment_Helper (Lines_Data_P, Cmd);
end if;
end Insert_Alignment;
procedure Insert_Alignment_Helper
(Lines_Data_P : Lines_Data_Ptr; Cmd : Command_Line)
is
Lines_Data : Lines_Data_Rec renames Lines_Data_P.all;
Tabs : Tab_Vector renames Lines_Data.Tabs;
Saved_New_Tokns : Scanner.Tokn_Vec renames Lines_Data.Saved_New_Tokns;
New_Tokns : Scanner.Tokn_Vec renames Lines_Data.New_Tokns;
Ignore : Boolean :=
Scanner.Move_Tokns (Target => Saved_New_Tokns, Source => New_Tokns);
procedure Assign_Insertion_Points;
-- Assign the Insertion_Point component of each Tab_Rec to point to
-- the corresponding token in Saved_New_Tokns.
procedure Calculate_Num_Blanks;
-- Compute the number of spaces that need to be inserted for each
-- tab.
procedure Do_Insertions;
-- Do the actual insertions of spaces, based on the computation done
-- by Calculate_Num_Blanks.
procedure Assign_Insertion_Points is
New_Tok : Tokn_Cursor := First (Saved_New_Tokns'Access);
begin
while not After_Last (New_Tok) loop
if Kind (New_Tok) = Tab_Token then
Tabs (Tab_Token_Index (New_Tok)).Insertion_Point := New_Tok;
end if;
Next (New_Tok);
end loop;
-- Make sure last (sentinel) tab has an Insertion_Point that is
-- after any others.
Tabs (Last_Index (Tabs)).Insertion_Point :=
Last (Saved_New_Tokns'Access);
end Assign_Insertion_Points;
procedure Calculate_Num_Blanks is
-- Note on Col and Num_Blanks components of Tab_Rec: Col is
-- initialized to a bogus value, and Num_Blanks to 0. Process_Line
-- sets Col to the correct value. Flush_Para uses Col, and possibly
-- changes Num_Blanks to some positive value. After the call to
-- Calculate_Num_Blanks, Num_Blanks is used to insert the correct
-- number of ' ' characters. Thus, Col is temporary, used only within
-- Calculate_Num_Blanks, to communicate information from Process_Line
-- to Flush_Para.
Paragraph_Tabs : Tab_In_Line_Vector_Vectors.Vector;
-- One Tab_In_Line_Vector for each line in the current paragraph
procedure Put_Paragraph_Tabs;
procedure Process_Line;
-- Process a single line. Collect together all relevant tabs in
-- Cur_Line_Tabs. All tabs in Cur_Line_Tabs must have the same
-- Tree (that of the first tab on the line). Other tabs (for more
-- nested constructs) are skipped. So for example:
--
-- X : T (Discrim => 123) := (This | That => 345);
--
-- we collect two tabs for ':' and ':=', which have the same Tree
-- (a variable declaration tree). The '|' and '=>' characters in
-- the discriminant constraint and the aggregate also have tabs, but
-- these are skipped, because their Tree is different (more nested).
-- If there are no tabs on the line, then of course Cur_Line_Tabs
-- will be empty. In addition, if we have something like:
--
-- A := (1 | 2 | 3 => ...);
--
-- the '|' and '=>' tabs will have the same Index_In_Line, in which
-- case we give up (set Tab_Mismatch to True, and set Cur_Line_Tabs
-- to empty). Those tabs are only of use if we end up enabling line
-- breaks after the '|'s.
--
-- Handling of "insertion points".
--
-- Let's pretend the template for assignment_statement is
--
-- ! ^:= !
--
-- which means insert the left-hand side, followed by " := ",
-- followed by the right-hand side. (It's actually more complicated;
-- this is just an example.) There is a tab before ":=", so multiple
-- assignment_statements line up like this:
--
-- Long_Name := 1;
-- X := 10_000;
-- Even_Longer_Name := 1_000_000;
--
-- If we add a tab at the end (just before the ";"): "! ^:= !^2", we
-- get this:
--
-- Long_Name := 1 ;
-- X := 10_000 ;
-- Even_Longer_Name := 1_000_000;
--
-- If in addition we add an insertion point before the right-hand
-- side, so the template is: "! ^:= &2!^2", then the blanks are
-- inserted before the right-hand side, resulting in right-justified
-- expressions:
--
-- Long_Name := 1;
-- X := 10_000;
-- Even_Longer_Name := 1_000_000;
--
-- (We currently do not right-justify those expressions; this is just
-- an example to show how "&" works. "&" is actually used in
-- Do_Component_Clause.)
procedure Flush_Para;
-- Called at the end of a "tabbing paragraph", i.e. a group of one or
-- more lines that each represents similar constructs that should be
-- treated together for alignment purposes.
procedure Flush_Para is
Num_Lines : constant Tab_In_Line_Vector_Index'Base :=
Last_Index (Paragraph_Tabs);
begin
-- Here we have Paragraph_Tabs set to a sequence of lines (or the
-- tabs in those lines, really). For example, if the input text
-- was (*1):
--
-- package P is
--
-- X : T := 1;
-- A_Long_Variable_Name : T := 2;
-- Y : A_Long_Type_Name := 3;
--
-- end P;
-- ^
-- |
-- column 1
--
-- then previous passes will have turned that into (*2):
--
-- package P is
--
-- X ^1: T ^2:= 1;
-- A_Long_Variable_Name ^1: T ^2:= 2;
-- Y ^1: A_Long_Type_Name ^2:= 3;
--
-- end P;
--
-- The tabs are shown as ^1 and ^2 in (*2) above, although they
-- are really kept in a separate data structure (Tabs) rather than
-- in the text itself, and take up zero columns in the buffer.
-- The "paragraph" we're talking about consists of the three
-- variable-declaration lines. Note that the alignment from the
-- input has been forgotten; we would get the same thing if the
-- input were unaligned. Our job is to align the ":" and ":="
-- symbols, whether or not they were originally aligned.
--
-- ^1 means Index_In_Line = 1; ^2 means Index_In_Line = 2 (see
-- type Tab_Rec). The Col of each tab is currently set to the
-- column in which it appears in (*2), and the Num_Blanks is
-- currently set to 0. The following code sets the Col of each tab
-- to the column in which it WILL appear, and the Num_Blanks to
-- the number of blanks to expand the tab to in order to achieve
-- that.
--
-- We first loop through all the ^1 tabs, and calculate the max
-- Col, which will be the ":" of the A_Long_Variable_Name line.
-- We then loop through those again, and set the Num_Blanks to be
-- the number of blanks needed to reach that max column. For each
-- such ^1 tab, we loop from that ^1, through ^2 and ^3 and so
-- on (we have no ^3... in this example), adjusting their Col
-- accordingly.
--
-- Then we loop through all the ^2 tabs in the same way, and so on
-- for ^3, etc.
--
-- So in this example, we loop down through the ^1 tabs to
-- calculate where to put the ":"'s. Then down through the ^1 tabs
-- again to adjust the Num_Blanks for the ^1 tabs, and loop across
-- to adjust the Col for the ^1 and ^2 tabs. Then down through the
-- ^2 tabs to calculate where to put the ":="'s.
--
-- Then down through the ^2 tabs to adjust the Num_Blanks for the
-- ^2 tabs, and loop across to adjust the Col for the ^2 tabs.
-- Note that adjusting the Col for the ":"'s affects where
-- we're going to put the ":="'s -- that's the reason for the
-- "loop across" part.
--
-- The end result is to calculate the Num_Blanks so that when
-- we expand the tabs, (*2) above will be turned (back) into
-- the (*1).
-- We must not process a zero-line paragraph. For efficiency, we
-- can avoid processing a one-line paragraph (leaving all tabs, if
-- any with Num_Blanks = 0). Multi-line paragraphs always have at
-- least one tab per line, and all lines have the same number of
-- tabs.
if Num_Lines = 0 then
return;
end if;
if Num_Lines = 1 then
Clear (Paragraph_Tabs);
return;
end if;
pragma Debug (Put_Paragraph_Tabs);
pragma Assert (Last_Index (Paragraph_Tabs (1)) /= 0);
for Index_In_Line in 1 .. Last_Index (Paragraph_Tabs (1)) loop
declare
Max_Col : Positive := 1;
begin
for Line of Paragraph_Tabs loop
declare
Tab_I : constant Tab_Index := Line (Index_In_Line);
Tab : Tab_Rec renames Tabs (Tab_I);
begin
Max_Col := Positive'Max (Max_Col, Tab.Col);
end;
end loop;
for Line of Paragraph_Tabs loop
declare
Tab_I : constant Tab_Index := Line (Index_In_Line);
Tab : Tab_Rec renames Tabs (Tab_I);
begin
if Tab.Is_Fake then
Tab.Col := Max_Col;
end if;
Tab.Num_Blanks := Max_Col - Tab.Col;
pragma Assert
(if Tab.Is_Fake then Tab.Num_Blanks = 0);
for X_In_Line in Index_In_Line .. Last_Index (Line)
loop
declare
Tab_J : constant Tab_Index :=
Line (X_In_Line);
Tab_2 : Tab_Rec renames Tabs (Tab_J);
begin
Tab_2.Col := Tab_2.Col + Tab.Num_Blanks;
end;
end loop;
pragma Assert (Tab.Col = Max_Col);
pragma Assert
(if Num_Lines = 1 then Tab.Num_Blanks = 0);
-- Because of that fact, we can skip all this for
-- 1-line paragraphs.
end;
end loop;
end;
end loop;
pragma Debug (Put_Paragraph_Tabs);
Clear (Paragraph_Tabs);
end Flush_Para;
New_Tok : Tokn_Cursor := First (Saved_New_Tokns'Access);
Cur_Tab_Index : Tab_Index := 1;
function Cur_Tab return Tab_Rec is (Tabs (Cur_Tab_Index));
pragma Assert (not Cur_Tab.Deleted);
First_Line_Tabs, Cur_Line_Tabs : Tab_In_Line_Vector;
-- Tabs for first line of paragraph and for current line.
procedure Process_Line is
Tab_Mismatch : Boolean := False;
First_Time : Boolean := True;
Tree : Ada_Node;
begin
while Kind (New_Tok) not in End_Of_Input | Enabled_LB_Token loop
-- We can have two tabs at the same place if the second one is
-- fake. Also for implicit 'in' mode, etc. Hence 'while', not
-- 'if' here:
while Cur_Tab.Insertion_Point = New_Tok loop
pragma Assert (not Cur_Tab.Deleted);
if First_Time then
pragma Assert (Is_Empty (Cur_Line_Tabs));
First_Time := False;
Tree := Cur_Tab.Tree;
end if;
if Cur_Tab.Tree = Tree then
-- Ignore if too many tabs in one line:
if not Cur_Tab.Is_Insertion_Point
and then Last_Index (Cur_Line_Tabs) <
Tab_Index_In_Line'Last
then
Append (Cur_Line_Tabs, Cur_Tab_Index);
if Cur_Tab.Index_In_Line /=
Last_Index (Cur_Line_Tabs)
then
Tab_Mismatch := True;
end if;
Tabs (Cur_Tab_Index).Col := Sloc (New_Tok).Col;
end if;
end if;
loop
Cur_Tab_Index := Cur_Tab_Index + 1;
exit when not Cur_Tab.Deleted;
end loop;
end loop;
Next_ss (New_Tok);
end loop;
if Tab_Mismatch then
Clear (Cur_Line_Tabs);
end if;
end Process_Line;
procedure Check_Tokens_Match (X, Y : Tab_In_Line_Vector);
-- If two lines come from the same construct, then the tokens should
-- match. Raise an exception if they don't.
procedure Check_Tokens_Match (X, Y : Tab_In_Line_Vector) is
begin
pragma Assert (not Is_Empty (X) and then not Is_Empty (Y));
for J in 1 .. Last_Index (X) loop
declare
XX : constant Tab_Index := X (J);
YY : constant Tab_Index := Y (J);
XT : constant Symbol := Tabs (XX).Token;
YT : constant Symbol := Tabs (YY).Token;
begin
if XT /= YT then
-- "=>" matches a preceding "|", and vice versa
if (XT = Name_Arrow and then YT = Name_Bar)
or else (XT = Name_Bar and then YT = Name_Arrow)
then
null;
else
Put_Token (New_Tok);
raise Program_Error
with "Tab token mismatch: " & Str (XT).S & " " &
Str (YT).S;
end if;
end if;
end;
end loop;
end Check_Tokens_Match;
procedure Put_Tab_In_Line_Vector
(Name : String; X : Tab_In_Line_Vector);
procedure Put_Tab_In_Line_Vector
(Name : String; X : Tab_In_Line_Vector)
is
pragma Unreferenced (Name);
begin
if Is_Empty (X) then
return;
end if;
-- Dbg_Out.Put ("\1: \t", Name);
--
-- for J in 1 .. Last_Index (X) loop
-- if J /= 1 then
-- Dbg_Out.Put ("; ");
-- end if;
-- Dbg_Out.Put ("\1", Tab_Image (Out_Buf, Tabs, X (J)));
-- end loop;
-- Dbg_Out.Put ("\n");
end Put_Tab_In_Line_Vector;
procedure Put_Paragraph_Tabs is
begin
Dbg_Out.Put
("\1 Paragraph_Tabs\n",
Image (Integer (Last_Index (Paragraph_Tabs))));
for X of Paragraph_Tabs loop
Put_Tab_In_Line_Vector ("", X);
end loop;
Dbg_Out.Put ("end Paragraph_Tabs\n");
end Put_Paragraph_Tabs;
F_Tab, C_Tab : Tab_Rec;
-- Start of processing for Calculate_Num_Blanks
begin
-- Debug printouts commented out for efficiency
while Kind (New_Tok) /= End_Of_Input loop
declare
-- First_Char_In_Line : constant Natural :=
-- Sloc (New_Tok).First - Sloc (New_Tok).Col + 1;
begin
Process_Line;
-- Dbg_Out.Put ("<<");
--
-- for X in First_Char_In_Line .. Sloc (New_Tok).First - 1 loop
-- for Tab of Cur_Line_Tabs loop
-- if X = Position (Out_Buf, Tabs (Tab).Mark) then
-- Dbg_Out.Put ("^");
-- end if;
-- end loop;
-- Dbg_Out.Put ("\1", To_UTF8 ((1 => Char_At (Out_Buf, X))));
-- end loop;
-- Dbg_Out.Put (">>\n");
-- Put_Tab_In_Line_Vector ("First", First_Line_Tabs);
-- Put_Tab_In_Line_Vector ("Cur", Cur_Line_Tabs);
Next_ss (New_Tok);
-- Consume the newline
if Is_Empty (Cur_Line_Tabs) then
-- Dbg_Out.Put ("Flush_Para -- no tabs\n");
Flush_Para;
-- Leave tabs from this line with Num_Blanks = 0.
Clear (First_Line_Tabs);
else
if Is_Empty (First_Line_Tabs) then
First_Line_Tabs := Cur_Line_Tabs;
else
-- If the Parents don't match, we're at the end of a
-- paragraph. We also end the paragraph if the line-tab
-- arrays are of different length, which can only
-- happen if a comment occurs in the middle of a
-- tabable construct (e.g. before ":=" in a variable
-- declaration), thus forcing a tab onto the next line.
F_Tab := Element (Tabs, First_Line_Tabs (1));
C_Tab := Element (Tabs, Cur_Line_Tabs (1));
if C_Tab.Parent = F_Tab.Parent
and then Last_Index (Cur_Line_Tabs) =
Last_Index (First_Line_Tabs)
then
pragma Debug
(Check_Tokens_Match
(Cur_Line_Tabs, First_Line_Tabs));
else
-- Dbg_Out.Put ("Flush_Para -- parent mismatch\n");
Flush_Para;
First_Line_Tabs := Cur_Line_Tabs;
end if;
F_Tab := (others => <>);
C_Tab := (others => <>);
end if;
Append (Paragraph_Tabs, Cur_Line_Tabs);
Clear (Cur_Line_Tabs);
end if;
end;
-- Dbg_Out.Put ("\n");
end loop;
pragma Assert (Cur_Tab_Index = Last_Index (Tabs));
end Calculate_Num_Blanks;
procedure Do_Insertions is
-- Go through the tokens, inserting Spaces for tabs that should
-- be expanded. Don't expand a tab if it would make the line too
-- long. Remove the Tab_Tokens from the token sequence.
New_Tok : Tokn_Cursor := First (Saved_New_Tokns'Access);
Next_Line_Break : Tokn_Cursor := Next (New_Tok);
-- Sloc_Col of this is the length of the current line, not
-- counting any spaces we have inserted.
pragma Assert (Kind (Next_Line_Break) = Enabled_LB_Token);
Num_Spaces : Natural := 0;
-- Number of spaces inserted in the current line so far
Cur_Line_Num : Positive := 1; -- for errors
begin
Check_Comment_Length := False;
while not After_Last (New_Tok) loop
case Kind (New_Tok) is
when Enabled_LB_Token =>
Cur_Line_Num := Cur_Line_Num + 1;
Error_Sloc := (Slocs.Line_Number (Cur_Line_Num), 1);
Num_Spaces := 0;
pragma Assert (New_Tok = Next_Line_Break);
loop
Next (Next_Line_Break);
exit when Kind (Next_Line_Break) in Enabled_LB_Token |
End_Of_Input;
end loop;
when Tab_Token =>
declare
Tab_X : constant Tab_Index :=
Tab_Token_Index (New_Tok);
Tab : Tab_Rec renames Tabs (Tab_X);
Next_Tab : Tab_Rec renames Tabs (Tab_X + 1);
begin
if not Tab.Deleted then
-- If Tab is an insertion point, then the very next
-- tab is the corresponding "real" tab; take its
-- Num_Blanks.
if Tab.Is_Insertion_Point then
pragma Assert (Tab.Num_Blanks = 0);
Tab.Num_Blanks := Next_Tab.Num_Blanks;
Next_Tab.Num_Blanks := 0;
end if;
declare
Line_Len : constant Natural :=
Sloc_Col (Next_Line_Break) + Num_Spaces - 1;
-- Current length of current line
New_Line_Len : constant Natural :=
Line_Len + Tab.Num_Blanks;
-- Length the current line will be after we expand
-- this tab. Don't do it if it will be too long.
begin
if New_Line_Len <= Arg (Cmd, Max_Line_Length)
then
Append_Spaces
(New_Tokns, Count => Tab.Num_Blanks,
Existing_OK => True);
Num_Spaces := Num_Spaces + Tab.Num_Blanks;
end if;
end;
end if;
end;
goto Skip_Append;
when Disabled_LB_Token =>
pragma Assert (False);
when others =>
null;
end case;
Append_Tokn (New_Tokns, New_Tok);
<<Skip_Append>>
Next (New_Tok);
end loop;
Check_Comment_Length := True;
end Do_Insertions;
-- Start of processing for Insert_Alignment_Helper
begin
Assign_Insertion_Points;
-- Go through the tabs and set their Num_Blanks field to the
-- appropriate value. Tabs that are not expanded at all will
-- have Num_Blanks left equal to zero.
pragma Debug
(Format_Debug_Output (Lines_Data, "before Calculate_Num_Blanks"));
Calculate_Num_Blanks;
pragma Debug
(Format_Debug_Output (Lines_Data, "after Calculate_Num_Blanks"));
-- Then do the actual insertions:
Do_Insertions;
Clear (Saved_New_Tokns);
Clear (Tabs);
end Insert_Alignment_Helper;
end Tok_Phases;
end Pp.Formatting;
|