Lines Matching refs:tree
15 static int hfs_btree_inc_height(struct hfs_btree *tree);
23 dataoff = node->tree->node_size - (rec + 2) * 2;
38 !(node->tree->attributes & HFS_TREE_VARIDXKEYS)) {
39 if (node->tree->attributes & HFS_TREE_BIGKEYS)
40 retval = node->tree->max_key_len + 2;
42 retval = node->tree->max_key_len + 1;
44 recoff = hfs_bnode_read_u16(node, node->tree->node_size - (rec + 1) * 2);
47 if (node->tree->attributes & HFS_TREE_BIGKEYS)
57 struct hfs_btree *tree;
64 tree = fd->tree;
66 if (!tree->root)
67 hfs_btree_inc_height(tree);
68 fd->bnode = hfs_bnode_find(tree, tree->leaf_head);
83 end_rec_off = tree->node_size - (node->num_recs + 1) * 2;
96 tree->leaf_count++;
97 mark_inode_dirty(tree->inode);
105 idx_rec_off = tree->node_size - (rec + 1) * 2;
133 hfs_btree_inc_height(tree);
134 new_node->parent = tree->root;
136 fd->bnode = hfs_bnode_find(tree, new_node->parent);
150 if (tree->attributes & HFS_TREE_VARIDXKEYS)
153 fd->search_key->key_len = tree->max_key_len;
154 key_len = tree->max_key_len + 1;
167 struct hfs_btree *tree;
171 tree = fd->tree;
174 rec_off = tree->node_size - (fd->record + 2) * 2;
175 end_off = tree->node_size - (node->num_recs + 1) * 2;
178 tree->leaf_count--;
179 mark_inode_dirty(tree->inode);
187 parent = hfs_bnode_find(tree, node->parent);
220 struct hfs_btree *tree;
226 tree = fd->tree;
228 new_node = hfs_bmap_alloc(tree);
240 size = tree->node_size / 2 - node->num_recs * 2 - 14;
241 old_rec_off = tree->node_size - 4;
274 new_rec_off = tree->node_size - 2;
308 struct hfs_bnode *next_node = hfs_bnode_find(tree, new_node->next);
314 } else if (node->this == tree->leaf_tail) {
316 tree->leaf_tail = new_node->this;
317 mark_inode_dirty(tree->inode);
329 struct hfs_btree *tree;
335 tree = fd->tree;
342 parent = hfs_bnode_find(tree, node->parent);
350 if (tree->attributes & HFS_TREE_VARIDXKEYS)
353 fd->keylength = newkeylen = tree->max_key_len + 1;
356 rec_off = tree->node_size - (rec + 2) * 2;
357 end_rec_off = tree->node_size - (parent->num_recs + 1) * 2;
372 rec_off = tree->node_size - (rec + 2) * 2;
373 end_rec_off = tree->node_size - (parent->num_recs + 1) * 2;
390 if (!(tree->attributes & HFS_TREE_VARIDXKEYS))
400 fd->bnode = hfs_bnode_find(tree, new_node->parent);
425 static int hfs_btree_inc_height(struct hfs_btree *tree)
433 if (tree->root) {
434 node = hfs_bnode_find(tree, tree->root);
438 new_node = hfs_bmap_alloc(tree);
444 tree->root = new_node->this;
445 if (!tree->depth) {
446 tree->leaf_head = tree->leaf_tail = new_node->this;
456 new_node->height = ++tree->depth;
466 rec = tree->node_size - 2;
471 node->parent = tree->root;
473 tree->attributes & HFS_TREE_VARIDXKEYS)
476 key_size = tree->max_key_len + 1;
479 if (!(tree->attributes & HFS_TREE_VARIDXKEYS)) {
480 key_size = tree->max_key_len + 1;
481 hfs_bnode_write_u8(new_node, 14, tree->max_key_len);
493 mark_inode_dirty(tree->inode);