-
Notifications
You must be signed in to change notification settings - Fork 51
/
hist.c
1650 lines (1384 loc) · 38.9 KB
/
hist.c
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
/*
* hist - interactive readline module
*
* Copyright (C) 1999-2007,2021-2023 David I. Bell
*
* Calc is open software; you can redistribute it and/or modify it under
* the terms of the version 2.1 of the GNU Lesser General Public License
* as published by the Free Software Foundation.
*
* Calc 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 Lesser General
* Public License for more details.
*
* A copy of version 2.1 of the GNU Lesser General Public License is
* distributed with calc under the filename COPYING-LGPL. You should have
* received a copy with calc; if not, write to Free Software Foundation, Inc.
* 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*
* Under source code control: 1993/05/02 20:09:19
* File existed as early as: 1993
*
* Share and enjoy! :-) http://www.isthe.com/chongo/tech/comp/calc/
*/
/*
* Adapted from code written by Stephen Rothwell.
*
* GNU readline support added by Martin Buck <mbuck at debian dot org>
*
* Interactive readline module. This is called to read lines of input,
* while using emacs-like editing commands within a command stack.
* The key bindings for the editing commands are (slightly) configurable.
*/
#include <stdio.h>
#include <ctype.h>
#if !defined(_WIN32) && !defined(_WIN64)
# include <pwd.h>
#endif
#include "have_unistd.h"
#if defined(HAVE_UNISTD_H)
#include <unistd.h>
#endif
#include "have_stdlib.h"
#if defined(HAVE_STDLIB_H)
#include <stdlib.h>
#endif
#include "calc.h"
#include "lib_calc.h"
#include "alloc.h"
#include "hist.h"
#include "strl.h"
#include "have_strdup.h"
#if !defined(HAVE_STRDUP)
# define strdup(x) calc_strdup((CONST char *)(x))
#endif /* HAVE_STRDUP */
#include "have_string.h"
#ifdef HAVE_STRING_H
# include <string.h>
#endif
#include "have_unused.h"
#include "errtbl.h"
#include "banned.h" /* include after system header <> includes */
#define MIN(a,b) (((a) <= (b)) ? (a) : (b))
#if !defined(USE_READLINE)
E_FUNC FILE *curstream(void);
#define STDIN 0
#define SAVE_SIZE 256 /* size of save buffer */
#define MAX_KEYS 60 /* number of key bindings */
#define CONTROL(x) ((char)(((int)(x)) & 0x1f))
STATIC struct {
char *prompt;
char *buf;
char *pos;
char *end;
char *mark;
int bufsize;
int linelen;
int histcount; /* valid history entries */
int curhist;
bool virgin_line; /* 1 => never typed chars, 0 => chars typed */
} HS;
typedef void (*FUNCPTR)(int);
typedef struct {
char *name;
FUNCPTR func;
} FUNC;
/* declare binding functions */
S_FUNC void flush_input(int key);
S_FUNC void start_of_line(int key);
S_FUNC void end_of_line(int key);
S_FUNC void forward_char(int key);
S_FUNC void backward_char(int key);
S_FUNC void forward_word(int key);
S_FUNC void backward_word(int key);
S_FUNC void delete_char(int key);
S_FUNC void forward_kill_char(int key);
S_FUNC void backward_kill_char(int key);
S_FUNC void forward_kill_word(int key);
S_FUNC void kill_line(int key);
S_FUNC void new_line(int key);
S_FUNC void save_line(int key);
S_FUNC void forward_history(int key);
S_FUNC void backward_history(int key);
S_FUNC void insert_char(int key);
S_FUNC void goto_line(int key);
S_FUNC void list_history(int key);
S_FUNC void refresh_line(int key);
S_FUNC void swap_chars(int key);
S_FUNC void set_mark(int key);
S_FUNC void yank(int key);
S_FUNC void save_region(int key);
S_FUNC void kill_region(int key);
S_FUNC void reverse_search(int key);
S_FUNC void quote_char(int key);
S_FUNC void uppercase_word(int key);
S_FUNC void lowercase_word(int key);
S_FUNC void ignore_char(int key);
S_FUNC void arrow_key(int key);
S_FUNC void quit_calc(int key) __attribute__((noreturn));
STATIC FUNC funcs[] =
{
{"ignore-char", ignore_char},
{"flush-input", flush_input},
{"start-of-line", start_of_line},
{"end-of-line", end_of_line},
{"forward-char", forward_char},
{"backward-char", backward_char},
{"forward-word", forward_word},
{"backward-word", backward_word},
{"delete-char", delete_char},
{"forward-kill-char", forward_kill_char},
{"backward-kill-char", backward_kill_char},
{"forward-kill-word", forward_kill_word},
{"uppercase-word", uppercase_word},
{"lowercase-word", lowercase_word},
{"kill-line", kill_line},
{"goto-line", goto_line},
{"new-line", new_line},
{"save-line", save_line},
{"forward-history", forward_history},
{"backward-history", backward_history},
{"insert-char", insert_char},
{"list-history", list_history},
{"refresh-line", refresh_line},
{"swap-chars", swap_chars},
{"set-mark", set_mark},
{"yank", yank},
{"save-region", save_region},
{"kill-region", kill_region},
{"reverse-search", reverse_search},
{"quote-char", quote_char},
{"arrow-key", arrow_key},
{"quit", quit_calc},
{NULL, NULL}
};
typedef struct key_ent KEY_ENT;
typedef struct key_map KEY_MAP;
struct key_ent {
FUNCPTR func;
KEY_MAP *next;
};
struct key_map {
char *name;
KEY_ENT default_ent;
KEY_ENT *map[256];
};
STATIC char base_map_name[] = "base-map";
STATIC char esc_map_name[] = "esc-map";
STATIC KEY_MAP maps[] = {
{base_map_name, {NULL, NULL}, {NULL, NULL}},
{esc_map_name, {NULL, NULL}, {NULL, NULL}},
};
typedef struct history_entry {
int len; /* length of data */
char *data; /* varying length data */
struct history_entry* prev;
struct history_entry* next;
} HIST;
STATIC int inited;
STATIC int canedit;
STATIC int key_count;
STATIC int save_len;
STATIC KEY_MAP *cur_map;
STATIC KEY_MAP *base_map;
STATIC KEY_ENT key_table[MAX_KEYS];
STATIC HIST* hist_first = NULL;
STATIC HIST* hist_last = NULL;
STATIC char save_buffer[SAVE_SIZE];
/* declare other static functions */
S_FUNC FUNCPTR find_func(char *name);
S_FUNC HIST *get_event(int n);
S_FUNC HIST *find_event(char *pat, int len);
S_FUNC void read_key(void);
S_FUNC void erasechar(void);
S_FUNC void newline(void);
S_FUNC void backspace(void);
S_FUNC void beep(void);
S_FUNC void echo_char(int ch);
S_FUNC void echo_string(char *str, int len);
S_FUNC void savetext(char *str, int len);
S_FUNC void memrcpy(char *dest, char *src, int len);
S_FUNC int read_bindings(FILE *fp);
S_FUNC int in_word(int ch);
S_FUNC KEY_MAP *find_map(char *map);
S_FUNC void unbind_key(KEY_MAP *map, int key);
S_FUNC void raw_bind_key(KEY_MAP *map, int key,
FUNCPTR func, KEY_MAP *next_map);
S_FUNC KEY_MAP *do_map_line(char *line);
S_FUNC void do_default_line(KEY_MAP *map, char *line);
S_FUNC void do_bind_line(KEY_MAP *map, char *line);
S_FUNC void back_over_char(int ch);
S_FUNC void echo_rest_of_line(void);
S_FUNC void goto_start_of_line(void);
S_FUNC void goto_end_of_line(void);
S_FUNC void remove_char(int ch);
S_FUNC void decrement_end(int n);
S_FUNC void insert_string(char *str, int len);
/*
* Read a line into the specified buffer. The line ends in a newline,
* and is NULL terminated. Returns the number of characters read, or
* zero on an end of file or error. The prompt is printed before reading
* the line.
*/
size_t
hist_getline(char *prompt, char *buf, size_t len)
{
/*
* initialize if we have not already done so
*/
if (!inited)
(void) hist_init(calcbindings);
/*
* establish the beginning of a line condition
*/
HS.prompt = prompt;
HS.bufsize = len - 2;
HS.buf = buf;
HS.pos = buf;
HS.end = buf;
HS.mark = NULL;
HS.linelen = -1;
HS.virgin_line = true;
/*
* prep the I/O
*/
fputs(prompt, stdout);
fflush(stdout);
/*
* special case: non-interactive editing
*/
if (!canedit) {
if (fgets(buf, len, stdin) == NULL)
return 0;
return strlen(buf);
}
/*
* get the line
*/
while (HS.linelen < 0) {
/* get the next char */
read_key();
/* chars typed, no longer virgin */
HS.virgin_line = false;
}
/*
* return the line
*/
return HS.linelen;
}
/*
* Initialize the module by reading in the key bindings from the specified
* filename, and then setting the terminal modes for noecho and cbreak mode.
* If the supplied filename is NULL, then a default filename will be used.
* We will search the CALCPATH for the file.
*
* Returns zero if successful, or a nonzero error code if unsuccessful.
* If this routine fails, hist_getline, hist_saveline, and hist_term can
* still be called but all fancy editing is disabled.
*/
int
hist_init(char *filename)
{
/*
* prevent multiple initializations
*/
if (inited) {
if (conf->calc_debug & CALCDBG_TTY)
printf("hist_init: inited already set\n");
return HIST_INITED;
}
/*
* setup
*/
inited = 1;
canedit = 0;
if (conf->calc_debug & CALCDBG_TTY)
printf("hist_init: Set inited, cleared canedit\n");
/*
* open the bindings file
*/
if (filename == NULL)
filename = HIST_BINDING_FILE;
if (opensearchfile(filename, calcpath, NULL, false) > 0)
return HIST_NOFILE;
/*
* load the bindings
*/
if (read_bindings(curstream()))
return HIST_NOFILE;
/*
* close the bindings
*/
closeinput();
/*
* setup the calc TTY on STDIN
*/
if (!calc_tty(STDIN)) {
return HIST_NOTTY;
}
canedit = 1;
if (conf->calc_debug & CALCDBG_TTY)
printf("hist_init: Set canedit\n");
return HIST_SUCCESS;
}
/*
* Reset the terminal modes just before exiting.
*/
void
hist_term(void)
{
if (!inited || !canedit) {
if (conf->calc_debug & CALCDBG_TTY) {
if (!inited)
printf("hist_term: inited already cleared\n");
if (!canedit)
printf("hist_term: canedit already cleared\n");
}
inited = 0;
if (conf->calc_debug & CALCDBG_TTY)
printf("hist_term: Cleared inited\n");
return;
}
if (hist_first) {
HIST* hp = hist_first;
HIST* next;
while(hp) {
next = hp->next;
free(hp->data);
free(hp);
hp = next;
}
}
hist_first = NULL;
hist_last = NULL;
/*
* restore original tty state
*/
(void) orig_tty(STDIN);
}
S_FUNC KEY_MAP *
find_map(char *map)
{
unsigned int i;
for (i = 0; i < sizeof(maps) / sizeof(maps[0]); i++) {
if (strcmp(map, maps[i].name) == 0)
return &maps[i];
}
return NULL;
}
S_FUNC void
unbind_key(KEY_MAP *map, int key)
{
map->map[key] = NULL;
}
S_FUNC void
raw_bind_key(KEY_MAP *map, int key, FUNCPTR func, KEY_MAP *next_map)
{
if (map->map[key] == NULL) {
if (key_count >= MAX_KEYS)
return;
map->map[key] = &key_table[key_count++];
}
map->map[key]->func = func;
map->map[key]->next = next_map;
}
S_FUNC KEY_MAP *
do_map_line(char *line)
{
char *cp;
char *map_name;
cp = line;
while (isspace((int)*cp))
cp++;
if (*cp == '\0')
return NULL;
map_name = cp;
while ((*cp != '\0') && !isspace((int)*cp))
cp++;
*cp = '\0';
return find_map(map_name);
}
S_FUNC void
do_bind_line(KEY_MAP *map, char *line)
{
char *cp;
char key;
char *func_name;
char *next_name;
KEY_MAP *next;
FUNCPTR func;
if (map == NULL)
return;
cp = line;
key = *cp++;
if (*cp == '\0') {
unbind_key(map, key);
return;
}
if (key == '^') {
if (*cp == '?') {
key = 0177;
cp++;
} else {
key = CONTROL(*cp++);
}
} else if (key == '\\') {
key = *cp++;
}
while (isspace((int)*cp))
cp++;
if (*cp == '\0') {
unbind_key(map, key);
return;
}
func_name = cp;
while ((*cp != '\0') && !isspace((int)*cp))
cp++;
if (*cp) {
*cp++ = '\0';
while (isspace((int)*cp))
cp++;
}
func = find_func(func_name);
if (func == NULL) {
fprintf(stderr, "Unknown function \"%s\"\n", func_name);
return;
}
if (*cp == '\0') {
next = map->default_ent.next;
if (next == NULL)
next = base_map;
} else {
next_name = cp;
while ((*cp != '\0') && !isspace((int)*cp))
cp++;
if (*cp) {
*cp++ = '\0';
while (isspace((int)*cp))
cp++;
}
next = find_map(next_name);
if (next == NULL)
return;
}
raw_bind_key(map, key, func, next);
}
S_FUNC void
do_default_line(KEY_MAP *map, char *line)
{
char *cp;
char *func_name;
char *next_name;
KEY_MAP *next;
FUNCPTR func;
if (map == NULL)
return;
cp = line;
while (isspace((int)*cp))
cp++;
if (*cp == '\0')
return;
func_name = cp;
while ((*cp != '\0') && !isspace((int)*cp))
cp++;
if (*cp != '\0') {
*cp++ = '\0';
while (isspace((int)*cp))
cp++;
}
func = find_func(func_name);
if (func == NULL)
return;
if (*cp == '\0') {
next = map;
} else {
next_name = cp;
while ((*cp != '\0') && !isspace((int)*cp))
cp++;
if (*cp != '\0') {
*cp++ = '\0';
while (isspace((int)*cp))
cp++;
}
next = find_map(next_name);
if (next == NULL)
return;
}
map->default_ent.func = func;
map->default_ent.next = next;
}
/*
* Read bindings from specified open file.
*
* Returns nonzero on error.
*/
S_FUNC int
read_bindings(FILE *fp)
{
char *cp;
KEY_MAP *input_map;
char line[BUFSIZ+1];
base_map = find_map(base_map_name);
cur_map = base_map;
input_map = base_map;
if (fp == NULL)
return 1;
while (fgets(line, sizeof(line) - 1, fp)) {
line[BUFSIZ] = '\0';
cp = line;
while (isspace((int)*cp))
cp++;
if ((*cp == '\0') || (*cp == '#') || (*cp == '\n'))
continue;
if (cp[strlen(cp) - 1] == '\n')
cp[strlen(cp) - 1] = '\0';
if (memcmp(cp, "map", 3) == 0)
input_map = do_map_line(&cp[3]);
else if (memcmp(cp, "default", 7) == 0)
do_default_line(input_map, &cp[7]);
else
do_bind_line(input_map, cp);
}
return 0;
}
S_FUNC void
read_key(void)
{
KEY_ENT *ent;
int key;
fflush(stdout);
key = fgetc(stdin);
if (key == EOF) {
HS.linelen = 0;
HS.buf[0] = '\0';
return;
}
ent = cur_map->map[key];
if (ent == NULL)
ent = &cur_map->default_ent;
if (ent->next)
cur_map = ent->next;
if (ent->func != NULL) {
(*ent->func)(key);
} else {
insert_char(key);
}
}
/*
* Return the Nth history event, indexed from zero.
* Earlier history events are lower in number.
*/
S_FUNC HIST *
get_event(int n)
{
register HIST * hp = hist_first;
int i = 0;
do {
if(!hp)
break;
if(i == n)
return hp;
++i;
hp = hp->next;
} while(hp);
return NULL;
}
/*
* Search the history list for the specified pattern.
* Returns the found history, or NULL.
*/
S_FUNC HIST *
find_event(char *pat, int len)
{
register HIST * hp = hist_first;
for(hp = hist_first; hp != NULL; hp = hp->next) {
if ((hp->len == len) && (memcmp(hp->data, pat, len) == 0))
return hp;
}
return NULL;
}
/*
* Insert a line into the end of the history table.
* If the line already appears in the table, then it is moved to the end.
* If the table is full, then the earliest commands are deleted as necessary.
* Warning: the incoming line cannot point into the history table.
*/
void
hist_saveline(char *line, int len)
{
HIST * hp;
if ((len > 0) && (line[len - 1] == '\n'))
len--;
if (len <= 0)
return;
/*
* See if the line is already present in the history table.
* If so, and it is already at the end, then we are all done.
* Otherwise delete it since we will reinsert it at the end.
*/
hp = find_event(line, len);
if (hp) {
if (hp == hist_last)
return;
if (hp->prev)
hp->prev->next = hp->next;
hp->next->prev = hp->prev;
hist_last->next = hp;
hp->next = NULL;
hp->prev = hist_last;
hist_last = hp;
return;
}
/*
* If there is not enough room left in the history buffer to add
* the new command, then repeatedly delete the earliest command
* as many times as necessary in order to make enough room.
*/
if (HS.histcount >= HIST_SIZE) {
HIST *new_first = hist_first->next;
free(hist_first->data);
free(hist_first);
new_first->prev = NULL;
hist_first = new_first;
HS.histcount--;
}
/*
* Add the line to the end of the history table.
*/
hp = malloc(sizeof(HIST));
if (hp == NULL) {
fprintf(stderr,
"Out of memory adding line to the history table #0\n");
return;
}
hp->next = NULL;
hp->prev = NULL;
hp->len = len;
hp->data = malloc(len);
if (hp->data == NULL) {
fprintf(stderr,
"Out of memory adding line to the history table #1\n");
return;
}
memcpy(hp->data, line, len);
HS.curhist = ++HS.histcount;
if (!hist_first)
hist_first = hp;
if (!hist_last)
hist_last = hp;
else {
hist_last->next = hp;
hp->prev = hist_last;
hist_last = hp;
}
}
/*
* Find the function for a specified name.
*/
S_FUNC FUNCPTR
find_func(char *name)
{
FUNC *fp;
for (fp = funcs; fp->name; fp++) {
if (strcmp(fp->name, name) == 0)
return fp->func;
}
return NULL;
}
S_FUNC void
arrow_key(int UNUSED(key))
{
switch (fgetc(stdin)) {
case 'A':
backward_history(0);
break;
case 'B':
forward_history(0);
break;
case 'C':
forward_char(0);
break;
case 'D':
backward_char(0);
break;
}
}
S_FUNC void
back_over_char(int ch)
{
backspace();
if (!isprint(ch))
backspace();
}
S_FUNC void
remove_char(int ch)
{
erasechar();
if (!isprint(ch))
erasechar();
}
S_FUNC void
echo_rest_of_line(void)
{
echo_string(HS.pos, HS.end - HS.pos);
}
S_FUNC void
goto_start_of_line(void)
{
while (HS.pos > HS.buf)
back_over_char((int)(*--HS.pos));
}
S_FUNC void
goto_end_of_line(void)
{
echo_rest_of_line();
HS.pos = HS.end;
}
S_FUNC void
decrement_end(int n)
{
HS.end -= n;
if (HS.mark && (HS.mark > HS.end))
HS.mark = NULL;
}
S_FUNC void
ignore_char(int UNUSED(key))
{
}
S_FUNC void
flush_input(int UNUSED(key))
{
echo_rest_of_line();
while (HS.end > HS.buf)
remove_char((int)(*--HS.end));
HS.pos = HS.buf;
HS.mark = NULL;
}
S_FUNC void
start_of_line(int UNUSED(key))
{
goto_start_of_line();
}
S_FUNC void
end_of_line(int UNUSED(key))
{
goto_end_of_line();
}
S_FUNC void
forward_char(int UNUSED(key))
{
if (HS.pos < HS.end)
echo_char(*HS.pos++);
}
S_FUNC void
backward_char(int UNUSED(key))
{
if (HS.pos > HS.buf)
back_over_char((int)(*--HS.pos));
}
S_FUNC void
uppercase_word(int UNUSED(key))
{
while ((HS.pos < HS.end) && !in_word((int)(*HS.pos)))
echo_char(*HS.pos++);
while ((HS.pos < HS.end) && in_word((int)(*HS.pos))) {
if ((*HS.pos >= 'a') && (*HS.pos <= 'z'))
*HS.pos += 'A' - 'a';
echo_char(*HS.pos++);
}
}
S_FUNC void
lowercase_word(int UNUSED(key))
{
while ((HS.pos < HS.end) && !in_word((int)(*HS.pos)))
echo_char(*HS.pos++);
while ((HS.pos < HS.end) && in_word((int)(*HS.pos))) {
if ((*HS.pos >= 'A') && (*HS.pos <= 'Z'))
*HS.pos += 'a' - 'A';
echo_char(*HS.pos++);
}
}
S_FUNC void
forward_word(int UNUSED(key))
{
while ((HS.pos < HS.end) && !in_word((int)(*HS.pos)))
echo_char(*HS.pos++);
while ((HS.pos < HS.end) && in_word((int)(*HS.pos)))
echo_char(*HS.pos++);
}
S_FUNC void
backward_word(int UNUSED(key))
{
if ((HS.pos > HS.buf) && in_word((int)(*HS.pos)))
back_over_char((int)(*--HS.pos));
while ((HS.pos > HS.buf) && !in_word((int)(*HS.pos)))
back_over_char((int)(*--HS.pos));
while ((HS.pos > HS.buf) && in_word((int)(*HS.pos)))
back_over_char((int)(*--HS.pos));
if ((HS.pos < HS.end) && !in_word((int)(*HS.pos)))
echo_char(*HS.pos++);
}
S_FUNC void
forward_kill_char(int UNUSED(key))
{
int rest;
char ch;
rest = HS.end - HS.pos;
if (rest-- <= 0)
return;
ch = *HS.pos;
if (rest > 0) {
memcpy(HS.pos, HS.pos + 1, rest);
*(HS.end - 1) = ch;
}
echo_rest_of_line();
remove_char((int)ch);
decrement_end(1);
while (rest > 0)
back_over_char((int)(HS.pos[--rest]));
}
S_FUNC void
delete_char(int UNUSED(key))
{
/*
* quit delete_char (usually ^D) is at start of line and we are allowed
*
* We exit of start of line and config("ctrl_d", "empty") or
* if config("ctrl_d", "virgin") and we have never typed on the line.
*/
if ((HS.end == HS.buf) &&
(conf->ctrl_d == CTRL_D_EMPTY_EOF ||
(conf->ctrl_d == CTRL_D_VIRGIN_EOF && HS.virgin_line == true))) {