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
|
/* $OpenBSD: readline.c,v 1.3 2005/11/14 13:36:37 deraadt Exp $ */
/* $NetBSD: readline.c,v 1.43 2003/11/03 03:22:55 christos Exp $ */
/*-
* Copyright (c) 1997 The NetBSD Foundation, Inc.
* All rights reserved.
*
* This code is derived from software contributed to The NetBSD Foundation
* by Jaromir Dolecek.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by the NetBSD
* Foundation, Inc. and its contributors.
* 4. Neither the name of The NetBSD Foundation nor the names of its
* contributors may be used to endorse or promote products derived
* from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
* ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
* TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
* BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
* POSSIBILITY OF SUCH DAMAGE.
*/
#include "config.h"
#if !defined(lint) && !defined(SCCSID)
static const char rcsid[] = "$OpenBSD";
#endif /* not lint && not SCCSID */
#include <sys/types.h>
#include <sys/stat.h>
#include <stdio.h>
#include <dirent.h>
#include <string.h>
#include <pwd.h>
#include <ctype.h>
#include <stdlib.h>
#include <unistd.h>
#include <limits.h>
#include <errno.h>
#include <fcntl.h>
#ifdef HAVE_VIS_H
#include <vis.h>
#else
#include "np/vis.h"
#endif
#ifdef HAVE_ALLOCA_H
#include <alloca.h>
#endif
#include "histedit.h"
#include "readline/readline.h"
#include "el.h"
#include "tokenizer.h"
#include "fcns.h" /* for EL_NUM_FCNS */
/* for rl_complete() */
#define TAB '\r'
/* see comment at the #ifdef for sense of this */
/* #define GDB_411_HACK */
/* readline compatibility stuff - look at readline sources/documentation */
/* to see what these variables mean */
const char *rl_library_version = "EditLine wrapper";
static char empty[] = { '\0' };
static char expand_chars[] = { ' ', '\t', '\n', '=', '(', '\0' };
static char break_chars[] = { ' ', '\t', '\n', '"', '\\', '\'', '`', '@', '$',
'>', '<', '=', ';', '|', '&', '{', '(', '\0' };
char *rl_readline_name = empty;
FILE *rl_instream = NULL;
FILE *rl_outstream = NULL;
int rl_point = 0;
int rl_end = 0;
char *rl_line_buffer = NULL;
VFunction *rl_linefunc = NULL;
int rl_done = 0;
VFunction *rl_event_hook = NULL;
int history_base = 1; /* probably never subject to change */
int history_length = 0;
int max_input_history = 0;
char history_expansion_char = '!';
char history_subst_char = '^';
char *history_no_expand_chars = expand_chars;
Function *history_inhibit_expansion_function = NULL;
char *history_arg_extract(int start, int end, const char *str);
int rl_inhibit_completion = 0;
int rl_attempted_completion_over = 0;
char *rl_basic_word_break_characters = break_chars;
char *rl_completer_word_break_characters = NULL;
char *rl_completer_quote_characters = NULL;
Function *rl_completion_entry_function = NULL;
CPPFunction *rl_attempted_completion_function = NULL;
Function *rl_pre_input_hook = NULL;
Function *rl_startup1_hook = NULL;
Function *rl_getc_function = NULL;
char *rl_terminal_name = NULL;
int rl_already_prompted = 0;
int rl_filename_completion_desired = 0;
int rl_ignore_completion_duplicates = 0;
int rl_catch_signals = 1;
VFunction *rl_redisplay_function = NULL;
Function *rl_startup_hook = NULL;
VFunction *rl_completion_display_matches_hook = NULL;
VFunction *rl_prep_term_function = NULL;
VFunction *rl_deprep_term_function = NULL;
/*
* The current prompt string.
*/
char *rl_prompt = NULL;
/*
* This is set to character indicating type of completion being done by
* rl_complete_internal(); this is available for application completion
* functions.
*/
int rl_completion_type = 0;
/*
* If more than this number of items results from query for possible
* completions, we ask user if they are sure to really display the list.
*/
int rl_completion_query_items = 100;
/*
* List of characters which are word break characters, but should be left
* in the parsed text when it is passed to the completion function.
* Shell uses this to help determine what kind of completing to do.
*/
char *rl_special_prefixes = (char *)NULL;
/*
* This is the character appended to the completed words if at the end of
* the line. Default is ' ' (a space).
*/
int rl_completion_append_character = ' ';
/* stuff below is used internally by libedit for readline emulation */
/* if not zero, non-unique completions always show list of possible matches */
static int _rl_complete_show_all = 0;
static History *h = NULL;
static EditLine *e = NULL;
static Function *map[256];
static int el_rl_complete_cmdnum = 0;
/* internal functions */
static unsigned char _el_rl_complete(EditLine *, int);
static char *_get_prompt(EditLine *);
static HIST_ENTRY *_move_history(int);
static int _history_expand_command(const char *, size_t, size_t,
char **);
static char *_rl_compat_sub(const char *, const char *,
const char *, int);
static int rl_complete_internal(int);
static int _rl_qsort_string_compare(const void *, const void *);
static int _rl_event_read_char(EditLine *, char *);
/* ARGSUSED */
static char *
_get_prompt(EditLine *el __attribute__((__unused__)))
{
rl_already_prompted = 1;
return (rl_prompt);
}
/*
* generic function for moving around history
*/
static HIST_ENTRY *
_move_history(int op)
{
HistEvent ev;
static HIST_ENTRY rl_he;
if (history(h, &ev, op) != 0)
return (HIST_ENTRY *) NULL;
rl_he.line = ev.str;
rl_he.data = NULL;
return (&rl_he);
}
/*
* READLINE compatibility stuff
*/
/*
* initialize rl compat stuff
*/
int
rl_initialize(void)
{
HistEvent ev;
const LineInfo *li;
int i;
int editmode = 1;
struct termios t;
if (e != NULL)
el_end(e);
if (h != NULL)
history_end(h);
if (!rl_instream)
rl_instream = stdin;
if (!rl_outstream)
rl_outstream = stdout;
/*
* See if we don't really want to run the editor
*/
if (tcgetattr(fileno(rl_instream), &t) != -1 && (t.c_lflag & ECHO) == 0)
editmode = 0;
e = el_init(rl_readline_name, rl_instream, rl_outstream, stderr);
if (!editmode)
el_set(e, EL_EDITMODE, 0);
h = history_init();
if (!e || !h)
return (-1);
history(h, &ev, H_SETSIZE, INT_MAX); /* unlimited */
history_length = 0;
max_input_history = INT_MAX;
el_set(e, EL_HIST, history, h);
/* for proper prompt printing in readline() */
rl_prompt = strdup("");
if (rl_prompt == NULL) {
history_end(h);
el_end(e);
return -1;
}
el_set(e, EL_PROMPT, _get_prompt);
el_set(e, EL_SIGNAL, rl_catch_signals);
/* set default mode to "emacs"-style and read setting afterwards */
/* so this can be overriden */
el_set(e, EL_EDITOR, "emacs");
if (rl_terminal_name != NULL)
el_set(e, EL_TERMINAL, rl_terminal_name);
else
el_get(e, EL_TERMINAL, &rl_terminal_name);
/*
* Word completion - this has to go AFTER rebinding keys
* to emacs-style.
*/
el_set(e, EL_ADDFN, "rl_complete",
"ReadLine compatible completion function",
_el_rl_complete);
el_set(e, EL_BIND, "^I", "rl_complete", NULL);
/*
* Find out where the rl_complete function was added; this is
* used later to detect that lastcmd was also rl_complete.
*/
for(i=EL_NUM_FCNS; i < e->el_map.nfunc; i++) {
if (e->el_map.func[i] == _el_rl_complete) {
el_rl_complete_cmdnum = i;
break;
}
}
/* read settings from configuration file */
el_source(e, NULL);
/*
* Unfortunately, some applications really do use rl_point
* and rl_line_buffer directly.
*/
li = el_line(e);
/* a cheesy way to get rid of const cast. */
rl_line_buffer = memchr(li->buffer, *li->buffer, 1);
rl_point = rl_end = 0;
if (rl_startup_hook)
(*rl_startup_hook)(NULL, 0);
return (0);
}
/*
* read one line from input stream and return it, chomping
* trailing newline (if there is any)
*/
char *
readline(const char *prompt)
{
HistEvent ev;
int count;
const char *ret;
char *buf;
static int used_event_hook;
if (e == NULL || h == NULL)
rl_initialize();
rl_done = 0;
/* update prompt accordingly to what has been passed */
if (!prompt)
prompt = "";
if (strcmp(rl_prompt, prompt) != 0) {
free(rl_prompt);
rl_prompt = strdup(prompt);
if (rl_prompt == NULL)
return NULL;
}
if (rl_pre_input_hook)
(*rl_pre_input_hook)(NULL, 0);
if (rl_event_hook && !(e->el_flags&NO_TTY)) {
el_set(e, EL_GETCFN, _rl_event_read_char);
used_event_hook = 1;
}
if (!rl_event_hook && used_event_hook) {
el_set(e, EL_GETCFN, EL_BUILTIN_GETCFN);
used_event_hook = 0;
}
rl_already_prompted = 0;
/* get one line from input stream */
ret = el_gets(e, &count);
if (ret && count > 0) {
int lastidx;
buf = strdup(ret);
if (buf == NULL)
return NULL;
lastidx = count - 1;
if (buf[lastidx] == '\n')
buf[lastidx] = '\0';
} else
buf = NULL;
history(h, &ev, H_GETSIZE);
history_length = ev.num;
return buf;
}
/*
* history functions
*/
/*
* is normally called before application starts to use
* history expansion functions
*/
void
using_history(void)
{
if (h == NULL || e == NULL)
rl_initialize();
}
/*
* substitute ``what'' with ``with'', returning resulting string; if
* globally == 1, substitutes all occurrences of what, otherwise only the
* first one
*/
static char *
_rl_compat_sub(const char *str, const char *what, const char *with,
int globally)
{
const char *s;
char *r, *result;
size_t len, with_len, what_len;
len = strlen(str);
with_len = strlen(with);
what_len = strlen(what);
/* calculate length we need for result */
s = str;
while (*s) {
if (*s == *what && !strncmp(s, what, what_len)) {
len += with_len - what_len;
if (!globally)
break;
s += what_len;
} else
s++;
}
len++;
r = result = malloc(len);
if (result == NULL)
return NULL;
s = str;
while (*s) {
if (*s == *what && !strncmp(s, what, what_len)) {
(void)strncpy(r, with, with_len);
r += with_len;
len -= with_len;
s += what_len;
if (!globally) {
(void)strlcpy(r, s, len);
return(result);
}
} else
*r++ = *s++;
}
*r = 0;
return(result);
}
static char *last_search_pat; /* last !?pat[?] search pattern */
static char *last_search_match; /* last !?pat[?] that matched */
const char *
get_history_event(const char *cmd, int *cindex, int qchar)
{
int idx, sign, sub, num, begin, ret;
size_t len;
char *pat;
const char *rptr;
HistEvent ev;
idx = *cindex;
if (cmd[idx++] != history_expansion_char)
return(NULL);
/* find out which event to take */
if (cmd[idx] == history_expansion_char || cmd[idx] == 0) {
if (history(h, &ev, H_FIRST) != 0)
return(NULL);
*cindex = cmd[idx]? (idx + 1):idx;
return(ev.str);
}
sign = 0;
if (cmd[idx] == '-') {
sign = 1;
idx++;
}
if ('0' <= cmd[idx] && cmd[idx] <= '9') {
HIST_ENTRY *rl_he;
num = 0;
while (cmd[idx] && '0' <= cmd[idx] && cmd[idx] <= '9') {
num = num * 10 + cmd[idx] - '0';
idx++;
}
if (sign)
num = history_length - num + 1;
if (!(rl_he = history_get(num)))
return(NULL);
*cindex = idx;
return(rl_he->line);
}
sub = 0;
if (cmd[idx] == '?') {
sub = 1;
idx++;
}
begin = idx;
while (cmd[idx]) {
if (cmd[idx] == '\n')
break;
if (sub && cmd[idx] == '?')
break;
if (!sub && (cmd[idx] == ':' || cmd[idx] == ' '
|| cmd[idx] == '\t' || cmd[idx] == qchar))
break;
idx++;
}
len = idx - begin;
if (sub && cmd[idx] == '?')
idx++;
if (sub && len == 0 && last_search_pat && *last_search_pat)
pat = last_search_pat;
else if (len == 0)
return(NULL);
else {
if ((pat = malloc(len + 1)) == NULL)
return NULL;
(void)strncpy(pat, cmd + begin, len);
pat[len] = '\0';
}
if (history(h, &ev, H_CURR) != 0) {
if (pat != last_search_pat)
free(pat);
return (NULL);
}
num = ev.num;
if (sub) {
if (pat != last_search_pat) {
if (last_search_pat)
free(last_search_pat);
last_search_pat = pat;
}
ret = history_search(pat, -1);
} else
ret = history_search_prefix(pat, -1);
if (ret == -1) {
/* restore to end of list on failed search */
history(h, &ev, H_FIRST);
(void)fprintf(rl_outstream, "%s: Event not found\n", pat);
if (pat != last_search_pat)
free(pat);
return(NULL);
}
if (sub && len) {
if (last_search_match && last_search_match != pat)
free(last_search_match);
last_search_match = pat;
}
if (pat != last_search_pat)
free(pat);
if (history(h, &ev, H_CURR) != 0)
return(NULL);
*cindex = idx;
rptr = ev.str;
/* roll back to original position */
(void)history(h, &ev, H_SET, num);
return rptr;
}
/*
* the real function doing history expansion - takes as argument command
* to do and data upon which the command should be executed
* does expansion the way I've understood readline documentation
*
* returns 0 if data was not modified, 1 if it was and 2 if the string
* should be only printed and not executed; in case of error,
* returns -1 and *result points to NULL
* it's callers responsibility to free() string returned in *result
*/
static int
_history_expand_command(const char *command, size_t offs, size_t cmdlen,
char **result)
{
char *tmp, *search = NULL, *aptr;
const char *ptr, *cmd;
static char *from = NULL, *to = NULL;
int start, end, idx, has_mods = 0;
int p_on = 0, g_on = 0;
*result = NULL;
aptr = NULL;
ptr = NULL;
/* First get event specifier */
idx = 0;
if (strchr(":^*$", command[offs + 1])) {
char str[4];
/*
* "!:" is shorthand for "!!:".
* "!^", "!*" and "!$" are shorthand for
* "!!:^", "!!:*" and "!!:$" respectively.
*/
str[0] = str[1] = '!';
str[2] = '0';
ptr = get_history_event(str, &idx, 0);
idx = (command[offs + 1] == ':')? 1:0;
has_mods = 1;
} else {
if (command[offs + 1] == '#') {
/* use command so far */
if ((aptr = malloc(offs + 1)) == NULL)
return -1;
(void)strncpy(aptr, command, offs);
aptr[offs] = '\0';
idx = 1;
} else {
int qchar;
qchar = (offs > 0 && command[offs - 1] == '"')? '"':0;
ptr = get_history_event(command + offs, &idx, qchar);
}
has_mods = command[offs + idx] == ':';
}
if (ptr == NULL && aptr == NULL)
return(-1);
if (!has_mods) {
*result = strdup(aptr? aptr : ptr);
if (aptr)
free(aptr);
return(1);
}
cmd = command + offs + idx + 1;
/* Now parse any word designators */
if (*cmd == '%') /* last word matched by ?pat? */
tmp = strdup(last_search_match? last_search_match:"");
else if (strchr("^*$-0123456789", *cmd)) {
start = end = -1;
if (*cmd == '^')
start = end = 1, cmd++;
else if (*cmd == '$')
start = -1, cmd++;
else if (*cmd == '*')
start = 1, cmd++;
else if (*cmd == '-' || isdigit((unsigned char) *cmd)) {
start = 0;
while (*cmd && '0' <= *cmd && *cmd <= '9')
start = start * 10 + *cmd++ - '0';
if (*cmd == '-') {
if (isdigit((unsigned char) cmd[1])) {
cmd++;
end = 0;
while (*cmd && '0' <= *cmd && *cmd <= '9')
end = end * 10 + *cmd++ - '0';
} else if (cmd[1] == '$') {
cmd += 2;
end = -1;
} else {
cmd++;
end = -2;
}
} else if (*cmd == '*')
end = -1, cmd++;
else
end = start;
}
tmp = history_arg_extract(start, end, aptr? aptr:ptr);
if (tmp == NULL) {
(void)fprintf(rl_outstream, "%s: Bad word specifier",
command + offs + idx);
if (aptr)
free(aptr);
return(-1);
}
} else
tmp = strdup(aptr? aptr:ptr);
if (aptr)
free(aptr);
if (*cmd == 0 || (cmd - (command + offs) >= cmdlen)) {
*result = tmp;
return(1);
}
for (; *cmd; cmd++) {
if (*cmd == ':')
continue;
else if (*cmd == 'h') { /* remove trailing path */
if ((aptr = strrchr(tmp, '/')) != NULL)
*aptr = 0;
} else if (*cmd == 't') { /* remove leading path */
if ((aptr = strrchr(tmp, '/')) != NULL) {
aptr = strdup(aptr + 1);
free(tmp);
tmp = aptr;
}
} else if (*cmd == 'r') { /* remove trailing suffix */
if ((aptr = strrchr(tmp, '.')) != NULL)
*aptr = 0;
} else if (*cmd == 'e') { /* remove all but suffix */
if ((aptr = strrchr(tmp, '.')) != NULL) {
aptr = strdup(aptr);
free(tmp);
tmp = aptr;
}
} else if (*cmd == 'p') /* print only */
p_on = 1;
else if (*cmd == 'g')
g_on = 2;
else if (*cmd == 's' || *cmd == '&') {
char *what, *with, delim;
size_t len, from_len;
size_t size;
if (*cmd == '&' && (from == NULL || to == NULL))
continue;
else if (*cmd == 's') {
delim = *(++cmd), cmd++;
size = 16;
what = realloc(from, size);
if (what == NULL) {
free(from);
return 0;
}
len = 0;
for (; *cmd && *cmd != delim; cmd++) {
if (*cmd == '\\' && cmd[1] == delim)
cmd++;
if (len >= size) {
char *nwhat;
nwhat = realloc(what,
(size <<= 1));
if (nwhat == NULL) {
free(what);
return 0;
}
what = nwhat;
}
what[len++] = *cmd;
}
what[len] = '\0';
from = what;
if (*what == '\0') {
free(what);
if (search) {
from = strdup(search);
if (from == NULL)
return 0;
} else {
from = NULL;
return (-1);
}
}
cmd++; /* shift after delim */
if (!*cmd)
continue;
size = 16;
with = realloc(to, size);
if (with == NULL) {
free(to);
return -1;
}
len = 0;
from_len = strlen(from);
for (; *cmd && *cmd != delim; cmd++) {
if (len + from_len + 1 >= size) {
char *nwith;
size += from_len + 1;
nwith = realloc(with, size);
if (nwith == NULL) {
free(with);
return -1;
}
with = nwith;
}
if (*cmd == '&') {
(void)strlcpy(&with[len], from,
size - len);
len += from_len;
continue;
}
if (*cmd == '\\'
&& (*(cmd + 1) == delim
|| *(cmd + 1) == '&'))
cmd++;
with[len++] = *cmd;
}
with[len] = '\0';
to = with;
}
aptr = _rl_compat_sub(tmp, from, to, g_on);
if (aptr) {
free(tmp);
tmp = aptr;
}
g_on = 0;
}
}
*result = tmp;
return (p_on? 2:1);
}
/*
* csh-style history expansion
*/
int
history_expand(char *str, char **output)
{
int ret = 0;
size_t idx, i, size;
char *tmp, *result;
if (h == NULL || e == NULL)
rl_initialize();
if (history_expansion_char == 0) {
*output = strdup(str);
return(0);
}
*output = NULL;
if (str[0] == history_subst_char) {
/* ^foo^foo2^ is equivalent to !!:s^foo^foo2^ */
size_t sz = 4 + strlen(str) + 1;
*output = malloc(sz);
if (*output == NULL)
return 0;
(*output)[0] = (*output)[1] = history_expansion_char;
(*output)[2] = ':';
(*output)[3] = 's';
(void)strlcpy((*output) + 4, str, sz - 4);
str = *output;
} else {
*output = strdup(str);
if (*output == NULL)
return 0;
}
#define ADD_STRING(what, len) \
{ \
if (idx + len + 1 > size) { \
char *nresult = realloc(result, (size += len + 1));\
if (nresult == NULL) { \
free(*output); \
return 0; \
} \
result = nresult; \
} \
(void)strncpy(&result[idx], what, len); \
idx += len; \
result[idx] = '\0'; \
}
result = NULL;
size = idx = 0;
for (i = 0; str[i];) {
int qchar, loop_again;
size_t len, start, j;
qchar = 0;
loop_again = 1;
start = j = i;
loop:
for (; str[j]; j++) {
if (str[j] == '\\' &&
str[j + 1] == history_expansion_char) {
size_t sz = strlen(&str[j]) + 1;
(void)strlcpy(&str[j], &str[j + 1], sz);
continue;
}
if (!loop_again) {
if (isspace((unsigned char) str[j])
|| str[j] == qchar)
break;
}
if (str[j] == history_expansion_char
&& !strchr(history_no_expand_chars, str[j + 1])
&& (!history_inhibit_expansion_function ||
(*history_inhibit_expansion_function)(str,
(int)j) == 0))
break;
}
if (str[j] && loop_again) {
i = j;
qchar = (j > 0 && str[j - 1] == '"' )? '"':0;
j++;
if (str[j] == history_expansion_char)
j++;
loop_again = 0;
goto loop;
}
len = i - start;
tmp = &str[start];
ADD_STRING(tmp, len);
if (str[i] == '\0' || str[i] != history_expansion_char) {
len = j - i;
tmp = &str[i];
ADD_STRING(tmp, len);
if (start == 0)
ret = 0;
else
ret = 1;
break;
}
ret = _history_expand_command (str, i, (j - i), &tmp);
if (ret > 0 && tmp) {
len = strlen(tmp);
ADD_STRING(tmp, len);
free(tmp);
}
i = j;
}
/* ret is 2 for "print only" option */
if (ret == 2) {
add_history(result);
#ifdef GDB_411_HACK
/* gdb 4.11 has been shipped with readline, where */
/* history_expand() returned -1 when the line */
/* should not be executed; in readline 2.1+ */
/* it should return 2 in such a case */
ret = -1;
#endif
}
free(*output);
*output = result;
return (ret);
}
/*
* Return a string consisting of arguments of "str" from "start" to "end".
*/
char *
history_arg_extract(int start, int end, const char *str)
{
size_t i, len, max;
char **arr, *result;
arr = history_tokenize(str);
if (!arr)
return(NULL);
if (arr && *arr == NULL) {
free(arr);
return(NULL);
}
for (max = 0; arr[max]; max++)
continue;
max--;
if (start == '$')
start = max;
if (end == '$')
end = max;
if (end < 0)
end = max + end + 1;
if (start < 0)
start = end;
if (start < 0 || end < 0 || start > max || end > max || start > end)
return(NULL);
for (i = start, len = 0; i <= end; i++)
len += strlen(arr[i]) + 1;
len++;
max = len;
result = malloc(len);
if (result == NULL)
return NULL;
for (i = start, len = 0; i <= end; i++) {
(void)strlcpy(result + len, arr[i], max - len);
len += strlen(arr[i]);
if (i < end)
result[len++] = ' ';
}
result[len] = 0;
for (i = 0; arr[i]; i++)
free(arr[i]);
free(arr);
return(result);
}
/*
* Parse the string into individual tokens,
* similar to how shell would do it.
*/
char **
history_tokenize(const char *str)
{
int size = 1, idx = 0, i, start;
size_t len;
char **result = NULL, *temp, delim = '\0';
for (i = 0; str[i];) {
while (isspace((unsigned char) str[i]))
i++;
start = i;
for (; str[i];) {
if (str[i] == '\\') {
if (str[i+1] != '\0')
i++;
} else if (str[i] == delim)
delim = '\0';
else if (!delim &&
(isspace((unsigned char) str[i]) ||
strchr("()<>;&|$", str[i])))
break;
else if (!delim && strchr("'`\"", str[i]))
delim = str[i];
if (str[i])
i++;
}
if (idx + 2 >= size) {
char **nresult;
size <<= 1;
nresult = realloc(result, size * sizeof(char *));
if (nresult == NULL) {
free(result);
return NULL;
}
result = nresult;
}
len = i - start;
temp = malloc(len + 1);
if (temp == NULL) {
for (i = 0; i < idx; i++)
free(result[i]);
free(result);
return NULL;
}
(void)strncpy(temp, &str[start], len);
temp[len] = '\0';
result[idx++] = temp;
result[idx] = NULL;
if (str[i])
i++;
}
return (result);
}
/*
* limit size of history record to ``max'' events
*/
void
stifle_history(int max)
{
HistEvent ev;
if (h == NULL || e == NULL)
rl_initialize();
if (history(h, &ev, H_SETSIZE, max) == 0)
max_input_history = max;
}
/*
* "unlimit" size of history - set the limit to maximum allowed int value
*/
int
unstifle_history(void)
{
HistEvent ev;
int omax;
history(h, &ev, H_SETSIZE, INT_MAX);
omax = max_input_history;
max_input_history = INT_MAX;
return (omax); /* some value _must_ be returned */
}
int
history_is_stifled(void)
{
/* cannot return true answer */
return (max_input_history != INT_MAX);
}
/*
* read history from a file given
*/
int
read_history(const char *filename)
{
HistEvent ev;
if (h == NULL || e == NULL)
rl_initialize();
return (history(h, &ev, H_LOAD, filename));
}
/*
* write history to a file given
*/
int
write_history(const char *filename)
{
HistEvent ev;
if (h == NULL || e == NULL)
rl_initialize();
return (history(h, &ev, H_SAVE, filename));
}
/*
* returns history ``num''th event
*
* returned pointer points to static variable
*/
HIST_ENTRY *
history_get(int num)
{
static HIST_ENTRY she;
HistEvent ev;
int curr_num;
if (h == NULL || e == NULL)
rl_initialize();
/* save current position */
if (history(h, &ev, H_CURR) != 0)
return (NULL);
curr_num = ev.num;
/* start from most recent */
if (history(h, &ev, H_FIRST) != 0)
return (NULL); /* error */
/* look backwards for event matching specified offset */
if (history(h, &ev, H_NEXT_EVENT, num))
return (NULL);
she.line = ev.str;
she.data = NULL;
/* restore pointer to where it was */
(void)history(h, &ev, H_SET, curr_num);
return (&she);
}
/*
* add the line to history table
*/
int
add_history(const char *line)
{
HistEvent ev;
if (h == NULL || e == NULL)
rl_initialize();
(void)history(h, &ev, H_ENTER, line);
if (history(h, &ev, H_GETSIZE) == 0)
history_length = ev.num;
return (!(history_length > 0)); /* return 0 if all is okay */
}
/*
* clear the history list - delete all entries
*/
void
clear_history(void)
{
HistEvent ev;
history(h, &ev, H_CLEAR);
}
/*
* returns offset of the current history event
*/
int
where_history(void)
{
HistEvent ev;
int curr_num, off;
if (history(h, &ev, H_CURR) != 0)
return (0);
curr_num = ev.num;
history(h, &ev, H_FIRST);
off = 1;
while (ev.num != curr_num && history(h, &ev, H_NEXT) == 0)
off++;
return (off);
}
/*
* returns current history event or NULL if there is no such event
*/
HIST_ENTRY *
current_history(void)
{
return (_move_history(H_CURR));
}
/*
* returns total number of bytes history events' data are using
*/
int
history_total_bytes(void)
{
HistEvent ev;
int curr_num, size;
if (history(h, &ev, H_CURR) != 0)
return (-1);
curr_num = ev.num;
history(h, &ev, H_FIRST);
size = 0;
do
size += strlen(ev.str);
while (history(h, &ev, H_NEXT) == 0);
/* get to the same position as before */
history(h, &ev, H_PREV_EVENT, curr_num);
return (size);
}
/*
* sets the position in the history list to ``pos''
*/
int
history_set_pos(int pos)
{
HistEvent ev;
int curr_num;
if (pos > history_length || pos < 0)
return (-1);
history(h, &ev, H_CURR);
curr_num = ev.num;
if (history(h, &ev, H_SET, pos)) {
history(h, &ev, H_SET, curr_num);
return(-1);
}
return (0);
}
/*
* returns previous event in history and shifts pointer accordingly
*/
HIST_ENTRY *
previous_history(void)
{
return (_move_history(H_PREV));
}
/*
* returns next event in history and shifts pointer accordingly
*/
HIST_ENTRY *
next_history(void)
{
return (_move_history(H_NEXT));
}
/*
* searches for first history event containing the str
*/
int
history_search(const char *str, int direction)
{
HistEvent ev;
const char *strp;
int curr_num;
if (history(h, &ev, H_CURR) != 0)
return (-1);
curr_num = ev.num;
for (;;) {
if ((strp = strstr(ev.str, str)) != NULL)
return (int) (strp - ev.str);
if (history(h, &ev, direction < 0 ? H_NEXT:H_PREV) != 0)
break;
}
history(h, &ev, H_SET, curr_num);
return (-1);
}
/*
* searches for first history event beginning with str
*/
int
history_search_prefix(const char *str, int direction)
{
HistEvent ev;
return (history(h, &ev, direction < 0? H_PREV_STR:H_NEXT_STR, str));
}
/*
* search for event in history containing str, starting at offset
* abs(pos); continue backward, if pos<0, forward otherwise
*/
/* ARGSUSED */
int
history_search_pos(const char *str,
int direction __attribute__((__unused__)), int pos)
{
HistEvent ev;
int curr_num, off;
off = (pos > 0) ? pos : -pos;
pos = (pos > 0) ? 1 : -1;
if (history(h, &ev, H_CURR) != 0)
return (-1);
curr_num = ev.num;
if (history_set_pos(off) != 0 || history(h, &ev, H_CURR) != 0)
return (-1);
for (;;) {
if (strstr(ev.str, str))
return (off);
if (history(h, &ev, (pos < 0) ? H_PREV : H_NEXT) != 0)
break;
}
/* set "current" pointer back to previous state */
history(h, &ev, (pos < 0) ? H_NEXT_EVENT : H_PREV_EVENT, curr_num);
return (-1);
}
/********************************/
/* completion functions */
/*
* does tilde expansion of strings of type ``~user/foo''
* if ``user'' isn't valid user name or ``txt'' doesn't start
* w/ '~', returns pointer to strdup()ed copy of ``txt''
*
* it's callers's responsibility to free() returned string
*/
char *
tilde_expand(char *txt)
{
struct passwd *pass;
char *temp;
size_t len = 0;
if (txt[0] != '~')
return (strdup(txt));
temp = strchr(txt + 1, '/');
if (temp == NULL) {
temp = strdup(txt + 1);
if (temp == NULL)
return NULL;
} else {
len = temp - txt + 1; /* text until string after slash */
temp = malloc(len);
if (temp == NULL)
return NULL;
(void)strncpy(temp, txt + 1, len - 2);
temp[len - 2] = '\0';
}
pass = getpwnam(temp);
free(temp); /* value no more needed */
if (pass == NULL)
return (strdup(txt));
/* update pointer txt to point at string immedially following */
/* first slash */
txt += len;
if (asprintf(&temp, "%s/%s", pass->pw_dir, txt) == -1)
return NULL;
return (temp);
}
/*
* return first found file name starting by the ``text'' or NULL if no
* such file can be found
* value of ``state'' is ignored
*
* it's caller's responsibility to free returned string
*/
char *
filename_completion_function(const char *text, int state)
{
static DIR *dir = NULL;
static char *filename = NULL, *dirname = NULL;
static size_t filename_len = 0;
struct dirent *entry;
char *temp;
size_t len;
if (state == 0 || dir == NULL) {
temp = strrchr(text, '/');
if (temp) {
char *nptr;
size_t sz;
temp++;
sz = strlen(temp) + 1;
nptr = realloc(filename, sz);
if (nptr == NULL) {
free(filename);
return NULL;
}
filename = nptr;
(void)strlcpy(filename, temp, sz);
len = temp - text; /* including last slash */
nptr = realloc(dirname, len + 1);
if (nptr == NULL) {
free(filename);
return NULL;
}
dirname = nptr;
(void)strncpy(dirname, text, len);
dirname[len] = '\0';
} else {
if (*text == 0)
filename = NULL;
else {
filename = strdup(text);
if (filename == NULL)
return NULL;
}
dirname = NULL;
}
/* support for ``~user'' syntax */
if (dirname && *dirname == '~') {
char *nptr;
size_t sz;
temp = tilde_expand(dirname);
if (temp == NULL)
return NULL;
sz = strlen(temp) + 1;
nptr = realloc(dirname, sz);
if (nptr == NULL) {
free(dirname);
return NULL;
}
dirname = nptr;
(void)strlcpy(dirname, temp, sz);
free(temp); /* no longer needed */
}
/* will be used in cycle */
filename_len = filename ? strlen(filename) : 0;
if (dir != NULL) {
(void)closedir(dir);
dir = NULL;
}
dir = opendir(dirname ? dirname : ".");
if (!dir)
return (NULL); /* cannot open the directory */
}
/* find the match */
while ((entry = readdir(dir)) != NULL) {
/* skip . and .. */
if (entry->d_name[0] == '.' && (!entry->d_name[1]
|| (entry->d_name[1] == '.' && !entry->d_name[2])))
continue;
if (filename_len == 0)
break;
/* otherwise, get first entry where first */
/* filename_len characters are equal */
if (entry->d_name[0] == filename[0]
#if defined(__SVR4) || defined(__linux__)
&& strlen(entry->d_name) >= filename_len
#else
&& entry->d_namlen >= filename_len
#endif
&& strncmp(entry->d_name, filename,
filename_len) == 0)
break;
}
if (entry) { /* match found */
struct stat stbuf;
#if defined(__SVR4) || defined(__linux__)
len = strlen(entry->d_name) +
#else
len = entry->d_namlen +
#endif
((dirname) ? strlen(dirname) : 0) + 1 + 1;
temp = malloc(len);
if (temp == NULL)
return NULL;
(void)snprintf(temp, len, "%s%s",
dirname ? dirname : "", entry->d_name);
/* test, if it's directory */
if (stat(temp, &stbuf) == 0 && S_ISDIR(stbuf.st_mode))
strlcat(temp, "/", len);
} else {
(void)closedir(dir);
dir = NULL;
temp = NULL;
}
return (temp);
}
/*
* a completion generator for usernames; returns _first_ username
* which starts with supplied text
* text contains a partial username preceded by random character
* (usually '~'); state is ignored
* it's callers responsibility to free returned value
*/
char *
username_completion_function(const char *text, int state)
{
struct passwd *pwd;
if (text[0] == '\0')
return (NULL);
if (*text == '~')
text++;
if (state == 0)
setpwent();
while ((pwd = getpwent()) && text[0] == pwd->pw_name[0]
&& strcmp(text, pwd->pw_name) == 0);
if (pwd == NULL) {
endpwent();
return (NULL);
}
return (strdup(pwd->pw_name));
}
/*
* el-compatible wrapper around rl_complete; needed for key binding
*/
/* ARGSUSED */
static unsigned char
_el_rl_complete(EditLine *el __attribute__((__unused__)), int ch)
{
return (unsigned char) rl_complete(0, ch);
}
/*
* returns list of completions for text given
*/
char **
completion_matches(const char *text, CPFunction *genfunc)
{
char **match_list = NULL, *retstr, *prevstr;
size_t match_list_len, max_equal, which, i;
size_t matches;
if (h == NULL || e == NULL)
rl_initialize();
matches = 0;
match_list_len = 1;
while ((retstr = (*genfunc) (text, (int)matches)) != NULL) {
/* allow for list terminator here */
if (matches + 3 >= match_list_len) {
char **nmatch_list;
while (matches + 3 >= match_list_len)
match_list_len <<= 1;
nmatch_list = realloc(match_list,
match_list_len * sizeof(char *));
if (nmatch_list == NULL) {
free(match_list);
return NULL;
}
match_list = nmatch_list;
}
match_list[++matches] = retstr;
}
if (!match_list)
return NULL; /* nothing found */
/* find least denominator and insert it to match_list[0] */
which = 2;
prevstr = match_list[1];
max_equal = strlen(prevstr);
for (; which <= matches; which++) {
for (i = 0; i < max_equal &&
prevstr[i] == match_list[which][i]; i++)
continue;
max_equal = i;
}
retstr = malloc(max_equal + 1);
if (retstr == NULL) {
free(match_list);
return NULL;
}
(void)strncpy(retstr, match_list[1], max_equal);
retstr[max_equal] = '\0';
match_list[0] = retstr;
/* add NULL as last pointer to the array */
match_list[matches + 1] = (char *) NULL;
return (match_list);
}
/*
* Sort function for qsort(). Just wrapper around strcasecmp().
*/
static int
_rl_qsort_string_compare(i1, i2)
const void *i1, *i2;
{
const char *s1 = ((const char * const *)i1)[0];
const char *s2 = ((const char * const *)i2)[0];
return strcasecmp(s1, s2);
}
/*
* Display list of strings in columnar format on readline's output stream.
* 'matches' is list of strings, 'len' is number of strings in 'matches',
* 'max' is maximum length of string in 'matches'.
*/
void
rl_display_match_list (matches, len, max)
char **matches;
int len, max;
{
int i, idx, limit, count;
int screenwidth = e->el_term.t_size.h;
/*
* Find out how many entries can be put on one line, count
* with two spaces between strings.
*/
limit = screenwidth / (max + 2);
if (limit == 0)
limit = 1;
/* how many lines of output */
count = len / limit;
if (count * limit < len)
count++;
/* Sort the items if they are not already sorted. */
qsort(&matches[1], (size_t)(len - 1), sizeof(char *),
_rl_qsort_string_compare);
idx = 1;
for(; count > 0; count--) {
for(i = 0; i < limit && matches[idx]; i++, idx++)
(void)fprintf(e->el_outfile, "%-*s ", max,
matches[idx]);
(void)fprintf(e->el_outfile, "\n");
}
}
/*
* Complete the word at or before point, called by rl_complete()
* '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.
* `!' means to do standard completion, and list all possible completions if
* there is more than one.
*
* Note: '*' support is not implemented
*/
static int
rl_complete_internal(int what_to_do)
{
Function *complet_func;
const LineInfo *li;
char *temp, **matches;
const char *ctemp;
size_t len;
rl_completion_type = what_to_do;
if (h == NULL || e == NULL)
rl_initialize();
complet_func = rl_completion_entry_function;
if (!complet_func)
complet_func = (Function *)(void *)filename_completion_function;
/* We now look backwards for the start of a filename/variable word */
li = el_line(e);
ctemp = (const char *) li->cursor;
while (ctemp > li->buffer
&& !strchr(rl_basic_word_break_characters, ctemp[-1])
&& (!rl_special_prefixes
|| !strchr(rl_special_prefixes, ctemp[-1]) ) )
ctemp--;
len = li->cursor - ctemp;
temp = alloca(len + 1);
(void)strncpy(temp, ctemp, len);
temp[len] = '\0';
/* these can be used by function called in completion_matches() */
/* or (*rl_attempted_completion_function)() */
rl_point = li->cursor - li->buffer;
rl_end = li->lastchar - li->buffer;
if (rl_attempted_completion_function) {
int end = li->cursor - li->buffer;
matches = (*rl_attempted_completion_function) (temp, (int)
(end - len), end);
} else
matches = 0;
if (!rl_attempted_completion_function || !matches)
matches = completion_matches(temp, (CPFunction *)complet_func);
if (matches) {
int i, retval = CC_REFRESH;
int matches_num, maxlen, match_len, match_display=1;
/*
* Only replace the completed string with common part of
* possible matches if there is possible completion.
*/
if (matches[0][0] != '\0') {
el_deletestr(e, (int) len);
el_insertstr(e, matches[0]);
}
if (what_to_do == '?')
goto display_matches;
if (matches[2] == NULL && strcmp(matches[0], matches[1]) == 0) {
/*
* We found exact match. Add a space after
* it, unless we do filename completion and the
* object is a directory.
*/
size_t alen = strlen(matches[0]);
if ((complet_func !=
(Function *)filename_completion_function
|| (alen > 0 && (matches[0])[alen - 1] != '/'))
&& rl_completion_append_character) {
char buf[2];
buf[0] = rl_completion_append_character;
buf[1] = '\0';
el_insertstr(e, buf);
}
} else if (what_to_do == '!') {
display_matches:
/*
* More than one match and requested to list possible
* matches.
*/
for(i=1, maxlen=0; matches[i]; i++) {
match_len = strlen(matches[i]);
if (match_len > maxlen)
maxlen = match_len;
}
matches_num = i - 1;
/* newline to get on next line from command line */
(void)fprintf(e->el_outfile, "\n");
/*
* If there are too many items, ask user for display
* confirmation.
*/
if (matches_num > rl_completion_query_items) {
(void)fprintf(e->el_outfile,
"Display all %d possibilities? (y or n) ",
matches_num);
(void)fflush(e->el_outfile);
if (getc(stdin) != 'y')
match_display = 0;
(void)fprintf(e->el_outfile, "\n");
}
if (match_display)
rl_display_match_list(matches, matches_num,
maxlen);
retval = CC_REDISPLAY;
} else if (matches[0][0]) {
/*
* There was some common match, but the name was
* not complete enough. Next tab will print possible
* completions.
*/
el_beep(e);
} else {
/* lcd is not a valid object - further specification */
/* is needed */
el_beep(e);
retval = CC_NORM;
}
/* free elements of array and the array itself */
for (i = 0; matches[i]; i++)
free(matches[i]);
free(matches), matches = NULL;
return (retval);
}
return (CC_NORM);
}
/*
* complete word at current point
*/
int
rl_complete(int ignore, int invoking_key)
{
if (h == NULL || e == NULL)
rl_initialize();
if (rl_inhibit_completion) {
rl_insert(ignore, invoking_key);
return (CC_REFRESH);
} else if (e->el_state.lastcmd == el_rl_complete_cmdnum)
return rl_complete_internal('?');
else if (_rl_complete_show_all)
return rl_complete_internal('!');
else
return (rl_complete_internal(TAB));
}
/*
* misc other functions
*/
/*
* bind key c to readline-type function func
*/
int
rl_bind_key(int c, int func(int, int))
{
int retval = -1;
if (h == NULL || e == NULL)
rl_initialize();
if (func == rl_insert) {
/* XXX notice there is no range checking of ``c'' */
e->el_map.key[c] = ED_INSERT;
retval = 0;
}
return (retval);
}
/*
* read one key from input - handles chars pushed back
* to input stream also
*/
int
rl_read_key(void)
{
char fooarr[2 * sizeof(int)];
if (e == NULL || h == NULL)
rl_initialize();
return (el_getc(e, fooarr));
}
/*
* reset the terminal
*/
/* ARGSUSED */
void
rl_reset_terminal(const char *p __attribute__((__unused__)))
{
if (h == NULL || e == NULL)
rl_initialize();
el_reset(e);
}
/*
* insert character ``c'' back into input stream, ``count'' times
*/
int
rl_insert(int count, int c)
{
char arr[2];
if (h == NULL || e == NULL)
rl_initialize();
/* XXX - int -> char conversion can lose on multichars */
arr[0] = c;
arr[1] = '\0';
for (; count > 0; count--)
el_push(e, arr);
return (0);
}
/*ARGSUSED*/
int
rl_newline(int count, int c)
{
/*
* Readline-4.0 appears to ignore the args.
*/
return rl_insert(1, '\n');
}
/*ARGSUSED*/
static unsigned char
rl_bind_wrapper(EditLine *el, unsigned char c)
{
if (map[c] == NULL)
return CC_ERROR;
(*map[c])(NULL, c);
/* If rl_done was set by the above call, deal with it here */
if (rl_done)
return CC_EOF;
return CC_NORM;
}
int
rl_add_defun(const char *name, Function *fun, int c)
{
char dest[8];
if (c >= sizeof(map) / sizeof(map[0]) || c < 0)
return -1;
map[(unsigned char)c] = fun;
el_set(e, EL_ADDFN, name, name, rl_bind_wrapper);
vis(dest, c, VIS_WHITE|VIS_NOSLASH, 0);
el_set(e, EL_BIND, dest, name);
return 0;
}
void
rl_callback_read_char()
{
int count = 0, done = 0;
const char *buf = el_gets(e, &count);
char *wbuf;
if (buf == NULL || count-- <= 0)
return;
if (count == 0 && buf[0] == CTRL('d'))
done = 1;
if (buf[count] == '\n' || buf[count] == '\r')
done = 2;
if (done && rl_linefunc != NULL) {
el_set(e, EL_UNBUFFERED, 0);
if (done == 2) {
if ((wbuf = strdup(buf)) != NULL)
wbuf[count] = '\0';
} else
wbuf = NULL;
(*(void (*)(const char *))rl_linefunc)(wbuf);
}
}
void
rl_callback_handler_install (const char *prompt, VFunction *linefunc)
{
if (e == NULL) {
rl_initialize();
}
if (rl_prompt)
free(rl_prompt);
rl_prompt = prompt ? strdup(strchr(prompt, *prompt)) : NULL;
rl_linefunc = linefunc;
el_set(e, EL_UNBUFFERED, 1);
}
void
rl_callback_handler_remove(void)
{
el_set(e, EL_UNBUFFERED, 0);
}
void
rl_redisplay(void)
{
char a[2];
a[0] = CTRL('r');
a[1] = '\0';
el_push(e, a);
}
int
rl_get_previous_history(int count, int key)
{
char a[2];
a[0] = key;
a[1] = '\0';
while (count--)
el_push(e, a);
return 0;
}
void
/*ARGSUSED*/
rl_prep_terminal(int meta_flag)
{
el_set(e, EL_PREP_TERM, 1);
}
void
rl_deprep_terminal()
{
el_set(e, EL_PREP_TERM, 0);
}
int
rl_read_init_file(const char *s)
{
return(el_source(e, s));
}
int
rl_parse_and_bind(const char *line)
{
const char **argv;
int argc;
Tokenizer *tok;
tok = tok_init(NULL);
tok_line(tok, line, &argc, &argv);
argc = el_parse(e, argc, argv);
tok_end(tok);
return (argc ? 1 : 0);
}
void
rl_stuff_char(int c)
{
char buf[2];
buf[0] = c;
buf[1] = '\0';
el_insertstr(e, buf);
}
static int
_rl_event_read_char(EditLine *el, char *cp)
{
int n, num_read = 0;
*cp = 0;
while (rl_event_hook) {
(*rl_event_hook)();
#if defined(FIONREAD)
if (ioctl(el->el_infd, FIONREAD, &n) < 0)
return(-1);
if (n)
num_read = read(el->el_infd, cp, 1);
else
num_read = 0;
#elif defined(F_SETFL) && defined(O_NDELAY)
if ((n = fcntl(el->el_infd, F_GETFL, 0)) < 0)
return(-1);
if (fcntl(el->el_infd, F_SETFL, n|O_NDELAY) < 0)
return(-1);
num_read = read(el->el_infd, cp, 1);
if (fcntl(el->el_infd, F_SETFL, n))
return(-1);
#else
/* not non-blocking, but what you gonna do? */
num_read = read(el->el_infd, cp, 1);
return(-1);
#endif
if (num_read < 0 && errno == EAGAIN)
continue;
if (num_read == 0)
continue;
break;
}
if (!rl_event_hook)
el_set(el, EL_GETCFN, EL_BUILTIN_GETCFN);
return(num_read);
}
|