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
53 static struct name
*tailof(struct name
*name
);
54 static struct name
*extract1(char *line
, enum gfield ntype
, char *separators
,
56 static char *yankword(char *ap
, char *wbuf
, char *separators
, int copypfx
);
57 static int same_name(char *n1
, char *n2
);
58 static struct name
*gexpand(struct name
*nlist
, struct grouphead
*gh
,
59 int metoo
, int ntype
);
60 static struct name
*put(struct name
*list
, struct name
*node
);
61 static struct name
*delname(struct name
*np
, char *name
);
64 * Allocate a single element of a name list,
65 * initialize its name field to the passed
69 nalloc(char *str
, enum gfield ntype
)
75 np
= (struct name
*)salloc(sizeof *np
);
81 np
->n_name
= savestr(skin(str
));
82 if (strcmp(np
->n_name
, str
)) {
85 mime_fromhdr(&in
, &out
, TD_ISPR
|TD_ICONV
);
86 np
->n_fullname
= savestr(out
.s
);
89 np
->n_fullname
= np
->n_name
;
90 } else if (ntype
& GSKIN
)
91 np
->n_fullname
= np
->n_name
= savestr(skin(str
));
93 np
->n_fullname
= np
->n_name
= savestr(str
);
98 ndup(struct name
*np
, enum gfield ntype
)
102 nnp
= (struct name
*)salloc(sizeof *np
);
106 nnp
->n_flags
= np
->n_flags
;
107 nnp
->n_name
= savestr(np
->n_name
);
108 nnp
->n_fullname
= (((ntype
& (GFULL
|GSKIN
)) == 0) ||
109 np
->n_name
== np
->n_fullname
)
110 ? nnp
->n_name
: savestr(np
->n_fullname
);
115 * Find the tail of a list and return it.
118 tailof(struct name
*name
)
125 while (np
->n_flink
!= NULL
)
131 * Extract a list of names from a line,
132 * and make a list of names from it.
133 * Return the list or NULL if none found.
136 extract(char *line
, enum gfield ntype
)
138 return extract1(line
, ntype
, " \t,(", 0);
142 sextract(char *line
, enum gfield ntype
)
144 if (line
&& strpbrk(line
, ",\"\\(<"))
145 return extract1(line
, ntype
, ",", 1);
147 return extract(line
, ntype
);
151 lextract(char *line
, enum gfield ntype
)
153 return (extract1(line
, ntype
, ",", 1));
157 extract1(char *line
, enum gfield ntype
, char *separators
, int copypfx
)
160 struct name
*top
, *np
, *t
;
162 if (line
== NULL
|| *line
== '\0')
167 nbuf
= ac_alloc(strlen(line
) + 1);
168 while ((cp
= yankword(cp
, nbuf
, separators
, copypfx
)) != NULL
) {
169 t
= nalloc(nbuf
, ntype
);
182 * Turn a list of names into a string of the same names.
185 detract(struct name
*np
, enum gfield ntype
)
192 comma
= ntype
& GCOMMA
;
197 if ((debug
|| value("debug")) && comma
)
198 fprintf(stderr
, catgets(catd
, CATSET
, 145,
199 "detract asked to insert commas\n"));
200 for (p
= np
; p
!= NULL
; p
= p
->n_flink
) {
201 if (ntype
&& (p
->n_type
& GMASK
) != ntype
)
203 s
+= strlen(p
->n_fullname
) + 1;
212 for (p
= np
; p
!= NULL
; p
= p
->n_flink
) {
213 if (ntype
&& (p
->n_type
& GMASK
) != ntype
)
215 cp
= sstpcpy(cp
, p
->n_fullname
);
216 if (comma
&& p
->n_flink
!= NULL
)
221 if (comma
&& *--cp
== ',')
227 * Grab a single word (liberal word)
228 * Throw away things between ()'s, and take anything between <>.
229 * Strip trailing whitespace as *ap* may come directly from user.
232 yankword(char *ap
, char *wbuf
, char *separators
, int copypfx
)
238 while (blankchar(*cp
& 0377) || *cp
== ',')
241 if ((cp
= nexttoken(cp
)) == NULL
)
247 while (*cp
&& (*wp
++ = *cp
++) != '>');
251 while (*cp
&& (incomm
|| !strchr(separators
, *cp
))) {
253 if (cp
== ap
|| *(cp
- 1) != '\\') {
259 } else if (cp
!= ap
) {
268 while (wp
> wbuf
&& blankspacechar(wp
[-1]))
275 * For each recipient in the passed name list with a /
276 * in the name, append the message to the end of the named file
277 * and remove him from the recipient list.
279 * Recipients whose name begins with | are piped through the given
280 * program and removed.
283 outof(struct name
*names
, FILE *fo
, struct header
*hp
)
285 int pipecnt
, xcnt
, *fda
, i
;
289 FILE *fin
= NULL
, *fout
;
293 * Look through all recipients and do a quick return if no file or pipe
294 * addressee is found.
296 for (pipecnt
= xcnt
= 0, np
= names
; np
!= NULL
; np
= np
->n_flink
) {
297 assert(np
->n_flags
& NAME_ADDRSPEC_CHECKED
);
298 if ((np
->n_flags
& NAME_ADDRSPEC_ISPIPE
) != 0)
300 else if ((np
->n_flags
& NAME_ADDRSPEC_ISFILE
) != 0)
303 if (pipecnt
== 0 && xcnt
== 0)
307 * Otherwise create an array of file descriptors for each found pipe
308 * addressee to get around the dup(2)-shared-file-offset problem, i.e.,
309 * each pipe subprocess needs its very own file descriptor, and we need
311 * To make our life a bit easier let's just use the auto-reclaimed
318 fda
= (int*)salloc(sizeof(int) * pipecnt
);
319 for (i
= 0; i
< pipecnt
; ++i
)
321 if ((shell
= value("SHELL")) == NULL
)
328 for (np
= names
; np
!= NULL
;) {
329 if ((np
->n_flags
& (NAME_ADDRSPEC_ISFILE
|NAME_ADDRSPEC_ISPIPE
))
336 * See if we have copied the complete message out yet.
343 if ((fout
= Ftemp(&tempEdit
, "Re", "w", 0600, 1))
345 perror(tr(146, "Creation of temporary image"));
349 image
= open(tempEdit
, O_RDWR
);
351 for (i
= 0; i
< pipecnt
; ++i
) {
352 int fd
= open(tempEdit
, O_RDONLY
);
360 (void)fcntl(fd
, F_SETFD
, FD_CLOEXEC
);
365 perror(tr(147, "Creating descriptor duplicate "
366 "of temporary image"));
371 fcntl(image
, F_SETFD
, FD_CLOEXEC
);
373 fprintf(fout
, "From %s %s", myname
, date
);
375 while (i
= c
, (c
= getc(fo
)) != EOF
)
383 perror(tr(148, "Finalizing write of temporary "
387 /* If we have to serve file addressees, open reader */
388 if (xcnt
!= 0 && (fin
= Fdopen(image
, "r")) == NULL
) {
389 perror(tr(149, "Failed to open a duplicate of "
390 "the temporary image"));
397 /* From now on use xcnt as a counter for pipecnt */
402 * Now either copy "image" to the desired file
403 * or give it as the standard input to the desired
404 * program as appropriate.
407 if (np
->n_flags
& NAME_ADDRSPEC_ISPIPE
) {
412 sigaddset(&nset
, SIGHUP
);
413 sigaddset(&nset
, SIGINT
);
414 sigaddset(&nset
, SIGQUIT
);
415 pid
= start_command(shell
, &nset
,
416 fda
[xcnt
++], -1, "-c", np
->n_name
+ 1, NULL
);
423 char *fname
= expand(np
->n_name
);
424 if ((fout
= Zopen(fname
, "a", NULL
)) == NULL
) {
430 while ((i
= getc(fin
)) != EOF
)
440 * In days of old we removed the entry from the
441 * the list; now for sake of header expansion
442 * we leave it in and mark it as deleted.
452 for (i
= 0; i
< pipecnt
; ++i
)
462 if ((np
->n_flags
& (NAME_ADDRSPEC_ISFILE
|NAME_ADDRSPEC_ISPIPE
))
471 * Determine if the passed address is a local "send to file" address.
472 * If any of the network metacharacters precedes any slashes, it can't
473 * be a filename. We cheat with .'s to allow path names like ./...
476 is_fileaddr(char *name
)
480 if (strchr(name
, '@') != NULL
)
484 for (cp
= name
; *cp
; cp
++) {
485 if (*cp
== '!' || *cp
== '%')
494 same_name(char *n1
, char *n2
)
498 if (value("allnet") != NULL
) {
506 } while (c1
!= '\0' && c2
!= '\0' && c1
!= '@' && c2
!= '@');
509 return asccasecmp(n1
, n2
) == 0;
513 * Map all of the aliased users in the invoker's mailrc
514 * file and insert them into the list.
515 * Changed after all these months of service to recursively
516 * expand names (2/14/80).
520 usermap(struct name
*names
)
522 struct name
*new, *np
, *cp
;
523 struct grouphead
*gh
;
528 metoo
= (value("metoo") != NULL
);
530 if (np
->n_name
[0] == '\\') {
536 gh
= findgroup(np
->n_name
);
539 new = gexpand(new, gh
, metoo
, np
->n_type
);
548 * Recursively expand a group name. We limit the expansion to some
549 * fixed level to keep things from going haywire.
550 * Direct recursion is not expanded for convenience.
554 gexpand(struct name
*nlist
, struct grouphead
*gh
, int metoo
, int ntype
)
557 struct grouphead
*ngh
;
562 if (depth
> MAXEXP
) {
563 printf(catgets(catd
, CATSET
, 150,
564 "Expanding alias to depth larger than %d\n"), MAXEXP
);
568 for (gp
= gh
->g_list
; gp
!= NULL
; gp
= gp
->ge_link
) {
572 if (strcmp(cp
, gh
->g_name
) == 0)
574 if ((ngh
= findgroup(cp
)) != NULL
) {
575 nlist
= gexpand(nlist
, ngh
, metoo
, ntype
);
579 np
= nalloc(cp
, ntype
|GFULL
);
581 * At this point should allow to expand
582 * to self if only person in group
584 if (gp
== gh
->g_list
&& gp
->ge_link
== NULL
)
586 if (!metoo
&& same_name(cp
, myname
))
589 nlist
= put(nlist
, np
);
596 * Concatenate the two passed name lists, return the result.
599 cat(struct name
*n1
, struct name
*n2
)
614 * Unpack the name list onto a vector of strings.
615 * Return an error if the name list won't fit.
618 unpack(struct name
*np
)
622 int t
, extra
, metoo
, verbose
;
625 if ((t
= count(n
)) == 0)
626 panic(catgets(catd
, CATSET
, 151, "No names to unpack"));
628 * Compute the number of extra arguments we will need.
629 * We need at least two extra -- one for "mail" and one for
630 * the terminating 0 pointer. Additional spots may be needed
631 * to pass along -f to the host mailer.
635 metoo
= value("metoo") != NULL
;
638 verbose
= value("verbose") != NULL
;
642 top
= (char **)salloc((t
+ extra
) * sizeof *top
);
650 for (; n
!= NULL
; n
= n
->n_flink
)
651 if ((n
->n_type
& GDEL
) == 0)
658 * Remove all of the duplicates from the passed name list by
659 * insertion sorting them, then checking for dups.
660 * Return the head of the new list.
663 elide(struct name
*names
)
665 struct name
*np
, *t
, *newn
, *x
;
669 /* Throw away all deleted nodes (XXX merge with plain sort below?) */
670 for (np
= NULL
; names
!= NULL
; names
= names
->n_flink
)
671 if ((names
->n_type
& GDEL
) == 0) {
685 newn
->n_flink
= NULL
;
689 while (asccasecmp(t
->n_name
, np
->n_name
) < 0) {
690 if (t
->n_flink
== NULL
)
696 * If we ran out of t's, put the new entry after
697 * the current value of t.
700 if (asccasecmp(t
->n_name
, np
->n_name
) < 0) {
710 * Otherwise, put the new entry in front of the
711 * current t. If at the front of the list,
712 * the new guy becomes the new head of the list.
726 * The normal case -- we are inserting into the
727 * middle of the list.
733 x
->n_blink
= t
->n_blink
;
734 t
->n_blink
->n_flink
= x
;
739 * Now the list headed up by new is sorted.
740 * Go through it and remove duplicates.
746 while (t
->n_flink
!= NULL
&&
747 asccasecmp(np
->n_name
, t
->n_flink
->n_name
) == 0)
749 if (t
== np
|| t
== NULL
) {
755 * Now t points to the last entry with the same name
756 * as np. Make np point beyond t.
759 np
->n_flink
= t
->n_flink
;
760 if (t
->n_flink
!= NULL
)
761 t
->n_flink
->n_blink
= np
;
768 * Put another node onto a list of names and return
772 put(struct name
*list
, struct name
*node
)
774 node
->n_flink
= list
;
775 node
->n_blink
= NULL
;
777 list
->n_blink
= node
;
782 * Determine the number of undeleted elements in
783 * a name list and return it.
786 count(struct name
*np
)
790 for (c
= 0; np
!= NULL
; np
= np
->n_flink
)
791 if ((np
->n_type
& GDEL
) == 0)
797 * Delete the given name from a namelist.
800 delname(struct name
*np
, char *name
)
804 for (p
= np
; p
!= NULL
; p
= p
->n_flink
)
805 if (same_name(p
->n_name
, name
)) {
806 if (p
->n_blink
== NULL
) {
807 if (p
->n_flink
!= NULL
)
808 p
->n_flink
->n_blink
= NULL
;
812 if (p
->n_flink
== NULL
) {
813 if (p
->n_blink
!= NULL
)
814 p
->n_blink
->n_flink
= NULL
;
817 p
->n_blink
->n_flink
= p
->n_flink
;
818 p
->n_flink
->n_blink
= p
->n_blink
;
824 * Pretty print a name list
825 * Uncomment it if you need it.
830 prettyprint(struct name *name)
836 fprintf(stderr, "%s(%d) ", np->n_name, np->n_type);
839 fprintf(stderr, "\n");
844 delete_alternates(struct name
*np
)
849 np
= delname(np
, myname
);
851 for (ap
= altnames
; *ap
; ap
++)
852 np
= delname(np
, *ap
);
853 if ((xp
= sextract(value("from"), GEXTRA
|GSKIN
)) != NULL
)
855 np
= delname(np
, xp
->n_name
);
858 if ((xp
= sextract(value("replyto"), GEXTRA
|GSKIN
)) != NULL
)
860 np
= delname(np
, xp
->n_name
);
863 if ((xp
= sextract(value("sender"), GEXTRA
|GSKIN
)) != NULL
)
865 np
= delname(np
, xp
->n_name
);
872 is_myname(char *name
)
877 if (same_name(myname
, name
))
880 for (ap
= altnames
; *ap
; ap
++)
881 if (same_name(*ap
, name
))
883 if ((xp
= sextract(value("from"), GEXTRA
|GSKIN
)) != NULL
)
885 if (same_name(xp
->n_name
, name
))
889 if ((xp
= sextract(value("replyto"), GEXTRA
|GSKIN
)) != NULL
)
891 if (same_name(xp
->n_name
, name
))
895 if ((xp
= sextract(value("sender"), GEXTRA
|GSKIN
)) != NULL
)
897 if (same_name(xp
->n_name
, name
))