int keep_running = 1;
struct ctree_super_block super;
-static int setup_key(struct radix_tree_root *root, struct key *key, int exists)
+static int setup_key(struct radix_tree_root *root, struct btrfs_key *key,
+ int exists)
{
int num = rand();
unsigned long res[2];
static int ins_one(struct ctree_root *root, struct radix_tree_root *radix)
{
struct ctree_path path;
- struct key key;
+ struct btrfs_key key;
int ret;
char buf[128];
unsigned long oid;
static int insert_dup(struct ctree_root *root, struct radix_tree_root *radix)
{
struct ctree_path path;
- struct key key;
+ struct btrfs_key key;
int ret;
char buf[128];
init_path(&path);
static int del_one(struct ctree_root *root, struct radix_tree_root *radix)
{
struct ctree_path path;
- struct key key;
+ struct btrfs_key key;
int ret;
unsigned long *ptr;
init_path(&path);
static int lookup_item(struct ctree_root *root, struct radix_tree_root *radix)
{
struct ctree_path path;
- struct key key;
+ struct btrfs_key key;
int ret;
init_path(&path);
ret = setup_key(radix, &key, 1);
static int lookup_enoent(struct ctree_root *root, struct radix_tree_root *radix)
{
struct ctree_path path;
- struct key key;
+ struct btrfs_key key;
int ret;
init_path(&path);
ret = setup_key(radix, &key, 0);
int nr)
{
struct ctree_path path;
- struct key key;
+ struct btrfs_key key;
unsigned long found = 0;
int ret;
int slot;
static int fill_radix(struct ctree_root *root, struct radix_tree_root *radix)
{
struct ctree_path path;
- struct key key;
+ struct btrfs_key key;
unsigned long found;
int ret;
int slot;