[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Message-Id: <1485184655-3895-2-git-send-email-konishi.ryusuke@lab.ntt.co.jp>
Date: Tue, 24 Jan 2017 00:17:34 +0900
From: Ryusuke Konishi <konishi.ryusuke@....ntt.co.jp>
To: Andrew Morton <akpm@...ux-foundation.org>
Cc: LKML <linux-kernel@...r.kernel.org>,
linux-nilfs <linux-nilfs@...r.kernel.org>,
Geliang Tang <geliangtang@...il.com>,
Ryusuke Konishi <konishi.ryusuke@....ntt.co.jp>
Subject: [PATCH -mm 1/2] nilfs2: use nilfs_btree_node_size()
From: Geliang Tang <geliangtang@...il.com>
Use nilfs_btree_node_size() instead of open-coding.
Signed-off-by: Geliang Tang <geliangtang@...il.com>
Signed-off-by: Ryusuke Konishi <konishi.ryusuke@....ntt.co.jp>
---
fs/nilfs2/btree.c | 2 +-
1 file changed, 1 insertion(+), 1 deletion(-)
diff --git a/fs/nilfs2/btree.c b/fs/nilfs2/btree.c
index 2e315f9..9c7ea17 100644
--- a/fs/nilfs2/btree.c
+++ b/fs/nilfs2/btree.c
@@ -1870,7 +1870,7 @@ int nilfs_btree_convert_and_insert(struct nilfs_bmap *btree,
di = &dreq;
ni = NULL;
} else if ((n + 1) <= NILFS_BTREE_NODE_NCHILDREN_MAX(
- 1 << btree->b_inode->i_blkbits)) {
+ nilfs_btree_node_size(btree))) {
di = &dreq;
ni = &nreq;
} else {
--
1.8.3.1
Powered by blists - more mailing lists