fs/btrfs/tree-checker.c

167  * This functions checks prev_key->objectid, to ensure current key and prev_key
177 			   struct btrfs_key *prev_key)
197 	if (key->objectid == prev_key->objectid)
203 		prev_key->objectid, key->objectid);
208 				  struct btrfs_key *prev_key)
229 	if (unlikely(!check_prev_ino(leaf, key, slot, prev_key)))
327 	    prev_key->objectid == key->objectid &&
328 	    prev_key->type == BTRFS_EXTENT_DATA_KEY) {
334 		prev_end = file_extent_end(leaf, prev_key, prev_fi);
347 			   int slot, struct btrfs_key *prev_key)
371 	if (slot > 0 && prev_key->type == BTRFS_EXTENT_CSUM_KEY) {
377 		prev_csum_end += prev_key->offset;
503 			  struct btrfs_key *key, struct btrfs_key *prev_key,
511 	if (unlikely(!check_prev_ino(leaf, key, slot, prev_key)))
1276 			     struct btrfs_key *prev_key)
1538 	if ((prev_key->type == BTRFS_EXTENT_ITEM_KEY) ||
1539 	    (prev_key->type == BTRFS_METADATA_ITEM_KEY)) {
1540 		u64 prev_end = prev_key->objectid;
1542 		if (prev_key->type == BTRFS_METADATA_ITEM_KEY)
1545 			prev_end += prev_key->offset;
1550 				   prev_key->objectid, prev_key->type,
1551 				   prev_key->offset, key->objectid, key->type,
1633 			   struct btrfs_key *key, struct btrfs_key *prev_key,
1640 	if (unlikely(!check_prev_ino(leaf, key, slot, prev_key)))
1726 						    struct btrfs_key *prev_key)
1733 		ret = check_extent_data_item(leaf, key, slot, prev_key);
1736 		ret = check_csum_item(leaf, key, slot, prev_key);
1741 		ret = check_dir_item(leaf, key, prev_key, slot);
1744 		ret = check_inode_ref(leaf, key, prev_key, slot);
1764 		ret = check_extent_item(leaf, key, slot, prev_key);
1788 	struct btrfs_key prev_key = {0, 0, 0};
1865 		if (unlikely(btrfs_comp_cpu_keys(&prev_key, &key) >= 0)) {
1868 				prev_key.objectid, prev_key.type,
1869 				prev_key.offset, key.objectid, key.type,
1927 			ret = check_leaf_item(leaf, &key, slot, &prev_key);
1932 		prev_key.objectid = key.objectid;
1933 		prev_key.type = key.type;
1934 		prev_key.offset = key.offset;