projects
/
platform
/
upstream
/
btrfs-progs.git
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
btrfs-progs: Sync code with kernel for BTRFS_MAX_INLINE_DATA_SIZE
[platform/upstream/btrfs-progs.git]
/
quick-test.c
diff --git
a/quick-test.c
b/quick-test.c
index
881a579
..
5da47c3
100644
(file)
--- a/
quick-test.c
+++ b/
quick-test.c
@@
-18,6
+18,7
@@
#include <stdio.h>
#include <stdlib.h>
#include <stdio.h>
#include <stdlib.h>
+#include <fcntl.h>
#include "kerncompat.h"
#include "radix-tree.h"
#include "ctree.h"
#include "kerncompat.h"
#include "radix-tree.h"
#include "ctree.h"
@@
-26,7
+27,7
@@
#include "transaction.h"
/* for testing only */
#include "transaction.h"
/* for testing only */
-int next_key(int i, int max_key) {
+
static
int next_key(int i, int max_key) {
return rand() % max_key;
// return i;
}
return rand() % max_key;
// return i;
}
@@
-38,24
+39,26
@@
int main(int ac, char **av) {
int i;
int num;
int ret;
int i;
int num;
int ret;
- int run_size =
1
00000;
+ int run_size =
3
00000;
int max_key = 100000000;
int max_key = 100000000;
- int tree_size =
0
;
+ int tree_size =
2
;
struct btrfs_path path;
struct btrfs_path path;
- struct btrfs_super_block super;
struct btrfs_root *root;
struct btrfs_trans_handle *trans;
struct btrfs_root *root;
struct btrfs_trans_handle *trans;
- buf = malloc(512);
- memset(buf, 0, 512);
+ buf = calloc(1, 512);
radix_tree_init();
radix_tree_init();
- root = open_ctree(av[1], &super);
+ root = open_ctree(av[1], BTRFS_SUPER_INFO_OFFSET, OPEN_CTREE_WRITES);
+ if (!root) {
+ fprintf(stderr, "Open ctree failed\n");
+ exit(1);
+ }
trans = btrfs_start_transaction(root, 1);
trans = btrfs_start_transaction(root, 1);
+ BUG_ON(IS_ERR(trans));
srand(55);
srand(55);
- ins.flags = 0;
- btrfs_set_key_type(&ins, BTRFS_STRING_ITEM_KEY);
+ ins.type = BTRFS_STRING_ITEM_KEY;
for (i = 0; i < run_size; i++) {
num = next_key(i, max_key);
// num = i;
for (i = 0; i < run_size; i++) {
num = next_key(i, max_key);
// num = i;
@@
-68,11
+71,19
@@
int main(int ac, char **av) {
if (!ret)
tree_size++;
if (i == run_size - 5) {
if (!ret)
tree_size++;
if (i == run_size - 5) {
- btrfs_commit_transaction(trans, root, &super);
+ btrfs_commit_transaction(trans, root);
+ trans = btrfs_start_transaction(root, 1);
+ BUG_ON(IS_ERR(trans));
}
}
}
}
- close_ctree(root, &super);
- root = open_ctree(av[1], &super);
+ btrfs_commit_transaction(trans, root);
+ close_ctree(root);
+ exit(1);
+ root = open_ctree(av[1], BTRFS_SUPER_INFO_OFFSET, OPEN_CTREE_WRITES);
+ if (!root) {
+ fprintf(stderr, "Open ctree failed\n");
+ exit(1);
+ }
printf("starting search\n");
srand(55);
for (i = 0; i < run_size; i++) {
printf("starting search\n");
srand(55);
for (i = 0; i < run_size; i++) {
@@
-81,24
+92,31
@@
int main(int ac, char **av) {
btrfs_init_path(&path);
if (i % 10000 == 0)
fprintf(stderr, "search %d:%d\n", num, i);
btrfs_init_path(&path);
if (i % 10000 == 0)
fprintf(stderr, "search %d:%d\n", num, i);
- ret = btrfs_search_slot(
trans
, root, &ins, &path, 0, 0);
+ ret = btrfs_search_slot(
NULL
, root, &ins, &path, 0, 0);
if (ret) {
if (ret) {
- btrfs_print_tree(root, root->node);
+ btrfs_print_tree(root, root->node
, 1
);
printf("unable to find %d\n", num);
exit(1);
}
printf("unable to find %d\n", num);
exit(1);
}
- btrfs_release_path(root, &path);
+ btrfs_release_path(&path);
+ }
+ close_ctree(root);
+
+ root = open_ctree(av[1], BTRFS_SUPER_INFO_OFFSET, OPEN_CTREE_WRITES);
+ if (!root) {
+ fprintf(stderr, "Open ctree failed\n");
+ exit(1);
}
}
- close_ctree(root, &super);
- root = open_ctree(av[1], &super);
printf("node %p level %d total ptrs %d free spc %lu\n", root->node,
printf("node %p level %d total ptrs %d free spc %lu\n", root->node,
- btrfs_header_level(
&root->node->node.header
),
- btrfs_header_nritems(
&root->node->node.header
),
-
BTRFS_NODEPTRS_PER_BLOCK(root
) -
- btrfs_header_nritems(
&root->node->node.header
));
+ btrfs_header_level(
root->node
),
+ btrfs_header_nritems(
root->node
),
+
(unsigned long)BTRFS_NODEPTRS_PER_BLOCK(root->fs_info
) -
+ btrfs_header_nritems(
root->node
));
printf("all searches good, deleting some items\n");
i = 0;
srand(55);
printf("all searches good, deleting some items\n");
i = 0;
srand(55);
+ trans = btrfs_start_transaction(root, 1);
+ BUG_ON(IS_ERR(trans));
for (i = 0 ; i < run_size/4; i++) {
num = next_key(i, max_key);
ins.objectid = num;
for (i = 0 ; i < run_size/4; i++) {
num = next_key(i, max_key);
ins.objectid = num;
@@
-112,10
+130,18
@@
int main(int ac, char **av) {
BUG();
tree_size--;
}
BUG();
tree_size--;
}
- btrfs_release_path(root, &path);
+ btrfs_release_path(&path);
+ }
+ btrfs_commit_transaction(trans, root);
+ close_ctree(root);
+
+ root = open_ctree(av[1], BTRFS_SUPER_INFO_OFFSET, OPEN_CTREE_WRITES);
+ if (!root) {
+ fprintf(stderr, "Open ctree failed\n");
+ exit(1);
}
}
-
close_ctree(root, &super
);
-
root = open_ctree(av[1], &super
);
+
trans = btrfs_start_transaction(root, 1
);
+
BUG_ON(IS_ERR(trans)
);
srand(128);
for (i = 0; i < run_size; i++) {
num = next_key(i, max_key);
srand(128);
for (i = 0; i < run_size; i++) {
num = next_key(i, max_key);
@@
-127,8
+153,14
@@
int main(int ac, char **av) {
if (!ret)
tree_size++;
}
if (!ret)
tree_size++;
}
- close_ctree(root, &super);
- root = open_ctree(av[1], &super);
+ btrfs_commit_transaction(trans, root);
+ close_ctree(root);
+
+ root = open_ctree(av[1], BTRFS_SUPER_INFO_OFFSET, OPEN_CTREE_WRITES);
+ if (!root) {
+ fprintf(stderr, "Open ctree failed\n");
+ exit(1);
+ }
srand(128);
printf("starting search2\n");
for (i = 0; i < run_size; i++) {
srand(128);
printf("starting search2\n");
for (i = 0; i < run_size; i++) {
@@
-137,18
+169,19
@@
int main(int ac, char **av) {
btrfs_init_path(&path);
if (i % 10000 == 0)
fprintf(stderr, "search %d:%d\n", num, i);
btrfs_init_path(&path);
if (i % 10000 == 0)
fprintf(stderr, "search %d:%d\n", num, i);
- ret = btrfs_search_slot(
trans
, root, &ins, &path, 0, 0);
+ ret = btrfs_search_slot(
NULL
, root, &ins, &path, 0, 0);
if (ret) {
if (ret) {
- btrfs_print_tree(root, root->node);
+ btrfs_print_tree(root, root->node
, 1
);
printf("unable to find %d\n", num);
exit(1);
}
printf("unable to find %d\n", num);
exit(1);
}
- btrfs_release_path(
root,
&path);
+ btrfs_release_path(&path);
}
printf("starting big long delete run\n");
}
printf("starting big long delete run\n");
- while(root->node &&
- btrfs_header_nritems(&root->node->node.header) > 0) {
- struct btrfs_leaf *leaf;
+ trans = btrfs_start_transaction(root, 1);
+ BUG_ON(IS_ERR(trans));
+ while(root->node && btrfs_header_nritems(root->node) > 0) {
+ struct extent_buffer *leaf;
int slot;
ins.objectid = (u64)-1;
btrfs_init_path(&path);
int slot;
ins.objectid = (u64)-1;
btrfs_init_path(&path);
@@
-156,16
+189,17
@@
int main(int ac, char **av) {
if (ret == 0)
BUG();
if (ret == 0)
BUG();
- leaf =
&path.nodes[0]->leaf
;
+ leaf =
path.nodes[0]
;
slot = path.slots[0];
slot = path.slots[0];
- if (slot != btrfs_header_nritems(
&leaf->header
))
+ if (slot != btrfs_header_nritems(
leaf
))
BUG();
while(path.slots[0] > 0) {
path.slots[0] -= 1;
slot = path.slots[0];
BUG();
while(path.slots[0] > 0) {
path.slots[0] -= 1;
slot = path.slots[0];
- leaf = &path.nodes[0]->leaf;
+ leaf = path.nodes[0];
+
+ btrfs_item_key_to_cpu(leaf, &last, slot);
- btrfs_disk_key_to_cpu(&last, &leaf->items[slot].key);
if (tree_size % 10000 == 0)
printf("big del %d:%d\n", tree_size, i);
ret = btrfs_del_item(trans, root, &path);
if (tree_size % 10000 == 0)
printf("big del %d:%d\n", tree_size, i);
ret = btrfs_del_item(trans, root, &path);
@@
-175,7
+209,7
@@
int main(int ac, char **av) {
}
tree_size--;
}
}
tree_size--;
}
- btrfs_release_path(
root,
&path);
+ btrfs_release_path(&path);
}
/*
printf("previous tree:\n");
}
/*
printf("previous tree:\n");
@@
-183,12
+217,10
@@
int main(int ac, char **av) {
printf("map before commit\n");
btrfs_print_tree(root->extent_root, root->extent_root->node);
*/
printf("map before commit\n");
btrfs_print_tree(root->extent_root, root->extent_root->node);
*/
- btrfs_commit_transaction(trans, root
, &super
);
+ btrfs_commit_transaction(trans, root);
printf("tree size is now %d\n", tree_size);
printf("root %p commit root %p\n", root->node, root->commit_root);
printf("tree size is now %d\n", tree_size);
printf("root %p commit root %p\n", root->node, root->commit_root);
- printf("map tree\n");
- btrfs_print_tree(root->fs_info->extent_root,
- root->fs_info->extent_root->node);
- close_ctree(root, &super);
+ btrfs_print_tree(root, root->node, 1);
+ close_ctree(root);
return 0;
}
return 0;
}