Lines Matching refs:tree
16 static int hfs_btree_inc_height(struct hfs_btree *tree);
24 dataoff = node->tree->node_size - (rec + 2) * 2;
39 !(node->tree->attributes & HFS_TREE_VARIDXKEYS)) {
40 if (node->tree->attributes & HFS_TREE_BIGKEYS)
41 retval = node->tree->max_key_len + 2;
43 retval = node->tree->max_key_len + 1;
45 recoff = hfs_bnode_read_u16(node, node->tree->node_size - (rec + 1) * 2);
48 if (node->tree->attributes & HFS_TREE_BIGKEYS) {
50 if (retval > node->tree->max_key_len + 2) {
56 if (retval > node->tree->max_key_len + 1) {
67 struct hfs_btree *tree;
74 tree = fd->tree;
76 if (!tree->root)
77 hfs_btree_inc_height(tree);
78 node = hfs_bnode_find(tree, tree->leaf_head);
94 end_rec_off = tree->node_size - (node->num_recs + 1) * 2;
108 tree->leaf_count++;
109 mark_inode_dirty(tree->inode);
117 idx_rec_off = tree->node_size - (rec + 1) * 2;
148 hfs_btree_inc_height(tree);
149 new_node->parent = tree->root;
151 fd->bnode = hfs_bnode_find(tree, new_node->parent);
165 if (tree->attributes & HFS_TREE_VARIDXKEYS)
168 fd->search_key->key_len = tree->max_key_len;
169 key_len = tree->max_key_len + 1;
179 struct hfs_btree *tree;
183 tree = fd->tree;
186 rec_off = tree->node_size - (fd->record + 2) * 2;
187 end_off = tree->node_size - (node->num_recs + 1) * 2;
190 tree->leaf_count--;
191 mark_inode_dirty(tree->inode);
200 parent = hfs_bnode_find(tree, node->parent);
233 struct hfs_btree *tree;
239 tree = fd->tree;
241 new_node = hfs_bmap_alloc(tree);
254 next_node = hfs_bnode_find(tree, node->next);
264 size = tree->node_size / 2 - node->num_recs * 2 - 14;
265 old_rec_off = tree->node_size - 4;
300 new_rec_off = tree->node_size - 2;
339 } else if (node->this == tree->leaf_tail) {
341 tree->leaf_tail = new_node->this;
342 mark_inode_dirty(tree->inode);
354 struct hfs_btree *tree;
360 tree = fd->tree;
367 parent = hfs_bnode_find(tree, node->parent);
377 if (tree->attributes & HFS_TREE_VARIDXKEYS)
380 fd->keylength = newkeylen = tree->max_key_len + 1;
384 rec_off = tree->node_size - (rec + 2) * 2;
385 end_rec_off = tree->node_size - (parent->num_recs + 1) * 2;
400 rec_off = tree->node_size - (rec + 2) * 2;
401 end_rec_off = tree->node_size - (parent->num_recs + 1) * 2;
418 if (!(tree->attributes & HFS_TREE_VARIDXKEYS))
429 hfs_btree_inc_height(tree);
430 new_node->parent = tree->root;
432 fd->bnode = hfs_bnode_find(tree, new_node->parent);
458 static int hfs_btree_inc_height(struct hfs_btree *tree)
466 if (tree->root) {
467 node = hfs_bnode_find(tree, tree->root);
471 new_node = hfs_bmap_alloc(tree);
477 tree->root = new_node->this;
478 if (!tree->depth) {
479 tree->leaf_head = tree->leaf_tail = new_node->this;
489 new_node->height = ++tree->depth;
499 rec = tree->node_size - 2;
504 node->parent = tree->root;
506 tree->attributes & HFS_TREE_VARIDXKEYS)
509 key_size = tree->max_key_len + 1;
512 if (!(tree->attributes & HFS_TREE_VARIDXKEYS)) {
513 key_size = tree->max_key_len + 1;
514 hfs_bnode_write_u8(new_node, 14, tree->max_key_len);
526 mark_inode_dirty(tree->inode);