2007-01-26 21:51:26 +01:00
|
|
|
#include <stdio.h>
|
|
|
|
#include <stdlib.h>
|
|
|
|
#include "kerncompat.h"
|
2007-02-02 15:18:22 +01:00
|
|
|
#include "radix-tree.h"
|
|
|
|
#include "ctree.h"
|
|
|
|
#include "disk-io.h"
|
2007-02-24 12:24:44 +01:00
|
|
|
#include "print-tree.h"
|
2007-02-23 14:38:36 +01:00
|
|
|
|
2007-02-22 17:39:13 +01:00
|
|
|
int split_node(struct ctree_root *root, struct ctree_path *path, int level);
|
|
|
|
int split_leaf(struct ctree_root *root, struct ctree_path *path, int data_size);
|
2007-02-24 12:24:44 +01:00
|
|
|
int push_node_left(struct ctree_root *root, struct ctree_path *path, int level);
|
|
|
|
int push_node_right(struct ctree_root *root,
|
|
|
|
struct ctree_path *path, int level);
|
|
|
|
int del_ptr(struct ctree_root *root, struct ctree_path *path, int level);
|
2007-02-20 22:40:44 +01:00
|
|
|
|
2007-02-24 12:24:44 +01:00
|
|
|
inline void init_path(struct ctree_path *p)
|
2007-01-26 21:51:26 +01:00
|
|
|
{
|
|
|
|
memset(p, 0, sizeof(*p));
|
|
|
|
}
|
|
|
|
|
2007-02-24 12:24:44 +01:00
|
|
|
void release_path(struct ctree_root *root, struct ctree_path *p)
|
2007-02-02 15:18:22 +01:00
|
|
|
{
|
|
|
|
int i;
|
|
|
|
for (i = 0; i < MAX_LEVEL; i++) {
|
|
|
|
if (!p->nodes[i])
|
|
|
|
break;
|
|
|
|
tree_block_release(root, p->nodes[i]);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2007-02-02 17:05:29 +01:00
|
|
|
/*
|
|
|
|
* The leaf data grows from end-to-front in the node.
|
|
|
|
* this returns the address of the start of the last item,
|
|
|
|
* which is the stop of the leaf data stack
|
|
|
|
*/
|
2007-01-26 21:51:26 +01:00
|
|
|
static inline unsigned int leaf_data_end(struct leaf *leaf)
|
|
|
|
{
|
|
|
|
unsigned int nr = leaf->header.nritems;
|
|
|
|
if (nr == 0)
|
2007-02-20 22:40:44 +01:00
|
|
|
return sizeof(leaf->data);
|
2007-01-26 21:51:26 +01:00
|
|
|
return leaf->items[nr-1].offset;
|
|
|
|
}
|
|
|
|
|
2007-02-02 17:05:29 +01:00
|
|
|
/*
|
|
|
|
* The space between the end of the leaf items and
|
|
|
|
* the start of the leaf data. IOW, how much room
|
|
|
|
* the leaf has left for both items and data
|
|
|
|
*/
|
2007-02-24 12:24:44 +01:00
|
|
|
int leaf_free_space(struct leaf *leaf)
|
2007-01-26 21:51:26 +01:00
|
|
|
{
|
|
|
|
int data_end = leaf_data_end(leaf);
|
|
|
|
int nritems = leaf->header.nritems;
|
|
|
|
char *items_end = (char *)(leaf->items + nritems + 1);
|
|
|
|
return (char *)(leaf->data + data_end) - (char *)items_end;
|
|
|
|
}
|
|
|
|
|
2007-02-02 17:05:29 +01:00
|
|
|
/*
|
|
|
|
* compare two keys in a memcmp fashion
|
|
|
|
*/
|
2007-01-26 21:51:26 +01:00
|
|
|
int comp_keys(struct key *k1, struct key *k2)
|
|
|
|
{
|
|
|
|
if (k1->objectid > k2->objectid)
|
|
|
|
return 1;
|
|
|
|
if (k1->objectid < k2->objectid)
|
|
|
|
return -1;
|
|
|
|
if (k1->flags > k2->flags)
|
|
|
|
return 1;
|
|
|
|
if (k1->flags < k2->flags)
|
|
|
|
return -1;
|
|
|
|
if (k1->offset > k2->offset)
|
|
|
|
return 1;
|
|
|
|
if (k1->offset < k2->offset)
|
|
|
|
return -1;
|
|
|
|
return 0;
|
|
|
|
}
|
2007-02-02 17:05:29 +01:00
|
|
|
|
|
|
|
/*
|
|
|
|
* search for key in the array p. items p are item_size apart
|
|
|
|
* and there are 'max' items in p
|
|
|
|
* the slot in the array is returned via slot, and it points to
|
|
|
|
* the place where you would insert key if it is not found in
|
|
|
|
* the array.
|
|
|
|
*
|
|
|
|
* slot may point to max if the key is bigger than all of the keys
|
|
|
|
*/
|
2007-01-26 21:51:26 +01:00
|
|
|
int generic_bin_search(char *p, int item_size, struct key *key,
|
|
|
|
int max, int *slot)
|
|
|
|
{
|
|
|
|
int low = 0;
|
|
|
|
int high = max;
|
|
|
|
int mid;
|
|
|
|
int ret;
|
|
|
|
struct key *tmp;
|
|
|
|
|
|
|
|
while(low < high) {
|
|
|
|
mid = (low + high) / 2;
|
|
|
|
tmp = (struct key *)(p + mid * item_size);
|
|
|
|
ret = comp_keys(tmp, key);
|
|
|
|
|
|
|
|
if (ret < 0)
|
|
|
|
low = mid + 1;
|
|
|
|
else if (ret > 0)
|
|
|
|
high = mid;
|
|
|
|
else {
|
|
|
|
*slot = mid;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
*slot = low;
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
int bin_search(struct node *c, struct key *key, int *slot)
|
|
|
|
{
|
|
|
|
if (is_leaf(c->header.flags)) {
|
|
|
|
struct leaf *l = (struct leaf *)c;
|
|
|
|
return generic_bin_search((void *)l->items, sizeof(struct item),
|
|
|
|
key, c->header.nritems, slot);
|
|
|
|
} else {
|
|
|
|
return generic_bin_search((void *)c->keys, sizeof(struct key),
|
|
|
|
key, c->header.nritems, slot);
|
|
|
|
}
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
2007-02-02 17:05:29 +01:00
|
|
|
/*
|
|
|
|
* look for key in the tree. path is filled in with nodes along the way
|
|
|
|
* if key is found, we return zero and you can find the item in the leaf
|
|
|
|
* level of the path (level 0)
|
|
|
|
*
|
|
|
|
* If the key isn't found, the path points to the slot where it should
|
|
|
|
* be inserted.
|
|
|
|
*/
|
2007-02-24 12:24:44 +01:00
|
|
|
int search_slot(struct ctree_root *root, struct key *key,
|
|
|
|
struct ctree_path *p, int ins_len)
|
2007-01-26 21:51:26 +01:00
|
|
|
{
|
2007-02-02 15:18:22 +01:00
|
|
|
struct tree_buffer *b = root->node;
|
|
|
|
struct node *c;
|
2007-01-26 21:51:26 +01:00
|
|
|
int slot;
|
|
|
|
int ret;
|
|
|
|
int level;
|
2007-02-22 17:39:13 +01:00
|
|
|
|
2007-02-02 15:18:22 +01:00
|
|
|
b->count++;
|
|
|
|
while (b) {
|
|
|
|
c = &b->node;
|
2007-01-26 21:51:26 +01:00
|
|
|
level = node_level(c->header.flags);
|
2007-02-02 15:18:22 +01:00
|
|
|
p->nodes[level] = b;
|
2007-01-26 21:51:26 +01:00
|
|
|
ret = bin_search(c, key, &slot);
|
|
|
|
if (!is_leaf(c->header.flags)) {
|
|
|
|
if (ret && slot > 0)
|
|
|
|
slot -= 1;
|
|
|
|
p->slots[level] = slot;
|
2007-02-24 12:24:44 +01:00
|
|
|
if (ins_len > 0 &&
|
|
|
|
c->header.nritems == NODEPTRS_PER_BLOCK) {
|
2007-02-22 17:39:13 +01:00
|
|
|
int sret = split_node(root, p, level);
|
|
|
|
BUG_ON(sret > 0);
|
|
|
|
if (sret)
|
|
|
|
return sret;
|
|
|
|
b = p->nodes[level];
|
|
|
|
c = &b->node;
|
|
|
|
slot = p->slots[level];
|
2007-02-24 12:24:44 +01:00
|
|
|
} else if (ins_len < 0 &&
|
|
|
|
c->header.nritems <= NODEPTRS_PER_BLOCK/4) {
|
|
|
|
u64 blocknr = b->blocknr;
|
|
|
|
slot = p->slots[level +1];
|
|
|
|
b->count++;
|
|
|
|
if (push_node_left(root, p, level))
|
|
|
|
push_node_right(root, p, level);
|
|
|
|
if (c->header.nritems == 0 &&
|
|
|
|
level < MAX_LEVEL - 1 &&
|
|
|
|
p->nodes[level + 1]) {
|
|
|
|
int tslot = p->slots[level + 1];
|
|
|
|
|
|
|
|
p->slots[level + 1] = slot;
|
|
|
|
del_ptr(root, p, level + 1);
|
|
|
|
p->slots[level + 1] = tslot;
|
|
|
|
tree_block_release(root, b);
|
|
|
|
free_extent(root, blocknr, 1);
|
|
|
|
} else {
|
|
|
|
tree_block_release(root, b);
|
|
|
|
}
|
|
|
|
b = p->nodes[level];
|
|
|
|
c = &b->node;
|
|
|
|
slot = p->slots[level];
|
2007-02-22 17:39:13 +01:00
|
|
|
}
|
2007-02-02 15:18:22 +01:00
|
|
|
b = read_tree_block(root, c->blockptrs[slot]);
|
2007-01-26 21:51:26 +01:00
|
|
|
continue;
|
|
|
|
} else {
|
2007-02-22 17:39:13 +01:00
|
|
|
struct leaf *l = (struct leaf *)c;
|
2007-01-26 21:51:26 +01:00
|
|
|
p->slots[level] = slot;
|
2007-02-24 12:24:44 +01:00
|
|
|
if (ins_len > 0 && leaf_free_space(l) <
|
|
|
|
sizeof(struct item) + ins_len) {
|
2007-02-22 17:39:13 +01:00
|
|
|
int sret = split_leaf(root, p, ins_len);
|
|
|
|
BUG_ON(sret > 0);
|
|
|
|
if (sret)
|
|
|
|
return sret;
|
|
|
|
}
|
2007-01-26 21:51:26 +01:00
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
2007-02-02 17:05:29 +01:00
|
|
|
/*
|
|
|
|
* adjust the pointers going up the tree, starting at level
|
|
|
|
* making sure the right key of each node is points to 'key'.
|
|
|
|
* This is used after shifting pointers to the left, so it stops
|
|
|
|
* fixing up pointers when a given leaf/node is not in slot 0 of the
|
|
|
|
* higher levels
|
|
|
|
*/
|
2007-02-02 15:18:22 +01:00
|
|
|
static void fixup_low_keys(struct ctree_root *root,
|
|
|
|
struct ctree_path *path, struct key *key,
|
|
|
|
int level)
|
2007-01-26 21:51:26 +01:00
|
|
|
{
|
|
|
|
int i;
|
|
|
|
for (i = level; i < MAX_LEVEL; i++) {
|
2007-02-02 15:18:22 +01:00
|
|
|
struct node *t;
|
2007-01-26 21:51:26 +01:00
|
|
|
int tslot = path->slots[i];
|
2007-02-02 15:18:22 +01:00
|
|
|
if (!path->nodes[i])
|
2007-01-26 21:51:26 +01:00
|
|
|
break;
|
2007-02-02 15:18:22 +01:00
|
|
|
t = &path->nodes[i]->node;
|
2007-01-26 21:51:26 +01:00
|
|
|
memcpy(t->keys + tslot, key, sizeof(*key));
|
2007-02-02 15:18:22 +01:00
|
|
|
write_tree_block(root, path->nodes[i]);
|
2007-01-26 21:51:26 +01:00
|
|
|
if (tslot != 0)
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2007-02-02 17:05:29 +01:00
|
|
|
/*
|
|
|
|
* try to push data from one node into the next node left in the
|
|
|
|
* tree. The src node is found at specified level in the path.
|
|
|
|
* If some bytes were pushed, return 0, otherwise return 1.
|
|
|
|
*
|
|
|
|
* Lower nodes/leaves in the path are not touched, higher nodes may
|
|
|
|
* be modified to reflect the push.
|
|
|
|
*
|
|
|
|
* The path is altered to reflect the push.
|
|
|
|
*/
|
2007-01-26 21:51:26 +01:00
|
|
|
int push_node_left(struct ctree_root *root, struct ctree_path *path, int level)
|
|
|
|
{
|
|
|
|
int slot;
|
|
|
|
struct node *left;
|
|
|
|
struct node *right;
|
|
|
|
int push_items = 0;
|
|
|
|
int left_nritems;
|
|
|
|
int right_nritems;
|
2007-02-02 15:18:22 +01:00
|
|
|
struct tree_buffer *t;
|
|
|
|
struct tree_buffer *right_buf;
|
2007-01-26 21:51:26 +01:00
|
|
|
|
|
|
|
if (level == MAX_LEVEL - 1 || path->nodes[level + 1] == 0)
|
|
|
|
return 1;
|
|
|
|
slot = path->slots[level + 1];
|
|
|
|
if (slot == 0)
|
|
|
|
return 1;
|
|
|
|
|
2007-02-02 15:18:22 +01:00
|
|
|
t = read_tree_block(root,
|
|
|
|
path->nodes[level + 1]->node.blockptrs[slot - 1]);
|
|
|
|
left = &t->node;
|
|
|
|
right_buf = path->nodes[level];
|
|
|
|
right = &right_buf->node;
|
2007-01-26 21:51:26 +01:00
|
|
|
left_nritems = left->header.nritems;
|
|
|
|
right_nritems = right->header.nritems;
|
|
|
|
push_items = NODEPTRS_PER_BLOCK - (left_nritems + 1);
|
2007-02-02 15:18:22 +01:00
|
|
|
if (push_items <= 0) {
|
|
|
|
tree_block_release(root, t);
|
2007-01-26 21:51:26 +01:00
|
|
|
return 1;
|
2007-02-02 15:18:22 +01:00
|
|
|
}
|
2007-01-26 21:51:26 +01:00
|
|
|
|
|
|
|
if (right_nritems < push_items)
|
|
|
|
push_items = right_nritems;
|
|
|
|
memcpy(left->keys + left_nritems, right->keys,
|
|
|
|
push_items * sizeof(struct key));
|
|
|
|
memcpy(left->blockptrs + left_nritems, right->blockptrs,
|
|
|
|
push_items * sizeof(u64));
|
|
|
|
memmove(right->keys, right->keys + push_items,
|
|
|
|
(right_nritems - push_items) * sizeof(struct key));
|
|
|
|
memmove(right->blockptrs, right->blockptrs + push_items,
|
|
|
|
(right_nritems - push_items) * sizeof(u64));
|
|
|
|
right->header.nritems -= push_items;
|
|
|
|
left->header.nritems += push_items;
|
|
|
|
|
|
|
|
/* adjust the pointers going up the tree */
|
2007-02-02 15:18:22 +01:00
|
|
|
fixup_low_keys(root, path, right->keys, level + 1);
|
|
|
|
|
|
|
|
write_tree_block(root, t);
|
|
|
|
write_tree_block(root, right_buf);
|
2007-01-26 21:51:26 +01:00
|
|
|
|
|
|
|
/* then fixup the leaf pointer in the path */
|
|
|
|
if (path->slots[level] < push_items) {
|
|
|
|
path->slots[level] += left_nritems;
|
2007-02-02 15:18:22 +01:00
|
|
|
tree_block_release(root, path->nodes[level]);
|
|
|
|
path->nodes[level] = t;
|
2007-01-26 21:51:26 +01:00
|
|
|
path->slots[level + 1] -= 1;
|
|
|
|
} else {
|
|
|
|
path->slots[level] -= push_items;
|
2007-02-02 15:18:22 +01:00
|
|
|
tree_block_release(root, t);
|
2007-01-26 21:51:26 +01:00
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2007-02-02 17:05:29 +01:00
|
|
|
/*
|
|
|
|
* try to push data from one node into the next node right in the
|
|
|
|
* tree. The src node is found at specified level in the path.
|
|
|
|
* If some bytes were pushed, return 0, otherwise return 1.
|
|
|
|
*
|
|
|
|
* Lower nodes/leaves in the path are not touched, higher nodes may
|
|
|
|
* be modified to reflect the push.
|
|
|
|
*
|
|
|
|
* The path is altered to reflect the push.
|
|
|
|
*/
|
2007-01-26 21:51:26 +01:00
|
|
|
int push_node_right(struct ctree_root *root, struct ctree_path *path, int level)
|
|
|
|
{
|
|
|
|
int slot;
|
2007-02-02 15:18:22 +01:00
|
|
|
struct tree_buffer *t;
|
|
|
|
struct tree_buffer *src_buffer;
|
2007-01-26 21:51:26 +01:00
|
|
|
struct node *dst;
|
|
|
|
struct node *src;
|
|
|
|
int push_items = 0;
|
|
|
|
int dst_nritems;
|
|
|
|
int src_nritems;
|
|
|
|
|
2007-02-02 17:05:29 +01:00
|
|
|
/* can't push from the root */
|
2007-01-26 21:51:26 +01:00
|
|
|
if (level == MAX_LEVEL - 1 || path->nodes[level + 1] == 0)
|
|
|
|
return 1;
|
2007-02-02 17:05:29 +01:00
|
|
|
|
|
|
|
/* only try to push inside the node higher up */
|
2007-01-26 21:51:26 +01:00
|
|
|
slot = path->slots[level + 1];
|
|
|
|
if (slot == NODEPTRS_PER_BLOCK - 1)
|
|
|
|
return 1;
|
|
|
|
|
2007-02-02 15:18:22 +01:00
|
|
|
if (slot >= path->nodes[level + 1]->node.header.nritems -1)
|
2007-01-26 21:51:26 +01:00
|
|
|
return 1;
|
|
|
|
|
2007-02-02 15:18:22 +01:00
|
|
|
t = read_tree_block(root,
|
|
|
|
path->nodes[level + 1]->node.blockptrs[slot + 1]);
|
|
|
|
dst = &t->node;
|
|
|
|
src_buffer = path->nodes[level];
|
|
|
|
src = &src_buffer->node;
|
2007-01-26 21:51:26 +01:00
|
|
|
dst_nritems = dst->header.nritems;
|
|
|
|
src_nritems = src->header.nritems;
|
|
|
|
push_items = NODEPTRS_PER_BLOCK - (dst_nritems + 1);
|
2007-02-02 15:18:22 +01:00
|
|
|
if (push_items <= 0) {
|
|
|
|
tree_block_release(root, t);
|
2007-01-26 21:51:26 +01:00
|
|
|
return 1;
|
2007-02-02 15:18:22 +01:00
|
|
|
}
|
2007-01-26 21:51:26 +01:00
|
|
|
|
|
|
|
if (src_nritems < push_items)
|
|
|
|
push_items = src_nritems;
|
|
|
|
memmove(dst->keys + push_items, dst->keys,
|
|
|
|
dst_nritems * sizeof(struct key));
|
|
|
|
memcpy(dst->keys, src->keys + src_nritems - push_items,
|
|
|
|
push_items * sizeof(struct key));
|
|
|
|
|
|
|
|
memmove(dst->blockptrs + push_items, dst->blockptrs,
|
|
|
|
dst_nritems * sizeof(u64));
|
|
|
|
memcpy(dst->blockptrs, src->blockptrs + src_nritems - push_items,
|
|
|
|
push_items * sizeof(u64));
|
|
|
|
|
|
|
|
src->header.nritems -= push_items;
|
|
|
|
dst->header.nritems += push_items;
|
|
|
|
|
|
|
|
/* adjust the pointers going up the tree */
|
2007-02-02 15:18:22 +01:00
|
|
|
memcpy(path->nodes[level + 1]->node.keys + path->slots[level + 1] + 1,
|
2007-01-26 21:51:26 +01:00
|
|
|
dst->keys, sizeof(struct key));
|
2007-02-02 15:18:22 +01:00
|
|
|
|
|
|
|
write_tree_block(root, path->nodes[level + 1]);
|
|
|
|
write_tree_block(root, t);
|
|
|
|
write_tree_block(root, src_buffer);
|
|
|
|
|
2007-02-02 17:05:29 +01:00
|
|
|
/* then fixup the pointers in the path */
|
2007-01-26 21:51:26 +01:00
|
|
|
if (path->slots[level] >= src->header.nritems) {
|
|
|
|
path->slots[level] -= src->header.nritems;
|
2007-02-02 15:18:22 +01:00
|
|
|
tree_block_release(root, path->nodes[level]);
|
|
|
|
path->nodes[level] = t;
|
2007-01-26 21:51:26 +01:00
|
|
|
path->slots[level + 1] += 1;
|
2007-02-02 15:18:22 +01:00
|
|
|
} else {
|
|
|
|
tree_block_release(root, t);
|
2007-01-26 21:51:26 +01:00
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2007-02-24 12:24:44 +01:00
|
|
|
static int insert_new_root(struct ctree_root *root,
|
|
|
|
struct ctree_path *path, int level)
|
2007-02-22 17:39:13 +01:00
|
|
|
{
|
|
|
|
struct tree_buffer *t;
|
|
|
|
struct node *lower;
|
|
|
|
struct node *c;
|
|
|
|
struct key *lower_key;
|
|
|
|
|
|
|
|
BUG_ON(path->nodes[level]);
|
|
|
|
BUG_ON(path->nodes[level-1] != root->node);
|
|
|
|
|
|
|
|
t = alloc_free_block(root);
|
|
|
|
c = &t->node;
|
|
|
|
memset(c, 0, sizeof(c));
|
|
|
|
c->header.nritems = 1;
|
|
|
|
c->header.flags = node_level(level);
|
|
|
|
c->header.blocknr = t->blocknr;
|
|
|
|
c->header.parentid = root->node->node.header.parentid;
|
|
|
|
lower = &path->nodes[level-1]->node;
|
|
|
|
if (is_leaf(lower->header.flags))
|
|
|
|
lower_key = &((struct leaf *)lower)->items[0].key;
|
|
|
|
else
|
|
|
|
lower_key = lower->keys;
|
|
|
|
memcpy(c->keys, lower_key, sizeof(struct key));
|
|
|
|
c->blockptrs[0] = path->nodes[level-1]->blocknr;
|
|
|
|
/* the super has an extra ref to root->node */
|
|
|
|
tree_block_release(root, root->node);
|
|
|
|
root->node = t;
|
|
|
|
t->count++;
|
|
|
|
write_tree_block(root, t);
|
|
|
|
path->nodes[level] = t;
|
|
|
|
path->slots[level] = 0;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2007-02-02 17:05:29 +01:00
|
|
|
/*
|
|
|
|
* worker function to insert a single pointer in a node.
|
|
|
|
* the node should have enough room for the pointer already
|
|
|
|
* slot and level indicate where you want the key to go, and
|
|
|
|
* blocknr is the block the key points to.
|
|
|
|
*/
|
2007-02-22 17:39:13 +01:00
|
|
|
int insert_ptr(struct ctree_root *root,
|
2007-02-02 17:05:29 +01:00
|
|
|
struct ctree_path *path, struct key *key,
|
|
|
|
u64 blocknr, int slot, int level)
|
|
|
|
{
|
|
|
|
struct node *lower;
|
|
|
|
int nritems;
|
2007-02-22 17:39:13 +01:00
|
|
|
|
|
|
|
BUG_ON(!path->nodes[level]);
|
2007-02-02 17:05:29 +01:00
|
|
|
lower = &path->nodes[level]->node;
|
|
|
|
nritems = lower->header.nritems;
|
|
|
|
if (slot > nritems)
|
|
|
|
BUG();
|
|
|
|
if (nritems == NODEPTRS_PER_BLOCK)
|
|
|
|
BUG();
|
|
|
|
if (slot != nritems) {
|
|
|
|
memmove(lower->keys + slot + 1, lower->keys + slot,
|
|
|
|
(nritems - slot) * sizeof(struct key));
|
|
|
|
memmove(lower->blockptrs + slot + 1, lower->blockptrs + slot,
|
|
|
|
(nritems - slot) * sizeof(u64));
|
|
|
|
}
|
|
|
|
memcpy(lower->keys + slot, key, sizeof(struct key));
|
|
|
|
lower->blockptrs[slot] = blocknr;
|
|
|
|
lower->header.nritems++;
|
|
|
|
if (lower->keys[1].objectid == 0)
|
|
|
|
BUG();
|
|
|
|
write_tree_block(root, path->nodes[level]);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2007-02-22 17:39:13 +01:00
|
|
|
int split_node(struct ctree_root *root, struct ctree_path *path, int level)
|
2007-01-26 21:51:26 +01:00
|
|
|
{
|
2007-02-22 17:39:13 +01:00
|
|
|
struct tree_buffer *t;
|
|
|
|
struct node *c;
|
|
|
|
struct tree_buffer *split_buffer;
|
|
|
|
struct node *split;
|
2007-01-26 21:51:26 +01:00
|
|
|
int mid;
|
2007-02-22 17:39:13 +01:00
|
|
|
int ret;
|
2007-02-02 15:18:22 +01:00
|
|
|
|
2007-02-22 17:39:13 +01:00
|
|
|
ret = push_node_left(root, path, level);
|
|
|
|
if (!ret)
|
|
|
|
return 0;
|
|
|
|
ret = push_node_right(root, path, level);
|
|
|
|
if (!ret)
|
|
|
|
return 0;
|
|
|
|
t = path->nodes[level];
|
|
|
|
c = &t->node;
|
|
|
|
if (t == root->node) {
|
|
|
|
/* trying to split the root, lets make a new one */
|
|
|
|
ret = insert_new_root(root, path, level + 1);
|
|
|
|
if (ret)
|
|
|
|
return ret;
|
2007-01-26 21:51:26 +01:00
|
|
|
}
|
2007-02-22 17:39:13 +01:00
|
|
|
split_buffer = alloc_free_block(root);
|
|
|
|
split = &split_buffer->node;
|
|
|
|
split->header.flags = c->header.flags;
|
|
|
|
split->header.blocknr = split_buffer->blocknr;
|
|
|
|
split->header.parentid = root->node->node.header.parentid;
|
|
|
|
mid = (c->header.nritems + 1) / 2;
|
|
|
|
memcpy(split->keys, c->keys + mid,
|
|
|
|
(c->header.nritems - mid) * sizeof(struct key));
|
|
|
|
memcpy(split->blockptrs, c->blockptrs + mid,
|
|
|
|
(c->header.nritems - mid) * sizeof(u64));
|
|
|
|
split->header.nritems = c->header.nritems - mid;
|
|
|
|
c->header.nritems = mid;
|
|
|
|
write_tree_block(root, t);
|
|
|
|
write_tree_block(root, split_buffer);
|
|
|
|
insert_ptr(root, path, split->keys, split_buffer->blocknr,
|
|
|
|
path->slots[level + 1] + 1, level + 1);
|
2007-02-24 12:24:44 +01:00
|
|
|
if (path->slots[level] >= mid) {
|
2007-02-22 17:39:13 +01:00
|
|
|
path->slots[level] -= mid;
|
|
|
|
tree_block_release(root, t);
|
|
|
|
path->nodes[level] = split_buffer;
|
|
|
|
path->slots[level + 1] += 1;
|
|
|
|
} else {
|
|
|
|
tree_block_release(root, split_buffer);
|
2007-01-26 21:51:26 +01:00
|
|
|
}
|
2007-02-22 17:39:13 +01:00
|
|
|
return 0;
|
2007-01-26 21:51:26 +01:00
|
|
|
}
|
|
|
|
|
2007-02-02 17:05:29 +01:00
|
|
|
/*
|
|
|
|
* how many bytes are required to store the items in a leaf. start
|
|
|
|
* and nr indicate which items in the leaf to check. This totals up the
|
|
|
|
* space used both by the item structs and the item data
|
|
|
|
*/
|
2007-01-26 21:51:26 +01:00
|
|
|
int leaf_space_used(struct leaf *l, int start, int nr)
|
|
|
|
{
|
|
|
|
int data_len;
|
|
|
|
int end = start + nr - 1;
|
|
|
|
|
|
|
|
if (!nr)
|
|
|
|
return 0;
|
|
|
|
data_len = l->items[start].offset + l->items[start].size;
|
|
|
|
data_len = data_len - l->items[end].offset;
|
|
|
|
data_len += sizeof(struct item) * nr;
|
|
|
|
return data_len;
|
|
|
|
}
|
|
|
|
|
2007-02-02 17:05:29 +01:00
|
|
|
/*
|
|
|
|
* push some data in the path leaf to the left, trying to free up at
|
|
|
|
* least data_size bytes. returns zero if the push worked, nonzero otherwise
|
|
|
|
*/
|
2007-01-26 21:51:26 +01:00
|
|
|
int push_leaf_left(struct ctree_root *root, struct ctree_path *path,
|
|
|
|
int data_size)
|
|
|
|
{
|
2007-02-02 15:18:22 +01:00
|
|
|
struct tree_buffer *right_buf = path->nodes[0];
|
|
|
|
struct leaf *right = &right_buf->leaf;
|
|
|
|
struct tree_buffer *t;
|
2007-01-26 21:51:26 +01:00
|
|
|
struct leaf *left;
|
|
|
|
int slot;
|
|
|
|
int i;
|
|
|
|
int free_space;
|
|
|
|
int push_space = 0;
|
|
|
|
int push_items = 0;
|
|
|
|
struct item *item;
|
|
|
|
int old_left_nritems;
|
|
|
|
|
|
|
|
slot = path->slots[1];
|
|
|
|
if (slot == 0) {
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
if (!path->nodes[1]) {
|
|
|
|
return 1;
|
|
|
|
}
|
2007-02-02 15:18:22 +01:00
|
|
|
t = read_tree_block(root, path->nodes[1]->node.blockptrs[slot - 1]);
|
|
|
|
left = &t->leaf;
|
2007-01-26 21:51:26 +01:00
|
|
|
free_space = leaf_free_space(left);
|
|
|
|
if (free_space < data_size + sizeof(struct item)) {
|
2007-02-02 15:18:22 +01:00
|
|
|
tree_block_release(root, t);
|
2007-01-26 21:51:26 +01:00
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
for (i = 0; i < right->header.nritems; i++) {
|
|
|
|
item = right->items + i;
|
|
|
|
if (path->slots[0] == i)
|
|
|
|
push_space += data_size + sizeof(*item);
|
|
|
|
if (item->size + sizeof(*item) + push_space > free_space)
|
|
|
|
break;
|
|
|
|
push_items++;
|
|
|
|
push_space += item->size + sizeof(*item);
|
|
|
|
}
|
|
|
|
if (push_items == 0) {
|
2007-02-02 15:18:22 +01:00
|
|
|
tree_block_release(root, t);
|
2007-01-26 21:51:26 +01:00
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
/* push data from right to left */
|
|
|
|
memcpy(left->items + left->header.nritems,
|
|
|
|
right->items, push_items * sizeof(struct item));
|
|
|
|
push_space = LEAF_DATA_SIZE - right->items[push_items -1].offset;
|
|
|
|
memcpy(left->data + leaf_data_end(left) - push_space,
|
|
|
|
right->data + right->items[push_items - 1].offset,
|
|
|
|
push_space);
|
|
|
|
old_left_nritems = left->header.nritems;
|
2007-02-02 15:18:22 +01:00
|
|
|
BUG_ON(old_left_nritems < 0);
|
|
|
|
|
2007-01-26 21:51:26 +01:00
|
|
|
for(i = old_left_nritems; i < old_left_nritems + push_items; i++) {
|
|
|
|
left->items[i].offset -= LEAF_DATA_SIZE -
|
|
|
|
left->items[old_left_nritems -1].offset;
|
|
|
|
}
|
|
|
|
left->header.nritems += push_items;
|
|
|
|
|
|
|
|
/* fixup right node */
|
|
|
|
push_space = right->items[push_items-1].offset - leaf_data_end(right);
|
|
|
|
memmove(right->data + LEAF_DATA_SIZE - push_space, right->data +
|
|
|
|
leaf_data_end(right), push_space);
|
|
|
|
memmove(right->items, right->items + push_items,
|
|
|
|
(right->header.nritems - push_items) * sizeof(struct item));
|
|
|
|
right->header.nritems -= push_items;
|
|
|
|
push_space = LEAF_DATA_SIZE;
|
2007-02-02 15:18:22 +01:00
|
|
|
|
2007-01-26 21:51:26 +01:00
|
|
|
for (i = 0; i < right->header.nritems; i++) {
|
|
|
|
right->items[i].offset = push_space - right->items[i].size;
|
|
|
|
push_space = right->items[i].offset;
|
|
|
|
}
|
2007-02-02 15:18:22 +01:00
|
|
|
|
|
|
|
write_tree_block(root, t);
|
|
|
|
write_tree_block(root, right_buf);
|
|
|
|
|
|
|
|
fixup_low_keys(root, path, &right->items[0].key, 1);
|
2007-01-26 21:51:26 +01:00
|
|
|
|
|
|
|
/* then fixup the leaf pointer in the path */
|
|
|
|
if (path->slots[0] < push_items) {
|
|
|
|
path->slots[0] += old_left_nritems;
|
2007-02-02 15:18:22 +01:00
|
|
|
tree_block_release(root, path->nodes[0]);
|
|
|
|
path->nodes[0] = t;
|
2007-01-26 21:51:26 +01:00
|
|
|
path->slots[1] -= 1;
|
|
|
|
} else {
|
2007-02-02 15:18:22 +01:00
|
|
|
tree_block_release(root, t);
|
2007-01-26 21:51:26 +01:00
|
|
|
path->slots[0] -= push_items;
|
|
|
|
}
|
2007-02-02 15:18:22 +01:00
|
|
|
BUG_ON(path->slots[0] < 0);
|
2007-01-26 21:51:26 +01:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2007-02-02 17:05:29 +01:00
|
|
|
/*
|
|
|
|
* split the path's leaf in two, making sure there is at least data_size
|
|
|
|
* available for the resulting leaf level of the path.
|
|
|
|
*/
|
2007-01-26 21:51:26 +01:00
|
|
|
int split_leaf(struct ctree_root *root, struct ctree_path *path, int data_size)
|
|
|
|
{
|
2007-02-02 15:18:22 +01:00
|
|
|
struct tree_buffer *l_buf = path->nodes[0];
|
|
|
|
struct leaf *l = &l_buf->leaf;
|
|
|
|
int nritems;
|
|
|
|
int mid;
|
|
|
|
int slot;
|
2007-01-26 21:51:26 +01:00
|
|
|
struct leaf *right;
|
2007-02-02 15:18:22 +01:00
|
|
|
struct tree_buffer *right_buffer;
|
2007-01-26 21:51:26 +01:00
|
|
|
int space_needed = data_size + sizeof(struct item);
|
|
|
|
int data_copy_size;
|
|
|
|
int rt_data_off;
|
|
|
|
int i;
|
|
|
|
int ret;
|
|
|
|
|
|
|
|
if (push_leaf_left(root, path, data_size) == 0) {
|
2007-02-02 15:18:22 +01:00
|
|
|
l_buf = path->nodes[0];
|
|
|
|
l = &l_buf->leaf;
|
|
|
|
if (leaf_free_space(l) >= sizeof(struct item) + data_size)
|
|
|
|
return 0;
|
2007-01-26 21:51:26 +01:00
|
|
|
}
|
2007-02-22 17:39:13 +01:00
|
|
|
if (!path->nodes[1]) {
|
|
|
|
ret = insert_new_root(root, path, 1);
|
|
|
|
if (ret)
|
|
|
|
return ret;
|
|
|
|
}
|
2007-02-02 15:18:22 +01:00
|
|
|
slot = path->slots[0];
|
|
|
|
nritems = l->header.nritems;
|
|
|
|
mid = (nritems + 1)/ 2;
|
|
|
|
|
|
|
|
right_buffer = alloc_free_block(root);
|
|
|
|
BUG_ON(!right_buffer);
|
|
|
|
BUG_ON(mid == nritems);
|
|
|
|
right = &right_buffer->leaf;
|
2007-01-26 21:51:26 +01:00
|
|
|
memset(right, 0, sizeof(*right));
|
|
|
|
if (mid <= slot) {
|
|
|
|
if (leaf_space_used(l, mid, nritems - mid) + space_needed >
|
|
|
|
LEAF_DATA_SIZE)
|
|
|
|
BUG();
|
|
|
|
} else {
|
|
|
|
if (leaf_space_used(l, 0, mid + 1) + space_needed >
|
|
|
|
LEAF_DATA_SIZE)
|
|
|
|
BUG();
|
|
|
|
}
|
|
|
|
right->header.nritems = nritems - mid;
|
2007-02-02 15:18:22 +01:00
|
|
|
right->header.blocknr = right_buffer->blocknr;
|
|
|
|
right->header.flags = node_level(0);
|
2007-02-21 23:04:57 +01:00
|
|
|
right->header.parentid = root->node->node.header.parentid;
|
2007-01-26 21:51:26 +01:00
|
|
|
data_copy_size = l->items[mid].offset + l->items[mid].size -
|
|
|
|
leaf_data_end(l);
|
|
|
|
memcpy(right->items, l->items + mid,
|
|
|
|
(nritems - mid) * sizeof(struct item));
|
|
|
|
memcpy(right->data + LEAF_DATA_SIZE - data_copy_size,
|
|
|
|
l->data + leaf_data_end(l), data_copy_size);
|
|
|
|
rt_data_off = LEAF_DATA_SIZE -
|
|
|
|
(l->items[mid].offset + l->items[mid].size);
|
2007-02-02 17:05:29 +01:00
|
|
|
|
|
|
|
for (i = 0; i < right->header.nritems; i++)
|
2007-01-26 21:51:26 +01:00
|
|
|
right->items[i].offset += rt_data_off;
|
2007-02-02 17:05:29 +01:00
|
|
|
|
2007-01-26 21:51:26 +01:00
|
|
|
l->header.nritems = mid;
|
|
|
|
ret = insert_ptr(root, path, &right->items[0].key,
|
2007-02-22 17:39:13 +01:00
|
|
|
right_buffer->blocknr, path->slots[1] + 1, 1);
|
2007-02-02 15:18:22 +01:00
|
|
|
write_tree_block(root, right_buffer);
|
|
|
|
write_tree_block(root, l_buf);
|
|
|
|
|
|
|
|
BUG_ON(path->slots[0] != slot);
|
2007-01-26 21:51:26 +01:00
|
|
|
if (mid <= slot) {
|
2007-02-02 15:18:22 +01:00
|
|
|
tree_block_release(root, path->nodes[0]);
|
|
|
|
path->nodes[0] = right_buffer;
|
2007-01-26 21:51:26 +01:00
|
|
|
path->slots[0] -= mid;
|
|
|
|
path->slots[1] += 1;
|
2007-02-02 15:18:22 +01:00
|
|
|
} else
|
|
|
|
tree_block_release(root, right_buffer);
|
|
|
|
BUG_ON(path->slots[0] < 0);
|
2007-01-26 21:51:26 +01:00
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2007-02-02 17:05:29 +01:00
|
|
|
/*
|
|
|
|
* Given a key and some data, insert an item into the tree.
|
|
|
|
* This does all the path init required, making room in the tree if needed.
|
|
|
|
*/
|
2007-01-26 21:51:26 +01:00
|
|
|
int insert_item(struct ctree_root *root, struct key *key,
|
|
|
|
void *data, int data_size)
|
|
|
|
{
|
|
|
|
int ret;
|
|
|
|
int slot;
|
2007-02-02 15:18:22 +01:00
|
|
|
int slot_orig;
|
2007-01-26 21:51:26 +01:00
|
|
|
struct leaf *leaf;
|
2007-02-02 15:18:22 +01:00
|
|
|
struct tree_buffer *leaf_buf;
|
2007-01-26 21:51:26 +01:00
|
|
|
unsigned int nritems;
|
|
|
|
unsigned int data_end;
|
|
|
|
struct ctree_path path;
|
|
|
|
|
2007-02-02 17:05:29 +01:00
|
|
|
/* create a root if there isn't one */
|
2007-02-22 17:39:13 +01:00
|
|
|
if (!root->node)
|
2007-02-21 23:04:57 +01:00
|
|
|
BUG();
|
2007-01-26 21:51:26 +01:00
|
|
|
init_path(&path);
|
2007-02-22 17:39:13 +01:00
|
|
|
ret = search_slot(root, key, &path, data_size);
|
2007-02-02 15:18:22 +01:00
|
|
|
if (ret == 0) {
|
|
|
|
release_path(root, &path);
|
2007-01-26 21:51:26 +01:00
|
|
|
return -EEXIST;
|
2007-02-02 15:18:22 +01:00
|
|
|
}
|
2007-01-26 21:51:26 +01:00
|
|
|
|
2007-02-02 15:18:22 +01:00
|
|
|
slot_orig = path.slots[0];
|
|
|
|
leaf_buf = path.nodes[0];
|
|
|
|
leaf = &leaf_buf->leaf;
|
2007-02-02 17:05:29 +01:00
|
|
|
|
2007-01-26 21:51:26 +01:00
|
|
|
nritems = leaf->header.nritems;
|
|
|
|
data_end = leaf_data_end(leaf);
|
2007-02-02 15:18:22 +01:00
|
|
|
|
2007-01-26 21:51:26 +01:00
|
|
|
if (leaf_free_space(leaf) < sizeof(struct item) + data_size)
|
|
|
|
BUG();
|
|
|
|
|
|
|
|
slot = path.slots[0];
|
2007-02-02 15:18:22 +01:00
|
|
|
BUG_ON(slot < 0);
|
2007-01-26 21:51:26 +01:00
|
|
|
if (slot == 0)
|
2007-02-02 15:18:22 +01:00
|
|
|
fixup_low_keys(root, &path, key, 1);
|
2007-01-26 21:51:26 +01:00
|
|
|
if (slot != nritems) {
|
|
|
|
int i;
|
|
|
|
unsigned int old_data = leaf->items[slot].offset +
|
|
|
|
leaf->items[slot].size;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* item0..itemN ... dataN.offset..dataN.size .. data0.size
|
|
|
|
*/
|
|
|
|
/* first correct the data pointers */
|
|
|
|
for (i = slot; i < nritems; i++)
|
|
|
|
leaf->items[i].offset -= data_size;
|
|
|
|
|
|
|
|
/* shift the items */
|
|
|
|
memmove(leaf->items + slot + 1, leaf->items + slot,
|
|
|
|
(nritems - slot) * sizeof(struct item));
|
|
|
|
|
|
|
|
/* shift the data */
|
|
|
|
memmove(leaf->data + data_end - data_size, leaf->data +
|
|
|
|
data_end, old_data - data_end);
|
|
|
|
data_end = old_data;
|
|
|
|
}
|
2007-02-02 17:05:29 +01:00
|
|
|
/* copy the new data in */
|
2007-01-26 21:51:26 +01:00
|
|
|
memcpy(&leaf->items[slot].key, key, sizeof(struct key));
|
|
|
|
leaf->items[slot].offset = data_end - data_size;
|
|
|
|
leaf->items[slot].size = data_size;
|
|
|
|
memcpy(leaf->data + data_end - data_size, data, data_size);
|
|
|
|
leaf->header.nritems += 1;
|
2007-02-02 15:18:22 +01:00
|
|
|
write_tree_block(root, leaf_buf);
|
2007-01-26 21:51:26 +01:00
|
|
|
if (leaf_free_space(leaf) < 0)
|
|
|
|
BUG();
|
2007-02-02 15:18:22 +01:00
|
|
|
release_path(root, &path);
|
2007-01-26 21:51:26 +01:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2007-02-02 17:05:29 +01:00
|
|
|
/*
|
2007-02-24 12:24:44 +01:00
|
|
|
* delete the pointer from a given node.
|
2007-02-02 17:05:29 +01:00
|
|
|
*
|
|
|
|
* If the delete empties a node, the node is removed from the tree,
|
|
|
|
* continuing all the way the root if required. The root is converted into
|
|
|
|
* a leaf if all the nodes are emptied.
|
|
|
|
*/
|
2007-01-26 21:51:26 +01:00
|
|
|
int del_ptr(struct ctree_root *root, struct ctree_path *path, int level)
|
|
|
|
{
|
|
|
|
int slot;
|
2007-02-02 15:18:22 +01:00
|
|
|
struct tree_buffer *t;
|
2007-01-26 21:51:26 +01:00
|
|
|
struct node *node;
|
|
|
|
int nritems;
|
2007-02-23 14:38:36 +01:00
|
|
|
u64 blocknr;
|
2007-01-26 21:51:26 +01:00
|
|
|
|
|
|
|
while(1) {
|
2007-02-02 15:18:22 +01:00
|
|
|
t = path->nodes[level];
|
|
|
|
if (!t)
|
2007-01-26 21:51:26 +01:00
|
|
|
break;
|
2007-02-02 15:18:22 +01:00
|
|
|
node = &t->node;
|
2007-01-26 21:51:26 +01:00
|
|
|
slot = path->slots[level];
|
|
|
|
nritems = node->header.nritems;
|
|
|
|
|
|
|
|
if (slot != nritems -1) {
|
|
|
|
memmove(node->keys + slot, node->keys + slot + 1,
|
|
|
|
sizeof(struct key) * (nritems - slot - 1));
|
|
|
|
memmove(node->blockptrs + slot,
|
|
|
|
node->blockptrs + slot + 1,
|
|
|
|
sizeof(u64) * (nritems - slot - 1));
|
|
|
|
}
|
|
|
|
node->header.nritems--;
|
2007-02-02 15:18:22 +01:00
|
|
|
write_tree_block(root, t);
|
2007-02-23 14:38:36 +01:00
|
|
|
blocknr = t->blocknr;
|
2007-01-26 21:51:26 +01:00
|
|
|
if (node->header.nritems != 0) {
|
|
|
|
if (slot == 0)
|
2007-02-02 15:18:22 +01:00
|
|
|
fixup_low_keys(root, path, node->keys,
|
|
|
|
level + 1);
|
2007-02-24 12:24:44 +01:00
|
|
|
break;
|
2007-01-26 21:51:26 +01:00
|
|
|
}
|
2007-02-02 15:18:22 +01:00
|
|
|
if (t == root->node) {
|
|
|
|
/* just turn the root into a leaf and break */
|
|
|
|
root->node->node.header.flags = node_level(0);
|
|
|
|
write_tree_block(root, t);
|
2007-01-26 21:51:26 +01:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
level++;
|
2007-02-23 14:38:36 +01:00
|
|
|
free_extent(root, blocknr, 1);
|
2007-01-26 21:51:26 +01:00
|
|
|
if (!path->nodes[level])
|
|
|
|
BUG();
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2007-02-02 17:05:29 +01:00
|
|
|
/*
|
|
|
|
* delete the item at the leaf level in path. If that empties
|
|
|
|
* the leaf, remove it from the tree
|
|
|
|
*/
|
2007-01-26 22:38:42 +01:00
|
|
|
int del_item(struct ctree_root *root, struct ctree_path *path)
|
2007-01-26 21:51:26 +01:00
|
|
|
{
|
|
|
|
int slot;
|
|
|
|
struct leaf *leaf;
|
2007-02-02 15:18:22 +01:00
|
|
|
struct tree_buffer *leaf_buf;
|
2007-01-26 21:51:26 +01:00
|
|
|
int doff;
|
|
|
|
int dsize;
|
|
|
|
|
2007-02-02 15:18:22 +01:00
|
|
|
leaf_buf = path->nodes[0];
|
|
|
|
leaf = &leaf_buf->leaf;
|
2007-01-26 22:38:42 +01:00
|
|
|
slot = path->slots[0];
|
2007-01-26 21:51:26 +01:00
|
|
|
doff = leaf->items[slot].offset;
|
|
|
|
dsize = leaf->items[slot].size;
|
|
|
|
|
|
|
|
if (slot != leaf->header.nritems - 1) {
|
|
|
|
int i;
|
|
|
|
int data_end = leaf_data_end(leaf);
|
|
|
|
memmove(leaf->data + data_end + dsize,
|
|
|
|
leaf->data + data_end,
|
|
|
|
doff - data_end);
|
|
|
|
for (i = slot + 1; i < leaf->header.nritems; i++)
|
|
|
|
leaf->items[i].offset += dsize;
|
|
|
|
memmove(leaf->items + slot, leaf->items + slot + 1,
|
|
|
|
sizeof(struct item) *
|
|
|
|
(leaf->header.nritems - slot - 1));
|
|
|
|
}
|
|
|
|
leaf->header.nritems -= 1;
|
2007-02-02 17:05:29 +01:00
|
|
|
/* delete the leaf if we've emptied it */
|
2007-01-26 21:51:26 +01:00
|
|
|
if (leaf->header.nritems == 0) {
|
2007-02-02 15:18:22 +01:00
|
|
|
if (leaf_buf == root->node) {
|
|
|
|
leaf->header.flags = node_level(0);
|
|
|
|
write_tree_block(root, leaf_buf);
|
2007-02-23 14:38:36 +01:00
|
|
|
} else {
|
2007-01-26 22:38:42 +01:00
|
|
|
del_ptr(root, path, 1);
|
2007-02-23 14:38:36 +01:00
|
|
|
free_extent(root, leaf_buf->blocknr, 1);
|
|
|
|
}
|
2007-01-26 21:51:26 +01:00
|
|
|
} else {
|
2007-02-24 12:24:44 +01:00
|
|
|
int used = leaf_space_used(leaf, 0, leaf->header.nritems);
|
2007-01-26 21:51:26 +01:00
|
|
|
if (slot == 0)
|
2007-02-02 15:18:22 +01:00
|
|
|
fixup_low_keys(root, path, &leaf->items[0].key, 1);
|
|
|
|
write_tree_block(root, leaf_buf);
|
2007-02-02 17:05:29 +01:00
|
|
|
/* delete the leaf if it is mostly empty */
|
2007-02-24 12:24:44 +01:00
|
|
|
if (used < LEAF_DATA_SIZE / 3) {
|
2007-01-26 21:51:26 +01:00
|
|
|
/* push_leaf_left fixes the path.
|
|
|
|
* make sure the path still points to our leaf
|
|
|
|
* for possible call to del_ptr below
|
|
|
|
*/
|
2007-01-26 22:38:42 +01:00
|
|
|
slot = path->slots[1];
|
2007-02-02 15:18:22 +01:00
|
|
|
leaf_buf->count++;
|
2007-01-26 22:38:42 +01:00
|
|
|
push_leaf_left(root, path, 1);
|
2007-01-26 21:51:26 +01:00
|
|
|
if (leaf->header.nritems == 0) {
|
2007-02-24 12:24:44 +01:00
|
|
|
u64 blocknr = leaf_buf->blocknr;
|
2007-01-26 22:38:42 +01:00
|
|
|
path->slots[1] = slot;
|
|
|
|
del_ptr(root, path, 1);
|
2007-02-24 12:24:44 +01:00
|
|
|
tree_block_release(root, leaf_buf);
|
|
|
|
free_extent(root, blocknr, 1);
|
|
|
|
} else {
|
|
|
|
tree_block_release(root, leaf_buf);
|
2007-01-26 21:51:26 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2007-02-20 22:40:44 +01:00
|
|
|
int next_leaf(struct ctree_root *root, struct ctree_path *path)
|
|
|
|
{
|
|
|
|
int slot;
|
|
|
|
int level = 1;
|
|
|
|
u64 blocknr;
|
|
|
|
struct tree_buffer *c;
|
2007-02-21 23:04:57 +01:00
|
|
|
struct tree_buffer *next = NULL;
|
2007-02-20 22:40:44 +01:00
|
|
|
|
|
|
|
while(level < MAX_LEVEL) {
|
|
|
|
if (!path->nodes[level])
|
|
|
|
return -1;
|
|
|
|
slot = path->slots[level] + 1;
|
|
|
|
c = path->nodes[level];
|
|
|
|
if (slot >= c->node.header.nritems) {
|
|
|
|
level++;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
blocknr = c->node.blockptrs[slot];
|
2007-02-21 23:04:57 +01:00
|
|
|
if (next)
|
|
|
|
tree_block_release(root, next);
|
2007-02-20 22:40:44 +01:00
|
|
|
next = read_tree_block(root, blocknr);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
path->slots[level] = slot;
|
|
|
|
while(1) {
|
|
|
|
level--;
|
|
|
|
c = path->nodes[level];
|
|
|
|
tree_block_release(root, c);
|
|
|
|
path->nodes[level] = next;
|
|
|
|
path->slots[level] = 0;
|
|
|
|
if (!level)
|
|
|
|
break;
|
|
|
|
next = read_tree_block(root, next->node.blockptrs[0]);
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2007-01-26 21:51:26 +01:00
|
|
|
/* for testing only */
|
|
|
|
int next_key(int i, int max_key) {
|
2007-02-24 12:24:44 +01:00
|
|
|
return rand() % max_key;
|
|
|
|
// return i;
|
2007-01-26 21:51:26 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
int main() {
|
2007-02-02 15:18:22 +01:00
|
|
|
struct ctree_root *root;
|
2007-01-26 21:51:26 +01:00
|
|
|
struct key ins;
|
2007-01-26 22:38:42 +01:00
|
|
|
struct key last = { (u64)-1, 0, 0};
|
2007-01-26 21:51:26 +01:00
|
|
|
char *buf;
|
|
|
|
int i;
|
|
|
|
int num;
|
|
|
|
int ret;
|
2007-02-24 12:24:44 +01:00
|
|
|
int run_size = 20000000;
|
|
|
|
int max_key = 100000000;
|
2007-01-26 21:51:26 +01:00
|
|
|
int tree_size = 0;
|
|
|
|
struct ctree_path path;
|
2007-02-21 23:04:57 +01:00
|
|
|
struct ctree_super_block super;
|
2007-01-26 21:51:26 +01:00
|
|
|
|
2007-02-02 15:18:22 +01:00
|
|
|
radix_tree_init();
|
|
|
|
|
|
|
|
|
2007-02-21 23:04:57 +01:00
|
|
|
root = open_ctree("dbfile", &super);
|
2007-01-26 21:51:26 +01:00
|
|
|
|
|
|
|
srand(55);
|
|
|
|
for (i = 0; i < run_size; i++) {
|
|
|
|
buf = malloc(64);
|
|
|
|
num = next_key(i, max_key);
|
|
|
|
// num = i;
|
|
|
|
sprintf(buf, "string-%d", num);
|
2007-02-24 12:24:44 +01:00
|
|
|
if (i % 10000 == 0)
|
|
|
|
printf("insert %d:%d\n", num, i);
|
2007-01-26 21:51:26 +01:00
|
|
|
ins.objectid = num;
|
|
|
|
ins.offset = 0;
|
|
|
|
ins.flags = 0;
|
2007-02-02 15:18:22 +01:00
|
|
|
ret = insert_item(root, &ins, buf, strlen(buf));
|
2007-01-26 21:51:26 +01:00
|
|
|
if (!ret)
|
|
|
|
tree_size++;
|
2007-02-24 12:24:44 +01:00
|
|
|
free(buf);
|
2007-01-26 21:51:26 +01:00
|
|
|
}
|
2007-02-21 23:04:57 +01:00
|
|
|
write_ctree_super(root, &super);
|
2007-02-02 15:18:22 +01:00
|
|
|
close_ctree(root);
|
2007-02-21 23:04:57 +01:00
|
|
|
|
|
|
|
root = open_ctree("dbfile", &super);
|
2007-02-02 15:18:22 +01:00
|
|
|
printf("starting search\n");
|
2007-01-26 21:51:26 +01:00
|
|
|
srand(55);
|
|
|
|
for (i = 0; i < run_size; i++) {
|
|
|
|
num = next_key(i, max_key);
|
|
|
|
ins.objectid = num;
|
|
|
|
init_path(&path);
|
2007-02-24 12:24:44 +01:00
|
|
|
if (i % 10000 == 0)
|
|
|
|
printf("search %d:%d\n", num, i);
|
2007-02-22 17:39:13 +01:00
|
|
|
ret = search_slot(root, &ins, &path, 0);
|
2007-01-26 21:51:26 +01:00
|
|
|
if (ret) {
|
2007-02-02 15:18:22 +01:00
|
|
|
print_tree(root, root->node);
|
2007-01-26 21:51:26 +01:00
|
|
|
printf("unable to find %d\n", num);
|
|
|
|
exit(1);
|
|
|
|
}
|
2007-02-02 15:18:22 +01:00
|
|
|
release_path(root, &path);
|
|
|
|
}
|
2007-02-21 23:04:57 +01:00
|
|
|
write_ctree_super(root, &super);
|
2007-02-02 15:18:22 +01:00
|
|
|
close_ctree(root);
|
2007-02-21 23:04:57 +01:00
|
|
|
root = open_ctree("dbfile", &super);
|
2007-02-02 15:18:22 +01:00
|
|
|
printf("node %p level %d total ptrs %d free spc %lu\n", root->node,
|
|
|
|
node_level(root->node->node.header.flags),
|
|
|
|
root->node->node.header.nritems,
|
|
|
|
NODEPTRS_PER_BLOCK - root->node->node.header.nritems);
|
|
|
|
printf("all searches good, deleting some items\n");
|
2007-01-26 21:51:26 +01:00
|
|
|
i = 0;
|
|
|
|
srand(55);
|
2007-01-26 22:38:42 +01:00
|
|
|
for (i = 0 ; i < run_size/4; i++) {
|
|
|
|
num = next_key(i, max_key);
|
|
|
|
ins.objectid = num;
|
|
|
|
init_path(&path);
|
2007-02-24 12:24:44 +01:00
|
|
|
ret = search_slot(root, &ins, &path, -1);
|
|
|
|
if (!ret) {
|
|
|
|
if (i % 10000 == 0)
|
|
|
|
printf("del %d:%d\n", num, i);
|
|
|
|
ret = del_item(root, &path);
|
|
|
|
if (ret != 0)
|
|
|
|
BUG();
|
|
|
|
tree_size--;
|
|
|
|
}
|
2007-02-02 15:18:22 +01:00
|
|
|
release_path(root, &path);
|
2007-01-26 22:38:42 +01:00
|
|
|
}
|
2007-02-24 12:24:44 +01:00
|
|
|
write_ctree_super(root, &super);
|
|
|
|
close_ctree(root);
|
|
|
|
root = open_ctree("dbfile", &super);
|
2007-01-26 22:38:42 +01:00
|
|
|
srand(128);
|
2007-01-26 21:51:26 +01:00
|
|
|
for (i = 0; i < run_size; i++) {
|
2007-01-26 22:38:42 +01:00
|
|
|
buf = malloc(64);
|
2007-01-26 21:51:26 +01:00
|
|
|
num = next_key(i, max_key);
|
2007-01-26 22:38:42 +01:00
|
|
|
sprintf(buf, "string-%d", num);
|
2007-01-26 21:51:26 +01:00
|
|
|
ins.objectid = num;
|
2007-02-24 12:24:44 +01:00
|
|
|
if (i % 10000 == 0)
|
|
|
|
printf("insert %d:%d\n", num, i);
|
2007-02-02 15:18:22 +01:00
|
|
|
ret = insert_item(root, &ins, buf, strlen(buf));
|
2007-01-26 22:38:42 +01:00
|
|
|
if (!ret)
|
|
|
|
tree_size++;
|
2007-02-24 12:24:44 +01:00
|
|
|
free(buf);
|
2007-01-26 22:38:42 +01:00
|
|
|
}
|
2007-02-21 23:04:57 +01:00
|
|
|
write_ctree_super(root, &super);
|
2007-02-02 15:18:22 +01:00
|
|
|
close_ctree(root);
|
2007-02-21 23:04:57 +01:00
|
|
|
root = open_ctree("dbfile", &super);
|
2007-02-02 15:18:22 +01:00
|
|
|
srand(128);
|
2007-02-23 14:38:36 +01:00
|
|
|
printf("starting search2\n");
|
2007-02-02 15:18:22 +01:00
|
|
|
for (i = 0; i < run_size; i++) {
|
|
|
|
num = next_key(i, max_key);
|
|
|
|
ins.objectid = num;
|
|
|
|
init_path(&path);
|
2007-02-24 12:24:44 +01:00
|
|
|
if (i % 10000 == 0)
|
|
|
|
printf("search %d:%d\n", num, i);
|
2007-02-22 17:39:13 +01:00
|
|
|
ret = search_slot(root, &ins, &path, 0);
|
2007-02-02 15:18:22 +01:00
|
|
|
if (ret) {
|
|
|
|
print_tree(root, root->node);
|
|
|
|
printf("unable to find %d\n", num);
|
|
|
|
exit(1);
|
|
|
|
}
|
|
|
|
release_path(root, &path);
|
|
|
|
}
|
|
|
|
printf("starting big long delete run\n");
|
|
|
|
while(root->node && root->node->node.header.nritems > 0) {
|
2007-01-26 22:38:42 +01:00
|
|
|
struct leaf *leaf;
|
|
|
|
int slot;
|
|
|
|
ins.objectid = (u64)-1;
|
|
|
|
init_path(&path);
|
2007-02-24 12:24:44 +01:00
|
|
|
ret = search_slot(root, &ins, &path, -1);
|
2007-01-26 22:38:42 +01:00
|
|
|
if (ret == 0)
|
|
|
|
BUG();
|
|
|
|
|
2007-02-02 15:18:22 +01:00
|
|
|
leaf = &path.nodes[0]->leaf;
|
2007-01-26 22:38:42 +01:00
|
|
|
slot = path.slots[0];
|
|
|
|
if (slot != leaf->header.nritems)
|
|
|
|
BUG();
|
|
|
|
while(path.slots[0] > 0) {
|
|
|
|
path.slots[0] -= 1;
|
|
|
|
slot = path.slots[0];
|
2007-02-02 15:18:22 +01:00
|
|
|
leaf = &path.nodes[0]->leaf;
|
2007-01-26 22:38:42 +01:00
|
|
|
|
|
|
|
if (comp_keys(&last, &leaf->items[slot].key) <= 0)
|
|
|
|
BUG();
|
|
|
|
memcpy(&last, &leaf->items[slot].key, sizeof(last));
|
2007-02-24 12:24:44 +01:00
|
|
|
if (tree_size % 10000 == 0)
|
|
|
|
printf("big del %d:%d\n", tree_size, i);
|
2007-02-02 15:18:22 +01:00
|
|
|
ret = del_item(root, &path);
|
|
|
|
if (ret != 0) {
|
|
|
|
printf("del_item returned %d\n", ret);
|
2007-01-26 22:38:42 +01:00
|
|
|
BUG();
|
2007-02-02 15:18:22 +01:00
|
|
|
}
|
2007-01-26 22:38:42 +01:00
|
|
|
tree_size--;
|
|
|
|
}
|
2007-02-02 15:18:22 +01:00
|
|
|
release_path(root, &path);
|
2007-01-26 21:51:26 +01:00
|
|
|
}
|
2007-01-26 22:38:42 +01:00
|
|
|
printf("tree size is now %d\n", tree_size);
|
2007-02-23 14:38:36 +01:00
|
|
|
printf("map tree\n");
|
2007-02-24 12:24:44 +01:00
|
|
|
write_ctree_super(root, &super);
|
|
|
|
close_ctree(root);
|
2007-01-26 21:51:26 +01:00
|
|
|
return 0;
|
|
|
|
}
|