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
|
#include <readline.h>
#include <stdlib.h>
char* freadln(FILE f) {
fprint(f, "\x1b[e"); // enable keyboard echo
int i;
char *p = (char*)malloc(256);
char *b = p;
while (1) {
int l = read(f, 0, 255, b);
if (l < 0) {
free(b);
return 0;
}
for (i = 0; i < l; i++) {
if (b[i] == '\n') {
b[i+1] = 0;
return p;
} else if (b[i] == 27) { // ignore escape sequences
b[i] = 0;
l = i;
}
}
int d = b - p + l;
char* newp = (char*)malloc(d + 256);
memcpy(newp, p, d);
free(p);
p = newp;
b = p + d;
}
}
char* readln() {
return freadln(term);
}
// ** READLINE
char *freadline(FILE f, readline_history *h) {
int i;
fprint(f, "\x1b[h"); // disable keyboard echo
if (h->str == 0) {
h->str = (char**)malloc(h->max * sizeof(char*));
for (i = 0; i < h->max; i++) h->str[i] = 0;
h->n = 0;
}
int lid;
if (h->n < h->max) {
lid = h->n++;
} else {
free(h->str[0]);
int i;
for (i = 0; i < h->max - 1; i++) {
h->str[i] = h->str[i+1];
}
lid = h->max - 1;
h->str[lid] = 0;
}
if (h->str[lid] == 0) h->str[lid] = (char*)malloc(256);
char *str = h->str[lid];
str[0] = 0;
char *cur = str; // position in string
int len = 0; // string length
while (1) {
int finished = 0;
int te = cur - str;
char buf[16];
int l = read(f, 0, 16, buf);
if (l < 0) return 0;
char *in = buf;
while (in < buf + l) {
if (*in == 27) {
in++;
if (*in == '[') {
in++;
if (*in == 'A') { // up
if (lid > 0) {
lid--;
str = h->str[lid];
len = strlen(str);
cur = str + len;
}
} else if (*in == 'B') { // down
if (lid < h->n - 1) {
lid++;
str = h->str[lid];
len = strlen(str);
cur = str + len;
}
} else if (*in == 'C') { // forward (right)
if (cur < str + len) cur++;
} else if (*in == 'D') { // back (left)
if (cur > str) cur--;
}
} else {
// ALT sequence - ignore
in++;
}
} else if (*in == '\n') {
finished = 1;
cur = str + len;
} else if (*in == '\b') {
if (cur > str) {
cur--;
len--;
char* c;
for (c = cur; *c != 0; c++) c[0] = c[1];
}
} else if (*in == '\t') {
// ignore tabs -- todo: tab completion???? haha
} else if (*in >= ' ') {
if (l < 255) {
char* c;
for (c = cur + len; c >= cur; c--) c[1] = c[0];
cur[0] = *in;
cur++;
len++;
}
}
in++;
}
// ASSUMPTION : everything will fit on one line...
if (te > 0) fprintf(f, "\x1b[%iD", te);
fprintf(f, "\x1b[K%s", str);
te = len - (cur - str);
if (te > 0) fprintf(f, "\x1b[%iD", te);
if (finished) {
fprintf(f, "\n");
if (h->str[h->n-1] != str) h->n--;
i = h->n - 1;
while (h->str[i] != str) {
if (i == 0) {
fprint(f, "readline: internal error");
return 0;
}
i--;
}
while (i < h->n - 1) {
h->str[i] = h->str[i+1];
i++;
}
h->str[i] = str;
if (h->str[h->n-1][0] == 0) h->n--;
return str;
}
}
}
|
