diff options
author | Mark Fasheh <mark.fasheh@oracle.com> | 2007-01-17 15:31:35 -0500 |
---|---|---|
committer | Mark Fasheh <mark.fasheh@oracle.com> | 2007-04-26 18:01:31 -0400 |
commit | 363041a5f74b953ab6b705ac9c88e5eda218a24b (patch) | |
tree | c0661c3f88978f2049693682f1cb94b20a8454c0 /fs/ocfs2/alloc.c | |
parent | dcd0538ff4e854fa9d7f4630b359ca8fdb5cb5a8 (diff) |
ocfs2: temporarily remove extent map caching
The code in extent_map.c is not prepared to deal with a subtree being
rotated between lookups. This can happen when filling holes in sparse files.
Instead of a lengthy patch to update the code (which would likely lose the
benefit of caching subtree roots), we remove most of the algorithms and
implement a simple path based lookup. A less ambitious extent caching scheme
will be added in a later patch.
Signed-off-by: Mark Fasheh <mark.fasheh@oracle.com>
Diffstat (limited to 'fs/ocfs2/alloc.c')
-rw-r--r-- | fs/ocfs2/alloc.c | 5 |
1 files changed, 2 insertions, 3 deletions
diff --git a/fs/ocfs2/alloc.c b/fs/ocfs2/alloc.c index a96696867576..85a05f120249 100644 --- a/fs/ocfs2/alloc.c +++ b/fs/ocfs2/alloc.c | |||
@@ -1146,9 +1146,8 @@ static void find_leaf_ins(void *data, struct buffer_head *bh) | |||
1146 | * | 1146 | * |
1147 | * This function doesn't handle non btree extent lists. | 1147 | * This function doesn't handle non btree extent lists. |
1148 | */ | 1148 | */ |
1149 | static int ocfs2_find_leaf(struct inode *inode, | 1149 | int ocfs2_find_leaf(struct inode *inode, struct ocfs2_extent_list *root_el, |
1150 | struct ocfs2_extent_list *root_el, u32 cpos, | 1150 | u32 cpos, struct buffer_head **leaf_bh) |
1151 | struct buffer_head **leaf_bh) | ||
1152 | { | 1151 | { |
1153 | int ret; | 1152 | int ret; |
1154 | struct buffer_head *bh = NULL; | 1153 | struct buffer_head *bh = NULL; |