blk-sysfs.c 16.0 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
#include <linux/module.h>
#include <linux/bio.h>
#include <linux/blkdev.h>
#include <linux/blktrace_api.h>
10
#include <linux/blk-mq.h>
11 12

#include "blk.h"
13
#include "blk-cgroup.h"
14 15 16 17 18 19 20 21

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
22
queue_var_show(unsigned long var, char *page)
23
{
24
	return sprintf(page, "%lu\n", var);
25 26 27 28 29
}

static ssize_t
queue_var_store(unsigned long *var, const char *page, size_t count)
{
30 31 32
	int err;
	unsigned long v;

33
	err = kstrtoul(page, 10, &v);
34 35 36 37
	if (err || v > UINT_MAX)
		return -EINVAL;

	*var = v;
38 39 40 41 42 43 44 45 46 47 48 49

	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)
{
50
	struct request_list *rl;
51
	unsigned long nr;
52 53 54 55 56 57
	int ret;

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

	ret = queue_var_store(&nr, page, count);
58 59 60
	if (ret < 0)
		return ret;

61 62 63 64 65 66 67
	if (nr < BLKDEV_MIN_RQ)
		nr = BLKDEV_MIN_RQ;

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

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

71 72 73 74 75 76 77 78 79 80
	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);

81 82 83 84 85 86 87 88 89 90 91 92 93 94
	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]);
		}
95 96 97 98 99 100 101 102
	}

	spin_unlock_irq(q->queue_lock);
	return ret;
}

static ssize_t queue_ra_show(struct request_queue *q, char *page)
{
103 104
	unsigned long ra_kb = q->backing_dev_info.ra_pages <<
					(PAGE_CACHE_SHIFT - 10);
105 106 107 108 109 110 111 112 113 114

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

115 116 117
	if (ret < 0)
		return ret;

118 119 120 121 122 123 124
	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)
{
125
	int max_sectors_kb = queue_max_sectors(q) >> 1;
126 127 128 129

	return queue_var_show(max_sectors_kb, (page));
}

130 131 132 133 134
static ssize_t queue_max_segments_show(struct request_queue *q, char *page)
{
	return queue_var_show(queue_max_segments(q), (page));
}

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

140 141
static ssize_t queue_max_segment_size_show(struct request_queue *q, char *page)
{
142
	if (blk_queue_cluster(q))
143 144 145 146 147
		return queue_var_show(queue_max_segment_size(q), (page));

	return queue_var_show(PAGE_CACHE_SIZE, (page));
}

148
static ssize_t queue_logical_block_size_show(struct request_queue *q, char *page)
M
Martin K. Petersen 已提交
149
{
150
	return queue_var_show(queue_logical_block_size(q), page);
M
Martin K. Petersen 已提交
151 152
}

153 154 155 156 157 158 159 160 161 162 163 164 165
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 已提交
166 167
}

168 169 170 171 172 173 174
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)
{
175 176
	return sprintf(page, "%llu\n",
		       (unsigned long long)q->limits.max_discard_sectors << 9);
177 178
}

179 180 181 182 183
static ssize_t queue_discard_zeroes_data_show(struct request_queue *q, char *page)
{
	return queue_var_show(queue_discard_zeroes_data(q), page);
}

184 185 186 187 188 189 190
static ssize_t queue_write_same_max_show(struct request_queue *q, char *page)
{
	return sprintf(page, "%llu\n",
		(unsigned long long)q->limits.max_write_same_sectors << 9);
}


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

199 200 201
	if (ret < 0)
		return ret;

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

205
	spin_lock_irq(q->queue_lock);
206
	q->limits.max_sectors = max_sectors_kb << 1;
207 208 209 210 211 212 213
	spin_unlock_irq(q->queue_lock);

	return ret;
}

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

	return queue_var_show(max_hw_sectors_kb, (page));
}

219 220 221 222 223 224 225 226 227 228 229 230 231 232
#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);			\
233 234
	if (ret < 0)							\
		 return ret;						\
235 236 237 238 239 240 241 242 243 244
	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;							\
245 246
}

247 248 249 250
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
251

252 253
static ssize_t queue_nomerges_show(struct request_queue *q, char *page)
{
254 255
	return queue_var_show((blk_queue_nomerges(q) << 1) |
			       blk_queue_noxmerges(q), page);
256 257 258 259 260 261 262 263
}

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

264 265 266
	if (ret < 0)
		return ret;

267
	spin_lock_irq(q->queue_lock);
268 269 270
	queue_flag_clear(QUEUE_FLAG_NOMERGES, q);
	queue_flag_clear(QUEUE_FLAG_NOXMERGES, q);
	if (nm == 2)
271
		queue_flag_set(QUEUE_FLAG_NOMERGES, q);
272 273
	else if (nm)
		queue_flag_set(QUEUE_FLAG_NOXMERGES, q);
274
	spin_unlock_irq(q->queue_lock);
275

276 277 278
	return ret;
}

279 280
static ssize_t queue_rq_affinity_show(struct request_queue *q, char *page)
{
281
	bool set = test_bit(QUEUE_FLAG_SAME_COMP, &q->queue_flags);
D
Dan Williams 已提交
282
	bool force = test_bit(QUEUE_FLAG_SAME_FORCE, &q->queue_flags);
283

D
Dan Williams 已提交
284
	return queue_var_show(set << force, page);
285 286 287 288 289 290 291 292 293 294
}

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);
295 296 297
	if (ret < 0)
		return ret;

298
	spin_lock_irq(q->queue_lock);
299
	if (val == 2) {
300
		queue_flag_set(QUEUE_FLAG_SAME_COMP, q);
301 302 303 304 305
		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 已提交
306 307 308
		queue_flag_clear(QUEUE_FLAG_SAME_COMP, q);
		queue_flag_clear(QUEUE_FLAG_SAME_FORCE, q);
	}
309 310 311 312
	spin_unlock_irq(q->queue_lock);
#endif
	return ret;
}
313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336

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

337 338 339 340 341
static struct queue_sysfs_entry queue_max_segments_entry = {
	.attr = {.name = "max_segments", .mode = S_IRUGO },
	.show = queue_max_segments_show,
};

342 343 344 345 346
static struct queue_sysfs_entry queue_max_integrity_segments_entry = {
	.attr = {.name = "max_integrity_segments", .mode = S_IRUGO },
	.show = queue_max_integrity_segments_show,
};

347 348 349 350 351
static struct queue_sysfs_entry queue_max_segment_size_entry = {
	.attr = {.name = "max_segment_size", .mode = S_IRUGO },
	.show = queue_max_segment_size_show,
};

352 353 354 355 356 357
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 已提交
358 359
static struct queue_sysfs_entry queue_hw_sector_size_entry = {
	.attr = {.name = "hw_sector_size", .mode = S_IRUGO },
360 361 362 363 364 365
	.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 已提交
366 367
};

368 369 370 371 372 373 374 375 376 377 378 379 380
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 已提交
381 382
};

383 384 385 386 387 388 389 390 391 392
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,
};

393 394 395 396 397
static struct queue_sysfs_entry queue_discard_zeroes_data_entry = {
	.attr = {.name = "discard_zeroes_data", .mode = S_IRUGO },
	.show = queue_discard_zeroes_data_show,
};

398 399 400 401 402
static struct queue_sysfs_entry queue_write_same_max_entry = {
	.attr = {.name = "write_same_max_bytes", .mode = S_IRUGO },
	.show = queue_write_same_max_show,
};

403 404
static struct queue_sysfs_entry queue_nonrot_entry = {
	.attr = {.name = "rotational", .mode = S_IRUGO | S_IWUSR },
405 406
	.show = queue_show_nonrot,
	.store = queue_store_nonrot,
407 408
};

409 410 411 412 413 414
static struct queue_sysfs_entry queue_nomerges_entry = {
	.attr = {.name = "nomerges", .mode = S_IRUGO | S_IWUSR },
	.show = queue_nomerges_show,
	.store = queue_nomerges_store,
};

415 416 417 418 419 420
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,
};

421 422
static struct queue_sysfs_entry queue_iostats_entry = {
	.attr = {.name = "iostats", .mode = S_IRUGO | S_IWUSR },
423 424
	.show = queue_show_iostats,
	.store = queue_store_iostats,
425 426
};

427 428
static struct queue_sysfs_entry queue_random_entry = {
	.attr = {.name = "add_random", .mode = S_IRUGO | S_IWUSR },
429 430
	.show = queue_show_random,
	.store = queue_store_random,
431 432
};

433 434 435 436 437
static struct attribute *default_attrs[] = {
	&queue_requests_entry.attr,
	&queue_ra_entry.attr,
	&queue_max_hw_sectors_entry.attr,
	&queue_max_sectors_entry.attr,
438
	&queue_max_segments_entry.attr,
439
	&queue_max_integrity_segments_entry.attr,
440
	&queue_max_segment_size_entry.attr,
441
	&queue_iosched_entry.attr,
M
Martin K. Petersen 已提交
442
	&queue_hw_sector_size_entry.attr,
443
	&queue_logical_block_size_entry.attr,
444 445 446
	&queue_physical_block_size_entry.attr,
	&queue_io_min_entry.attr,
	&queue_io_opt_entry.attr,
447 448
	&queue_discard_granularity_entry.attr,
	&queue_discard_max_entry.attr,
449
	&queue_discard_zeroes_data_entry.attr,
450
	&queue_write_same_max_entry.attr,
451
	&queue_nonrot_entry.attr,
452
	&queue_nomerges_entry.attr,
453
	&queue_rq_affinity_entry.attr,
454
	&queue_iostats_entry.attr,
455
	&queue_random_entry.attr,
456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471
	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);
B
Bart Van Assche 已提交
472
	if (blk_queue_dying(q)) {
473 474 475 476 477 478 479 480 481 482 483 484 485
		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);
486
	struct request_queue *q;
487 488 489 490
	ssize_t res;

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

	q = container_of(kobj, struct request_queue, kobj);
493
	mutex_lock(&q->sysfs_lock);
B
Bart Van Assche 已提交
494
	if (blk_queue_dying(q)) {
495 496 497 498 499 500 501 502
		mutex_unlock(&q->sysfs_lock);
		return -ENOENT;
	}
	res = entry->store(q, page, length);
	mutex_unlock(&q->sysfs_lock);
	return res;
}

T
Tejun Heo 已提交
503 504 505 506 507 508 509
static void blk_free_queue_rcu(struct rcu_head *rcu_head)
{
	struct request_queue *q = container_of(rcu_head, struct request_queue,
					       rcu_head);
	kmem_cache_free(blk_requestq_cachep, q);
}

510
/**
511 512
 * 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
513 514
 *
 * Description:
515
 *     blk_release_queue is the pair to blk_init_queue() or
516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531
 *     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);

532 533
	blkcg_exit_queue(q);

534 535 536 537
	if (q->elevator) {
		spin_lock_irq(q->queue_lock);
		ioc_clear_queue(q);
		spin_unlock_irq(q->queue_lock);
538
		elevator_exit(q->elevator);
539
	}
540

541
	blk_exit_rl(&q->root_rl);
542 543 544 545

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

546 547 548 549 550
	percpu_counter_destroy(&q->mq_usage_counter);

	if (q->mq_ops)
		blk_mq_free_queue(q);

551 552 553
	blk_trace_shutdown(q);

	bdi_destroy(&q->backing_dev_info);
554 555

	ida_simple_remove(&blk_queue_ida, q->id);
T
Tejun Heo 已提交
556
	call_rcu(&q->rcu_head, blk_free_queue_rcu);
557 558
}

559
static const struct sysfs_ops queue_sysfs_ops = {
560 561 562 563 564 565 566 567 568 569 570 571 572
	.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;
573
	struct device *dev = disk_to_dev(disk);
574 575
	struct request_queue *q = disk->queue;

576
	if (WARN_ON(!q))
577 578
		return -ENXIO;

579 580 581 582 583
	/*
	 * Initialization must be complete by now.  Finish the initial
	 * bypass from queue allocation.
	 */
	blk_queue_bypass_end(q);
584
	queue_flag_set_unlocked(QUEUE_FLAG_INIT_DONE, q);
585

586 587 588 589
	ret = blk_trace_init_sysfs(dev);
	if (ret)
		return ret;

590
	ret = kobject_add(&q->kobj, kobject_get(&dev->kobj), "%s", "queue");
591 592
	if (ret < 0) {
		blk_trace_remove_sysfs(dev);
593
		return ret;
594
	}
595 596 597

	kobject_uevent(&q->kobj, KOBJ_ADD);

598 599 600
	if (q->mq_ops)
		blk_mq_register_disk(disk);

601 602 603
	if (!q->request_fn)
		return 0;

604 605 606 607
	ret = elv_register_queue(q);
	if (ret) {
		kobject_uevent(&q->kobj, KOBJ_REMOVE);
		kobject_del(&q->kobj);
608
		blk_trace_remove_sysfs(dev);
609
		kobject_put(&dev->kobj);
610 611 612 613 614 615 616 617 618 619
		return ret;
	}

	return 0;
}

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

620 621 622
	if (WARN_ON(!q))
		return;

623 624 625
	if (q->mq_ops)
		blk_mq_unregister_disk(disk);

626
	if (q->request_fn)
627 628
		elv_unregister_queue(q);

629 630 631 632
	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);
633
}