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(tree);
66 fd->bnode = hfs_bnode_find(tree, tree->leaf_head);
81 end_rec_off = tree->node_size - (node->num_recs + 1) * 2;
94 tree->leaf_count++;
95 mark_inode_dirty(tree->inode);
103 idx_rec_off = tree->node_size - (rec + 1) * 2;
131 hfs_btree_inc_height(tree);
132 new_node->parent = tree->root;
134 fd->bnode = hfs_bnode_find(tree, new_node->parent);
148 if (tree->attributes & HFS_TREE_VARIDXKEYS)
151 fd->search_key->key_len = cpu_to_be16(tree->max_key_len);
152 key_len = tree->max_key_len + 2;
165 struct hfs_btree *tree;
169 tree = fd->tree;
172 rec_off = tree->node_size - (fd->record + 2) * 2;
173 end_off = tree->node_size - (node->num_recs + 1) * 2;
176 tree->leaf_count--;
177 mark_inode_dirty(tree->inode);
185 parent = hfs_bnode_find(tree, node->parent);
218 struct hfs_btree *tree;
224 tree = fd->tree;
226 new_node = hfs_bmap_alloc(tree);
238 size = tree->node_size / 2 - node->num_recs * 2 - 14;
239 old_rec_off = tree->node_size - 4;
272 new_rec_off = tree->node_size - 2;
306 struct hfs_bnode *next_node = hfs_bnode_find(tree, new_node->next);
312 } else if (node->this == tree->leaf_tail) {
314 tree->leaf_tail = new_node->this;
315 mark_inode_dirty(tree->inode);
327 struct hfs_btree *tree;
333 tree = fd->tree;
340 parent = hfs_bnode_find(tree, node->parent);
348 if (tree->attributes & HFS_TREE_VARIDXKEYS)
351 fd->keylength = newkeylen = tree->max_key_len + 2;
354 rec_off = tree->node_size - (rec + 2) * 2;
355 end_rec_off = tree->node_size - (parent->num_recs + 1) * 2;
370 rec_off = tree->node_size - (rec + 2) * 2;
371 end_rec_off = tree->node_size - (parent->num_recs + 1) * 2;
396 fd->bnode = hfs_bnode_find(tree, new_node->parent);
421 static int hfs_btree_inc_height(struct hfs_btree *tree)
429 if (tree->root) {
430 node = hfs_bnode_find(tree, tree->root);
434 new_node = hfs_bmap_alloc(tree);
440 tree->root = new_node->this;
441 if (!tree->depth) {
442 tree->leaf_head = tree->leaf_tail = new_node->this;
452 new_node->height = ++tree->depth;
462 rec = tree->node_size - 2;
467 node->parent = tree->root;
469 tree->attributes & HFS_TREE_VARIDXKEYS)
472 key_size = tree->max_key_len + 2;
475 if (!(tree->attributes & HFS_TREE_VARIDXKEYS)) {
476 key_size = tree->max_key_len + 2;
477 hfs_bnode_write_u16(new_node, 14, tree->max_key_len);
488 mark_inode_dirty(tree->inode);