projects / dragonfly.git / commit
? search:
summary | shortlog | log | commit | commitdiff | tree
(parent: 488d97f) | patch
sys/vfs/hammer: make btree_search() climb up btree slightly faster
authorTomohiro Kusumi <kusumi.tomohiro@gmail.com>
Thu, 8 Jan 2015 15:13:59 +0000 (00:13 +0900)
committerAntonio Huete Jimenez <tuxillo@quantumachine.net>
Tue, 20 Jan 2015 15:28:32 +0000 (16:28 +0100)
commita9fd59b8032d8b40869dd1ff92c0b44dff59ed87
tree2e1b20253f47ce2cde19bb6d553a8e05624f1b66tree | snapshot
parent488d97f5ed5638d35fd872dc63eda9be84a9c9b6commit | diff
sys/vfs/hammer: make btree_search() climb up btree slightly faster

- This cleanup patch lets cursor climb up deep/fat btree slightly faster
  (lightweight), if not slower.
- Remove a duplicate check that traces back to a moment where there was
  btree_node_is_almost_full() and the differentiation was needed.

Closes: #2765
sys/vfs/hammer/hammer_btree.c diff | blob | blame | history
DragonFly Project Source