[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Message-ID: <501A7AD3.7000008@gmail.com>
Date: Thu, 02 Aug 2012 15:04:19 +0200
From: Sasha Levin <levinsasha928@...il.com>
To: Josh Triplett <josh@...htriplett.org>
CC: Tejun Heo <tj@...nel.org>, torvalds@...ux-foundation.org,
akpm@...ux-foundation.org, linux-kernel@...r.kernel.org,
linux-mm@...ck.org, paul.gortmaker@...driver.com
Subject: Re: [RFC 1/4] hashtable: introduce a small and naive hashtable
On 08/02/2012 01:23 PM, Sasha Levin wrote:
>> #define DEFINE_HASH_TABLE(name, length) struct hash_table name = { .count = length, .buckets = { [0 ... (length - 1)] = HLIST_HEAD_INIT } }
> The limitation of this approach is that the struct hash_table variable must be 'static', which is a bit limiting - see for example the use of hashtable in 'struct user_namespace'.
>
What if we just use two possible decelerations? One of static structs and one for regular ones.
struct hash_table {
size_t bits;
struct hlist_head buckets[];
};
#define DEFINE_HASHTABLE(name, bits) \
union { \
struct hash_table name; \
struct { \
size_t bits; \
struct hlist_head buckets[1 << bits]; \
} __name; \
}
#define DEFINE_STATIC_HASHTABLE(name, bit) \
static struct hash_table name = { .bits = bit, \
.buckets = { [0 ... (bit - 1)] = HLIST_HEAD_INIT } }
--
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