This series gives additional refactoring and tweaks on the btree code.
The "nilfs2: optimize calculation of min/max number of btree node
children" and "nilfs2: reduce repetitive calculation of max number of
child nodes" and "nilfs2: get maximum number of child nodes from bmap
object" reduce repetitive calculation on maximum number of child
nodes, and revise parameter passing in low level routines of the btree
code. Other two changes are for cleanups.
I'm now reviewing the btree code, and this is a by-product of the
work.
Ryusuke Konishi
--
Ryusuke Konishi (5):
nilfs2: remove redundant pointer checks in bmap lookup functions
nilfs2: optimize calculation of min/max number of btree node children
nilfs2: reduce repetitive calculation of max number of child nodes
nilfs2: get maximum number of child nodes from bmap object
nilfs2: eliminate inline keywords in btree implementation
fs/nilfs2/bmap.h | 2 +
fs/nilfs2/btree.c | 412 +++++++++++++++++++++++++++-------------------------
fs/nilfs2/direct.c | 3 +-
3 files changed, 220 insertions(+), 197 deletions(-)
--
To unsubscribe from this list: send the line "unsubscribe linux-nilfs" in
the body of a message to majord...@vger.kernel.org
More majordomo info at http://vger.kernel.org/majordomo-info.html
