Lines Matching defs: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);
182 struct hfs_bnode *node, *parent;
200 if (!node->parent)
202 parent = hfs_bnode_find(tree, node->parent);
203 if (IS_ERR(parent))
204 return PTR_ERR(parent);
206 node = fd->bnode = parent;
253 new_node->parent = node->parent;
359 struct hfs_bnode *node, *new_node, *parent;
367 if (!node->parent)
371 parent = hfs_bnode_find(tree, node->parent);
372 if (IS_ERR(parent))
373 return PTR_ERR(parent);
374 __hfs_brec_find(parent, fd, hfs_find_rec_by_key);
377 hfs_bnode_dump(parent);
390 end_rec_off = tree->node_size - (parent->num_recs + 1) * 2;
395 end_off = hfs_bnode_read_u16(parent, end_rec_off);
399 fd->bnode = parent;
403 parent = fd->bnode;
407 (parent->num_recs + 1) * 2;
411 end_off = start_off = hfs_bnode_read_u16(parent, rec_off);
412 hfs_bnode_write_u16(parent, rec_off, start_off + diff);
417 end_off = hfs_bnode_read_u16(parent, rec_off);
418 hfs_bnode_write_u16(parent, rec_off, end_off + diff);
420 hfs_bnode_move(parent, start_off + diff, start_off,
423 hfs_bnode_copy(parent, fd->keyoffset, node, 14, newkeylen);
424 hfs_bnode_dump(parent);
427 node = parent;
432 if (!new_node->parent) {
434 new_node->parent = tree->root;
436 fd->bnode = hfs_bnode_find(tree, new_node->parent);
455 if (!rec && node->parent)
490 new_node->parent = 0;
508 node->parent = tree->root;