Repository navigation
Expand file tree
/
Copy pathedit.c
More file actions
321 lines (237 loc) · 4.83 KB
/
Copy pathedit.c
File metadata and controls
321 lines (237 loc) · 4.83 KB
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
/*
* Copyright 2012-2017 Katherine Flavel
*
* See LICENCE for the full copyright terms.
*/
#include <cl/tree.h>
#include <assert.h>
#include <stdlib.h>
#include <string.h>
#include <ctype.h>
#include "internal.h"
struct editctx {
size_t count;
char *buf;
};
static int
append(struct editctx *ectx, const char *s)
{
const size_t blocksz = 64;
size_t n;
assert(ectx != NULL);
assert(s != NULL);
n = strlen(s);
assert(n != 0);
assert(n < blocksz);
/* TODO: check again... */
if ((ectx->count + n - 1) % blocksz < n) {
char *tmp;
tmp = realloc(ectx->buf, ectx->count + blocksz);
if (tmp == NULL) {
return -1;
}
ectx->buf = tmp;
}
memcpy(ectx->buf + ectx->count, s, n + 1);
ectx->count += n;
return 0;
}
struct editctx *
edit_create(void)
{
struct editctx *new;
new = malloc(sizeof *new);
if (new == NULL) {
return NULL;
}
new->count = 0;
new->buf = NULL;
return new;
}
void
edit_destroy(struct editctx *ectx)
{
assert(ectx != NULL);
free(ectx->buf);
free(ectx);
}
char *
edit_release(struct editctx *ectx)
{
char *p;
assert(ectx != NULL);
if (ectx->count == 0) {
return NULL;
}
p = ectx->buf;
ectx->count = 0;
ectx->buf = NULL;
return p;
}
static int
edit_backspace(struct cl_peer *p, size_t n)
{
assert(p != NULL);
assert(p->ectx != NULL);
assert(n > 0);
if (p->ectx->count == 0) {
return 0;
}
/* XXX: this should walk back n unicode characters worth, not just n bytes */
assert(p->ectx->buf != NULL);
assert(p->ectx->count >= n);
p->ectx->count -= n;
p->ectx->buf[p->ectx->count] = '\0';
if (n == 1) {
if (-1 == p->chctx->ioapi->send(p, p->chctx + 0, OUT_BACKSPACE_AND_DELETE)) {
return -1;
}
return 0;
}
/* XXX: placeholder for "go left X characters and delete to EOL */
while (n-- > 0) {
if (-1 == p->chctx->ioapi->send(p, p->chctx + 0, OUT_BACKSPACE_AND_DELETE)) {
return -1;
}
}
return 0;
}
static int
edit_backword(struct cl_peer *p)
{
struct lex_tok tok[2];
const char *src;
size_t i;
assert(p != NULL);
assert(p->ectx != NULL);
if (p->ectx->count == 0) {
return 0;
}
assert(p->ectx->buf != NULL);
src = p->ectx->buf;
tok[0].src.start = tok[0].src.end = src;
tok[1].src.start = tok[1].src.end = src;
for (i = 0; lex_next(&tok[i], &src, NULL) != NULL; i = !i) {
if (tok[i].type == TOK_ERROR) {
break;
}
}
/* leave a single trailing space if we're just deleting one
* token, as long as it's not SOL */
if (tok[i].src.end != tok[i].src.start) {
tok[i].src.end += isspace((unsigned char) *tok[i].src.end);
}
return edit_backspace(p, strlen(tok[i].src.end));
}
static const struct trie *
edit_walk(struct cl_peer *p, const struct trie *trie, const char *src)
{
struct lex_tok tok;
assert(p != NULL);
assert(trie != NULL);
if (p->ectx->count == 0) {
return trie;
}
assert(src != NULL);
while (lex_next(&tok, &src, NULL) != NULL) {
const struct trie *t;
if (tok.type != TOK_WORD) {
break;
}
t = trie_walk(trie, tok.src.start, tok.src.end - tok.src.start);
if (t == NULL) {
break;
}
trie = t;
t = trie_walk(trie, " ", 1);
if (t == NULL) {
break;
}
trie = t;
}
assert(trie != NULL);
return trie;
}
int
edit_push(struct cl_peer *p, const struct cl_event *event, enum edit_flags flags)
{
assert(p != NULL);
assert(p->tree != NULL);
assert(p->tree->root != NULL);
assert(p->ectx != NULL);
assert(event != NULL);
switch (event->type) {
case UI_CODEPOINT:
break;
case UI_BACKSPACE:
return edit_backspace(p, 1);
case UI_DELETE_LINE:
return edit_backspace(p, p->ectx->count);
case UI_DELETE_WORD:
return edit_backword(p);
case UI_DELETE:
case UI_DELETE_TO_EOL:
case UI_CANCEL: /* ^C to abort current command */
/* TODO: not implemented */
return 0;
case UI_HIST_PREV:
case UI_HIST_NEXT:
if (~flags & EDIT_HIST) {
return 0;
}
/* TODO: not implemented */
return 0;
case UI_CURSOR_LEFT:
case UI_CURSOR_RIGHT:
case UI_CURSOR_LEFT_WORD:
case UI_CURSOR_RIGHT_WORD:
case UI_CURSOR_EOL:
case UI_CURSOR_SOL:
if (~flags & EDIT_ECHO) {
return 0;
}
/* TODO: not implemented */
return 0;
case UI_HELP:
if (~flags & EDIT_TRIE) {
return 0;
}
cl_printf(p, "?\n");
trie_help(p, edit_walk(p, p->tree->root, p->ectx->buf), p->mode);
{
p->tree->printprompt(p, p->mode);
if (p->ectx->count > 0) {
cl_printf(p, "%s", p->ectx->buf);
}
}
return 0;
}
switch (event->u.utf8[0]) {
case '\0':
case '\r':
case '\033':
return 0;
case '\n':
return 1;
case '\t':
if (flags & EDIT_TRIE) {
/* TODO: tab completion not implemented */
}
return 0;
case '?':
if (flags & EDIT_TRIE) {
struct cl_event e;
e.type = UI_HELP;
return edit_push(p, &e, flags);
}
/* FALLTHROUGH */
default:
if (flags & EDIT_ECHO) {
cl_printf(p, "%s", event->u.utf8);
}
if (-1 == append(p->ectx, event->u.utf8)) {
return -1;
}
return 0;
}
}