.\" This manpage has been automatically generated by docbook2man 
.\" from a DocBook document.  This tool can be found at:
.\" <http://shell.ipoline.com/~elmert/comp/docbook2X/> 
.\" Please send any bug reports, improvements, comments, patches, 
.\" etc. to Steve Cheng <steve@ggi-project.org>.
.TH "D_LOOKUP" "9" "09 October 2005" "" ""

.SH NAME
d_lookup \- search for a dentry
.SH SYNOPSIS
"SYNOPSIS"
.sp
\fB
.sp
struct dentry * d_lookup  (struct dentry * \fIparent\fB, struct qstr * \fIname\fB);
\fR
.SH "ARGUMENTS"
.TP
\fB\fIparent\fB\fR
parent dentry
.TP
\fB\fIname\fB\fR
qstr of name we wish to find
.SH "DESCRIPTION"
.PP
Searches the children of the parent dentry for the name in question. If
the dentry is found its reference count is incremented and the dentry
is returned. The caller must use d_put to free the entry when it has
finished using it. NULL is returned on failure.
.PP
__d_lookup is dcache_lock free. The hash list is protected using RCU.
Memory barriers are used while updating and doing lockless traversal. 
To avoid races with d_move while rename is happening, d_lock is used.
.PP
Overflows in \fBmemcmp\fR, while d_move, are avoided by keeping the length
and name pointer in one structure pointed by d_qstr.
.PP
\fBrcu_read_lock\fR and \fBrcu_read_unlock\fR are used to disable preemption while
lookup is going on.
.PP
dentry_unused list is not updated even if lookup finds the required dentry
in there. It is updated in places such as prune_dcache, shrink_dcache_sb,
select_parent and __dget_locked. This laziness saves lookup from dcache_lock
acquisition.
.PP
\fBd_lookup\fR is protected against the concurrent renames in some unrelated
directory using the seqlockt_t rename_lock.