blob: 02c1258b00670ba2d52d8bd5701a1d8b2cbefff1 [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
64/* How to store a time range and the valid days in 29 bits */
65struct acl_time {
66 int dow:7; /* 1 bit per day of week: 0-6 */
67 int h1:5, m1:6; /* 0..24:0..60. Use 0:0 for all day. */
68 int h2:5, m2:6; /* 0..24:0..60. Use 24:0 for all day. */
69};
70
71/* The acl will be linked to from the proxy where it is declared */
72struct acl_pattern {
73 struct list list; /* chaining */
74 union {
75 int i; /* integer value */
Willy Tarreauae8b7962007-06-09 23:10:04 +020076 struct {
77 signed long long min, max;
78 int min_set :1;
79 int max_set :1;
80 } range; /* integer range */
Willy Tarreaua67fad92007-05-08 19:50:09 +020081 struct {
82 struct in_addr addr;
83 struct in_addr mask;
84 } ipv4; /* IPv4 address */
Willy Tarreaua84d3742007-05-07 00:36:48 +020085 struct acl_time time; /* valid hours and days */
86 } val; /* direct value */
87 union {
88 void *ptr; /* any data */
89 char *str; /* any string */
90 regex_t *reg; /* a compiled regex */
91 } ptr; /* indirect values, allocated */
92 int len; /* data length when required */
93};
94
95/* The structure exchanged between an acl_fetch_* function responsible for
96 * retrieving a value, and an acl_match_* function responsible for testing it.
97 */
98struct acl_test {
99 int i; /* integer value */
100 char *ptr; /* pointer to beginning of value */
101 int len; /* length of value at ptr, otherwise ignored */
102 int flags; /* ACL_TEST_F_* set to 0 on first call */
103 union { /* fetch_* functions context for any purpose */
104 void *p;
105 int i;
106 } ctx;
107};
108
109
110/*
111 * ACL keyword: Associates keywords with parsers, methods to retrieve the value and testers.
112 */
113
114/* some dummy declarations to silent the compiler */
115struct proxy;
116struct session;
117
Willy Tarreauae8b7962007-06-09 23:10:04 +0200118/*
119 * NOTE:
120 * The 'parse' function is called to parse words in the configuration. It must
121 * return the number of valid words read. 0 = error. The 'opaque' argument may
122 * be used by functions which need to maintain a context between consecutive
123 * values. It is initialized to zero before the first call, and passed along
124 * successive calls.
125 */
126
Willy Tarreaua84d3742007-05-07 00:36:48 +0200127struct acl_keyword {
128 const char *kw;
Willy Tarreauae8b7962007-06-09 23:10:04 +0200129 int (*parse)(const char **text, struct acl_pattern *pattern, int *opaque);
Willy Tarreaua84d3742007-05-07 00:36:48 +0200130 int (*fetch)(struct proxy *px, struct session *l4, void *l7, void *arg, struct acl_test *test);
131 int (*match)(struct acl_test *test, struct acl_pattern *pattern);
132 int use_cnt;
133};
134
135/*
136 * A keyword list. It is a NULL-terminated array of keywords. It embeds a
137 * struct list in order to be linked to other lists, allowing it to easily
138 * be declared where it is needed, and linked without duplicating data nor
139 * allocating memory.
140 */
141struct acl_kw_list {
142 struct list list;
143 struct acl_keyword kw[VAR_ARRAY];
144};
145
146/*
147 * Description of an ACL expression.
148 * It contains a subject and a set of patterns to test against it.
149 * - the function get() is called to retrieve the subject from the
150 * current session or transaction and build a test.
151 * - the function test() is called to evaluate the test based on the
152 * available patterns and return ACL_PAT_*
153 * Both of those functions are available through the keyword.
154 */
155struct acl_expr {
156 struct list list; /* chaining */
157 struct acl_keyword *kw; /* back-reference to the keyword */
158 union { /* optional argument of the subject (eg: header or cookie name) */
159 char *str;
160 } arg;
161 struct list patterns; /* list of acl_patterns */
162};
163
164struct acl {
165 struct list list; /* chaining */
166 char *name; /* acl name */
167 struct list expr; /* list of acl_exprs */
168 int cache_idx; /* ACL index in cache */
169};
170
171/* the condition will be linked to from an action in a proxy */
172struct acl_term {
173 struct list list; /* chaining */
174 struct acl *acl; /* acl pointed to by this term */
175 int neg; /* 1 if the ACL result must be negated */
176};
177
178struct acl_term_suite {
179 struct list list; /* chaining of term suites */
180 struct list terms; /* list of acl_terms */
181};
182
183struct acl_cond {
184 struct list list; /* Some specific tests may use multiple conditions */
185 struct list suites; /* list of acl_term_suites */
186 int pol; /* polarity: ACL_COND_IF / ACL_COND_UNLESS */
187};
188
189
190#endif /* _TYPES_ACL_H */
191
192/*
193 * Local variables:
194 * c-indent-level: 8
195 * c-basic-offset: 8
196 * End:
197 */