1 /******************************************************************************/
2 /* pfixtools: a collection of postfix related tools */
4 /* ________________________________________________________________________ */
6 /* Redistribution and use in source and binary forms, with or without */
7 /* modification, are permitted provided that the following conditions */
10 /* 1. Redistributions of source code must retain the above copyright */
11 /* notice, this list of conditions and the following disclaimer. */
12 /* 2. Redistributions in binary form must reproduce the above copyright */
13 /* notice, this list of conditions and the following disclaimer in the */
14 /* documentation and/or other materials provided with the distribution. */
15 /* 3. The names of its contributors may not be used to endorse or promote */
16 /* products derived from this software without specific prior written */
19 /* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND */
20 /* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE */
21 /* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR */
22 /* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS */
23 /* BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR */
24 /* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF */
25 /* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS */
26 /* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN */
27 /* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) */
28 /* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF */
29 /* THE POSSIBILITY OF SUCH DAMAGE. */
30 /******************************************************************************/
33 * Copyright © 2008 Florent Bruneau
40 static filter_runner_t runners[FTK_count];
41 static filter_constructor_t constructors[FTK_count];
42 static filter_destructor_t destructors[FTK_count];
44 void filter_register(const char *type, filter_constructor_t constructor,
45 filter_destructor_t destructor, filter_runner_t runner)
47 filter_token tok = filter_tokenize(type, m_strlen(type));
48 assert(tok != FTK_UNKNOWN && "Unknown filter type");
49 runners[tok] = runner;
50 constructors[tok] = constructor;
51 destructors[tok] = destructor;
54 bool filter_build(filter_t *filter)
56 if (filter->type == FTK_UNKNOWN || filter->name == NULL) {
59 filter_constructor_t constructor = constructors[filter->type];
61 return constructor(filter);
66 void filter_wipe(filter_t *filter)
68 filter_destructor_t destructor = destructors[filter->type];
72 array_deep_wipe(filter->hooks, filter_hook_wipe);
73 array_deep_wipe(filter->params, filter_params_wipe);
74 p_delete(&filter->name);
77 filter_result_t filter_run(const filter_t *filter, const query_t *query)
79 return runners[filter->type](filter, query);
82 void filter_set_name(filter_t *filter, const char *name, ssize_t len)
84 filter->name = p_new(char, len + 1);
85 memcpy(filter->name, name, len);
86 filter->name[len] = '\0';
89 bool filter_set_type(filter_t *filter, const char *type, ssize_t len)
91 filter->type = filter_tokenize(type, len);
92 return filter->type != FTK_UNKNOWN;
95 bool filter_add_param(filter_t *filter, const char *name, ssize_t name_len,
96 const char *value, ssize_t value_len)
98 filter_params_t param;
99 param.name = strdup(name);
100 param.value = strdup(value);
101 array_add(filter->params, param);
105 bool filter_add_hook(filter_t *filter, const char *name, ssize_t name_len,
106 const char *value, ssize_t value_len)
109 hook.name = strdup(name);
110 hook.value = strdup(value);
111 array_add(filter->hooks, hook);