blob: a20d6d3896d5098d0adac4410e13627903fa22df [file] [log] [blame]
Thierry FOURNIERed66c292013-11-28 11:05:19 +01001/*
2 * include/types/pattern.h
3 * This file provides structures and types for ACLs.
4 *
5 * Copyright (C) 2000-2012 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_PATTERN_H
23#define _TYPES_PATTERN_H
24
25#include <common/compat.h>
26#include <common/config.h>
27#include <common/mini-clist.h>
28#include <common/regex.h>
29
30#include <types/sample.h>
31
32#include <ebmbtree.h>
33
Thierry FOURNIERa65b3432013-11-28 18:22:00 +010034/* Pattern matching function result.
35 *
36 * We're using a 3-state matching system to match samples against patterns in
37 * ACLs :
38 * - PASS : at least one pattern already matches
39 * - MISS : some data is missing to decide if some rules may finally match.
40 * - FAIL : no mattern may ever match
41 *
42 * We assign values 0, 1 and 3 to FAIL, MISS and PASS respectively, so that we
43 * can make use of standard arithmetics for the truth tables below :
44 *
45 * x | !x x&y | F(0) | M(1) | P(3) x|y | F(0) | M(1) | P(3)
46 * ------+----- -----+------+------+----- -----+------+------+-----
47 * F(0) | P(3) F(0)| F(0) | F(0) | F(0) F(0)| F(0) | M(1) | P(3)
48 * M(1) | M(1) M(1)| F(0) | M(1) | M(1) M(1)| M(1) | M(1) | P(3)
49 * P(3) | F(0) P(3)| F(0) | M(1) | P(3) P(3)| P(3) | P(3) | P(3)
50 *
51 * neg(x) = (3 >> x) and(x,y) = (x & y) or(x,y) = (x | y)
52 *
53 * For efficiency, the ACL return flags are directly mapped from the pattern
54 * match flags. A pattern can't return "MISS" since it's always presented an
55 * existing sample. So that leaves us with only two possible values :
56 * MATCH = 0
57 * NOMATCH = 3
58 */
Willy Tarreau0cba6072013-11-28 22:21:02 +010059enum pat_match_res {
Thierry FOURNIERa65b3432013-11-28 18:22:00 +010060 PAT_NOMATCH = 0, /* sample didn't match any pattern */
61 PAT_MATCH = 3, /* sample matched at least one pattern */
Thierry FOURNIERed66c292013-11-28 11:05:19 +010062};
63
64/* possible flags for expressions or patterns */
65enum {
Thierry FOURNIERa65b3432013-11-28 18:22:00 +010066 PAT_F_IGNORE_CASE = 1 << 0, /* ignore case */
Thierry FOURNIER66eb9bf2014-02-11 16:19:46 +010067 PAT_F_TREE = 1 << 1, /* some patterns are arranged in a tree */
Thierry FOURNIERb7729c92014-02-11 16:24:41 +010068 PAT_F_NO_DNS = 1 << 2, /* dont perform any DNS requests */
Thierry FOURNIERed66c292013-11-28 11:05:19 +010069};
70
71/* ACL match methods */
72enum {
Thierry FOURNIERa65b3432013-11-28 18:22:00 +010073 PAT_MATCH_FOUND, /* just ensure that fetch found the sample */
74 PAT_MATCH_BOOL, /* match fetch's integer value as boolean */
75 PAT_MATCH_INT, /* unsigned integer (int) */
76 PAT_MATCH_IP, /* IPv4/IPv6 address (IP) */
77 PAT_MATCH_BIN, /* hex string (bin) */
78 PAT_MATCH_LEN, /* string length (str -> int) */
79 PAT_MATCH_STR, /* exact string match (str) */
80 PAT_MATCH_BEG, /* beginning of string (str) */
81 PAT_MATCH_SUB, /* substring (str) */
82 PAT_MATCH_DIR, /* directory-like sub-string (str) */
83 PAT_MATCH_DOM, /* domain-like sub-string (str) */
84 PAT_MATCH_END, /* end of string (str) */
85 PAT_MATCH_REG, /* regex (str -> reg) */
Thierry FOURNIERed66c292013-11-28 11:05:19 +010086 /* keep this one last */
Thierry FOURNIERa65b3432013-11-28 18:22:00 +010087 PAT_MATCH_NUM
Thierry FOURNIERed66c292013-11-28 11:05:19 +010088};
89
Thierry FOURNIER1e00d382014-02-11 11:31:40 +010090#define PAT_REF_MAP 0x1 /* Set if the reference is used by at least one map. */
91#define PAT_REF_ACL 0x2 /* Set if the reference is used by at least one acl. */
Thierry FOURNIERc0bd9102014-01-29 12:32:58 +010092#define PAT_REF_SMP 0x4 /* Flag used if the reference contains a sample. */
Thierry FOURNIER1e00d382014-02-11 11:31:40 +010093
94/* This struct contain a list of reference strings for dunamically
95 * updatable patterns.
96 */
97struct pat_ref {
98 struct list list; /* Used to chain refs. */
99 unsigned int flags; /* flags PAT_REF_*. */
100 char *reference; /* The reference name. */
Thierry FOURNIERaf5a29d2014-03-11 14:29:22 +0100101 int unique_id; /* Each pattern reference have unique id. */
Thierry FOURNIER0d6ba512014-02-11 03:31:34 +0100102 char *display; /* String displayed to identify the pattern origin. */
Thierry FOURNIER1e00d382014-02-11 11:31:40 +0100103 struct list head; /* The head of the list of struct pat_ref_elt. */
104 struct list pat; /* The head of the list of struct pattern_expr. */
105};
106
107/* This is a part of struct pat_ref. Each entry contain one
108 * pattern and one associated value as original string.
109 */
110struct pat_ref_elt {
111 struct list list; /* Used to chain elements. */
112 char *pattern;
113 char *sample;
114 int line;
115};
116
Thierry FOURNIERed66c292013-11-28 11:05:19 +0100117/* How to store a time range and the valid days in 29 bits */
Thierry FOURNIERa65b3432013-11-28 18:22:00 +0100118struct pat_time {
Thierry FOURNIERed66c292013-11-28 11:05:19 +0100119 int dow:7; /* 1 bit per day of week: 0-6 */
120 int h1:5, m1:6; /* 0..24:0..60. Use 0:0 for all day. */
121 int h2:5, m2:6; /* 0..24:0..60. Use 24:0 for all day. */
122};
123
124/* This contain each tree indexed entry. This struct permit to associate
125 * "sample" with a tree entry. It is used with maps.
126 */
Thierry FOURNIERe1bcac52013-12-13 16:09:50 +0100127struct pattern_tree {
Thierry FOURNIERed66c292013-11-28 11:05:19 +0100128 struct sample_storage *smp;
Thierry FOURNIER6bb53ff2014-01-28 15:54:36 +0100129 struct pat_ref_elt *ref;
Thierry FOURNIERed66c292013-11-28 11:05:19 +0100130 struct ebmb_node node;
131};
132
133/* This describes one ACL pattern, which might be a single value or a tree of
134 * values. All patterns for a single ACL expression are linked together. Some
135 * of them might have a type (eg: IP). Right now, the types are shared with
136 * the samples, though it is possible that in the future this will change to
137 * accommodate for other types (eg: meth, regex). Unsigned and constant types
138 * are preferred when there is a doubt.
139 */
Thierry FOURNIERa65b3432013-11-28 18:22:00 +0100140struct pattern {
Thierry FOURNIERed66c292013-11-28 11:05:19 +0100141 int type; /* type of the ACL pattern (SMP_T_*) */
142 union {
143 int i; /* integer value */
144 struct {
145 signed long long min, max;
146 int min_set :1;
147 int max_set :1;
148 } range; /* integer range */
149 struct {
150 struct in_addr addr;
151 struct in_addr mask;
152 } ipv4; /* IPv4 address */
153 struct {
154 struct in6_addr addr;
155 unsigned char mask; /* number of bits */
156 } ipv6; /* IPv6 address/mask */
Thierry FOURNIERa65b3432013-11-28 18:22:00 +0100157 struct pat_time time; /* valid hours and days */
Thierry FOURNIERed66c292013-11-28 11:05:19 +0100158 struct eb_root *tree; /* tree storing all values if any */
159 } val; /* direct value */
160 union {
161 void *ptr; /* any data */
162 char *str; /* any string */
Thierry FOURNIER799c0422013-12-06 20:36:20 +0100163 struct my_regex *reg; /* a compiled regex */
Thierry FOURNIERed66c292013-11-28 11:05:19 +0100164 } ptr; /* indirect values, allocated */
Thierry FOURNIERed66c292013-11-28 11:05:19 +0100165 int len; /* data length when required */
166 int flags; /* expr or pattern flags. */
167 struct sample_storage *smp; /* used to store a pointer to sample value associated
168 with the match. It is used with maps */
Thierry FOURNIER6bb53ff2014-01-28 15:54:36 +0100169 struct pat_ref_elt *ref;
Thierry FOURNIERed66c292013-11-28 11:05:19 +0100170};
171
Thierry FOURNIER3ead5b92013-12-13 12:12:18 +0100172/* This struct is just used for chaining patterns */
173struct pattern_list {
174 struct list list;
175 struct pattern pat;
176};
177
Thierry FOURNIERd163e1c2013-11-28 11:41:23 +0100178/* Description of a pattern expression.
179 * It contains pointers to the parse and match functions, and a list or tree of
180 * patterns to test against. The structure is organized so that the hot parts
181 * are grouped together in order to optimize caching.
182 */
183struct pattern_expr {
Thierry FOURNIERc5959fd2014-01-20 14:29:33 +0100184 struct list list; /* Used for chaining pattern_expr in pat_ref. */
Thierry FOURNIER1e00d382014-02-11 11:31:40 +0100185 struct pat_ref *ref; /* The pattern reference if exists. */
Thierry FOURNIERc5959fd2014-01-20 14:29:33 +0100186 struct pattern_head *pat_head; /* Point to the pattern_head that contain manipulation functions.
187 * Note that this link point on compatible head but not on the real
188 * head. You can use only the function, and you must not use the
189 * "head". Dont write "(struct pattern_expr *)any->pat_head->expr".
190 */
Thierry FOURNIER1e00d382014-02-11 11:31:40 +0100191 struct list patterns; /* list of acl_patterns */
192 struct eb_root pattern_tree; /* may be used for lookup in large datasets */
193 struct eb_root pattern_tree_2; /* may be used for different types */
194};
195
Thierry FOURNIERc5959fd2014-01-20 14:29:33 +0100196/* This is a list of expression. A struct pattern_expr can be used by
197 * more than one "struct pattern_head". this intermediate struct
198 * permit more than one list.
199 */
200struct pattern_expr_list {
201 struct list list; /* Used for chaining pattern_expr in pattern_head. */
202 int do_free;
203 struct pattern_expr *expr; /* The used expr. */
204};
205
Thierry FOURNIER1e00d382014-02-11 11:31:40 +0100206/* This struct contain a list of pattern expr */
207struct pattern_head {
Thierry FOURNIERedc15c32013-12-13 15:36:59 +0100208 int (*parse)(const char *text, struct pattern *pattern, char **err);
Thierry FOURNIER88886352014-01-15 15:17:23 +0100209 int (*parse_smp)(const char *text, struct sample_storage *smp);
Thierry FOURNIERb9b08462013-12-13 15:12:32 +0100210 int (*index)(struct pattern_expr *, struct pattern *, char **);
Thierry FOURNIER7acca4b2014-01-28 16:43:36 +0100211 void (*delete)(struct pattern_expr *, struct pat_ref_elt *);
Thierry FOURNIER6f7203d2014-01-14 16:24:51 +0100212 void (*prune)(struct pattern_expr *);
Thierry FOURNIER5338eea2013-12-16 14:22:13 +0100213 struct pattern *(*match)(struct sample *, struct pattern_expr *, int);
Thierry FOURNIER5d344082014-01-27 14:19:53 +0100214 int expect_type; /* type of the expected sample (SMP_T_*) */
Thierry FOURNIER1e00d382014-02-11 11:31:40 +0100215
Thierry FOURNIERc5959fd2014-01-20 14:29:33 +0100216 struct list head; /* This is a list of struct pattern_expr_list. */
Thierry FOURNIERd163e1c2013-11-28 11:41:23 +0100217};
218
Thierry FOURNIER1e00d382014-02-11 11:31:40 +0100219/* This is the root of the list of all pattern_ref avalaibles. */
220extern struct list pattern_reference;
221
Thierry FOURNIERed66c292013-11-28 11:05:19 +0100222#endif /* _TYPES_PATTERN_H */