blob: c8a5a8860331004cf696d3f87b44a5c2d0bf26f7 [file] [log] [blame]
Willy Tarreaua84d3742007-05-07 00:36:48 +02001/*
2 * ACL management functions.
3 *
Willy Tarreau06457872010-05-23 12:24:38 +02004 * Copyright 2000-2010 Willy Tarreau <w@1wt.eu>
Willy Tarreaua84d3742007-05-07 00:36:48 +02005 *
6 * This program is free software; you can redistribute it and/or
7 * modify it under the terms of the GNU General Public License
8 * as published by the Free Software Foundation; either version
9 * 2 of the License, or (at your option) any later version.
10 *
11 */
12
Willy Tarreauae8b7962007-06-09 23:10:04 +020013#include <ctype.h>
Willy Tarreaua84d3742007-05-07 00:36:48 +020014#include <stdio.h>
15#include <string.h>
16
17#include <common/config.h>
18#include <common/mini-clist.h>
19#include <common/standard.h>
Krzysztof Piotr Oledzki8c8bd452010-01-29 19:29:32 +010020#include <common/uri_auth.h>
Willy Tarreaua84d3742007-05-07 00:36:48 +020021
Willy Tarreau2b5285d2010-05-09 23:45:24 +020022#include <types/global.h>
23
Willy Tarreaua84d3742007-05-07 00:36:48 +020024#include <proto/acl.h>
Krzysztof Piotr Oledzkif9423ae2010-01-29 19:26:18 +010025#include <proto/auth.h>
Willy Tarreau44b90cc2010-05-24 20:27:29 +020026#include <proto/buffers.h>
Willy Tarreau404e8ab2009-07-26 19:40:40 +020027#include <proto/log.h>
Willy Tarreau0b1cd942010-05-16 22:18:27 +020028#include <proto/proxy.h>
Willy Tarreaua84d3742007-05-07 00:36:48 +020029
Willy Tarreauc4262962010-05-10 23:42:40 +020030#include <ebsttree.h>
31
Willy Tarreaua9802632008-07-25 19:13:19 +020032/* The capabilities of filtering hooks describe the type of information
33 * available to each of them.
34 */
35const unsigned int filt_cap[] = {
36 [ACL_HOOK_REQ_FE_TCP] = ACL_USE_TCP4_ANY|ACL_USE_TCP6_ANY|ACL_USE_TCP_ANY,
Willy Tarreau06457872010-05-23 12:24:38 +020037 [ACL_HOOK_REQ_FE_TCP_CONTENT] = ACL_USE_TCP4_ANY|ACL_USE_TCP6_ANY|ACL_USE_TCP_ANY|ACL_USE_L6REQ_ANY,
38 [ACL_HOOK_REQ_FE_HTTP_IN] = ACL_USE_TCP4_ANY|ACL_USE_TCP6_ANY|ACL_USE_TCP_ANY|ACL_USE_L6REQ_ANY|ACL_USE_L7REQ_ANY|ACL_USE_HDR_ANY,
39 [ACL_HOOK_REQ_FE_SWITCH] = ACL_USE_TCP4_ANY|ACL_USE_TCP6_ANY|ACL_USE_TCP_ANY|ACL_USE_L6REQ_ANY|ACL_USE_L7REQ_ANY|ACL_USE_HDR_ANY,
40 [ACL_HOOK_REQ_BE_TCP_CONTENT] = ACL_USE_TCP4_ANY|ACL_USE_TCP6_ANY|ACL_USE_TCP_ANY|ACL_USE_L6REQ_ANY|ACL_USE_L7REQ_ANY|ACL_USE_HDR_ANY,
41 [ACL_HOOK_REQ_BE_HTTP_IN] = ACL_USE_TCP4_ANY|ACL_USE_TCP6_ANY|ACL_USE_TCP_ANY|ACL_USE_L6REQ_ANY|ACL_USE_L7REQ_ANY|ACL_USE_HDR_ANY,
42 [ACL_HOOK_REQ_BE_SWITCH] = ACL_USE_TCP4_ANY|ACL_USE_TCP6_ANY|ACL_USE_TCP_ANY|ACL_USE_L6REQ_ANY|ACL_USE_L7REQ_ANY|ACL_USE_HDR_ANY,
43 [ACL_HOOK_REQ_FE_HTTP_OUT] = ACL_USE_TCP4_ANY|ACL_USE_TCP6_ANY|ACL_USE_TCP_ANY|ACL_USE_L6REQ_ANY|ACL_USE_L7REQ_ANY|ACL_USE_HDR_ANY,
44 [ACL_HOOK_REQ_BE_HTTP_OUT] = ACL_USE_TCP4_ANY|ACL_USE_TCP6_ANY|ACL_USE_TCP_ANY|ACL_USE_L6REQ_ANY|ACL_USE_L7REQ_ANY|ACL_USE_HDR_ANY,
Willy Tarreaua9802632008-07-25 19:13:19 +020045
Willy Tarreau06457872010-05-23 12:24:38 +020046 [ACL_HOOK_RTR_BE_TCP_CONTENT] = ACL_USE_REQ_PERMANENT|ACL_USE_REQ_CACHEABLE|ACL_USE_L6RTR_ANY,
47 [ACL_HOOK_RTR_BE_HTTP_IN] = ACL_USE_REQ_PERMANENT|ACL_USE_REQ_CACHEABLE|ACL_USE_L6RTR_ANY|ACL_USE_L7RTR_ANY,
48 [ACL_HOOK_RTR_FE_TCP_CONTENT] = ACL_USE_REQ_PERMANENT|ACL_USE_REQ_CACHEABLE|ACL_USE_L6RTR_ANY|ACL_USE_L7RTR_ANY,
49 [ACL_HOOK_RTR_FE_HTTP_IN] = ACL_USE_REQ_PERMANENT|ACL_USE_REQ_CACHEABLE|ACL_USE_L6RTR_ANY|ACL_USE_L7RTR_ANY,
50 [ACL_HOOK_RTR_BE_HTTP_OUT] = ACL_USE_REQ_PERMANENT|ACL_USE_REQ_CACHEABLE|ACL_USE_L6RTR_ANY|ACL_USE_L7RTR_ANY,
51 [ACL_HOOK_RTR_FE_HTTP_OUT] = ACL_USE_REQ_PERMANENT|ACL_USE_REQ_CACHEABLE|ACL_USE_L6RTR_ANY|ACL_USE_L7RTR_ANY,
Willy Tarreaua9802632008-07-25 19:13:19 +020052};
53
Willy Tarreaua84d3742007-05-07 00:36:48 +020054/* List head of all known ACL keywords */
55static struct acl_kw_list acl_keywords = {
56 .list = LIST_HEAD_INIT(acl_keywords.list)
57};
58
59
Willy Tarreaua5909832007-06-17 20:40:25 +020060/*
61 * These functions are only used for debugging complex configurations.
Willy Tarreaua84d3742007-05-07 00:36:48 +020062 */
Willy Tarreaua5909832007-06-17 20:40:25 +020063
Willy Tarreau58393e12008-07-20 10:39:22 +020064/* force TRUE to be returned at the fetch level */
Willy Tarreaua5909832007-06-17 20:40:25 +020065static int
Willy Tarreau58393e12008-07-20 10:39:22 +020066acl_fetch_true(struct proxy *px, struct session *l4, void *l7, int dir,
67 struct acl_expr *expr, struct acl_test *test)
Willy Tarreaua5909832007-06-17 20:40:25 +020068{
Willy Tarreau58393e12008-07-20 10:39:22 +020069 test->flags |= ACL_TEST_F_SET_RES_PASS;
Willy Tarreaua5909832007-06-17 20:40:25 +020070 return 1;
71}
72
Willy Tarreaub6fb4202008-07-20 11:18:28 +020073/* wait for more data as long as possible, then return TRUE. This should be
74 * used with content inspection.
75 */
76static int
77acl_fetch_wait_end(struct proxy *px, struct session *l4, void *l7, int dir,
78 struct acl_expr *expr, struct acl_test *test)
79{
80 if (dir & ACL_PARTIAL) {
81 test->flags |= ACL_TEST_F_MAY_CHANGE;
82 return 0;
83 }
84 test->flags |= ACL_TEST_F_SET_RES_PASS;
85 return 1;
86}
87
Willy Tarreau58393e12008-07-20 10:39:22 +020088/* force FALSE to be returned at the fetch level */
Willy Tarreaua5909832007-06-17 20:40:25 +020089static int
Willy Tarreau58393e12008-07-20 10:39:22 +020090acl_fetch_false(struct proxy *px, struct session *l4, void *l7, int dir,
91 struct acl_expr *expr, struct acl_test *test)
Willy Tarreaua84d3742007-05-07 00:36:48 +020092{
Willy Tarreau58393e12008-07-20 10:39:22 +020093 test->flags |= ACL_TEST_F_SET_RES_FAIL;
Willy Tarreaua84d3742007-05-07 00:36:48 +020094 return 1;
95}
96
Willy Tarreau44b90cc2010-05-24 20:27:29 +020097/* return the number of bytes in the request buffer */
98static int
99acl_fetch_req_len(struct proxy *px, struct session *l4, void *l7, int dir,
100 struct acl_expr *expr, struct acl_test *test)
101{
102 if (!l4 || !l4->req)
103 return 0;
104
105 test->i = l4->req->l;
106 test->flags = ACL_TEST_F_VOLATILE | ACL_TEST_F_MAY_CHANGE;
107 return 1;
108}
109
Emeric Brun38e71762010-09-23 17:59:18 +0200110
111static int
112acl_fetch_ssl_hello_type(struct proxy *px, struct session *l4, void *l7, int dir,
113 struct acl_expr *expr, struct acl_test *test)
114{
115 int hs_len;
116 int hs_type, bleft;
117 struct buffer *b;
118 const unsigned char *data;
119
120 if (!l4)
121 goto not_ssl_hello;
122
123 b = ((dir & ACL_DIR_MASK) == ACL_DIR_RTR) ? l4->rep : l4->req;
124
125 bleft = b->l;
126 data = (const unsigned char *)b->w;
127
128 if (!bleft)
129 goto too_short;
130
131 if ((*data >= 0x14 && *data <= 0x17) || (*data == 0xFF)) {
132 /* SSLv3 header format */
133 if (bleft < 9)
134 goto too_short;
135
136 /* ssl version 3 */
137 if ((data[1] << 16) + data[2] < 0x00030000)
138 goto not_ssl_hello;
139
140 /* ssl message len must present handshake type and len */
141 if ((data[3] << 8) + data[4] < 4)
142 goto not_ssl_hello;
143
144 /* format introduced with SSLv3 */
145
146 hs_type = (int)data[5];
147 hs_len = ( data[6] << 16 ) + ( data[7] << 8 ) + data[8];
148
149 /* not a full handshake */
150 if (bleft < (9 + hs_len))
151 goto too_short;
152
153 }
154 else {
155 goto not_ssl_hello;
156 }
157
158 test->i = hs_type;
159 test->flags = ACL_TEST_F_VOLATILE;
160
161 return 1;
162
163 too_short:
164 test->flags = ACL_TEST_F_MAY_CHANGE;
165
166 not_ssl_hello:
167
168 return 0;
169}
170
Willy Tarreau44b90cc2010-05-24 20:27:29 +0200171/* Return the version of the SSL protocol in the request. It supports both
172 * SSLv3 (TLSv1) header format for any message, and SSLv2 header format for
173 * the hello message. The SSLv3 format is described in RFC 2246 p49, and the
174 * SSLv2 format is described here, and completed p67 of RFC 2246 :
175 * http://wp.netscape.com/eng/security/SSL_2.html
176 *
177 * Note: this decoder only works with non-wrapping data.
178 */
179static int
180acl_fetch_req_ssl_ver(struct proxy *px, struct session *l4, void *l7, int dir,
181 struct acl_expr *expr, struct acl_test *test)
182{
183 int version, bleft, msg_len;
184 const unsigned char *data;
185
186 if (!l4 || !l4->req)
187 return 0;
188
189 msg_len = 0;
190 bleft = l4->req->l;
191 if (!bleft)
192 goto too_short;
193
194 data = (const unsigned char *)l4->req->w;
195 if ((*data >= 0x14 && *data <= 0x17) || (*data == 0xFF)) {
196 /* SSLv3 header format */
197 if (bleft < 5)
198 goto too_short;
199
200 version = (data[1] << 16) + data[2]; /* version: major, minor */
201 msg_len = (data[3] << 8) + data[4]; /* record length */
202
203 /* format introduced with SSLv3 */
204 if (version < 0x00030000)
205 goto not_ssl;
206
207 /* message length between 1 and 2^14 + 2048 */
208 if (msg_len < 1 || msg_len > ((1<<14) + 2048))
209 goto not_ssl;
210
211 bleft -= 5; data += 5;
212 } else {
213 /* SSLv2 header format, only supported for hello (msg type 1) */
214 int rlen, plen, cilen, silen, chlen;
215
216 if (*data & 0x80) {
217 if (bleft < 3)
218 goto too_short;
219 /* short header format : 15 bits for length */
220 rlen = ((data[0] & 0x7F) << 8) | data[1];
221 plen = 0;
222 bleft -= 2; data += 2;
223 } else {
224 if (bleft < 4)
225 goto too_short;
226 /* long header format : 14 bits for length + pad length */
227 rlen = ((data[0] & 0x3F) << 8) | data[1];
228 plen = data[2];
229 bleft -= 3; data += 2;
230 }
231
232 if (*data != 0x01)
233 goto not_ssl;
234 bleft--; data++;
235
236 if (bleft < 8)
237 goto too_short;
238 version = (data[0] << 16) + data[1]; /* version: major, minor */
239 cilen = (data[2] << 8) + data[3]; /* cipher len, multiple of 3 */
240 silen = (data[4] << 8) + data[5]; /* session_id_len: 0 or 16 */
241 chlen = (data[6] << 8) + data[7]; /* 16<=challenge length<=32 */
242
243 bleft -= 8; data += 8;
244 if (cilen % 3 != 0)
245 goto not_ssl;
246 if (silen && silen != 16)
247 goto not_ssl;
248 if (chlen < 16 || chlen > 32)
249 goto not_ssl;
250 if (rlen != 9 + cilen + silen + chlen)
251 goto not_ssl;
252
253 /* focus on the remaining data length */
254 msg_len = cilen + silen + chlen + plen;
255 }
256 /* We could recursively check that the buffer ends exactly on an SSL
257 * fragment boundary and that a possible next segment is still SSL,
258 * but that's a bit pointless. However, we could still check that
259 * all the part of the request which fits in a buffer is already
260 * there.
261 */
262 if (msg_len > buffer_max_len(l4->req) + l4->req->data - l4->req->w)
263 msg_len = buffer_max_len(l4->req) + l4->req->data - l4->req->w;
264
265 if (bleft < msg_len)
266 goto too_short;
267
268 /* OK that's enough. We have at least the whole message, and we have
269 * the protocol version.
270 */
271 test->i = version;
272 test->flags = ACL_TEST_F_VOLATILE;
273 return 1;
274
275 too_short:
276 test->flags = ACL_TEST_F_MAY_CHANGE;
277 not_ssl:
278 return 0;
279}
280
281/* Fetch the RDP cookie identified in the expression.
282 * Note: this decoder only works with non-wrapping data.
283 */
284int
285acl_fetch_rdp_cookie(struct proxy *px, struct session *l4, void *l7, int dir,
286 struct acl_expr *expr, struct acl_test *test)
287{
288 int bleft;
289 const unsigned char *data;
290
291 if (!l4 || !l4->req)
292 return 0;
293
294 test->flags = 0;
295
296 bleft = l4->req->l;
297 if (bleft <= 11)
298 goto too_short;
299
300 data = (const unsigned char *)l4->req->w + 11;
301 bleft -= 11;
302
303 if (bleft <= 7)
304 goto too_short;
305
306 if (strncasecmp((const char *)data, "Cookie:", 7) != 0)
307 goto not_cookie;
308
309 data += 7;
310 bleft -= 7;
311
312 while (bleft > 0 && *data == ' ') {
313 data++;
314 bleft--;
315 }
316
317 if (expr->arg_len) {
318
319 if (bleft <= expr->arg_len)
320 goto too_short;
321
322 if ((data[expr->arg_len] != '=') ||
323 strncasecmp(expr->arg.str, (const char *)data, expr->arg_len) != 0)
324 goto not_cookie;
325
326 data += expr->arg_len + 1;
327 bleft -= expr->arg_len + 1;
328 } else {
329 while (bleft > 0 && *data != '=') {
330 if (*data == '\r' || *data == '\n')
331 goto not_cookie;
332 data++;
333 bleft--;
334 }
335
336 if (bleft < 1)
337 goto too_short;
338
339 if (*data != '=')
340 goto not_cookie;
341
342 data++;
343 bleft--;
344 }
345
346 /* data points to cookie value */
347 test->ptr = (char *)data;
348 test->len = 0;
349
350 while (bleft > 0 && *data != '\r') {
351 data++;
352 bleft--;
353 }
354
355 if (bleft < 2)
356 goto too_short;
357
358 if (data[0] != '\r' || data[1] != '\n')
359 goto not_cookie;
360
361 test->len = (char *)data - test->ptr;
362 test->flags = ACL_TEST_F_VOLATILE;
363 return 1;
364
365 too_short:
366 test->flags = ACL_TEST_F_MAY_CHANGE;
367 not_cookie:
368 return 0;
369}
370
371static int
372acl_fetch_rdp_cookie_cnt(struct proxy *px, struct session *l4, void *l7, int dir,
373 struct acl_expr *expr, struct acl_test *test)
374{
375 int ret;
376
377 ret = acl_fetch_rdp_cookie(px, l4, l7, dir, expr, test);
378
379 test->ptr = NULL;
380 test->len = 0;
381
382 if (test->flags & ACL_TEST_F_MAY_CHANGE)
383 return 0;
384
385 test->flags = ACL_TEST_F_VOLATILE;
386 test->i = ret;
387
388 return 1;
389}
390
Willy Tarreau58393e12008-07-20 10:39:22 +0200391
392/*
393 * These functions are exported and may be used by any other component.
394 */
395
396/* ignore the current line */
397int acl_parse_nothing(const char **text, struct acl_pattern *pattern, int *opaque)
Willy Tarreaua5909832007-06-17 20:40:25 +0200398{
Willy Tarreau58393e12008-07-20 10:39:22 +0200399 return 1;
400}
401
402/* always fake a data retrieval */
403int acl_fetch_nothing(struct proxy *px, struct session *l4, void *l7, int dir,
404 struct acl_expr *expr, struct acl_test *test)
405{
406 return 1;
Willy Tarreaua5909832007-06-17 20:40:25 +0200407}
408
409/* always return false */
Willy Tarreau58393e12008-07-20 10:39:22 +0200410int acl_match_nothing(struct acl_test *test, struct acl_pattern *pattern)
Willy Tarreaua5909832007-06-17 20:40:25 +0200411{
Willy Tarreau11382812008-07-09 16:18:21 +0200412 return ACL_PAT_FAIL;
Willy Tarreaua5909832007-06-17 20:40:25 +0200413}
414
415
Willy Tarreaua84d3742007-05-07 00:36:48 +0200416/* NB: For two strings to be identical, it is required that their lengths match */
417int acl_match_str(struct acl_test *test, struct acl_pattern *pattern)
418{
Willy Tarreauc8d7c962007-06-17 08:20:33 +0200419 int icase;
420
Willy Tarreaua84d3742007-05-07 00:36:48 +0200421 if (pattern->len != test->len)
Willy Tarreau11382812008-07-09 16:18:21 +0200422 return ACL_PAT_FAIL;
Willy Tarreauc8d7c962007-06-17 08:20:33 +0200423
424 icase = pattern->flags & ACL_PAT_F_IGNORE_CASE;
425 if ((icase && strncasecmp(pattern->ptr.str, test->ptr, test->len) == 0) ||
426 (!icase && strncmp(pattern->ptr.str, test->ptr, test->len) == 0))
Willy Tarreau11382812008-07-09 16:18:21 +0200427 return ACL_PAT_PASS;
428 return ACL_PAT_FAIL;
Willy Tarreaua84d3742007-05-07 00:36:48 +0200429}
430
Willy Tarreauc4262962010-05-10 23:42:40 +0200431/* Lookup a string in the expression's pattern tree. The node is returned if it
432 * exists, otherwise NULL.
433 */
434void *acl_lookup_str(struct acl_test *test, struct acl_expr *expr)
435{
436 /* data are stored in a tree */
437 struct ebmb_node *node;
438 char prev;
439
440 /* we may have to force a trailing zero on the test pattern */
441 prev = test->ptr[test->len];
442 if (prev)
443 test->ptr[test->len] = '\0';
444 node = ebst_lookup(&expr->pattern_tree, test->ptr);
445 if (prev)
446 test->ptr[test->len] = prev;
447 return node;
448}
449
Willy Tarreauf3d25982007-05-08 22:45:09 +0200450/* Executes a regex. It needs to change the data. If it is marked READ_ONLY
451 * then it will be allocated and duplicated in place so that others may use
452 * it later on. Note that this is embarrassing because we always try to avoid
453 * allocating memory at run time.
454 */
455int acl_match_reg(struct acl_test *test, struct acl_pattern *pattern)
456{
457 char old_char;
458 int ret;
459
460 if (unlikely(test->flags & ACL_TEST_F_READ_ONLY)) {
461 char *new_str;
462
463 new_str = calloc(1, test->len + 1);
464 if (!new_str)
Willy Tarreau11382812008-07-09 16:18:21 +0200465 return ACL_PAT_FAIL;
Willy Tarreauf3d25982007-05-08 22:45:09 +0200466
467 memcpy(new_str, test->ptr, test->len);
468 new_str[test->len] = 0;
469 if (test->flags & ACL_TEST_F_MUST_FREE)
470 free(test->ptr);
471 test->ptr = new_str;
472 test->flags |= ACL_TEST_F_MUST_FREE;
473 test->flags &= ~ACL_TEST_F_READ_ONLY;
474 }
475
476 old_char = test->ptr[test->len];
477 test->ptr[test->len] = 0;
478
479 if (regexec(pattern->ptr.reg, test->ptr, 0, NULL, 0) == 0)
Willy Tarreau11382812008-07-09 16:18:21 +0200480 ret = ACL_PAT_PASS;
Willy Tarreauf3d25982007-05-08 22:45:09 +0200481 else
Willy Tarreau11382812008-07-09 16:18:21 +0200482 ret = ACL_PAT_FAIL;
Willy Tarreauf3d25982007-05-08 22:45:09 +0200483
484 test->ptr[test->len] = old_char;
485 return ret;
486}
487
Willy Tarreaua84d3742007-05-07 00:36:48 +0200488/* Checks that the pattern matches the beginning of the tested string. */
489int acl_match_beg(struct acl_test *test, struct acl_pattern *pattern)
490{
Willy Tarreauc8d7c962007-06-17 08:20:33 +0200491 int icase;
492
Willy Tarreaua84d3742007-05-07 00:36:48 +0200493 if (pattern->len > test->len)
Willy Tarreau11382812008-07-09 16:18:21 +0200494 return ACL_PAT_FAIL;
Willy Tarreauc8d7c962007-06-17 08:20:33 +0200495
496 icase = pattern->flags & ACL_PAT_F_IGNORE_CASE;
497 if ((icase && strncasecmp(pattern->ptr.str, test->ptr, pattern->len) != 0) ||
498 (!icase && strncmp(pattern->ptr.str, test->ptr, pattern->len) != 0))
Willy Tarreau11382812008-07-09 16:18:21 +0200499 return ACL_PAT_FAIL;
500 return ACL_PAT_PASS;
Willy Tarreaua84d3742007-05-07 00:36:48 +0200501}
502
503/* Checks that the pattern matches the end of the tested string. */
504int acl_match_end(struct acl_test *test, struct acl_pattern *pattern)
505{
Willy Tarreauc8d7c962007-06-17 08:20:33 +0200506 int icase;
507
Willy Tarreaua84d3742007-05-07 00:36:48 +0200508 if (pattern->len > test->len)
Willy Tarreau11382812008-07-09 16:18:21 +0200509 return ACL_PAT_FAIL;
Willy Tarreauc8d7c962007-06-17 08:20:33 +0200510 icase = pattern->flags & ACL_PAT_F_IGNORE_CASE;
511 if ((icase && strncasecmp(pattern->ptr.str, test->ptr + test->len - pattern->len, pattern->len) != 0) ||
512 (!icase && strncmp(pattern->ptr.str, test->ptr + test->len - pattern->len, pattern->len) != 0))
Willy Tarreau11382812008-07-09 16:18:21 +0200513 return ACL_PAT_FAIL;
514 return ACL_PAT_PASS;
Willy Tarreaua84d3742007-05-07 00:36:48 +0200515}
516
517/* Checks that the pattern is included inside the tested string.
518 * NB: Suboptimal, should be rewritten using a Boyer-Moore method.
519 */
520int acl_match_sub(struct acl_test *test, struct acl_pattern *pattern)
521{
Willy Tarreauc8d7c962007-06-17 08:20:33 +0200522 int icase;
Willy Tarreaua84d3742007-05-07 00:36:48 +0200523 char *end;
524 char *c;
525
526 if (pattern->len > test->len)
Willy Tarreau11382812008-07-09 16:18:21 +0200527 return ACL_PAT_FAIL;
Willy Tarreaua84d3742007-05-07 00:36:48 +0200528
529 end = test->ptr + test->len - pattern->len;
Willy Tarreauc8d7c962007-06-17 08:20:33 +0200530 icase = pattern->flags & ACL_PAT_F_IGNORE_CASE;
531 if (icase) {
532 for (c = test->ptr; c <= end; c++) {
533 if (tolower(*c) != tolower(*pattern->ptr.str))
534 continue;
535 if (strncasecmp(pattern->ptr.str, c, pattern->len) == 0)
Willy Tarreau11382812008-07-09 16:18:21 +0200536 return ACL_PAT_PASS;
Willy Tarreauc8d7c962007-06-17 08:20:33 +0200537 }
538 } else {
539 for (c = test->ptr; c <= end; c++) {
540 if (*c != *pattern->ptr.str)
541 continue;
542 if (strncmp(pattern->ptr.str, c, pattern->len) == 0)
Willy Tarreau11382812008-07-09 16:18:21 +0200543 return ACL_PAT_PASS;
Willy Tarreauc8d7c962007-06-17 08:20:33 +0200544 }
Willy Tarreaua84d3742007-05-07 00:36:48 +0200545 }
Willy Tarreau11382812008-07-09 16:18:21 +0200546 return ACL_PAT_FAIL;
Willy Tarreaua84d3742007-05-07 00:36:48 +0200547}
548
549/* This one is used by other real functions. It checks that the pattern is
550 * included inside the tested string, but enclosed between the specified
551 * delimitor, or a '/' or a '?' or at the beginning or end of the string.
Willy Tarreauc8d7c962007-06-17 08:20:33 +0200552 * The delimitor is stripped at the beginning or end of the pattern.
Willy Tarreaua84d3742007-05-07 00:36:48 +0200553 */
554static int match_word(struct acl_test *test, struct acl_pattern *pattern, char delim)
555{
Willy Tarreauc8d7c962007-06-17 08:20:33 +0200556 int may_match, icase;
Willy Tarreaua84d3742007-05-07 00:36:48 +0200557 char *c, *end;
558 char *ps;
559 int pl;
560
561 pl = pattern->len;
562 ps = pattern->ptr.str;
Willy Tarreauc8d7c962007-06-17 08:20:33 +0200563 while (pl > 0 && (*ps == delim || *ps == '/' || *ps == '?')) {
Willy Tarreaua84d3742007-05-07 00:36:48 +0200564 pl--;
565 ps++;
566 }
567
Willy Tarreauc8d7c962007-06-17 08:20:33 +0200568 while (pl > 0 &&
569 (ps[pl - 1] == delim || ps[pl - 1] == '/' || ps[pl - 1] == '?'))
Willy Tarreaua84d3742007-05-07 00:36:48 +0200570 pl--;
571
572 if (pl > test->len)
Willy Tarreau11382812008-07-09 16:18:21 +0200573 return ACL_PAT_FAIL;
Willy Tarreaua84d3742007-05-07 00:36:48 +0200574
575 may_match = 1;
Willy Tarreauc8d7c962007-06-17 08:20:33 +0200576 icase = pattern->flags & ACL_PAT_F_IGNORE_CASE;
Willy Tarreaua84d3742007-05-07 00:36:48 +0200577 end = test->ptr + test->len - pl;
578 for (c = test->ptr; c <= end; c++) {
579 if (*c == '/' || *c == delim || *c == '?') {
580 may_match = 1;
581 continue;
582 }
Willy Tarreaua84d3742007-05-07 00:36:48 +0200583
Willy Tarreauc8d7c962007-06-17 08:20:33 +0200584 if (!may_match)
585 continue;
586
587 if (icase) {
588 if ((tolower(*c) == tolower(*ps)) &&
589 (strncasecmp(ps, c, pl) == 0) &&
590 (c == end || c[pl] == '/' || c[pl] == delim || c[pl] == '?'))
Willy Tarreau11382812008-07-09 16:18:21 +0200591 return ACL_PAT_PASS;
Willy Tarreauc8d7c962007-06-17 08:20:33 +0200592 } else {
593 if ((*c == *ps) &&
594 (strncmp(ps, c, pl) == 0) &&
595 (c == end || c[pl] == '/' || c[pl] == delim || c[pl] == '?'))
Willy Tarreau11382812008-07-09 16:18:21 +0200596 return ACL_PAT_PASS;
Willy Tarreauc8d7c962007-06-17 08:20:33 +0200597 }
Willy Tarreaua84d3742007-05-07 00:36:48 +0200598 may_match = 0;
599 }
Willy Tarreau11382812008-07-09 16:18:21 +0200600 return ACL_PAT_FAIL;
Willy Tarreaua84d3742007-05-07 00:36:48 +0200601}
602
603/* Checks that the pattern is included inside the tested string, but enclosed
604 * between slashes or at the beginning or end of the string. Slashes at the
605 * beginning or end of the pattern are ignored.
606 */
607int acl_match_dir(struct acl_test *test, struct acl_pattern *pattern)
608{
609 return match_word(test, pattern, '/');
610}
611
612/* Checks that the pattern is included inside the tested string, but enclosed
613 * between dots or at the beginning or end of the string. Dots at the beginning
614 * or end of the pattern are ignored.
615 */
616int acl_match_dom(struct acl_test *test, struct acl_pattern *pattern)
617{
618 return match_word(test, pattern, '.');
619}
620
621/* Checks that the integer in <test> is included between min and max */
Willy Tarreauae8b7962007-06-09 23:10:04 +0200622int acl_match_int(struct acl_test *test, struct acl_pattern *pattern)
Willy Tarreaua84d3742007-05-07 00:36:48 +0200623{
Willy Tarreauae8b7962007-06-09 23:10:04 +0200624 if ((!pattern->val.range.min_set || pattern->val.range.min <= test->i) &&
625 (!pattern->val.range.max_set || test->i <= pattern->val.range.max))
Willy Tarreau11382812008-07-09 16:18:21 +0200626 return ACL_PAT_PASS;
627 return ACL_PAT_FAIL;
Willy Tarreaua84d3742007-05-07 00:36:48 +0200628}
629
Willy Tarreaua67fad92007-05-08 19:50:09 +0200630int acl_match_ip(struct acl_test *test, struct acl_pattern *pattern)
631{
632 struct in_addr *s;
633
634 if (test->i != AF_INET)
Willy Tarreau11382812008-07-09 16:18:21 +0200635 return ACL_PAT_FAIL;
Willy Tarreaua67fad92007-05-08 19:50:09 +0200636
637 s = (void *)test->ptr;
638 if (((s->s_addr ^ pattern->val.ipv4.addr.s_addr) & pattern->val.ipv4.mask.s_addr) == 0)
Willy Tarreau11382812008-07-09 16:18:21 +0200639 return ACL_PAT_PASS;
640 return ACL_PAT_FAIL;
Willy Tarreaua67fad92007-05-08 19:50:09 +0200641}
642
Willy Tarreaub337b532010-05-13 20:03:41 +0200643/* Lookup an IPv4 address in the expression's pattern tree using the longest
644 * match method. The node is returned if it exists, otherwise NULL.
645 */
646void *acl_lookup_ip(struct acl_test *test, struct acl_expr *expr)
647{
648 struct in_addr *s;
649
650 if (test->i != AF_INET)
651 return ACL_PAT_FAIL;
652
653 s = (void *)test->ptr;
654
655 return ebmb_lookup_longest(&expr->pattern_tree, &s->s_addr);
656}
657
Willy Tarreaua84d3742007-05-07 00:36:48 +0200658/* Parse a string. It is allocated and duplicated. */
Willy Tarreauae8b7962007-06-09 23:10:04 +0200659int acl_parse_str(const char **text, struct acl_pattern *pattern, int *opaque)
Willy Tarreaua84d3742007-05-07 00:36:48 +0200660{
661 int len;
662
Willy Tarreauae8b7962007-06-09 23:10:04 +0200663 len = strlen(*text);
Willy Tarreauc4262962010-05-10 23:42:40 +0200664
665 if (pattern->flags & ACL_PAT_F_TREE_OK) {
666 /* we're allowed to put the data in a tree whose root is pointed
667 * to by val.tree.
668 */
669 struct ebmb_node *node;
670
671 node = calloc(1, sizeof(*node) + len + 1);
672 if (!node)
673 return 0;
674 memcpy(node->key, *text, len + 1);
675 if (ebst_insert(pattern->val.tree, node) != node)
676 free(node); /* was a duplicate */
677 pattern->flags |= ACL_PAT_F_TREE; /* this pattern now contains a tree */
678 return 1;
679 }
680
Willy Tarreauae8b7962007-06-09 23:10:04 +0200681 pattern->ptr.str = strdup(*text);
Willy Tarreaua84d3742007-05-07 00:36:48 +0200682 if (!pattern->ptr.str)
683 return 0;
684 pattern->len = len;
685 return 1;
686}
687
Krzysztof Piotr Oledzkif9423ae2010-01-29 19:26:18 +0100688/* Parse and concatenate all further strings into one. */
689int
690acl_parse_strcat(const char **text, struct acl_pattern *pattern, int *opaque)
691{
692
693 int len = 0, i;
694 char *s;
695
696 for (i = 0; *text[i]; i++)
697 len += strlen(text[i])+1;
698
699 pattern->ptr.str = s = calloc(1, len);
700 if (!pattern->ptr.str)
701 return 0;
702
703 for (i = 0; *text[i]; i++)
704 s += sprintf(s, i?" %s":"%s", text[i]);
705
706 pattern->len = len;
707
708 return i;
709}
710
Krzysztof Piotr Oledzki8001d612008-05-31 13:53:23 +0200711/* Free data allocated by acl_parse_reg */
712static void acl_free_reg(void *ptr) {
713
714 regfree((regex_t *)ptr);
715}
716
Willy Tarreauf3d25982007-05-08 22:45:09 +0200717/* Parse a regex. It is allocated. */
Willy Tarreauae8b7962007-06-09 23:10:04 +0200718int acl_parse_reg(const char **text, struct acl_pattern *pattern, int *opaque)
Willy Tarreauf3d25982007-05-08 22:45:09 +0200719{
720 regex_t *preg;
Willy Tarreauc8d7c962007-06-17 08:20:33 +0200721 int icase;
Willy Tarreauf3d25982007-05-08 22:45:09 +0200722
723 preg = calloc(1, sizeof(regex_t));
724
725 if (!preg)
726 return 0;
727
Willy Tarreauc8d7c962007-06-17 08:20:33 +0200728 icase = (pattern->flags & ACL_PAT_F_IGNORE_CASE) ? REG_ICASE : 0;
729 if (regcomp(preg, *text, REG_EXTENDED | REG_NOSUB | icase) != 0) {
Willy Tarreauf3d25982007-05-08 22:45:09 +0200730 free(preg);
731 return 0;
732 }
733
734 pattern->ptr.reg = preg;
Krzysztof Piotr Oledzki8001d612008-05-31 13:53:23 +0200735 pattern->freeptrbuf = &acl_free_reg;
Willy Tarreauf3d25982007-05-08 22:45:09 +0200736 return 1;
737}
738
Willy Tarreauae8b7962007-06-09 23:10:04 +0200739/* Parse a range of positive integers delimited by either ':' or '-'. If only
740 * one integer is read, it is set as both min and max. An operator may be
741 * specified as the prefix, among this list of 5 :
742 *
743 * 0:eq, 1:gt, 2:ge, 3:lt, 4:le
744 *
745 * The default operator is "eq". It supports range matching. Ranges are
746 * rejected for other operators. The operator may be changed at any time.
747 * The operator is stored in the 'opaque' argument.
748 *
Willy Tarreaua84d3742007-05-07 00:36:48 +0200749 */
Willy Tarreauae8b7962007-06-09 23:10:04 +0200750int acl_parse_int(const char **text, struct acl_pattern *pattern, int *opaque)
Willy Tarreaua84d3742007-05-07 00:36:48 +0200751{
Willy Tarreauae8b7962007-06-09 23:10:04 +0200752 signed long long i;
753 unsigned int j, last, skip = 0;
754 const char *ptr = *text;
755
756
Willy Tarreau8f8e6452007-06-17 21:51:38 +0200757 while (!isdigit((unsigned char)*ptr)) {
Willy Tarreau1c7cc5b2010-07-18 10:46:33 +0200758 switch (get_std_op(ptr)) {
759 case STD_OP_EQ: *opaque = 0; break;
760 case STD_OP_GT: *opaque = 1; break;
761 case STD_OP_GE: *opaque = 2; break;
762 case STD_OP_LT: *opaque = 3; break;
763 case STD_OP_LE: *opaque = 4; break;
764 default:
Willy Tarreauae8b7962007-06-09 23:10:04 +0200765 return 0;
Willy Tarreau1c7cc5b2010-07-18 10:46:33 +0200766 }
Willy Tarreauae8b7962007-06-09 23:10:04 +0200767
768 skip++;
769 ptr = text[skip];
770 }
Willy Tarreaua84d3742007-05-07 00:36:48 +0200771
772 last = i = 0;
773 while (1) {
Willy Tarreauae8b7962007-06-09 23:10:04 +0200774 j = *ptr++;
Willy Tarreaua84d3742007-05-07 00:36:48 +0200775 if ((j == '-' || j == ':') && !last) {
776 last++;
777 pattern->val.range.min = i;
778 i = 0;
779 continue;
780 }
781 j -= '0';
782 if (j > 9)
783 // also catches the terminating zero
784 break;
785 i *= 10;
786 i += j;
787 }
Willy Tarreauae8b7962007-06-09 23:10:04 +0200788
789 if (last && *opaque >= 1 && *opaque <= 4)
790 /* having a range with a min or a max is absurd */
791 return 0;
792
Willy Tarreaua84d3742007-05-07 00:36:48 +0200793 if (!last)
794 pattern->val.range.min = i;
795 pattern->val.range.max = i;
Willy Tarreauae8b7962007-06-09 23:10:04 +0200796
797 switch (*opaque) {
798 case 0: /* eq */
799 pattern->val.range.min_set = 1;
800 pattern->val.range.max_set = 1;
801 break;
802 case 1: /* gt */
803 pattern->val.range.min++; /* gt = ge + 1 */
804 case 2: /* ge */
805 pattern->val.range.min_set = 1;
806 pattern->val.range.max_set = 0;
807 break;
808 case 3: /* lt */
809 pattern->val.range.max--; /* lt = le - 1 */
810 case 4: /* le */
811 pattern->val.range.min_set = 0;
812 pattern->val.range.max_set = 1;
813 break;
814 }
815 return skip + 1;
Willy Tarreaua84d3742007-05-07 00:36:48 +0200816}
817
Willy Tarreau4a26d2f2008-07-15 16:05:33 +0200818/* Parse a range of positive 2-component versions delimited by either ':' or
819 * '-'. The version consists in a major and a minor, both of which must be
820 * smaller than 65536, because internally they will be represented as a 32-bit
821 * integer.
822 * If only one version is read, it is set as both min and max. Just like for
823 * pure integers, an operator may be specified as the prefix, among this list
824 * of 5 :
825 *
826 * 0:eq, 1:gt, 2:ge, 3:lt, 4:le
827 *
828 * The default operator is "eq". It supports range matching. Ranges are
829 * rejected for other operators. The operator may be changed at any time.
830 * The operator is stored in the 'opaque' argument. This allows constructs
831 * such as the following one :
832 *
833 * acl obsolete_ssl ssl_req_proto lt 3
834 * acl unsupported_ssl ssl_req_proto gt 3.1
835 * acl valid_ssl ssl_req_proto 3.0-3.1
836 *
837 */
838int acl_parse_dotted_ver(const char **text, struct acl_pattern *pattern, int *opaque)
839{
840 signed long long i;
841 unsigned int j, last, skip = 0;
842 const char *ptr = *text;
843
844
845 while (!isdigit((unsigned char)*ptr)) {
Willy Tarreau1c7cc5b2010-07-18 10:46:33 +0200846 switch (get_std_op(ptr)) {
847 case STD_OP_EQ: *opaque = 0; break;
848 case STD_OP_GT: *opaque = 1; break;
849 case STD_OP_GE: *opaque = 2; break;
850 case STD_OP_LT: *opaque = 3; break;
851 case STD_OP_LE: *opaque = 4; break;
852 default:
Willy Tarreau4a26d2f2008-07-15 16:05:33 +0200853 return 0;
Willy Tarreau1c7cc5b2010-07-18 10:46:33 +0200854 }
Willy Tarreau4a26d2f2008-07-15 16:05:33 +0200855
856 skip++;
857 ptr = text[skip];
858 }
859
860 last = i = 0;
861 while (1) {
862 j = *ptr++;
863 if (j == '.') {
864 /* minor part */
865 if (i >= 65536)
866 return 0;
867 i <<= 16;
868 continue;
869 }
870 if ((j == '-' || j == ':') && !last) {
871 last++;
872 if (i < 65536)
873 i <<= 16;
874 pattern->val.range.min = i;
875 i = 0;
876 continue;
877 }
878 j -= '0';
879 if (j > 9)
880 // also catches the terminating zero
881 break;
882 i = (i & 0xFFFF0000) + (i & 0xFFFF) * 10;
883 i += j;
884 }
885
886 /* if we only got a major version, let's shift it now */
887 if (i < 65536)
888 i <<= 16;
889
890 if (last && *opaque >= 1 && *opaque <= 4)
891 /* having a range with a min or a max is absurd */
892 return 0;
893
894 if (!last)
895 pattern->val.range.min = i;
896 pattern->val.range.max = i;
897
898 switch (*opaque) {
899 case 0: /* eq */
900 pattern->val.range.min_set = 1;
901 pattern->val.range.max_set = 1;
902 break;
903 case 1: /* gt */
904 pattern->val.range.min++; /* gt = ge + 1 */
905 case 2: /* ge */
906 pattern->val.range.min_set = 1;
907 pattern->val.range.max_set = 0;
908 break;
909 case 3: /* lt */
910 pattern->val.range.max--; /* lt = le - 1 */
911 case 4: /* le */
912 pattern->val.range.min_set = 0;
913 pattern->val.range.max_set = 1;
914 break;
915 }
916 return skip + 1;
917}
918
Willy Tarreaua67fad92007-05-08 19:50:09 +0200919/* Parse an IP address and an optional mask in the form addr[/mask].
920 * The addr may either be an IPv4 address or a hostname. The mask
921 * may either be a dotted mask or a number of bits. Returns 1 if OK,
922 * otherwise 0.
923 */
Willy Tarreauae8b7962007-06-09 23:10:04 +0200924int acl_parse_ip(const char **text, struct acl_pattern *pattern, int *opaque)
Willy Tarreaua67fad92007-05-08 19:50:09 +0200925{
Willy Tarreaub337b532010-05-13 20:03:41 +0200926 struct eb_root *tree = NULL;
927 if (pattern->flags & ACL_PAT_F_TREE_OK)
928 tree = pattern->val.tree;
929
930 if (str2net(*text, &pattern->val.ipv4.addr, &pattern->val.ipv4.mask)) {
931 unsigned int mask = ntohl(pattern->val.ipv4.mask.s_addr);
932 struct ebmb_node *node;
933 /* check if the mask is contiguous so that we can insert the
934 * network into the tree. A continuous mask has only ones on
935 * the left. This means that this mask + its lower bit added
936 * once again is null.
937 */
938 if (mask + (mask & -mask) == 0 && tree) {
939 mask = mask ? 33 - flsnz(mask & -mask) : 0; /* equals cidr value */
940 /* FIXME: insert <addr>/<mask> into the tree here */
941 node = calloc(1, sizeof(*node) + 4); /* reserve 4 bytes for IPv4 address */
942 if (!node)
943 return 0;
944 memcpy(node->key, &pattern->val.ipv4.addr, 4); /* network byte order */
945 node->node.pfx = mask;
946 if (ebmb_insert_prefix(tree, node, 4) != node)
947 free(node); /* was a duplicate */
948 pattern->flags |= ACL_PAT_F_TREE;
949 return 1;
950 }
Willy Tarreauae8b7962007-06-09 23:10:04 +0200951 return 1;
Willy Tarreaub337b532010-05-13 20:03:41 +0200952 }
Willy Tarreauae8b7962007-06-09 23:10:04 +0200953 else
954 return 0;
Willy Tarreaua67fad92007-05-08 19:50:09 +0200955}
956
Willy Tarreaua84d3742007-05-07 00:36:48 +0200957/*
958 * Registers the ACL keyword list <kwl> as a list of valid keywords for next
959 * parsing sessions.
960 */
961void acl_register_keywords(struct acl_kw_list *kwl)
962{
963 LIST_ADDQ(&acl_keywords.list, &kwl->list);
964}
965
966/*
967 * Unregisters the ACL keyword list <kwl> from the list of valid keywords.
968 */
969void acl_unregister_keywords(struct acl_kw_list *kwl)
970{
971 LIST_DEL(&kwl->list);
972 LIST_INIT(&kwl->list);
973}
974
975/* Return a pointer to the ACL <name> within the list starting at <head>, or
976 * NULL if not found.
977 */
978struct acl *find_acl_by_name(const char *name, struct list *head)
979{
980 struct acl *acl;
981 list_for_each_entry(acl, head, list) {
982 if (strcmp(acl->name, name) == 0)
983 return acl;
984 }
985 return NULL;
986}
987
988/* Return a pointer to the ACL keyword <kw>, or NULL if not found. Note that if
989 * <kw> contains an opening parenthesis, only the left part of it is checked.
990 */
991struct acl_keyword *find_acl_kw(const char *kw)
992{
993 int index;
994 const char *kwend;
995 struct acl_kw_list *kwl;
996
997 kwend = strchr(kw, '(');
998 if (!kwend)
999 kwend = kw + strlen(kw);
1000
1001 list_for_each_entry(kwl, &acl_keywords.list, list) {
1002 for (index = 0; kwl->kw[index].kw != NULL; index++) {
1003 if ((strncmp(kwl->kw[index].kw, kw, kwend - kw) == 0) &&
1004 kwl->kw[index].kw[kwend-kw] == 0)
1005 return &kwl->kw[index];
1006 }
1007 }
1008 return NULL;
1009}
1010
1011static void free_pattern(struct acl_pattern *pat)
1012{
Krzysztof Piotr Oledzki8001d612008-05-31 13:53:23 +02001013
1014 if (pat->ptr.ptr) {
1015 if (pat->freeptrbuf)
1016 pat->freeptrbuf(pat->ptr.ptr);
1017
Willy Tarreaua84d3742007-05-07 00:36:48 +02001018 free(pat->ptr.ptr);
Krzysztof Piotr Oledzki8001d612008-05-31 13:53:23 +02001019 }
1020
Willy Tarreaua84d3742007-05-07 00:36:48 +02001021 free(pat);
1022}
1023
1024static void free_pattern_list(struct list *head)
1025{
1026 struct acl_pattern *pat, *tmp;
1027 list_for_each_entry_safe(pat, tmp, head, list)
1028 free_pattern(pat);
1029}
1030
Willy Tarreaue56cda92010-05-11 23:25:05 +02001031static void free_pattern_tree(struct eb_root *root)
1032{
1033 struct eb_node *node, *next;
1034 node = eb_first(root);
1035 while (node) {
1036 next = eb_next(node);
1037 free(node);
1038 node = next;
1039 }
1040}
1041
Willy Tarreaua84d3742007-05-07 00:36:48 +02001042static struct acl_expr *prune_acl_expr(struct acl_expr *expr)
1043{
1044 free_pattern_list(&expr->patterns);
Willy Tarreaue56cda92010-05-11 23:25:05 +02001045 free_pattern_tree(&expr->pattern_tree);
Willy Tarreaua84d3742007-05-07 00:36:48 +02001046 LIST_INIT(&expr->patterns);
Krzysztof Piotr Oledzkif9423ae2010-01-29 19:26:18 +01001047 if (expr->arg_len && expr->arg.str)
Willy Tarreaua84d3742007-05-07 00:36:48 +02001048 free(expr->arg.str);
1049 expr->kw->use_cnt--;
1050 return expr;
1051}
1052
Willy Tarreau2b5285d2010-05-09 23:45:24 +02001053static int acl_read_patterns_from_file( struct acl_keyword *aclkw,
1054 struct acl_expr *expr,
1055 const char *filename, int patflags)
1056{
1057 FILE *file;
1058 char *c;
1059 const char *args[2];
1060 struct acl_pattern *pattern;
1061 int opaque;
1062
1063 file = fopen(filename, "r");
1064 if (!file)
1065 return 0;
1066
1067 /* now parse all patterns. The file may contain only one pattern per
1068 * line. If the line contains spaces, they will be part of the pattern.
1069 * The pattern stops at the first CR, LF or EOF encountered.
1070 */
1071 opaque = 0;
Willy Tarreaue56cda92010-05-11 23:25:05 +02001072 pattern = NULL;
Willy Tarreau2b5285d2010-05-09 23:45:24 +02001073 args[1] = "";
1074 while (fgets(trash, sizeof(trash), file) != NULL) {
1075
1076 c = trash;
Willy Tarreau58215a02010-05-13 22:07:43 +02001077
1078 /* ignore lines beginning with a dash */
1079 if (*c == '#')
1080 continue;
1081
1082 /* strip leading spaces and tabs */
1083 while (*c == ' ' || *c == '\t')
1084 c++;
1085
Willy Tarreau58215a02010-05-13 22:07:43 +02001086
1087 args[0] = c;
Willy Tarreau2b5285d2010-05-09 23:45:24 +02001088 while (*c && *c != '\n' && *c != '\r')
1089 c++;
1090 *c = 0;
1091
Willy Tarreau51091962011-01-03 21:04:10 +01001092 /* empty lines are ignored too */
1093 if (c == args[0])
1094 continue;
1095
Willy Tarreaue56cda92010-05-11 23:25:05 +02001096 /* we keep the previous pattern along iterations as long as it's not used */
1097 if (!pattern)
1098 pattern = (struct acl_pattern *)malloc(sizeof(*pattern));
Willy Tarreau2b5285d2010-05-09 23:45:24 +02001099 if (!pattern)
1100 goto out_close;
Willy Tarreaue56cda92010-05-11 23:25:05 +02001101
1102 memset(pattern, 0, sizeof(*pattern));
Willy Tarreau2b5285d2010-05-09 23:45:24 +02001103 pattern->flags = patflags;
1104
Willy Tarreaue56cda92010-05-11 23:25:05 +02001105 if ((aclkw->requires & ACL_MAY_LOOKUP) && !(pattern->flags & ACL_PAT_F_IGNORE_CASE)) {
1106 /* we pre-set the data pointer to the tree's head so that functions
1107 * which are able to insert in a tree know where to do that.
1108 */
1109 pattern->flags |= ACL_PAT_F_TREE_OK;
1110 pattern->val.tree = &expr->pattern_tree;
1111 }
1112
Willy Tarreau2b5285d2010-05-09 23:45:24 +02001113 if (!aclkw->parse(args, pattern, &opaque))
1114 goto out_free_pattern;
Willy Tarreaue56cda92010-05-11 23:25:05 +02001115
1116 /* if the parser did not feed the tree, let's chain the pattern to the list */
1117 if (!(pattern->flags & ACL_PAT_F_TREE)) {
1118 LIST_ADDQ(&expr->patterns, &pattern->list);
1119 pattern = NULL; /* get a new one */
1120 }
Willy Tarreau2b5285d2010-05-09 23:45:24 +02001121 }
Willy Tarreaue56cda92010-05-11 23:25:05 +02001122 if (pattern)
1123 free_pattern(pattern);
Willy Tarreau2b5285d2010-05-09 23:45:24 +02001124 return 1;
1125
1126 out_free_pattern:
1127 free_pattern(pattern);
1128 out_close:
1129 fclose(file);
1130 return 0;
1131}
1132
Willy Tarreaua84d3742007-05-07 00:36:48 +02001133/* Parse an ACL expression starting at <args>[0], and return it.
1134 * Right now, the only accepted syntax is :
1135 * <subject> [<value>...]
1136 */
1137struct acl_expr *parse_acl_expr(const char **args)
1138{
1139 __label__ out_return, out_free_expr, out_free_pattern;
1140 struct acl_expr *expr;
1141 struct acl_keyword *aclkw;
1142 struct acl_pattern *pattern;
Willy Tarreauc8d7c962007-06-17 08:20:33 +02001143 int opaque, patflags;
Willy Tarreaua84d3742007-05-07 00:36:48 +02001144 const char *arg;
1145
1146 aclkw = find_acl_kw(args[0]);
1147 if (!aclkw || !aclkw->parse)
1148 goto out_return;
1149
1150 expr = (struct acl_expr *)calloc(1, sizeof(*expr));
1151 if (!expr)
1152 goto out_return;
1153
1154 expr->kw = aclkw;
1155 aclkw->use_cnt++;
1156 LIST_INIT(&expr->patterns);
Willy Tarreaue56cda92010-05-11 23:25:05 +02001157 expr->pattern_tree = EB_ROOT_UNIQUE;
Willy Tarreaua84d3742007-05-07 00:36:48 +02001158 expr->arg.str = NULL;
Willy Tarreaubb768912007-06-10 11:17:01 +02001159 expr->arg_len = 0;
Willy Tarreaua84d3742007-05-07 00:36:48 +02001160
1161 arg = strchr(args[0], '(');
1162 if (arg != NULL) {
1163 char *end, *arg2;
1164 /* there is an argument in the form "subject(arg)" */
1165 arg++;
1166 end = strchr(arg, ')');
1167 if (!end)
1168 goto out_free_expr;
Willy Tarreauac778f52010-01-26 19:02:46 +01001169 arg2 = my_strndup(arg, end - arg);
Willy Tarreau1edb1442010-01-27 20:13:38 +01001170 if (!arg2)
Willy Tarreaua84d3742007-05-07 00:36:48 +02001171 goto out_free_expr;
Willy Tarreaubb768912007-06-10 11:17:01 +02001172 expr->arg_len = end - arg;
Willy Tarreaua84d3742007-05-07 00:36:48 +02001173 expr->arg.str = arg2;
1174 }
1175
Willy Tarreaua84d3742007-05-07 00:36:48 +02001176 args++;
Willy Tarreauc8d7c962007-06-17 08:20:33 +02001177
1178 /* check for options before patterns. Supported options are :
1179 * -i : ignore case for all patterns by default
1180 * -f : read patterns from those files
1181 * -- : everything after this is not an option
1182 */
1183 patflags = 0;
1184 while (**args == '-') {
1185 if ((*args)[1] == 'i')
1186 patflags |= ACL_PAT_F_IGNORE_CASE;
Willy Tarreau2b5285d2010-05-09 23:45:24 +02001187 else if ((*args)[1] == 'f') {
1188 if (!acl_read_patterns_from_file(aclkw, expr, args[1], patflags | ACL_PAT_F_FROM_FILE))
1189 goto out_free_expr;
1190 args++;
1191 }
Willy Tarreauc8d7c962007-06-17 08:20:33 +02001192 else if ((*args)[1] == '-') {
1193 args++;
1194 break;
1195 }
1196 else
1197 break;
1198 args++;
1199 }
1200
1201 /* now parse all patterns */
Willy Tarreauae8b7962007-06-09 23:10:04 +02001202 opaque = 0;
Willy Tarreaua84d3742007-05-07 00:36:48 +02001203 while (**args) {
Willy Tarreauae8b7962007-06-09 23:10:04 +02001204 int ret;
Willy Tarreaua84d3742007-05-07 00:36:48 +02001205 pattern = (struct acl_pattern *)calloc(1, sizeof(*pattern));
1206 if (!pattern)
1207 goto out_free_expr;
Willy Tarreauc8d7c962007-06-17 08:20:33 +02001208 pattern->flags = patflags;
1209
Willy Tarreauae8b7962007-06-09 23:10:04 +02001210 ret = aclkw->parse(args, pattern, &opaque);
1211 if (!ret)
Willy Tarreaua84d3742007-05-07 00:36:48 +02001212 goto out_free_pattern;
1213 LIST_ADDQ(&expr->patterns, &pattern->list);
Willy Tarreauae8b7962007-06-09 23:10:04 +02001214 args += ret;
Willy Tarreaua84d3742007-05-07 00:36:48 +02001215 }
1216
1217 return expr;
1218
1219 out_free_pattern:
1220 free_pattern(pattern);
1221 out_free_expr:
1222 prune_acl_expr(expr);
1223 free(expr);
1224 out_return:
1225 return NULL;
1226}
1227
Krzysztof Piotr Oledzkia643baf2008-05-29 23:53:44 +02001228/* Purge everything in the acl <acl>, then return <acl>. */
1229struct acl *prune_acl(struct acl *acl) {
1230
1231 struct acl_expr *expr, *exprb;
1232
1233 free(acl->name);
1234
1235 list_for_each_entry_safe(expr, exprb, &acl->expr, list) {
1236 LIST_DEL(&expr->list);
1237 prune_acl_expr(expr);
1238 free(expr);
1239 }
1240
1241 return acl;
1242}
1243
Willy Tarreaua84d3742007-05-07 00:36:48 +02001244/* Parse an ACL with the name starting at <args>[0], and with a list of already
1245 * known ACLs in <acl>. If the ACL was not in the list, it will be added.
Willy Tarreau2a56c5e2010-03-15 16:13:29 +01001246 * A pointer to that ACL is returned. If the ACL has an empty name, then it's
1247 * an anonymous one and it won't be merged with any other one.
Willy Tarreaua84d3742007-05-07 00:36:48 +02001248 *
1249 * args syntax: <aclname> <acl_expr>
1250 */
1251struct acl *parse_acl(const char **args, struct list *known_acl)
1252{
1253 __label__ out_return, out_free_acl_expr, out_free_name;
1254 struct acl *cur_acl;
1255 struct acl_expr *acl_expr;
1256 char *name;
1257
Willy Tarreau2a56c5e2010-03-15 16:13:29 +01001258 if (**args && invalid_char(*args))
Willy Tarreau2e74c3f2007-12-02 18:45:09 +01001259 goto out_return;
1260
Willy Tarreaua84d3742007-05-07 00:36:48 +02001261 acl_expr = parse_acl_expr(args + 1);
1262 if (!acl_expr)
1263 goto out_return;
1264
Willy Tarreau404e8ab2009-07-26 19:40:40 +02001265 /* Check for args beginning with an opening parenthesis just after the
1266 * subject, as this is almost certainly a typo. Right now we can only
1267 * emit a warning, so let's do so.
1268 */
Krzysztof Piotr Oledzki4cdd8312009-10-05 00:23:35 +02001269 if (!strchr(args[1], '(') && *args[2] == '(')
Willy Tarreau404e8ab2009-07-26 19:40:40 +02001270 Warning("parsing acl '%s' :\n"
1271 " matching '%s' for pattern '%s' is likely a mistake and probably\n"
1272 " not what you want. Maybe you need to remove the extraneous space before '('.\n"
1273 " If you are really sure this is not an error, please insert '--' between the\n"
1274 " match and the pattern to make this warning message disappear.\n",
1275 args[0], args[1], args[2]);
1276
Willy Tarreau2a56c5e2010-03-15 16:13:29 +01001277 if (*args[0])
1278 cur_acl = find_acl_by_name(args[0], known_acl);
1279 else
1280 cur_acl = NULL;
1281
Willy Tarreaua84d3742007-05-07 00:36:48 +02001282 if (!cur_acl) {
1283 name = strdup(args[0]);
1284 if (!name)
1285 goto out_free_acl_expr;
1286 cur_acl = (struct acl *)calloc(1, sizeof(*cur_acl));
1287 if (cur_acl == NULL)
1288 goto out_free_name;
1289
1290 LIST_INIT(&cur_acl->expr);
1291 LIST_ADDQ(known_acl, &cur_acl->list);
1292 cur_acl->name = name;
1293 }
1294
Willy Tarreaua9802632008-07-25 19:13:19 +02001295 cur_acl->requires |= acl_expr->kw->requires;
Willy Tarreaua84d3742007-05-07 00:36:48 +02001296 LIST_ADDQ(&cur_acl->expr, &acl_expr->list);
1297 return cur_acl;
1298
1299 out_free_name:
1300 free(name);
1301 out_free_acl_expr:
1302 prune_acl_expr(acl_expr);
1303 free(acl_expr);
1304 out_return:
1305 return NULL;
1306}
1307
Willy Tarreau16fbe822007-06-17 11:54:31 +02001308/* Some useful ACLs provided by default. Only those used are allocated. */
1309
1310const struct {
1311 const char *name;
1312 const char *expr[4]; /* put enough for longest expression */
1313} default_acl_list[] = {
Willy Tarreau58393e12008-07-20 10:39:22 +02001314 { .name = "TRUE", .expr = {"always_true",""}},
1315 { .name = "FALSE", .expr = {"always_false",""}},
Willy Tarreau16fbe822007-06-17 11:54:31 +02001316 { .name = "LOCALHOST", .expr = {"src","127.0.0.1/8",""}},
Willy Tarreau2492d5b2009-07-11 00:06:00 +02001317 { .name = "HTTP", .expr = {"req_proto_http",""}},
Willy Tarreau16fbe822007-06-17 11:54:31 +02001318 { .name = "HTTP_1.0", .expr = {"req_ver","1.0",""}},
1319 { .name = "HTTP_1.1", .expr = {"req_ver","1.1",""}},
1320 { .name = "METH_CONNECT", .expr = {"method","CONNECT",""}},
1321 { .name = "METH_GET", .expr = {"method","GET","HEAD",""}},
1322 { .name = "METH_HEAD", .expr = {"method","HEAD",""}},
1323 { .name = "METH_OPTIONS", .expr = {"method","OPTIONS",""}},
1324 { .name = "METH_POST", .expr = {"method","POST",""}},
1325 { .name = "METH_TRACE", .expr = {"method","TRACE",""}},
1326 { .name = "HTTP_URL_ABS", .expr = {"url_reg","^[^/:]*://",""}},
1327 { .name = "HTTP_URL_SLASH", .expr = {"url_beg","/",""}},
1328 { .name = "HTTP_URL_STAR", .expr = {"url","*",""}},
1329 { .name = "HTTP_CONTENT", .expr = {"hdr_val(content-length)","gt","0",""}},
Emeric Brunbede3d02009-06-30 17:54:00 +02001330 { .name = "RDP_COOKIE", .expr = {"req_rdp_cookie_cnt","gt","0",""}},
Willy Tarreauc6317702008-07-20 09:29:50 +02001331 { .name = "REQ_CONTENT", .expr = {"req_len","gt","0",""}},
Willy Tarreaub6fb4202008-07-20 11:18:28 +02001332 { .name = "WAIT_END", .expr = {"wait_end",""}},
Willy Tarreau16fbe822007-06-17 11:54:31 +02001333 { .name = NULL, .expr = {""}}
1334};
1335
1336/* Find a default ACL from the default_acl list, compile it and return it.
1337 * If the ACL is not found, NULL is returned. In theory, it cannot fail,
1338 * except when default ACLs are broken, in which case it will return NULL.
1339 * If <known_acl> is not NULL, the ACL will be queued at its tail.
1340 */
1341struct acl *find_acl_default(const char *acl_name, struct list *known_acl)
1342{
1343 __label__ out_return, out_free_acl_expr, out_free_name;
1344 struct acl *cur_acl;
1345 struct acl_expr *acl_expr;
1346 char *name;
1347 int index;
1348
1349 for (index = 0; default_acl_list[index].name != NULL; index++) {
1350 if (strcmp(acl_name, default_acl_list[index].name) == 0)
1351 break;
1352 }
1353
1354 if (default_acl_list[index].name == NULL)
1355 return NULL;
1356
1357 acl_expr = parse_acl_expr((const char **)default_acl_list[index].expr);
1358 if (!acl_expr)
1359 goto out_return;
1360
1361 name = strdup(acl_name);
1362 if (!name)
1363 goto out_free_acl_expr;
1364 cur_acl = (struct acl *)calloc(1, sizeof(*cur_acl));
1365 if (cur_acl == NULL)
1366 goto out_free_name;
1367
1368 cur_acl->name = name;
Willy Tarreaua55b7dc2009-07-12 09:21:30 +02001369 cur_acl->requires |= acl_expr->kw->requires;
Willy Tarreau16fbe822007-06-17 11:54:31 +02001370 LIST_INIT(&cur_acl->expr);
1371 LIST_ADDQ(&cur_acl->expr, &acl_expr->list);
1372 if (known_acl)
1373 LIST_ADDQ(known_acl, &cur_acl->list);
1374
1375 return cur_acl;
1376
1377 out_free_name:
1378 free(name);
1379 out_free_acl_expr:
1380 prune_acl_expr(acl_expr);
1381 free(acl_expr);
1382 out_return:
1383 return NULL;
1384}
Willy Tarreaua84d3742007-05-07 00:36:48 +02001385
1386/* Purge everything in the acl_cond <cond>, then return <cond>. */
1387struct acl_cond *prune_acl_cond(struct acl_cond *cond)
1388{
1389 struct acl_term_suite *suite, *tmp_suite;
1390 struct acl_term *term, *tmp_term;
1391
1392 /* iterate through all term suites and free all terms and all suites */
1393 list_for_each_entry_safe(suite, tmp_suite, &cond->suites, list) {
1394 list_for_each_entry_safe(term, tmp_term, &suite->terms, list)
1395 free(term);
1396 free(suite);
1397 }
1398 return cond;
1399}
1400
1401/* Parse an ACL condition starting at <args>[0], relying on a list of already
1402 * known ACLs passed in <known_acl>. The new condition is returned (or NULL in
1403 * case of low memory). Supports multiple conditions separated by "or".
1404 */
1405struct acl_cond *parse_acl_cond(const char **args, struct list *known_acl, int pol)
1406{
1407 __label__ out_return, out_free_suite, out_free_term;
Willy Tarreau74b98a82007-06-16 19:35:18 +02001408 int arg, neg;
Willy Tarreaua84d3742007-05-07 00:36:48 +02001409 const char *word;
1410 struct acl *cur_acl;
1411 struct acl_term *cur_term;
1412 struct acl_term_suite *cur_suite;
1413 struct acl_cond *cond;
1414
1415 cond = (struct acl_cond *)calloc(1, sizeof(*cond));
1416 if (cond == NULL)
1417 goto out_return;
1418
1419 LIST_INIT(&cond->list);
1420 LIST_INIT(&cond->suites);
1421 cond->pol = pol;
1422
1423 cur_suite = NULL;
Willy Tarreau74b98a82007-06-16 19:35:18 +02001424 neg = 0;
Willy Tarreaua84d3742007-05-07 00:36:48 +02001425 for (arg = 0; *args[arg]; arg++) {
1426 word = args[arg];
1427
1428 /* remove as many exclamation marks as we can */
1429 while (*word == '!') {
1430 neg = !neg;
1431 word++;
1432 }
1433
1434 /* an empty word is allowed because we cannot force the user to
1435 * always think about not leaving exclamation marks alone.
1436 */
1437 if (!*word)
1438 continue;
1439
Willy Tarreau16fbe822007-06-17 11:54:31 +02001440 if (strcasecmp(word, "or") == 0 || strcmp(word, "||") == 0) {
Willy Tarreaua84d3742007-05-07 00:36:48 +02001441 /* new term suite */
1442 cur_suite = NULL;
1443 neg = 0;
1444 continue;
1445 }
1446
Willy Tarreau95fa4692010-02-01 13:05:50 +01001447 if (strcmp(word, "{") == 0) {
1448 /* we may have a complete ACL expression between two braces,
1449 * find the last one.
1450 */
1451 int arg_end = arg + 1;
1452 const char **args_new;
1453
1454 while (*args[arg_end] && strcmp(args[arg_end], "}") != 0)
1455 arg_end++;
1456
1457 if (!*args[arg_end])
1458 goto out_free_suite;
1459
1460 args_new = calloc(1, (arg_end - arg + 1) * sizeof(*args_new));
1461 if (!args_new)
1462 goto out_free_suite;
1463
Willy Tarreau2a56c5e2010-03-15 16:13:29 +01001464 args_new[0] = "";
Willy Tarreau95fa4692010-02-01 13:05:50 +01001465 memcpy(args_new + 1, args + arg + 1, (arg_end - arg) * sizeof(*args_new));
1466 args_new[arg_end - arg] = "";
1467 cur_acl = parse_acl(args_new, known_acl);
1468 free(args_new);
1469
1470 if (!cur_acl)
Willy Tarreau16fbe822007-06-17 11:54:31 +02001471 goto out_free_suite;
Willy Tarreau95fa4692010-02-01 13:05:50 +01001472 arg = arg_end;
1473 }
1474 else {
1475 /* search for <word> in the known ACL names. If we do not find
1476 * it, let's look for it in the default ACLs, and if found, add
1477 * it to the list of ACLs of this proxy. This makes it possible
1478 * to override them.
1479 */
1480 cur_acl = find_acl_by_name(word, known_acl);
1481 if (cur_acl == NULL) {
1482 cur_acl = find_acl_default(word, known_acl);
1483 if (cur_acl == NULL)
1484 goto out_free_suite;
1485 }
Willy Tarreau16fbe822007-06-17 11:54:31 +02001486 }
Willy Tarreaua84d3742007-05-07 00:36:48 +02001487
1488 cur_term = (struct acl_term *)calloc(1, sizeof(*cur_term));
1489 if (cur_term == NULL)
1490 goto out_free_suite;
1491
1492 cur_term->acl = cur_acl;
1493 cur_term->neg = neg;
Willy Tarreaua9802632008-07-25 19:13:19 +02001494 cond->requires |= cur_acl->requires;
Willy Tarreaua84d3742007-05-07 00:36:48 +02001495
1496 if (!cur_suite) {
1497 cur_suite = (struct acl_term_suite *)calloc(1, sizeof(*cur_suite));
1498 if (cur_term == NULL)
1499 goto out_free_term;
1500 LIST_INIT(&cur_suite->terms);
1501 LIST_ADDQ(&cond->suites, &cur_suite->list);
1502 }
1503 LIST_ADDQ(&cur_suite->terms, &cur_term->list);
Willy Tarreau74b98a82007-06-16 19:35:18 +02001504 neg = 0;
Willy Tarreaua84d3742007-05-07 00:36:48 +02001505 }
1506
1507 return cond;
1508
1509 out_free_term:
1510 free(cur_term);
1511 out_free_suite:
1512 prune_acl_cond(cond);
1513 free(cond);
1514 out_return:
1515 return NULL;
1516}
1517
Willy Tarreau2bbba412010-01-28 16:48:33 +01001518/* Builds an ACL condition starting at the if/unless keyword. The complete
1519 * condition is returned. NULL is returned in case of error or if the first
1520 * word is neither "if" nor "unless". It automatically sets the file name and
1521 * the line number in the condition for better error reporting, and adds the
1522 * ACL requirements to the proxy's acl_requires.
1523 */
1524struct acl_cond *build_acl_cond(const char *file, int line, struct proxy *px, const char **args)
1525{
1526 int pol = ACL_COND_NONE;
1527 struct acl_cond *cond = NULL;
1528
1529 if (!strcmp(*args, "if")) {
1530 pol = ACL_COND_IF;
1531 args++;
1532 }
1533 else if (!strcmp(*args, "unless")) {
1534 pol = ACL_COND_UNLESS;
1535 args++;
1536 }
1537 else
1538 return NULL;
1539
1540 cond = parse_acl_cond(args, &px->acl, pol);
1541 if (!cond)
1542 return NULL;
1543
1544 cond->file = file;
1545 cond->line = line;
1546 px->acl_requires |= cond->requires;
1547
1548 return cond;
1549}
1550
Willy Tarreau11382812008-07-09 16:18:21 +02001551/* Execute condition <cond> and return either ACL_PAT_FAIL, ACL_PAT_MISS or
Willy Tarreaub6866442008-07-14 23:54:42 +02001552 * ACL_PAT_PASS depending on the test results. ACL_PAT_MISS may only be
1553 * returned if <dir> contains ACL_PARTIAL, indicating that incomplete data
1554 * is being examined.
1555 * This function only computes the condition, it does not apply the polarity
1556 * required by IF/UNLESS, it's up to the caller to do this using something like
1557 * this :
Willy Tarreau11382812008-07-09 16:18:21 +02001558 *
1559 * res = acl_pass(res);
Willy Tarreaub6866442008-07-14 23:54:42 +02001560 * if (res == ACL_PAT_MISS)
1561 * return 0;
Willy Tarreau11382812008-07-09 16:18:21 +02001562 * if (cond->pol == ACL_COND_UNLESS)
1563 * res = !res;
Willy Tarreaua84d3742007-05-07 00:36:48 +02001564 */
Willy Tarreaud41f8d82007-06-10 10:06:18 +02001565int acl_exec_cond(struct acl_cond *cond, struct proxy *px, struct session *l4, void *l7, int dir)
Willy Tarreaua84d3742007-05-07 00:36:48 +02001566{
1567 __label__ fetch_next;
1568 struct acl_term_suite *suite;
1569 struct acl_term *term;
1570 struct acl_expr *expr;
1571 struct acl *acl;
1572 struct acl_pattern *pattern;
1573 struct acl_test test;
Willy Tarreau11382812008-07-09 16:18:21 +02001574 int acl_res, suite_res, cond_res;
Willy Tarreaua84d3742007-05-07 00:36:48 +02001575
Willy Tarreau11382812008-07-09 16:18:21 +02001576 /* We're doing a logical OR between conditions so we initialize to FAIL.
1577 * The MISS status is propagated down from the suites.
1578 */
Willy Tarreaua84d3742007-05-07 00:36:48 +02001579 cond_res = ACL_PAT_FAIL;
1580 list_for_each_entry(suite, &cond->suites, list) {
Willy Tarreau11382812008-07-09 16:18:21 +02001581 /* Evaluate condition suite <suite>. We stop at the first term
1582 * which returns ACL_PAT_FAIL. The MISS status is still propagated
1583 * in case of uncertainty in the result.
Willy Tarreaua84d3742007-05-07 00:36:48 +02001584 */
1585
1586 /* we're doing a logical AND between terms, so we must set the
1587 * initial value to PASS.
1588 */
1589 suite_res = ACL_PAT_PASS;
1590 list_for_each_entry(term, &suite->terms, list) {
1591 acl = term->acl;
1592
1593 /* FIXME: use cache !
1594 * check acl->cache_idx for this.
1595 */
1596
1597 /* ACL result not cached. Let's scan all the expressions
1598 * and use the first one to match.
1599 */
1600 acl_res = ACL_PAT_FAIL;
1601 list_for_each_entry(expr, &acl->expr, list) {
Willy Tarreaud41f8d82007-06-10 10:06:18 +02001602 /* we need to reset context and flags */
1603 memset(&test, 0, sizeof(test));
Willy Tarreaua84d3742007-05-07 00:36:48 +02001604 fetch_next:
Willy Tarreaub6866442008-07-14 23:54:42 +02001605 if (!expr->kw->fetch(px, l4, l7, dir, expr, &test)) {
1606 /* maybe we could not fetch because of missing data */
1607 if (test.flags & ACL_TEST_F_MAY_CHANGE && dir & ACL_PARTIAL)
1608 acl_res |= ACL_PAT_MISS;
Willy Tarreaua84d3742007-05-07 00:36:48 +02001609 continue;
Willy Tarreaub6866442008-07-14 23:54:42 +02001610 }
Willy Tarreaua84d3742007-05-07 00:36:48 +02001611
Willy Tarreaua79534f2008-07-20 10:13:37 +02001612 if (test.flags & ACL_TEST_F_RES_SET) {
1613 if (test.flags & ACL_TEST_F_RES_PASS)
1614 acl_res |= ACL_PAT_PASS;
1615 else
1616 acl_res |= ACL_PAT_FAIL;
1617 }
1618 else {
Willy Tarreau020534d2010-05-16 21:45:45 +02001619 if (!eb_is_empty(&expr->pattern_tree)) {
Willy Tarreauc4262962010-05-10 23:42:40 +02001620 /* a tree is present, let's check what type it is */
1621 if (expr->kw->match == acl_match_str)
1622 acl_res |= acl_lookup_str(&test, expr) ? ACL_PAT_PASS : ACL_PAT_FAIL;
Willy Tarreaub337b532010-05-13 20:03:41 +02001623 else if (expr->kw->match == acl_match_ip)
1624 acl_res |= acl_lookup_ip(&test, expr) ? ACL_PAT_PASS : ACL_PAT_FAIL;
Willy Tarreauc4262962010-05-10 23:42:40 +02001625 }
1626
Willy Tarreaua79534f2008-07-20 10:13:37 +02001627 /* call the match() function for all tests on this value */
1628 list_for_each_entry(pattern, &expr->patterns, list) {
Willy Tarreaua79534f2008-07-20 10:13:37 +02001629 if (acl_res == ACL_PAT_PASS)
1630 break;
Willy Tarreaue56cda92010-05-11 23:25:05 +02001631 acl_res |= expr->kw->match(&test, pattern);
Willy Tarreaua79534f2008-07-20 10:13:37 +02001632 }
Krzysztof Piotr Oledzkid7528e52010-01-29 17:55:53 +01001633
Willy Tarreaue56cda92010-05-11 23:25:05 +02001634 if ((test.flags & ACL_TEST_F_NULL_MATCH) &&
Willy Tarreau020534d2010-05-16 21:45:45 +02001635 LIST_ISEMPTY(&expr->patterns) && eb_is_empty(&expr->pattern_tree))
Krzysztof Piotr Oledzkid7528e52010-01-29 17:55:53 +01001636 acl_res |= expr->kw->match(&test, NULL);
Willy Tarreaua84d3742007-05-07 00:36:48 +02001637 }
1638 /*
Willy Tarreau11382812008-07-09 16:18:21 +02001639 * OK now acl_res holds the result of this expression
1640 * as one of ACL_PAT_FAIL, ACL_PAT_MISS or ACL_PAT_PASS.
Willy Tarreaua84d3742007-05-07 00:36:48 +02001641 *
Willy Tarreau11382812008-07-09 16:18:21 +02001642 * Then if (!MISS) we can cache the result, and put
Willy Tarreaua84d3742007-05-07 00:36:48 +02001643 * (test.flags & ACL_TEST_F_VOLATILE) in the cache flags.
1644 *
1645 * FIXME: implement cache.
1646 *
1647 */
1648
1649 /* now we may have some cleanup to do */
1650 if (test.flags & ACL_TEST_F_MUST_FREE) {
1651 free(test.ptr);
1652 test.len = 0;
1653 }
1654
Willy Tarreau11382812008-07-09 16:18:21 +02001655 /* we're ORing these terms, so a single PASS is enough */
1656 if (acl_res == ACL_PAT_PASS)
Willy Tarreaua84d3742007-05-07 00:36:48 +02001657 break;
1658
Willy Tarreaua84d3742007-05-07 00:36:48 +02001659 if (test.flags & ACL_TEST_F_FETCH_MORE)
1660 goto fetch_next;
Willy Tarreaub6866442008-07-14 23:54:42 +02001661
1662 /* sometimes we know the fetched data is subject to change
1663 * later and give another chance for a new match (eg: request
1664 * size, time, ...)
1665 */
1666 if (test.flags & ACL_TEST_F_MAY_CHANGE && dir & ACL_PARTIAL)
1667 acl_res |= ACL_PAT_MISS;
Willy Tarreaua84d3742007-05-07 00:36:48 +02001668 }
1669 /*
1670 * Here we have the result of an ACL (cached or not).
1671 * ACLs are combined, negated or not, to form conditions.
1672 */
1673
Willy Tarreaua84d3742007-05-07 00:36:48 +02001674 if (term->neg)
Willy Tarreau11382812008-07-09 16:18:21 +02001675 acl_res = acl_neg(acl_res);
Willy Tarreaua84d3742007-05-07 00:36:48 +02001676
1677 suite_res &= acl_res;
Willy Tarreau11382812008-07-09 16:18:21 +02001678
1679 /* we're ANDing these terms, so a single FAIL is enough */
1680 if (suite_res == ACL_PAT_FAIL)
Willy Tarreaua84d3742007-05-07 00:36:48 +02001681 break;
1682 }
1683 cond_res |= suite_res;
Willy Tarreau11382812008-07-09 16:18:21 +02001684
1685 /* we're ORing these terms, so a single PASS is enough */
1686 if (cond_res == ACL_PAT_PASS)
Willy Tarreaua84d3742007-05-07 00:36:48 +02001687 break;
1688 }
Willy Tarreau11382812008-07-09 16:18:21 +02001689 return cond_res;
Willy Tarreaua84d3742007-05-07 00:36:48 +02001690}
1691
1692
Willy Tarreaudd64f8d2008-07-27 22:02:32 +02001693/* Reports a pointer to the first ACL used in condition <cond> which requires
1694 * at least one of the USE_FLAGS in <require>. Returns NULL if none matches.
1695 * The construct is almost the same as for acl_exec_cond() since we're walking
1696 * down the ACL tree as well. It is important that the tree is really walked
1697 * through and never cached, because that way, this function can be used as a
1698 * late check.
1699 */
Willy Tarreauf1e98b82010-01-28 17:59:39 +01001700struct acl *cond_find_require(const struct acl_cond *cond, unsigned int require)
Willy Tarreaudd64f8d2008-07-27 22:02:32 +02001701{
1702 struct acl_term_suite *suite;
1703 struct acl_term *term;
1704 struct acl *acl;
1705
1706 list_for_each_entry(suite, &cond->suites, list) {
1707 list_for_each_entry(term, &suite->terms, list) {
1708 acl = term->acl;
1709 if (acl->requires & require)
1710 return acl;
1711 }
1712 }
1713 return NULL;
1714}
1715
Krzysztof Piotr Oledzkif9423ae2010-01-29 19:26:18 +01001716/*
1717 * Find targets for userlist and groups in acl. Function returns the number
1718 * of errors or OK if everything is fine.
1719 */
1720int
1721acl_find_targets(struct proxy *p)
1722{
1723
1724 struct acl *acl;
1725 struct acl_expr *expr;
1726 struct acl_pattern *pattern;
1727 struct userlist *ul;
1728 int cfgerr = 0;
1729
1730 list_for_each_entry(acl, &p->acl, list) {
1731 list_for_each_entry(expr, &acl->expr, list) {
Willy Tarreau0b1cd942010-05-16 22:18:27 +02001732 if (strcmp(expr->kw->kw, "srv_is_up") == 0) {
1733 struct proxy *px;
1734 struct server *srv;
1735 char *pname, *sname;
1736
1737 if (!expr->arg.str || !*expr->arg.str) {
1738 Alert("proxy %s: acl %s %s(): missing server name.\n",
1739 p->id, acl->name, expr->kw->kw);
1740 cfgerr++;
1741 continue;
1742 }
1743
1744 pname = expr->arg.str;
1745 sname = strrchr(pname, '/');
1746
1747 if (sname)
1748 *sname++ = '\0';
1749 else {
1750 sname = pname;
1751 pname = NULL;
1752 }
1753
1754 px = p;
1755 if (pname) {
1756 px = findproxy(pname, PR_CAP_BE);
1757 if (!px) {
1758 Alert("proxy %s: acl %s %s(): unable to find proxy '%s'.\n",
1759 p->id, acl->name, expr->kw->kw, pname);
1760 cfgerr++;
1761 continue;
1762 }
1763 }
1764
1765 srv = findserver(px, sname);
1766 if (!srv) {
1767 Alert("proxy %s: acl %s %s(): unable to find server '%s'.\n",
1768 p->id, acl->name, expr->kw->kw, sname);
1769 cfgerr++;
1770 continue;
1771 }
1772
1773 free(expr->arg.str);
1774 expr->arg_len = 0;
1775 expr->arg.srv = srv;
1776 continue;
1777 }
1778
Krzysztof Piotr Oledzkif9423ae2010-01-29 19:26:18 +01001779 if (strstr(expr->kw->kw, "http_auth") == expr->kw->kw) {
1780
1781 if (!expr->arg.str || !*expr->arg.str) {
1782 Alert("proxy %s: acl %s %s(): missing userlist name.\n",
1783 p->id, acl->name, expr->kw->kw);
1784 cfgerr++;
1785 continue;
1786 }
1787
Krzysztof Piotr Oledzki8c8bd452010-01-29 19:29:32 +01001788 if (p->uri_auth && p->uri_auth->userlist &&
1789 !strcmp(p->uri_auth->userlist->name, expr->arg.str))
1790 ul = p->uri_auth->userlist;
1791 else
1792 ul = auth_find_userlist(expr->arg.str);
Krzysztof Piotr Oledzkif9423ae2010-01-29 19:26:18 +01001793
1794 if (!ul) {
1795 Alert("proxy %s: acl %s %s(%s): unable to find userlist.\n",
1796 p->id, acl->name, expr->kw->kw, expr->arg.str);
1797 cfgerr++;
1798 continue;
1799 }
1800
1801 expr->arg_len = 0;
1802 expr->arg.ul = ul;
1803 }
1804
1805
1806 if (!strcmp(expr->kw->kw, "http_auth_group")) {
1807
1808 if (LIST_ISEMPTY(&expr->patterns)) {
1809 Alert("proxy %s: acl %s %s(): no groups specified.\n",
1810 p->id, acl->name, expr->kw->kw);
1811 cfgerr++;
1812 continue;
1813 }
1814
1815 list_for_each_entry(pattern, &expr->patterns, list) {
1816 pattern->val.group_mask = auth_resolve_groups(expr->arg.ul, pattern->ptr.str);
1817
1818 free(pattern->ptr.str);
1819 pattern->ptr.str = NULL;
1820 pattern->len = 0;
1821
1822 if (!pattern->val.group_mask) {
1823 Alert("proxy %s: acl %s %s(): invalid group(s).\n",
1824 p->id, acl->name, expr->kw->kw);
1825 cfgerr++;
1826 continue;
1827 }
1828 }
1829 }
1830 }
1831 }
1832
1833 return cfgerr;
1834}
Willy Tarreaudd64f8d2008-07-27 22:02:32 +02001835
Willy Tarreaua84d3742007-05-07 00:36:48 +02001836/************************************************************************/
1837/* All supported keywords must be declared here. */
1838/************************************************************************/
1839
1840/* Note: must not be declared <const> as its list will be overwritten */
1841static struct acl_kw_list acl_kws = {{ },{
Emeric Brun38e71762010-09-23 17:59:18 +02001842 { "always_true", acl_parse_nothing, acl_fetch_true, acl_match_nothing, ACL_USE_NOTHING },
1843 { "always_false", acl_parse_nothing, acl_fetch_false, acl_match_nothing, ACL_USE_NOTHING },
1844 { "wait_end", acl_parse_nothing, acl_fetch_wait_end, acl_match_nothing, ACL_USE_NOTHING },
1845 { "req_len", acl_parse_int, acl_fetch_req_len, acl_match_int, ACL_USE_L6REQ_VOLATILE },
1846 { "req_ssl_hello_type", acl_parse_int, acl_fetch_ssl_hello_type, acl_match_int, ACL_USE_L6REQ_VOLATILE },
1847 { "rep_ssl_hello_type", acl_parse_int, acl_fetch_ssl_hello_type, acl_match_int, ACL_USE_L6RTR_VOLATILE },
1848 { "req_ssl_ver", acl_parse_dotted_ver, acl_fetch_req_ssl_ver, acl_match_int, ACL_USE_L6REQ_VOLATILE },
1849 { "req_rdp_cookie", acl_parse_str, acl_fetch_rdp_cookie, acl_match_str, ACL_USE_L6REQ_VOLATILE|ACL_MAY_LOOKUP },
1850 { "req_rdp_cookie_cnt", acl_parse_int, acl_fetch_rdp_cookie_cnt, acl_match_int, ACL_USE_L6REQ_VOLATILE },
Willy Tarreaua84d3742007-05-07 00:36:48 +02001851#if 0
1852 { "time", acl_parse_time, acl_fetch_time, acl_match_time },
1853#endif
1854 { NULL, NULL, NULL, NULL }
1855}};
1856
1857
1858__attribute__((constructor))
1859static void __acl_init(void)
1860{
1861 acl_register_keywords(&acl_kws);
1862}
1863
1864
1865/*
1866 * Local variables:
1867 * c-indent-level: 8
1868 * c-basic-offset: 8
1869 * End:
1870 */