popen.c: some cleanup, use other wait_child() from now on
[s-mailx.git] / auxlily.c
blobb7ed98d10cfdb9b73df0b080618c14c2a31e9409
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 - 2013 Steffen "Daode" Nurpmeso <sdaoden@users.sf.net>.
6 */
7 /*
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
13 * are met:
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
37 * SUCH DAMAGE.
40 #ifndef HAVE_AMALGAMATION
41 # include "nail.h"
42 #endif
44 #include <sys/utsname.h>
46 #include <ctype.h>
47 #include <dirent.h>
48 #include <fcntl.h>
50 #ifdef HAVE_SOCKETS
51 # ifdef HAVE_IPV6
52 # include <sys/socket.h>
53 # endif
55 # include <netdb.h>
56 #endif
58 #ifdef HAVE_MD5
59 # include "md5.h"
60 #endif
62 /* {hold,rele}_all_sigs() */
63 static size_t _alls_depth;
64 static sigset_t _alls_nset, _alls_oset;
66 /* {hold,rele}_sigs() */
67 static size_t _hold_sigdepth;
68 static sigset_t _hold_nset, _hold_oset;
70 FL void
71 panic(char const *format, ...)
73 va_list ap;
75 fprintf(stderr, tr(1, "Panic: "));
77 va_start(ap, format);
78 vfprintf(stderr, format, ap);
79 va_end(ap);
81 fputs("\n", stderr);
82 fflush(stderr);
83 exit(EXIT_ERR);
86 #ifdef HAVE_DEBUG
87 FL void
88 warn(char const *format, ...)
90 va_list ap;
92 fprintf(stderr, tr(1, "Panic: "));
94 va_start(ap, format);
95 vfprintf(stderr, format, ap);
96 va_end(ap);
98 fputs("\n", stderr);
99 fflush(stderr);
101 #endif
103 FL sighandler_type
104 safe_signal(int signum, sighandler_type handler)
106 struct sigaction nact, oact;
108 nact.sa_handler = handler;
109 sigemptyset(&nact.sa_mask);
110 nact.sa_flags = 0;
111 #ifdef SA_RESTART
112 nact.sa_flags |= SA_RESTART;
113 #endif
114 return ((sigaction(signum, &nact, &oact) != 0) ? SIG_ERR : oact.sa_handler);
117 FL void
118 hold_all_sigs(void)
120 if (_alls_depth++ == 0) {
121 sigfillset(&_alls_nset);
122 sigdelset(&_alls_nset, SIGKILL);
123 sigdelset(&_alls_nset, SIGSTOP);
124 sigdelset(&_alls_nset, SIGCHLD);
125 sigprocmask(SIG_BLOCK, &_alls_nset, &_alls_oset);
129 FL void
130 rele_all_sigs(void)
132 if (--_alls_depth == 0)
133 sigprocmask(SIG_SETMASK, &_alls_oset, (sigset_t*)NULL);
136 FL void
137 hold_sigs(void)
139 if (_hold_sigdepth++ == 0) {
140 sigemptyset(&_hold_nset);
141 sigaddset(&_hold_nset, SIGHUP);
142 sigaddset(&_hold_nset, SIGINT);
143 sigaddset(&_hold_nset, SIGQUIT);
144 sigprocmask(SIG_BLOCK, &_hold_nset, &_hold_oset);
148 FL void
149 rele_sigs(void)
151 if (--_hold_sigdepth == 0)
152 sigprocmask(SIG_SETMASK, &_hold_oset, NULL);
156 * Touch the named message by setting its MTOUCH flag.
157 * Touched messages have the effect of not being sent
158 * back to the system mailbox on exit.
160 FL void
161 touch(struct message *mp)
164 mp->m_flag |= MTOUCH;
165 if ((mp->m_flag & MREAD) == 0)
166 mp->m_flag |= MREAD|MSTATUS;
170 * Test to see if the passed file name is a directory.
171 * Return true if it is.
173 FL int
174 is_dir(char const *name)
176 struct stat sbuf;
178 if (stat(name, &sbuf) < 0)
179 return(0);
180 return(S_ISDIR(sbuf.st_mode));
184 * Count the number of arguments in the given string raw list.
186 FL int
187 argcount(char **argv)
189 char **ap;
191 for (ap = argv; *ap++ != NULL;)
193 return ap - argv - 1;
196 FL char *
197 colalign(const char *cp, int col, int fill, int *cols_decr_used_or_null)
199 int col_orig = col, n, sz;
200 char *nb, *np;
202 np = nb = salloc(mb_cur_max * strlen(cp) + col + 1);
203 while (*cp) {
204 #if defined (HAVE_MBTOWC) && defined (HAVE_WCWIDTH)
205 if (mb_cur_max > 1) {
206 wchar_t wc;
208 if ((sz = mbtowc(&wc, cp, mb_cur_max)) < 0) {
209 n = sz = 1;
210 } else {
211 if ((n = wcwidth(wc)) < 0)
212 n = 1;
214 } else
215 #endif /* HAVE_MBTOWC && HAVE_WCWIDTH */
217 n = sz = 1;
219 if (n > col)
220 break;
221 col -= n;
222 if (sz == 1 && spacechar(*cp)) {
223 *np++ = ' ';
224 cp++;
225 } else
226 while (sz--)
227 *np++ = *cp++;
230 if (fill && col != 0) {
231 if (fill > 0) {
232 memmove(nb + col, nb, (size_t)(np - nb));
233 memset(nb, ' ', col);
234 } else
235 memset(np, ' ', col);
236 np += col;
237 col = 0;
240 *np = '\0';
241 if (cols_decr_used_or_null != NULL)
242 *cols_decr_used_or_null -= col_orig - col;
243 return nb;
246 FL size_t
247 paging_seems_sensible(void)
249 size_t ret = 0;
250 char const *cp;
252 if (IS_TTY_SESSION() && (cp = voption("crt")) != NULL)
253 ret = (*cp != '\0') ? (size_t)atol(cp) : (size_t)scrnheight;
254 return ret;
257 FL void
258 page_or_print(FILE *fp, size_t lines)
260 size_t rows;
261 int c;
263 fflush_rewind(fp);
265 if ((rows = paging_seems_sensible()) != 0 && lines == 0) {
266 while ((c = getc(fp)) != EOF)
267 if (c == '\n' && ++lines > rows)
268 break;
269 rewind(fp);
272 if (rows != 0 && lines >= rows)
273 run_command(get_pager(), 0, fileno(fp), -1, NULL, NULL, NULL);
274 else
275 while ((c = getc(fp)) != EOF)
276 putchar(c);
279 FL enum protocol
280 which_protocol(const char *name)
282 register const char *cp;
283 char *np;
284 size_t sz;
285 struct stat st;
286 enum protocol p;
288 if (name[0] == '%' && name[1] == ':')
289 name += 2;
290 for (cp = name; *cp && *cp != ':'; cp++)
291 if (!alnumchar(*cp&0377))
292 goto file;
293 if (cp[0] == ':' && cp[1] == '/' && cp[2] == '/') {
294 if (strncmp(name, "pop3://", 7) == 0)
295 #ifdef HAVE_POP3
296 return PROTO_POP3;
297 #else
298 fprintf(stderr,
299 tr(216, "No POP3 support compiled in.\n"));
300 #endif
301 if (strncmp(name, "pop3s://", 8) == 0)
302 #ifdef HAVE_SSL
303 return PROTO_POP3;
304 #else
305 fprintf(stderr,
306 tr(225, "No SSL support compiled in.\n"));
307 #endif
308 if (strncmp(name, "imap://", 7) == 0)
309 #ifdef HAVE_IMAP
310 return PROTO_IMAP;
311 #else
312 fprintf(stderr,
313 tr(269, "No IMAP support compiled in.\n"));
314 #endif
315 if (strncmp(name, "imaps://", 8) == 0)
316 #ifdef HAVE_SSL
317 return PROTO_IMAP;
318 #else
319 fprintf(stderr,
320 tr(225, "No SSL support compiled in.\n"));
321 #endif
322 return PROTO_UNKNOWN;
323 } else {
324 /* TODO This is the de facto maildir code and thus belongs
325 * TODO into maildir! */
326 file: p = PROTO_FILE;
327 np = ac_alloc((sz = strlen(name)) + 5);
328 memcpy(np, name, sz + 1);
329 if (stat(name, &st) == 0) {
330 if (S_ISDIR(st.st_mode)) {
331 strcpy(&np[sz], "/tmp");
332 if (stat(np, &st) == 0 && S_ISDIR(st.st_mode)) {
333 strcpy(&np[sz], "/new");
334 if (stat(np, &st) == 0 &&
335 S_ISDIR(st.st_mode)) {
336 strcpy(&np[sz], "/cur");
337 if (stat(np, &st) == 0 &&
338 S_ISDIR(st.st_mode))
339 p = PROTO_MAILDIR;
343 } else {
344 strcpy(&np[sz], ".gz");
345 if (stat(np, &st) < 0) {
346 strcpy(&np[sz], ".bz2");
347 if (stat(np, &st) < 0) {
348 if ((cp = value("newfolders")) != 0 &&
349 strcmp(cp, "maildir") == 0)
350 p = PROTO_MAILDIR;
354 ac_free(np);
355 return p;
359 FL unsigned
360 pjw(const char *cp)
362 unsigned h = 0, g;
364 cp--;
365 while (*++cp) {
366 h = (h << 4 & 0xffffffff) + (*cp&0377);
367 if ((g = h & 0xf0000000) != 0) {
368 h = h ^ g >> 24;
369 h = h ^ g;
372 return h;
375 FL long
376 nextprime(long n)
378 const long primes[] = {
379 509, 1021, 2039, 4093, 8191, 16381, 32749, 65521,
380 131071, 262139, 524287, 1048573, 2097143, 4194301,
381 8388593, 16777213, 33554393, 67108859, 134217689,
382 268435399, 536870909, 1073741789, 2147483647
384 long mprime = 7;
385 size_t i;
387 for (i = 0; i < sizeof primes / sizeof *primes; i++)
388 if ((mprime = primes[i]) >= (n < 65536 ? n*4 :
389 n < 262144 ? n*2 : n))
390 break;
391 if (i == sizeof primes / sizeof *primes)
392 mprime = n; /* not so prime, but better than failure */
393 return mprime;
396 FL int
397 expand_shell_escape(char const **s, bool_t use_nail_extensions)
399 char const *xs = *s;
400 int c, n;
402 if ((c = *xs & 0xFF) == '\0')
403 goto jleave;
404 ++xs;
405 if (c != '\\')
406 goto jleave;
408 switch ((c = *xs & 0xFF)) {
409 case '\\': break;
410 case 'a': c = '\a'; break;
411 case 'b': c = '\b'; break;
412 case 'c': c = PROMPT_STOP;break;
413 case 'f': c = '\f'; break;
414 case 'n': c = '\n'; break;
415 case 'r': c = '\r'; break;
416 case 't': c = '\t'; break;
417 case 'v': c = '\v'; break;
418 case '0':
419 for (++xs, c = 0, n = 4; --n > 0 && octalchar(*xs); ++xs) {
420 c <<= 3;
421 c |= *xs - '0';
423 goto jleave;
424 /* S-nail extension for nice (get)prompt(()) support */
425 case '?':
426 case '$':
427 case '@':
428 if (use_nail_extensions) {
429 switch (c) {
430 case '?':
431 c = exec_last_comm_error ? '1' : '0';
432 break;
433 case '$':
434 c = PROMPT_DOLLAR;
435 break;
436 case '@':
437 c = PROMPT_AT;
438 break;
440 break;
442 /* FALLTHRU */
443 case '\0':
444 /* A sole <backslash> at EOS is treated as-is! */
445 /* FALLTHRU */
446 default:
447 c = '\\';
448 goto jleave;
450 ++xs;
451 jleave:
452 *s = xs;
453 return c;
456 FL char *
457 getprompt(void)
459 static char buf[PROMPT_BUFFER_SIZE];
461 char const *ccp;
463 if (options & OPT_NOPROMPT)
464 buf[0] = '\0';
465 else if ((ccp = value("prompt")) == NULL) {
466 buf[0] = value("bsdcompat") ? '&' : '?';
467 buf[1] = ' ';
468 buf[2] = '\0';
469 } else {
470 char *cp;
472 for (cp = buf; PTRCMP(cp, <, buf + sizeof(buf) - 1); ++cp) {
473 char const *a;
474 size_t l;
475 int c = expand_shell_escape(&ccp, TRU1);
476 if (c > 0) {
477 *cp = (char)c;
478 continue;
480 if (c == 0 || c == PROMPT_STOP)
481 break;
483 a = (c == PROMPT_DOLLAR) ? account_name : displayname;
484 if (a == NULL)
485 a = "";
486 l = strlen(a);
487 if (PTRCMP(cp + l, >=, buf + sizeof(buf) - 1))
488 *cp++ = '?';
489 else {
490 memcpy(cp, a, l);
491 cp += --l;
494 *cp = '\0';
496 return buf;
499 FL char *
500 nodename(int mayoverride)
502 static char *hostname;
503 struct utsname ut;
504 char *hn;
505 #ifdef HAVE_SOCKETS
506 # ifdef HAVE_IPV6
507 struct addrinfo hints, *res;
508 # else
509 struct hostent *hent;
510 # endif
511 #endif
513 if (mayoverride && (hn = value("hostname")) != NULL && *hn != '\0') {
514 if (hostname != NULL)
515 free(hostname);
516 hostname = sstrdup(hn);
517 } else if (hostname == NULL) {
518 uname(&ut);
519 hn = ut.nodename;
520 #ifdef HAVE_SOCKETS
521 # ifdef HAVE_IPV6
522 memset(&hints, 0, sizeof hints);
523 hints.ai_family = AF_UNSPEC;
524 hints.ai_socktype = SOCK_DGRAM; /* dummy */
525 hints.ai_flags = AI_CANONNAME;
526 if (getaddrinfo(hn, "0", &hints, &res) == 0) {
527 if (res->ai_canonname != NULL) {
528 size_t l = strlen(res->ai_canonname);
529 hn = ac_alloc(l + 1);
530 memcpy(hn, res->ai_canonname, l + 1);
532 freeaddrinfo(res);
534 # else
535 hent = gethostbyname(hn);
536 if (hent != NULL) {
537 hn = hent->h_name;
539 # endif
540 #endif
541 hostname = sstrdup(hn);
542 #if defined HAVE_SOCKETS && defined HAVE_IPV6
543 if (hn != ut.nodename)
544 ac_free(hn);
545 #endif
547 return (hostname);
550 FL char *
551 lookup_password_for_token(char const *token)
553 size_t tl;
554 char *var, *cp;
556 tl = strlen(token);
557 var = ac_alloc(tl + 10);
559 memcpy(var, "password-", 9);
560 memcpy(var + 9, token, tl);
561 var[tl + 9] = '\0';
563 if ((cp = value(var)) != NULL)
564 cp = savestr(cp);
565 ac_free(var);
566 return cp;
569 FL char *
570 getrandstring(size_t length)
572 static unsigned char nodedigest[16];
573 static pid_t pid;
574 struct str b64;
575 int fd = -1;
576 char *data, *cp;
577 size_t i;
578 #ifdef HAVE_MD5
579 md5_ctx ctx;
580 #else
581 size_t j;
582 #endif
584 data = ac_alloc(length);
585 if ((fd = open("/dev/urandom", O_RDONLY)) < 0 ||
586 length != (size_t)read(fd, data, length)) {
587 if (pid == 0) {
588 pid = getpid();
589 srand(pid);
590 cp = nodename(0);
591 #ifdef HAVE_MD5
592 md5_init(&ctx);
593 md5_update(&ctx, (unsigned char*)cp, strlen(cp));
594 md5_final(nodedigest, &ctx);
595 #else
596 /* In that case it's only used for boundaries and
597 * Message-Id:s so that srand(3) should suffice */
598 j = strlen(cp) + 1;
599 for (i = 0; i < sizeof(nodedigest); ++i)
600 nodedigest[i] = (unsigned char)(
601 cp[i % j] ^ rand());
602 #endif
604 for (i = 0; i < length; i++)
605 data[i] = (char)(
606 (int)(255 * (rand() / (RAND_MAX + 1.0))) ^
607 nodedigest[i % sizeof nodedigest]);
609 if (fd >= 0)
610 close(fd);
612 (void)b64_encode_buf(&b64, data, length, B64_SALLOC);
613 ac_free(data);
614 assert(length < b64.l);
615 b64.s[length] = '\0';
616 return b64.s;
619 #ifdef HAVE_MD5
620 FL char *
621 md5tohex(char hex[MD5TOHEX_SIZE], void const *vp)
623 char const *cp = vp;
624 size_t i, j;
626 for (i = 0; i < MD5TOHEX_SIZE / 2; i++) {
627 j = i << 1;
628 hex[j] = hexchar((cp[i] & 0xf0) >> 4);
629 hex[++j] = hexchar(cp[i] & 0x0f);
631 return hex;
634 FL char *
635 cram_md5_string(char const *user, char const *pass, char const *b64)
637 struct str in, out;
638 char digest[16], *cp;
639 size_t lu;
641 out.s = NULL;
642 in.s = UNCONST(b64);
643 in.l = strlen(in.s);
644 (void)b64_decode(&out, &in, NULL);
645 assert(out.s != NULL);
647 hmac_md5((unsigned char*)out.s, out.l, UNCONST(pass), strlen(pass),
648 digest);
649 free(out.s);
650 cp = md5tohex(salloc(MD5TOHEX_SIZE + 1), digest);
652 lu = strlen(user);
653 in.l = lu + MD5TOHEX_SIZE +1;
654 in.s = ac_alloc(lu + 1 + MD5TOHEX_SIZE +1);
655 memcpy(in.s, user, lu);
656 in.s[lu] = ' ';
657 memcpy(in.s + lu + 1, cp, MD5TOHEX_SIZE);
658 (void)b64_encode(&out, &in, B64_SALLOC|B64_CRLF);
659 ac_free(in.s);
660 return out.s;
662 #endif /* HAVE_MD5 */
664 FL enum okay
665 makedir(const char *name)
667 int e;
668 struct stat st;
670 if (mkdir(name, 0700) < 0) {
671 e = errno;
672 if ((e == EEXIST || e == ENOSYS) &&
673 stat(name, &st) == 0 &&
674 (st.st_mode&S_IFMT) == S_IFDIR)
675 return OKAY;
676 return STOP;
678 return OKAY;
681 #ifdef HAVE_FCHDIR
682 FL enum okay
683 cwget(struct cw *cw)
685 if ((cw->cw_fd = open(".", O_RDONLY)) < 0)
686 return STOP;
687 if (fchdir(cw->cw_fd) < 0) {
688 close(cw->cw_fd);
689 return STOP;
691 return OKAY;
694 FL enum okay
695 cwret(struct cw *cw)
697 if (fchdir(cw->cw_fd) < 0)
698 return STOP;
699 return OKAY;
702 FL void
703 cwrelse(struct cw *cw)
705 close(cw->cw_fd);
707 #else /* !HAVE_FCHDIR */
708 FL enum okay
709 cwget(struct cw *cw)
711 if (getcwd(cw->cw_wd, sizeof cw->cw_wd) == NULL || chdir(cw->cw_wd) < 0)
712 return STOP;
713 return OKAY;
716 FL enum okay
717 cwret(struct cw *cw)
719 if (chdir(cw->cw_wd) < 0)
720 return STOP;
721 return OKAY;
724 /*ARGSUSED*/
725 FL void
726 cwrelse(struct cw *cw)
728 (void)cw;
730 #endif /* !HAVE_FCHDIR */
732 FL void
733 makeprint(struct str const *in, struct str *out)
735 static int print_all_chars = -1;
736 char const *inp, *maxp;
737 char *outp;
738 size_t msz, dist;
740 if (print_all_chars == -1)
741 print_all_chars = (value("print-all-chars") != NULL);
743 msz = in->l + 1;
744 out->s = outp = smalloc(msz);
745 inp = in->s;
746 maxp = inp + in->l;
748 if (print_all_chars) {
749 out->l = in->l;
750 memcpy(outp, inp, out->l);
751 goto jleave;
754 #if defined (HAVE_MBTOWC) && defined (HAVE_WCTYPE_H)
755 if (mb_cur_max > 1) {
756 char mbb[MB_LEN_MAX + 1];
757 wchar_t wc;
758 int i, n;
759 out->l = 0;
760 while (inp < maxp) {
761 if (*inp & 0200)
762 n = mbtowc(&wc, inp, maxp - inp);
763 else {
764 wc = *inp;
765 n = 1;
767 if (n < 0) {
768 /* FIXME Why mbtowc() resetting here?
769 * FIXME what about ISO 2022-JP plus -- those
770 * FIXME will loose shifts, then!
771 * FIXME THUS - we'd need special "known points"
772 * FIXME to do so - say, after a newline!!
773 * FIXME WE NEED TO CHANGE ALL USES +MBLEN! */
774 (void)mbtowc(&wc, NULL, mb_cur_max);
775 wc = utf8 ? 0xFFFD : '?';
776 n = 1;
777 } else if (n == 0)
778 n = 1;
779 inp += n;
780 if (!iswprint(wc) && wc != '\n' && wc != '\r' &&
781 wc != '\b' && wc != '\t') {
782 if ((wc & ~(wchar_t)037) == 0)
783 wc = utf8 ? 0x2400 | wc : '?';
784 else if (wc == 0177)
785 wc = utf8 ? 0x2421 : '?';
786 else
787 wc = utf8 ? 0x2426 : '?';
789 if ((n = wctomb(mbb, wc)) <= 0)
790 continue;
791 out->l += n;
792 if (out->l >= msz - 1) {
793 dist = outp - out->s;
794 out->s = srealloc(out->s, msz += 32);
795 outp = &out->s[dist];
797 for (i = 0; i < n; i++)
798 *outp++ = mbb[i];
800 } else
801 #endif /* HAVE_MBTOWC && HAVE_WCTYPE_H */
803 int c;
804 while (inp < maxp) {
805 c = *inp++ & 0377;
806 if (!isprint(c) && c != '\n' && c != '\r' &&
807 c != '\b' && c != '\t')
808 c = '?';
809 *outp++ = c;
811 out->l = in->l;
813 jleave:
814 out->s[out->l] = '\0';
817 FL char *
818 prstr(const char *s)
820 struct str in, out;
821 char *rp;
823 in.s = UNCONST(s);
824 in.l = strlen(s);
825 makeprint(&in, &out);
826 rp = salloc(out.l + 1);
827 memcpy(rp, out.s, out.l);
828 rp[out.l] = '\0';
829 free(out.s);
830 return rp;
833 FL int
834 prout(const char *s, size_t sz, FILE *fp)
836 struct str in, out;
837 int n;
839 in.s = UNCONST(s);
840 in.l = sz;
841 makeprint(&in, &out);
842 n = fwrite(out.s, 1, out.l, fp);
843 free(out.s);
844 return n;
847 FL size_t
848 putuc(int u, int c, FILE *fp)
850 size_t rv;
852 #if defined HAVE_MBTOWC && defined HAVE_WCTYPE_H
853 if (utf8 && u & ~(wchar_t)0177) {
854 char mbb[MB_LEN_MAX];
855 int i, n;
856 if ((n = wctomb(mbb, u)) > 0) {
857 rv = wcwidth(u);
858 for (i = 0; i < n; ++i)
859 if (putc(mbb[i] & 0377, fp) == EOF) {
860 rv = 0;
861 break;
863 } else if (n == 0)
864 rv = (putc('\0', fp) != EOF);
865 else
866 rv = 0;
867 } else
868 #endif /* HAVE_MBTOWC && HAVE_WCTYPE_H */
869 rv = (putc(c, fp) != EOF);
870 return rv;
873 FL void
874 time_current_update(struct time_current *tc, bool_t full_update)
876 tc->tc_time = time(NULL);
877 if (full_update) {
878 memcpy(&tc->tc_gm, gmtime(&tc->tc_time), sizeof tc->tc_gm);
879 memcpy(&tc->tc_local, localtime(&tc->tc_time),
880 sizeof tc->tc_local);
881 sstpcpy(tc->tc_ctime, ctime(&tc->tc_time));
885 static void
886 _out_of_memory(void)
888 panic("no memory");
891 FL void *
892 (smalloc_safe)(size_t s SMALLOC_DEBUG_ARGS)
894 void *rv;
896 hold_all_sigs();
897 rv = (smalloc)(s SMALLOC_DEBUG_ARGSCALL);
898 rele_all_sigs();
899 return rv;
902 FL void *
903 (srealloc_safe)(void *v, size_t s SMALLOC_DEBUG_ARGS)
905 void *rv;
907 hold_all_sigs();
908 rv = (srealloc)(v, s SMALLOC_DEBUG_ARGSCALL);
909 rele_all_sigs();
910 return rv;
913 #ifdef notyet
914 FL void *
915 (scalloc_safe)(size_t nmemb, size_t size SMALLOC_DEBUG_ARGS)
917 void *rv;
919 hold_all_sigs();
920 rv = (scalloc)(nmemb, size SMALLOC_DEBUG_ARGSCALL);
921 rele_all_sigs();
922 return rv;
924 #endif
926 #ifndef HAVE_DEBUG
927 FL void *
928 smalloc(size_t s SMALLOC_DEBUG_ARGS)
930 void *rv;
932 if (s == 0)
933 s = 1;
934 if ((rv = malloc(s)) == NULL)
935 _out_of_memory();
936 return rv;
939 FL void *
940 srealloc(void *v, size_t s SMALLOC_DEBUG_ARGS)
942 void *rv;
944 if (s == 0)
945 s = 1;
946 if (v == NULL)
947 rv = smalloc(s);
948 else if ((rv = realloc(v, s)) == NULL)
949 _out_of_memory();
950 return rv;
953 FL void *
954 scalloc(size_t nmemb, size_t size SMALLOC_DEBUG_ARGS)
956 void *rv;
958 if (size == 0)
959 size = 1;
960 if ((rv = calloc(nmemb, size)) == NULL)
961 _out_of_memory();
962 return rv;
965 #else /* !HAVE_DEBUG */
966 CTA(sizeof(char) == sizeof(ui8_t));
968 # define _HOPE_SIZE (2 * 8 * sizeof(char))
969 # define _HOPE_SET(C) \
970 do {\
971 union ptr __xl, __xu;\
972 struct chunk *__xc;\
973 __xl.p = (C).p;\
974 __xc = __xl.c - 1;\
975 __xu.p = __xc;\
976 (C).cp += 8;\
977 __xl.ui8p[0]=0xDE; __xl.ui8p[1]=0xAA; __xl.ui8p[2]=0x55; __xl.ui8p[3]=0xAD;\
978 __xl.ui8p[4]=0xBE; __xl.ui8p[5]=0x55; __xl.ui8p[6]=0xAA; __xl.ui8p[7]=0xEF;\
979 __xu.ui8p += __xc->size - 8;\
980 __xu.ui8p[0]=0xDE; __xu.ui8p[1]=0xAA; __xu.ui8p[2]=0x55; __xu.ui8p[3]=0xAD;\
981 __xu.ui8p[4]=0xBE; __xu.ui8p[5]=0x55; __xu.ui8p[6]=0xAA; __xu.ui8p[7]=0xEF;\
982 } while (0)
983 # define _HOPE_GET_TRACE(C,BAD) do {(C).cp += 8; _HOPE_GET(C, BAD);} while(0)
984 # define _HOPE_GET(C,BAD) \
985 do {\
986 union ptr __xl, __xu;\
987 struct chunk *__xc;\
988 ui32_t __i;\
989 __xl.p = (C).p;\
990 __xl.cp -= 8;\
991 (C).cp = __xl.cp;\
992 __xc = __xl.c - 1;\
993 (BAD) = FAL0;\
994 __i = 0;\
995 if (__xl.ui8p[0] != 0xDE) __i |= 1<<0;\
996 if (__xl.ui8p[1] != 0xAA) __i |= 1<<1;\
997 if (__xl.ui8p[2] != 0x55) __i |= 1<<2;\
998 if (__xl.ui8p[3] != 0xAD) __i |= 1<<3;\
999 if (__xl.ui8p[4] != 0xBE) __i |= 1<<4;\
1000 if (__xl.ui8p[5] != 0x55) __i |= 1<<5;\
1001 if (__xl.ui8p[6] != 0xAA) __i |= 1<<6;\
1002 if (__xl.ui8p[7] != 0xEF) __i |= 1<<7;\
1003 if (__i != 0) {\
1004 (BAD) = TRU1;\
1005 warn("%p: corrupted lower canary: 0x%02X: %s, line %u",\
1006 __xl.p, __i, mdbg_file, mdbg_line);\
1008 __xu.p = __xc;\
1009 __xu.ui8p += __xc->size - 8;\
1010 __i = 0;\
1011 if (__xu.ui8p[0] != 0xDE) __i |= 1<<0;\
1012 if (__xu.ui8p[1] != 0xAA) __i |= 1<<1;\
1013 if (__xu.ui8p[2] != 0x55) __i |= 1<<2;\
1014 if (__xu.ui8p[3] != 0xAD) __i |= 1<<3;\
1015 if (__xu.ui8p[4] != 0xBE) __i |= 1<<4;\
1016 if (__xu.ui8p[5] != 0x55) __i |= 1<<5;\
1017 if (__xu.ui8p[6] != 0xAA) __i |= 1<<6;\
1018 if (__xu.ui8p[7] != 0xEF) __i |= 1<<7;\
1019 if (__i != 0) {\
1020 (BAD) = TRU1;\
1021 warn("%p: corrupted upper canary: 0x%02X: %s, line %u",\
1022 __xl.p, __i, mdbg_file, mdbg_line);\
1024 if (BAD)\
1025 warn(" ..canary last seen: %s, line %u", __xc->file, __xc->line);\
1026 } while (0)
1028 struct chunk {
1029 struct chunk *prev;
1030 struct chunk *next;
1031 char const *file;
1032 ui16_t line;
1033 ui8_t isfree;
1034 ui8_t __dummy;
1035 ui32_t size;
1038 union ptr {
1039 void *p;
1040 struct chunk *c;
1041 char *cp;
1042 ui8_t *ui8p;
1045 struct chunk *_mlist, *_mfree;
1047 FL void *
1048 (smalloc)(size_t s SMALLOC_DEBUG_ARGS)
1050 union ptr p;
1052 if (s == 0)
1053 s = 1;
1054 s += sizeof(struct chunk) + _HOPE_SIZE;
1056 if ((p.p = (malloc)(s)) == NULL)
1057 _out_of_memory();
1058 p.c->prev = NULL;
1059 if ((p.c->next = _mlist) != NULL)
1060 _mlist->prev = p.c;
1061 p.c->file = mdbg_file;
1062 p.c->line = (ui16_t)mdbg_line;
1063 p.c->isfree = FAL0;
1064 p.c->size = (ui32_t)s;
1065 _mlist = p.c++;
1066 _HOPE_SET(p);
1067 return p.p;
1070 FL void *
1071 (srealloc)(void *v, size_t s SMALLOC_DEBUG_ARGS)
1073 union ptr p;
1074 bool_t isbad;
1076 if ((p.p = v) == NULL) {
1077 p.p = (smalloc)(s, mdbg_file, mdbg_line);
1078 goto jleave;
1081 _HOPE_GET(p, isbad);
1082 --p.c;
1083 if (p.c->isfree) {
1084 fprintf(stderr, "srealloc(): region freed! At %s, line %d\n"
1085 "\tLast seen: %s, line %d\n",
1086 mdbg_file, mdbg_line, p.c->file, p.c->line);
1087 goto jforce;
1090 if (p.c == _mlist)
1091 _mlist = p.c->next;
1092 else
1093 p.c->prev->next = p.c->next;
1094 if (p.c->next != NULL)
1095 p.c->next->prev = p.c->prev;
1097 jforce:
1098 if (s == 0)
1099 s = 1;
1100 s += sizeof(struct chunk) + _HOPE_SIZE;
1102 if ((p.p = (realloc)(p.c, s)) == NULL)
1103 _out_of_memory();
1104 p.c->prev = NULL;
1105 if ((p.c->next = _mlist) != NULL)
1106 _mlist->prev = p.c;
1107 p.c->file = mdbg_file;
1108 p.c->line = (ui16_t)mdbg_line;
1109 p.c->isfree = FAL0;
1110 p.c->size = (ui32_t)s;
1111 _mlist = p.c++;
1112 _HOPE_SET(p);
1113 jleave:
1114 return p.p;
1117 FL void *
1118 (scalloc)(size_t nmemb, size_t size SMALLOC_DEBUG_ARGS)
1120 union ptr p;
1122 if (size == 0)
1123 size = 1;
1124 if (nmemb == 0)
1125 nmemb = 1;
1126 size *= nmemb;
1127 size += sizeof(struct chunk) + _HOPE_SIZE;
1129 if ((p.p = (malloc)(size)) == NULL)
1130 _out_of_memory();
1131 memset(p.p, 0, size);
1132 p.c->prev = NULL;
1133 if ((p.c->next = _mlist) != NULL)
1134 _mlist->prev = p.c;
1135 p.c->file = mdbg_file;
1136 p.c->line = (ui16_t)mdbg_line;
1137 p.c->isfree = FAL0;
1138 p.c->size = (ui32_t)size;
1139 _mlist = p.c++;
1140 _HOPE_SET(p);
1141 return p.p;
1144 FL void
1145 (sfree)(void *v SMALLOC_DEBUG_ARGS)
1147 union ptr p;
1148 bool_t isbad;
1150 if ((p.p = v) == NULL) {
1151 fprintf(stderr, "sfree(NULL) from %s, line %d\n", mdbg_file, mdbg_line);
1152 goto jleave;
1155 _HOPE_GET(p, isbad);
1156 --p.c;
1157 if (p.c->isfree) {
1158 fprintf(stderr, "sfree(): double-free avoided at %s, line %d\n"
1159 "\tLast seen: %s, line %d\n",
1160 mdbg_file, mdbg_line, p.c->file, p.c->line);
1161 goto jleave;
1164 if (p.c == _mlist)
1165 _mlist = p.c->next;
1166 else
1167 p.c->prev->next = p.c->next;
1168 if (p.c->next != NULL)
1169 p.c->next->prev = p.c->prev;
1170 p.c->isfree = TRU1;
1172 if (options & OPT_DEBUG) {
1173 p.c->next = _mfree;
1174 _mfree = p.c;
1175 } else
1176 (free)(p.c);
1177 jleave:
1181 FL void
1182 smemreset(void)
1184 union ptr p;
1185 size_t c = 0, s = 0;
1187 for (p.c = _mfree; p.c != NULL;) {
1188 void *vp = p.c;
1189 ++c;
1190 s += p.c->size;
1191 p.c = p.c->next;
1192 (free)(vp);
1194 _mfree = NULL;
1196 if (options & OPT_DEBUG)
1197 fprintf(stderr, "smemreset(): freed %" ZFMT " chunks/%" ZFMT " bytes\n",
1198 c, s);
1201 FL int
1202 smemtrace(void *v)
1204 /* For _HOPE_GET() */
1205 char const * const mdbg_file = "smemtrace()";
1206 int const mdbg_line = -1;
1208 FILE *fp;
1209 char *cp;
1210 union ptr p, xp;
1211 bool_t isbad;
1212 size_t lines;
1214 v = (void*)0x1;
1215 if ((fp = Ftemp(&cp, "Ra", "w+", 0600, 1)) == NULL) {
1216 perror("tmpfile");
1217 goto jleave;
1219 rm(cp);
1220 Ftfree(&cp);
1222 fprintf(fp, "Currently allocated memory chunks:\n");
1223 for (lines = 0, p.c = _mlist; p.c != NULL; ++lines, p.c = p.c->next) {
1224 xp = p;
1225 ++xp.c;
1226 _HOPE_GET_TRACE(xp, isbad);
1227 fprintf(fp, "%s%p (%5" ZFMT " bytes): %s, line %u\n",
1228 (isbad ? "! CANARY ERROR: " : ""), xp.p,
1229 (size_t)(p.c->size - sizeof(struct chunk)), p.c->file, p.c->line);
1232 if (options & OPT_DEBUG) {
1233 fprintf(fp, "sfree()d memory chunks awaiting free():\n");
1234 for (p.c = _mfree; p.c != NULL; ++lines, p.c = p.c->next) {
1235 xp = p;
1236 ++xp.c;
1237 _HOPE_GET_TRACE(xp, isbad);
1238 fprintf(fp, "%s%p (%5" ZFMT " bytes): %s, line %u\n",
1239 (isbad ? "! CANARY ERROR: " : ""), xp.p,
1240 (size_t)(p.c->size - sizeof(struct chunk)), p.c->file, p.c->line);
1244 page_or_print(fp, lines);
1245 Fclose(fp);
1246 v = NULL;
1247 jleave:
1248 return (v != NULL);
1251 # ifdef MEMCHECK
1252 FL bool_t
1253 _smemcheck(char const *mdbg_file, int mdbg_line)
1255 union ptr p, xp;
1256 bool_t anybad = FAL0, isbad;
1257 size_t lines;
1259 for (lines = 0, p.c = _mlist; p.c != NULL; ++lines, p.c = p.c->next) {
1260 xp = p;
1261 ++xp.c;
1262 _HOPE_GET_TRACE(xp, isbad);
1263 if (isbad) {
1264 anybad = TRU1;
1265 fprintf(stderr,
1266 "! CANARY ERROR: %p (%5" ZFMT " bytes): %s, line %u\n",
1267 xp.p, (size_t)(p.c->size - sizeof(struct chunk)),
1268 p.c->file, p.c->line);
1272 if (options & OPT_DEBUG) {
1273 for (p.c = _mfree; p.c != NULL; ++lines, p.c = p.c->next) {
1274 xp = p;
1275 ++xp.c;
1276 _HOPE_GET_TRACE(xp, isbad);
1277 if (isbad) {
1278 anybad = TRU1;
1279 fprintf(stderr,
1280 "! CANARY ERROR: %p (%5" ZFMT " bytes): %s, line %u\n",
1281 xp.p, (size_t)(p.c->size - sizeof(struct chunk)),
1282 p.c->file, p.c->line);
1286 return anybad;
1288 # endif /* MEMCHECK */
1289 #endif /* HAVE_DEBUG */
1291 /* vim:set fenc=utf-8:s-it-mode (TODO only partial true) */