1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
|
/*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2 of the License, or (at your option) version 3.
*
* 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
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with the program; if not, see <http://www.gnu.org/licenses/>
*
*
* Authors:
* Not Zed <notzed@lostzed.mmc.com.au>
* Jeffrey Stedfast <fejj@ximian.com>
*
* Copyright (C) 1999-2008 Novell, Inc. (www.novell.com)
*
*/
#ifdef HAVE_CONFIG_H
#include <config.h>
#endif
#include <string.h>
#include <sys/types.h>
#include <regex.h>
#include <gtk/gtk.h>
#include <glib/gi18n.h>
#include "filter-input.h"
#include "libedataserver/e-sexp.h"
#include "e-util/e-error.h"
#define d(x)
static gboolean validate (FilterElement *fe);
static int input_eq (FilterElement *fe, FilterElement *cm);
static void xml_create (FilterElement *fe, xmlNodePtr node);
static xmlNodePtr xml_encode (FilterElement *fe);
static int xml_decode (FilterElement *fe, xmlNodePtr node);
static GtkWidget *get_widget (FilterElement *fe);
static void build_code (FilterElement *fe, GString *out, struct _FilterPart *ff);
static void format_sexp (FilterElement *, GString *);
static void filter_input_class_init (FilterInputClass *klass);
static void filter_input_init (FilterInput *fi);
static void filter_input_finalise (GObject *obj);
static FilterElementClass *parent_class = NULL;
GType
filter_input_get_type (void)
{
static GType type = 0;
if (!type) {
static const GTypeInfo info = {
sizeof (FilterInputClass),
NULL, /* base_class_init */
NULL, /* base_class_finalize */
(GClassInitFunc) filter_input_class_init,
NULL, /* class_finalize */
NULL, /* class_data */
sizeof (FilterInput),
0, /* n_preallocs */
(GInstanceInitFunc) filter_input_init,
};
type = g_type_register_static (FILTER_TYPE_ELEMENT, "FilterInput", &info, 0);
}
return type;
}
static void
filter_input_class_init (FilterInputClass *klass)
{
GObjectClass *object_class = G_OBJECT_CLASS (klass);
FilterElementClass *fe_class = FILTER_ELEMENT_CLASS (klass);
parent_class = g_type_class_ref (FILTER_TYPE_ELEMENT);
object_class->finalize = filter_input_finalise;
/* override methods */
fe_class->validate = validate;
fe_class->eq = input_eq;
fe_class->xml_create = xml_create;
fe_class->xml_encode = xml_encode;
fe_class->xml_decode = xml_decode;
fe_class->get_widget = get_widget;
fe_class->build_code = build_code;
fe_class->format_sexp = format_sexp;
}
static void
filter_input_init (FilterInput *fi)
{
fi->values = g_list_prepend (NULL, g_strdup (""));
}
static void
filter_input_finalise (GObject *obj)
{
FilterInput *fi = (FilterInput *) obj;
xmlFree (fi->type);
g_list_foreach (fi->values, (GFunc)g_free, NULL);
g_list_free (fi->values);
G_OBJECT_CLASS (parent_class)->finalize (obj);
}
/**
* filter_input_new:
*
* Create a new FilterInput object.
*
* Return value: A new #FilterInput object.
**/
FilterInput *
filter_input_new (void)
{
return (FilterInput *) g_object_new (FILTER_TYPE_INPUT, NULL, NULL);
}
FilterInput *
filter_input_new_type_name (const char *type)
{
FilterInput *fi;
fi = filter_input_new ();
fi->type = (char *)xmlStrdup ((xmlChar *)type);
d(printf("new type %s = %p\n", type, fi));
return fi;
}
void
filter_input_set_value (FilterInput *fi, const char *value)
{
GList *l;
d(printf("set_value '%s'\n", value));
l = fi->values;
while (l) {
g_free (l->data);
l = g_list_next (l);
}
g_list_free (fi->values);
fi->values = g_list_append (NULL, g_strdup (value));
}
static gboolean
validate (FilterElement *fe)
{
FilterInput *fi = (FilterInput *)fe;
gboolean valid = TRUE;
if (fi->values && !strcmp (fi->type, "regex")) {
const char *pattern;
regex_t regexpat;
int regerr;
pattern = fi->values->data;
if ((regerr = regcomp (®expat, pattern, REG_EXTENDED | REG_NEWLINE | REG_ICASE))) {
size_t reglen;
char *regmsg;
/* regerror gets called twice to get the full error string
length to do proper posix error reporting */
reglen = regerror (regerr, ®expat, 0, 0);
regmsg = g_malloc0 (reglen + 1);
regerror (regerr, ®expat, regmsg, reglen);
/* FIXME: FilterElement should probably have a
GtkWidget member pointing to the value gotten with
::get_widget() so that we can get the parent window
here. */
e_error_run(NULL, "filter:bad-regexp", pattern, regmsg, NULL);
g_free (regmsg);
valid = FALSE;
}
regfree (®expat);
}
return valid;
}
static int
list_eq (GList *al, GList *bl)
{
int truth = TRUE;
while (truth && al && bl) {
truth = strcmp ((char *) al->data, (char *) bl->data) == 0;
al = al->next;
bl = bl->next;
}
return truth && al == NULL && bl == NULL;
}
static int
input_eq (FilterElement *fe, FilterElement *cm)
{
FilterInput *fi = (FilterInput *)fe, *ci = (FilterInput *)cm;
return FILTER_ELEMENT_CLASS (parent_class)->eq (fe, cm)
&& strcmp (fi->type, ci->type) == 0
&& list_eq (fi->values, ci->values);
}
static void
xml_create (FilterElement *fe, xmlNodePtr node)
{
/* parent implementation */
FILTER_ELEMENT_CLASS (parent_class)->xml_create (fe, node);
}
static xmlNodePtr
xml_encode (FilterElement *fe)
{
xmlNodePtr value;
GList *l;
FilterInput *fi = (FilterInput *)fe;
char *type;
type = fi->type ? fi->type : "string";
d(printf ("Encoding %s as xml\n", type));
value = xmlNewNode (NULL, (const unsigned char *)"value");
xmlSetProp (value, (const unsigned char *)"name", (unsigned char *)fe->name);
xmlSetProp (value, (const unsigned char *)"type", (unsigned char *)type);
l = fi->values;
while (l) {
xmlNodePtr cur;
xmlChar *str = l->data;
cur = xmlNewChild (value, NULL, (unsigned char *)type, NULL);
str = xmlEncodeEntitiesReentrant (NULL, str);
xmlNodeSetContent (cur, str);
xmlFree (str);
l = l->next;
}
return value;
}
static int
xml_decode (FilterElement *fe, xmlNodePtr node)
{
FilterInput *fi = (FilterInput *)fe;
char *name, *str, *type;
xmlNodePtr n;
GList *l;
l = fi->values;
while (l) {
g_free (l->data);
l = l->next;
}
g_list_free (fi->values);
fi->values = NULL;
name = (char *)xmlGetProp (node, (const unsigned char *)"name");
type = (char *)xmlGetProp (node, (const unsigned char *)"type");
d(printf("Decoding %s from xml %p\n", type, fe));
d(printf ("Name = %s\n", name));
xmlFree (fe->name);
fe->name = name;
xmlFree (fi->type);
fi->type = type;
n = node->children;
while (n) {
if (!strcmp ((char *)n->name, type)) {
if (!(str = (char *)xmlNodeGetContent (n)))
str = (char *)xmlStrdup ((const unsigned char *)"");
d(printf (" '%s'\n", str));
fi->values = g_list_append (fi->values, g_strdup (str));
xmlFree (str);
} else if (n->type == XML_ELEMENT_NODE) {
g_warning ("Unknown node type '%s' encountered decoding a %s\n", n->name, type);
}
n = n->next;
}
return 0;
}
static void
entry_changed (GtkEntry *entry, FilterElement *fe)
{
FilterInput *fi = (FilterInput *) fe;
const char *new;
GList *l;
new = gtk_entry_get_text (entry);
d(printf("entry_changed '%s'\n", new));
/* NOTE: entry only supports a single value ... */
l = fi->values;
while (l) {
g_free (l->data);
l = l->next;
}
g_list_free (fi->values);
fi->values = g_list_append (NULL, g_strdup (new));
}
static GtkWidget *
get_widget (FilterElement *fe)
{
GtkWidget *entry;
FilterInput *fi = (FilterInput *)fe;
entry = gtk_entry_new ();
if (fi->values && fi->values->data)
gtk_entry_set_text (GTK_ENTRY (entry), (const char *) fi->values->data);
g_signal_connect (entry, "changed", G_CALLBACK (entry_changed), fe);
return entry;
}
static void
build_code (FilterElement *fe, GString *out, struct _FilterPart *ff)
{
;
}
static void
format_sexp (FilterElement *fe, GString *out)
{
FilterInput *fi = (FilterInput *) fe;
GList *l;
d(printf("format_sexp, first elem=%p\n", fi->values));
l = fi->values;
while (l) {
e_sexp_encode_string (out, l->data);
l = l->next;
}
}
|