Merge tag 'for-6.0/dm-changes' of...

   size)

5. the number of optional parameters (the parameters with an argument

   count as two)

	start_sector n		(default: 0)

		offset from the start of cache device in 512-byte sectors

	high_watermark n	(default: 50)

		the origin volume in the last n milliseconds

Status:

1. error indicator - 0 if there was no error, otherwise error number

2. the number of blocks

3. the number of free blocks

4. the number of blocks under writeback

5. the number of read requests

6. the number of read requests that hit the cache

7. the number of write requests

8. the number of write requests that hit uncommitted block

9. the number of write requests that hit committed block

10. the number of write requests that bypass the cache

11. the number of write requests that are allocated in the cache

5. the number of read blocks

6. the number of read blocks that hit the cache

7. the number of write blocks

8. the number of write blocks that hit uncommitted block

9. the number of write blocks that hit committed block

10. the number of write blocks that bypass the cache

11. the number of write blocks that are allocated in the cache

12. the number of write requests that are blocked on the freelist

13. the number of flush requests

14. the number of discard requests

14. the number of discarded blocks

Messages:

	flush

dm-mod-y	+= dm.o dm-table.o dm-target.o dm-linear.o dm-stripe.o \

		   dm-ioctl.o dm-io.o dm-kcopyd.o dm-sysfs.o dm-stats.o \

		   dm-rq.o

		   dm-rq.o dm-io-rewind.o

dm-multipath-y	+= dm-path-selector.o dm-mpath.o

dm-historical-service-time-y += dm-ps-historical-service-time.o

dm-io-affinity-y += dm-ps-io-affinity.o

 * hints will be lost.

 *

 * The hints are indexed by the cblock, but many policies will not

 * neccessarily have a fast way of accessing efficiently via cblock.  So

 * necessarily have a fast way of accessing efficiently via cblock.  So

 * rather than querying the policy for each cblock, we let it walk its data

 * structures and fill in the hints in whatever order it wishes.

 */

/*

 * The discard block size in the on disk metadata is not

 * neccessarily the same as we're currently using.  So we have to

 * necessarily the same as we're currently using.  So we have to

 * be careful to only set the discarded attribute if we know it

 * covers a complete block of the new size.

 */

#define DM_RESERVED_MAX_IOS		1024

struct dm_io;

struct dm_kobject_holder {

	struct kobject kobj;

	struct completion completion;

	spinlock_t deferred_lock;

	struct bio_list deferred;

	/*

	 * requeue work context is needed for cloning one new bio

	 * to represent the dm_io to be requeued, since each

	 * dm_io may point to the original bio from FS.

	 */

	struct work_struct requeue_work;

	struct dm_io *requeue_list;

	void *interface_ptr;

	/*

#endif

};

static inline struct dm_target *dm_table_get_target(struct dm_table *t,

						    unsigned int index)

{

	BUG_ON(index >= t->num_targets);

	return t->targets + index;

}

/*

 * One of these is allocated per clone bio.

 */

	sector_t old_sector;

	struct bio clone;

};

#define DM_TARGET_IO_BIO_OFFSET (offsetof(struct dm_target_io, clone))

#define DM_IO_BIO_OFFSET \

	(offsetof(struct dm_target_io, clone) + offsetof(struct dm_io, tio))

/*

 * dm_target_io flags

	atomic_t io_count;

	struct mapped_device *md;

	struct bio *split_bio;

	/* The three fields represent mapped part of original bio */

	struct bio *orig_bio;

	unsigned int sector_offset; /* offset to end of orig_bio */

	io->flags |= (1U << bit);

}

void dm_io_rewind(struct dm_io *io, struct bio_set *bs);

static inline struct completion *dm_get_completion_from_kobject(struct kobject *kobj)

{

	return &container_of(kobj, struct dm_kobject_holder, kobj)->completion;