[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Message-Id: <1219770064.8680.28.camel@nimitz>
Date: Tue, 26 Aug 2008 10:01:04 -0700
From: Dave Hansen <dave@...ux.vnet.ibm.com>
To: Louis.Rilling@...labs.com
Cc: Oren Laadan <orenl@...columbia.edu>,
containers@...ts.linux-foundation.org, jeremy@...p.org,
linux-kernel@...r.kernel.org, arnd@...db.de
Subject: Re: [RFC v2][PATCH 7/9] Infrastructure for shared objects
On Thu, 2008-08-21 at 12:40 +0200, Louis Rilling wrote:
>
> > +struct cr_objhash {
> > + struct cr_obj **hash;
> > + int next_tag;
> > +};
> > +
> > +#define CR_OBJHASH_NBITS 10 /* 10 bits = 1K buckets */
> > +#define CR_OBJHASH_ORDER 0 /* 1K buckets * 4 bytes/bucket = 1
> page */
>
> Only true when PAGE_SIZE == 4K and in 32bits. Perhaps like below?
>
> #define CR_OBJHASH_BUCKET_NBITS (BITS_PER_LONG == 64 ? 3 : 2)
> #define CR_MIN_OBJHASH_NBITS ((PAGE_SHIFT - CR_OBJHASH_BUCKET_NBITS)
> #define CR_OBJHASH_NBITS (CR_MIN_OBJHASH_NBITS >= 10 ?
> CR_MIN_OBJHASH_NBITS : 10)
> #define CR_OBJHASH_ORDER (CR_OBJHASH_NBITS + CR_OBJHASH_BUCKET_NBITS -
> PAGE_SHIFT)
Gah. Can't we just use the existing radix tree or hash implementations
we already have?
-- Dave
--
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@...r.kernel.org
More majordomo info at http://vger.kernel.org/majordomo-info.html
Please read the FAQ at http://www.tux.org/lkml/
Powered by blists - more mailing lists