register.c
3.46 KB
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
/* GNU Mailutils -- a suite of utilities for electronic mail
Copyright (C) 1999, 2000, 2001, 2002, 2004,
2005 Free Software Foundation, Inc.
This library 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) any later version.
This library 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 this library; if not, write to the
Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
Boston, MA 02110-1301 USA */
#ifdef HAVE_CONFIG_H
# include <config.h>
#endif
#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include <string.h>
#include <sieve.h>
static mu_sieve_register_t *
reg_lookup (list_t list, const char *name)
{
iterator_t itr;
mu_sieve_register_t *reg;
if (!list || mu_list_get_iterator (list, &itr))
return NULL;
for (mu_iterator_first (itr); !mu_iterator_is_done (itr); mu_iterator_next (itr))
{
mu_iterator_current (itr, (void **)®);
if (strcmp (reg->name, name) == 0)
break;
else
reg = NULL;
}
mu_iterator_destroy (&itr);
return reg;
}
mu_sieve_register_t *
mu_sieve_test_lookup (mu_sieve_machine_t mach, const char *name)
{
return reg_lookup (mach->test_list, name);
}
mu_sieve_register_t *
mu_sieve_action_lookup (mu_sieve_machine_t mach, const char *name)
{
return reg_lookup (mach->action_list, name);
}
static int
reg_require (mu_sieve_machine_t mach, list_t list, const char *name)
{
mu_sieve_register_t *reg = reg_lookup (list, name);
if (!reg)
{
if (!(mu_sieve_load_ext (mach, name) == 0
&& (reg = reg_lookup (list, name)) != NULL))
return 1;
}
reg->required = 1;
return 0;
}
int
mu_sieve_require_action (mu_sieve_machine_t mach, const char *name)
{
return reg_require (mach, mach->action_list, name);
}
int
mu_sieve_require_test (mu_sieve_machine_t mach, const char *name)
{
return reg_require (mach, mach->test_list, name);
}
static int
sieve_register (list_t *pool,
list_t *list,
const char *name, mu_sieve_handler_t handler,
mu_sieve_data_type *arg_types,
mu_sieve_tag_group_t *tags, int required)
{
mu_sieve_register_t *reg = mu_sieve_palloc (pool, sizeof (*reg));
if (!reg)
return ENOMEM;
reg->name = name;
reg->handler = handler;
reg->req_args = arg_types;
reg->tags = tags;
reg->required = required;
if (!*list)
{
int rc = mu_list_create (list);
if (rc)
{
free (reg);
return rc;
}
}
return mu_list_append (*list, reg);
}
int
mu_sieve_register_test (mu_sieve_machine_t mach,
const char *name, mu_sieve_handler_t handler,
mu_sieve_data_type *arg_types,
mu_sieve_tag_group_t *tags, int required)
{
return sieve_register (&mach->memory_pool,
&mach->test_list, name, handler,
arg_types, tags, required);
}
int
mu_sieve_register_action (mu_sieve_machine_t mach,
const char *name, mu_sieve_handler_t handler,
mu_sieve_data_type *arg_types,
mu_sieve_tag_group_t *tags, int required)
{
return sieve_register (&mach->memory_pool,
&mach->action_list, name, handler,
arg_types, tags, required);
}