3 #include "kerncompat.h"
4 #include "radix-tree.h"
11 static int refill_alloc_extent(struct ctree_root *root);
12 int split_node(struct ctree_root *root, struct ctree_path *path, int level);
13 int split_leaf(struct ctree_root *root, struct ctree_path *path, int data_size);
15 static inline void init_path(struct ctree_path *p)
17 memset(p, 0, sizeof(*p));
20 static void release_path(struct ctree_root *root, struct ctree_path *p)
23 for (i = 0; i < MAX_LEVEL; i++) {
26 tree_block_release(root, p->nodes[i]);
31 * The leaf data grows from end-to-front in the node.
32 * this returns the address of the start of the last item,
33 * which is the stop of the leaf data stack
35 static inline unsigned int leaf_data_end(struct leaf *leaf)
37 unsigned int nr = leaf->header.nritems;
39 return sizeof(leaf->data);
40 return leaf->items[nr-1].offset;
44 * The space between the end of the leaf items and
45 * the start of the leaf data. IOW, how much room
46 * the leaf has left for both items and data
48 static inline int leaf_free_space(struct leaf *leaf)
50 int data_end = leaf_data_end(leaf);
51 int nritems = leaf->header.nritems;
52 char *items_end = (char *)(leaf->items + nritems + 1);
53 return (char *)(leaf->data + data_end) - (char *)items_end;
57 * compare two keys in a memcmp fashion
59 int comp_keys(struct key *k1, struct key *k2)
61 if (k1->objectid > k2->objectid)
63 if (k1->objectid < k2->objectid)
65 if (k1->flags > k2->flags)
67 if (k1->flags < k2->flags)
69 if (k1->offset > k2->offset)
71 if (k1->offset < k2->offset)
77 * search for key in the array p. items p are item_size apart
78 * and there are 'max' items in p
79 * the slot in the array is returned via slot, and it points to
80 * the place where you would insert key if it is not found in
83 * slot may point to max if the key is bigger than all of the keys
85 int generic_bin_search(char *p, int item_size, struct key *key,
95 mid = (low + high) / 2;
96 tmp = (struct key *)(p + mid * item_size);
97 ret = comp_keys(tmp, key);
112 int bin_search(struct node *c, struct key *key, int *slot)
114 if (is_leaf(c->header.flags)) {
115 struct leaf *l = (struct leaf *)c;
116 return generic_bin_search((void *)l->items, sizeof(struct item),
117 key, c->header.nritems, slot);
119 return generic_bin_search((void *)c->keys, sizeof(struct key),
120 key, c->header.nritems, slot);
126 * look for key in the tree. path is filled in with nodes along the way
127 * if key is found, we return zero and you can find the item in the leaf
128 * level of the path (level 0)
130 * If the key isn't found, the path points to the slot where it should
133 int search_slot(struct ctree_root *root, struct key *key, struct ctree_path *p, int ins_len)
135 struct tree_buffer *b = root->node;
144 level = node_level(c->header.flags);
146 ret = bin_search(c, key, &slot);
147 if (!is_leaf(c->header.flags)) {
150 p->slots[level] = slot;
151 if (ins_len && c->header.nritems == NODEPTRS_PER_BLOCK) {
152 int sret = split_node(root, p, level);
158 slot = p->slots[level];
160 b = read_tree_block(root, c->blockptrs[slot]);
163 struct leaf *l = (struct leaf *)c;
164 p->slots[level] = slot;
165 if (ins_len && leaf_free_space(l) < sizeof(struct item) + ins_len) {
166 int sret = split_leaf(root, p, ins_len);
178 * adjust the pointers going up the tree, starting at level
179 * making sure the right key of each node is points to 'key'.
180 * This is used after shifting pointers to the left, so it stops
181 * fixing up pointers when a given leaf/node is not in slot 0 of the
184 static void fixup_low_keys(struct ctree_root *root,
185 struct ctree_path *path, struct key *key,
189 for (i = level; i < MAX_LEVEL; i++) {
191 int tslot = path->slots[i];
194 t = &path->nodes[i]->node;
195 memcpy(t->keys + tslot, key, sizeof(*key));
196 write_tree_block(root, path->nodes[i]);
203 * try to push data from one node into the next node left in the
204 * tree. The src node is found at specified level in the path.
205 * If some bytes were pushed, return 0, otherwise return 1.
207 * Lower nodes/leaves in the path are not touched, higher nodes may
208 * be modified to reflect the push.
210 * The path is altered to reflect the push.
212 int push_node_left(struct ctree_root *root, struct ctree_path *path, int level)
220 struct tree_buffer *t;
221 struct tree_buffer *right_buf;
223 if (level == MAX_LEVEL - 1 || path->nodes[level + 1] == 0)
225 slot = path->slots[level + 1];
229 t = read_tree_block(root,
230 path->nodes[level + 1]->node.blockptrs[slot - 1]);
232 right_buf = path->nodes[level];
233 right = &right_buf->node;
234 left_nritems = left->header.nritems;
235 right_nritems = right->header.nritems;
236 push_items = NODEPTRS_PER_BLOCK - (left_nritems + 1);
237 if (push_items <= 0) {
238 tree_block_release(root, t);
242 if (right_nritems < push_items)
243 push_items = right_nritems;
244 memcpy(left->keys + left_nritems, right->keys,
245 push_items * sizeof(struct key));
246 memcpy(left->blockptrs + left_nritems, right->blockptrs,
247 push_items * sizeof(u64));
248 memmove(right->keys, right->keys + push_items,
249 (right_nritems - push_items) * sizeof(struct key));
250 memmove(right->blockptrs, right->blockptrs + push_items,
251 (right_nritems - push_items) * sizeof(u64));
252 right->header.nritems -= push_items;
253 left->header.nritems += push_items;
255 /* adjust the pointers going up the tree */
256 fixup_low_keys(root, path, right->keys, level + 1);
258 write_tree_block(root, t);
259 write_tree_block(root, right_buf);
261 /* then fixup the leaf pointer in the path */
262 if (path->slots[level] < push_items) {
263 path->slots[level] += left_nritems;
264 tree_block_release(root, path->nodes[level]);
265 path->nodes[level] = t;
266 path->slots[level + 1] -= 1;
268 path->slots[level] -= push_items;
269 tree_block_release(root, t);
275 * try to push data from one node into the next node right in the
276 * tree. The src node is found at specified level in the path.
277 * If some bytes were pushed, return 0, otherwise return 1.
279 * Lower nodes/leaves in the path are not touched, higher nodes may
280 * be modified to reflect the push.
282 * The path is altered to reflect the push.
284 int push_node_right(struct ctree_root *root, struct ctree_path *path, int level)
287 struct tree_buffer *t;
288 struct tree_buffer *src_buffer;
295 /* can't push from the root */
296 if (level == MAX_LEVEL - 1 || path->nodes[level + 1] == 0)
299 /* only try to push inside the node higher up */
300 slot = path->slots[level + 1];
301 if (slot == NODEPTRS_PER_BLOCK - 1)
304 if (slot >= path->nodes[level + 1]->node.header.nritems -1)
307 t = read_tree_block(root,
308 path->nodes[level + 1]->node.blockptrs[slot + 1]);
310 src_buffer = path->nodes[level];
311 src = &src_buffer->node;
312 dst_nritems = dst->header.nritems;
313 src_nritems = src->header.nritems;
314 push_items = NODEPTRS_PER_BLOCK - (dst_nritems + 1);
315 if (push_items <= 0) {
316 tree_block_release(root, t);
320 if (src_nritems < push_items)
321 push_items = src_nritems;
322 memmove(dst->keys + push_items, dst->keys,
323 dst_nritems * sizeof(struct key));
324 memcpy(dst->keys, src->keys + src_nritems - push_items,
325 push_items * sizeof(struct key));
327 memmove(dst->blockptrs + push_items, dst->blockptrs,
328 dst_nritems * sizeof(u64));
329 memcpy(dst->blockptrs, src->blockptrs + src_nritems - push_items,
330 push_items * sizeof(u64));
332 src->header.nritems -= push_items;
333 dst->header.nritems += push_items;
335 /* adjust the pointers going up the tree */
336 memcpy(path->nodes[level + 1]->node.keys + path->slots[level + 1] + 1,
337 dst->keys, sizeof(struct key));
339 write_tree_block(root, path->nodes[level + 1]);
340 write_tree_block(root, t);
341 write_tree_block(root, src_buffer);
343 /* then fixup the pointers in the path */
344 if (path->slots[level] >= src->header.nritems) {
345 path->slots[level] -= src->header.nritems;
346 tree_block_release(root, path->nodes[level]);
347 path->nodes[level] = t;
348 path->slots[level + 1] += 1;
350 tree_block_release(root, t);
355 static int insert_new_root(struct ctree_root *root, struct ctree_path *path, int level)
357 struct tree_buffer *t;
360 struct key *lower_key;
362 BUG_ON(path->nodes[level]);
363 BUG_ON(path->nodes[level-1] != root->node);
365 t = alloc_free_block(root);
367 memset(c, 0, sizeof(c));
368 c->header.nritems = 1;
369 c->header.flags = node_level(level);
370 c->header.blocknr = t->blocknr;
371 c->header.parentid = root->node->node.header.parentid;
372 lower = &path->nodes[level-1]->node;
373 if (is_leaf(lower->header.flags))
374 lower_key = &((struct leaf *)lower)->items[0].key;
376 lower_key = lower->keys;
377 memcpy(c->keys, lower_key, sizeof(struct key));
378 c->blockptrs[0] = path->nodes[level-1]->blocknr;
379 /* the super has an extra ref to root->node */
380 tree_block_release(root, root->node);
383 write_tree_block(root, t);
384 path->nodes[level] = t;
385 path->slots[level] = 0;
390 * worker function to insert a single pointer in a node.
391 * the node should have enough room for the pointer already
392 * slot and level indicate where you want the key to go, and
393 * blocknr is the block the key points to.
395 int insert_ptr(struct ctree_root *root,
396 struct ctree_path *path, struct key *key,
397 u64 blocknr, int slot, int level)
402 BUG_ON(!path->nodes[level]);
403 lower = &path->nodes[level]->node;
404 nritems = lower->header.nritems;
407 if (nritems == NODEPTRS_PER_BLOCK)
409 if (slot != nritems) {
410 memmove(lower->keys + slot + 1, lower->keys + slot,
411 (nritems - slot) * sizeof(struct key));
412 memmove(lower->blockptrs + slot + 1, lower->blockptrs + slot,
413 (nritems - slot) * sizeof(u64));
415 memcpy(lower->keys + slot, key, sizeof(struct key));
416 lower->blockptrs[slot] = blocknr;
417 lower->header.nritems++;
418 if (lower->keys[1].objectid == 0)
420 write_tree_block(root, path->nodes[level]);
424 int split_node(struct ctree_root *root, struct ctree_path *path, int level)
426 struct tree_buffer *t;
428 struct tree_buffer *split_buffer;
433 ret = push_node_left(root, path, level);
436 ret = push_node_right(root, path, level);
439 t = path->nodes[level];
441 if (t == root->node) {
442 /* trying to split the root, lets make a new one */
443 ret = insert_new_root(root, path, level + 1);
447 split_buffer = alloc_free_block(root);
448 split = &split_buffer->node;
449 split->header.flags = c->header.flags;
450 split->header.blocknr = split_buffer->blocknr;
451 split->header.parentid = root->node->node.header.parentid;
452 mid = (c->header.nritems + 1) / 2;
453 memcpy(split->keys, c->keys + mid,
454 (c->header.nritems - mid) * sizeof(struct key));
455 memcpy(split->blockptrs, c->blockptrs + mid,
456 (c->header.nritems - mid) * sizeof(u64));
457 split->header.nritems = c->header.nritems - mid;
458 c->header.nritems = mid;
459 write_tree_block(root, t);
460 write_tree_block(root, split_buffer);
461 insert_ptr(root, path, split->keys, split_buffer->blocknr,
462 path->slots[level + 1] + 1, level + 1);
463 if (path->slots[level] > mid) {
464 path->slots[level] -= mid;
465 tree_block_release(root, t);
466 path->nodes[level] = split_buffer;
467 path->slots[level + 1] += 1;
469 tree_block_release(root, split_buffer);
475 * how many bytes are required to store the items in a leaf. start
476 * and nr indicate which items in the leaf to check. This totals up the
477 * space used both by the item structs and the item data
479 int leaf_space_used(struct leaf *l, int start, int nr)
482 int end = start + nr - 1;
486 data_len = l->items[start].offset + l->items[start].size;
487 data_len = data_len - l->items[end].offset;
488 data_len += sizeof(struct item) * nr;
493 * push some data in the path leaf to the left, trying to free up at
494 * least data_size bytes. returns zero if the push worked, nonzero otherwise
496 int push_leaf_left(struct ctree_root *root, struct ctree_path *path,
499 struct tree_buffer *right_buf = path->nodes[0];
500 struct leaf *right = &right_buf->leaf;
501 struct tree_buffer *t;
509 int old_left_nritems;
511 slot = path->slots[1];
515 if (!path->nodes[1]) {
518 t = read_tree_block(root, path->nodes[1]->node.blockptrs[slot - 1]);
520 free_space = leaf_free_space(left);
521 if (free_space < data_size + sizeof(struct item)) {
522 tree_block_release(root, t);
525 for (i = 0; i < right->header.nritems; i++) {
526 item = right->items + i;
527 if (path->slots[0] == i)
528 push_space += data_size + sizeof(*item);
529 if (item->size + sizeof(*item) + push_space > free_space)
532 push_space += item->size + sizeof(*item);
534 if (push_items == 0) {
535 tree_block_release(root, t);
538 /* push data from right to left */
539 memcpy(left->items + left->header.nritems,
540 right->items, push_items * sizeof(struct item));
541 push_space = LEAF_DATA_SIZE - right->items[push_items -1].offset;
542 memcpy(left->data + leaf_data_end(left) - push_space,
543 right->data + right->items[push_items - 1].offset,
545 old_left_nritems = left->header.nritems;
546 BUG_ON(old_left_nritems < 0);
548 for(i = old_left_nritems; i < old_left_nritems + push_items; i++) {
549 left->items[i].offset -= LEAF_DATA_SIZE -
550 left->items[old_left_nritems -1].offset;
552 left->header.nritems += push_items;
554 /* fixup right node */
555 push_space = right->items[push_items-1].offset - leaf_data_end(right);
556 memmove(right->data + LEAF_DATA_SIZE - push_space, right->data +
557 leaf_data_end(right), push_space);
558 memmove(right->items, right->items + push_items,
559 (right->header.nritems - push_items) * sizeof(struct item));
560 right->header.nritems -= push_items;
561 push_space = LEAF_DATA_SIZE;
563 for (i = 0; i < right->header.nritems; i++) {
564 right->items[i].offset = push_space - right->items[i].size;
565 push_space = right->items[i].offset;
568 write_tree_block(root, t);
569 write_tree_block(root, right_buf);
571 fixup_low_keys(root, path, &right->items[0].key, 1);
573 /* then fixup the leaf pointer in the path */
574 if (path->slots[0] < push_items) {
575 path->slots[0] += old_left_nritems;
576 tree_block_release(root, path->nodes[0]);
580 tree_block_release(root, t);
581 path->slots[0] -= push_items;
583 BUG_ON(path->slots[0] < 0);
588 * split the path's leaf in two, making sure there is at least data_size
589 * available for the resulting leaf level of the path.
591 int split_leaf(struct ctree_root *root, struct ctree_path *path, int data_size)
593 struct tree_buffer *l_buf = path->nodes[0];
594 struct leaf *l = &l_buf->leaf;
599 struct tree_buffer *right_buffer;
600 int space_needed = data_size + sizeof(struct item);
606 if (push_leaf_left(root, path, data_size) == 0) {
607 l_buf = path->nodes[0];
609 if (leaf_free_space(l) >= sizeof(struct item) + data_size)
612 if (!path->nodes[1]) {
613 ret = insert_new_root(root, path, 1);
617 slot = path->slots[0];
618 nritems = l->header.nritems;
619 mid = (nritems + 1)/ 2;
621 right_buffer = alloc_free_block(root);
622 BUG_ON(!right_buffer);
623 BUG_ON(mid == nritems);
624 right = &right_buffer->leaf;
625 memset(right, 0, sizeof(*right));
627 if (leaf_space_used(l, mid, nritems - mid) + space_needed >
631 if (leaf_space_used(l, 0, mid + 1) + space_needed >
635 right->header.nritems = nritems - mid;
636 right->header.blocknr = right_buffer->blocknr;
637 right->header.flags = node_level(0);
638 right->header.parentid = root->node->node.header.parentid;
639 data_copy_size = l->items[mid].offset + l->items[mid].size -
641 memcpy(right->items, l->items + mid,
642 (nritems - mid) * sizeof(struct item));
643 memcpy(right->data + LEAF_DATA_SIZE - data_copy_size,
644 l->data + leaf_data_end(l), data_copy_size);
645 rt_data_off = LEAF_DATA_SIZE -
646 (l->items[mid].offset + l->items[mid].size);
648 for (i = 0; i < right->header.nritems; i++)
649 right->items[i].offset += rt_data_off;
651 l->header.nritems = mid;
652 ret = insert_ptr(root, path, &right->items[0].key,
653 right_buffer->blocknr, path->slots[1] + 1, 1);
654 write_tree_block(root, right_buffer);
655 write_tree_block(root, l_buf);
657 BUG_ON(path->slots[0] != slot);
659 tree_block_release(root, path->nodes[0]);
660 path->nodes[0] = right_buffer;
661 path->slots[0] -= mid;
664 tree_block_release(root, right_buffer);
665 BUG_ON(path->slots[0] < 0);
670 * Given a key and some data, insert an item into the tree.
671 * This does all the path init required, making room in the tree if needed.
673 int insert_item(struct ctree_root *root, struct key *key,
674 void *data, int data_size)
680 struct tree_buffer *leaf_buf;
681 unsigned int nritems;
682 unsigned int data_end;
683 struct ctree_path path;
685 refill_alloc_extent(root);
687 /* create a root if there isn't one */
691 ret = search_slot(root, key, &path, data_size);
693 release_path(root, &path);
697 slot_orig = path.slots[0];
698 leaf_buf = path.nodes[0];
699 leaf = &leaf_buf->leaf;
701 nritems = leaf->header.nritems;
702 data_end = leaf_data_end(leaf);
704 if (leaf_free_space(leaf) < sizeof(struct item) + data_size)
707 slot = path.slots[0];
710 fixup_low_keys(root, &path, key, 1);
711 if (slot != nritems) {
713 unsigned int old_data = leaf->items[slot].offset +
714 leaf->items[slot].size;
717 * item0..itemN ... dataN.offset..dataN.size .. data0.size
719 /* first correct the data pointers */
720 for (i = slot; i < nritems; i++)
721 leaf->items[i].offset -= data_size;
723 /* shift the items */
724 memmove(leaf->items + slot + 1, leaf->items + slot,
725 (nritems - slot) * sizeof(struct item));
728 memmove(leaf->data + data_end - data_size, leaf->data +
729 data_end, old_data - data_end);
732 /* copy the new data in */
733 memcpy(&leaf->items[slot].key, key, sizeof(struct key));
734 leaf->items[slot].offset = data_end - data_size;
735 leaf->items[slot].size = data_size;
736 memcpy(leaf->data + data_end - data_size, data, data_size);
737 leaf->header.nritems += 1;
738 write_tree_block(root, leaf_buf);
739 if (leaf_free_space(leaf) < 0)
741 release_path(root, &path);
746 * delete the pointer from a given level in the path. The path is not
747 * fixed up, so after calling this it is not valid at that level.
749 * If the delete empties a node, the node is removed from the tree,
750 * continuing all the way the root if required. The root is converted into
751 * a leaf if all the nodes are emptied.
753 int del_ptr(struct ctree_root *root, struct ctree_path *path, int level)
756 struct tree_buffer *t;
761 t = path->nodes[level];
765 slot = path->slots[level];
766 nritems = node->header.nritems;
768 if (slot != nritems -1) {
769 memmove(node->keys + slot, node->keys + slot + 1,
770 sizeof(struct key) * (nritems - slot - 1));
771 memmove(node->blockptrs + slot,
772 node->blockptrs + slot + 1,
773 sizeof(u64) * (nritems - slot - 1));
775 node->header.nritems--;
776 write_tree_block(root, t);
777 if (node->header.nritems != 0) {
780 fixup_low_keys(root, path, node->keys,
782 tslot = path->slots[level+1];
784 push_node_left(root, path, level);
785 if (node->header.nritems) {
786 push_node_right(root, path, level);
788 if (node->header.nritems) {
789 tree_block_release(root, t);
792 tree_block_release(root, t);
793 path->slots[level+1] = tslot;
795 if (t == root->node) {
796 /* just turn the root into a leaf and break */
797 root->node->node.header.flags = node_level(0);
798 write_tree_block(root, t);
802 if (!path->nodes[level])
809 * delete the item at the leaf level in path. If that empties
810 * the leaf, remove it from the tree
812 int del_item(struct ctree_root *root, struct ctree_path *path)
816 struct tree_buffer *leaf_buf;
820 leaf_buf = path->nodes[0];
821 leaf = &leaf_buf->leaf;
822 slot = path->slots[0];
823 doff = leaf->items[slot].offset;
824 dsize = leaf->items[slot].size;
826 if (slot != leaf->header.nritems - 1) {
828 int data_end = leaf_data_end(leaf);
829 memmove(leaf->data + data_end + dsize,
830 leaf->data + data_end,
832 for (i = slot + 1; i < leaf->header.nritems; i++)
833 leaf->items[i].offset += dsize;
834 memmove(leaf->items + slot, leaf->items + slot + 1,
835 sizeof(struct item) *
836 (leaf->header.nritems - slot - 1));
838 leaf->header.nritems -= 1;
839 /* delete the leaf if we've emptied it */
840 if (leaf->header.nritems == 0) {
841 if (leaf_buf == root->node) {
842 leaf->header.flags = node_level(0);
843 write_tree_block(root, leaf_buf);
845 del_ptr(root, path, 1);
848 fixup_low_keys(root, path, &leaf->items[0].key, 1);
849 write_tree_block(root, leaf_buf);
850 /* delete the leaf if it is mostly empty */
851 if (leaf_space_used(leaf, 0, leaf->header.nritems) <
852 LEAF_DATA_SIZE / 4) {
853 /* push_leaf_left fixes the path.
854 * make sure the path still points to our leaf
855 * for possible call to del_ptr below
857 slot = path->slots[1];
859 push_leaf_left(root, path, 1);
860 if (leaf->header.nritems == 0) {
861 path->slots[1] = slot;
862 del_ptr(root, path, 1);
864 tree_block_release(root, leaf_buf);
870 int next_leaf(struct ctree_root *root, struct ctree_path *path)
875 struct tree_buffer *c;
876 struct tree_buffer *next = NULL;
878 while(level < MAX_LEVEL) {
879 if (!path->nodes[level])
881 slot = path->slots[level] + 1;
882 c = path->nodes[level];
883 if (slot >= c->node.header.nritems) {
887 blocknr = c->node.blockptrs[slot];
889 tree_block_release(root, next);
890 next = read_tree_block(root, blocknr);
893 path->slots[level] = slot;
896 c = path->nodes[level];
897 tree_block_release(root, c);
898 path->nodes[level] = next;
899 path->slots[level] = 0;
902 next = read_tree_block(root, next->node.blockptrs[0]);
907 int alloc_extent(struct ctree_root *orig_root, u64 num_blocks, u64 search_start,
908 u64 search_end, u64 owner, struct key *ins)
910 struct ctree_path path;
918 struct extent_item extent_item;
919 struct ctree_root * root = orig_root->extent_root;
922 ins->objectid = search_start;
926 ret = search_slot(root, ins, &path, sizeof(struct extent_item));
928 l = &path.nodes[0]->leaf;
929 slot = path.slots[0];
931 // FIXME allocate root
933 if (slot >= l->header.nritems) {
934 ret = next_leaf(root, &path);
938 ins->objectid = search_start;
939 ins->offset = num_blocks;
940 hole_size = search_end - search_start;
943 ins->objectid = last_block;
944 ins->offset = num_blocks;
945 hole_size = search_end - last_block;
948 key = &l->items[slot].key;
950 hole_size = key->objectid - last_block;
951 if (hole_size > num_blocks) {
952 ins->objectid = last_block;
953 ins->offset = num_blocks;
958 last_block = key->objectid + key->offset;
963 release_path(root, &path);
964 extent_item.refs = 1;
965 extent_item.owner = owner;
966 if (root == orig_root && root->reserve_extent->num_blocks == 0) {
967 root->reserve_extent->blocknr = ins->objectid;
968 root->reserve_extent->num_blocks = ins->offset;
969 root->reserve_extent->num_used = 0;
971 ret = insert_item(root->extent_root, ins, &extent_item, sizeof(extent_item));
975 static int refill_alloc_extent(struct ctree_root *root)
977 struct alloc_extent *ae = root->alloc_extent;
980 int min_blocks = MAX_LEVEL * 2;
982 if (ae->num_blocks > ae->num_used && ae->num_blocks - ae->num_used >
985 ae = root->reserve_extent;
986 if (ae->num_blocks > ae->num_used) {
987 if (root->alloc_extent->num_blocks == 0) {
988 /* we should swap reserve/alloc_extent when alloc
993 if (ae->num_blocks - ae->num_used < min_blocks)
997 ret = alloc_extent(root,
998 min_blocks * 2, 0, (unsigned long)-1,
999 root->node->node.header.parentid, &key);
1000 ae->blocknr = key.objectid;
1001 ae->num_blocks = key.offset;
1006 void print_leaf(struct leaf *l)
1009 int nr = l->header.nritems;
1011 struct extent_item *ei;
1012 printf("leaf %lu total ptrs %d free space %d\n", l->header.blocknr, nr,
1013 leaf_free_space(l));
1015 for (i = 0 ; i < nr ; i++) {
1016 item = l->items + i;
1017 printf("\titem %d key (%lu %u %lu) itemoff %d itemsize %d\n",
1019 item->key.objectid, item->key.flags, item->key.offset,
1020 item->offset, item->size);
1022 printf("\t\titem data %.*s\n", item->size, l->data+item->offset);
1023 ei = (struct extent_item *)(l->data + item->offset);
1024 printf("\t\textent data %u %lu\n", ei->refs, ei->owner);
1028 void print_tree(struct ctree_root *root, struct tree_buffer *t)
1037 nr = c->header.nritems;
1038 if (c->header.blocknr != t->blocknr)
1040 if (is_leaf(c->header.flags)) {
1041 print_leaf((struct leaf *)c);
1044 printf("node %lu level %d total ptrs %d free spc %lu\n", t->blocknr,
1045 node_level(c->header.flags), c->header.nritems,
1046 NODEPTRS_PER_BLOCK - c->header.nritems);
1048 for (i = 0; i < nr; i++) {
1049 printf("\tkey %d (%lu %u %lu) block %lu\n",
1051 c->keys[i].objectid, c->keys[i].flags, c->keys[i].offset,
1055 for (i = 0; i < nr; i++) {
1056 struct tree_buffer *next_buf = read_tree_block(root,
1058 struct node *next = &next_buf->node;
1059 if (is_leaf(next->header.flags) &&
1060 node_level(c->header.flags) != 1)
1062 if (node_level(next->header.flags) !=
1063 node_level(c->header.flags) - 1)
1065 print_tree(root, next_buf);
1066 tree_block_release(root, next_buf);
1071 /* for testing only */
1072 int next_key(int i, int max_key) {
1073 // return rand() % max_key;
1078 struct ctree_root *root;
1080 struct key last = { (u64)-1, 0, 0};
1085 int run_size = 10000;
1086 int max_key = 100000000;
1088 struct ctree_path path;
1089 struct ctree_super_block super;
1094 root = open_ctree("dbfile", &super);
1095 printf("root tree\n");
1096 print_tree(root, root->node);
1097 printf("map tree\n");
1098 print_tree(root->extent_root, root->extent_root->node);
1101 for (i = 0; i < run_size; i++) {
1103 num = next_key(i, max_key);
1105 sprintf(buf, "string-%d", num);
1106 // printf("insert %d\n", num);
1110 ret = insert_item(root, &ins, buf, strlen(buf));
1114 printf("root used: %lu\n", root->alloc_extent->num_used);
1115 printf("root tree\n");
1116 // print_tree(root, root->node);
1117 printf("map tree\n");
1118 printf("map used: %lu\n", root->extent_root->alloc_extent->num_used);
1119 // print_tree(root->extent_root, root->extent_root->node);
1120 write_ctree_super(root, &super);
1123 root = open_ctree("dbfile", &super);
1124 printf("starting search\n");
1126 for (i = 0; i < run_size; i++) {
1127 num = next_key(i, max_key);
1130 ret = search_slot(root, &ins, &path, 0);
1132 print_tree(root, root->node);
1133 printf("unable to find %d\n", num);
1136 release_path(root, &path);
1138 write_ctree_super(root, &super);
1140 root = open_ctree("dbfile", &super);
1141 printf("node %p level %d total ptrs %d free spc %lu\n", root->node,
1142 node_level(root->node->node.header.flags),
1143 root->node->node.header.nritems,
1144 NODEPTRS_PER_BLOCK - root->node->node.header.nritems);
1145 printf("all searches good, deleting some items\n");
1148 for (i = 0 ; i < run_size/4; i++) {
1149 num = next_key(i, max_key);
1152 ret = search_slot(root, &ins, &path, 0);
1155 ret = del_item(root, &path);
1158 release_path(root, &path);
1162 for (i = 0; i < run_size; i++) {
1164 num = next_key(i, max_key);
1165 sprintf(buf, "string-%d", num);
1167 ret = insert_item(root, &ins, buf, strlen(buf));
1171 write_ctree_super(root, &super);
1173 root = open_ctree("dbfile", &super);
1174 printf("starting search2\n");
1176 for (i = 0; i < run_size; i++) {
1177 num = next_key(i, max_key);
1180 ret = search_slot(root, &ins, &path, 0);
1182 print_tree(root, root->node);
1183 printf("unable to find %d\n", num);
1186 release_path(root, &path);
1188 printf("starting big long delete run\n");
1189 while(root->node && root->node->node.header.nritems > 0) {
1192 ins.objectid = (u64)-1;
1194 ret = search_slot(root, &ins, &path, 0);
1198 leaf = &path.nodes[0]->leaf;
1199 slot = path.slots[0];
1200 if (slot != leaf->header.nritems)
1202 while(path.slots[0] > 0) {
1204 slot = path.slots[0];
1205 leaf = &path.nodes[0]->leaf;
1207 if (comp_keys(&last, &leaf->items[slot].key) <= 0)
1209 memcpy(&last, &leaf->items[slot].key, sizeof(last));
1210 ret = del_item(root, &path);
1212 printf("del_item returned %d\n", ret);
1217 release_path(root, &path);
1219 write_ctree_super(root, &super);
1221 printf("tree size is now %d\n", tree_size);