Skip to content
Projects
Groups
Snippets
Help
Loading...
Help
Support
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in / Register
Toggle navigation
L
linux
Project overview
Project overview
Details
Activity
Releases
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Issues
0
Issues
0
List
Boards
Labels
Milestones
Merge Requests
0
Merge Requests
0
Analytics
Analytics
Repository
Value Stream
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Create a new issue
Commits
Issue Boards
Open sidebar
Kirill Smelkov
linux
Commits
168fd7d2
Commit
168fd7d2
authored
Jun 25, 2008
by
Chris Mason
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Fix btrfs_next_leaf to check for new items after dropping locks
Signed-off-by:
Chris Mason
<
chris.mason@oracle.com
>
parent
594a24eb
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
7 additions
and
0 deletions
+7
-0
fs/btrfs/ctree.c
fs/btrfs/ctree.c
+7
-0
No files found.
fs/btrfs/ctree.c
View file @
168fd7d2
...
@@ -2999,7 +2999,14 @@ int btrfs_next_leaf(struct btrfs_root *root, struct btrfs_path *path)
...
@@ -2999,7 +2999,14 @@ int btrfs_next_leaf(struct btrfs_root *root, struct btrfs_path *path)
return
ret
;
return
ret
;
nritems
=
btrfs_header_nritems
(
path
->
nodes
[
0
]);
nritems
=
btrfs_header_nritems
(
path
->
nodes
[
0
]);
/*
* by releasing the path above we dropped all our locks. A balance
* could have added more items next to the key that used to be
* at the very end of the block. So, check again here and
* advance the path if there are now more items available.
*/
if
(
nritems
>
0
&&
path
->
slots
[
0
]
<
nritems
-
1
)
{
if
(
nritems
>
0
&&
path
->
slots
[
0
]
<
nritems
-
1
)
{
path
->
slots
[
0
]
++
;
goto
done
;
goto
done
;
}
}
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment