[PATCH v2 05/12] rbtree: performance and correctness test

2012-07-13 Thread Michel Lespinasse
This small module helps measure the performance of rbtree insert and erase. Additionally, we run a few correctness tests to check that the rbtrees have all desired properties: - contains the right number of nodes in the order desired, - never two consecutive red nodes on any path, - all paths to l

Re: [PATCH v2 05/12] rbtree: performance and correctness test

2012-07-13 Thread Michel Lespinasse
On Fri, Jul 13, 2012 at 3:45 PM, Andrew Morton wrote: > On Fri, 13 Jul 2012 15:33:35 -0700 Michel Lespinasse > wrote: >> Ah, I did not realize we had a precedent for in-tree kernel test modules. > > hm, well, just because that's what we do now doesn't mean that it was a > good idea ;) These thin

Re: [PATCH v2 05/12] rbtree: performance and correctness test

2012-07-13 Thread Andrew Morton
On Fri, 13 Jul 2012 15:33:35 -0700 Michel Lespinasse wrote: > On Fri, Jul 13, 2012 at 1:15 PM, Andrew Morton > wrote: > > On Thu, 12 Jul 2012 17:31:50 -0700 Michel Lespinasse > > wrote: > >> Makefile|2 +- > >> lib/Kconfig.debug |1 + > >> tests/Kconfig | 18

Re: [PATCH v2 05/12] rbtree: performance and correctness test

2012-07-13 Thread Michel Lespinasse
On Fri, Jul 13, 2012 at 1:15 PM, Andrew Morton wrote: > On Thu, 12 Jul 2012 17:31:50 -0700 Michel Lespinasse > wrote: >> Makefile|2 +- >> lib/Kconfig.debug |1 + >> tests/Kconfig | 18 +++ >> tests/Makefile |1 + >> tests/rbtree_test.c | 135 >>

Re: [PATCH v2 05/12] rbtree: performance and correctness test

2012-07-13 Thread Andrew Morton
On Thu, 12 Jul 2012 17:31:50 -0700 Michel Lespinasse wrote: > This small module helps measure the performance of rbtree insert and erase. > > Additionally, we run a few correctness tests to check that the rbtrees have > all desired properties: > - contains the right number of nodes in the order

[PATCH v2 05/12] rbtree: performance and correctness test

2012-07-12 Thread Michel Lespinasse
This small module helps measure the performance of rbtree insert and erase. Additionally, we run a few correctness tests to check that the rbtrees have all desired properties: - contains the right number of nodes in the order desired, - never two consecutive red nodes on any path, - all paths to l