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> |
| 15 | |
| 16 | #include <common/config.h> |
| 17 | #include <common/standard.h> |
| 18 | |
| 19 | #include <types/global.h> |
| 20 | #include <types/pattern.h> |
| 21 | |
| 22 | #include <proto/pattern.h> |
Thierry FOURNIER | e3ded59 | 2013-12-06 15:36:54 +0100 | [diff] [blame] | 23 | #include <proto/sample.h> |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 24 | |
| 25 | #include <ebsttree.h> |
| 26 | |
Thierry FOURNIER | a65b343 | 2013-11-28 18:22:00 +0100 | [diff] [blame] | 27 | char *pat_match_names[PAT_MATCH_NUM] = { |
| 28 | [PAT_MATCH_FOUND] = "found", |
| 29 | [PAT_MATCH_BOOL] = "bool", |
| 30 | [PAT_MATCH_INT] = "int", |
| 31 | [PAT_MATCH_IP] = "ip", |
| 32 | [PAT_MATCH_BIN] = "bin", |
| 33 | [PAT_MATCH_LEN] = "len", |
| 34 | [PAT_MATCH_STR] = "str", |
| 35 | [PAT_MATCH_BEG] = "beg", |
| 36 | [PAT_MATCH_SUB] = "sub", |
| 37 | [PAT_MATCH_DIR] = "dir", |
| 38 | [PAT_MATCH_DOM] = "dom", |
| 39 | [PAT_MATCH_END] = "end", |
| 40 | [PAT_MATCH_REG] = "reg", |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 41 | }; |
| 42 | |
Thierry FOURNIER | edc15c3 | 2013-12-13 15:36:59 +0100 | [diff] [blame] | 43 | int (*pat_parse_fcts[PAT_MATCH_NUM])(const char *, struct pattern *, char **) = { |
Thierry FOURNIER | a65b343 | 2013-11-28 18:22:00 +0100 | [diff] [blame] | 44 | [PAT_MATCH_FOUND] = pat_parse_nothing, |
| 45 | [PAT_MATCH_BOOL] = pat_parse_nothing, |
| 46 | [PAT_MATCH_INT] = pat_parse_int, |
| 47 | [PAT_MATCH_IP] = pat_parse_ip, |
| 48 | [PAT_MATCH_BIN] = pat_parse_bin, |
Thierry FOURNIER | 5d34408 | 2014-01-27 14:19:53 +0100 | [diff] [blame] | 49 | [PAT_MATCH_LEN] = pat_parse_int, |
Thierry FOURNIER | a65b343 | 2013-11-28 18:22:00 +0100 | [diff] [blame] | 50 | [PAT_MATCH_STR] = pat_parse_str, |
| 51 | [PAT_MATCH_BEG] = pat_parse_str, |
| 52 | [PAT_MATCH_SUB] = pat_parse_str, |
| 53 | [PAT_MATCH_DIR] = pat_parse_str, |
| 54 | [PAT_MATCH_DOM] = pat_parse_str, |
| 55 | [PAT_MATCH_END] = pat_parse_str, |
| 56 | [PAT_MATCH_REG] = pat_parse_reg, |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 57 | }; |
| 58 | |
Thierry FOURNIER | b9b0846 | 2013-12-13 15:12:32 +0100 | [diff] [blame] | 59 | int (*pat_index_fcts[PAT_MATCH_NUM])(struct pattern_expr *, struct pattern *, char **) = { |
| 60 | [PAT_MATCH_FOUND] = pat_idx_list_val, |
| 61 | [PAT_MATCH_BOOL] = pat_idx_list_val, |
| 62 | [PAT_MATCH_INT] = pat_idx_list_val, |
| 63 | [PAT_MATCH_IP] = pat_idx_tree_ip, |
| 64 | [PAT_MATCH_BIN] = pat_idx_list_ptr, |
| 65 | [PAT_MATCH_LEN] = pat_idx_list_val, |
| 66 | [PAT_MATCH_STR] = pat_idx_tree_str, |
| 67 | [PAT_MATCH_BEG] = pat_idx_list_str, |
| 68 | [PAT_MATCH_SUB] = pat_idx_list_str, |
| 69 | [PAT_MATCH_DIR] = pat_idx_list_str, |
| 70 | [PAT_MATCH_DOM] = pat_idx_list_str, |
| 71 | [PAT_MATCH_END] = pat_idx_list_str, |
| 72 | [PAT_MATCH_REG] = pat_idx_list_reg, |
| 73 | }; |
| 74 | |
Thierry FOURNIER | b113650 | 2014-01-15 11:38:49 +0100 | [diff] [blame] | 75 | void (*pat_delete_fcts[PAT_MATCH_NUM])(struct pattern_expr *, struct pattern *) = { |
| 76 | [PAT_MATCH_FOUND] = pat_del_list_val, |
| 77 | [PAT_MATCH_BOOL] = pat_del_list_val, |
| 78 | [PAT_MATCH_INT] = pat_del_list_val, |
| 79 | [PAT_MATCH_IP] = pat_del_tree_ip, |
| 80 | [PAT_MATCH_BIN] = pat_del_list_ptr, |
| 81 | [PAT_MATCH_LEN] = pat_del_list_val, |
| 82 | [PAT_MATCH_STR] = pat_del_tree_str, |
| 83 | [PAT_MATCH_BEG] = pat_del_list_str, |
| 84 | [PAT_MATCH_SUB] = pat_del_list_str, |
| 85 | [PAT_MATCH_DIR] = pat_del_list_str, |
| 86 | [PAT_MATCH_DOM] = pat_del_list_str, |
| 87 | [PAT_MATCH_END] = pat_del_list_str, |
| 88 | [PAT_MATCH_REG] = pat_del_list_reg, |
| 89 | }; |
| 90 | |
Thierry FOURNIER | 55d0b10 | 2014-01-15 11:25:26 +0100 | [diff] [blame] | 91 | struct sample_storage **(*pat_find_smp_fcts[PAT_MATCH_NUM])(struct pattern_expr *, |
| 92 | struct pattern *) = { |
| 93 | [PAT_MATCH_FOUND] = pat_find_smp_list_val, |
| 94 | [PAT_MATCH_BOOL] = pat_find_smp_list_val, |
| 95 | [PAT_MATCH_INT] = pat_find_smp_list_val, |
| 96 | [PAT_MATCH_IP] = pat_find_smp_tree_ip, |
| 97 | [PAT_MATCH_BIN] = pat_find_smp_list_ptr, |
| 98 | [PAT_MATCH_LEN] = pat_find_smp_list_val, |
| 99 | [PAT_MATCH_STR] = pat_find_smp_tree_str, |
| 100 | [PAT_MATCH_BEG] = pat_find_smp_list_str, |
| 101 | [PAT_MATCH_SUB] = pat_find_smp_list_str, |
| 102 | [PAT_MATCH_DIR] = pat_find_smp_list_str, |
| 103 | [PAT_MATCH_DOM] = pat_find_smp_list_str, |
| 104 | [PAT_MATCH_END] = pat_find_smp_list_str, |
| 105 | [PAT_MATCH_REG] = pat_find_smp_list_reg, |
| 106 | }; |
| 107 | |
Thierry FOURNIER | 6f7203d | 2014-01-14 16:24:51 +0100 | [diff] [blame] | 108 | void (*pat_prune_fcts[PAT_MATCH_NUM])(struct pattern_expr *) = { |
| 109 | [PAT_MATCH_FOUND] = pat_prune_val, |
| 110 | [PAT_MATCH_BOOL] = pat_prune_val, |
| 111 | [PAT_MATCH_INT] = pat_prune_val, |
| 112 | [PAT_MATCH_IP] = pat_prune_val, |
| 113 | [PAT_MATCH_BIN] = pat_prune_ptr, |
| 114 | [PAT_MATCH_LEN] = pat_prune_val, |
| 115 | [PAT_MATCH_STR] = pat_prune_ptr, |
| 116 | [PAT_MATCH_BEG] = pat_prune_ptr, |
| 117 | [PAT_MATCH_SUB] = pat_prune_ptr, |
| 118 | [PAT_MATCH_DIR] = pat_prune_ptr, |
| 119 | [PAT_MATCH_DOM] = pat_prune_ptr, |
| 120 | [PAT_MATCH_END] = pat_prune_ptr, |
| 121 | [PAT_MATCH_REG] = pat_prune_reg, |
| 122 | }; |
| 123 | |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 124 | 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] | 125 | [PAT_MATCH_FOUND] = NULL, |
| 126 | [PAT_MATCH_BOOL] = pat_match_nothing, |
| 127 | [PAT_MATCH_INT] = pat_match_int, |
| 128 | [PAT_MATCH_IP] = pat_match_ip, |
| 129 | [PAT_MATCH_BIN] = pat_match_bin, |
| 130 | [PAT_MATCH_LEN] = pat_match_len, |
| 131 | [PAT_MATCH_STR] = pat_match_str, |
| 132 | [PAT_MATCH_BEG] = pat_match_beg, |
| 133 | [PAT_MATCH_SUB] = pat_match_sub, |
| 134 | [PAT_MATCH_DIR] = pat_match_dir, |
| 135 | [PAT_MATCH_DOM] = pat_match_dom, |
| 136 | [PAT_MATCH_END] = pat_match_end, |
| 137 | [PAT_MATCH_REG] = pat_match_reg, |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 138 | }; |
| 139 | |
Thierry FOURNIER | e3ded59 | 2013-12-06 15:36:54 +0100 | [diff] [blame] | 140 | /* Just used for checking configuration compatibility */ |
| 141 | int pat_match_types[PAT_MATCH_NUM] = { |
| 142 | [PAT_MATCH_FOUND] = SMP_T_UINT, |
| 143 | [PAT_MATCH_BOOL] = SMP_T_UINT, |
| 144 | [PAT_MATCH_INT] = SMP_T_UINT, |
| 145 | [PAT_MATCH_IP] = SMP_T_ADDR, |
Thierry FOURNIER | 7654c9f | 2013-12-17 00:20:33 +0100 | [diff] [blame] | 146 | [PAT_MATCH_BIN] = SMP_T_BIN, |
| 147 | [PAT_MATCH_LEN] = SMP_T_STR, |
| 148 | [PAT_MATCH_STR] = SMP_T_STR, |
| 149 | [PAT_MATCH_BEG] = SMP_T_STR, |
| 150 | [PAT_MATCH_SUB] = SMP_T_STR, |
| 151 | [PAT_MATCH_DIR] = SMP_T_STR, |
| 152 | [PAT_MATCH_DOM] = SMP_T_STR, |
| 153 | [PAT_MATCH_END] = SMP_T_STR, |
| 154 | [PAT_MATCH_REG] = SMP_T_STR, |
Thierry FOURNIER | e3ded59 | 2013-12-06 15:36:54 +0100 | [diff] [blame] | 155 | }; |
| 156 | |
Thierry FOURNIER | 1794fdf | 2014-01-17 15:25:13 +0100 | [diff] [blame] | 157 | /* this struct is used to return information */ |
| 158 | static struct pattern static_pattern; |
| 159 | |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 160 | /* This is the root of the list of all pattern_ref avalaibles. */ |
| 161 | struct list pattern_reference = LIST_HEAD_INIT(pattern_reference); |
| 162 | |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 163 | /* |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 164 | * |
| 165 | * The following functions are not exported and are used by internals process |
| 166 | * of pattern matching |
| 167 | * |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 168 | */ |
| 169 | |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 170 | /* Background: Fast way to find a zero byte in a word |
| 171 | * http://graphics.stanford.edu/~seander/bithacks.html#ZeroInWord |
| 172 | * hasZeroByte = (v - 0x01010101UL) & ~v & 0x80808080UL; |
| 173 | * |
| 174 | * To look for 4 different byte values, xor the word with those bytes and |
| 175 | * then check for zero bytes: |
| 176 | * |
| 177 | * v = (((unsigned char)c * 0x1010101U) ^ delimiter) |
| 178 | * where <delimiter> is the 4 byte values to look for (as an uint) |
| 179 | * and <c> is the character that is being tested |
| 180 | */ |
| 181 | static inline unsigned int is_delimiter(unsigned char c, unsigned int mask) |
| 182 | { |
| 183 | mask ^= (c * 0x01010101); /* propagate the char to all 4 bytes */ |
| 184 | return (mask - 0x01010101) & ~mask & 0x80808080U; |
| 185 | } |
| 186 | |
| 187 | static inline unsigned int make_4delim(unsigned char d1, unsigned char d2, unsigned char d3, unsigned char d4) |
| 188 | { |
| 189 | return d1 << 24 | d2 << 16 | d3 << 8 | d4; |
| 190 | } |
| 191 | |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 192 | |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 193 | /* |
| 194 | * |
| 195 | * These functions are exported and may be used by any other component. |
| 196 | * |
| 197 | * The following functions are used for parsing pattern matching |
Thierry FOURNIER | 580c32c | 2014-01-24 10:58:12 +0100 | [diff] [blame] | 198 | * input value. The <text> contain the string to be parsed. <pattern> |
| 199 | * must be a preallocated pattern. The pat_parse_* functions fill this |
| 200 | * structure with the parsed value. <usage> can be PAT_U_COMPILE or |
| 201 | * PAT_U_LOOKUP. If the value PAT_U_COMPILE is used memory is allocated |
| 202 | * for filling the pattern. If the value PAT_U_LOOKUP is set, the parser |
| 203 | * use "trash" or return pointers to the input strings. In both cases, |
| 204 | * the caller must use the value PAT_U_LOOKUP with caution. <err> is |
| 205 | * filled with an error message built with memprintf() function. |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 206 | * |
Thierry FOURNIER | 580c32c | 2014-01-24 10:58:12 +0100 | [diff] [blame] | 207 | * In succes case, the pat_parse_* function return 1. If the function |
| 208 | * fail, it returns 0 and <err> is filled. |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 209 | * |
| 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 | /* ignore the current line */ |
Thierry FOURNIER | edc15c3 | 2013-12-13 15:36:59 +0100 | [diff] [blame] | 213 | int pat_parse_nothing(const char *text, struct pattern *pattern, char **err) |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 214 | { |
| 215 | return 1; |
| 216 | } |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 217 | |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 218 | /* Parse a string. It is allocated and duplicated. */ |
Thierry FOURNIER | edc15c3 | 2013-12-13 15:36:59 +0100 | [diff] [blame] | 219 | int pat_parse_str(const char *text, struct pattern *pattern, char **err) |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 220 | { |
Thierry FOURNIER | 7654c9f | 2013-12-17 00:20:33 +0100 | [diff] [blame] | 221 | pattern->type = SMP_T_STR; |
Thierry FOURNIER | edc15c3 | 2013-12-13 15:36:59 +0100 | [diff] [blame] | 222 | pattern->ptr.str = (char *)text; |
Thierry FOURNIER | 580c32c | 2014-01-24 10:58:12 +0100 | [diff] [blame] | 223 | pattern->len = strlen(text); |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 224 | return 1; |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 225 | } |
| 226 | |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 227 | /* Parse a binary written in hexa. It is allocated. */ |
Thierry FOURNIER | edc15c3 | 2013-12-13 15:36:59 +0100 | [diff] [blame] | 228 | int pat_parse_bin(const char *text, struct pattern *pattern, char **err) |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 229 | { |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 230 | struct chunk *trash; |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 231 | |
Thierry FOURNIER | 7654c9f | 2013-12-17 00:20:33 +0100 | [diff] [blame] | 232 | pattern->type = SMP_T_BIN; |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 233 | trash = get_trash_chunk(); |
| 234 | pattern->len = trash->size; |
| 235 | pattern->ptr.str = trash->str; |
Thierry FOURNIER | 580c32c | 2014-01-24 10:58:12 +0100 | [diff] [blame] | 236 | return !!parse_binary(text, &pattern->ptr.str, &pattern->len, err); |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 237 | } |
| 238 | |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 239 | /* Parse a regex. It is allocated. */ |
Thierry FOURNIER | edc15c3 | 2013-12-13 15:36:59 +0100 | [diff] [blame] | 240 | int pat_parse_reg(const char *text, struct pattern *pattern, char **err) |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 241 | { |
Thierry FOURNIER | 0b2fe4a | 2013-12-06 20:33:50 +0100 | [diff] [blame] | 242 | struct chunk *trash; |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 243 | |
Thierry FOURNIER | edc15c3 | 2013-12-13 15:36:59 +0100 | [diff] [blame] | 244 | trash = get_trash_chunk(); |
| 245 | if (trash->size < sizeof(*pattern->ptr.reg)) { |
| 246 | memprintf(err, "no space avalaible in the buffer. expect %d, provides %d", |
| 247 | (int)sizeof(*pattern->ptr.reg), trash->size); |
| 248 | return 0; |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 249 | } |
| 250 | |
Thierry FOURNIER | edc15c3 | 2013-12-13 15:36:59 +0100 | [diff] [blame] | 251 | pattern->ptr.reg = (struct my_regex *)trash->str; |
| 252 | pattern->ptr.reg->regstr = (char *)text; |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 253 | |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 254 | return 1; |
| 255 | } |
| 256 | |
| 257 | /* Parse a range of positive integers delimited by either ':' or '-'. If only |
| 258 | * one integer is read, it is set as both min and max. An operator may be |
| 259 | * specified as the prefix, among this list of 5 : |
| 260 | * |
| 261 | * 0:eq, 1:gt, 2:ge, 3:lt, 4:le |
| 262 | * |
| 263 | * The default operator is "eq". It supports range matching. Ranges are |
| 264 | * rejected for other operators. The operator may be changed at any time. |
| 265 | * The operator is stored in the 'opaque' argument. |
| 266 | * |
| 267 | * 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] | 268 | * the caller will have to free it. The function returns zero on error, and |
| 269 | * non-zero on success. |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 270 | * |
| 271 | */ |
Thierry FOURNIER | edc15c3 | 2013-12-13 15:36:59 +0100 | [diff] [blame] | 272 | int pat_parse_int(const char *text, struct pattern *pattern, char **err) |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 273 | { |
Thierry FOURNIER | 580c32c | 2014-01-24 10:58:12 +0100 | [diff] [blame] | 274 | const char *ptr = text; |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 275 | |
| 276 | pattern->type = SMP_T_UINT; |
Thierry FOURNIER | 7148ce6 | 2013-12-06 19:06:43 +0100 | [diff] [blame] | 277 | |
Thierry FOURNIER | 511e947 | 2014-01-23 17:40:34 +0100 | [diff] [blame] | 278 | /* Empty string is not valid */ |
Thierry FOURNIER | 580c32c | 2014-01-24 10:58:12 +0100 | [diff] [blame] | 279 | if (!*text) |
Thierry FOURNIER | 511e947 | 2014-01-23 17:40:34 +0100 | [diff] [blame] | 280 | goto not_valid_range; |
| 281 | |
| 282 | /* Search ':' or '-' separator. */ |
| 283 | while (*ptr != '\0' && *ptr != ':' && *ptr != '-') |
| 284 | ptr++; |
| 285 | |
| 286 | /* If separator not found. */ |
| 287 | if (!*ptr) { |
Thierry FOURNIER | 580c32c | 2014-01-24 10:58:12 +0100 | [diff] [blame] | 288 | if (strl2llrc(text, ptr - text, &pattern->val.range.min) != 0) { |
| 289 | memprintf(err, "'%s' is not a number", text); |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 290 | return 0; |
| 291 | } |
Thierry FOURNIER | 511e947 | 2014-01-23 17:40:34 +0100 | [diff] [blame] | 292 | pattern->val.range.max = pattern->val.range.min; |
| 293 | pattern->val.range.min_set = 1; |
| 294 | pattern->val.range.max_set = 1; |
| 295 | return 1; |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 296 | } |
| 297 | |
Thierry FOURNIER | 511e947 | 2014-01-23 17:40:34 +0100 | [diff] [blame] | 298 | /* If the separator is the first character. */ |
Thierry FOURNIER | 580c32c | 2014-01-24 10:58:12 +0100 | [diff] [blame] | 299 | if (ptr == text && *(ptr + 1) != '\0') { |
Thierry FOURNIER | 511e947 | 2014-01-23 17:40:34 +0100 | [diff] [blame] | 300 | if (strl2llrc(ptr + 1, strlen(ptr + 1), &pattern->val.range.max) != 0) |
| 301 | goto not_valid_range; |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 302 | |
Thierry FOURNIER | 511e947 | 2014-01-23 17:40:34 +0100 | [diff] [blame] | 303 | pattern->val.range.min_set = 0; |
| 304 | pattern->val.range.max_set = 1; |
| 305 | return 1; |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 306 | } |
| 307 | |
Thierry FOURNIER | 511e947 | 2014-01-23 17:40:34 +0100 | [diff] [blame] | 308 | /* If separator is the last character. */ |
| 309 | if (*(ptr + 1) == '\0') { |
Thierry FOURNIER | 580c32c | 2014-01-24 10:58:12 +0100 | [diff] [blame] | 310 | if (strl2llrc(text, ptr - text, &pattern->val.range.min) != 0) |
Thierry FOURNIER | 511e947 | 2014-01-23 17:40:34 +0100 | [diff] [blame] | 311 | goto not_valid_range; |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 312 | |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 313 | pattern->val.range.min_set = 1; |
| 314 | pattern->val.range.max_set = 0; |
Thierry FOURNIER | 511e947 | 2014-01-23 17:40:34 +0100 | [diff] [blame] | 315 | return 1; |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 316 | } |
Thierry FOURNIER | 511e947 | 2014-01-23 17:40:34 +0100 | [diff] [blame] | 317 | |
| 318 | /* Else, parse two numbers. */ |
Thierry FOURNIER | 580c32c | 2014-01-24 10:58:12 +0100 | [diff] [blame] | 319 | if (strl2llrc(text, ptr - text, &pattern->val.range.min) != 0) |
Thierry FOURNIER | 511e947 | 2014-01-23 17:40:34 +0100 | [diff] [blame] | 320 | goto not_valid_range; |
| 321 | |
| 322 | if (strl2llrc(ptr + 1, strlen(ptr + 1), &pattern->val.range.max) != 0) |
| 323 | goto not_valid_range; |
| 324 | |
| 325 | if (pattern->val.range.min > pattern->val.range.max) |
| 326 | goto not_valid_range; |
| 327 | |
| 328 | pattern->val.range.min_set = 1; |
| 329 | pattern->val.range.max_set = 1; |
| 330 | return 1; |
| 331 | |
| 332 | not_valid_range: |
Thierry FOURNIER | 580c32c | 2014-01-24 10:58:12 +0100 | [diff] [blame] | 333 | memprintf(err, "'%s' is not a valid number range", text); |
Thierry FOURNIER | 511e947 | 2014-01-23 17:40:34 +0100 | [diff] [blame] | 334 | return 0; |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 335 | } |
| 336 | |
| 337 | /* Parse a range of positive 2-component versions delimited by either ':' or |
| 338 | * '-'. The version consists in a major and a minor, both of which must be |
| 339 | * smaller than 65536, because internally they will be represented as a 32-bit |
| 340 | * integer. |
| 341 | * If only one version is read, it is set as both min and max. Just like for |
| 342 | * pure integers, an operator may be specified as the prefix, among this list |
| 343 | * of 5 : |
| 344 | * |
| 345 | * 0:eq, 1:gt, 2:ge, 3:lt, 4:le |
| 346 | * |
| 347 | * The default operator is "eq". It supports range matching. Ranges are |
| 348 | * rejected for other operators. The operator may be changed at any time. |
| 349 | * The operator is stored in the 'opaque' argument. This allows constructs |
| 350 | * such as the following one : |
| 351 | * |
| 352 | * acl obsolete_ssl ssl_req_proto lt 3 |
| 353 | * acl unsupported_ssl ssl_req_proto gt 3.1 |
| 354 | * acl valid_ssl ssl_req_proto 3.0-3.1 |
| 355 | * |
| 356 | */ |
Thierry FOURNIER | edc15c3 | 2013-12-13 15:36:59 +0100 | [diff] [blame] | 357 | int pat_parse_dotted_ver(const char *text, struct pattern *pattern, char **err) |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 358 | { |
Thierry FOURNIER | 580c32c | 2014-01-24 10:58:12 +0100 | [diff] [blame] | 359 | const char *ptr = text; |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 360 | |
Thierry FOURNIER | 511e947 | 2014-01-23 17:40:34 +0100 | [diff] [blame] | 361 | pattern->type = SMP_T_UINT; |
Thierry FOURNIER | 511e947 | 2014-01-23 17:40:34 +0100 | [diff] [blame] | 362 | |
| 363 | /* Search ':' or '-' separator. */ |
| 364 | while (*ptr != '\0' && *ptr != ':' && *ptr != '-') |
| 365 | ptr++; |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 366 | |
Thierry FOURNIER | 511e947 | 2014-01-23 17:40:34 +0100 | [diff] [blame] | 367 | /* If separator not found. */ |
Thierry FOURNIER | 580c32c | 2014-01-24 10:58:12 +0100 | [diff] [blame] | 368 | if (*ptr == '\0' && ptr > text) { |
| 369 | if (strl2llrc_dotted(text, ptr-text, &pattern->val.range.min) != 0) { |
| 370 | memprintf(err, "'%s' is not a dotted number", text); |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 371 | return 0; |
| 372 | } |
Thierry FOURNIER | 511e947 | 2014-01-23 17:40:34 +0100 | [diff] [blame] | 373 | pattern->val.range.max = pattern->val.range.min; |
| 374 | pattern->val.range.min_set = 1; |
| 375 | pattern->val.range.max_set = 1; |
| 376 | return 1; |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 377 | } |
| 378 | |
Thierry FOURNIER | 511e947 | 2014-01-23 17:40:34 +0100 | [diff] [blame] | 379 | /* If the separator is the first character. */ |
Thierry FOURNIER | 580c32c | 2014-01-24 10:58:12 +0100 | [diff] [blame] | 380 | if (ptr == text && *(ptr+1) != '\0') { |
Thierry FOURNIER | 511e947 | 2014-01-23 17:40:34 +0100 | [diff] [blame] | 381 | 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] | 382 | memprintf(err, "'%s' is not a valid dotted number range", text); |
Thierry FOURNIER | 511e947 | 2014-01-23 17:40:34 +0100 | [diff] [blame] | 383 | return 0; |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 384 | } |
Thierry FOURNIER | 511e947 | 2014-01-23 17:40:34 +0100 | [diff] [blame] | 385 | pattern->val.range.min_set = 0; |
| 386 | pattern->val.range.max_set = 1; |
| 387 | return 1; |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 388 | } |
| 389 | |
Thierry FOURNIER | 511e947 | 2014-01-23 17:40:34 +0100 | [diff] [blame] | 390 | /* If separator is the last character. */ |
Thierry FOURNIER | 580c32c | 2014-01-24 10:58:12 +0100 | [diff] [blame] | 391 | if (ptr == &text[strlen(text)-1]) { |
| 392 | if (strl2llrc_dotted(text, ptr-text, &pattern->val.range.min) != 0) { |
| 393 | memprintf(err, "'%s' is not a valid dotted number range", text); |
Thierry FOURNIER | 511e947 | 2014-01-23 17:40:34 +0100 | [diff] [blame] | 394 | return 0; |
| 395 | } |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 396 | pattern->val.range.min_set = 1; |
| 397 | pattern->val.range.max_set = 0; |
Thierry FOURNIER | 511e947 | 2014-01-23 17:40:34 +0100 | [diff] [blame] | 398 | return 1; |
| 399 | } |
| 400 | |
| 401 | /* Else, parse two numbers. */ |
Thierry FOURNIER | 580c32c | 2014-01-24 10:58:12 +0100 | [diff] [blame] | 402 | if (strl2llrc_dotted(text, ptr-text, &pattern->val.range.min) != 0) { |
| 403 | memprintf(err, "'%s' is not a valid dotted number range", text); |
Thierry FOURNIER | 511e947 | 2014-01-23 17:40:34 +0100 | [diff] [blame] | 404 | return 0; |
| 405 | } |
| 406 | 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] | 407 | memprintf(err, "'%s' is not a valid dotted number range", text); |
Thierry FOURNIER | 511e947 | 2014-01-23 17:40:34 +0100 | [diff] [blame] | 408 | return 0; |
| 409 | } |
| 410 | if (pattern->val.range.min > pattern->val.range.max) { |
Thierry FOURNIER | 580c32c | 2014-01-24 10:58:12 +0100 | [diff] [blame] | 411 | memprintf(err, "'%s' is not a valid dotted number range", text); |
Thierry FOURNIER | 511e947 | 2014-01-23 17:40:34 +0100 | [diff] [blame] | 412 | return 0; |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 413 | } |
Thierry FOURNIER | 511e947 | 2014-01-23 17:40:34 +0100 | [diff] [blame] | 414 | pattern->val.range.min_set = 1; |
| 415 | pattern->val.range.max_set = 1; |
| 416 | return 1; |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 417 | } |
| 418 | |
| 419 | /* Parse an IP address and an optional mask in the form addr[/mask]. |
| 420 | * The addr may either be an IPv4 address or a hostname. The mask |
| 421 | * may either be a dotted mask or a number of bits. Returns 1 if OK, |
| 422 | * otherwise 0. NOTE: IP address patterns are typed (IPV4/IPV6). |
| 423 | */ |
Thierry FOURNIER | edc15c3 | 2013-12-13 15:36:59 +0100 | [diff] [blame] | 424 | int pat_parse_ip(const char *text, struct pattern *pattern, char **err) |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 425 | { |
Thierry FOURNIER | 580c32c | 2014-01-24 10:58:12 +0100 | [diff] [blame] | 426 | if (str2net(text, &pattern->val.ipv4.addr, &pattern->val.ipv4.mask)) { |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 427 | pattern->type = SMP_T_IPV4; |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 428 | return 1; |
| 429 | } |
Thierry FOURNIER | 580c32c | 2014-01-24 10:58:12 +0100 | [diff] [blame] | 430 | else if (str62net(text, &pattern->val.ipv6.addr, &pattern->val.ipv6.mask)) { |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 431 | pattern->type = SMP_T_IPV6; |
| 432 | return 1; |
| 433 | } |
| 434 | else { |
Thierry FOURNIER | 580c32c | 2014-01-24 10:58:12 +0100 | [diff] [blame] | 435 | memprintf(err, "'%s' is not a valid IPv4 or IPv6 address", text); |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 436 | return 0; |
| 437 | } |
| 438 | } |
| 439 | |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 440 | /* |
| 441 | * |
| 442 | * These functions are exported and may be used by any other component. |
| 443 | * |
| 444 | * This fucntion just take a sample <smp> and check if this sample match |
| 445 | * with the pattern <pattern>. This fucntion return just PAT_MATCH or |
| 446 | * PAT_NOMATCH. |
| 447 | * |
| 448 | */ |
| 449 | |
| 450 | /* always return false */ |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 451 | 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] | 452 | { |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 453 | return NULL; |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 454 | } |
| 455 | |
| 456 | |
| 457 | /* NB: For two strings to be identical, it is required that their lengths match */ |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 458 | 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] | 459 | { |
| 460 | int icase; |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 461 | struct ebmb_node *node; |
| 462 | char prev; |
| 463 | struct pattern_tree *elt; |
| 464 | struct pattern_list *lst; |
| 465 | struct pattern *pattern; |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 466 | |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 467 | /* Lookup a string in the expression's pattern tree. */ |
| 468 | if (!eb_is_empty(&expr->pattern_tree)) { |
| 469 | /* we may have to force a trailing zero on the test pattern */ |
| 470 | prev = smp->data.str.str[smp->data.str.len]; |
| 471 | if (prev) |
| 472 | smp->data.str.str[smp->data.str.len] = '\0'; |
| 473 | node = ebst_lookup(&expr->pattern_tree, smp->data.str.str); |
| 474 | if (prev) |
| 475 | smp->data.str.str[smp->data.str.len] = prev; |
| 476 | |
| 477 | if (node) { |
| 478 | if (fill) { |
| 479 | elt = ebmb_entry(node, struct pattern_tree, node); |
| 480 | static_pattern.smp = elt->smp; |
| 481 | static_pattern.flags = PAT_F_TREE; |
| 482 | static_pattern.type = SMP_T_STR; |
| 483 | static_pattern.ptr.str = (char *)elt->node.key; |
| 484 | } |
| 485 | return &static_pattern; |
| 486 | } |
| 487 | } |
| 488 | |
| 489 | /* look in the list */ |
| 490 | list_for_each_entry(lst, &expr->patterns, list) { |
| 491 | pattern = &lst->pat; |
| 492 | |
| 493 | if (pattern->len != smp->data.str.len) |
| 494 | continue; |
| 495 | |
| 496 | icase = pattern->flags & PAT_F_IGNORE_CASE; |
| 497 | if ((icase && strncasecmp(pattern->ptr.str, smp->data.str.str, smp->data.str.len) == 0) || |
| 498 | (!icase && strncmp(pattern->ptr.str, smp->data.str.str, smp->data.str.len) == 0)) |
| 499 | return pattern; |
| 500 | } |
| 501 | |
| 502 | return NULL; |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 503 | } |
| 504 | |
| 505 | /* 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] | 506 | 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] | 507 | { |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 508 | struct pattern_list *lst; |
| 509 | struct pattern *pattern; |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 510 | |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 511 | /* Look in the list. */ |
| 512 | list_for_each_entry(lst, &expr->patterns, list) { |
| 513 | pattern = &lst->pat; |
| 514 | |
| 515 | if (pattern->len != smp->data.str.len) |
| 516 | continue; |
| 517 | |
| 518 | if (memcmp(pattern->ptr.str, smp->data.str.str, smp->data.str.len) == 0) |
| 519 | return pattern; |
| 520 | } |
| 521 | |
| 522 | return NULL; |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 523 | } |
| 524 | |
| 525 | /* Executes a regex. It temporarily changes the data to add a trailing zero, |
| 526 | * and restores the previous character when leaving. |
| 527 | */ |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 528 | 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] | 529 | { |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 530 | struct pattern_list *lst; |
| 531 | struct pattern *pattern; |
| 532 | |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 533 | /* look in the list */ |
| 534 | list_for_each_entry(lst, &expr->patterns, list) { |
| 535 | pattern = &lst->pat; |
| 536 | |
| 537 | if (regex_exec(pattern->ptr.reg, smp->data.str.str, smp->data.str.len) == 0) |
| 538 | return pattern; |
| 539 | } |
| 540 | return NULL; |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 541 | } |
| 542 | |
| 543 | /* Checks that the pattern matches the beginning of the tested string. */ |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 544 | 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] | 545 | { |
| 546 | int icase; |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 547 | struct pattern_list *lst; |
| 548 | struct pattern *pattern; |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 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 | |
| 553 | if (pattern->len > smp->data.str.len) |
| 554 | continue; |
| 555 | |
| 556 | icase = pattern->flags & PAT_F_IGNORE_CASE; |
| 557 | if ((icase && strncasecmp(pattern->ptr.str, smp->data.str.str, pattern->len) != 0) || |
| 558 | (!icase && strncmp(pattern->ptr.str, smp->data.str.str, pattern->len) != 0)) |
| 559 | continue; |
| 560 | |
| 561 | return pattern; |
| 562 | } |
| 563 | return NULL; |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 564 | } |
| 565 | |
| 566 | /* Checks that the pattern matches the end of the tested string. */ |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 567 | 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] | 568 | { |
| 569 | int icase; |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 570 | struct pattern_list *lst; |
| 571 | struct pattern *pattern; |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 572 | |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 573 | list_for_each_entry(lst, &expr->patterns, list) { |
| 574 | pattern = &lst->pat; |
| 575 | |
| 576 | if (pattern->len > smp->data.str.len) |
| 577 | continue; |
| 578 | |
| 579 | icase = pattern->flags & PAT_F_IGNORE_CASE; |
| 580 | if ((icase && strncasecmp(pattern->ptr.str, smp->data.str.str + smp->data.str.len - pattern->len, pattern->len) != 0) || |
| 581 | (!icase && strncmp(pattern->ptr.str, smp->data.str.str + smp->data.str.len - pattern->len, pattern->len) != 0)) |
| 582 | continue; |
| 583 | |
| 584 | return pattern; |
| 585 | } |
| 586 | return NULL; |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 587 | } |
| 588 | |
| 589 | /* Checks that the pattern is included inside the tested string. |
| 590 | * NB: Suboptimal, should be rewritten using a Boyer-Moore method. |
| 591 | */ |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 592 | 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] | 593 | { |
| 594 | int icase; |
| 595 | char *end; |
| 596 | char *c; |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 597 | struct pattern_list *lst; |
| 598 | struct pattern *pattern; |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 599 | |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 600 | list_for_each_entry(lst, &expr->patterns, list) { |
| 601 | pattern = &lst->pat; |
| 602 | |
| 603 | if (pattern->len > smp->data.str.len) |
| 604 | continue; |
| 605 | |
| 606 | end = smp->data.str.str + smp->data.str.len - pattern->len; |
| 607 | icase = pattern->flags & PAT_F_IGNORE_CASE; |
| 608 | if (icase) { |
| 609 | for (c = smp->data.str.str; c <= end; c++) { |
| 610 | if (tolower(*c) != tolower(*pattern->ptr.str)) |
| 611 | continue; |
| 612 | if (strncasecmp(pattern->ptr.str, c, pattern->len) == 0) |
| 613 | return pattern; |
| 614 | } |
| 615 | } else { |
| 616 | for (c = smp->data.str.str; c <= end; c++) { |
| 617 | if (*c != *pattern->ptr.str) |
| 618 | continue; |
| 619 | if (strncmp(pattern->ptr.str, c, pattern->len) == 0) |
| 620 | return pattern; |
| 621 | } |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 622 | } |
| 623 | } |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 624 | return NULL; |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 625 | } |
| 626 | |
| 627 | /* This one is used by other real functions. It checks that the pattern is |
| 628 | * included inside the tested string, but enclosed between the specified |
| 629 | * delimiters or at the beginning or end of the string. The delimiters are |
| 630 | * provided as an unsigned int made by make_4delim() and match up to 4 different |
| 631 | * delimiters. Delimiters are stripped at the beginning and end of the pattern. |
| 632 | */ |
| 633 | static int match_word(struct sample *smp, struct pattern *pattern, unsigned int delimiters) |
| 634 | { |
| 635 | int may_match, icase; |
| 636 | char *c, *end; |
| 637 | char *ps; |
| 638 | int pl; |
| 639 | |
| 640 | pl = pattern->len; |
| 641 | ps = pattern->ptr.str; |
| 642 | |
| 643 | while (pl > 0 && is_delimiter(*ps, delimiters)) { |
| 644 | pl--; |
| 645 | ps++; |
| 646 | } |
| 647 | |
| 648 | while (pl > 0 && is_delimiter(ps[pl - 1], delimiters)) |
| 649 | pl--; |
| 650 | |
| 651 | if (pl > smp->data.str.len) |
| 652 | return PAT_NOMATCH; |
| 653 | |
| 654 | may_match = 1; |
| 655 | icase = pattern->flags & PAT_F_IGNORE_CASE; |
| 656 | end = smp->data.str.str + smp->data.str.len - pl; |
| 657 | for (c = smp->data.str.str; c <= end; c++) { |
| 658 | if (is_delimiter(*c, delimiters)) { |
| 659 | may_match = 1; |
| 660 | continue; |
| 661 | } |
| 662 | |
| 663 | if (!may_match) |
| 664 | continue; |
| 665 | |
| 666 | if (icase) { |
| 667 | if ((tolower(*c) == tolower(*ps)) && |
| 668 | (strncasecmp(ps, c, pl) == 0) && |
| 669 | (c == end || is_delimiter(c[pl], delimiters))) |
| 670 | return PAT_MATCH; |
| 671 | } else { |
| 672 | if ((*c == *ps) && |
| 673 | (strncmp(ps, c, pl) == 0) && |
| 674 | (c == end || is_delimiter(c[pl], delimiters))) |
| 675 | return PAT_MATCH; |
| 676 | } |
| 677 | may_match = 0; |
| 678 | } |
| 679 | return PAT_NOMATCH; |
| 680 | } |
| 681 | |
| 682 | /* Checks that the pattern is included inside the tested string, but enclosed |
| 683 | * between the delimiters '?' or '/' or at the beginning or end of the string. |
| 684 | * Delimiters at the beginning or end of the pattern are ignored. |
| 685 | */ |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 686 | 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] | 687 | { |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 688 | struct pattern_list *lst; |
| 689 | struct pattern *pattern; |
| 690 | |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 691 | list_for_each_entry(lst, &expr->patterns, list) { |
| 692 | pattern = &lst->pat; |
| 693 | if (match_word(smp, pattern, make_4delim('/', '?', '?', '?'))) |
| 694 | return pattern; |
| 695 | } |
| 696 | return NULL; |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 697 | } |
| 698 | |
| 699 | /* Checks that the pattern is included inside the tested string, but enclosed |
| 700 | * between the delmiters '/', '?', '.' or ":" or at the beginning or end of |
| 701 | * the string. Delimiters at the beginning or end of the pattern are ignored. |
| 702 | */ |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 703 | 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] | 704 | { |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 705 | struct pattern_list *lst; |
| 706 | struct pattern *pattern; |
| 707 | |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 708 | list_for_each_entry(lst, &expr->patterns, list) { |
| 709 | pattern = &lst->pat; |
| 710 | if (match_word(smp, pattern, make_4delim('/', '?', '.', ':'))) |
| 711 | return pattern; |
| 712 | } |
| 713 | return NULL; |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 714 | } |
| 715 | |
| 716 | /* Checks that the integer in <test> is included between min and max */ |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 717 | 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] | 718 | { |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 719 | struct pattern_list *lst; |
| 720 | struct pattern *pattern; |
| 721 | |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 722 | list_for_each_entry(lst, &expr->patterns, list) { |
| 723 | pattern = &lst->pat; |
| 724 | if ((!pattern->val.range.min_set || pattern->val.range.min <= smp->data.uint) && |
| 725 | (!pattern->val.range.max_set || smp->data.uint <= pattern->val.range.max)) |
| 726 | return pattern; |
| 727 | } |
| 728 | return NULL; |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 729 | } |
| 730 | |
| 731 | /* 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] | 732 | 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] | 733 | { |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 734 | struct pattern_list *lst; |
| 735 | struct pattern *pattern; |
| 736 | |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 737 | list_for_each_entry(lst, &expr->patterns, list) { |
| 738 | pattern = &lst->pat; |
| 739 | if ((!pattern->val.range.min_set || pattern->val.range.min <= smp->data.str.len) && |
| 740 | (!pattern->val.range.max_set || smp->data.str.len <= pattern->val.range.max)) |
| 741 | return pattern; |
| 742 | } |
| 743 | return NULL; |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 744 | } |
| 745 | |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 746 | 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] | 747 | { |
| 748 | unsigned int v4; /* in network byte order */ |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 749 | struct in6_addr tmp6; |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 750 | struct in_addr *s; |
| 751 | struct ebmb_node *node; |
| 752 | struct pattern_tree *elt; |
| 753 | struct pattern_list *lst; |
| 754 | struct pattern *pattern; |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 755 | |
Thierry FOURNIER | 33a7433 | 2013-12-19 23:54:54 +0100 | [diff] [blame] | 756 | /* The input sample is IPv4. Try to match in the trees. */ |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 757 | if (smp->type == SMP_T_IPV4) { |
Thierry FOURNIER | 33a7433 | 2013-12-19 23:54:54 +0100 | [diff] [blame] | 758 | /* Lookup an IPv4 address in the expression's pattern tree using |
| 759 | * the longest match method. |
| 760 | */ |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 761 | s = &smp->data.ipv4; |
| 762 | node = ebmb_lookup_longest(&expr->pattern_tree, &s->s_addr); |
| 763 | if (node) { |
| 764 | if (fill) { |
| 765 | elt = ebmb_entry(node, struct pattern_tree, node); |
| 766 | static_pattern.smp = elt->smp; |
| 767 | static_pattern.flags = PAT_F_TREE; |
| 768 | static_pattern.type = SMP_T_IPV4; |
| 769 | memcpy(&static_pattern.val.ipv4.addr.s_addr, elt->node.key, 4); |
| 770 | if (!cidr2dotted(elt->node.node.pfx, &static_pattern.val.ipv4.mask)) |
| 771 | return NULL; |
| 772 | } |
| 773 | return &static_pattern; |
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 | |
Thierry FOURNIER | 33a7433 | 2013-12-19 23:54:54 +0100 | [diff] [blame] | 776 | /* The IPv4 sample dont match the IPv4 tree. Convert the IPv4 |
| 777 | * sample address to IPv6 with the mapping method using the ::ffff: |
| 778 | * prefix, and try to lookup in the IPv6 tree. |
| 779 | */ |
| 780 | memset(&tmp6, 0, 10); |
| 781 | *(uint16_t*)&tmp6.s6_addr[10] = htons(0xffff); |
| 782 | *(uint32_t*)&tmp6.s6_addr[12] = smp->data.ipv4.s_addr; |
| 783 | node = ebmb_lookup_longest(&expr->pattern_tree_2, &tmp6); |
| 784 | if (node) { |
| 785 | if (fill) { |
| 786 | elt = ebmb_entry(node, struct pattern_tree, node); |
| 787 | static_pattern.smp = elt->smp; |
| 788 | static_pattern.flags = PAT_F_TREE; |
| 789 | static_pattern.type = SMP_T_IPV6; |
| 790 | memcpy(&static_pattern.val.ipv6.addr, elt->node.key, 16); |
| 791 | static_pattern.val.ipv6.mask = elt->node.node.pfx; |
| 792 | } |
| 793 | return &static_pattern; |
| 794 | } |
| 795 | } |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 796 | |
Thierry FOURNIER | 33a7433 | 2013-12-19 23:54:54 +0100 | [diff] [blame] | 797 | /* The input sample is IPv6. Try to match in the trees. */ |
| 798 | if (smp->type == SMP_T_IPV6) { |
| 799 | /* Lookup an IPv6 address in the expression's pattern tree using |
| 800 | * the longest match method. |
| 801 | */ |
| 802 | node = ebmb_lookup_longest(&expr->pattern_tree_2, &smp->data.ipv6); |
| 803 | if (node) { |
| 804 | if (fill) { |
| 805 | elt = ebmb_entry(node, struct pattern_tree, node); |
| 806 | static_pattern.smp = elt->smp; |
| 807 | static_pattern.flags = PAT_F_TREE; |
| 808 | static_pattern.type = SMP_T_IPV6; |
| 809 | memcpy(&static_pattern.val.ipv6.addr, elt->node.key, 16); |
| 810 | static_pattern.val.ipv6.mask = elt->node.node.pfx; |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 811 | } |
Thierry FOURNIER | 33a7433 | 2013-12-19 23:54:54 +0100 | [diff] [blame] | 812 | return &static_pattern; |
| 813 | } |
| 814 | |
| 815 | /* Try to convert 6 to 4 when the start of the ipv6 address match the |
| 816 | * following forms : |
| 817 | * - ::ffff:ip:v4 (ipv4 mapped) |
| 818 | * - ::0000:ip:v4 (old ipv4 mapped) |
| 819 | * - 2002:ip:v4:: (6to4) |
| 820 | */ |
| 821 | if ((*(uint32_t*)&smp->data.ipv6.s6_addr[0] == 0 && |
| 822 | *(uint32_t*)&smp->data.ipv6.s6_addr[4] == 0 && |
| 823 | (*(uint32_t*)&smp->data.ipv6.s6_addr[8] == 0 || |
| 824 | *(uint32_t*)&smp->data.ipv6.s6_addr[8] == htonl(0xFFFF))) || |
| 825 | *(uint16_t*)&smp->data.ipv6.s6_addr[0] == htons(0x2002)) { |
| 826 | if (*(uint32_t*)&smp->data.ipv6.s6_addr[0] == 0) |
| 827 | v4 = *(uint32_t*)&smp->data.ipv6.s6_addr[12]; |
| 828 | else |
| 829 | v4 = htonl((ntohs(*(uint16_t*)&smp->data.ipv6.s6_addr[2]) << 16) + |
| 830 | ntohs(*(uint16_t*)&smp->data.ipv6.s6_addr[4])); |
| 831 | |
| 832 | /* Lookup an IPv4 address in the expression's pattern tree using the longest |
| 833 | * match method. |
| 834 | */ |
| 835 | node = ebmb_lookup_longest(&expr->pattern_tree, &v4); |
| 836 | if (node) { |
| 837 | if (fill) { |
| 838 | elt = ebmb_entry(node, struct pattern_tree, node); |
| 839 | static_pattern.smp = elt->smp; |
| 840 | static_pattern.flags = PAT_F_TREE; |
| 841 | static_pattern.type = SMP_T_IPV4; |
| 842 | memcpy(&static_pattern.val.ipv4.addr.s_addr, elt->node.key, 4); |
| 843 | if (!cidr2dotted(elt->node.node.pfx, &static_pattern.val.ipv4.mask)) |
| 844 | return NULL; |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 845 | } |
Thierry FOURNIER | 33a7433 | 2013-12-19 23:54:54 +0100 | [diff] [blame] | 846 | return &static_pattern; |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 847 | } |
Thierry FOURNIER | 33a7433 | 2013-12-19 23:54:54 +0100 | [diff] [blame] | 848 | } |
| 849 | } |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 850 | |
Thierry FOURNIER | 33a7433 | 2013-12-19 23:54:54 +0100 | [diff] [blame] | 851 | /* Lookup in the list. the list contain only IPv4 patterns */ |
| 852 | list_for_each_entry(lst, &expr->patterns, list) { |
| 853 | pattern = &lst->pat; |
| 854 | |
| 855 | /* The input sample is IPv4, use it as is. */ |
| 856 | if (smp->type == SMP_T_IPV4) { |
| 857 | v4 = smp->data.ipv4.s_addr; |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 858 | } |
Thierry FOURNIER | 33a7433 | 2013-12-19 23:54:54 +0100 | [diff] [blame] | 859 | else if (smp->type == SMP_T_IPV6) { |
| 860 | /* v4 match on a V6 sample. We want to check at least for |
| 861 | * the following forms : |
| 862 | * - ::ffff:ip:v4 (ipv4 mapped) |
| 863 | * - ::0000:ip:v4 (old ipv4 mapped) |
| 864 | * - 2002:ip:v4:: (6to4) |
| 865 | */ |
| 866 | if (*(uint32_t*)&smp->data.ipv6.s6_addr[0] == 0 && |
| 867 | *(uint32_t*)&smp->data.ipv6.s6_addr[4] == 0 && |
| 868 | (*(uint32_t*)&smp->data.ipv6.s6_addr[8] == 0 || |
| 869 | *(uint32_t*)&smp->data.ipv6.s6_addr[8] == htonl(0xFFFF))) { |
| 870 | v4 = *(uint32_t*)&smp->data.ipv6.s6_addr[12]; |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 871 | } |
Thierry FOURNIER | 33a7433 | 2013-12-19 23:54:54 +0100 | [diff] [blame] | 872 | else if (*(uint16_t*)&smp->data.ipv6.s6_addr[0] == htons(0x2002)) { |
| 873 | v4 = htonl((ntohs(*(uint16_t*)&smp->data.ipv6.s6_addr[2]) << 16) + |
| 874 | ntohs(*(uint16_t*)&smp->data.ipv6.s6_addr[4])); |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 875 | } |
Thierry FOURNIER | 33a7433 | 2013-12-19 23:54:54 +0100 | [diff] [blame] | 876 | else |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 877 | continue; |
Thierry FOURNIER | 33a7433 | 2013-12-19 23:54:54 +0100 | [diff] [blame] | 878 | } |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 879 | |
Thierry FOURNIER | 33a7433 | 2013-12-19 23:54:54 +0100 | [diff] [blame] | 880 | /* Check if the input sample match the current pattern. */ |
| 881 | 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] | 882 | return pattern; |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 883 | } |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 884 | return NULL; |
Thierry FOURNIER | e7ba236 | 2014-01-21 11:25:41 +0100 | [diff] [blame] | 885 | } |
| 886 | |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 887 | void free_pattern_tree(struct eb_root *root) |
| 888 | { |
| 889 | struct eb_node *node, *next; |
Thierry FOURNIER | e1bcac5 | 2013-12-13 16:09:50 +0100 | [diff] [blame] | 890 | struct pattern_tree *elt; |
Thierry FOURNIER | 3ce88c7 | 2013-12-09 11:29:46 +0100 | [diff] [blame] | 891 | |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 892 | node = eb_first(root); |
| 893 | while (node) { |
| 894 | next = eb_next(node); |
| 895 | eb_delete(node); |
Thierry FOURNIER | e1bcac5 | 2013-12-13 16:09:50 +0100 | [diff] [blame] | 896 | elt = container_of(node, struct pattern_tree, node); |
Thierry FOURNIER | c64de3f | 2013-12-10 15:08:39 +0100 | [diff] [blame] | 897 | free(elt->smp); |
Thierry FOURNIER | 3ce88c7 | 2013-12-09 11:29:46 +0100 | [diff] [blame] | 898 | free(elt); |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 899 | node = next; |
| 900 | } |
| 901 | } |
| 902 | |
Thierry FOURNIER | 6f7203d | 2014-01-14 16:24:51 +0100 | [diff] [blame] | 903 | void pat_prune_val(struct pattern_expr *expr) |
Thierry FOURNIER | d163e1c | 2013-11-28 11:41:23 +0100 | [diff] [blame] | 904 | { |
Thierry FOURNIER | 6f7203d | 2014-01-14 16:24:51 +0100 | [diff] [blame] | 905 | struct pattern_list *pat, *tmp; |
| 906 | |
| 907 | list_for_each_entry_safe(pat, tmp, &expr->patterns, list) { |
| 908 | free(pat->pat.smp); |
| 909 | free(pat); |
| 910 | } |
| 911 | |
Thierry FOURNIER | d163e1c | 2013-11-28 11:41:23 +0100 | [diff] [blame] | 912 | free_pattern_tree(&expr->pattern_tree); |
Thierry FOURNIER | 33a7433 | 2013-12-19 23:54:54 +0100 | [diff] [blame] | 913 | free_pattern_tree(&expr->pattern_tree_2); |
Thierry FOURNIER | d163e1c | 2013-11-28 11:41:23 +0100 | [diff] [blame] | 914 | LIST_INIT(&expr->patterns); |
| 915 | } |
| 916 | |
Thierry FOURNIER | 6f7203d | 2014-01-14 16:24:51 +0100 | [diff] [blame] | 917 | void pat_prune_ptr(struct pattern_expr *expr) |
| 918 | { |
| 919 | struct pattern_list *pat, *tmp; |
| 920 | |
| 921 | list_for_each_entry_safe(pat, tmp, &expr->patterns, list) { |
| 922 | free(pat->pat.ptr.ptr); |
| 923 | free(pat->pat.smp); |
| 924 | free(pat); |
| 925 | } |
| 926 | |
| 927 | free_pattern_tree(&expr->pattern_tree); |
| 928 | free_pattern_tree(&expr->pattern_tree_2); |
| 929 | LIST_INIT(&expr->patterns); |
| 930 | } |
| 931 | |
| 932 | void pat_prune_reg(struct pattern_expr *expr) |
| 933 | { |
| 934 | struct pattern_list *pat, *tmp; |
| 935 | |
| 936 | list_for_each_entry_safe(pat, tmp, &expr->patterns, list) { |
| 937 | regex_free(pat->pat.ptr.ptr); |
| 938 | free(pat->pat.smp); |
| 939 | free(pat); |
| 940 | } |
| 941 | |
| 942 | free_pattern_tree(&expr->pattern_tree); |
| 943 | free_pattern_tree(&expr->pattern_tree_2); |
| 944 | LIST_INIT(&expr->patterns); |
| 945 | } |
| 946 | |
Thierry FOURNIER | b9b0846 | 2013-12-13 15:12:32 +0100 | [diff] [blame] | 947 | /* |
| 948 | * |
| 949 | * The following functions are used for the pattern indexation |
| 950 | * |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 951 | */ |
Thierry FOURNIER | b9b0846 | 2013-12-13 15:12:32 +0100 | [diff] [blame] | 952 | |
| 953 | 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] | 954 | { |
Thierry FOURNIER | b9b0846 | 2013-12-13 15:12:32 +0100 | [diff] [blame] | 955 | struct pattern_list *patl; |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 956 | |
Thierry FOURNIER | b9b0846 | 2013-12-13 15:12:32 +0100 | [diff] [blame] | 957 | /* allocate pattern */ |
| 958 | patl = calloc(1, sizeof(*patl)); |
| 959 | if (!patl) { |
| 960 | memprintf(err, "out of memory while indexing pattern"); |
Thierry FOURNIER | 972028f | 2014-01-23 17:53:31 +0100 | [diff] [blame] | 961 | return 0; |
| 962 | } |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 963 | |
Thierry FOURNIER | b9b0846 | 2013-12-13 15:12:32 +0100 | [diff] [blame] | 964 | /* duplicate pattern */ |
| 965 | memcpy(&patl->pat, pat, sizeof(*pat)); |
Thierry FOURNIER | 7148ce6 | 2013-12-06 19:06:43 +0100 | [diff] [blame] | 966 | |
Thierry FOURNIER | b9b0846 | 2013-12-13 15:12:32 +0100 | [diff] [blame] | 967 | /* chain pattern in the expression */ |
| 968 | LIST_ADDQ(&expr->patterns, &patl->list); |
| 969 | |
| 970 | /* that's ok */ |
| 971 | return 1; |
| 972 | } |
| 973 | |
| 974 | int pat_idx_list_ptr(struct pattern_expr *expr, struct pattern *pat, char **err) |
| 975 | { |
| 976 | struct pattern_list *patl; |
| 977 | |
| 978 | /* allocate pattern */ |
| 979 | patl = calloc(1, sizeof(*patl)); |
| 980 | if (!patl) |
Thierry FOURNIER | 972028f | 2014-01-23 17:53:31 +0100 | [diff] [blame] | 981 | return 0; |
Thierry FOURNIER | 7148ce6 | 2013-12-06 19:06:43 +0100 | [diff] [blame] | 982 | |
Thierry FOURNIER | b9b0846 | 2013-12-13 15:12:32 +0100 | [diff] [blame] | 983 | /* duplicate pattern */ |
| 984 | memcpy(&patl->pat, pat, sizeof(*pat)); |
| 985 | patl->pat.ptr.ptr = malloc(patl->pat.len); |
| 986 | if (!patl->pat.ptr.ptr) { |
| 987 | free(patl); |
| 988 | memprintf(err, "out of memory while indexing pattern"); |
| 989 | return 0; |
| 990 | } |
| 991 | memcpy(patl->pat.ptr.ptr, pat->ptr.ptr, pat->len); |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 992 | |
Thierry FOURNIER | b9b0846 | 2013-12-13 15:12:32 +0100 | [diff] [blame] | 993 | /* chain pattern in the expression */ |
| 994 | LIST_ADDQ(&expr->patterns, &patl->list); |
Thierry FOURNIER | 7148ce6 | 2013-12-06 19:06:43 +0100 | [diff] [blame] | 995 | |
Thierry FOURNIER | b9b0846 | 2013-12-13 15:12:32 +0100 | [diff] [blame] | 996 | /* that's ok */ |
| 997 | return 1; |
| 998 | } |
Thierry FOURNIER | 7148ce6 | 2013-12-06 19:06:43 +0100 | [diff] [blame] | 999 | |
Thierry FOURNIER | b9b0846 | 2013-12-13 15:12:32 +0100 | [diff] [blame] | 1000 | int pat_idx_list_str(struct pattern_expr *expr, struct pattern *pat, char **err) |
| 1001 | { |
| 1002 | struct pattern_list *patl; |
Thierry FOURNIER | 7148ce6 | 2013-12-06 19:06:43 +0100 | [diff] [blame] | 1003 | |
Thierry FOURNIER | b9b0846 | 2013-12-13 15:12:32 +0100 | [diff] [blame] | 1004 | /* allocate pattern */ |
| 1005 | patl = calloc(1, sizeof(*patl)); |
| 1006 | if (!patl) { |
| 1007 | memprintf(err, "out of memory while indexing pattern"); |
| 1008 | return 0; |
| 1009 | } |
| 1010 | |
| 1011 | /* duplicate pattern */ |
| 1012 | memcpy(&patl->pat, pat, sizeof(*pat)); |
| 1013 | patl->pat.ptr.str = malloc(patl->pat.len + 1); |
| 1014 | if (!patl->pat.ptr.str) { |
| 1015 | free(patl); |
| 1016 | memprintf(err, "out of memory while indexing pattern"); |
| 1017 | return 0; |
| 1018 | } |
| 1019 | memcpy(patl->pat.ptr.ptr, pat->ptr.ptr, pat->len); |
| 1020 | patl->pat.ptr.str[patl->pat.len] = '\0'; |
Thierry FOURNIER | 7148ce6 | 2013-12-06 19:06:43 +0100 | [diff] [blame] | 1021 | |
Thierry FOURNIER | b9b0846 | 2013-12-13 15:12:32 +0100 | [diff] [blame] | 1022 | /* chain pattern in the expression */ |
| 1023 | LIST_ADDQ(&expr->patterns, &patl->list); |
Thierry FOURNIER | 7148ce6 | 2013-12-06 19:06:43 +0100 | [diff] [blame] | 1024 | |
Thierry FOURNIER | b9b0846 | 2013-12-13 15:12:32 +0100 | [diff] [blame] | 1025 | /* that's ok */ |
| 1026 | return 1; |
| 1027 | } |
| 1028 | |
| 1029 | int pat_idx_list_reg(struct pattern_expr *expr, struct pattern *pat, char **err) |
| 1030 | { |
| 1031 | struct pattern_list *patl; |
Thierry FOURNIER | 7148ce6 | 2013-12-06 19:06:43 +0100 | [diff] [blame] | 1032 | |
Thierry FOURNIER | b9b0846 | 2013-12-13 15:12:32 +0100 | [diff] [blame] | 1033 | /* allocate pattern */ |
| 1034 | patl = calloc(1, sizeof(*patl)); |
| 1035 | if (!patl) { |
| 1036 | memprintf(err, "out of memory while indexing pattern"); |
| 1037 | return 0; |
Thierry FOURNIER | 972028f | 2014-01-23 17:53:31 +0100 | [diff] [blame] | 1038 | } |
Thierry FOURNIER | 7148ce6 | 2013-12-06 19:06:43 +0100 | [diff] [blame] | 1039 | |
Thierry FOURNIER | b9b0846 | 2013-12-13 15:12:32 +0100 | [diff] [blame] | 1040 | /* duplicate pattern */ |
| 1041 | memcpy(&patl->pat, pat, sizeof(*pat)); |
| 1042 | |
| 1043 | /* allocate regex */ |
| 1044 | patl->pat.ptr.reg = calloc(1, sizeof(*patl->pat.ptr.reg)); |
| 1045 | if (!patl->pat.ptr.reg) { |
| 1046 | free(patl); |
| 1047 | memprintf(err, "out of memory while indexing pattern"); |
| 1048 | return 0; |
| 1049 | } |
| 1050 | |
| 1051 | /* compile regex */ |
| 1052 | if (!regex_comp(pat->ptr.reg->regstr, patl->pat.ptr.reg, !(patl->pat.flags & PAT_F_IGNORE_CASE), 0, err)) { |
| 1053 | free(patl); |
| 1054 | free(patl->pat.ptr.reg); |
| 1055 | return 0; |
| 1056 | } |
| 1057 | |
Thierry FOURNIER | b9b0846 | 2013-12-13 15:12:32 +0100 | [diff] [blame] | 1058 | /* chain pattern in the expression */ |
| 1059 | LIST_ADDQ(&expr->patterns, &patl->list); |
| 1060 | |
| 1061 | /* that's ok */ |
| 1062 | return 1; |
| 1063 | } |
| 1064 | |
| 1065 | int pat_idx_tree_ip(struct pattern_expr *expr, struct pattern *pat, char **err) |
| 1066 | { |
| 1067 | unsigned int mask; |
Thierry FOURNIER | e1bcac5 | 2013-12-13 16:09:50 +0100 | [diff] [blame] | 1068 | struct pattern_tree *node; |
Thierry FOURNIER | b9b0846 | 2013-12-13 15:12:32 +0100 | [diff] [blame] | 1069 | |
| 1070 | /* Only IPv4 can be indexed */ |
| 1071 | if (pat->type == SMP_T_IPV4) { |
Thierry FOURNIER | 972028f | 2014-01-23 17:53:31 +0100 | [diff] [blame] | 1072 | /* in IPv4 case, check if the mask is contiguous so that we can |
| 1073 | * insert the network into the tree. A continuous mask has only |
| 1074 | * ones on the left. This means that this mask + its lower bit |
| 1075 | * added once again is null. |
| 1076 | */ |
Thierry FOURNIER | b9b0846 | 2013-12-13 15:12:32 +0100 | [diff] [blame] | 1077 | mask = ntohl(pat->val.ipv4.mask.s_addr); |
| 1078 | if (mask + (mask & -mask) == 0) { |
| 1079 | mask = mask ? 33 - flsnz(mask & -mask) : 0; /* equals cidr value */ |
Thierry FOURNIER | 7148ce6 | 2013-12-06 19:06:43 +0100 | [diff] [blame] | 1080 | |
Thierry FOURNIER | b9b0846 | 2013-12-13 15:12:32 +0100 | [diff] [blame] | 1081 | /* node memory allocation */ |
| 1082 | node = calloc(1, sizeof(*node) + 4); |
| 1083 | if (!node) { |
| 1084 | memprintf(err, "out of memory while loading pattern"); |
| 1085 | return 0; |
| 1086 | } |
Thierry FOURNIER | 7148ce6 | 2013-12-06 19:06:43 +0100 | [diff] [blame] | 1087 | |
Thierry FOURNIER | b9b0846 | 2013-12-13 15:12:32 +0100 | [diff] [blame] | 1088 | /* copy the pointer to sample associated to this node */ |
| 1089 | node->smp = pat->smp; |
Thierry FOURNIER | 7148ce6 | 2013-12-06 19:06:43 +0100 | [diff] [blame] | 1090 | |
Thierry FOURNIER | b9b0846 | 2013-12-13 15:12:32 +0100 | [diff] [blame] | 1091 | /* FIXME: insert <addr>/<mask> into the tree here */ |
| 1092 | memcpy(node->node.key, &pat->val.ipv4.addr, 4); /* network byte order */ |
| 1093 | node->node.node.pfx = mask; |
| 1094 | if (ebmb_insert_prefix(&expr->pattern_tree, &node->node, 4) != &node->node) |
| 1095 | free(node); /* was a duplicate */ |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 1096 | |
Thierry FOURNIER | b9b0846 | 2013-12-13 15:12:32 +0100 | [diff] [blame] | 1097 | /* that's ok */ |
| 1098 | return 1; |
| 1099 | } |
Thierry FOURNIER | 33a7433 | 2013-12-19 23:54:54 +0100 | [diff] [blame] | 1100 | else { |
| 1101 | /* If the mask is not contiguous, just add the pattern to the list */ |
| 1102 | return pat_idx_list_val(expr, pat, err); |
| 1103 | } |
Thierry FOURNIER | b9b0846 | 2013-12-13 15:12:32 +0100 | [diff] [blame] | 1104 | } |
Thierry FOURNIER | 33a7433 | 2013-12-19 23:54:54 +0100 | [diff] [blame] | 1105 | else if (pat->type == SMP_T_IPV6) { |
| 1106 | /* IPv6 also can be indexed */ |
| 1107 | node = calloc(1, sizeof(*node) + 16); |
| 1108 | if (!node) { |
| 1109 | memprintf(err, "out of memory while loading pattern"); |
| 1110 | return 0; |
| 1111 | } |
| 1112 | |
| 1113 | /* copy the pointer to sample associated to this node */ |
| 1114 | node->smp = pat->smp; |
| 1115 | |
| 1116 | /* FIXME: insert <addr>/<mask> into the tree here */ |
| 1117 | memcpy(node->node.key, &pat->val.ipv6.addr, 16); /* network byte order */ |
| 1118 | node->node.node.pfx = pat->val.ipv6.mask; |
| 1119 | if (ebmb_insert_prefix(&expr->pattern_tree_2, &node->node, 16) != &node->node) |
| 1120 | free(node); /* was a duplicate */ |
| 1121 | |
| 1122 | /* that's ok */ |
| 1123 | return 1; |
| 1124 | } |
Thierry FOURNIER | 7148ce6 | 2013-12-06 19:06:43 +0100 | [diff] [blame] | 1125 | |
Thierry FOURNIER | 33a7433 | 2013-12-19 23:54:54 +0100 | [diff] [blame] | 1126 | return 0; |
Thierry FOURNIER | b9b0846 | 2013-12-13 15:12:32 +0100 | [diff] [blame] | 1127 | } |
| 1128 | |
| 1129 | int pat_idx_tree_str(struct pattern_expr *expr, struct pattern *pat, char **err) |
| 1130 | { |
| 1131 | int len; |
Thierry FOURNIER | e1bcac5 | 2013-12-13 16:09:50 +0100 | [diff] [blame] | 1132 | struct pattern_tree *node; |
Thierry FOURNIER | b9b0846 | 2013-12-13 15:12:32 +0100 | [diff] [blame] | 1133 | |
| 1134 | /* Only string can be indexed */ |
Thierry FOURNIER | 7654c9f | 2013-12-17 00:20:33 +0100 | [diff] [blame] | 1135 | if (pat->type != SMP_T_STR) { |
Thierry FOURNIER | b9b0846 | 2013-12-13 15:12:32 +0100 | [diff] [blame] | 1136 | memprintf(err, "internal error: string expected, but the type is '%s'", |
| 1137 | smp_to_type[pat->type]); |
| 1138 | return 0; |
Thierry FOURNIER | 972028f | 2014-01-23 17:53:31 +0100 | [diff] [blame] | 1139 | } |
Thierry FOURNIER | 7148ce6 | 2013-12-06 19:06:43 +0100 | [diff] [blame] | 1140 | |
Thierry FOURNIER | b9b0846 | 2013-12-13 15:12:32 +0100 | [diff] [blame] | 1141 | /* If the flag PAT_F_IGNORE_CASE is set, we cannot use trees */ |
| 1142 | if (pat->flags & PAT_F_IGNORE_CASE) |
| 1143 | return pat_idx_list_str(expr, pat, err); |
Thierry FOURNIER | 7148ce6 | 2013-12-06 19:06:43 +0100 | [diff] [blame] | 1144 | |
Thierry FOURNIER | b9b0846 | 2013-12-13 15:12:32 +0100 | [diff] [blame] | 1145 | /* Process the key len */ |
| 1146 | len = strlen(pat->ptr.str) + 1; |
| 1147 | |
| 1148 | /* node memory allocation */ |
| 1149 | node = calloc(1, sizeof(*node) + len); |
| 1150 | if (!node) { |
| 1151 | memprintf(err, "out of memory while loading pattern"); |
| 1152 | return 0; |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 1153 | } |
| 1154 | |
Thierry FOURNIER | b9b0846 | 2013-12-13 15:12:32 +0100 | [diff] [blame] | 1155 | /* copy the pointer to sample associated to this node */ |
| 1156 | node->smp = pat->smp; |
| 1157 | |
| 1158 | /* copy the string */ |
| 1159 | memcpy(node->node.key, pat->ptr.str, len); |
| 1160 | |
| 1161 | /* index the new node */ |
| 1162 | if (ebst_insert(&expr->pattern_tree, &node->node) != &node->node) |
| 1163 | free(node); /* was a duplicate */ |
| 1164 | |
| 1165 | /* that's ok */ |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 1166 | return 1; |
| 1167 | } |
| 1168 | |
Thierry FOURNIER | 55d0b10 | 2014-01-15 11:25:26 +0100 | [diff] [blame] | 1169 | struct sample_storage **pat_find_smp_list_val(struct pattern_expr *expr, struct pattern *pattern) |
| 1170 | { |
| 1171 | struct pattern_list *pat; |
| 1172 | struct pattern_list *safe; |
| 1173 | |
| 1174 | list_for_each_entry_safe(pat, safe, &expr->patterns, list) { |
| 1175 | |
| 1176 | /* Check equality. */ |
| 1177 | if (pattern->val.range.min_set != pat->pat.val.range.min_set) |
| 1178 | continue; |
| 1179 | if (pattern->val.range.max_set != pat->pat.val.range.max_set) |
| 1180 | continue; |
| 1181 | if (pattern->val.range.min_set && |
| 1182 | pattern->val.range.min != pat->pat.val.range.min) |
| 1183 | continue; |
| 1184 | if (pattern->val.range.max_set && |
| 1185 | pattern->val.range.max != pat->pat.val.range.max) |
| 1186 | continue; |
| 1187 | |
| 1188 | /* Return the pointer on the sample pointer. */ |
| 1189 | return &pat->pat.smp; |
| 1190 | } |
| 1191 | |
| 1192 | return NULL; |
| 1193 | } |
| 1194 | |
| 1195 | struct sample_storage **pat_find_smp_tree_ip(struct pattern_expr *expr, struct pattern *pattern) |
| 1196 | { |
| 1197 | struct ebmb_node *node, *next_node; |
| 1198 | struct pattern_tree *elt; |
| 1199 | struct pattern_list *pat; |
| 1200 | struct pattern_list *safe; |
| 1201 | unsigned int mask; |
| 1202 | |
| 1203 | /* browse each node of the tree for IPv4 addresses. */ |
| 1204 | if (pattern->type == SMP_T_IPV4) { |
| 1205 | /* Convert mask. If the mask is contiguous, browse each node |
| 1206 | * of the tree for IPv4 addresses. |
| 1207 | */ |
| 1208 | mask = ntohl(pattern->val.ipv4.mask.s_addr); |
| 1209 | if (mask + (mask & -mask) == 0) { |
| 1210 | mask = mask ? 33 - flsnz(mask & -mask) : 0; /* equals cidr value */ |
| 1211 | |
| 1212 | for (node = ebmb_first(&expr->pattern_tree), next_node = ebmb_next(node); |
| 1213 | node; |
| 1214 | node = next_node, next_node = next_node ? ebmb_next(next_node) : NULL) { |
| 1215 | /* Extract container of the tree node. */ |
| 1216 | elt = container_of(node, struct pattern_tree, node); |
| 1217 | |
| 1218 | /* Check equality. */ |
| 1219 | if (strcmp(pattern->ptr.str, (char *)elt->node.key) != 0) |
| 1220 | continue; |
| 1221 | |
| 1222 | /* Return the pointer on the sample pointer. */ |
| 1223 | return &elt->smp; |
| 1224 | } |
| 1225 | } |
| 1226 | else { |
| 1227 | /* Browse each node of the list for IPv4 addresses. */ |
| 1228 | list_for_each_entry_safe(pat, safe, &expr->patterns, list) { |
| 1229 | /* Check equality. */ |
| 1230 | if (memcmp(&pattern->val.ipv4.addr, &pat->pat.val.ipv4.addr, |
| 1231 | sizeof(pat->pat.val.ipv4.addr)) != 0) |
| 1232 | continue; |
| 1233 | if (memcmp(&pattern->val.ipv4.mask, &pat->pat.val.ipv4.mask, |
| 1234 | sizeof(pat->pat.val.ipv4.addr)) != 0) |
| 1235 | continue; |
| 1236 | |
| 1237 | /* Return the pointer on the sample pointer. */ |
| 1238 | return &pat->pat.smp; |
| 1239 | } |
| 1240 | } |
| 1241 | } |
| 1242 | else if (pattern->type == SMP_T_IPV6) { |
| 1243 | /* browse each node of the tree for IPv4 addresses. */ |
| 1244 | for (node = ebmb_first(&expr->pattern_tree_2), next_node = ebmb_next(node); |
| 1245 | node; |
| 1246 | node = next_node, next_node = next_node ? ebmb_next(next_node) : NULL) { |
| 1247 | /* Extract container of the tree node. */ |
| 1248 | elt = container_of(node, struct pattern_tree, node); |
| 1249 | |
| 1250 | /* Check equality. */ |
| 1251 | if (strcmp(pattern->ptr.str, (char *)elt->node.key) != 0) |
| 1252 | continue; |
| 1253 | |
| 1254 | /* Return the pointer on the sample pointer. */ |
| 1255 | return &elt->smp; |
| 1256 | } |
| 1257 | } |
| 1258 | |
| 1259 | return NULL; |
| 1260 | } |
| 1261 | |
| 1262 | struct sample_storage **pat_find_smp_list_ptr(struct pattern_expr *expr, struct pattern *pattern) |
| 1263 | { |
| 1264 | struct pattern_list *pat; |
| 1265 | struct pattern_list *safe; |
| 1266 | |
| 1267 | list_for_each_entry_safe(pat, safe, &expr->patterns, list) { |
| 1268 | /* Check equality. */ |
| 1269 | if (pattern->len != pat->pat.len) |
| 1270 | continue; |
| 1271 | if (memcmp(pattern->ptr.ptr, pat->pat.ptr.ptr, pat->pat.len) != 0) |
| 1272 | continue; |
| 1273 | |
| 1274 | /* Return the pointer on the sample pointer. */ |
| 1275 | return &pat->pat.smp; |
| 1276 | } |
| 1277 | |
| 1278 | return NULL; |
| 1279 | } |
| 1280 | |
| 1281 | struct sample_storage **pat_find_smp_tree_str(struct pattern_expr *expr, struct pattern *pattern) |
| 1282 | { |
| 1283 | struct ebmb_node *node, *next_node; |
| 1284 | struct pattern_tree *elt; |
| 1285 | |
| 1286 | /* browse each node of the tree. */ |
| 1287 | for (node = ebmb_first(&expr->pattern_tree), next_node = ebmb_next(node); |
| 1288 | node; |
| 1289 | node = next_node, next_node = next_node ? ebmb_next(next_node) : NULL) { |
| 1290 | /* Extract container of the tree node. */ |
| 1291 | elt = container_of(node, struct pattern_tree, node); |
| 1292 | |
| 1293 | /* Check equality. */ |
| 1294 | if (strcmp(pattern->ptr.str, (char *)elt->node.key) != 0) |
| 1295 | continue; |
| 1296 | |
| 1297 | /* Return the pointer on the sample pointer. */ |
| 1298 | return &elt->smp; |
| 1299 | } |
| 1300 | |
| 1301 | return NULL; |
| 1302 | } |
| 1303 | |
| 1304 | struct sample_storage **pat_find_smp_list_str(struct pattern_expr *expr, struct pattern *pattern) |
| 1305 | { |
| 1306 | struct pattern_list *pat; |
| 1307 | struct pattern_list *safe; |
| 1308 | |
| 1309 | list_for_each_entry_safe(pat, safe, &expr->patterns, list) { |
| 1310 | /* Check equality. */ |
| 1311 | if (pattern->len != pat->pat.len) |
| 1312 | continue; |
| 1313 | if (pat->pat.flags & PAT_F_IGNORE_CASE) { |
| 1314 | if (strncasecmp(pattern->ptr.str, pat->pat.ptr.str, pat->pat.len) != 0) |
| 1315 | continue; |
| 1316 | } |
| 1317 | else { |
| 1318 | if (strncmp(pattern->ptr.str, pat->pat.ptr.str, pat->pat.len) != 0) |
| 1319 | continue; |
| 1320 | } |
| 1321 | |
| 1322 | /* Return the pointer on the sample pointer. */ |
| 1323 | return &pat->pat.smp; |
| 1324 | } |
| 1325 | |
| 1326 | return NULL; |
| 1327 | } |
| 1328 | |
| 1329 | struct sample_storage **pat_find_smp_list_reg(struct pattern_expr *expr, struct pattern *pattern) |
| 1330 | { |
| 1331 | struct pattern_list *pat; |
| 1332 | struct pattern_list *safe; |
| 1333 | |
| 1334 | list_for_each_entry_safe(pat, safe, &expr->patterns, list) { |
| 1335 | /* Check equality. */ |
| 1336 | if (pat->pat.flags & PAT_F_IGNORE_CASE) { |
| 1337 | if (strcasecmp(pattern->ptr.reg->regstr, pat->pat.ptr.reg->regstr) != 0) |
| 1338 | continue; |
| 1339 | } |
| 1340 | else { |
| 1341 | if (strcmp(pattern->ptr.reg->regstr, pat->pat.ptr.reg->regstr) != 0) |
| 1342 | continue; |
| 1343 | } |
| 1344 | |
| 1345 | /* Return the pointer on the sample pointer. */ |
| 1346 | return &pat->pat.smp; |
| 1347 | } |
| 1348 | |
| 1349 | return NULL; |
| 1350 | } |
| 1351 | |
Thierry FOURNIER | b113650 | 2014-01-15 11:38:49 +0100 | [diff] [blame] | 1352 | void pat_del_list_val(struct pattern_expr *expr, struct pattern *pattern) |
| 1353 | { |
| 1354 | struct pattern_list *pat; |
| 1355 | struct pattern_list *safe; |
| 1356 | |
| 1357 | list_for_each_entry_safe(pat, safe, &expr->patterns, list) { |
| 1358 | /* Check equality. */ |
| 1359 | if (pattern->val.range.min_set != pat->pat.val.range.min_set) |
| 1360 | continue; |
| 1361 | if (pattern->val.range.max_set != pat->pat.val.range.max_set) |
| 1362 | continue; |
| 1363 | if (pattern->val.range.min_set && |
| 1364 | pattern->val.range.min != pat->pat.val.range.min) |
| 1365 | continue; |
| 1366 | if (pattern->val.range.max_set && |
| 1367 | pattern->val.range.max != pat->pat.val.range.max) |
| 1368 | continue; |
| 1369 | |
| 1370 | /* Delete and free entry. */ |
| 1371 | LIST_DEL(&pat->list); |
| 1372 | free(pat->pat.smp); |
| 1373 | free(pat); |
| 1374 | } |
| 1375 | } |
| 1376 | |
| 1377 | void pat_del_tree_ip(struct pattern_expr *expr, struct pattern *pattern) |
| 1378 | { |
| 1379 | struct ebmb_node *node, *next_node; |
| 1380 | struct pattern_tree *elt; |
| 1381 | struct pattern_list *pat; |
| 1382 | struct pattern_list *safe; |
| 1383 | unsigned int mask; |
| 1384 | |
| 1385 | /* browse each node of the tree for IPv4 addresses. */ |
| 1386 | if (pattern->type == SMP_T_IPV4) { |
| 1387 | /* Convert mask. If the mask is contiguous, browse each node |
| 1388 | * of the tree for IPv4 addresses. |
| 1389 | */ |
| 1390 | mask = ntohl(pattern->val.ipv4.mask.s_addr); |
| 1391 | if (mask + (mask & -mask) == 0) { |
| 1392 | mask = mask ? 33 - flsnz(mask & -mask) : 0; /* equals cidr value */ |
| 1393 | |
| 1394 | for (node = ebmb_first(&expr->pattern_tree), next_node = node ? ebmb_next(node) : NULL; |
| 1395 | node; |
| 1396 | node = next_node, next_node = node ? ebmb_next(node) : NULL) { |
| 1397 | /* Extract container of the tree node. */ |
| 1398 | elt = container_of(node, struct pattern_tree, node); |
| 1399 | |
| 1400 | /* Check equality. */ |
| 1401 | if (memcmp(&pattern->val.ipv4.addr, elt->node.key, |
| 1402 | sizeof(pattern->val.ipv4.addr)) != 0) |
| 1403 | continue; |
| 1404 | if (elt->node.node.pfx != mask) |
| 1405 | continue; |
| 1406 | |
| 1407 | /* Delete and free entry. */ |
| 1408 | ebmb_delete(node); |
| 1409 | free(elt->smp); |
| 1410 | free(elt); |
| 1411 | } |
| 1412 | } |
| 1413 | else { |
| 1414 | /* Browse each node of the list for IPv4 addresses. */ |
| 1415 | list_for_each_entry_safe(pat, safe, &expr->patterns, list) { |
| 1416 | /* Check equality, addr then mask */ |
| 1417 | if (memcmp(&pattern->val.ipv4.addr, &pat->pat.val.ipv4.addr, |
| 1418 | sizeof(pat->pat.val.ipv4.addr)) != 0) |
| 1419 | continue; |
| 1420 | |
| 1421 | if (memcmp(&pattern->val.ipv4.mask, &pat->pat.val.ipv4.mask, |
| 1422 | sizeof(pat->pat.val.ipv4.addr)) != 0) |
| 1423 | continue; |
| 1424 | |
| 1425 | /* Delete and free entry. */ |
| 1426 | LIST_DEL(&pat->list); |
| 1427 | free(pat->pat.smp); |
| 1428 | free(pat); |
| 1429 | } |
| 1430 | } |
| 1431 | } |
| 1432 | else if (pattern->type == SMP_T_IPV6) { |
| 1433 | /* browse each node of the tree for IPv6 addresses. */ |
| 1434 | for (node = ebmb_first(&expr->pattern_tree_2), next_node = node ? ebmb_next(node) : NULL; |
| 1435 | node; |
| 1436 | node = next_node, next_node = node ? ebmb_next(node) : NULL) { |
| 1437 | /* Extract container of the tree node. */ |
| 1438 | elt = container_of(node, struct pattern_tree, node); |
| 1439 | |
| 1440 | /* Check equality. */ |
| 1441 | if (memcmp(&pattern->val.ipv6.addr, elt->node.key, |
| 1442 | sizeof(pattern->val.ipv6.addr)) != 0) |
| 1443 | continue; |
| 1444 | if (elt->node.node.pfx != pattern->val.ipv6.mask) |
| 1445 | continue; |
| 1446 | |
| 1447 | /* Delete and free entry. */ |
| 1448 | ebmb_delete(node); |
| 1449 | free(elt->smp); |
| 1450 | free(elt); |
| 1451 | } |
| 1452 | } |
| 1453 | } |
| 1454 | |
| 1455 | void pat_del_list_ptr(struct pattern_expr *expr, struct pattern *pattern) |
| 1456 | { |
| 1457 | struct pattern_list *pat; |
| 1458 | struct pattern_list *safe; |
| 1459 | |
| 1460 | list_for_each_entry_safe(pat, safe, &expr->patterns, list) { |
| 1461 | /* Check equality. */ |
| 1462 | if (pattern->len != pat->pat.len) |
| 1463 | continue; |
| 1464 | if (memcmp(pattern->ptr.ptr, pat->pat.ptr.ptr, pat->pat.len) != 0) |
| 1465 | continue; |
| 1466 | |
| 1467 | /* Delete and free entry. */ |
| 1468 | LIST_DEL(&pat->list); |
| 1469 | free(pat->pat.ptr.ptr); |
| 1470 | free(pat->pat.smp); |
| 1471 | free(pat); |
| 1472 | } |
| 1473 | } |
| 1474 | |
| 1475 | void pat_del_tree_str(struct pattern_expr *expr, struct pattern *pattern) |
| 1476 | { |
| 1477 | struct ebmb_node *node, *next_node; |
| 1478 | struct pattern_tree *elt; |
| 1479 | |
| 1480 | /* browse each node of the tree. */ |
| 1481 | for (node = ebmb_first(&expr->pattern_tree), next_node = node ? ebmb_next(node) : NULL; |
| 1482 | node; |
| 1483 | node = next_node, next_node = node ? ebmb_next(node) : NULL) { |
| 1484 | /* Extract container of the tree node. */ |
| 1485 | elt = container_of(node, struct pattern_tree, node); |
| 1486 | |
| 1487 | /* Check equality. */ |
| 1488 | if (strcmp(pattern->ptr.str, (char *)elt->node.key) != 0) |
| 1489 | continue; |
| 1490 | |
| 1491 | /* Delete and free entry. */ |
| 1492 | ebmb_delete(node); |
| 1493 | free(elt->smp); |
| 1494 | free(elt); |
| 1495 | } |
| 1496 | } |
| 1497 | |
| 1498 | void pat_del_list_str(struct pattern_expr *expr, struct pattern *pattern) |
| 1499 | { |
| 1500 | struct pattern_list *pat; |
| 1501 | struct pattern_list *safe; |
| 1502 | |
| 1503 | list_for_each_entry_safe(pat, safe, &expr->patterns, list) { |
| 1504 | /* Check equality. */ |
| 1505 | if (pattern->len != pat->pat.len) |
| 1506 | continue; |
| 1507 | if (pat->pat.flags & PAT_F_IGNORE_CASE) { |
| 1508 | if (strncasecmp(pattern->ptr.str, pat->pat.ptr.str, pat->pat.len) != 0) |
| 1509 | continue; |
| 1510 | } |
| 1511 | else { |
| 1512 | if (strncmp(pattern->ptr.str, pat->pat.ptr.str, pat->pat.len) != 0) |
| 1513 | continue; |
| 1514 | } |
| 1515 | |
| 1516 | /* Delete and free entry. */ |
| 1517 | LIST_DEL(&pat->list); |
| 1518 | free(pat->pat.ptr.str); |
| 1519 | free(pat->pat.smp); |
| 1520 | free(pat); |
| 1521 | } |
| 1522 | } |
| 1523 | |
| 1524 | void pat_del_list_reg(struct pattern_expr *expr, struct pattern *pattern) |
| 1525 | { |
| 1526 | struct pattern_list *pat; |
| 1527 | struct pattern_list *safe; |
| 1528 | |
| 1529 | list_for_each_entry_safe(pat, safe, &expr->patterns, list) { |
| 1530 | /* Check equality. */ |
| 1531 | if (pat->pat.flags & PAT_F_IGNORE_CASE) { |
| 1532 | if (strcasecmp(pattern->ptr.reg->regstr, pat->pat.ptr.reg->regstr) != 0) |
| 1533 | continue; |
| 1534 | } |
| 1535 | else { |
| 1536 | if (strcmp(pattern->ptr.reg->regstr, pat->pat.ptr.reg->regstr) != 0) |
| 1537 | continue; |
| 1538 | } |
| 1539 | |
| 1540 | /* Delete and free entry. */ |
| 1541 | LIST_DEL(&pat->list); |
| 1542 | regex_free(pat->pat.ptr.ptr); |
| 1543 | free(pat->pat.smp); |
| 1544 | free(pat); |
| 1545 | } |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 1546 | } |
| 1547 | |
| 1548 | void pattern_init_expr(struct pattern_expr *expr) |
| 1549 | { |
| 1550 | LIST_INIT(&expr->patterns); |
| 1551 | expr->pattern_tree = EB_ROOT_UNIQUE; |
| 1552 | expr->pattern_tree_2 = EB_ROOT_UNIQUE; |
| 1553 | } |
| 1554 | |
| 1555 | void pattern_init_head(struct pattern_head *head) |
| 1556 | { |
| 1557 | LIST_INIT(&head->head); |
| 1558 | } |
| 1559 | |
| 1560 | /* The following functions are relative to the management of the reference |
| 1561 | * lists. These lists are used to store the original pattern and associated |
| 1562 | * value as string form. |
| 1563 | * |
| 1564 | * This is used with modifiable ACL and MAPS |
Thierry FOURNIER | af5a29d | 2014-03-11 14:29:22 +0100 | [diff] [blame] | 1565 | * |
| 1566 | * The pattern reference are stored with two identifiers: the unique_id and |
| 1567 | * the reference. |
| 1568 | * |
| 1569 | * The reference identify a file. Each file with the same name point to the |
| 1570 | * same reference. We can register many times one file. If the file is modified, |
| 1571 | * all his dependencies are also modified. The reference can be used with map or |
| 1572 | * acl. |
| 1573 | * |
| 1574 | * The unique_id identify inline acl. The unique id is unique for each acl. |
| 1575 | * You cannot force the same id in the configuration file, because this repoort |
| 1576 | * an error. |
| 1577 | * |
| 1578 | * A particular case appears if the filename is a number. In this case, the |
| 1579 | * unique_id is set with the number represented by the filename and the |
| 1580 | * reference is also set. This method prevent double unique_id. |
| 1581 | * |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 1582 | */ |
| 1583 | |
| 1584 | /* This function lookup for reference. If the reference is found, they return |
| 1585 | * pointer to the struct pat_ref, else return NULL. |
| 1586 | */ |
| 1587 | struct pat_ref *pat_ref_lookup(const char *reference) |
| 1588 | { |
| 1589 | struct pat_ref *ref; |
| 1590 | |
| 1591 | list_for_each_entry(ref, &pattern_reference, list) |
Thierry FOURNIER | af5a29d | 2014-03-11 14:29:22 +0100 | [diff] [blame] | 1592 | if (ref->reference && strcmp(reference, ref->reference) == 0) |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 1593 | return ref; |
| 1594 | return NULL; |
| 1595 | } |
| 1596 | |
Thierry FOURNIER | af5a29d | 2014-03-11 14:29:22 +0100 | [diff] [blame] | 1597 | /* This function lookup for unique id. If the reference is found, they return |
| 1598 | * pointer to the struct pat_ref, else return NULL. |
| 1599 | */ |
| 1600 | struct pat_ref *pat_ref_lookupid(int unique_id) |
| 1601 | { |
| 1602 | struct pat_ref *ref; |
| 1603 | |
| 1604 | list_for_each_entry(ref, &pattern_reference, list) |
| 1605 | if (ref->unique_id == unique_id) |
| 1606 | return ref; |
| 1607 | return NULL; |
| 1608 | } |
| 1609 | |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 1610 | /* This function remove all pattern match <key> from the the reference |
| 1611 | * and from each expr member of the reference. This fucntion returns 1 |
| 1612 | * if the deletion is done and return 0 is the entry is not found. |
| 1613 | */ |
| 1614 | int pat_ref_delete(struct pat_ref *ref, const char *key) |
| 1615 | { |
| 1616 | struct pattern_expr *expr; |
| 1617 | struct pat_ref_elt *elt, *safe; |
| 1618 | int found = 0; |
| 1619 | |
| 1620 | /* delete pattern from reference */ |
| 1621 | list_for_each_entry_safe(elt, safe, &ref->head, list) { |
| 1622 | if (strcmp(key, elt->pattern) == 0) { |
| 1623 | LIST_DEL(&elt->list); |
| 1624 | free(elt->sample); |
| 1625 | free(elt->pattern); |
| 1626 | free(elt); |
| 1627 | found = 1; |
| 1628 | } |
| 1629 | } |
| 1630 | |
| 1631 | if (!found) |
| 1632 | return 0; |
| 1633 | |
Thierry FOURNIER | c5959fd | 2014-01-20 14:29:33 +0100 | [diff] [blame] | 1634 | list_for_each_entry(expr, &ref->pat, list) |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 1635 | pattern_delete(key, expr, NULL); |
| 1636 | |
| 1637 | return 1; |
| 1638 | } |
| 1639 | |
| 1640 | /* This function modify the sample of the first pattern that match the <key>. */ |
| 1641 | int pat_ref_set(struct pat_ref *ref, const char *key, const char *value) |
| 1642 | { |
| 1643 | struct pattern_expr *expr; |
| 1644 | struct pat_ref_elt *elt; |
| 1645 | struct sample_storage **smp; |
| 1646 | char *sample; |
| 1647 | int found = 0; |
| 1648 | |
| 1649 | /* modify pattern from reference */ |
| 1650 | list_for_each_entry(elt, &ref->head, list) { |
| 1651 | if (strcmp(key, elt->pattern) == 0) { |
| 1652 | sample = strdup(value); |
| 1653 | if (!sample) |
| 1654 | return 0; |
| 1655 | free(elt->sample); |
| 1656 | elt->sample = sample; |
| 1657 | found = 1; |
| 1658 | break; |
| 1659 | } |
| 1660 | } |
| 1661 | |
| 1662 | if (!found) |
| 1663 | return 0; |
| 1664 | |
Thierry FOURNIER | c5959fd | 2014-01-20 14:29:33 +0100 | [diff] [blame] | 1665 | list_for_each_entry(expr, &ref->pat, list) { |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 1666 | smp = pattern_find_smp(key, expr, NULL); |
| 1667 | if (smp && expr->pat_head->parse_smp) |
| 1668 | if (!expr->pat_head->parse_smp(value, *smp)) |
| 1669 | *smp = NULL; |
| 1670 | } |
| 1671 | |
| 1672 | return 1; |
| 1673 | } |
| 1674 | |
| 1675 | /* This function create new reference. <ref> is the reference name. |
| 1676 | * <flags> are PAT_REF_*. /!\ The reference is not checked, and must |
| 1677 | * be unique. The user must check the reference with "pat_ref_lookup()" |
| 1678 | * before calling this function. If the fucntion fail, it return NULL, |
| 1679 | * else return new struct pat_ref. |
| 1680 | */ |
| 1681 | struct pat_ref *pat_ref_new(const char *reference, unsigned int flags) |
| 1682 | { |
| 1683 | struct pat_ref *ref; |
| 1684 | |
| 1685 | ref = malloc(sizeof(*ref)); |
| 1686 | if (!ref) |
| 1687 | return NULL; |
| 1688 | |
| 1689 | ref->reference = strdup(reference); |
| 1690 | if (!ref->reference) { |
| 1691 | free(ref); |
| 1692 | return NULL; |
| 1693 | } |
| 1694 | |
Thierry FOURNIER | af5a29d | 2014-03-11 14:29:22 +0100 | [diff] [blame] | 1695 | ref->flags = flags; |
| 1696 | ref->unique_id = -1; |
| 1697 | |
| 1698 | LIST_INIT(&ref->head); |
| 1699 | LIST_INIT(&ref->pat); |
| 1700 | |
| 1701 | LIST_ADDQ(&pattern_reference, &ref->list); |
| 1702 | |
| 1703 | return ref; |
| 1704 | } |
| 1705 | |
| 1706 | /* This function create new reference. <unique_id> is the unique id. If |
| 1707 | * the value of <unique_id> is -1, the unique id is calculated later. |
| 1708 | * <flags> are PAT_REF_*. /!\ The reference is not checked, and must |
| 1709 | * be unique. The user must check the reference with "pat_ref_lookup()" |
| 1710 | * or pat_ref_lookupid before calling this function. If the function |
| 1711 | * fail, it return NULL, else return new struct pat_ref. |
| 1712 | */ |
| 1713 | struct pat_ref *pat_ref_newid(int unique_id, unsigned int flags) |
| 1714 | { |
| 1715 | struct pat_ref *ref; |
| 1716 | |
| 1717 | ref = malloc(sizeof(*ref)); |
| 1718 | if (!ref) |
| 1719 | return NULL; |
| 1720 | |
| 1721 | ref->reference = NULL; |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 1722 | ref->flags = flags; |
Thierry FOURNIER | af5a29d | 2014-03-11 14:29:22 +0100 | [diff] [blame] | 1723 | ref->unique_id = unique_id; |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 1724 | LIST_INIT(&ref->head); |
| 1725 | LIST_INIT(&ref->pat); |
| 1726 | |
| 1727 | LIST_ADDQ(&pattern_reference, &ref->list); |
| 1728 | |
| 1729 | return ref; |
| 1730 | } |
| 1731 | |
| 1732 | /* This function adds entry to <ref>. It can failed with memory error. |
| 1733 | * If the function fails, it returns 0. |
| 1734 | */ |
| 1735 | int pat_ref_append(struct pat_ref *ref, char *pattern, char *sample, int line) |
| 1736 | { |
| 1737 | struct pat_ref_elt *elt; |
| 1738 | |
| 1739 | elt = malloc(sizeof(*elt)); |
| 1740 | if (!elt) |
| 1741 | return 0; |
| 1742 | |
| 1743 | elt->line = line; |
| 1744 | |
| 1745 | elt->pattern = strdup(pattern); |
| 1746 | if (!elt->pattern) { |
| 1747 | free(elt); |
| 1748 | return 0; |
| 1749 | } |
| 1750 | |
| 1751 | if (sample) { |
| 1752 | elt->sample = strdup(sample); |
| 1753 | if (!elt->sample) { |
| 1754 | free(elt->pattern); |
| 1755 | free(elt); |
| 1756 | return 0; |
| 1757 | } |
| 1758 | } |
| 1759 | else |
| 1760 | elt->sample = NULL; |
| 1761 | |
| 1762 | LIST_ADDQ(&ref->head, &elt->list); |
| 1763 | |
| 1764 | return 1; |
Thierry FOURNIER | b113650 | 2014-01-15 11:38:49 +0100 | [diff] [blame] | 1765 | } |
| 1766 | |
Thierry FOURNIER | b9b0846 | 2013-12-13 15:12:32 +0100 | [diff] [blame] | 1767 | /* return 1 if the process is ok |
| 1768 | * return -1 if the parser fail. The err message is filled. |
| 1769 | * return -2 if out of memory |
| 1770 | */ |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 1771 | static inline |
| 1772 | int pattern_add(struct pattern_expr *expr, const char *arg, |
| 1773 | struct sample_storage *smp, |
| 1774 | int patflags, char **err) |
Thierry FOURNIER | b9b0846 | 2013-12-13 15:12:32 +0100 | [diff] [blame] | 1775 | { |
| 1776 | int ret; |
| 1777 | struct pattern pattern; |
| 1778 | |
| 1779 | /* initialise pattern */ |
| 1780 | memset(&pattern, 0, sizeof(pattern)); |
| 1781 | pattern.flags = patflags; |
| 1782 | pattern.smp = smp; |
| 1783 | |
| 1784 | /* parse pattern */ |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 1785 | ret = expr->pat_head->parse(arg, &pattern, err); |
Thierry FOURNIER | b9b0846 | 2013-12-13 15:12:32 +0100 | [diff] [blame] | 1786 | if (!ret) |
| 1787 | return 0; |
| 1788 | |
| 1789 | /* index pattern */ |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 1790 | if (!expr->pat_head->index(expr, &pattern, err)) |
| 1791 | return 0; |
| 1792 | |
| 1793 | return 1; |
| 1794 | } |
| 1795 | |
| 1796 | /* This function create sample found in <elt>, parse the pattern also |
| 1797 | * found in <elt> and insert it in <expr>. The function copy <patflags> |
| 1798 | * in <expr>. If the function fails, it returns0 and <err> is filled. |
| 1799 | * In succes case, the function returns 1. |
| 1800 | */ |
| 1801 | static inline |
| 1802 | int pat_ref_push(struct pat_ref_elt *elt, struct pattern_expr *expr, |
| 1803 | int patflags, char **err) |
| 1804 | { |
| 1805 | int ret; |
| 1806 | struct sample_storage *smp; |
| 1807 | |
| 1808 | /* Create sample */ |
| 1809 | if (elt->sample && expr->pat_head->parse_smp) { |
| 1810 | /* New sample. */ |
| 1811 | smp = malloc(sizeof(*smp)); |
| 1812 | if (!smp) |
| 1813 | return 0; |
| 1814 | |
| 1815 | /* Parse value. */ |
| 1816 | if (!expr->pat_head->parse_smp(elt->sample, smp)) { |
| 1817 | memprintf(err, "unable to parse '%s'", elt->sample); |
| 1818 | free(smp); |
| 1819 | return 0; |
| 1820 | } |
| 1821 | |
| 1822 | } |
| 1823 | else |
| 1824 | smp = NULL; |
| 1825 | |
| 1826 | /* Index value */ |
| 1827 | ret = pattern_add(expr, elt->pattern, smp, patflags, err); |
| 1828 | if (ret != 1) { |
| 1829 | free(smp); |
| 1830 | if (ret == -2) |
| 1831 | memprintf(err, "out of memory"); |
Thierry FOURNIER | b9b0846 | 2013-12-13 15:12:32 +0100 | [diff] [blame] | 1832 | return 0; |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 1833 | } |
Thierry FOURNIER | b9b0846 | 2013-12-13 15:12:32 +0100 | [diff] [blame] | 1834 | |
| 1835 | return 1; |
| 1836 | } |
| 1837 | |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 1838 | /* This function adds entry to <ref>. It can failed with memory error. |
| 1839 | * The new entry is added at all the pattern_expr registered in this |
| 1840 | * reference. The function stop on the first error encountered. It |
| 1841 | * returns 0 and err is filled. |
| 1842 | * |
| 1843 | * If an error is encountered, The complete add operation is cancelled. |
| 1844 | */ |
| 1845 | int pat_ref_add(struct pat_ref *ref, |
| 1846 | const char *pattern, const char *sample, |
| 1847 | char **err) |
| 1848 | { |
| 1849 | struct pat_ref_elt *elt; |
| 1850 | struct pattern_expr *expr; |
| 1851 | |
| 1852 | elt = malloc(sizeof(*elt)); |
| 1853 | if (!elt) { |
| 1854 | memprintf(err, "out of memory error"); |
| 1855 | return 0; |
| 1856 | } |
| 1857 | |
| 1858 | elt->line = -1; |
| 1859 | |
| 1860 | elt->pattern = strdup(pattern); |
| 1861 | if (!elt->pattern) { |
| 1862 | free(elt); |
| 1863 | memprintf(err, "out of memory error"); |
| 1864 | return 0; |
| 1865 | } |
| 1866 | |
| 1867 | if (sample) { |
| 1868 | elt->sample = strdup(sample); |
| 1869 | if (!elt->sample) { |
| 1870 | free(elt->pattern); |
| 1871 | free(elt); |
| 1872 | memprintf(err, "out of memory error"); |
| 1873 | return 0; |
| 1874 | } |
| 1875 | } |
| 1876 | else |
| 1877 | elt->sample = NULL; |
| 1878 | |
| 1879 | LIST_ADDQ(&ref->head, &elt->list); |
| 1880 | |
Thierry FOURNIER | c5959fd | 2014-01-20 14:29:33 +0100 | [diff] [blame] | 1881 | list_for_each_entry(expr, &ref->pat, list) { |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 1882 | if (!pat_ref_push(elt, expr, 0, err)) { |
| 1883 | /* Try to delete all the added entries. */ |
| 1884 | pat_ref_delete(ref, pattern); |
| 1885 | return 0; |
| 1886 | } |
| 1887 | } |
| 1888 | |
| 1889 | return 1; |
| 1890 | } |
| 1891 | |
| 1892 | /* This function prune all entries of <ref>. This function |
| 1893 | * prune the associated pattern_expr. |
| 1894 | */ |
| 1895 | void pat_ref_prune(struct pat_ref *ref) |
| 1896 | { |
| 1897 | struct pat_ref_elt *elt, *safe; |
| 1898 | struct pattern_expr *expr; |
| 1899 | |
| 1900 | list_for_each_entry_safe(elt, safe, &ref->head, list) { |
| 1901 | LIST_DEL(&elt->list); |
| 1902 | free(elt->pattern); |
| 1903 | free(elt->sample); |
| 1904 | free(elt); |
| 1905 | } |
| 1906 | |
Thierry FOURNIER | c5959fd | 2014-01-20 14:29:33 +0100 | [diff] [blame] | 1907 | list_for_each_entry(expr, &ref->pat, list) |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 1908 | expr->pat_head->prune(expr); |
| 1909 | } |
| 1910 | |
| 1911 | /* This function browse <ref> and try to index each entries in the <expr>. |
| 1912 | * If the flag <soe> (stop on error) is set, this function stop on the first |
| 1913 | * error, <err> is filled and return 0. If is not set, the function try to |
| 1914 | * load each entries and 1 is always returned. |
| 1915 | */ |
| 1916 | int pat_ref_load(struct pat_ref *ref, struct pattern_expr *expr, |
| 1917 | int patflags, int soe, char **err) |
| 1918 | { |
| 1919 | struct pat_ref_elt *elt; |
| 1920 | |
| 1921 | list_for_each_entry(elt, &ref->head, list) { |
| 1922 | if (soe && !pat_ref_push(elt, expr, patflags, err)) { |
| 1923 | if (elt->line > 0) |
| 1924 | memprintf(err, "%s at line %d of file '%s'", |
| 1925 | *err, elt->line, ref->reference); |
| 1926 | return 0; |
| 1927 | } |
| 1928 | } |
| 1929 | return 1; |
| 1930 | } |
| 1931 | |
| 1932 | /* This function lookup for existing reference <ref> in pattern_head <head>. */ |
| 1933 | struct pattern_expr *pattern_lookup_expr(struct pattern_head *head, struct pat_ref *ref) |
| 1934 | { |
Thierry FOURNIER | c5959fd | 2014-01-20 14:29:33 +0100 | [diff] [blame] | 1935 | struct pattern_expr_list *expr; |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 1936 | |
Thierry FOURNIER | c5959fd | 2014-01-20 14:29:33 +0100 | [diff] [blame] | 1937 | list_for_each_entry(expr, &head->head, list) |
| 1938 | if (expr->expr->ref == ref) |
| 1939 | return expr->expr; |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 1940 | return NULL; |
| 1941 | } |
| 1942 | |
| 1943 | /* This function create new pattern_expr associated to the reference <ref>. |
| 1944 | * <ref> can be NULL. If an error is occured, the function returns NULL and |
| 1945 | * <err> is filled. Otherwise, the function returns new pattern_expr linked |
| 1946 | * with <head> and <ref>. |
| 1947 | */ |
| 1948 | struct pattern_expr *pattern_new_expr(struct pattern_head *head, struct pat_ref *ref, char **err) |
| 1949 | { |
| 1950 | struct pattern_expr *expr; |
Thierry FOURNIER | c5959fd | 2014-01-20 14:29:33 +0100 | [diff] [blame] | 1951 | struct pattern_expr_list *list; |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 1952 | |
Thierry FOURNIER | c5959fd | 2014-01-20 14:29:33 +0100 | [diff] [blame] | 1953 | /* Memory and initialization of the chain element. */ |
| 1954 | list = malloc(sizeof(*list)); |
| 1955 | if (!list) { |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 1956 | memprintf(err, "out of memory"); |
| 1957 | return NULL; |
| 1958 | } |
| 1959 | |
Thierry FOURNIER | c5959fd | 2014-01-20 14:29:33 +0100 | [diff] [blame] | 1960 | /* Look for existing similar expr. No that only the index, parse and |
| 1961 | * parse_smp function must be identical for having similar pattern. |
| 1962 | * The other function depends of theses first. |
| 1963 | */ |
| 1964 | if (ref) { |
| 1965 | list_for_each_entry(expr, &ref->pat, list) |
| 1966 | if (expr->pat_head->index == head->index && |
| 1967 | expr->pat_head->parse == head->parse && |
| 1968 | expr->pat_head->parse_smp == head->parse_smp) |
| 1969 | break; |
| 1970 | if (&expr->list == &ref->pat) |
| 1971 | expr = NULL; |
| 1972 | } |
| 1973 | else |
| 1974 | expr = NULL; |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 1975 | |
Thierry FOURNIER | c5959fd | 2014-01-20 14:29:33 +0100 | [diff] [blame] | 1976 | /* If no similar expr was found, we create new expr. */ |
| 1977 | if (!expr) { |
| 1978 | /* Get a lot of memory for the expr struct. */ |
| 1979 | expr = malloc(sizeof(*expr)); |
| 1980 | if (!expr) { |
| 1981 | memprintf(err, "out of memory"); |
| 1982 | return NULL; |
| 1983 | } |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 1984 | |
Thierry FOURNIER | c5959fd | 2014-01-20 14:29:33 +0100 | [diff] [blame] | 1985 | /* Initialize this new expr. */ |
| 1986 | pattern_init_expr(expr); |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 1987 | |
Thierry FOURNIER | c5959fd | 2014-01-20 14:29:33 +0100 | [diff] [blame] | 1988 | /* This new pattern expression reference one of his heads. */ |
| 1989 | expr->pat_head = head; |
| 1990 | |
| 1991 | /* Link with ref, or to self to facilitate LIST_DEL() */ |
| 1992 | if (ref) |
| 1993 | LIST_ADDQ(&ref->pat, &expr->list); |
| 1994 | else |
| 1995 | LIST_INIT(&expr->list); |
| 1996 | |
| 1997 | expr->ref = ref; |
| 1998 | |
| 1999 | /* We must free this pattern if it is no more used. */ |
| 2000 | list->do_free = 1; |
| 2001 | } |
| 2002 | else { |
| 2003 | /* If the pattern used already exists, it is already linked |
| 2004 | * with ref and we must not free it. |
| 2005 | */ |
| 2006 | list->do_free = 0; |
| 2007 | } |
| 2008 | |
| 2009 | /* The new list element reference the pattern_expr. */ |
| 2010 | list->expr = expr; |
| 2011 | |
| 2012 | /* Link the list element with the pattern_head. */ |
| 2013 | LIST_ADDQ(&head->head, &list->list); |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 2014 | return expr; |
| 2015 | } |
| 2016 | |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 2017 | /* Reads patterns from a file. If <err_msg> is non-NULL, an error message will |
| 2018 | * be returned there on errors and the caller will have to free it. |
| 2019 | */ |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 2020 | 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] | 2021 | { |
| 2022 | FILE *file; |
| 2023 | char *c; |
| 2024 | char *arg; |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 2025 | int ret = 0; |
| 2026 | int line = 0; |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 2027 | |
| 2028 | file = fopen(filename, "r"); |
| 2029 | if (!file) { |
| 2030 | memprintf(err, "failed to open pattern file <%s>", filename); |
| 2031 | return 0; |
| 2032 | } |
| 2033 | |
| 2034 | /* now parse all patterns. The file may contain only one pattern per |
| 2035 | * line. If the line contains spaces, they will be part of the pattern. |
| 2036 | * The pattern stops at the first CR, LF or EOF encountered. |
| 2037 | */ |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 2038 | while (fgets(trash.str, trash.size, file) != NULL) { |
| 2039 | line++; |
| 2040 | c = trash.str; |
| 2041 | |
| 2042 | /* ignore lines beginning with a dash */ |
| 2043 | if (*c == '#') |
| 2044 | continue; |
| 2045 | |
| 2046 | /* strip leading spaces and tabs */ |
| 2047 | while (*c == ' ' || *c == '\t') |
| 2048 | c++; |
| 2049 | |
| 2050 | |
| 2051 | arg = c; |
| 2052 | while (*c && *c != '\n' && *c != '\r') |
| 2053 | c++; |
| 2054 | *c = 0; |
| 2055 | |
| 2056 | /* empty lines are ignored too */ |
| 2057 | if (c == arg) |
| 2058 | continue; |
| 2059 | |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 2060 | if (!pat_ref_append(ref, arg, NULL, line)) { |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 2061 | memprintf(err, "out of memory when loading patterns from file <%s>", filename); |
| 2062 | goto out_close; |
| 2063 | } |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 2064 | } |
| 2065 | |
| 2066 | ret = 1; /* success */ |
| 2067 | |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 2068 | out_close: |
| 2069 | fclose(file); |
| 2070 | return ret; |
| 2071 | } |
| 2072 | |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 2073 | int pattern_read_from_file(struct pattern_head *head, unsigned int refflags, |
| 2074 | const char *filename, int patflags, |
| 2075 | char **err) |
| 2076 | { |
| 2077 | struct pat_ref *ref; |
| 2078 | struct pattern_expr *expr; |
| 2079 | |
Thierry FOURNIER | af5a29d | 2014-03-11 14:29:22 +0100 | [diff] [blame] | 2080 | /* Lookup for the existing reference. */ |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 2081 | ref = pat_ref_lookup(filename); |
Thierry FOURNIER | af5a29d | 2014-03-11 14:29:22 +0100 | [diff] [blame] | 2082 | |
| 2083 | /* If the reference doesn't exists, create it and load associated file. */ |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 2084 | if (!ref) { |
| 2085 | ref = pat_ref_new(filename, refflags); |
| 2086 | if (!ref) { |
| 2087 | memprintf(err, "out of memory"); |
| 2088 | return 0; |
| 2089 | } |
| 2090 | |
| 2091 | if (!pat_ref_read_from_file(ref, filename, err)) |
| 2092 | return 0; |
| 2093 | } |
| 2094 | |
| 2095 | /* Now, we can loading patterns from the reference. */ |
| 2096 | |
| 2097 | /* Lookup for existing reference in the head. If the reference |
| 2098 | * doesn't exists, create it. |
| 2099 | */ |
| 2100 | expr = pattern_lookup_expr(head, ref); |
| 2101 | if (!expr) { |
| 2102 | expr = pattern_new_expr(head, ref, err); |
| 2103 | if (!expr) |
| 2104 | return 0; |
| 2105 | } |
| 2106 | |
| 2107 | /* Load reference content in expression. */ |
| 2108 | if (!pat_ref_load(ref, expr, patflags, 1, err)) |
| 2109 | return 0; |
| 2110 | |
| 2111 | return 1; |
| 2112 | } |
| 2113 | |
Thierry FOURNIER | 1794fdf | 2014-01-17 15:25:13 +0100 | [diff] [blame] | 2114 | /* This function executes a pattern match on a sample. It applies pattern <expr> |
| 2115 | * to sample <smp>. The function returns NULL if the sample dont match. It returns |
| 2116 | * non-null if the sample match. If <fill> is true and the sample match, the |
| 2117 | * function returns the matched pattern. In many cases, this pattern can be a |
| 2118 | * static buffer. |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 2119 | */ |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 2120 | 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] | 2121 | { |
Thierry FOURNIER | c5959fd | 2014-01-20 14:29:33 +0100 | [diff] [blame] | 2122 | struct pattern_expr_list *list; |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 2123 | struct pattern *pat; |
| 2124 | |
| 2125 | if (!head->match) { |
Thierry FOURNIER | 1794fdf | 2014-01-17 15:25:13 +0100 | [diff] [blame] | 2126 | if (fill) { |
Thierry FOURNIER | 5338eea | 2013-12-16 14:22:13 +0100 | [diff] [blame] | 2127 | static_pattern.smp = NULL; |
| 2128 | static_pattern.flags = 0; |
| 2129 | static_pattern.type = SMP_T_UINT; |
| 2130 | static_pattern.val.i = 1; |
Thierry FOURNIER | 1794fdf | 2014-01-17 15:25:13 +0100 | [diff] [blame] | 2131 | } |
Thierry FOURNIER | 1794fdf | 2014-01-17 15:25:13 +0100 | [diff] [blame] | 2132 | return &static_pattern; |
| 2133 | } |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 2134 | |
Thierry FOURNIER | 5d34408 | 2014-01-27 14:19:53 +0100 | [diff] [blame] | 2135 | /* convert input to string */ |
| 2136 | if (!sample_convert(smp, head->expect_type)) |
| 2137 | return NULL; |
| 2138 | |
Thierry FOURNIER | c5959fd | 2014-01-20 14:29:33 +0100 | [diff] [blame] | 2139 | list_for_each_entry(list, &head->head, list) { |
| 2140 | pat = head->match(smp, list->expr, fill); |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 2141 | if (pat) |
| 2142 | return pat; |
| 2143 | } |
| 2144 | return NULL; |
Thierry FOURNIER | ed66c29 | 2013-11-28 11:05:19 +0100 | [diff] [blame] | 2145 | } |
| 2146 | |
Thierry FOURNIER | 6f7203d | 2014-01-14 16:24:51 +0100 | [diff] [blame] | 2147 | /* This function prune the pattern expression. */ |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 2148 | void pattern_prune(struct pattern_head *head) |
Thierry FOURNIER | 6f7203d | 2014-01-14 16:24:51 +0100 | [diff] [blame] | 2149 | { |
Thierry FOURNIER | c5959fd | 2014-01-20 14:29:33 +0100 | [diff] [blame] | 2150 | struct pattern_expr_list *list, *safe; |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 2151 | |
Thierry FOURNIER | c5959fd | 2014-01-20 14:29:33 +0100 | [diff] [blame] | 2152 | list_for_each_entry_safe(list, safe, &head->head, list) { |
| 2153 | LIST_DEL(&list->list); |
| 2154 | if (list->do_free) { |
| 2155 | LIST_DEL(&list->expr->list); |
| 2156 | head->prune(list->expr); |
| 2157 | free(list->expr); |
| 2158 | } |
| 2159 | free(list); |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 2160 | } |
Thierry FOURNIER | 6f7203d | 2014-01-14 16:24:51 +0100 | [diff] [blame] | 2161 | } |
| 2162 | |
Thierry FOURNIER | 55d0b10 | 2014-01-15 11:25:26 +0100 | [diff] [blame] | 2163 | /* This function lookup for a pattern matching the <key> and return a |
| 2164 | * pointer to a pointer of the sample stoarge. If the <key> dont match, |
| 2165 | * the function returns NULL. If the key cannot be parsed, the function |
| 2166 | * fill <err>. |
| 2167 | */ |
| 2168 | struct sample_storage **pattern_find_smp(const char *key, struct pattern_expr *expr, char **err) |
| 2169 | { |
| 2170 | struct pattern pattern; |
| 2171 | |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 2172 | if (!expr->pat_head->parse(key, &pattern, err)) |
Thierry FOURNIER | 55d0b10 | 2014-01-15 11:25:26 +0100 | [diff] [blame] | 2173 | return NULL; |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 2174 | return expr->pat_head->find_smp(expr, &pattern); |
Thierry FOURNIER | 55d0b10 | 2014-01-15 11:25:26 +0100 | [diff] [blame] | 2175 | } |
| 2176 | |
Thierry FOURNIER | b113650 | 2014-01-15 11:38:49 +0100 | [diff] [blame] | 2177 | /* This function search all the pattern matching the <key> and delete it. |
| 2178 | * If the parsing of the input key fails, the function returns 0 and the |
| 2179 | * <err> is filled, else return 1; |
| 2180 | */ |
| 2181 | int pattern_delete(const char *key, struct pattern_expr *expr, char **err) |
| 2182 | { |
| 2183 | struct pattern pattern; |
| 2184 | |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 2185 | if (!expr->pat_head->parse(key, &pattern, err)) |
Thierry FOURNIER | b113650 | 2014-01-15 11:38:49 +0100 | [diff] [blame] | 2186 | return 0; |
Thierry FOURNIER | 1e00d38 | 2014-02-11 11:31:40 +0100 | [diff] [blame] | 2187 | expr->pat_head->delete(expr, &pattern); |
Thierry FOURNIER | b113650 | 2014-01-15 11:38:49 +0100 | [diff] [blame] | 2188 | return 1; |
| 2189 | } |
Thierry FOURNIER | af5a29d | 2014-03-11 14:29:22 +0100 | [diff] [blame] | 2190 | |
| 2191 | /* This function finalize the configuration parsing. Its set all the |
| 2192 | * automatic ids |
| 2193 | */ |
| 2194 | void pattern_finalize_config(void) |
| 2195 | { |
| 2196 | int i = 0; |
| 2197 | struct pat_ref *ref, *ref2, *ref3; |
| 2198 | struct list pr = LIST_HEAD_INIT(pr); |
| 2199 | |
| 2200 | list_for_each_entry(ref, &pattern_reference, list) { |
| 2201 | if (ref->unique_id == -1) { |
| 2202 | /* Look for the first free id. */ |
| 2203 | while (1) { |
| 2204 | list_for_each_entry(ref2, &pattern_reference, list) { |
| 2205 | if (ref2->unique_id == i) { |
| 2206 | i++; |
| 2207 | break; |
| 2208 | } |
| 2209 | } |
| 2210 | if (&ref2->list == &pattern_reference); |
| 2211 | break; |
| 2212 | } |
| 2213 | |
| 2214 | /* Uses the unique id and increment it for the next entry. */ |
| 2215 | ref->unique_id = i; |
| 2216 | i++; |
| 2217 | } |
| 2218 | } |
| 2219 | |
| 2220 | /* This sort the reference list by id. */ |
| 2221 | list_for_each_entry_safe(ref, ref2, &pattern_reference, list) { |
| 2222 | LIST_DEL(&ref->list); |
| 2223 | list_for_each_entry(ref3, &pr, list) { |
| 2224 | if (ref->unique_id < ref3->unique_id) { |
| 2225 | LIST_ADDQ(&ref3->list, &ref->list); |
| 2226 | break; |
| 2227 | } |
| 2228 | } |
| 2229 | if (&ref3->list == &pr) |
| 2230 | LIST_ADDQ(&pr, &ref->list); |
| 2231 | } |
| 2232 | |
| 2233 | /* swap root */ |
| 2234 | LIST_ADD(&pr, &pattern_reference); |
| 2235 | LIST_DEL(&pr); |
| 2236 | } |