Lines Matching refs:tree
24 dataoff = node->tree->node_size - (rec + 2) * 2;
39 !(node->tree->attributes & HFS_TREE_VARIDXKEYS)) {
40 retval = node->tree->max_key_len + 2;
42 recoff = hfs_bnode_read_u16(node, node->tree->node_size - (rec + 1) * 2);
45 if (node->tree->attributes & HFS_TREE_BIGKEYS)
55 struct hfs_btree *tree;
62 tree = fd->tree;
64 if (!tree->root)
65 hfs_btree_inc_height(hfsplus_handle, tree);
66 fd->bnode = hfs_bnode_find(hfsplus_handle, tree, tree->leaf_head);
81 end_rec_off = tree->node_size - (node->num_recs + 1) * 2;
94 tree->leaf_count++;
95 if (hfsplus_journalled_mark_inode_dirty(__FUNCTION__, hfsplus_handle, tree->inode))
104 idx_rec_off = tree->node_size - (rec + 1) * 2;
132 hfs_btree_inc_height(hfsplus_handle, tree);
133 new_node->parent = tree->root;
135 fd->bnode = hfs_bnode_find(hfsplus_handle, tree, new_node->parent);
149 if (tree->attributes & HFS_TREE_VARIDXKEYS)
152 fd->search_key->key_len = cpu_to_be16(tree->max_key_len);
153 key_len = tree->max_key_len + 2;
166 struct hfs_btree *tree;
170 tree = fd->tree;
173 rec_off = tree->node_size - (fd->record + 2) * 2;
174 end_off = tree->node_size - (node->num_recs + 1) * 2;
177 tree->leaf_count--;
178 if (hfsplus_journalled_mark_inode_dirty(__FUNCTION__, hfsplus_handle, tree->inode))
187 parent = hfs_bnode_find(hfsplus_handle, tree, node->parent);
220 struct hfs_btree *tree;
226 tree = fd->tree;
228 new_node = hfs_bmap_alloc(hfsplus_handle, 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(hfsplus_handle, tree, new_node->next);
314 } else if (node->this == tree->leaf_tail) {
316 tree->leaf_tail = new_node->this;
317 if (hfsplus_journalled_mark_inode_dirty(__FUNCTION__, hfsplus_handle, tree->inode))
330 struct hfs_btree *tree;
336 tree = fd->tree;
343 parent = hfs_bnode_find(hfsplus_handle, tree, node->parent);
351 if (tree->attributes & HFS_TREE_VARIDXKEYS)
354 fd->keylength = newkeylen = tree->max_key_len + 2;
357 rec_off = tree->node_size - (rec + 2) * 2;
358 end_rec_off = tree->node_size - (parent->num_recs + 1) * 2;
373 rec_off = tree->node_size - (rec + 2) * 2;
374 end_rec_off = tree->node_size - (parent->num_recs + 1) * 2;
399 fd->bnode = hfs_bnode_find(hfsplus_handle, tree, new_node->parent);
424 static int hfs_btree_inc_height(hfsplus_handle_t *hfsplus_handle, struct hfs_btree *tree)
432 if (tree->root) {
433 node = hfs_bnode_find(hfsplus_handle, tree, tree->root);
437 new_node = hfs_bmap_alloc(hfsplus_handle, tree);
443 tree->root = new_node->this;
444 if (!tree->depth) {
445 tree->leaf_head = tree->leaf_tail = new_node->this;
455 new_node->height = ++tree->depth;
465 rec = tree->node_size - 2;
470 node->parent = tree->root;
472 tree->attributes & HFS_TREE_VARIDXKEYS)
475 key_size = tree->max_key_len + 2;
478 if (!(tree->attributes & HFS_TREE_VARIDXKEYS)) {
479 key_size = tree->max_key_len + 2;
480 hfs_bnode_write_u16(hfsplus_handle, new_node, 14, tree->max_key_len);
491 if (hfsplus_journalled_mark_inode_dirty(__FUNCTION__, hfsplus_handle, tree->inode))