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);
47 if (retval > node->tree->max_key_len + 2) {
58 struct hfs_btree *tree;
65 tree = fd->tree;
67 if (!tree->root)
68 hfs_btree_inc_height(hfsplus_handle, tree);
69 fd->bnode = hfs_bnode_find(hfsplus_handle, tree, tree->leaf_head);
84 end_rec_off = tree->node_size - (node->num_recs + 1) * 2;
97 tree->leaf_count++;
98 if (hfsplus_journalled_mark_inode_dirty(__FUNCTION__, hfsplus_handle, tree->inode))
107 idx_rec_off = tree->node_size - (rec + 1) * 2;
135 hfs_btree_inc_height(hfsplus_handle, tree);
136 new_node->parent = tree->root;
138 fd->bnode = hfs_bnode_find(hfsplus_handle, tree, new_node->parent);
152 if (tree->attributes & HFS_TREE_VARIDXKEYS)
155 fd->search_key->key_len = cpu_to_be16(tree->max_key_len);
156 key_len = tree->max_key_len + 2;
169 struct hfs_btree *tree;
173 tree = fd->tree;
176 rec_off = tree->node_size - (fd->record + 2) * 2;
177 end_off = tree->node_size - (node->num_recs + 1) * 2;
180 tree->leaf_count--;
181 if (hfsplus_journalled_mark_inode_dirty(__FUNCTION__, hfsplus_handle, tree->inode))
190 parent = hfs_bnode_find(hfsplus_handle, tree, node->parent);
223 struct hfs_btree *tree;
229 tree = fd->tree;
231 new_node = hfs_bmap_alloc(hfsplus_handle, tree);
244 next_node = hfs_bnode_find(hfsplus_handle,tree, node->next);
254 size = tree->node_size / 2 - node->num_recs * 2 - 14;
255 old_rec_off = tree->node_size - 4;
290 new_rec_off = tree->node_size - 2;
329 } else if (node->this == tree->leaf_tail) {
331 tree->leaf_tail = new_node->this;
332 if (hfsplus_journalled_mark_inode_dirty(__FUNCTION__, hfsplus_handle, tree->inode))
345 struct hfs_btree *tree;
351 tree = fd->tree;
358 parent = hfs_bnode_find(hfsplus_handle, tree, node->parent);
366 if (tree->attributes & HFS_TREE_VARIDXKEYS)
369 fd->keylength = newkeylen = tree->max_key_len + 2;
372 rec_off = tree->node_size - (rec + 2) * 2;
373 end_rec_off = tree->node_size - (parent->num_recs + 1) * 2;
388 rec_off = tree->node_size - (rec + 2) * 2;
389 end_rec_off = tree->node_size - (parent->num_recs + 1) * 2;
414 fd->bnode = hfs_bnode_find(hfsplus_handle, tree, new_node->parent);
439 static int hfs_btree_inc_height(hfsplus_handle_t *hfsplus_handle, struct hfs_btree *tree)
447 if (tree->root) {
448 node = hfs_bnode_find(hfsplus_handle, tree, tree->root);
452 new_node = hfs_bmap_alloc(hfsplus_handle, tree);
458 tree->root = new_node->this;
459 if (!tree->depth) {
460 tree->leaf_head = tree->leaf_tail = new_node->this;
470 new_node->height = ++tree->depth;
480 rec = tree->node_size - 2;
485 node->parent = tree->root;
487 tree->attributes & HFS_TREE_VARIDXKEYS)
490 key_size = tree->max_key_len + 2;
493 if (!(tree->attributes & HFS_TREE_VARIDXKEYS)) {
494 key_size = tree->max_key_len + 2;
495 hfs_bnode_write_u16(hfsplus_handle, new_node, 14, tree->max_key_len);
506 if (hfsplus_journalled_mark_inode_dirty(__FUNCTION__, hfsplus_handle, tree->inode))