aboutsummaryrefslogtreecommitdiffstats
path: root/random-test.c
diff options
context:
space:
mode:
authorChris Mason <chris.mason@oracle.com>2007-02-26 10:40:21 -0500
committerDavid Woodhouse <dwmw2@hera.kernel.org>2007-02-26 10:40:21 -0500
commit8f3b86bae341d96e0aef7b7052bdf30e25df7d29 (patch)
treeb54d4c7141ca746caf1a64b7d0510199c519487c /random-test.c
parentf463391fd2bfe9041d79adaf61491c153cf41624 (diff)
downloadbtrfs-progs-8f3b86bae341d96e0aef7b7052bdf30e25df7d29.tar.gz
btrfs-progs-8f3b86bae341d96e0aef7b7052bdf30e25df7d29.tar.xz
btrfs-progs-8f3b86bae341d96e0aef7b7052bdf30e25df7d29.zip
Add fsx-style randomized tree tester
Add debug-tree command to print the tree Add extent-tree.c to the repo Comment ctree.h
Diffstat (limited to 'random-test.c')
-rw-r--r--random-test.c295
1 files changed, 295 insertions, 0 deletions
diff --git a/random-test.c b/random-test.c
new file mode 100644
index 0000000..3c8c68d
--- /dev/null
+++ b/random-test.c
@@ -0,0 +1,295 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <signal.h>
+#include "kerncompat.h"
+#include "radix-tree.h"
+#include "ctree.h"
+#include "disk-io.h"
+#include "print-tree.h"
+
+int keep_running = 1;
+
+static int setup_key(struct radix_tree_root *root, struct key *key, int exists)
+{
+ int num = rand();
+ unsigned long res[2];
+ int ret;
+
+ key->flags = 0;
+ key->offset = 0;
+again:
+ ret = radix_tree_gang_lookup(root, (void **)res, num, 2);
+ if (exists) {
+ if (ret == 0)
+ return -1;
+ num = res[0];
+ } else if (ret != 0 && num == res[0]) {
+ num++;
+ if (ret > 1 && num == res[1]) {
+ num++;
+ goto again;
+ }
+ }
+ key->objectid = num;
+ return 0;
+}
+
+static int ins_one(struct ctree_root *root, struct radix_tree_root *radix)
+{
+ struct ctree_path path;
+ struct key key;
+ int ret;
+ char buf[128];
+ init_path(&path);
+ ret = setup_key(radix, &key, 0);
+ sprintf(buf, "str-%lu\n", key.objectid);
+ ret = insert_item(root, &key, buf, strlen(buf));
+ if (ret)
+ goto error;
+ radix_tree_preload(GFP_KERNEL);
+ ret = radix_tree_insert(radix, key.objectid,
+ (void *)key.objectid);
+ radix_tree_preload_end();
+ if (ret)
+ goto error;
+ return ret;
+error:
+ printf("failed to insert %lu\n", key.objectid);
+ return -1;
+}
+
+static int insert_dup(struct ctree_root *root, struct radix_tree_root *radix)
+{
+ struct ctree_path path;
+ struct key key;
+ int ret;
+ char buf[128];
+ init_path(&path);
+ ret = setup_key(radix, &key, 1);
+ if (ret < 0)
+ return 0;
+ sprintf(buf, "str-%lu\n", key.objectid);
+ ret = insert_item(root, &key, buf, strlen(buf));
+ if (ret != -EEXIST) {
+ printf("insert on %lu gave us %d\n", key.objectid, ret);
+ return 1;
+ }
+ return 0;
+}
+
+static int del_one(struct ctree_root *root, struct radix_tree_root *radix)
+{
+ struct ctree_path path;
+ struct key key;
+ int ret;
+ unsigned long *ptr;
+ init_path(&path);
+ ret = setup_key(radix, &key, 1);
+ if (ret < 0)
+ return 0;
+ ret = search_slot(root, &key, &path, -1);
+ if (ret)
+ goto error;
+ ret = del_item(root, &path);
+ release_path(root, &path);
+ if (ret != 0)
+ goto error;
+ ptr = radix_tree_delete(radix, key.objectid);
+ if (!ptr)
+ goto error;
+ return 0;
+error:
+ printf("failed to delete %lu\n", key.objectid);
+ return -1;
+}
+
+static int lookup_item(struct ctree_root *root, struct radix_tree_root *radix)
+{
+ struct ctree_path path;
+ struct key key;
+ int ret;
+ init_path(&path);
+ ret = setup_key(radix, &key, 1);
+ if (ret < 0)
+ return 0;
+ ret = search_slot(root, &key, &path, 0);
+ release_path(root, &path);
+ if (ret)
+ goto error;
+ return 0;
+error:
+ printf("unable to find key %lu\n", key.objectid);
+ return -1;
+}
+
+static int lookup_enoent(struct ctree_root *root, struct radix_tree_root *radix)
+{
+ struct ctree_path path;
+ struct key key;
+ int ret;
+ init_path(&path);
+ ret = setup_key(radix, &key, 0);
+ if (ret < 0)
+ return ret;
+ ret = search_slot(root, &key, &path, 0);
+ release_path(root, &path);
+ if (ret == 0)
+ goto error;
+ return 0;
+error:
+ printf("able to find key that should not exist %lu\n", key.objectid);
+ return -1;
+}
+
+int (*ops[])(struct ctree_root *root, struct radix_tree_root *radix) =
+{ ins_one, insert_dup, del_one, lookup_item, lookup_enoent };
+
+static int fill_radix(struct ctree_root *root, struct radix_tree_root *radix)
+{
+ struct ctree_path path;
+ struct key key;
+ u64 found;
+ int ret;
+ int slot;
+ int i;
+ key.offset = 0;
+ key.flags = 0;
+ key.objectid = (unsigned long)-1;
+ while(1) {
+ init_path(&path);
+ ret = search_slot(root, &key, &path, 0);
+ slot = path.slots[0];
+ if (ret != 0) {
+ if (slot == 0) {
+ release_path(root, &path);
+ break;
+ }
+ slot -= 1;
+ }
+ for (i = slot; i >= 0; i--) {
+ found = path.nodes[0]->leaf.items[i].key.objectid;
+ radix_tree_preload(GFP_KERNEL);
+ ret = radix_tree_insert(radix, found, (void *)found);
+ if (ret) {
+ fprintf(stderr,
+ "failed to insert %lu into radix\n",
+ found);
+ exit(1);
+ }
+
+ radix_tree_preload_end();
+ }
+ release_path(root, &path);
+ key.objectid = found - 1;
+ if (key.objectid > found)
+ break;
+ }
+ return 0;
+}
+
+void sigstopper(int ignored)
+{
+ keep_running = 0;
+ fprintf(stderr, "caught exit signal, stopping\n");
+}
+
+int print_usage(void)
+{
+ printf("usage: tester [-ih] [-c count] [-f count]\n");
+ printf("\t -c count -- iteration count after filling\n");
+ printf("\t -f count -- run this many random inserts before starting\n");
+ printf("\t -i -- only do initial fill\n");
+ printf("\t -h -- this help text\n");
+ exit(1);
+}
+int main(int ac, char **av)
+{
+ RADIX_TREE(radix, GFP_KERNEL);
+ struct ctree_super_block super;
+ struct ctree_root *root;
+ int i;
+ int ret;
+ int count;
+ int op;
+ int iterations = 20000;
+ int init_fill_count = 800000;
+ int err = 0;
+ int initial_only = 0;
+ radix_tree_init();
+ root = open_ctree("dbfile", &super);
+ fill_radix(root, &radix);
+
+ signal(SIGTERM, sigstopper);
+ signal(SIGINT, sigstopper);
+
+ for (i = 1 ; i < ac ; i++) {
+ if (strcmp(av[i], "-i") == 0) {
+ initial_only = 1;
+ } else if (strcmp(av[i], "-c") == 0) {
+ iterations = atoi(av[i+1]);
+ i++;
+ } else if (strcmp(av[i], "-f") == 0) {
+ init_fill_count = atoi(av[i+1]);
+ i++;
+ } else {
+ print_usage();
+ }
+ }
+ for (i = 0; i < init_fill_count; i++) {
+ ret = ins_one(root, &radix);
+ if (ret) {
+ printf("initial fill failed\n");
+ err = ret;
+ goto out;
+ }
+ if (i % 10000 == 0) {
+ printf("initial fill %d level %d count %d\n", i,
+ node_level(root->node->node.header.flags),
+ root->node->node.header.nritems);
+ }
+ if (keep_running == 0) {
+ err = 0;
+ goto out;
+ }
+ }
+ if (initial_only == 1) {
+ goto out;
+ }
+ for (i = 0; i < iterations; i++) {
+ op = rand() % ARRAY_SIZE(ops);
+ count = rand() % 128;
+ if (i % 2000 == 0) {
+ printf("%d\n", i);
+ fflush(stdout);
+ }
+ if (i && i % 5000 == 0) {
+ printf("open & close, root level %d nritems %d\n",
+ node_level(root->node->node.header.flags),
+ root->node->node.header.nritems);
+ write_ctree_super(root, &super);
+ close_ctree(root);
+ root = open_ctree("dbfile", &super);
+ }
+ while(count--) {
+ ret = ops[op](root, &radix);
+ if (ret) {
+ fprintf(stderr, "op %d failed %d:%d\n",
+ op, i, iterations);
+ print_tree(root, root->node);
+ fprintf(stderr, "op %d failed %d:%d\n",
+ op, i, iterations);
+ err = ret;
+ goto out;
+ }
+ if (keep_running == 0) {
+ err = 0;
+ goto out;
+ }
+ }
+ }
+out:
+ write_ctree_super(root, &super);
+ close_ctree(root);
+ return err;
+}
+