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
4164
4165
4166
4167
4168
4169
4170
4171
4172
4173
4174
4175
4176
4177
4178
4179
4180
4181
4182
4183
4184
4185
4186
4187
4188
4189
4190
4191
4192
4193
4194
4195
4196
4197
4198
4199
4200
4201
4202
4203
4204
4205
4206
4207
4208
4209
4210
4211
4212
4213
4214
4215
4216
4217
4218
4219
4220
4221
4222
4223
4224
4225
4226
4227
4228
4229
4230
4231
4232
4233
4234
4235
4236
4237
4238
4239
4240
4241
4242
4243
4244
4245
4246
4247
4248
4249
4250
4251
4252
4253
4254
4255
4256
4257
4258
4259
4260
4261
4262
4263
4264
4265
4266
4267
4268
4269
4270
4271
4272
4273
4274
4275
4276
4277
4278
4279
4280
4281
4282
4283
4284
4285
4286
4287
4288
4289
4290
4291
4292
4293
4294
4295
4296
4297
4298
4299
4300
4301
4302
4303
4304
4305
4306
4307
4308
4309
4310
4311
4312
4313
4314
4315
4316
4317
4318
4319
4320
4321
4322
4323
4324
4325
4326
4327
4328
4329
4330
4331
4332
4333
4334
4335
4336
4337
4338
4339
4340
4341
4342
4343
4344
4345
4346
4347
4348
4349
4350
4351
4352
4353
4354
4355
4356
4357
4358
4359
4360
4361
4362
4363
4364
4365
4366
4367
4368
4369
4370
4371
4372
4373
4374
4375
4376
4377
4378
4379
4380
4381
4382
4383
4384
4385
4386
4387
4388
4389
4390
4391
4392
4393
4394
4395
4396
4397
4398
4399
4400
4401
4402
4403
4404
4405
4406
4407
4408
4409
4410
4411
4412
4413
4414
4415
4416
4417
4418
4419
4420
4421
4422
4423
4424
4425
4426
4427
4428
4429
4430
4431
4432
4433
4434
4435
4436
4437
4438
4439
4440
4441
4442
4443
4444
4445
4446
4447
4448
4449
4450
4451
4452
4453
4454
4455
4456
4457
4458
4459
4460
4461
4462
4463
4464
4465
4466
4467
4468
4469
4470
4471
4472
4473
4474
4475
4476
4477
4478
4479
4480
4481
4482
4483
4484
4485
4486
4487
4488
4489
4490
4491
4492
4493
4494
4495
4496
4497
4498
4499
4500
4501
4502
4503
4504
4505
4506
4507
4508
4509
4510
4511
4512
4513
4514
4515
4516
4517
4518
4519
4520
4521
4522
4523
4524
4525
4526
4527
4528
4529
4530
4531
4532
4533
4534
4535
4536
4537
4538
4539
4540
4541
4542
4543
4544
4545
4546
4547
4548
4549
4550
4551
4552
4553
4554
4555
4556
4557
4558
4559
4560
4561
4562
4563
4564
4565
4566
4567
4568
4569
4570
4571
4572
4573
4574
4575
4576
4577
4578
4579
4580
4581
4582
4583
4584
4585
4586
4587
4588
4589
4590
4591
4592
4593
4594
4595
4596
4597
4598
4599
4600
4601
4602
4603
4604
4605
4606
4607
4608
4609
4610
4611
4612
4613
4614
4615
4616
4617
4618
4619
4620
4621
4622
4623
4624
4625
4626
4627
4628
4629
4630
4631
4632
4633
4634
4635
4636
4637
4638
4639
4640
4641
4642
4643
4644
4645
4646
4647
4648
4649
4650
4651
4652
4653
4654
4655
4656
4657
4658
4659
4660
4661
4662
4663
4664
4665
4666
4667
4668
4669
4670
4671
4672
4673
4674
4675
4676
4677
4678
4679
4680
4681
4682
4683
4684
4685
4686
4687
4688
4689
4690
4691
4692
4693
4694
4695
4696
4697
4698
4699
4700
4701
4702
4703
4704
4705
4706
4707
4708
4709
4710
4711
4712
4713
4714
4715
4716
4717
4718
4719
4720
4721
4722
4723
4724
4725
4726
4727
4728
4729
4730
4731
4732
4733
4734
4735
4736
4737
4738
4739
4740
4741
4742
4743
4744
4745
4746
4747
4748
4749
4750
4751
4752
4753
4754
4755
4756
4757
4758
4759
4760
4761
4762
4763
4764
4765
4766
4767
4768
4769
4770
4771
4772
4773
4774
4775
4776
4777
4778
4779
4780
4781
4782
4783
4784
4785
4786
4787
4788
4789
4790
4791
4792
4793
4794
4795
4796
4797
4798
4799
4800
4801
4802
4803
4804
4805
4806
4807
4808
4809
4810
4811
4812
4813
4814
4815
4816
4817
4818
4819
4820
4821
4822
4823
4824
4825
4826
4827
4828
4829
4830
4831
4832
4833
4834
4835
4836
4837
4838
4839
4840
4841
4842
4843
4844
4845
4846
4847
4848
4849
4850
4851
4852
4853
4854
4855
4856
4857
4858
4859
4860
4861
4862
4863
4864
4865
4866
4867
4868
4869
4870
4871
4872
4873
4874
4875
4876
4877
4878
4879
4880
4881
4882
4883
4884
4885
4886
4887
4888
4889
4890
4891
4892
4893
4894
4895
4896
4897
4898
4899
4900
4901
4902
4903
4904
4905
4906
4907
4908
4909
4910
4911
4912
4913
4914
4915
4916
4917
4918
4919
4920
4921
4922
4923
4924
4925
4926
4927
4928
4929
4930
4931
4932
4933
4934
4935
4936
4937
4938
4939
4940
4941
4942
4943
4944
4945
4946
4947
4948
4949
4950
4951
4952
4953
4954
4955
4956
4957
4958
4959
4960
4961
4962
4963
4964
4965
4966
4967
4968
4969
4970
4971
4972
4973
4974
4975
4976
4977
4978
4979
4980
4981
4982
4983
4984
4985
4986
4987
4988
4989
4990
4991
4992
4993
4994
4995
4996
4997
4998
4999
5000
5001
5002
5003
5004
5005
5006
5007
5008
5009
5010
5011
5012
5013
5014
5015
5016
5017
5018
5019
5020
5021
5022
5023
5024
5025
5026
5027
5028
5029
5030
5031
5032
5033
5034
5035
5036
5037
5038
5039
5040
5041
5042
5043
5044
5045
5046
5047
5048
5049
5050
5051
5052
5053
5054
5055
5056
5057
5058
5059
5060
5061
5062
5063
5064
5065
5066
5067
5068
5069
5070
5071
5072
5073
5074
5075
5076
5077
5078
5079
5080
5081
5082
5083
5084
5085
5086
5087
5088
5089
5090
5091
5092
5093
5094
5095
5096
5097
5098
5099
5100
5101
5102
5103
5104
5105
5106
5107
5108
5109
5110
5111
5112
5113
5114
5115
5116
5117
5118
5119
5120
5121
5122
5123
5124
5125
5126
5127
5128
5129
5130
5131
5132
5133
5134
5135
5136
5137
5138
5139
5140
5141
5142
5143
5144
5145
5146
5147
5148
5149
5150
5151
5152
5153
5154
5155
5156
5157
5158
5159
5160
5161
5162
5163
5164
5165
5166
5167
5168
5169
5170
5171
5172
5173
5174
5175
5176
5177
5178
5179
5180
5181
5182
5183
5184
5185
5186
5187
5188
5189
5190
5191
5192
5193
5194
5195
5196
5197
5198
5199
5200
5201
5202
5203
5204
5205
5206
5207
5208
5209
5210
5211
5212
5213
5214
5215
5216
5217
5218
5219
5220
5221
5222
5223
5224
5225
5226
5227
5228
5229
5230
5231
5232
5233
5234
5235
5236
5237
5238
5239
5240
5241
5242
5243
5244
5245
5246
5247
5248
5249
5250
5251
5252
5253
5254
5255
5256
5257
5258
5259
5260
5261
5262
5263
5264
5265
5266
5267
5268
5269
5270
5271
5272
5273
5274
5275
5276
5277
5278
5279
5280
5281
5282
5283
5284
5285
5286
5287
5288
5289
5290
5291
5292
5293
5294
5295
5296
5297
5298
5299
5300
5301
5302
5303
5304
5305
5306
5307
5308
5309
5310
5311
5312
5313
5314
5315
5316
5317
5318
5319
5320
5321
5322
5323
5324
5325
5326
5327
5328
5329
5330
5331
5332
5333
5334
5335
5336
5337
5338
5339
5340
5341
5342
5343
5344
5345
5346
5347
5348
5349
5350
5351
5352
5353
5354
5355
5356
5357
5358
5359
5360
5361
5362
5363
5364
5365
5366
5367
5368
5369
5370
5371
5372
5373
5374
5375
5376
5377
5378
5379
5380
5381
5382
5383
5384
5385
5386
5387
5388
5389
5390
5391
5392
5393
5394
5395
5396
5397
5398
5399
5400
5401
5402
5403
5404
5405
5406
5407
5408
5409
5410
5411
5412
5413
5414
5415
5416
5417
5418
5419
5420
5421
5422
5423
5424
5425
5426
5427
5428
5429
5430
5431
5432
5433
5434
5435
5436
5437
5438
5439
5440
5441
5442
5443
5444
5445
5446
5447
5448
5449
5450
5451
5452
5453
5454
5455
5456
5457
5458
5459
5460
5461
5462
5463
5464
5465
5466
5467
5468
5469
5470
5471
5472
5473
5474
5475
5476
5477
5478
5479
5480
5481
5482
5483
5484
5485
5486
5487
5488
5489
5490
5491
5492
5493
5494
5495
5496
5497
5498
5499
5500
5501
5502
5503
5504
5505
5506
5507
5508
5509
5510
5511
5512
5513
5514
5515
5516
5517
5518
5519
5520
5521
5522
5523
5524
5525
5526
5527
5528
5529
5530
5531
5532
5533
5534
5535
5536
5537
5538
5539
5540
5541
5542
5543
5544
5545
5546
5547
5548
5549
5550
5551
5552
5553
5554
5555
5556
5557
5558
5559
|
/* readline.c -- a general facility for reading lines of input
with emacs style editing and completion. */
/* Copyright (C) 1987,1989 Free Software Foundation, Inc.
This file contains the Readline Library (the Library), a set of
routines for providing Emacs style line input to programs that ask
for it.
The Library is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 1, or (at your option)
any later version.
The Library is distributed in the hope that it will be useful, but
WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
General Public License for more details.
The GNU General Public License is often shipped with GNU software, and
is generally kept in a file called COPYING or LICENSE. If you do not
have a copy of the license, write to the Free Software Foundation,
675 Mass Ave, Cambridge, MA 02139, USA. */
/* Remove these declarations when we have a complete libgnu.a. */
#define STATIC_MALLOC
#ifndef STATIC_MALLOC
extern char *xmalloc (), *xrealloc ();
#else
static char *xmalloc (), *xrealloc ();
#endif
#include <stdio.h>
#include <sys/types.h>
#include <fcntl.h>
#include <sys/file.h>
#include <signal.h>
#ifdef __GNUC__
#define alloca __builtin_alloca
#else
#if defined (sparc) && defined (sun)
#include <alloca.h>
#endif
#endif
#define NEW_TTY_DRIVER
#if defined (SYSV) || defined (hpux)
#undef NEW_TTY_DRIVER
#include <termio.h>
#else
#include <sgtty.h>
#endif
#include <errno.h>
extern int errno;
#include <setjmp.h>
/* These next are for filename completion. Perhaps this belongs
in a different place. */
#include <sys/stat.h>
#include <pwd.h>
#ifdef SYSV
struct passwd *getpwuid (), *getpwent ();
#endif
#define HACK_TERMCAP_MOTION
#ifndef SYSV
#include <sys/dir.h>
#else /* SYSV */
#ifdef hpux
#include <ndir.h>
#else
#include <dirent.h>
#define direct dirent
#define d_namlen d_reclen
#endif /* hpux */
#endif /* SYSV */
/* Some standard library routines. */
#include "readline.h"
#include "history.h"
#ifndef digit
#define digit(c) ((c) >= '0' && (c) <= '9')
#endif
#ifndef isletter
#define isletter(c) (((c) >= 'A' && (c) <= 'Z') || ((c) >= 'a' && (c) <= 'z'))
#endif
#ifndef digit_value
#define digit_value(c) ((c) - '0')
#endif
#ifndef member
char *index ();
#define member(c, s) ((c) ? index ((s), (c)) : 0)
#endif
#ifndef isident
#define isident(c) ((isletter(c) || digit(c) || c == '_'))
#endif
#ifndef exchange
#define exchange(x, y) {int temp = x; x = y; y = temp;}
#endif
static update_line ();
static void output_character_function ();
static delete_chars ();
static start_insert ();
static end_insert ();
#ifdef VOID_SIGHANDLER
#define sighandler void
#else
#define sighandler int
#endif
/* This typedef is equivalant to the one for Function; it allows us
to say SigHandler *foo = signal (SIGKILL, SIG_IGN); */
typedef sighandler SigHandler ();
#ifdef SIGWINCH
static sighandler rl_handle_sigwinch ();
static SigHandler *old_sigwinch = (SigHandler *)NULL;
#endif
/* If on, then readline handles signals in a way that doesn't screw. */
#define HANDLE_SIGNALS
#if defined (SYSV)
#ifdef HANDLE_SIGNALS
#undef HANDLE_SIGNALS
#endif
#endif
/* **************************************************************** */
/* */
/* Line editing input utility */
/* */
/* **************************************************************** */
/* A pointer to the keymap that is currently in use.
By default, it is the standard emacs keymap. */
Keymap keymap = emacs_standard_keymap;
#define vi_mode 0
#define emacs_mode 1
/* The current style of editing. */
int rl_editing_mode = emacs_mode;
/* Non-zero if the previous command was a kill command. */
static int last_command_was_kill = 0;
/* The current value of the numeric argument specified by the user. */
int rl_numeric_arg = 1;
/* Non-zero if an argument was typed. */
int rl_explicit_arg = 0;
/* Temporary value used while generating the argument. */
static int arg_sign = 1;
/* Non-zero means we have been called at least once before. */
static int rl_initialized = 0;
/* If non-zero, this program is running in an EMACS buffer. */
static char *running_in_emacs = (char *)NULL;
/* The current offset in the current input line. */
int rl_point;
/* Mark in the current input line. */
int rl_mark;
/* Length of the current input line. */
int rl_end;
/* Make this non-zero to return the current input_line. */
int rl_done;
/* The last function executed by readline. */
Function *rl_last_func = (Function *)NULL;
/* Top level environment for readline_internal (). */
static jmp_buf readline_top_level;
/* The streams we interact with. */
static FILE *in_stream, *out_stream;
/* The names of the streams that we do input and output to. */
FILE *rl_instream = stdin, *rl_outstream = stdout;
/* Non-zero means echo characters as they are read. */
int readline_echoing_p = 1;
/* Current prompt. */
char *rl_prompt;
/* The number of characters read in order to type this complete command. */
int rl_key_sequence_length = 0;
/* If non-zero, then this is the address of a function to call just
before readline_internal () prints the first prompt. */
Function *rl_startup_hook = (Function *)NULL;
/* What we use internally. You should always refer to RL_LINE_BUFFER. */
static char *the_line;
/* The character that can generate an EOF. Really read from
the terminal driver... just defaulted here. */
static int eof_char = CTRL ('D');
/* Non-zero makes this the next keystroke to read. */
int rl_pending_input = 0;
/* Pointer to a useful terminal name. */
char *rl_terminal_name = (char *)NULL;
/* Line buffer and maintenence. */
char *rl_line_buffer = (char *)NULL;
static int rl_line_buffer_len = 0;
#define DEFAULT_BUFFER_SIZE 256
/* **************************************************************** */
/* */
/* Top Level Functions */
/* */
/* **************************************************************** */
/* Read a line of input. Prompt with PROMPT. A NULL PROMPT means
none. A return value of NULL means that EOF was encountered. */
char *
readline (prompt)
char *prompt;
{
static rl_prep_terminal (), rl_deprep_terminal ();
char *readline_internal ();
char *value;
rl_prompt = prompt;
/* If we are at EOF return a NULL string. */
if (rl_pending_input == EOF)
{
rl_pending_input = 0;
return ((char *)NULL);
}
rl_initialize ();
rl_prep_terminal ();
#ifdef SIGWINCH
old_sigwinch = (SigHandler *)signal (SIGWINCH, rl_handle_sigwinch);
#endif
#ifdef HANDLE_SIGNALS
rl_set_signals ();
#endif
value = readline_internal ();
rl_deprep_terminal ();
#ifdef SIGWINCH
signal (SIGWINCH, old_sigwinch);
#endif
#ifdef HANDLE_SIGNALS
rl_clear_signals ();
#endif
return (value);
}
/* Read a line of input from the global rl_instream, doing output on
the global rl_outstream.
If rl_prompt is non-null, then that is our prompt. */
char *
readline_internal ()
{
int lastc, c, eof_found;
in_stream = rl_instream; out_stream = rl_outstream;
lastc = eof_found = 0;
if (rl_startup_hook)
(*rl_startup_hook) ();
if (!readline_echoing_p)
{
if (rl_prompt)
fprintf (out_stream, "%s", rl_prompt);
}
else
{
rl_on_new_line ();
rl_redisplay ();
#ifdef VI_MODE
if (rl_editing_mode == vi_mode)
rl_vi_insertion_mode ();
#endif /* VI_MODE */
}
while (!rl_done)
{
int lk = last_command_was_kill;
int code = setjmp (readline_top_level);
if (code)
rl_redisplay ();
if (!rl_pending_input)
{
/* Then initialize the argument and number of keys read. */
rl_init_argument ();
rl_key_sequence_length = 0;
}
c = rl_read_key ();
/* EOF typed to a non-blank line is a <NL>. */
if (c == EOF && rl_end)
c = NEWLINE;
/* The character eof_char typed to blank line, and not as the
previous character is interpreted as EOF. */
if (((c == eof_char && lastc != c) || c == EOF) && !rl_end)
{
eof_found = 1;
break;
}
lastc = c;
rl_dispatch (c, keymap);
/* If there was no change in last_command_was_kill, then no kill
has taken place. Note that if input is pending we are reading
a prefix command, so nothing has changed yet. */
if (!rl_pending_input)
{
if (lk == last_command_was_kill)
last_command_was_kill = 0;
}
#ifdef VI_MODE
/* In vi mode, when you exit insert mode, the cursor moves back
over the previous character. We explicitly check for that here. */
if (rl_editing_mode == vi_mode && keymap == vi_movement_keymap)
rl_vi_check ();
#endif
if (!rl_done)
rl_redisplay ();
}
/* Restore the original of this history line, iff the line that we
are editing was originally in the history, AND the line has changed. */
{
HIST_ENTRY *entry = current_history ();
if (entry && rl_undo_list)
{
char *temp = savestring (the_line);
rl_revert_line ();
entry = replace_history_entry (where_history (), the_line,
(HIST_ENTRY *)NULL);
free_history_entry (entry);
strcpy (the_line, temp);
free (temp);
}
}
/* At any rate, it is highly likely that this line has an undo list. Get
rid of it now. */
if (rl_undo_list)
free_undo_list ();
if (eof_found)
return (char *)NULL;
else
return (savestring (the_line));
}
/* **************************************************************** */
/* */
/* Signal Handling */
/* */
/* **************************************************************** */
#ifdef SIGWINCH
static sighandler
rl_handle_sigwinch (sig, code, scp)
int sig, code;
struct sigcontext *scp;
{
char *term = rl_terminal_name, *getenv ();
if (readline_echoing_p)
{
if (!term)
term = getenv ("TERM");
if (!term)
term = "dumb";
rl_reset_terminal (term);
#ifdef NEVER
crlf ();
rl_forced_update_display ();
#endif
}
if (old_sigwinch &&
old_sigwinch != (SigHandler *)SIG_IGN &&
old_sigwinch != (SigHandler *)SIG_DFL)
(*old_sigwinch)(sig, code, scp);
}
#endif /* SIGWINCH */
#ifdef HANDLE_SIGNALS
/* Interrupt handling. */
static SigHandler *old_int = (SigHandler *)NULL,
*old_tstp = (SigHandler *)NULL,
*old_ttou = (SigHandler *)NULL,
*old_ttin = (SigHandler *)NULL,
*old_cont = (SigHandler *)NULL;
/* Handle an interrupt character. */
static sighandler
rl_signal_handler (sig, code, scp)
int sig, code;
struct sigcontext *scp;
{
static rl_prep_terminal (), rl_deprep_terminal ();
switch (sig)
{
case SIGINT:
free_undo_list ();
rl_clear_message ();
rl_init_argument ();
#ifdef SIGWINCH
signal (SIGWINCH, old_sigwinch);
#endif
#ifdef SIGTSTP
case SIGTSTP:
case SIGTTOU:
case SIGTTIN:
#endif
rl_clean_up_for_exit ();
rl_deprep_terminal ();
rl_clear_signals ();
rl_pending_input = 0;
kill (getpid (), sig);
sigsetmask (0);
rl_prep_terminal ();
rl_set_signals ();
}
}
rl_set_signals ()
{
static int rl_signal_handler ();
old_int = (SigHandler *)signal (SIGINT, rl_signal_handler);
if (old_int == (SigHandler *)SIG_IGN)
signal (SIGINT, SIG_IGN);
#ifdef SIGTSTP
old_tstp = (SigHandler *)signal (SIGTSTP, rl_signal_handler);
if (old_tstp == (SigHandler *)SIG_IGN)
signal (SIGTSTP, SIG_IGN);
#endif
#ifdef SIGTTOU
old_ttou = (SigHandler *)signal (SIGTTOU, rl_signal_handler);
old_ttin = (SigHandler *)signal (SIGTTIN, rl_signal_handler);
#endif
}
rl_clear_signals ()
{
signal (SIGINT, old_int);
#ifdef SIGTSTP
signal (SIGTSTP, old_tstp);
#endif
#ifdef SIGTTOU
signal (SIGTTOU, old_ttou);
signal (SIGTTIN, old_ttin);
#endif
}
#endif /* HANDLE_SIGNALS */
/* **************************************************************** */
/* */
/* Character Input Buffering */
/* */
/* **************************************************************** */
/* If the terminal was in xoff state when we got to it, then xon_char
contains the character that is supposed to start it again. */
static int xon_char, xoff_state;
static int pop_index = 0, push_index = 0, ibuffer_len = 511;
static unsigned char ibuffer[512];
/* Non-null means it is a pointer to a function to run while waiting for
character input. */
Function *rl_event_hook = (Function *)NULL;
#define any_typein (push_index != pop_index)
/* Add KEY to the buffer of characters to be read. */
rl_stuff_char (key)
int key;
{
if (key == EOF)
{
key = NEWLINE;
rl_pending_input = EOF;
}
ibuffer[push_index++] = key;
if (push_index >= ibuffer_len)
push_index = 0;
}
/* Return the amount of space available in the
buffer for stuffing characters. */
int
ibuffer_space ()
{
if (pop_index > push_index)
return (pop_index - push_index);
else
return (ibuffer_len - (push_index - pop_index));
}
/* Get a key from the buffer of characters to be read.
Return the key in KEY.
Result is KEY if there was a key, or 0 if there wasn't. */
int
rl_get_char (key)
int *key;
{
if (push_index == pop_index)
return (0);
*key = ibuffer[pop_index++];
if (pop_index >= ibuffer_len)
pop_index = 0;
return (1);
}
/* Stuff KEY into the *front* of the input buffer.
Returns non-zero if successful, zero if there is
no space left in the buffer. */
int
rl_unget_char (key)
int key;
{
if (ibuffer_space ())
{
pop_index--;
if (pop_index < 0)
pop_index = ibuffer_len - 1;
ibuffer[pop_index] = key;
return (1);
}
return (0);
}
/* If a character is available to be read, then read it
and stuff it into IBUFFER. Otherwise, just return. */
rl_gather_tyi ()
{
int tty = fileno (in_stream);
register int tem, result = -1;
long chars_avail;
char input;
#ifdef FIONREAD
result = ioctl (tty, FIONREAD, &chars_avail);
#endif
if (result == -1)
{
fcntl (tty, F_SETFL, O_NDELAY);
chars_avail = read (tty, &input, 1);
fcntl (tty, F_SETFL, 0);
if (chars_avail == -1 && errno == EAGAIN)
return;
}
tem = ibuffer_space ();
if (chars_avail > tem)
chars_avail = tem;
/* One cannot read all of the available input. I can only read a single
character at a time, or else programs which require input can be
thwarted. If the buffer is larger than one character, I lose.
Damn! */
if (tem < ibuffer_len)
chars_avail = 0;
if (result != -1)
{
while (chars_avail--)
rl_stuff_char (rl_getc (in_stream));
}
else
{
if (chars_avail)
rl_stuff_char (input);
}
}
/* Read a key, including pending input. */
int
rl_read_key ()
{
int c;
rl_key_sequence_length++;
if (rl_pending_input)
{
c = rl_pending_input;
rl_pending_input = 0;
}
else
{
static int next_macro_key ();
/* If input is coming from a macro, then use that. */
if (c = next_macro_key ())
return (c);
/* If the user has an event function, then call it periodically. */
if (rl_event_hook)
{
while (rl_event_hook && !rl_get_char (&c))
{
(*rl_event_hook) ();
rl_gather_tyi ();
}
}
else
{
if (!rl_get_char (&c))
c = rl_getc (in_stream);
}
}
#ifdef TIOCSTART
/* Ugh. But I can't think of a better way. */
if (xoff_state && c == xon_char)
{
ioctl (fileno (in_stream), TIOCSTART, 0);
xoff_state = 0;
return rl_read_key ();
}
#endif /* TIOCSTART */
return (c);
}
/* Do the command associated with KEY in MAP.
If the associated command is really a keymap, then read
another key, and dispatch into that map. */
rl_dispatch (key, map)
register int key;
Keymap map;
{
static int defining_kbd_macro;
if (defining_kbd_macro)
add_macro_char (key);
if (key > 127 && key < 256)
{
if (map[ESC].type == ISKMAP)
{
map = (Keymap)map[ESC].function;
key -= 128;
rl_dispatch (key, map);
}
else
ding ();
return;
}
switch (map[key].type)
{
case ISFUNC:
{
Function *func = map[key].function;
if (func != (Function *)NULL)
{
/* Special case rl_do_lowercase_version (). */
if (func == rl_do_lowercase_version)
{
rl_dispatch (to_lower (key), map);
return;
}
(*map[key].function)(rl_numeric_arg * arg_sign, key);
}
else
{
ding ();
return;
}
}
break;
case ISKMAP:
if (map[key].function != (Function *)NULL)
{
int newkey;
rl_key_sequence_length++;
newkey = rl_read_key ();
rl_dispatch (newkey, (Keymap)map[key].function);
}
else
{
ding ();
return;
}
break;
case ISMACR:
if (map[key].function != (Function *)NULL)
{
static with_macro_input ();
char *macro = savestring ((char *)map[key].function);
with_macro_input (macro);
return;
}
break;
}
/* If we have input pending, then the last command was a prefix
command. Don't change the state of rl_last_func. */
if (!rl_pending_input)
rl_last_func = map[key].function;
}
/* **************************************************************** */
/* */
/* Hacking Keyboard Macros */
/* */
/* **************************************************************** */
/* The currently executing macro string. If this is non-zero,
then it is a malloc ()'ed string where input is coming from. */
static char *executing_macro = (char *)NULL;
/* The offset in the above string to the next character to be read. */
static int executing_macro_index = 0;
/* Non-zero means to save keys that we dispatch on in a kbd macro. */
static int defining_kbd_macro = 0;
/* The current macro string being built. Characters get stuffed
in here by add_macro_char (). */
static char *current_macro = (char *)NULL;
/* The size of the buffer allocated to current_macro. */
static int current_macro_size = 0;
/* The index at which characters are being added to current_macro. */
static int current_macro_index = 0;
/* A structure used to save nested macro strings.
It is a linked list of string/index for each saved macro. */
struct saved_macro {
struct saved_macro *next;
char *string;
int index;
};
/* The list of saved macros. */
struct saved_macro *macro_list = (struct saved_macro *)NULL;
/* Set up to read subsequent input from STRING.
STRING is free ()'ed when we are done with it. */
static
with_macro_input (string)
char *string;
{
push_executing_macro ();
executing_macro = string;
executing_macro_index = 0;
}
/* Return the next character available from a macro, or 0 if
there are no macro characters. */
static int
next_macro_key ()
{
if (!executing_macro)
return (0);
if (!executing_macro[executing_macro_index])
{
pop_executing_macro ();
return (next_macro_key ());
}
return (executing_macro[executing_macro_index++]);
}
/* Save the currently executing macro on a stack of saved macros. */
static
push_executing_macro ()
{
struct saved_macro *saver;
saver = (struct saved_macro *)xmalloc (sizeof (struct saved_macro));
saver->next = macro_list;
saver->index = executing_macro_index;
saver->string = executing_macro;
macro_list = saver;
}
/* Discard the current macro, replacing it with the one
on the top of the stack of saved macros. */
static
pop_executing_macro ()
{
if (executing_macro)
free (executing_macro);
executing_macro = (char *)NULL;
executing_macro_index = 0;
if (macro_list)
{
struct saved_macro *disposer = macro_list;
executing_macro = macro_list->string;
executing_macro_index = macro_list->index;
macro_list = macro_list->next;
free (disposer);
}
}
/* Add a character to the macro being built. */
static
add_macro_char (c)
int c;
{
if (current_macro_index + 1 >= current_macro_size)
{
if (!current_macro)
current_macro = (char *)xmalloc (current_macro_size = 25);
else
current_macro =
(char *)xrealloc (current_macro, current_macro_size += 25);
}
current_macro[current_macro_index++] = c;
current_macro[current_macro_index] = '\0';
}
/* Begin defining a keyboard macro.
Keystrokes are recorded as they are executed.
End the definition with rl_end_kbd_macro ().
If a numeric argument was explicitly typed, then append this
definition to the end of the existing macro, and start by
re-executing the existing macro. */
rl_start_kbd_macro (ignore1, ignore2)
int ignore1, ignore2;
{
if (defining_kbd_macro)
rl_abort ();
if (rl_explicit_arg)
{
if (current_macro)
with_macro_input (savestring (current_macro));
}
else
current_macro_index = 0;
defining_kbd_macro = 1;
}
/* Stop defining a keyboard macro.
A numeric argument says to execute the macro right now,
that many times, counting the definition as the first time. */
rl_end_kbd_macro (count, ignore)
int count, ignore;
{
if (!defining_kbd_macro)
rl_abort ();
current_macro_index -= (rl_key_sequence_length - 1);
current_macro[current_macro_index] = '\0';
defining_kbd_macro = 0;
rl_call_last_kbd_macro (--count, 0);
}
/* Execute the most recently defined keyboard macro.
COUNT says how many times to execute it. */
rl_call_last_kbd_macro (count, ignore)
int count, ignore;
{
if (!current_macro)
rl_abort ();
while (count--)
with_macro_input (savestring (current_macro));
}
/* **************************************************************** */
/* */
/* Initializations */
/* */
/* **************************************************************** */
/* Initliaze readline (and terminal if not already). */
rl_initialize ()
{
extern char *rl_display_prompt;
/* If we have never been called before, initialize the
terminal and data structures. */
if (!rl_initialized)
{
readline_initialize_everything ();
rl_initialized++;
}
/* Initalize the current line information. */
rl_point = rl_end = 0;
the_line = rl_line_buffer;
the_line[0] = 0;
/* We aren't done yet. We haven't even gotten started yet! */
rl_done = 0;
/* Tell the history routines what is going on. */
start_using_history ();
/* Make the display buffer match the state of the line. */
{
extern char *rl_display_prompt;
extern int forced_display;
rl_on_new_line ();
rl_display_prompt = rl_prompt ? rl_prompt : "";
forced_display = 1;
}
/* No such function typed yet. */
rl_last_func = (Function *)NULL;
/* Parsing of key-bindings begins in an enabled state. */
{
static unsigned char parsing_conditionalized_out;
parsing_conditionalized_out = 0;
}
}
/* Initialize the entire state of the world. */
readline_initialize_everything ()
{
/* Find out if we are running in Emacs. */
running_in_emacs = (char *)getenv ("EMACS");
/* Allocate data structures. */
if (!rl_line_buffer)
rl_line_buffer =
(char *)xmalloc (rl_line_buffer_len = DEFAULT_BUFFER_SIZE);
/* Initialize the terminal interface. */
init_terminal_io ((char *)NULL);
/* Bind tty characters to readline functions. */
readline_default_bindings ();
/* Initialize the function names. */
rl_initialize_funmap ();
/* Read in the init file. */
rl_read_init_file ((char *)NULL);
/* If the completion parser's default word break characters haven't
been set yet, then do so now. */
{
extern char *rl_completer_word_break_characters;
extern char *rl_basic_word_break_characters;
if (rl_completer_word_break_characters == (char *)NULL)
rl_completer_word_break_characters = rl_basic_word_break_characters;
}
}
/* If this system allows us to look at the values of the regular
input editing characters, then bind them to their readline
equivalents. */
readline_default_bindings ()
{
#ifdef TIOCGETP
struct sgttyb ttybuff;
int tty = fileno (rl_instream);
if (ioctl (tty, TIOCGETP, &ttybuff) != -1)
{
int erase = ttybuff.sg_erase, kill = ttybuff.sg_kill;
if (erase != -1 && keymap[erase].type == ISFUNC)
keymap[erase].function = rl_rubout;
if (kill != -1 && keymap[kill].type == ISFUNC)
keymap[kill].function = rl_unix_line_discard;
}
#ifdef TIOCGLTC
{
struct ltchars lt;
if (ioctl (tty, TIOCGLTC, <) != -1)
{
int erase = lt.t_werasc, nextc = lt.t_lnextc;
if (erase != -1 && keymap[erase].type == ISFUNC)
keymap[erase].function = rl_unix_word_rubout;
if (nextc != -1 && keymap[nextc].type == ISFUNC)
keymap[nextc].function = rl_quoted_insert;
}
}
#endif /* TIOCGLTC */
#endif /* TIOCGETP */
}
/* **************************************************************** */
/* */
/* Numeric Arguments */
/* */
/* **************************************************************** */
/* Handle C-u style numeric args, as well as M--, and M-digits. */
/* Add the current digit to the argument in progress. */
rl_digit_argument (ignore, key)
int ignore, key;
{
rl_pending_input = key;
rl_digit_loop ();
}
/* What to do when you abort reading an argument. */
rl_discard_argument ()
{
ding ();
rl_clear_message ();
rl_init_argument ();
}
/* Create a default argument. */
rl_init_argument ()
{
rl_numeric_arg = arg_sign = 1;
rl_explicit_arg = 0;
}
/* C-u, universal argument. Multiply the current argument by 4.
Read a key. If the key has nothing to do with arguments, then
dispatch on it. If the key is the abort character then abort. */
rl_universal_argument ()
{
rl_numeric_arg *= 4;
rl_digit_loop ();
}
rl_digit_loop ()
{
int key, c;
while (1)
{
rl_message ("(arg: %d) ", arg_sign * rl_numeric_arg);
key = c = rl_read_key ();
if (keymap[c].type == ISFUNC &&
keymap[c].function == rl_universal_argument)
{
rl_numeric_arg *= 4;
continue;
}
c = UNMETA (c);
if (numeric (c))
{
if (rl_explicit_arg)
rl_numeric_arg = (rl_numeric_arg * 10) + (c - '0');
else
rl_numeric_arg = (c - '0');
rl_explicit_arg = 1;
}
else
{
if (c == '-' && !rl_explicit_arg)
{
rl_numeric_arg = 1;
arg_sign = -1;
}
else
{
rl_clear_message ();
rl_dispatch (key, keymap);
return;
}
}
}
}
/* **************************************************************** */
/* */
/* Display stuff */
/* */
/* **************************************************************** */
/* This is the stuff that is hard for me. I never seem to write good
display routines in C. Let's see how I do this time. */
/* (PWP) Well... Good for a simple line updater, but totally ignores
the problems of input lines longer than the screen width.
update_line and the code that calls it makes a multiple line,
automatically wrapping line update. Carefull attention needs
to be paid to the vertical position variables.
handling of terminals with autowrap on (incl. DEC braindamage)
could be improved a bit. Right now I just cheat and decrement
screenwidth by one. */
/* Keep two buffers; one which reflects the current contents of the
screen, and the other to draw what we think the new contents should
be. Then compare the buffers, and make whatever changes to the
screen itself that we should. Finally, make the buffer that we
just drew into be the one which reflects the current contents of the
screen, and place the cursor where it belongs.
Commands that want to can fix the display themselves, and then let
this function know that the display has been fixed by setting the
RL_DISPLAY_FIXED variable. This is good for efficiency. */
/* Termcap variables: */
extern char *term_up, *term_dc, *term_cr;
extern int screenheight, screenwidth, terminal_can_insert;
/* What YOU turn on when you have handled all redisplay yourself. */
int rl_display_fixed = 0;
/* The visible cursor position. If you print some text, adjust this. */
int last_c_pos = 0;
int last_v_pos = 0;
/* The last left edge of text that was displayed. This is used when
doing horizontal scrolling. It shifts in thirds of a screenwidth. */
static int last_lmargin = 0;
/* The line display buffers. One is the line currently displayed on
the screen. The other is the line about to be displayed. */
static char *visible_line = (char *)NULL;
static char *invisible_line = (char *)NULL;
/* Number of lines currently on screen minus 1. */
int vis_botlin = 0;
/* A buffer for `modeline' messages. */
char msg_buf[128];
/* Non-zero forces the redisplay even if we thought it was unnecessary. */
int forced_display = 0;
/* The stuff that gets printed out before the actual text of the line.
This is usually pointing to rl_prompt. */
char *rl_display_prompt = (char *)NULL;
/* Default and initial buffer size. Can grow. */
static int line_size = 1024;
/* Non-zero means to always use horizontal scrolling in line display. */
int horizontal_scroll_mode = 0;
/* I really disagree with this, but my boss (among others) insists that we
support compilers that don't work. I don't think we are gaining by doing
so; what is the advantage in producing better code if we can't use it? */
/* The following two declarations belong inside the
function block, not here. */
static void move_cursor_relative ();
static void output_some_chars ();
/* Basic redisplay algorithm. */
rl_redisplay ()
{
register int in, out, c, linenum;
register char *line = invisible_line;
int c_pos = 0;
int inv_botlin = 0; /* Number of lines in newly drawn buffer. */
extern int readline_echoing_p;
if (!readline_echoing_p)
return;
if (!rl_display_prompt)
rl_display_prompt = "";
if (!invisible_line)
{
visible_line = (char *)xmalloc (line_size);
invisible_line = (char *)xmalloc (line_size);
line = invisible_line;
for (in = 0; in < line_size; in++)
{
visible_line[in] = 0;
invisible_line[in] = 1;
}
rl_on_new_line ();
}
/* Draw the line into the buffer. */
c_pos = -1;
/* Mark the line as modified or not. We only do this for history
lines. */
out = 0;
if (current_history () && rl_undo_list)
{
line[out++] = '*';
line[out] = '\0';
}
/* If someone thought that the redisplay was handled, but the currently
visible line has a different modification state than the one about
to become visible, then correct the callers misconception. */
if (visible_line[0] != invisible_line[0])
rl_display_fixed = 0;
strncpy (line + out, rl_display_prompt, strlen (rl_display_prompt));
out += strlen (rl_display_prompt);
line[out] = '\0';
for (in = 0; in < rl_end; in++)
{
c = the_line[in];
if (out + 1 >= line_size)
{
line_size *= 2;
visible_line = (char *)xrealloc (visible_line, line_size);
invisible_line = (char *)xrealloc (invisible_line, line_size);
line = invisible_line;
}
if (in == rl_point)
c_pos = out;
if (c > 127)
{
line[out++] = 'M';
line[out++] = '-';
line[out++] = c - 128;
}
#define DISPLAY_TABS
#ifdef DISPLAY_TABS
else if (c == '\t')
{
register int newout = (out | (int)7) + 1;
while (out < newout)
line[out++] = ' ';
}
#endif
else if (c < 32)
{
line[out++] = 'C';
line[out++] = '-';
line[out++] = c + 64;
}
else
line[out++] = c;
}
line[out] = '\0';
if (c_pos < 0)
c_pos = out;
/* PWP: now is when things get a bit hairy. The visible and invisible
line buffers are really multiple lines, which would wrap every
(screenwidth - 1) characters. Go through each in turn, finding
the changed region and updating it. The line order is top to bottom. */
/* If we can move the cursor up and down, then use multiple lines,
otherwise, let long lines display in a single terminal line, and
horizontally scroll it. */
if (!horizontal_scroll_mode && term_up && *term_up)
{
int total_screen_chars = (screenwidth * screenheight);
if (!rl_display_fixed || forced_display)
{
forced_display = 0;
/* If we have more than a screenful of material to display, then
only display a screenful. We should display the last screen,
not the first. I'll fix this in a minute. */
if (out >= total_screen_chars)
out = total_screen_chars - 1;
/* Number of screen lines to display. */
inv_botlin = out / screenwidth;
/* For each line in the buffer, do the updating display. */
for (linenum = 0; linenum <= inv_botlin; linenum++)
update_line (linenum > vis_botlin ? ""
: &visible_line[linenum * screenwidth],
&invisible_line[linenum * screenwidth],
linenum);
/* We may have deleted some lines. If so, clear the left over
blank ones at the bottom out. */
if (vis_botlin > inv_botlin)
{
char *tt;
for (; linenum <= vis_botlin; linenum++)
{
tt = &visible_line[linenum * screenwidth];
move_vert (linenum);
move_cursor_relative (0, tt);
clear_to_eol ((linenum == vis_botlin)?
strlen (tt) : screenwidth);
}
}
vis_botlin = inv_botlin;
/* Move the cursor where it should be. */
move_vert (c_pos / screenwidth);
move_cursor_relative (c_pos % screenwidth,
&invisible_line[(c_pos / screenwidth) * screenwidth]);
}
}
else /* Do horizontal scrolling. */
{
int lmargin;
/* Always at top line. */
last_v_pos = 0;
/* If the display position of the cursor would be off the edge
of the screen, start the display of this line at an offset that
leaves the cursor on the screen. */
if (c_pos - last_lmargin > screenwidth - 2)
lmargin = (c_pos / (screenwidth / 3) - 2) * (screenwidth / 3);
else if (c_pos - last_lmargin < 1)
lmargin = ((c_pos - 1) / (screenwidth / 3)) * (screenwidth / 3);
else
lmargin = last_lmargin;
/* If the first character on the screen isn't the first character
in the display line, indicate this with a special character. */
if (lmargin > 0)
line[lmargin] = '<';
if (lmargin + screenwidth < out)
line[lmargin + screenwidth - 1] = '>';
if (!rl_display_fixed || forced_display || lmargin != last_lmargin)
{
forced_display = 0;
update_line (&visible_line[last_lmargin],
&invisible_line[lmargin], 0);
move_cursor_relative (c_pos - lmargin, &invisible_line[lmargin]);
last_lmargin = lmargin;
}
}
fflush (out_stream);
/* Swap visible and non-visible lines. */
{
char *temp = visible_line;
visible_line = invisible_line;
invisible_line = temp;
rl_display_fixed = 0;
}
}
/* PWP: update_line() is based on finding the middle difference of each
line on the screen; vis:
/old first difference
/beginning of line | /old last same /old EOL
v v v v
old: eddie> Oh, my little gruntle-buggy is to me, as lurgid as
new: eddie> Oh, my little buggy says to me, as lurgid as
^ ^ ^ ^
\beginning of line | \new last same \new end of line
\new first difference
All are character pointers for the sake of speed. Special cases for
no differences, as well as for end of line additions must be handeled.
Could be made even smarter, but this works well enough */
static
update_line (old, new, current_line)
register char *old, *new;
int current_line;
{
register char *ofd, *ols, *oe, *nfd, *nls, *ne;
int lendiff, wsatend;
/* Find first difference. */
for (ofd = old, nfd = new;
(ofd - old < screenwidth) && *ofd && (*ofd == *nfd);
ofd++, nfd++)
;
/* Move to the end of the screen line. */
for (oe = ofd; ((oe - old) < screenwidth) && *oe; oe++);
for (ne = nfd; ((ne - new) < screenwidth) && *ne; ne++);
/* If no difference, continue to next line. */
if (ofd == oe && nfd == ne)
return;
wsatend = 1; /* flag for trailing whitespace */
ols = oe - 1; /* find last same */
nls = ne - 1;
while ((*ols == *nls) && (ols > ofd) && (nls > nfd))
{
if (*ols != ' ')
wsatend = 0;
ols--;
nls--;
}
if (wsatend)
{
ols = oe;
nls = ne;
}
else if (*ols != *nls)
{
if (*ols) /* don't step past the NUL */
ols++;
if (*nls)
nls++;
}
move_vert (current_line);
move_cursor_relative (ofd - old, old);
/* if (len (new) > len (old)) */
lendiff = (nls - nfd) - (ols - ofd);
/* Insert (diff(len(old),len(new)) ch */
if (lendiff > 0)
{
if (terminal_can_insert)
{
extern char *term_IC;
/* Sometimes it is cheaper to print the characters rather than
use the terminal's capabilities. */
if ((2 * (ne - nfd)) < lendiff && (!term_IC || !*term_IC))
{
output_some_chars (nfd, (ne - nfd));
last_c_pos += (ne - nfd);
}
else
{
if (*ols)
{
start_insert (lendiff);
output_some_chars (nfd, lendiff);
last_c_pos += lendiff;
end_insert ();
}
else
{
/* At the end of a line the characters do not have to
be "inserted". They can just be placed on the screen. */
output_some_chars (nfd, lendiff);
last_c_pos += lendiff;
}
/* Copy (new) chars to screen from first diff to last match. */
if (((nls - nfd) - lendiff) > 0)
{
output_some_chars (&nfd[lendiff], ((nls - nfd) - lendiff));
last_c_pos += ((nls - nfd) - lendiff);
}
}
}
else
{ /* cannot insert chars, write to EOL */
output_some_chars (nfd, (ne - nfd));
last_c_pos += (ne - nfd);
}
}
else /* Delete characters from line. */
{
/* If possible and inexpensive to use terminal deletion, then do so. */
if (term_dc && (2 * (ne - nfd)) >= (-lendiff))
{
if (lendiff)
delete_chars (-lendiff); /* delete (diff) characters */
/* Copy (new) chars to screen from first diff to last match */
if ((nls - nfd) > 0)
{
output_some_chars (nfd, (nls - nfd));
last_c_pos += (nls - nfd);
}
}
/* Otherwise, print over the existing material. */
else
{
output_some_chars (nfd, (ne - nfd));
last_c_pos += (ne - nfd);
clear_to_eol ((oe - old) - (ne - new));
}
}
}
/* (PWP) tell the update routines that we have moved onto a
new (empty) line. */
rl_on_new_line ()
{
if (visible_line)
visible_line[0] = '\0';
last_c_pos = last_v_pos = 0;
vis_botlin = last_lmargin = 0;
}
/* Actually update the display, period. */
rl_forced_update_display ()
{
if (visible_line)
{
register char *temp = visible_line;
while (*temp) *temp++ = '\0';
}
rl_on_new_line ();
forced_display++;
rl_redisplay ();
}
/* Move the cursor from last_c_pos to NEW, which are buffer indices.
DATA is the contents of the screen line of interest; i.e., where
the movement is being done. */
static void
move_cursor_relative (new, data)
int new;
char *data;
{
register int i;
static void output_character_function ();
/* It may be faster to output a CR, and then move forwards instead
of moving backwards. */
if (new + 1 < last_c_pos - new)
{
tputs (term_cr, 1, output_character_function);
last_c_pos = 0;
}
if (last_c_pos == new) return;
if (last_c_pos < new)
{
/* Move the cursor forward. We do it by printing the command
to move the cursor forward if there is one, else print that
portion of the output buffer again. Which is cheaper? */
/* The above comment is left here for posterity. It is faster
to print one character (non-control) than to print a control
sequence telling the terminal to move forward one character.
That kind of control is for people who don't know what the
data is underneath the cursor. */
#ifdef HACK_TERMCAP_MOTION
extern char *term_forward_char;
if (term_forward_char)
for (i = last_c_pos; i < new; i++)
tputs (term_forward_char, 1, output_character_function);
else
for (i = last_c_pos; i < new; i++)
putc (data[i], out_stream);
#else
for (i = last_c_pos; i < new; i++)
putc (data[i], out_stream);
#endif /* HACK_TERMCAP_MOTION */
}
else
backspace (last_c_pos - new);
last_c_pos = new;
}
/* PWP: move the cursor up or down. */
move_vert (to)
int to;
{
void output_character_function ();
register int delta, i;
if (last_v_pos == to) return;
if (to > screenheight)
return;
if ((delta = to - last_v_pos) > 0)
{
for (i = 0; i < delta; i++)
putc ('\n', out_stream);
tputs (term_cr, 1, output_character_function);
last_c_pos = 0; /* because crlf() will do \r\n */
}
else
{ /* delta < 0 */
if (term_up && *term_up)
for (i = 0; i < -delta; i++)
tputs (term_up, 1, output_character_function);
}
last_v_pos = to; /* now to is here */
}
/* Physically print C on out_stream. This is for functions which know
how to optimize the display. */
rl_show_char (c)
int c;
{
if (c > 127)
{
fprintf (out_stream, "M-");
c -= 128;
}
#ifdef DISPLAY_TABS
if (c < 32 && c != '\t')
#else
if (c < 32)
#endif
{
c += 64;
}
putc (c, out_stream);
fflush (out_stream);
}
#ifdef DISPLAY_TABS
int
rl_character_len (c, pos)
register int c, pos;
{
if (c < ' ' || c > 126)
{
if (c == '\t')
return (((pos | (int)7) + 1) - pos);
else
return (3);
}
else
return (1);
}
#else
int
rl_character_len (c)
int c;
{
if (c < ' ' || c > 126)
return (3);
else
return (1);
}
#endif /* DISPLAY_TAB */
/* How to print things in the "echo-area". The prompt is treated as a
mini-modeline. */
rl_message (string, arg1, arg2)
char *string;
{
sprintf (msg_buf, string, arg1, arg2);
rl_display_prompt = msg_buf;
rl_redisplay ();
}
/* How to clear things from the "echo-area". */
rl_clear_message ()
{
rl_display_prompt = rl_prompt;
rl_redisplay ();
}
/* **************************************************************** */
/* */
/* Terminal and Termcap */
/* */
/* **************************************************************** */
static char *term_buffer = (char *)NULL;
static char *term_string_buffer = (char *)NULL;
/* Non-zero means this terminal can't really do anything. */
int dumb_term = 0;
char PC;
char *BC, *UP;
/* Some strings to control terminal actions. These are output by tputs (). */
char *term_goto, *term_clreol, *term_cr, *term_clrpag, *term_backspace;
int screenwidth, screenheight;
/* Non-zero if we determine that the terminal can do character insertion. */
int terminal_can_insert = 0;
/* How to insert characters. */
char *term_im, *term_ei, *term_ic, *term_ip, *term_IC;
/* How to delete characters. */
char *term_dc, *term_DC;
#ifdef HACK_TERMCAP_MOTION
char *term_forward_char;
#endif /* HACK_TERMCAP_MOTION */
/* How to go up a line. */
char *term_up;
/* Re-initialize the terminal considering that the TERM/TERMCAP variable
has changed. */
rl_reset_terminal (terminal_name)
char *terminal_name;
{
init_terminal_io (terminal_name);
}
init_terminal_io (terminal_name)
char *terminal_name;
{
char *term = (terminal_name? terminal_name : (char *)getenv ("TERM"));
char *tgetstr (), *buffer;
if (!term_string_buffer)
term_string_buffer = (char *)xmalloc (2048);
if (!term_buffer)
term_buffer = (char *)xmalloc (2048);
buffer = term_string_buffer;
term_clrpag = term_cr = term_clreol = (char *)NULL;
if (!term)
term = "dumb";
if (tgetent (term_buffer, term) < 0)
{
dumb_term = 1;
return;
}
BC = tgetstr ("pc", &buffer);
PC = buffer ? *buffer : 0;
term_backspace = tgetstr ("le", &buffer);
term_cr = tgetstr ("cr", &buffer);
term_clreol = tgetstr ("ce", &buffer);
term_clrpag = tgetstr ("cl", &buffer);
if (!term_cr)
term_cr = "\r";
#ifdef HACK_TERMCAP_MOTION
term_forward_char = tgetstr ("nd", &buffer);
#endif /* HACK_TERMCAP_MOTION */
screenwidth = tgetnum ("co");
if (screenwidth <= 0)
screenwidth = 80;
screenwidth--; /* PWP: avoid autowrap bugs */
screenheight = tgetnum ("li");
if (screenheight <= 0)
screenheight = 24;
term_im = tgetstr ("im", &buffer);
term_ei = tgetstr ("ei", &buffer);
term_IC = tgetstr ("IC", &buffer);
term_ic = tgetstr ("ic", &buffer);
term_ip = tgetstr ("ip", &buffer);
term_IC = tgetstr ("IC", &buffer);
/* "An application program can assume that the terminal can do
character insertion if *any one of* the capabilities `IC',
`im', `ic' or `ip' is provided." */
terminal_can_insert = (term_IC || term_im || term_ic || term_ip);
term_up = tgetstr ("up", &buffer);
term_dc = tgetstr ("dc", &buffer);
term_DC = tgetstr ("DC", &buffer);
}
/* A function for the use of tputs () */
static void
output_character_function (c)
int c;
{
putc (c, out_stream);
}
/* Write COUNT characters from STRING to the output stream. */
static void
output_some_chars (string, count)
char *string;
int count;
{
fwrite (string, 1, count, out_stream);
}
/* Delete COUNT characters from the display line. */
static
delete_chars (count)
int count;
{
if (count > screenwidth)
return;
if (term_DC && *term_DC)
{
char *tgoto (), *buffer;
buffer = tgoto (term_DC, 0, count);
tputs (buffer, 1, output_character_function);
}
else
{
if (term_dc && *term_dc)
while (count--)
tputs (term_dc, 1, output_character_function);
}
}
/* Prepare to insert by inserting COUNT blank spaces. */
static
start_insert (count)
int count;
{
if (term_im && *term_im)
tputs (term_im, 1, output_character_function);
if (term_IC && *term_IC &&
(count > 1 || !term_ic || !*term_ic))
{
char *tgoto (), *buffer;
buffer = tgoto (term_IC, 0, count);
tputs (buffer, 1, output_character_function);
}
else
{
if (term_ic && *term_ic)
while (count--)
tputs (term_ic, 1, output_character_function);
}
}
/* We are finished doing our insertion. Send ending string. */
static
end_insert ()
{
if (term_ei && *term_ei)
tputs (term_ei, 1, output_character_function);
}
/* Move the cursor back. */
backspace (count)
int count;
{
register int i;
if (term_backspace)
for (i = 0; i < count; i++)
tputs (term_backspace, 1, output_character_function);
else
for (i = 0; i < count; i++)
putc ('\b', out_stream);
}
/* Move to the start of the next line. */
crlf ()
{
tputs (term_cr, 1, output_character_function);
putc ('\n', out_stream);
}
/* Clear to the end of the line. COUNT is the minimum
number of character spaces to clear, */
clear_to_eol (count)
int count;
{
if (term_clreol) {
tputs (term_clreol, 1, output_character_function);
} else {
register int i;
/* Do one more character space. */
count++;
for (i = 0; i < count; i++)
putc (' ', out_stream);
backspace (count);
}
}
/* **************************************************************** */
/* */
/* Saving and Restoring the TTY */
/* */
/* **************************************************************** */
#ifdef NEW_TTY_DRIVER
/* Standard flags, including ECHO. */
static int original_tty_flags = 0;
/* Local mode flags, like LPASS8. */
static int local_mode_flags = 0;
/* Terminal characters. This has C-s and C-q in it. */
static struct tchars original_tchars;
/* Local special characters. This has the interrupt characters in it. */
static struct ltchars original_ltchars;
/* We use this to get and set the tty_flags. */
static struct sgttyb the_ttybuff;
/* Put the terminal in CBREAK mode so that we can detect key presses. */
static
rl_prep_terminal ()
{
int tty = fileno (rl_instream);
/* We always get the latest tty values. Maybe stty changed them. */
ioctl (tty, TIOCGETP, &the_ttybuff);
original_tty_flags = the_ttybuff.sg_flags;
readline_echoing_p = (original_tty_flags & ECHO);
/* If this terminal doesn't care how the 8th bit is used,
then we can use it for the meta-key.
We check by seeing if BOTH odd and even parity are allowed. */
if ((the_ttybuff.sg_flags & (ODDP | EVENP)) == (ODDP | EVENP))
{
#ifdef PASS8
the_ttybuff.sg_flags |= PASS8;
#endif
#if defined (TIOCLGET) && defined (LPASS8)
{
int flags;
ioctl (tty, TIOCLGET, &flags);
local_mode_flags = flags;
flags |= LPASS8;
ioctl (tty, TIOCLSET, &flags);
}
#endif
}
#ifdef TIOCGETC
{
struct tchars temp;
ioctl (tty, TIOCGETC, &original_tchars);
bcopy (&original_tchars, &temp, sizeof (struct tchars));
/* Get rid of C-s and C-q.
We remember the value of startc (C-q) so that if the terminal is in
xoff state, the user can xon it by pressing that character. */
xon_char = temp.t_startc;
temp.t_stopc = -1;
temp.t_startc = -1;
/* If there is an XON character, bind it to restart the output. */
if (xon_char != -1)
rl_bind_key (xon_char, rl_restart_output);
/* If there is an EOF char, bind eof_char to it. */
if (temp.t_eofc != -1)
eof_char = temp.t_eofc;
#ifdef NEVER
/* Get rid of C-\ and C-c. */
temp.t_intrc = temp.t_quitc = -1;
#endif
ioctl (tty, TIOCSETC, &temp);
}
#endif /* TIOCGETC */
#ifdef TIOCGLTC
{
struct ltchars temp;
ioctl (tty, TIOCGLTC, &original_ltchars);
bcopy (&original_ltchars, &temp, sizeof (struct ltchars));
/* Make the interrupt keys go away. Just enough to make people happy. */
temp.t_dsuspc = -1; /* C-y */
temp.t_lnextc = -1; /* C-v */
ioctl (tty, TIOCSLTC, &temp);
}
#endif /* TIOCGLTC */
the_ttybuff.sg_flags &= ~ECHO;
the_ttybuff.sg_flags |= CBREAK;
ioctl (tty, TIOCSETN, &the_ttybuff);
}
/* Restore the terminal to its original state. */
static
rl_deprep_terminal ()
{
int tty = fileno (rl_instream);
#if defined (TIOCLGET) && defined (LPASS8)
ioctl (tty, TIOCLSET, &local_mode_flags);
#endif
#ifdef TIOCSLTC
ioctl (tty, TIOCSLTC, &original_ltchars);
#endif
#ifdef TIOCSETC
ioctl (tty, TIOCSETC, &original_tchars);
#endif
the_ttybuff.sg_flags = original_tty_flags;
ioctl (tty, TIOCSETN, &the_ttybuff);
readline_echoing_p = 1;
}
#else /* !defined (NEW_TTY_DRIVER) */
static struct termio otio;
static
rl_prep_terminal ()
{
int tty = fileno (rl_instream);
struct termio tio;
ioctl (tty, TCGETA, &tio);
ioctl (tty, TCGETA, &otio);
readline_echoing_p = (tio.c_lflag & ECHO);
tio.c_lflag &= ~(ICANON|ECHO);
tio.c_iflag &= ~(IXON|ISTRIP|INPCK);
#ifndef HANDLE_SIGNALS
tio.c_lflag &= ~ISIG;
#endif
tio.c_cc[VEOF] = 1; /* really: MIN */
tio.c_cc[VEOL] = 0; /* really: TIME */
ioctl (tty, TCSETAW,&tio);
}
static
rl_deprep_terminal ()
{
int tty = fileno (rl_instream);
ioctl (tty, TCSETAW, &otio);
}
#endif /* NEW_TTY_DRIVER */
/* **************************************************************** */
/* */
/* Utility Functions */
/* */
/* **************************************************************** */
/* Return 0 if C is not a member of the class of characters that belong
in words, or 1 if it is. */
int allow_pathname_alphabetic_chars = 0;
char *pathname_alphabetic_chars = "/-_=~.#$";
int
alphabetic (c)
int c;
{
char *rindex ();
if (pure_alphabetic (c) || (numeric (c)))
return (1);
if (allow_pathname_alphabetic_chars)
return ((int)rindex (pathname_alphabetic_chars, c));
else
return (0);
}
/* Return non-zero if C is a numeric character. */
int
numeric (c)
int c;
{
return (c >= '0' && c <= '9');
}
/* Ring the terminal bell. */
int
ding ()
{
if (readline_echoing_p)
{
fprintf (stderr, "\007");
fflush (stderr);
}
return (-1);
}
/* How to abort things. */
rl_abort ()
{
ding ();
rl_clear_message ();
rl_init_argument ();
rl_pending_input = 0;
defining_kbd_macro = 0;
while (executing_macro)
pop_executing_macro ();
longjmp (readline_top_level, 1);
}
/* Return a copy of the string between FROM and TO.
FROM is inclusive, TO is not. */
char *
rl_copy (from, to)
int from, to;
{
register int length;
char *copy;
/* Fix it if the caller is confused. */
if (from > to) {
int t = from;
from = to;
to = t;
}
length = to - from;
copy = (char *)xmalloc (1 + length);
strncpy (copy, the_line + from, length);
copy[length] = '\0';
return (copy);
}
/* **************************************************************** */
/* */
/* Insert and Delete */
/* */
/* **************************************************************** */
/* Insert a string of text into the line at point. This is the only
way that you should do insertion. rl_insert () calls this
function. */
rl_insert_text (string)
char *string;
{
extern int doing_an_undo;
register int i, l = strlen (string);
while (rl_end + l >= rl_line_buffer_len)
{
rl_line_buffer =
(char *)xrealloc (rl_line_buffer,
rl_line_buffer_len += DEFAULT_BUFFER_SIZE);
the_line = rl_line_buffer;
}
for (i = rl_end; i >= rl_point; i--)
the_line[i + l] = the_line[i];
strncpy (the_line + rl_point, string, l);
/* Remember how to undo this if we aren't undoing something. */
if (!doing_an_undo)
{
/* If possible and desirable, concatenate the undos. */
if ((strlen (string) == 1) &&
rl_undo_list &&
(rl_undo_list->what == UNDO_INSERT) &&
(rl_undo_list->end == rl_point) &&
(rl_undo_list->end - rl_undo_list->start < 20))
rl_undo_list->end++;
else
rl_add_undo (UNDO_INSERT, rl_point, rl_point + l, (char *)NULL);
}
rl_point += l;
rl_end += l;
the_line[rl_end] = '\0';
}
/* Delete the string between FROM and TO. FROM is
inclusive, TO is not. */
rl_delete_text (from, to)
int from, to;
{
extern int doing_an_undo;
register char *text;
/* Fix it if the caller is confused. */
if (from > to) {
int t = from;
from = to;
to = t;
}
text = rl_copy (from, to);
strncpy (the_line + from, the_line + to, rl_end - to);
/* Remember how to undo this delete. */
if (!doing_an_undo)
rl_add_undo (UNDO_DELETE, from, to, text);
else
free (text);
rl_end -= (to - from);
the_line[rl_end] = '\0';
}
/* **************************************************************** */
/* */
/* Readline character functions */
/* */
/* **************************************************************** */
/* This is not a gap editor, just a stupid line input routine. No hair
is involved in writing any of the functions, and none should be. */
/* Note that:
rl_end is the place in the string that we would place '\0';
i.e., it is always safe to place '\0' there.
rl_point is the place in the string where the cursor is. Sometimes
this is the same as rl_end.
Any command that is called interactively receives two arguments.
The first is a count: the numeric arg pased to this command.
The second is the key which invoked this command.
*/
/* **************************************************************** */
/* */
/* Movement Commands */
/* */
/* **************************************************************** */
/* Note that if you `optimize' the display for these functions, you cannot
use said functions in other functions which do not do optimizing display.
I.e., you will have to update the data base for rl_redisplay, and you
might as well let rl_redisplay do that job. */
/* Move forward COUNT characters. */
rl_forward (count)
int count;
{
if (count < 0)
rl_backward (-count);
else
while (count)
{
#ifdef VI_MODE
if (rl_point == (rl_end - (rl_editing_mode == vi_mode)))
#else
if (rl_point == rl_end)
#endif
{
ding ();
return;
}
else
rl_point++;
--count;
}
}
/* Move backward COUNT characters. */
rl_backward (count)
int count;
{
if (count < 0)
rl_forward (-count);
else
while (count)
{
if (!rl_point)
{
ding ();
return;
}
else
--rl_point;
--count;
}
}
/* Move to the beginning of the line. */
rl_beg_of_line ()
{
rl_point = 0;
}
/* Move to the end of the line. */
rl_end_of_line ()
{
rl_point = rl_end;
}
/* Move forward a word. We do what Emacs does. */
rl_forward_word (count)
int count;
{
int c;
if (count < 0)
{
rl_backward_word (-count);
return;
}
while (count)
{
if (rl_point == rl_end)
return;
/* If we are not in a word, move forward until we are in one.
Then, move forward until we hit a non-alphabetic character. */
c = the_line[rl_point];
if (!alphabetic (c))
{
while (++rl_point < rl_end)
{
c = the_line[rl_point];
if (alphabetic (c)) break;
}
}
if (rl_point == rl_end) return;
while (++rl_point < rl_end)
{
c = the_line[rl_point];
if (!alphabetic (c)) break;
}
--count;
}
}
/* Move backward a word. We do what Emacs does. */
rl_backward_word (count)
int count;
{
int c;
if (count < 0)
{
rl_forward_word (-count);
return;
}
while (count)
{
if (!rl_point)
return;
/* Like rl_forward_word (), except that we look at the characters
just before point. */
c = the_line[rl_point - 1];
if (!alphabetic (c))
{
while (--rl_point)
{
c = the_line[rl_point - 1];
if (alphabetic (c)) break;
}
}
while (rl_point)
{
c = the_line[rl_point - 1];
if (!alphabetic (c))
break;
else --rl_point;
}
--count;
}
}
/* Clear the current line. Numeric argument to C-l does this. */
rl_refresh_line ()
{
int curr_line = last_c_pos / screenwidth;
move_vert(curr_line);
move_cursor_relative (0, the_line); /* XXX is this right */
rl_forced_update_display ();
rl_display_fixed = 1;
}
/* C-l typed to a line without quoting clears the screen, and then reprints
the prompt and the current input line. Given a numeric arg, redraw only
the current line. */
rl_clear_screen ()
{
extern char *term_clrpag;
static void output_character_function ();
if (rl_explicit_arg)
{
rl_refresh_line ();
return;
}
if (term_clrpag)
tputs (term_clrpag, 1, output_character_function);
else
crlf ();
rl_forced_update_display ();
rl_display_fixed = 1;
}
/* **************************************************************** */
/* */
/* Text commands */
/* */
/* **************************************************************** */
/* Insert the character C at the current location, moving point forward. */
rl_insert (count, c)
int count, c;
{
register int i;
char *string;
if (count <= 0)
return;
/* If we can optimize, then do it. But don't let people crash
readline because of extra large arguments. */
if (count > 1 && count < 1024)
{
string = (char *)alloca (1 + count);
for (i = 0; i < count; i++)
string[i] = c;
string[i] = '\0';
rl_insert_text (string);
return;
}
if (count > 1024)
{
int descreaser;
string = (char *)alloca (1024 + 1);
for (i = 0; i < 1024; i++)
string[i] = c;
while (count)
{
descreaser = (count > 1024 ? 1024 : count);
string[descreaser] = '\0';
rl_insert_text (string);
count -= descreaser;
}
return;
}
/* We are inserting a single character.
If there is pending input, then make a string of all of the
pending characters that are bound to rl_insert, and insert
them all. */
if (any_typein)
{
int slen, key = 0, t;
i = 0;
string = (char *)alloca (ibuffer_len + 1);
string[i++] = c;
while ((t = rl_get_char (&key)) &&
(keymap[key].type == ISFUNC &&
keymap[key].function == rl_insert))
string[i++] = key;
if (t)
rl_unget_char (key);
string[i] = '\0';
rl_insert_text (string);
return;
}
else
{
/* Inserting a single character. */
string = (char *)alloca (2);
string[1] = '\0';
string[0] = c;
rl_insert_text (string);
}
}
/* Insert the next typed character verbatim. */
rl_quoted_insert (count)
int count;
{
int c = rl_read_key (in_stream);
rl_insert (count, c);
}
/* Insert a tab character. */
rl_tab_insert (count)
int count;
{
rl_insert (count, '\t');
}
/* What to do when a NEWLINE is pressed. We accept the whole line.
KEY is the key that invoked this command. I guess it could have
meaning in the future. */
rl_newline (count, key)
int count, key;
{
rl_done = 1;
#ifdef VI_MODE
{
static int vi_doing_insert;
if (vi_doing_insert)
{
rl_end_undo_group ();
vi_doing_insert = 0;
}
}
#endif /* VI_MODE */
if (readline_echoing_p)
{
move_vert (vis_botlin);
vis_botlin = 0;
crlf ();
fflush (out_stream);
rl_display_fixed++;
}
}
rl_clean_up_for_exit ()
{
if (readline_echoing_p)
{
move_vert (vis_botlin);
vis_botlin = 0;
fflush (out_stream);
rl_restart_output ();
}
}
/* What to do for some uppercase characters, like meta characters,
and some characters appearing in emacs_ctlx_keymap. This function
is just a stub, you bind keys to it and the code in rl_dispatch ()
is special cased. */
rl_do_lowercase_version (ignore1, ignore2)
int ignore1, ignore2;
{
}
/* Rubout the character behind point. */
rl_rubout (count)
int count;
{
if (count < 0)
{
rl_delete (-count);
return;
}
if (!rl_point)
{
ding ();
return;
}
if (count > 1)
{
int orig_point = rl_point;
rl_backward (count);
rl_kill_text (orig_point, rl_point);
}
else
{
int c = the_line[--rl_point];
rl_delete_text (rl_point, rl_point + 1);
if (rl_point == rl_end && alphabetic (c) && last_c_pos)
{
backspace (1);
putc (' ', out_stream);
backspace (1);
last_c_pos--;
rl_display_fixed++;
}
}
}
/* Delete the character under the cursor. Given a numeric argument,
kill that many characters instead. */
rl_delete (count, invoking_key)
int count;
{
if (count < 0)
{
rl_rubout (-count);
return;
}
if (rl_point == rl_end)
{
ding ();
return;
}
if (count > 1)
{
int orig_point = rl_point;
rl_forward (count);
rl_kill_text (orig_point, rl_point);
rl_point = orig_point;
}
else
rl_delete_text (rl_point, rl_point + 1);
}
/* **************************************************************** */
/* */
/* Kill commands */
/* */
/* **************************************************************** */
/* The next two functions mimic unix line editing behaviour, except they
save the deleted text on the kill ring. This is safer than not saving
it, and since we have a ring, nobody should get screwed. */
/* This does what C-w does in Unix. We can't prevent people from
using behaviour that they expect. */
rl_unix_word_rubout ()
{
if (!rl_point) ding ();
else {
int orig_point = rl_point;
while (rl_point && whitespace (the_line[rl_point - 1]))
rl_point--;
while (rl_point && !whitespace (the_line[rl_point - 1]))
rl_point--;
rl_kill_text (rl_point, orig_point);
}
}
/* Here is C-u doing what Unix does. You don't *have* to use these
key-bindings. We have a choice of killing the entire line, or
killing from where we are to the start of the line. We choose the
latter, because if you are a Unix weenie, then you haven't backspaced
into the line at all, and if you aren't, then you know what you are
doing. */
rl_unix_line_discard ()
{
if (!rl_point) ding ();
else {
rl_kill_text (rl_point, 0);
rl_point = 0;
}
}
/* **************************************************************** */
/* */
/* Commands For Typos */
/* */
/* **************************************************************** */
/* Random and interesting things in here. */
/* **************************************************************** */
/* */
/* Changing Case */
/* */
/* **************************************************************** */
/* The three kinds of things that we know how to do. */
#define UpCase 1
#define DownCase 2
#define CapCase 3
/* Uppercase the word at point. */
rl_upcase_word (count)
int count;
{
rl_change_case (count, UpCase);
}
/* Lowercase the word at point. */
rl_downcase_word (count)
int count;
{
rl_change_case (count, DownCase);
}
/* Upcase the first letter, downcase the rest. */
rl_capitalize_word (count)
int count;
{
rl_change_case (count, CapCase);
}
/* The meaty function.
Change the case of COUNT words, performing OP on them.
OP is one of UpCase, DownCase, or CapCase.
If a negative argument is given, leave point where it started,
otherwise, leave it where it moves to. */
rl_change_case (count, op)
int count, op;
{
register int start = rl_point, end;
int state = 0;
rl_forward_word (count);
end = rl_point;
if (count < 0)
{
int temp = start;
start = end;
end = temp;
}
/* We are going to modify some text, so let's prepare to undo it. */
rl_modifying (start, end);
for (; start < end; start++)
{
switch (op)
{
case UpCase:
the_line[start] = to_upper (the_line[start]);
break;
case DownCase:
the_line[start] = to_lower (the_line[start]);
break;
case CapCase:
if (state == 0)
{
the_line[start] = to_upper (the_line[start]);
state = 1;
}
else
{
the_line[start] = to_lower (the_line[start]);
}
if (!pure_alphabetic (the_line[start]))
state = 0;
break;
default:
abort ();
}
}
rl_point = end;
}
/* **************************************************************** */
/* */
/* Transposition */
/* */
/* **************************************************************** */
/* Transpose the words at point. */
rl_transpose_words (count)
int count;
{
char *word1, *word2;
int w1_beg, w1_end, w2_beg, w2_end;
int orig_point = rl_point;
if (!count) return;
/* Find the two words. */
rl_forward_word (count);
w2_end = rl_point;
rl_backward_word (1);
w2_beg = rl_point;
rl_backward_word (count);
w1_beg = rl_point;
rl_forward_word (1);
w1_end = rl_point;
/* Do some check to make sure that there really are two words. */
if ((w1_beg == w2_beg) || (w2_beg < w1_end))
{
ding ();
rl_point = orig_point;
return;
}
/* Get the text of the words. */
word1 = rl_copy (w1_beg, w1_end);
word2 = rl_copy (w2_beg, w2_end);
/* We are about to do many insertions and deletions. Remember them
as one operation. */
rl_begin_undo_group ();
/* Do the stuff at word2 first, so that we don't have to worry
about word1 moving. */
rl_point = w2_beg;
rl_delete_text (w2_beg, w2_end);
rl_insert_text (word1);
rl_point = w1_beg;
rl_delete_text (w1_beg, w1_end);
rl_insert_text (word2);
/* This is exactly correct since the text before this point has not
changed in length. */
rl_point = w2_end;
/* I think that does it. */
rl_end_undo_group ();
free (word1); free (word2);
}
/* Transpose the characters at point. If point is at the end of the line,
then transpose the characters before point. */
rl_transpose_chars (count)
int count;
{
if (!count)
return;
if (!rl_point || rl_end < 2) {
ding ();
return;
}
while (count) {
if (rl_point == rl_end) {
int t = the_line[rl_point - 1];
the_line[rl_point - 1] = the_line[rl_point - 2];
the_line[rl_point - 2] = t;
} else {
int t = the_line[rl_point];
the_line[rl_point] = the_line[rl_point - 1];
the_line[rl_point - 1] = t;
if (count < 0 && rl_point)
rl_point--;
else
rl_point++;
}
if (count < 0)
count++;
else
count--;
}
}
/* **************************************************************** */
/* */
/* Bogus Flow Control */
/* */
/* **************************************************************** */
rl_restart_output (count, key)
int count, key;
{
int fildes = fileno (stdin);
#ifdef TIOCSTART
ioctl (fildes, TIOCSTART, 0);
#endif /* TIOCSTART */
}
/* **************************************************************** */
/* */
/* Completion matching, from readline's point of view. */
/* */
/* **************************************************************** */
/* Pointer to the generator function for completion_matches ().
NULL means to use filename_entry_function (), the default filename
completer. */
Function *rl_completion_entry_function = (Function *)NULL;
/* Pointer to alternative function to create matches.
Function is called with TEXT, START, and END.
START and END are indices in RL_LINE_BUFFER saying what the boundaries
of TEXT are.
If this function exists and returns NULL then call the value of
rl_completion_entry_function to try to match, otherwise use the
array of strings returned. */
Function *rl_attempted_completion_function = (Function *)NULL;
/* Complete the word at or before point. You have supplied the function
that does the initial simple matching selection algorithm (see
completion_matches ()). The default is to do filename completion. */
rl_complete (ignore, invoking_key)
int ignore, invoking_key;
{
rl_complete_internal (TAB);
if (running_in_emacs)
printf ("%s", the_line);
}
/* List the possible completions. See description of rl_complete (). */
rl_possible_completions ()
{
rl_complete_internal ('?');
}
/* The user must press "y" or "n". Non-zero return means "y" pressed. */
get_y_or_n ()
{
int c;
loop:
c = rl_read_key (in_stream);
if (c == 'y' || c == 'Y') return (1);
if (c == 'n' || c == 'N') return (0);
if (c == ABORT_CHAR) rl_abort ();
ding (); goto loop;
}
/* Up to this many items will be displayed in response to a
possible-completions call. After that, we ask the user if
she is sure she wants to see them all. */
int rl_completion_query_items = 100;
/* The basic list of characters that signal a break between words for the
completer routine. The contents of this variable is what breaks words
in the shell, i.e. " \t\n\"\\'`@$><=" */
char *rl_basic_word_break_characters = " \t\n\"\\'`@$><=";
/* The list of characters that signal a break between words for
rl_complete_internal. The default list is the contents of
rl_basic_word_break_characters. */
char *rl_completer_word_break_characters = (char *)NULL;
/* List of characters that are word break characters, but should be left
in TEXT when it is passed to the completion function. The shell uses
this to help determine what kind of completing to do. */
char *rl_special_prefixes = (char *)NULL;
/* If non-zero, then disallow duplicates in the matches. */
int rl_ignore_completion_duplicates = 1;
/* Non-zero means that the results of the matches are to be treated
as filenames. This is ALWAYS zero on entry, and can only be changed
within a completion entry finder function. */
int rl_filename_completion_desired = 0;
/* Complete the word at or before point.
WHAT_TO_DO says what to do with the completion.
`?' means list the possible completions.
TAB means do standard completion.
`*' means insert all of the possible completions. */
rl_complete_internal (what_to_do)
int what_to_do;
{
char *filename_completion_function ();
char **completion_matches (), **matches;
Function *our_func;
int start, end, delimiter = 0;
char *text;
if (rl_completion_entry_function)
our_func = rl_completion_entry_function;
else
our_func = (int (*)())filename_completion_function;
/* Only the completion entry function can change this. */
rl_filename_completion_desired = 0;
/* We now look backwards for the start of a filename/variable word. */
end = rl_point;
if (rl_point)
{
while (--rl_point &&
!rindex (rl_completer_word_break_characters, the_line[rl_point]));
/* If we are at a word break, then advance past it. */
if (rindex (rl_completer_word_break_characters, (the_line[rl_point])))
{
/* If the character that caused the word break was a quoting
character, then remember it as the delimiter. */
if (rindex ("\"'", the_line[rl_point]) && (end - rl_point) > 1)
delimiter = the_line[rl_point];
/* If the character isn't needed to determine something special
about what kind of completion to perform, then advance past it. */
if (!rl_special_prefixes ||
!rindex (rl_special_prefixes, the_line[rl_point]))
rl_point++;
}
}
start = rl_point;
rl_point = end;
text = rl_copy (start, end);
/* If the user wants to TRY to complete, but then wants to give
up and use the default completion function, they set the
variable rl_attempted_completion_function. */
if (rl_attempted_completion_function)
{
matches =
(char **)(*rl_attempted_completion_function) (text, start, end);
if (matches)
goto after_usual_completion;
}
matches = completion_matches (text, our_func, start, end);
after_usual_completion:
free (text);
if (!matches)
ding ();
else
{
register int i;
some_matches:
/* It seems to me that in all the cases we handle we would like
to ignore duplicate possiblilities. Scan for the text to
insert being identical to the other completions. */
if (rl_ignore_completion_duplicates)
{
char *lowest_common;
int compare_strings (), j, newlen = 0;
/* Sort the items. */
/* It is safe to sort this array, because the lowest common
denominator found in matches[0] will remain in place. */
for (i = 0; matches[i]; i++);
qsort (matches, i, sizeof (char *), compare_strings);
/* Remember the lowest common denimator for it may be unique. */
lowest_common = savestring (matches[0]);
for (i = 0; matches[i + 1]; i++)
{
if (strcmp (matches[i], matches[i + 1]) == 0)
{
free (matches[i]);
matches[i] = (char *)-1;
}
else
newlen++;
}
/* We have marked all the dead slots with (char *)-1.
Copy all the non-dead entries into a new array. */
{
char **temp_array =
(char **)malloc ((3 + newlen) * sizeof (char *));
for (i = 1, j = 1; matches[i]; i++)
if (matches[i] != (char *)-1)
temp_array[j++] = matches[i];
temp_array[j] = (char *)NULL;
if (matches[0] != (char *)-1)
free (matches[0]);
free (matches);
matches = temp_array;
}
/* Place the lowest common denominator back in [0]. */
matches[0] = lowest_common;
/* If there is one string left, and it is identical to the
lowest common denominator, then the LCD is the string to
insert. */
if (j == 2 && strcmp (matches[0], matches[1]) == 0)
{
free (matches[1]);
matches[1] = (char *)NULL;
}
}
switch (what_to_do)
{
case TAB:
rl_delete_text (start, rl_point);
rl_point = start;
rl_insert_text (matches[0]);
/* If there are more matches, ring the bell to indicate.
If this was the only match, and we are hacking files,
check the file to see if it was a directory. If so,
add a '/' to the name. If not, and we are at the end
of the line, then add a space. */
if (matches[1])
{
ding (); /* There are other matches remaining. */
}
else
{
char temp_string[2];
temp_string[0] = delimiter ? delimiter : ' ';
temp_string[1] = '\0';
if (rl_filename_completion_desired)
{
struct stat finfo;
char *tilde_expand ();
char *filename = tilde_expand (matches[0]);
if ((stat (filename, &finfo) == 0) &&
((finfo.st_mode & S_IFMT) == S_IFDIR))
{
if (the_line[rl_point] != '/')
rl_insert_text ("/");
}
else
{
if (rl_point == rl_end)
rl_insert_text (temp_string);
}
free (filename);
}
else
{
if (rl_point == rl_end)
rl_insert_text (temp_string);
}
}
break;
case '*':
{
int i = 1;
rl_delete_text (start, rl_point);
rl_point = start;
rl_begin_undo_group ();
if (matches[1])
{
while (matches[i])
{
rl_insert_text (matches[i++]);
rl_insert_text (" ");
}
}
else
{
rl_insert_text (matches[0]);
rl_insert_text (" ");
}
rl_end_undo_group ();
}
break;
case '?':
{
int len, count, limit, max = 0;
int j, k, l;
/* Handle simple case first. What if there is only one answer? */
if (!matches[1])
{
char *rindex (), *temp;
if (rl_filename_completion_desired)
temp = rindex (matches[0], '/');
else
temp = (char *)NULL;
if (!temp)
temp = matches[0];
else
temp++;
crlf ();
fprintf (out_stream, "%s", temp);
crlf ();
goto restart;
}
/* There is more than one answer. Find out how many there are,
and find out what the maximum printed length of a single entry
is. */
for (i = 1; matches[i]; i++)
{
char *rindex (), *temp = (char *)NULL;
/* If we are hacking filenames, then only count the characters
after the last slash in the pathname. */
if (rl_filename_completion_desired)
temp = rindex (matches[i], '/');
else
temp = (char *)NULL;
if (!temp)
temp = matches[i];
else
temp++;
if (strlen (temp) > max)
max = strlen (temp);
}
len = i;
/* If there are many items, then ask the user if she
really wants to see them all. */
if (len >= rl_completion_query_items)
{
crlf ();
fprintf (out_stream,
"There are %d possibilities. Do you really", len);
crlf ();
fprintf (out_stream, "wish to see them all? (y or n)");
fflush (out_stream);
if (!get_y_or_n ())
{
crlf ();
goto restart;
}
}
/* How many items of MAX length can we fit in the screen window? */
max += 2;
limit = screenwidth / max;
if (limit != 1 && (limit * max == screenwidth))
limit--;
/* How many iterations of the printing loop? */
count = (len + (limit - 1)) / limit;
/* Watch out for special case. If LEN is less than LIMIT, then
just do the inner printing loop. */
if (len < limit) count = 1;
/* Sort the items if they are not already sorted. */
if (!rl_ignore_completion_duplicates)
{
int compare_strings ();
qsort (matches, len, sizeof (char *), compare_strings);
}
/* Print the sorted items, up-and-down alphabetically, like
ls might. */
crlf ();
for (i = 1; i < count + 1; i++)
{
for (j = 0, l = i; j < limit; j++)
{
if (l > len || !matches[l])
{
break;
}
else
{
char *rindex (), *temp = (char *)NULL;
if (rl_filename_completion_desired)
temp = rindex (matches[l], '/');
else
temp = (char *)NULL;
if (!temp)
temp = matches[l];
else
temp++;
fprintf (out_stream, "%s", temp);
for (k = 0; k < max - strlen (temp); k++)
putc (' ', out_stream);
}
l += count;
}
crlf ();
}
restart:
rl_on_new_line ();
}
break;
default:
abort ();
}
for (i = 0; matches[i]; i++)
free (matches[i]);
free (matches);
}
}
/* Stupid comparison routine for qsort () ing strings. */
static int
compare_strings (s1, s2)
char **s1, **s2;
{
return (strcmp (*s1, *s2));
}
/* A completion function for usernames.
TEXT contains a partial username preceded by a random
character (usually `~'). */
char *
username_completion_function (text, state)
int state;
char *text;
{
static char *username = (char *)NULL;
static struct passwd *entry;
static int namelen;
if (!state)
{
if (username)
free (username);
username = savestring (&text[1]);
namelen = strlen (username);
setpwent ();
}
while (entry = getpwent ())
{
if (strncmp (username, entry->pw_name, namelen) == 0)
break;
}
if (!entry)
{
endpwent ();
return ((char *)NULL);
}
else
{
char *value = (char *)xmalloc (2 + strlen (entry->pw_name));
*value = *text;
strcpy (value + 1, entry->pw_name);
rl_filename_completion_desired = 1;
return (value);
}
}
/* If non-null, this contains the address of a function to call if the
standard meaning for expanding a tilde fails. The function is called
with the text (sans tilde, as in "foo"), and returns a malloc()'ed string
which is the expansion, or a NULL pointer if there is no expansion. */
Function *rl_tilde_expander = (Function *)NULL;
/* Expand FILENAME if it begins with a tilde. This always returns
a new string. */
char *
tilde_expand (filename)
char *filename;
{
char *dirname = filename ? savestring (filename) : (char *)NULL;
if (dirname && *dirname == '~')
{
char *temp_name;
if (!dirname[1] || dirname[1] == '/')
{
/* Prepend $HOME to the rest of the string. */
char *temp_home = (char *)getenv ("HOME");
temp_name = (char *)alloca (1 + strlen (&dirname[1])
+ (temp_home? strlen (temp_home) : 0));
temp_name[0] = '\0';
if (temp_home)
strcpy (temp_name, temp_home);
strcat (temp_name, &dirname[1]);
free (dirname);
dirname = savestring (temp_name);
}
else
{
struct passwd *getpwnam (), *user_entry;
char *username = (char *)alloca (257);
int i, c;
for (i = 1; c = dirname[i]; i++)
{
if (c == '/') break;
else username[i - 1] = c;
}
username[i - 1] = '\0';
if (!(user_entry = getpwnam (username)))
{
/* If the calling program has a special syntax for
expanding tildes, and we couldn't find a standard
expansion, then let them try. */
if (rl_tilde_expander)
{
char *expansion;
expansion = (char *)(*rl_tilde_expander) (username);
if (expansion)
{
temp_name = (char *)alloca (1 + strlen (expansion)
+ strlen (&dirname[i]));
strcpy (temp_name, expansion);
strcat (temp_name, &dirname[i]);
free (expansion);
goto return_name;
}
}
/*
* We shouldn't report errors.
*/
}
else
{
temp_name = (char *)alloca (1 + strlen (user_entry->pw_dir)
+ strlen (&dirname[i]));
strcpy (temp_name, user_entry->pw_dir);
strcat (temp_name, &dirname[i]);
return_name:
free (dirname);
dirname = savestring (temp_name);
}
}
}
return (dirname);
}
/* **************************************************************** */
/* */
/* Undo, and Undoing */
/* */
/* **************************************************************** */
/* Non-zero tells rl_delete_text and rl_insert_text to not add to
the undo list. */
int doing_an_undo = 0;
/* The current undo list for THE_LINE. */
UNDO_LIST *rl_undo_list = (UNDO_LIST *)NULL;
/* Remember how to undo something. Concatenate some undos if that
seems right. */
rl_add_undo (what, start, end, text)
enum undo_code what;
int start, end;
char *text;
{
UNDO_LIST *temp = (UNDO_LIST *)xmalloc (sizeof (UNDO_LIST));
temp->what = what;
temp->start = start;
temp->end = end;
temp->text = text;
temp->next = rl_undo_list;
rl_undo_list = temp;
}
/* Free the existing undo list. */
free_undo_list ()
{
while (rl_undo_list) {
UNDO_LIST *release = rl_undo_list;
rl_undo_list = rl_undo_list->next;
if (release->what == UNDO_DELETE)
free (release->text);
free (release);
}
}
/* Undo the next thing in the list. Return 0 if there
is nothing to undo, or non-zero if there was. */
int
rl_do_undo ()
{
UNDO_LIST *release;
int waiting_for_begin = 0;
undo_thing:
if (!rl_undo_list)
return (0);
doing_an_undo = 1;
switch (rl_undo_list->what) {
/* Undoing deletes means inserting some text. */
case UNDO_DELETE:
rl_point = rl_undo_list->start;
rl_insert_text (rl_undo_list->text);
free (rl_undo_list->text);
break;
/* Undoing inserts means deleting some text. */
case UNDO_INSERT:
rl_delete_text (rl_undo_list->start, rl_undo_list->end);
rl_point = rl_undo_list->start;
break;
/* Undoing an END means undoing everything 'til we get to
a BEGIN. */
case UNDO_END:
waiting_for_begin++;
break;
/* Undoing a BEGIN means that we are done with this group. */
case UNDO_BEGIN:
if (waiting_for_begin)
waiting_for_begin--;
else
abort ();
break;
}
doing_an_undo = 0;
release = rl_undo_list;
rl_undo_list = rl_undo_list->next;
free (release);
if (waiting_for_begin)
goto undo_thing;
return (1);
}
/* Begin a group. Subsequent undos are undone as an atomic operation. */
rl_begin_undo_group ()
{
rl_add_undo (UNDO_BEGIN, 0, 0, 0);
}
/* End an undo group started with rl_begin_undo_group (). */
rl_end_undo_group ()
{
rl_add_undo (UNDO_END, 0, 0, 0);
}
/* Save an undo entry for the text from START to END. */
rl_modifying (start, end)
int start, end;
{
if (start > end)
{
int t = start;
start = end;
end = t;
}
if (start != end)
{
char *temp = rl_copy (start, end);
rl_begin_undo_group ();
rl_add_undo (UNDO_DELETE, start, end, temp);
rl_add_undo (UNDO_INSERT, start, end, (char *)NULL);
rl_end_undo_group ();
}
}
/* Revert the current line to its previous state. */
rl_revert_line ()
{
if (!rl_undo_list) ding ();
else {
while (rl_undo_list)
rl_do_undo ();
}
}
/* Do some undoing of things that were done. */
rl_undo_command (count)
{
if (count < 0) return; /* Nothing to do. */
while (count)
{
if (rl_do_undo ())
{
count--;
}
else
{
ding ();
break;
}
}
}
/* **************************************************************** */
/* */
/* History Utilities */
/* */
/* **************************************************************** */
/* We already have a history library, and that is what we use to control
the history features of readline. However, this is our local interface
to the history mechanism. */
/* While we are editing the history, this is the saved
version of the original line. */
HIST_ENTRY *saved_line_for_history = (HIST_ENTRY *)NULL;
/* Set the history pointer back to the last entry in the history. */
start_using_history ()
{
using_history ();
if (saved_line_for_history)
free_history_entry (saved_line_for_history);
saved_line_for_history = (HIST_ENTRY *)NULL;
}
/* Free the contents (and containing structure) of a HIST_ENTRY. */
free_history_entry (entry)
HIST_ENTRY *entry;
{
if (!entry) return;
if (entry->line)
free (entry->line);
free (entry);
}
/* Perhaps put back the current line if it has changed. */
maybe_replace_line ()
{
HIST_ENTRY *temp = current_history ();
/* If the current line has changed, save the changes. */
if (temp && ((UNDO_LIST *)(temp->data) != rl_undo_list)) {
temp = replace_history_entry (where_history (), the_line, rl_undo_list);
free (temp->line);
free (temp);
}
}
/* Put back the saved_line_for_history if there is one. */
maybe_unsave_line ()
{
if (saved_line_for_history) {
strcpy (the_line, saved_line_for_history->line);
rl_undo_list = (UNDO_LIST *)saved_line_for_history->data;
free_history_entry (saved_line_for_history);
saved_line_for_history = (HIST_ENTRY *)NULL;
rl_end = rl_point = strlen (the_line);
} else {
ding ();
}
}
/* Save the current line in saved_line_for_history. */
maybe_save_line ()
{
if (!saved_line_for_history) {
saved_line_for_history = (HIST_ENTRY *)xmalloc (sizeof (HIST_ENTRY));
saved_line_for_history->line = savestring (the_line);
saved_line_for_history->data = (char *)rl_undo_list;
}
}
/* **************************************************************** */
/* */
/* History Commands */
/* */
/* **************************************************************** */
/* Meta-< goes to the start of the history. */
rl_beginning_of_history ()
{
rl_get_previous_history (1 + where_history ());
}
/* Meta-> goes to the end of the history. (The current line). */
rl_end_of_history ()
{
maybe_replace_line ();
using_history ();
maybe_unsave_line ();
}
/* Move down to the next history line. */
rl_get_next_history (count)
int count;
{
HIST_ENTRY *temp = (HIST_ENTRY *)NULL;
if (count < 0)
{
rl_get_previous_history (-count);
return;
}
if (!count)
return;
maybe_replace_line ();
while (count)
{
temp = next_history ();
if (!temp)
break;
--count;
}
if (!temp)
maybe_unsave_line ();
else
{
strcpy (the_line, temp->line);
rl_undo_list = (UNDO_LIST *)temp->data;
rl_end = rl_point = strlen (the_line);
}
}
/* Get the previous item out of our interactive history, making it the current
line. If there is no previous history, just ding. */
rl_get_previous_history (count)
int count;
{
HIST_ENTRY *old_temp = (HIST_ENTRY *)NULL;
HIST_ENTRY *temp = (HIST_ENTRY *)NULL;
if (count < 0)
{
rl_get_next_history (-count);
return;
}
if (!count)
return;
/* If we don't have a line saved, then save this one. */
maybe_save_line ();
/* If the current line has changed, save the changes. */
maybe_replace_line ();
while (count)
{
temp = previous_history ();
if (!temp)
break;
else
old_temp = temp;
--count;
}
/* If there was a large argument, and we moved back to the start of the
history, that is not an error. So use the last value found. */
if (!temp && old_temp)
temp = old_temp;
if (!temp)
ding ();
else
{
strcpy (the_line, temp->line);
rl_undo_list = (UNDO_LIST *)temp->data;
rl_end = rl_point = strlen (the_line);
#ifdef VI_MODE
if (rl_editing_mode == vi_mode)
rl_point = 0;
#endif /* VI_MODE */
}
}
/* There is a command in ksh which yanks into this line, the last word
of the previous line. Here it is. We left it on M-. */
rl_yank_previous_last_arg (ignore)
int ignore;
{
}
/* **************************************************************** */
/* */
/* I-Search and Searching */
/* */
/* **************************************************************** */
/* Search backwards through the history looking for a string which is typed
interactively. Start with the current line. */
rl_reverse_search_history (sign, key)
int sign;
int key;
{
rl_search_history (-sign, key);
}
/* Search forwards through the history looking for a string which is typed
interactively. Start with the current line. */
rl_forward_search_history (sign, key)
int sign;
int key;
{
rl_search_history (sign, key);
}
/* Display the current state of the search in the echo-area.
SEARCH_STRING contains the string that is being searched for,
DIRECTION is zero for forward, or 1 for reverse,
WHERE is the history list number of the current line. If it is
-1, then this line is the starting one. */
rl_display_search (search_string, reverse_p, where)
char *search_string;
int reverse_p, where;
{
char *message = (char *)NULL;
message =
(char *)alloca (1 + (search_string ? strlen (search_string) : 0) + 30);
*message = '\0';
#ifdef NEVER
if (where != -1)
sprintf (message, "[%d]", where + history_base);
#endif
strcat (message, "(");
if (reverse_p)
strcat (message, "reverse-");
strcat (message, "i-search)`");
if (search_string)
strcat (message, search_string);
strcat (message, "': ");
rl_message (message, 0, 0);
rl_redisplay ();
}
/* Search through the history looking for an interactively typed string.
This is analogous to i-search. We start the search in the current line.
DIRECTION is which direction to search; > 0 means forward, < 0 means
backwards. */
rl_search_history (direction, invoking_key)
int direction;
int invoking_key;
{
/* The string that the user types in to search for. */
char *search_string = (char *)alloca (128);
/* The current length of SEARCH_STRING. */
int search_string_index;
/* The list of lines to search through. */
char **lines;
/* The length of LINES. */
int hlen;
/* Where we get LINES from. */
HIST_ENTRY **hlist = history_list ();
int orig_point = rl_point;
int orig_line = where_history ();
int last_found_line = orig_line;
int c, done = 0;
register int i = 0;
/* The line currently being searched. */
char *sline;
/* Offset in that line. */
int index;
/* Non-zero if we are doing a reverse search. */
int reverse = (direction < 0);
/* Create an arrary of pointers to the lines that we want to search. */
maybe_replace_line ();
if (hlist)
for (i = 0; hlist[i]; i++);
/* Allocate space for this many lines, +1 for the current input line,
and remember those lines. */
lines = (char **)alloca ((1 + (hlen = i)) * sizeof (char *));
for (i = 0; i < hlen; i++)
lines[i] = hlist[i]->line;
if (saved_line_for_history)
lines[i] = saved_line_for_history->line;
else
{
/* So I have to type it in this way instead. */
lines[i] = (char *)alloca (1 + strlen (the_line));
strcpy (lines[i], &the_line[0]);
}
hlen++;
/* The line where we start the search. */
i = orig_line;
/* Initialize search parameters. */
*search_string = '\0';
search_string_index = 0;
rl_display_search (search_string, reverse, -1);
sline = the_line;
index = rl_point;
while (!done)
{
c = rl_read_key (in_stream);
/* Hack C to Do What I Mean. */
{
Function *f = (Function *)NULL;
if (keymap[c].type == ISFUNC)
f = keymap[c].function;
if (f == rl_reverse_search_history)
c = reverse ? -1 : -2;
else if (f == rl_forward_search_history)
c = !reverse ? -1 : -2;
}
switch (c)
{
case ESC:
done = 1;
continue;
/* case invoking_key: */
case -1:
goto search_again;
/* switch directions */
case -2:
direction = -direction;
reverse = (direction < 0);
goto do_search;
case CTRL ('G'):
strcpy (the_line, lines[orig_line]);
rl_point = orig_point;
rl_end = strlen (the_line);
rl_clear_message ();
return;
default:
if (c < 32 || c > 126)
{
rl_execute_next (c);
done = 1;
continue;
}
else
{
search_string[search_string_index++] = c;
search_string[search_string_index] = '\0';
goto do_search;
search_again:
if (!search_string_index)
continue;
else
{
if (reverse)
--index;
else
if (index != strlen (sline))
++index;
else
ding ();
}
do_search:
while (1)
{
if (reverse)
{
while (index >= 0)
if (strncmp
(search_string,
sline + index,
search_string_index) == 0)
goto string_found;
else
index--;
}
else
{
register int limit =
(strlen (sline) - search_string_index) + 1;
while (index < limit)
{
if (strncmp (search_string,
sline + index,
search_string_index) == 0)
goto string_found;
index++;
}
}
next_line:
i += direction;
/* At limit for direction? */
if ((reverse && i < 0) ||
(!reverse && i == hlen))
goto search_failed;
sline = lines[i];
if (reverse)
index = strlen (sline);
else
index = 0;
/* If the search string is longer than the current
line, no match. */
if (search_string_index > strlen (sline))
goto next_line;
/* Start actually searching. */
if (reverse)
index -= search_string_index;
}
search_failed:
/* We cannot find the search string. Ding the bell. */
ding ();
i = last_found_line;
break;
string_found:
/* We have found the search string. Just display it. But don't
actually move there in the history list until the user accepts
the location. */
strcpy (the_line, lines[i]);
rl_point = index;
rl_end = strlen (the_line);
last_found_line = i;
rl_display_search (search_string, reverse,
(i == orig_line) ? -1 : i);
}
}
continue;
}
/* The user has won. They found the string that they wanted. Now all
we have to do is place them there. */
{
int now = last_found_line;
/* First put back the original state. */
strcpy (the_line, lines[orig_line]);
if (now < orig_line)
rl_get_previous_history (orig_line - now);
else
rl_get_next_history (now - orig_line);
rl_point = index;
rl_clear_message ();
}
}
/* Make C be the next command to be executed. */
rl_execute_next (c)
int c;
{
rl_pending_input = c;
}
/* **************************************************************** */
/* */
/* Killing Mechanism */
/* */
/* **************************************************************** */
/* What we assume for a max number of kills. */
#define DEFAULT_MAX_KILLS 10
/* The real variable to look at to find out when to flush kills. */
int rl_max_kills = DEFAULT_MAX_KILLS;
/* Where to store killed text. */
char **rl_kill_ring = (char **)NULL;
/* Where we are in the kill ring. */
int rl_kill_index = 0;
/* How many slots we have in the kill ring. */
int rl_kill_ring_length = 0;
/* How to say that you only want to save a certain amount
of kill material. */
rl_set_retained_kills (num)
int num;
{}
/* The way to kill something. This appends or prepends to the last
kill, if the last command was a kill command. if FROM is less
than TO, then the text is appended, otherwise prepended. If the
last command was not a kill command, then a new slot is made for
this kill. */
rl_kill_text (from, to)
int from, to;
{
int slot;
char *text = rl_copy (from, to);
/* Is there anything to kill? */
if (from == to) {
free (text);
last_command_was_kill++;
return;
}
/* Delete the copied text from the line. */
rl_delete_text (from, to);
/* First, find the slot to work with. */
if (!last_command_was_kill) {
/* Get a new slot. */
if (!rl_kill_ring) {
/* If we don't have any defined, then make one. */
rl_kill_ring =
(char **)xmalloc (((rl_kill_ring_length = 1) + 1) * sizeof (char *));
slot = 1;
} else {
/* We have to add a new slot on the end, unless we have exceeded
the max limit for remembering kills. */
slot = rl_kill_ring_length;
if (slot == rl_max_kills) {
register int i;
free (rl_kill_ring[0]);
for (i = 0; i < slot; i++)
rl_kill_ring[i] = rl_kill_ring[i + 1];
} else {
rl_kill_ring =
(char **)xrealloc (rl_kill_ring,
((slot = (rl_kill_ring_length += 1)) + 1)
* sizeof (char *));
}
}
slot--;
} else {
slot = rl_kill_ring_length - 1;
}
/* If the last command was a kill, prepend or append. */
if (last_command_was_kill) {
char *old = rl_kill_ring[slot];
char *new = (char *)xmalloc (1 + strlen (old) + strlen (text));
if (from < to) {
strcpy (new, old);
strcat (new, text);
} else {
strcpy (new, text);
strcat (new, old);
}
free (old);
free (text);
rl_kill_ring[slot] = new;
} else {
rl_kill_ring[slot] = text;
}
rl_kill_index = slot;
last_command_was_kill++;
}
/* Now REMEMBER! In order to do prepending or appending correctly, kill
commands always make rl_point's original position be the FROM argument,
and rl_point's extent be the TO argument. */
/* **************************************************************** */
/* */
/* Killing Commands */
/* */
/* **************************************************************** */
/* Delete the word at point, saving the text in the kill ring. */
rl_kill_word (count)
int count;
{
int orig_point = rl_point;
if (count < 0)
rl_backward_kill_word (-count);
else
{
rl_forward_word (count);
if (rl_point != orig_point)
rl_kill_text (orig_point, rl_point);
rl_point = orig_point;
}
}
/* Rubout the word before point, placing it on the kill ring. */
rl_backward_kill_word (count)
int count;
{
int orig_point = rl_point;
if (count < 0)
rl_kill_word (-count);
else
{
rl_backward_word (count);
if (rl_point != orig_point)
rl_kill_text (orig_point, rl_point);
}
}
/* Kill from here to the end of the line. If DIRECTION is negative, kill
back to the line start instead. */
rl_kill_line (direction)
int direction;
{
int orig_point = rl_point;
if (direction < 0)
rl_backward_kill_line (1);
else
{
rl_end_of_line ();
if (orig_point != rl_point)
rl_kill_text (orig_point, rl_point);
rl_point = orig_point;
}
}
/* Kill backwards to the start of the line. If DIRECTION is negative, kill
forwards to the line end instead. */
rl_backward_kill_line (direction)
int direction;
{
int orig_point = rl_point;
if (direction < 0)
rl_kill_line (1);
else
{
if (!rl_point)
ding ();
else
{
rl_beg_of_line ();
rl_kill_text (orig_point, rl_point);
}
}
}
/* Yank back the last killed text. This ignores arguments. */
rl_yank ()
{
if (!rl_kill_ring) rl_abort ();
rl_insert_text (rl_kill_ring[rl_kill_index]);
}
/* If the last command was yank, or yank_pop, and the text just
before point is identical to the current kill item, then
delete that text from the line, rotate the index down, and
yank back some other text. */
rl_yank_pop ()
{
int l;
if (((rl_last_func != rl_yank_pop) && (rl_last_func != rl_yank)) ||
!rl_kill_ring)
{
rl_abort ();
}
l = strlen (rl_kill_ring[rl_kill_index]);
if (((rl_point - l) >= 0) &&
(strncmp (the_line + (rl_point - l),
rl_kill_ring[rl_kill_index], l) == 0))
{
rl_delete_text ((rl_point - l), rl_point);
rl_point -= l;
rl_kill_index--;
if (rl_kill_index < 0)
rl_kill_index = rl_kill_ring_length - 1;
rl_yank ();
}
else
rl_abort ();
}
/* Yank the COUNTth argument from the previous history line. */
rl_yank_nth_arg (count, ignore)
int count;
{
register HIST_ENTRY *entry = previous_history ();
char *arg;
if (entry)
next_history ();
else
{
ding ();
return;
}
arg = history_arg_extract (count, count, entry->line);
if (!arg || !*arg)
{
ding ();
return;
}
rl_begin_undo_group ();
if (rl_point && the_line[rl_point - 1] != ' ')
rl_insert_text (" ");
rl_insert_text (arg);
free (arg);
rl_end_undo_group ();
}
/* Vi Mode. */
#ifdef VI_MODE
#include "vi_mode.c"
#endif /* VI_MODE */
/* How to toggle back and forth between editing modes. */
rl_vi_editing_mode ()
{
#ifdef VI_MODE
rl_editing_mode = vi_mode;
rl_vi_insertion_mode ();
#endif /* VI_MODE */
}
rl_emacs_editing_mode ()
{
rl_editing_mode = emacs_mode;
keymap = emacs_standard_keymap;
}
/* **************************************************************** */
/* */
/* Completion */
/* */
/* **************************************************************** */
/* Non-zero means that case is not significant in completion. */
int completion_case_fold = 0;
/* Return an array of (char *) which is a list of completions for TEXT.
If there are no completions, return a NULL pointer.
The first entry in the returned array is the substitution for TEXT.
The remaining entries are the possible completions.
The array is terminated with a NULL pointer.
ENTRY_FUNCTION is a function of two args, and returns a (char *).
The first argument is TEXT.
The second is a state argument; it should be zero on the first call, and
non-zero on subsequent calls. It returns a NULL pointer to the caller
when there are no more matches.
*/
char **
completion_matches (text, entry_function)
char *text;
char *(*entry_function) ();
{
/* Number of slots in match_list. */
int match_list_size;
/* The list of matches. */
char **match_list =
(char **)xmalloc (((match_list_size = 10) + 1) * sizeof (char *));
/* Number of matches actually found. */
int matches = 0;
/* Temporary string binder. */
char *string;
match_list[1] = (char *)NULL;
while (string = (*entry_function) (text, matches))
{
if (matches + 1 == match_list_size)
match_list =
(char **)xrealloc (match_list,
((match_list_size += 10) + 1) * sizeof (char *));
match_list[++matches] = string;
match_list[matches + 1] = (char *)NULL;
}
/* If there were any matches, then look through them finding out the
lowest common denominator. That then becomes match_list[0]. */
if (matches)
{
register int i = 1;
int low = 100000; /* Count of max-matched characters. */
/* If only one match, just use that. */
if (matches == 1)
{
match_list[0] = match_list[1];
match_list[1] = (char *)NULL;
}
else
{
/* Otherwise, compare each member of the list with
the next, finding out where they stop matching. */
while (i < matches)
{
register int c1, c2, si;
if (completion_case_fold)
{
for (si = 0;
(c1 = to_lower(match_list[i][si])) &&
(c2 = to_lower(match_list[i + 1][si]));
si++)
if (c1 != c2) break;
}
else
{
for (si = 0;
(c1 = match_list[i][si]) &&
(c2 = match_list[i + 1][si]);
si++)
if (c1 != c2) break;
}
if (low > si) low = si;
i++;
}
match_list[0] = (char *)xmalloc (low + 1);
strncpy (match_list[0], match_list[1], low);
match_list[0][low] = '\0';
}
}
else /* There were no matches. */
{
free (match_list);
match_list = (char **)NULL;
}
return (match_list);
}
/* Okay, now we write the entry_function for filename completion. In the
general case. Note that completion in the shell is a little different
because of all the pathnames that must be followed when looking up the
completion for a command. */
char *
filename_completion_function (text, state)
int state;
char *text;
{
static DIR *directory;
static char *filename = (char *)NULL;
static char *dirname = (char *)NULL;
static char *users_dirname = (char *)NULL;
static int filename_len;
struct direct *entry = (struct direct *)NULL;
/* If we don't have any state, then do some initialization. */
if (!state)
{
char *rindex (), *temp;
if (dirname) free (dirname);
if (filename) free (filename);
if (users_dirname) free (users_dirname);
filename = savestring (text);
if (!*text) text = ".";
dirname = savestring (text);
temp = rindex (dirname, '/');
if (temp)
{
strcpy (filename, ++temp);
*temp = '\0';
}
else
strcpy (dirname, ".");
/* We aren't done yet. We also support the "~user" syntax. */
/* Save the version of the directory that the user typed. */
users_dirname = savestring (dirname);
{
char *tilde_expand (), *temp_dirname = tilde_expand (dirname);
free (dirname);
dirname = temp_dirname;
#ifdef SHELL
{
extern int follow_symbolic_links;
char *make_absolute ();
if (follow_symbolic_links && (strcmp (dirname, ".") != 0))
{
temp_dirname = make_absolute (dirname, get_working_directory (""));
if (temp_dirname)
{
free (dirname);
dirname = temp_dirname;
}
}
}
#endif /* SHELL */
}
directory = opendir (dirname);
filename_len = strlen (filename);
rl_filename_completion_desired = 1;
}
/* At this point we should entertain the possibility of hacking wildcarded
filenames, like /usr/man*\/te<TAB>. If the directory name contains
globbing characters, then build an array of directories to glob on, and
glob on the first one. */
/* Now that we have some state, we can read the directory. */
while (directory && (entry = readdir (directory)))
{
/* Special case for no filename.
All entries except "." and ".." match. */
if (!filename_len)
{
if ((strcmp (entry->d_name, ".") != 0) &&
(strcmp (entry->d_name, "..") != 0))
break;
}
else
{
/* Otherwise, if these match upto the length of filename, then
it is a match. */
#ifdef TMB_SYSV
if ((strlen (entry->d_name) >= filename_len) &&
(strncmp (filename, entry->d_name, filename_len) == 0))
#else
if ((entry->d_namlen >= filename_len) &&
(strncmp (filename, entry->d_name, filename_len) == 0))
#endif /* TMB_SYSV */
{
break;
}
}
}
if (!entry)
{
if (directory)
{
closedir (directory);
directory = (DIR *)NULL;
}
return (char *)NULL;
}
else
{
char *temp;
if (dirname && (strcmp (dirname, ".") != 0))
{
#ifdef TMB_SYSV
temp = (char *)xmalloc (1 + strlen (users_dirname)
+ strlen (entry->d_name));
#else
temp = (char *)xmalloc (1 + strlen (users_dirname)
+ entry->d_namlen);
#endif /* TMB_SYSV */
strcpy (temp, users_dirname);
strcat (temp, entry->d_name);
}
else
{
temp = (savestring (entry->d_name));
}
return (temp);
}
}
/* **************************************************************** */
/* */
/* Binding keys */
/* */
/* **************************************************************** */
/* rl_add_defun (char *name, Function *function, int key)
Add NAME to the list of named functions. Make FUNCTION
be the function that gets called.
If KEY is not -1, then bind it. */
rl_add_defun (name, function, key)
char *name;
Function *function;
int key;
{
if (key != -1)
rl_bind_key (key, function);
rl_add_funmap_entry (name, function);
}
/* Bind KEY to FUNCTION. Returns non-zero if KEY is out of range. */
int
rl_bind_key (key, function)
int key;
Function *function;
{
if (key < 0)
return (key);
if (key > 127 && key < 256)
{
if (keymap[ESC].type == ISKMAP)
{
Keymap escmap = (Keymap)keymap[ESC].function;
key -= 128;
escmap[key].type = ISFUNC;
escmap[key].function = function;
return (0);
}
return (key);
}
keymap[key].type = ISFUNC;
keymap[key].function = function;
return (0);
}
/* Bind KEY to FUNCTION in MAP. Returns non-zero in case of invalid
KEY. */
int
rl_bind_key_in_map (key, function, map)
int key;
Function *function;
Keymap map;
{
int result;
Keymap oldmap = keymap;
keymap = map;
result = rl_bind_key (key, function);
keymap = oldmap;
return (result);
}
/* Make KEY do nothing in the currently selected keymap.
Returns non-zero in case of error. */
int
rl_unbind_key (key)
int key;
{
return (rl_bind_key (key, (Function *)NULL));
}
/* Make KEY do nothing in MAP.
Returns non-zero in case of error. */
int
rl_unbind_key_in_map (key, map)
int key;
Keymap map;
{
return (rl_bind_key_in_map (key, (Function *)NULL, map));
}
/* Bind the key sequence represented by the string KEYSEQ to
FUNCTION. This makes new keymaps as necessary. The initial
place to do bindings is in MAP. */
rl_set_key (keyseq, function, map)
char *keyseq;
Function *function;
Keymap map;
{
rl_generic_bind (ISFUNC, keyseq, function, map);
}
/* Bind the key sequence represented by the string KEYSEQ to
the string of characters MACRO. This makes new keymaps as
necessary. The initial place to do bindings is in MAP. */
rl_macro_bind (keyseq, macro, map)
char *keyseq, *macro;
Keymap map;
{
char *macro_keys = (char *)xmalloc (2 * (strlen (macro)));
int macro_keys_len;
if (rl_translate_keyseq (macro, macro_keys, ¯o_keys_len))
{
free (macro_keys);
return;
}
rl_generic_bind (ISMACR, keyseq, macro_keys, map);
}
/* Bind the key sequence represented by the string KEYSEQ to
the arbitrary pointer DATA. TYPE says what kind of data is
pointed to by DATA, right now this can be a function (ISFUNC),
a macro (ISMACR), or a keymap (ISKMAP). This makes new keymaps
as necessary. The initial place to do bindings is in MAP. */
rl_generic_bind (type, keyseq, data, map)
int type;
char *keyseq, *data;
Keymap map;
{
char *keys;
int keys_len;
register int i;
/* If no keys to bind to, exit right away. */
if (!keyseq || !*keyseq)
{
if (type == ISMACR)
free (data);
return;
}
keys = (char *)alloca (1 + (2 * strlen (keyseq)));
/* Translate the ASCII representation of KEYSEQ into an array
of characters. Stuff the characters into ARRAY, and the
length of ARRAY into LENGTH. */
if (rl_translate_keyseq (keyseq, keys, &keys_len))
return;
/* Bind keys, making new keymaps as necessary. */
for (i = 0; i < keys_len; i++)
{
if (i + 1 < keys_len)
{
if (map[keys[i]].type != ISKMAP)
{
if (map[i].type == ISMACR)
free ((char *)map[i].function);
map[keys[i]].type = ISKMAP;
map[keys[i]].function = (Function *)rl_make_bare_keymap ();
}
map = (Keymap)map[keys[i]].function;
}
else
{
if (map[keys[i]].type == ISMACR)
free ((char *)map[keys[i]].function);
map[keys[i]].function = (Function *)data;
map[keys[i]].type = type;
}
}
}
/* Translate the ASCII representation of SEQ, stuffing the
values into ARRAY, an array of characters. LEN gets the
final length of ARRAY. Return non-zero if there was an
error parsing SEQ. */
rl_translate_keyseq (seq, array, len)
char *seq, *array;
int *len;
{
register int i, c, l = 0;
for (i = 0; c = seq[i]; i++)
{
if (c == '\\')
{
c = seq[++i];
if (!c)
break;
if (((c == 'C' || c == 'M') && seq[i + 1] == '-') ||
(c == 'e'))
{
/* Handle special case of backwards define. */
if (strncmp (&seq[i], "C-\\M-", 5) == 0)
{
array[l++] = ESC;
i += 5;
array[l++] = CTRL (to_upper (seq[i]));
if (!seq[i])
i--;
continue;
}
switch (c)
{
case 'M':
i++;
array[l++] = ESC;
break;
case 'C':
i += 2;
array[l++] = CTRL (to_upper (seq[i]));
break;
case 'e':
array[l++] = ESC;
}
continue;
}
}
array[l++] = c;
}
array[l] = '\0';
*len = l;
return (0);
}
/* Return a pointer to the function that STRING represents.
If STRING doesn't have a matching function, then a NULL pointer
is returned. */
Function *
rl_named_function (string)
char *string;
{
register int i;
for (i = 0; funmap[i]; i++)
if (stricmp (funmap[i]->name, string) == 0)
return (funmap[i]->function);
return ((Function *)NULL);
}
/* The last key bindings file read. */
static char *last_readline_init_file = "~/.inputrc";
/* Re-read the current keybindings file. */
rl_re_read_init_file (count, ignore)
int count, ignore;
{
rl_read_init_file (last_readline_init_file);
}
/* Do key bindings from a file. If FILENAME is NULL it defaults
to `~/.inputrc'. If the file existed and could be opened and
read, 0 is returned, otherwise errno is returned. */
int
rl_read_init_file (filename)
char *filename;
{
extern int errno;
int line_size, line_index;
char *line = (char *)xmalloc (line_size = 100);
char *openname;
FILE *file;
int c;
/* Default the filename. */
if (!filename)
filename = "~/.inputrc";
openname = tilde_expand (filename);
/* Open the file. */
file = fopen (openname, "r");
free (openname);
if (!file)
return (errno);
last_readline_init_file = filename;
/* Loop reading lines from the file. Lines that start with `#' are
comments, all other lines are commands for readline initialization. */
while ((c = rl_getc (file)) != EOF)
{
/* If comment, flush to EOL. */
if (c == '#')
{
while ((c = rl_getc (file)) != EOF && c != '\n');
if (c == EOF)
goto function_exit;
continue;
}
/* Otherwise, this is the start of a line. Read the
line from the file. */
line_index = 0;
while (c != EOF && c != '\n')
{
line[line_index++] = c;
if (line_index == line_size)
line = (char *)xrealloc (line, line_size += 100);
c = rl_getc (file);
}
line[line_index] = '\0';
/* Parse the line. */
rl_parse_and_bind (line);
}
function_exit:
free (line);
/* Close up the file and exit. */
fclose (file);
return (0);
}
/* **************************************************************** */
/* */
/* Parser Directives */
/* */
/* **************************************************************** */
/* Conditionals. */
/* Calling programs set this to have their argv[0]. */
char *rl_readline_name = "other";
/* Non-zero means do not parse any lines other than comments and
parser directives. */
static unsigned char parsing_conditionalized_out = 0;
/* Stack of previous values of parsing_conditionalized_out. */
static unsigned char *if_stack = (unsigned char *)NULL;
static int if_stack_depth = 0;
static int if_stack_size = 0;
/* Push parsing_conditionalized_out, and set parser state based on ARGS. */
parser_if (args)
char *args;
{
register int i;
/* Push parser state. */
if (if_stack_depth + 1 >= if_stack_size)
{
if (!if_stack)
if_stack = (unsigned char *)xmalloc (if_stack_size = 20);
else
if_stack = (unsigned char *)xrealloc (if_stack, if_stack_size += 20);
}
if_stack[if_stack_depth++] = parsing_conditionalized_out;
/* We only check to see if the first word in ARGS is the same as the
value stored in rl_readline_name. */
/* Isolate first argument. */
for (i = 0; args[i] && !whitespace (args[i]); i++);
if (args[i])
args[i++] = '\0';
if (stricmp (args, rl_readline_name) == 0)
parsing_conditionalized_out = 0;
else
parsing_conditionalized_out = 1;
}
/* Invert the current parser state if there is anything on the stack. */
parser_else (args)
char *args;
{
if (if_stack_depth)
parsing_conditionalized_out = !parsing_conditionalized_out;
else
{
/* *** What, no error message? *** */
}
}
/* Terminate a conditional, popping the value of
parsing_conditionalized_out from the stack. */
parser_endif (args)
char *args;
{
if (if_stack_depth)
parsing_conditionalized_out = if_stack[--if_stack_depth];
else
{
/* *** What, no error message? *** */
}
}
/* Associate textual names with actual functions. */
static struct {
char *name;
Function *function;
} parser_directives [] = {
{ "if", parser_if },
{ "endif", parser_endif },
{ "else", parser_else },
{ (char *)0x0, (Function *)0x0 }
};
/* Handle a parser directive. STATEMENT is the line of the directive
without any leading `$'. */
static int
handle_parser_directive (statement)
char *statement;
{
register int i;
char *directive, *args;
/* Isolate the actual directive. */
/* Skip whitespace. */
for (i = 0; whitespace (statement[i]); i++);
directive = &statement[i];
for (; statement[i] && !whitespace (statement[i]); i++);
if (statement[i])
statement[i++] = '\0';
for (; statement[i] && whitespace (statement[i]); i++);
args = &statement[i];
/* Lookup the command, and act on it. */
for (i = 0; parser_directives[i].name; i++)
if (stricmp (directive, parser_directives[i].name) == 0)
{
(*parser_directives[i].function) (args);
return (0);
}
/* *** Should an error message be output? */
return (1);
}
/* Read the binding command from STRING and perform it.
A key binding command looks like: Keyname: function-name\0,
a variable binding command looks like: set variable value.
A new-style keybinding looks like "\C-x\C-x": exchange-point-and-mark. */
rl_parse_and_bind (string)
char *string;
{
extern char *possible_control_prefixes[], *possible_meta_prefixes[];
char *rindex (), *funname, *kname;
static int substring_member_of_array ();
register int c;
int key, i;
if (!string || !*string || *string == '#')
return;
/* If this is a parser directive, act on it. */
if (*string == '$')
{
handle_parser_directive (&string[1]);
return;
}
/* If we are supposed to be skipping parsing right now, then do it. */
if (parsing_conditionalized_out)
return;
i = 0;
/* If this keyname is a complex key expression surrounded by quotes,
advance to after the matching close quote. */
if (*string == '"')
{
for (i = 1; c = string[i]; i++)
{
if (c == '"' && string[i - 1] != '\\')
break;
}
}
/* Advance to the colon (:) or whitespace which separates the two objects. */
for (; (c = string[i]) && c != ':' && c != ' ' && c != '\t'; i++ );
/* Mark the end of the command (or keyname). */
if (string[i])
string[i++] = '\0';
/* If this is a command to set a variable, then do that. */
if (stricmp (string, "set") == 0)
{
char *var = string + i;
char *value;
/* Make VAR point to start of variable name. */
while (*var && whitespace (*var)) var++;
/* Make value point to start of value string. */
value = var;
while (*value && !whitespace (*value)) value++;
if (*value)
*value++ = '\0';
while (*value && whitespace (*value)) value++;
rl_variable_bind (var, value);
return;
}
/* Skip any whitespace between keyname and funname. */
for (; string[i] && whitespace (string[i]); i++);
funname = &string[i];
/* Now isolate funname.
For straight function names just look for whitespace, since
that will signify the end of the string. But this could be a
macro definition. In that case, the string is quoted, so skip
to the matching delimiter. */
if (*funname == '\'' || *funname == '"')
{
int delimiter = string[i++];
for (; c = string[i]; i++)
{
if (c == delimiter && string[i - 1] != '\\')
break;
}
if (c)
i++;
}
/* Advance to the end of the string. */
for (; string[i] && !whitespace (string[i]); i++);
/* No extra whitespace at the end of the string. */
string[i] = '\0';
/* If this is a new-style key-binding, then do the binding with
rl_set_key (). Otherwise, let the older code deal with it. */
if (*string == '"')
{
char *seq = (char *)alloca (1 + strlen (string));
register int j, k = 0;
for (j = 1; string[j]; j++)
{
if (string[j] == '"' && string[j - 1] != '\\')
break;
seq[k++] = string[j];
}
seq[k] = '\0';
/* Binding macro? */
if (*funname == '\'' || *funname == '"')
{
j = strlen (funname);
if (j && funname[j - 1] == *funname)
funname[j - 1] = '\0';
rl_macro_bind (seq, &funname[1], keymap);
}
else
rl_set_key (seq, rl_named_function (funname), keymap);
return;
}
/* Get the actual character we want to deal with. */
kname = rindex (string, '-');
if (!kname)
kname = string;
else
kname++;
key = glean_key_from_name (kname);
/* Add in control and meta bits. */
if (substring_member_of_array (string, possible_control_prefixes))
key = CTRL (to_upper (key));
if (substring_member_of_array (string, possible_meta_prefixes))
key = META (key);
/* Temporary. Handle old-style keyname with macro-binding. */
if (*funname == '\'' || *funname == '"')
{
char seq[2];
int fl = strlen (funname);
seq[0] = key; seq[1] = '\0';
if (fl && funname[fl - 1] == *funname)
funname[fl - 1] = '\0';
rl_macro_bind (seq, &funname[1], keymap);
}
else
rl_bind_key (key, rl_named_function (funname));
}
rl_variable_bind (name, value)
char *name, *value;
{
static int strnicmp ();
if (stricmp (name, "editing-mode") == 0)
{
if (strnicmp (value, "vi", 2) == 0)
{
#ifdef VI_MODE
keymap = vi_insertion_keymap;
rl_editing_mode = vi_mode;
#endif /* VI_MODE */
}
else if (strnicmp (value, "emacs", 5) == 0)
{
keymap = emacs_standard_keymap;
rl_editing_mode = emacs_mode;
}
}
else if (stricmp (name, "horizontal-scroll-mode") == 0)
{
if (!*value || stricmp (value, "On") == 0)
horizontal_scroll_mode = 1;
else
horizontal_scroll_mode = 0;
}
}
/* Return the character which matches NAME.
For example, `Space' returns ' '. */
typedef struct {
char *name;
int value;
} assoc_list;
assoc_list name_key_alist[] = {
{ "Space", ' ' },
{ "SPC", ' ' },
{ "Rubout", 0x7f },
{ "DEL", 0x7f },
{ "Tab", 0x09 },
{ "Newline", '\n' },
{ "Return", '\r' },
{ "RET", '\r' },
{ "LFD", '\n' },
{ "Escape", '\033' },
{ "ESC", '\033' },
{ (char *)0x0, 0 }
};
int
glean_key_from_name (name)
char *name;
{
register int i;
for (i = 0; name_key_alist[i].name; i++)
if (stricmp (name, name_key_alist[i].name) == 0)
return (name_key_alist[i].value);
return (*name);
}
/* **************************************************************** */
/* */
/* String Utility Functions */
/* */
/* **************************************************************** */
/* Return non-zero if any members of ARRAY are a substring in STRING. */
static int
substring_member_of_array (string, array)
char *string, **array;
{
static char *strindex ();
while (*array)
{
if (strindex (string, *array))
return (1);
array++;
}
return (0);
}
/* Whoops, Unix doesn't have strnicmp. */
/* Compare at most COUNT characters from string1 to string2. Case
doesn't matter. */
static int
strnicmp (string1, string2, count)
char *string1, *string2;
{
register char ch1, ch2;
while (count) {
ch1 = *string1++;
ch2 = *string2++;
if (to_upper(ch1) == to_upper(ch2))
count--;
else break;
}
return (count);
}
/* strcmp (), but caseless. */
static int
stricmp (string1, string2)
char *string1, *string2;
{
register char ch1, ch2;
while (*string1 && *string2) {
ch1 = *string1++;
ch2 = *string2++;
if (to_upper(ch1) != to_upper(ch2))
return (1);
}
return (*string1 | *string2);
}
/* Determine if s2 occurs in s1. If so, return a pointer to the
match in s1. The compare is case insensitive. */
static char *
strindex (s1, s2)
register char *s1, *s2;
{
register int i, l = strlen (s2);
register int len = strlen (s1);
for (i = 0; (len - i) >= l; i++)
if (strnicmp (&s1[i], s2, l) == 0)
return (s1 + i);
return ((char *)NULL);
}
/* **************************************************************** */
/* */
/* SYSV Support */
/* */
/* **************************************************************** */
/* Since system V reads input differently than we do, I have to
make a special version of getc for that. */
#ifdef SYSV
extern int errno;
#include <sys/errno.h>
int
rl_getc (stream)
FILE *stream;
{
int result;
unsigned char c;
while (1)
{
result = read (fileno (stream), &c, sizeof (char));
if (result == sizeof (char))
return (c);
if (errno != EINTR)
return (EOF);
}
}
#else
int
rl_getc (stream)
FILE *stream;
{
return (getc (stream));
}
#endif
#ifdef STATIC_MALLOC
/* **************************************************************** */
/* */
/* xmalloc and xrealloc () */
/* */
/* **************************************************************** */
static char *
xmalloc (bytes)
int bytes;
{
static memory_error_and_abort ();
char *temp = (char *)malloc (bytes);
if (!temp)
memory_error_and_abort ();
return (temp);
}
static char *
xrealloc (pointer, bytes)
char *pointer;
int bytes;
{
static memory_error_and_abort ();
char *temp = (char *)realloc (pointer, bytes);
if (!temp)
memory_error_and_abort ();
return (temp);
}
static
memory_error_and_abort ()
{
fprintf (stderr, "readline: Out of virtual memory!\n");
abort ();
}
#endif /* STATIC_MALLOC */
/* **************************************************************** */
/* */
/* Testing Readline */
/* */
/* **************************************************************** */
#ifdef TEST
main ()
{
HIST_ENTRY **history_list ();
char *temp = (char *)NULL;
char *prompt = "readline% ";
int done = 0;
while (!done)
{
temp = readline (prompt);
/* Test for EOF. */
if (!temp)
exit (1);
/* If there is anything on the line, print it and remember it. */
if (*temp)
{
fprintf (stderr, "%s\r\n", temp);
add_history (temp);
}
/* Check for `command' that we handle. */
if (strcmp (temp, "quit") == 0)
done = 1;
if (strcmp (temp, "list") == 0) {
HIST_ENTRY **list = history_list ();
register int i;
if (list) {
for (i = 0; list[i]; i++) {
fprintf (stderr, "%d: %s\r\n", i, list[i]->line);
free (list[i]->line);
}
free (list);
}
}
free (temp);
}
}
#endif /* TEST */
/*
* Local variables:
* compile-command: "gcc -g -traditional -I. -I.. -DTEST -o readline readline.c keymaps.o funmap.o history.o -ltermcap"
* end:
*/
|