Date: Mon, 11 May 1998 18:37:29 -0700 From: Jason Thorpe <thorpej@nas.nasa.gov> To: Julian Assange <proff@iq.org> Cc: "Justin T. Gibbs" <gibbs@plutotech.com>, gibbs@FreeBSD.ORG, hackers@FreeBSD.ORG, dyson@FreeBSD.ORG, mrg@eterna.com.au, mckusick@mckusick.com Subject: Re: more queue.h brokenness Message-ID: <199805120137.SAA02585@lestat.nas.nasa.gov>
next in thread | raw e-mail | index | archive | help
On 12 May 1998 11:31:57 +1000 Julian Assange <proff@iq.org> wrote: > End of list detection is also more complex. More complex from a coder's standpoint, but not necessarily more expensive. It's still a single comparison, it's just that you're not comparing against NULL. > Speaking of circle queues, isn't this is an infinite loop? > > #define CIRCLEQ_FOREACH(var, head, field) \ > for((var) = (head)->cqh_first; (var); (var) = (var)->field.cqe_next) Sure looks like it to me. Jason R. Thorpe thorpej@nas.nasa.gov NASA Ames Research Center Home: +1 408 866 1912 NAS: M/S 258-5 Work: +1 650 604 0935 Moffett Field, CA 94035 Pager: +1 650 428 6939 To Unsubscribe: send mail to majordomo@FreeBSD.org with "unsubscribe freebsd-hackers" in the body of the message
Want to link to this message? Use this URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?199805120137.SAA02585>