blob: 883986cf15b907243905352125bc91a5aa6a3798 [file] [log] [blame]
Willy Tarreaua84d3742007-05-07 00:36:48 +02001/*
2 * ACL management functions.
3 *
Willy Tarreau0e698542011-09-16 08:32:32 +02004 * Copyright 2000-2011 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>
Willy Tarreau34db1082012-04-19 17:16:54 +020025#include <proto/arg.h>
Krzysztof Piotr Oledzkif9423ae2010-01-29 19:26:18 +010026#include <proto/auth.h>
Willy Tarreauc7e42382012-08-24 19:22:53 +020027#include <proto/channel.h>
Willy Tarreau404e8ab2009-07-26 19:40:40 +020028#include <proto/log.h>
Willy Tarreau0b1cd942010-05-16 22:18:27 +020029#include <proto/proxy.h>
Willy Tarreaud28c3532012-04-19 19:28:33 +020030#include <proto/stick_table.h>
Willy Tarreaua84d3742007-05-07 00:36:48 +020031
Willy Tarreauc4262962010-05-10 23:42:40 +020032#include <ebsttree.h>
33
Willy Tarreaua9802632008-07-25 19:13:19 +020034/* The capabilities of filtering hooks describe the type of information
35 * available to each of them.
36 */
37const unsigned int filt_cap[] = {
38 [ACL_HOOK_REQ_FE_TCP] = ACL_USE_TCP4_ANY|ACL_USE_TCP6_ANY|ACL_USE_TCP_ANY,
Willy Tarreau06457872010-05-23 12:24:38 +020039 [ACL_HOOK_REQ_FE_TCP_CONTENT] = ACL_USE_TCP4_ANY|ACL_USE_TCP6_ANY|ACL_USE_TCP_ANY|ACL_USE_L6REQ_ANY,
40 [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,
41 [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,
42 [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,
43 [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,
44 [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,
45 [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,
46 [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 +020047
Willy Tarreau06457872010-05-23 12:24:38 +020048 [ACL_HOOK_RTR_BE_TCP_CONTENT] = ACL_USE_REQ_PERMANENT|ACL_USE_REQ_CACHEABLE|ACL_USE_L6RTR_ANY,
49 [ACL_HOOK_RTR_BE_HTTP_IN] = ACL_USE_REQ_PERMANENT|ACL_USE_REQ_CACHEABLE|ACL_USE_L6RTR_ANY|ACL_USE_L7RTR_ANY,
50 [ACL_HOOK_RTR_FE_TCP_CONTENT] = ACL_USE_REQ_PERMANENT|ACL_USE_REQ_CACHEABLE|ACL_USE_L6RTR_ANY|ACL_USE_L7RTR_ANY,
51 [ACL_HOOK_RTR_FE_HTTP_IN] = ACL_USE_REQ_PERMANENT|ACL_USE_REQ_CACHEABLE|ACL_USE_L6RTR_ANY|ACL_USE_L7RTR_ANY,
52 [ACL_HOOK_RTR_BE_HTTP_OUT] = ACL_USE_REQ_PERMANENT|ACL_USE_REQ_CACHEABLE|ACL_USE_L6RTR_ANY|ACL_USE_L7RTR_ANY,
53 [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 +020054};
55
Willy Tarreaua84d3742007-05-07 00:36:48 +020056/* List head of all known ACL keywords */
57static struct acl_kw_list acl_keywords = {
58 .list = LIST_HEAD_INIT(acl_keywords.list)
59};
60
61
Willy Tarreaua5909832007-06-17 20:40:25 +020062/*
63 * These functions are only used for debugging complex configurations.
Willy Tarreaua84d3742007-05-07 00:36:48 +020064 */
Willy Tarreaua5909832007-06-17 20:40:25 +020065
Willy Tarreau58393e12008-07-20 10:39:22 +020066/* force TRUE to be returned at the fetch level */
Willy Tarreaua5909832007-06-17 20:40:25 +020067static int
Willy Tarreau32a6f2e2012-04-25 10:13:36 +020068acl_fetch_true(struct proxy *px, struct session *l4, void *l7, unsigned int opt,
Willy Tarreau24e32d82012-04-23 23:55:44 +020069 const struct arg *args, struct sample *smp)
Willy Tarreaua5909832007-06-17 20:40:25 +020070{
Willy Tarreauf853c462012-04-23 18:53:56 +020071 smp->type = SMP_T_BOOL;
Willy Tarreau197e10a2012-04-23 19:18:42 +020072 smp->data.uint = 1;
Willy Tarreaua5909832007-06-17 20:40:25 +020073 return 1;
74}
75
Willy Tarreaub6fb4202008-07-20 11:18:28 +020076/* wait for more data as long as possible, then return TRUE. This should be
77 * used with content inspection.
78 */
79static int
Willy Tarreau32a6f2e2012-04-25 10:13:36 +020080acl_fetch_wait_end(struct proxy *px, struct session *l4, void *l7, unsigned int opt,
Willy Tarreau24e32d82012-04-23 23:55:44 +020081 const struct arg *args, struct sample *smp)
Willy Tarreaub6fb4202008-07-20 11:18:28 +020082{
Willy Tarreau32a6f2e2012-04-25 10:13:36 +020083 if (!(opt & SMP_OPT_FINAL)) {
Willy Tarreau37406352012-04-23 16:16:37 +020084 smp->flags |= SMP_F_MAY_CHANGE;
Willy Tarreaub6fb4202008-07-20 11:18:28 +020085 return 0;
86 }
Willy Tarreauf853c462012-04-23 18:53:56 +020087 smp->type = SMP_T_BOOL;
Willy Tarreau197e10a2012-04-23 19:18:42 +020088 smp->data.uint = 1;
Willy Tarreaub6fb4202008-07-20 11:18:28 +020089 return 1;
90}
91
Willy Tarreau58393e12008-07-20 10:39:22 +020092/* force FALSE to be returned at the fetch level */
Willy Tarreaua5909832007-06-17 20:40:25 +020093static int
Willy Tarreau32a6f2e2012-04-25 10:13:36 +020094acl_fetch_false(struct proxy *px, struct session *l4, void *l7, unsigned int opt,
Willy Tarreau24e32d82012-04-23 23:55:44 +020095 const struct arg *args, struct sample *smp)
Willy Tarreaua84d3742007-05-07 00:36:48 +020096{
Willy Tarreauf853c462012-04-23 18:53:56 +020097 smp->type = SMP_T_BOOL;
Willy Tarreau197e10a2012-04-23 19:18:42 +020098 smp->data.uint = 0;
Willy Tarreaua84d3742007-05-07 00:36:48 +020099 return 1;
100}
101
Willy Tarreau44b90cc2010-05-24 20:27:29 +0200102/* return the number of bytes in the request buffer */
103static int
Willy Tarreau32a6f2e2012-04-25 10:13:36 +0200104acl_fetch_req_len(struct proxy *px, struct session *l4, void *l7, unsigned int opt,
Willy Tarreau24e32d82012-04-23 23:55:44 +0200105 const struct arg *args, struct sample *smp)
Willy Tarreau44b90cc2010-05-24 20:27:29 +0200106{
107 if (!l4 || !l4->req)
108 return 0;
109
Willy Tarreauf853c462012-04-23 18:53:56 +0200110 smp->type = SMP_T_UINT;
Willy Tarreau572bf902012-07-02 17:01:20 +0200111 smp->data.uint = l4->req->buf.i;
Willy Tarreau37406352012-04-23 16:16:37 +0200112 smp->flags = SMP_F_VOLATILE | SMP_F_MAY_CHANGE;
Willy Tarreau44b90cc2010-05-24 20:27:29 +0200113 return 1;
114}
115
Emeric Brun38e71762010-09-23 17:59:18 +0200116
117static int
Willy Tarreau32a6f2e2012-04-25 10:13:36 +0200118acl_fetch_ssl_hello_type(struct proxy *px, struct session *l4, void *l7, unsigned int opt,
Willy Tarreau24e32d82012-04-23 23:55:44 +0200119 const struct arg *args, struct sample *smp)
Emeric Brun38e71762010-09-23 17:59:18 +0200120{
121 int hs_len;
122 int hs_type, bleft;
Willy Tarreau7421efb2012-07-02 15:11:27 +0200123 struct channel *b;
Emeric Brun38e71762010-09-23 17:59:18 +0200124 const unsigned char *data;
125
126 if (!l4)
127 goto not_ssl_hello;
128
Willy Tarreau32a6f2e2012-04-25 10:13:36 +0200129 b = ((opt & SMP_OPT_DIR) == SMP_OPT_DIR_RES) ? l4->rep : l4->req;
Emeric Brun38e71762010-09-23 17:59:18 +0200130
Willy Tarreau572bf902012-07-02 17:01:20 +0200131 bleft = b->buf.i;
132 data = (const unsigned char *)b->buf.p;
Emeric Brun38e71762010-09-23 17:59:18 +0200133
134 if (!bleft)
135 goto too_short;
136
137 if ((*data >= 0x14 && *data <= 0x17) || (*data == 0xFF)) {
138 /* SSLv3 header format */
139 if (bleft < 9)
140 goto too_short;
141
142 /* ssl version 3 */
143 if ((data[1] << 16) + data[2] < 0x00030000)
144 goto not_ssl_hello;
145
146 /* ssl message len must present handshake type and len */
147 if ((data[3] << 8) + data[4] < 4)
148 goto not_ssl_hello;
149
150 /* format introduced with SSLv3 */
151
152 hs_type = (int)data[5];
153 hs_len = ( data[6] << 16 ) + ( data[7] << 8 ) + data[8];
154
155 /* not a full handshake */
156 if (bleft < (9 + hs_len))
157 goto too_short;
158
159 }
160 else {
161 goto not_ssl_hello;
162 }
163
Willy Tarreauf853c462012-04-23 18:53:56 +0200164 smp->type = SMP_T_UINT;
165 smp->data.uint = hs_type;
Willy Tarreau37406352012-04-23 16:16:37 +0200166 smp->flags = SMP_F_VOLATILE;
Emeric Brun38e71762010-09-23 17:59:18 +0200167
168 return 1;
169
170 too_short:
Willy Tarreau37406352012-04-23 16:16:37 +0200171 smp->flags = SMP_F_MAY_CHANGE;
Emeric Brun38e71762010-09-23 17:59:18 +0200172
173 not_ssl_hello:
174
175 return 0;
176}
177
Willy Tarreau44b90cc2010-05-24 20:27:29 +0200178/* Return the version of the SSL protocol in the request. It supports both
179 * SSLv3 (TLSv1) header format for any message, and SSLv2 header format for
180 * the hello message. The SSLv3 format is described in RFC 2246 p49, and the
181 * SSLv2 format is described here, and completed p67 of RFC 2246 :
182 * http://wp.netscape.com/eng/security/SSL_2.html
183 *
184 * Note: this decoder only works with non-wrapping data.
185 */
186static int
Willy Tarreau32a6f2e2012-04-25 10:13:36 +0200187acl_fetch_req_ssl_ver(struct proxy *px, struct session *l4, void *l7, unsigned int opt,
Willy Tarreau24e32d82012-04-23 23:55:44 +0200188 const struct arg *args, struct sample *smp)
Willy Tarreau44b90cc2010-05-24 20:27:29 +0200189{
190 int version, bleft, msg_len;
191 const unsigned char *data;
192
193 if (!l4 || !l4->req)
194 return 0;
195
196 msg_len = 0;
Willy Tarreau572bf902012-07-02 17:01:20 +0200197 bleft = l4->req->buf.i;
Willy Tarreau44b90cc2010-05-24 20:27:29 +0200198 if (!bleft)
199 goto too_short;
200
Willy Tarreau572bf902012-07-02 17:01:20 +0200201 data = (const unsigned char *)l4->req->buf.p;
Willy Tarreau44b90cc2010-05-24 20:27:29 +0200202 if ((*data >= 0x14 && *data <= 0x17) || (*data == 0xFF)) {
203 /* SSLv3 header format */
204 if (bleft < 5)
205 goto too_short;
206
207 version = (data[1] << 16) + data[2]; /* version: major, minor */
208 msg_len = (data[3] << 8) + data[4]; /* record length */
209
210 /* format introduced with SSLv3 */
211 if (version < 0x00030000)
212 goto not_ssl;
213
214 /* message length between 1 and 2^14 + 2048 */
215 if (msg_len < 1 || msg_len > ((1<<14) + 2048))
216 goto not_ssl;
217
218 bleft -= 5; data += 5;
219 } else {
220 /* SSLv2 header format, only supported for hello (msg type 1) */
221 int rlen, plen, cilen, silen, chlen;
222
223 if (*data & 0x80) {
224 if (bleft < 3)
225 goto too_short;
226 /* short header format : 15 bits for length */
227 rlen = ((data[0] & 0x7F) << 8) | data[1];
228 plen = 0;
229 bleft -= 2; data += 2;
230 } else {
231 if (bleft < 4)
232 goto too_short;
233 /* long header format : 14 bits for length + pad length */
234 rlen = ((data[0] & 0x3F) << 8) | data[1];
235 plen = data[2];
236 bleft -= 3; data += 2;
237 }
238
239 if (*data != 0x01)
240 goto not_ssl;
241 bleft--; data++;
242
243 if (bleft < 8)
244 goto too_short;
245 version = (data[0] << 16) + data[1]; /* version: major, minor */
246 cilen = (data[2] << 8) + data[3]; /* cipher len, multiple of 3 */
247 silen = (data[4] << 8) + data[5]; /* session_id_len: 0 or 16 */
248 chlen = (data[6] << 8) + data[7]; /* 16<=challenge length<=32 */
249
250 bleft -= 8; data += 8;
251 if (cilen % 3 != 0)
252 goto not_ssl;
253 if (silen && silen != 16)
254 goto not_ssl;
255 if (chlen < 16 || chlen > 32)
256 goto not_ssl;
257 if (rlen != 9 + cilen + silen + chlen)
258 goto not_ssl;
259
260 /* focus on the remaining data length */
261 msg_len = cilen + silen + chlen + plen;
262 }
263 /* We could recursively check that the buffer ends exactly on an SSL
264 * fragment boundary and that a possible next segment is still SSL,
265 * but that's a bit pointless. However, we could still check that
266 * all the part of the request which fits in a buffer is already
267 * there.
268 */
Willy Tarreau572bf902012-07-02 17:01:20 +0200269 if (msg_len > buffer_max_len(l4->req) + l4->req->buf.data - l4->req->buf.p)
270 msg_len = buffer_max_len(l4->req) + l4->req->buf.data - l4->req->buf.p;
Willy Tarreau44b90cc2010-05-24 20:27:29 +0200271
272 if (bleft < msg_len)
273 goto too_short;
274
275 /* OK that's enough. We have at least the whole message, and we have
276 * the protocol version.
277 */
Willy Tarreauf853c462012-04-23 18:53:56 +0200278 smp->type = SMP_T_UINT;
279 smp->data.uint = version;
Willy Tarreau37406352012-04-23 16:16:37 +0200280 smp->flags = SMP_F_VOLATILE;
Willy Tarreau44b90cc2010-05-24 20:27:29 +0200281 return 1;
282
283 too_short:
Willy Tarreau37406352012-04-23 16:16:37 +0200284 smp->flags = SMP_F_MAY_CHANGE;
Willy Tarreau44b90cc2010-05-24 20:27:29 +0200285 not_ssl:
286 return 0;
287}
288
Willy Tarreaub6672b52011-12-12 17:23:41 +0100289/* Try to extract the Server Name Indication that may be presented in a TLS
290 * client hello handshake message. The format of the message is the following
291 * (cf RFC5246 + RFC6066) :
292 * TLS frame :
293 * - uint8 type = 0x16 (Handshake)
294 * - uint16 version >= 0x0301 (TLSv1)
295 * - uint16 length (frame length)
296 * - TLS handshake :
297 * - uint8 msg_type = 0x01 (ClientHello)
298 * - uint24 length (handshake message length)
299 * - ClientHello :
300 * - uint16 client_version >= 0x0301 (TLSv1)
Willy Tarreaud017f112012-04-09 09:24:11 +0200301 * - uint8 Random[32] (4 first ones are timestamp)
Willy Tarreaub6672b52011-12-12 17:23:41 +0100302 * - SessionID :
303 * - uint8 session_id_len (0..32) (SessionID len in bytes)
304 * - uint8 session_id[session_id_len]
305 * - CipherSuite :
306 * - uint16 cipher_len >= 2 (Cipher length in bytes)
307 * - uint16 ciphers[cipher_len/2]
308 * - CompressionMethod :
309 * - uint8 compression_len >= 1 (# of supported methods)
310 * - uint8 compression_methods[compression_len]
311 * - optional client_extension_len (in bytes)
312 * - optional sequence of ClientHelloExtensions (as many bytes as above):
313 * - uint16 extension_type = 0 for server_name
314 * - uint16 extension_len
315 * - opaque extension_data[extension_len]
316 * - uint16 server_name_list_len (# of bytes here)
317 * - opaque server_names[server_name_list_len bytes]
318 * - uint8 name_type = 0 for host_name
319 * - uint16 name_len
320 * - opaque hostname[name_len bytes]
321 */
322static int
Willy Tarreau32a6f2e2012-04-25 10:13:36 +0200323acl_fetch_ssl_hello_sni(struct proxy *px, struct session *l4, void *l7, unsigned int opt,
Willy Tarreau24e32d82012-04-23 23:55:44 +0200324 const struct arg *args, struct sample *smp)
Willy Tarreaub6672b52011-12-12 17:23:41 +0100325{
326 int hs_len, ext_len, bleft;
Willy Tarreau7421efb2012-07-02 15:11:27 +0200327 struct channel *b;
Willy Tarreaub6672b52011-12-12 17:23:41 +0100328 unsigned char *data;
329
330 if (!l4)
331 goto not_ssl_hello;
332
Willy Tarreau32a6f2e2012-04-25 10:13:36 +0200333 b = ((opt & SMP_OPT_DIR) == SMP_OPT_DIR_RES) ? l4->rep : l4->req;
Willy Tarreaub6672b52011-12-12 17:23:41 +0100334
Willy Tarreau572bf902012-07-02 17:01:20 +0200335 bleft = b->buf.i;
336 data = (unsigned char *)b->buf.p;
Willy Tarreaub6672b52011-12-12 17:23:41 +0100337
338 /* Check for SSL/TLS Handshake */
339 if (!bleft)
340 goto too_short;
341 if (*data != 0x16)
342 goto not_ssl_hello;
343
344 /* Check for TLSv1 or later (SSL version >= 3.1) */
345 if (bleft < 3)
346 goto too_short;
347 if (data[1] < 0x03 || data[2] < 0x01)
348 goto not_ssl_hello;
349
350 if (bleft < 5)
351 goto too_short;
352 hs_len = (data[3] << 8) + data[4];
353 if (hs_len < 1 + 3 + 2 + 32 + 1 + 2 + 2 + 1 + 1 + 2 + 2)
354 goto not_ssl_hello; /* too short to have an extension */
355
356 data += 5; /* enter TLS handshake */
357 bleft -= 5;
358
359 /* Check for a complete client hello starting at <data> */
360 if (bleft < 1)
361 goto too_short;
362 if (data[0] != 0x01) /* msg_type = Client Hello */
363 goto not_ssl_hello;
364
365 /* Check the Hello's length */
366 if (bleft < 4)
367 goto too_short;
368 hs_len = (data[1] << 16) + (data[2] << 8) + data[3];
369 if (hs_len < 2 + 32 + 1 + 2 + 2 + 1 + 1 + 2 + 2)
370 goto not_ssl_hello; /* too short to have an extension */
371
372 /* We want the full handshake here */
373 if (bleft < hs_len)
374 goto too_short;
375
376 data += 4;
377 /* Start of the ClientHello message */
378 if (data[0] < 0x03 || data[1] < 0x01) /* TLSv1 minimum */
379 goto not_ssl_hello;
380
Willy Tarreaud017f112012-04-09 09:24:11 +0200381 ext_len = data[34]; /* session_id_len */
Willy Tarreaub6672b52011-12-12 17:23:41 +0100382 if (ext_len > 32 || ext_len > (hs_len - 35)) /* check for correct session_id len */
383 goto not_ssl_hello;
384
385 /* Jump to cipher suite */
386 hs_len -= 35 + ext_len;
387 data += 35 + ext_len;
388
389 if (hs_len < 4 || /* minimum one cipher */
390 (ext_len = (data[0] << 8) + data[1]) < 2 || /* minimum 2 bytes for a cipher */
391 ext_len > hs_len)
392 goto not_ssl_hello;
393
394 /* Jump to the compression methods */
395 hs_len -= 2 + ext_len;
396 data += 2 + ext_len;
397
398 if (hs_len < 2 || /* minimum one compression method */
399 data[0] < 1 || data[0] > hs_len) /* minimum 1 bytes for a method */
400 goto not_ssl_hello;
401
402 /* Jump to the extensions */
403 hs_len -= 1 + data[0];
404 data += 1 + data[0];
405
406 if (hs_len < 2 || /* minimum one extension list length */
407 (ext_len = (data[0] << 8) + data[1]) > hs_len - 2) /* list too long */
408 goto not_ssl_hello;
409
410 hs_len = ext_len; /* limit ourselves to the extension length */
411 data += 2;
412
413 while (hs_len >= 4) {
414 int ext_type, name_type, srv_len, name_len;
415
416 ext_type = (data[0] << 8) + data[1];
417 ext_len = (data[2] << 8) + data[3];
418
419 if (ext_len > hs_len - 4) /* Extension too long */
420 goto not_ssl_hello;
421
422 if (ext_type == 0) { /* Server name */
423 if (ext_len < 2) /* need one list length */
424 goto not_ssl_hello;
425
426 srv_len = (data[4] << 8) + data[5];
427 if (srv_len < 4 || srv_len > hs_len - 6)
428 goto not_ssl_hello; /* at least 4 bytes per server name */
429
430 name_type = data[6];
431 name_len = (data[7] << 8) + data[8];
432
433 if (name_type == 0) { /* hostname */
Willy Tarreauf853c462012-04-23 18:53:56 +0200434 smp->type = SMP_T_CSTR;
435 smp->data.str.str = (char *)data + 9;
436 smp->data.str.len = name_len;
Willy Tarreau37406352012-04-23 16:16:37 +0200437 smp->flags = SMP_F_VOLATILE;
Willy Tarreaub6672b52011-12-12 17:23:41 +0100438 return 1;
439 }
440 }
441
442 hs_len -= 4 + ext_len;
443 data += 4 + ext_len;
444 }
445 /* server name not found */
446 goto not_ssl_hello;
447
448 too_short:
Willy Tarreau37406352012-04-23 16:16:37 +0200449 smp->flags = SMP_F_MAY_CHANGE;
Willy Tarreaub6672b52011-12-12 17:23:41 +0100450
451 not_ssl_hello:
452
453 return 0;
454}
455
Willy Tarreau58393e12008-07-20 10:39:22 +0200456/*
457 * These functions are exported and may be used by any other component.
458 */
459
460/* ignore the current line */
Willy Tarreau7dcb6482012-04-27 17:52:25 +0200461int acl_parse_nothing(const char **text, struct acl_pattern *pattern, int *opaque, char **err)
Willy Tarreaua5909832007-06-17 20:40:25 +0200462{
Willy Tarreau58393e12008-07-20 10:39:22 +0200463 return 1;
464}
465
466/* always fake a data retrieval */
Willy Tarreau32a6f2e2012-04-25 10:13:36 +0200467int acl_fetch_nothing(struct proxy *px, struct session *l4, void *l7, unsigned int opt,
Willy Tarreau24e32d82012-04-23 23:55:44 +0200468 const struct arg *args, struct sample *smp)
Willy Tarreau58393e12008-07-20 10:39:22 +0200469{
470 return 1;
Willy Tarreaua5909832007-06-17 20:40:25 +0200471}
472
473/* always return false */
Willy Tarreau37406352012-04-23 16:16:37 +0200474int acl_match_nothing(struct sample *smp, struct acl_pattern *pattern)
Willy Tarreaua5909832007-06-17 20:40:25 +0200475{
Willy Tarreau11382812008-07-09 16:18:21 +0200476 return ACL_PAT_FAIL;
Willy Tarreaua5909832007-06-17 20:40:25 +0200477}
478
479
Willy Tarreaua84d3742007-05-07 00:36:48 +0200480/* NB: For two strings to be identical, it is required that their lengths match */
Willy Tarreau37406352012-04-23 16:16:37 +0200481int acl_match_str(struct sample *smp, struct acl_pattern *pattern)
Willy Tarreaua84d3742007-05-07 00:36:48 +0200482{
Willy Tarreauc8d7c962007-06-17 08:20:33 +0200483 int icase;
484
Willy Tarreauf853c462012-04-23 18:53:56 +0200485 if (pattern->len != smp->data.str.len)
Willy Tarreau11382812008-07-09 16:18:21 +0200486 return ACL_PAT_FAIL;
Willy Tarreauc8d7c962007-06-17 08:20:33 +0200487
488 icase = pattern->flags & ACL_PAT_F_IGNORE_CASE;
Willy Tarreauf853c462012-04-23 18:53:56 +0200489 if ((icase && strncasecmp(pattern->ptr.str, smp->data.str.str, smp->data.str.len) == 0) ||
490 (!icase && strncmp(pattern->ptr.str, smp->data.str.str, smp->data.str.len) == 0))
Willy Tarreau11382812008-07-09 16:18:21 +0200491 return ACL_PAT_PASS;
492 return ACL_PAT_FAIL;
Willy Tarreaua84d3742007-05-07 00:36:48 +0200493}
494
Willy Tarreauc4262962010-05-10 23:42:40 +0200495/* Lookup a string in the expression's pattern tree. The node is returned if it
496 * exists, otherwise NULL.
497 */
Willy Tarreau37406352012-04-23 16:16:37 +0200498static void *acl_lookup_str(struct sample *smp, struct acl_expr *expr)
Willy Tarreauc4262962010-05-10 23:42:40 +0200499{
500 /* data are stored in a tree */
501 struct ebmb_node *node;
502 char prev;
503
504 /* we may have to force a trailing zero on the test pattern */
Willy Tarreauf853c462012-04-23 18:53:56 +0200505 prev = smp->data.str.str[smp->data.str.len];
Willy Tarreauc4262962010-05-10 23:42:40 +0200506 if (prev)
Willy Tarreauf853c462012-04-23 18:53:56 +0200507 smp->data.str.str[smp->data.str.len] = '\0';
508 node = ebst_lookup(&expr->pattern_tree, smp->data.str.str);
Willy Tarreauc4262962010-05-10 23:42:40 +0200509 if (prev)
Willy Tarreauf853c462012-04-23 18:53:56 +0200510 smp->data.str.str[smp->data.str.len] = prev;
Willy Tarreauc4262962010-05-10 23:42:40 +0200511 return node;
512}
513
Willy Tarreau21e5b0e2012-04-23 19:25:44 +0200514/* Executes a regex. It temporarily changes the data to add a trailing zero,
515 * and restores the previous character when leaving.
Willy Tarreauf3d25982007-05-08 22:45:09 +0200516 */
Willy Tarreau37406352012-04-23 16:16:37 +0200517int acl_match_reg(struct sample *smp, struct acl_pattern *pattern)
Willy Tarreauf3d25982007-05-08 22:45:09 +0200518{
519 char old_char;
520 int ret;
521
Willy Tarreauf853c462012-04-23 18:53:56 +0200522 old_char = smp->data.str.str[smp->data.str.len];
523 smp->data.str.str[smp->data.str.len] = 0;
Willy Tarreauf3d25982007-05-08 22:45:09 +0200524
Willy Tarreauf853c462012-04-23 18:53:56 +0200525 if (regexec(pattern->ptr.reg, smp->data.str.str, 0, NULL, 0) == 0)
Willy Tarreau11382812008-07-09 16:18:21 +0200526 ret = ACL_PAT_PASS;
Willy Tarreauf3d25982007-05-08 22:45:09 +0200527 else
Willy Tarreau11382812008-07-09 16:18:21 +0200528 ret = ACL_PAT_FAIL;
Willy Tarreauf3d25982007-05-08 22:45:09 +0200529
Willy Tarreauf853c462012-04-23 18:53:56 +0200530 smp->data.str.str[smp->data.str.len] = old_char;
Willy Tarreauf3d25982007-05-08 22:45:09 +0200531 return ret;
532}
533
Willy Tarreaua84d3742007-05-07 00:36:48 +0200534/* Checks that the pattern matches the beginning of the tested string. */
Willy Tarreau37406352012-04-23 16:16:37 +0200535int acl_match_beg(struct sample *smp, struct acl_pattern *pattern)
Willy Tarreaua84d3742007-05-07 00:36:48 +0200536{
Willy Tarreauc8d7c962007-06-17 08:20:33 +0200537 int icase;
538
Willy Tarreauf853c462012-04-23 18:53:56 +0200539 if (pattern->len > smp->data.str.len)
Willy Tarreau11382812008-07-09 16:18:21 +0200540 return ACL_PAT_FAIL;
Willy Tarreauc8d7c962007-06-17 08:20:33 +0200541
542 icase = pattern->flags & ACL_PAT_F_IGNORE_CASE;
Willy Tarreauf853c462012-04-23 18:53:56 +0200543 if ((icase && strncasecmp(pattern->ptr.str, smp->data.str.str, pattern->len) != 0) ||
544 (!icase && strncmp(pattern->ptr.str, smp->data.str.str, pattern->len) != 0))
Willy Tarreau11382812008-07-09 16:18:21 +0200545 return ACL_PAT_FAIL;
546 return ACL_PAT_PASS;
Willy Tarreaua84d3742007-05-07 00:36:48 +0200547}
548
549/* Checks that the pattern matches the end of the tested string. */
Willy Tarreau37406352012-04-23 16:16:37 +0200550int acl_match_end(struct sample *smp, struct acl_pattern *pattern)
Willy Tarreaua84d3742007-05-07 00:36:48 +0200551{
Willy Tarreauc8d7c962007-06-17 08:20:33 +0200552 int icase;
553
Willy Tarreauf853c462012-04-23 18:53:56 +0200554 if (pattern->len > smp->data.str.len)
Willy Tarreau11382812008-07-09 16:18:21 +0200555 return ACL_PAT_FAIL;
Willy Tarreauc8d7c962007-06-17 08:20:33 +0200556 icase = pattern->flags & ACL_PAT_F_IGNORE_CASE;
Willy Tarreauf853c462012-04-23 18:53:56 +0200557 if ((icase && strncasecmp(pattern->ptr.str, smp->data.str.str + smp->data.str.len - pattern->len, pattern->len) != 0) ||
558 (!icase && strncmp(pattern->ptr.str, smp->data.str.str + smp->data.str.len - pattern->len, pattern->len) != 0))
Willy Tarreau11382812008-07-09 16:18:21 +0200559 return ACL_PAT_FAIL;
560 return ACL_PAT_PASS;
Willy Tarreaua84d3742007-05-07 00:36:48 +0200561}
562
563/* Checks that the pattern is included inside the tested string.
564 * NB: Suboptimal, should be rewritten using a Boyer-Moore method.
565 */
Willy Tarreau37406352012-04-23 16:16:37 +0200566int acl_match_sub(struct sample *smp, struct acl_pattern *pattern)
Willy Tarreaua84d3742007-05-07 00:36:48 +0200567{
Willy Tarreauc8d7c962007-06-17 08:20:33 +0200568 int icase;
Willy Tarreaua84d3742007-05-07 00:36:48 +0200569 char *end;
570 char *c;
571
Willy Tarreauf853c462012-04-23 18:53:56 +0200572 if (pattern->len > smp->data.str.len)
Willy Tarreau11382812008-07-09 16:18:21 +0200573 return ACL_PAT_FAIL;
Willy Tarreaua84d3742007-05-07 00:36:48 +0200574
Willy Tarreauf853c462012-04-23 18:53:56 +0200575 end = smp->data.str.str + smp->data.str.len - pattern->len;
Willy Tarreauc8d7c962007-06-17 08:20:33 +0200576 icase = pattern->flags & ACL_PAT_F_IGNORE_CASE;
577 if (icase) {
Willy Tarreauf853c462012-04-23 18:53:56 +0200578 for (c = smp->data.str.str; c <= end; c++) {
Willy Tarreauc8d7c962007-06-17 08:20:33 +0200579 if (tolower(*c) != tolower(*pattern->ptr.str))
580 continue;
581 if (strncasecmp(pattern->ptr.str, c, pattern->len) == 0)
Willy Tarreau11382812008-07-09 16:18:21 +0200582 return ACL_PAT_PASS;
Willy Tarreauc8d7c962007-06-17 08:20:33 +0200583 }
584 } else {
Willy Tarreauf853c462012-04-23 18:53:56 +0200585 for (c = smp->data.str.str; c <= end; c++) {
Willy Tarreauc8d7c962007-06-17 08:20:33 +0200586 if (*c != *pattern->ptr.str)
587 continue;
588 if (strncmp(pattern->ptr.str, c, pattern->len) == 0)
Willy Tarreau11382812008-07-09 16:18:21 +0200589 return ACL_PAT_PASS;
Willy Tarreauc8d7c962007-06-17 08:20:33 +0200590 }
Willy Tarreaua84d3742007-05-07 00:36:48 +0200591 }
Willy Tarreau11382812008-07-09 16:18:21 +0200592 return ACL_PAT_FAIL;
Willy Tarreaua84d3742007-05-07 00:36:48 +0200593}
594
Finn Arne Gangstade8c7ecc2011-09-09 16:09:50 +0200595/* Background: Fast way to find a zero byte in a word
596 * http://graphics.stanford.edu/~seander/bithacks.html#ZeroInWord
597 * hasZeroByte = (v - 0x01010101UL) & ~v & 0x80808080UL;
598 *
599 * To look for 4 different byte values, xor the word with those bytes and
600 * then check for zero bytes:
601 *
602 * v = (((unsigned char)c * 0x1010101U) ^ delimiter)
603 * where <delimiter> is the 4 byte values to look for (as an uint)
604 * and <c> is the character that is being tested
605 */
606static inline unsigned int is_delimiter(unsigned char c, unsigned int mask)
607{
608 mask ^= (c * 0x01010101); /* propagate the char to all 4 bytes */
609 return (mask - 0x01010101) & ~mask & 0x80808080U;
610}
611
612static inline unsigned int make_4delim(unsigned char d1, unsigned char d2, unsigned char d3, unsigned char d4)
613{
614 return d1 << 24 | d2 << 16 | d3 << 8 | d4;
615}
616
Willy Tarreaua84d3742007-05-07 00:36:48 +0200617/* This one is used by other real functions. It checks that the pattern is
618 * included inside the tested string, but enclosed between the specified
Finn Arne Gangstade8c7ecc2011-09-09 16:09:50 +0200619 * delimiters or at the beginning or end of the string. The delimiters are
620 * provided as an unsigned int made by make_4delim() and match up to 4 different
621 * delimiters. Delimiters are stripped at the beginning and end of the pattern.
Willy Tarreaua84d3742007-05-07 00:36:48 +0200622 */
Willy Tarreau37406352012-04-23 16:16:37 +0200623static int match_word(struct sample *smp, struct acl_pattern *pattern, unsigned int delimiters)
Willy Tarreaua84d3742007-05-07 00:36:48 +0200624{
Willy Tarreauc8d7c962007-06-17 08:20:33 +0200625 int may_match, icase;
Willy Tarreaua84d3742007-05-07 00:36:48 +0200626 char *c, *end;
627 char *ps;
628 int pl;
629
630 pl = pattern->len;
631 ps = pattern->ptr.str;
Finn Arne Gangstade8c7ecc2011-09-09 16:09:50 +0200632
633 while (pl > 0 && is_delimiter(*ps, delimiters)) {
Willy Tarreaua84d3742007-05-07 00:36:48 +0200634 pl--;
635 ps++;
636 }
637
Finn Arne Gangstade8c7ecc2011-09-09 16:09:50 +0200638 while (pl > 0 && is_delimiter(ps[pl - 1], delimiters))
Willy Tarreaua84d3742007-05-07 00:36:48 +0200639 pl--;
640
Willy Tarreauf853c462012-04-23 18:53:56 +0200641 if (pl > smp->data.str.len)
Willy Tarreau11382812008-07-09 16:18:21 +0200642 return ACL_PAT_FAIL;
Willy Tarreaua84d3742007-05-07 00:36:48 +0200643
644 may_match = 1;
Willy Tarreauc8d7c962007-06-17 08:20:33 +0200645 icase = pattern->flags & ACL_PAT_F_IGNORE_CASE;
Willy Tarreauf853c462012-04-23 18:53:56 +0200646 end = smp->data.str.str + smp->data.str.len - pl;
647 for (c = smp->data.str.str; c <= end; c++) {
Finn Arne Gangstade8c7ecc2011-09-09 16:09:50 +0200648 if (is_delimiter(*c, delimiters)) {
Willy Tarreaua84d3742007-05-07 00:36:48 +0200649 may_match = 1;
650 continue;
651 }
Willy Tarreaua84d3742007-05-07 00:36:48 +0200652
Willy Tarreauc8d7c962007-06-17 08:20:33 +0200653 if (!may_match)
654 continue;
655
656 if (icase) {
657 if ((tolower(*c) == tolower(*ps)) &&
658 (strncasecmp(ps, c, pl) == 0) &&
Finn Arne Gangstade8c7ecc2011-09-09 16:09:50 +0200659 (c == end || is_delimiter(c[pl], delimiters)))
Willy Tarreau11382812008-07-09 16:18:21 +0200660 return ACL_PAT_PASS;
Willy Tarreauc8d7c962007-06-17 08:20:33 +0200661 } else {
662 if ((*c == *ps) &&
663 (strncmp(ps, c, pl) == 0) &&
Finn Arne Gangstade8c7ecc2011-09-09 16:09:50 +0200664 (c == end || is_delimiter(c[pl], delimiters)))
Willy Tarreau11382812008-07-09 16:18:21 +0200665 return ACL_PAT_PASS;
Willy Tarreauc8d7c962007-06-17 08:20:33 +0200666 }
Willy Tarreaua84d3742007-05-07 00:36:48 +0200667 may_match = 0;
668 }
Willy Tarreau11382812008-07-09 16:18:21 +0200669 return ACL_PAT_FAIL;
Willy Tarreaua84d3742007-05-07 00:36:48 +0200670}
671
672/* Checks that the pattern is included inside the tested string, but enclosed
Finn Arne Gangstade8c7ecc2011-09-09 16:09:50 +0200673 * between the delimiters '?' or '/' or at the beginning or end of the string.
674 * Delimiters at the beginning or end of the pattern are ignored.
Willy Tarreaua84d3742007-05-07 00:36:48 +0200675 */
Willy Tarreau37406352012-04-23 16:16:37 +0200676int acl_match_dir(struct sample *smp, struct acl_pattern *pattern)
Willy Tarreaua84d3742007-05-07 00:36:48 +0200677{
Willy Tarreau37406352012-04-23 16:16:37 +0200678 return match_word(smp, pattern, make_4delim('/', '?', '?', '?'));
Willy Tarreaua84d3742007-05-07 00:36:48 +0200679}
680
681/* Checks that the pattern is included inside the tested string, but enclosed
Finn Arne Gangstade8c7ecc2011-09-09 16:09:50 +0200682 * between the delmiters '/', '?', '.' or ":" or at the beginning or end of
683 * the string. Delimiters at the beginning or end of the pattern are ignored.
Willy Tarreaua84d3742007-05-07 00:36:48 +0200684 */
Willy Tarreau37406352012-04-23 16:16:37 +0200685int acl_match_dom(struct sample *smp, struct acl_pattern *pattern)
Willy Tarreaua84d3742007-05-07 00:36:48 +0200686{
Willy Tarreau37406352012-04-23 16:16:37 +0200687 return match_word(smp, pattern, make_4delim('/', '?', '.', ':'));
Willy Tarreaua84d3742007-05-07 00:36:48 +0200688}
689
690/* Checks that the integer in <test> is included between min and max */
Willy Tarreau37406352012-04-23 16:16:37 +0200691int acl_match_int(struct sample *smp, struct acl_pattern *pattern)
Willy Tarreaua84d3742007-05-07 00:36:48 +0200692{
Willy Tarreauf853c462012-04-23 18:53:56 +0200693 if ((!pattern->val.range.min_set || pattern->val.range.min <= smp->data.uint) &&
694 (!pattern->val.range.max_set || smp->data.uint <= pattern->val.range.max))
Willy Tarreau11382812008-07-09 16:18:21 +0200695 return ACL_PAT_PASS;
696 return ACL_PAT_FAIL;
Willy Tarreaua84d3742007-05-07 00:36:48 +0200697}
698
Willy Tarreau0e698542011-09-16 08:32:32 +0200699/* Checks that the length of the pattern in <test> is included between min and max */
Willy Tarreau37406352012-04-23 16:16:37 +0200700int acl_match_len(struct sample *smp, struct acl_pattern *pattern)
Willy Tarreau0e698542011-09-16 08:32:32 +0200701{
Willy Tarreauf853c462012-04-23 18:53:56 +0200702 if ((!pattern->val.range.min_set || pattern->val.range.min <= smp->data.str.len) &&
703 (!pattern->val.range.max_set || smp->data.str.len <= pattern->val.range.max))
Willy Tarreau0e698542011-09-16 08:32:32 +0200704 return ACL_PAT_PASS;
705 return ACL_PAT_FAIL;
706}
707
Willy Tarreau37406352012-04-23 16:16:37 +0200708int acl_match_ip(struct sample *smp, struct acl_pattern *pattern)
Willy Tarreaua67fad92007-05-08 19:50:09 +0200709{
Willy Tarreauceb4ac92012-04-28 00:41:46 +0200710 unsigned int v4; /* in network byte order */
711 struct in6_addr *v6;
712 int bits, pos;
713 struct in6_addr tmp6;
Willy Tarreaua67fad92007-05-08 19:50:09 +0200714
Willy Tarreauceb4ac92012-04-28 00:41:46 +0200715 if (pattern->type == SMP_T_IPV4) {
716 if (smp->type == SMP_T_IPV4) {
717 v4 = smp->data.ipv4.s_addr;
718 }
719 else if (smp->type == SMP_T_IPV6) {
720 /* v4 match on a V6 sample. We want to check at least for
721 * the following forms :
722 * - ::ffff:ip:v4 (ipv4 mapped)
723 * - ::0000:ip:v4 (old ipv4 mapped)
724 * - 2002:ip:v4:: (6to4)
725 */
726 if (*(uint32_t*)&smp->data.ipv6.s6_addr[0] == 0 &&
727 *(uint32_t*)&smp->data.ipv6.s6_addr[4] == 0 &&
728 (*(uint32_t*)&smp->data.ipv6.s6_addr[8] == 0 ||
729 *(uint32_t*)&smp->data.ipv6.s6_addr[8] == htonl(0xFFFF))) {
730 v4 = *(uint32_t*)&smp->data.ipv6.s6_addr[12];
731 }
732 else if (*(uint16_t*)&smp->data.ipv6.s6_addr[0] == htons(0x2002)) {
733 v4 = htonl((ntohs(*(uint16_t*)&smp->data.ipv6.s6_addr[2]) << 16) +
734 ntohs(*(uint16_t*)&smp->data.ipv6.s6_addr[4]));
735 }
736 else
737 return ACL_PAT_FAIL;
738 }
739 else
740 return ACL_PAT_FAIL;
Willy Tarreaua67fad92007-05-08 19:50:09 +0200741
Willy Tarreauceb4ac92012-04-28 00:41:46 +0200742 if (((v4 ^ pattern->val.ipv4.addr.s_addr) & pattern->val.ipv4.mask.s_addr) == 0)
743 return ACL_PAT_PASS;
744 else
745 return ACL_PAT_FAIL;
746 }
747 else if (pattern->type == SMP_T_IPV6) {
748 if (smp->type == SMP_T_IPV4) {
749 /* Convert the IPv4 sample address to IPv4 with the
750 * mapping method using the ::ffff: prefix.
751 */
752 memset(&tmp6, 0, 10);
753 *(uint16_t*)&tmp6.s6_addr[10] = htons(0xffff);
754 *(uint32_t*)&tmp6.s6_addr[12] = smp->data.ipv4.s_addr;
755 v6 = &tmp6;
756 }
757 else if (smp->type == SMP_T_IPV6) {
758 v6 = &smp->data.ipv6;
759 }
760 else {
761 return ACL_PAT_FAIL;
762 }
763
764 bits = pattern->val.ipv6.mask;
765 for (pos = 0; bits > 0; pos += 4, bits -= 32) {
766 v4 = *(uint32_t*)&v6->s6_addr[pos] ^ *(uint32_t*)&pattern->val.ipv6.addr.s6_addr[pos];
767 if (bits < 32)
768 v4 &= (~0U) << (32-bits);
769 if (v4)
770 return ACL_PAT_FAIL;
771 }
Willy Tarreau11382812008-07-09 16:18:21 +0200772 return ACL_PAT_PASS;
Willy Tarreauceb4ac92012-04-28 00:41:46 +0200773 }
Willy Tarreau11382812008-07-09 16:18:21 +0200774 return ACL_PAT_FAIL;
Willy Tarreaua67fad92007-05-08 19:50:09 +0200775}
776
Willy Tarreaub337b532010-05-13 20:03:41 +0200777/* Lookup an IPv4 address in the expression's pattern tree using the longest
778 * match method. The node is returned if it exists, otherwise NULL.
779 */
Willy Tarreau37406352012-04-23 16:16:37 +0200780static void *acl_lookup_ip(struct sample *smp, struct acl_expr *expr)
Willy Tarreaub337b532010-05-13 20:03:41 +0200781{
782 struct in_addr *s;
783
Willy Tarreauf853c462012-04-23 18:53:56 +0200784 if (smp->type != SMP_T_IPV4)
Willy Tarreaub337b532010-05-13 20:03:41 +0200785 return ACL_PAT_FAIL;
786
Willy Tarreauf853c462012-04-23 18:53:56 +0200787 s = &smp->data.ipv4;
Willy Tarreaub337b532010-05-13 20:03:41 +0200788 return ebmb_lookup_longest(&expr->pattern_tree, &s->s_addr);
789}
790
Willy Tarreaua84d3742007-05-07 00:36:48 +0200791/* Parse a string. It is allocated and duplicated. */
Willy Tarreau7dcb6482012-04-27 17:52:25 +0200792int acl_parse_str(const char **text, struct acl_pattern *pattern, int *opaque, char **err)
Willy Tarreaua84d3742007-05-07 00:36:48 +0200793{
794 int len;
795
Willy Tarreauae8b7962007-06-09 23:10:04 +0200796 len = strlen(*text);
Willy Tarreauc92ddbc2012-04-27 22:10:57 +0200797 pattern->type = SMP_T_CSTR;
Willy Tarreauc4262962010-05-10 23:42:40 +0200798
799 if (pattern->flags & ACL_PAT_F_TREE_OK) {
800 /* we're allowed to put the data in a tree whose root is pointed
801 * to by val.tree.
802 */
803 struct ebmb_node *node;
804
805 node = calloc(1, sizeof(*node) + len + 1);
Willy Tarreau7dcb6482012-04-27 17:52:25 +0200806 if (!node) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +0200807 memprintf(err, "out of memory while loading string pattern");
Willy Tarreauc4262962010-05-10 23:42:40 +0200808 return 0;
Willy Tarreau7dcb6482012-04-27 17:52:25 +0200809 }
Willy Tarreauc4262962010-05-10 23:42:40 +0200810 memcpy(node->key, *text, len + 1);
811 if (ebst_insert(pattern->val.tree, node) != node)
812 free(node); /* was a duplicate */
813 pattern->flags |= ACL_PAT_F_TREE; /* this pattern now contains a tree */
814 return 1;
815 }
816
Willy Tarreauae8b7962007-06-09 23:10:04 +0200817 pattern->ptr.str = strdup(*text);
Willy Tarreau7dcb6482012-04-27 17:52:25 +0200818 if (!pattern->ptr.str) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +0200819 memprintf(err, "out of memory while loading string pattern");
Willy Tarreaua84d3742007-05-07 00:36:48 +0200820 return 0;
Willy Tarreau7dcb6482012-04-27 17:52:25 +0200821 }
Willy Tarreaua84d3742007-05-07 00:36:48 +0200822 pattern->len = len;
823 return 1;
824}
825
Krzysztof Piotr Oledzkif9423ae2010-01-29 19:26:18 +0100826/* Parse and concatenate all further strings into one. */
827int
Willy Tarreau7dcb6482012-04-27 17:52:25 +0200828acl_parse_strcat(const char **text, struct acl_pattern *pattern, int *opaque, char **err)
Krzysztof Piotr Oledzkif9423ae2010-01-29 19:26:18 +0100829{
830
831 int len = 0, i;
832 char *s;
833
834 for (i = 0; *text[i]; i++)
835 len += strlen(text[i])+1;
836
Willy Tarreauc92ddbc2012-04-27 22:10:57 +0200837 pattern->type = SMP_T_CSTR;
Krzysztof Piotr Oledzkif9423ae2010-01-29 19:26:18 +0100838 pattern->ptr.str = s = calloc(1, len);
Willy Tarreau7dcb6482012-04-27 17:52:25 +0200839 if (!pattern->ptr.str) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +0200840 memprintf(err, "out of memory while loading pattern");
Krzysztof Piotr Oledzkif9423ae2010-01-29 19:26:18 +0100841 return 0;
Willy Tarreau7dcb6482012-04-27 17:52:25 +0200842 }
Krzysztof Piotr Oledzkif9423ae2010-01-29 19:26:18 +0100843
844 for (i = 0; *text[i]; i++)
845 s += sprintf(s, i?" %s":"%s", text[i]);
846
847 pattern->len = len;
848
849 return i;
850}
851
Krzysztof Piotr Oledzki8001d612008-05-31 13:53:23 +0200852/* Free data allocated by acl_parse_reg */
Willy Tarreau37406352012-04-23 16:16:37 +0200853static void acl_free_reg(void *ptr)
854{
Krzysztof Piotr Oledzki8001d612008-05-31 13:53:23 +0200855 regfree((regex_t *)ptr);
856}
857
Willy Tarreauf3d25982007-05-08 22:45:09 +0200858/* Parse a regex. It is allocated. */
Willy Tarreau7dcb6482012-04-27 17:52:25 +0200859int acl_parse_reg(const char **text, struct acl_pattern *pattern, int *opaque, char **err)
Willy Tarreauf3d25982007-05-08 22:45:09 +0200860{
861 regex_t *preg;
Willy Tarreauc8d7c962007-06-17 08:20:33 +0200862 int icase;
Willy Tarreauf3d25982007-05-08 22:45:09 +0200863
864 preg = calloc(1, sizeof(regex_t));
865
Willy Tarreau7dcb6482012-04-27 17:52:25 +0200866 if (!preg) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +0200867 memprintf(err, "out of memory while loading pattern");
Willy Tarreauf3d25982007-05-08 22:45:09 +0200868 return 0;
Willy Tarreau7dcb6482012-04-27 17:52:25 +0200869 }
Willy Tarreauf3d25982007-05-08 22:45:09 +0200870
Willy Tarreauc8d7c962007-06-17 08:20:33 +0200871 icase = (pattern->flags & ACL_PAT_F_IGNORE_CASE) ? REG_ICASE : 0;
872 if (regcomp(preg, *text, REG_EXTENDED | REG_NOSUB | icase) != 0) {
Willy Tarreauf3d25982007-05-08 22:45:09 +0200873 free(preg);
Willy Tarreaueb6cead2012-09-20 19:43:14 +0200874 memprintf(err, "regex '%s' is invalid", *text);
Willy Tarreauf3d25982007-05-08 22:45:09 +0200875 return 0;
876 }
877
878 pattern->ptr.reg = preg;
Krzysztof Piotr Oledzki8001d612008-05-31 13:53:23 +0200879 pattern->freeptrbuf = &acl_free_reg;
Willy Tarreauf3d25982007-05-08 22:45:09 +0200880 return 1;
881}
882
Willy Tarreauae8b7962007-06-09 23:10:04 +0200883/* Parse a range of positive integers delimited by either ':' or '-'. If only
884 * one integer is read, it is set as both min and max. An operator may be
885 * specified as the prefix, among this list of 5 :
886 *
887 * 0:eq, 1:gt, 2:ge, 3:lt, 4:le
888 *
889 * The default operator is "eq". It supports range matching. Ranges are
890 * rejected for other operators. The operator may be changed at any time.
891 * The operator is stored in the 'opaque' argument.
892 *
Willy Tarreau7dcb6482012-04-27 17:52:25 +0200893 * If err is non-NULL, an error message will be returned there on errors and
894 * the caller will have to free it.
895 *
Willy Tarreaua84d3742007-05-07 00:36:48 +0200896 */
Willy Tarreau7dcb6482012-04-27 17:52:25 +0200897int acl_parse_int(const char **text, struct acl_pattern *pattern, int *opaque, char **err)
Willy Tarreaua84d3742007-05-07 00:36:48 +0200898{
Willy Tarreauae8b7962007-06-09 23:10:04 +0200899 signed long long i;
900 unsigned int j, last, skip = 0;
901 const char *ptr = *text;
902
Willy Tarreauc92ddbc2012-04-27 22:10:57 +0200903 pattern->type = SMP_T_UINT;
Willy Tarreau8f8e6452007-06-17 21:51:38 +0200904 while (!isdigit((unsigned char)*ptr)) {
Willy Tarreau1c7cc5b2010-07-18 10:46:33 +0200905 switch (get_std_op(ptr)) {
906 case STD_OP_EQ: *opaque = 0; break;
907 case STD_OP_GT: *opaque = 1; break;
908 case STD_OP_GE: *opaque = 2; break;
909 case STD_OP_LT: *opaque = 3; break;
910 case STD_OP_LE: *opaque = 4; break;
911 default:
Willy Tarreaueb6cead2012-09-20 19:43:14 +0200912 memprintf(err, "'%s' is neither a number nor a supported operator", ptr);
Willy Tarreauae8b7962007-06-09 23:10:04 +0200913 return 0;
Willy Tarreau1c7cc5b2010-07-18 10:46:33 +0200914 }
Willy Tarreauae8b7962007-06-09 23:10:04 +0200915
916 skip++;
917 ptr = text[skip];
918 }
Willy Tarreaua84d3742007-05-07 00:36:48 +0200919
920 last = i = 0;
921 while (1) {
Willy Tarreauae8b7962007-06-09 23:10:04 +0200922 j = *ptr++;
Willy Tarreaua84d3742007-05-07 00:36:48 +0200923 if ((j == '-' || j == ':') && !last) {
924 last++;
925 pattern->val.range.min = i;
926 i = 0;
927 continue;
928 }
929 j -= '0';
930 if (j > 9)
931 // also catches the terminating zero
932 break;
933 i *= 10;
934 i += j;
935 }
Willy Tarreauae8b7962007-06-09 23:10:04 +0200936
Willy Tarreau7dcb6482012-04-27 17:52:25 +0200937 if (last && *opaque >= 1 && *opaque <= 4) {
Willy Tarreauae8b7962007-06-09 23:10:04 +0200938 /* having a range with a min or a max is absurd */
Willy Tarreaueb6cead2012-09-20 19:43:14 +0200939 memprintf(err, "integer range '%s' specified with a comparison operator", text[skip]);
Willy Tarreauae8b7962007-06-09 23:10:04 +0200940 return 0;
Willy Tarreau7dcb6482012-04-27 17:52:25 +0200941 }
Willy Tarreauae8b7962007-06-09 23:10:04 +0200942
Willy Tarreaua84d3742007-05-07 00:36:48 +0200943 if (!last)
944 pattern->val.range.min = i;
945 pattern->val.range.max = i;
Willy Tarreauae8b7962007-06-09 23:10:04 +0200946
947 switch (*opaque) {
948 case 0: /* eq */
949 pattern->val.range.min_set = 1;
950 pattern->val.range.max_set = 1;
951 break;
952 case 1: /* gt */
953 pattern->val.range.min++; /* gt = ge + 1 */
954 case 2: /* ge */
955 pattern->val.range.min_set = 1;
956 pattern->val.range.max_set = 0;
957 break;
958 case 3: /* lt */
959 pattern->val.range.max--; /* lt = le - 1 */
960 case 4: /* le */
961 pattern->val.range.min_set = 0;
962 pattern->val.range.max_set = 1;
963 break;
964 }
965 return skip + 1;
Willy Tarreaua84d3742007-05-07 00:36:48 +0200966}
967
Willy Tarreau4a26d2f2008-07-15 16:05:33 +0200968/* Parse a range of positive 2-component versions delimited by either ':' or
969 * '-'. The version consists in a major and a minor, both of which must be
970 * smaller than 65536, because internally they will be represented as a 32-bit
971 * integer.
972 * If only one version is read, it is set as both min and max. Just like for
973 * pure integers, an operator may be specified as the prefix, among this list
974 * of 5 :
975 *
976 * 0:eq, 1:gt, 2:ge, 3:lt, 4:le
977 *
978 * The default operator is "eq". It supports range matching. Ranges are
979 * rejected for other operators. The operator may be changed at any time.
980 * The operator is stored in the 'opaque' argument. This allows constructs
981 * such as the following one :
982 *
983 * acl obsolete_ssl ssl_req_proto lt 3
984 * acl unsupported_ssl ssl_req_proto gt 3.1
985 * acl valid_ssl ssl_req_proto 3.0-3.1
986 *
987 */
Willy Tarreau7dcb6482012-04-27 17:52:25 +0200988int acl_parse_dotted_ver(const char **text, struct acl_pattern *pattern, int *opaque, char **err)
Willy Tarreau4a26d2f2008-07-15 16:05:33 +0200989{
990 signed long long i;
991 unsigned int j, last, skip = 0;
992 const char *ptr = *text;
993
994
995 while (!isdigit((unsigned char)*ptr)) {
Willy Tarreau1c7cc5b2010-07-18 10:46:33 +0200996 switch (get_std_op(ptr)) {
997 case STD_OP_EQ: *opaque = 0; break;
998 case STD_OP_GT: *opaque = 1; break;
999 case STD_OP_GE: *opaque = 2; break;
1000 case STD_OP_LT: *opaque = 3; break;
1001 case STD_OP_LE: *opaque = 4; break;
1002 default:
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001003 memprintf(err, "'%s' is neither a number nor a supported operator", ptr);
Willy Tarreau4a26d2f2008-07-15 16:05:33 +02001004 return 0;
Willy Tarreau1c7cc5b2010-07-18 10:46:33 +02001005 }
Willy Tarreau4a26d2f2008-07-15 16:05:33 +02001006
1007 skip++;
1008 ptr = text[skip];
1009 }
1010
1011 last = i = 0;
1012 while (1) {
1013 j = *ptr++;
1014 if (j == '.') {
1015 /* minor part */
1016 if (i >= 65536)
1017 return 0;
1018 i <<= 16;
1019 continue;
1020 }
1021 if ((j == '-' || j == ':') && !last) {
1022 last++;
1023 if (i < 65536)
1024 i <<= 16;
1025 pattern->val.range.min = i;
1026 i = 0;
1027 continue;
1028 }
1029 j -= '0';
1030 if (j > 9)
1031 // also catches the terminating zero
1032 break;
1033 i = (i & 0xFFFF0000) + (i & 0xFFFF) * 10;
1034 i += j;
1035 }
1036
1037 /* if we only got a major version, let's shift it now */
1038 if (i < 65536)
1039 i <<= 16;
1040
Willy Tarreau7dcb6482012-04-27 17:52:25 +02001041 if (last && *opaque >= 1 && *opaque <= 4) {
Willy Tarreau4a26d2f2008-07-15 16:05:33 +02001042 /* having a range with a min or a max is absurd */
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001043 memprintf(err, "version range '%s' specified with a comparison operator", text[skip]);
Willy Tarreau4a26d2f2008-07-15 16:05:33 +02001044 return 0;
Willy Tarreau7dcb6482012-04-27 17:52:25 +02001045 }
Willy Tarreau4a26d2f2008-07-15 16:05:33 +02001046
1047 if (!last)
1048 pattern->val.range.min = i;
1049 pattern->val.range.max = i;
1050
1051 switch (*opaque) {
1052 case 0: /* eq */
1053 pattern->val.range.min_set = 1;
1054 pattern->val.range.max_set = 1;
1055 break;
1056 case 1: /* gt */
1057 pattern->val.range.min++; /* gt = ge + 1 */
1058 case 2: /* ge */
1059 pattern->val.range.min_set = 1;
1060 pattern->val.range.max_set = 0;
1061 break;
1062 case 3: /* lt */
1063 pattern->val.range.max--; /* lt = le - 1 */
1064 case 4: /* le */
1065 pattern->val.range.min_set = 0;
1066 pattern->val.range.max_set = 1;
1067 break;
1068 }
1069 return skip + 1;
1070}
1071
Willy Tarreaua67fad92007-05-08 19:50:09 +02001072/* Parse an IP address and an optional mask in the form addr[/mask].
1073 * The addr may either be an IPv4 address or a hostname. The mask
1074 * may either be a dotted mask or a number of bits. Returns 1 if OK,
Willy Tarreauc92ddbc2012-04-27 22:10:57 +02001075 * otherwise 0. NOTE: IP address patterns are typed (IPV4/IPV6).
Willy Tarreaua67fad92007-05-08 19:50:09 +02001076 */
Willy Tarreau7dcb6482012-04-27 17:52:25 +02001077int acl_parse_ip(const char **text, struct acl_pattern *pattern, int *opaque, char **err)
Willy Tarreaua67fad92007-05-08 19:50:09 +02001078{
Willy Tarreaub337b532010-05-13 20:03:41 +02001079 struct eb_root *tree = NULL;
1080 if (pattern->flags & ACL_PAT_F_TREE_OK)
1081 tree = pattern->val.tree;
1082
1083 if (str2net(*text, &pattern->val.ipv4.addr, &pattern->val.ipv4.mask)) {
1084 unsigned int mask = ntohl(pattern->val.ipv4.mask.s_addr);
1085 struct ebmb_node *node;
1086 /* check if the mask is contiguous so that we can insert the
1087 * network into the tree. A continuous mask has only ones on
1088 * the left. This means that this mask + its lower bit added
1089 * once again is null.
1090 */
Willy Tarreauceb4ac92012-04-28 00:41:46 +02001091 pattern->type = SMP_T_IPV4;
Willy Tarreaub337b532010-05-13 20:03:41 +02001092 if (mask + (mask & -mask) == 0 && tree) {
1093 mask = mask ? 33 - flsnz(mask & -mask) : 0; /* equals cidr value */
1094 /* FIXME: insert <addr>/<mask> into the tree here */
1095 node = calloc(1, sizeof(*node) + 4); /* reserve 4 bytes for IPv4 address */
Willy Tarreau7dcb6482012-04-27 17:52:25 +02001096 if (!node) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001097 memprintf(err, "out of memory while loading IPv4 pattern");
Willy Tarreaub337b532010-05-13 20:03:41 +02001098 return 0;
Willy Tarreau7dcb6482012-04-27 17:52:25 +02001099 }
Willy Tarreaub337b532010-05-13 20:03:41 +02001100 memcpy(node->key, &pattern->val.ipv4.addr, 4); /* network byte order */
1101 node->node.pfx = mask;
1102 if (ebmb_insert_prefix(tree, node, 4) != node)
1103 free(node); /* was a duplicate */
1104 pattern->flags |= ACL_PAT_F_TREE;
1105 return 1;
1106 }
Willy Tarreauae8b7962007-06-09 23:10:04 +02001107 return 1;
Willy Tarreaub337b532010-05-13 20:03:41 +02001108 }
Willy Tarreauceb4ac92012-04-28 00:41:46 +02001109 else if (str62net(*text, &pattern->val.ipv6.addr, &pattern->val.ipv6.mask)) {
1110 /* no tree support right now */
1111 pattern->type = SMP_T_IPV6;
1112 return 1;
1113 }
Willy Tarreau7dcb6482012-04-27 17:52:25 +02001114 else {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001115 memprintf(err, "'%s' is not a valid IPv4 or IPv6 address", *text);
Willy Tarreauae8b7962007-06-09 23:10:04 +02001116 return 0;
Willy Tarreau7dcb6482012-04-27 17:52:25 +02001117 }
Willy Tarreaua67fad92007-05-08 19:50:09 +02001118}
1119
Willy Tarreaua84d3742007-05-07 00:36:48 +02001120/*
1121 * Registers the ACL keyword list <kwl> as a list of valid keywords for next
1122 * parsing sessions.
1123 */
1124void acl_register_keywords(struct acl_kw_list *kwl)
1125{
1126 LIST_ADDQ(&acl_keywords.list, &kwl->list);
1127}
1128
1129/*
1130 * Unregisters the ACL keyword list <kwl> from the list of valid keywords.
1131 */
1132void acl_unregister_keywords(struct acl_kw_list *kwl)
1133{
1134 LIST_DEL(&kwl->list);
1135 LIST_INIT(&kwl->list);
1136}
1137
1138/* Return a pointer to the ACL <name> within the list starting at <head>, or
1139 * NULL if not found.
1140 */
1141struct acl *find_acl_by_name(const char *name, struct list *head)
1142{
1143 struct acl *acl;
1144 list_for_each_entry(acl, head, list) {
1145 if (strcmp(acl->name, name) == 0)
1146 return acl;
1147 }
1148 return NULL;
1149}
1150
1151/* Return a pointer to the ACL keyword <kw>, or NULL if not found. Note that if
1152 * <kw> contains an opening parenthesis, only the left part of it is checked.
1153 */
1154struct acl_keyword *find_acl_kw(const char *kw)
1155{
1156 int index;
1157 const char *kwend;
1158 struct acl_kw_list *kwl;
1159
1160 kwend = strchr(kw, '(');
1161 if (!kwend)
1162 kwend = kw + strlen(kw);
1163
1164 list_for_each_entry(kwl, &acl_keywords.list, list) {
1165 for (index = 0; kwl->kw[index].kw != NULL; index++) {
1166 if ((strncmp(kwl->kw[index].kw, kw, kwend - kw) == 0) &&
1167 kwl->kw[index].kw[kwend-kw] == 0)
1168 return &kwl->kw[index];
1169 }
1170 }
1171 return NULL;
1172}
1173
Willy Tarreaudfd7fca2011-03-09 07:27:02 +01001174/* NB: does nothing if <pat> is NULL */
Willy Tarreaua84d3742007-05-07 00:36:48 +02001175static void free_pattern(struct acl_pattern *pat)
1176{
Willy Tarreaudfd7fca2011-03-09 07:27:02 +01001177 if (!pat)
1178 return;
Krzysztof Piotr Oledzki8001d612008-05-31 13:53:23 +02001179
1180 if (pat->ptr.ptr) {
1181 if (pat->freeptrbuf)
1182 pat->freeptrbuf(pat->ptr.ptr);
1183
Willy Tarreaua84d3742007-05-07 00:36:48 +02001184 free(pat->ptr.ptr);
Krzysztof Piotr Oledzki8001d612008-05-31 13:53:23 +02001185 }
1186
Willy Tarreaua84d3742007-05-07 00:36:48 +02001187 free(pat);
1188}
1189
1190static void free_pattern_list(struct list *head)
1191{
1192 struct acl_pattern *pat, *tmp;
1193 list_for_each_entry_safe(pat, tmp, head, list)
1194 free_pattern(pat);
1195}
1196
Willy Tarreaue56cda92010-05-11 23:25:05 +02001197static void free_pattern_tree(struct eb_root *root)
1198{
1199 struct eb_node *node, *next;
1200 node = eb_first(root);
1201 while (node) {
1202 next = eb_next(node);
1203 free(node);
1204 node = next;
1205 }
1206}
1207
Willy Tarreaua84d3742007-05-07 00:36:48 +02001208static struct acl_expr *prune_acl_expr(struct acl_expr *expr)
1209{
Willy Tarreau34db1082012-04-19 17:16:54 +02001210 struct arg *arg;
1211
Willy Tarreaua84d3742007-05-07 00:36:48 +02001212 free_pattern_list(&expr->patterns);
Willy Tarreaue56cda92010-05-11 23:25:05 +02001213 free_pattern_tree(&expr->pattern_tree);
Willy Tarreaua84d3742007-05-07 00:36:48 +02001214 LIST_INIT(&expr->patterns);
Willy Tarreau34db1082012-04-19 17:16:54 +02001215
1216 for (arg = expr->args; arg; arg++) {
1217 if (arg->type == ARGT_STOP)
1218 break;
Willy Tarreau496aa012012-06-01 10:38:29 +02001219 if (arg->type == ARGT_STR || arg->unresolved) {
Willy Tarreau34db1082012-04-19 17:16:54 +02001220 free(arg->data.str.str);
1221 arg->data.str.str = NULL;
Willy Tarreau496aa012012-06-01 10:38:29 +02001222 arg->unresolved = 0;
Willy Tarreau34db1082012-04-19 17:16:54 +02001223 }
1224 arg++;
1225 }
1226
1227 free(expr->args);
Willy Tarreaua84d3742007-05-07 00:36:48 +02001228 expr->kw->use_cnt--;
1229 return expr;
1230}
1231
Willy Tarreau08ad0b32012-04-27 17:25:24 +02001232
1233/* Reads patterns from a file. If <err_msg> is non-NULL, an error message will
1234 * be returned there on errors and the caller will have to free it.
1235 */
Willy Tarreau2b5285d2010-05-09 23:45:24 +02001236static int acl_read_patterns_from_file( struct acl_keyword *aclkw,
1237 struct acl_expr *expr,
Willy Tarreau08ad0b32012-04-27 17:25:24 +02001238 const char *filename, int patflags,
1239 char **err)
Willy Tarreau2b5285d2010-05-09 23:45:24 +02001240{
1241 FILE *file;
1242 char *c;
1243 const char *args[2];
1244 struct acl_pattern *pattern;
1245 int opaque;
Willy Tarreau6a8097f2011-02-26 15:14:15 +01001246 int ret = 0;
Willy Tarreau08ad0b32012-04-27 17:25:24 +02001247 int line = 0;
Willy Tarreau2b5285d2010-05-09 23:45:24 +02001248
1249 file = fopen(filename, "r");
Willy Tarreau08ad0b32012-04-27 17:25:24 +02001250 if (!file) {
1251 memprintf(err, "failed to open pattern file <%s>", filename);
Willy Tarreau2b5285d2010-05-09 23:45:24 +02001252 return 0;
Willy Tarreau08ad0b32012-04-27 17:25:24 +02001253 }
Willy Tarreau2b5285d2010-05-09 23:45:24 +02001254
1255 /* now parse all patterns. The file may contain only one pattern per
1256 * line. If the line contains spaces, they will be part of the pattern.
1257 * The pattern stops at the first CR, LF or EOF encountered.
1258 */
1259 opaque = 0;
Willy Tarreaue56cda92010-05-11 23:25:05 +02001260 pattern = NULL;
Willy Tarreau2b5285d2010-05-09 23:45:24 +02001261 args[1] = "";
David du Colombier7af46052012-05-16 14:16:48 +02001262 while (fgets(trash, trashlen, file) != NULL) {
Willy Tarreau08ad0b32012-04-27 17:25:24 +02001263 line++;
Willy Tarreau2b5285d2010-05-09 23:45:24 +02001264 c = trash;
Willy Tarreau58215a02010-05-13 22:07:43 +02001265
1266 /* ignore lines beginning with a dash */
1267 if (*c == '#')
1268 continue;
1269
1270 /* strip leading spaces and tabs */
1271 while (*c == ' ' || *c == '\t')
1272 c++;
1273
Willy Tarreau58215a02010-05-13 22:07:43 +02001274
1275 args[0] = c;
Willy Tarreau2b5285d2010-05-09 23:45:24 +02001276 while (*c && *c != '\n' && *c != '\r')
1277 c++;
1278 *c = 0;
1279
Willy Tarreau51091962011-01-03 21:04:10 +01001280 /* empty lines are ignored too */
1281 if (c == args[0])
1282 continue;
1283
Willy Tarreaue56cda92010-05-11 23:25:05 +02001284 /* we keep the previous pattern along iterations as long as it's not used */
1285 if (!pattern)
1286 pattern = (struct acl_pattern *)malloc(sizeof(*pattern));
Willy Tarreau08ad0b32012-04-27 17:25:24 +02001287 if (!pattern) {
1288 memprintf(err, "out of memory when loading patterns from file <%s>", filename);
Willy Tarreau2b5285d2010-05-09 23:45:24 +02001289 goto out_close;
Willy Tarreau08ad0b32012-04-27 17:25:24 +02001290 }
Willy Tarreaue56cda92010-05-11 23:25:05 +02001291
1292 memset(pattern, 0, sizeof(*pattern));
Willy Tarreau2b5285d2010-05-09 23:45:24 +02001293 pattern->flags = patflags;
1294
Willy Tarreaue56cda92010-05-11 23:25:05 +02001295 if ((aclkw->requires & ACL_MAY_LOOKUP) && !(pattern->flags & ACL_PAT_F_IGNORE_CASE)) {
1296 /* we pre-set the data pointer to the tree's head so that functions
1297 * which are able to insert in a tree know where to do that.
1298 */
1299 pattern->flags |= ACL_PAT_F_TREE_OK;
1300 pattern->val.tree = &expr->pattern_tree;
1301 }
1302
Willy Tarreauc92ddbc2012-04-27 22:10:57 +02001303 pattern->type = SMP_TYPES; /* unspecified type by default */
Willy Tarreau7dcb6482012-04-27 17:52:25 +02001304 if (!aclkw->parse(args, pattern, &opaque, err))
Willy Tarreau2b5285d2010-05-09 23:45:24 +02001305 goto out_free_pattern;
Willy Tarreaue56cda92010-05-11 23:25:05 +02001306
1307 /* if the parser did not feed the tree, let's chain the pattern to the list */
1308 if (!(pattern->flags & ACL_PAT_F_TREE)) {
1309 LIST_ADDQ(&expr->patterns, &pattern->list);
1310 pattern = NULL; /* get a new one */
1311 }
Willy Tarreau2b5285d2010-05-09 23:45:24 +02001312 }
Willy Tarreau6a8097f2011-02-26 15:14:15 +01001313
1314 ret = 1; /* success */
Willy Tarreau2b5285d2010-05-09 23:45:24 +02001315
1316 out_free_pattern:
1317 free_pattern(pattern);
1318 out_close:
1319 fclose(file);
Willy Tarreau6a8097f2011-02-26 15:14:15 +01001320 return ret;
Willy Tarreau2b5285d2010-05-09 23:45:24 +02001321}
1322
Willy Tarreaub7451bb2012-04-27 12:38:15 +02001323/* Parse an ACL expression starting at <args>[0], and return it. If <err> is
1324 * not NULL, it will be filled with a pointer to an error message in case of
1325 * error. This pointer must be freeable or NULL.
1326 *
Willy Tarreaua84d3742007-05-07 00:36:48 +02001327 * Right now, the only accepted syntax is :
1328 * <subject> [<value>...]
1329 */
Willy Tarreaub7451bb2012-04-27 12:38:15 +02001330struct acl_expr *parse_acl_expr(const char **args, char **err)
Willy Tarreaua84d3742007-05-07 00:36:48 +02001331{
1332 __label__ out_return, out_free_expr, out_free_pattern;
1333 struct acl_expr *expr;
1334 struct acl_keyword *aclkw;
1335 struct acl_pattern *pattern;
Willy Tarreauc8d7c962007-06-17 08:20:33 +02001336 int opaque, patflags;
Willy Tarreaua84d3742007-05-07 00:36:48 +02001337 const char *arg;
1338
1339 aclkw = find_acl_kw(args[0]);
Willy Tarreaub7451bb2012-04-27 12:38:15 +02001340 if (!aclkw || !aclkw->parse) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001341 memprintf(err, "unknown ACL keyword '%s'", *args);
Willy Tarreaua84d3742007-05-07 00:36:48 +02001342 goto out_return;
Willy Tarreaub7451bb2012-04-27 12:38:15 +02001343 }
Willy Tarreaua84d3742007-05-07 00:36:48 +02001344
1345 expr = (struct acl_expr *)calloc(1, sizeof(*expr));
Willy Tarreaub7451bb2012-04-27 12:38:15 +02001346 if (!expr) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001347 memprintf(err, "out of memory when parsing ACL expression");
Willy Tarreaua84d3742007-05-07 00:36:48 +02001348 goto out_return;
Willy Tarreaub7451bb2012-04-27 12:38:15 +02001349 }
Willy Tarreaua84d3742007-05-07 00:36:48 +02001350
1351 expr->kw = aclkw;
1352 aclkw->use_cnt++;
1353 LIST_INIT(&expr->patterns);
Willy Tarreaue56cda92010-05-11 23:25:05 +02001354 expr->pattern_tree = EB_ROOT_UNIQUE;
Willy Tarreaua84d3742007-05-07 00:36:48 +02001355
1356 arg = strchr(args[0], '(');
Willy Tarreau61612d42012-04-19 18:42:05 +02001357 if (aclkw->arg_mask) {
1358 int nbargs = 0;
Willy Tarreau34db1082012-04-19 17:16:54 +02001359 char *end;
Willy Tarreau34db1082012-04-19 17:16:54 +02001360
Willy Tarreau61612d42012-04-19 18:42:05 +02001361 if (arg != NULL) {
1362 /* there are 0 or more arguments in the form "subject(arg[,arg]*)" */
1363 arg++;
1364 end = strchr(arg, ')');
Willy Tarreaub7451bb2012-04-27 12:38:15 +02001365 if (!end) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001366 memprintf(err, "missing closing ')' after arguments to ACL keyword '%s'", aclkw->kw);
Willy Tarreau61612d42012-04-19 18:42:05 +02001367 goto out_free_expr;
Willy Tarreaub7451bb2012-04-27 12:38:15 +02001368 }
Willy Tarreau34db1082012-04-19 17:16:54 +02001369
Willy Tarreau61612d42012-04-19 18:42:05 +02001370 /* Parse the arguments. Note that currently we have no way to
1371 * report parsing errors, hence the NULL in the error pointers.
1372 * An error is also reported if some mandatory arguments are
1373 * missing.
1374 */
1375 nbargs = make_arg_list(arg, end - arg, aclkw->arg_mask, &expr->args,
Willy Tarreaub7451bb2012-04-27 12:38:15 +02001376 err, NULL, NULL);
1377 if (nbargs < 0) {
1378 /* note that make_arg_list will have set <err> here */
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001379 memprintf(err, "in argument to '%s', %s", aclkw->kw, *err);
Willy Tarreau61612d42012-04-19 18:42:05 +02001380 goto out_free_expr;
Willy Tarreaub7451bb2012-04-27 12:38:15 +02001381 }
Willy Tarreauae52f062012-04-26 12:13:35 +02001382
Willy Tarreaub7451bb2012-04-27 12:38:15 +02001383 if (aclkw->val_args && !aclkw->val_args(expr->args, err)) {
1384 /* invalid keyword argument, error must have been
1385 * set by val_args().
1386 */
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001387 memprintf(err, "in argument to '%s', %s", aclkw->kw, *err);
Willy Tarreaub7451bb2012-04-27 12:38:15 +02001388 goto out_free_expr;
1389 }
Willy Tarreau61612d42012-04-19 18:42:05 +02001390 }
Willy Tarreaufc2c1fd2012-04-19 23:35:54 +02001391 else if (ARGM(aclkw->arg_mask) == 1) {
1392 int type = (aclkw->arg_mask >> 4) & 15;
1393
1394 /* If a proxy is noted as a mandatory argument, we'll fake
1395 * an empty one so that acl_find_targets() resolves it as
1396 * the current one later.
1397 */
Willy Tarreaub7451bb2012-04-27 12:38:15 +02001398 if (type != ARGT_FE && type != ARGT_BE && type != ARGT_TAB) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001399 memprintf(err, "ACL keyword '%s' expects %d arguments", aclkw->kw, ARGM(aclkw->arg_mask));
Willy Tarreaufc2c1fd2012-04-19 23:35:54 +02001400 goto out_free_expr;
Willy Tarreaub7451bb2012-04-27 12:38:15 +02001401 }
Willy Tarreaufc2c1fd2012-04-19 23:35:54 +02001402
1403 /* Build an arg list containing the type as an empty string
1404 * and the usual STOP.
1405 */
1406 expr->args = calloc(2, sizeof(*expr->args));
1407 expr->args[0].type = type;
Willy Tarreaue3a46112012-06-15 08:02:34 +02001408 expr->args[0].unresolved = 1;
Willy Tarreaufc2c1fd2012-04-19 23:35:54 +02001409 expr->args[0].data.str.str = strdup("");
1410 expr->args[0].data.str.len = 1;
1411 expr->args[0].data.str.len = 0;
1412 expr->args[1].type = ARGT_STOP;
1413 }
Willy Tarreau61612d42012-04-19 18:42:05 +02001414 else if (ARGM(aclkw->arg_mask)) {
1415 /* there were some mandatory arguments */
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001416 memprintf(err, "ACL keyword '%s' expects %d arguments", aclkw->kw, ARGM(aclkw->arg_mask));
Willy Tarreaua84d3742007-05-07 00:36:48 +02001417 goto out_free_expr;
Willy Tarreau61612d42012-04-19 18:42:05 +02001418 }
1419 }
1420 else {
1421 if (arg) {
1422 /* no argument expected */
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001423 memprintf(err, "ACL keyword '%s' takes no argument", aclkw->kw);
Willy Tarreau61612d42012-04-19 18:42:05 +02001424 goto out_free_expr;
1425 }
Willy Tarreaua84d3742007-05-07 00:36:48 +02001426 }
1427
Willy Tarreaua84d3742007-05-07 00:36:48 +02001428 args++;
Willy Tarreauc8d7c962007-06-17 08:20:33 +02001429
1430 /* check for options before patterns. Supported options are :
1431 * -i : ignore case for all patterns by default
1432 * -f : read patterns from those files
1433 * -- : everything after this is not an option
1434 */
1435 patflags = 0;
1436 while (**args == '-') {
1437 if ((*args)[1] == 'i')
1438 patflags |= ACL_PAT_F_IGNORE_CASE;
Willy Tarreau2b5285d2010-05-09 23:45:24 +02001439 else if ((*args)[1] == 'f') {
Willy Tarreau08ad0b32012-04-27 17:25:24 +02001440 if (!acl_read_patterns_from_file(aclkw, expr, args[1], patflags | ACL_PAT_F_FROM_FILE, err))
Willy Tarreau2b5285d2010-05-09 23:45:24 +02001441 goto out_free_expr;
1442 args++;
1443 }
Willy Tarreauc8d7c962007-06-17 08:20:33 +02001444 else if ((*args)[1] == '-') {
1445 args++;
1446 break;
1447 }
1448 else
1449 break;
1450 args++;
1451 }
1452
1453 /* now parse all patterns */
Willy Tarreauae8b7962007-06-09 23:10:04 +02001454 opaque = 0;
Willy Tarreaua84d3742007-05-07 00:36:48 +02001455 while (**args) {
Willy Tarreauae8b7962007-06-09 23:10:04 +02001456 int ret;
Willy Tarreaua84d3742007-05-07 00:36:48 +02001457 pattern = (struct acl_pattern *)calloc(1, sizeof(*pattern));
Willy Tarreaub7451bb2012-04-27 12:38:15 +02001458 if (!pattern) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001459 memprintf(err, "out of memory when parsing ACL pattern");
Willy Tarreaua84d3742007-05-07 00:36:48 +02001460 goto out_free_expr;
Willy Tarreaub7451bb2012-04-27 12:38:15 +02001461 }
Willy Tarreauc8d7c962007-06-17 08:20:33 +02001462 pattern->flags = patflags;
1463
Willy Tarreauc92ddbc2012-04-27 22:10:57 +02001464 pattern->type = SMP_TYPES; /* unspecified type */
Willy Tarreau7dcb6482012-04-27 17:52:25 +02001465 ret = aclkw->parse(args, pattern, &opaque, err);
1466 if (!ret)
Willy Tarreaua84d3742007-05-07 00:36:48 +02001467 goto out_free_pattern;
Willy Tarreau7dcb6482012-04-27 17:52:25 +02001468
Willy Tarreaua84d3742007-05-07 00:36:48 +02001469 LIST_ADDQ(&expr->patterns, &pattern->list);
Willy Tarreauae8b7962007-06-09 23:10:04 +02001470 args += ret;
Willy Tarreaua84d3742007-05-07 00:36:48 +02001471 }
1472
1473 return expr;
1474
1475 out_free_pattern:
1476 free_pattern(pattern);
1477 out_free_expr:
1478 prune_acl_expr(expr);
1479 free(expr);
1480 out_return:
1481 return NULL;
1482}
1483
Krzysztof Piotr Oledzkia643baf2008-05-29 23:53:44 +02001484/* Purge everything in the acl <acl>, then return <acl>. */
1485struct acl *prune_acl(struct acl *acl) {
1486
1487 struct acl_expr *expr, *exprb;
1488
1489 free(acl->name);
1490
1491 list_for_each_entry_safe(expr, exprb, &acl->expr, list) {
1492 LIST_DEL(&expr->list);
1493 prune_acl_expr(expr);
1494 free(expr);
1495 }
1496
1497 return acl;
1498}
1499
Willy Tarreaua84d3742007-05-07 00:36:48 +02001500/* Parse an ACL with the name starting at <args>[0], and with a list of already
1501 * known ACLs in <acl>. If the ACL was not in the list, it will be added.
Willy Tarreau2a56c5e2010-03-15 16:13:29 +01001502 * A pointer to that ACL is returned. If the ACL has an empty name, then it's
Willy Tarreaub7451bb2012-04-27 12:38:15 +02001503 * an anonymous one and it won't be merged with any other one. If <err> is not
1504 * NULL, it will be filled with an appropriate error. This pointer must be
1505 * freeable or NULL.
Willy Tarreaua84d3742007-05-07 00:36:48 +02001506 *
1507 * args syntax: <aclname> <acl_expr>
1508 */
Willy Tarreaub7451bb2012-04-27 12:38:15 +02001509struct acl *parse_acl(const char **args, struct list *known_acl, char **err)
Willy Tarreaua84d3742007-05-07 00:36:48 +02001510{
1511 __label__ out_return, out_free_acl_expr, out_free_name;
1512 struct acl *cur_acl;
1513 struct acl_expr *acl_expr;
1514 char *name;
Willy Tarreaub7451bb2012-04-27 12:38:15 +02001515 const char *pos;
Willy Tarreaua84d3742007-05-07 00:36:48 +02001516
Willy Tarreaub7451bb2012-04-27 12:38:15 +02001517 if (**args && (pos = invalid_char(*args))) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001518 memprintf(err, "invalid character in ACL name : '%c'", *pos);
Willy Tarreau2e74c3f2007-12-02 18:45:09 +01001519 goto out_return;
Willy Tarreaub7451bb2012-04-27 12:38:15 +02001520 }
Willy Tarreau2e74c3f2007-12-02 18:45:09 +01001521
Willy Tarreaub7451bb2012-04-27 12:38:15 +02001522 acl_expr = parse_acl_expr(args + 1, err);
1523 if (!acl_expr) {
1524 /* parse_acl_expr will have filled <err> here */
Willy Tarreaua84d3742007-05-07 00:36:48 +02001525 goto out_return;
Willy Tarreaub7451bb2012-04-27 12:38:15 +02001526 }
Willy Tarreaua84d3742007-05-07 00:36:48 +02001527
Willy Tarreau404e8ab2009-07-26 19:40:40 +02001528 /* Check for args beginning with an opening parenthesis just after the
1529 * subject, as this is almost certainly a typo. Right now we can only
1530 * emit a warning, so let's do so.
1531 */
Krzysztof Piotr Oledzki4cdd8312009-10-05 00:23:35 +02001532 if (!strchr(args[1], '(') && *args[2] == '(')
Willy Tarreau404e8ab2009-07-26 19:40:40 +02001533 Warning("parsing acl '%s' :\n"
1534 " matching '%s' for pattern '%s' is likely a mistake and probably\n"
1535 " not what you want. Maybe you need to remove the extraneous space before '('.\n"
1536 " If you are really sure this is not an error, please insert '--' between the\n"
1537 " match and the pattern to make this warning message disappear.\n",
1538 args[0], args[1], args[2]);
1539
Willy Tarreau2a56c5e2010-03-15 16:13:29 +01001540 if (*args[0])
1541 cur_acl = find_acl_by_name(args[0], known_acl);
1542 else
1543 cur_acl = NULL;
1544
Willy Tarreaua84d3742007-05-07 00:36:48 +02001545 if (!cur_acl) {
1546 name = strdup(args[0]);
Willy Tarreaub7451bb2012-04-27 12:38:15 +02001547 if (!name) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001548 memprintf(err, "out of memory when parsing ACL");
Willy Tarreaua84d3742007-05-07 00:36:48 +02001549 goto out_free_acl_expr;
Willy Tarreaub7451bb2012-04-27 12:38:15 +02001550 }
Willy Tarreaua84d3742007-05-07 00:36:48 +02001551 cur_acl = (struct acl *)calloc(1, sizeof(*cur_acl));
Willy Tarreaub7451bb2012-04-27 12:38:15 +02001552 if (cur_acl == NULL) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001553 memprintf(err, "out of memory when parsing ACL");
Willy Tarreaua84d3742007-05-07 00:36:48 +02001554 goto out_free_name;
Willy Tarreaub7451bb2012-04-27 12:38:15 +02001555 }
Willy Tarreaua84d3742007-05-07 00:36:48 +02001556
1557 LIST_INIT(&cur_acl->expr);
1558 LIST_ADDQ(known_acl, &cur_acl->list);
1559 cur_acl->name = name;
1560 }
1561
Willy Tarreaua9802632008-07-25 19:13:19 +02001562 cur_acl->requires |= acl_expr->kw->requires;
Willy Tarreaua84d3742007-05-07 00:36:48 +02001563 LIST_ADDQ(&cur_acl->expr, &acl_expr->list);
1564 return cur_acl;
1565
1566 out_free_name:
1567 free(name);
1568 out_free_acl_expr:
1569 prune_acl_expr(acl_expr);
1570 free(acl_expr);
1571 out_return:
1572 return NULL;
1573}
1574
Willy Tarreau16fbe822007-06-17 11:54:31 +02001575/* Some useful ACLs provided by default. Only those used are allocated. */
1576
1577const struct {
1578 const char *name;
1579 const char *expr[4]; /* put enough for longest expression */
1580} default_acl_list[] = {
Willy Tarreau58393e12008-07-20 10:39:22 +02001581 { .name = "TRUE", .expr = {"always_true",""}},
1582 { .name = "FALSE", .expr = {"always_false",""}},
Willy Tarreau16fbe822007-06-17 11:54:31 +02001583 { .name = "LOCALHOST", .expr = {"src","127.0.0.1/8",""}},
Willy Tarreau2492d5b2009-07-11 00:06:00 +02001584 { .name = "HTTP", .expr = {"req_proto_http",""}},
Willy Tarreau16fbe822007-06-17 11:54:31 +02001585 { .name = "HTTP_1.0", .expr = {"req_ver","1.0",""}},
1586 { .name = "HTTP_1.1", .expr = {"req_ver","1.1",""}},
1587 { .name = "METH_CONNECT", .expr = {"method","CONNECT",""}},
1588 { .name = "METH_GET", .expr = {"method","GET","HEAD",""}},
1589 { .name = "METH_HEAD", .expr = {"method","HEAD",""}},
1590 { .name = "METH_OPTIONS", .expr = {"method","OPTIONS",""}},
1591 { .name = "METH_POST", .expr = {"method","POST",""}},
1592 { .name = "METH_TRACE", .expr = {"method","TRACE",""}},
1593 { .name = "HTTP_URL_ABS", .expr = {"url_reg","^[^/:]*://",""}},
1594 { .name = "HTTP_URL_SLASH", .expr = {"url_beg","/",""}},
1595 { .name = "HTTP_URL_STAR", .expr = {"url","*",""}},
1596 { .name = "HTTP_CONTENT", .expr = {"hdr_val(content-length)","gt","0",""}},
Emeric Brunbede3d02009-06-30 17:54:00 +02001597 { .name = "RDP_COOKIE", .expr = {"req_rdp_cookie_cnt","gt","0",""}},
Willy Tarreauc6317702008-07-20 09:29:50 +02001598 { .name = "REQ_CONTENT", .expr = {"req_len","gt","0",""}},
Willy Tarreaub6fb4202008-07-20 11:18:28 +02001599 { .name = "WAIT_END", .expr = {"wait_end",""}},
Willy Tarreau16fbe822007-06-17 11:54:31 +02001600 { .name = NULL, .expr = {""}}
1601};
1602
1603/* Find a default ACL from the default_acl list, compile it and return it.
1604 * If the ACL is not found, NULL is returned. In theory, it cannot fail,
1605 * except when default ACLs are broken, in which case it will return NULL.
Willy Tarreaub7451bb2012-04-27 12:38:15 +02001606 * If <known_acl> is not NULL, the ACL will be queued at its tail. If <err> is
1607 * not NULL, it will be filled with an error message if an error occurs. This
1608 * pointer must be freeable or NULL.
Willy Tarreau16fbe822007-06-17 11:54:31 +02001609 */
Willy Tarreaub7451bb2012-04-27 12:38:15 +02001610struct acl *find_acl_default(const char *acl_name, struct list *known_acl, char **err)
Willy Tarreau16fbe822007-06-17 11:54:31 +02001611{
1612 __label__ out_return, out_free_acl_expr, out_free_name;
1613 struct acl *cur_acl;
1614 struct acl_expr *acl_expr;
1615 char *name;
1616 int index;
1617
1618 for (index = 0; default_acl_list[index].name != NULL; index++) {
1619 if (strcmp(acl_name, default_acl_list[index].name) == 0)
1620 break;
1621 }
1622
Willy Tarreaub7451bb2012-04-27 12:38:15 +02001623 if (default_acl_list[index].name == NULL) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001624 memprintf(err, "no such ACL : '%s'", acl_name);
Willy Tarreau16fbe822007-06-17 11:54:31 +02001625 return NULL;
Willy Tarreaub7451bb2012-04-27 12:38:15 +02001626 }
Willy Tarreau16fbe822007-06-17 11:54:31 +02001627
Willy Tarreaub7451bb2012-04-27 12:38:15 +02001628 acl_expr = parse_acl_expr((const char **)default_acl_list[index].expr, err);
1629 if (!acl_expr) {
1630 /* parse_acl_expr must have filled err here */
Willy Tarreau16fbe822007-06-17 11:54:31 +02001631 goto out_return;
Willy Tarreaub7451bb2012-04-27 12:38:15 +02001632 }
Willy Tarreau16fbe822007-06-17 11:54:31 +02001633
1634 name = strdup(acl_name);
Willy Tarreaub7451bb2012-04-27 12:38:15 +02001635 if (!name) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001636 memprintf(err, "out of memory when building default ACL '%s'", acl_name);
Willy Tarreau16fbe822007-06-17 11:54:31 +02001637 goto out_free_acl_expr;
Willy Tarreaub7451bb2012-04-27 12:38:15 +02001638 }
1639
Willy Tarreau16fbe822007-06-17 11:54:31 +02001640 cur_acl = (struct acl *)calloc(1, sizeof(*cur_acl));
Willy Tarreaub7451bb2012-04-27 12:38:15 +02001641 if (cur_acl == NULL) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001642 memprintf(err, "out of memory when building default ACL '%s'", acl_name);
Willy Tarreau16fbe822007-06-17 11:54:31 +02001643 goto out_free_name;
Willy Tarreaub7451bb2012-04-27 12:38:15 +02001644 }
Willy Tarreau16fbe822007-06-17 11:54:31 +02001645
1646 cur_acl->name = name;
Willy Tarreaua55b7dc2009-07-12 09:21:30 +02001647 cur_acl->requires |= acl_expr->kw->requires;
Willy Tarreau16fbe822007-06-17 11:54:31 +02001648 LIST_INIT(&cur_acl->expr);
1649 LIST_ADDQ(&cur_acl->expr, &acl_expr->list);
1650 if (known_acl)
1651 LIST_ADDQ(known_acl, &cur_acl->list);
1652
1653 return cur_acl;
1654
1655 out_free_name:
1656 free(name);
1657 out_free_acl_expr:
1658 prune_acl_expr(acl_expr);
1659 free(acl_expr);
1660 out_return:
1661 return NULL;
1662}
Willy Tarreaua84d3742007-05-07 00:36:48 +02001663
1664/* Purge everything in the acl_cond <cond>, then return <cond>. */
1665struct acl_cond *prune_acl_cond(struct acl_cond *cond)
1666{
1667 struct acl_term_suite *suite, *tmp_suite;
1668 struct acl_term *term, *tmp_term;
1669
1670 /* iterate through all term suites and free all terms and all suites */
1671 list_for_each_entry_safe(suite, tmp_suite, &cond->suites, list) {
1672 list_for_each_entry_safe(term, tmp_term, &suite->terms, list)
1673 free(term);
1674 free(suite);
1675 }
1676 return cond;
1677}
1678
1679/* Parse an ACL condition starting at <args>[0], relying on a list of already
1680 * known ACLs passed in <known_acl>. The new condition is returned (or NULL in
Willy Tarreaub7451bb2012-04-27 12:38:15 +02001681 * case of low memory). Supports multiple conditions separated by "or". If
1682 * <err> is not NULL, it will be filled with a pointer to an error message in
1683 * case of error, that the caller is responsible for freeing. The initial
1684 * location must either be freeable or NULL.
Willy Tarreaua84d3742007-05-07 00:36:48 +02001685 */
Willy Tarreaub7451bb2012-04-27 12:38:15 +02001686struct acl_cond *parse_acl_cond(const char **args, struct list *known_acl, int pol, char **err)
Willy Tarreaua84d3742007-05-07 00:36:48 +02001687{
1688 __label__ out_return, out_free_suite, out_free_term;
Willy Tarreau74b98a82007-06-16 19:35:18 +02001689 int arg, neg;
Willy Tarreaua84d3742007-05-07 00:36:48 +02001690 const char *word;
1691 struct acl *cur_acl;
1692 struct acl_term *cur_term;
1693 struct acl_term_suite *cur_suite;
1694 struct acl_cond *cond;
1695
1696 cond = (struct acl_cond *)calloc(1, sizeof(*cond));
Willy Tarreaub7451bb2012-04-27 12:38:15 +02001697 if (cond == NULL) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001698 memprintf(err, "out of memory when parsing condition");
Willy Tarreaua84d3742007-05-07 00:36:48 +02001699 goto out_return;
Willy Tarreaub7451bb2012-04-27 12:38:15 +02001700 }
Willy Tarreaua84d3742007-05-07 00:36:48 +02001701
1702 LIST_INIT(&cond->list);
1703 LIST_INIT(&cond->suites);
1704 cond->pol = pol;
1705
1706 cur_suite = NULL;
Willy Tarreau74b98a82007-06-16 19:35:18 +02001707 neg = 0;
Willy Tarreaua84d3742007-05-07 00:36:48 +02001708 for (arg = 0; *args[arg]; arg++) {
1709 word = args[arg];
1710
1711 /* remove as many exclamation marks as we can */
1712 while (*word == '!') {
1713 neg = !neg;
1714 word++;
1715 }
1716
1717 /* an empty word is allowed because we cannot force the user to
1718 * always think about not leaving exclamation marks alone.
1719 */
1720 if (!*word)
1721 continue;
1722
Willy Tarreau16fbe822007-06-17 11:54:31 +02001723 if (strcasecmp(word, "or") == 0 || strcmp(word, "||") == 0) {
Willy Tarreaua84d3742007-05-07 00:36:48 +02001724 /* new term suite */
1725 cur_suite = NULL;
1726 neg = 0;
1727 continue;
1728 }
1729
Willy Tarreau95fa4692010-02-01 13:05:50 +01001730 if (strcmp(word, "{") == 0) {
1731 /* we may have a complete ACL expression between two braces,
1732 * find the last one.
1733 */
1734 int arg_end = arg + 1;
1735 const char **args_new;
1736
1737 while (*args[arg_end] && strcmp(args[arg_end], "}") != 0)
1738 arg_end++;
1739
Willy Tarreaub7451bb2012-04-27 12:38:15 +02001740 if (!*args[arg_end]) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001741 memprintf(err, "missing closing '}' in condition");
Willy Tarreau95fa4692010-02-01 13:05:50 +01001742 goto out_free_suite;
Willy Tarreaub7451bb2012-04-27 12:38:15 +02001743 }
Willy Tarreau95fa4692010-02-01 13:05:50 +01001744
1745 args_new = calloc(1, (arg_end - arg + 1) * sizeof(*args_new));
Willy Tarreaub7451bb2012-04-27 12:38:15 +02001746 if (!args_new) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001747 memprintf(err, "out of memory when parsing condition");
Willy Tarreau95fa4692010-02-01 13:05:50 +01001748 goto out_free_suite;
Willy Tarreaub7451bb2012-04-27 12:38:15 +02001749 }
Willy Tarreau95fa4692010-02-01 13:05:50 +01001750
Willy Tarreau2a56c5e2010-03-15 16:13:29 +01001751 args_new[0] = "";
Willy Tarreau95fa4692010-02-01 13:05:50 +01001752 memcpy(args_new + 1, args + arg + 1, (arg_end - arg) * sizeof(*args_new));
1753 args_new[arg_end - arg] = "";
Willy Tarreaub7451bb2012-04-27 12:38:15 +02001754 cur_acl = parse_acl(args_new, known_acl, err);
Willy Tarreau95fa4692010-02-01 13:05:50 +01001755 free(args_new);
1756
Willy Tarreaub7451bb2012-04-27 12:38:15 +02001757 if (!cur_acl) {
1758 /* note that parse_acl() must have filled <err> here */
Willy Tarreau16fbe822007-06-17 11:54:31 +02001759 goto out_free_suite;
Willy Tarreaub7451bb2012-04-27 12:38:15 +02001760 }
Willy Tarreau95fa4692010-02-01 13:05:50 +01001761 arg = arg_end;
1762 }
1763 else {
1764 /* search for <word> in the known ACL names. If we do not find
1765 * it, let's look for it in the default ACLs, and if found, add
1766 * it to the list of ACLs of this proxy. This makes it possible
1767 * to override them.
1768 */
1769 cur_acl = find_acl_by_name(word, known_acl);
1770 if (cur_acl == NULL) {
Willy Tarreaub7451bb2012-04-27 12:38:15 +02001771 cur_acl = find_acl_default(word, known_acl, err);
1772 if (cur_acl == NULL) {
1773 /* note that find_acl_default() must have filled <err> here */
Willy Tarreau95fa4692010-02-01 13:05:50 +01001774 goto out_free_suite;
Willy Tarreaub7451bb2012-04-27 12:38:15 +02001775 }
Willy Tarreau95fa4692010-02-01 13:05:50 +01001776 }
Willy Tarreau16fbe822007-06-17 11:54:31 +02001777 }
Willy Tarreaua84d3742007-05-07 00:36:48 +02001778
1779 cur_term = (struct acl_term *)calloc(1, sizeof(*cur_term));
Willy Tarreaub7451bb2012-04-27 12:38:15 +02001780 if (cur_term == NULL) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001781 memprintf(err, "out of memory when parsing condition");
Willy Tarreaua84d3742007-05-07 00:36:48 +02001782 goto out_free_suite;
Willy Tarreaub7451bb2012-04-27 12:38:15 +02001783 }
Willy Tarreaua84d3742007-05-07 00:36:48 +02001784
1785 cur_term->acl = cur_acl;
1786 cur_term->neg = neg;
Willy Tarreaua9802632008-07-25 19:13:19 +02001787 cond->requires |= cur_acl->requires;
Willy Tarreaua84d3742007-05-07 00:36:48 +02001788
1789 if (!cur_suite) {
1790 cur_suite = (struct acl_term_suite *)calloc(1, sizeof(*cur_suite));
Willy Tarreaub7451bb2012-04-27 12:38:15 +02001791 if (cur_term == NULL) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001792 memprintf(err, "out of memory when parsing condition");
Willy Tarreaua84d3742007-05-07 00:36:48 +02001793 goto out_free_term;
Willy Tarreaub7451bb2012-04-27 12:38:15 +02001794 }
Willy Tarreaua84d3742007-05-07 00:36:48 +02001795 LIST_INIT(&cur_suite->terms);
1796 LIST_ADDQ(&cond->suites, &cur_suite->list);
1797 }
1798 LIST_ADDQ(&cur_suite->terms, &cur_term->list);
Willy Tarreau74b98a82007-06-16 19:35:18 +02001799 neg = 0;
Willy Tarreaua84d3742007-05-07 00:36:48 +02001800 }
1801
1802 return cond;
1803
1804 out_free_term:
1805 free(cur_term);
1806 out_free_suite:
1807 prune_acl_cond(cond);
1808 free(cond);
1809 out_return:
1810 return NULL;
1811}
1812
Willy Tarreau2bbba412010-01-28 16:48:33 +01001813/* Builds an ACL condition starting at the if/unless keyword. The complete
1814 * condition is returned. NULL is returned in case of error or if the first
1815 * word is neither "if" nor "unless". It automatically sets the file name and
1816 * the line number in the condition for better error reporting, and adds the
Willy Tarreaub7451bb2012-04-27 12:38:15 +02001817 * ACL requirements to the proxy's acl_requires. If <err> is not NULL, it will
1818 * be filled with a pointer to an error message in case of error, that the
1819 * caller is responsible for freeing. The initial location must either be
1820 * freeable or NULL.
Willy Tarreau2bbba412010-01-28 16:48:33 +01001821 */
Willy Tarreaub7451bb2012-04-27 12:38:15 +02001822struct acl_cond *build_acl_cond(const char *file, int line, struct proxy *px, const char **args, char **err)
Willy Tarreau2bbba412010-01-28 16:48:33 +01001823{
1824 int pol = ACL_COND_NONE;
1825 struct acl_cond *cond = NULL;
1826
Willy Tarreaub7451bb2012-04-27 12:38:15 +02001827 if (err)
1828 *err = NULL;
1829
Willy Tarreau2bbba412010-01-28 16:48:33 +01001830 if (!strcmp(*args, "if")) {
1831 pol = ACL_COND_IF;
1832 args++;
1833 }
1834 else if (!strcmp(*args, "unless")) {
1835 pol = ACL_COND_UNLESS;
1836 args++;
1837 }
Willy Tarreaub7451bb2012-04-27 12:38:15 +02001838 else {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001839 memprintf(err, "conditions must start with either 'if' or 'unless'");
Willy Tarreau2bbba412010-01-28 16:48:33 +01001840 return NULL;
Willy Tarreaub7451bb2012-04-27 12:38:15 +02001841 }
Willy Tarreau2bbba412010-01-28 16:48:33 +01001842
Willy Tarreaub7451bb2012-04-27 12:38:15 +02001843 cond = parse_acl_cond(args, &px->acl, pol, err);
1844 if (!cond) {
1845 /* note that parse_acl_cond must have filled <err> here */
Willy Tarreau2bbba412010-01-28 16:48:33 +01001846 return NULL;
Willy Tarreaub7451bb2012-04-27 12:38:15 +02001847 }
Willy Tarreau2bbba412010-01-28 16:48:33 +01001848
1849 cond->file = file;
1850 cond->line = line;
1851 px->acl_requires |= cond->requires;
1852
1853 return cond;
1854}
1855
Willy Tarreau11382812008-07-09 16:18:21 +02001856/* Execute condition <cond> and return either ACL_PAT_FAIL, ACL_PAT_MISS or
Willy Tarreaub6866442008-07-14 23:54:42 +02001857 * ACL_PAT_PASS depending on the test results. ACL_PAT_MISS may only be
Willy Tarreau32a6f2e2012-04-25 10:13:36 +02001858 * returned if <opt> does not contain SMP_OPT_FINAL, indicating that incomplete
Willy Tarreau7a777ed2012-04-26 11:44:02 +02001859 * data is being examined. The function automatically sets SMP_OPT_ITERATE.
Willy Tarreaub6866442008-07-14 23:54:42 +02001860 * This function only computes the condition, it does not apply the polarity
1861 * required by IF/UNLESS, it's up to the caller to do this using something like
1862 * this :
Willy Tarreau11382812008-07-09 16:18:21 +02001863 *
1864 * res = acl_pass(res);
Willy Tarreaub6866442008-07-14 23:54:42 +02001865 * if (res == ACL_PAT_MISS)
1866 * return 0;
Willy Tarreau11382812008-07-09 16:18:21 +02001867 * if (cond->pol == ACL_COND_UNLESS)
1868 * res = !res;
Willy Tarreaua84d3742007-05-07 00:36:48 +02001869 */
Willy Tarreau32a6f2e2012-04-25 10:13:36 +02001870int acl_exec_cond(struct acl_cond *cond, struct proxy *px, struct session *l4, void *l7, unsigned int opt)
Willy Tarreaua84d3742007-05-07 00:36:48 +02001871{
1872 __label__ fetch_next;
1873 struct acl_term_suite *suite;
1874 struct acl_term *term;
1875 struct acl_expr *expr;
1876 struct acl *acl;
1877 struct acl_pattern *pattern;
Willy Tarreau37406352012-04-23 16:16:37 +02001878 struct sample smp;
Willy Tarreau11382812008-07-09 16:18:21 +02001879 int acl_res, suite_res, cond_res;
Willy Tarreaua84d3742007-05-07 00:36:48 +02001880
Willy Tarreau7a777ed2012-04-26 11:44:02 +02001881 /* ACLs are iterated over all values, so let's always set the flag to
1882 * indicate this to the fetch functions.
1883 */
1884 opt |= SMP_OPT_ITERATE;
1885
Willy Tarreau11382812008-07-09 16:18:21 +02001886 /* We're doing a logical OR between conditions so we initialize to FAIL.
1887 * The MISS status is propagated down from the suites.
1888 */
Willy Tarreaua84d3742007-05-07 00:36:48 +02001889 cond_res = ACL_PAT_FAIL;
1890 list_for_each_entry(suite, &cond->suites, list) {
Willy Tarreau11382812008-07-09 16:18:21 +02001891 /* Evaluate condition suite <suite>. We stop at the first term
1892 * which returns ACL_PAT_FAIL. The MISS status is still propagated
1893 * in case of uncertainty in the result.
Willy Tarreaua84d3742007-05-07 00:36:48 +02001894 */
1895
1896 /* we're doing a logical AND between terms, so we must set the
1897 * initial value to PASS.
1898 */
1899 suite_res = ACL_PAT_PASS;
1900 list_for_each_entry(term, &suite->terms, list) {
1901 acl = term->acl;
1902
1903 /* FIXME: use cache !
1904 * check acl->cache_idx for this.
1905 */
1906
1907 /* ACL result not cached. Let's scan all the expressions
1908 * and use the first one to match.
1909 */
1910 acl_res = ACL_PAT_FAIL;
1911 list_for_each_entry(expr, &acl->expr, list) {
Willy Tarreaud41f8d82007-06-10 10:06:18 +02001912 /* we need to reset context and flags */
Willy Tarreau37406352012-04-23 16:16:37 +02001913 memset(&smp, 0, sizeof(smp));
Willy Tarreaua84d3742007-05-07 00:36:48 +02001914 fetch_next:
Willy Tarreau32a6f2e2012-04-25 10:13:36 +02001915 if (!expr->kw->fetch(px, l4, l7, opt, expr->args, &smp)) {
Willy Tarreaub6866442008-07-14 23:54:42 +02001916 /* maybe we could not fetch because of missing data */
Willy Tarreau32a6f2e2012-04-25 10:13:36 +02001917 if (smp.flags & SMP_F_MAY_CHANGE && !(opt & SMP_OPT_FINAL))
Willy Tarreaub6866442008-07-14 23:54:42 +02001918 acl_res |= ACL_PAT_MISS;
Willy Tarreaua84d3742007-05-07 00:36:48 +02001919 continue;
Willy Tarreaub6866442008-07-14 23:54:42 +02001920 }
Willy Tarreaua84d3742007-05-07 00:36:48 +02001921
Willy Tarreau197e10a2012-04-23 19:18:42 +02001922 if (smp.type == SMP_T_BOOL) {
1923 if (smp.data.uint)
Willy Tarreaua79534f2008-07-20 10:13:37 +02001924 acl_res |= ACL_PAT_PASS;
1925 else
1926 acl_res |= ACL_PAT_FAIL;
1927 }
1928 else {
Willy Tarreau020534d2010-05-16 21:45:45 +02001929 if (!eb_is_empty(&expr->pattern_tree)) {
Willy Tarreauc4262962010-05-10 23:42:40 +02001930 /* a tree is present, let's check what type it is */
1931 if (expr->kw->match == acl_match_str)
Willy Tarreau37406352012-04-23 16:16:37 +02001932 acl_res |= acl_lookup_str(&smp, expr) ? ACL_PAT_PASS : ACL_PAT_FAIL;
Willy Tarreaub337b532010-05-13 20:03:41 +02001933 else if (expr->kw->match == acl_match_ip)
Willy Tarreau37406352012-04-23 16:16:37 +02001934 acl_res |= acl_lookup_ip(&smp, expr) ? ACL_PAT_PASS : ACL_PAT_FAIL;
Willy Tarreauc4262962010-05-10 23:42:40 +02001935 }
1936
Willy Tarreaua79534f2008-07-20 10:13:37 +02001937 /* call the match() function for all tests on this value */
1938 list_for_each_entry(pattern, &expr->patterns, list) {
Willy Tarreaua79534f2008-07-20 10:13:37 +02001939 if (acl_res == ACL_PAT_PASS)
1940 break;
Willy Tarreau37406352012-04-23 16:16:37 +02001941 acl_res |= expr->kw->match(&smp, pattern);
Willy Tarreaua79534f2008-07-20 10:13:37 +02001942 }
Willy Tarreaua84d3742007-05-07 00:36:48 +02001943 }
1944 /*
Willy Tarreau11382812008-07-09 16:18:21 +02001945 * OK now acl_res holds the result of this expression
1946 * as one of ACL_PAT_FAIL, ACL_PAT_MISS or ACL_PAT_PASS.
Willy Tarreaua84d3742007-05-07 00:36:48 +02001947 *
Willy Tarreau11382812008-07-09 16:18:21 +02001948 * Then if (!MISS) we can cache the result, and put
Willy Tarreau37406352012-04-23 16:16:37 +02001949 * (smp.flags & SMP_F_VOLATILE) in the cache flags.
Willy Tarreaua84d3742007-05-07 00:36:48 +02001950 *
1951 * FIXME: implement cache.
1952 *
1953 */
1954
Willy Tarreau11382812008-07-09 16:18:21 +02001955 /* we're ORing these terms, so a single PASS is enough */
1956 if (acl_res == ACL_PAT_PASS)
Willy Tarreaua84d3742007-05-07 00:36:48 +02001957 break;
1958
Willy Tarreau37406352012-04-23 16:16:37 +02001959 if (smp.flags & SMP_F_NOT_LAST)
Willy Tarreaua84d3742007-05-07 00:36:48 +02001960 goto fetch_next;
Willy Tarreaub6866442008-07-14 23:54:42 +02001961
1962 /* sometimes we know the fetched data is subject to change
1963 * later and give another chance for a new match (eg: request
1964 * size, time, ...)
1965 */
Willy Tarreau32a6f2e2012-04-25 10:13:36 +02001966 if (smp.flags & SMP_F_MAY_CHANGE && !(opt & SMP_OPT_FINAL))
Willy Tarreaub6866442008-07-14 23:54:42 +02001967 acl_res |= ACL_PAT_MISS;
Willy Tarreaua84d3742007-05-07 00:36:48 +02001968 }
1969 /*
1970 * Here we have the result of an ACL (cached or not).
1971 * ACLs are combined, negated or not, to form conditions.
1972 */
1973
Willy Tarreaua84d3742007-05-07 00:36:48 +02001974 if (term->neg)
Willy Tarreau11382812008-07-09 16:18:21 +02001975 acl_res = acl_neg(acl_res);
Willy Tarreaua84d3742007-05-07 00:36:48 +02001976
1977 suite_res &= acl_res;
Willy Tarreau11382812008-07-09 16:18:21 +02001978
1979 /* we're ANDing these terms, so a single FAIL is enough */
1980 if (suite_res == ACL_PAT_FAIL)
Willy Tarreaua84d3742007-05-07 00:36:48 +02001981 break;
1982 }
1983 cond_res |= suite_res;
Willy Tarreau11382812008-07-09 16:18:21 +02001984
1985 /* we're ORing these terms, so a single PASS is enough */
1986 if (cond_res == ACL_PAT_PASS)
Willy Tarreaua84d3742007-05-07 00:36:48 +02001987 break;
1988 }
Willy Tarreau11382812008-07-09 16:18:21 +02001989 return cond_res;
Willy Tarreaua84d3742007-05-07 00:36:48 +02001990}
1991
1992
Willy Tarreaudd64f8d2008-07-27 22:02:32 +02001993/* Reports a pointer to the first ACL used in condition <cond> which requires
1994 * at least one of the USE_FLAGS in <require>. Returns NULL if none matches.
1995 * The construct is almost the same as for acl_exec_cond() since we're walking
1996 * down the ACL tree as well. It is important that the tree is really walked
1997 * through and never cached, because that way, this function can be used as a
1998 * late check.
1999 */
Willy Tarreauf1e98b82010-01-28 17:59:39 +01002000struct acl *cond_find_require(const struct acl_cond *cond, unsigned int require)
Willy Tarreaudd64f8d2008-07-27 22:02:32 +02002001{
2002 struct acl_term_suite *suite;
2003 struct acl_term *term;
2004 struct acl *acl;
2005
2006 list_for_each_entry(suite, &cond->suites, list) {
2007 list_for_each_entry(term, &suite->terms, list) {
2008 acl = term->acl;
2009 if (acl->requires & require)
2010 return acl;
2011 }
2012 }
2013 return NULL;
2014}
2015
Krzysztof Piotr Oledzkif9423ae2010-01-29 19:26:18 +01002016/*
2017 * Find targets for userlist and groups in acl. Function returns the number
2018 * of errors or OK if everything is fine.
2019 */
2020int
2021acl_find_targets(struct proxy *p)
2022{
2023
2024 struct acl *acl;
2025 struct acl_expr *expr;
2026 struct acl_pattern *pattern;
2027 struct userlist *ul;
Willy Tarreau63364ee2012-04-19 19:11:13 +02002028 struct arg *arg;
Krzysztof Piotr Oledzkif9423ae2010-01-29 19:26:18 +01002029 int cfgerr = 0;
2030
2031 list_for_each_entry(acl, &p->acl, list) {
2032 list_for_each_entry(expr, &acl->expr, list) {
Willy Tarreau63364ee2012-04-19 19:11:13 +02002033 for (arg = expr->args; arg; arg++) {
2034 if (arg->type == ARGT_STOP)
2035 break;
Willy Tarreau496aa012012-06-01 10:38:29 +02002036 else if (!arg->unresolved)
2037 continue;
Willy Tarreau63364ee2012-04-19 19:11:13 +02002038 else if (arg->type == ARGT_SRV) {
2039 struct proxy *px;
2040 struct server *srv;
2041 char *pname, *sname;
Willy Tarreau0b1cd942010-05-16 22:18:27 +02002042
Willy Tarreau63364ee2012-04-19 19:11:13 +02002043 if (!expr->args->data.str.len) {
2044 Alert("proxy %s: acl '%s' %s(): missing server name.\n",
2045 p->id, acl->name, expr->kw->kw);
2046 cfgerr++;
2047 continue;
2048 }
Willy Tarreau0b1cd942010-05-16 22:18:27 +02002049
Willy Tarreau63364ee2012-04-19 19:11:13 +02002050 pname = expr->args->data.str.str;
2051 sname = strrchr(pname, '/');
Willy Tarreau0b1cd942010-05-16 22:18:27 +02002052
Willy Tarreau63364ee2012-04-19 19:11:13 +02002053 if (sname)
2054 *sname++ = '\0';
2055 else {
2056 sname = pname;
2057 pname = NULL;
2058 }
2059
2060 px = p;
2061 if (pname) {
2062 px = findproxy(pname, PR_CAP_BE);
2063 if (!px) {
2064 Alert("proxy %s: acl '%s' %s(): unable to find proxy '%s'.\n",
2065 p->id, acl->name, expr->kw->kw, pname);
2066 cfgerr++;
2067 continue;
2068 }
2069 }
Willy Tarreau0b1cd942010-05-16 22:18:27 +02002070
Willy Tarreau63364ee2012-04-19 19:11:13 +02002071 srv = findserver(px, sname);
2072 if (!srv) {
2073 Alert("proxy %s: acl '%s' %s(): unable to find server '%s'.\n",
2074 p->id, acl->name, expr->kw->kw, sname);
Willy Tarreau0b1cd942010-05-16 22:18:27 +02002075 cfgerr++;
2076 continue;
2077 }
Willy Tarreau0b1cd942010-05-16 22:18:27 +02002078
Willy Tarreau63364ee2012-04-19 19:11:13 +02002079 free(expr->args->data.str.str);
Willy Tarreau496aa012012-06-01 10:38:29 +02002080 expr->args->data.str.str = NULL;
2081 arg->unresolved = 0;
Willy Tarreau63364ee2012-04-19 19:11:13 +02002082 expr->args->data.srv = srv;
Willy Tarreaud28c3532012-04-19 19:28:33 +02002083 }
2084 else if (arg->type == ARGT_FE) {
Willy Tarreaufc2c1fd2012-04-19 23:35:54 +02002085 struct proxy *prx = p;
2086 char *pname = p->id;
Willy Tarreaud28c3532012-04-19 19:28:33 +02002087
Willy Tarreaufc2c1fd2012-04-19 23:35:54 +02002088 if (expr->args->data.str.len) {
2089 pname = expr->args->data.str.str;
2090 prx = findproxy(pname, PR_CAP_FE);
Willy Tarreaud28c3532012-04-19 19:28:33 +02002091 }
2092
Willy Tarreaud28c3532012-04-19 19:28:33 +02002093 if (!prx) {
2094 Alert("proxy %s: acl '%s' %s(): unable to find frontend '%s'.\n",
2095 p->id, acl->name, expr->kw->kw, pname);
2096 cfgerr++;
2097 continue;
2098 }
2099
Willy Tarreaufc2c1fd2012-04-19 23:35:54 +02002100 if (!(prx->cap & PR_CAP_FE)) {
2101 Alert("proxy %s: acl '%s' %s(): proxy '%s' has no frontend capability.\n",
2102 p->id, acl->name, expr->kw->kw, pname);
2103 cfgerr++;
2104 continue;
2105 }
2106
Willy Tarreaud28c3532012-04-19 19:28:33 +02002107 free(expr->args->data.str.str);
Willy Tarreau496aa012012-06-01 10:38:29 +02002108 expr->args->data.str.str = NULL;
2109 arg->unresolved = 0;
Willy Tarreaud28c3532012-04-19 19:28:33 +02002110 expr->args->data.prx = prx;
2111 }
2112 else if (arg->type == ARGT_BE) {
Willy Tarreaufc2c1fd2012-04-19 23:35:54 +02002113 struct proxy *prx = p;
2114 char *pname = p->id;
Willy Tarreaud28c3532012-04-19 19:28:33 +02002115
Willy Tarreaufc2c1fd2012-04-19 23:35:54 +02002116 if (expr->args->data.str.len) {
2117 pname = expr->args->data.str.str;
2118 prx = findproxy(pname, PR_CAP_BE);
Willy Tarreaud28c3532012-04-19 19:28:33 +02002119 }
2120
Willy Tarreaud28c3532012-04-19 19:28:33 +02002121 if (!prx) {
2122 Alert("proxy %s: acl '%s' %s(): unable to find backend '%s'.\n",
2123 p->id, acl->name, expr->kw->kw, pname);
2124 cfgerr++;
2125 continue;
2126 }
2127
Willy Tarreaufc2c1fd2012-04-19 23:35:54 +02002128 if (!(prx->cap & PR_CAP_BE)) {
2129 Alert("proxy %s: acl '%s' %s(): proxy '%s' has no backend capability.\n",
2130 p->id, acl->name, expr->kw->kw, pname);
2131 cfgerr++;
2132 continue;
2133 }
2134
Willy Tarreaud28c3532012-04-19 19:28:33 +02002135 free(expr->args->data.str.str);
Willy Tarreau496aa012012-06-01 10:38:29 +02002136 expr->args->data.str.str = NULL;
2137 arg->unresolved = 0;
Willy Tarreaud28c3532012-04-19 19:28:33 +02002138 expr->args->data.prx = prx;
2139 }
2140 else if (arg->type == ARGT_TAB) {
Willy Tarreaufc2c1fd2012-04-19 23:35:54 +02002141 struct proxy *prx = p;
2142 char *pname = p->id;
Willy Tarreaud28c3532012-04-19 19:28:33 +02002143
Willy Tarreaufc2c1fd2012-04-19 23:35:54 +02002144 if (expr->args->data.str.len) {
2145 pname = expr->args->data.str.str;
2146 prx = find_stktable(pname);
Willy Tarreaud28c3532012-04-19 19:28:33 +02002147 }
2148
Willy Tarreaud28c3532012-04-19 19:28:33 +02002149 if (!prx) {
2150 Alert("proxy %s: acl '%s' %s(): unable to find table '%s'.\n",
2151 p->id, acl->name, expr->kw->kw, pname);
2152 cfgerr++;
2153 continue;
2154 }
2155
Willy Tarreaufc2c1fd2012-04-19 23:35:54 +02002156
2157 if (!prx->table.size) {
2158 Alert("proxy %s: acl '%s' %s(): no table in proxy '%s'.\n",
2159 p->id, acl->name, expr->kw->kw, pname);
2160 cfgerr++;
2161 continue;
2162 }
2163
Willy Tarreaud28c3532012-04-19 19:28:33 +02002164 free(expr->args->data.str.str);
Willy Tarreau496aa012012-06-01 10:38:29 +02002165 expr->args->data.str.str = NULL;
2166 arg->unresolved = 0;
Willy Tarreaud28c3532012-04-19 19:28:33 +02002167 expr->args->data.prx = prx;
Willy Tarreau0b1cd942010-05-16 22:18:27 +02002168 }
Willy Tarreau63364ee2012-04-19 19:11:13 +02002169 else if (arg->type == ARGT_USR) {
2170 if (!expr->args->data.str.len) {
2171 Alert("proxy %s: acl '%s' %s(): missing userlist name.\n",
2172 p->id, acl->name, expr->kw->kw);
2173 cfgerr++;
2174 continue;
2175 }
Krzysztof Piotr Oledzkif9423ae2010-01-29 19:26:18 +01002176
Willy Tarreau63364ee2012-04-19 19:11:13 +02002177 if (p->uri_auth && p->uri_auth->userlist &&
2178 !strcmp(p->uri_auth->userlist->name, expr->args->data.str.str))
2179 ul = p->uri_auth->userlist;
2180 else
2181 ul = auth_find_userlist(expr->args->data.str.str);
Krzysztof Piotr Oledzkif9423ae2010-01-29 19:26:18 +01002182
Willy Tarreau63364ee2012-04-19 19:11:13 +02002183 if (!ul) {
2184 Alert("proxy %s: acl '%s' %s(%s): unable to find userlist.\n",
2185 p->id, acl->name, expr->kw->kw, expr->args->data.str.str);
2186 cfgerr++;
2187 continue;
2188 }
Krzysztof Piotr Oledzkif9423ae2010-01-29 19:26:18 +01002189
Willy Tarreau63364ee2012-04-19 19:11:13 +02002190 free(expr->args->data.str.str);
Willy Tarreau496aa012012-06-01 10:38:29 +02002191 expr->args->data.str.str = NULL;
2192 arg->unresolved = 0;
Willy Tarreau63364ee2012-04-19 19:11:13 +02002193 expr->args->data.usr = ul;
Krzysztof Piotr Oledzkif9423ae2010-01-29 19:26:18 +01002194 }
Willy Tarreau63364ee2012-04-19 19:11:13 +02002195 } /* end of args processing */
Krzysztof Piotr Oledzkif9423ae2010-01-29 19:26:18 +01002196
Willy Tarreau46b39d02012-05-10 23:40:14 +02002197 /* don't try to resolve groups if we're not certain of having
2198 * resolved userlists first.
2199 */
2200 if (cfgerr)
2201 break;
Krzysztof Piotr Oledzkif9423ae2010-01-29 19:26:18 +01002202
2203 if (!strcmp(expr->kw->kw, "http_auth_group")) {
Willy Tarreau63364ee2012-04-19 19:11:13 +02002204 /* note: argument resolved above thanks to ARGT_USR */
Krzysztof Piotr Oledzkif9423ae2010-01-29 19:26:18 +01002205
2206 if (LIST_ISEMPTY(&expr->patterns)) {
2207 Alert("proxy %s: acl %s %s(): no groups specified.\n",
2208 p->id, acl->name, expr->kw->kw);
2209 cfgerr++;
2210 continue;
2211 }
2212
2213 list_for_each_entry(pattern, &expr->patterns, list) {
Willy Tarreau34db1082012-04-19 17:16:54 +02002214 pattern->val.group_mask = auth_resolve_groups(expr->args->data.usr, pattern->ptr.str);
Krzysztof Piotr Oledzkif9423ae2010-01-29 19:26:18 +01002215
2216 free(pattern->ptr.str);
2217 pattern->ptr.str = NULL;
2218 pattern->len = 0;
2219
2220 if (!pattern->val.group_mask) {
2221 Alert("proxy %s: acl %s %s(): invalid group(s).\n",
2222 p->id, acl->name, expr->kw->kw);
2223 cfgerr++;
2224 continue;
2225 }
2226 }
2227 }
2228 }
2229 }
2230
2231 return cfgerr;
2232}
Willy Tarreaudd64f8d2008-07-27 22:02:32 +02002233
Willy Tarreaua84d3742007-05-07 00:36:48 +02002234/************************************************************************/
2235/* All supported keywords must be declared here. */
2236/************************************************************************/
2237
Willy Tarreau61612d42012-04-19 18:42:05 +02002238/* Note: must not be declared <const> as its list will be overwritten.
2239 * Please take care of keeping this list alphabetically sorted.
2240 */
Willy Tarreaua84d3742007-05-07 00:36:48 +02002241static struct acl_kw_list acl_kws = {{ },{
Willy Tarreau61612d42012-04-19 18:42:05 +02002242 { "always_false", acl_parse_nothing, acl_fetch_false, acl_match_nothing, ACL_USE_NOTHING, 0 },
2243 { "always_true", acl_parse_nothing, acl_fetch_true, acl_match_nothing, ACL_USE_NOTHING, 0 },
2244 { "rep_ssl_hello_type", acl_parse_int, acl_fetch_ssl_hello_type, acl_match_int, ACL_USE_L6RTR_VOLATILE, 0 },
2245 { "req_len", acl_parse_int, acl_fetch_req_len, acl_match_int, ACL_USE_L6REQ_VOLATILE, 0 },
Willy Tarreau61612d42012-04-19 18:42:05 +02002246 { "req_ssl_hello_type", acl_parse_int, acl_fetch_ssl_hello_type, acl_match_int, ACL_USE_L6REQ_VOLATILE, 0 },
2247 { "req_ssl_sni", acl_parse_str, acl_fetch_ssl_hello_sni, acl_match_str, ACL_USE_L6REQ_VOLATILE|ACL_MAY_LOOKUP, 0 },
2248 { "req_ssl_ver", acl_parse_dotted_ver, acl_fetch_req_ssl_ver, acl_match_int, ACL_USE_L6REQ_VOLATILE, 0 },
2249 { "wait_end", acl_parse_nothing, acl_fetch_wait_end, acl_match_nothing, ACL_USE_NOTHING, 0 },
Willy Tarreaua84d3742007-05-07 00:36:48 +02002250 { NULL, NULL, NULL, NULL }
2251}};
2252
2253
2254__attribute__((constructor))
2255static void __acl_init(void)
2256{
2257 acl_register_keywords(&acl_kws);
2258}
2259
2260
2261/*
2262 * Local variables:
2263 * c-indent-level: 8
2264 * c-basic-offset: 8
2265 * End:
2266 */