本文共 1820 字，大约阅读时间需要 6 分钟。

int insert_inode_locked(struct inode *inode){	struct super_block *sb = inode->i_sb;	ino_t ino = inode->i_ino;	struct hlist_head *head = inode_hashtable + hash(sb, ino);	while (1) {		struct inode *old = NULL;		spin_lock(&inode_hash_lock);		hlist_for_each_entry(old, head, i_hash) {			if (old->i_ino != ino)				continue;			if (old->i_sb != sb)				continue;			spin_lock(&old->i_lock);			if (old->i_state & (I_FREEING|I_WILL_FREE)) {				spin_unlock(&old->i_lock);				continue;			}			break;		}		if (likely(!old)) {			spin_lock(&inode->i_lock);			inode->i_state |= I_NEW;			hlist_add_head(&inode->i_hash, head);			spin_unlock(&inode->i_lock);			spin_unlock(&inode_hash_lock);			return 0;		}		__iget(old);		spin_unlock(&old->i_lock);		spin_unlock(&inode_hash_lock);		wait_on_inode(old);		if (unlikely(!inode_unhashed(old))) {			iput(old);			return -EBUSY;		}		iput(old);	}}

int insert_inode_locked4(struct inode *inode, unsigned long hashval,		int (*test)(struct inode *, void *), void *data){	struct super_block *sb = inode->i_sb;	struct hlist_head *head = inode_hashtable + hash(sb, hashval);	while (1) {		struct inode *old = NULL;		spin_lock(&inode_hash_lock);		hlist_for_each_entry(old, head, i_hash) {			if (old->i_sb != sb)				continue;			if (!test(old, data))				continue;			spin_lock(&old->i_lock);			if (old->i_state & (I_FREEING|I_WILL_FREE)) {				spin_unlock(&old->i_lock);				continue;			}			break;		}		if (likely(!old)) {			spin_lock(&inode->i_lock);			inode->i_state |= I_NEW;			hlist_add_head(&inode->i_hash, head);			spin_unlock(&inode->i_lock);			spin_unlock(&inode_hash_lock);			return 0;		}		__iget(old);		spin_unlock(&old->i_lock);		spin_unlock(&inode_hash_lock);		wait_on_inode(old);		if (unlikely(!inode_unhashed(old))) {			iput(old);			return -EBUSY;		}		iput(old);	}}EXPORT_SYMBOL(insert_inode_locked4);

转载地址：http://dwhti.baihongyu.com/