2 * Sylpheed -- a GTK+ based, lightweight, and fast e-mail client
3 * Copyright (C) 1999-2001 Hiroyuki Yamamoto
5 * This program is free software; you can redistribute it and/or modify
6 * it under the terms of the GNU General Public License as published by
7 * the Free Software Foundation; either version 2 of the License, or
8 * (at your option) any later version.
10 * This program is distributed in the hope that it will be useful,
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 * GNU General Public License for more details.
15 * You should have received a copy of the GNU General Public License
16 * along with this program; if not, write to the Free Software
17 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
31 #include "procheader.h"
36 FolderItem *filter_get_dest_folder(GSList *fltlist, const gchar *file)
38 static FolderItem *dummy = NULL;
39 FolderItem *dest_folder = NULL;
43 g_return_val_if_fail(file != NULL, NULL);
44 if (!fltlist) return NULL;
46 hlist = procheader_get_header_list_from_file(file);
47 if (!hlist) return NULL;
49 for (cur = fltlist; cur != NULL; cur = cur->next) {
50 filter = (Filter *)cur->data;
51 if (filter_match_condition(filter, hlist)) {
52 if (filter->action == FLT_NOTRECV) {
54 dummy = folder_item_new(NULL, NULL);
55 dummy->path = g_strdup(FILTER_NOT_RECEIVE);
59 dest_folder = folder_find_item_from_path
65 procheader_header_list_destroy(hlist);
70 static gboolean strfind(const gchar *haystack, const gchar *needle)
72 return strstr(haystack, needle) != NULL ? TRUE : FALSE;
75 static gboolean strnotfind(const gchar *haystack, const gchar *needle)
77 return strstr(haystack, needle) != NULL ? FALSE : TRUE;
80 static gboolean strcasefind(const gchar *haystack, const gchar *needle)
82 return strcasestr(haystack, needle) != NULL ? TRUE : FALSE;
85 static gboolean strcasenotfind(const gchar *haystack, const gchar *needle)
87 return strcasestr(haystack, needle) != NULL ? FALSE : TRUE;
90 static gboolean strmatch_regex(const gchar *haystack, const gchar *needle)
96 ret = regcomp(&preg, needle, 0);
97 if (ret != 0) return FALSE;
99 ret = regexec(&preg, haystack, 1, pmatch, 0);
102 if (ret == REG_NOMATCH) return FALSE;
104 if (pmatch[0].rm_so != -1)
110 gboolean filter_match_condition(Filter *filter, GSList *hlist)
113 gboolean (*StrFind1) (const gchar *hs, const gchar *nd);
114 gboolean (*StrFind2) (const gchar *hs, const gchar *nd);
116 g_return_val_if_fail(filter->name1 != NULL, FALSE);
118 if (FLT_IS_REGEX(filter->flag1))
119 StrFind1 = strmatch_regex;
120 else if (FLT_IS_CASE_SENS(filter->flag1))
121 StrFind1 = FLT_IS_CONTAIN(filter->flag1)
122 ? strfind : strnotfind;
124 StrFind1 = FLT_IS_CONTAIN(filter->flag1)
125 ? strcasefind : strcasenotfind;
127 if (FLT_IS_REGEX(filter->flag2))
128 StrFind2 = strmatch_regex;
129 if (FLT_IS_CASE_SENS(filter->flag2))
130 StrFind2 = FLT_IS_CONTAIN(filter->flag2)
131 ? strfind : strnotfind;
133 StrFind2 = FLT_IS_CONTAIN(filter->flag2)
134 ? strcasefind : strcasenotfind;
136 if (filter->cond == FLT_AND) {
137 gboolean match1 = FALSE, match2 = FALSE;
139 /* ignore second condition if not set */
140 if (!filter->name2) match2 = TRUE;
142 for (; hlist != NULL; hlist = hlist->next) {
143 header = hlist->data;
146 procheader_headername_equal(header->name,
148 if (!filter->body1 ||
149 StrFind1(header->body, filter->body1))
153 procheader_headername_equal(header->name,
155 if (!filter->body2 ||
156 StrFind2(header->body, filter->body2))
160 if (match1 && match2) return TRUE;
162 } else if (filter->cond == FLT_OR) {
163 for (; hlist != NULL; hlist = hlist->next) {
164 header = hlist->data;
166 if (procheader_headername_equal(header->name,
168 if (!filter->body1 ||
169 StrFind1(header->body, filter->body1))
172 procheader_headername_equal(header->name,
174 if (!filter->body2 ||
175 StrFind2(header->body, filter->body2))
183 gchar *filter_get_str(Filter *filter)
187 str = g_strdup_printf
188 ("%s\t%s\t%c\t%s\t%s\t%s\t%d\t%d\t%c",
189 filter->name1, filter->body1 ? filter->body1 : "",
190 filter->name2 ? (filter->cond == FLT_AND ? '&' : '|') : ' ',
191 filter->name2 ? filter->name2 : "",
192 filter->body2 ? filter->body2 : "",
193 filter->dest ? filter->dest : "",
194 (guint)filter->flag1, (guint)filter->flag2,
195 filter->action == FLT_MOVE ? 'm' :
196 filter->action == FLT_NOTRECV ? 'n' :
197 filter->action == FLT_DELETE ? 'd' : ' ');
202 #define PARSE_ONE_PARAM(p, srcp) \
204 p = strchr(srcp, '\t'); \
205 if (!p) return NULL; \
210 Filter *filter_read_str(const gchar *str)
214 gchar *name1, *body1, *op, *name2, *body2, *dest;
215 gchar *flag1 = NULL, *flag2 = NULL, *action = NULL;
217 Xstrdup_a(tmp, str, return NULL);
220 PARSE_ONE_PARAM(body1, name1);
221 PARSE_ONE_PARAM(op, body1);
222 PARSE_ONE_PARAM(name2, op);
223 PARSE_ONE_PARAM(body2, name2);
224 PARSE_ONE_PARAM(dest, body2);
225 if (strchr(dest, '\t')) {
228 PARSE_ONE_PARAM(flag1, dest);
229 PARSE_ONE_PARAM(flag2, flag1);
230 PARSE_ONE_PARAM(action, flag2);
231 if ((p = strchr(action, '\t'))) *p = '\0';
234 filter = g_new0(Filter, 1);
235 filter->name1 = *name1 ? g_strdup(name1) : NULL;
236 filter->body1 = *body1 ? g_strdup(body1) : NULL;
237 filter->name2 = *name2 ? g_strdup(name2) : NULL;
238 filter->body2 = *body2 ? g_strdup(body2) : NULL;
239 filter->cond = (*op == '|') ? FLT_OR : FLT_AND;
240 filter->dest = *dest ? g_strdup(dest) : NULL;
242 filter->flag1 = FLT_CONTAIN;
243 filter->flag2 = FLT_CONTAIN;
244 if (flag1) filter->flag1 = (FilterFlag)strtoul(flag1, NULL, 10);
245 if (flag2) filter->flag2 = (FilterFlag)strtoul(flag2, NULL, 10);
247 if (!strcmp2(dest, FILTER_NOT_RECEIVE))
248 filter->action = FLT_NOTRECV;
250 filter->action = FLT_MOVE;
253 case 'm': filter->action = FLT_MOVE; break;
254 case 'n': filter->action = FLT_NOTRECV; break;
255 case 'd': filter->action = FLT_DELETE; break;
256 default: g_warning("Invalid action: `%c'\n", *action);
263 void filter_free(Filter *filter)
267 g_free(filter->name1);
268 g_free(filter->body1);
270 g_free(filter->name2);
271 g_free(filter->body2);
273 g_free(filter->dest);