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