Commit message (Collapse) | Author | Age | Files | Lines | |
---|---|---|---|---|---|
* | [PKT_SCHED]: improve hashing performance of cls_fw | Thomas Graf | 2005-04-24 | 1 | -4/+27 |
| | | | | | | | | | | | | | | | | | | | Calculate hashtable size to fit into a page instead of a hardcoded 256 buckets hash table. Results in a 1024 buckets hashtable on most systems. Replace old naive extract-8-lsb-bits algorithm with a better algorithm xor'ing 3 or 4 bit fields at the size of the hashtable array index in order to improve distribution if the majority of the lower bits are unused while keeping zero collision behaviour for the most common use case. Thanks to Wang Jian <lark@linux.net.cn> for bringing this issue to attention and to Eran Mann <emann@mrv.com> for the initial idea for this new algorithm. Signed-off-by: Thomas Graf <tgraf@suug.ch> Signed-off-by: David S. Miller <davem@davemloft.net> | ||||
* | Linux-2.6.12-rc2 | Linus Torvalds | 2005-04-16 | 1 | -0/+378 |
Initial git repository build. I'm not bothering with the full history, even though we have it. We can create a separate "historical" git archive of that later if we want to, and in the meantime it's about 3.2GB when imported into git - space that would just make the early git days unnecessarily complicated, when we don't have a lot of good infrastructure for it. Let it rip! |