2 #include "string-util.h"
4 #include "hex-escape.h"
6 #define TAG_OP_LIST_INITIAL_SIZE 10
8 struct _tag_operation_t {
13 struct _tag_op_list_t {
19 static tag_parse_status_t
20 line_error (tag_parse_status_t status,
22 const char *format, ...)
26 va_start (va_args, format);
28 fprintf (stderr, status < 0 ? "Error: " : "Warning: ");
29 vfprintf (stderr, format, va_args);
30 fprintf (stderr, " [%s]\n", line);
38 illegal_tag (const char *tag, bool remove)
40 if (*tag == '\0' && ! remove)
41 return "empty tag forbidden";
43 /* This disallows adding tags starting with "-", in particular the
44 * non-removable tag "-" and enables notmuch tag to take long
45 * options more easily.
48 if (*tag == '-' && ! remove)
49 return "tag starting with '-' forbidden";
55 parse_tag_line (void *ctx, char *line,
58 tag_op_list_t *tag_ops)
63 tag_parse_status_t ret = TAG_PARSE_SUCCESS;
67 line_for_error = talloc_strdup (ctx, line);
68 if (line_for_error == NULL) {
69 fprintf (stderr, "Error: out of memory\n");
70 return TAG_PARSE_OUT_OF_MEMORY;
73 /* remove leading space */
74 while (*tok == ' ' || *tok == '\t')
77 /* Skip empty and comment lines. */
78 if (*tok == '\0' || *tok == '#') {
79 ret = TAG_PARSE_SKIPPED;
83 tag_op_list_reset (tag_ops);
86 while ((tok = strtok_len (tok + tok_len, " ", &tok_len)) != NULL) {
90 /* Optional explicit end of tags marker. */
91 if (tok_len == 2 && strncmp (tok, "--", tok_len) == 0) {
92 tok = strtok_len (tok + tok_len, " ", &tok_len);
94 ret = line_error (TAG_PARSE_INVALID, line_for_error,
95 "no query string after --");
101 /* Implicit end of tags. */
102 if (*tok != '-' && *tok != '+')
105 /* If tag is terminated by NUL, there's no query string. */
106 if (*(tok + tok_len) == '\0') {
107 ret = line_error (TAG_PARSE_INVALID, line_for_error,
112 /* Terminate, and start next token after terminator. */
113 *(tok + tok_len++) = '\0';
115 remove = (*tok == '-');
118 /* Maybe refuse illegal tags. */
119 if (! (flags & TAG_FLAG_BE_GENEROUS)) {
120 const char *msg = illegal_tag (tag, remove);
122 ret = line_error (TAG_PARSE_INVALID, line_for_error, msg);
128 if (hex_decode_inplace (tag) != HEX_SUCCESS) {
129 ret = line_error (TAG_PARSE_INVALID, line_for_error,
130 "hex decoding of tag %s failed", tag);
134 if (tag_op_list_append (tag_ops, tag, remove)) {
135 ret = line_error (TAG_PARSE_OUT_OF_MEMORY, line_for_error,
142 /* use a different error message for testing */
143 ret = line_error (TAG_PARSE_INVALID, line_for_error,
144 "missing query string");
148 /* tok now points to the query string */
152 talloc_free (line_for_error);
157 parse_tag_command_line (void *ctx, int argc, char **argv,
158 char **query_str, tag_op_list_t *tag_ops)
162 for (i = 0; i < argc; i++) {
163 if (strcmp (argv[i], "--") == 0) {
168 if (argv[i][0] != '+' && argv[i][0] != '-')
171 bool is_remove = argv[i][0] == '-';
174 msg = illegal_tag (argv[i] + 1, is_remove);
176 fprintf (stderr, "Error: %s\n", msg);
177 return TAG_PARSE_INVALID;
180 tag_op_list_append (tag_ops, argv[i] + 1, is_remove);
183 *query_str = query_string_from_args (ctx, argc - i, &argv[i]);
185 if (*query_str == NULL) {
186 fprintf (stderr, "Out of memory.\n");
187 return TAG_PARSE_OUT_OF_MEMORY;
190 return TAG_PARSE_SUCCESS;
195 message_error (notmuch_message_t *message,
196 notmuch_status_t status,
197 const char *format, ...)
201 va_start (va_args, format);
203 vfprintf (stderr, format, va_args);
204 fprintf (stderr, "Message-ID: %s\n", notmuch_message_get_message_id (message));
205 fprintf (stderr, "Status: %s\n", notmuch_status_to_string (status));
211 makes_changes (notmuch_message_t *message,
217 notmuch_tags_t *tags;
218 bool changes = false;
220 /* First, do we delete an existing tag? */
221 for (tags = notmuch_message_get_tags (message);
222 ! changes && notmuch_tags_valid (tags);
223 notmuch_tags_move_to_next (tags)) {
224 const char *cur_tag = notmuch_tags_get (tags);
225 int last_op = (flags & TAG_FLAG_REMOVE_ALL) ? -1 : 0;
227 /* scan backwards to get last operation */
231 if (strcmp (cur_tag, list->ops[i].tag) == 0) {
232 last_op = list->ops[i].remove ? -1 : 1;
237 changes = (last_op == -1);
239 notmuch_tags_destroy (tags);
244 /* Now check for adding new tags */
245 for (i = 0; i < list->count; i++) {
248 if (list->ops[i].remove)
251 for (tags = notmuch_message_get_tags (message);
252 notmuch_tags_valid (tags);
253 notmuch_tags_move_to_next (tags)) {
254 const char *cur_tag = notmuch_tags_get (tags);
255 if (strcmp (cur_tag, list->ops[i].tag) == 0) {
260 notmuch_tags_destroy (tags);
262 /* the following test is conservative,
263 * in the sense it ignores cases like +foo ... -foo
264 * but this is OK from a correctness point of view
274 tag_op_list_apply (notmuch_message_t *message,
279 notmuch_status_t status = 0;
280 tag_operation_t *tag_ops = list->ops;
282 if (! (flags & TAG_FLAG_PRE_OPTIMIZED) && ! makes_changes (message, list, flags))
283 return NOTMUCH_STATUS_SUCCESS;
285 status = notmuch_message_freeze (message);
287 message_error (message, status, "freezing message");
291 if (flags & TAG_FLAG_REMOVE_ALL) {
292 status = notmuch_message_remove_all_tags (message);
294 message_error (message, status, "removing all tags");
299 for (i = 0; i < list->count; i++) {
300 if (tag_ops[i].remove) {
301 status = notmuch_message_remove_tag (message, tag_ops[i].tag);
303 message_error (message, status, "removing tag %s", tag_ops[i].tag);
307 status = notmuch_message_add_tag (message, tag_ops[i].tag);
309 message_error (message, status, "adding tag %s", tag_ops[i].tag);
316 status = notmuch_message_thaw (message);
318 message_error (message, status, "thawing message");
323 if (flags & TAG_FLAG_MAILDIR_SYNC) {
324 status = notmuch_message_tags_to_maildir_flags (message);
326 message_error (message, status, "syncing tags to maildir");
331 return NOTMUCH_STATUS_SUCCESS;
336 /* Array of tagging operations (add or remove. Size will be increased
340 tag_op_list_create (void *ctx)
344 list = talloc (ctx, tag_op_list_t);
348 list->size = TAG_OP_LIST_INITIAL_SIZE;
351 list->ops = talloc_array (list, tag_operation_t, list->size);
352 if (list->ops == NULL)
360 tag_op_list_append (tag_op_list_t *list,
364 /* Make room if current array is full. This should be a fairly
365 * rare case, considering the initial array size.
368 if (list->count == list->size) {
370 list->ops = talloc_realloc (list, list->ops, tag_operation_t,
372 if (list->ops == NULL) {
373 fprintf (stderr, "Out of memory.\n");
378 /* add the new operation */
380 list->ops[list->count].tag = tag;
381 list->ops[list->count].remove = remove;
387 * Is the i'th tag operation a remove?
391 tag_op_list_isremove (const tag_op_list_t *list, size_t i)
393 assert (i < list->count);
394 return list->ops[i].remove;
398 * Reset a list to contain no operations
402 tag_op_list_reset (tag_op_list_t *list)
408 * Return the number of operations in a list
412 tag_op_list_size (const tag_op_list_t *list)
418 * return the i'th tag in the list
422 tag_op_list_tag (const tag_op_list_t *list, size_t i)
424 assert (i < list->count);
425 return list->ops[i].tag;