aboutsummaryrefslogtreecommitdiffstats
path: root/fs/btrfs/quick-test.c
diff options
context:
space:
mode:
Diffstat (limited to 'fs/btrfs/quick-test.c')
-rw-r--r--fs/btrfs/quick-test.c10
1 files changed, 5 insertions, 5 deletions
diff --git a/fs/btrfs/quick-test.c b/fs/btrfs/quick-test.c
index dbd00c3b7ab4..8255f79ceca5 100644
--- a/fs/btrfs/quick-test.c
+++ b/fs/btrfs/quick-test.c
@@ -19,7 +19,7 @@ int main(int ac, char **av) {
19 int i; 19 int i;
20 int num; 20 int num;
21 int ret; 21 int ret;
22 int run_size = 100000; 22 int run_size = 1024;
23 int max_key = 100000000; 23 int max_key = 100000000;
24 int tree_size = 0; 24 int tree_size = 0;
25 struct ctree_path path; 25 struct ctree_path path;
@@ -57,7 +57,7 @@ int main(int ac, char **av) {
57 init_path(&path); 57 init_path(&path);
58 if (i % 10000 == 0) 58 if (i % 10000 == 0)
59 fprintf(stderr, "search %d:%d\n", num, i); 59 fprintf(stderr, "search %d:%d\n", num, i);
60 ret = search_slot(root, &ins, &path, 0); 60 ret = search_slot(root, &ins, &path, 0, 0);
61 if (ret) { 61 if (ret) {
62 print_tree(root, root->node); 62 print_tree(root, root->node);
63 printf("unable to find %d\n", num); 63 printf("unable to find %d\n", num);
@@ -79,7 +79,7 @@ int main(int ac, char **av) {
79 num = next_key(i, max_key); 79 num = next_key(i, max_key);
80 ins.objectid = num; 80 ins.objectid = num;
81 init_path(&path); 81 init_path(&path);
82 ret = search_slot(root, &ins, &path, -1); 82 ret = search_slot(root, &ins, &path, -1, 1);
83 if (!ret) { 83 if (!ret) {
84 if (i % 10000 == 0) 84 if (i % 10000 == 0)
85 fprintf(stderr, "del %d:%d\n", num, i); 85 fprintf(stderr, "del %d:%d\n", num, i);
@@ -117,7 +117,7 @@ int main(int ac, char **av) {
117 init_path(&path); 117 init_path(&path);
118 if (i % 10000 == 0) 118 if (i % 10000 == 0)
119 fprintf(stderr, "search %d:%d\n", num, i); 119 fprintf(stderr, "search %d:%d\n", num, i);
120 ret = search_slot(root, &ins, &path, 0); 120 ret = search_slot(root, &ins, &path, 0, 0);
121 if (ret) { 121 if (ret) {
122 print_tree(root, root->node); 122 print_tree(root, root->node);
123 printf("unable to find %d\n", num); 123 printf("unable to find %d\n", num);
@@ -131,7 +131,7 @@ int main(int ac, char **av) {
131 int slot; 131 int slot;
132 ins.objectid = (u64)-1; 132 ins.objectid = (u64)-1;
133 init_path(&path); 133 init_path(&path);
134 ret = search_slot(root, &ins, &path, -1); 134 ret = search_slot(root, &ins, &path, -1, 1);
135 if (ret == 0) 135 if (ret == 0)
136 BUG(); 136 BUG();
137 137