[net-next-2.6.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 if (rl->count[BLK_RW_SYNC]+1 <= q->nr_requests) {
		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 if (rl->count[BLK_RW_ASYNC]+1 <= q->nr_requests) {
		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_segment_size_show(struct request_queue *q, char *page)
{
	if (test_bit(QUEUE_FLAG_CLUSTER, &q->queue_flags))
		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 queue_var_show(q->limits.max_discard_sectors << 9, page);
}

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

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