Archive-Team
/
zfs
2
0
Fork 0
Code Issues Pull Requests Packages Projects Releases 103 Wiki Activity

Fix typo in btree.c 

Reviewed-by: George Melikov <mail@gmelikov.ru>
Reviewed-by: Brian Behlendorf <behlendorf1@llnl.gov>
Reviewed-by: Matthew Ahrens <mahrens@delphix.com>
Signed-off-by: Serapheim Dimitropoulos <serapheim@delphix.com>
Closes #10725
This commit is contained in:
Serapheim Dimitropoulos 2020-08-17 15:25:37 -07:00 committed by GitHub
parent 5f1984f2f8
commit b0099072df
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
module/zfs/btree.c
View File

@ -1465,7 +1465,7 @@ zfs_btree_remove_from_node(zfs_btree_t *tree, zfs_btree_core_t *node,
/* /*
* In this case, neither of our neighbors can spare an element, so we * In this case, neither of our neighbors can spare an element, so we
* need to merge with one of them. We prefer the left one, * need to merge with one of them. We prefer the left one,
* arabitrarily. Move the separator into the leftmost merging node * arbitrarily. Move the separator into the leftmost merging node
* (which may be us or the left neighbor), and then move the right * (which may be us or the left neighbor), and then move the right
* merging node's elements. Once that's done, we go back and delete * merging node's elements. Once that's done, we go back and delete
* the element we're removing. Finally, go into the parent and delete * the element we're removing. Finally, go into the parent and delete
@ -1707,7 +1707,7 @@ zfs_btree_remove_idx(zfs_btree_t *tree, zfs_btree_index_t *where)
/* /*
* In this case, neither of our neighbors can spare an element, so we * In this case, neither of our neighbors can spare an element, so we
* need to merge with one of them. We prefer the left one, * need to merge with one of them. We prefer the left one,
* arabitrarily. Move the separator into the leftmost merging node * arbitrarily. Move the separator into the leftmost merging node
* (which may be us or the left neighbor), and then move the right * (which may be us or the left neighbor), and then move the right
* merging node's elements. Once that's done, we go back and delete * merging node's elements. Once that's done, we go back and delete
* the element we're removing. Finally, go into the parent and delete * the element we're removing. Finally, go into the parent and delete