555 		parent = dentry->d_parent;  in __dentry_kill()
603 	parent = READ_ONCE(dentry->d_parent);  in __lock_parent()
613 	if (unlikely(parent != dentry->d_parent)) {  in __lock_parent()
627 	struct dentry *parent = dentry->d_parent;  in lock_parent()
693 		parent = dentry->d_parent;  in dentry_kill()
933 	ret = READ_ONCE(dentry->d_parent);  in dget_parent()
948 	ret = dentry->d_parent;  in dget_parent()
950 	if (unlikely(ret != dentry->d_parent)) {  in dget_parent()
1096 	parent = dentry->d_parent;  in shrink_lock_dentry()
1102 	if (unlikely(parent != dentry->d_parent)) {  in shrink_lock_dentry()
1138 		parent = dentry->d_parent;  in shrink_dentry_list()
1357 		this_parent = child->d_parent;  in d_walk()
1446 	for (p = dentry->d_parent; !IS_ROOT(p); p = p->d_parent) {  in d_set_mounted()
1585 				parent = data.victim->d_parent;  in shrink_dcache_parent()
1751 	dentry->d_parent = dentry;  in __d_alloc()
1797 	dentry->d_parent = parent;  in d_alloc()
1816 		dentry->d_parent = dget(parent);  in d_alloc_cursor()
2161 	found = d_hash_and_lookup(dentry->d_parent, name);  in d_add_ci()
2167 		found = d_alloc_parallel(dentry->d_parent, name,  in d_add_ci()
2174 		found = d_alloc(dentry->d_parent, name);  in d_add_ci()
2285 		if (dentry->d_parent != parent)  in __d_lookup_rcu()
2394 		if (dentry->d_parent != parent)  in __d_lookup()
2592 		if (dentry->d_parent != parent)  in d_alloc_parallel()
2618 		if (unlikely(dentry->d_parent != parent))  in d_alloc_parallel()
2645 	struct hlist_bl_head *b = in_lookup_hash(dentry->d_parent,  in __d_lookup_done()
2666 		dir = dentry->d_parent->d_inode;  in __d_add()
2730 		if (alias->d_parent != entry->d_parent)  in d_exact_alias()
2732 		if (!d_same_name(alias, entry->d_parent, &entry->d_name))  in d_exact_alias()
2835 	old_parent = dentry->d_parent;  in __d_move()
2839 		spin_lock(&target->d_parent->d_lock);  in __d_move()
2842 		spin_lock(&target->d_parent->d_lock);  in __d_move()
2848 			spin_lock_nested(&target->d_parent->d_lock,  in __d_move()
2855 		dir = target->d_parent->d_inode;  in __d_move()
2870 	dentry->d_parent = target->d_parent;  in __d_move()
2874 		dentry->d_parent->d_lockref.count++;  in __d_move()
2878 		target->d_parent = old_parent;  in __d_move()
2880 		list_move(&target->d_child, &target->d_parent->d_subdirs);  in __d_move()
2884 	list_move(&dentry->d_child, &dentry->d_parent->d_subdirs);  in __d_move()
2895 	if (dentry->d_parent != old_parent)  in __d_move()
2896 		spin_unlock(&dentry->d_parent->d_lock);  in __d_move()
2951 	for (p = p2; !IS_ROOT(p); p = p->d_parent) {  in d_ancestor()
2952 		if (p->d_parent == p1)  in d_ancestor()
2975 	if (alias->d_parent == dentry->d_parent)  in __d_unalias()
2982 	if (!inode_trylock_shared(alias->d_parent->d_inode))  in __d_unalias()
2984 	m2 = &alias->d_parent->d_inode->i_rwsem;  in __d_unalias()
3048 				struct dentry *old_parent = dget(new->d_parent);  in d_splice_alias()
3141 	spin_lock(&dentry->d_parent->d_lock);  in d_tmpfile()
3146 	spin_unlock(&dentry->d_parent->d_lock);  in d_tmpfile()