1 /*@ S-nail - a mail user agent derived from Berkeley Mail.
2 *@ Auxiliary functions.
4 * Copyright (c) 2000-2004 Gunnar Ritter, Freiburg i. Br., Germany.
5 * Copyright (c) 2012 - 2014 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
40 #ifndef HAVE_AMALGAMATION
44 #include <sys/utsname.h>
52 # include <sys/socket.h>
67 struct mem_chunk
*mc_prev
;
68 struct mem_chunk
*mc_next
;
78 struct mem_chunk
*p_c
;
82 #endif /* HAVE_DEBUG */
84 /* NYD, memory pool debug */
86 static ui32_t _nyd_curr
, _nyd_level
;
87 static struct nyd_info _nyd_infos
[NYD_CALLS_MAX
];
89 static size_t _mem_aall
, _mem_acur
, _mem_amax
,
90 _mem_mall
, _mem_mcur
, _mem_mmax
;
92 static struct mem_chunk
*_mem_list
, *_mem_free
;
95 /* {hold,rele}_all_sigs() */
96 static size_t _alls_depth
;
97 static sigset_t _alls_nset
, _alls_oset
;
99 /* {hold,rele}_sigs() */
100 static size_t _hold_sigdepth
;
101 static sigset_t _hold_nset
, _hold_oset
;
103 /* Create an ISO 6429 (ECMA-48/ANSI) terminal control escape sequence */
105 static char * _colour_iso6429(char const *wish
);
109 static void _nyd_print(struct nyd_info
*nip
);
114 _colour_iso6429(char const *wish
)
116 char const * const wish_orig
= wish
;
117 char *xwish
, *cp
, cfg
[3] = {0, 0, 0};
120 /* Since we use salloc(), reuse the n_strsep() buffer also for the return
121 * value, ensure we have enough room for that */
123 size_t i
= strlen(wish
) +1;
124 xwish
= salloc(MAX(i
, sizeof("\033[1;30;40m")));
125 memcpy(xwish
, wish
, i
);
129 /* Iterate over the colour spec */
130 while ((cp
= n_strsep(&xwish
, ',', TRU1
)) != NULL
) {
131 char *y
, *x
= strchr(cp
, '=');
135 "Invalid colour specification \"%s\": >>> %s <<<\n"),
141 /* TODO convert the ft/fg/bg parser into a table-based one! */
142 if (!asccasecmp(cp
, "ft")) {
143 if (!asccasecmp(x
, "bold"))
145 else if (!asccasecmp(x
, "inverse"))
147 else if (!asccasecmp(x
, "underline"))
151 } else if (!asccasecmp(cp
, "fg")) {
154 } else if (!asccasecmp(cp
, "bg")) {
157 if (!asccasecmp(x
, "black"))
159 else if (!asccasecmp(x
, "blue"))
161 else if (!asccasecmp(x
, "green"))
163 else if (!asccasecmp(x
, "red"))
165 else if (!asccasecmp(x
, "brown"))
167 else if (!asccasecmp(x
, "magenta"))
169 else if (!asccasecmp(x
, "cyan"))
171 else if (!asccasecmp(x
, "white"))
179 /* Restore our salloc() buffer, create return value */
180 xwish
= UNCONST(wish
);
181 if (cfg
[0] || cfg
[1] || cfg
[2]) {
195 if (cfg
[0] || cfg
[1])
205 return UNCONST(wish
);
207 #endif /* HAVE_COLOUR */
211 _nyd_print(struct nyd_info
*nip
) /* XXX like SFSYS;no magics;jumps:lvl wrong */
214 union {int i
; size_t z
;} u
;
216 u
.i
= snprintf(buf
, sizeof buf
, "%c [%2u] %-25.25s %.16s:%-5u\n",
217 "=><"[(nip
->ni_chirp_line
>> 29) & 0x3], nip
->ni_level
, nip
->ni_fun
,
218 nip
->ni_file
, (nip
->ni_chirp_line
& 0x1FFFFFFFu
));
221 if (u
.z
> sizeof buf
)
222 u
.z
= sizeof buf
- 1; /* (Skip \0) */
223 write(STDERR_FILENO
, buf
, u
.z
);
229 panic(char const *format
, ...)
234 fprintf(stderr
, _("Panic: "));
236 va_start(ap
, format
);
237 vfprintf(stderr
, format
, ap
);
243 abort(); /* Was exit(EXIT_ERR); for a while, but no */
247 alert(char const *format
, ...)
252 fprintf(stderr
, _("Panic: "));
254 va_start(ap
, format
);
255 vfprintf(stderr
, format
, ap
);
264 safe_signal(int signum
, sighandler_type handler
)
266 struct sigaction nact
, oact
;
270 nact
.sa_handler
= handler
;
271 sigemptyset(&nact
.sa_mask
);
274 nact
.sa_flags
|= SA_RESTART
;
276 rv
= (sigaction(signum
, &nact
, &oact
) != 0) ? SIG_ERR
: oact
.sa_handler
;
285 if (_alls_depth
++ == 0) {
286 sigfillset(&_alls_nset
);
287 sigdelset(&_alls_nset
, SIGABRT
);
289 sigdelset(&_alls_nset
, SIGBUS
);
291 sigdelset(&_alls_nset
, SIGCHLD
);
292 sigdelset(&_alls_nset
, SIGFPE
);
293 sigdelset(&_alls_nset
, SIGILL
);
294 sigdelset(&_alls_nset
, SIGKILL
);
295 sigdelset(&_alls_nset
, SIGSEGV
);
296 sigdelset(&_alls_nset
, SIGSTOP
);
297 sigprocmask(SIG_BLOCK
, &_alls_nset
, &_alls_oset
);
306 if (--_alls_depth
== 0)
307 sigprocmask(SIG_SETMASK
, &_alls_oset
, (sigset_t
*)NULL
);
315 if (_hold_sigdepth
++ == 0) {
316 sigemptyset(&_hold_nset
);
317 sigaddset(&_hold_nset
, SIGHUP
);
318 sigaddset(&_hold_nset
, SIGINT
);
319 sigaddset(&_hold_nset
, SIGQUIT
);
320 sigprocmask(SIG_BLOCK
, &_hold_nset
, &_hold_oset
);
329 if (--_hold_sigdepth
== 0)
330 sigprocmask(SIG_SETMASK
, &_hold_oset
, NULL
);
336 _nyd_chirp(ui8_t act
, char const *file
, ui32_t line
, char const *fun
)
338 struct nyd_info
*nip
= _nyd_infos
;
340 if (_nyd_curr
!= NELEM(_nyd_infos
))
346 nip
->ni_chirp_line
= ((ui32_t
)(act
& 0x3) << 29) | (line
& 0x1FFFFFFFu
);
347 nip
->ni_level
= ((act
== 0) ? _nyd_level
348 : (act
== 1) ? ++_nyd_level
: _nyd_level
--);
352 _nyd_oncrash(int signo
)
354 struct sigaction xact
;
356 struct nyd_info
*nip
;
359 xact
.sa_handler
= SIG_DFL
;
360 sigemptyset(&xact
.sa_mask
);
362 sigaction(signo
, &xact
, NULL
);
364 fprintf(stderr
, "\n\nNYD: program dying due to signal %d:\n", signo
);
365 if (_nyd_infos
[NELEM(_nyd_infos
) - 1].ni_file
!= NULL
)
366 for (i
= _nyd_curr
, nip
= _nyd_infos
+ i
; i
< NELEM(_nyd_infos
); ++i
)
368 for (i
= 0, nip
= _nyd_infos
; i
< _nyd_curr
; ++i
)
372 sigaddset(&xset
, signo
);
373 sigprocmask(SIG_UNBLOCK
, &xset
, NULL
);
381 touch(struct message
*mp
)
384 mp
->m_flag
|= MTOUCH
;
385 if (!(mp
->m_flag
& MREAD
))
386 mp
->m_flag
|= MREAD
| MSTATUS
;
391 is_dir(char const *name
)
397 if (!stat(name
, &sbuf
))
398 rv
= (S_ISDIR(sbuf
.st_mode
) != 0);
404 argcount(char **argv
)
409 for (ap
= argv
; *ap
++ != NULL
;)
412 return (int)PTR2SIZE(ap
- argv
- 1);
422 if ((cp
= ok_vlook(screen
)) == NULL
|| (s
= atoi(cp
)) <= 0)
423 s
= scrnheight
- 4; /* XXX no magics */
429 get_pager(char const **env_addon
)
434 cp
= ok_vlook(PAGER
);
435 if (cp
== NULL
|| *cp
== '\0')
438 if (env_addon
!= NULL
) {
439 if (strstr(cp
, "less") != NULL
) {
440 if (getenv("LESS") == NULL
)
441 *env_addon
= "LESS=FRSXi";
442 } else if (strstr(cp
, "lv") != NULL
) {
443 if (getenv("LV") == NULL
)
444 *env_addon
= "LV=-c";
453 paging_seems_sensible(void)
459 if (IS_TTY_SESSION() && (cp
= ok_vlook(crt
)) != NULL
)
460 rv
= (*cp
!= '\0') ? (size_t)atol(cp
) : (size_t)scrnheight
;
466 page_or_print(FILE *fp
, size_t lines
)
474 if ((rows
= paging_seems_sensible()) != 0 && lines
== 0) {
475 while ((c
= getc(fp
)) != EOF
)
476 if (c
== '\n' && ++lines
> rows
)
481 if (rows
!= 0 && lines
>= rows
)
482 run_command(get_pager(NULL
), 0, fileno(fp
), -1, NULL
, NULL
, NULL
);
484 while ((c
= getc(fp
)) != EOF
)
490 which_protocol(char const *name
) /* XXX (->URL (yet auxlily.c)) */
496 enum protocol rv
= PROTO_UNKNOWN
;
499 if (name
[0] == '%' && name
[1] == ':')
501 for (cp
= name
; *cp
&& *cp
!= ':'; cp
++)
505 if (cp
[0] == ':' && cp
[1] == '/' && cp
[2] == '/') {
506 if (!strncmp(name
, "pop3://", 7)) {
510 fprintf(stderr
, _("No POP3 support compiled in.\n"));
512 } else if (!strncmp(name
, "pop3s://", 8)) {
513 #if defined HAVE_POP3 && defined HAVE_SSL
517 fprintf(stderr
, _("No POP3 support compiled in.\n"));
520 fprintf(stderr
, _("No SSL support compiled in.\n"));
523 } else if (!strncmp(name
, "imap://", 7)) {
527 fprintf(stderr
, _("No IMAP support compiled in.\n"));
529 } else if (!strncmp(name
, "imaps://", 8)) {
530 #if defined HAVE_IMAP && defined HAVE_SSL
534 fprintf(stderr
, _("No IMAP support compiled in.\n"));
537 fprintf(stderr
, _("No SSL support compiled in.\n"));
544 /* TODO This is the de facto maildir code and thus belongs into there!
545 * TODO and: we should have maildir:// and mbox:// pseudo-protos, instead of
546 * TODO or (more likely) in addition to *newfolders*) */
549 np
= ac_alloc((sz
= strlen(name
)) + 4 +1);
550 memcpy(np
, name
, sz
+ 1);
551 if (!stat(name
, &st
)) {
552 if (S_ISDIR(st
.st_mode
) &&
553 (memcpy(np
+sz
, "/tmp", 4), !stat(np
, &st
) && S_ISDIR(st
.st_mode
)) &&
554 (memcpy(np
+sz
, "/new", 4), !stat(np
, &st
) && S_ISDIR(st
.st_mode
)) &&
555 (memcpy(np
+sz
, "/cur", 4), !stat(np
, &st
) && S_ISDIR(st
.st_mode
)))
557 } else if ((cp
= ok_vlook(newfolders
)) != NULL
&& !strcmp(cp
, "maildir"))
566 torek_hash(char const *name
)
568 /* Chris Torek's hash.
569 * NOTE: need to change *at least* create-okey-map.pl when changing the
574 while (*name
!= '\0') {
583 pjw(char const *cp
) /* TODO obsolete that -> torek_hash */
590 h
= (h
<< 4 & 0xffffffff) + (*cp
&0377);
591 if ((g
= h
& 0xf0000000) != 0) {
603 static ui32_t
const primes
[] = {
604 509, 1021, 2039, 4093, 8191, 16381, 32749, 65521,
605 131071, 262139, 524287, 1048573, 2097143, 4194301,
606 8388593, 16777213, 33554393, 67108859, 134217689,
607 268435399, 536870909, 1073741789, 2147483647
610 ui32_t mprime
= 7, cutlim
;
614 cutlim
= (n
< 65536 ? n
<< 2 : (n
< 262144 ? n
<< 1 : n
));
616 for (i
= 0; i
< NELEM(primes
); i
++)
617 if ((mprime
= primes
[i
]) >= cutlim
)
619 if (i
== NELEM(primes
) && mprime
< n
)
626 expand_shell_escape(char const **s
, bool_t use_nail_extensions
)
634 if ((c
= *xs
& 0xFF) == '\0')
640 switch ((c
= *xs
& 0xFF)) {
642 case 'a': c
= '\a'; break;
643 case 'b': c
= '\b'; break;
644 case 'c': c
= PROMPT_STOP
; break;
645 case 'f': c
= '\f'; break;
646 case 'n': c
= '\n'; break;
647 case 'r': c
= '\r'; break;
648 case 't': c
= '\t'; break;
649 case 'v': c
= '\v'; break;
651 for (++xs
, c
= 0, n
= 4; --n
> 0 && octalchar(*xs
); ++xs
) {
656 /* S-nail extension for nice (get)prompt(()) support */
661 if (use_nail_extensions
) {
663 case '&': c
= ok_blook(bsdcompat
) ? '&' : '?'; break;
664 case '?': c
= exec_last_comm_error
? '1' : '0'; break;
665 case '$': c
= PROMPT_DOLLAR
; break;
666 case '@': c
= PROMPT_AT
; break;
672 /* A sole <backslash> at EOS is treated as-is! */
686 getprompt(void) /* TODO evaluate only as necessary (needs a bit) */
688 static char buf
[PROMPT_BUFFER_SIZE
];
691 char const *ccp_base
, *ccp
;
692 size_t NATCH_CHAR( cclen_base COMMA cclen COMMA
) maxlen
, dfmaxlen
;
697 if ((ccp_base
= ok_vlook(prompt
)) == NULL
|| *ccp_base
== '\0')
699 NATCH_CHAR( cclen_base
= strlen(ccp_base
); )
701 dfmaxlen
= 0; /* keep CC happy */
705 NATCH_CHAR( cclen
= cclen_base
; )
706 maxlen
= sizeof(buf
) -1;
714 #ifdef HAVE_NATCH_CHAR
715 c
= mblen(ccp
, cclen
); /* TODO use mbrtowc() */
724 } else if ((l
= c
) > 1) {
734 if ((c
= expand_shell_escape(&ccp
, TRU1
)) > 0) {
740 if (c
== 0 || c
== PROMPT_STOP
)
744 char const *a
= (c
== PROMPT_DOLLAR
) ? account_name
: displayname
;
747 if ((l
= field_put_bidi_clip(cp
, dfmaxlen
, a
, strlen(a
))) > 0) {
767 nodename(int mayoverride
)
769 static char *sys_hostname
, *hostname
; /* XXX free-at-exit */
775 struct addrinfo hints
, *res
;
777 struct hostent
*hent
;
782 if (mayoverride
&& (hn
= ok_vlook(hostname
)) != NULL
&& *hn
!= '\0') {
784 } else if ((hn
= sys_hostname
) == NULL
) {
789 memset(&hints
, 0, sizeof hints
);
790 hints
.ai_family
= AF_UNSPEC
;
791 hints
.ai_socktype
= SOCK_DGRAM
; /* (dummy) */
792 hints
.ai_flags
= AI_CANONNAME
;
793 if (getaddrinfo(hn
, "0", &hints
, &res
) == 0) {
794 if (res
->ai_canonname
!= NULL
) {
795 size_t l
= strlen(res
->ai_canonname
) +1;
797 memcpy(hn
, res
->ai_canonname
, l
);
802 hent
= gethostbyname(hn
);
807 sys_hostname
= sstrdup(hn
);
808 #if defined HAVE_SOCKETS && defined HAVE_IPV6
809 if (hn
!= ut
.nodename
)
815 if (hostname
!= NULL
&& hostname
!= sys_hostname
)
817 hostname
= sstrdup(hn
);
823 getrandstring(size_t length
)
825 static unsigned char nodedigest
[16];
839 data
= ac_alloc(length
);
841 if ((fd
= open("/dev/urandom", O_RDONLY
)) == -1 ||
842 length
!= (size_t)read(fd
, data
, length
)) {
849 md5_update(&ctx
, (unsigned char*)cp
, strlen(cp
));
850 md5_final(nodedigest
, &ctx
);
852 /* In that case it's only used for boundaries and Message-Id:s so that
853 * srand(3) should suffice */
855 for (i
= 0; i
< sizeof(nodedigest
); ++i
)
856 nodedigest
[i
] = (unsigned char)(cp
[i
% j
] ^ rand());
859 for (i
= 0; i
< length
; i
++)
860 data
[i
] = (char)((int)(255 * (rand() / (RAND_MAX
+ 1.0))) ^
861 nodedigest
[i
% sizeof nodedigest
]);
866 b64_encode_buf(&b64
, data
, length
, B64_SALLOC
);
868 assert(length
< b64
.l
);
869 b64
.s
[length
] = '\0';
875 makedir(char const *name
)
881 if (!mkdir(name
, 0700))
885 if ((e
== EEXIST
|| e
== ENOSYS
) && !stat(name
, &st
) &&
900 if ((cw
->cw_fd
= open(".", O_RDONLY
)) == -1)
902 if (fchdir(cw
->cw_fd
) == -1) {
918 if (!fchdir(cw
->cw_fd
))
925 cwrelse(struct cw
*cw
)
932 #else /* !HAVE_FCHDIR */
939 if (getcwd(cw
->cw_wd
, sizeof cw
->cw_wd
) != NULL
&& !chdir(cw
->cw_wd
))
951 if (!chdir(cw
->cw_wd
))
958 cwrelse(struct cw
*cw
)
964 #endif /* !HAVE_FCHDIR */
967 field_detect_clip(size_t maxlen
, char const *buf
, size_t blen
)/*TODO mbrtowc()*/
972 #ifdef HAVE_NATCH_CHAR
973 maxlen
= MIN(maxlen
, blen
);
974 for (rv
= 0; maxlen
> 0;) {
975 int ml
= mblen(buf
, maxlen
);
985 rv
= MIN(blen
, maxlen
);
992 field_put_bidi_clip(char *store
, size_t maxlen
, char const *buf
, size_t blen
)
994 NATCH_CHAR( struct bidi_info bi
; )
995 size_t rv
NATCH_CHAR( COMMA i
);
1002 #ifdef HAVE_NATCH_CHAR
1003 bidi_info_create(&bi
);
1004 if (bi
.bi_start
.l
== 0 || !bidi_info_needed(buf
, blen
)) {
1009 if (maxlen
>= (i
= bi
.bi_pad
+ bi
.bi_end
.l
+ bi
.bi_start
.l
))
1014 if ((i
= bi
.bi_start
.l
) > 0) {
1015 memcpy(store
, bi
.bi_start
.s
, i
);
1021 while (maxlen
> 0) {
1022 int ml
= mblen(buf
, blen
);
1027 if (UICMP(z
, maxlen
, <, ml
))
1032 memcpy(store
, buf
, ml
);
1039 if ((i
= bi
.bi_end
.l
) > 0) {
1040 memcpy(store
, bi
.bi_end
.s
, i
);
1048 rv
= MIN(blen
, maxlen
);
1049 memcpy(store
, buf
, rv
);
1058 colalign(char const *cp
, int col
, int fill
, int *cols_decr_used_or_null
)
1060 NATCH_CHAR( struct bidi_info bi
; )
1061 int col_orig
= col
, n
, sz
;
1062 bool_t isbidi
, isuni
, isrepl
;
1066 /* Bidi only on request and when there is 8-bit data */
1067 isbidi
= isuni
= FAL0
;
1068 #ifdef HAVE_NATCH_CHAR
1069 isuni
= ((options
& OPT_UNICODE
) != 0);
1070 bidi_info_create(&bi
);
1071 if (bi
.bi_start
.l
== 0)
1073 if (!(isbidi
= bidi_info_needed(cp
, strlen(cp
))))
1076 if ((size_t)col
>= bi
.bi_pad
)
1083 np
= nb
= salloc(mb_cur_max
* strlen(cp
) +
1085 NATCH_CHAR( + (isbidi
? bi
.bi_start
.l
+ bi
.bi_end
.l
: 0) )
1088 #ifdef HAVE_NATCH_CHAR
1090 memcpy(np
, bi
.bi_start
.s
, bi
.bi_start
.l
);
1091 np
+= bi
.bi_start
.l
;
1095 while (*cp
!= '\0') {
1096 #ifdef HAVE_C90AMEND1
1097 if (mb_cur_max
> 1) {
1102 if ((sz
= mbtowc(&wc
, cp
, mb_cur_max
)) == -1)
1104 else if (iswprint(wc
)) {
1105 # ifndef HAVE_WCWIDTH
1106 n
= 1 + (wc
>= 0x1100u
); /* TODO use S-CText isfullwidth() */
1108 if ((n
= wcwidth(wc
)) == -1)
1117 isrepl
= !isprint(*cp
);
1125 np
[0] = (char)0xEFu
;
1126 np
[1] = (char)0xBFu
;
1127 np
[2] = (char)0xBDu
;
1132 } else if (sz
== 1 && spacechar(*cp
)) {
1140 if (fill
&& col
!= 0) {
1142 memmove(nb
+ col
, nb
, PTR2SIZE(np
- nb
));
1143 memset(nb
, ' ', col
);
1145 memset(np
, ' ', col
);
1150 #ifdef HAVE_NATCH_CHAR
1152 memcpy(np
, bi
.bi_end
.s
, bi
.bi_end
.l
);
1158 if (cols_decr_used_or_null
!= NULL
)
1159 *cols_decr_used_or_null
-= col_orig
- col
;
1165 makeprint(struct str
const *in
, struct str
*out
)
1167 static int print_all_chars
= -1;
1169 char const *inp
, *maxp
;
1174 if (print_all_chars
== -1)
1175 print_all_chars
= ok_blook(print_all_chars
);
1177 out
->s
= outp
= smalloc(DBG( msz
= ) in
->l
*mb_cur_max
+ 2u*mb_cur_max
);
1181 if (print_all_chars
) {
1183 memcpy(outp
, inp
, out
->l
);
1187 #ifdef HAVE_NATCH_CHAR
1188 if (mb_cur_max
> 1) {
1189 char mbb
[MB_LEN_MAX
+ 1];
1192 bool_t isuni
= ((options
& OPT_UNICODE
) != 0);
1195 while (inp
< maxp
) {
1197 n
= mbtowc(&wc
, inp
, PTR2SIZE(maxp
- inp
));
1203 /* FIXME Why mbtowc() resetting here?
1204 * FIXME what about ISO 2022-JP plus -- those
1205 * FIXME will loose shifts, then!
1206 * FIXME THUS - we'd need special "known points"
1207 * FIXME to do so - say, after a newline!!
1208 * FIXME WE NEED TO CHANGE ALL USES +MBLEN! */
1209 mbtowc(&wc
, NULL
, mb_cur_max
);
1210 wc
= isuni
? 0xFFFD : '?';
1215 if (!iswprint(wc
) && wc
!= '\n' && wc
!= '\r' && wc
!= '\b' &&
1217 if ((wc
& ~(wchar_t)037) == 0)
1218 wc
= isuni
? 0x2400 | wc
: '?';
1219 else if (wc
== 0177)
1220 wc
= isuni
? 0x2421 : '?';
1222 wc
= isuni
? 0x2426 : '?';
1224 if ((n
= wctomb(mbb
, wc
)) <= 0)
1227 assert(out
->l
< msz
);
1228 for (i
= 0; i
< n
; ++i
)
1232 #endif /* NATCH_CHAR */
1235 while (inp
< maxp
) {
1237 if (!isprint(c
) && c
!= '\n' && c
!= '\r' && c
!= '\b' && c
!= '\t')
1244 out
->s
[out
->l
] = '\0';
1249 prstr(char const *s
)
1257 makeprint(&in
, &out
);
1258 rp
= savestrbuf(out
.s
, out
.l
);
1265 prout(char const *s
, size_t sz
, FILE *fp
)
1273 makeprint(&in
, &out
);
1274 n
= fwrite(out
.s
, 1, out
.l
, fp
);
1281 putuc(int u
, int c
, FILE *fp
)
1287 #ifdef HAVE_NATCH_CHAR
1288 if ((options
& OPT_UNICODE
) && (u
& ~(wchar_t)0177)) {
1289 char mbb
[MB_LEN_MAX
];
1292 if ((n
= wctomb(mbb
, u
)) > 0) {
1294 for (i
= 0; i
< n
; ++i
)
1295 if (putc(mbb
[i
] & 0377, fp
) == EOF
) {
1300 rv
= (putc('\0', fp
) != EOF
);
1305 rv
= (putc(c
, fp
) != EOF
);
1311 bidi_info_needed(char const *bdat
, size_t blen
)
1316 #ifdef HAVE_NATCH_CHAR
1317 if (options
& OPT_UNICODE
)
1318 for (; blen
> 0; ++bdat
, --blen
) {
1319 if ((ui8_t
)*bdat
> 0x7F) {
1320 /* TODO Checking for BIDI character: use S-CText fromutf8
1321 * TODO plus isrighttoleft (or whatever there will be)! */
1322 ui32_t c
, x
= (ui8_t
)*bdat
;
1324 if ((x
& 0xE0) == 0xC0) {
1329 } else if ((x
& 0xF0) == 0xE0) {
1353 /* (Very very fuzzy, awaiting S-CText for good) */
1354 if ((c
>= 0x05BE && c
<= 0x08E3) ||
1355 (c
>= 0xFB1D && c
<= 0xFEFC) ||
1356 (c
>= 0x10800 && c
<= 0x10C48) ||
1357 (c
>= 0x1EE00 && c
<= 0x1EEF1)) {
1363 #endif /* HAVE_NATCH_CHAR */
1369 bidi_info_create(struct bidi_info
*bip
)
1371 /* Unicode: how to isolate RIGHT-TO-LEFT scripts via *headline-bidi*
1372 * 1.1 (Jun 1993): U+200E (E2 80 8E) LEFT-TO-RIGHT MARK
1373 * 6.3 (Sep 2013): U+2068 (E2 81 A8) FIRST STRONG ISOLATE,
1374 * U+2069 (E2 81 A9) POP DIRECTIONAL ISOLATE
1375 * Worse results seen for: U+202D "\xE2\x80\xAD" U+202C "\xE2\x80\xAC" */
1376 NATCH_CHAR( char const *hb
; )
1379 memset(bip
, 0, sizeof *bip
);
1380 bip
->bi_start
.s
= bip
->bi_end
.s
= UNCONST("");
1382 #ifdef HAVE_NATCH_CHAR
1383 if ((options
& OPT_UNICODE
) && (hb
= ok_vlook(headline_bidi
)) != NULL
) {
1389 bip
->bi_start
.s
= bip
->bi_end
.s
= UNCONST("\xE2\x80\x8E");
1395 bip
->bi_start
.s
= UNCONST("\xE2\x81\xA8");
1396 bip
->bi_end
.s
= UNCONST("\xE2\x81\xA9");
1399 bip
->bi_start
.l
= bip
->bi_end
.l
= 3;
1407 colour_table_create(bool_t pager_used
)
1409 union {char *cp
; char const *ccp
; void *vp
; struct colour_table
*ctp
;} u
;
1411 struct colour_table
*ct
;
1414 if (ok_blook(colour_disable
) || (pager_used
&& !ok_blook(colour_pager
)))
1417 char *term
, *okterms
;
1419 /* Don't use getenv(), but force copy-in into our own tables.. */
1420 if ((term
= _var_voklook("TERM")) == NULL
)
1422 /* terminfo rocks: if we find "color", assume it's right */
1423 if (strstr(term
, "color") != NULL
)
1425 if ((okterms
= ok_vlook(colour_terms
)) == NULL
)
1426 okterms
= UNCONST(COLOUR_TERMS
);
1427 okterms
= savestr(okterms
);
1430 while ((u
.cp
= n_strsep(&okterms
, ',', TRU1
)) != NULL
)
1431 if (!strncmp(u
.cp
, term
, i
))
1437 colour_table
= ct
= salloc(sizeof *ct
); /* XXX lex.c yet resets (FILTER!) */
1440 enum colourspec cspec
;
1443 {ok_v_colour_msginfo
, COLOURSPEC_MSGINFO
, COLOUR_MSGINFO
},
1444 {ok_v_colour_partinfo
, COLOURSPEC_PARTINFO
, COLOUR_PARTINFO
},
1445 {ok_v_colour_from_
, COLOURSPEC_FROM_
, COLOUR_FROM_
},
1446 {ok_v_colour_header
, COLOURSPEC_HEADER
, COLOUR_HEADER
},
1447 {ok_v_colour_uheader
, COLOURSPEC_UHEADER
, COLOUR_UHEADER
}
1450 for (i
= 0; i
< NELEM(map
); ++i
) {
1451 if ((u
.cp
= _var_oklook(map
[i
].okey
)) == NULL
)
1452 u
.ccp
= map
[i
].defval
;
1453 u
.cp
= _colour_iso6429(u
.ccp
);
1454 ct
->ct_csinfo
[map
[i
].cspec
].l
= strlen(u
.cp
);
1455 ct
->ct_csinfo
[map
[i
].cspec
].s
= u
.cp
;
1458 ct
->ct_csinfo
[COLOURSPEC_RESET
].l
= sizeof("\033[0m") -1;
1459 ct
->ct_csinfo
[COLOURSPEC_RESET
].s
= UNCONST("\033[0m");
1461 if ((u
.cp
= ok_vlook(colour_user_headers
)) == NULL
)
1462 u
.ccp
= COLOUR_USER_HEADERS
;
1463 ct
->ct_csinfo
[COLOURSPEC_RESET
+ 1].l
= i
= strlen(u
.ccp
);
1464 ct
->ct_csinfo
[COLOURSPEC_RESET
+ 1].s
= (i
== 0) ? NULL
: savestr(u
.ccp
);
1470 colour_put(FILE *fp
, enum colourspec cs
)
1473 if (colour_table
!= NULL
) {
1474 struct str
const *cp
= colour_get(cs
);
1476 fwrite(cp
->s
, cp
->l
, 1, fp
);
1482 colour_put_header(FILE *fp
, char const *name
)
1484 enum colourspec cs
= COLOURSPEC_HEADER
;
1485 struct str
const *uheads
;
1486 char *cp
, *cp_base
, *x
;
1490 if (colour_table
== NULL
)
1492 /* Normal header colours if there are no user headers */
1493 uheads
= colour_table
->ct_csinfo
+ COLOURSPEC_RESET
+ 1;
1494 if (uheads
->s
== NULL
)
1497 /* Iterate over all entries in the *colour-user-headers* list */
1498 cp
= ac_alloc(uheads
->l
+1);
1499 memcpy(cp
, uheads
->s
, uheads
->l
+1);
1501 namelen
= strlen(name
);
1502 while ((x
= n_strsep(&cp
, ',', TRU1
)) != NULL
) {
1503 size_t l
= (cp
!= NULL
) ? PTR2SIZE(cp
- x
) - 1 : strlen(x
);
1504 if (l
== namelen
&& !ascncasecmp(x
, name
, namelen
)) {
1505 cs
= COLOURSPEC_UHEADER
;
1517 colour_reset(FILE *fp
)
1520 if (colour_table
!= NULL
)
1521 fwrite("\033[0m", 4, 1, fp
);
1525 FL
struct str
const *
1526 colour_get(enum colourspec cs
)
1528 struct str
const *rv
= NULL
;
1531 if (colour_table
!= NULL
)
1532 if ((rv
= colour_table
->ct_csinfo
+ cs
)->s
== NULL
)
1537 #endif /* HAVE_COLOUR */
1540 time_current_update(struct time_current
*tc
, bool_t full_update
)
1543 tc
->tc_time
= time(NULL
);
1545 memcpy(&tc
->tc_gm
, gmtime(&tc
->tc_time
), sizeof tc
->tc_gm
);
1546 memcpy(&tc
->tc_local
, localtime(&tc
->tc_time
), sizeof tc
->tc_local
);
1547 sstpcpy(tc
->tc_ctime
, ctime(&tc
->tc_time
));
1553 _out_of_memory(void)
1560 smalloc(size_t s SMALLOC_DEBUG_ARGS
)
1567 if ((rv
= malloc(s
)) == NULL
)
1574 srealloc(void *v
, size_t s SMALLOC_DEBUG_ARGS
)
1583 else if ((rv
= realloc(v
, s
)) == NULL
)
1590 scalloc(size_t nmemb
, size_t size SMALLOC_DEBUG_ARGS
)
1597 if ((rv
= calloc(nmemb
, size
)) == NULL
)
1603 #else /* !HAVE_DEBUG */
1604 CTA(sizeof(char) == sizeof(ui8_t
));
1606 # define _HOPE_SIZE (2 * 8 * sizeof(char))
1607 # define _HOPE_SET(C) \
1609 union mem_ptr __xl, __xu;\
1610 struct mem_chunk *__xc;\
1611 __xl.p_p = (C).p_p;\
1612 __xc = __xl.p_c - 1;\
1615 __xl.p_ui8p[0]=0xDE; __xl.p_ui8p[1]=0xAA;\
1616 __xl.p_ui8p[2]=0x55; __xl.p_ui8p[3]=0xAD;\
1617 __xl.p_ui8p[4]=0xBE; __xl.p_ui8p[5]=0x55;\
1618 __xl.p_ui8p[6]=0xAA; __xl.p_ui8p[7]=0xEF;\
1619 __xu.p_ui8p += __xc->mc_size - 8;\
1620 __xu.p_ui8p[0]=0xDE; __xu.p_ui8p[1]=0xAA;\
1621 __xu.p_ui8p[2]=0x55; __xu.p_ui8p[3]=0xAD;\
1622 __xu.p_ui8p[4]=0xBE; __xu.p_ui8p[5]=0x55;\
1623 __xu.p_ui8p[6]=0xAA; __xu.p_ui8p[7]=0xEF;\
1625 # define _HOPE_GET_TRACE(C,BAD) \
1631 # define _HOPE_GET(C,BAD) \
1633 union mem_ptr __xl, __xu;\
1634 struct mem_chunk *__xc;\
1636 __xl.p_p = (C).p_p;\
1638 (C).p_cp = __xl.p_cp;\
1639 __xc = __xl.p_c - 1;\
1642 if (__xl.p_ui8p[0] != 0xDE) __i |= 1<<0;\
1643 if (__xl.p_ui8p[1] != 0xAA) __i |= 1<<1;\
1644 if (__xl.p_ui8p[2] != 0x55) __i |= 1<<2;\
1645 if (__xl.p_ui8p[3] != 0xAD) __i |= 1<<3;\
1646 if (__xl.p_ui8p[4] != 0xBE) __i |= 1<<4;\
1647 if (__xl.p_ui8p[5] != 0x55) __i |= 1<<5;\
1648 if (__xl.p_ui8p[6] != 0xAA) __i |= 1<<6;\
1649 if (__xl.p_ui8p[7] != 0xEF) __i |= 1<<7;\
1652 alert("%p: corrupt lower canary: 0x%02X: %s, line %u",\
1653 __xl.p_p, __i, mdbg_file, mdbg_line);\
1656 __xu.p_ui8p += __xc->mc_size - 8;\
1658 if (__xu.p_ui8p[0] != 0xDE) __i |= 1<<0;\
1659 if (__xu.p_ui8p[1] != 0xAA) __i |= 1<<1;\
1660 if (__xu.p_ui8p[2] != 0x55) __i |= 1<<2;\
1661 if (__xu.p_ui8p[3] != 0xAD) __i |= 1<<3;\
1662 if (__xu.p_ui8p[4] != 0xBE) __i |= 1<<4;\
1663 if (__xu.p_ui8p[5] != 0x55) __i |= 1<<5;\
1664 if (__xu.p_ui8p[6] != 0xAA) __i |= 1<<6;\
1665 if (__xu.p_ui8p[7] != 0xEF) __i |= 1<<7;\
1668 alert("%p: corrupt upper canary: 0x%02X: %s, line %u",\
1669 __xl.p_p, __i, mdbg_file, mdbg_line);\
1672 alert(" ..canary last seen: %s, line %u",\
1673 __xc->mc_file, __xc->mc_line);\
1677 (smalloc
)(size_t s SMALLOC_DEBUG_ARGS
)
1684 s
+= sizeof(struct mem_chunk
) + _HOPE_SIZE
;
1686 if ((p
.p_p
= (malloc
)(s
)) == NULL
)
1688 p
.p_c
->mc_prev
= NULL
;
1689 if ((p
.p_c
->mc_next
= _mem_list
) != NULL
)
1690 _mem_list
->mc_prev
= p
.p_c
;
1691 p
.p_c
->mc_file
= mdbg_file
;
1692 p
.p_c
->mc_line
= (ui16_t
)mdbg_line
;
1693 p
.p_c
->mc_isfree
= FAL0
;
1694 p
.p_c
->mc_size
= (ui32_t
)s
;
1695 _mem_list
= p
.p_c
++;
1700 _mem_amax
= MAX(_mem_amax
, _mem_acur
);
1703 _mem_mmax
= MAX(_mem_mmax
, _mem_mcur
);
1709 (srealloc
)(void *v
, size_t s SMALLOC_DEBUG_ARGS
)
1715 if ((p
.p_p
= v
) == NULL
) {
1716 p
.p_p
= (smalloc
)(s
, mdbg_file
, mdbg_line
);
1720 _HOPE_GET(p
, isbad
);
1722 if (p
.p_c
->mc_isfree
) {
1723 fprintf(stderr
, "srealloc(): region freed! At %s, line %d\n"
1724 "\tLast seen: %s, line %d\n",
1725 mdbg_file
, mdbg_line
, p
.p_c
->mc_file
, p
.p_c
->mc_line
);
1729 if (p
.p_c
== _mem_list
)
1730 _mem_list
= p
.p_c
->mc_next
;
1732 p
.p_c
->mc_prev
->mc_next
= p
.p_c
->mc_next
;
1733 if (p
.p_c
->mc_next
!= NULL
)
1734 p
.p_c
->mc_next
->mc_prev
= p
.p_c
->mc_prev
;
1737 _mem_mcur
-= p
.p_c
->mc_size
;
1741 s
+= sizeof(struct mem_chunk
) + _HOPE_SIZE
;
1743 if ((p
.p_p
= (realloc
)(p
.p_c
, s
)) == NULL
)
1745 p
.p_c
->mc_prev
= NULL
;
1746 if ((p
.p_c
->mc_next
= _mem_list
) != NULL
)
1747 _mem_list
->mc_prev
= p
.p_c
;
1748 p
.p_c
->mc_file
= mdbg_file
;
1749 p
.p_c
->mc_line
= (ui16_t
)mdbg_line
;
1750 p
.p_c
->mc_isfree
= FAL0
;
1751 p
.p_c
->mc_size
= (ui32_t
)s
;
1752 _mem_list
= p
.p_c
++;
1757 _mem_amax
= MAX(_mem_amax
, _mem_acur
);
1760 _mem_mmax
= MAX(_mem_mmax
, _mem_mcur
);
1767 (scalloc
)(size_t nmemb
, size_t size SMALLOC_DEBUG_ARGS
)
1777 size
+= sizeof(struct mem_chunk
) + _HOPE_SIZE
;
1779 if ((p
.p_p
= (malloc
)(size
)) == NULL
)
1781 memset(p
.p_p
, 0, size
);
1782 p
.p_c
->mc_prev
= NULL
;
1783 if ((p
.p_c
->mc_next
= _mem_list
) != NULL
)
1784 _mem_list
->mc_prev
= p
.p_c
;
1785 p
.p_c
->mc_file
= mdbg_file
;
1786 p
.p_c
->mc_line
= (ui16_t
)mdbg_line
;
1787 p
.p_c
->mc_isfree
= FAL0
;
1788 p
.p_c
->mc_size
= (ui32_t
)size
;
1789 _mem_list
= p
.p_c
++;
1794 _mem_amax
= MAX(_mem_amax
, _mem_acur
);
1797 _mem_mmax
= MAX(_mem_mmax
, _mem_mcur
);
1803 (sfree
)(void *v SMALLOC_DEBUG_ARGS
)
1809 if ((p
.p_p
= v
) == NULL
) {
1810 fprintf(stderr
, "sfree(NULL) from %s, line %d\n", mdbg_file
, mdbg_line
);
1814 _HOPE_GET(p
, isbad
);
1816 if (p
.p_c
->mc_isfree
) {
1817 fprintf(stderr
, "sfree(): double-free avoided at %s, line %d\n"
1818 "\tLast seen: %s, line %d\n",
1819 mdbg_file
, mdbg_line
, p
.p_c
->mc_file
, p
.p_c
->mc_line
);
1823 if (p
.p_c
== _mem_list
)
1824 _mem_list
= p
.p_c
->mc_next
;
1826 p
.p_c
->mc_prev
->mc_next
= p
.p_c
->mc_next
;
1827 if (p
.p_c
->mc_next
!= NULL
)
1828 p
.p_c
->mc_next
->mc_prev
= p
.p_c
->mc_prev
;
1829 p
.p_c
->mc_isfree
= TRU1
;
1832 _mem_mcur
-= p
.p_c
->mc_size
;
1834 if (options
& OPT_DEBUG
) {
1835 p
.p_c
->mc_next
= _mem_free
;
1847 size_t c
= 0, s
= 0;
1850 for (p
.p_c
= _mem_free
; p
.p_c
!= NULL
;) {
1853 s
+= p
.p_c
->mc_size
;
1854 p
.p_c
= p
.p_c
->mc_next
;
1859 if (options
& OPT_DEBUG
)
1860 fprintf(stderr
, "smemreset(): freed %" ZFMT
" chunks/%" ZFMT
" bytes\n",
1866 c_smemtrace(void *v
)
1868 /* For _HOPE_GET() */
1869 char const * const mdbg_file
= "smemtrace()";
1870 int const mdbg_line
= -1;
1872 union mem_ptr p
, xp
;
1878 if ((fp
= Ftmp(NULL
, "memtr", OF_RDWR
| OF_UNLINK
| OF_REGISTER
, 0600)) ==
1884 fprintf(fp
, "Memory statistics:\n"
1885 " Count cur/peek/all: %7" ZFMT
"/%7" ZFMT
"/%10" ZFMT
"\n"
1886 " Bytes cur/peek/all: %7" ZFMT
"/%7" ZFMT
"/%10" ZFMT
"\n\n",
1887 _mem_acur
, _mem_amax
, _mem_aall
, _mem_mcur
, _mem_mmax
, _mem_mall
);
1889 fprintf(fp
, "Currently allocated memory chunks:\n");
1890 for (lines
= 0, p
.p_c
= _mem_list
; p
.p_c
!= NULL
;
1891 ++lines
, p
.p_c
= p
.p_c
->mc_next
) {
1894 _HOPE_GET_TRACE(xp
, isbad
);
1895 fprintf(fp
, "%s%p (%5" ZFMT
" bytes): %s, line %u\n",
1896 (isbad
? "! CANARY ERROR: " : ""), xp
.p_p
,
1897 (size_t)(p
.p_c
->mc_size
- sizeof(struct mem_chunk
)), p
.p_c
->mc_file
,
1901 if (options
& OPT_DEBUG
) {
1902 fprintf(fp
, "sfree()d memory chunks awaiting free():\n");
1903 for (p
.p_c
= _mem_free
; p
.p_c
!= NULL
; ++lines
, p
.p_c
= p
.p_c
->mc_next
) {
1906 _HOPE_GET_TRACE(xp
, isbad
);
1907 fprintf(fp
, "%s%p (%5" ZFMT
" bytes): %s, line %u\n",
1908 (isbad
? "! CANARY ERROR: " : ""), xp
.p_p
,
1909 (size_t)(p
.p_c
->mc_size
- sizeof(struct mem_chunk
)),
1910 p
.p_c
->mc_file
, p
.p_c
->mc_line
);
1914 page_or_print(fp
, lines
);
1922 # ifdef _HAVE_MEMCHECK
1924 _smemcheck(char const *mdbg_file
, int mdbg_line
)
1926 union mem_ptr p
, xp
;
1927 bool_t anybad
= FAL0
, isbad
;
1931 for (lines
= 0, p
.p_c
= _mem_list
; p
.p_c
!= NULL
;
1932 ++lines
, p
.p_c
= p
.p_c
->mc_next
) {
1935 _HOPE_GET_TRACE(xp
, isbad
);
1939 "! CANARY ERROR: %p (%5" ZFMT
" bytes): %s, line %u\n",
1940 xp
.p_p
, (size_t)(p
.p_c
->mc_size
- sizeof(struct mem_chunk
)),
1941 p
.p_c
->mc_file
, p
.p_c
->mc_line
);
1945 if (options
& OPT_DEBUG
) {
1946 for (p
.p_c
= _mem_free
; p
.p_c
!= NULL
; ++lines
, p
.p_c
= p
.p_c
->mc_next
) {
1949 _HOPE_GET_TRACE(xp
, isbad
);
1953 "! CANARY ERROR: %p (%5" ZFMT
" bytes): %s, line %u\n",
1954 xp
.p_p
, (size_t)(p
.p_c
->mc_size
- sizeof(struct mem_chunk
)),
1955 p
.p_c
->mc_file
, p
.p_c
->mc_line
);
1962 # endif /* _HAVE_MEMCHECK */
1966 # undef _HOPE_GET_TRACE
1968 #endif /* HAVE_DEBUG */
1970 /* vim:set fenc=utf-8:s-it-mode */