Lines Matching refs:rec
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
45 recoff = hfs_bnode_read_u16(node, node->tree->node_size - (rec + 1) * 2); in hfs_brec_keylen()
69 int size, key_len, rec; in hfs_brec_insert() local
88 rec = fd->record + 1; in hfs_brec_insert()
98 rec, size, end_off, end_rec_off); in hfs_brec_insert()
117 idx_rec_off = tree->node_size - (rec + 1) * 2; in hfs_brec_insert()
140 if (!rec && new_node != node) { in hfs_brec_insert()
357 int rec, rec_off, end_rec_off; in hfs_brec_update_parent() local
374 rec = fd->record; in hfs_brec_update_parent()
382 rec, fd->keylength, newkeylen); in hfs_brec_update_parent()
384 rec_off = tree->node_size - (rec + 2) * 2; in hfs_brec_update_parent()
399 rec = fd->record; in hfs_brec_update_parent()
400 rec_off = tree->node_size - (rec + 2) * 2; in hfs_brec_update_parent()
442 if (!rec) { in hfs_brec_update_parent()
451 if (!rec && node->parent) in hfs_brec_update_parent()
462 int key_size, rec; in hfs_btree_inc_height() local
499 rec = tree->node_size - 2; in hfs_btree_inc_height()
500 hfs_bnode_write_u16(new_node, rec, 14); in hfs_btree_inc_height()
520 rec -= 2; in hfs_btree_inc_height()
521 hfs_bnode_write_u16(new_node, rec, 14 + key_size + 4); in hfs_btree_inc_height()