Home
last modified time | relevance | path

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

/linux/fs/affs/
H A Dfile.c607 u32 tmp_next = be32_to_cpu(AFFS_DATA_HEAD(prev_bh)->next); in affs_extent_file_ofs() local
609 if (tmp_next) in affs_extent_file_ofs()
612 bidx, tmp_next); in affs_extent_file_ofs()
614 affs_adjust_checksum(prev_bh, bh->b_blocknr - tmp_next); in affs_extent_file_ofs()
759 u32 tmp_next = be32_to_cpu(AFFS_DATA_HEAD(prev_bh)->next); in affs_write_end_ofs() local
761 if (tmp_next) in affs_write_end_ofs()
764 bidx, tmp_next); in affs_write_end_ofs()
766 affs_adjust_checksum(prev_bh, bh->b_blocknr - tmp_next); in affs_write_end_ofs()
793 u32 tmp_next = be32_to_cpu(AFFS_DATA_HEAD(prev_bh)->next); in affs_write_end_ofs() local
795 if (tmp_next) in affs_write_end_ofs()
[all...]
/linux/lib/
H A Dmaple_tree.c2553 struct ma_state tmp[3], tmp_next[3]; in mas_topiary_replace() local
2573 if (!mas_find_child(&tmp[i], &tmp_next[n])) in mas_topiary_replace()
2585 tmp_next[n++].status = ma_none; in mas_topiary_replace()
2588 tmp[i] = tmp_next[i]; in mas_topiary_replace()
2608 if (!mas_find_child(&tmp[i], &tmp_next[n])) in mas_topiary_replace()
2611 if ((tmp_next[n].min >= tmp_next->index) && in mas_topiary_replace()
2612 (tmp_next[n].max <= tmp_next->last)) { in mas_topiary_replace()
2613 mat_add(&subtrees, tmp_next[ in mas_topiary_replace()
[all...]