blob: 2b0de0c21c34487024f5828cae70adf7634745fb [file] [log] [blame]
Willy Tarreaua84d3742007-05-07 00:36:48 +02001/*
Willy Tarreau88922352009-10-04 22:02:50 +02002 * include/types/acl.h
3 * This file provides structures and types for ACLs.
4 *
Willy Tarreau34db1082012-04-19 17:16:54 +02005 * Copyright (C) 2000-2012 Willy Tarreau - w@1wt.eu
Willy Tarreau88922352009-10-04 22:02:50 +02006 *
7 * This library is free software; you can redistribute it and/or
8 * modify it under the terms of the GNU Lesser General Public
9 * License as published by the Free Software Foundation, version 2.1
10 * exclusively.
11 *
12 * This library is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 * Lesser General Public License for more details.
16 *
17 * You should have received a copy of the GNU Lesser General Public
18 * License along with this library; if not, write to the Free Software
19 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
20 */
Willy Tarreaua84d3742007-05-07 00:36:48 +020021
22#ifndef _TYPES_ACL_H
23#define _TYPES_ACL_H
24
25#include <common/compat.h>
26#include <common/config.h>
27#include <common/mini-clist.h>
28
Willy Tarreau34db1082012-04-19 17:16:54 +020029#include <types/arg.h>
Krzysztof Piotr Oledzkif9423ae2010-01-29 19:26:18 +010030#include <types/auth.h>
Willy Tarreaua84d3742007-05-07 00:36:48 +020031#include <types/proxy.h>
Willy Tarreaucd3b0942012-04-27 21:52:18 +020032#include <types/sample.h>
Willy Tarreau0b1cd942010-05-16 22:18:27 +020033#include <types/server.h>
Willy Tarreaua84d3742007-05-07 00:36:48 +020034#include <types/session.h>
35
Willy Tarreau438b0f32010-05-10 22:29:06 +020036#include <ebmbtree.h>
Willy Tarreaua84d3742007-05-07 00:36:48 +020037
Willy Tarreau11382812008-07-09 16:18:21 +020038/* Pattern matching function result.
39 *
40 * We're using a 3-state matching system :
41 * - PASS : at least one pattern already matches
42 * - MISS : some data is missing to decide if some rules may finally match.
43 * - FAIL : no mattern may ever match
44 *
45 * We assign values 0, 1 and 3 to FAIL, MISS and PASS respectively, so that we
46 * can make use of standard arithmetics for the truth tables below :
47 *
48 * x | !x x&y | F(0) | M(1) | P(3) x|y | F(0) | M(1) | P(3)
49 * ------+----- -----+------+------+----- -----+------+------+-----
50 * F(0) | P(3) F(0)| F(0) | F(0) | F(0) F(0)| F(0) | M(1) | P(3)
51 * M(1) | M(1) M(1)| F(0) | M(1) | M(1) M(1)| M(1) | M(1) | P(3)
52 * P(3) | F(0) P(3)| F(0) | M(1) | P(3) P(3)| P(3) | P(3) | P(3)
53 *
54 * neg(x) = (3 >> x) and(x,y) = (x & y) or(x,y) = (x | y)
55 *
56 */
57
Willy Tarreaua84d3742007-05-07 00:36:48 +020058enum {
59 ACL_PAT_FAIL = 0, /* test failed */
Willy Tarreau11382812008-07-09 16:18:21 +020060 ACL_PAT_MISS = 1, /* test may pass with more info */
61 ACL_PAT_PASS = 3, /* test passed */
Willy Tarreaua84d3742007-05-07 00:36:48 +020062};
63
64/* Condition polarity. It makes it easier for any option to choose between
65 * IF/UNLESS if it can store that information within the condition itself.
Willy Tarreau11382812008-07-09 16:18:21 +020066 * Those should be interpreted as "IF/UNLESS result == PASS".
Willy Tarreaua84d3742007-05-07 00:36:48 +020067 */
68enum {
69 ACL_COND_NONE, /* no polarity set yet */
70 ACL_COND_IF, /* positive condition (after 'if') */
71 ACL_COND_UNLESS, /* negative condition (after 'unless') */
72};
73
Willy Tarreauc8d7c962007-06-17 08:20:33 +020074/* possible flags for expressions or patterns */
75enum {
76 ACL_PAT_F_IGNORE_CASE = 1 << 0, /* ignore case */
77 ACL_PAT_F_FROM_FILE = 1 << 1, /* pattern comes from a file */
Willy Tarreau438b0f32010-05-10 22:29:06 +020078 ACL_PAT_F_TREE_OK = 1 << 2, /* the pattern parser is allowed to build a tree */
79 ACL_PAT_F_TREE = 1 << 3, /* some patterns are arranged in a tree */
Willy Tarreauc8d7c962007-06-17 08:20:33 +020080};
81
Willy Tarreaua9802632008-07-25 19:13:19 +020082/* what capabilities an ACL uses. These flags are set during parsing, which
83 * allows for flexible ACLs typed by their contents.
84 */
85enum {
Willy Tarreau0ceba5a2008-07-25 19:31:03 +020086 ACL_USE_NOTHING = 0, /* no need for anything beyond internal information */
Willy Tarreaua9802632008-07-25 19:13:19 +020087 ACL_USE_TCP4_PERMANENT = 1 << 0, /* unchanged TCPv4 data (eg: source IP) */
88 ACL_USE_TCP4_CACHEABLE = 1 << 1, /* cacheable TCPv4 data (eg: src conns) */
89 ACL_USE_TCP4_VOLATILE = 1 << 2, /* volatile TCPv4 data (eg: RTT) */
90 ACL_USE_TCP4_ANY = (ACL_USE_TCP4_PERMANENT | ACL_USE_TCP4_CACHEABLE | ACL_USE_TCP4_VOLATILE),
91
92 ACL_USE_TCP6_PERMANENT = 1 << 3, /* unchanged TCPv6 data (eg: source IP) */
93 ACL_USE_TCP6_CACHEABLE = 1 << 4, /* cacheable TCPv6 data (eg: src conns) */
94 ACL_USE_TCP6_VOLATILE = 1 << 5, /* volatile TCPv6 data (eg: RTT) */
95 ACL_USE_TCP6_ANY = (ACL_USE_TCP6_PERMANENT | ACL_USE_TCP6_CACHEABLE | ACL_USE_TCP6_VOLATILE),
96
97 ACL_USE_TCP_PERMANENT = 1 << 6, /* unchanged TCPv4/v6 data (eg: source IP) */
98 ACL_USE_TCP_CACHEABLE = 1 << 7, /* cacheable TCPv4/v6 data (eg: src conns) */
99 ACL_USE_TCP_VOLATILE = 1 << 8, /* volatile TCPv4/v6 data (eg: RTT) */
100 ACL_USE_TCP_ANY = (ACL_USE_TCP_PERMANENT | ACL_USE_TCP_CACHEABLE | ACL_USE_TCP_VOLATILE),
101
Willy Tarreau06457872010-05-23 12:24:38 +0200102 ACL_USE_L6REQ_PERMANENT = 1 << 9, /* unchanged layer6 request data */
103 ACL_USE_L6REQ_CACHEABLE = 1 << 10, /* cacheable layer6 request data (eg: length) */
104 ACL_USE_L6REQ_VOLATILE = 1 << 11, /* volatile layer6 request data (eg: contents) */
105 ACL_USE_L6REQ_ANY = (ACL_USE_L6REQ_PERMANENT | ACL_USE_L6REQ_CACHEABLE | ACL_USE_L6REQ_VOLATILE),
Willy Tarreaua9802632008-07-25 19:13:19 +0200106
Willy Tarreau06457872010-05-23 12:24:38 +0200107 ACL_USE_L6RTR_PERMANENT = 1 << 12, /* unchanged layer6 response data */
108 ACL_USE_L6RTR_CACHEABLE = 1 << 13, /* cacheable layer6 response data (eg: length) */
109 ACL_USE_L6RTR_VOLATILE = 1 << 14, /* volatile layer6 response data (eg: contents) */
110 ACL_USE_L6RTR_ANY = (ACL_USE_L6RTR_PERMANENT | ACL_USE_L6RTR_CACHEABLE | ACL_USE_L6RTR_VOLATILE),
Willy Tarreaua9802632008-07-25 19:13:19 +0200111
112 ACL_USE_L7REQ_PERMANENT = 1 << 15, /* unchanged layer7 request data (eg: method) */
113 ACL_USE_L7REQ_CACHEABLE = 1 << 16, /* cacheable layer7 request data (eg: content-length) */
114 ACL_USE_L7REQ_VOLATILE = 1 << 17, /* volatile layer7 request data (eg: cookie) */
115 ACL_USE_L7REQ_ANY = (ACL_USE_L7REQ_PERMANENT | ACL_USE_L7REQ_CACHEABLE | ACL_USE_L7REQ_VOLATILE),
116
117 ACL_USE_L7RTR_PERMANENT = 1 << 18, /* unchanged layer7 response data (eg: status) */
118 ACL_USE_L7RTR_CACHEABLE = 1 << 19, /* cacheable layer7 response data (eg: content-length) */
119 ACL_USE_L7RTR_VOLATILE = 1 << 20, /* volatile layer7 response data (eg: cookie) */
120 ACL_USE_L7RTR_ANY = (ACL_USE_L7RTR_PERMANENT | ACL_USE_L7RTR_CACHEABLE | ACL_USE_L7RTR_VOLATILE),
121
122 /* those ones are used for ambiguous "hdr_xxx" verbs */
123 ACL_USE_HDR_CACHEABLE = 1 << 21, /* cacheable request or response header (eg: content-length) */
124 ACL_USE_HDR_VOLATILE = 1 << 22, /* volatile request or response header (eg: cookie) */
125 ACL_USE_HDR_ANY = (ACL_USE_HDR_CACHEABLE | ACL_USE_HDR_VOLATILE),
126
Willy Tarreau930bd6b2011-02-23 15:17:24 +0100127 /* This one indicates that we need an internal parameter known in the response only */
128 ACL_USE_RTR_INTERNAL = 1 << 23, /* volatile response information */
129
Willy Tarreaua9802632008-07-25 19:13:19 +0200130 /* information which remains during response */
131 ACL_USE_REQ_PERMANENT = (ACL_USE_TCP4_PERMANENT | ACL_USE_TCP6_PERMANENT | ACL_USE_TCP_PERMANENT |
Willy Tarreau06457872010-05-23 12:24:38 +0200132 ACL_USE_L6REQ_PERMANENT | ACL_USE_L7REQ_PERMANENT),
Willy Tarreaua9802632008-07-25 19:13:19 +0200133 ACL_USE_REQ_CACHEABLE = (ACL_USE_TCP4_CACHEABLE | ACL_USE_TCP6_CACHEABLE | ACL_USE_TCP_CACHEABLE |
Willy Tarreau06457872010-05-23 12:24:38 +0200134 ACL_USE_L6REQ_CACHEABLE | ACL_USE_L7REQ_CACHEABLE | ACL_USE_HDR_CACHEABLE),
Willy Tarreaua9802632008-07-25 19:13:19 +0200135
136 /* information which does not remain during response */
137 ACL_USE_REQ_VOLATILE = (ACL_USE_TCP4_VOLATILE | ACL_USE_TCP6_VOLATILE | ACL_USE_TCP_VOLATILE |
Willy Tarreau06457872010-05-23 12:24:38 +0200138 ACL_USE_L6REQ_VOLATILE | ACL_USE_L7REQ_VOLATILE),
Willy Tarreaua9802632008-07-25 19:13:19 +0200139
Willy Tarreau06457872010-05-23 12:24:38 +0200140 /* any type of layer 6 contents information (random data available in a buffer) */
141 ACL_USE_L6_ANY = (ACL_USE_L6REQ_ANY | ACL_USE_L6RTR_ANY),
Willy Tarreaua9802632008-07-25 19:13:19 +0200142
143 /* any type of layer 7 information */
144 ACL_USE_L7_ANY = (ACL_USE_L7REQ_ANY | ACL_USE_L7RTR_ANY | ACL_USE_HDR_ANY),
145
146 /* any type of response information */
Willy Tarreau930bd6b2011-02-23 15:17:24 +0100147 ACL_USE_RTR_ANY = (ACL_USE_L6RTR_ANY | ACL_USE_L7RTR_ANY | ACL_USE_RTR_INTERNAL),
Willy Tarreau438b0f32010-05-10 22:29:06 +0200148
149 /* some flags indicating if a keyword supports exact pattern matching,
150 * so that patterns may be arranged in lookup trees. Let's put those
151 * flags at the end to leave some space for the other ones above.
152 */
153 ACL_MAY_LOOKUP = 1 << 31, /* exact pattern lookup */
Willy Tarreaua9802632008-07-25 19:13:19 +0200154};
155
156/* filtering hooks */
157enum {
158 /* hooks on the request path */
159 ACL_HOOK_REQ_FE_TCP = 0,
160 ACL_HOOK_REQ_FE_TCP_CONTENT,
161 ACL_HOOK_REQ_FE_HTTP_IN,
162 ACL_HOOK_REQ_FE_SWITCH,
163 ACL_HOOK_REQ_BE_TCP_CONTENT,
164 ACL_HOOK_REQ_BE_HTTP_IN,
165 ACL_HOOK_REQ_BE_SWITCH,
166 ACL_HOOK_REQ_FE_HTTP_OUT,
167 ACL_HOOK_REQ_BE_HTTP_OUT,
168 /* hooks on the response path */
169 ACL_HOOK_RTR_BE_TCP_CONTENT,
170 ACL_HOOK_RTR_BE_HTTP_IN,
171 ACL_HOOK_RTR_FE_TCP_CONTENT,
172 ACL_HOOK_RTR_FE_HTTP_IN,
173 ACL_HOOK_RTR_BE_HTTP_OUT,
174 ACL_HOOK_RTR_FE_HTTP_OUT,
175};
176
Willy Tarreaua84d3742007-05-07 00:36:48 +0200177/* How to store a time range and the valid days in 29 bits */
178struct acl_time {
179 int dow:7; /* 1 bit per day of week: 0-6 */
180 int h1:5, m1:6; /* 0..24:0..60. Use 0:0 for all day. */
181 int h2:5, m2:6; /* 0..24:0..60. Use 24:0 for all day. */
182};
183
Willy Tarreauc92ddbc2012-04-27 22:10:57 +0200184/* This describes one ACL pattern, which might be a single value or a tree of
185 * values. All patterns for a single ACL expression are linked together. Some
186 * of them might have a type (eg: IP). Right now, the types are shared with
187 * the samples, though it is possible that in the future this will change to
188 * accommodate for other types (eg: meth, regex). Unsigned and constant types
189 * are preferred when there is a doubt.
190 */
Willy Tarreaua84d3742007-05-07 00:36:48 +0200191struct acl_pattern {
192 struct list list; /* chaining */
Willy Tarreauc92ddbc2012-04-27 22:10:57 +0200193 int type; /* type of the ACL pattern (SMP_T_*) */
Willy Tarreaua84d3742007-05-07 00:36:48 +0200194 union {
195 int i; /* integer value */
Willy Tarreauae8b7962007-06-09 23:10:04 +0200196 struct {
197 signed long long min, max;
198 int min_set :1;
199 int max_set :1;
200 } range; /* integer range */
Willy Tarreaua67fad92007-05-08 19:50:09 +0200201 struct {
202 struct in_addr addr;
203 struct in_addr mask;
204 } ipv4; /* IPv4 address */
Willy Tarreauceb4ac92012-04-28 00:41:46 +0200205 struct {
206 struct in6_addr addr;
207 unsigned char mask; /* number of bits */
208 } ipv6; /* IPv6 address/mask */
Willy Tarreaua84d3742007-05-07 00:36:48 +0200209 struct acl_time time; /* valid hours and days */
Krzysztof Piotr Oledzkif9423ae2010-01-29 19:26:18 +0100210 unsigned int group_mask;
Willy Tarreaue56cda92010-05-11 23:25:05 +0200211 struct eb_root *tree; /* tree storing all values if any */
Willy Tarreaua84d3742007-05-07 00:36:48 +0200212 } val; /* direct value */
213 union {
214 void *ptr; /* any data */
215 char *str; /* any string */
Hiroaki Nakamura70351322013-01-13 15:00:42 +0900216 regex *reg; /* a compiled regex */
Willy Tarreaua84d3742007-05-07 00:36:48 +0200217 } ptr; /* indirect values, allocated */
Krzysztof Piotr Oledzki8001d612008-05-31 13:53:23 +0200218 void(*freeptrbuf)(void *ptr); /* a destructor able to free objects from the ptr */
Willy Tarreaua84d3742007-05-07 00:36:48 +0200219 int len; /* data length when required */
Willy Tarreauc8d7c962007-06-17 08:20:33 +0200220 int flags; /* expr or pattern flags. */
Willy Tarreaua84d3742007-05-07 00:36:48 +0200221};
222
Willy Tarreaua84d3742007-05-07 00:36:48 +0200223/* some dummy declarations to silent the compiler */
224struct proxy;
225struct session;
226
Willy Tarreauae8b7962007-06-09 23:10:04 +0200227/*
Willy Tarreauc92ddbc2012-04-27 22:10:57 +0200228 * ACL keyword: Associates keywords with parsers, methods to retrieve the value and testers.
229 */
230/*
Willy Tarreauae8b7962007-06-09 23:10:04 +0200231 * NOTE:
232 * The 'parse' function is called to parse words in the configuration. It must
233 * return the number of valid words read. 0 = error. The 'opaque' argument may
234 * be used by functions which need to maintain a context between consecutive
235 * values. It is initialized to zero before the first call, and passed along
236 * successive calls.
237 */
238
Willy Tarreau97be1452007-06-10 11:47:14 +0200239struct acl_expr;
Willy Tarreaua84d3742007-05-07 00:36:48 +0200240struct acl_keyword {
241 const char *kw;
Willy Tarreau7dcb6482012-04-27 17:52:25 +0200242 int (*parse)(const char **text, struct acl_pattern *pattern, int *opaque, char **err);
Willy Tarreau32a6f2e2012-04-25 10:13:36 +0200243 int (*fetch)(struct proxy *px, struct session *l4, void *l7, unsigned int opt,
Willy Tarreau24e32d82012-04-23 23:55:44 +0200244 const struct arg *args, struct sample *smp);
Willy Tarreau37406352012-04-23 16:16:37 +0200245 int (*match)(struct sample *smp, struct acl_pattern *pattern);
Willy Tarreaua9802632008-07-25 19:13:19 +0200246 unsigned int requires; /* bit mask of all ACL_USE_* required to evaluate this keyword */
Willy Tarreau61612d42012-04-19 18:42:05 +0200247 int arg_mask; /* mask describing up to 7 arg types */
Willy Tarreauae52f062012-04-26 12:13:35 +0200248 int (*val_args)(struct arg *arg_p, char **err_msg); /* argument validation function */
Willy Tarreau61612d42012-04-19 18:42:05 +0200249 /* must be after the config params */
Willy Tarreaua84d3742007-05-07 00:36:48 +0200250 int use_cnt;
251};
252
253/*
254 * A keyword list. It is a NULL-terminated array of keywords. It embeds a
255 * struct list in order to be linked to other lists, allowing it to easily
256 * be declared where it is needed, and linked without duplicating data nor
257 * allocating memory.
258 */
259struct acl_kw_list {
260 struct list list;
261 struct acl_keyword kw[VAR_ARRAY];
262};
263
264/*
265 * Description of an ACL expression.
266 * It contains a subject and a set of patterns to test against it.
267 * - the function get() is called to retrieve the subject from the
268 * current session or transaction and build a test.
269 * - the function test() is called to evaluate the test based on the
270 * available patterns and return ACL_PAT_*
271 * Both of those functions are available through the keyword.
272 */
273struct acl_expr {
274 struct list list; /* chaining */
275 struct acl_keyword *kw; /* back-reference to the keyword */
Willy Tarreau34db1082012-04-19 17:16:54 +0200276 struct arg *args; /* optional argument list (eg: header or cookie name) */
Willy Tarreaua84d3742007-05-07 00:36:48 +0200277 struct list patterns; /* list of acl_patterns */
Willy Tarreau438b0f32010-05-10 22:29:06 +0200278 struct eb_root pattern_tree; /* may be used for lookup in large datasets */
Willy Tarreaua84d3742007-05-07 00:36:48 +0200279};
280
Willy Tarreauc92ddbc2012-04-27 22:10:57 +0200281/* The acl will be linked to from the proxy where it is declared */
Willy Tarreaua84d3742007-05-07 00:36:48 +0200282struct acl {
283 struct list list; /* chaining */
284 char *name; /* acl name */
285 struct list expr; /* list of acl_exprs */
286 int cache_idx; /* ACL index in cache */
Willy Tarreaua9802632008-07-25 19:13:19 +0200287 unsigned int requires; /* or'ed bit mask of all acl_expr's ACL_USE_* */
Willy Tarreaua84d3742007-05-07 00:36:48 +0200288};
289
290/* the condition will be linked to from an action in a proxy */
291struct acl_term {
292 struct list list; /* chaining */
293 struct acl *acl; /* acl pointed to by this term */
294 int neg; /* 1 if the ACL result must be negated */
295};
296
297struct acl_term_suite {
298 struct list list; /* chaining of term suites */
299 struct list terms; /* list of acl_terms */
300};
301
302struct acl_cond {
303 struct list list; /* Some specific tests may use multiple conditions */
304 struct list suites; /* list of acl_term_suites */
305 int pol; /* polarity: ACL_COND_IF / ACL_COND_UNLESS */
Willy Tarreaua9802632008-07-25 19:13:19 +0200306 unsigned int requires; /* or'ed bit mask of all acl's ACL_USE_* */
Willy Tarreau88922352009-10-04 22:02:50 +0200307 const char *file; /* config file where the condition is declared */
Willy Tarreaua9802632008-07-25 19:13:19 +0200308 int line; /* line in the config file where the condition is declared */
Willy Tarreaua84d3742007-05-07 00:36:48 +0200309};
310
311
312#endif /* _TYPES_ACL_H */
313
314/*
315 * Local variables:
316 * c-indent-level: 8
317 * c-basic-offset: 8
318 * End:
319 */