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
477
478
479
480
481
482
483
484
485
486
487
|
/*************************************************
* Exim - an Internet mail transport agent *
*************************************************/
/* Copyright (c) University of Cambridge 1995 - 2018 */
/* Copyright (c) The Exim Maintainers 2020 */
/* See the file NOTICE for conditions of use and distribution. */
#include "../exim.h"
#include "lf_functions.h"
/* Codes for the different kinds of lsearch that are supported */
enum {
LSEARCH_PLAIN, /* Literal keys */
LSEARCH_WILD, /* Wild card keys, expanded */
LSEARCH_NWILD, /* Wild card keys, not expanded */
LSEARCH_IP /* IP addresses and networks */
};
/*************************************************
* Open entry point *
*************************************************/
/* See local README for interface description */
static void *
lsearch_open(const uschar * filename, uschar ** errmsg)
{
FILE *f = Ufopen(filename, "rb");
if (f == NULL)
{
int save_errno = errno;
*errmsg = string_open_failed(errno, "%s for linear search", filename);
errno = save_errno;
return NULL;
}
return f;
}
/*************************************************
* Check entry point *
*************************************************/
static BOOL
lsearch_check(void *handle, const uschar *filename, int modemask, uid_t *owners,
gid_t *owngroups, uschar **errmsg)
{
return lf_check_file(fileno((FILE *)handle), filename, S_IFREG, modemask,
owners, owngroups, "lsearch", errmsg) == 0;
}
/*************************************************
* Internal function for the various lsearches *
*************************************************/
/* See local README for interface description, plus:
Extra argument:
type one of the values LSEARCH_PLAIN, LSEARCH_WILD, LSEARCH_NWILD, or
LSEARCH_IP
There is some messy logic in here to cope with very long data lines that do not
fit into the fixed sized buffer. Most of the time this will never be exercised,
but people do occasionally do weird things. */
static int
internal_lsearch_find(void * handle, const uschar * filename,
const uschar * keystring, int length, uschar ** result, uschar ** errmsg,
int type)
{
FILE *f = (FILE *)handle;
BOOL last_was_eol = TRUE;
BOOL this_is_eol = TRUE;
int old_pool = store_pool;
rmark reset_point = NULL;
uschar buffer[4096];
/* Wildcard searches may use up some store, because of expansions. We don't
want them to fill up our search store. What we do is set the pool to the main
pool and get a point to reset to later. Wildcard searches could also issue
lookups, but internal_search_find will take care of that, and the cache will be
safely stored in the search pool again. */
if(type == LSEARCH_WILD || type == LSEARCH_NWILD)
{
store_pool = POOL_MAIN;
reset_point = store_mark();
}
filename = filename; /* Keep picky compilers happy */
errmsg = errmsg;
rewind(f);
for (last_was_eol = TRUE;
Ufgets(buffer, sizeof(buffer), f) != NULL;
last_was_eol = this_is_eol)
{
int p = Ustrlen(buffer);
int linekeylength;
BOOL this_is_comment;
gstring * yield;
uschar *s = buffer;
/* Check whether this the final segment of a line. If it follows an
incomplete part-line, skip it. */
this_is_eol = p > 0 && buffer[p-1] == '\n';
if (!last_was_eol) continue;
/* We now have the start of a physical line. If this is a final line segment,
remove trailing white space. */
if (this_is_eol)
{
while (p > 0 && isspace((uschar)buffer[p-1])) p--;
buffer[p] = 0;
}
/* If the buffer is empty it might be (a) a complete empty line, or (b) the
start of a line that begins with so much white space that it doesn't all fit
in the buffer. In both cases we want to skip the entire physical line.
If the buffer begins with # it is a comment line; if it begins with white
space it is a logical continuation; again, we want to skip the entire
physical line. */
if (buffer[0] == 0 || buffer[0] == '#' || isspace(buffer[0])) continue;
/* We assume that they key will fit in the buffer. If the key starts with ",
read it as a quoted string. We don't use string_dequote() because that uses
new store for the result, and we may be doing this many times in a long file.
We know that the dequoted string must be shorter than the original, because
we are removing the quotes, and also any escape sequences always turn two or
more characters into one character. Therefore, we can store the new string in
the same buffer. */
if (*s == '\"')
{
uschar *t = s++;
while (*s != 0 && *s != '\"')
{
if (*s == '\\') *t++ = string_interpret_escape(CUSS &s);
else *t++ = *s;
s++;
}
if (*s != 0) s++; /* Past terminating " */
linekeylength = t - buffer;
}
/* Otherwise it is terminated by a colon or white space */
else
{
while (*s != 0 && *s != ':' && !isspace(*s)) s++;
linekeylength = s - buffer;
}
/* The matching test depends on which kind of lsearch we are doing */
switch(type)
{
/* A plain lsearch treats each key as a literal */
case LSEARCH_PLAIN:
if (linekeylength != length || strncmpic(buffer, keystring, length) != 0)
continue;
break; /* Key matched */
/* A wild lsearch treats each key as a possible wildcarded string; no
expansion is done for nwildlsearch. */
case LSEARCH_WILD:
case LSEARCH_NWILD:
{
int rc;
int save = buffer[linekeylength];
const uschar *list = buffer;
buffer[linekeylength] = 0;
rc = match_isinlist(keystring,
&list,
UCHAR_MAX+1, /* Single-item list */
NULL, /* No anchor */
NULL, /* No caching */
MCL_STRING + ((type == LSEARCH_WILD)? 0:MCL_NOEXPAND),
TRUE, /* Caseless */
NULL);
buffer[linekeylength] = save;
if (rc == FAIL) continue;
if (rc == DEFER) return DEFER;
}
/* The key has matched. If the search involved a regular expression, it
might have caused numerical variables to be set. However, their values will
be in the wrong storage pool for external use. Copying them to the standard
pool is not feasible because of the caching of lookup results - a repeated
lookup will not match the regular expression again. Therefore, we flatten
all numeric variables at this point. */
expand_nmax = -1;
break;
/* Compare an ip address against a list of network/ip addresses. We have to
allow for the "*" case specially. */
case LSEARCH_IP:
if (linekeylength == 1 && buffer[0] == '*')
{
if (length != 1 || keystring[0] != '*') continue;
}
else if (length == 1 && keystring[0] == '*') continue;
else
{
int maskoffset;
int save = buffer[linekeylength];
buffer[linekeylength] = 0;
if (string_is_ip_address(buffer, &maskoffset) == 0 ||
!host_is_in_net(keystring, buffer, maskoffset)) continue;
buffer[linekeylength] = save;
}
break; /* Key matched */
}
/* The key has matched. Skip spaces after the key, and allow an optional
colon after the spaces. This is an odd specification, but it's for
compatibility. */
while (isspace((uschar)*s)) s++;
if (*s == ':')
{
s++;
while (isspace((uschar)*s)) s++;
}
/* Reset dynamic store, if we need to, and revert to the search pool */
if (reset_point)
{
reset_point = store_reset(reset_point);
store_pool = old_pool;
}
/* Now we want to build the result string to contain the data. There can be
two kinds of continuation: (a) the physical line may not all have fitted into
the buffer, and (b) there may be logical continuation lines, for which we
must convert all leading white space into a single blank.
Initialize, and copy the first segment of data. */
this_is_comment = FALSE;
yield = string_get(100);
if (*s != 0)
yield = string_cat(yield, s);
/* Now handle continuations */
for (last_was_eol = this_is_eol;
Ufgets(buffer, sizeof(buffer), f) != NULL;
last_was_eol = this_is_eol)
{
s = buffer;
p = Ustrlen(buffer);
this_is_eol = p > 0 && buffer[p-1] == '\n';
/* Remove trailing white space from a physical line end */
if (this_is_eol)
{
while (p > 0 && isspace((uschar)buffer[p-1])) p--;
buffer[p] = 0;
}
/* If this is not a physical line continuation, skip it entirely if it's
empty or starts with #. Otherwise, break the loop if it doesn't start with
white space. Otherwise, replace leading white space with a single blank. */
if (last_was_eol)
{
this_is_comment = (this_is_comment || (buffer[0] == 0 || buffer[0] == '#'));
if (this_is_comment) continue;
if (!isspace((uschar)buffer[0])) break;
while (isspace((uschar)*s)) s++;
*(--s) = ' ';
}
if (this_is_comment) continue;
/* Join a physical or logical line continuation onto the result string. */
yield = string_cat(yield, s);
}
gstring_release_unused(yield);
*result = string_from_gstring(yield);
return OK;
}
/* Reset dynamic store, if we need to */
if (reset_point)
{
store_reset(reset_point);
store_pool = old_pool;
}
return FAIL;
}
/*************************************************
* Find entry point for lsearch *
*************************************************/
/* See local README for interface description */
static int
lsearch_find(void * handle, const uschar * filename, const uschar * keystring,
int length, uschar ** result, uschar ** errmsg, uint * do_cache,
const uschar * opts)
{
do_cache = do_cache; /* Keep picky compilers happy */
return internal_lsearch_find(handle, filename, keystring, length, result,
errmsg, LSEARCH_PLAIN);
}
/*************************************************
* Find entry point for wildlsearch *
*************************************************/
/* See local README for interface description */
static int
wildlsearch_find(void * handle, const uschar * filename, const uschar * keystring,
int length, uschar ** result, uschar ** errmsg, uint * do_cache,
const uschar * opts)
{
do_cache = do_cache; /* Keep picky compilers happy */
return internal_lsearch_find(handle, filename, keystring, length, result,
errmsg, LSEARCH_WILD);
}
/*************************************************
* Find entry point for nwildlsearch *
*************************************************/
/* See local README for interface description */
static int
nwildlsearch_find(void * handle, const uschar * filename, const uschar * keystring,
int length, uschar ** result, uschar ** errmsg, uint * do_cache,
const uschar * opts)
{
do_cache = do_cache; /* Keep picky compilers happy */
return internal_lsearch_find(handle, filename, keystring, length, result,
errmsg, LSEARCH_NWILD);
}
/*************************************************
* Find entry point for iplsearch *
*************************************************/
/* See local README for interface description */
static int
iplsearch_find(void * handle, uschar const * filename, const uschar * keystring,
int length, uschar ** result, uschar ** errmsg, uint * do_cache,
const uschar * opts)
{
do_cache = do_cache; /* Keep picky compilers happy */
if ((length == 1 && keystring[0] == '*') ||
string_is_ip_address(keystring, NULL) != 0)
return internal_lsearch_find(handle, filename, keystring, length, result,
errmsg, LSEARCH_IP);
*errmsg = string_sprintf("\"%s\" is not a valid iplsearch key (an IP "
"address, with optional CIDR mask, is wanted): "
"in a host list, use net-iplsearch as the search type", keystring);
return DEFER;
}
/*************************************************
* Close entry point *
*************************************************/
/* See local README for interface description */
static void
lsearch_close(void *handle)
{
(void)fclose((FILE *)handle);
}
/*************************************************
* Version reporting entry point *
*************************************************/
/* See local README for interface description. */
#include "../version.h"
void
lsearch_version_report(FILE *f)
{
#ifdef DYNLOOKUP
fprintf(f, "Library version: lsearch: Exim version %s\n", EXIM_VERSION_STR);
#endif
}
static lookup_info iplsearch_lookup_info = {
.name = US"iplsearch", /* lookup name */
.type = lookup_absfile, /* uses absolute file name */
.open = lsearch_open, /* open function */
.check = lsearch_check, /* check function */
.find = iplsearch_find, /* find function */
.close = lsearch_close, /* close function */
.tidy = NULL, /* no tidy function */
.quote = NULL, /* no quoting function */
.version_report = NULL /* no version reporting (redundant) */
};
static lookup_info lsearch_lookup_info = {
.name = US"lsearch", /* lookup name */
.type = lookup_absfile, /* uses absolute file name */
.open = lsearch_open, /* open function */
.check = lsearch_check, /* check function */
.find = lsearch_find, /* find function */
.close = lsearch_close, /* close function */
.tidy = NULL, /* no tidy function */
.quote = NULL, /* no quoting function */
.version_report = lsearch_version_report /* version reporting */
};
static lookup_info nwildlsearch_lookup_info = {
.name = US"nwildlsearch", /* lookup name */
.type = lookup_absfile, /* uses absolute file name */
.open = lsearch_open, /* open function */
.check = lsearch_check, /* check function */
.find = nwildlsearch_find, /* find function */
.close = lsearch_close, /* close function */
.tidy = NULL, /* no tidy function */
.quote = NULL, /* no quoting function */
.version_report = NULL /* no version reporting (redundant) */
};
static lookup_info wildlsearch_lookup_info = {
.name = US"wildlsearch", /* lookup name */
.type = lookup_absfile, /* uses absolute file name */
.open = lsearch_open, /* open function */
.check = lsearch_check, /* check function */
.find = wildlsearch_find, /* find function */
.close = lsearch_close, /* close function */
.tidy = NULL, /* no tidy function */
.quote = NULL, /* no quoting function */
.version_report = NULL /* no version reporting (redundant) */
};
#ifdef DYNLOOKUP
#define lsearch_lookup_module_info _lookup_module_info
#endif
static lookup_info *_lookup_list[] = { &iplsearch_lookup_info,
&lsearch_lookup_info,
&nwildlsearch_lookup_info,
&wildlsearch_lookup_info };
lookup_module_info lsearch_lookup_module_info = { LOOKUP_MODULE_INFO_MAGIC, _lookup_list, 4 };
/* End of lookups/lsearch.c */
|