48 	struct hfs_bnode *bnode = belem->bnr.bn;  in bdelete_nonempty()  local
51 	nrecs = bnode->ndNRecs;  in bdelete_nonempty()
52 	size = bnode_rsize(bnode, rec);  in bdelete_nonempty()
53 	tomove = bnode_offset(bnode, nrecs+1) - bnode_offset(bnode, rec+1);  in bdelete_nonempty()
57 		hfs_put_hs(bnode_offset(bnode,i+1) - size, RECTBL(bnode,i));  in bdelete_nonempty()
61 	start = bnode_key(bnode, rec);  in bdelete_nonempty()
65 	--bnode->ndNRecs;  in bdelete_nonempty()
207 	struct hfs_bnode *bnode = center->bn;  in delete_empty_bnode()  local
211 	} else if (bnode->ndType == ndLeafNode) {  in delete_empty_bnode()
212 		bnode->tree->bthFNode = right_node;  in delete_empty_bnode()
213 		bnode->tree->dirt = 1;  in delete_empty_bnode()
218 	} else if (bnode->ndType == ndLeafNode) {  in delete_empty_bnode()
219 		bnode->tree->bthLNode = left_node;  in delete_empty_bnode()
220 		bnode->tree->dirt = 1;  in delete_empty_bnode()
300 	struct hfs_bnode *bnode;  in bdelete()  local
309 		bnode = belem->bnr.bn;  in bdelete()
315 		if (bnode->node == tree->root->node) {  in bdelete()
322 		left_node = bnode->ndBLink;  in bdelete()
323 		right_node = bnode->ndFLink;  in bdelete()
385 		if (bnode->ndNRecs == 0) {  in bdelete()
388 		} else if (min_space + bnode_freespace(bnode) >= FULL) {  in bdelete()
392 				hfs_bnode_shift_left(left.bn, bnode,  in bdelete()
393 						     bnode->ndNRecs);  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()
415 		if (bnode->ndNRecs) {  in bdelete()
417 				hfs_bnode_update_key(brec, belem, bnode, 0);  in bdelete()
451 	struct hfs_bnode *bnode;  in hfs_bdelete()  local
463 		bnode = belem->bnr.bn;  in hfs_bdelete()
466         	if ((bnode->ndNRecs * sizeof(hfs_u16) + bnode_end(bnode) -  in hfs_bdelete()
467 		     bnode_rsize(bnode, belem->record)) < FULL/2) {  in hfs_bdelete()