X-Git-Url: http://review.tizen.org/git/?a=blobdiff_plain;f=quick-test.c;h=5da47c322bcc90ca410ed010182972eb59616ae4;hb=3ccad2a6443fcae0fee2cd94132580d2d06268dd;hp=937f84286a9208765003c765f92481325cd8e169;hpb=4d11434c123b30c695db9294b7db352e50ba85bd;p=platform%2Fupstream%2Fbtrfs-progs.git diff --git a/quick-test.c b/quick-test.c index 937f842..5da47c3 100644 --- a/quick-test.c +++ b/quick-test.c @@ -1,5 +1,24 @@ +/* + * Copyright (C) 2007 Oracle. All rights reserved. + * + * This program is free software; you can redistribute it and/or + * modify it under the terms of the GNU General Public + * License v2 as published by the Free Software Foundation. + * + * This program is distributed in the hope that it will be useful, + * but WITHOUT ANY WARRANTY; without even the implied warranty of + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU + * General Public License for more details. + * + * You should have received a copy of the GNU General Public + * License along with this program; if not, write to the + * Free Software Foundation, Inc., 59 Temple Place - Suite 330, + * Boston, MA 021110-1307, USA. + */ + #include #include +#include #include "kerncompat.h" #include "radix-tree.h" #include "ctree.h" @@ -8,7 +27,7 @@ #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; } @@ -20,24 +39,26 @@ int main(int ac, char **av) { int i; int num; int ret; - int run_size = 100000; + int run_size = 300000; int max_key = 100000000; - int tree_size = 0; + int tree_size = 2; struct btrfs_path path; - struct btrfs_super_block super; struct btrfs_root *root; struct btrfs_trans_handle *trans; - buf = malloc(512); - memset(buf, 0, 512); + buf = calloc(1, 512); 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); + BUG_ON(IS_ERR(trans)); 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; @@ -50,11 +71,19 @@ int main(int ac, char **av) { 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++) { @@ -63,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); - ret = btrfs_search_slot(trans, root, &ins, &path, 0, 0); + ret = btrfs_search_slot(NULL, root, &ins, &path, 0, 0); if (ret) { - btrfs_print_tree(root, root->node); + btrfs_print_tree(root, root->node, 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, - 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); + 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; @@ -94,10 +130,18 @@ int main(int ac, char **av) { BUG(); tree_size--; } - btrfs_release_path(root, &path); + btrfs_release_path(&path); } - 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); + } + 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); @@ -109,8 +153,14 @@ int main(int ac, char **av) { 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++) { @@ -119,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); - ret = btrfs_search_slot(trans, root, &ins, &path, 0, 0); + ret = btrfs_search_slot(NULL, root, &ins, &path, 0, 0); if (ret) { - btrfs_print_tree(root, root->node); + btrfs_print_tree(root, root->node, 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"); - 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); @@ -138,16 +189,17 @@ int main(int ac, char **av) { if (ret == 0) BUG(); - leaf = &path.nodes[0]->leaf; + leaf = path.nodes[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]; - 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); @@ -157,7 +209,7 @@ int main(int ac, char **av) { } tree_size--; } - btrfs_release_path(root, &path); + btrfs_release_path(&path); } /* printf("previous tree:\n"); @@ -165,12 +217,10 @@ int main(int ac, char **av) { 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("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; }