From owner-freebsd-arch@FreeBSD.ORG Tue May 8 19:48:23 2007 Return-Path: X-Original-To: freebsd-arch@freebsd.org Delivered-To: freebsd-arch@freebsd.org Received: from mx1.freebsd.org (mx1.freebsd.org [69.147.83.52]) by hub.freebsd.org (Postfix) with ESMTP id 8CF1D16A407 for ; Tue, 8 May 2007 19:48:23 +0000 (UTC) (envelope-from julian@elischer.org) Received: from outS.internet-mail-service.net (outS.internet-mail-service.net [216.240.47.242]) by mx1.freebsd.org (Postfix) with ESMTP id 7A3BF13C459 for ; Tue, 8 May 2007 19:48:23 +0000 (UTC) (envelope-from julian@elischer.org) Received: from mx0.idiom.com (HELO idiom.com) (216.240.32.160) by out.internet-mail-service.net (qpsmtpd/0.32) with ESMTP; Tue, 08 May 2007 12:48:23 -0700 Received: from julian-mac.elischer.org (nat.ironport.com [63.251.108.100]) by idiom.com (Postfix) with ESMTP id BB169125A26; Tue, 8 May 2007 12:48:22 -0700 (PDT) Message-ID: <4640D404.6040204@elischer.org> Date: Tue, 08 May 2007 12:48:20 -0700 From: Julian Elischer User-Agent: Thunderbird 2.0.0.0 (Macintosh/20070326) MIME-Version: 1.0 To: Hans Petter Selasky References: <200705051617.34162.hselasky@c2i.net> <200705081128.25708.jhb@freebsd.org> <4640C52E.7010209@elischer.org> <200705082100.51354.hselasky@c2i.net> In-Reply-To: <200705082100.51354.hselasky@c2i.net> Content-Type: text/plain; charset=ISO-8859-1; format=flowed Content-Transfer-Encoding: 7bit Cc: Giorgos Keramidas , freebsd-arch@freebsd.org Subject: Re: Missing LIST_PREV() ? X-BeenThere: freebsd-arch@freebsd.org X-Mailman-Version: 2.1.5 Precedence: list List-Id: Discussion related to FreeBSD architecture List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Tue, 08 May 2007 19:48:23 -0000 Hans Petter Selasky wrote: > On Tuesday 08 May 2007 20:45, Julian Elischer wrote: >> John Baldwin wrote: >>> On Monday 07 May 2007 04:25:18 pm Giorgos Keramidas wrote: >>>> with other compilers. >>> This can be fixed by passing the type as an argument which is what >>> TAILQ_PREV() does: >>> >>> #define TAILQ_PREV(elm, headname, field) \ >>> (*(((struct headname *)((elm)->field.tqe_prev))->tqh_last)) >>> >>> I'm not sure how portable offsetof() would be though. In general if you >>> want this feature, you should just use a TAILQ though. TAILQ_ENTRY() is >>> the same size as a LIST_ENTRY(), it just adds one more pointer to the >>> HEAD structure. It is also specifically designed to make TAILQ_PREV() >>> work w/o needing the offsetof() hack. >> I agree with this.. that's why we have the different types. >> The suggested change in ingenious but I don't know how portable it is.. > > I suggested the following at hacker's: > > #define LIST_PREV(head,elm,field,type) \ > (((elm) == LIST_FIRST(head)) ? ((struct type *)0) : \ > ((struct type *)(((uint8_t *)((elm)->field.le_prev)) - \ > ((uint8_t *)&LIST_NEXT((struct type *)0,field))))) > > What do you think? > > --HPS > _______________________________________________ > freebsd-arch@freebsd.org mailing list > http://lists.freebsd.org/mailman/listinfo/freebsd-arch > To unsubscribe, send any mail to "freebsd-arch-unsubscribe@freebsd.org" I think I'd rather use offsetof() with a #ifdef offsetof around it. and a comment saying that if you are using this you probably should be using a TAILQ. The question is "should we, just because we can?"