Skip to content

K
kernel_linux

OpenHarmony / kernel_linux
上一次同步 大约 4 年

通知 14
Star 8
Fork 2
K
kernel_linux
切换分支/标签
  1. 25 9月, 2008 3 次提交
    • C
      btrfs_search_slot: reduce lock contention by cowing in two stages · 65b51a00
      由 Chris Mason 提交于 
      A btree block cow has two parts, the first is to allocate a destination
block and the second is to copy the old bock over.

The first part needs locks in the extent allocation tree, and may need to
do IO.  This changeset splits that into a separate function that can be
called without any tree locks held.

btrfs_search_slot is changed to drop its path and start over if it has
to COW a contended block.  This often means that many writers will
pre-alloc a new destination for a the same contended block, but they
cache their prealloc for later use on lower levels in the tree.
Signed-off-by: NChris Mason <chris.mason@oracle.com>
      65b51a00
    • C
      Btrfs: Start btree concurrency work. · 925baedd
      由 Chris Mason 提交于 
      The allocation trees and the chunk trees are serialized via their own
dedicated mutexes.  This means allocation location is still not very
fine grained.

The main FS btree is protected by locks on each block in the btree.  Locks
are taken top / down, and as processing finishes on a given level of the
tree, the lock is released after locking the lower level.

The end result of a search is now a path where only the lowest level
is locked.  Releasing or freeing the path drops any locks held.
Signed-off-by: NChris Mason <chris.mason@oracle.com>
      925baedd
    • C
      Btrfs: Create extent_buffer interface for large blocksizes · 5f39d397
      由 Chris Mason 提交于 
      Signed-off-by: NChris Mason <chris.mason@oracle.com>
      5f39d397
  3. 12 6月, 2007 1 次提交
  5. 23 3月, 2007 1 次提交
  7. 17 3月, 2007 1 次提交
  9. 15 3月, 2007 1 次提交
  11. 13 3月, 2007 1 次提交
  13. 24 2月, 2007 1 次提交