43 static void bdelete_nonempty(struct hfs_brec *brec, struct hfs_belem *belem)  in bdelete_nonempty()  argument
48 	struct hfs_bnode *bnode = belem->bnr.bn;  in bdelete_nonempty()
50 	rec = belem->record;  in bdelete_nonempty()
298 	struct hfs_belem *belem = brec->bottom;  in bdelete()  local
299 	struct hfs_belem *parent = (belem-1);  in bdelete()
307 	while ((belem > brec->top) &&  in bdelete()
308 	       (belem->flags & (HFS_BPATH_UNDERFLOW | HFS_BPATH_FIRST))) {  in bdelete()
309 		bnode = belem->bnr.bn;  in bdelete()
310 		fix_key = belem->flags & HFS_BPATH_FIRST;  in bdelete()
313 		bdelete_nonempty(brec, belem);  in bdelete()
316 			del_root(&belem->bnr);  in bdelete()
334 			hfs_bnode_lock(&belem->bnr, HFS_LOCK_RESRV);  in bdelete()
342 			hfs_bnode_lock(&belem->bnr, HFS_LOCK_WRITE);  in bdelete()
386 			delete_empty_bnode(left_node, &left, &belem->bnr,  in bdelete()
398 			delete_empty_bnode(left_node, &left, &belem->bnr,  in bdelete()
409 			hfs_bnode_update_key(brec, belem, right.bn, 1);  in bdelete()
417 				hfs_bnode_update_key(brec, belem, bnode, 0);  in bdelete()
422 		hfs_bnode_free(&belem->bnr);  in bdelete()
424 		belem = parent;  in bdelete()
428 	if (belem < brec->top) {  in bdelete()
434 	bdelete_nonempty(brec, belem);  in bdelete()
450 	struct hfs_belem *belem;  in hfs_bdelete()  local
462 		belem = brec.bottom;  in hfs_bdelete()
463 		bnode = belem->bnr.bn;  in hfs_bdelete()
465 		belem->flags = 0;  in hfs_bdelete()
467 		     bnode_rsize(bnode, belem->record)) < FULL/2) {  in hfs_bdelete()
468 			belem->flags |= HFS_BPATH_UNDERFLOW;  in hfs_bdelete()
470 		if (belem->record == 1) {  in hfs_bdelete()
471 			belem->flags |= HFS_BPATH_FIRST;  in hfs_bdelete()
474 		if (!belem->flags) {  in hfs_bdelete()