nam_a_grp.c

   1 /*@ S-nail - a mail user agent derived from Berkeley Mail.
   2  *@ Name lists, alternates and groups: aliases, mailing lists, shortcuts.
   3  *
   4  * Copyright (c) 2000-2004 Gunnar Ritter, Freiburg i. Br., Germany.
   5  * Copyright (c) 2012 - 2017 Steffen (Daode) Nurpmeso <steffen@sdaoden.eu>.
   6  */
   7 /*
   8  * Copyright (c) 1980, 1993
   9  *      The Regents of the University of California.  All rights reserved.
  10  *
  11  * Redistribution and use in source and binary forms, with or without
  12  * modification, are permitted provided that the following conditions
  13  * are met:
  14  * 1. Redistributions of source code must retain the above copyright
  15  *    notice, this list of conditions and the following disclaimer.
  16  * 2. Redistributions in binary form must reproduce the above copyright
  17  *    notice, this list of conditions and the following disclaimer in the
  18  *    documentation and/or other materials provided with the distribution.
  19  * 3. Neither the name of the University nor the names of its contributors
  20  *    may be used to endorse or promote products derived from this software
  21  *    without specific prior written permission.
  22  *
  23  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
  24  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  25  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  26  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
  27  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  28  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  29  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  30  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  31  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  32  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  33  * SUCH DAMAGE.
  34  */
  35 #undef n_FILE
  36 #define n_FILE nam_a_grp
  37
  38 #ifndef HAVE_AMALGAMATION
  39 # include "nail.h"
  40 #endif
  41
  42 enum group_type {
  43    /* Main types (bits not values for easier testing only) */
  44    GT_ALIAS       = 1<< 0,
  45    GT_MLIST       = 1<< 1,
  46    GT_SHORTCUT    = 1<< 2,
  47    GT_MASK        = GT_ALIAS | GT_MLIST | GT_SHORTCUT,
  48
  49    /* Subtype bits and flags */
  50    GT_SUBSCRIBE   = 1<< 4,
  51    GT_REGEX       = 1<< 5,
  52
  53    /* Extended type mask to be able to reflect what we really have; i.e., mlist
  54     * can have GT_REGEX if they are subscribed or not, but `mlsubscribe' should
  55     * print out only GT_MLIST which have the GT_SUBSCRIBE attribute set */
  56    GT_PRINT_MASK  = GT_MASK | GT_SUBSCRIBE
  57 };
  58
  59 struct group {
  60    struct group   *g_next;
  61    size_t         g_subclass_off;   /* of "subclass" in .g_id (if any) */
  62    ui8_t          g_type;           /* enum group_type */
  63    /* Identifying name, of variable size.  Dependent on actual "subtype" more
  64     * data follows thereafter, but note this is always used (i.e., for regular
  65     * expression entries this is still set to the plain string) */
  66    char           g_id[n_VFIELD_SIZE(-1)];
  67 };
  68 #define GP_TO_SUBCLASS(X,G) \
  69 do {\
  70    union __group_subclass {void *gs_vp; char *gs_cp;} __gs__;\
  71    __gs__.gs_cp = (char*)n_UNCONST(G) + (G)->g_subclass_off;\
  72    (X) = __gs__.gs_vp;\
  73 } while (0)
  74
  75 struct grp_names_head {
  76    struct grp_names  *gnh_head;
  77 };
  78
  79 struct grp_names {
  80    struct grp_names  *gn_next;
  81    char              gn_id[n_VFIELD_SIZE(0)];
  82 };
  83
  84 #ifdef HAVE_REGEX
  85 struct grp_regex {
  86    struct grp_regex  *gr_last;
  87    struct grp_regex  *gr_next;
  88    struct group      *gr_mygroup;   /* xxx because lists use grp_regex*! ?? */
  89    size_t            gr_hits;       /* Number of times this group matched */
  90    regex_t           gr_regex;
  91 };
  92 #endif
  93
  94 struct group_lookup {
  95    struct group   **gl_htable;
  96    struct group   **gl_slot;
  97    struct group   *gl_slot_last;
  98    struct group   *gl_group;
  99 };
 100
 101 /* List of alternate names of user */
 102 static char **a_nag_altnames;
 103
 104 /* `alias' */
 105 static struct group     *_alias_heads[HSHSIZE]; /* TODO dynamic hash */
 106
 107 /* `mlist', `mlsubscribe'.  Anything is stored in the hashmap.. */
 108 static struct group     *_mlist_heads[HSHSIZE]; /* TODO dynamic hash */
 109
 110 /* ..but entries which have GT_REGEX set are false lookups and will really be
 111  * accessed via sequential lists instead, which are type-specific for better
 112  * performance, but also to make it possible to have ".*@xy.org" as a mlist
 113  * and "(one|two)@xy.org" as a mlsubscription.
 114  * These lists use a bit of QOS optimization in that a matching group will
 115  * become relinked as the new list head if its hit count is
 116  *    (>= ((xy_hits / _xy_size) >> 2))
 117  * Note that the hit counts only count currently linked in nodes.. */
 118 #ifdef HAVE_REGEX
 119 static struct grp_regex *_mlist_regex, *_mlsub_regex;
 120 static size_t           _mlist_size, _mlist_hits, _mlsub_size, _mlsub_hits;
 121 #endif
 122
 123 /* `shortcut' */
 124 static struct group     *_shortcut_heads[HSHSIZE]; /* TODO dynamic hash */
 125
 126 /* Same name, while taking care for *allnet*? */
 127 static bool_t        _same_name(char const *n1, char const *n2);
 128
 129 /* Delete the given name from a namelist */
 130 static struct name * delname(struct name *np, char const *name);
 131
 132 /* Put another node onto a list of names and return the list */
 133 static struct name * put(struct name *list, struct name *node);
 134
 135 /* Grab a single name (liberal name) */
 136 static char const *  yankname(char const *ap, char *wbuf,
 137                         char const *separators, int keepcomms);
 138
 139 /* Extraction multiplexer that splits an input line to names */
 140 static struct name * _extract1(char const *line, enum gfield ntype,
 141                         char const *separators, bool_t keepcomms);
 142
 143 /* Recursively expand a alias name.  Limit expansion to some fixed level.
 144  * Direct recursion is not expanded for convenience */
 145 static struct name * _gexpand(size_t level, struct name *nlist,
 146                         struct group *gp, bool_t metoo, int ntype);
 147
 148 /* Lookup a group, return it or NULL, fill in glp anyway */
 149 static struct group * _group_lookup(enum group_type gt,
 150                         struct group_lookup *glp, char const *id);
 151
 152 /* Easier-to-use wrapper around _group_lookup() */
 153 static struct group * _group_find(enum group_type gt, char const *id);
 154
 155 /* Iteration: go to the first group, which also inits the iterator.  A valid
 156  * iterator can be stepped via _next().  A NULL return means no (more) groups
 157  * to be iterated exist, in which case only glp->gl_group is set (NULL) */
 158 static struct group * _group_go_first(enum group_type gt,
 159                         struct group_lookup *glp);
 160 static struct group * _group_go_next(struct group_lookup *glp);
 161
 162 /* Fetch the group id, create it as necessary */
 163 static struct group * _group_fetch(enum group_type gt, char const *id,
 164                         size_t addsz);
 165
 166 /* "Intelligent" delete which handles a "*" id, too;
 167  * returns a true boolean if a group was deleted, and always succeeds for "*" */
 168 static bool_t        _group_del(enum group_type gt, char const *id);
 169
 170 static struct group * __group_del(struct group_lookup *glp);
 171 static void          __names_del(struct group *gp);
 172
 173 /* Print all groups of the given type, alphasorted */
 174 static void          _group_print_all(enum group_type gt);
 175
 176 static int           __group_print_qsorter(void const *a, void const *b);
 177
 178 /* Really print a group, actually.  Return number of written lines */
 179 static size_t        _group_print(struct group const *gp, FILE *fo);
 180
 181 /* Multiplexers for list and subscribe commands */
 182 static int           _mlmux(enum group_type gt, char **argv);
 183 static int           _unmlmux(enum group_type gt, char **argv);
 184
 185 /* Relinkers for the sequential match lists */
 186 #ifdef HAVE_REGEX
 187 static void          _mlmux_linkin(struct group *gp);
 188 static void          _mlmux_linkout(struct group *gp);
 189 # define _MLMUX_LINKIN(GP) \
 190    do if ((GP)->g_type & GT_REGEX) _mlmux_linkin(GP); while (0)
 191 # define _MLMUX_LINKOUT(GP) \
 192    do if ((GP)->g_type & GT_REGEX) _mlmux_linkout(GP); while (0)
 193 #else
 194 # define _MLMUX_LINKIN(GP)
 195 # define _MLMUX_LINKOUT(GP)
 196 #endif
 197
 198 static bool_t
 199 _same_name(char const *n1, char const *n2)
 200 {
 201    bool_t rv = FAL0;
 202    char c1, c2;
 203    NYD_ENTER;
 204
 205    if (ok_blook(allnet)) {
 206       do {
 207          c1 = *n1++;
 208          c2 = *n2++;
 209          c1 = lowerconv(c1);
 210          c2 = lowerconv(c2);
 211          if (c1 != c2)
 212             goto jleave;
 213       } while (c1 != '\0' && c2 != '\0' && c1 != '@' && c2 != '@');
 214       rv = 1;
 215    } else
 216       rv = !asccasecmp(n1, n2);
 217 jleave:
 218    NYD_LEAVE;
 219    return rv;
 220 }
 221
 222 static struct name *
 223 delname(struct name *np, char const *name)
 224 {
 225    struct name *p;
 226    NYD_ENTER;
 227
 228    for (p = np; p != NULL; p = p->n_flink)
 229       if (_same_name(p->n_name, name)) {
 230          if (p->n_blink == NULL) {
 231             if (p->n_flink != NULL)
 232                p->n_flink->n_blink = NULL;
 233             np = p->n_flink;
 234             continue;
 235          }
 236          if (p->n_flink == NULL) {
 237             if (p->n_blink != NULL)
 238                p->n_blink->n_flink = NULL;
 239             continue;
 240          }
 241          p->n_blink->n_flink = p->n_flink;
 242          p->n_flink->n_blink = p->n_blink;
 243       }
 244    NYD_LEAVE;
 245    return np;
 246 }
 247
 248 static struct name *
 249 put(struct name *list, struct name *node)
 250 {
 251    NYD_ENTER;
 252    node->n_flink = list;
 253    node->n_blink = NULL;
 254    if (list != NULL)
 255       list->n_blink = node;
 256    NYD_LEAVE;
 257    return node;
 258 }
 259
 260 static char const *
 261 yankname(char const *ap, char *wbuf, char const *separators, int keepcomms)
 262 {
 263    char const *cp;
 264    char *wp, c, inquote, lc, lastsp;
 265    NYD_ENTER;
 266
 267    *(wp = wbuf) = '\0';
 268
 269    /* Skip over intermediate list trash, as in ".org>  ,  <xy@zz.org>" */
 270    for (c = *ap; blankchar(c) || c == ','; c = *++ap)
 271       ;
 272    if (c == '\0') {
 273       cp = NULL;
 274       goto jleave;
 275    }
 276
 277    /* Parse a full name: TODO RFC 5322
 278     * - Keep everything in quotes, liberal handle *quoted-pair*s therein
 279     * - Skip entire (nested) comments
 280     * - In non-quote, non-comment, join adjacent space to a single SP
 281     * - Understand separators only in non-quote, non-comment context,
 282     *   and only if not part of a *quoted-pair* (XXX too liberal) */
 283    cp = ap;
 284    for (inquote = lc = lastsp = 0;; lc = c, ++cp) {
 285       c = *cp;
 286       if (c == '\0')
 287          break;
 288       if (c == '\\')
 289          goto jwpwc;
 290       if (c == '"') {
 291          if (lc != '\\')
 292             inquote = !inquote;
 293 #if 0 /* TODO when doing real RFC 5322 parsers - why have i done this? */
 294          else
 295             --wp;
 296 #endif
 297          goto jwpwc;
 298       }
 299       if (inquote || lc == '\\') {
 300 jwpwc:
 301          *wp++ = c;
 302          lastsp = 0;
 303          continue;
 304       }
 305       if (c == '(') {
 306          ap = cp;
 307          cp = skip_comment(cp + 1);
 308          if (keepcomms)
 309             while (ap < cp)
 310                *wp++ = *ap++;
 311          --cp;
 312          lastsp = 0;
 313          continue;
 314       }
 315       if (strchr(separators, c) != NULL)
 316          break;
 317
 318       lc = lastsp;
 319       lastsp = blankchar(c);
 320       if (!lastsp || !lc)
 321          *wp++ = c;
 322    }
 323    if (blankchar(lc))
 324       --wp;
 325
 326    *wp = '\0';
 327 jleave:
 328    NYD_LEAVE;
 329    return cp;
 330 }
 331
 332 static struct name *
 333 _extract1(char const *line, enum gfield ntype, char const *separators,
 334    bool_t keepcomms)
 335 {
 336    struct name *topp, *np, *t;
 337    char const *cp;
 338    char *nbuf;
 339    NYD_ENTER;
 340
 341    topp = NULL;
 342    if (line == NULL || *line == '\0')
 343       goto jleave;
 344
 345    np = NULL;
 346    cp = line;
 347    nbuf = smalloc(strlen(line) +1);
 348    while ((cp = yankname(cp, nbuf, separators, keepcomms)) != NULL) {
 349       t = nalloc(nbuf, ntype);
 350       if (topp == NULL)
 351          topp = t;
 352       else
 353          np->n_flink = t;
 354       t->n_blink = np;
 355       np = t;
 356    }
 357    free(nbuf);
 358 jleave:
 359    NYD_LEAVE;
 360    return topp;
 361 }
 362
 363 static struct name *
 364 _gexpand(size_t level, struct name *nlist, struct group *gp, bool_t metoo,
 365    int ntype)
 366 {
 367    char const *logname;
 368    struct grp_names_head *gnhp;
 369    struct grp_names *gnp;
 370    NYD_ENTER;
 371
 372    if (UICMP(z, level++, >, MAXEXP)) {
 373       n_err(_("Expanding alias to depth larger than %d\n"), MAXEXP);
 374       goto jleave;
 375    }
 376
 377    GP_TO_SUBCLASS(gnhp, gp);
 378    logname = ok_vlook(LOGNAME);
 379    for (gnp = gnhp->gnh_head; gnp != NULL; gnp = gnp->gn_next) {
 380       char *cp;
 381       struct group *ngp;
 382
 383       /* FIXME we do not really support leading backslash quoting do we??? */
 384       if (*(cp = gnp->gn_id) == '\\' || !strcmp(cp, gp->g_id))
 385          goto jquote;
 386
 387       if ((ngp = _group_find(GT_ALIAS, cp)) != NULL) {
 388          /* For S-nail(1), the "alias" may *be* the sender in that a name maps
 389           * to a full address specification; aliases cannot be empty */
 390          struct grp_names_head *ngnhp;
 391          GP_TO_SUBCLASS(ngnhp, ngp);
 392
 393          assert(ngnhp->gnh_head != NULL);
 394          if (metoo || ngnhp->gnh_head->gn_next != NULL ||
 395                !_same_name(cp, logname))
 396             nlist = _gexpand(level, nlist, ngp, metoo, ntype);
 397          continue;
 398       }
 399
 400       /* Here we should allow to expand to itself if only person in alias */
 401 jquote:
 402       if (metoo || gnhp->gnh_head->gn_next == NULL || !_same_name(cp, logname))
 403          nlist = put(nlist, nalloc(cp, ntype | GFULL));
 404    }
 405 jleave:
 406    NYD_LEAVE;
 407    return nlist;
 408 }
 409
 410 static struct group *
 411 _group_lookup(enum group_type gt, struct group_lookup *glp, char const *id)
 412 {
 413    struct group *lgp, *gp;
 414    NYD_ENTER;
 415
 416    gt &= GT_MASK;
 417    lgp = NULL;
 418    gp = *(glp->gl_htable = glp->gl_slot =
 419           ((gt & GT_ALIAS ? _alias_heads :
 420             (gt & GT_MLIST ? _mlist_heads :
 421             (/*gt & GT_SHORTCUT ?*/ _shortcut_heads /*: NULL */))) +
 422            torek_hash(id) % HSHSIZE));
 423
 424    for (; gp != NULL; lgp = gp, gp = gp->g_next)
 425       if ((gp->g_type & gt) && *gp->g_id == *id && !strcmp(gp->g_id, id))
 426          break;
 427
 428    glp->gl_slot_last = lgp;
 429    glp->gl_group = gp;
 430    NYD_LEAVE;
 431    return gp;
 432 }
 433
 434 static struct group *
 435 _group_find(enum group_type gt, char const *id)
 436 {
 437    struct group_lookup gl;
 438    struct group *gp;
 439    NYD_ENTER;
 440
 441    gp = _group_lookup(gt, &gl, id);
 442    NYD_LEAVE;
 443    return gp;
 444 }
 445
 446 static struct group *
 447 _group_go_first(enum group_type gt, struct group_lookup *glp)
 448 {
 449    struct group **gpa, *gp;
 450    size_t i;
 451    NYD_ENTER;
 452
 453    for (glp->gl_htable = gpa = (gt & GT_ALIAS ? _alias_heads :
 454             (gt & GT_MLIST ? _mlist_heads :
 455             (/*gt & GT_SHORTCUT ?*/ _shortcut_heads /*: NULL */))), i = 0;
 456          i < HSHSIZE; ++gpa, ++i)
 457       if ((gp = *gpa) != NULL) {
 458          glp->gl_slot = gpa;
 459          glp->gl_group = gp;
 460          goto jleave;
 461       }
 462
 463    glp->gl_group = gp = NULL;
 464 jleave:
 465    glp->gl_slot_last = NULL;
 466    NYD_LEAVE;
 467    return gp;
 468 }
 469
 470 static struct group *
 471 _group_go_next(struct group_lookup *glp)
 472 {
 473    struct group *gp, **gpa;
 474    NYD_ENTER;
 475
 476    if ((gp = glp->gl_group->g_next) != NULL)
 477       glp->gl_slot_last = glp->gl_group;
 478    else {
 479       glp->gl_slot_last = NULL;
 480       for (gpa = glp->gl_htable + HSHSIZE; ++glp->gl_slot < gpa;)
 481          if ((gp = *glp->gl_slot) != NULL)
 482             break;
 483    }
 484    glp->gl_group = gp;
 485    NYD_LEAVE;
 486    return gp;
 487 }
 488
 489 static struct group *
 490 _group_fetch(enum group_type gt, char const *id, size_t addsz)
 491 {
 492    struct group_lookup gl;
 493    struct group *gp;
 494    size_t l, i;
 495    NYD_ENTER;
 496
 497    if ((gp = _group_lookup(gt, &gl, id)) != NULL)
 498       goto jleave;
 499
 500    l = strlen(id) +1;
 501    i = n_ALIGN(n_VSTRUCT_SIZEOF(struct group, g_id) + l);
 502    switch (gt & GT_MASK) {
 503    case GT_ALIAS:
 504       addsz = sizeof(struct grp_names_head);
 505       break;
 506    case GT_MLIST:
 507 #ifdef HAVE_REGEX
 508       if (n_is_maybe_regex(id)) {
 509          addsz = sizeof(struct grp_regex);
 510          gt |= GT_REGEX;
 511       }
 512 #endif
 513    case GT_SHORTCUT:
 514    default:
 515       break;
 516    }
 517
 518    gp = smalloc(i + addsz);
 519    gp->g_subclass_off = i;
 520    gp->g_type = gt;
 521    memcpy(gp->g_id, id, l);
 522
 523    if (gt & GT_ALIAS) {
 524       struct grp_names_head *gnhp;
 525
 526       GP_TO_SUBCLASS(gnhp, gp);
 527       gnhp->gnh_head = NULL;
 528    }
 529 #ifdef HAVE_REGEX
 530    else if (/*(gt & GT_MLIST) &&*/ gt & GT_REGEX) {
 531       int s;
 532       struct grp_regex *grp;
 533       GP_TO_SUBCLASS(grp, gp);
 534
 535       if((s = regcomp(&grp->gr_regex, id,
 536             REG_EXTENDED | REG_ICASE | REG_NOSUB)) != 0){
 537          n_err(_("Invalid regular expression: %s: %s\n"),
 538             n_shexp_quote_cp(id, FAL0), n_regex_err_to_str(&grp->gr_regex, s));
 539          free(gp);
 540          gp = NULL;
 541          goto jleave;
 542       }
 543       grp->gr_mygroup = gp;
 544       _mlmux_linkin(gp);
 545    }
 546 #endif
 547
 548    gp->g_next = *gl.gl_slot;
 549    *gl.gl_slot = gp;
 550 jleave:
 551    NYD_LEAVE;
 552    return gp;
 553 }
 554
 555 static bool_t
 556 _group_del(enum group_type gt, char const *id)
 557 {
 558    enum group_type xgt = gt & GT_MASK;
 559    struct group_lookup gl;
 560    struct group *gp;
 561    NYD_ENTER;
 562
 563    /* Delete 'em all? */
 564    if (id[0] == '*' && id[1] == '\0') {
 565       for (gp = _group_go_first(gt, &gl); gp != NULL;)
 566          gp = (gp->g_type & xgt) ? __group_del(&gl) : _group_go_next(&gl);
 567       gp = (struct group*)TRU1;
 568    } else if ((gp = _group_lookup(gt, &gl, id)) != NULL) {
 569       if (gp->g_type & xgt)
 570          __group_del(&gl);
 571       else
 572          gp = NULL;
 573    }
 574    NYD_LEAVE;
 575    return (gp != NULL);
 576 }
 577
 578 static struct group *
 579 __group_del(struct group_lookup *glp)
 580 {
 581    struct group *x, *gp;
 582    NYD_ENTER;
 583
 584    /* Overly complicated: link off this node, step ahead to next.. */
 585    x = glp->gl_group;
 586    if ((gp = glp->gl_slot_last) != NULL) {
 587       gp = (gp->g_next = x->g_next);
 588    } else {
 589       glp->gl_slot_last = NULL;
 590       gp = (*glp->gl_slot = x->g_next);
 591
 592       if (gp == NULL) {
 593          struct group **gpa = glp->gl_htable + HSHSIZE;
 594
 595          while (++glp->gl_slot < gpa)
 596             if ((gp = *glp->gl_slot) != NULL)
 597                break;
 598       }
 599    }
 600    glp->gl_group = gp;
 601
 602    if (x->g_type & GT_ALIAS)
 603       __names_del(x);
 604 #ifdef HAVE_REGEX
 605    else if (/*(x->g_type & GT_MLIST) &&*/ x->g_type & GT_REGEX) {
 606       struct grp_regex *grp;
 607       GP_TO_SUBCLASS(grp, x);
 608
 609       regfree(&grp->gr_regex);
 610       _mlmux_linkout(x);
 611    }
 612 #endif
 613
 614    free(x);
 615    NYD_LEAVE;
 616    return gp;
 617 }
 618
 619 static void
 620 __names_del(struct group *gp)
 621 {
 622    struct grp_names_head *gnhp;
 623    struct grp_names *gnp;
 624    NYD_ENTER;
 625
 626    GP_TO_SUBCLASS(gnhp, gp);
 627    for (gnp = gnhp->gnh_head; gnp != NULL;) {
 628       struct grp_names *x = gnp;
 629       gnp = gnp->gn_next;
 630       free(x);
 631    }
 632    NYD_LEAVE;
 633 }
 634
 635 static void
 636 _group_print_all(enum group_type gt)
 637 {
 638    enum group_type xgt;
 639    struct group **gpa;
 640    struct group const *gp;
 641    ui32_t h, i;
 642    char const **ida;
 643    FILE *fp;
 644    size_t lines;
 645    NYD_ENTER;
 646
 647    xgt = gt & GT_PRINT_MASK;
 648    gpa = (xgt & GT_ALIAS ? _alias_heads
 649          : (xgt & GT_MLIST ? _mlist_heads
 650          : (/*xgt & GT_SHORTCUT ?*/ _shortcut_heads
 651          /*: NULL */)));
 652
 653    for (h = 0, i = 1; h < HSHSIZE; ++h)
 654       for (gp = gpa[h]; gp != NULL; gp = gp->g_next)
 655          if ((gp->g_type & xgt) == xgt)
 656             ++i;
 657    ida = salloc(i * sizeof *ida);
 658
 659    for (i = h = 0; h < HSHSIZE; ++h)
 660       for (gp = gpa[h]; gp != NULL; gp = gp->g_next)
 661          if ((gp->g_type & xgt) == xgt)
 662             ida[i++] = gp->g_id;
 663    ida[i] = NULL;
 664
 665    if (i > 1)
 666       qsort(ida, i, sizeof *ida, &__group_print_qsorter);
 667
 668    if ((fp = Ftmp(NULL, "prgroup", OF_RDWR | OF_UNLINK | OF_REGISTER)) == NULL)
 669       fp = n_stdout;
 670    lines = 0;
 671
 672    for (i = 0; ida[i] != NULL; ++i)
 673       lines += _group_print(_group_find(gt, ida[i]), fp);
 674 #ifdef HAVE_REGEX
 675    if (gt & GT_MLIST) {
 676       if (gt & GT_SUBSCRIBE)
 677          i = (ui32_t)_mlsub_size, h = (ui32_t)_mlsub_hits;
 678       else
 679          i = (ui32_t)_mlist_size, h = (ui32_t)_mlist_hits;
 680       if (i > 0 && (n_poption & n_PO_D_V)){
 681          fprintf(fp, _("# %s list regex(7) total: %u entries, %u hits\n"),
 682             (gt & GT_SUBSCRIBE ? _("Subscribed") : _("Non-subscribed")),
 683             i, h);
 684          ++lines;
 685       }
 686    }
 687 #endif
 688
 689    if (fp != n_stdout) {
 690       page_or_print(fp, lines);
 691       Fclose(fp);
 692    }
 693    NYD_LEAVE;
 694 }
 695
 696 static int
 697 __group_print_qsorter(void const *a, void const *b)
 698 {
 699    int rv;
 700    NYD_ENTER;
 701
 702    rv = strcmp(*(char**)n_UNCONST(a), *(char**)n_UNCONST(b));
 703    NYD_LEAVE;
 704    return rv;
 705 }
 706
 707 static size_t
 708 _group_print(struct group const *gp, FILE *fo)
 709 {
 710    char const *cp;
 711    size_t rv;
 712    NYD_ENTER;
 713
 714    rv = 1;
 715
 716    if (gp->g_type & GT_ALIAS) {
 717       struct grp_names_head *gnhp;
 718       struct grp_names *gnp;
 719
 720       fprintf(fo, "alias %s ", gp->g_id);
 721
 722       GP_TO_SUBCLASS(gnhp, gp);
 723       if ((gnp = gnhp->gnh_head) != NULL) { /* xxx always 1+ entries */
 724          do {
 725             struct grp_names *x = gnp;
 726             gnp = gnp->gn_next;
 727             fprintf(fo, " \"%s\"", string_quote(x->gn_id)); /* TODO shexp */
 728          } while (gnp != NULL);
 729       }
 730       putc('\n', fo);
 731    } else if (gp->g_type & GT_MLIST) {
 732 #ifdef HAVE_REGEX
 733       if ((gp->g_type & GT_REGEX) && (n_poption & n_PO_D_V)){
 734          size_t i;
 735          struct grp_regex *grp,
 736             *lp = (gp->g_type & GT_SUBSCRIBE ? _mlsub_regex : _mlist_regex);
 737
 738          GP_TO_SUBCLASS(grp, gp);
 739          for (i = 1; lp != grp; lp = lp->gr_next)
 740             ++i;
 741          fprintf(fo, "# regex(7): hits %" PRIuZ ", sort %" PRIuZ ".\n  ",
 742             grp->gr_hits, i);
 743          ++rv;
 744       }
 745 #endif
 746
 747       fprintf(fo, "wysh %s %s\n",
 748          (gp->g_type & GT_SUBSCRIBE ? "mlsubscribe" : "mlist"),
 749          n_shexp_quote_cp(gp->g_id, TRU1));
 750    } else if (gp->g_type & GT_SHORTCUT) {
 751       GP_TO_SUBCLASS(cp, gp);
 752       fprintf(fo, "wysh shortcut %s %s\n",
 753       gp->g_id, n_shexp_quote_cp(cp, TRU1));
 754    }
 755
 756    NYD_LEAVE;
 757    return rv;
 758 }
 759
 760 static int
 761 _mlmux(enum group_type gt, char **argv)
 762 {
 763    struct group *gp;
 764    int rv = 0;
 765    NYD_ENTER;
 766
 767    if (*argv == NULL)
 768       _group_print_all(gt);
 769    else do {
 770       if ((gp = _group_find(gt, *argv)) != NULL) {
 771          if (gt & GT_SUBSCRIBE) {
 772             if (!(gp->g_type & GT_SUBSCRIBE)) {
 773                _MLMUX_LINKOUT(gp);
 774                gp->g_type |= GT_SUBSCRIBE;
 775                _MLMUX_LINKIN(gp);
 776             } else {
 777                n_err(_("Mailing-list already `mlsubscribe'd: %s\n"),
 778                   *argv);
 779                rv = 1;
 780             }
 781          } else {
 782             n_err(_("Mailing-list already `mlist'ed: %s\n"), *argv);
 783             rv = 1;
 784          }
 785       } else
 786          _group_fetch(gt, *argv, 0);
 787    } while (*++argv != NULL);
 788
 789    NYD_LEAVE;
 790    return rv;
 791 }
 792
 793 static int
 794 _unmlmux(enum group_type gt, char **argv)
 795 {
 796    struct group *gp;
 797    int rv = 0;
 798    NYD_ENTER;
 799
 800    for (; *argv != NULL; ++argv) {
 801       if (gt & GT_SUBSCRIBE) {
 802          struct group_lookup gl;
 803          bool_t isaster;
 804
 805          if (!(isaster = (**argv == '*')))
 806             gp = _group_find(gt, *argv);
 807          else if ((gp = _group_go_first(gt, &gl)) == NULL)
 808             continue;
 809          else if (gp != NULL && !(gp->g_type & GT_SUBSCRIBE))
 810             goto jaster_entry;
 811
 812          if (gp != NULL) {
 813 jaster_redo:
 814             if (gp->g_type & GT_SUBSCRIBE) {
 815                _MLMUX_LINKOUT(gp);
 816                gp->g_type &= ~GT_SUBSCRIBE;
 817                _MLMUX_LINKIN(gp);
 818                if (isaster) {
 819 jaster_entry:
 820                   while ((gp = _group_go_next(&gl)) != NULL &&
 821                         !(gp->g_type & GT_SUBSCRIBE))
 822                      ;
 823                   if (gp != NULL)
 824                      goto jaster_redo;
 825                }
 826             } else {
 827                n_err(_("Mailing-list not `mlsubscribe'd: %s\n"),
 828                   n_shexp_quote_cp(*argv, FAL0));
 829                rv = 1;
 830             }
 831             continue;
 832          }
 833       } else if (_group_del(gt, *argv))
 834          continue;
 835       n_err(_("No such mailing-list: %s\n"), n_shexp_quote_cp(*argv, FAL0));
 836       rv = 1;
 837    }
 838    NYD_LEAVE;
 839    return rv;
 840 }
 841
 842 #ifdef HAVE_REGEX
 843 static void
 844 _mlmux_linkin(struct group *gp)
 845 {
 846    struct grp_regex **lpp, *grp, *lhp;
 847    NYD_ENTER;
 848
 849    if (gp->g_type & GT_SUBSCRIBE) {
 850       lpp = &_mlsub_regex;
 851       ++_mlsub_size;
 852    } else {
 853       lpp = &_mlist_regex;
 854       ++_mlist_size;
 855    }
 856
 857    GP_TO_SUBCLASS(grp, gp);
 858    if ((lhp = *lpp) != NULL) {
 859       (grp->gr_last = lhp->gr_last)->gr_next = grp;
 860       (grp->gr_next = lhp)->gr_last = grp;
 861    } else
 862       *lpp = grp->gr_last = grp->gr_next = grp;
 863    grp->gr_hits = 0;
 864    NYD_LEAVE;
 865 }
 866
 867 static void
 868 _mlmux_linkout(struct group *gp)
 869 {
 870    struct grp_regex *grp, **lpp;
 871    NYD_ENTER;
 872
 873    GP_TO_SUBCLASS(grp, gp);
 874
 875    if (gp->g_type & GT_SUBSCRIBE) {
 876       lpp = &_mlsub_regex;
 877       --_mlsub_size;
 878       _mlsub_hits -= grp->gr_hits;
 879    } else {
 880       lpp = &_mlist_regex;
 881       --_mlist_size;
 882       _mlist_hits -= grp->gr_hits;
 883    }
 884
 885    if (grp->gr_next == grp)
 886       *lpp = NULL;
 887    else {
 888       (grp->gr_last->gr_next = grp->gr_next)->gr_last = grp->gr_last;
 889       if (*lpp == grp)
 890          *lpp = grp->gr_next;
 891    }
 892    NYD_LEAVE;
 893 }
 894 #endif /* HAVE_REGEX */
 895
 896 FL struct name *
 897 nalloc(char const *str, enum gfield ntype)
 898 {
 899    struct n_addrguts ag;
 900    struct str in, out;
 901    struct name *np;
 902    NYD_ENTER;
 903    assert(!(ntype & GFULLEXTRA) || (ntype & GFULL) != 0);
 904
 905    str = n_addrspec_with_guts(&ag, str,
 906          ((ntype & (GFULL | GSKIN | GREF)) != 0));
 907    if(str == NULL){
 908       /*
 909       np = NULL; TODO We cannot return NULL,
 910       goto jleave; TODO thus handle failures in here!
 911       */
 912       str = ag.ag_input;
 913    }
 914
 915    if (!(ag.ag_n_flags & NAME_NAME_SALLOC)) {
 916       ag.ag_n_flags |= NAME_NAME_SALLOC;
 917       np = salloc(sizeof(*np) + ag.ag_slen +1);
 918       memcpy(np + 1, ag.ag_skinned, ag.ag_slen +1);
 919       ag.ag_skinned = (char*)(np + 1);
 920    } else
 921       np = salloc(sizeof *np);
 922
 923    np->n_flink = NULL;
 924    np->n_blink = NULL;
 925    np->n_type = ntype;
 926    np->n_flags = 0;
 927
 928    np->n_fullname = np->n_name = ag.ag_skinned;
 929    np->n_fullextra = NULL;
 930    np->n_flags = ag.ag_n_flags;
 931
 932    if (ntype & GFULL) {
 933       if (ag.ag_ilen == ag.ag_slen
 934 #ifdef HAVE_IDNA
 935             && !(ag.ag_n_flags & NAME_IDNA)
 936 #endif
 937       )
 938          goto jleave;
 939       if (ag.ag_n_flags & NAME_ADDRSPEC_ISFILEORPIPE)
 940          goto jleave;
 941
 942       /* n_fullextra is only the complete name part without address.
 943        * Beware of "-r '<abc@def>'", don't treat that as FULLEXTRA */
 944       if ((ntype & GFULLEXTRA) && ag.ag_ilen > ag.ag_slen + 2) {
 945          size_t s = ag.ag_iaddr_start, e = ag.ag_iaddr_aend, i;
 946          char const *cp;
 947
 948          if (s == 0 || str[--s] != '<' || str[e++] != '>')
 949             goto jskipfullextra;
 950          i = ag.ag_ilen - e;
 951          in.s = n_lofi_alloc(s + 1 + i +1);
 952          while(s > 0 && blankchar(str[s - 1]))
 953             --s;
 954          memcpy(in.s, str, s);
 955          if (i > 0) {
 956             in.s[s++] = ' ';
 957             while (blankchar(str[e])) {
 958                ++e;
 959                if (--i == 0)
 960                   break;
 961             }
 962             if (i > 0)
 963                memcpy(&in.s[s], &str[e], i);
 964          }
 965          s += i;
 966          in.s[in.l = s] = '\0';
 967          mime_fromhdr(&in, &out, TD_ISPR | TD_ICONV);
 968
 969          for (cp = out.s, i = out.l; i > 0 && spacechar(*cp); --i, ++cp)
 970             ;
 971          while (i > 0 && spacechar(cp[i - 1]))
 972             --i;
 973          np->n_fullextra = savestrbuf(cp, i);
 974
 975          n_lofi_free(in.s);
 976          free(out.s);
 977       }
 978 jskipfullextra:
 979
 980       /* n_fullname depends on IDNA conversion */
 981 #ifdef HAVE_IDNA
 982       if (!(ag.ag_n_flags & NAME_IDNA)) {
 983 #endif
 984          in.s = n_UNCONST(str);
 985          in.l = ag.ag_ilen;
 986 #ifdef HAVE_IDNA
 987       } else {
 988          /* The domain name was IDNA and has been converted.  We also have to
 989           * ensure that the domain name in .n_fullname is replaced with the
 990           * converted version, since MIME doesn't perform encoding of addrs */
 991          /* TODO This definetely doesn't belong here! */
 992          size_t l = ag.ag_iaddr_start,
 993             lsuff = ag.ag_ilen - ag.ag_iaddr_aend;
 994          in.s = ac_alloc(l + ag.ag_slen + lsuff +1);
 995          memcpy(in.s, str, l);
 996          memcpy(in.s + l, ag.ag_skinned, ag.ag_slen);
 997          l += ag.ag_slen;
 998          memcpy(in.s + l, str + ag.ag_iaddr_aend, lsuff);
 999          l += lsuff;
1000          in.s[l] = '\0';
1001          in.l = l;
1002       }
1003 #endif
1004       mime_fromhdr(&in, &out, TD_ISPR | TD_ICONV);
1005       np->n_fullname = savestr(out.s);
1006       free(out.s);
1007 #ifdef HAVE_IDNA
1008       if (ag.ag_n_flags & NAME_IDNA)
1009          ac_free(in.s);
1010 #endif
1011       np->n_flags |= NAME_FULLNAME_SALLOC;
1012    }
1013 jleave:
1014    NYD_LEAVE;
1015    return np;
1016 }
1017
1018 FL struct name *
1019 ndup(struct name *np, enum gfield ntype)
1020 {
1021    struct name *nnp;
1022    NYD_ENTER;
1023
1024    if ((ntype & (GFULL | GSKIN)) && !(np->n_flags & NAME_SKINNED)) {
1025       nnp = nalloc(np->n_name, ntype);
1026       goto jleave;
1027    }
1028
1029    nnp = salloc(sizeof *np);
1030    nnp->n_flink = nnp->n_blink = NULL;
1031    nnp->n_type = ntype;
1032    nnp->n_flags = (np->n_flags & ~(NAME_NAME_SALLOC | NAME_FULLNAME_SALLOC)) |
1033          NAME_NAME_SALLOC;
1034    nnp->n_name = savestr(np->n_name);
1035    if (np->n_name == np->n_fullname || !(ntype & (GFULL | GSKIN))) {
1036       nnp->n_fullname = nnp->n_name;
1037       nnp->n_fullextra = NULL;
1038    } else {
1039       nnp->n_flags |= NAME_FULLNAME_SALLOC;
1040       nnp->n_fullname = savestr(np->n_fullname);
1041       nnp->n_fullextra = (np->n_fullextra == NULL) ? NULL
1042             : savestr(np->n_fullextra);
1043    }
1044 jleave:
1045    NYD_LEAVE;
1046    return nnp;
1047 }
1048
1049 FL struct name *
1050 cat(struct name *n1, struct name *n2)
1051 {
1052    struct name *tail;
1053    NYD_ENTER;
1054
1055    tail = n2;
1056    if (n1 == NULL)
1057       goto jleave;
1058    tail = n1;
1059    if (n2 == NULL)
1060       goto jleave;
1061
1062    while (tail->n_flink != NULL)
1063       tail = tail->n_flink;
1064    tail->n_flink = n2;
1065    n2->n_blink = tail;
1066    tail = n1;
1067 jleave:
1068    NYD_LEAVE;
1069    return tail;
1070 }
1071
1072 FL struct name *
1073 namelist_dup(struct name const *np, enum gfield ntype)
1074 {
1075    struct name *nnp;
1076    NYD_ENTER;
1077
1078    for (nnp = NULL; np != NULL; np = np->n_flink) {
1079       struct name *x = ndup(n_UNCONST(np), (np->n_type & ~GMASK) | ntype);
1080       x->n_flink = nnp;
1081       nnp = x;
1082    }
1083    NYD_LEAVE;
1084    return nnp;
1085 }
1086
1087 FL ui32_t
1088 count(struct name const *np)
1089 {
1090    ui32_t c;
1091    NYD_ENTER;
1092
1093    for (c = 0; np != NULL; np = np->n_flink)
1094       if (!(np->n_type & GDEL))
1095          ++c;
1096    NYD_LEAVE;
1097    return c;
1098 }
1099
1100 FL ui32_t
1101 count_nonlocal(struct name const *np)
1102 {
1103    ui32_t c;
1104    NYD_ENTER;
1105
1106    for (c = 0; np != NULL; np = np->n_flink)
1107       if (!(np->n_type & GDEL) && !(np->n_flags & NAME_ADDRSPEC_ISFILEORPIPE))
1108          ++c;
1109    NYD_LEAVE;
1110    return c;
1111 }
1112
1113 FL struct name *
1114 extract(char const *line, enum gfield ntype)
1115 {
1116    struct name *rv;
1117    NYD_ENTER;
1118
1119    rv = _extract1(line, ntype, " \t,", 0);
1120    NYD_LEAVE;
1121    return rv;
1122 }
1123
1124 FL struct name *
1125 lextract(char const *line, enum gfield ntype)
1126 {
1127    struct name *rv;
1128    NYD_ENTER;
1129
1130    rv = ((line != NULL && strpbrk(line, ",\"\\(<|"))
1131          ? _extract1(line, ntype, ",", 1) : extract(line, ntype));
1132    NYD_LEAVE;
1133    return rv;
1134 }
1135
1136 FL char *
1137 detract(struct name *np, enum gfield ntype)
1138 {
1139    char *topp, *cp;
1140    struct name *p;
1141    int flags, s;
1142    NYD_ENTER;
1143
1144    topp = NULL;
1145    if (np == NULL)
1146       goto jleave;
1147
1148    flags = ntype & (GCOMMA | GNAMEONLY);
1149    ntype &= ~(GCOMMA | GNAMEONLY);
1150    s = 0;
1151
1152    for (p = np; p != NULL; p = p->n_flink) {
1153       if (ntype && (p->n_type & GMASK) != ntype)
1154          continue;
1155       s += strlen(flags & GNAMEONLY ? p->n_name : p->n_fullname) +1;
1156       if (flags & GCOMMA)
1157          ++s;
1158    }
1159    if (s == 0)
1160       goto jleave;
1161
1162    s += 2;
1163    topp = salloc(s);
1164    cp = topp;
1165    for (p = np; p != NULL; p = p->n_flink) {
1166       if (ntype && (p->n_type & GMASK) != ntype)
1167          continue;
1168       cp = sstpcpy(cp, (flags & GNAMEONLY ? p->n_name : p->n_fullname));
1169       if ((flags & GCOMMA) && p->n_flink != NULL)
1170          *cp++ = ',';
1171       *cp++ = ' ';
1172    }
1173    *--cp = 0;
1174    if ((flags & GCOMMA) && *--cp == ',')
1175       *cp = 0;
1176 jleave:
1177    NYD_LEAVE;
1178    return topp;
1179 }
1180
1181 FL struct name *
1182 grab_names(enum n_lexinput_flags lif, char const *field, struct name *np,
1183       int comma, enum gfield gflags)
1184 {
1185    struct name *nq;
1186    NYD_ENTER;
1187
1188 jloop:
1189    np = lextract(n_lex_input_cp(lif, field, detract(np, comma)), gflags);
1190    for (nq = np; nq != NULL; nq = nq->n_flink)
1191       if (is_addr_invalid(nq, EACM_NONE))
1192          goto jloop;
1193    NYD_LEAVE;
1194    return np;
1195 }
1196
1197 FL bool_t
1198 name_is_same_domain(struct name const *n1, struct name const *n2)
1199 {
1200    char const *d1, *d2;
1201    bool_t rv;
1202    NYD_ENTER;
1203
1204    d1 = strrchr(n1->n_name, '@');
1205    d2 = strrchr(n2->n_name, '@');
1206
1207    rv = (d1 != NULL && d2 != NULL) ? !asccasecmp(++d1, ++d2) : FAL0;
1208
1209    NYD_LEAVE;
1210    return rv;
1211 }
1212
1213 FL struct name *
1214 checkaddrs(struct name *np, enum expand_addr_check_mode eacm,
1215    si8_t *set_on_error)
1216 {
1217    struct name *n;
1218    NYD_ENTER;
1219
1220    for (n = np; n != NULL; n = n->n_flink) {
1221       si8_t rv;
1222
1223       if ((rv = is_addr_invalid(n, eacm)) != 0) {
1224          if (set_on_error != NULL)
1225             *set_on_error |= rv; /* don't loose -1! */
1226          else if (eacm & EAF_MAYKEEP) /* TODO HACK!  See definition! */
1227             continue;
1228          if (n->n_blink)
1229             n->n_blink->n_flink = n->n_flink;
1230          if (n->n_flink)
1231             n->n_flink->n_blink = n->n_blink;
1232          if (n == np)
1233             np = n->n_flink;
1234       }
1235    }
1236    NYD_LEAVE;
1237    return np;
1238 }
1239
1240 FL struct name *
1241 namelist_vaporise_head(struct header *hp, enum expand_addr_check_mode eacm,
1242    bool_t metoo, si8_t *set_on_error)
1243 {
1244    struct name *tolist, *np, **npp;
1245    NYD_ENTER;
1246
1247    tolist = usermap(cat(hp->h_to, cat(hp->h_cc, hp->h_bcc)), metoo);
1248    hp->h_to = hp->h_cc = hp->h_bcc = NULL;
1249
1250    tolist = elide(checkaddrs(tolist, eacm, set_on_error));
1251
1252    for (np = tolist; np != NULL; np = np->n_flink) {
1253       switch (np->n_type & (GDEL | GMASK)) {
1254       case GTO:   npp = &hp->h_to; break;
1255       case GCC:   npp = &hp->h_cc; break;
1256       case GBCC:  npp = &hp->h_bcc; break;
1257       default:    continue;
1258       }
1259       *npp = cat(*npp, ndup(np, np->n_type | GFULL));
1260    }
1261    NYD_LEAVE;
1262    return tolist;
1263 }
1264
1265 FL struct name *
1266 usermap(struct name *names, bool_t force_metoo)
1267 {
1268    struct name *new, *np, *cp;
1269    struct group *gp;
1270    int metoo;
1271    NYD_ENTER;
1272
1273    new = NULL;
1274    np = names;
1275    metoo = (force_metoo || ok_blook(metoo));
1276    while (np != NULL) {
1277       assert(!(np->n_type & GDEL)); /* TODO legacy */
1278       if (is_fileorpipe_addr(np) || np->n_name[0] == '\\') {
1279          cp = np->n_flink;
1280          new = put(new, np);
1281          np = cp;
1282          continue;
1283       }
1284       gp = _group_find(GT_ALIAS, np->n_name);
1285       cp = np->n_flink;
1286       if (gp != NULL)
1287          new = _gexpand(0, new, gp, metoo, np->n_type);
1288       else
1289          new = put(new, np);
1290       np = cp;
1291    }
1292    NYD_LEAVE;
1293    return new;
1294 }
1295
1296 FL struct name *
1297 elide(struct name *names)
1298 {
1299    struct name *np, *t, *newn, *x;
1300    NYD_ENTER;
1301
1302    newn = NULL;
1303    if (names == NULL)
1304       goto jleave;
1305
1306    /* Throw away all deleted nodes (XXX merge with plain sort below?) */
1307    for (np = NULL; names != NULL; names = names->n_flink)
1308       if  (!(names->n_type & GDEL)) {
1309          names->n_blink = np;
1310          if (np)
1311             np->n_flink = names;
1312          else
1313             newn = names;
1314          np = names;
1315       }
1316    if (newn == NULL)
1317       goto jleave;
1318
1319    np = newn->n_flink;
1320    if (np != NULL)
1321       np->n_blink = NULL;
1322    newn->n_flink = NULL;
1323
1324    while (np != NULL) {
1325       int cmpres;
1326
1327       t = newn;
1328       while ((cmpres = asccasecmp(t->n_name, np->n_name)) < 0) {
1329          if (t->n_flink == NULL)
1330             break;
1331          t = t->n_flink;
1332       }
1333
1334       /* If we ran out of t's, put new entry after the current value of t */
1335       if (cmpres < 0) {
1336          t->n_flink = np;
1337          np->n_blink = t;
1338          t = np;
1339          np = np->n_flink;
1340          t->n_flink = NULL;
1341          continue;
1342       }
1343
1344       /* Otherwise, put the new entry in front of the current t.  If at the
1345        * front of the list, the new guy becomes the new head of the list */
1346       if (t == newn) {
1347          t = np;
1348          np = np->n_flink;
1349          t->n_flink = newn;
1350          newn->n_blink = t;
1351          t->n_blink = NULL;
1352          newn = t;
1353          continue;
1354       }
1355
1356       /* The normal case -- we are inserting into the middle of the list */
1357       x = np;
1358       np = np->n_flink;
1359       x->n_flink = t;
1360       x->n_blink = t->n_blink;
1361       t->n_blink->n_flink = x;
1362       t->n_blink = x;
1363    }
1364
1365    /* Now the list headed up by new is sorted.  Remove duplicates */
1366    np = newn;
1367    while (np != NULL) {
1368       t = np;
1369       while (t->n_flink != NULL && !asccasecmp(np->n_name, t->n_flink->n_name))
1370          t = t->n_flink;
1371       if (t == np) {
1372          np = np->n_flink;
1373          continue;
1374       }
1375
1376       /* Now t points to the last entry with the same name as np.
1377        * Make np point beyond t */
1378       np->n_flink = t->n_flink;
1379       if (t->n_flink != NULL)
1380          t->n_flink->n_blink = np;
1381       np = np->n_flink;
1382    }
1383 jleave:
1384    NYD_LEAVE;
1385    return newn;
1386 }
1387
1388 FL int
1389 c_alternates(void *v){
1390    char **namelist, **ap, **ap2, *cp;
1391    size_t l, sl;
1392    int rv;
1393    NYD_ENTER;
1394
1395    rv = 0;
1396
1397    l = 0;
1398    for(namelist = v; namelist[l] != NULL; ++l)
1399       ;
1400
1401    if(l == 0){
1402       if(a_nag_altnames != NULL){
1403          fprintf(n_stdout, "alternates ");
1404          for(ap = a_nag_altnames; *ap != NULL; ++ap)
1405             fprintf(n_stdout, "%s ", *ap);
1406          putc('\n', n_stdout);
1407       }
1408    }else{
1409       if(a_nag_altnames != NULL){
1410          for(ap = a_nag_altnames; *ap != NULL; ++ap)
1411             free(*ap);
1412          free(a_nag_altnames);
1413       }
1414
1415       ++l;
1416       ap2 =
1417       a_nag_altnames = smalloc(l * sizeof(*a_nag_altnames));
1418
1419       sl = 0;
1420       for(ap = namelist; *ap != NULL; ++ap)
1421          if(*ap != '\0'){
1422             struct name *np;
1423
1424             if((np = lextract(*ap, GSKIN)) == NULL || np->n_flink != NULL ||
1425                   (np = checkaddrs(np, EACM_STRICT, NULL)) == NULL){
1426                n_err(_("Invalid `alternates' argument: %s\n"),
1427                   n_shexp_quote_cp(*ap, FAL0));
1428                rv = 1;
1429                continue;
1430             }
1431             l = strlen(np->n_name) +1;
1432             sl += l;
1433             cp = smalloc(l);
1434             memcpy(cp, np->n_name, l);
1435             *ap2++ = cp;
1436          }
1437       *ap2 = NULL;
1438
1439       /* And put it into *-alternates* */
1440       if(sl > 0){
1441          cp = salloc(sl);
1442          for(sl = 0, ap = a_nag_altnames; *ap != NULL; ++ap)
1443             if((l = strlen(*ap)) > 0){
1444                memcpy(&cp[sl], *ap, l);
1445                cp[sl += l] = ' ';
1446                ++sl;
1447             }
1448          if(sl > 0)
1449             --sl;
1450          cp[sl] = '\0';
1451       }else{
1452          free(a_nag_altnames);
1453          a_nag_altnames = NULL;
1454       }
1455
1456       n_PS_ROOT_BLOCK(sl > 0 ? ok_vset(_alternates, cp)
1457          : ok_vclear(_alternates));
1458    }
1459    NYD_LEAVE;
1460    return rv;
1461 }
1462
1463 FL struct name *
1464 delete_alternates(struct name *np)
1465 {
1466    struct name *xp;
1467    char **ap;
1468    NYD_ENTER;
1469
1470    np = delname(np, ok_vlook(LOGNAME));
1471    if (a_nag_altnames != NULL)
1472       for (ap = a_nag_altnames; *ap != '\0'; ++ap)
1473          np = delname(np, *ap);
1474
1475    if ((xp = lextract(ok_vlook(from), GEXTRA | GSKIN)) != NULL)
1476       while (xp != NULL) {
1477          np = delname(np, xp->n_name);
1478          xp = xp->n_flink;
1479       }
1480
1481    if ((xp = lextract(ok_vlook(replyto), GEXTRA | GSKIN)) != NULL)
1482       while (xp != NULL) {
1483          np = delname(np, xp->n_name);
1484          xp = xp->n_flink;
1485       }
1486
1487    if ((xp = extract(ok_vlook(sender), GEXTRA | GSKIN)) != NULL)
1488       while (xp != NULL) {
1489          np = delname(np, xp->n_name);
1490          xp = xp->n_flink;
1491       }
1492    NYD_LEAVE;
1493    return np;
1494 }
1495
1496 FL int
1497 is_myname(char const *name)
1498 {
1499    int rv = 1;
1500    struct name *xp;
1501    char **ap;
1502    NYD_ENTER;
1503
1504    if (_same_name(ok_vlook(LOGNAME), name))
1505       goto jleave;
1506    if (a_nag_altnames != NULL)
1507       for (ap = a_nag_altnames; *ap != NULL; ++ap)
1508          if (_same_name(*ap, name))
1509             goto jleave;
1510
1511    if ((xp = lextract(ok_vlook(from), GEXTRA | GSKIN)) != NULL)
1512       while (xp != NULL) {
1513          if (_same_name(xp->n_name, name))
1514             goto jleave;
1515          xp = xp->n_flink;
1516       }
1517
1518    if ((xp = lextract(ok_vlook(replyto), GEXTRA | GSKIN)) != NULL)
1519       while (xp != NULL) {
1520          if (_same_name(xp->n_name, name))
1521             goto jleave;
1522          xp = xp->n_flink;
1523       }
1524
1525    if ((xp = extract(ok_vlook(sender), GEXTRA | GSKIN)) != NULL)
1526       while (xp != NULL) {
1527          if (_same_name(xp->n_name, name))
1528             goto jleave;
1529          xp = xp->n_flink;
1530       }
1531    rv = 0;
1532 jleave:
1533    NYD_LEAVE;
1534    return rv;
1535 }
1536
1537 FL int
1538 c_addrcodec(void *v){
1539    struct n_addrguts ag;
1540    struct n_string s_b, *sp;
1541    char const **argv, *emv, *varname, *varres, *cp;
1542    int rv;
1543    NYD_ENTER;
1544
1545    sp = n_string_creat_auto(&s_b);
1546    rv = 0;
1547    emv = n_0;
1548    argv = v;
1549    varname = (n_pstate & n_PS_ARGMOD_VPUT) ? *argv++ : NULL;
1550
1551    for(; *argv != NULL; ++argv){
1552       if(sp->s_len > 0)
1553          sp = n_string_push_c(sp, ' ');
1554       sp = n_string_push_cp(sp, *argv);
1555    }
1556
1557    /* */
1558    /* TODO nalloc() cannot yet fail, thus need to do the work twice!!
1559     * TODO I.e. later on this could be a simple nalloc() wrapper.. */
1560    for(cp = n_string_cp(sp); blankchar(*cp); ++cp)
1561       ;
1562    if(cp != sp->s_dat)
1563       sp = n_string_cut(sp, 0, PTR2SIZE(cp - sp->s_dat));
1564    for(varres = cp = &sp->s_dat[sp->s_len];
1565          cp > sp->s_dat && blankchar(cp[-1]); --cp)
1566       ;
1567    if(cp != varres)
1568       sp = n_string_trunc(sp, sp->s_len - (ui32_t)PTR2SIZE(varres - cp));
1569
1570    /* C99 */{
1571       size_t i;
1572
1573       /* However, the difference for this command is that the user enters what
1574        * she wants to have, and we should make something of it.  Therefore any
1575        * quotes are necessarily to be turned to quoted-pair! */
1576       n_string_cp(sp);
1577       for(i = 0; i < sp->s_len; ++i)
1578          if(sp->s_dat[i] == '"' || sp->s_dat[i] == '\\')
1579             sp = n_string_insert_c(sp, i++, '\\');
1580    }
1581
1582    if(n_addrspec_with_guts(&ag, n_string_cp(sp), TRU1) == NULL){
1583       varres = sp->s_dat;
1584       emv = n_1;
1585    }else{
1586       struct name *np;
1587
1588       np = nalloc(n_string_cp(sp), GTO | GFULL | GSKIN);
1589       varres = np->n_fullname;
1590    }
1591
1592    if(varname == NULL)
1593       fprintf(n_stdout, "%s\n", varres);
1594    else if(!n_var_vset(varname, (uintptr_t)varres)){
1595       emv = n_1;
1596       rv = 1;
1597    }
1598    n__EM_SET(emv);
1599    NYD_LEAVE;
1600    return rv;
1601 }
1602
1603 FL int
1604 c_alias(void *v)
1605 {
1606    char **argv = v;
1607    struct group *gp;
1608    int rv = 0;
1609    NYD_ENTER;
1610
1611    if (*argv == NULL)
1612       _group_print_all(GT_ALIAS);
1613    else if (argv[1] == NULL) {
1614       if ((gp = _group_find(GT_ALIAS, *argv)) != NULL)
1615          _group_print(gp, n_stdout);
1616       else {
1617          n_err(_("No such alias: %s\n"), *argv);
1618          rv = 1;
1619       }
1620    } else {
1621       struct grp_names_head *gnhp;
1622
1623       gp = _group_fetch(GT_ALIAS, *argv, 0);
1624       GP_TO_SUBCLASS(gnhp, gp);
1625
1626       for (++argv; *argv != NULL; ++argv) {
1627          size_t l = strlen(*argv) +1;
1628          struct grp_names *gnp = smalloc(n_VSTRUCT_SIZEOF(struct grp_names,
1629                gn_id) + l);
1630          gnp->gn_next = gnhp->gnh_head;
1631          gnhp->gnh_head = gnp;
1632          memcpy(gnp->gn_id, *argv, l);
1633       }
1634       assert(gnhp->gnh_head != NULL);
1635    }
1636    NYD_LEAVE;
1637    return rv;
1638 }
1639
1640 FL int
1641 c_unalias(void *v)
1642 {
1643    char **argv = v;
1644    int rv = 0;
1645    NYD_ENTER;
1646
1647    do if (!_group_del(GT_ALIAS, *argv)) {
1648       n_err(_("No such alias: %s\n"), *argv);
1649       rv = 1;
1650    } while (*++argv != NULL);
1651    NYD_LEAVE;
1652    return rv;
1653 }
1654
1655 FL int
1656 c_mlist(void *v)
1657 {
1658    int rv;
1659    NYD_ENTER;
1660
1661    rv = _mlmux(GT_MLIST, v);
1662    NYD_LEAVE;
1663    return rv;
1664 }
1665
1666 FL int
1667 c_unmlist(void *v)
1668 {
1669    int rv;
1670    NYD_ENTER;
1671
1672    rv = _unmlmux(GT_MLIST, v);
1673    NYD_LEAVE;
1674    return rv;
1675 }
1676
1677 FL int
1678 c_mlsubscribe(void *v)
1679 {
1680    int rv;
1681    NYD_ENTER;
1682
1683    rv = _mlmux(GT_MLIST | GT_SUBSCRIBE, v);
1684    NYD_LEAVE;
1685    return rv;
1686 }
1687
1688 FL int
1689 c_unmlsubscribe(void *v)
1690 {
1691    int rv;
1692    NYD_ENTER;
1693
1694    rv = _unmlmux(GT_MLIST | GT_SUBSCRIBE, v);
1695    NYD_LEAVE;
1696    return rv;
1697 }
1698
1699 FL enum mlist_state
1700 is_mlist(char const *name, bool_t subscribed_only)
1701 {
1702    struct group *gp;
1703 #ifdef HAVE_REGEX
1704    struct grp_regex **lpp, *grp;
1705    bool_t re2;
1706 #endif
1707    enum mlist_state rv;
1708    NYD_ENTER;
1709
1710    gp = _group_find(GT_MLIST, name);
1711    rv = (gp != NULL) ? MLIST_KNOWN : MLIST_OTHER;
1712    if (rv == MLIST_KNOWN) {
1713       if (gp->g_type & GT_SUBSCRIBE)
1714          rv = MLIST_SUBSCRIBED;
1715       else if (subscribed_only)
1716          rv = MLIST_OTHER;
1717       /* Of course, if that is a regular expression it doesn't mean a thing */
1718 #ifdef HAVE_REGEX
1719       if (gp->g_type & GT_REGEX)
1720          rv = MLIST_OTHER;
1721       else
1722 #endif
1723          goto jleave;
1724    }
1725
1726    /* Not in the hashmap (as something matchable), walk the lists */
1727 #ifdef HAVE_REGEX
1728    re2 = FAL0;
1729    lpp = &_mlsub_regex;
1730 jregex_redo:
1731    if ((grp = *lpp) != NULL) {
1732       do if (regexec(&grp->gr_regex, name, 0,NULL, 0) != REG_NOMATCH) {
1733          /* Relink as the head of this list if the hit count of this group is
1734           * >= 25% of the average hit count */
1735          size_t i;
1736          if (!re2)
1737             i = ++_mlsub_hits / _mlsub_size;
1738          else
1739             i = ++_mlist_hits / _mlist_size;
1740          i >>= 2;
1741
1742          if (++grp->gr_hits >= i && *lpp != grp && grp->gr_next != grp) {
1743             grp->gr_last->gr_next = grp->gr_next;
1744             grp->gr_next->gr_last = grp->gr_last;
1745             (grp->gr_last = (*lpp)->gr_last)->gr_next = grp;
1746             (grp->gr_next = *lpp)->gr_last = grp;
1747             *lpp = grp;
1748          }
1749          rv = !re2 ? MLIST_SUBSCRIBED : MLIST_KNOWN;
1750          goto jleave;
1751       } while ((grp = grp->gr_next) != *lpp);
1752    }
1753    if (!re2 && !subscribed_only) {
1754       re2 = TRU1;
1755       lpp = &_mlist_regex;
1756       goto jregex_redo;
1757    }
1758    assert(rv == MLIST_OTHER);
1759 #endif
1760
1761 jleave:
1762    NYD_LEAVE;
1763    return rv;
1764 }
1765
1766 FL int
1767 c_shortcut(void *v)
1768 {
1769    char **argv = v;
1770    int rv = 0;
1771    NYD_ENTER;
1772
1773    if (*argv == NULL)
1774       _group_print_all(GT_SHORTCUT);
1775    else for (; *argv != NULL; argv += 2) {
1776       /* Because one hardly ever redefines, anything is stored in one chunk */
1777       size_t l;
1778       struct group *gp;
1779       char *cp;
1780
1781       if (argv[1] == NULL) {
1782          n_err(_("Shortcut expansion is missing: %s\n"), *argv);
1783          rv = 1;
1784          break;
1785       }
1786       if (_group_find(GT_SHORTCUT, *argv) != NULL)
1787          _group_del(GT_SHORTCUT, *argv);
1788
1789       l = strlen(argv[1]) +1;
1790       gp = _group_fetch(GT_SHORTCUT, *argv, l);
1791       GP_TO_SUBCLASS(cp, gp);
1792       memcpy(cp, argv[1], l);
1793    }
1794    NYD_LEAVE;
1795    return rv;
1796 }
1797
1798 FL int
1799 c_unshortcut(void *v)
1800 {
1801    char **argv = v;
1802    int rv = 0;
1803    NYD_ENTER;
1804
1805    do if (!_group_del(GT_SHORTCUT, *argv)) {
1806       n_err(_("No such shortcut: %s\n"), *argv);
1807       rv = 1;
1808    } while (*++argv != NULL);
1809    NYD_LEAVE;
1810    return rv;
1811 }
1812
1813 FL char const *
1814 shortcut_expand(char const *str)
1815 {
1816    struct group *gp;
1817    NYD_ENTER;
1818
1819    if ((gp = _group_find(GT_SHORTCUT, str)) != NULL)
1820       GP_TO_SUBCLASS(str, gp);
1821    else
1822       str = NULL;
1823    NYD_LEAVE;
1824    return str;
1825 }
1826
1827 /* s-it-mode */