]>
diplodocus.org Git - nmh/blob - uip/flist.c
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 #define FLIST_SWITCHES \
31 X("sequence name", 0, SEQSW) \
33 X("noall", 0, NOALLSW) \
34 X("recurse", 0, RECURSE) \
35 X("norecurse", 0, NORECURSE) \
36 X("showzero", 0, SHOWZERO) \
37 X("noshowzero", 0, NOSHOWZERO) \
38 X("alpha", 0, ALPHASW) \
39 X("noalpha", 0, NOALPHASW) \
40 X("fast", 0, FASTSW) \
41 X("nofast", 0, NOFASTSW) \
42 X("total", -5, TOTALSW) \
43 X("nototal", -7, NOTOTALSW) \
44 X("version", 0, VERSIONSW) \
45 X("help", 0, HELPSW) \
47 #define X(sw, minchars, id) id,
48 DEFINE_SWITCH_ENUM(FLIST
);
51 #define X(sw, minchars, id) { sw, minchars, id },
52 DEFINE_SWITCH_ARRAY(FLIST
, switches
);
56 char *name
; /* name of folder */
58 int error
; /* error == 1 for unreadable folder */
59 int nMsgs
; /* number of messages in folder */
60 ivector_t nSeq
; /* number of messages in each sequence */
61 ivector_t
private; /* is given sequence, public or private */
64 static struct Folder
*orders
= NULL
;
65 static int nOrders
= 0;
66 static int nOrdersAlloced
= 0;
67 static struct Folder
*folders
= NULL
;
68 static unsigned int nFolders
= 0;
69 static int nFoldersAlloced
= 0;
71 /* info on folders to search */
72 static char **foldersToDo
;
73 static int numfolders
;
74 static int maxfolders
;
76 /* info on sequences to search for */
77 static svector_t sequencesToDo
;
79 static int all
= FALSE
; /* scan all folders in top level? */
80 static int alphaOrder
= FALSE
; /* want alphabetical order only */
81 static int recurse
= FALSE
; /* show nested folders? */
82 static int showzero
= TRUE
; /* show folders even if no messages in seq? */
83 static int Total
= TRUE
; /* display info on number of messages in *
84 * sequence found, and total num messages */
86 static char curfolder
[BUFSIZ
]; /* name of the current folder */
87 static char *nmhdir
; /* base nmh mail directory */
90 * Type for a compare function for qsort. This keeps
93 typedef int (*qsort_comp
) (const void *, const void *);
98 int CompareFolders(struct Folder
*, struct Folder
*);
99 void GetFolderOrder(void);
100 void ScanFolders(void);
101 int AddFolder(char *, int);
102 void BuildFolderList(char *, int);
103 void BuildFolderListRecurse(char *, struct stat
*, int);
104 void PrintFolders(void);
105 void AllocFolders(struct Folder
**, int *, int);
106 int AssignPriority(char *);
107 static void do_readonly_folders(void);
112 main(int argc
, char **argv
)
118 setlocale(LC_ALL
, "");
119 invo_name
= r1bindex(argv
[0], '/');
121 /* read user profile/context */
125 * If program was invoked with name ending
126 * in `s', then add switch `-all'.
128 if (argv
[0][strlen (argv
[0]) - 1] == 's')
131 arguments
= getarguments (invo_name
, argc
, argv
, 1);
134 /* allocate the initial space to record the folder names */
136 maxfolders
= MAXFOLDERS
;
137 foldersToDo
= (char **) mh_xmalloc ((size_t) (maxfolders
* sizeof(*foldersToDo
)));
139 /* no sequences yet */
140 sequencesToDo
= svector_create (0);
142 /* parse arguments */
143 while ((cp
= *argp
++)) {
145 switch (smatch(++cp
, switches
)) {
147 ambigsw(cp
, switches
);
150 adios(NULL
, "-%s unknown", cp
);
153 snprintf(buf
, sizeof(buf
), "%s [+folder1 [+folder2 ...]][switches]",
155 print_help(buf
, switches
, 1);
158 print_version(invo_name
);
162 if (!(cp
= *argp
++) || *cp
== '-')
163 adios (NULL
, "missing argument to %s", argp
[-2]);
165 svector_push_back (sequencesToDo
, cp
);
208 * Check if we need to allocate more space
211 if (numfolders
>= maxfolders
) {
212 maxfolders
+= MAXFOLDERS
;
213 foldersToDo
= (char **) mh_xrealloc (foldersToDo
,
214 (size_t) (maxfolders
* sizeof(*foldersToDo
)));
216 if (*cp
== '+' || *cp
== '@') {
217 foldersToDo
[numfolders
++] =
220 foldersToDo
[numfolders
++] = cp
;
224 if (!context_find ("path"))
225 free (path ("./", TFOLDER
));
227 /* get current folder */
228 strncpy (curfolder
, getfolder(1), sizeof(curfolder
));
230 /* get nmh base directory */
231 nmhdir
= m_maildir ("");
234 * If we didn't specify any sequences, we search
235 * for the "Unseen-Sequence" profile entry and use
236 * all the sequences defined there.
238 if (svector_size (sequencesToDo
) == 0) {
239 if ((cp
= context_find(usequence
)) && *cp
) {
243 ap
= brkstring (dp
, " ", "\n");
244 for (; ap
&& *ap
; ap
++)
245 svector_push_back (sequencesToDo
, *ap
);
247 adios (NULL
, "no sequence specified or %s profile entry found", usequence
);
253 qsort(folders
, nFolders
, sizeof(struct Folder
), (qsort_comp
) CompareFolders
);
255 svector_free (sequencesToDo
);
261 * Read the Flist-Order profile entry to determine
262 * how to sort folders for output.
272 if (!(p
= context_find("Flist-Order")))
275 while (isspace((unsigned char) *p
))
278 while (*p
&& !isspace((unsigned char) *p
))
282 AllocFolders(&orders
, &nOrdersAlloced
, nOrders
+ 1);
283 o
= &orders
[nOrders
++];
284 o
->priority
= priority
++;
285 o
->name
= (char *) mh_xmalloc(p
- s
+ 1);
286 strncpy(o
->name
, s
, p
- s
);
294 * Scan all the necessary folders
303 * change directory to base of nmh directory
305 if (chdir (nmhdir
) == NOTOK
)
306 adios (nmhdir
, "unable to change directory to");
308 if (numfolders
> 0) {
310 strncpy (curfolder
, foldersToDo
[numfolders
- 1], sizeof(curfolder
));
311 context_replace (pfolder
, curfolder
);/* update current folder */
312 context_save (); /* save the context file */
315 * Scan each given folder. If -all is given,
316 * then also scan the 1st level subfolders under
319 for (i
= 0; i
< numfolders
; ++i
)
320 BuildFolderList(foldersToDo
[i
], all
? 1 : 0);
324 * Do the readonly folders
326 do_readonly_folders();
329 * Now scan the entire nmh directory for folders
331 BuildFolderList(".", 0);
334 * Else scan current folder
336 BuildFolderList(curfolder
, 0);
342 * Initial building of folder list for
343 * the top of our search tree.
347 BuildFolderList(char *dirName
, int searchdepth
)
351 /* Make sure we have a directory */
352 if ((stat(dirName
, &st
) == -1) || !S_ISDIR(st
.st_mode
))
356 * If base directory, don't add it to the
357 * folder list. We just recurse into it.
359 if (!strcmp (dirName
, ".")) {
360 BuildFolderListRecurse (".", &st
, 0);
365 * Add this folder to the list.
366 * If recursing and directory has subfolders,
367 * then build folder list for subfolders.
369 if (AddFolder(dirName
, showzero
) && (recurse
|| searchdepth
) && st
.st_nlink
> 2)
370 BuildFolderListRecurse(dirName
, &st
, searchdepth
- 1);
374 * Recursive building of folder list
378 BuildFolderListRecurse(char *dirName
, struct stat
*s
, int searchdepth
)
380 char *base
, name
[PATH_MAX
];
388 * Keep track of number of directories we've seen so we can
389 * stop stat'ing entries in this directory once we've seen
390 * them all. This optimization will fail if you have extra
391 * directories beginning with ".", since we don't bother to
392 * stat them. But that shouldn't generally be a problem.
394 nlinks
= s
->st_nlink
;
396 /* Disable the optimization under conditions where st_nlink
397 is set to 1. That happens on Cygwin, for example:
398 http://cygwin.com/ml/cygwin-apps/2008-08/msg00264.html */
402 if (!(dir
= opendir(dirName
)))
403 adios(dirName
, "can't open directory");
406 * A hack so that we don't see a
407 * leading "./" in folder names.
409 base
= strcmp (dirName
, ".") ? dirName
: dirName
+ 1;
411 while (nlinks
&& (dp
= readdir(dir
))) {
412 if (!strcmp(dp
->d_name
, ".") || !strcmp(dp
->d_name
, "..")) {
416 if (dp
->d_name
[0] == '.')
418 /* Check to see if the name of the file is a number
419 * if it is, we assume it's a mail file and skip it
421 for (n
= dp
->d_name
; *n
&& isdigit((unsigned char) *n
); n
++);
424 strncpy (name
, base
, sizeof(name
) - 2);
427 strncat(name
, dp
->d_name
, sizeof(name
) - strlen(name
) - 1);
428 if ((stat(name
, &st
) != -1) && S_ISDIR(st
.st_mode
)) {
430 * Check if this was really a symbolic link pointing
431 * to a directory. If not, then decrement link count.
433 if (lstat (name
, &st
) == -1)
435 /* Add this folder to the list */
436 if (AddFolder(name
, showzero
) &&
437 (recurse
|| searchdepth
) && st
.st_nlink
> 2)
438 BuildFolderListRecurse(name
, &st
, searchdepth
- 1);
445 * Add this folder to our list, counting the total number of
446 * messages and the number of messages in each sequence.
450 AddFolder(char *name
, int force
)
454 ivector_t seqnum
= ivector_create (0), nSeq
= ivector_create (0);
459 /* Read folder and create message structure */
460 if (!(mp
= folder_read (name
, 0))) {
461 /* Oops, error occurred. Record it and continue. */
462 AllocFolders(&folders
, &nFoldersAlloced
, nFolders
+ 1);
463 f
= &folders
[nFolders
++];
464 f
->name
= getcpy(name
);
466 f
->priority
= AssignPriority(f
->name
);
470 for (i
= 0; i
< svector_size (sequencesToDo
); i
++) {
471 /* Convert sequences to their sequence numbers */
472 if ((cp
= svector_at (sequencesToDo
, i
)))
473 ivector_push_back (seqnum
, seq_getnum(mp
, cp
));
475 ivector_push_back (seqnum
, -1);
477 /* Now count messages in this sequence */
478 ivector_push_back (nSeq
, 0);
479 if (mp
->nummsg
> 0 && ivector_at (seqnum
, i
) != -1) {
480 for (msgnum
= mp
->lowmsg
; msgnum
<= mp
->hghmsg
; msgnum
++) {
481 if (in_sequence(mp
, ivector_at (seqnum
, i
), msgnum
))
482 (*ivector_atp (nSeq
, i
))++;
487 /* Check if any of the sequence checks were nonzero */
489 for (i
= 0; i
< svector_size (sequencesToDo
); i
++) {
490 if (ivector_at (nSeq
, i
) > 0) {
496 if (nonzero
|| force
) {
497 /* save general folder information */
498 AllocFolders(&folders
, &nFoldersAlloced
, nFolders
+ 1);
499 f
= &folders
[nFolders
++];
500 f
->name
= getcpy(name
);
501 f
->nMsgs
= mp
->nummsg
;
502 f
->nSeq
= ivector_create (0);
503 f
->private = ivector_create (0);
505 f
->priority
= AssignPriority(f
->name
);
507 /* record the sequence information */
508 for (i
= 0; i
< svector_size (sequencesToDo
); i
++) {
509 *ivector_atp (f
->nSeq
, i
) = ivector_at (nSeq
, i
);
510 ivector_push_back (f
->private,
511 ivector_at (seqnum
, i
) != -1
512 ? is_seq_private(mp
, ivector_at (seqnum
, i
))
518 ivector_free (seqnum
);
519 folder_free (mp
); /* free folder/message structure */
524 * Print the folder/sequence information
530 char tmpname
[BUFSIZ
];
531 unsigned int i
, j
, len
, has_private
= 0;
532 unsigned int maxfolderlen
= 0, maxseqlen
= 0;
533 int maxnum
= 0, maxseq
= 0;
536 for (i
= 0; i
< nFolders
; i
++)
537 printf("%s\n", folders
[i
].name
);
542 * Find the width we need for various fields
544 for (i
= 0; i
< nFolders
; ++i
) {
545 /* find the length of longest folder name */
546 len
= strlen(folders
[i
].name
);
547 if (len
> maxfolderlen
)
550 /* If folder had error, skip the rest */
551 if (folders
[i
].error
)
554 /* find the maximum total messages */
555 if (folders
[i
].nMsgs
> maxnum
)
556 maxnum
= folders
[i
].nMsgs
;
558 for (j
= 0; j
< svector_size (sequencesToDo
); j
++) {
559 /* find maximum width of sequence name */
560 len
= strlen (svector_at (sequencesToDo
, j
));
561 if ((ivector_at (folders
[i
].nSeq
, j
) > 0 || showzero
) &&
565 /* find the maximum number of messages in sequence */
566 if (ivector_at (folders
[i
].nSeq
, j
) > maxseq
)
567 maxseq
= ivector_at (folders
[i
].nSeq
, j
);
569 /* check if this sequence is private in any of the folders */
570 if (ivector_at (folders
[i
].private, j
))
575 /* Now print all the folder/sequence information */
576 for (i
= 0; i
< nFolders
; i
++) {
577 for (j
= 0; j
< svector_size (sequencesToDo
); j
++) {
578 if (ivector_at (folders
[i
].nSeq
, j
) > 0 || showzero
) {
579 /* Add `+' to end of name of current folder */
580 if (strcmp(curfolder
, folders
[i
].name
))
581 snprintf(tmpname
, sizeof(tmpname
), "%s", folders
[i
].name
);
583 snprintf(tmpname
, sizeof(tmpname
), "%s+", folders
[i
].name
);
585 if (folders
[i
].error
) {
586 printf("%-*s is unreadable\n", maxfolderlen
+1, tmpname
);
590 printf("%-*s has %*d in sequence %-*s%s; out of %*d\n",
591 maxfolderlen
+1, tmpname
,
592 num_digits(maxseq
), ivector_at (folders
[i
].nSeq
, j
),
593 maxseqlen
, svector_at (sequencesToDo
, j
),
594 !has_private
? "" : ivector_at (folders
[i
].private, j
)
595 ? " (private)" : " ",
596 num_digits(maxnum
), folders
[i
].nMsgs
);
603 * Put them in priority order.
607 CompareFolders(struct Folder
*f1
, struct Folder
*f2
)
609 if (!alphaOrder
&& f1
->priority
!= f2
->priority
)
610 return f1
->priority
- f2
->priority
;
612 return strcmp(f1
->name
, f2
->name
);
616 * Make sure we have at least n folders allocated.
620 AllocFolders(struct Folder
**f
, int *nfa
, int n
)
626 *f
= (struct Folder
*) mh_xmalloc (*nfa
* (sizeof(struct Folder
)));
629 *f
= (struct Folder
*) mh_xrealloc (*f
, *nfa
* (sizeof(struct Folder
)));
634 * Return the priority for a name. The highest comes from an exact match.
635 * After that, the longest match (then first) assigns the priority.
638 AssignPriority(char *name
)
646 for (i
= 0; i
< nOrders
; ++i
) {
648 if (!strcmp(name
, o
->name
))
650 ol
= strlen(o
->name
);
655 if (o
->name
[0] == '*' && !strcmp(o
->name
+ 1, name
+ (nl
- ol
+ 1))) {
658 } else if (o
->name
[ol
- 1] == '*' && strncmp(o
->name
, name
, ol
- 1) == 0) {
667 * Do the read only folders
671 do_readonly_folders (void)
675 register struct node
*np
;
677 snprintf (atrcur
, sizeof(atrcur
), "atr-%s-", current
);
678 atrlen
= strlen (atrcur
);
680 for (np
= m_defs
; np
; np
= np
->n_next
)
681 if (ssequal (atrcur
, np
->n_name
)
682 && !ssequal (nmhdir
, np
->n_name
+ atrlen
))
683 BuildFolderList (np
->n_name
+ atrlen
, 0);