Lines Matching defs:node
19 /* Get the length and offset of the given record in the given node */
20 u16 hfs_brec_lenoff(struct hfs_bnode *node, u16 rec, u16 *off)
25 dataoff = node->tree->node_size - (rec + 2) * 2;
26 hfs_bnode_read(node, retval, dataoff, 4);
32 u16 hfs_brec_keylen(struct hfs_bnode *node, u16 rec)
36 if (node->type != HFS_NODE_INDEX && node->type != HFS_NODE_LEAF)
39 if ((node->type == HFS_NODE_INDEX) &&
40 !(node->tree->attributes & HFS_TREE_VARIDXKEYS) &&
41 (node->tree->cnid != HFSPLUS_ATTR_CNID)) {
42 retval = node->tree->max_key_len + 2;
44 recoff = hfs_bnode_read_u16(node,
45 node->tree->node_size - (rec + 1) * 2);
48 if (recoff > node->tree->node_size - 2) {
53 retval = hfs_bnode_read_u16(node, recoff) + 2;
54 if (retval > node->tree->max_key_len + 2) {
66 struct hfs_bnode *node, *new_node;
76 node = hfs_bnode_find(tree, tree->leaf_head);
77 if (IS_ERR(node))
78 return PTR_ERR(node);
79 fd->bnode = node;
89 node = fd->bnode;
90 hfs_bnode_dump(node);
92 end_rec_off = tree->node_size - (node->num_recs + 1) * 2;
93 end_off = hfs_bnode_read_u16(node, end_rec_off);
105 if (node->type == HFS_NODE_LEAF) {
109 node->num_recs++;
111 hfs_bnode_write_u16(node,
113 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);
182 struct hfs_bnode *node, *parent;
186 node = fd->bnode;
189 end_off = tree->node_size - (node->num_recs + 1) * 2;
191 if (node->type == HFS_NODE_LEAF) {
195 hfs_bnode_dump(node);
198 if (!--node->num_recs) {
199 hfs_bnode_unlink(node);
200 if (!node->parent)
202 parent = hfs_bnode_find(tree, node->parent);
205 hfs_bnode_put(node);
206 node = fd->bnode = parent;
208 __hfs_brec_find(node, fd, hfs_find_rec_by_key);
211 hfs_bnode_write_u16(node,
213 node->num_recs);
220 data_off = hfs_bnode_read_u16(node, rec_off);
221 hfs_bnode_write_u16(node, rec_off + 2, data_off - size);
226 hfs_bnode_move(node, fd->keyoffset, fd->keyoffset + size,
229 hfs_bnode_dump(node);
238 struct hfs_bnode *node, *new_node, *next_node;
244 node = fd->bnode;
248 hfs_bnode_get(node);
250 node->this, new_node->this, node->next);
251 new_node->next = node->next;
252 new_node->prev = node->this;
253 new_node->parent = node->parent;
254 new_node->type = node->type;
255 new_node->height = node->height;
257 if (node->next)
258 next_node = hfs_bnode_find(tree, node->next);
263 hfs_bnode_put(node);
268 size = tree->node_size / 2 - node->num_recs * 2 - 14;
272 data_start = hfs_bnode_read_u16(node, old_rec_off);
276 if (++num_recs < node->num_recs)
279 hfs_bnode_put(node);
292 data_start = hfs_bnode_read_u16(node, old_rec_off);
294 hfs_bnode_put(node);
301 new_node->num_recs = node->num_recs - num_recs;
302 node->num_recs = num_recs;
313 data_end = hfs_bnode_read_u16(node, old_rec_off);
318 hfs_bnode_copy(new_node, 14, node, data_start, data_end - data_start);
330 node->next = new_node->this;
331 hfs_bnode_read(node, &node_desc, 0, sizeof(node_desc));
332 node_desc.next = cpu_to_be32(node->next);
333 node_desc.num_recs = cpu_to_be16(node->num_recs);
334 hfs_bnode_write(node, &node_desc, 0, sizeof(node_desc));
343 } else if (node->this == tree->leaf_tail) {
344 /* if there is no next node, this might be the new tail */
349 hfs_bnode_dump(node);
351 hfs_bnode_put(node);
359 struct hfs_bnode *node, *new_node, *parent;
365 node = fd->bnode;
367 if (!node->parent)
371 parent = hfs_bnode_find(tree, node->parent);
383 newkeylen = hfs_bnode_read_u16(node, 14) + 2;
398 hfs_dbg("splitting index node\n");
423 hfs_bnode_copy(parent, fd->keyoffset, node, 14, newkeylen);
426 hfs_bnode_put(node);
427 node = parent;
447 if (new_node == node)
450 hfs_bnode_read_key(node, fd->search_key, 14);
455 if (!rec && node->parent)
458 fd->bnode = node;
464 struct hfs_bnode *node, *new_node;
469 node = NULL;
471 node = hfs_bnode_find(tree, tree->root);
472 if (IS_ERR(node))
473 return PTR_ERR(node);
477 hfs_bnode_put(node);
506 if (node) {
508 node->parent = tree->root;
509 if (node->type == HFS_NODE_LEAF ||
512 key_size = hfs_bnode_read_u16(node, 14) + 2;
515 hfs_bnode_copy(new_node, 14, node, 14, key_size);
522 cnid = cpu_to_be32(node->this);
528 hfs_bnode_put(node);