blob: db76a272419a31077030532cc1c96ee23f2bca3a [file] [log] [blame]
Willy Tarreaua84d3742007-05-07 00:36:48 +02001/*
2 include/types/acl.h
3 This file provides structures and types for ACLs.
4
5 Copyright (C) 2000-2007 Willy Tarreau - w@1wt.eu
6
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*/
21
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
29#include <types/proxy.h>
30#include <types/session.h>
31
32
33/* pattern matching function result */
34enum {
35 ACL_PAT_FAIL = 0, /* test failed */
36 ACL_PAT_PASS = (1 << 0), /* test passed */
37 ACL_PAT_MISS = (1 << 1), /* failed because of missing info (do not cache) */
38};
39
40/* Condition polarity. It makes it easier for any option to choose between
41 * IF/UNLESS if it can store that information within the condition itself.
42 */
43enum {
44 ACL_COND_NONE, /* no polarity set yet */
45 ACL_COND_IF, /* positive condition (after 'if') */
46 ACL_COND_UNLESS, /* negative condition (after 'unless') */
47};
48
49/* possible flags for intermediate test values. The flags are maintained
50 * across consecutive fetches for a same entry (eg: parse all req lines).
51 */
52enum {
53 ACL_TEST_F_READ_ONLY = 1 << 0, /* test data are read-only */
54 ACL_TEST_F_MUST_FREE = 1 << 1, /* test data must be freed after end of evaluation */
55 ACL_TEST_F_VOL_TEST = 1 << 2, /* result must not survive longer than the test (eg: time) */
56 ACL_TEST_F_VOL_HDR = 1 << 3, /* result sensitive to changes in headers */
57 ACL_TEST_F_VOL_1ST = 1 << 4, /* result sensitive to changes in first line (eg: URI) */
58 ACL_TEST_F_VOL_TXN = 1 << 5, /* result sensitive to new transaction (eg: persist) */
59 ACL_TEST_F_VOL_SESS = 1 << 6, /* result sensitive to new session (eg: IP) */
60 ACL_TEST_F_VOLATILE = (1<<2)|(1<<3)|(1<<4)|(1<<5)|(1<<6),
61 ACL_TEST_F_FETCH_MORE = 1 << 7, /* if test does not match, retry with next entry */
62};
63
Willy Tarreaud41f8d82007-06-10 10:06:18 +020064/* ACLs can be evaluated on requests and on responses. */
65enum {
66 ACL_DIR_REQ = 0, /* ACL evaluated on request */
67 ACL_DIR_RTR, /* ACL evaluated on response */
68};
69
Willy Tarreaua84d3742007-05-07 00:36:48 +020070/* How to store a time range and the valid days in 29 bits */
71struct acl_time {
72 int dow:7; /* 1 bit per day of week: 0-6 */
73 int h1:5, m1:6; /* 0..24:0..60. Use 0:0 for all day. */
74 int h2:5, m2:6; /* 0..24:0..60. Use 24:0 for all day. */
75};
76
77/* The acl will be linked to from the proxy where it is declared */
78struct acl_pattern {
79 struct list list; /* chaining */
80 union {
81 int i; /* integer value */
Willy Tarreauae8b7962007-06-09 23:10:04 +020082 struct {
83 signed long long min, max;
84 int min_set :1;
85 int max_set :1;
86 } range; /* integer range */
Willy Tarreaua67fad92007-05-08 19:50:09 +020087 struct {
88 struct in_addr addr;
89 struct in_addr mask;
90 } ipv4; /* IPv4 address */
Willy Tarreaua84d3742007-05-07 00:36:48 +020091 struct acl_time time; /* valid hours and days */
92 } val; /* direct value */
93 union {
94 void *ptr; /* any data */
95 char *str; /* any string */
96 regex_t *reg; /* a compiled regex */
97 } ptr; /* indirect values, allocated */
98 int len; /* data length when required */
99};
100
101/* The structure exchanged between an acl_fetch_* function responsible for
102 * retrieving a value, and an acl_match_* function responsible for testing it.
103 */
104struct acl_test {
Willy Tarreau33a7e692007-06-10 19:45:56 +0200105 int i; /* integer value */
106 char *ptr; /* pointer to beginning of value */
107 int len; /* length of value at ptr, otherwise ignored */
108 int flags; /* ACL_TEST_F_* set to 0 on first call */
109 union { /* fetch_* functions context for any purpose */
110 void *p; /* any pointer */
111 int i; /* any integer */
112 long long ll; /* any long long or smaller */
113 double d; /* any float or double */
114 void *a[8]; /* any array of up to 8 pointers */
Willy Tarreaua84d3742007-05-07 00:36:48 +0200115 } ctx;
116};
117
118
119/*
120 * ACL keyword: Associates keywords with parsers, methods to retrieve the value and testers.
121 */
122
123/* some dummy declarations to silent the compiler */
124struct proxy;
125struct session;
126
Willy Tarreauae8b7962007-06-09 23:10:04 +0200127/*
128 * NOTE:
129 * The 'parse' function is called to parse words in the configuration. It must
130 * return the number of valid words read. 0 = error. The 'opaque' argument may
131 * be used by functions which need to maintain a context between consecutive
132 * values. It is initialized to zero before the first call, and passed along
133 * successive calls.
134 */
135
Willy Tarreau97be1452007-06-10 11:47:14 +0200136struct acl_expr;
Willy Tarreaua84d3742007-05-07 00:36:48 +0200137struct acl_keyword {
138 const char *kw;
Willy Tarreauae8b7962007-06-09 23:10:04 +0200139 int (*parse)(const char **text, struct acl_pattern *pattern, int *opaque);
Willy Tarreau97be1452007-06-10 11:47:14 +0200140 int (*fetch)(struct proxy *px, struct session *l4, void *l7, int dir,
141 struct acl_expr *expr, struct acl_test *test);
Willy Tarreaua84d3742007-05-07 00:36:48 +0200142 int (*match)(struct acl_test *test, struct acl_pattern *pattern);
143 int use_cnt;
144};
145
146/*
147 * A keyword list. It is a NULL-terminated array of keywords. It embeds a
148 * struct list in order to be linked to other lists, allowing it to easily
149 * be declared where it is needed, and linked without duplicating data nor
150 * allocating memory.
151 */
152struct acl_kw_list {
153 struct list list;
154 struct acl_keyword kw[VAR_ARRAY];
155};
156
157/*
158 * Description of an ACL expression.
159 * It contains a subject and a set of patterns to test against it.
160 * - the function get() is called to retrieve the subject from the
161 * current session or transaction and build a test.
162 * - the function test() is called to evaluate the test based on the
163 * available patterns and return ACL_PAT_*
164 * Both of those functions are available through the keyword.
165 */
166struct acl_expr {
167 struct list list; /* chaining */
168 struct acl_keyword *kw; /* back-reference to the keyword */
169 union { /* optional argument of the subject (eg: header or cookie name) */
170 char *str;
171 } arg;
Willy Tarreaubb768912007-06-10 11:17:01 +0200172 int arg_len; /* optional argument length */
Willy Tarreaua84d3742007-05-07 00:36:48 +0200173 struct list patterns; /* list of acl_patterns */
174};
175
176struct acl {
177 struct list list; /* chaining */
178 char *name; /* acl name */
179 struct list expr; /* list of acl_exprs */
180 int cache_idx; /* ACL index in cache */
181};
182
183/* the condition will be linked to from an action in a proxy */
184struct acl_term {
185 struct list list; /* chaining */
186 struct acl *acl; /* acl pointed to by this term */
187 int neg; /* 1 if the ACL result must be negated */
188};
189
190struct acl_term_suite {
191 struct list list; /* chaining of term suites */
192 struct list terms; /* list of acl_terms */
193};
194
195struct acl_cond {
196 struct list list; /* Some specific tests may use multiple conditions */
197 struct list suites; /* list of acl_term_suites */
198 int pol; /* polarity: ACL_COND_IF / ACL_COND_UNLESS */
199};
200
201
202#endif /* _TYPES_ACL_H */
203
204/*
205 * Local variables:
206 * c-indent-level: 8
207 * c-basic-offset: 8
208 * End:
209 */