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
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
|
/* $OpenBSD: table.c,v 1.3 2013/02/05 15:23:40 gilles Exp $ */
/*
* Copyright (c) 2008 Gilles Chehade <gilles@poolp.org>
*
* Permission to use, copy, modify, and distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*/
#include <sys/types.h>
#include <sys/queue.h>
#include <sys/tree.h>
#include <sys/param.h>
#include <sys/socket.h>
#include <netinet/in.h>
#include <ctype.h>
#include <err.h>
#include <errno.h>
#include <event.h>
#include <imsg.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "smtpd.h"
#include "log.h"
struct table_backend *table_backend_lookup(const char *);
extern struct table_backend table_backend_static;
extern struct table_backend table_backend_db;
extern struct table_backend table_backend_getpwnam;
extern struct table_backend table_backend_sqlite;
extern struct table_backend table_backend_ldap;
static objid_t last_table_id = 0;
struct table_backend *
table_backend_lookup(const char *backend)
{
if (!strcmp(backend, "static") || !strcmp(backend, "file"))
return &table_backend_static;
if (!strcmp(backend, "db"))
return &table_backend_db;
if (!strcmp(backend, "getpwnam"))
return &table_backend_getpwnam;
if (!strcmp(backend, "sqlite"))
return &table_backend_sqlite;
if (!strcmp(backend, "ldap"))
return &table_backend_ldap;
return NULL;
}
struct table *
table_findbyname(const char *name)
{
return dict_get(env->sc_tables_dict, name);
}
struct table *
table_find(objid_t id)
{
return tree_get(env->sc_tables_tree, id);
}
int
table_lookup(struct table *table, const char *key, enum table_service kind,
void **retp)
{
return table->t_backend->lookup(table->t_handle, key, kind, retp);
}
int
table_fetch(struct table *table, enum table_service kind, char **retp)
{
return table->t_backend->fetch(table->t_handle, kind, retp);
}
struct table *
table_create(const char *backend, const char *name, const char *config)
{
struct table *t;
struct table_backend *tb;
size_t n;
if (name && table_findbyname(name))
errx(1, "table_create: table \"%s\" already defined", name);
if ((tb = table_backend_lookup(backend)) == NULL)
errx(1, "table_create: backend \"%s\" does not exist", backend);
t = xcalloc(1, sizeof(*t), "table_create");
t->t_backend = tb;
/* XXX */
/*
* until people forget about it, "file" really means "static"
*/
if (!strcmp(backend, "file"))
backend = "static";
if (strlcpy(t->t_src, backend, sizeof t->t_src) >= sizeof t->t_src)
errx(1, "table_create: table backend \"%s\" too large",
t->t_src);
if (config && *config) {
if (strlcpy(t->t_config, config, sizeof t->t_config)
>= sizeof t->t_config)
errx(1, "table_create: table config \"%s\" too large",
t->t_config);
}
if (strcmp(t->t_src, "static") != 0)
t->t_type = T_DYNAMIC;
t->t_id = ++last_table_id;
if (t->t_id == INT_MAX)
errx(1, "table_create: too many tables defined");
if (name == NULL)
snprintf(t->t_name, sizeof(t->t_name), "<dynamic:%u>", t->t_id);
else {
n = strlcpy(t->t_name, name, sizeof(t->t_name));
if (n >= sizeof(t->t_name))
errx(1, "table_create: table name too long");
}
dict_init(&t->t_dict);
dict_set(env->sc_tables_dict, t->t_name, t);
tree_set(env->sc_tables_tree, t->t_id, t);
return (t);
}
void
table_destroy(struct table *t)
{
void *p = NULL;
while (dict_poproot(&t->t_dict, NULL, (void **)&p))
free(p);
dict_xpop(env->sc_tables_dict, t->t_name);
tree_xpop(env->sc_tables_tree, t->t_id);
free(t);
}
void
table_replace(struct table *orig, struct table *tnew)
{
void *p = NULL;
while (dict_poproot(&orig->t_dict, NULL, (void **)&p))
free(p);
dict_merge(&orig->t_dict, &tnew->t_dict);
table_destroy(tnew);
}
void
table_set_configuration(struct table *t, struct table *config)
{
strlcpy(t->t_cfgtable, config->t_name, sizeof t->t_cfgtable);
}
struct table *
table_get_configuration(struct table *t)
{
return table_findbyname(t->t_cfgtable);
}
void
table_set_payload(struct table *t, void *payload)
{
t->t_payload = payload;
}
void *
table_get_payload(struct table *t)
{
return t->t_payload;
}
void
table_add(struct table *t, const char *key, const char *val)
{
if (strcmp(t->t_src, "static") != 0)
errx(1, "table_add: cannot add to table");
dict_set(&t->t_dict, key, val ? xstrdup(val, "table_add") : NULL);
}
const void *
table_get(struct table *t, const char *key)
{
if (strcmp(t->t_src, "static") != 0)
errx(1, "table_add: cannot get from table");
return dict_get(&t->t_dict, key);
}
void
table_delete(struct table *t, const char *key)
{
if (strcmp(t->t_src, "static") != 0)
errx(1, "map_add: cannot delete from map");
free(dict_pop(&t->t_dict, key));
}
int
table_check_type(struct table *t, uint32_t mask)
{
return t->t_type & mask;
}
int
table_check_service(struct table *t, uint32_t mask)
{
return t->t_backend->services & mask;
}
int
table_check_use(struct table *t, uint32_t tmask, uint32_t smask)
{
return table_check_type(t, tmask) && table_check_service(t, smask);
}
int
table_open(struct table *t)
{
t->t_handle = t->t_backend->open(t);
if (t->t_handle == NULL)
return 0;
return 1;
}
void
table_close(struct table *t)
{
t->t_backend->close(t->t_handle);
}
void
table_update(struct table *t)
{
t->t_backend->update(t);
}
void *
table_config_create(void)
{
return table_create("static", NULL, NULL);
}
const char *
table_config_get(void *p, const char *key)
{
return (const char *)table_get(p, key);
}
void
table_config_destroy(void *p)
{
table_destroy(p);
}
int
table_config_parse(void *p, const char *config, enum table_type type)
{
struct table *t = p;
FILE *fp;
char *buf, *lbuf;
size_t flen;
char *keyp;
char *valp;
size_t ret = 0;
if (strcmp("static", t->t_src) != 0) {
log_warn("table_config_parser: config table must be static");
return 0;
}
fp = fopen(config, "r");
if (fp == NULL)
return 0;
lbuf = NULL;
while ((buf = fgetln(fp, &flen))) {
if (buf[flen - 1] == '\n')
buf[flen - 1] = '\0';
else {
lbuf = xmalloc(flen + 1, "table_stdio_get_entry");
memcpy(lbuf, buf, flen);
lbuf[flen] = '\0';
buf = lbuf;
}
keyp = buf;
while (isspace((int)*keyp))
++keyp;
if (*keyp == '\0' || *keyp == '#')
continue;
valp = keyp;
strsep(&valp, " \t:");
if (valp) {
while (*valp) {
if (!isspace(*valp) &&
!(*valp == ':' && isspace(*(valp + 1))))
break;
++valp;
}
if (*valp == '\0')
valp = NULL;
}
/**/
if (t->t_type == 0)
t->t_type = (valp == keyp || valp == NULL) ? T_LIST :
T_HASH;
if (!(t->t_type & type))
goto end;
if ((valp == keyp || valp == NULL) && t->t_type == T_LIST)
table_add(t, keyp, NULL);
else if ((valp != keyp && valp != NULL) && t->t_type == T_HASH)
table_add(t, keyp, valp);
else
goto end;
}
ret = 1;
end:
free(lbuf);
fclose(fp);
return ret;
}
int
table_domain_match(const char *s1, const char *s2)
{
return hostname_match(s1, s2);
}
int
table_mailaddr_match(const char *s1, const char *s2)
{
struct mailaddr m1;
struct mailaddr m2;
if (! text_to_mailaddr(&m1, s1))
return 0;
if (! text_to_mailaddr(&m2, s2))
return 0;
if (strcasecmp(m1.domain, m2.domain))
return 0;
if (m2.user[0])
if (strcasecmp(m1.user, m2.user))
return 0;
return 1;
}
static int table_match_mask(struct sockaddr_storage *, struct netaddr *);
static int table_inet4_match(struct sockaddr_in *, struct netaddr *);
static int table_inet6_match(struct sockaddr_in6 *, struct netaddr *);
int
table_netaddr_match(const char *s1, const char *s2)
{
struct netaddr n1;
struct netaddr n2;
if (strcmp(s1, s2) == 0)
return 1;
if (! text_to_netaddr(&n1, s1))
return 0;
if (! text_to_netaddr(&n2, s2))
return 0;
if (n1.ss.ss_family != n2.ss.ss_family)
return 0;
if (n1.ss.ss_len != n2.ss.ss_len)
return 0;
return table_match_mask(&n1.ss, &n2);
}
static int
table_match_mask(struct sockaddr_storage *ss, struct netaddr *ssmask)
{
if (ss->ss_family == AF_INET)
return table_inet4_match((struct sockaddr_in *)ss, ssmask);
if (ss->ss_family == AF_INET6)
return table_inet6_match((struct sockaddr_in6 *)ss, ssmask);
return (0);
}
static int
table_inet4_match(struct sockaddr_in *ss, struct netaddr *ssmask)
{
in_addr_t mask;
int i;
/* a.b.c.d/8 -> htonl(0xff000000) */
mask = 0;
for (i = 0; i < ssmask->bits; ++i)
mask = (mask >> 1) | 0x80000000;
mask = htonl(mask);
/* (addr & mask) == (net & mask) */
if ((ss->sin_addr.s_addr & mask) ==
(((struct sockaddr_in *)ssmask)->sin_addr.s_addr & mask))
return 1;
return 0;
}
static int
table_inet6_match(struct sockaddr_in6 *ss, struct netaddr *ssmask)
{
struct in6_addr *in;
struct in6_addr *inmask;
struct in6_addr mask;
int i;
bzero(&mask, sizeof(mask));
for (i = 0; i < ssmask->bits / 8; i++)
mask.s6_addr[i] = 0xff;
i = ssmask->bits % 8;
if (i)
mask.s6_addr[ssmask->bits / 8] = 0xff00 >> i;
in = &ss->sin6_addr;
inmask = &((struct sockaddr_in6 *)&ssmask->ss)->sin6_addr;
for (i = 0; i < 16; i++) {
if ((in->s6_addr[i] & mask.s6_addr[i]) !=
(inmask->s6_addr[i] & mask.s6_addr[i]))
return (0);
}
return (1);
}
void
table_open_all(void)
{
struct table *t;
void *iter;
iter = NULL;
while (tree_iter(env->sc_tables_tree, &iter, NULL, (void **)&t))
if (! table_open(t))
errx(1, "failed to open table %s", t->t_name);
}
void
table_close_all(void)
{
struct table *t;
void *iter;
iter = NULL;
while (tree_iter(env->sc_tables_tree, &iter, NULL, (void **)&t))
table_close(t);
}
|