Lines Matching refs:parent
137 * update parent key if we inserted a key
147 if (!new_node->parent) {
149 new_node->parent = tree->root;
151 fd->bnode = hfs_bnode_find(tree, new_node->parent);
180 struct hfs_bnode *node, *parent;
198 if (!node->parent)
200 parent = hfs_bnode_find(tree, node->parent);
201 if (IS_ERR(parent))
202 return PTR_ERR(parent);
204 node = fd->bnode = parent;
249 new_node->parent = node->parent;
355 struct hfs_bnode *node, *new_node, *parent;
363 if (!node->parent)
367 parent = hfs_bnode_find(tree, node->parent);
368 if (IS_ERR(parent))
369 return PTR_ERR(parent);
370 __hfs_brec_find(parent, fd);
373 hfs_bnode_dump(parent);
385 end_rec_off = tree->node_size - (parent->num_recs + 1) * 2;
390 end_off = hfs_bnode_read_u16(parent, end_rec_off);
394 fd->bnode = parent;
398 parent = fd->bnode;
401 end_rec_off = tree->node_size - (parent->num_recs + 1) * 2;
405 end_off = start_off = hfs_bnode_read_u16(parent, rec_off);
406 hfs_bnode_write_u16(parent, rec_off, start_off + diff);
411 end_off = hfs_bnode_read_u16(parent, rec_off);
412 hfs_bnode_write_u16(parent, rec_off, end_off + diff);
414 hfs_bnode_move(parent, start_off + diff, start_off,
417 hfs_bnode_copy(parent, fd->keyoffset, node, 14, newkeylen);
419 hfs_bnode_write_u8(parent, fd->keyoffset, newkeylen - 1);
420 hfs_bnode_dump(parent);
423 node = parent;
428 if (!new_node->parent) {
430 new_node->parent = tree->root;
432 fd->bnode = hfs_bnode_find(tree, new_node->parent);
451 if (!rec && node->parent)
486 new_node->parent = 0;
504 node->parent = tree->root;