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) {
49 if (retval > node->tree->max_key_len + 2) {
56 if (retval > node->tree->max_key_len + 1) {
68 struct hfs_btree *tree;
75 tree = fd->tree;
77 if (!tree->root)
78 hfs_btree_inc_height(tree);
79 fd->bnode = hfs_bnode_find(tree, tree->leaf_head);
94 end_rec_off = tree->node_size - (node->num_recs + 1) * 2;
107 tree->leaf_count++;
108 mark_inode_dirty(tree->inode);
116 idx_rec_off = tree->node_size - (rec + 1) * 2;
144 hfs_btree_inc_height(tree);
145 new_node->parent = tree->root;
147 fd->bnode = hfs_bnode_find(tree, new_node->parent);
161 if (tree->attributes & HFS_TREE_VARIDXKEYS)
164 fd->search_key->key_len = tree->max_key_len;
165 key_len = tree->max_key_len + 1;
178 struct hfs_btree *tree;
182 tree = fd->tree;
185 rec_off = tree->node_size - (fd->record + 2) * 2;
186 end_off = tree->node_size - (node->num_recs + 1) * 2;
189 tree->leaf_count--;
190 mark_inode_dirty(tree->inode);
198 parent = hfs_bnode_find(tree, node->parent);
231 struct hfs_btree *tree;
237 tree = fd->tree;
239 new_node = hfs_bmap_alloc(tree);
252 next_node = hfs_bnode_find(tree, node->next);
262 size = tree->node_size / 2 - node->num_recs * 2 - 14;
263 old_rec_off = tree->node_size - 4;
298 new_rec_off = tree->node_size - 2;
337 } else if (node->this == tree->leaf_tail) {
339 tree->leaf_tail = new_node->this;
340 mark_inode_dirty(tree->inode);
352 struct hfs_btree *tree;
358 tree = fd->tree;
365 parent = hfs_bnode_find(tree, node->parent);
373 if (tree->attributes & HFS_TREE_VARIDXKEYS)
376 fd->keylength = newkeylen = tree->max_key_len + 1;
379 rec_off = tree->node_size - (rec + 2) * 2;
380 end_rec_off = tree->node_size - (parent->num_recs + 1) * 2;
395 rec_off = tree->node_size - (rec + 2) * 2;
396 end_rec_off = tree->node_size - (parent->num_recs + 1) * 2;
413 if (!(tree->attributes & HFS_TREE_VARIDXKEYS))
423 fd->bnode = hfs_bnode_find(tree, new_node->parent);
448 static int hfs_btree_inc_height(struct hfs_btree *tree)
456 if (tree->root) {
457 node = hfs_bnode_find(tree, tree->root);
461 new_node = hfs_bmap_alloc(tree);
467 tree->root = new_node->this;
468 if (!tree->depth) {
469 tree->leaf_head = tree->leaf_tail = new_node->this;
479 new_node->height = ++tree->depth;
489 rec = tree->node_size - 2;
494 node->parent = tree->root;
496 tree->attributes & HFS_TREE_VARIDXKEYS)
499 key_size = tree->max_key_len + 1;
502 if (!(tree->attributes & HFS_TREE_VARIDXKEYS)) {
503 key_size = tree->max_key_len + 1;
504 hfs_bnode_write_u8(new_node, 14, tree->max_key_len);
516 mark_inode_dirty(tree->inode);