[linux-block.git] / block / blk-sysfs.c

/*
 * Functions related to sysfs handling
 */
#include <linux/kernel.h>
#include <linux/slab.h>
#include <linux/module.h>
#include <linux/bio.h>
#include <linux/blkdev.h>
#include <linux/blktrace_api.h>

#include "blk.h"

struct queue_sysfs_entry {
	struct attribute attr;
	ssize_t (*show)(struct request_queue *, char *);
	ssize_t (*store)(struct request_queue *, const char *, size_t);
};

static ssize_t
queue_var_show(unsigned long var, char *page)
{
	return sprintf(page, "%lu\n", var);
}

static ssize_t
queue_var_store(unsigned long *var, const char *page, size_t count)
{
	char *p = (char *) page;

	*var = simple_strtoul(p, &p, 10);
	return count;
}

static ssize_t queue_requests_show(struct request_queue *q, char *page)
{
	return queue_var_show(q->nr_requests, (page));
}

static ssize_t
queue_requests_store(struct request_queue *q, const char *page, size_t count)
{
	struct request_list *rl = &q->rq;
	unsigned long nr;
	int ret;

	if (!q->request_fn)
		return -EINVAL;

	ret = queue_var_store(&nr, page, count);
	if (nr < BLKDEV_MIN_RQ)
		nr = BLKDEV_MIN_RQ;

	spin_lock_irq(q->queue_lock);
	q->nr_requests = nr;
	blk_queue_congestion_threshold(q);

	if (rl->count[BLK_RW_SYNC] >= queue_congestion_on_threshold(q))
		blk_set_queue_congested(q, BLK_RW_SYNC);
	else if (rl->count[BLK_RW_SYNC] < queue_congestion_off_threshold(q))
		blk_clear_queue_congested(q, BLK_RW_SYNC);

	if (rl->count[BLK_RW_ASYNC] >= queue_congestion_on_threshold(q))
		blk_set_queue_congested(q, BLK_RW_ASYNC);
	else if (rl->count[BLK_RW_ASYNC] < queue_congestion_off_threshold(q))
		blk_clear_queue_congested(q, BLK_RW_ASYNC);

	if (rl->count[BLK_RW_SYNC] >= q->nr_requests) {
		blk_set_queue_full(q, BLK_RW_SYNC);
	} else {
		blk_clear_queue_full(q, BLK_RW_SYNC);
		wake_up(&rl->wait[BLK_RW_SYNC]);
	}

	if (rl->count[BLK_RW_ASYNC] >= q->nr_requests) {
		blk_set_queue_full(q, BLK_RW_ASYNC);
	} else {
		blk_clear_queue_full(q, BLK_RW_ASYNC);
		wake_up(&rl->wait[BLK_RW_ASYNC]);
	}
	spin_unlock_irq(q->queue_lock);
	return ret;
}

static ssize_t queue_ra_show(struct request_queue *q, char *page)
{
	unsigned long ra_kb = q->backing_dev_info.ra_pages <<
					(PAGE_CACHE_SHIFT - 10);

	return queue_var_show(ra_kb, (page));
}

static ssize_t
queue_ra_store(struct request_queue *q, const char *page, size_t count)
{
	unsigned long ra_kb;
	ssize_t ret = queue_var_store(&ra_kb, page, count);

	q->backing_dev_info.ra_pages = ra_kb >> (PAGE_CACHE_SHIFT - 10);

	return ret;
}

static ssize_t queue_max_sectors_show(struct request_queue *q, char *page)
{
	int max_sectors_kb = queue_max_sectors(q) >> 1;

	return queue_var_show(max_sectors_kb, (page));
}

static ssize_t queue_max_segments_show(struct request_queue *q, char *page)
{
	return queue_var_show(queue_max_segments(q), (page));
}

static ssize_t queue_max_integrity_segments_show(struct request_queue *q, char *page)
{
	return queue_var_show(q->limits.max_integrity_segments, (page));
}

static ssize_t queue_max_segment_size_show(struct request_queue *q, char *page)
{
	if (blk_queue_cluster(q))
		return queue_var_show(queue_max_segment_size(q), (page));

	return queue_var_show(PAGE_CACHE_SIZE, (page));
}

static ssize_t queue_logical_block_size_show(struct request_queue *q, char *page)
{
	return queue_var_show(queue_logical_block_size(q), page);
}

static ssize_t queue_physical_block_size_show(struct request_queue *q, char *page)
{
	return queue_var_show(queue_physical_block_size(q), page);
}

static ssize_t queue_io_min_show(struct request_queue *q, char *page)
{
	return queue_var_show(queue_io_min(q), page);
}

static ssize_t queue_io_opt_show(struct request_queue *q, char *page)
{
	return queue_var_show(queue_io_opt(q), page);
}

static ssize_t queue_discard_granularity_show(struct request_queue *q, char *page)
{
	return queue_var_show(q->limits.discard_granularity, page);
}

static ssize_t queue_discard_max_show(struct request_queue *q, char *page)
{
	return sprintf(page, "%llu\n",
		       (unsigned long long)q->limits.max_discard_sectors << 9);
}

static ssize_t queue_discard_zeroes_data_show(struct request_queue *q, char *page)
{
	return queue_var_show(queue_discard_zeroes_data(q), page);
}

static ssize_t
queue_max_sectors_store(struct request_queue *q, const char *page, size_t count)
{
	unsigned long max_sectors_kb,
		max_hw_sectors_kb = queue_max_hw_sectors(q) >> 1,
			page_kb = 1 << (PAGE_CACHE_SHIFT - 10);
	ssize_t ret = queue_var_store(&max_sectors_kb, page, count);

	if (max_sectors_kb > max_hw_sectors_kb || max_sectors_kb < page_kb)
		return -EINVAL;

	spin_lock_irq(q->queue_lock);
	q->limits.max_sectors = max_sectors_kb << 1;
	spin_unlock_irq(q->queue_lock);

	return ret;
}

static ssize_t queue_max_hw_sectors_show(struct request_queue *q, char *page)
{
	int max_hw_sectors_kb = queue_max_hw_sectors(q) >> 1;

	return queue_var_show(max_hw_sectors_kb, (page));
}

#define QUEUE_SYSFS_BIT_FNS(name, flag, neg)				\
static ssize_t								\
queue_show_##name(struct request_queue *q, char *page)			\
{									\
	int bit;							\
	bit = test_bit(QUEUE_FLAG_##flag, &q->queue_flags);		\
	return queue_var_show(neg ? !bit : bit, page);			\
}									\
static ssize_t								\
queue_store_##name(struct request_queue *q, const char *page, size_t count) \
{									\
	unsigned long val;						\
	ssize_t ret;							\
	ret = queue_var_store(&val, page, count);			\
	if (neg)							\
		val = !val;						\
									\
	spin_lock_irq(q->queue_lock);					\
	if (val)							\
		queue_flag_set(QUEUE_FLAG_##flag, q);			\
	else								\
		queue_flag_clear(QUEUE_FLAG_##flag, q);			\
	spin_unlock_irq(q->queue_lock);					\
	return ret;							\
}

QUEUE_SYSFS_BIT_FNS(nonrot, NONROT, 1);
QUEUE_SYSFS_BIT_FNS(random, ADD_RANDOM, 0);
QUEUE_SYSFS_BIT_FNS(iostats, IO_STAT, 0);
#undef QUEUE_SYSFS_BIT_FNS

static ssize_t queue_nomerges_show(struct request_queue *q, char *page)
{
	return queue_var_show((blk_queue_nomerges(q) << 1) |
			       blk_queue_noxmerges(q), page);
}

static ssize_t queue_nomerges_store(struct request_queue *q, const char *page,
				    size_t count)
{
	unsigned long nm;
	ssize_t ret = queue_var_store(&nm, page, count);

	spin_lock_irq(q->queue_lock);
	queue_flag_clear(QUEUE_FLAG_NOMERGES, q);
	queue_flag_clear(QUEUE_FLAG_NOXMERGES, q);
	if (nm == 2)
		queue_flag_set(QUEUE_FLAG_NOMERGES, q);
	else if (nm)
		queue_flag_set(QUEUE_FLAG_NOXMERGES, q);
	spin_unlock_irq(q->queue_lock);

	return ret;
}

static ssize_t queue_rq_affinity_show(struct request_queue *q, char *page)
{
	bool set = test_bit(QUEUE_FLAG_SAME_COMP, &q->queue_flags);
	bool force = test_bit(QUEUE_FLAG_SAME_FORCE, &q->queue_flags);

	return queue_var_show(set << force, page);
}

static ssize_t
queue_rq_affinity_store(struct request_queue *q, const char *page, size_t count)
{
	ssize_t ret = -EINVAL;
#if defined(CONFIG_USE_GENERIC_SMP_HELPERS)
	unsigned long val;

	ret = queue_var_store(&val, page, count);
	spin_lock_irq(q->queue_lock);
	if (val) {
		queue_flag_set(QUEUE_FLAG_SAME_COMP, q);
		if (val == 2)
			queue_flag_set(QUEUE_FLAG_SAME_FORCE, q);
	} else {
		queue_flag_clear(QUEUE_FLAG_SAME_COMP, q);
		queue_flag_clear(QUEUE_FLAG_SAME_FORCE, q);
	}
	spin_unlock_irq(q->queue_lock);
#endif
	return ret;
}

static struct queue_sysfs_entry queue_requests_entry = {
	.attr = {.name = "nr_requests", .mode = S_IRUGO | S_IWUSR },
	.show = queue_requests_show,
	.store = queue_requests_store,
};

static struct queue_sysfs_entry queue_ra_entry = {
	.attr = {.name = "read_ahead_kb", .mode = S_IRUGO | S_IWUSR },
	.show = queue_ra_show,
	.store = queue_ra_store,
};

static struct queue_sysfs_entry queue_max_sectors_entry = {
	.attr = {.name = "max_sectors_kb", .mode = S_IRUGO | S_IWUSR },
	.show = queue_max_sectors_show,
	.store = queue_max_sectors_store,
};

static struct queue_sysfs_entry queue_max_hw_sectors_entry = {
	.attr = {.name = "max_hw_sectors_kb", .mode = S_IRUGO },
	.show = queue_max_hw_sectors_show,
};

static struct queue_sysfs_entry queue_max_segments_entry = {
	.attr = {.name = "max_segments", .mode = S_IRUGO },
	.show = queue_max_segments_show,
};

static struct queue_sysfs_entry queue_max_integrity_segments_entry = {
	.attr = {.name = "max_integrity_segments", .mode = S_IRUGO },
	.show = queue_max_integrity_segments_show,
};

static struct queue_sysfs_entry queue_max_segment_size_entry = {
	.attr = {.name = "max_segment_size", .mode = S_IRUGO },
	.show = queue_max_segment_size_show,
};

static struct queue_sysfs_entry queue_iosched_entry = {
	.attr = {.name = "scheduler", .mode = S_IRUGO | S_IWUSR },
	.show = elv_iosched_show,
	.store = elv_iosched_store,
};

static struct queue_sysfs_entry queue_hw_sector_size_entry = {
	.attr = {.name = "hw_sector_size", .mode = S_IRUGO },
	.show = queue_logical_block_size_show,
};

static struct queue_sysfs_entry queue_logical_block_size_entry = {
	.attr = {.name = "logical_block_size", .mode = S_IRUGO },
	.show = queue_logical_block_size_show,
};

static struct queue_sysfs_entry queue_physical_block_size_entry = {
	.attr = {.name = "physical_block_size", .mode = S_IRUGO },
	.show = queue_physical_block_size_show,
};

static struct queue_sysfs_entry queue_io_min_entry = {
	.attr = {.name = "minimum_io_size", .mode = S_IRUGO },
	.show = queue_io_min_show,
};

static struct queue_sysfs_entry queue_io_opt_entry = {
	.attr = {.name = "optimal_io_size", .mode = S_IRUGO },
	.show = queue_io_opt_show,
};

static struct queue_sysfs_entry queue_discard_granularity_entry = {
	.attr = {.name = "discard_granularity", .mode = S_IRUGO },
	.show = queue_discard_granularity_show,
};

static struct queue_sysfs_entry queue_discard_max_entry = {
	.attr = {.name = "discard_max_bytes", .mode = S_IRUGO },
	.show = queue_discard_max_show,
};

static struct queue_sysfs_entry queue_discard_zeroes_data_entry = {
	.attr = {.name = "discard_zeroes_data", .mode = S_IRUGO },
	.show = queue_discard_zeroes_data_show,
};

static struct queue_sysfs_entry queue_nonrot_entry = {
	.attr = {.name = "rotational", .mode = S_IRUGO | S_IWUSR },
	.show = queue_show_nonrot,
	.store = queue_store_nonrot,
};

static struct queue_sysfs_entry queue_nomerges_entry = {
	.attr = {.name = "nomerges", .mode = S_IRUGO | S_IWUSR },
	.show = queue_nomerges_show,
	.store = queue_nomerges_store,
};

static struct queue_sysfs_entry queue_rq_affinity_entry = {
	.attr = {.name = "rq_affinity", .mode = S_IRUGO | S_IWUSR },
	.show = queue_rq_affinity_show,
	.store = queue_rq_affinity_store,
};

static struct queue_sysfs_entry queue_iostats_entry = {
	.attr = {.name = "iostats", .mode = S_IRUGO | S_IWUSR },
	.show = queue_show_iostats,
	.store = queue_store_iostats,
};

static struct queue_sysfs_entry queue_random_entry = {
	.attr = {.name = "add_random", .mode = S_IRUGO | S_IWUSR },
	.show = queue_show_random,
	.store = queue_store_random,
};

static struct attribute *default_attrs[] = {
	&queue_requests_entry.attr,
	&queue_ra_entry.attr,
	&queue_max_hw_sectors_entry.attr,
	&queue_max_sectors_entry.attr,
	&queue_max_segments_entry.attr,
	&queue_max_integrity_segments_entry.attr,
	&queue_max_segment_size_entry.attr,
	&queue_iosched_entry.attr,
	&queue_hw_sector_size_entry.attr,
	&queue_logical_block_size_entry.attr,
	&queue_physical_block_size_entry.attr,
	&queue_io_min_entry.attr,
	&queue_io_opt_entry.attr,
	&queue_discard_granularity_entry.attr,
	&queue_discard_max_entry.attr,
	&queue_discard_zeroes_data_entry.attr,
	&queue_nonrot_entry.attr,
	&queue_nomerges_entry.attr,
	&queue_rq_affinity_entry.attr,
	&queue_iostats_entry.attr,
	&queue_random_entry.attr,
	NULL,
};

#define to_queue(atr) container_of((atr), struct queue_sysfs_entry, attr)

static ssize_t
queue_attr_show(struct kobject *kobj, struct attribute *attr, char *page)
{
	struct queue_sysfs_entry *entry = to_queue(attr);
	struct request_queue *q =
		container_of(kobj, struct request_queue, kobj);
	ssize_t res;

	if (!entry->show)
		return -EIO;
	mutex_lock(&q->sysfs_lock);
	if (test_bit(QUEUE_FLAG_DEAD, &q->queue_flags)) {
		mutex_unlock(&q->sysfs_lock);
		return -ENOENT;
	}
	res = entry->show(q, page);
	mutex_unlock(&q->sysfs_lock);
	return res;
}

static ssize_t
queue_attr_store(struct kobject *kobj, struct attribute *attr,
		    const char *page, size_t length)
{
	struct queue_sysfs_entry *entry = to_queue(attr);
	struct request_queue *q;
	ssize_t res;

	if (!entry->store)
		return -EIO;

	q = container_of(kobj, struct request_queue, kobj);
	mutex_lock(&q->sysfs_lock);
	if (test_bit(QUEUE_FLAG_DEAD, &q->queue_flags)) {
		mutex_unlock(&q->sysfs_lock);
		return -ENOENT;
	}
	res = entry->store(q, page, length);
	mutex_unlock(&q->sysfs_lock);
	return res;
}

/**
 * blk_cleanup_queue: - release a &struct request_queue when it is no longer needed
 * @kobj:    the kobj belonging of the request queue to be released
 *
 * Description:
 *     blk_cleanup_queue is the pair to blk_init_queue() or
 *     blk_queue_make_request().  It should be called when a request queue is
 *     being released; typically when a block device is being de-registered.
 *     Currently, its primary task it to free all the &struct request
 *     structures that were allocated to the queue and the queue itself.
 *
 * Caveat:
 *     Hopefully the low level driver will have finished any
 *     outstanding requests first...
 **/
static void blk_release_queue(struct kobject *kobj)
{
	struct request_queue *q =
		container_of(kobj, struct request_queue, kobj);
	struct request_list *rl = &q->rq;

	blk_sync_queue(q);

	if (rl->rq_pool)
		mempool_destroy(rl->rq_pool);

	if (q->queue_tags)
		__blk_queue_free_tags(q);

	blk_trace_shutdown(q);

	bdi_destroy(&q->backing_dev_info);
	kmem_cache_free(blk_requestq_cachep, q);
}

static const struct sysfs_ops queue_sysfs_ops = {
	.show	= queue_attr_show,
	.store	= queue_attr_store,
};

struct kobj_type blk_queue_ktype = {
	.sysfs_ops	= &queue_sysfs_ops,
	.default_attrs	= default_attrs,
	.release	= blk_release_queue,
};

int blk_register_queue(struct gendisk *disk)
{
	int ret;
	struct device *dev = disk_to_dev(disk);
	struct request_queue *q = disk->queue;

	if (WARN_ON(!q))
		return -ENXIO;

	ret = blk_trace_init_sysfs(dev);
	if (ret)
		return ret;

	ret = kobject_add(&q->kobj, kobject_get(&dev->kobj), "%s", "queue");
	if (ret < 0) {
		blk_trace_remove_sysfs(dev);
		return ret;
	}

	kobject_uevent(&q->kobj, KOBJ_ADD);

	if (!q->request_fn)
		return 0;

	ret = elv_register_queue(q);
	if (ret) {
		kobject_uevent(&q->kobj, KOBJ_REMOVE);
		kobject_del(&q->kobj);
		blk_trace_remove_sysfs(dev);
		kobject_put(&dev->kobj);
		return ret;
	}

	return 0;
}

void blk_unregister_queue(struct gendisk *disk)
{
	struct request_queue *q = disk->queue;

	if (WARN_ON(!q))
		return;

	if (q->request_fn)
		elv_unregister_queue(q);

	kobject_uevent(&q->kobj, KOBJ_REMOVE);
	kobject_del(&q->kobj);
	blk_trace_remove_sysfs(disk_to_dev(disk));
	kobject_put(&disk_to_dev(disk)->kobj);
}
Commit	Line	Data
8324aa91 JA	1	/*
	2	* Functions related to sysfs handling
	3	*/
	4	#include <linux/kernel.h>
5a0e3ad6	5	#include <linux/slab.h>
8324aa91 JA	6	#include <linux/module.h>
	7	#include <linux/bio.h>
	8	#include <linux/blkdev.h>
	9	#include <linux/blktrace_api.h>
	10
	11	#include "blk.h"
	12
	13	struct queue_sysfs_entry {
	14	struct attribute attr;
	15	ssize_t (show)(struct request_queue , char *);
	16	ssize_t (store)(struct request_queue , const char *, size_t);
	17	};
	18
	19	static ssize_t
9cb308ce	20	queue_var_show(unsigned long var, char *page)
8324aa91	21	{
9cb308ce	22	return sprintf(page, "%lu\n", var);
8324aa91 JA	23	}
	24
	25	static ssize_t
	26	queue_var_store(unsigned long var, const char page, size_t count)
	27	{
	28	char p = (char ) page;
	29
	30	*var = simple_strtoul(p, &p, 10);
	31	return count;
	32	}
	33
	34	static ssize_t queue_requests_show(struct request_queue q, char page)
	35	{
	36	return queue_var_show(q->nr_requests, (page));
	37	}
	38
	39	static ssize_t
	40	queue_requests_store(struct request_queue q, const char page, size_t count)
	41	{
	42	struct request_list *rl = &q->rq;
	43	unsigned long nr;
b8a9ae77 JA	44	int ret;
	45
	46	if (!q->request_fn)
	47	return -EINVAL;
	48
	49	ret = queue_var_store(&nr, page, count);
8324aa91 JA	50	if (nr < BLKDEV_MIN_RQ)
	51	nr = BLKDEV_MIN_RQ;
	52
	53	spin_lock_irq(q->queue_lock);
	54	q->nr_requests = nr;
	55	blk_queue_congestion_threshold(q);
	56
1faa16d2 JA	57	if (rl->count[BLK_RW_SYNC] >= queue_congestion_on_threshold(q))
	58	blk_set_queue_congested(q, BLK_RW_SYNC);
	59	else if (rl->count[BLK_RW_SYNC] < queue_congestion_off_threshold(q))
	60	blk_clear_queue_congested(q, BLK_RW_SYNC);
	61
	62	if (rl->count[BLK_RW_ASYNC] >= queue_congestion_on_threshold(q))
	63	blk_set_queue_congested(q, BLK_RW_ASYNC);
	64	else if (rl->count[BLK_RW_ASYNC] < queue_congestion_off_threshold(q))
	65	blk_clear_queue_congested(q, BLK_RW_ASYNC);
	66
	67	if (rl->count[BLK_RW_SYNC] >= q->nr_requests) {
	68	blk_set_queue_full(q, BLK_RW_SYNC);
60735b63	69	} else {
1faa16d2 JA	70	blk_clear_queue_full(q, BLK_RW_SYNC);
1faa16d2 JA	71	wake_up(&rl->wait[BLK_RW_SYNC]);
8324aa91 JA	72	}
8324aa91 JA	73
1faa16d2 JA	74	if (rl->count[BLK_RW_ASYNC] >= q->nr_requests) {
1faa16d2 JA	75	blk_set_queue_full(q, BLK_RW_ASYNC);
60735b63	76	} else {
1faa16d2 JA	77	blk_clear_queue_full(q, BLK_RW_ASYNC);
1faa16d2 JA	78	wake_up(&rl->wait[BLK_RW_ASYNC]);
8324aa91 JA	79	}
	80	spin_unlock_irq(q->queue_lock);
	81	return ret;
	82	}
	83
	84	static ssize_t queue_ra_show(struct request_queue q, char page)
	85	{
9cb308ce XF	86	unsigned long ra_kb = q->backing_dev_info.ra_pages <<
9cb308ce XF	87	(PAGE_CACHE_SHIFT - 10);
8324aa91 JA	88
	89	return queue_var_show(ra_kb, (page));
	90	}
	91
	92	static ssize_t
	93	queue_ra_store(struct request_queue q, const char page, size_t count)
	94	{
	95	unsigned long ra_kb;
	96	ssize_t ret = queue_var_store(&ra_kb, page, count);
	97
8324aa91	98	q->backing_dev_info.ra_pages = ra_kb >> (PAGE_CACHE_SHIFT - 10);
8324aa91 JA	99
	100	return ret;
	101	}
	102
	103	static ssize_t queue_max_sectors_show(struct request_queue q, char page)
	104	{
ae03bf63	105	int max_sectors_kb = queue_max_sectors(q) >> 1;
8324aa91 JA	106
	107	return queue_var_show(max_sectors_kb, (page));
	108	}
	109
c77a5710 MP	110	static ssize_t queue_max_segments_show(struct request_queue q, char page)
	111	{
	112	return queue_var_show(queue_max_segments(q), (page));
	113	}
	114
13f05c8d MP	115	static ssize_t queue_max_integrity_segments_show(struct request_queue q, char page)
	116	{
	117	return queue_var_show(q->limits.max_integrity_segments, (page));
	118	}
	119
c77a5710 MP	120	static ssize_t queue_max_segment_size_show(struct request_queue q, char page)
c77a5710 MP	121	{
e692cb66	122	if (blk_queue_cluster(q))
c77a5710 MP	123	return queue_var_show(queue_max_segment_size(q), (page));
	124
	125	return queue_var_show(PAGE_CACHE_SIZE, (page));
	126	}
	127
e1defc4f	128	static ssize_t queue_logical_block_size_show(struct request_queue q, char page)
e68b903c	129	{
e1defc4f	130	return queue_var_show(queue_logical_block_size(q), page);
e68b903c MP	131	}
e68b903c MP	132
c72758f3 MP	133	static ssize_t queue_physical_block_size_show(struct request_queue q, char page)
	134	{
	135	return queue_var_show(queue_physical_block_size(q), page);
	136	}
	137
	138	static ssize_t queue_io_min_show(struct request_queue q, char page)
	139	{
	140	return queue_var_show(queue_io_min(q), page);
	141	}
	142
	143	static ssize_t queue_io_opt_show(struct request_queue q, char page)
	144	{
	145	return queue_var_show(queue_io_opt(q), page);
e68b903c MP	146	}
e68b903c MP	147
86b37281 MP	148	static ssize_t queue_discard_granularity_show(struct request_queue q, char page)
	149	{
	150	return queue_var_show(q->limits.discard_granularity, page);
	151	}
	152
	153	static ssize_t queue_discard_max_show(struct request_queue q, char page)
	154	{
a934a00a MP	155	return sprintf(page, "%llu\n",
a934a00a MP	156	(unsigned long long)q->limits.max_discard_sectors << 9);
86b37281 MP	157	}
86b37281 MP	158
98262f27 MP	159	static ssize_t queue_discard_zeroes_data_show(struct request_queue q, char page)
	160	{
	161	return queue_var_show(queue_discard_zeroes_data(q), page);
	162	}
	163
8324aa91 JA	164	static ssize_t
	165	queue_max_sectors_store(struct request_queue q, const char page, size_t count)
	166	{
	167	unsigned long max_sectors_kb,
ae03bf63	168	max_hw_sectors_kb = queue_max_hw_sectors(q) >> 1,
8324aa91 JA	169	page_kb = 1 << (PAGE_CACHE_SHIFT - 10);
	170	ssize_t ret = queue_var_store(&max_sectors_kb, page, count);
	171
	172	if (max_sectors_kb > max_hw_sectors_kb \|\| max_sectors_kb < page_kb)
	173	return -EINVAL;
7c239517	174
8324aa91	175	spin_lock_irq(q->queue_lock);
c295fc05	176	q->limits.max_sectors = max_sectors_kb << 1;
8324aa91 JA	177	spin_unlock_irq(q->queue_lock);
	178
	179	return ret;
	180	}
	181
	182	static ssize_t queue_max_hw_sectors_show(struct request_queue q, char page)
	183	{
ae03bf63	184	int max_hw_sectors_kb = queue_max_hw_sectors(q) >> 1;
8324aa91 JA	185
	186	return queue_var_show(max_hw_sectors_kb, (page));
	187	}
	188
956bcb7c JA	189	#define QUEUE_SYSFS_BIT_FNS(name, flag, neg) \
	190	static ssize_t \
	191	queue_show_##name(struct request_queue q, char page) \
	192	{ \
	193	int bit; \
	194	bit = test_bit(QUEUE_FLAG_##flag, &q->queue_flags); \
	195	return queue_var_show(neg ? !bit : bit, page); \
	196	} \
	197	static ssize_t \
	198	queue_store_##name(struct request_queue q, const char page, size_t count) \
	199	{ \
	200	unsigned long val; \
	201	ssize_t ret; \
	202	ret = queue_var_store(&val, page, count); \
	203	if (neg) \
	204	val = !val; \
	205	\
	206	spin_lock_irq(q->queue_lock); \
	207	if (val) \
	208	queue_flag_set(QUEUE_FLAG_##flag, q); \
	209	else \
	210	queue_flag_clear(QUEUE_FLAG_##flag, q); \
	211	spin_unlock_irq(q->queue_lock); \
	212	return ret; \
1308835f BZ	213	}
1308835f BZ	214
956bcb7c JA	215	QUEUE_SYSFS_BIT_FNS(nonrot, NONROT, 1);
	216	QUEUE_SYSFS_BIT_FNS(random, ADD_RANDOM, 0);
	217	QUEUE_SYSFS_BIT_FNS(iostats, IO_STAT, 0);
	218	#undef QUEUE_SYSFS_BIT_FNS
1308835f	219
ac9fafa1 AB	220	static ssize_t queue_nomerges_show(struct request_queue q, char page)
ac9fafa1 AB	221	{
488991e2 AB	222	return queue_var_show((blk_queue_nomerges(q) << 1) \|
488991e2 AB	223	blk_queue_noxmerges(q), page);
ac9fafa1 AB	224	}
	225
	226	static ssize_t queue_nomerges_store(struct request_queue q, const char page,
	227	size_t count)
	228	{
	229	unsigned long nm;
	230	ssize_t ret = queue_var_store(&nm, page, count);
	231
bf0f9702	232	spin_lock_irq(q->queue_lock);
488991e2 AB	233	queue_flag_clear(QUEUE_FLAG_NOMERGES, q);
	234	queue_flag_clear(QUEUE_FLAG_NOXMERGES, q);
	235	if (nm == 2)
bf0f9702	236	queue_flag_set(QUEUE_FLAG_NOMERGES, q);
488991e2 AB	237	else if (nm)
488991e2 AB	238	queue_flag_set(QUEUE_FLAG_NOXMERGES, q);
bf0f9702	239	spin_unlock_irq(q->queue_lock);
1308835f	240
ac9fafa1 AB	241	return ret;
	242	}
	243
c7c22e4d JA	244	static ssize_t queue_rq_affinity_show(struct request_queue q, char page)
c7c22e4d JA	245	{
9cb308ce	246	bool set = test_bit(QUEUE_FLAG_SAME_COMP, &q->queue_flags);
5757a6d7	247	bool force = test_bit(QUEUE_FLAG_SAME_FORCE, &q->queue_flags);
c7c22e4d	248
5757a6d7	249	return queue_var_show(set << force, page);
c7c22e4d JA	250	}
	251
	252	static ssize_t
	253	queue_rq_affinity_store(struct request_queue q, const char page, size_t count)
	254	{
	255	ssize_t ret = -EINVAL;
	256	#if defined(CONFIG_USE_GENERIC_SMP_HELPERS)
	257	unsigned long val;
	258
	259	ret = queue_var_store(&val, page, count);
	260	spin_lock_irq(q->queue_lock);
5757a6d7	261	if (val) {
c7c22e4d	262	queue_flag_set(QUEUE_FLAG_SAME_COMP, q);
5757a6d7 DW	263	if (val == 2)
	264	queue_flag_set(QUEUE_FLAG_SAME_FORCE, q);
	265	} else {
	266	queue_flag_clear(QUEUE_FLAG_SAME_COMP, q);
	267	queue_flag_clear(QUEUE_FLAG_SAME_FORCE, q);
	268	}
c7c22e4d JA	269	spin_unlock_irq(q->queue_lock);
	270	#endif
	271	return ret;
	272	}
8324aa91 JA	273
	274	static struct queue_sysfs_entry queue_requests_entry = {
	275	.attr = {.name = "nr_requests", .mode = S_IRUGO \| S_IWUSR },
	276	.show = queue_requests_show,
	277	.store = queue_requests_store,
	278	};
	279
	280	static struct queue_sysfs_entry queue_ra_entry = {
	281	.attr = {.name = "read_ahead_kb", .mode = S_IRUGO \| S_IWUSR },
	282	.show = queue_ra_show,
	283	.store = queue_ra_store,
	284	};
	285
	286	static struct queue_sysfs_entry queue_max_sectors_entry = {
	287	.attr = {.name = "max_sectors_kb", .mode = S_IRUGO \| S_IWUSR },
	288	.show = queue_max_sectors_show,
	289	.store = queue_max_sectors_store,
	290	};
	291
	292	static struct queue_sysfs_entry queue_max_hw_sectors_entry = {
	293	.attr = {.name = "max_hw_sectors_kb", .mode = S_IRUGO },
	294	.show = queue_max_hw_sectors_show,
	295	};
	296
c77a5710 MP	297	static struct queue_sysfs_entry queue_max_segments_entry = {
	298	.attr = {.name = "max_segments", .mode = S_IRUGO },
	299	.show = queue_max_segments_show,
	300	};
	301
13f05c8d MP	302	static struct queue_sysfs_entry queue_max_integrity_segments_entry = {
	303	.attr = {.name = "max_integrity_segments", .mode = S_IRUGO },
	304	.show = queue_max_integrity_segments_show,
	305	};
	306
c77a5710 MP	307	static struct queue_sysfs_entry queue_max_segment_size_entry = {
	308	.attr = {.name = "max_segment_size", .mode = S_IRUGO },
	309	.show = queue_max_segment_size_show,
	310	};
	311
8324aa91 JA	312	static struct queue_sysfs_entry queue_iosched_entry = {
	313	.attr = {.name = "scheduler", .mode = S_IRUGO \| S_IWUSR },
	314	.show = elv_iosched_show,
	315	.store = elv_iosched_store,
	316	};
	317
e68b903c MP	318	static struct queue_sysfs_entry queue_hw_sector_size_entry = {
e68b903c MP	319	.attr = {.name = "hw_sector_size", .mode = S_IRUGO },
e1defc4f MP	320	.show = queue_logical_block_size_show,
	321	};
	322
	323	static struct queue_sysfs_entry queue_logical_block_size_entry = {
	324	.attr = {.name = "logical_block_size", .mode = S_IRUGO },
	325	.show = queue_logical_block_size_show,
e68b903c MP	326	};
e68b903c MP	327
c72758f3 MP	328	static struct queue_sysfs_entry queue_physical_block_size_entry = {
	329	.attr = {.name = "physical_block_size", .mode = S_IRUGO },
	330	.show = queue_physical_block_size_show,
	331	};
	332
	333	static struct queue_sysfs_entry queue_io_min_entry = {
	334	.attr = {.name = "minimum_io_size", .mode = S_IRUGO },
	335	.show = queue_io_min_show,
	336	};
	337
	338	static struct queue_sysfs_entry queue_io_opt_entry = {
	339	.attr = {.name = "optimal_io_size", .mode = S_IRUGO },
	340	.show = queue_io_opt_show,
e68b903c MP	341	};
e68b903c MP	342
86b37281 MP	343	static struct queue_sysfs_entry queue_discard_granularity_entry = {
	344	.attr = {.name = "discard_granularity", .mode = S_IRUGO },
	345	.show = queue_discard_granularity_show,
	346	};
	347
	348	static struct queue_sysfs_entry queue_discard_max_entry = {
	349	.attr = {.name = "discard_max_bytes", .mode = S_IRUGO },
	350	.show = queue_discard_max_show,
	351	};
	352
98262f27 MP	353	static struct queue_sysfs_entry queue_discard_zeroes_data_entry = {
	354	.attr = {.name = "discard_zeroes_data", .mode = S_IRUGO },
	355	.show = queue_discard_zeroes_data_show,
	356	};
	357
1308835f BZ	358	static struct queue_sysfs_entry queue_nonrot_entry = {
1308835f BZ	359	.attr = {.name = "rotational", .mode = S_IRUGO \| S_IWUSR },
956bcb7c JA	360	.show = queue_show_nonrot,
956bcb7c JA	361	.store = queue_store_nonrot,
1308835f BZ	362	};
1308835f BZ	363
ac9fafa1 AB	364	static struct queue_sysfs_entry queue_nomerges_entry = {
	365	.attr = {.name = "nomerges", .mode = S_IRUGO \| S_IWUSR },
	366	.show = queue_nomerges_show,
	367	.store = queue_nomerges_store,
	368	};
	369
c7c22e4d JA	370	static struct queue_sysfs_entry queue_rq_affinity_entry = {
	371	.attr = {.name = "rq_affinity", .mode = S_IRUGO \| S_IWUSR },
	372	.show = queue_rq_affinity_show,
	373	.store = queue_rq_affinity_store,
	374	};
	375
bc58ba94 JA	376	static struct queue_sysfs_entry queue_iostats_entry = {
bc58ba94 JA	377	.attr = {.name = "iostats", .mode = S_IRUGO \| S_IWUSR },
956bcb7c JA	378	.show = queue_show_iostats,
956bcb7c JA	379	.store = queue_store_iostats,
bc58ba94 JA	380	};
bc58ba94 JA	381
e2e1a148 JA	382	static struct queue_sysfs_entry queue_random_entry = {
e2e1a148 JA	383	.attr = {.name = "add_random", .mode = S_IRUGO \| S_IWUSR },
956bcb7c JA	384	.show = queue_show_random,
956bcb7c JA	385	.store = queue_store_random,
e2e1a148 JA	386	};
e2e1a148 JA	387
8324aa91 JA	388	static struct attribute *default_attrs[] = {
	389	&queue_requests_entry.attr,
	390	&queue_ra_entry.attr,
	391	&queue_max_hw_sectors_entry.attr,
	392	&queue_max_sectors_entry.attr,
c77a5710	393	&queue_max_segments_entry.attr,
13f05c8d	394	&queue_max_integrity_segments_entry.attr,
c77a5710	395	&queue_max_segment_size_entry.attr,
8324aa91	396	&queue_iosched_entry.attr,
e68b903c	397	&queue_hw_sector_size_entry.attr,
e1defc4f	398	&queue_logical_block_size_entry.attr,
c72758f3 MP	399	&queue_physical_block_size_entry.attr,
	400	&queue_io_min_entry.attr,
	401	&queue_io_opt_entry.attr,
86b37281 MP	402	&queue_discard_granularity_entry.attr,
86b37281 MP	403	&queue_discard_max_entry.attr,
98262f27	404	&queue_discard_zeroes_data_entry.attr,
1308835f	405	&queue_nonrot_entry.attr,
ac9fafa1	406	&queue_nomerges_entry.attr,
c7c22e4d	407	&queue_rq_affinity_entry.attr,
bc58ba94	408	&queue_iostats_entry.attr,
e2e1a148	409	&queue_random_entry.attr,
8324aa91 JA	410	NULL,
	411	};
	412
	413	#define to_queue(atr) container_of((atr), struct queue_sysfs_entry, attr)
	414
	415	static ssize_t
	416	queue_attr_show(struct kobject kobj, struct attribute attr, char *page)
	417	{
	418	struct queue_sysfs_entry *entry = to_queue(attr);
	419	struct request_queue *q =
	420	container_of(kobj, struct request_queue, kobj);
	421	ssize_t res;
	422
	423	if (!entry->show)
	424	return -EIO;
	425	mutex_lock(&q->sysfs_lock);
	426	if (test_bit(QUEUE_FLAG_DEAD, &q->queue_flags)) {
	427	mutex_unlock(&q->sysfs_lock);
	428	return -ENOENT;
	429	}
	430	res = entry->show(q, page);
	431	mutex_unlock(&q->sysfs_lock);
	432	return res;
	433	}
	434
	435	static ssize_t
	436	queue_attr_store(struct kobject kobj, struct attribute attr,
	437	const char *page, size_t length)
	438	{
	439	struct queue_sysfs_entry *entry = to_queue(attr);
6728cb0e	440	struct request_queue *q;
8324aa91 JA	441	ssize_t res;
	442
	443	if (!entry->store)
	444	return -EIO;
6728cb0e JA	445
6728cb0e JA	446	q = container_of(kobj, struct request_queue, kobj);
8324aa91 JA	447	mutex_lock(&q->sysfs_lock);
	448	if (test_bit(QUEUE_FLAG_DEAD, &q->queue_flags)) {
	449	mutex_unlock(&q->sysfs_lock);
	450	return -ENOENT;
	451	}
	452	res = entry->store(q, page, length);
	453	mutex_unlock(&q->sysfs_lock);
	454	return res;
	455	}
	456
	457	/**
	458	* blk_cleanup_queue: - release a &struct request_queue when it is no longer needed
	459	* @kobj: the kobj belonging of the request queue to be released
	460	*
	461	* Description:
	462	* blk_cleanup_queue is the pair to blk_init_queue() or
	463	* blk_queue_make_request(). It should be called when a request queue is
	464	* being released; typically when a block device is being de-registered.
	465	* Currently, its primary task it to free all the &struct request
	466	* structures that were allocated to the queue and the queue itself.
	467	*
	468	* Caveat:
	469	* Hopefully the low level driver will have finished any
	470	* outstanding requests first...
	471	**/
	472	static void blk_release_queue(struct kobject *kobj)
	473	{
	474	struct request_queue *q =
	475	container_of(kobj, struct request_queue, kobj);
	476	struct request_list *rl = &q->rq;
	477
	478	blk_sync_queue(q);
	479
	480	if (rl->rq_pool)
	481	mempool_destroy(rl->rq_pool);
	482
	483	if (q->queue_tags)
	484	__blk_queue_free_tags(q);
	485
	486	blk_trace_shutdown(q);
	487
	488	bdi_destroy(&q->backing_dev_info);
	489	kmem_cache_free(blk_requestq_cachep, q);
	490	}
	491
52cf25d0	492	static const struct sysfs_ops queue_sysfs_ops = {
8324aa91 JA	493	.show = queue_attr_show,
	494	.store = queue_attr_store,
	495	};
	496
	497	struct kobj_type blk_queue_ktype = {
	498	.sysfs_ops = &queue_sysfs_ops,
	499	.default_attrs = default_attrs,
	500	.release = blk_release_queue,
	501	};
	502
	503	int blk_register_queue(struct gendisk *disk)
	504	{
	505	int ret;
1d54ad6d	506	struct device *dev = disk_to_dev(disk);
8324aa91 JA	507	struct request_queue *q = disk->queue;
8324aa91 JA	508
fb199746	509	if (WARN_ON(!q))
8324aa91 JA	510	return -ENXIO;
8324aa91 JA	511
1d54ad6d LZ	512	ret = blk_trace_init_sysfs(dev);
	513	if (ret)
	514	return ret;
	515
c9059598	516	ret = kobject_add(&q->kobj, kobject_get(&dev->kobj), "%s", "queue");
ed5302d3 LY	517	if (ret < 0) {
ed5302d3 LY	518	blk_trace_remove_sysfs(dev);
8324aa91	519	return ret;
ed5302d3	520	}
8324aa91 JA	521
	522	kobject_uevent(&q->kobj, KOBJ_ADD);
	523
cd43e26f MP	524	if (!q->request_fn)
	525	return 0;
	526
8324aa91 JA	527	ret = elv_register_queue(q);
	528	if (ret) {
	529	kobject_uevent(&q->kobj, KOBJ_REMOVE);
	530	kobject_del(&q->kobj);
80656b67	531	blk_trace_remove_sysfs(dev);
c87ffbb8	532	kobject_put(&dev->kobj);
8324aa91 JA	533	return ret;
	534	}
	535
	536	return 0;
	537	}
	538
	539	void blk_unregister_queue(struct gendisk *disk)
	540	{
	541	struct request_queue *q = disk->queue;
	542
fb199746 AM	543	if (WARN_ON(!q))
	544	return;
	545
48c0d4d4	546	if (q->request_fn)
8324aa91 JA	547	elv_unregister_queue(q);
8324aa91 JA	548
48c0d4d4 ZK	549	kobject_uevent(&q->kobj, KOBJ_REMOVE);
	550	kobject_del(&q->kobj);
	551	blk_trace_remove_sysfs(disk_to_dev(disk));
	552	kobject_put(&disk_to_dev(disk)->kobj);
8324aa91	553	}