Searched refs:rec_off (Results 1 - 4 of 4) sorted by relevance

/linux-4.4.14/fs/hfs/
H A Dbrec.c179 int end_off, rec_off, data_off, size; hfs_brec_remove() local
184 rec_off = tree->node_size - (fd->record + 2) * 2; hfs_brec_remove()
209 if (rec_off == end_off) hfs_brec_remove()
214 data_off = hfs_bnode_read_u16(node, rec_off); hfs_brec_remove()
215 hfs_bnode_write_u16(node, rec_off + 2, data_off - size); hfs_brec_remove()
216 rec_off -= 2; hfs_brec_remove()
217 } while (rec_off >= end_off); hfs_brec_remove()
355 int rec, rec_off, end_rec_off; hfs_brec_update_parent() local
382 rec_off = tree->node_size - (rec + 2) * 2; hfs_brec_update_parent()
398 rec_off = tree->node_size - (rec + 2) * 2; hfs_brec_update_parent()
403 end_off = start_off = hfs_bnode_read_u16(parent, rec_off); hfs_brec_update_parent()
404 hfs_bnode_write_u16(parent, rec_off, start_off + diff); hfs_brec_update_parent()
407 while (rec_off > end_rec_off) { hfs_brec_update_parent()
408 rec_off -= 2; hfs_brec_update_parent()
409 end_off = hfs_bnode_read_u16(parent, rec_off); hfs_brec_update_parent()
410 hfs_bnode_write_u16(parent, rec_off, end_off + diff); hfs_brec_update_parent()
H A Dbnode.c319 int i, rec_off, off, next_off; hfs_bnode_find() local
367 rec_off = tree->node_size - 2; hfs_bnode_find()
368 off = hfs_bnode_read_u16(node, rec_off); hfs_bnode_find()
372 rec_off -= 2; hfs_bnode_find()
373 next_off = hfs_bnode_read_u16(node, rec_off); hfs_bnode_find()
/linux-4.4.14/fs/hfsplus/
H A Dbrec.c181 int end_off, rec_off, data_off, size; hfs_brec_remove() local
186 rec_off = tree->node_size - (fd->record + 2) * 2; hfs_brec_remove()
213 if (rec_off == end_off) hfs_brec_remove()
218 data_off = hfs_bnode_read_u16(node, rec_off); hfs_brec_remove()
219 hfs_bnode_write_u16(node, rec_off + 2, data_off - size); hfs_brec_remove()
220 rec_off -= 2; hfs_brec_remove()
221 } while (rec_off >= end_off); hfs_brec_remove()
359 int rec, rec_off, end_rec_off; hfs_brec_update_parent() local
387 rec_off = tree->node_size - (rec + 2) * 2; hfs_brec_update_parent()
403 rec_off = tree->node_size - (rec + 2) * 2; hfs_brec_update_parent()
409 end_off = start_off = hfs_bnode_read_u16(parent, rec_off); hfs_brec_update_parent()
410 hfs_bnode_write_u16(parent, rec_off, start_off + diff); hfs_brec_update_parent()
413 while (rec_off > end_rec_off) { hfs_brec_update_parent()
414 rec_off -= 2; hfs_brec_update_parent()
415 end_off = hfs_bnode_read_u16(parent, rec_off); hfs_brec_update_parent()
416 hfs_bnode_write_u16(parent, rec_off, end_off + diff); hfs_brec_update_parent()
H A Dbnode.c485 int i, rec_off, off, next_off; hfs_bnode_find() local
535 rec_off = tree->node_size - 2; hfs_bnode_find()
536 off = hfs_bnode_read_u16(node, rec_off); hfs_bnode_find()
540 rec_off -= 2; hfs_bnode_find()
541 next_off = hfs_bnode_read_u16(node, rec_off); hfs_bnode_find()

Completed in 122 milliseconds