Lines Matching defs:new_node
58 struct hfs_bnode *node, *new_node;
73 new_node = NULL;
88 if (new_node)
90 new_node = hfs_bnode_split(fd);
91 if (IS_ERR(new_node))
92 return PTR_ERR(new_node);
124 if (new_node) {
128 if (!rec && new_node != node)
132 if (!new_node->parent) {
134 new_node->parent = tree->root;
136 fd->bnode = hfs_bnode_find(tree, new_node->parent);
139 cnid = cpu_to_be32(new_node->this);
144 hfs_bnode_read_key(new_node, fd->search_key, 14);
147 hfs_bnode_put(new_node);
148 new_node = NULL;
221 struct hfs_bnode *node, *new_node;
228 new_node = hfs_bmap_alloc(tree);
229 if (IS_ERR(new_node))
230 return new_node;
233 node->this, new_node->this, node->next);
234 new_node->next = node->next;
235 new_node->prev = node->this;
236 new_node->parent = node->parent;
237 new_node->type = node->type;
238 new_node->height = node->height;
252 hfs_bnode_put(new_node);
265 hfs_bnode_get(new_node);
266 fd->bnode = new_node;
271 new_node->num_recs = node->num_recs - num_recs;
277 num_recs = new_node->num_recs;
280 hfs_bnode_write_u16(new_node, new_rec_off, new_off);
287 hfs_bnode_write_u16(new_node, new_rec_off, new_off);
288 hfs_bnode_copy(new_node, 14, node, data_start, data_end - data_start);
291 node_desc.next = cpu_to_be32(new_node->next);
292 node_desc.prev = cpu_to_be32(new_node->prev);
293 node_desc.type = new_node->type;
294 node_desc.height = new_node->height;
295 node_desc.num_recs = cpu_to_be16(new_node->num_recs);
297 hfs_bnode_write(new_node, &node_desc, 0, sizeof(node_desc));
300 node->next = new_node->this;
307 if (new_node->next) {
308 struct hfs_bnode *next_node = hfs_bnode_find(tree, new_node->next);
309 next_node->prev = new_node->this;
316 tree->leaf_tail = new_node->this;
321 hfs_bnode_dump(new_node);
324 return new_node;
330 struct hfs_bnode *node, *new_node, *parent;
337 new_node = NULL;
367 new_node = hfs_bnode_split(fd);
368 if (IS_ERR(new_node))
369 return PTR_ERR(new_node);
397 if (new_node) {
400 fd->bnode = hfs_bnode_find(tree, new_node->parent);
402 hfs_bnode_read_key(new_node, fd->search_key, 14);
403 cnid = cpu_to_be32(new_node->this);
408 hfs_bnode_put(new_node);
411 if (new_node == node)
427 struct hfs_bnode *node, *new_node;
438 new_node = hfs_bmap_alloc(tree);
439 if (IS_ERR(new_node)) {
441 return PTR_ERR(new_node);
444 tree->root = new_node->this;
446 tree->leaf_head = tree->leaf_tail = new_node->this;
447 new_node->type = HFS_NODE_LEAF;
448 new_node->num_recs = 0;
450 new_node->type = HFS_NODE_INDEX;
451 new_node->num_recs = 1;
453 new_node->parent = 0;
454 new_node->next = 0;
455 new_node->prev = 0;
456 new_node->height = ++tree->depth;
458 node_desc.next = cpu_to_be32(new_node->next);
459 node_desc.prev = cpu_to_be32(new_node->prev);
460 node_desc.type = new_node->type;
461 node_desc.height = new_node->height;
462 node_desc.num_recs = cpu_to_be16(new_node->num_recs);
464 hfs_bnode_write(new_node, &node_desc, 0, sizeof(node_desc));
467 hfs_bnode_write_u16(new_node, rec, 14);
477 hfs_bnode_copy(new_node, 14, node, 14, key_size);
481 hfs_bnode_write_u8(new_node, 14, tree->max_key_len);
485 hfs_bnode_write(new_node, &cnid, 14 + key_size, 4);
488 hfs_bnode_write_u16(new_node, rec, 14 + key_size + 4);
492 hfs_bnode_put(new_node);