Lines Matching refs:new_node
66 struct hfs_bnode *node, *new_node; in hfs_brec_insert() local
82 new_node = NULL; in hfs_brec_insert()
98 if (new_node) in hfs_brec_insert()
100 new_node = hfs_bnode_split(fd); in hfs_brec_insert()
101 if (IS_ERR(new_node)) in hfs_brec_insert()
102 return PTR_ERR(new_node); in hfs_brec_insert()
140 if (!rec && new_node != node) { in hfs_brec_insert()
145 if (new_node) { in hfs_brec_insert()
147 if (!new_node->parent) { in hfs_brec_insert()
149 new_node->parent = tree->root; in hfs_brec_insert()
151 fd->bnode = hfs_bnode_find(tree, new_node->parent); in hfs_brec_insert()
154 cnid = cpu_to_be32(new_node->this); in hfs_brec_insert()
159 hfs_bnode_read_key(new_node, fd->search_key, 14); in hfs_brec_insert()
162 hfs_bnode_put(new_node); in hfs_brec_insert()
163 new_node = NULL; in hfs_brec_insert()
238 struct hfs_bnode *node, *new_node, *next_node; in hfs_bnode_split() local
245 new_node = hfs_bmap_alloc(tree); in hfs_bnode_split()
246 if (IS_ERR(new_node)) in hfs_bnode_split()
247 return new_node; in hfs_bnode_split()
250 node->this, new_node->this, node->next); in hfs_bnode_split()
251 new_node->next = node->next; in hfs_bnode_split()
252 new_node->prev = node->this; in hfs_bnode_split()
253 new_node->parent = node->parent; in hfs_bnode_split()
254 new_node->type = node->type; in hfs_bnode_split()
255 new_node->height = node->height; in hfs_bnode_split()
264 hfs_bnode_put(new_node); in hfs_bnode_split()
280 hfs_bnode_put(new_node); in hfs_bnode_split()
295 hfs_bnode_get(new_node); in hfs_bnode_split()
296 fd->bnode = new_node; in hfs_bnode_split()
301 new_node->num_recs = node->num_recs - num_recs; in hfs_bnode_split()
307 num_recs = new_node->num_recs; in hfs_bnode_split()
310 hfs_bnode_write_u16(new_node, new_rec_off, new_off); in hfs_bnode_split()
317 hfs_bnode_write_u16(new_node, new_rec_off, new_off); in hfs_bnode_split()
318 hfs_bnode_copy(new_node, 14, node, data_start, data_end - data_start); in hfs_bnode_split()
321 node_desc.next = cpu_to_be32(new_node->next); in hfs_bnode_split()
322 node_desc.prev = cpu_to_be32(new_node->prev); in hfs_bnode_split()
323 node_desc.type = new_node->type; in hfs_bnode_split()
324 node_desc.height = new_node->height; in hfs_bnode_split()
325 node_desc.num_recs = cpu_to_be16(new_node->num_recs); in hfs_bnode_split()
327 hfs_bnode_write(new_node, &node_desc, 0, sizeof(node_desc)); in hfs_bnode_split()
330 node->next = new_node->this; in hfs_bnode_split()
338 next_node->prev = new_node->this; in hfs_bnode_split()
345 tree->leaf_tail = new_node->this; in hfs_bnode_split()
350 hfs_bnode_dump(new_node); in hfs_bnode_split()
353 return new_node; in hfs_bnode_split()
359 struct hfs_bnode *node, *new_node, *parent; in hfs_brec_update_parent() local
366 new_node = NULL; in hfs_brec_update_parent()
400 new_node = hfs_bnode_split(fd); in hfs_brec_update_parent()
401 if (IS_ERR(new_node)) in hfs_brec_update_parent()
402 return PTR_ERR(new_node); in hfs_brec_update_parent()
429 if (new_node) { in hfs_brec_update_parent()
432 if (!new_node->parent) { in hfs_brec_update_parent()
434 new_node->parent = tree->root; in hfs_brec_update_parent()
436 fd->bnode = hfs_bnode_find(tree, new_node->parent); in hfs_brec_update_parent()
438 hfs_bnode_read_key(new_node, fd->search_key, 14); in hfs_brec_update_parent()
439 cnid = cpu_to_be32(new_node->this); in hfs_brec_update_parent()
444 hfs_bnode_put(new_node); in hfs_brec_update_parent()
447 if (new_node == node) in hfs_brec_update_parent()
452 new_node = NULL; in hfs_brec_update_parent()
464 struct hfs_bnode *node, *new_node; in hfs_btree_inc_height() local
475 new_node = hfs_bmap_alloc(tree); in hfs_btree_inc_height()
476 if (IS_ERR(new_node)) { in hfs_btree_inc_height()
478 return PTR_ERR(new_node); in hfs_btree_inc_height()
481 tree->root = new_node->this; in hfs_btree_inc_height()
483 tree->leaf_head = tree->leaf_tail = new_node->this; in hfs_btree_inc_height()
484 new_node->type = HFS_NODE_LEAF; in hfs_btree_inc_height()
485 new_node->num_recs = 0; in hfs_btree_inc_height()
487 new_node->type = HFS_NODE_INDEX; in hfs_btree_inc_height()
488 new_node->num_recs = 1; in hfs_btree_inc_height()
490 new_node->parent = 0; in hfs_btree_inc_height()
491 new_node->next = 0; in hfs_btree_inc_height()
492 new_node->prev = 0; in hfs_btree_inc_height()
493 new_node->height = ++tree->depth; in hfs_btree_inc_height()
495 node_desc.next = cpu_to_be32(new_node->next); in hfs_btree_inc_height()
496 node_desc.prev = cpu_to_be32(new_node->prev); in hfs_btree_inc_height()
497 node_desc.type = new_node->type; in hfs_btree_inc_height()
498 node_desc.height = new_node->height; in hfs_btree_inc_height()
499 node_desc.num_recs = cpu_to_be16(new_node->num_recs); in hfs_btree_inc_height()
501 hfs_bnode_write(new_node, &node_desc, 0, sizeof(node_desc)); in hfs_btree_inc_height()
504 hfs_bnode_write_u16(new_node, rec, 14); in hfs_btree_inc_height()
515 hfs_bnode_copy(new_node, 14, node, 14, key_size); in hfs_btree_inc_height()
520 hfs_bnode_write_u16(new_node, 14, tree->max_key_len); in hfs_btree_inc_height()
523 hfs_bnode_write(new_node, &cnid, 14 + key_size, 4); in hfs_btree_inc_height()
526 hfs_bnode_write_u16(new_node, rec, 14 + key_size + 4); in hfs_btree_inc_height()
530 hfs_bnode_put(new_node); in hfs_btree_inc_height()