Skip to content

R
raspberrypi-kernel

openeuler / raspberrypi-kernel

通知 13
Star 1
Fork 0
R
raspberrypi-kernel
切换分支/标签
  1. 18 3月, 2011 1 次提交
  3. 30 10月, 2010 1 次提交
  5. 18 12月, 2009 1 次提交
  7. 22 9月, 2009 1 次提交
    • Y
      Btrfs: change how subvolumes are organized · 4df27c4d
      由 Yan, Zheng 提交于 
      btrfs allows subvolumes and snapshots anywhere in the directory tree.
If we snapshot a subvolume that contains a link to other subvolume
called subvolA, subvolA can be accessed through both the original
subvolume and the snapshot. This is similar to creating hard link to
directory, and has the very similar problems.

The aim of this patch is enforcing there is only one access point to
each subvolume. Only the first directory entry (the one added when
the subvolume/snapshot was created) is treated as valid access point.
The first directory entry is distinguished by checking root forward
reference. If the corresponding root forward reference is missing,
we know the entry is not the first one.

This patch also adds snapshot/subvolume rename support, the code
allows rename subvolume link across subvolumes.
Signed-off-by: NYan Zheng <zheng.yan@oracle.com>
Signed-off-by: NChris Mason <chris.mason@oracle.com>
      4df27c4d
  9. 25 3月, 2009 1 次提交
    • C
      Btrfs: leave btree locks spinning more often · b9473439
      由 Chris Mason 提交于 
      btrfs_mark_buffer dirty would set dirty bits in the extent_io tree
for the buffers it was dirtying.  This may require a kmalloc and it
was not atomic.  So, anyone who called btrfs_mark_buffer_dirty had to
set any btree locks they were holding to blocking first.

This commit changes dirty tracking for extent buffers to just use a flag
in the extent buffer.  Now that we have one and only one extent buffer
per page, this can be safely done without losing dirty bits along the way.

This also introduces a path->leave_spinning flag that callers of
btrfs_search_slot can use to indicate they will properly deal with a
path returned where all the locks are spinning instead of blocking.

Many of the btree search callers now expect spinning paths,
resulting in better btree concurrency overall.
Signed-off-by: NChris Mason <chris.mason@oracle.com>
      b9473439
  11. 06 1月, 2009 1 次提交
  13. 30 9月, 2008 1 次提交
    • C
      Btrfs: add and improve comments · d352ac68
      由 Chris Mason 提交于 
      This improves the comments at the top of many functions.  It didn't
dive into the guts of functions because I was trying to
avoid merging problems with the new allocator and back reference work.

extent-tree.c and volumes.c were both skipped, and there is definitely
more work todo in cleaning and commenting the code.
Signed-off-by: NChris Mason <chris.mason@oracle.com>
      d352ac68
  15. 25 9月, 2008 8 次提交
  17. 11 7月, 2007 1 次提交
  19. 23 6月, 2007 1 次提交
  21. 14 6月, 2007 1 次提交
    • A
      btrfs: Code cleanup · f1ace244
      由 Aneesh 提交于 
      Attaching below is some of the code cleanups that i came across while
reading the code.

a) alloc_path already calls init_path.
b) Mention that btrfs_inode is the in memory copy.Ext4 have ext4_inode_info as
the in memory copy ext4_inode as the disk copy
Signed-off-by: NChris Mason <chris.mason@oracle.com>
      f1ace244
  23. 12 6月, 2007 1 次提交
  25. 24 5月, 2007 1 次提交
  27. 03 5月, 2007 1 次提交
  29. 20 4月, 2007 1 次提交
  31. 19 4月, 2007 1 次提交
  33. 18 4月, 2007 1 次提交
  35. 10 4月, 2007 1 次提交
  37. 07 4月, 2007 1 次提交
  39. 06 4月, 2007 2 次提交
  41. 05 4月, 2007 2 次提交
  43. 02 4月, 2007 1 次提交
  45. 31 3月, 2007 1 次提交
  47. 30 3月, 2007 1 次提交
  49. 24 3月, 2007 1 次提交
  51. 23 3月, 2007 2 次提交
  53. 21 3月, 2007 1 次提交
  55. 17 3月, 2007 1 次提交
  57. 16 3月, 2007 2 次提交