Re: [PATCH net-next 1/3] lib: Resizable, Scalable, Concurrent Hash Table

2014-08-02 Thread Nikolay Aleksandrov
On 08/02/2014 11:47 AM, Thomas Graf wrote: > Generic implementation of a resizable, scalable, concurrent hash table > based on [0]. The implementation supports both, fixed size keys specified > via an offset and length, or arbitrary keys via own hash and compare > functions. > > Lookups are

[PATCH net-next 1/3] lib: Resizable, Scalable, Concurrent Hash Table

2014-08-02 Thread Thomas Graf
Generic implementation of a resizable, scalable, concurrent hash table based on [0]. The implementation supports both, fixed size keys specified via an offset and length, or arbitrary keys via own hash and compare functions. Lookups are lockless and protected as RCU read side critical sections.

[PATCH net-next 1/3] lib: Resizable, Scalable, Concurrent Hash Table

2014-08-02 Thread Thomas Graf
Generic implementation of a resizable, scalable, concurrent hash table based on [0]. The implementation supports both, fixed size keys specified via an offset and length, or arbitrary keys via own hash and compare functions. Lookups are lockless and protected as RCU read side critical sections.

Re: [PATCH net-next 1/3] lib: Resizable, Scalable, Concurrent Hash Table

2014-08-02 Thread Nikolay Aleksandrov
On 08/02/2014 11:47 AM, Thomas Graf wrote: Generic implementation of a resizable, scalable, concurrent hash table based on [0]. The implementation supports both, fixed size keys specified via an offset and length, or arbitrary keys via own hash and compare functions. Lookups are lockless

[PATCH net-next 1/3] lib: Resizable, Scalable, Concurrent Hash Table

2014-08-01 Thread Thomas Graf
Generic implementation of a resizable, scalable, concurrent hash table based on [0]. The implementation supports both, fixed size keys specified via an offset and length, or arbitrary keys via own hash and compare functions. Lookups are lockless and protected as RCU read side critical sections.

Re: [PATCH net-next 1/3] lib: Resizable, Scalable, Concurrent Hash Table

2014-08-01 Thread Thomas Graf
On 08/01/14 at 12:01pm, Nikolay Aleksandrov wrote: > I see that ht->shift is being set but then ht is being zeroed, wouldn't this > allow for the table to double ilog2(tbl->size) times more ? Absolutely, thanks for catching this! -- To unsubscribe from this list: send the line "unsubscribe

Re: [PATCH net-next 1/3] lib: Resizable, Scalable, Concurrent Hash Table

2014-08-01 Thread Thomas Graf
On 08/01/14 at 12:26pm, Patrick McHardy wrote: > On Fri, Aug 01, 2014 at 10:51:58AM +0200, Thomas Graf wrote: > > --- /dev/null > > +++ b/include/linux/rhashtable.h > > @@ -0,0 +1,213 @@ > > +/* > > + * Resizable, Scalable, Concurrent Hash Table > > + * > > + * Copyright (c) 2014 Thomas Graf > >

Re: [PATCH net-next 1/3] lib: Resizable, Scalable, Concurrent Hash Table

2014-08-01 Thread Patrick McHardy
On Fri, Aug 01, 2014 at 10:51:58AM +0200, Thomas Graf wrote: > --- /dev/null > +++ b/include/linux/rhashtable.h > @@ -0,0 +1,213 @@ > +/* > + * Resizable, Scalable, Concurrent Hash Table > + * > + * Copyright (c) 2014 Thomas Graf > + * > + * Based on the following paper by Josh Triplett, Paul E.

Re: [PATCH net-next 1/3] lib: Resizable, Scalable, Concurrent Hash Table

2014-08-01 Thread Nikolay Aleksandrov
On 08/01/2014 10:51 AM, Thomas Graf wrote: > Generic implementation of a resizable, scalable, concurrent hash table > based on [0]. The implementation supports both, fixed size keys specified > via an offset and length, or arbitrary keys via own hash and compare > functions. > > Lookups are

[PATCH net-next 1/3] lib: Resizable, Scalable, Concurrent Hash Table

2014-08-01 Thread Thomas Graf
Generic implementation of a resizable, scalable, concurrent hash table based on [0]. The implementation supports both, fixed size keys specified via an offset and length, or arbitrary keys via own hash and compare functions. Lookups are lockless and protected as RCU read side critical sections.

[PATCH net-next 1/3] lib: Resizable, Scalable, Concurrent Hash Table

2014-08-01 Thread Thomas Graf
Generic implementation of a resizable, scalable, concurrent hash table based on [0]. The implementation supports both, fixed size keys specified via an offset and length, or arbitrary keys via own hash and compare functions. Lookups are lockless and protected as RCU read side critical sections.

Re: [PATCH net-next 1/3] lib: Resizable, Scalable, Concurrent Hash Table

2014-08-01 Thread Nikolay Aleksandrov
On 08/01/2014 10:51 AM, Thomas Graf wrote: Generic implementation of a resizable, scalable, concurrent hash table based on [0]. The implementation supports both, fixed size keys specified via an offset and length, or arbitrary keys via own hash and compare functions. Lookups are lockless

Re: [PATCH net-next 1/3] lib: Resizable, Scalable, Concurrent Hash Table

2014-08-01 Thread Patrick McHardy
On Fri, Aug 01, 2014 at 10:51:58AM +0200, Thomas Graf wrote: --- /dev/null +++ b/include/linux/rhashtable.h @@ -0,0 +1,213 @@ +/* + * Resizable, Scalable, Concurrent Hash Table + * + * Copyright (c) 2014 Thomas Graf tg...@suug.ch + * + * Based on the following paper by Josh Triplett, Paul

Re: [PATCH net-next 1/3] lib: Resizable, Scalable, Concurrent Hash Table

2014-08-01 Thread Thomas Graf
On 08/01/14 at 12:26pm, Patrick McHardy wrote: On Fri, Aug 01, 2014 at 10:51:58AM +0200, Thomas Graf wrote: --- /dev/null +++ b/include/linux/rhashtable.h @@ -0,0 +1,213 @@ +/* + * Resizable, Scalable, Concurrent Hash Table + * + * Copyright (c) 2014 Thomas Graf tg...@suug.ch + *

Re: [PATCH net-next 1/3] lib: Resizable, Scalable, Concurrent Hash Table

2014-08-01 Thread Thomas Graf
On 08/01/14 at 12:01pm, Nikolay Aleksandrov wrote: I see that ht-shift is being set but then ht is being zeroed, wouldn't this allow for the table to double ilog2(tbl-size) times more ? Absolutely, thanks for catching this! -- To unsubscribe from this list: send the line unsubscribe

[PATCH net-next 1/3] lib: Resizable, Scalable, Concurrent Hash Table

2014-08-01 Thread Thomas Graf
Generic implementation of a resizable, scalable, concurrent hash table based on [0]. The implementation supports both, fixed size keys specified via an offset and length, or arbitrary keys via own hash and compare functions. Lookups are lockless and protected as RCU read side critical sections.

[PATCH net-next 1/3] lib: Resizable, Scalable, Concurrent Hash Table

2014-07-31 Thread Thomas Graf
Generic implementation of a resizable, scalable, concurrent hash table based on [0]. The implementation supports both, fixed size keys specified via an offset and length, or arbitrary keys via own hash and compare functions. Lookups are lockless and protected as RCU read side critical sections.

[PATCH net-next 1/3] lib: Resizable, Scalable, Concurrent Hash Table

2014-07-31 Thread Thomas Graf
Generic implementation of a resizable, scalable, concurrent hash table based on [0]. The implementation supports both, fixed size keys specified via an offset and length, or arbitrary keys via own hash and compare functions. Lookups are lockless and protected as RCU read side critical sections.