mirror of
https://github.com/Fishwaldo/Star64_linux.git
synced 2025-07-23 07:12:09 +00:00
radix tree test harness
This code is mostly from Andrew Morton and Nick Piggin; tarball downloaded from http://ozlabs.org/~akpm/rtth.tar.gz with sha1sum 0ce679db9ec047296b5d1ff7a1dfaa03a7bef1bd Some small modifications were necessary to the test harness to fix the build with the current Linux source code. I also made minor modifications to automatically test the radix-tree.c and radix-tree.h files that are in the current source tree, as opposed to a copied and slightly modified version. I am sure more could be done to tidy up the harness, as well as adding more tests. [koct9i@gmail.com: fix compilation] Signed-off-by: Matthew Wilcox <willy@linux.intel.com> Cc: Shuah Khan <shuahkh@osg.samsung.com> Cc: Johannes Weiner <hannes@cmpxchg.org> Cc: Matthew Wilcox <willy@linux.intel.com> Cc: "Kirill A. Shutemov" <kirill.shutemov@linux.intel.com> Cc: Ross Zwisler <ross.zwisler@linux.intel.com> Cc: Hugh Dickins <hughd@google.com> Signed-off-by: Konstantin Khlebnikov <koct9i@gmail.com> Signed-off-by: Andrew Morton <akpm@linux-foundation.org> Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
This commit is contained in:
Matthew Wilcox
Linus Torvalds
parent
f67c07f07f
commit
1366c37ed8
36 changed files with 2110 additions and 0 deletions
271
tools/testing/radix-tree/main.c
Normal file
271
tools/testing/radix-tree/main.c
Normal file
|
|
@ -0,0 +1,271 @@
|
|||
#include <stdio.h>
|
||||
#include <stdlib.h>
|
||||
#include <unistd.h>
|
||||
#include <time.h>
|
||||
#include <assert.h>
|
||||
|
||||
#include <linux/slab.h>
|
||||
#include <linux/radix-tree.h>
|
||||
|
||||
#include "test.h"
|
||||
#include "regression.h"
|
||||
|
||||
void __gang_check(unsigned long middle, long down, long up, int chunk, int hop)
|
||||
{
|
||||
long idx;
|
||||
RADIX_TREE(tree, GFP_KERNEL);
|
||||
|
||||
middle = 1 << 30;
|
||||
|
||||
for (idx = -down; idx < up; idx++)
|
||||
item_insert(&tree, middle + idx);
|
||||
|
||||
item_check_absent(&tree, middle - down - 1);
|
||||
for (idx = -down; idx < up; idx++)
|
||||
item_check_present(&tree, middle + idx);
|
||||
item_check_absent(&tree, middle + up);
|
||||
|
||||
item_gang_check_present(&tree, middle - down,
|
||||
up + down, chunk, hop);
|
||||
item_full_scan(&tree, middle - down, down + up, chunk);
|
||||
item_kill_tree(&tree);
|
||||
}
|
||||
|
||||
void gang_check(void)
|
||||
{
|
||||
__gang_check(1 << 30, 128, 128, 35, 2);
|
||||
__gang_check(1 << 31, 128, 128, 32, 32);
|
||||
__gang_check(1 << 31, 128, 128, 32, 100);
|
||||
__gang_check(1 << 31, 128, 128, 17, 7);
|
||||
__gang_check(0xffff0000, 0, 65536, 17, 7);
|
||||
__gang_check(0xfffffffe, 1, 1, 17, 7);
|
||||
}
|
||||
|
||||
void __big_gang_check(void)
|
||||
{
|
||||
unsigned long start;
|
||||
int wrapped = 0;
|
||||
|
||||
start = 0;
|
||||
do {
|
||||
unsigned long old_start;
|
||||
|
||||
// printf("0x%08lx\n", start);
|
||||
__gang_check(start, rand() % 113 + 1, rand() % 71,
|
||||
rand() % 157, rand() % 91 + 1);
|
||||
old_start = start;
|
||||
start += rand() % 1000000;
|
||||
start %= 1ULL << 33;
|
||||
if (start < old_start)
|
||||
wrapped = 1;
|
||||
} while (!wrapped);
|
||||
}
|
||||
|
||||
void big_gang_check(void)
|
||||
{
|
||||
int i;
|
||||
|
||||
for (i = 0; i < 1000; i++) {
|
||||
__big_gang_check();
|
||||
srand(time(0));
|
||||
printf("%d ", i);
|
||||
fflush(stdout);
|
||||
}
|
||||
}
|
||||
|
||||
void add_and_check(void)
|
||||
{
|
||||
RADIX_TREE(tree, GFP_KERNEL);
|
||||
|
||||
item_insert(&tree, 44);
|
||||
item_check_present(&tree, 44);
|
||||
item_check_absent(&tree, 43);
|
||||
item_kill_tree(&tree);
|
||||
}
|
||||
|
||||
void dynamic_height_check(void)
|
||||
{
|
||||
int i;
|
||||
RADIX_TREE(tree, GFP_KERNEL);
|
||||
tree_verify_min_height(&tree, 0);
|
||||
|
||||
item_insert(&tree, 42);
|
||||
tree_verify_min_height(&tree, 42);
|
||||
|
||||
item_insert(&tree, 1000000);
|
||||
tree_verify_min_height(&tree, 1000000);
|
||||
|
||||
assert(item_delete(&tree, 1000000));
|
||||
tree_verify_min_height(&tree, 42);
|
||||
|
||||
assert(item_delete(&tree, 42));
|
||||
tree_verify_min_height(&tree, 0);
|
||||
|
||||
for (i = 0; i < 1000; i++) {
|
||||
item_insert(&tree, i);
|
||||
tree_verify_min_height(&tree, i);
|
||||
}
|
||||
|
||||
i--;
|
||||
for (;;) {
|
||||
assert(item_delete(&tree, i));
|
||||
if (i == 0) {
|
||||
tree_verify_min_height(&tree, 0);
|
||||
break;
|
||||
}
|
||||
i--;
|
||||
tree_verify_min_height(&tree, i);
|
||||
}
|
||||
|
||||
item_kill_tree(&tree);
|
||||
}
|
||||
|
||||
void check_copied_tags(struct radix_tree_root *tree, unsigned long start, unsigned long end, unsigned long *idx, int count, int fromtag, int totag)
|
||||
{
|
||||
int i;
|
||||
|
||||
for (i = 0; i < count; i++) {
|
||||
/* if (i % 1000 == 0)
|
||||
putchar('.'); */
|
||||
if (idx[i] < start || idx[i] > end) {
|
||||
if (item_tag_get(tree, idx[i], totag)) {
|
||||
printf("%lu-%lu: %lu, tags %d-%d\n", start, end, idx[i], item_tag_get(tree, idx[i], fromtag), item_tag_get(tree, idx[i], totag));
|
||||
}
|
||||
assert(!item_tag_get(tree, idx[i], totag));
|
||||
continue;
|
||||
}
|
||||
if (item_tag_get(tree, idx[i], fromtag) ^
|
||||
item_tag_get(tree, idx[i], totag)) {
|
||||
printf("%lu-%lu: %lu, tags %d-%d\n", start, end, idx[i], item_tag_get(tree, idx[i], fromtag), item_tag_get(tree, idx[i], totag));
|
||||
}
|
||||
assert(!(item_tag_get(tree, idx[i], fromtag) ^
|
||||
item_tag_get(tree, idx[i], totag)));
|
||||
}
|
||||
}
|
||||
|
||||
#define ITEMS 50000
|
||||
|
||||
void copy_tag_check(void)
|
||||
{
|
||||
RADIX_TREE(tree, GFP_KERNEL);
|
||||
unsigned long idx[ITEMS];
|
||||
unsigned long start, end, count = 0, tagged, cur, tmp;
|
||||
int i;
|
||||
|
||||
// printf("generating radix tree indices...\n");
|
||||
start = rand();
|
||||
end = rand();
|
||||
if (start > end && (rand() % 10)) {
|
||||
cur = start;
|
||||
start = end;
|
||||
end = cur;
|
||||
}
|
||||
/* Specifically create items around the start and the end of the range
|
||||
* with high probability to check for off by one errors */
|
||||
cur = rand();
|
||||
if (cur & 1) {
|
||||
item_insert(&tree, start);
|
||||
if (cur & 2) {
|
||||
if (start <= end)
|
||||
count++;
|
||||
item_tag_set(&tree, start, 0);
|
||||
}
|
||||
}
|
||||
if (cur & 4) {
|
||||
item_insert(&tree, start-1);
|
||||
if (cur & 8)
|
||||
item_tag_set(&tree, start-1, 0);
|
||||
}
|
||||
if (cur & 16) {
|
||||
item_insert(&tree, end);
|
||||
if (cur & 32) {
|
||||
if (start <= end)
|
||||
count++;
|
||||
item_tag_set(&tree, end, 0);
|
||||
}
|
||||
}
|
||||
if (cur & 64) {
|
||||
item_insert(&tree, end+1);
|
||||
if (cur & 128)
|
||||
item_tag_set(&tree, end+1, 0);
|
||||
}
|
||||
|
||||
for (i = 0; i < ITEMS; i++) {
|
||||
do {
|
||||
idx[i] = rand();
|
||||
} while (item_lookup(&tree, idx[i]));
|
||||
|
||||
item_insert(&tree, idx[i]);
|
||||
if (rand() & 1) {
|
||||
item_tag_set(&tree, idx[i], 0);
|
||||
if (idx[i] >= start && idx[i] <= end)
|
||||
count++;
|
||||
}
|
||||
/* if (i % 1000 == 0)
|
||||
putchar('.'); */
|
||||
}
|
||||
|
||||
// printf("\ncopying tags...\n");
|
||||
cur = start;
|
||||
tagged = radix_tree_range_tag_if_tagged(&tree, &cur, end, ITEMS, 0, 1);
|
||||
|
||||
// printf("checking copied tags\n");
|
||||
assert(tagged == count);
|
||||
check_copied_tags(&tree, start, end, idx, ITEMS, 0, 1);
|
||||
|
||||
/* Copy tags in several rounds */
|
||||
// printf("\ncopying tags...\n");
|
||||
cur = start;
|
||||
do {
|
||||
tmp = rand() % (count/10+2);
|
||||
tagged = radix_tree_range_tag_if_tagged(&tree, &cur, end, tmp, 0, 2);
|
||||
} while (tmp == tagged);
|
||||
|
||||
// printf("%lu %lu %lu\n", tagged, tmp, count);
|
||||
// printf("checking copied tags\n");
|
||||
check_copied_tags(&tree, start, end, idx, ITEMS, 0, 2);
|
||||
assert(tagged < tmp);
|
||||
verify_tag_consistency(&tree, 0);
|
||||
verify_tag_consistency(&tree, 1);
|
||||
verify_tag_consistency(&tree, 2);
|
||||
// printf("\n");
|
||||
item_kill_tree(&tree);
|
||||
}
|
||||
|
||||
static void single_thread_tests(void)
|
||||
{
|
||||
int i;
|
||||
|
||||
tag_check();
|
||||
printf("after tag_check: %d allocated\n", nr_allocated);
|
||||
gang_check();
|
||||
printf("after gang_check: %d allocated\n", nr_allocated);
|
||||
add_and_check();
|
||||
printf("after add_and_check: %d allocated\n", nr_allocated);
|
||||
dynamic_height_check();
|
||||
printf("after dynamic_height_check: %d allocated\n", nr_allocated);
|
||||
big_gang_check();
|
||||
printf("after big_gang_check: %d allocated\n", nr_allocated);
|
||||
for (i = 0; i < 2000; i++) {
|
||||
copy_tag_check();
|
||||
printf("%d ", i);
|
||||
fflush(stdout);
|
||||
}
|
||||
printf("after copy_tag_check: %d allocated\n", nr_allocated);
|
||||
}
|
||||
|
||||
int main(void)
|
||||
{
|
||||
rcu_register_thread();
|
||||
radix_tree_init();
|
||||
|
||||
regression1_test();
|
||||
regression2_test();
|
||||
single_thread_tests();
|
||||
|
||||
sleep(1);
|
||||
printf("after sleep(1): %d allocated\n", nr_allocated);
|
||||
rcu_unregister_thread();
|
||||
|
||||
exit(0);
|
||||
}
|
||||
Loading…
Add table
Add a link
Reference in a new issue