lists.openwall.net | lists / announce owl-users owl-dev john-users john-dev passwdqc-users yescrypt popa3d-users / oss-security kernel-hardening musl sabotage tlsify passwords / crypt-dev xvendor / Bugtraq Full-Disclosure linux-kernel linux-netdev linux-ext4 linux-hardening PHC | |
Open Source and information security mailing list archives
| ||
|
Date: Mon, 19 Feb 2007 17:04:00 +0300 From: Evgeniy Polyakov <johnpol@....mipt.ru> To: Eric Dumazet <dada1@...mosbay.com> Cc: akepner@....com, linux@...izon.com, davem@...emloft.net, netdev@...r.kernel.org, bcrl@...ux.intel.com Subject: Re: Extensible hashing and RCU Actually for socket code any other binary tree will work perfectly ok - socket code does not have wildcards (except listening sockets), so it is possible to combine all values into one search key used in flat one-dimensional tree - it scales as hell and allows still very high lookup time. As of cache usage - such trees can be combined with different protocols to increase cache locality. The only reason I implemented trie is that netchannels support wildcards, that is how netfilter is implemented on top of them. Tree with lazy deletion (i.e. without deletion at all) can be moved to RCU very easily. -- Evgeniy Polyakov - To unsubscribe from this list: send the line "unsubscribe netdev" in the body of a message to majordomo@...r.kernel.org More majordomo info at http://vger.kernel.org/majordomo-info.html
Powered by blists - more mailing lists