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.3 2003/10/04 20:36:48 hmp Exp $
39 * Mail -- a mail program
49 * Allocate a single element of a name list,
50 * initialize its name field to the passed
54 nalloc(char *str, int ntype)
58 np = (struct name *)salloc(sizeof(*np));
62 np->n_name = savestr(str);
67 * Find the tail of a list and return it.
70 tailof(struct name *name)
77 while (np->n_flink != NULL)
83 * Extract a list of names from a line,
84 * and make a list of names from it.
85 * Return the list or NULL if none found.
88 extract(char *line, int ntype)
91 struct name *top, *np, *t;
93 if (line == NULL || *line == '\0')
95 if ((nbuf = malloc(strlen(line) + 1)) == NULL)
96 err(1, "Out of memory");
100 while ((cp = yankword(cp, nbuf)) != NULL) {
101 t = nalloc(nbuf, ntype);
114 * Turn a list of names into a string of the same names.
117 detract(struct name *np, int ntype)
123 comma = ntype & GCOMMA;
129 fprintf(stderr, "detract asked to insert commas\n");
130 for (p = np; p != NULL; p = p->n_flink) {
131 if (ntype && (p->n_type & GMASK) != ntype)
133 s += strlen(p->n_name) + 1;
142 for (p = np; p != NULL; p = p->n_flink) {
143 if (ntype && (p->n_type & GMASK) != ntype)
145 cp += strlcpy(cp, p->n_name, strlen(p->n_name) + 1);
146 if (comma && p->n_flink != NULL)
151 if (comma && *--cp == ',')
157 * Grab a single word (liberal word)
158 * Throw away things between ()'s, and take anything between <>.
161 yankword(char *ap, char *wbuf)
172 while (*cp != '\0') {
184 } else if (*cp == ' ' || *cp == '\t' || *cp == ',')
190 for (cp2 = wbuf; *cp && (*cp2++ = *cp++) != '>';)
193 for (cp2 = wbuf; *cp != '\0' && strchr(" \t,(", *cp) == NULL;
201 * For each recipient in the passed name list with a /
202 * in the name, append the message to the end of the named file
203 * and remove him from the recipient list.
205 * Recipients whose name begins with | are piped through the given
206 * program and removed.
209 outof(struct name *names, FILE *fo, struct header *hp)
212 struct name *np, *top;
222 if (!isfileaddr(np->n_name) && np->n_name[0] != '|') {
226 ispipe = np->n_name[0] == '|';
228 fname = np->n_name+1;
230 fname = expand(np->n_name);
233 * See if we have copied the complete message out yet.
239 char tempname[PATHSIZE];
241 (void)snprintf(tempname, sizeof(tempname),
242 "%s/mail.ReXXXXXXXXXX", tmpdir);
243 if ((fd = mkstemp(tempname)) == -1 ||
244 (fout = Fdopen(fd, "a")) == NULL) {
245 warn("%s", tempname);
249 image = open(tempname, O_RDWR);
252 warn("%s", tempname);
257 (void)fcntl(image, F_SETFD, 1);
258 fprintf(fout, "From %s %s", myname, date);
260 GTO|GSUBJECT|GCC|GREPLYTO|GINREPLYTO|GNL);
261 while ((c = getc(fo)) != EOF)
267 warn("%s", tempname);
276 * Now either copy "image" to the desired file
277 * or give it as the standard input to the desired
278 * program as appropriate.
288 * We can't really reuse the same image file,
289 * because multiple piped recipients will
290 * share the same lseek location and trample
293 if ((sh = value("SHELL")) == NULL)
295 (void)sigemptyset(&nset);
296 (void)sigaddset(&nset, SIGHUP);
297 (void)sigaddset(&nset, SIGINT);
298 (void)sigaddset(&nset, SIGQUIT);
299 pid = start_command(sh, &nset, image, -1, "-c", fname,
308 if ((fout = Fopen(fname, "a")) == NULL) {
313 if ((f = dup(image)) < 0) {
317 fin = Fdopen(f, "r");
319 fprintf(stderr, "Can't reopen image\n");
325 while ((c = getc(fin)) != EOF)
339 * In days of old we removed the entry from the
340 * the list; now for sake of header expansion
341 * we leave it in and mark it as deleted.
354 * Determine if the passed address is a local "send to file" address.
355 * If any of the network metacharacters precedes any slashes, it can't
356 * be a filename. We cheat with .'s to allow path names like ./...
359 isfileaddr(char *name)
365 for (cp = name; *cp != '\0'; cp++) {
366 if (*cp == '!' || *cp == '%' || *cp == '@')
375 * Map all of the aliased users in the invoker's mailrc
376 * file and insert them into the list.
377 * Changed after all these months of service to recursively
378 * expand names (2/14/80).
382 usermap(struct name *names)
384 struct name *new, *np, *cp;
385 struct grouphead *gh;
390 metoo = (value("metoo") != NULL);
392 if (np->n_name[0] == '\\') {
398 gh = findgroup(np->n_name);
401 new = gexpand(new, gh, metoo, np->n_type);
410 * Recursively expand a group name. We limit the expansion to some
411 * fixed level to keep things from going haywire.
412 * Direct recursion is not expanded for convenience.
416 gexpand(struct name *nlist, struct grouphead *gh, int metoo, int ntype)
419 struct grouphead *ngh;
424 if (depth > MAXEXP) {
425 printf("Expanding alias to depth larger than %d\n", MAXEXP);
429 for (gp = gh->g_list; gp != NULL; gp = gp->ge_link) {
433 if (strcmp(cp, gh->g_name) == 0)
435 if ((ngh = findgroup(cp)) != NULL) {
436 nlist = gexpand(nlist, ngh, metoo, ntype);
440 np = nalloc(cp, ntype);
442 * At this point should allow to expand
443 * to self if only person in group
445 if (gp == gh->g_list && gp->ge_link == NULL)
447 if (!metoo && strcmp(cp, myname) == 0)
450 nlist = put(nlist, np);
457 * Concatenate the two passed name lists, return the result.
460 cat(struct name *n1, struct name *n2)
475 * Unpack the name list onto a vector of strings.
476 * Return an error if the name list won't fit.
479 unpack(struct name *np)
483 int t, extra, metoo, verbose;
486 if ((t = count(n)) == 0)
487 errx(1, "No names to unpack");
489 * Compute the number of extra arguments we will need.
490 * We need at least two extra -- one for "mail" and one for
491 * the terminating 0 pointer. Additional spots may be needed
492 * to pass along -f to the host mailer.
496 metoo = value("metoo") != NULL;
499 verbose = value("verbose") != NULL;
502 top = (char **)salloc((t + extra) * sizeof(*top));
510 for (; n != NULL; n = n->n_flink)
511 if ((n->n_type & GDEL) == 0)
518 * Remove all of the duplicates from the passed name list by
519 * insertion sorting them, then checking for dups.
520 * Return the head of the new list.
523 elide(struct name *names)
525 struct name *np, *t, *new;
538 while (strcasecmp(t->n_name, np->n_name) < 0) {
539 if (t->n_flink == NULL)
545 * If we ran out of t's, put the new entry after
546 * the current value of t.
549 if (strcasecmp(t->n_name, np->n_name) < 0) {
559 * Otherwise, put the new entry in front of the
560 * current t. If at the front of the list,
561 * the new guy becomes the new head of the list.
575 * The normal case -- we are inserting into the
576 * middle of the list.
582 x->n_blink = t->n_blink;
583 t->n_blink->n_flink = x;
588 * Now the list headed up by new is sorted.
589 * Go through it and remove duplicates.
595 while (t->n_flink != NULL &&
596 strcasecmp(np->n_name, t->n_flink->n_name) == 0)
598 if (t == np || t == NULL) {
604 * Now t points to the last entry with the same name
605 * as np. Make np point beyond t.
608 np->n_flink = t->n_flink;
609 if (t->n_flink != NULL)
610 t->n_flink->n_blink = np;
617 * Put another node onto a list of names and return
621 put(struct name *list, struct name *node)
623 node->n_flink = list;
624 node->n_blink = NULL;
626 list->n_blink = node;
631 * Determine the number of undeleted elements in
632 * a name list and return it.
635 count(struct name *np)
639 for (c = 0; np != NULL; np = np->n_flink)
640 if ((np->n_type & GDEL) == 0)
646 * Delete the given name from a namelist.
649 delname(struct name *np, char *name)
653 for (p = np; p != NULL; p = p->n_flink)
654 if (strcasecmp(p->n_name, name) == 0) {
655 if (p->n_blink == NULL) {
656 if (p->n_flink != NULL)
657 p->n_flink->n_blink = NULL;
661 if (p->n_flink == NULL) {
662 if (p->n_blink != NULL)
663 p->n_blink->n_flink = NULL;
666 p->n_blink->n_flink = p->n_flink;
667 p->n_flink->n_blink = p->n_blink;
673 * Pretty print a name list
674 * Uncomment it if you need it.
679 prettyprint(struct name *name)
685 fprintf(stderr, "%s(%d) ", np->n_name, np->n_type);
688 fprintf(stderr, "\n");