Skip to content
Permalink
Browse files

Reduce min size by 1, simplify merge and split logic

Signed-off-by: Paul Dagnelie <pcd@delphix.com>
  • Loading branch information...
pcd1193182 committed Sep 23, 2019
1 parent 7224043 commit f5fdfdabc549cabbe8c590c8334b3d891551dff6
Showing with 223 additions and 294 deletions.
  1. +4 −4 include/sys/btree.h
  2. +219 −290 module/zfs/btree.c
@@ -51,10 +51,10 @@ extern "C" {
* of node it is in.
*
* The tree's height is the same throughout, unlike many other forms of search
* tree. Each node (except for the root) must be between 50% and 100% full of
* elements (and children) at all times. Any operation that would put the node
* outside of that range results in a rebalancing operation (stealing,
* merging, or splitting).
* tree. Each node (except for the root) must be between half minus one and
* completely full of elements (and children) at all times. Any operation that
* would put the node outside of that range results in a rebalancing operation
* (taking, merging, or splitting).
*
* This tree was implemented using descriptions from Wikipedia's articles on
* B-Trees and B+ Trees.

0 comments on commit f5fdfda

Please sign in to comment.
You can’t perform that action at this time.