92 	end_rec_off = tree->node_size - (node->num_recs + 1) * 2;  in hfs_brec_insert()
109 	node->num_recs++;  in hfs_brec_insert()
111 	hfs_bnode_write_u16(node, offsetof(struct hfs_bnode_desc, num_recs), node->num_recs);  in hfs_brec_insert()
185 	end_off = tree->node_size - (node->num_recs + 1) * 2;  in hfs_brec_remove()
194 	if (!--node->num_recs) {  in hfs_brec_remove()
207 	hfs_bnode_write_u16(node, offsetof(struct hfs_bnode_desc, num_recs), node->num_recs);  in hfs_brec_remove()
234 	int num_recs, new_rec_off, new_off, old_rec_off;  in hfs_bnode_split()  local
262 	size = tree->node_size / 2 - node->num_recs * 2 - 14;  in hfs_bnode_split()
264 	num_recs = 1;  in hfs_bnode_split()
270 		if (++num_recs < node->num_recs)  in hfs_bnode_split()
280 	if (fd->record + 1 < num_recs) {  in hfs_bnode_split()
285 		num_recs--;  in hfs_bnode_split()
291 		fd->record -= num_recs;  in hfs_bnode_split()
295 	new_node->num_recs = node->num_recs - num_recs;  in hfs_bnode_split()
296 	node->num_recs = num_recs;  in hfs_bnode_split()
301 	num_recs = new_node->num_recs;  in hfs_bnode_split()
303 	while (num_recs) {  in hfs_bnode_split()
309 		num_recs--;  in hfs_bnode_split()
319 	node_desc.num_recs = cpu_to_be16(new_node->num_recs);  in hfs_bnode_split()
327 	node_desc.num_recs = cpu_to_be16(node->num_recs);  in hfs_bnode_split()
383 	end_rec_off = tree->node_size - (parent->num_recs + 1) * 2;  in hfs_brec_update_parent()
399 			end_rec_off = tree->node_size - (parent->num_recs + 1) * 2;  in hfs_brec_update_parent()
474 		new_node->num_recs = 0;  in hfs_btree_inc_height()
477 		new_node->num_recs = 1;  in hfs_btree_inc_height()
488 	node_desc.num_recs = cpu_to_be16(new_node->num_recs);  in hfs_btree_inc_height()