int i;
int num;
int ret;
- int run_size = 1024;
+ int run_size = 100000;
int max_key = 100000000;
int tree_size = 0;
struct ctree_path path;
if (!ret)
tree_size++;
free(buf);
+
}
- write_ctree_super(root, &super);
- close_ctree(root);
+ close_ctree(root, &super);
root = open_ctree("dbfile", &super);
printf("starting search\n");
}
release_path(root, &path);
}
- write_ctree_super(root, &super);
- close_ctree(root);
+ close_ctree(root, &super);
root = open_ctree("dbfile", &super);
printf("node %p level %d total ptrs %d free spc %lu\n", root->node,
node_level(root->node->node.header.flags),
}
release_path(root, &path);
}
- write_ctree_super(root, &super);
- close_ctree(root);
+ close_ctree(root, &super);
root = open_ctree("dbfile", &super);
srand(128);
for (i = 0; i < run_size; i++) {
tree_size++;
free(buf);
}
- write_ctree_super(root, &super);
- close_ctree(root);
+ close_ctree(root, &super);
root = open_ctree("dbfile", &super);
srand(128);
printf("starting search2\n");
}
release_path(root, &path);
}
+ /*
+ printf("previous tree:\n");
+ print_tree(root, root->commit_root);
+ printf("map before commit\n");
+ print_tree(root->extent_root, root->extent_root->node);
+ */
+ commit_transaction(root, &super);
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");
print_tree(root->extent_root, root->extent_root->node);
- write_ctree_super(root, &super);
- close_ctree(root);
+ close_ctree(root, &super);
return 0;
}