2009-10-17 17:26:58 +02:00
|
|
|
/* notmuch - Not much of an email program, (just index and search)
|
|
|
|
*
|
|
|
|
* Copyright © 2009 Carl Worth
|
|
|
|
*
|
|
|
|
* This program is free software: you can redistribute it and/or modify
|
|
|
|
* it under the terms of the GNU General Public License as published by
|
|
|
|
* the Free Software Foundation, either version 3 of the License, or
|
|
|
|
* (at your option) any later version.
|
|
|
|
*
|
|
|
|
* This program is distributed in the hope that it will be useful,
|
|
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
|
|
* GNU General Public License for more details.
|
|
|
|
*
|
|
|
|
* You should have received a copy of the GNU General Public License
|
|
|
|
* along with this program. If not, see http://www.gnu.org/licenses/ .
|
|
|
|
*
|
|
|
|
* Author: Carl Worth <cworth@cworth.org>
|
|
|
|
*/
|
|
|
|
|
notmuch: Start actually adding messages to the index.
This is the beginning of the notmuch library as well, with its
interface in notmuch.h. So far we've got create, open, close, and
add_message (all with a notmuch_database prefix).
The current add_message function has already been whittled down from
what we have in notmuch-index-message to add only references,
message-id, and thread-id to the index, (that is---just enough to do
thread-linkage but nothing for full-text searching).
The concept here is to do something quickly so that the user can get
some data into notmuch and start using it. (The most interesting stuff
is then thread-linkage and labels like inbox and unread.) We can
defer the full-text indexing of the body of the messages for later,
(such as in the background while the user is reading mail).
The initial thread-stitching step is still slower than I would like.
We may have to stop using libgmime for this step as its overhead is
not worth it for the simple case of just parsing the message-id,
references, and in-reply-to headers.
2009-10-19 05:56:30 +02:00
|
|
|
#include "notmuch.h"
|
|
|
|
|
2009-10-17 17:26:58 +02:00
|
|
|
#include <stdio.h>
|
|
|
|
#include <stdlib.h>
|
|
|
|
#include <string.h>
|
|
|
|
#include <sys/types.h>
|
|
|
|
#include <sys/stat.h>
|
notmuch: Start actually adding messages to the index.
This is the beginning of the notmuch library as well, with its
interface in notmuch.h. So far we've got create, open, close, and
add_message (all with a notmuch_database prefix).
The current add_message function has already been whittled down from
what we have in notmuch-index-message to add only references,
message-id, and thread-id to the index, (that is---just enough to do
thread-linkage but nothing for full-text searching).
The concept here is to do something quickly so that the user can get
some data into notmuch and start using it. (The most interesting stuff
is then thread-linkage and labels like inbox and unread.) We can
defer the full-text indexing of the body of the messages for later,
(such as in the background while the user is reading mail).
The initial thread-stitching step is still slower than I would like.
We may have to stop using libgmime for this step as its overhead is
not worth it for the simple case of just parsing the message-id,
references, and in-reply-to headers.
2009-10-19 05:56:30 +02:00
|
|
|
#include <sys/time.h>
|
2009-10-17 17:26:58 +02:00
|
|
|
#include <unistd.h>
|
|
|
|
#include <dirent.h>
|
|
|
|
#include <errno.h>
|
|
|
|
|
|
|
|
#include <glib.h>
|
|
|
|
|
|
|
|
#define ARRAY_SIZE(arr) (sizeof (arr) / sizeof (arr[0]))
|
|
|
|
|
|
|
|
typedef int (*command_function_t) (int argc, char *argv[]);
|
|
|
|
|
|
|
|
typedef struct command {
|
|
|
|
const char *name;
|
|
|
|
command_function_t function;
|
|
|
|
const char *usage;
|
|
|
|
} command_t;
|
|
|
|
|
|
|
|
/* Read a line from stdin, without any line-terminator character. The
|
|
|
|
* return value is a newly allocated string. The caller should free()
|
|
|
|
* the string when finished with it.
|
|
|
|
*
|
|
|
|
* This function returns NULL if EOF is encountered before any
|
|
|
|
* characters are input (otherwise it returns those characters).
|
|
|
|
*/
|
|
|
|
char *
|
|
|
|
read_line (void)
|
|
|
|
{
|
|
|
|
char *result = NULL;
|
|
|
|
GError *error = NULL;
|
|
|
|
GIOStatus g_io_status;
|
|
|
|
gsize length;
|
|
|
|
|
|
|
|
GIOChannel *channel = g_io_channel_unix_new (fileno (stdin));
|
|
|
|
|
|
|
|
g_io_status = g_io_channel_read_line (channel, &result,
|
|
|
|
&length, NULL, &error);
|
|
|
|
|
|
|
|
if (g_io_status == EOF)
|
|
|
|
goto DONE;
|
|
|
|
|
|
|
|
if (g_io_status != G_IO_STATUS_NORMAL) {
|
|
|
|
fprintf(stderr, "Read error: %s\n", error->message);
|
|
|
|
exit (1);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (length && result[length - 1] == '\n')
|
|
|
|
result[length - 1] = '\0';
|
|
|
|
|
|
|
|
DONE:
|
|
|
|
g_io_channel_unref (channel);
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
notmuch: Start actually adding messages to the index.
This is the beginning of the notmuch library as well, with its
interface in notmuch.h. So far we've got create, open, close, and
add_message (all with a notmuch_database prefix).
The current add_message function has already been whittled down from
what we have in notmuch-index-message to add only references,
message-id, and thread-id to the index, (that is---just enough to do
thread-linkage but nothing for full-text searching).
The concept here is to do something quickly so that the user can get
some data into notmuch and start using it. (The most interesting stuff
is then thread-linkage and labels like inbox and unread.) We can
defer the full-text indexing of the body of the messages for later,
(such as in the background while the user is reading mail).
The initial thread-stitching step is still slower than I would like.
We may have to stop using libgmime for this step as its overhead is
not worth it for the simple case of just parsing the message-id,
references, and in-reply-to headers.
2009-10-19 05:56:30 +02:00
|
|
|
typedef struct {
|
|
|
|
int messages_total;
|
|
|
|
int count;
|
|
|
|
int count_last;
|
|
|
|
struct timeval tv_start;
|
|
|
|
struct timeval tv_last;
|
|
|
|
} add_files_state_t;
|
|
|
|
|
|
|
|
/* Compute the number of seconds elapsed from start to end. */
|
|
|
|
double
|
|
|
|
tv_elapsed (struct timeval start, struct timeval end)
|
|
|
|
{
|
|
|
|
return ((end.tv_sec - start.tv_sec) +
|
|
|
|
(end.tv_usec - start.tv_usec) / 1e6);
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
print_formatted_seconds (double seconds)
|
|
|
|
{
|
|
|
|
int hours;
|
|
|
|
int minutes;
|
|
|
|
|
|
|
|
if (seconds > 3600) {
|
|
|
|
hours = (int) seconds / 3600;
|
|
|
|
printf ("%d:", hours);
|
|
|
|
seconds -= hours * 3600;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (seconds > 60)
|
|
|
|
minutes = (int) seconds / 60;
|
|
|
|
else
|
|
|
|
minutes = 0;
|
|
|
|
|
|
|
|
printf ("%02d:", minutes);
|
|
|
|
seconds -= minutes * 60;
|
|
|
|
|
|
|
|
printf ("%02d", (int) seconds);
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
add_files_print_progress (add_files_state_t *state)
|
|
|
|
{
|
|
|
|
struct timeval tv_now;
|
|
|
|
double ratio_complete;
|
|
|
|
double elapsed_current, rate_current;
|
|
|
|
double elapsed_overall;
|
|
|
|
|
|
|
|
gettimeofday (&tv_now, NULL);
|
|
|
|
|
|
|
|
ratio_complete = (double) state->count / state->messages_total;
|
|
|
|
elapsed_current = tv_elapsed (state->tv_last, tv_now);
|
|
|
|
rate_current = (state->count - state->count_last) / elapsed_current;
|
|
|
|
elapsed_overall = tv_elapsed (state->tv_start, tv_now);
|
|
|
|
|
|
|
|
printf ("Added %d messages at %d messages/sec. ",
|
|
|
|
state->count, (int) rate_current);
|
|
|
|
print_formatted_seconds (elapsed_overall);
|
|
|
|
printf ("/");
|
|
|
|
print_formatted_seconds (elapsed_overall / ratio_complete);
|
|
|
|
printf (" elapsed (%.2f%%). \r", 100 * ratio_complete);
|
|
|
|
|
|
|
|
fflush (stdout);
|
|
|
|
|
|
|
|
state->tv_last = tv_now;
|
|
|
|
state->count_last = state->count;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Recursively find all regular files in 'path' and add them to the
|
|
|
|
* database. */
|
|
|
|
void
|
|
|
|
add_files (notmuch_database_t *notmuch, const char *path,
|
|
|
|
add_files_state_t *state)
|
|
|
|
{
|
|
|
|
DIR *dir;
|
|
|
|
struct dirent *entry, *e;
|
|
|
|
int entry_length;
|
|
|
|
int err;
|
|
|
|
char *next;
|
|
|
|
struct stat st;
|
|
|
|
|
|
|
|
dir = opendir (path);
|
|
|
|
|
|
|
|
if (dir == NULL) {
|
|
|
|
fprintf (stderr, "Warning: failed to open directory %s: %s\n",
|
|
|
|
path, strerror (errno));
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
entry_length = offsetof (struct dirent, d_name) +
|
|
|
|
pathconf (path, _PC_NAME_MAX) + 1;
|
|
|
|
entry = malloc (entry_length);
|
|
|
|
|
|
|
|
while (1) {
|
|
|
|
err = readdir_r (dir, entry, &e);
|
|
|
|
if (err) {
|
|
|
|
fprintf (stderr, "Error reading directory: %s\n",
|
|
|
|
strerror (errno));
|
|
|
|
free (entry);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (e == NULL)
|
|
|
|
break;
|
|
|
|
|
|
|
|
/* Ignore special directories to avoid infinite recursion.
|
|
|
|
* Also ignore the .notmuch directory.
|
|
|
|
*/
|
|
|
|
/* XXX: Eventually we'll want more sophistication to let the
|
|
|
|
* user specify files to be ignored. */
|
|
|
|
if (strcmp (entry->d_name, ".") == 0 ||
|
|
|
|
strcmp (entry->d_name, "..") == 0 ||
|
|
|
|
strcmp (entry->d_name, ".notmuch") ==0)
|
|
|
|
{
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
next = g_strdup_printf ("%s/%s", path, entry->d_name);
|
|
|
|
|
|
|
|
stat (next, &st);
|
|
|
|
|
|
|
|
if (S_ISREG (st.st_mode)) {
|
|
|
|
notmuch_database_add_message (notmuch, next);
|
|
|
|
state->count++;
|
|
|
|
if (state->count % 1000 == 0)
|
|
|
|
add_files_print_progress (state);
|
|
|
|
} else if (S_ISDIR (st.st_mode)) {
|
|
|
|
add_files (notmuch, next, state);
|
|
|
|
}
|
|
|
|
|
|
|
|
free (next);
|
|
|
|
}
|
|
|
|
|
|
|
|
free (entry);
|
|
|
|
|
|
|
|
closedir (dir);
|
|
|
|
}
|
|
|
|
|
2009-10-17 17:26:58 +02:00
|
|
|
/* Recursively count all regular files in path and all sub-direcotries
|
|
|
|
* of path. The result is added to *count (which should be
|
|
|
|
* initialized to zero by the top-level caller before calling
|
|
|
|
* count_files). */
|
|
|
|
void
|
|
|
|
count_files (const char *path, int *count)
|
|
|
|
{
|
|
|
|
DIR *dir;
|
|
|
|
struct dirent *entry, *e;
|
|
|
|
int entry_length;
|
|
|
|
int err;
|
|
|
|
char *next;
|
|
|
|
struct stat st;
|
|
|
|
|
|
|
|
dir = opendir (path);
|
|
|
|
|
|
|
|
if (dir == NULL) {
|
|
|
|
fprintf (stderr, "Warning: failed to open directory %s: %s\n",
|
|
|
|
path, strerror (errno));
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
entry_length = offsetof (struct dirent, d_name) +
|
|
|
|
pathconf (path, _PC_NAME_MAX) + 1;
|
|
|
|
entry = malloc (entry_length);
|
|
|
|
|
|
|
|
while (1) {
|
|
|
|
err = readdir_r (dir, entry, &e);
|
|
|
|
if (err) {
|
|
|
|
fprintf (stderr, "Error reading directory: %s\n",
|
|
|
|
strerror (errno));
|
|
|
|
free (entry);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (e == NULL)
|
|
|
|
break;
|
|
|
|
|
2009-10-19 21:52:46 +02:00
|
|
|
/* Ignore special directories to avoid infinite recursion.
|
|
|
|
* Also ignore the .notmuch directory.
|
|
|
|
*/
|
|
|
|
/* XXX: Eventually we'll want more sophistication to let the
|
|
|
|
* user specify files to be ignored. */
|
2009-10-17 17:26:58 +02:00
|
|
|
if (strcmp (entry->d_name, ".") == 0 ||
|
2009-10-19 21:52:46 +02:00
|
|
|
strcmp (entry->d_name, "..") == 0 ||
|
|
|
|
strcmp (entry->d_name, ".notmuch") == 0)
|
2009-10-17 17:26:58 +02:00
|
|
|
{
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
next = g_strdup_printf ("%s/%s", path, entry->d_name);
|
|
|
|
|
|
|
|
stat (next, &st);
|
|
|
|
|
notmuch: Start actually adding messages to the index.
This is the beginning of the notmuch library as well, with its
interface in notmuch.h. So far we've got create, open, close, and
add_message (all with a notmuch_database prefix).
The current add_message function has already been whittled down from
what we have in notmuch-index-message to add only references,
message-id, and thread-id to the index, (that is---just enough to do
thread-linkage but nothing for full-text searching).
The concept here is to do something quickly so that the user can get
some data into notmuch and start using it. (The most interesting stuff
is then thread-linkage and labels like inbox and unread.) We can
defer the full-text indexing of the body of the messages for later,
(such as in the background while the user is reading mail).
The initial thread-stitching step is still slower than I would like.
We may have to stop using libgmime for this step as its overhead is
not worth it for the simple case of just parsing the message-id,
references, and in-reply-to headers.
2009-10-19 05:56:30 +02:00
|
|
|
if (S_ISREG (st.st_mode)) {
|
2009-10-17 17:26:58 +02:00
|
|
|
*count = *count + 1;
|
notmuch: Start actually adding messages to the index.
This is the beginning of the notmuch library as well, with its
interface in notmuch.h. So far we've got create, open, close, and
add_message (all with a notmuch_database prefix).
The current add_message function has already been whittled down from
what we have in notmuch-index-message to add only references,
message-id, and thread-id to the index, (that is---just enough to do
thread-linkage but nothing for full-text searching).
The concept here is to do something quickly so that the user can get
some data into notmuch and start using it. (The most interesting stuff
is then thread-linkage and labels like inbox and unread.) We can
defer the full-text indexing of the body of the messages for later,
(such as in the background while the user is reading mail).
The initial thread-stitching step is still slower than I would like.
We may have to stop using libgmime for this step as its overhead is
not worth it for the simple case of just parsing the message-id,
references, and in-reply-to headers.
2009-10-19 05:56:30 +02:00
|
|
|
if (*count % 1000 == 0) {
|
|
|
|
printf ("Found %d files so far.\r", *count);
|
|
|
|
fflush (stdout);
|
|
|
|
}
|
|
|
|
} else if (S_ISDIR (st.st_mode)) {
|
2009-10-17 17:26:58 +02:00
|
|
|
count_files (next, count);
|
|
|
|
}
|
|
|
|
|
|
|
|
free (next);
|
|
|
|
}
|
|
|
|
|
|
|
|
free (entry);
|
|
|
|
|
|
|
|
closedir (dir);
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
setup_command (int argc, char *argv[])
|
|
|
|
{
|
notmuch: Start actually adding messages to the index.
This is the beginning of the notmuch library as well, with its
interface in notmuch.h. So far we've got create, open, close, and
add_message (all with a notmuch_database prefix).
The current add_message function has already been whittled down from
what we have in notmuch-index-message to add only references,
message-id, and thread-id to the index, (that is---just enough to do
thread-linkage but nothing for full-text searching).
The concept here is to do something quickly so that the user can get
some data into notmuch and start using it. (The most interesting stuff
is then thread-linkage and labels like inbox and unread.) We can
defer the full-text indexing of the body of the messages for later,
(such as in the background while the user is reading mail).
The initial thread-stitching step is still slower than I would like.
We may have to stop using libgmime for this step as its overhead is
not worth it for the simple case of just parsing the message-id,
references, and in-reply-to headers.
2009-10-19 05:56:30 +02:00
|
|
|
notmuch_database_t *notmuch;
|
2009-10-17 17:26:58 +02:00
|
|
|
char *mail_directory;
|
|
|
|
int count;
|
notmuch: Start actually adding messages to the index.
This is the beginning of the notmuch library as well, with its
interface in notmuch.h. So far we've got create, open, close, and
add_message (all with a notmuch_database prefix).
The current add_message function has already been whittled down from
what we have in notmuch-index-message to add only references,
message-id, and thread-id to the index, (that is---just enough to do
thread-linkage but nothing for full-text searching).
The concept here is to do something quickly so that the user can get
some data into notmuch and start using it. (The most interesting stuff
is then thread-linkage and labels like inbox and unread.) We can
defer the full-text indexing of the body of the messages for later,
(such as in the background while the user is reading mail).
The initial thread-stitching step is still slower than I would like.
We may have to stop using libgmime for this step as its overhead is
not worth it for the simple case of just parsing the message-id,
references, and in-reply-to headers.
2009-10-19 05:56:30 +02:00
|
|
|
add_files_state_t add_files_state;
|
|
|
|
double elapsed;
|
2009-10-17 17:26:58 +02:00
|
|
|
|
|
|
|
printf ("Welcome to notmuch!\n\n");
|
|
|
|
|
|
|
|
printf ("The goal of notmuch is to help you manage and search your collection of\n"
|
|
|
|
"email, and to efficiently keep up with the flow of email as it comes in.\n\n");
|
|
|
|
|
|
|
|
printf ("Notmuch needs to know the top-level directory of your email archive,\n"
|
|
|
|
"(where you already have mail stored and where messages will be delivered\n"
|
|
|
|
"in the future). This directory can contain any number of sub-directories\n"
|
|
|
|
"but the only files it contains should be individual email messages.\n"
|
|
|
|
"Either maildir or mh format directories are fine, but you will want to\n"
|
|
|
|
"move away any auxiliary files maintained by other email programs.\n\n");
|
|
|
|
|
|
|
|
printf ("Mail storage that uses mbox format, (where one mbox file contains many\n"
|
|
|
|
"messages), will not work with notmuch. If that's how your mail is currently\n"
|
|
|
|
"stored, we recommend you first convert it to maildir format with a utility\n"
|
|
|
|
"such as mb2md. In that case, press Control-C now and run notmuch again\n"
|
|
|
|
"once the conversion is complete.\n\n");
|
|
|
|
|
|
|
|
printf ("Top-level mail directory [~/mail]: ");
|
|
|
|
fflush (stdout);
|
|
|
|
|
|
|
|
mail_directory = read_line ();
|
|
|
|
|
|
|
|
if (mail_directory == NULL || strlen (mail_directory) == 0) {
|
|
|
|
char *home;
|
|
|
|
|
|
|
|
if (mail_directory)
|
|
|
|
free (mail_directory);
|
|
|
|
|
|
|
|
home = getenv ("HOME");
|
|
|
|
if (!home) {
|
|
|
|
fprintf (stderr, "Error: No mail directory provided HOME environment variable is not set.\n");
|
|
|
|
fprintf (stderr, "Cowardly refusing to just guess where your mail might be.\n");
|
|
|
|
exit (1);
|
|
|
|
}
|
|
|
|
|
|
|
|
mail_directory = g_strdup_printf ("%s/mail", home);
|
|
|
|
}
|
|
|
|
|
notmuch: Start actually adding messages to the index.
This is the beginning of the notmuch library as well, with its
interface in notmuch.h. So far we've got create, open, close, and
add_message (all with a notmuch_database prefix).
The current add_message function has already been whittled down from
what we have in notmuch-index-message to add only references,
message-id, and thread-id to the index, (that is---just enough to do
thread-linkage but nothing for full-text searching).
The concept here is to do something quickly so that the user can get
some data into notmuch and start using it. (The most interesting stuff
is then thread-linkage and labels like inbox and unread.) We can
defer the full-text indexing of the body of the messages for later,
(such as in the background while the user is reading mail).
The initial thread-stitching step is still slower than I would like.
We may have to stop using libgmime for this step as its overhead is
not worth it for the simple case of just parsing the message-id,
references, and in-reply-to headers.
2009-10-19 05:56:30 +02:00
|
|
|
notmuch = notmuch_database_create (mail_directory);
|
|
|
|
if (notmuch == NULL) {
|
|
|
|
fprintf (stderr, "Failed to create new notmuch database at %s\n",
|
|
|
|
mail_directory);
|
|
|
|
free (mail_directory);
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
2009-10-17 17:26:58 +02:00
|
|
|
printf ("OK. Let's take a look at the mail we can find in the directory\n");
|
|
|
|
printf ("%s ...\n", mail_directory);
|
|
|
|
|
|
|
|
count = 0;
|
|
|
|
count_files (mail_directory, &count);
|
|
|
|
|
notmuch: Start actually adding messages to the index.
This is the beginning of the notmuch library as well, with its
interface in notmuch.h. So far we've got create, open, close, and
add_message (all with a notmuch_database prefix).
The current add_message function has already been whittled down from
what we have in notmuch-index-message to add only references,
message-id, and thread-id to the index, (that is---just enough to do
thread-linkage but nothing for full-text searching).
The concept here is to do something quickly so that the user can get
some data into notmuch and start using it. (The most interesting stuff
is then thread-linkage and labels like inbox and unread.) We can
defer the full-text indexing of the body of the messages for later,
(such as in the background while the user is reading mail).
The initial thread-stitching step is still slower than I would like.
We may have to stop using libgmime for this step as its overhead is
not worth it for the simple case of just parsing the message-id,
references, and in-reply-to headers.
2009-10-19 05:56:30 +02:00
|
|
|
printf ("Found %d total files. That's not much mail.\n\n", count);
|
|
|
|
|
|
|
|
printf ("Next, we'll inspect the messages and create a database of threads:\n");
|
|
|
|
|
|
|
|
add_files_state.messages_total = count;
|
|
|
|
add_files_state.count = 0;
|
|
|
|
add_files_state.count_last = 0;
|
|
|
|
gettimeofday (&add_files_state.tv_start, NULL);
|
|
|
|
add_files_state.tv_last = add_files_state.tv_start;
|
|
|
|
|
|
|
|
add_files (notmuch, mail_directory, &add_files_state);
|
|
|
|
|
|
|
|
gettimeofday (&add_files_state.tv_last, NULL);
|
|
|
|
elapsed = tv_elapsed (add_files_state.tv_start,
|
|
|
|
add_files_state.tv_last);
|
|
|
|
printf ("Added %d total messages in ", add_files_state.count);
|
|
|
|
print_formatted_seconds (elapsed);
|
|
|
|
printf (" (%d messages/sec.). \n", (int) (add_files_state.count / elapsed));
|
|
|
|
|
|
|
|
notmuch_database_close (notmuch);
|
2009-10-17 17:26:58 +02:00
|
|
|
|
|
|
|
free (mail_directory);
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
search_command (int argc, char *argv[])
|
|
|
|
{
|
|
|
|
fprintf (stderr, "Error: search is not implemented yet.\n");
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
show_command (int argc, char *argv[])
|
|
|
|
{
|
|
|
|
fprintf (stderr, "Error: show-thread is not implemented yet.\n");
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
command_t commands[] = {
|
|
|
|
{ "setup", setup_command,
|
|
|
|
"Interactively setup notmuch for first use (no arguments).\n"
|
|
|
|
"\t\tInvoking notmuch with no command argument will run setup if\n"
|
|
|
|
"\t\the setup command has not previously been completed." },
|
|
|
|
{ "search", search_command,
|
|
|
|
"Search for threads matching the given search terms." },
|
|
|
|
{ "show", show_command,
|
|
|
|
"Show the thread with the given thread ID (see 'search')." }
|
|
|
|
};
|
|
|
|
|
|
|
|
void
|
|
|
|
usage (void)
|
|
|
|
{
|
|
|
|
command_t *command;
|
|
|
|
int i;
|
|
|
|
|
|
|
|
fprintf (stderr, "Usage: notmuch <command> [args...]\n");
|
|
|
|
fprintf (stderr, "\n");
|
|
|
|
fprintf (stderr, "Where <command> is one of the following:\n");
|
|
|
|
fprintf (stderr, "\n");
|
|
|
|
|
|
|
|
for (i = 0; i < ARRAY_SIZE (commands); i++) {
|
|
|
|
command = &commands[i];
|
|
|
|
|
|
|
|
fprintf (stderr, "\t%s\t%s\n\n", command->name, command->usage);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
main (int argc, char *argv[])
|
|
|
|
{
|
|
|
|
command_t *command;
|
|
|
|
int i;
|
|
|
|
|
|
|
|
if (argc == 1)
|
|
|
|
return setup_command (0, NULL);
|
|
|
|
|
|
|
|
for (i = 0; i < ARRAY_SIZE (commands); i++) {
|
|
|
|
command = &commands[i];
|
|
|
|
|
|
|
|
if (strcmp (argv[1], command->name) == 0)
|
|
|
|
return (command->function) (argc - 2, &argv[2]);
|
|
|
|
}
|
|
|
|
|
|
|
|
fprintf (stderr, "Error: Unknown command '%s'\n\n", argv[1]);
|
|
|
|
usage ();
|
|
|
|
exit (1);
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|