2 ** flist.c -- list nmh folders containing messages
3 ** -- in a given sequence
6 ** David Nichols, Xerox-PARC, November, 1992
8 ** Copyright (c) 1994 Xerox Corporation.
9 ** Use and copying of this software and preparation of derivative works based
10 ** upon this software are permitted. Any distribution of this software or
11 ** derivative works must comply with all applicable United States export
12 ** control laws. This software is made available AS IS, and Xerox Corporation
13 ** makes no warranty about the software, its performance or its conformity to
24 ** We allocate space to record the names of folders
25 ** (foldersToDo array), this number of elements at a time.
27 #define MAXFOLDERS 100
30 static struct swit switches[] = {
32 { "sequence name", 0 },
65 char *name; /* name of folder */
67 int error; /* error == 1 for unreadable folder */
68 int nMsgs; /* number of messages in folder */
69 int nSeq[NUMATTRS]; /* number of messages in each sequence */
70 int private[NUMATTRS]; /* is given sequence, public or private */
73 static struct Folder *orders = NULL;
74 static int nOrders = 0;
75 static int nOrdersAlloced = 0;
76 static struct Folder *folders = NULL;
77 static int nFolders = 0;
78 static int nFoldersAlloced = 0;
80 /* info on folders to search */
81 static char **foldersToDo;
82 static int numfolders;
83 static int maxfolders;
85 /* info on sequences to search for */
86 static char *sequencesToDo[NUMATTRS];
87 static int numsequences;
89 static int all = FALSE; /* scan all folders in top level? */
90 static int alphaOrder = FALSE; /* want alphabetical order only */
91 static int recurse = FALSE; /* show nested folders? */
92 static int showzero = TRUE; /* show folders even if no messages in seq? */
93 static int Total = TRUE; /* display info on number of messages in
94 * sequence found, and total num messages */
96 static char curfol[BUFSIZ]; /* name of the current folder */
97 static char *nmhdir; /* base nmh mail directory */
100 ** Type for a compare function for qsort. This keeps
101 ** the compiler happy.
103 typedef int (*qsort_comp) (const void *, const void *);
108 int CompareFolders(struct Folder *, struct Folder *);
109 void GetFolderOrder(void);
110 void ScanFolders(void);
111 int AddFolder(char *, int);
112 void BuildFolderList(char *, int);
113 void BuildFolderListRecurse(char *, struct stat *, int);
114 void PrintFolders(void);
115 void AllocFolders(struct Folder **, int *, int);
116 int AssignPriority(char *);
117 static void do_readonly_folders(void);
122 main(int argc, char **argv)
129 setlocale(LC_ALL, "");
131 invo_name = mhbasename(argv[0]);
133 /* read user profile/context */
137 ** If program was invoked with name ending
138 ** in `s', then add switch `-all'.
140 if (argv[0][strlen(argv[0]) - 1] == 's')
143 arguments = getarguments(invo_name, argc, argv, 1);
146 /* allocate the initial space to record the folder names */
148 maxfolders = MAXFOLDERS;
149 foldersToDo = (char **) mh_xmalloc((size_t)
150 (maxfolders * sizeof(*foldersToDo)));
152 /* no sequences yet */
155 /* parse arguments */
156 while ((cp = *argp++)) {
158 switch (smatch(++cp, switches)) {
160 ambigsw(cp, switches);
163 adios(NULL, "-%s unknown", cp);
166 snprintf(buf, sizeof(buf), "%s [+folder1 [+folder2 ...]][switches]", invo_name);
167 print_help(buf, switches, 1);
170 print_version(invo_name);
174 if (!(cp = *argp++) || *cp == '-')
175 adios(NULL, "missing argument to %s",
178 /* check if too many sequences specified */
179 if (numsequences >= NUMATTRS)
180 adios(NULL, "too many sequences (more than %d) specified", NUMATTRS);
181 sequencesToDo[numsequences++] = cp;
224 ** Check if we need to allocate more space
227 if (numfolders >= maxfolders) {
228 maxfolders += MAXFOLDERS;
229 foldersToDo = (char **) mh_xrealloc(foldersToDo, (size_t) (maxfolders * sizeof(*foldersToDo)));
231 if (*cp == '+' || *cp == '@') {
232 foldersToDo[numfolders++] = getcpy(expandfol(cp));
234 foldersToDo[numfolders++] = cp;
238 /* get current folder */
239 strncpy(curfol, getcurfol(), sizeof(curfol));
241 /* get nmh base directory */
242 nmhdir = toabsdir("+");
245 ** If we didn't specify any sequences, we search
246 ** for the "Unseen-Sequence" profile entry and use
247 ** all the sequences defined there. We check to
248 ** make sure that the Unseen-Sequence entry doesn't
249 ** contain more than NUMATTRS sequences.
251 if (numsequences == 0) {
252 if ((cp = context_find(usequence)) && *cp) {
256 ap = brkstring(dp, " ", "\n");
257 for (; ap && *ap; ap++) {
258 if (numsequences >= NUMATTRS)
259 adios(NULL, "too many sequences (more than %d) in %s profile entry", NUMATTRS, usequence);
261 sequencesToDo[numsequences++] = *ap;
264 adios(NULL, "no sequence specified or %s profile entry found", usequence);
270 qsort(folders, nFolders, sizeof(struct Folder),
271 (qsort_comp) CompareFolders);
278 ** Read the Flist-Order profile entry to determine
279 ** how to sort folders for output.
285 unsigned char *p, *s;
289 if (!(p = context_find("Flist-Order")))
295 while (*p && !isspace(*p))
299 AllocFolders(&orders, &nOrdersAlloced, nOrders + 1);
300 o = &orders[nOrders++];
301 o->priority = priority++;
302 o->name = (char *) mh_xmalloc(p - s + 1);
303 strncpy(o->name, s, p - s);
311 ** Scan all the necessary folders
320 * change directory to base of nmh directory
322 if (chdir(nmhdir) == NOTOK)
323 adios(nmhdir, "unable to change directory to");
325 if (numfolders > 0) {
327 strncpy(curfol, foldersToDo[numfolders - 1], sizeof(curfol));
328 context_replace(curfolder, curfol); /* update current folder */
329 context_save(); /* save the context file */
332 ** Scan each given folder. If -all is given,
333 ** then also scan the 1st level subfolders under
334 ** each given folder.
336 for (i = 0; i < numfolders; ++i)
337 BuildFolderList(foldersToDo[i], all ? 1 : 0);
340 /* Do the readonly folders */
341 do_readonly_folders();
343 /* Now scan the entire nmh directory for folders */
344 BuildFolderList(".", 0);
346 /* Else scan current folder */
347 BuildFolderList(curfol, 0);
353 ** Initial building of folder list for
354 ** the top of our search tree.
358 BuildFolderList(char *dirName, int searchdepth)
362 /* Make sure we have a directory */
363 if ((stat(dirName, &st) == -1) || !S_ISDIR(st.st_mode))
367 ** If base directory, don't add it to the
368 ** folder list. We just recurse into it.
370 if (!strcmp(dirName, ".")) {
371 BuildFolderListRecurse(".", &st, 0);
376 ** Add this folder to the list.
377 ** If recursing and directory has subfolders,
378 ** then build folder list for subfolders.
380 if (AddFolder(dirName, showzero) && (recurse || searchdepth) &&
382 BuildFolderListRecurse(dirName, &st, searchdepth - 1);
386 ** Recursive building of folder list
390 BuildFolderListRecurse(char *dirName, struct stat *s, int searchdepth)
392 char *base, name[PATH_MAX];
400 ** Keep track of number of directories we've seen so we can
401 ** stop stat'ing entries in this directory once we've seen
402 ** them all. This optimization will fail if you have extra
403 ** directories beginning with ".", since we don't bother to
404 ** stat them. But that shouldn't generally be a problem.
406 nlinks = s->st_nlink;
408 if (!(dir = opendir(dirName)))
409 adios(dirName, "can't open directory");
412 ** A hack so that we don't see a
413 ** leading "./" in folder names.
415 base = strcmp(dirName, ".") ? dirName : dirName + 1;
417 while (nlinks && (dp = readdir(dir))) {
418 if (!strcmp(dp->d_name, ".") || !strcmp(dp->d_name, "..")) {
422 if (dp->d_name[0] == '.')
424 /* Check to see if the name of the file is a number
425 ** if it is, we assume it's a mail file and skip it
427 for (n = dp->d_name; *n && isdigit(*n); n++);
430 strncpy(name, base, sizeof(name) - 2);
433 strncat(name, dp->d_name, sizeof(name) - strlen(name) - 1);
434 if ((stat(name, &st) != -1) && S_ISDIR(st.st_mode)) {
436 ** Check if this was really a symbolic link pointing
437 ** to a directory. If not, then decrement link count.
439 if (lstat(name, &st) == -1)
441 /* Add this folder to the list */
442 if (AddFolder(name, showzero) &&
443 (recurse || searchdepth) &&
445 BuildFolderListRecurse(name, &st,
453 ** Add this folder to our list, counting the total number of
454 ** messages and the number of messages in each sequence.
458 AddFolder(char *name, int force)
460 int i, msgnum, nonzero;
461 int seqnum[NUMATTRS], nSeq[NUMATTRS];
465 /* Read folder and create message structure */
466 if (!(mp = folder_read(name))) {
467 /* Oops, error occurred. Record it and continue. */
468 AllocFolders(&folders, &nFoldersAlloced, nFolders + 1);
469 f = &folders[nFolders++];
470 f->name = getcpy(name);
472 f->priority = AssignPriority(f->name);
476 for (i = 0; i < numsequences; i++) {
477 /* Convert sequences to their sequence numbers */
478 if (sequencesToDo[i])
479 seqnum[i] = seq_getnum(mp, sequencesToDo[i]);
483 /* Now count messages in this sequence */
485 if (mp->nummsg > 0 && seqnum[i] != -1) {
486 for (msgnum = mp->lowmsg; msgnum <= mp->hghmsg;
488 if (in_sequence(mp, seqnum[i], msgnum))
494 /* Check if any of the sequence checks were nonzero */
496 for (i = 0; i < numsequences; i++) {
503 if (nonzero || force) {
504 /* save general folder information */
505 AllocFolders(&folders, &nFoldersAlloced, nFolders + 1);
506 f = &folders[nFolders++];
507 f->name = getcpy(name);
508 f->nMsgs = mp->nummsg;
510 f->priority = AssignPriority(f->name);
512 /* record the sequence information */
513 for (i = 0; i < numsequences; i++) {
514 f->nSeq[i] = nSeq[i];
515 f->private[i] = (seqnum[i] != -1) ?
516 is_seq_private(mp, seqnum[i]) : 0;
520 folder_free(mp); /* free folder/message structure */
525 ** Print the folder/sequence information
531 char tmpname[BUFSIZ];
532 int i, j, len, has_private = 0;
533 int maxfolderlen = 0, maxseqlen = 0;
534 int maxnum = 0, maxseq = 0;
537 for (i = 0; i < nFolders; i++)
538 printf("%s\n", folders[i].name);
543 ** Find the width we need for various fields
545 for (i = 0; i < nFolders; ++i) {
546 /* find the length of longest folder name */
547 len = strlen(folders[i].name);
548 if (len > maxfolderlen)
551 /* If folder had error, skip the rest */
552 if (folders[i].error)
555 /* find the maximum total messages */
556 if (folders[i].nMsgs > maxnum)
557 maxnum = folders[i].nMsgs;
559 for (j = 0; j < numsequences; j++) {
560 /* find maximum width of sequence name */
561 len = strlen(sequencesToDo[j]);
562 if ((folders[i].nSeq[j] > 0 || showzero) &&
566 /* find the maximum number of messages in sequence */
567 if (folders[i].nSeq[j] > maxseq)
568 maxseq = folders[i].nSeq[j];
571 ** check if this sequence is private in any of
574 if (folders[i].private[j])
579 /* Now print all the folder/sequence information */
580 for (i = 0; i < nFolders; i++) {
581 for (j = 0; j < numsequences; j++) {
582 if (folders[i].nSeq[j] > 0 || showzero) {
583 /* Add `+' to end of name of current folder */
584 if (strcmp(curfol, folders[i].name))
585 snprintf(tmpname, sizeof(tmpname),
586 "%s", folders[i].name);
588 snprintf(tmpname, sizeof(tmpname),
592 if (folders[i].error) {
593 printf("%-*s is unreadable\n",
599 printf("%-*s has %*d in sequence %-*s%s; out of %*d\n", maxfolderlen+1, tmpname, num_digits(maxseq), folders[i].nSeq[j], maxseqlen, sequencesToDo[j], !has_private ? "" : folders[i].private[j] ? " (private)" : " ", num_digits(maxnum), folders[i].nMsgs);
606 ** Put them in priority order.
610 CompareFolders(struct Folder *f1, struct Folder *f2)
612 if (!alphaOrder && f1->priority != f2->priority)
613 return f1->priority - f2->priority;
615 return strcmp(f1->name, f2->name);
619 ** Make sure we have at least n folders allocated.
623 AllocFolders(struct Folder **f, int *nfa, int n)
629 *f = (struct Folder *) mh_xmalloc(
630 *nfa * (sizeof(struct Folder)));
633 *f = (struct Folder *) mh_xrealloc(
634 *f, *nfa * (sizeof(struct Folder)));
639 ** Return the priority for a name. The highest comes from an exact match.
640 ** After that, the longest match (then first) assigns the priority.
643 AssignPriority(char *name)
651 for (i = 0; i < nOrders; ++i) {
653 if (!strcmp(name, o->name))
655 ol = strlen(o->name);
660 if (o->name[0] == '*' && !strcmp(o->name + 1,
661 name + (nl - ol + 1))) {
664 } else if (o->name[ol - 1] == '*' &&
665 strncmp(o->name, name, ol - 1) == 0) {
674 ** Do the read only folders
678 do_readonly_folders(void)
682 register struct node *np;
684 snprintf(atrcur, sizeof(atrcur), "atr-%s-", current);
685 atrlen = strlen(atrcur);
687 for (np = m_defs; np; np = np->n_next)
688 if (isprefix(atrcur, np->n_name)
689 && !isprefix(nmhdir, np->n_name + atrlen))
690 BuildFolderList(np->n_name + atrlen, 0);