Willy Tarreau f3045d2a06 MAJOR: pattern: add LRU-based cache on pattern matching ... The principle of this cache is to have a global cache for all pattern matching operations which rely on lists (reg, sub, dir, dom, ...). The input data, the expression and a random seed are used as a hashing key. The cached entries contains a pointer to the expression and a revision number for that expression so that we don't accidently used obsolete data after a pattern update or a very unlikely hash collision. Regarding the risk of collisions, 10k entries at 10k req/s mean 1% risk of a collision after 60 years, that's already much less than the memory's reliability in most machines and more durable than most admin's life expectancy. A collision will result in a valid result to be returned for a different entry from the same list. If this is not acceptable, the cache can be disabled using tune.pattern.cache-size. A test on a file containing 10k small regex showed that the regex matching was limited to 6k/s instead of 70k with regular strings. When enabling the LRU cache, the performance was back to 70k/s.		2015-04-29 19:15:24 +02:00
..
common	MAJOR: pattern: add LRU-based cache on pattern matching	2015-04-29 19:15:24 +02:00
import	IMPORT: hash: import xxhash-r39	2015-04-29 19:15:21 +02:00
proto	MINOR: stream-int: add two flags to indicate an applet's wishes regarding I/O	2015-04-23 17:56:17 +02:00
types	MAJOR: pattern: add LRU-based cache on pattern matching	2015-04-29 19:15:24 +02:00