69 	int idx_rec_off, data_rec_off, end_rec_off;  in hfs_brec_insert()  local
92 	end_rec_off = tree->node_size - (node->num_recs + 1) * 2;  in hfs_brec_insert()
93 	end_off = hfs_bnode_read_u16(node, end_rec_off);  in hfs_brec_insert()
94 	end_rec_off -= 2;  in hfs_brec_insert()
96 		rec, size, end_off, end_rec_off);  in hfs_brec_insert()
97 	if (size > end_rec_off - end_off) {  in hfs_brec_insert()
114 	hfs_bnode_write_u16(node, end_rec_off, end_off + size);  in hfs_brec_insert()
116 	data_rec_off = end_rec_off + 2;  in hfs_brec_insert()
361 	int rec, rec_off, end_rec_off;  in hfs_brec_update_parent()  local
390 	end_rec_off = tree->node_size - (parent->num_recs + 1) * 2;  in hfs_brec_update_parent()
395 		end_off = hfs_bnode_read_u16(parent, end_rec_off);  in hfs_brec_update_parent()
396 		if (end_rec_off - end_off < diff) {  in hfs_brec_update_parent()
406 			end_rec_off = tree->node_size -  in hfs_brec_update_parent()
415 	while (rec_off > end_rec_off) {  in hfs_brec_update_parent()