mirror of
https://github.com/opnsense/src.git
synced 2026-05-25 02:35:01 -04:00
3a96a25da8
Current data structure is using a hash of unordered lists. Those unordered lists are quite efficient, because the least recently inserted entries are most likely to be used again. In order to avoid long search times in other cases, the lists are hashed into many buckets. Unfortunatly a search for a miss needs an exhaustive inspection and a careful definition of the hash. Splay trees offer a similar feature - almost O(1) for access of the least recently used entries), and amortized O(ln(n) - for almost all other cases. Get rid of the hash. Now the data structure should able to quickly react to external packets without eating CPU cycles for breakfast, preventing a DoS. PR: 192888 Discussed with: Dimitry Luhtionov Differential Revision: https://reviews.freebsd.org/D30516 Differential Revision: https://reviews.freebsd.org/D30536 Differential Revision: https://reviews.freebsd.org/D30844 (cherry picked from commit |
||
|---|---|---|
| .. | ||
| alias.c | ||
| alias.h | ||
| alias_db.c | ||
| alias_db.h | ||
| alias_dummy.c | ||
| alias_ftp.c | ||
| alias_irc.c | ||
| alias_local.h | ||
| alias_mod.c | ||
| alias_mod.h | ||
| alias_nbt.c | ||
| alias_pptp.c | ||
| alias_proxy.c | ||
| alias_sctp.c | ||
| alias_sctp.h | ||
| alias_skinny.c | ||
| alias_smedia.c | ||
| alias_util.c | ||
| HISTORY | ||
| libalias.3 | ||