1. 08 11月, 2005 1 次提交
  2. 08 9月, 2005 1 次提交
    • E
      [PATCH] struct dentry: place d_hash close to d_parent and d_name to speedup lookups · 3f4bb1f4
      Eric Dumazet 提交于
      dentry cache uses sophisticated RCU technology (and prefetching if
      available) but touches 2 cache lines per dentry during hlist lookup.
      
      This patch moves d_hash in the same cache line than d_parent and d_name
      fields so that :
      
      1) One cache line is needed instead of two.
      
      2) the hlist_for_each_rcu() prefetching has a chance to bring all the
         needed data in advance, not only the part that includes d_hash.next.
      
      I also changed one old comment that was wrong for 64bits.
      
      A further optimisation would be to separate dentry in two parts, one that
      is mostly read, and one writen (d_count/d_lock) to avoid false sharing on
      SMP/NUMA but this would need different field placement depending on 32bits
      or 64bits platform.
      Signed-off-by: NEric Dumazet <dada1@cosmosbay.com>
      Signed-off-by: NAndrew Morton <akpm@osdl.org>
      Signed-off-by: NLinus Torvalds <torvalds@osdl.org>
      3f4bb1f4
  3. 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