blob: 7afa3d8707e57c540d4c5c5b7442d65add3bf842 [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
Willy Tarreau4c7e4b72020-05-27 12:58:42 +020025#include <haproxy/api-t.h>
Willy Tarreau853b2972020-05-27 18:01:47 +020026#include <haproxy/list-t.h>
Willy Tarreaua84d3742007-05-07 00:36:48 +020027
Willy Tarreau34db1082012-04-19 17:16:54 +020028#include <types/arg.h>
Krzysztof Piotr Oledzkif9423ae2010-01-29 19:26:18 +010029#include <types/auth.h>
Thierry FOURNIERed66c292013-11-28 11:05:19 +010030#include <types/pattern.h>
Willy Tarreaua84d3742007-05-07 00:36:48 +020031#include <types/proxy.h>
Willy Tarreau0b1cd942010-05-16 22:18:27 +020032#include <types/server.h>
Willy Tarreaua84d3742007-05-07 00:36:48 +020033
Willy Tarreau8d2b7772020-05-27 10:58:19 +020034#include <import/ebmbtree.h>
Willy Tarreaua84d3742007-05-07 00:36:48 +020035
Thierry FOURNIERa65b3432013-11-28 18:22:00 +010036/* ACL test result.
Willy Tarreau11382812008-07-09 16:18:21 +020037 *
38 * We're using a 3-state matching system :
39 * - PASS : at least one pattern already matches
40 * - MISS : some data is missing to decide if some rules may finally match.
41 * - FAIL : no mattern may ever match
42 *
43 * We assign values 0, 1 and 3 to FAIL, MISS and PASS respectively, so that we
Ilya Shipitsind4259502020-04-08 01:07:56 +050044 * can make use of standard arithmetic for the truth tables below :
Willy Tarreau11382812008-07-09 16:18:21 +020045 *
46 * x | !x x&y | F(0) | M(1) | P(3) x|y | F(0) | M(1) | P(3)
47 * ------+----- -----+------+------+----- -----+------+------+-----
48 * F(0) | P(3) F(0)| F(0) | F(0) | F(0) F(0)| F(0) | M(1) | P(3)
49 * M(1) | M(1) M(1)| F(0) | M(1) | M(1) M(1)| M(1) | M(1) | P(3)
50 * P(3) | F(0) P(3)| F(0) | M(1) | P(3) P(3)| P(3) | P(3) | P(3)
51 *
52 * neg(x) = (3 >> x) and(x,y) = (x & y) or(x,y) = (x | y)
53 *
Thierry FOURNIERa65b3432013-11-28 18:22:00 +010054 * For efficiency, the ACL return flags are directly mapped from the pattern
55 * match flags. See include/pattern.h for existing values.
Willy Tarreau11382812008-07-09 16:18:21 +020056 */
Thierry FOURNIERa65b3432013-11-28 18:22:00 +010057enum acl_test_res {
58 ACL_TEST_FAIL = 0, /* test failed */
59 ACL_TEST_MISS = 1, /* test may pass with more info */
60 ACL_TEST_PASS = 3, /* test passed */
61};
Willy Tarreau11382812008-07-09 16:18:21 +020062
Willy Tarreaua84d3742007-05-07 00:36:48 +020063/* Condition polarity. It makes it easier for any option to choose between
64 * IF/UNLESS if it can store that information within the condition itself.
Willy Tarreau11382812008-07-09 16:18:21 +020065 * Those should be interpreted as "IF/UNLESS result == PASS".
Willy Tarreaua84d3742007-05-07 00:36:48 +020066 */
Thierry FOURNIERa65b3432013-11-28 18:22:00 +010067enum acl_cond_pol {
Willy Tarreaua84d3742007-05-07 00:36:48 +020068 ACL_COND_NONE, /* no polarity set yet */
69 ACL_COND_IF, /* positive condition (after 'if') */
70 ACL_COND_UNLESS, /* negative condition (after 'unless') */
71};
72
Willy Tarreaua84d3742007-05-07 00:36:48 +020073/* some dummy declarations to silent the compiler */
74struct proxy;
Willy Tarreau87b09662015-04-03 00:22:06 +020075struct stream;
Willy Tarreaua84d3742007-05-07 00:36:48 +020076
Willy Tarreauae8b7962007-06-09 23:10:04 +020077/*
Willy Tarreauc92ddbc2012-04-27 22:10:57 +020078 * ACL keyword: Associates keywords with parsers, methods to retrieve the value and testers.
79 */
80/*
Willy Tarreauae8b7962007-06-09 23:10:04 +020081 * NOTE:
82 * The 'parse' function is called to parse words in the configuration. It must
83 * return the number of valid words read. 0 = error. The 'opaque' argument may
84 * be used by functions which need to maintain a context between consecutive
85 * values. It is initialized to zero before the first call, and passed along
86 * successive calls.
87 */
88
Willy Tarreau97be1452007-06-10 11:47:14 +020089struct acl_expr;
Willy Tarreaua84d3742007-05-07 00:36:48 +020090struct acl_keyword {
91 const char *kw;
Willy Tarreau8ed669b2013-01-11 15:49:37 +010092 char *fetch_kw;
Thierry FOURNIERc5a4e982014-03-05 16:07:08 +010093 int match_type; /* Contain PAT_MATCH_* */
Thierry FOURNIERe47e4e22014-04-28 11:18:57 +020094 int (*parse)(const char *text, struct pattern *pattern, int flags, char **err);
Thierry FOURNIERb9b08462013-12-13 15:12:32 +010095 int (*index)(struct pattern_expr *expr, struct pattern *pattern, char **err);
Thierry FOURNIER7acca4b2014-01-28 16:43:36 +010096 void (*delete)(struct pattern_expr *expr, struct pat_ref_elt *);
Thierry FOURNIER6f7203d2014-01-14 16:24:51 +010097 void (*prune)(struct pattern_expr *expr);
Thierry FOURNIER5338eea2013-12-16 14:22:13 +010098 struct pattern *(*match)(struct sample *smp, struct pattern_expr *expr, int fill);
Willy Tarreau61612d42012-04-19 18:42:05 +020099 /* must be after the config params */
Willy Tarreau8ed669b2013-01-11 15:49:37 +0100100 struct sample_fetch *smp; /* the sample fetch we depend on */
Willy Tarreaua84d3742007-05-07 00:36:48 +0200101};
102
103/*
104 * A keyword list. It is a NULL-terminated array of keywords. It embeds a
105 * struct list in order to be linked to other lists, allowing it to easily
106 * be declared where it is needed, and linked without duplicating data nor
107 * allocating memory.
108 */
109struct acl_kw_list {
110 struct list list;
111 struct acl_keyword kw[VAR_ARRAY];
112};
113
114/*
115 * Description of an ACL expression.
Willy Tarreaud76a98a2013-03-31 18:34:33 +0200116 * The expression is part of a list. It contains pointers to the keyword, the
Thierry FOURNIERd163e1c2013-11-28 11:41:23 +0100117 * sample fetch descriptor which defaults to the keyword's, and the associated
118 * pattern matching. The structure is organized so that the hot parts are
119 * grouped together in order to optimize caching.
Willy Tarreaua84d3742007-05-07 00:36:48 +0200120 */
121struct acl_expr {
Thierry FOURNIER348971e2013-11-21 10:50:10 +0100122 struct sample_expr *smp; /* the sample expression we depend on */
Thierry FOURNIER1e00d382014-02-11 11:31:40 +0100123 struct pattern_head pat; /* the pattern matching expression */
Willy Tarreaud76a98a2013-03-31 18:34:33 +0200124 struct list list; /* chaining */
Willy Tarreau93fddf12013-03-31 22:59:32 +0200125 const char *kw; /* points to the ACL kw's name or fetch's name (must not free) */
Willy Tarreaua84d3742007-05-07 00:36:48 +0200126};
127
Willy Tarreauc92ddbc2012-04-27 22:10:57 +0200128/* The acl will be linked to from the proxy where it is declared */
Willy Tarreaua84d3742007-05-07 00:36:48 +0200129struct acl {
130 struct list list; /* chaining */
131 char *name; /* acl name */
132 struct list expr; /* list of acl_exprs */
133 int cache_idx; /* ACL index in cache */
Willy Tarreaua91d0a52013-03-25 08:12:18 +0100134 unsigned int use; /* or'ed bit mask of all acl_expr's SMP_USE_* */
135 unsigned int val; /* or'ed bit mask of all acl_expr's SMP_VAL_* */
Willy Tarreaua84d3742007-05-07 00:36:48 +0200136};
137
138/* the condition will be linked to from an action in a proxy */
139struct acl_term {
140 struct list list; /* chaining */
141 struct acl *acl; /* acl pointed to by this term */
142 int neg; /* 1 if the ACL result must be negated */
143};
144
145struct acl_term_suite {
146 struct list list; /* chaining of term suites */
147 struct list terms; /* list of acl_terms */
148};
149
150struct acl_cond {
151 struct list list; /* Some specific tests may use multiple conditions */
152 struct list suites; /* list of acl_term_suites */
Willy Tarreau0cba6072013-11-28 22:21:02 +0100153 enum acl_cond_pol pol; /* polarity: ACL_COND_IF / ACL_COND_UNLESS */
Willy Tarreaua91d0a52013-03-25 08:12:18 +0100154 unsigned int use; /* or'ed bit mask of all suites's SMP_USE_* */
155 unsigned int val; /* or'ed bit mask of all suites's SMP_VAL_* */
Willy Tarreau88922352009-10-04 22:02:50 +0200156 const char *file; /* config file where the condition is declared */
Willy Tarreaua9802632008-07-25 19:13:19 +0200157 int line; /* line in the config file where the condition is declared */
Willy Tarreaua84d3742007-05-07 00:36:48 +0200158};
159
Willy Tarreaua84d3742007-05-07 00:36:48 +0200160#endif /* _TYPES_ACL_H */
161
162/*
163 * Local variables:
164 * c-indent-level: 8
165 * c-basic-offset: 8
166 * End:
167 */