[linux.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"
#include "blk-cgroup.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;
	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);

	/* congestion isn't cgroup aware and follows root blkcg for now */
	rl = &q->root_rl;

	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);

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

		if (rl->count[BLK_RW_ASYNC] >= q->nr_requests) {
			blk_set_rl_full(rl, BLK_RW_ASYNC);
		} else {
			blk_clear_rl_full(rl, 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 == 2) {
		queue_flag_set(QUEUE_FLAG_SAME_COMP, q);
		queue_flag_set(QUEUE_FLAG_SAME_FORCE, q);
	} else if (val == 1) {
		queue_flag_set(QUEUE_FLAG_SAME_COMP, q);
		queue_flag_clear(QUEUE_FLAG_SAME_FORCE, q);
	} else if (val == 0) {
		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 (blk_queue_dead(q)) {
		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 (blk_queue_dead(q)) {
		mutex_unlock(&q->sysfs_lock);
		return -ENOENT;
	}
	res = entry->store(q, page, length);
	mutex_unlock(&q->sysfs_lock);
	return res;
}

/**
 * blk_release_queue: - release a &struct request_queue when it is no longer needed
 * @kobj:    the kobj belonging to the request queue to be released
 *
 * Description:
 *     blk_release_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);

	blk_sync_queue(q);

	blkcg_exit_queue(q);

	if (q->elevator) {
		spin_lock_irq(q->queue_lock);
		ioc_clear_queue(q);
		spin_unlock_irq(q->queue_lock);
		elevator_exit(q->elevator);
	}

	blk_exit_rl(&q->root_rl);

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

	blk_trace_shutdown(q);

	bdi_destroy(&q->backing_dev_info);

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