.\"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 "__LIST_FOR_EACH" 9 "August 2005" "Kernel Hackers Manual" "LINUX"
.SH NAME
__list_for_each \- iterate over a list
.SH "SYNOPSIS"
.ad l
.hy 0
.HP 18
\fB__list_for_each\ \fR\ (\fIpos\fR, \fIhead\fR);
.ad
.hy

.SH "ARGUMENTS"

.TP
\fIpos\fR
the &struct list_head to use as a loop counter\&.

.TP
\fIhead\fR
the head for your list\&.

.SH "DESCRIPTION"

.PP
This variant differs from \fBlist_for_each\fR in that it's the simplest possible list iteration code, no prefetching is done\&. Use this for code that knows the list to be very short (empty or 1 entry) most of the time\&.