.\"Generated by db2man.xsl. Don't modify this, modify the source.
.de Sh \" Subsection
.br
.if t .Sp
.ne 5
.PP
\fB\\$1\fR
.PP
..
.de Sp \" Vertical space (when we can't use .PP)
.if t .sp .5v
.if n .sp
..
.de Ip \" List item
.br
.ie \\n(.$>=3 .ne \\$3
.el .ne 3
.IP "\\$1" \\$2
..
.TH "__D_DROP" 9 "August 2005" "Kernel Hackers Manual" "LINUX"
.SH NAME
__d_drop \- drop a dentry
.SH "SYNOPSIS"
.ad l
.hy 0
.HP 17
void\ \fB__d_drop\ \fR\ (struct\ dentry\ *\ \fIdentry\fR);
.ad
.hy

.SH "ARGUMENTS"

.TP
\fIdentry\fR
dentry to drop

.SH "DESCRIPTION"

.PP
 \fBd_drop\fR unhashes the entry from the parent dentry hashes, so that it won't be found through a VFS lookup any more\&. Note that this is different from deleting the dentry \- d_delete will try to mark the dentry negative if possible, giving a successful _negative_ lookup, while d_drop will just make the cache lookup fail\&.

.PP
 \fBd_drop\fR is used mainly for stuff that wants to invalidate a dentry for some reason (NFS timeouts or autofs deletes)\&.

.PP
__d_drop requires dentry\->d_lock\&.