From: Phil Sutter
Date: Sat, 15 Aug 2015 00:37:15 +0200
> After having tested insertion, lookup, table walk and removal, spawn a
> number of threads running operations on the same rhashtable. Each of
> them will:
>
> 1) insert it's own set of objects,
> 2) lookup every successfully inserted
From: Phil Sutter p...@nwl.cc
Date: Sat, 15 Aug 2015 00:37:15 +0200
After having tested insertion, lookup, table walk and removal, spawn a
number of threads running operations on the same rhashtable. Each of
them will:
1) insert it's own set of objects,
2) lookup every successfully
On Sun, Aug 16, 2015 at 08:12:35PM +0200, Florian Westphal wrote:
> Phil Sutter wrote:
> > After having tested insertion, lookup, table walk and removal, spawn a
> > number of threads running operations on the same rhashtable. Each of
> > them will:
>
> [..]
>
> > + if
Phil Sutter wrote:
> After having tested insertion, lookup, table walk and removal, spawn a
> number of threads running operations on the same rhashtable. Each of
> them will:
[..]
> + if (down_interruptible(_sem))
> + pr_err(" thread[%d]: down_interruptible failed\n",
On 08/15/15 at 12:37am, Phil Sutter wrote:
> After having tested insertion, lookup, table walk and removal, spawn a
> number of threads running operations on the same rhashtable. Each of
> them will:
>
> 1) insert it's own set of objects,
> 2) lookup every successfully inserted object and finally
Phil Sutter p...@nwl.cc wrote:
After having tested insertion, lookup, table walk and removal, spawn a
number of threads running operations on the same rhashtable. Each of
them will:
[..]
+ if (down_interruptible(startup_sem))
+ pr_err( thread[%d]: down_interruptible
On 08/15/15 at 12:37am, Phil Sutter wrote:
After having tested insertion, lookup, table walk and removal, spawn a
number of threads running operations on the same rhashtable. Each of
them will:
1) insert it's own set of objects,
2) lookup every successfully inserted object and finally
3)
On Sun, Aug 16, 2015 at 08:12:35PM +0200, Florian Westphal wrote:
Phil Sutter p...@nwl.cc wrote:
After having tested insertion, lookup, table walk and removal, spawn a
number of threads running operations on the same rhashtable. Each of
them will:
[..]
+ if
After having tested insertion, lookup, table walk and removal, spawn a
number of threads running operations on the same rhashtable. Each of
them will:
1) insert it's own set of objects,
2) lookup every successfully inserted object and finally
3) remove objects in several rounds until all of them
After having tested insertion, lookup, table walk and removal, spawn a
number of threads running operations on the same rhashtable. Each of
them will:
1) insert it's own set of objects,
2) lookup every successfully inserted object and finally
3) remove objects in several rounds until all of them
10 matches
Mail list logo
