Home » Mailing list archives » linux-kernel » 2008 » February » 28

[PATCH] fs/inode.c: use hlist_for_each_entry()

!MAILaRCHIVE_VOTE_RePLACE
Previous message: [thread] [date] [author]
Next message: [thread] [date] [author]
[view in full thread]
From: Matthias Kaehlcke <matthias@...>
To: <viro@...>, <linux-fsdevel@...>
Cc: <linux-kernel@...>, <akpm@...>
Subject: [PATCH] fs/inode.c: use hlist_for_each_entry()
Date: Thursday, February 28, 2008 - 6:11 pm

fs/inode.c: use hlist_for_each_entry() in find_inode() and
find_inode_fast()

Signed-off-by: Matthias Kaehlcke <matthias@kaehlcke.net>

--

diff --git a/fs/inode.c b/fs/inode.c
index 53245ff..ab5dfc2 100644
--- a/fs/inode.c
+++ b/fs/inode.c
@@ -495,8 +495,7 @@ static struct inode * find_inode(struct super_block * sb, struct hlist_head *hea
 	struct inode * inode = NULL;
 
 repeat:
-	hlist_for_each (node, head) { 
-		inode = hlist_entry(node, struct inode, i_hash);
+	hlist_for_each_entry (inode, node, head, i_hash) {
 		if (inode->i_sb != sb)
 			continue;
 		if (!test(inode, data))
@@ -520,8 +519,7 @@ static struct inode * find_inode_fast(struct super_block * sb, struct hlist_head
 	struct inode * inode = NULL;
 
 repeat:
-	hlist_for_each (node, head) {
-		inode = hlist_entry(node, struct inode, i_hash);
+	hlist_for_each_entry (inode, node, head, i_hash) {
 		if (inode->i_ino != ino)
 			continue;
 		if (inode->i_sb != sb)

-- 
Matthias Kaehlcke
Linux System Developer
Barcelona

     The assumption that what currently exists must necessarily
      exist is the acid that corrodes all visionary thinking
                                                                 .''`.
    using free software / Debian GNU/Linux | http://debian.org  : :'  :
                                                                `. `'`
gpg --keyserver pgp.mit.edu --recv-keys 47D8E5D4                  `-
--
Previous message: [thread] [date] [author]
Next message: [thread] [date] [author]
Messages in current thread:
[PATCH] fs/inode.c: use hlist_for_each_entry(), Matthias Kaehlcke, (Thu Feb 28, 6:11 pm)