4 #include "kerncompat.h"
5 #include "radix-tree.h"
8 #include "print-tree.h"
12 static int setup_key(struct radix_tree_root *root, struct key *key, int exists)
21 ret = radix_tree_gang_lookup(root, (void **)res, num, 2);
26 } else if (ret != 0 && num == res[0]) {
28 if (ret > 1 && num == res[1]) {
37 static int ins_one(struct ctree_root *root, struct radix_tree_root *radix)
39 struct ctree_path path;
45 ret = setup_key(radix, &key, 0);
46 sprintf(buf, "str-%Lu\n", key.objectid);
47 ret = insert_item(root, &key, buf, strlen(buf));
50 oid = (unsigned long)key.objectid;
51 radix_tree_preload(GFP_KERNEL);
52 ret = radix_tree_insert(radix, oid, (void *)oid);
53 radix_tree_preload_end();
58 printf("failed to insert %Lu\n", key.objectid);
62 static int insert_dup(struct ctree_root *root, struct radix_tree_root *radix)
64 struct ctree_path path;
69 ret = setup_key(radix, &key, 1);
72 sprintf(buf, "str-%Lu\n", key.objectid);
73 ret = insert_item(root, &key, buf, strlen(buf));
75 printf("insert on %Lu gave us %d\n", key.objectid, ret);
81 static int del_one(struct ctree_root *root, struct radix_tree_root *radix)
83 struct ctree_path path;
88 ret = setup_key(radix, &key, 1);
91 ret = search_slot(root, &key, &path, -1);
94 ret = del_item(root, &path);
95 release_path(root, &path);
98 ptr = radix_tree_delete(radix, key.objectid);
103 printf("failed to delete %Lu\n", key.objectid);
107 static int lookup_item(struct ctree_root *root, struct radix_tree_root *radix)
109 struct ctree_path path;
113 ret = setup_key(radix, &key, 1);
116 ret = search_slot(root, &key, &path, 0);
117 release_path(root, &path);
122 printf("unable to find key %Lu\n", key.objectid);
126 static int lookup_enoent(struct ctree_root *root, struct radix_tree_root *radix)
128 struct ctree_path path;
132 ret = setup_key(radix, &key, 0);
135 ret = search_slot(root, &key, &path, 0);
136 release_path(root, &path);
141 printf("able to find key that should not exist %Lu\n", key.objectid);
145 static int empty_tree(struct ctree_root *root, struct radix_tree_root *radix,
148 struct ctree_path path;
150 unsigned long found = 0;
158 key.objectid = (unsigned long)-1;
161 ret = search_slot(root, &key, &path, -1);
163 release_path(root, &path);
167 if (path.slots[0] == 0) {
168 release_path(root, &path);
173 slot = path.slots[0];
174 found = path.nodes[0]->leaf.items[slot].key.objectid;
175 ret = del_item(root, &path);
179 "failed to remove %lu from tree\n",
183 release_path(root, &path);
184 ptr = radix_tree_delete(radix, found);
192 fprintf(stderr, "failed to delete from the radix %lu\n", found);
196 static int fill_tree(struct ctree_root *root, struct radix_tree_root *radix,
202 for (i = 0; i < count; i++) {
203 ret = ins_one(root, radix);
205 printf("fill failed\n");
216 static int bulk_op(struct ctree_root *root, struct radix_tree_root *radix)
219 int nr = rand() % 20000;
220 static int run_nr = 0;
222 /* do the bulk op much less frequently */
225 ret = empty_tree(root, radix, nr);
228 ret = fill_tree(root, radix, nr);
235 int (*ops[])(struct ctree_root *root, struct radix_tree_root *radix) =
236 { ins_one, insert_dup, del_one, lookup_item, lookup_enoent, bulk_op };
238 static int fill_radix(struct ctree_root *root, struct radix_tree_root *radix)
240 struct ctree_path path;
249 key.objectid = (unsigned long)-1;
252 ret = search_slot(root, &key, &path, 0);
254 release_path(root, &path);
257 slot = path.slots[0];
260 release_path(root, &path);
265 for (i = slot; i >= 0; i--) {
266 found = path.nodes[0]->leaf.items[i].key.objectid;
267 radix_tree_preload(GFP_KERNEL);
268 ret = radix_tree_insert(radix, found, (void *)found);
271 "failed to insert %lu into radix\n",
276 radix_tree_preload_end();
278 release_path(root, &path);
279 key.objectid = found - 1;
280 if (key.objectid > found)
285 void sigstopper(int ignored)
288 fprintf(stderr, "caught exit signal, stopping\n");
291 int print_usage(void)
293 printf("usage: tester [-ih] [-c count] [-f count]\n");
294 printf("\t -c count -- iteration count after filling\n");
295 printf("\t -f count -- run this many random inserts before starting\n");
296 printf("\t -i -- only do initial fill\n");
297 printf("\t -h -- this help text\n");
300 int main(int ac, char **av)
302 RADIX_TREE(radix, GFP_KERNEL);
303 struct ctree_super_block super;
304 struct ctree_root *root;
309 int iterations = 20000;
310 int init_fill_count = 800000;
312 int initial_only = 0;
314 root = open_ctree("dbfile", &super);
315 fill_radix(root, &radix);
317 signal(SIGTERM, sigstopper);
318 signal(SIGINT, sigstopper);
320 for (i = 1 ; i < ac ; i++) {
321 if (strcmp(av[i], "-i") == 0) {
323 } else if (strcmp(av[i], "-c") == 0) {
324 iterations = atoi(av[i+1]);
326 } else if (strcmp(av[i], "-f") == 0) {
327 init_fill_count = atoi(av[i+1]);
333 printf("initial fill\n");
334 ret = fill_tree(root, &radix, init_fill_count);
335 printf("starting run\n");
340 if (initial_only == 1) {
343 for (i = 0; i < iterations; i++) {
344 op = rand() % ARRAY_SIZE(ops);
345 count = rand() % 128;
350 if (i && i % 5000 == 0) {
351 printf("open & close, root level %d nritems %d\n",
352 node_level(root->node->node.header.flags),
353 root->node->node.header.nritems);
354 write_ctree_super(root, &super);
356 root = open_ctree("dbfile", &super);
359 ret = ops[op](root, &radix);
361 fprintf(stderr, "op %d failed %d:%d\n",
363 print_tree(root, root->node);
364 fprintf(stderr, "op %d failed %d:%d\n",
369 if (ops[op] == bulk_op)
371 if (keep_running == 0) {
378 write_ctree_super(root, &super);