.\" 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 "_DEVFS_DESCEND" "" "06 October 2005" "" ""

.SH NAME
_devfs_descend \- Descend down a tree using the next component name.
.SH SYNOPSIS
"SYNOPSIS"
.sp
\fB
.sp
struct devfs_entry * _devfs_descend  (struct devfs_entry * \fIdir\fB, const char * \fIname\fB, int \fInamelen\fB, int * \fInext_pos\fB);
\fR
.SH "ARGUMENTS"
.TP
\fB\fIdir\fB\fR
The directory to search.
.TP
\fB\fIname\fB\fR
The component name to search for.
.TP
\fB\fInamelen\fB\fR
The length of name\&.
.TP
\fB\fInext_pos\fB\fR
The position of the next '/' or '\\0' is written here.
.SH "DESCRIPTION"
.PP
Descend into a directory, searching for a component. This function forms
the core of a tree-walking algorithm. The directory will be locked.
The devfs entry corresponding to the component is returned. If there is
no matching entry, NULL is returned.
An implicit \fBdevfs_get\fR is performed on the returned entry.