hollalinux
/
linux-sg2042
mirror of https://github.com/sophgo/linux-riscv.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

list.h: new helper - hlist_add_fake() 

Make node look as if it was on hlist, with hlist_del()
working correctly.  Usable without any locking...

Convert a couple of places where we want to do that to
inode->i_hash.

Signed-off-by: Al Viro <viro@zeniv.linux.org.uk>
This commit is contained in:
Al Viro 2010-10-23 15:23:40 -04:00
parent 1d3382cbf0
commit 756acc2d61
3 changed files with 8 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
fs/hfsplus/inode.c
View File

@ -211,7 +211,7 @@ static struct dentry *hfsplus_file_lookup(struct inode *dir, struct dentry *dent
* appear hashed, but do not put on any lists. hlist_del() * appear hashed, but do not put on any lists. hlist_del()
* will work fine and require no locking. * will work fine and require no locking.
*/ */
inode->i_hash.pprev = &inode->i_hash.next; hlist_add_fake(&inode->i_hash);
mark_inode_dirty(inode); mark_inode_dirty(inode);
out: out:

2
fs/jfs/jfs_imap.c
View File

@ -497,7 +497,7 @@ struct inode *diReadSpecial(struct super_block *sb, ino_t inum, int secondary)
* appear hashed, but do not put on any lists. hlist_del() * appear hashed, but do not put on any lists. hlist_del()
* will work fine and require no locking. * will work fine and require no locking.
*/ */
ip->i_hash.pprev = &ip->i_hash.next; hlist_add_fake(&ip->i_hash);
return (ip); return (ip);
} }

6
include/linux/list.h
View File

@ -636,6 +636,12 @@ static inline void hlist_add_after(struct hlist_node *n,
next->next->pprev = &next->next; next->next->pprev = &next->next;
} }
/* after that we'll appear to be on some hlist and hlist_del will work */
static inline void hlist_add_fake(struct hlist_node *n)
{
n->pprev = &n->next;
}
/* /*
* Move a list from one list head to another. Fixup the pprev * Move a list from one list head to another. Fixup the pprev
* reference of the first entry if it exists. * reference of the first entry if it exists.