2 * Copyright (c) 1980, 1993
3 * The Regents of the University of California. All rights reserved.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
13 * 3. All advertising materials mentioning features or use of this software
14 * must display the following acknowledgement:
15 * This product includes software developed by the University of
16 * California, Berkeley and its contributors.
17 * 4. Neither the name of the University nor the names of its contributors
18 * may be used to endorse or promote products derived from this software
19 * without specific prior written permission.
21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33 * @(#)names.c 8.1 (Berkeley) 6/6/93
34 * $FreeBSD: src/usr.bin/mail/names.c,v 1.4.6.3 2003/01/06 05:46:03 mikeh Exp $
35 * $DragonFly: src/usr.bin/mail/names.c,v 1.2 2003/06/17 04:29:28 dillon Exp $
39 * Mail -- a mail program
49 * Allocate a single element of a name list,
50 * initialize its name field to the passed
60 np = (struct name *)salloc(sizeof(*np));
64 np->n_name = savestr(str);
69 * Find the tail of a list and return it.
80 while (np->n_flink != NULL)
86 * Extract a list of names from a line,
87 * and make a list of names from it.
88 * Return the list or NULL if none found.
96 struct name *top, *np, *t;
98 if (line == NULL || *line == '\0')
100 if ((nbuf = malloc(strlen(line) + 1)) == NULL)
101 err(1, "Out of memory");
105 while ((cp = yankword(cp, nbuf)) != NULL) {
106 t = nalloc(nbuf, ntype);
119 * Turn a list of names into a string of the same names.
130 comma = ntype & GCOMMA;
136 fprintf(stderr, "detract asked to insert commas\n");
137 for (p = np; p != NULL; p = p->n_flink) {
138 if (ntype && (p->n_type & GMASK) != ntype)
140 s += strlen(p->n_name) + 1;
149 for (p = np; p != NULL; p = p->n_flink) {
150 if (ntype && (p->n_type & GMASK) != ntype)
152 cp += strlcpy(cp, p->n_name, strlen(p->n_name) + 1);
153 if (comma && p->n_flink != NULL)
158 if (comma && *--cp == ',')
164 * Grab a single word (liberal word)
165 * Throw away things between ()'s, and take anything between <>.
180 while (*cp != '\0') {
192 } else if (*cp == ' ' || *cp == '\t' || *cp == ',')
198 for (cp2 = wbuf; *cp && (*cp2++ = *cp++) != '>';)
201 for (cp2 = wbuf; *cp != '\0' && strchr(" \t,(", *cp) == NULL;
209 * For each recipient in the passed name list with a /
210 * in the name, append the message to the end of the named file
211 * and remove him from the recipient list.
213 * Recipients whose name begins with | are piped through the given
214 * program and removed.
223 struct name *np, *top;
233 if (!isfileaddr(np->n_name) && np->n_name[0] != '|') {
237 ispipe = np->n_name[0] == '|';
239 fname = np->n_name+1;
241 fname = expand(np->n_name);
244 * See if we have copied the complete message out yet.
250 char tempname[PATHSIZE];
252 (void)snprintf(tempname, sizeof(tempname),
253 "%s/mail.ReXXXXXXXXXX", tmpdir);
254 if ((fd = mkstemp(tempname)) == -1 ||
255 (fout = Fdopen(fd, "a")) == NULL) {
256 warn("%s", tempname);
260 image = open(tempname, O_RDWR);
263 warn("%s", tempname);
268 (void)fcntl(image, F_SETFD, 1);
269 fprintf(fout, "From %s %s", myname, date);
271 GTO|GSUBJECT|GCC|GREPLYTO|GINREPLYTO|GNL);
272 while ((c = getc(fo)) != EOF)
278 warn("%s", tempname);
287 * Now either copy "image" to the desired file
288 * or give it as the standard input to the desired
289 * program as appropriate.
299 * We can't really reuse the same image file,
300 * because multiple piped recipients will
301 * share the same lseek location and trample
304 if ((sh = value("SHELL")) == NULL)
306 (void)sigemptyset(&nset);
307 (void)sigaddset(&nset, SIGHUP);
308 (void)sigaddset(&nset, SIGINT);
309 (void)sigaddset(&nset, SIGQUIT);
310 pid = start_command(sh, &nset, image, -1, "-c", fname,
319 if ((fout = Fopen(fname, "a")) == NULL) {
324 if ((f = dup(image)) < 0) {
328 fin = Fdopen(f, "r");
330 fprintf(stderr, "Can't reopen image\n");
336 while ((c = getc(fin)) != EOF)
350 * In days of old we removed the entry from the
351 * the list; now for sake of header expansion
352 * we leave it in and mark it as deleted.
365 * Determine if the passed address is a local "send to file" address.
366 * If any of the network metacharacters precedes any slashes, it can't
367 * be a filename. We cheat with .'s to allow path names like ./...
377 for (cp = name; *cp != '\0'; cp++) {
378 if (*cp == '!' || *cp == '%' || *cp == '@')
387 * Map all of the aliased users in the invoker's mailrc
388 * file and insert them into the list.
389 * Changed after all these months of service to recursively
390 * expand names (2/14/80).
397 struct name *new, *np, *cp;
398 struct grouphead *gh;
403 metoo = (value("metoo") != NULL);
405 if (np->n_name[0] == '\\') {
411 gh = findgroup(np->n_name);
414 new = gexpand(new, gh, metoo, np->n_type);
423 * Recursively expand a group name. We limit the expansion to some
424 * fixed level to keep things from going haywire.
425 * Direct recursion is not expanded for convenience.
429 gexpand(nlist, gh, metoo, ntype)
431 struct grouphead *gh;
435 struct grouphead *ngh;
440 if (depth > MAXEXP) {
441 printf("Expanding alias to depth larger than %d\n", MAXEXP);
445 for (gp = gh->g_list; gp != NULL; gp = gp->ge_link) {
449 if (strcmp(cp, gh->g_name) == 0)
451 if ((ngh = findgroup(cp)) != NULL) {
452 nlist = gexpand(nlist, ngh, metoo, ntype);
456 np = nalloc(cp, ntype);
458 * At this point should allow to expand
459 * to self if only person in group
461 if (gp == gh->g_list && gp->ge_link == NULL)
463 if (!metoo && strcmp(cp, myname) == 0)
466 nlist = put(nlist, np);
473 * Concatenate the two passed name lists, return the result.
477 struct name *n1, *n2;
492 * Unpack the name list onto a vector of strings.
493 * Return an error if the name list won't fit.
501 int t, extra, metoo, verbose;
504 if ((t = count(n)) == 0)
505 errx(1, "No names to unpack");
507 * Compute the number of extra arguments we will need.
508 * We need at least two extra -- one for "mail" and one for
509 * the terminating 0 pointer. Additional spots may be needed
510 * to pass along -f to the host mailer.
514 metoo = value("metoo") != NULL;
517 verbose = value("verbose") != NULL;
520 top = (char **)salloc((t + extra) * sizeof(*top));
528 for (; n != NULL; n = n->n_flink)
529 if ((n->n_type & GDEL) == 0)
536 * Remove all of the duplicates from the passed name list by
537 * insertion sorting them, then checking for dups.
538 * Return the head of the new list.
544 struct name *np, *t, *new;
557 while (strcasecmp(t->n_name, np->n_name) < 0) {
558 if (t->n_flink == NULL)
564 * If we ran out of t's, put the new entry after
565 * the current value of t.
568 if (strcasecmp(t->n_name, np->n_name) < 0) {
578 * Otherwise, put the new entry in front of the
579 * current t. If at the front of the list,
580 * the new guy becomes the new head of the list.
594 * The normal case -- we are inserting into the
595 * middle of the list.
601 x->n_blink = t->n_blink;
602 t->n_blink->n_flink = x;
607 * Now the list headed up by new is sorted.
608 * Go through it and remove duplicates.
614 while (t->n_flink != NULL &&
615 strcasecmp(np->n_name, t->n_flink->n_name) == 0)
617 if (t == np || t == NULL) {
623 * Now t points to the last entry with the same name
624 * as np. Make np point beyond t.
627 np->n_flink = t->n_flink;
628 if (t->n_flink != NULL)
629 t->n_flink->n_blink = np;
636 * Put another node onto a list of names and return
641 struct name *list, *node;
643 node->n_flink = list;
644 node->n_blink = NULL;
646 list->n_blink = node;
651 * Determine the number of undeleted elements in
652 * a name list and return it.
660 for (c = 0; np != NULL; np = np->n_flink)
661 if ((np->n_type & GDEL) == 0)
667 * Delete the given name from a namelist.
676 for (p = np; p != NULL; p = p->n_flink)
677 if (strcasecmp(p->n_name, name) == 0) {
678 if (p->n_blink == NULL) {
679 if (p->n_flink != NULL)
680 p->n_flink->n_blink = NULL;
684 if (p->n_flink == NULL) {
685 if (p->n_blink != NULL)
686 p->n_blink->n_flink = NULL;
689 p->n_blink->n_flink = p->n_flink;
690 p->n_flink->n_blink = p->n_blink;
696 * Pretty print a name list
697 * Uncomment it if you need it.
709 fprintf(stderr, "%s(%d) ", np->n_name, np->n_type);
712 fprintf(stderr, "\n");