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
|
/* aliasbr.c -- new aliasing mechanism
*
* This code is Copyright (c) 2002, by the authors of nmh. See the
* COPYRIGHT file in the root directory of the nmh distribution for
* complete copyright information.
*/
#include "h/mh.h"
#include "sbr/concat.h"
#include "sbr/vfgets.h"
#include "sbr/getcpy.h"
#include "aliasbr.h"
#include "sbr/addrsbr.h"
#include "sbr/utils.h"
#include "sbr/path.h"
#include <pwd.h>
static int akvis;
static char *akerrst;
/* The first also-known-as struct in the linked list if the list is not empty. */
struct aka *akahead = NULL;
/* The last also-known-as struct in the linked list if the list is not empty. */
struct aka *akatail = NULL;
/*
* prototypes
*/
static char *akval (struct aka *, char *);
static bool aleq (char *, char *) PURE;
static char *scanp (char *) PURE;
static char *getp (char *);
static char *seekp (char *, char *, char **);
static int addfile (struct aka *, char *);
static char *getalias (char *);
static void add_aka (struct aka *, char *);
static struct aka *akalloc (char *);
/* Do mh alias substitution on 's' and return the results. */
char *
akvalue (char *s)
{
char *v;
if (akahead == NULL)
alias (AliasFile);
akvis = -1;
v = akval (akahead, s);
if (akvis == -1)
akvis = 0;
return v;
}
int
akvisible (void)
{
return akvis;
}
struct adr {
char *ad_text; /* text of this address in list */
struct adr *ad_next; /* next adr in list */
char ad_local; /* text is local (check for expansion) */
};
char *
akresult (struct aka *ak)
{
char *cp = NULL, *dp, *pp;
struct adr *ad;
for (ad = ak->ak_addr; ad; ad = ad->ad_next) {
pp = ad->ad_local ? akval (ak->ak_next, ad->ad_text)
: getcpy (ad->ad_text);
if (cp) {
dp = cp;
cp = concat (cp, ",", pp, NULL);
free (dp);
free (pp);
} else
cp = pp;
}
if (akvis == -1)
akvis = ak->ak_visible;
return cp;
}
static char *
akval (struct aka *ak, char *s)
{
if (!s)
return s; /* XXX */
/* It'd be tempting to check for a trailing semicolon and remove
it. But that would break the EXMH alias parser on what would
then be valid expressions:
http://lists.gnu.org/archive/html/nmh-workers/2012-10/msg00039.html
*/
for (; ak; ak = ak->ak_next) {
if (aleq (s, ak->ak_name)) {
return akresult (ak);
}
if (strchr (s, ':')) {
/* The first address in a blind list will contain the
alias name, so try to match, but just with just the
address (not including the list name). If there's a
match, then replace the alias part with its
expansion. */
char *name = getname (s);
char *cp = NULL;
if (name) {
/* s is of the form "Blind list: address". If address
is an alias, expand it. */
struct mailname *mp = getm (name, NULL, 0, NULL, 0);
if (mp && mp->m_ingrp) {
char *gname = mh_xstrdup(FENDNULL(mp->m_gname));
/* FIXME: gname must be true; add() never returns NULL.
* Is some other test required? */
if (gname && aleq (name, ak->ak_name)) {
/* Will leak cp. */
cp = concat (gname, akresult (ak), NULL);
free (gname);
}
}
mnfree (mp);
}
/* Need to flush getname after use. */
while (getname ("")) continue;
if (cp) {
return cp;
}
}
}
return mh_xstrdup(s);
}
/* Does string match aliasent where the latter may contain a ‘*’ which
* matches zero or more characters and stops matching,
* e.g. "foobar" matches "foo*xyzzy". */
static bool
aleq (char *string, char *aliasent)
{
char c;
while ((c = *string++)) {
if (*aliasent == '*')
return true;
if (tolower((unsigned char)c) != tolower((unsigned char)*aliasent))
return false;
aliasent++;
}
return *aliasent == 0 || *aliasent == '*';
}
int
alias (char *file)
{
int i;
char *bp, *cp, *pp;
char lc, *ap;
struct aka *ak = NULL;
FILE *fp;
if (*file != '/'
&& !has_prefix(file, "./") && !has_prefix(file, "../"))
file = etcpath (file);
if ((fp = fopen (file, "r")) == NULL) {
akerrst = file;
return AK_NOFILE;
}
while (vfgets (fp, &ap) == OK) {
bp = ap;
switch (*(pp = scanp (bp))) {
case '<': /* recurse a level */
if (!*(cp = getp (pp + 1))) {
akerrst = "'<' without alias-file";
fclose (fp);
return AK_ERROR;
}
if ((i = alias (cp)) != AK_OK) {
fclose (fp);
return i;
}
continue;
case ':': /* comment */
case ';':
case '#':
case 0:
continue;
}
akerrst = bp;
if (!*(cp = seekp (pp, &lc, &ap))) {
fclose (fp);
return AK_ERROR;
}
if (!(ak = akalloc (cp))) {
fclose (fp);
return AK_LIMIT;
}
switch (lc) {
case ':':
ak->ak_visible = false;
break;
case ';':
ak->ak_visible = true;
break;
default:
fclose (fp);
return AK_ERROR;
}
switch (*(pp = scanp (ap))) {
case 0: /* EOL */
fclose (fp);
return AK_ERROR;
case '<': /* read values from file */
if (!*(cp = getp (pp + 1))) {
fclose (fp);
return AK_ERROR;
}
if (!addfile (ak, cp)) {
fclose (fp);
return AK_NOFILE;
}
break;
default: /* list */
while ((cp = getalias (pp)))
add_aka (ak, cp);
break;
}
}
fclose (fp);
return AK_OK;
}
/* Return a pointer to a static string holding a formatted error message
* for the AK_* value in ‘i’ using akerrst. */
char *
akerror (int i)
{
static char buffer[BUFSIZ];
switch (i) {
case AK_NOFILE:
snprintf (buffer, sizeof(buffer), "unable to read '%s'", akerrst);
break;
case AK_ERROR:
snprintf (buffer, sizeof(buffer), "error in line '%s'", akerrst);
break;
case AK_LIMIT:
snprintf (buffer, sizeof(buffer), "out of memory while on '%s'", akerrst);
break;
default:
snprintf (buffer, sizeof(buffer), "unknown error (%d)", i);
break;
}
return buffer;
}
/* Skip zero or more isspace(3) bytes and return a pointer to the next
* byte. */
static char *
scanp (char *p)
{
while (isspace ((unsigned char) *p))
p++;
return p;
}
/* Skip zero or more isspace(3) bytes and return a pointer to the next,
* possibly NUL, byte having terminated that run of zero or more
* non-isspace(3) bytes with a NUL. "\t\tfoo bar" returns "foo\0bar". */
static char *
getp (char *p)
{
char *cp = scanp (p);
p = cp;
while (!isspace ((unsigned char) *cp) && *cp)
cp++;
*cp = 0;
return p;
}
/* Skip zero or more isspace(3) bytes and return a pointer to the next,
* possibly NUL, byte having terminated that run of zero or more
* non-isspace(3), non-colon, non-semicolon bytes with a NUL.
* "\t\tfoo bar; xyzzy" returns "foo bar\0 xyzzy" and sets ‘c’ to ';'
* and ‘*a’ to " xyzzy". */
static char *
seekp (char *p, char *c, char **a)
{
char *cp;
p = cp = scanp (p);
while (!isspace ((unsigned char) *cp) && *cp && *cp != ':' && *cp != ';')
cp++;
*c = *cp;
*cp++ = 0;
*a = cp;
return p;
}
static int
addfile (struct aka *ak, char *file)
{
char *cp;
static char buffer[BUFSIZ];
FILE *fp;
if (!(fp = fopen (etcpath (file), "r"))) {
akerrst = file;
return 0;
}
while (fgets (buffer, sizeof buffer, fp))
while ((cp = getalias (buffer)))
add_aka (ak, cp);
fclose (fp);
return 1;
}
static char *
getalias (char *addrs)
{
char *pp, *qp;
static char *cp = NULL;
if (cp == NULL)
cp = addrs;
else if (*cp == 0)
return cp = NULL;
/* Remove leading any space from the address. */
for (pp = cp; isspace ((unsigned char) *pp); pp++)
continue;
if (*pp == 0)
return cp = NULL;
/* Find the end of the address. */
for (qp = pp; *qp != 0 && *qp != ','; qp++)
continue;
/* Set cp to point to the remainder of the addresses. */
if (*qp == ',')
*qp++ = 0;
for (cp = qp, qp--; qp > pp; qp--)
if (*qp != 0) {
if (isspace ((unsigned char) *qp))
*qp = 0;
else
break;
}
return pp;
}
static void
add_aka (struct aka *ak, char *pp)
{
struct adr *ad, *ld;
for (ad = ak->ak_addr, ld = NULL; ad; ld = ad, ad = ad->ad_next)
if (!strcmp (pp, ad->ad_text))
return;
NEW(ad);
ad->ad_text = mh_xstrdup(pp);
ad->ad_local = strchr(pp, '@') == NULL && strchr(pp, '!') == NULL;
ad->ad_next = NULL;
if (ak->ak_addr) {
assert (ld != NULL);
ld->ad_next = ad;
} else
ak->ak_addr = ad;
}
/* Appends a new also-known-as struct onto the end of the akahead linked
* list and returns the new struct. */
static struct aka *
akalloc (char *id)
{
struct aka *p;
NEW(p);
p->ak_name = getcpy (id);
p->ak_visible = false;
p->ak_addr = NULL;
p->ak_next = NULL;
if (akatail != NULL)
akatail->ak_next = p;
if (akahead == NULL)
akahead = p;
akatail = p;
return p;
}
|