1 /*@ S-nail - a mail user agent derived from Berkeley Mail.
4 * Copyright (c) 2000-2004 Gunnar Ritter, Freiburg i. Br., Germany.
5 * Copyright (c) 2012 - 2013 Steffen "Daode" Nurpmeso <sdaoden@users.sf.net>.
8 * Copyright (c) 1980, 1993
9 * The Regents of the University of California. All rights reserved.
11 * Redistribution and use in source and binary forms, with or without
12 * modification, are permitted provided that the following conditions
14 * 1. Redistributions of source code must retain the above copyright
15 * notice, this list of conditions and the following disclaimer.
16 * 2. Redistributions in binary form must reproduce the above copyright
17 * notice, this list of conditions and the following disclaimer in the
18 * documentation and/or other materials provided with the distribution.
19 * 3. All advertising materials mentioning features or use of this software
20 * must display the following acknowledgement:
21 * This product includes software developed by the University of
22 * California, Berkeley and its contributors.
23 * 4. Neither the name of the University nor the names of its contributors
24 * may be used to endorse or promote products derived from this software
25 * without specific prior written permission.
27 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
28 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
29 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
30 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
31 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
32 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
33 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
34 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
35 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
36 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
41 * Copyright (c) 2013 Steffen "Daode" Nurpmeso <sdaoden@users.sf.net>.
43 * Permission to use, copy, modify, and/or distribute this software for any
44 * purpose with or without fee is hereby granted, provided that the above
45 * copyright notice and this permission notice appear in all copies.
47 * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
48 * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
49 * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
50 * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
51 * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
52 * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
53 * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
56 #ifndef HAVE_AMALGAMATION
61 # include <readline/readline.h>
63 # include <readline/history.h>
65 #elif defined HAVE_EDITLINE
66 # include <histedit.h>
69 /* Shared history support macros */
71 # define _CL_HISTFILE(S) \
73 S = voption("NAIL_HISTFILE");\
75 S = fexpand(S, FEXP_LOCAL);\
77 # define _CL_HISTSIZE(V) \
79 char const *__sv = voption("NAIL_HISTSIZE");\
81 if (__sv == NULL || *__sv == '\0' ||\
82 (__rv = strtol(__sv, NULL, 10)) == 0)\
89 # define _CL_CHECK_ADDHIST(S,NOACT) \
100 #endif /* HAVE_HISTORY */
102 /* fexpand() flags for expand-on-tab */
103 #define _CL_TAB_FEXP_FL (FEXP_FULL | FEXP_SILENT | FEXP_MULTIOK)
106 * Because we have multiple identical implementations, change file layout a bit
107 * and place the implementations one after the other below the other externals
111 yorn(char const *msg
)
115 if (!(options
& OPT_INTERACTIVE
))
117 do if ((cp
= readstr_input(msg
, NULL
)) == NULL
)
119 while (*cp
!= 'y' && *cp
!= 'Y' && *cp
!= 'n' && *cp
!= 'N');
120 return (*cp
== 'y' || *cp
== 'Y');
124 getuser(char const *query
)
129 query
= tr(509, "User: ");
131 if (readline_input(LNED_NONE
, query
, &termios_state
.ts_linebuf
,
132 &termios_state
.ts_linesize
) >= 0)
133 user
= termios_state
.ts_linebuf
;
134 termios_state_reset();
139 getpassword(char const *query
) /* FIXME encaps ttystate signal safe */
145 query
= tr(510, "Password: ");
146 fputs(query
, stdout
);
150 * FIXME everywhere: tcsetattr() generates SIGTTOU when we're not in
151 * foreground pgrp, and can fail with EINTR!!
153 if (options
& OPT_TTYIN
) {
154 tcgetattr(STDIN_FILENO
, &termios_state
.ts_tios
);
155 memcpy(&tios
, &termios_state
.ts_tios
, sizeof tios
);
156 termios_state
.ts_needs_reset
= TRU1
;
157 tios
.c_iflag
&= ~(ISTRIP
);
158 tios
.c_lflag
&= ~(ECHO
| ECHOE
| ECHOK
| ECHONL
);
159 tcsetattr(STDIN_FILENO
, TCSAFLUSH
, &tios
);
162 if (readline_restart(stdin
, &termios_state
.ts_linebuf
,
163 &termios_state
.ts_linesize
, 0) >= 0)
164 pass
= termios_state
.ts_linebuf
;
165 termios_state_reset();
167 if (options
& OPT_TTYIN
)
173 getcredentials(char **user
, char **pass
)
176 char *u
= *user
, *p
= *pass
;
179 if ((u
= getuser(NULL
)) == NULL
)
187 if ((p
= getpassword(NULL
)) == NULL
)
199 static sighandler_type _rl_shup
;
200 static char * _rl_buf
; /* pre_input() hook: initial line */
201 static int _rl_buflen
; /* content, and its length */
203 static int _rl_pre_input(void);
208 /* Handle leftover data from \ escaped former line */
209 rl_extend_line_buffer(_rl_buflen
+ 10);
210 memcpy(rl_line_buffer
, _rl_buf
, _rl_buflen
+ 1);
211 rl_point
= rl_end
= _rl_buflen
;
212 rl_pre_input_hook
= (rl_hook_func_t
*)NULL
;
225 rl_readline_name
= UNCONST(uagent
);
229 stifle_history((int)hs
);
231 rl_read_init_file(NULL
);
233 /* Because rl_read_init_file() may have introduced yet a different
234 * history size limit, simply load and incorporate the history, leave
235 * it up to readline(3) to do the rest */
267 /* readline(3) doesn't catch it :( */
268 rl_free_line_state();
269 rl_cleanup_after_signal();
270 safe_signal(SIGHUP
, _rl_shup
);
272 sigaddset(&nset
, sig
);
273 sigprocmask(SIG_UNBLOCK
, &nset
, &oset
);
275 /* XXX When we come here we'll continue editing, so reestablish
276 * XXX cannot happen */
277 sigprocmask(SIG_BLOCK
, &oset
, (sigset_t
*)NULL
);
278 _rl_shup
= safe_signal(SIGHUP
, &tty_signal
);
279 rl_reset_after_signal();
287 (tty_readline
)(char const *prompt
, char **linebuf
, size_t *linesize
, size_t n
296 rl_pre_input_hook
= &_rl_pre_input
;
299 _rl_shup
= safe_signal(SIGHUP
, &tty_signal
);
300 line
= readline(prompt
!= NULL
? prompt
: "");
301 safe_signal(SIGHUP
, _rl_shup
);
309 if (n
>= *linesize
) {
310 *linesize
= LINESIZE
+ n
+ 1;
311 *linebuf
= (srealloc
)(*linebuf
, *linesize SMALLOC_DEBUG_ARGSCALL
);
313 memcpy(*linebuf
, line
, n
);
315 (*linebuf
)[n
] = '\0';
322 tty_addhist(char const *s
)
325 _CL_CHECK_ADDHIST(s
, goto jleave
);
326 hold_all_sigs(); /* XXX too heavy */
327 add_history(s
); /* XXX yet we jump away! */
328 rele_all_sigs(); /* XXX remove jumps */
333 #endif /* HAVE_READLINE */
340 static EditLine
* _el_el
; /* editline(3) handle */
341 static char const * _el_prompt
; /* Current prompt */
343 static History
* _el_hcom
; /* History handle for commline */
346 static char const * _el_getprompt(void);
365 _el_hcom
= history_init();
366 history(_el_hcom
, &he
, H_SETSIZE
, (int)hs
);
367 history(_el_hcom
, &he
, H_SETUNIQUE
, 1);
370 _el_el
= el_init(uagent
, stdin
, stdout
, stderr
);
371 el_set(_el_el
, EL_SIGNAL
, 1);
372 el_set(_el_el
, EL_TERMINAL
, NULL
);
373 /* Need to set HIST before EDITOR, otherwise it won't work automatic */
375 el_set(_el_el
, EL_HIST
, &history
, _el_hcom
);
377 el_set(_el_el
, EL_EDITOR
, "emacs");
378 # ifdef EL_PROMPT_ESC
379 el_set(_el_el
, EL_PROMPT_ESC
, &_el_getprompt
, '\1');
381 el_set(_el_el
, EL_PROMPT
, &_el_getprompt
);
384 el_set(_el_el
, EL_ADDFN
, "tab_complete",
385 "editline(3) internal completion function", &_el_file_cpl
);
386 el_set(_el_el
, EL_BIND
, "^I", "tab_complete", NULL
);
389 el_set(_el_el
, EL_BIND
, "^R", "ed-search-prev-history", NULL
);
391 el_source(_el_el
, NULL
); /* Source ~/.editrc */
393 /* Because el_source() may have introduced yet a different history size
394 * limit, simply load and incorporate the history, leave it up to
395 * editline(3) to do the rest */
399 history(_el_hcom
, &he
, H_LOAD
, v
);
416 history(_el_hcom
, &he
, H_SAVE
, v
);
417 history_end(_el_hcom
);
436 (tty_readline
)(char const *prompt
, char **linebuf
, size_t *linesize
, size_t n
442 _el_prompt
= (prompt
!= NULL
) ? prompt
: "";
444 el_push(_el_el
, *linebuf
);
445 line
= el_gets(_el_el
, &nn
);
453 if (n
> 0 && line
[n
- 1] == '\n')
456 if (n
>= *linesize
) {
457 *linesize
= LINESIZE
+ n
+ 1;
458 *linebuf
= (srealloc
)(*linebuf
, *linesize SMALLOC_DEBUG_ARGSCALL
);
460 memcpy(*linebuf
, line
, n
);
461 (*linebuf
)[n
] = '\0';
467 tty_addhist(char const *s
)
470 /* Enlarge meaning of unique .. to something that rocks;
471 * xxx unfortunately this is expensive to do with editline(3)
472 * xxx maybe it would be better to hook the ptfs instead? */
476 _CL_CHECK_ADDHIST(s
, goto jleave
);
478 hold_all_sigs(); /* XXX too heavy, yet we jump away! */
479 if (history(_el_hcom
, &he
, H_GETUNIQUE
) < 0 || he
.num
== 0)
482 for (i
= history(_el_hcom
, &he
, H_FIRST
); i
>= 0;
483 i
= history(_el_hcom
, &he
, H_NEXT
))
484 if (strcmp(he
.str
, s
) == 0) {
485 history(_el_hcom
, &he
, H_DEL
, he
.num
);
489 history(_el_hcom
, &he
, H_ENTER
, s
);
490 rele_all_sigs(); /* XXX remove jumps */
495 #endif /* HAVE_EDITLINE */
498 * NCL: our homebrew version (inspired from NetBSD sh(1) / dash(1)s hetio.c).
500 * Only used in interactive mode, simply use STDIN_FILENO as point of interest.
501 * We do not handle character widths because the terminal must deal with that
502 * anyway on the one hand, and also wcwidth(3) doesn't support zero-width
503 * characters by definition on the other. We're addicted.
505 * To avoid memory leaks etc. with the current codebase that simply longjmp(3)s
506 * we're forced to use the very same buffer--the one that is passed through to
507 * us from the outside--to store anything we need, i.e., a `struct cell[]', and
508 * convert that on-the-fly back to the plain char* result once we're done.
509 * To simplify our live, use savestr() buffers for all other needed memory
513 * TODO NCL: don't use that stupid .sint=-1 stuff, but simply block all signals
514 * TODO NCL: during handler de-/installation handling.
519 # define MAX_INPUT 255 /* (_POSIX_MAX_INPUT = 255 as of Issue 7 TC1) */
522 /* Since we simply fputs(3) the prompt, assume each character requires two
523 * visual cells -- and we need to restrict the maximum prompt size because
524 * of MAX_INPUT and our desire to have room for some error message left */
525 # define _PROMPT_VLEN(P) (strlen(P) * 2)
526 # define _PROMPT_MAX ((MAX_INPUT / 2) + (MAX_INPUT / 4))
529 sighandler_type shdl
; /* Try avoid races by setting */
530 sl_it sint
; /* .sint=-1 when inactive */
532 CTA(sizeof(sl_it
) >= sizeof(sighandler_type
));
542 char cbuf
[MB_LEN_MAX
* 2]; /* .. plus reset shift sequence */
546 size_t cursor
; /* Current cursor position */
547 size_t topins
; /* Outermost cursor col set */
549 char * cbuf
; /* *x_buf */
552 struct str defc
; /* Current default content */
553 struct str savec
; /* Saved default content */
555 struct hist
* hist
; /* History cursor */
558 char const * nd
; /* Cursor right */
559 char ** x_buf
; /* Caller pointers */
566 struct hist
* younger
;
568 char dat
[VFIELD_SIZE(sizeof(size_t))];
572 static union xsighdl _ncl_oint
;
573 static union xsighdl _ncl_oquit
;
574 static union xsighdl _ncl_oterm
;
575 static union xsighdl _ncl_ohup
;
576 static union xsighdl _ncl_otstp
;
577 static union xsighdl _ncl_ottin
;
578 static union xsighdl _ncl_ottou
;
579 static struct xtios _ncl_tios
;
581 static struct hist
* _ncl_hist
;
582 static size_t _ncl_hist_size
;
583 static size_t _ncl_hist_size_max
;
584 static bool_t _ncl_hist_load
;
587 static void _ncl_sigs_up(void);
588 static void _ncl_sigs_down(void);
590 static void _ncl_term_mode(bool_t raw
);
592 static void _ncl_check_grow(struct line
*l
, size_t no SMALLOC_DEBUG_ARGS
);
593 static void _ncl_bs_eof_dvup(struct cell
*cap
, size_t i
);
594 static ssize_t
_ncl_wboundary(struct line
*l
, ssize_t dir
);
595 static ssize_t
_ncl_cell2dat(struct line
*l
);
596 # if defined HAVE_HISTORY || defined HAVE_TABEXPAND
597 static void _ncl_cell2save(struct line
*l
);
600 static void _ncl_khome(struct line
*l
, bool_t dobell
);
601 static void _ncl_kend(struct line
*l
);
602 static void _ncl_kbs(struct line
*l
);
603 static void _ncl_kkill(struct line
*l
, bool_t dobell
);
604 static ssize_t
_ncl_keof(struct line
*l
);
605 static void _ncl_kleft(struct line
*l
);
606 static void _ncl_kright(struct line
*l
);
607 static void _ncl_krefresh(struct line
*l
);
608 static void _ncl_kbwddelw(struct line
*l
);
609 static void _ncl_kgow(struct line
*l
, ssize_t dir
);
610 static void _ncl_kother(struct line
*l
, wchar_t wc
);
612 static size_t __ncl_khist_shared(struct line
*l
, struct hist
*hp
);
613 static size_t _ncl_khist(struct line
*l
, bool_t backwd
);
614 static size_t _ncl_krhist(struct line
*l
);
616 # ifdef HAVE_TABEXPAND
617 static size_t _ncl_kht(struct line
*l
);
619 static ssize_t
_ncl_readline(char const *prompt
, char **buf
, size_t *bufsize
,
620 size_t len SMALLOC_DEBUG_ARGS
);
625 if (_ncl_oint
.sint
== -1)
626 _ncl_oint
.shdl
= safe_signal(SIGINT
, &tty_signal
);
627 if (_ncl_oquit
.sint
== -1)
628 _ncl_oquit
.shdl
= safe_signal(SIGQUIT
, &tty_signal
);
629 if (_ncl_oterm
.sint
== -1)
630 _ncl_oterm
.shdl
= safe_signal(SIGTERM
, &tty_signal
);
631 if (_ncl_ohup
.sint
== -1)
632 _ncl_ohup
.shdl
= safe_signal(SIGHUP
, &tty_signal
);
633 if (_ncl_otstp
.sint
== -1)
634 _ncl_otstp
.shdl
= safe_signal(SIGTSTP
, &tty_signal
);
635 if (_ncl_ottin
.sint
== -1)
636 _ncl_ottin
.shdl
= safe_signal(SIGTTIN
, &tty_signal
);
637 if (_ncl_ottou
.sint
== -1)
638 _ncl_ottou
.shdl
= safe_signal(SIGTTOU
, &tty_signal
);
644 /* aaah.. atomic cas would be nice (but isn't it all redundant?) */
647 if (_ncl_ottou
.sint
!= -1) {
648 st
= _ncl_ottou
.shdl
, _ncl_ottou
.sint
= -1;
649 safe_signal(SIGTTOU
, st
);
651 if (_ncl_ottin
.sint
!= -1) {
652 st
= _ncl_ottin
.shdl
, _ncl_ottin
.sint
= -1;
653 safe_signal(SIGTTIN
, st
);
655 if (_ncl_otstp
.sint
!= -1) {
656 st
= _ncl_otstp
.shdl
, _ncl_otstp
.sint
= -1;
657 safe_signal(SIGTSTP
, st
);
659 if (_ncl_ohup
.sint
!= -1) {
660 st
= _ncl_ohup
.shdl
, _ncl_ohup
.sint
= -1;
661 safe_signal(SIGHUP
, st
);
663 if (_ncl_oterm
.sint
!= -1) {
664 st
= _ncl_oterm
.shdl
, _ncl_oterm
.sint
= -1;
665 safe_signal(SIGTERM
, st
);
667 if (_ncl_oquit
.sint
!= -1) {
668 st
= _ncl_oquit
.shdl
, _ncl_oquit
.sint
= -1;
669 safe_signal(SIGQUIT
, st
);
671 if (_ncl_oint
.sint
!= -1) {
672 st
= _ncl_oint
.shdl
, _ncl_oint
.sint
= -1;
673 safe_signal(SIGINT
, st
);
678 _ncl_term_mode(bool_t raw
)
680 struct termios
*tiosp
= &_ncl_tios
.told
;
685 /* Always requery the attributes, in case we've been moved from background
686 * to foreground or however else in between sessions */
687 tcgetattr(STDIN_FILENO
, tiosp
);
688 memcpy(&_ncl_tios
.tnew
, tiosp
, sizeof *tiosp
);
689 tiosp
= &_ncl_tios
.tnew
;
690 tiosp
->c_cc
[VMIN
] = 1;
691 tiosp
->c_cc
[VTIME
] = 0;
692 tiosp
->c_iflag
&= ~(ISTRIP
);
693 tiosp
->c_lflag
&= ~(ECHO
/*| ECHOE | ECHONL */| ICANON
| IEXTEN
);
695 tcsetattr(STDIN_FILENO
, TCSADRAIN
, tiosp
);
699 _ncl_check_grow(struct line
*l
, size_t no SMALLOC_DEBUG_ARGS
)
701 size_t i
= (l
->topins
+ no
) * sizeof(struct cell
) + 2 * sizeof(struct cell
);
703 if (i
> *l
->x_bufsize
) {
707 *l
->x_buf
= (srealloc_safe
)(*l
->x_buf
, i SMALLOC_DEBUG_ARGSCALL
);
712 _ncl_bs_eof_dvup(struct cell
*cap
, size_t i
)
717 memmove(cap
, cap
+ 1, i
* sizeof(*cap
));
719 /* And.. the (rest of the) visual update */
720 for (j
= 0; j
< i
; ++j
)
721 fwrite(cap
[j
].cbuf
, sizeof *cap
->cbuf
, cap
[j
].count
, stdout
);
722 fputs(" \b", stdout
);
723 for (j
= 0; j
< i
; ++j
)
728 _ncl_wboundary(struct line
*l
, ssize_t dir
)
730 size_t c
= l
->cursor
, t
= l
->topins
, i
;
741 --t
, --c
; /* Unsigned wrapping may occur (twice), then */
743 for (i
= 0, cap
= l
->line
.cells
, anynon
= FAL0
;;) {
744 wchar_t wc
= cap
[c
+ dir
].wc
;
745 if (iswblank(wc
) || iswpunct(wc
)) {
763 _ncl_cell2dat(struct line
*l
)
768 for (i
= 0; i
< l
->topins
; ++i
) {
769 struct cell
*cap
= l
->line
.cells
+ i
;
770 memcpy(l
->line
.cbuf
+ len
, cap
->cbuf
, cap
->count
);
773 l
->line
.cbuf
[len
] = '\0';
777 # if defined HAVE_HISTORY || defined HAVE_TABEXPAND
779 _ncl_cell2save(struct line
*l
)
784 l
->savec
.s
= NULL
, l
->savec
.l
= 0;
788 for (cap
= l
->line
.cells
, len
= i
= 0; i
< l
->topins
; ++cap
, ++i
)
792 l
->savec
.s
= salloc(len
+ 1);
794 for (cap
= l
->line
.cells
, len
= i
= 0; i
< l
->topins
; ++cap
, ++i
) {
795 memcpy(l
->savec
.s
+ len
, cap
->cbuf
, cap
->count
);
798 l
->savec
.s
[len
] = '\0';
805 _ncl_khome(struct line
*l
, bool_t dobell
)
807 size_t c
= l
->cursor
;
818 _ncl_kend(struct line
*l
)
820 ssize_t i
= (ssize_t
)(l
->topins
- l
->cursor
);
823 l
->cursor
= l
->topins
;
825 fputs(l
->nd
, stdout
);
831 _ncl_kbs(struct line
*l
)
833 ssize_t c
= l
->cursor
, t
= l
->topins
;
840 _ncl_bs_eof_dvup(l
->line
.cells
+ c
, t
);
846 _ncl_kkill(struct line
*l
, bool_t dobell
)
848 size_t j
, c
= l
->cursor
, i
= (size_t)(l
->topins
- c
);
852 for (j
= i
; j
!= 0; --j
)
854 for (j
= i
; j
!= 0; --j
)
861 _ncl_keof(struct line
*l
)
863 size_t c
= l
->cursor
, t
= l
->topins
;
864 ssize_t i
= (ssize_t
)(t
- c
);
868 _ncl_bs_eof_dvup(l
->line
.cells
+ c
, --i
);
869 } else if (t
== 0 && ! boption("ignoreeof")) {
881 _ncl_kleft(struct line
*l
)
891 _ncl_kright(struct line
*l
)
893 if (l
->cursor
< l
->topins
) {
895 fputs(l
->nd
, stdout
);
901 _ncl_krefresh(struct line
*l
)
907 if (l
->prompt
!= NULL
&& *l
->prompt
!= '\0')
908 fputs(l
->prompt
, stdout
);
909 for (cap
= l
->line
.cells
, i
= l
->topins
; i
> 0; ++cap
, --i
)
910 fwrite(cap
->cbuf
, sizeof *cap
->cbuf
, cap
->count
, stdout
);
911 for (i
= l
->topins
- l
->cursor
; i
> 0; --i
)
916 _ncl_kbwddelw(struct line
*l
)
919 size_t c
= l
->cursor
, t
, j
;
922 i
= _ncl_wboundary(l
, -1);
933 cap
= l
->line
.cells
+ c
;
935 if (t
!= l
->cursor
) {
937 memmove(cap
, cap
+ i
, j
* sizeof(*cap
));
940 for (j
= i
; j
> 0; --j
)
942 for (j
= l
->topins
- c
; j
> 0; ++cap
, --j
)
943 fwrite(cap
[0].cbuf
, sizeof *cap
->cbuf
, cap
[0].count
, stdout
);
944 for (j
= i
; j
> 0; --j
)
946 for (j
= t
- c
; j
> 0; --j
)
953 _ncl_kgow(struct line
*l
, ssize_t dir
)
955 ssize_t i
= _ncl_wboundary(l
, dir
);
969 fputs(l
->nd
, stdout
);
976 _ncl_kother(struct line
*l
, wchar_t wc
)
978 /* Append if at EOL, insert otherwise;
979 * since we may move around character-wise, always use a fresh ps */
981 struct cell cell
, *cap
;
984 /* First init a cell and see wether we'll really handle this wc */
986 memset(&ps
, 0, sizeof ps
);
987 i
= wcrtomb(cell
.cbuf
, wc
, &ps
);
990 cell
.count
= (ui_it
)i
;
992 i
= wcrtomb(cell
.cbuf
+ i
, L
'\0', &ps
);
995 else if (--i
< MB_LEN_MAX
)
996 cell
.count
+= (ui_it
)i
;
1001 /* Yes, we will! Place it in the array */
1003 i
= l
->topins
++ - c
;
1004 cap
= l
->line
.cells
+ c
;
1006 memmove(cap
+ 1, cap
, i
* sizeof(cell
));
1007 memcpy(cap
, &cell
, sizeof cell
);
1009 /* And update visual */
1012 fwrite(cap
->cbuf
, sizeof *cap
->cbuf
, cap
->count
, stdout
);
1013 while ((++cap
, i
-- != 0));
1020 # ifdef HAVE_HISTORY
1022 __ncl_khist_shared(struct line
*l
, struct hist
*hp
)
1026 if ((l
->hist
= hp
) != NULL
) {
1027 l
->defc
.s
= savestrbuf(hp
->dat
, hp
->len
);
1029 l
->defc
.l
= hp
->len
;
1030 if (l
->topins
> 0) {
1031 _ncl_khome(l
, FAL0
);
1032 _ncl_kkill(l
, FAL0
);
1042 _ncl_khist(struct line
*l
, bool_t backwd
)
1046 /* If we're not in history mode yet, save line content;
1047 * also, disallow forward search, then, and, of course, bail unless we
1048 * do have any history at all */
1049 if ((hp
= l
->hist
) == NULL
) {
1052 if ((hp
= _ncl_hist
) == NULL
)
1058 hp
= backwd
? hp
->older
: hp
->younger
;
1060 return __ncl_khist_shared(l
, hp
);
1064 _ncl_krhist(struct line
*l
)
1066 struct str orig_savec
;
1067 struct hist
*hp
= NULL
;
1069 /* We cannot complete an empty line */
1070 if (l
->topins
== 0) {
1071 /* XXX The upcoming hard reset would restore a set savec buffer,
1072 * XXX so forcefully reset that. A cleaner solution would be to
1073 * XXX reset it whenever a restore is no longer desired */
1074 l
->savec
.s
= NULL
, l
->savec
.l
= 0;
1077 if ((hp
= l
->hist
) == NULL
) {
1078 if ((hp
= _ncl_hist
) == NULL
)
1080 orig_savec
.s
= NULL
;
1081 orig_savec
.l
= 0; /* silence CC */
1082 } else if ((hp
= hp
->older
) == NULL
)
1085 orig_savec
= l
->savec
;
1087 if (orig_savec
.s
== NULL
)
1089 for (; hp
!= NULL
; hp
= hp
->older
)
1090 if (is_prefix(l
->savec
.s
, hp
->dat
))
1092 if (orig_savec
.s
!= NULL
)
1093 l
->savec
= orig_savec
;
1095 return __ncl_khist_shared(l
, hp
);
1099 # ifdef HAVE_TABEXPAND
1101 _ncl_kht(struct line
*l
)
1103 struct str orig
, bot
, topp
, sub
, exp
;
1104 struct cell
*cword
, *ctop
, *cx
;
1105 bool_t set_savec
= FAL0
;
1108 /* We cannot expand an empty line */
1112 /* Get plain line data; if this is the first expansion/xy, update the
1113 * very original content so that ^G gets the origin back */
1123 cword
= l
->line
.cells
;
1124 ctop
= cword
+ l
->cursor
;
1126 /* topp: separate data right of cursor */
1127 if ((cx
= cword
+ l
->topins
) != ctop
) {
1128 for (rv
= 0; cx
> ctop
; --cx
)
1131 topp
.s
= orig
.s
+ orig
.l
- rv
;
1133 topp
.s
= NULL
, topp
.l
= 0;
1135 /* bot, sub: we cannot expand the entire data left of cursor, but only
1136 * the last "word", so separate them */
1137 while (cx
> cword
&& ! iswspace(cx
[-1].wc
))
1139 for (rv
= 0; cword
< cx
; ++cword
)
1149 sub
.s
= savestrbuf(sub
.s
, sub
.l
);
1150 /* TODO there is a TODO note upon fexpand() with multi-return;
1151 * TODO if that will change, the if() below can be simplified */
1152 /* Super-Heavy-Metal: block all sigs, avoid leaks on jump */
1154 exp
.s
= fexpand(sub
.s
, _CL_TAB_FEXP_FL
);
1157 if (exp
.s
!= NULL
&& (exp
.l
= strlen(exp
.s
)) > 0 &&
1158 (exp
.l
!= sub
.l
|| strcmp(exp
.s
, sub
.s
))) {
1159 /* Cramp expansion length to MAX_INPUT, or 255 if not defined.
1160 * Take care to take *prompt* into account, since we don't know
1161 * anything about it's visual length (fputs(3) is used), simply
1162 * assume each character requires two columns */
1163 /* TODO the problem is that we loose control otherwise; in the best
1164 * TODO case the user can control via ^A and ^K etc., but be safe;
1165 * TODO we cannot simply adjust fexpand() because we don't know how
1166 * TODO that is implemented... The real solution would be to check
1167 * TODO wether we fit on a line, and start a pager if not.
1168 * TODO However, that should be part of a real tab-COMPLETION, then,
1169 * TODO i.e., don't EXPAND, but SHOW COMPLETIONS, page-wise if needed.
1170 * TODO And: MAX_INPUT is dynamic: pathconf(2), _SC_MAX_INPUT */
1171 rv
= (l
->prompt
!= NULL
) ? _PROMPT_VLEN(l
->prompt
) : 0;
1172 if (rv
+ bot
.l
+ exp
.l
+ topp
.l
>= MAX_INPUT
) {
1173 char const e1
[] = "[maximum line size exceeded]";
1174 exp
.s
= UNCONST(e1
);
1175 exp
.l
= sizeof(e1
) - 1;
1177 if (rv
+ bot
.l
+ exp
.l
>= MAX_INPUT
)
1179 if (rv
+ exp
.l
>= MAX_INPUT
) {
1180 char const e2
[] = "[ERR]";
1181 exp
.s
= UNCONST(e2
);
1182 exp
.l
= sizeof(e2
) - 1;
1185 orig
.l
= bot
.l
+ exp
.l
+ topp
.l
;
1186 orig
.s
= salloc(orig
.l
+ 1 + 5);
1187 if ((rv
= bot
.l
) > 0)
1188 memcpy(orig
.s
, bot
.s
, rv
);
1189 memcpy(orig
.s
+ rv
, exp
.s
, exp
.l
);
1192 memcpy(orig
.s
+ rv
, topp
.s
, topp
.l
);
1198 _ncl_khome(l
, FAL0
);
1199 _ncl_kkill(l
, FAL0
);
1204 /* If we've provided a default content, but failed to expand, there is
1205 * nothing we can "revert to": drop that default again */
1207 l
->savec
.s
= NULL
, l
->savec
.l
= 0;
1212 # endif /* HAVE_TABEXPAND */
1215 _ncl_readline(char const *prompt
, char **buf
, size_t *bufsize
, size_t len
1218 /* We want to save code, yet we may have to incorporate a lines'
1219 * default content and / or default input to switch back to after some
1220 * history movement; let "len > 0" mean "have to display some data
1221 * buffer", and only otherwise read(2) it */
1224 char cbuf_base
[MB_LEN_MAX
* 2], *cbuf
, *cbufp
;
1228 memset(&l
, 0, sizeof l
);
1231 l
.defc
.s
= savestrbuf(*buf
, len
);
1234 if ((l
.prompt
= prompt
) != NULL
&& _PROMPT_VLEN(prompt
) > _PROMPT_MAX
)
1235 l
.prompt
= prompt
= "?ERR?";
1236 /* TODO *l.nd=='\0' only because we have no value-cache -> see acmava.c */
1237 if ((l
.nd
= voption("line-editor-cursor-right")) == NULL
|| *l
.nd
== '\0')
1240 l
.x_bufsize
= bufsize
;
1242 if (prompt
!= NULL
&& *prompt
!= '\0') {
1243 fputs(prompt
, stdout
);
1247 memset(ps
, 0, sizeof ps
);
1248 /* TODO: NCL: we should output the reset sequence when we jrestart:
1249 * TODO: NCL: if we are using a stateful encoding? !
1250 * TODO: NCL: in short: this is not yet well understood */
1252 _ncl_check_grow(&l
, len SMALLOC_DEBUG_ARGSCALL
);
1254 /* Normal read(2)? Else buffer-takeover: speed this one up */
1259 assert(l
.defc
.l
> 0 && l
.defc
.s
!= NULL
);
1261 cbuf
= l
.defc
.s
+ (l
.defc
.l
- len
);
1265 /* Read in the next complete multibyte character */
1268 if ((rv
= read(STDIN_FILENO
, cbufp
, 1)) < 1) {
1269 if (errno
== EINTR
) /* xxx #if !SA_RESTART ? */
1276 /* Ach! the ISO C multibyte handling!
1277 * Encodings with locking shift states cannot really be helped, since
1278 * it is impossible to only query the shift state, as opposed to the
1279 * entire shift state + character pair (via ISO C functions) */
1280 rv
= (ssize_t
)mbrtowc(&wc
, cbuf
, (size_t)(cbufp
- cbuf
), ps
+ 0);
1282 /* Any error during take-over can only result in a hard reset;
1283 * Otherwise, if it's a hard error, or if too many redundant shift
1284 * sequences overflow our buffer, also perform a hard reset */
1285 if (len
!= 0 || rv
== -1 ||
1286 sizeof cbuf_base
== (size_t)(cbufp
- cbuf
)) {
1287 l
.savec
.s
= l
.defc
.s
= NULL
,
1288 l
.savec
.l
= l
.defc
.l
= len
= 0;
1293 /* Otherwise, due to the way we deal with the buffer, we need to
1294 * restore the mbstate_t from before this conversion */
1299 if (len
!= 0 && (len
-= (size_t)rv
) == 0)
1300 l
.defc
.s
= NULL
, l
.defc
.l
= 0;
1305 /* Don't interpret control bytes during buffer take-over */
1306 if (cbuf
!= cbuf_base
)
1309 case 'A' ^ 0x40: /* cursor home */
1310 _ncl_khome(&l
, TRU1
);
1312 case 'B' ^ 0x40: /* backward character */
1315 /* 'C': interrupt (CTRL-C) */
1316 case 'D' ^ 0x40: /* delete char forward if any, else EOF */
1317 if ((rv
= _ncl_keof(&l
)) < 0)
1320 case 'E' ^ 0x40: /* end of line */
1323 case 'F' ^ 0x40: /* forward character */
1327 case 'H' ^ 0x40: /* backspace */
1331 case 'I' ^ 0x40: /* horizontal tab */
1332 # ifdef HAVE_TABEXPAND
1333 if ((len
= _ncl_kht(&l
)) > 0)
1337 case 'J' ^ 0x40: /* NL (\n) */
1339 case 'G' ^ 0x40: /* full reset */
1342 case 'U' ^ 0x40: /* ^U: ^A + ^K */
1343 _ncl_khome(&l
, FAL0
);
1345 case 'K' ^ 0x40: /* kill from cursor to end of line */
1346 _ncl_kkill(&l
, (wc
== ('K' ^ 0x40) || l
.topins
== 0));
1347 /* (Handle full reset?) */
1348 if (wc
== ('G' ^ 0x40)) {
1349 # ifdef HAVE_HISTORY
1352 if ((len
= l
.savec
.l
) != 0) {
1354 l
.savec
.s
= NULL
, l
.savec
.l
= 0;
1360 case 'L' ^ 0x40: /* repaint line */
1364 case 'N' ^ 0x40: /* history next */
1365 # ifdef HAVE_HISTORY
1368 if ((len
= _ncl_khist(&l
, FAL0
)) > 0)
1376 case 'P' ^ 0x40: /* history previous */
1377 # ifdef HAVE_HISTORY
1378 if ((len
= _ncl_khist(&l
, TRU1
)) > 0)
1386 case 'R' ^ 0x40: /* reverse history search */
1387 # ifdef HAVE_HISTORY
1388 if ((len
= _ncl_krhist(&l
)) > 0)
1397 /*case 'V' ^ 0x40: TODO*/ /* forward delete "word" */
1398 case 'W' ^ 0x40: /* backward delete "word" */
1401 case 'X' ^ 0x40: /* move cursor forward "word" */
1404 case 'Y' ^ 0x40: /* move cursor backward "word" */
1407 /* 'Z': suspend (CTRL-Z) */
1411 _ncl_kother(&l
, wc
);
1412 /* Don't clear the history during takeover..
1413 * ..and also avoid fflush()ing unless we've
1414 * worked the entire buffer */
1417 # ifdef HAVE_HISTORY
1418 if (cbuf
== cbuf_base
)
1430 /* We have a completed input line, convert the struct cell data to its
1431 * plain character equivalent */
1435 len
= _ncl_cell2dat(&l
);
1444 # ifdef HAVE_HISTORY
1448 size_t lsize
, cnt
, llen
;
1451 _ncl_oint
.sint
= _ncl_oquit
.sint
= _ncl_oterm
.sint
=
1452 _ncl_ohup
.sint
= _ncl_otstp
.sint
= _ncl_ottin
.sint
=
1453 _ncl_ottou
.sint
= -1;
1455 # ifdef HAVE_HISTORY
1457 _ncl_hist_size_max
= hs
;
1465 hold_all_sigs(); /* XXX too heavy, yet we may jump even here!? */
1466 f
= fopen(v
, "r"); /* TODO HISTFILE LOAD: use linebuf pool */
1473 while (fgetline(&lbuf
, &lsize
, &cnt
, &llen
, f
, FAL0
) != NULL
) {
1474 if (llen
> 0 && lbuf
[llen
- 1] == '\n')
1475 lbuf
[--llen
] = '\0';
1476 if (llen
== 0 || lbuf
[0] == '#') /* xxx comments? noone! */
1478 _ncl_hist_load
= TRU1
;
1480 _ncl_hist_load
= FAL0
;
1487 rele_all_sigs(); /* XXX remove jumps */
1489 # endif /* HAVE_HISTORY */
1496 # ifdef HAVE_HISTORY
1510 if ((hp
= _ncl_hist
) != NULL
)
1511 while (hp
->older
!= NULL
&& hs
-- != 0)
1514 hold_all_sigs(); /* too heavy, yet we may jump even here!? */
1515 f
= fopen(v
, "w"); /* TODO temporary + rename?! */
1518 if (fchmod(fileno(f
), S_IRUSR
| S_IWUSR
) != 0)
1521 for (; hp
!= NULL
; hp
= hp
->younger
) {
1522 fwrite(hp
->dat
, sizeof *hp
->dat
, hp
->len
, f
);
1528 rele_all_sigs(); /* XXX remove jumps */
1530 # endif /* HAVE_HISTORY */
1537 sigset_t nset
, oset
;
1541 /* We don't deal with SIGWINCH, yet get called from main.c */
1544 _ncl_term_mode(FAL0
);
1547 sigaddset(&nset
, sig
);
1548 sigprocmask(SIG_UNBLOCK
, &nset
, &oset
);
1550 /* When we come here we'll continue editing, so reestablish */
1551 sigprocmask(SIG_BLOCK
, &oset
, (sigset_t
*)NULL
);
1553 _ncl_term_mode(TRU1
);
1559 (tty_readline
)(char const *prompt
, char **linebuf
, size_t *linesize
, size_t n
1564 /* Of course we have races here, but they cannot be avoided on POSIX
1565 * (except by even *more* actions) */
1567 _ncl_term_mode(TRU1
);
1568 nn
= _ncl_readline(prompt
, linebuf
, linesize
, n SMALLOC_DEBUG_ARGSCALL
);
1569 _ncl_term_mode(FAL0
);
1576 tty_addhist(char const *s
)
1578 # ifdef HAVE_HISTORY
1579 /* Super-Heavy-Metal: block all sigs, avoid leaks+ on jump */
1580 size_t l
= strlen(s
);
1581 struct hist
*h
, *o
, *y
;
1583 _CL_CHECK_ADDHIST(s
, goto j_leave
);
1585 /* Eliminating duplicates is expensive, but simply inacceptable so
1586 * during the load of a potentially large history file! */
1587 if (! _ncl_hist_load
)
1588 for (h
= _ncl_hist
; h
!= NULL
; h
= h
->older
)
1589 if (h
->len
== l
&& strcmp(h
->dat
, s
) == 0) {
1594 if ((o
->younger
= y
) == NULL
)
1605 if (!_ncl_hist_load
&& _ncl_hist_size
>= _ncl_hist_size_max
) {
1606 (h
= _ncl_hist
->younger
1612 h
= smalloc((sizeof(struct hist
) - VFIELD_SIZEOF(struct hist
, dat
)) + l
+ 1);
1614 memcpy(h
->dat
, s
, l
+ 1);
1616 if ((h
->older
= _ncl_hist
) != NULL
)
1617 _ncl_hist
->younger
= h
;
1626 #endif /* HAVE_NCL */
1629 * The really-nothing-at-all implementation
1632 #if !defined HAVE_READLINE && !defined HAVE_EDITLINE && !defined HAVE_NCL
1648 (tty_readline
)(char const *prompt
, char **linebuf
, size_t *linesize
, size_t n
1652 * TODO The nothing-at-all tty layer even forces re-entering all the
1653 * TODO original data when re-editing a field
1655 bool_t doffl
= FAL0
;
1657 if (prompt
!= NULL
&& *prompt
!= '\0') {
1658 fputs(prompt
, stdout
);
1662 fprintf(stdout
, tr(511, "{former content: %.*s} "), (int)n
, *linebuf
);
1668 return (readline_restart
)(stdin
, linebuf
, linesize
,n SMALLOC_DEBUG_ARGSCALL
);
1672 tty_addhist(char const *s
)
1676 #endif /* nothing at all */
1678 /* vim:set fenc=utf-8:s-it-mode */