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 * 4. Neither the name of the University nor the names of its contributors
14 * may be used to endorse or promote products derived from this software
15 * without specific prior written permission.
17 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
32 static char sccsid[] = "@(#)names.c 8.1 (Berkeley) 6/6/93";
35 #include <sys/cdefs.h>
36 __FBSDID("$FreeBSD$");
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 * Grab a single login name (liberal word)
202 * Throw away things between ()'s, take anything between <>,
203 * and look for words before metacharacters %, @, !.
206 yanklogin(char *ap, char wbuf[])
208 char *cp, *cp2, *cp_temp;
218 while (*cp != '\0') {
230 } else if (*cp == ' ' || *cp == '\t' || *cp == ',')
237 * Now, let's go forward till we meet the needed character,
238 * and step one word back.
241 /* First, remember current point. */
246 * Note that we look ahead in a cycle. This is safe, since
247 * non-end of string is checked first.
249 while(*cp != '\0' && strchr("@%!", *(cp + 1)) == NULL)
253 * Now, start stepping back to the first non-word character,
254 * while counting the number of symbols in a word.
256 while(cp != cp_temp && strchr(" \t,<>", *(cp - 1)) == NULL) {
261 /* Finally, grab the word forward. */
273 * For each recipient in the passed name list with a /
274 * in the name, append the message to the end of the named file
275 * and remove him from the recipient list.
277 * Recipients whose name begins with | are piped through the given
278 * program and removed.
281 outof(struct name *names, FILE *fo, struct header *hp)
284 struct name *np, *top;
294 if (!isfileaddr(np->n_name) && np->n_name[0] != '|') {
298 ispipe = np->n_name[0] == '|';
300 fname = np->n_name+1;
302 fname = expand(np->n_name);
305 * See if we have copied the complete message out yet.
311 char tempname[PATHSIZE];
313 (void)snprintf(tempname, sizeof(tempname),
314 "%s/mail.ReXXXXXXXXXX", tmpdir);
315 if ((fd = mkstemp(tempname)) == -1 ||
316 (fout = Fdopen(fd, "a")) == NULL) {
317 warn("%s", tempname);
321 image = open(tempname, O_RDWR);
324 warn("%s", tempname);
329 (void)fcntl(image, F_SETFD, 1);
330 fprintf(fout, "From %s %s", myname, date);
332 GTO|GSUBJECT|GCC|GREPLYTO|GINREPLYTO|GNL);
333 while ((c = getc(fo)) != EOF)
339 warn("%s", tempname);
348 * Now either copy "image" to the desired file
349 * or give it as the standard input to the desired
350 * program as appropriate.
360 * We can't really reuse the same image file,
361 * because multiple piped recipients will
362 * share the same lseek location and trample
365 if ((sh = value("SHELL")) == NULL)
367 (void)sigemptyset(&nset);
368 (void)sigaddset(&nset, SIGHUP);
369 (void)sigaddset(&nset, SIGINT);
370 (void)sigaddset(&nset, SIGQUIT);
371 pid = start_command(sh, &nset, image, -1, "-c", fname,
380 if ((fout = Fopen(fname, "a")) == NULL) {
385 if ((f = dup(image)) < 0) {
389 fin = Fdopen(f, "r");
391 fprintf(stderr, "Can't reopen image\n");
397 while ((c = getc(fin)) != EOF)
411 * In days of old we removed the entry from the
412 * the list; now for sake of header expansion
413 * we leave it in and mark it as deleted.
426 * Determine if the passed address is a local "send to file" address.
427 * If any of the network metacharacters precedes any slashes, it can't
428 * be a filename. We cheat with .'s to allow path names like ./...
431 isfileaddr(char *name)
437 for (cp = name; *cp != '\0'; cp++) {
438 if (*cp == '!' || *cp == '%' || *cp == '@')
447 * Map all of the aliased users in the invoker's mailrc
448 * file and insert them into the list.
449 * Changed after all these months of service to recursively
450 * expand names (2/14/80).
454 usermap(struct name *names)
456 struct name *new, *np, *cp;
457 struct grouphead *gh;
462 metoo = (value("metoo") != NULL);
464 if (np->n_name[0] == '\\') {
470 gh = findgroup(np->n_name);
473 new = gexpand(new, gh, metoo, np->n_type);
482 * Recursively expand a group name. We limit the expansion to some
483 * fixed level to keep things from going haywire.
484 * Direct recursion is not expanded for convenience.
488 gexpand(struct name *nlist, struct grouphead *gh, int metoo, int ntype)
491 struct grouphead *ngh;
496 if (depth > MAXEXP) {
497 printf("Expanding alias to depth larger than %d\n", MAXEXP);
501 for (gp = gh->g_list; gp != NULL; gp = gp->ge_link) {
505 if (strcmp(cp, gh->g_name) == 0)
507 if ((ngh = findgroup(cp)) != NULL) {
508 nlist = gexpand(nlist, ngh, metoo, ntype);
512 np = nalloc(cp, ntype);
514 * At this point should allow to expand
515 * to self if only person in group
517 if (gp == gh->g_list && gp->ge_link == NULL)
519 if (!metoo && strcmp(cp, myname) == 0)
522 nlist = put(nlist, np);
529 * Concatenate the two passed name lists, return the result.
532 cat(struct name *n1, struct name *n2)
547 * Unpack the name list onto a vector of strings.
548 * Return an error if the name list won't fit.
551 unpack(struct name *np)
555 int t, extra, metoo, verbose;
558 if ((t = count(n)) == 0)
559 errx(1, "No names to unpack");
561 * Compute the number of extra arguments we will need.
562 * We need at least two extra -- one for "mail" and one for
563 * the terminating 0 pointer. Additional spots may be needed
564 * to pass along -f to the host mailer.
568 metoo = value("metoo") != NULL;
571 verbose = value("verbose") != NULL;
574 top = (char **)salloc((t + extra) * sizeof(*top));
582 for (; n != NULL; n = n->n_flink)
583 if ((n->n_type & GDEL) == 0)
590 * Remove all of the duplicates from the passed name list by
591 * insertion sorting them, then checking for dups.
592 * Return the head of the new list.
595 elide(struct name *names)
597 struct name *np, *t, *new;
610 while (strcasecmp(t->n_name, np->n_name) < 0) {
611 if (t->n_flink == NULL)
617 * If we ran out of t's, put the new entry after
618 * the current value of t.
621 if (strcasecmp(t->n_name, np->n_name) < 0) {
631 * Otherwise, put the new entry in front of the
632 * current t. If at the front of the list,
633 * the new guy becomes the new head of the list.
647 * The normal case -- we are inserting into the
648 * middle of the list.
654 x->n_blink = t->n_blink;
655 t->n_blink->n_flink = x;
660 * Now the list headed up by new is sorted.
661 * Go through it and remove duplicates.
667 while (t->n_flink != NULL &&
668 strcasecmp(np->n_name, t->n_flink->n_name) == 0)
670 if (t == np || t == NULL) {
676 * Now t points to the last entry with the same name
677 * as np. Make np point beyond t.
680 np->n_flink = t->n_flink;
681 if (t->n_flink != NULL)
682 t->n_flink->n_blink = np;
689 * Put another node onto a list of names and return
693 put(struct name *list, struct name *node)
695 node->n_flink = list;
696 node->n_blink = NULL;
698 list->n_blink = node;
703 * Determine the number of undeleted elements in
704 * a name list and return it.
707 count(struct name *np)
711 for (c = 0; np != NULL; np = np->n_flink)
712 if ((np->n_type & GDEL) == 0)
718 * Delete the given name from a namelist.
721 delname(struct name *np, char name[])
725 for (p = np; p != NULL; p = p->n_flink)
726 if (strcasecmp(p->n_name, name) == 0) {
727 if (p->n_blink == NULL) {
728 if (p->n_flink != NULL)
729 p->n_flink->n_blink = NULL;
733 if (p->n_flink == NULL) {
734 if (p->n_blink != NULL)
735 p->n_blink->n_flink = NULL;
738 p->n_blink->n_flink = p->n_flink;
739 p->n_flink->n_blink = p->n_blink;
745 * Pretty print a name list
746 * Uncomment it if you need it.
751 prettyprint(struct name *name)
757 fprintf(stderr, "%s(%d) ", np->n_name, np->n_type);
760 fprintf(stderr, "\n");