lkml.org 
[lkml]   [2013]   [Nov]   [6]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
Date
From
SubjectRe: [PATCH] rbtree/test: test rbtree_postorder_for_each_entry_safe()
On Wed,  6 Nov 2013 13:37:23 -0800 Cody P Schafer <cody@linux.vnet.ibm.com> wrote:

> ...
>
> --- a/lib/rbtree_test.c
> +++ b/lib/rbtree_test.c
> @@ -114,6 +114,16 @@ static int black_path_count(struct rb_node *rb)
> return count;
> }
>
> +static void check_postorder_foreach(int nr_nodes)
> +{
> + struct test_node *cur, *n;
> + int count = 0;
> + rbtree_postorder_for_each_entry_safe(cur, n, &root, rb)
> + count++;
> +
> + WARN_ON_ONCE(count != nr_nodes);
> +}
> +
> static void check_postorder(int nr_nodes)
> {
> struct rb_node *rb;
> @@ -148,6 +158,7 @@ static void check(int nr_nodes)
> WARN_ON_ONCE(count < (1 << black_path_count(rb_last(&root))) - 1);
>
> check_postorder(nr_nodes);
> + check_postorder_foreach(nr_nodes);
> }
>
> static void check_augmented(int nr_nodes)

I'm rather confused about where this fits with the other (and
apparently withdrawn) patches.

Please resend everything?


\
 
 \ /
  Last update: 2013-11-07 00:41    [W:0.069 / U:0.080 seconds]
©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site