diplodocus.org Git - nmh/blob - uip/sortm.c

   1
   2 /*
   3  * sortm.c -- sort messages in a folder by date/time
   4  *
   5  * This code is Copyright (c) 2002, by the authors of nmh.  See the
   6  * COPYRIGHT file in the root directory of the nmh distribution for
   7  * complete copyright information.
   8  */
   9
  10 #include <h/mh.h>
  11 #include <h/tws.h>
  12 #include <h/utils.h>
  13
  14 static struct swit switches[] = {
  15 #define DATESW                 0
  16      { "datefield field", 0 },
  17 #define TEXTSW                 1
  18      { "textfield field", 0 },
  19 #define NSUBJSW                2
  20      { "notextfield", 0 },
  21 #define SUBJSW                 3
  22      { "subject", -3 },            /* backward-compatibility */
  23 #define LIMSW                  4
  24      { "limit days", 0 },
  25 #define NLIMSW                 5
  26      { "nolimit", 0 },
  27 #define VERBSW                 6
  28      { "verbose", 0 },
  29 #define NVERBSW                7
  30      { "noverbose", 0 },
  31 #define ALLMSGS                8
  32      { "all", 0 },
  33 #define NALLMSGS               9
  34      { "noall", 0 },
  35 #define CHECKSW               10
  36      { "check", 0 },
  37 #define NCHECKSW              11
  38      { "nocheck", 0 },
  39 #define VERSIONSW             12
  40      { "version", 0 },
  41 #define HELPSW                13
  42      { "help", 0 },
  43      { NULL, 0 }
  44 };
  45
  46 struct smsg {
  47     int s_msg;
  48     time_t s_clock;
  49     char *s_subj;
  50 };
  51
  52 static struct smsg *smsgs;
  53 int nmsgs;
  54
  55 char *subjsort = (char *) 0;    /* sort on subject if != 0 */
  56 time_t datelimit = 0;
  57 int submajor = 0;               /* if true, sort on subject-major */
  58 int verbose;
  59 int allmsgs = 1;
  60 int check_failed = 0;
  61
  62 /* This keeps compiler happy on calls to qsort */
  63 typedef int (*qsort_comp) (const void *, const void *);
  64
  65 /*
  66  * static prototypes
  67  */
  68 static int read_hdrs (struct msgs *, char *);
  69 static int get_fields (char *, int, struct smsg *);
  70 static int dsort (struct smsg **, struct smsg **);
  71 static int subsort (struct smsg **, struct smsg **);
  72 static int txtsort (struct smsg **, struct smsg **);
  73 static void rename_chain (struct msgs *, struct smsg **, int, int);
  74 static void rename_msgs (struct msgs *, struct smsg **);
  75
  76
  77 int
  78 main (int argc, char **argv)
  79 {
  80     int i, msgnum;
  81     unsigned char *cp;
  82     char *maildir, *datesw = NULL;
  83     char *folder = NULL, buf[BUFSIZ], **argp;
  84     char **arguments;
  85     struct msgs_array msgs = { 0, 0, NULL };
  86     struct msgs *mp;
  87     struct smsg **dlist;
  88     int checksw = 0;
  89
  90 #ifdef LOCALE
  91     setlocale(LC_ALL, "");
  92 #endif
  93     invo_name = r1bindex (argv[0], '/');
  94
  95     /* read user profile/context */
  96     context_read();
  97
  98     arguments = getarguments (invo_name, argc, argv, 1);
  99     argp = arguments;
 100
 101     /*
 102      * Parse arguments
 103      */
 104     while ((cp = *argp++)) {
 105         if (*cp == '-') {
 106             switch (smatch (++cp, switches)) {
 107             case AMBIGSW:
 108                 ambigsw (cp, switches);
 109                 done (1);
 110             case UNKWNSW:
 111                 adios (NULL, "-%s unknown", cp);
 112
 113             case HELPSW:
 114                 snprintf(buf, sizeof(buf), "%s [+folder] [msgs] [switches]",
 115                         invo_name);
 116                 print_help (buf, switches, 1);
 117                 done (0);
 118             case VERSIONSW:
 119                 print_version(invo_name);
 120                 done (0);
 121
 122             case DATESW:
 123                 if (datesw)
 124                     adios (NULL, "only one date field at a time");
 125                 if (!(datesw = *argp++) || *datesw == '-')
 126                     adios (NULL, "missing argument to %s", argp[-2]);
 127                 continue;
 128
 129             case TEXTSW:
 130                 if (subjsort)
 131                     adios (NULL, "only one text field at a time");
 132                 if (!(subjsort = *argp++) || *subjsort == '-')
 133                     adios (NULL, "missing argument to %s", argp[-2]);
 134                 continue;
 135
 136             case SUBJSW:
 137                 subjsort = "subject";
 138                 continue;
 139             case NSUBJSW:
 140                 subjsort = (char *)0;
 141                 continue;
 142
 143             case LIMSW:
 144                 if (!(cp = *argp++) || *cp == '-')
 145                         adios (NULL, "missing argument to %s", argp[-2]);
 146                 while (*cp == '0')
 147                     cp++;               /* skip any leading zeros */
 148                 if (!*cp) {             /* hit end of string */
 149                     submajor++;         /* sort subject-major */
 150                     continue;
 151                 }
 152                 if (!isdigit(*cp) || !(datelimit = atoi(cp)))
 153                     adios (NULL, "impossible limit %s", cp);
 154                 datelimit *= 60*60*24;
 155                 continue;
 156             case NLIMSW:
 157                 submajor = 0;   /* use date-major, but */
 158                 datelimit = 0;  /* use no limit */
 159                 continue;
 160
 161             case VERBSW:
 162                 verbose++;
 163                 continue;
 164             case NVERBSW:
 165                 verbose = 0;
 166                 continue;
 167
 168             case ALLMSGS:
 169                 allmsgs = 1;
 170                 continue;
 171             case NALLMSGS:
 172                 allmsgs = 0;
 173                 continue;
 174
 175             case CHECKSW:
 176                 checksw = 1;
 177                 continue;
 178             case NCHECKSW:
 179                 checksw = 0;
 180                 continue;
 181             }
 182         }
 183         if (*cp == '+' || *cp == '@') {
 184             if (folder)
 185                 adios (NULL, "only one folder at a time!");
 186             else
 187                 folder = pluspath (cp);
 188         } else
 189                 app_msgarg(&msgs, cp);
 190     }
 191
 192     if (!context_find ("path"))
 193         free (path ("./", TFOLDER));
 194     if (!msgs.size) {
 195         if (allmsgs) {
 196             app_msgarg(&msgs, "all");
 197         } else {
 198             adios (NULL, "must specify messages to sort with -noall");
 199         }
 200     }
 201     if (!datesw)
 202         datesw = "date";
 203     if (!folder)
 204         folder = getfolder (1);
 205     maildir = m_maildir (folder);
 206
 207     if (chdir (maildir) == NOTOK)
 208         adios (maildir, "unable to change directory to");
 209
 210     /* read folder and create message structure */
 211     if (!(mp = folder_read (folder)))
 212         adios (NULL, "unable to read folder %s", folder);
 213
 214     /* check for empty folder */
 215     if (mp->nummsg == 0)
 216         adios (NULL, "no messages in %s", folder);
 217
 218     /* parse all the message ranges/sequences and set SELECTED */
 219     for (msgnum = 0; msgnum < msgs.size; msgnum++)
 220         if (!m_convert (mp, msgs.msgs[msgnum]))
 221             done (1);
 222     seq_setprev (mp);   /* set the previous sequence */
 223
 224     if ((nmsgs = read_hdrs (mp, datesw)) <= 0)
 225         adios (NULL, "no messages to sort");
 226
 227     if (checksw  &&  check_failed) {
 228         adios (NULL, "errors found, no messages sorted");
 229     }
 230
 231     /*
 232      * sort a list of pointers to our "messages to be sorted".
 233      */
 234     dlist = (struct smsg **) mh_xmalloc ((nmsgs+1) * sizeof(*dlist));
 235     for (i = 0; i < nmsgs; i++)
 236         dlist[i] = &smsgs[i];
 237     dlist[nmsgs] = 0;
 238
 239     if (verbose) {      /* announce what we're doing */
 240         if (subjsort)
 241             if (submajor)
 242                 printf ("sorting by %s\n", subjsort);
 243             else
 244                 printf ("sorting by %s-major %s-minor\n", subjsort, datesw);
 245         else
 246             printf ("sorting by datefield %s\n", datesw);
 247     }
 248
 249     /* first sort by date, or by subject-major, date-minor */
 250     qsort ((char *) dlist, nmsgs, sizeof(*dlist),
 251             (qsort_comp) (submajor && subjsort ? txtsort : dsort));
 252
 253     /*
 254      * if we're sorting on subject, we need another list
 255      * in subject order, then a merge pass to collate the
 256      * two sorts.
 257      */
 258     if (!submajor && subjsort) {        /* already date sorted */
 259         struct smsg **slist, **flist;
 260         register struct smsg ***il, **fp, **dp;
 261
 262         slist = (struct smsg **) mh_xmalloc ((nmsgs+1) * sizeof(*slist));
 263         memcpy((char *)slist, (char *)dlist, (nmsgs+1)*sizeof(*slist));
 264         qsort((char *)slist, nmsgs, sizeof(*slist), (qsort_comp) subsort);
 265
 266         /*
 267          * make an inversion list so we can quickly find
 268          * the collection of messages with the same subj
 269          * given a message number.
 270          */
 271         il = (struct smsg ***) calloc (mp->hghsel+1, sizeof(*il));
 272         if (! il)
 273             adios (NULL, "couldn't allocate msg list");
 274         for (i = 0; i < nmsgs; i++)
 275             il[slist[i]->s_msg] = &slist[i];
 276         /*
 277          * make up the final list, chronological but with
 278          * all the same subjects grouped together.
 279          */
 280         flist = (struct smsg **) mh_xmalloc ((nmsgs+1) * sizeof(*flist));
 281         fp = flist;
 282         for (dp = dlist; *dp;) {
 283             register struct smsg **s = il[(*dp++)->s_msg];
 284
 285             /* see if we already did this guy */
 286             if (! s)
 287                 continue;
 288
 289             *fp++ = *s++;
 290             /*
 291              * take the next message(s) if there is one,
 292              * its subject isn't null and its subject
 293              * is the same as this one and it's not too
 294              * far away in time.
 295              */
 296             while (*s && (*s)->s_subj[0] &&
 297                    strcmp((*s)->s_subj, s[-1]->s_subj) == 0 &&
 298                    (datelimit == 0 ||
 299                    (*s)->s_clock - s[-1]->s_clock <= datelimit)) {
 300                 il[(*s)->s_msg] = 0;
 301                 *fp++ = *s++;
 302             }
 303         }
 304         *fp = 0;
 305         free (slist);
 306         free (dlist);
 307         dlist = flist;
 308     }
 309
 310     /*
 311      * At this point, dlist is a sorted array of pointers to smsg structures,
 312      * each of which contains a message number.
 313      */
 314
 315     rename_msgs (mp, dlist);
 316
 317     context_replace (pfolder, folder);  /* update current folder         */
 318     seq_save (mp);                      /* synchronize message sequences */
 319     context_save ();                    /* save the context file         */
 320     folder_free (mp);                   /* free folder/message structure */
 321     done (0);
 322     return 1;
 323 }
 324
 325 static int
 326 read_hdrs (struct msgs *mp, char *datesw)
 327 {
 328     int msgnum;
 329     struct tws tb;
 330     register struct smsg *s;
 331
 332     twscopy (&tb, dlocaltimenow ());
 333
 334     smsgs = (struct smsg *)
 335         calloc ((size_t) (mp->hghsel - mp->lowsel + 2),
 336             sizeof(*smsgs));
 337     if (smsgs == NULL)
 338         adios (NULL, "unable to allocate sort storage");
 339
 340     s = smsgs;
 341     for (msgnum = mp->lowsel; msgnum <= mp->hghsel; msgnum++) {
 342         if (is_selected(mp, msgnum)) {
 343             if (get_fields (datesw, msgnum, s)) {
 344                 s->s_msg = msgnum;
 345                 s++;
 346             }
 347         }
 348     }
 349     s->s_msg = 0;
 350     return(s - smsgs);
 351 }
 352
 353
 354 /*
 355  * Parse the message and get the data or subject field,
 356  * if needed.
 357  */
 358
 359 static int
 360 get_fields (char *datesw, int msg, struct smsg *smsg)
 361 {
 362     register int state;
 363     int compnum;
 364     char *msgnam, buf[BUFSIZ], nam[NAMESZ];
 365     register struct tws *tw;
 366     register char *datecomp = NULL, *subjcomp = NULL;
 367     register FILE *in;
 368     m_getfld_state_t gstate;
 369
 370     if ((in = fopen (msgnam = m_name (msg), "r")) == NULL) {
 371         admonish (msgnam, "unable to read message");
 372         return (0);
 373     }
 374     m_getfld_state_init (&gstate);
 375     for (compnum = 1;;) {
 376         int bufsz = sizeof buf;
 377         switch (state = m_getfld (gstate, nam, buf, &bufsz, in)) {
 378         case FLD:
 379         case FLDPLUS:
 380             compnum++;
 381             if (!mh_strcasecmp (nam, datesw)) {
 382                 datecomp = add (buf, datecomp);
 383                 while (state == FLDPLUS) {
 384                     bufsz = sizeof buf;
 385                     state = m_getfld (gstate, nam, buf, &bufsz, in);
 386                     datecomp = add (buf, datecomp);
 387                 }
 388                 if (!subjsort || subjcomp)
 389                     break;
 390             } else if (subjsort && !mh_strcasecmp (nam, subjsort)) {
 391                 subjcomp = add (buf, subjcomp);
 392                 while (state == FLDPLUS) {
 393                     bufsz = sizeof buf;
 394                     state = m_getfld (gstate, nam, buf, &bufsz, in);
 395                     subjcomp = add (buf, subjcomp);
 396                 }
 397                 if (datecomp)
 398                     break;
 399             } else {
 400                 /* just flush this guy */
 401                 while (state == FLDPLUS) {
 402                     bufsz = sizeof buf;
 403                     state = m_getfld (gstate, nam, buf, &bufsz, in);
 404                 }
 405             }
 406             continue;
 407
 408         case BODY:
 409         case FILEEOF:
 410             break;
 411
 412         case LENERR:
 413         case FMTERR:
 414             if (state == LENERR || state == FMTERR) {
 415                 admonish (NULL, "format error in message %d (header #%d)",
 416                       msg, compnum);
 417                 check_failed = 1;
 418             }
 419             if (datecomp)
 420                 free (datecomp);
 421             if (subjcomp)
 422                 free (subjcomp);
 423             fclose (in);
 424             return (0);
 425
 426         default:
 427             adios (NULL, "internal error -- you lose");
 428         }
 429         break;
 430     }
 431     m_getfld_state_destroy (&gstate);
 432
 433     /*
 434      * If no date component, then use the modification
 435      * time of the file as its date
 436      */
 437     if (!datecomp || (tw = dparsetime (datecomp)) == NULL) {
 438         struct stat st;
 439
 440         admonish (NULL, "can't parse %s field in message %d", datesw, msg);
 441         fstat (fileno (in), &st);
 442         smsg->s_clock = st.st_mtime;
 443         check_failed = 1;
 444     } else {
 445         smsg->s_clock = dmktime (tw);
 446     }
 447
 448     if (subjsort) {
 449         if (subjcomp) {
 450             /*
 451              * try to make the subject "canonical": delete
 452              * leading "re:", everything but letters & smash
 453              * letters to lower case.
 454              */
 455             register char  *cp, *cp2;
 456             register unsigned char c;
 457
 458             cp = subjcomp;
 459             cp2 = subjcomp;
 460             if (strcmp (subjsort, "subject") == 0) {
 461                 while ((c = *cp)) {
 462                     if (! isspace(c)) {
 463                         if(uprf(cp, "re:"))
 464                             cp += 2;
 465                         else
 466                             break;
 467                     }
 468                     cp++;
 469                 }
 470             }
 471
 472             while ((c = *cp++)) {
 473                 if (isalnum(c))
 474                     *cp2++ = isupper(c) ? tolower(c) : c;
 475             }
 476
 477             *cp2 = '\0';
 478         }
 479         else
 480             subjcomp = "";
 481
 482         smsg->s_subj = subjcomp;
 483     }
 484     fclose (in);
 485     if (datecomp)
 486         free (datecomp);
 487
 488     return (1);
 489 }
 490
 491 /*
 492  * sort on dates.
 493  */
 494 static int
 495 dsort (struct smsg **a, struct smsg **b)
 496 {
 497     if ((*a)->s_clock < (*b)->s_clock)
 498         return (-1);
 499     else if ((*a)->s_clock > (*b)->s_clock)
 500         return (1);
 501     else if ((*a)->s_msg < (*b)->s_msg)
 502         return (-1);
 503     else
 504         return (1);
 505 }
 506
 507 /*
 508  * sort on subjects.
 509  */
 510 static int
 511 subsort (struct smsg **a, struct smsg **b)
 512 {
 513     register int i;
 514
 515     if ((i = strcmp ((*a)->s_subj, (*b)->s_subj)))
 516         return (i);
 517
 518     return (dsort (a, b));
 519 }
 520
 521 static int
 522 txtsort (struct smsg **a, struct smsg **b)
 523 {
 524     register int i;
 525
 526     if ((i = strcmp ((*a)->s_subj, (*b)->s_subj)))
 527         return (i);
 528     else if ((*a)->s_msg < (*b)->s_msg)
 529         return (-1);
 530     else
 531         return (1);
 532 }
 533
 534 static void
 535 rename_chain (struct msgs *mp, struct smsg **mlist, int msg, int endmsg)
 536 {
 537     int nxt, old, new;
 538     char *newname, oldname[BUFSIZ];
 539     char newbuf[PATH_MAX + 1];
 540
 541     for (;;) {
 542         nxt = mlist[msg] - smsgs;       /* mlist[msg] is a ptr into smsgs */
 543         mlist[msg] = (struct smsg *)0;
 544         old = smsgs[nxt].s_msg;
 545         new = smsgs[msg].s_msg;
 546         strncpy (oldname, m_name (old), sizeof(oldname));
 547         newname = m_name (new);
 548         if (verbose)
 549             printf ("message %d becomes message %d\n", old, new);
 550
 551         (void)snprintf(oldname, sizeof (oldname), "%s/%d", mp->foldpath, old);
 552         (void)snprintf(newbuf, sizeof (newbuf), "%s/%d", mp->foldpath, new);
 553         ext_hook("ref-hook", oldname, newbuf);
 554
 555         if (rename (oldname, newname) == NOTOK)
 556             adios (newname, "unable to rename %s to", oldname);
 557
 558         copy_msg_flags (mp, new, old);
 559         if (mp->curmsg == old)
 560             seq_setcur (mp, new);
 561
 562         if (nxt == endmsg)
 563             break;
 564
 565         msg = nxt;
 566     }
 567 /*      if (nxt != endmsg); */
 568 /*      rename_chain (mp, mlist, nxt, endmsg); */
 569 }
 570
 571 static void
 572 rename_msgs (struct msgs *mp, struct smsg **mlist)
 573 {
 574     int i, j, old, new;
 575     seqset_t tmpset;
 576     char f1[BUFSIZ], tmpfil[BUFSIZ];
 577     char newbuf[PATH_MAX + 1];
 578     struct smsg *sp;
 579
 580     strncpy (tmpfil, m_name (mp->hghmsg + 1), sizeof(tmpfil));
 581
 582     for (i = 0; i < nmsgs; i++) {
 583         if (! (sp = mlist[i]))
 584             continue;   /* did this one */
 585
 586         j = sp - smsgs;
 587         if (j == i)
 588             continue;   /* this one doesn't move */
 589
 590         /*
 591          * the guy that was msg j is about to become msg i.
 592          * rename 'j' to make a hole, then recursively rename
 593          * guys to fill up the hole.
 594          */
 595         old = smsgs[j].s_msg;
 596         new = smsgs[i].s_msg;
 597         strncpy (f1, m_name (old), sizeof(f1));
 598
 599         if (verbose)
 600             printf ("renaming message chain from %d to %d\n", old, new);
 601
 602         /*
 603          *      Run the external hook to refile the old message as the
 604          *      temporary message number that is off of the end of the
 605          *      messages in the folder.
 606          */
 607
 608         (void)snprintf(f1, sizeof (f1), "%s/%d", mp->foldpath, old);
 609         (void)snprintf(newbuf, sizeof (newbuf), "%s/%d", mp->foldpath, mp->hghmsg + 1);
 610         ext_hook("ref-hook", f1, newbuf);
 611
 612         if (rename (f1, tmpfil) == NOTOK)
 613             adios (tmpfil, "unable to rename %s to ", f1);
 614
 615         get_msg_flags (mp, &tmpset, old);
 616
 617         rename_chain (mp, mlist, j, i);
 618
 619         /*
 620          *      Run the external hook to refile the temorary message number
 621          *      to the real place.
 622          */
 623
 624         (void)snprintf(f1, sizeof (f1), "%s/%d", mp->foldpath, new);
 625         ext_hook("ref-hook", newbuf, f1);
 626
 627         if (rename (tmpfil, m_name(new)) == NOTOK)
 628             adios (m_name(new), "unable to rename %s to", tmpfil);
 629
 630         set_msg_flags (mp, &tmpset, new);
 631         mp->msgflags |= SEQMOD;
 632     }
 633 }