blk-sysfs.c 14.8 KB
Newer Older
1 2 3 4
/*
 * Functions related to sysfs handling
 */
#include <linux/kernel.h>
5
#include <linux/slab.h>
6 7 8 9 10 11 12 13 14 15 16 17 18 19
#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
20
queue_var_show(unsigned long var, char *page)
21
{
22
	return sprintf(page, "%lu\n", var);
23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43
}

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;
44 45 46 47 48 49
	int ret;

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

	ret = queue_var_store(&nr, page, count);
50 51 52 53 54 55 56
	if (nr < BLKDEV_MIN_RQ)
		nr = BLKDEV_MIN_RQ;

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

57 58 59 60 61 62 63 64 65 66 67 68
	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);
69
	} else {
70 71
		blk_clear_queue_full(q, BLK_RW_SYNC);
		wake_up(&rl->wait[BLK_RW_SYNC]);
72 73
	}

74 75
	if (rl->count[BLK_RW_ASYNC] >= q->nr_requests) {
		blk_set_queue_full(q, BLK_RW_ASYNC);
76
	} else {
77 78
		blk_clear_queue_full(q, BLK_RW_ASYNC);
		wake_up(&rl->wait[BLK_RW_ASYNC]);
79 80 81 82 83 84 85
	}
	spin_unlock_irq(q->queue_lock);
	return ret;
}

static ssize_t queue_ra_show(struct request_queue *q, char *page)
{
86 87
	unsigned long ra_kb = q->backing_dev_info.ra_pages <<
					(PAGE_CACHE_SHIFT - 10);
88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104

	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)
{
105
	int max_sectors_kb = queue_max_sectors(q) >> 1;
106 107 108 109

	return queue_var_show(max_sectors_kb, (page));
}

110 111 112 113 114
static ssize_t queue_max_segments_show(struct request_queue *q, char *page)
{
	return queue_var_show(queue_max_segments(q), (page));
}

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

120 121
static ssize_t queue_max_segment_size_show(struct request_queue *q, char *page)
{
122
	if (blk_queue_cluster(q))
123 124 125 126 127
		return queue_var_show(queue_max_segment_size(q), (page));

	return queue_var_show(PAGE_CACHE_SIZE, (page));
}

128
static ssize_t queue_logical_block_size_show(struct request_queue *q, char *page)
M
Martin K. Petersen 已提交
129
{
130
	return queue_var_show(queue_logical_block_size(q), page);
M
Martin K. Petersen 已提交
131 132
}

133 134 135 136 137 138 139 140 141 142 143 144 145
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);
M
Martin K. Petersen 已提交
146 147
}

148 149 150 151 152 153 154
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)
{
155 156
	return sprintf(page, "%llu\n",
		       (unsigned long long)q->limits.max_discard_sectors << 9);
157 158
}

159 160 161 162 163
static ssize_t queue_discard_zeroes_data_show(struct request_queue *q, char *page)
{
	return queue_var_show(queue_discard_zeroes_data(q), page);
}

164 165 166 167
static ssize_t
queue_max_sectors_store(struct request_queue *q, const char *page, size_t count)
{
	unsigned long max_sectors_kb,
168
		max_hw_sectors_kb = queue_max_hw_sectors(q) >> 1,
169 170 171 172 173
			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;
174

175
	spin_lock_irq(q->queue_lock);
176
	q->limits.max_sectors = max_sectors_kb << 1;
177 178 179 180 181 182 183
	spin_unlock_irq(q->queue_lock);

	return ret;
}

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

	return queue_var_show(max_hw_sectors_kb, (page));
}

189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212
#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;							\
213 214
}

215 216 217 218
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
219

220 221
static ssize_t queue_nomerges_show(struct request_queue *q, char *page)
{
222 223
	return queue_var_show((blk_queue_nomerges(q) << 1) |
			       blk_queue_noxmerges(q), page);
224 225 226 227 228 229 230 231
}

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

232
	spin_lock_irq(q->queue_lock);
233 234 235
	queue_flag_clear(QUEUE_FLAG_NOMERGES, q);
	queue_flag_clear(QUEUE_FLAG_NOXMERGES, q);
	if (nm == 2)
236
		queue_flag_set(QUEUE_FLAG_NOMERGES, q);
237 238
	else if (nm)
		queue_flag_set(QUEUE_FLAG_NOXMERGES, q);
239
	spin_unlock_irq(q->queue_lock);
240

241 242 243
	return ret;
}

244 245
static ssize_t queue_rq_affinity_show(struct request_queue *q, char *page)
{
246
	bool set = test_bit(QUEUE_FLAG_SAME_COMP, &q->queue_flags);
D
Dan Williams 已提交
247
	bool force = test_bit(QUEUE_FLAG_SAME_FORCE, &q->queue_flags);
248

D
Dan Williams 已提交
249
	return queue_var_show(set << force, page);
250 251 252 253 254 255 256 257 258 259 260
}

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);
261
	if (val == 2) {
262
		queue_flag_set(QUEUE_FLAG_SAME_COMP, q);
263 264 265 266 267
		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) {
D
Dan Williams 已提交
268 269 270
		queue_flag_clear(QUEUE_FLAG_SAME_COMP, q);
		queue_flag_clear(QUEUE_FLAG_SAME_FORCE, q);
	}
271 272 273 274
	spin_unlock_irq(q->queue_lock);
#endif
	return ret;
}
275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298

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,
};

299 300 301 302 303
static struct queue_sysfs_entry queue_max_segments_entry = {
	.attr = {.name = "max_segments", .mode = S_IRUGO },
	.show = queue_max_segments_show,
};

304 305 306 307 308
static struct queue_sysfs_entry queue_max_integrity_segments_entry = {
	.attr = {.name = "max_integrity_segments", .mode = S_IRUGO },
	.show = queue_max_integrity_segments_show,
};

309 310 311 312 313
static struct queue_sysfs_entry queue_max_segment_size_entry = {
	.attr = {.name = "max_segment_size", .mode = S_IRUGO },
	.show = queue_max_segment_size_show,
};

314 315 316 317 318 319
static struct queue_sysfs_entry queue_iosched_entry = {
	.attr = {.name = "scheduler", .mode = S_IRUGO | S_IWUSR },
	.show = elv_iosched_show,
	.store = elv_iosched_store,
};

M
Martin K. Petersen 已提交
320 321
static struct queue_sysfs_entry queue_hw_sector_size_entry = {
	.attr = {.name = "hw_sector_size", .mode = S_IRUGO },
322 323 324 325 326 327
	.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,
M
Martin K. Petersen 已提交
328 329
};

330 331 332 333 334 335 336 337 338 339 340 341 342
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,
M
Martin K. Petersen 已提交
343 344
};

345 346 347 348 349 350 351 352 353 354
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,
};

355 356 357 358 359
static struct queue_sysfs_entry queue_discard_zeroes_data_entry = {
	.attr = {.name = "discard_zeroes_data", .mode = S_IRUGO },
	.show = queue_discard_zeroes_data_show,
};

360 361
static struct queue_sysfs_entry queue_nonrot_entry = {
	.attr = {.name = "rotational", .mode = S_IRUGO | S_IWUSR },
362 363
	.show = queue_show_nonrot,
	.store = queue_store_nonrot,
364 365
};

366 367 368 369 370 371
static struct queue_sysfs_entry queue_nomerges_entry = {
	.attr = {.name = "nomerges", .mode = S_IRUGO | S_IWUSR },
	.show = queue_nomerges_show,
	.store = queue_nomerges_store,
};

372 373 374 375 376 377
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,
};

378 379
static struct queue_sysfs_entry queue_iostats_entry = {
	.attr = {.name = "iostats", .mode = S_IRUGO | S_IWUSR },
380 381
	.show = queue_show_iostats,
	.store = queue_store_iostats,
382 383
};

384 385
static struct queue_sysfs_entry queue_random_entry = {
	.attr = {.name = "add_random", .mode = S_IRUGO | S_IWUSR },
386 387
	.show = queue_show_random,
	.store = queue_store_random,
388 389
};

390 391 392 393 394
static struct attribute *default_attrs[] = {
	&queue_requests_entry.attr,
	&queue_ra_entry.attr,
	&queue_max_hw_sectors_entry.attr,
	&queue_max_sectors_entry.attr,
395
	&queue_max_segments_entry.attr,
396
	&queue_max_integrity_segments_entry.attr,
397
	&queue_max_segment_size_entry.attr,
398
	&queue_iosched_entry.attr,
M
Martin K. Petersen 已提交
399
	&queue_hw_sector_size_entry.attr,
400
	&queue_logical_block_size_entry.attr,
401 402 403
	&queue_physical_block_size_entry.attr,
	&queue_io_min_entry.attr,
	&queue_io_opt_entry.attr,
404 405
	&queue_discard_granularity_entry.attr,
	&queue_discard_max_entry.attr,
406
	&queue_discard_zeroes_data_entry.attr,
407
	&queue_nonrot_entry.attr,
408
	&queue_nomerges_entry.attr,
409
	&queue_rq_affinity_entry.attr,
410
	&queue_iostats_entry.attr,
411
	&queue_random_entry.attr,
412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427
	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);
T
Tejun Heo 已提交
428
	if (blk_queue_dead(q)) {
429 430 431 432 433 434 435 436 437 438 439 440 441
		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);
442
	struct request_queue *q;
443 444 445 446
	ssize_t res;

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

	q = container_of(kobj, struct request_queue, kobj);
449
	mutex_lock(&q->sysfs_lock);
T
Tejun Heo 已提交
450
	if (blk_queue_dead(q)) {
451 452 453 454 455 456 457 458 459
		mutex_unlock(&q->sysfs_lock);
		return -ENOENT;
	}
	res = entry->store(q, page, length);
	mutex_unlock(&q->sysfs_lock);
	return res;
}

/**
460 461
 * 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
462 463
 *
 * Description:
464
 *     blk_release_queue is the pair to blk_init_queue() or
465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481
 *     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);

482 483 484 485
	if (q->elevator) {
		spin_lock_irq(q->queue_lock);
		ioc_clear_queue(q);
		spin_unlock_irq(q->queue_lock);
486
		elevator_exit(q->elevator);
487
	}
488 489 490

	blk_throtl_exit(q);

491 492 493 494 495 496
	if (rl->rq_pool)
		mempool_destroy(rl->rq_pool);

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

497
	blk_throtl_release(q);
498 499 500
	blk_trace_shutdown(q);

	bdi_destroy(&q->backing_dev_info);
501 502

	ida_simple_remove(&blk_queue_ida, q->id);
503 504 505
	kmem_cache_free(blk_requestq_cachep, q);
}

506
static const struct sysfs_ops queue_sysfs_ops = {
507 508 509 510 511 512 513 514 515 516 517 518 519
	.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;
520
	struct device *dev = disk_to_dev(disk);
521 522
	struct request_queue *q = disk->queue;

523
	if (WARN_ON(!q))
524 525
		return -ENXIO;

526 527 528 529
	ret = blk_trace_init_sysfs(dev);
	if (ret)
		return ret;

530
	ret = kobject_add(&q->kobj, kobject_get(&dev->kobj), "%s", "queue");
531 532
	if (ret < 0) {
		blk_trace_remove_sysfs(dev);
533
		return ret;
534
	}
535 536 537

	kobject_uevent(&q->kobj, KOBJ_ADD);

538 539 540
	if (!q->request_fn)
		return 0;

541 542 543 544
	ret = elv_register_queue(q);
	if (ret) {
		kobject_uevent(&q->kobj, KOBJ_REMOVE);
		kobject_del(&q->kobj);
545
		blk_trace_remove_sysfs(dev);
546
		kobject_put(&dev->kobj);
547 548 549 550 551 552 553 554 555 556
		return ret;
	}

	return 0;
}

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

557 558 559
	if (WARN_ON(!q))
		return;

560
	if (q->request_fn)
561 562
		elv_unregister_queue(q);

563 564 565 566
	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);
567
}