diff options
| author | Cy Schubert <cy@FreeBSD.org> | 2022-10-16 19:24:20 +0000 |
|---|---|---|
| committer | Cy Schubert <cy@FreeBSD.org> | 2022-10-16 19:24:20 +0000 |
| commit | 643f9a0581e8aac7eb790ced1164748939829826 (patch) | |
| tree | 426d366252d838c8c61b439342ab32eccd181425 /testcode/unitecs.c | |
| parent | 0dde6f4f8e604df8c6fbdab8b4aadb5ddf80c76f (diff) | |
Diffstat (limited to 'testcode/unitecs.c')
| -rw-r--r-- | testcode/unitecs.c | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/testcode/unitecs.c b/testcode/unitecs.c index b240bfcc666e..68d6907f81a7 100644 --- a/testcode/unitecs.c +++ b/testcode/unitecs.c @@ -173,7 +173,7 @@ static void consistency_test(void) for (i = 0; i < 1000; i++) { l = randomkey(&k, 128); elem = (struct reply_info *) calloc(1, sizeof(struct reply_info)); - addrtree_insert(t, k, l, 64, elem, timenow + 10, timenow); + addrtree_insert(t, k, l, 64, elem, timenow + 10, timenow, 0); /* This should always hold because no items ever expire. They * could be overwritten, though. */ unit_assert( count <= t->node_count ); @@ -189,7 +189,7 @@ static void consistency_test(void) for (i = 0; i < 1000; i++) { l = randomkey(&k, 128); elem = (struct reply_info *) calloc(1, sizeof(struct reply_info)); - addrtree_insert(t, k, l, 64, elem, i + 10, i); + addrtree_insert(t, k, l, 64, elem, i + 10, i, 0); free(k); unit_assert( !addrtree_inconsistent(t) ); } @@ -201,7 +201,7 @@ static void consistency_test(void) for (i = 0; i < 1000; i++) { l = randomkey(&k, 128); elem = (struct reply_info *) calloc(1, sizeof(struct reply_info)); - addrtree_insert(t, k, l, 64, elem, i + 10, i); + addrtree_insert(t, k, l, 64, elem, i + 10, i, 0); unit_assert( t->node_count <= 27); free(k); unit_assert( !addrtree_inconsistent(t) ); |