71 	int data_off, end_off;  in hfs_brec_insert()  local
95 	end_off = hfs_bnode_read_u16(node, end_rec_off);  in hfs_brec_insert()
97 	dprint(DBG_BNODE_MOD, "insert_rec: %d, %d, %d, %d\n", rec, size, end_off, end_rec_off);  in hfs_brec_insert()
98 	if (size > end_rec_off - end_off) {  in hfs_brec_insert()
113 	hfs_bnode_write_u16(node, end_rec_off, end_off + size);  in hfs_brec_insert()
114 	data_off = end_off;  in hfs_brec_insert()
128 		       end_off - data_off);  in hfs_brec_insert()
180 	int end_off, rec_off, data_off, size;  in hfs_brec_remove()  local
186 	end_off = tree->node_size - (node->num_recs + 1) * 2;  in hfs_brec_remove()
209 	if (rec_off == end_off)  in hfs_brec_remove()
217 	} while (rec_off >= end_off);  in hfs_brec_remove()
356 	int start_off, end_off;  in hfs_brec_update_parent()  local
385 		end_off = hfs_bnode_read_u16(parent, end_rec_off);  in hfs_brec_update_parent()
386 		if (end_rec_off - end_off < diff) {  in hfs_brec_update_parent()
400 	end_off = start_off = hfs_bnode_read_u16(parent, rec_off);  in hfs_brec_update_parent()
406 		end_off = hfs_bnode_read_u16(parent, rec_off);  in hfs_brec_update_parent()
407 		hfs_bnode_write_u16(parent, rec_off, end_off + diff);  in hfs_brec_update_parent()
410 		       end_off - start_off);  in hfs_brec_update_parent()