24 	dataoff = node->tree->node_size - (rec + 2) * 2;  in hfs_brec_lenoff()
44 			node->tree->node_size - (rec + 1) * 2);  in hfs_brec_keylen()
47 		if (recoff > node->tree->node_size - 2) {  in hfs_brec_keylen()
90 	end_rec_off = tree->node_size - (node->num_recs + 1) * 2;  in hfs_brec_insert()
115 	idx_rec_off = tree->node_size - (rec + 1) * 2;  in hfs_brec_insert()
186 	rec_off = tree->node_size - (fd->record + 2) * 2;  in hfs_brec_remove()
187 	end_off = tree->node_size - (node->num_recs + 1) * 2;  in hfs_brec_remove()
266 	size = tree->node_size / 2 - node->num_recs * 2 - 14;  in hfs_bnode_split()
267 	old_rec_off = tree->node_size - 4;  in hfs_bnode_split()
302 	new_rec_off = tree->node_size - 2;  in hfs_bnode_split()
387 	rec_off = tree->node_size - (rec + 2) * 2;  in hfs_brec_update_parent()
388 	end_rec_off = tree->node_size - (parent->num_recs + 1) * 2;  in hfs_brec_update_parent()
403 			rec_off = tree->node_size - (rec + 2) * 2;  in hfs_brec_update_parent()
404 			end_rec_off = tree->node_size -  in hfs_brec_update_parent()
496 	rec = tree->node_size - 2;  in hfs_btree_inc_height()