blob: 3f0a085a26f7812cbb02b44ef7a2f62f46b642fc [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 */
67 PAT_F_FROM_FILE = 1 << 1, /* pattern comes from a file */
68 PAT_F_TREE_OK = 1 << 2, /* the pattern parser is allowed to build a tree */
69 PAT_F_TREE = 1 << 3, /* some patterns are arranged in a tree */
Thierry FOURNIERed66c292013-11-28 11:05:19 +010070};
71
72/* ACL match methods */
73enum {
Thierry FOURNIERa65b3432013-11-28 18:22:00 +010074 PAT_MATCH_FOUND, /* just ensure that fetch found the sample */
75 PAT_MATCH_BOOL, /* match fetch's integer value as boolean */
76 PAT_MATCH_INT, /* unsigned integer (int) */
77 PAT_MATCH_IP, /* IPv4/IPv6 address (IP) */
78 PAT_MATCH_BIN, /* hex string (bin) */
79 PAT_MATCH_LEN, /* string length (str -> int) */
80 PAT_MATCH_STR, /* exact string match (str) */
81 PAT_MATCH_BEG, /* beginning of string (str) */
82 PAT_MATCH_SUB, /* substring (str) */
83 PAT_MATCH_DIR, /* directory-like sub-string (str) */
84 PAT_MATCH_DOM, /* domain-like sub-string (str) */
85 PAT_MATCH_END, /* end of string (str) */
86 PAT_MATCH_REG, /* regex (str -> reg) */
Thierry FOURNIERed66c292013-11-28 11:05:19 +010087 /* keep this one last */
Thierry FOURNIERa65b3432013-11-28 18:22:00 +010088 PAT_MATCH_NUM
Thierry FOURNIERed66c292013-11-28 11:05:19 +010089};
90
91/* How to store a time range and the valid days in 29 bits */
Thierry FOURNIERa65b3432013-11-28 18:22:00 +010092struct pat_time {
Thierry FOURNIERed66c292013-11-28 11:05:19 +010093 int dow:7; /* 1 bit per day of week: 0-6 */
94 int h1:5, m1:6; /* 0..24:0..60. Use 0:0 for all day. */
95 int h2:5, m2:6; /* 0..24:0..60. Use 24:0 for all day. */
96};
97
98/* This contain each tree indexed entry. This struct permit to associate
99 * "sample" with a tree entry. It is used with maps.
100 */
Thierry FOURNIERa65b3432013-11-28 18:22:00 +0100101struct pat_idx_elt {
Thierry FOURNIERed66c292013-11-28 11:05:19 +0100102 struct sample_storage *smp;
103 struct ebmb_node node;
104};
105
106/* This describes one ACL pattern, which might be a single value or a tree of
107 * values. All patterns for a single ACL expression are linked together. Some
108 * of them might have a type (eg: IP). Right now, the types are shared with
109 * the samples, though it is possible that in the future this will change to
110 * accommodate for other types (eg: meth, regex). Unsigned and constant types
111 * are preferred when there is a doubt.
112 */
Thierry FOURNIERa65b3432013-11-28 18:22:00 +0100113struct pattern {
Thierry FOURNIERed66c292013-11-28 11:05:19 +0100114 struct list list; /* chaining */
115 int type; /* type of the ACL pattern (SMP_T_*) */
116 union {
117 int i; /* integer value */
118 struct {
119 signed long long min, max;
120 int min_set :1;
121 int max_set :1;
122 } range; /* integer range */
123 struct {
124 struct in_addr addr;
125 struct in_addr mask;
126 } ipv4; /* IPv4 address */
127 struct {
128 struct in6_addr addr;
129 unsigned char mask; /* number of bits */
130 } ipv6; /* IPv6 address/mask */
Thierry FOURNIERa65b3432013-11-28 18:22:00 +0100131 struct pat_time time; /* valid hours and days */
Thierry FOURNIERed66c292013-11-28 11:05:19 +0100132 unsigned int group_mask;
133 struct eb_root *tree; /* tree storing all values if any */
134 } val; /* direct value */
135 union {
136 void *ptr; /* any data */
137 char *str; /* any string */
138 regex *reg; /* a compiled regex */
139 } ptr; /* indirect values, allocated */
140 void(*freeptrbuf)(void *ptr); /* a destructor able to free objects from the ptr */
141 int len; /* data length when required */
142 int flags; /* expr or pattern flags. */
143 struct sample_storage *smp; /* used to store a pointer to sample value associated
144 with the match. It is used with maps */
145
146};
147
Thierry FOURNIERd163e1c2013-11-28 11:41:23 +0100148/* Description of a pattern expression.
149 * It contains pointers to the parse and match functions, and a list or tree of
150 * patterns to test against. The structure is organized so that the hot parts
151 * are grouped together in order to optimize caching.
152 */
153struct pattern_expr {
Thierry FOURNIERa65b3432013-11-28 18:22:00 +0100154 int (*parse)(const char **text, struct pattern *pattern, struct sample_storage *smp, int *opaque, char **err);
Willy Tarreau0cba6072013-11-28 22:21:02 +0100155 enum pat_match_res (*match)(struct sample *smp, struct pattern *pattern);
Thierry FOURNIERd163e1c2013-11-28 11:41:23 +0100156 struct list patterns; /* list of acl_patterns */
157 struct eb_root pattern_tree; /* may be used for lookup in large datasets */
158};
159
Thierry FOURNIERa65b3432013-11-28 18:22:00 +0100160extern char *pat_match_names[PAT_MATCH_NUM];
161extern int (*pat_parse_fcts[PAT_MATCH_NUM])(const char **, struct pattern *, struct sample_storage *, int *, char **);
Willy Tarreau0cba6072013-11-28 22:21:02 +0100162extern enum pat_match_res (*pat_match_fcts[PAT_MATCH_NUM])(struct sample *, struct pattern *);
Thierry FOURNIERed66c292013-11-28 11:05:19 +0100163
164#endif /* _TYPES_PATTERN_H */