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>.
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>
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
;
71 panic(char const *format
, ...)
75 fprintf(stderr
, tr(1, "Panic: "));
78 vfprintf(stderr
, format
, ap
);
88 warn(char const *format
, ...)
92 fprintf(stderr
, tr(1, "Panic: "));
95 vfprintf(stderr
, format
, ap
);
104 safe_signal(int signum
, sighandler_type handler
)
106 struct sigaction nact
, oact
;
108 nact
.sa_handler
= handler
;
109 sigemptyset(&nact
.sa_mask
);
112 nact
.sa_flags
|= SA_RESTART
;
114 return ((sigaction(signum
, &nact
, &oact
) != 0) ? SIG_ERR
: oact
.sa_handler
);
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
);
132 if (--_alls_depth
== 0)
133 sigprocmask(SIG_SETMASK
, &_alls_oset
, (sigset_t
*)NULL
);
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
);
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.
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.
174 is_dir(char const *name
)
178 if (stat(name
, &sbuf
) < 0)
180 return(S_ISDIR(sbuf
.st_mode
));
184 * Count the number of arguments in the given string raw list.
187 argcount(char **argv
)
191 for (ap
= argv
; *ap
++ != NULL
;)
193 return ap
- argv
- 1;
197 colalign(const char *cp
, int col
, int fill
, int *cols_decr_used_or_null
)
199 int col_orig
= col
, n
, sz
;
202 np
= nb
= salloc(mb_cur_max
* strlen(cp
) + col
+ 1);
205 if (mb_cur_max
> 1) {
208 if ((sz
= mbtowc(&wc
, cp
, mb_cur_max
)) < 0) {
211 if ((n
= wcwidth(wc
)) < 0)
222 if (sz
== 1 && spacechar(*cp
)) {
230 if (fill
&& col
!= 0) {
232 memmove(nb
+ col
, nb
, (size_t)(np
- nb
));
233 memset(nb
, ' ', col
);
235 memset(np
, ' ', col
);
241 if (cols_decr_used_or_null
!= NULL
)
242 *cols_decr_used_or_null
-= col_orig
- col
;
247 paging_seems_sensible(void)
252 if (IS_TTY_SESSION() && (cp
= voption("crt")) != NULL
)
253 ret
= (*cp
!= '\0') ? (size_t)atol(cp
) : (size_t)scrnheight
;
258 page_or_print(FILE *fp
, size_t lines
)
265 if ((rows
= paging_seems_sensible()) != 0 && lines
== 0) {
266 while ((c
= getc(fp
)) != EOF
)
267 if (c
== '\n' && ++lines
> rows
)
272 if (rows
!= 0 && lines
>= rows
)
273 run_command(get_pager(), 0, fileno(fp
), -1, NULL
, NULL
, NULL
);
275 while ((c
= getc(fp
)) != EOF
)
280 which_protocol(const char *name
)
282 register const char *cp
;
288 if (name
[0] == '%' && name
[1] == ':')
290 for (cp
= name
; *cp
&& *cp
!= ':'; cp
++)
291 if (!alnumchar(*cp
&0377))
293 if (cp
[0] == ':' && cp
[1] == '/' && cp
[2] == '/') {
294 if (strncmp(name
, "pop3://", 7) == 0)
299 tr(216, "No POP3 support compiled in.\n"));
301 if (strncmp(name
, "pop3s://", 8) == 0)
306 tr(225, "No SSL support compiled in.\n"));
308 if (strncmp(name
, "imap://", 7) == 0)
313 tr(269, "No IMAP support compiled in.\n"));
315 if (strncmp(name
, "imaps://", 8) == 0)
320 tr(225, "No SSL support compiled in.\n"));
322 return PROTO_UNKNOWN
;
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 &&
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)
366 h
= (h
<< 4 & 0xffffffff) + (*cp
&0377);
367 if ((g
= h
& 0xf0000000) != 0) {
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
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
))
391 if (i
== sizeof primes
/ sizeof *primes
)
392 mprime
= n
; /* not so prime, but better than failure */
397 expand_shell_escape(char const **s
, bool_t use_nail_extensions
)
402 if ((c
= *xs
& 0xFF) == '\0')
408 switch ((c
= *xs
& 0xFF)) {
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;
419 for (++xs
, c
= 0, n
= 4; --n
> 0 && octalchar(*xs
); ++xs
) {
424 /* S-nail extension for nice (get)prompt(()) support */
429 if (use_nail_extensions
) {
431 case '&': c
= boption("bsdcompat") ? '&' : '?'; break;
432 case '?': c
= exec_last_comm_error
? '1' : '0'; break;
433 case '$': c
= PROMPT_DOLLAR
; break;
434 case '@': c
= PROMPT_AT
; break;
440 /* A sole <backslash> at EOS is treated as-is! */
455 static char buf
[PROMPT_BUFFER_SIZE
];
460 if ((ccp
= voption("prompt")) == NULL
|| *ccp
== '\0')
463 for (; PTRCMP(cp
, <, buf
+ sizeof(buf
) - 1); ++cp
) {
466 int c
= expand_shell_escape(&ccp
, TRU1
);
472 if (c
== 0 || c
== PROMPT_STOP
)
475 a
= (c
== PROMPT_DOLLAR
) ? account_name
: displayname
;
479 if (PTRCMP(cp
+ l
, >=, buf
+ sizeof(buf
) - 1))
492 nodename(int mayoverride
)
494 static char *hostname
;
499 struct addrinfo hints
, *res
;
501 struct hostent
*hent
;
505 if (mayoverride
&& (hn
= value("hostname")) != NULL
&& *hn
!= '\0') {
506 if (hostname
!= NULL
)
508 hostname
= sstrdup(hn
);
509 } else if (hostname
== NULL
) {
514 memset(&hints
, 0, sizeof hints
);
515 hints
.ai_family
= AF_UNSPEC
;
516 hints
.ai_socktype
= SOCK_DGRAM
; /* dummy */
517 hints
.ai_flags
= AI_CANONNAME
;
518 if (getaddrinfo(hn
, "0", &hints
, &res
) == 0) {
519 if (res
->ai_canonname
!= NULL
) {
520 size_t l
= strlen(res
->ai_canonname
);
521 hn
= ac_alloc(l
+ 1);
522 memcpy(hn
, res
->ai_canonname
, l
+ 1);
527 hent
= gethostbyname(hn
);
533 hostname
= sstrdup(hn
);
534 #if defined HAVE_SOCKETS && defined HAVE_IPV6
535 if (hn
!= ut
.nodename
)
543 lookup_password_for_token(char const *token
)
549 var
= ac_alloc(tl
+ 10);
551 memcpy(var
, "password-", 9);
552 memcpy(var
+ 9, token
, tl
);
555 if ((cp
= value(var
)) != NULL
)
562 getrandstring(size_t length
)
564 static unsigned char nodedigest
[16];
576 data
= ac_alloc(length
);
577 if ((fd
= open("/dev/urandom", O_RDONLY
)) < 0 ||
578 length
!= (size_t)read(fd
, data
, length
)) {
585 md5_update(&ctx
, (unsigned char*)cp
, strlen(cp
));
586 md5_final(nodedigest
, &ctx
);
588 /* In that case it's only used for boundaries and
589 * Message-Id:s so that srand(3) should suffice */
591 for (i
= 0; i
< sizeof(nodedigest
); ++i
)
592 nodedigest
[i
] = (unsigned char)(
596 for (i
= 0; i
< length
; i
++)
598 (int)(255 * (rand() / (RAND_MAX
+ 1.0))) ^
599 nodedigest
[i
% sizeof nodedigest
]);
604 (void)b64_encode_buf(&b64
, data
, length
, B64_SALLOC
);
606 assert(length
< b64
.l
);
607 b64
.s
[length
] = '\0';
613 md5tohex(char hex
[MD5TOHEX_SIZE
], void const *vp
)
618 for (i
= 0; i
< MD5TOHEX_SIZE
/ 2; i
++) {
620 hex
[j
] = hexchar((cp
[i
] & 0xf0) >> 4);
621 hex
[++j
] = hexchar(cp
[i
] & 0x0f);
627 cram_md5_string(char const *user
, char const *pass
, char const *b64
)
630 char digest
[16], *cp
;
636 (void)b64_decode(&out
, &in
, NULL
);
637 assert(out
.s
!= NULL
);
639 hmac_md5((unsigned char*)out
.s
, out
.l
, UNCONST(pass
), strlen(pass
),
642 cp
= md5tohex(salloc(MD5TOHEX_SIZE
+ 1), digest
);
645 in
.l
= lu
+ MD5TOHEX_SIZE
+1;
646 in
.s
= ac_alloc(lu
+ 1 + MD5TOHEX_SIZE
+1);
647 memcpy(in
.s
, user
, lu
);
649 memcpy(in
.s
+ lu
+ 1, cp
, MD5TOHEX_SIZE
);
650 (void)b64_encode(&out
, &in
, B64_SALLOC
|B64_CRLF
);
654 #endif /* HAVE_MD5 */
657 makedir(const char *name
)
662 if (mkdir(name
, 0700) < 0) {
664 if ((e
== EEXIST
|| e
== ENOSYS
) &&
665 stat(name
, &st
) == 0 &&
666 (st
.st_mode
&S_IFMT
) == S_IFDIR
)
677 if ((cw
->cw_fd
= open(".", O_RDONLY
)) < 0)
679 if (fchdir(cw
->cw_fd
) < 0) {
689 if (fchdir(cw
->cw_fd
) < 0)
695 cwrelse(struct cw
*cw
)
699 #else /* !HAVE_FCHDIR */
703 if (getcwd(cw
->cw_wd
, sizeof cw
->cw_wd
) == NULL
|| chdir(cw
->cw_wd
) < 0)
711 if (chdir(cw
->cw_wd
) < 0)
718 cwrelse(struct cw
*cw
)
722 #endif /* !HAVE_FCHDIR */
725 makeprint(struct str
const *in
, struct str
*out
)
727 static int print_all_chars
= -1;
728 char const *inp
, *maxp
;
732 if (print_all_chars
== -1)
733 print_all_chars
= (value("print-all-chars") != NULL
);
736 out
->s
= outp
= smalloc(msz
);
740 if (print_all_chars
) {
742 memcpy(outp
, inp
, out
->l
);
746 #ifdef HAVE_C90AMEND1
747 if (mb_cur_max
> 1) {
748 char mbb
[MB_LEN_MAX
+ 1];
756 n
= mbtowc(&wc
, inp
, maxp
- inp
);
762 /* FIXME Why mbtowc() resetting here?
763 * FIXME what about ISO 2022-JP plus -- those
764 * FIXME will loose shifts, then!
765 * FIXME THUS - we'd need special "known points"
766 * FIXME to do so - say, after a newline!!
767 * FIXME WE NEED TO CHANGE ALL USES +MBLEN! */
768 (void)mbtowc(&wc
, NULL
, mb_cur_max
);
769 wc
= utf8
? 0xFFFD : '?';
774 if (!iswprint(wc
) && wc
!= '\n' && wc
!= '\r' &&
775 wc
!= '\b' && wc
!= '\t') {
776 if ((wc
& ~(wchar_t)037) == 0)
777 wc
= utf8
? 0x2400 | wc
: '?';
779 wc
= utf8
? 0x2421 : '?';
781 wc
= utf8
? 0x2426 : '?';
783 if ((n
= wctomb(mbb
, wc
)) <= 0)
786 if (out
->l
>= msz
- 1) {
787 dist
= outp
- out
->s
;
788 out
->s
= srealloc(out
->s
, msz
+= 32);
789 outp
= &out
->s
[dist
];
791 for (i
= 0; i
< n
; i
++)
795 #endif /* C90AMEND1 */
800 if (!isprint(c
) && c
!= '\n' && c
!= '\r' &&
801 c
!= '\b' && c
!= '\t')
808 out
->s
[out
->l
] = '\0';
819 makeprint(&in
, &out
);
820 rp
= salloc(out
.l
+ 1);
821 memcpy(rp
, out
.s
, out
.l
);
828 prout(const char *s
, size_t sz
, FILE *fp
)
835 makeprint(&in
, &out
);
836 n
= fwrite(out
.s
, 1, out
.l
, fp
);
842 putuc(int u
, int c
, FILE *fp
)
847 #ifdef HAVE_C90AMEND1
848 if (utf8
&& (u
& ~(wchar_t)0177)) {
849 char mbb
[MB_LEN_MAX
];
851 if ((n
= wctomb(mbb
, u
)) > 0) {
853 for (i
= 0; i
< n
; ++i
)
854 if (putc(mbb
[i
] & 0377, fp
) == EOF
) {
859 rv
= (putc('\0', fp
) != EOF
);
864 rv
= (putc(c
, fp
) != EOF
);
869 time_current_update(struct time_current
*tc
, bool_t full_update
)
871 tc
->tc_time
= time(NULL
);
873 memcpy(&tc
->tc_gm
, gmtime(&tc
->tc_time
), sizeof tc
->tc_gm
);
874 memcpy(&tc
->tc_local
, localtime(&tc
->tc_time
),
875 sizeof tc
->tc_local
);
876 sstpcpy(tc
->tc_ctime
, ctime(&tc
->tc_time
));
887 (smalloc_safe
)(size_t s SMALLOC_DEBUG_ARGS
)
892 rv
= (smalloc
)(s SMALLOC_DEBUG_ARGSCALL
);
898 (srealloc_safe
)(void *v
, size_t s SMALLOC_DEBUG_ARGS
)
903 rv
= (srealloc
)(v
, s SMALLOC_DEBUG_ARGSCALL
);
910 (scalloc_safe
)(size_t nmemb
, size_t size SMALLOC_DEBUG_ARGS
)
915 rv
= (scalloc
)(nmemb
, size SMALLOC_DEBUG_ARGSCALL
);
923 smalloc(size_t s SMALLOC_DEBUG_ARGS
)
929 if ((rv
= malloc(s
)) == NULL
)
935 srealloc(void *v
, size_t s SMALLOC_DEBUG_ARGS
)
943 else if ((rv
= realloc(v
, s
)) == NULL
)
949 scalloc(size_t nmemb
, size_t size SMALLOC_DEBUG_ARGS
)
955 if ((rv
= calloc(nmemb
, size
)) == NULL
)
960 #else /* !HAVE_DEBUG */
961 CTA(sizeof(char) == sizeof(ui8_t
));
963 # define _HOPE_SIZE (2 * 8 * sizeof(char))
964 # define _HOPE_SET(C) \
966 union ptr __xl, __xu;\
972 __xl.ui8p[0]=0xDE; __xl.ui8p[1]=0xAA; __xl.ui8p[2]=0x55; __xl.ui8p[3]=0xAD;\
973 __xl.ui8p[4]=0xBE; __xl.ui8p[5]=0x55; __xl.ui8p[6]=0xAA; __xl.ui8p[7]=0xEF;\
974 __xu.ui8p += __xc->size - 8;\
975 __xu.ui8p[0]=0xDE; __xu.ui8p[1]=0xAA; __xu.ui8p[2]=0x55; __xu.ui8p[3]=0xAD;\
976 __xu.ui8p[4]=0xBE; __xu.ui8p[5]=0x55; __xu.ui8p[6]=0xAA; __xu.ui8p[7]=0xEF;\
978 # define _HOPE_GET_TRACE(C,BAD) do {(C).cp += 8; _HOPE_GET(C, BAD);} while(0)
979 # define _HOPE_GET(C,BAD) \
981 union ptr __xl, __xu;\
990 if (__xl.ui8p[0] != 0xDE) __i |= 1<<0;\
991 if (__xl.ui8p[1] != 0xAA) __i |= 1<<1;\
992 if (__xl.ui8p[2] != 0x55) __i |= 1<<2;\
993 if (__xl.ui8p[3] != 0xAD) __i |= 1<<3;\
994 if (__xl.ui8p[4] != 0xBE) __i |= 1<<4;\
995 if (__xl.ui8p[5] != 0x55) __i |= 1<<5;\
996 if (__xl.ui8p[6] != 0xAA) __i |= 1<<6;\
997 if (__xl.ui8p[7] != 0xEF) __i |= 1<<7;\
1000 warn("%p: corrupted lower canary: 0x%02X: %s, line %u",\
1001 __xl.p, __i, mdbg_file, mdbg_line);\
1004 __xu.ui8p += __xc->size - 8;\
1006 if (__xu.ui8p[0] != 0xDE) __i |= 1<<0;\
1007 if (__xu.ui8p[1] != 0xAA) __i |= 1<<1;\
1008 if (__xu.ui8p[2] != 0x55) __i |= 1<<2;\
1009 if (__xu.ui8p[3] != 0xAD) __i |= 1<<3;\
1010 if (__xu.ui8p[4] != 0xBE) __i |= 1<<4;\
1011 if (__xu.ui8p[5] != 0x55) __i |= 1<<5;\
1012 if (__xu.ui8p[6] != 0xAA) __i |= 1<<6;\
1013 if (__xu.ui8p[7] != 0xEF) __i |= 1<<7;\
1016 warn("%p: corrupted upper canary: 0x%02X: %s, line %u",\
1017 __xl.p, __i, mdbg_file, mdbg_line);\
1020 warn(" ..canary last seen: %s, line %u", __xc->file, __xc->line);\
1040 struct chunk
*_mlist
, *_mfree
;
1043 (smalloc
)(size_t s SMALLOC_DEBUG_ARGS
)
1049 s
+= sizeof(struct chunk
) + _HOPE_SIZE
;
1051 if ((p
.p
= (malloc
)(s
)) == NULL
)
1054 if ((p
.c
->next
= _mlist
) != NULL
)
1056 p
.c
->file
= mdbg_file
;
1057 p
.c
->line
= (ui16_t
)mdbg_line
;
1059 p
.c
->size
= (ui32_t
)s
;
1066 (srealloc
)(void *v
, size_t s SMALLOC_DEBUG_ARGS
)
1071 if ((p
.p
= v
) == NULL
) {
1072 p
.p
= (smalloc
)(s
, mdbg_file
, mdbg_line
);
1076 _HOPE_GET(p
, isbad
);
1079 fprintf(stderr
, "srealloc(): region freed! At %s, line %d\n"
1080 "\tLast seen: %s, line %d\n",
1081 mdbg_file
, mdbg_line
, p
.c
->file
, p
.c
->line
);
1088 p
.c
->prev
->next
= p
.c
->next
;
1089 if (p
.c
->next
!= NULL
)
1090 p
.c
->next
->prev
= p
.c
->prev
;
1095 s
+= sizeof(struct chunk
) + _HOPE_SIZE
;
1097 if ((p
.p
= (realloc
)(p
.c
, s
)) == NULL
)
1100 if ((p
.c
->next
= _mlist
) != NULL
)
1102 p
.c
->file
= mdbg_file
;
1103 p
.c
->line
= (ui16_t
)mdbg_line
;
1105 p
.c
->size
= (ui32_t
)s
;
1113 (scalloc
)(size_t nmemb
, size_t size SMALLOC_DEBUG_ARGS
)
1122 size
+= sizeof(struct chunk
) + _HOPE_SIZE
;
1124 if ((p
.p
= (malloc
)(size
)) == NULL
)
1126 memset(p
.p
, 0, size
);
1128 if ((p
.c
->next
= _mlist
) != NULL
)
1130 p
.c
->file
= mdbg_file
;
1131 p
.c
->line
= (ui16_t
)mdbg_line
;
1133 p
.c
->size
= (ui32_t
)size
;
1140 (sfree
)(void *v SMALLOC_DEBUG_ARGS
)
1145 if ((p
.p
= v
) == NULL
) {
1146 fprintf(stderr
, "sfree(NULL) from %s, line %d\n", mdbg_file
, mdbg_line
);
1150 _HOPE_GET(p
, isbad
);
1153 fprintf(stderr
, "sfree(): double-free avoided at %s, line %d\n"
1154 "\tLast seen: %s, line %d\n",
1155 mdbg_file
, mdbg_line
, p
.c
->file
, p
.c
->line
);
1162 p
.c
->prev
->next
= p
.c
->next
;
1163 if (p
.c
->next
!= NULL
)
1164 p
.c
->next
->prev
= p
.c
->prev
;
1167 if (options
& OPT_DEBUG
) {
1180 size_t c
= 0, s
= 0;
1182 for (p
.c
= _mfree
; p
.c
!= NULL
;) {
1191 if (options
& OPT_DEBUG
)
1192 fprintf(stderr
, "smemreset(): freed %" ZFMT
" chunks/%" ZFMT
" bytes\n",
1199 /* For _HOPE_GET() */
1200 char const * const mdbg_file
= "smemtrace()";
1201 int const mdbg_line
= -1;
1210 if ((fp
= Ftemp(&cp
, "Ra", "w+", 0600, 1)) == NULL
) {
1217 fprintf(fp
, "Currently allocated memory chunks:\n");
1218 for (lines
= 0, p
.c
= _mlist
; p
.c
!= NULL
; ++lines
, p
.c
= p
.c
->next
) {
1221 _HOPE_GET_TRACE(xp
, isbad
);
1222 fprintf(fp
, "%s%p (%5" ZFMT
" bytes): %s, line %u\n",
1223 (isbad
? "! CANARY ERROR: " : ""), xp
.p
,
1224 (size_t)(p
.c
->size
- sizeof(struct chunk
)), p
.c
->file
, p
.c
->line
);
1227 if (options
& OPT_DEBUG
) {
1228 fprintf(fp
, "sfree()d memory chunks awaiting free():\n");
1229 for (p
.c
= _mfree
; p
.c
!= NULL
; ++lines
, p
.c
= p
.c
->next
) {
1232 _HOPE_GET_TRACE(xp
, isbad
);
1233 fprintf(fp
, "%s%p (%5" ZFMT
" bytes): %s, line %u\n",
1234 (isbad
? "! CANARY ERROR: " : ""), xp
.p
,
1235 (size_t)(p
.c
->size
- sizeof(struct chunk
)), p
.c
->file
, p
.c
->line
);
1239 page_or_print(fp
, lines
);
1248 _smemcheck(char const *mdbg_file
, int mdbg_line
)
1251 bool_t anybad
= FAL0
, isbad
;
1254 for (lines
= 0, p
.c
= _mlist
; p
.c
!= NULL
; ++lines
, p
.c
= p
.c
->next
) {
1257 _HOPE_GET_TRACE(xp
, isbad
);
1261 "! CANARY ERROR: %p (%5" ZFMT
" bytes): %s, line %u\n",
1262 xp
.p
, (size_t)(p
.c
->size
- sizeof(struct chunk
)),
1263 p
.c
->file
, p
.c
->line
);
1267 if (options
& OPT_DEBUG
) {
1268 for (p
.c
= _mfree
; p
.c
!= NULL
; ++lines
, p
.c
= p
.c
->next
) {
1271 _HOPE_GET_TRACE(xp
, isbad
);
1275 "! CANARY ERROR: %p (%5" ZFMT
" bytes): %s, line %u\n",
1276 xp
.p
, (size_t)(p
.c
->size
- sizeof(struct chunk
)),
1277 p
.c
->file
, p
.c
->line
);
1283 # endif /* MEMCHECK */
1284 #endif /* HAVE_DEBUG */
1286 /* vim:set fenc=utf-8:s-it-mode (TODO only partial true) */