Lines Matching refs:prev_key
163 * This functions checks prev_key->objectid, to ensure current key and prev_key
173 struct btrfs_key *prev_key)
193 if (key->objectid == prev_key->objectid)
199 prev_key->objectid, key->objectid);
204 struct btrfs_key *prev_key)
225 if (unlikely(!check_prev_ino(leaf, key, slot, prev_key)))
323 prev_key->objectid == key->objectid &&
324 prev_key->type == BTRFS_EXTENT_DATA_KEY) {
330 prev_end = file_extent_end(leaf, prev_key, prev_fi);
343 int slot, struct btrfs_key *prev_key)
367 if (slot > 0 && prev_key->type == BTRFS_EXTENT_CSUM_KEY) {
373 prev_csum_end += prev_key->offset;
499 struct btrfs_key *key, struct btrfs_key *prev_key,
507 if (unlikely(!check_prev_ino(leaf, key, slot, prev_key)))
1269 struct btrfs_key *prev_key)
1490 if ((prev_key->type == BTRFS_EXTENT_ITEM_KEY) ||
1491 (prev_key->type == BTRFS_METADATA_ITEM_KEY)) {
1492 u64 prev_end = prev_key->objectid;
1494 if (prev_key->type == BTRFS_METADATA_ITEM_KEY)
1497 prev_end += prev_key->offset;
1502 prev_key->objectid, prev_key->type,
1503 prev_key->offset, key->objectid, key->type,
1585 struct btrfs_key *key, struct btrfs_key *prev_key,
1592 if (unlikely(!check_prev_ino(leaf, key, slot, prev_key)))
1640 struct btrfs_key *prev_key)
1647 ret = check_extent_data_item(leaf, key, slot, prev_key);
1650 ret = check_csum_item(leaf, key, slot, prev_key);
1655 ret = check_dir_item(leaf, key, prev_key, slot);
1658 ret = check_inode_ref(leaf, key, prev_key, slot);
1678 ret = check_extent_item(leaf, key, slot, prev_key);
1699 struct btrfs_key prev_key = {0, 0, 0};
1776 if (unlikely(btrfs_comp_cpu_keys(&prev_key, &key) >= 0)) {
1779 prev_key.objectid, prev_key.type,
1780 prev_key.offset, key.objectid, key.type,
1838 ret = check_leaf_item(leaf, &key, slot, &prev_key);
1843 prev_key.objectid = key.objectid;
1844 prev_key.type = key.type;
1845 prev_key.offset = key.offset;