90 	end_rec_off = tree->node_size - (node->num_recs + 1) * 2;  in hfs_brec_insert()
107 	node->num_recs++;  in hfs_brec_insert()
110 		offsetof(struct hfs_bnode_desc, num_recs),  in hfs_brec_insert()
111 		node->num_recs);  in hfs_brec_insert()
187 	end_off = tree->node_size - (node->num_recs + 1) * 2;  in hfs_brec_remove()
196 	if (!--node->num_recs) {  in hfs_brec_remove()
210 		offsetof(struct hfs_bnode_desc, num_recs),  in hfs_brec_remove()
211 		node->num_recs);  in hfs_brec_remove()
238 	int num_recs, new_rec_off, new_off, old_rec_off;  in hfs_bnode_split()  local
266 	size = tree->node_size / 2 - node->num_recs * 2 - 14;  in hfs_bnode_split()
268 	num_recs = 1;  in hfs_bnode_split()
274 		if (++num_recs < node->num_recs)  in hfs_bnode_split()
284 	if (fd->record + 1 < num_recs) {  in hfs_bnode_split()
289 		num_recs--;  in hfs_bnode_split()
295 		fd->record -= num_recs;  in hfs_bnode_split()
299 	new_node->num_recs = node->num_recs - num_recs;  in hfs_bnode_split()
300 	node->num_recs = num_recs;  in hfs_bnode_split()
305 	num_recs = new_node->num_recs;  in hfs_bnode_split()
307 	while (num_recs) {  in hfs_bnode_split()
313 		num_recs--;  in hfs_bnode_split()
323 	node_desc.num_recs = cpu_to_be16(new_node->num_recs);  in hfs_bnode_split()
331 	node_desc.num_recs = cpu_to_be16(node->num_recs);  in hfs_bnode_split()
386 	end_rec_off = tree->node_size - (parent->num_recs + 1) * 2;  in hfs_brec_update_parent()
403 				(parent->num_recs + 1) * 2;  in hfs_brec_update_parent()
476 		new_node->num_recs = 0;  in hfs_btree_inc_height()
479 		new_node->num_recs = 1;  in hfs_btree_inc_height()
490 	node_desc.num_recs = cpu_to_be16(new_node->num_recs);  in hfs_btree_inc_height()