Lines Matching defs:new_node
56 struct hfs_bnode *node, *new_node;
71 new_node = NULL;
86 if (new_node)
88 new_node = hfs_bnode_split(fd);
89 if (IS_ERR(new_node))
90 return PTR_ERR(new_node);
122 if (new_node) {
126 if (!rec && new_node != node)
130 if (!new_node->parent) {
132 new_node->parent = tree->root;
134 fd->bnode = hfs_bnode_find(tree, new_node->parent);
137 cnid = cpu_to_be32(new_node->this);
142 hfs_bnode_read_key(new_node, fd->search_key, 14);
145 hfs_bnode_put(new_node);
146 new_node = NULL;
219 struct hfs_bnode *node, *new_node;
226 new_node = hfs_bmap_alloc(tree);
227 if (IS_ERR(new_node))
228 return new_node;
231 node->this, new_node->this, node->next);
232 new_node->next = node->next;
233 new_node->prev = node->this;
234 new_node->parent = node->parent;
235 new_node->type = node->type;
236 new_node->height = node->height;
250 hfs_bnode_put(new_node);
263 hfs_bnode_get(new_node);
264 fd->bnode = new_node;
269 new_node->num_recs = node->num_recs - num_recs;
275 num_recs = new_node->num_recs;
278 hfs_bnode_write_u16(new_node, new_rec_off, new_off);
285 hfs_bnode_write_u16(new_node, new_rec_off, new_off);
286 hfs_bnode_copy(new_node, 14, node, data_start, data_end - data_start);
289 node_desc.next = cpu_to_be32(new_node->next);
290 node_desc.prev = cpu_to_be32(new_node->prev);
291 node_desc.type = new_node->type;
292 node_desc.height = new_node->height;
293 node_desc.num_recs = cpu_to_be16(new_node->num_recs);
295 hfs_bnode_write(new_node, &node_desc, 0, sizeof(node_desc));
298 node->next = new_node->this;
305 if (new_node->next) {
306 struct hfs_bnode *next_node = hfs_bnode_find(tree, new_node->next);
307 next_node->prev = new_node->this;
314 tree->leaf_tail = new_node->this;
319 hfs_bnode_dump(new_node);
322 return new_node;
328 struct hfs_bnode *node, *new_node, *parent;
335 new_node = NULL;
365 new_node = hfs_bnode_split(fd);
366 if (IS_ERR(new_node))
367 return PTR_ERR(new_node);
393 if (new_node) {
396 fd->bnode = hfs_bnode_find(tree, new_node->parent);
398 hfs_bnode_read_key(new_node, fd->search_key, 14);
399 cnid = cpu_to_be32(new_node->this);
404 hfs_bnode_put(new_node);
407 if (new_node == node)
423 struct hfs_bnode *node, *new_node;
434 new_node = hfs_bmap_alloc(tree);
435 if (IS_ERR(new_node)) {
437 return PTR_ERR(new_node);
440 tree->root = new_node->this;
442 tree->leaf_head = tree->leaf_tail = new_node->this;
443 new_node->type = HFS_NODE_LEAF;
444 new_node->num_recs = 0;
446 new_node->type = HFS_NODE_INDEX;
447 new_node->num_recs = 1;
449 new_node->parent = 0;
450 new_node->next = 0;
451 new_node->prev = 0;
452 new_node->height = ++tree->depth;
454 node_desc.next = cpu_to_be32(new_node->next);
455 node_desc.prev = cpu_to_be32(new_node->prev);
456 node_desc.type = new_node->type;
457 node_desc.height = new_node->height;
458 node_desc.num_recs = cpu_to_be16(new_node->num_recs);
460 hfs_bnode_write(new_node, &node_desc, 0, sizeof(node_desc));
463 hfs_bnode_write_u16(new_node, rec, 14);
473 hfs_bnode_copy(new_node, 14, node, 14, key_size);
477 hfs_bnode_write_u16(new_node, 14, tree->max_key_len);
480 hfs_bnode_write(new_node, &cnid, 14 + key_size, 4);
483 hfs_bnode_write_u16(new_node, rec, 14 + key_size + 4);
487 hfs_bnode_put(new_node);