Home
last modified time | relevance | path

Searched refs:end_rec_off (Results 1 – 2 of 2) sorted by relevance

/fs/hfsplus/
Dbrec.c59 int idx_rec_off, data_rec_off, end_rec_off; in hfs_brec_insert() local
81 end_rec_off = tree->node_size - (node->num_recs + 1) * 2; in hfs_brec_insert()
82 end_off = hfs_bnode_read_u16(node, end_rec_off); in hfs_brec_insert()
83 end_rec_off -= 2; 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()
85 if (size > end_rec_off - end_off) { in hfs_brec_insert()
100 hfs_bnode_write_u16(node, end_rec_off, end_off + size); in hfs_brec_insert()
102 data_rec_off = end_rec_off + 2; in hfs_brec_insert()
330 int rec, rec_off, end_rec_off; in hfs_brec_update_parent() local
355 end_rec_off = tree->node_size - (parent->num_recs + 1) * 2; in hfs_brec_update_parent()
[all …]
/fs/hfs/
Dbrec.c72 int idx_rec_off, data_rec_off, end_rec_off; in hfs_brec_insert() local
94 end_rec_off = tree->node_size - (node->num_recs + 1) * 2; in hfs_brec_insert()
95 end_off = hfs_bnode_read_u16(node, end_rec_off); in hfs_brec_insert()
96 end_rec_off -= 2; in hfs_brec_insert()
97 dprint(DBG_BNODE_MOD, "insert_rec: %d, %d, %d, %d\n", rec, size, end_off, end_rec_off); in hfs_brec_insert()
98 if (size > end_rec_off - end_off) { in hfs_brec_insert()
113 hfs_bnode_write_u16(node, end_rec_off, end_off + size); in hfs_brec_insert()
115 data_rec_off = end_rec_off + 2; in hfs_brec_insert()
355 int rec, rec_off, end_rec_off; in hfs_brec_update_parent() local
380 end_rec_off = tree->node_size - (parent->num_recs + 1) * 2; in hfs_brec_update_parent()
[all …]