Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 1 | /* |
| 2 | * Pattern management functions. |
| 3 | * |
| 4 | * Copyright 2000-2013 Willy Tarreau <w@1wt.eu> |
| 5 | * |
| 6 | * This program is free software; you can redistribute it and/or |
| 7 | * modify it under the terms of the GNU General Public License |
| 8 | * as published by the Free Software Foundation; either version |
| 9 | * 2 of the License, or (at your option) any later version. |
| 10 | * |
| 11 | */ |
| 12 | |
| 13 | #include <ctype.h> |
| 14 | #include <stdio.h> |
Jerome Magnin | b8bd6d7 | 2020-01-17 18:01:20 +0100 | [diff] [blame] | 15 | #include <errno.h> |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 16 | |
Willy Tarreau | b255105 | 2020-06-09 09:07:15 +0200 | [diff] [blame] | 17 | #include <import/ebsttree.h> |
| 18 | #include <import/lru.h> |
| 19 | #include <import/xxhash.h> |
| 20 | |
Willy Tarreau | 4c7e4b7 | 2020-05-27 12:58:42 +0200 | [diff] [blame] | 21 | #include <haproxy/api.h> |
Willy Tarreau | f268ee8 | 2020-06-04 17:05:57 +0200 | [diff] [blame] | 22 | #include <haproxy/global.h> |
Willy Tarreau | aeed4a8 | 2020-06-04 22:01:04 +0200 | [diff] [blame] | 23 | #include <haproxy/log.h> |
Willy Tarreau | 6131d6a | 2020-06-02 16:48:09 +0200 | [diff] [blame] | 24 | #include <haproxy/net_helper.h> |
Willy Tarreau | 225a90a | 2020-06-04 15:06:28 +0200 | [diff] [blame] | 25 | #include <haproxy/pattern.h> |
Willy Tarreau | 7cd8b6e | 2020-06-02 17:32:26 +0200 | [diff] [blame] | 26 | #include <haproxy/regex.h> |
Willy Tarreau | e6ce10b | 2020-06-04 15:33:47 +0200 | [diff] [blame] | 27 | #include <haproxy/sample.h> |
Willy Tarreau | b255105 | 2020-06-09 09:07:15 +0200 | [diff] [blame] | 28 | #include <haproxy/tools.h> |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 29 | |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 30 | |
Thierry FOURNIER | a65b343 | 2013-11-28 18:22:00 +0100 | [diff] [blame] | 31 | char *pat_match_names[PAT_MATCH_NUM] = { |
| 32 | [PAT_MATCH_FOUND] = "found", |
| 33 | [PAT_MATCH_BOOL] = "bool", |
| 34 | [PAT_MATCH_INT] = "int", |
| 35 | [PAT_MATCH_IP] = "ip", |
| 36 | [PAT_MATCH_BIN] = "bin", |
| 37 | [PAT_MATCH_LEN] = "len", |
| 38 | [PAT_MATCH_STR] = "str", |
| 39 | [PAT_MATCH_BEG] = "beg", |
| 40 | [PAT_MATCH_SUB] = "sub", |
| 41 | [PAT_MATCH_DIR] = "dir", |
| 42 | [PAT_MATCH_DOM] = "dom", |
| 43 | [PAT_MATCH_END] = "end", |
| 44 | [PAT_MATCH_REG] = "reg", |
Thierry Fournier | 8feaa66 | 2016-02-10 22:55:20 +0100 | [diff] [blame] | 45 | [PAT_MATCH_REGM] = "regm", |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 46 | }; |
| 47 | |
Thierry FOURNIER | e47e4e2 | 2014-04-28 11:18:57 +0200 | [diff] [blame] | 48 | int (*pat_parse_fcts[PAT_MATCH_NUM])(const char *, struct pattern *, int, char **) = { |
Thierry FOURNIER | a65b343 | 2013-11-28 18:22:00 +0100 | [diff] [blame] | 49 | [PAT_MATCH_FOUND] = pat_parse_nothing, |
| 50 | [PAT_MATCH_BOOL] = pat_parse_nothing, |
| 51 | [PAT_MATCH_INT] = pat_parse_int, |
| 52 | [PAT_MATCH_IP] = pat_parse_ip, |
| 53 | [PAT_MATCH_BIN] = pat_parse_bin, |
Thierry FOURNIER | 5d34408 | 2014-01-27 14:19:53 +0100 | [diff] [blame] | 54 | [PAT_MATCH_LEN] = pat_parse_int, |
Thierry FOURNIER | a65b343 | 2013-11-28 18:22:00 +0100 | [diff] [blame] | 55 | [PAT_MATCH_STR] = pat_parse_str, |
| 56 | [PAT_MATCH_BEG] = pat_parse_str, |
| 57 | [PAT_MATCH_SUB] = pat_parse_str, |
| 58 | [PAT_MATCH_DIR] = pat_parse_str, |
| 59 | [PAT_MATCH_DOM] = pat_parse_str, |
| 60 | [PAT_MATCH_END] = pat_parse_str, |
| 61 | [PAT_MATCH_REG] = pat_parse_reg, |
Thierry Fournier | 8feaa66 | 2016-02-10 22:55:20 +0100 | [diff] [blame] | 62 | [PAT_MATCH_REGM] = pat_parse_reg, |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 63 | }; |
| 64 | |
Thierry FOURNIER | b9b0846 | 2013-12-13 15:12:32 +0100 | [diff] [blame] | 65 | int (*pat_index_fcts[PAT_MATCH_NUM])(struct pattern_expr *, struct pattern *, char **) = { |
| 66 | [PAT_MATCH_FOUND] = pat_idx_list_val, |
| 67 | [PAT_MATCH_BOOL] = pat_idx_list_val, |
| 68 | [PAT_MATCH_INT] = pat_idx_list_val, |
| 69 | [PAT_MATCH_IP] = pat_idx_tree_ip, |
| 70 | [PAT_MATCH_BIN] = pat_idx_list_ptr, |
| 71 | [PAT_MATCH_LEN] = pat_idx_list_val, |
| 72 | [PAT_MATCH_STR] = pat_idx_tree_str, |
Willy Tarreau | b1dd9bf | 2014-05-10 08:53:48 +0200 | [diff] [blame] | 73 | [PAT_MATCH_BEG] = pat_idx_tree_pfx, |
Thierry FOURNIER | b9b0846 | 2013-12-13 15:12:32 +0100 | [diff] [blame] | 74 | [PAT_MATCH_SUB] = pat_idx_list_str, |
| 75 | [PAT_MATCH_DIR] = pat_idx_list_str, |
| 76 | [PAT_MATCH_DOM] = pat_idx_list_str, |
| 77 | [PAT_MATCH_END] = pat_idx_list_str, |
| 78 | [PAT_MATCH_REG] = pat_idx_list_reg, |
Thierry Fournier | 8feaa66 | 2016-02-10 22:55:20 +0100 | [diff] [blame] | 79 | [PAT_MATCH_REGM] = pat_idx_list_regm, |
Thierry FOURNIER | b9b0846 | 2013-12-13 15:12:32 +0100 | [diff] [blame] | 80 | }; |
| 81 | |
Thierry FOURNIER | 6f7203d | 2014-01-14 16:24:51 +0100 | [diff] [blame] | 82 | void (*pat_prune_fcts[PAT_MATCH_NUM])(struct pattern_expr *) = { |
Willy Tarreau | 6d8a689 | 2020-11-02 19:26:02 +0100 | [diff] [blame] | 83 | [PAT_MATCH_FOUND] = pat_prune_gen, |
| 84 | [PAT_MATCH_BOOL] = pat_prune_gen, |
| 85 | [PAT_MATCH_INT] = pat_prune_gen, |
| 86 | [PAT_MATCH_IP] = pat_prune_gen, |
| 87 | [PAT_MATCH_BIN] = pat_prune_gen, |
| 88 | [PAT_MATCH_LEN] = pat_prune_gen, |
| 89 | [PAT_MATCH_STR] = pat_prune_gen, |
| 90 | [PAT_MATCH_BEG] = pat_prune_gen, |
| 91 | [PAT_MATCH_SUB] = pat_prune_gen, |
| 92 | [PAT_MATCH_DIR] = pat_prune_gen, |
| 93 | [PAT_MATCH_DOM] = pat_prune_gen, |
| 94 | [PAT_MATCH_END] = pat_prune_gen, |
| 95 | [PAT_MATCH_REG] = pat_prune_gen, |
| 96 | [PAT_MATCH_REGM] = pat_prune_gen, |
Thierry FOURNIER | 6f7203d | 2014-01-14 16:24:51 +0100 | [diff] [blame] | 97 | }; |
| 98 | |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 99 | struct pattern *(*pat_match_fcts[PAT_MATCH_NUM])(struct sample *, struct pattern_expr *, int) = { |
Thierry FOURNIER | a65b343 | 2013-11-28 18:22:00 +0100 | [diff] [blame] | 100 | [PAT_MATCH_FOUND] = NULL, |
| 101 | [PAT_MATCH_BOOL] = pat_match_nothing, |
| 102 | [PAT_MATCH_INT] = pat_match_int, |
| 103 | [PAT_MATCH_IP] = pat_match_ip, |
| 104 | [PAT_MATCH_BIN] = pat_match_bin, |
| 105 | [PAT_MATCH_LEN] = pat_match_len, |
| 106 | [PAT_MATCH_STR] = pat_match_str, |
| 107 | [PAT_MATCH_BEG] = pat_match_beg, |
| 108 | [PAT_MATCH_SUB] = pat_match_sub, |
| 109 | [PAT_MATCH_DIR] = pat_match_dir, |
| 110 | [PAT_MATCH_DOM] = pat_match_dom, |
| 111 | [PAT_MATCH_END] = pat_match_end, |
| 112 | [PAT_MATCH_REG] = pat_match_reg, |
Thierry Fournier | 8feaa66 | 2016-02-10 22:55:20 +0100 | [diff] [blame] | 113 | [PAT_MATCH_REGM] = pat_match_regm, |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 114 | }; |
| 115 | |
Thierry FOURNIER | e3ded59 | 2013-12-06 15:36:54 +0100 | [diff] [blame] | 116 | /* Just used for checking configuration compatibility */ |
| 117 | int pat_match_types[PAT_MATCH_NUM] = { |
Thierry FOURNIER | 07ee64e | 2015-07-06 23:43:03 +0200 | [diff] [blame] | 118 | [PAT_MATCH_FOUND] = SMP_T_SINT, |
| 119 | [PAT_MATCH_BOOL] = SMP_T_SINT, |
| 120 | [PAT_MATCH_INT] = SMP_T_SINT, |
Thierry FOURNIER | e3ded59 | 2013-12-06 15:36:54 +0100 | [diff] [blame] | 121 | [PAT_MATCH_IP] = SMP_T_ADDR, |
Thierry FOURNIER | 7654c9f | 2013-12-17 00:20:33 +0100 | [diff] [blame] | 122 | [PAT_MATCH_BIN] = SMP_T_BIN, |
| 123 | [PAT_MATCH_LEN] = SMP_T_STR, |
| 124 | [PAT_MATCH_STR] = SMP_T_STR, |
| 125 | [PAT_MATCH_BEG] = SMP_T_STR, |
| 126 | [PAT_MATCH_SUB] = SMP_T_STR, |
| 127 | [PAT_MATCH_DIR] = SMP_T_STR, |
| 128 | [PAT_MATCH_DOM] = SMP_T_STR, |
| 129 | [PAT_MATCH_END] = SMP_T_STR, |
| 130 | [PAT_MATCH_REG] = SMP_T_STR, |
Thierry Fournier | 8feaa66 | 2016-02-10 22:55:20 +0100 | [diff] [blame] | 131 | [PAT_MATCH_REGM] = SMP_T_STR, |
Thierry FOURNIER | e3ded59 | 2013-12-06 15:36:54 +0100 | [diff] [blame] | 132 | }; |
| 133 | |
Thierry FOURNIER | 1794fdf | 2014-01-17 15:25:13 +0100 | [diff] [blame] | 134 | /* this struct is used to return information */ |
Emeric Brun | b5997f7 | 2017-07-03 11:34:05 +0200 | [diff] [blame] | 135 | static THREAD_LOCAL struct pattern static_pattern; |
| 136 | static THREAD_LOCAL struct sample_data static_sample_data; |
Thierry FOURNIER | 1794fdf | 2014-01-17 15:25:13 +0100 | [diff] [blame] | 137 | |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 138 | /* This is the root of the list of all pattern_ref avalaibles. */ |
| 139 | struct list pattern_reference = LIST_HEAD_INIT(pattern_reference); |
| 140 | |
Willy Tarreau | 403bfbb | 2019-10-23 06:59:31 +0200 | [diff] [blame] | 141 | static THREAD_LOCAL struct lru64_head *pat_lru_tree; |
Willy Tarreau | f3045d2 | 2015-04-29 16:24:50 +0200 | [diff] [blame] | 142 | static unsigned long long pat_lru_seed; |
| 143 | |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 144 | /* |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 145 | * |
| 146 | * The following functions are not exported and are used by internals process |
| 147 | * of pattern matching |
| 148 | * |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 149 | */ |
| 150 | |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 151 | /* Background: Fast way to find a zero byte in a word |
| 152 | * http://graphics.stanford.edu/~seander/bithacks.html#ZeroInWord |
| 153 | * hasZeroByte = (v - 0x01010101UL) & ~v & 0x80808080UL; |
| 154 | * |
| 155 | * To look for 4 different byte values, xor the word with those bytes and |
| 156 | * then check for zero bytes: |
| 157 | * |
| 158 | * v = (((unsigned char)c * 0x1010101U) ^ delimiter) |
| 159 | * where <delimiter> is the 4 byte values to look for (as an uint) |
| 160 | * and <c> is the character that is being tested |
| 161 | */ |
| 162 | static inline unsigned int is_delimiter(unsigned char c, unsigned int mask) |
| 163 | { |
| 164 | mask ^= (c * 0x01010101); /* propagate the char to all 4 bytes */ |
| 165 | return (mask - 0x01010101) & ~mask & 0x80808080U; |
| 166 | } |
| 167 | |
| 168 | static inline unsigned int make_4delim(unsigned char d1, unsigned char d2, unsigned char d3, unsigned char d4) |
| 169 | { |
| 170 | return d1 << 24 | d2 << 16 | d3 << 8 | d4; |
| 171 | } |
| 172 | |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 173 | |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 174 | /* |
| 175 | * |
| 176 | * These functions are exported and may be used by any other component. |
| 177 | * |
Willy Tarreau | 5def8ef | 2014-08-29 15:19:33 +0200 | [diff] [blame] | 178 | * The following functions are used for parsing pattern matching input value. |
| 179 | * The <text> contain the string to be parsed. <pattern> must be a preallocated |
| 180 | * pattern. The pat_parse_* functions fill this structure with the parsed value. |
| 181 | * <err> is filled with an error message built with memprintf() function. It is |
| 182 | * allowed to use a trash as a temporary storage for the returned pattern, as |
| 183 | * the next call after these functions will be pat_idx_*. |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 184 | * |
Willy Tarreau | 5def8ef | 2014-08-29 15:19:33 +0200 | [diff] [blame] | 185 | * In success case, the pat_parse_* function returns 1. If the function |
| 186 | * fails, it returns 0 and <err> is filled. |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 187 | */ |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 188 | |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 189 | /* ignore the current line */ |
Thierry FOURNIER | e47e4e2 | 2014-04-28 11:18:57 +0200 | [diff] [blame] | 190 | int pat_parse_nothing(const char *text, struct pattern *pattern, int mflags, char **err) |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 191 | { |
| 192 | return 1; |
| 193 | } |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 194 | |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 195 | /* Parse a string. It is allocated and duplicated. */ |
Thierry FOURNIER | e47e4e2 | 2014-04-28 11:18:57 +0200 | [diff] [blame] | 196 | int pat_parse_str(const char *text, struct pattern *pattern, int mflags, char **err) |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 197 | { |
Thierry FOURNIER | 7654c9f | 2013-12-17 00:20:33 +0100 | [diff] [blame] | 198 | pattern->type = SMP_T_STR; |
Thierry FOURNIER | edc15c3 | 2013-12-13 15:36:59 +0100 | [diff] [blame] | 199 | pattern->ptr.str = (char *)text; |
Thierry FOURNIER | 580c32c | 2014-01-24 10:58:12 +0100 | [diff] [blame] | 200 | pattern->len = strlen(text); |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 201 | return 1; |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 202 | } |
| 203 | |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 204 | /* Parse a binary written in hexa. It is allocated. */ |
Thierry FOURNIER | e47e4e2 | 2014-04-28 11:18:57 +0200 | [diff] [blame] | 205 | int pat_parse_bin(const char *text, struct pattern *pattern, int mflags, char **err) |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 206 | { |
Willy Tarreau | 83061a8 | 2018-07-13 11:56:34 +0200 | [diff] [blame] | 207 | struct buffer *trash; |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 208 | |
Thierry FOURNIER | 7654c9f | 2013-12-17 00:20:33 +0100 | [diff] [blame] | 209 | pattern->type = SMP_T_BIN; |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 210 | trash = get_trash_chunk(); |
| 211 | pattern->len = trash->size; |
Willy Tarreau | 843b7cb | 2018-07-13 10:54:26 +0200 | [diff] [blame] | 212 | pattern->ptr.str = trash->area; |
Thierry FOURNIER | 580c32c | 2014-01-24 10:58:12 +0100 | [diff] [blame] | 213 | return !!parse_binary(text, &pattern->ptr.str, &pattern->len, err); |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 214 | } |
| 215 | |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 216 | /* Parse a regex. It is allocated. */ |
Thierry FOURNIER | e47e4e2 | 2014-04-28 11:18:57 +0200 | [diff] [blame] | 217 | int pat_parse_reg(const char *text, struct pattern *pattern, int mflags, char **err) |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 218 | { |
Thierry FOURNIER | 0b6d15f | 2014-01-29 19:35:16 +0100 | [diff] [blame] | 219 | pattern->ptr.str = (char *)text; |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 220 | return 1; |
| 221 | } |
| 222 | |
| 223 | /* Parse a range of positive integers delimited by either ':' or '-'. If only |
| 224 | * one integer is read, it is set as both min and max. An operator may be |
| 225 | * specified as the prefix, among this list of 5 : |
| 226 | * |
| 227 | * 0:eq, 1:gt, 2:ge, 3:lt, 4:le |
| 228 | * |
| 229 | * The default operator is "eq". It supports range matching. Ranges are |
| 230 | * rejected for other operators. The operator may be changed at any time. |
| 231 | * The operator is stored in the 'opaque' argument. |
| 232 | * |
| 233 | * If err is non-NULL, an error message will be returned there on errors and |
Thierry FOURNIER | 511e947 | 2014-01-23 17:40:34 +0100 | [diff] [blame] | 234 | * the caller will have to free it. The function returns zero on error, and |
| 235 | * non-zero on success. |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 236 | * |
| 237 | */ |
Thierry FOURNIER | e47e4e2 | 2014-04-28 11:18:57 +0200 | [diff] [blame] | 238 | int pat_parse_int(const char *text, struct pattern *pattern, int mflags, char **err) |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 239 | { |
Thierry FOURNIER | 580c32c | 2014-01-24 10:58:12 +0100 | [diff] [blame] | 240 | const char *ptr = text; |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 241 | |
Thierry FOURNIER | 07ee64e | 2015-07-06 23:43:03 +0200 | [diff] [blame] | 242 | pattern->type = SMP_T_SINT; |
Thierry FOURNIER | 7148ce6 | 2013-12-06 19:06:43 +0100 | [diff] [blame] | 243 | |
Thierry FOURNIER | 511e947 | 2014-01-23 17:40:34 +0100 | [diff] [blame] | 244 | /* Empty string is not valid */ |
Thierry FOURNIER | 580c32c | 2014-01-24 10:58:12 +0100 | [diff] [blame] | 245 | if (!*text) |
Thierry FOURNIER | 511e947 | 2014-01-23 17:40:34 +0100 | [diff] [blame] | 246 | goto not_valid_range; |
| 247 | |
| 248 | /* Search ':' or '-' separator. */ |
| 249 | while (*ptr != '\0' && *ptr != ':' && *ptr != '-') |
| 250 | ptr++; |
| 251 | |
| 252 | /* If separator not found. */ |
| 253 | if (!*ptr) { |
Thierry FOURNIER | 580c32c | 2014-01-24 10:58:12 +0100 | [diff] [blame] | 254 | if (strl2llrc(text, ptr - text, &pattern->val.range.min) != 0) { |
| 255 | memprintf(err, "'%s' is not a number", text); |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 256 | return 0; |
| 257 | } |
Thierry FOURNIER | 511e947 | 2014-01-23 17:40:34 +0100 | [diff] [blame] | 258 | pattern->val.range.max = pattern->val.range.min; |
| 259 | pattern->val.range.min_set = 1; |
| 260 | pattern->val.range.max_set = 1; |
| 261 | return 1; |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 262 | } |
| 263 | |
Thierry FOURNIER | 511e947 | 2014-01-23 17:40:34 +0100 | [diff] [blame] | 264 | /* If the separator is the first character. */ |
Thierry FOURNIER | 580c32c | 2014-01-24 10:58:12 +0100 | [diff] [blame] | 265 | if (ptr == text && *(ptr + 1) != '\0') { |
Thierry FOURNIER | 511e947 | 2014-01-23 17:40:34 +0100 | [diff] [blame] | 266 | if (strl2llrc(ptr + 1, strlen(ptr + 1), &pattern->val.range.max) != 0) |
| 267 | goto not_valid_range; |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 268 | |
Thierry FOURNIER | 511e947 | 2014-01-23 17:40:34 +0100 | [diff] [blame] | 269 | pattern->val.range.min_set = 0; |
| 270 | pattern->val.range.max_set = 1; |
| 271 | return 1; |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 272 | } |
| 273 | |
Thierry FOURNIER | 511e947 | 2014-01-23 17:40:34 +0100 | [diff] [blame] | 274 | /* If separator is the last character. */ |
| 275 | if (*(ptr + 1) == '\0') { |
Thierry FOURNIER | 580c32c | 2014-01-24 10:58:12 +0100 | [diff] [blame] | 276 | if (strl2llrc(text, ptr - text, &pattern->val.range.min) != 0) |
Thierry FOURNIER | 511e947 | 2014-01-23 17:40:34 +0100 | [diff] [blame] | 277 | goto not_valid_range; |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 278 | |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 279 | pattern->val.range.min_set = 1; |
| 280 | pattern->val.range.max_set = 0; |
Thierry FOURNIER | 511e947 | 2014-01-23 17:40:34 +0100 | [diff] [blame] | 281 | return 1; |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 282 | } |
Thierry FOURNIER | 511e947 | 2014-01-23 17:40:34 +0100 | [diff] [blame] | 283 | |
| 284 | /* Else, parse two numbers. */ |
Thierry FOURNIER | 580c32c | 2014-01-24 10:58:12 +0100 | [diff] [blame] | 285 | if (strl2llrc(text, ptr - text, &pattern->val.range.min) != 0) |
Thierry FOURNIER | 511e947 | 2014-01-23 17:40:34 +0100 | [diff] [blame] | 286 | goto not_valid_range; |
| 287 | |
| 288 | if (strl2llrc(ptr + 1, strlen(ptr + 1), &pattern->val.range.max) != 0) |
| 289 | goto not_valid_range; |
| 290 | |
| 291 | if (pattern->val.range.min > pattern->val.range.max) |
| 292 | goto not_valid_range; |
| 293 | |
| 294 | pattern->val.range.min_set = 1; |
| 295 | pattern->val.range.max_set = 1; |
| 296 | return 1; |
| 297 | |
| 298 | not_valid_range: |
Thierry FOURNIER | 580c32c | 2014-01-24 10:58:12 +0100 | [diff] [blame] | 299 | memprintf(err, "'%s' is not a valid number range", text); |
Thierry FOURNIER | 511e947 | 2014-01-23 17:40:34 +0100 | [diff] [blame] | 300 | return 0; |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 301 | } |
| 302 | |
| 303 | /* Parse a range of positive 2-component versions delimited by either ':' or |
| 304 | * '-'. The version consists in a major and a minor, both of which must be |
| 305 | * smaller than 65536, because internally they will be represented as a 32-bit |
| 306 | * integer. |
| 307 | * If only one version is read, it is set as both min and max. Just like for |
| 308 | * pure integers, an operator may be specified as the prefix, among this list |
| 309 | * of 5 : |
| 310 | * |
| 311 | * 0:eq, 1:gt, 2:ge, 3:lt, 4:le |
| 312 | * |
| 313 | * The default operator is "eq". It supports range matching. Ranges are |
| 314 | * rejected for other operators. The operator may be changed at any time. |
| 315 | * The operator is stored in the 'opaque' argument. This allows constructs |
| 316 | * such as the following one : |
| 317 | * |
| 318 | * acl obsolete_ssl ssl_req_proto lt 3 |
| 319 | * acl unsupported_ssl ssl_req_proto gt 3.1 |
| 320 | * acl valid_ssl ssl_req_proto 3.0-3.1 |
| 321 | * |
| 322 | */ |
Thierry FOURNIER | e47e4e2 | 2014-04-28 11:18:57 +0200 | [diff] [blame] | 323 | int pat_parse_dotted_ver(const char *text, struct pattern *pattern, int mflags, char **err) |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 324 | { |
Thierry FOURNIER | 580c32c | 2014-01-24 10:58:12 +0100 | [diff] [blame] | 325 | const char *ptr = text; |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 326 | |
Thierry FOURNIER | 07ee64e | 2015-07-06 23:43:03 +0200 | [diff] [blame] | 327 | pattern->type = SMP_T_SINT; |
Thierry FOURNIER | 511e947 | 2014-01-23 17:40:34 +0100 | [diff] [blame] | 328 | |
| 329 | /* Search ':' or '-' separator. */ |
| 330 | while (*ptr != '\0' && *ptr != ':' && *ptr != '-') |
| 331 | ptr++; |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 332 | |
Thierry FOURNIER | 511e947 | 2014-01-23 17:40:34 +0100 | [diff] [blame] | 333 | /* If separator not found. */ |
Thierry FOURNIER | 580c32c | 2014-01-24 10:58:12 +0100 | [diff] [blame] | 334 | if (*ptr == '\0' && ptr > text) { |
| 335 | if (strl2llrc_dotted(text, ptr-text, &pattern->val.range.min) != 0) { |
| 336 | memprintf(err, "'%s' is not a dotted number", text); |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 337 | return 0; |
| 338 | } |
Thierry FOURNIER | 511e947 | 2014-01-23 17:40:34 +0100 | [diff] [blame] | 339 | pattern->val.range.max = pattern->val.range.min; |
| 340 | pattern->val.range.min_set = 1; |
| 341 | pattern->val.range.max_set = 1; |
| 342 | return 1; |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 343 | } |
| 344 | |
Thierry FOURNIER | 511e947 | 2014-01-23 17:40:34 +0100 | [diff] [blame] | 345 | /* If the separator is the first character. */ |
Thierry FOURNIER | 580c32c | 2014-01-24 10:58:12 +0100 | [diff] [blame] | 346 | if (ptr == text && *(ptr+1) != '\0') { |
Thierry FOURNIER | 511e947 | 2014-01-23 17:40:34 +0100 | [diff] [blame] | 347 | if (strl2llrc_dotted(ptr+1, strlen(ptr+1), &pattern->val.range.max) != 0) { |
Thierry FOURNIER | 580c32c | 2014-01-24 10:58:12 +0100 | [diff] [blame] | 348 | memprintf(err, "'%s' is not a valid dotted number range", text); |
Thierry FOURNIER | 511e947 | 2014-01-23 17:40:34 +0100 | [diff] [blame] | 349 | return 0; |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 350 | } |
Thierry FOURNIER | 511e947 | 2014-01-23 17:40:34 +0100 | [diff] [blame] | 351 | pattern->val.range.min_set = 0; |
| 352 | pattern->val.range.max_set = 1; |
| 353 | return 1; |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 354 | } |
| 355 | |
Thierry FOURNIER | 511e947 | 2014-01-23 17:40:34 +0100 | [diff] [blame] | 356 | /* If separator is the last character. */ |
Thierry FOURNIER | 580c32c | 2014-01-24 10:58:12 +0100 | [diff] [blame] | 357 | if (ptr == &text[strlen(text)-1]) { |
| 358 | if (strl2llrc_dotted(text, ptr-text, &pattern->val.range.min) != 0) { |
| 359 | memprintf(err, "'%s' is not a valid dotted number range", text); |
Thierry FOURNIER | 511e947 | 2014-01-23 17:40:34 +0100 | [diff] [blame] | 360 | return 0; |
| 361 | } |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 362 | pattern->val.range.min_set = 1; |
| 363 | pattern->val.range.max_set = 0; |
Thierry FOURNIER | 511e947 | 2014-01-23 17:40:34 +0100 | [diff] [blame] | 364 | return 1; |
| 365 | } |
| 366 | |
| 367 | /* Else, parse two numbers. */ |
Thierry FOURNIER | 580c32c | 2014-01-24 10:58:12 +0100 | [diff] [blame] | 368 | if (strl2llrc_dotted(text, ptr-text, &pattern->val.range.min) != 0) { |
| 369 | memprintf(err, "'%s' is not a valid dotted number range", text); |
Thierry FOURNIER | 511e947 | 2014-01-23 17:40:34 +0100 | [diff] [blame] | 370 | return 0; |
| 371 | } |
| 372 | if (strl2llrc_dotted(ptr+1, strlen(ptr+1), &pattern->val.range.max) != 0) { |
Thierry FOURNIER | 580c32c | 2014-01-24 10:58:12 +0100 | [diff] [blame] | 373 | memprintf(err, "'%s' is not a valid dotted number range", text); |
Thierry FOURNIER | 511e947 | 2014-01-23 17:40:34 +0100 | [diff] [blame] | 374 | return 0; |
| 375 | } |
| 376 | if (pattern->val.range.min > pattern->val.range.max) { |
Thierry FOURNIER | 580c32c | 2014-01-24 10:58:12 +0100 | [diff] [blame] | 377 | memprintf(err, "'%s' is not a valid dotted number range", text); |
Thierry FOURNIER | 511e947 | 2014-01-23 17:40:34 +0100 | [diff] [blame] | 378 | return 0; |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 379 | } |
Thierry FOURNIER | 511e947 | 2014-01-23 17:40:34 +0100 | [diff] [blame] | 380 | pattern->val.range.min_set = 1; |
| 381 | pattern->val.range.max_set = 1; |
| 382 | return 1; |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 383 | } |
| 384 | |
| 385 | /* Parse an IP address and an optional mask in the form addr[/mask]. |
| 386 | * The addr may either be an IPv4 address or a hostname. The mask |
| 387 | * may either be a dotted mask or a number of bits. Returns 1 if OK, |
| 388 | * otherwise 0. NOTE: IP address patterns are typed (IPV4/IPV6). |
| 389 | */ |
Thierry FOURNIER | e47e4e2 | 2014-04-28 11:18:57 +0200 | [diff] [blame] | 390 | int pat_parse_ip(const char *text, struct pattern *pattern, int mflags, char **err) |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 391 | { |
Thierry FOURNIER | e47e4e2 | 2014-04-28 11:18:57 +0200 | [diff] [blame] | 392 | if (str2net(text, !(mflags & PAT_MF_NO_DNS) && (global.mode & MODE_STARTING), |
Thierry FOURNIER | fc7ac7b | 2014-02-11 15:23:04 +0100 | [diff] [blame] | 393 | &pattern->val.ipv4.addr, &pattern->val.ipv4.mask)) { |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 394 | pattern->type = SMP_T_IPV4; |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 395 | return 1; |
| 396 | } |
Thierry FOURNIER | 580c32c | 2014-01-24 10:58:12 +0100 | [diff] [blame] | 397 | else if (str62net(text, &pattern->val.ipv6.addr, &pattern->val.ipv6.mask)) { |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 398 | pattern->type = SMP_T_IPV6; |
| 399 | return 1; |
| 400 | } |
| 401 | else { |
Thierry FOURNIER | 580c32c | 2014-01-24 10:58:12 +0100 | [diff] [blame] | 402 | memprintf(err, "'%s' is not a valid IPv4 or IPv6 address", text); |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 403 | return 0; |
| 404 | } |
| 405 | } |
| 406 | |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 407 | /* |
| 408 | * |
| 409 | * These functions are exported and may be used by any other component. |
| 410 | * |
Joseph Herlant | 4189d67 | 2018-11-15 10:22:31 -0800 | [diff] [blame] | 411 | * This function just takes a sample <smp> and checks if this sample matches |
| 412 | * with the pattern <pattern>. This function returns only PAT_MATCH or |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 413 | * PAT_NOMATCH. |
| 414 | * |
| 415 | */ |
| 416 | |
| 417 | /* always return false */ |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 418 | struct pattern *pat_match_nothing(struct sample *smp, struct pattern_expr *expr, int fill) |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 419 | { |
Thierry FOURNIER | 136f9d3 | 2015-08-19 09:07:19 +0200 | [diff] [blame] | 420 | if (smp->data.u.sint) { |
Thierry FOURNIER | e5978bf | 2014-03-17 19:53:10 +0100 | [diff] [blame] | 421 | if (fill) { |
Thierry FOURNIER | 503bb09 | 2015-08-19 08:35:43 +0200 | [diff] [blame] | 422 | static_pattern.data = NULL; |
Thierry FOURNIER | e5978bf | 2014-03-17 19:53:10 +0100 | [diff] [blame] | 423 | static_pattern.ref = NULL; |
Thierry FOURNIER | e5978bf | 2014-03-17 19:53:10 +0100 | [diff] [blame] | 424 | static_pattern.type = 0; |
| 425 | static_pattern.ptr.str = NULL; |
| 426 | } |
| 427 | return &static_pattern; |
| 428 | } |
| 429 | else |
| 430 | return NULL; |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 431 | } |
| 432 | |
| 433 | |
Joseph Herlant | 4189d67 | 2018-11-15 10:22:31 -0800 | [diff] [blame] | 434 | /* NB: For two strings to be identical, it is required that their length match */ |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 435 | struct pattern *pat_match_str(struct sample *smp, struct pattern_expr *expr, int fill) |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 436 | { |
| 437 | int icase; |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 438 | struct ebmb_node *node; |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 439 | struct pattern_tree *elt; |
| 440 | struct pattern_list *lst; |
| 441 | struct pattern *pattern; |
Willy Tarreau | f3045d2 | 2015-04-29 16:24:50 +0200 | [diff] [blame] | 442 | struct pattern *ret = NULL; |
| 443 | struct lru64 *lru = NULL; |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 444 | |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 445 | /* Lookup a string in the expression's pattern tree. */ |
| 446 | if (!eb_is_empty(&expr->pattern_tree)) { |
Christopher Faulet | b4cf7ab | 2020-06-30 18:52:32 +0200 | [diff] [blame] | 447 | char prev = 0; |
| 448 | |
| 449 | if (smp->data.u.str.data < smp->data.u.str.size) { |
| 450 | /* we may have to force a trailing zero on the test pattern and |
| 451 | * the buffer is large enough to accommodate it. |
| 452 | */ |
| 453 | prev = smp->data.u.str.area[smp->data.u.str.data]; |
| 454 | if (prev) |
| 455 | smp->data.u.str.area[smp->data.u.str.data] = '\0'; |
| 456 | } |
| 457 | else { |
| 458 | /* Otherwise, the sample is duplicated. A trailing zero |
| 459 | * is automatically added to the string. |
| 460 | */ |
| 461 | if (!smp_dup(smp)) |
| 462 | return NULL; |
| 463 | } |
| 464 | |
Willy Tarreau | 843b7cb | 2018-07-13 10:54:26 +0200 | [diff] [blame] | 465 | node = ebst_lookup(&expr->pattern_tree, smp->data.u.str.area); |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 466 | if (prev) |
Willy Tarreau | 843b7cb | 2018-07-13 10:54:26 +0200 | [diff] [blame] | 467 | smp->data.u.str.area[smp->data.u.str.data] = prev; |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 468 | if (node) { |
| 469 | if (fill) { |
| 470 | elt = ebmb_entry(node, struct pattern_tree, node); |
Thierry FOURNIER | 503bb09 | 2015-08-19 08:35:43 +0200 | [diff] [blame] | 471 | static_pattern.data = elt->data; |
Thierry FOURNIER | 6bb53ff | 2014-01-28 15:54:36 +0100 | [diff] [blame] | 472 | static_pattern.ref = elt->ref; |
Thierry FOURNIER | e47e4e2 | 2014-04-28 11:18:57 +0200 | [diff] [blame] | 473 | static_pattern.sflags = PAT_SF_TREE; |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 474 | static_pattern.type = SMP_T_STR; |
| 475 | static_pattern.ptr.str = (char *)elt->node.key; |
| 476 | } |
| 477 | return &static_pattern; |
| 478 | } |
| 479 | } |
| 480 | |
| 481 | /* look in the list */ |
Willy Tarreau | f3045d2 | 2015-04-29 16:24:50 +0200 | [diff] [blame] | 482 | if (pat_lru_tree) { |
Willy Tarreau | aee9314 | 2015-05-04 17:18:42 +0200 | [diff] [blame] | 483 | unsigned long long seed = pat_lru_seed ^ (long)expr; |
Willy Tarreau | f3045d2 | 2015-04-29 16:24:50 +0200 | [diff] [blame] | 484 | |
Willy Tarreau | 843b7cb | 2018-07-13 10:54:26 +0200 | [diff] [blame] | 485 | lru = lru64_get(XXH64(smp->data.u.str.area, smp->data.u.str.data, seed), |
Willy Tarreau | 3ee0de1 | 2020-11-02 15:26:51 +0100 | [diff] [blame] | 486 | pat_lru_tree, expr, expr->ref->revision); |
Willy Tarreau | 403bfbb | 2019-10-23 06:59:31 +0200 | [diff] [blame] | 487 | if (lru && lru->domain) { |
Emeric Brun | b5997f7 | 2017-07-03 11:34:05 +0200 | [diff] [blame] | 488 | ret = lru->data; |
Emeric Brun | b5997f7 | 2017-07-03 11:34:05 +0200 | [diff] [blame] | 489 | return ret; |
| 490 | } |
Willy Tarreau | f3045d2 | 2015-04-29 16:24:50 +0200 | [diff] [blame] | 491 | } |
| 492 | |
Emeric Brun | b5997f7 | 2017-07-03 11:34:05 +0200 | [diff] [blame] | 493 | |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 494 | list_for_each_entry(lst, &expr->patterns, list) { |
| 495 | pattern = &lst->pat; |
| 496 | |
Willy Tarreau | 843b7cb | 2018-07-13 10:54:26 +0200 | [diff] [blame] | 497 | if (pattern->len != smp->data.u.str.data) |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 498 | continue; |
| 499 | |
Thierry FOURNIER | e47e4e2 | 2014-04-28 11:18:57 +0200 | [diff] [blame] | 500 | icase = expr->mflags & PAT_MF_IGNORE_CASE; |
Willy Tarreau | 843b7cb | 2018-07-13 10:54:26 +0200 | [diff] [blame] | 501 | if ((icase && strncasecmp(pattern->ptr.str, smp->data.u.str.area, smp->data.u.str.data) == 0) || |
| 502 | (!icase && strncmp(pattern->ptr.str, smp->data.u.str.area, smp->data.u.str.data) == 0)) { |
Willy Tarreau | f3045d2 | 2015-04-29 16:24:50 +0200 | [diff] [blame] | 503 | ret = pattern; |
| 504 | break; |
| 505 | } |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 506 | } |
| 507 | |
Willy Tarreau | 403bfbb | 2019-10-23 06:59:31 +0200 | [diff] [blame] | 508 | if (lru) |
Willy Tarreau | 3ee0de1 | 2020-11-02 15:26:51 +0100 | [diff] [blame] | 509 | lru64_commit(lru, ret, expr, expr->ref->revision, NULL); |
Willy Tarreau | f3045d2 | 2015-04-29 16:24:50 +0200 | [diff] [blame] | 510 | |
| 511 | return ret; |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 512 | } |
| 513 | |
| 514 | /* NB: For two binaries buf to be identical, it is required that their lengths match */ |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 515 | struct pattern *pat_match_bin(struct sample *smp, struct pattern_expr *expr, int fill) |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 516 | { |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 517 | struct pattern_list *lst; |
| 518 | struct pattern *pattern; |
Willy Tarreau | f3045d2 | 2015-04-29 16:24:50 +0200 | [diff] [blame] | 519 | struct pattern *ret = NULL; |
| 520 | struct lru64 *lru = NULL; |
| 521 | |
| 522 | if (pat_lru_tree) { |
Willy Tarreau | aee9314 | 2015-05-04 17:18:42 +0200 | [diff] [blame] | 523 | unsigned long long seed = pat_lru_seed ^ (long)expr; |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 524 | |
Willy Tarreau | 843b7cb | 2018-07-13 10:54:26 +0200 | [diff] [blame] | 525 | lru = lru64_get(XXH64(smp->data.u.str.area, smp->data.u.str.data, seed), |
Willy Tarreau | 3ee0de1 | 2020-11-02 15:26:51 +0100 | [diff] [blame] | 526 | pat_lru_tree, expr, expr->ref->revision); |
Willy Tarreau | 403bfbb | 2019-10-23 06:59:31 +0200 | [diff] [blame] | 527 | if (lru && lru->domain) { |
Emeric Brun | b5997f7 | 2017-07-03 11:34:05 +0200 | [diff] [blame] | 528 | ret = lru->data; |
Emeric Brun | b5997f7 | 2017-07-03 11:34:05 +0200 | [diff] [blame] | 529 | return ret; |
| 530 | } |
Willy Tarreau | f3045d2 | 2015-04-29 16:24:50 +0200 | [diff] [blame] | 531 | } |
| 532 | |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 533 | list_for_each_entry(lst, &expr->patterns, list) { |
| 534 | pattern = &lst->pat; |
| 535 | |
Willy Tarreau | 843b7cb | 2018-07-13 10:54:26 +0200 | [diff] [blame] | 536 | if (pattern->len != smp->data.u.str.data) |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 537 | continue; |
| 538 | |
Willy Tarreau | 843b7cb | 2018-07-13 10:54:26 +0200 | [diff] [blame] | 539 | if (memcmp(pattern->ptr.str, smp->data.u.str.area, smp->data.u.str.data) == 0) { |
Willy Tarreau | f3045d2 | 2015-04-29 16:24:50 +0200 | [diff] [blame] | 540 | ret = pattern; |
| 541 | break; |
| 542 | } |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 543 | } |
| 544 | |
Willy Tarreau | 403bfbb | 2019-10-23 06:59:31 +0200 | [diff] [blame] | 545 | if (lru) |
Willy Tarreau | 3ee0de1 | 2020-11-02 15:26:51 +0100 | [diff] [blame] | 546 | lru64_commit(lru, ret, expr, expr->ref->revision, NULL); |
Willy Tarreau | f3045d2 | 2015-04-29 16:24:50 +0200 | [diff] [blame] | 547 | |
| 548 | return ret; |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 549 | } |
| 550 | |
| 551 | /* Executes a regex. It temporarily changes the data to add a trailing zero, |
Thierry Fournier | 8feaa66 | 2016-02-10 22:55:20 +0100 | [diff] [blame] | 552 | * and restores the previous character when leaving. This function fills |
| 553 | * a matching array. |
| 554 | */ |
| 555 | struct pattern *pat_match_regm(struct sample *smp, struct pattern_expr *expr, int fill) |
| 556 | { |
| 557 | struct pattern_list *lst; |
| 558 | struct pattern *pattern; |
| 559 | struct pattern *ret = NULL; |
| 560 | |
| 561 | list_for_each_entry(lst, &expr->patterns, list) { |
| 562 | pattern = &lst->pat; |
| 563 | |
Willy Tarreau | 843b7cb | 2018-07-13 10:54:26 +0200 | [diff] [blame] | 564 | if (regex_exec_match2(pattern->ptr.reg, smp->data.u.str.area, smp->data.u.str.data, |
Thierry Fournier | 8feaa66 | 2016-02-10 22:55:20 +0100 | [diff] [blame] | 565 | MAX_MATCH, pmatch, 0)) { |
| 566 | ret = pattern; |
| 567 | smp->ctx.a[0] = pmatch; |
| 568 | break; |
| 569 | } |
| 570 | } |
| 571 | |
| 572 | return ret; |
| 573 | } |
| 574 | |
| 575 | /* Executes a regex. It temporarily changes the data to add a trailing zero, |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 576 | * and restores the previous character when leaving. |
| 577 | */ |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 578 | struct pattern *pat_match_reg(struct sample *smp, struct pattern_expr *expr, int fill) |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 579 | { |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 580 | struct pattern_list *lst; |
| 581 | struct pattern *pattern; |
Willy Tarreau | f3045d2 | 2015-04-29 16:24:50 +0200 | [diff] [blame] | 582 | struct pattern *ret = NULL; |
| 583 | struct lru64 *lru = NULL; |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 584 | |
Willy Tarreau | f3045d2 | 2015-04-29 16:24:50 +0200 | [diff] [blame] | 585 | if (pat_lru_tree) { |
Willy Tarreau | aee9314 | 2015-05-04 17:18:42 +0200 | [diff] [blame] | 586 | unsigned long long seed = pat_lru_seed ^ (long)expr; |
Willy Tarreau | f3045d2 | 2015-04-29 16:24:50 +0200 | [diff] [blame] | 587 | |
Willy Tarreau | 843b7cb | 2018-07-13 10:54:26 +0200 | [diff] [blame] | 588 | lru = lru64_get(XXH64(smp->data.u.str.area, smp->data.u.str.data, seed), |
Willy Tarreau | 3ee0de1 | 2020-11-02 15:26:51 +0100 | [diff] [blame] | 589 | pat_lru_tree, expr, expr->ref->revision); |
Willy Tarreau | 403bfbb | 2019-10-23 06:59:31 +0200 | [diff] [blame] | 590 | if (lru && lru->domain) { |
Emeric Brun | b5997f7 | 2017-07-03 11:34:05 +0200 | [diff] [blame] | 591 | ret = lru->data; |
Emeric Brun | b5997f7 | 2017-07-03 11:34:05 +0200 | [diff] [blame] | 592 | return ret; |
| 593 | } |
Willy Tarreau | f3045d2 | 2015-04-29 16:24:50 +0200 | [diff] [blame] | 594 | } |
| 595 | |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 596 | list_for_each_entry(lst, &expr->patterns, list) { |
| 597 | pattern = &lst->pat; |
| 598 | |
Willy Tarreau | 843b7cb | 2018-07-13 10:54:26 +0200 | [diff] [blame] | 599 | if (regex_exec2(pattern->ptr.reg, smp->data.u.str.area, smp->data.u.str.data)) { |
Willy Tarreau | f3045d2 | 2015-04-29 16:24:50 +0200 | [diff] [blame] | 600 | ret = pattern; |
| 601 | break; |
| 602 | } |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 603 | } |
Willy Tarreau | f3045d2 | 2015-04-29 16:24:50 +0200 | [diff] [blame] | 604 | |
Willy Tarreau | 403bfbb | 2019-10-23 06:59:31 +0200 | [diff] [blame] | 605 | if (lru) |
Willy Tarreau | 3ee0de1 | 2020-11-02 15:26:51 +0100 | [diff] [blame] | 606 | lru64_commit(lru, ret, expr, expr->ref->revision, NULL); |
Willy Tarreau | f3045d2 | 2015-04-29 16:24:50 +0200 | [diff] [blame] | 607 | |
| 608 | return ret; |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 609 | } |
| 610 | |
| 611 | /* Checks that the pattern matches the beginning of the tested string. */ |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 612 | struct pattern *pat_match_beg(struct sample *smp, struct pattern_expr *expr, int fill) |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 613 | { |
| 614 | int icase; |
Willy Tarreau | b1dd9bf | 2014-05-10 08:53:48 +0200 | [diff] [blame] | 615 | struct ebmb_node *node; |
Willy Tarreau | b1dd9bf | 2014-05-10 08:53:48 +0200 | [diff] [blame] | 616 | struct pattern_tree *elt; |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 617 | struct pattern_list *lst; |
| 618 | struct pattern *pattern; |
Willy Tarreau | f3045d2 | 2015-04-29 16:24:50 +0200 | [diff] [blame] | 619 | struct pattern *ret = NULL; |
| 620 | struct lru64 *lru = NULL; |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 621 | |
Willy Tarreau | b1dd9bf | 2014-05-10 08:53:48 +0200 | [diff] [blame] | 622 | /* Lookup a string in the expression's pattern tree. */ |
| 623 | if (!eb_is_empty(&expr->pattern_tree)) { |
Christopher Faulet | b4cf7ab | 2020-06-30 18:52:32 +0200 | [diff] [blame] | 624 | char prev = 0; |
| 625 | |
| 626 | if (smp->data.u.str.data < smp->data.u.str.size) { |
| 627 | /* we may have to force a trailing zero on the test pattern and |
| 628 | * the buffer is large enough to accommodate it. |
| 629 | */ |
| 630 | prev = smp->data.u.str.area[smp->data.u.str.data]; |
| 631 | if (prev) |
| 632 | smp->data.u.str.area[smp->data.u.str.data] = '\0'; |
| 633 | } |
| 634 | else { |
| 635 | /* Otherwise, the sample is duplicated. A trailing zero |
| 636 | * is automatically added to the string. |
| 637 | */ |
| 638 | if (!smp_dup(smp)) |
| 639 | return NULL; |
| 640 | } |
| 641 | |
Willy Tarreau | 843b7cb | 2018-07-13 10:54:26 +0200 | [diff] [blame] | 642 | node = ebmb_lookup_longest(&expr->pattern_tree, |
| 643 | smp->data.u.str.area); |
Willy Tarreau | b1dd9bf | 2014-05-10 08:53:48 +0200 | [diff] [blame] | 644 | if (prev) |
Willy Tarreau | 843b7cb | 2018-07-13 10:54:26 +0200 | [diff] [blame] | 645 | smp->data.u.str.area[smp->data.u.str.data] = prev; |
Willy Tarreau | b1dd9bf | 2014-05-10 08:53:48 +0200 | [diff] [blame] | 646 | |
| 647 | if (node) { |
| 648 | if (fill) { |
| 649 | elt = ebmb_entry(node, struct pattern_tree, node); |
Thierry FOURNIER | 503bb09 | 2015-08-19 08:35:43 +0200 | [diff] [blame] | 650 | static_pattern.data = elt->data; |
Willy Tarreau | b1dd9bf | 2014-05-10 08:53:48 +0200 | [diff] [blame] | 651 | static_pattern.ref = elt->ref; |
| 652 | static_pattern.sflags = PAT_SF_TREE; |
| 653 | static_pattern.type = SMP_T_STR; |
| 654 | static_pattern.ptr.str = (char *)elt->node.key; |
| 655 | } |
| 656 | return &static_pattern; |
| 657 | } |
| 658 | } |
| 659 | |
| 660 | /* look in the list */ |
Willy Tarreau | f3045d2 | 2015-04-29 16:24:50 +0200 | [diff] [blame] | 661 | if (pat_lru_tree) { |
Willy Tarreau | aee9314 | 2015-05-04 17:18:42 +0200 | [diff] [blame] | 662 | unsigned long long seed = pat_lru_seed ^ (long)expr; |
Willy Tarreau | f3045d2 | 2015-04-29 16:24:50 +0200 | [diff] [blame] | 663 | |
Willy Tarreau | 843b7cb | 2018-07-13 10:54:26 +0200 | [diff] [blame] | 664 | lru = lru64_get(XXH64(smp->data.u.str.area, smp->data.u.str.data, seed), |
Willy Tarreau | 3ee0de1 | 2020-11-02 15:26:51 +0100 | [diff] [blame] | 665 | pat_lru_tree, expr, expr->ref->revision); |
Willy Tarreau | 403bfbb | 2019-10-23 06:59:31 +0200 | [diff] [blame] | 666 | if (lru && lru->domain) { |
Emeric Brun | b5997f7 | 2017-07-03 11:34:05 +0200 | [diff] [blame] | 667 | ret = lru->data; |
Emeric Brun | b5997f7 | 2017-07-03 11:34:05 +0200 | [diff] [blame] | 668 | return ret; |
| 669 | } |
Willy Tarreau | f3045d2 | 2015-04-29 16:24:50 +0200 | [diff] [blame] | 670 | } |
| 671 | |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 672 | list_for_each_entry(lst, &expr->patterns, list) { |
| 673 | pattern = &lst->pat; |
| 674 | |
Willy Tarreau | 843b7cb | 2018-07-13 10:54:26 +0200 | [diff] [blame] | 675 | if (pattern->len > smp->data.u.str.data) |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 676 | continue; |
| 677 | |
Thierry FOURNIER | e47e4e2 | 2014-04-28 11:18:57 +0200 | [diff] [blame] | 678 | icase = expr->mflags & PAT_MF_IGNORE_CASE; |
Willy Tarreau | 843b7cb | 2018-07-13 10:54:26 +0200 | [diff] [blame] | 679 | if ((icase && strncasecmp(pattern->ptr.str, smp->data.u.str.area, pattern->len) != 0) || |
| 680 | (!icase && strncmp(pattern->ptr.str, smp->data.u.str.area, pattern->len) != 0)) |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 681 | continue; |
| 682 | |
Willy Tarreau | f3045d2 | 2015-04-29 16:24:50 +0200 | [diff] [blame] | 683 | ret = pattern; |
| 684 | break; |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 685 | } |
Willy Tarreau | f3045d2 | 2015-04-29 16:24:50 +0200 | [diff] [blame] | 686 | |
Willy Tarreau | 403bfbb | 2019-10-23 06:59:31 +0200 | [diff] [blame] | 687 | if (lru) |
Willy Tarreau | 3ee0de1 | 2020-11-02 15:26:51 +0100 | [diff] [blame] | 688 | lru64_commit(lru, ret, expr, expr->ref->revision, NULL); |
Willy Tarreau | f3045d2 | 2015-04-29 16:24:50 +0200 | [diff] [blame] | 689 | |
| 690 | return ret; |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 691 | } |
| 692 | |
| 693 | /* Checks that the pattern matches the end of the tested string. */ |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 694 | struct pattern *pat_match_end(struct sample *smp, struct pattern_expr *expr, int fill) |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 695 | { |
| 696 | int icase; |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 697 | struct pattern_list *lst; |
| 698 | struct pattern *pattern; |
Willy Tarreau | f3045d2 | 2015-04-29 16:24:50 +0200 | [diff] [blame] | 699 | struct pattern *ret = NULL; |
| 700 | struct lru64 *lru = NULL; |
| 701 | |
| 702 | if (pat_lru_tree) { |
Willy Tarreau | aee9314 | 2015-05-04 17:18:42 +0200 | [diff] [blame] | 703 | unsigned long long seed = pat_lru_seed ^ (long)expr; |
Willy Tarreau | f3045d2 | 2015-04-29 16:24:50 +0200 | [diff] [blame] | 704 | |
Willy Tarreau | 843b7cb | 2018-07-13 10:54:26 +0200 | [diff] [blame] | 705 | lru = lru64_get(XXH64(smp->data.u.str.area, smp->data.u.str.data, seed), |
Willy Tarreau | 3ee0de1 | 2020-11-02 15:26:51 +0100 | [diff] [blame] | 706 | pat_lru_tree, expr, expr->ref->revision); |
Willy Tarreau | 403bfbb | 2019-10-23 06:59:31 +0200 | [diff] [blame] | 707 | if (lru && lru->domain) { |
Emeric Brun | b5997f7 | 2017-07-03 11:34:05 +0200 | [diff] [blame] | 708 | ret = lru->data; |
Emeric Brun | b5997f7 | 2017-07-03 11:34:05 +0200 | [diff] [blame] | 709 | return ret; |
| 710 | } |
Willy Tarreau | f3045d2 | 2015-04-29 16:24:50 +0200 | [diff] [blame] | 711 | } |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 712 | |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 713 | list_for_each_entry(lst, &expr->patterns, list) { |
| 714 | pattern = &lst->pat; |
| 715 | |
Willy Tarreau | 843b7cb | 2018-07-13 10:54:26 +0200 | [diff] [blame] | 716 | if (pattern->len > smp->data.u.str.data) |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 717 | continue; |
| 718 | |
Thierry FOURNIER | e47e4e2 | 2014-04-28 11:18:57 +0200 | [diff] [blame] | 719 | icase = expr->mflags & PAT_MF_IGNORE_CASE; |
Willy Tarreau | 843b7cb | 2018-07-13 10:54:26 +0200 | [diff] [blame] | 720 | if ((icase && strncasecmp(pattern->ptr.str, smp->data.u.str.area + smp->data.u.str.data - pattern->len, pattern->len) != 0) || |
| 721 | (!icase && strncmp(pattern->ptr.str, smp->data.u.str.area + smp->data.u.str.data - pattern->len, pattern->len) != 0)) |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 722 | continue; |
| 723 | |
Willy Tarreau | f3045d2 | 2015-04-29 16:24:50 +0200 | [diff] [blame] | 724 | ret = pattern; |
| 725 | break; |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 726 | } |
Willy Tarreau | f3045d2 | 2015-04-29 16:24:50 +0200 | [diff] [blame] | 727 | |
Willy Tarreau | 403bfbb | 2019-10-23 06:59:31 +0200 | [diff] [blame] | 728 | if (lru) |
Willy Tarreau | 3ee0de1 | 2020-11-02 15:26:51 +0100 | [diff] [blame] | 729 | lru64_commit(lru, ret, expr, expr->ref->revision, NULL); |
Willy Tarreau | f3045d2 | 2015-04-29 16:24:50 +0200 | [diff] [blame] | 730 | |
| 731 | return ret; |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 732 | } |
| 733 | |
| 734 | /* Checks that the pattern is included inside the tested string. |
| 735 | * NB: Suboptimal, should be rewritten using a Boyer-Moore method. |
| 736 | */ |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 737 | struct pattern *pat_match_sub(struct sample *smp, struct pattern_expr *expr, int fill) |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 738 | { |
| 739 | int icase; |
| 740 | char *end; |
| 741 | char *c; |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 742 | struct pattern_list *lst; |
| 743 | struct pattern *pattern; |
Willy Tarreau | f3045d2 | 2015-04-29 16:24:50 +0200 | [diff] [blame] | 744 | struct pattern *ret = NULL; |
| 745 | struct lru64 *lru = NULL; |
| 746 | |
| 747 | if (pat_lru_tree) { |
Willy Tarreau | aee9314 | 2015-05-04 17:18:42 +0200 | [diff] [blame] | 748 | unsigned long long seed = pat_lru_seed ^ (long)expr; |
Willy Tarreau | f3045d2 | 2015-04-29 16:24:50 +0200 | [diff] [blame] | 749 | |
Willy Tarreau | 843b7cb | 2018-07-13 10:54:26 +0200 | [diff] [blame] | 750 | lru = lru64_get(XXH64(smp->data.u.str.area, smp->data.u.str.data, seed), |
Willy Tarreau | 3ee0de1 | 2020-11-02 15:26:51 +0100 | [diff] [blame] | 751 | pat_lru_tree, expr, expr->ref->revision); |
Willy Tarreau | 403bfbb | 2019-10-23 06:59:31 +0200 | [diff] [blame] | 752 | if (lru && lru->domain) { |
Emeric Brun | b5997f7 | 2017-07-03 11:34:05 +0200 | [diff] [blame] | 753 | ret = lru->data; |
Emeric Brun | b5997f7 | 2017-07-03 11:34:05 +0200 | [diff] [blame] | 754 | return ret; |
| 755 | } |
Willy Tarreau | f3045d2 | 2015-04-29 16:24:50 +0200 | [diff] [blame] | 756 | } |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 757 | |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 758 | list_for_each_entry(lst, &expr->patterns, list) { |
| 759 | pattern = &lst->pat; |
| 760 | |
Willy Tarreau | 843b7cb | 2018-07-13 10:54:26 +0200 | [diff] [blame] | 761 | if (pattern->len > smp->data.u.str.data) |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 762 | continue; |
| 763 | |
Willy Tarreau | 843b7cb | 2018-07-13 10:54:26 +0200 | [diff] [blame] | 764 | end = smp->data.u.str.area + smp->data.u.str.data - pattern->len; |
Thierry FOURNIER | e47e4e2 | 2014-04-28 11:18:57 +0200 | [diff] [blame] | 765 | icase = expr->mflags & PAT_MF_IGNORE_CASE; |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 766 | if (icase) { |
Willy Tarreau | 843b7cb | 2018-07-13 10:54:26 +0200 | [diff] [blame] | 767 | for (c = smp->data.u.str.area; c <= end; c++) { |
Willy Tarreau | f278eec | 2020-07-05 21:46:32 +0200 | [diff] [blame] | 768 | if (tolower((unsigned char)*c) != tolower((unsigned char)*pattern->ptr.str)) |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 769 | continue; |
Willy Tarreau | f3045d2 | 2015-04-29 16:24:50 +0200 | [diff] [blame] | 770 | if (strncasecmp(pattern->ptr.str, c, pattern->len) == 0) { |
| 771 | ret = pattern; |
| 772 | goto leave; |
| 773 | } |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 774 | } |
| 775 | } else { |
Willy Tarreau | 843b7cb | 2018-07-13 10:54:26 +0200 | [diff] [blame] | 776 | for (c = smp->data.u.str.area; c <= end; c++) { |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 777 | if (*c != *pattern->ptr.str) |
| 778 | continue; |
Willy Tarreau | f3045d2 | 2015-04-29 16:24:50 +0200 | [diff] [blame] | 779 | if (strncmp(pattern->ptr.str, c, pattern->len) == 0) { |
| 780 | ret = pattern; |
| 781 | goto leave; |
| 782 | } |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 783 | } |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 784 | } |
| 785 | } |
Willy Tarreau | f3045d2 | 2015-04-29 16:24:50 +0200 | [diff] [blame] | 786 | leave: |
Willy Tarreau | 403bfbb | 2019-10-23 06:59:31 +0200 | [diff] [blame] | 787 | if (lru) |
Willy Tarreau | 3ee0de1 | 2020-11-02 15:26:51 +0100 | [diff] [blame] | 788 | lru64_commit(lru, ret, expr, expr->ref->revision, NULL); |
Willy Tarreau | f3045d2 | 2015-04-29 16:24:50 +0200 | [diff] [blame] | 789 | |
| 790 | return ret; |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 791 | } |
| 792 | |
| 793 | /* This one is used by other real functions. It checks that the pattern is |
| 794 | * included inside the tested string, but enclosed between the specified |
| 795 | * delimiters or at the beginning or end of the string. The delimiters are |
| 796 | * provided as an unsigned int made by make_4delim() and match up to 4 different |
| 797 | * delimiters. Delimiters are stripped at the beginning and end of the pattern. |
| 798 | */ |
Thierry FOURNIER | e47e4e2 | 2014-04-28 11:18:57 +0200 | [diff] [blame] | 799 | static int match_word(struct sample *smp, struct pattern *pattern, int mflags, unsigned int delimiters) |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 800 | { |
| 801 | int may_match, icase; |
| 802 | char *c, *end; |
| 803 | char *ps; |
| 804 | int pl; |
| 805 | |
| 806 | pl = pattern->len; |
| 807 | ps = pattern->ptr.str; |
| 808 | |
| 809 | while (pl > 0 && is_delimiter(*ps, delimiters)) { |
| 810 | pl--; |
| 811 | ps++; |
| 812 | } |
| 813 | |
| 814 | while (pl > 0 && is_delimiter(ps[pl - 1], delimiters)) |
| 815 | pl--; |
| 816 | |
Willy Tarreau | 843b7cb | 2018-07-13 10:54:26 +0200 | [diff] [blame] | 817 | if (pl > smp->data.u.str.data) |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 818 | return PAT_NOMATCH; |
| 819 | |
| 820 | may_match = 1; |
Thierry FOURNIER | e47e4e2 | 2014-04-28 11:18:57 +0200 | [diff] [blame] | 821 | icase = mflags & PAT_MF_IGNORE_CASE; |
Willy Tarreau | 843b7cb | 2018-07-13 10:54:26 +0200 | [diff] [blame] | 822 | end = smp->data.u.str.area + smp->data.u.str.data - pl; |
| 823 | for (c = smp->data.u.str.area; c <= end; c++) { |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 824 | if (is_delimiter(*c, delimiters)) { |
| 825 | may_match = 1; |
| 826 | continue; |
| 827 | } |
| 828 | |
| 829 | if (!may_match) |
| 830 | continue; |
| 831 | |
| 832 | if (icase) { |
Willy Tarreau | f278eec | 2020-07-05 21:46:32 +0200 | [diff] [blame] | 833 | if ((tolower((unsigned char)*c) == tolower((unsigned char)*ps)) && |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 834 | (strncasecmp(ps, c, pl) == 0) && |
| 835 | (c == end || is_delimiter(c[pl], delimiters))) |
| 836 | return PAT_MATCH; |
| 837 | } else { |
| 838 | if ((*c == *ps) && |
| 839 | (strncmp(ps, c, pl) == 0) && |
| 840 | (c == end || is_delimiter(c[pl], delimiters))) |
| 841 | return PAT_MATCH; |
| 842 | } |
| 843 | may_match = 0; |
| 844 | } |
| 845 | return PAT_NOMATCH; |
| 846 | } |
| 847 | |
| 848 | /* Checks that the pattern is included inside the tested string, but enclosed |
| 849 | * between the delimiters '?' or '/' or at the beginning or end of the string. |
| 850 | * Delimiters at the beginning or end of the pattern are ignored. |
| 851 | */ |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 852 | struct pattern *pat_match_dir(struct sample *smp, struct pattern_expr *expr, int fill) |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 853 | { |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 854 | struct pattern_list *lst; |
| 855 | struct pattern *pattern; |
| 856 | |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 857 | list_for_each_entry(lst, &expr->patterns, list) { |
| 858 | pattern = &lst->pat; |
Thierry FOURNIER | e47e4e2 | 2014-04-28 11:18:57 +0200 | [diff] [blame] | 859 | if (match_word(smp, pattern, expr->mflags, make_4delim('/', '?', '?', '?'))) |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 860 | return pattern; |
| 861 | } |
| 862 | return NULL; |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 863 | } |
| 864 | |
| 865 | /* Checks that the pattern is included inside the tested string, but enclosed |
| 866 | * between the delmiters '/', '?', '.' or ":" or at the beginning or end of |
| 867 | * the string. Delimiters at the beginning or end of the pattern are ignored. |
| 868 | */ |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 869 | struct pattern *pat_match_dom(struct sample *smp, struct pattern_expr *expr, int fill) |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 870 | { |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 871 | struct pattern_list *lst; |
| 872 | struct pattern *pattern; |
| 873 | |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 874 | list_for_each_entry(lst, &expr->patterns, list) { |
| 875 | pattern = &lst->pat; |
Thierry FOURNIER | e47e4e2 | 2014-04-28 11:18:57 +0200 | [diff] [blame] | 876 | if (match_word(smp, pattern, expr->mflags, make_4delim('/', '?', '.', ':'))) |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 877 | return pattern; |
| 878 | } |
| 879 | return NULL; |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 880 | } |
| 881 | |
| 882 | /* Checks that the integer in <test> is included between min and max */ |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 883 | struct pattern *pat_match_int(struct sample *smp, struct pattern_expr *expr, int fill) |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 884 | { |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 885 | struct pattern_list *lst; |
| 886 | struct pattern *pattern; |
| 887 | |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 888 | list_for_each_entry(lst, &expr->patterns, list) { |
| 889 | pattern = &lst->pat; |
Thierry FOURNIER | 136f9d3 | 2015-08-19 09:07:19 +0200 | [diff] [blame] | 890 | if ((!pattern->val.range.min_set || pattern->val.range.min <= smp->data.u.sint) && |
| 891 | (!pattern->val.range.max_set || smp->data.u.sint <= pattern->val.range.max)) |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 892 | return pattern; |
| 893 | } |
| 894 | return NULL; |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 895 | } |
| 896 | |
| 897 | /* Checks that the length of the pattern in <test> is included between min and max */ |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 898 | struct pattern *pat_match_len(struct sample *smp, struct pattern_expr *expr, int fill) |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 899 | { |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 900 | struct pattern_list *lst; |
| 901 | struct pattern *pattern; |
| 902 | |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 903 | list_for_each_entry(lst, &expr->patterns, list) { |
| 904 | pattern = &lst->pat; |
Willy Tarreau | 843b7cb | 2018-07-13 10:54:26 +0200 | [diff] [blame] | 905 | if ((!pattern->val.range.min_set || pattern->val.range.min <= smp->data.u.str.data) && |
| 906 | (!pattern->val.range.max_set || smp->data.u.str.data <= pattern->val.range.max)) |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 907 | return pattern; |
| 908 | } |
| 909 | return NULL; |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 910 | } |
| 911 | |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 912 | struct pattern *pat_match_ip(struct sample *smp, struct pattern_expr *expr, int fill) |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 913 | { |
| 914 | unsigned int v4; /* in network byte order */ |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 915 | struct in6_addr tmp6; |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 916 | struct in_addr *s; |
| 917 | struct ebmb_node *node; |
| 918 | struct pattern_tree *elt; |
| 919 | struct pattern_list *lst; |
| 920 | struct pattern *pattern; |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 921 | |
Thierry FOURNIER | 33a7433 | 2013-12-19 23:54:54 +0100 | [diff] [blame] | 922 | /* The input sample is IPv4. Try to match in the trees. */ |
Thierry FOURNIER | 8c542ca | 2015-08-19 09:00:18 +0200 | [diff] [blame] | 923 | if (smp->data.type == SMP_T_IPV4) { |
Thierry FOURNIER | 33a7433 | 2013-12-19 23:54:54 +0100 | [diff] [blame] | 924 | /* Lookup an IPv4 address in the expression's pattern tree using |
| 925 | * the longest match method. |
| 926 | */ |
Thierry FOURNIER | 136f9d3 | 2015-08-19 09:07:19 +0200 | [diff] [blame] | 927 | s = &smp->data.u.ipv4; |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 928 | node = ebmb_lookup_longest(&expr->pattern_tree, &s->s_addr); |
| 929 | if (node) { |
| 930 | if (fill) { |
| 931 | elt = ebmb_entry(node, struct pattern_tree, node); |
Thierry FOURNIER | 503bb09 | 2015-08-19 08:35:43 +0200 | [diff] [blame] | 932 | static_pattern.data = elt->data; |
Thierry FOURNIER | 6bb53ff | 2014-01-28 15:54:36 +0100 | [diff] [blame] | 933 | static_pattern.ref = elt->ref; |
Thierry FOURNIER | e47e4e2 | 2014-04-28 11:18:57 +0200 | [diff] [blame] | 934 | static_pattern.sflags = PAT_SF_TREE; |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 935 | static_pattern.type = SMP_T_IPV4; |
Willy Tarreau | 296cfd1 | 2020-02-25 09:58:41 +0100 | [diff] [blame] | 936 | static_pattern.val.ipv4.addr.s_addr = read_u32(elt->node.key); |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 937 | if (!cidr2dotted(elt->node.node.pfx, &static_pattern.val.ipv4.mask)) |
| 938 | return NULL; |
| 939 | } |
| 940 | return &static_pattern; |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 941 | } |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 942 | |
Thierry FOURNIER | 33a7433 | 2013-12-19 23:54:54 +0100 | [diff] [blame] | 943 | /* The IPv4 sample dont match the IPv4 tree. Convert the IPv4 |
| 944 | * sample address to IPv6 with the mapping method using the ::ffff: |
| 945 | * prefix, and try to lookup in the IPv6 tree. |
| 946 | */ |
| 947 | memset(&tmp6, 0, 10); |
Willy Tarreau | 296cfd1 | 2020-02-25 09:58:41 +0100 | [diff] [blame] | 948 | write_u16(&tmp6.s6_addr[10], htons(0xffff)); |
| 949 | write_u32(&tmp6.s6_addr[12], smp->data.u.ipv4.s_addr); |
Thierry FOURNIER | 33a7433 | 2013-12-19 23:54:54 +0100 | [diff] [blame] | 950 | node = ebmb_lookup_longest(&expr->pattern_tree_2, &tmp6); |
| 951 | if (node) { |
| 952 | if (fill) { |
| 953 | elt = ebmb_entry(node, struct pattern_tree, node); |
Thierry FOURNIER | 503bb09 | 2015-08-19 08:35:43 +0200 | [diff] [blame] | 954 | static_pattern.data = elt->data; |
Thierry FOURNIER | 6bb53ff | 2014-01-28 15:54:36 +0100 | [diff] [blame] | 955 | static_pattern.ref = elt->ref; |
Thierry FOURNIER | e47e4e2 | 2014-04-28 11:18:57 +0200 | [diff] [blame] | 956 | static_pattern.sflags = PAT_SF_TREE; |
Thierry FOURNIER | 33a7433 | 2013-12-19 23:54:54 +0100 | [diff] [blame] | 957 | static_pattern.type = SMP_T_IPV6; |
Willy Tarreau | 296cfd1 | 2020-02-25 09:58:41 +0100 | [diff] [blame] | 958 | memcpy(&static_pattern.val.ipv6.addr, elt->node.key, 16); |
Thierry FOURNIER | 33a7433 | 2013-12-19 23:54:54 +0100 | [diff] [blame] | 959 | static_pattern.val.ipv6.mask = elt->node.node.pfx; |
| 960 | } |
| 961 | return &static_pattern; |
| 962 | } |
| 963 | } |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 964 | |
Thierry FOURNIER | 33a7433 | 2013-12-19 23:54:54 +0100 | [diff] [blame] | 965 | /* The input sample is IPv6. Try to match in the trees. */ |
Thierry FOURNIER | 8c542ca | 2015-08-19 09:00:18 +0200 | [diff] [blame] | 966 | if (smp->data.type == SMP_T_IPV6) { |
Thierry FOURNIER | 33a7433 | 2013-12-19 23:54:54 +0100 | [diff] [blame] | 967 | /* Lookup an IPv6 address in the expression's pattern tree using |
| 968 | * the longest match method. |
| 969 | */ |
Thierry FOURNIER | 136f9d3 | 2015-08-19 09:07:19 +0200 | [diff] [blame] | 970 | node = ebmb_lookup_longest(&expr->pattern_tree_2, &smp->data.u.ipv6); |
Thierry FOURNIER | 33a7433 | 2013-12-19 23:54:54 +0100 | [diff] [blame] | 971 | if (node) { |
| 972 | if (fill) { |
| 973 | elt = ebmb_entry(node, struct pattern_tree, node); |
Thierry FOURNIER | 503bb09 | 2015-08-19 08:35:43 +0200 | [diff] [blame] | 974 | static_pattern.data = elt->data; |
Thierry FOURNIER | 6bb53ff | 2014-01-28 15:54:36 +0100 | [diff] [blame] | 975 | static_pattern.ref = elt->ref; |
Thierry FOURNIER | e47e4e2 | 2014-04-28 11:18:57 +0200 | [diff] [blame] | 976 | static_pattern.sflags = PAT_SF_TREE; |
Thierry FOURNIER | 33a7433 | 2013-12-19 23:54:54 +0100 | [diff] [blame] | 977 | static_pattern.type = SMP_T_IPV6; |
Willy Tarreau | 296cfd1 | 2020-02-25 09:58:41 +0100 | [diff] [blame] | 978 | memcpy(&static_pattern.val.ipv6.addr, elt->node.key, 16); |
Thierry FOURNIER | 33a7433 | 2013-12-19 23:54:54 +0100 | [diff] [blame] | 979 | static_pattern.val.ipv6.mask = elt->node.node.pfx; |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 980 | } |
Thierry FOURNIER | 33a7433 | 2013-12-19 23:54:54 +0100 | [diff] [blame] | 981 | return &static_pattern; |
| 982 | } |
| 983 | |
| 984 | /* Try to convert 6 to 4 when the start of the ipv6 address match the |
| 985 | * following forms : |
| 986 | * - ::ffff:ip:v4 (ipv4 mapped) |
| 987 | * - ::0000:ip:v4 (old ipv4 mapped) |
| 988 | * - 2002:ip:v4:: (6to4) |
| 989 | */ |
Willy Tarreau | 296cfd1 | 2020-02-25 09:58:41 +0100 | [diff] [blame] | 990 | if ((read_u64(&smp->data.u.ipv6.s6_addr[0]) == 0 && |
| 991 | (read_u32(&smp->data.u.ipv6.s6_addr[8]) == 0 || |
| 992 | read_u32(&smp->data.u.ipv6.s6_addr[8]) == htonl(0xFFFF))) || |
| 993 | read_u16(&smp->data.u.ipv6.s6_addr[0]) == htons(0x2002)) { |
| 994 | if (read_u32(&smp->data.u.ipv6.s6_addr[0]) == 0) |
| 995 | v4 = read_u32(&smp->data.u.ipv6.s6_addr[12]); |
Thierry FOURNIER | 33a7433 | 2013-12-19 23:54:54 +0100 | [diff] [blame] | 996 | else |
Willy Tarreau | 296cfd1 | 2020-02-25 09:58:41 +0100 | [diff] [blame] | 997 | v4 = htonl((ntohs(read_u16(&smp->data.u.ipv6.s6_addr[2])) << 16) + |
| 998 | ntohs(read_u16(&smp->data.u.ipv6.s6_addr[4]))); |
Thierry FOURNIER | 33a7433 | 2013-12-19 23:54:54 +0100 | [diff] [blame] | 999 | |
| 1000 | /* Lookup an IPv4 address in the expression's pattern tree using the longest |
| 1001 | * match method. |
| 1002 | */ |
| 1003 | node = ebmb_lookup_longest(&expr->pattern_tree, &v4); |
| 1004 | if (node) { |
| 1005 | if (fill) { |
| 1006 | elt = ebmb_entry(node, struct pattern_tree, node); |
Thierry FOURNIER | 503bb09 | 2015-08-19 08:35:43 +0200 | [diff] [blame] | 1007 | static_pattern.data = elt->data; |
Thierry FOURNIER | 6bb53ff | 2014-01-28 15:54:36 +0100 | [diff] [blame] | 1008 | static_pattern.ref = elt->ref; |
Thierry FOURNIER | e47e4e2 | 2014-04-28 11:18:57 +0200 | [diff] [blame] | 1009 | static_pattern.sflags = PAT_SF_TREE; |
Thierry FOURNIER | 33a7433 | 2013-12-19 23:54:54 +0100 | [diff] [blame] | 1010 | static_pattern.type = SMP_T_IPV4; |
Willy Tarreau | 296cfd1 | 2020-02-25 09:58:41 +0100 | [diff] [blame] | 1011 | static_pattern.val.ipv4.addr.s_addr = read_u32(elt->node.key); |
Thierry FOURNIER | 33a7433 | 2013-12-19 23:54:54 +0100 | [diff] [blame] | 1012 | if (!cidr2dotted(elt->node.node.pfx, &static_pattern.val.ipv4.mask)) |
| 1013 | return NULL; |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 1014 | } |
Thierry FOURNIER | 33a7433 | 2013-12-19 23:54:54 +0100 | [diff] [blame] | 1015 | return &static_pattern; |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 1016 | } |
Thierry FOURNIER | 33a7433 | 2013-12-19 23:54:54 +0100 | [diff] [blame] | 1017 | } |
| 1018 | } |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 1019 | |
Thierry FOURNIER | 33a7433 | 2013-12-19 23:54:54 +0100 | [diff] [blame] | 1020 | /* Lookup in the list. the list contain only IPv4 patterns */ |
| 1021 | list_for_each_entry(lst, &expr->patterns, list) { |
| 1022 | pattern = &lst->pat; |
| 1023 | |
| 1024 | /* The input sample is IPv4, use it as is. */ |
Thierry FOURNIER | 8c542ca | 2015-08-19 09:00:18 +0200 | [diff] [blame] | 1025 | if (smp->data.type == SMP_T_IPV4) { |
Thierry FOURNIER | 136f9d3 | 2015-08-19 09:07:19 +0200 | [diff] [blame] | 1026 | v4 = smp->data.u.ipv4.s_addr; |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 1027 | } |
Thierry FOURNIER | 8c542ca | 2015-08-19 09:00:18 +0200 | [diff] [blame] | 1028 | else if (smp->data.type == SMP_T_IPV6) { |
Thierry FOURNIER | 33a7433 | 2013-12-19 23:54:54 +0100 | [diff] [blame] | 1029 | /* v4 match on a V6 sample. We want to check at least for |
| 1030 | * the following forms : |
| 1031 | * - ::ffff:ip:v4 (ipv4 mapped) |
| 1032 | * - ::0000:ip:v4 (old ipv4 mapped) |
| 1033 | * - 2002:ip:v4:: (6to4) |
| 1034 | */ |
Willy Tarreau | 296cfd1 | 2020-02-25 09:58:41 +0100 | [diff] [blame] | 1035 | if (read_u64(&smp->data.u.ipv6.s6_addr[0]) == 0 && |
| 1036 | (read_u32(&smp->data.u.ipv6.s6_addr[8]) == 0 || |
| 1037 | read_u32(&smp->data.u.ipv6.s6_addr[8]) == htonl(0xFFFF))) { |
| 1038 | v4 = read_u32(&smp->data.u.ipv6.s6_addr[12]); |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 1039 | } |
Willy Tarreau | 296cfd1 | 2020-02-25 09:58:41 +0100 | [diff] [blame] | 1040 | else if (read_u16(&smp->data.u.ipv6.s6_addr[0]) == htons(0x2002)) { |
| 1041 | v4 = htonl((ntohs(read_u16(&smp->data.u.ipv6.s6_addr[2])) << 16) + |
| 1042 | ntohs(read_u16(&smp->data.u.ipv6.s6_addr[4]))); |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 1043 | } |
Thierry FOURNIER | 33a7433 | 2013-12-19 23:54:54 +0100 | [diff] [blame] | 1044 | else |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 1045 | continue; |
Andreas Seltenreich | f065319 | 2016-03-03 20:08:35 +0100 | [diff] [blame] | 1046 | } else { |
| 1047 | /* impossible */ |
| 1048 | continue; |
Thierry FOURNIER | 33a7433 | 2013-12-19 23:54:54 +0100 | [diff] [blame] | 1049 | } |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 1050 | |
Thierry FOURNIER | 33a7433 | 2013-12-19 23:54:54 +0100 | [diff] [blame] | 1051 | /* Check if the input sample match the current pattern. */ |
| 1052 | if (((v4 ^ pattern->val.ipv4.addr.s_addr) & pattern->val.ipv4.mask.s_addr) == 0) |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 1053 | return pattern; |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 1054 | } |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 1055 | return NULL; |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 1056 | } |
| 1057 | |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 1058 | void free_pattern_tree(struct eb_root *root) |
| 1059 | { |
| 1060 | struct eb_node *node, *next; |
Thierry FOURNIER | e1bcac5 | 2013-12-13 16:09:50 +0100 | [diff] [blame] | 1061 | struct pattern_tree *elt; |
Thierry FOURNIER | 3ce88c7 | 2013-12-09 11:29:46 +0100 | [diff] [blame] | 1062 | |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 1063 | node = eb_first(root); |
| 1064 | while (node) { |
| 1065 | next = eb_next(node); |
| 1066 | eb_delete(node); |
Thierry FOURNIER | e1bcac5 | 2013-12-13 16:09:50 +0100 | [diff] [blame] | 1067 | elt = container_of(node, struct pattern_tree, node); |
Willy Tarreau | 4bdd0a1 | 2020-11-02 12:10:48 +0100 | [diff] [blame] | 1068 | LIST_DEL(&elt->from_ref); |
Thierry FOURNIER | 503bb09 | 2015-08-19 08:35:43 +0200 | [diff] [blame] | 1069 | free(elt->data); |
Thierry FOURNIER | 3ce88c7 | 2013-12-09 11:29:46 +0100 | [diff] [blame] | 1070 | free(elt); |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 1071 | node = next; |
| 1072 | } |
| 1073 | } |
| 1074 | |
Willy Tarreau | 6d8a689 | 2020-11-02 19:26:02 +0100 | [diff] [blame] | 1075 | void pat_prune_gen(struct pattern_expr *expr) |
Thierry FOURNIER | d163e1c | 2013-11-28 11:41:23 +0100 | [diff] [blame] | 1076 | { |
Thierry FOURNIER | 6f7203d | 2014-01-14 16:24:51 +0100 | [diff] [blame] | 1077 | struct pattern_list *pat, *tmp; |
| 1078 | |
| 1079 | list_for_each_entry_safe(pat, tmp, &expr->patterns, list) { |
Christopher Faulet | 6cfc851 | 2020-09-09 16:09:44 +0200 | [diff] [blame] | 1080 | LIST_DEL(&pat->list); |
Willy Tarreau | 4bdd0a1 | 2020-11-02 12:10:48 +0100 | [diff] [blame] | 1081 | LIST_DEL(&pat->from_ref); |
Willy Tarreau | 6d8a689 | 2020-11-02 19:26:02 +0100 | [diff] [blame] | 1082 | if (pat->pat.sflags & PAT_SF_REGFREE) |
| 1083 | regex_free(pat->pat.ptr.ptr); |
| 1084 | else |
| 1085 | free(pat->pat.ptr.ptr); |
Thierry FOURNIER | 503bb09 | 2015-08-19 08:35:43 +0200 | [diff] [blame] | 1086 | free(pat->pat.data); |
Thierry FOURNIER | 6f7203d | 2014-01-14 16:24:51 +0100 | [diff] [blame] | 1087 | free(pat); |
| 1088 | } |
| 1089 | |
Thierry FOURNIER | d163e1c | 2013-11-28 11:41:23 +0100 | [diff] [blame] | 1090 | free_pattern_tree(&expr->pattern_tree); |
Thierry FOURNIER | 33a7433 | 2013-12-19 23:54:54 +0100 | [diff] [blame] | 1091 | free_pattern_tree(&expr->pattern_tree_2); |
Thierry FOURNIER | d163e1c | 2013-11-28 11:41:23 +0100 | [diff] [blame] | 1092 | LIST_INIT(&expr->patterns); |
Willy Tarreau | 3ee0de1 | 2020-11-02 15:26:51 +0100 | [diff] [blame] | 1093 | expr->ref->revision = rdtsc(); |
Thierry FOURNIER | d163e1c | 2013-11-28 11:41:23 +0100 | [diff] [blame] | 1094 | } |
| 1095 | |
Thierry FOURNIER | b9b0846 | 2013-12-13 15:12:32 +0100 | [diff] [blame] | 1096 | /* |
| 1097 | * |
| 1098 | * The following functions are used for the pattern indexation |
| 1099 | * |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 1100 | */ |
Thierry FOURNIER | b9b0846 | 2013-12-13 15:12:32 +0100 | [diff] [blame] | 1101 | |
| 1102 | int pat_idx_list_val(struct pattern_expr *expr, struct pattern *pat, char **err) |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 1103 | { |
Thierry FOURNIER | b9b0846 | 2013-12-13 15:12:32 +0100 | [diff] [blame] | 1104 | struct pattern_list *patl; |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 1105 | |
Thierry FOURNIER | b9b0846 | 2013-12-13 15:12:32 +0100 | [diff] [blame] | 1106 | /* allocate pattern */ |
| 1107 | patl = calloc(1, sizeof(*patl)); |
| 1108 | if (!patl) { |
| 1109 | memprintf(err, "out of memory while indexing pattern"); |
Thierry FOURNIER | 972028f | 2014-01-23 17:53:31 +0100 | [diff] [blame] | 1110 | return 0; |
| 1111 | } |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 1112 | |
Thierry FOURNIER | b9b0846 | 2013-12-13 15:12:32 +0100 | [diff] [blame] | 1113 | /* duplicate pattern */ |
| 1114 | memcpy(&patl->pat, pat, sizeof(*pat)); |
Thierry FOURNIER | 7148ce6 | 2013-12-06 19:06:43 +0100 | [diff] [blame] | 1115 | |
Thierry FOURNIER | b9b0846 | 2013-12-13 15:12:32 +0100 | [diff] [blame] | 1116 | /* chain pattern in the expression */ |
| 1117 | LIST_ADDQ(&expr->patterns, &patl->list); |
Willy Tarreau | 4bdd0a1 | 2020-11-02 12:10:48 +0100 | [diff] [blame] | 1118 | /* and from the reference */ |
| 1119 | LIST_ADDQ(&pat->ref->list_head, &patl->from_ref); |
Willy Tarreau | 3ee0de1 | 2020-11-02 15:26:51 +0100 | [diff] [blame] | 1120 | expr->ref->revision = rdtsc(); |
Thierry FOURNIER | b9b0846 | 2013-12-13 15:12:32 +0100 | [diff] [blame] | 1121 | |
| 1122 | /* that's ok */ |
| 1123 | return 1; |
| 1124 | } |
| 1125 | |
| 1126 | int pat_idx_list_ptr(struct pattern_expr *expr, struct pattern *pat, char **err) |
| 1127 | { |
| 1128 | struct pattern_list *patl; |
| 1129 | |
| 1130 | /* allocate pattern */ |
| 1131 | patl = calloc(1, sizeof(*patl)); |
Thierry FOURNIER | 8aa8384 | 2015-02-06 17:50:55 +0100 | [diff] [blame] | 1132 | if (!patl) { |
| 1133 | memprintf(err, "out of memory while indexing pattern"); |
Thierry FOURNIER | 972028f | 2014-01-23 17:53:31 +0100 | [diff] [blame] | 1134 | return 0; |
Thierry FOURNIER | 8aa8384 | 2015-02-06 17:50:55 +0100 | [diff] [blame] | 1135 | } |
Thierry FOURNIER | 7148ce6 | 2013-12-06 19:06:43 +0100 | [diff] [blame] | 1136 | |
Thierry FOURNIER | b9b0846 | 2013-12-13 15:12:32 +0100 | [diff] [blame] | 1137 | /* duplicate pattern */ |
| 1138 | memcpy(&patl->pat, pat, sizeof(*pat)); |
| 1139 | patl->pat.ptr.ptr = malloc(patl->pat.len); |
| 1140 | if (!patl->pat.ptr.ptr) { |
| 1141 | free(patl); |
| 1142 | memprintf(err, "out of memory while indexing pattern"); |
| 1143 | return 0; |
| 1144 | } |
| 1145 | memcpy(patl->pat.ptr.ptr, pat->ptr.ptr, pat->len); |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 1146 | |
Thierry FOURNIER | b9b0846 | 2013-12-13 15:12:32 +0100 | [diff] [blame] | 1147 | /* chain pattern in the expression */ |
| 1148 | LIST_ADDQ(&expr->patterns, &patl->list); |
Willy Tarreau | 4bdd0a1 | 2020-11-02 12:10:48 +0100 | [diff] [blame] | 1149 | /* and from the reference */ |
| 1150 | LIST_ADDQ(&pat->ref->list_head, &patl->from_ref); |
Willy Tarreau | 3ee0de1 | 2020-11-02 15:26:51 +0100 | [diff] [blame] | 1151 | expr->ref->revision = rdtsc(); |
Thierry FOURNIER | 7148ce6 | 2013-12-06 19:06:43 +0100 | [diff] [blame] | 1152 | |
Thierry FOURNIER | b9b0846 | 2013-12-13 15:12:32 +0100 | [diff] [blame] | 1153 | /* that's ok */ |
| 1154 | return 1; |
| 1155 | } |
Thierry FOURNIER | 7148ce6 | 2013-12-06 19:06:43 +0100 | [diff] [blame] | 1156 | |
Thierry FOURNIER | b9b0846 | 2013-12-13 15:12:32 +0100 | [diff] [blame] | 1157 | int pat_idx_list_str(struct pattern_expr *expr, struct pattern *pat, char **err) |
| 1158 | { |
| 1159 | struct pattern_list *patl; |
Thierry FOURNIER | 7148ce6 | 2013-12-06 19:06:43 +0100 | [diff] [blame] | 1160 | |
Thierry FOURNIER | b9b0846 | 2013-12-13 15:12:32 +0100 | [diff] [blame] | 1161 | /* allocate pattern */ |
| 1162 | patl = calloc(1, sizeof(*patl)); |
| 1163 | if (!patl) { |
| 1164 | memprintf(err, "out of memory while indexing pattern"); |
| 1165 | return 0; |
| 1166 | } |
| 1167 | |
| 1168 | /* duplicate pattern */ |
| 1169 | memcpy(&patl->pat, pat, sizeof(*pat)); |
| 1170 | patl->pat.ptr.str = malloc(patl->pat.len + 1); |
| 1171 | if (!patl->pat.ptr.str) { |
| 1172 | free(patl); |
| 1173 | memprintf(err, "out of memory while indexing pattern"); |
| 1174 | return 0; |
| 1175 | } |
| 1176 | memcpy(patl->pat.ptr.ptr, pat->ptr.ptr, pat->len); |
| 1177 | patl->pat.ptr.str[patl->pat.len] = '\0'; |
Thierry FOURNIER | 7148ce6 | 2013-12-06 19:06:43 +0100 | [diff] [blame] | 1178 | |
Thierry FOURNIER | b9b0846 | 2013-12-13 15:12:32 +0100 | [diff] [blame] | 1179 | /* chain pattern in the expression */ |
| 1180 | LIST_ADDQ(&expr->patterns, &patl->list); |
Willy Tarreau | 4bdd0a1 | 2020-11-02 12:10:48 +0100 | [diff] [blame] | 1181 | /* and from the reference */ |
| 1182 | LIST_ADDQ(&pat->ref->list_head, &patl->from_ref); |
Willy Tarreau | 3ee0de1 | 2020-11-02 15:26:51 +0100 | [diff] [blame] | 1183 | expr->ref->revision = rdtsc(); |
Thierry FOURNIER | 7148ce6 | 2013-12-06 19:06:43 +0100 | [diff] [blame] | 1184 | |
Thierry FOURNIER | b9b0846 | 2013-12-13 15:12:32 +0100 | [diff] [blame] | 1185 | /* that's ok */ |
| 1186 | return 1; |
| 1187 | } |
| 1188 | |
Thierry Fournier | 8feaa66 | 2016-02-10 22:55:20 +0100 | [diff] [blame] | 1189 | int pat_idx_list_reg_cap(struct pattern_expr *expr, struct pattern *pat, int cap, char **err) |
Thierry FOURNIER | b9b0846 | 2013-12-13 15:12:32 +0100 | [diff] [blame] | 1190 | { |
| 1191 | struct pattern_list *patl; |
Thierry FOURNIER | 7148ce6 | 2013-12-06 19:06:43 +0100 | [diff] [blame] | 1192 | |
Thierry FOURNIER | b9b0846 | 2013-12-13 15:12:32 +0100 | [diff] [blame] | 1193 | /* allocate pattern */ |
| 1194 | patl = calloc(1, sizeof(*patl)); |
| 1195 | if (!patl) { |
| 1196 | memprintf(err, "out of memory while indexing pattern"); |
| 1197 | return 0; |
Thierry FOURNIER | 972028f | 2014-01-23 17:53:31 +0100 | [diff] [blame] | 1198 | } |
Thierry FOURNIER | 7148ce6 | 2013-12-06 19:06:43 +0100 | [diff] [blame] | 1199 | |
Thierry FOURNIER | b9b0846 | 2013-12-13 15:12:32 +0100 | [diff] [blame] | 1200 | /* duplicate pattern */ |
| 1201 | memcpy(&patl->pat, pat, sizeof(*pat)); |
| 1202 | |
Thierry FOURNIER | b9b0846 | 2013-12-13 15:12:32 +0100 | [diff] [blame] | 1203 | /* compile regex */ |
Willy Tarreau | 9b5c8bb | 2020-11-02 19:16:23 +0100 | [diff] [blame] | 1204 | patl->pat.sflags |= PAT_SF_REGFREE; |
Dragan Dosen | 2674303 | 2019-04-30 15:54:36 +0200 | [diff] [blame] | 1205 | if (!(patl->pat.ptr.reg = regex_comp(pat->ptr.str, !(expr->mflags & PAT_MF_IGNORE_CASE), |
| 1206 | cap, err))) { |
Dirkjan Bussink | 07fcaaa | 2014-04-28 22:57:16 +0000 | [diff] [blame] | 1207 | free(patl); |
Thierry FOURNIER | b9b0846 | 2013-12-13 15:12:32 +0100 | [diff] [blame] | 1208 | return 0; |
| 1209 | } |
| 1210 | |
Thierry FOURNIER | b9b0846 | 2013-12-13 15:12:32 +0100 | [diff] [blame] | 1211 | /* chain pattern in the expression */ |
| 1212 | LIST_ADDQ(&expr->patterns, &patl->list); |
Willy Tarreau | 4bdd0a1 | 2020-11-02 12:10:48 +0100 | [diff] [blame] | 1213 | /* and from the reference */ |
| 1214 | LIST_ADDQ(&pat->ref->list_head, &patl->from_ref); |
Willy Tarreau | 3ee0de1 | 2020-11-02 15:26:51 +0100 | [diff] [blame] | 1215 | expr->ref->revision = rdtsc(); |
Thierry FOURNIER | b9b0846 | 2013-12-13 15:12:32 +0100 | [diff] [blame] | 1216 | |
| 1217 | /* that's ok */ |
| 1218 | return 1; |
| 1219 | } |
| 1220 | |
Thierry Fournier | 8feaa66 | 2016-02-10 22:55:20 +0100 | [diff] [blame] | 1221 | int pat_idx_list_reg(struct pattern_expr *expr, struct pattern *pat, char **err) |
| 1222 | { |
| 1223 | return pat_idx_list_reg_cap(expr, pat, 0, err); |
| 1224 | } |
| 1225 | |
| 1226 | int pat_idx_list_regm(struct pattern_expr *expr, struct pattern *pat, char **err) |
| 1227 | { |
| 1228 | return pat_idx_list_reg_cap(expr, pat, 1, err); |
| 1229 | } |
| 1230 | |
Thierry FOURNIER | b9b0846 | 2013-12-13 15:12:32 +0100 | [diff] [blame] | 1231 | int pat_idx_tree_ip(struct pattern_expr *expr, struct pattern *pat, char **err) |
| 1232 | { |
| 1233 | unsigned int mask; |
Thierry FOURNIER | e1bcac5 | 2013-12-13 16:09:50 +0100 | [diff] [blame] | 1234 | struct pattern_tree *node; |
Thierry FOURNIER | b9b0846 | 2013-12-13 15:12:32 +0100 | [diff] [blame] | 1235 | |
| 1236 | /* Only IPv4 can be indexed */ |
| 1237 | if (pat->type == SMP_T_IPV4) { |
Thierry FOURNIER | 972028f | 2014-01-23 17:53:31 +0100 | [diff] [blame] | 1238 | /* in IPv4 case, check if the mask is contiguous so that we can |
| 1239 | * insert the network into the tree. A continuous mask has only |
| 1240 | * ones on the left. This means that this mask + its lower bit |
| 1241 | * added once again is null. |
| 1242 | */ |
Thierry FOURNIER | b9b0846 | 2013-12-13 15:12:32 +0100 | [diff] [blame] | 1243 | mask = ntohl(pat->val.ipv4.mask.s_addr); |
| 1244 | if (mask + (mask & -mask) == 0) { |
| 1245 | mask = mask ? 33 - flsnz(mask & -mask) : 0; /* equals cidr value */ |
Thierry FOURNIER | 7148ce6 | 2013-12-06 19:06:43 +0100 | [diff] [blame] | 1246 | |
Thierry FOURNIER | b9b0846 | 2013-12-13 15:12:32 +0100 | [diff] [blame] | 1247 | /* node memory allocation */ |
| 1248 | node = calloc(1, sizeof(*node) + 4); |
| 1249 | if (!node) { |
| 1250 | memprintf(err, "out of memory while loading pattern"); |
| 1251 | return 0; |
| 1252 | } |
Thierry FOURNIER | 7148ce6 | 2013-12-06 19:06:43 +0100 | [diff] [blame] | 1253 | |
Thierry FOURNIER | b9b0846 | 2013-12-13 15:12:32 +0100 | [diff] [blame] | 1254 | /* copy the pointer to sample associated to this node */ |
Thierry FOURNIER | 503bb09 | 2015-08-19 08:35:43 +0200 | [diff] [blame] | 1255 | node->data = pat->data; |
Thierry FOURNIER | 6bb53ff | 2014-01-28 15:54:36 +0100 | [diff] [blame] | 1256 | node->ref = pat->ref; |
Thierry FOURNIER | 7148ce6 | 2013-12-06 19:06:43 +0100 | [diff] [blame] | 1257 | |
Thierry FOURNIER | b9b0846 | 2013-12-13 15:12:32 +0100 | [diff] [blame] | 1258 | /* FIXME: insert <addr>/<mask> into the tree here */ |
| 1259 | memcpy(node->node.key, &pat->val.ipv4.addr, 4); /* network byte order */ |
| 1260 | node->node.node.pfx = mask; |
Thierry FOURNIER | 31db4ae | 2014-01-30 00:27:15 +0100 | [diff] [blame] | 1261 | |
| 1262 | /* Insert the entry. */ |
| 1263 | ebmb_insert_prefix(&expr->pattern_tree, &node->node, 4); |
Willy Tarreau | 4bdd0a1 | 2020-11-02 12:10:48 +0100 | [diff] [blame] | 1264 | LIST_ADDQ(&pat->ref->tree_head, &node->from_ref); |
Willy Tarreau | 3ee0de1 | 2020-11-02 15:26:51 +0100 | [diff] [blame] | 1265 | expr->ref->revision = rdtsc(); |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 1266 | |
Thierry FOURNIER | b9b0846 | 2013-12-13 15:12:32 +0100 | [diff] [blame] | 1267 | /* that's ok */ |
| 1268 | return 1; |
| 1269 | } |
Thierry FOURNIER | 33a7433 | 2013-12-19 23:54:54 +0100 | [diff] [blame] | 1270 | else { |
| 1271 | /* If the mask is not contiguous, just add the pattern to the list */ |
| 1272 | return pat_idx_list_val(expr, pat, err); |
| 1273 | } |
Thierry FOURNIER | b9b0846 | 2013-12-13 15:12:32 +0100 | [diff] [blame] | 1274 | } |
Thierry FOURNIER | 33a7433 | 2013-12-19 23:54:54 +0100 | [diff] [blame] | 1275 | else if (pat->type == SMP_T_IPV6) { |
| 1276 | /* IPv6 also can be indexed */ |
| 1277 | node = calloc(1, sizeof(*node) + 16); |
| 1278 | if (!node) { |
| 1279 | memprintf(err, "out of memory while loading pattern"); |
| 1280 | return 0; |
| 1281 | } |
| 1282 | |
| 1283 | /* copy the pointer to sample associated to this node */ |
Thierry FOURNIER | 503bb09 | 2015-08-19 08:35:43 +0200 | [diff] [blame] | 1284 | node->data = pat->data; |
Thierry FOURNIER | 6bb53ff | 2014-01-28 15:54:36 +0100 | [diff] [blame] | 1285 | node->ref = pat->ref; |
Thierry FOURNIER | 33a7433 | 2013-12-19 23:54:54 +0100 | [diff] [blame] | 1286 | |
| 1287 | /* FIXME: insert <addr>/<mask> into the tree here */ |
| 1288 | memcpy(node->node.key, &pat->val.ipv6.addr, 16); /* network byte order */ |
| 1289 | node->node.node.pfx = pat->val.ipv6.mask; |
Thierry FOURNIER | 31db4ae | 2014-01-30 00:27:15 +0100 | [diff] [blame] | 1290 | |
| 1291 | /* Insert the entry. */ |
| 1292 | ebmb_insert_prefix(&expr->pattern_tree_2, &node->node, 16); |
Willy Tarreau | 4bdd0a1 | 2020-11-02 12:10:48 +0100 | [diff] [blame] | 1293 | LIST_ADDQ(&pat->ref->tree_head, &node->from_ref); |
Willy Tarreau | 3ee0de1 | 2020-11-02 15:26:51 +0100 | [diff] [blame] | 1294 | expr->ref->revision = rdtsc(); |
Thierry FOURNIER | 33a7433 | 2013-12-19 23:54:54 +0100 | [diff] [blame] | 1295 | |
| 1296 | /* that's ok */ |
| 1297 | return 1; |
| 1298 | } |
Thierry FOURNIER | 7148ce6 | 2013-12-06 19:06:43 +0100 | [diff] [blame] | 1299 | |
Thierry FOURNIER | 33a7433 | 2013-12-19 23:54:54 +0100 | [diff] [blame] | 1300 | return 0; |
Thierry FOURNIER | b9b0846 | 2013-12-13 15:12:32 +0100 | [diff] [blame] | 1301 | } |
| 1302 | |
| 1303 | int pat_idx_tree_str(struct pattern_expr *expr, struct pattern *pat, char **err) |
| 1304 | { |
| 1305 | int len; |
Thierry FOURNIER | e1bcac5 | 2013-12-13 16:09:50 +0100 | [diff] [blame] | 1306 | struct pattern_tree *node; |
Thierry FOURNIER | b9b0846 | 2013-12-13 15:12:32 +0100 | [diff] [blame] | 1307 | |
| 1308 | /* Only string can be indexed */ |
Thierry FOURNIER | 7654c9f | 2013-12-17 00:20:33 +0100 | [diff] [blame] | 1309 | if (pat->type != SMP_T_STR) { |
Thierry FOURNIER | b9b0846 | 2013-12-13 15:12:32 +0100 | [diff] [blame] | 1310 | memprintf(err, "internal error: string expected, but the type is '%s'", |
| 1311 | smp_to_type[pat->type]); |
| 1312 | return 0; |
Thierry FOURNIER | 972028f | 2014-01-23 17:53:31 +0100 | [diff] [blame] | 1313 | } |
Thierry FOURNIER | 7148ce6 | 2013-12-06 19:06:43 +0100 | [diff] [blame] | 1314 | |
Thierry FOURNIER | b9b0846 | 2013-12-13 15:12:32 +0100 | [diff] [blame] | 1315 | /* If the flag PAT_F_IGNORE_CASE is set, we cannot use trees */ |
Thierry FOURNIER | e47e4e2 | 2014-04-28 11:18:57 +0200 | [diff] [blame] | 1316 | if (expr->mflags & PAT_MF_IGNORE_CASE) |
Thierry FOURNIER | b9b0846 | 2013-12-13 15:12:32 +0100 | [diff] [blame] | 1317 | return pat_idx_list_str(expr, pat, err); |
Thierry FOURNIER | 7148ce6 | 2013-12-06 19:06:43 +0100 | [diff] [blame] | 1318 | |
Thierry FOURNIER | b9b0846 | 2013-12-13 15:12:32 +0100 | [diff] [blame] | 1319 | /* Process the key len */ |
| 1320 | len = strlen(pat->ptr.str) + 1; |
| 1321 | |
| 1322 | /* node memory allocation */ |
| 1323 | node = calloc(1, sizeof(*node) + len); |
| 1324 | if (!node) { |
| 1325 | memprintf(err, "out of memory while loading pattern"); |
| 1326 | return 0; |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 1327 | } |
| 1328 | |
Thierry FOURNIER | b9b0846 | 2013-12-13 15:12:32 +0100 | [diff] [blame] | 1329 | /* copy the pointer to sample associated to this node */ |
Thierry FOURNIER | 503bb09 | 2015-08-19 08:35:43 +0200 | [diff] [blame] | 1330 | node->data = pat->data; |
Thierry FOURNIER | 6bb53ff | 2014-01-28 15:54:36 +0100 | [diff] [blame] | 1331 | node->ref = pat->ref; |
Thierry FOURNIER | b9b0846 | 2013-12-13 15:12:32 +0100 | [diff] [blame] | 1332 | |
| 1333 | /* copy the string */ |
| 1334 | memcpy(node->node.key, pat->ptr.str, len); |
| 1335 | |
| 1336 | /* index the new node */ |
Thierry FOURNIER | 31db4ae | 2014-01-30 00:27:15 +0100 | [diff] [blame] | 1337 | ebst_insert(&expr->pattern_tree, &node->node); |
Willy Tarreau | 4bdd0a1 | 2020-11-02 12:10:48 +0100 | [diff] [blame] | 1338 | LIST_ADDQ(&pat->ref->tree_head, &node->from_ref); |
Willy Tarreau | 3ee0de1 | 2020-11-02 15:26:51 +0100 | [diff] [blame] | 1339 | expr->ref->revision = rdtsc(); |
Thierry FOURNIER | b9b0846 | 2013-12-13 15:12:32 +0100 | [diff] [blame] | 1340 | |
| 1341 | /* that's ok */ |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 1342 | return 1; |
| 1343 | } |
| 1344 | |
Willy Tarreau | b1dd9bf | 2014-05-10 08:53:48 +0200 | [diff] [blame] | 1345 | int pat_idx_tree_pfx(struct pattern_expr *expr, struct pattern *pat, char **err) |
| 1346 | { |
| 1347 | int len; |
| 1348 | struct pattern_tree *node; |
| 1349 | |
| 1350 | /* Only string can be indexed */ |
| 1351 | if (pat->type != SMP_T_STR) { |
| 1352 | memprintf(err, "internal error: string expected, but the type is '%s'", |
| 1353 | smp_to_type[pat->type]); |
| 1354 | return 0; |
| 1355 | } |
| 1356 | |
| 1357 | /* If the flag PAT_F_IGNORE_CASE is set, we cannot use trees */ |
| 1358 | if (expr->mflags & PAT_MF_IGNORE_CASE) |
| 1359 | return pat_idx_list_str(expr, pat, err); |
| 1360 | |
| 1361 | /* Process the key len */ |
| 1362 | len = strlen(pat->ptr.str); |
| 1363 | |
| 1364 | /* node memory allocation */ |
| 1365 | node = calloc(1, sizeof(*node) + len + 1); |
| 1366 | if (!node) { |
| 1367 | memprintf(err, "out of memory while loading pattern"); |
| 1368 | return 0; |
| 1369 | } |
| 1370 | |
| 1371 | /* copy the pointer to sample associated to this node */ |
Thierry FOURNIER | 503bb09 | 2015-08-19 08:35:43 +0200 | [diff] [blame] | 1372 | node->data = pat->data; |
Willy Tarreau | b1dd9bf | 2014-05-10 08:53:48 +0200 | [diff] [blame] | 1373 | node->ref = pat->ref; |
| 1374 | |
| 1375 | /* copy the string and the trailing zero */ |
| 1376 | memcpy(node->node.key, pat->ptr.str, len + 1); |
| 1377 | node->node.node.pfx = len * 8; |
| 1378 | |
| 1379 | /* index the new node */ |
| 1380 | ebmb_insert_prefix(&expr->pattern_tree, &node->node, len); |
Willy Tarreau | 4bdd0a1 | 2020-11-02 12:10:48 +0100 | [diff] [blame] | 1381 | LIST_ADDQ(&pat->ref->tree_head, &node->from_ref); |
Willy Tarreau | 3ee0de1 | 2020-11-02 15:26:51 +0100 | [diff] [blame] | 1382 | expr->ref->revision = rdtsc(); |
Willy Tarreau | b1dd9bf | 2014-05-10 08:53:48 +0200 | [diff] [blame] | 1383 | |
| 1384 | /* that's ok */ |
| 1385 | return 1; |
| 1386 | } |
| 1387 | |
Willy Tarreau | f1c0892 | 2020-11-02 19:53:16 +0100 | [diff] [blame] | 1388 | /* Deletes all patterns from reference <elt>. Note that all of their |
Willy Tarreau | 78777ea | 2020-11-02 13:55:22 +0100 | [diff] [blame] | 1389 | * expressions must be locked, and the pattern lock must be held as well. |
| 1390 | */ |
Willy Tarreau | f1c0892 | 2020-11-02 19:53:16 +0100 | [diff] [blame] | 1391 | void pat_delete_gen(struct pat_ref *ref, struct pat_ref_elt *elt) |
Thierry FOURNIER | b113650 | 2014-01-15 11:38:49 +0100 | [diff] [blame] | 1392 | { |
Willy Tarreau | f1c0892 | 2020-11-02 19:53:16 +0100 | [diff] [blame] | 1393 | struct pattern_tree *tree, *tree_bck; |
| 1394 | struct pattern_list *pat, *pat_bck; |
| 1395 | |
| 1396 | /* delete all known tree nodes. They are all allocated inline */ |
| 1397 | list_for_each_entry_safe(tree, tree_bck, &elt->tree_head, from_ref) { |
| 1398 | BUG_ON(tree->ref != elt); |
| 1399 | |
| 1400 | ebmb_delete(&tree->node); |
| 1401 | LIST_DEL(&tree->from_ref); |
| 1402 | free(tree->data); |
| 1403 | free(tree); |
| 1404 | } |
Thierry FOURNIER | b113650 | 2014-01-15 11:38:49 +0100 | [diff] [blame] | 1405 | |
Willy Tarreau | f1c0892 | 2020-11-02 19:53:16 +0100 | [diff] [blame] | 1406 | /* delete all list nodes and free their pattern entries (str/reg) */ |
| 1407 | list_for_each_entry_safe(pat, pat_bck, &elt->list_head, from_ref) { |
Thierry FOURNIER | b113650 | 2014-01-15 11:38:49 +0100 | [diff] [blame] | 1408 | /* Check equality. */ |
Willy Tarreau | 78777ea | 2020-11-02 13:55:22 +0100 | [diff] [blame] | 1409 | BUG_ON(pat->pat.ref != elt); |
Thierry FOURNIER | b113650 | 2014-01-15 11:38:49 +0100 | [diff] [blame] | 1410 | |
| 1411 | /* Delete and free entry. */ |
| 1412 | LIST_DEL(&pat->list); |
Willy Tarreau | 4bdd0a1 | 2020-11-02 12:10:48 +0100 | [diff] [blame] | 1413 | LIST_DEL(&pat->from_ref); |
Willy Tarreau | 6d8a689 | 2020-11-02 19:26:02 +0100 | [diff] [blame] | 1414 | if (pat->pat.sflags & PAT_SF_REGFREE) |
| 1415 | regex_free(pat->pat.ptr.reg); |
| 1416 | else |
| 1417 | free(pat->pat.ptr.ptr); |
Thierry FOURNIER | 503bb09 | 2015-08-19 08:35:43 +0200 | [diff] [blame] | 1418 | free(pat->pat.data); |
Thierry FOURNIER | b113650 | 2014-01-15 11:38:49 +0100 | [diff] [blame] | 1419 | free(pat); |
| 1420 | } |
Thierry FOURNIER | b113650 | 2014-01-15 11:38:49 +0100 | [diff] [blame] | 1421 | |
Willy Tarreau | f1c0892 | 2020-11-02 19:53:16 +0100 | [diff] [blame] | 1422 | /* update revision number to refresh the cache */ |
| 1423 | ref->revision = rdtsc(); |
Thierry FOURNIER | b113650 | 2014-01-15 11:38:49 +0100 | [diff] [blame] | 1424 | } |
| 1425 | |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 1426 | void pattern_init_expr(struct pattern_expr *expr) |
| 1427 | { |
| 1428 | LIST_INIT(&expr->patterns); |
Thierry FOURNIER | 31db4ae | 2014-01-30 00:27:15 +0100 | [diff] [blame] | 1429 | expr->pattern_tree = EB_ROOT; |
| 1430 | expr->pattern_tree_2 = EB_ROOT; |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 1431 | } |
| 1432 | |
| 1433 | void pattern_init_head(struct pattern_head *head) |
| 1434 | { |
| 1435 | LIST_INIT(&head->head); |
| 1436 | } |
| 1437 | |
| 1438 | /* The following functions are relative to the management of the reference |
| 1439 | * lists. These lists are used to store the original pattern and associated |
| 1440 | * value as string form. |
| 1441 | * |
| 1442 | * This is used with modifiable ACL and MAPS |
Thierry FOURNIER | af5a29d | 2014-03-11 14:29:22 +0100 | [diff] [blame] | 1443 | * |
| 1444 | * The pattern reference are stored with two identifiers: the unique_id and |
| 1445 | * the reference. |
| 1446 | * |
| 1447 | * The reference identify a file. Each file with the same name point to the |
| 1448 | * same reference. We can register many times one file. If the file is modified, |
| 1449 | * all his dependencies are also modified. The reference can be used with map or |
| 1450 | * acl. |
| 1451 | * |
| 1452 | * The unique_id identify inline acl. The unique id is unique for each acl. |
| 1453 | * You cannot force the same id in the configuration file, because this repoort |
| 1454 | * an error. |
| 1455 | * |
| 1456 | * A particular case appears if the filename is a number. In this case, the |
| 1457 | * unique_id is set with the number represented by the filename and the |
| 1458 | * reference is also set. This method prevent double unique_id. |
| 1459 | * |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 1460 | */ |
| 1461 | |
Willy Tarreau | a5bbaaf | 2020-10-30 16:03:50 +0100 | [diff] [blame] | 1462 | /* This function looks up a reference by name. If the reference is found, a |
| 1463 | * pointer to the struct pat_ref is returned, otherwise NULL is returned. |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 1464 | */ |
| 1465 | struct pat_ref *pat_ref_lookup(const char *reference) |
| 1466 | { |
| 1467 | struct pat_ref *ref; |
| 1468 | |
| 1469 | list_for_each_entry(ref, &pattern_reference, list) |
Thierry FOURNIER | af5a29d | 2014-03-11 14:29:22 +0100 | [diff] [blame] | 1470 | if (ref->reference && strcmp(reference, ref->reference) == 0) |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 1471 | return ref; |
| 1472 | return NULL; |
| 1473 | } |
| 1474 | |
Willy Tarreau | a5bbaaf | 2020-10-30 16:03:50 +0100 | [diff] [blame] | 1475 | /* This function looks up a reference's unique id. If the reference is found, a |
| 1476 | * pointer to the struct pat_ref is returned, otherwise NULL is returned. |
Thierry FOURNIER | af5a29d | 2014-03-11 14:29:22 +0100 | [diff] [blame] | 1477 | */ |
| 1478 | struct pat_ref *pat_ref_lookupid(int unique_id) |
| 1479 | { |
| 1480 | struct pat_ref *ref; |
| 1481 | |
| 1482 | list_for_each_entry(ref, &pattern_reference, list) |
| 1483 | if (ref->unique_id == unique_id) |
| 1484 | return ref; |
| 1485 | return NULL; |
| 1486 | } |
| 1487 | |
Willy Tarreau | 1fd52f7 | 2020-11-02 17:30:17 +0100 | [diff] [blame] | 1488 | /* This function removes from the pattern reference <ref> all the patterns |
| 1489 | * attached to the reference element <elt>, and the element itself. The |
| 1490 | * reference must be locked. |
| 1491 | */ |
| 1492 | void pat_ref_delete_by_ptr(struct pat_ref *ref, struct pat_ref_elt *elt) |
| 1493 | { |
| 1494 | struct pattern_expr *expr; |
| 1495 | struct bref *bref, *back; |
| 1496 | |
| 1497 | /* |
| 1498 | * we have to unlink all watchers from this reference pattern. We must |
| 1499 | * not relink them if this elt was the last one in the list. |
| 1500 | */ |
| 1501 | list_for_each_entry_safe(bref, back, &elt->back_refs, users) { |
| 1502 | LIST_DEL(&bref->users); |
| 1503 | LIST_INIT(&bref->users); |
| 1504 | if (elt->list.n != &ref->head) |
| 1505 | LIST_ADDQ(&LIST_ELEM(elt->list.n, typeof(elt), list)->back_refs, &bref->users); |
| 1506 | bref->ref = elt->list.n; |
| 1507 | } |
| 1508 | |
| 1509 | /* delete all entries from all expressions for this pattern */ |
| 1510 | list_for_each_entry(expr, &ref->pat, list) |
| 1511 | HA_RWLOCK_WRLOCK(PATEXP_LOCK, &expr->lock); |
| 1512 | |
| 1513 | pat_delete_gen(ref, elt); |
| 1514 | |
| 1515 | list_for_each_entry(expr, &ref->pat, list) |
| 1516 | HA_RWLOCK_WRUNLOCK(PATEXP_LOCK, &expr->lock); |
| 1517 | |
| 1518 | LIST_DEL(&elt->list); |
| 1519 | free(elt->sample); |
| 1520 | free(elt->pattern); |
| 1521 | free(elt); |
| 1522 | } |
| 1523 | |
Willy Tarreau | a5bbaaf | 2020-10-30 16:03:50 +0100 | [diff] [blame] | 1524 | /* This function removes all the patterns matching the pointer <refelt> from |
| 1525 | * the reference and from each expr member of this reference. This function |
| 1526 | * returns 1 if the entry was found and deleted, otherwise zero. |
Thierry FOURNIER | 7acca4b | 2014-01-28 16:43:36 +0100 | [diff] [blame] | 1527 | */ |
| 1528 | int pat_ref_delete_by_id(struct pat_ref *ref, struct pat_ref_elt *refelt) |
| 1529 | { |
Thierry FOURNIER | 7acca4b | 2014-01-28 16:43:36 +0100 | [diff] [blame] | 1530 | struct pat_ref_elt *elt, *safe; |
| 1531 | |
| 1532 | /* delete pattern from reference */ |
| 1533 | list_for_each_entry_safe(elt, safe, &ref->head, list) { |
| 1534 | if (elt == refelt) { |
Willy Tarreau | 1fd52f7 | 2020-11-02 17:30:17 +0100 | [diff] [blame] | 1535 | pat_ref_delete_by_ptr(ref, elt); |
Thierry FOURNIER | 7acca4b | 2014-01-28 16:43:36 +0100 | [diff] [blame] | 1536 | return 1; |
| 1537 | } |
| 1538 | } |
| 1539 | return 0; |
| 1540 | } |
| 1541 | |
Willy Tarreau | 1fd52f7 | 2020-11-02 17:30:17 +0100 | [diff] [blame] | 1542 | /* This function removes all patterns matching <key> from the reference |
Joseph Herlant | 4189d67 | 2018-11-15 10:22:31 -0800 | [diff] [blame] | 1543 | * and from each expr member of the reference. This function returns 1 |
Willy Tarreau | 1fd52f7 | 2020-11-02 17:30:17 +0100 | [diff] [blame] | 1544 | * if the deletion is done and returns 0 is the entry is not found. |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 1545 | */ |
| 1546 | int pat_ref_delete(struct pat_ref *ref, const char *key) |
| 1547 | { |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 1548 | struct pat_ref_elt *elt, *safe; |
| 1549 | int found = 0; |
| 1550 | |
| 1551 | /* delete pattern from reference */ |
| 1552 | list_for_each_entry_safe(elt, safe, &ref->head, list) { |
| 1553 | if (strcmp(key, elt->pattern) == 0) { |
Willy Tarreau | 1fd52f7 | 2020-11-02 17:30:17 +0100 | [diff] [blame] | 1554 | pat_ref_delete_by_ptr(ref, elt); |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 1555 | found = 1; |
| 1556 | } |
| 1557 | } |
| 1558 | |
Willy Tarreau | 1fd52f7 | 2020-11-02 17:30:17 +0100 | [diff] [blame] | 1559 | return found; |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 1560 | } |
| 1561 | |
Baptiste Assmann | 953f74d | 2014-04-25 16:57:03 +0200 | [diff] [blame] | 1562 | /* |
| 1563 | * find and return an element <elt> matching <key> in a reference <ref> |
| 1564 | * return NULL if not found |
| 1565 | */ |
| 1566 | struct pat_ref_elt *pat_ref_find_elt(struct pat_ref *ref, const char *key) |
| 1567 | { |
| 1568 | struct pat_ref_elt *elt; |
| 1569 | |
| 1570 | list_for_each_entry(elt, &ref->head, list) { |
| 1571 | if (strcmp(key, elt->pattern) == 0) |
| 1572 | return elt; |
| 1573 | } |
| 1574 | |
| 1575 | return NULL; |
| 1576 | } |
| 1577 | |
| 1578 | |
Willy Tarreau | a5bbaaf | 2020-10-30 16:03:50 +0100 | [diff] [blame] | 1579 | /* This function modifies the sample of pat_ref_elt <elt> in all expressions |
| 1580 | * found under <ref> to become <value>. It is assumed that the caller has |
| 1581 | * already verified that <elt> belongs to <ref>. |
| 1582 | */ |
Thierry FOURNIER | e369ca2 | 2014-01-29 16:24:55 +0100 | [diff] [blame] | 1583 | static inline int pat_ref_set_elt(struct pat_ref *ref, struct pat_ref_elt *elt, |
Thierry FOURNIER | 364cfdf | 2014-01-29 19:08:49 +0100 | [diff] [blame] | 1584 | const char *value, char **err) |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 1585 | { |
| 1586 | struct pattern_expr *expr; |
Thierry FOURNIER | 503bb09 | 2015-08-19 08:35:43 +0200 | [diff] [blame] | 1587 | struct sample_data **data; |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 1588 | char *sample; |
Thierry FOURNIER | 12ba0c2 | 2015-08-14 00:02:11 +0200 | [diff] [blame] | 1589 | struct sample_data test; |
Thierry FOURNIER | 149e0fe | 2014-01-29 19:35:06 +0100 | [diff] [blame] | 1590 | |
| 1591 | /* Try all needed converters. */ |
| 1592 | list_for_each_entry(expr, &ref->pat, list) { |
| 1593 | if (!expr->pat_head->parse_smp) |
| 1594 | continue; |
| 1595 | |
| 1596 | if (!expr->pat_head->parse_smp(value, &test)) { |
| 1597 | memprintf(err, "unable to parse '%s'", value); |
| 1598 | return 0; |
| 1599 | } |
| 1600 | } |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 1601 | |
Thierry FOURNIER | e369ca2 | 2014-01-29 16:24:55 +0100 | [diff] [blame] | 1602 | /* Modify pattern from reference. */ |
| 1603 | sample = strdup(value); |
Thierry FOURNIER | 364cfdf | 2014-01-29 19:08:49 +0100 | [diff] [blame] | 1604 | if (!sample) { |
| 1605 | memprintf(err, "out of memory error"); |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 1606 | return 0; |
Thierry FOURNIER | 364cfdf | 2014-01-29 19:08:49 +0100 | [diff] [blame] | 1607 | } |
Willy Tarreau | a5bbaaf | 2020-10-30 16:03:50 +0100 | [diff] [blame] | 1608 | /* Load sample in each reference. All the conversions are tested |
| 1609 | * below, normally these calls don't fail. |
Thierry FOURNIER | 149e0fe | 2014-01-29 19:35:06 +0100 | [diff] [blame] | 1610 | */ |
Thierry FOURNIER | c5959fd | 2014-01-20 14:29:33 +0100 | [diff] [blame] | 1611 | list_for_each_entry(expr, &ref->pat, list) { |
Thierry FOURNIER | e369ca2 | 2014-01-29 16:24:55 +0100 | [diff] [blame] | 1612 | if (!expr->pat_head->parse_smp) |
| 1613 | continue; |
| 1614 | |
Christopher Faulet | 2a944ee | 2017-11-07 10:42:54 +0100 | [diff] [blame] | 1615 | HA_RWLOCK_WRLOCK(PATEXP_LOCK, &expr->lock); |
Thierry FOURNIER | 503bb09 | 2015-08-19 08:35:43 +0200 | [diff] [blame] | 1616 | data = pattern_find_smp(expr, elt); |
| 1617 | if (data && *data && !expr->pat_head->parse_smp(sample, *data)) |
| 1618 | *data = NULL; |
Christopher Faulet | 2a944ee | 2017-11-07 10:42:54 +0100 | [diff] [blame] | 1619 | HA_RWLOCK_WRUNLOCK(PATEXP_LOCK, &expr->lock); |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 1620 | } |
| 1621 | |
Emeric Brun | b5997f7 | 2017-07-03 11:34:05 +0200 | [diff] [blame] | 1622 | /* free old sample only when all exprs are updated */ |
| 1623 | free(elt->sample); |
| 1624 | elt->sample = sample; |
| 1625 | |
| 1626 | |
Thierry FOURNIER | 149e0fe | 2014-01-29 19:35:06 +0100 | [diff] [blame] | 1627 | return 1; |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 1628 | } |
| 1629 | |
Willy Tarreau | a5bbaaf | 2020-10-30 16:03:50 +0100 | [diff] [blame] | 1630 | /* This function modifies the sample of pat_ref_elt <refelt> in all expressions |
| 1631 | * found under <ref> to become <value>, after checking that <refelt> really |
| 1632 | * belongs to <ref>. |
| 1633 | */ |
Thierry FOURNIER | 364cfdf | 2014-01-29 19:08:49 +0100 | [diff] [blame] | 1634 | int pat_ref_set_by_id(struct pat_ref *ref, struct pat_ref_elt *refelt, const char *value, char **err) |
Thierry FOURNIER | e369ca2 | 2014-01-29 16:24:55 +0100 | [diff] [blame] | 1635 | { |
| 1636 | struct pat_ref_elt *elt; |
| 1637 | |
| 1638 | /* Look for pattern in the reference. */ |
| 1639 | list_for_each_entry(elt, &ref->head, list) { |
| 1640 | if (elt == refelt) { |
Thierry FOURNIER | 364cfdf | 2014-01-29 19:08:49 +0100 | [diff] [blame] | 1641 | if (!pat_ref_set_elt(ref, elt, value, err)) |
| 1642 | return 0; |
Thierry FOURNIER | e369ca2 | 2014-01-29 16:24:55 +0100 | [diff] [blame] | 1643 | return 1; |
| 1644 | } |
| 1645 | } |
Thierry FOURNIER | 364cfdf | 2014-01-29 19:08:49 +0100 | [diff] [blame] | 1646 | |
| 1647 | memprintf(err, "key or pattern not found"); |
Thierry FOURNIER | e369ca2 | 2014-01-29 16:24:55 +0100 | [diff] [blame] | 1648 | return 0; |
| 1649 | } |
| 1650 | |
Willy Tarreau | a5bbaaf | 2020-10-30 16:03:50 +0100 | [diff] [blame] | 1651 | /* This function modifies to <value> the sample of all patterns matching <key> |
| 1652 | * under <ref>. |
| 1653 | */ |
Thierry FOURNIER | 364cfdf | 2014-01-29 19:08:49 +0100 | [diff] [blame] | 1654 | int pat_ref_set(struct pat_ref *ref, const char *key, const char *value, char **err) |
Thierry FOURNIER | e369ca2 | 2014-01-29 16:24:55 +0100 | [diff] [blame] | 1655 | { |
| 1656 | struct pat_ref_elt *elt; |
Thierry FOURNIER | 364cfdf | 2014-01-29 19:08:49 +0100 | [diff] [blame] | 1657 | int found = 0; |
| 1658 | char *_merr; |
| 1659 | char **merr; |
| 1660 | |
| 1661 | if (err) { |
| 1662 | merr = &_merr; |
| 1663 | *merr = NULL; |
| 1664 | } |
| 1665 | else |
| 1666 | merr = NULL; |
Thierry FOURNIER | e369ca2 | 2014-01-29 16:24:55 +0100 | [diff] [blame] | 1667 | |
| 1668 | /* Look for pattern in the reference. */ |
| 1669 | list_for_each_entry(elt, &ref->head, list) { |
| 1670 | if (strcmp(key, elt->pattern) == 0) { |
Thierry FOURNIER | 364cfdf | 2014-01-29 19:08:49 +0100 | [diff] [blame] | 1671 | if (!pat_ref_set_elt(ref, elt, value, merr)) { |
William Lallemand | 579fb25 | 2018-06-11 10:53:46 +0200 | [diff] [blame] | 1672 | if (err && merr) { |
| 1673 | if (!found) { |
| 1674 | *err = *merr; |
| 1675 | } else { |
| 1676 | memprintf(err, "%s, %s", *err, *merr); |
| 1677 | free(*merr); |
| 1678 | *merr = NULL; |
| 1679 | } |
Thierry FOURNIER | 364cfdf | 2014-01-29 19:08:49 +0100 | [diff] [blame] | 1680 | } |
| 1681 | } |
| 1682 | found = 1; |
Thierry FOURNIER | e369ca2 | 2014-01-29 16:24:55 +0100 | [diff] [blame] | 1683 | } |
| 1684 | } |
Thierry FOURNIER | 364cfdf | 2014-01-29 19:08:49 +0100 | [diff] [blame] | 1685 | |
| 1686 | if (!found) { |
| 1687 | memprintf(err, "entry not found"); |
| 1688 | return 0; |
| 1689 | } |
| 1690 | return 1; |
Thierry FOURNIER | e369ca2 | 2014-01-29 16:24:55 +0100 | [diff] [blame] | 1691 | } |
| 1692 | |
Joseph Herlant | 4189d67 | 2018-11-15 10:22:31 -0800 | [diff] [blame] | 1693 | /* This function creates a new reference. <ref> is the reference name. |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 1694 | * <flags> are PAT_REF_*. /!\ The reference is not checked, and must |
| 1695 | * be unique. The user must check the reference with "pat_ref_lookup()" |
Willy Tarreau | a5bbaaf | 2020-10-30 16:03:50 +0100 | [diff] [blame] | 1696 | * before calling this function. If the function fails, it returns NULL, |
| 1697 | * otherwise it returns the new struct pat_ref. |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 1698 | */ |
Thierry FOURNIER | 0d6ba51 | 2014-02-11 03:31:34 +0100 | [diff] [blame] | 1699 | struct pat_ref *pat_ref_new(const char *reference, const char *display, unsigned int flags) |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 1700 | { |
| 1701 | struct pat_ref *ref; |
| 1702 | |
Willy Tarreau | 8135d9b | 2020-10-30 15:35:11 +0100 | [diff] [blame] | 1703 | ref = calloc(1, sizeof(*ref)); |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 1704 | if (!ref) |
| 1705 | return NULL; |
| 1706 | |
Thierry FOURNIER | 0d6ba51 | 2014-02-11 03:31:34 +0100 | [diff] [blame] | 1707 | if (display) { |
| 1708 | ref->display = strdup(display); |
| 1709 | if (!ref->display) { |
| 1710 | free(ref); |
| 1711 | return NULL; |
| 1712 | } |
| 1713 | } |
Thierry FOURNIER | 0d6ba51 | 2014-02-11 03:31:34 +0100 | [diff] [blame] | 1714 | |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 1715 | ref->reference = strdup(reference); |
| 1716 | if (!ref->reference) { |
Thierry FOURNIER | 0d6ba51 | 2014-02-11 03:31:34 +0100 | [diff] [blame] | 1717 | free(ref->display); |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 1718 | free(ref); |
| 1719 | return NULL; |
| 1720 | } |
| 1721 | |
Thierry FOURNIER | af5a29d | 2014-03-11 14:29:22 +0100 | [diff] [blame] | 1722 | ref->flags = flags; |
| 1723 | ref->unique_id = -1; |
Willy Tarreau | 3ee0de1 | 2020-11-02 15:26:51 +0100 | [diff] [blame] | 1724 | ref->revision = 0; |
Thierry FOURNIER | af5a29d | 2014-03-11 14:29:22 +0100 | [diff] [blame] | 1725 | |
| 1726 | LIST_INIT(&ref->head); |
| 1727 | LIST_INIT(&ref->pat); |
Christopher Faulet | 2a944ee | 2017-11-07 10:42:54 +0100 | [diff] [blame] | 1728 | HA_SPIN_INIT(&ref->lock); |
Thierry FOURNIER | af5a29d | 2014-03-11 14:29:22 +0100 | [diff] [blame] | 1729 | LIST_ADDQ(&pattern_reference, &ref->list); |
| 1730 | |
| 1731 | return ref; |
| 1732 | } |
| 1733 | |
Willy Tarreau | a5bbaaf | 2020-10-30 16:03:50 +0100 | [diff] [blame] | 1734 | /* This function creates a new reference. <unique_id> is the unique id. If |
Thierry FOURNIER | af5a29d | 2014-03-11 14:29:22 +0100 | [diff] [blame] | 1735 | * the value of <unique_id> is -1, the unique id is calculated later. |
| 1736 | * <flags> are PAT_REF_*. /!\ The reference is not checked, and must |
| 1737 | * be unique. The user must check the reference with "pat_ref_lookup()" |
| 1738 | * or pat_ref_lookupid before calling this function. If the function |
Willy Tarreau | a5bbaaf | 2020-10-30 16:03:50 +0100 | [diff] [blame] | 1739 | * fails, it returns NULL, otherwise it returns the new struct pat_ref. |
Thierry FOURNIER | af5a29d | 2014-03-11 14:29:22 +0100 | [diff] [blame] | 1740 | */ |
Thierry FOURNIER | 0d6ba51 | 2014-02-11 03:31:34 +0100 | [diff] [blame] | 1741 | struct pat_ref *pat_ref_newid(int unique_id, const char *display, unsigned int flags) |
Thierry FOURNIER | af5a29d | 2014-03-11 14:29:22 +0100 | [diff] [blame] | 1742 | { |
| 1743 | struct pat_ref *ref; |
| 1744 | |
Willy Tarreau | 8135d9b | 2020-10-30 15:35:11 +0100 | [diff] [blame] | 1745 | ref = calloc(1, sizeof(*ref)); |
Thierry FOURNIER | af5a29d | 2014-03-11 14:29:22 +0100 | [diff] [blame] | 1746 | if (!ref) |
| 1747 | return NULL; |
| 1748 | |
Thierry FOURNIER | 0d6ba51 | 2014-02-11 03:31:34 +0100 | [diff] [blame] | 1749 | if (display) { |
| 1750 | ref->display = strdup(display); |
| 1751 | if (!ref->display) { |
| 1752 | free(ref); |
| 1753 | return NULL; |
| 1754 | } |
| 1755 | } |
Thierry FOURNIER | 0d6ba51 | 2014-02-11 03:31:34 +0100 | [diff] [blame] | 1756 | |
Thierry FOURNIER | af5a29d | 2014-03-11 14:29:22 +0100 | [diff] [blame] | 1757 | ref->reference = NULL; |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 1758 | ref->flags = flags; |
Willy Tarreau | 2994774 | 2020-10-28 11:43:49 +0100 | [diff] [blame^] | 1759 | ref->curr_gen = 0; |
| 1760 | ref->next_gen = 0; |
Thierry FOURNIER | af5a29d | 2014-03-11 14:29:22 +0100 | [diff] [blame] | 1761 | ref->unique_id = unique_id; |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 1762 | LIST_INIT(&ref->head); |
| 1763 | LIST_INIT(&ref->pat); |
Aurélien Nephtali | 564d15a | 2018-04-19 16:56:07 +0200 | [diff] [blame] | 1764 | HA_SPIN_INIT(&ref->lock); |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 1765 | LIST_ADDQ(&pattern_reference, &ref->list); |
| 1766 | |
| 1767 | return ref; |
| 1768 | } |
| 1769 | |
Willy Tarreau | f4edb72 | 2020-10-28 10:52:46 +0100 | [diff] [blame] | 1770 | /* This function adds entry to <ref>. It can fail on memory error. It returns |
| 1771 | * the newly added element on success, or NULL on failure. The PATREF_LOCK on |
Willy Tarreau | 2994774 | 2020-10-28 11:43:49 +0100 | [diff] [blame^] | 1772 | * <ref> must be held. It sets the newly created pattern's generation number |
| 1773 | * to the same value as the reference's. |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 1774 | */ |
Willy Tarreau | f4edb72 | 2020-10-28 10:52:46 +0100 | [diff] [blame] | 1775 | struct pat_ref_elt *pat_ref_append(struct pat_ref *ref, const char *pattern, const char *sample, int line) |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 1776 | { |
| 1777 | struct pat_ref_elt *elt; |
| 1778 | |
Willy Tarreau | 8135d9b | 2020-10-30 15:35:11 +0100 | [diff] [blame] | 1779 | elt = calloc(1, sizeof(*elt)); |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 1780 | if (!elt) |
Willy Tarreau | f4edb72 | 2020-10-28 10:52:46 +0100 | [diff] [blame] | 1781 | goto fail; |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 1782 | |
Willy Tarreau | 2994774 | 2020-10-28 11:43:49 +0100 | [diff] [blame^] | 1783 | elt->gen_id = ref->curr_gen; |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 1784 | elt->line = line; |
| 1785 | |
| 1786 | elt->pattern = strdup(pattern); |
Willy Tarreau | f4edb72 | 2020-10-28 10:52:46 +0100 | [diff] [blame] | 1787 | if (!elt->pattern) |
| 1788 | goto fail; |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 1789 | |
| 1790 | if (sample) { |
| 1791 | elt->sample = strdup(sample); |
Willy Tarreau | f4edb72 | 2020-10-28 10:52:46 +0100 | [diff] [blame] | 1792 | if (!elt->sample) |
| 1793 | goto fail; |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 1794 | } |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 1795 | |
Emeric Brun | 8d85aa4 | 2017-06-29 15:40:33 +0200 | [diff] [blame] | 1796 | LIST_INIT(&elt->back_refs); |
Willy Tarreau | 4bdd0a1 | 2020-11-02 12:10:48 +0100 | [diff] [blame] | 1797 | LIST_INIT(&elt->list_head); |
| 1798 | LIST_INIT(&elt->tree_head); |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 1799 | LIST_ADDQ(&ref->head, &elt->list); |
Willy Tarreau | f4edb72 | 2020-10-28 10:52:46 +0100 | [diff] [blame] | 1800 | return elt; |
| 1801 | fail: |
| 1802 | if (elt) |
| 1803 | free(elt->pattern); |
| 1804 | free(elt); |
| 1805 | return NULL; |
Thierry FOURNIER | b113650 | 2014-01-15 11:38:49 +0100 | [diff] [blame] | 1806 | } |
| 1807 | |
Willy Tarreau | a5bbaaf | 2020-10-30 16:03:50 +0100 | [diff] [blame] | 1808 | /* This function creates sample found in <elt>, parses the pattern also |
| 1809 | * found in <elt> and inserts it in <expr>. The function copies <patflags> |
| 1810 | * into <expr>. If the function fails, it returns 0 and <err> is filled. |
Ilya Shipitsin | 47d1718 | 2020-06-21 21:42:57 +0500 | [diff] [blame] | 1811 | * In success case, the function returns 1. |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 1812 | */ |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 1813 | int pat_ref_push(struct pat_ref_elt *elt, struct pattern_expr *expr, |
| 1814 | int patflags, char **err) |
| 1815 | { |
Thierry FOURNIER | 503bb09 | 2015-08-19 08:35:43 +0200 | [diff] [blame] | 1816 | struct sample_data *data; |
Thierry FOURNIER | d25c842 | 2014-01-28 15:34:35 +0100 | [diff] [blame] | 1817 | struct pattern pattern; |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 1818 | |
| 1819 | /* Create sample */ |
| 1820 | if (elt->sample && expr->pat_head->parse_smp) { |
| 1821 | /* New sample. */ |
Thierry FOURNIER | 503bb09 | 2015-08-19 08:35:43 +0200 | [diff] [blame] | 1822 | data = malloc(sizeof(*data)); |
| 1823 | if (!data) |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 1824 | return 0; |
| 1825 | |
| 1826 | /* Parse value. */ |
Thierry FOURNIER | 503bb09 | 2015-08-19 08:35:43 +0200 | [diff] [blame] | 1827 | if (!expr->pat_head->parse_smp(elt->sample, data)) { |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 1828 | memprintf(err, "unable to parse '%s'", elt->sample); |
Thierry FOURNIER | 503bb09 | 2015-08-19 08:35:43 +0200 | [diff] [blame] | 1829 | free(data); |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 1830 | return 0; |
| 1831 | } |
| 1832 | |
| 1833 | } |
| 1834 | else |
Thierry FOURNIER | 503bb09 | 2015-08-19 08:35:43 +0200 | [diff] [blame] | 1835 | data = NULL; |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 1836 | |
Thierry FOURNIER | d25c842 | 2014-01-28 15:34:35 +0100 | [diff] [blame] | 1837 | /* initialise pattern */ |
| 1838 | memset(&pattern, 0, sizeof(pattern)); |
Thierry FOURNIER | 503bb09 | 2015-08-19 08:35:43 +0200 | [diff] [blame] | 1839 | pattern.data = data; |
Thierry FOURNIER | 6bb53ff | 2014-01-28 15:54:36 +0100 | [diff] [blame] | 1840 | pattern.ref = elt; |
Thierry FOURNIER | d25c842 | 2014-01-28 15:34:35 +0100 | [diff] [blame] | 1841 | |
| 1842 | /* parse pattern */ |
Thierry FOURNIER | e47e4e2 | 2014-04-28 11:18:57 +0200 | [diff] [blame] | 1843 | if (!expr->pat_head->parse(elt->pattern, &pattern, expr->mflags, err)) { |
Thierry FOURNIER | 503bb09 | 2015-08-19 08:35:43 +0200 | [diff] [blame] | 1844 | free(data); |
Thierry FOURNIER | d25c842 | 2014-01-28 15:34:35 +0100 | [diff] [blame] | 1845 | return 0; |
| 1846 | } |
| 1847 | |
Christopher Faulet | 2a944ee | 2017-11-07 10:42:54 +0100 | [diff] [blame] | 1848 | HA_RWLOCK_WRLOCK(PATEXP_LOCK, &expr->lock); |
Thierry FOURNIER | d25c842 | 2014-01-28 15:34:35 +0100 | [diff] [blame] | 1849 | /* index pattern */ |
| 1850 | if (!expr->pat_head->index(expr, &pattern, err)) { |
Christopher Faulet | 2a944ee | 2017-11-07 10:42:54 +0100 | [diff] [blame] | 1851 | HA_RWLOCK_WRUNLOCK(PATEXP_LOCK, &expr->lock); |
Thierry FOURNIER | 503bb09 | 2015-08-19 08:35:43 +0200 | [diff] [blame] | 1852 | free(data); |
Thierry FOURNIER | b9b0846 | 2013-12-13 15:12:32 +0100 | [diff] [blame] | 1853 | return 0; |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 1854 | } |
Christopher Faulet | 2a944ee | 2017-11-07 10:42:54 +0100 | [diff] [blame] | 1855 | HA_RWLOCK_WRUNLOCK(PATEXP_LOCK, &expr->lock); |
Thierry FOURNIER | b9b0846 | 2013-12-13 15:12:32 +0100 | [diff] [blame] | 1856 | |
| 1857 | return 1; |
| 1858 | } |
| 1859 | |
Willy Tarreau | 6a17407 | 2020-10-28 10:58:05 +0100 | [diff] [blame] | 1860 | /* This function adds entry to <ref>. It can fail on memory error. The new |
Thierry FOURNIER | 31db4ae | 2014-01-30 00:27:15 +0100 | [diff] [blame] | 1861 | * entry is added at all the pattern_expr registered in this reference. The |
Willy Tarreau | 6a17407 | 2020-10-28 10:58:05 +0100 | [diff] [blame] | 1862 | * function stops on the first error encountered. It returns 0 and <err> is |
Thierry FOURNIER | 31db4ae | 2014-01-30 00:27:15 +0100 | [diff] [blame] | 1863 | * filled. If an error is encountered, the complete add operation is cancelled. |
| 1864 | * If the insertion is a success the function returns 1. |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 1865 | */ |
| 1866 | int pat_ref_add(struct pat_ref *ref, |
| 1867 | const char *pattern, const char *sample, |
Thierry FOURNIER | e47e4e2 | 2014-04-28 11:18:57 +0200 | [diff] [blame] | 1868 | char **err) |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 1869 | { |
| 1870 | struct pat_ref_elt *elt; |
| 1871 | struct pattern_expr *expr; |
| 1872 | |
Willy Tarreau | 6a17407 | 2020-10-28 10:58:05 +0100 | [diff] [blame] | 1873 | elt = pat_ref_append(ref, pattern, sample, -1); |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 1874 | if (!elt) { |
| 1875 | memprintf(err, "out of memory error"); |
| 1876 | return 0; |
| 1877 | } |
| 1878 | |
Thierry FOURNIER | c5959fd | 2014-01-20 14:29:33 +0100 | [diff] [blame] | 1879 | list_for_each_entry(expr, &ref->pat, list) { |
Thierry FOURNIER | e47e4e2 | 2014-04-28 11:18:57 +0200 | [diff] [blame] | 1880 | if (!pat_ref_push(elt, expr, 0, err)) { |
Thierry FOURNIER | 31db4ae | 2014-01-30 00:27:15 +0100 | [diff] [blame] | 1881 | /* If the insertion fails, try to delete all the added entries. */ |
Willy Tarreau | 1fd52f7 | 2020-11-02 17:30:17 +0100 | [diff] [blame] | 1882 | pat_ref_delete_by_ptr(ref, elt); |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 1883 | return 0; |
| 1884 | } |
| 1885 | } |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 1886 | return 1; |
| 1887 | } |
| 1888 | |
Joseph Herlant | 4189d67 | 2018-11-15 10:22:31 -0800 | [diff] [blame] | 1889 | /* This function prunes <ref>, replaces all references by the references |
| 1890 | * of <replace>, and reindexes all the news values. |
Thierry FOURNIER | 46006bd | 2014-03-21 21:45:15 +0100 | [diff] [blame] | 1891 | * |
Joseph Herlant | 4189d67 | 2018-11-15 10:22:31 -0800 | [diff] [blame] | 1892 | * The patterns are loaded in best effort and the errors are ignored, |
| 1893 | * but written in the logs. |
Thierry FOURNIER | 46006bd | 2014-03-21 21:45:15 +0100 | [diff] [blame] | 1894 | */ |
| 1895 | void pat_ref_reload(struct pat_ref *ref, struct pat_ref *replace) |
| 1896 | { |
| 1897 | struct pattern_expr *expr; |
Emeric Brun | b5997f7 | 2017-07-03 11:34:05 +0200 | [diff] [blame] | 1898 | struct pat_ref_elt *elt, *safe; |
| 1899 | struct bref *bref, *back; |
Emeric Brun | b5997f7 | 2017-07-03 11:34:05 +0200 | [diff] [blame] | 1900 | struct pattern pattern; |
Thierry FOURNIER | 46006bd | 2014-03-21 21:45:15 +0100 | [diff] [blame] | 1901 | |
Thierry FOURNIER | 46006bd | 2014-03-21 21:45:15 +0100 | [diff] [blame] | 1902 | |
Christopher Faulet | 2a944ee | 2017-11-07 10:42:54 +0100 | [diff] [blame] | 1903 | HA_SPIN_LOCK(PATREF_LOCK, &ref->lock); |
Emeric Brun | b5997f7 | 2017-07-03 11:34:05 +0200 | [diff] [blame] | 1904 | list_for_each_entry(expr, &ref->pat, list) { |
Christopher Faulet | 2a944ee | 2017-11-07 10:42:54 +0100 | [diff] [blame] | 1905 | HA_RWLOCK_WRLOCK(PATEXP_LOCK, &expr->lock); |
Emeric Brun | b5997f7 | 2017-07-03 11:34:05 +0200 | [diff] [blame] | 1906 | } |
| 1907 | |
| 1908 | /* all expr are locked, we can safely remove all pat_ref */ |
| 1909 | list_for_each_entry_safe(elt, safe, &ref->head, list) { |
| 1910 | list_for_each_entry_safe(bref, back, &elt->back_refs, users) { |
Willy Tarreau | d4164dc | 2020-10-27 18:55:20 +0100 | [diff] [blame] | 1911 | /* we have to unlink all watchers. */ |
| 1912 | LIST_DEL_INIT(&bref->users); |
| 1913 | bref->ref = NULL; |
Emeric Brun | b5997f7 | 2017-07-03 11:34:05 +0200 | [diff] [blame] | 1914 | } |
| 1915 | LIST_DEL(&elt->list); |
Willy Tarreau | 4bdd0a1 | 2020-11-02 12:10:48 +0100 | [diff] [blame] | 1916 | LIST_DEL(&elt->list_head); |
| 1917 | LIST_DEL(&elt->tree_head); |
Emeric Brun | b5997f7 | 2017-07-03 11:34:05 +0200 | [diff] [blame] | 1918 | free(elt->pattern); |
| 1919 | free(elt->sample); |
| 1920 | free(elt); |
| 1921 | } |
| 1922 | |
| 1923 | /* switch pat_ret_elt lists */ |
Thierry FOURNIER | 46006bd | 2014-03-21 21:45:15 +0100 | [diff] [blame] | 1924 | LIST_ADD(&replace->head, &ref->head); |
| 1925 | LIST_DEL(&replace->head); |
| 1926 | |
Emeric Brun | b5997f7 | 2017-07-03 11:34:05 +0200 | [diff] [blame] | 1927 | list_for_each_entry(expr, &ref->pat, list) { |
| 1928 | expr->pat_head->prune(expr); |
| 1929 | list_for_each_entry(elt, &ref->head, list) { |
Dragan Dosen | f147479 | 2018-09-18 20:18:09 +0200 | [diff] [blame] | 1930 | char *err = NULL; |
| 1931 | struct sample_data *data = NULL; |
| 1932 | |
Emeric Brun | b5997f7 | 2017-07-03 11:34:05 +0200 | [diff] [blame] | 1933 | /* Create sample */ |
| 1934 | if (elt->sample && expr->pat_head->parse_smp) { |
| 1935 | /* New sample. */ |
| 1936 | data = malloc(sizeof(*data)); |
| 1937 | if (!data) |
| 1938 | continue; |
| 1939 | |
| 1940 | /* Parse value. */ |
| 1941 | if (!expr->pat_head->parse_smp(elt->sample, data)) { |
| 1942 | memprintf(&err, "unable to parse '%s'", elt->sample); |
| 1943 | send_log(NULL, LOG_NOTICE, "%s", err); |
| 1944 | free(err); |
| 1945 | free(data); |
| 1946 | continue; |
| 1947 | } |
| 1948 | |
| 1949 | } |
Emeric Brun | b5997f7 | 2017-07-03 11:34:05 +0200 | [diff] [blame] | 1950 | |
| 1951 | /* initialise pattern */ |
| 1952 | memset(&pattern, 0, sizeof(pattern)); |
| 1953 | pattern.data = data; |
| 1954 | pattern.ref = elt; |
| 1955 | |
| 1956 | /* parse pattern */ |
| 1957 | if (!expr->pat_head->parse(elt->pattern, &pattern, expr->mflags, &err)) { |
Thierry FOURNIER | 46006bd | 2014-03-21 21:45:15 +0100 | [diff] [blame] | 1958 | send_log(NULL, LOG_NOTICE, "%s", err); |
| 1959 | free(err); |
Emeric Brun | b5997f7 | 2017-07-03 11:34:05 +0200 | [diff] [blame] | 1960 | free(data); |
| 1961 | continue; |
| 1962 | } |
| 1963 | |
| 1964 | /* index pattern */ |
| 1965 | if (!expr->pat_head->index(expr, &pattern, &err)) { |
| 1966 | send_log(NULL, LOG_NOTICE, "%s", err); |
| 1967 | free(err); |
| 1968 | free(data); |
| 1969 | continue; |
Thierry FOURNIER | 46006bd | 2014-03-21 21:45:15 +0100 | [diff] [blame] | 1970 | } |
| 1971 | } |
Christopher Faulet | 2a944ee | 2017-11-07 10:42:54 +0100 | [diff] [blame] | 1972 | HA_RWLOCK_WRUNLOCK(PATEXP_LOCK, &expr->lock); |
Thierry FOURNIER | 46006bd | 2014-03-21 21:45:15 +0100 | [diff] [blame] | 1973 | } |
Christopher Faulet | 2a944ee | 2017-11-07 10:42:54 +0100 | [diff] [blame] | 1974 | HA_SPIN_UNLOCK(PATREF_LOCK, &ref->lock); |
Willy Tarreau | 114d698 | 2020-11-03 15:55:35 +0100 | [diff] [blame] | 1975 | |
| 1976 | #if defined(HA_HAVE_MALLOC_TRIM) |
| 1977 | malloc_trim(0); |
| 1978 | #endif |
Thierry FOURNIER | 46006bd | 2014-03-21 21:45:15 +0100 | [diff] [blame] | 1979 | } |
| 1980 | |
Willy Tarreau | a5bbaaf | 2020-10-30 16:03:50 +0100 | [diff] [blame] | 1981 | /* This function prunes all entries of <ref>. This function |
Willy Tarreau | d1d005d | 2019-12-20 18:22:02 +0100 | [diff] [blame] | 1982 | * prunes the associated pattern_expr. It may return before the end of |
| 1983 | * the list is reached, returning 0, to yield. The caller must call it |
| 1984 | * again. Otherwise it returns 1 once done. |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 1985 | */ |
Willy Tarreau | d1d005d | 2019-12-20 18:22:02 +0100 | [diff] [blame] | 1986 | int pat_ref_prune(struct pat_ref *ref) |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 1987 | { |
| 1988 | struct pat_ref_elt *elt, *safe; |
| 1989 | struct pattern_expr *expr; |
Emeric Brun | 8d85aa4 | 2017-06-29 15:40:33 +0200 | [diff] [blame] | 1990 | struct bref *bref, *back; |
Willy Tarreau | d1d005d | 2019-12-20 18:22:02 +0100 | [diff] [blame] | 1991 | int loops = 0; |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 1992 | |
Emeric Brun | b5997f7 | 2017-07-03 11:34:05 +0200 | [diff] [blame] | 1993 | list_for_each_entry(expr, &ref->pat, list) { |
Christopher Faulet | 2a944ee | 2017-11-07 10:42:54 +0100 | [diff] [blame] | 1994 | HA_RWLOCK_WRLOCK(PATEXP_LOCK, &expr->lock); |
Emeric Brun | b5997f7 | 2017-07-03 11:34:05 +0200 | [diff] [blame] | 1995 | expr->pat_head->prune(expr); |
Christopher Faulet | 2a944ee | 2017-11-07 10:42:54 +0100 | [diff] [blame] | 1996 | HA_RWLOCK_WRUNLOCK(PATEXP_LOCK, &expr->lock); |
Willy Tarreau | d1d005d | 2019-12-20 18:22:02 +0100 | [diff] [blame] | 1997 | loops++; |
| 1998 | /* yield often, some lists may be huge, especially those |
| 1999 | * having to be freed through free_pattern_tree() |
| 2000 | */ |
| 2001 | if (loops > 10) |
| 2002 | return 0; |
Emeric Brun | b5997f7 | 2017-07-03 11:34:05 +0200 | [diff] [blame] | 2003 | } |
| 2004 | |
| 2005 | /* we trash pat_ref_elt in a second time to ensure that data is |
| 2006 | free once there is no ref on it */ |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 2007 | list_for_each_entry_safe(elt, safe, &ref->head, list) { |
Emeric Brun | 8d85aa4 | 2017-06-29 15:40:33 +0200 | [diff] [blame] | 2008 | list_for_each_entry_safe(bref, back, &elt->back_refs, users) { |
| 2009 | /* |
| 2010 | * we have to unlink all watchers. We must not relink them if |
| 2011 | * this elt was the last one in the list. |
| 2012 | */ |
| 2013 | LIST_DEL(&bref->users); |
| 2014 | LIST_INIT(&bref->users); |
| 2015 | if (elt->list.n != &ref->head) |
Willy Tarreau | 49ee3b2 | 2019-04-30 11:43:43 +0200 | [diff] [blame] | 2016 | LIST_ADDQ(&LIST_ELEM(elt->list.n, typeof(elt), list)->back_refs, &bref->users); |
Emeric Brun | 8d85aa4 | 2017-06-29 15:40:33 +0200 | [diff] [blame] | 2017 | bref->ref = elt->list.n; |
| 2018 | } |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 2019 | LIST_DEL(&elt->list); |
| 2020 | free(elt->pattern); |
| 2021 | free(elt->sample); |
| 2022 | free(elt); |
Willy Tarreau | d1d005d | 2019-12-20 18:22:02 +0100 | [diff] [blame] | 2023 | loops++; |
| 2024 | if (loops > 100000) |
| 2025 | return 0; |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 2026 | } |
Willy Tarreau | d1d005d | 2019-12-20 18:22:02 +0100 | [diff] [blame] | 2027 | return 1; |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 2028 | } |
| 2029 | |
Willy Tarreau | a5bbaaf | 2020-10-30 16:03:50 +0100 | [diff] [blame] | 2030 | /* This function looks up any existing reference <ref> in pattern_head <head>, and |
| 2031 | * returns the associated pattern_expr pointer if found, otherwise NULL. |
| 2032 | */ |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 2033 | struct pattern_expr *pattern_lookup_expr(struct pattern_head *head, struct pat_ref *ref) |
| 2034 | { |
Thierry FOURNIER | c5959fd | 2014-01-20 14:29:33 +0100 | [diff] [blame] | 2035 | struct pattern_expr_list *expr; |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 2036 | |
Thierry FOURNIER | c5959fd | 2014-01-20 14:29:33 +0100 | [diff] [blame] | 2037 | list_for_each_entry(expr, &head->head, list) |
| 2038 | if (expr->expr->ref == ref) |
| 2039 | return expr->expr; |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 2040 | return NULL; |
| 2041 | } |
| 2042 | |
Joseph Herlant | 4189d67 | 2018-11-15 10:22:31 -0800 | [diff] [blame] | 2043 | /* This function creates new pattern_expr associated to the reference <ref>. |
| 2044 | * <ref> can be NULL. If an error occurs, the function returns NULL and |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 2045 | * <err> is filled. Otherwise, the function returns new pattern_expr linked |
| 2046 | * with <head> and <ref>. |
Thierry FOURNIER | 315ec42 | 2014-11-24 11:14:42 +0100 | [diff] [blame] | 2047 | * |
Joseph Herlant | 4189d67 | 2018-11-15 10:22:31 -0800 | [diff] [blame] | 2048 | * The returned value can be an already filled pattern list, in this case the |
Thierry FOURNIER | 315ec42 | 2014-11-24 11:14:42 +0100 | [diff] [blame] | 2049 | * flag <reuse> is set. |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 2050 | */ |
Thierry FOURNIER | 315ec42 | 2014-11-24 11:14:42 +0100 | [diff] [blame] | 2051 | struct pattern_expr *pattern_new_expr(struct pattern_head *head, struct pat_ref *ref, |
Emeric Brun | 7d27f3c | 2017-07-03 17:54:23 +0200 | [diff] [blame] | 2052 | int patflags, char **err, int *reuse) |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 2053 | { |
| 2054 | struct pattern_expr *expr; |
Thierry FOURNIER | c5959fd | 2014-01-20 14:29:33 +0100 | [diff] [blame] | 2055 | struct pattern_expr_list *list; |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 2056 | |
Thierry FOURNIER | 315ec42 | 2014-11-24 11:14:42 +0100 | [diff] [blame] | 2057 | if (reuse) |
| 2058 | *reuse = 0; |
| 2059 | |
Thierry FOURNIER | c5959fd | 2014-01-20 14:29:33 +0100 | [diff] [blame] | 2060 | /* Memory and initialization of the chain element. */ |
Willy Tarreau | 8135d9b | 2020-10-30 15:35:11 +0100 | [diff] [blame] | 2061 | list = calloc(1, sizeof(*list)); |
Thierry FOURNIER | c5959fd | 2014-01-20 14:29:33 +0100 | [diff] [blame] | 2062 | if (!list) { |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 2063 | memprintf(err, "out of memory"); |
| 2064 | return NULL; |
| 2065 | } |
| 2066 | |
Thierry FOURNIER | c5959fd | 2014-01-20 14:29:33 +0100 | [diff] [blame] | 2067 | /* Look for existing similar expr. No that only the index, parse and |
| 2068 | * parse_smp function must be identical for having similar pattern. |
Joseph Herlant | 4189d67 | 2018-11-15 10:22:31 -0800 | [diff] [blame] | 2069 | * The other function depends of these first. |
Thierry FOURNIER | c5959fd | 2014-01-20 14:29:33 +0100 | [diff] [blame] | 2070 | */ |
| 2071 | if (ref) { |
| 2072 | list_for_each_entry(expr, &ref->pat, list) |
| 2073 | if (expr->pat_head->index == head->index && |
| 2074 | expr->pat_head->parse == head->parse && |
Emeric Brun | 7d27f3c | 2017-07-03 17:54:23 +0200 | [diff] [blame] | 2075 | expr->pat_head->parse_smp == head->parse_smp && |
| 2076 | expr->mflags == patflags) |
Thierry FOURNIER | c5959fd | 2014-01-20 14:29:33 +0100 | [diff] [blame] | 2077 | break; |
| 2078 | if (&expr->list == &ref->pat) |
| 2079 | expr = NULL; |
| 2080 | } |
| 2081 | else |
| 2082 | expr = NULL; |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 2083 | |
Thierry FOURNIER | c5959fd | 2014-01-20 14:29:33 +0100 | [diff] [blame] | 2084 | /* If no similar expr was found, we create new expr. */ |
| 2085 | if (!expr) { |
| 2086 | /* Get a lot of memory for the expr struct. */ |
Willy Tarreau | 8135d9b | 2020-10-30 15:35:11 +0100 | [diff] [blame] | 2087 | expr = calloc(1, sizeof(*expr)); |
Thierry FOURNIER | c5959fd | 2014-01-20 14:29:33 +0100 | [diff] [blame] | 2088 | if (!expr) { |
Andreas Seltenreich | e6e22e8 | 2016-03-03 20:20:23 +0100 | [diff] [blame] | 2089 | free(list); |
Thierry FOURNIER | c5959fd | 2014-01-20 14:29:33 +0100 | [diff] [blame] | 2090 | memprintf(err, "out of memory"); |
| 2091 | return NULL; |
| 2092 | } |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 2093 | |
Thierry FOURNIER | c5959fd | 2014-01-20 14:29:33 +0100 | [diff] [blame] | 2094 | /* Initialize this new expr. */ |
| 2095 | pattern_init_expr(expr); |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 2096 | |
Emeric Brun | 7d27f3c | 2017-07-03 17:54:23 +0200 | [diff] [blame] | 2097 | /* Copy the pattern matching and indexing flags. */ |
| 2098 | expr->mflags = patflags; |
| 2099 | |
Thierry FOURNIER | c5959fd | 2014-01-20 14:29:33 +0100 | [diff] [blame] | 2100 | /* This new pattern expression reference one of his heads. */ |
| 2101 | expr->pat_head = head; |
| 2102 | |
| 2103 | /* Link with ref, or to self to facilitate LIST_DEL() */ |
| 2104 | if (ref) |
| 2105 | LIST_ADDQ(&ref->pat, &expr->list); |
| 2106 | else |
| 2107 | LIST_INIT(&expr->list); |
| 2108 | |
| 2109 | expr->ref = ref; |
| 2110 | |
Christopher Faulet | 2a944ee | 2017-11-07 10:42:54 +0100 | [diff] [blame] | 2111 | HA_RWLOCK_INIT(&expr->lock); |
Emeric Brun | b5997f7 | 2017-07-03 11:34:05 +0200 | [diff] [blame] | 2112 | |
Thierry FOURNIER | c5959fd | 2014-01-20 14:29:33 +0100 | [diff] [blame] | 2113 | /* We must free this pattern if it is no more used. */ |
| 2114 | list->do_free = 1; |
| 2115 | } |
| 2116 | else { |
| 2117 | /* If the pattern used already exists, it is already linked |
| 2118 | * with ref and we must not free it. |
| 2119 | */ |
| 2120 | list->do_free = 0; |
Thierry FOURNIER | 315ec42 | 2014-11-24 11:14:42 +0100 | [diff] [blame] | 2121 | if (reuse) |
| 2122 | *reuse = 1; |
Thierry FOURNIER | c5959fd | 2014-01-20 14:29:33 +0100 | [diff] [blame] | 2123 | } |
| 2124 | |
| 2125 | /* The new list element reference the pattern_expr. */ |
| 2126 | list->expr = expr; |
| 2127 | |
| 2128 | /* Link the list element with the pattern_head. */ |
| 2129 | LIST_ADDQ(&head->head, &list->list); |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 2130 | return expr; |
| 2131 | } |
| 2132 | |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 2133 | /* Reads patterns from a file. If <err_msg> is non-NULL, an error message will |
| 2134 | * be returned there on errors and the caller will have to free it. |
Thierry FOURNIER | 39bef45 | 2014-01-29 13:29:45 +0100 | [diff] [blame] | 2135 | * |
| 2136 | * The file contains one key + value per line. Lines which start with '#' are |
| 2137 | * ignored, just like empty lines. Leading tabs/spaces are stripped. The key is |
| 2138 | * then the first "word" (series of non-space/tabs characters), and the value is |
| 2139 | * what follows this series of space/tab till the end of the line excluding |
| 2140 | * trailing spaces/tabs. |
| 2141 | * |
| 2142 | * Example : |
| 2143 | * |
| 2144 | * # this is a comment and is ignored |
| 2145 | * 62.212.114.60 1wt.eu \n |
| 2146 | * <-><-----------><---><----><----> |
| 2147 | * | | | | `--- trailing spaces ignored |
| 2148 | * | | | `-------- value |
| 2149 | * | | `--------------- middle spaces ignored |
| 2150 | * | `------------------------ key |
| 2151 | * `-------------------------------- leading spaces ignored |
| 2152 | * |
Ilya Shipitsin | 47d1718 | 2020-06-21 21:42:57 +0500 | [diff] [blame] | 2153 | * Return non-zero in case of success, otherwise 0. |
Thierry FOURNIER | 39bef45 | 2014-01-29 13:29:45 +0100 | [diff] [blame] | 2154 | */ |
| 2155 | int pat_ref_read_from_file_smp(struct pat_ref *ref, const char *filename, char **err) |
| 2156 | { |
| 2157 | FILE *file; |
| 2158 | char *c; |
| 2159 | int ret = 0; |
| 2160 | int line = 0; |
| 2161 | char *key_beg; |
| 2162 | char *key_end; |
| 2163 | char *value_beg; |
| 2164 | char *value_end; |
| 2165 | |
| 2166 | file = fopen(filename, "r"); |
| 2167 | if (!file) { |
| 2168 | memprintf(err, "failed to open pattern file <%s>", filename); |
| 2169 | return 0; |
| 2170 | } |
| 2171 | |
| 2172 | /* now parse all patterns. The file may contain only one pattern |
| 2173 | * followed by one value per line. The start spaces, separator spaces |
| 2174 | * and and spaces are stripped. Each can contain comment started by '#' |
| 2175 | */ |
Willy Tarreau | 843b7cb | 2018-07-13 10:54:26 +0200 | [diff] [blame] | 2176 | while (fgets(trash.area, trash.size, file) != NULL) { |
Thierry FOURNIER | 39bef45 | 2014-01-29 13:29:45 +0100 | [diff] [blame] | 2177 | line++; |
Willy Tarreau | 843b7cb | 2018-07-13 10:54:26 +0200 | [diff] [blame] | 2178 | c = trash.area; |
Thierry FOURNIER | 39bef45 | 2014-01-29 13:29:45 +0100 | [diff] [blame] | 2179 | |
| 2180 | /* ignore lines beginning with a dash */ |
| 2181 | if (*c == '#') |
| 2182 | continue; |
| 2183 | |
| 2184 | /* strip leading spaces and tabs */ |
| 2185 | while (*c == ' ' || *c == '\t') |
| 2186 | c++; |
| 2187 | |
| 2188 | /* empty lines are ignored too */ |
| 2189 | if (*c == '\0' || *c == '\r' || *c == '\n') |
| 2190 | continue; |
| 2191 | |
| 2192 | /* look for the end of the key */ |
| 2193 | key_beg = c; |
| 2194 | while (*c && *c != ' ' && *c != '\t' && *c != '\n' && *c != '\r') |
| 2195 | c++; |
| 2196 | |
| 2197 | key_end = c; |
| 2198 | |
| 2199 | /* strip middle spaces and tabs */ |
| 2200 | while (*c == ' ' || *c == '\t') |
| 2201 | c++; |
| 2202 | |
| 2203 | /* look for the end of the value, it is the end of the line */ |
| 2204 | value_beg = c; |
| 2205 | while (*c && *c != '\n' && *c != '\r') |
| 2206 | c++; |
| 2207 | value_end = c; |
| 2208 | |
| 2209 | /* trim possibly trailing spaces and tabs */ |
| 2210 | while (value_end > value_beg && (value_end[-1] == ' ' || value_end[-1] == '\t')) |
| 2211 | value_end--; |
| 2212 | |
| 2213 | /* set final \0 and check entries */ |
| 2214 | *key_end = '\0'; |
| 2215 | *value_end = '\0'; |
| 2216 | |
| 2217 | /* insert values */ |
| 2218 | if (!pat_ref_append(ref, key_beg, value_beg, line)) { |
| 2219 | memprintf(err, "out of memory"); |
| 2220 | goto out_close; |
| 2221 | } |
| 2222 | } |
| 2223 | |
Jerome Magnin | 3c79d4b | 2020-01-17 16:09:33 +0100 | [diff] [blame] | 2224 | if (ferror(file)) { |
| 2225 | memprintf(err, "error encountered while reading <%s> : %s", |
| 2226 | filename, strerror(errno)); |
| 2227 | goto out_close; |
| 2228 | } |
Ilya Shipitsin | 47d1718 | 2020-06-21 21:42:57 +0500 | [diff] [blame] | 2229 | /* success */ |
Thierry FOURNIER | 39bef45 | 2014-01-29 13:29:45 +0100 | [diff] [blame] | 2230 | ret = 1; |
| 2231 | |
| 2232 | out_close: |
| 2233 | fclose(file); |
| 2234 | return ret; |
| 2235 | } |
| 2236 | |
| 2237 | /* Reads patterns from a file. If <err_msg> is non-NULL, an error message will |
| 2238 | * be returned there on errors and the caller will have to free it. |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 2239 | */ |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 2240 | int pat_ref_read_from_file(struct pat_ref *ref, const char *filename, char **err) |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 2241 | { |
| 2242 | FILE *file; |
| 2243 | char *c; |
| 2244 | char *arg; |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 2245 | int ret = 0; |
| 2246 | int line = 0; |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 2247 | |
| 2248 | file = fopen(filename, "r"); |
| 2249 | if (!file) { |
| 2250 | memprintf(err, "failed to open pattern file <%s>", filename); |
| 2251 | return 0; |
| 2252 | } |
| 2253 | |
| 2254 | /* now parse all patterns. The file may contain only one pattern per |
| 2255 | * line. If the line contains spaces, they will be part of the pattern. |
| 2256 | * The pattern stops at the first CR, LF or EOF encountered. |
| 2257 | */ |
Willy Tarreau | 843b7cb | 2018-07-13 10:54:26 +0200 | [diff] [blame] | 2258 | while (fgets(trash.area, trash.size, file) != NULL) { |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 2259 | line++; |
Willy Tarreau | 843b7cb | 2018-07-13 10:54:26 +0200 | [diff] [blame] | 2260 | c = trash.area; |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 2261 | |
| 2262 | /* ignore lines beginning with a dash */ |
| 2263 | if (*c == '#') |
| 2264 | continue; |
| 2265 | |
| 2266 | /* strip leading spaces and tabs */ |
| 2267 | while (*c == ' ' || *c == '\t') |
| 2268 | c++; |
| 2269 | |
| 2270 | |
| 2271 | arg = c; |
| 2272 | while (*c && *c != '\n' && *c != '\r') |
| 2273 | c++; |
| 2274 | *c = 0; |
| 2275 | |
| 2276 | /* empty lines are ignored too */ |
| 2277 | if (c == arg) |
| 2278 | continue; |
| 2279 | |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 2280 | if (!pat_ref_append(ref, arg, NULL, line)) { |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 2281 | memprintf(err, "out of memory when loading patterns from file <%s>", filename); |
| 2282 | goto out_close; |
| 2283 | } |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 2284 | } |
| 2285 | |
Jerome Magnin | 3c79d4b | 2020-01-17 16:09:33 +0100 | [diff] [blame] | 2286 | if (ferror(file)) { |
| 2287 | memprintf(err, "error encountered while reading <%s> : %s", |
| 2288 | filename, strerror(errno)); |
| 2289 | goto out_close; |
| 2290 | } |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 2291 | ret = 1; /* success */ |
| 2292 | |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 2293 | out_close: |
| 2294 | fclose(file); |
| 2295 | return ret; |
| 2296 | } |
| 2297 | |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 2298 | int pattern_read_from_file(struct pattern_head *head, unsigned int refflags, |
Thierry FOURNIER | 39bef45 | 2014-01-29 13:29:45 +0100 | [diff] [blame] | 2299 | const char *filename, int patflags, int load_smp, |
Thierry FOURNIER | 94580c9 | 2014-02-11 14:36:45 +0100 | [diff] [blame] | 2300 | char **err, const char *file, int line) |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 2301 | { |
| 2302 | struct pat_ref *ref; |
| 2303 | struct pattern_expr *expr; |
Thierry FOURNIER | 39bef45 | 2014-01-29 13:29:45 +0100 | [diff] [blame] | 2304 | struct pat_ref_elt *elt; |
Willy Tarreau | 4deaf39 | 2014-11-26 13:17:03 +0100 | [diff] [blame] | 2305 | int reuse = 0; |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 2306 | |
Thierry FOURNIER | af5a29d | 2014-03-11 14:29:22 +0100 | [diff] [blame] | 2307 | /* Lookup for the existing reference. */ |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 2308 | ref = pat_ref_lookup(filename); |
Thierry FOURNIER | af5a29d | 2014-03-11 14:29:22 +0100 | [diff] [blame] | 2309 | |
| 2310 | /* If the reference doesn't exists, create it and load associated file. */ |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 2311 | if (!ref) { |
Thierry FOURNIER | 94580c9 | 2014-02-11 14:36:45 +0100 | [diff] [blame] | 2312 | chunk_printf(&trash, |
| 2313 | "pattern loaded from file '%s' used by %s at file '%s' line %d", |
| 2314 | filename, refflags & PAT_REF_MAP ? "map" : "acl", file, line); |
| 2315 | |
Willy Tarreau | 843b7cb | 2018-07-13 10:54:26 +0200 | [diff] [blame] | 2316 | ref = pat_ref_new(filename, trash.area, refflags); |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 2317 | if (!ref) { |
| 2318 | memprintf(err, "out of memory"); |
| 2319 | return 0; |
| 2320 | } |
| 2321 | |
Thierry FOURNIER | 39bef45 | 2014-01-29 13:29:45 +0100 | [diff] [blame] | 2322 | if (load_smp) { |
Thierry FOURNIER | c0bd910 | 2014-01-29 12:32:58 +0100 | [diff] [blame] | 2323 | ref->flags |= PAT_REF_SMP; |
Thierry FOURNIER | 39bef45 | 2014-01-29 13:29:45 +0100 | [diff] [blame] | 2324 | if (!pat_ref_read_from_file_smp(ref, filename, err)) |
| 2325 | return 0; |
| 2326 | } |
| 2327 | else { |
| 2328 | if (!pat_ref_read_from_file(ref, filename, err)) |
| 2329 | return 0; |
| 2330 | } |
| 2331 | } |
| 2332 | else { |
Thierry FOURNIER | c0bd910 | 2014-01-29 12:32:58 +0100 | [diff] [blame] | 2333 | /* The reference already exists, check the map compatibility. */ |
| 2334 | |
| 2335 | /* If the load require samples and the flag PAT_REF_SMP is not set, |
| 2336 | * the reference doesn't contain sample, and cannot be used. |
| 2337 | */ |
| 2338 | if (load_smp) { |
| 2339 | if (!(ref->flags & PAT_REF_SMP)) { |
| 2340 | memprintf(err, "The file \"%s\" is already used as one column file " |
| 2341 | "and cannot be used by as two column file.", |
| 2342 | filename); |
| 2343 | return 0; |
| 2344 | } |
| 2345 | } |
| 2346 | else { |
| 2347 | /* The load doesn't require samples. If the flag PAT_REF_SMP is |
| 2348 | * set, the reference contains a sample, and cannot be used. |
| 2349 | */ |
| 2350 | if (ref->flags & PAT_REF_SMP) { |
| 2351 | memprintf(err, "The file \"%s\" is already used as two column file " |
| 2352 | "and cannot be used by as one column file.", |
| 2353 | filename); |
| 2354 | return 0; |
| 2355 | } |
| 2356 | } |
| 2357 | |
Thierry FOURNIER | 94580c9 | 2014-02-11 14:36:45 +0100 | [diff] [blame] | 2358 | /* Extends display */ |
| 2359 | chunk_printf(&trash, "%s", ref->display); |
| 2360 | chunk_appendf(&trash, ", by %s at file '%s' line %d", |
| 2361 | refflags & PAT_REF_MAP ? "map" : "acl", file, line); |
| 2362 | free(ref->display); |
Willy Tarreau | 843b7cb | 2018-07-13 10:54:26 +0200 | [diff] [blame] | 2363 | ref->display = strdup(trash.area); |
Thierry FOURNIER | 94580c9 | 2014-02-11 14:36:45 +0100 | [diff] [blame] | 2364 | if (!ref->display) { |
| 2365 | memprintf(err, "out of memory"); |
| 2366 | return 0; |
| 2367 | } |
| 2368 | |
Thierry FOURNIER | c0bd910 | 2014-01-29 12:32:58 +0100 | [diff] [blame] | 2369 | /* Merge flags. */ |
Thierry FOURNIER | 39bef45 | 2014-01-29 13:29:45 +0100 | [diff] [blame] | 2370 | ref->flags |= refflags; |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 2371 | } |
| 2372 | |
| 2373 | /* Now, we can loading patterns from the reference. */ |
| 2374 | |
| 2375 | /* Lookup for existing reference in the head. If the reference |
| 2376 | * doesn't exists, create it. |
| 2377 | */ |
| 2378 | expr = pattern_lookup_expr(head, ref); |
Thierry FOURNIER | e47e4e2 | 2014-04-28 11:18:57 +0200 | [diff] [blame] | 2379 | if (!expr || (expr->mflags != patflags)) { |
Emeric Brun | 7d27f3c | 2017-07-03 17:54:23 +0200 | [diff] [blame] | 2380 | expr = pattern_new_expr(head, ref, patflags, err, &reuse); |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 2381 | if (!expr) |
| 2382 | return 0; |
| 2383 | } |
| 2384 | |
Thierry FOURNIER | 315ec42 | 2014-11-24 11:14:42 +0100 | [diff] [blame] | 2385 | /* The returned expression may be not empty, because the function |
| 2386 | * "pattern_new_expr" lookup for similar pattern list and can |
| 2387 | * reuse a already filled pattern list. In this case, we can not |
| 2388 | * reload the patterns. |
| 2389 | */ |
| 2390 | if (reuse) |
| 2391 | return 1; |
| 2392 | |
Thierry FOURNIER | 39bef45 | 2014-01-29 13:29:45 +0100 | [diff] [blame] | 2393 | /* Load reference content in the pattern expression. */ |
| 2394 | list_for_each_entry(elt, &ref->head, list) { |
| 2395 | if (!pat_ref_push(elt, expr, patflags, err)) { |
| 2396 | if (elt->line > 0) |
| 2397 | memprintf(err, "%s at line %d of file '%s'", |
| 2398 | *err, elt->line, filename); |
| 2399 | return 0; |
| 2400 | } |
| 2401 | } |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 2402 | |
| 2403 | return 1; |
| 2404 | } |
| 2405 | |
Thierry FOURNIER | 1794fdf | 2014-01-17 15:25:13 +0100 | [diff] [blame] | 2406 | /* This function executes a pattern match on a sample. It applies pattern <expr> |
| 2407 | * to sample <smp>. The function returns NULL if the sample dont match. It returns |
| 2408 | * non-null if the sample match. If <fill> is true and the sample match, the |
| 2409 | * function returns the matched pattern. In many cases, this pattern can be a |
| 2410 | * static buffer. |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 2411 | */ |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 2412 | struct pattern *pattern_exec_match(struct pattern_head *head, struct sample *smp, int fill) |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 2413 | { |
Thierry FOURNIER | c5959fd | 2014-01-20 14:29:33 +0100 | [diff] [blame] | 2414 | struct pattern_expr_list *list; |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 2415 | struct pattern *pat; |
| 2416 | |
| 2417 | if (!head->match) { |
Thierry FOURNIER | 1794fdf | 2014-01-17 15:25:13 +0100 | [diff] [blame] | 2418 | if (fill) { |
Thierry FOURNIER | 503bb09 | 2015-08-19 08:35:43 +0200 | [diff] [blame] | 2419 | static_pattern.data = NULL; |
Thierry FOURNIER | 6bb53ff | 2014-01-28 15:54:36 +0100 | [diff] [blame] | 2420 | static_pattern.ref = NULL; |
Thierry FOURNIER | e47e4e2 | 2014-04-28 11:18:57 +0200 | [diff] [blame] | 2421 | static_pattern.sflags = 0; |
Thierry FOURNIER | 07ee64e | 2015-07-06 23:43:03 +0200 | [diff] [blame] | 2422 | static_pattern.type = SMP_T_SINT; |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 2423 | static_pattern.val.i = 1; |
Thierry FOURNIER | 1794fdf | 2014-01-17 15:25:13 +0100 | [diff] [blame] | 2424 | } |
Thierry FOURNIER | 1794fdf | 2014-01-17 15:25:13 +0100 | [diff] [blame] | 2425 | return &static_pattern; |
| 2426 | } |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 2427 | |
Thierry FOURNIER | 5d34408 | 2014-01-27 14:19:53 +0100 | [diff] [blame] | 2428 | /* convert input to string */ |
| 2429 | if (!sample_convert(smp, head->expect_type)) |
| 2430 | return NULL; |
| 2431 | |
Thierry FOURNIER | c5959fd | 2014-01-20 14:29:33 +0100 | [diff] [blame] | 2432 | list_for_each_entry(list, &head->head, list) { |
Christopher Faulet | 2a944ee | 2017-11-07 10:42:54 +0100 | [diff] [blame] | 2433 | HA_RWLOCK_RDLOCK(PATEXP_LOCK, &list->expr->lock); |
Thierry FOURNIER | c5959fd | 2014-01-20 14:29:33 +0100 | [diff] [blame] | 2434 | pat = head->match(smp, list->expr, fill); |
Emeric Brun | b5997f7 | 2017-07-03 11:34:05 +0200 | [diff] [blame] | 2435 | if (pat) { |
| 2436 | /* We duplicate the pattern cause it could be modified |
| 2437 | by another thread */ |
| 2438 | if (pat != &static_pattern) { |
| 2439 | memcpy(&static_pattern, pat, sizeof(struct pattern)); |
| 2440 | pat = &static_pattern; |
| 2441 | } |
| 2442 | |
| 2443 | /* We also duplicate the sample data for |
| 2444 | same reason */ |
| 2445 | if (pat->data && (pat->data != &static_sample_data)) { |
Christopher Faulet | 09fdf4b | 2017-11-09 16:14:16 +0100 | [diff] [blame] | 2446 | switch(pat->data->type) { |
Emeric Brun | b5997f7 | 2017-07-03 11:34:05 +0200 | [diff] [blame] | 2447 | case SMP_T_STR: |
| 2448 | static_sample_data.type = SMP_T_STR; |
| 2449 | static_sample_data.u.str = *get_trash_chunk(); |
Willy Tarreau | 843b7cb | 2018-07-13 10:54:26 +0200 | [diff] [blame] | 2450 | static_sample_data.u.str.data = pat->data->u.str.data; |
| 2451 | if (static_sample_data.u.str.data >= static_sample_data.u.str.size) |
| 2452 | static_sample_data.u.str.data = static_sample_data.u.str.size - 1; |
| 2453 | memcpy(static_sample_data.u.str.area, |
Willy Tarreau | 2fc761e | 2020-06-11 16:37:35 +0200 | [diff] [blame] | 2454 | pat->data->u.str.area, static_sample_data.u.str.data); |
Willy Tarreau | 843b7cb | 2018-07-13 10:54:26 +0200 | [diff] [blame] | 2455 | static_sample_data.u.str.area[static_sample_data.u.str.data] = 0; |
Willy Tarreau | 2fc761e | 2020-06-11 16:37:35 +0200 | [diff] [blame] | 2456 | pat->data = &static_sample_data; |
| 2457 | break; |
| 2458 | |
Emeric Brun | b5997f7 | 2017-07-03 11:34:05 +0200 | [diff] [blame] | 2459 | case SMP_T_IPV4: |
| 2460 | case SMP_T_IPV6: |
| 2461 | case SMP_T_SINT: |
| 2462 | memcpy(&static_sample_data, pat->data, sizeof(struct sample_data)); |
Willy Tarreau | 2fc761e | 2020-06-11 16:37:35 +0200 | [diff] [blame] | 2463 | pat->data = &static_sample_data; |
| 2464 | break; |
Emeric Brun | b5997f7 | 2017-07-03 11:34:05 +0200 | [diff] [blame] | 2465 | default: |
Willy Tarreau | 2fc761e | 2020-06-11 16:37:35 +0200 | [diff] [blame] | 2466 | /* unimplemented pattern type */ |
Emeric Brun | b5997f7 | 2017-07-03 11:34:05 +0200 | [diff] [blame] | 2467 | pat->data = NULL; |
Willy Tarreau | 2fc761e | 2020-06-11 16:37:35 +0200 | [diff] [blame] | 2468 | break; |
Emeric Brun | b5997f7 | 2017-07-03 11:34:05 +0200 | [diff] [blame] | 2469 | } |
Emeric Brun | b5997f7 | 2017-07-03 11:34:05 +0200 | [diff] [blame] | 2470 | } |
Christopher Faulet | 2a944ee | 2017-11-07 10:42:54 +0100 | [diff] [blame] | 2471 | HA_RWLOCK_RDUNLOCK(PATEXP_LOCK, &list->expr->lock); |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 2472 | return pat; |
Emeric Brun | b5997f7 | 2017-07-03 11:34:05 +0200 | [diff] [blame] | 2473 | } |
Christopher Faulet | 2a944ee | 2017-11-07 10:42:54 +0100 | [diff] [blame] | 2474 | HA_RWLOCK_RDUNLOCK(PATEXP_LOCK, &list->expr->lock); |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 2475 | } |
| 2476 | return NULL; |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 2477 | } |
| 2478 | |
Willy Tarreau | a5bbaaf | 2020-10-30 16:03:50 +0100 | [diff] [blame] | 2479 | /* This function prunes the pattern expressions starting at pattern_head <head>. */ |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 2480 | void pattern_prune(struct pattern_head *head) |
Thierry FOURNIER | 6f7203d | 2014-01-14 16:24:51 +0100 | [diff] [blame] | 2481 | { |
Thierry FOURNIER | c5959fd | 2014-01-20 14:29:33 +0100 | [diff] [blame] | 2482 | struct pattern_expr_list *list, *safe; |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 2483 | |
Thierry FOURNIER | c5959fd | 2014-01-20 14:29:33 +0100 | [diff] [blame] | 2484 | list_for_each_entry_safe(list, safe, &head->head, list) { |
| 2485 | LIST_DEL(&list->list); |
| 2486 | if (list->do_free) { |
| 2487 | LIST_DEL(&list->expr->list); |
Christopher Faulet | 2a944ee | 2017-11-07 10:42:54 +0100 | [diff] [blame] | 2488 | HA_RWLOCK_WRLOCK(PATEXP_LOCK, &list->expr->lock); |
Thierry FOURNIER | c5959fd | 2014-01-20 14:29:33 +0100 | [diff] [blame] | 2489 | head->prune(list->expr); |
Christopher Faulet | 2a944ee | 2017-11-07 10:42:54 +0100 | [diff] [blame] | 2490 | HA_RWLOCK_WRUNLOCK(PATEXP_LOCK, &list->expr->lock); |
Thierry FOURNIER | c5959fd | 2014-01-20 14:29:33 +0100 | [diff] [blame] | 2491 | free(list->expr); |
| 2492 | } |
| 2493 | free(list); |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 2494 | } |
Thierry FOURNIER | 6f7203d | 2014-01-14 16:24:51 +0100 | [diff] [blame] | 2495 | } |
| 2496 | |
Willy Tarreau | a5bbaaf | 2020-10-30 16:03:50 +0100 | [diff] [blame] | 2497 | /* This function searches occurrences of pattern reference element <ref> in |
| 2498 | * expression <expr> and returns a pointer to a pointer of the sample storage. |
| 2499 | * If <ref> is not found, NULL is returned. |
Thierry FOURNIER | 55d0b10 | 2014-01-15 11:25:26 +0100 | [diff] [blame] | 2500 | */ |
Thierry FOURNIER | 12ba0c2 | 2015-08-14 00:02:11 +0200 | [diff] [blame] | 2501 | struct sample_data **pattern_find_smp(struct pattern_expr *expr, struct pat_ref_elt *ref) |
Thierry FOURNIER | 55d0b10 | 2014-01-15 11:25:26 +0100 | [diff] [blame] | 2502 | { |
Thierry FOURNIER | e369ca2 | 2014-01-29 16:24:55 +0100 | [diff] [blame] | 2503 | struct ebmb_node *node; |
| 2504 | struct pattern_tree *elt; |
| 2505 | struct pattern_list *pat; |
Thierry FOURNIER | 55d0b10 | 2014-01-15 11:25:26 +0100 | [diff] [blame] | 2506 | |
Thierry FOURNIER | e369ca2 | 2014-01-29 16:24:55 +0100 | [diff] [blame] | 2507 | for (node = ebmb_first(&expr->pattern_tree); |
| 2508 | node; |
| 2509 | node = ebmb_next(node)) { |
| 2510 | elt = container_of(node, struct pattern_tree, node); |
| 2511 | if (elt->ref == ref) |
Thierry FOURNIER | 503bb09 | 2015-08-19 08:35:43 +0200 | [diff] [blame] | 2512 | return &elt->data; |
Thierry FOURNIER | e369ca2 | 2014-01-29 16:24:55 +0100 | [diff] [blame] | 2513 | } |
| 2514 | |
| 2515 | for (node = ebmb_first(&expr->pattern_tree_2); |
| 2516 | node; |
| 2517 | node = ebmb_next(node)) { |
| 2518 | elt = container_of(node, struct pattern_tree, node); |
| 2519 | if (elt->ref == ref) |
Thierry FOURNIER | 503bb09 | 2015-08-19 08:35:43 +0200 | [diff] [blame] | 2520 | return &elt->data; |
Thierry FOURNIER | e369ca2 | 2014-01-29 16:24:55 +0100 | [diff] [blame] | 2521 | } |
| 2522 | |
| 2523 | list_for_each_entry(pat, &expr->patterns, list) |
| 2524 | if (pat->pat.ref == ref) |
Thierry FOURNIER | 503bb09 | 2015-08-19 08:35:43 +0200 | [diff] [blame] | 2525 | return &pat->pat.data; |
Thierry FOURNIER | e369ca2 | 2014-01-29 16:24:55 +0100 | [diff] [blame] | 2526 | |
| 2527 | return NULL; |
Thierry FOURNIER | 55d0b10 | 2014-01-15 11:25:26 +0100 | [diff] [blame] | 2528 | } |
| 2529 | |
Willy Tarreau | a5bbaaf | 2020-10-30 16:03:50 +0100 | [diff] [blame] | 2530 | /* This function compares two pat_ref** on their unique_id, and returns -1/0/1 |
| 2531 | * depending on their order (suitable for sorting). |
| 2532 | */ |
Carl Henrik Lunde | f91ac19 | 2020-02-27 16:45:50 +0100 | [diff] [blame] | 2533 | static int cmp_pat_ref(const void *_a, const void *_b) |
| 2534 | { |
| 2535 | struct pat_ref * const *a = _a; |
| 2536 | struct pat_ref * const *b = _b; |
| 2537 | |
| 2538 | if ((*a)->unique_id < (*b)->unique_id) |
| 2539 | return -1; |
| 2540 | else if ((*a)->unique_id > (*b)->unique_id) |
| 2541 | return 1; |
| 2542 | return 0; |
| 2543 | } |
| 2544 | |
Willy Tarreau | a5bbaaf | 2020-10-30 16:03:50 +0100 | [diff] [blame] | 2545 | /* This function finalizes the configuration parsing. It sets all the |
| 2546 | * automatic ids. |
Thierry FOURNIER | af5a29d | 2014-03-11 14:29:22 +0100 | [diff] [blame] | 2547 | */ |
Carl Henrik Lunde | f91ac19 | 2020-02-27 16:45:50 +0100 | [diff] [blame] | 2548 | int pattern_finalize_config(void) |
Thierry FOURNIER | af5a29d | 2014-03-11 14:29:22 +0100 | [diff] [blame] | 2549 | { |
Tim Duesterhus | b584b44 | 2020-03-17 21:08:24 +0100 | [diff] [blame] | 2550 | size_t len = 0; |
| 2551 | size_t unassigned_pos = 0; |
Carl Henrik Lunde | f91ac19 | 2020-02-27 16:45:50 +0100 | [diff] [blame] | 2552 | int next_unique_id = 0; |
Tim Duesterhus | b584b44 | 2020-03-17 21:08:24 +0100 | [diff] [blame] | 2553 | size_t i, j; |
Carl Henrik Lunde | f91ac19 | 2020-02-27 16:45:50 +0100 | [diff] [blame] | 2554 | struct pat_ref *ref, **arr; |
Thierry FOURNIER | af5a29d | 2014-03-11 14:29:22 +0100 | [diff] [blame] | 2555 | struct list pr = LIST_HEAD_INIT(pr); |
| 2556 | |
Willy Tarreau | 52bf839 | 2020-03-08 00:42:37 +0100 | [diff] [blame] | 2557 | pat_lru_seed = ha_random(); |
Willy Tarreau | f3045d2 | 2015-04-29 16:24:50 +0200 | [diff] [blame] | 2558 | |
Carl Henrik Lunde | f91ac19 | 2020-02-27 16:45:50 +0100 | [diff] [blame] | 2559 | /* Count pat_refs with user defined unique_id and totalt count */ |
Thierry FOURNIER | af5a29d | 2014-03-11 14:29:22 +0100 | [diff] [blame] | 2560 | list_for_each_entry(ref, &pattern_reference, list) { |
Carl Henrik Lunde | f91ac19 | 2020-02-27 16:45:50 +0100 | [diff] [blame] | 2561 | len++; |
| 2562 | if (ref->unique_id != -1) |
| 2563 | unassigned_pos++; |
| 2564 | } |
Thierry FOURNIER | af5a29d | 2014-03-11 14:29:22 +0100 | [diff] [blame] | 2565 | |
Tim Duesterhus | b584b44 | 2020-03-17 21:08:24 +0100 | [diff] [blame] | 2566 | if (len == 0) { |
| 2567 | return 0; |
| 2568 | } |
| 2569 | |
Carl Henrik Lunde | f91ac19 | 2020-02-27 16:45:50 +0100 | [diff] [blame] | 2570 | arr = calloc(len, sizeof(*arr)); |
| 2571 | if (arr == NULL) { |
| 2572 | ha_alert("Out of memory error.\n"); |
| 2573 | return ERR_ALERT | ERR_FATAL; |
Thierry FOURNIER | af5a29d | 2014-03-11 14:29:22 +0100 | [diff] [blame] | 2574 | } |
| 2575 | |
Carl Henrik Lunde | f91ac19 | 2020-02-27 16:45:50 +0100 | [diff] [blame] | 2576 | i = 0; |
| 2577 | j = unassigned_pos; |
| 2578 | list_for_each_entry(ref, &pattern_reference, list) { |
| 2579 | if (ref->unique_id != -1) |
| 2580 | arr[i++] = ref; |
| 2581 | else |
| 2582 | arr[j++] = ref; |
Thierry FOURNIER | af5a29d | 2014-03-11 14:29:22 +0100 | [diff] [blame] | 2583 | } |
| 2584 | |
Carl Henrik Lunde | f91ac19 | 2020-02-27 16:45:50 +0100 | [diff] [blame] | 2585 | /* Sort first segment of array with user-defined unique ids for |
| 2586 | * fast lookup when generating unique ids |
| 2587 | */ |
| 2588 | qsort(arr, unassigned_pos, sizeof(*arr), cmp_pat_ref); |
| 2589 | |
| 2590 | /* Assign unique ids to the rest of the elements */ |
| 2591 | for (i = unassigned_pos; i < len; i++) { |
| 2592 | do { |
| 2593 | arr[i]->unique_id = next_unique_id++; |
| 2594 | } while (bsearch(&arr[i], arr, unassigned_pos, sizeof(*arr), cmp_pat_ref)); |
| 2595 | } |
| 2596 | |
| 2597 | /* Sort complete array */ |
| 2598 | qsort(arr, len, sizeof(*arr), cmp_pat_ref); |
| 2599 | |
| 2600 | /* Convert back to linked list */ |
| 2601 | for (i = 0; i < len; i++) |
| 2602 | LIST_ADDQ(&pr, &arr[i]->list); |
| 2603 | |
Thierry FOURNIER | af5a29d | 2014-03-11 14:29:22 +0100 | [diff] [blame] | 2604 | /* swap root */ |
| 2605 | LIST_ADD(&pr, &pattern_reference); |
| 2606 | LIST_DEL(&pr); |
Carl Henrik Lunde | f91ac19 | 2020-02-27 16:45:50 +0100 | [diff] [blame] | 2607 | |
| 2608 | free(arr); |
| 2609 | return 0; |
Thierry FOURNIER | af5a29d | 2014-03-11 14:29:22 +0100 | [diff] [blame] | 2610 | } |
Willy Tarreau | 403bfbb | 2019-10-23 06:59:31 +0200 | [diff] [blame] | 2611 | |
| 2612 | static int pattern_per_thread_lru_alloc() |
| 2613 | { |
| 2614 | if (!global.tune.pattern_cache) |
| 2615 | return 1; |
| 2616 | pat_lru_tree = lru64_new(global.tune.pattern_cache); |
| 2617 | return !!pat_lru_tree; |
| 2618 | } |
| 2619 | |
| 2620 | static void pattern_per_thread_lru_free() |
| 2621 | { |
| 2622 | lru64_destroy(pat_lru_tree); |
| 2623 | } |
| 2624 | |
| 2625 | REGISTER_PER_THREAD_ALLOC(pattern_per_thread_lru_alloc); |
| 2626 | REGISTER_PER_THREAD_FREE(pattern_per_thread_lru_free); |