Lines Matching defs:node
18 /* Get the length and offset of the given record in the given node */
19 u16 hfs_brec_lenoff(struct hfs_bnode *node, u16 rec, u16 *off)
24 dataoff = node->tree->node_size - (rec + 2) * 2;
25 hfs_bnode_read(node, retval, dataoff, 4);
31 u16 hfs_brec_keylen(struct hfs_bnode *node, u16 rec)
35 if (node->type != HFS_NODE_INDEX && node->type != HFS_NODE_LEAF)
38 if ((node->type == HFS_NODE_INDEX) &&
39 !(node->tree->attributes & HFS_TREE_VARIDXKEYS)) {
40 if (node->tree->attributes & HFS_TREE_BIGKEYS)
41 retval = node->tree->max_key_len + 2;
43 retval = node->tree->max_key_len + 1;
45 recoff = hfs_bnode_read_u16(node, node->tree->node_size - (rec + 1) * 2);
48 if (node->tree->attributes & HFS_TREE_BIGKEYS) {
49 retval = hfs_bnode_read_u16(node, recoff) + 2;
50 if (retval > node->tree->max_key_len + 2) {
55 retval = (hfs_bnode_read_u8(node, recoff) | 1) + 1;
56 if (retval > node->tree->max_key_len + 1) {
68 struct hfs_bnode *node, *new_node;
78 node = hfs_bnode_find(tree, tree->leaf_head);
79 if (IS_ERR(node))
80 return PTR_ERR(node);
81 fd->bnode = node;
91 node = fd->bnode;
92 hfs_bnode_dump(node);
94 end_rec_off = tree->node_size - (node->num_recs + 1) * 2;
95 end_off = hfs_bnode_read_u16(node, end_rec_off);
107 if (node->type == HFS_NODE_LEAF) {
111 node->num_recs++;
113 hfs_bnode_write_u16(node, offsetof(struct hfs_bnode_desc, num_recs), node->num_recs);
114 hfs_bnode_write_u16(node, end_rec_off, end_off + size);
122 data_off = hfs_bnode_read_u16(node, data_rec_off + 2);
123 hfs_bnode_write_u16(node, data_rec_off, data_off + size);
128 hfs_bnode_move(node, data_off + size, data_off,
132 hfs_bnode_write(node, fd->search_key, data_off, key_len);
133 hfs_bnode_write(node, entry, data_off + key_len, entry_len);
134 hfs_bnode_dump(node);
138 * at the start of the node and it is not the new node
140 if (!rec && new_node != node) {
141 hfs_bnode_read_key(node, fd->search_key, data_off + size);
180 struct hfs_bnode *node, *parent;
184 node = fd->bnode;
187 end_off = tree->node_size - (node->num_recs + 1) * 2;
189 if (node->type == HFS_NODE_LEAF) {
193 hfs_bnode_dump(node);
196 if (!--node->num_recs) {
197 hfs_bnode_unlink(node);
198 if (!node->parent)
200 parent = hfs_bnode_find(tree, node->parent);
203 hfs_bnode_put(node);
204 node = fd->bnode = parent;
206 __hfs_brec_find(node, fd);
209 hfs_bnode_write_u16(node, offsetof(struct hfs_bnode_desc, num_recs), node->num_recs);
216 data_off = hfs_bnode_read_u16(node, rec_off);
217 hfs_bnode_write_u16(node, rec_off + 2, data_off - size);
222 hfs_bnode_move(node, fd->keyoffset, fd->keyoffset + size,
225 hfs_bnode_dump(node);
234 struct hfs_bnode *node, *new_node, *next_node;
240 node = fd->bnode;
244 hfs_bnode_get(node);
246 node->this, new_node->this, node->next);
247 new_node->next = node->next;
248 new_node->prev = node->this;
249 new_node->parent = node->parent;
250 new_node->type = node->type;
251 new_node->height = node->height;
253 if (node->next)
254 next_node = hfs_bnode_find(tree, node->next);
259 hfs_bnode_put(node);
264 size = tree->node_size / 2 - node->num_recs * 2 - 14;
268 data_start = hfs_bnode_read_u16(node, old_rec_off);
272 if (++num_recs < node->num_recs)
275 hfs_bnode_put(node);
288 data_start = hfs_bnode_read_u16(node, old_rec_off);
290 hfs_bnode_put(node);
297 new_node->num_recs = node->num_recs - num_recs;
298 node->num_recs = num_recs;
309 data_end = hfs_bnode_read_u16(node, old_rec_off);
314 hfs_bnode_copy(new_node, 14, node, data_start, data_end - data_start);
326 node->next = new_node->this;
327 hfs_bnode_read(node, &node_desc, 0, sizeof(node_desc));
328 node_desc.next = cpu_to_be32(node->next);
329 node_desc.num_recs = cpu_to_be16(node->num_recs);
330 hfs_bnode_write(node, &node_desc, 0, sizeof(node_desc));
339 } else if (node->this == tree->leaf_tail) {
340 /* if there is no next node, this might be the new tail */
345 hfs_bnode_dump(node);
347 hfs_bnode_put(node);
355 struct hfs_bnode *node, *new_node, *parent;
361 node = fd->bnode;
363 if (!node->parent)
367 parent = hfs_bnode_find(tree, node->parent);
378 newkeylen = (hfs_bnode_read_u8(node, 14) | 1) + 1;
393 printk(KERN_DEBUG "splitting index node...\n");
417 hfs_bnode_copy(parent, fd->keyoffset, node, 14, newkeylen);
422 hfs_bnode_put(node);
423 node = parent;
443 if (new_node == node)
446 hfs_bnode_read_key(node, fd->search_key, 14);
451 if (!rec && node->parent)
454 fd->bnode = node;
460 struct hfs_bnode *node, *new_node;
465 node = NULL;
467 node = hfs_bnode_find(tree, tree->root);
468 if (IS_ERR(node))
469 return PTR_ERR(node);
473 hfs_bnode_put(node);
502 if (node) {
504 node->parent = tree->root;
505 if (node->type == HFS_NODE_LEAF ||
507 key_size = hfs_bnode_read_u8(node, 14) + 1;
510 hfs_bnode_copy(new_node, 14, node, 14, key_size);
517 cnid = cpu_to_be32(node->this);
523 hfs_bnode_put(node);