btrfs-progs/ctree.h

215 lines
5.6 KiB
C
Raw Normal View History

2007-02-02 14:18:22 +00:00
#ifndef __CTREE__
#define __CTREE__
2007-03-01 23:59:40 +00:00
#include "list.h"
#define CTREE_BLOCKSIZE 1024
2007-02-02 14:18:22 +00:00
/*
* the key defines the order in the tree, and so it also defines (optimal)
* block layout. objectid corresonds to the inode number. The flags
* tells us things about the object, and is a kind of stream selector.
* so for a given inode, keys with flags of 1 might refer to the inode
* data, flags of 2 may point to file data in the btree and flags == 3
* may point to extents.
*
* offset is the starting byte offset for this key in the stream.
*/
2007-02-02 14:18:22 +00:00
struct key {
u64 objectid;
u32 flags;
u64 offset;
} __attribute__ ((__packed__));
/*
* every tree block (leaf or node) starts with this header.
*/
2007-02-02 14:18:22 +00:00
struct header {
u64 fsid[2]; /* FS specific uuid */
u64 blocknr; /* which block this node is supposed to live in */
u64 parentid; /* objectid of the tree root */
2007-02-02 14:18:22 +00:00
u32 csum;
u32 ham;
u16 nritems;
u16 flags;
/* generation flags to be added */
2007-02-02 14:18:22 +00:00
} __attribute__ ((__packed__));
2007-03-12 16:01:18 +00:00
#define MAX_LEVEL 8
2007-02-02 14:18:22 +00:00
#define NODEPTRS_PER_BLOCK ((CTREE_BLOCKSIZE - sizeof(struct header)) / \
(sizeof(struct key) + sizeof(u64)))
struct tree_buffer;
2007-02-20 21:40:44 +00:00
/*
* in ram representation of the tree. extent_root is used for all allocations
* and for the extent tree extent_root root. current_insert is used
* only for the extent tree.
*/
2007-02-02 14:18:22 +00:00
struct ctree_root {
struct tree_buffer *node;
2007-03-07 01:08:01 +00:00
struct tree_buffer *commit_root;
2007-02-20 21:40:44 +00:00
struct ctree_root *extent_root;
struct key current_insert;
2007-03-07 21:15:30 +00:00
struct key last_insert;
2007-02-02 14:18:22 +00:00
int fp;
struct radix_tree_root cache_radix;
2007-03-07 01:08:01 +00:00
struct radix_tree_root pinned_radix;
2007-03-01 23:59:40 +00:00
struct list_head trans;
struct list_head cache;
int cache_size;
2007-02-02 14:18:22 +00:00
};
/*
* describes a tree on disk
*/
2007-02-20 21:40:44 +00:00
struct ctree_root_info {
u64 fsid[2]; /* FS specific uuid */
u64 blocknr; /* blocknr of this block */
u64 objectid; /* inode number of this root */
u64 tree_root; /* the tree root block */
2007-02-20 21:40:44 +00:00
u32 csum;
u32 ham;
u64 snapuuid[2]; /* root specific uuid */
} __attribute__ ((__packed__));
/*
* the super block basically lists the main trees of the FS
* it currently lacks any block count etc etc
*/
2007-02-21 22:04:57 +00:00
struct ctree_super_block {
struct ctree_root_info root_info;
struct ctree_root_info extent_info;
} __attribute__ ((__packed__));
/*
* A leaf is full of items. The exact type of item is defined by
* the key flags parameter. offset and size tell us where to find
* the item in the leaf (relative to the start of the data area)
*/
2007-02-02 14:18:22 +00:00
struct item {
struct key key;
u16 offset;
u16 size;
} __attribute__ ((__packed__));
/*
* leaves have an item area and a data area:
* [item0, item1....itemN] [free space] [dataN...data1, data0]
*
* The data is separate from the items to get the keys closer together
* during searches.
*/
2007-02-02 14:18:22 +00:00
#define LEAF_DATA_SIZE (CTREE_BLOCKSIZE - sizeof(struct header))
struct leaf {
struct header header;
union {
struct item items[LEAF_DATA_SIZE/sizeof(struct item)];
u8 data[CTREE_BLOCKSIZE-sizeof(struct header)];
};
} __attribute__ ((__packed__));
/*
* all non-leaf blocks are nodes, they hold only keys and pointers to
* other blocks
*/
2007-02-02 14:18:22 +00:00
struct node {
struct header header;
struct key keys[NODEPTRS_PER_BLOCK];
u64 blockptrs[NODEPTRS_PER_BLOCK];
} __attribute__ ((__packed__));
/*
* items in the extent btree are used to record the objectid of the
* owner of the block and the number of references
*/
2007-02-20 21:40:44 +00:00
struct extent_item {
u32 refs;
u64 owner;
} __attribute__ ((__packed__));
/*
* ctree_paths remember the path taken from the root down to the leaf.
* level 0 is always the leaf, and nodes[1...MAX_LEVEL] will point
* to any other levels that are present.
*
* The slots array records the index of the item or block pointer
* used while walking the tree.
*/
2007-02-02 14:18:22 +00:00
struct ctree_path {
struct tree_buffer *nodes[MAX_LEVEL];
int slots[MAX_LEVEL];
};
2007-02-24 11:24:44 +00:00
2007-03-12 16:01:18 +00:00
static inline u64 btrfs_header_blocknr(struct header *h)
{
return h->blocknr;
}
static inline void btrfs_set_header_blocknr(struct header *h, u64 blocknr)
{
h->blocknr = blocknr;
}
static inline u64 btrfs_header_parentid(struct header *h)
{
return h->parentid;
}
static inline void btrfs_set_header_parentid(struct header *h, u64 parentid)
{
h->parentid = parentid;
}
static inline u32 btrfs_header_nritems(struct header *h)
{
return h->nritems;
}
static inline void btrfs_set_header_nritems(struct header *h, u32 val)
{
h->nritems = val;
}
static inline u32 btrfs_header_flags(struct header *h)
{
return h->flags;
}
static inline void btrfs_set_header_flags(struct header *h, u32 val)
{
h->flags = val;
}
static inline int btrfs_header_level(struct header *h)
{
return btrfs_header_flags(h) & (MAX_LEVEL - 1);
}
static inline void btrfs_set_header_level(struct header *h, int level)
{
u32 flags;
BUG_ON(level > MAX_LEVEL);
flags = btrfs_header_flags(h) & ~(MAX_LEVEL - 1);
btrfs_set_header_flags(h, flags | level);
}
static inline int btrfs_is_leaf(struct node *n)
{
return (btrfs_header_level(&n->header) == 0);
}
2007-02-24 11:24:44 +00:00
struct tree_buffer *alloc_free_block(struct ctree_root *root);
2007-03-02 21:08:05 +00:00
int btrfs_inc_ref(struct ctree_root *root, struct tree_buffer *buf);
2007-02-24 11:24:44 +00:00
int free_extent(struct ctree_root *root, u64 blocknr, u64 num_blocks);
2007-03-02 21:08:05 +00:00
int search_slot(struct ctree_root *root, struct key *key, struct ctree_path *p, int ins_len, int cow);
2007-02-24 11:24:44 +00:00
void release_path(struct ctree_root *root, struct ctree_path *p);
void init_path(struct ctree_path *p);
int del_item(struct ctree_root *root, struct ctree_path *path);
int insert_item(struct ctree_root *root, struct key *key, void *data, int data_size);
int next_leaf(struct ctree_root *root, struct ctree_path *path);
int leaf_free_space(struct leaf *leaf);
2007-03-07 01:08:01 +00:00
int btrfs_drop_snapshot(struct ctree_root *root, struct tree_buffer *snap);
int btrfs_finish_extent_commit(struct ctree_root *root);
2007-02-02 14:18:22 +00:00
#endif