19 u16 hfs_brec_lenoff(struct hfs_bnode *node, u16 rec, u16 *off)  in hfs_brec_lenoff()  argument
24 	dataoff = node->tree->node_size - (rec + 2) * 2;  in hfs_brec_lenoff()
31 u16 hfs_brec_keylen(struct hfs_bnode *node, u16 rec)  in hfs_brec_keylen()  argument
42 		recoff = hfs_bnode_read_u16(node, node->tree->node_size - (rec + 1) * 2);  in hfs_brec_keylen()
57 	int size, key_len, rec;  in hfs_brec_insert()  local
75 	rec = fd->record + 1;  in hfs_brec_insert()
84 	dprint(DBG_BNODE_MOD, "insert_rec: %d, %d, %d, %d\n", rec, size, end_off, end_rec_off);  in hfs_brec_insert()
103 	idx_rec_off = tree->node_size - (rec + 1) * 2;  in hfs_brec_insert()
126 		if (!rec && new_node != node)  in hfs_brec_insert()
157 	if (!rec)  in hfs_brec_insert()
330 	int rec, rec_off, end_rec_off;  in hfs_brec_update_parent()  local
345 	rec = fd->record;  in hfs_brec_update_parent()
352 	dprint(DBG_BNODE_MOD, "update_rec: %d, %d, %d\n", rec, fd->keylength, newkeylen);  in hfs_brec_update_parent()
354 	rec_off = tree->node_size - (rec + 2) * 2;  in hfs_brec_update_parent()
369 			rec = fd->record;  in hfs_brec_update_parent()
370 			rec_off = tree->node_size - (rec + 2) * 2;  in hfs_brec_update_parent()
406 		if (!rec) {  in hfs_brec_update_parent()
414 	if (!rec && node->parent)  in hfs_brec_update_parent()
425 	int key_size, rec;  in hfs_btree_inc_height()  local
462 	rec = tree->node_size - 2;  in hfs_btree_inc_height()
463 	hfs_bnode_write_u16(new_node, rec, 14);  in hfs_btree_inc_height()
482 		rec -= 2;  in hfs_btree_inc_height()
483 		hfs_bnode_write_u16(new_node, rec, 14 + key_size + 4);  in hfs_btree_inc_height()