48 	struct hfs_bnode *bnode = belem->bnr.bn;  in bdelete_nonempty()
92 	struct hfs_btree *tree = root->bn->tree;  in del_root()
96 	if (root->bn->ndNRecs > 1) {  in del_root()
98 	} else if (root->bn->ndNRecs == 0) {  in del_root()
113 	} else if (root->bn->ndType == ndIndxNode) {  in del_root()
115 		node = hfs_get_hl(bkey_record(bnode_datastart(root->bn)));  in del_root()
118 		if (!child.bn) {  in del_root()
123 		child.bn->sticky = HFS_STICKY;  in del_root()
124         	if (child.bn->next) {  in del_root()
125                 	child.bn->next->prev = child.bn->prev;  in del_root()
127         	if (child.bn->prev) {  in del_root()
128                 	child.bn->prev->next = child.bn->next;  in del_root()
130         	if (bhash(tree, child.bn->node) == child.bn) {  in del_root()
131                 	bhash(tree, child.bn->node) = child.bn->next;  in del_root()
133 		child.bn->next = NULL;  in del_root()
134 		child.bn->prev = NULL;  in del_root()
136 		tree->bthRoot = child.bn->node;  in del_root()
137 		tree->root = child.bn;  in del_root()
141 		if (child.bn->ndType == ndLeafNode) {  in del_root()
207 	struct hfs_bnode *bnode = center->bn;  in delete_empty_bnode()
210 		left->bn->ndFLink = right_node;  in delete_empty_bnode()
217 		right->bn->ndBLink = left_node;  in delete_empty_bnode()
309 		bnode = belem->bnr.bn;  in bdelete()
336 			if (!left.bn) {  in bdelete()
344 				left_space = bnode_freespace(left.bn);  in bdelete()
349 			left.bn = NULL;  in bdelete()
356 			if (!right.bn) {  in bdelete()
363 			if (parent->record < parent->bnr.bn->ndNRecs) {  in bdelete()
364 				right_space = bnode_freespace(right.bn);  in bdelete()
369 			right.bn = NULL;  in bdelete()
392 				hfs_bnode_shift_left(left.bn, bnode,  in bdelete()
395 				hfs_bnode_shift_right(bnode, right.bn, 1);  in bdelete()
401 			balance(bnode, right.bn);  in bdelete()
404 			balance(left.bn, bnode);  in bdelete()
409 			hfs_bnode_update_key(brec, belem, right.bn, 1);  in bdelete()
463 		bnode = belem->bnr.bn;  in hfs_bdelete()