1. 03 12月, 2006 1 次提交
  2. 23 9月, 2006 1 次提交
  3. 22 7月, 2006 1 次提交
  4. 01 7月, 2006 1 次提交
  5. 09 11月, 2005 1 次提交
  6. 25 4月, 2005 1 次提交
    • T
      [PKT_SCHED]: improve hashing performance of cls_fw · c5c13faf
      Thomas Graf 提交于
      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: NThomas Graf <tgraf@suug.ch>
      Signed-off-by: NDavid S. Miller <davem@davemloft.net>
      c5c13faf
  7. 17 4月, 2005 1 次提交
    • L
      Linux-2.6.12-rc2 · 1da177e4
      Linus Torvalds 提交于
      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!
      1da177e4