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,
69 * initialize its name field to the passed
73 nalloc(char *str
, enum gfield ntype
)
79 np
= (struct name
*)salloc(sizeof *np
);
85 (void)addrspec_with_guts((ntype
& (GFULL
|GSKIN
|GREF
)) != 0, str
, &ag
);
86 if ((ag
.ag_n_flags
& NAME_NAME_SALLOC
) == 0) {
87 ag
.ag_n_flags
|= NAME_NAME_SALLOC
;
88 ag
.ag_skinned
= savestr(ag
.ag_skinned
);
90 np
->n_fullname
= np
->n_name
= ag
.ag_skinned
;
91 np
->n_flags
= ag
.ag_n_flags
;
94 if (ag
.ag_ilen
!= ag
.ag_slen
) {
97 mime_fromhdr(&in
, &out
, TD_ISPR
|TD_ICONV
);
98 np
->n_fullname
= savestr(out
.s
);
100 np
->n_flags
|= NAME_FULLNAME_SALLOC
;
102 } else if (ntype
& GREF
) { /* TODO LEGACY */
103 /* TODO Unfortunately we had to skin GREFerences i.e. the
104 * TODO surrounding angle brackets have been stripped away.
105 * TODO Necessarily since otherwise the plain address check
106 * TODO fails due to them; insert them back so that valid
107 * TODO headers will be created */
108 np
->n_fullname
= np
->n_name
= str
= salloc(ag
.ag_slen
+ 2 + 1);
110 memcpy(str
, ag
.ag_skinned
, ag
.ag_slen
);
119 ndup(struct name
*np
, enum gfield ntype
)
123 if ((ntype
& (GFULL
|GSKIN
)) && (np
->n_flags
& NAME_SKINNED
) == 0) {
124 nnp
= nalloc(np
->n_name
, ntype
);
128 nnp
= (struct name
*)salloc(sizeof *np
);
129 nnp
->n_flink
= nnp
->n_blink
= NULL
;
131 nnp
->n_flags
= (np
->n_flags
&
132 ~(NAME_NAME_SALLOC
| NAME_FULLNAME_SALLOC
)) |
134 nnp
->n_name
= savestr(np
->n_name
);
135 if (np
->n_name
== np
->n_fullname
|| (ntype
& (GFULL
|GSKIN
)) == 0)
136 nnp
->n_fullname
= nnp
->n_name
;
138 nnp
->n_flags
|= NAME_FULLNAME_SALLOC
;
139 nnp
->n_fullname
= savestr(np
->n_fullname
);
146 * Find the tail of a list and return it.
149 tailof(struct name
*name
)
156 while (np
->n_flink
!= NULL
)
162 * Extract a list of names from a line,
163 * and make a list of names from it.
164 * Return the list or NULL if none found.
167 extract(char *line
, enum gfield ntype
)
169 return extract1(line
, ntype
, " \t,(", 0);
173 sextract(char *line
, enum gfield ntype
)
175 if (line
&& strpbrk(line
, ",\"\\(<"))
176 return extract1(line
, ntype
, ",", 1);
178 return extract(line
, ntype
);
182 lextract(char *line
, enum gfield ntype
)
184 return (extract1(line
, ntype
, ",", 1));
188 extract1(char *line
, enum gfield ntype
, char *separators
, int copypfx
)
191 struct name
*top
, *np
, *t
;
193 if (line
== NULL
|| *line
== '\0')
198 nbuf
= ac_alloc(strlen(line
) + 1);
199 while ((cp
= yankword(cp
, nbuf
, separators
, copypfx
)) != NULL
) {
200 t
= nalloc(nbuf
, ntype
);
213 * Turn a list of names into a string of the same names.
216 detract(struct name
*np
, enum gfield ntype
)
223 comma
= ntype
& GCOMMA
;
228 if ((debug
|| value("debug")) && comma
)
229 fprintf(stderr
, catgets(catd
, CATSET
, 145,
230 "detract asked to insert commas\n"));
231 for (p
= np
; p
!= NULL
; p
= p
->n_flink
) {
232 if (ntype
&& (p
->n_type
& GMASK
) != ntype
)
234 s
+= strlen(p
->n_fullname
) + 1;
243 for (p
= np
; p
!= NULL
; p
= p
->n_flink
) {
244 if (ntype
&& (p
->n_type
& GMASK
) != ntype
)
246 cp
= sstpcpy(cp
, p
->n_fullname
);
247 if (comma
&& p
->n_flink
!= NULL
)
252 if (comma
&& *--cp
== ',')
258 * Grab a single word (liberal word)
259 * Throw away things between ()'s, and take anything between <>.
260 * Strip trailing whitespace as *ap* may come directly from user.
263 yankword(char *ap
, char *wbuf
, char *separators
, int copypfx
)
269 while (blankspacechar(*cp
) || *cp
== ',')
272 if ((cp
= (char*)nexttoken((char*)cp
)) == NULL
)
278 while (*cp
&& (*wp
++ = *cp
++) != '>');
282 while (*cp
&& (incomm
|| !strchr(separators
, *cp
))) {
284 if (cp
== ap
|| *(cp
- 1) != '\\') {
290 } else if (cp
!= ap
) {
299 while (wp
> wbuf
&& blankspacechar(wp
[-1]))
306 * Check all addresses in np and delete invalid ones.
309 checkaddrs(struct name
*np
)
313 for (n
= np
; n
!= NULL
;) {
314 if (is_addr_invalid(n
, 1)) {
316 n
->n_blink
->n_flink
= n
->n_flink
;
318 n
->n_flink
->n_blink
= n
->n_blink
;
328 * For each recipient in the passed name list with a /
329 * in the name, append the message to the end of the named file
330 * and remove him from the recipient list.
332 * Recipients whose name begins with | are piped through the given
333 * program and removed.
336 outof(struct name
*names
, FILE *fo
, struct header
*hp
)
338 int pipecnt
, xcnt
, *fda
, i
;
342 FILE *fin
= NULL
, *fout
;
346 * Look through all recipients and do a quick return if no file or pipe
347 * addressee is found.
349 fda
= NULL
; /* Silence cc */
350 for (pipecnt
= xcnt
= 0, np
= names
; np
!= NULL
; np
= np
->n_flink
)
351 switch (np
->n_flags
& NAME_ADDRSPEC_ISFILEORPIPE
) {
352 case NAME_ADDRSPEC_ISFILE
:
355 case NAME_ADDRSPEC_ISPIPE
:
359 if (pipecnt
== 0 && xcnt
== 0)
363 * Otherwise create an array of file descriptors for each found pipe
364 * addressee to get around the dup(2)-shared-file-offset problem, i.e.,
365 * each pipe subprocess needs its very own file descriptor, and we need
367 * To make our life a bit easier let's just use the auto-reclaimed
374 fda
= (int*)salloc(sizeof(int) * pipecnt
);
375 for (i
= 0; i
< pipecnt
; ++i
)
377 if ((shell
= value("SHELL")) == NULL
)
384 for (np
= names
; np
!= NULL
;) {
385 if ((np
->n_flags
& (NAME_ADDRSPEC_ISFILE
|NAME_ADDRSPEC_ISPIPE
))
392 * See if we have copied the complete message out yet.
399 if ((fout
= Ftemp(&tempEdit
, "Re", "w", 0600, 1))
401 perror(tr(146, "Creation of temporary image"));
405 image
= open(tempEdit
, O_RDWR
);
407 for (i
= 0; i
< pipecnt
; ++i
) {
408 int fd
= open(tempEdit
, O_RDONLY
);
416 (void)fcntl(fd
, F_SETFD
, FD_CLOEXEC
);
421 perror(tr(147, "Creating descriptor duplicate "
422 "of temporary image"));
427 fcntl(image
, F_SETFD
, FD_CLOEXEC
);
429 fprintf(fout
, "From %s %s", myname
, date
);
431 while (i
= c
, (c
= getc(fo
)) != EOF
)
439 perror(tr(148, "Finalizing write of temporary "
446 /* If we have to serve file addressees, open reader */
447 if (xcnt
!= 0 && (fin
= Fdopen(image
, "r")) == NULL
) {
448 perror(tr(149, "Failed to open a duplicate of "
449 "the temporary image"));
450 jcantfout
: ++senderr
;
456 /* From now on use xcnt as a counter for pipecnt */
461 * Now either copy "image" to the desired file
462 * or give it as the standard input to the desired
463 * program as appropriate.
466 if (np
->n_flags
& NAME_ADDRSPEC_ISPIPE
) {
471 sigaddset(&nset
, SIGHUP
);
472 sigaddset(&nset
, SIGINT
);
473 sigaddset(&nset
, SIGQUIT
);
474 pid
= start_command(shell
, &nset
,
475 fda
[xcnt
++], -1, "-c", np
->n_name
+ 1, NULL
);
477 fprintf(stderr
, tr(281,
478 "Message piping to <%s> failed\n"),
485 char *fname
= file_expand(np
->n_name
);
487 fprintf(stderr
, tr(81,
488 "\"%s\": Expansion failed.\n"),
493 if ((fout
= Zopen(fname
, "a", NULL
)) == NULL
) {
494 fprintf(stderr
, tr(282,
495 "Message writing to <%s> failed: %s\n"),
496 fname
, strerror(errno
));
501 while ((i
= getc(fin
)) != EOF
)
504 fprintf(stderr
, tr(282,
505 "Message writing to <%s> failed: %s\n"),
506 fname
, tr(283, "write error"));
513 * In days of old we removed the entry from the
514 * the list; now for sake of header expansion
515 * we leave it in and mark it as deleted.
525 for (i
= 0; i
< pipecnt
; ++i
)
535 if ((np
->n_flags
& (NAME_ADDRSPEC_ISFILE
|NAME_ADDRSPEC_ISPIPE
))
544 same_name(char *n1
, char *n2
)
548 if (value("allnet") != NULL
) {
556 } while (c1
!= '\0' && c2
!= '\0' && c1
!= '@' && c2
!= '@');
559 return asccasecmp(n1
, n2
) == 0;
563 * Map all of the aliased users in the invoker's mailrc
564 * file and insert them into the list.
565 * Changed after all these months of service to recursively
566 * expand names (2/14/80).
570 usermap(struct name
*names
)
572 struct name
*new, *np
, *cp
;
573 struct grouphead
*gh
;
578 metoo
= (value("metoo") != NULL
);
580 if (np
->n_name
[0] == '\\') {
586 gh
= findgroup(np
->n_name
);
589 new = gexpand(new, gh
, metoo
, np
->n_type
);
598 * Recursively expand a group name. We limit the expansion to some
599 * fixed level to keep things from going haywire.
600 * Direct recursion is not expanded for convenience.
604 gexpand(struct name
*nlist
, struct grouphead
*gh
, int metoo
, int ntype
)
607 struct grouphead
*ngh
;
612 if (depth
> MAXEXP
) {
613 printf(catgets(catd
, CATSET
, 150,
614 "Expanding alias to depth larger than %d\n"), MAXEXP
);
618 for (gp
= gh
->g_list
; gp
!= NULL
; gp
= gp
->ge_link
) {
622 if (strcmp(cp
, gh
->g_name
) == 0)
624 if ((ngh
= findgroup(cp
)) != NULL
) {
625 nlist
= gexpand(nlist
, ngh
, metoo
, ntype
);
629 np
= nalloc(cp
, ntype
|GFULL
);
631 * At this point should allow to expand
632 * to self if only person in group
634 if (gp
== gh
->g_list
&& gp
->ge_link
== NULL
)
636 if (!metoo
&& same_name(cp
, myname
))
639 nlist
= put(nlist
, np
);
646 * Concatenate the two passed name lists, return the result.
649 cat(struct name
*n1
, struct name
*n2
)
664 * Unpack the name list onto a vector of strings.
665 * Return an error if the name list won't fit.
668 unpack(struct name
*np
)
672 int t
, extra
, metoo
, verbose
;
675 if ((t
= count(n
)) == 0)
676 panic(catgets(catd
, CATSET
, 151, "No names to unpack"));
678 * Compute the number of extra arguments we will need.
679 * We need at least two extra -- one for "mail" and one for
680 * the terminating 0 pointer. Additional spots may be needed
681 * to pass along -f to the host mailer.
685 metoo
= value("metoo") != NULL
;
688 verbose
= value("verbose") != NULL
;
692 top
= (char **)salloc((t
+ extra
) * sizeof *top
);
700 for (; n
!= NULL
; n
= n
->n_flink
)
701 if ((n
->n_type
& GDEL
) == 0)
708 * Remove all of the duplicates from the passed name list by
709 * insertion sorting them, then checking for dups.
710 * Return the head of the new list.
713 elide(struct name
*names
)
715 struct name
*np
, *t
, *newn
, *x
;
719 /* Throw away all deleted nodes (XXX merge with plain sort below?) */
720 for (newn
= np
= NULL
; names
!= NULL
; names
= names
->n_flink
)
721 if ((names
->n_type
& GDEL
) == 0) {
735 newn
->n_flink
= NULL
;
739 while (asccasecmp(t
->n_name
, np
->n_name
) < 0) {
740 if (t
->n_flink
== NULL
)
746 * If we ran out of t's, put the new entry after
747 * the current value of t.
750 if (asccasecmp(t
->n_name
, np
->n_name
) < 0) {
760 * Otherwise, put the new entry in front of the
761 * current t. If at the front of the list,
762 * the new guy becomes the new head of the list.
776 * The normal case -- we are inserting into the
777 * middle of the list.
783 x
->n_blink
= t
->n_blink
;
784 t
->n_blink
->n_flink
= x
;
789 * Now the list headed up by new is sorted.
790 * Go through it and remove duplicates.
796 while (t
->n_flink
!= NULL
&&
797 asccasecmp(np
->n_name
, t
->n_flink
->n_name
) == 0)
799 if (t
== np
|| t
== NULL
) {
805 * Now t points to the last entry with the same name
806 * as np. Make np point beyond t.
809 np
->n_flink
= t
->n_flink
;
810 if (t
->n_flink
!= NULL
)
811 t
->n_flink
->n_blink
= np
;
818 * Put another node onto a list of names and return
822 put(struct name
*list
, struct name
*node
)
824 node
->n_flink
= list
;
825 node
->n_blink
= NULL
;
827 list
->n_blink
= node
;
832 * Determine the number of undeleted elements in
833 * a name list and return it.
836 count(struct name
*np
)
840 for (c
= 0; np
!= NULL
; np
= np
->n_flink
)
841 if ((np
->n_type
& GDEL
) == 0)
847 * Delete the given name from a namelist.
850 delname(struct name
*np
, char *name
)
854 for (p
= np
; p
!= NULL
; p
= p
->n_flink
)
855 if (same_name(p
->n_name
, name
)) {
856 if (p
->n_blink
== NULL
) {
857 if (p
->n_flink
!= NULL
)
858 p
->n_flink
->n_blink
= NULL
;
862 if (p
->n_flink
== NULL
) {
863 if (p
->n_blink
!= NULL
)
864 p
->n_blink
->n_flink
= NULL
;
867 p
->n_blink
->n_flink
= p
->n_flink
;
868 p
->n_flink
->n_blink
= p
->n_blink
;
874 * Pretty print a name list
875 * Uncomment it if you need it.
880 prettyprint(struct name *name)
886 fprintf(stderr, "%s(%d) ", np->n_name, np->n_type);
889 fprintf(stderr, "\n");
894 delete_alternates(struct name
*np
)
899 np
= delname(np
, myname
);
901 for (ap
= altnames
; *ap
; ap
++)
902 np
= delname(np
, *ap
);
903 if ((xp
= sextract(value("from"), GEXTRA
|GSKIN
)) != NULL
)
905 np
= delname(np
, xp
->n_name
);
908 if ((xp
= sextract(value("replyto"), GEXTRA
|GSKIN
)) != NULL
)
910 np
= delname(np
, xp
->n_name
);
913 if ((xp
= sextract(value("sender"), GEXTRA
|GSKIN
)) != NULL
)
915 np
= delname(np
, xp
->n_name
);
922 is_myname(char *name
)
927 if (same_name(myname
, name
))
930 for (ap
= altnames
; *ap
; ap
++)
931 if (same_name(*ap
, name
))
933 if ((xp
= sextract(value("from"), GEXTRA
|GSKIN
)) != NULL
)
935 if (same_name(xp
->n_name
, name
))
939 if ((xp
= sextract(value("replyto"), GEXTRA
|GSKIN
)) != NULL
)
941 if (same_name(xp
->n_name
, name
))
945 if ((xp
= sextract(value("sender"), GEXTRA
|GSKIN
)) != NULL
)
947 if (same_name(xp
->n_name
, name
))