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
|
/* Copyright (C) 2020 C. McEnroe <june@causal.agency>
*
* This program 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 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <https://www.gnu.org/licenses/>.
*/
#include <assert.h>
#include <limits.h>
#include <stdio.h>
#include <stdlib.h>
#include <wchar.h>
#include "chat.h"
enum { Cap = 512 };
static wchar_t buf[Cap];
static size_t len;
static size_t pos;
char *editBuffer(size_t *mbsPos) {
static char mbs[MB_LEN_MAX * Cap];
const wchar_t *ptr = buf;
size_t mbsLen = wcsnrtombs(mbs, &ptr, pos, sizeof(mbs) - 1, NULL);
assert(mbsLen != (size_t)-1);
if (mbsPos) *mbsPos = mbsLen;
ptr = &buf[pos];
size_t n = wcsnrtombs(
&mbs[mbsLen], &ptr, len - pos, sizeof(mbs) - mbsLen - 1, NULL
);
assert(n != (size_t)-1);
mbsLen += n;
mbs[mbsLen] = '\0';
return mbs;
}
static void reserve(size_t index, size_t count) {
if (len + count > Cap) return;
memmove(&buf[index + count], &buf[index], sizeof(*buf) * (len - index));
len += count;
}
static void delete(size_t index, size_t count) {
if (index + count > len) return;
memmove(
&buf[index], &buf[index + count], sizeof(*buf) * (len - index - count)
);
len -= count;
}
void edit(size_t id, enum Edit op, wchar_t ch) {
switch (op) {
break; case EditHome: pos = 0;
break; case EditEnd: pos = len;
break; case EditLeft: if (pos) pos--;
break; case EditRight: if (pos < len) pos++;
break; case EditKill: len = pos = 0;
break; case EditErase: if (pos) delete(--pos, 1);
break; case EditInsert: {
reserve(pos, 1);
if (pos < Cap) buf[pos++] = ch;
}
break; case EditComplete: {
// TODO
}
break; case EditEnter: {
pos = 0;
command(id, editBuffer(NULL));
len = 0;
}
}
}
|