1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822
|
/*
* Heirloom mailx - a mail user agent derived from Berkeley Mail.
*
* Copyright (c) 2000-2004 Gunnar Ritter, Freiburg i. Br., Germany.
*/
/*
* Copyright (c) 1980, 1993
* The Regents of the University of California. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by the University of
* California, Berkeley and its contributors.
* 4. Neither the name of the University nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
#ifndef lint
#ifdef DOSCCS
static char sccsid[] = "@(#)names.c 2.22 (gritter) 3/4/06";
#endif
#endif /* not lint */
/*
* Mail -- a mail program
*
* Handle name lists.
*/
#include "rcv.h"
#include "extern.h"
#include <sys/stat.h>
#include <fcntl.h>
#include <time.h>
#include <unistd.h>
static struct name *tailof(struct name *name);
static struct name *extract1(char *line, enum gfield ntype, char *separators,
int copypfx);
static char *yankword(char *ap, char *wbuf, char *separators, int copypfx);
static int same_name(char *n1, char *n2);
static struct name *gexpand(struct name *nlist, struct grouphead *gh,
int metoo, int ntype);
static struct name *put(struct name *list, struct name *node);
static struct name *delname(struct name *np, char *name);
/*
* Allocate a single element of a name list,
* initialize its name field to the passed
* name and return it.
*/
struct name *
nalloc(char *str, enum gfield ntype)
{
struct name *np;
struct str in, out;
/*LINTED*/
np = (struct name *)salloc(sizeof *np);
np->n_flink = NULL;
np->n_blink = NULL;
np->n_type = ntype;
if (ntype & GFULL) {
np->n_name = savestr(skin(str));
if (strcmp(np->n_name, str)) {
in.s = str;
in.l = strlen(str);
mime_fromhdr(&in, &out, TD_ISPR|TD_ICONV);
np->n_fullname = savestr(out.s);
free(out.s);
} else
np->n_fullname = np->n_name;
} else if (ntype & GSKIN)
np->n_fullname = np->n_name = savestr(skin(str));
else
np->n_fullname = np->n_name = savestr(str);
return(np);
}
/*
* Find the tail of a list and return it.
*/
static struct name *
tailof(struct name *name)
{
struct name *np;
np = name;
if (np == NULL)
return(NULL);
while (np->n_flink != NULL)
np = np->n_flink;
return(np);
}
/*
* Extract a list of names from a line,
* and make a list of names from it.
* Return the list or NULL if none found.
*/
struct name *
extract(char *line, enum gfield ntype)
{
return extract1(line, ntype, " \t,(", 0);
}
struct name *
sextract(char *line, enum gfield ntype)
{
if (line && strpbrk(line, ",\"\\(<"))
return extract1(line, ntype, ",", 1);
else
return extract(line, ntype);
}
static struct name *
extract1(char *line, enum gfield ntype, char *separators, int copypfx)
{
char *cp, *nbuf;
struct name *top, *np, *t;
if (line == NULL || *line == '\0')
return NULL;
top = NULL;
np = NULL;
cp = line;
nbuf = ac_alloc(strlen(line) + 1);
while ((cp = yankword(cp, nbuf, separators, copypfx)) != NULL) {
t = nalloc(nbuf, ntype);
if (top == NULL)
top = t;
else
np->n_flink = t;
t->n_blink = np;
np = t;
}
ac_free(nbuf);
return top;
}
/*
* Turn a list of names into a string of the same names.
*/
char *
detract(struct name *np, enum gfield ntype)
{
int s;
char *cp, *top;
struct name *p;
int comma;
comma = ntype & GCOMMA;
if (np == NULL)
return(NULL);
ntype &= ~GCOMMA;
s = 0;
if ((debug || value("debug")) && comma)
fprintf(stderr, catgets(catd, CATSET, 145,
"detract asked to insert commas\n"));
for (p = np; p != NULL; p = p->n_flink) {
if (ntype && (p->n_type & GMASK) != ntype)
continue;
s += strlen(p->n_fullname) + 1;
if (comma)
s++;
}
if (s == 0)
return(NULL);
s += 2;
top = salloc(s);
cp = top;
for (p = np; p != NULL; p = p->n_flink) {
if (ntype && (p->n_type & GMASK) != ntype)
continue;
cp = sstpcpy(cp, p->n_fullname);
if (comma && p->n_flink != NULL)
*cp++ = ',';
*cp++ = ' ';
}
*--cp = 0;
if (comma && *--cp == ',')
*cp = 0;
return(top);
}
/*
* Grab a single word (liberal word)
* Throw away things between ()'s, and take anything between <>.
*/
static char *
yankword(char *ap, char *wbuf, char *separators, int copypfx)
{
char *cp, *pp, *wp;
cp = ap;
wp = wbuf;
while (blankchar(*cp & 0377) || *cp == ',')
cp++;
pp = cp;
if ((cp = nexttoken(cp)) == NULL)
return NULL;
if (copypfx)
while (pp < cp)
*wp++ = *pp++;
if (*cp == '<')
while (*cp && (*wp++ = *cp++) != '>');
else {
int incomm = 0;
while (*cp && (incomm || !strchr(separators, *cp))) {
if (*cp == '\"') {
if (cp == ap || *(cp - 1) != '\\') {
if (incomm)
incomm--;
else
incomm++;
*wp++ = '\"';
} else if (cp != ap) {
*(wp - 1) = '\"';
}
cp++;
continue;
}
*wp++ = *cp++;
}
}
*wp = '\0';
return cp;
}
/*
* For each recipient in the passed name list with a /
* in the name, append the message to the end of the named file
* and remove him from the recipient list.
*
* Recipients whose name begins with | are piped through the given
* program and removed.
*/
/*ARGSUSED 3*/
struct name *
outof(struct name *names, FILE *fo, struct header *hp)
{
int c, lastc;
struct name *np, *top;
time_t now;
char *date, *fname;
FILE *fout, *fin;
int ispipe;
top = names;
np = names;
time(&now);
date = ctime(&now);
while (np != NULL) {
if (!is_fileaddr(np->n_name) && np->n_name[0] != '|') {
np = np->n_flink;
continue;
}
ispipe = np->n_name[0] == '|';
if (ispipe)
fname = np->n_name+1;
else
fname = expand(np->n_name);
/*
* See if we have copied the complete message out yet.
* If not, do so.
*/
if (image < 0) {
char *tempEdit;
if ((fout = Ftemp(&tempEdit, "Re", "w", 0600, 1))
== NULL) {
perror(catgets(catd, CATSET, 146,
"temporary edit file"));
senderr++;
goto cant;
}
image = open(tempEdit, O_RDWR);
unlink(tempEdit);
Ftfree(&tempEdit);
if (image < 0) {
perror(catgets(catd, CATSET, 147,
"temporary edit file"));
senderr++;
Fclose(fout);
goto cant;
}
fcntl(image, F_SETFD, FD_CLOEXEC);
fprintf(fout, "From %s %s", myname, date);
c = EOF;
while (lastc = c, (c = getc(fo)) != EOF)
putc(c, fout);
rewind(fo);
if (lastc != '\n')
putc('\n', fout);
putc('\n', fout);
fflush(fout);
if (ferror(fout))
perror(catgets(catd, CATSET, 148,
"temporary edit file"));
Fclose(fout);
}
/*
* Now either copy "image" to the desired file
* or give it as the standard input to the desired
* program as appropriate.
*/
if (ispipe) {
int pid;
char *shell;
sigset_t nset;
/*
* XXX
* We can't really reuse the same image file,
* because multiple piped recipients will
* share the same lseek location and trample
* on one another.
*/
if ((shell = value("SHELL")) == NULL)
shell = SHELL;
sigemptyset(&nset);
sigaddset(&nset, SIGHUP);
sigaddset(&nset, SIGINT);
sigaddset(&nset, SIGQUIT);
pid = start_command(shell, &nset,
image, -1, "-c", fname, NULL);
if (pid < 0) {
senderr++;
goto cant;
}
free_child(pid);
} else {
int f;
if ((fout = Zopen(fname, "a", NULL)) == NULL) {
perror(fname);
senderr++;
goto cant;
}
if ((f = dup(image)) < 0) {
perror("dup");
fin = NULL;
} else
fin = Fdopen(f, "r");
if (fin == NULL) {
fprintf(stderr, catgets(catd, CATSET, 149,
"Can't reopen image\n"));
Fclose(fout);
senderr++;
goto cant;
}
rewind(fin);
while ((c = getc(fin)) != EOF)
putc(c, fout);
if (ferror(fout))
senderr++, perror(fname);
Fclose(fout);
Fclose(fin);
}
cant:
/*
* In days of old we removed the entry from the
* the list; now for sake of header expansion
* we leave it in and mark it as deleted.
*/
np->n_type |= GDEL;
np = np->n_flink;
}
if (image >= 0) {
close(image);
image = -1;
}
return(top);
}
/*
* Determine if the passed address is a local "send to file" address.
* If any of the network metacharacters precedes any slashes, it can't
* be a filename. We cheat with .'s to allow path names like ./...
*/
int
is_fileaddr(char *name)
{
char *cp;
if (strchr(name, '@') != NULL)
return 0;
if (*name == '+')
return 1;
for (cp = name; *cp; cp++) {
if (*cp == '!' || *cp == '%')
return 0;
if (*cp == '/')
return 1;
}
return 0;
}
static int
same_name(char *n1, char *n2)
{
int c1, c2;
if (value("allnet") != NULL) {
do {
c1 = (*n1++ & 0377);
c2 = (*n2++ & 0377);
c1 = lowerconv(c1);
c2 = lowerconv(c2);
if (c1 != c2)
return 0;
} while (c1 != '\0' && c2 != '\0' && c1 != '@' && c2 != '@');
return 1;
} else
return asccasecmp(n1, n2) == 0;
}
/*
* Map all of the aliased users in the invoker's mailrc
* file and insert them into the list.
* Changed after all these months of service to recursively
* expand names (2/14/80).
*/
struct name *
usermap(struct name *names)
{
struct name *new, *np, *cp;
struct grouphead *gh;
int metoo;
new = NULL;
np = names;
metoo = (value("metoo") != NULL);
while (np != NULL) {
if (np->n_name[0] == '\\') {
cp = np->n_flink;
new = put(new, np);
np = cp;
continue;
}
gh = findgroup(np->n_name);
cp = np->n_flink;
if (gh != NULL)
new = gexpand(new, gh, metoo, np->n_type);
else
new = put(new, np);
np = cp;
}
return(new);
}
/*
* Recursively expand a group name. We limit the expansion to some
* fixed level to keep things from going haywire.
* Direct recursion is not expanded for convenience.
*/
static struct name *
gexpand(struct name *nlist, struct grouphead *gh, int metoo, int ntype)
{
struct group *gp;
struct grouphead *ngh;
struct name *np;
static int depth;
char *cp;
if (depth > MAXEXP) {
printf(catgets(catd, CATSET, 150,
"Expanding alias to depth larger than %d\n"), MAXEXP);
return(nlist);
}
depth++;
for (gp = gh->g_list; gp != NULL; gp = gp->ge_link) {
cp = gp->ge_name;
if (*cp == '\\')
goto quote;
if (strcmp(cp, gh->g_name) == 0)
goto quote;
if ((ngh = findgroup(cp)) != NULL) {
nlist = gexpand(nlist, ngh, metoo, ntype);
continue;
}
quote:
np = nalloc(cp, ntype|GFULL);
/*
* At this point should allow to expand
* to self if only person in group
*/
if (gp == gh->g_list && gp->ge_link == NULL)
goto skip;
if (!metoo && same_name(cp, myname))
np->n_type |= GDEL;
skip:
nlist = put(nlist, np);
}
depth--;
return(nlist);
}
/*
* Concatenate the two passed name lists, return the result.
*/
struct name *
cat(struct name *n1, struct name *n2)
{
struct name *tail;
if (n1 == NULL)
return(n2);
if (n2 == NULL)
return(n1);
tail = tailof(n1);
tail->n_flink = n2;
n2->n_blink = tail;
return(n1);
}
/*
* Unpack the name list onto a vector of strings.
* Return an error if the name list won't fit.
*/
char **
unpack(struct name *np)
{
char **ap, **top;
struct name *n;
int t, extra, metoo, verbose;
n = np;
if ((t = count(n)) == 0)
panic(catgets(catd, CATSET, 151, "No names to unpack"));
/*
* Compute the number of extra arguments we will need.
* We need at least two extra -- one for "mail" and one for
* the terminating 0 pointer. Additional spots may be needed
* to pass along -f to the host mailer.
*/
extra = 2;
extra++;
metoo = value("metoo") != NULL;
if (metoo)
extra++;
verbose = value("verbose") != NULL;
if (verbose)
extra++;
/*LINTED*/
top = (char **)salloc((t + extra) * sizeof *top);
ap = top;
*ap++ = "send-mail";
*ap++ = "-i";
if (metoo)
*ap++ = "-m";
if (verbose)
*ap++ = "-v";
for (; n != NULL; n = n->n_flink)
if ((n->n_type & GDEL) == 0)
*ap++ = n->n_name;
*ap = NULL;
return(top);
}
/*
* Remove all of the duplicates from the passed name list by
* insertion sorting them, then checking for dups.
* Return the head of the new list.
*/
struct name *
elide(struct name *names)
{
struct name *np, *t, *new;
struct name *x;
if (names == NULL)
return(NULL);
new = names;
np = names;
np = np->n_flink;
if (np != NULL)
np->n_blink = NULL;
new->n_flink = NULL;
while (np != NULL) {
t = new;
while (asccasecmp(t->n_name, np->n_name) < 0) {
if (t->n_flink == NULL)
break;
t = t->n_flink;
}
/*
* If we ran out of t's, put the new entry after
* the current value of t.
*/
if (asccasecmp(t->n_name, np->n_name) < 0) {
t->n_flink = np;
np->n_blink = t;
t = np;
np = np->n_flink;
t->n_flink = NULL;
continue;
}
/*
* Otherwise, put the new entry in front of the
* current t. If at the front of the list,
* the new guy becomes the new head of the list.
*/
if (t == new) {
t = np;
np = np->n_flink;
t->n_flink = new;
new->n_blink = t;
t->n_blink = NULL;
new = t;
continue;
}
/*
* The normal case -- we are inserting into the
* middle of the list.
*/
x = np;
np = np->n_flink;
x->n_flink = t;
x->n_blink = t->n_blink;
t->n_blink->n_flink = x;
t->n_blink = x;
}
/*
* Now the list headed up by new is sorted.
* Go through it and remove duplicates.
*/
np = new;
while (np != NULL) {
t = np;
while (t->n_flink != NULL &&
asccasecmp(np->n_name, t->n_flink->n_name) == 0)
t = t->n_flink;
if (t == np || t == NULL) {
np = np->n_flink;
continue;
}
/*
* Now t points to the last entry with the same name
* as np. Make np point beyond t.
*/
np->n_flink = t->n_flink;
if (t->n_flink != NULL)
t->n_flink->n_blink = np;
np = np->n_flink;
}
return(new);
}
/*
* Put another node onto a list of names and return
* the list.
*/
static struct name *
put(struct name *list, struct name *node)
{
node->n_flink = list;
node->n_blink = NULL;
if (list != NULL)
list->n_blink = node;
return(node);
}
/*
* Determine the number of undeleted elements in
* a name list and return it.
*/
int
count(struct name *np)
{
int c;
for (c = 0; np != NULL; np = np->n_flink)
if ((np->n_type & GDEL) == 0)
c++;
return c;
}
/*
* Delete the given name from a namelist.
*/
static struct name *
delname(struct name *np, char *name)
{
struct name *p;
for (p = np; p != NULL; p = p->n_flink)
if (same_name(p->n_name, name)) {
if (p->n_blink == NULL) {
if (p->n_flink != NULL)
p->n_flink->n_blink = NULL;
np = p->n_flink;
continue;
}
if (p->n_flink == NULL) {
if (p->n_blink != NULL)
p->n_blink->n_flink = NULL;
continue;
}
p->n_blink->n_flink = p->n_flink;
p->n_flink->n_blink = p->n_blink;
}
return np;
}
/*
* Pretty print a name list
* Uncomment it if you need it.
*/
/*
void
prettyprint(struct name *name)
{
struct name *np;
np = name;
while (np != NULL) {
fprintf(stderr, "%s(%d) ", np->n_name, np->n_type);
np = np->n_flink;
}
fprintf(stderr, "\n");
}
*/
struct name *
delete_alternates(struct name *np)
{
struct name *xp;
char **ap;
np = delname(np, myname);
if (altnames)
for (ap = altnames; *ap; ap++)
np = delname(np, *ap);
if ((xp = sextract(value("from"), GEXTRA|GSKIN)) != NULL)
while (xp) {
np = delname(np, xp->n_name);
xp = xp->n_flink;
}
if ((xp = sextract(value("replyto"), GEXTRA|GSKIN)) != NULL)
while (xp) {
np = delname(np, xp->n_name);
xp = xp->n_flink;
}
if ((xp = sextract(value("sender"), GEXTRA|GSKIN)) != NULL)
while (xp) {
np = delname(np, xp->n_name);
xp = xp->n_flink;
}
return np;
}
int
is_myname(char *name)
{
struct name *xp;
char **ap;
if (same_name(myname, name))
return 1;
if (altnames)
for (ap = altnames; *ap; ap++)
if (same_name(*ap, name))
return 1;
if ((xp = sextract(value("from"), GEXTRA|GSKIN)) != NULL)
while (xp) {
if (same_name(xp->n_name, name))
return 1;
xp = xp->n_flink;
}
if ((xp = sextract(value("replyto"), GEXTRA|GSKIN)) != NULL)
while (xp) {
if (same_name(xp->n_name, name))
return 1;
xp = xp->n_flink;
}
if ((xp = sextract(value("sender"), GEXTRA|GSKIN)) != NULL)
while (xp) {
if (same_name(xp->n_name, name))
return 1;
xp = xp->n_flink;
}
return 0;
}
|