Lines Matching refs:node
19 u16 hfs_brec_lenoff(struct hfs_bnode *node, u16 rec, u16 *off) in hfs_brec_lenoff() argument
24 dataoff = node->tree->node_size - (rec + 2) * 2; in hfs_brec_lenoff()
25 hfs_bnode_read(node, retval, dataoff, 4); in hfs_brec_lenoff()
31 u16 hfs_brec_keylen(struct hfs_bnode *node, u16 rec) in hfs_brec_keylen() argument
35 if (node->type != HFS_NODE_INDEX && node->type != HFS_NODE_LEAF) in hfs_brec_keylen()
38 if ((node->type == HFS_NODE_INDEX) && in hfs_brec_keylen()
39 !(node->tree->attributes & HFS_TREE_VARIDXKEYS) && in hfs_brec_keylen()
40 (node->tree->cnid != HFSPLUS_ATTR_CNID)) { in hfs_brec_keylen()
41 retval = node->tree->max_key_len + 2; in hfs_brec_keylen()
43 recoff = hfs_bnode_read_u16(node, in hfs_brec_keylen()
44 node->tree->node_size - (rec + 1) * 2); in hfs_brec_keylen()
47 if (recoff > node->tree->node_size - 2) { in hfs_brec_keylen()
52 retval = hfs_bnode_read_u16(node, recoff) + 2; in hfs_brec_keylen()
53 if (retval > node->tree->max_key_len + 2) { in hfs_brec_keylen()
65 struct hfs_bnode *node, *new_node; in hfs_brec_insert() local
87 node = fd->bnode; in hfs_brec_insert()
88 hfs_bnode_dump(node); in hfs_brec_insert()
90 end_rec_off = tree->node_size - (node->num_recs + 1) * 2; in hfs_brec_insert()
91 end_off = hfs_bnode_read_u16(node, end_rec_off); in hfs_brec_insert()
103 if (node->type == HFS_NODE_LEAF) { in hfs_brec_insert()
107 node->num_recs++; in hfs_brec_insert()
109 hfs_bnode_write_u16(node, in hfs_brec_insert()
111 node->num_recs); in hfs_brec_insert()
112 hfs_bnode_write_u16(node, end_rec_off, end_off + size); in hfs_brec_insert()
120 data_off = hfs_bnode_read_u16(node, data_rec_off + 2); in hfs_brec_insert()
121 hfs_bnode_write_u16(node, data_rec_off, data_off + size); in hfs_brec_insert()
126 hfs_bnode_move(node, data_off + size, data_off, in hfs_brec_insert()
130 hfs_bnode_write(node, fd->search_key, data_off, key_len); in hfs_brec_insert()
131 hfs_bnode_write(node, entry, data_off + key_len, entry_len); in hfs_brec_insert()
132 hfs_bnode_dump(node); in hfs_brec_insert()
138 if (!rec && new_node != node) in hfs_brec_insert()
180 struct hfs_bnode *node, *parent; in hfs_brec_remove() local
184 node = fd->bnode; in hfs_brec_remove()
187 end_off = tree->node_size - (node->num_recs + 1) * 2; in hfs_brec_remove()
189 if (node->type == HFS_NODE_LEAF) { in hfs_brec_remove()
193 hfs_bnode_dump(node); in hfs_brec_remove()
196 if (!--node->num_recs) { in hfs_brec_remove()
197 hfs_bnode_unlink(node); in hfs_brec_remove()
198 if (!node->parent) in hfs_brec_remove()
200 parent = hfs_bnode_find(tree, node->parent); in hfs_brec_remove()
203 hfs_bnode_put(node); in hfs_brec_remove()
204 node = fd->bnode = parent; in hfs_brec_remove()
206 __hfs_brec_find(node, fd, hfs_find_rec_by_key); in hfs_brec_remove()
209 hfs_bnode_write_u16(node, in hfs_brec_remove()
211 node->num_recs); in hfs_brec_remove()
218 data_off = hfs_bnode_read_u16(node, rec_off); in hfs_brec_remove()
219 hfs_bnode_write_u16(node, rec_off + 2, data_off - size); in hfs_brec_remove()
224 hfs_bnode_move(node, fd->keyoffset, fd->keyoffset + size, in hfs_brec_remove()
227 hfs_bnode_dump(node); in hfs_brec_remove()
236 struct hfs_bnode *node, *new_node, *next_node; in hfs_bnode_split() local
242 node = fd->bnode; in hfs_bnode_split()
246 hfs_bnode_get(node); in hfs_bnode_split()
248 node->this, new_node->this, node->next); in hfs_bnode_split()
249 new_node->next = node->next; in hfs_bnode_split()
250 new_node->prev = node->this; in hfs_bnode_split()
251 new_node->parent = node->parent; in hfs_bnode_split()
252 new_node->type = node->type; in hfs_bnode_split()
253 new_node->height = node->height; in hfs_bnode_split()
255 if (node->next) in hfs_bnode_split()
256 next_node = hfs_bnode_find(tree, node->next); in hfs_bnode_split()
261 hfs_bnode_put(node); in hfs_bnode_split()
266 size = tree->node_size / 2 - node->num_recs * 2 - 14; in hfs_bnode_split()
270 data_start = hfs_bnode_read_u16(node, old_rec_off); in hfs_bnode_split()
274 if (++num_recs < node->num_recs) in hfs_bnode_split()
277 hfs_bnode_put(node); in hfs_bnode_split()
290 data_start = hfs_bnode_read_u16(node, old_rec_off); in hfs_bnode_split()
292 hfs_bnode_put(node); in hfs_bnode_split()
299 new_node->num_recs = node->num_recs - num_recs; in hfs_bnode_split()
300 node->num_recs = num_recs; in hfs_bnode_split()
311 data_end = hfs_bnode_read_u16(node, old_rec_off); in hfs_bnode_split()
316 hfs_bnode_copy(new_node, 14, node, data_start, data_end - data_start); in hfs_bnode_split()
328 node->next = new_node->this; in hfs_bnode_split()
329 hfs_bnode_read(node, &node_desc, 0, sizeof(node_desc)); in hfs_bnode_split()
330 node_desc.next = cpu_to_be32(node->next); in hfs_bnode_split()
331 node_desc.num_recs = cpu_to_be16(node->num_recs); in hfs_bnode_split()
332 hfs_bnode_write(node, &node_desc, 0, sizeof(node_desc)); in hfs_bnode_split()
341 } else if (node->this == tree->leaf_tail) { in hfs_bnode_split()
347 hfs_bnode_dump(node); in hfs_bnode_split()
349 hfs_bnode_put(node); in hfs_bnode_split()
357 struct hfs_bnode *node, *new_node, *parent; in hfs_brec_update_parent() local
363 node = fd->bnode; in hfs_brec_update_parent()
365 if (!node->parent) in hfs_brec_update_parent()
369 parent = hfs_bnode_find(tree, node->parent); in hfs_brec_update_parent()
379 newkeylen = hfs_bnode_read_u16(node, 14) + 2; in hfs_brec_update_parent()
419 hfs_bnode_copy(parent, fd->keyoffset, node, 14, newkeylen); in hfs_brec_update_parent()
422 hfs_bnode_put(node); in hfs_brec_update_parent()
423 node = parent; in hfs_brec_update_parent()
439 if (new_node == node) in hfs_brec_update_parent()
442 hfs_bnode_read_key(node, fd->search_key, 14); in hfs_brec_update_parent()
446 if (!rec && node->parent) in hfs_brec_update_parent()
449 fd->bnode = node; in hfs_brec_update_parent()
455 struct hfs_bnode *node, *new_node; in hfs_btree_inc_height() local
460 node = NULL; in hfs_btree_inc_height()
462 node = hfs_bnode_find(tree, tree->root); in hfs_btree_inc_height()
463 if (IS_ERR(node)) in hfs_btree_inc_height()
464 return PTR_ERR(node); in hfs_btree_inc_height()
468 hfs_bnode_put(node); in hfs_btree_inc_height()
497 if (node) { in hfs_btree_inc_height()
499 node->parent = tree->root; in hfs_btree_inc_height()
500 if (node->type == HFS_NODE_LEAF || in hfs_btree_inc_height()
503 key_size = hfs_bnode_read_u16(node, 14) + 2; in hfs_btree_inc_height()
506 hfs_bnode_copy(new_node, 14, node, 14, key_size); in hfs_btree_inc_height()
513 cnid = cpu_to_be32(node->this); in hfs_btree_inc_height()
519 hfs_bnode_put(node); in hfs_btree_inc_height()