Menu

[26e832]: / joe / kbd.c  Maximize  Restore  History

Download this file

460 lines (401 with data), 9.7 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
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
/*
* Key-map handler
* Copyright
* (C) 1992 Joseph H. Allen
*
* This file is part of JOE (Joe's Own Editor)
*/
#include "types.h"
struct context *contexts; /* Global list of KMAPs */
char **keymap_list; /* KMAP names array for completion */
/* Create a KBD */
KBD *mkkbd(KMAP *kmap)
{
KBD *kbd = (KBD *) joe_malloc(SIZEOF(KBD));
kbd->topmap = kmap;
kbd->curmap = kmap;
kbd->x = 0;
return kbd;
}
/* Eliminate a KBD */
void rmkbd(KBD *k)
{
joe_free(k);
}
/* Process next key for KBD */
MACRO *dokey(KBD *kbd, int n)
{
KMAP *bind;
/* If we were passed a negative character */
if (n < 0)
n += 256;
/* If we're starting from scratch, clear the keymap sequence buffer */
if (kbd->curmap == kbd->topmap)
kbd->x = 0;
/* Update cmap if src changed */
if (kbd->curmap->rtree_version != kbd->curmap->src_version) {
rtree_clr(&kbd->curmap->rtree);
rtree_init(&kbd->curmap->rtree);
/* interval_show(kbd->curmap->src); */
rtree_build(&kbd->curmap->rtree, kbd->curmap->src);
/* rtree_show(&kbd->curmap->rtree); */
rtree_opt(&kbd->curmap->rtree);
/* rtree_show(&kbd->curmap->rtree); */
kbd->curmap->rtree_version = kbd->curmap->src_version;
}
bind = (KMAP *)rtree_lookup(&kbd->curmap->rtree, n);
if (!bind)
bind = (KMAP *)kbd->curmap->dflt;
if (bind && bind->what == 1) { /* A prefix key was found */
kbd->seq[kbd->x++] = n;
kbd->curmap = bind;
bind = 0;
} else { /* A complete sequence was found */
kbd->x = 0;
kbd->curmap = kbd->topmap;
}
return (MACRO *)bind;
}
/* Return key code for key name or -1 for syntax error */
static int keyval(char *s)
{
if (s[0] == 'U' && s[1] == '+') {
return zhtoi(s + 2);
} else if (s[0] == '^' && s[1] && !s[2])
switch (s[1])
{
case '?':
return 127;
case '#':
return 0x9B;
default:
return s[1] & 0x1F;
}
else if ((s[0] == 'S' || s[0] == 's')
&& (s[1] == 'P' || s[1] == 'p') && !s[2])
return ' ';
else if((s[0]=='M'||s[0]=='m') && s[1]) {
if(!zcmp(s,"MDOWN")) return KEY_MDOWN;
else if(!zcmp(s,"MWDOWN")) return KEY_MWDOWN;
else if(!zcmp(s,"MWUP")) return KEY_MWUP;
else if(!zcmp(s,"MUP")) return KEY_MUP;
else if(!zcmp(s,"MDRAG")) return KEY_MDRAG;
else if(!zcmp(s,"M2DOWN")) return KEY_M2DOWN;
else if(!zcmp(s,"M2UP")) return KEY_M2UP;
else if(!zcmp(s,"M2DRAG")) return KEY_M2DRAG;
else if(!zcmp(s,"M3DOWN")) return KEY_M3DOWN;
else if(!zcmp(s,"M3UP")) return KEY_M3UP;
else if(!zcmp(s,"M3DRAG")) return KEY_M3DRAG;
else if(!zcmp(s,"MIDDLEDOWN")) return KEY_MIDDLEDOWN;
else if(!zcmp(s,"MIDDLEUP")) return KEY_MIDDLEUP;
else return s[0];
} else {
int ch = utf8_decode_string(s);
if (ch < 0)
ch = -1;
return ch;
}
/*
if (s[1] || !s[0])
return -1;
else
return ((unsigned char *)s)[0];
*/
}
/* Create an empty keymap */
KMAP *mkkmap(void)
{
KMAP *kmap = (KMAP *) joe_calloc(SIZEOF(KMAP), 1);
kmap->what = 1;
rtree_init(&kmap->rtree);
return kmap;
}
/* Eliminate a keymap */
void rmkmap(KMAP *kmap)
{
struct interval_list *l, *n;
if (!kmap)
return;
for (l = kmap->src; l; l = n) {
n = l->next;
if (((KMAP *)l->map)->what == 1) {
rmkmap((KMAP *)l->map);
}
joe_free(l);
}
if (kmap->dflt && ((KMAP *)kmap->dflt)->what == 1)
rmkmap((KMAP *)kmap->dflt);
rtree_clr(&kmap->rtree);
joe_free(kmap);
}
/* Parse a range */
static char *range(char *seq, int *vv, int *ww)
{
char c;
int x, v, w;
for (x = 0; seq[x] && seq[x] != ' '; ++x) ; /* Skip to a space */
c = seq[x];
seq[x] = 0; /* Zero terminate the string */
v = keyval(seq); /* Get key */
w = v;
if (w < 0)
return NULL;
seq[x] = c; /* Restore the space or 0 */
for (seq += x; *seq == ' '; ++seq) ; /* Skip over spaces */
/* Check for 'TO ' */
if ((seq[0] == 'T' || seq[0] == 't') && (seq[1] == 'O' || seq[1] == 'o') && seq[2] == ' ') {
for (seq += 2; *seq == ' '; ++seq) ; /* Skip over spaces */
for (x = 0; seq[x] && seq[x] != ' '; ++x) ; /* Skip to space */
c = seq[x];
seq[x] = 0; /* Zero terminate the string */
w = keyval(seq); /* Get key */
if (w < 0)
return NULL;
seq[x] = c; /* Restore the space or 0 */
for (seq += x; *seq == ' '; ++seq) ; /* Skip over spaces */
}
if (v > w)
return NULL;
*vv = v;
*ww = w;
return seq;
}
/* Add a binding to a keymap */
static KMAP *kbuild(CAP *cap, KMAP *kmap, char *seq, MACRO *bind, int *err, const char *capseq, ptrdiff_t seql)
{
int v, w;
if (!seql && seq[0] == '.' && seq[1]) {
int x;
char c;
const char *s;
char *iv;
for (x = 0; seq[x] && seq[x] != ' '; ++x) ;
c = seq[x];
seq[x] = 0;
#ifdef __MSDOS__
if (!zcmp(seq + 1, "ku")) {
capseq = "\0H";
seql = 2;
} else if (!zcmp(seq + 1, "kd")) {
capseq = "\0P";
seql = 2;
} else if (!zcmp(seq + 1, "kl")) {
capseq = "\0K";
seql = 2;
} else if (!zcmp(seq + 1, "kr")) {
capseq = "\0M";
seql = 2;
} else if (!zcmp(seq + 1, "kI")) {
capseq = "\0R";
seql = 2;
} else if (!zcmp(seq + 1, "kD")) {
capseq = "\0S";
seql = 2;
} else if (!zcmp(seq + 1, "kh")) {
capseq = "\0G";
seql = 2;
} else if (!zcmp(seq + 1, "kH")) {
capseq = "\0O";
seql = 2;
} else if (!zcmp(seq + 1, "kP")) {
capseq = "\0I";
seql = 2;
} else if (!zcmp(seq + 1, "kN")) {
capseq = "\0Q";
seql = 2;
} else if (!zcmp(seq + 1, "k1")) {
capseq = "\0;";
seql = 2;
} else if (!zcmp(seq + 1, "k2")) {
capseq = "\0<";
seql = 2;
} else if (!zcmp(seq + 1, "k3")) {
capseq = "\0=";
seql = 2;
} else if (!zcmp(seq + 1, "k4")) {
capseq = "\0>";
seql = 2;
} else if (!zcmp(seq + 1, "k5")) {
capseq = "\0?";
seql = 2;
} else if (!zcmp(seq + 1, "k6")) {
capseq = "\0@";
seql = 2;
} else if (!zcmp(seq + 1, "k7")) {
capseq = "\0A";
seql = 2;
} else if (!zcmp(seq + 1, "k8")) {
capseq = "\0B";
seql = 2;
} else if (!zcmp(seq + 1, "k9")) {
capseq = "\0C";
seql = 2;
} else if (!zcmp(seq + 1, "k0")) {
capseq = "\0D";
seql = 2;
}
seq[x] = c;
if (seql) {
for (seq += x; *seq == ' '; ++seq) ;
}
#else
s = jgetstr(cap, seq + 1);
seq[x] = c;
if (s && (iv = tcompile(cap, s, 0, 0, 0, 0))
&& (sLEN(iv) > 1 || (signed char)iv[0] < 0)) {
capseq = iv;
seql = sLEN(iv);
for (seq += x; *seq == ' '; ++seq) ;
}
#endif
else {
*err = -2;
return kmap;
}
}
if (seql) {
v = w = *capseq++;
--seql;
} else {
seq = range(seq, &v, &w);
if (!seq) {
*err = -1;
return kmap;
}
}
if (!kmap)
kmap = mkkmap(); /* Create new keymap if 'kmap' was NULL */
/* Make bindings between v and w */
if (v <= w) {
if (*seq || seql) {
KMAP *old = (KMAP *)interval_lookup(kmap->src, NULL, v);
if (!old || !old->what) {
kmap->src = interval_add(kmap->src, v, w, kbuild(cap, NULL, seq, bind, err, capseq, seql));
++kmap->src_version;
} else
kbuild(cap, old, seq, bind, err, capseq, seql);
} else {
kmap->src = interval_add(kmap->src, v, w, bind);
++kmap->src_version;
}
}
return kmap;
}
int kadd(CAP *cap, KMAP *kmap, char *seq, MACRO *bind)
{
int err = 0;
kbuild(cap, kmap, seq, bind, &err, NULL, 0);
return err;
}
void kcpy(KMAP *dest, KMAP *src)
{
struct interval_list *l;
for (l = src->src; l; l = l->next) {
if (((KMAP *)l->map)->what == 1) {
KMAP *k = mkkmap();
kcpy(k, (KMAP *)l->map);
dest->src = interval_add(dest->src, l->interval.first, l->interval.last, k);
++dest->src_version;
} else {
dest->src = interval_add(dest->src, l->interval.first, l->interval.last, l->map);
++dest->src_version;
}
}
}
/* Remove a binding from a keymap */
int kdel(KMAP *kmap, char *seq)
{
int err = 1;
int v, w;
seq = range(seq, &v, &w);
if (!seq)
return -1;
/* Clear bindings between v and w */
if (v <= w) {
if (*seq) {
KMAP *old = (KMAP *)interval_lookup(kmap->src, NULL, v);
if (old->what == 1) {
kdel(old, seq);
} else {
kmap->src = interval_add(kmap->src, v, w, NULL);
++kmap->src_version;
}
} else {
kmap->src = interval_add(kmap->src, v, w, NULL);
++kmap->src_version;
}
}
return err;
}
/* Find a context of a given name- if not found, one with an empty kmap
* is created.
*/
KMAP *kmap_getcontext(const char *name)
{
struct context *c;
for (c = contexts; c; c = c->next)
if (!zcmp(c->name, name))
return c->kmap;
c = (struct context *) joe_malloc(SIZEOF(struct context));
c->next = contexts;
c->name = zdup(name);
contexts = c;
return c->kmap = mkkmap();
}
/* JM - ngetcontext(name) - like getcontext, but return NULL if it
* doesn't exist, instead of creating a new one.
*/
KMAP *ngetcontext(const char *name)
{
struct context *c;
for(c=contexts;c;c=c->next)
if(!zcmp(c->name,name))
return c->kmap;
return 0;
}
/* True if KMAP is empty */
int kmap_empty(KMAP *k)
{
return k->src == NULL && k->dflt == NULL;
}
/* JM */
B *keymaphist=0;
static int dokeymap(W *w,char *s,void *object,int *notify)
{
KMAP *k=ngetcontext(s);
vsrm(s);
if(notify) *notify=1;
if(!k) {
msgnw(w,joe_gettext(_("No such keymap")));
return -1;
}
rmkbd(w->kbd);
w->kbd=mkkbd(k);
return 0;
}
static char **get_keymap_list()
{
char **lst = 0;
struct context *c;
for (c=contexts; c; c=c->next)
lst = vaadd(lst, vsncpy(NULL,0,sz(c->name)));
return lst;
}
static int keymap_cmplt(BW *bw, int k)
{
/* Reload every time: we should really check date of tags file...
if (tag_word_list)
varm(tag_word_list); */
if (!keymap_list)
keymap_list = get_keymap_list();
if (!keymap_list) {
ttputc(7);
return 0;
}
return simple_cmplt(bw,keymap_list);
}
int ukeymap(W *w, int k)
{
if (wmkpw(w,joe_gettext(_("Change keymap: ")),&keymaphist,dokeymap,"keymap",NULL,keymap_cmplt,NULL,NULL,locale_map,0)) return 0;
else return -1;
}
Want the latest updates on software, tech news, and AI?
Get latest updates about software, tech news, and AI from SourceForge directly in your inbox once a month.