2 * 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 Steffen "Daode" Nurpmeso.
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 * Mail -- a mail program
56 static struct name
* tailof(struct name
*name
);
57 static struct name
* extract1(char *line
, enum gfield ntype
,
58 char *separators
, int copypfx
);
59 static char * yankword(char *ap
, char *wbuf
, char *separators
,
61 static int same_name(char *n1
, char *n2
);
62 static struct name
* gexpand(struct name
*nlist
, struct grouphead
*gh
,
63 int metoo
, int ntype
);
64 static struct name
* put(struct name
*list
, struct name
*node
);
65 static struct name
* delname(struct name
*np
, char *name
);
68 * Allocate a single element of a name list, initialize its name field to the
69 * passed name and return it.
72 nalloc(char *str
, enum gfield ntype
)
78 np
= (struct name
*)salloc(sizeof *np
);
84 (void)addrspec_with_guts((ntype
& (GFULL
|GSKIN
|GREF
)) != 0, str
, &ag
);
85 if ((ag
.ag_n_flags
& NAME_NAME_SALLOC
) == 0) {
86 ag
.ag_n_flags
|= NAME_NAME_SALLOC
;
87 ag
.ag_skinned
= savestrbuf(ag
.ag_skinned
, ag
.ag_slen
);
89 np
->n_fullname
= np
->n_name
= ag
.ag_skinned
;
90 np
->n_flags
= ag
.ag_n_flags
;
93 if (ag
.ag_ilen
== ag
.ag_slen
95 && (ag
.ag_n_flags
& NAME_IDNA
) == 0
99 if (ag
.ag_n_flags
& NAME_ADDRSPEC_ISFILEORPIPE
)
102 if ((ag
.ag_n_flags
& NAME_IDNA
) == 0) {
109 * The domain name was IDNA and has been converted.
110 * We also have to ensure that the domain name in
111 * .n_fullname is replaced with the converted version,
112 * since MIME doesn't perform encoding of addresses.
114 size_t l
= ag
.ag_iaddr_start
,
115 lsuff
= ag
.ag_ilen
- ag
.ag_iaddr_end
;
116 in
.s
= ac_alloc(l
+ ag
.ag_slen
+ lsuff
+ 1);
117 memcpy(in
.s
, str
, l
);
118 memcpy(in
.s
+ l
, ag
.ag_skinned
, ag
.ag_slen
);
120 memcpy(in
.s
+ l
, str
+ ag
.ag_iaddr_end
, lsuff
);
126 mime_fromhdr(&in
, &out
, TD_ISPR
|TD_ICONV
);
127 np
->n_fullname
= savestr(out
.s
);
130 if (ag
.ag_n_flags
& NAME_IDNA
)
133 np
->n_flags
|= NAME_FULLNAME_SALLOC
;
134 } else if (ntype
& GREF
) { /* TODO LEGACY */
135 /* TODO Unfortunately we had to skin GREFerences i.e. the
136 * TODO surrounding angle brackets have been stripped away.
137 * TODO Necessarily since otherwise the plain address check
138 * TODO fails due to them; insert them back so that valid
139 * TODO headers will be created */
140 np
->n_fullname
= np
->n_name
= str
= salloc(ag
.ag_slen
+ 2 + 1);
142 memcpy(str
, ag
.ag_skinned
, ag
.ag_slen
);
152 ndup(struct name
*np
, enum gfield ntype
)
156 if ((ntype
& (GFULL
|GSKIN
)) && (np
->n_flags
& NAME_SKINNED
) == 0) {
157 nnp
= nalloc(np
->n_name
, ntype
);
161 nnp
= (struct name
*)salloc(sizeof *np
);
162 nnp
->n_flink
= nnp
->n_blink
= NULL
;
164 nnp
->n_flags
= (np
->n_flags
&
165 ~(NAME_NAME_SALLOC
| NAME_FULLNAME_SALLOC
)) |
167 nnp
->n_name
= savestr(np
->n_name
);
168 if (np
->n_name
== np
->n_fullname
|| (ntype
& (GFULL
|GSKIN
)) == 0)
169 nnp
->n_fullname
= nnp
->n_name
;
171 nnp
->n_flags
|= NAME_FULLNAME_SALLOC
;
172 nnp
->n_fullname
= savestr(np
->n_fullname
);
179 * Find the tail of a list and return it.
182 tailof(struct name
*name
)
189 while (np
->n_flink
!= NULL
)
195 * Extract a list of names from a line,
196 * and make a list of names from it.
197 * Return the list or NULL if none found.
200 extract(char *line
, enum gfield ntype
)
202 return extract1(line
, ntype
, " \t,(", 0);
206 sextract(char *line
, enum gfield ntype
)
208 if (line
&& strpbrk(line
, ",\"\\(<"))
209 return extract1(line
, ntype
, ",", 1);
211 return extract(line
, ntype
);
215 lextract(char *line
, enum gfield ntype
)
217 return (extract1(line
, ntype
, ",", 1));
221 extract1(char *line
, enum gfield ntype
, char *separators
, int copypfx
)
224 struct name
*top
, *np
, *t
;
226 if (line
== NULL
|| *line
== '\0')
231 nbuf
= ac_alloc(strlen(line
) + 1);
232 while ((cp
= yankword(cp
, nbuf
, separators
, copypfx
)) != NULL
) {
233 t
= nalloc(nbuf
, ntype
);
246 * Turn a list of names into a string of the same names.
249 detract(struct name
*np
, enum gfield ntype
)
256 comma
= ntype
& GCOMMA
;
261 if ((debug
|| value("debug")) && comma
)
262 fprintf(stderr
, catgets(catd
, CATSET
, 145,
263 "detract asked to insert commas\n"));
264 for (p
= np
; p
!= NULL
; p
= p
->n_flink
) {
265 if (ntype
&& (p
->n_type
& GMASK
) != ntype
)
267 s
+= strlen(p
->n_fullname
) + 1;
276 for (p
= np
; p
!= NULL
; p
= p
->n_flink
) {
277 if (ntype
&& (p
->n_type
& GMASK
) != ntype
)
279 cp
= sstpcpy(cp
, p
->n_fullname
);
280 if (comma
&& p
->n_flink
!= NULL
)
285 if (comma
&& *--cp
== ',')
291 * Grab a single word (liberal word)
292 * Throw away things between ()'s, and take anything between <>.
293 * Strip trailing whitespace as *ap* may come directly from user.
296 yankword(char *ap
, char *wbuf
, char *separators
, int copypfx
)
302 while (blankspacechar(*cp
) || *cp
== ',')
305 if ((cp
= (char*)nexttoken((char*)cp
)) == NULL
)
311 while (*cp
&& (*wp
++ = *cp
++) != '>');
315 while (*cp
&& (incomm
|| !strchr(separators
, *cp
))) {
317 if (cp
== ap
|| *(cp
- 1) != '\\') {
323 } else if (cp
!= ap
) {
332 while (wp
> wbuf
&& blankspacechar(wp
[-1]))
339 * Check all addresses in np and delete invalid ones.
342 checkaddrs(struct name
*np
)
346 for (n
= np
; n
!= NULL
;) {
347 if (is_addr_invalid(n
, 1)) {
349 n
->n_blink
->n_flink
= n
->n_flink
;
351 n
->n_flink
->n_blink
= n
->n_blink
;
361 * For each recipient in the passed name list with a /
362 * in the name, append the message to the end of the named file
363 * and remove him from the recipient list.
365 * Recipients whose name begins with | are piped through the given
366 * program and removed.
369 outof(struct name
*names
, FILE *fo
, struct header
*hp
)
371 int pipecnt
, xcnt
, *fda
, i
;
375 FILE *fin
= NULL
, *fout
;
379 * Look through all recipients and do a quick return if no file or pipe
380 * addressee is found.
382 fda
= NULL
; /* Silence cc */
383 for (pipecnt
= xcnt
= 0, np
= names
; np
!= NULL
; np
= np
->n_flink
)
384 switch (np
->n_flags
& NAME_ADDRSPEC_ISFILEORPIPE
) {
385 case NAME_ADDRSPEC_ISFILE
:
388 case NAME_ADDRSPEC_ISPIPE
:
392 if (pipecnt
== 0 && xcnt
== 0)
396 * Otherwise create an array of file descriptors for each found pipe
397 * addressee to get around the dup(2)-shared-file-offset problem, i.e.,
398 * each pipe subprocess needs its very own file descriptor, and we need
400 * To make our life a bit easier let's just use the auto-reclaimed
407 fda
= (int*)salloc(sizeof(int) * pipecnt
);
408 for (i
= 0; i
< pipecnt
; ++i
)
410 if ((shell
= value("SHELL")) == NULL
)
417 for (np
= names
; np
!= NULL
;) {
418 if ((np
->n_flags
& (NAME_ADDRSPEC_ISFILE
|NAME_ADDRSPEC_ISPIPE
))
425 * See if we have copied the complete message out yet.
432 if ((fout
= Ftemp(&tempEdit
, "Re", "w", 0600, 1))
434 perror(tr(146, "Creation of temporary image"));
438 image
= open(tempEdit
, O_RDWR
);
440 for (i
= 0; i
< pipecnt
; ++i
) {
441 int fd
= open(tempEdit
, O_RDONLY
);
449 (void)fcntl(fd
, F_SETFD
, FD_CLOEXEC
);
454 perror(tr(147, "Creating descriptor duplicate "
455 "of temporary image"));
460 fcntl(image
, F_SETFD
, FD_CLOEXEC
);
462 fprintf(fout
, "From %s %s", myname
, date
);
464 while (i
= c
, (c
= getc(fo
)) != EOF
)
472 perror(tr(148, "Finalizing write of temporary "
479 /* If we have to serve file addressees, open reader */
480 if (xcnt
!= 0 && (fin
= Fdopen(image
, "r")) == NULL
) {
481 perror(tr(149, "Failed to open a duplicate of "
482 "the temporary image"));
483 jcantfout
: ++senderr
;
489 /* From now on use xcnt as a counter for pipecnt */
494 * Now either copy "image" to the desired file
495 * or give it as the standard input to the desired
496 * program as appropriate.
499 if (np
->n_flags
& NAME_ADDRSPEC_ISPIPE
) {
504 sigaddset(&nset
, SIGHUP
);
505 sigaddset(&nset
, SIGINT
);
506 sigaddset(&nset
, SIGQUIT
);
507 pid
= start_command(shell
, &nset
,
508 fda
[xcnt
++], -1, "-c", np
->n_name
+ 1, NULL
);
510 fprintf(stderr
, tr(281,
511 "Message piping to <%s> failed\n"),
518 char *fname
= file_expand(np
->n_name
);
520 fprintf(stderr
, tr(81,
521 "\"%s\": Expansion failed.\n"),
526 if ((fout
= Zopen(fname
, "a", NULL
)) == NULL
) {
527 fprintf(stderr
, tr(282,
528 "Message writing to <%s> failed: %s\n"),
529 fname
, strerror(errno
));
534 while ((i
= getc(fin
)) != EOF
)
537 fprintf(stderr
, tr(282,
538 "Message writing to <%s> failed: %s\n"),
539 fname
, tr(283, "write error"));
546 * In days of old we removed the entry from the
547 * the list; now for sake of header expansion
548 * we leave it in and mark it as deleted.
558 for (i
= 0; i
< pipecnt
; ++i
)
568 if ((np
->n_flags
& (NAME_ADDRSPEC_ISFILE
|NAME_ADDRSPEC_ISPIPE
))
577 same_name(char *n1
, char *n2
)
581 if (value("allnet") != NULL
) {
589 } while (c1
!= '\0' && c2
!= '\0' && c1
!= '@' && c2
!= '@');
592 return asccasecmp(n1
, n2
) == 0;
596 * Map all of the aliased users in the invoker's mailrc
597 * file and insert them into the list.
598 * Changed after all these months of service to recursively
599 * expand names (2/14/80).
603 usermap(struct name
*names
)
605 struct name
*new, *np
, *cp
;
606 struct grouphead
*gh
;
611 metoo
= (value("metoo") != NULL
);
613 if (np
->n_name
[0] == '\\') {
619 gh
= findgroup(np
->n_name
);
622 new = gexpand(new, gh
, metoo
, np
->n_type
);
631 * Recursively expand a group name. We limit the expansion to some
632 * fixed level to keep things from going haywire.
633 * Direct recursion is not expanded for convenience.
637 gexpand(struct name
*nlist
, struct grouphead
*gh
, int metoo
, int ntype
)
640 struct grouphead
*ngh
;
645 if (depth
> MAXEXP
) {
646 printf(catgets(catd
, CATSET
, 150,
647 "Expanding alias to depth larger than %d\n"), MAXEXP
);
651 for (gp
= gh
->g_list
; gp
!= NULL
; gp
= gp
->ge_link
) {
655 if (strcmp(cp
, gh
->g_name
) == 0)
657 if ((ngh
= findgroup(cp
)) != NULL
) {
658 nlist
= gexpand(nlist
, ngh
, metoo
, ntype
);
662 np
= nalloc(cp
, ntype
|GFULL
);
664 * At this point should allow to expand
665 * to self if only person in group
667 if (gp
== gh
->g_list
&& gp
->ge_link
== NULL
)
669 if (!metoo
&& same_name(cp
, myname
))
672 nlist
= put(nlist
, np
);
679 * Concatenate the two passed name lists, return the result.
682 cat(struct name
*n1
, struct name
*n2
)
697 * Unpack the name list onto a vector of strings.
698 * Return an error if the name list won't fit.
701 unpack(struct name
*np
)
705 int t
, extra
, metoo
, verbose
;
708 if ((t
= count(n
)) == 0)
709 panic(catgets(catd
, CATSET
, 151, "No names to unpack"));
711 * Compute the number of extra arguments we will need.
712 * We need at least two extra -- one for "mail" and one for
713 * the terminating 0 pointer. Additional spots may be needed
714 * to pass along -f to the host mailer.
718 metoo
= value("metoo") != NULL
;
721 verbose
= value("verbose") != NULL
;
725 top
= (char **)salloc((t
+ extra
) * sizeof *top
);
733 for (; n
!= NULL
; n
= n
->n_flink
)
734 if ((n
->n_type
& GDEL
) == 0)
741 * Remove all of the duplicates from the passed name list by
742 * insertion sorting them, then checking for dups.
743 * Return the head of the new list.
746 elide(struct name
*names
)
748 struct name
*np
, *t
, *newn
, *x
;
752 /* Throw away all deleted nodes (XXX merge with plain sort below?) */
753 for (newn
= np
= NULL
; names
!= NULL
; names
= names
->n_flink
)
754 if ((names
->n_type
& GDEL
) == 0) {
768 newn
->n_flink
= NULL
;
772 while (asccasecmp(t
->n_name
, np
->n_name
) < 0) {
773 if (t
->n_flink
== NULL
)
779 * If we ran out of t's, put the new entry after
780 * the current value of t.
783 if (asccasecmp(t
->n_name
, np
->n_name
) < 0) {
793 * Otherwise, put the new entry in front of the
794 * current t. If at the front of the list,
795 * the new guy becomes the new head of the list.
809 * The normal case -- we are inserting into the
810 * middle of the list.
816 x
->n_blink
= t
->n_blink
;
817 t
->n_blink
->n_flink
= x
;
822 * Now the list headed up by new is sorted.
823 * Go through it and remove duplicates.
829 while (t
->n_flink
!= NULL
&&
830 asccasecmp(np
->n_name
, t
->n_flink
->n_name
) == 0)
832 if (t
== np
|| t
== NULL
) {
838 * Now t points to the last entry with the same name
839 * as np. Make np point beyond t.
842 np
->n_flink
= t
->n_flink
;
843 if (t
->n_flink
!= NULL
)
844 t
->n_flink
->n_blink
= np
;
851 * Put another node onto a list of names and return
855 put(struct name
*list
, struct name
*node
)
857 node
->n_flink
= list
;
858 node
->n_blink
= NULL
;
860 list
->n_blink
= node
;
865 * Determine the number of undeleted elements in
866 * a name list and return it.
869 count(struct name
*np
)
873 for (c
= 0; np
!= NULL
; np
= np
->n_flink
)
874 if ((np
->n_type
& GDEL
) == 0)
880 * Delete the given name from a namelist.
883 delname(struct name
*np
, char *name
)
887 for (p
= np
; p
!= NULL
; p
= p
->n_flink
)
888 if (same_name(p
->n_name
, name
)) {
889 if (p
->n_blink
== NULL
) {
890 if (p
->n_flink
!= NULL
)
891 p
->n_flink
->n_blink
= NULL
;
895 if (p
->n_flink
== NULL
) {
896 if (p
->n_blink
!= NULL
)
897 p
->n_blink
->n_flink
= NULL
;
900 p
->n_blink
->n_flink
= p
->n_flink
;
901 p
->n_flink
->n_blink
= p
->n_blink
;
907 * Pretty print a name list
908 * Uncomment it if you need it.
913 prettyprint(struct name *name)
919 fprintf(stderr, "%s(%d) ", np->n_name, np->n_type);
922 fprintf(stderr, "\n");
927 delete_alternates(struct name
*np
)
932 np
= delname(np
, myname
);
934 for (ap
= altnames
; *ap
; ap
++)
935 np
= delname(np
, *ap
);
936 if ((xp
= sextract(value("from"), GEXTRA
|GSKIN
)) != NULL
)
938 np
= delname(np
, xp
->n_name
);
941 if ((xp
= sextract(value("replyto"), GEXTRA
|GSKIN
)) != NULL
)
943 np
= delname(np
, xp
->n_name
);
946 if ((xp
= sextract(value("sender"), GEXTRA
|GSKIN
)) != NULL
)
948 np
= delname(np
, xp
->n_name
);
955 is_myname(char *name
)
960 if (same_name(myname
, name
))
963 for (ap
= altnames
; *ap
; ap
++)
964 if (same_name(*ap
, name
))
966 if ((xp
= sextract(value("from"), GEXTRA
|GSKIN
)) != NULL
)
968 if (same_name(xp
->n_name
, name
))
972 if ((xp
= sextract(value("replyto"), GEXTRA
|GSKIN
)) != NULL
)
974 if (same_name(xp
->n_name
, name
))
978 if ((xp
= sextract(value("sender"), GEXTRA
|GSKIN
)) != NULL
)
980 if (same_name(xp
->n_name
, name
))