25 	dataoff = node->tree->node_size - (rec + 2) * 2;  in hfs_brec_lenoff()
45 			node->tree->node_size - (rec + 1) * 2);  in hfs_brec_keylen()
48 		if (recoff > node->tree->node_size - 2) {  in hfs_brec_keylen()
92 	end_rec_off = tree->node_size - (node->num_recs + 1) * 2;  in hfs_brec_insert()
117 	idx_rec_off = tree->node_size - (rec + 1) * 2;  in hfs_brec_insert()
188 	rec_off = tree->node_size - (fd->record + 2) * 2;  in hfs_brec_remove()
189 	end_off = tree->node_size - (node->num_recs + 1) * 2;  in hfs_brec_remove()
268 	size = tree->node_size / 2 - node->num_recs * 2 - 14;  in hfs_bnode_split()
269 	old_rec_off = tree->node_size - 4;  in hfs_bnode_split()
304 	new_rec_off = tree->node_size - 2;  in hfs_bnode_split()
389 	rec_off = tree->node_size - (rec + 2) * 2;  in hfs_brec_update_parent()
390 	end_rec_off = tree->node_size - (parent->num_recs + 1) * 2;  in hfs_brec_update_parent()
405 			rec_off = tree->node_size - (rec + 2) * 2;  in hfs_brec_update_parent()
406 			end_rec_off = tree->node_size -  in hfs_brec_update_parent()
503 	rec = tree->node_size - 2;  in hfs_btree_inc_height()