diff options
| author | Leah Neukirchen <leah@vuxu.org> | 2020-05-04 14:45:07 +0200 |
|---|---|---|
| committer | Leah Neukirchen <leah@vuxu.org> | 2020-05-04 14:45:07 +0200 |
| commit | 62da7c59eabcd8c6c8957a414a02efd6bf11d386 (patch) | |
| tree | 3168f5c8eede2bf94f68d135ca13142cc8667d7b /mthread.c | |
| parent | a5c77c71bcb7d90f19887733717d9b27cb444a80 (diff) | |
| download | mblaze-62da7c59eabcd8c6c8957a414a02efd6bf11d386.tar.gz mblaze-62da7c59eabcd8c6c8957a414a02efd6bf11d386.tar.xz mblaze-62da7c59eabcd8c6c8957a414a02efd6bf11d386.zip | |
mthread: add -r to reverse top-level order
Diffstat (limited to 'mthread.c')
| -rw-r--r-- | mthread.c | 15 |
1 files changed, 12 insertions, 3 deletions
diff --git a/mthread.c b/mthread.c index 70b36b3..300fcae 100644 --- a/mthread.c +++ b/mthread.c @@ -21,6 +21,7 @@ #include "blaze822.h" static int vflag; +static int rflag; static int optional; struct container { @@ -347,6 +348,12 @@ dateorder(const void *a, const void *b) return 0; } +static int +reverse_dateorder(const void *a, const void *b) +{ + return dateorder(b, a); +} + void sort_tree(struct container *c, int depth) { @@ -366,7 +373,8 @@ sort_tree(struct container *c, int depth) for (r = c->child, i = 0; r; r = r->next, i++) a[i] = r; - qsort(a, i, sizeof (struct container *), dateorder); + qsort(a, i, sizeof (struct container *), + rflag && depth < 0 ? reverse_dateorder : dateorder); c->child = a[0]; for (j = 0; j+1 < i; j++) @@ -410,12 +418,13 @@ main(int argc, char *argv[]) optional = 1; - while ((c = getopt(argc, argv, "S:v")) != -1) + while ((c = getopt(argc, argv, "S:rv")) != -1) switch (c) { case 'S': blaze822_loop1(optarg, thread); break; case 'v': vflag = 1; break; + case 'r': rflag = 1; break; default: - fprintf(stderr, "Usage: mthread [-v] [-S dir] [msgs...]\n"); + fprintf(stderr, "Usage: mthread [-v] [-r] [-S dir] [msgs...]\n"); exit(1); } |