Willy Tarreau 78777ead32 MEDIUM: pattern: change the pat_del_* functions to delete from the references ... This is the next step in speeding up entry removal. Now we don't scan the whole lists or trees for elements pointing to the target reference, instead we start from the reference and delete all linked patterns. This simplifies some delete functions since we don't need anymore to delete multiple times from an expression since all nodes appear after the reference element. We can now have one generic list and one generic tree deletion function. This required the replacement of pattern_delete() with an open-coded version since we now need to lock all expressions first before proceeding. This means there is a high risk of lock inversion here but given that the expressions are always scanned in the same order from the same head, this must not happen. Now deleting first entries is instantaneous, and it's still slow to delete the last ones when looking up their ID since it still requires to look them up by a full scan, but it's already way faster than previously. Typically removing the last 10 IP from a 20M entries ACL with a full-scan each took less than 2 seconds. It would be technically possible to make use of indexed entries to speed up most lookups for removal by value (e.g. IP addresses) but that's for later.		2020-11-05 19:27:09 +01:00
..
haproxy	MEDIUM: pattern: change the pat_del_* functions to delete from the references	2020-11-05 19:27:09 +01:00
import	MINOR: ist: Add istend() function to return a pointer to the end of the string	2020-11-05 19:25:12 +01:00