lkml.org 
[lkml]   [2012]   [Aug]   [2]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
Date
From
SubjectRe: [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 } }


\
 
 \ /
  Last update: 2012-08-02 15:41    [W:0.750 / U:0.164 seconds]
©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site